diff --git a/dogfooding/index.html b/dogfooding/index.html index 6ad42f6..3e9337a 100644 --- a/dogfooding/index.html +++ b/dogfooding/index.html @@ -1,12 +1,62 @@ -Sent Received Message Ratio

Waku Dogfooding App

Sent

Received

\ No newline at end of file + + + + + + Waku Dogfooding - Refactored + + + + + + +
+
+

Waku Message Center

+
+ Your Peer ID: Connecting... +
+
+ +
+
+

Message Statistics

+
+
+ 0 + Sent by Me +
+
+ 0 + Received (Mine) +
+
+ 0 + Received (Others) +
+
+
+ +
+

Controls

+ +
+ + +
+
+ +
+

Message Log

+
+
+
+
+ + +
+ + + \ No newline at end of file diff --git a/dogfooding/index.js b/dogfooding/index.js index 8a15787..9e8e855 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__={194:e=>{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,i){r[s]=i,++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)}}}},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 i(e,t,n,i,o){if("function"!=typeof n)throw new TypeError("The listener must be a function");var a=new s(n,i||e,o),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 o(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,i=n.length,o=new Array(i);s{"use strict";var n=t,s=r(3262),i=["double","float","int32","uint32","sint32","fixed32","sfixed32","int64","uint64","sint64","fixed64","sfixed64","bool","string","bytes"];function o(e,t){var r=0,n={};for(t|=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{},527:e=>{"use strict";e.exports=h;var t=/[\s{}=;:[\],'"()<>]/g,r=/(?:"([^"\\]*(?:\\.[^"\\]*)*)")/g,n=/(?:'([^'\\]*(?:\\.[^'\\]*)*)')/g,s=/^ *[*/]+ */,i=/^\s*\*?\/*/,o=/\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=[],m=null;function y(e){return Error("illegal "+e+" (line "+d+")")}function w(t){return e.charAt(t)}function b(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(o),g=0;g0)return g.shift();if(m)return function(){var t="'"===m?n:r;t.lastIndex=l-1;var s=t.exec(e);if(!s)throw y("string");return l=t.lastIndex,A(m),m=null,u(s[1])}();var s,i,o,p,f,S=0===l;do{if(l===h)return null;for(s=!1;a.test(o=w(l));)if("\n"===o&&(S=!0,++d),++l===h)return null;if("/"===w(l)){if(++l===h)throw y("comment");if("/"===w(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&&(b(p,l,S),S=!0),d++,s=!0}else{for(f="/"===w(p=l+1);"\n"!==w(++l);)if(l===h)return null;++l,f&&(b(p,l-1,S),S=!0),++d,s=!0}else{if("*"!==(o=w(l)))return"/";p=l+1,f=c||"*"===w(p);do{if("\n"===o&&++d,++l===h)throw y("comment");i=o,o=w(l)}while("*"!==i||"/"!==o);++l,f&&(b(p,l-2,S),S=!0),s=!0}}}while(s);var x=l;if(t.lastIndex=0,!t.test(w(x++)))for(;x{"use strict";const n=r(9939);t.PP=n.EventIterator,n.EventIterator},736:(e,t,r)=>{e.exports=function(e){function t(e){let r,s,i,o=null;function a(...e){if(!a.enabled)return;const n=a,s=Number(new Date),i=s-(r||s);n.diff=i,n.prev=r,n.curr=s,r=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let o=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((r,s)=>{if("%%"===r)return"%";o++;const i=t.formatters[s];if("function"==typeof i){const t=e[o];r=i.call(n,t),e.splice(o,1),o--}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!==o?o:(s!==t.namespaces&&(s=t.namespaces,i=t.enabled(e)),i),set:e=>{o=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,t){let r=0,n=0,s=-1,i=0;for(;r"-"+e))].join(",");return t.enable(""),e},t.enable=function(e){t.save(e),t.namespaces=e,t.names=[],t.skips=[];const r=("string"==typeof e?e:"").trim().replace(" ",",").split(",").filter(Boolean);for(const e of r)"-"===e[0]?t.skips.push(e.slice(1)):t.names.push(e)},t.enabled=function(e){for(const r of t.skips)if(s(e,r))return!1;for(const r of t.names)if(s(e,r))return!0;return!1},t.humanize=r(6585),t.destroy=function(){console.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.")},Object.keys(e).forEach((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";var n=t,s=r(5643),i=r(3262);function o(e,t,r,n){var i=!1;if(t.resolvedType)if(t.resolvedType instanceof s){e("switch(d%s){",n);for(var o=t.resolvedType.values,a=Object.keys(o),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 i=!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":i=!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,i?"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=i.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=i;var n=r(3449);(i.prototype=Object.create(n.prototype)).constructor=i;var s=r(3610);function i(){n.call(this)}function o(e,t,r){e.length<40?s.utf8.write(e,t,r):t.utf8Write?t.utf8Write(e,r):t.write(e,r)}i._configure=function(){i.alloc=s._Buffer_allocUnsafe,i.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(i.writeBytesBuffer,t,e),this},i.prototype.string=function(e){var t=s.Buffer.byteLength(e);return this.uint32(t),t&&this._push(o,t,e),this},i._configure()},1080:(e,t,r)=>{"use strict";e.exports=function(e){for(var t,r=i.codegen(["m","w"],e.name+"$encode")("if(!w)")("w=Writer.create()"),a=e.fieldsArray.slice().sort(i.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?o(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?o(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),i=r(3262);function o(e,t,r,n){return t.delimited?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)}},1176:(e,t,r)=>{var n;!function(){"use strict";var s="input is invalid type",i="object"==typeof window,o=i?window:{};o.JS_SHA3_NO_WINDOW&&(i=!1);var a=!i&&"object"==typeof self;!o.JS_SHA3_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node?o=global:a&&(o=self);for(var c=!o.JS_SHA3_NO_COMMON_JS&&e.exports,l=r.amdO,u=!o.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],m=[128,256],y=["hex","buffer","arrayBuffer","array","digest"],w={128:168,256:136},b=o.JS_SHA3_NO_NODE_JS||!Array.isArray?function(e){return"[object Array]"===Object.prototype.toString.call(e)}:Array.isArray,v=!u||!o.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(!b(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 q(e,t,r){U.call(this,e,t,r)}U.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],i=this.blocks,o=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?(i[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]<=o){for(this.start=r-o,this.block=i[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},U.prototype.encodeString=function(e){var t=E(e);e=t[0];var r=t[1],n=0,s=e.length;if(r)for(var i=0;i=57344?n+=3:(o=65536+((1023&o)<<10|1023&e.charCodeAt(++i)),n+=4)}else n=s;return n+=this.encode(8*n),this.update(e),n},U.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];o%t==0&&(r=A(r),$(r),i=0)}return s&&(e=r[i],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},U.prototype.arrayBuffer=function(){this.finalize();var e,t=this.blockCount,r=this.s,n=this.outputBlocks,s=this.extraBytes,i=0,o=0,a=this.outputBits>>3;e=s?new ArrayBuffer(n+1<<2):new ArrayBuffer(a);for(var c=new Uint32Array(e);o>8&255,c[e+2]=t>>16&255,c[e+3]=t>>24&255;a%r==0&&(n=A(n),$(n))}return i&&(e=a<<2,t=n[o],c[e]=255&t,i>1&&(c[e+1]=t>>8&255),i>2&&(c[e+2]=t>>16&255)),c},q.prototype=new U,q.prototype.finalize=function(){return this.encode(this.outputBits,!0),U.prototype.finalize.call(this)};var $=function(e){var t,r,n,s,i,o,a,c,l,u,h,d,p,g,m,y,w,b,v,E,S,A,x,k,I,_,C,T,P,L,R,O,N,D,M,F,B,U,q,$,j,z,K,H,V,G,W,X,J,Z,Q,Y,ee,te,re,ne,se,ie,oe,ae,ce,le,ue;for(n=0;n<48;n+=2)s=e[0]^e[10]^e[20]^e[30]^e[40],i=e[1]^e[11]^e[21]^e[31]^e[41],o=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])^(o<<1|a>>>31),r=(p=e[9]^e[19]^e[29]^e[39]^e[49])^(a<<1|o>>>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=i^(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=o^(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|i>>>31),r=h^(i<<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],m=e[1],G=e[11]<<4|e[10]>>>28,W=e[10]<<4|e[11]>>>28,T=e[20]<<3|e[21]>>>29,P=e[21]<<3|e[20]>>>29,ae=e[31]<<9|e[30]>>>23,ce=e[30]<<9|e[31]>>>23,z=e[40]<<18|e[41]>>>14,K=e[41]<<18|e[40]>>>14,D=e[2]<<1|e[3]>>>31,M=e[3]<<1|e[2]>>>31,y=e[13]<<12|e[12]>>>20,w=e[12]<<12|e[13]>>>20,X=e[22]<<10|e[23]>>>22,J=e[23]<<10|e[22]>>>22,L=e[33]<<13|e[32]>>>19,R=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,F=e[14]<<6|e[15]>>>26,B=e[15]<<6|e[14]>>>26,b=e[25]<<11|e[24]>>>21,v=e[24]<<11|e[25]>>>21,Z=e[34]<<15|e[35]>>>17,Q=e[35]<<15|e[34]>>>17,O=e[45]<<29|e[44]>>>3,N=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,U=e[26]<<25|e[27]>>>7,q=e[27]<<25|e[26]>>>7,E=e[36]<<21|e[37]>>>11,S=e[37]<<21|e[36]>>>11,Y=e[47]<<24|e[46]>>>8,ee=e[46]<<24|e[47]>>>8,H=e[8]<<27|e[9]>>>5,V=e[9]<<27|e[8]>>>5,_=e[18]<<20|e[19]>>>12,C=e[19]<<20|e[18]>>>12,ie=e[29]<<7|e[28]>>>25,oe=e[28]<<7|e[29]>>>25,$=e[38]<<8|e[39]>>>24,j=e[39]<<8|e[38]>>>24,A=e[48]<<14|e[49]>>>18,x=e[49]<<14|e[48]>>>18,e[0]=g^~y&b,e[1]=m^~w&v,e[10]=k^~_&T,e[11]=I^~C&P,e[20]=D^~F&U,e[21]=M^~B&q,e[30]=H^~G&X,e[31]=V^~W&J,e[40]=te^~ne&ie,e[41]=re^~se&oe,e[2]=y^~b&E,e[3]=w^~v&S,e[12]=_^~T&L,e[13]=C^~P&R,e[22]=F^~U&$,e[23]=B^~q&j,e[32]=G^~X&Z,e[33]=W^~J&Q,e[42]=ne^~ie&ae,e[43]=se^~oe&ce,e[4]=b^~E&A,e[5]=v^~S&x,e[14]=T^~L&O,e[15]=P^~R&N,e[24]=U^~$&z,e[25]=q^~j&K,e[34]=X^~Z&Y,e[35]=J^~Q&ee,e[44]=ie^~ae&le,e[45]=oe^~ce&ue,e[6]=E^~A&g,e[7]=S^~x&m,e[16]=L^~O&k,e[17]=R^~N&I,e[26]=$^~z&D,e[27]=j^~K&M,e[36]=Z^~Y&H,e[37]=Q^~ee&V,e[46]=ae^~le&te,e[47]=ce^~ue&re,e[8]=A^~g&y,e[9]=x^~m&w,e[18]=O^~k&_,e[19]=N^~I&C,e[28]=z^~D&F,e[29]=K^~M&B,e[38]=Y^~H&G,e[39]=ee^~V&W,e[48]=le^~te&ne,e[49]=ue^~re&se,e[0]^=f[n],e[1]^=f[n+1]};if(c)e.exports=L;else{for(O=0;O{"use strict";e.exports=l;var n=r(7209);((l.prototype=Object.create(n.prototype)).constructor=l).className="Field";var s,i=r(5643),o=r(361),a=r(3262),c=/^required|optional|repeated$/;function l(e,t,r,s,i,l,u){if(a.isObject(s)?(u=i,l=s,s=i=void 0):a.isObject(i)&&(u=l,l=i,i=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!==i&&!a.isString(i))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=i||void 0,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!==o.long[r],this.bytes="bytes"===r,this.resolvedType=null,this.extensionField=null,this.declaringField=null,this.comment=u}l.fromJSON=function(e,t){var r=new l(e,t.id,t.type,t.rule,t.extend,t.options,t.comment);return t.edition&&(r._edition=t.edition),r._defaultEdition="proto3",r},Object.defineProperty(l.prototype,"required",{get:function(){return"LEGACY_REQUIRED"===this._features.field_presence}}),Object.defineProperty(l.prototype,"optional",{get:function(){return!this.required}}),Object.defineProperty(l.prototype,"delimited",{get:function(){return this.resolvedType instanceof s&&"DELIMITED"===this._features.message_encoding}}),Object.defineProperty(l.prototype,"packed",{get:function(){return"PACKED"===this._features.repeated_field_encoding}}),Object.defineProperty(l.prototype,"hasPresence",{get:function(){return!this.repeated&&!this.map&&(this.partOf||this.declaringField||this.extensionField||"IMPLICIT"!==this._features.field_presence)}}),l.prototype.setOption=function(e,t,r){return n.prototype.setOption.call(this,e,t,r)},l.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return a.toObject(["edition",this._editionToJSON(),"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=o.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 i&&"string"==typeof this.typeDefault&&(this.typeDefault=this.resolvedType.values[this.typeDefault])),this.options&&(void 0===this.options.packed||!this.resolvedType||this.resolvedType instanceof i||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.prototype._inferLegacyProtoFeatures=function(e){if("proto2"!==e&&"proto3"!==e)return{};var t={};return this.resolve(),"required"===this.rule&&(t.field_presence="LEGACY_REQUIRED"),this.resolvedType instanceof s&&this.resolvedType.group&&(t.message_encoding="DELIMITED"),!0===this.getOption("packed")?t.repeated_field_encoding="PACKED":!1===this.getOption("packed")&&(t.repeated_field_encoding="EXPANDED"),t},l.prototype._resolveFeatures=function(e){return n.prototype._resolveFeatures.call(this,this._edition||e)},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,i){a.decorateType(s.constructor).add(new l(i,e,t,r,{default:n}))}},l._configure=function(e){s=e}},1447:(e,t)=>{"use strict";var r=t;r.length=function(e){for(var t=0,r=0,n=0;n191&&n<224?i[o++]=(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,i[o++]=55296+(n>>10),i[o++]=56320+(1023&n)):i[o++]=(15&n)<<12|(63&e[t++])<<6|63&e[t++],o>8191&&((s||(s=[])).push(String.fromCharCode.apply(String,i)),o=0);return s?(o&&s.push(String.fromCharCode.apply(String,i.slice(0,o))),s.join("")):String.fromCharCode.apply(String,i.slice(0,o))},r.write=function(e,t,r){for(var n,s,i=r,o=0;o>6|192,t[r++]=63&n|128):55296==(64512&n)&&56320==(64512&(s=e.charCodeAt(o+1)))?(n=65536+((1023&n)<<10)+(1023&s),++o,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-i}},1457:(e,t,r)=>{"use strict";e.exports=o;var n=r(7209);((o.prototype=Object.create(n.prototype)).constructor=o).className="OneOf";var s=r(1344),i=r(3262);function o(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},o.prototype.onAdd=function(e){n.prototype.onAdd.call(this,e);for(var t=0;t{"use strict";e.exports=s;var n=r(3610);function s(e,t){this.lo=e>>>0,this.hi=t>>>0}var i=s.zero=new s(0,0);i.toNumber=function(){return 0},i.zzEncode=i.zzDecode=function(){return this},i.length=function(){return 1};var o=s.zeroHash="\0\0\0\0\0\0\0\0";s.fromNumber=function(e){if(0===e)return i;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):i},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===o?i: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}},2549:(e,t,r)=>{"use strict";e.exports=r(9100)},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=i;var n=r(6237);(i.prototype=Object.create(n.prototype)).constructor=i;var s=r(3610);function i(e){n.call(this,e)}i._configure=function(){s.Buffer&&(i.prototype._slice=s.Buffer.prototype.slice)},i.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))},i._configure()},3262:(e,t,r)=>{"use strict";var n,s,i=e.exports=r(3610),o=r(4529);i.codegen=r(8561),i.fetch=r(5212),i.path=r(9207),i.fs=i.inquire("fs"),i.toArray=function(e){if(e){for(var t=Object.keys(e),r=new Array(t.length),n=0;n0)t[i]=e(t[i]||{},r,s);else{var o=t[i];if(o&&n)return t;o&&(s=[].concat(o).concat(s)),t[i]=s}return t}(e,t=t.split("."),r)},Object.defineProperty(i,"decorateRoot",{get:function(){return o.decorated||(o.decorated=new(r(5330)))}})},3449:(e,t,r)=>{"use strict";e.exports=h;var n,s=r(3610),i=s.LongBits,o=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 m(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,i.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=i.from(e);return this._push(g,t.length(),t)},h.prototype.int64=h.prototype.uint64,h.prototype.sint64=function(e){var t=i.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(m,4,e>>>0)},h.prototype.sfixed32=h.prototype.fixed32,h.prototype.fixed64=function(e){var t=i.from(e);return this._push(m,4,t.lo)._push(m,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 y=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=o.length(e));o.decode(e,r,0),e=r}return this.uint32(t)._push(y,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()}},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=i,n.ProtocolError=i("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{function t(e,t){"boolean"==typeof t&&(t={forever:t}),this._originalTimeouts=JSON.parse(JSON.stringify(e)),this._timeouts=e,this._options=t||{},this._maxRetryTime=t&&t.maxRetryTime||1/0,this._fn=null,this._errors=[],this._attempts=1,this._operationTimeout=null,this._operationTimeoutCb=null,this._timeout=null,this._operationStart=null,this._timer=null,this._options.forever&&(this._cachedTimeouts=this._timeouts.slice(0))}e.exports=t,t.prototype.reset=function(){this._attempts=1,this._timeouts=this._originalTimeouts.slice(0)},t.prototype.stop=function(){this._timeout&&clearTimeout(this._timeout),this._timer&&clearTimeout(this._timer),this._timeouts=[],this._cachedTimeouts=null},t.prototype.retry=function(e){if(this._timeout&&clearTimeout(this._timeout),!e)return!1;var t=(new Date).getTime();if(e&&t-this._operationStart>=this._maxRetryTime)return this._errors.push(e),this._errors.unshift(new Error("RetryOperation timeout occurred")),!1;this._errors.push(e);var r=this._timeouts.shift();if(void 0===r){if(!this._cachedTimeouts)return!1;this._errors.splice(0,this._errors.length-1),r=this._cachedTimeouts.slice(-1)}var n=this;return this._timer=setTimeout((function(){n._attempts++,n._operationTimeoutCb&&(n._timeout=setTimeout((function(){n._operationTimeoutCb(n._attempts)}),n._operationTimeout),n._options.unref&&n._timeout.unref()),n._fn(n._attempts)}),r),this._options.unref&&this._timer.unref(),!0},t.prototype.attempt=function(e,t){this._fn=e,t&&(t.timeout&&(this._operationTimeout=t.timeout),t.cb&&(this._operationTimeoutCb=t.cb));var r=this;this._operationTimeoutCb&&(this._timeout=setTimeout((function(){r._operationTimeoutCb()}),r._operationTimeout)),this._operationStart=(new Date).getTime(),this._fn(this._attempts)},t.prototype.try=function(e){console.log("Using RetryOperation.try() is deprecated"),this.attempt(e)},t.prototype.start=function(e){console.log("Using RetryOperation.start() is deprecated"),this.attempt(e)},t.prototype.start=t.prototype.try,t.prototype.errors=function(){return this._errors},t.prototype.attempts=function(){return this._attempts},t.prototype.mainError=function(){if(0===this._errors.length)return null;for(var e={},t=null,r=0,n=0;n=r&&(t=s,r=o)}return 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},4358:e=>{"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";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()},4529:e=>{"use strict";e.exports={}},4863:(e,t,r)=>{"use strict";e.exports=x,x.filename=null,x.defaults={keepCase:!1};var n=r(527),s=r(5330),i=r(7882),o=r(1344),a=r(8252),c=r(1457),l=r(5643),u=r(9687),h=r(8811),d=r(7209),p=r(361),f=r(3262),g=/^[1-9][0-9]*$/,m=/^-?[1-9][0-9]*$/,y=/^0[x][0-9a-fA-F]+$/,w=/^-?0[x][0-9a-fA-F]+$/,b=/^0[0-7]+$/,v=/^-?0[0-7]+$/,E=/^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,S=/^[a-zA-Z_][a-zA-Z_0-9]*$/,A=/^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/;function x(e,t,r){t instanceof s||(r=t,t=new s),r||(r=x.defaults);var k,I,_,C,T=r.preferTrailingComment||!1,P=n(e,r.alternateCommentMode||!1),L=P.next,R=P.push,O=P.peek,N=P.skip,D=P.cmnt,M=!0,F="proto2",B=t,U=[],q={},$=r.keepCase?function(e){return e}:f.camelCase;function j(e,t,r){var n=x.filename;return r||(x.filename=null),Error("illegal "+(t||"token")+" '"+e+"' ("+(n?n+", ":"")+"line "+P.line+")")}function z(){var e,t=[];do{if('"'!==(e=L())&&"'"!==e)throw j(e);t.push(L()),N(e),e=O()}while('"'===e||"'"===e);return t.join("")}function K(e){var t=L();switch(t){case"'":case'"':return R(t),z();case"true":case"TRUE":return!0;case"false":case"FALSE":return!1}try{return function(e){var t=1;switch("-"===e.charAt(0)&&(t=-1,e=e.substring(1)),e){case"inf":case"INF":case"Inf":return t*(1/0);case"nan":case"NAN":case"Nan":case"NaN":return NaN;case"0":return 0}if(g.test(e))return t*parseInt(e,10);if(y.test(e))return t*parseInt(e,16);if(b.test(e))return t*parseInt(e,8);if(E.test(e))return t*parseFloat(e);throw j(e,"number",!0)}(t)}catch(r){if(e&&A.test(t))return t;throw j(t,"value")}}function H(e,t){var r,n;do{if(!t||'"'!==(r=O())&&"'"!==r)try{e.push([n=V(L()),N("to",!0)?V(L()):n])}catch(n){if(!(t&&A.test(r)&&F>=2023))throw n;e.push(r)}else{var s=z();if(e.push(s),F>=2023)throw j(s,"id")}}while(N(",",!0));var i={options:void 0,setOption:function(e,t){void 0===this.options&&(this.options={}),this.options[e]=t}};Q(i,(function(e){if("option"!==e)throw j(e);re(i,e),N(";")}),(function(){ie(i)}))}function V(e,t){switch(e){case"max":case"MAX":case"Max":return 536870911;case"0":return 0}if(!t&&"-"===e.charAt(0))throw j(e,"id");if(m.test(e))return parseInt(e,10);if(w.test(e))return parseInt(e,16);if(v.test(e))return parseInt(e,8);throw j(e,"id")}function G(){if(void 0!==k)throw j("package");if(k=L(),!A.test(k))throw j(k,"name");B=B.define(k),N(";")}function W(){var e,t=O();switch(t){case"weak":e=_||(_=[]),L();break;case"public":L();default:e=I||(I=[])}t=z(),N(";"),e.push(t)}function X(){if(N("="),(F=z())<2023)throw j(F,"syntax");N(";")}function J(){if(N("="),F=z(),!["2023"].includes(F))throw j(F,"edition");N(";")}function Z(e,t){switch(t){case"option":return re(e,t),N(";"),!0;case"message":return Y(e,t),!0;case"enum":return te(e,t),!0;case"service":return function(e,t){if(!S.test(t=L()))throw j(t,"service name");var r=new u(t);Q(r,(function(e){if(!Z(r,e)){if("rpc"!==e)throw j(e);!function(e,t){var r=D(),n=t;if(!S.test(t=L()))throw j(t,"name");var s,i,o,a,c=t;if(N("("),N("stream",!0)&&(i=!0),!A.test(t=L()))throw j(t);if(s=t,N(")"),N("returns"),N("("),N("stream",!0)&&(a=!0),!A.test(t=L()))throw j(t);o=t,N(")");var l=new h(c,n,s,o,i,a);l.comment=r,Q(l,(function(e){if("option"!==e)throw j(e);re(l,e),N(";")})),e.add(l)}(r,e)}})),e.add(r),e===B&&U.push(r)}(e,t),!0;case"extend":return function(e,t){if(!A.test(t=L()))throw j(t,"reference");var r=t;Q(null,(function(t){switch(t){case"required":case"repeated":ee(e,t,r);break;case"optional":ee(e,"proto3"===F?"proto3_optional":"optional",r);break;default:if("proto2"===F||!A.test(t))throw j(t);R(t),ee(e,"optional",r)}}))}(e,t),!0}return!1}function Q(e,t,r){var n=P.line;if(e&&("string"!=typeof e.comment&&(e.comment=D()),e.filename=x.filename),N("{",!0)){for(var s;"}"!==(s=L());)t(s);N(";",!0)}else r&&r(),N(";"),e&&("string"!=typeof e.comment||T)&&(e.comment=D(n)||e.comment)}function Y(e,t){if(!S.test(t=L()))throw j(t,"type name");var r=new i(t);Q(r,(function(e){if(!Z(r,e))switch(e){case"map":!function(e){N("<");var t=L();if(void 0===p.mapKey[t])throw j(t,"type");N(",");var r=L();if(!A.test(r))throw j(r,"type");N(">");var n=L();if(!S.test(n))throw j(n,"name");N("=");var s=new a($(n),V(L()),t,r);Q(s,(function(e){if("option"!==e)throw j(e);re(s,e),N(";")}),(function(){ie(s)})),e.add(s)}(r);break;case"required":if("proto2"!==F)throw j(e);case"repeated":ee(r,e);break;case"optional":if("proto3"===F)ee(r,"proto3_optional");else{if("proto2"!==F)throw j(e);ee(r,"optional")}break;case"oneof":!function(e,t){if(!S.test(t=L()))throw j(t,"name");var r=new c($(t));Q(r,(function(e){"option"===e?(re(r,e),N(";")):(R(e),ee(r,"optional"))})),e.add(r)}(r,e);break;case"extensions":H(r.extensions||(r.extensions=[]));break;case"reserved":H(r.reserved||(r.reserved=[]),!0);break;default:if("proto2"===F||!A.test(e))throw j(e);R(e),ee(r,"optional")}})),e.add(r),e===B&&U.push(r)}function ee(e,t,r){var n=L();if("group"!==n){for(;n.endsWith(".")||O().startsWith(".");)n+=L();if(!A.test(n))throw j(n,"type");var s=L();if(!S.test(s))throw j(s,"name");s=$(s),N("=");var a=new o(s,V(L()),n,t,r);if(Q(a,(function(e){if("option"!==e)throw j(e);re(a,e),N(";")}),(function(){ie(a)})),"proto3_optional"===t){var l=new c("_"+s);a.setOption("proto3_optional",!0),l.add(a),e.add(l)}else e.add(a);e===B&&U.push(a)}else!function(e,t){if(F>=2023)throw j("group");var r=L();if(!S.test(r))throw j(r,"name");var n=f.lcFirst(r);r===n&&(r=f.ucFirst(r)),N("=");var s=V(L()),a=new i(r);a.group=!0;var c=new o(n,s,r,t);c.filename=x.filename,Q(a,(function(e){switch(e){case"option":re(a,e),N(";");break;case"required":case"repeated":ee(a,e);break;case"optional":ee(a,"proto3"===F?"proto3_optional":"optional");break;case"message":Y(a,e);break;case"enum":te(a,e);break;default:throw j(e)}})),e.add(a).add(c)}(e,t)}function te(e,t){if(!S.test(t=L()))throw j(t,"name");var r=new l(t);Q(r,(function(e){switch(e){case"option":re(r,e),N(";");break;case"reserved":H(r.reserved||(r.reserved=[]),!0),void 0===r.reserved&&(r.reserved=[]);break;default:!function(e,t){if(!S.test(t))throw j(t,"name");N("=");var r=V(L(),!0),n={options:void 0,getOption:function(e){return this.options[e]},setOption:function(e,t){d.prototype.setOption.call(n,e,t)},setParsedOption:function(){}};Q(n,(function(e){if("option"!==e)throw j(e);re(n,e),N(";")}),(function(){ie(n)})),e.add(t,r,n.comment,n.parsedOptions||n.options)}(r,e)}})),e.add(r),e===B&&U.push(r)}function re(e,t){var r,n,s=!0;for("option"===t&&(t=L());"="!==t;){if("("===t){var i=L();N(")"),t="("+i+")"}if(s){if(s=!1,t.includes(".")&&!t.includes("(")){var o=t.split(".");r=o[0]+".",t=o[1];continue}r=t}else n=n?n+=t:t;t=L()}var a=ne(e,n?r.concat(n):r);n=n&&"."===n[0]?n.slice(1):n,function(e,t,r,n){e.setParsedOption&&e.setParsedOption(t,r,n)}(e,r=r&&"."===r[r.length-1]?r.slice(0,-1):r,a,n)}function ne(e,t){if(N("{",!0)){for(var r={};!N("}",!0);){if(!S.test(C=L()))throw j(C,"name");if(null===C)throw j(C,"end of input");var n,s=C;if(N(":",!0),"{"===O())n=ne(e,t+"."+C);else if("["===O()){var i;if(n=[],N("[",!0)){do{i=K(!0),n.push(i)}while(N(",",!0));N("]"),void 0!==i&&se(e,t+"."+C,i)}}else n=K(!0),se(e,t+"."+C,n);var o=r[s];o&&(n=[].concat(o).concat(n)),r[s]=n,N(",",!0),N(";",!0)}return r}var a=K(!0);return se(e,t,a),a}function se(e,t,r){B===e&&/^features\./.test(t)?q[t]=r:e.setOption&&e.setOption(t,r)}function ie(e){if(N("[",!0)){do{re(e,"option")}while(N(",",!0));N("]")}return e}for(;null!==(C=L());)switch(C){case"package":if(!M)throw j(C);G();break;case"import":if(!M)throw j(C);W();break;case"syntax":if(!M)throw j(C);X();break;case"edition":if(!M)throw j(C);J();break;case"option":re(B,C),N(";",!0);break;default:if(Z(B,C)){M=!1;continue}throw j(C)}return U.forEach((e=>{e._edition=F,Object.keys(q).forEach((t=>{void 0===e.getOption(t)&&e.setOption(t,q[t],!0)}))})),x.filename=null,{package:k,imports:I,weakImports:_,root:t}}},5047:(e,t,r)=>{"use strict";t.Service=r(7595)},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}},5212:(e,t,r)=>{"use strict";e.exports=i;var n=r(8045),s=r(4153)("fs");function i(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?i.xhr(e,t,r):n?r(n):r(null,t.binary?s:s.toString("utf8"))})):i.xhr(e,t,r):n(i,this,e,t)}i.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";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)},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,i,o,a=r(1344),c=r(5643),l=r(1457),u=r(3262);function h(e){n.call(this,"",e),this.deferred=[],this.files=[],this._edition="proto2"}function d(){}h.fromJSON=function(e,t){return t||(t=new h),e.options&&t.setOptions(e.options),t.addJSON(e.nested).resolveAll()},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,t&&t.resolveAll(),r(e,t)}}function l(e){var t=e.lastIndexOf("google/protobuf/");if(t>-1){var r=e.substring(t);if(r in o)return r}return null}function h(e,t){try{if(u.isString(t)&&"{"===t.charAt(0)&&(t=JSON.parse(t)),u.isString(t)){i.filename=e;var n,o=i(t,s,r),h=0;if(o.imports)for(;h-1))if(s.files.push(e),e in o)a?h(e,o[e]):(++f,setTimeout((function(){--f,h(e,o[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,i){--f,n&&(r?t?f||c(null,s):c(r):h(e,i))}))}var f=0;u.isString(t)&&(t=[t]);for(var g,m=0;m-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>>24,(e&255<<16)>>>16,(65280&e)>>>8,255&e].join(".")},a=function(e){var t,n,s,i,o,a;for(t=[],s=i=0;i<=3&&0!==e.length;s=++i){if(s>0){if("."!==e[0])throw new Error("Invalid IP");e=e.substring(1)}o=(a=r(e))[0],n=a[1],e=e.substring(n),t.push(o)}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"),o=n("a"),i=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])-o)>>>0;else{if(!("A"<=e[a]&&e[a]<="F"))break;c=c*t+(10+n(e[a])-i)>>>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)},5617:(e,t,r)=>{e.exports=r(8303)},5643:(e,t,r)=>{"use strict";e.exports=o;var n=r(7209);((o.prototype=Object.create(n.prototype)).constructor=o).className="Enum";var s=r(8923),i=r(3262);function o(e,t,r,s,i,o){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=i||{},this.valuesOptions=o,this._valuesFeatures={},this.reserved=void 0,t)for(var a=Object.keys(t),c=0;c{var t=Object.assign({},this._features);this._valuesFeatures[e]=Object.assign(t,this.valuesOptions&&this.valuesOptions[e]&&this.valuesOptions[e].features)})),this},o.fromJSON=function(e,t){var r=new o(e,t.values,t.options,t.comment,t.comments);return r.reserved=t.reserved,t.edition&&(r._edition=t.edition),r._defaultEdition="proto3",r},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return i.toObject(["edition",this._editionToJSON(),"options",this.options,"valuesOptions",this.valuesOptions,"values",this.values,"reserved",this.reserved&&this.reserved.length?this.reserved:void 0,"comment",t?this.comment:void 0,"comments",t?this.comments:void 0])},o.prototype.add=function(e,t,r,n){if(!i.isString(e))throw TypeError("name must be a string");if(!i.isInteger(t))throw TypeError("id must be an integer");if(void 0!==this.values[e])throw Error("duplicate name '"+e+"' in "+this);if(this.isReservedId(t))throw Error("id "+t+" is reserved in "+this);if(this.isReservedName(e))throw Error("name '"+e+"' is reserved in "+this);if(void 0!==this.valuesById[t]){if(!this.options||!this.options.allow_alias)throw Error("duplicate id "+t+" in "+this);this.values[e]=t}else this.valuesById[this.values[e]=t]=e;return n&&(void 0===this.valuesOptions&&(this.valuesOptions={}),this.valuesOptions[e]=n||null),this.comments[e]=r||null,this},o.prototype.remove=function(e){if(!i.isString(e))throw TypeError("name must be a string");var t=this.values[e];if(null==t)throw Error("name '"+e+"' does not exist in "+this);return delete this.valuesById[t],delete this.values[e],delete this.comments[e],this.valuesOptions&&delete this.valuesOptions[e],this},o.prototype.isReservedId=function(e){return s.isReservedId(this.reserved,e)},o.prototype.isReservedName=function(e){return s.isReservedName(this.reserved,e)}},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,i=r.amdO,o="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,i,o,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|i>>>1),u[h++]=255&(i<<7|o<<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++)],i=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|i>>>1)):7===g&&(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],i=a[e.charAt(p++)],o=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|i>>>1),u[h++]=255&(i<<7|o<<2|c>>>3)),u},h=function(e,t){if(!t)return function(e){for(var t,r,n="",s=e.length,i=0,o=0;i191&&t<=223?(r=31&t,o=1):t<=239?(r=15&t,o=2):t<=247?(r=7&t,o=3):l(i,n);for(var a=0;a191)&&l(i,n),r<<=6,r+=63&t;r>=55296&&r<=57343&&l(i,n),r>1114111&&l(i,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,i,o,c,h,d,p="",f=e.indexOf("=");-1===f&&(f=e.length);for(var g=0,m=f>>3<<3;g>>2))+String.fromCharCode(255&(n<<6|s<<1|i>>>4))+String.fromCharCode(255&(i<<4|o>>>1))+String.fromCharCode(255&(o<<7|c<<2|h>>>3))+String.fromCharCode(255&(h<<5|d));var y=f-m;return 2===y?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))):4===y?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],i=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|i>>>4))):5===y?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],i=a[e.charAt(g++)],o=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|i>>>4))+String.fromCharCode(255&(i<<4|o>>>1))):7===y&&(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],i=a[e.charAt(g++)],o=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|i>>>4))+String.fromCharCode(255&(i<<4|o>>>1))+String.fromCharCode(255&(o<<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,i,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[31&(s<<3|i>>>5)]+o[31&i];var h=c-u;return 1===h?(t=e[l],a+=o[t>>>3]+o[t<<2&31]+"======"):2===h?(t=e[l++],r=e[l],a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[r<<4&31]+"===="):3===h?(t=e[l++],r=e[l++],n=e[l],a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[n<<1&31]+"==="):4===h&&(t=e[l++],r=e[l++],n=e[l++],s=e[l],a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[s<<3&31]+"="),a}(e):t?function(e){for(var t,r,n,s,i,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[31&(s<<3|i>>>5)]+o[31&i];var h=c-u;return 1===h?(t=e.charCodeAt(l),a+=o[t>>>3]+o[t<<2&31]+"======"):2===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l),a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[r<<4&31]+"===="):3===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l),a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[n<<1&31]+"==="):4===h&&(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l++),s=e.charCodeAt(l),a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[s<<3&31]+"="),a}(e):function(e){var t,r,n,s,i,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],i=c[4],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[31&(s<<3|i>>>5)]+o[31&i]):1===l?h+=o[t>>>3]+o[t<<2&31]+"======":2===l?(r=c[1],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[r<<4&31]+"===="):3===l?(r=c[1],n=c[2],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[n<<1&31]+"==="):(r=c[1],n=c[2],s=c[3],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[s<<3&31]+"=")}while(!u);return h}(e)},decode:h};h.asBytes=u,s?e.exports=d:(t.base32=d,i&&(void 0===(n=function(){return d}.call(d,r,d,e))||(e.exports=n)))}()},6237:(e,t,r)=>{"use strict";e.exports=c;var n,s=r(3610),i=s.LongBits,o=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 i(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 i(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 o.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)}})}},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}},6434:(e,t,r)=>{"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 i=this.lookup(n);i&&(e=i.decode(e.value))}if(!(e instanceof this.ctor)&&e instanceof s){var o=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),o["@type"]=n,o}return this.toObject(e,t)}}},6585:e=>{var t=1e3,r=60*t,n=60*r,s=24*n,i=7*s;function o(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 o=/^(-?(?:\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(o){var a=parseFloat(o[1]);switch((o[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*a;case"weeks":case"week":case"w":return a*i;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?o(c,l,s,"day"):l>=n?o(c,l,n,"hour"):l>=r?o(c,l,r,"minute"):l>=t?o(c,l,t,"second"):c+" ms"):function(e){var i=Math.abs(e);return i>=s?Math.round(e/s)+"d":i>=n?Math.round(e/n)+"h":i>=r?Math.round(e/r)+"m":i>=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))}},6864:function(e,t,r){"use strict";const n=r(6368),{hasOwnProperty:s}=Object.prototype,{propertyIsEnumerable:i}=Object,o=(e,t,r)=>Object.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)i.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=>{o(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=>{o(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)?o(e,r,p(e[r],t[r],n)):o(e,r,u(t[r])))})),e),d=(e,t,r)=>{let n=e.slice(0,0),i=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._}},7209:(e,t,r)=>{"use strict";e.exports=l,l.className="ReflectionObject";const n=r(1457);var s,i=r(3262),o={enum_type:"OPEN",field_presence:"EXPLICIT",json_format:"ALLOW",message_encoding:"LENGTH_PREFIXED",repeated_field_encoding:"PACKED",utf8_validation:"VERIFY"},a={enum_type:"CLOSED",field_presence:"EXPLICIT",json_format:"LEGACY_BEST_EFFORT",message_encoding:"LENGTH_PREFIXED",repeated_field_encoding:"EXPANDED",utf8_validation:"NONE"},c={enum_type:"OPEN",field_presence:"IMPLICIT",json_format:"ALLOW",message_encoding:"LENGTH_PREFIXED",repeated_field_encoding:"PACKED",utf8_validation:"VERIFY"};function l(e,t){if(!i.isString(e))throw TypeError("name must be a string");if(t&&!i.isObject(t))throw TypeError("options must be an object");this.options=t,this.parsedOptions=null,this.name=e,this._edition=null,this._defaultEdition="proto2",this._features={},this.parent=null,this.resolved=!1,this.comment=null,this.filename=null}Object.defineProperties(l.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(".")}}}),l.prototype.toJSON=function(){throw Error()},l.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 s&&t._handleAdd(this)},l.prototype.onRemove=function(e){var t=e.root;t instanceof s&&t._handleRemove(this),this.parent=null,this.resolved=!1},l.prototype.resolve=function(){return this.resolved||this instanceof s&&(this._resolveFeaturesRecursive(this._edition),this.resolved=!0),this},l.prototype._resolveFeaturesRecursive=function(e){return this._resolveFeatures(this._edition||e)},l.prototype._resolveFeatures=function(e){var t={};if(!e)throw new Error("Unknown edition for "+this.fullName);var r=Object.assign(this.options?Object.assign({},this.options.features):{},this._inferLegacyProtoFeatures(e));if(this._edition){if("proto2"===e)t=Object.assign({},a);else if("proto3"===e)t=Object.assign({},c);else{if("2023"!==e)throw new Error("Unknown edition: "+e);t=Object.assign({},o)}this._features=Object.assign(t,r||{})}else{if(this.partOf instanceof n){var s=Object.assign({},this.partOf._features);this._features=Object.assign(s,r||{})}else if(this.declaringField);else{if(!this.parent)throw new Error("Unable to find a parent for "+this.fullName);var i=Object.assign({},this.parent._features);this._features=Object.assign(i,r||{})}this.extensionField&&(this.extensionField._features=this._features)}},l.prototype._inferLegacyProtoFeatures=function(){return{}},l.prototype.getOption=function(e){if(this.options)return this.options[e]},l.prototype.setOption=function(e,t,r){return this.options||(this.options={}),/^features\./.test(e)?i.setProperty(this.options,e,t,r):r&&void 0!==this.options[e]||(this.getOption(e)!==t&&(this.resolved=!1),this.options[e]=t),this},l.prototype.setParsedOption=function(e,t,r){this.parsedOptions||(this.parsedOptions=[]);var n=this.parsedOptions;if(r){var s=n.find((function(t){return Object.prototype.hasOwnProperty.call(t,e)}));if(s){var o=s[e];i.setProperty(o,r,t)}else(s={})[e]=i.setProperty({},r,t),n.push(s)}else{var a={};a[e]=t,n.push(a)}return this},l.prototype.setOptions=function(e,t){if(e)for(var r=Object.keys(e),n=0;n{"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,i,o){if(!i)throw TypeError("request must be specified");var a=this;if(!o)return n.asPromise(e,a,t,r,s,i);if(a.rpcImpl)try{return a.rpcImpl(t,r[a.requestDelimited?"encodeDelimited":"encode"](i).finish(),(function(e,r){if(e)return a.emit("error",e,t),o(e);if(null!==r){if(!(r instanceof s))try{r=s[a.responseDelimited?"decodeDelimited":"decode"](r)}catch(e){return a.emit("error",e,t),o(e)}return a.emit("data",r,t),o(null,r)}a.end(!0)}))}catch(e){return a.emit("error",e,t),void setTimeout((function(){o(e)}),0)}else setTimeout((function(){o(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}},7728:(e,t,r)=>{"use strict";e.exports=function(e){for(var t=i.codegen(["r","l","e"],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){"),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{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(){if("undefined"!=typeof window&&window.process&&("renderer"===window.process.type||window.process.__nwjs))return!0;if("undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))return!1;let e;return"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&&(e=navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/))&&parseInt(e[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}}},7882:(e,t,r)=>{"use strict";e.exports=w;var n=r(8923);((w.prototype=Object.create(n.prototype)).constructor=w).className="Type";var s=r(5643),i=r(1457),o=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),m=r(744),y=r(6434);function w(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 b(e){return e._fieldsById=e._fieldsArray=e._oneofsArray=null,delete e.encode,delete e.decode,delete e.verify,e}Object.defineProperties(w.prototype,{fieldsById:{get:function(){if(this._fieldsById)return this._fieldsById;this._fieldsById={};for(var e=Object.keys(this.fields),t=0;t{t._resolveFeatures(e)})),this.fieldsArray.forEach((t=>{t._resolveFeatures(e)})),this},w.prototype.get=function(e){return this.fields[e]||this.oneofs&&this.oneofs[e]||this.nested&&this.nested[e]||null},w.prototype.add=function(e){if(this.get(e.name))throw Error("duplicate name '"+e.name+"' in "+this);if(e instanceof o&&void 0===e.extend){if(this._fieldsById?this._fieldsById[e.id]:this.fieldsById[e.id])throw Error("duplicate id "+e.id+" in "+this);if(this.isReservedId(e.id))throw Error("id "+e.id+" is reserved in "+this);if(this.isReservedName(e.name))throw Error("name '"+e.name+"' is reserved in "+this);return e.parent&&e.parent.remove(e),this.fields[e.name]=e,e.message=this,e.onAdd(this),b(this)}return e instanceof i?(this.oneofs||(this.oneofs={}),this.oneofs[e.name]=e,e.onAdd(this),b(this)):n.prototype.add.call(this,e)},w.prototype.remove=function(e){if(e instanceof o&&void 0===e.extend){if(!this.fields||this.fields[e.name]!==e)throw Error(e+" is not a member of "+this);return delete this.fields[e.name],e.parent=null,e.onRemove(this),b(this)}if(e instanceof i){if(!this.oneofs||this.oneofs[e.name]!==e)throw Error(e+" is not a member of "+this);return delete this.oneofs[e.name],e.parent=null,e.onRemove(this),b(this)}return n.prototype.remove.call(this,e)},w.prototype.isReservedId=function(e){return n.isReservedId(this.reserved,e)},w.prototype.isReservedName=function(e){return n.isReservedName(this.reserved,e)},w.prototype.create=function(e){return new this.ctor(e)},w.prototype.setup=function(){for(var e=this.fullName,t=[],r=0;r{"use strict";e.exports=function(e,t){for(var r=new Array(arguments.length-1),n=0,s=2,i=!0;s{"use strict";e.exports=o;var n=r(1344);((o.prototype=Object.create(n.prototype)).constructor=o).className="MapField";var s=r(361),i=r(3262);function o(e,t,r,s,o,a){if(n.call(this,e,t,s,void 0,void 0,o,a),!i.isString(r))throw TypeError("keyType must be a string");this.keyType=r,this.resolvedKeyType=null,this.map=!0}o.fromJSON=function(e,t){return new o(e,t.id,t.keyType,t.type,t.options,t.comment)},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return i.toObject(["keyType",this.keyType,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},o.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)},o.d=function(e,t,r){return"function"==typeof r?r=i.decorateType(r).name:r&&"object"==typeof r&&(r=i.decorateEnum(r).name),function(n,s){i.decorateType(n.constructor).add(new o(s,e,t,r))}}},8303:(e,t,r)=>{var n=r(3961);t.operation=function(e){var r=t.timeouts(e);return new n(r,{forever:e&&(e.forever||e.retries===1/0),unref:e&&e.unref,maxRetryTime:e&&e.maxRetryTime})},t.timeouts=function(e){if(e instanceof Array)return[].concat(e);var t={retries:10,factor:2,minTimeout:1e3,maxTimeout:1/0,randomize:!1};for(var r in e)t[r]=e[r];if(t.minTimeout>t.maxTimeout)throw new Error("minTimeout is greater than maxTimeout");for(var n=[],s=0;s{"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=i();if(t.verbose&&console.log("codegen: "+r),r="return "+r,e){for(var o=Object.keys(e),a=new Array(o.length+1),c=new Array(o.length),l=0;l{"use strict";e.exports=i;var n=r(7209);((i.prototype=Object.create(n.prototype)).constructor=i).className="Method";var s=r(3262);function i(e,t,r,i,o,a,c,l,u){if(s.isObject(o)?(c=o,o=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(i))throw TypeError("responseType must be a string");n.call(this,e,c),this.type=t||"rpc",this.requestType=r,this.requestStream=!!o||void 0,this.responseType=i,this.responseStream=!!a||void 0,this.resolvedRequestType=null,this.resolvedResponseType=null,this.comment=l,this.parsedOptions=u}i.fromJSON=function(e,t){return new i(e,t.type,t.requestType,t.responseType,t.requestStream,t.responseStream,t.options,t.comment,t.parsedOptions)},i.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])},i.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))}},8839:(e,t)=>{"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),i=0;i<64;)s[n[i]=i<26?i+65:i<52?i+71:i<62?i-4:i-59|43]=i++;r.encode=function(e,t,r){for(var s,i=null,o=[],a=0,c=0;t>2],s=(3&l)<<4,c=1;break;case 1:o[a++]=n[s|l>>4],s=(15&l)<<2,c=2;break;case 2:o[a++]=n[s|l>>6],o[a++]=n[63&l],c=0}a>8191&&((i||(i=[])).push(String.fromCharCode.apply(String,o)),a=0)}return c&&(o[a++]=n[s],o[a++]=61,1===c&&(o[a++]=61)),i?(a&&i.push(String.fromCharCode.apply(String,o.slice(0,a))),i.join("")):String.fromCharCode.apply(String,o.slice(0,a))};var o="invalid encoding";r.decode=function(e,t,r){for(var n,i=r,a=0,c=0;c1)break;if(void 0===(l=s[l]))throw Error(o);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(o);return r-i},r.test=function(e){return/^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(e)}},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,i,o,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(){var e=this.nestedArray,t=0;for(this.resolve();t{t._resolveFeaturesRecursive(e)})),this},h.prototype.lookup=function(e,t,r){if("boolean"==typeof t?(r=t,t=void 0):t&&!Array.isArray(t)&&(t=[t]),c.isString(e)&&e.length){if("."===e)return this.root;e=e.split(".")}else if(!e.length)return this;if(""===e[0])return this.root.lookup(e.slice(1),t);var n=this.get(e[0]);if(n){if(1===e.length){if(!t||t.indexOf(n.constructor)>-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";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)},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 i=0;i0&&".."!==t[i-1]?t.splice(--i,2):r?t.splice(i,1):++i:"."===t[i]?t.splice(i,1):++i;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,i=null,o=n;return function(r){if(r<1||r>s)return e(r);o+r>n&&(i=e(n),o=0);var a=t.call(i,o,o+=r);return 7&o&&(o=1+(7|o)),a}}},9410:e=>{"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 i(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 o(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:i,e.writeFloatBE=n?i:s,e.readFloatLE=n?o:a,e.readFloatBE=n?a:o}():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 i=Math.floor(Math.log(t)/Math.LN2);e((s<<31|i+127<<23|8388607&Math.round(t*Math.pow(2,-i)*8388608))>>>0,r,n)}}function o(e,t,r){var n=e(t,r),s=2*(n>>31)+1,i=n>>>23&255,o=8388607&n;return 255===i?o?NaN:s*(1/0):0===i?1401298464324817e-60*s*o:s*Math.pow(2,i-150)*(o+8388608)}e.writeFloatLE=t.bind(null,r),e.writeFloatBE=t.bind(null,n),e.readFloatLE=o.bind(null,s),e.readFloatBE=o.bind(null,i)}(),"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 i(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 o(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:i,e.writeDoubleBE=n?i:s,e.readDoubleLE=n?o:a,e.readDoubleBE=n?a:o}():function(){function t(e,t,r,n,s,i){var o=n<0?1:0;if(o&&(n=-n),0===n)e(0,s,i+t),e(1/n>0?0:2147483648,s,i+r);else if(isNaN(n))e(0,s,i+t),e(2146959360,s,i+r);else if(n>17976931348623157e292)e(0,s,i+t),e((o<<31|2146435072)>>>0,s,i+r);else{var a;if(n<22250738585072014e-324)e((a=n/5e-324)>>>0,s,i+t),e((o<<31|a/4294967296)>>>0,s,i+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,i+t),e((o<<31|c+1023<<20|1048576*a&1048575)>>>0,s,i+r)}}}function o(e,t,r,n,s){var i=e(n,s+t),o=e(n,s+r),a=2*(o>>31)+1,c=o>>>20&2047,l=4294967296*(1048575&o)+i;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=o.bind(null,s,0,4),e.readDoubleBE=o.bind(null,i,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 i(e,t){return(e[t]<<24|e[t+1]<<16|e[t+2]<<8|e[t+3])>>>0}e.exports=t(t)},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),i=r(3262),o=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),i=0;i{t._resolveFeaturesRecursive(e)})),this},a.prototype.add=function(e){if(this.get(e.name))throw Error("duplicate name '"+e.name+"' in "+this);return e instanceof s?(this.methods[e.name]=e,e.parent=this,c(this)):n.prototype.add.call(this,e)},a.prototype.remove=function(e){if(e instanceof s){if(this.methods[e.name]!==e)throw Error(e+" is not a member of "+this);return delete this.methods[e.name],e.parent=null,c(this)}return n.prototype.remove.call(this,e)},a.prototype.create=function(e,t,r){for(var n,s=new o.Service(e,t,r),a=0;a{"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}},__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:()=>re});var t={};__webpack_require__.r(t),__webpack_require__.d(t,{base16:()=>ne,base16upper:()=>se});var r={};__webpack_require__.r(r),__webpack_require__.d(r,{base2:()=>ie});var n={};__webpack_require__.r(n),__webpack_require__.d(n,{base256emoji:()=>le});var s={};__webpack_require__.r(s),__webpack_require__.d(s,{base32:()=>ue,base32hex:()=>fe,base32hexpad:()=>me,base32hexpadupper:()=>ye,base32hexupper:()=>ge,base32pad:()=>de,base32padupper:()=>pe,base32upper:()=>he,base32z:()=>we});var i={};__webpack_require__.r(i),__webpack_require__.d(i,{base36:()=>be,base36upper:()=>ve});var o={};__webpack_require__.r(o),__webpack_require__.d(o,{base58btc:()=>Ee,base58flickr:()=>Se});var a={};__webpack_require__.r(a),__webpack_require__.d(a,{base64:()=>Ae,base64pad:()=>xe,base64url:()=>ke,base64urlpad:()=>Ie});var c={};__webpack_require__.r(c),__webpack_require__.d(c,{base8:()=>_e});var l={};__webpack_require__.r(l),__webpack_require__.d(l,{identity:()=>Ce});var u={};__webpack_require__.r(u),__webpack_require__.d(u,{code:()=>Re,decode:()=>Ne,encode:()=>Oe,name:()=>Le});var h={};__webpack_require__.r(h),__webpack_require__.d(h,{code:()=>Me,decode:()=>Be,encode:()=>Fe,name:()=>De});var d={};__webpack_require__.r(d),__webpack_require__.d(d,{identity:()=>at});var p={};function f(e=0){return new Uint8Array(e)}function g(e=0){return new Uint8Array(e)}__webpack_require__.r(p),__webpack_require__.d(p,{sha256:()=>ht,sha512:()=>dt});const m=Math.pow(2,7),y=Math.pow(2,14),w=Math.pow(2,21),b=Math.pow(2,28),v=Math.pow(2,35),E=Math.pow(2,42),S=Math.pow(2,49),A=128,x=127;function k(e){if(eNumber.MAX_SAFE_INTEGER)throw new RangeError("Could not encode varint");return 8}function I(e,t,r=0){switch(k(e)){case 8:t[r++]=255&e|A,e/=128;case 7:t[r++]=255&e|A,e/=128;case 6:t[r++]=255&e|A,e/=128;case 5:t[r++]=255&e|A,e/=128;case 4:t[r++]=255&e|A,e>>>=7;case 3:t[r++]=255&e|A,e>>>=7;case 2:t[r++]=255&e|A,e>>>=7;case 1:t[r++]=255&e,e>>>=7;break;default:throw new Error("unreachable")}return t}function _(e,t){let r=e[t],n=0;if(n+=r&x,r>>=7;case 3:t.set(r++,255&e|A),e>>>=7;case 2:t.set(r++,255&e|A),e>>>=7;case 1:t.set(r++,255&e),e>>>=7;break;default:throw new Error("unreachable")}return t}(e,t,r)}function T(e,t=0){return e instanceof Uint8Array?_(e,t):function(e,t){let r=e.get(t),n=0;if(n+=r&x,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 U;if(eF)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>q&&(n=0n,++r>q&&(r=0n))),new B(Number(n),Number(r))}static fromNumber(e){if(0===e)return U;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 B(r,n)}static from(e){return"number"==typeof e?B.fromNumber(e):"bigint"==typeof e?B.fromBigInt(e):"string"==typeof e?B.fromBigInt(BigInt(e)):null!=e.low||null!=e.high?new B(e.low>>>0,e.high>>>0):U}}const U=new B(0,0);U.toBigInt=function(){return 0n},U.zzEncode=U.zzDecode=function(){return this},U.length=function(){return 1};const q=4294967296n;function $(e,t,r){const n=r;let s,i;for(let n=0;n>6|192,t[r++]=63&s|128):55296==(64512&s)&&56320==(64512&(i=e.charCodeAt(n+1)))?(s=65536+((1023&s)<<10)+(1023&i),++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 j(e,t){return RangeError(`index out of range: ${e.pos} + ${t??1} > ${e.len}`)}function z(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}class K{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,j(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 j(this,4);return z(this.buf,this.pos+=4)}sfixed32(){if(this.pos+4>this.len)throw j(this,4);return 0|z(this.buf,this.pos+=4)}float(){if(this.pos+4>this.len)throw j(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],P[0]);var t,r;return this.pos+=4,e}double(){if(this.pos+8>this.len)throw j(this,4);const e=(t=this.buf,r=this.pos,N[0]=t[r],N[1]=t[r+1],N[2]=t[r+2],N[3]=t[r+3],N[4]=t[r+4],N[5]=t[r+5],N[6]=t[r+6],N[7]=t[r+7],O[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 j(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 i,o=0;for(;t191&&i<224?s[o++]=(31&i)<<6|63&e[t++]:i>239&&i<365?(i=((7&i)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,s[o++]=55296+(i>>10),s[o++]=56320+(1023&i)):s[o++]=(15&i)<<12|(63&e[t++])<<6|63&e[t++],o>8191&&((n??(n=[])).push(String.fromCharCode.apply(String,s)),o=0);return null!=n?(o>0&&n.push(String.fromCharCode.apply(String,s.slice(0,o))),n.join("")):String.fromCharCode.apply(String,s.slice(0,o))}(e,0,e.length)}skip(e){if("number"==typeof e){if(this.pos+e>this.len)throw j(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw j(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 B(0,0);let t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw j(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 j(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 j(this,8);const e=z(this.buf,this.pos+=4),t=z(this.buf,this.pos+=4);return new B(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=_(this.buf,this.pos);return this.pos+=k(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 H(e,t,r){const n=function(e){return new K(e instanceof Uint8Array?e:e.subarray())}(e);return t.decode(n,void 0,r)}function V(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 G=function(e,t){if(e.length>=255)throw new TypeError("Alphabet too long");for(var r=new Uint8Array(256),n=0;n>>0,o=new Uint8Array(i);e[t];){var u=r[e.charCodeAt(t)];if(255===u)return;for(var h=0,d=i-1;(0!==u||h>>0,o[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=i-s;p!==i&&0===o[p];)p++;for(var f=new Uint8Array(n+(i-p)),g=n;p!==i;)f[g++]=o[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,i=t.length;s!==i&&0===t[s];)s++,r++;for(var o=(i-s)*u+1>>>0,l=new Uint8Array(o);s!==i;){for(var h=t[s],d=0,p=o-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=o-n;f!==o&&0===l[f];)f++;for(var g=c.repeat(r);fV(s(e))})}function te({name:e,prefix:t,bitsPerChar:r,alphabet:n}){return Y({prefix:t,name:e,encode:e=>function(e,t,r){const n="="===t[t.length-1],s=(1<r;)o-=r,i+=t[s&a>>o];if(0!==o&&(i+=t[s&a<function(e,t,r,n){const s={};for(let e=0;e=8&&(a-=8,o[l++]=255&c>>a)}if(a>=r||255&c<<8-a)throw new SyntaxError("Unexpected end of data");return o}(t,n,r,e)})}const re=ee({prefix:"9",name:"base10",alphabet:"0123456789"}),ne=te({prefix:"f",name:"base16",alphabet:"0123456789abcdef",bitsPerChar:4}),se=te({prefix:"F",name:"base16upper",alphabet:"0123456789ABCDEF",bitsPerChar:4}),ie=te({prefix:"0",name:"base2",alphabet:"01",bitsPerChar:1}),oe=Array.from("🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂"),ae=oe.reduce(((e,t,r)=>(e[r]=t,e)),[]),ce=oe.reduce(((e,t,r)=>{const n=t.codePointAt(0);if(null==n)throw new Error(`Invalid character: ${t}`);return e[n]=r,e}),[]),le=Y({prefix:"🚀",name:"base256emoji",encode:function(e){return e.reduce(((e,t)=>e+ae[t]),"")},decode:function(e){const t=[];for(const r of e){const e=r.codePointAt(0);if(null==e)throw new Error(`Invalid character: ${r}`);const n=ce[e];if(null==n)throw new Error(`Non-base256emoji character: ${r}`);t.push(n)}return new Uint8Array(t)}}),ue=te({prefix:"b",name:"base32",alphabet:"abcdefghijklmnopqrstuvwxyz234567",bitsPerChar:5}),he=te({prefix:"B",name:"base32upper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567",bitsPerChar:5}),de=te({prefix:"c",name:"base32pad",alphabet:"abcdefghijklmnopqrstuvwxyz234567=",bitsPerChar:5}),pe=te({prefix:"C",name:"base32padupper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=",bitsPerChar:5}),fe=te({prefix:"v",name:"base32hex",alphabet:"0123456789abcdefghijklmnopqrstuv",bitsPerChar:5}),ge=te({prefix:"V",name:"base32hexupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV",bitsPerChar:5}),me=te({prefix:"t",name:"base32hexpad",alphabet:"0123456789abcdefghijklmnopqrstuv=",bitsPerChar:5}),ye=te({prefix:"T",name:"base32hexpadupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV=",bitsPerChar:5}),we=te({prefix:"h",name:"base32z",alphabet:"ybndrfg8ejkmcpqxot1uwisza345h769",bitsPerChar:5}),be=ee({prefix:"k",name:"base36",alphabet:"0123456789abcdefghijklmnopqrstuvwxyz"}),ve=ee({prefix:"K",name:"base36upper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"}),Ee=ee({name:"base58btc",prefix:"z",alphabet:"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"}),Se=ee({name:"base58flickr",prefix:"Z",alphabet:"123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"}),Ae=te({prefix:"m",name:"base64",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",bitsPerChar:6}),xe=te({prefix:"M",name:"base64pad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",bitsPerChar:6}),ke=te({prefix:"u",name:"base64url",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_",bitsPerChar:6}),Ie=te({prefix:"U",name:"base64urlpad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=",bitsPerChar:6}),_e=te({prefix:"7",name:"base8",alphabet:"01234567",bitsPerChar:3}),Ce=Y({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)}),Te=new TextEncoder,Pe=new TextDecoder,Le="json",Re=512;function Oe(e){return Te.encode(JSON.stringify(e))}function Ne(e){return JSON.parse(Pe.decode(e))}const De="raw",Me=85;function Fe(e){return V(e)}function Be(e){return V(e)}var Ue=128,qe=-128,$e=Math.pow(2,31),je=128,ze=127,Ke=Math.pow(2,7),He=Math.pow(2,14),Ve=Math.pow(2,21),Ge=Math.pow(2,28),We=Math.pow(2,35),Xe=Math.pow(2,42),Je=Math.pow(2,49),Ze=Math.pow(2,56),Qe=Math.pow(2,63);const Ye={encode:function e(t,r,n){r=r||[];for(var s=n=n||0;t>=$e;)r[n++]=255&t|Ue,t/=128;for(;t&qe;)r[n++]=255&t|Ue,t>>>=7;return r[n]=0|t,e.bytes=n-s+1,r},decode:function e(t,r){var n,s=0,i=0,o=r=r||0,a=t.length;do{if(o>=a)throw e.bytes=0,new RangeError("Could not decode varint");n=t[o++],s+=i<28?(n&ze)<=je);return e.bytes=o-r,s},encodingLength:function(e){return ent(this.code,e)))}throw Error("Unknown type, must be binary type")}}function ut(e){return async t=>new Uint8Array(await crypto.subtle.digest(e,t))}const ht=ct({name:"sha2-256",code:18,encode:ut("SHA-256")}),dt=ct({name:"sha2-512",code:19,encode:ut("SHA-512")});function pt(e,t){const{bytes:r,version:n}=e;return 0===n?function(e,t,r){const{prefix:n}=r;if(n!==Ee.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,gt(e),t??Ee.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,gt(e),t??ue.encoder)}const ft=new WeakMap;function gt(e){const t=ft.get(e);if(null==t){const t=new Map;return ft.set(e,t),t}return t}class mt{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!==yt)throw new Error("Cannot convert a non dag-pb CID to CIDv0");if(t.code!==wt)throw new Error("Cannot convert non sha2-256 multihash CID to CIDv0");return mt.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=nt(e,t);return mt.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 mt.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]=et(e.subarray(t));return t+=n,r};let n=r(),s=yt;if(18===n?(n=0,t=0):s=r(),0!==n&&1!==n)throw new RangeError(`Invalid CID version ${n}`);const i=t,o=r(),a=r(),c=t+a;return{version:n,codec:s,multihashCode:o,digestSize:a,multihashSize:c-i,size:c}}static parse(e,t){const[r,n]=function(e,t){switch(e[0]){case"Q":{const r=t??Ee;return[Ee.prefix,r.decode(`${Ee.prefix}${e}`)]}case Ee.prefix:{const r=t??Ee;return[Ee.prefix,r.decode(e)]}case ue.prefix:{const r=t??ue;return[ue.prefix,r.decode(e)]}case be.prefix:{const r=t??be;return[be.prefix,r.decode(e)]}default:if(null==t)throw Error("To parse non base32, base36 or base58btc encoded CID multibase decoder must be provided");return[e[0],t.decode(e)]}}(e,t),s=mt.decode(n);if(0===s.version&&"Q"!==e[0])throw Error("Version 0 CID string must not include multibase prefix");return gt(s).set(r,e),s}}const yt=112,wt=18;function bt(e,t,r){const n=rt(e),s=n+rt(t),i=new Uint8Array(s+r.byteLength);return tt(e,i,0),tt(t,i,n),i.set(r,s),i}const vt=Symbol.for("@ipld/js-cid/CID"),Et={...l,...r,...c,...e,...t,...s,...i,...o,...a,...n};function St(e,t,r,n){return{name:e,prefix:t,encoder:{name:e,prefix:t,encode:r},decoder:{decode:n}}}const At=St("utf8","u",(e=>"u"+new TextDecoder("utf8").decode(e)),(e=>(new TextEncoder).encode(e.substring(1)))),xt=St("ascii","a",(e=>{let t="a";for(let r=0;r{const t=g((e=e.substring(1)).length);for(let r=0;r4096)return g(n);r+n>e&&(t=g(e),r=0);const s=t.subarray(r,r+=n);return 7&r&&(r=1+(7|r)),s}}();class Lt{len;head;tail;states;constructor(){this.len=0,this.head=new _t(Ct,0,0),this.tail=this.head,this.states=null}_push(e,t,r){return this.tail=this.tail.next=new _t(e,t,r),this.len+=t,this}uint32(e){return this.len+=(this.tail=this.tail.next=new Nt((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this}int32(e){return e<0?this._push(Dt,10,B.fromNumber(e)):this.uint32(e)}sint32(e){return this.uint32((e<<1^e>>31)>>>0)}uint64(e){const t=B.fromBigInt(e);return this._push(Dt,t.length(),t)}uint64Number(e){return this._push(I,k(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=B.fromBigInt(e).zzEncode();return this._push(Dt,t.length(),t)}sint64Number(e){const t=B.fromNumber(e).zzEncode();return this._push(Dt,t.length(),t)}sint64String(e){return this.sint64(BigInt(e))}bool(e){return this._push(Rt,1,e?1:0)}fixed32(e){return this._push(Mt,4,e>>>0)}sfixed32(e){return this.fixed32(e)}fixed64(e){const t=B.fromBigInt(e);return this._push(Mt,4,t.lo)._push(Mt,4,t.hi)}fixed64Number(e){const t=B.fromNumber(e);return this._push(Mt,4,t.lo)._push(Mt,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(R,4,e)}double(e){return this._push(D,8,e)}bytes(e){const t=e.length>>>0;return 0===t?this._push(Rt,1,0):this.uint32(t)._push(Ft,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 Nt extends _t{next;constructor(e,t){super(Ot,e,t),this.next=void 0}}function Dt(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 Mt(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 Ft(e,t,r){t.set(e,r)}function Bt(e,t,r){t.set(e,r)}function Ut(e,t,r){e.length<40?$(e,t,r):null!=t.utf8Write?t.utf8Write(e,r):t.set(It(e),r)}function qt(e,t){const r=new Lt;return t.encode(e,r,{lengthDelimited:!1}),r.finish()}var $t,jt,zt,Kt,Ht,Vt,Gt,Wt,Xt,Jt,Zt,Qt,Yt,er,tr,rr,nr,sr,ir,or,ar,cr,lr,ur,hr,dr,pr,fr,gr,mr,yr;function wr(e,t,r,n){return{name:e,type:t,encode:r,decode:n}}function br(e){function t(t){if(null==e[t.toString()])throw new Error("Invalid enum value");return e[t]}return wr("enum",$t.VARINT,(function(e,r){const n=t(e);r.int32(n)}),(function(e){return t(e.int32())}))}function vr(e,t){return wr("message",$t.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(Bt,t,e),this},Lt.prototype.string=function(e){const t=globalThis.Buffer.byteLength(e);return this.uint32(t),t>0&&this._push(Ut,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"}($t||($t={})),Error;class Er extends Error{code="ERR_MAX_LENGTH";name="MaxLengthError"}class Sr extends Error{code="ERR_MAX_SIZE";name="MaxSizeError"}function Ar(e){return Boolean(e)}function xr(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 kr(e){return new Promise((t=>{setTimeout(t,e)}))}!function(e){let t;e.codec=()=>(null==t&&(t=vr(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(jt||(jt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),jt.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:f(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=jt.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(zt||(zt={})),function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=vr(((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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(t=e.ContentFilter||(e.ContentFilter={})),e.codec=()=>(null==r&&(r=vr(((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:[]},i=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 Er('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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Kt||(Kt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.messages)for(const r of e.messages)t.uint32(10),Wt.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 Er('Decode error - map field "messages" had too many elements');n.messages.push(Wt.codec().decode(e,e.uint32(),{limits:r.limits?.messages$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Ht||(Ht={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),Kt.codec().encode(e.request,t)),null!=e.push&&(t.uint32(26),Ht.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=Kt.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.push=Ht.codec().decode(e,e.uint32(),{limits:r.limits?.push});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Vt||(Vt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Gt||(Gt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),Gt.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:f(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=Gt.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Wt||(Wt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Xt||(Xt={})),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=()=>br(r)}(t=e.FilterSubscribeType||(e.FilterSubscribeType={})),e.codec=()=>(null==n&&(n=vr(((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 i={requestId:"",filterSubscribeType:t.SUBSCRIBER_PING,contentTopics:[]},o=null==n?r.len:r.pos+n;for(;r.pos>>3){case 1:i.requestId=r.string();break;case 2:i.filterSubscribeType=e.FilterSubscribeType.codec().decode(r);break;case 10:i.pubsubTopic=r.string();break;case 11:if(null!=s.limits?.contentTopics&&i.contentTopics.length===s.limits.contentTopics)throw new Er('Decode error - map field "contentTopics" had too many elements');i.contentTopics.push(r.string());break;default:r.skipType(7&t)}}return i}))),n),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Jt||(Jt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Zt||(Zt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.wakuMessage&&(t.uint32(10),er.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=er.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Qt||(Qt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Yt||(Yt={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),Yt.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:f(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=Yt.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(er||(er={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),ir.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=ir.codec().decode(e,e.uint32(),{limits:r.limits?.message});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(tr||(tr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(rr||(rr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),tr.codec().encode(e.request,t)),null!=e.response&&(t.uint32(26),rr.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=tr.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.response=rr.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(nr||(nr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(sr||(sr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),sr.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:f(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=sr.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(ir||(ir={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.messageHash&&(t.uint32(10),t.bytes(e.messageHash)),null!=e.message&&(t.uint32(18),ur.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=ur.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(or||(or={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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 Er('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 Er('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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(ar||(ar={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),or.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 Er('Decode error - map field "messages" had too many elements');n.messages.push(or.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(cr||(cr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(lr||(lr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),lr.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:f(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=lr.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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(ur||(ur={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(hr||(hr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(dr||(dr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.peerInfos)for(const r of e.peerInfos)t.uint32(10),hr.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 Er('Decode error - map field "peerInfos" had too many elements');n.peerInfos.push(hr.codec().decode(e,e.uint32(),{limits:r.limits?.peerInfos$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(pr||(pr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.query&&(t.uint32(10),dr.codec().encode(e.query,t)),null!=e.response&&(t.uint32(18),pr.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=dr.codec().decode(e,e.uint32(),{limits:r.limits?.query});break;case 2:n.response=pr.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(fr||(fr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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 Er('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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(gr||(gr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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 Er('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=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(mr||(mr={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.messageId&&""!==e.messageId&&(t.uint32(18),t.string(e.messageId)),null!=e.channelId&&""!==e.channelId&&(t.uint32(26),t.string(e.channelId)),null!=e.lamportTimestamp&&(t.uint32(80),t.int32(e.lamportTimestamp)),null!=e.causalHistory)for(const r of e.causalHistory)t.uint32(90),t.string(r);null!=e.bloomFilter&&(t.uint32(98),t.bytes(e.bloomFilter)),null!=e.content&&(t.uint32(162),t.bytes(e.content)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={messageId:"",channelId:"",causalHistory:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 2:n.messageId=e.string();break;case 3:n.channelId=e.string();break;case 10:n.lamportTimestamp=e.int32();break;case 11:if(null!=r.limits?.causalHistory&&n.causalHistory.length===r.limits.causalHistory)throw new Er('Decode error - map field "causalHistory" had too many elements');n.causalHistory.push(e.string());break;case 12:n.bloomFilter=e.bytes();break;case 20:n.content=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(yr||(yr={}));function Ir(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function _r(e,...t){if(!((r=e)instanceof Uint8Array||ArrayBuffer.isView(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+", got length="+e.length)}function Cr(e){if("function"!=typeof e||"function"!=typeof e.create)throw new Error("Hash should be wrapped by utils.wrapConstructor");Ir(e.outputLen),Ir(e.blockLen)}function Tr(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;function Lr(e){return new DataView(e.buffer,e.byteOffset,e.byteLength)}function Rr(e,t){return e<<32-t|e>>>t}function Or(e){return"string"==typeof e&&(e=function(e){if("string"!=typeof e)throw new Error("utf8ToBytes expected string, got "+typeof e);return new Uint8Array((new TextEncoder).encode(e))}(e)),_r(e),e}"function"==typeof Uint8Array.from([]).toHex&&Uint8Array.fromHex;class Nr{clone(){return this._cloneInto()}}function Dr(e){const t=t=>e().update(Or(t)).digest(),r=e();return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=()=>e(),t}function Mr(e=32){if(Pr&&"function"==typeof Pr.getRandomValues)return Pr.getRandomValues(new Uint8Array(e));if(Pr&&"function"==typeof Pr.randomBytes)return Uint8Array.from(Pr.randomBytes(e));throw new Error("crypto.getRandomValues must be defined")}function Fr(e,t,r){return e&t^e&r^t&r}class Br extends Nr{constructor(e,t,r,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=n,this.buffer=new Uint8Array(e),this.view=Lr(this.buffer)}update(e){Tr(this);const{view:t,buffer:r,blockLen:n}=this,s=(e=Or(e)).length;for(let i=0;in-i&&(this.process(r,0),i=0);for(let e=i;e>s&i),a=Number(r&i),c=n?4:0,l=n?0:4;e.setUint32(t+c,o,n),e.setUint32(t+l,a,n)}(r,n-8,BigInt(8*this.length),s),this.process(r,0);const o=Lr(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=Rr(r,17)^Rr(r,19)^r>>>10;$r[e]=s+$r[e-7]+n+$r[e-16]|0}let{A:r,B:n,C:s,D:i,E:o,F:a,G:c,H:l}=this;for(let e=0;e<64;e++){const t=l+(Rr(o,6)^Rr(o,11)^Rr(o,25))+((u=o)&a^~u&c)+Ur[e]+$r[e]|0,h=(Rr(r,2)^Rr(r,13)^Rr(r,22))+Fr(r,n,s)|0;l=c,c=a,a=o,o=i+t|0,i=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,i=i+this.D|0,o=o+this.E|0,a=a+this.F|0,c=c+this.G|0,l=l+this.H|0,this.set(r,n,s,i,o,a,c,l)}roundClean(){$r.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const zr=Dr((()=>new jr));var Kr,Hr,Vr,Gr,Wr;!function(e){e.Relay="relay",e.Store="store",e.LightPush="lightpush",e.Filter="filter"}(Kr||(Kr={})),function(e){e.GENERIC_FAIL="Generic error",e.REMOTE_PEER_REJECTED="Remote peer rejected",e.DECODE_FAILED="Failed to decode",e.NO_PEER_AVAILABLE="No peer available",e.NO_STREAM_AVAILABLE="No stream available",e.NO_RESPONSE="No response received",e.ENCODE_FAILED="Failed to encode",e.EMPTY_PAYLOAD="Payload is empty",e.SIZE_TOO_BIG="Size is too big",e.TOPIC_NOT_CONFIGURED="Topic not configured",e.STREAM_ABORTED="Stream aborted",e.RLN_PROOF_GENERATION="Proof generation failed",e.TOPIC_DECODER_MISMATCH="Topic decoder mismatch",e.INVALID_DECODER_TOPICS="Invalid decoder topics"}(Hr||(Hr={})),function(e){e.BOOTSTRAP="bootstrap",e.PEER_EXCHANGE="peer-exchange",e.LOCAL="local-peer-cache"}(Vr||(Vr={})),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"}(Gr||(Gr={})),function(e){e.CONNECTION_STATUS="waku:connection"}(Wr||(Wr={}));const Xr="@waku/bootstrap",Jr={clusterId:1,shards:[0,1,2,3,4,5,6,7,8]};var Zr,Qr;function Yr(e,t="utf8"){const r=kt[t];if(null==r)throw new Error(`Unsupported encoding "${t}"`);return r.encoder.encode(e).substring(1)}function en(e){return"string"==typeof e?It(e.replace(/^0x/i,"").toLowerCase(),"base16"):e}!function(e){e.StatusChange="health:change"}(Zr||(Zr={})),function(e){e.Unhealthy="Unhealthy",e.MinimallyHealthy="MinimallyHealthy",e.SufficientlyHealthy="SufficientlyHealthy"}(Qr||(Qr={}));const tn=e=>Yr(e,"base16"),rn=e=>Yr(e,"utf8"),nn=e=>It(e,"utf8");function sn(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 on=e=>{if("contentTopics"in e&&e.contentTopics)return Array.from(new Set(e.contentTopics.map((t=>hn(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??1}/${t}`))))}if("application"in e&&"version"in e)return[hn(`/${e.application}/${e.version}/default/default`,e.clusterId)];throw new Error("Missing required configuration in shard parameters")},an=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}},cn=e=>{const t=new Set,r=new Set;for(const n of e){const{clusterId:e,shard:s}=an(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 ln(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 un(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=zr(sn([nn(r),nn(n)])),i=new DataView(s.buffer.slice(-8));return Number(i.getBigUint64(0,!1)%BigInt(t))}function hn(e,t=1,r=8){if(!e)throw Error("Content topic must be specified");return`/waku/2/rs/${t}/${un(e,r)}`}function dn(e,t){return"string"==typeof t?t:void 0!==t?.shard?(e=>{if(void 0===e.shard)throw new Error("Invalid shard");return`/waku/2/rs/${e.clusterId??1}/${e.shard}`})(t):hn(e,t?.clusterId??1)}const pn=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(i))}}return{clusterId:r,shards:n}},fn=e=>{const{clusterId:t,shards:r}=e,n=r.length>=64?130:3+2*r.length,s=new ArrayBuffer(n),i=new DataView(s);if(i.setUint16(0,t),r.length>=64)for(const e of r){const t=Math.floor(e/8)+2,r=7-e%8;i.setUint8(t,i.getUint8(t)|1<{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 In(e,t){null==t&&(t=e.reduce(((e,t)=>e+t.length),0));const r=g(t);let n=0;for(const t of e)r.set(t,n),n+=t.length;return r}function _n(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(!Pn(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(!Pn(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=Tn(this.bufs,e);return t.buf[t.index]}set(e,t){const r=Tn(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 In(r,n)}subarray(e,t){const{bufs:r,length:n}=this._subList(e,t);return 1===r.length?r[0]:In(r,n)}sublist(e,t){const{bufs:r,length:n}=this._subList(e,t),s=new Ln;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>=o&&eo&&t<=a;if(c&&l){if(e===o&&t===a){r.push(i);break}const n=e-o;r.push(i.subarray(n,n+(t-e)));break}if(c){if(0===e){r.push(i);continue}r.push(i.subarray(e-o))}else{if(l){if(t===a){r.push(i);break}r.push(i.subarray(0,t-o));break}r.push(i)}}return{bufs:r,length:t-e}}indexOf(e,t=0){if(!(Pn(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-i[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=g(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=f(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=f(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=f(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=g(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=f(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=f(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=f(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=f(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=f(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 Ln))return!1;if(e.bufs.length!==this.bufs.length)return!1;for(let t=0;te+t.byteLength),0)),r.length=t,r}}function Rn(e){return null!=e[Symbol.asyncIterator]}const On=e=>{const t=k(e),r=g(t);return C(e,r),On.bytes=t,r};function Nn(e,t){const r=(t=t??{}).lengthEncoder??On;function*n(e){const t=r(e.byteLength);t instanceof Uint8Array?yield t:yield*t,e instanceof Uint8Array?yield e:yield*e}return Rn(e)?async function*(){for await(const t of e)yield*n(t)}():function*(){for(const t of e)yield*n(t)}()}On.bytes=0,Nn.single=(e,t)=>{const r=(t=t??{}).lengthEncoder??On;return new Ln(r(e.byteLength),e)};class Dn extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Mn extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class Fn extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class Bn extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}var Un;!function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}(Un||(Un={}));const qn=e=>{const t=T(e);return qn.bytes=k(t),t};function $n(e,t){const r=new Ln;let n=Un.LENGTH,s=-1;const i=t?.lengthDecoder??qn,o=t?.maxLengthLength??8,a=t?.maxDataLength??4194304;function*c(){for(;r.byteLength>0;){if(n===Un.LENGTH)try{if(s=i(r),s<0)throw new Dn("Invalid message length");if(s>a)throw new Mn("Message length too long");const e=i.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=Un.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>o)throw new Fn("Message length length too long");break}throw e}if(n===Un.DATA){if(r.byteLength0)throw new Bn("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new Bn("Unexpected end of input")}()}function jn(){const e={};return e.promise=new Promise(((t,r)=>{e.resolve=t,e.reject=r})),e}qn.bytes=0,$n.fromReader=(e,t)=>{let r=1;return $n(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 zn{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 Kn{size;hwm;head;tail;constructor(e={}){this.hwm=e.splitLimit??16,this.head=new zn(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 zn(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 Hn extends Error{type;code;constructor(e,t){super(e??"The operation was aborted"),this.type="aborted",this.code=t??"ABORT_ERR"}}function Vn(e={}){return function(e,t){let r,n,s,i=(t=t??{}).onEnd,o=new Kn,a=jn();const c=e=>null!=n?n(e):(o.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=>(o=new Kn,null!=n?n({error:e}):(o.push({error:e}),r)))(e):c({done:!0}));if(r={[Symbol.asyncIterator](){return this},next:async()=>{try{return o.isEmpty()?s?{done:!0}:await new Promise(((t,s)=>{n=i=>{n=null,o.push(i);try{t(e(o))}catch(e){s(e)}return r}})):e(o)}finally{o.isEmpty()&&queueMicrotask((()=>{a.resolve(),a=jn()}))}},return:()=>(o=new Kn,u(),{done:!0}),throw:e=>(u(e),{done:!0}),push:l,end:u,get readableLength(){return o.size},onEmpty:async e=>{const t=e?.signal;if(t?.throwIfAborted(),o.isEmpty())return;let r,n;null!=t&&(r=new Promise(((e,r)=>{n=()=>{r(new Hn)},t.addEventListener("abort",n)})));try{await Promise.race([a.promise,r])}finally{null!=n&&null!=t&&t?.removeEventListener("abort",n)}}},null==i)return r;const h=r;return r={[Symbol.asyncIterator](){return this},next:()=>h.next(),throw:e=>(h.throw(e),null!=i&&(i(e),i=void 0),{done:!0}),return:()=>(h.return(),null!=i&&(i(),i=void 0),{done:!0}),push:l,end:e=>(h.end(e),null!=i&&(i(e),i=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)}class Gn 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 Wn(e,t,r){if(null==t)return e;if(t.aborted)return e.catch((()=>{})),Promise.reject(new Gn(r?.errorMessage,r?.errorCode,r?.errorName));let n;const s=new Gn(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 Xn{readNext;haveNext;ended;nextResult;error;constructor(){this.ended=!1,this.readNext=jn(),this.haveNext=jn()}[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=jn(),e}async throw(e){return this.ended=!0,this.error=e,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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 this.error??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=jn(),await Wn(this.readNext.promise,t?.signal,t)}}const Jn=function(...e){const t=[];for(const r of e)null==r[Symbol.asyncIterator]&&t.push(r);return t.length===e.length?function*(e){for(const t of e)yield*t}(t):async function*(e){const t=new Xn;(async function(e,t){try{await Promise.all(e.map((async e=>{for await(const r of e)await t.push(r)}))),await t.end()}catch(e){await t.end(e).catch((()=>{}))}})(e,t).catch((()=>{})),yield*t}(e)};function Zn(e,...t){if(null==e)throw new Error("Empty pipeline");if(ts(e)){const t=e;e=()=>t.source}else if(es(e)||Yn(e)){const t=e;e=()=>t}const r=[e,...t];if(r.length>1&&ts(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},Yn=e=>null!=e?.[Symbol.asyncIterator],es=e=>null!=e?.[Symbol.iterator],ts=e=>null!=e&&null!=e.sink&&null!=e.source,rs=e=>t=>{const r=e.sink(t);if(null!=r?.then){const t=Vn({objectMode:!0});let n;r.then((()=>{t.end()}),(e=>{t.end(e)}));const s=e.source;if(Yn(s))n=async function*(){yield*s,t.end()};else{if(!es(s))throw new Error("Unknown duplex source type - must be Iterable or AsyncIterable");n=function*(){yield*s,t.end()}}return Jn(t,n())}return e.source};function ns(e){return e.filter((e=>"open"===e.status)).sort(((e,t)=>t.timeline.open-e.timeline.open)).at(0)}const ss="consumed";class is{multicodec;getConnections;addEventListener;log;ongoingCreation=new Set;streamPool=new Map;constructor(e,t,r){this.multicodec=e,this.getConnections=t,this.addEventListener=r,this.log=new yn(`stream-manager:${e}`),this.addEventListener("peer:update",this.handlePeerUpdateStreamPool)}async getStream(e){const t=e.toString(),r=this.streamPool.get(t);r&&(this.streamPool.delete(t),await r);let n=this.getOpenStreamForCodec(e);return n?(this.log.info(`Found existing stream peerId=${t} multicodec=${this.multicodec}`),this.lockStream(t,n),n):(n=await this.createStream(e),this.lockStream(t,n),n)}async createStream(e,t=0){const r=ns(this.getConnections(e));if(!r)throw new Error(`Failed to get a connection to the peer peerId=${e.toString()} multicodec=${this.multicodec}`);let n,s;for(let i=0;i{const{peer:t}=e.detail;t.protocols.includes(this.multicodec)&&(this.getOpenStreamForCodec(t.id)||this.scheduleNewStream(t))};scheduleNewStream(e){this.log.info(`Scheduling creation of a stream for peerId=${e.id.toString()} multicodec=${this.multicodec}`),this.streamPool.has(e.id.toString())&&this.streamPool.delete(e.id.toString()),this.streamPool.set(e.id.toString(),this.createStreamWithLock(e))}getOpenStreamForCodec(e){const t=ns(this.getConnections(e));if(!t)return;const r=t.streams.find((e=>e.protocol===this.multicodec));return r?["done","closed","closing"].includes(r.writeStatus||"")||this.isStreamLocked(r)?void 0:r:void 0}lockStream(e,t){this.log.info(`Locking stream for peerId:${e}\tstreamId:${t.id}`),t.metadata[ss]=!0}isStreamLocked(e){return!!e.metadata[ss]}}class os{multicodec;components;pubsubTopics;addLibp2pEventListener;removeLibp2pEventListener;streamManager;constructor(e,t,r){this.multicodec=e,this.components=t,this.pubsubTopics=r,this.addLibp2pEventListener=t.events.addEventListener.bind(t.events),this.removeLibp2pEventListener=t.events.removeEventListener.bind(t.events),this.streamManager=new is(e,t.connectionManager.getConnections.bind(t.connectionManager),this.addLibp2pEventListener)}async getStream(e){return this.streamManager.getStream(e)}}const as={randomUUID:"undefined"!=typeof crypto&&crypto.randomUUID&&crypto.randomUUID.bind(crypto)};let cs;const ls=new Uint8Array(16);function us(){if(!cs&&(cs="undefined"!=typeof crypto&&crypto.getRandomValues&&crypto.getRandomValues.bind(crypto),!cs))throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");return cs(ls)}const hs=[];for(let e=0;e<256;++e)hs.push((e+256).toString(16).slice(1));const ds=function(e,t,r){if(as.randomUUID&&!t&&!e)return as.randomUUID();const n=(e=e||{}).random||(e.rng||us)();if(n[6]=15&n[6]|64,n[8]=63&n[8]|128,t){r=r||0;for(let e=0;e<16;++e)t[r+e]=n[e];return t}return function(e,t=0){return hs[e[t+0]]+hs[e[t+1]]+hs[e[t+2]]+hs[e[t+3]]+"-"+hs[e[t+4]]+hs[e[t+5]]+"-"+hs[e[t+6]]+hs[e[t+7]]+"-"+hs[e[t+8]]+hs[e[t+9]]+"-"+hs[e[t+10]]+hs[e[t+11]]+hs[e[t+12]]+hs[e[t+13]]+hs[e[t+14]]+hs[e[t+15]]}(n)};class ps{proto;constructor(e){this.proto=e}static decode(e){const t=Qt.decode(e);return new ps(t)}encode(){return Qt.encode(this.proto)}get wakuMessage(){return this.proto.wakuMessage}get pubsubTopic(){return this.proto.pubsubTopic}}class fs{proto;constructor(e){this.proto=e}static createSubscribeRequest(e,t){return new fs({requestId:ds(),filterSubscribeType:Jt.FilterSubscribeType.SUBSCRIBE,pubsubTopic:e,contentTopics:t})}static createUnsubscribeRequest(e,t){return new fs({requestId:ds(),filterSubscribeType:Jt.FilterSubscribeType.UNSUBSCRIBE,pubsubTopic:e,contentTopics:t})}static createUnsubscribeAllRequest(e){return new fs({requestId:ds(),filterSubscribeType:Jt.FilterSubscribeType.UNSUBSCRIBE_ALL,pubsubTopic:e,contentTopics:[]})}static createSubscriberPingRequest(){return new fs({requestId:ds(),filterSubscribeType:Jt.FilterSubscribeType.SUBSCRIBER_PING,pubsubTopic:"",contentTopics:[]})}static decode(e){const t=Jt.decode(e);return new fs(t)}encode(){return Jt.encode(this.proto)}get filterSubscribeType(){return this.proto.filterSubscribeType}get requestId(){return this.proto.requestId}get pubsubTopic(){return this.proto.pubsubTopic}get contentTopics(){return this.proto.contentTopics}}class gs{proto;constructor(e){this.proto=e}static decode(e){const t=Zt.decode(e);return new gs(t)}encode(){return Zt.encode(this.proto)}get statusCode(){return this.proto.statusCode}get statusDesc(){return this.proto.statusDesc}get requestId(){return this.proto.requestId}}const ms=new yn("filter:v2"),ys="/vac/waku/filter-subscribe/2.0.0-beta1",ws="/vac/waku/filter-push/2.0.0-beta1";class bs extends os{handleIncomingMessage;pubsubTopics;constructor(e,t,r){super(ys,r.components,t),this.handleIncomingMessage=e,this.pubsubTopics=t,r.handle(ws,this.onRequest.bind(this),{maxInboundStreams:100}).catch((e=>{ms.error("Failed to register ",ws,e)}))}async subscribe(e,t,r){const n=await this.getStream(t),s=fs.createSubscribeRequest(e,r);let i;try{i=await Zn([s.encode()],Nn,n,$n,(async e=>await kn(e)))}catch(e){return ms.error("Failed to send subscribe request",e),{success:null,failure:{error:Hr.GENERIC_FAIL,peerId:t}}}const{statusCode:o,requestId:a,statusDesc:c}=gs.decode(i[0].slice());return o<200||o>=300?(ms.error(`Filter subscribe request ${a} failed with status code ${o}: ${c}`),{failure:{error:Hr.REMOTE_PEER_REJECTED,peerId:t},success:null}):{failure:null,success:t}}async unsubscribe(e,t,r){let n;try{n=await this.getStream(t)}catch(e){return ms.error(`Failed to get a stream for remote peer${t.toString()}`,e),{success:null,failure:{error:Hr.NO_STREAM_AVAILABLE,peerId:t}}}const s=fs.createUnsubscribeRequest(e,r);try{await Zn([s.encode()],Nn,n.sink)}catch(e){return ms.error("Failed to send unsubscribe request",e),{success:null,failure:{error:Hr.GENERIC_FAIL,peerId:t}}}return{success:t,failure:null}}async unsubscribeAll(e,t){const r=await this.getStream(t),n=fs.createUnsubscribeAllRequest(e),s=await Zn([n.encode()],Nn,r,$n,(async e=>await kn(e)));if(!s||!s.length)return{failure:{error:Hr.NO_RESPONSE,peerId:t},success:null};const{statusCode:i,requestId:o,statusDesc:a}=gs.decode(s[0].slice());return i<200||i>=300?(ms.error(`Filter unsubscribe all request ${o} failed with status code ${i}: ${a}`),{failure:{error:Hr.REMOTE_PEER_REJECTED,peerId:t},success:null}):{failure:null,success:t}}async ping(e){let t;try{t=await this.getStream(e)}catch(t){return ms.error(`Failed to get a stream for remote peer${e.toString()}`,t),{success:null,failure:{error:Hr.NO_STREAM_AVAILABLE,peerId:e}}}const r=fs.createSubscriberPingRequest();let n;try{n=await Zn([r.encode()],Nn,t,$n,(async e=>await kn(e)))}catch(t){return ms.error("Failed to send ping request",t),{success:null,failure:{error:Hr.GENERIC_FAIL,peerId:e}}}if(!n||!n.length)return{success:null,failure:{error:Hr.NO_RESPONSE,peerId:e}};const{statusCode:s,requestId:i,statusDesc:o}=gs.decode(n[0].slice());return s<200||s>=300?(ms.error(`Filter ping request ${i} failed with status code ${s}: ${o}`),{success:null,failure:{error:Hr.REMOTE_PEER_REJECTED,peerId:e}}):{success:e,failure:null}}onRequest(e){const{connection:t,stream:r}=e,{remotePeer:n}=t;ms.info(`Received message from ${n.toString()}`);try{Zn(r,$n,(async e=>{for await(const r of e){const e=ps.decode(r.slice()),{pubsubTopic:n,wakuMessage:s}=e;if(!s)return void ms.error("Received empty message");if(!n)return void ms.error("Pubsub topic missing from push message");await this.handleIncomingMessage(n,s,t.remotePeer.toString())}})).then((()=>{ms.info("Receiving pipe closed.")}),(async e=>{ms.error(`Error with receiving pipe on peer:${t.remotePeer.toString()} -- stream:${r.id} -- protocol:${r.protocol}: `,e)}))}catch(e){ms.error("Error decoding message",e)}}}class vs{proto;constructor(e){this.proto=e}static createRequest(e,t){return new vs({requestId:ds(),request:{message:e,pubsubTopic:t},response:void 0})}static decode(e){const t=nr.decode(e);return new vs(t)}encode(){return nr.encode(this.proto)}get query(){return this.proto.request}get response(){return this.proto.response}}const Es=new yn("light-push"),Ss="/vac/waku/lightpush/2.0.0-beta1";class As extends os{pubsubTopics;constructor(e,t){super(Ss,t.components,e),this.pubsubTopics=e}async preparePushMessage(e,t){try{if(!t.payload||0===t.payload.length)return Es.error("Failed to send waku light push: payload is empty"),{query:null,error:Hr.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 Es.error("Failed to send waku light push: message is bigger than 1MB"),{query:null,error:Hr.SIZE_TOO_BIG};const r=await e.toProtoObj(t);return r?{query:vs.createRequest(r,e.pubsubTopic),error:null}:(Es.error("Failed to encode to protoMessage, aborting push"),{query:null,error:Hr.ENCODE_FAILED})}catch(e){return Es.error("Failed to prepare push message",e),{query:null,error:Hr.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}};let i,o;try{i=await this.getStream(r)}catch(e){return Es.error("Failed to get stream",e),{success:null,failure:{error:Hr.NO_STREAM_AVAILABLE,peerId:r}}}try{o=await Zn([n.encode()],Nn,i,$n,(async e=>await kn(e)))}catch(e){return Es.error("Failed to send waku light push request",e),{success:null,failure:{error:Hr.STREAM_ABORTED,peerId:r}}}const a=new Ln;let c;o.forEach((e=>{a.append(e)}));try{c=vs.decode(a).response}catch(e){return Es.error("Failed to decode push reply",e),{success:null,failure:{error:Hr.DECODE_FAILED,peerId:r}}}return c?(l=c.info)&&(l.includes("could not generate rln proof")||l.includes("could not get new message id to generate an rln proof")||l.includes("RLN validation failed"))?(Es.error("Remote peer fault: RLN generation"),{success:null,failure:{error:Hr.RLN_PROOF_GENERATION,peerId:r}}):c.isSuccess?{success:r,failure:null}:(Es.error("Remote peer rejected the message: ",c.info),{success:null,failure:{error:Hr.REMOTE_PEER_REJECTED,peerId:r}}):(Es.error("Remote peer fault: No response in PushRPC"),{success:null,failure:{error:Hr.NO_RESPONSE,peerId:r}});var l}}const xs={payload:new Uint8Array,contentTopic:"",version:void 0,timestamp:void 0,meta:void 0,rateLimitProof:void 0,ephemeral:void 0},ks=1e6;class Is{proto;constructor(e){this.proto=e}static create(e){const t=new Is({...e,requestId:ds(),timeStart:e.timeStart?BigInt(e.timeStart.getTime()*ks):void 0,timeEnd:e.timeEnd?BigInt(e.timeEnd.getTime()*ks):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=ar.decode(e);return new Is(t)}encode(){return ar.encode(this.proto)}}class _s{proto;constructor(e){this.proto=e}static decode(e){const t=cr.decode(e);return new _s(t)}encode(){return cr.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 Cs=new yn("store"),Ts="/vac/waku/store-query/3.0.0";class Ps extends os{pubsubTopics;constructor(e,t){super(Ts,t.components,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=Is.create({...e,paginationCursor:n});let i;try{i=await this.getStream(r)}catch(e){Cs.error("Failed to get stream",e);break}const o=await Zn([s.encode()],Nn,i,$n,(async e=>await kn(e))),a=new Ln;o.forEach((e=>{a.append(e)}));const c=_s.decode(a);if(!c.statusCode||c.statusCode>=300){const e=`Store query failed with status code: ${c.statusCode}, description: ${c.statusDesc}`;throw Cs.error(e),new Error(e)}if(!c.messages||!c.messages.length){Cs.warn("Stopping pagination due to empty messages in response");break}Cs.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,{...xs,...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 Ls 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 CustomEvent(e,t))}}const Rs=Symbol.for("@libp2p/peer-id");function Os(e){return Boolean(e?.[Rs])}const Ns=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,i=0;const o=this.peekChar();if(void 0===o)return;const a="0"===o,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(i+=1,void 0!==t&&i>t)return}return 0===i||!r&&a&&i>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),i=16-(r+2),[o]=e(s.subarray(0,i));return t.set(s.subarray(0,o),16-o),t}))}readIPAddr(){return this.readIPv4Addr()??this.readIPv6Addr()}};function Ds(e){if(!(e.length>15))return Ns.new(e).parseWith((()=>Ns.readIPv4Addr()))}function Ms(e){if(e.includes("%")&&(e=e.split("%")[0]),!(e.length>45))return Ns.new(e).parseWith((()=>Ns.readIPv6Addr()))}function Fs(e,t=!1){if(e.includes("%")&&(e=e.split("%")[0]),e.length>45)return;const r=Ns.new(e).parseWith((()=>Ns.readIPAddr()));return r?t&&4===r.length?Uint8Array.from([0,0,0,0,0,0,0,0,0,0,255,255,r[0],r[1],r[2],r[3]]):r:void 0}const Bs=(parseInt("0xFFFF",16),new Uint8Array([0,0,0,0,0,0,0,0,0,0,255,255]));function Us(e,t){16===t.length&&4===e.length&&function(e){let t=0;for(const r of e)if(!(t<0)){if(t>11)break;if(255!==r)return!1;t++}return!0}(t)&&(t=t.slice(12)),4===t.length&&16===e.length&&function(e,t){let r=0;for(const n of e)if(!(r<0)){if(r>11)break;if(n!==t[r])return!1;r++}return!0}(e,Bs)&&(e=e.slice(12));const r=e.length;if(r!=t.length)throw new Error("Failed to mask ip");const n=new Uint8Array(r);for(let s=0;st)throw new Error("Invalid CIDR mask");const r=t/8,n=new Uint8Array(r);for(let t=0;t=8?(n[t]=255,e-=8):(n[t]=255-(255>>e),e=0);return n}class $s{constructor(e,t){if(null==t)({network:this.network,mask:this.mask}=function(e){const[t,r]=e.split("/");if(!t||!r)throw new Error("Failed to parse given CIDR: "+e);let n=4,s=Ds(t);if(null==s&&(n=16,s=Ms(t),null==s))throw new Error("Failed to parse given CIDR: "+e);const i=parseInt(r,10);if(Number.isNaN(i)||String(i).length!==r.length||i<0||i>8*n)throw new Error("Failed to parse given CIDR: "+e);const o=qs(i,8*n);return{network:Us(s,o),mask:o}}(e));else{const r=Fs(e);if(null==r)throw new Error("Failed to parse network");t=String(t);const n=parseInt(t,10);if(Number.isNaN(n)||String(n).length!==t.length||n<0||n>8*r.length){const e=Fs(t);if(null==e)throw new Error("Failed to parse mask");this.mask=e}else this.mask=qs(n,8*r.length);this.network=Us(r,this.mask)}}contains(e){return function(e,t){if("string"==typeof t&&(t=Fs(t)),null==t)throw new Error("Invalid ip");if(t.length!==e.network.length)return!1;for(let r=0;r>4).toString(16)+(15&r).toString(16);return t}(this.mask);return function(e){switch(e.length){case 4:return e.join(".");case 16:{const t=[];for(let r=0;r{r[t++]=255&parseInt(e,10)})),r}if(Vs(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")},Ws=-1,Xs={},Js={};function Zs(e){if("number"==typeof e){if(null!=Js[e])return Js[e];throw new Error(`no protocol with code: ${e}`)}if("string"==typeof e){if(null!=Xs[e])return Xs[e];throw new Error(`no protocol with name: ${e}`)}throw new Error("invalid protocol id type: "+typeof e)}function Qs(e,t){switch(Zs(e).code){case 4:case 41:return function(e){const t=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=ri(n);return In([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=ue.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=ri(n);return In([r,s],r.length+s.length)}(t);case 466:return function(e){const t=ti.decode(e),r=Uint8Array.from(C(t.length));return In([r,t],r.length+t.length)}(t);case 481:return si(globalThis.decodeURIComponent(t));default:return It(t,"base16")}}[[4,32,"ip4"],[6,16,"tcp"],[33,16,"dccp"],[41,128,"ip6"],[42,Ws,"ip6zone"],[43,8,"ipcidr"],[53,Ws,"dns",!0],[54,Ws,"dns4",!0],[55,Ws,"dns6",!0],[56,Ws,"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,Ws,"unix",!1,!0],[421,Ws,"ipfs"],[421,Ws,"p2p"],[443,0,"https"],[444,96,"onion"],[445,296,"onion3"],[446,Ws,"garlic64"],[448,0,"tls"],[449,Ws,"sni"],[460,0,"quic"],[461,0,"quic-v1"],[465,0,"webtransport"],[466,Ws,"certhash"],[477,0,"ws"],[478,0,"wss"],[479,0,"p2p-websocket-star"],[480,0,"http"],[481,Ws,"http-path"],[777,Ws,"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);Js[t.code]=t,Xs[t.name]=t})),Zs("ip4"),Zs("ip6"),Zs("ipcidr");const ei=Object.values(Et).map((e=>e.decoder)),ti=function(){let e=ei[0].or(ei[1]);return ei.slice(2).forEach((t=>e=e.or(t))),e}();function ri(e){const t=new ArrayBuffer(2);return new DataView(t).setUint16(0,e),new Uint8Array(t)}function ni(e){return new DataView(e.buffer).getUint16(e.byteOffset)}function si(e){const t=It(e),r=Uint8Array.from(C(t.length));return In([r,t],r.length+t.length)}function ii(e){const t=T(e);if((e=e.slice(k(t))).length!==t)throw new Error("inconsistent lengths");return Yr(e)}function oi(e){const t=[],r=[];let n=null,s=0;for(;se.length)throw new hi("Invalid address Uint8Array: "+Yr(e,"base16"));t.push([i,l]);const u=Qs(i,l);if(r.push([i,u]),!0===a.path){n=u;break}}return{bytes:Uint8Array.from(e),string:ai(r),tuples:t,stringTuples:r,path:n}}function ai(e){const t=[];return e.map((e=>{const r=Zs(e[0]);return t.push(r.name),e.length>1&&null!=e[1]&&t.push(e[1]),null})),ui(t.join("/"))}function ci(e){return In(e.map((e=>{const t=Zs(e[0]);let r=Uint8Array.from(C(t.code));return e.length>1&&null!=e[1]&&(r=In([r,e[1]])),r})))}function li(e,t){if(e.size>0)return e.size/8;if(0===e.size)return 0;{const e=T(t instanceof Uint8Array?t:Uint8Array.from(t));return e+k(e)}}function ui(e){return"/"+e.trim().split("/").filter((e=>e)).join("/")}class hi extends Error{static name="ParseError";name="ParseError";constructor(e){super(`Error parsing address: ${e}`)}}const di=Symbol.for("nodejs.util.inspect.custom"),pi=Symbol.for("@multiformats/js-multiaddr/multiaddr"),fi=[Zs("dns").code,Zs("dns4").code,Zs("dns6").code,Zs("dnsaddr").code];class gi extends Error{constructor(e="No available resolver"){super(e),this.name="NoAvailableResolverError"}}class mi{bytes;#t;#r;#n;#s;[pi]=!0;constructor(e){let t;if(null==e&&(e=""),e instanceof Uint8Array)t=oi(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=ui(e)).split("/").slice(1);if(1===s.length&&""===s[0])return{bytes:new Uint8Array,string:"/",tuples:[],stringTuples:[],path:null};for(let i=0;i=s.length)throw new hi("invalid address: "+e);if(!0===o.path){n=ui(s.slice(i).join("/")),t.push([o.code,Ys(o.code,n)]),r.push([o.code,n]);break}const a=Ys(o.code,s[i]);t.push([o.code,a]),r.push([o.code,Qs(o.code,a)])}return{string:ai(r),bytes:ci(t),tuples:t,stringTuples:r,path:n}}(e)}else{if(!wi(e))throw new Error("addr must be a string, Buffer, or another Multiaddr");t=oi(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 i=Zs("tcp"),o=Zs("udp"),a=Zs("ip4"),c=Zs("ip6"),l=Zs("dns6"),u=Zs("ip6zone");for(const[h,d]of this.stringTuples())h===u.code&&(s=`%${d??""}`),fi.includes(h)&&(t="tcp"===i.name?"tcp":"udp",n=443,r=`${d??""}${s}`,e=h===l.code?6:4),h!==i.code&&h!==o.code||(t="tcp"===Zs(h).name?"tcp":"udp",n=parseInt(d??"")),h!==a.code&&h!==c.code||(t="tcp"===Zs(h).name?"tcp":"udp",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({},Zs(e))))}protoCodes(){return this.#r.map((([e])=>e))}protoNames(){return this.#r.map((([e])=>Zs(e).name))}tuples(){return this.#r.map((([e,t])=>null==t?[e]:[e,t]))}stringTuples(){return this.#n.map((([e,t])=>null==t?[e]:[e,t]))}encapsulate(e){return e=new mi(e),new mi(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 mi(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 mi(ci(t.slice(0,r)));return this}getPeerId(){try{let e=[];this.stringTuples().forEach((([t,r])=>{t===Xs.p2p.code&&e.push([t,r]),t===Xs["p2p-circuit"].code&&(e=[])}));const t=e.pop();if(null!=t?.[1]){const e=t[1];return"Q"===e[0]||"1"===e[0]?Yr(Ee.decode(`z${e}`),"base58btc"):Yr(mt.parse(e).multihash.bytes,"base58btc")}return null}catch(e){return null}}getPath(){return this.#s}equals(e){return _n(this.bytes,e.bytes)}async resolve(e){const t=this.protos().find((e=>e.resolvable));if(null==t)return[this];const r=yi.get(t.name);if(null==r)throw new gi(`no available resolver for ${t.name}`);return(await r(this,e)).map((e=>bi(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)}[di](){return`Multiaddr(${this.#t})`}}const yi=new Map;function wi(e){return Boolean(e?.[pi])}function bi(e){return new mi(e)}const vi=new yn("keep-alive");class Ei{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),vi.info(`Ping succeeded (${n})`,r)}catch(e){return void vi.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:nn(r.toString())}})}catch(e){vi.error("Failed to update ping",e)}}catch(e){vi.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 i=Sn({pubsubTopicShardInfo:an(s),contentTopic:"/relay-ping/1/ping/null",ephemeral:!0}),o=setInterval((()=>{vi.info("Sending Waku Relay ping message"),e.send(i,{payload:new Uint8Array([1])}).catch((e=>vi.error("Failed to send relay ping",e)))}),1e3*t);n.push(o)}return n}}const Si=e=>{if(!e)return-1;try{const t=e.metadata.get("ping");return t?Number(rn(t)):-1}catch(e){return-1}},Ai=new yn("connection-manager");class xi extends Ls{pubsubTopics;keepAliveManager;options;libp2p;dialAttemptsForPeer=new Map;dialErrorsForPeer=new Map;currentActiveParallelDialCount=0;pendingPeerDialQueue=[];isP2PNetworkConnected=!1;isConnected(){return!(globalThis?.navigator&&!globalThis?.navigator?.onLine)&&this.isP2PNetworkConnected}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),Ai.info(`Dropped connection with peer ${e.toString()}`)}catch(t){Ai.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=[],i=[],o=[],a=[];for(const t of e){const e=await this.getTagNamesForPeer(t.id);e.includes(Vr.BOOTSTRAP)?r.push(t):e.includes(Vr.PEER_EXCHANGE)?n.push(t):e.includes(Vr.LOCAL)&&s.push(t)}for(const e of t){const t=await this.libp2p.peerStore.get(e),r=await this.getTagNamesForPeer(e);r.includes(Vr.BOOTSTRAP)?i.push(t):r.includes(Vr.PEER_EXCHANGE)?o.push(t):r.includes(Vr.LOCAL)&&a.push(t)}return{DISCOVERED:{[Vr.BOOTSTRAP]:r,[Vr.PEER_EXCHANGE]:n,[Vr.LOCAL]:s},CONNECTED:{[Vr.BOOTSTRAP]:i,[Vr.PEER_EXCHANGE]:o,[Vr.LOCAL]:a}}}constructor(e){super(),this.libp2p=e.libp2p,this.pubsubTopics=e.pubsubTopics,this.options={maxDialAttemptsForPeer:3,maxBootstrapPeersAllowed:1,maxParallelDials:3,pingKeepAlive:300,relayKeepAlive:300,...e.config},this.keepAliveManager=new Ei({relay:e.relay,libp2p:e.libp2p,options:{pingKeepAlive:this.options.pingKeepAlive,relayKeepAlive:this.options.relayKeepAlive}}),this.startEventListeners().then((()=>Ai.info("Connection Manager is now running"))).catch((e=>Ai.error("Unexpected error while running service",e))),this.dialPeerStorePeers().catch((e=>Ai.error("Unexpected error while dialing peer store peers",e)))}async getConnectedPeers(e){const t=this.libp2p.getPeers();return 0===t.length?[]:(await Promise.all(t.map((async e=>{try{return await this.libp2p.peerStore.get(e)}catch(e){return null}})))).filter((e=>!!e)).filter((t=>!e||t.protocols.includes(e))).sort(((e,t)=>Si(e)-Si(t)))}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){Ai.error("Unexpected error while dialing peer store peers",e)}}async startEventListeners(){this.startPeerDiscoveryListener(),this.startPeerConnectionListener(),this.startPeerDisconnectionListener(),this.startNetworkStatusListener()}async dialPeer(e){let t,r;const n=this.getDialablePeerInfo(e),s=Os(n)?n.toString():n.getPeerId();this.currentActiveParallelDialCount+=1;let i=0;for(;i{t.tags=Array.from(new Set([...t.tags,...e]))})),this.dialAttemptsForPeer.set(r.toString(),-1),this.keepAliveManager.start(r);break}catch(e){e instanceof AggregateError?Ai.error(`Error dialing peer ${s} - ${e.errors}`):Ai.error(`Error dialing peer ${s} - ${e.message}`),this.dialErrorsForPeer.set(s,e),i++,this.dialAttemptsForPeer.set(s,i)}if(this.currentActiveParallelDialCount--,this.processDialQueue(),i===this.options.maxDialAttemptsForPeer)try{const e=this.dialErrorsForPeer.get(s);if(e){let t;e instanceof AggregateError?e.errors?0===e.errors.length?Ai.warn("Errors array is empty for AggregateError"):t=JSON.stringify(e.errors[0]):Ai.warn("No errors array found for AggregateError"):t=e.message,Ai.info(`Deleting undialable peer ${s} from peer store. Reason: ${t}`)}this.dialErrorsForPeer.delete(s),r&&await this.libp2p.peerStore.delete(r),await this.attemptDnsDiscovery()}catch(e){throw new Error(`Error deleting undialable peer ${s} from peer store - ${e}`)}if(!t)throw new Error(`Failed to dial peer ${n}`);return t}async rawDialPeerWithProtocols(e,t){const r=this.getDialablePeerInfo(e);return await this.libp2p.dialProtocol(r,t)}getDialablePeerInfo(e){if(Os(e))return e;{const t=bi(e);if(!t.getPeerId())throw new Error("Failed to dial multiaddr: missing peer ID");return t}}async attemptDnsDiscovery(){if(this.libp2p.getConnections().length>0)return;if((await this.libp2p.peerStore.all()).length>0)return;Ai.info("Attempting to trigger DNS discovery.");const e=Object.values(this.libp2p.components.components).find((e=>!(!e||!e.toString)&&e.toString().includes(Xr)));e&&await e.findPeers()}processDialQueue(){if(this.pendingPeerDialQueue.length>0&&this.currentActiveParallelDialCount{Ai.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){Ai.error(`Error dialing peer ${t.toString()} : ${e}`)}})()},"peer:connect":e=>{(async()=>{Ai.info(`Connected to peer ${e.detail.toString()}`);const t=e.detail;this.keepAliveManager.start(t),(await this.getTagNamesForPeer(t)).includes(Vr.BOOTSTRAP)?this.libp2p.getConnections().filter((e=>e.tags.includes(Vr.BOOTSTRAP))).length>this.options.maxBootstrapPeersAllowed?await this.dropConnection(t):this.dispatchEvent(new CustomEvent(Gr.PEER_CONNECT_BOOTSTRAP,{detail:t})):this.dispatchEvent(new CustomEvent(Gr.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 Ai.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 Ai.warn(`Discovered peer ${e.toString()} with ShardInfo ${t} is not part of any of the configured pubsub topics (${this.pubsubTopics}).\n Not dialing.`),!1}return await this.isPeerDialableBasedOnBootstrapStatus(e)?!this.dialAttemptsForPeer.has(e.toString())||(Ai.warn(`Peer ${e.toString()} has already been attempted dial before, or already has a dial attempt in progress, skipping dial`),!1):(Ai.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===Vr.BOOTSTRAP))||this.libp2p.getConnections().filter((e=>e.tags.find((e=>e===Vr.BOOTSTRAP)))).lengththis.pubsubTopics.includes(e)))}async getPeerShardInfo(e,t){const r=(await t.get(e)).metadata.get("shardInfo");if(r)return pn(r)}startNetworkStatusListener(){try{globalThis.addEventListener("online",this.onEventHandlers["browser:network"]),globalThis.addEventListener("offline",this.onEventHandlers["browser:network"])}catch(e){Ai.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){Ai.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 CustomEvent(Wr.CONNECTION_STATUS,{detail:this.isConnected()}))}}const ki=new yn("metadata"),Ii="/vac/waku/metadata/1.0.0";class _i extends os{pubsubTopics;libp2pComponents;handshakesConfirmed=new Map;constructor(e,t){super(Ii,t.components,e),this.pubsubTopics=e,this.libp2pComponents=t,t.registrar.handle(Ii,(e=>{this.onRequest(e)}))}async query(e){const t=gr.encode(cn(this.pubsubTopics));if(!await this.libp2pComponents.peerStore.get(e))return{shardInfo:null,error:Hr.NO_PEER_AVAILABLE};let r;try{r=await this.getStream(e)}catch(s){return ki.error("Failed to get stream",s),{shardInfo:null,error:Hr.NO_STREAM_AVAILABLE}}const n=await Zn([t],Nn,r,$n,(async e=>await kn(e))),{error:s,shardInfo:i}=this.decodeMetadataResponse(n);return s?{shardInfo:null,error:s}:(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=mr.encode(cn(this.pubsubTopics)),s=await Zn([n],Nn,t,$n,(async e=>await kn(e))),{error:i,shardInfo:o}=this.decodeMetadataResponse(s);if(i)return;await this.savePeerShardInfo(r.remotePeer,o)}catch(e){ki.error("Error handling metadata request",e)}}decodeMetadataResponse(e){const t=new Ln;e.forEach((e=>{t.append(e)}));const r=mr.decode(t);return r?{shardInfo:r,error:null}:(ki.error("Error decoding metadata response"),{shardInfo:null,error:Hr.DECODE_FAILED})}async savePeerShardInfo(e,t){await this.libp2pComponents.peerStore.merge(e,{metadata:{shardInfo:fn(t)}}),this.handshakesConfirmed.set(e.toString(),t)}}function Ci(e){return t=>new _i(e,t)}function Ti(e,t){const r=nn(e),n=nn(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),i=sn([r,t.payload,n,t.meta,s].filter(Ar));return zr(i)}class Pi{peerIds=[];isStarted=!1;pubsubTopic;config;libp2p;filter;peerManager;connectionManager;activeSubscriptions;keepAliveIntervalId;pingFailedAttempts=new Map;receivedMessagesFormPeer=new Set;receivedMessages=new Set;verifiedPeers=new Set;constructor(e){this.config=e.config,this.connectionManager=e.connectionManager,this.filter=e.filter,this.peerManager=e.peerManager,this.libp2p=e.libp2p,this.activeSubscriptions=e.activeSubscriptions,this.pubsubTopic=e.pubsubTopic,this.onConnectionChange=this.onConnectionChange.bind(this),this.onPeerConnected=this.onPeerConnected.bind(this),this.onPeerDisconnected=this.onPeerDisconnected.bind(this)}get reservedContentTopic(){return`/js-waku-subscription-ping/1/${this.libp2p.peerId.toString()}/utf8`}start(){this.isStarted||(this.isStarted=!0,this.startKeepAlive(),this.startConnectionListener(),this.startPeerConnectionListener())}stop(){this.isStarted&&(this.isStarted=!1,this.stopKeepAlive(),this.stopConnectionListener(),this.stopPeerConnectionListener())}async getPeers(){return this.isStarted||(this.peerIds=this.peerManager.getPeers()),this.peerIds}notifyMessageReceived(e,t){const r=this.buildMessageHash(t);return this.verifiedPeers.add(e),this.receivedMessagesFormPeer.add(`${e}-${r}`),!!this.receivedMessages.has(r)||(this.receivedMessages.add(r),!1)}buildMessageHash(e){return function(e,t){const r=Ti(e,t);return tn(r)}(this.pubsubTopic,e)}startConnectionListener(){this.connectionManager.addEventListener(Wr.CONNECTION_STATUS,this.onConnectionChange)}stopConnectionListener(){this.connectionManager.removeEventListener(Wr.CONNECTION_STATUS,this.onConnectionChange)}async onConnectionChange({detail:e}){e?(await Promise.all(this.peerIds.map((e=>this.ping(e,!0)))),this.startKeepAlive()):this.stopKeepAlive()}startKeepAlive(){this.keepAliveIntervalId||(this.keepAliveIntervalId=setInterval((()=>{this.peerIds.map((e=>this.ping(e)))}),this.config.keepAliveIntervalMs))}stopKeepAlive(){this.keepAliveIntervalId&&(clearInterval(this.keepAliveIntervalId),this.keepAliveIntervalId=void 0)}startPeerConnectionListener(){this.libp2p.addEventListener("peer:connect",this.onPeerConnected),this.libp2p.addEventListener("peer:disconnect",this.onPeerDisconnected)}stopPeerConnectionListener(){this.libp2p.removeEventListener("peer:connect",this.onPeerConnected),this.libp2p.removeEventListener("peer:disconnect",this.onPeerDisconnected)}async onPeerConnected(e){this.peerIds.length>0||(this.peerIds=this.peerManager.getPeers(),await Promise.all(this.peerIds.map((e=>this.subscribe(e)))))}async onPeerDisconnected(e){!this.peerIds.find((t=>t.equals(e.detail)))||(this.peerIds=this.peerManager.getPeers(),await Promise.all(this.peerIds.map((e=>this.subscribe(e)))))}async subscribe(e){let t=e;for(let e=0;e<3;e++){if(!t)return;if((await this.filter.subscribe(this.pubsubTopic,t,Array.from(this.activeSubscriptions.keys()))).success)return;t=this.peerManager.requestRenew(t)}}async ping(e,t=!1){const r=e.toString(),n=await this.filter.ping(e);if(n.failure&&t){const t=this.peerManager.requestRenew(e);await this.subscribe(t)}else{if(n.failure){const e=this.pingFailedAttempts.get(r)||0;this.pingFailedAttempts.set(r,e+1)}if(n.success&&this.pingFailedAttempts.set(r,0),(this.pingFailedAttempts.get(r)||0)>=this.config.pingsBeforePeerRenewed){const t=this.peerManager.requestRenew(e);await this.subscribe(t)}}}}const Li=new yn("sdk:filter:subscription");class Ri{pubsubTopic;protocol;config;monitor;subscriptionCallbacks=new Map;constructor(e,t,r,n,s,i,o){this.pubsubTopic=e,this.protocol=t,this.config=i,this.pubsubTopic=e,this.monitor=new Pi({pubsubTopic:e,config:i,libp2p:s,connectionManager:r,filter:t,peerManager:n,lightPush:o,activeSubscriptions:this.subscriptionCallbacks})}async subscribe(e,t){const r=Array.isArray(e)?e:[e];for(const e of r)if(e.pubsubTopic!==this.pubsubTopic)return{failures:[{error:Hr.TOPIC_DECODER_MISMATCH}],successes:[]};this.config.enableLightPushFilterCheck&&r.push(xn(this.monitor.reservedContentTopic,this.pubsubTopic));const n=xr(r),s=Array.from(n.keys()),i=(await this.monitor.getPeers()).map((async e=>this.protocol.subscribe(this.pubsubTopic,e,s))),o=await Promise.allSettled(i),a=this.handleResult(o,"subscribe");return n.forEach(((e,r)=>{const n={decoders:e,callback:t};r!==this.monitor.reservedContentTopic&&this.subscriptionCallbacks.set(r,n)})),this.monitor.start(),a}async unsubscribe(e){const t=(await this.monitor.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.monitor.stop(),n}async ping(){const e=(await this.monitor.getPeers()).map((e=>this.protocol.ping(e))),t=await Promise.allSettled(e);return this.handleResult(t,"ping")}async unsubscribeAll(){const e=(await this.monitor.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.monitor.stop(),r}async processIncomingMessage(e,t){if(this.monitor.notifyMessageReceived(t,e))return void Li.info("Message already received, skipping");const{contentTopic:r}=e,n=this.subscriptionCallbacks.get(r);n?(Li.info("Processing message with content topic ",r," on pubsub topic ",this.pubsubTopic),await async function(e,t,r){const{decoders:n,callback:s}=e,{contentTopic:i}=r;if(i)try{const e=n.map((e=>e.fromProtoObj(t,r).then((e=>e||Promise.reject("Decoding failed"))))),i=await Promise.any(e);await s(i)}catch(e){Li.error("Error decoding message",e)}else Li.warn("Message has no content topic, skipping")}(n,this.pubsubTopic,e)):Li.error("No subscription callback available for ",r)}handleResult(e,t){const r={failures:[],successes:[]};for(const n of e)if("rejected"===n.status)Li.error(`Failed to resolve ${t} promise successfully: `,n.reason),r.failures.push({error:Hr.GENERIC_FAIL});else{const e=n.value;e.failure?r.failures.push(e.failure):r.successes.push(e.success)}return r}}const Oi=new yn("sdk:filter");class Ni{protocol;config;connectionManager;libp2p;peerManager;lightPush;activeSubscriptions=new Map;constructor(e){var t;this.config=(t=e.options,{keepAliveIntervalMs:t?.keepAliveIntervalMs||6e4,pingsBeforePeerRenewed:t?.pingsBeforePeerRenewed||3,enableLightPushFilterCheck:t?.enableLightPushFilterCheck||!1}),this.lightPush=e.lightPush,this.peerManager=e.peerManager,this.libp2p=e.libp2p,this.connectionManager=e.connectionManager,this.protocol=new bs((async(e,t,r)=>{const n=this.getActiveSubscription(e);n?await n.processIncomingMessage(t,r):Oi.error(`No subscription locally registered for topic ${e}`)}),e.connectionManager.pubsubTopics,e.libp2p),this.activeSubscriptions=new Map}async subscribe(e,t){const r=this.getUniquePubsubTopics(e);if(1!==r.length)return{subscription:null,error:Hr.INVALID_DECODER_TOPICS,results:null};const n=r[0],{subscription:s,error:i}=await this.createSubscription(n);if(i)return{subscription:null,error:i,results:null};const{failures:o,successes:a}=await s.subscribe(e,t);return{subscription:s,error:null,results:{failures:o,successes:a}}}async createSubscription(e){const t="string"==typeof e?e:on(e)?.[0];ln(t,this.protocol.pubsubTopics);const r=this.peerManager.getPeers();return 0===r.length?{error:Hr.NO_PEER_AVAILABLE,subscription:null}:(Oi.info(`Creating filter subscription with ${r.length} peers: `,r.map((e=>e.toString()))),{error:null,subscription:this.getActiveSubscription(t)??this.setActiveSubscription(t,new Ri(t,this.protocol,this.connectionManager,this.peerManager,this.libp2p,this.config,this.lightPush))})}async subscribeWithUnsubscribe(e,t){const r=this.getUniquePubsubTopics(e);if(0===r.length)throw Error("Failed to subscribe: no pubsubTopic found on decoders provided.");if(r.length>1)throw Error("Failed to subscribe: all decoders should have the same pubsub topic. Use createSubscription to be more agile.");const{subscription:n,error:s}=await this.createSubscription(r[0]);if(s)throw Error(`Failed to create subscription: ${s}`);await n.subscribe(e,t);const i=Array.from(xr(Array.isArray(e)?e:[e]).keys());return async()=>{await n.unsubscribe(i)}}toSubscriptionIterator(e){return async function(e,t,r){const n=[];let s;s=await e.subscribeWithUnsubscribe(t,(e=>{n.push(e)}));const i=Number.isInteger(r?.timeoutMs),o=Date.now();return{iterator:async function*(){for(;;){if(i&&Date.now()-o>=0)return;await kr(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 Di=new yn("health-indicator");class Mi extends Ls{libp2p;value=Qr.Unhealthy;constructor(e){super(),this.libp2p=e.libp2p,this.onPeerChange=this.onPeerChange.bind(this)}start(){Di.info("start: adding listeners to libp2p"),this.libp2p.addEventListener("peer:connect",this.onPeerChange),this.libp2p.addEventListener("peer:disconnect",this.onPeerChange)}stop(){Di.info("stop: removing listeners to libp2p"),this.libp2p.removeEventListener("peer:connect",this.onPeerChange),this.libp2p.removeEventListener("peer:disconnect",this.onPeerChange)}toString(){return this.value}toValue(){return this.value}async onPeerChange(e){Di.info(`onPeerChange: received libp2p event - ${e.type}`);const t=this.libp2p.getConnections(),r=await Promise.all(t.map((async e=>{try{return await this.libp2p.peerStore.get(e.remotePeer)}catch(e){return null}}))),n=r.filter((e=>e?.protocols.includes(ys))).length,s=r.filter((e=>e?.protocols.includes(Ss))).length;0===t.length?(Di.info(`onPeerChange: node identified as ${Qr.Unhealthy}`),this.value=Qr.Unhealthy):n>=2&&s>=2?(Di.info(`onPeerChange: node identified as ${Qr.SufficientlyHealthy}`),this.value=Qr.SufficientlyHealthy):1===n&&1===s&&(Di.info(`onPeerChange: node identified as ${Qr.MinimallyHealthy}`),this.value=Qr.MinimallyHealthy),this.dispatchEvent(new CustomEvent(Zr.StatusChange,{detail:this.value})),Di.error(`onPeerChange: unexpected state, cannot identify health status of the node: Filter:${n}; LightPush:${s}`)}}const Fi=e=>new Promise(((t,r)=>setTimeout((()=>r(new Error("Task timeout"))),e))),Bi=new yn("sdk:retry-manager");class Ui{intervalID=null;retryIntervalMs;inProgress=0;queue=[];peerManager;constructor(e){this.peerManager=e.peerManager,this.retryIntervalMs=e.retryIntervalMs}start(){this.intervalID=setInterval((()=>{this.processQueue()}),this.retryIntervalMs)}stop(){this.intervalID&&(clearInterval(this.intervalID),this.intervalID=null)}push(e,t){this.queue.push({maxAttempts:t,callback:e})}processQueue(){if(0!==this.queue.length)for(;this.queue.length&&this.inProgress<5;){const e=this.queue.shift();e&&this.scheduleTask(e)}else Bi.info("processQueue: queue is empty")}scheduleTask(e){setTimeout((async()=>this.taskExecutor(e)),100)}async taskExecutor(e){const t=this.peerManager.getPeers()[0];var r;if(t)try{this.inProgress+=1;const r=await Promise.race([Fi(1e4),e.callback(t)]);if(r?.failure)throw Error(r.failure.error);if(Bi.info("scheduleTask: executed successfully"),0===e.maxAttempts)return void Bi.warn("scheduleTask: discarded a task due to limit of max attempts");this.queue.push({...e,maxAttempts:e.maxAttempts-1})}catch(n){const s=n;if(Bi.error("scheduleTask: task execution failed with error:",s),((r=s.message)===Hr.REMOTE_PEER_REJECTED||r===Hr.NO_RESPONSE||r===Hr.RLN_PROOF_GENERATION||r===Hr.NO_PEER_AVAILABLE)&&this.peerManager.requestRenew(t),0===e.maxAttempts)return void Bi.warn("scheduleTask: discarded a task due to limit of max attempts");this.queue.push({...e,maxAttempts:e.maxAttempts-1})}finally{this.inProgress-=1}else Bi.warn("scheduleTask: no peers, skipping")}}const qi=new yn("sdk:light-push"),$i={autoRetry:!0,retryIntervalMs:1e3,maxAttempts:3,numPeersToUse:1};class ji{config;retryManager;peerManager;protocol;constructor(e){this.config={...$i,...e.options||{}},this.peerManager=e.peerManager,this.protocol=new As(e.connectionManager.pubsubTopics,e.libp2p),this.retryManager=new Ui({peerManager:e.peerManager,retryIntervalMs:this.config.retryIntervalMs})}start(){this.retryManager.start()}stop(){this.retryManager.stop()}async send(e,t,r={}){r={...this.config,...r};const{pubsubTopic:n}=e;if(qi.info("send: attempting to send a message to pubsubTopic:",n),!this.protocol.pubsubTopics.includes(n))return{successes:[],failures:[{error:Hr.TOPIC_NOT_CONFIGURED}]};const s=this.peerManager.getPeers().slice(0,this.config.numPeersToUse);if(0===s.length)return{successes:[],failures:[{error:Hr.NO_PEER_AVAILABLE}]};const i=await Promise.all(s.map((r=>this.protocol.send(e,t,r).catch((e=>({success:null,failure:{error:Hr.GENERIC_FAIL}})))))),o={successes:i.filter((e=>e.success)).map((e=>e.success)),failures:i.filter((e=>e.failure)).map((e=>e.failure))};if(r.autoRetry&&0===o.successes.length){const n=r=>this.protocol.send(e,t,r);this.retryManager.push(n.bind(this),r.maxAttempts||3)}return o}}const zi=new yn("peer-manager"),Ki="peer-manager-lock";class Hi{numPeersToUse;libp2p;constructor(e){this.onConnected=this.onConnected.bind(this),this.onDisconnected=this.onDisconnected.bind(this),this.numPeersToUse=e?.config?.numPeersToUse||2,this.libp2p=e.libp2p}start(){this.startConnectionListener()}stop(){this.stopConnectionListener()}getPeers(){return this.getLockedConnections().map((e=>e.remotePeer))}requestRenew(e){const t=this.getLockedConnections(),r=this.numPeersToUse-t.length;if(0===r)return;const n=this.getUnlockedConnections().filter((t=>!t.remotePeer.equals(e))).slice(0,r).map((e=>this.lockConnection(e))).map((e=>e.remotePeer))[0];if(n)return zi.info(`requestRenew: Renewed peer ${e.toString()} to ${n.toString()}`),n;zi.warn(`requestRenew: Couldn't renew peer ${e.toString()} - no peers.`)}startConnectionListener(){this.libp2p.addEventListener("peer:connect",this.onConnected),this.libp2p.addEventListener("peer:disconnect",this.onDisconnected)}stopConnectionListener(){this.libp2p.removeEventListener("peer:connect",this.onConnected),this.libp2p.removeEventListener("peer:disconnect",this.onDisconnected)}onConnected(e){const t=e.detail;this.lockPeerIfNeeded(t)}onDisconnected(e){const t=e.detail;this.requestRenew(t)}lockPeerIfNeeded(e){const t=this.getLockedConnections();0!=this.numPeersToUse-t.length&&this.getUnlockedConnections().filter((t=>t.remotePeer.equals(e))).map((e=>this.lockConnection(e)))}getLockedConnections(){return this.libp2p.getConnections().filter((e=>"open"===e.status&&this.isConnectionLocked(e)))}getUnlockedConnections(){return this.libp2p.getConnections().filter((e=>"open"===e.status&&!this.isConnectionLocked(e)))}lockConnection(e){return zi.info(`requestRenew: Locking connection for peerId=${e.remotePeer.toString()}`),e.tags.push(Ki),e}isConnectionLocked(e){return e.tags.includes(Ki)}}const Vi=new yn("waku:store:sdk");class Gi{options;peerManager;connectionManager;protocol;constructor(e){this.options=e.options||{},this.peerManager=e.peerManager,this.connectionManager=e.connectionManager,this.protocol=new Ps(e.connectionManager.pubsubTopics,e.libp2p)}async*queryGenerator(e,t){const{pubsubTopic:r,contentTopics:n,decodersAsMap:s}=this.validateDecodersAndPubsubTopic(e),i={pubsubTopic:r,contentTopics:n,includeData:!0,paginationForward:!0,...t},o=await this.getPeerToUse();if(!o)throw Vi.error("No peers available to query"),new Error("No peers available to query");Vi.info(`Querying store with options: ${JSON.stringify(t)}`);const a=this.protocol.queryPerPage(i,s,o);for await(const e of a)yield e}async queryWithOrderedCallback(e,t,r){Vi.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){Vi.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(Ar);return await Promise.all(n.map((async e=>{e&&!r&&(r=Boolean(await t(e)))}))),r}createCursor(e){return Ti(e.pubsubTopic,e)}validateDecodersAndPubsubTopic(e){if(0===e.length)throw Vi.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 Vi.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];ln(r,this.protocol.pubsubTopics);const n=new Map;e.forEach((e=>{if(n.has(e.contentTopic))throw Vi.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 Vi.error(`No decoders found for topic ${r}`),new Error("No decoders found for topic "+r);return{pubsubTopic:r,contentTopics:s,decodersAsMap:n}}async getPeerToUse(){let e;if(this.options?.peer){const t=(await this.connectionManager.getConnectedPeers()).find((e=>e.id.toString()===this.options?.peer));e=t?.id,e||Vi.warn(`Passed node to use for Store not found: ${this.options.peer}. Attempting to use random peers.`)}const t=this.peerManager.getPeers();if(t.length>0)return t[Math.floor(Math.random()*t.length)];Vi.error("No peers available to use.")}}const Wi=(e,t)=>{const r=e.shardInfo?.clusterId||t.clusterId,n=e.shardInfo&&"shardsUnderCluster"in e.shardInfo?e.shardInfo.shardsUnderCluster:8;return{clusterId:r,shard:e.shardInfo&&"shard"in e.shardInfo?e.shardInfo.shard:un(e.contentTopic,n)}},Xi=(e,t)=>t.clusterId===e.clusterId&&!("shards"in t&&!t.shards.includes(e.shard)),Ji=new yn("wait-for-remote-peer");async function Zi(e,t){const r=[];return e.relay&&t.includes(Kr.Relay)&&r.push(e.relay.waitForPeers()),e.store&&t.includes(Kr.Store)&&r.push(Qi(Ts,e.libp2p)),e.lightPush&&t.includes(Kr.LightPush)&&r.push(Qi(Ss,e.libp2p)),e.filter&&t.includes(Kr.Filter)&&r.push(Qi(ys,e.libp2p)),Promise.all(r)}async function Qi(e,t){Ji.info(`Waiting for ${e} peer.`),await new Promise((r=>{const n=async s=>{if(s.detail?.protocols?.includes(e)){const e=t.services.metadata;if(!e)return t.removeEventListener("peer:identify",n),void r();try{await e.confirmOrAttemptHandshake(s.detail.peerId),t.removeEventListener("peer:identify",n),r()}catch(e){"ERR_CONNECTION_BEING_CLOSED"===e.code&&Ji.error("Connection closed. Some peers can be on different shard."),Ji.error(`Error waiting for metadata: ${e}`)}}};t.addEventListener("peer:identify",n)}))}const Yi=(e,t)=>new Promise(((r,n)=>setTimeout((()=>n(Error(t))),e))),eo=new yn("waku");class to{pubsubTopics;libp2p;relay;store;filter;lightPush;connectionManager;health;networkConfig;_nodeStateLock=!1;_nodeStarted=!1;peerManager;constructor(e,t,r,n,s){this.pubsubTopics=e,this.relay=s,this.libp2p=r,this.networkConfig=t.networkConfig||Jr,n={filter:!1,lightpush:!1,store:!1,...n};const i=this.libp2p.peerId.toString();this.connectionManager=new xi({libp2p:r,relay:this.relay,pubsubTopics:this.pubsubTopics,config:t?.connectionManager}),this.peerManager=new Hi({libp2p:r,config:{numPeersToUse:t.numPeersToUse}}),this.health=new Mi({libp2p:r}),n.store&&(t.store?.peer&&this.connectionManager.rawDialPeerWithProtocols(t.store.peer,[Ts]).catch((e=>{eo.error("Failed to dial store peer",e)})),this.store=new Gi({libp2p:r,connectionManager:this.connectionManager,peerManager:this.peerManager,options:{peer:t.store?.peer}})),n.lightpush&&(this.lightPush=new ji({libp2p:r,peerManager:this.peerManager,connectionManager:this.connectionManager,options:t?.lightPush})),n.filter&&(this.filter=new Ni({libp2p:r,connectionManager:this.connectionManager,peerManager:this.peerManager,lightPush:this.lightPush,options:t.filter})),eo.info("Waku node created",i,`relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this.lightPush}, filter: ${!!this.filter}`)}get peerId(){return this.libp2p.peerId}get protocols(){return this.libp2p.getProtocols()}async dial(e,t){const r=t??[];void 0===t&&(this.relay&&r.push(Kr.Relay),this.store&&r.push(Kr.Store),this.filter&&r.push(Kr.Filter),this.lightPush&&r.push(Kr.LightPush));const n=[];r.includes(Kr.Relay)&&(this.relay?this.relay.gossipSub.multicodecs.forEach((e=>n.push(e))):eo.error("Relay codec not included in dial codec: protocol not mounted locally")),r.includes(Kr.Store)&&(this.store?n.push(this.store.protocol.multicodec):eo.error("Store codec not included in dial codec: protocol not mounted locally")),r.includes(Kr.LightPush)&&(this.lightPush?n.push(this.lightPush.protocol.multicodec):eo.error("Light Push codec not included in dial codec: protocol not mounted locally")),r.includes(Kr.Filter)&&(this.filter?n.push(this.filter.protocol.multicodec):eo.error("Filter codec not included in dial codec: protocol not mounted locally"));const s=(e=>Os(e)?e:bi(e))(e);return eo.info(`Dialing to ${s.toString()} with protocols ${r}`),await this.connectionManager.rawDialPeerWithProtocols(e,n)}async start(){this._nodeStateLock||this.isStarted()||(this._nodeStateLock=!0,await this.libp2p.start(),this.peerManager.start(),this.health.start(),this.lightPush?.start(),this._nodeStateLock=!1,this._nodeStarted=!0)}async stop(){!this._nodeStateLock&&this.isStarted()&&(this._nodeStateLock=!0,this.lightPush?.stop(),this.health.stop(),this.peerManager.stop(),this.connectionManager.stop(),await this.libp2p.stop(),this._nodeStateLock=!1,this._nodeStarted=!1)}async getConnectedPeers(){return this.connectionManager.getConnectedPeers()}async waitForPeers(e,t){return async function(e,t,r){t=t?.length?t:function(e){const t=[];return e.relay&&t.push(Kr.Relay),e.filter&&t.push(Kr.Filter),e.store&&t.push(Kr.Store),e.lightPush&&t.push(Kr.LightPush),t}(e);const n=e.libp2p.getConnections();if(!e.isStarted())throw Error("Waku node is not started");for(const r of t)switch(r){case Kr.Relay:if(!e.relay)throw Error("Cannot wait for Relay peer: protocol not mounted");break;case Kr.LightPush:if(!e.lightPush)throw Error("Cannot wait for LightPush peer: protocol not mounted");break;case Kr.Store:if(!e.store)throw Error("Cannot wait for Store peer: protocol not mounted");break;case Kr.Filter:if(!e.filter)throw Error("Cannot wait for Filter peer: protocol not mounted")}const s=[Zi(e,t)];n.length>0&&!t.includes(Kr.Relay)&&s.push(async function(e,t){const r=e.libp2p.getPeers(),n=e.libp2p.services.metadata,s=function(e){const t=new Map,r={[Kr.Filter]:ys,[Kr.LightPush]:Ss,[Kr.Store]:Ts};for(const n of e)r[n]&&t.set(r[n],!1);return t}(t);if(r.length&&n)for(const t of r)try{const r=await e.libp2p.peerStore.get(t);if(r.protocols.some((e=>s.has(e)))&&!(await n.confirmOrAttemptHandshake(t)).error&&(r.protocols.forEach((e=>{s.has(e)&&s.set(e,!0)})),Array.from(s.values()).every((e=>e))))return}catch(e){"ERR_CONNECTION_BEING_CLOSED"===e.code&&Ji.error("Connection closed. Some peers can be on different shard."),Ji.error(`Error while iterating through peers: ${e}`);continue}else Ji.info(`Skipping waitForMetadata due to missing connections:${r.length} or metadataService:${!!n}`)}(e,t)),r?await async function(e,t){await Promise.race([e,Yi(t,"Timed out waiting for a remote peer.")])}(Promise.any(s),r):await Promise.any(s)}(this,e,t)}isStarted(){return this._nodeStarted&&"started"===this.libp2p.status}isConnected(){return this.connectionManager.isConnected()}createDecoder(e){const t=Wi(e,this.networkConfig);if(eo.info(`Creating Decoder with input:${JSON.stringify(e.shardInfo)}, determined:${JSON.stringify(t)}, expected:${JSON.stringify(this.networkConfig)}.`),!Xi(t,this.networkConfig))throw Error("Cannot create decoder: incompatible shard configuration.");return xn(e.contentTopic,t)}createEncoder(e){const t=Wi(e,this.networkConfig);if(eo.info(`Creating Encoder with input:${JSON.stringify(e.shardInfo)}, determined:${JSON.stringify(t)}, expected:${JSON.stringify(this.networkConfig)}.`),!Xi(t,this.networkConfig))throw Error("Cannot create encoder: incompatible shard configuration.");return Sn({contentTopic:e.contentTopic,ephemeral:e.ephemeral,pubsubTopicShardInfo:t})}}class ro extends Error{static name="AbortError";constructor(e="The operation was aborted"){super(e),this.name="AbortError"}}class no extends Error{static name="UnexpectedPeerError";constructor(e="Unexpected Peer"){super(e),this.name="UnexpectedPeerError"}}Error;class so extends Error{static name="InvalidParametersError";constructor(e="Invalid parameters"){super(e),this.name="InvalidParametersError"}}class io extends Error{static name="InvalidPublicKeyError";constructor(e="Invalid public key"){super(e),this.name="InvalidPublicKeyError"}}class oo extends Error{static name="InvalidPrivateKeyError";constructor(e="Invalid private key"){super(e),this.name="InvalidPrivateKeyError"}}Error;class ao extends Error{static name="ConnectionClosingError";constructor(e="The connection is closing"){super(e),this.name="ConnectionClosingError"}}class co extends Error{static name="ConnectionClosedError";constructor(e="The connection is closed"){super(e),this.name="ConnectionClosedError"}}class lo extends Error{static name="ConnectionFailedError";constructor(e="Connection failed"){super(e),this.name="ConnectionFailedError"}}class uo extends Error{static name="MuxerClosedError";constructor(e="The muxer is closed"){super(e),this.name="MuxerClosedError"}}class ho extends Error{static name="StreamResetError";constructor(e="The stream has been reset"){super(e),this.name="StreamResetError"}}class po extends Error{static name="StreamStateError";constructor(e="The stream is in an invalid state"){super(e),this.name="StreamStateError"}}class fo extends Error{static name="NotFoundError";constructor(e="Not found"){super(e),this.name="NotFoundError"}}class go extends Error{static name="InvalidPeerIdError";constructor(e="Invalid PeerID"){super(e),this.name="InvalidPeerIdError"}}class mo extends Error{static name="InvalidMultiaddrError";constructor(e="Invalid multiaddr"){super(e),this.name="InvalidMultiaddrError"}}class yo extends Error{static name="InvalidCIDError";constructor(e="Invalid CID"){super(e),this.name="InvalidCIDError"}}class wo extends Error{static name="InvalidMultihashError";constructor(e="Invalid Multihash"){super(e),this.name="InvalidMultihashError"}}class bo extends Error{static name="UnsupportedProtocolError";constructor(e="Unsupported protocol error"){super(e),this.name="UnsupportedProtocolError"}}class vo extends Error{static name="InvalidMessageError";constructor(e="Invalid message"){super(e),this.name="InvalidMessageError"}}class Eo extends Error{static name="ProtocolError";constructor(e="Protocol error"){super(e),this.name="ProtocolError"}}class So extends Error{static name="TimeoutError";constructor(e="Timed out"){super(e),this.name="TimeoutError"}}class Ao extends Error{static name="NotStartedError";constructor(e="Not started"){super(e),this.name="NotStartedError"}}Error;class xo extends Error{static name="DialError";constructor(e="Dial error"){super(e),this.name="DialError"}}Error;class ko extends Error{static name="LimitedConnectionError";constructor(e="Limited connection"){super(e),this.name="LimitedConnectionError"}}class Io extends Error{static name="TooManyInboundProtocolStreamsError";constructor(e="Too many inbound protocol streams"){super(e),this.name="TooManyInboundProtocolStreamsError"}}class _o extends Error{static name="TooManyOutboundProtocolStreamsError";constructor(e="Too many outbound protocol streams"){super(e),this.name="TooManyOutboundProtocolStreamsError"}}class Co extends Error{static name="UnsupportedKeyTypeError";constructor(e="Unsupported key type"){super(e),this.name="UnsupportedKeyTypeError"}}const To=parseInt("11111",2),Po=parseInt("10000000",2),Lo=parseInt("01111111",2),Ro={0:Do,1:Do,2:function(e,t){const r=No(e,t),n=t.offset,s=t.offset+r,i=[];for(let t=n;t=e.byteLength);){const n=Oo(e,t);if(null===n)break;r.push(n)}return r}function Mo(e){if(e.byteLength<128)return Uint8Array.from([e.byteLength]);const t=function(e){let t=e.toString(16);t.length%2==1&&(t="0"+t);const r=new Ln;for(let e=0;e>Qo&Zo)}:{h:0|Number(e>>Qo&Zo),l:0|Number(e&Zo)}}const ea={fromBig:Yo,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,i)=>t+r+n+s+i+(e/2**32|0)|0,add5L:(e,t,r,n,s)=>(e>>>0)+(t>>>0)+(r>>>0)+(n>>>0)+(s>>>0)},ta=ea,[ra,na]=(()=>ta.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)))))(),sa=new Uint32Array(80),ia=new Uint32Array(80);class oa extends Br{constructor(e=64){super(128,e,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:i,Dh:o,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,i,o,a,c,l,u,h,d,p,f,g]}set(e,t,r,n,s,i,o,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|i,this.Dh=0|o,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)sa[r]=e.getUint32(t),ia[r]=e.getUint32(t+=4);for(let e=16;e<80;e++){const t=0|sa[e-15],r=0|ia[e-15],n=ta.rotrSH(t,r,1)^ta.rotrSH(t,r,8)^ta.shrSH(t,r,7),s=ta.rotrSL(t,r,1)^ta.rotrSL(t,r,8)^ta.shrSL(t,r,7),i=0|sa[e-2],o=0|ia[e-2],a=ta.rotrSH(i,o,19)^ta.rotrBH(i,o,61)^ta.shrSH(i,o,6),c=ta.rotrSL(i,o,19)^ta.rotrBL(i,o,61)^ta.shrSL(i,o,6),l=ta.add4L(s,c,ia[e-7],ia[e-16]),u=ta.add4H(l,n,a,sa[e-7],sa[e-16]);sa[e]=0|u,ia[e]=0|l}let{Ah:r,Al:n,Bh:s,Bl:i,Ch:o,Cl:a,Dh:c,Dl:l,Eh:u,El:h,Fh:d,Fl:p,Gh:f,Gl:g,Hh:m,Hl:y}=this;for(let e=0;e<80;e++){const t=ta.rotrSH(u,h,14)^ta.rotrSH(u,h,18)^ta.rotrBH(u,h,41),w=ta.rotrSL(u,h,14)^ta.rotrSL(u,h,18)^ta.rotrBL(u,h,41),b=u&d^~u&f,v=h&p^~h&g,E=ta.add5L(y,w,v,na[e],ia[e]),S=ta.add5H(E,m,t,b,ra[e],sa[e]),A=0|E,x=ta.rotrSH(r,n,28)^ta.rotrBH(r,n,34)^ta.rotrBH(r,n,39),k=ta.rotrSL(r,n,28)^ta.rotrBL(r,n,34)^ta.rotrBL(r,n,39),I=r&s^r&o^s&o,_=n&i^n&a^i&a;m=0|f,y=0|g,f=0|d,g=0|p,d=0|u,p=0|h,({h:u,l:h}=ta.add(0|c,0|l,0|S,0|A)),c=0|o,l=0|a,o=0|s,a=0|i,s=0|r,i=0|n;const C=ta.add3L(A,k,_);r=ta.add3H(C,S,x,I),n=0|C}({h:r,l:n}=ta.add(0|this.Ah,0|this.Al,0|r,0|n)),({h:s,l:i}=ta.add(0|this.Bh,0|this.Bl,0|s,0|i)),({h:o,l:a}=ta.add(0|this.Ch,0|this.Cl,0|o,0|a)),({h:c,l}=ta.add(0|this.Dh,0|this.Dl,0|c,0|l)),({h:u,l:h}=ta.add(0|this.Eh,0|this.El,0|u,0|h)),({h:d,l:p}=ta.add(0|this.Fh,0|this.Fl,0|d,0|p)),({h:f,l:g}=ta.add(0|this.Gh,0|this.Gl,0|f,0|g)),({h:m,l:y}=ta.add(0|this.Hh,0|this.Hl,0|m,0|y)),this.set(r,n,s,i,o,a,c,l,u,h,d,p,f,g,m,y)}roundClean(){sa.fill(0),ia.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 aa=Dr((()=>new oa)),ca=BigInt(0),la=BigInt(1);function ua(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&"Uint8Array"===e.constructor.name}function ha(e){if(!ua(e))throw new Error("Uint8Array expected")}function da(e,t){if("boolean"!=typeof t)throw new Error(e+" boolean expected, got "+t)}function pa(e){const t=e.toString(16);return 1&t.length?"0"+t:t}function fa(e){if("string"!=typeof e)throw new Error("hex string expected, got "+typeof e);return""===e?ca:BigInt("0x"+e)}const ga="function"==typeof Uint8Array.from([]).toHex&&"function"==typeof Uint8Array.fromHex,ma=Array.from({length:256},((e,t)=>t.toString(16).padStart(2,"0")));function ya(e){if(ha(e),ga)return e.toHex();let t="";for(let r=0;r=48&&e<=57?e-48:e>=65&&e<=70?e-55:e>=97&&e<=102?e-87:void 0}function ba(e){if("string"!=typeof e)throw new Error("hex string expected, got "+typeof e);if(ga)return Uint8Array.fromHex(e);const t=e.length,r=t/2;if(t%2)throw new Error("hex string expected, got unpadded hex of length "+t);const n=new Uint8Array(r);for(let t=0,s=0;t"bigint"==typeof e&&ca<=e;function _a(e,t,r){return Ia(e)&&Ia(t)&&Ia(r)&&t<=e&&e(la<new Uint8Array(e),La=e=>Uint8Array.from(e),Ra={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||ua(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 Oa(e,t,r={}){const n=(t,r,n)=>{const s=Ra[r];if("function"!=typeof s)throw new Error("invalid validator function");const i=e[t];if(!(n&&void 0===i||s(i,e)))throw new Error("param "+String(t)+" is invalid. Expected "+r+", got "+i)};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 Na(e){const t=new WeakMap;return(r,...n)=>{const s=t.get(r);if(void 0!==s)return s;const i=e(r,...n);return t.set(r,i),i}}const Da=BigInt(0),Ma=BigInt(1),Fa=BigInt(2),Ba=BigInt(3),Ua=BigInt(4),qa=BigInt(5),$a=BigInt(8);function ja(e,t){const r=e%t;return r>=Da?r:t+r}function za(e,t,r){if(tDa;)t&Ma&&(n=n*e%r),e=e*e%r,t>>=Ma;return n}function Ka(e,t,r){let n=e;for(;t-- >Da;)n*=n,n%=r;return n}function Ha(e,t){if(e===Da)throw new Error("invert: expected non-zero number");if(t<=Da)throw new Error("invert: expected positive modulus, got "+t);let r=ja(e,t),n=t,s=Da,i=Ma,o=Ma,a=Da;for(;r!==Da;){const e=n/r,t=n%r,c=s-o*e,l=i-a*e;n=r,r=t,s=o,i=a,o=c,a=l}if(n!==Ma)throw new Error("invert: does not exist");return ja(s,t)}const Va=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function Ga(e,t){const r=void 0!==t?t:e.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function Wa(e,t,r=!1,n={}){if(e<=Da)throw new Error("invalid field: expected ORDER > 0, got "+e);const{nBitLength:s,nByteLength:i}=Ga(e,t);if(i>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let o;const a=Object.freeze({ORDER:e,isLE:r,BITS:s,BYTES:i,MASK:Ta(s),ZERO:Da,ONE:Ma,create:t=>ja(t,e),isValid:t=>{if("bigint"!=typeof t)throw new Error("invalid field element: expected bigint, got "+typeof t);return Da<=t&&te===Da,isOdd:e=>(e&Ma)===Ma,neg:t=>ja(-t,e),eql:(e,t)=>e===t,sqr:t=>ja(t*t,e),add:(t,r)=>ja(t+r,e),sub:(t,r)=>ja(t-r,e),mul:(t,r)=>ja(t*r,e),pow:(e,t)=>function(e,t,r){if(rDa;)r&Ma&&(n=e.mul(n,s)),s=e.sqr(s),r>>=Ma;return n}(a,e,t),div:(t,r)=>ja(t*Ha(r,e),e),sqrN:e=>e*e,addN:(e,t)=>e+t,subN:(e,t)=>e-t,mulN:(e,t)=>e*t,inv:t=>Ha(t,e),sqrt:n.sqrt||(t=>(o||(o=function(e){if(e%Ua===Ba){const t=(e+Ma)/Ua;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%$a===qa){const t=(e-qa)/$a;return function(e,r){const n=e.mul(r,Fa),s=e.pow(n,t),i=e.mul(r,s),o=e.mul(e.mul(i,Fa),s),a=e.mul(i,e.sub(o,e.ONE));if(!e.eql(e.sqr(a),r))throw new Error("Cannot find square root");return a}}return function(e){const t=(e-Ma)/Fa;let r,n,s;for(r=e-Ma,n=0;r%Fa===Da;r/=Fa,n++);for(s=Fa;s1e3)throw new Error("Cannot find square root: likely non-prime P");if(1===n){const t=(e+Ma)/Ua;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}}const i=(r+Ma)/Fa;return function(e,o){if(e.pow(o,t)===e.neg(e.ONE))throw new Error("Cannot find square root");let a=n,c=e.pow(e.mul(e.ONE,s),r),l=e.pow(o,i),u=e.pow(o,r);for(;!e.eql(u,e.ONE);){if(e.eql(u,e.ZERO))return e.ZERO;let t=1;for(let r=e.sqr(u);tfunction(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?Aa(e,i):Sa(e,i),fromBytes:e=>{if(e.length!==i)throw new Error("Field.fromBytes: expected "+i+" bytes, got "+e.length);return r?Ea(e):va(e)}});return Object.freeze(a)}function Xa(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 Ja(e){const t=Xa(e);return t+Math.ceil(t/2)}const Za=BigInt(0),Qa=BigInt(1);function Ya(e,t){const r=t.negate();return e?r:t}function ec(e,t){if(!Number.isSafeInteger(e)||e<=0||e>t)throw new Error("invalid window size, expected [1.."+t+"], got W="+e)}function tc(e,t){ec(e,t);const r=2**e;return{windows:Math.ceil(t/e)+1,windowSize:2**(e-1),mask:Ta(e),maxNumber:r,shiftBy:BigInt(e)}}function rc(e,t,r){const{windowSize:n,mask:s,maxNumber:i,shiftBy:o}=r;let a=Number(e&s),c=e>>o;a>n&&(a-=i,c+=Qa);const l=t*n;return{nextN:c,offset:l+Math.abs(a)-1,isZero:0===a,isNeg:a<0,isNegF:t%2!=0,offsetF:l}}const nc=new WeakMap,sc=new WeakMap;function ic(e){return sc.get(e)||1}function oc(e,t){return{constTimeNegate:Ya,hasPrecomputes:e=>1!==ic(e),unsafeLadder(t,r,n=e.ZERO){let s=t;for(;r>Za;)r&Qa&&(n=n.add(s)),s=s.double(),r>>=Qa;return n},precomputeWindow(e,r){const{windows:n,windowSize:s}=tc(r,t),i=[];let o=e,a=o;for(let e=0;e{if(!(e instanceof t))throw new Error("invalid point at index "+r)}))}(r,e),function(e,t){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach(((e,r)=>{if(!t.isValid(e))throw new Error("invalid scalar at index "+r)}))}(n,t),r.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const s=e.ZERO,i=function(e){let t;for(t=0;e>ca;e>>=la,t+=1);return t}(BigInt(r.length)),o=i>12?i-3:i>4?i-2:i?2:1,a=Ta(o),c=new Array(Number(a)+1).fill(s);let l=s;for(let e=Math.floor((t.BITS-1)/o)*o;e>=0;e-=o){c.fill(s);for(let t=0;t>BigInt(e)&a);c[i]=c[i].add(r[t])}let t=s;for(let e=c.length-1,r=s;e>0;e--)r=r.add(c[e]),t=t.add(r);if(l=l.add(t),0!==e)for(let e=0;e(e[t]="function",e)),{ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"});Oa(e,t)}(e.Fp),Oa(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...Ga(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}const lc=BigInt(0),uc=BigInt(1),hc=BigInt(2),dc=BigInt(8),pc={zip215:!0};const fc=BigInt(0),gc=BigInt(1);const mc=BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"),yc=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752"),wc=(BigInt(0),BigInt(1)),bc=BigInt(2),vc=BigInt(3),Ec=BigInt(5),Sc=BigInt(8);function Ac(e){const t=BigInt(10),r=BigInt(20),n=BigInt(40),s=BigInt(80),i=mc,o=e*e%i*e%i,a=Ka(o,bc,i)*o%i,c=Ka(a,wc,i)*e%i,l=Ka(c,Ec,i)*c%i,u=Ka(l,t,i)*l%i,h=Ka(u,r,i)*u%i,d=Ka(h,n,i)*h%i,p=Ka(d,s,i)*d%i,f=Ka(p,s,i)*d%i,g=Ka(f,t,i)*l%i;return{pow_p_5_8:Ka(g,bc,i)*e%i,b2:o}}function xc(e){return e[0]&=248,e[31]&=127,e[31]|=64,e}function kc(e,t){const r=mc,n=ja(t*t*t,r),s=ja(n*n*t,r);let i=ja(e*n*Ac(e*s).pow_p_5_8,r);const o=ja(t*i*i,r),a=i,c=ja(i*yc,r),l=o===e,u=o===ja(-e,r),h=o===ja(-e*yc,r);return l&&(i=a),(u||h)&&(i=c),(ja(i,r)&Ma)===Ma&&(i=ja(-i,r)),{isValid:l||u,value:i}}const Ic=(()=>Wa(mc,void 0,!0))(),_c=(()=>({a:Ic.create(BigInt(-1)),d:BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),Fp:Ic,n:BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),h:Sc,Gx:BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),Gy:BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),hash:aa,randomBytes:Mr,adjustScalarBytes:xc,uvRatio:kc}))(),Cc=(()=>function(e){const t=function(e){const t=cc(e);return Oa(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:i,randomBytes:o,nByteLength:a,h:c}=t,l=hc<{try{return{isValid:!0,value:r.sqrt(e*r.inv(t))}}catch(e){return{isValid:!1,value:lc}}}),p=t.adjustScalarBytes||(e=>e),f=t.domain||((e,t,r)=>{if(da("phflag",r),t.length||r)throw new Error("Contexts/pre-hash are not supported");return e});function g(e,t,r=!1){Ca("coordinate "+e,t,r?uc:lc,l)}function m(e){if(!(e instanceof b))throw new Error("ExtendedPoint expected")}const y=Na(((e,t)=>{const{ex:n,ey:s,ez:i}=e,o=e.is0();null==t&&(t=o?dc:r.inv(i));const a=u(n*t),c=u(s*t),l=u(i*t);if(o)return{x:lc,y:uc};if(l!==uc)throw new Error("invZ was invalid");return{x:a,y:c}})),w=Na((e=>{const{a:r,d:n}=t;if(e.is0())throw new Error("bad point: ZERO");const{ex:s,ey:i,ez:o,et:a}=e,c=u(s*s),l=u(i*i),h=u(o*o),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*i)!==u(o*a))throw new Error("bad point: equation left != right (2)");return!0}));class b{constructor(e,t,r,n){g("x",e),g("y",t),g("z",r,!0),g("t",n),this.ex=e,this.ey=t,this.ez=r,this.et=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 g("x",t),g("y",r),new b(t,r,uc,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)}static msm(e,t){return ac(b,h,e,t)}_setWindowSize(e){S.setWindowSize(this,e)}assertValidity(){w(this)}equals(e){m(e);const{ex:t,ey:r,ez:n}=this,{ex:s,ey:i,ez:o}=e,a=u(t*o),c=u(s*n),l=u(r*o),h=u(i*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,i=u(r*r),o=u(n*n),a=u(hc*u(s*s)),c=u(e*i),l=r+n,h=u(u(l*l)-i-o),d=c+o,p=d-a,f=c-o,g=u(h*p),m=u(d*f),y=u(h*f),w=u(p*d);return new b(g,m,w,y)}add(e){m(e);const{a:r,d:n}=t,{ex:s,ey:i,ez:o,et:a}=this,{ex:c,ey:l,ez:h,et:d}=e,p=u(s*c),f=u(i*l),g=u(a*n*d),y=u(o*h),w=u((s+i)*(c+l)-p-f),v=y-g,E=y+g,S=u(f-r*p),A=u(w*v),x=u(E*S),k=u(w*S),I=u(v*E);return new b(A,x,I,k)}subtract(e){return this.add(e.negate())}wNAF(e){return S.wNAFCached(this,e,b.normalizeZ)}multiply(e){const t=e;Ca("scalar",t,uc,n);const{p:r,f:s}=this.wNAF(t);return b.normalizeZ([r,s])[0]}multiplyUnsafe(e,t=b.ZERO){const r=e;return Ca("scalar",r,lc,n),r===lc?E:this.is0()||r===uc?this:S.wNAFCachedUnsafe(this,r,b.normalizeZ,t)}isSmallOrder(){return this.multiplyUnsafe(c).is0()}isTorsionFree(){return S.unsafeLadder(this,n).is0()}toAffine(e){return y(this,e)}clearCofactor(){const{h:e}=t;return e===uc?this:this.multiplyUnsafe(e)}static fromHex(e,n=!1){const{d:s,a:i}=t,o=r.BYTES;e=xa("pointHex",e,o),da("zip215",n);const a=e.slice(),c=e[o-1];a[o-1]=-129&c;const h=Ea(a),p=n?l:r.ORDER;Ca("pointHex.y",h,lc,p);const f=u(h*h),g=u(f-uc),m=u(s*f-i);let{isValid:y,value:w}=d(g,m);if(!y)throw new Error("Point.fromHex: invalid y coordinate");const v=(w&uc)===uc,E=!!(128&c);if(!n&&w===lc&&E)throw new Error("Point.fromHex: x=0 and x_0=1");return E!==v&&(w=u(-w)),b.fromAffine({x:w,y:h})}static fromPrivateKey(e){const{scalar:t}=k(e);return v.multiply(t)}toRawBytes(){const{x:e,y:t}=this.toAffine(),n=Aa(t,r.BYTES);return n[n.length-1]|=e&uc?128:0,n}toHex(){return ya(this.toRawBytes())}}b.BASE=new b(t.Gx,t.Gy,uc,u(t.Gx*t.Gy)),b.ZERO=new b(lc,uc,uc,lc);const{BASE:v,ZERO:E}=b,S=oc(b,8*a);function A(e){return ja(e,n)}function x(e){return A(Ea(e))}function k(e){const t=r.BYTES;e=xa("private key",e,t);const n=xa("hashed private key",i(e),2*t),s=p(n.slice(0,t));return{head:s,prefix:n.slice(t,2*t),scalar:x(s)}}function I(e){const{head:t,prefix:r,scalar:n}=k(e),s=v.multiply(n),i=s.toRawBytes();return{head:t,prefix:r,scalar:n,point:s,pointBytes:i}}function _(e=new Uint8Array,...t){const r=ka(...t);return x(i(f(r,xa("context",e),!!s)))}const C=pc;return v._setWindowSize(8),{CURVE:t,getPublicKey:function(e){return I(e).pointBytes},sign:function(e,t,i={}){e=xa("message",e),s&&(e=s(e));const{prefix:o,scalar:a,pointBytes:c}=I(t),l=_(i.context,o,e),u=v.multiply(l).toRawBytes(),h=A(l+_(i.context,u,c,e)*a);return Ca("signature.s",h,lc,n),xa("result",ka(u,Aa(h,r.BYTES)),2*r.BYTES)},verify:function(e,t,n,i=C){const{context:o,zip215:a}=i,c=r.BYTES;e=xa("signature",e,2*c),t=xa("message",t),n=xa("publicKey",n,c),void 0!==a&&da("zip215",a),s&&(t=s(t));const l=Ea(e.slice(c,2*c));let u,h,d;try{u=b.fromHex(n,a),h=b.fromHex(e.slice(0,c),a),d=v.multiplyUnsafe(l)}catch(e){return!1}if(!a&&u.isSmallOrder())return!1;const p=_(o,h.toRawBytes(),u.toRawBytes(),t);return h.add(u.multiplyUnsafe(p)).subtract(d).clearCofactor().equals(b.ZERO)},ExtendedPoint:b,utils:{getExtendedPublicKey:I,randomPrivateKey:()=>o(r.BYTES),precompute:(e=8,t=b.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)}}}(_c))(),Tc=(()=>function(e){const t=(Oa(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=>ja(e,n),i=t.montgomeryBits,o=Math.ceil(i/8),a=t.nByteLength,c=t.adjustScalarBytes||(e=>e),l=t.powPminus2||(e=>za(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 Aa(s(e),o)}function p(e,t){const r=function(e){const t=xa("u coordinate",e,o);return 32===a&&(t[31]&=127),Ea(t)}(t),p=function(e){const t=xa("scalar",e),r=t.length;if(r!==o&&r!==a)throw new Error("invalid scalar, expected "+o+" or "+a+" bytes, got "+r);return Ea(c(t))}(e),f=function(e,t){Ca("u",e,fc,n),Ca("scalar",t,fc,n);const r=t,o=e;let a,c=gc,d=fc,p=e,f=gc,g=fc;for(let e=BigInt(i-1);e>=fc;e--){const t=r>>e&gc;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,i=s(n*n),l=c-d,m=s(l*l),y=i-m,w=p+f,b=s((p-f)*n),v=s(w*l),E=b+v,S=b-v;p=s(E*E),f=s(o*s(S*S)),c=s(i*m),d=s(y*(i+s(h*y)))}a=u(g,c,p),c=a[0],p=a[1],a=u(g,d,f),d=a[0],f=a[1];const m=l(d);return s(c*m)}(r,p);if(f===fc)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:mc,a:BigInt(486662),montgomeryBits:255,nByteLength:32,Gu:BigInt(9),powPminus2:e=>{const t=mc,{pow_p_5_8:r,b2:n}=Ac(e);return ja(Ka(r,vc,t)*n,t)},adjustScalarBytes:xc,randomBytes:Mr}))();function Pc(e,t){const r=new Uint8Array(64);for(let n=0;n<32;n++)r[n]=e[n],r[32+n]=t[n];return r}class Lc{type="Ed25519";raw;constructor(e){this.raw=Nc(e,32)}toMultihash(){return at.digest(wl(this))}toCID(){return mt.createV1(114,this.toMultihash())}toString(){return Ee.encode(this.toMultihash().bytes).substring(1)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}verify(e,t){return function(e,t,r){return Cc.verify(t,r instanceof Uint8Array?r:r.subarray(),e)}(this.raw,t,e)}}class Rc{type="Ed25519";raw;publicKey;constructor(e,t){this.raw=Nc(e,64),this.publicKey=new Lc(t)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}sign(e){return function(e,t){const r=e.subarray(0,32);return Cc.sign(t instanceof Uint8Array?t:t.subarray(),r)}(this.raw,e)}}function Oc(e){return e=Nc(e,32),new Lc(e)}function Nc(e,t){if((e=Uint8Array.from(e??[])).length!==t)throw new so(`Key must be a Uint8Array of length ${t}, got ${e.length}`);return e}var Dc,Mc,Fc,Bc;!function(e){e.RSA="RSA",e.Ed25519="Ed25519",e.secp256k1="secp256k1",e.ECDSA="ECDSA"}(Dc||(Dc={})),function(e){e[e.RSA=0]="RSA",e[e.Ed25519=1]="Ed25519",e[e.secp256k1=2]="secp256k1",e[e.ECDSA=3]="ECDSA"}(Mc||(Mc={})),function(e){e.codec=()=>br(Mc)}(Dc||(Dc={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),Dc.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!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.Type=Dc.codec().decode(e);break;case 2:n.Data=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Fc||(Fc={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),Dc.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!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.Type=Dc.codec().decode(e);break;case 2:n.Data=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Bc||(Bc={}));class Uc extends Error{constructor(e="An error occurred while signing a message"){super(e),this.name="SigningError"}}class qc extends Error{constructor(e="An error occurred while verifying a message"){super(e),this.name="VerificationError"}}class $c extends Error{constructor(e="Missing Web Crypto API"){super(e),this.name="WebCryptoMissingError"}}const jc={get(e=globalThis){const t=e.crypto;if(null==t?.subtle)throw new $c("Missing Web Crypto API. The most likely cause of this error is that this page is being accessed from an insecure context (i.e. not HTTPS). For more information and possible resolutions see https://github.com/libp2p/js-libp2p/blob/main/packages/crypto/README.md#web-crypto-api");return t}};class zc{type="RSA";jwk;_raw;_multihash;constructor(e,t){this.jwk=e,this._multihash=t}get raw(){return null==this._raw&&(this._raw=Vc(this.jwk)),this._raw}toMultihash(){return this._multihash}toCID(){return mt.createV1(114,this._multihash)}toString(){return Ee.encode(this.toMultihash().bytes).substring(1)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}verify(e,t){return async function(e,t,r){const n=await jc.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!1,["verify"]);return jc.get().subtle.verify({name:"RSASSA-PKCS1-v1_5"},n,t,r instanceof Uint8Array?r:r.subarray())}(this.jwk,t,e)}}class Kc{type="RSA";jwk;_raw;publicKey;constructor(e,t){this.jwk=e,this.publicKey=t}get raw(){return null==this._raw&&(this._raw=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 so("JWK was missing components");return Uo([Fo(Uint8Array.from([0])),Fo(It(e.n,"base64url")),Fo(It(e.e,"base64url")),Fo(It(e.d,"base64url")),Fo(It(e.p,"base64url")),Fo(It(e.q,"base64url")),Fo(It(e.dp,"base64url")),Fo(It(e.dq,"base64url")),Fo(It(e.qi,"base64url"))]).subarray()}(this.jwk)),this._raw}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}sign(e){return async function(e,t){const r=await jc.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!1,["sign"]),n=await jc.get().subtle.sign({name:"RSASSA-PKCS1-v1_5"},r,t instanceof Uint8Array?t:t.subarray());return new Uint8Array(n,0,n.byteLength)}(this.jwk,e)}}const Hc=Uint8Array.from([48,13,6,9,42,134,72,134,247,13,1,1,1,5,0]);function Vc(e){if(null==e.n||null==e.e)throw new so("JWK was missing components");return Uo([Hc,Bo(Uo([Fo(It(e.n,"base64url")),Fo(It(e.e,"base64url"))]))]).subarray()}function Gc(e,t,r){const n=function(e){const t=Oo(e[1],{offset:0});return{kty:"RSA",n:Yr(t[0],"base64url"),e:Yr(t[1],"base64url")}}(e);return null==r&&(r=nt(18,zr(Fc.encode({Type:Dc.RSA,Data:t})))),new zc(n,r)}class Wc extends Nr{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,Cr(e);const r=Or(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 Wc(e,t).update(r).digest();function Jc(e){void 0!==e.lowS&&da("lowS",e.lowS),void 0!==e.prehash&&da("prehash",e.prehash)}Xc.create=(e,t)=>new Wc(e,t);class Zc extends Error{constructor(e=""){super(e)}}const Qc={Err:Zc,_tlv:{encode:(e,t)=>{const{Err:r}=Qc;if(e<0||e>256)throw new r("tlv.encode: wrong tag");if(1&t.length)throw new r("tlv.encode: unpadded data");const n=t.length/2,s=pa(n);if(s.length/2&128)throw new r("tlv.encode: long form length too big");const i=n>127?pa(s.length/2|128):"";return pa(e)+i+s+t},decode(e,t){const{Err:r}=Qc;let n=0;if(e<0||e>256)throw new r("tlv.encode: wrong tag");if(t.length<2||t[n++]!==e)throw new r("tlv.decode: wrong tlv");const s=t[n++];let i=0;if(128&s){const e=127&s;if(!e)throw new r("tlv.decode(long): indefinite length not supported");if(e>4)throw new r("tlv.decode(long): byte length is too big");const o=t.subarray(n,n+e);if(o.length!==e)throw new r("tlv.decode: length bytes not complete");if(0===o[0])throw new r("tlv.decode(long): zero leftmost byte");for(const e of o)i=i<<8|e;if(n+=e,i<128)throw new r("tlv.decode(long): not minimal encoding")}else i=s;const o=t.subarray(n,n+i);if(o.length!==i)throw new r("tlv.decode: wrong value length");return{v:o,l:t.subarray(n+i)}}},_int:{encode(e){const{Err:t}=Qc;if(e{const s=t.toAffine();return ka(Uint8Array.from([4]),r.toBytes(s.x),r.toBytes(s.y))}),i=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,i=r.sqr(e),o=r.mul(i,e);return r.add(r.add(o,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 a(e){const{allowedPrivateKeyLengths:r,nByteLength:n,wrapPrivateKey:s,n:i}=t;if(r&&"bigint"!=typeof e){if(ua(e)&&(e=ya(e)),"string"!=typeof e||!r.includes(e.length))throw new Error("invalid private key");e=e.padStart(2*n,"0")}let o;try{o="bigint"==typeof e?e:va(xa("private key",e,n))}catch(t){throw new Error("invalid private key, expected hex or "+n+" bytes, got "+typeof e)}return s&&(o=ja(o,i)),Ca("private key",o,el,i),o}function c(e){if(!(e instanceof h))throw new Error("ProjectivePoint expected")}const l=Na(((e,t)=>{const{px:n,py:s,pz:i}=e;if(r.eql(i,r.ONE))return{x:n,y:s};const o=e.is0();null==t&&(t=o?r.ONE:r.inv(i));const a=r.mul(n,t),c=r.mul(s,t),l=r.mul(i,t);if(o)return{x:r.ZERO,y:r.ZERO};if(!r.eql(l,r.ONE))throw new Error("invZ was invalid");return{x:a,y:c}})),u=Na((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 h{constructor(e,t,n){if(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");this.px=e,this.py=t,this.pz=n,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 h)throw new Error("projective point not allowed");const s=e=>r.eql(e,r.ZERO);return s(t)&&s(n)?h.ZERO:new h(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(h.fromAffine)}static fromHex(e){const t=h.fromAffine(i(xa("pointHex",e)));return t.assertValidity(),t}static fromPrivateKey(e){return h.BASE.multiply(a(e))}static msm(e,t){return ac(h,n,e,t)}_setWindowSize(e){p.setWindowSize(this,e)}assertValidity(){u(this)}hasEvenY(){const{y:e}=this.toAffine();if(r.isOdd)return!r.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){c(e);const{px:t,py:n,pz:s}=this,{px:i,py:o,pz:a}=e,l=r.eql(r.mul(t,a),r.mul(i,s)),u=r.eql(r.mul(n,a),r.mul(o,s));return l&&u}negate(){return new h(this.px,r.neg(this.py),this.pz)}double(){const{a:e,b:n}=t,s=r.mul(n,tl),{px:i,py:o,pz:a}=this;let c=r.ZERO,l=r.ZERO,u=r.ZERO,d=r.mul(i,i),p=r.mul(o,o),f=r.mul(a,a),g=r.mul(i,o);return g=r.add(g,g),u=r.mul(i,a),u=r.add(u,u),c=r.mul(e,u),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),u=r.mul(s,u),f=r.mul(e,f),g=r.sub(d,f),g=r.mul(e,g),g=r.add(g,u),u=r.add(d,d),d=r.add(u,d),d=r.add(d,f),d=r.mul(d,g),l=r.add(l,d),f=r.mul(o,a),f=r.add(f,f),d=r.mul(f,g),c=r.sub(c,d),u=r.mul(f,p),u=r.add(u,u),u=r.add(u,u),new h(c,l,u)}add(e){c(e);const{px:n,py:s,pz:i}=this,{px:o,py:a,pz:l}=e;let u=r.ZERO,d=r.ZERO,p=r.ZERO;const f=t.a,g=r.mul(t.b,tl);let m=r.mul(n,o),y=r.mul(s,a),w=r.mul(i,l),b=r.add(n,s),v=r.add(o,a);b=r.mul(b,v),v=r.add(m,y),b=r.sub(b,v),v=r.add(n,i);let E=r.add(o,l);return v=r.mul(v,E),E=r.add(m,w),v=r.sub(v,E),E=r.add(s,i),u=r.add(a,l),E=r.mul(E,u),u=r.add(y,w),E=r.sub(E,u),p=r.mul(f,v),u=r.mul(g,w),p=r.add(u,p),u=r.sub(y,p),p=r.add(y,p),d=r.mul(u,p),y=r.add(m,m),y=r.add(y,m),w=r.mul(f,w),v=r.mul(g,v),y=r.add(y,w),w=r.sub(m,w),w=r.mul(f,w),v=r.add(v,w),m=r.mul(y,v),d=r.add(d,m),m=r.mul(E,v),u=r.mul(b,u),u=r.sub(u,m),m=r.mul(b,y),p=r.mul(E,p),p=r.add(p,m),new h(u,d,p)}subtract(e){return this.add(e.negate())}is0(){return this.equals(h.ZERO)}wNAF(e){return p.wNAFCached(this,e,h.normalizeZ)}multiplyUnsafe(e){const{endo:n,n:s}=t;Ca("scalar",e,Yc,s);const i=h.ZERO;if(e===Yc)return i;if(this.is0()||e===el)return this;if(!n||p.hasPrecomputes(this))return p.wNAFCachedUnsafe(this,e,h.normalizeZ);let{k1neg:o,k1:a,k2neg:c,k2:l}=n.splitScalar(e),u=i,d=i,f=this;for(;a>Yc||l>Yc;)a&el&&(u=u.add(f)),l&el&&(d=d.add(f)),f=f.double(),a>>=el,l>>=el;return o&&(u=u.negate()),c&&(d=d.negate()),d=new h(r.mul(d.px,n.beta),d.py,d.pz),u.add(d)}multiply(e){const{endo:n,n:s}=t;let i,o;if(Ca("scalar",e,el,s),n){const{k1neg:t,k1:s,k2neg:a,k2:c}=n.splitScalar(e);let{p:l,f:u}=this.wNAF(s),{p:d,f}=this.wNAF(c);l=p.constTimeNegate(t,l),d=p.constTimeNegate(a,d),d=new h(r.mul(d.px,n.beta),d.py,d.pz),i=l.add(d),o=u.add(f)}else{const{p:t,f:r}=this.wNAF(e);i=t,o=r}return h.normalizeZ([i,o])[0]}multiplyAndAddUnsafe(e,t,r){const n=h.BASE,s=(e,t)=>t!==Yc&&t!==el&&e.equals(n)?e.multiply(t):e.multiplyUnsafe(t),i=s(this,t).add(s(e,r));return i.is0()?void 0:i}toAffine(e){return l(this,e)}isTorsionFree(){const{h:e,isTorsionFree:r}=t;if(e===el)return!0;if(r)return r(h,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:r}=t;return e===el?this:r?r(h,this):this.multiplyUnsafe(t.h)}toRawBytes(e=!0){return da("isCompressed",e),this.assertValidity(),s(h,this,e)}toHex(e=!0){return da("isCompressed",e),ya(this.toRawBytes(e))}}h.BASE=new h(t.Gx,t.Gy,r.ONE),h.ZERO=new h(r.ZERO,r.ONE,r.ZERO);const d=t.nBitLength,p=oc(h,t.endo?Math.ceil(d/2):d);return{CURVE:t,ProjectivePoint:h,normPrivateKeyToScalar:a,weierstrassEquation:o,isWithinCurveOrder:function(e){return _a(e,el,t.n)}}}({...t,toBytes(e,t,n){const s=t.toAffine(),i=r.toBytes(s.x),o=ka;return da("isCompressed",n),n?o(Uint8Array.from([t.hasEvenY()?2:3]),i):o(Uint8Array.from([4]),i,r.toBytes(s.y))},fromBytes(e){const t=e.length,n=e[0],o=e.subarray(1);if(t!==s||2!==n&&3!==n){if(t===i&&4===n)return{x:r.fromBytes(o.subarray(0,r.BYTES)),y:r.fromBytes(o.subarray(r.BYTES,2*r.BYTES))};throw new Error("invalid Point, expected length of "+s+", or uncompressed "+i+", got "+t)}{const e=va(o);if(!_a(e,el,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&el)===el)&&(s=r.neg(s)),{x:e,y:s}}}}),d=e=>ya(Sa(e,t.nByteLength));function p(e){return e>n>>el}const f=(e,t,r)=>va(e.slice(t,r));class g{constructor(e,t,r){Ca("r",e,el,n),Ca("s",t,el,n),this.r=e,this.s=t,null!=r&&(this.recovery=r),Object.freeze(this)}static fromCompact(e){const r=t.nByteLength;return e=xa("compactSignature",e,2*r),new g(f(e,0,r),f(e,r,2*r))}static fromDER(e){const{r:t,s:r}=Qc.toSig(xa("DER",e));return new g(t,r)}assertValidity(){}addRecoveryBit(e){return new g(this.r,this.s,e)}recoverPublicKey(e){const{r:n,s,recovery:i}=this,l=b(xa("msgHash",e));if(null==i||![0,1,2,3].includes(i))throw new Error("recovery id invalid");const u=2===i||3===i?n+t.n:n;if(u>=r.ORDER)throw new Error("recovery id 2 or 3 invalid");const h=1&i?"03":"02",p=c.fromHex(h+d(u)),f=a(u),g=o(-l*f),m=o(s*f),y=c.BASE.multiplyAndAddUnsafe(p,g,m);if(!y)throw new Error("point at infinify");return y.assertValidity(),y}hasHighS(){return p(this.s)}normalizeS(){return this.hasHighS()?new g(this.r,o(-this.s),this.recovery):this}toDERRawBytes(){return ba(this.toDERHex())}toDERHex(){return Qc.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return ba(this.toCompactHex())}toCompactHex(){return d(this.r)+d(this.s)}}const m={isValidPrivateKey(e){try{return l(e),!0}catch(e){return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const e=Ja(t.n);return function(e,t,r=!1){const n=e.length,s=Xa(t),i=Ja(t);if(n<16||n1024)throw new Error("expected "+i+"-1024 bytes of input, got "+n);const o=ja(r?Ea(e):va(e),t-Ma)+Ma;return r?Aa(o,s):Sa(o,s)}(t.randomBytes(e),t.n)},precompute:(e=8,t=c.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)};function y(e){const t=ua(e),r="string"==typeof e,n=(t||r)&&e.length;return t?n===s||n===i:r?n===2*s||n===2*i:e instanceof c}const w=t.bits2int||function(e){if(e.length>8192)throw new Error("input is too large");const r=va(e),n=8*e.length-t.nBitLength;return n>0?r>>BigInt(n):r},b=t.bits2int_modN||function(e){return o(w(e))},v=Ta(t.nBitLength);function E(e){return Ca("num < 2^"+t.nBitLength,e,Yc,v),Sa(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(y(e))throw new Error("first arg must be private key");if(!y(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:i,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:i,randomBytes:u}=t;let{lowS:d,prehash:f,extraEntropy:m}=s;null==d&&(d=!0),e=xa("msgHash",e),Jc(s),f&&(e=xa("prehashed msgHash",i(e)));const y=b(e),v=l(n),A=[E(v),E(y)];if(null!=m&&!1!==m){const e=!0===m?u(r.BYTES):m;A.push(xa("extraEntropy",e))}const x=ka(...A),k=y;return{seed:x,k2sig:function(e){const t=w(e);if(!h(t))return;const r=a(t),n=c.BASE.multiply(t).toAffine(),s=o(n.x);if(s===Yc)return;const i=o(r*o(k+s*v));if(i===Yc)return;let l=(n.x===s?0:2)|Number(n.y&el),u=i;return d&&p(i)&&(u=function(e){return p(e)?o(-e):e}(i),l^=1),new g(s,u,l)}}}(e,n,s),d=t,f=function(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=Pa(e),s=Pa(e),i=0;const o=()=>{n.fill(1),s.fill(0),i=0},a=(...e)=>r(s,n,...e),c=(e=Pa(0))=>{s=a(La([0]),e),n=a(),0!==e.length&&(s=a(La([1]),e),n=a())},l=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let e=0;const r=[];for(;e{let r;for(o(),c(e);!(r=t(l()));)c();return o(),r}}(d.hash.outputLen,d.nByteLength,d.hmac);return f(i,u)},verify:function(e,r,n,s=A){const i=e;r=xa("msgHash",r),n=xa("publicKey",n);const{lowS:l,prehash:u,format:h}=s;if(Jc(s),"strict"in s)throw new Error("options.strict was renamed to lowS");if(void 0!==h&&"compact"!==h&&"der"!==h)throw new Error("format must be compact or der");const d="string"==typeof i||ua(i),p=!d&&!h&&"object"==typeof i&&null!==i&&"bigint"==typeof i.r&&"bigint"==typeof i.s;if(!d&&!p)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let f,m;try{if(p&&(f=new g(i.r,i.s)),d){try{"compact"!==h&&(f=g.fromDER(i))}catch(e){if(!(e instanceof Qc.Err))throw e}f||"der"===h||(f=g.fromCompact(i))}m=c.fromHex(n)}catch(e){return!1}if(!f)return!1;if(l&&f.hasHighS())return!1;u&&(r=t.hash(r));const{r:y,s:w}=f,v=b(r),E=a(w),S=o(v*E),x=o(y*E),k=c.BASE.multiplyAndAddUnsafe(m,S,x)?.toAffine();return!!k&&o(k.x)===y},ProjectivePoint:c,Signature:g,utils:m}}function nl(e){return{hash:e,hmac:(t,...r)=>Xc(e,t,function(...e){let t=0;for(let r=0;r(e+t/al)/t;const ll=Wa(sl,void 0,void 0,{sqrt:function(e){const t=sl,r=BigInt(3),n=BigInt(6),s=BigInt(11),i=BigInt(22),o=BigInt(23),a=BigInt(44),c=BigInt(88),l=e*e*e%t,u=l*l*e%t,h=Ka(u,r,t)*u%t,d=Ka(h,r,t)*u%t,p=Ka(d,al,t)*l%t,f=Ka(p,s,t)*p%t,g=Ka(f,i,t)*f%t,m=Ka(g,a,t)*g%t,y=Ka(m,c,t)*m%t,w=Ka(y,a,t)*g%t,b=Ka(w,r,t)*u%t,v=Ka(b,o,t)*f%t,E=Ka(v,n,t)*l%t,S=Ka(E,al,t);if(!ll.eql(ll.sqr(S),e))throw new Error("Cannot find square root");return S}}),ul=function(e,t){const r=t=>rl({...e,...nl(t)});return{...r(t),create:r}}({a:BigInt(0),b:BigInt(7),Fp:ll,n:il,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:e=>{const t=il,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-ol*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=r,o=BigInt("0x100000000000000000000000000000000"),a=cl(i*e,t),c=cl(-n*e,t);let l=ja(e-a*r-c*s,t),u=ja(-a*n-c*i,t);const h=l>o,d=u>o;if(h&&(l=t-l),d&&(u=t-u),l>o||u>o)throw new Error("splitScalar: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}}},zr);function hl(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}BigInt(0),ul.ProjectivePoint;class dl{type="secp256k1";raw;_key;constructor(e){this._key=function(e){try{return ul.ProjectivePoint.fromHex(e),e}catch(e){throw new io(String(e))}}(e),this.raw=function(e){return ul.ProjectivePoint.fromHex(e).toRawBytes(!0)}(this._key)}toMultihash(){return at.digest(wl(this))}toCID(){return mt.createV1(114,this.toMultihash())}toString(){return Ee.encode(this.toMultihash().bytes).substring(1)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}verify(e,t){return function(e,t,r){const n=ht.digest(r instanceof Uint8Array?r:r.subarray());if(hl(n))return n.then((({digest:r})=>ul.verify(t,r,e))).catch((e=>{throw new qc(String(e))}));try{return ul.verify(t,n.digest,e)}catch(e){throw new qc(String(e))}}(this._key,t,e)}}class pl{type="secp256k1";raw;publicKey;constructor(e,t){this.raw=function(e){try{return ul.getPublicKey(e,!0),e}catch(e){throw new oo(String(e))}}(e),this.publicKey=new dl(t??function(e){try{return ul.getPublicKey(e,!0)}catch(e){throw new oo(String(e))}}(e))}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}sign(e){return function(e,t){const r=ht.digest(t instanceof Uint8Array?t:t.subarray());if(hl(r))return r.then((({digest:t})=>ul.sign(t,e).toDERRawBytes())).catch((e=>{throw new Uc(String(e))}));try{return ul.sign(r.digest,e).toDERRawBytes()}catch(e){throw new Uc(String(e))}}(this.raw,e)}}function fl(e){return new dl(e)}async function gl(e,t){if("Ed25519"===e)return async function(){const{privateKey:e,publicKey:t}=function(){const e=Cc.utils.randomPrivateKey(),t=Cc.getPublicKey(e);return{privateKey:Pc(e,t),publicKey:t}}();return new Rc(e,t)}();if("secp256k1"===e)return async function(){const e=ul.utils.randomPrivateKey();return new pl(e)}();if("RSA"===e)return async function(e){if(e>8192)throw new so("Key size is too large");const t=await async function(e){const t=await jc.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 async function(e){if(null==e.privateKey||null==e.publicKey)throw new so("Private and public key are required");return Promise.all([jc.get().subtle.exportKey("jwk",e.privateKey),jc.get().subtle.exportKey("jwk",e.publicKey)])}(t);return{privateKey:r[0],publicKey:r[1]}}(e),r=nt(18,zr(Fc.encode({Type:Dc.RSA,Data:Vc(t.publicKey)})));return new Kc(t.privateKey,new zc(t.publicKey,r))}(function(e){return null==e?2048:parseInt(e,10)}(t));if("ECDSA"===e)return async function(e="P-256"){const t=await async function(e="P-256"){const t=await crypto.subtle.generateKey({name:"ECDSA",namedCurve:e},!0,["sign","verify"]);return{publicKey:await crypto.subtle.exportKey("jwk",t.publicKey),privateKey:await crypto.subtle.exportKey("jwk",t.privateKey)}}(e);return new $o(t.privateKey)}(function(e){if("P-256"===e||null==e)return"P-256";if("P-384"===e)return"P-384";if("P-521"===e)return"P-521";throw new so("Unsupported curve, should be P-256, P-384 or P-521")}(t));throw new Co}async function ml(e,t){if("Ed25519"!==e)throw new Co("Seed key derivation only supported for Ed25519 keys");return async function(e){const{privateKey:t,publicKey:r}=function(e){if(32!==e.length)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=Cc.getPublicKey(t);return{privateKey:Pc(t,r),publicKey:r}}(e);return new Rc(t,r)}(t)}function yl(e,t){const{Type:r,Data:n}=Fc.decode(e),s=n??new Uint8Array;switch(r){case Dc.RSA:return function(e,t){if(e.byteLength>=1062)throw new io("Key size is too large");return Gc(Oo(e,{offset:0}),e,t)}(s,t);case Dc.Ed25519:return Oc(s);case Dc.secp256k1:return fl(s);case Dc.ECDSA:return Wo(s);default:throw new Co}}function wl(e){return Fc.encode({Type:Dc[e.type],Data:e.raw})}const bl=Symbol.for("@libp2p/service-capabilities"),vl=Symbol.for("@libp2p/service-dependencies"),El=Symbol.for("nodejs.util.inspect.custom");class Sl{type;multihash;publicKey;string;constructor(e){this.type=e.type,this.multihash=e.multihash,Object.defineProperty(this,"string",{enumerable:!1,writable:!0})}get[Symbol.toStringTag](){return`PeerId(${this.toString()})`}[Rs]=!0;toString(){return null==this.string&&(this.string=Ee.encode(this.multihash.bytes).slice(1)),this.string}toMultihash(){return this.multihash}toCID(){return mt.createV1(114,this.multihash)}toJSON(){return this.toString()}equals(e){if(null==e)return!1;if(e instanceof Uint8Array)return _n(this.multihash.bytes,e);if("string"==typeof e)return this.toString()===e;if(null!=e?.toMultihash()?.bytes)return _n(this.multihash.bytes,e.toMultihash().bytes);throw new Error("not valid Id")}[El](){return`PeerId(${this.toString()})`}}class Al extends Sl{type="RSA";publicKey;constructor(e){super({...e,type:"RSA"}),this.publicKey=e.publicKey}}class xl extends Sl{type="Ed25519";publicKey;constructor(e){super({...e,type:"Ed25519"}),this.publicKey=e.publicKey}}class kl extends Sl{type="secp256k1";publicKey;constructor(e){super({...e,type:"secp256k1"}),this.publicKey=e.publicKey}}class Il{type="url";multihash;publicKey;url;constructor(e){this.url=e.toString(),this.multihash=at.digest(It(this.url))}[El](){return`PeerId(${this.url})`}[Rs]=!0;toString(){return this.toCID().toString()}toMultihash(){return this.multihash}toCID(){return mt.createV1(2336,this.toMultihash())}toJSON(){return this.toString()}equals(e){return null!=e&&(e instanceof Uint8Array&&(e=Yr(e)),e.toString()===this.toString())}}function _l(e,t){let r;if("1"===e.charAt(0)||"Q"===e.charAt(0))r=st(Ee.decode(`z${e}`));else{if(e.startsWith("k51qzi5uqu5")||e.startsWith("kzwfwjn5ji4")||e.startsWith("k2k4r8")||e.startsWith("bafz"))return Pl(mt.parse(e));if(null==t)throw new so('Please pass a multibase decoder for strings that do not start with "1" or "Q"');r=st(t.decode(e))}return Tl(r)}function Cl(e){if("Ed25519"===e.type)return new xl({multihash:e.toCID().multihash,publicKey:e});if("secp256k1"===e.type)return new kl({multihash:e.toCID().multihash,publicKey:e});if("RSA"===e.type)return new Al({multihash:e.toCID().multihash,publicKey:e});throw new Co}function Tl(e){if(function(e){return e.code===ht.code}(e))return new Al({multihash:e});if(function(e){return e.code===at.code}(e))try{const t=function(e){const{Type:t,Data:r}=Fc.decode(e.digest),n=r??new Uint8Array;switch(t){case Dc.Ed25519:return Oc(n);case Dc.secp256k1:return fl(n);case Dc.ECDSA:return Wo(n);default:throw new Co}}(e);if("Ed25519"===t.type)return new xl({multihash:e,publicKey:t});if("secp256k1"===t.type)return new kl({multihash:e,publicKey:t})}catch(t){const r=Yr(e.digest);return new Il(new URL(r))}throw new wo("Supplied PeerID Multihash is invalid")}function Pl(e){if(null==e?.multihash||null==e.version||1===e.version&&114!==e.code&&2336!==e.code)throw new yo("Supplied PeerID CID is invalid");if(2336===e.code){const t=Yr(e.multihash.digest);return new Il(new URL(t))}return Tl(e.multihash)}class Ll{readNext;haveNext;ended;nextResult;constructor(){this.ended=!1,this.readNext=jn(),this.haveNext=jn()}[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=jn(),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(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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=jn(),await Wn(this.readNext.promise,t?.signal,t)}}class Rl extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class Ol extends Error{code;constructor(e,t){super(e),this.code=t}}class Nl extends Ol{type;constructor(e){super(e,"ABORT_ERR"),this.type="aborted",this.name="AbortError"}}function Dl(e,t){const r=new Ll;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 Ln,i={read:async(e,t)=>{let r;t?.signal?.throwIfAborted();const i=new Promise(((e,n)=>{r=()=>{n(new Nl("Read aborted"))},t?.signal?.addEventListener("abort",r)}));try{if(null==e){const{done:e,value:t}=await Promise.race([n.next(),i]);return!0===e?new Ln: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 i}class Ml extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Fl extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class Bl extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function Ul(e,t={}){const r=Dl(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=k(t.maxDataLength));const n=t?.lengthDecoder??T,s=t?.lengthEncoder??C;return{read:async e=>{let s=-1;const i=new Ln;for(;;){i.append(await r.read(1,e));try{s=n(i)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new Ml("Invalid message length");if(null!=t?.maxLengthLength&&i.byteLength>t.maxLengthLength)throw new Bl("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new Fl("message length too long");return r.read(s,e)},write:async(e,t)=>{await r.write(new Ln(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Ln(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}function ql(){const e=jn();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 $l=65535,jl=Boolean(globalThis.process?.env?.DUMP_SESSION_KEYS);function zl(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function Kl(e){if("boolean"!=typeof e)throw new Error(`boolean expected, not ${e}`)}function Hl(e){return e instanceof Uint8Array||null!=e&&"object"==typeof e&&"Uint8Array"===e.constructor.name}function Vl(e,...t){if(!Hl(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 Gl(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 Wl=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 Xl(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(!Hl(e))throw new Error("Uint8Array expected, got "+typeof e);e=Ql(e)}return e}const Jl=(e,t)=>(Object.assign(t,e),t);function Zl(e,t,r,n){if("function"==typeof e.setBigUint64)return e.setBigUint64(t,r,n);const s=BigInt(32),i=BigInt(4294967295),o=Number(r>>s&i),a=Number(r&i),c=n?4:0,l=n?0:4;e.setUint32(t+c,o,n),e.setUint32(t+l,a,n)}function Ql(e){return Uint8Array.from(e)}function Yl(...e){for(let t=0;tUint8Array.from(e.split("").map((e=>e.charCodeAt(0)))),tu=eu("expand 16-byte k"),ru=eu("expand 32-byte k"),nu=Wl(tu),su=Wl(ru);function iu(e,t){return e<>>32-t}function ou(e){return e.byteOffset%4==0}su.slice();const au=2**32-1,cu=new Uint32Array;function lu(e,t){const{allowShortKeys:r,extendNonceFn:n,counterLength:s,counterRight:i,rounds:o}=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 zl(s),zl(o),Kl(i),Kl(r),(t,a,c,l,u=0)=>{Vl(t),Vl(a),Vl(c);const h=c.length;if(void 0===l&&(l=new Uint8Array(h)),Vl(l),zl(u),u<0||u>=au)throw new Error("arx: counter overflow");if(l.length=au)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 hu{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,Vl(e=Xl(e),32);const t=uu(e,0),r=uu(e,2),n=uu(e,4),s=uu(e,6),i=uu(e,8),o=uu(e,10),a=uu(e,12),c=uu(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|i<<12),this.r[5]=i>>>1&8190,this.r[6]=8191&(i>>>14|o<<2),this.r[7]=8065&(o>>>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]=uu(e,16+2*t)}process(e,t,r=!1){const n=r?0:2048,{h:s,r:i}=this,o=i[0],a=i[1],c=i[2],l=i[3],u=i[4],h=i[5],d=i[6],p=i[7],f=i[8],g=i[9],m=uu(e,t+0),y=uu(e,t+2),w=uu(e,t+4),b=uu(e,t+6),v=uu(e,t+8),E=uu(e,t+10),S=uu(e,t+12),A=uu(e,t+14);let x=s[0]+(8191&m),k=s[1]+(8191&(m>>>13|y<<3)),I=s[2]+(8191&(y>>>10|w<<6)),_=s[3]+(8191&(w>>>7|b<<9)),C=s[4]+(8191&(b>>>4|v<<12)),T=s[5]+(v>>>1&8191),P=s[6]+(8191&(v>>>14|E<<2)),L=s[7]+(8191&(E>>>11|S<<5)),R=s[8]+(8191&(S>>>8|A<<8)),O=s[9]+(A>>>5|n),N=0,D=N+x*o+k*(5*g)+I*(5*f)+_*(5*p)+C*(5*d);N=D>>>13,D&=8191,D+=T*(5*h)+P*(5*u)+L*(5*l)+R*(5*c)+O*(5*a),N+=D>>>13,D&=8191;let M=N+x*a+k*o+I*(5*g)+_*(5*f)+C*(5*p);N=M>>>13,M&=8191,M+=T*(5*d)+P*(5*h)+L*(5*u)+R*(5*l)+O*(5*c),N+=M>>>13,M&=8191;let F=N+x*c+k*a+I*o+_*(5*g)+C*(5*f);N=F>>>13,F&=8191,F+=T*(5*p)+P*(5*d)+L*(5*h)+R*(5*u)+O*(5*l),N+=F>>>13,F&=8191;let B=N+x*l+k*c+I*a+_*o+C*(5*g);N=B>>>13,B&=8191,B+=T*(5*f)+P*(5*p)+L*(5*d)+R*(5*h)+O*(5*u),N+=B>>>13,B&=8191;let U=N+x*u+k*l+I*c+_*a+C*o;N=U>>>13,U&=8191,U+=T*(5*g)+P*(5*f)+L*(5*p)+R*(5*d)+O*(5*h),N+=U>>>13,U&=8191;let q=N+x*h+k*u+I*l+_*c+C*a;N=q>>>13,q&=8191,q+=T*o+P*(5*g)+L*(5*f)+R*(5*p)+O*(5*d),N+=q>>>13,q&=8191;let $=N+x*d+k*h+I*u+_*l+C*c;N=$>>>13,$&=8191,$+=T*a+P*o+L*(5*g)+R*(5*f)+O*(5*p),N+=$>>>13,$&=8191;let j=N+x*p+k*d+I*h+_*u+C*l;N=j>>>13,j&=8191,j+=T*c+P*a+L*o+R*(5*g)+O*(5*f),N+=j>>>13,j&=8191;let z=N+x*f+k*p+I*d+_*h+C*u;N=z>>>13,z&=8191,z+=T*l+P*c+L*a+R*o+O*(5*g),N+=z>>>13,z&=8191;let K=N+x*g+k*f+I*p+_*d+C*h;N=K>>>13,K&=8191,K+=T*u+P*l+L*c+R*a+O*o,N+=K>>>13,K&=8191,N=(N<<2)+N|0,N=N+D|0,D=8191&N,N>>>=13,M+=N,s[0]=D,s[1]=M,s[2]=F,s[3]=B,s[4]=U,s[5]=q,s[6]=$,s[7]=j,s[8]=z,s[9]=K}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 i=e[0]+t[0];e[0]=65535&i;for(let r=1;r<8;r++)i=(e[r]+t[r]|0)+(i>>>16)|0,e[r]=65535&i;Yl(r)}update(e){Gl(this);const{buffer:t,blockLen:r}=this,n=(e=Xl(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 du=function(e){const t=(t,r)=>e(r).update(Xl(t)).digest(),r=e(new Uint8Array(32));return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=t=>e(t),t}((e=>new hu(e)));function pu(e,t,r,n,s,i=20){let o=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],m=t[6],y=t[7],w=s,b=r[0],v=r[1],E=r[2],S=o,A=a,x=c,k=l,I=u,_=h,C=d,T=p,P=f,L=g,R=m,O=y,N=w,D=b,M=v,F=E;for(let e=0;e{e.update(t);const r=t.length%16;r&&e.update(mu.subarray(r))},wu=new Uint8Array(32);function bu(e,t,r,n,s){const i=e(t,r,wu),o=du.create(i);s&&yu(o,s),yu(o,n);const a=new Uint8Array(16),c=(l=a,new DataView(l.buffer,l.byteOffset,l.byteLength));var l;Zl(c,0,BigInt(s?s.length:0),!0),Zl(c,8,BigInt(n.length),!0),o.update(a);const u=o.digest();return Yl(i,a),u}const vu=e=>(t,r,n)=>(Vl(t,32),Vl(r),{encrypt(s,i){const o=s.length,a=o+16;i?Vl(i,a):i=new Uint8Array(a),e(t,r,s,i,1);const c=bu(e,t,r,i.subarray(0,-16),n);return i.set(c,o),Yl(c),i},decrypt(s,i){const o=s.length,a=o-16;if(o<16)throw new Error("encrypted data must be at least 16 bytes");i?Vl(i,a):i=new Uint8Array(a);const c=s.subarray(0,-16),l=s.subarray(-16),u=bu(e,t,r,c,n);if(!function(e,t){if(e.length!==t.length)return!1;let r=0;for(let n=0;nzr(e.subarray()),getHKDF(e,t){const r=function(e,t,r){return Cr(e),void 0===r&&(r=new Uint8Array(e.outputLen)),Xc(e,Or(r),Or(t))}(zr,t,e),n=function(e,t,r,n=32){if(Cr(e),Ir(n),n>255*e.outputLen)throw new Error("Length should be <= 255*HashLen");const s=Math.ceil(n/e.outputLen);void 0===r&&(r=Au);const i=new Uint8Array(s*e.outputLen),o=Xc.create(e,t),a=o._cloneInto(),c=new Uint8Array(o.outputLen);for(let t=0;t({publicKey:Tc.getPublicKey(e),privateKey:e}),generateX25519SharedKey:(e,t)=>Tc.getSharedSecret(e.subarray(),t.subarray()),chaCha20Poly1305Encrypt:(e,t,r,n)=>Eu(n,t,r).encrypt(e.subarray()),chaCha20Poly1305Decrypt:(e,t,r,n,s)=>Eu(n,t,r).decrypt(e.subarray(),s)},ku=e=>{const t=g(2);return t[0]=e>>8,t[1]=e,t};ku.bytes=2;const Iu=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 _u(e,t){t.enabled&&jl&&(e?(t(`LOCAL_STATIC_PUBLIC_KEY ${Yr(e.publicKey,"hex")}`),t(`LOCAL_STATIC_PRIVATE_KEY ${Yr(e.privateKey,"hex")}`)):t("Missing local static keys."))}function Cu(e,t){t.enabled&&jl&&(e?(t(`LOCAL_PUBLIC_EPHEMERAL_KEY ${Yr(e.publicKey,"hex")}`),t(`LOCAL_PRIVATE_EPHEMERAL_KEY ${Yr(e.privateKey,"hex")}`)):t("Missing local ephemeral keys."))}function Tu(e,t){t.enabled&&jl&&t(e?`REMOTE_EPHEMERAL_PUBLIC_KEY ${Yr(e.subarray(),"hex")}`:"Missing remote ephemeral keys.")}function Pu(e,t,r){r.enabled&&jl&&(r(`CIPHER_STATE_1 ${e.n.getUint64()} ${e.k&&Yr(e.k,"hex")}`),r(`CIPHER_STATE_2 ${t.n.getUint64()} ${t.k&&Yr(t.k,"hex")}`))}Iu.bytes=2;class Lu extends Error{code;constructor(e="Invalid crypto exchange"){super(e),this.code=Lu.code}static code="ERR_INVALID_CRYPTO_EXCHANGE"}class Ru{n;bytes;view;constructor(e=0){this.n=e,this.bytes=f(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 Ou=f(0);class Nu{k;n;crypto;constructor(e,t=void 0,r=0){this.crypto=e,this.k=t,this.n=new Ru(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 Du{cs;ck;h;crypto;constructor(e,t){this.crypto=e;const r=It(t,"utf-8");this.h=function(e,t){if(t.length<=32){const e=f(32);return e.set(t),e}return e.hash(t)}(e,r),this.ck=this.h,this.cs=new Nu(e)}mixKey(e){const[t,r]=this.crypto.hkdf(this.ck,e);this.ck=t,this.cs=new Nu(this.crypto,r)}mixHash(e){this.h=this.crypto.hash(new Ln(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,Ou);return[new Nu(this.crypto,e),new Nu(this.crypto,t)]}}class Mu{ss;s;e;rs;re;initiator;crypto;constructor(e){const{crypto:t,protocolName:r,prologue:n,initiator:s,s:i,e:o,rs:a,re:c}=e;this.crypto=t,this.ss=new Du(t,r),this.ss.mixHash(n),this.initiator=s,this.s=i,this.e=o,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=vr(((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=>qt(t,e.codec()),e.decode=t=>H(t,e.codec())}(Bu||(Bu={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),Bu.codec().encode(e.extensions,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={identityKey:f(0),identitySig:f(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=Bu.codec().decode(e,e.uint32());break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>qt(t,e.codec()),e.decode=t=>H(t,e.codec())}(Uu||(Uu={}));class zu{protocol="/noise";crypto;prologue;staticKey;extensions;metrics;components;constructor(e,t={}){const{staticNoiseKey:r,extensions:n,crypto:s,prologueBytes:i}=t,{metrics:o}=e;this.components=e;const a=s??xu;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=o?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"})}}(o):void 0,this.staticKey=r?a.generateX25519KeyPairFromSeed(r):a.generateX25519KeyPair(),this.prologue=i??f(0)}[Symbol.toStringTag]="@chainsafe/libp2p-noise";[bl]=["@libp2p/connection-encryption","@chainsafe/libp2p-noise"];async secureOutbound(e,t){const r=Ul(e,{lengthEncoder:ku,lengthDecoder:Iu,maxDataLength:$l}),n=await this.performHandshakeInitiator(r,this.components.privateKey,t?.remotePeer?.publicKey,t),s=await this.createSecureConnection(r,n);e.source=s.source,e.sink=s.sink;const i=yl(n.payload.identityKey);return{conn:e,remoteExtensions:n.payload.extensions,remotePeer:Cl(i)}}async secureInbound(e,t){const r=Ul(e,{lengthEncoder:ku,lengthDecoder:Iu,maxDataLength:$l}),n=await this.performHandshakeResponder(r,this.components.privateKey,t?.remotePeer?.publicKey,t),s=await this.createSecureConnection(r,n);e.source=s.source,e.sink=s.sink;const i=yl(n.payload.identityKey);return{conn:e,remoteExtensions:n.payload.extensions,remotePeer:Cl(i)}}async performHandshakeInitiator(e,t,r,n){let s;try{s=await async function(e,t){const{log:r,connection:n,crypto:s,privateKey:i,prologue:o,s:a,remoteIdentityKey:c,extensions:l}=e,u=await qu(i,a.publicKey,l),h=new Fu({crypto:s,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!0,prologue:o,s:a});_u(h.s,r),r.trace("Stage 0 - Initiator starting to send first message."),await n.write(h.writeMessageA(Ou),t),r.trace("Stage 0 - Initiator finished sending first message."),Cu(h.e,r),r.trace("Stage 1 - Initiator waiting to receive first message from responder...");const d=h.readMessageB(await n.read(t));var p,f;r.trace("Stage 1 - Initiator received the message."),Tu(h.re,r),p=h.rs,(f=r).enabled&&jl&&f(p?`REMOTE_STATIC_PUBLIC_KEY ${Yr(p.subarray(),"hex")}`:"Missing remote static public key."),r.trace("Initiator going to check remote's signature...");const g=await $u(d,h.rs,c);r.trace("All good with the signature!"),r.trace("Stage 2 - Initiator sending third handshake message."),await n.write(h.writeMessageC(u),t),r.trace("Stage 2 - Initiator sent message with signed payload.");const[m,y]=h.ss.split();return Pu(m,y,r),{payload:g,encrypt:e=>m.encryptWithAd(Ou,e),decrypt:(e,t)=>y.decryptWithAd(Ou,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},n),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return s}async performHandshakeResponder(e,t,r,n){let s;try{s=await async function(e,t){const{log:r,connection:n,crypto:s,privateKey:i,prologue:o,s:a,remoteIdentityKey:c,extensions:l}=e,u=await qu(i,a.publicKey,l),h=new Fu({crypto:s,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!1,prologue:o,s:a});_u(h.s,r),r.trace("Stage 0 - Responder waiting to receive first message."),h.readMessageA(await n.read(t)),r.trace("Stage 0 - Responder received first message."),Tu(h.re,r),r.trace("Stage 1 - Responder sending out first message with signed payload and static key."),await n.write(h.writeMessageB(u),t),r.trace("Stage 1 - Responder sent the second handshake message with signed payload."),Cu(h.e,r),r.trace("Stage 2 - Responder waiting for third handshake message...");const d=h.readMessageC(await n.read(t));r.trace("Stage 2 - Responder received the message, finished handshake.");const p=await $u(d,h.rs,c),[f,g]=h.ss.split();return Pu(f,g,r),{payload:p,encrypt:e=>g.encryptWithAd(Ou,e),decrypt:(e,t)=>f.decryptWithAd(Ou,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},n),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return s}async createSecureConnection(e,t){const[r,n]=function(){const e=ql(),t=ql();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&&(i=n.length),s=n instanceof Uint8Array?e.encrypt(n.subarray(r,i)):e.encrypt(n.sublist(r,i)),t?.encryptedPackets.increment(),yield new Ln(ku(s.byteLength),s)}}}(t,this.metrics),s,(e=>$n(e,{lengthDecoder:Iu})),function(e,t){return async function*(r){for await(const n of r)for(let r=0;rn.length&&(s=n.length),s-16new zu(t,e)}const Hu=Symbol.for("@libp2p/peer-discovery"),Vu=Ah("dns4"),Gu=Ah("dns6"),Wu=Ah("dnsaddr"),Xu=Sh(Ah("dns"),Wu,Vu,Gu),Ju=Sh(Ah("ip4"),Ah("ip6")),Zu=Sh(Eh(Ju,Ah("tcp")),Eh(Xu,Ah("tcp"))),Qu=Eh(Ju,Ah("udp")),Yu=Eh(Qu,Ah("utp")),eh=Eh(Qu,Ah("quic")),th=Eh(Qu,Ah("quic-v1")),rh=Sh(Eh(Zu,Ah("ws")),Eh(Xu,Ah("ws"))),nh=Sh(Eh(rh,Ah("p2p")),rh),sh=Sh(Eh(Zu,Ah("wss")),Eh(Xu,Ah("wss")),Eh(Zu,Ah("tls"),Ah("ws")),Eh(Xu,Ah("tls"),Ah("ws"))),ih=Sh(Eh(sh,Ah("p2p")),sh),oh=Sh(Eh(Zu,Ah("http")),Eh(Ju,Ah("http")),Eh(Xu,Ah("http"))),ah=Sh(Eh(Zu,Ah("https")),Eh(Ju,Ah("https")),Eh(Xu,Ah("https"))),ch=Eh(Qu,Ah("webrtc-direct"),Ah("certhash")),lh=Sh(Eh(ch,Ah("p2p")),ch),uh=Eh(th,Ah("webtransport"),Ah("certhash"),Ah("certhash")),hh=Sh(Eh(uh,Ah("p2p")),uh),dh=Sh(Eh(nh,Ah("p2p-webrtc-star"),Ah("p2p")),Eh(ih,Ah("p2p-webrtc-star"),Ah("p2p")),Eh(nh,Ah("p2p-webrtc-star")),Eh(ih,Ah("p2p-webrtc-star"))),ph=(Sh(Eh(nh,Ah("p2p-websocket-star"),Ah("p2p")),Eh(ih,Ah("p2p-websocket-star"),Ah("p2p")),Eh(nh,Ah("p2p-websocket-star")),Eh(ih,Ah("p2p-websocket-star"))),Sh(Eh(oh,Ah("p2p-webrtc-direct"),Ah("p2p")),Eh(ah,Ah("p2p-webrtc-direct"),Ah("p2p")),Eh(oh,Ah("p2p-webrtc-direct")),Eh(ah,Ah("p2p-webrtc-direct")))),fh=Sh(rh,sh,oh,ah,dh,ph,Zu,Yu,eh,Xu,lh,hh),gh=(Sh(Eh(fh,Ah("p2p-stardust"),Ah("p2p")),Eh(fh,Ah("p2p-stardust"))),Sh(Eh(fh,Ah("p2p")),dh,ph,lh,hh,Ah("p2p"))),mh=Sh(Eh(gh,Ah("p2p-circuit"),gh),Eh(gh,Ah("p2p-circuit")),Eh(Ah("p2p-circuit"),gh),Eh(fh,Ah("p2p-circuit")),Eh(Ah("p2p-circuit"),fh),Ah("p2p-circuit")),yh=()=>Sh(Eh(mh,yh),mh),wh=yh(),bh=Sh(Eh(wh,gh,wh),Eh(gh,wh),Eh(wh,gh),wh,gh);function vh(e){return function(t){let r;try{r=bi(t)}catch(e){return!1}const n=e(r.protoNames());return null!==n&&(!0===n||!1===n?n:0===n.length)}}function Eh(...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:vh(t),partialMatch:t}}function Sh(...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:vh(t),partialMatch:t}}function Ah(e){const t=e;return{toString:function(){return t},matches:function(e){let r;try{r=bi(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}}}Sh(Eh(wh,Ah("webrtc"),Ah("p2p")),Eh(wh,Ah("webrtc")),Eh(fh,Ah("webrtc"),Ah("p2p")),Eh(fh,Ah("webrtc")),Ah("webrtc"));class xh extends Ls{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(!bh.matches(e)){this.log.error("Invalid multiaddr");continue}const t=bi(e),r=t.getPeerId();if(null==r){this.log.error("Invalid bootstrap multiaddr without peer id");continue}const n={id:_l(r),multiaddrs:[t]};this.list.push(n)}this._init=t}[Hu]=this;[Symbol.toStringTag]="@libp2p/bootstrap";[bl]=["@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}},multiaddrs:e.multiaddrs}),null==this.timer)return;this.safeDispatchEvent("peer",{detail:e}),this.components.connectionManager.openConnection(e.id).catch((t=>{this.log.error("could not dial bootstrap peer %p",e.id,t)}))}}stop(){null!=this.timer&&clearTimeout(this.timer),this.timer=void 0}}const kh=Uint8Array.from([3,1]);var Ih,_h;!function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=vr(((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,r={})=>{const n={multiaddr:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.multiaddr=e.bytes():e.skipType(7&t)}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(t=e.AddressInfo||(e.AddressInfo={})),e.codec=()=>(null==r&&(r=vr(((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,n={})=>{const s={peerId:f(0),seq:0n,addresses:[]},i=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:s.peerId=t.bytes();break;case 2:s.seq=t.uint64();break;case 3:if(null!=n.limits?.addresses&&s.addresses.length===n.limits.addresses)throw new Er('Decode error - map field "addresses" had too many elements');s.addresses.push(e.AddressInfo.codec().decode(t,t.uint32(),{limits:n.limits?.addresses$}));break;default:t.skipType(7&r)}}return s}))),r),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Ih||(Ih={}));class Ch{static createFromProtobuf=e=>{const t=Ih.decode(e),r=Tl(st(t.peerId)),n=(t.addresses??[]).map((e=>bi(e.multiaddr))),s=t.seq;return new Ch({peerId:r,multiaddrs:n,seqNumber:s})};static DOMAIN="libp2p-peer-record";static CODEC=kh;peerId;multiaddrs;seqNumber;domain=Ch.DOMAIN;codec=Ch.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=Ih.encode({peerId:this.peerId.toMultihash().bytes,seq:BigInt(this.seqNumber),addresses:this.multiaddrs.map((e=>({multiaddr:e.bytes})))})),this.marshaled}equals(e){return e instanceof Ch&&!!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)}}!function(e){let t;e.codec=()=>(null==t&&(t=vr(((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,r={})=>{const n={publicKey:f(0),payloadType:f(0),payload:f(0),signature:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.publicKey=e.bytes();break;case 2:n.payloadType=e.bytes();break;case 3:n.payload=e.bytes();break;case 5:n.signature=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(_h||(_h={}));class Th extends Error{constructor(e="Invalid signature"){super(e),this.name="InvalidSignatureError"}}class Ph{static createFromProtobuf=async e=>{const t=_h.decode(e),r=yl(t.publicKey);return new Ph({publicKey:r,payloadType:t.payloadType,payload:t.payload,signature:t.signature})};static seal=async(e,t)=>{if(null==t)throw new Error("Missing private key");const r=e.domain,n=e.codec,s=e.marshal(),i=Lh(r,n,s),o=await t.sign(i.subarray());return new Ph({publicKey:t.publicKey,payloadType:n,payload:s,signature:o})};static openAndCertify=async(e,t)=>{const r=await Ph.createFromProtobuf(e);if(!await r.validate(t))throw new Th("Envelope signature is not valid for the given domain");return r};publicKey;payloadType;payload;signature;marshaled;constructor(e){const{publicKey:t,payloadType:r,payload:n,signature:s}=e;this.publicKey=t,this.payloadType=r,this.payload=n,this.signature=s}marshal(){return null==this.marshaled&&(this.marshaled=_h.encode({publicKey:wl(this.publicKey),payloadType:this.payloadType,payload:this.payload.subarray(),signature:this.signature})),this.marshaled}equals(e){return _n(this.marshal(),e.marshal())}async validate(e){const t=Lh(e,this.payloadType,this.payload);return this.publicKey.verify(t.subarray(),this.signature)}}const Lh=(e,t,r)=>{const n=It(e),s=C(n.byteLength),i=C(t.length),o=C(r.length);return new Ln(s,n,i,t,o,r)};var Rh=__webpack_require__(5507);const Oh=["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 Rh.Netmask(e)));function Nh(e){for(const t of Oh)if(t.contains(e))return!0;return!1}function Dh(e){return js(e)?Nh(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 Nh(`${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 Nh(t[t.length-1])}(e):zs(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 Mh(e){try{if(!function(e){try{const[[t]]=e.stringTuples();return 4===t||41===t}catch{}return!1}(e))return!1;const[[,t]]=e.stringTuples();return null!=t&&(Dh(t)??!1)}catch{}return!0}const Fh=e=>({match:t=>!(t.length<1)&&!!e(t[0])&&t.slice(1),pattern:"fn"}),Bh=e=>({match:t=>Fh((t=>t===e)).match(t),pattern:e}),Uh=()=>({match:e=>Fh((e=>"string"==typeof e)).match(e),pattern:"{string}"}),qh=()=>({match:e=>Fh((e=>!isNaN(parseInt(e)))).match(e),pattern:"{number}"}),$h=()=>({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{Ee.decode(`z${e[1]}`)}catch(e){return!1}return e.slice(2)},pattern:"/p2p/{peerid}"}),jh=()=>({match:e=>{if(e.length<2)return!1;if("certhash"!==e[0])return!1;try{ke.decode(e[1])}catch{return!1}return e.slice(2)},pattern:"/certhash/{certhash}"}),zh=e=>({match:t=>{const r=e.match(t);return!1===r?t:r},pattern:`optional(${e.pattern})`}),Kh=(...e)=>({match:t=>{let r;for(const n of e){const e=n.match(t);!1!==e&&(null==r||e.lengthe.pattern)).join(", ")})`}),Hh=(...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 Vh(...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{matchers:e,matches:function(e){return!1!==t(e)},exactMatch:function(e){const r=t(e);return!1!==r&&0===r.length}}}Vh($h());const Gh=Hh(Bh("dns4"),Uh()),Wh=Hh(Bh("dns6"),Uh()),Xh=Hh(Bh("dnsaddr"),Uh()),Jh=Hh(Bh("dns"),Uh()),Zh=(Vh(Gh,zh($h())),Vh(Wh,zh($h())),Vh(Xh,zh($h())),Vh(Kh(Jh,Xh,Gh,Wh),zh($h())),Hh(Bh("ip4"),Fh(js))),Qh=Hh(Bh("ip6"),Fh(zs)),Yh=Kh(Zh,Qh),ed=Kh(Yh,Jh,Gh,Wh,Xh),td=Vh(Kh(Yh,Hh(Kh(Jh,Xh,Gh,Wh),zh($h())))),rd=(Vh(Zh),Vh(Qh),Vh(Yh),Hh(ed,Bh("tcp"),qh())),nd=Hh(ed,Bh("udp"),qh()),sd=Vh(Hh(rd,zh($h()))),id=(Vh(nd),Hh(nd,Bh("quic"),zh($h()))),od=Hh(nd,Bh("quic-v1"),zh($h())),ad=Kh(id,od),cd=(Vh(id),Vh(od),Kh(ed,rd,nd,id,od)),ld=Kh(Hh(cd,Bh("ws"),zh($h()))),ud=Vh(ld),hd=Kh(Hh(cd,Bh("wss"),zh($h())),Hh(cd,Bh("tls"),zh(Hh(Bh("sni"),Uh())),Bh("ws"),zh($h()))),dd=Vh(hd),pd=Hh(nd,Bh("webrtc-direct"),zh(jh()),zh(jh()),zh($h())),fd=Vh(pd),gd=Hh(od,Bh("webtransport"),zh(jh()),zh(jh()),zh($h())),md=Vh(gd),yd=Kh(ld,hd,Hh(rd,zh($h())),Hh(ad,zh($h())),Hh(ed,zh($h())),pd,gd,$h()),wd=(Vh(yd),Vh(Hh(yd,Bh("p2p-circuit"),$h()))),bd=Vh(Kh(Hh(yd,Bh("p2p-circuit"),Bh("webrtc"),zh($h())),Hh(yd,Bh("webrtc"),zh($h())),Hh(Bh("webrtc"),zh($h()))));Vh(Kh(Hh(ed,Bh("tcp"),qh(),Bh("http"),zh($h())),Hh(ed,Bh("http"),zh($h())))),Vh(Kh(Hh(ed,Bh("tcp"),Kh(Hh(Bh("443"),Bh("http")),Hh(qh(),Bh("https"))),zh($h())),Hh(ed,Bh("tls"),Bh("http"),zh($h())),Hh(ed,Bh("https"),zh($h())))),Vh(Kh(Hh(Bh("memory"),Uh(),zh($h()))));class vd{readNext;haveNext;ended;nextResult;error;constructor(){this.ended=!1,this.readNext=jn(),this.haveNext=jn()}[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=jn(),e}async throw(e){return this.ended=!0,this.error=e,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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 this.error??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=jn(),await Wn(this.readNext.promise,t?.signal,t)}}class Ed extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class Sd extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Ad extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class xd extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function kd(e,t){const r=function(e,t={}){const r=function(e,t){const r=new vd;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 Ln;return{read:async e=>{if(e?.signal?.throwIfAborted(),null==e?.bytes){const{done:t,value:r}=await Wn(n.next(),e?.signal);return!0===t?null:r}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}}}(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=k(t.maxDataLength));const n=t?.lengthDecoder??T,s=t?.lengthEncoder??C;return{read:async e=>{let s=-1;const i=new Ln;for(;;){i.append(await r.read({...e,bytes:1}));try{s=n(i)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new Sd("Invalid message length");if(null!=t?.maxLengthLength&&i.byteLength>t.maxLengthLength)throw new xd("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new Ad("message length too long");return r.read({...e,bytes:s})},write:async(e,t)=>{await r.write(new Ln(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Ln(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}(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 Id;!function(e){let t;e.codec=()=>(null==t&&(t=vr(((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,r={})=>{const n={listenAddrs:[],protocols:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 5:n.protocolVersion=e.string();break;case 6:n.agentVersion=e.string();break;case 1:n.publicKey=e.bytes();break;case 2:if(null!=r.limits?.listenAddrs&&n.listenAddrs.length===r.limits.listenAddrs)throw new Er('Decode error - map field "listenAddrs" had too many elements');n.listenAddrs.push(e.bytes());break;case 4:n.observedAddr=e.bytes();break;case 3:if(null!=r.limits?.protocols&&n.protocols.length===r.limits.protocols)throw new Er('Decode error - map field "protocols" had too many elements');n.protocols.push(e.string());break;case 8:n.signedPeerRecord=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Id||(Id={}));const _d="ipfs",Cd=5e3,Td=1,Pd=1,Ld=10,Rd=8192,Od=!0,Nd=!0;class Dd{host;protocol;started;timeout;peerId;privateKey;peerStore;registrar;addressManager;maxInboundStreams;maxOutboundStreams;maxMessageSize;maxObservedAddresses;events;runOnLimitedConnection;log;constructor(e,t){var r,n;this.protocol=t.protocol,this.started=!1,this.peerId=e.peerId,this.privateKey=e.privateKey,this.peerStore=e.peerStore,this.registrar=e.registrar,this.addressManager=e.addressManager,this.events=e.events,this.log=t.log,this.timeout=t.timeout??Cd,this.maxInboundStreams=t.maxInboundStreams??Td,this.maxOutboundStreams=t.maxOutboundStreams??Pd,this.maxMessageSize=t.maxMessageSize??Rd,this.maxObservedAddresses=t.maxObservedAddresses??Ld,this.runOnLimitedConnection=t.runOnLimitedConnection??Nd,this.host={protocolVersion:`${t.protocolPrefix??_d}/0.1.0`,agentVersion:(r=e.nodeInfo,n=t.agentVersion,null!=n?n:r.userAgent)}}isStarted(){return this.started}async start(){this.started||(await this.peerStore.merge(this.peerId,{metadata:{AgentVersion:It(this.host.agentVersion),ProtocolVersion:It(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,runOnLimitedConnection:this.runOnLimitedConnection}),this.started=!0)}async stop(){await this.registrar.unhandle(this.protocol),this.started=!1}}class Md extends Dd{constructor(e,t={}){super(e,{...t,protocol:`/${t.protocolPrefix??_d}/id/1.0.0`,log:e.logger.forComponent("libp2p:identify")}),(t.runOnConnectionOpen??Od)&&e.events.addEventListener("connection:open",(e=>{const t=e.detail;this.identify(t).catch((e=>{e.name!==bo.name&&this.log.error("error during identify trigged by connection:open",e)}))}))}[bl]=["@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,runOnLimitedConnection:this.runOnLimitedConnection});const n=kd(r,{maxDataLength:this.maxMessageSize}).pb(Id),s=await n.read(t);return await r.close(t),s}catch(e){throw r?.abort(e),e}}async identify(e,t={}){const r=await this._identify(e,t),{publicKey:n,protocols:s,observedAddr:i}=r;if(null==n)throw new vo("public key was missing from identify message");const o=Pl(yl(n).toCID());if(!e.remotePeer.equals(o))throw new vo("identified peer does not match the expected peer");if(this.peerId.equals(o))throw new vo("identified peer is our own peer id?");return this.maybeAddObservedAddress(i),this.log("identify completed for peer %p and protocols %o",o,s),async function(e,t,r,n,s){if(r("received identify from %p",n.remotePeer),null==s)throw new vo("message was null or undefined");const i={};if(s.listenAddrs.length>0&&(i.addresses=s.listenAddrs.map((e=>({isCertified:!1,multiaddr:bi(e)})))),s.protocols.length>0&&(i.protocols=s.protocols),null!=s.publicKey){const e=yl(s.publicKey);if(!Cl(e).equals(n.remotePeer))throw new vo("public key did not match remote PeerId");i.publicKey=e}let o;if(null!=s.signedPeerRecord){r.trace("received signedPeerRecord from %p",n.remotePeer);let t=s.signedPeerRecord;const a=await Ph.openAndCertify(t,Ch.DOMAIN);let c=Ch.createFromProtobuf(a.payload);const l=Pl(a.publicKey.toCID());if(!c.peerId.equals(l))throw new vo("signing key does not match PeerId in the PeerRecord");if(!n.remotePeer.equals(c.peerId))throw new vo("signing key does not match remote PeerId");let u;try{u=await e.get(c.peerId)}catch(e){if("NotFoundError"!==e.name)throw e}if(null!=u&&(i.metadata=u.metadata,null!=u.peerRecordEnvelope)){const e=await Ph.createFromProtobuf(u.peerRecordEnvelope),n=Ch.createFromProtobuf(e.payload);n.seqNumber>=c.seqNumber&&(r("sequence number was lower or equal to existing sequence number - stored: %d received: %d",n.seqNumber,c.seqNumber),c=n,t=u.peerRecordEnvelope)}i.peerRecordEnvelope=t,i.addresses=c.multiaddrs.map((e=>({isCertified:!0,multiaddr:e}))),o={seq:c.seqNumber,addresses:c.multiaddrs}}else r("%p did not send a signed peer record",n.remotePeer);if(r.trace("patching %p with",n.remotePeer,i),await e.patch(n.remotePeer,i),null!=s.agentVersion||null!=s.protocolVersion){const t={};null!=s.agentVersion&&(t.AgentVersion=It(s.agentVersion)),null!=s.protocolVersion&&(t.ProtocolVersion=It(s.protocolVersion)),r.trace("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=>bi(e))),observedAddr:null==s.observedAddr?void 0:bi(s.observedAddr),protocols:s.protocols,signedPeerRecord:o,connection:n};return t.safeDispatchEvent("peer:identify",{detail:a}),a}(this.peerStore,this.events,this.log,e,r)}maybeAddObservedAddress(e){const t=function(e){if(null!=e&&e.length>0)try{return bi(e)}catch{}}(e);null!=t&&(this.log.trace("our observed address was %a",t),Mh(t)?this.log.trace("our observed address was private"):41!==t.stringTuples()[0][0]||function(e){try{const[[r,n]]=e.stringTuples();if(null==n)return!1;if(41===r)return t=n,new $s("2000::/3").contains(t)}catch{}var t;return!1}(t)?sd.exactMatch(t)||(this.log.trace("storing the observed address"),this.addressManager.addObservedAddr(t)):this.log.trace("our observed address was IPv6 but not a global unicast address"))}async handleProtocol(e){const{connection:t,stream:r}=e,n=AbortSignal.timeout(this.timeout);try{const e=await this.peerStore.get(this.peerId),s=this.addressManager.getAddresses().map((e=>e.decapsulateCode(Zs("p2p").code)));let i=e.peerRecordEnvelope;if(s.length>0&&null==i){const e=new Ch({peerId:this.peerId,multiaddrs:s});i=(await Ph.seal(e,this.privateKey)).marshal().subarray()}let o=t.remoteAddr.bytes;td.matches(t.remoteAddr)||(o=void 0);const a=kd(r).pb(Id);await a.write({protocolVersion:this.host.protocolVersion,agentVersion:this.host.agentVersion,publicKey:wl(this.privateKey.publicKey),listenAddrs:s.map((e=>e.bytes)),signedPeerRecord:i,observedAddr:o,protocols:e.protocols},{signal:n}),await r.close({signal:n})}catch(e){this.log.error("could not respond to identify request",e),r.abort(e)}}}function Fd(e={}){return t=>new Md(t,e)}function Bd(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 Ud=()=>{const e=new Error("Delay aborted");return e.name="AbortError",e},qd=new WeakMap,$d=function({clearTimeout:e,setTimeout:t}={}){return(r,{value:n,signal:s}={})=>{if(s?.aborted)return Promise.reject(Ud());let i,o,a;const c=e??clearTimeout,l=()=>{c(i),a(Ud())},u=new Promise(((e,c)=>{o=()=>{s&&s.removeEventListener("abort",l),e(n)},a=c,i=(t??setTimeout)(o,r)}));return s&&s.addEventListener("abort",l,{once:!0}),qd.set(u,(()=>{c(i),i=null,o()})),u}}();class jd extends Error{remainingPoints;msBeforeNext;consumedPoints;isFirstInDuration;constructor(e="Rate limit exceeded",t){super(e),this.name="RateLimitError",this.remainingPoints=t.remainingPoints,this.msBeforeNext=t.msBeforeNext,this.consumedPoints=t.consumedPoints,this.isFirstInDuration=t.isFirstInDuration}}class zd extends Error{static name="QueueFullError";constructor(e="The queue was full"){super(e),this.name="QueueFullError"}}class Kd{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 Hd}async consume(e,t=1,r={}){const n=this.getKey(e),s=this._getKeySecDuration(r);let i=this.memoryStorage.incrby(n,t,s);if(i.remainingPoints=Math.max(this.points-i.consumedPoints,0),i.consumedPoints>this.points)throw this.blockDuration>0&&i.consumedPoints<=this.points+t&&(i=this.memoryStorage.set(n,i.consumedPoints,this.blockDuration)),new jd("Rate limit exceeded",i);if(this.execEvenly&&i.msBeforeNext>0&&!i.isFirstInDuration){let e=Math.ceil(i.msBeforeNext/(i.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 Hd{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 i={value:t,expiresAt:n>0?new Date(Date.now()+n):void 0};return this.storage.set(e,i),n>0&&(i.timeoutId=setTimeout((()=>{this.storage.delete(e)}),n),null!=i.timeoutId.unref&&i.timeoutId.unref()),{remainingPoints:0,msBeforeNext:0===n?-1:n,consumedPoints:i.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 Vd;!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"}(Vd||(Vd={}));const Gd=Object.freeze({0:"NEW_STREAM",1:"MESSAGE_RECEIVER",2:"MESSAGE_INITIATOR",3:"CLOSE_RECEIVER",4:"CLOSE_INITIATOR",5:"RESET_RECEIVER",6:"RESET_INITIATOR"}),Wd=Object.freeze({NEW_STREAM:Vd.NEW_STREAM,MESSAGE:Vd.MESSAGE_INITIATOR,CLOSE:Vd.CLOSE_INITIATOR,RESET:Vd.RESET_INITIATOR}),Xd=Object.freeze({MESSAGE:Vd.MESSAGE_RECEIVER,CLOSE:Vd.CLOSE_RECEIVER,RESET:Vd.RESET_RECEIVER}),Jd=1<<20;class Zd{_buffer;_headerInfo;_maxMessageSize;_maxUnprocessedMessageQueueSize;constructor(e=Jd,t=4194304){this._buffer=new Ln,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 new vo("Unprocessed message queue size too large!");const t=[];for(;0!==this._buffer.length;){if(null==this._headerInfo)try{this._headerInfo=this._decodeHeader(this._buffer)}catch(e){if("InvalidMessageError"===e.name)throw e;break}const{id:e,type:r,length:n,offset:s}=this._headerInfo;if(this._buffer.length-sthis._maxMessageSize)throw new vo("Message size too large");return{id:t>>3,type:i,offset:r+s,length:n}}}const Qd=128,Yd=127;function ep(e,t=0){let r,n=0,s=0,i=t;const o=e.length;do{if(i>=o||s>49)throw t=0,new RangeError("Could not decode varint");r=e.get(i++),n+=s<28?(r&Yd)<=Qd);return{value:n,offset:t=i-t}}const tp=10240,rp=new class{_pool;_poolOffset;constructor(){this._pool=g(tp),this._poolOffset=0}write(e,t){const r=this._pool;let n=this._poolOffset;C(e.id<<3|e.type,r,n),n+=k(e.id<<3|e.type),e.type!==Vd.NEW_STREAM&&e.type!==Vd.MESSAGE_INITIATOR&&e.type!==Vd.MESSAGE_RECEIVER||null==e.data?(C(0,r,n),n+=k(0)):(C(e.data.length,r,n),n+=k(e.data.length));const s=r.subarray(this._poolOffset,n);tp-n<100?(this._pool=g(tp),this._poolOffset=0):this._poolOffset=n,t.append(s),e.type!==Vd.NEW_STREAM&&e.type!==Vd.MESSAGE_INITIATOR&&e.type!==Vd.MESSAGE_RECEIVER||null==e.data||t.append(e.data)}};class np extends Error{constructor(e="Stream input buffer error"){super(e),this.name="StreamInputBufferError"}}function sp(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}class ip{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=jn(),this.closed=jn(),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=Vn({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 po(`writable end state is "${this.writeStatus}" not "ready"`);try{this.writeStatus="writing";const t={signal:this.sinkController.signal};if("outbound"===this.direction){const e=this.sendNewStream(t);sp(e)&&await e}const r=()=>{Bd(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 Ln(r):r;const e=this.sendData(r,t);sp(e)&&(this.sendingData=jn(),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){"open"===this.status&&(this.log.trace("closing gracefully"),this.status="closing",await Wn(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 Wn(this.sink([]),e.signal)),"writing"===this.writeStatus&&(null!=this.sendingData&&await Wn(this.sendingData.promise,e.signal),this.log.trace("aborting source passed to .sink"),this.sinkController.abort(),await Wn(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();sp(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 ho("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 op extends ip{name;streamId;send;types;maxDataSize;constructor(e){super(e),this.types="outbound"===e.direction?Wd:Xd,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:Wd.NEW_STREAM,data:new Ln(It(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 ap(e){const t={...e,type:`${Gd[e.type]} (${e.type})`};return e.type===Vd.NEW_STREAM&&(t.data=Yr(e.data instanceof Uint8Array?e.data:e.data.subarray())),e.type!==Vd.MESSAGE_INITIATOR&&e.type!==Vd.MESSAGE_RECEIVER||(t.data=Yr(e.data instanceof Uint8Array?e.data:e.data.subarray(),"base16")),t}class cp{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=Vn({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 Ln;rp.write(t,e),yield e}}(e))),this.closeController=new AbortController,this.rateLimiter=new Kd({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 uo("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 _o("Too many outbound streams open");if(s.has(t))throw new Error(`${n} stream ${t} already exists!`);const i=function(e){const{id:t,name:r,send:n,onEnd:s,type:i="initiator",maxMsgSize:o=Jd}=e;return new op({id:"initiator"===i?`i${t}`:`r${t}`,streamId:t,name:`${r??t}`,direction:"initiator"===i?"outbound":"inbound",maxDataSize:o,onEnd:s,send:n,log:e.logger.forComponent(`libp2p:mplex:stream:${i}:${t}`)})}({id:t,name:r,send:async e=>{this.log.enabled&&this.log.trace("%s stream %s send",n,t,ap(e)),this._source.push(e)},type:n,onEnd:()=>{this.log("%s stream with id %s and protocol %s ended",n,t,i.protocol),s.delete(t),null!=this._init.onStreamEnd&&this._init.onStreamEnd(i)},maxMsgSize:this._init.maxMsgSize,logger:this.logger});return s.set(t,i),i}_createSink(){return async e=>{const t=()=>{Bd(e,this.log)};this.closeController.signal.addEventListener("abort",t);try{const t=new Zd(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",ap(e)),e.type===Vd.NEW_STREAM){if(this._streams.receivers.size===(this._init.maxInboundStreams??1024)){this.log("too many inbound streams open"),this._source.push({id:t,type:Vd.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:Yr(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,Gd[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 Vd.MESSAGE_INITIATOR:case Vd.MESSAGE_RECEIVER:if(n.sourceReadableLength()>s)throw this._source.push({id:e.id,type:r===Vd.MESSAGE_INITIATOR?Vd.RESET_RECEIVER:Vd.RESET_INITIATOR}),new np("Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers");n.sourcePush(e.data);break;case Vd.CLOSE_INITIATOR:case Vd.CLOSE_RECEIVER:n.remoteCloseWrite();break;case Vd.RESET_INITIATOR:case Vd.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 lp{protocol="/mplex/6.7.0";_init;components;constructor(e,t={}){this.components=e,this._init=t}[Symbol.toStringTag]="@libp2p/mplex";[bl]=["@libp2p/stream-multiplexing"];createStreamMuxer(e={}){return new cp(this.components,{...e,...this._init})}}function up(e={}){return t=>new lp(t,e)}function hp(e){if(isNaN(e)||e<=0)throw new so("random bytes length must be a Number bigger than 0");return Mr(e)}class dp{protocol;components;started;timeout;maxInboundStreams;maxOutboundStreams;runOnLimitedConnection;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.runOnLimitedConnection=t.runOnLimitedConnection??!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,runOnLimitedConnection:this.runOnLimitedConnection}),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 So("ping timeout"))})),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 vo("Too much data received"));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=hp(32),s=await this.components.connectionManager.openConnection(e,t);let i,o=()=>{};if(null==t.signal){const e=AbortSignal.timeout(this.timeout);t={...t,signal:e}}try{i=await s.newStream(this.protocol,{...t,runOnLimitedConnection:this.runOnLimitedConnection}),o=()=>{i?.abort(new ro)},t.signal?.addEventListener("abort",o,{once:!0});const e=await Zn([n],i,(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`);if(!_n(n,e.subarray()))throw new Eo(`Received wrong ping ack after ${a}ms`);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),i?.abort(e),e}finally{t.signal?.removeEventListener("abort",o),null!=i&&await i.close()}}}function pp(e={}){return t=>new dp(t,e)}const fp=Symbol.for("@libp2p/transport");var gp;!function(e){e[e.FATAL_ALL=0]="FATAL_ALL",e[e.NO_FATAL=1]="NO_FATAL"}(gp||(gp={}));const mp=[Zs("tcp").code,Zs("dns").code,Zs("dnsaddr").code,Zs("dns4").code,Zs("dns6").code];function yp(e){return bp("sni",e)?.[1]}function wp(e){const t=bp("tcp",e)?.[1];return null==t?"":`:${t}`}function bp(e,t){let r;try{r=Zs(e).code}catch(e){return}for(const[e,n]of t)if(e===r&&null!=n)return[e,n]}function vp(e){return e.some((([e,t])=>e===Zs("tls").code))}function Ep(e,t,r){const n=Sp[Zs(e).name];if(null==n)throw new Error(`Can't interpret protocol ${Zs(e).name}`);const s=n(t,r);return e===Zs("ip6").code?`[${s}]`:s}const Sp={ip4:(e,t)=>e,ip6:(e,t)=>0===t.length?e:`[${e}]`,tcp:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`tcp://${Ep(r[0],r[1]??"",t)}:${e}`},udp:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`udp://${Ep(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(null==r)throw new Error("Unexpected end of multiaddr");return`${Ep(r[0],r[1]??"",t)}`},p2p:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`${Ep(r[0],r[1]??"",t)}`},http:(e,t)=>{const r=vp(t),n=yp(t),s=wp(t);if(r&&null!=n)return`https://${n}${s}`;const i=r?"https://":"http://",o=t.pop();if(null==o)throw new Error("Unexpected end of multiaddr");let a=Ep(o[0],o[1]??"",t);return a=a.replace("tcp://",""),`${i}${a}`},"http-path":(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`${Ep(r[0],r[1]??"",t)}/${decodeURIComponent(e)}`},tls:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return Ep(r[0],r[1]??"",t)},sni:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return Ep(r[0],r[1]??"",t)},https:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");let n=Ep(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`https://${n}`},ws:(e,t)=>{const r=vp(t),n=yp(t),s=wp(t);if(r&&null!=n)return`wss://${n}${s}`;const i=r?"wss://":"ws://",o=t.pop();if(null==o)throw new Error("Unexpected end of multiaddr");let a=Ep(o[0],o[1]??"",t);return a=a.replace("tcp://",""),`${i}${a}`},wss:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");let n=Ep(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`wss://${n}`}},Ap=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",i)}function s(){n(),t()}function i(t){n(),r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}e.addEventListener("open",s),e.addEventListener("error",i)}))},xp=(e,t)=>((t=t??{}).closeOnEnd=!1!==t.closeOnEnd,async r=>{for await(const t of r){try{await Ap(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 kp=__webpack_require__(544);function Ip(e){return e instanceof ArrayBuffer||"ArrayBuffer"===e?.constructor?.name&&"number"==typeof e?.byteLength}const _p=WebSocket,Cp={"http:":"ws:","https:":"wss:"};function Tp(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(Cp))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 i=t=>{e.removeEventListener("open",o),e.removeEventListener("error",a),t()},o=()=>{i(t)},a=t=>{i((()=>{r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}))};e.addEventListener("open",o),e.addEventListener("error",a)}))},r=async function*(){const r=new kp.PP((({push:t,stop:r,fail:n})=>{const s=e=>{let r=null;"string"==typeof e.data&&(r=It(e.data)),Ip(e.data)&&(r=new Uint8Array(e.data)),e.data instanceof Uint8Array&&(r=e.data),null!=r&&t(r)},i=e=>{n(e.error??new Error("Socket error"))};return e.addEventListener("message",s),e.addEventListener("error",i),e.addEventListener("close",r),()=>{e.removeEventListener("message",s),e.removeEventListener("error",i),e.removeEventListener("close",r)}}),{highWaterMark:1/0});await t();for await(const e of r)yield Ip(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:xp(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 _p(r.toString(),t.websocket),t)}class Pp extends Event{type;detail;constructor(e,t){super(e),this.type=e,this.detail=t}}function Lp(e){return e.filter((e=>dd.exactMatch(e)||ud.exactMatch(e)))}function Rp(e){return e.filter((e=>dd.exactMatch(e)))}class Op{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"})})}[fp]=!0;[Symbol.toStringTag]="@libp2p/websockets";[bl]=["@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,i=r.metricPrefix??"",o={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}=o.remoteAddr.toOptions();n("timeout closing stream to %s:%s after %dms, destroying it manually",e,t,Date.now()-r),this.abort(new ro("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),o.timeline.close=Date.now()}},abort(t){const{host:r,port:a}=o.remoteAddr.toOptions();n("timeout closing stream to %s:%s due to error",r,a,t),e.destroy(),o.timeline.close=Date.now(),s?.increment({[`${i}error`]:!0})}};return e.socket.addEventListener("close",(()=>{s?.increment({[`${i}close`]:!0}),null==o.timeline.close&&(o.timeline.close=Date.now())}),{once:!0}),o}(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=jn(),s=Tp(function(e){const t=bi(e).stringTuples(),r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");const n=Zs(r[0]),s=Sp[n.name];if(null==s)throw new Error(`No interpreter found for ${n.name}`);let i=s(r[1]??"",t);return mp.includes(r[0])&&(i=i.replace(/^.*:\/\//,""),i="443"===r[1]?`https://${i}`:`http://${i}`),(i.startsWith("http://")||i.startsWith("https://")||i.startsWith("ws://")||i.startsWith("wss://"))&&(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 lo(`Could not connect to ${e.toString()}`);this.log.error("connection error:",t),this.metrics?.dialerEvents.increment({error:!0}),n.reject(t)}));try{t.onProgress?.(new Pp("websockets:open-connection")),await Wn(Promise.race([s.connected(),n.promise]),t.signal)}catch(e){throw 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.events,this.components.metrics),this.init)}listenFilter(e){return e=Array.isArray(e)?e:[e],null!=this.init?.filter?this.init?.filter(e):Lp(e)}dialFilter(e){return this.listenFilter(e)}}function Np(e={}){return t=>new Op(t,e)}var Dp=__webpack_require__(228);class Mp extends Error{constructor(e){super(e),this.name="TimeoutError"}}class Fp extends Error{constructor(e){super(),this.name="AbortError",this.message=e}}const Bp=e=>void 0===globalThis.DOMException?new Fp(e):new DOMException(e),Up=e=>{const t=void 0===e.reason?Bp("This operation was aborted."):e.reason;return t instanceof Error?t:Bp(t)};function qp(e,t){const{milliseconds:r,fallback:n,message:s,customTimers:i={setTimeout,clearTimeout}}=t;let o,a;const c=new Promise(((c,l)=>{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&&l(Up(e)),a=()=>{l(Up(e))},e.addEventListener("abort",a,{once:!0})}if(r===Number.POSITIVE_INFINITY)return void e.then(c,l);const u=new Mp;o=i.setTimeout.call(void 0,(()=>{if(n)try{c(n())}catch(e){l(e)}else"function"==typeof e.cancel&&e.cancel(),!1===s?c():s instanceof Error?l(s):(u.message=s??`Promise timed out after ${r} milliseconds`,l(u))}),r),(async()=>{try{c(await e)}catch(e){l(e)}})()})).finally((()=>{c.clear(),a&&t.signal&&t.signal.removeEventListener("abort",a)}));return c.clear=()=>{i.clearTimeout.call(void 0,o),o=void 0},c}class $p{#i=[];enqueue(e,t){const r={priority:(t={priority:0,...t}).priority,id:t.id,run:e};if(0===this.size||this.#i[this.size-1].priority>=t.priority)return void this.#i.push(r);const n=function(e,t){let r=0,n=e.length;for(;n>0;){const i=Math.trunc(n/2);let o=r+i;s=e[o],t.priority-s.priority<=0?(r=++o,n-=i+1):n=i}var s;return r}(this.#i,r);this.#i.splice(n,0,r)}setPriority(e,t){const r=this.#i.findIndex((t=>t.id===e));if(-1===r)throw new ReferenceError(`No promise function with the id "${e}" exists in the queue.`);const[n]=this.#i.splice(r,1);this.enqueue(n.run,{priority:t,id:e})}dequeue(){const e=this.#i.shift();return e?.run}filter(e){return this.#i.filter((t=>t.priority===e.priority)).map((e=>e.run))}get size(){return this.#i.length}}class jp extends Dp{#o;#a;#c=0;#l;#u;#h=0;#d;#p;#i;#f;#g=0;#m;#y;#w;#b=1n;timeout;constructor(e){if(super(),!("number"==typeof(e={carryoverConcurrencyCount:!1,intervalCap:Number.POSITIVE_INFINITY,interval:0,concurrency:Number.POSITIVE_INFINITY,autoStart:!0,queueClass:$p,...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.#o=e.carryoverConcurrencyCount,this.#a=e.intervalCap===Number.POSITIVE_INFINITY||0===e.interval,this.#l=e.intervalCap,this.#u=e.interval,this.#i=new e.queueClass,this.#f=e.queueClass,this.concurrency=e.concurrency,this.timeout=e.timeout,this.#w=!0===e.throwOnTimeout,this.#y=!1===e.autoStart}get#v(){return this.#a||this.#c{this.#x()}),t)),!0;this.#c=this.#o?this.#g:0}return!1}#A(){if(0===this.#i.size)return this.#d&&clearInterval(this.#d),this.#d=void 0,this.emit("empty"),0===this.#g&&this.emit("idle"),!1;if(!this.#y){const e=!this.#_;if(this.#v&&this.#E){const t=this.#i.dequeue();return!!t&&(this.emit("active"),t(),e&&this.#I(),!0)}}return!1}#I(){this.#a||void 0!==this.#d||(this.#d=setInterval((()=>{this.#k()}),this.#u),this.#h=Date.now()+this.#u)}#k(){0===this.#c&&0===this.#g&&this.#d&&(clearInterval(this.#d),this.#d=void 0),this.#c=this.#o?this.#g:0,this.#C()}#C(){for(;this.#A(););}get concurrency(){return this.#m}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.#m=e,this.#C()}async#T(e){return new Promise(((t,r)=>{e.addEventListener("abort",(()=>{r(e.reason)}),{once:!0})}))}setPriority(e,t){this.#i.setPriority(e,t)}async add(e,t={}){return t.id??=(this.#b++).toString(),t={timeout:this.timeout,throwOnTimeout:this.#w,...t},new Promise(((r,n)=>{this.#i.enqueue((async()=>{this.#g++,this.#c++;try{t.signal?.throwIfAborted();let n=e({signal:t.signal});t.timeout&&(n=qp(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 Mp&&!t.throwOnTimeout)return void r();n(e),this.emit("error",e)}finally{this.#S()}}),t),this.emit("add"),this.#A()}))}async addAll(e,t){return Promise.all(e.map((async e=>this.add(e,t))))}start(){return this.#y?(this.#y=!1,this.#C(),this):this}pause(){this.#y=!0}clear(){this.#i=new this.#f}async onEmpty(){0!==this.#i.size&&await this.#P("empty")}async onSizeLessThan(e){this.#i.sizethis.#i.size{const n=()=>{t&&!t()||(this.off(e,n),r())};this.on(e,n)}))}get size(){return this.#i.size}sizeBy(e){return this.#i.filter(e).length}get pending(){return this.#g}get isPaused(){return this.#y}}function zp(e){const t=[Vp.A];return null==e?t:Array.isArray(e)?0===e.length?t:e:[e]}function Kp(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:Vp[e.type]}))),Answer:(e.Answer??e.answers??[]).map((e=>({name:e.name,type:Vp[e.type],TTL:e.TTL??e.ttl??60,data:e.data instanceof Uint8Array?Yr(e.data):e.data})))}}function Hp(e,t={}){const r=new jp({concurrency:t.queryConcurrency??4});return async(t,n={})=>{const s=new URLSearchParams;s.set("name",t),zp(n.types).forEach((e=>{s.append("type",Vp[e])})),n.onProgress?.(new Pp("dns:query",{detail:t}));const i=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=Kp(await t.json());return n.onProgress?.(new Pp("dns:response",{detail:r})),r}),{signal:n.signal});if(null==i)throw new Error("No DNS response received");return i}}var Vp,Gp=__webpack_require__(194);class Wp{lru;constructor(e){this.lru=Gp(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 Kp({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:Vp[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??60),value:t}),this.lru.set(r,n)}remove(e,t){const r=`${e.toLowerCase()}-${t}`;this.lru.remove(r)}clear(){this.lru.clear()}}class Xp{resolvers;cache;constructor(e){var t;this.resolvers={},this.cache=(t=e.cacheSize??1e3,new Wp(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["."]=[Hp("https://cloudflare-dns.com/dns-query"),Hp("https://dns.google/resolve")])}async query(e,t={}){const r=zp(t.types),n=!1!==t.cached?this.cache.get(e,r):void 0;if(null!=n)return t.onProgress?.(new Pp("dns:cache",{detail:n})),n;const s=`${e.split(".").pop()}.`,i=(this.resolvers[s]??this.resolvers["."]).sort((()=>Math.random()>.5?-1:1)),o=[];for(const n of i){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){o.push(e),t.onProgress?.(new Pp("dns:error",{detail:e}))}}if(1===o.length)throw o[0];throw new AggregateError(o,`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"}(Vp||(Vp={}));const{code:Jp}=Zs("dnsaddr");class Zp extends Error{constructor(e="Max recursive depth reached"){super(e),this.name="RecursionLimitError"}}const Qp=async function(e,t={}){const r=t.maxRecursiveDepth??32;if(0===r)throw new Zp("Max recursive depth reached");const[,n]=e.stringTuples().find((([e])=>e===Jp))??[],s=t?.dns??function(e={}){return new Xp(e)}(),i=await s.query(`_dnsaddr.${n}`,{signal:t?.signal,types:[Vp.TXT]}),o=e.getPeerId(),a=[];for(const e of i.Answer){const n=e.data.replace(/["']/g,"").trim().split("=")[1];if(null==n)continue;if(null!=o&&!n.includes(o))continue;const s=bi(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},Yp=__webpack_require__(6864),ef={addresses:{listen:[],announce:[],noAnnounce:[],announceFilter:e=>e},connectionManager:{resolvers:{dnsaddr:Qp}},transportManager:{faultTolerance:gp.FATAL_ALL}};async function tf(e){const t=Yp(ef,e);if(null===t.connectionProtector&&null!=globalThis.process?.env?.LIBP2P_FORCE_PNET)throw new so("Private network is enforced, but no protector was provided");return t}const rf=Symbol.for("@libp2p/content-routing"),nf=Symbol.for("@libp2p/peer-routing"),sf=1e3,of=60*sf,af=60*of,cf=24*af,lf=7*cf,uf=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*lf;case"days":case"day":case"d":return r*cf;case"hours":case"hour":case"hrs":case"hr":case"h":return r*af;case"minutes":case"minute":case"mins":case"min":case"m":return r*of;case"seconds":case"second":case"secs":case"sec":case"s":return r*sf;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>=cf?hf(e,t,cf,"day"):t>=af?hf(e,t,af,"hour"):t>=of?hf(e,t,of,"minute"):t>=sf?hf(e,t,sf,"second"):`${e} ms`}(e):function(e){const t=Math.abs(e);return t>=cf?`${Math.round(e/cf)}d`:t>=af?`${Math.round(e/af)}h`:t>=of?`${Math.round(e/of)}m`:t>=sf?`${Math.round(e/sf)}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 hf(e,t,r,n){const s=t>=1.5*r;return`${Math.round(e/r)} ${n}${s?"s":""}`}const df=function(){try{return localStorage}catch(e){}}(),pf=console.debug??console.log??(()=>{}),ff=function(e){function t(e){let n,s,i,o=null;function a(...e){if(!a.enabled)return;const r=a,s=Number(new Date),i=s-(n||s);r.diff=i,r.prev=n,r.curr=s,n=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let o=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((n,s)=>{if("%%"===n)return"%";o++;const i=t.formatters[s];if("function"==typeof i){const t=e[o];n=i.call(r,t),e.splice(o,1),o--}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!==o?o:(s!==t.namespaces&&(s=t.namespaces,i=t.enabled(e)),i),set:e=>{o=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?df?.setItem("debug",e):df?.removeItem("debug")}catch(e){}},load:function(){let e;try{e=df?.getItem("debug")}catch(e){}return!e&&void 0!==globalThis.process&&"env"in globalThis.process&&(e=globalThis.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:df,log:pf}),gf=ff;function mf(){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 gf.enabled(`${e}:trace`)&&null!=gf.names.map((e=>e.toString())).find((e=>e.includes(":trace")))&&(t=gf(`${e}:trace`)),Object.assign(gf(e),{error:gf(`${e}:error`),trace:t})}(e)}}function yf(e){if(null!=e&&0!==(e=e.trim()).length)return e}function wf(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}function bf(e){return Tl(st(Ee.decode(`z${e}`)))}gf.formatters.b=e=>null==e?"undefined":Ee.baseEncode(e),gf.formatters.t=e=>null==e?"undefined":ue.baseEncode(e),gf.formatters.m=e=>null==e?"undefined":Ae.baseEncode(e),gf.formatters.p=e=>null==e?"undefined":e.toString(),gf.formatters.c=e=>null==e?"undefined":e.toString(),gf.formatters.k=e=>null==e?"undefined":e.toString(),gf.formatters.a=e=>null==e?"undefined":e.toString(),gf.formatters.e=e=>null==e?"undefined":yf(e.stack)??yf(e.message)??e.toString();class vf{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 wf(this.set.entries(),(e=>{const t=bf(e[0]);return[t,t]}))}forEach(e){this.set.forEach((t=>{const r=bf(t);e(r,r,this)}))}has(e){return this.set.has(e.toString())}values(){return wf(this.set.values(),(e=>bf(e)))}intersection(e){const t=new vf;for(const r of e)this.has(r)&&t.add(r);return t}difference(e){const t=new vf;for(const r of this)e.has(r)||t.add(r);return t}union(e){const t=new vf;for(const r of e)t.add(r);for(const e of this)t.add(e);return t}}const Ef={},Sf=e=>{e.addEventListener("message",(t=>{Sf.dispatchEvent("message",e,t)})),null!=e.port&&e.port.addEventListener("message",(t=>{Sf.dispatchEvent("message",e,t)}))};Sf.addEventListener=(e,t)=>{null==Ef[e]&&(Ef[e]=[]),Ef[e].push(t)},Sf.removeEventListener=(e,t)=>{null!=Ef[e]&&(Ef[e]=Ef[e].filter((e=>e===t)))},Sf.dispatchEvent=function(e,t,r){null!=Ef[e]&&Ef[e].forEach((e=>e(t,r)))};const Af=Sf,xf="lock:worker:request-read",kf="lock:worker:release-read",If="lock:master:grant-read",_f="lock:worker:request-write",Cf="lock:worker:release-write",Tf="lock:master:grant-write",Pf=(e,t,r,n,s)=>(i,o)=>{if(o.data.type!==r)return;const a={type:o.data.type,name:o.data.name,identifier:o.data.identifier};e.dispatchEvent(new MessageEvent(t,{data:{name:a.name,handler:async()=>{i.postMessage({type:s,name:a.name,identifier:a.identifier}),await new Promise((e=>{const t=r=>{if(null==r?.data)return;const s=r.data.type,o=(r.data.name,r.data.identifier);s===n&&o===a.identifier&&(i.removeEventListener("message",t),e())};i.addEventListener("message",t)}))}}}))},Lf=(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 i=o=>{if(null==o?.data)return;const a=o.data.type,c=o.data.identifier;a===r&&c===s&&(globalThis.removeEventListener("message",i),t((()=>{globalThis.postMessage({type:n,identifier:s,name:e})})))};globalThis.addEventListener("message",i)}))},Rf={singleProcess:!1},Of={};let Nf;async function Df(e,t){let r;const n=new Promise((e=>{r=e}));return e.add((async()=>qp((async()=>{await new Promise((e=>{r((()=>{e()}))}))})(),{milliseconds:t.timeout}))),n}const Mf={name:"lock",concurrency:1/0,timeout:846e5,singleProcess:!1};var Ff,Bf,Uf;function qf(e,t){if(null!=e.publicKey||null==t.publicKey)return e;let r;return"RSA"===e.type&&(r=st(Ee.decode(`z${e}`))),Cl(yl(t.publicKey,r))}function $f(e,t,r){return jf(e,Ff.decode(t),r)}function jf(e,t,r){const n=new Map,s=BigInt(Date.now());for(const[e,r]of t.tags.entries())null!=r.expiry&&r.expirynull!=e&&e>Date.now()-r)).map((({multiaddr:e,isCertified:t})=>({multiaddr:bi(e),isCertified:t??!1}))),metadata:t.metadata,peerRecordEnvelope:t.peerRecordEnvelope??void 0,tags:n}}function zf(e,t){return null==e&&null==t||null!=e&&null!=t&&_n(e,t)}function Kf(e,t,r){if(e.length!==t.length)return!1;for(let n=0;n(null==t&&(t=vr(((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,r={})=>{const n={key:"",value:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.key=e.string();break;case 2:n.value=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(t=e.Peer$metadataEntry||(e.Peer$metadataEntry={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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),Uf.codec().encode(e.value,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={key:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.key=e.string();break;case 2:n.value=Uf.codec().decode(e,e.uint32(),{limits:r.limits?.value});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(r=e.Peer$tagsEntry||(e.Peer$tagsEntry={})),e.codec=()=>(null==n&&(n=vr(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.addresses)for(const e of t.addresses)r.uint32(10),Bf.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);null!=t.updated&&(r.uint32(64),r.uint64Number(t.updated)),!1!==n.lengthDelimited&&r.ldelim()}),((t,r,n={})=>{const s={addresses:[],protocols:[],metadata:new Map,tags:new Map},i=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:if(null!=n.limits?.addresses&&s.addresses.length===n.limits.addresses)throw new Er('Decode error - map field "addresses" had too many elements');s.addresses.push(Bf.codec().decode(t,t.uint32(),{limits:n.limits?.addresses$}));break;case 2:if(null!=n.limits?.protocols&&s.protocols.length===n.limits.protocols)throw new Er('Decode error - map field "protocols" had too many elements');s.protocols.push(t.string());break;case 4:s.publicKey=t.bytes();break;case 5:s.peerRecordEnvelope=t.bytes();break;case 6:{if(null!=n.limits?.metadata&&s.metadata.size===n.limits.metadata)throw new Sr('Decode error - map field "metadata" had too many elements');const r=e.Peer$metadataEntry.codec().decode(t,t.uint32());s.metadata.set(r.key,r.value);break}case 7:{if(null!=n.limits?.tags&&s.tags.size===n.limits.tags)throw new Sr('Decode error - map field "tags" had too many elements');const r=e.Peer$tagsEntry.codec().decode(t,t.uint32(),{limits:{value:n.limits?.tags$value}});s.tags.set(r.key,r.value);break}case 8:s.updated=t.uint64Number();break;default:t.skipType(7&r)}}return s}))),n),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Ff||(Ff={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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)),null!=e.observed&&(t.uint32(24),t.uint64Number(e.observed)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={multiaddr:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.multiaddr=e.bytes();break;case 2:n.isCertified=e.bool();break;case 3:n.observed=e.uint64Number();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Bf||(Bf={})),function(e){let t;e.codec=()=>(null==t&&(t=vr(((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,r={})=>{const n={value:0},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.value=e.uint32();break;case 2:n.expiry=e.uint64();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>qt(t,e.codec()),e.decode=(t,r)=>H(t,e.codec(),r)}(Uf||(Uf={}));const Vf="/",Gf=(new TextEncoder).encode(Vf),Wf=Gf[0];class Xf{_buf;constructor(e,t){if("string"==typeof e)this._buf=It(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]!==Wf)throw new Error("Invalid key")}toString(e="utf8"){return Yr(this._buf,e)}uint8Array(){return this._buf}get[Symbol.toStringTag](){return`Key(${this.toString()})`}static withNamespaces(e){return new Xf(e.join(Vf))}static random(){return new Xf(Math.random().toString().substring(2))}static asKey(e){return e instanceof Uint8Array||"string"==typeof e?new Xf(e):"function"==typeof e.uint8Array?new Xf(e.uint8Array()):null}clean(){if(null!=this._buf&&0!==this._buf.byteLength||(this._buf=Gf),this._buf[0]!==Wf){const e=new Uint8Array(this._buf.byteLength+1);e.fill(Wf,0,1),e.set(this._buf,1),this._buf=e}for(;this._buf.byteLength>1&&this._buf[this._buf.byteLength-1]===Wf;)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 Jf="/peers/";function Zf(e){if(!Os(e)||null==e.type)throw new so("Invalid PeerId");const t=e.toCID().toString();return new Xf(`${Jf}${t}`)}async function Qf(e,t,r,n){const s=new Map;for(const n of r){if(null==n)continue;if(n.multiaddr instanceof Uint8Array&&(n.multiaddr=bi(n.multiaddr)),!wi(n.multiaddr))throw new so("Multiaddr was invalid");if(!await t(e,n.multiaddr))continue;const r=n.isCertified??!1,i=n.multiaddr.toString(),o=s.get(i);null!=o?n.isCertified=o.isCertified||r:s.set(i,{multiaddr:n.multiaddr,isCertified:r})}return[...s.values()].sort(((e,t)=>e.multiaddr.toString().localeCompare(t.multiaddr.toString()))).map((({isCertified:e,multiaddr:t})=>({isCertified:e,multiaddr:t.bytes})))}async function Yf(e,t,r,n){if(null==t)throw new so("Invalid PeerData");if(null!=t.publicKey&&null!=e.publicKey&&!t.publicKey.equals(e.publicKey))throw new so("publicKey bytes do not match peer id publicKey bytes");const s=n.existingPeer?.peer;if(null!=s&&!e.equals(s.id))throw new so("peer id did not match existing peer id");let i,o=s?.addresses??[],a=new Set(s?.protocols??[]),c=s?.metadata??new Map,l=s?.tags??new Map,u=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&&(a=new Set(t.protocols)),null!=t.metadata&&(c=eg(t.metadata instanceof Map?[...t.metadata.entries()]:Object.entries(t.metadata),{validate:tg})),null!=t.tags&&(l=eg(t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),{validate:rg,map:ng})),null!=t.peerRecordEnvelope&&(u=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&&(a=new Set([...a,...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?c.delete(t):c.set(t,r);c=eg([...c.entries()],{validate:tg})}if(null!=t.tags){const e=t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),r=new Map(l);for(const[t,n]of e)null==n?r.delete(t):r.set(t,n);l=eg([...r.entries()],{validate:rg,map:ng})}null!=t.peerRecordEnvelope&&(u=t.peerRecordEnvelope)}null!=s?.id.publicKey?i=wl(s.id.publicKey):null!=t.publicKey?i=wl(t.publicKey):null!=e.publicKey&&(i=wl(e.publicKey));const h={addresses:await Qf(e,n.addressFilter??(async()=>!0),o,n.existingPeer?.peerPB.addresses),protocols:[...a.values()].sort(((e,t)=>e.localeCompare(t))),metadata:c,tags:l,publicKey:i,peerRecordEnvelope:u};return h.addresses.forEach((e=>{e.observed=n.existingPeer?.peerPB.addresses?.find((e=>_n(e.multiaddr,e.multiaddr)))?.observed??Date.now()})),"RSA"!==e.type&&delete h.publicKey,h}function eg(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 tg(e,t){if("string"!=typeof e)throw new so("Metadata key must be a string");if(!(t instanceof Uint8Array))throw new so("Metadata value must be a Uint8Array")}function rg(e,t){if("string"!=typeof e)throw new so("Tag name must be a string");if(null!=t.value){if(parseInt(`${t.value}`,10)!==t.value)throw new so("Tag value must be an integer");if(t.value<0||t.value>100)throw new so("Tag value must be between 0-100")}if(null!=t.ttl){if(parseInt(`${t.ttl}`,10)!==t.ttl)throw new so("Tag ttl must be an integer");if(t.ttl<0)throw new so("Tag ttl must be between greater than 0")}}function ng(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 sg(e){const t=e.toString().split("/")[2];return Pl(mt.parse(t,ue))}function ig(e,t,r){return $f(sg(e),t,r)}class og{peerId;datastore;lock;addressFilter;log;maxAddressAge;maxPeerAge;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:peer-store"),this.peerId=e.peerId,this.datastore=e.datastore,this.addressFilter=t.addressFilter,this.lock=function(e){const t=Object.assign({},Mf,e);return null==Nf&&(Nf=(e=>{if(e=Object.assign({},Rf,e),Boolean(globalThis.document)||e.singleProcess){const e=new EventTarget;return Af.addEventListener("message",Pf(e,"requestReadLock",xf,kf,If)),Af.addEventListener("message",Pf(e,"requestWriteLock",_f,Cf,Tf)),e}return{isWorker:!0,readLock:e=>Lf(e,xf,If,kf),writeLock:e=>Lf(e,_f,Tf,Cf)}})(t),!0!==Nf.isWorker&&(Nf.addEventListener("requestReadLock",(e=>{null!=Of[e.data.name]&&Of[e.data.name].readLock().then((async t=>e.data.handler().finally((()=>{t()}))))})),Nf.addEventListener("requestWriteLock",(async e=>{null!=Of[e.data.name]&&Of[e.data.name].writeLock().then((async t=>e.data.handler().finally((()=>{t()}))))})))),null==Of[t.name]&&(Of[t.name]=((e,t)=>{if(!0===Nf.isWorker)return{readLock:Nf.readLock(e,t),writeLock:Nf.writeLock(e,t)};const r=new jp({concurrency:1});let n;return{async readLock(){if(null!=n)return Df(n,t);n=new jp({concurrency:t.concurrency,autoStart:!1});const e=n,s=Df(n,t);return r.add((async()=>{e.start(),await e.onIdle().then((()=>{n===e&&(n=null)}))})),s},writeLock:async()=>(n=null,Df(r,t))}})(t.name,t)),Of[t.name]}({name:"peer-store",singleProcess:!0}),this.maxAddressAge=t.maxAddressAge??36e5,this.maxPeerAge=t.maxPeerAge??216e5}async has(e){try{return await this.load(e),!0}catch(e){if("NotFoundError"!==e.name)throw e}return!1}async delete(e){this.peerId.equals(e)||await this.datastore.delete(Zf(e))}async load(e){const t=Zf(e),r=await this.datastore.get(t),n=Ff.decode(r);if(this.#L(e,n))throw await this.datastore.delete(t),new fo;return jf(e,n,this.peerId.equals(e)?1/0:this.maxAddressAge)}async save(e,t){const r=await this.#R(e),n=await Yf(e,t,"patch",{addressFilter:this.addressFilter});return this.#O(e,n,r)}async patch(e,t){const r=await this.#R(e),n=await Yf(e,t,"patch",{addressFilter:this.addressFilter,existingPeer:r});return this.#O(e,n,r)}async merge(e,t){const r=await this.#R(e),n=await Yf(e,t,"merge",{addressFilter:this.addressFilter,existingPeer:r});return this.#O(e,n,r)}async*all(e){for await(const{key:t,value:r}of this.datastore.query(function(e,t){return{prefix:Jf,filters:(e.filters??[]).map((e=>({key:r,value:n})=>e(ig(r,n,t)))),orders:(e.orders??[]).map((e=>(r,n)=>e(ig(r.key,r.value,t),ig(n.key,n.value,t))))}}(e??{},this.maxAddressAge))){const e=sg(t);if(e.equals(this.peerId))continue;const n=Ff.decode(r);this.#L(e,n)?await this.datastore.delete(t):yield jf(e,n,this.peerId.equals(e)?1/0:this.maxAddressAge)}}async#R(e){try{const t=Zf(e),r=await this.datastore.get(t),n=Ff.decode(r);if(this.#L(e,n))throw await this.datastore.delete(t),new fo;return{peerPB:n,peer:$f(e,r,this.maxAddressAge)}}catch(e){"NotFoundError"!==e.name&&this.log.error("invalid peer data found in peer store - %e",e)}}async#O(e,t,r){t.updated=Date.now();const n=Ff.encode(t);return await this.datastore.put(Zf(e),n),{peer:$f(e,n,this.maxAddressAge),previous:r?.peer,updated:null==r||(o=t,a=r.peerPB,!(Kf(o.addresses,a.addresses,((e,t)=>e.isCertified===t.isCertified&&!!_n(e.multiaddr,t.multiaddr)))&&Kf(o.protocols,a.protocols,((e,t)=>e===t))&&zf(o.publicKey,a.publicKey)&&zf(o.peerRecordEnvelope,a.peerRecordEnvelope)&&Hf(o.metadata,a.metadata,((e,t)=>_n(e,t)))&&(s=o.tags,i=a.tags,Hf(s,i,((e,t)=>e.value===t.value&&e.expiry===t.expiry)))))};var s,i,o,a}#L(e,t){if(null==t.updated)return!0;if(this.peerId.equals(e))return!1;const r=t.updatednull!=e.observed&&e.observed>n));return r&&0===s.length}}class ag{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 og(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 kn(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.#N(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.#N(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.#N(e,r),r.peer}finally{this.log.trace("merge release write lock"),r()}}async consumePeerRecord(e,t){const r=await Ph.openAndCertify(e,Ch.DOMAIN),n=Pl(r.publicKey.toCID());if(!1===t?.equals(n))return this.log("envelope peer id was not the expected peer id - expected: %p received: %p",t,n),!1;const s=Ch.createFromProtobuf(r.payload);let i;try{i=await this.get(n)}catch(e){if("NotFoundError"!==e.name)throw e}if(null!=i?.peerRecordEnvelope){const e=await Ph.createFromProtobuf(i.peerRecordEnvelope),t=Ch.createFromProtobuf(e.payload);if(t.seqNumber>=s.seqNumber)return this.log("sequence number was lower or equal to existing sequence number - stored: %d received: %d",t.seqNumber,s.seqNumber),!1}return await this.patch(s.peerId,{peerRecordEnvelope:e,addresses:s.multiaddrs.map((e=>({isCertified:!0,multiaddr:e})))}),!0}#N(e,t){t.updated&&(this.peerId.equals(e)?this.events.safeDispatchEvent("self:peer:update",{detail:t}):this.events.safeDispatchEvent("peer:update",{detail:t}))}}Error,Error,Error,Error,Error,Error;class cg extends Error{static name="NotFoundError";static code="ERR_NOT_FOUND";name=cg.name;code=cg.code;constructor(e="Not Found"){super(e)}}Error;const lg=function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{for await(const t of e);})();for(const t of e);},ug=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:i}=n.next();if(!0===i)return function*(){}();const o=t(s,r++);if("function"==typeof o.then)return async function*(){await o&&(yield s);for await(const e of n)await t(e,r++)&&(yield e)}();const a=t;return function*(){!0===o&&(yield s);for(const e of n)a(e,r++)&&(yield e)}()},hg=function(e,t){return null!=e[Symbol.asyncIterator]?async function*(){const r=await kn(e);yield*r.sort(t)}():function*(){const r=kn(e);yield*r.sort(t)}()},dg=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 pg{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 lg(this.putMany(e,r)),e=[],await lg(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=ug(r,(e=>e.key.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>ug(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>hg(e,t)),r)),null!=e.offset){let t=0;const n=e.offset;r=ug(r,(()=>t++>=n))}return null!=e.limit&&(r=dg(r,e.limit)),r}queryKeys(e,t){let r=this._allKeys(e,t);if(null!=e.prefix){const t=e.prefix;r=ug(r,(e=>e.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>ug(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>hg(e,t)),r)),null!=e.offset){const t=e.offset;let n=0;r=ug(r,(()=>n++>=t))}return null!=e.limit&&(r=dg(r,e.limit)),r}}class fg extends pg{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 new cg;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 Xf(e),value:t}}*_allKeys(){for(const e of this.data.keys())yield new Xf(e)}}const gg=e=>e;function mg(e,t){const r=e.getPeerId();return null!=r&&_l(r).equals(t)&&(e=e.decapsulate(bi(`/p2p/${t.toString()}`))),e}class yg{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??gg,this._updatePeerStoreAddresses=function(e){let t;return function(){clearTimeout(t),t=setTimeout((function(){t=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])=>bi(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=>bi(e)))}getAnnounceAddrs(){return Array.from(this.announce).map((e=>bi(e)))}getObservedAddrs(){return Array.from(this.observed).map((([e])=>bi(e)))}addObservedAddr(e){const t=(e=mg(e,this.components.peerId)).toString();this.observed.has(t)||this.observed.set(t,{confident:!1})}confirmObservedAddr(e){const t=(e=mg(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=mg(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=>bi(e)))).map((e=>!0===e.protos().pop()?.path||e.getPeerId()===this.components.peerId.toString()?e:e.encapsulate(`/p2p/${this.components.peerId.toString()}`)))}}function wg(e){return null!=e&&"function"==typeof e.start&&"function"==typeof e.stop}var bg;!function(e){e.NOT_STARTED_YET="The libp2p node is not started yet",e.NOT_FOUND="Not found"}(bg||(bg={}));class vg extends Error{constructor(e="Missing service"){super(e),this.name="MissingServiceError"}}class Eg extends Error{constructor(e="Unmet service dependencies"){super(e),this.name="UnmetServiceDependenciesError"}}class Sg extends Error{constructor(e="No content routers available"){super(e),this.name="NoContentRoutersError"}}class Ag extends Error{constructor(e="No peer routers available"){super(e),this.name="NoPeerRoutersError"}}class xg extends Error{constructor(e="Should not try to find self"){super(e),this.name="QueriedForSelfError"}}class kg extends Error{constructor(e="Unhandled protocol error"){super(e),this.name="UnhandledProtocolError"}}class Ig extends Error{constructor(e="Duplicate protocol handler error"){super(e),this.name="DuplicateProtocolHandlerError"}}class _g extends Error{constructor(e="Dial denied error"){super(e),this.name="DialDeniedError"}}class Cg extends Error{constructor(e="No valid addresses"){super(e),this.name="NoValidAddressesError"}}class Tg extends Error{constructor(e="Connection intercepted"){super(e),this.name="ConnectionInterceptedError"}}class Pg extends Error{constructor(e="Connection denied"){super(e),this.name="ConnectionDeniedError"}}class Lg extends Error{constructor(e="Stream is not multiplexed"){super(e),this.name="MuxerUnavailableError"}}class Rg extends Error{constructor(e="Encryption failed"){super(e),this.name="EncryptionFailedError"}}class Og extends Error{constructor(e="Transport unavailable"){super(e),this.name="TransportUnavailableError"}}class Ng{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=mf())}isStarted(){return this._started}async _invokeStartableMethod(e){await Promise.all(Object.values(this.components).filter((e=>wg(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 Dg=["metrics","connectionProtector","dns"],Mg=["components","isStarted","beforeStart","start","afterStart","beforeStop","stop","afterStop","then","_invokeStartableMethod"];function Fg(e){return Array.isArray(e?.[bl])?e[bl]:[]}function Bg(e){return Array.isArray(e?.[vl])?e[vl]:[]}function Ug(e){return e?.[Symbol.toStringTag]??e?.toString()??"unknown"}function qg(e={}){return{denyDialPeer:async()=>!1,denyDialMultiaddr:async e=>{const t=e.stringTuples();return(4===t[0][0]||41===t[0][0])&&Boolean(Dh(`${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}}class $g{map;constructor(e){if(this.map=new Map,null!=e)for(const[t,r]of e.entries())this.map.set(t.toString(),{key:t,value:r})}[Symbol.iterator](){return this.entries()}clear(){this.map.clear()}delete(e){return this.map.delete(e.toString())}entries(){return wf(this.map.entries(),(e=>[e[1].key,e[1].value]))}forEach(e){this.map.forEach(((t,r)=>{e(t.value,t.key,this)}))}get(e){return this.map.get(e.toString())?.value}has(e){return this.map.has(e.toString())}set(e,t){this.map.set(e.toString(),{key:e,value:t})}keys(){return wf(this.map.values(),(e=>e.key))}values(){return wf(this.map.values(),(e=>e.value))}get size(){return this.map.size}}function jg(e){if(Os(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:_l(r),e.forEach((e=>{if(!wi(e))throw new mo("Invalid multiaddr");const r=e.getPeerId();if(null==r){if(null!=t)throw new so("Multiaddrs must all have the same peer id or have no peer id")}else{const e=_l(r);if(!0!==t?.equals(e))throw new so("Multiaddrs must all have the same peer id or have no peer id")}}))}return{peerId:t,multiaddrs:e}}const zg=["/ipfs/id/1.0.0","/ipfs/id/push/1.0.0","/libp2p/autonat/1.0.0","/libp2p/dcutr"],Kg={maxConnections:100,allow:[]};class Hg{maxConnections;connectionManager;peerStore;allow;events;log;constructor(e,t={}){this.maxConnections=t.maxConnections??Kg.maxConnections,this.allow=t.allow??Kg.allow,this.connectionManager=e.connectionManager,this.peerStore=e.peerStore,this.events=e.events,this.log=e.logger.forComponent("libp2p:connection-manager:connection-pruner"),this.maybePruneConnections=this.maybePruneConnections.bind(this)}start(){this.events.addEventListener("connection:open",this.maybePruneConnections)}stop(){this.events.removeEventListener("connection:open",this.maybePruneConnections)}maybePruneConnections(){this._maybePruneConnections().catch((e=>{this.log.error("error while pruning connections %e",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 $g;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){"NotFoundError"!==e.name&&this.log.error("error loading peer tags",e)}}}const n=this.sortConnections(e,r),s=Math.max(t-this.maxConnections,0),i=[];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())))||i.push(e),i.length===s)break;await Promise.all(i.map((async e=>{await async function(e,t){const r=e?.streams?.map((e=>e.protocol))??[],n=t?.closableProtocols??zg;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:i})}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:n{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 o(e)}a(),i(e)},l=e=>{a(),o(e.detail)},u=()=>{a(),o(s)};r?.addEventListener("abort",u),e.addEventListener(t,c),null!=n?.errorEvent&&e.addEventListener(n.errorEvent,l)}))}class Jg{deferred;signal;constructor(e){this.signal=e,this.deferred=jn(),this.onAbort=this.onAbort.bind(this),this.signal?.addEventListener("abort",this.onAbort)}onAbort(){this.deferred.reject(this.signal?.reason??new ro)}cleanup(){this.signal?.removeEventListener("abort",this.onAbort)}}class Zg{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 ro),this.cleanup())}async join(e={}){const t=new Jg(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 Wn(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 Qg extends Ls{concurrency;maxSize;queue;pending;sort;constructor(e={}){super(),this.concurrency=e.concurrency??Number.POSITIVE_INFINITY,this.maxSize=e.maxSize??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 ro)})),this.clear()}async onEmpty(e){0!==this.size&&await Xg(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)},i=()=>{r()},o=()=>{r(new ro("Queue aborted"))};this.addEventListener("completed",n),this.addEventListener("error",s),this.addEventListener("idle",i),e?.signal?.addEventListener("abort",o);try{yield*t}finally{this.removeEventListener("completed",n),this.removeEventListener("error",s),this.removeEventListener("idle",i),e?.signal?.removeEventListener("abort",o),r()}}}class Yg extends Qg{constructor(e={}){super({...e,sort:(e,t)=>e.options.priority>t.options.priority?-1:e.options.priority{e.detail.name!==ro.name&&this.log.error("error in dial queue - %e",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}=jg(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("open"===s?.status)return this.log("already connected to %a",s.remoteAddr),t.onProgress?.(new Pp("dial-queue:already-connected")),s;const i=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!=i){this.log("joining existing dial target for %p",r);for(const e of n)i.options.multiaddrs.add(e.toString());return t.onProgress?.(new Pp("dial-queue:already-in-dial-queue")),i.join(t)}if(this.queue.size>=this.maxDialQueueLength)throw new xo("Dial queue is full");return this.log("creating dial target for %p",r,n.map((e=>e.toString()))),t.onProgress?.(new Pp("dial-queue:add-to-dial-queue")),this.queue.add((async e=>{e?.onProgress?.(new Pp("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 Pp("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 i=[];for(const o of n){if(s===this.maxPeerAddrsToDial)throw this.log("dialed maxPeerAddrsToDial (%d) addresses for %p, not trying any others",s,r),new xo("Peer had more than maxPeerAddrsToDial");s++;try{const n=await this.components.transportManager.dial(o.multiaddr,{...e,signal:t});this.log("dial to %a succeeded",o.multiaddr);try{await this.components.peerStore.merge(n.remotePeer,{multiaddrs:[n.remoteAddr],metadata:{[Gg]:It(Date.now().toString())}})}catch(e){this.log.error("could not update last dial failure key for %p",r,e)}return n}catch(e){if(this.log.error("dial failed to %a",o.multiaddr,e),null!=r)try{await this.components.peerStore.merge(r,{metadata:{[Vg]:It(Date.now().toString())}})}catch(e){this.log.error("could not update last dial failure key for %p",r,e)}if(t.aborted)throw new So(e.message);i.push(e)}}if(1===i.length)throw i[0];throw new AggregateError(i,"All multiaddr dials failed")}finally{t.clear()}}),{peerId:r,priority:t.priority??gm,multiaddrs:new Set(n.map((e=>e.toString()))),signal:t.signal,onProgress:t.onProgress})}createDialAbortController(e){return em([AbortSignal.timeout(this.dialTimeout),this.shutDownController.signal,e])}async calculateMultiaddrs(e,t=new Set,r={}){const n=[...t].map((e=>({multiaddr:bi(e),isCertified:!1})));if(null!=e){if(this.components.peerId.equals(e))throw new xo("Tried to dial self");if(!0===await(this.components.connectionGater.denyDialPeer?.(e)))throw new _g("The dial request is blocked by gater.allowDialPeer");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("NotFoundError"!==e.name)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){"NoPeerRoutersError"!==t.name&&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 yi.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 i=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)})),o=new Map;for(const e of i){const t=e.multiaddr.toString(),r=o.get(t);null==r?o.set(t,e):r.isCertified=r.isCertified||e.isCertified||!1}const a=[...o.values()];if(0===a.length)throw new Cg("The dial request has 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=null==this.addressSorter?c.sort(tm).sort(nm).sort(sm).sort(rm):c.sort(this.addressSorter);if(0===l.length)throw new _g("The connection gater denied all addresses in the dial request");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.runOnLimitedConnection||null!=r.find((e=>!wd.matches(e.multiaddr)))}catch(e){this.log.trace("error calculating if multiaddr(s) were dialable",e)}return!1}}const om="keep-alive";class am extends Qg{has(e){return null!=this.find(e)}find(e){return this.queue.find((t=>e.equals(t.options.peerId)))}}var cm=__webpack_require__(5617);const lm=Object.prototype.toString,um=new Set(["network error","Failed to fetch","NetworkError when attempting to fetch resource.","The Internet connection appears to be offline.","Load failed","Network request failed","fetch failed","terminated"]);class hm extends Error{constructor(e){super(),e instanceof Error?(this.originalError=e,({message:e}=e)):(this.originalError=new Error(e),this.originalError.stack=this.stack),this.name="AbortError",this.message=e}}const dm=(e,t,r)=>{const n=r.retries-(t-1);return e.attemptNumber=t,e.retriesLeft=n,e};class pm{log;queue;started;peerStore;retries;retryInterval;backoffFactor;connectionManager;events;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:reconnect-queue"),this.peerStore=e.peerStore,this.connectionManager=e.connectionManager,this.queue=new am({concurrency:t.maxParallelReconnects??5,metricName:"libp2p_reconnect_queue",metrics:e.metrics}),this.started=!1,this.retries=t.retries??5,this.backoffFactor=t.backoffFactor,this.retryInterval=t.retryInterval,this.events=e.events,e.events.addEventListener("peer:disconnect",(e=>{this.maybeReconnect(e.detail).catch((t=>{this.log.error("failed to maybe reconnect to %p - %e",e.detail,t)}))}))}async maybeReconnect(e){if(!this.started)return;const t=await this.peerStore.get(e);fm(t)&&(this.queue.has(e)||this.queue.add((async t=>{await async function(e,t){return new Promise(((r,n)=>{t={...t},t.onFailedAttempt??=()=>{},t.shouldRetry??=()=>!0,t.retries??=10;const s=cm.operation(t),i=()=>{s.stop(),n(t.signal?.reason)};t.signal&&!t.signal.aborted&&t.signal.addEventListener("abort",i,{once:!0});const o=()=>{t.signal?.removeEventListener("abort",i),s.stop()};s.attempt((async i=>{try{const t=await e(i);o(),r(t)}catch(e){try{if(!(e instanceof Error))throw new TypeError(`Non-error was thrown: "${e}". You should only throw errors.`);if(e instanceof hm)throw e.originalError;if(e instanceof TypeError&&!function(e){var t;return!(!e||(t=e,"[object Error]"!==lm.call(t))||"TypeError"!==e.name||"string"!=typeof e.message)&&("Load failed"===e.message?void 0===e.stack:um.has(e.message))}(e))throw e;if(dm(e,i,t),await t.shouldRetry(e)||(s.stop(),n(e)),await t.onFailedAttempt(e),!s.retry(e))throw s.mainError()}catch(e){dm(e,i,t),o(),n(e)}}}))}))}((async r=>{if(this.started)try{await this.connectionManager.openConnection(e,{signal:t?.signal})}catch(t){throw this.log("reconnecting to %p attempt %d of %d failed - %e",e,r,this.retries,t),t}}),{signal:t?.signal,retries:this.retries,factor:this.backoffFactor,minTimeout:this.retryInterval})}),{peerId:e}).catch((async r=>{this.log.error("failed to reconnect to %p - %e",e,r);const n={};[...t.tags.keys()].forEach((e=>{e.startsWith(om)&&(n[e]=void 0)})),await this.peerStore.merge(e,{tags:n}),this.events.safeDispatchEvent("peer:reconnect-failure",{detail:e})})).catch((async t=>{this.log.error("failed to remove keep-alive tag from %p - %e",e,t)})))}start(){this.started=!0}async afterStart(){Promise.resolve().then((async()=>{const e=await this.peerStore.all({filters:[e=>fm(e)]});await Promise.all(e.map((async e=>{await this.connectionManager.openConnection(e.id).catch((e=>{this.log.error(e)}))})))})).catch((e=>{this.log.error(e)}))}stop(){this.started=!1,this.queue.abort()}}function fm(e){for(const t of e.tags.keys())if(t.startsWith(om))return!0;return!1}const gm=50;class mm{started;connections;allow;deny;maxIncomingPendingConnections;incomingPendingConnections;outboundPendingConnections;maxConnections;dialQueue;reconnectQueue;connectionPruner;inboundConnectionRateLimiter;peerStore;metrics;events;log;peerId;constructor(e,t={}){if(this.maxConnections=t.maxConnections??100,this.maxConnections<1)throw new so("Connection Manager maxConnections must be greater than 0");this.connections=new $g,this.started=!1,this.peerId=e.peerId,this.peerStore=e.peerStore,this.metrics=e.metrics,this.events=e.events,this.log=e.logger.forComponent("libp2p:connection-manager"),this.onConnect=this.onConnect.bind(this),this.onDisconnect=this.onDisconnect.bind(this),this.allow=(t.allow??[]).map((e=>bi(e))),this.deny=(t.deny??[]).map((e=>bi(e))),this.incomingPendingConnections=0,this.maxIncomingPendingConnections=t.maxIncomingPendingConnections??10,this.outboundPendingConnections=0,this.inboundConnectionRateLimiter=new Kd({points:t.inboundConnectionThreshold??5,duration:1}),this.connectionPruner=new Hg({connectionManager:this,peerStore:e.peerStore,events:e.events,logger:e.logger},{maxConnections:this.maxConnections,allow:this.allow}),this.dialQueue=new im(e,{addressSorter:t.addressSorter,maxParallelDials:t.maxParallelDials??50,maxDialQueueLength:t.maxDialQueueLength??500,maxPeerAddrsToDial:t.maxPeerAddrsToDial??25,dialTimeout:t.dialTimeout??5e3,resolvers:t.resolvers??{dnsaddr:Qp},connections:this.connections}),this.reconnectQueue=new pm({events:e.events,peerStore:e.peerStore,logger:e.logger,connectionManager:this},{retries:t.reconnectRetries,retryInterval:t.reconnectRetryInterval,backoffFactor:t.reconnectBackoffFactor,maxParallelReconnects:t.maxParallelReconnects})}[Symbol.toStringTag]="@libp2p/connection-manager";async start(){this.metrics?.registerMetricGroup("libp2p_connection_manager_connections",{calculate:()=>{const e={inbound:0,"inbound pending":this.incomingPendingConnections,outbound:0,"outbound pending":this.outboundPendingConnections};for(const t of this.connections.values())for(const r of t)e[r.direction]++;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.events.addEventListener("connection:open",this.onConnect),this.events.addEventListener("connection:close",this.onDisconnect),await async function(...e){const t=[];for(const r of e)wg(r)&&t.push(r);await Promise.all(t.map((async e=>{null!=e.beforeStart&&await e.beforeStart()}))),await Promise.all(t.map((async e=>{await e.start()}))),await Promise.all(t.map((async e=>{null!=e.afterStart&&await e.afterStart()})))}(this.dialQueue,this.reconnectQueue,this.connectionPruner),this.started=!0,this.log("started")}async stop(){this.events.removeEventListener("connection:open",this.onConnect),this.events.removeEventListener("connection:close",this.onDisconnect),await async function(...e){const t=[];for(const r of e)wg(r)&&t.push(r);await Promise.all(t.map((async e=>{null!=e.beforeStop&&await e.beforeStop()}))),await Promise.all(t.map((async e=>{await e.stop()}))),await Promise.all(t.map((async e=>{null!=e.afterStop&&await e.afterStop()})))}(this.reconnectQueue,this.dialQueue,this.connectionPruner);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();if("open"!==t.status)return;const r=t.remotePeer,n=!this.connections.has(r),s=this.connections.get(r)??[];s.push(t),this.connections.set(r,s),null!=r.publicKey&&"RSA"===r.type&&await this.peerStore.patch(r,{publicKey:r.publicKey}),n&&this.events.safeDispatchEvent("peer:connect",{detail:t.remotePeer})}onDisconnect(e){const{detail:t}=e,r=t.remotePeer,n=(this.connections.get(r)??[]).filter((e=>e.id!==t.id));this.connections.set(r,n),0===n.length&&(this.log("onDisconnect remove all connections for peer %p",r),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.started)throw new Ao("Not started");this.outboundPendingConnections++;try{t.signal?.throwIfAborted();const{peerId:r}=jg(e);if(this.peerId.equals(r))throw new go("Can not dial self");if(null!=r&&!0!==t.force){this.log("dial %p",r);const e=this.getConnections(r).find((e=>null==e.limits));if(null!=e)return this.log("had an existing non-limited connection to %p",r),t.onProgress?.(new Pp("dial-queue:already-connected")),e}const n=await this.dialQueue.dial(e,{...t,priority:t.priority??gm});if("open"!==n.status)throw new co("Remote closed connection during opening");let s=this.connections.get(n.remotePeer);null==s&&(s=[],this.connections.set(n.remotePeer,s));let i=!1;for(const e of s)if(e.id===n.id&&(i=!0),!0!==t.force&&e.id!==n.id&&e.remoteAddr.equals(n.remoteAddr))return n.abort(new mo("Duplicate multiaddr connection")),e;return i||s.push(n),n}finally{this.outboundPendingConnections--}}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=>bi(e)))})))}async isDialable(e,t={}){return this.dialQueue.isDialable(e,t)}}class ym{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 wm{success;failure;next;metric;timeoutMultiplier;failureMultiplier;minTimeout;constructor(e={}){this.success=new ym(e.interval??5e3),this.failure=new ym(e.interval??5e3),this.next=new ym(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=em([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 bm{protocol;components;log;heartbeatInterval;pingIntervalMs;abortController;timeout;abortConnectionOnPingFailure;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.abortConnectionOnPingFailure=t.abortConnectionOnPingFailure??!0,this.timeout=new wm({...t.pingTimeout??{},metrics:e.metrics,metricName:"libp2p_connection_monitor_ping_time_milliseconds"})}[Symbol.toStringTag]="@libp2p/connection-monitor";[bl]=["@libp2p/connection-monitor"];start(){this.abortController=new AbortController,this.abortController.signal,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=Dl(await e.newStream(this.protocol,{signal:r,runOnLimitedConnection:!0}));t=Date.now(),await Promise.all([n.write(hp(32),{signal:r}),n.read(32,{signal:r})]),e.rtt=Date.now()-t,await n.unwrap().close({signal:r})}catch(r){if("UnsupportedProtocolError"!==r.name)throw r;e.rtt=(Date.now()-t)/2}})).catch((t=>{this.log.error("error during heartbeat",t),this.abortConnectionOnPingFailure?(this.log.error("aborting connection due to ping failure"),e.abort(t)):this.log("connection ping failed, but not aborting due to abortConnectionOnPingFailure flag")}))}))}),this.pingIntervalMs)}stop(){this.abortController?.abort(),null!=this.heartbeatInterval&&clearInterval(this.heartbeatInterval)}}class vm{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 Sg("No content routers available");const r=this,n=new vf;for await(const s of Jn(...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 Sg("No content 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 Ao;await Promise.all(this.routers.map((async n=>{await n.put(e,t,r)})))}async get(e,t){if(!this.isStarted())throw new Ao;return Promise.any(this.routers.map((async r=>r.get(e,t))))}}class Em{fp;h;seed;constructor(e,t,r,n=2){if(n>64)throw new TypeError("Invalid Fingerprint Size");const s=t.hashV(e,r),i=f(n);for(let e=0;ee.equals(t)))}add(e){if(!(e instanceof Em))throw new TypeError("Invalid Fingerprint");for(let t=0;te.equals(t)));return t>-1&&(this.contents[t]=null,!0)}}const xm={32:16777619n,64:1099511628211n,128:309485009821345068724781371n,256:374144419156711147060143317175368453031918731002211n,512:35835915874844867368919076489095108449946327955754392558399825615420669938882575126094039892345713852759n,1024:5016456510113118655434598811035278955030765345404790744303017523831112055108147451509157692220295382716162651878526895249385292291816524375083746691371804094271873160484737966720260389217684476157468082573n},km={32:2166136261n,64:14695981039346656037n,128:144066263297769815596495629667062367629n,256:100029257958052580907070968620625704837092796014241193945225284501741471925557n,512:9659303129496669498009435400716310466090418745672637896108374329434462657994582932197716438449813051892206539805784495328239340083876191928701583869517785n,1024:14197795064947621068722070641403218320880622795441933960878474914617582723252296732303717722150864096521202355549365628174669108571814760471015076148029755969804077320157692458563003215304957150157403644460363550505412711285966361610267868082893823963790439336411086884584107735010676915n},Im=new globalThis.TextEncoder;const _m={hash:e=>Number(function(e,{size:t=32,utf8Buffer:r}={}){if(!xm[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=xm[t];let s=km[t],i=e;for(;i.length>0;){const e=Im.encodeInto(i,r);i=i.slice(e.read);for(let i=0;ifunction(e){let t=e.toString(16);return t.length%2==1&&(t=`0${t}`),It(t,"base16")}(_m.hash(e,t))};class Cm{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??_m,this.seed=e.seed??Sm(0,Math.pow(2,10))}add(e){"string"==typeof e&&(e=It(e));const t=new Em(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 Am(this.bucketSize)),null==this.buckets[n]&&(this.buckets[n]=new Am(this.bucketSize)),this.buckets[r].add(t)||this.buckets[n].add(t))return this.count++,!0;const s=[r,n];let i=s[Sm(0,s.length-1)];null==this.buckets[i]&&(this.buckets[i]=new Am(this.bucketSize));for(let e=0;e<500;e++){const e=this.buckets[i].swap(t);if(null!=e&&(i=(i^e.hash())%this.filterSize,null==this.buckets[i]&&(this.buckets[i]=new Am(this.bucketSize)),this.buckets[i].add(e)))return this.count++,!0}return!1}has(e){"string"==typeof e&&(e=It(e));const t=new Em(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=It(e));const t=new Em(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,i=this.buckets[s]?.remove(t)??!1;return i&&this.count--,i}get reliable(){return Math.floor(this.count/this.filterSize*100)<=90}}const Tm={1:.5,2:.84,4:.95,8:.98};function Pm(e,t=.001){const r=function(e=.001){return e>.002?2:e>1e-5?4:8}(t),n=Tm[r];return{filterSize:Math.round(e/n),bucketSize:r,fingerprintSize:Math.min(Math.ceil(Math.log2(1/t)+Math.log2(2*r)),64)}}class Lm{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??_m,this.seed=e.seed??Sm(0,Math.pow(2,10)),this.filterSeries=[new Cm({filterSize:this.filterSize,bucketSize:this.bucketSize,fingerprintSize:this.fingerprintSize,hash:this.hash,seed:this.seed})]}add(e){if("string"==typeof e&&(e=It(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 Cm({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=It(e));for(let t=0;te+t.count),0)}}const Rm=globalThis.CustomEvent??Event;class Om{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 Ag("No peer routers available");if(e.toString()===this.peerId.toString())throw new xg("Should not try to find self");const r=this,n=Jn(...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 fo}async*getClosestPeers(e,t={}){if(0===this.routers.length)throw new Ag("No peer routers available");const r=this,n=function(e,t=.001,r){return new Lm({...Pm(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=t.ordered??!1,s=new EventTarget,i=[];let o,a=jn(),c=jn(),l=!1,u=!1;function h(){return n?i[0]?.done:Boolean(i.find((e=>e.done)))}function*d(){for(;i.length>0&&i[0].done;){const e=i[0];if(i.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(i.length===r&&(a=jn(),await a.promise),u)break;const e={done:!1};i.push(e),t().then((t=>{e.done=!0,e.ok=!0,e.value=t,s.dispatchEvent(new Rm("task-complete"))}),(t=>{e.done=!0,e.err=t,s.dispatchEvent(new Rm("task-complete"))}))}l=!0,s.dispatchEvent(new Rm("task-complete"))}catch(e){o=e,s.dispatchEvent(new Rm("task-complete"))}}));;){if(h()||(c=jn(),await c.promise),null!=o)throw o;if(n?yield*d():yield*p(),l&&0===i.length)break}}(async function*(){const n=Jn(...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.toMultihash().bytes)||(n.add(s.id.toMultihash().bytes),yield s))}}class Nm extends Ls{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=em([this.shutdownController.signal,e?.signal]);try{for(;;){this.needNext?.resolve(),this.needNext=jn();const e=await Xg(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=em([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=hp(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 Wn(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 Dm{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 kg(`No handler registered for protocol ${e}`);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 Ig(`Handler already registered for protocol ${e}`);const n=Yp.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 so("invalid topology");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=>{"NotFoundError"!==e.name&&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())null!=r.limits&&!0!==e.notifyOnLimitedConnection||!0!==e.filter?.has(n)&&(e.filter?.add(n),e.onConnect?.(n,r))}}}class Mm 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 Fm{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 Mm({name:t,metrics:r}):new Map,n}({name:"libp2p_transport_manager_listeners",metrics:this.components.metrics}),this.faultTolerance=t.faultTolerance??gp.FATAL_ALL}[Symbol.toStringTag]="@libp2p/transport-manager";add(e){const t=e[Symbol.toStringTag];if(null==t)throw new so("Transport must have a valid tag");if(this.transports.has(t))throw new so(`There is already a transport with the tag ${t}`);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 Og(`No transport available for address ${String(e)}`);return t?.onProgress?.(new Pp("transport-manager:selected-transport",r[Symbol.toStringTag])),r.dial(e,{...t,upgrader:this.components.upgrader})}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 Ao("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),i=[];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})})),i.push(t.listen(e))}if(0!==i.length){if(null==(await Promise.allSettled(i)).find((e=>"fulfilled"===e.status))&&this.faultTolerance!==gp.NO_FATAL)throw new Cg(`Transport (${r}) could not listen on any available address`)}else t.push(r)}if(t.length===this.transports.size){const e=`no valid addresses were provided for transports [${t.join(", ")}]`;if(this.faultTolerance===gp.FATAL_ALL)throw new Cg(e);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 Bm=4194304;class Um extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class qm extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class $m extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class jm extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}function zm(e){return null!=e[Symbol.asyncIterator]}function Km(e,t){if(e.byteLength>t)throw new qm("Message length too long")}const Hm=e=>{const t=k(e),r=g(t);return C(e,r),Hm.bytes=t,r};function Vm(e,t){const r=(t=t??{}).lengthEncoder??Hm,n=t?.maxDataLength??Bm;function*s(e){Km(e,n);const t=r(e.byteLength);t instanceof Uint8Array?yield t:yield*t,e instanceof Uint8Array?yield e:yield*e}return zm(e)?async function*(){for await(const t of e)yield*s(t)}():function*(){for(const t of e)yield*s(t)}()}var Gm;Hm.bytes=0,Vm.single=(e,t)=>{const r=(t=t??{}).lengthEncoder??Hm;return Km(e,t?.maxDataLength??Bm),new Ln(r(e.byteLength),e)},function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}(Gm||(Gm={}));const Wm=e=>{const t=T(e);return Wm.bytes=k(t),t};function Xm(e,t){const r=new Ln;let n=Gm.LENGTH,s=-1;const i=t?.lengthDecoder??Wm,o=t?.maxLengthLength??8,a=t?.maxDataLength??Bm;function*c(){for(;r.byteLength>0;){if(n===Gm.LENGTH)try{if(s=i(r),s<0)throw new Um("Invalid message length");if(s>a)throw new qm("Message length too long");const e=i.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=Gm.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>o)throw new $m("Message length length too long");break}throw e}if(n===Gm.DATA){if(r.byteLength0)throw new jm("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new jm("Unexpected end of input")}()}Wm.bytes=0,Xm.fromReader=(e,t)=>{let r=1;return Xm(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 Jm{readNext;haveNext;ended;nextResult;error;constructor(){this.ended=!1,this.readNext=jn(),this.haveNext=jn()}[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=jn(),e}async throw(e){return this.ended=!0,this.error=e,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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 this.error??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=jn(),await Wn(this.readNext.promise,t?.signal,t)}}class Zm extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class Qm extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Ym extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class ey extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function ty(e,t={}){const r=function(e,t){const r=new Jm;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 Ln;return{read:async e=>{if(e?.signal?.throwIfAborted(),null==e?.bytes){const{done:t,value:r}=await Wn(n.next(),e?.signal);return!0===t?null:r}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}}}(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=k(t.maxDataLength));const n=t?.lengthDecoder??T,s=t?.lengthEncoder??C;return{read:async e=>{let s=-1;const i=new Ln;for(;;){i.append(await r.read({...e,bytes:1}));try{s=n(i)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new Qm("Invalid message length");if(null!=t?.maxLengthLength&&i.byteLength>t.maxLengthLength)throw new ey("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new Ym("message length too long");return r.read({...e,bytes:s})},write:async(e,t)=>{await r.write(new Ln(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Ln(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}const ry="/multistream/1.0.0",ny=1024,sy=It("\n");async function iy(e,t,r){await e.write(t,r)}async function oy(e,t){const r=await async function(e,t){const r=await e.read(t);if(0===r.byteLength||r.get(r.byteLength-1)!==sy[0])throw t.log.error("Invalid mss message - missing newline",r),new vo("Missing newline");return r.sublist(0,-1)}(e,t);return Yr(r.subarray())}async function ay(e,t,r){t=Array.isArray(t)?t:[t],r.log.trace("handle: available protocols %s",t);const n=ty(e,{...r,maxDataLength:ny,maxLengthLength:2});for(;;){r.log.trace("handle: reading incoming string");const e=await oy(n,r);if(r.log.trace('handle: read "%s"',e),e!==ry){if(t.includes(e))return r.log.trace('handle: respond with "%s" for "%s"',e,e),await iy(n,It(`${e}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',e,e),{stream:n.unwrap(),protocol:e};if("ls"!==e)r.log.trace('handle: respond with "na" for "%s"',e),await iy(n,It("na\n"),r),r.log('handle: responded with "na" for "%s"',e);else{const s=new Ln(...t.map((e=>Vm.single(It(`${e}\n`)))),It("\n"));r.log.trace('handle: respond with "%s" for %s',t,e),await iy(n,s,r),r.log.trace('handle: responded with "%s" for %s',t,e)}}else r.log.trace('handle: respond with "%s" for "%s"',ry,e),await iy(n,It(`${ry}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',ry,e)}}async function cy(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 i=!1,o=!1;const a=jn();let c=!1,l=!1;const u=jn();let h=!1,d=!1;const p=jn(),f=ty({sink:n,source:s},{...r,maxDataLength:ny});async function g(){if(o)return r.log.trace("optimistic: already negotiating %s stream",t),void await a.promise;o=!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',ry,t),await f.writeV([It(`${ry}\n`),It(`${t}\n`)]),r.log.trace('optimistic: wrote ["%s", "%s", data] in source',ry,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 oy(f,r);if(r.log.trace('optimistic: read multistream select header "%s"',e),e===ry&&(e=await oy(f,r)),r.log.trace('optimistic: read protocol "%s", expecting "%s"',e,t),e!==t)throw new bo("protocol selection failed")}finally{h=!0,d=!1,p.resolve()}}}())}finally{o=!1,i=!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',ry,t,s.byteLength);const e=`${t}\n`;yield new Ln(Uint8Array.from([19]),It(`${ry}\n`),C(e.length),It(e),s).subarray(),r.log.trace('optimistic: wrote ["%s", "%s", data(%d)] in sink',ry,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=>{i||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=>{i||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 Wn(Promise.all(r),e?.signal):(i=!0,o=!1,a.resolve()),await t(e)}}return{stream:e,protocol:t}}(e,t[0],r);const n=ty(e,{...r,maxDataLength:ny}),s=t.shift();if(null==s)throw new Error("At least one protocol must be specified");r.log.trace('select: write ["%s", "%s"]',ry,s);const i=It(`${ry}\n`),o=It(`${s}\n`);await async function(e,t,r){await e.writeV(t,r)}(n,[i,o],r),r.log.trace("select: reading multistream-select header");let a=await oy(n,r);if(r.log.trace('select: read "%s"',a),a===ry&&(r.log.trace("select: reading protocol response"),a=await oy(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 iy(n,It(`${e}\n`),r),r.log.trace("select: reading protocol response");const t=await oy(n,r);if(r.log.trace('select: read "%s" for "%s"',t,e),t===e)return{stream:n.unwrap(),protocol:e}}throw new bo("protocol selection failed")}const ly=Symbol.for("@libp2p/connection");class uy{id;remoteAddr;remotePeer;direction;timeline;multiplexer;encryption;status;limits;log;tags;_newStream;_close;_abort;_getStreams;constructor(e){const{remoteAddr:t,remotePeer:r,newStream:n,close:s,abort:i,getStreams:o}=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.limits=e.limits,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=i,this._getStreams=o,this.tags=[]}[Symbol.toStringTag]="Connection";[ly]=!0;get streams(){return this._getStreams()}async newStream(e,t){if("closing"===this.status)throw new ao("the connection is being closed");if("closed"===this.status)throw new co("the connection is closed");if(Array.isArray(e)||(e=[e]),null!=this.limits&&!0!==t?.runOnLimitedConnection)throw new ko("Cannot open protocol stream on limited 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 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){"closed"!==this.status&&(this.log.error("aborting connection to %a due to error",this.remoteAddr,e),this.status="closing",this._abort(e),this.status="closed",this.timeline.close=Date.now())}}function hy(e,t,r){let n=0;return r.streams.forEach((r=>{r.direction===t&&r.protocol===e&&n++})),n}class dy{components;connectionEncrypters;streamMuxers;inboundUpgradeTimeout;outboundUpgradeTimeout;inboundStreamProtocolNegotiationTimeout;outboundStreamProtocolNegotiationTimeout;events;metrics;constructor(e,t){this.components=e,this.connectionEncrypters=new Map,t.connectionEncrypters.forEach((e=>{this.connectionEncrypters.set(e.protocol,e)})),this.streamMuxers=new Map,t.streamMuxers.forEach((e=>{this.streamMuxers.set(e.protocol,e)})),this.inboundUpgradeTimeout=t.inboundUpgradeTimeout??3e3,this.outboundUpgradeTimeout=t.outboundUpgradeTimeout??3e3,this.inboundStreamProtocolNegotiationTimeout=t.inboundStreamProtocolNegotiationTimeout??2e3,this.outboundStreamProtocolNegotiationTimeout=t.outboundStreamProtocolNegotiationTimeout??2e3,this.events=e.events,this.metrics={dials:e.metrics?.registerCounterGroup("libp2p_connection_manager_dials_total"),errors:e.metrics?.registerCounterGroup("libp2p_connection_manager_dial_errors_total")}}[Symbol.toStringTag]="@libp2p/upgrader";async shouldBlockConnection(e,...t){const r=this.components.connectionGater[e];if(null!=r&&!0===await r.apply(this.components.connectionGater,t))throw new Tg(`The multiaddr connection is blocked by gater.${e}`)}async upgradeInbound(e,t={}){try{if(this.metrics.dials?.increment({inbound:!0}),!await this.components.connectionManager.acceptIncomingConnection(e))throw new Pg("connection denied");return await this.shouldBlockConnection("denyInboundConnection",e),await this._performUpgrade(e,"inbound",t)}catch(e){throw this.metrics.errors?.increment({inbound:!0}),e}finally{this.components.connectionManager.afterUpgradeInbound()}}async upgradeOutbound(e,t={}){try{this.metrics.dials?.increment({outbound:!0});const r=e.remoteAddr.getPeerId();let n;return null!=r&&(n=_l(r),await this.shouldBlockConnection("denyOutboundConnection",n,e)),await this._performUpgrade(e,"outbound",t)}catch(e){throw this.metrics.errors?.increment({outbound:!0}),e}}async _performUpgrade(e,t,r){let n,s,i,o,a;const c=em([AbortSignal.timeout("inbound"===t?this.inboundUpgradeTimeout:this.outboundUpgradeTimeout),r.signal]);r.signal=c,this.components.metrics?.trackMultiaddrConnection(e),e.log.trace("starting the %s connection upgrade",t);let l=e;if(!0!==r?.skipProtection){const n=this.components.connectionProtector;null!=n&&(e.log("protecting the %s connection",t),l=await n.protect(e,r))}try{if(n=l,!0!==r?.skipEncryption){r?.onProgress?.(new Pp(`upgrader:encrypt-${t}-connection`)),({conn:n,remotePeer:s,protocol:a}=await("inbound"===t?this._encryptInbound(l,{...r,signal:c}):this._encryptOutbound(l,{...r,signal:c})));const e={...l,...n};await this.shouldBlockConnection("inbound"===t?"denyInboundEncryptedConnection":"denyOutboundEncryptedConnection",s,e)}else{const r=e.remoteAddr.getPeerId();if(null==r)throw new mo(`${t} connection that skipped encryption must have a peer id`);const n=_l(r);a="native",s=n}if(s.equals(this.components.peerId)){const t=new go("Can not dial self");throw e.abort(t),t}if(i=n,null!=r?.muxerFactory)o=r.muxerFactory;else if(this.streamMuxers.size>0){r?.onProgress?.(new Pp(`upgrader:multiplex-${t}-connection`));const e=await("inbound"===t?this._multiplexInbound({...l,...n},this.streamMuxers,r):this._multiplexOutbound({...l,...n},this.streamMuxers,r));o=e.muxerFactory,i=e.stream}}catch(r){throw e.log.error("failed to upgrade inbound connection %s %a - %e","inbound"===t?"from":"to",e.remoteAddr,r),r}finally{c.clear()}return await this.shouldBlockConnection("inbound"===t?"denyInboundUpgradedConnection":"denyOutboundUpgradedConnection",s,e),e.log("successfully upgraded %s connection",t),this._createConnection({cryptoProtocol:a,direction:t,maConn:e,upgradedConn:i,muxerFactory:o,remotePeer:s,limits:r?.limits})}_createConnection(e){const{cryptoProtocol:t,direction:r,maConn:n,upgradedConn:s,remotePeer:i,muxerFactory:o,limits:a}=e;let c,l,u;null!=o&&(c=o.createStreamMuxer({direction:r,onIncomingStream:e=>{null!=u&&Promise.resolve().then((async()=>{const t=this.components.registrar.getProtocols(),r=AbortSignal.timeout(this.inboundStreamProtocolNegotiationTimeout),{stream:n,protocol:s}=await ay(e,t,{signal:r,log:e.log,yieldBytes:!1});if(null==u)return;u.log("incoming stream opened on %s",s);const o=function(e,t){try{const{options:r}=t.getHandler(e);return r.maxInboundStreams}catch(e){if("UnhandledProtocolError"!==e.name)throw e}return 32}(s,this.components.registrar);if(hy(s,"inbound",u)===o){const t=new Io(`Too many inbound protocol streams for protocol "${s}" - limit ${o}`);throw e.abort(t),t}e.source=n.source,e.sink=n.sink,e.protocol=s,null!=n.closeWrite&&(e.closeWrite=n.closeWrite),null!=n.closeRead&&(e.closeRead=n.closeRead),null!=n.close&&(e.close=n.close),await this.components.peerStore.merge(i,{protocols:[s]}),this.components.metrics?.trackProtocolStream(e,u),this._onStream({connection:u,stream:e,protocol:s})})).catch((async t=>{u.log.error("error handling incoming stream id %s - %e",e.id,t),null==e.timeline.close&&await e.close()}))}}),l=async(t,n={})=>{if(null==c)throw new Lg("Connection is not multiplexed");u.log.trace("starting new stream for protocols %s",t);const s=await c.newStream();u.log.trace("started new stream %s for protocols %s",s.id,t);try{if(null==n.signal){s.log("no abort signal was passed while trying to negotiate protocols %s falling back to default timeout",t);const e=AbortSignal.timeout(this.outboundStreamProtocolNegotiationTimeout);n={...n,signal:e}}s.log.trace("selecting protocol from protocols %s",t);const{stream:e,protocol:r}=await cy(s,t,{...n,log:s.log,yieldBytes:!0});s.log.trace("selected protocol %s",r);const o=function(e,t,r={}){try{const{options:r}=t.getHandler(e);if(null!=r.maxOutboundStreams)return r.maxOutboundStreams}catch(e){if("UnhandledProtocolError"!==e.name)throw e}return r.maxOutboundStreams??64}(r,this.components.registrar,n),a=hy(r,"outbound",u);if(a>=o){const e=new _o(`Too many outbound protocol streams for protocol "${r}" - ${a}/${o}`);throw s.abort(e),e}return await this.components.peerStore.merge(i,{protocols:[r]}),s.source=e.source,s.sink=e.sink,s.protocol=r,null!=e.closeWrite&&(s.closeWrite=e.closeWrite),null!=e.closeRead&&(s.closeRead=e.closeRead),null!=e.close&&(s.close=e.close),this.components.metrics?.trackProtocolStream(s,u),s}catch(n){throw u.log.error("could not create new outbound stream on connection %s %a for protocols %s - %e","inbound"===r?"from":"to",e.maConn.remoteAddr,t,n),null==s.timeline.close&&s.abort(n),n}},Promise.all([c.sink(s.source),s.sink(c.source)]).catch((e=>{u.log.error("error piping data through muxer - %e",e)})));const h=n.timeline;var d;return n.timeline=new Proxy(h,{set:(...e)=>("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",e)}finally{this.events.safeDispatchEvent("connection:close",{detail:u})}})().catch((e=>{u.log.error("error thrown while dispatching connection:close event %e",e)})),Reflect.set(...e))}),n.timeline.upgraded=Date.now(),d={remoteAddr:n.remoteAddr,remotePeer:i,status:"open",direction:r,timeline:n.timeline,multiplexer:c?.protocol,encryption:t,limits:a,logger:this.components.logger,newStream:l??(()=>{throw new Lg("Connection is not multiplexed")}),getStreams:()=>c?.streams??[],close:async e=>{await(c?.close(e)),await n.close(e)},abort:e=>{n.abort(e),c?.abort(e)}},u=new uy(d),this.events.safeDispatchEvent("connection:open",{detail:u}),u.__maConnTimeline=h,u}_onStream(e){const{connection:t,stream:r,protocol:n}=e,{handler:s,options:i}=this.components.registrar.getHandler(n);if(null!=t.limits&&!0!==i.runOnLimitedConnection)throw new ko("Cannot open protocol stream on limited connection");s({connection:t,stream:r})}async _encryptInbound(e,t){const r=Array.from(this.connectionEncrypters.keys());try{const{stream:n,protocol:s}=await ay(e,r,{...t,log:e.log}),i=this.connectionEncrypters.get(s);if(null==i)throw new Rg(`no crypto module found for ${s}`);return e.log("encrypting inbound connection to %a using %s",e.remoteAddr,s),{...await i.secureInbound(n,t),protocol:s}}catch(t){throw e.log.error("encrypting inbound connection from %a failed",e.remoteAddr,t),new Rg(t.message)}}async _encryptOutbound(e,t){const r=Array.from(this.connectionEncrypters.keys());try{e.log.trace("selecting encrypter from %s",r);const{stream:n,protocol:s}=await cy(e,r,{...t,log:e.log,yieldBytes:!0}),i=this.connectionEncrypters.get(s);if(null==i)throw new Rg(`no crypto module found for ${s}`);return e.log("encrypting outbound connection to %a using %s",e.remoteAddr,s),{...await i.secureOutbound(n,t),protocol:s}}catch(t){throw e.log.error("encrypting outbound connection to %a failed",e.remoteAddr,t),new Rg(t.message)}}async _multiplexOutbound(e,t,r){const n=Array.from(t.keys());e.log("outbound selecting muxer %s",n);try{e.log.trace("selecting stream muxer from %s",n);const{stream:s,protocol:i}=await cy(e,n,{...r,log:e.log,yieldBytes:!0});return e.log("selected %s as muxer protocol",i),{stream:s,muxerFactory:t.get(i)}}catch(t){throw e.log.error("error multiplexing outbound connection",t),new Lg(String(t))}}async _multiplexInbound(e,t,r){const n=Array.from(t.keys());e.log("inbound handling muxers %s",n);try{const{stream:s,protocol:i}=await ay(e,n,{...r,log:e.log});return{stream:s,muxerFactory:t.get(i)}}catch(t){throw e.log.error("error multiplexing inbound connection",t),new Lg(String(t))}}}class py extends Ls{peerId;peerStore;contentRouting;peerRouting;metrics;services;logger;status;components;log;constructor(e){super(),this.status="stopped";const t=new Ls,r=t.dispatchEvent.bind(t);t.dispatchEvent=e=>{const t=r(e),n=this.dispatchEvent(new CustomEvent(e.type,{detail:e.detail}));return t||n},this.peerId=e.peerId,this.logger=e.logger??mf(),this.log=this.logger.forComponent("libp2p"),this.services={};const n=this.components=function(e={}){const t=new Ng(e);return new Proxy(t,{get(e,r,n){if("string"==typeof r&&!Mg.includes(r)){const e=t.components[r];if(null==e&&!Dg.includes(r))throw new vg(`${r} not set`);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:"2.1.8"},logger:this.logger,events:t,datastore:e.datastore??new fg,connectionGater:qg(e.connectionGater),dns:e.dns});this.peerStore=this.configureComponent("peerStore",function(e,t={}){return new ag(e,t)}(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 dy(this.components,{connectionEncrypters:(e.connectionEncrypters??[]).map(((e,t)=>this.configureComponent(`connection-encryption-${t}`,e(this.components)))),streamMuxers:(e.streamMuxers??[]).map(((e,t)=>this.configureComponent(`stream-muxers-${t}`,e(this.components)))),inboundUpgradeTimeout:e.connectionManager?.inboundUpgradeTimeout,outboundUpgradeTimeout:e.connectionManager?.outboundUpgradeTimeout}),this.configureComponent("transportManager",new Fm(this.components,e.transportManager)),this.configureComponent("connectionManager",new mm(this.components,e.connectionManager)),!1!==e.connectionMonitor?.enabled&&this.configureComponent("connectionMonitor",new bm(this.components,e.connectionMonitor)),this.configureComponent("registrar",new Dm(this.components)),this.configureComponent("addressManager",new yg(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 Om(this.components,{routers:s}));const i=(e.contentRouters??[]).map(((e,t)=>this.configureComponent(`content-router-${t}`,e(this.components))));if(this.contentRouting=this.components.contentRouting=this.configureComponent("contentRouting",new vm(this.components,{routers:i})),this.configureComponent("randomWalk",new Nm(this.components)),(e.peerDiscovery??[]).forEach(((e,t)=>{this.configureComponent(`peer-discovery-${t}`,e(this.components)).addEventListener("peer",(e=>{this.#D(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[rf]&&(this.log("registering service %s for content routing",t),i.push(r[rf])),null!=r[nf]&&(this.log("registering service %s for peer routing",t),s.push(r[nf])),null!=r[Hu]&&(this.log("registering service %s for peer discovery",t),r[Hu].addEventListener?.("peer",(e=>{this.#D(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 Fg(r))t[e]=!0;for(const r of Object.values(e.components))for(const e of Bg(r))if(!0!==t[e])throw new Eg(`Service "${Ug(r)}" required capability "${e}" but it was not provided by any component, you may need to add additional configuration when creating your node.`)}(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 vf;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 so("no protocols were provided to open a stream");if(0===(t=Array.isArray(t)?t:[t]).length)throw new so("no protocols were provided to open a 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={}){wi(e)&&(e=_l(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("NotFoundError"!==e.name)throw e}const r=In([It("/pk/"),e.toMultihash().bytes]),n=yl(await this.contentRouting.get(r,t));return 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)}#D(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("peer discovery mechanism discovered self")}}function fy(){try{return!1}catch(e){return!1}}const gy="bootstrap",my={store:1,filter:2,lightPush:2};var yy=__webpack_require__(495),wy=__webpack_require__.t(yy,2);const by=BigInt(0),vy=BigInt(1),Ey=BigInt(2),Sy=BigInt(3),Ay=BigInt(8),xy=Object.freeze({a:by,b:BigInt(7),P:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:vy,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee")}),ky=(e,t)=>(e+t/Ey)/t,Iy={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar(e){const{n:t}=xy,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-vy*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=r,o=BigInt("0x100000000000000000000000000000000"),a=ky(i*e,t),c=ky(-n*e,t);let l=ew(e-a*r-c*s,t),u=ew(-a*n-c*i,t);const h=l>o,d=u>o;if(h&&(l=t-l),d&&(u=t-u),l>o||u>o)throw new Error("splitScalarEndo: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}};function _y(e){const{a:t,b:r}=xy,n=ew(e*e),s=ew(n*e);return ew(s+t*e+r)}const Cy=xy.a===by;class Ty extends Error{constructor(e){super(e)}}function Py(e){if(!(e instanceof Ly))throw new TypeError("JacobianPoint expected")}class Ly{constructor(e,t,r){this.x=e,this.y=t,this.z=r}static fromAffine(e){if(!(e instanceof Ny))throw new TypeError("JacobianPoint#fromAffine: expected Point");return e.equals(Ny.ZERO)?Ly.ZERO:new Ly(e.x,e.y,vy)}static toAffineBatch(e){const t=function(e,t=xy.P){const r=new Array(e.length),n=rw(e.reduce(((e,n,s)=>n===by?e:(r[s]=e,ew(e*n,t))),vy),t);return e.reduceRight(((e,n,s)=>n===by?e:(r[s]=ew(e*r[s],t),ew(e*n,t))),n),r}(e.map((e=>e.z)));return e.map(((e,r)=>e.toAffine(t[r])))}static normalizeZ(e){return Ly.toAffineBatch(e).map(Ly.fromAffine)}equals(e){Py(e);const{x:t,y:r,z:n}=this,{x:s,y:i,z:o}=e,a=ew(n*n),c=ew(o*o),l=ew(t*c),u=ew(s*a),h=ew(ew(r*o)*c),d=ew(ew(i*n)*a);return l===u&&h===d}negate(){return new Ly(this.x,ew(-this.y),this.z)}double(){const{x:e,y:t,z:r}=this,n=ew(e*e),s=ew(t*t),i=ew(s*s),o=e+s,a=ew(Ey*(ew(o*o)-n-i)),c=ew(Sy*n),l=ew(c*c),u=ew(l-Ey*a),h=ew(c*(a-u)-Ay*i),d=ew(Ey*t*r);return new Ly(u,h,d)}add(e){Py(e);const{x:t,y:r,z:n}=this,{x:s,y:i,z:o}=e;if(s===by||i===by)return this;if(t===by||r===by)return e;const a=ew(n*n),c=ew(o*o),l=ew(t*c),u=ew(s*a),h=ew(ew(r*o)*c),d=ew(ew(i*n)*a),p=ew(u-l),f=ew(d-h);if(p===by)return f===by?this.double():Ly.ZERO;const g=ew(p*p),m=ew(p*g),y=ew(l*g),w=ew(f*f-m-Ey*y),b=ew(f*(y-w)-h*m),v=ew(n*o*p);return new Ly(w,b,v)}subtract(e){return this.add(e.negate())}multiplyUnsafe(e){const t=Ly.ZERO;if("bigint"==typeof e&&e===by)return t;let r=Yy(e);if(r===vy)return this;if(!Cy){let e=t,n=this;for(;r>by;)r&vy&&(e=e.add(n)),n=n.double(),r>>=vy;return e}let{k1neg:n,k1:s,k2neg:i,k2:o}=Iy.splitScalar(r),a=t,c=t,l=this;for(;s>by||o>by;)s&vy&&(a=a.add(l)),o&vy&&(c=c.add(l)),l=l.double(),s>>=vy,o>>=vy;return n&&(a=a.negate()),i&&(c=c.negate()),c=new Ly(ew(c.x*Iy.beta),c.y,c.z),a.add(c)}precomputeWindow(e){const t=Cy?128/e+1:256/e+1,r=[];let n=this,s=n;for(let i=0;i>=u,o>a&&(o-=l,e+=vy);const h=r,d=r+Math.abs(o)-1,p=t%2!=0,f=o<0;0===o?i=i.add(Ry(p,n[h])):s=s.add(Ry(f,n[d]))}return{p:s,f:i}}multiply(e,t){let r,n,s=Yy(e);if(Cy){const{k1neg:e,k1:i,k2neg:o,k2:a}=Iy.splitScalar(s);let{p:c,f:l}=this.wNAF(i,t),{p:u,f:h}=this.wNAF(a,t);c=Ry(e,c),u=Ry(o,u),u=new Ly(ew(u.x*Iy.beta),u.y,u.z),r=c.add(u),n=l.add(h)}else{const{p:e,f:i}=this.wNAF(s,t);r=e,n=i}return Ly.normalizeZ([r,n])[0]}toAffine(e){const{x:t,y:r,z:n}=this,s=this.equals(Ly.ZERO);null==e&&(e=s?Ay:rw(n));const i=e,o=ew(i*i),a=ew(o*i),c=ew(t*o),l=ew(r*a),u=ew(n*i);if(s)return Ny.ZERO;if(u!==vy)throw new Error("invZ was invalid");return new Ny(c,l)}}function Ry(e,t){const r=t.negate();return e?r:t}Ly.BASE=new Ly(xy.Gx,xy.Gy,vy),Ly.ZERO=new Ly(by,vy,by);const Oy=new WeakMap;class Ny{constructor(e,t){this.x=e,this.y=t}_setWindowSize(e){this._WINDOW_SIZE=e,Oy.delete(this)}hasEvenY(){return this.y%Ey===by}static fromCompressedHex(e){const t=32===e.length,r=Zy(t?e:e.subarray(1));if(!cw(r))throw new Error("Point is not on curve");let n=function(e){const{P:t}=xy,r=BigInt(6),n=BigInt(11),s=BigInt(22),i=BigInt(23),o=BigInt(44),a=BigInt(88),c=e*e*e%t,l=c*c*e%t,u=tw(l,Sy)*l%t,h=tw(u,Sy)*l%t,d=tw(h,Ey)*c%t,p=tw(d,n)*d%t,f=tw(p,s)*p%t,g=tw(f,o)*f%t,m=tw(g,a)*g%t,y=tw(m,o)*f%t,w=tw(y,Sy)*l%t,b=tw(w,i)*p%t,v=tw(b,r)*c%t,E=tw(v,Ey);if(E*E%t!==e)throw new Error("Cannot find square root");return E}(_y(r));const s=(n&vy)===vy;t?s&&(n=ew(-n)):!(1&~e[0])!==s&&(n=ew(-n));const i=new Ny(r,n);return i.assertValidity(),i}static fromUncompressedHex(e){const t=Zy(e.subarray(1,33)),r=Zy(e.subarray(33,65)),n=new Ny(t,r);return n.assertValidity(),n}static fromHex(e){const t=Qy(e),r=t.length,n=t[0];if(32===r)return this.fromCompressedHex(t);if(33===r&&(2===n||3===n))return this.fromCompressedHex(t);if(65===r&&4===n)return this.fromUncompressedHex(t);throw new Error(`Point.fromHex: received invalid point. Expected 32-33 compressed bytes or 65 uncompressed bytes, not ${r}`)}static fromPrivateKey(e){return Ny.BASE.multiply(uw(e))}static fromSignature(e,t,r){const{r:n,s}=hw(t);if(![0,1,2,3].includes(r))throw new Error("Cannot recover: invalid recovery bit");const i=nw(Qy(e)),{n:o}=xy,a=2===r||3===r?n+o:n,c=rw(a,o),l=ew(-i*c,o),u=ew(s*c,o),h=1&r?"03":"02",d=Ny.fromHex(h+Gy(a)),p=Ny.BASE.multiplyAndAddUnsafe(d,l,u);if(!p)throw new Error("Cannot recover signature: point at infinify");return p.assertValidity(),p}toRawBytes(e=!1){return Hy(this.toHex(e))}toHex(e=!1){const t=Gy(this.x);return e?`${this.hasEvenY()?"02":"03"}${t}`:`04${t}${Gy(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(!cw(t)||!cw(r))throw new Error(e);const n=ew(r*r);if(ew(n-_y(t))!==by)throw new Error(e)}equals(e){return this.x===e.x&&this.y===e.y}negate(){return new Ny(this.x,ew(-this.y))}double(){return Ly.fromAffine(this).double().toAffine()}add(e){return Ly.fromAffine(this).add(Ly.fromAffine(e)).toAffine()}subtract(e){return this.add(e.negate())}multiply(e){return Ly.fromAffine(this).multiply(e,this).toAffine()}multiplyAndAddUnsafe(e,t,r){const n=Ly.fromAffine(this),s=t===by||t===vy||this!==Ny.BASE?n.multiplyUnsafe(t):n.multiply(t),i=Ly.fromAffine(e).multiplyUnsafe(r),o=s.add(i);return o.equals(Ly.ZERO)?void 0:o.toAffine()}}function Dy(e){return Number.parseInt(e[0],16)>=8?"00"+e:e}function My(e){if(e.length<2||2!==e[0])throw new Error(`Invalid signature integer tag: ${jy(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:Zy(r),left:e.subarray(t+2)}}Ny.BASE=new Ny(xy.Gx,xy.Gy),Ny.ZERO=new Ny(by,by);class Fy{constructor(e,t){this.r=e,this.s=t,this.assertValidity()}static fromCompact(e){const t=By(e),r="Signature.fromCompact";if("string"!=typeof e&&!t)throw new TypeError(`${r}: Expected string or Uint8Array`);const n=t?jy(e):e;if(128!==n.length)throw new Error(`${r}: Expected 64-byte hex`);return new Fy(Jy(n.slice(0,64)),Jy(n.slice(64,128)))}static fromDER(e){const t=By(e);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: ${jy(e)}`);if(e[1]!==e.length-2)throw new Error("Invalid signature: incorrect length");const{data:t,left:r}=My(e.subarray(2)),{data:n,left:s}=My(r);if(s.length)throw new Error(`Invalid signature: left bytes after parsing: ${jy(s)}`);return{r:t,s:n}}(t?e:Hy(e));return new Fy(r,n)}static fromHex(e){return this.fromDER(e)}assertValidity(){const{r:e,s:t}=this;if(!aw(e))throw new Error("Invalid Signature: r must be 0 < r < n");if(!aw(t))throw new Error("Invalid Signature: s must be 0 < s < n")}hasHighS(){const e=xy.n>>vy;return this.s>e}normalizeS(){return this.hasHighS()?new Fy(this.r,ew(-this.s,xy.n)):this}toDERRawBytes(){return Hy(this.toDERHex())}toDERHex(){const e=Dy(Xy(this.s)),t=Dy(Xy(this.r)),r=e.length/2,n=t.length/2,s=Xy(r),i=Xy(n);return`30${Xy(n+r+4)}02${i}${t}02${s}${e}`}toRawBytes(){return this.toDERRawBytes()}toHex(){return this.toDERHex()}toCompactRawBytes(){return Hy(this.toCompactHex())}toCompactHex(){return Gy(this.r)+Gy(this.s)}}function By(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&"Uint8Array"===e.constructor.name}function Uy(e){if(!By(e))throw new Error("Uint8Array expected")}function qy(...e){if(e.every(Uy),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 jy(e){Uy(e);let t="";for(let r=0;r=zy._0&&e<=zy._9?e-zy._0:e>=zy.A&&e<=zy.F?e-(zy.A-10):e>=zy.a&&e<=zy.f?e-(zy.a-10):void 0}function Hy(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("hex string expected, got unpadded hex of length "+t);const n=new Uint8Array(r);for(let t=0,s=0;t0)return BigInt(e);if("bigint"==typeof e&&aw(e))return e;throw new TypeError("Expected valid private scalar: 0 < scalar < curve.n")}function ew(e,t=xy.P){const r=e%t;return r>=by?r:t+r}function tw(e,t){const{P:r}=xy;let n=e;for(;t-- >by;)n*=n,n%=r;return n}function rw(e,t=xy.P){if(e===by||t<=by)throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);let r=ew(e,t),n=t,s=by,i=vy,o=vy,a=by;for(;r!==by;){const e=n/r,t=n%r,c=s-o*e,l=i-a*e;n=r,r=t,s=o,i=a,o=c,a=l}if(n!==vy)throw new Error("invert: does not exist");return ew(s,t)}function nw(e,t=!1){const r=function(e){const t=8*e.length-256,r=Zy(e);return t>0?r>>BigInt(t):r}(e);if(t)return r;const{n}=xy;return r>=n?r-n:r}let sw,iw;class ow{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 ww.hmacSha256(this.k,...e)}hmacSync(...e){return iw(this.k,...e)}checkSync(){if("function"!=typeof iw)throw new Ty("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(64!==e.length)throw new Error("Expected 32 bytes of private key");t=Jy(e)}else{if(!By(e))throw new TypeError("Expected valid private key");if(32!==e.length)throw new Error("Expected 32 bytes of private key");t=Zy(e)}if(!aw(t))throw new Error("Expected private key: 0 < key < n");return t}function hw(e){if(e instanceof Fy)return e.assertValidity(),e;try{return Fy.fromDER(e)}catch(t){return Fy.fromCompact(e)}}function dw(e){return Zy(e.length>32?e.slice(0,32):e)}function pw(e){const t=dw(e),r=ew(t,xy.n);return fw(r{if((e=Qy(e)).length<40||e.length>1024)throw new Error("Expected valid bytes of private key as per FIPS 186");return Wy(ew(Zy(e),xy.n-vy)+vy)},randomBytes:(e=32)=>{if(mw.web)return mw.web.getRandomValues(new Uint8Array(e));if(mw.node){const{randomBytes:t}=mw.node;return Uint8Array.from(t(e))}throw new Error("The environment doesn't have randomBytes function")},randomPrivateKey:()=>ww.hashToPrivateKey(ww.randomBytes(40)),precompute(e=8,t=Ny.BASE){const r=t===Ny.BASE?t:new Ny(t.x,t.y);return r._setWindowSize(e),r.multiply(Sy),r},sha256:async(...e)=>{if(mw.web){const t=await mw.web.subtle.digest("SHA-256",qy(...e));return new Uint8Array(t)}if(mw.node){const{createHash:t}=mw.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(mw.web){const r=await mw.web.subtle.importKey("raw",e,{name:"HMAC",hash:{name:"SHA-256"}},!1,["sign"]),n=qy(...t),s=await mw.web.subtle.sign("HMAC",r,n);return new Uint8Array(s)}if(mw.node){const{createHmac:r}=mw.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=yw[e];if(void 0===r){const t=await ww.sha256(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=qy(t,t),yw[e]=r}return ww.sha256(r,...t)},taggedHashSync:(e,...t)=>{if("function"!=typeof sw)throw new Ty("sha256Sync is undefined, you need to set it");let r=yw[e];if(void 0===r){const t=sw(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=qy(t,t),yw[e]=r}return sw(r,...t)},_JacobianPoint:Ly};Object.defineProperties(ww,{sha256Sync:{configurable:!1,get:()=>sw,set(e){sw||(sw=e)}},hmacSha256Sync:{configurable:!1,get:()=>iw,set(e){iw||(iw=e)}}});var bw=__webpack_require__(1176);function vw(e){return new Uint8Array(bw.keccak256.arrayBuffer(e))}function Ew(e,t,r){try{return function(e,t,r,n=gw){let s;try{s=hw(e),t=Qy(t)}catch(e){return!1}const{r:i,s:o}=s;if(n.strict&&s.hasHighS())return!1;const a=nw(t);let c;try{c=function(e){return e instanceof Ny?(e.assertValidity(),e):Ny.fromHex(e)}(r)}catch(e){return!1}const{n:l}=xy,u=rw(o,l),h=ew(a*u,l),d=ew(i*u,l),p=Ny.BASE.multiplyAndAddUnsafe(c,h,d);return!!p&&ew(p.x,l)===i}(Fy.fromCompact(e.slice(0,64)),t,r)}catch{return!1}}const Sw="Invalid record id";function Aw(e,t){switch(t){case"udp":return Aw(e,"udp4")||Aw(e,"udp6");case"tcp":return Aw(e,"tcp4")||Aw(e,"tcp6")}const r=t.endsWith("6"),n=e.get(r?"ip6":"ip");if(!n)return;const s=t.slice(0,3);let i;switch(s){case"udp":i=r?e.get("udp6"):e.get("udp");break;case"tcp":i=r?e.get("tcp6"):e.get("tcp");break;default:return}return i?function(e,t,r,n){let s=bi("/"+e+"/"+Qs(e,r));return s=s.encapsulate(bi("/"+t+"/"+Qs(t,n))),s}(r?"ip6":"ip4",s,n,i):void 0}function xw(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 kw(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 Iw 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 rn(e)}get publicKey(){if("v4"===this.id)return this.get("secp256k1");throw new Error(Sw)}get rs(){const e=this.get("rs");if(e)return pn(e)}get rsv(){const e=this.get("rsv");if(e)return pn(e)}get ip(){return _w(this,"ip","ip4")}set ip(e){Tw(this,"ip","ip4",e)}get tcp(){return Cw(this,"tcp","tcp")}set tcp(e){Pw(this,"tcp","tcp",e)}get udp(){return Cw(this,"udp","udp")}set udp(e){Pw(this,"udp","udp",e)}get ip6(){return _w(this,"ip6","ip6")}set ip6(e){Tw(this,"ip6","ip6",e)}get tcp6(){return Cw(this,"tcp6","tcp")}set tcp6(e){Pw(this,"tcp6","tcp",e)}get udp6(){return Cw(this,"udp6","udp")}set udp6(e){Pw(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){Lw(this,"waku2",e,(e=>new Uint8Array([kw(e)])))}}function _w(e,t,r){const n=e.get(t);if(n)return Qs(r,n)}function Cw(e,t,r){const n=e.get(t);if(n)return Number(Qs(r,n))}function Tw(e,t,r,n){Lw(e,t,n,Ys.bind({},r))}function Pw(e,t,r,n){Tw(e,t,r,n?.toString(10))}function Lw(e,t,r,n){void 0!==r?e.set(t,n(r)):e.delete(t)}async function Rw(e,t){return async function(e,t,r={}){const{seed:n,m:s,d:i}=function(e,t,r){if(null==e)throw new Error(`sign: expected valid message hash, not "${e}"`);const n=Qy(e),s=uw(t),i=[fw(s),pw(n)];if(null!=r){!0===r&&(r=ww.randomBytes(32));const e=Qy(r);if(32!==e.length)throw new Error("sign: Expected 32 bytes of extra data");i.push(e)}return{seed:qy(...i),m:dw(n),d:s}}(e,t,r.extraEntropy),o=new ow(32,32);let a;for(await o.reseed(n);!(a=lw(await o.generate(),s,i,r.canonical));)await o.reseed();return function(e,t){const{sig:r,recovery:n}=e,{der:s,recovered:i}=Object.assign({canonical:!0,der:!0},t),o=s?r.toDERRawBytes():r.toCompactRawBytes();return i?[o,n]:o}(a,r)}(vw(t),e,{der:!1})}const Ow=new yn("enr");var Nw,Dw;!function(e){e.TCP="tcp",e.UDP="udp"}(Nw||(Nw={})),function(e){e.TCP4="tcp4",e.UDP4="udp4",e.TCP6="tcp6",e.UDP6="udp6"}(Dw||(Dw={}));class Mw extends Iw{static RECORD_PREFIX="enr:";peerId;static create(e={},t=BigInt(1),r){const n=new Mw(e,t,r);try{const e=n.publicKey;e&&(n.peerId=function(e){const t=function(e){if(32===e.byteLength)return Oc(e);if(33===e.byteLength)return fl(e);const t=Oo(e),r=t[1]?.[0];if("1.2.840.10045.3.1.7"===r||"1.3.132.0.34"===r||"1.3.132.0.35"===r)return Xo(t);if("1.2.840.113549.1.1.1"===t[0]?.[0])return Gc(t,e);throw new so("Could not extract public key from raw bytes")}(e);if("secp256k1"!==t.type)throw new Error("Keypair type not implemented");return Cl(t)}(e))}catch(e){Ow.error("Could not calculate peer id for ENR",e)}return n}get nodeId(){if("v4"===this.id)return this.publicKey?function(e){const t=Ny.fromHex(e).toRawBytes(!1);return tn(vw(t.slice(1)))}(this.publicKey):void 0;throw new Error(Sw)}getLocationMultiaddr=Aw.bind({},this);get shardInfo(){return this.rs&&this.rsv&&Ow.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(Dw)){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(Sw);if(!this.publicKey)throw new Error("Failed to verify ENR: No public key");return Ew(t,vw(e),this.publicKey)}async sign(e,t){if("v4"!==this.id)throw new Error(Sw);return this.signature=await Rw(t,e),this.signature}}let Fw=!1,Bw=!1;const Uw={debug:1,default:2,info:2,warning:3,error:4,off:5};let qw=Uw.default,$w=null;const jw=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 zw,Kw;!function(e){e.DEBUG="DEBUG",e.INFO="INFO",e.WARNING="WARNING",e.ERROR="ERROR",e.OFF="OFF"}(zw||(zw={})),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"}(Kw||(Kw={}));const Hw="0123456789abcdef";class Vw{constructor(e){Object.defineProperty(this,"version",{enumerable:!0,value:e,writable:!1})}_log(e,t){const r=e.toLowerCase();null==Uw[r]&&this.throwArgumentError("invalid log level name","logLevel",e),qw>Uw[r]||console.log.apply(console,t)}debug(...e){this._log(Vw.levels.DEBUG,e)}info(...e){this._log(Vw.levels.INFO,e)}warn(...e){this._log(Vw.levels.WARNING,e)}makeError(e,t,r){if(Bw)return this.makeError("censored error",t,{});t||(t=Vw.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+=Hw[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 i="";switch(t){case Kw.NUMERIC_FAULT:{i="NUMERIC_FAULT";const t=e;switch(t){case"overflow":case"underflow":case"division-by-zero":i+="-"+t;break;case"negative-power":case"negative-width":i+="-unsupported";break;case"unbound-bitwise-result":i+="-unbound-result"}break}case Kw.CALL_EXCEPTION:case Kw.INSUFFICIENT_FUNDS:case Kw.MISSING_NEW:case Kw.NONCE_EXPIRED:case Kw.REPLACEMENT_UNDERPRICED:case Kw.TRANSACTION_REPLACED:case Kw.UNPREDICTABLE_GAS_LIMIT:i=t}i&&(e+=" [ See: https://links.ethers.org/v5-errors-"+i+" ]"),n.length&&(e+=" ("+n.join(", ")+")");const o=new Error(e);return o.reason=s,o.code=t,Object.keys(r).forEach((function(e){o[e]=r[e]})),o}throwError(e,t,r){throw this.makeError(e,t,r)}throwArgumentError(e,t,r){return this.throwError(e,Vw.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"),jw&&this.throwError("platform missing String.prototype.normalize",Vw.errors.UNSUPPORTED_OPERATION,{operation:"String.prototype.normalize",form:jw})}checkSafeUint53(e,t){"number"==typeof e&&(null==t&&(t="value not safe"),(e<0||e>=9007199254740991)&&this.throwError(t,Vw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"out-of-safe-range",value:e}),e%1&&this.throwError(t,Vw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"non-integer",value:e}))}checkArgumentCount(e,t,r){r=r?": "+r:"",et&&this.throwError("too many arguments"+r,Vw.errors.UNEXPECTED_ARGUMENT,{count:e,expectedCount:t})}checkNew(e,t){e!==Object&&null!=e||this.throwError("missing new",Vw.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",Vw.errors.UNSUPPORTED_OPERATION,{name:e.name,operation:"new"}):e!==Object&&null!=e||this.throwError("missing new",Vw.errors.MISSING_NEW,{name:t.name})}static globalLogger(){return $w||($w=new Vw("logger/5.8.0")),$w}static setCensorship(e,t){if(!e&&t&&this.globalLogger().throwError("cannot permanently disable censorship",Vw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"}),Fw){if(!e)return;this.globalLogger().throwError("error censorship permanent",Vw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"})}Bw=!!e,Fw=!!t}static setLogLevel(e){const t=Uw[e.toLowerCase()];null!=t?qw=t:Vw.globalLogger().warn("invalid log level - "+e)}static from(e){return new Vw(e)}}Vw.errors=Kw,Vw.levels=zw;const Gw=new Vw("bytes/5.8.0");function Ww(e){return!!e.toHexString}function Xw(e){return e.slice||(e.slice=function(){const t=Array.prototype.slice.call(arguments);return Xw(new Uint8Array(Array.prototype.slice.apply(e,t)))}),e}function Jw(e){return"number"==typeof e&&e==e&&e%1==0}function Zw(e){if(null==e)return!1;if(e.constructor===Uint8Array)return!0;if("string"==typeof e)return!1;if(!Jw(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){Gw.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),Xw(new Uint8Array(t))}if(t.allowMissingPrefix&&"string"==typeof e&&"0x"!==e.substring(0,2)&&(e="0x"+e),Ww(e)&&(e=e.toHexString()),Yw(e)){let r=e.substring(2);r.length%2&&("left"===t.hexPad?r="0"+r:"right"===t.hexPad?r+="0":Gw.throwArgumentError("hex data is odd-length","value",e));const n=[];for(let e=0;e>4]+eb[15&n]}return t}return Gw.throwArgumentError("invalid hexlify value","value",e)}const rb=new Vw("rlp/5.8.0");function nb(e){const t=[];for(;e;)t.unshift(255&e),e>>=8;return t}function sb(e,t,r){let n=0;for(let s=0;st+1+n&&rb.throwError("child data too short",Vw.errors.BUFFER_OVERRUN,{})}return{consumed:1+n,result:s}}function ab(e,t){if(0===e.length&&rb.throwError("data too short",Vw.errors.BUFFER_OVERRUN,{}),e[t]>=248){const r=e[t]-247;t+1+r>e.length&&rb.throwError("data short segment too short",Vw.errors.BUFFER_OVERRUN,{});const n=sb(e,t+1,r);return t+1+r+n>e.length&&rb.throwError("data long segment too short",Vw.errors.BUFFER_OVERRUN,{}),ob(e,t,t+1+r,r+n)}if(e[t]>=192){const r=e[t]-192;return t+1+r>e.length&&rb.throwError("data array too short",Vw.errors.BUFFER_OVERRUN,{}),ob(e,t,t+1,r)}if(e[t]>=184){const r=e[t]-183;t+1+r>e.length&&rb.throwError("data array too short",Vw.errors.BUFFER_OVERRUN,{});const n=sb(e,t+1,r);return t+1+r+n>e.length&&rb.throwError("data array too short",Vw.errors.BUFFER_OVERRUN,{}),{consumed:1+r+n,result:tb(e.slice(t+1+r,t+1+r+n))}}if(e[t]>=128){const r=e[t]-128;return t+1+r>e.length&&rb.throwError("data too short",Vw.errors.BUFFER_OVERRUN,{}),{consumed:1+r,result:tb(e.slice(t+1,t+1+r))}}return{consumed:1,result:tb(e[t])}}const cb=new yn("enr:decoder");class lb{static fromString(e){if(!e.startsWith(Mw.RECORD_PREFIX))throw new Error(`"string encoded ENR must start with '${Mw.RECORD_PREFIX}'`);return lb.fromRLP(It(e.slice(4),"base64url"))}static fromRLP(e){const t=function(e){const t=Qw(e),r=ab(t,0);return r.consumed!==t.length&&rb.throwArgumentError("invalid rlp data","data",e),r.result}(e).map(en);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;e0))throw new TypeError("`maxSize` must be a number greater than 0");if("number"==typeof e.maxAge&&0===e.maxAge)throw new TypeError("`maxAge` must be a number greater than 0");this.#U=e.maxSize,this.#q=e.maxAge||Number.POSITIVE_INFINITY,this.#$=e.onEviction}get __oldCache(){return this.#B}#j(e){if("function"==typeof this.#$)for(const[t,r]of e)this.#$(t,r.value)}#z(e,t){return"number"==typeof t.expiry&&t.expiry<=Date.now()&&("function"==typeof this.#$&&this.#$(e,t.value),this.delete(e))}#K(e,t){if(!1===this.#z(e,t))return t.value}#H(e,t){return t.expiry?this.#K(e,t):t.value}#V(e,t){const r=t.get(e);return this.#H(e,r)}#G(e,t){this.#F.set(e,t),this.#M++,this.#M>=this.#U&&(this.#M=0,this.#j(this.#B),this.#B=this.#F,this.#F=new Map)}#W(e,t){this.#B.delete(e),this.#G(e,t)}*#X(){for(const e of this.#B){const[t,r]=e;this.#F.has(t)||!1===this.#z(t,r)&&(yield e)}for(const e of this.#F){const[t,r]=e;!1===this.#z(t,r)&&(yield e)}}get(e){if(this.#F.has(e)){const t=this.#F.get(e);return this.#H(e,t)}if(this.#B.has(e)){const t=this.#B.get(e);if(!1===this.#z(e,t))return this.#W(e,t),t.value}}set(e,t,{maxAge:r=this.#q}={}){const n="number"==typeof r&&r!==Number.POSITIVE_INFINITY?Date.now()+r:void 0;return this.#F.has(e)?this.#F.set(e,{value:t,expiry:n}):this.#G(e,{value:t,expiry:n}),this}has(e){return this.#F.has(e)?!this.#z(e,this.#F.get(e)):!!this.#B.has(e)&&!this.#z(e,this.#B.get(e))}peek(e){return this.#F.has(e)?this.#V(e,this.#F):this.#B.has(e)?this.#V(e,this.#B):void 0}delete(e){const t=this.#F.delete(e);return t&&this.#M--,this.#B.delete(e)||t}clear(){this.#F.clear(),this.#B.clear(),this.#M=0}resize(e){if(!(e&&e>0))throw new TypeError("`maxSize` must be a number greater than 0");const t=[...this.#X()],r=t.length-e;r<0?(this.#F=new Map(t),this.#B=new Map,this.#M=t.length):(r>0&&this.#j(t.slice(0,r)),this.#B=new Map(t.slice(r)),this.#F=new Map,this.#M=0),this.#U=e}*keys(){for(const[e]of this)yield e}*values(){for(const[,e]of this)yield e}*[Symbol.iterator](){for(const e of this.#F){const[t,r]=e;!1===this.#z(t,r)&&(yield[t,r.value])}for(const e of this.#B){const[t,r]=e;this.#F.has(t)||!1===this.#z(t,r)&&(yield[t,r.value])}}*entriesDescending(){let e=[...this.#F];for(let t=e.length-1;t>=0;--t){const r=e[t],[n,s]=r;!1===this.#z(n,s)&&(yield[n,s.value])}e=[...this.#B];for(let t=e.length-1;t>=0;--t){const r=e[t],[n,s]=r;this.#F.has(n)||!1===this.#z(n,s)&&(yield[n,s.value])}}*entriesAscending(){for(const[e,t]of this.#X())yield[e,t.value]}get size(){if(!this.#M)return this.#B.size;let e=0;for(const t of this.#B.keys())this.#F.has(t)||e++;return Math.min(this.#M+e,this.#U)}get maxSize(){return this.#U}entries(){return this.entriesAscending()}forEach(e,t=this){for(const[r,n]of this.entriesAscending())e.call(t,n,r,this)}get[Symbol.toStringTag](){return"QuickLRU"}toString(){return`QuickLRU(${this.size}/${this.maxSize})`}[Symbol.for("nodejs.util.inspect.custom")](){return this.toString()}}function hb(e,t,r){return`${e}?name=${t}&type=${r}`}async function db(e,t){const r=await fetch(e,{headers:new Headers({accept:"application/dns-json"}),signal:t});return await r.json()}function pb(e,t){return`${t}_${e}`}const fb=Object.assign(gf("dns-over-http-resolver"),{error:gf("dns-over-http-resolver:error")}),gb=class{_cache;_TXTcache;_servers;_request;_abortControllers;constructor(e={}){this._cache=new ub({maxSize:e?.maxCache??100}),this._TXTcache=new ub({maxSize:e?.maxCache??100}),this._servers=["https://cloudflare-dns.com/dns-query","https://dns.google/resolve"],this._request=e.request??db,this._abortControllers=[]}cancel(){this._abortControllers.forEach((e=>{e.abort()}))}getServers(){return this._servers}_getShuffledServers(){const e=[...this._servers];for(let t=e.length-1;t>0;t--){const r=Math.floor(Math.random()*t),n=e[t];e[t]=e[r],e[r]=n}return e}setServers(e){this._servers=e}async resolve(e,t="A"){switch(t){case"A":return this.resolve4(e);case"AAAA":return this.resolve6(e);case"TXT":return this.resolveTxt(e);default:throw new Error(`${t} is not supported`)}}async resolve4(e){const t="A",r=this._cache.get(pb(e,t));if(null!=r)return r;let n=!1;for(const r of this._getShuffledServers()){const s=new AbortController;this._abortControllers.push(s);try{const n=await this._request(hb(r,e,t),s.signal),i=n.Answer.map((e=>e.data)),o=Math.min(...n.Answer.map((e=>e.TTL)));return this._cache.set(pb(e,t),i,{maxAge:o}),i}catch(i){s.signal.aborted&&(n=!0),fb.error(`${r} could not resolve ${e} record ${t}`)}finally{this._abortControllers=this._abortControllers.filter((e=>e!==s))}}if(n)throw Object.assign(new Error("queryA ECANCELLED"),{code:"ECANCELLED"});throw new Error(`Could not resolve ${e} record ${t}`)}async resolve6(e){const t="AAAA",r=this._cache.get(pb(e,t));if(null!=r)return r;let n=!1;for(const r of this._getShuffledServers()){const s=new AbortController;this._abortControllers.push(s);try{const n=await this._request(hb(r,e,t),s.signal),i=n.Answer.map((e=>e.data)),o=Math.min(...n.Answer.map((e=>e.TTL)));return this._cache.set(pb(e,t),i,{maxAge:o}),i}catch(i){s.signal.aborted&&(n=!0),fb.error(`${r} could not resolve ${e} record ${t}`)}finally{this._abortControllers=this._abortControllers.filter((e=>e!==s))}}if(n)throw Object.assign(new Error("queryAaaa ECANCELLED"),{code:"ECANCELLED"});throw new Error(`Could not resolve ${e} record ${t}`)}async resolveTxt(e){const t="TXT",r=this._TXTcache.get(pb(e,t));if(null!=r)return r;let n=!1;for(const r of this._getShuffledServers()){const s=new AbortController;this._abortControllers.push(s);try{const n=await this._request(hb(r,e,t),s.signal),i=n.Answer.map((e=>[e.data.replace(/['"]+/g,"")])),o=Math.min(...n.Answer.map((e=>e.TTL)));return this._TXTcache.set(pb(e,t),i,{maxAge:o}),i}catch(i){s.signal.aborted&&(n=!0),fb.error(`${r} could not resolve ${e} record ${t}`)}finally{this._abortControllers=this._abortControllers.filter((e=>e!==s))}}if(n)throw Object.assign(new Error("queryTxt ECANCELLED"),{code:"ECANCELLED"});throw new Error(`Could not resolve ${e} record ${t}`)}clearCache(){this._cache.clear(),this._TXTcache.clear()}},mb=new yn("dns-over-https");class yb{resolver;static async create(){return new yb}constructor(e=new gb){this.resolver=e}async resolveTXT(e){let t;try{t=await this.resolver.resolveTxt(e)}catch(e){throw mb.error("query failed: ",e),new Error("DNS query failed")}if(!t)throw new Error(`Could not resolve ${e}`);const r=[];return t.forEach((e=>{"string"==typeof e?r.push(e):Array.isArray(e)?e.forEach((e=>{"string"==typeof e?r.push(e):r.push(rn(e))})):r.push(rn(e))})),r}}var wb=__webpack_require__(5818);class bb{static RECORD_PREFIX=Mw.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=bb.parseRootValues(e),n=wb.decode.asBytes(t),s=e.split(" sig")[0],i=nn(s);if(!Ew(It(r.signature,"base64url").slice(0,64),vw(i),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,i]=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(!i)throw new Error("Could not parse 'sig' value from ENRTree root entry");return{eRoot:r,lRoot:n,seq:Number(s),signature:i}}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 vb=new yn("discovery:fetch_nodes");function Eb(e,t){return t.relay>=e.relay&&t.store>=e.store&&t.filter>=e.filter&&t.lightPush>=e.lightPush}function Sb(e,t){if(!e.nodeId)return!1;for(const r of t)if(e.nodeId===r.nodeId)return!1;return!0}function Ab(e,t){e.relay&&(t.relay+=1),e.store&&(t.store+=1),e.filter&&(t.filter+=1),e.lightPush&&(t.lightPush+=1)}function xb(e,t,r){if(Eb(t,r))throw"Internal Error: Waku2 wanted capabilities are already fulfilled";const n=function(e,t){return{relay:t.relaythis._search(s,i)));return kb.info("retrieved peers: ",o.map((e=>({id:e.peerId?.toString(),multiaddrs:e.multiaddrs?.map((e=>e.toString()))})))),o}constructor(e){this._DNSTreeCache={},this.dns=e}async*getNextPeer(e,t){const r=Math.floor(Math.random()*e.length),{publicKey:n,domain:s}=bb.parseTree(e[r]),i={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,i={relay:0,store:0,filter:0,lightPush:0};let o=0;const a=new Set;for(;!Eb(n,i)&&othis._search(s,i))))yield e}async _search(e,t){try{const r=await this._getTXTRecord(e,t);let n,s;t.visits[e]=!0;const i=function(e){return e.startsWith(bb.ROOT_PREFIX)?bb.ROOT_PREFIX:e.startsWith(bb.BRANCH_PREFIX)?bb.BRANCH_PREFIX:e.startsWith(bb.RECORD_PREFIX)?bb.RECORD_PREFIX:""}(r);try{switch(i){case bb.ROOT_PREFIX:return n=bb.parseAndVerifyRoot(r,t.publicKey),await this._search(n,t);case bb.BRANCH_PREFIX:return s=bb.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 bb.RECORD_PREFIX:return lb.fromString(r);default:return null}}catch(t){return kb.error(`Failed to search DNS tree ${i} at subdomain ${e}: ${t}`),null}}catch(t){return kb.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 _b=new yn("peer-discovery-dns");class Cb extends Ls{nextPeer;_started;_components;_options;constructor(e,t){super(),this._started=!1,this._components=e,this._options=t;const{enrUrls:r}=t;_b.info("Use following EIP-1459 ENR Tree URLs: ",r)}async start(){_b.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 Ib.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={[gy]:{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(gy)||(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:fn(r)}}})),s&&this.dispatchEvent(new CustomEvent("peer",{detail:t}))}}stop(){this._started=!1}get[Hu](){return!0}get[Symbol.toStringTag](){return Xr}}function Tb(e,t=my){return r=>new Cb(r,{enrUrls:e,wantedNodeCapabilityCount:t})}function Pb(e){return e.filter((e=>"open"===e.status)).sort(((e,t)=>t.timeline.open-e.timeline.open)).at(0)}const Lb="consumed";class Rb{multicodec;getConnections;addEventListener;log;ongoingCreation=new Set;streamPool=new Map;constructor(e,t,r){this.multicodec=e,this.getConnections=t,this.addEventListener=r,this.log=new yn(`stream-manager:${e}`),this.addEventListener("peer:update",this.handlePeerUpdateStreamPool)}async getStream(e){const t=e.toString(),r=this.streamPool.get(t);r&&(this.streamPool.delete(t),await r);let n=this.getOpenStreamForCodec(e);return n?(this.log.info(`Found existing stream peerId=${t} multicodec=${this.multicodec}`),this.lockStream(t,n),n):(n=await this.createStream(e),this.lockStream(t,n),n)}async createStream(e,t=0){const r=Pb(this.getConnections(e));if(!r)throw new Error(`Failed to get a connection to the peer peerId=${e.toString()} multicodec=${this.multicodec}`);let n,s;for(let i=0;i{const{peer:t}=e.detail;t.protocols.includes(this.multicodec)&&(this.getOpenStreamForCodec(t.id)||this.scheduleNewStream(t))};scheduleNewStream(e){this.log.info(`Scheduling creation of a stream for peerId=${e.id.toString()} multicodec=${this.multicodec}`),this.streamPool.has(e.id.toString())&&this.streamPool.delete(e.id.toString()),this.streamPool.set(e.id.toString(),this.createStreamWithLock(e))}getOpenStreamForCodec(e){const t=Pb(this.getConnections(e));if(!t)return;const r=t.streams.find((e=>e.protocol===this.multicodec));return r?["done","closed","closing"].includes(r.writeStatus||"")||this.isStreamLocked(r)?void 0:r:void 0}lockStream(e,t){this.log.info(`Locking stream for peerId:${e}\tstreamId:${t.id}`),t.metadata[Lb]=!0}isStreamLocked(e){return!!e.metadata[Lb]}}class Ob{multicodec;components;pubsubTopics;addLibp2pEventListener;removeLibp2pEventListener;streamManager;constructor(e,t,r){this.multicodec=e,this.components=t,this.pubsubTopics=r,this.addLibp2pEventListener=t.events.addEventListener.bind(t.events),this.removeLibp2pEventListener=t.events.removeEventListener.bind(t.events),this.streamManager=new Rb(e,t.connectionManager.getConnections.bind(t.connectionManager),this.addLibp2pEventListener)}async getStream(e){return this.streamManager.getStream(e)}}class Nb{proto;constructor(e){this.proto=e}static createRequest(e){const{numPeers:t}=e;return new Nb({query:{numPeers:t},response:void 0})}encode(){return fr.encode(this.proto)}static decode(e){const t=fr.decode(e);return new Nb(t)}get query(){return this.proto.query}get response(){return this.proto.response}}const Db="/vac/waku/peer-exchange/2.0.0-alpha1",Mb=new yn("peer-exchange");class Fb extends Ob{constructor(e,t){super(Db,e,t)}async query(e){const{numPeers:t,peerId:r}=e,n=Nb.createRequest({numPeers:BigInt(t)});if(!await this.components.peerStore.get(r))return{peerInfos:null,error:Hr.NO_PEER_AVAILABLE};let s;try{s=await this.getStream(r)}catch(e){return Mb.error("Failed to get stream",e),{peerInfos:null,error:Hr.NO_STREAM_AVAILABLE}}const i=await Zn([n.encode()],Nn,s,$n,(async e=>await kn(e)));try{const e=new Ln;i.forEach((t=>{e.append(t)}));const{response:t}=Nb.decode(e);return t?{peerInfos:await Promise.all(t.peerInfos.map((e=>e.enr)).filter(Ar).map((async e=>({ENR:await lb.fromRLP(e)})))),error:null}:(Mb.error("PeerExchangeRPC message did not contains a `response` field"),{peerInfos:null,error:Hr.EMPTY_PAYLOAD})}catch(e){return Mb.error("Failed to decode push reply",e),{peerInfos:null,error:Hr.DECODE_FAILED}}}}const Bb=new yn("peer-exchange-discovery"),Ub=1e4,qb=3,$b=Vr.PEER_EXCHANGE;class jb extends Ls{components;peerExchange;options;isStarted;queryingPeers=new Set;queryAttempts=new Map;handleDiscoveredPeer=e=>{const{protocols:t,peerId:r}=e.detail;t.includes(Db)&&!this.queryingPeers.has(r.toString())&&(this.queryingPeers.add(r.toString()),this.startRecurringQueries(r).catch((e=>Bb.error(`Error querying peer ${e}`))))};constructor(e,t,r={}){super(),this.components=e,this.peerExchange=new Fb(e,t),this.options=r,this.isStarted=!1}start(){this.isStarted||(this.dispatchEvent(new CustomEvent("waku:peer-exchange:started",{detail:!0})),Bb.info("Starting peer exchange node discovery, discovering peers"),this.components.events.addEventListener("peer:identify",this.handleDiscoveredPeer))}stop(){this.isStarted&&(Bb.info("Stopping peer exchange node discovery"),this.isStarted=!1,this.queryingPeers.clear(),this.components.events.removeEventListener("peer:identify",this.handleDiscoveredPeer))}get[Hu](){return!0}get[Symbol.toStringTag](){return"@waku/peer-exchange"}startRecurringQueries=async e=>{const t=e.toString(),{queryInterval:r=Ub,maxRetries:n=qb}=this.options;Bb.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=>{Bb.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 Bb.error("Peer exchange query failed",t),{error:t,peerInfos:null};for(const e of r){const{ENR:t}=e;if(!t){Bb.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){Bb.info(`Peer ${r.toString()} has updated multiaddrs or shardInfo, updating`),e&&(Bb.info(`Peer ${r.toString()} has updated multiaddrs, updating`),await this.components.peerStore.patch(r,{multiaddrs:n.multiaddrs})),t&&s&&(Bb.info(`Peer ${r.toString()} has updated shardInfo, updating`),await this.components.peerStore.merge(r,{metadata:{shardInfo:fn(s)}}),this.dispatchEvent(new CustomEvent("peer",{detail:{id:r,multiaddrs:n.multiaddrs}})));continue}}await this.components.peerStore.save(r,{tags:{[$b]:{value:this.options.tagValue??50,ttl:this.options.tagTTL??1e8}},...s&&{metadata:{shardInfo:fn(s)}},...n.multiaddrs&&{multiaddrs:n.multiaddrs}}),Bb.info(`Discovered peer: ${r.toString()}`),this.dispatchEvent(new CustomEvent("peer",{detail:{id:r,multiaddrs:n.multiaddrs}}))}}return{error:null,peerInfos:r}}abortQueriesForPeer(e){Bb.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())),i=e.multiaddrs.map((e=>e.toString())),o=s.some((e=>!i.includes(e)));let a=!1;const c=n.metadata.get("shardInfo");if(c){const e=pn(c);(e||t)&&(a=e.clusterId!==t?.clusterId||e.shards.some((e=>!t?.shards.includes(e))))}return{hasMultiaddrDiff:o,hasShardDiff:a}}}function zb(e){return t=>new jb(t,e)}const Kb=new yn("peer-exchange-discovery"),Hb=Vr.LOCAL;class Vb extends Ls{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){Kb.info("Starting Local Storage Discovery"),this.components.events.addEventListener("peer:identify",this.handleNewPeers);for(const{id:e,address:t}of this.peers){const r=_l(e);await this.components.peerStore.has(r)||(await this.components.peerStore.save(r,{multiaddrs:[bi(t)],tags:{[this.options?.tagName??Hb]:{value:this.options?.tagValue??50,ttl:this.options?.tagTTL??1e8}}}),this.dispatchEvent(new CustomEvent("peer",{detail:{id:r,multiaddrs:[bi(t)]}})))}Kb.info(`Discovered ${this.peers.length} peers`),this.isStarted=!0}}stop(){this.isStarted&&(Kb.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(),i=s.findIndex((e=>e.id===t.toString()));i>=0?s[i].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(Gb):[]}catch(e){return Kb.error("Error parsing peers from local storage:",e),[]}}savePeersToLocalStorage(){try{localStorage.setItem("waku:peers",JSON.stringify(this.peers))}catch(e){Kb.error("Error saving peers to local storage:",e)}}}function Gb(e){return e&&"object"==typeof e&&"string"==typeof e.id&&"string"==typeof e.address}const Wb=new yn("sdk:create");async function Xb(e,t,r){t?.hideWebSocketInfo||fy()||(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:Ci(e)}:{};return async function(e={}){e.privateKey??=await gl("Ed25519");const t=new py({...await tf(e),peerId:(r=e.privateKey,Cl(r.publicKey))});var r;return!1!==e.start&&await t.start(),t}({transports:[Np({filter:!1===t?.filterMultiaddrs||fy()?Lp:Rp})],streamMuxers:[up()],connectionEncrypters:[Ku()],...t,services:{identify:Fd({agentVersion:r??"js-waku"}),ping:pp({maxInboundStreams:t?.pingMaxInboundStreams??10}),...n,...t?.services}})}async function Jb(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 on(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=>hn(t,e.clusterId)))}throw new Error("Unknown shard config. Please use ShardInfo or ContentTopicInfo");var t}(t??Jr);Wb.info("Creating Waku node with pubsub topics",r);const n=e?.libp2p??{},s=n.peerDiscovery??[];var i;return e?.defaultBootstrap&&s.push(...function(e){return[Tb(["enrtree://AIRVQ5DDA4FFWLRBCHJWUWOO6X6S4ZTZ5B667LQ6AJU6PEYDLRD5O@sandbox.waku.nodes.status.im"]),(e,t)=>new Vb(e,t),zb(e)]}(r)),e?.bootstrapPeers&&s.push((i={list:e.bootstrapPeers},e=>new xh(e,i))),n.peerDiscovery=s,{libp2p:await Xb(r,n,e?.userAgent),pubsubTopics:r}}(e),n=new to(r,e,t,{store:!0,lightpush:!0,filter:!0});return!1!==e?.autoStart&&await n.start(),n}var Zb=__webpack_require__(2549),Qb=function(){return Math.floor(1e6*Math.random())},Yb=function(e){return t=void 0,r=void 0,s=function(){var t,r,n;return function(e,t){var r,n,s,i={label:0,sent:function(){if(1&s[0])throw s[1];return s[1]},trys:[],ops:[]},o=Object.create(("function"==typeof Iterator?Iterator:Object).prototype);return o.next=a(0),o.throw=a(1),o.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]{var __webpack_modules__={194:e=>{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,i){r[s]=i,++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)}}}},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 i(e,t,n,i,o){if("function"!=typeof n)throw new TypeError("The listener must be a function");var a=new s(n,i||e,o),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 o(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,i=n.length,o=new Array(i);s{"use strict";var n=t,s=r(3262),i=["double","float","int32","uint32","sint32","fixed32","sfixed32","int64","uint64","sint64","fixed64","sfixed64","bool","string","bytes"];function o(e,t){var r=0,n={};for(t|=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{},527:e=>{"use strict";e.exports=h;var t=/[\s{}=;:[\],'"()<>]/g,r=/(?:"([^"\\]*(?:\\.[^"\\]*)*)")/g,n=/(?:'([^'\\]*(?:\\.[^'\\]*)*)')/g,s=/^ *[*/]+ */,i=/^\s*\*?\/*/,o=/\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=[],m=null;function y(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(o),g=0;g0)return g.shift();if(m)return function(){var t="'"===m?n:r;t.lastIndex=l-1;var s=t.exec(e);if(!s)throw y("string");return l=t.lastIndex,A(m),m=null,u(s[1])}();var s,i,o,p,f,S=0===l;do{if(l===h)return null;for(s=!1;a.test(o=b(l));)if("\n"===o&&(S=!0,++d),++l===h)return null;if("/"===b(l)){if(++l===h)throw y("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("*"!==(o=b(l)))return"/";p=l+1,f=c||"*"===b(p);do{if("\n"===o&&++d,++l===h)throw y("comment");i=o,o=b(l)}while("*"!==i||"/"!==o);++l,f&&(w(p,l-2,S),S=!0),s=!0}}}while(s);var I=l;if(t.lastIndex=0,!t.test(b(I++)))for(;I{"use strict";const n=r(9939);t.PP=n.EventIterator,n.EventIterator},736:(e,t,r)=>{e.exports=function(e){function t(e){let r,s,i,o=null;function a(...e){if(!a.enabled)return;const n=a,s=Number(new Date),i=s-(r||s);n.diff=i,n.prev=r,n.curr=s,r=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let o=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((r,s)=>{if("%%"===r)return"%";o++;const i=t.formatters[s];if("function"==typeof i){const t=e[o];r=i.call(n,t),e.splice(o,1),o--}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!==o?o:(s!==t.namespaces&&(s=t.namespaces,i=t.enabled(e)),i),set:e=>{o=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,t){let r=0,n=0,s=-1,i=0;for(;r"-"+e))].join(",");return t.enable(""),e},t.enable=function(e){t.save(e),t.namespaces=e,t.names=[],t.skips=[];const r=("string"==typeof e?e:"").trim().replace(" ",",").split(",").filter(Boolean);for(const e of r)"-"===e[0]?t.skips.push(e.slice(1)):t.names.push(e)},t.enabled=function(e){for(const r of t.skips)if(s(e,r))return!1;for(const r of t.names)if(s(e,r))return!0;return!1},t.humanize=r(6585),t.destroy=function(){console.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`.")},Object.keys(e).forEach((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";var n=t,s=r(5643),i=r(3262);function o(e,t,r,n){var i=!1;if(t.resolvedType)if(t.resolvedType instanceof s){e("switch(d%s){",n);for(var o=t.resolvedType.values,a=Object.keys(o),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 i=!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":i=!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,i?"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=i.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=i;var n=r(3449);(i.prototype=Object.create(n.prototype)).constructor=i;var s=r(3610);function i(){n.call(this)}function o(e,t,r){e.length<40?s.utf8.write(e,t,r):t.utf8Write?t.utf8Write(e,r):t.write(e,r)}i._configure=function(){i.alloc=s._Buffer_allocUnsafe,i.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(i.writeBytesBuffer,t,e),this},i.prototype.string=function(e){var t=s.Buffer.byteLength(e);return this.uint32(t),t&&this._push(o,t,e),this},i._configure()},1080:(e,t,r)=>{"use strict";e.exports=function(e){for(var t,r=i.codegen(["m","w"],e.name+"$encode")("if(!w)")("w=Writer.create()"),a=e.fieldsArray.slice().sort(i.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?o(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?o(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),i=r(3262);function o(e,t,r,n){return t.delimited?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)}},1176:(e,t,r)=>{var n;!function(){"use strict";var s="input is invalid type",i="object"==typeof window,o=i?window:{};o.JS_SHA3_NO_WINDOW&&(i=!1);var a=!i&&"object"==typeof self;!o.JS_SHA3_NO_NODE_JS&&"object"==typeof process&&process.versions&&process.versions.node?o=global:a&&(o=self);for(var c=!o.JS_SHA3_NO_COMMON_JS&&e.exports,l=r.amdO,u=!o.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],m=[128,256],y=["hex","buffer","arrayBuffer","array","digest"],b={128:168,256:136},w=o.JS_SHA3_NO_NODE_JS||!Array.isArray?function(e){return"[object Array]"===Object.prototype.toString.call(e)}:Array.isArray,v=!u||!o.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){U.call(this,e,t,r)}U.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],i=this.blocks,o=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?(i[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]<=o){for(this.start=r-o,this.block=i[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},U.prototype.encodeString=function(e){var t=E(e);e=t[0];var r=t[1],n=0,s=e.length;if(r)for(var i=0;i=57344?n+=3:(o=65536+((1023&o)<<10|1023&e.charCodeAt(++i)),n+=4)}else n=s;return n+=this.encode(8*n),this.update(e),n},U.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];o%t==0&&(r=A(r),q(r),i=0)}return s&&(e=r[i],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},U.prototype.arrayBuffer=function(){this.finalize();var e,t=this.blockCount,r=this.s,n=this.outputBlocks,s=this.extraBytes,i=0,o=0,a=this.outputBits>>3;e=s?new ArrayBuffer(n+1<<2):new ArrayBuffer(a);for(var c=new Uint32Array(e);o>8&255,c[e+2]=t>>16&255,c[e+3]=t>>24&255;a%r==0&&(n=A(n),q(n))}return i&&(e=a<<2,t=n[o],c[e]=255&t,i>1&&(c[e+1]=t>>8&255),i>2&&(c[e+2]=t>>16&255)),c},$.prototype=new U,$.prototype.finalize=function(){return this.encode(this.outputBits,!0),U.prototype.finalize.call(this)};var q=function(e){var t,r,n,s,i,o,a,c,l,u,h,d,p,g,m,y,b,w,v,E,S,A,I,k,x,C,_,T,P,L,R,N,O,D,M,F,B,U,$,q,j,z,H,K,V,G,W,X,J,Q,Z,Y,ee,te,re,ne,se,ie,oe,ae,ce,le,ue;for(n=0;n<48;n+=2)s=e[0]^e[10]^e[20]^e[30]^e[40],i=e[1]^e[11]^e[21]^e[31]^e[41],o=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])^(o<<1|a>>>31),r=(p=e[9]^e[19]^e[29]^e[39]^e[49])^(a<<1|o>>>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=i^(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=o^(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|i>>>31),r=h^(i<<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],m=e[1],G=e[11]<<4|e[10]>>>28,W=e[10]<<4|e[11]>>>28,T=e[20]<<3|e[21]>>>29,P=e[21]<<3|e[20]>>>29,ae=e[31]<<9|e[30]>>>23,ce=e[30]<<9|e[31]>>>23,z=e[40]<<18|e[41]>>>14,H=e[41]<<18|e[40]>>>14,D=e[2]<<1|e[3]>>>31,M=e[3]<<1|e[2]>>>31,y=e[13]<<12|e[12]>>>20,b=e[12]<<12|e[13]>>>20,X=e[22]<<10|e[23]>>>22,J=e[23]<<10|e[22]>>>22,L=e[33]<<13|e[32]>>>19,R=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,F=e[14]<<6|e[15]>>>26,B=e[15]<<6|e[14]>>>26,w=e[25]<<11|e[24]>>>21,v=e[24]<<11|e[25]>>>21,Q=e[34]<<15|e[35]>>>17,Z=e[35]<<15|e[34]>>>17,N=e[45]<<29|e[44]>>>3,O=e[44]<<29|e[45]>>>3,k=e[6]<<28|e[7]>>>4,x=e[7]<<28|e[6]>>>4,ne=e[17]<<23|e[16]>>>9,se=e[16]<<23|e[17]>>>9,U=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,Y=e[47]<<24|e[46]>>>8,ee=e[46]<<24|e[47]>>>8,K=e[8]<<27|e[9]>>>5,V=e[9]<<27|e[8]>>>5,C=e[18]<<20|e[19]>>>12,_=e[19]<<20|e[18]>>>12,ie=e[29]<<7|e[28]>>>25,oe=e[28]<<7|e[29]>>>25,q=e[38]<<8|e[39]>>>24,j=e[39]<<8|e[38]>>>24,A=e[48]<<14|e[49]>>>18,I=e[49]<<14|e[48]>>>18,e[0]=g^~y&w,e[1]=m^~b&v,e[10]=k^~C&T,e[11]=x^~_&P,e[20]=D^~F&U,e[21]=M^~B&$,e[30]=K^~G&X,e[31]=V^~W&J,e[40]=te^~ne&ie,e[41]=re^~se&oe,e[2]=y^~w&E,e[3]=b^~v&S,e[12]=C^~T&L,e[13]=_^~P&R,e[22]=F^~U&q,e[23]=B^~$&j,e[32]=G^~X&Q,e[33]=W^~J&Z,e[42]=ne^~ie&ae,e[43]=se^~oe&ce,e[4]=w^~E&A,e[5]=v^~S&I,e[14]=T^~L&N,e[15]=P^~R&O,e[24]=U^~q&z,e[25]=$^~j&H,e[34]=X^~Q&Y,e[35]=J^~Z&ee,e[44]=ie^~ae&le,e[45]=oe^~ce&ue,e[6]=E^~A&g,e[7]=S^~I&m,e[16]=L^~N&k,e[17]=R^~O&x,e[26]=q^~z&D,e[27]=j^~H&M,e[36]=Q^~Y&K,e[37]=Z^~ee&V,e[46]=ae^~le&te,e[47]=ce^~ue&re,e[8]=A^~g&y,e[9]=I^~m&b,e[18]=N^~k&C,e[19]=O^~x&_,e[28]=z^~D&F,e[29]=H^~M&B,e[38]=Y^~K&G,e[39]=ee^~V&W,e[48]=le^~te&ne,e[49]=ue^~re&se,e[0]^=f[n],e[1]^=f[n+1]};if(c)e.exports=L;else{for(N=0;N{"use strict";e.exports=l;var n=r(7209);((l.prototype=Object.create(n.prototype)).constructor=l).className="Field";var s,i=r(5643),o=r(361),a=r(3262),c=/^required|optional|repeated$/;function l(e,t,r,s,i,l,u){if(a.isObject(s)?(u=i,l=s,s=i=void 0):a.isObject(i)&&(u=l,l=i,i=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!==i&&!a.isString(i))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=i||void 0,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!==o.long[r],this.bytes="bytes"===r,this.resolvedType=null,this.extensionField=null,this.declaringField=null,this.comment=u}l.fromJSON=function(e,t){var r=new l(e,t.id,t.type,t.rule,t.extend,t.options,t.comment);return t.edition&&(r._edition=t.edition),r._defaultEdition="proto3",r},Object.defineProperty(l.prototype,"required",{get:function(){return"LEGACY_REQUIRED"===this._features.field_presence}}),Object.defineProperty(l.prototype,"optional",{get:function(){return!this.required}}),Object.defineProperty(l.prototype,"delimited",{get:function(){return this.resolvedType instanceof s&&"DELIMITED"===this._features.message_encoding}}),Object.defineProperty(l.prototype,"packed",{get:function(){return"PACKED"===this._features.repeated_field_encoding}}),Object.defineProperty(l.prototype,"hasPresence",{get:function(){return!this.repeated&&!this.map&&(this.partOf||this.declaringField||this.extensionField||"IMPLICIT"!==this._features.field_presence)}}),l.prototype.setOption=function(e,t,r){return n.prototype.setOption.call(this,e,t,r)},l.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return a.toObject(["edition",this._editionToJSON(),"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=o.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 i&&"string"==typeof this.typeDefault&&(this.typeDefault=this.resolvedType.values[this.typeDefault])),this.options&&(void 0===this.options.packed||!this.resolvedType||this.resolvedType instanceof i||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.prototype._inferLegacyProtoFeatures=function(e){if("proto2"!==e&&"proto3"!==e)return{};var t={};return this.resolve(),"required"===this.rule&&(t.field_presence="LEGACY_REQUIRED"),this.resolvedType instanceof s&&this.resolvedType.group&&(t.message_encoding="DELIMITED"),!0===this.getOption("packed")?t.repeated_field_encoding="PACKED":!1===this.getOption("packed")&&(t.repeated_field_encoding="EXPANDED"),t},l.prototype._resolveFeatures=function(e){return n.prototype._resolveFeatures.call(this,this._edition||e)},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,i){a.decorateType(s.constructor).add(new l(i,e,t,r,{default:n}))}},l._configure=function(e){s=e}},1447:(e,t)=>{"use strict";var r=t;r.length=function(e){for(var t=0,r=0,n=0;n191&&n<224?i[o++]=(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,i[o++]=55296+(n>>10),i[o++]=56320+(1023&n)):i[o++]=(15&n)<<12|(63&e[t++])<<6|63&e[t++],o>8191&&((s||(s=[])).push(String.fromCharCode.apply(String,i)),o=0);return s?(o&&s.push(String.fromCharCode.apply(String,i.slice(0,o))),s.join("")):String.fromCharCode.apply(String,i.slice(0,o))},r.write=function(e,t,r){for(var n,s,i=r,o=0;o>6|192,t[r++]=63&n|128):55296==(64512&n)&&56320==(64512&(s=e.charCodeAt(o+1)))?(n=65536+((1023&n)<<10)+(1023&s),++o,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-i}},1457:(e,t,r)=>{"use strict";e.exports=o;var n=r(7209);((o.prototype=Object.create(n.prototype)).constructor=o).className="OneOf";var s=r(1344),i=r(3262);function o(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},o.prototype.onAdd=function(e){n.prototype.onAdd.call(this,e);for(var t=0;t{"use strict";e.exports=s;var n=r(3610);function s(e,t){this.lo=e>>>0,this.hi=t>>>0}var i=s.zero=new s(0,0);i.toNumber=function(){return 0},i.zzEncode=i.zzDecode=function(){return this},i.length=function(){return 1};var o=s.zeroHash="\0\0\0\0\0\0\0\0";s.fromNumber=function(e){if(0===e)return i;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):i},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===o?i: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}},2549:(e,t,r)=>{"use strict";e.exports=r(9100)},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=i;var n=r(6237);(i.prototype=Object.create(n.prototype)).constructor=i;var s=r(3610);function i(e){n.call(this,e)}i._configure=function(){s.Buffer&&(i.prototype._slice=s.Buffer.prototype.slice)},i.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))},i._configure()},3262:(e,t,r)=>{"use strict";var n,s,i=e.exports=r(3610),o=r(4529);i.codegen=r(8561),i.fetch=r(5212),i.path=r(9207),i.fs=i.inquire("fs"),i.toArray=function(e){if(e){for(var t=Object.keys(e),r=new Array(t.length),n=0;n0)t[i]=e(t[i]||{},r,s);else{var o=t[i];if(o&&n)return t;o&&(s=[].concat(o).concat(s)),t[i]=s}return t}(e,t=t.split("."),r)},Object.defineProperty(i,"decorateRoot",{get:function(){return o.decorated||(o.decorated=new(r(5330)))}})},3449:(e,t,r)=>{"use strict";e.exports=h;var n,s=r(3610),i=s.LongBits,o=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 m(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,i.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=i.from(e);return this._push(g,t.length(),t)},h.prototype.int64=h.prototype.uint64,h.prototype.sint64=function(e){var t=i.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(m,4,e>>>0)},h.prototype.sfixed32=h.prototype.fixed32,h.prototype.fixed64=function(e){var t=i.from(e);return this._push(m,4,t.lo)._push(m,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 y=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=o.length(e));o.decode(e,r,0),e=r}return this.uint32(t)._push(y,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()}},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=i,n.ProtocolError=i("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{function t(e,t){"boolean"==typeof t&&(t={forever:t}),this._originalTimeouts=JSON.parse(JSON.stringify(e)),this._timeouts=e,this._options=t||{},this._maxRetryTime=t&&t.maxRetryTime||1/0,this._fn=null,this._errors=[],this._attempts=1,this._operationTimeout=null,this._operationTimeoutCb=null,this._timeout=null,this._operationStart=null,this._timer=null,this._options.forever&&(this._cachedTimeouts=this._timeouts.slice(0))}e.exports=t,t.prototype.reset=function(){this._attempts=1,this._timeouts=this._originalTimeouts.slice(0)},t.prototype.stop=function(){this._timeout&&clearTimeout(this._timeout),this._timer&&clearTimeout(this._timer),this._timeouts=[],this._cachedTimeouts=null},t.prototype.retry=function(e){if(this._timeout&&clearTimeout(this._timeout),!e)return!1;var t=(new Date).getTime();if(e&&t-this._operationStart>=this._maxRetryTime)return this._errors.push(e),this._errors.unshift(new Error("RetryOperation timeout occurred")),!1;this._errors.push(e);var r=this._timeouts.shift();if(void 0===r){if(!this._cachedTimeouts)return!1;this._errors.splice(0,this._errors.length-1),r=this._cachedTimeouts.slice(-1)}var n=this;return this._timer=setTimeout((function(){n._attempts++,n._operationTimeoutCb&&(n._timeout=setTimeout((function(){n._operationTimeoutCb(n._attempts)}),n._operationTimeout),n._options.unref&&n._timeout.unref()),n._fn(n._attempts)}),r),this._options.unref&&this._timer.unref(),!0},t.prototype.attempt=function(e,t){this._fn=e,t&&(t.timeout&&(this._operationTimeout=t.timeout),t.cb&&(this._operationTimeoutCb=t.cb));var r=this;this._operationTimeoutCb&&(this._timeout=setTimeout((function(){r._operationTimeoutCb()}),r._operationTimeout)),this._operationStart=(new Date).getTime(),this._fn(this._attempts)},t.prototype.try=function(e){console.log("Using RetryOperation.try() is deprecated"),this.attempt(e)},t.prototype.start=function(e){console.log("Using RetryOperation.start() is deprecated"),this.attempt(e)},t.prototype.start=t.prototype.try,t.prototype.errors=function(){return this._errors},t.prototype.attempts=function(){return this._attempts},t.prototype.mainError=function(){if(0===this._errors.length)return null;for(var e={},t=null,r=0,n=0;n=r&&(t=s,r=o)}return 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},4358:e=>{"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";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()},4529:e=>{"use strict";e.exports={}},4863:(e,t,r)=>{"use strict";e.exports=I,I.filename=null,I.defaults={keepCase:!1};var n=r(527),s=r(5330),i=r(7882),o=r(1344),a=r(8252),c=r(1457),l=r(5643),u=r(9687),h=r(8811),d=r(7209),p=r(361),f=r(3262),g=/^[1-9][0-9]*$/,m=/^-?[1-9][0-9]*$/,y=/^0[x][0-9a-fA-F]+$/,b=/^-?0[x][0-9a-fA-F]+$/,w=/^0[0-7]+$/,v=/^-?0[0-7]+$/,E=/^(?![eE])[0-9]*(?:\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,S=/^[a-zA-Z_][a-zA-Z_0-9]*$/,A=/^(?:\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\.[a-zA-Z_][a-zA-Z_0-9]*)*$/;function I(e,t,r){t instanceof s||(r=t,t=new s),r||(r=I.defaults);var k,x,C,_,T=r.preferTrailingComment||!1,P=n(e,r.alternateCommentMode||!1),L=P.next,R=P.push,N=P.peek,O=P.skip,D=P.cmnt,M=!0,F="proto2",B=t,U=[],$={},q=r.keepCase?function(e){return e}:f.camelCase;function j(e,t,r){var n=I.filename;return r||(I.filename=null),Error("illegal "+(t||"token")+" '"+e+"' ("+(n?n+", ":"")+"line "+P.line+")")}function z(){var e,t=[];do{if('"'!==(e=L())&&"'"!==e)throw j(e);t.push(L()),O(e),e=N()}while('"'===e||"'"===e);return t.join("")}function H(e){var t=L();switch(t){case"'":case'"':return R(t),z();case"true":case"TRUE":return!0;case"false":case"FALSE":return!1}try{return function(e){var t=1;switch("-"===e.charAt(0)&&(t=-1,e=e.substring(1)),e){case"inf":case"INF":case"Inf":return t*(1/0);case"nan":case"NAN":case"Nan":case"NaN":return NaN;case"0":return 0}if(g.test(e))return t*parseInt(e,10);if(y.test(e))return t*parseInt(e,16);if(w.test(e))return t*parseInt(e,8);if(E.test(e))return t*parseFloat(e);throw j(e,"number",!0)}(t)}catch(r){if(e&&A.test(t))return t;throw j(t,"value")}}function K(e,t){var r,n;do{if(!t||'"'!==(r=N())&&"'"!==r)try{e.push([n=V(L()),O("to",!0)?V(L()):n])}catch(n){if(!(t&&A.test(r)&&F>=2023))throw n;e.push(r)}else{var s=z();if(e.push(s),F>=2023)throw j(s,"id")}}while(O(",",!0));var i={options:void 0,setOption:function(e,t){void 0===this.options&&(this.options={}),this.options[e]=t}};Z(i,(function(e){if("option"!==e)throw j(e);re(i,e),O(";")}),(function(){ie(i)}))}function V(e,t){switch(e){case"max":case"MAX":case"Max":return 536870911;case"0":return 0}if(!t&&"-"===e.charAt(0))throw j(e,"id");if(m.test(e))return parseInt(e,10);if(b.test(e))return parseInt(e,16);if(v.test(e))return parseInt(e,8);throw j(e,"id")}function G(){if(void 0!==k)throw j("package");if(k=L(),!A.test(k))throw j(k,"name");B=B.define(k),O(";")}function W(){var e,t=N();switch(t){case"weak":e=C||(C=[]),L();break;case"public":L();default:e=x||(x=[])}t=z(),O(";"),e.push(t)}function X(){if(O("="),(F=z())<2023)throw j(F,"syntax");O(";")}function J(){if(O("="),F=z(),!["2023"].includes(F))throw j(F,"edition");O(";")}function Q(e,t){switch(t){case"option":return re(e,t),O(";"),!0;case"message":return Y(e,t),!0;case"enum":return te(e,t),!0;case"service":return function(e,t){if(!S.test(t=L()))throw j(t,"service name");var r=new u(t);Z(r,(function(e){if(!Q(r,e)){if("rpc"!==e)throw j(e);!function(e,t){var r=D(),n=t;if(!S.test(t=L()))throw j(t,"name");var s,i,o,a,c=t;if(O("("),O("stream",!0)&&(i=!0),!A.test(t=L()))throw j(t);if(s=t,O(")"),O("returns"),O("("),O("stream",!0)&&(a=!0),!A.test(t=L()))throw j(t);o=t,O(")");var l=new h(c,n,s,o,i,a);l.comment=r,Z(l,(function(e){if("option"!==e)throw j(e);re(l,e),O(";")})),e.add(l)}(r,e)}})),e.add(r),e===B&&U.push(r)}(e,t),!0;case"extend":return function(e,t){if(!A.test(t=L()))throw j(t,"reference");var r=t;Z(null,(function(t){switch(t){case"required":case"repeated":ee(e,t,r);break;case"optional":ee(e,"proto3"===F?"proto3_optional":"optional",r);break;default:if("proto2"===F||!A.test(t))throw j(t);R(t),ee(e,"optional",r)}}))}(e,t),!0}return!1}function Z(e,t,r){var n=P.line;if(e&&("string"!=typeof e.comment&&(e.comment=D()),e.filename=I.filename),O("{",!0)){for(var s;"}"!==(s=L());)t(s);O(";",!0)}else r&&r(),O(";"),e&&("string"!=typeof e.comment||T)&&(e.comment=D(n)||e.comment)}function Y(e,t){if(!S.test(t=L()))throw j(t,"type name");var r=new i(t);Z(r,(function(e){if(!Q(r,e))switch(e){case"map":!function(e){O("<");var t=L();if(void 0===p.mapKey[t])throw j(t,"type");O(",");var r=L();if(!A.test(r))throw j(r,"type");O(">");var n=L();if(!S.test(n))throw j(n,"name");O("=");var s=new a(q(n),V(L()),t,r);Z(s,(function(e){if("option"!==e)throw j(e);re(s,e),O(";")}),(function(){ie(s)})),e.add(s)}(r);break;case"required":if("proto2"!==F)throw j(e);case"repeated":ee(r,e);break;case"optional":if("proto3"===F)ee(r,"proto3_optional");else{if("proto2"!==F)throw j(e);ee(r,"optional")}break;case"oneof":!function(e,t){if(!S.test(t=L()))throw j(t,"name");var r=new c(q(t));Z(r,(function(e){"option"===e?(re(r,e),O(";")):(R(e),ee(r,"optional"))})),e.add(r)}(r,e);break;case"extensions":K(r.extensions||(r.extensions=[]));break;case"reserved":K(r.reserved||(r.reserved=[]),!0);break;default:if("proto2"===F||!A.test(e))throw j(e);R(e),ee(r,"optional")}})),e.add(r),e===B&&U.push(r)}function ee(e,t,r){var n=L();if("group"!==n){for(;n.endsWith(".")||N().startsWith(".");)n+=L();if(!A.test(n))throw j(n,"type");var s=L();if(!S.test(s))throw j(s,"name");s=q(s),O("=");var a=new o(s,V(L()),n,t,r);if(Z(a,(function(e){if("option"!==e)throw j(e);re(a,e),O(";")}),(function(){ie(a)})),"proto3_optional"===t){var l=new c("_"+s);a.setOption("proto3_optional",!0),l.add(a),e.add(l)}else e.add(a);e===B&&U.push(a)}else!function(e,t){if(F>=2023)throw j("group");var r=L();if(!S.test(r))throw j(r,"name");var n=f.lcFirst(r);r===n&&(r=f.ucFirst(r)),O("=");var s=V(L()),a=new i(r);a.group=!0;var c=new o(n,s,r,t);c.filename=I.filename,Z(a,(function(e){switch(e){case"option":re(a,e),O(";");break;case"required":case"repeated":ee(a,e);break;case"optional":ee(a,"proto3"===F?"proto3_optional":"optional");break;case"message":Y(a,e);break;case"enum":te(a,e);break;default:throw j(e)}})),e.add(a).add(c)}(e,t)}function te(e,t){if(!S.test(t=L()))throw j(t,"name");var r=new l(t);Z(r,(function(e){switch(e){case"option":re(r,e),O(";");break;case"reserved":K(r.reserved||(r.reserved=[]),!0),void 0===r.reserved&&(r.reserved=[]);break;default:!function(e,t){if(!S.test(t))throw j(t,"name");O("=");var r=V(L(),!0),n={options:void 0,getOption:function(e){return this.options[e]},setOption:function(e,t){d.prototype.setOption.call(n,e,t)},setParsedOption:function(){}};Z(n,(function(e){if("option"!==e)throw j(e);re(n,e),O(";")}),(function(){ie(n)})),e.add(t,r,n.comment,n.parsedOptions||n.options)}(r,e)}})),e.add(r),e===B&&U.push(r)}function re(e,t){var r,n,s=!0;for("option"===t&&(t=L());"="!==t;){if("("===t){var i=L();O(")"),t="("+i+")"}if(s){if(s=!1,t.includes(".")&&!t.includes("(")){var o=t.split(".");r=o[0]+".",t=o[1];continue}r=t}else n=n?n+=t:t;t=L()}var a=ne(e,n?r.concat(n):r);n=n&&"."===n[0]?n.slice(1):n,function(e,t,r,n){e.setParsedOption&&e.setParsedOption(t,r,n)}(e,r=r&&"."===r[r.length-1]?r.slice(0,-1):r,a,n)}function ne(e,t){if(O("{",!0)){for(var r={};!O("}",!0);){if(!S.test(_=L()))throw j(_,"name");if(null===_)throw j(_,"end of input");var n,s=_;if(O(":",!0),"{"===N())n=ne(e,t+"."+_);else if("["===N()){var i;if(n=[],O("[",!0)){do{i=H(!0),n.push(i)}while(O(",",!0));O("]"),void 0!==i&&se(e,t+"."+_,i)}}else n=H(!0),se(e,t+"."+_,n);var o=r[s];o&&(n=[].concat(o).concat(n)),r[s]=n,O(",",!0),O(";",!0)}return r}var a=H(!0);return se(e,t,a),a}function se(e,t,r){B===e&&/^features\./.test(t)?$[t]=r:e.setOption&&e.setOption(t,r)}function ie(e){if(O("[",!0)){do{re(e,"option")}while(O(",",!0));O("]")}return e}for(;null!==(_=L());)switch(_){case"package":if(!M)throw j(_);G();break;case"import":if(!M)throw j(_);W();break;case"syntax":if(!M)throw j(_);X();break;case"edition":if(!M)throw j(_);J();break;case"option":re(B,_),O(";",!0);break;default:if(Q(B,_)){M=!1;continue}throw j(_)}return U.forEach((e=>{e._edition=F,Object.keys($).forEach((t=>{void 0===e.getOption(t)&&e.setOption(t,$[t],!0)}))})),I.filename=null,{package:k,imports:x,weakImports:C,root:t}}},5047:(e,t,r)=>{"use strict";t.Service=r(7595)},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}},5212:(e,t,r)=>{"use strict";e.exports=i;var n=r(8045),s=r(4153)("fs");function i(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?i.xhr(e,t,r):n?r(n):r(null,t.binary?s:s.toString("utf8"))})):i.xhr(e,t,r):n(i,this,e,t)}i.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";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)},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,i,o,a=r(1344),c=r(5643),l=r(1457),u=r(3262);function h(e){n.call(this,"",e),this.deferred=[],this.files=[],this._edition="proto2"}function d(){}h.fromJSON=function(e,t){return t||(t=new h),e.options&&t.setOptions(e.options),t.addJSON(e.nested).resolveAll()},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,t&&t.resolveAll(),r(e,t)}}function l(e){var t=e.lastIndexOf("google/protobuf/");if(t>-1){var r=e.substring(t);if(r in o)return r}return null}function h(e,t){try{if(u.isString(t)&&"{"===t.charAt(0)&&(t=JSON.parse(t)),u.isString(t)){i.filename=e;var n,o=i(t,s,r),h=0;if(o.imports)for(;h-1))if(s.files.push(e),e in o)a?h(e,o[e]):(++f,setTimeout((function(){--f,h(e,o[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,i){--f,n&&(r?t?f||c(null,s):c(r):h(e,i))}))}var f=0;u.isString(t)&&(t=[t]);for(var g,m=0;m-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>>24,(e&255<<16)>>>16,(65280&e)>>>8,255&e].join(".")},a=function(e){var t,n,s,i,o,a;for(t=[],s=i=0;i<=3&&0!==e.length;s=++i){if(s>0){if("."!==e[0])throw new Error("Invalid IP");e=e.substring(1)}o=(a=r(e))[0],n=a[1],e=e.substring(n),t.push(o)}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"),o=n("a"),i=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])-o)>>>0;else{if(!("A"<=e[a]&&e[a]<="F"))break;c=c*t+(10+n(e[a])-i)>>>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)},5617:(e,t,r)=>{e.exports=r(8303)},5643:(e,t,r)=>{"use strict";e.exports=o;var n=r(7209);((o.prototype=Object.create(n.prototype)).constructor=o).className="Enum";var s=r(8923),i=r(3262);function o(e,t,r,s,i,o){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=i||{},this.valuesOptions=o,this._valuesFeatures={},this.reserved=void 0,t)for(var a=Object.keys(t),c=0;c{var t=Object.assign({},this._features);this._valuesFeatures[e]=Object.assign(t,this.valuesOptions&&this.valuesOptions[e]&&this.valuesOptions[e].features)})),this},o.fromJSON=function(e,t){var r=new o(e,t.values,t.options,t.comment,t.comments);return r.reserved=t.reserved,t.edition&&(r._edition=t.edition),r._defaultEdition="proto3",r},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return i.toObject(["edition",this._editionToJSON(),"options",this.options,"valuesOptions",this.valuesOptions,"values",this.values,"reserved",this.reserved&&this.reserved.length?this.reserved:void 0,"comment",t?this.comment:void 0,"comments",t?this.comments:void 0])},o.prototype.add=function(e,t,r,n){if(!i.isString(e))throw TypeError("name must be a string");if(!i.isInteger(t))throw TypeError("id must be an integer");if(void 0!==this.values[e])throw Error("duplicate name '"+e+"' in "+this);if(this.isReservedId(t))throw Error("id "+t+" is reserved in "+this);if(this.isReservedName(e))throw Error("name '"+e+"' is reserved in "+this);if(void 0!==this.valuesById[t]){if(!this.options||!this.options.allow_alias)throw Error("duplicate id "+t+" in "+this);this.values[e]=t}else this.valuesById[this.values[e]=t]=e;return n&&(void 0===this.valuesOptions&&(this.valuesOptions={}),this.valuesOptions[e]=n||null),this.comments[e]=r||null,this},o.prototype.remove=function(e){if(!i.isString(e))throw TypeError("name must be a string");var t=this.values[e];if(null==t)throw Error("name '"+e+"' does not exist in "+this);return delete this.valuesById[t],delete this.values[e],delete this.comments[e],this.valuesOptions&&delete this.valuesOptions[e],this},o.prototype.isReservedId=function(e){return s.isReservedId(this.reserved,e)},o.prototype.isReservedName=function(e){return s.isReservedName(this.reserved,e)}},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,i=r.amdO,o="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,i,o,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|i>>>1),u[h++]=255&(i<<7|o<<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++)],i=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|i>>>1)):7===g&&(t=a[e.charAt(p++)],r=a[e.charAt(p++)],n=a[e.charAt(p++)],s=a[e.charAt(p++)],i=a[e.charAt(p++)],o=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|i>>>1),u[h++]=255&(i<<7|o<<2|c>>>3)),u},h=function(e,t){if(!t)return function(e){for(var t,r,n="",s=e.length,i=0,o=0;i191&&t<=223?(r=31&t,o=1):t<=239?(r=15&t,o=2):t<=247?(r=7&t,o=3):l(i,n);for(var a=0;a191)&&l(i,n),r<<=6,r+=63&t;r>=55296&&r<=57343&&l(i,n),r>1114111&&l(i,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,i,o,c,h,d,p="",f=e.indexOf("=");-1===f&&(f=e.length);for(var g=0,m=f>>3<<3;g>>2))+String.fromCharCode(255&(n<<6|s<<1|i>>>4))+String.fromCharCode(255&(i<<4|o>>>1))+String.fromCharCode(255&(o<<7|c<<2|h>>>3))+String.fromCharCode(255&(h<<5|d));var y=f-m;return 2===y?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))):4===y?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],i=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|i>>>4))):5===y?(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],i=a[e.charAt(g++)],o=a[e.charAt(g++)],p+=String.fromCharCode(255&(r<<3|n>>>2))+String.fromCharCode(255&(n<<6|s<<1|i>>>4))+String.fromCharCode(255&(i<<4|o>>>1))):7===y&&(r=a[e.charAt(g++)],n=a[e.charAt(g++)],s=a[e.charAt(g++)],i=a[e.charAt(g++)],o=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|i>>>4))+String.fromCharCode(255&(i<<4|o>>>1))+String.fromCharCode(255&(o<<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,i,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[31&(s<<3|i>>>5)]+o[31&i];var h=c-u;return 1===h?(t=e[l],a+=o[t>>>3]+o[t<<2&31]+"======"):2===h?(t=e[l++],r=e[l],a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[r<<4&31]+"===="):3===h?(t=e[l++],r=e[l++],n=e[l],a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[n<<1&31]+"==="):4===h&&(t=e[l++],r=e[l++],n=e[l++],s=e[l],a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[s<<3&31]+"="),a}(e):t?function(e){for(var t,r,n,s,i,a="",c=e.length,l=0,u=5*parseInt(c/5);l>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[31&(s<<3|i>>>5)]+o[31&i];var h=c-u;return 1===h?(t=e.charCodeAt(l),a+=o[t>>>3]+o[t<<2&31]+"======"):2===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l),a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[r<<4&31]+"===="):3===h?(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l),a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[n<<1&31]+"==="):4===h&&(t=e.charCodeAt(l++),r=e.charCodeAt(l++),n=e.charCodeAt(l++),s=e.charCodeAt(l),a+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[s<<3&31]+"="),a}(e):function(e){var t,r,n,s,i,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],i=c[4],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[31&(s<<3|i>>>5)]+o[31&i]):1===l?h+=o[t>>>3]+o[t<<2&31]+"======":2===l?(r=c[1],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[r<<4&31]+"===="):3===l?(r=c[1],n=c[2],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[n<<1&31]+"==="):(r=c[1],n=c[2],s=c[3],h+=o[t>>>3]+o[31&(t<<2|r>>>6)]+o[r>>>1&31]+o[31&(r<<4|n>>>4)]+o[31&(n<<1|s>>>7)]+o[s>>>2&31]+o[s<<3&31]+"=")}while(!u);return h}(e)},decode:h};h.asBytes=u,s?e.exports=d:(t.base32=d,i&&(void 0===(n=function(){return d}.call(d,r,d,e))||(e.exports=n)))}()},6237:(e,t,r)=>{"use strict";e.exports=c;var n,s=r(3610),i=s.LongBits,o=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 i(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 i(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 o.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)}})}},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}},6434:(e,t,r)=>{"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 i=this.lookup(n);i&&(e=i.decode(e.value))}if(!(e instanceof this.ctor)&&e instanceof s){var o=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),o["@type"]=n,o}return this.toObject(e,t)}}},6585:e=>{var t=1e3,r=60*t,n=60*r,s=24*n,i=7*s;function o(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 o=/^(-?(?:\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(o){var a=parseFloat(o[1]);switch((o[2]||"ms").toLowerCase()){case"years":case"year":case"yrs":case"yr":case"y":return 315576e5*a;case"weeks":case"week":case"w":return a*i;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?o(c,l,s,"day"):l>=n?o(c,l,n,"hour"):l>=r?o(c,l,r,"minute"):l>=t?o(c,l,t,"second"):c+" ms"):function(e){var i=Math.abs(e);return i>=s?Math.round(e/s)+"d":i>=n?Math.round(e/n)+"h":i>=r?Math.round(e/r)+"m":i>=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))}},6864:function(e,t,r){"use strict";const n=r(6368),{hasOwnProperty:s}=Object.prototype,{propertyIsEnumerable:i}=Object,o=(e,t,r)=>Object.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)i.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=>{o(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=>{o(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)?o(e,r,p(e[r],t[r],n)):o(e,r,u(t[r])))})),e),d=(e,t,r)=>{let n=e.slice(0,0),i=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._}},7209:(e,t,r)=>{"use strict";e.exports=l,l.className="ReflectionObject";const n=r(1457);var s,i=r(3262),o={enum_type:"OPEN",field_presence:"EXPLICIT",json_format:"ALLOW",message_encoding:"LENGTH_PREFIXED",repeated_field_encoding:"PACKED",utf8_validation:"VERIFY"},a={enum_type:"CLOSED",field_presence:"EXPLICIT",json_format:"LEGACY_BEST_EFFORT",message_encoding:"LENGTH_PREFIXED",repeated_field_encoding:"EXPANDED",utf8_validation:"NONE"},c={enum_type:"OPEN",field_presence:"IMPLICIT",json_format:"ALLOW",message_encoding:"LENGTH_PREFIXED",repeated_field_encoding:"PACKED",utf8_validation:"VERIFY"};function l(e,t){if(!i.isString(e))throw TypeError("name must be a string");if(t&&!i.isObject(t))throw TypeError("options must be an object");this.options=t,this.parsedOptions=null,this.name=e,this._edition=null,this._defaultEdition="proto2",this._features={},this.parent=null,this.resolved=!1,this.comment=null,this.filename=null}Object.defineProperties(l.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(".")}}}),l.prototype.toJSON=function(){throw Error()},l.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 s&&t._handleAdd(this)},l.prototype.onRemove=function(e){var t=e.root;t instanceof s&&t._handleRemove(this),this.parent=null,this.resolved=!1},l.prototype.resolve=function(){return this.resolved||this instanceof s&&(this._resolveFeaturesRecursive(this._edition),this.resolved=!0),this},l.prototype._resolveFeaturesRecursive=function(e){return this._resolveFeatures(this._edition||e)},l.prototype._resolveFeatures=function(e){var t={};if(!e)throw new Error("Unknown edition for "+this.fullName);var r=Object.assign(this.options?Object.assign({},this.options.features):{},this._inferLegacyProtoFeatures(e));if(this._edition){if("proto2"===e)t=Object.assign({},a);else if("proto3"===e)t=Object.assign({},c);else{if("2023"!==e)throw new Error("Unknown edition: "+e);t=Object.assign({},o)}this._features=Object.assign(t,r||{})}else{if(this.partOf instanceof n){var s=Object.assign({},this.partOf._features);this._features=Object.assign(s,r||{})}else if(this.declaringField);else{if(!this.parent)throw new Error("Unable to find a parent for "+this.fullName);var i=Object.assign({},this.parent._features);this._features=Object.assign(i,r||{})}this.extensionField&&(this.extensionField._features=this._features)}},l.prototype._inferLegacyProtoFeatures=function(){return{}},l.prototype.getOption=function(e){if(this.options)return this.options[e]},l.prototype.setOption=function(e,t,r){return this.options||(this.options={}),/^features\./.test(e)?i.setProperty(this.options,e,t,r):r&&void 0!==this.options[e]||(this.getOption(e)!==t&&(this.resolved=!1),this.options[e]=t),this},l.prototype.setParsedOption=function(e,t,r){this.parsedOptions||(this.parsedOptions=[]);var n=this.parsedOptions;if(r){var s=n.find((function(t){return Object.prototype.hasOwnProperty.call(t,e)}));if(s){var o=s[e];i.setProperty(o,r,t)}else(s={})[e]=i.setProperty({},r,t),n.push(s)}else{var a={};a[e]=t,n.push(a)}return this},l.prototype.setOptions=function(e,t){if(e)for(var r=Object.keys(e),n=0;n{"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,i,o){if(!i)throw TypeError("request must be specified");var a=this;if(!o)return n.asPromise(e,a,t,r,s,i);if(a.rpcImpl)try{return a.rpcImpl(t,r[a.requestDelimited?"encodeDelimited":"encode"](i).finish(),(function(e,r){if(e)return a.emit("error",e,t),o(e);if(null!==r){if(!(r instanceof s))try{r=s[a.responseDelimited?"decodeDelimited":"decode"](r)}catch(e){return a.emit("error",e,t),o(e)}return a.emit("data",r,t),o(null,r)}a.end(!0)}))}catch(e){return a.emit("error",e,t),void setTimeout((function(){o(e)}),0)}else setTimeout((function(){o(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}},7728:(e,t,r)=>{"use strict";e.exports=function(e){for(var t=i.codegen(["r","l","e"],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){"),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{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(){if("undefined"!=typeof window&&window.process&&("renderer"===window.process.type||window.process.__nwjs))return!0;if("undefined"!=typeof navigator&&navigator.userAgent&&navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))return!1;let e;return"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&&(e=navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/))&&parseInt(e[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}}},7882:(e,t,r)=>{"use strict";e.exports=b;var n=r(8923);((b.prototype=Object.create(n.prototype)).constructor=b).className="Type";var s=r(5643),i=r(1457),o=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),m=r(744),y=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{t._resolveFeatures(e)})),this.fieldsArray.forEach((t=>{t._resolveFeatures(e)})),this},b.prototype.get=function(e){return this.fields[e]||this.oneofs&&this.oneofs[e]||this.nested&&this.nested[e]||null},b.prototype.add=function(e){if(this.get(e.name))throw Error("duplicate name '"+e.name+"' in "+this);if(e instanceof o&&void 0===e.extend){if(this._fieldsById?this._fieldsById[e.id]:this.fieldsById[e.id])throw Error("duplicate id "+e.id+" in "+this);if(this.isReservedId(e.id))throw Error("id "+e.id+" is reserved in "+this);if(this.isReservedName(e.name))throw Error("name '"+e.name+"' is reserved in "+this);return e.parent&&e.parent.remove(e),this.fields[e.name]=e,e.message=this,e.onAdd(this),w(this)}return e instanceof i?(this.oneofs||(this.oneofs={}),this.oneofs[e.name]=e,e.onAdd(this),w(this)):n.prototype.add.call(this,e)},b.prototype.remove=function(e){if(e instanceof o&&void 0===e.extend){if(!this.fields||this.fields[e.name]!==e)throw Error(e+" is not a member of "+this);return delete this.fields[e.name],e.parent=null,e.onRemove(this),w(this)}if(e instanceof i){if(!this.oneofs||this.oneofs[e.name]!==e)throw Error(e+" is not a member of "+this);return delete this.oneofs[e.name],e.parent=null,e.onRemove(this),w(this)}return n.prototype.remove.call(this,e)},b.prototype.isReservedId=function(e){return n.isReservedId(this.reserved,e)},b.prototype.isReservedName=function(e){return n.isReservedName(this.reserved,e)},b.prototype.create=function(e){return new this.ctor(e)},b.prototype.setup=function(){for(var e=this.fullName,t=[],r=0;r{"use strict";e.exports=function(e,t){for(var r=new Array(arguments.length-1),n=0,s=2,i=!0;s{"use strict";e.exports=o;var n=r(1344);((o.prototype=Object.create(n.prototype)).constructor=o).className="MapField";var s=r(361),i=r(3262);function o(e,t,r,s,o,a){if(n.call(this,e,t,s,void 0,void 0,o,a),!i.isString(r))throw TypeError("keyType must be a string");this.keyType=r,this.resolvedKeyType=null,this.map=!0}o.fromJSON=function(e,t){return new o(e,t.id,t.keyType,t.type,t.options,t.comment)},o.prototype.toJSON=function(e){var t=!!e&&Boolean(e.keepComments);return i.toObject(["keyType",this.keyType,"type",this.type,"id",this.id,"extend",this.extend,"options",this.options,"comment",t?this.comment:void 0])},o.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)},o.d=function(e,t,r){return"function"==typeof r?r=i.decorateType(r).name:r&&"object"==typeof r&&(r=i.decorateEnum(r).name),function(n,s){i.decorateType(n.constructor).add(new o(s,e,t,r))}}},8303:(e,t,r)=>{var n=r(3961);t.operation=function(e){var r=t.timeouts(e);return new n(r,{forever:e&&(e.forever||e.retries===1/0),unref:e&&e.unref,maxRetryTime:e&&e.maxRetryTime})},t.timeouts=function(e){if(e instanceof Array)return[].concat(e);var t={retries:10,factor:2,minTimeout:1e3,maxTimeout:1/0,randomize:!1};for(var r in e)t[r]=e[r];if(t.minTimeout>t.maxTimeout)throw new Error("minTimeout is greater than maxTimeout");for(var n=[],s=0;s{"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=i();if(t.verbose&&console.log("codegen: "+r),r="return "+r,e){for(var o=Object.keys(e),a=new Array(o.length+1),c=new Array(o.length),l=0;l{"use strict";e.exports=i;var n=r(7209);((i.prototype=Object.create(n.prototype)).constructor=i).className="Method";var s=r(3262);function i(e,t,r,i,o,a,c,l,u){if(s.isObject(o)?(c=o,o=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(i))throw TypeError("responseType must be a string");n.call(this,e,c),this.type=t||"rpc",this.requestType=r,this.requestStream=!!o||void 0,this.responseType=i,this.responseStream=!!a||void 0,this.resolvedRequestType=null,this.resolvedResponseType=null,this.comment=l,this.parsedOptions=u}i.fromJSON=function(e,t){return new i(e,t.type,t.requestType,t.responseType,t.requestStream,t.responseStream,t.options,t.comment,t.parsedOptions)},i.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])},i.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))}},8839:(e,t)=>{"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),i=0;i<64;)s[n[i]=i<26?i+65:i<52?i+71:i<62?i-4:i-59|43]=i++;r.encode=function(e,t,r){for(var s,i=null,o=[],a=0,c=0;t>2],s=(3&l)<<4,c=1;break;case 1:o[a++]=n[s|l>>4],s=(15&l)<<2,c=2;break;case 2:o[a++]=n[s|l>>6],o[a++]=n[63&l],c=0}a>8191&&((i||(i=[])).push(String.fromCharCode.apply(String,o)),a=0)}return c&&(o[a++]=n[s],o[a++]=61,1===c&&(o[a++]=61)),i?(a&&i.push(String.fromCharCode.apply(String,o.slice(0,a))),i.join("")):String.fromCharCode.apply(String,o.slice(0,a))};var o="invalid encoding";r.decode=function(e,t,r){for(var n,i=r,a=0,c=0;c1)break;if(void 0===(l=s[l]))throw Error(o);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(o);return r-i},r.test=function(e){return/^(?:[A-Za-z0-9+/]{4})*(?:[A-Za-z0-9+/]{2}==|[A-Za-z0-9+/]{3}=)?$/.test(e)}},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,i,o,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(){var e=this.nestedArray,t=0;for(this.resolve();t{t._resolveFeaturesRecursive(e)})),this},h.prototype.lookup=function(e,t,r){if("boolean"==typeof t?(r=t,t=void 0):t&&!Array.isArray(t)&&(t=[t]),c.isString(e)&&e.length){if("."===e)return this.root;e=e.split(".")}else if(!e.length)return this;if(""===e[0])return this.root.lookup(e.slice(1),t);var n=this.get(e[0]);if(n){if(1===e.length){if(!t||t.indexOf(n.constructor)>-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";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)},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 i=0;i0&&".."!==t[i-1]?t.splice(--i,2):r?t.splice(i,1):++i:"."===t[i]?t.splice(i,1):++i;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,i=null,o=n;return function(r){if(r<1||r>s)return e(r);o+r>n&&(i=e(n),o=0);var a=t.call(i,o,o+=r);return 7&o&&(o=1+(7|o)),a}}},9410:e=>{"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 i(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 o(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:i,e.writeFloatBE=n?i:s,e.readFloatLE=n?o:a,e.readFloatBE=n?a:o}():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 i=Math.floor(Math.log(t)/Math.LN2);e((s<<31|i+127<<23|8388607&Math.round(t*Math.pow(2,-i)*8388608))>>>0,r,n)}}function o(e,t,r){var n=e(t,r),s=2*(n>>31)+1,i=n>>>23&255,o=8388607&n;return 255===i?o?NaN:s*(1/0):0===i?1401298464324817e-60*s*o:s*Math.pow(2,i-150)*(o+8388608)}e.writeFloatLE=t.bind(null,r),e.writeFloatBE=t.bind(null,n),e.readFloatLE=o.bind(null,s),e.readFloatBE=o.bind(null,i)}(),"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 i(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 o(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:i,e.writeDoubleBE=n?i:s,e.readDoubleLE=n?o:a,e.readDoubleBE=n?a:o}():function(){function t(e,t,r,n,s,i){var o=n<0?1:0;if(o&&(n=-n),0===n)e(0,s,i+t),e(1/n>0?0:2147483648,s,i+r);else if(isNaN(n))e(0,s,i+t),e(2146959360,s,i+r);else if(n>17976931348623157e292)e(0,s,i+t),e((o<<31|2146435072)>>>0,s,i+r);else{var a;if(n<22250738585072014e-324)e((a=n/5e-324)>>>0,s,i+t),e((o<<31|a/4294967296)>>>0,s,i+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,i+t),e((o<<31|c+1023<<20|1048576*a&1048575)>>>0,s,i+r)}}}function o(e,t,r,n,s){var i=e(n,s+t),o=e(n,s+r),a=2*(o>>31)+1,c=o>>>20&2047,l=4294967296*(1048575&o)+i;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=o.bind(null,s,0,4),e.readDoubleBE=o.bind(null,i,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 i(e,t){return(e[t]<<24|e[t+1]<<16|e[t+2]<<8|e[t+3])>>>0}e.exports=t(t)},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),i=r(3262),o=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),i=0;i{t._resolveFeaturesRecursive(e)})),this},a.prototype.add=function(e){if(this.get(e.name))throw Error("duplicate name '"+e.name+"' in "+this);return e instanceof s?(this.methods[e.name]=e,e.parent=this,c(this)):n.prototype.add.call(this,e)},a.prototype.remove=function(e){if(e instanceof s){if(this.methods[e.name]!==e)throw Error(e+" is not a member of "+this);return delete this.methods[e.name],e.parent=null,c(this)}return n.prototype.remove.call(this,e)},a.prototype.create=function(e,t,r){for(var n,s=new o.Service(e,t,r),a=0;a{"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}},__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:()=>re});var t={};__webpack_require__.r(t),__webpack_require__.d(t,{base16:()=>ne,base16upper:()=>se});var r={};__webpack_require__.r(r),__webpack_require__.d(r,{base2:()=>ie});var n={};__webpack_require__.r(n),__webpack_require__.d(n,{base256emoji:()=>le});var s={};__webpack_require__.r(s),__webpack_require__.d(s,{base32:()=>ue,base32hex:()=>fe,base32hexpad:()=>me,base32hexpadupper:()=>ye,base32hexupper:()=>ge,base32pad:()=>de,base32padupper:()=>pe,base32upper:()=>he,base32z:()=>be});var i={};__webpack_require__.r(i),__webpack_require__.d(i,{base36:()=>we,base36upper:()=>ve});var o={};__webpack_require__.r(o),__webpack_require__.d(o,{base58btc:()=>Ee,base58flickr:()=>Se});var a={};__webpack_require__.r(a),__webpack_require__.d(a,{base64:()=>Ae,base64pad:()=>Ie,base64url:()=>ke,base64urlpad:()=>xe});var c={};__webpack_require__.r(c),__webpack_require__.d(c,{base8:()=>Ce});var l={};__webpack_require__.r(l),__webpack_require__.d(l,{identity:()=>_e});var u={};__webpack_require__.r(u),__webpack_require__.d(u,{code:()=>Re,decode:()=>Oe,encode:()=>Ne,name:()=>Le});var h={};__webpack_require__.r(h),__webpack_require__.d(h,{code:()=>Me,decode:()=>Be,encode:()=>Fe,name:()=>De});var d={};__webpack_require__.r(d),__webpack_require__.d(d,{identity:()=>at});var p={};function f(e=0){return new Uint8Array(e)}function g(e=0){return new Uint8Array(e)}__webpack_require__.r(p),__webpack_require__.d(p,{sha256:()=>ht,sha512:()=>dt});const m=Math.pow(2,7),y=Math.pow(2,14),b=Math.pow(2,21),w=Math.pow(2,28),v=Math.pow(2,35),E=Math.pow(2,42),S=Math.pow(2,49),A=128,I=127;function k(e){if(eNumber.MAX_SAFE_INTEGER)throw new RangeError("Could not encode varint");return 8}function x(e,t,r=0){switch(k(e)){case 8:t[r++]=255&e|A,e/=128;case 7:t[r++]=255&e|A,e/=128;case 6:t[r++]=255&e|A,e/=128;case 5:t[r++]=255&e|A,e/=128;case 4:t[r++]=255&e|A,e>>>=7;case 3:t[r++]=255&e|A,e>>>=7;case 2:t[r++]=255&e|A,e>>>=7;case 1:t[r++]=255&e,e>>>=7;break;default:throw new Error("unreachable")}return t}function C(e,t){let r=e[t],n=0;if(n+=r&I,r>>=7;case 3:t.set(r++,255&e|A),e>>>=7;case 2:t.set(r++,255&e|A),e>>>=7;case 1:t.set(r++,255&e),e>>>=7;break;default:throw new Error("unreachable")}return t}(e,t,r)}function T(e,t=0){return e instanceof Uint8Array?C(e,t):function(e,t){let r=e.get(t),n=0;if(n+=r&I,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 U;if(eF)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>$&&(n=0n,++r>$&&(r=0n))),new B(Number(n),Number(r))}static fromNumber(e){if(0===e)return U;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 B(r,n)}static from(e){return"number"==typeof e?B.fromNumber(e):"bigint"==typeof e?B.fromBigInt(e):"string"==typeof e?B.fromBigInt(BigInt(e)):null!=e.low||null!=e.high?new B(e.low>>>0,e.high>>>0):U}}const U=new B(0,0);U.toBigInt=function(){return 0n},U.zzEncode=U.zzDecode=function(){return this},U.length=function(){return 1};const $=4294967296n;function q(e,t,r){const n=r;let s,i;for(let n=0;n>6|192,t[r++]=63&s|128):55296==(64512&s)&&56320==(64512&(i=e.charCodeAt(n+1)))?(s=65536+((1023&s)<<10)+(1023&i),++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 j(e,t){return RangeError(`index out of range: ${e.pos} + ${t??1} > ${e.len}`)}function z(e,t){return(e[t-4]|e[t-3]<<8|e[t-2]<<16|e[t-1]<<24)>>>0}class H{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,j(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 j(this,4);return z(this.buf,this.pos+=4)}sfixed32(){if(this.pos+4>this.len)throw j(this,4);return 0|z(this.buf,this.pos+=4)}float(){if(this.pos+4>this.len)throw j(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],P[0]);var t,r;return this.pos+=4,e}double(){if(this.pos+8>this.len)throw j(this,4);const e=(t=this.buf,r=this.pos,O[0]=t[r],O[1]=t[r+1],O[2]=t[r+2],O[3]=t[r+3],O[4]=t[r+4],O[5]=t[r+5],O[6]=t[r+6],O[7]=t[r+7],N[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 j(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 i,o=0;for(;t191&&i<224?s[o++]=(31&i)<<6|63&e[t++]:i>239&&i<365?(i=((7&i)<<18|(63&e[t++])<<12|(63&e[t++])<<6|63&e[t++])-65536,s[o++]=55296+(i>>10),s[o++]=56320+(1023&i)):s[o++]=(15&i)<<12|(63&e[t++])<<6|63&e[t++],o>8191&&((n??(n=[])).push(String.fromCharCode.apply(String,s)),o=0);return null!=n?(o>0&&n.push(String.fromCharCode.apply(String,s.slice(0,o))),n.join("")):String.fromCharCode.apply(String,s.slice(0,o))}(e,0,e.length)}skip(e){if("number"==typeof e){if(this.pos+e>this.len)throw j(this,e);this.pos+=e}else do{if(this.pos>=this.len)throw j(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 B(0,0);let t=0;if(!(this.len-this.pos>4)){for(;t<3;++t){if(this.pos>=this.len)throw j(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 j(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 j(this,8);const e=z(this.buf,this.pos+=4),t=z(this.buf,this.pos+=4);return new B(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=C(this.buf,this.pos);return this.pos+=k(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 K(e,t,r){const n=function(e){return new H(e instanceof Uint8Array?e:e.subarray())}(e);return t.decode(n,void 0,r)}function V(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 G=function(e,t){if(e.length>=255)throw new TypeError("Alphabet too long");for(var r=new Uint8Array(256),n=0;n>>0,o=new Uint8Array(i);e[t];){var u=r[e.charCodeAt(t)];if(255===u)return;for(var h=0,d=i-1;(0!==u||h>>0,o[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=i-s;p!==i&&0===o[p];)p++;for(var f=new Uint8Array(n+(i-p)),g=n;p!==i;)f[g++]=o[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,i=t.length;s!==i&&0===t[s];)s++,r++;for(var o=(i-s)*u+1>>>0,l=new Uint8Array(o);s!==i;){for(var h=t[s],d=0,p=o-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=o-n;f!==o&&0===l[f];)f++;for(var g=c.repeat(r);fV(s(e))})}function te({name:e,prefix:t,bitsPerChar:r,alphabet:n}){return Y({prefix:t,name:e,encode:e=>function(e,t,r){const n="="===t[t.length-1],s=(1<r;)o-=r,i+=t[s&a>>o];if(0!==o&&(i+=t[s&a<function(e,t,r,n){const s={};for(let e=0;e=8&&(a-=8,o[l++]=255&c>>a)}if(a>=r||255&c<<8-a)throw new SyntaxError("Unexpected end of data");return o}(t,n,r,e)})}const re=ee({prefix:"9",name:"base10",alphabet:"0123456789"}),ne=te({prefix:"f",name:"base16",alphabet:"0123456789abcdef",bitsPerChar:4}),se=te({prefix:"F",name:"base16upper",alphabet:"0123456789ABCDEF",bitsPerChar:4}),ie=te({prefix:"0",name:"base2",alphabet:"01",bitsPerChar:1}),oe=Array.from("🚀🪐☄🛰🌌🌑🌒🌓🌔🌕🌖🌗🌘🌍🌏🌎🐉☀💻🖥💾💿😂❤😍🤣😊🙏💕😭😘👍😅👏😁🔥🥰💔💖💙😢🤔😆🙄💪😉☺👌🤗💜😔😎😇🌹🤦🎉💞✌✨🤷😱😌🌸🙌😋💗💚😏💛🙂💓🤩😄😀🖤😃💯🙈👇🎶😒🤭❣😜💋👀😪😑💥🙋😞😩😡🤪👊🥳😥🤤👉💃😳✋😚😝😴🌟😬🙃🍀🌷😻😓⭐✅🥺🌈😈🤘💦✔😣🏃💐☹🎊💘😠☝😕🌺🎂🌻😐🖕💝🙊😹🗣💫💀👑🎵🤞😛🔴😤🌼😫⚽🤙☕🏆🤫👈😮🙆🍻🍃🐶💁😲🌿🧡🎁⚡🌞🎈❌✊👋😰🤨😶🤝🚶💰🍓💢🤟🙁🚨💨🤬✈🎀🍺🤓😙💟🌱😖👶🥴▶➡❓💎💸⬇😨🌚🦋😷🕺⚠🙅😟😵👎🤲🤠🤧📌🔵💅🧐🐾🍒😗🤑🌊🤯🐷☎💧😯💆👆🎤🙇🍑❄🌴💣🐸💌📍🥀🤢👅💡💩👐📸👻🤐🤮🎼🥵🚩🍎🍊👼💍📣🥂"),ae=oe.reduce(((e,t,r)=>(e[r]=t,e)),[]),ce=oe.reduce(((e,t,r)=>{const n=t.codePointAt(0);if(null==n)throw new Error(`Invalid character: ${t}`);return e[n]=r,e}),[]),le=Y({prefix:"🚀",name:"base256emoji",encode:function(e){return e.reduce(((e,t)=>e+ae[t]),"")},decode:function(e){const t=[];for(const r of e){const e=r.codePointAt(0);if(null==e)throw new Error(`Invalid character: ${r}`);const n=ce[e];if(null==n)throw new Error(`Non-base256emoji character: ${r}`);t.push(n)}return new Uint8Array(t)}}),ue=te({prefix:"b",name:"base32",alphabet:"abcdefghijklmnopqrstuvwxyz234567",bitsPerChar:5}),he=te({prefix:"B",name:"base32upper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567",bitsPerChar:5}),de=te({prefix:"c",name:"base32pad",alphabet:"abcdefghijklmnopqrstuvwxyz234567=",bitsPerChar:5}),pe=te({prefix:"C",name:"base32padupper",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZ234567=",bitsPerChar:5}),fe=te({prefix:"v",name:"base32hex",alphabet:"0123456789abcdefghijklmnopqrstuv",bitsPerChar:5}),ge=te({prefix:"V",name:"base32hexupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV",bitsPerChar:5}),me=te({prefix:"t",name:"base32hexpad",alphabet:"0123456789abcdefghijklmnopqrstuv=",bitsPerChar:5}),ye=te({prefix:"T",name:"base32hexpadupper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUV=",bitsPerChar:5}),be=te({prefix:"h",name:"base32z",alphabet:"ybndrfg8ejkmcpqxot1uwisza345h769",bitsPerChar:5}),we=ee({prefix:"k",name:"base36",alphabet:"0123456789abcdefghijklmnopqrstuvwxyz"}),ve=ee({prefix:"K",name:"base36upper",alphabet:"0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ"}),Ee=ee({name:"base58btc",prefix:"z",alphabet:"123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz"}),Se=ee({name:"base58flickr",prefix:"Z",alphabet:"123456789abcdefghijkmnopqrstuvwxyzABCDEFGHJKLMNPQRSTUVWXYZ"}),Ae=te({prefix:"m",name:"base64",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/",bitsPerChar:6}),Ie=te({prefix:"M",name:"base64pad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=",bitsPerChar:6}),ke=te({prefix:"u",name:"base64url",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_",bitsPerChar:6}),xe=te({prefix:"U",name:"base64urlpad",alphabet:"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_=",bitsPerChar:6}),Ce=te({prefix:"7",name:"base8",alphabet:"01234567",bitsPerChar:3}),_e=Y({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)}),Te=new TextEncoder,Pe=new TextDecoder,Le="json",Re=512;function Ne(e){return Te.encode(JSON.stringify(e))}function Oe(e){return JSON.parse(Pe.decode(e))}const De="raw",Me=85;function Fe(e){return V(e)}function Be(e){return V(e)}var Ue=128,$e=-128,qe=Math.pow(2,31),je=128,ze=127,He=Math.pow(2,7),Ke=Math.pow(2,14),Ve=Math.pow(2,21),Ge=Math.pow(2,28),We=Math.pow(2,35),Xe=Math.pow(2,42),Je=Math.pow(2,49),Qe=Math.pow(2,56),Ze=Math.pow(2,63);const Ye={encode:function e(t,r,n){r=r||[];for(var s=n=n||0;t>=qe;)r[n++]=255&t|Ue,t/=128;for(;t&$e;)r[n++]=255&t|Ue,t>>>=7;return r[n]=0|t,e.bytes=n-s+1,r},decode:function e(t,r){var n,s=0,i=0,o=r=r||0,a=t.length;do{if(o>=a)throw e.bytes=0,new RangeError("Could not decode varint");n=t[o++],s+=i<28?(n&ze)<=je);return e.bytes=o-r,s},encodingLength:function(e){return ent(this.code,e)))}throw Error("Unknown type, must be binary type")}}function ut(e){return async t=>new Uint8Array(await crypto.subtle.digest(e,t))}const ht=ct({name:"sha2-256",code:18,encode:ut("SHA-256")}),dt=ct({name:"sha2-512",code:19,encode:ut("SHA-512")});function pt(e,t){const{bytes:r,version:n}=e;return 0===n?function(e,t,r){const{prefix:n}=r;if(n!==Ee.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,gt(e),t??Ee.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,gt(e),t??ue.encoder)}const ft=new WeakMap;function gt(e){const t=ft.get(e);if(null==t){const t=new Map;return ft.set(e,t),t}return t}class mt{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!==yt)throw new Error("Cannot convert a non dag-pb CID to CIDv0");if(t.code!==bt)throw new Error("Cannot convert non sha2-256 multihash CID to CIDv0");return mt.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=nt(e,t);return mt.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 mt.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]=et(e.subarray(t));return t+=n,r};let n=r(),s=yt;if(18===n?(n=0,t=0):s=r(),0!==n&&1!==n)throw new RangeError(`Invalid CID version ${n}`);const i=t,o=r(),a=r(),c=t+a;return{version:n,codec:s,multihashCode:o,digestSize:a,multihashSize:c-i,size:c}}static parse(e,t){const[r,n]=function(e,t){switch(e[0]){case"Q":{const r=t??Ee;return[Ee.prefix,r.decode(`${Ee.prefix}${e}`)]}case Ee.prefix:{const r=t??Ee;return[Ee.prefix,r.decode(e)]}case ue.prefix:{const r=t??ue;return[ue.prefix,r.decode(e)]}case we.prefix:{const r=t??we;return[we.prefix,r.decode(e)]}default:if(null==t)throw Error("To parse non base32, base36 or base58btc encoded CID multibase decoder must be provided");return[e[0],t.decode(e)]}}(e,t),s=mt.decode(n);if(0===s.version&&"Q"!==e[0])throw Error("Version 0 CID string must not include multibase prefix");return gt(s).set(r,e),s}}const yt=112,bt=18;function wt(e,t,r){const n=rt(e),s=n+rt(t),i=new Uint8Array(s+r.byteLength);return tt(e,i,0),tt(t,i,n),i.set(r,s),i}const vt=Symbol.for("@ipld/js-cid/CID"),Et={...l,...r,...c,...e,...t,...s,...i,...o,...a,...n};function St(e,t,r,n){return{name:e,prefix:t,encoder:{name:e,prefix:t,encode:r},decoder:{decode:n}}}const At=St("utf8","u",(e=>"u"+new TextDecoder("utf8").decode(e)),(e=>(new TextEncoder).encode(e.substring(1)))),It=St("ascii","a",(e=>{let t="a";for(let r=0;r{const t=g((e=e.substring(1)).length);for(let r=0;r4096)return g(n);r+n>e&&(t=g(e),r=0);const s=t.subarray(r,r+=n);return 7&r&&(r=1+(7|r)),s}}();class Lt{len;head;tail;states;constructor(){this.len=0,this.head=new Ct(_t,0,0),this.tail=this.head,this.states=null}_push(e,t,r){return this.tail=this.tail.next=new Ct(e,t,r),this.len+=t,this}uint32(e){return this.len+=(this.tail=this.tail.next=new Ot((e>>>=0)<128?1:e<16384?2:e<2097152?3:e<268435456?4:5,e)).len,this}int32(e){return e<0?this._push(Dt,10,B.fromNumber(e)):this.uint32(e)}sint32(e){return this.uint32((e<<1^e>>31)>>>0)}uint64(e){const t=B.fromBigInt(e);return this._push(Dt,t.length(),t)}uint64Number(e){return this._push(x,k(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=B.fromBigInt(e).zzEncode();return this._push(Dt,t.length(),t)}sint64Number(e){const t=B.fromNumber(e).zzEncode();return this._push(Dt,t.length(),t)}sint64String(e){return this.sint64(BigInt(e))}bool(e){return this._push(Rt,1,e?1:0)}fixed32(e){return this._push(Mt,4,e>>>0)}sfixed32(e){return this.fixed32(e)}fixed64(e){const t=B.fromBigInt(e);return this._push(Mt,4,t.lo)._push(Mt,4,t.hi)}fixed64Number(e){const t=B.fromNumber(e);return this._push(Mt,4,t.lo)._push(Mt,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(R,4,e)}double(e){return this._push(D,8,e)}bytes(e){const t=e.length>>>0;return 0===t?this._push(Rt,1,0):this.uint32(t)._push(Ft,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 Ot extends Ct{next;constructor(e,t){super(Nt,e,t),this.next=void 0}}function Dt(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 Mt(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 Ft(e,t,r){t.set(e,r)}function Bt(e,t,r){t.set(e,r)}function Ut(e,t,r){e.length<40?q(e,t,r):null!=t.utf8Write?t.utf8Write(e,r):t.set(xt(e),r)}function $t(e,t){const r=new Lt;return t.encode(e,r,{lengthDelimited:!1}),r.finish()}var qt,jt,zt,Ht,Kt,Vt,Gt,Wt,Xt,Jt,Qt,Zt,Yt,er,tr,rr,nr,sr,ir,or,ar,cr,lr,ur,hr,dr,pr,fr,gr,mr,yr,br;function wr(e,t,r,n){return{name:e,type:t,encode:r,decode:n}}function vr(e){function t(t){if(null==e[t.toString()])throw new Error("Invalid enum value");return e[t]}return wr("enum",qt.VARINT,(function(e,r){const n=t(e);r.int32(n)}),(function(e){return t(e.int32())}))}function Er(e,t){return wr("message",qt.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(Bt,t,e),this},Lt.prototype.string=function(e){const t=globalThis.Buffer.byteLength(e);return this.uint32(t),t>0&&this._push(Ut,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"}(qt||(qt={})),Error;class Sr extends Error{code="ERR_MAX_LENGTH";name="MaxLengthError"}class Ar extends Error{code="ERR_MAX_SIZE";name="MaxSizeError"}function Ir(e){return Boolean(e)}function kr(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 xr(e){return new Promise((t=>{setTimeout(t,e)}))}!function(e){let t;e.codec=()=>(null==t&&(t=Er(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(jt||(jt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),jt.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:f(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=jt.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(zt||(zt={})),function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=Er(((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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(t=e.ContentFilter||(e.ContentFilter={})),e.codec=()=>(null==r&&(r=Er(((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:[]},i=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 Sr('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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Ht||(Ht={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.messages)for(const r of e.messages)t.uint32(10),Wt.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 Sr('Decode error - map field "messages" had too many elements');n.messages.push(Wt.codec().decode(e,e.uint32(),{limits:r.limits?.messages$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Kt||(Kt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),Ht.codec().encode(e.request,t)),null!=e.push&&(t.uint32(26),Kt.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=Ht.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.push=Kt.codec().decode(e,e.uint32(),{limits:r.limits?.push});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Vt||(Vt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Gt||(Gt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),Gt.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:f(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=Gt.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Wt||(Wt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Xt||(Xt={})),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=()=>vr(r)}(t=e.FilterSubscribeType||(e.FilterSubscribeType={})),e.codec=()=>(null==n&&(n=Er(((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 i={requestId:"",filterSubscribeType:t.SUBSCRIBER_PING,contentTopics:[]},o=null==n?r.len:r.pos+n;for(;r.pos>>3){case 1:i.requestId=r.string();break;case 2:i.filterSubscribeType=e.FilterSubscribeType.codec().decode(r);break;case 10:i.pubsubTopic=r.string();break;case 11:if(null!=s.limits?.contentTopics&&i.contentTopics.length===s.limits.contentTopics)throw new Sr('Decode error - map field "contentTopics" had too many elements');i.contentTopics.push(r.string());break;default:r.skipType(7&t)}}return i}))),n),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Jt||(Jt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Qt||(Qt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.wakuMessage&&(t.uint32(10),er.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=er.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Zt||(Zt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Yt||(Yt={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),Yt.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:f(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=Yt.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(er||(er={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),ir.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=ir.codec().decode(e,e.uint32(),{limits:r.limits?.message});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(tr||(tr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(rr||(rr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),tr.codec().encode(e.request,t)),null!=e.response&&(t.uint32(26),rr.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=tr.codec().decode(e,e.uint32(),{limits:r.limits?.request});break;case 3:n.response=rr.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(nr||(nr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(sr||(sr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),sr.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:f(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=sr.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(ir||(ir={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.messageHash&&(t.uint32(10),t.bytes(e.messageHash)),null!=e.message&&(t.uint32(18),ur.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=ur.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(or||(or={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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 Sr('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 Sr('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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(ar||(ar={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),or.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 Sr('Decode error - map field "messages" had too many elements');n.messages.push(or.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(cr||(cr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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:f(0),merkleRoot:f(0),epoch:f(0),shareX:f(0),shareY:f(0),nullifier:f(0),rlnIdentifier:f(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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(lr||(lr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),lr.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:f(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=lr.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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(ur||(ur={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(hr||(hr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(dr||(dr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.peerInfos)for(const r of e.peerInfos)t.uint32(10),hr.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 Sr('Decode error - map field "peerInfos" had too many elements');n.peerInfos.push(hr.codec().decode(e,e.uint32(),{limits:r.limits?.peerInfos$}))}else e.skipType(7&t)}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(pr||(pr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.query&&(t.uint32(10),dr.codec().encode(e.query,t)),null!=e.response&&(t.uint32(18),pr.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=dr.codec().decode(e,e.uint32(),{limits:r.limits?.query});break;case 2:n.response=pr.codec().decode(e,e.uint32(),{limits:r.limits?.response});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(fr||(fr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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 Sr('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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(gr||(gr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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 Sr('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=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(mr||(mr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.messageId&&""!==e.messageId&&(t.uint32(10),t.string(e.messageId)),null!=e.retrievalHint&&(t.uint32(18),t.bytes(e.retrievalHint)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={messageId:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.messageId=e.string();break;case 2:n.retrievalHint=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(yr||(yr={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{if(!1!==r.lengthDelimited&&t.fork(),null!=e.messageId&&""!==e.messageId&&(t.uint32(18),t.string(e.messageId)),null!=e.channelId&&""!==e.channelId&&(t.uint32(26),t.string(e.channelId)),null!=e.lamportTimestamp&&(t.uint32(80),t.int32(e.lamportTimestamp)),null!=e.causalHistory)for(const r of e.causalHistory)t.uint32(90),yr.codec().encode(r,t);null!=e.bloomFilter&&(t.uint32(98),t.bytes(e.bloomFilter)),null!=e.content&&(t.uint32(162),t.bytes(e.content)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={messageId:"",channelId:"",causalHistory:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 2:n.messageId=e.string();break;case 3:n.channelId=e.string();break;case 10:n.lamportTimestamp=e.int32();break;case 11:if(null!=r.limits?.causalHistory&&n.causalHistory.length===r.limits.causalHistory)throw new Sr('Decode error - map field "causalHistory" had too many elements');n.causalHistory.push(yr.codec().decode(e,e.uint32(),{limits:r.limits?.causalHistory$}));break;case 12:n.bloomFilter=e.bytes();break;case 20:n.content=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(br||(br={}));function Cr(e){if(!Number.isSafeInteger(e)||e<0)throw new Error("positive integer expected, got "+e)}function _r(e,...t){if(!((r=e)instanceof Uint8Array||ArrayBuffer.isView(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+", got length="+e.length)}function Tr(e){if("function"!=typeof e||"function"!=typeof e.create)throw new Error("Hash should be wrapped by utils.wrapConstructor");Cr(e.outputLen),Cr(e.blockLen)}function Pr(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 Lr="object"==typeof globalThis&&"crypto"in globalThis?globalThis.crypto:void 0;function Rr(e){return new DataView(e.buffer,e.byteOffset,e.byteLength)}function Nr(e,t){return e<<32-t|e>>>t}function Or(e){return"string"==typeof e&&(e=function(e){if("string"!=typeof e)throw new Error("utf8ToBytes expected string, got "+typeof e);return new Uint8Array((new TextEncoder).encode(e))}(e)),_r(e),e}"function"==typeof Uint8Array.from([]).toHex&&Uint8Array.fromHex;class Dr{clone(){return this._cloneInto()}}function Mr(e){const t=t=>e().update(Or(t)).digest(),r=e();return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=()=>e(),t}function Fr(e=32){if(Lr&&"function"==typeof Lr.getRandomValues)return Lr.getRandomValues(new Uint8Array(e));if(Lr&&"function"==typeof Lr.randomBytes)return Uint8Array.from(Lr.randomBytes(e));throw new Error("crypto.getRandomValues must be defined")}function Br(e,t,r){return e&t^e&r^t&r}class Ur extends Dr{constructor(e,t,r,n){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=e,this.outputLen=t,this.padOffset=r,this.isLE=n,this.buffer=new Uint8Array(e),this.view=Rr(this.buffer)}update(e){Pr(this);const{view:t,buffer:r,blockLen:n}=this,s=(e=Or(e)).length;for(let i=0;in-i&&(this.process(r,0),i=0);for(let e=i;e>s&i),a=Number(r&i),c=n?4:0,l=n?0:4;e.setUint32(t+c,o,n),e.setUint32(t+l,a,n)}(r,n-8,BigInt(8*this.length),s),this.process(r,0);const o=Rr(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=Nr(r,17)^Nr(r,19)^r>>>10;jr[e]=s+jr[e-7]+n+jr[e-16]|0}let{A:r,B:n,C:s,D:i,E:o,F:a,G:c,H:l}=this;for(let e=0;e<64;e++){const t=l+(Nr(o,6)^Nr(o,11)^Nr(o,25))+((u=o)&a^~u&c)+$r[e]+jr[e]|0,h=(Nr(r,2)^Nr(r,13)^Nr(r,22))+Br(r,n,s)|0;l=c,c=a,a=o,o=i+t|0,i=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,i=i+this.D|0,o=o+this.E|0,a=a+this.F|0,c=c+this.G|0,l=l+this.H|0,this.set(r,n,s,i,o,a,c,l)}roundClean(){jr.fill(0)}destroy(){this.set(0,0,0,0,0,0,0,0),this.buffer.fill(0)}}const Hr=Mr((()=>new zr));var Kr,Vr,Gr,Wr,Xr;!function(e){e.Relay="relay",e.Store="store",e.LightPush="lightpush",e.Filter="filter"}(Kr||(Kr={})),function(e){e.GENERIC_FAIL="Generic error",e.REMOTE_PEER_REJECTED="Remote peer rejected",e.DECODE_FAILED="Failed to decode",e.NO_PEER_AVAILABLE="No peer available",e.NO_STREAM_AVAILABLE="No stream available",e.NO_RESPONSE="No response received",e.ENCODE_FAILED="Failed to encode",e.EMPTY_PAYLOAD="Payload is empty",e.SIZE_TOO_BIG="Size is too big",e.TOPIC_NOT_CONFIGURED="Topic not configured",e.STREAM_ABORTED="Stream aborted",e.RLN_PROOF_GENERATION="Proof generation failed",e.TOPIC_DECODER_MISMATCH="Topic decoder mismatch",e.INVALID_DECODER_TOPICS="Invalid decoder topics"}(Vr||(Vr={})),function(e){e.BOOTSTRAP="bootstrap",e.PEER_EXCHANGE="peer-exchange",e.LOCAL="local-peer-cache"}(Gr||(Gr={})),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"}(Wr||(Wr={})),function(e){e.CONNECTION_STATUS="waku:connection"}(Xr||(Xr={}));const Jr="@waku/bootstrap",Qr={clusterId:1,shards:[0,1,2,3,4,5,6,7,8]};var Zr,Yr;function en(e,t="utf8"){const r=kt[t];if(null==r)throw new Error(`Unsupported encoding "${t}"`);return r.encoder.encode(e).substring(1)}function tn(e){return"string"==typeof e?xt(e.replace(/^0x/i,"").toLowerCase(),"base16"):e}!function(e){e.StatusChange="health:change"}(Zr||(Zr={})),function(e){e.Unhealthy="Unhealthy",e.MinimallyHealthy="MinimallyHealthy",e.SufficientlyHealthy="SufficientlyHealthy"}(Yr||(Yr={}));const rn=e=>en(e,"base16"),nn=e=>en(e,"utf8"),sn=e=>xt(e,"utf8");function on(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 an=e=>{if("contentTopics"in e&&e.contentTopics)return Array.from(new Set(e.contentTopics.map((t=>dn(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??1}/${t}`))))}if("application"in e&&"version"in e)return[dn(`/${e.application}/${e.version}/default/default`,e.clusterId)];throw new Error("Missing required configuration in shard parameters")},cn=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}},ln=e=>{const t=new Set,r=new Set;for(const n of e){const{clusterId:e,shard:s}=cn(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 un(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 hn(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=Hr(on([sn(r),sn(n)])),i=new DataView(s.buffer.slice(-8));return Number(i.getBigUint64(0,!1)%BigInt(t))}function dn(e,t=1,r=8){if(!e)throw Error("Content topic must be specified");return`/waku/2/rs/${t}/${hn(e,r)}`}function pn(e,t){return"string"==typeof t?t:void 0!==t?.shard?(e=>{if(void 0===e.shard)throw new Error("Invalid shard");return`/waku/2/rs/${e.clusterId??1}/${e.shard}`})(t):dn(e,t?.clusterId??1)}const fn=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(i))}}return{clusterId:r,shards:n}},gn=e=>{const{clusterId:t,shards:r}=e,n=r.length>=64?130:3+2*r.length,s=new ArrayBuffer(n),i=new DataView(s);if(i.setUint16(0,t),r.length>=64)for(const e of r){const t=Math.floor(e/8)+2,r=7-e%8;i.setUint8(t,i.getUint8(t)|1<{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 Cn(e,t){null==t&&(t=e.reduce(((e,t)=>e+t.length),0));const r=g(t);let n=0;for(const t of e)r.set(t,n),n+=t.length;return r}function _n(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=Pn(this.bufs,e);return t.buf[t.index]}set(e,t){const r=Pn(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 Cn(r,n)}subarray(e,t){const{bufs:r,length:n}=this._subList(e,t);return 1===r.length?r[0]:Cn(r,n)}sublist(e,t){const{bufs:r,length:n}=this._subList(e,t),s=new Rn;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>=o&&eo&&t<=a;if(c&&l){if(e===o&&t===a){r.push(i);break}const n=e-o;r.push(i.subarray(n,n+(t-e)));break}if(c){if(0===e){r.push(i);continue}r.push(i.subarray(e-o))}else{if(l){if(t===a){r.push(i);break}r.push(i.subarray(0,t-o));break}r.push(i)}}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-i[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=g(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=f(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=f(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=f(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=g(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=f(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=f(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=f(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=f(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=f(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 Rn))return!1;if(e.bufs.length!==this.bufs.length)return!1;for(let t=0;te+t.byteLength),0)),r.length=t,r}}function Nn(e){return null!=e[Symbol.asyncIterator]}const On=e=>{const t=k(e),r=g(t);return _(e,r),On.bytes=t,r};function Dn(e,t){const r=(t=t??{}).lengthEncoder??On;function*n(e){const t=r(e.byteLength);t instanceof Uint8Array?yield t:yield*t,e instanceof Uint8Array?yield e:yield*e}return Nn(e)?async function*(){for await(const t of e)yield*n(t)}():function*(){for(const t of e)yield*n(t)}()}On.bytes=0,Dn.single=(e,t)=>{const r=(t=t??{}).lengthEncoder??On;return new Rn(r(e.byteLength),e)};class Mn extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Fn extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class Bn extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class Un extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}var $n;!function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}($n||($n={}));const qn=e=>{const t=T(e);return qn.bytes=k(t),t};function jn(e,t){const r=new Rn;let n=$n.LENGTH,s=-1;const i=t?.lengthDecoder??qn,o=t?.maxLengthLength??8,a=t?.maxDataLength??4194304;function*c(){for(;r.byteLength>0;){if(n===$n.LENGTH)try{if(s=i(r),s<0)throw new Mn("Invalid message length");if(s>a)throw new Fn("Message length too long");const e=i.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=$n.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>o)throw new Bn("Message length length too long");break}throw e}if(n===$n.DATA){if(r.byteLength0)throw new Un("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new Un("Unexpected end of input")}()}function zn(){const e={};return e.promise=new Promise(((t,r)=>{e.resolve=t,e.reject=r})),e}qn.bytes=0,jn.fromReader=(e,t)=>{let r=1;return jn(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 Hn{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 Kn{size;hwm;head;tail;constructor(e={}){this.hwm=e.splitLimit??16,this.head=new Hn(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 Hn(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 Vn extends Error{type;code;constructor(e,t){super(e??"The operation was aborted"),this.type="aborted",this.code=t??"ABORT_ERR"}}function Gn(e={}){return function(e,t){let r,n,s,i=(t=t??{}).onEnd,o=new Kn,a=zn();const c=e=>null!=n?n(e):(o.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=>(o=new Kn,null!=n?n({error:e}):(o.push({error:e}),r)))(e):c({done:!0}));if(r={[Symbol.asyncIterator](){return this},next:async()=>{try{return o.isEmpty()?s?{done:!0}:await new Promise(((t,s)=>{n=i=>{n=null,o.push(i);try{t(e(o))}catch(e){s(e)}return r}})):e(o)}finally{o.isEmpty()&&queueMicrotask((()=>{a.resolve(),a=zn()}))}},return:()=>(o=new Kn,u(),{done:!0}),throw:e=>(u(e),{done:!0}),push:l,end:u,get readableLength(){return o.size},onEmpty:async e=>{const t=e?.signal;if(t?.throwIfAborted(),o.isEmpty())return;let r,n;null!=t&&(r=new Promise(((e,r)=>{n=()=>{r(new Vn)},t.addEventListener("abort",n)})));try{await Promise.race([a.promise,r])}finally{null!=n&&null!=t&&t?.removeEventListener("abort",n)}}},null==i)return r;const h=r;return r={[Symbol.asyncIterator](){return this},next:()=>h.next(),throw:e=>(h.throw(e),null!=i&&(i(e),i=void 0),{done:!0}),return:()=>(h.return(),null!=i&&(i(),i=void 0),{done:!0}),push:l,end:e=>(h.end(e),null!=i&&(i(e),i=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)}class Wn 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 Xn(e,t,r){if(null==t)return e;if(t.aborted)return e.catch((()=>{})),Promise.reject(new Wn(r?.errorMessage,r?.errorCode,r?.errorName));let n;const s=new Wn(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 Jn{readNext;haveNext;ended;nextResult;error;constructor(){this.ended=!1,this.readNext=zn(),this.haveNext=zn()}[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=zn(),e}async throw(e){return this.ended=!0,this.error=e,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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 this.error??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=zn(),await Xn(this.readNext.promise,t?.signal,t)}}const Qn=function(...e){const t=[];for(const r of e)null==r[Symbol.asyncIterator]&&t.push(r);return t.length===e.length?function*(e){for(const t of e)yield*t}(t):async function*(e){const t=new Jn;(async function(e,t){try{await Promise.all(e.map((async e=>{for await(const r of e)await t.push(r)}))),await t.end()}catch(e){await t.end(e).catch((()=>{}))}})(e,t).catch((()=>{})),yield*t}(e)};function Zn(e,...t){if(null==e)throw new Error("Empty pipeline");if(rs(e)){const t=e;e=()=>t.source}else if(ts(e)||es(e)){const t=e;e=()=>t}const r=[e,...t];if(r.length>1&&rs(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},es=e=>null!=e?.[Symbol.asyncIterator],ts=e=>null!=e?.[Symbol.iterator],rs=e=>null!=e&&null!=e.sink&&null!=e.source,ns=e=>t=>{const r=e.sink(t);if(null!=r?.then){const t=Gn({objectMode:!0});let n;r.then((()=>{t.end()}),(e=>{t.end(e)}));const s=e.source;if(es(s))n=async function*(){yield*s,t.end()};else{if(!ts(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};function ss(e){return e.filter((e=>"open"===e.status)).sort(((e,t)=>t.timeline.open-e.timeline.open)).at(0)}const is="consumed";class os{multicodec;getConnections;addEventListener;log;ongoingCreation=new Set;streamPool=new Map;constructor(e,t,r){this.multicodec=e,this.getConnections=t,this.addEventListener=r,this.log=new bn(`stream-manager:${e}`),this.addEventListener("peer:update",this.handlePeerUpdateStreamPool)}async getStream(e){const t=e.toString(),r=this.streamPool.get(t);r&&(this.streamPool.delete(t),await r);let n=this.getOpenStreamForCodec(e);return n?(this.log.info(`Found existing stream peerId=${t} multicodec=${this.multicodec}`),this.lockStream(t,n),n):(n=await this.createStream(e),this.lockStream(t,n),n)}async createStream(e,t=0){const r=ss(this.getConnections(e));if(!r)throw new Error(`Failed to get a connection to the peer peerId=${e.toString()} multicodec=${this.multicodec}`);let n,s;for(let i=0;i{const{peer:t}=e.detail;t.protocols.includes(this.multicodec)&&(this.getOpenStreamForCodec(t.id)||this.scheduleNewStream(t))};scheduleNewStream(e){this.log.info(`Scheduling creation of a stream for peerId=${e.id.toString()} multicodec=${this.multicodec}`),this.streamPool.has(e.id.toString())&&this.streamPool.delete(e.id.toString()),this.streamPool.set(e.id.toString(),this.createStreamWithLock(e))}getOpenStreamForCodec(e){const t=ss(this.getConnections(e));if(!t)return;const r=t.streams.find((e=>e.protocol===this.multicodec));return r?["done","closed","closing"].includes(r.writeStatus||"")||this.isStreamLocked(r)?void 0:r:void 0}lockStream(e,t){this.log.info(`Locking stream for peerId:${e}\tstreamId:${t.id}`),t.metadata[is]=!0}isStreamLocked(e){return!!e.metadata[is]}}class as{multicodec;components;pubsubTopics;addLibp2pEventListener;removeLibp2pEventListener;streamManager;constructor(e,t,r){this.multicodec=e,this.components=t,this.pubsubTopics=r,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)}}const cs={randomUUID:"undefined"!=typeof crypto&&crypto.randomUUID&&crypto.randomUUID.bind(crypto)};let ls;const us=new Uint8Array(16);function hs(){if(!ls&&(ls="undefined"!=typeof crypto&&crypto.getRandomValues&&crypto.getRandomValues.bind(crypto),!ls))throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");return ls(us)}const ds=[];for(let e=0;e<256;++e)ds.push((e+256).toString(16).slice(1));const ps=function(e,t,r){if(cs.randomUUID&&!t&&!e)return cs.randomUUID();const n=(e=e||{}).random||(e.rng||hs)();if(n[6]=15&n[6]|64,n[8]=63&n[8]|128,t){r=r||0;for(let e=0;e<16;++e)t[r+e]=n[e];return t}return function(e,t=0){return ds[e[t+0]]+ds[e[t+1]]+ds[e[t+2]]+ds[e[t+3]]+"-"+ds[e[t+4]]+ds[e[t+5]]+"-"+ds[e[t+6]]+ds[e[t+7]]+"-"+ds[e[t+8]]+ds[e[t+9]]+"-"+ds[e[t+10]]+ds[e[t+11]]+ds[e[t+12]]+ds[e[t+13]]+ds[e[t+14]]+ds[e[t+15]]}(n)};class fs{proto;constructor(e){this.proto=e}static decode(e){const t=Zt.decode(e);return new fs(t)}encode(){return Zt.encode(this.proto)}get wakuMessage(){return this.proto.wakuMessage}get pubsubTopic(){return this.proto.pubsubTopic}}class gs{proto;constructor(e){this.proto=e}static createSubscribeRequest(e,t){return new gs({requestId:ps(),filterSubscribeType:Jt.FilterSubscribeType.SUBSCRIBE,pubsubTopic:e,contentTopics:t})}static createUnsubscribeRequest(e,t){return new gs({requestId:ps(),filterSubscribeType:Jt.FilterSubscribeType.UNSUBSCRIBE,pubsubTopic:e,contentTopics:t})}static createUnsubscribeAllRequest(e){return new gs({requestId:ps(),filterSubscribeType:Jt.FilterSubscribeType.UNSUBSCRIBE_ALL,pubsubTopic:e,contentTopics:[]})}static createSubscriberPingRequest(){return new gs({requestId:ps(),filterSubscribeType:Jt.FilterSubscribeType.SUBSCRIBER_PING,pubsubTopic:"",contentTopics:[]})}static decode(e){const t=Jt.decode(e);return new gs(t)}encode(){return Jt.encode(this.proto)}get filterSubscribeType(){return this.proto.filterSubscribeType}get requestId(){return this.proto.requestId}get pubsubTopic(){return this.proto.pubsubTopic}get contentTopics(){return this.proto.contentTopics}}class ms{proto;constructor(e){this.proto=e}static decode(e){const t=Qt.decode(e);return new ms(t)}encode(){return Qt.encode(this.proto)}get statusCode(){return this.proto.statusCode}get statusDesc(){return this.proto.statusDesc}get requestId(){return this.proto.requestId}}const ys=new bn("filter:v2"),bs="/vac/waku/filter-subscribe/2.0.0-beta1",ws="/vac/waku/filter-push/2.0.0-beta1";class vs extends as{pubsubTopics;static handleIncomingMessage;constructor(e,t,r){super(bs,r.components,t),this.pubsubTopics=t;const n=vs.handleIncomingMessage;vs.handleIncomingMessage=n?async(t,r,s)=>{try{await n(t,r,s)}catch(e){ys.error("Previous FilterCore incoming message handler failed ",e)}try{await e(t,r,s)}catch(e){ys.error("Present FilterCore incoming message handler failed ",e)}}:e,r.handle(ws,this.onRequest.bind(this),{maxInboundStreams:100}).catch((e=>{ys.error("Failed to register ",ws,e)}))}async subscribe(e,t,r){const n=await this.getStream(t),s=gs.createSubscribeRequest(e,r);let i;try{i=await Zn([s.encode()],Dn,n,jn,(async e=>await xn(e)))}catch(e){return ys.error("Failed to send subscribe request",e),{success:null,failure:{error:Vr.GENERIC_FAIL,peerId:t}}}const{statusCode:o,requestId:a,statusDesc:c}=ms.decode(i[0].slice());return o<200||o>=300?(ys.error(`Filter subscribe request ${a} failed with status code ${o}: ${c}`),{failure:{error:Vr.REMOTE_PEER_REJECTED,peerId:t},success:null}):{failure:null,success:t}}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.toString()}`,e),{success:null,failure:{error:Vr.NO_STREAM_AVAILABLE,peerId:t}}}const s=gs.createUnsubscribeRequest(e,r);try{await Zn([s.encode()],Dn,n.sink)}catch(e){return ys.error("Failed to send unsubscribe request",e),{success:null,failure:{error:Vr.GENERIC_FAIL,peerId:t}}}return{success:t,failure:null}}async unsubscribeAll(e,t){const r=await this.getStream(t),n=gs.createUnsubscribeAllRequest(e),s=await Zn([n.encode()],Dn,r,jn,(async e=>await xn(e)));if(!s||!s.length)return{failure:{error:Vr.NO_RESPONSE,peerId:t},success:null};const{statusCode:i,requestId:o,statusDesc:a}=ms.decode(s[0].slice());return i<200||i>=300?(ys.error(`Filter unsubscribe all request ${o} failed with status code ${i}: ${a}`),{failure:{error:Vr.REMOTE_PEER_REJECTED,peerId:t},success:null}):{failure:null,success:t}}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.toString()}`,t),{success:null,failure:{error:Vr.NO_STREAM_AVAILABLE,peerId:e}}}const r=gs.createSubscriberPingRequest();let n;try{n=await Zn([r.encode()],Dn,t,jn,(async e=>await xn(e)))}catch(t){return ys.error("Failed to send ping request",t),{success:null,failure:{error:Vr.GENERIC_FAIL,peerId:e}}}if(!n||!n.length)return{success:null,failure:{error:Vr.NO_RESPONSE,peerId:e}};const{statusCode:s,requestId:i,statusDesc:o}=ms.decode(n[0].slice());return s<200||s>=300?(ys.error(`Filter ping request ${i} failed with status code ${s}: ${o}`),{success:null,failure:{error:Vr.REMOTE_PEER_REJECTED,peerId:e}}):{success:e,failure:null}}onRequest(e){const{connection:t,stream:r}=e,{remotePeer:n}=t;ys.info(`Received message from ${n.toString()}`);try{Zn(r,jn,(async e=>{for await(const r of e){const e=fs.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(vs.handleIncomingMessage?.(n,s,t.remotePeer.toString()))}})).then((()=>{ys.info("Receiving pipe closed.")}),(async e=>{ys.error(`Error with receiving pipe on peer:${t.remotePeer.toString()} -- stream:${r.id} -- protocol:${r.protocol}: `,e)}))}catch(e){ys.error("Error decoding message",e)}}}class Es{proto;constructor(e){this.proto=e}static createRequest(e,t){return new Es({requestId:ps(),request:{message:e,pubsubTopic:t},response:void 0})}static decode(e){const t=nr.decode(e);return new Es(t)}encode(){return nr.encode(this.proto)}get query(){return this.proto.request}get response(){return this.proto.response}}const Ss=new bn("light-push"),As="/vac/waku/lightpush/2.0.0-beta1";class Is extends as{pubsubTopics;constructor(e,t){super(As,t.components,e),this.pubsubTopics=e}async preparePushMessage(e,t){try{if(!t.payload||0===t.payload.length)return Ss.error("Failed to send waku light push: payload is empty"),{query:null,error:Vr.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 Ss.error("Failed to send waku light push: message is bigger than 1MB"),{query:null,error:Vr.SIZE_TOO_BIG};const r=await e.toProtoObj(t);return r?{query:Es.createRequest(r,e.pubsubTopic),error:null}:(Ss.error("Failed to encode to protoMessage, aborting push"),{query:null,error:Vr.ENCODE_FAILED})}catch(e){return Ss.error("Failed to prepare push message",e),{query:null,error:Vr.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}};let i,o;try{i=await this.getStream(r)}catch(e){return Ss.error("Failed to get stream",e),{success:null,failure:{error:Vr.NO_STREAM_AVAILABLE,peerId:r}}}try{o=await Zn([n.encode()],Dn,i,jn,(async e=>await xn(e)))}catch(e){return Ss.error("Failed to send waku light push request",e),{success:null,failure:{error:Vr.STREAM_ABORTED,peerId:r}}}const a=new Rn;let c;o.forEach((e=>{a.append(e)}));try{c=Es.decode(a).response}catch(e){return Ss.error("Failed to decode push reply",e),{success:null,failure:{error:Vr.DECODE_FAILED,peerId:r}}}return c?(l=c.info)&&(l.includes("could not generate rln proof")||l.includes("could not get new message id to generate an rln proof")||l.includes("RLN validation failed"))?(Ss.error("Remote peer fault: RLN generation"),{success:null,failure:{error:Vr.RLN_PROOF_GENERATION,peerId:r}}):c.isSuccess?{success:r,failure:null}:(Ss.error("Remote peer rejected the message: ",c.info),{success:null,failure:{error:Vr.REMOTE_PEER_REJECTED,peerId:r}}):(Ss.error("Remote peer fault: No response in PushRPC"),{success:null,failure:{error:Vr.NO_RESPONSE,peerId:r}});var l}}const ks={payload:new Uint8Array,contentTopic:"",version:void 0,timestamp:void 0,meta:void 0,rateLimitProof:void 0,ephemeral:void 0},xs=1e6;class Cs{proto;constructor(e){this.proto=e}static create(e){const t=new Cs({...e,requestId:ps(),timeStart:e.timeStart?BigInt(e.timeStart.getTime()*xs):void 0,timeEnd:e.timeEnd?BigInt(e.timeEnd.getTime()*xs):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=ar.decode(e);return new Cs(t)}encode(){return ar.encode(this.proto)}}class _s{proto;constructor(e){this.proto=e}static decode(e){const t=cr.decode(e);return new _s(t)}encode(){return cr.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 Ts=new bn("store"),Ps="/vac/waku/store-query/3.0.0";class Ls extends as{pubsubTopics;constructor(e,t){super(Ps,t.components,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=Cs.create({...e,paginationCursor:n});let i;try{i=await this.getStream(r)}catch(e){Ts.error("Failed to get stream",e);break}const o=await Zn([s.encode()],Dn,i,jn,(async e=>await xn(e))),a=new Rn;o.forEach((e=>{a.append(e)}));const c=_s.decode(a);if(!c.statusCode||c.statusCode>=300){const e=`Store query failed with status code: ${c.statusCode}, description: ${c.statusDesc}`;throw Ts.error(e),new Error(e)}if(!c.messages||!c.messages.length){Ts.warn("Stopping pagination due to empty messages in response");break}Ts.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,{...ks,...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 Rs 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 CustomEvent(e,t))}}const Ns=Symbol.for("@libp2p/peer-id");function Os(e){return Boolean(e?.[Ns])}const Ds=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,i=0;const o=this.peekChar();if(void 0===o)return;const a="0"===o,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(i+=1,void 0!==t&&i>t)return}return 0===i||!r&&a&&i>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),i=16-(r+2),[o]=e(s.subarray(0,i));return t.set(s.subarray(0,o),16-o),t}))}readIPAddr(){return this.readIPv4Addr()??this.readIPv6Addr()}};function Ms(e){if(!(e.length>15))return Ds.new(e).parseWith((()=>Ds.readIPv4Addr()))}function Fs(e){if(e.includes("%")&&(e=e.split("%")[0]),!(e.length>45))return Ds.new(e).parseWith((()=>Ds.readIPv6Addr()))}function Bs(e,t=!1){if(e.includes("%")&&(e=e.split("%")[0]),e.length>45)return;const r=Ds.new(e).parseWith((()=>Ds.readIPAddr()));return r?t&&4===r.length?Uint8Array.from([0,0,0,0,0,0,0,0,0,0,255,255,r[0],r[1],r[2],r[3]]):r:void 0}const Us=(parseInt("0xFFFF",16),new Uint8Array([0,0,0,0,0,0,0,0,0,0,255,255]));function $s(e,t){16===t.length&&4===e.length&&function(e){let t=0;for(const r of e)if(!(t<0)){if(t>11)break;if(255!==r)return!1;t++}return!0}(t)&&(t=t.slice(12)),4===t.length&&16===e.length&&function(e,t){let r=0;for(const n of e)if(!(r<0)){if(r>11)break;if(n!==t[r])return!1;r++}return!0}(e,Us)&&(e=e.slice(12));const r=e.length;if(r!=t.length)throw new Error("Failed to mask ip");const n=new Uint8Array(r);for(let s=0;st)throw new Error("Invalid CIDR mask");const r=t/8,n=new Uint8Array(r);for(let t=0;t=8?(n[t]=255,e-=8):(n[t]=255-(255>>e),e=0);return n}class js{constructor(e,t){if(null==t)({network:this.network,mask:this.mask}=function(e){const[t,r]=e.split("/");if(!t||!r)throw new Error("Failed to parse given CIDR: "+e);let n=4,s=Ms(t);if(null==s&&(n=16,s=Fs(t),null==s))throw new Error("Failed to parse given CIDR: "+e);const i=parseInt(r,10);if(Number.isNaN(i)||String(i).length!==r.length||i<0||i>8*n)throw new Error("Failed to parse given CIDR: "+e);const o=qs(i,8*n);return{network:$s(s,o),mask:o}}(e));else{const r=Bs(e);if(null==r)throw new Error("Failed to parse network");t=String(t);const n=parseInt(t,10);if(Number.isNaN(n)||String(n).length!==t.length||n<0||n>8*r.length){const e=Bs(t);if(null==e)throw new Error("Failed to parse mask");this.mask=e}else this.mask=qs(n,8*r.length);this.network=$s(r,this.mask)}}contains(e){return function(e,t){if("string"==typeof t&&(t=Bs(t)),null==t)throw new Error("Invalid ip");if(t.length!==e.network.length)return!1;for(let r=0;r>4).toString(16)+(15&r).toString(16);return t}(this.mask);return function(e){switch(e.length){case 4:return e.join(".");case 16:{const t=[];for(let r=0;r{r[t++]=255&parseInt(e,10)})),r}if(Gs(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")},Xs=-1,Js={},Qs={};function Zs(e){if("number"==typeof e){if(null!=Qs[e])return Qs[e];throw new Error(`no protocol with code: ${e}`)}if("string"==typeof e){if(null!=Js[e])return Js[e];throw new Error(`no protocol with name: ${e}`)}throw new Error("invalid protocol id type: "+typeof e)}function Ys(e,t){switch(Zs(e).code){case 4:case 41:return function(e){const t=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=ni(n);return Cn([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=ue.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=ni(n);return Cn([r,s],r.length+s.length)}(t);case 466:return function(e){const t=ri.decode(e),r=Uint8Array.from(_(t.length));return Cn([r,t],r.length+t.length)}(t);case 481:return ii(globalThis.decodeURIComponent(t));default:return xt(t,"base16")}}[[4,32,"ip4"],[6,16,"tcp"],[33,16,"dccp"],[41,128,"ip6"],[42,Xs,"ip6zone"],[43,8,"ipcidr"],[53,Xs,"dns",!0],[54,Xs,"dns4",!0],[55,Xs,"dns6",!0],[56,Xs,"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,Xs,"unix",!1,!0],[421,Xs,"ipfs"],[421,Xs,"p2p"],[443,0,"https"],[444,96,"onion"],[445,296,"onion3"],[446,Xs,"garlic64"],[448,0,"tls"],[449,Xs,"sni"],[460,0,"quic"],[461,0,"quic-v1"],[465,0,"webtransport"],[466,Xs,"certhash"],[477,0,"ws"],[478,0,"wss"],[479,0,"p2p-websocket-star"],[480,0,"http"],[481,Xs,"http-path"],[777,Xs,"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);Qs[t.code]=t,Js[t.name]=t})),Zs("ip4"),Zs("ip6"),Zs("ipcidr");const ti=Object.values(Et).map((e=>e.decoder)),ri=function(){let e=ti[0].or(ti[1]);return ti.slice(2).forEach((t=>e=e.or(t))),e}();function ni(e){const t=new ArrayBuffer(2);return new DataView(t).setUint16(0,e),new Uint8Array(t)}function si(e){return new DataView(e.buffer).getUint16(e.byteOffset)}function ii(e){const t=xt(e),r=Uint8Array.from(_(t.length));return Cn([r,t],r.length+t.length)}function oi(e){const t=T(e);if((e=e.slice(k(t))).length!==t)throw new Error("inconsistent lengths");return en(e)}function ai(e){const t=[],r=[];let n=null,s=0;for(;se.length)throw new di("Invalid address Uint8Array: "+en(e,"base16"));t.push([i,l]);const u=Ys(i,l);if(r.push([i,u]),!0===a.path){n=u;break}}return{bytes:Uint8Array.from(e),string:ci(r),tuples:t,stringTuples:r,path:n}}function ci(e){const t=[];return e.map((e=>{const r=Zs(e[0]);return t.push(r.name),e.length>1&&null!=e[1]&&t.push(e[1]),null})),hi(t.join("/"))}function li(e){return Cn(e.map((e=>{const t=Zs(e[0]);let r=Uint8Array.from(_(t.code));return e.length>1&&null!=e[1]&&(r=Cn([r,e[1]])),r})))}function ui(e,t){if(e.size>0)return e.size/8;if(0===e.size)return 0;{const e=T(t instanceof Uint8Array?t:Uint8Array.from(t));return e+k(e)}}function hi(e){return"/"+e.trim().split("/").filter((e=>e)).join("/")}class di extends Error{static name="ParseError";name="ParseError";constructor(e){super(`Error parsing address: ${e}`)}}const pi=Symbol.for("nodejs.util.inspect.custom"),fi=Symbol.for("@multiformats/js-multiaddr/multiaddr"),gi=[Zs("dns").code,Zs("dns4").code,Zs("dns6").code,Zs("dnsaddr").code];class mi extends Error{constructor(e="No available resolver"){super(e),this.name="NoAvailableResolverError"}}class yi{bytes;#t;#r;#n;#s;[fi]=!0;constructor(e){let t;if(null==e&&(e=""),e instanceof Uint8Array)t=ai(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=hi(e)).split("/").slice(1);if(1===s.length&&""===s[0])return{bytes:new Uint8Array,string:"/",tuples:[],stringTuples:[],path:null};for(let i=0;i=s.length)throw new di("invalid address: "+e);if(!0===o.path){n=hi(s.slice(i).join("/")),t.push([o.code,ei(o.code,n)]),r.push([o.code,n]);break}const a=ei(o.code,s[i]);t.push([o.code,a]),r.push([o.code,Ys(o.code,a)])}return{string:ci(r),bytes:li(t),tuples:t,stringTuples:r,path:n}}(e)}else{if(!wi(e))throw new Error("addr must be a string, Buffer, or another Multiaddr");t=ai(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 i=Zs("tcp"),o=Zs("udp"),a=Zs("ip4"),c=Zs("ip6"),l=Zs("dns6"),u=Zs("ip6zone");for(const[h,d]of this.stringTuples())h===u.code&&(s=`%${d??""}`),gi.includes(h)&&(t="tcp"===i.name?"tcp":"udp",n=443,r=`${d??""}${s}`,e=h===l.code?6:4),h!==i.code&&h!==o.code||(t="tcp"===Zs(h).name?"tcp":"udp",n=parseInt(d??"")),h!==a.code&&h!==c.code||(t="tcp"===Zs(h).name?"tcp":"udp",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({},Zs(e))))}protoCodes(){return this.#r.map((([e])=>e))}protoNames(){return this.#r.map((([e])=>Zs(e).name))}tuples(){return this.#r.map((([e,t])=>null==t?[e]:[e,t]))}stringTuples(){return this.#n.map((([e,t])=>null==t?[e]:[e,t]))}encapsulate(e){return e=new yi(e),new yi(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 yi(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 yi(li(t.slice(0,r)));return this}getPeerId(){try{let e=[];this.stringTuples().forEach((([t,r])=>{t===Js.p2p.code&&e.push([t,r]),t===Js["p2p-circuit"].code&&(e=[])}));const t=e.pop();if(null!=t?.[1]){const e=t[1];return"Q"===e[0]||"1"===e[0]?en(Ee.decode(`z${e}`),"base58btc"):en(mt.parse(e).multihash.bytes,"base58btc")}return null}catch(e){return null}}getPath(){return this.#s}equals(e){return _n(this.bytes,e.bytes)}async resolve(e){const t=this.protos().find((e=>e.resolvable));if(null==t)return[this];const r=bi.get(t.name);if(null==r)throw new mi(`no available resolver for ${t.name}`);return(await r(this,e)).map((e=>vi(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)}[pi](){return`Multiaddr(${this.#t})`}}const bi=new Map;function wi(e){return Boolean(e?.[fi])}function vi(e){return new yi(e)}const Ei=new bn("keep-alive");class Si{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),Ei.info(`Ping succeeded (${n})`,r)}catch(e){return void Ei.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:sn(r.toString())}})}catch(e){Ei.error("Failed to update ping",e)}}catch(e){Ei.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 i=An({pubsubTopicShardInfo:cn(s),contentTopic:"/relay-ping/1/ping/null",ephemeral:!0}),o=setInterval((()=>{Ei.info("Sending Waku Relay ping message"),e.send(i,{payload:new Uint8Array([1])}).catch((e=>Ei.error("Failed to send relay ping",e)))}),1e3*t);n.push(o)}return n}}const Ai=e=>{if(!e)return-1;try{const t=e.metadata.get("ping");return t?Number(nn(t)):-1}catch(e){return-1}},Ii=new bn("connection-manager");class ki extends Rs{pubsubTopics;keepAliveManager;options;libp2p;dialAttemptsForPeer=new Map;dialErrorsForPeer=new Map;currentActiveParallelDialCount=0;pendingPeerDialQueue=[];isP2PNetworkConnected=!1;isConnected(){return!(globalThis?.navigator&&!globalThis?.navigator?.onLine)&&this.isP2PNetworkConnected}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),Ii.info(`Dropped connection with peer ${e.toString()}`)}catch(t){Ii.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=[],i=[],o=[],a=[];for(const t of e){const e=await this.getTagNamesForPeer(t.id);e.includes(Gr.BOOTSTRAP)?r.push(t):e.includes(Gr.PEER_EXCHANGE)?n.push(t):e.includes(Gr.LOCAL)&&s.push(t)}for(const e of t){const t=await this.libp2p.peerStore.get(e),r=await this.getTagNamesForPeer(e);r.includes(Gr.BOOTSTRAP)?i.push(t):r.includes(Gr.PEER_EXCHANGE)?o.push(t):r.includes(Gr.LOCAL)&&a.push(t)}return{DISCOVERED:{[Gr.BOOTSTRAP]:r,[Gr.PEER_EXCHANGE]:n,[Gr.LOCAL]:s},CONNECTED:{[Gr.BOOTSTRAP]:i,[Gr.PEER_EXCHANGE]:o,[Gr.LOCAL]:a}}}constructor(e){super(),this.libp2p=e.libp2p,this.pubsubTopics=e.pubsubTopics,this.options={maxDialAttemptsForPeer:3,maxBootstrapPeersAllowed:1,maxParallelDials:3,pingKeepAlive:300,relayKeepAlive:300,...e.config},this.keepAliveManager=new Si({relay:e.relay,libp2p:e.libp2p,options:{pingKeepAlive:this.options.pingKeepAlive,relayKeepAlive:this.options.relayKeepAlive}}),this.startEventListeners().then((()=>Ii.info("Connection Manager is now running"))).catch((e=>Ii.error("Unexpected error while running service",e))),this.dialPeerStorePeers().catch((e=>Ii.error("Unexpected error while dialing peer store peers",e)))}async getConnectedPeers(e){const t=this.libp2p.getPeers();return 0===t.length?[]:(await Promise.all(t.map((async e=>{try{return await this.libp2p.peerStore.get(e)}catch(e){return null}})))).filter((e=>!!e)).filter((t=>!e||t.protocols.includes(e))).sort(((e,t)=>Ai(e)-Ai(t)))}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){Ii.error("Unexpected error while dialing peer store peers",e)}}async startEventListeners(){this.startPeerDiscoveryListener(),this.startPeerConnectionListener(),this.startPeerDisconnectionListener(),this.startNetworkStatusListener()}async dialPeer(e){let t,r;const n=this.getDialablePeerInfo(e),s=Os(n)?n.toString():n.getPeerId();this.currentActiveParallelDialCount+=1;let i=0;for(;i{t.tags=Array.from(new Set([...t.tags,...e]))})),this.dialAttemptsForPeer.set(r.toString(),-1),this.keepAliveManager.start(r);break}catch(e){e instanceof AggregateError?Ii.error(`Error dialing peer ${s} - ${e.errors}`):Ii.error(`Error dialing peer ${s} - ${e.message}`),this.dialErrorsForPeer.set(s,e),i++,this.dialAttemptsForPeer.set(s,i)}if(this.currentActiveParallelDialCount--,this.processDialQueue(),i===this.options.maxDialAttemptsForPeer)try{const e=this.dialErrorsForPeer.get(s);if(e){let t;e instanceof AggregateError?e.errors?0===e.errors.length?Ii.warn("Errors array is empty for AggregateError"):t=JSON.stringify(e.errors[0]):Ii.warn("No errors array found for AggregateError"):t=e.message,Ii.info(`Deleting undialable peer ${s} from peer store. Reason: ${t}`)}this.dialErrorsForPeer.delete(s),r&&await this.libp2p.peerStore.delete(r),await this.attemptDnsDiscovery()}catch(e){throw new Error(`Error deleting undialable peer ${s} from peer store - ${e}`)}if(!t)throw new Error(`Failed to dial peer ${n}`);return t}async rawDialPeerWithProtocols(e,t){const r=this.getDialablePeerInfo(e);return await this.libp2p.dialProtocol(r,t)}getDialablePeerInfo(e){if(Os(e))return e;{const t=vi(e);if(!t.getPeerId())throw new Error("Failed to dial multiaddr: missing peer ID");return t}}async attemptDnsDiscovery(){if(this.libp2p.getConnections().length>0)return;if((await this.libp2p.peerStore.all()).length>0)return;Ii.info("Attempting to trigger DNS discovery.");const e=Object.values(this.libp2p.components.components).find((e=>!(!e||!e.toString)&&e.toString().includes(Jr)));e&&await e.findPeers()}processDialQueue(){if(this.pendingPeerDialQueue.length>0&&this.currentActiveParallelDialCount{Ii.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){Ii.error(`Error dialing peer ${t.toString()} : ${e}`)}})()},"peer:connect":e=>{(async()=>{Ii.info(`Connected to peer ${e.detail.toString()}`);const t=e.detail;this.keepAliveManager.start(t),(await this.getTagNamesForPeer(t)).includes(Gr.BOOTSTRAP)?this.libp2p.getConnections().filter((e=>e.tags.includes(Gr.BOOTSTRAP))).length>this.options.maxBootstrapPeersAllowed?await this.dropConnection(t):this.dispatchEvent(new CustomEvent(Wr.PEER_CONNECT_BOOTSTRAP,{detail:t})):this.dispatchEvent(new CustomEvent(Wr.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 Ii.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 Ii.warn(`Discovered peer ${e.toString()} with ShardInfo ${t} is not part of any of the configured pubsub topics (${this.pubsubTopics}).\n Not dialing.`),!1}return await this.isPeerDialableBasedOnBootstrapStatus(e)?!this.dialAttemptsForPeer.has(e.toString())||(Ii.warn(`Peer ${e.toString()} has already been attempted dial before, or already has a dial attempt in progress, skipping dial`),!1):(Ii.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===Gr.BOOTSTRAP))||this.libp2p.getConnections().filter((e=>e.tags.find((e=>e===Gr.BOOTSTRAP)))).lengththis.pubsubTopics.includes(e)))}async getPeerShardInfo(e,t){const r=(await t.get(e)).metadata.get("shardInfo");if(r)return fn(r)}startNetworkStatusListener(){try{globalThis.addEventListener("online",this.onEventHandlers["browser:network"]),globalThis.addEventListener("offline",this.onEventHandlers["browser:network"])}catch(e){Ii.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){Ii.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 CustomEvent(Xr.CONNECTION_STATUS,{detail:this.isConnected()}))}}const xi=new bn("metadata"),Ci="/vac/waku/metadata/1.0.0";class _i extends as{pubsubTopics;libp2pComponents;handshakesConfirmed=new Map;constructor(e,t){super(Ci,t.components,e),this.pubsubTopics=e,this.libp2pComponents=t,t.registrar.handle(Ci,(e=>{this.onRequest(e)}))}async query(e){const t=gr.encode(ln(this.pubsubTopics));if(!await this.libp2pComponents.peerStore.get(e))return{shardInfo:null,error:Vr.NO_PEER_AVAILABLE};let r;try{r=await this.getStream(e)}catch(s){return xi.error("Failed to get stream",s),{shardInfo:null,error:Vr.NO_STREAM_AVAILABLE}}const n=await Zn([t],Dn,r,jn,(async e=>await xn(e))),{error:s,shardInfo:i}=this.decodeMetadataResponse(n);return s?{shardInfo:null,error:s}:(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=mr.encode(ln(this.pubsubTopics)),s=await Zn([n],Dn,t,jn,(async e=>await xn(e))),{error:i,shardInfo:o}=this.decodeMetadataResponse(s);if(i)return;await this.savePeerShardInfo(r.remotePeer,o)}catch(e){xi.error("Error handling metadata request",e)}}decodeMetadataResponse(e){const t=new Rn;e.forEach((e=>{t.append(e)}));const r=mr.decode(t);return r?{shardInfo:r,error:null}:(xi.error("Error decoding metadata response"),{shardInfo:null,error:Vr.DECODE_FAILED})}async savePeerShardInfo(e,t){await this.libp2pComponents.peerStore.merge(e,{metadata:{shardInfo:gn(t)}}),this.handshakesConfirmed.set(e.toString(),t)}}function Ti(e){return t=>new _i(e,t)}function Pi(e,t){const r=sn(e),n=sn(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),i=on([r,t.payload,n,t.meta,s].filter(Ir));return Hr(i)}function Li(e,t){const r=Pi(e,t);return rn(r)}class Ri{peerIds=[];isStarted=!1;pubsubTopic;config;libp2p;filter;peerManager;connectionManager;activeSubscriptions;keepAliveIntervalId;pingFailedAttempts=new Map;receivedMessagesFormPeer=new Set;receivedMessages=new Set;verifiedPeers=new Set;constructor(e){this.config=e.config,this.connectionManager=e.connectionManager,this.filter=e.filter,this.peerManager=e.peerManager,this.libp2p=e.libp2p,this.activeSubscriptions=e.activeSubscriptions,this.pubsubTopic=e.pubsubTopic,this.onConnectionChange=this.onConnectionChange.bind(this),this.onPeerConnected=this.onPeerConnected.bind(this),this.onPeerDisconnected=this.onPeerDisconnected.bind(this)}get reservedContentTopic(){return`/js-waku-subscription-ping/1/${this.libp2p.peerId.toString()}/utf8`}start(){this.isStarted||(this.isStarted=!0,this.startKeepAlive(),this.startConnectionListener(),this.startPeerConnectionListener())}stop(){this.isStarted&&(this.isStarted=!1,this.stopKeepAlive(),this.stopConnectionListener(),this.stopPeerConnectionListener())}async getPeers(){return this.isStarted||(this.peerIds=this.peerManager.getPeers()),this.peerIds}notifyMessageReceived(e,t){const r=this.buildMessageHash(t);return this.verifiedPeers.add(e),this.receivedMessagesFormPeer.add(`${e}-${r}`),!!this.receivedMessages.has(r)||(this.receivedMessages.add(r),!1)}buildMessageHash(e){return Li(this.pubsubTopic,e)}startConnectionListener(){this.connectionManager.addEventListener(Xr.CONNECTION_STATUS,this.onConnectionChange)}stopConnectionListener(){this.connectionManager.removeEventListener(Xr.CONNECTION_STATUS,this.onConnectionChange)}async onConnectionChange({detail:e}){e?(await Promise.all(this.peerIds.map((e=>this.ping(e,!0)))),this.startKeepAlive()):this.stopKeepAlive()}startKeepAlive(){this.keepAliveIntervalId||(this.keepAliveIntervalId=setInterval((()=>{this.peerIds.map((e=>this.ping(e)))}),this.config.keepAliveIntervalMs))}stopKeepAlive(){this.keepAliveIntervalId&&(clearInterval(this.keepAliveIntervalId),this.keepAliveIntervalId=void 0)}startPeerConnectionListener(){this.libp2p.addEventListener("peer:connect",this.onPeerConnected),this.libp2p.addEventListener("peer:disconnect",this.onPeerDisconnected)}stopPeerConnectionListener(){this.libp2p.removeEventListener("peer:connect",this.onPeerConnected),this.libp2p.removeEventListener("peer:disconnect",this.onPeerDisconnected)}async onPeerConnected(e){this.peerIds.length>0||(this.peerIds=this.peerManager.getPeers(),await Promise.all(this.peerIds.map((e=>this.subscribe(e)))))}async onPeerDisconnected(e){!this.peerIds.find((t=>t.equals(e.detail)))||(this.peerIds=this.peerManager.getPeers(),await Promise.all(this.peerIds.map((e=>this.subscribe(e)))))}async subscribe(e){let t=e;for(let e=0;e<3;e++){if(!t)return;if((await this.filter.subscribe(this.pubsubTopic,t,Array.from(this.activeSubscriptions.keys()))).success)return;t=this.peerManager.requestRenew(t)}}async ping(e,t=!1){const r=e.toString(),n=await this.filter.ping(e);if(n.failure&&t){const t=this.peerManager.requestRenew(e);await this.subscribe(t)}else{if(n.failure){const e=this.pingFailedAttempts.get(r)||0;this.pingFailedAttempts.set(r,e+1)}if(n.success&&this.pingFailedAttempts.set(r,0),(this.pingFailedAttempts.get(r)||0)>=this.config.pingsBeforePeerRenewed){const t=this.peerManager.requestRenew(e);await this.subscribe(t)}}}}const Ni=new bn("sdk:filter:subscription");class Oi{pubsubTopic;protocol;config;monitor;subscriptionCallbacks=new Map;constructor(e,t,r,n,s,i,o){this.pubsubTopic=e,this.protocol=t,this.config=i,this.pubsubTopic=e,this.monitor=new Ri({pubsubTopic:e,config:i,libp2p:s,connectionManager:r,filter:t,peerManager:n,lightPush:o,activeSubscriptions:this.subscriptionCallbacks})}async subscribe(e,t){const r=Array.isArray(e)?e:[e];for(const e of r)if(e.pubsubTopic!==this.pubsubTopic)return{failures:[{error:Vr.TOPIC_DECODER_MISMATCH}],successes:[]};this.config.enableLightPushFilterCheck&&r.push(kn(this.monitor.reservedContentTopic,this.pubsubTopic));const n=kr(r),s=Array.from(n.keys()),i=(await this.monitor.getPeers()).map((async e=>this.protocol.subscribe(this.pubsubTopic,e,s))),o=await Promise.allSettled(i),a=this.handleResult(o,"subscribe");return n.forEach(((e,r)=>{const n={decoders:e,callback:t};r!==this.monitor.reservedContentTopic&&this.subscriptionCallbacks.set(r,n)})),this.monitor.start(),a}async unsubscribe(e){const t=(await this.monitor.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.monitor.stop(),n}async ping(){const e=(await this.monitor.getPeers()).map((e=>this.protocol.ping(e))),t=await Promise.allSettled(e);return this.handleResult(t,"ping")}async unsubscribeAll(){const e=(await this.monitor.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.monitor.stop(),r}async processIncomingMessage(e,t){if(this.monitor.notifyMessageReceived(t,e))return void Ni.info("Message already received, skipping");const{contentTopic:r}=e,n=this.subscriptionCallbacks.get(r);n?(Ni.info("Processing message with content topic ",r," on pubsub topic ",this.pubsubTopic),await async function(e,t,r){const{decoders:n,callback:s}=e,{contentTopic:i}=r;if(i)try{const e=n.map((e=>e.fromProtoObj(t,r).then((e=>e||Promise.reject("Decoding failed"))))),i=await Promise.any(e);await s(i)}catch(e){Ni.error("Error decoding message",e)}else Ni.warn("Message has no content topic, skipping")}(n,this.pubsubTopic,e)):Ni.error("No subscription callback available for ",r)}handleResult(e,t){const r={failures:[],successes:[]};for(const n of e)if("rejected"===n.status)Ni.error(`Failed to resolve ${t} promise successfully: `,n.reason),r.failures.push({error:Vr.GENERIC_FAIL});else{const e=n.value;e.failure?r.failures.push(e.failure):r.successes.push(e.success)}return r}}const Di=new bn("sdk:filter");class Mi{protocol;config;connectionManager;libp2p;peerManager;lightPush;activeSubscriptions=new Map;constructor(e){var t;this.config=(t=e.options,{keepAliveIntervalMs:t?.keepAliveIntervalMs||6e4,pingsBeforePeerRenewed:t?.pingsBeforePeerRenewed||3,enableLightPushFilterCheck:t?.enableLightPushFilterCheck||!1}),this.lightPush=e.lightPush,this.peerManager=e.peerManager,this.libp2p=e.libp2p,this.connectionManager=e.connectionManager,this.protocol=new vs((async(e,t,r)=>{const n=this.getActiveSubscription(e);n?await n.processIncomingMessage(t,r):Di.error(`No subscription locally registered for topic ${e}`)}),e.connectionManager.pubsubTopics,e.libp2p),this.activeSubscriptions=new Map}async subscribe(e,t){const r=this.getUniquePubsubTopics(e);if(1!==r.length)return{subscription:null,error:Vr.INVALID_DECODER_TOPICS,results:null};const n=r[0],{subscription:s,error:i}=await this.createSubscription(n);if(i)return{subscription:null,error:i,results:null};const{failures:o,successes:a}=await s.subscribe(e,t);return{subscription:s,error:null,results:{failures:o,successes:a}}}async createSubscription(e){const t="string"==typeof e?e:an(e)?.[0];un(t,this.protocol.pubsubTopics);const r=this.peerManager.getPeers();return 0===r.length?{error:Vr.NO_PEER_AVAILABLE,subscription:null}:(Di.info(`Creating filter subscription with ${r.length} peers: `,r.map((e=>e.toString()))),{error:null,subscription:this.getActiveSubscription(t)??this.setActiveSubscription(t,new Oi(t,this.protocol,this.connectionManager,this.peerManager,this.libp2p,this.config,this.lightPush))})}async subscribeWithUnsubscribe(e,t){const r=this.getUniquePubsubTopics(e);if(0===r.length)throw Error("Failed to subscribe: no pubsubTopic found on decoders provided.");if(r.length>1)throw Error("Failed to subscribe: all decoders should have the same pubsub topic. Use createSubscription to be more agile.");const{subscription:n,error:s}=await this.createSubscription(r[0]);if(s)throw Error(`Failed to create subscription: ${s}`);await n.subscribe(e,t);const i=Array.from(kr(Array.isArray(e)?e:[e]).keys());return async()=>{await n.unsubscribe(i)}}toSubscriptionIterator(e){return async function(e,t,r){const n=[];let s;s=await e.subscribeWithUnsubscribe(t,(e=>{n.push(e)}));const i=Number.isInteger(r?.timeoutMs),o=Date.now();return{iterator:async function*(){for(;;){if(i&&Date.now()-o>=0)return;await xr(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]}}class Fi{ttlMs;cleanupIntervalId=null;entryTimestamps=new Map;constructor(e,t=5e3){this.ttlMs=e,this.startCleanupInterval(t)}dispose(){null!==this.cleanupIntervalId&&(clearInterval(this.cleanupIntervalId),this.cleanupIntervalId=null),this.entryTimestamps.clear()}add(e){return this.entryTimestamps.set(e,Date.now()),this}has(e){return this.entryTimestamps.has(e)}startCleanupInterval(e){this.cleanupIntervalId=setInterval((()=>{this.removeExpiredEntries()}),e)}removeExpiredEntries(){const e=Date.now();for(const[t,r]of this.entryTimestamps.entries())e-r>this.ttlMs&&this.entryTimestamps.delete(t)}}const Bi=new bn("sdk:filter-subscription");class Ui{libp2p;pubsubTopic;protocol;peerManager;config;isStarted=!1;inProgress=!1;peers=new Set;peerFailures=new Map;receivedMessages=new Fi(6e4);callbacks=new Map;messageEmitter=new Rs;toSubscribeContentTopics=new Set;toUnsubscribeContentTopics=new Set;subscribeIntervalId=null;keepAliveIntervalId=null;get contentTopics(){const e=Array.from(this.callbacks.keys()).map((e=>e.contentTopic)),t=new Set(e).values();return Array.from(t)}constructor(e){this.config=e.config,this.pubsubTopic=e.pubsubTopic,this.libp2p=e.libp2p,this.protocol=e.protocol,this.peerManager=e.peerManager,this.onPeerConnected=this.onPeerConnected.bind(this),this.onPeerDisconnected=this.onPeerDisconnected.bind(this)}start(){Bi.info(`Starting subscription for pubsubTopic: ${this.pubsubTopic}`),this.isStarted||this.inProgress?Bi.info("Subscription already started or in progress, skipping start"):(this.inProgress=!0,this.attemptSubscribe({useNewContentTopics:!1}),this.setupSubscriptionInterval(),this.setupKeepAliveInterval(),this.setupEventListeners(),this.isStarted=!0,this.inProgress=!1,Bi.info(`Subscription started for pubsubTopic: ${this.pubsubTopic}`))}stop(){Bi.info(`Stopping subscription for pubsubTopic: ${this.pubsubTopic}`),this.isStarted&&!this.inProgress?(this.inProgress=!0,this.disposeEventListeners(),this.disposeIntervals(),this.disposePeers(),this.disposeHandlers(),this.receivedMessages.dispose(),this.inProgress=!1,this.isStarted=!1,Bi.info(`Subscription stopped for pubsubTopic: ${this.pubsubTopic}`)):Bi.info("Subscription not started or stop in progress, skipping stop")}isEmpty(){return 0===this.callbacks.size}async add(e,t){const r=Array.isArray(e)?e:[e];for(const e of r)this.addSingle(e,t);return!(this.toSubscribeContentTopics.size>0)||await this.attemptSubscribe({useNewContentTopics:!0})}async remove(e){const t=Array.isArray(e)?e:[e];for(const e of t)this.removeSingle(e);return!(this.toUnsubscribeContentTopics.size>0)||await this.attemptUnsubscribe({useNewContentTopics:!0})}invoke(e,t){this.isMessageReceived(e)?Bi.info(`Skipping invoking callbacks for already received message: pubsubTopic:${this.pubsubTopic}, peerId:${t.toString()}, contentTopic:${e.contentTopic}`):(Bi.info(`Invoking message for contentTopic: ${e.contentTopic}`),this.messageEmitter.dispatchEvent(new CustomEvent(e.contentTopic,{detail:e})))}addSingle(e,t){Bi.info(`Adding subscription for contentTopic: ${e.contentTopic}`);const r=!this.contentTopics.includes(e.contentTopic);if(r&&this.toSubscribeContentTopics.add(e.contentTopic),this.callbacks.has(e)){Bi.warn(`Replacing callback associated associated with decoder with pubsubTopic:${e.pubsubTopic} and contentTopic:${e.contentTopic}`);const t=this.callbacks.get(e);this.callbacks.delete(e),this.messageEmitter.removeEventListener(e.contentTopic,t)}const n=r=>{(async()=>{try{const n=await e.fromProtoObj(e.pubsubTopic,r.detail);t(n)}catch(e){Bi.error("Error decoding message",e)}})()};this.callbacks.set(e,n),this.messageEmitter.addEventListener(e.contentTopic,n),Bi.info(`Subscription added for contentTopic: ${e.contentTopic}, isNewContentTopic: ${r}`)}removeSingle(e){Bi.info(`Removing subscription for contentTopic: ${e.contentTopic}`);const t=this.callbacks.get(e);t||Bi.warn(`No callback associated with decoder with pubsubTopic:${e.pubsubTopic} and contentTopic:${e.contentTopic}`),this.callbacks.delete(e),this.messageEmitter.removeEventListener(e.contentTopic,t);const r=!this.contentTopics.includes(e.contentTopic);r&&this.toUnsubscribeContentTopics.add(e.contentTopic),Bi.info(`Subscription removed for contentTopic: ${e.contentTopic}, isCompletelyRemoved: ${r}`)}isMessageReceived(e){try{const t=Li(this.pubsubTopic,e);if(this.receivedMessages.has(t))return!0;this.receivedMessages.add(t)}catch(e){}return!1}setupSubscriptionInterval(){Bi.info("Setting up subscription interval with period 1000ms"),this.subscribeIntervalId=setInterval((()=>{(async()=>{this.toSubscribeContentTopics.size>0&&(Bi.info(`Subscription interval: ${this.toSubscribeContentTopics.size} topics to subscribe`),await this.attemptSubscribe({useNewContentTopics:!0})),this.toUnsubscribeContentTopics.size>0&&(Bi.info(`Subscription interval: ${this.toUnsubscribeContentTopics.size} topics to unsubscribe`),await this.attemptUnsubscribe({useNewContentTopics:!0}))})()}),1e3)}setupKeepAliveInterval(){Bi.info(`Setting up keep-alive interval with period ${this.config.keepAliveIntervalMs}ms`),this.keepAliveIntervalId=setInterval((()=>{(async()=>{Bi.info(`Keep-alive interval running for ${this.peers.size} peers`);let e=await Promise.all(Array.from(this.peers.values()).map((async e=>{if((await this.protocol.ping(e)).success)return Bi.info(`Ping successful for peer: ${e.toString()}`),void this.peerFailures.set(e,0);let t=this.peerFailures.get(e)||0;return t+=1,this.peerFailures.set(e,t),Bi.warn(`Ping failed for peer: ${e.toString()}, failures: ${t}/${this.config.pingsBeforePeerRenewed}`),t!!e)),await Promise.all(e.map((e=>(this.peers.delete(e),this.peerFailures.delete(e),this.requestUnsubscribe(e,this.contentTopics))))),e.length>0&&(Bi.info(`Replacing ${e.length} failed peers`),await this.attemptSubscribe({useNewContentTopics:!1,useOnlyNewPeers:!0}))})()}),this.config.keepAliveIntervalMs)}setupEventListeners(){this.libp2p.addEventListener("peer:connect",(e=>{this.onPeerConnected(e)})),this.libp2p.addEventListener("peer:disconnect",(e=>{this.onPeerDisconnected(e)}))}disposeIntervals(){this.subscribeIntervalId&&clearInterval(this.subscribeIntervalId),this.keepAliveIntervalId&&clearInterval(this.keepAliveIntervalId)}disposeHandlers(){for(const[e,t]of this.callbacks.entries())this.messageEmitter.removeEventListener(e.contentTopic,t);this.callbacks.clear()}async disposePeers(){await this.attemptUnsubscribe({useNewContentTopics:!1}),this.peers.clear(),this.peerFailures=new Map}disposeEventListeners(){this.libp2p.removeEventListener("peer:connect",this.onPeerConnected),this.libp2p.removeEventListener("peer:disconnect",this.onPeerDisconnected)}onPeerConnected(e){Bi.info(`Peer connected: ${e.detail.toString()}`),this.peers.has(e.detail)?Bi.info(`Peer ${e.detail.toString()} already subscribed, skipping`):this.attemptSubscribe({useNewContentTopics:!1,useOnlyNewPeers:!0})}onPeerDisconnected(e){Bi.info(`Peer disconnected: ${e.detail.toString()}`),this.peers.has(e.detail)?(Bi.info(`Active peer ${e.detail.toString()} disconnected, removing from peers list`),this.peers.delete(e.detail),this.attemptSubscribe({useNewContentTopics:!1,useOnlyNewPeers:!0})):Bi.info(`Disconnected peer ${e.detail.toString()} not in use, ignoring`)}async attemptSubscribe(e){const{useNewContentTopics:t,useOnlyNewPeers:r=!1}=e,n=t?Array.from(this.toSubscribeContentTopics):this.contentTopics;if(Bi.info(`Attempting to subscribe: useNewContentTopics=${t}, useOnlyNewPeers=${r}, contentTopics=${n.length}`),!n.length)return Bi.warn("Requested content topics is an empty array, skipping"),!1;const s=new Set(this.peers),i=this.peerManager.getPeers();for(const e of i){if(this.peers.size>=this.config.numPeersToUse)break;this.peers.add(e)}const o=r?Array.from(this.peers.values()).filter((e=>!s.has(e))):Array.from(this.peers.values());if(Bi.info(`Subscribing with ${o.length} peers for ${n.length} content topics`),r&&0===o.length)return Bi.warn("Requested to use only new peers, but no peers found, skipping"),!1;const a=await Promise.all(o.map((e=>this.requestSubscribe(e,n)))),c=a.filter((e=>e)).length;return Bi.info(`Subscribe attempts completed: ${c}/${a.length} successful`),t&&(this.toSubscribeContentTopics=new Set),a.some((e=>e))}async requestSubscribe(e,t){if(Bi.info(`requestSubscribe: pubsubTopic:${this.pubsubTopic}\tcontentTopics:${t.join(",")}`),!t.length||!this.pubsubTopic)return Bi.warn("requestSubscribe: no contentTopics or pubsubTopic provided, not sending subscribe request"),!1;const r=await this.protocol.subscribe(this.pubsubTopic,e,t);return r.failure?(Bi.warn(`requestSubscribe: Failed to subscribe ${this.pubsubTopic} to ${e.toString()} with error:${r.failure.error} for contentTopics:${t}`),!1):(Bi.info(`requestSubscribe: Subscribed ${this.pubsubTopic} to ${e.toString()} for contentTopics:${t}`),!0)}async attemptUnsubscribe(e){const{useNewContentTopics:t}=e,r=t?Array.from(this.toUnsubscribeContentTopics):this.contentTopics;if(Bi.info(`Attempting to unsubscribe: useNewContentTopics=${t}, contentTopics=${r.length}`),!r.length)return Bi.warn("Requested content topics is an empty array, skipping"),!1;const n=Array.from(this.peers.values()),s=await Promise.all(n.map((e=>this.requestUnsubscribe(e,t?r:void 0)))),i=s.filter((e=>e)).length;return Bi.info(`Unsubscribe attempts completed: ${i}/${s.length} successful`),t&&(this.toUnsubscribeContentTopics=new Set),s.some((e=>e))}async requestUnsubscribe(e,t){const r=t?await this.protocol.unsubscribe(this.pubsubTopic,e,t):await this.protocol.unsubscribeAll(this.pubsubTopic,e);return r.failure?(Bi.warn(`requestUnsubscribe: Failed to unsubscribe for pubsubTopic:${this.pubsubTopic} from peerId:${e.toString()} with error:${r.failure?.error} for contentTopics:${t}`),!1):(Bi.info(`requestUnsubscribe: Unsubscribed pubsubTopic:${this.pubsubTopic} from peerId:${e.toString()} for contentTopics:${t}`),!0)}}const $i=new bn("sdk:next-filter");class qi{libp2p;protocol;peerManager;connectionManager;config;subscriptions=new Map;constructor(e){this.config={numPeersToUse:2,pingsBeforePeerRenewed:3,keepAliveIntervalMs:6e4,...e.options},this.libp2p=e.libp2p,this.peerManager=e.peerManager,this.connectionManager=e.connectionManager,this.protocol=new vs(this.onIncomingMessage.bind(this),e.connectionManager.pubsubTopics,e.libp2p)}unsubscribeAll(){for(const e of this.subscriptions.values())e.stop();this.subscriptions.clear()}async subscribe(e,t){const r=Array.isArray(e)?e:[e];if(0===r.length)throw Error("Cannot subscribe with 0 decoders.");const n=r.map((e=>e.pubsubTopic)),s=r.map((e=>e.contentTopic));if(!this.isSamePubsubTopic(r))throw Error(`Cannot subscribe to more than one pubsub topic at the same time, got pubsubTopics:${n}`);if($i.info(`Subscribing to content topic: ${s}, pubsub topic: ${n}`),!this.connectionManager.pubsubTopics.includes(n[0]))throw Error(`Pubsub topic ${n[0]} has not been configured on this instance.`);let i=this.subscriptions.get(n[0]);i||(i=new Ui({pubsubTopic:n[0],libp2p:this.libp2p,protocol:this.protocol,config:this.config,peerManager:this.peerManager}),i.start());const o=await i.add(r,t);return this.subscriptions.set(n[0],i),$i.info(`Subscription ${o?"successful":"failed"} for content topic: ${s}`),o}async unsubscribe(e){const t=Array.isArray(e)?e:[e];if(0===t.length)throw Error("Cannot unsubscribe with 0 decoders.");const r=t.map((e=>e.pubsubTopic)),n=t.map((e=>e.contentTopic));if(!this.isSamePubsubTopic(t))throw Error(`Cannot unsubscribe with more than one pubsub topic at the same time, got pubsubTopics:${r}`);if($i.info(`Unsubscribing from content topic: ${n}, pubsub topic: ${r}`),!this.connectionManager.pubsubTopics.includes(r[0]))throw Error(`Pubsub topic ${r[0]} has not been configured on this instance.`);const s=this.subscriptions.get(r[0]);if(!s)return $i.warn("No subscriptions associated with the decoder."),!1;const i=await s.remove(t);return s.isEmpty()&&($i.warn("Subscription has no decoders anymore, terminating it."),s.stop(),this.subscriptions.delete(r[0])),$i.info(`Unsubscribing ${i?"successful":"failed"} for content topic: ${n}`),i}async onIncomingMessage(e,t,r){$i.info(`Received message for pubsubTopic:${e}, contentTopic:${t.contentTopic}, peerId:${r.toString()}`);const n=this.subscriptions.get(e);n?n.invoke(t,r):$i.error(`No subscription locally registered for topic ${e}`)}isSamePubsubTopic(e){const t=new Set;for(const r of e)t.add(r.pubsubTopic);return 1===t.size}}const ji=new bn("health-indicator");class zi extends Rs{libp2p;value=Yr.Unhealthy;constructor(e){super(),this.libp2p=e.libp2p,this.onPeerIdentify=this.onPeerIdentify.bind(this),this.onPeerDisconnected=this.onPeerDisconnected.bind(this)}start(){ji.info("start: adding listeners to libp2p"),this.libp2p.addEventListener("peer:identify",this.onPeerIdentify),this.libp2p.addEventListener("peer:disconnect",this.onPeerDisconnected)}stop(){ji.info("stop: removing listeners to libp2p"),this.libp2p.removeEventListener("peer:identify",this.onPeerIdentify),this.libp2p.removeEventListener("peer:disconnect",this.onPeerDisconnected)}toString(){return this.value}toValue(){return this.value}async onPeerDisconnected(e){ji.info("onPeerDisconnected: received libp2p event"),this.libp2p.getConnections().length>0&&ji.info("onPeerDisconnected: has connections, ignoring"),this.value=Yr.Unhealthy,ji.info(`onPeerDisconnected: node identified as ${this.value}`),this.dispatchHealthEvent()}async onPeerIdentify(e){ji.info("onPeerIdentify: received libp2p event");const t=this.libp2p.getConnections(),r=await Promise.all(t.map((async e=>{try{return await this.libp2p.peerStore.get(e.remotePeer)}catch(e){return null}}))),n=r.filter((e=>e?.protocols.includes(bs))).length,s=r.filter((e=>e?.protocols.includes(As))).length;0===n||0===s?this.value=Yr.Unhealthy:n>=2&&s>=2?this.value=Yr.SufficientlyHealthy:1===n&&1===s?this.value=Yr.MinimallyHealthy:ji.error(`onPeerChange: unexpected state, cannot identify health status of the node: Filter:${n}; LightPush:${s}`),ji.info(`onPeerChange: node identified as ${this.value}`),this.dispatchHealthEvent()}dispatchHealthEvent(){this.dispatchEvent(new CustomEvent(Zr.StatusChange,{detail:this.value}))}}const Hi=e=>new Promise(((t,r)=>setTimeout((()=>r(new Error("Task timeout"))),e))),Ki=new bn("sdk:retry-manager");class Vi{intervalID=null;retryIntervalMs;inProgress=0;queue=[];peerManager;constructor(e){this.peerManager=e.peerManager,this.retryIntervalMs=e.retryIntervalMs}start(){this.intervalID=setInterval((()=>{this.processQueue()}),this.retryIntervalMs)}stop(){this.intervalID&&(clearInterval(this.intervalID),this.intervalID=null)}push(e,t){this.queue.push({maxAttempts:t,callback:e})}processQueue(){if(0!==this.queue.length)for(;this.queue.length&&this.inProgress<5;){const e=this.queue.shift();e&&this.scheduleTask(e)}else Ki.info("processQueue: queue is empty")}scheduleTask(e){setTimeout((async()=>this.taskExecutor(e)),100)}async taskExecutor(e){const t=this.peerManager.getPeers()[0];var r;if(t)try{this.inProgress+=1;const r=await Promise.race([Hi(1e4),e.callback(t)]);if(r?.failure)throw Error(r.failure.error);if(Ki.info("scheduleTask: executed successfully"),0===e.maxAttempts)return void Ki.warn("scheduleTask: discarded a task due to limit of max attempts");this.queue.push({...e,maxAttempts:e.maxAttempts-1})}catch(n){const s=n;if(Ki.error("scheduleTask: task execution failed with error:",s),((r=s.message)===Vr.REMOTE_PEER_REJECTED||r===Vr.NO_RESPONSE||r===Vr.RLN_PROOF_GENERATION||r===Vr.NO_PEER_AVAILABLE)&&this.peerManager.requestRenew(t),0===e.maxAttempts)return void Ki.warn("scheduleTask: discarded a task due to limit of max attempts");this.queue.push({...e,maxAttempts:e.maxAttempts-1})}finally{this.inProgress-=1}else Ki.warn("scheduleTask: no peers, skipping")}}const Gi=new bn("sdk:light-push"),Wi={autoRetry:!0,retryIntervalMs:1e3,maxAttempts:3,numPeersToUse:1};class Xi{config;retryManager;peerManager;protocol;constructor(e){this.config={...Wi,...e.options||{}},this.peerManager=e.peerManager,this.protocol=new Is(e.connectionManager.pubsubTopics,e.libp2p),this.retryManager=new Vi({peerManager:e.peerManager,retryIntervalMs:this.config.retryIntervalMs})}start(){this.retryManager.start()}stop(){this.retryManager.stop()}async send(e,t,r={}){r={...this.config,...r};const{pubsubTopic:n}=e;if(Gi.info("send: attempting to send a message to pubsubTopic:",n),!this.protocol.pubsubTopics.includes(n))return{successes:[],failures:[{error:Vr.TOPIC_NOT_CONFIGURED}]};const s=this.peerManager.getPeers().slice(0,this.config.numPeersToUse);if(0===s.length)return{successes:[],failures:[{error:Vr.NO_PEER_AVAILABLE}]};const i=await Promise.all(s.map((r=>this.protocol.send(e,t,r).catch((e=>({success:null,failure:{error:Vr.GENERIC_FAIL}})))))),o={successes:i.filter((e=>e.success)).map((e=>e.success)),failures:i.filter((e=>e.failure)).map((e=>e.failure))};if(r.autoRetry&&0===o.successes.length){const n=r=>this.protocol.send(e,t,r);this.retryManager.push(n.bind(this),r.maxAttempts||3)}return o}}const Ji=new bn("peer-manager"),Qi="peer-manager-lock";class Zi{numPeersToUse;libp2p;constructor(e){this.onConnected=this.onConnected.bind(this),this.onDisconnected=this.onDisconnected.bind(this),this.numPeersToUse=e?.config?.numPeersToUse||2,this.libp2p=e.libp2p}start(){this.startConnectionListener()}stop(){this.stopConnectionListener()}getPeers(){return this.getLockedConnections().map((e=>e.remotePeer))}requestRenew(e){const t=this.getLockedConnections(),r=this.numPeersToUse-t.length;if(0===r)return;const n=this.getUnlockedConnections().filter((t=>!t.remotePeer.equals(e))).slice(0,r).map((e=>this.lockConnection(e))).map((e=>e.remotePeer))[0];if(n)return Ji.info(`requestRenew: Renewed peer ${e.toString()} to ${n.toString()}`),n;Ji.warn(`requestRenew: Couldn't renew peer ${e.toString()} - no peers.`)}startConnectionListener(){this.libp2p.addEventListener("peer:connect",this.onConnected),this.libp2p.addEventListener("peer:disconnect",this.onDisconnected)}stopConnectionListener(){this.libp2p.removeEventListener("peer:connect",this.onConnected),this.libp2p.removeEventListener("peer:disconnect",this.onDisconnected)}onConnected(e){const t=e.detail;this.lockPeerIfNeeded(t)}onDisconnected(e){const t=e.detail;this.requestRenew(t)}lockPeerIfNeeded(e){const t=this.getLockedConnections();0!=this.numPeersToUse-t.length&&this.getUnlockedConnections().filter((t=>t.remotePeer.equals(e))).map((e=>this.lockConnection(e)))}getLockedConnections(){return this.libp2p.getConnections().filter((e=>"open"===e.status&&this.isConnectionLocked(e)))}getUnlockedConnections(){return this.libp2p.getConnections().filter((e=>"open"===e.status&&!this.isConnectionLocked(e)))}lockConnection(e){return Ji.info(`requestRenew: Locking connection for peerId=${e.remotePeer.toString()}`),e.tags.push(Qi),e}isConnectionLocked(e){return e.tags.includes(Qi)}}const Yi=new bn("waku:store:sdk");class eo{options;peerManager;connectionManager;protocol;constructor(e){this.options=e.options||{},this.peerManager=e.peerManager,this.connectionManager=e.connectionManager,this.protocol=new Ls(e.connectionManager.pubsubTopics,e.libp2p)}async*queryGenerator(e,t){const{pubsubTopic:r,contentTopics:n,decodersAsMap:s}=this.validateDecodersAndPubsubTopic(e),i={pubsubTopic:r,contentTopics:n,includeData:!0,paginationForward:!0,...t},o=await this.getPeerToUse();if(!o)throw Yi.error("No peers available to query"),new Error("No peers available to query");Yi.info(`Querying store with options: ${JSON.stringify(t)}`);const a=this.protocol.queryPerPage(i,s,o);for await(const e of a)yield e}async queryWithOrderedCallback(e,t,r){Yi.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){Yi.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(Ir);return await Promise.all(n.map((async e=>{e&&!r&&(r=Boolean(await t(e)))}))),r}createCursor(e){return Pi(e.pubsubTopic,e)}validateDecodersAndPubsubTopic(e){if(0===e.length)throw Yi.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 Yi.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];un(r,this.protocol.pubsubTopics);const n=new Map;e.forEach((e=>{if(n.has(e.contentTopic))throw Yi.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 Yi.error(`No decoders found for topic ${r}`),new Error("No decoders found for topic "+r);return{pubsubTopic:r,contentTopics:s,decodersAsMap:n}}async getPeerToUse(){let e;if(this.options?.peer){const t=(await this.connectionManager.getConnectedPeers()).find((e=>e.id.toString()===this.options?.peer));e=t?.id,e||Yi.warn(`Passed node to use for Store not found: ${this.options.peer}. Attempting to use random peers.`)}const t=this.peerManager.getPeers();if(t.length>0)return t[Math.floor(Math.random()*t.length)];Yi.error("No peers available to use.")}}const to=(e,t)=>{const r=e.shardInfo?.clusterId||t.clusterId,n=e.shardInfo&&"shardsUnderCluster"in e.shardInfo?e.shardInfo.shardsUnderCluster:8;return{clusterId:r,shard:e.shardInfo&&"shard"in e.shardInfo?e.shardInfo.shard:hn(e.contentTopic,n)}},ro=(e,t)=>t.clusterId===e.clusterId&&!("shards"in t&&!t.shards.includes(e.shard)),no=new bn("wait-for-remote-peer");async function so(e,t){const r=[];return e.relay&&t.includes(Kr.Relay)&&r.push(e.relay.waitForPeers()),e.store&&t.includes(Kr.Store)&&r.push(io(Ps,e.libp2p)),e.lightPush&&t.includes(Kr.LightPush)&&r.push(io(As,e.libp2p)),e.filter&&t.includes(Kr.Filter)&&r.push(io(bs,e.libp2p)),Promise.all(r)}async function io(e,t){no.info(`Waiting for ${e} peer.`),await new Promise((r=>{const n=async s=>{if(s.detail?.protocols?.includes(e)){const e=t.services.metadata;if(!e)return t.removeEventListener("peer:identify",n),void r();try{await e.confirmOrAttemptHandshake(s.detail.peerId),t.removeEventListener("peer:identify",n),r()}catch(e){"ERR_CONNECTION_BEING_CLOSED"===e.code&&no.error("Connection closed. Some peers can be on different shard."),no.error(`Error waiting for metadata: ${e}`)}}};t.addEventListener("peer:identify",n)}))}const oo=(e,t)=>new Promise(((r,n)=>setTimeout((()=>n(Error(t))),e))),ao=new bn("waku");class co{pubsubTopics;libp2p;relay;store;filter;nextFilter;lightPush;connectionManager;health;networkConfig;_nodeStateLock=!1;_nodeStarted=!1;peerManager;constructor(e,t,r,n,s){this.pubsubTopics=e,this.relay=s,this.libp2p=r,this.networkConfig=t.networkConfig||Qr,n={filter:!1,lightpush:!1,store:!1,...n};const i=this.libp2p.peerId.toString();this.connectionManager=new ki({libp2p:r,relay:this.relay,pubsubTopics:this.pubsubTopics,config:t?.connectionManager}),this.peerManager=new Zi({libp2p:r,config:{numPeersToUse:t.numPeersToUse}}),this.health=new zi({libp2p:r}),n.store&&(t.store?.peer&&this.connectionManager.rawDialPeerWithProtocols(t.store.peer,[Ps]).catch((e=>{ao.error("Failed to dial store peer",e)})),this.store=new eo({libp2p:r,connectionManager:this.connectionManager,peerManager:this.peerManager,options:{peer:t.store?.peer}})),n.lightpush&&(this.lightPush=new Xi({libp2p:r,peerManager:this.peerManager,connectionManager:this.connectionManager,options:t?.lightPush})),n.filter&&(this.filter=new Mi({libp2p:r,connectionManager:this.connectionManager,peerManager:this.peerManager,lightPush:this.lightPush,options:t.filter}),this.nextFilter=new qi({libp2p:r,connectionManager:this.connectionManager,peerManager:this.peerManager,options:t.filter})),ao.info("Waku node created",i,`relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this.lightPush}, filter: ${!!this.filter}`)}get peerId(){return this.libp2p.peerId}get protocols(){return this.libp2p.getProtocols()}async dial(e,t){const r=t??[];void 0===t&&(this.relay&&r.push(Kr.Relay),this.store&&r.push(Kr.Store),this.filter&&r.push(Kr.Filter),this.lightPush&&r.push(Kr.LightPush));const n=[];r.includes(Kr.Relay)&&(this.relay?this.relay.gossipSub.multicodecs.forEach((e=>n.push(e))):ao.error("Relay codec not included in dial codec: protocol not mounted locally")),r.includes(Kr.Store)&&(this.store?n.push(this.store.protocol.multicodec):ao.error("Store codec not included in dial codec: protocol not mounted locally")),r.includes(Kr.LightPush)&&(this.lightPush?n.push(this.lightPush.protocol.multicodec):ao.error("Light Push codec not included in dial codec: protocol not mounted locally")),r.includes(Kr.Filter)&&(this.filter?n.push(this.filter.protocol.multicodec):ao.error("Filter codec not included in dial codec: protocol not mounted locally"));const s=(e=>Os(e)?e:vi(e))(e);return ao.info(`Dialing to ${s.toString()} with protocols ${r}`),await this.connectionManager.rawDialPeerWithProtocols(e,n)}async start(){this._nodeStateLock||this.isStarted()||(this._nodeStateLock=!0,await this.libp2p.start(),this.peerManager.start(),this.health.start(),this.lightPush?.start(),this._nodeStateLock=!1,this._nodeStarted=!0)}async stop(){!this._nodeStateLock&&this.isStarted()&&(this._nodeStateLock=!0,this.lightPush?.stop(),this.health.stop(),this.peerManager.stop(),this.connectionManager.stop(),await this.libp2p.stop(),this._nodeStateLock=!1,this._nodeStarted=!1)}async getConnectedPeers(){return this.connectionManager.getConnectedPeers()}async waitForPeers(e,t){return async function(e,t,r){t=t?.length?t:function(e){const t=[];return e.relay&&t.push(Kr.Relay),e.filter&&t.push(Kr.Filter),e.store&&t.push(Kr.Store),e.lightPush&&t.push(Kr.LightPush),t}(e);const n=e.libp2p.getConnections();if(!e.isStarted())throw Error("Waku node is not started");for(const r of t)switch(r){case Kr.Relay:if(!e.relay)throw Error("Cannot wait for Relay peer: protocol not mounted");break;case Kr.LightPush:if(!e.lightPush)throw Error("Cannot wait for LightPush peer: protocol not mounted");break;case Kr.Store:if(!e.store)throw Error("Cannot wait for Store peer: protocol not mounted");break;case Kr.Filter:if(!e.filter)throw Error("Cannot wait for Filter peer: protocol not mounted")}const s=[so(e,t)];n.length>0&&!t.includes(Kr.Relay)&&s.push(async function(e,t){const r=e.libp2p.getPeers(),n=e.libp2p.services.metadata,s=function(e){const t=new Map,r={[Kr.Filter]:bs,[Kr.LightPush]:As,[Kr.Store]:Ps};for(const n of e)r[n]&&t.set(r[n],!1);return t}(t);if(r.length&&n)for(const t of r)try{const r=await e.libp2p.peerStore.get(t);if(r.protocols.some((e=>s.has(e)))&&!(await n.confirmOrAttemptHandshake(t)).error&&(r.protocols.forEach((e=>{s.has(e)&&s.set(e,!0)})),Array.from(s.values()).every((e=>e))))return}catch(e){"ERR_CONNECTION_BEING_CLOSED"===e.code&&no.error("Connection closed. Some peers can be on different shard."),no.error(`Error while iterating through peers: ${e}`);continue}else no.info(`Skipping waitForMetadata due to missing connections:${r.length} or metadataService:${!!n}`)}(e,t)),r?await async function(e,t){await Promise.race([e,oo(t,"Timed out waiting for a remote peer.")])}(Promise.any(s),r):await Promise.any(s)}(this,e,t)}isStarted(){return this._nodeStarted&&"started"===this.libp2p.status}isConnected(){return this.connectionManager.isConnected()}createDecoder(e){const t=to(e,this.networkConfig);if(ao.info(`Creating Decoder with input:${JSON.stringify(e.shardInfo)}, determined:${JSON.stringify(t)}, expected:${JSON.stringify(this.networkConfig)}.`),!ro(t,this.networkConfig))throw Error("Cannot create decoder: incompatible shard configuration.");return kn(e.contentTopic,t)}createEncoder(e){const t=to(e,this.networkConfig);if(ao.info(`Creating Encoder with input:${JSON.stringify(e.shardInfo)}, determined:${JSON.stringify(t)}, expected:${JSON.stringify(this.networkConfig)}.`),!ro(t,this.networkConfig))throw Error("Cannot create encoder: incompatible shard configuration.");return An({contentTopic:e.contentTopic,ephemeral:e.ephemeral,pubsubTopicShardInfo:t})}}class lo extends Error{static name="AbortError";constructor(e="The operation was aborted"){super(e),this.name="AbortError"}}class uo extends Error{static name="UnexpectedPeerError";constructor(e="Unexpected Peer"){super(e),this.name="UnexpectedPeerError"}}Error;class ho extends Error{static name="InvalidParametersError";constructor(e="Invalid parameters"){super(e),this.name="InvalidParametersError"}}class po extends Error{static name="InvalidPublicKeyError";constructor(e="Invalid public key"){super(e),this.name="InvalidPublicKeyError"}}class fo extends Error{static name="InvalidPrivateKeyError";constructor(e="Invalid private key"){super(e),this.name="InvalidPrivateKeyError"}}Error;class go extends Error{static name="ConnectionClosingError";constructor(e="The connection is closing"){super(e),this.name="ConnectionClosingError"}}class mo extends Error{static name="ConnectionClosedError";constructor(e="The connection is closed"){super(e),this.name="ConnectionClosedError"}}class yo extends Error{static name="ConnectionFailedError";constructor(e="Connection failed"){super(e),this.name="ConnectionFailedError"}}class bo extends Error{static name="MuxerClosedError";constructor(e="The muxer is closed"){super(e),this.name="MuxerClosedError"}}class wo extends Error{static name="StreamResetError";constructor(e="The stream has been reset"){super(e),this.name="StreamResetError"}}class vo extends Error{static name="StreamStateError";constructor(e="The stream is in an invalid state"){super(e),this.name="StreamStateError"}}class Eo extends Error{static name="NotFoundError";constructor(e="Not found"){super(e),this.name="NotFoundError"}}class So extends Error{static name="InvalidPeerIdError";constructor(e="Invalid PeerID"){super(e),this.name="InvalidPeerIdError"}}class Ao extends Error{static name="InvalidMultiaddrError";constructor(e="Invalid multiaddr"){super(e),this.name="InvalidMultiaddrError"}}class Io extends Error{static name="InvalidCIDError";constructor(e="Invalid CID"){super(e),this.name="InvalidCIDError"}}class ko extends Error{static name="InvalidMultihashError";constructor(e="Invalid Multihash"){super(e),this.name="InvalidMultihashError"}}class xo extends Error{static name="UnsupportedProtocolError";constructor(e="Unsupported protocol error"){super(e),this.name="UnsupportedProtocolError"}}class Co extends Error{static name="InvalidMessageError";constructor(e="Invalid message"){super(e),this.name="InvalidMessageError"}}class _o extends Error{static name="ProtocolError";constructor(e="Protocol error"){super(e),this.name="ProtocolError"}}class To extends Error{static name="TimeoutError";constructor(e="Timed out"){super(e),this.name="TimeoutError"}}class Po extends Error{static name="NotStartedError";constructor(e="Not started"){super(e),this.name="NotStartedError"}}Error;class Lo extends Error{static name="DialError";constructor(e="Dial error"){super(e),this.name="DialError"}}Error;class Ro extends Error{static name="LimitedConnectionError";constructor(e="Limited connection"){super(e),this.name="LimitedConnectionError"}}class No extends Error{static name="TooManyInboundProtocolStreamsError";constructor(e="Too many inbound protocol streams"){super(e),this.name="TooManyInboundProtocolStreamsError"}}class Oo extends Error{static name="TooManyOutboundProtocolStreamsError";constructor(e="Too many outbound protocol streams"){super(e),this.name="TooManyOutboundProtocolStreamsError"}}class Do extends Error{static name="UnsupportedKeyTypeError";constructor(e="Unsupported key type"){super(e),this.name="UnsupportedKeyTypeError"}}const Mo=parseInt("11111",2),Fo=parseInt("10000000",2),Bo=parseInt("01111111",2),Uo={0:jo,1:jo,2:function(e,t){const r=qo(e,t),n=t.offset,s=t.offset+r,i=[];for(let t=n;t=e.byteLength);){const n=$o(e,t);if(null===n)break;r.push(n)}return r}function zo(e){if(e.byteLength<128)return Uint8Array.from([e.byteLength]);const t=function(e){let t=e.toString(16);t.length%2==1&&(t="0"+t);const r=new Rn;for(let e=0;e>ia&sa)}:{h:0|Number(e>>ia&sa),l:0|Number(e&sa)}}const aa={fromBig:oa,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,i)=>t+r+n+s+i+(e/2**32|0)|0,add5L:(e,t,r,n,s)=>(e>>>0)+(t>>>0)+(r>>>0)+(n>>>0)+(s>>>0)},ca=aa,[la,ua]=(()=>ca.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)))))(),ha=new Uint32Array(80),da=new Uint32Array(80);class pa extends Ur{constructor(e=64){super(128,e,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:i,Dh:o,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,i,o,a,c,l,u,h,d,p,f,g]}set(e,t,r,n,s,i,o,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|i,this.Dh=0|o,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)ha[r]=e.getUint32(t),da[r]=e.getUint32(t+=4);for(let e=16;e<80;e++){const t=0|ha[e-15],r=0|da[e-15],n=ca.rotrSH(t,r,1)^ca.rotrSH(t,r,8)^ca.shrSH(t,r,7),s=ca.rotrSL(t,r,1)^ca.rotrSL(t,r,8)^ca.shrSL(t,r,7),i=0|ha[e-2],o=0|da[e-2],a=ca.rotrSH(i,o,19)^ca.rotrBH(i,o,61)^ca.shrSH(i,o,6),c=ca.rotrSL(i,o,19)^ca.rotrBL(i,o,61)^ca.shrSL(i,o,6),l=ca.add4L(s,c,da[e-7],da[e-16]),u=ca.add4H(l,n,a,ha[e-7],ha[e-16]);ha[e]=0|u,da[e]=0|l}let{Ah:r,Al:n,Bh:s,Bl:i,Ch:o,Cl:a,Dh:c,Dl:l,Eh:u,El:h,Fh:d,Fl:p,Gh:f,Gl:g,Hh:m,Hl:y}=this;for(let e=0;e<80;e++){const t=ca.rotrSH(u,h,14)^ca.rotrSH(u,h,18)^ca.rotrBH(u,h,41),b=ca.rotrSL(u,h,14)^ca.rotrSL(u,h,18)^ca.rotrBL(u,h,41),w=u&d^~u&f,v=h&p^~h&g,E=ca.add5L(y,b,v,ua[e],da[e]),S=ca.add5H(E,m,t,w,la[e],ha[e]),A=0|E,I=ca.rotrSH(r,n,28)^ca.rotrBH(r,n,34)^ca.rotrBH(r,n,39),k=ca.rotrSL(r,n,28)^ca.rotrBL(r,n,34)^ca.rotrBL(r,n,39),x=r&s^r&o^s&o,C=n&i^n&a^i&a;m=0|f,y=0|g,f=0|d,g=0|p,d=0|u,p=0|h,({h:u,l:h}=ca.add(0|c,0|l,0|S,0|A)),c=0|o,l=0|a,o=0|s,a=0|i,s=0|r,i=0|n;const _=ca.add3L(A,k,C);r=ca.add3H(_,S,I,x),n=0|_}({h:r,l:n}=ca.add(0|this.Ah,0|this.Al,0|r,0|n)),({h:s,l:i}=ca.add(0|this.Bh,0|this.Bl,0|s,0|i)),({h:o,l:a}=ca.add(0|this.Ch,0|this.Cl,0|o,0|a)),({h:c,l}=ca.add(0|this.Dh,0|this.Dl,0|c,0|l)),({h:u,l:h}=ca.add(0|this.Eh,0|this.El,0|u,0|h)),({h:d,l:p}=ca.add(0|this.Fh,0|this.Fl,0|d,0|p)),({h:f,l:g}=ca.add(0|this.Gh,0|this.Gl,0|f,0|g)),({h:m,l:y}=ca.add(0|this.Hh,0|this.Hl,0|m,0|y)),this.set(r,n,s,i,o,a,c,l,u,h,d,p,f,g,m,y)}roundClean(){ha.fill(0),da.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 fa=Mr((()=>new pa)),ga=BigInt(0),ma=BigInt(1);function ya(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&"Uint8Array"===e.constructor.name}function ba(e){if(!ya(e))throw new Error("Uint8Array expected")}function wa(e,t){if("boolean"!=typeof t)throw new Error(e+" boolean expected, got "+t)}function va(e){const t=e.toString(16);return 1&t.length?"0"+t:t}function Ea(e){if("string"!=typeof e)throw new Error("hex string expected, got "+typeof e);return""===e?ga:BigInt("0x"+e)}const Sa="function"==typeof Uint8Array.from([]).toHex&&"function"==typeof Uint8Array.fromHex,Aa=Array.from({length:256},((e,t)=>t.toString(16).padStart(2,"0")));function Ia(e){if(ba(e),Sa)return e.toHex();let t="";for(let r=0;r=48&&e<=57?e-48:e>=65&&e<=70?e-55:e>=97&&e<=102?e-87:void 0}function xa(e){if("string"!=typeof e)throw new Error("hex string expected, got "+typeof e);if(Sa)return Uint8Array.fromHex(e);const t=e.length,r=t/2;if(t%2)throw new Error("hex string expected, got unpadded hex of length "+t);const n=new Uint8Array(r);for(let t=0,s=0;t"bigint"==typeof e&&ga<=e;function Oa(e,t,r){return Na(e)&&Na(t)&&Na(r)&&t<=e&&e(ma<new Uint8Array(e),Ba=e=>Uint8Array.from(e),Ua={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||ya(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 $a(e,t,r={}){const n=(t,r,n)=>{const s=Ua[r];if("function"!=typeof s)throw new Error("invalid validator function");const i=e[t];if(!(n&&void 0===i||s(i,e)))throw new Error("param "+String(t)+" is invalid. Expected "+r+", got "+i)};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 qa(e){const t=new WeakMap;return(r,...n)=>{const s=t.get(r);if(void 0!==s)return s;const i=e(r,...n);return t.set(r,i),i}}const ja=BigInt(0),za=BigInt(1),Ha=BigInt(2),Ka=BigInt(3),Va=BigInt(4),Ga=BigInt(5),Wa=BigInt(8);function Xa(e,t){const r=e%t;return r>=ja?r:t+r}function Ja(e,t,r){if(tja;)t&za&&(n=n*e%r),e=e*e%r,t>>=za;return n}function Qa(e,t,r){let n=e;for(;t-- >ja;)n*=n,n%=r;return n}function Za(e,t){if(e===ja)throw new Error("invert: expected non-zero number");if(t<=ja)throw new Error("invert: expected positive modulus, got "+t);let r=Xa(e,t),n=t,s=ja,i=za,o=za,a=ja;for(;r!==ja;){const e=n/r,t=n%r,c=s-o*e,l=i-a*e;n=r,r=t,s=o,i=a,o=c,a=l}if(n!==za)throw new Error("invert: does not exist");return Xa(s,t)}const Ya=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"];function ec(e,t){const r=void 0!==t?t:e.toString(2).length;return{nBitLength:r,nByteLength:Math.ceil(r/8)}}function tc(e,t,r=!1,n={}){if(e<=ja)throw new Error("invalid field: expected ORDER > 0, got "+e);const{nBitLength:s,nByteLength:i}=ec(e,t);if(i>2048)throw new Error("invalid field: expected ORDER of <= 2048 bytes");let o;const a=Object.freeze({ORDER:e,isLE:r,BITS:s,BYTES:i,MASK:Ma(s),ZERO:ja,ONE:za,create:t=>Xa(t,e),isValid:t=>{if("bigint"!=typeof t)throw new Error("invalid field element: expected bigint, got "+typeof t);return ja<=t&&te===ja,isOdd:e=>(e&za)===za,neg:t=>Xa(-t,e),eql:(e,t)=>e===t,sqr:t=>Xa(t*t,e),add:(t,r)=>Xa(t+r,e),sub:(t,r)=>Xa(t-r,e),mul:(t,r)=>Xa(t*r,e),pow:(e,t)=>function(e,t,r){if(rja;)r&za&&(n=e.mul(n,s)),s=e.sqr(s),r>>=za;return n}(a,e,t),div:(t,r)=>Xa(t*Za(r,e),e),sqrN:e=>e*e,addN:(e,t)=>e+t,subN:(e,t)=>e-t,mulN:(e,t)=>e*t,inv:t=>Za(t,e),sqrt:n.sqrt||(t=>(o||(o=function(e){if(e%Va===Ka){const t=(e+za)/Va;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%Wa===Ga){const t=(e-Ga)/Wa;return function(e,r){const n=e.mul(r,Ha),s=e.pow(n,t),i=e.mul(r,s),o=e.mul(e.mul(i,Ha),s),a=e.mul(i,e.sub(o,e.ONE));if(!e.eql(e.sqr(a),r))throw new Error("Cannot find square root");return a}}return function(e){const t=(e-za)/Ha;let r,n,s;for(r=e-za,n=0;r%Ha===ja;r/=Ha,n++);for(s=Ha;s1e3)throw new Error("Cannot find square root: likely non-prime P");if(1===n){const t=(e+za)/Va;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}}const i=(r+za)/Ha;return function(e,o){if(e.pow(o,t)===e.neg(e.ONE))throw new Error("Cannot find square root");let a=n,c=e.pow(e.mul(e.ONE,s),r),l=e.pow(o,i),u=e.pow(o,r);for(;!e.eql(u,e.ONE);){if(e.eql(u,e.ZERO))return e.ZERO;let t=1;for(let r=e.sqr(u);tfunction(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?Pa(e,i):Ta(e,i),fromBytes:e=>{if(e.length!==i)throw new Error("Field.fromBytes: expected "+i+" bytes, got "+e.length);return r?_a(e):Ca(e)}});return Object.freeze(a)}function rc(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 nc(e){const t=rc(e);return t+Math.ceil(t/2)}const sc=BigInt(0),ic=BigInt(1);function oc(e,t){const r=t.negate();return e?r:t}function ac(e,t){if(!Number.isSafeInteger(e)||e<=0||e>t)throw new Error("invalid window size, expected [1.."+t+"], got W="+e)}function cc(e,t){ac(e,t);const r=2**e;return{windows:Math.ceil(t/e)+1,windowSize:2**(e-1),mask:Ma(e),maxNumber:r,shiftBy:BigInt(e)}}function lc(e,t,r){const{windowSize:n,mask:s,maxNumber:i,shiftBy:o}=r;let a=Number(e&s),c=e>>o;a>n&&(a-=i,c+=ic);const l=t*n;return{nextN:c,offset:l+Math.abs(a)-1,isZero:0===a,isNeg:a<0,isNegF:t%2!=0,offsetF:l}}const uc=new WeakMap,hc=new WeakMap;function dc(e){return hc.get(e)||1}function pc(e,t){return{constTimeNegate:oc,hasPrecomputes:e=>1!==dc(e),unsafeLadder(t,r,n=e.ZERO){let s=t;for(;r>sc;)r&ic&&(n=n.add(s)),s=s.double(),r>>=ic;return n},precomputeWindow(e,r){const{windows:n,windowSize:s}=cc(r,t),i=[];let o=e,a=o;for(let e=0;e{if(!(e instanceof t))throw new Error("invalid point at index "+r)}))}(r,e),function(e,t){if(!Array.isArray(e))throw new Error("array of scalars expected");e.forEach(((e,r)=>{if(!t.isValid(e))throw new Error("invalid scalar at index "+r)}))}(n,t),r.length!==n.length)throw new Error("arrays of points and scalars must have equal length");const s=e.ZERO,i=function(e){let t;for(t=0;e>ga;e>>=ma,t+=1);return t}(BigInt(r.length)),o=i>12?i-3:i>4?i-2:i?2:1,a=Ma(o),c=new Array(Number(a)+1).fill(s);let l=s;for(let e=Math.floor((t.BITS-1)/o)*o;e>=0;e-=o){c.fill(s);for(let t=0;t>BigInt(e)&a);c[i]=c[i].add(r[t])}let t=s;for(let e=c.length-1,r=s;e>0;e--)r=r.add(c[e]),t=t.add(r);if(l=l.add(t),0!==e)for(let e=0;e(e[t]="function",e)),{ORDER:"bigint",MASK:"bigint",BYTES:"isSafeInteger",BITS:"isSafeInteger"});$a(e,t)}(e.Fp),$a(e,{n:"bigint",h:"bigint",Gx:"field",Gy:"field"},{nBitLength:"isSafeInteger",nByteLength:"isSafeInteger"}),Object.freeze({...ec(e.n,e.nBitLength),...e,p:e.Fp.ORDER})}const mc=BigInt(0),yc=BigInt(1),bc=BigInt(2),wc=BigInt(8),vc={zip215:!0};const Ec=BigInt(0),Sc=BigInt(1);const Ac=BigInt("57896044618658097711785492504343953926634992332820282019728792003956564819949"),Ic=BigInt("19681161376707505956807079304988542015446066515923890162744021073123829784752"),kc=(BigInt(0),BigInt(1)),xc=BigInt(2),Cc=BigInt(3),_c=BigInt(5),Tc=BigInt(8);function Pc(e){const t=BigInt(10),r=BigInt(20),n=BigInt(40),s=BigInt(80),i=Ac,o=e*e%i*e%i,a=Qa(o,xc,i)*o%i,c=Qa(a,kc,i)*e%i,l=Qa(c,_c,i)*c%i,u=Qa(l,t,i)*l%i,h=Qa(u,r,i)*u%i,d=Qa(h,n,i)*h%i,p=Qa(d,s,i)*d%i,f=Qa(p,s,i)*d%i,g=Qa(f,t,i)*l%i;return{pow_p_5_8:Qa(g,xc,i)*e%i,b2:o}}function Lc(e){return e[0]&=248,e[31]&=127,e[31]|=64,e}function Rc(e,t){const r=Ac,n=Xa(t*t*t,r),s=Xa(n*n*t,r);let i=Xa(e*n*Pc(e*s).pow_p_5_8,r);const o=Xa(t*i*i,r),a=i,c=Xa(i*Ic,r),l=o===e,u=o===Xa(-e,r),h=o===Xa(-e*Ic,r);return l&&(i=a),(u||h)&&(i=c),(Xa(i,r)&za)===za&&(i=Xa(-i,r)),{isValid:l||u,value:i}}const Nc=(()=>tc(Ac,void 0,!0))(),Oc=(()=>({a:Nc.create(BigInt(-1)),d:BigInt("37095705934669439343138083508754565189542113879843219016388785533085940283555"),Fp:Nc,n:BigInt("7237005577332262213973186563042994240857116359379907606001950938285454250989"),h:Tc,Gx:BigInt("15112221349535400772501151409588531511454012693041857206046113283949847762202"),Gy:BigInt("46316835694926478169428394003475163141307993866256225615783033603165251855960"),hash:fa,randomBytes:Fr,adjustScalarBytes:Lc,uvRatio:Rc}))(),Dc=(()=>function(e){const t=function(e){const t=gc(e);return $a(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:i,randomBytes:o,nByteLength:a,h:c}=t,l=bc<{try{return{isValid:!0,value:r.sqrt(e*r.inv(t))}}catch(e){return{isValid:!1,value:mc}}}),p=t.adjustScalarBytes||(e=>e),f=t.domain||((e,t,r)=>{if(wa("phflag",r),t.length||r)throw new Error("Contexts/pre-hash are not supported");return e});function g(e,t,r=!1){Da("coordinate "+e,t,r?yc:mc,l)}function m(e){if(!(e instanceof w))throw new Error("ExtendedPoint expected")}const y=qa(((e,t)=>{const{ex:n,ey:s,ez:i}=e,o=e.is0();null==t&&(t=o?wc:r.inv(i));const a=u(n*t),c=u(s*t),l=u(i*t);if(o)return{x:mc,y:yc};if(l!==yc)throw new Error("invZ was invalid");return{x:a,y:c}})),b=qa((e=>{const{a:r,d:n}=t;if(e.is0())throw new Error("bad point: ZERO");const{ex:s,ey:i,ez:o,et:a}=e,c=u(s*s),l=u(i*i),h=u(o*o),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*i)!==u(o*a))throw new Error("bad point: equation left != right (2)");return!0}));class w{constructor(e,t,r,n){g("x",e),g("y",t),g("z",r,!0),g("t",n),this.ex=e,this.ey=t,this.ez=r,this.et=n,Object.freeze(this)}get x(){return this.toAffine().x}get y(){return this.toAffine().y}static fromAffine(e){if(e instanceof w)throw new Error("extended point not allowed");const{x:t,y:r}=e||{};return g("x",t),g("y",r),new w(t,r,yc,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(w.fromAffine)}static msm(e,t){return fc(w,h,e,t)}_setWindowSize(e){S.setWindowSize(this,e)}assertValidity(){b(this)}equals(e){m(e);const{ex:t,ey:r,ez:n}=this,{ex:s,ey:i,ez:o}=e,a=u(t*o),c=u(s*n),l=u(r*o),h=u(i*n);return a===c&&l===h}is0(){return this.equals(w.ZERO)}negate(){return new w(u(-this.ex),this.ey,this.ez,u(-this.et))}double(){const{a:e}=t,{ex:r,ey:n,ez:s}=this,i=u(r*r),o=u(n*n),a=u(bc*u(s*s)),c=u(e*i),l=r+n,h=u(u(l*l)-i-o),d=c+o,p=d-a,f=c-o,g=u(h*p),m=u(d*f),y=u(h*f),b=u(p*d);return new w(g,m,b,y)}add(e){m(e);const{a:r,d:n}=t,{ex:s,ey:i,ez:o,et:a}=this,{ex:c,ey:l,ez:h,et:d}=e,p=u(s*c),f=u(i*l),g=u(a*n*d),y=u(o*h),b=u((s+i)*(c+l)-p-f),v=y-g,E=y+g,S=u(f-r*p),A=u(b*v),I=u(E*S),k=u(b*S),x=u(v*E);return new w(A,I,x,k)}subtract(e){return this.add(e.negate())}wNAF(e){return S.wNAFCached(this,e,w.normalizeZ)}multiply(e){const t=e;Da("scalar",t,yc,n);const{p:r,f:s}=this.wNAF(t);return w.normalizeZ([r,s])[0]}multiplyUnsafe(e,t=w.ZERO){const r=e;return Da("scalar",r,mc,n),r===mc?E:this.is0()||r===yc?this:S.wNAFCachedUnsafe(this,r,w.normalizeZ,t)}isSmallOrder(){return this.multiplyUnsafe(c).is0()}isTorsionFree(){return S.unsafeLadder(this,n).is0()}toAffine(e){return y(this,e)}clearCofactor(){const{h:e}=t;return e===yc?this:this.multiplyUnsafe(e)}static fromHex(e,n=!1){const{d:s,a:i}=t,o=r.BYTES;e=La("pointHex",e,o),wa("zip215",n);const a=e.slice(),c=e[o-1];a[o-1]=-129&c;const h=_a(a),p=n?l:r.ORDER;Da("pointHex.y",h,mc,p);const f=u(h*h),g=u(f-yc),m=u(s*f-i);let{isValid:y,value:b}=d(g,m);if(!y)throw new Error("Point.fromHex: invalid y coordinate");const v=(b&yc)===yc,E=!!(128&c);if(!n&&b===mc&&E)throw new Error("Point.fromHex: x=0 and x_0=1");return E!==v&&(b=u(-b)),w.fromAffine({x:b,y:h})}static fromPrivateKey(e){const{scalar:t}=k(e);return v.multiply(t)}toRawBytes(){const{x:e,y:t}=this.toAffine(),n=Pa(t,r.BYTES);return n[n.length-1]|=e&yc?128:0,n}toHex(){return Ia(this.toRawBytes())}}w.BASE=new w(t.Gx,t.Gy,yc,u(t.Gx*t.Gy)),w.ZERO=new w(mc,yc,yc,mc);const{BASE:v,ZERO:E}=w,S=pc(w,8*a);function A(e){return Xa(e,n)}function I(e){return A(_a(e))}function k(e){const t=r.BYTES;e=La("private key",e,t);const n=La("hashed private key",i(e),2*t),s=p(n.slice(0,t));return{head:s,prefix:n.slice(t,2*t),scalar:I(s)}}function x(e){const{head:t,prefix:r,scalar:n}=k(e),s=v.multiply(n),i=s.toRawBytes();return{head:t,prefix:r,scalar:n,point:s,pointBytes:i}}function C(e=new Uint8Array,...t){const r=Ra(...t);return I(i(f(r,La("context",e),!!s)))}const _=vc;return v._setWindowSize(8),{CURVE:t,getPublicKey:function(e){return x(e).pointBytes},sign:function(e,t,i={}){e=La("message",e),s&&(e=s(e));const{prefix:o,scalar:a,pointBytes:c}=x(t),l=C(i.context,o,e),u=v.multiply(l).toRawBytes(),h=A(l+C(i.context,u,c,e)*a);return Da("signature.s",h,mc,n),La("result",Ra(u,Pa(h,r.BYTES)),2*r.BYTES)},verify:function(e,t,n,i=_){const{context:o,zip215:a}=i,c=r.BYTES;e=La("signature",e,2*c),t=La("message",t),n=La("publicKey",n,c),void 0!==a&&wa("zip215",a),s&&(t=s(t));const l=_a(e.slice(c,2*c));let u,h,d;try{u=w.fromHex(n,a),h=w.fromHex(e.slice(0,c),a),d=v.multiplyUnsafe(l)}catch(e){return!1}if(!a&&u.isSmallOrder())return!1;const p=C(o,h.toRawBytes(),u.toRawBytes(),t);return h.add(u.multiplyUnsafe(p)).subtract(d).clearCofactor().equals(w.ZERO)},ExtendedPoint:w,utils:{getExtendedPublicKey:x,randomPrivateKey:()=>o(r.BYTES),precompute:(e=8,t=w.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)}}}(Oc))(),Mc=(()=>function(e){const t=($a(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=>Xa(e,n),i=t.montgomeryBits,o=Math.ceil(i/8),a=t.nByteLength,c=t.adjustScalarBytes||(e=>e),l=t.powPminus2||(e=>Ja(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 Pa(s(e),o)}function p(e,t){const r=function(e){const t=La("u coordinate",e,o);return 32===a&&(t[31]&=127),_a(t)}(t),p=function(e){const t=La("scalar",e),r=t.length;if(r!==o&&r!==a)throw new Error("invalid scalar, expected "+o+" or "+a+" bytes, got "+r);return _a(c(t))}(e),f=function(e,t){Da("u",e,Ec,n),Da("scalar",t,Ec,n);const r=t,o=e;let a,c=Sc,d=Ec,p=e,f=Sc,g=Ec;for(let e=BigInt(i-1);e>=Ec;e--){const t=r>>e⪼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,i=s(n*n),l=c-d,m=s(l*l),y=i-m,b=p+f,w=s((p-f)*n),v=s(b*l),E=w+v,S=w-v;p=s(E*E),f=s(o*s(S*S)),c=s(i*m),d=s(y*(i+s(h*y)))}a=u(g,c,p),c=a[0],p=a[1],a=u(g,d,f),d=a[0],f=a[1];const m=l(d);return s(c*m)}(r,p);if(f===Ec)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:Ac,a:BigInt(486662),montgomeryBits:255,nByteLength:32,Gu:BigInt(9),powPminus2:e=>{const t=Ac,{pow_p_5_8:r,b2:n}=Pc(e);return Xa(Qa(r,Cc,t)*n,t)},adjustScalarBytes:Lc,randomBytes:Fr}))();function Fc(e,t){const r=new Uint8Array(64);for(let n=0;n<32;n++)r[n]=e[n],r[32+n]=t[n];return r}class Bc{type="Ed25519";raw;constructor(e){this.raw=qc(e,32)}toMultihash(){return at.digest(kl(this))}toCID(){return mt.createV1(114,this.toMultihash())}toString(){return Ee.encode(this.toMultihash().bytes).substring(1)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}verify(e,t){return function(e,t,r){return Dc.verify(t,r instanceof Uint8Array?r:r.subarray(),e)}(this.raw,t,e)}}class Uc{type="Ed25519";raw;publicKey;constructor(e,t){this.raw=qc(e,64),this.publicKey=new Bc(t)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}sign(e){return function(e,t){const r=e.subarray(0,32);return Dc.sign(t instanceof Uint8Array?t:t.subarray(),r)}(this.raw,e)}}function $c(e){return e=qc(e,32),new Bc(e)}function qc(e,t){if((e=Uint8Array.from(e??[])).length!==t)throw new ho(`Key must be a Uint8Array of length ${t}, got ${e.length}`);return e}var jc,zc,Hc,Kc;!function(e){e.RSA="RSA",e.Ed25519="Ed25519",e.secp256k1="secp256k1",e.ECDSA="ECDSA"}(jc||(jc={})),function(e){e[e.RSA=0]="RSA",e[e.Ed25519=1]="Ed25519",e[e.secp256k1=2]="secp256k1",e[e.ECDSA=3]="ECDSA"}(zc||(zc={})),function(e){e.codec=()=>vr(zc)}(jc||(jc={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),jc.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!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.Type=jc.codec().decode(e);break;case 2:n.Data=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Hc||(Hc={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((e,t,r={})=>{!1!==r.lengthDelimited&&t.fork(),null!=e.Type&&(t.uint32(8),jc.codec().encode(e.Type,t)),null!=e.Data&&(t.uint32(18),t.bytes(e.Data)),!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.Type=jc.codec().decode(e);break;case 2:n.Data=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Kc||(Kc={}));class Vc extends Error{constructor(e="An error occurred while signing a message"){super(e),this.name="SigningError"}}class Gc extends Error{constructor(e="An error occurred while verifying a message"){super(e),this.name="VerificationError"}}class Wc extends Error{constructor(e="Missing Web Crypto API"){super(e),this.name="WebCryptoMissingError"}}const Xc={get(e=globalThis){const t=e.crypto;if(null==t?.subtle)throw new Wc("Missing Web Crypto API. The most likely cause of this error is that this page is being accessed from an insecure context (i.e. not HTTPS). For more information and possible resolutions see https://github.com/libp2p/js-libp2p/blob/main/packages/crypto/README.md#web-crypto-api");return t}};class Jc{type="RSA";jwk;_raw;_multihash;constructor(e,t){this.jwk=e,this._multihash=t}get raw(){return null==this._raw&&(this._raw=Yc(this.jwk)),this._raw}toMultihash(){return this._multihash}toCID(){return mt.createV1(114,this._multihash)}toString(){return Ee.encode(this.toMultihash().bytes).substring(1)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}verify(e,t){return async function(e,t,r){const n=await Xc.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!1,["verify"]);return Xc.get().subtle.verify({name:"RSASSA-PKCS1-v1_5"},n,t,r instanceof Uint8Array?r:r.subarray())}(this.jwk,t,e)}}class Qc{type="RSA";jwk;_raw;publicKey;constructor(e,t){this.jwk=e,this.publicKey=t}get raw(){return null==this._raw&&(this._raw=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 ho("JWK was missing components");return Vo([Ho(Uint8Array.from([0])),Ho(xt(e.n,"base64url")),Ho(xt(e.e,"base64url")),Ho(xt(e.d,"base64url")),Ho(xt(e.p,"base64url")),Ho(xt(e.q,"base64url")),Ho(xt(e.dp,"base64url")),Ho(xt(e.dq,"base64url")),Ho(xt(e.qi,"base64url"))]).subarray()}(this.jwk)),this._raw}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}sign(e){return async function(e,t){const r=await Xc.get().subtle.importKey("jwk",e,{name:"RSASSA-PKCS1-v1_5",hash:{name:"SHA-256"}},!1,["sign"]),n=await Xc.get().subtle.sign({name:"RSASSA-PKCS1-v1_5"},r,t instanceof Uint8Array?t:t.subarray());return new Uint8Array(n,0,n.byteLength)}(this.jwk,e)}}const Zc=Uint8Array.from([48,13,6,9,42,134,72,134,247,13,1,1,1,5,0]);function Yc(e){if(null==e.n||null==e.e)throw new ho("JWK was missing components");return Vo([Zc,Ko(Vo([Ho(xt(e.n,"base64url")),Ho(xt(e.e,"base64url"))]))]).subarray()}function el(e,t,r){const n=function(e){const t=$o(e[1],{offset:0});return{kty:"RSA",n:en(t[0],"base64url"),e:en(t[1],"base64url")}}(e);return null==r&&(r=nt(18,Hr(Hc.encode({Type:jc.RSA,Data:t})))),new Jc(n,r)}class tl extends Dr{constructor(e,t){super(),this.finished=!1,this.destroyed=!1,Tr(e);const r=Or(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 tl(e,t).update(r).digest();function nl(e){void 0!==e.lowS&&wa("lowS",e.lowS),void 0!==e.prehash&&wa("prehash",e.prehash)}rl.create=(e,t)=>new tl(e,t);class sl extends Error{constructor(e=""){super(e)}}const il={Err:sl,_tlv:{encode:(e,t)=>{const{Err:r}=il;if(e<0||e>256)throw new r("tlv.encode: wrong tag");if(1&t.length)throw new r("tlv.encode: unpadded data");const n=t.length/2,s=va(n);if(s.length/2&128)throw new r("tlv.encode: long form length too big");const i=n>127?va(s.length/2|128):"";return va(e)+i+s+t},decode(e,t){const{Err:r}=il;let n=0;if(e<0||e>256)throw new r("tlv.encode: wrong tag");if(t.length<2||t[n++]!==e)throw new r("tlv.decode: wrong tlv");const s=t[n++];let i=0;if(128&s){const e=127&s;if(!e)throw new r("tlv.decode(long): indefinite length not supported");if(e>4)throw new r("tlv.decode(long): byte length is too big");const o=t.subarray(n,n+e);if(o.length!==e)throw new r("tlv.decode: length bytes not complete");if(0===o[0])throw new r("tlv.decode(long): zero leftmost byte");for(const e of o)i=i<<8|e;if(n+=e,i<128)throw new r("tlv.decode(long): not minimal encoding")}else i=s;const o=t.subarray(n,n+i);if(o.length!==i)throw new r("tlv.decode: wrong value length");return{v:o,l:t.subarray(n+i)}}},_int:{encode(e){const{Err:t}=il;if(e{const s=t.toAffine();return Ra(Uint8Array.from([4]),r.toBytes(s.x),r.toBytes(s.y))}),i=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,i=r.sqr(e),o=r.mul(i,e);return r.add(r.add(o,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 a(e){const{allowedPrivateKeyLengths:r,nByteLength:n,wrapPrivateKey:s,n:i}=t;if(r&&"bigint"!=typeof e){if(ya(e)&&(e=Ia(e)),"string"!=typeof e||!r.includes(e.length))throw new Error("invalid private key");e=e.padStart(2*n,"0")}let o;try{o="bigint"==typeof e?e:Ca(La("private key",e,n))}catch(t){throw new Error("invalid private key, expected hex or "+n+" bytes, got "+typeof e)}return s&&(o=Xa(o,i)),Da("private key",o,al,i),o}function c(e){if(!(e instanceof h))throw new Error("ProjectivePoint expected")}const l=qa(((e,t)=>{const{px:n,py:s,pz:i}=e;if(r.eql(i,r.ONE))return{x:n,y:s};const o=e.is0();null==t&&(t=o?r.ONE:r.inv(i));const a=r.mul(n,t),c=r.mul(s,t),l=r.mul(i,t);if(o)return{x:r.ZERO,y:r.ZERO};if(!r.eql(l,r.ONE))throw new Error("invZ was invalid");return{x:a,y:c}})),u=qa((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 h{constructor(e,t,n){if(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");this.px=e,this.py=t,this.pz=n,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 h)throw new Error("projective point not allowed");const s=e=>r.eql(e,r.ZERO);return s(t)&&s(n)?h.ZERO:new h(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(h.fromAffine)}static fromHex(e){const t=h.fromAffine(i(La("pointHex",e)));return t.assertValidity(),t}static fromPrivateKey(e){return h.BASE.multiply(a(e))}static msm(e,t){return fc(h,n,e,t)}_setWindowSize(e){p.setWindowSize(this,e)}assertValidity(){u(this)}hasEvenY(){const{y:e}=this.toAffine();if(r.isOdd)return!r.isOdd(e);throw new Error("Field doesn't support isOdd")}equals(e){c(e);const{px:t,py:n,pz:s}=this,{px:i,py:o,pz:a}=e,l=r.eql(r.mul(t,a),r.mul(i,s)),u=r.eql(r.mul(n,a),r.mul(o,s));return l&&u}negate(){return new h(this.px,r.neg(this.py),this.pz)}double(){const{a:e,b:n}=t,s=r.mul(n,cl),{px:i,py:o,pz:a}=this;let c=r.ZERO,l=r.ZERO,u=r.ZERO,d=r.mul(i,i),p=r.mul(o,o),f=r.mul(a,a),g=r.mul(i,o);return g=r.add(g,g),u=r.mul(i,a),u=r.add(u,u),c=r.mul(e,u),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),u=r.mul(s,u),f=r.mul(e,f),g=r.sub(d,f),g=r.mul(e,g),g=r.add(g,u),u=r.add(d,d),d=r.add(u,d),d=r.add(d,f),d=r.mul(d,g),l=r.add(l,d),f=r.mul(o,a),f=r.add(f,f),d=r.mul(f,g),c=r.sub(c,d),u=r.mul(f,p),u=r.add(u,u),u=r.add(u,u),new h(c,l,u)}add(e){c(e);const{px:n,py:s,pz:i}=this,{px:o,py:a,pz:l}=e;let u=r.ZERO,d=r.ZERO,p=r.ZERO;const f=t.a,g=r.mul(t.b,cl);let m=r.mul(n,o),y=r.mul(s,a),b=r.mul(i,l),w=r.add(n,s),v=r.add(o,a);w=r.mul(w,v),v=r.add(m,y),w=r.sub(w,v),v=r.add(n,i);let E=r.add(o,l);return v=r.mul(v,E),E=r.add(m,b),v=r.sub(v,E),E=r.add(s,i),u=r.add(a,l),E=r.mul(E,u),u=r.add(y,b),E=r.sub(E,u),p=r.mul(f,v),u=r.mul(g,b),p=r.add(u,p),u=r.sub(y,p),p=r.add(y,p),d=r.mul(u,p),y=r.add(m,m),y=r.add(y,m),b=r.mul(f,b),v=r.mul(g,v),y=r.add(y,b),b=r.sub(m,b),b=r.mul(f,b),v=r.add(v,b),m=r.mul(y,v),d=r.add(d,m),m=r.mul(E,v),u=r.mul(w,u),u=r.sub(u,m),m=r.mul(w,y),p=r.mul(E,p),p=r.add(p,m),new h(u,d,p)}subtract(e){return this.add(e.negate())}is0(){return this.equals(h.ZERO)}wNAF(e){return p.wNAFCached(this,e,h.normalizeZ)}multiplyUnsafe(e){const{endo:n,n:s}=t;Da("scalar",e,ol,s);const i=h.ZERO;if(e===ol)return i;if(this.is0()||e===al)return this;if(!n||p.hasPrecomputes(this))return p.wNAFCachedUnsafe(this,e,h.normalizeZ);let{k1neg:o,k1:a,k2neg:c,k2:l}=n.splitScalar(e),u=i,d=i,f=this;for(;a>ol||l>ol;)a&al&&(u=u.add(f)),l&al&&(d=d.add(f)),f=f.double(),a>>=al,l>>=al;return o&&(u=u.negate()),c&&(d=d.negate()),d=new h(r.mul(d.px,n.beta),d.py,d.pz),u.add(d)}multiply(e){const{endo:n,n:s}=t;let i,o;if(Da("scalar",e,al,s),n){const{k1neg:t,k1:s,k2neg:a,k2:c}=n.splitScalar(e);let{p:l,f:u}=this.wNAF(s),{p:d,f}=this.wNAF(c);l=p.constTimeNegate(t,l),d=p.constTimeNegate(a,d),d=new h(r.mul(d.px,n.beta),d.py,d.pz),i=l.add(d),o=u.add(f)}else{const{p:t,f:r}=this.wNAF(e);i=t,o=r}return h.normalizeZ([i,o])[0]}multiplyAndAddUnsafe(e,t,r){const n=h.BASE,s=(e,t)=>t!==ol&&t!==al&&e.equals(n)?e.multiply(t):e.multiplyUnsafe(t),i=s(this,t).add(s(e,r));return i.is0()?void 0:i}toAffine(e){return l(this,e)}isTorsionFree(){const{h:e,isTorsionFree:r}=t;if(e===al)return!0;if(r)return r(h,this);throw new Error("isTorsionFree() has not been declared for the elliptic curve")}clearCofactor(){const{h:e,clearCofactor:r}=t;return e===al?this:r?r(h,this):this.multiplyUnsafe(t.h)}toRawBytes(e=!0){return wa("isCompressed",e),this.assertValidity(),s(h,this,e)}toHex(e=!0){return wa("isCompressed",e),Ia(this.toRawBytes(e))}}h.BASE=new h(t.Gx,t.Gy,r.ONE),h.ZERO=new h(r.ZERO,r.ONE,r.ZERO);const d=t.nBitLength,p=pc(h,t.endo?Math.ceil(d/2):d);return{CURVE:t,ProjectivePoint:h,normPrivateKeyToScalar:a,weierstrassEquation:o,isWithinCurveOrder:function(e){return Oa(e,al,t.n)}}}({...t,toBytes(e,t,n){const s=t.toAffine(),i=r.toBytes(s.x),o=Ra;return wa("isCompressed",n),n?o(Uint8Array.from([t.hasEvenY()?2:3]),i):o(Uint8Array.from([4]),i,r.toBytes(s.y))},fromBytes(e){const t=e.length,n=e[0],o=e.subarray(1);if(t!==s||2!==n&&3!==n){if(t===i&&4===n)return{x:r.fromBytes(o.subarray(0,r.BYTES)),y:r.fromBytes(o.subarray(r.BYTES,2*r.BYTES))};throw new Error("invalid Point, expected length of "+s+", or uncompressed "+i+", got "+t)}{const e=Ca(o);if(!Oa(e,al,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&al)===al)&&(s=r.neg(s)),{x:e,y:s}}}}),d=e=>Ia(Ta(e,t.nByteLength));function p(e){return e>n>>al}const f=(e,t,r)=>Ca(e.slice(t,r));class g{constructor(e,t,r){Da("r",e,al,n),Da("s",t,al,n),this.r=e,this.s=t,null!=r&&(this.recovery=r),Object.freeze(this)}static fromCompact(e){const r=t.nByteLength;return e=La("compactSignature",e,2*r),new g(f(e,0,r),f(e,r,2*r))}static fromDER(e){const{r:t,s:r}=il.toSig(La("DER",e));return new g(t,r)}assertValidity(){}addRecoveryBit(e){return new g(this.r,this.s,e)}recoverPublicKey(e){const{r:n,s,recovery:i}=this,l=w(La("msgHash",e));if(null==i||![0,1,2,3].includes(i))throw new Error("recovery id invalid");const u=2===i||3===i?n+t.n:n;if(u>=r.ORDER)throw new Error("recovery id 2 or 3 invalid");const h=1&i?"03":"02",p=c.fromHex(h+d(u)),f=a(u),g=o(-l*f),m=o(s*f),y=c.BASE.multiplyAndAddUnsafe(p,g,m);if(!y)throw new Error("point at infinify");return y.assertValidity(),y}hasHighS(){return p(this.s)}normalizeS(){return this.hasHighS()?new g(this.r,o(-this.s),this.recovery):this}toDERRawBytes(){return xa(this.toDERHex())}toDERHex(){return il.hexFromSig({r:this.r,s:this.s})}toCompactRawBytes(){return xa(this.toCompactHex())}toCompactHex(){return d(this.r)+d(this.s)}}const m={isValidPrivateKey(e){try{return l(e),!0}catch(e){return!1}},normPrivateKeyToScalar:l,randomPrivateKey:()=>{const e=nc(t.n);return function(e,t,r=!1){const n=e.length,s=rc(t),i=nc(t);if(n<16||n1024)throw new Error("expected "+i+"-1024 bytes of input, got "+n);const o=Xa(r?_a(e):Ca(e),t-za)+za;return r?Pa(o,s):Ta(o,s)}(t.randomBytes(e),t.n)},precompute:(e=8,t=c.BASE)=>(t._setWindowSize(e),t.multiply(BigInt(3)),t)};function y(e){const t=ya(e),r="string"==typeof e,n=(t||r)&&e.length;return t?n===s||n===i:r?n===2*s||n===2*i:e instanceof c}const b=t.bits2int||function(e){if(e.length>8192)throw new Error("input is too large");const r=Ca(e),n=8*e.length-t.nBitLength;return n>0?r>>BigInt(n):r},w=t.bits2int_modN||function(e){return o(b(e))},v=Ma(t.nBitLength);function E(e){return Da("num < 2^"+t.nBitLength,e,ol,v),Ta(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(y(e))throw new Error("first arg must be private key");if(!y(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:i,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:i,randomBytes:u}=t;let{lowS:d,prehash:f,extraEntropy:m}=s;null==d&&(d=!0),e=La("msgHash",e),nl(s),f&&(e=La("prehashed msgHash",i(e)));const y=w(e),v=l(n),A=[E(v),E(y)];if(null!=m&&!1!==m){const e=!0===m?u(r.BYTES):m;A.push(La("extraEntropy",e))}const I=Ra(...A),k=y;return{seed:I,k2sig:function(e){const t=b(e);if(!h(t))return;const r=a(t),n=c.BASE.multiply(t).toAffine(),s=o(n.x);if(s===ol)return;const i=o(r*o(k+s*v));if(i===ol)return;let l=(n.x===s?0:2)|Number(n.y&al),u=i;return d&&p(i)&&(u=function(e){return p(e)?o(-e):e}(i),l^=1),new g(s,u,l)}}}(e,n,s),d=t,f=function(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=Fa(e),s=Fa(e),i=0;const o=()=>{n.fill(1),s.fill(0),i=0},a=(...e)=>r(s,n,...e),c=(e=Fa(0))=>{s=a(Ba([0]),e),n=a(),0!==e.length&&(s=a(Ba([1]),e),n=a())},l=()=>{if(i++>=1e3)throw new Error("drbg: tried 1000 values");let e=0;const r=[];for(;e{let r;for(o(),c(e);!(r=t(l()));)c();return o(),r}}(d.hash.outputLen,d.nByteLength,d.hmac);return f(i,u)},verify:function(e,r,n,s=A){const i=e;r=La("msgHash",r),n=La("publicKey",n);const{lowS:l,prehash:u,format:h}=s;if(nl(s),"strict"in s)throw new Error("options.strict was renamed to lowS");if(void 0!==h&&"compact"!==h&&"der"!==h)throw new Error("format must be compact or der");const d="string"==typeof i||ya(i),p=!d&&!h&&"object"==typeof i&&null!==i&&"bigint"==typeof i.r&&"bigint"==typeof i.s;if(!d&&!p)throw new Error("invalid signature, expected Uint8Array, hex string or Signature instance");let f,m;try{if(p&&(f=new g(i.r,i.s)),d){try{"compact"!==h&&(f=g.fromDER(i))}catch(e){if(!(e instanceof il.Err))throw e}f||"der"===h||(f=g.fromCompact(i))}m=c.fromHex(n)}catch(e){return!1}if(!f)return!1;if(l&&f.hasHighS())return!1;u&&(r=t.hash(r));const{r:y,s:b}=f,v=w(r),E=a(b),S=o(v*E),I=o(y*E),k=c.BASE.multiplyAndAddUnsafe(m,S,I)?.toAffine();return!!k&&o(k.x)===y},ProjectivePoint:c,Signature:g,utils:m}}function ul(e){return{hash:e,hmac:(t,...r)=>rl(e,t,function(...e){let t=0;for(let r=0;r(e+t/fl)/t;const ml=tc(hl,void 0,void 0,{sqrt:function(e){const t=hl,r=BigInt(3),n=BigInt(6),s=BigInt(11),i=BigInt(22),o=BigInt(23),a=BigInt(44),c=BigInt(88),l=e*e*e%t,u=l*l*e%t,h=Qa(u,r,t)*u%t,d=Qa(h,r,t)*u%t,p=Qa(d,fl,t)*l%t,f=Qa(p,s,t)*p%t,g=Qa(f,i,t)*f%t,m=Qa(g,a,t)*g%t,y=Qa(m,c,t)*m%t,b=Qa(y,a,t)*g%t,w=Qa(b,r,t)*u%t,v=Qa(w,o,t)*f%t,E=Qa(v,n,t)*l%t,S=Qa(E,fl,t);if(!ml.eql(ml.sqr(S),e))throw new Error("Cannot find square root");return S}}),yl=function(e,t){const r=t=>ll({...e,...ul(t)});return{...r(t),create:r}}({a:BigInt(0),b:BigInt(7),Fp:ml,n:dl,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),h:BigInt(1),lowS:!0,endo:{beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar:e=>{const t=dl,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-pl*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=r,o=BigInt("0x100000000000000000000000000000000"),a=gl(i*e,t),c=gl(-n*e,t);let l=Xa(e-a*r-c*s,t),u=Xa(-a*n-c*i,t);const h=l>o,d=u>o;if(h&&(l=t-l),d&&(u=t-u),l>o||u>o)throw new Error("splitScalar: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}}},Hr);function bl(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}BigInt(0),yl.ProjectivePoint;class wl{type="secp256k1";raw;_key;constructor(e){this._key=function(e){try{return yl.ProjectivePoint.fromHex(e),e}catch(e){throw new po(String(e))}}(e),this.raw=function(e){return yl.ProjectivePoint.fromHex(e).toRawBytes(!0)}(this._key)}toMultihash(){return at.digest(kl(this))}toCID(){return mt.createV1(114,this.toMultihash())}toString(){return Ee.encode(this.toMultihash().bytes).substring(1)}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}verify(e,t){return function(e,t,r){const n=ht.digest(r instanceof Uint8Array?r:r.subarray());if(bl(n))return n.then((({digest:r})=>yl.verify(t,r,e))).catch((e=>{throw new Gc(String(e))}));try{return yl.verify(t,n.digest,e)}catch(e){throw new Gc(String(e))}}(this._key,t,e)}}class vl{type="secp256k1";raw;publicKey;constructor(e,t){this.raw=function(e){try{return yl.getPublicKey(e,!0),e}catch(e){throw new fo(String(e))}}(e),this.publicKey=new wl(t??function(e){try{return yl.getPublicKey(e,!0)}catch(e){throw new fo(String(e))}}(e))}equals(e){return null!=e&&e.raw instanceof Uint8Array&&_n(this.raw,e.raw)}sign(e){return function(e,t){const r=ht.digest(t instanceof Uint8Array?t:t.subarray());if(bl(r))return r.then((({digest:t})=>yl.sign(t,e).toDERRawBytes())).catch((e=>{throw new Vc(String(e))}));try{return yl.sign(r.digest,e).toDERRawBytes()}catch(e){throw new Vc(String(e))}}(this.raw,e)}}function El(e){return new wl(e)}async function Sl(e,t){if("Ed25519"===e)return async function(){const{privateKey:e,publicKey:t}=function(){const e=Dc.utils.randomPrivateKey(),t=Dc.getPublicKey(e);return{privateKey:Fc(e,t),publicKey:t}}();return new Uc(e,t)}();if("secp256k1"===e)return async function(){const e=yl.utils.randomPrivateKey();return new vl(e)}();if("RSA"===e)return async function(e){if(e>8192)throw new ho("Key size is too large");const t=await async function(e){const t=await Xc.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 async function(e){if(null==e.privateKey||null==e.publicKey)throw new ho("Private and public key are required");return Promise.all([Xc.get().subtle.exportKey("jwk",e.privateKey),Xc.get().subtle.exportKey("jwk",e.publicKey)])}(t);return{privateKey:r[0],publicKey:r[1]}}(e),r=nt(18,Hr(Hc.encode({Type:jc.RSA,Data:Yc(t.publicKey)})));return new Qc(t.privateKey,new Jc(t.publicKey,r))}(function(e){return null==e?2048:parseInt(e,10)}(t));if("ECDSA"===e)return async function(e="P-256"){const t=await async function(e="P-256"){const t=await crypto.subtle.generateKey({name:"ECDSA",namedCurve:e},!0,["sign","verify"]);return{publicKey:await crypto.subtle.exportKey("jwk",t.publicKey),privateKey:await crypto.subtle.exportKey("jwk",t.privateKey)}}(e);return new Wo(t.privateKey)}(function(e){if("P-256"===e||null==e)return"P-256";if("P-384"===e)return"P-384";if("P-521"===e)return"P-521";throw new ho("Unsupported curve, should be P-256, P-384 or P-521")}(t));throw new Do}async function Al(e,t){if("Ed25519"!==e)throw new Do("Seed key derivation only supported for Ed25519 keys");return async function(e){const{privateKey:t,publicKey:r}=function(e){if(32!==e.length)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=Dc.getPublicKey(t);return{privateKey:Fc(t,r),publicKey:r}}(e);return new Uc(t,r)}(t)}function Il(e,t){const{Type:r,Data:n}=Hc.decode(e),s=n??new Uint8Array;switch(r){case jc.RSA:return function(e,t){if(e.byteLength>=1062)throw new po("Key size is too large");return el($o(e,{offset:0}),e,t)}(s,t);case jc.Ed25519:return $c(s);case jc.secp256k1:return El(s);case jc.ECDSA:return ta(s);default:throw new Do}}function kl(e){return Hc.encode({Type:jc[e.type],Data:e.raw})}const xl=Symbol.for("@libp2p/service-capabilities"),Cl=Symbol.for("@libp2p/service-dependencies"),_l=Symbol.for("nodejs.util.inspect.custom");class Tl{type;multihash;publicKey;string;constructor(e){this.type=e.type,this.multihash=e.multihash,Object.defineProperty(this,"string",{enumerable:!1,writable:!0})}get[Symbol.toStringTag](){return`PeerId(${this.toString()})`}[Ns]=!0;toString(){return null==this.string&&(this.string=Ee.encode(this.multihash.bytes).slice(1)),this.string}toMultihash(){return this.multihash}toCID(){return mt.createV1(114,this.multihash)}toJSON(){return this.toString()}equals(e){if(null==e)return!1;if(e instanceof Uint8Array)return _n(this.multihash.bytes,e);if("string"==typeof e)return this.toString()===e;if(null!=e?.toMultihash()?.bytes)return _n(this.multihash.bytes,e.toMultihash().bytes);throw new Error("not valid Id")}[_l](){return`PeerId(${this.toString()})`}}class Pl extends Tl{type="RSA";publicKey;constructor(e){super({...e,type:"RSA"}),this.publicKey=e.publicKey}}class Ll extends Tl{type="Ed25519";publicKey;constructor(e){super({...e,type:"Ed25519"}),this.publicKey=e.publicKey}}class Rl extends Tl{type="secp256k1";publicKey;constructor(e){super({...e,type:"secp256k1"}),this.publicKey=e.publicKey}}class Nl{type="url";multihash;publicKey;url;constructor(e){this.url=e.toString(),this.multihash=at.digest(xt(this.url))}[_l](){return`PeerId(${this.url})`}[Ns]=!0;toString(){return this.toCID().toString()}toMultihash(){return this.multihash}toCID(){return mt.createV1(2336,this.toMultihash())}toJSON(){return this.toString()}equals(e){return null!=e&&(e instanceof Uint8Array&&(e=en(e)),e.toString()===this.toString())}}function Ol(e,t){let r;if("1"===e.charAt(0)||"Q"===e.charAt(0))r=st(Ee.decode(`z${e}`));else{if(e.startsWith("k51qzi5uqu5")||e.startsWith("kzwfwjn5ji4")||e.startsWith("k2k4r8")||e.startsWith("bafz"))return Fl(mt.parse(e));if(null==t)throw new ho('Please pass a multibase decoder for strings that do not start with "1" or "Q"');r=st(t.decode(e))}return Ml(r)}function Dl(e){if("Ed25519"===e.type)return new Ll({multihash:e.toCID().multihash,publicKey:e});if("secp256k1"===e.type)return new Rl({multihash:e.toCID().multihash,publicKey:e});if("RSA"===e.type)return new Pl({multihash:e.toCID().multihash,publicKey:e});throw new Do}function Ml(e){if(function(e){return e.code===ht.code}(e))return new Pl({multihash:e});if(function(e){return e.code===at.code}(e))try{const t=function(e){const{Type:t,Data:r}=Hc.decode(e.digest),n=r??new Uint8Array;switch(t){case jc.Ed25519:return $c(n);case jc.secp256k1:return El(n);case jc.ECDSA:return ta(n);default:throw new Do}}(e);if("Ed25519"===t.type)return new Ll({multihash:e,publicKey:t});if("secp256k1"===t.type)return new Rl({multihash:e,publicKey:t})}catch(t){const r=en(e.digest);return new Nl(new URL(r))}throw new ko("Supplied PeerID Multihash is invalid")}function Fl(e){if(null==e?.multihash||null==e.version||1===e.version&&114!==e.code&&2336!==e.code)throw new Io("Supplied PeerID CID is invalid");if(2336===e.code){const t=en(e.multihash.digest);return new Nl(new URL(t))}return Ml(e.multihash)}const Bl=e=>{const t=k(e),r=g(t);return _(e,r),Bl.bytes=t,r};Bl.bytes=0;class Ul extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class $l extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class ql extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class jl extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}var zl;!function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}(zl||(zl={}));const Hl=e=>{const t=T(e);return Hl.bytes=k(t),t};function Kl(e,t){const r=new Rn;let n=zl.LENGTH,s=-1;const i=t?.lengthDecoder??Hl,o=t?.maxLengthLength??8,a=t?.maxDataLength??4194304;function*c(){for(;r.byteLength>0;){if(n===zl.LENGTH)try{if(s=i(r),s<0)throw new Ul("Invalid message length");if(s>a)throw new $l("Message length too long");const e=i.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=zl.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>o)throw new ql("Message length length too long");break}throw e}if(n===zl.DATA){if(r.byteLength0)throw new jl("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new jl("Unexpected end of input")}()}Hl.bytes=0,Kl.fromReader=(e,t)=>{let r=1;return Kl(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 Vl{readNext;haveNext;ended;nextResult;constructor(){this.ended=!1,this.readNext=zn(),this.haveNext=zn()}[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=zn(),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(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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=zn(),await Xn(this.readNext.promise,t?.signal,t)}}class Gl extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class Wl extends Error{code;constructor(e,t){super(e),this.code=t}}class Xl extends Wl{type;constructor(e){super(e,"ABORT_ERR"),this.type="aborted",this.name="AbortError"}}function Jl(e,t){const r=new Vl;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 Rn,i={read:async(e,t)=>{let r;t?.signal?.throwIfAborted();const i=new Promise(((e,n)=>{r=()=>{n(new Xl("Read aborted"))},t?.signal?.addEventListener("abort",r)}));try{if(null==e){const{done:e,value:t}=await Promise.race([n.next(),i]);return!0===e?new Rn: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 i}class Ql extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Zl extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class Yl extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function eu(e,t={}){const r=Jl(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=k(t.maxDataLength));const n=t?.lengthDecoder??T,s=t?.lengthEncoder??_;return{read:async e=>{let s=-1;const i=new Rn;for(;;){i.append(await r.read(1,e));try{s=n(i)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new Ql("Invalid message length");if(null!=t?.maxLengthLength&&i.byteLength>t.maxLengthLength)throw new Yl("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new Zl("message length too long");return r.read(s,e)},write:async(e,t)=>{await r.write(new Rn(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Rn(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}function tu(){const e=zn();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 ru=65535,nu=Boolean(globalThis.process?.env?.DUMP_SESSION_KEYS);function su(e){if(!Number.isSafeInteger(e)||e<0)throw new Error(`positive integer expected, not ${e}`)}function iu(e){if("boolean"!=typeof e)throw new Error(`boolean expected, not ${e}`)}function ou(e){return e instanceof Uint8Array||null!=e&&"object"==typeof e&&"Uint8Array"===e.constructor.name}function au(e,...t){if(!ou(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 cu(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 lu=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 uu(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(!ou(e))throw new Error("Uint8Array expected, got "+typeof e);e=pu(e)}return e}const hu=(e,t)=>(Object.assign(t,e),t);function du(e,t,r,n){if("function"==typeof e.setBigUint64)return e.setBigUint64(t,r,n);const s=BigInt(32),i=BigInt(4294967295),o=Number(r>>s&i),a=Number(r&i),c=n?4:0,l=n?0:4;e.setUint32(t+c,o,n),e.setUint32(t+l,a,n)}function pu(e){return Uint8Array.from(e)}function fu(...e){for(let t=0;tUint8Array.from(e.split("").map((e=>e.charCodeAt(0)))),mu=gu("expand 16-byte k"),yu=gu("expand 32-byte k"),bu=lu(mu),wu=lu(yu);function vu(e,t){return e<>>32-t}function Eu(e){return e.byteOffset%4==0}wu.slice();const Su=2**32-1,Au=new Uint32Array;function Iu(e,t){const{allowShortKeys:r,extendNonceFn:n,counterLength:s,counterRight:i,rounds:o}=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 su(s),su(o),iu(i),iu(r),(t,a,c,l,u=0)=>{au(t),au(a),au(c);const h=c.length;if(void 0===l&&(l=new Uint8Array(h)),au(l),su(u),u<0||u>=Su)throw new Error("arx: counter overflow");if(l.length=Su)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 xu{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,au(e=uu(e),32);const t=ku(e,0),r=ku(e,2),n=ku(e,4),s=ku(e,6),i=ku(e,8),o=ku(e,10),a=ku(e,12),c=ku(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|i<<12),this.r[5]=i>>>1&8190,this.r[6]=8191&(i>>>14|o<<2),this.r[7]=8065&(o>>>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]=ku(e,16+2*t)}process(e,t,r=!1){const n=r?0:2048,{h:s,r:i}=this,o=i[0],a=i[1],c=i[2],l=i[3],u=i[4],h=i[5],d=i[6],p=i[7],f=i[8],g=i[9],m=ku(e,t+0),y=ku(e,t+2),b=ku(e,t+4),w=ku(e,t+6),v=ku(e,t+8),E=ku(e,t+10),S=ku(e,t+12),A=ku(e,t+14);let I=s[0]+(8191&m),k=s[1]+(8191&(m>>>13|y<<3)),x=s[2]+(8191&(y>>>10|b<<6)),C=s[3]+(8191&(b>>>7|w<<9)),_=s[4]+(8191&(w>>>4|v<<12)),T=s[5]+(v>>>1&8191),P=s[6]+(8191&(v>>>14|E<<2)),L=s[7]+(8191&(E>>>11|S<<5)),R=s[8]+(8191&(S>>>8|A<<8)),N=s[9]+(A>>>5|n),O=0,D=O+I*o+k*(5*g)+x*(5*f)+C*(5*p)+_*(5*d);O=D>>>13,D&=8191,D+=T*(5*h)+P*(5*u)+L*(5*l)+R*(5*c)+N*(5*a),O+=D>>>13,D&=8191;let M=O+I*a+k*o+x*(5*g)+C*(5*f)+_*(5*p);O=M>>>13,M&=8191,M+=T*(5*d)+P*(5*h)+L*(5*u)+R*(5*l)+N*(5*c),O+=M>>>13,M&=8191;let F=O+I*c+k*a+x*o+C*(5*g)+_*(5*f);O=F>>>13,F&=8191,F+=T*(5*p)+P*(5*d)+L*(5*h)+R*(5*u)+N*(5*l),O+=F>>>13,F&=8191;let B=O+I*l+k*c+x*a+C*o+_*(5*g);O=B>>>13,B&=8191,B+=T*(5*f)+P*(5*p)+L*(5*d)+R*(5*h)+N*(5*u),O+=B>>>13,B&=8191;let U=O+I*u+k*l+x*c+C*a+_*o;O=U>>>13,U&=8191,U+=T*(5*g)+P*(5*f)+L*(5*p)+R*(5*d)+N*(5*h),O+=U>>>13,U&=8191;let $=O+I*h+k*u+x*l+C*c+_*a;O=$>>>13,$&=8191,$+=T*o+P*(5*g)+L*(5*f)+R*(5*p)+N*(5*d),O+=$>>>13,$&=8191;let q=O+I*d+k*h+x*u+C*l+_*c;O=q>>>13,q&=8191,q+=T*a+P*o+L*(5*g)+R*(5*f)+N*(5*p),O+=q>>>13,q&=8191;let j=O+I*p+k*d+x*h+C*u+_*l;O=j>>>13,j&=8191,j+=T*c+P*a+L*o+R*(5*g)+N*(5*f),O+=j>>>13,j&=8191;let z=O+I*f+k*p+x*d+C*h+_*u;O=z>>>13,z&=8191,z+=T*l+P*c+L*a+R*o+N*(5*g),O+=z>>>13,z&=8191;let H=O+I*g+k*f+x*p+C*d+_*h;O=H>>>13,H&=8191,H+=T*u+P*l+L*c+R*a+N*o,O+=H>>>13,H&=8191,O=(O<<2)+O|0,O=O+D|0,D=8191&O,O>>>=13,M+=O,s[0]=D,s[1]=M,s[2]=F,s[3]=B,s[4]=U,s[5]=$,s[6]=q,s[7]=j,s[8]=z,s[9]=H}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 i=e[0]+t[0];e[0]=65535&i;for(let r=1;r<8;r++)i=(e[r]+t[r]|0)+(i>>>16)|0,e[r]=65535&i;fu(r)}update(e){cu(this);const{buffer:t,blockLen:r}=this,n=(e=uu(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 Cu=function(e){const t=(t,r)=>e(r).update(uu(t)).digest(),r=e(new Uint8Array(32));return t.outputLen=r.outputLen,t.blockLen=r.blockLen,t.create=t=>e(t),t}((e=>new xu(e)));function _u(e,t,r,n,s,i=20){let o=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],m=t[6],y=t[7],b=s,w=r[0],v=r[1],E=r[2],S=o,A=a,I=c,k=l,x=u,C=h,_=d,T=p,P=f,L=g,R=m,N=y,O=b,D=w,M=v,F=E;for(let e=0;e{e.update(t);const r=t.length%16;r&&e.update(Lu.subarray(r))},Nu=new Uint8Array(32);function Ou(e,t,r,n,s){const i=e(t,r,Nu),o=Cu.create(i);s&&Ru(o,s),Ru(o,n);const a=new Uint8Array(16),c=(l=a,new DataView(l.buffer,l.byteOffset,l.byteLength));var l;du(c,0,BigInt(s?s.length:0),!0),du(c,8,BigInt(n.length),!0),o.update(a);const u=o.digest();return fu(i,a),u}const Du=e=>(t,r,n)=>(au(t,32),au(r),{encrypt(s,i){const o=s.length,a=o+16;i?au(i,a):i=new Uint8Array(a),e(t,r,s,i,1);const c=Ou(e,t,r,i.subarray(0,-16),n);return i.set(c,o),fu(c),i},decrypt(s,i){const o=s.length,a=o-16;if(o<16)throw new Error("encrypted data must be at least 16 bytes");i?au(i,a):i=new Uint8Array(a);const c=s.subarray(0,-16),l=s.subarray(-16),u=Ou(e,t,r,c,n);if(!function(e,t){if(e.length!==t.length)return!1;let r=0;for(let n=0;nHr(e.subarray()),getHKDF(e,t){const r=function(e,t,r){return Tr(e),void 0===r&&(r=new Uint8Array(e.outputLen)),rl(e,Or(r),Or(t))}(Hr,t,e),n=function(e,t,r,n=32){if(Tr(e),Cr(n),n>255*e.outputLen)throw new Error("Length should be <= 255*HashLen");const s=Math.ceil(n/e.outputLen);void 0===r&&(r=Bu);const i=new Uint8Array(s*e.outputLen),o=rl.create(e,t),a=o._cloneInto(),c=new Uint8Array(o.outputLen);for(let t=0;t({publicKey:Mc.getPublicKey(e),privateKey:e}),generateX25519SharedKey:(e,t)=>Mc.getSharedSecret(e.subarray(),t.subarray()),chaCha20Poly1305Encrypt:(e,t,r,n)=>Mu(n,t,r).encrypt(e.subarray()),chaCha20Poly1305Decrypt:(e,t,r,n,s)=>Mu(n,t,r).decrypt(e.subarray(),s)},$u=e=>{const t=g(2);return t[0]=e>>8,t[1]=e,t};$u.bytes=2;const qu=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 ju(e,t){t.enabled&&nu&&(e?(t(`LOCAL_STATIC_PUBLIC_KEY ${en(e.publicKey,"hex")}`),t(`LOCAL_STATIC_PRIVATE_KEY ${en(e.privateKey,"hex")}`)):t("Missing local static keys."))}function zu(e,t){t.enabled&&nu&&(e?(t(`LOCAL_PUBLIC_EPHEMERAL_KEY ${en(e.publicKey,"hex")}`),t(`LOCAL_PRIVATE_EPHEMERAL_KEY ${en(e.privateKey,"hex")}`)):t("Missing local ephemeral keys."))}function Hu(e,t){t.enabled&&nu&&t(e?`REMOTE_EPHEMERAL_PUBLIC_KEY ${en(e.subarray(),"hex")}`:"Missing remote ephemeral keys.")}function Ku(e,t,r){r.enabled&&nu&&(r(`CIPHER_STATE_1 ${e.n.getUint64()} ${e.k&&en(e.k,"hex")}`),r(`CIPHER_STATE_2 ${t.n.getUint64()} ${t.k&&en(t.k,"hex")}`))}qu.bytes=2;class Vu extends Error{code;constructor(e="Invalid crypto exchange"){super(e),this.code=Vu.code}static code="ERR_INVALID_CRYPTO_EXCHANGE"}class Gu{n;bytes;view;constructor(e=0){this.n=e,this.bytes=f(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 Wu=f(0);class Xu{k;n;crypto;constructor(e,t=void 0,r=0){this.crypto=e,this.k=t,this.n=new Gu(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 Ju{cs;ck;h;crypto;constructor(e,t){this.crypto=e;const r=xt(t,"utf-8");this.h=function(e,t){if(t.length<=32){const e=f(32);return e.set(t),e}return e.hash(t)}(e,r),this.ck=this.h,this.cs=new Xu(e)}mixKey(e){const[t,r]=this.crypto.hkdf(this.ck,e);this.ck=t,this.cs=new Xu(this.crypto,r)}mixHash(e){this.h=this.crypto.hash(new Rn(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,Wu);return[new Xu(this.crypto,e),new Xu(this.crypto,t)]}}class Qu{ss;s;e;rs;re;initiator;crypto;constructor(e){const{crypto:t,protocolName:r,prologue:n,initiator:s,s:i,e:o,rs:a,re:c}=e;this.crypto=t,this.ss=new Ju(t,r),this.ss.mixHash(n),this.initiator=s,this.s=i,this.e=o,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=Er(((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=>$t(t,e.codec()),e.decode=t=>K(t,e.codec())}(Yu||(Yu={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),Yu.codec().encode(e.extensions,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t)=>{const r={identityKey:f(0),identitySig:f(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=Yu.codec().decode(e,e.uint32());break;default:e.skipType(7&t)}}return r}))),t),e.encode=t=>$t(t,e.codec()),e.decode=t=>K(t,e.codec())}(eh||(eh={}));class sh{protocol="/noise";crypto;prologue;staticKey;extensions;metrics;components;constructor(e,t={}){const{staticNoiseKey:r,extensions:n,crypto:s,prologueBytes:i}=t,{metrics:o}=e;this.components=e;const a=s??Uu;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=o?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"})}}(o):void 0,this.staticKey=r?a.generateX25519KeyPairFromSeed(r):a.generateX25519KeyPair(),this.prologue=i??f(0)}[Symbol.toStringTag]="@chainsafe/libp2p-noise";[xl]=["@libp2p/connection-encryption","@chainsafe/libp2p-noise"];async secureOutbound(e,t){const r=eu(e,{lengthEncoder:$u,lengthDecoder:qu,maxDataLength:ru}),n=await this.performHandshakeInitiator(r,this.components.privateKey,t?.remotePeer?.publicKey,t),s=await this.createSecureConnection(r,n);e.source=s.source,e.sink=s.sink;const i=Il(n.payload.identityKey);return{conn:e,remoteExtensions:n.payload.extensions,remotePeer:Dl(i)}}async secureInbound(e,t){const r=eu(e,{lengthEncoder:$u,lengthDecoder:qu,maxDataLength:ru}),n=await this.performHandshakeResponder(r,this.components.privateKey,t?.remotePeer?.publicKey,t),s=await this.createSecureConnection(r,n);e.source=s.source,e.sink=s.sink;const i=Il(n.payload.identityKey);return{conn:e,remoteExtensions:n.payload.extensions,remotePeer:Dl(i)}}async performHandshakeInitiator(e,t,r,n){let s;try{s=await async function(e,t){const{log:r,connection:n,crypto:s,privateKey:i,prologue:o,s:a,remoteIdentityKey:c,extensions:l}=e,u=await th(i,a.publicKey,l),h=new Zu({crypto:s,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!0,prologue:o,s:a});ju(h.s,r),r.trace("Stage 0 - Initiator starting to send first message."),await n.write(h.writeMessageA(Wu),t),r.trace("Stage 0 - Initiator finished sending first message."),zu(h.e,r),r.trace("Stage 1 - Initiator waiting to receive first message from responder...");const d=h.readMessageB(await n.read(t));var p,f;r.trace("Stage 1 - Initiator received the message."),Hu(h.re,r),p=h.rs,(f=r).enabled&&nu&&f(p?`REMOTE_STATIC_PUBLIC_KEY ${en(p.subarray(),"hex")}`:"Missing remote static public key."),r.trace("Initiator going to check remote's signature...");const g=await rh(d,h.rs,c);r.trace("All good with the signature!"),r.trace("Stage 2 - Initiator sending third handshake message."),await n.write(h.writeMessageC(u),t),r.trace("Stage 2 - Initiator sent message with signed payload.");const[m,y]=h.ss.split();return Ku(m,y,r),{payload:g,encrypt:e=>m.encryptWithAd(Wu,e),decrypt:(e,t)=>y.decryptWithAd(Wu,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},n),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return s}async performHandshakeResponder(e,t,r,n){let s;try{s=await async function(e,t){const{log:r,connection:n,crypto:s,privateKey:i,prologue:o,s:a,remoteIdentityKey:c,extensions:l}=e,u=await th(i,a.publicKey,l),h=new Zu({crypto:s,protocolName:"Noise_XX_25519_ChaChaPoly_SHA256",initiator:!1,prologue:o,s:a});ju(h.s,r),r.trace("Stage 0 - Responder waiting to receive first message."),h.readMessageA(await n.read(t)),r.trace("Stage 0 - Responder received first message."),Hu(h.re,r),r.trace("Stage 1 - Responder sending out first message with signed payload and static key."),await n.write(h.writeMessageB(u),t),r.trace("Stage 1 - Responder sent the second handshake message with signed payload."),zu(h.e,r),r.trace("Stage 2 - Responder waiting for third handshake message...");const d=h.readMessageC(await n.read(t));r.trace("Stage 2 - Responder received the message, finished handshake.");const p=await rh(d,h.rs,c),[f,g]=h.ss.split();return Ku(f,g,r),{payload:p,encrypt:e=>g.encryptWithAd(Wu,e),decrypt:(e,t)=>f.decryptWithAd(Wu,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},n),this.metrics?.xxHandshakeSuccesses.increment()}catch(e){throw this.metrics?.xxHandshakeErrors.increment(),e}return s}async createSecureConnection(e,t){const[r,n]=function(){const e=tu(),t=tu();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&&(i=n.length),s=n instanceof Uint8Array?e.encrypt(n.subarray(r,i)):e.encrypt(n.sublist(r,i)),t?.encryptedPackets.increment(),yield new Rn($u(s.byteLength),s)}}}(t,this.metrics),s,(e=>Kl(e,{lengthDecoder:qu})),function(e,t){return async function*(r){for await(const n of r)for(let r=0;rn.length&&(s=n.length),s-16new sh(t,e)}const oh=Symbol.for("@libp2p/peer-discovery"),ah=Bh("dns4"),ch=Bh("dns6"),lh=Bh("dnsaddr"),uh=Fh(Bh("dns"),lh,ah,ch),hh=Fh(Bh("ip4"),Bh("ip6")),dh=Fh(Mh(hh,Bh("tcp")),Mh(uh,Bh("tcp"))),ph=Mh(hh,Bh("udp")),fh=Mh(ph,Bh("utp")),gh=Mh(ph,Bh("quic")),mh=Mh(ph,Bh("quic-v1")),yh=Fh(Mh(dh,Bh("ws")),Mh(uh,Bh("ws"))),bh=Fh(Mh(yh,Bh("p2p")),yh),wh=Fh(Mh(dh,Bh("wss")),Mh(uh,Bh("wss")),Mh(dh,Bh("tls"),Bh("ws")),Mh(uh,Bh("tls"),Bh("ws"))),vh=Fh(Mh(wh,Bh("p2p")),wh),Eh=Fh(Mh(dh,Bh("http")),Mh(hh,Bh("http")),Mh(uh,Bh("http"))),Sh=Fh(Mh(dh,Bh("https")),Mh(hh,Bh("https")),Mh(uh,Bh("https"))),Ah=Mh(ph,Bh("webrtc-direct"),Bh("certhash")),Ih=Fh(Mh(Ah,Bh("p2p")),Ah),kh=Mh(mh,Bh("webtransport"),Bh("certhash"),Bh("certhash")),xh=Fh(Mh(kh,Bh("p2p")),kh),Ch=Fh(Mh(bh,Bh("p2p-webrtc-star"),Bh("p2p")),Mh(vh,Bh("p2p-webrtc-star"),Bh("p2p")),Mh(bh,Bh("p2p-webrtc-star")),Mh(vh,Bh("p2p-webrtc-star"))),_h=(Fh(Mh(bh,Bh("p2p-websocket-star"),Bh("p2p")),Mh(vh,Bh("p2p-websocket-star"),Bh("p2p")),Mh(bh,Bh("p2p-websocket-star")),Mh(vh,Bh("p2p-websocket-star"))),Fh(Mh(Eh,Bh("p2p-webrtc-direct"),Bh("p2p")),Mh(Sh,Bh("p2p-webrtc-direct"),Bh("p2p")),Mh(Eh,Bh("p2p-webrtc-direct")),Mh(Sh,Bh("p2p-webrtc-direct")))),Th=Fh(yh,wh,Eh,Sh,Ch,_h,dh,fh,gh,uh,Ih,xh),Ph=(Fh(Mh(Th,Bh("p2p-stardust"),Bh("p2p")),Mh(Th,Bh("p2p-stardust"))),Fh(Mh(Th,Bh("p2p")),Ch,_h,Ih,xh,Bh("p2p"))),Lh=Fh(Mh(Ph,Bh("p2p-circuit"),Ph),Mh(Ph,Bh("p2p-circuit")),Mh(Bh("p2p-circuit"),Ph),Mh(Th,Bh("p2p-circuit")),Mh(Bh("p2p-circuit"),Th),Bh("p2p-circuit")),Rh=()=>Fh(Mh(Lh,Rh),Lh),Nh=Rh(),Oh=Fh(Mh(Nh,Ph,Nh),Mh(Ph,Nh),Mh(Nh,Ph),Nh,Ph);function Dh(e){return function(t){let r;try{r=vi(t)}catch(e){return!1}const n=e(r.protoNames());return null!==n&&(!0===n||!1===n?n:0===n.length)}}function Mh(...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:Dh(t),partialMatch:t}}function Fh(...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:Dh(t),partialMatch:t}}function Bh(e){const t=e;return{toString:function(){return t},matches:function(e){let r;try{r=vi(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}}}Fh(Mh(Nh,Bh("webrtc"),Bh("p2p")),Mh(Nh,Bh("webrtc")),Mh(Th,Bh("webrtc"),Bh("p2p")),Mh(Th,Bh("webrtc")),Bh("webrtc"));class Uh extends Rs{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(!Oh.matches(e)){this.log.error("Invalid multiaddr");continue}const t=vi(e),r=t.getPeerId();if(null==r){this.log.error("Invalid bootstrap multiaddr without peer id");continue}const n={id:Ol(r),multiaddrs:[t]};this.list.push(n)}this._init=t}[oh]=this;[Symbol.toStringTag]="@libp2p/bootstrap";[xl]=["@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}},multiaddrs:e.multiaddrs}),null==this.timer)return;this.safeDispatchEvent("peer",{detail:e}),this.components.connectionManager.openConnection(e.id).catch((t=>{this.log.error("could not dial bootstrap peer %p",e.id,t)}))}}stop(){null!=this.timer&&clearTimeout(this.timer),this.timer=void 0}}const $h=Uint8Array.from([3,1]);var qh,jh;!function(e){let t,r;!function(e){let t;e.codec=()=>(null==t&&(t=Er(((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,r={})=>{const n={multiaddr:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3==1?n.multiaddr=e.bytes():e.skipType(7&t)}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(t=e.AddressInfo||(e.AddressInfo={})),e.codec=()=>(null==r&&(r=Er(((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,n={})=>{const s={peerId:f(0),seq:0n,addresses:[]},i=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:s.peerId=t.bytes();break;case 2:s.seq=t.uint64();break;case 3:if(null!=n.limits?.addresses&&s.addresses.length===n.limits.addresses)throw new Sr('Decode error - map field "addresses" had too many elements');s.addresses.push(e.AddressInfo.codec().decode(t,t.uint32(),{limits:n.limits?.addresses$}));break;default:t.skipType(7&r)}}return s}))),r),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(qh||(qh={}));class zh{static createFromProtobuf=e=>{const t=qh.decode(e),r=Ml(st(t.peerId)),n=(t.addresses??[]).map((e=>vi(e.multiaddr))),s=t.seq;return new zh({peerId:r,multiaddrs:n,seqNumber:s})};static DOMAIN="libp2p-peer-record";static CODEC=$h;peerId;multiaddrs;seqNumber;domain=zh.DOMAIN;codec=zh.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=qh.encode({peerId:this.peerId.toMultihash().bytes,seq:BigInt(this.seqNumber),addresses:this.multiaddrs.map((e=>({multiaddr:e.bytes})))})),this.marshaled}equals(e){return e instanceof zh&&!!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)}}!function(e){let t;e.codec=()=>(null==t&&(t=Er(((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,r={})=>{const n={publicKey:f(0),payloadType:f(0),payload:f(0),signature:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.publicKey=e.bytes();break;case 2:n.payloadType=e.bytes();break;case 3:n.payload=e.bytes();break;case 5:n.signature=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(jh||(jh={}));class Hh extends Error{constructor(e="Invalid signature"){super(e),this.name="InvalidSignatureError"}}class Kh{static createFromProtobuf=async e=>{const t=jh.decode(e),r=Il(t.publicKey);return new Kh({publicKey:r,payloadType:t.payloadType,payload:t.payload,signature:t.signature})};static seal=async(e,t)=>{if(null==t)throw new Error("Missing private key");const r=e.domain,n=e.codec,s=e.marshal(),i=Vh(r,n,s),o=await t.sign(i.subarray());return new Kh({publicKey:t.publicKey,payloadType:n,payload:s,signature:o})};static openAndCertify=async(e,t)=>{const r=await Kh.createFromProtobuf(e);if(!await r.validate(t))throw new Hh("Envelope signature is not valid for the given domain");return r};publicKey;payloadType;payload;signature;marshaled;constructor(e){const{publicKey:t,payloadType:r,payload:n,signature:s}=e;this.publicKey=t,this.payloadType=r,this.payload=n,this.signature=s}marshal(){return null==this.marshaled&&(this.marshaled=jh.encode({publicKey:kl(this.publicKey),payloadType:this.payloadType,payload:this.payload.subarray(),signature:this.signature})),this.marshaled}equals(e){return _n(this.marshal(),e.marshal())}async validate(e){const t=Vh(e,this.payloadType,this.payload);return this.publicKey.verify(t.subarray(),this.signature)}}const Vh=(e,t,r)=>{const n=xt(e),s=_(n.byteLength),i=_(t.length),o=_(r.length);return new Rn(s,n,i,t,o,r)};var Gh=__webpack_require__(5507);const Wh=["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 Gh.Netmask(e)));function Xh(e){for(const t of Wh)if(t.contains(e))return!0;return!1}function Jh(e){return zs(e)?Xh(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 Xh(`${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 Xh(t[t.length-1])}(e):Hs(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 Qh(e){try{if(!function(e){try{const[[t]]=e.stringTuples();return 4===t||41===t}catch{}return!1}(e))return!1;const[[,t]]=e.stringTuples();return null!=t&&(Jh(t)??!1)}catch{}return!0}const Zh=e=>({match:t=>!(t.length<1)&&!!e(t[0])&&t.slice(1),pattern:"fn"}),Yh=e=>({match:t=>Zh((t=>t===e)).match(t),pattern:e}),ed=()=>({match:e=>Zh((e=>"string"==typeof e)).match(e),pattern:"{string}"}),td=()=>({match:e=>Zh((e=>!isNaN(parseInt(e)))).match(e),pattern:"{number}"}),rd=()=>({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{Ee.decode(`z${e[1]}`)}catch(e){return!1}return e.slice(2)},pattern:"/p2p/{peerid}"}),nd=()=>({match:e=>{if(e.length<2)return!1;if("certhash"!==e[0])return!1;try{ke.decode(e[1])}catch{return!1}return e.slice(2)},pattern:"/certhash/{certhash}"}),sd=e=>({match:t=>{const r=e.match(t);return!1===r?t:r},pattern:`optional(${e.pattern})`}),id=(...e)=>({match:t=>{let r;for(const n of e){const e=n.match(t);!1!==e&&(null==r||e.lengthe.pattern)).join(", ")})`}),od=(...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 ad(...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{matchers:e,matches:function(e){return!1!==t(e)},exactMatch:function(e){const r=t(e);return!1!==r&&0===r.length}}}ad(rd());const cd=od(Yh("dns4"),ed()),ld=od(Yh("dns6"),ed()),ud=od(Yh("dnsaddr"),ed()),hd=od(Yh("dns"),ed()),dd=(ad(cd,sd(rd())),ad(ld,sd(rd())),ad(ud,sd(rd())),ad(id(hd,ud,cd,ld),sd(rd())),od(Yh("ip4"),Zh(zs))),pd=od(Yh("ip6"),Zh(Hs)),fd=id(dd,pd),gd=id(fd,hd,cd,ld,ud),md=ad(id(fd,od(id(hd,ud,cd,ld),sd(rd())))),yd=(ad(dd),ad(pd),ad(fd),od(gd,Yh("tcp"),td())),bd=od(gd,Yh("udp"),td()),wd=ad(od(yd,sd(rd()))),vd=(ad(bd),od(bd,Yh("quic"),sd(rd()))),Ed=od(bd,Yh("quic-v1"),sd(rd())),Sd=id(vd,Ed),Ad=(ad(vd),ad(Ed),id(gd,yd,bd,vd,Ed)),Id=id(od(Ad,Yh("ws"),sd(rd()))),kd=ad(Id),xd=id(od(Ad,Yh("wss"),sd(rd())),od(Ad,Yh("tls"),sd(od(Yh("sni"),ed())),Yh("ws"),sd(rd()))),Cd=ad(xd),_d=od(bd,Yh("webrtc-direct"),sd(nd()),sd(nd()),sd(rd())),Td=ad(_d),Pd=od(Ed,Yh("webtransport"),sd(nd()),sd(nd()),sd(rd())),Ld=ad(Pd),Rd=id(Id,xd,od(yd,sd(rd())),od(Sd,sd(rd())),od(gd,sd(rd())),_d,Pd,rd()),Nd=(ad(Rd),ad(od(Rd,Yh("p2p-circuit"),rd()))),Od=ad(id(od(Rd,Yh("p2p-circuit"),Yh("webrtc"),sd(rd())),od(Rd,Yh("webrtc"),sd(rd())),od(Yh("webrtc"),sd(rd()))));ad(id(od(gd,Yh("tcp"),td(),Yh("http"),sd(rd())),od(gd,Yh("http"),sd(rd())))),ad(id(od(gd,Yh("tcp"),id(od(Yh("443"),Yh("http")),od(td(),Yh("https"))),sd(rd())),od(gd,Yh("tls"),Yh("http"),sd(rd())),od(gd,Yh("https"),sd(rd())))),ad(id(od(Yh("memory"),ed(),sd(rd()))));class Dd{readNext;haveNext;ended;nextResult;error;constructor(){this.ended=!1,this.readNext=zn(),this.haveNext=zn()}[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=zn(),e}async throw(e){return this.ended=!0,this.error=e,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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 this.error??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=zn(),await Xn(this.readNext.promise,t?.signal,t)}}class Md extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class Fd extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class Bd extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class Ud extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function $d(e,t){const r=function(e,t={}){const r=function(e,t){const r=new Dd;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 Rn;return{read:async e=>{if(e?.signal?.throwIfAborted(),null==e?.bytes){const{done:t,value:r}=await Xn(n.next(),e?.signal);return!0===t?null:r}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}}}(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=k(t.maxDataLength));const n=t?.lengthDecoder??T,s=t?.lengthEncoder??_;return{read:async e=>{let s=-1;const i=new Rn;for(;;){i.append(await r.read({...e,bytes:1}));try{s=n(i)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new Fd("Invalid message length");if(null!=t?.maxLengthLength&&i.byteLength>t.maxLengthLength)throw new Ud("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new Bd("message length too long");return r.read({...e,bytes:s})},write:async(e,t)=>{await r.write(new Rn(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Rn(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}(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 qd;!function(e){let t;e.codec=()=>(null==t&&(t=Er(((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,r={})=>{const n={listenAddrs:[],protocols:[]},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 5:n.protocolVersion=e.string();break;case 6:n.agentVersion=e.string();break;case 1:n.publicKey=e.bytes();break;case 2:if(null!=r.limits?.listenAddrs&&n.listenAddrs.length===r.limits.listenAddrs)throw new Sr('Decode error - map field "listenAddrs" had too many elements');n.listenAddrs.push(e.bytes());break;case 4:n.observedAddr=e.bytes();break;case 3:if(null!=r.limits?.protocols&&n.protocols.length===r.limits.protocols)throw new Sr('Decode error - map field "protocols" had too many elements');n.protocols.push(e.string());break;case 8:n.signedPeerRecord=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(qd||(qd={}));const jd="ipfs",zd=5e3,Hd=1,Kd=1,Vd=10,Gd=8192,Wd=!0,Xd=!0;class Jd{host;protocol;started;timeout;peerId;privateKey;peerStore;registrar;addressManager;maxInboundStreams;maxOutboundStreams;maxMessageSize;maxObservedAddresses;events;runOnLimitedConnection;log;constructor(e,t){var r,n;this.protocol=t.protocol,this.started=!1,this.peerId=e.peerId,this.privateKey=e.privateKey,this.peerStore=e.peerStore,this.registrar=e.registrar,this.addressManager=e.addressManager,this.events=e.events,this.log=t.log,this.timeout=t.timeout??zd,this.maxInboundStreams=t.maxInboundStreams??Hd,this.maxOutboundStreams=t.maxOutboundStreams??Kd,this.maxMessageSize=t.maxMessageSize??Gd,this.maxObservedAddresses=t.maxObservedAddresses??Vd,this.runOnLimitedConnection=t.runOnLimitedConnection??Xd,this.host={protocolVersion:`${t.protocolPrefix??jd}/0.1.0`,agentVersion:(r=e.nodeInfo,n=t.agentVersion,null!=n?n:r.userAgent)}}isStarted(){return this.started}async start(){this.started||(await this.peerStore.merge(this.peerId,{metadata:{AgentVersion:xt(this.host.agentVersion),ProtocolVersion:xt(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,runOnLimitedConnection:this.runOnLimitedConnection}),this.started=!0)}async stop(){await this.registrar.unhandle(this.protocol),this.started=!1}}class Qd extends Jd{constructor(e,t={}){super(e,{...t,protocol:`/${t.protocolPrefix??jd}/id/1.0.0`,log:e.logger.forComponent("libp2p:identify")}),(t.runOnConnectionOpen??Wd)&&e.events.addEventListener("connection:open",(e=>{const t=e.detail;this.identify(t).catch((e=>{e.name!==xo.name&&this.log.error("error during identify trigged by connection:open",e)}))}))}[xl]=["@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,runOnLimitedConnection:this.runOnLimitedConnection});const n=$d(r,{maxDataLength:this.maxMessageSize}).pb(qd),s=await n.read(t);return await r.close(t),s}catch(e){throw r?.abort(e),e}}async identify(e,t={}){const r=await this._identify(e,t),{publicKey:n,protocols:s,observedAddr:i}=r;if(null==n)throw new Co("public key was missing from identify message");const o=Fl(Il(n).toCID());if(!e.remotePeer.equals(o))throw new Co("identified peer does not match the expected peer");if(this.peerId.equals(o))throw new Co("identified peer is our own peer id?");return this.maybeAddObservedAddress(i),this.log("identify completed for peer %p and protocols %o",o,s),async function(e,t,r,n,s){if(r("received identify from %p",n.remotePeer),null==s)throw new Co("message was null or undefined");const i={};if(s.listenAddrs.length>0&&(i.addresses=s.listenAddrs.map((e=>({isCertified:!1,multiaddr:vi(e)})))),s.protocols.length>0&&(i.protocols=s.protocols),null!=s.publicKey){const e=Il(s.publicKey);if(!Dl(e).equals(n.remotePeer))throw new Co("public key did not match remote PeerId");i.publicKey=e}let o;if(null!=s.signedPeerRecord){r.trace("received signedPeerRecord from %p",n.remotePeer);let t=s.signedPeerRecord;const a=await Kh.openAndCertify(t,zh.DOMAIN);let c=zh.createFromProtobuf(a.payload);const l=Fl(a.publicKey.toCID());if(!c.peerId.equals(l))throw new Co("signing key does not match PeerId in the PeerRecord");if(!n.remotePeer.equals(c.peerId))throw new Co("signing key does not match remote PeerId");let u;try{u=await e.get(c.peerId)}catch(e){if("NotFoundError"!==e.name)throw e}if(null!=u&&(i.metadata=u.metadata,null!=u.peerRecordEnvelope)){const e=await Kh.createFromProtobuf(u.peerRecordEnvelope),n=zh.createFromProtobuf(e.payload);n.seqNumber>=c.seqNumber&&(r("sequence number was lower or equal to existing sequence number - stored: %d received: %d",n.seqNumber,c.seqNumber),c=n,t=u.peerRecordEnvelope)}i.peerRecordEnvelope=t,i.addresses=c.multiaddrs.map((e=>({isCertified:!0,multiaddr:e}))),o={seq:c.seqNumber,addresses:c.multiaddrs}}else r("%p did not send a signed peer record",n.remotePeer);if(r.trace("patching %p with",n.remotePeer,i),await e.patch(n.remotePeer,i),null!=s.agentVersion||null!=s.protocolVersion){const t={};null!=s.agentVersion&&(t.AgentVersion=xt(s.agentVersion)),null!=s.protocolVersion&&(t.ProtocolVersion=xt(s.protocolVersion)),r.trace("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=>vi(e))),observedAddr:null==s.observedAddr?void 0:vi(s.observedAddr),protocols:s.protocols,signedPeerRecord:o,connection:n};return t.safeDispatchEvent("peer:identify",{detail:a}),a}(this.peerStore,this.events,this.log,e,r)}maybeAddObservedAddress(e){const t=function(e){if(null!=e&&e.length>0)try{return vi(e)}catch{}}(e);null!=t&&(this.log.trace("our observed address was %a",t),Qh(t)?this.log.trace("our observed address was private"):41!==t.stringTuples()[0][0]||function(e){try{const[[r,n]]=e.stringTuples();if(null==n)return!1;if(41===r)return t=n,new js("2000::/3").contains(t)}catch{}var t;return!1}(t)?wd.exactMatch(t)||(this.log.trace("storing the observed address"),this.addressManager.addObservedAddr(t)):this.log.trace("our observed address was IPv6 but not a global unicast address"))}async handleProtocol(e){const{connection:t,stream:r}=e,n=AbortSignal.timeout(this.timeout);try{const e=await this.peerStore.get(this.peerId),s=this.addressManager.getAddresses().map((e=>e.decapsulateCode(Zs("p2p").code)));let i=e.peerRecordEnvelope;if(s.length>0&&null==i){const e=new zh({peerId:this.peerId,multiaddrs:s});i=(await Kh.seal(e,this.privateKey)).marshal().subarray()}let o=t.remoteAddr.bytes;md.matches(t.remoteAddr)||(o=void 0);const a=$d(r).pb(qd);await a.write({protocolVersion:this.host.protocolVersion,agentVersion:this.host.agentVersion,publicKey:kl(this.privateKey.publicKey),listenAddrs:s.map((e=>e.bytes)),signedPeerRecord:i,observedAddr:o,protocols:e.protocols},{signal:n}),await r.close({signal:n})}catch(e){this.log.error("could not respond to identify request",e),r.abort(e)}}}function Zd(e={}){return t=>new Qd(t,e)}function Yd(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 ep=()=>{const e=new Error("Delay aborted");return e.name="AbortError",e},tp=new WeakMap,rp=function({clearTimeout:e,setTimeout:t}={}){return(r,{value:n,signal:s}={})=>{if(s?.aborted)return Promise.reject(ep());let i,o,a;const c=e??clearTimeout,l=()=>{c(i),a(ep())},u=new Promise(((e,c)=>{o=()=>{s&&s.removeEventListener("abort",l),e(n)},a=c,i=(t??setTimeout)(o,r)}));return s&&s.addEventListener("abort",l,{once:!0}),tp.set(u,(()=>{c(i),i=null,o()})),u}}();class np extends Error{remainingPoints;msBeforeNext;consumedPoints;isFirstInDuration;constructor(e="Rate limit exceeded",t){super(e),this.name="RateLimitError",this.remainingPoints=t.remainingPoints,this.msBeforeNext=t.msBeforeNext,this.consumedPoints=t.consumedPoints,this.isFirstInDuration=t.isFirstInDuration}}class sp extends Error{static name="QueueFullError";constructor(e="The queue was full"){super(e),this.name="QueueFullError"}}class ip{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 op}async consume(e,t=1,r={}){const n=this.getKey(e),s=this._getKeySecDuration(r);let i=this.memoryStorage.incrby(n,t,s);if(i.remainingPoints=Math.max(this.points-i.consumedPoints,0),i.consumedPoints>this.points)throw this.blockDuration>0&&i.consumedPoints<=this.points+t&&(i=this.memoryStorage.set(n,i.consumedPoints,this.blockDuration)),new np("Rate limit exceeded",i);if(this.execEvenly&&i.msBeforeNext>0&&!i.isFirstInDuration){let e=Math.ceil(i.msBeforeNext/(i.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 op{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 i={value:t,expiresAt:n>0?new Date(Date.now()+n):void 0};return this.storage.set(e,i),n>0&&(i.timeoutId=setTimeout((()=>{this.storage.delete(e)}),n),null!=i.timeoutId.unref&&i.timeoutId.unref()),{remainingPoints:0,msBeforeNext:0===n?-1:n,consumedPoints:i.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 ap;!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"}(ap||(ap={}));const cp=Object.freeze({0:"NEW_STREAM",1:"MESSAGE_RECEIVER",2:"MESSAGE_INITIATOR",3:"CLOSE_RECEIVER",4:"CLOSE_INITIATOR",5:"RESET_RECEIVER",6:"RESET_INITIATOR"}),lp=Object.freeze({NEW_STREAM:ap.NEW_STREAM,MESSAGE:ap.MESSAGE_INITIATOR,CLOSE:ap.CLOSE_INITIATOR,RESET:ap.RESET_INITIATOR}),up=Object.freeze({MESSAGE:ap.MESSAGE_RECEIVER,CLOSE:ap.CLOSE_RECEIVER,RESET:ap.RESET_RECEIVER}),hp=1<<20;class dp{_buffer;_headerInfo;_maxMessageSize;_maxUnprocessedMessageQueueSize;constructor(e=hp,t=4194304){this._buffer=new Rn,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 new Co("Unprocessed message queue size too large!");const t=[];for(;0!==this._buffer.length;){if(null==this._headerInfo)try{this._headerInfo=this._decodeHeader(this._buffer)}catch(e){if("InvalidMessageError"===e.name)throw e;break}const{id:e,type:r,length:n,offset:s}=this._headerInfo;if(this._buffer.length-sthis._maxMessageSize)throw new Co("Message size too large");return{id:t>>3,type:i,offset:r+s,length:n}}}const pp=128,fp=127;function gp(e,t=0){let r,n=0,s=0,i=t;const o=e.length;do{if(i>=o||s>49)throw t=0,new RangeError("Could not decode varint");r=e.get(i++),n+=s<28?(r&fp)<=pp);return{value:n,offset:t=i-t}}const mp=10240,yp=new class{_pool;_poolOffset;constructor(){this._pool=g(mp),this._poolOffset=0}write(e,t){const r=this._pool;let n=this._poolOffset;_(e.id<<3|e.type,r,n),n+=k(e.id<<3|e.type),e.type!==ap.NEW_STREAM&&e.type!==ap.MESSAGE_INITIATOR&&e.type!==ap.MESSAGE_RECEIVER||null==e.data?(_(0,r,n),n+=k(0)):(_(e.data.length,r,n),n+=k(e.data.length));const s=r.subarray(this._poolOffset,n);mp-n<100?(this._pool=g(mp),this._poolOffset=0):this._poolOffset=n,t.append(s),e.type!==ap.NEW_STREAM&&e.type!==ap.MESSAGE_INITIATOR&&e.type!==ap.MESSAGE_RECEIVER||null==e.data||t.append(e.data)}};class bp extends Error{constructor(e="Stream input buffer error"){super(e),this.name="StreamInputBufferError"}}function wp(e){return null!=e&&"function"==typeof e.then&&"function"==typeof e.catch&&"function"==typeof e.finally}class vp{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=zn(),this.closed=zn(),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=Gn({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 vo(`writable end state is "${this.writeStatus}" not "ready"`);try{this.writeStatus="writing";const t={signal:this.sinkController.signal};if("outbound"===this.direction){const e=this.sendNewStream(t);wp(e)&&await e}const r=()=>{Yd(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 Rn(r):r;const e=this.sendData(r,t);wp(e)&&(this.sendingData=zn(),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){"open"===this.status&&(this.log.trace("closing gracefully"),this.status="closing",await Xn(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 Xn(this.sink([]),e.signal)),"writing"===this.writeStatus&&(null!=this.sendingData&&await Xn(this.sendingData.promise,e.signal),this.log.trace("aborting source passed to .sink"),this.sinkController.abort(),await Xn(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();wp(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 wo("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 Ep extends vp{name;streamId;send;types;maxDataSize;constructor(e){super(e),this.types="outbound"===e.direction?lp:up,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:lp.NEW_STREAM,data:new Rn(xt(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 Sp(e){const t={...e,type:`${cp[e.type]} (${e.type})`};return e.type===ap.NEW_STREAM&&(t.data=en(e.data instanceof Uint8Array?e.data:e.data.subarray())),e.type!==ap.MESSAGE_INITIATOR&&e.type!==ap.MESSAGE_RECEIVER||(t.data=en(e.data instanceof Uint8Array?e.data:e.data.subarray(),"base16")),t}class Ap{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=Gn({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 Rn;yp.write(t,e),yield e}}(e))),this.closeController=new AbortController,this.rateLimiter=new ip({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 bo("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 Oo("Too many outbound streams open");if(s.has(t))throw new Error(`${n} stream ${t} already exists!`);const i=function(e){const{id:t,name:r,send:n,onEnd:s,type:i="initiator",maxMsgSize:o=hp}=e;return new Ep({id:"initiator"===i?`i${t}`:`r${t}`,streamId:t,name:`${r??t}`,direction:"initiator"===i?"outbound":"inbound",maxDataSize:o,onEnd:s,send:n,log:e.logger.forComponent(`libp2p:mplex:stream:${i}:${t}`)})}({id:t,name:r,send:async e=>{this.log.enabled&&this.log.trace("%s stream %s send",n,t,Sp(e)),this._source.push(e)},type:n,onEnd:()=>{this.log("%s stream with id %s and protocol %s ended",n,t,i.protocol),s.delete(t),null!=this._init.onStreamEnd&&this._init.onStreamEnd(i)},maxMsgSize:this._init.maxMsgSize,logger:this.logger});return s.set(t,i),i}_createSink(){return async e=>{const t=()=>{Yd(e,this.log)};this.closeController.signal.addEventListener("abort",t);try{const t=new dp(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",Sp(e)),e.type===ap.NEW_STREAM){if(this._streams.receivers.size===(this._init.maxInboundStreams??1024)){this.log("too many inbound streams open"),this._source.push({id:t,type:ap.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:en(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,cp[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 ap.MESSAGE_INITIATOR:case ap.MESSAGE_RECEIVER:if(n.sourceReadableLength()>s)throw this._source.push({id:e.id,type:r===ap.MESSAGE_INITIATOR?ap.RESET_RECEIVER:ap.RESET_INITIATOR}),new bp("Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers");n.sourcePush(e.data);break;case ap.CLOSE_INITIATOR:case ap.CLOSE_RECEIVER:n.remoteCloseWrite();break;case ap.RESET_INITIATOR:case ap.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 Ip{protocol="/mplex/6.7.0";_init;components;constructor(e,t={}){this.components=e,this._init=t}[Symbol.toStringTag]="@libp2p/mplex";[xl]=["@libp2p/stream-multiplexing"];createStreamMuxer(e={}){return new Ap(this.components,{...e,...this._init})}}function kp(e={}){return t=>new Ip(t,e)}function xp(e){if(isNaN(e)||e<=0)throw new ho("random bytes length must be a Number bigger than 0");return Fr(e)}class Cp{protocol;components;started;timeout;maxInboundStreams;maxOutboundStreams;runOnLimitedConnection;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.runOnLimitedConnection=t.runOnLimitedConnection??!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,runOnLimitedConnection:this.runOnLimitedConnection}),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 To("ping timeout"))})),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 Co("Too much data received"));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=xp(32),s=await this.components.connectionManager.openConnection(e,t);let i,o=()=>{};if(null==t.signal){const e=AbortSignal.timeout(this.timeout);t={...t,signal:e}}try{i=await s.newStream(this.protocol,{...t,runOnLimitedConnection:this.runOnLimitedConnection}),o=()=>{i?.abort(new lo)},t.signal?.addEventListener("abort",o,{once:!0});const e=await Zn([n],i,(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 _o(`Did not receive a ping ack after ${a}ms`);if(!_n(n,e.subarray()))throw new _o(`Received wrong ping ack after ${a}ms`);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),i?.abort(e),e}finally{t.signal?.removeEventListener("abort",o),null!=i&&await i.close()}}}function _p(e={}){return t=>new Cp(t,e)}const Tp=Symbol.for("@libp2p/transport");var Pp;!function(e){e[e.FATAL_ALL=0]="FATAL_ALL",e[e.NO_FATAL=1]="NO_FATAL"}(Pp||(Pp={}));const Lp=[Zs("tcp").code,Zs("dns").code,Zs("dnsaddr").code,Zs("dns4").code,Zs("dns6").code];function Rp(e){return Op("sni",e)?.[1]}function Np(e){const t=Op("tcp",e)?.[1];return null==t?"":`:${t}`}function Op(e,t){let r;try{r=Zs(e).code}catch(e){return}for(const[e,n]of t)if(e===r&&null!=n)return[e,n]}function Dp(e){return e.some((([e,t])=>e===Zs("tls").code))}function Mp(e,t,r){const n=Fp[Zs(e).name];if(null==n)throw new Error(`Can't interpret protocol ${Zs(e).name}`);const s=n(t,r);return e===Zs("ip6").code?`[${s}]`:s}const Fp={ip4:(e,t)=>e,ip6:(e,t)=>0===t.length?e:`[${e}]`,tcp:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`tcp://${Mp(r[0],r[1]??"",t)}:${e}`},udp:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`udp://${Mp(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(null==r)throw new Error("Unexpected end of multiaddr");return`${Mp(r[0],r[1]??"",t)}`},p2p:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`${Mp(r[0],r[1]??"",t)}`},http:(e,t)=>{const r=Dp(t),n=Rp(t),s=Np(t);if(r&&null!=n)return`https://${n}${s}`;const i=r?"https://":"http://",o=t.pop();if(null==o)throw new Error("Unexpected end of multiaddr");let a=Mp(o[0],o[1]??"",t);return a=a.replace("tcp://",""),`${i}${a}`},"http-path":(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return`${Mp(r[0],r[1]??"",t)}/${decodeURIComponent(e)}`},tls:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return Mp(r[0],r[1]??"",t)},sni:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");return Mp(r[0],r[1]??"",t)},https:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");let n=Mp(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`https://${n}`},ws:(e,t)=>{const r=Dp(t),n=Rp(t),s=Np(t);if(r&&null!=n)return`wss://${n}${s}`;const i=r?"wss://":"ws://",o=t.pop();if(null==o)throw new Error("Unexpected end of multiaddr");let a=Mp(o[0],o[1]??"",t);return a=a.replace("tcp://",""),`${i}${a}`},wss:(e,t)=>{const r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");let n=Mp(r[0],r[1]??"",t);return n=n.replace("tcp://",""),`wss://${n}`}},Bp=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",i)}function s(){n(),t()}function i(t){n(),r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}e.addEventListener("open",s),e.addEventListener("error",i)}))},Up=(e,t)=>((t=t??{}).closeOnEnd=!1!==t.closeOnEnd,async r=>{for await(const t of r){try{await Bp(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 $p=__webpack_require__(544);function qp(e){return e instanceof ArrayBuffer||"ArrayBuffer"===e?.constructor?.name&&"number"==typeof e?.byteLength}const jp=WebSocket,zp={"http:":"ws:","https:":"wss:"};function Hp(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(zp))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 i=t=>{e.removeEventListener("open",o),e.removeEventListener("error",a),t()},o=()=>{i(t)},a=t=>{i((()=>{r(t.error??new Error(`connect ECONNREFUSED ${e.url}`))}))};e.addEventListener("open",o),e.addEventListener("error",a)}))},r=async function*(){const r=new $p.PP((({push:t,stop:r,fail:n})=>{const s=e=>{let r=null;"string"==typeof e.data&&(r=xt(e.data)),qp(e.data)&&(r=new Uint8Array(e.data)),e.data instanceof Uint8Array&&(r=e.data),null!=r&&t(r)},i=e=>{n(e.error??new Error("Socket error"))};return e.addEventListener("message",s),e.addEventListener("error",i),e.addEventListener("close",r),()=>{e.removeEventListener("message",s),e.removeEventListener("error",i),e.removeEventListener("close",r)}}),{highWaterMark:1/0});await t();for await(const e of r)yield qp(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:Up(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 jp(r.toString(),t.websocket),t)}class Kp extends Event{type;detail;constructor(e,t){super(e),this.type=e,this.detail=t}}function Vp(e){return e.filter((e=>Cd.exactMatch(e)||kd.exactMatch(e)))}function Gp(e){return e.filter((e=>Cd.exactMatch(e)))}class Wp{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"})})}[Tp]=!0;[Symbol.toStringTag]="@libp2p/websockets";[xl]=["@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,i=r.metricPrefix??"",o={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}=o.remoteAddr.toOptions();n("timeout closing stream to %s:%s after %dms, destroying it manually",e,t,Date.now()-r),this.abort(new lo("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),o.timeline.close=Date.now()}},abort(t){const{host:r,port:a}=o.remoteAddr.toOptions();n("timeout closing stream to %s:%s due to error",r,a,t),e.destroy(),o.timeline.close=Date.now(),s?.increment({[`${i}error`]:!0})}};return e.socket.addEventListener("close",(()=>{s?.increment({[`${i}close`]:!0}),null==o.timeline.close&&(o.timeline.close=Date.now())}),{once:!0}),o}(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=zn(),s=Hp(function(e){const t=vi(e).stringTuples(),r=t.pop();if(null==r)throw new Error("Unexpected end of multiaddr");const n=Zs(r[0]),s=Fp[n.name];if(null==s)throw new Error(`No interpreter found for ${n.name}`);let i=s(r[1]??"",t);return Lp.includes(r[0])&&(i=i.replace(/^.*:\/\//,""),i="443"===r[1]?`https://${i}`:`http://${i}`),(i.startsWith("http://")||i.startsWith("https://")||i.startsWith("ws://")||i.startsWith("wss://"))&&(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 yo(`Could not connect to ${e.toString()}`);this.log.error("connection error:",t),this.metrics?.dialerEvents.increment({error:!0}),n.reject(t)}));try{t.onProgress?.(new Kp("websockets:open-connection")),await Xn(Promise.race([s.connected(),n.promise]),t.signal)}catch(e){throw 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.events,this.components.metrics),this.init)}listenFilter(e){return e=Array.isArray(e)?e:[e],null!=this.init?.filter?this.init?.filter(e):Vp(e)}dialFilter(e){return this.listenFilter(e)}}function Xp(e={}){return t=>new Wp(t,e)}var Jp=__webpack_require__(228);class Qp extends Error{constructor(e){super(e),this.name="TimeoutError"}}class Zp extends Error{constructor(e){super(),this.name="AbortError",this.message=e}}const Yp=e=>void 0===globalThis.DOMException?new Zp(e):new DOMException(e),ef=e=>{const t=void 0===e.reason?Yp("This operation was aborted."):e.reason;return t instanceof Error?t:Yp(t)};function tf(e,t){const{milliseconds:r,fallback:n,message:s,customTimers:i={setTimeout,clearTimeout}}=t;let o,a;const c=new Promise(((c,l)=>{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&&l(ef(e)),a=()=>{l(ef(e))},e.addEventListener("abort",a,{once:!0})}if(r===Number.POSITIVE_INFINITY)return void e.then(c,l);const u=new Qp;o=i.setTimeout.call(void 0,(()=>{if(n)try{c(n())}catch(e){l(e)}else"function"==typeof e.cancel&&e.cancel(),!1===s?c():s instanceof Error?l(s):(u.message=s??`Promise timed out after ${r} milliseconds`,l(u))}),r),(async()=>{try{c(await e)}catch(e){l(e)}})()})).finally((()=>{c.clear(),a&&t.signal&&t.signal.removeEventListener("abort",a)}));return c.clear=()=>{i.clearTimeout.call(void 0,o),o=void 0},c}class rf{#i=[];enqueue(e,t){const r={priority:(t={priority:0,...t}).priority,id:t.id,run:e};if(0===this.size||this.#i[this.size-1].priority>=t.priority)return void this.#i.push(r);const n=function(e,t){let r=0,n=e.length;for(;n>0;){const i=Math.trunc(n/2);let o=r+i;s=e[o],t.priority-s.priority<=0?(r=++o,n-=i+1):n=i}var s;return r}(this.#i,r);this.#i.splice(n,0,r)}setPriority(e,t){const r=this.#i.findIndex((t=>t.id===e));if(-1===r)throw new ReferenceError(`No promise function with the id "${e}" exists in the queue.`);const[n]=this.#i.splice(r,1);this.enqueue(n.run,{priority:t,id:e})}dequeue(){const e=this.#i.shift();return e?.run}filter(e){return this.#i.filter((t=>t.priority===e.priority)).map((e=>e.run))}get size(){return this.#i.length}}class nf extends Jp{#o;#a;#c=0;#l;#u;#h=0;#d;#p;#i;#f;#g=0;#m;#y;#b;#w=1n;timeout;constructor(e){if(super(),!("number"==typeof(e={carryoverConcurrencyCount:!1,intervalCap:Number.POSITIVE_INFINITY,interval:0,concurrency:Number.POSITIVE_INFINITY,autoStart:!0,queueClass:rf,...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.#o=e.carryoverConcurrencyCount,this.#a=e.intervalCap===Number.POSITIVE_INFINITY||0===e.interval,this.#l=e.intervalCap,this.#u=e.interval,this.#i=new e.queueClass,this.#f=e.queueClass,this.concurrency=e.concurrency,this.timeout=e.timeout,this.#b=!0===e.throwOnTimeout,this.#y=!1===e.autoStart}get#v(){return this.#a||this.#c{this.#I()}),t)),!0;this.#c=this.#o?this.#g:0}return!1}#A(){if(0===this.#i.size)return this.#d&&clearInterval(this.#d),this.#d=void 0,this.emit("empty"),0===this.#g&&this.emit("idle"),!1;if(!this.#y){const e=!this.#C;if(this.#v&&this.#E){const t=this.#i.dequeue();return!!t&&(this.emit("active"),t(),e&&this.#x(),!0)}}return!1}#x(){this.#a||void 0!==this.#d||(this.#d=setInterval((()=>{this.#k()}),this.#u),this.#h=Date.now()+this.#u)}#k(){0===this.#c&&0===this.#g&&this.#d&&(clearInterval(this.#d),this.#d=void 0),this.#c=this.#o?this.#g:0,this.#_()}#_(){for(;this.#A(););}get concurrency(){return this.#m}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.#m=e,this.#_()}async#T(e){return new Promise(((t,r)=>{e.addEventListener("abort",(()=>{r(e.reason)}),{once:!0})}))}setPriority(e,t){this.#i.setPriority(e,t)}async add(e,t={}){return t.id??=(this.#w++).toString(),t={timeout:this.timeout,throwOnTimeout:this.#b,...t},new Promise(((r,n)=>{this.#i.enqueue((async()=>{this.#g++,this.#c++;try{t.signal?.throwIfAborted();let n=e({signal:t.signal});t.timeout&&(n=tf(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 Qp&&!t.throwOnTimeout)return void r();n(e),this.emit("error",e)}finally{this.#S()}}),t),this.emit("add"),this.#A()}))}async addAll(e,t){return Promise.all(e.map((async e=>this.add(e,t))))}start(){return this.#y?(this.#y=!1,this.#_(),this):this}pause(){this.#y=!0}clear(){this.#i=new this.#f}async onEmpty(){0!==this.#i.size&&await this.#P("empty")}async onSizeLessThan(e){this.#i.sizethis.#i.size{const n=()=>{t&&!t()||(this.off(e,n),r())};this.on(e,n)}))}get size(){return this.#i.size}sizeBy(e){return this.#i.filter(e).length}get pending(){return this.#g}get isPaused(){return this.#y}}function sf(e){const t=[cf.A];return null==e?t:Array.isArray(e)?0===e.length?t:e:[e]}function of(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:cf[e.type]}))),Answer:(e.Answer??e.answers??[]).map((e=>({name:e.name,type:cf[e.type],TTL:e.TTL??e.ttl??60,data:e.data instanceof Uint8Array?en(e.data):e.data})))}}function af(e,t={}){const r=new nf({concurrency:t.queryConcurrency??4});return async(t,n={})=>{const s=new URLSearchParams;s.set("name",t),sf(n.types).forEach((e=>{s.append("type",cf[e])})),n.onProgress?.(new Kp("dns:query",{detail:t}));const i=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=of(await t.json());return n.onProgress?.(new Kp("dns:response",{detail:r})),r}),{signal:n.signal});if(null==i)throw new Error("No DNS response received");return i}}var cf,lf=__webpack_require__(194);class uf{lru;constructor(e){this.lru=lf(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 of({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:cf[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??60),value:t}),this.lru.set(r,n)}remove(e,t){const r=`${e.toLowerCase()}-${t}`;this.lru.remove(r)}clear(){this.lru.clear()}}class hf{resolvers;cache;constructor(e){var t;this.resolvers={},this.cache=(t=e.cacheSize??1e3,new uf(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["."]=[af("https://cloudflare-dns.com/dns-query"),af("https://dns.google/resolve")])}async query(e,t={}){const r=sf(t.types),n=!1!==t.cached?this.cache.get(e,r):void 0;if(null!=n)return t.onProgress?.(new Kp("dns:cache",{detail:n})),n;const s=`${e.split(".").pop()}.`,i=(this.resolvers[s]??this.resolvers["."]).sort((()=>Math.random()>.5?-1:1)),o=[];for(const n of i){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){o.push(e),t.onProgress?.(new Kp("dns:error",{detail:e}))}}if(1===o.length)throw o[0];throw new AggregateError(o,`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"}(cf||(cf={}));const{code:df}=Zs("dnsaddr");class pf extends Error{constructor(e="Max recursive depth reached"){super(e),this.name="RecursionLimitError"}}const ff=async function(e,t={}){const r=t.maxRecursiveDepth??32;if(0===r)throw new pf("Max recursive depth reached");const[,n]=e.stringTuples().find((([e])=>e===df))??[],s=t?.dns??function(e={}){return new hf(e)}(),i=await s.query(`_dnsaddr.${n}`,{signal:t?.signal,types:[cf.TXT]}),o=e.getPeerId(),a=[];for(const e of i.Answer){const n=e.data.replace(/["']/g,"").trim().split("=")[1];if(null==n)continue;if(null!=o&&!n.includes(o))continue;const s=vi(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},gf=__webpack_require__(6864),mf={addresses:{listen:[],announce:[],noAnnounce:[],announceFilter:e=>e},connectionManager:{resolvers:{dnsaddr:ff}},transportManager:{faultTolerance:Pp.FATAL_ALL}};async function yf(e){const t=gf(mf,e);if(null===t.connectionProtector&&null!=globalThis.process?.env?.LIBP2P_FORCE_PNET)throw new ho("Private network is enforced, but no protector was provided");return t}const bf=Symbol.for("@libp2p/content-routing"),wf=Symbol.for("@libp2p/peer-routing"),vf=1e3,Ef=60*vf,Sf=60*Ef,Af=24*Sf,If=7*Af,kf=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*If;case"days":case"day":case"d":return r*Af;case"hours":case"hour":case"hrs":case"hr":case"h":return r*Sf;case"minutes":case"minute":case"mins":case"min":case"m":return r*Ef;case"seconds":case"second":case"secs":case"sec":case"s":return r*vf;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>=Af?xf(e,t,Af,"day"):t>=Sf?xf(e,t,Sf,"hour"):t>=Ef?xf(e,t,Ef,"minute"):t>=vf?xf(e,t,vf,"second"):`${e} ms`}(e):function(e){const t=Math.abs(e);return t>=Af?`${Math.round(e/Af)}d`:t>=Sf?`${Math.round(e/Sf)}h`:t>=Ef?`${Math.round(e/Ef)}m`:t>=vf?`${Math.round(e/vf)}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 xf(e,t,r,n){const s=t>=1.5*r;return`${Math.round(e/r)} ${n}${s?"s":""}`}const Cf=function(){try{return localStorage}catch(e){}}(),_f=console.debug??console.log??(()=>{}),Tf=function(e){function t(e){let n,s,i,o=null;function a(...e){if(!a.enabled)return;const r=a,s=Number(new Date),i=s-(n||s);r.diff=i,r.prev=n,r.curr=s,n=s,e[0]=t.coerce(e[0]),"string"!=typeof e[0]&&e.unshift("%O");let o=0;e[0]=e[0].replace(/%([a-zA-Z%])/g,((n,s)=>{if("%%"===n)return"%";o++;const i=t.formatters[s];if("function"==typeof i){const t=e[o];n=i.call(r,t),e.splice(o,1),o--}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!==o?o:(s!==t.namespaces&&(s=t.namespaces,i=t.enabled(e)),i),set:e=>{o=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?Cf?.setItem("debug",e):Cf?.removeItem("debug")}catch(e){}},load:function(){let e;try{e=Cf?.getItem("debug")}catch(e){}return!e&&void 0!==globalThis.process&&"env"in globalThis.process&&(e=globalThis.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:Cf,log:_f}),Pf=Tf;function Lf(){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 Pf.enabled(`${e}:trace`)&&null!=Pf.names.map((e=>e.toString())).find((e=>e.includes(":trace")))&&(t=Pf(`${e}:trace`)),Object.assign(Pf(e),{error:Pf(`${e}:error`),trace:t})}(e)}}function Rf(e){if(null!=e&&0!==(e=e.trim()).length)return e}function Nf(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}function Of(e){return Ml(st(Ee.decode(`z${e}`)))}Pf.formatters.b=e=>null==e?"undefined":Ee.baseEncode(e),Pf.formatters.t=e=>null==e?"undefined":ue.baseEncode(e),Pf.formatters.m=e=>null==e?"undefined":Ae.baseEncode(e),Pf.formatters.p=e=>null==e?"undefined":e.toString(),Pf.formatters.c=e=>null==e?"undefined":e.toString(),Pf.formatters.k=e=>null==e?"undefined":e.toString(),Pf.formatters.a=e=>null==e?"undefined":e.toString(),Pf.formatters.e=e=>null==e?"undefined":Rf(e.stack)??Rf(e.message)??e.toString();class Df{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 Nf(this.set.entries(),(e=>{const t=Of(e[0]);return[t,t]}))}forEach(e){this.set.forEach((t=>{const r=Of(t);e(r,r,this)}))}has(e){return this.set.has(e.toString())}values(){return Nf(this.set.values(),(e=>Of(e)))}intersection(e){const t=new Df;for(const r of e)this.has(r)&&t.add(r);return t}difference(e){const t=new Df;for(const r of this)e.has(r)||t.add(r);return t}union(e){const t=new Df;for(const r of e)t.add(r);for(const e of this)t.add(e);return t}}const Mf={},Ff=e=>{e.addEventListener("message",(t=>{Ff.dispatchEvent("message",e,t)})),null!=e.port&&e.port.addEventListener("message",(t=>{Ff.dispatchEvent("message",e,t)}))};Ff.addEventListener=(e,t)=>{null==Mf[e]&&(Mf[e]=[]),Mf[e].push(t)},Ff.removeEventListener=(e,t)=>{null!=Mf[e]&&(Mf[e]=Mf[e].filter((e=>e===t)))},Ff.dispatchEvent=function(e,t,r){null!=Mf[e]&&Mf[e].forEach((e=>e(t,r)))};const Bf=Ff,Uf="lock:worker:request-read",$f="lock:worker:release-read",qf="lock:master:grant-read",jf="lock:worker:request-write",zf="lock:worker:release-write",Hf="lock:master:grant-write",Kf=(e,t,r,n,s)=>(i,o)=>{if(o.data.type!==r)return;const a={type:o.data.type,name:o.data.name,identifier:o.data.identifier};e.dispatchEvent(new MessageEvent(t,{data:{name:a.name,handler:async()=>{i.postMessage({type:s,name:a.name,identifier:a.identifier}),await new Promise((e=>{const t=r=>{if(null==r?.data)return;const s=r.data.type,o=(r.data.name,r.data.identifier);s===n&&o===a.identifier&&(i.removeEventListener("message",t),e())};i.addEventListener("message",t)}))}}}))},Vf=(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 i=o=>{if(null==o?.data)return;const a=o.data.type,c=o.data.identifier;a===r&&c===s&&(globalThis.removeEventListener("message",i),t((()=>{globalThis.postMessage({type:n,identifier:s,name:e})})))};globalThis.addEventListener("message",i)}))},Gf={singleProcess:!1},Wf={};let Xf;async function Jf(e,t){let r;const n=new Promise((e=>{r=e}));return e.add((async()=>tf((async()=>{await new Promise((e=>{r((()=>{e()}))}))})(),{milliseconds:t.timeout}))),n}const Qf={name:"lock",concurrency:1/0,timeout:846e5,singleProcess:!1};var Zf,Yf,eg;function tg(e,t){if(null!=e.publicKey||null==t.publicKey)return e;let r;return"RSA"===e.type&&(r=st(Ee.decode(`z${e}`))),Dl(Il(t.publicKey,r))}function rg(e,t,r){return ng(e,Zf.decode(t),r)}function ng(e,t,r){const n=new Map,s=BigInt(Date.now());for(const[e,r]of t.tags.entries())null!=r.expiry&&r.expirynull!=e&&e>Date.now()-r)).map((({multiaddr:e,isCertified:t})=>({multiaddr:vi(e),isCertified:t??!1}))),metadata:t.metadata,peerRecordEnvelope:t.peerRecordEnvelope??void 0,tags:n}}function sg(e,t){return null==e&&null==t||null!=e&&null!=t&&_n(e,t)}function ig(e,t,r){if(e.length!==t.length)return!1;for(let n=0;n(null==t&&(t=Er(((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,r={})=>{const n={key:"",value:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.key=e.string();break;case 2:n.value=e.bytes();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(t=e.Peer$metadataEntry||(e.Peer$metadataEntry={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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),eg.codec().encode(e.value,t)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={key:""},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.key=e.string();break;case 2:n.value=eg.codec().decode(e,e.uint32(),{limits:r.limits?.value});break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(r=e.Peer$tagsEntry||(e.Peer$tagsEntry={})),e.codec=()=>(null==n&&(n=Er(((t,r,n={})=>{if(!1!==n.lengthDelimited&&r.fork(),null!=t.addresses)for(const e of t.addresses)r.uint32(10),Yf.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);null!=t.updated&&(r.uint32(64),r.uint64Number(t.updated)),!1!==n.lengthDelimited&&r.ldelim()}),((t,r,n={})=>{const s={addresses:[],protocols:[],metadata:new Map,tags:new Map},i=null==r?t.len:t.pos+r;for(;t.pos>>3){case 1:if(null!=n.limits?.addresses&&s.addresses.length===n.limits.addresses)throw new Sr('Decode error - map field "addresses" had too many elements');s.addresses.push(Yf.codec().decode(t,t.uint32(),{limits:n.limits?.addresses$}));break;case 2:if(null!=n.limits?.protocols&&s.protocols.length===n.limits.protocols)throw new Sr('Decode error - map field "protocols" had too many elements');s.protocols.push(t.string());break;case 4:s.publicKey=t.bytes();break;case 5:s.peerRecordEnvelope=t.bytes();break;case 6:{if(null!=n.limits?.metadata&&s.metadata.size===n.limits.metadata)throw new Ar('Decode error - map field "metadata" had too many elements');const r=e.Peer$metadataEntry.codec().decode(t,t.uint32());s.metadata.set(r.key,r.value);break}case 7:{if(null!=n.limits?.tags&&s.tags.size===n.limits.tags)throw new Ar('Decode error - map field "tags" had too many elements');const r=e.Peer$tagsEntry.codec().decode(t,t.uint32(),{limits:{value:n.limits?.tags$value}});s.tags.set(r.key,r.value);break}case 8:s.updated=t.uint64Number();break;default:t.skipType(7&r)}}return s}))),n),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Zf||(Zf={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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)),null!=e.observed&&(t.uint32(24),t.uint64Number(e.observed)),!1!==r.lengthDelimited&&t.ldelim()}),((e,t,r={})=>{const n={multiaddr:f(0)},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.multiaddr=e.bytes();break;case 2:n.isCertified=e.bool();break;case 3:n.observed=e.uint64Number();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(Yf||(Yf={})),function(e){let t;e.codec=()=>(null==t&&(t=Er(((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,r={})=>{const n={value:0},s=null==t?e.len:e.pos+t;for(;e.pos>>3){case 1:n.value=e.uint32();break;case 2:n.expiry=e.uint64();break;default:e.skipType(7&t)}}return n}))),t),e.encode=t=>$t(t,e.codec()),e.decode=(t,r)=>K(t,e.codec(),r)}(eg||(eg={}));const ag="/",cg=(new TextEncoder).encode(ag),lg=cg[0];class ug{_buf;constructor(e,t){if("string"==typeof e)this._buf=xt(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]!==lg)throw new Error("Invalid key")}toString(e="utf8"){return en(this._buf,e)}uint8Array(){return this._buf}get[Symbol.toStringTag](){return`Key(${this.toString()})`}static withNamespaces(e){return new ug(e.join(ag))}static random(){return new ug(Math.random().toString().substring(2))}static asKey(e){return e instanceof Uint8Array||"string"==typeof e?new ug(e):"function"==typeof e.uint8Array?new ug(e.uint8Array()):null}clean(){if(null!=this._buf&&0!==this._buf.byteLength||(this._buf=cg),this._buf[0]!==lg){const e=new Uint8Array(this._buf.byteLength+1);e.fill(lg,0,1),e.set(this._buf,1),this._buf=e}for(;this._buf.byteLength>1&&this._buf[this._buf.byteLength-1]===lg;)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 hg="/peers/";function dg(e){if(!Os(e)||null==e.type)throw new ho("Invalid PeerId");const t=e.toCID().toString();return new ug(`${hg}${t}`)}async function pg(e,t,r,n){const s=new Map;for(const n of r){if(null==n)continue;if(n.multiaddr instanceof Uint8Array&&(n.multiaddr=vi(n.multiaddr)),!wi(n.multiaddr))throw new ho("Multiaddr was invalid");if(!await t(e,n.multiaddr))continue;const r=n.isCertified??!1,i=n.multiaddr.toString(),o=s.get(i);null!=o?n.isCertified=o.isCertified||r:s.set(i,{multiaddr:n.multiaddr,isCertified:r})}return[...s.values()].sort(((e,t)=>e.multiaddr.toString().localeCompare(t.multiaddr.toString()))).map((({isCertified:e,multiaddr:t})=>({isCertified:e,multiaddr:t.bytes})))}async function fg(e,t,r,n){if(null==t)throw new ho("Invalid PeerData");if(null!=t.publicKey&&null!=e.publicKey&&!t.publicKey.equals(e.publicKey))throw new ho("publicKey bytes do not match peer id publicKey bytes");const s=n.existingPeer?.peer;if(null!=s&&!e.equals(s.id))throw new ho("peer id did not match existing peer id");let i,o=s?.addresses??[],a=new Set(s?.protocols??[]),c=s?.metadata??new Map,l=s?.tags??new Map,u=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&&(a=new Set(t.protocols)),null!=t.metadata&&(c=gg(t.metadata instanceof Map?[...t.metadata.entries()]:Object.entries(t.metadata),{validate:mg})),null!=t.tags&&(l=gg(t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),{validate:yg,map:bg})),null!=t.peerRecordEnvelope&&(u=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&&(a=new Set([...a,...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?c.delete(t):c.set(t,r);c=gg([...c.entries()],{validate:mg})}if(null!=t.tags){const e=t.tags instanceof Map?[...t.tags.entries()]:Object.entries(t.tags),r=new Map(l);for(const[t,n]of e)null==n?r.delete(t):r.set(t,n);l=gg([...r.entries()],{validate:yg,map:bg})}null!=t.peerRecordEnvelope&&(u=t.peerRecordEnvelope)}null!=s?.id.publicKey?i=kl(s.id.publicKey):null!=t.publicKey?i=kl(t.publicKey):null!=e.publicKey&&(i=kl(e.publicKey));const h={addresses:await pg(e,n.addressFilter??(async()=>!0),o,n.existingPeer?.peerPB.addresses),protocols:[...a.values()].sort(((e,t)=>e.localeCompare(t))),metadata:c,tags:l,publicKey:i,peerRecordEnvelope:u};return h.addresses.forEach((e=>{e.observed=n.existingPeer?.peerPB.addresses?.find((e=>_n(e.multiaddr,e.multiaddr)))?.observed??Date.now()})),"RSA"!==e.type&&delete h.publicKey,h}function gg(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 mg(e,t){if("string"!=typeof e)throw new ho("Metadata key must be a string");if(!(t instanceof Uint8Array))throw new ho("Metadata value must be a Uint8Array")}function yg(e,t){if("string"!=typeof e)throw new ho("Tag name must be a string");if(null!=t.value){if(parseInt(`${t.value}`,10)!==t.value)throw new ho("Tag value must be an integer");if(t.value<0||t.value>100)throw new ho("Tag value must be between 0-100")}if(null!=t.ttl){if(parseInt(`${t.ttl}`,10)!==t.ttl)throw new ho("Tag ttl must be an integer");if(t.ttl<0)throw new ho("Tag ttl must be between greater than 0")}}function bg(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 wg(e){const t=e.toString().split("/")[2];return Fl(mt.parse(t,ue))}function vg(e,t,r){return rg(wg(e),t,r)}class Eg{peerId;datastore;lock;addressFilter;log;maxAddressAge;maxPeerAge;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:peer-store"),this.peerId=e.peerId,this.datastore=e.datastore,this.addressFilter=t.addressFilter,this.lock=function(e){const t=Object.assign({},Qf,e);return null==Xf&&(Xf=(e=>{if(e=Object.assign({},Gf,e),Boolean(globalThis.document)||e.singleProcess){const e=new EventTarget;return Bf.addEventListener("message",Kf(e,"requestReadLock",Uf,$f,qf)),Bf.addEventListener("message",Kf(e,"requestWriteLock",jf,zf,Hf)),e}return{isWorker:!0,readLock:e=>Vf(e,Uf,qf,$f),writeLock:e=>Vf(e,jf,Hf,zf)}})(t),!0!==Xf.isWorker&&(Xf.addEventListener("requestReadLock",(e=>{null!=Wf[e.data.name]&&Wf[e.data.name].readLock().then((async t=>e.data.handler().finally((()=>{t()}))))})),Xf.addEventListener("requestWriteLock",(async e=>{null!=Wf[e.data.name]&&Wf[e.data.name].writeLock().then((async t=>e.data.handler().finally((()=>{t()}))))})))),null==Wf[t.name]&&(Wf[t.name]=((e,t)=>{if(!0===Xf.isWorker)return{readLock:Xf.readLock(e,t),writeLock:Xf.writeLock(e,t)};const r=new nf({concurrency:1});let n;return{async readLock(){if(null!=n)return Jf(n,t);n=new nf({concurrency:t.concurrency,autoStart:!1});const e=n,s=Jf(n,t);return r.add((async()=>{e.start(),await e.onIdle().then((()=>{n===e&&(n=null)}))})),s},writeLock:async()=>(n=null,Jf(r,t))}})(t.name,t)),Wf[t.name]}({name:"peer-store",singleProcess:!0}),this.maxAddressAge=t.maxAddressAge??36e5,this.maxPeerAge=t.maxPeerAge??216e5}async has(e){try{return await this.load(e),!0}catch(e){if("NotFoundError"!==e.name)throw e}return!1}async delete(e){this.peerId.equals(e)||await this.datastore.delete(dg(e))}async load(e){const t=dg(e),r=await this.datastore.get(t),n=Zf.decode(r);if(this.#L(e,n))throw await this.datastore.delete(t),new Eo;return ng(e,n,this.peerId.equals(e)?1/0:this.maxAddressAge)}async save(e,t){const r=await this.#R(e),n=await fg(e,t,"patch",{addressFilter:this.addressFilter});return this.#N(e,n,r)}async patch(e,t){const r=await this.#R(e),n=await fg(e,t,"patch",{addressFilter:this.addressFilter,existingPeer:r});return this.#N(e,n,r)}async merge(e,t){const r=await this.#R(e),n=await fg(e,t,"merge",{addressFilter:this.addressFilter,existingPeer:r});return this.#N(e,n,r)}async*all(e){for await(const{key:t,value:r}of this.datastore.query(function(e,t){return{prefix:hg,filters:(e.filters??[]).map((e=>({key:r,value:n})=>e(vg(r,n,t)))),orders:(e.orders??[]).map((e=>(r,n)=>e(vg(r.key,r.value,t),vg(n.key,n.value,t))))}}(e??{},this.maxAddressAge))){const e=wg(t);if(e.equals(this.peerId))continue;const n=Zf.decode(r);this.#L(e,n)?await this.datastore.delete(t):yield ng(e,n,this.peerId.equals(e)?1/0:this.maxAddressAge)}}async#R(e){try{const t=dg(e),r=await this.datastore.get(t),n=Zf.decode(r);if(this.#L(e,n))throw await this.datastore.delete(t),new Eo;return{peerPB:n,peer:rg(e,r,this.maxAddressAge)}}catch(e){"NotFoundError"!==e.name&&this.log.error("invalid peer data found in peer store - %e",e)}}async#N(e,t,r){t.updated=Date.now();const n=Zf.encode(t);return await this.datastore.put(dg(e),n),{peer:rg(e,n,this.maxAddressAge),previous:r?.peer,updated:null==r||(o=t,a=r.peerPB,!(ig(o.addresses,a.addresses,((e,t)=>e.isCertified===t.isCertified&&!!_n(e.multiaddr,t.multiaddr)))&&ig(o.protocols,a.protocols,((e,t)=>e===t))&&sg(o.publicKey,a.publicKey)&&sg(o.peerRecordEnvelope,a.peerRecordEnvelope)&&og(o.metadata,a.metadata,((e,t)=>_n(e,t)))&&(s=o.tags,i=a.tags,og(s,i,((e,t)=>e.value===t.value&&e.expiry===t.expiry)))))};var s,i,o,a}#L(e,t){if(null==t.updated)return!0;if(this.peerId.equals(e))return!1;const r=t.updatednull!=e.observed&&e.observed>n));return r&&0===s.length}}class Sg{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 Eg(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 xn(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.#O(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.#O(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.#O(e,r),r.peer}finally{this.log.trace("merge release write lock"),r()}}async consumePeerRecord(e,t){const r=await Kh.openAndCertify(e,zh.DOMAIN),n=Fl(r.publicKey.toCID());if(!1===t?.equals(n))return this.log("envelope peer id was not the expected peer id - expected: %p received: %p",t,n),!1;const s=zh.createFromProtobuf(r.payload);let i;try{i=await this.get(n)}catch(e){if("NotFoundError"!==e.name)throw e}if(null!=i?.peerRecordEnvelope){const e=await Kh.createFromProtobuf(i.peerRecordEnvelope),t=zh.createFromProtobuf(e.payload);if(t.seqNumber>=s.seqNumber)return this.log("sequence number was lower or equal to existing sequence number - stored: %d received: %d",t.seqNumber,s.seqNumber),!1}return await this.patch(s.peerId,{peerRecordEnvelope:e,addresses:s.multiaddrs.map((e=>({isCertified:!0,multiaddr:e})))}),!0}#O(e,t){t.updated&&(this.peerId.equals(e)?this.events.safeDispatchEvent("self:peer:update",{detail:t}):this.events.safeDispatchEvent("peer:update",{detail:t}))}}Error,Error,Error,Error,Error,Error;class Ag extends Error{static name="NotFoundError";static code="ERR_NOT_FOUND";name=Ag.name;code=Ag.code;constructor(e="Not Found"){super(e)}}Error;const Ig=function(e){if(null!=e[Symbol.asyncIterator])return(async()=>{for await(const t of e);})();for(const t of e);},kg=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:i}=n.next();if(!0===i)return function*(){}();const o=t(s,r++);if("function"==typeof o.then)return async function*(){await o&&(yield s);for await(const e of n)await t(e,r++)&&(yield e)}();const a=t;return function*(){!0===o&&(yield s);for(const e of n)a(e,r++)&&(yield e)}()},xg=function(e,t){return null!=e[Symbol.asyncIterator]?async function*(){const r=await xn(e);yield*r.sort(t)}():function*(){const r=xn(e);yield*r.sort(t)}()},Cg=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 _g{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 Ig(this.putMany(e,r)),e=[],await Ig(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=kg(r,(e=>e.key.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>kg(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>xg(e,t)),r)),null!=e.offset){let t=0;const n=e.offset;r=kg(r,(()=>t++>=n))}return null!=e.limit&&(r=Cg(r,e.limit)),r}queryKeys(e,t){let r=this._allKeys(e,t);if(null!=e.prefix){const t=e.prefix;r=kg(r,(e=>e.toString().startsWith(t)))}if(Array.isArray(e.filters)&&(r=e.filters.reduce(((e,t)=>kg(e,t)),r)),Array.isArray(e.orders)&&(r=e.orders.reduce(((e,t)=>xg(e,t)),r)),null!=e.offset){const t=e.offset;let n=0;r=kg(r,(()=>n++>=t))}return null!=e.limit&&(r=Cg(r,e.limit)),r}}class Tg extends _g{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 new Ag;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 ug(e),value:t}}*_allKeys(){for(const e of this.data.keys())yield new ug(e)}}const Pg=e=>e;function Lg(e,t){const r=e.getPeerId();return null!=r&&Ol(r).equals(t)&&(e=e.decapsulate(vi(`/p2p/${t.toString()}`))),e}class Rg{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??Pg,this._updatePeerStoreAddresses=function(e){let t;return function(){clearTimeout(t),t=setTimeout((function(){t=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])=>vi(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=>vi(e)))}getAnnounceAddrs(){return Array.from(this.announce).map((e=>vi(e)))}getObservedAddrs(){return Array.from(this.observed).map((([e])=>vi(e)))}addObservedAddr(e){const t=(e=Lg(e,this.components.peerId)).toString();this.observed.has(t)||this.observed.set(t,{confident:!1})}confirmObservedAddr(e){const t=(e=Lg(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=Lg(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=>vi(e)))).map((e=>!0===e.protos().pop()?.path||e.getPeerId()===this.components.peerId.toString()?e:e.encapsulate(`/p2p/${this.components.peerId.toString()}`)))}}function Ng(e){return null!=e&&"function"==typeof e.start&&"function"==typeof e.stop}var Og;!function(e){e.NOT_STARTED_YET="The libp2p node is not started yet",e.NOT_FOUND="Not found"}(Og||(Og={}));class Dg extends Error{constructor(e="Missing service"){super(e),this.name="MissingServiceError"}}class Mg extends Error{constructor(e="Unmet service dependencies"){super(e),this.name="UnmetServiceDependenciesError"}}class Fg extends Error{constructor(e="No content routers available"){super(e),this.name="NoContentRoutersError"}}class Bg extends Error{constructor(e="No peer routers available"){super(e),this.name="NoPeerRoutersError"}}class Ug extends Error{constructor(e="Should not try to find self"){super(e),this.name="QueriedForSelfError"}}class $g extends Error{constructor(e="Unhandled protocol error"){super(e),this.name="UnhandledProtocolError"}}class qg extends Error{constructor(e="Duplicate protocol handler error"){super(e),this.name="DuplicateProtocolHandlerError"}}class jg extends Error{constructor(e="Dial denied error"){super(e),this.name="DialDeniedError"}}class zg extends Error{constructor(e="No valid addresses"){super(e),this.name="NoValidAddressesError"}}class Hg extends Error{constructor(e="Connection intercepted"){super(e),this.name="ConnectionInterceptedError"}}class Kg extends Error{constructor(e="Connection denied"){super(e),this.name="ConnectionDeniedError"}}class Vg extends Error{constructor(e="Stream is not multiplexed"){super(e),this.name="MuxerUnavailableError"}}class Gg extends Error{constructor(e="Encryption failed"){super(e),this.name="EncryptionFailedError"}}class Wg extends Error{constructor(e="Transport unavailable"){super(e),this.name="TransportUnavailableError"}}class Xg{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=Lf())}isStarted(){return this._started}async _invokeStartableMethod(e){await Promise.all(Object.values(this.components).filter((e=>Ng(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 Jg=["metrics","connectionProtector","dns"],Qg=["components","isStarted","beforeStart","start","afterStart","beforeStop","stop","afterStop","then","_invokeStartableMethod"];function Zg(e){return Array.isArray(e?.[xl])?e[xl]:[]}function Yg(e){return Array.isArray(e?.[Cl])?e[Cl]:[]}function em(e){return e?.[Symbol.toStringTag]??e?.toString()??"unknown"}function tm(e={}){return{denyDialPeer:async()=>!1,denyDialMultiaddr:async e=>{const t=e.stringTuples();return(4===t[0][0]||41===t[0][0])&&Boolean(Jh(`${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}}class rm{map;constructor(e){if(this.map=new Map,null!=e)for(const[t,r]of e.entries())this.map.set(t.toString(),{key:t,value:r})}[Symbol.iterator](){return this.entries()}clear(){this.map.clear()}delete(e){return this.map.delete(e.toString())}entries(){return Nf(this.map.entries(),(e=>[e[1].key,e[1].value]))}forEach(e){this.map.forEach(((t,r)=>{e(t.value,t.key,this)}))}get(e){return this.map.get(e.toString())?.value}has(e){return this.map.has(e.toString())}set(e,t){this.map.set(e.toString(),{key:e,value:t})}keys(){return Nf(this.map.values(),(e=>e.key))}values(){return Nf(this.map.values(),(e=>e.value))}get size(){return this.map.size}}function nm(e){if(Os(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:Ol(r),e.forEach((e=>{if(!wi(e))throw new Ao("Invalid multiaddr");const r=e.getPeerId();if(null==r){if(null!=t)throw new ho("Multiaddrs must all have the same peer id or have no peer id")}else{const e=Ol(r);if(!0!==t?.equals(e))throw new ho("Multiaddrs must all have the same peer id or have no peer id")}}))}return{peerId:t,multiaddrs:e}}const sm=["/ipfs/id/1.0.0","/ipfs/id/push/1.0.0","/libp2p/autonat/1.0.0","/libp2p/dcutr"],im={maxConnections:100,allow:[]};class om{maxConnections;connectionManager;peerStore;allow;events;log;constructor(e,t={}){this.maxConnections=t.maxConnections??im.maxConnections,this.allow=t.allow??im.allow,this.connectionManager=e.connectionManager,this.peerStore=e.peerStore,this.events=e.events,this.log=e.logger.forComponent("libp2p:connection-manager:connection-pruner"),this.maybePruneConnections=this.maybePruneConnections.bind(this)}start(){this.events.addEventListener("connection:open",this.maybePruneConnections)}stop(){this.events.removeEventListener("connection:open",this.maybePruneConnections)}maybePruneConnections(){this._maybePruneConnections().catch((e=>{this.log.error("error while pruning connections %e",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 rm;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){"NotFoundError"!==e.name&&this.log.error("error loading peer tags",e)}}}const n=this.sortConnections(e,r),s=Math.max(t-this.maxConnections,0),i=[];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())))||i.push(e),i.length===s)break;await Promise.all(i.map((async e=>{await async function(e,t){const r=e?.streams?.map((e=>e.protocol))??[],n=t?.closableProtocols??sm;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:i})}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:n{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 o(e)}a(),i(e)},l=e=>{a(),o(e.detail)},u=()=>{a(),o(s)};r?.addEventListener("abort",u),e.addEventListener(t,c),null!=n?.errorEvent&&e.addEventListener(n.errorEvent,l)}))}class hm{deferred;signal;constructor(e){this.signal=e,this.deferred=zn(),this.onAbort=this.onAbort.bind(this),this.signal?.addEventListener("abort",this.onAbort)}onAbort(){this.deferred.reject(this.signal?.reason??new lo)}cleanup(){this.signal?.removeEventListener("abort",this.onAbort)}}class dm{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 lo),this.cleanup())}async join(e={}){const t=new hm(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 Xn(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 pm extends Rs{concurrency;maxSize;queue;pending;sort;constructor(e={}){super(),this.concurrency=e.concurrency??Number.POSITIVE_INFINITY,this.maxSize=e.maxSize??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 lo)})),this.clear()}async onEmpty(e){0!==this.size&&await um(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)},i=()=>{r()},o=()=>{r(new lo("Queue aborted"))};this.addEventListener("completed",n),this.addEventListener("error",s),this.addEventListener("idle",i),e?.signal?.addEventListener("abort",o);try{yield*t}finally{this.removeEventListener("completed",n),this.removeEventListener("error",s),this.removeEventListener("idle",i),e?.signal?.removeEventListener("abort",o),r()}}}class fm extends pm{constructor(e={}){super({...e,sort:(e,t)=>e.options.priority>t.options.priority?-1:e.options.priority{e.detail.name!==lo.name&&this.log.error("error in dial queue - %e",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}=nm(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("open"===s?.status)return this.log("already connected to %a",s.remoteAddr),t.onProgress?.(new Kp("dial-queue:already-connected")),s;const i=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!=i){this.log("joining existing dial target for %p",r);for(const e of n)i.options.multiaddrs.add(e.toString());return t.onProgress?.(new Kp("dial-queue:already-in-dial-queue")),i.join(t)}if(this.queue.size>=this.maxDialQueueLength)throw new Lo("Dial queue is full");return this.log("creating dial target for %p",r,n.map((e=>e.toString()))),t.onProgress?.(new Kp("dial-queue:add-to-dial-queue")),this.queue.add((async e=>{e?.onProgress?.(new Kp("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 Kp("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 i=[];for(const o of n){if(s===this.maxPeerAddrsToDial)throw this.log("dialed maxPeerAddrsToDial (%d) addresses for %p, not trying any others",s,r),new Lo("Peer had more than maxPeerAddrsToDial");s++;try{const n=await this.components.transportManager.dial(o.multiaddr,{...e,signal:t});this.log("dial to %a succeeded",o.multiaddr);try{await this.components.peerStore.merge(n.remotePeer,{multiaddrs:[n.remoteAddr],metadata:{[cm]:xt(Date.now().toString())}})}catch(e){this.log.error("could not update last dial failure key for %p",r,e)}return n}catch(e){if(this.log.error("dial failed to %a",o.multiaddr,e),null!=r)try{await this.components.peerStore.merge(r,{metadata:{[am]:xt(Date.now().toString())}})}catch(e){this.log.error("could not update last dial failure key for %p",r,e)}if(t.aborted)throw new To(e.message);i.push(e)}}if(1===i.length)throw i[0];throw new AggregateError(i,"All multiaddr dials failed")}finally{t.clear()}}),{peerId:r,priority:t.priority??Pm,multiaddrs:new Set(n.map((e=>e.toString()))),signal:t.signal,onProgress:t.onProgress})}createDialAbortController(e){return gm([AbortSignal.timeout(this.dialTimeout),this.shutDownController.signal,e])}async calculateMultiaddrs(e,t=new Set,r={}){const n=[...t].map((e=>({multiaddr:vi(e),isCertified:!1})));if(null!=e){if(this.components.peerId.equals(e))throw new Lo("Tried to dial self");if(!0===await(this.components.connectionGater.denyDialPeer?.(e)))throw new jg("The dial request is blocked by gater.allowDialPeer");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("NotFoundError"!==e.name)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){"NoPeerRoutersError"!==t.name&&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 bi.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 i=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)})),o=new Map;for(const e of i){const t=e.multiaddr.toString(),r=o.get(t);null==r?o.set(t,e):r.isCertified=r.isCertified||e.isCertified||!1}const a=[...o.values()];if(0===a.length)throw new zg("The dial request has 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=null==this.addressSorter?c.sort(mm).sort(bm).sort(wm).sort(ym):c.sort(this.addressSorter);if(0===l.length)throw new jg("The connection gater denied all addresses in the dial request");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.runOnLimitedConnection||null!=r.find((e=>!Nd.matches(e.multiaddr)))}catch(e){this.log.trace("error calculating if multiaddr(s) were dialable",e)}return!1}}const Em="keep-alive";class Sm extends pm{has(e){return null!=this.find(e)}find(e){return this.queue.find((t=>e.equals(t.options.peerId)))}}var Am=__webpack_require__(5617);const Im=Object.prototype.toString,km=new Set(["network error","Failed to fetch","NetworkError when attempting to fetch resource.","The Internet connection appears to be offline.","Load failed","Network request failed","fetch failed","terminated"]);class xm extends Error{constructor(e){super(),e instanceof Error?(this.originalError=e,({message:e}=e)):(this.originalError=new Error(e),this.originalError.stack=this.stack),this.name="AbortError",this.message=e}}const Cm=(e,t,r)=>{const n=r.retries-(t-1);return e.attemptNumber=t,e.retriesLeft=n,e};class _m{log;queue;started;peerStore;retries;retryInterval;backoffFactor;connectionManager;events;constructor(e,t={}){this.log=e.logger.forComponent("libp2p:reconnect-queue"),this.peerStore=e.peerStore,this.connectionManager=e.connectionManager,this.queue=new Sm({concurrency:t.maxParallelReconnects??5,metricName:"libp2p_reconnect_queue",metrics:e.metrics}),this.started=!1,this.retries=t.retries??5,this.backoffFactor=t.backoffFactor,this.retryInterval=t.retryInterval,this.events=e.events,e.events.addEventListener("peer:disconnect",(e=>{this.maybeReconnect(e.detail).catch((t=>{this.log.error("failed to maybe reconnect to %p - %e",e.detail,t)}))}))}async maybeReconnect(e){if(!this.started)return;const t=await this.peerStore.get(e);Tm(t)&&(this.queue.has(e)||this.queue.add((async t=>{await async function(e,t){return new Promise(((r,n)=>{t={...t},t.onFailedAttempt??=()=>{},t.shouldRetry??=()=>!0,t.retries??=10;const s=Am.operation(t),i=()=>{s.stop(),n(t.signal?.reason)};t.signal&&!t.signal.aborted&&t.signal.addEventListener("abort",i,{once:!0});const o=()=>{t.signal?.removeEventListener("abort",i),s.stop()};s.attempt((async i=>{try{const t=await e(i);o(),r(t)}catch(e){try{if(!(e instanceof Error))throw new TypeError(`Non-error was thrown: "${e}". You should only throw errors.`);if(e instanceof xm)throw e.originalError;if(e instanceof TypeError&&!function(e){var t;return!(!e||(t=e,"[object Error]"!==Im.call(t))||"TypeError"!==e.name||"string"!=typeof e.message)&&("Load failed"===e.message?void 0===e.stack:km.has(e.message))}(e))throw e;if(Cm(e,i,t),await t.shouldRetry(e)||(s.stop(),n(e)),await t.onFailedAttempt(e),!s.retry(e))throw s.mainError()}catch(e){Cm(e,i,t),o(),n(e)}}}))}))}((async r=>{if(this.started)try{await this.connectionManager.openConnection(e,{signal:t?.signal})}catch(t){throw this.log("reconnecting to %p attempt %d of %d failed - %e",e,r,this.retries,t),t}}),{signal:t?.signal,retries:this.retries,factor:this.backoffFactor,minTimeout:this.retryInterval})}),{peerId:e}).catch((async r=>{this.log.error("failed to reconnect to %p - %e",e,r);const n={};[...t.tags.keys()].forEach((e=>{e.startsWith(Em)&&(n[e]=void 0)})),await this.peerStore.merge(e,{tags:n}),this.events.safeDispatchEvent("peer:reconnect-failure",{detail:e})})).catch((async t=>{this.log.error("failed to remove keep-alive tag from %p - %e",e,t)})))}start(){this.started=!0}async afterStart(){Promise.resolve().then((async()=>{const e=await this.peerStore.all({filters:[e=>Tm(e)]});await Promise.all(e.map((async e=>{await this.connectionManager.openConnection(e.id).catch((e=>{this.log.error(e)}))})))})).catch((e=>{this.log.error(e)}))}stop(){this.started=!1,this.queue.abort()}}function Tm(e){for(const t of e.tags.keys())if(t.startsWith(Em))return!0;return!1}const Pm=50;class Lm{started;connections;allow;deny;maxIncomingPendingConnections;incomingPendingConnections;outboundPendingConnections;maxConnections;dialQueue;reconnectQueue;connectionPruner;inboundConnectionRateLimiter;peerStore;metrics;events;log;peerId;constructor(e,t={}){if(this.maxConnections=t.maxConnections??100,this.maxConnections<1)throw new ho("Connection Manager maxConnections must be greater than 0");this.connections=new rm,this.started=!1,this.peerId=e.peerId,this.peerStore=e.peerStore,this.metrics=e.metrics,this.events=e.events,this.log=e.logger.forComponent("libp2p:connection-manager"),this.onConnect=this.onConnect.bind(this),this.onDisconnect=this.onDisconnect.bind(this),this.allow=(t.allow??[]).map((e=>vi(e))),this.deny=(t.deny??[]).map((e=>vi(e))),this.incomingPendingConnections=0,this.maxIncomingPendingConnections=t.maxIncomingPendingConnections??10,this.outboundPendingConnections=0,this.inboundConnectionRateLimiter=new ip({points:t.inboundConnectionThreshold??5,duration:1}),this.connectionPruner=new om({connectionManager:this,peerStore:e.peerStore,events:e.events,logger:e.logger},{maxConnections:this.maxConnections,allow:this.allow}),this.dialQueue=new vm(e,{addressSorter:t.addressSorter,maxParallelDials:t.maxParallelDials??50,maxDialQueueLength:t.maxDialQueueLength??500,maxPeerAddrsToDial:t.maxPeerAddrsToDial??25,dialTimeout:t.dialTimeout??5e3,resolvers:t.resolvers??{dnsaddr:ff},connections:this.connections}),this.reconnectQueue=new _m({events:e.events,peerStore:e.peerStore,logger:e.logger,connectionManager:this},{retries:t.reconnectRetries,retryInterval:t.reconnectRetryInterval,backoffFactor:t.reconnectBackoffFactor,maxParallelReconnects:t.maxParallelReconnects})}[Symbol.toStringTag]="@libp2p/connection-manager";async start(){this.metrics?.registerMetricGroup("libp2p_connection_manager_connections",{calculate:()=>{const e={inbound:0,"inbound pending":this.incomingPendingConnections,outbound:0,"outbound pending":this.outboundPendingConnections};for(const t of this.connections.values())for(const r of t)e[r.direction]++;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.events.addEventListener("connection:open",this.onConnect),this.events.addEventListener("connection:close",this.onDisconnect),await async function(...e){const t=[];for(const r of e)Ng(r)&&t.push(r);await Promise.all(t.map((async e=>{null!=e.beforeStart&&await e.beforeStart()}))),await Promise.all(t.map((async e=>{await e.start()}))),await Promise.all(t.map((async e=>{null!=e.afterStart&&await e.afterStart()})))}(this.dialQueue,this.reconnectQueue,this.connectionPruner),this.started=!0,this.log("started")}async stop(){this.events.removeEventListener("connection:open",this.onConnect),this.events.removeEventListener("connection:close",this.onDisconnect),await async function(...e){const t=[];for(const r of e)Ng(r)&&t.push(r);await Promise.all(t.map((async e=>{null!=e.beforeStop&&await e.beforeStop()}))),await Promise.all(t.map((async e=>{await e.stop()}))),await Promise.all(t.map((async e=>{null!=e.afterStop&&await e.afterStop()})))}(this.reconnectQueue,this.dialQueue,this.connectionPruner);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();if("open"!==t.status)return;const r=t.remotePeer,n=!this.connections.has(r),s=this.connections.get(r)??[];s.push(t),this.connections.set(r,s),null!=r.publicKey&&"RSA"===r.type&&await this.peerStore.patch(r,{publicKey:r.publicKey}),n&&this.events.safeDispatchEvent("peer:connect",{detail:t.remotePeer})}onDisconnect(e){const{detail:t}=e,r=t.remotePeer,n=(this.connections.get(r)??[]).filter((e=>e.id!==t.id));this.connections.set(r,n),0===n.length&&(this.log("onDisconnect remove all connections for peer %p",r),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.started)throw new Po("Not started");this.outboundPendingConnections++;try{t.signal?.throwIfAborted();const{peerId:r}=nm(e);if(this.peerId.equals(r))throw new So("Can not dial self");if(null!=r&&!0!==t.force){this.log("dial %p",r);const e=this.getConnections(r).find((e=>null==e.limits));if(null!=e)return this.log("had an existing non-limited connection to %p",r),t.onProgress?.(new Kp("dial-queue:already-connected")),e}const n=await this.dialQueue.dial(e,{...t,priority:t.priority??Pm});if("open"!==n.status)throw new mo("Remote closed connection during opening");let s=this.connections.get(n.remotePeer);null==s&&(s=[],this.connections.set(n.remotePeer,s));let i=!1;for(const e of s)if(e.id===n.id&&(i=!0),!0!==t.force&&e.id!==n.id&&e.remoteAddr.equals(n.remoteAddr))return n.abort(new Ao("Duplicate multiaddr connection")),e;return i||s.push(n),n}finally{this.outboundPendingConnections--}}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=>vi(e)))})))}async isDialable(e,t={}){return this.dialQueue.isDialable(e,t)}}class Rm{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 Nm{success;failure;next;metric;timeoutMultiplier;failureMultiplier;minTimeout;constructor(e={}){this.success=new Rm(e.interval??5e3),this.failure=new Rm(e.interval??5e3),this.next=new Rm(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=gm([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 Om{protocol;components;log;heartbeatInterval;pingIntervalMs;abortController;timeout;abortConnectionOnPingFailure;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.abortConnectionOnPingFailure=t.abortConnectionOnPingFailure??!0,this.timeout=new Nm({...t.pingTimeout??{},metrics:e.metrics,metricName:"libp2p_connection_monitor_ping_time_milliseconds"})}[Symbol.toStringTag]="@libp2p/connection-monitor";[xl]=["@libp2p/connection-monitor"];start(){this.abortController=new AbortController,this.abortController.signal,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=Jl(await e.newStream(this.protocol,{signal:r,runOnLimitedConnection:!0}));t=Date.now(),await Promise.all([n.write(xp(32),{signal:r}),n.read(32,{signal:r})]),e.rtt=Date.now()-t,await n.unwrap().close({signal:r})}catch(r){if("UnsupportedProtocolError"!==r.name)throw r;e.rtt=(Date.now()-t)/2}})).catch((t=>{this.log.error("error during heartbeat",t),this.abortConnectionOnPingFailure?(this.log.error("aborting connection due to ping failure"),e.abort(t)):this.log("connection ping failed, but not aborting due to abortConnectionOnPingFailure flag")}))}))}),this.pingIntervalMs)}stop(){this.abortController?.abort(),null!=this.heartbeatInterval&&clearInterval(this.heartbeatInterval)}}class Dm{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 Fg("No content routers available");const r=this,n=new Df;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 Fg("No content 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 Po;await Promise.all(this.routers.map((async n=>{await n.put(e,t,r)})))}async get(e,t){if(!this.isStarted())throw new Po;return Promise.any(this.routers.map((async r=>r.get(e,t))))}}class Mm{fp;h;seed;constructor(e,t,r,n=2){if(n>64)throw new TypeError("Invalid Fingerprint Size");const s=t.hashV(e,r),i=f(n);for(let e=0;ee.equals(t)))}add(e){if(!(e instanceof Mm))throw new TypeError("Invalid Fingerprint");for(let t=0;te.equals(t)));return t>-1&&(this.contents[t]=null,!0)}}const Um={32:16777619n,64:1099511628211n,128:309485009821345068724781371n,256:374144419156711147060143317175368453031918731002211n,512:35835915874844867368919076489095108449946327955754392558399825615420669938882575126094039892345713852759n,1024:5016456510113118655434598811035278955030765345404790744303017523831112055108147451509157692220295382716162651878526895249385292291816524375083746691371804094271873160484737966720260389217684476157468082573n},$m={32:2166136261n,64:14695981039346656037n,128:144066263297769815596495629667062367629n,256:100029257958052580907070968620625704837092796014241193945225284501741471925557n,512:9659303129496669498009435400716310466090418745672637896108374329434462657994582932197716438449813051892206539805784495328239340083876191928701583869517785n,1024:14197795064947621068722070641403218320880622795441933960878474914617582723252296732303717722150864096521202355549365628174669108571814760471015076148029755969804077320157692458563003215304957150157403644460363550505412711285966361610267868082893823963790439336411086884584107735010676915n},qm=new globalThis.TextEncoder;const jm={hash:e=>Number(function(e,{size:t=32,utf8Buffer:r}={}){if(!Um[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=Um[t];let s=$m[t],i=e;for(;i.length>0;){const e=qm.encodeInto(i,r);i=i.slice(e.read);for(let i=0;ifunction(e){let t=e.toString(16);return t.length%2==1&&(t=`0${t}`),xt(t,"base16")}(jm.hash(e,t))};class zm{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??jm,this.seed=e.seed??Fm(0,Math.pow(2,10))}add(e){"string"==typeof e&&(e=xt(e));const t=new Mm(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 Bm(this.bucketSize)),null==this.buckets[n]&&(this.buckets[n]=new Bm(this.bucketSize)),this.buckets[r].add(t)||this.buckets[n].add(t))return this.count++,!0;const s=[r,n];let i=s[Fm(0,s.length-1)];null==this.buckets[i]&&(this.buckets[i]=new Bm(this.bucketSize));for(let e=0;e<500;e++){const e=this.buckets[i].swap(t);if(null!=e&&(i=(i^e.hash())%this.filterSize,null==this.buckets[i]&&(this.buckets[i]=new Bm(this.bucketSize)),this.buckets[i].add(e)))return this.count++,!0}return!1}has(e){"string"==typeof e&&(e=xt(e));const t=new Mm(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=xt(e));const t=new Mm(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,i=this.buckets[s]?.remove(t)??!1;return i&&this.count--,i}get reliable(){return Math.floor(this.count/this.filterSize*100)<=90}}const Hm={1:.5,2:.84,4:.95,8:.98};function Km(e,t=.001){const r=function(e=.001){return e>.002?2:e>1e-5?4:8}(t),n=Hm[r];return{filterSize:Math.round(e/n),bucketSize:r,fingerprintSize:Math.min(Math.ceil(Math.log2(1/t)+Math.log2(2*r)),64)}}class Vm{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??jm,this.seed=e.seed??Fm(0,Math.pow(2,10)),this.filterSeries=[new zm({filterSize:this.filterSize,bucketSize:this.bucketSize,fingerprintSize:this.fingerprintSize,hash:this.hash,seed:this.seed})]}add(e){if("string"==typeof e&&(e=xt(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 zm({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=xt(e));for(let t=0;te+t.count),0)}}const Gm=globalThis.CustomEvent??Event;class Wm{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 Bg("No peer routers available");if(e.toString()===this.peerId.toString())throw new Ug("Should not try to 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}async*getClosestPeers(e,t={}){if(0===this.routers.length)throw new Bg("No peer routers available");const r=this,n=function(e,t=.001,r){return new Vm({...Km(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=t.ordered??!1,s=new EventTarget,i=[];let o,a=zn(),c=zn(),l=!1,u=!1;function h(){return n?i[0]?.done:Boolean(i.find((e=>e.done)))}function*d(){for(;i.length>0&&i[0].done;){const e=i[0];if(i.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(i.length===r&&(a=zn(),await a.promise),u)break;const e={done:!1};i.push(e),t().then((t=>{e.done=!0,e.ok=!0,e.value=t,s.dispatchEvent(new Gm("task-complete"))}),(t=>{e.done=!0,e.err=t,s.dispatchEvent(new Gm("task-complete"))}))}l=!0,s.dispatchEvent(new Gm("task-complete"))}catch(e){o=e,s.dispatchEvent(new Gm("task-complete"))}}));;){if(h()||(c=zn(),await c.promise),null!=o)throw o;if(n?yield*d():yield*p(),l&&0===i.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.toMultihash().bytes)||(n.add(s.id.toMultihash().bytes),yield s))}}class Xm extends Rs{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=gm([this.shutdownController.signal,e?.signal]);try{for(;;){this.needNext?.resolve(),this.needNext=zn();const e=await um(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=gm([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=xp(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 Xn(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 Jm{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 $g(`No handler registered for protocol ${e}`);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 qg(`Handler already registered for protocol ${e}`);const n=gf.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 ho("invalid topology");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=>{"NotFoundError"!==e.name&&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())null!=r.limits&&!0!==e.notifyOnLimitedConnection||!0!==e.filter?.has(n)&&(e.filter?.add(n),e.onConnect?.(n,r))}}}class Qm 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 Zm{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 Qm({name:t,metrics:r}):new Map,n}({name:"libp2p_transport_manager_listeners",metrics:this.components.metrics}),this.faultTolerance=t.faultTolerance??Pp.FATAL_ALL}[Symbol.toStringTag]="@libp2p/transport-manager";add(e){const t=e[Symbol.toStringTag];if(null==t)throw new ho("Transport must have a valid tag");if(this.transports.has(t))throw new ho(`There is already a transport with the tag ${t}`);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 Wg(`No transport available for address ${String(e)}`);return t?.onProgress?.(new Kp("transport-manager:selected-transport",r[Symbol.toStringTag])),r.dial(e,{...t,upgrader:this.components.upgrader})}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 Po("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),i=[];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})})),i.push(t.listen(e))}if(0!==i.length){if(null==(await Promise.allSettled(i)).find((e=>"fulfilled"===e.status))&&this.faultTolerance!==Pp.NO_FATAL)throw new zg(`Transport (${r}) could not listen on any available address`)}else t.push(r)}if(t.length===this.transports.size){const e=`no valid addresses were provided for transports [${t.join(", ")}]`;if(this.faultTolerance===Pp.FATAL_ALL)throw new zg(e);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 Ym=4194304;class ey extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class ty extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class ry extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}class ny extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}function sy(e){return null!=e[Symbol.asyncIterator]}function iy(e,t){if(e.byteLength>t)throw new ty("Message length too long")}const oy=e=>{const t=k(e),r=g(t);return _(e,r),oy.bytes=t,r};function ay(e,t){const r=(t=t??{}).lengthEncoder??oy,n=t?.maxDataLength??Ym;function*s(e){iy(e,n);const t=r(e.byteLength);t instanceof Uint8Array?yield t:yield*t,e instanceof Uint8Array?yield e:yield*e}return sy(e)?async function*(){for await(const t of e)yield*s(t)}():function*(){for(const t of e)yield*s(t)}()}var cy;oy.bytes=0,ay.single=(e,t)=>{const r=(t=t??{}).lengthEncoder??oy;return iy(e,t?.maxDataLength??Ym),new Rn(r(e.byteLength),e)},function(e){e[e.LENGTH=0]="LENGTH",e[e.DATA=1]="DATA"}(cy||(cy={}));const ly=e=>{const t=T(e);return ly.bytes=k(t),t};function uy(e,t){const r=new Rn;let n=cy.LENGTH,s=-1;const i=t?.lengthDecoder??ly,o=t?.maxLengthLength??8,a=t?.maxDataLength??Ym;function*c(){for(;r.byteLength>0;){if(n===cy.LENGTH)try{if(s=i(r),s<0)throw new ey("Invalid message length");if(s>a)throw new ty("Message length too long");const e=i.bytes;r.consume(e),null!=t?.onLength&&t.onLength(s),n=cy.DATA}catch(e){if(e instanceof RangeError){if(r.byteLength>o)throw new ry("Message length length too long");break}throw e}if(n===cy.DATA){if(r.byteLength0)throw new ny("Unexpected end of input")}():function*(){for(const t of e)r.append(t),yield*c();if(r.byteLength>0)throw new ny("Unexpected end of input")}()}ly.bytes=0,uy.fromReader=(e,t)=>{let r=1;return uy(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 hy{readNext;haveNext;ended;nextResult;error;constructor(){this.ended=!1,this.readNext=zn(),this.haveNext=zn()}[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=zn(),e}async throw(e){return this.ended=!0,this.error=e,null!=e&&(this.haveNext.promise.catch((()=>{})),this.haveNext.reject(e)),{done:!0,value:void 0}}async return(){const e={done:!0,value:void 0};return this.ended=!0,this.nextResult=e,this.haveNext.resolve(),e}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 this.error??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=zn(),await Xn(this.readNext.promise,t?.signal,t)}}class dy extends Error{name="UnexpectedEOFError";code="ERR_UNEXPECTED_EOF"}class py extends Error{name="InvalidMessageLengthError";code="ERR_INVALID_MSG_LENGTH"}class fy extends Error{name="InvalidDataLengthError";code="ERR_MSG_DATA_TOO_LONG"}class gy extends Error{name="InvalidDataLengthLengthError";code="ERR_MSG_LENGTH_TOO_LONG"}function my(e,t={}){const r=function(e,t){const r=new hy;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 Rn;return{read:async e=>{if(e?.signal?.throwIfAborted(),null==e?.bytes){const{done:t,value:r}=await Xn(n.next(),e?.signal);return!0===t?null:r}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}}}(e,t);null!=t.maxDataLength&&null==t.maxLengthLength&&(t.maxLengthLength=k(t.maxDataLength));const n=t?.lengthDecoder??T,s=t?.lengthEncoder??_;return{read:async e=>{let s=-1;const i=new Rn;for(;;){i.append(await r.read({...e,bytes:1}));try{s=n(i)}catch(e){if(e instanceof RangeError)continue;throw e}if(s<0)throw new py("Invalid message length");if(null!=t?.maxLengthLength&&i.byteLength>t.maxLengthLength)throw new gy("message length length too long");if(s>-1)break}if(null!=t?.maxDataLength&&s>t.maxDataLength)throw new fy("message length too long");return r.read({...e,bytes:s})},write:async(e,t)=>{await r.write(new Rn(s(e.byteLength),e),t)},writeV:async(e,t)=>{const n=new Rn(...e.flatMap((e=>[s(e.byteLength),e])));await r.write(n,t)},unwrap:()=>r.unwrap()}}const yy="/multistream/1.0.0",by=1024,wy=xt("\n");async function vy(e,t,r){await e.write(t,r)}async function Ey(e,t){const r=await async function(e,t){const r=await e.read(t);if(0===r.byteLength||r.get(r.byteLength-1)!==wy[0])throw t.log.error("Invalid mss message - missing newline",r),new Co("Missing newline");return r.sublist(0,-1)}(e,t);return en(r.subarray())}async function Sy(e,t,r){t=Array.isArray(t)?t:[t],r.log.trace("handle: available protocols %s",t);const n=my(e,{...r,maxDataLength:by,maxLengthLength:2});for(;;){r.log.trace("handle: reading incoming string");const e=await Ey(n,r);if(r.log.trace('handle: read "%s"',e),e!==yy){if(t.includes(e))return r.log.trace('handle: respond with "%s" for "%s"',e,e),await vy(n,xt(`${e}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',e,e),{stream:n.unwrap(),protocol:e};if("ls"!==e)r.log.trace('handle: respond with "na" for "%s"',e),await vy(n,xt("na\n"),r),r.log('handle: responded with "na" for "%s"',e);else{const s=new Rn(...t.map((e=>ay.single(xt(`${e}\n`)))),xt("\n"));r.log.trace('handle: respond with "%s" for %s',t,e),await vy(n,s,r),r.log.trace('handle: responded with "%s" for %s',t,e)}}else r.log.trace('handle: respond with "%s" for "%s"',yy,e),await vy(n,xt(`${yy}\n`),r),r.log.trace('handle: responded with "%s" for "%s"',yy,e)}}async function Ay(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 i=!1,o=!1;const a=zn();let c=!1,l=!1;const u=zn();let h=!1,d=!1;const p=zn(),f=my({sink:n,source:s},{...r,maxDataLength:by});async function g(){if(o)return r.log.trace("optimistic: already negotiating %s stream",t),void await a.promise;o=!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',yy,t),await f.writeV([xt(`${yy}\n`),xt(`${t}\n`)]),r.log.trace('optimistic: wrote ["%s", "%s", data] in source',yy,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 Ey(f,r);if(r.log.trace('optimistic: read multistream select header "%s"',e),e===yy&&(e=await Ey(f,r)),r.log.trace('optimistic: read protocol "%s", expecting "%s"',e,t),e!==t)throw new xo("protocol selection failed")}finally{h=!0,d=!1,p.resolve()}}}())}finally{o=!1,i=!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',yy,t,s.byteLength);const e=`${t}\n`;yield new Rn(Uint8Array.from([19]),xt(`${yy}\n`),_(e.length),xt(e),s).subarray(),r.log.trace('optimistic: wrote ["%s", "%s", data(%d)] in sink',yy,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=>{i||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=>{i||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 Xn(Promise.all(r),e?.signal):(i=!0,o=!1,a.resolve()),await t(e)}}return{stream:e,protocol:t}}(e,t[0],r);const n=my(e,{...r,maxDataLength:by}),s=t.shift();if(null==s)throw new Error("At least one protocol must be specified");r.log.trace('select: write ["%s", "%s"]',yy,s);const i=xt(`${yy}\n`),o=xt(`${s}\n`);await async function(e,t,r){await e.writeV(t,r)}(n,[i,o],r),r.log.trace("select: reading multistream-select header");let a=await Ey(n,r);if(r.log.trace('select: read "%s"',a),a===yy&&(r.log.trace("select: reading protocol response"),a=await Ey(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 vy(n,xt(`${e}\n`),r),r.log.trace("select: reading protocol response");const t=await Ey(n,r);if(r.log.trace('select: read "%s" for "%s"',t,e),t===e)return{stream:n.unwrap(),protocol:e}}throw new xo("protocol selection failed")}const Iy=Symbol.for("@libp2p/connection");class ky{id;remoteAddr;remotePeer;direction;timeline;multiplexer;encryption;status;limits;log;tags;_newStream;_close;_abort;_getStreams;constructor(e){const{remoteAddr:t,remotePeer:r,newStream:n,close:s,abort:i,getStreams:o}=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.limits=e.limits,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=i,this._getStreams=o,this.tags=[]}[Symbol.toStringTag]="Connection";[Iy]=!0;get streams(){return this._getStreams()}async newStream(e,t){if("closing"===this.status)throw new go("the connection is being closed");if("closed"===this.status)throw new mo("the connection is closed");if(Array.isArray(e)||(e=[e]),null!=this.limits&&!0!==t?.runOnLimitedConnection)throw new Ro("Cannot open protocol stream on limited 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 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){"closed"!==this.status&&(this.log.error("aborting connection to %a due to error",this.remoteAddr,e),this.status="closing",this._abort(e),this.status="closed",this.timeline.close=Date.now())}}function xy(e,t,r){let n=0;return r.streams.forEach((r=>{r.direction===t&&r.protocol===e&&n++})),n}class Cy{components;connectionEncrypters;streamMuxers;inboundUpgradeTimeout;outboundUpgradeTimeout;inboundStreamProtocolNegotiationTimeout;outboundStreamProtocolNegotiationTimeout;events;metrics;constructor(e,t){this.components=e,this.connectionEncrypters=new Map,t.connectionEncrypters.forEach((e=>{this.connectionEncrypters.set(e.protocol,e)})),this.streamMuxers=new Map,t.streamMuxers.forEach((e=>{this.streamMuxers.set(e.protocol,e)})),this.inboundUpgradeTimeout=t.inboundUpgradeTimeout??3e3,this.outboundUpgradeTimeout=t.outboundUpgradeTimeout??3e3,this.inboundStreamProtocolNegotiationTimeout=t.inboundStreamProtocolNegotiationTimeout??2e3,this.outboundStreamProtocolNegotiationTimeout=t.outboundStreamProtocolNegotiationTimeout??2e3,this.events=e.events,this.metrics={dials:e.metrics?.registerCounterGroup("libp2p_connection_manager_dials_total"),errors:e.metrics?.registerCounterGroup("libp2p_connection_manager_dial_errors_total")}}[Symbol.toStringTag]="@libp2p/upgrader";async shouldBlockConnection(e,...t){const r=this.components.connectionGater[e];if(null!=r&&!0===await r.apply(this.components.connectionGater,t))throw new Hg(`The multiaddr connection is blocked by gater.${e}`)}async upgradeInbound(e,t={}){try{if(this.metrics.dials?.increment({inbound:!0}),!await this.components.connectionManager.acceptIncomingConnection(e))throw new Kg("connection denied");return await this.shouldBlockConnection("denyInboundConnection",e),await this._performUpgrade(e,"inbound",t)}catch(e){throw this.metrics.errors?.increment({inbound:!0}),e}finally{this.components.connectionManager.afterUpgradeInbound()}}async upgradeOutbound(e,t={}){try{this.metrics.dials?.increment({outbound:!0});const r=e.remoteAddr.getPeerId();let n;return null!=r&&(n=Ol(r),await this.shouldBlockConnection("denyOutboundConnection",n,e)),await this._performUpgrade(e,"outbound",t)}catch(e){throw this.metrics.errors?.increment({outbound:!0}),e}}async _performUpgrade(e,t,r){let n,s,i,o,a;const c=gm([AbortSignal.timeout("inbound"===t?this.inboundUpgradeTimeout:this.outboundUpgradeTimeout),r.signal]);r.signal=c,this.components.metrics?.trackMultiaddrConnection(e),e.log.trace("starting the %s connection upgrade",t);let l=e;if(!0!==r?.skipProtection){const n=this.components.connectionProtector;null!=n&&(e.log("protecting the %s connection",t),l=await n.protect(e,r))}try{if(n=l,!0!==r?.skipEncryption){r?.onProgress?.(new Kp(`upgrader:encrypt-${t}-connection`)),({conn:n,remotePeer:s,protocol:a}=await("inbound"===t?this._encryptInbound(l,{...r,signal:c}):this._encryptOutbound(l,{...r,signal:c})));const e={...l,...n};await this.shouldBlockConnection("inbound"===t?"denyInboundEncryptedConnection":"denyOutboundEncryptedConnection",s,e)}else{const r=e.remoteAddr.getPeerId();if(null==r)throw new Ao(`${t} connection that skipped encryption must have a peer id`);const n=Ol(r);a="native",s=n}if(s.equals(this.components.peerId)){const t=new So("Can not dial self");throw e.abort(t),t}if(i=n,null!=r?.muxerFactory)o=r.muxerFactory;else if(this.streamMuxers.size>0){r?.onProgress?.(new Kp(`upgrader:multiplex-${t}-connection`));const e=await("inbound"===t?this._multiplexInbound({...l,...n},this.streamMuxers,r):this._multiplexOutbound({...l,...n},this.streamMuxers,r));o=e.muxerFactory,i=e.stream}}catch(r){throw e.log.error("failed to upgrade inbound connection %s %a - %e","inbound"===t?"from":"to",e.remoteAddr,r),r}finally{c.clear()}return await this.shouldBlockConnection("inbound"===t?"denyInboundUpgradedConnection":"denyOutboundUpgradedConnection",s,e),e.log("successfully upgraded %s connection",t),this._createConnection({cryptoProtocol:a,direction:t,maConn:e,upgradedConn:i,muxerFactory:o,remotePeer:s,limits:r?.limits})}_createConnection(e){const{cryptoProtocol:t,direction:r,maConn:n,upgradedConn:s,remotePeer:i,muxerFactory:o,limits:a}=e;let c,l,u;null!=o&&(c=o.createStreamMuxer({direction:r,onIncomingStream:e=>{null!=u&&Promise.resolve().then((async()=>{const t=this.components.registrar.getProtocols(),r=AbortSignal.timeout(this.inboundStreamProtocolNegotiationTimeout),{stream:n,protocol:s}=await Sy(e,t,{signal:r,log:e.log,yieldBytes:!1});if(null==u)return;u.log("incoming stream opened on %s",s);const o=function(e,t){try{const{options:r}=t.getHandler(e);return r.maxInboundStreams}catch(e){if("UnhandledProtocolError"!==e.name)throw e}return 32}(s,this.components.registrar);if(xy(s,"inbound",u)===o){const t=new No(`Too many inbound protocol streams for protocol "${s}" - limit ${o}`);throw e.abort(t),t}e.source=n.source,e.sink=n.sink,e.protocol=s,null!=n.closeWrite&&(e.closeWrite=n.closeWrite),null!=n.closeRead&&(e.closeRead=n.closeRead),null!=n.close&&(e.close=n.close),await this.components.peerStore.merge(i,{protocols:[s]}),this.components.metrics?.trackProtocolStream(e,u),this._onStream({connection:u,stream:e,protocol:s})})).catch((async t=>{u.log.error("error handling incoming stream id %s - %e",e.id,t),null==e.timeline.close&&await e.close()}))}}),l=async(t,n={})=>{if(null==c)throw new Vg("Connection is not multiplexed");u.log.trace("starting new stream for protocols %s",t);const s=await c.newStream();u.log.trace("started new stream %s for protocols %s",s.id,t);try{if(null==n.signal){s.log("no abort signal was passed while trying to negotiate protocols %s falling back to default timeout",t);const e=AbortSignal.timeout(this.outboundStreamProtocolNegotiationTimeout);n={...n,signal:e}}s.log.trace("selecting protocol from protocols %s",t);const{stream:e,protocol:r}=await Ay(s,t,{...n,log:s.log,yieldBytes:!0});s.log.trace("selected protocol %s",r);const o=function(e,t,r={}){try{const{options:r}=t.getHandler(e);if(null!=r.maxOutboundStreams)return r.maxOutboundStreams}catch(e){if("UnhandledProtocolError"!==e.name)throw e}return r.maxOutboundStreams??64}(r,this.components.registrar,n),a=xy(r,"outbound",u);if(a>=o){const e=new Oo(`Too many outbound protocol streams for protocol "${r}" - ${a}/${o}`);throw s.abort(e),e}return await this.components.peerStore.merge(i,{protocols:[r]}),s.source=e.source,s.sink=e.sink,s.protocol=r,null!=e.closeWrite&&(s.closeWrite=e.closeWrite),null!=e.closeRead&&(s.closeRead=e.closeRead),null!=e.close&&(s.close=e.close),this.components.metrics?.trackProtocolStream(s,u),s}catch(n){throw u.log.error("could not create new outbound stream on connection %s %a for protocols %s - %e","inbound"===r?"from":"to",e.maConn.remoteAddr,t,n),null==s.timeline.close&&s.abort(n),n}},Promise.all([c.sink(s.source),s.sink(c.source)]).catch((e=>{u.log.error("error piping data through muxer - %e",e)})));const h=n.timeline;var d;return n.timeline=new Proxy(h,{set:(...e)=>("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",e)}finally{this.events.safeDispatchEvent("connection:close",{detail:u})}})().catch((e=>{u.log.error("error thrown while dispatching connection:close event %e",e)})),Reflect.set(...e))}),n.timeline.upgraded=Date.now(),d={remoteAddr:n.remoteAddr,remotePeer:i,status:"open",direction:r,timeline:n.timeline,multiplexer:c?.protocol,encryption:t,limits:a,logger:this.components.logger,newStream:l??(()=>{throw new Vg("Connection is not multiplexed")}),getStreams:()=>c?.streams??[],close:async e=>{await(c?.close(e)),await n.close(e)},abort:e=>{n.abort(e),c?.abort(e)}},u=new ky(d),this.events.safeDispatchEvent("connection:open",{detail:u}),u.__maConnTimeline=h,u}_onStream(e){const{connection:t,stream:r,protocol:n}=e,{handler:s,options:i}=this.components.registrar.getHandler(n);if(null!=t.limits&&!0!==i.runOnLimitedConnection)throw new Ro("Cannot open protocol stream on limited connection");s({connection:t,stream:r})}async _encryptInbound(e,t){const r=Array.from(this.connectionEncrypters.keys());try{const{stream:n,protocol:s}=await Sy(e,r,{...t,log:e.log}),i=this.connectionEncrypters.get(s);if(null==i)throw new Gg(`no crypto module found for ${s}`);return e.log("encrypting inbound connection to %a using %s",e.remoteAddr,s),{...await i.secureInbound(n,t),protocol:s}}catch(t){throw e.log.error("encrypting inbound connection from %a failed",e.remoteAddr,t),new Gg(t.message)}}async _encryptOutbound(e,t){const r=Array.from(this.connectionEncrypters.keys());try{e.log.trace("selecting encrypter from %s",r);const{stream:n,protocol:s}=await Ay(e,r,{...t,log:e.log,yieldBytes:!0}),i=this.connectionEncrypters.get(s);if(null==i)throw new Gg(`no crypto module found for ${s}`);return e.log("encrypting outbound connection to %a using %s",e.remoteAddr,s),{...await i.secureOutbound(n,t),protocol:s}}catch(t){throw e.log.error("encrypting outbound connection to %a failed",e.remoteAddr,t),new Gg(t.message)}}async _multiplexOutbound(e,t,r){const n=Array.from(t.keys());e.log("outbound selecting muxer %s",n);try{e.log.trace("selecting stream muxer from %s",n);const{stream:s,protocol:i}=await Ay(e,n,{...r,log:e.log,yieldBytes:!0});return e.log("selected %s as muxer protocol",i),{stream:s,muxerFactory:t.get(i)}}catch(t){throw e.log.error("error multiplexing outbound connection",t),new Vg(String(t))}}async _multiplexInbound(e,t,r){const n=Array.from(t.keys());e.log("inbound handling muxers %s",n);try{const{stream:s,protocol:i}=await Sy(e,n,{...r,log:e.log});return{stream:s,muxerFactory:t.get(i)}}catch(t){throw e.log.error("error multiplexing inbound connection",t),new Vg(String(t))}}}class _y extends Rs{peerId;peerStore;contentRouting;peerRouting;metrics;services;logger;status;components;log;constructor(e){super(),this.status="stopped";const t=new Rs,r=t.dispatchEvent.bind(t);t.dispatchEvent=e=>{const t=r(e),n=this.dispatchEvent(new CustomEvent(e.type,{detail:e.detail}));return t||n},this.peerId=e.peerId,this.logger=e.logger??Lf(),this.log=this.logger.forComponent("libp2p"),this.services={};const n=this.components=function(e={}){const t=new Xg(e);return new Proxy(t,{get(e,r,n){if("string"==typeof r&&!Qg.includes(r)){const e=t.components[r];if(null==e&&!Jg.includes(r))throw new Dg(`${r} not set`);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:"2.1.8"},logger:this.logger,events:t,datastore:e.datastore??new Tg,connectionGater:tm(e.connectionGater),dns:e.dns});this.peerStore=this.configureComponent("peerStore",function(e,t={}){return new Sg(e,t)}(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 Cy(this.components,{connectionEncrypters:(e.connectionEncrypters??[]).map(((e,t)=>this.configureComponent(`connection-encryption-${t}`,e(this.components)))),streamMuxers:(e.streamMuxers??[]).map(((e,t)=>this.configureComponent(`stream-muxers-${t}`,e(this.components)))),inboundUpgradeTimeout:e.connectionManager?.inboundUpgradeTimeout,outboundUpgradeTimeout:e.connectionManager?.outboundUpgradeTimeout}),this.configureComponent("transportManager",new Zm(this.components,e.transportManager)),this.configureComponent("connectionManager",new Lm(this.components,e.connectionManager)),!1!==e.connectionMonitor?.enabled&&this.configureComponent("connectionMonitor",new Om(this.components,e.connectionMonitor)),this.configureComponent("registrar",new Jm(this.components)),this.configureComponent("addressManager",new Rg(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 Wm(this.components,{routers:s}));const i=(e.contentRouters??[]).map(((e,t)=>this.configureComponent(`content-router-${t}`,e(this.components))));if(this.contentRouting=this.components.contentRouting=this.configureComponent("contentRouting",new Dm(this.components,{routers:i})),this.configureComponent("randomWalk",new Xm(this.components)),(e.peerDiscovery??[]).forEach(((e,t)=>{this.configureComponent(`peer-discovery-${t}`,e(this.components)).addEventListener("peer",(e=>{this.#D(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[bf]&&(this.log("registering service %s for content routing",t),i.push(r[bf])),null!=r[wf]&&(this.log("registering service %s for peer routing",t),s.push(r[wf])),null!=r[oh]&&(this.log("registering service %s for peer discovery",t),r[oh].addEventListener?.("peer",(e=>{this.#D(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 Zg(r))t[e]=!0;for(const r of Object.values(e.components))for(const e of Yg(r))if(!0!==t[e])throw new Mg(`Service "${em(r)}" required capability "${e}" but it was not provided by any component, you may need to add additional configuration when creating your node.`)}(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 Df;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 ho("no protocols were provided to open a stream");if(0===(t=Array.isArray(t)?t:[t]).length)throw new ho("no protocols were provided to open a 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={}){wi(e)&&(e=Ol(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("NotFoundError"!==e.name)throw e}const r=Cn([xt("/pk/"),e.toMultihash().bytes]),n=Il(await this.contentRouting.get(r,t));return 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)}#D(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("peer discovery mechanism discovered self")}}function Ty(){try{return!1}catch(e){return!1}}const Py="bootstrap",Ly={store:1,filter:2,lightPush:2};var Ry=__webpack_require__(495),Ny=__webpack_require__.t(Ry,2);const Oy=BigInt(0),Dy=BigInt(1),My=BigInt(2),Fy=BigInt(3),By=BigInt(8),Uy=Object.freeze({a:Oy,b:BigInt(7),P:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:Dy,Gx:BigInt("55066263022277343669578718895168534326250603453777594175500187360389116729240"),Gy:BigInt("32670510020758816978083085130507043184471273380659243275938904335757337482424"),beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee")}),$y=(e,t)=>(e+t/My)/t,qy={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),splitScalar(e){const{n:t}=Uy,r=BigInt("0x3086d221a7d46bcde86c90e49284eb15"),n=-Dy*BigInt("0xe4437ed6010e88286f547fa90abfe4c3"),s=BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),i=r,o=BigInt("0x100000000000000000000000000000000"),a=$y(i*e,t),c=$y(-n*e,t);let l=gb(e-a*r-c*s,t),u=gb(-a*n-c*i,t);const h=l>o,d=u>o;if(h&&(l=t-l),d&&(u=t-u),l>o||u>o)throw new Error("splitScalarEndo: Endomorphism failed, k="+e);return{k1neg:h,k1:l,k2neg:d,k2:u}}};function jy(e){const{a:t,b:r}=Uy,n=gb(e*e),s=gb(n*e);return gb(s+t*e+r)}const zy=Uy.a===Oy;class Hy extends Error{constructor(e){super(e)}}function Ky(e){if(!(e instanceof Vy))throw new TypeError("JacobianPoint expected")}class Vy{constructor(e,t,r){this.x=e,this.y=t,this.z=r}static fromAffine(e){if(!(e instanceof Xy))throw new TypeError("JacobianPoint#fromAffine: expected Point");return e.equals(Xy.ZERO)?Vy.ZERO:new Vy(e.x,e.y,Dy)}static toAffineBatch(e){const t=function(e,t=Uy.P){const r=new Array(e.length),n=yb(e.reduce(((e,n,s)=>n===Oy?e:(r[s]=e,gb(e*n,t))),Dy),t);return e.reduceRight(((e,n,s)=>n===Oy?e:(r[s]=gb(e*r[s],t),gb(e*n,t))),n),r}(e.map((e=>e.z)));return e.map(((e,r)=>e.toAffine(t[r])))}static normalizeZ(e){return Vy.toAffineBatch(e).map(Vy.fromAffine)}equals(e){Ky(e);const{x:t,y:r,z:n}=this,{x:s,y:i,z:o}=e,a=gb(n*n),c=gb(o*o),l=gb(t*c),u=gb(s*a),h=gb(gb(r*o)*c),d=gb(gb(i*n)*a);return l===u&&h===d}negate(){return new Vy(this.x,gb(-this.y),this.z)}double(){const{x:e,y:t,z:r}=this,n=gb(e*e),s=gb(t*t),i=gb(s*s),o=e+s,a=gb(My*(gb(o*o)-n-i)),c=gb(Fy*n),l=gb(c*c),u=gb(l-My*a),h=gb(c*(a-u)-By*i),d=gb(My*t*r);return new Vy(u,h,d)}add(e){Ky(e);const{x:t,y:r,z:n}=this,{x:s,y:i,z:o}=e;if(s===Oy||i===Oy)return this;if(t===Oy||r===Oy)return e;const a=gb(n*n),c=gb(o*o),l=gb(t*c),u=gb(s*a),h=gb(gb(r*o)*c),d=gb(gb(i*n)*a),p=gb(u-l),f=gb(d-h);if(p===Oy)return f===Oy?this.double():Vy.ZERO;const g=gb(p*p),m=gb(p*g),y=gb(l*g),b=gb(f*f-m-My*y),w=gb(f*(y-b)-h*m),v=gb(n*o*p);return new Vy(b,w,v)}subtract(e){return this.add(e.negate())}multiplyUnsafe(e){const t=Vy.ZERO;if("bigint"==typeof e&&e===Oy)return t;let r=fb(e);if(r===Dy)return this;if(!zy){let e=t,n=this;for(;r>Oy;)r&Dy&&(e=e.add(n)),n=n.double(),r>>=Dy;return e}let{k1neg:n,k1:s,k2neg:i,k2:o}=qy.splitScalar(r),a=t,c=t,l=this;for(;s>Oy||o>Oy;)s&Dy&&(a=a.add(l)),o&Dy&&(c=c.add(l)),l=l.double(),s>>=Dy,o>>=Dy;return n&&(a=a.negate()),i&&(c=c.negate()),c=new Vy(gb(c.x*qy.beta),c.y,c.z),a.add(c)}precomputeWindow(e){const t=zy?128/e+1:256/e+1,r=[];let n=this,s=n;for(let i=0;i>=u,o>a&&(o-=l,e+=Dy);const h=r,d=r+Math.abs(o)-1,p=t%2!=0,f=o<0;0===o?i=i.add(Gy(p,n[h])):s=s.add(Gy(f,n[d]))}return{p:s,f:i}}multiply(e,t){let r,n,s=fb(e);if(zy){const{k1neg:e,k1:i,k2neg:o,k2:a}=qy.splitScalar(s);let{p:c,f:l}=this.wNAF(i,t),{p:u,f:h}=this.wNAF(a,t);c=Gy(e,c),u=Gy(o,u),u=new Vy(gb(u.x*qy.beta),u.y,u.z),r=c.add(u),n=l.add(h)}else{const{p:e,f:i}=this.wNAF(s,t);r=e,n=i}return Vy.normalizeZ([r,n])[0]}toAffine(e){const{x:t,y:r,z:n}=this,s=this.equals(Vy.ZERO);null==e&&(e=s?By:yb(n));const i=e,o=gb(i*i),a=gb(o*i),c=gb(t*o),l=gb(r*a),u=gb(n*i);if(s)return Xy.ZERO;if(u!==Dy)throw new Error("invZ was invalid");return new Xy(c,l)}}function Gy(e,t){const r=t.negate();return e?r:t}Vy.BASE=new Vy(Uy.Gx,Uy.Gy,Dy),Vy.ZERO=new Vy(Oy,Dy,Oy);const Wy=new WeakMap;class Xy{constructor(e,t){this.x=e,this.y=t}_setWindowSize(e){this._WINDOW_SIZE=e,Wy.delete(this)}hasEvenY(){return this.y%My===Oy}static fromCompressedHex(e){const t=32===e.length,r=db(t?e:e.subarray(1));if(!Ab(r))throw new Error("Point is not on curve");let n=function(e){const{P:t}=Uy,r=BigInt(6),n=BigInt(11),s=BigInt(22),i=BigInt(23),o=BigInt(44),a=BigInt(88),c=e*e*e%t,l=c*c*e%t,u=mb(l,Fy)*l%t,h=mb(u,Fy)*l%t,d=mb(h,My)*c%t,p=mb(d,n)*d%t,f=mb(p,s)*p%t,g=mb(f,o)*f%t,m=mb(g,a)*g%t,y=mb(m,o)*f%t,b=mb(y,Fy)*l%t,w=mb(b,i)*p%t,v=mb(w,r)*c%t,E=mb(v,My);if(E*E%t!==e)throw new Error("Cannot find square root");return E}(jy(r));const s=(n&Dy)===Dy;t?s&&(n=gb(-n)):!(1&~e[0])!==s&&(n=gb(-n));const i=new Xy(r,n);return i.assertValidity(),i}static fromUncompressedHex(e){const t=db(e.subarray(1,33)),r=db(e.subarray(33,65)),n=new Xy(t,r);return n.assertValidity(),n}static fromHex(e){const t=pb(e),r=t.length,n=t[0];if(32===r)return this.fromCompressedHex(t);if(33===r&&(2===n||3===n))return this.fromCompressedHex(t);if(65===r&&4===n)return this.fromUncompressedHex(t);throw new Error(`Point.fromHex: received invalid point. Expected 32-33 compressed bytes or 65 uncompressed bytes, not ${r}`)}static fromPrivateKey(e){return Xy.BASE.multiply(kb(e))}static fromSignature(e,t,r){const{r:n,s}=xb(t);if(![0,1,2,3].includes(r))throw new Error("Cannot recover: invalid recovery bit");const i=bb(pb(e)),{n:o}=Uy,a=2===r||3===r?n+o:n,c=yb(a,o),l=gb(-i*c,o),u=gb(s*c,o),h=1&r?"03":"02",d=Xy.fromHex(h+cb(a)),p=Xy.BASE.multiplyAndAddUnsafe(d,l,u);if(!p)throw new Error("Cannot recover signature: point at infinify");return p.assertValidity(),p}toRawBytes(e=!1){return ob(this.toHex(e))}toHex(e=!1){const t=cb(this.x);return e?`${this.hasEvenY()?"02":"03"}${t}`:`04${t}${cb(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(!Ab(t)||!Ab(r))throw new Error(e);const n=gb(r*r);if(gb(n-jy(t))!==Oy)throw new Error(e)}equals(e){return this.x===e.x&&this.y===e.y}negate(){return new Xy(this.x,gb(-this.y))}double(){return Vy.fromAffine(this).double().toAffine()}add(e){return Vy.fromAffine(this).add(Vy.fromAffine(e)).toAffine()}subtract(e){return this.add(e.negate())}multiply(e){return Vy.fromAffine(this).multiply(e,this).toAffine()}multiplyAndAddUnsafe(e,t,r){const n=Vy.fromAffine(this),s=t===Oy||t===Dy||this!==Xy.BASE?n.multiplyUnsafe(t):n.multiply(t),i=Vy.fromAffine(e).multiplyUnsafe(r),o=s.add(i);return o.equals(Vy.ZERO)?void 0:o.toAffine()}}function Jy(e){return Number.parseInt(e[0],16)>=8?"00"+e:e}function Qy(e){if(e.length<2||2!==e[0])throw new Error(`Invalid signature integer tag: ${nb(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:db(r),left:e.subarray(t+2)}}Xy.BASE=new Xy(Uy.Gx,Uy.Gy),Xy.ZERO=new Xy(Oy,Oy);class Zy{constructor(e,t){this.r=e,this.s=t,this.assertValidity()}static fromCompact(e){const t=Yy(e),r="Signature.fromCompact";if("string"!=typeof e&&!t)throw new TypeError(`${r}: Expected string or Uint8Array`);const n=t?nb(e):e;if(128!==n.length)throw new Error(`${r}: Expected 64-byte hex`);return new Zy(hb(n.slice(0,64)),hb(n.slice(64,128)))}static fromDER(e){const t=Yy(e);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: ${nb(e)}`);if(e[1]!==e.length-2)throw new Error("Invalid signature: incorrect length");const{data:t,left:r}=Qy(e.subarray(2)),{data:n,left:s}=Qy(r);if(s.length)throw new Error(`Invalid signature: left bytes after parsing: ${nb(s)}`);return{r:t,s:n}}(t?e:ob(e));return new Zy(r,n)}static fromHex(e){return this.fromDER(e)}assertValidity(){const{r:e,s:t}=this;if(!Sb(e))throw new Error("Invalid Signature: r must be 0 < r < n");if(!Sb(t))throw new Error("Invalid Signature: s must be 0 < s < n")}hasHighS(){const e=Uy.n>>Dy;return this.s>e}normalizeS(){return this.hasHighS()?new Zy(this.r,gb(-this.s,Uy.n)):this}toDERRawBytes(){return ob(this.toDERHex())}toDERHex(){const e=Jy(ub(this.s)),t=Jy(ub(this.r)),r=e.length/2,n=t.length/2,s=ub(r),i=ub(n);return`30${ub(n+r+4)}02${i}${t}02${s}${e}`}toRawBytes(){return this.toDERRawBytes()}toHex(){return this.toDERHex()}toCompactRawBytes(){return ob(this.toCompactHex())}toCompactHex(){return cb(this.r)+cb(this.s)}}function Yy(e){return e instanceof Uint8Array||ArrayBuffer.isView(e)&&"Uint8Array"===e.constructor.name}function eb(e){if(!Yy(e))throw new Error("Uint8Array expected")}function tb(...e){if(e.every(eb),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 nb(e){eb(e);let t="";for(let r=0;r=sb._0&&e<=sb._9?e-sb._0:e>=sb.A&&e<=sb.F?e-(sb.A-10):e>=sb.a&&e<=sb.f?e-(sb.a-10):void 0}function ob(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("hex string expected, got unpadded hex of length "+t);const n=new Uint8Array(r);for(let t=0,s=0;t0)return BigInt(e);if("bigint"==typeof e&&Sb(e))return e;throw new TypeError("Expected valid private scalar: 0 < scalar < curve.n")}function gb(e,t=Uy.P){const r=e%t;return r>=Oy?r:t+r}function mb(e,t){const{P:r}=Uy;let n=e;for(;t-- >Oy;)n*=n,n%=r;return n}function yb(e,t=Uy.P){if(e===Oy||t<=Oy)throw new Error(`invert: expected positive integers, got n=${e} mod=${t}`);let r=gb(e,t),n=t,s=Oy,i=Dy,o=Dy,a=Oy;for(;r!==Oy;){const e=n/r,t=n%r,c=s-o*e,l=i-a*e;n=r,r=t,s=o,i=a,o=c,a=l}if(n!==Dy)throw new Error("invert: does not exist");return gb(s,t)}function bb(e,t=!1){const r=function(e){const t=8*e.length-256,r=db(e);return t>0?r>>BigInt(t):r}(e);if(t)return r;const{n}=Uy;return r>=n?r-n:r}let wb,vb;class Eb{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 Nb.hmacSha256(this.k,...e)}hmacSync(...e){return vb(this.k,...e)}checkSync(){if("function"!=typeof vb)throw new Hy("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(64!==e.length)throw new Error("Expected 32 bytes of private key");t=hb(e)}else{if(!Yy(e))throw new TypeError("Expected valid private key");if(32!==e.length)throw new Error("Expected 32 bytes of private key");t=db(e)}if(!Sb(t))throw new Error("Expected private key: 0 < key < n");return t}function xb(e){if(e instanceof Zy)return e.assertValidity(),e;try{return Zy.fromDER(e)}catch(t){return Zy.fromCompact(e)}}function Cb(e){return db(e.length>32?e.slice(0,32):e)}function _b(e){const t=Cb(e),r=gb(t,Uy.n);return Tb(r{if((e=pb(e)).length<40||e.length>1024)throw new Error("Expected valid bytes of private key as per FIPS 186");return lb(gb(db(e),Uy.n-Dy)+Dy)},randomBytes:(e=32)=>{if(Lb.web)return Lb.web.getRandomValues(new Uint8Array(e));if(Lb.node){const{randomBytes:t}=Lb.node;return Uint8Array.from(t(e))}throw new Error("The environment doesn't have randomBytes function")},randomPrivateKey:()=>Nb.hashToPrivateKey(Nb.randomBytes(40)),precompute(e=8,t=Xy.BASE){const r=t===Xy.BASE?t:new Xy(t.x,t.y);return r._setWindowSize(e),r.multiply(Fy),r},sha256:async(...e)=>{if(Lb.web){const t=await Lb.web.subtle.digest("SHA-256",tb(...e));return new Uint8Array(t)}if(Lb.node){const{createHash:t}=Lb.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(Lb.web){const r=await Lb.web.subtle.importKey("raw",e,{name:"HMAC",hash:{name:"SHA-256"}},!1,["sign"]),n=tb(...t),s=await Lb.web.subtle.sign("HMAC",r,n);return new Uint8Array(s)}if(Lb.node){const{createHmac:r}=Lb.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=Rb[e];if(void 0===r){const t=await Nb.sha256(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=tb(t,t),Rb[e]=r}return Nb.sha256(r,...t)},taggedHashSync:(e,...t)=>{if("function"!=typeof wb)throw new Hy("sha256Sync is undefined, you need to set it");let r=Rb[e];if(void 0===r){const t=wb(Uint8Array.from(e,(e=>e.charCodeAt(0))));r=tb(t,t),Rb[e]=r}return wb(r,...t)},_JacobianPoint:Vy};Object.defineProperties(Nb,{sha256Sync:{configurable:!1,get:()=>wb,set(e){wb||(wb=e)}},hmacSha256Sync:{configurable:!1,get:()=>vb,set(e){vb||(vb=e)}}});var Ob=__webpack_require__(1176);function Db(e){return new Uint8Array(Ob.keccak256.arrayBuffer(e))}function Mb(e,t,r){try{return function(e,t,r,n=Pb){let s;try{s=xb(e),t=pb(t)}catch(e){return!1}const{r:i,s:o}=s;if(n.strict&&s.hasHighS())return!1;const a=bb(t);let c;try{c=function(e){return e instanceof Xy?(e.assertValidity(),e):Xy.fromHex(e)}(r)}catch(e){return!1}const{n:l}=Uy,u=yb(o,l),h=gb(a*u,l),d=gb(i*u,l),p=Xy.BASE.multiplyAndAddUnsafe(c,h,d);return!!p&&gb(p.x,l)===i}(Zy.fromCompact(e.slice(0,64)),t,r)}catch{return!1}}const Fb="Invalid record id";function Bb(e,t){switch(t){case"udp":return Bb(e,"udp4")||Bb(e,"udp6");case"tcp":return Bb(e,"tcp4")||Bb(e,"tcp6")}const r=t.endsWith("6"),n=e.get(r?"ip6":"ip");if(!n)return;const s=t.slice(0,3);let i;switch(s){case"udp":i=r?e.get("udp6"):e.get("udp");break;case"tcp":i=r?e.get("tcp6"):e.get("tcp");break;default:return}return i?function(e,t,r,n){let s=vi("/"+e+"/"+Ys(e,r));return s=s.encapsulate(vi("/"+t+"/"+Ys(t,n))),s}(r?"ip6":"ip4",s,n,i):void 0}function Ub(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 $b(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 qb 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 nn(e)}get publicKey(){if("v4"===this.id)return this.get("secp256k1");throw new Error(Fb)}get rs(){const e=this.get("rs");if(e)return fn(e)}get rsv(){const e=this.get("rsv");if(e)return fn(e)}get ip(){return jb(this,"ip","ip4")}set ip(e){Hb(this,"ip","ip4",e)}get tcp(){return zb(this,"tcp","tcp")}set tcp(e){Kb(this,"tcp","tcp",e)}get udp(){return zb(this,"udp","udp")}set udp(e){Kb(this,"udp","udp",e)}get ip6(){return jb(this,"ip6","ip6")}set ip6(e){Hb(this,"ip6","ip6",e)}get tcp6(){return zb(this,"tcp6","tcp")}set tcp6(e){Kb(this,"tcp6","tcp",e)}get udp6(){return zb(this,"udp6","udp")}set udp6(e){Kb(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){Vb(this,"waku2",e,(e=>new Uint8Array([$b(e)])))}}function jb(e,t,r){const n=e.get(t);if(n)return Ys(r,n)}function zb(e,t,r){const n=e.get(t);if(n)return Number(Ys(r,n))}function Hb(e,t,r,n){Vb(e,t,n,ei.bind({},r))}function Kb(e,t,r,n){Hb(e,t,r,n?.toString(10))}function Vb(e,t,r,n){void 0!==r?e.set(t,n(r)):e.delete(t)}async function Gb(e,t){return async function(e,t,r={}){const{seed:n,m:s,d:i}=function(e,t,r){if(null==e)throw new Error(`sign: expected valid message hash, not "${e}"`);const n=pb(e),s=kb(t),i=[Tb(s),_b(n)];if(null!=r){!0===r&&(r=Nb.randomBytes(32));const e=pb(r);if(32!==e.length)throw new Error("sign: Expected 32 bytes of extra data");i.push(e)}return{seed:tb(...i),m:Cb(n),d:s}}(e,t,r.extraEntropy),o=new Eb(32,32);let a;for(await o.reseed(n);!(a=Ib(await o.generate(),s,i,r.canonical));)await o.reseed();return function(e,t){const{sig:r,recovery:n}=e,{der:s,recovered:i}=Object.assign({canonical:!0,der:!0},t),o=s?r.toDERRawBytes():r.toCompactRawBytes();return i?[o,n]:o}(a,r)}(Db(t),e,{der:!1})}const Wb=new bn("enr");var Xb,Jb;!function(e){e.TCP="tcp",e.UDP="udp"}(Xb||(Xb={})),function(e){e.TCP4="tcp4",e.UDP4="udp4",e.TCP6="tcp6",e.UDP6="udp6"}(Jb||(Jb={}));class Qb extends qb{static RECORD_PREFIX="enr:";peerId;static create(e={},t=BigInt(1),r){const n=new Qb(e,t,r);try{const e=n.publicKey;e&&(n.peerId=function(e){const t=function(e){if(32===e.byteLength)return $c(e);if(33===e.byteLength)return El(e);const t=$o(e),r=t[1]?.[0];if("1.2.840.10045.3.1.7"===r||"1.3.132.0.34"===r||"1.3.132.0.35"===r)return ra(t);if("1.2.840.113549.1.1.1"===t[0]?.[0])return el(t,e);throw new ho("Could not extract public key from raw bytes")}(e);if("secp256k1"!==t.type)throw new Error("Keypair type not implemented");return Dl(t)}(e))}catch(e){Wb.error("Could not calculate peer id for ENR",e)}return n}get nodeId(){if("v4"===this.id)return this.publicKey?function(e){const t=Xy.fromHex(e).toRawBytes(!1);return rn(Db(t.slice(1)))}(this.publicKey):void 0;throw new Error(Fb)}getLocationMultiaddr=Bb.bind({},this);get shardInfo(){return this.rs&&this.rsv&&Wb.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(Jb)){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(Fb);if(!this.publicKey)throw new Error("Failed to verify ENR: No public key");return Mb(t,Db(e),this.publicKey)}async sign(e,t){if("v4"!==this.id)throw new Error(Fb);return this.signature=await Gb(t,e),this.signature}}let Zb=!1,Yb=!1;const ew={debug:1,default:2,info:2,warning:3,error:4,off:5};let tw=ew.default,rw=null;const nw=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 sw,iw;!function(e){e.DEBUG="DEBUG",e.INFO="INFO",e.WARNING="WARNING",e.ERROR="ERROR",e.OFF="OFF"}(sw||(sw={})),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"}(iw||(iw={}));const ow="0123456789abcdef";class aw{constructor(e){Object.defineProperty(this,"version",{enumerable:!0,value:e,writable:!1})}_log(e,t){const r=e.toLowerCase();null==ew[r]&&this.throwArgumentError("invalid log level name","logLevel",e),tw>ew[r]||console.log.apply(console,t)}debug(...e){this._log(aw.levels.DEBUG,e)}info(...e){this._log(aw.levels.INFO,e)}warn(...e){this._log(aw.levels.WARNING,e)}makeError(e,t,r){if(Yb)return this.makeError("censored error",t,{});t||(t=aw.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+=ow[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 i="";switch(t){case iw.NUMERIC_FAULT:{i="NUMERIC_FAULT";const t=e;switch(t){case"overflow":case"underflow":case"division-by-zero":i+="-"+t;break;case"negative-power":case"negative-width":i+="-unsupported";break;case"unbound-bitwise-result":i+="-unbound-result"}break}case iw.CALL_EXCEPTION:case iw.INSUFFICIENT_FUNDS:case iw.MISSING_NEW:case iw.NONCE_EXPIRED:case iw.REPLACEMENT_UNDERPRICED:case iw.TRANSACTION_REPLACED:case iw.UNPREDICTABLE_GAS_LIMIT:i=t}i&&(e+=" [ See: https://links.ethers.org/v5-errors-"+i+" ]"),n.length&&(e+=" ("+n.join(", ")+")");const o=new Error(e);return o.reason=s,o.code=t,Object.keys(r).forEach((function(e){o[e]=r[e]})),o}throwError(e,t,r){throw this.makeError(e,t,r)}throwArgumentError(e,t,r){return this.throwError(e,aw.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"),nw&&this.throwError("platform missing String.prototype.normalize",aw.errors.UNSUPPORTED_OPERATION,{operation:"String.prototype.normalize",form:nw})}checkSafeUint53(e,t){"number"==typeof e&&(null==t&&(t="value not safe"),(e<0||e>=9007199254740991)&&this.throwError(t,aw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"out-of-safe-range",value:e}),e%1&&this.throwError(t,aw.errors.NUMERIC_FAULT,{operation:"checkSafeInteger",fault:"non-integer",value:e}))}checkArgumentCount(e,t,r){r=r?": "+r:"",et&&this.throwError("too many arguments"+r,aw.errors.UNEXPECTED_ARGUMENT,{count:e,expectedCount:t})}checkNew(e,t){e!==Object&&null!=e||this.throwError("missing new",aw.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",aw.errors.UNSUPPORTED_OPERATION,{name:e.name,operation:"new"}):e!==Object&&null!=e||this.throwError("missing new",aw.errors.MISSING_NEW,{name:t.name})}static globalLogger(){return rw||(rw=new aw("logger/5.8.0")),rw}static setCensorship(e,t){if(!e&&t&&this.globalLogger().throwError("cannot permanently disable censorship",aw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"}),Zb){if(!e)return;this.globalLogger().throwError("error censorship permanent",aw.errors.UNSUPPORTED_OPERATION,{operation:"setCensorship"})}Yb=!!e,Zb=!!t}static setLogLevel(e){const t=ew[e.toLowerCase()];null!=t?tw=t:aw.globalLogger().warn("invalid log level - "+e)}static from(e){return new aw(e)}}aw.errors=iw,aw.levels=sw;const cw=new aw("bytes/5.8.0");function lw(e){return!!e.toHexString}function uw(e){return e.slice||(e.slice=function(){const t=Array.prototype.slice.call(arguments);return uw(new Uint8Array(Array.prototype.slice.apply(e,t)))}),e}function hw(e){return"number"==typeof e&&e==e&&e%1==0}function dw(e){if(null==e)return!1;if(e.constructor===Uint8Array)return!0;if("string"==typeof e)return!1;if(!hw(e.length)||e.length<0)return!1;for(let t=0;t=256)return!1}return!0}function pw(e,t){if(t||(t={}),"number"==typeof e){cw.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),uw(new Uint8Array(t))}if(t.allowMissingPrefix&&"string"==typeof e&&"0x"!==e.substring(0,2)&&(e="0x"+e),lw(e)&&(e=e.toHexString()),fw(e)){let r=e.substring(2);r.length%2&&("left"===t.hexPad?r="0"+r:"right"===t.hexPad?r+="0":cw.throwArgumentError("hex data is odd-length","value",e));const n=[];for(let e=0;e>4]+gw[15&n]}return t}return cw.throwArgumentError("invalid hexlify value","value",e)}const yw=new aw("rlp/5.8.0");function bw(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&&yw.throwError("child data too short",aw.errors.BUFFER_OVERRUN,{})}return{consumed:1+n,result:s}}function Sw(e,t){if(0===e.length&&yw.throwError("data too short",aw.errors.BUFFER_OVERRUN,{}),e[t]>=248){const r=e[t]-247;t+1+r>e.length&&yw.throwError("data short segment too short",aw.errors.BUFFER_OVERRUN,{});const n=ww(e,t+1,r);return t+1+r+n>e.length&&yw.throwError("data long segment too short",aw.errors.BUFFER_OVERRUN,{}),Ew(e,t,t+1+r,r+n)}if(e[t]>=192){const r=e[t]-192;return t+1+r>e.length&&yw.throwError("data array too short",aw.errors.BUFFER_OVERRUN,{}),Ew(e,t,t+1,r)}if(e[t]>=184){const r=e[t]-183;t+1+r>e.length&&yw.throwError("data array too short",aw.errors.BUFFER_OVERRUN,{});const n=ww(e,t+1,r);return t+1+r+n>e.length&&yw.throwError("data array too short",aw.errors.BUFFER_OVERRUN,{}),{consumed:1+r+n,result:mw(e.slice(t+1+r,t+1+r+n))}}if(e[t]>=128){const r=e[t]-128;return t+1+r>e.length&&yw.throwError("data too short",aw.errors.BUFFER_OVERRUN,{}),{consumed:1+r,result:mw(e.slice(t+1,t+1+r))}}return{consumed:1,result:mw(e[t])}}const Aw=new bn("enr:decoder");class Iw{static fromString(e){if(!e.startsWith(Qb.RECORD_PREFIX))throw new Error(`"string encoded ENR must start with '${Qb.RECORD_PREFIX}'`);return Iw.fromRLP(xt(e.slice(4),"base64url"))}static fromRLP(e){const t=function(e){const t=pw(e),r=Sw(t,0);return r.consumed!==t.length&&yw.throwArgumentError("invalid rlp data","data",e),r.result}(e).map(tn);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;e0))throw new TypeError("`maxSize` must be a number greater than 0");if("number"==typeof e.maxAge&&0===e.maxAge)throw new TypeError("`maxAge` must be a number greater than 0");this.#U=e.maxSize,this.#$=e.maxAge||Number.POSITIVE_INFINITY,this.#q=e.onEviction}get __oldCache(){return this.#B}#j(e){if("function"==typeof this.#q)for(const[t,r]of e)this.#q(t,r.value)}#z(e,t){return"number"==typeof t.expiry&&t.expiry<=Date.now()&&("function"==typeof this.#q&&this.#q(e,t.value),this.delete(e))}#H(e,t){if(!1===this.#z(e,t))return t.value}#K(e,t){return t.expiry?this.#H(e,t):t.value}#V(e,t){const r=t.get(e);return this.#K(e,r)}#G(e,t){this.#F.set(e,t),this.#M++,this.#M>=this.#U&&(this.#M=0,this.#j(this.#B),this.#B=this.#F,this.#F=new Map)}#W(e,t){this.#B.delete(e),this.#G(e,t)}*#X(){for(const e of this.#B){const[t,r]=e;this.#F.has(t)||!1===this.#z(t,r)&&(yield e)}for(const e of this.#F){const[t,r]=e;!1===this.#z(t,r)&&(yield e)}}get(e){if(this.#F.has(e)){const t=this.#F.get(e);return this.#K(e,t)}if(this.#B.has(e)){const t=this.#B.get(e);if(!1===this.#z(e,t))return this.#W(e,t),t.value}}set(e,t,{maxAge:r=this.#$}={}){const n="number"==typeof r&&r!==Number.POSITIVE_INFINITY?Date.now()+r:void 0;return this.#F.has(e)?this.#F.set(e,{value:t,expiry:n}):this.#G(e,{value:t,expiry:n}),this}has(e){return this.#F.has(e)?!this.#z(e,this.#F.get(e)):!!this.#B.has(e)&&!this.#z(e,this.#B.get(e))}peek(e){return this.#F.has(e)?this.#V(e,this.#F):this.#B.has(e)?this.#V(e,this.#B):void 0}delete(e){const t=this.#F.delete(e);return t&&this.#M--,this.#B.delete(e)||t}clear(){this.#F.clear(),this.#B.clear(),this.#M=0}resize(e){if(!(e&&e>0))throw new TypeError("`maxSize` must be a number greater than 0");const t=[...this.#X()],r=t.length-e;r<0?(this.#F=new Map(t),this.#B=new Map,this.#M=t.length):(r>0&&this.#j(t.slice(0,r)),this.#B=new Map(t.slice(r)),this.#F=new Map,this.#M=0),this.#U=e}*keys(){for(const[e]of this)yield e}*values(){for(const[,e]of this)yield e}*[Symbol.iterator](){for(const e of this.#F){const[t,r]=e;!1===this.#z(t,r)&&(yield[t,r.value])}for(const e of this.#B){const[t,r]=e;this.#F.has(t)||!1===this.#z(t,r)&&(yield[t,r.value])}}*entriesDescending(){let e=[...this.#F];for(let t=e.length-1;t>=0;--t){const r=e[t],[n,s]=r;!1===this.#z(n,s)&&(yield[n,s.value])}e=[...this.#B];for(let t=e.length-1;t>=0;--t){const r=e[t],[n,s]=r;this.#F.has(n)||!1===this.#z(n,s)&&(yield[n,s.value])}}*entriesAscending(){for(const[e,t]of this.#X())yield[e,t.value]}get size(){if(!this.#M)return this.#B.size;let e=0;for(const t of this.#B.keys())this.#F.has(t)||e++;return Math.min(this.#M+e,this.#U)}get maxSize(){return this.#U}entries(){return this.entriesAscending()}forEach(e,t=this){for(const[r,n]of this.entriesAscending())e.call(t,n,r,this)}get[Symbol.toStringTag](){return"QuickLRU"}toString(){return`QuickLRU(${this.size}/${this.maxSize})`}[Symbol.for("nodejs.util.inspect.custom")](){return this.toString()}}function xw(e,t,r){return`${e}?name=${t}&type=${r}`}async function Cw(e,t){const r=await fetch(e,{headers:new Headers({accept:"application/dns-json"}),signal:t});return await r.json()}function _w(e,t){return`${t}_${e}`}const Tw=Object.assign(Pf("dns-over-http-resolver"),{error:Pf("dns-over-http-resolver:error")}),Pw=class{_cache;_TXTcache;_servers;_request;_abortControllers;constructor(e={}){this._cache=new kw({maxSize:e?.maxCache??100}),this._TXTcache=new kw({maxSize:e?.maxCache??100}),this._servers=["https://cloudflare-dns.com/dns-query","https://dns.google/resolve"],this._request=e.request??Cw,this._abortControllers=[]}cancel(){this._abortControllers.forEach((e=>{e.abort()}))}getServers(){return this._servers}_getShuffledServers(){const e=[...this._servers];for(let t=e.length-1;t>0;t--){const r=Math.floor(Math.random()*t),n=e[t];e[t]=e[r],e[r]=n}return e}setServers(e){this._servers=e}async resolve(e,t="A"){switch(t){case"A":return this.resolve4(e);case"AAAA":return this.resolve6(e);case"TXT":return this.resolveTxt(e);default:throw new Error(`${t} is not supported`)}}async resolve4(e){const t="A",r=this._cache.get(_w(e,t));if(null!=r)return r;let n=!1;for(const r of this._getShuffledServers()){const s=new AbortController;this._abortControllers.push(s);try{const n=await this._request(xw(r,e,t),s.signal),i=n.Answer.map((e=>e.data)),o=Math.min(...n.Answer.map((e=>e.TTL)));return this._cache.set(_w(e,t),i,{maxAge:o}),i}catch(i){s.signal.aborted&&(n=!0),Tw.error(`${r} could not resolve ${e} record ${t}`)}finally{this._abortControllers=this._abortControllers.filter((e=>e!==s))}}if(n)throw Object.assign(new Error("queryA ECANCELLED"),{code:"ECANCELLED"});throw new Error(`Could not resolve ${e} record ${t}`)}async resolve6(e){const t="AAAA",r=this._cache.get(_w(e,t));if(null!=r)return r;let n=!1;for(const r of this._getShuffledServers()){const s=new AbortController;this._abortControllers.push(s);try{const n=await this._request(xw(r,e,t),s.signal),i=n.Answer.map((e=>e.data)),o=Math.min(...n.Answer.map((e=>e.TTL)));return this._cache.set(_w(e,t),i,{maxAge:o}),i}catch(i){s.signal.aborted&&(n=!0),Tw.error(`${r} could not resolve ${e} record ${t}`)}finally{this._abortControllers=this._abortControllers.filter((e=>e!==s))}}if(n)throw Object.assign(new Error("queryAaaa ECANCELLED"),{code:"ECANCELLED"});throw new Error(`Could not resolve ${e} record ${t}`)}async resolveTxt(e){const t="TXT",r=this._TXTcache.get(_w(e,t));if(null!=r)return r;let n=!1;for(const r of this._getShuffledServers()){const s=new AbortController;this._abortControllers.push(s);try{const n=await this._request(xw(r,e,t),s.signal),i=n.Answer.map((e=>[e.data.replace(/['"]+/g,"")])),o=Math.min(...n.Answer.map((e=>e.TTL)));return this._TXTcache.set(_w(e,t),i,{maxAge:o}),i}catch(i){s.signal.aborted&&(n=!0),Tw.error(`${r} could not resolve ${e} record ${t}`)}finally{this._abortControllers=this._abortControllers.filter((e=>e!==s))}}if(n)throw Object.assign(new Error("queryTxt ECANCELLED"),{code:"ECANCELLED"});throw new Error(`Could not resolve ${e} record ${t}`)}clearCache(){this._cache.clear(),this._TXTcache.clear()}},Lw=new bn("dns-over-https");class Rw{resolver;static async create(){return new Rw}constructor(e=new Pw){this.resolver=e}async resolveTXT(e){let t;try{t=await this.resolver.resolveTxt(e)}catch(e){throw Lw.error("query failed: ",e),new Error("DNS query failed")}if(!t)throw new Error(`Could not resolve ${e}`);const r=[];return t.forEach((e=>{"string"==typeof e?r.push(e):Array.isArray(e)?e.forEach((e=>{"string"==typeof e?r.push(e):r.push(nn(e))})):r.push(nn(e))})),r}}var Nw=__webpack_require__(5818);class Ow{static RECORD_PREFIX=Qb.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=Ow.parseRootValues(e),n=Nw.decode.asBytes(t),s=e.split(" sig")[0],i=sn(s);if(!Mb(xt(r.signature,"base64url").slice(0,64),Db(i),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,i]=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(!i)throw new Error("Could not parse 'sig' value from ENRTree root entry");return{eRoot:r,lRoot:n,seq:Number(s),signature:i}}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 Dw=new bn("discovery:fetch_nodes");function Mw(e,t){return t.relay>=e.relay&&t.store>=e.store&&t.filter>=e.filter&&t.lightPush>=e.lightPush}function Fw(e,t){if(!e.nodeId)return!1;for(const r of t)if(e.nodeId===r.nodeId)return!1;return!0}function Bw(e,t){e.relay&&(t.relay+=1),e.store&&(t.store+=1),e.filter&&(t.filter+=1),e.lightPush&&(t.lightPush+=1)}function Uw(e,t,r){if(Mw(t,r))throw"Internal Error: Waku2 wanted capabilities are already fulfilled";const n=function(e,t){return{relay:t.relaythis._search(s,i)));return $w.info("retrieved peers: ",o.map((e=>({id:e.peerId?.toString(),multiaddrs:e.multiaddrs?.map((e=>e.toString()))})))),o}constructor(e){this._DNSTreeCache={},this.dns=e}async*getNextPeer(e,t){const r=Math.floor(Math.random()*e.length),{publicKey:n,domain:s}=Ow.parseTree(e[r]),i={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,i={relay:0,store:0,filter:0,lightPush:0};let o=0;const a=new Set;for(;!Mw(n,i)&&othis._search(s,i))))yield e}async _search(e,t){try{const r=await this._getTXTRecord(e,t);let n,s;t.visits[e]=!0;const i=function(e){return e.startsWith(Ow.ROOT_PREFIX)?Ow.ROOT_PREFIX:e.startsWith(Ow.BRANCH_PREFIX)?Ow.BRANCH_PREFIX:e.startsWith(Ow.RECORD_PREFIX)?Ow.RECORD_PREFIX:""}(r);try{switch(i){case Ow.ROOT_PREFIX:return n=Ow.parseAndVerifyRoot(r,t.publicKey),await this._search(n,t);case Ow.BRANCH_PREFIX:return s=Ow.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 Ow.RECORD_PREFIX:return Iw.fromString(r);default:return null}}catch(t){return $w.error(`Failed to search DNS tree ${i} at subdomain ${e}: ${t}`),null}}catch(t){return $w.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 jw=new bn("peer-discovery-dns");class zw extends Rs{nextPeer;_started;_components;_options;constructor(e,t){super(),this._started=!1,this._components=e,this._options=t;const{enrUrls:r}=t;jw.info("Use following EIP-1459 ENR Tree URLs: ",r)}async start(){jw.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 qw.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={[Py]:{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(Py)||(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:gn(r)}}})),s&&this.dispatchEvent(new CustomEvent("peer",{detail:t}))}}stop(){this._started=!1}get[oh](){return!0}get[Symbol.toStringTag](){return Jr}}function Hw(e){return e.filter((e=>"open"===e.status)).sort(((e,t)=>t.timeline.open-e.timeline.open)).at(0)}const Kw="consumed";class Vw{multicodec;getConnections;addEventListener;log;ongoingCreation=new Set;streamPool=new Map;constructor(e,t,r){this.multicodec=e,this.getConnections=t,this.addEventListener=r,this.log=new bn(`stream-manager:${e}`),this.addEventListener("peer:update",this.handlePeerUpdateStreamPool)}async getStream(e){const t=e.toString(),r=this.streamPool.get(t);r&&(this.streamPool.delete(t),await r);let n=this.getOpenStreamForCodec(e);return n?(this.log.info(`Found existing stream peerId=${t} multicodec=${this.multicodec}`),this.lockStream(t,n),n):(n=await this.createStream(e),this.lockStream(t,n),n)}async createStream(e,t=0){const r=Hw(this.getConnections(e));if(!r)throw new Error(`Failed to get a connection to the peer peerId=${e.toString()} multicodec=${this.multicodec}`);let n,s;for(let i=0;i{const{peer:t}=e.detail;t.protocols.includes(this.multicodec)&&(this.getOpenStreamForCodec(t.id)||this.scheduleNewStream(t))};scheduleNewStream(e){this.log.info(`Scheduling creation of a stream for peerId=${e.id.toString()} multicodec=${this.multicodec}`),this.streamPool.has(e.id.toString())&&this.streamPool.delete(e.id.toString()),this.streamPool.set(e.id.toString(),this.createStreamWithLock(e))}getOpenStreamForCodec(e){const t=Hw(this.getConnections(e));if(!t)return;const r=t.streams.find((e=>e.protocol===this.multicodec));return r?["done","closed","closing"].includes(r.writeStatus||"")||this.isStreamLocked(r)?void 0:r:void 0}lockStream(e,t){this.log.info(`Locking stream for peerId:${e}\tstreamId:${t.id}`),t.metadata[Kw]=!0}isStreamLocked(e){return!!e.metadata[Kw]}}class Gw{multicodec;components;pubsubTopics;addLibp2pEventListener;removeLibp2pEventListener;streamManager;constructor(e,t,r){this.multicodec=e,this.components=t,this.pubsubTopics=r,this.addLibp2pEventListener=t.events.addEventListener.bind(t.events),this.removeLibp2pEventListener=t.events.removeEventListener.bind(t.events),this.streamManager=new Vw(e,t.connectionManager.getConnections.bind(t.connectionManager),this.addLibp2pEventListener)}async getStream(e){return this.streamManager.getStream(e)}}class Ww{proto;constructor(e){this.proto=e}static createRequest(e){const{numPeers:t}=e;return new Ww({query:{numPeers:t},response:void 0})}encode(){return fr.encode(this.proto)}static decode(e){const t=fr.decode(e);return new Ww(t)}get query(){return this.proto.query}get response(){return this.proto.response}}const Xw="/vac/waku/peer-exchange/2.0.0-alpha1",Jw=new bn("peer-exchange");class Qw extends Gw{constructor(e,t){super(Xw,e,t)}async query(e){const{numPeers:t,peerId:r}=e,n=Ww.createRequest({numPeers:BigInt(t)});if(!await this.components.peerStore.get(r))return{peerInfos:null,error:Vr.NO_PEER_AVAILABLE};let s;try{s=await this.getStream(r)}catch(e){return Jw.error("Failed to get stream",e),{peerInfos:null,error:Vr.NO_STREAM_AVAILABLE}}const i=await Zn([n.encode()],Dn,s,jn,(async e=>await xn(e)));try{const e=new Rn;i.forEach((t=>{e.append(t)}));const{response:t}=Ww.decode(e);return t?{peerInfos:await Promise.all(t.peerInfos.map((e=>e.enr)).filter(Ir).map((async e=>({ENR:await Iw.fromRLP(e)})))),error:null}:(Jw.error("PeerExchangeRPC message did not contains a `response` field"),{peerInfos:null,error:Vr.EMPTY_PAYLOAD})}catch(e){return Jw.error("Failed to decode push reply",e),{peerInfos:null,error:Vr.DECODE_FAILED}}}}const Zw=new bn("peer-exchange-discovery"),Yw=1e4,ev=3,tv=Gr.PEER_EXCHANGE;class rv extends Rs{components;peerExchange;options;isStarted;queryingPeers=new Set;queryAttempts=new Map;handleDiscoveredPeer=e=>{const{protocols:t,peerId:r}=e.detail;t.includes(Xw)&&!this.queryingPeers.has(r.toString())&&(this.queryingPeers.add(r.toString()),this.startRecurringQueries(r).catch((e=>Zw.error(`Error querying peer ${e}`))))};constructor(e,t,r={}){super(),this.components=e,this.peerExchange=new Qw(e,t),this.options=r,this.isStarted=!1}start(){this.isStarted||(this.dispatchEvent(new CustomEvent("waku:peer-exchange:started",{detail:!0})),Zw.info("Starting peer exchange node discovery, discovering peers"),this.components.events.addEventListener("peer:identify",this.handleDiscoveredPeer))}stop(){this.isStarted&&(Zw.info("Stopping peer exchange node discovery"),this.isStarted=!1,this.queryingPeers.clear(),this.components.events.removeEventListener("peer:identify",this.handleDiscoveredPeer))}get[oh](){return!0}get[Symbol.toStringTag](){return"@waku/peer-exchange"}startRecurringQueries=async e=>{const t=e.toString(),{queryInterval:r=Yw,maxRetries:n=ev}=this.options;Zw.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=>{Zw.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 Zw.error("Peer exchange query failed",t),{error:t,peerInfos:null};for(const e of r){const{ENR:t}=e;if(!t){Zw.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){Zw.info(`Peer ${r.toString()} has updated multiaddrs or shardInfo, updating`),e&&(Zw.info(`Peer ${r.toString()} has updated multiaddrs, updating`),await this.components.peerStore.patch(r,{multiaddrs:n.multiaddrs})),t&&s&&(Zw.info(`Peer ${r.toString()} has updated shardInfo, updating`),await this.components.peerStore.merge(r,{metadata:{shardInfo:gn(s)}}),this.dispatchEvent(new CustomEvent("peer",{detail:{id:r,multiaddrs:n.multiaddrs}})));continue}}await this.components.peerStore.save(r,{tags:{[tv]:{value:this.options.tagValue??50,ttl:this.options.tagTTL??1e8}},...s&&{metadata:{shardInfo:gn(s)}},...n.multiaddrs&&{multiaddrs:n.multiaddrs}}),Zw.info(`Discovered peer: ${r.toString()}`),this.dispatchEvent(new CustomEvent("peer",{detail:{id:r,multiaddrs:n.multiaddrs}}))}}return{error:null,peerInfos:r}}abortQueriesForPeer(e){Zw.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())),i=e.multiaddrs.map((e=>e.toString())),o=s.some((e=>!i.includes(e)));let a=!1;const c=n.metadata.get("shardInfo");if(c){const e=fn(c);(e||t)&&(a=e.clusterId!==t?.clusterId||e.shards.some((e=>!t?.shards.includes(e))))}return{hasMultiaddrDiff:o,hasShardDiff:a}}}const nv=new bn("peer-exchange-discovery"),sv=Gr.LOCAL;class iv extends Rs{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){nv.info("Starting Local Storage Discovery"),this.components.events.addEventListener("peer:identify",this.handleNewPeers);for(const{id:e,address:t}of this.peers){const r=Ol(e);await this.components.peerStore.has(r)||(await this.components.peerStore.save(r,{multiaddrs:[vi(t)],tags:{[this.options?.tagName??sv]:{value:this.options?.tagValue??50,ttl:this.options?.tagTTL??1e8}}}),this.dispatchEvent(new CustomEvent("peer",{detail:{id:r,multiaddrs:[vi(t)]}})))}nv.info(`Discovered ${this.peers.length} peers`),this.isStarted=!0}}stop(){this.isStarted&&(nv.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(),i=s.findIndex((e=>e.id===t.toString()));i>=0?s[i].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(ov):[]}catch(e){return nv.error("Error parsing peers from local storage:",e),[]}}savePeersToLocalStorage(){try{localStorage.setItem("waku:peers",JSON.stringify(this.peers))}catch(e){nv.error("Error saving peers to local storage:",e)}}}function ov(e){return e&&"object"==typeof e&&"string"==typeof e.id&&"string"==typeof e.address}function av(e,t){const r=["enrtree://AIRVQ5DDA4FFWLRBCHJWUWOO6X6S4ZTZ5B667LQ6AJU6PEYDLRD5O@sandbox.waku.nodes.status.im"],n=[];return t?.dns&&n.push(function(e,t=Ly){return r=>new zw(r,{enrUrls:e,wantedNodeCapabilityCount:t})}(r)),t?.localPeerCache&&n.push(((e,t)=>new iv(e,t))),t?.peerExchange&&n.push(function(e){return t=>new rv(t,e)}(e)),n}const cv=new bn("sdk:create");async function lv(e,t,r){t?.hideWebSocketInfo||Ty()||(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:Ti(e)}:{};return async function(e={}){e.privateKey??=await Sl("Ed25519");const t=new _y({...await yf(e),peerId:(r=e.privateKey,Dl(r.publicKey))});var r;return!1!==e.start&&await t.start(),t}({transports:[Xp({filter:!1===t?.filterMultiaddrs||Ty()?Vp:Gp})],streamMuxers:[kp()],connectionEncrypters:[ih()],...t,services:{identify:Zd({agentVersion:r??"js-waku"}),ping:_p({maxInboundStreams:t?.pingMaxInboundStreams??10}),...n,...t?.services}})}const uv={dns:!0,peerExchange:!0,localPeerCache:!0};async function hv(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 an(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=>dn(t,e.clusterId)))}throw new Error("Unknown shard config. Please use ShardInfo or ContentTopicInfo");var t}(t??Qr);cv.info("Creating Waku node with pubsub topics",r);const n=e?.libp2p??{},s=n.peerDiscovery??[];var i;return e?.defaultBootstrap?s.push(...av(r,{...uv,...e.discovery})):s.push(...av(r,e.discovery)),e?.bootstrapPeers&&s.push((i={list:e.bootstrapPeers},e=>new Uh(e,i))),n.peerDiscovery=s,{libp2p:await lv(r,n,e?.userAgent),pubsubTopics:r}}(e),n=new co(r,e,t,{store:!0,lightpush:!0,filter:!0});return!1!==e?.autoStart&&await n.start(),n}function dv(e){return t=this,r=void 0,s=function(){var t,r,n;return function(e,t){var r,n,s,i={label:0,sent:function(){if(1&s[0])throw s[1];return s[1]},trys:[],ops:[]},o=Object.create(("function"==typeof Iterator?Iterator:Object).prototype);return o.next=a(0),o.throw=a(1),o.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&&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?(console.log("Message ".concat(n+1," (ID: ").concat(c.id,") sent successfully.")),xv++,vv&&(vv.textContent=xv.toString()),Lv(c)):console.warn("Failed to send message ".concat(n+1," (ID: ").concat(c.id,"):"),l.failures),[3,5];case 4:return u=h.sent(),console.error("Error sending message ".concat(n+1," (ID: ").concat(c.id,"):"),u),[3,5];case 5:return[4,new Promise((function(e){return setTimeout(e,100)}))];case 6:h.sent(),h.label=7;case 7:return n++,[3,1];case 8:return console.log("Message batch sending complete."),[2]}}))}))},n=function(){return Ov(l,void 0,void 0,(function(){var r;return Dv(this,(function(n){switch(n.label){case 0:return r=kn(pv,{clusterId:42,shard:0}),console.log("Subscribing to messages..."),[4,e.filter.subscribe(r,(function(e){console.log("Raw Waku message received, payload length:",e.payload.length);var r=function(e){try{var t=wv.decode(e);return{id:t.id,timestamp:Number(t.timestamp),senderPeerId:t.senderPeerId,content:t.content}}catch(e){return console.error("Failed to decode message:",e),null}}(e.payload);r?(console.log("Decoded chat message:",r),r.senderPeerId===t?(Cv++,Ev&&(Ev.textContent=Cv.toString()),console.log("Received own message (loopback):",r.id)):(_v++,Sv&&(Sv.textContent=_v.toString()),Lv(r),console.log("Received message from other peer:",r.id))):console.warn("Could not decode received Waku message. Payload might be malformed or not a ChatMessage.")}))];case 1:return n.sent(),console.log("Subscription active."),[2]}}))}))},(s=document.getElementById("sendMessageButton"))&&s.addEventListener("click",(function(){console.log("Send Message Button clicked"),r()})),(i=document.getElementById("searchButton"))&&i.addEventListener("click",(function(){console.log("Search button clicked"),Rv(Nv())})),(o=document.getElementById("searchInput"))&&o.addEventListener("input",(function(){console.log("Search input changed"),Rv(Nv())})),[4,n()];case 2:return u.sent(),console.log("Application setup complete. Click 'Send New Message Batch' to send messages."),[3,4];case 3:return a=u.sent(),console.error("Critical error during app initialization:",a),(c=document.getElementById("peerIdDisplay"))&&(c.textContent="Error connecting to Waku Network."),[3,4];case 4:return[2]}}))}))}()}))})()})(); //# sourceMappingURL=index.js.map \ No newline at end of file diff --git a/dogfooding/index.js.map b/dogfooding/index.js.map index a963160..085d41e 100644 --- a/dogfooding/index.js.map +++ b/dogfooding/index.js.map @@ -1 +1 @@ -{"version":3,"file":"index.js","mappings":";uCAAAA,EAAOC,QAAU,SAAUC,GAEzB,IAAKA,EAAK,MAAMC,MAAM,iEAEtB,IAAIC,EAAO,EAAGC,EAAQC,OAAOC,OAAO,MAAOC,EAASF,OAAOC,OAAO,MAElE,SAASE,EAAQC,EAAKC,GACpBN,EAAMK,GAAOC,IACbP,GACWF,IACTE,EAAO,EACPI,EAASH,EACTA,EAAQC,OAAOC,OAAO,MAE1B,CAEA,MAAO,CACLK,IAAK,SAAUF,GACb,YAAsBG,IAAfR,EAAMK,SAAsCG,IAAhBL,EAAOE,EAC5C,EACAI,OAAQ,SAAUJ,QACEG,IAAfR,EAAMK,KACPL,EAAMK,QAAOG,QACIA,IAAhBL,EAAOE,KACRF,EAAOE,QAAOG,EAClB,EACAE,IAAK,SAAUL,GACb,IAAIM,EAAIX,EAAMK,GACd,YAASG,IAANG,EAAwBA,OACFH,KAArBG,EAAIR,EAAOE,KACbD,EAAOC,EAAKM,GACLA,QAFT,CAIF,EACAC,IAAK,SAAUP,EAAKC,QACAE,IAAfR,EAAMK,GAAoBL,EAAMK,GAAOC,EACrCF,EAAOC,EAAKC,EACnB,EACAO,MAAO,WACLb,EAAQC,OAAOC,OAAO,MACtBC,EAASF,OAAOC,OAAO,KACzB,EAEJ,wBCzCA,IAAIK,EAAMN,OAAOa,UAAUC,eACvBC,EAAS,IASb,SAASC,IAAU,CA4BnB,SAASC,EAAGC,EAAIC,EAASC,GACvBC,KAAKH,GAAKA,EACVG,KAAKF,QAAUA,EACfE,KAAKD,KAAOA,IAAQ,CACtB,CAaA,SAASE,EAAYC,EAASC,EAAON,EAAIC,EAASC,GAChD,GAAkB,mBAAPF,EACT,MAAM,IAAIO,UAAU,mCAGtB,IAAIC,EAAW,IAAIT,EAAGC,EAAIC,GAAWI,EAASH,GAC1CO,EAAMZ,EAASA,EAASS,EAAQA,EAMpC,OAJKD,EAAQK,QAAQD,GACXJ,EAAQK,QAAQD,GAAKT,GAC1BK,EAAQK,QAAQD,GAAO,CAACJ,EAAQK,QAAQD,GAAMD,GADhBH,EAAQK,QAAQD,GAAKE,KAAKH,IADlCH,EAAQK,QAAQD,GAAOD,EAAUH,EAAQO,gBAI7DP,CACT,CASA,SAASQ,EAAWR,EAASI,GACI,KAAzBJ,EAAQO,aAAoBP,EAAQK,QAAU,IAAIZ,SAC5CO,EAAQK,QAAQD,EAC9B,CASA,SAASK,IACPX,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,CACtB,CAzEI9B,OAAOC,SACTe,EAAOH,UAAYb,OAAOC,OAAO,OAM5B,IAAIe,GAASiB,YAAWlB,GAAS,IA2ExCiB,EAAanB,UAAUqB,WAAa,WAClC,IACIC,EACAC,EAFAC,EAAQ,GAIZ,GAA0B,IAAtBhB,KAAKS,aAAoB,OAAOO,EAEpC,IAAKD,KAASD,EAASd,KAAKO,QACtBtB,EAAIgC,KAAKH,EAAQC,IAAOC,EAAMR,KAAKd,EAASqB,EAAKG,MAAM,GAAKH,GAGlE,OAAIpC,OAAOwC,sBACFH,EAAMI,OAAOzC,OAAOwC,sBAAsBL,IAG5CE,CACT,EASAL,EAAanB,UAAU6B,UAAY,SAAmBlB,GACpD,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCmB,EAAWtB,KAAKO,QAAQD,GAE5B,IAAKgB,EAAU,MAAO,GACtB,GAAIA,EAASzB,GAAI,MAAO,CAACyB,EAASzB,IAElC,IAAK,IAAI0B,EAAI,EAAGC,EAAIF,EAASG,OAAQC,EAAK,IAAIC,MAAMH,GAAID,EAAIC,EAAGD,IAC7DG,EAAGH,GAAKD,EAASC,GAAG1B,GAGtB,OAAO6B,CACT,EASAf,EAAanB,UAAUoC,cAAgB,SAAuBzB,GAC5D,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCkB,EAAYrB,KAAKO,QAAQD,GAE7B,OAAKe,EACDA,EAAUxB,GAAW,EAClBwB,EAAUI,OAFM,CAGzB,EASAd,EAAanB,UAAUqC,KAAO,SAAc1B,EAAO2B,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAI5B,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAO,EAE/B,IAEI6B,EACAZ,EAHAF,EAAYrB,KAAKO,QAAQD,GACzB8B,EAAMC,UAAUZ,OAIpB,GAAIJ,EAAUxB,GAAI,CAGhB,OAFIwB,EAAUtB,MAAMC,KAAKsC,eAAenC,EAAOkB,EAAUxB,QAAIX,GAAW,GAEhEkD,GACN,KAAK,EAAG,OAAOf,EAAUxB,GAAGoB,KAAKI,EAAUvB,UAAU,EACrD,KAAK,EAAG,OAAOuB,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,IAAK,EACzD,KAAK,EAAG,OAAOT,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAOV,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAOX,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAOZ,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAKX,EAAI,EAAGY,EAAO,IAAIR,MAAMS,EAAK,GAAIb,EAAIa,EAAKb,IAC7CY,EAAKZ,EAAI,GAAKc,UAAUd,GAG1BF,EAAUxB,GAAG0C,MAAMlB,EAAUvB,QAASqC,EACxC,KAAO,CACL,IACIK,EADAf,EAASJ,EAAUI,OAGvB,IAAKF,EAAI,EAAGA,EAAIE,EAAQF,IAGtB,OAFIF,EAAUE,GAAGxB,MAAMC,KAAKsC,eAAenC,EAAOkB,EAAUE,GAAG1B,QAAIX,GAAW,GAEtEkD,GACN,KAAK,EAAGf,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,SAAU,MACpD,KAAK,EAAGuB,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,QAASgC,GAAK,MACxD,KAAK,EAAGT,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,QAASgC,EAAIC,GAAK,MAC5D,KAAK,EAAGV,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,QAASgC,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKG,EAAM,IAAKK,EAAI,EAAGL,EAAO,IAAIR,MAAMS,EAAK,GAAII,EAAIJ,EAAKI,IACxDL,EAAKK,EAAI,GAAKH,UAAUG,GAG1BnB,EAAUE,GAAG1B,GAAG0C,MAAMlB,EAAUE,GAAGzB,QAASqC,GAGpD,CAEA,OAAO,CACT,EAWAxB,EAAanB,UAAUiD,GAAK,SAAYtC,EAAON,EAAIC,GACjD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAWAa,EAAanB,UAAUO,KAAO,SAAcI,EAAON,EAAIC,GACrD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAYAa,EAAanB,UAAU8C,eAAiB,SAAwBnC,EAAON,EAAIC,EAASC,GAClF,IAAIO,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAON,KAC/B,IAAKH,EAEH,OADAa,EAAWV,KAAMM,GACVN,KAGT,IAAIqB,EAAYrB,KAAKO,QAAQD,GAE7B,GAAIe,EAAUxB,GAEVwB,EAAUxB,KAAOA,GACfE,IAAQsB,EAAUtB,MAClBD,GAAWuB,EAAUvB,UAAYA,GAEnCY,EAAWV,KAAMM,OAEd,CACL,IAAK,IAAIiB,EAAI,EAAGT,EAAS,GAAIW,EAASJ,EAAUI,OAAQF,EAAIE,EAAQF,KAEhEF,EAAUE,GAAG1B,KAAOA,GACnBE,IAASsB,EAAUE,GAAGxB,MACtBD,GAAWuB,EAAUE,GAAGzB,UAAYA,IAErCgB,EAAON,KAAKa,EAAUE,IAOtBT,EAAOW,OAAQzB,KAAKO,QAAQD,GAAyB,IAAlBQ,EAAOW,OAAeX,EAAO,GAAKA,EACpEJ,EAAWV,KAAMM,EACxB,CAEA,OAAON,IACT,EASAW,EAAanB,UAAUkD,mBAAqB,SAA4BvC,GACtE,IAAIG,EAUJ,OARIH,GACFG,EAAMZ,EAASA,EAASS,EAAQA,EAC5BH,KAAKO,QAAQD,IAAMI,EAAWV,KAAMM,KAExCN,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,GAGfT,IACT,EAKAW,EAAanB,UAAUmD,IAAMhC,EAAanB,UAAU8C,eACpD3B,EAAanB,UAAUS,YAAcU,EAAanB,UAAUiD,GAK5D9B,EAAaiC,SAAWlD,EAKxBiB,EAAaA,aAAeA,EAM1BtC,EAAOC,QAAUqC,8BCxUnB,IAAIkC,EAAQvE,EAERwE,EAAO,EAAQ,MAEfC,EAAI,CACJ,SACA,QACA,QACA,SACA,SACA,UACA,WACA,QACA,SACA,SACA,UACA,WACA,OACA,SACA,SAGJ,SAASC,EAAKC,EAAQC,GAClB,IAAI3B,EAAI,EAAG4B,EAAI,CAAC,EAEhB,IADAD,GAAU,EACH3B,EAAI0B,EAAOxB,QAAQ0B,EAAEJ,EAAExB,EAAI2B,IAAWD,EAAO1B,KACpD,OAAO4B,CACX,CAsBAN,EAAMO,MAAQJ,EAAK,CACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAwBnBH,EAAMQ,SAAWL,EAAK,CACH,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EACA,GACAF,EAAKQ,WACL,OAanBT,EAAMU,KAAOP,EAAK,CACC,EACA,EACA,EACA,EACA,GAChB,GAmBHH,EAAMW,OAASR,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAChB,GAoBHH,EAAMY,OAAST,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,gCCjMnB3E,EAAOC,QAwHP,SAAkBoF,GAGd,IAAIC,EAAMb,EAAKc,QAAQ,CAAC,KAAMF,EAAM3C,KAAO,UAAjC+B,CACT,oCADSA,CAEL,WAAY,mBAEbe,EAAiB,CAAC,EADTH,EAAMI,YAERrC,QAAQkC,EAClB,YAED,IAAK,IAAIpC,EAAI,EAAGA,EAAsBmC,EAAMK,YAAYtC,SAAUF,EAAG,CACjE,IAAIyC,EAAQN,EAAMO,aAAa1C,GAAG2C,UAC9BC,EAAQ,IAAMrB,EAAKsB,SAASJ,EAAMjD,MAMtC,GAJIiD,EAAMK,UAAUV,EACnB,sCAAuCQ,EAAKH,EAAMjD,MAG/CiD,EAAMM,IAAOX,EACZ,yBAA0BQ,EADdR,CAER,WAAYY,EAAQP,EAAO,UAFnBL,CAGZ,wBAAyBQ,EAHbR,CAIZ,gCACGa,EAAab,EAAKK,EAAO,QACzBS,EAAed,EAAKK,EAAOzC,EAAG4C,EAAM,SAApCM,CACH,UAGE,GAAIT,EAAMU,SAAYf,EACxB,yBAA0BQ,EADFR,CAEpB,WAAYY,EAAQP,EAAO,SAFPL,CAGxB,gCAAiCQ,GAC9BM,EAAed,EAAKK,EAAOzC,EAAG4C,EAAM,MAApCM,CACH,SAGE,CACH,GAAIT,EAAMW,OAAQ,CACd,IAAIC,EAAY9B,EAAKsB,SAASJ,EAAMW,OAAO5D,MACD,IAAtC8C,EAAeG,EAAMW,OAAO5D,OAAa4C,EAChD,cAAeiB,EADiCjB,CAE5C,WAAYK,EAAMW,OAAO5D,KAAO,qBACjC8C,EAAeG,EAAMW,OAAO5D,MAAQ,EACpC4C,EACH,QAASiB,EACV,CACAH,EAAed,EAAKK,EAAOzC,EAAG4C,EAClC,CACIH,EAAMK,UAAUV,EACnB,IACL,CACA,OAAOA,EACN,cAEL,EA7KA,IAAIkB,EAAY,EAAQ,MACpB/B,EAAY,EAAQ,MAExB,SAASyB,EAAQP,EAAOc,GACpB,OAAOd,EAAMjD,KAAO,KAAO+D,GAAYd,EAAMU,UAAyB,UAAbI,EAAuB,KAAOd,EAAMM,KAAoB,WAAbQ,EAAwB,MAAMd,EAAMe,QAAQ,IAAM,IAAM,WAChK,CAWA,SAASN,EAAed,EAAKK,EAAOgB,EAAYb,GAE5C,GAAIH,EAAMiB,aACN,GAAIjB,EAAMiB,wBAAwBJ,EAAM,CAAElB,EACrC,cAAeQ,EADsBR,CAEjC,WAFiCA,CAG7B,WAAYY,EAAQP,EAAO,eACpC,IAAK,IAAIkB,EAAOvG,OAAOuG,KAAKlB,EAAMiB,aAAahC,QAAST,EAAI,EAAGA,EAAI0C,EAAKzD,SAAUe,EAAGmB,EAChF,WAAYK,EAAMiB,aAAahC,OAAOiC,EAAK1C,KAChDmB,EACS,QADTA,CAEC,IACL,MACIA,EACC,IADDA,CAEK,8BAA+BqB,EAAYb,EAFhDR,CAGK,QAHLA,CAIS,aAAcK,EAAMjD,KAAO,IAJpC4C,CAKC,UAGL,OAAQK,EAAMmB,MACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYxB,EACZ,0BAA2BQ,EADfR,CAER,WAAYY,EAAQP,EAAO,YAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYL,EACZ,kFAAmFQ,EAAKA,EAAKA,EAAKA,EADtFR,CAER,WAAYY,EAAQP,EAAO,iBAChC,MACJ,IAAK,QACL,IAAK,SAAUL,EACV,2BAA8BQ,EADpBR,CAEN,WAAYY,EAAQP,EAAO,WAChC,MACJ,IAAK,OAAQL,EACR,4BAA+BQ,EADvBR,CAEJ,WAAYY,EAAQP,EAAO,YAChC,MACJ,IAAK,SAAUL,EACV,yBAA0BQ,EADhBR,CAEN,WAAYY,EAAQP,EAAO,WAChC,MACJ,IAAK,QAASL,EACT,4DAA+DQ,EAAKA,EAAKA,EADhER,CAEL,WAAYY,EAAQP,EAAO,WAI5C,OAAOL,CAEX,CAUA,SAASa,EAAab,EAAKK,EAAOG,GAE9B,OAAQH,EAAMe,SACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYpB,EACZ,6BAA8BQ,EADlBR,CAER,WAAYY,EAAQP,EAAO,gBAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYL,EACZ,6BAA8BQ,EADlBR,CAER,WAAYY,EAAQP,EAAO,qBAChC,MACJ,IAAK,OAAQL,EACR,4BAA6BQ,EADrBR,CAEJ,WAAYY,EAAQP,EAAO,gBAGxC,OAAOL,CAEX,mCCjHAtF,EAAOC,QAAU8G,EAEjB,IAAIC,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,EAASC,GACd,OAAOA,EAAIC,QAAQJ,GAAY,SAASK,EAAIC,GACxC,OAAQA,GACJ,IAAK,KACL,IAAK,GACD,OAAOA,EACX,QACI,OAAOL,EAAYK,IAAO,GAEtC,GACJ,CA6DA,SAASd,EAASe,EAAQC,GAEtBD,EAASA,EAAOE,WAEhB,IAAInD,EAAS,EACTzB,EAAS0E,EAAO1E,OAChB6E,EAAO,EACPC,EAAkB,EAClBC,EAAW,CAAC,EAEZC,EAAQ,GAERC,EAAc,KASlB,SAASC,EAAQC,GACb,OAAOpI,MAAM,WAAaoI,EAAU,UAAYN,EAAO,IAC3D,CAyBA,SAASO,EAAOC,GACZ,OAAOX,EAAOU,OAAOC,EACzB,CAUA,SAASC,EAAWC,EAAOC,EAAKC,GAC5B,IAYIC,EAZAC,EAAU,CACVjC,KAAMgB,EAAOU,OAAOG,KACpBK,WAAW,EACXC,QAASJ,GAQTK,EAAgBP,GALhBZ,EACW,EAEA,GAIf,GACI,KAAMmB,EAAgB,GACyB,QAAtCJ,EAAIhB,EAAOU,OAAOU,IAA0B,CACjDH,EAAQC,WAAY,EACpB,KACJ,QACW,MAANF,GAAmB,OAANA,GAItB,IAHA,IAAIK,EAAQrB,EACPsB,UAAUT,EAAOC,GACjBS,MAAMhC,GACFnE,EAAI,EAAGA,EAAIiG,EAAM/F,SAAUF,EAChCiG,EAAMjG,GAAKiG,EAAMjG,GACZyE,QAAQI,EAAuBX,EAAkBD,EAAc,IAC/DmC,OACTP,EAAQQ,KAAOJ,EACVK,KAAK,MACLF,OAELnB,EAASF,GAAQc,EACjBb,EAAkBD,CACtB,CAEA,SAASwB,EAAyBC,GAC9B,IAAIC,EAAYC,EAAcF,GAG1BG,EAAW/B,EAAOsB,UAAUM,EAAaC,GAE7C,MADgB,WAAWG,KAAKD,EAEpC,CAEA,SAASD,EAAcG,GAGnB,IADA,IAAIJ,EAAYI,EACTJ,EAAYvG,GAAgC,OAAtBoF,EAAOmB,IAChCA,IAEJ,OAAOA,CACX,CAOA,SAASK,IACL,GAAI5B,EAAMhF,OAAS,EACf,OAAOgF,EAAM6B,QACjB,GAAI5B,EACA,OA7FR,WACI,IAAI6B,EAAqB,MAAhB7B,EAAsBnB,EAAiBD,EAChDiD,EAAGC,UAAYtF,EAAS,EACxB,IAAIuF,EAAQF,EAAGG,KAAKvC,GACpB,IAAKsC,EACD,MAAM9B,EAAQ,UAIlB,OAHAzD,EAASqF,EAAGC,UACZhI,EAAKkG,GACLA,EAAc,KACPZ,EAAS2C,EAAM,GAC1B,CAmFeE,GACX,IAAIC,EACAC,EACAC,EACA9B,EACA+B,EACAC,EAA8B,IAAX9F,EACvB,EAAG,CACC,GAAIA,IAAWzB,EACX,OAAO,KAEX,IADAmH,GAAS,EACFjD,EAAawC,KAAKW,EAAOjC,EAAO3D,KAKnC,GAJa,OAAT4F,IACAE,GAAmB,IACjB1C,KAEApD,IAAWzB,EACb,OAAO,KAGf,GAAuB,MAAnBoF,EAAO3D,GAAiB,CACxB,KAAMA,IAAWzB,EACb,MAAMkF,EAAQ,WAElB,GAAuB,MAAnBE,EAAO3D,GACP,GAAKkD,EAkBE,CAIH,GAFAY,EAAQ9D,EACR6F,GAAQ,EACJjB,EAAyB5E,EAAS,GAAI,CACtC6F,GAAQ,EACR,EAAG,CAEC,IADA7F,EAAS+E,EAAc/E,MACRzB,EACX,MAGJ,GADAyB,KACK8F,EAED,KAER,OAASlB,EAAyB5E,GACtC,MACIA,EAAS+F,KAAKC,IAAIzH,EAAQwG,EAAc/E,GAAU,GAElD6F,IACAhC,EAAWC,EAAO9D,EAAQ8F,GAC1BA,GAAmB,GAEvB1C,IACAsC,GAAS,CACb,KA5C2B,CAIvB,IAFAG,EAAuC,MAA/BlC,EAAOG,EAAQ9D,EAAS,GAEJ,OAArB2D,IAAS3D,IACZ,GAAIA,IAAWzB,EACX,OAAO,OAGbyB,EACE6F,IACAhC,EAAWC,EAAO9D,EAAS,EAAG8F,GAG9BA,GAAmB,KAErB1C,EACFsC,GAAS,CACb,KA2BG,IAAgC,OAA3BE,EAAOjC,EAAO3D,IAqBtB,MAAO,IAnBP8D,EAAQ9D,EAAS,EACjB6F,EAAQ3C,GAA0C,MAAlBS,EAAOG,GACvC,EAAG,CAIC,GAHa,OAAT8B,KACExC,IAEApD,IAAWzB,EACb,MAAMkF,EAAQ,WAElBkC,EAAOC,EACPA,EAAOjC,EAAO3D,EAClB,OAAkB,MAAT2F,GAAyB,MAATC,KACvB5F,EACE6F,IACAhC,EAAWC,EAAO9D,EAAS,EAAG8F,GAC9BA,GAAmB,GAEvBJ,GAAS,CAGb,CACJ,CACJ,OAASA,GAIT,IAAI3B,EAAM/D,EAGV,GAFAmC,EAAQmD,UAAY,GACRnD,EAAQ8C,KAAKtB,EAAOI,MAE5B,KAAOA,EAAMxF,IAAW4D,EAAQ8C,KAAKtB,EAAOI,OACtCA,EACV,IAAIkC,EAAQhD,EAAOsB,UAAUvE,EAAQA,EAAS+D,GAG9C,MAFc,MAAVkC,GAA4B,MAAVA,IAClBzC,EAAcyC,GACXA,CACX,CAQA,SAAS3I,EAAK2I,GACV1C,EAAMjG,KAAK2I,EACf,CAOA,SAASC,IACL,IAAK3C,EAAMhF,OAAQ,CACf,IAAI0H,EAAQd,IACZ,GAAc,OAAVc,EACA,OAAO,KACX3I,EAAK2I,EACT,CACA,OAAO1C,EAAM,EACjB,CAmDA,OAAO9H,OAAO0K,eAAe,CACzBhB,KAAMA,EACNe,KAAMA,EACN5I,KAAMA,EACN8I,KA7CJ,SAAcxE,EAAUT,GACpB,IAAIkF,EAASH,IAEb,GADaG,IAAWzE,EAGpB,OADAuD,KACO,EAEX,IAAKhE,EACD,MAAMsC,EAAQ,UAAY4C,EAAS,OAASzE,EAAW,cAC3D,OAAO,CACX,EAoCI0E,KA5BJ,SAAcC,GACV,IACIrC,EADAsC,EAAM,KAmBV,YAjBqBxK,IAAjBuK,GACArC,EAAUZ,EAASF,EAAO,UACnBE,EAASF,EAAO,GACnBc,IAAYhB,GAAyC,MAAjBgB,EAAQjC,MAAgBiC,EAAQC,aACpEqC,EAAMtC,EAAQE,QAAUF,EAAQQ,KAAO,QAIvCrB,EAAkBkD,GAClBL,IAEJhC,EAAUZ,EAASiD,UACZjD,EAASiD,IACZrC,GAAYA,EAAQC,YAAcjB,GAAyC,MAAjBgB,EAAQjC,OAClEuE,EAAMtC,EAAQE,QAAU,KAAOF,EAAQQ,OAGxC8B,CACX,GAQG,OAAQ,CACPtK,IAAK,WAAa,OAAOkH,CAAM,GAGvC,CAxXAlB,EAASU,SAAWA,8BCrCpB,MAAM6D,EAAmB,EAAQ,MACjCrL,EAAQ,GAAgBqL,EAAiBC,cAQvBD,EAAiBC,6BCwRnCvL,EAAOC,QA7RP,SAAeuL,GAqDd,SAASC,EAAYC,GACpB,IAAIC,EAEAC,EACAC,EAFAC,EAAiB,KAIrB,SAASC,KAASjI,GAEjB,IAAKiI,EAAMC,QACV,OAGD,MAAMC,EAAOF,EAGPtB,EAAOyB,OAAO,IAAIC,MAClBC,EAAK3B,GAAQkB,GAAYlB,GAC/BwB,EAAKI,KAAOD,EACZH,EAAKzB,KAAOmB,EACZM,EAAKxB,KAAOA,EACZkB,EAAWlB,EAEX3G,EAAK,GAAK2H,EAAYa,OAAOxI,EAAK,IAEX,iBAAZA,EAAK,IAEfA,EAAKyI,QAAQ,MAId,IAAIC,EAAQ,EACZ1I,EAAK,GAAKA,EAAK,GAAG6D,QAAQ,iBAAiB,CAACyC,EAAOqC,KAElD,GAAc,OAAVrC,EACH,MAAO,IAERoC,IACA,MAAME,EAAYjB,EAAYkB,WAAWF,GACzC,GAAyB,mBAAdC,EAA0B,CACpC,MAAME,EAAM9I,EAAK0I,GACjBpC,EAAQsC,EAAU9J,KAAKqJ,EAAMW,GAG7B9I,EAAK+I,OAAOL,EAAO,GACnBA,GACD,CACA,OAAOpC,CAAK,IAIbqB,EAAYqB,WAAWlK,KAAKqJ,EAAMnI,IAEpBmI,EAAKc,KAAOtB,EAAYsB,KAChC7I,MAAM+H,EAAMnI,EACnB,CAgCA,OA9BAiI,EAAML,UAAYA,EAClBK,EAAMiB,UAAYvB,EAAYuB,YAC9BjB,EAAMkB,MAAQxB,EAAYyB,YAAYxB,GACtCK,EAAMoB,OAASA,EACfpB,EAAMqB,QAAU3B,EAAY2B,QAE5B9M,OAAO0K,eAAee,EAAO,UAAW,CACvCsB,YAAY,EACZC,cAAc,EACdvM,IAAK,IACmB,OAAnB+K,EACIA,GAEJF,IAAoBH,EAAY8B,aACnC3B,EAAkBH,EAAY8B,WAC9B1B,EAAeJ,EAAYO,QAAQN,IAG7BG,GAER5K,IAAKD,IACJ8K,EAAiB9K,CAAC,IAKY,mBAArByK,EAAY+B,MACtB/B,EAAY+B,KAAKzB,GAGXA,CACR,CAEA,SAASoB,EAAOzB,EAAW+B,GAC1B,MAAMC,EAAWjC,EAAY9J,KAAK+J,gBAAkC,IAAd+B,EAA4B,IAAMA,GAAa/B,GAErG,OADAgC,EAASX,IAAMpL,KAAKoL,IACbW,CACR,CAuCA,SAASC,EAAgBC,EAAQC,GAChC,IAAIC,EAAc,EACdC,EAAgB,EAChBC,GAAa,EACbC,EAAa,EAEjB,KAAOH,EAAcF,EAAOxK,QAC3B,GAAI2K,EAAgBF,EAASzK,SAAWyK,EAASE,KAAmBH,EAAOE,IAA4C,MAA5BD,EAASE,IAEnE,MAA5BF,EAASE,IACZC,EAAYD,EACZE,EAAaH,EACbC,MAEAD,IACAC,SAEK,KAAmB,IAAfC,EAMV,OAAO,EAJPD,EAAgBC,EAAY,EAC5BC,IACAH,EAAcG,CAGf,CAID,KAAOF,EAAgBF,EAASzK,QAAsC,MAA5ByK,EAASE,IAClDA,IAGD,OAAOA,IAAkBF,EAASzK,MACnC,CAgEA,OAzRAqI,EAAYM,MAAQN,EACpBA,EAAYyC,QAAUzC,EACtBA,EAAYa,OAsQZ,SAAgBM,GACf,OAAIA,aAAezM,MACXyM,EAAIxE,OAASwE,EAAIuB,QAElBvB,CACR,EA1QAnB,EAAY2C,QA8NZ,WACC,MAAMb,EAAa,IACf9B,EAAY9I,SACZ8I,EAAY4C,MAAMpI,KAAIyF,GAAa,IAAMA,KAC3ClC,KAAK,KAEP,OADAiC,EAAY6C,OAAO,IACZf,CACR,EApOA9B,EAAY6C,OAsJZ,SAAgBf,GACf9B,EAAY8C,KAAKhB,GACjB9B,EAAY8B,WAAaA,EAEzB9B,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAEpB,MAAMhF,GAA+B,iBAAfkE,EAA0BA,EAAa,IAC3DjE,OACA3B,QAAQ,IAAK,KACb0B,MAAM,KACNmF,OAAOC,SAET,IAAK,MAAMC,KAAMrF,EACF,MAAVqF,EAAG,GACNjD,EAAY4C,MAAMlM,KAAKuM,EAAG7L,MAAM,IAEhC4I,EAAY9I,MAAMR,KAAKuM,EAG1B,EAzKAjD,EAAYO,QA4OZ,SAAiBtJ,GAChB,IAAK,MAAMuI,KAAQQ,EAAY4C,MAC9B,GAAIV,EAAgBjL,EAAMuI,GACzB,OAAO,EAIT,IAAK,MAAMyD,KAAMjD,EAAY9I,MAC5B,GAAIgL,EAAgBjL,EAAMgM,GACzB,OAAO,EAIT,OAAO,CACR,EAzPAjD,EAAYkD,SAAW,EAAQ,MAC/BlD,EAAY2B,QA4QZ,WACCwB,QAAQC,KAAK,wIACd,EA5QAvO,OAAOuG,KAAK2E,GAAKsD,SAAQpO,IACxB+K,EAAY/K,GAAO8K,EAAI9K,EAAI,IAO5B+K,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAOpB5C,EAAYkB,WAAa,CAAC,EAkB1BlB,EAAYyB,YAVZ,SAAqBxB,GACpB,IAAIqD,EAAO,EAEX,IAAK,IAAI7L,EAAI,EAAGA,EAAIwI,EAAUtI,OAAQF,IACrC6L,GAASA,GAAQ,GAAKA,EAAQrD,EAAUsD,WAAW9L,GACnD6L,GAAQ,EAGT,OAAOtD,EAAYwD,OAAOrE,KAAKsE,IAAIH,GAAQtD,EAAYwD,OAAO7L,OAC/D,EA6OAqI,EAAY6C,OAAO7C,EAAY0D,QAExB1D,CACR,8BC5RA,IAAI2D,EAAYnP,EAEZuG,EAAO,EAAQ,MACf/B,EAAO,EAAQ,MAWnB,SAAS4K,EAA2B/J,EAAKK,EAAOgB,EAAY2I,GACxD,IAAIC,GAAwB,EAE5B,GAAI5J,EAAMiB,aACN,GAAIjB,EAAMiB,wBAAwBJ,EAAM,CAAElB,EACrC,eAAgBgK,GACjB,IAAK,IAAI1K,EAASe,EAAMiB,aAAahC,OAAQiC,EAAOvG,OAAOuG,KAAKjC,GAAS1B,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAE3F0B,EAAOiC,EAAK3D,MAAQyC,EAAM6J,aAAgBD,IAAyBjK,EAClE,WADkEA,CAE9D,4CAA+CgK,EAAMA,EAAMA,GAC3D3J,EAAMU,UAAUf,EAEhB,SACLiK,GAAwB,GAE5BjK,EACC,UAAWuB,EAAK3D,GADjBoC,CAEC,WAAYV,EAAOiC,EAAK3D,IAFzBoC,CAGK,SAAUgK,EAAM1K,EAAOiC,EAAK3D,IAHjCoC,CAIK,SACPA,EACD,IACL,MAAOA,EACF,4BAA+BgK,EAD7BhK,CAEE,sBAAuBK,EAAM8J,SAAW,oBAF1CnK,CAGF,gCAAiCgK,EAAM3I,EAAY2I,OACrD,CACH,IAAII,GAAa,EACjB,OAAQ/J,EAAMmB,MACV,IAAK,SACL,IAAK,QAASxB,EACT,kBAAmBgK,EAAMA,GAC1B,MACJ,IAAK,SACL,IAAK,UAAWhK,EACX,cAAegK,EAAMA,GACtB,MACJ,IAAK,QACL,IAAK,SACL,IAAK,WAAYhK,EACZ,YAAagK,EAAMA,GACpB,MACJ,IAAK,SACDI,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYpK,EACZ,gBADYA,CAER,6CAA8CgK,EAAMA,EAAMI,EAFlDpK,CAGZ,iCAAoCgK,EAHxBhK,CAIR,uBAAwBgK,EAAMA,EAJtBhK,CAKZ,iCAAoCgK,EALxBhK,CAMR,UAAWgK,EAAMA,EANThK,CAOZ,iCAAoCgK,EAPxBhK,CAQR,+DAAgEgK,EAAMA,EAAMA,EAAMI,EAAa,OAAS,IAC7G,MACJ,IAAK,QAASpK,EACT,4BAA+BgK,EADtBhK,CAEL,wEAAyEgK,EAAMA,EAAMA,EAFhFhK,CAGT,2BAA4BgK,EAHnBhK,CAIL,UAAWgK,EAAMA,GACtB,MACJ,IAAK,SAAUhK,EACV,kBAAmBgK,EAAMA,GAC1B,MACJ,IAAK,OAAQhK,EACR,mBAAoBgK,EAAMA,GAMvC,CACA,OAAOhK,CAEX,CAiEA,SAASqK,EAAyBrK,EAAKK,EAAOgB,EAAY2I,GAEtD,GAAI3J,EAAMiB,aACFjB,EAAMiB,wBAAwBJ,EAAMlB,EACnC,yFAA0FgK,EAAM3I,EAAY2I,EAAMA,EAAM3I,EAAY2I,EAAMA,GAC1IhK,EACA,gCAAiCgK,EAAM3I,EAAY2I,OACrD,CACH,IAAII,GAAa,EACjB,OAAQ/J,EAAMmB,MACV,IAAK,SACL,IAAK,QAASxB,EACb,6CAA8CgK,EAAMA,EAAMA,EAAMA,GAC7D,MACJ,IAAK,SACDI,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYpK,EAChB,4BAA+BgK,EADfhK,CAEZ,uCAAwCgK,EAAMA,EAAMA,EAFxChK,CAGhB,OAHgBA,CAIZ,4IAA6IgK,EAAMA,EAAMA,EAAMA,EAAMI,EAAa,OAAQ,GAAIJ,GAC/L,MACJ,IAAK,QAAShK,EACb,gHAAiHgK,EAAMA,EAAMA,EAAMA,EAAMA,GACtI,MACJ,QAAShK,EACR,UAAWgK,EAAMA,GAG1B,CACA,OAAOhK,CAEX,CA9FA8J,EAAUQ,WAAa,SAAoBvK,GAEvC,IAAIwK,EAASxK,EAAMK,YACfJ,EAAMb,EAAKc,QAAQ,CAAC,KAAMF,EAAM3C,KAAO,cAAjC+B,CACT,6BADSA,CAEL,YACL,IAAKoL,EAAOzM,OAAQ,OAAOkC,EAC1B,wBACDA,EACC,uBACD,IAAK,IAAIpC,EAAI,EAAGA,EAAI2M,EAAOzM,SAAUF,EAAG,CACpC,IAAIyC,EAASkK,EAAO3M,GAAG2C,UACnByJ,EAAS7K,EAAKsB,SAASJ,EAAMjD,MAG7BiD,EAAMM,KAAOX,EACpB,WAAYgK,EADQhK,CAEhB,4BAA+BgK,EAFfhK,CAGZ,sBAAuBK,EAAM8J,SAAW,oBAH5BnK,CAIhB,SAAUgK,EAJMhK,CAKhB,oDAAqDgK,GAClDD,EAA2B/J,EAAKK,EAAwBzC,EAAGoM,EAAO,UAAlED,CACH,IADGA,CAEP,MAGc1J,EAAMU,UAAYf,EAChC,WAAYgK,EADoBhK,CAE5B,0BAA2BgK,EAFChK,CAGxB,sBAAuBK,EAAM8J,SAAW,mBAHhBnK,CAI5B,SAAUgK,EAJkBhK,CAK5B,iCAAkCgK,GAC/BD,EAA2B/J,EAAKK,EAAwBzC,EAAGoM,EAAO,MAAlED,CACH,IADGA,CAEP,OAIa1J,EAAMiB,wBAAwBJ,GAAOlB,EAClD,iBAAkBgK,GACfD,EAA2B/J,EAAKK,EAAwBzC,EAAGoM,GACjD3J,EAAMiB,wBAAwBJ,GAAOlB,EAClD,KAED,CAAE,OAAOA,EACR,WAEL,EAsDA8J,EAAUU,SAAW,SAAkBzK,GAEnC,IAAIwK,EAASxK,EAAMK,YAAY7C,QAAQkN,KAAKtL,EAAKuL,mBACjD,IAAKH,EAAOzM,OACR,OAAOqB,EAAKc,SAALd,CAAe,aAU1B,IATA,IAAIa,EAAMb,EAAKc,QAAQ,CAAC,IAAK,KAAMF,EAAM3C,KAAO,YAAtC+B,CACT,SADSA,CAEL,OAFKA,CAGT,YAEGwL,EAAiB,GACjBC,EAAY,GACZC,EAAe,GACfjN,EAAI,EACDA,EAAI2M,EAAOzM,SAAUF,EACnB2M,EAAO3M,GAAGoD,SACTuJ,EAAO3M,GAAG2C,UAAUQ,SAAW4J,EAC/BJ,EAAO3M,GAAG+C,IAAMiK,EAChBC,GAAchO,KAAK0N,EAAO3M,IAEpC,GAAI+M,EAAe7M,OAAQ,CAEvB,IAFyBkC,EAC5B,6BACQpC,EAAI,EAAGA,EAAI+M,EAAe7M,SAAUF,EAAGoC,EAC3C,SAAUb,EAAKsB,SAASkK,EAAe/M,GAAGR,OAC3C4C,EACH,IACD,CAEA,GAAI4K,EAAU9M,OAAQ,CAElB,IAFoBkC,EACvB,8BACQpC,EAAI,EAAGA,EAAIgN,EAAU9M,SAAUF,EAAGoC,EACtC,SAAUb,EAAKsB,SAASmK,EAAUhN,GAAGR,OACtC4C,EACH,IACD,CAEA,GAAI6K,EAAa/M,OAAQ,CAErB,IAFuBkC,EAC1B,mBACQpC,EAAI,EAAGA,EAAIiN,EAAa/M,SAAUF,EAAG,CACtC,IAAIyC,EAAQwK,EAAajN,GACrBoM,EAAQ7K,EAAKsB,SAASJ,EAAMjD,MAChC,GAAIiD,EAAMiB,wBAAwBJ,EAAMlB,EAC3C,6BAA8BgK,EAAM3J,EAAMiB,aAAawJ,WAAWzK,EAAM6J,aAAc7J,EAAM6J,kBACpF,GAAI7J,EAAMT,KAAMI,EACxB,iBADwBA,CAEpB,gCAAiCK,EAAM6J,YAAYa,IAAK1K,EAAM6J,YAAYc,KAAM3K,EAAM6J,YAAYe,SAF9EjL,CAGpB,oEAAqEgK,EAHjDhK,CAIxB,QAJwBA,CAKpB,6BAA8BgK,EAAM3J,EAAM6J,YAAYxH,WAAYrC,EAAM6J,YAAYgB,iBAChF,GAAI7K,EAAM8K,MAAO,CAClB,IAAIC,EAAe,IAAMpN,MAAMnC,UAAU0B,MAAMD,KAAK+C,EAAM6J,aAAahG,KAAK,KAAO,IACnFlE,EACP,6BAA8BgK,EAAMqB,OAAOC,aAAa1M,MAAMyM,OAAQhL,EAAM6J,aADrElK,CAEP,QAFOA,CAGH,SAAUgK,EAAMoB,EAHbpL,CAIH,6CAA8CgK,EAAMA,EAJjDhK,CAKP,IACG,MAAOA,EACV,SAAUgK,EAAM3J,EAAM6J,YACvB,CAAElK,EACL,IACD,CACA,IAAIuL,GAAS,EACb,IAAK3N,EAAI,EAAGA,EAAI2M,EAAOzM,SAAUF,EAAG,CAC5ByC,EAAQkK,EAAO3M,GAAnB,IACIsJ,EAAQnH,EAAMO,aAAakL,QAAQnL,GACnC2J,EAAQ7K,EAAKsB,SAASJ,EAAMjD,MAC5BiD,EAAMM,KACD4K,IAAUA,GAAS,EAAMvL,EACrC,YACSA,EACT,0CAA2CgK,EAAMA,EADxChK,CAEL,SAAUgK,EAFLhK,CAGL,kCACGqK,EAAyBrK,EAAKK,EAAoB6G,EAAO8C,EAAO,WAAhEK,CACH,MACUhK,EAAMU,UAAYf,EAChC,uBAAwBgK,EAAMA,EADEhK,CAE5B,SAAUgK,EAFkBhK,CAG5B,iCAAkCgK,GAC/BK,EAAyBrK,EAAKK,EAAoB6G,EAAO8C,EAAO,MAAhEK,CACH,OACQrK,EACZ,uCAAwCgK,EAAM3J,EAAMjD,MACjDiN,EAAyBrK,EAAKK,EAAoB6G,EAAO8C,GACrD3J,EAAMW,QAAQhB,EACjB,eADiBA,CAEb,SAAUb,EAAKsB,SAASJ,EAAMW,OAAO5D,MAAOiD,EAAMjD,OAEvD4C,EACH,IACD,CACA,OAAOA,EACN,WAEL,8BC3SAtF,EAAOC,QAAU8Q,EAGjB,IAAIC,EAAS,EAAQ,OACpBD,EAAa5P,UAAYb,OAAOC,OAAOyQ,EAAO7P,YAAY8P,YAAcF,EAEzE,IAAItM,EAAO,EAAQ,MAQnB,SAASsM,IACLC,EAAOpO,KAAKjB,KAChB,CAuCA,SAASuP,EAAkBtE,EAAKuE,EAAK1I,GAC7BmE,EAAIxJ,OAAS,GACbqB,EAAK2M,KAAKC,MAAMzE,EAAKuE,EAAK1I,GACrB0I,EAAIG,UACTH,EAAIG,UAAU1E,EAAKnE,GAEnB0I,EAAIE,MAAMzE,EAAKnE,EACvB,CA5CAsI,EAAaQ,WAAa,WAOtBR,EAAaS,MAAQ/M,EAAKgN,oBAE1BV,EAAaW,iBAAmBjN,EAAKkN,QAAUlN,EAAKkN,OAAOxQ,qBAAqByQ,YAAiD,QAAnCnN,EAAKkN,OAAOxQ,UAAUF,IAAIyB,KAClH,SAA8BkK,EAAKuE,EAAK1I,GACxC0I,EAAIlQ,IAAI2L,EAAKnE,EAEf,EAEE,SAA+BmE,EAAKuE,EAAK1I,GACzC,GAAImE,EAAIiF,KACNjF,EAAIiF,KAAKV,EAAK1I,EAAK,EAAGmE,EAAIxJ,aACvB,IAAK,IAAIF,EAAI,EAAGA,EAAI0J,EAAIxJ,QAC3B+N,EAAI1I,KAASmE,EAAI1J,IACrB,CACR,EAMA6N,EAAa5P,UAAUsP,MAAQ,SAA4B9P,GACnD8D,EAAKqN,SAASnR,KACdA,EAAQ8D,EAAKsN,aAAapR,EAAO,WACrC,IAAIoD,EAAMpD,EAAMyC,SAAW,EAI3B,OAHAzB,KAAKqQ,OAAOjO,GACRA,GACApC,KAAKsQ,MAAMlB,EAAaW,iBAAkB3N,EAAKpD,GAC5CgB,IACX,EAcAoP,EAAa5P,UAAU+Q,OAAS,SAA6BvR,GACzD,IAAIoD,EAAMU,EAAKkN,OAAOQ,WAAWxR,GAIjC,OAHAgB,KAAKqQ,OAAOjO,GACRA,GACApC,KAAKsQ,MAAMf,EAAmBnN,EAAKpD,GAChCgB,IACX,EAUAoP,EAAaQ,0CCnFbvR,EAAOC,QA0BP,SAAiBoF,GAWb,IATA,IAIOS,EAJHR,EAAMb,EAAKc,QAAQ,CAAC,IAAK,KAAMF,EAAM3C,KAAO,UAAtC+B,CACT,SADSA,CAEL,qBAKDoL,EAA2BxK,EAAMK,YAAY7C,QAAQkN,KAAKtL,EAAKuL,mBAE1D9M,EAAI,EAAGA,EAAI2M,EAAOzM,SAAUF,EAAG,CACpC,IAAIyC,EAAWkK,EAAO3M,GAAG2C,UACrB2G,EAAWnH,EAAMO,aAAakL,QAAQnL,GACtCmB,EAAWnB,EAAMiB,wBAAwBJ,EAAO,QAAUb,EAAMmB,KAChEsL,EAAW5N,EAAMO,MAAM+B,GACvBhB,EAAW,IAAMrB,EAAKsB,SAASJ,EAAMjD,MAGrCiD,EAAMM,KACNX,EACP,kDAAmDQ,EAAKH,EAAMjD,KADvD4C,CAEH,mDAAoDQ,EAFjDR,CAGC,4CAA6CK,EAAM0M,IAAM,EAAI,KAAO,EAAG,EAAI7N,EAAMW,OAAOQ,EAAMe,SAAUf,EAAMe,cAC9F7F,IAAbuR,EAAwB9M,EAC3B,oEAAqEkH,EAAO1G,GACxER,EACJ,qCAAsC,GAAK8M,EAAUtL,EAAMhB,GAC5DR,EACH,IADGA,CAEP,MAGcK,EAAMU,UAAYf,EAChC,2BAA4BQ,EAAKA,GAGtBH,EAAMP,aAAiCvE,IAAvB2D,EAAMY,OAAO0B,GAAuBxB,EAE3D,uBAAwBK,EAAM0M,IAAM,EAAI,KAAO,EAFY/M,CAG3D,+BAAgCQ,EAH2BR,CAIvD,cAAewB,EAAMhB,EAJkCR,CAK3D,eAGYA,EAEZ,+BAAgCQ,QACRjF,IAAbuR,EACRE,EAAehN,EAAKK,EAAO6G,EAAO1G,EAAM,OAC/BR,EACR,0BAA2BK,EAAM0M,IAAM,EAAID,KAAc,EAAGtL,EAAMhB,IAEjER,EACT,OAIWK,EAAMK,UAAUV,EAC3B,iDAAkDQ,EAAKH,EAAMjD,WAErC7B,IAAbuR,EACRE,EAAehN,EAAKK,EAAO6G,EAAO1G,GACzBR,EACR,uBAAwBK,EAAM0M,IAAM,EAAID,KAAc,EAAGtL,EAAMhB,GAGpE,CAEA,OAAOR,EACN,WAEL,EAhGA,IAAIkB,EAAW,EAAQ,MACnBhC,EAAW,EAAQ,KACnBC,EAAW,EAAQ,MAWvB,SAAS6N,EAAehN,EAAKK,EAAOgB,EAAYb,GAC5C,OAAOH,EAAM4M,UACPjN,EAAI,+CAAgDqB,EAAYb,GAAMH,EAAM0M,IAAM,EAAI,KAAO,GAAI1M,EAAM0M,IAAM,EAAI,KAAO,GACxH/M,EAAI,oDAAqDqB,EAAYb,GAAMH,EAAM0M,IAAM,EAAI,KAAO,EAC5G,kBCpBA,OASA,WACE,aAEA,IAAIG,EAAc,wBAEdC,EAA2B,iBAAXC,OAChBC,EAAOF,EAASC,OAAS,CAAC,EAC1BC,EAAKC,oBACPH,GAAS,GAEX,IAAII,GAAcJ,GAA0B,iBAATxG,MACpB0G,EAAKG,oBAAyC,iBAAZC,SAAwBA,QAAQC,UAAYD,QAAQC,SAASC,KAE5GN,EAAOO,OACEL,IACTF,EAAO1G,MA+JT,IA7JA,IAAIkH,GAAaR,EAAKS,sBAAsDpT,EAAOC,QAC/EoT,EAAsC,OACtCC,GAAgBX,EAAKY,yBAAkD,oBAAhBC,YACvDC,EAAY,mBAAmBpK,MAAM,IAErCqK,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,EAAUtB,EAAKG,qBAAuBxP,MAAM2Q,QAC5C,SAAUC,GACR,MAA+C,mBAAxC5T,OAAOa,UAAU6G,SAASpF,KAAKsR,EACxC,EACA5Q,MAAM2Q,QAENE,GAAUb,IAAiBX,EAAKyB,iCAAoCZ,YAAYW,OAIhFX,YAAYW,OAHZ,SAAUD,GACR,MAAsB,iBAARA,GAAoBA,EAAIG,QAAUH,EAAIG,OAAOpD,cAAgBuC,WAC7E,EAIAc,EAAgB,SAAUnG,GAC5B,IAAIrH,SAAcqH,EAClB,GAAa,WAATrH,EACF,MAAO,CAACqH,GAAS,GAEnB,GAAa,WAATrH,GAAiC,OAAZqH,EACvB,MAAM,IAAIhO,MAAMqS,GAElB,GAAIc,GAAgBnF,EAAQ8C,cAAgBuC,YAC1C,MAAO,CAAC,IAAI5B,WAAWzD,IAAU,GAEnC,IAAK8F,EAAQ9F,KAAagG,EAAOhG,GAC/B,MAAM,IAAIhO,MAAMqS,GAElB,MAAO,CAACrE,GAAS,EACnB,EAEIoG,EAAQ,SAAUpG,GACpB,OAA4C,IAArCmG,EAAcnG,GAAS,GAAG/K,MACnC,EAEIoR,EAAa,SAAUC,GAEzB,IADA,IAAIC,EAAW,GACNxR,EAAI,EAAGA,EAAIuR,EAAMrR,SAAUF,EAClCwR,EAASxR,GAAKuR,EAAMvR,GAEtB,OAAOwR,CACT,EAEIC,EAAqB,SAAUC,EAAMC,EAASC,GAChD,OAAO,SAAU3G,GACf,OAAO,IAAI4G,EAAOH,EAAMC,EAASD,GAAMnU,OAAO0N,GAAS2G,IACzD,CACF,EAEIE,EAA0B,SAAUJ,EAAMC,EAASC,GACrD,OAAO,SAAU3G,EAAS8G,GACxB,OAAO,IAAIF,EAAOH,EAAMC,EAASI,GAAYxU,OAAO0N,GAAS2G,IAC/D,CACF,EAEII,EAA2B,SAAUN,EAAMC,EAASC,GACtD,OAAO,SAAU3G,EAAS8G,EAAYE,EAAGzQ,GACvC,OAAO0Q,EAAQ,SAAWR,GAAMnU,OAAO0N,EAAS8G,EAAYE,EAAGzQ,GAAGoQ,IACpE,CACF,EAEIO,EAAyB,SAAUT,EAAMC,EAASC,GACpD,OAAO,SAAUpU,EAAKyN,EAAS8G,EAAYvQ,GACzC,OAAO0Q,EAAQ,OAASR,GAAMnU,OAAOC,EAAKyN,EAAS8G,EAAYvQ,GAAGoQ,IACpE,CACF,EAEIQ,EAAsB,SAAUC,EAAQC,EAAcZ,EAAMC,GAC9D,IAAK,IAAI3R,EAAI,EAAGA,EAAI6Q,EAAa3Q,SAAUF,EAAG,CAC5C,IAAI4D,EAAOiN,EAAa7Q,GACxBqS,EAAOzO,GAAQ0O,EAAaZ,EAAMC,EAAS/N,EAC7C,CACA,OAAOyO,CACT,EAEIC,EAAe,SAAUZ,EAAMC,GACjC,IAAIU,EAASZ,EAAmBC,EAAMC,EAAS,OAO/C,OANAU,EAAOhV,OAAS,WACd,OAAO,IAAIwU,EAAOH,EAAMC,EAASD,EACnC,EACAW,EAAO9U,OAAS,SAAU0N,GACxB,OAAOoH,EAAOhV,SAASE,OAAO0N,EAChC,EACOmH,EAAoBC,EAAQZ,EAAoBC,EAAMC,EAC/D,EAyCIY,EAAa,CACf,CAAE/S,KAAM,SAAUmS,QA9IC,CAAC,EAAG,IAAK,MAAO,UA8IQD,KAAMf,EAAM2B,aAAcA,GACrE,CAAE9S,KAAM,OAAQmS,QA9IJ,CAAC,EAAG,KAAM,OAAQ,WA8IID,KAAMf,EAAM2B,aAAcA,GAC5D,CAAE9S,KAAM,QAASmS,QAlJC,CAAC,GAAI,KAAM,QAAS,WAkJGD,KAAMd,EAAY0B,aA1CrC,SAAUZ,EAAMC,GACtC,IAAIU,EAASP,EAAwBJ,EAAMC,EAAS,OAOpD,OANAU,EAAOhV,OAAS,SAAU0U,GACxB,OAAO,IAAIF,EAAOH,EAAMC,EAASI,EACnC,EACAM,EAAO9U,OAAS,SAAU0N,EAAS8G,GACjC,OAAOM,EAAOhV,OAAO0U,GAAYxU,OAAO0N,EAC1C,EACOmH,EAAoBC,EAAQP,EAAyBJ,EAAMC,EACpE,GAkCE,CAAEnS,KAAM,SAAUmS,QAASnB,EAAgBkB,KAAMd,EAAY0B,aAhCtC,SAAUZ,EAAMC,GACvC,IAAIa,EAAI1B,EAAeY,GACnBW,EAASL,EAAyBN,EAAMC,EAAS,OAWrD,OAVAU,EAAOhV,OAAS,SAAU0U,EAAYE,EAAGzQ,GACvC,OAAI6P,EAAMY,IAAMZ,EAAM7P,GACb0Q,EAAQ,QAAUR,GAAMrU,OAAO0U,GAE/B,IAAIF,EAAOH,EAAMC,EAASI,GAAYU,QAAQ,CAACR,EAAGzQ,GAAIgR,EAEjE,EACAH,EAAO9U,OAAS,SAAU0N,EAAS8G,EAAYE,EAAGzQ,GAChD,OAAO6Q,EAAOhV,OAAO0U,EAAYE,EAAGzQ,GAAGjE,OAAO0N,EAChD,EACOmH,EAAoBC,EAAQL,EAA0BN,EAAMC,EACrE,GAmBE,CAAEnS,KAAM,OAAQmS,QAASnB,EAAgBkB,KAAMd,EAAY0B,aAjBtC,SAAUZ,EAAMC,GACrC,IAAIa,EAAI1B,EAAeY,GACnBW,EAASF,EAAuBT,EAAMC,EAAS,OAOnD,OANAU,EAAOhV,OAAS,SAAUG,EAAKuU,EAAYvQ,GACzC,OAAO,IAAIkR,EAAKhB,EAAMC,EAASI,GAAYU,QAAQ,CAAC,OAAQjR,GAAIgR,GAAGC,QAAQ,CAACjV,GAAMgV,EACpF,EACAH,EAAO9U,OAAS,SAAUC,EAAKyN,EAAS8G,EAAYvQ,GAClD,OAAO6Q,EAAOhV,OAAOG,EAAKuU,EAAYvQ,GAAGjE,OAAO0N,EAClD,EACOmH,EAAoBC,EAAQF,EAAwBT,EAAMC,EACnE,IAUIO,EAAU,CAAC,EAAGS,EAAc,GAEvB3S,EAAI,EAAGA,EAAIuS,EAAWrS,SAAUF,EAGvC,IAFA,IAAI4S,EAAYL,EAAWvS,GACvB0R,EAAOkB,EAAUlB,KACZzQ,EAAI,EAAGA,EAAIyQ,EAAKxR,SAAUe,EAAG,CACpC,IAAI4R,EAAaD,EAAUpT,KAAO,IAAMkS,EAAKzQ,GAG7C,GAFA0R,EAAY1T,KAAK4T,GACjBX,EAAQW,GAAcD,EAAUN,aAAaZ,EAAKzQ,GAAI2R,EAAUjB,SACzC,SAAnBiB,EAAUpT,KAAiB,CAC7B,IAAIsT,EAAgBF,EAAUpT,KAAOkS,EAAKzQ,GAC1C0R,EAAY1T,KAAK6T,GACjBZ,EAAQY,GAAiBZ,EAAQW,EACnC,CACF,CAGF,SAAShB,EAAOH,EAAMC,EAASI,GAC7BtT,KAAKsU,OAAS,GACdtU,KAAK+C,EAAI,GACT/C,KAAKkT,QAAUA,EACflT,KAAKsT,WAAaA,EAClBtT,KAAKuU,OAAQ,EACbvU,KAAKwU,WAAY,EACjBxU,KAAKyU,MAAQ,EACbzU,KAAKgH,MAAQ,EACbhH,KAAK0U,WAAc,MAAQzB,GAAQ,IAAO,EAC1CjT,KAAK2U,UAAY3U,KAAK0U,YAAc,EACpC1U,KAAK4U,aAAetB,GAAc,EAClCtT,KAAK6U,YAA2B,GAAbvB,IAAoB,EAEvC,IAAK,IAAI/R,EAAI,EAAGA,EAAI,KAAMA,EACxBvB,KAAK+C,EAAExB,GAAK,CAEhB,CA8OA,SAAS0S,EAAKhB,EAAMC,EAASI,GAC3BF,EAAOnS,KAAKjB,KAAMiT,EAAMC,EAASI,EACnC,CA9OAF,EAAO5T,UAAUV,OAAS,SAAU0N,GAClC,GAAIxM,KAAKwU,UACP,MAAM,IAAIhW,MA9MO,2BAgNnB,IAAIsW,EAASnC,EAAcnG,GAC3BA,EAAUsI,EAAO,GAKjB,IAJA,IAEuDvT,EAAGwT,EAFtD5E,EAAW2E,EAAO,GAClBR,EAAStU,KAAKsU,OAAQK,EAAY3U,KAAK2U,UAAWlT,EAAS+K,EAAQ/K,OACrEiT,EAAa1U,KAAK0U,WAAY7J,EAAQ,EAAG9H,EAAI/C,KAAK+C,EAE7C8H,EAAQpJ,GAAQ,CACrB,GAAIzB,KAAKuU,MAGP,IAFAvU,KAAKuU,OAAQ,EACbD,EAAO,GAAKtU,KAAKyU,MACZlT,EAAI,EAAGA,EAAImT,EAAa,IAAKnT,EAChC+S,EAAO/S,GAAK,EAGhB,GAAI4O,EACF,IAAK5O,EAAIvB,KAAKgH,MAAO6D,EAAQpJ,GAAUF,EAAIoT,IAAa9J,GACtDkK,EAAOvI,EAAQa,WAAWxC,IACf,IACTyJ,EAAO/S,GAAK,IAAMwT,GAAQ/C,EAAY,EAANzQ,KACvBwT,EAAO,MAChBT,EAAO/S,GAAK,KAAO,IAAQwT,GAAQ,IAAO/C,EAAY,EAANzQ,KAChD+S,EAAO/S,GAAK,KAAO,IAAe,GAAPwT,IAAiB/C,EAAY,EAANzQ,MACzCwT,EAAO,OAAUA,GAAQ,OAClCT,EAAO/S,GAAK,KAAO,IAAQwT,GAAQ,KAAQ/C,EAAY,EAANzQ,KACjD+S,EAAO/S,GAAK,KAAO,IAASwT,GAAQ,EAAK,KAAU/C,EAAY,EAANzQ,KACzD+S,EAAO/S,GAAK,KAAO,IAAe,GAAPwT,IAAiB/C,EAAY,EAANzQ,OAElDwT,EAAO,QAAoB,KAAPA,IAAiB,GAAqC,KAA9BvI,EAAQa,aAAaxC,IACjEyJ,EAAO/S,GAAK,KAAO,IAAQwT,GAAQ,KAAQ/C,EAAY,EAANzQ,KACjD+S,EAAO/S,GAAK,KAAO,IAASwT,GAAQ,GAAM,KAAU/C,EAAY,EAANzQ,KAC1D+S,EAAO/S,GAAK,KAAO,IAASwT,GAAQ,EAAK,KAAU/C,EAAY,EAANzQ,KACzD+S,EAAO/S,GAAK,KAAO,IAAe,GAAPwT,IAAiB/C,EAAY,EAANzQ,WAItD,IAAKA,EAAIvB,KAAKgH,MAAO6D,EAAQpJ,GAAUF,EAAIoT,IAAa9J,EACtDyJ,EAAO/S,GAAK,IAAMiL,EAAQ3B,IAAUmH,EAAY,EAANzQ,KAI9C,GADAvB,KAAKgV,cAAgBzT,EACjBA,GAAKoT,EAAW,CAGlB,IAFA3U,KAAKgH,MAAQzF,EAAIoT,EACjB3U,KAAKyU,MAAQH,EAAOI,GACfnT,EAAI,EAAGA,EAAImT,IAAcnT,EAC5BwB,EAAExB,IAAM+S,EAAO/S,GAEjB0T,EAAElS,GACF/C,KAAKuU,OAAQ,CACf,MACEvU,KAAKgH,MAAQzF,CAEjB,CACA,OAAOvB,IACT,EAEAoT,EAAO5T,UAAU0V,OAAS,SAAUC,EAAGC,GACrC,IAAIjS,EAAQ,IAAJgS,EAAS3B,EAAI,EACjB1E,EAAQ,CAAC3L,GAGb,IADAA,EAAQ,KADRgS,IAAS,GAEFhS,EAAI,GACT2L,EAAMlE,QAAQzH,GAEdA,EAAQ,KADRgS,IAAS,KAEP3B,EAQJ,OANI4B,EACFtG,EAAMtO,KAAKgT,GAEX1E,EAAMlE,QAAQ4I,GAEhBxT,KAAKlB,OAAOgQ,GACLA,EAAMrN,MACf,EAEA2R,EAAO5T,UAAU6V,aAAe,SAAUtP,GACxC,IAAI+O,EAASnC,EAAc5M,GAC3BA,EAAM+O,EAAO,GACb,IAAI3E,EAAW2E,EAAO,GAClBhG,EAAQ,EAAGrN,EAASsE,EAAItE,OAC5B,GAAI0O,EACF,IAAK,IAAI5O,EAAI,EAAGA,EAAIwE,EAAItE,SAAUF,EAAG,CACnC,IAAIwT,EAAOhP,EAAIsH,WAAW9L,GACtBwT,EAAO,IACTjG,GAAS,EACAiG,EAAO,KAChBjG,GAAS,EACAiG,EAAO,OAAUA,GAAQ,MAClCjG,GAAS,GAETiG,EAAO,QAAoB,KAAPA,IAAiB,GAA6B,KAAtBhP,EAAIsH,aAAa9L,IAC7DuN,GAAS,EAEb,MAEAA,EAAQrN,EAIV,OAFAqN,GAAS9O,KAAKkV,OAAe,EAARpG,GACrB9O,KAAKlB,OAAOiH,GACL+I,CACT,EAEAsE,EAAO5T,UAAUwU,QAAU,SAAUsB,EAAMvB,GAEzC,IADA,IAAIjF,EAAQ9O,KAAKkV,OAAOnB,GACfxS,EAAI,EAAGA,EAAI+T,EAAK7T,SAAUF,EACjCuN,GAAS9O,KAAKqV,aAAaC,EAAK/T,IAElC,IAAIgU,GAAgBxB,EAAIjF,EAAQiF,GAAKA,EACjCyB,EAAQ,GAGZ,OAFAA,EAAM/T,OAAS8T,EACfvV,KAAKlB,OAAO0W,GACLxV,IACT,EAEAoT,EAAO5T,UAAUiW,SAAW,WAC1B,IAAIzV,KAAKwU,UAAT,CAGAxU,KAAKwU,WAAY,EACjB,IAAIF,EAAStU,KAAKsU,OAAQ/S,EAAIvB,KAAKgV,cAAeN,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAEzF,GADAuR,EAAO/S,GAAK,IAAMvB,KAAKkT,QAAY,EAAJ3R,GAC3BvB,KAAKgV,gBAAkBhV,KAAK2U,UAE9B,IADAL,EAAO,GAAKA,EAAOI,GACdnT,EAAI,EAAGA,EAAImT,EAAa,IAAKnT,EAChC+S,EAAO/S,GAAK,EAIhB,IADA+S,EAAOI,EAAa,IAAM,WACrBnT,EAAI,EAAGA,EAAImT,IAAcnT,EAC5BwB,EAAExB,IAAM+S,EAAO/S,GAEjB0T,EAAElS,EAdF,CAeF,EAEAqQ,EAAO5T,UAAU6G,SAAW+M,EAAO5T,UAAUkW,IAAM,WACjD1V,KAAKyV,WAKL,IAHA,IAEchB,EAFVC,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAAG6R,EAAe5U,KAAK4U,aAChEC,EAAa7U,KAAK6U,WAAYtT,EAAI,EAAGiB,EAAI,EACvCkT,EAAM,GACHlT,EAAIoS,GAAc,CACvB,IAAKrT,EAAI,EAAGA,EAAImT,GAAclS,EAAIoS,IAAgBrT,IAAKiB,EACrDiS,EAAQ1R,EAAExB,GACVmU,GAAO5D,EAAW2C,GAAS,EAAK,IAAQ3C,EAAkB,GAAR2C,GAChD3C,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,EAAK,IAC3D3C,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,GAAM,IAC5D3C,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,GAAM,IAE5DjS,EAAIkS,GAAe,IACrB3R,EAAI8P,EAAW9P,GACfkS,EAAElS,GACFxB,EAAI,EAER,CAWA,OAVIsT,IACFJ,EAAQ1R,EAAExB,GACVmU,GAAO5D,EAAW2C,GAAS,EAAK,IAAQ3C,EAAkB,GAAR2C,GAC9CI,EAAa,IACfa,GAAO5D,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,EAAK,KAEhEI,EAAa,IACfa,GAAO5D,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,GAAM,MAGhEiB,CACT,EAEAtC,EAAO5T,UAAUmW,YAAc,WAC7B3V,KAAKyV,WAEL,IAGI/C,EAHAgC,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAAG6R,EAAe5U,KAAK4U,aAChEC,EAAa7U,KAAK6U,WAAYtT,EAAI,EAAGiB,EAAI,EACvCsM,EAAQ9O,KAAKsT,YAAc,EAG7BZ,EADEmC,EACO,IAAIhD,YAAa+C,EAAe,GAAM,GAEtC,IAAI/C,YAAY/C,GAG3B,IADA,IAAIgE,EAAQ,IAAI8C,YAAYlD,GACrBlQ,EAAIoS,GAAc,CACvB,IAAKrT,EAAI,EAAGA,EAAImT,GAAclS,EAAIoS,IAAgBrT,IAAKiB,EACrDsQ,EAAMtQ,GAAKO,EAAExB,GAEXiB,EAAIkS,GAAe,IACrB3R,EAAI8P,EAAW9P,GACfkS,EAAElS,GAEN,CAKA,OAJI8R,IACF/B,EAAMtQ,GAAKO,EAAExB,GACbmR,EAASA,EAAOxR,MAAM,EAAG4N,IAEpB4D,CACT,EAEAU,EAAO5T,UAAUkT,OAASU,EAAO5T,UAAUmW,YAE3CvC,EAAO5T,UAAUqW,OAASzC,EAAO5T,UAAUsT,MAAQ,WACjD9S,KAAKyV,WAKL,IAHA,IAEgBvS,EAAQuR,EAFpBC,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAAG6R,EAAe5U,KAAK4U,aAChEC,EAAa7U,KAAK6U,WAAYtT,EAAI,EAAGiB,EAAI,EACvCsQ,EAAQ,GACLtQ,EAAIoS,GAAc,CACvB,IAAKrT,EAAI,EAAGA,EAAImT,GAAclS,EAAIoS,IAAgBrT,IAAKiB,EACrDU,EAASV,GAAK,EACdiS,EAAQ1R,EAAExB,GACVuR,EAAM5P,GAAkB,IAARuR,EAChB3B,EAAM5P,EAAS,GAAMuR,GAAS,EAAK,IACnC3B,EAAM5P,EAAS,GAAMuR,GAAS,GAAM,IACpC3B,EAAM5P,EAAS,GAAMuR,GAAS,GAAM,IAElCjS,EAAIkS,GAAe,IACrB3R,EAAI8P,EAAW9P,GACfkS,EAAElS,GAEN,CAYA,OAXI8R,IACF3R,EAASV,GAAK,EACdiS,EAAQ1R,EAAExB,GACVuR,EAAM5P,GAAkB,IAARuR,EACZI,EAAa,IACf/B,EAAM5P,EAAS,GAAMuR,GAAS,EAAK,KAEjCI,EAAa,IACf/B,EAAM5P,EAAS,GAAMuR,GAAS,GAAM,MAGjC3B,CACT,EAMAmB,EAAKzU,UAAY,IAAI4T,EAErBa,EAAKzU,UAAUiW,SAAW,WAExB,OADAzV,KAAKkV,OAAOlV,KAAKsT,YAAY,GACtBF,EAAO5T,UAAUiW,SAASxU,KAAKjB,KACxC,EAEA,IAAIiV,EAAI,SAAUlS,GAChB,IAAI+S,EAAGtU,EAAGgS,EAAGuC,EAAIC,EAAIC,EAAIC,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,IAAKlG,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACvBuC,EAAKhT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCiT,EAAKjT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCkT,EAAKlT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCmT,EAAKnT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCoT,EAAKpT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCqT,EAAKrT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCsT,EAAKtT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCuT,EAAKvT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAItC+S,GAHAS,EAAKxT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3BkT,GAAM,EAAMC,IAAO,IAC9B1U,GAHAgV,EAAKzT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3BmT,GAAM,EAAMD,IAAO,IAC9BlT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIC,GAAOI,GAAM,EAAMC,IAAO,IAC9B5U,EAAIwU,GAAOI,GAAM,EAAMD,IAAO,IAC9BpT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIG,GAAOI,GAAM,EAAMC,IAAO,IAC9B9U,EAAI0U,GAAOI,GAAM,EAAMD,IAAO,IAC9BtT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIK,GAAOI,GAAM,EAAMC,IAAO,IAC9BhV,EAAI4U,GAAOI,GAAM,EAAMD,IAAO,IAC9BxT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIO,GAAON,GAAM,EAAMC,IAAO,IAC9BxU,EAAI8U,GAAON,GAAM,EAAMD,IAAO,IAC9BhT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EAETiV,EAAK1T,EAAE,GACP2T,EAAK3T,EAAE,GACP0V,EAAO1V,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2V,EAAO3V,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCwU,EAAOxU,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCyU,EAAOzU,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCwW,GAAOxW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCyW,GAAOzW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCsV,EAAOtV,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCuV,EAAOvV,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC8U,EAAO9U,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9B+U,EAAO/U,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9B4T,EAAM5T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC6T,EAAM7T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC4V,EAAO5V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC6V,EAAO7V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC0U,EAAO1U,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC2U,EAAO3U,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC0W,GAAO1W,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2W,GAAO3W,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCkW,GAAOlW,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BmW,GAAOnW,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BgV,EAAOhV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCiV,EAAOjV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC8T,EAAM9T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC+T,EAAM/T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC8V,EAAO9V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC+V,EAAO/V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC4U,EAAO5U,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC6U,EAAO7U,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCoU,EAAOpU,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BqU,EAAOrU,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BoW,GAAOpW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCqW,GAAOrW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCkV,EAAOlV,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCmV,EAAOnV,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCgU,EAAMhU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCiU,EAAMjU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCgW,EAAOhW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCiW,GAAOjW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCwV,EAAOxV,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/ByV,EAAOzV,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BsU,EAAOtU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCuU,EAAOvU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCsW,GAAOtW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCuW,GAAOvW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCoV,EAAOpV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCqV,EAAOrV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCkU,EAAMlU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCmU,EAAMnU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAEhCA,EAAE,GAAK0T,GAAOE,EAAKE,EACnB9T,EAAE,GAAK2T,GAAOE,EAAKE,EACnB/T,EAAE,IAAMoU,GAAQE,EAAME,EACtBxU,EAAE,IAAMqU,GAAQE,EAAME,EACtBzU,EAAE,IAAM8U,GAAQE,EAAME,EACtBlV,EAAE,IAAM+U,GAAQE,EAAME,EACtBnV,EAAE,IAAMwV,GAAQE,EAAME,EACtB5V,EAAE,IAAMyV,GAAQE,EAAME,EACtB7V,EAAE,IAAMkW,IAAQE,GAAME,GACtBtW,EAAE,IAAMmW,IAAQE,GAAME,GACtBvW,EAAE,GAAK4T,GAAOE,EAAKE,EACnBhU,EAAE,GAAK6T,GAAOE,EAAKE,EACnBjU,EAAE,IAAMsU,GAAQE,EAAME,EACtB1U,EAAE,IAAMuU,GAAQE,EAAME,EACtB3U,EAAE,IAAMgV,GAAQE,EAAME,EACtBpV,EAAE,IAAMiV,GAAQE,EAAME,EACtBrV,EAAE,IAAM0V,GAAQE,EAAME,EACtB9V,EAAE,IAAM2V,GAAQE,EAAME,EACtB/V,EAAE,IAAMoW,IAAQE,GAAME,GACtBxW,EAAE,IAAMqW,IAAQE,GAAME,GACtBzW,EAAE,GAAK8T,GAAOE,EAAKE,EACnBlU,EAAE,GAAK+T,GAAOE,EAAKE,EACnBnU,EAAE,IAAMwU,GAAQE,EAAME,EACtB5U,EAAE,IAAMyU,GAAQE,EAAME,EACtB7U,EAAE,IAAMkV,GAAQE,EAAME,EACtBtV,EAAE,IAAMmV,GAAQE,EAAME,EACtBvV,EAAE,IAAM4V,GAAQE,EAAME,EACtBhW,EAAE,IAAM6V,GAAQE,EAAME,GACtBjW,EAAE,IAAMsW,IAAQE,GAAME,GACtB1W,EAAE,IAAMuW,IAAQE,GAAME,GACtB3W,EAAE,GAAKgU,GAAOE,EAAKR,EACnB1T,EAAE,GAAKiU,GAAOE,EAAKR,EACnB3T,EAAE,IAAM0U,GAAQE,EAAMR,EACtBpU,EAAE,IAAM2U,GAAQE,EAAMR,EACtBrU,EAAE,IAAMoV,GAAQE,EAAMR,EACtB9U,EAAE,IAAMqV,GAAQE,EAAMR,EACtB/U,EAAE,IAAM8V,GAAQE,EAAMR,EACtBxV,EAAE,IAAM+V,GAAQE,GAAMR,EACtBzV,EAAE,IAAMwW,IAAQE,GAAMR,GACtBlW,EAAE,IAAMyW,IAAQE,GAAMR,GACtBnW,EAAE,GAAKkU,GAAOR,EAAKE,EACnB5T,EAAE,GAAKmU,GAAOR,EAAKE,EACnB7T,EAAE,IAAM4U,GAAQR,EAAME,EACtBtU,EAAE,IAAM6U,GAAQR,EAAME,EACtBvU,EAAE,IAAMsV,GAAQR,EAAME,EACtBhV,EAAE,IAAMuV,GAAQR,EAAME,EACtBjV,EAAE,IAAMgW,GAAQR,EAAME,EACtB1V,EAAE,IAAMiW,IAAQR,EAAME,EACtB3V,EAAE,IAAM0W,IAAQR,GAAME,GACtBpW,EAAE,IAAM2W,IAAQR,GAAME,GAEtBrW,EAAE,IAAMkP,EAAGuB,GACXzQ,EAAE,IAAMkP,EAAGuB,EAAI,EAEnB,EAEA,GAAIhC,EACFnT,EAAOC,QAAUmV,MACZ,CACL,IAAKlS,EAAI,EAAGA,EAAI2S,EAAYzS,SAAUF,EACpCyP,EAAKkD,EAAY3S,IAAMkS,EAAQS,EAAY3S,IAEzCmQ,SAGD,KAFD,aACE,OAAO+B,CACR,gCAEL,CACD,CA5oBD,gCCRApV,EAAOC,QAAUqb,EAGjB,IAAIC,EAAmB,EAAQ,QAC7BD,EAAMna,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAcqK,GAAOE,UAAY,QAEhG,IAIIC,EAJAjV,EAAQ,EAAQ,MAChBhC,EAAQ,EAAQ,KAChBC,EAAQ,EAAQ,MAIhBiX,EAAS,+BA6Cb,SAASJ,EAAM5Y,EAAM2P,EAAIvL,EAAM6U,EAAMxO,EAAQyO,EAAS7S,GAclD,GAZItE,EAAKoX,SAASF,IACd5S,EAAUoE,EACVyO,EAAUD,EACVA,EAAOxO,OAAStM,GACT4D,EAAKoX,SAAS1O,KACrBpE,EAAU6S,EACVA,EAAUzO,EACVA,OAAStM,GAGb0a,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,IAE7BnX,EAAKqX,UAAUzJ,IAAOA,EAAK,EAC5B,MAAMtQ,UAAU,qCAEpB,IAAK0C,EAAKqN,SAAShL,GACf,MAAM/E,UAAU,yBAEpB,QAAalB,IAAT8a,IAAuBD,EAAO5R,KAAK6R,EAAOA,EAAK3T,WAAW+T,eAC1D,MAAMha,UAAU,8BAEpB,QAAelB,IAAXsM,IAAyB1I,EAAKqN,SAAS3E,GACvC,MAAMpL,UAAU,2BAMP,oBAAT4Z,IACAA,EAAO,YAEXha,KAAKga,KAAOA,GAAiB,aAATA,EAAsBA,OAAO9a,EAMjDc,KAAKmF,KAAOA,EAMZnF,KAAK0Q,GAAKA,EAMV1Q,KAAKwL,OAASA,QAAUtM,EAMxBc,KAAK0E,SAAoB,aAATsV,EAMhBha,KAAKsE,KAAM,EAMXtE,KAAKwM,QAAU,KAMfxM,KAAK2E,OAAS,KAMd3E,KAAK6N,YAAc,KAMnB7N,KAAKqa,aAAe,KAMpBra,KAAKuD,OAAOT,EAAKwX,WAA4Bpb,IAArB2D,EAAMU,KAAK4B,GAMnCnF,KAAK8O,MAAiB,UAAT3J,EAMbnF,KAAKiF,aAAe,KAMpBjF,KAAKua,eAAiB,KAMtBva,KAAKwa,eAAiB,KAMtBxa,KAAKoH,QAAUA,CACnB,CAlJAuS,EAAMc,SAAW,SAAkB1Z,EAAM2Z,GACrC,IAAI1W,EAAQ,IAAI2V,EAAM5Y,EAAM2Z,EAAKhK,GAAIgK,EAAKvV,KAAMuV,EAAKV,KAAMU,EAAKlP,OAAQkP,EAAKT,QAASS,EAAKtT,SAI3F,OAHIsT,EAAKC,UACL3W,EAAM4W,SAAWF,EAAKC,SAC1B3W,EAAM6W,gBAAkB,SACjB7W,CACX,EAoJArF,OAAO0K,eAAesQ,EAAMna,UAAW,WAAY,CAC/CJ,IAAK,WACD,MAAyC,oBAAlCY,KAAK8a,UAAUC,cAC1B,IASJpc,OAAO0K,eAAesQ,EAAMna,UAAW,WAAY,CAC/CJ,IAAK,WACD,OAAQY,KAAKgb,QACjB,IAUJrc,OAAO0K,eAAesQ,EAAMna,UAAW,YAAa,CAChDJ,IAAK,WACD,OAAOY,KAAKiF,wBAAwB6U,GACI,cAApC9Z,KAAK8a,UAAUG,gBACvB,IASJtc,OAAO0K,eAAesQ,EAAMna,UAAW,SAAU,CAC7CJ,IAAK,WACD,MAAkD,WAA3CY,KAAK8a,UAAUI,uBAC1B,IASJvc,OAAO0K,eAAesQ,EAAMna,UAAW,cAAe,CAClDJ,IAAK,WACD,OAAIY,KAAK0E,WAAY1E,KAAKsE,MAGnBtE,KAAK2E,QACR3E,KAAKwa,gBAAkBxa,KAAKua,gBACM,aAAlCva,KAAK8a,UAAUC,eACvB,IAMJpB,EAAMna,UAAU2b,UAAY,SAAmBpa,EAAM/B,EAAOoc,GACxD,OAAOxB,EAAiBpa,UAAU2b,UAAUla,KAAKjB,KAAMe,EAAM/B,EAAOoc,EACxE,EAuBAzB,EAAMna,UAAU6b,OAAS,SAAgBC,GACrC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKwb,iBACjB,OAA0B,aAAdxb,KAAKga,MAAuBha,KAAKga,WAAQ9a,EACrD,OAAYc,KAAKmF,KACjB,KAAYnF,KAAK0Q,GACjB,SAAY1Q,KAAKwL,OACjB,UAAYxL,KAAKia,QACjB,UAAYsB,EAAevb,KAAKoH,aAAUlI,GAElD,EAOAya,EAAMna,UAAU0E,QAAU,WAEtB,GAAIlE,KAAKyb,SACL,OAAOzb,KA6BX,QA3BuDd,KAAlDc,KAAK6N,YAAchL,EAAMQ,SAASrD,KAAKmF,QACxCnF,KAAKiF,cAAgBjF,KAAKwa,eAAiBxa,KAAKwa,eAAekB,OAAS1b,KAAK0b,QAAQC,iBAAiB3b,KAAKmF,MACvGnF,KAAKiF,wBAAwB6U,EAC7B9Z,KAAK6N,YAAc,KAEnB7N,KAAK6N,YAAc7N,KAAKiF,aAAahC,OAAOtE,OAAOuG,KAAKlF,KAAKiF,aAAahC,QAAQ,KAC/EjD,KAAKia,SAAWja,KAAKia,QAAQ2B,kBAEpC5b,KAAK6N,YAAc,MAInB7N,KAAKia,SAAsC,MAA3Bja,KAAKia,QAAiB,UACtCja,KAAK6N,YAAc7N,KAAKia,QAAiB,QACrCja,KAAKiF,wBAAwBJ,GAAoC,iBAArB7E,KAAK6N,cACjD7N,KAAK6N,YAAc7N,KAAKiF,aAAahC,OAAOjD,KAAK6N,eAIrD7N,KAAKia,eACuB/a,IAAxBc,KAAKia,QAAQxW,SAAwBzD,KAAKiF,cAAkBjF,KAAKiF,wBAAwBJ,UAClF7E,KAAKia,QAAQxW,OACnB9E,OAAOuG,KAAKlF,KAAKia,SAASxY,SAC3BzB,KAAKia,aAAU/a,IAInBc,KAAKuD,KACLvD,KAAK6N,YAAc/K,EAAKwX,KAAKuB,WAAW7b,KAAK6N,YAAqC,MAAxB7N,KAAKmF,KAAK0B,OAAO,IAGvElI,OAAOmd,QACPnd,OAAOmd,OAAO9b,KAAK6N,kBAEpB,GAAI7N,KAAK8O,OAAqC,iBAArB9O,KAAK6N,YAA0B,CAC3D,IAAI2B,EACA1M,EAAKiZ,OAAO5T,KAAKnI,KAAK6N,aACtB/K,EAAKiZ,OAAOC,OAAOhc,KAAK6N,YAAa2B,EAAM1M,EAAKmZ,UAAUnZ,EAAKiZ,OAAOta,OAAOzB,KAAK6N,cAAe,GAEjG/K,EAAK2M,KAAKC,MAAM1P,KAAK6N,YAAa2B,EAAM1M,EAAKmZ,UAAUnZ,EAAK2M,KAAKhO,OAAOzB,KAAK6N,cAAe,GAChG7N,KAAK6N,YAAc2B,CACvB,CAcA,OAXIxP,KAAKsE,IACLtE,KAAKqa,aAAevX,EAAKoZ,YACpBlc,KAAK0E,SACV1E,KAAKqa,aAAevX,EAAKQ,WAEzBtD,KAAKqa,aAAera,KAAK6N,YAGzB7N,KAAK0b,kBAAkB5B,IACvB9Z,KAAK0b,OAAOS,KAAK3c,UAAUQ,KAAKe,MAAQf,KAAKqa,cAE1CT,EAAiBpa,UAAU0E,QAAQjD,KAAKjB,KACnD,EAQA2Z,EAAMna,UAAU4c,0BAA4B,SAAmCzB,GAC3E,GAAgB,WAAZA,GAAoC,WAAZA,EACxB,MAAO,CAAC,EAGZ,IAAI0B,EAAW,CAAC,EAahB,OAZArc,KAAKkE,UACa,aAAdlE,KAAKga,OACLqC,EAAStB,eAAiB,mBAE1B/a,KAAKiF,wBAAwB6U,GAAQ9Z,KAAKiF,aAAaqX,QACvDD,EAASpB,iBAAmB,cAEC,IAA7Bjb,KAAKuc,UAAU,UACfF,EAASnB,wBAA0B,UACC,IAA7Blb,KAAKuc,UAAU,YACtBF,EAASnB,wBAA0B,YAEhCmB,CACX,EAKA1C,EAAMna,UAAUgd,iBAAmB,SAA0B7B,GACzD,OAAOf,EAAiBpa,UAAUgd,iBAAiBvb,KAAKjB,KAAMA,KAAK4a,UAAYD,EACnF,EAsBAhB,EAAM8C,EAAI,SAAuBC,EAASC,EAAWC,EAAWvC,GAU5D,MAPyB,mBAAdsC,EACPA,EAAY7Z,EAAK+Z,aAAaF,GAAW5b,KAGpC4b,GAAkC,iBAAdA,IACzBA,EAAY7Z,EAAKga,aAAaH,GAAW5b,MAEtC,SAAwBvB,EAAWud,GACtCja,EAAK+Z,aAAard,EAAU8P,aACvB0N,IAAI,IAAIrD,EAAMoD,EAAWL,EAASC,EAAWC,EAAW,CAAE,QAAWvC,IAC9E,CACJ,EAgBAV,EAAM/J,WAAa,SAAmBqN,GAClCnD,EAAOmD,CACX,6BCvbA,IAAIxN,EAAOnR,EAOXmR,EAAKhO,OAAS,SAAqB8O,GAG/B,IAFA,IAAInO,EAAM,EACN+E,EAAI,EACC5F,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,GACjC4F,EAAIoJ,EAAOlD,WAAW9L,IACd,IACJa,GAAO,EACF+E,EAAI,KACT/E,GAAO,EACe,QAAZ,MAAJ+E,IAAkE,QAAZ,MAA3BoJ,EAAOlD,WAAW9L,EAAI,OACrDA,EACFa,GAAO,GAEPA,GAAO,EAEf,OAAOA,CACX,EASAqN,EAAKyN,KAAO,SAAmBxK,EAAQ1L,EAAOC,GAE1C,GADUA,EAAMD,EACN,EACN,MAAO,GAKX,IAJA,IAGImW,EAHAC,EAAQ,KACRC,EAAQ,GACR9b,EAAI,EAEDyF,EAAQC,IACXkW,EAAIzK,EAAO1L,MACH,IACJqW,EAAM9b,KAAO4b,EACRA,EAAI,KAAOA,EAAI,IACpBE,EAAM9b,MAAY,GAAJ4b,IAAW,EAAsB,GAAlBzK,EAAO1L,KAC/BmW,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlBzK,EAAO1L,OAAkB,IAAwB,GAAlB0L,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,MAAiB,MAC1GqW,EAAM9b,KAAO,OAAU4b,GAAK,IAC5BE,EAAM9b,KAAO,OAAc,KAAJ4b,IAEvBE,EAAM9b,MAAY,GAAJ4b,IAAW,IAAwB,GAAlBzK,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,KACnEzF,EAAI,QACH6b,IAAUA,EAAQ,KAAK5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,IAC/D9b,EAAI,GAGZ,OAAI6b,GACI7b,GACA6b,EAAM5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,KACzD6b,EAAMvV,KAAK,KAEfmH,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,GAC5D,EASAkO,EAAKC,MAAQ,SAAoBa,EAAQmC,EAAQxP,GAI7C,IAHA,IACI8S,EACAC,EAFAjP,EAAQ9D,EAGH3B,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,GACjCyU,EAAKzF,EAAOlD,WAAW9L,IACd,IACLmR,EAAOxP,KAAY8S,EACZA,EAAK,MACZtD,EAAOxP,KAAY8S,GAAM,EAAU,IACnCtD,EAAOxP,KAAuB,GAAX8S,EAAgB,KACV,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAK1F,EAAOlD,WAAW9L,EAAI,MAChEyU,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtC1U,EACFmR,EAAOxP,KAAY8S,GAAM,GAAU,IACnCtD,EAAOxP,KAAY8S,GAAM,GAAK,GAAK,IACnCtD,EAAOxP,KAAY8S,GAAM,EAAK,GAAK,IACnCtD,EAAOxP,KAAuB,GAAX8S,EAAgB,MAEnCtD,EAAOxP,KAAY8S,GAAM,GAAU,IACnCtD,EAAOxP,KAAY8S,GAAM,EAAK,GAAK,IACnCtD,EAAOxP,KAAuB,GAAX8S,EAAgB,KAG3C,OAAO9S,EAAS8D,CACpB,+BCvGA3I,EAAOC,QAAUgf,EAGjB,IAAI1D,EAAmB,EAAQ,QAC7B0D,EAAM9d,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAcgO,GAAOzD,UAAY,QAEhG,IAAIF,EAAQ,EAAQ,MAChB7W,EAAQ,EAAQ,MAYpB,SAASwa,EAAMvc,EAAMwc,EAAYtD,EAAS7S,GAQtC,GAPKzF,MAAM2Q,QAAQiL,KACftD,EAAUsD,EACVA,OAAare,GAEjB0a,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,QAGb/a,IAAfqe,IAA4B5b,MAAM2Q,QAAQiL,GAC5C,MAAMnd,UAAU,+BAMpBJ,KAAKwd,MAAQD,GAAc,GAO3Bvd,KAAK+D,YAAc,GAMnB/D,KAAKoH,QAAUA,CACnB,CAyCA,SAASqW,EAAkBD,GACvB,GAAIA,EAAM9B,OACN,IAAK,IAAIna,EAAI,EAAGA,EAAIic,EAAMzZ,YAAYtC,SAAUF,EACvCic,EAAMzZ,YAAYxC,GAAGma,QACtB8B,EAAM9B,OAAOsB,IAAIQ,EAAMzZ,YAAYxC,GACnD,CA9BA+b,EAAM7C,SAAW,SAAkB1Z,EAAM2Z,GACrC,OAAO,IAAI4C,EAAMvc,EAAM2Z,EAAK8C,MAAO9C,EAAKT,QAASS,EAAKtT,QAC1D,EAOAkW,EAAM9d,UAAU6b,OAAS,SAAgBC,GACrC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKia,QACjB,QAAYja,KAAKwd,MACjB,UAAYjC,EAAevb,KAAKoH,aAAUlI,GAElD,EAqBAoe,EAAM9d,UAAUwd,IAAM,SAAahZ,GAG/B,KAAMA,aAAiB2V,GACnB,MAAMvZ,UAAU,yBAQpB,OANI4D,EAAM0X,QAAU1X,EAAM0X,SAAW1b,KAAK0b,QACtC1X,EAAM0X,OAAOvc,OAAO6E,GACxBhE,KAAKwd,MAAMhd,KAAKwD,EAAMjD,MACtBf,KAAK+D,YAAYvD,KAAKwD,GACtBA,EAAMW,OAAS3E,KACfyd,EAAkBzd,MACXA,IACX,EAOAsd,EAAM9d,UAAUL,OAAS,SAAgB6E,GAGrC,KAAMA,aAAiB2V,GACnB,MAAMvZ,UAAU,yBAEpB,IAAIyK,EAAQ7K,KAAK+D,YAAYoL,QAAQnL,GAGrC,GAAI6G,EAAQ,EACR,MAAMrM,MAAMwF,EAAQ,uBAAyBhE,MAUjD,OARAA,KAAK+D,YAAYmH,OAAOL,EAAO,IAC/BA,EAAQ7K,KAAKwd,MAAMrO,QAAQnL,EAAMjD,QAGpB,GACTf,KAAKwd,MAAMtS,OAAOL,EAAO,GAE7B7G,EAAMW,OAAS,KACR3E,IACX,EAKAsd,EAAM9d,UAAUke,MAAQ,SAAehC,GACnC9B,EAAiBpa,UAAUke,MAAMzc,KAAKjB,KAAM0b,GAG5C,IAFA,IAESna,EAAI,EAAGA,EAAIvB,KAAKwd,MAAM/b,SAAUF,EAAG,CACxC,IAAIyC,EAAQ0X,EAAOtc,IAAIY,KAAKwd,MAAMjc,IAC9ByC,IAAUA,EAAMW,SAChBX,EAAMW,OALH3E,UAME+D,YAAYvD,KAAKwD,GAE9B,CAEAyZ,EAAkBzd,KACtB,EAKAsd,EAAM9d,UAAUme,SAAW,SAAkBjC,GACzC,IAAK,IAAW1X,EAAPzC,EAAI,EAAUA,EAAIvB,KAAK+D,YAAYtC,SAAUF,GAC7CyC,EAAQhE,KAAK+D,YAAYxC,IAAIma,QAC9B1X,EAAM0X,OAAOvc,OAAO6E,GAC5B4V,EAAiBpa,UAAUme,SAAS1c,KAAKjB,KAAM0b,EACnD,EAUA/c,OAAO0K,eAAeiU,EAAM9d,UAAW,mBAAoB,CACvDJ,IAAK,WACD,GAAwB,MAApBY,KAAK+D,aAAmD,IAA5B/D,KAAK+D,YAAYtC,OAC7C,OAAO,EAGX,IAAIuC,EAAQhE,KAAK+D,YAAY,GAC7B,OAAwB,MAAjBC,EAAMiW,UAAwD,IAArCjW,EAAMiW,QAAyB,eACnE,IAmBJqD,EAAMb,EAAI,WAGN,IAFA,IAAIc,EAAa,IAAI5b,MAAMU,UAAUZ,QACjCoJ,EAAQ,EACLA,EAAQxI,UAAUZ,QACrB8b,EAAW1S,GAASxI,UAAUwI,KAClC,OAAO,SAAwBrL,EAAWoe,GACtC9a,EAAK+Z,aAAard,EAAU8P,aACvB0N,IAAI,IAAIM,EAAMM,EAAWL,IAC9B5e,OAAO0K,eAAe7J,EAAWoe,EAAW,CACxCxe,IAAK0D,EAAK+a,YAAYN,GACtBje,IAAKwD,EAAKgb,YAAYP,IAE9B,CACJ,+BC5NAlf,EAAOC,QAAUyf,EAEjB,IAAIjb,EAAO,EAAQ,MAUnB,SAASib,EAASC,EAAIC,GASlBje,KAAKge,GAAKA,IAAO,EAMjBhe,KAAKie,GAAKA,IAAO,CACrB,CAOA,IAAIC,EAAOH,EAASG,KAAO,IAAIH,EAAS,EAAG,GAE3CG,EAAKrP,SAAW,WAAa,OAAO,CAAG,EACvCqP,EAAKC,SAAWD,EAAKE,SAAW,WAAa,OAAOpe,IAAM,EAC1Dke,EAAKzc,OAAS,WAAa,OAAO,CAAG,EAOrC,IAAI4c,EAAWN,EAASM,SAAW,mBAOnCN,EAASlC,WAAa,SAAoB7c,GACtC,GAAc,IAAVA,EACA,OAAOkf,EACX,IAAII,EAAOtf,EAAQ,EACfsf,IACAtf,GAASA,GACb,IAAIgf,EAAKhf,IAAU,EACfif,GAAMjf,EAAQgf,GAAM,aAAe,EAUvC,OATIM,IACAL,GAAMA,IAAO,EACbD,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACCC,EAAK,aACPA,EAAK,KAGV,IAAIF,EAASC,EAAIC,EAC5B,EAOAF,EAASQ,KAAO,SAAcvf,GAC1B,GAAqB,iBAAVA,EACP,OAAO+e,EAASlC,WAAW7c,GAC/B,GAAI8D,EAAKqN,SAASnR,GAAQ,CAEtB,IAAI8D,EAAKwX,KAGL,OAAOyD,EAASlC,WAAW2C,SAASxf,EAAO,KAF3CA,EAAQ8D,EAAKwX,KAAKmE,WAAWzf,EAGrC,CACA,OAAOA,EAAM0P,KAAO1P,EAAM2P,KAAO,IAAIoP,EAAS/e,EAAM0P,MAAQ,EAAG1P,EAAM2P,OAAS,GAAKuP,CACvF,EAOAH,EAASve,UAAUqP,SAAW,SAAkBD,GAC5C,IAAKA,GAAY5O,KAAKie,KAAO,GAAI,CAC7B,IAAID,EAAgB,GAAVhe,KAAKge,KAAW,EACtBC,GAAMje,KAAKie,KAAW,EAG1B,OAFKD,IACDC,EAAKA,EAAK,IAAM,KACXD,EAAU,WAALC,EAClB,CACA,OAAOje,KAAKge,GAAe,WAAVhe,KAAKie,EAC1B,EAOAF,EAASve,UAAUkf,OAAS,SAAgB9P,GACxC,OAAO9L,EAAKwX,KACN,IAAIxX,EAAKwX,KAAe,EAAVta,KAAKge,GAAkB,EAAVhe,KAAKie,GAAQnR,QAAQ8B,IAEhD,CAAEF,IAAe,EAAV1O,KAAKge,GAAQrP,KAAgB,EAAV3O,KAAKie,GAAQrP,SAAU9B,QAAQ8B,GACnE,EAEA,IAAIvB,EAAa2B,OAAOxP,UAAU6N,WAOlC0Q,EAASY,SAAW,SAAkBvR,GAClC,OAAIA,IAASiR,EACFH,EACJ,IAAIH,GACL1Q,EAAWpM,KAAKmM,EAAM,GACtBC,EAAWpM,KAAKmM,EAAM,IAAM,EAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,GAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,MAAQ,GAEpCC,EAAWpM,KAAKmM,EAAM,GACtBC,EAAWpM,KAAKmM,EAAM,IAAM,EAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,GAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,MAAQ,EAE9C,EAMA2Q,EAASve,UAAUof,OAAS,WACxB,OAAO5P,OAAOC,aACO,IAAjBjP,KAAKge,GACLhe,KAAKge,KAAO,EAAK,IACjBhe,KAAKge,KAAO,GAAK,IACjBhe,KAAKge,KAAO,GACK,IAAjBhe,KAAKie,GACLje,KAAKie,KAAO,EAAK,IACjBje,KAAKie,KAAO,GAAK,IACjBje,KAAKie,KAAO,GAEpB,EAMAF,EAASve,UAAU2e,SAAW,WAC1B,IAAIU,EAAS7e,KAAKie,IAAM,GAGxB,OAFAje,KAAKie,KAAQje,KAAKie,IAAM,EAAIje,KAAKge,KAAO,IAAMa,KAAU,EACxD7e,KAAKge,IAAQhe,KAAKge,IAAM,EAAsBa,KAAU,EACjD7e,IACX,EAMA+d,EAASve,UAAU4e,SAAW,WAC1B,IAAIS,IAAmB,EAAV7e,KAAKge,IAGlB,OAFAhe,KAAKge,KAAQhe,KAAKge,KAAO,EAAIhe,KAAKie,IAAM,IAAMY,KAAU,EACxD7e,KAAKie,IAAQje,KAAKie,KAAO,EAAqBY,KAAU,EACjD7e,IACX,EAMA+d,EAASve,UAAUiC,OAAS,WACxB,IAAIqd,EAAS9e,KAAKge,GACde,GAAS/e,KAAKge,KAAO,GAAKhe,KAAKie,IAAM,KAAO,EAC5Ce,EAAShf,KAAKie,KAAO,GACzB,OAAiB,IAAVe,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,+BCpMA3gB,EAAOC,QAAU,EAAjB,mCCFAD,EAAOC,QAAU2gB,EAEjB,IAAInc,EAAO,EAAQ,MASnB,SAASmc,EAAQC,GAEb,GAAIA,EACA,IAAK,IAAIha,EAAOvG,OAAOuG,KAAKga,GAAa3d,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAC/DvB,KAAKkF,EAAK3D,IAAM2d,EAAWha,EAAK3D,GAC5C,CAyBA0d,EAAQrgB,OAAS,SAAgBsgB,GAC7B,OAAOlf,KAAKmf,MAAMvgB,OAAOsgB,EAC7B,EAUAD,EAAQ/J,OAAS,SAAgB1I,EAAS4S,GACtC,OAAOpf,KAAKmf,MAAMjK,OAAO1I,EAAS4S,EACtC,EAUAH,EAAQI,gBAAkB,SAAyB7S,EAAS4S,GACxD,OAAOpf,KAAKmf,MAAME,gBAAgB7S,EAAS4S,EAC/C,EAWAH,EAAQjD,OAAS,SAAgBsD,GAC7B,OAAOtf,KAAKmf,MAAMnD,OAAOsD,EAC7B,EAWAL,EAAQM,gBAAkB,SAAyBD,GAC/C,OAAOtf,KAAKmf,MAAMI,gBAAgBD,EACtC,EASAL,EAAQO,OAAS,SAAgBhT,GAC7B,OAAOxM,KAAKmf,MAAMK,OAAOhT,EAC7B,EASAyS,EAAQhR,WAAa,SAAoBwR,GACrC,OAAOzf,KAAKmf,MAAMlR,WAAWwR,EACjC,EAUAR,EAAQ9Q,SAAW,SAAkB3B,EAASyN,GAC1C,OAAOja,KAAKmf,MAAMhR,SAAS3B,EAASyN,EACxC,EAMAgF,EAAQzf,UAAU6b,OAAS,WACvB,OAAOrb,KAAKmf,MAAMhR,SAASnO,KAAM8C,EAAKwY,cAC1C,+BCvIAjd,EAAOC,QAAUohB,EAGjB,IAAIC,EAAS,EAAQ,OACpBD,EAAalgB,UAAYb,OAAOC,OAAO+gB,EAAOngB,YAAY8P,YAAcoQ,EAEzE,IAAI5c,EAAO,EAAQ,MASnB,SAAS4c,EAAahN,GAClBiN,EAAO1e,KAAKjB,KAAM0S,EAOtB,CAEAgN,EAAa9P,WAAa,WAElB9M,EAAKkN,SACL0P,EAAalgB,UAAUogB,OAAS9c,EAAKkN,OAAOxQ,UAAU0B,MAC9D,EAMAwe,EAAalgB,UAAU+Q,OAAS,WAC5B,IAAInO,EAAMpC,KAAKqQ,SACf,OAAOrQ,KAAKwP,IAAIqQ,UACV7f,KAAKwP,IAAIqQ,UAAU7f,KAAK8G,IAAK9G,KAAK8G,IAAMmC,KAAKC,IAAIlJ,KAAK8G,IAAM1E,EAAKpC,KAAKoC,MACtEpC,KAAKwP,IAAInJ,SAAS,QAASrG,KAAK8G,IAAK9G,KAAK8G,IAAMmC,KAAKC,IAAIlJ,KAAK8G,IAAM1E,EAAKpC,KAAKoC,KACxF,EASAsd,EAAa9P,0CC5Cb,IAIIkK,EACAjV,EALA/B,EAAOzE,EAAOC,QAAU,EAAjB,MAEPwhB,EAAQ,EAAQ,MAKpBhd,EAAKc,QAAU,EAAQ,MACvBd,EAAKid,MAAU,EAAQ,MACvBjd,EAAKkd,KAAU,EAAQ,MAMvBld,EAAKmd,GAAKnd,EAAKod,QAAQ,MAOvBpd,EAAKqd,QAAU,SAAiBV,GAC5B,GAAIA,EAAQ,CAIR,IAHA,IAAIva,EAAQvG,OAAOuG,KAAKua,GACpB3M,EAAQ,IAAInR,MAAMuD,EAAKzD,QACvBoJ,EAAQ,EACLA,EAAQ3F,EAAKzD,QAChBqR,EAAMjI,GAAS4U,EAAOva,EAAK2F,MAC/B,OAAOiI,CACX,CACA,MAAO,EACX,EAOAhQ,EAAKqL,SAAW,SAAkB2E,GAG9B,IAFA,IAAI2M,EAAS,CAAC,EACV5U,EAAS,EACNA,EAAQiI,EAAMrR,QAAQ,CACzB,IAAI1C,EAAM+T,EAAMjI,KACZI,EAAM6H,EAAMjI,UACJ3L,IAAR+L,IACAwU,EAAO1gB,GAAOkM,EACtB,CACA,OAAOwU,CACX,EAEA,IAAIW,EAAsB,MACtBC,EAAsB,KAO1Bvd,EAAKwd,WAAa,SAAoBvf,GAClC,MAAO,uTAAuToH,KAAKpH,EACvU,EAOA+B,EAAKsB,SAAW,SAAkBuJ,GAC9B,OAAK,YAAYxF,KAAKwF,IAAS7K,EAAKwd,WAAW3S,GACpC,KAAQA,EAAK3H,QAAQoa,EAAqB,QAAQpa,QAAQqa,EAAiB,OAAU,KACzF,IAAM1S,CACjB,EAOA7K,EAAKyd,QAAU,SAAiBxa,GAC5B,OAAOA,EAAIc,OAAO,GAAG2Z,cAAgBza,EAAI0B,UAAU,EACvD,EAEA,IAAIgZ,EAAc,YAOlB3d,EAAK4d,UAAY,SAAmB3a,GAChC,OAAOA,EAAI0B,UAAU,EAAG,GACjB1B,EAAI0B,UAAU,GACTzB,QAAQya,GAAa,SAASxa,EAAIC,GAAM,OAAOA,EAAGsa,aAAe,GACjF,EAQA1d,EAAKuL,kBAAoB,SAA2BsS,EAAGC,GACnD,OAAOD,EAAEjQ,GAAKkQ,EAAElQ,EACpB,EAUA5N,EAAK+Z,aAAe,SAAsBV,EAAM0E,GAG5C,GAAI1E,EAAKgD,MAML,OALI0B,GAAY1E,EAAKgD,MAAMpe,OAAS8f,IAChC/d,EAAKge,aAAa3hB,OAAOgd,EAAKgD,OAC9BhD,EAAKgD,MAAMpe,KAAO8f,EAClB/d,EAAKge,aAAa9D,IAAIb,EAAKgD,QAExBhD,EAAKgD,MAIXrF,IACDA,EAAO,EAAQ,OAEnB,IAAI3U,EAAO,IAAI2U,EAAK+G,GAAY1E,EAAKpb,MAKrC,OAJA+B,EAAKge,aAAa9D,IAAI7X,GACtBA,EAAKgX,KAAOA,EACZxd,OAAO0K,eAAe8S,EAAM,QAAS,CAAEnd,MAAOmG,EAAMuG,YAAY,IAChE/M,OAAO0K,eAAe8S,EAAK3c,UAAW,QAAS,CAAER,MAAOmG,EAAMuG,YAAY,IACnEvG,CACX,EAEA,IAAI4b,EAAoB,EAOxBje,EAAKga,aAAe,SAAsB2C,GAGtC,GAAIA,EAAON,MACP,OAAOM,EAAON,MAGbta,IACDA,EAAO,EAAQ,OAEnB,IAAImc,EAAM,IAAInc,EAAK,OAASkc,IAAqBtB,GAGjD,OAFA3c,EAAKge,aAAa9D,IAAIgE,GACtBriB,OAAO0K,eAAeoW,EAAQ,QAAS,CAAEzgB,MAAOgiB,EAAKtV,YAAY,IAC1DsV,CACX,EAWAle,EAAKme,YAAc,SAAqBC,EAAKlB,EAAMhhB,EAAOoc,GAmBtD,GAAmB,iBAAR8F,EACP,MAAM9gB,UAAU,yBACpB,IAAK4f,EACD,MAAM5f,UAAU,0BAGpB,OAxBA,SAAS+gB,EAAQD,EAAKlB,EAAMhhB,GACxB,IAAIoiB,EAAOpB,EAAK1X,QAChB,GAAa,cAAT8Y,GAAiC,cAATA,EAC1B,OAAOF,EAET,GAAIlB,EAAKve,OAAS,EACdyf,EAAIE,GAAQD,EAAQD,EAAIE,IAAS,CAAC,EAAGpB,EAAMhhB,OACxC,CACH,IAAIqiB,EAAYH,EAAIE,GACpB,GAAIC,GAAajG,EACb,OAAO8F,EACPG,IACAriB,EAAQ,GAAGoC,OAAOigB,GAAWjgB,OAAOpC,IACxCkiB,EAAIE,GAAQpiB,CAChB,CACA,OAAOkiB,CACX,CAQOC,CAAQD,EADflB,EAAOA,EAAKtY,MAAM,KACQ1I,EAC9B,EAQAL,OAAO0K,eAAevG,EAAM,eAAgB,CACxC1D,IAAK,WACD,OAAO0gB,EAAiB,YAAMA,EAAiB,UAAI,IAAK,EAAQ,OACpE,iCCpNJzhB,EAAOC,QAAU+Q,EAEjB,IAEID,EAFAtM,EAAY,EAAQ,MAIpBib,EAAYjb,EAAKib,SACjBhC,EAAYjZ,EAAKiZ,OACjBtM,EAAY3M,EAAK2M,KAWrB,SAAS6R,EAAGzhB,EAAIuC,EAAK6I,GAMjBjL,KAAKH,GAAKA,EAMVG,KAAKoC,IAAMA,EAMXpC,KAAKqI,UAAOnJ,EAMZc,KAAKiL,IAAMA,CACf,CAGA,SAASsW,IAAQ,CAUjB,SAASC,EAAMpC,GAMXpf,KAAKyhB,KAAOrC,EAAOqC,KAMnBzhB,KAAK0hB,KAAOtC,EAAOsC,KAMnB1hB,KAAKoC,IAAMgd,EAAOhd,IAMlBpC,KAAKqI,KAAO+W,EAAOuC,MACvB,CAOA,SAAStS,IAMLrP,KAAKoC,IAAM,EAMXpC,KAAKyhB,KAAO,IAAIH,EAAGC,EAAM,EAAG,GAM5BvhB,KAAK0hB,KAAO1hB,KAAKyhB,KAMjBzhB,KAAK2hB,OAAS,IAOlB,CAEA,IAAI/iB,EAAS,WACT,OAAOkE,EAAKkN,OACN,WACE,OAAQX,EAAOzQ,OAAS,WACpB,OAAO,IAAIwQ,CACf,IACJ,EAEE,WACE,OAAO,IAAIC,CACf,CACR,EAqCA,SAASuS,EAAU3W,EAAKuE,EAAK1I,GACzB0I,EAAI1I,GAAa,IAANmE,CACf,CAmBA,SAAS4W,EAASzf,EAAK6I,GACnBjL,KAAKoC,IAAMA,EACXpC,KAAKqI,UAAOnJ,EACZc,KAAKiL,IAAMA,CACf,CA6CA,SAAS6W,EAAc7W,EAAKuE,EAAK1I,GAC7B,KAAOmE,EAAIgT,IACPzO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,IAAM/S,EAAI+S,KAAO,EAAI/S,EAAIgT,IAAM,MAAQ,EAC3ChT,EAAIgT,MAAQ,EAEhB,KAAOhT,EAAI+S,GAAK,KACZxO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,GAAK/S,EAAI+S,KAAO,EAExBxO,EAAI1I,KAASmE,EAAI+S,EACrB,CA0CA,SAAS+D,EAAa9W,EAAKuE,EAAK1I,GAC5B0I,EAAI1I,GAA0B,IAAdmE,EAChBuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAAM,IAC9BuE,EAAI1I,EAAM,GAAMmE,IAAQ,GAAM,IAC9BuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAC5B,CA9JAoE,EAAOzQ,OAASA,IAOhByQ,EAAOQ,MAAQ,SAAepR,GAC1B,OAAO,IAAIqE,EAAKnB,MAAMlD,EAC1B,EAIIqE,EAAKnB,QAAUA,QACf0N,EAAOQ,MAAQ/M,EAAKkf,KAAK3S,EAAOQ,MAAO/M,EAAKnB,MAAMnC,UAAUyiB,WAUhE5S,EAAO7P,UAAU8Q,MAAQ,SAAczQ,EAAIuC,EAAK6I,GAG5C,OAFAjL,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIiZ,EAAGzhB,EAAIuC,EAAK6I,GAC7CjL,KAAKoC,KAAOA,EACLpC,IACX,EA6BA6hB,EAASriB,UAAYb,OAAOC,OAAO0iB,EAAG9hB,WACtCqiB,EAASriB,UAAUK,GAxBnB,SAAuBoL,EAAKuE,EAAK1I,GAC7B,KAAOmE,EAAM,KACTuE,EAAI1I,KAAe,IAANmE,EAAY,IACzBA,KAAS,EAEbuE,EAAI1I,GAAOmE,CACf,EAyBAoE,EAAO7P,UAAU6Q,OAAS,SAAsBrR,GAW5C,OARAgB,KAAKoC,MAAQpC,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIwZ,GACzC7iB,KAAkB,GACT,IAAY,EACpBA,EAAQ,MAAY,EACpBA,EAAQ,QAAY,EACpBA,EAAQ,UAAY,EACA,EAC1BA,IAAQoD,IACDpC,IACX,EAQAqP,EAAO7P,UAAU0iB,MAAQ,SAAqBljB,GAC1C,OAAOA,EAAQ,EACTgB,KAAKsQ,MAAMwR,EAAe,GAAI/D,EAASlC,WAAW7c,IAClDgB,KAAKqQ,OAAOrR,EACtB,EAOAqQ,EAAO7P,UAAU2iB,OAAS,SAAsBnjB,GAC5C,OAAOgB,KAAKqQ,QAAQrR,GAAS,EAAIA,GAAS,MAAQ,EACtD,EAqBAqQ,EAAO7P,UAAU4iB,OAAS,SAAsBpjB,GAC5C,IAAIiU,EAAO8K,EAASQ,KAAKvf,GACzB,OAAOgB,KAAKsQ,MAAMwR,EAAe7O,EAAKxR,SAAUwR,EACpD,EASA5D,EAAO7P,UAAU6iB,MAAQhT,EAAO7P,UAAU4iB,OAQ1C/S,EAAO7P,UAAU8iB,OAAS,SAAsBtjB,GAC5C,IAAIiU,EAAO8K,EAASQ,KAAKvf,GAAOmf,WAChC,OAAOne,KAAKsQ,MAAMwR,EAAe7O,EAAKxR,SAAUwR,EACpD,EAOA5D,EAAO7P,UAAU+iB,KAAO,SAAoBvjB,GACxC,OAAOgB,KAAKsQ,MAAMsR,EAAW,EAAG5iB,EAAQ,EAAI,EAChD,EAcAqQ,EAAO7P,UAAUgjB,QAAU,SAAuBxjB,GAC9C,OAAOgB,KAAKsQ,MAAMyR,EAAc,EAAG/iB,IAAU,EACjD,EAQAqQ,EAAO7P,UAAUijB,SAAWpT,EAAO7P,UAAUgjB,QAQ7CnT,EAAO7P,UAAUkjB,QAAU,SAAuB1jB,GAC9C,IAAIiU,EAAO8K,EAASQ,KAAKvf,GACzB,OAAOgB,KAAKsQ,MAAMyR,EAAc,EAAG9O,EAAK+K,IAAI1N,MAAMyR,EAAc,EAAG9O,EAAKgL,GAC5E,EASA5O,EAAO7P,UAAUmjB,SAAWtT,EAAO7P,UAAUkjB,QAQ7CrT,EAAO7P,UAAUojB,MAAQ,SAAqB5jB,GAC1C,OAAOgB,KAAKsQ,MAAMxN,EAAK8f,MAAMC,aAAc,EAAG7jB,EAClD,EAQAqQ,EAAO7P,UAAUsjB,OAAS,SAAsB9jB,GAC5C,OAAOgB,KAAKsQ,MAAMxN,EAAK8f,MAAMG,cAAe,EAAG/jB,EACnD,EAEA,IAAIgkB,EAAalgB,EAAKnB,MAAMnC,UAAUF,IAChC,SAAwB2L,EAAKuE,EAAK1I,GAChC0I,EAAIlQ,IAAI2L,EAAKnE,EACjB,EAEE,SAAwBmE,EAAKuE,EAAK1I,GAChC,IAAK,IAAIvF,EAAI,EAAGA,EAAI0J,EAAIxJ,SAAUF,EAC9BiO,EAAI1I,EAAMvF,GAAK0J,EAAI1J,EAC3B,EAOJ8N,EAAO7P,UAAUsP,MAAQ,SAAqB9P,GAC1C,IAAIoD,EAAMpD,EAAMyC,SAAW,EAC3B,IAAKW,EACD,OAAOpC,KAAKsQ,MAAMsR,EAAW,EAAG,GACpC,GAAI9e,EAAKqN,SAASnR,GAAQ,CACtB,IAAIwQ,EAAMH,EAAOQ,MAAMzN,EAAM2Z,EAAOta,OAAOzC,IAC3C+c,EAAOC,OAAOhd,EAAOwQ,EAAK,GAC1BxQ,EAAQwQ,CACZ,CACA,OAAOxP,KAAKqQ,OAAOjO,GAAKkO,MAAM0S,EAAY5gB,EAAKpD,EACnD,EAOAqQ,EAAO7P,UAAU+Q,OAAS,SAAsBvR,GAC5C,IAAIoD,EAAMqN,EAAKhO,OAAOzC,GACtB,OAAOoD,EACDpC,KAAKqQ,OAAOjO,GAAKkO,MAAMb,EAAKC,MAAOtN,EAAKpD,GACxCgB,KAAKsQ,MAAMsR,EAAW,EAAG,EACnC,EAOAvS,EAAO7P,UAAUyjB,KAAO,WAIpB,OAHAjjB,KAAK2hB,OAAS,IAAIH,EAAMxhB,MACxBA,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,EAAGC,EAAM,EAAG,GACxCvhB,KAAKoC,IAAM,EACJpC,IACX,EAMAqP,EAAO7P,UAAU+U,MAAQ,WAUrB,OATIvU,KAAK2hB,QACL3hB,KAAKyhB,KAASzhB,KAAK2hB,OAAOF,KAC1BzhB,KAAK0hB,KAAS1hB,KAAK2hB,OAAOD,KAC1B1hB,KAAKoC,IAASpC,KAAK2hB,OAAOvf,IAC1BpC,KAAK2hB,OAAS3hB,KAAK2hB,OAAOtZ,OAE1BrI,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,EAAGC,EAAM,EAAG,GACxCvhB,KAAKoC,IAAO,GAETpC,IACX,EAMAqP,EAAO7P,UAAU0jB,OAAS,WACtB,IAAIzB,EAAOzhB,KAAKyhB,KACZC,EAAO1hB,KAAK0hB,KACZtf,EAAOpC,KAAKoC,IAOhB,OANApC,KAAKuU,QAAQlE,OAAOjO,GAChBA,IACApC,KAAK0hB,KAAKrZ,KAAOoZ,EAAKpZ,KACtBrI,KAAK0hB,KAAOA,EACZ1hB,KAAKoC,KAAOA,GAETpC,IACX,EAMAqP,EAAO7P,UAAU2jB,OAAS,WAItB,IAHA,IAAI1B,EAAOzhB,KAAKyhB,KAAKpZ,KACjBmH,EAAOxP,KAAKsP,YAAYO,MAAM7P,KAAKoC,KACnC0E,EAAO,EACJ2a,GACHA,EAAK5hB,GAAG4hB,EAAKxW,IAAKuE,EAAK1I,GACvBA,GAAO2a,EAAKrf,IACZqf,EAAOA,EAAKpZ,KAGhB,OAAOmH,CACX,EAEAH,EAAOO,WAAa,SAASwT,GACzBhU,EAAegU,EACf/T,EAAOzQ,OAASA,IAChBwQ,EAAaQ,YACjB,qCC/cA,IAAI9M,EAAOxE,EA2OX,SAAS+kB,EAAMnC,EAAKoC,EAAKlI,GACrB,IAAK,IAAIlW,EAAOvG,OAAOuG,KAAKoe,GAAM/hB,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,OACnCrC,IAAjBgiB,EAAIhc,EAAK3D,KAAsB6Z,IAC/B8F,EAAIhc,EAAK3D,IAAM+hB,EAAIpe,EAAK3D,KAChC,OAAO2f,CACX,CAmBA,SAASqC,EAASxiB,GAEd,SAASyiB,EAAYhX,EAAS0S,GAE1B,KAAMlf,gBAAgBwjB,GAClB,OAAO,IAAIA,EAAYhX,EAAS0S,GAKpCvgB,OAAO0K,eAAerJ,KAAM,UAAW,CAAEZ,IAAK,WAAa,OAAOoN,CAAS,IAGvEhO,MAAMilB,kBACNjlB,MAAMilB,kBAAkBzjB,KAAMwjB,GAE9B7kB,OAAO0K,eAAerJ,KAAM,QAAS,CAAEhB,OAAO,IAAIR,OAAQiI,OAAS,KAEnEyY,GACAmE,EAAMrjB,KAAMkf,EACpB,CA2BA,OAzBAsE,EAAYhkB,UAAYb,OAAOC,OAAOJ,MAAMgB,UAAW,CACnD8P,YAAa,CACTtQ,MAAOwkB,EACPE,UAAU,EACVhY,YAAY,EACZC,cAAc,GAElB5K,KAAM,CACF3B,IAAK,WAAiB,OAAO2B,CAAM,EACnCzB,SAAKJ,EACLwM,YAAY,EAKZC,cAAc,GAElBtF,SAAU,CACNrH,MAAO,WAAmB,OAAOgB,KAAKe,KAAO,KAAOf,KAAKwM,OAAS,EAClEkX,UAAU,EACVhY,YAAY,EACZC,cAAc,KAIf6X,CACX,CAhTA1gB,EAAK6gB,UAAY,EAAQ,MAGzB7gB,EAAKiZ,OAAS,EAAQ,MAGtBjZ,EAAKnC,aAAe,EAAQ,MAG5BmC,EAAK8f,MAAQ,EAAQ,MAGrB9f,EAAKod,QAAU,EAAQ,MAGvBpd,EAAK2M,KAAO,EAAQ,MAGpB3M,EAAKkf,KAAO,EAAQ,MAGpBlf,EAAKib,SAAW,EAAQ,MAOxBjb,EAAK8gB,OAAS9W,QAA0B,oBAAXyE,QACPA,QACAA,OAAOH,SACPG,OAAOH,QAAQC,UACfE,OAAOH,QAAQC,SAASC,MAO9CxO,EAAKyO,OAASzO,EAAK8gB,QAAUrS,QACG,oBAAXR,QAA0BA,QACf,oBAAXzG,MAA0BA,MACjCtK,KAQd8C,EAAKQ,WAAa3E,OAAOmd,OAASnd,OAAOmd,OAAO,IAAiC,GAOjFhZ,EAAKoZ,YAAcvd,OAAOmd,OAASnd,OAAOmd,OAAO,CAAC,GAAgC,CAAC,EAQnFhZ,EAAKqX,UAAY5P,OAAO4P,WAAwC,SAAmBnb,GAC/E,MAAwB,iBAAVA,GAAsB6kB,SAAS7kB,IAAUiK,KAAK6a,MAAM9kB,KAAWA,CACjF,EAOA8D,EAAKqN,SAAW,SAAkBnR,GAC9B,MAAwB,iBAAVA,GAAsBA,aAAiBgQ,MACzD,EAOAlM,EAAKoX,SAAW,SAAkBlb,GAC9B,OAAOA,GAA0B,iBAAVA,CAC3B,EAUA8D,EAAKihB,MAQLjhB,EAAKkhB,MAAQ,SAAezR,EAAK5E,GAC7B,IAAI3O,EAAQuT,EAAI5E,GAChB,QAAa,MAAT3O,IAAiBuT,EAAI9S,eAAekO,MACZ,iBAAV3O,IAAuB2C,MAAM2Q,QAAQtT,GAASA,EAAMyC,OAAS9C,OAAOuG,KAAKlG,GAAOyC,QAAU,EAEhH,EAaAqB,EAAKkN,OAAS,WACV,IACI,IAAIA,EAASlN,EAAKod,QAAQ,UAAUlQ,OAEpC,OAAOA,EAAOxQ,UAAUmQ,UAAYK,EAAoC,IAC5E,CAAE,MAAOiU,GAEL,OAAO,IACX,CACH,CATa,GAYdnhB,EAAKsN,aAAe,KAGpBtN,EAAKgN,oBAAsB,KAO3BhN,EAAKmZ,UAAY,SAAmBiI,GAEhC,MAA8B,iBAAhBA,EACRphB,EAAKkN,OACDlN,EAAKgN,oBAAoBoU,GACzB,IAAIphB,EAAKnB,MAAMuiB,GACnBphB,EAAKkN,OACDlN,EAAKsN,aAAa8T,GACI,oBAAfjU,WACHiU,EACA,IAAIjU,WAAWiU,EACjC,EAMAphB,EAAKnB,MAA8B,oBAAfsO,WAA6BA,WAAwCtO,MAezFmB,EAAKwX,KAAkCxX,EAAKyO,OAAO4S,SAAsCrhB,EAAKyO,OAAO4S,QAAQ7J,MACtExX,EAAKyO,OAAO+I,MACvCxX,EAAKod,QAAQ,QAOzBpd,EAAKshB,OAAS,mBAOdthB,EAAKuhB,QAAU,wBAOfvhB,EAAKwhB,QAAU,6CAOfxhB,EAAKyhB,WAAa,SAAoBvlB,GAClC,OAAOA,EACD8D,EAAKib,SAASQ,KAAKvf,GAAO4f,SAC1B9b,EAAKib,SAASM,QACxB,EAQAvb,EAAK0hB,aAAe,SAAsBpX,EAAMwB,GAC5C,IAAIqE,EAAOnQ,EAAKib,SAASY,SAASvR,GAClC,OAAItK,EAAKwX,KACExX,EAAKwX,KAAKmK,SAASxR,EAAK+K,GAAI/K,EAAKgL,GAAIrP,GACzCqE,EAAKpE,SAAS/B,QAAQ8B,GACjC,EAiBA9L,EAAKugB,MAAQA,EAObvgB,EAAK4hB,QAAU,SAAiB3e,GAC5B,OAAOA,EAAIc,OAAO,GAAGuT,cAAgBrU,EAAI0B,UAAU,EACvD,EA0DA3E,EAAKygB,SAAWA,EAmBhBzgB,EAAK6hB,cAAgBpB,EAAS,iBAoB9BzgB,EAAK+a,YAAc,SAAkBN,GAEjC,IADA,IAAIqH,EAAW,CAAC,EACPrjB,EAAI,EAAGA,EAAIgc,EAAW9b,SAAUF,EACrCqjB,EAASrH,EAAWhc,IAAM,EAO9B,OAAO,WACH,IAAK,IAAI2D,EAAOvG,OAAOuG,KAAKlF,MAAOuB,EAAI2D,EAAKzD,OAAS,EAAGF,GAAK,IAAKA,EAC9D,GAA0B,IAAtBqjB,EAAS1f,EAAK3D,UAA+BrC,IAAlBc,KAAKkF,EAAK3D,KAAuC,OAAlBvB,KAAKkF,EAAK3D,IACpE,OAAO2D,EAAK3D,EACxB,CACJ,EAeAuB,EAAKgb,YAAc,SAAkBP,GAQjC,OAAO,SAASxc,GACZ,IAAK,IAAIQ,EAAI,EAAGA,EAAIgc,EAAW9b,SAAUF,EACjCgc,EAAWhc,KAAOR,UACXf,KAAKud,EAAWhc,GACnC,CACJ,EAkBAuB,EAAKwY,cAAgB,CACjBuJ,MAAO7V,OACP8V,MAAO9V,OACPF,MAAOE,OACP0L,MAAM,GAIV5X,EAAK8M,WAAa,WACd,IAAII,EAASlN,EAAKkN,OAEbA,GAMLlN,EAAKsN,aAAeJ,EAAOuO,OAAStO,WAAWsO,MAAQvO,EAAOuO,MAE1D,SAAqBvf,EAAO+lB,GACxB,OAAO,IAAI/U,EAAOhR,EAAO+lB,EAC7B,EACJjiB,EAAKgN,oBAAsBE,EAAOgV,aAE9B,SAA4BvmB,GACxB,OAAO,IAAIuR,EAAOvR,EACtB,GAdAqE,EAAKsN,aAAetN,EAAKgN,oBAAsB,IAevD,YCrbA,SAASmV,EAAeC,EAAUjL,GAET,kBAAZA,IACTA,EAAU,CAAEkL,QAASlL,IAGvBja,KAAKolB,kBAAoBC,KAAKC,MAAMD,KAAKE,UAAUL,IACnDllB,KAAKwlB,UAAYN,EACjBllB,KAAKylB,SAAWxL,GAAW,CAAC,EAC5Bja,KAAK0lB,cAAgBzL,GAAWA,EAAQ0L,cAAgBC,IACxD5lB,KAAK6lB,IAAM,KACX7lB,KAAK8lB,QAAU,GACf9lB,KAAK+lB,UAAY,EACjB/lB,KAAKgmB,kBAAoB,KACzBhmB,KAAKimB,oBAAsB,KAC3BjmB,KAAKkmB,SAAW,KAChBlmB,KAAKmmB,gBAAkB,KACvBnmB,KAAKomB,OAAS,KAEVpmB,KAAKylB,SAASN,UAChBnlB,KAAKqmB,gBAAkBrmB,KAAKwlB,UAAUtkB,MAAM,GAEhD,CACA7C,EAAOC,QAAU2mB,EAEjBA,EAAezlB,UAAU+U,MAAQ,WAC/BvU,KAAK+lB,UAAY,EACjB/lB,KAAKwlB,UAAYxlB,KAAKolB,kBAAkBlkB,MAAM,EAChD,EAEA+jB,EAAezlB,UAAU8mB,KAAO,WAC1BtmB,KAAKkmB,UACPK,aAAavmB,KAAKkmB,UAEhBlmB,KAAKomB,QACPG,aAAavmB,KAAKomB,QAGpBpmB,KAAKwlB,UAAkB,GACvBxlB,KAAKqmB,gBAAkB,IACzB,EAEApB,EAAezlB,UAAUgnB,MAAQ,SAASC,GAKxC,GAJIzmB,KAAKkmB,UACPK,aAAavmB,KAAKkmB,WAGfO,EACH,OAAO,EAET,IAAIC,GAAc,IAAIlc,MAAOmc,UAC7B,GAAIF,GAAOC,EAAc1mB,KAAKmmB,iBAAmBnmB,KAAK0lB,cAGpD,OAFA1lB,KAAK8lB,QAAQtlB,KAAKimB,GAClBzmB,KAAK8lB,QAAQlb,QAAQ,IAAIpM,MAAM,qCACxB,EAGTwB,KAAK8lB,QAAQtlB,KAAKimB,GAElB,IAAIG,EAAU5mB,KAAKwlB,UAAUld,QAC7B,QAAgBpJ,IAAZ0nB,EAAuB,CACzB,IAAI5mB,KAAKqmB,gBAKP,OAAO,EAHPrmB,KAAK8lB,QAAQ5a,OAAO,EAAGlL,KAAK8lB,QAAQrkB,OAAS,GAC7CmlB,EAAU5mB,KAAKqmB,gBAAgBnlB,OAAO,EAI1C,CAEA,IAAIoJ,EAAOtK,KAqBX,OApBAA,KAAKomB,OAASS,YAAW,WACvBvc,EAAKyb,YAEDzb,EAAK2b,sBACP3b,EAAK4b,SAAWW,YAAW,WACzBvc,EAAK2b,oBAAoB3b,EAAKyb,UAChC,GAAGzb,EAAK0b,mBAEJ1b,EAAKmb,SAASqB,OACdxc,EAAK4b,SAASY,SAIpBxc,EAAKub,IAAIvb,EAAKyb,UAChB,GAAGa,GAEC5mB,KAAKylB,SAASqB,OACd9mB,KAAKomB,OAAOU,SAGT,CACT,EAEA7B,EAAezlB,UAAUunB,QAAU,SAASlnB,EAAImnB,GAC9ChnB,KAAK6lB,IAAMhmB,EAEPmnB,IACEA,EAAWJ,UACb5mB,KAAKgmB,kBAAoBgB,EAAWJ,SAElCI,EAAWC,KACbjnB,KAAKimB,oBAAsBe,EAAWC,KAI1C,IAAI3c,EAAOtK,KACPA,KAAKimB,sBACPjmB,KAAKkmB,SAAWW,YAAW,WACzBvc,EAAK2b,qBACP,GAAG3b,EAAK0b,oBAGVhmB,KAAKmmB,iBAAkB,IAAI3b,MAAOmc,UAElC3mB,KAAK6lB,IAAI7lB,KAAK+lB,UAChB,EAEAd,EAAezlB,UAAU0nB,IAAM,SAASrnB,GACtCoN,QAAQ7B,IAAI,4CACZpL,KAAK+mB,QAAQlnB,EACf,EAEAolB,EAAezlB,UAAUwH,MAAQ,SAASnH,GACxCoN,QAAQ7B,IAAI,8CACZpL,KAAK+mB,QAAQlnB,EACf,EAEAolB,EAAezlB,UAAUwH,MAAQie,EAAezlB,UAAU0nB,IAE1DjC,EAAezlB,UAAU2nB,OAAS,WAChC,OAAOnnB,KAAK8lB,OACd,EAEAb,EAAezlB,UAAU4nB,SAAW,WAClC,OAAOpnB,KAAK+lB,SACd,EAEAd,EAAezlB,UAAU6nB,UAAY,WACnC,GAA4B,IAAxBrnB,KAAK8lB,QAAQrkB,OACf,OAAO,KAOT,IAJA,IAAI6lB,EAAS,CAAC,EACVD,EAAY,KACZE,EAAiB,EAEZhmB,EAAI,EAAGA,EAAIvB,KAAK8lB,QAAQrkB,OAAQF,IAAK,CAC5C,IAAIimB,EAAQxnB,KAAK8lB,QAAQvkB,GACrBiL,EAAUgb,EAAMhb,QAChBib,GAASH,EAAO9a,IAAY,GAAK,EAErC8a,EAAO9a,GAAWib,EAEdA,GAASF,IACXF,EAAYG,EACZD,EAAiBE,EAErB,CAEA,OAAOJ,CACT,8BCxJA,SAASnH,QAAQwH,YACb,IACI,IAAIC,IAAMC,KAAK,QAAQ5hB,QAAQ,IAAI,MAAzB4hB,CAAgCF,YAC1C,GAAIC,MAAQA,IAAIlmB,QAAU9C,OAAOuG,KAAKyiB,KAAKlmB,QACvC,OAAOkmB,GACf,CAAE,MAAO1D,GAAI,CACb,OAAO,IACX,CAfA5lB,OAAOC,QAAU4hB,+BCQjB,SAASvf,IAOLX,KAAK6nB,WAAa,CAAC,CACvB,CAhBAxpB,EAAOC,QAAUqC,EAyBjBA,EAAanB,UAAUiD,GAAK,SAAYnC,EAAKT,EAAIioB,GAK7C,OAJC9nB,KAAK6nB,WAAWvnB,KAASN,KAAK6nB,WAAWvnB,GAAO,KAAKE,KAAK,CACvDX,GAAMA,EACNioB,IAAMA,GAAO9nB,OAEVA,IACX,EAQAW,EAAanB,UAAUmD,IAAM,SAAarC,EAAKT,GAC3C,QAAYX,IAARoB,EACAN,KAAK6nB,WAAa,CAAC,OAEnB,QAAW3oB,IAAPW,EACAG,KAAK6nB,WAAWvnB,GAAO,QAGvB,IADA,IAAIe,EAAYrB,KAAK6nB,WAAWvnB,GACvBiB,EAAI,EAAGA,EAAIF,EAAUI,QACtBJ,EAAUE,GAAG1B,KAAOA,EACpBwB,EAAU6J,OAAO3J,EAAG,KAElBA,EAGlB,OAAOvB,IACX,EAQAW,EAAanB,UAAUqC,KAAO,SAAcvB,GACxC,IAAIe,EAAYrB,KAAK6nB,WAAWvnB,GAChC,GAAIe,EAAW,CAGX,IAFA,IAAIc,EAAO,GACPZ,EAAI,EACDA,EAAIc,UAAUZ,QACjBU,EAAK3B,KAAK6B,UAAUd,MACxB,IAAKA,EAAI,EAAGA,EAAIF,EAAUI,QACtBJ,EAAUE,GAAG1B,GAAG0C,MAAMlB,EAAUE,KAAKumB,IAAK3lB,EAClD,CACA,OAAOnC,IACX,+BC1EA,IAAI+nB,EAAWzpB,EA2Bf,SAAS0pB,IACLD,EAASjlB,KAAK8M,aACdmY,EAAS1Y,OAAOO,WAAWmY,EAAS3Y,cACpC2Y,EAASpI,OAAO/P,WAAWmY,EAASrI,aACxC,CAvBAqI,EAASE,MAAQ,UAGjBF,EAAS1Y,OAAe,EAAQ,MAChC0Y,EAAS3Y,aAAe,EAAQ,KAChC2Y,EAASpI,OAAe,EAAQ,MAChCoI,EAASrI,aAAe,EAAQ,MAGhCqI,EAASjlB,KAAe,EAAQ,MAChCilB,EAASG,IAAe,EAAQ,MAChCH,EAASjI,MAAe,EAAQ,MAChCiI,EAASC,UAAeA,EAcxBA,2BClCA3pB,EAAOC,QAAU,CAAC,+BCAlBD,EAAOC,QAAUgnB,EAEjBA,EAAM6C,SAAW,KACjB7C,EAAMjiB,SAAW,CAAE+kB,UAAU,GAE7B,IAAIhjB,EAAY,EAAQ,KACpBijB,EAAY,EAAQ,MACpBvO,EAAY,EAAQ,MACpBH,EAAY,EAAQ,MACpB2O,EAAY,EAAQ,MACpBhL,EAAY,EAAQ,MACpBzY,EAAY,EAAQ,MACpB0jB,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpB5O,EAAmB,EAAQ,MAC3B/W,EAAY,EAAQ,KACpBC,EAAY,EAAQ,MAEpB2lB,EAAc,gBACdC,EAAc,kBACdC,EAAc,qBACdC,EAAc,uBACdC,EAAc,YACdC,EAAc,cACdC,EAAc,oDACdC,EAAc,2BACdC,EAAc,+DAkClB,SAAS3D,EAAMnf,EAAQ6K,EAAMiJ,GAEnBjJ,aAAgBqX,IAClBpO,EAAUjJ,EACVA,EAAO,IAAIqX,GAEVpO,IACDA,EAAUqL,EAAMjiB,UAEpB,IASI6lB,EACAC,EACAC,EAsyBAjgB,EAjzBAkgB,EAAwBpP,EAAQoP,wBAAyB,EACzDC,EAAKlkB,EAASe,EAAQ8T,EAAQ7T,uBAAwB,GACtDiC,EAAOihB,EAAGjhB,KACV7H,EAAO8oB,EAAG9oB,KACV4I,EAAOkgB,EAAGlgB,KACVE,EAAOggB,EAAGhgB,KACVE,EAAO8f,EAAG9f,KAEViY,GAAO,EAIP9G,EAAU,SAEV4O,EAAMvY,EAENwY,EAAkB,GAClBC,EAAkB,CAAC,EAEnBC,EAAYzP,EAAQmO,SAAW,SAASrnB,GAAQ,OAAOA,CAAM,EAAI+B,EAAK4d,UAa1E,SAAS/Z,EAAQwC,EAAOpI,EAAM4oB,GAC1B,IAAIxB,EAAW7C,EAAM6C,SAGrB,OAFKwB,IACDrE,EAAM6C,SAAW,MACd3pB,MAAM,YAAcuC,GAAQ,SAAW,KAAOoI,EAAQ,OAASgf,EAAWA,EAAW,KAAO,IAAM,QAAUmB,EAAGhjB,KAAO,IACjI,CAEA,SAASqC,IACL,IACIQ,EADAlG,EAAS,GAEb,EAAG,CAEC,GAAyB,OAApBkG,EAAQd,MAA8B,MAAVc,EAC7B,MAAMxC,EAAQwC,GAElBlG,EAAOzC,KAAK6H,KACZiB,EAAKH,GACLA,EAAQC,GACZ,OAAmB,MAAVD,GAA4B,MAAVA,GAC3B,OAAOlG,EAAO4E,KAAK,GACvB,CAEA,SAAS+hB,EAAUC,GACf,IAAI1gB,EAAQd,IACZ,OAAQc,GACJ,IAAK,IACL,IAAK,IAED,OADA3I,EAAK2I,GACER,IACX,IAAK,OAAQ,IAAK,OACd,OAAO,EACX,IAAK,QAAS,IAAK,QACf,OAAO,EAEf,IACI,OAoDR,SAAqBQ,GACjB,IAAImV,EAAO,EAKX,OAJwB,MAApBnV,EAAMtC,OAAO,KACbyX,GAAQ,EACRnV,EAAQA,EAAM1B,UAAU,IAEpB0B,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAOmV,GAAOsH,KAClB,IAAK,MAAO,IAAK,MAAO,IAAK,MAAO,IAAK,MACrC,OAAOkE,IACX,IAAK,IACD,OAAO,EAEf,GAAIrB,EAAStgB,KAAKgB,GACd,OAAOmV,EAAOE,SAASrV,EAAO,IAClC,GAAIwf,EAASxgB,KAAKgB,GACd,OAAOmV,EAAOE,SAASrV,EAAO,IAClC,GAAI0f,EAAQ1gB,KAAKgB,GACb,OAAOmV,EAAOE,SAASrV,EAAO,GAGlC,GAAI4f,EAAS5gB,KAAKgB,GACd,OAAOmV,EAAOyL,WAAW5gB,GAG7B,MAAMxC,EAAQwC,EAAO,UA9E8B,EA+EvD,CA/Ee6gB,CAAY7gB,EACvB,CAAE,MAAO8a,GAEL,GAAI4F,GAAiBZ,EAAU9gB,KAAKgB,GAChC,OAAOA,EAGX,MAAMxC,EAAQwC,EAAO,QACzB,CACJ,CAEA,SAAS8gB,EAAWC,EAAQC,GACxB,IAAIhhB,EAAOnC,EACX,GACI,IAAImjB,GAAuC,OAApBhhB,EAAQC,MAA8B,MAAVD,EAO/C,IACI+gB,EAAO1pB,KAAK,CAAEwG,EAAQojB,EAAQ/hB,KAASiB,EAAK,MAAM,GAAQ8gB,EAAQ/hB,KAAUrB,GAChF,CAAE,MAAOyf,GACL,KAAI0D,GAAiBlB,EAAU9gB,KAAKgB,IAAUwR,GAAW,MAGrD,MAAM8L,EAFNyD,EAAO1pB,KAAK2I,EAIpB,KAf+D,CAC/D,IAAIpD,EAAM4C,IAEV,GADAuhB,EAAO1pB,KAAKuF,GACR4U,GAAW,KACX,MAAMhU,EAAQZ,EAAK,KAE3B,QAWKuD,EAAK,KAAK,IACnB,IAAI+gB,EAAQ,CAACpQ,aAAS/a,EACtBmrB,UAAkB,SAAStpB,EAAM/B,QACVE,IAAjBc,KAAKia,UAAuBja,KAAKia,QAAU,CAAC,GAChDja,KAAKia,QAAQlZ,GAAQ/B,CACvB,GACAsrB,EACID,GACA,SAA0BlhB,GAExB,GAAc,WAAVA,EAIF,MAAMxC,EAAQwC,GAHdohB,GAAYF,EAAOlhB,GACnBG,EAAK,IAGT,IACA,WACEkhB,GAAmBH,EACrB,GACR,CA+BA,SAASD,EAAQjhB,EAAOshB,GACpB,OAAQthB,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAO,UACX,IAAK,IACD,OAAO,EAIf,IAAKshB,GAAsC,MAApBthB,EAAMtC,OAAO,GAChC,MAAMF,EAAQwC,EAAO,MAEzB,GAAIuf,EAAYvgB,KAAKgB,GACjB,OAAOqV,SAASrV,EAAO,IAC3B,GAAIyf,EAAYzgB,KAAKgB,GACjB,OAAOqV,SAASrV,EAAO,IAG3B,GAAI2f,EAAW3gB,KAAKgB,GAChB,OAAOqV,SAASrV,EAAO,GAG3B,MAAMxC,EAAQwC,EAAO,KACzB,CAEA,SAASuhB,IAEL,QAAYxrB,IAARgqB,EACA,MAAMviB,EAAQ,WAKlB,GAHAuiB,EAAM7gB,KAGD4gB,EAAU9gB,KAAK+gB,GAChB,MAAMviB,EAAQuiB,EAAK,QAEvBK,EAAMA,EAAIoB,OAAOzB,GAEjB5f,EAAK,IACT,CAEA,SAASshB,IACL,IACIC,EADA1hB,EAAQC,IAEZ,OAAQD,GACJ,IAAK,OACD0hB,EAAezB,IAAgBA,EAAc,IAC7C/gB,IACA,MACJ,IAAK,SACDA,IAEJ,QACIwiB,EAAe1B,IAAYA,EAAU,IAG7ChgB,EAAQR,IACRW,EAAK,KACLuhB,EAAarqB,KAAK2I,EACtB,CAEA,SAAS2hB,IAKL,GAJAxhB,EAAK,MACLqR,EAAUhS,KAGI,KACV,MAAMhC,EAAQgU,EAAS,UAE3BrR,EAAK,IACT,CAEA,SAASyhB,IAML,GALAzhB,EAAK,KACLqR,EAAUhS,KACgB,CAAC,QAGJqiB,SAASrQ,GAC5B,MAAMhU,EAAQgU,EAAS,WAE3BrR,EAAK,IACT,CAGA,SAAS2hB,EAAYvP,EAAQvS,GACzB,OAAQA,GAEJ,IAAK,SAGD,OAFAohB,GAAY7O,EAAQvS,GACpBG,EAAK,MACE,EAEX,IAAK,UAED,OADA4hB,EAAUxP,EAAQvS,IACX,EAEX,IAAK,OAED,OADAgiB,GAAUzP,EAAQvS,IACX,EAEX,IAAK,UAED,OAycZ,SAAsBuS,EAAQvS,GAG1B,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,gBAEzB,IAAIiiB,EAAU,IAAI7C,EAAQpf,GAC1BmhB,EAAQc,GAAS,SAA4BjiB,GACzC,IAAI8hB,EAAYG,EAASjiB,GAAzB,CAKA,GAAc,QAAVA,EAGA,MAAMxC,EAAQwC,IAQ1B,SAAqBuS,EAAQvS,GAGzB,IAAIkiB,EAAc7hB,IAEdrE,EAAOgE,EAGX,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,IACImiB,EAAaC,EACbC,EAAcC,EAFd1qB,EAAOoI,EASX,GALAG,EAAK,KACDA,EAAK,UAAU,KACfiiB,GAAgB,IAGftC,EAAU9gB,KAAKgB,EAAQd,KACxB,MAAM1B,EAAQwC,GAQlB,GANAmiB,EAAcniB,EACdG,EAAK,KAAMA,EAAK,WAAYA,EAAK,KAC7BA,EAAK,UAAU,KACfmiB,GAAiB,IAGhBxC,EAAU9gB,KAAKgB,EAAQd,KACxB,MAAM1B,EAAQwC,GAElBqiB,EAAeriB,EACfG,EAAK,KAEL,IAAIsK,EAAS,IAAI4U,EAAOznB,EAAMoE,EAAMmmB,EAAaE,EAAcD,EAAeE,GAC9E7X,EAAOxM,QAAUikB,EACjBf,EAAQ1W,GAAQ,SAA2BzK,GAGvC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAY3W,EAAQzK,GACpBG,EAAK,IAIb,IACAoS,EAAOsB,IAAIpJ,EACf,CA1DY8X,CAAYN,EAASjiB,EAJzB,CAOJ,IACAuS,EAAOsB,IAAIoO,GACP1P,IAAW6N,GACXC,EAAgBhpB,KAAK4qB,EAE7B,CAheYO,CAAajQ,EAAQvS,IACd,EAEX,IAAK,SAED,OA+gBZ,SAAwBuS,EAAQvS,GAG5B,IAAK8f,EAAU9gB,KAAKgB,EAAQd,KACxB,MAAM1B,EAAQwC,EAAO,aAEzB,IAAIyiB,EAAYziB,EAChBmhB,EAAQ,MAAM,SAA8BnhB,GACxC,OAAQA,GAEJ,IAAK,WACL,IAAK,WACD0iB,GAAWnQ,EAAQvS,EAAOyiB,GAC1B,MAEJ,IAAK,WAGGC,GAAWnQ,EADC,WAAZf,EACmB,kBAEA,WAFmBiR,GAI1C,MAEJ,QAEI,GAAgB,WAAZjR,IAAyBsO,EAAU9gB,KAAKgB,GACxC,MAAMxC,EAAQwC,GAClB3I,EAAK2I,GACL0iB,GAAWnQ,EAAQ,WAAYkQ,GAG3C,GACJ,CAjjBYE,CAAepQ,EAAQvS,IAChB,EAEf,OAAO,CACX,CAEA,SAASmhB,EAAQ/X,EAAKwZ,EAAMC,GACxB,IAAIviB,EAAe6f,EAAGhjB,KAOtB,GANIiM,IAC0B,iBAAhBA,EAAInL,UACZmL,EAAInL,QAAUoC,KAEhB+I,EAAI4V,SAAW7C,EAAM6C,UAErB7e,EAAK,KAAK,GAAO,CAEjB,IADA,IAAIH,EACwB,OAApBA,EAAQd,MACZ0jB,EAAK5iB,GACTG,EAAK,KAAK,EACd,MACQ0iB,GACAA,IACJ1iB,EAAK,KACDiJ,IAA+B,iBAAhBA,EAAInL,SAAwBiiB,KAC3C9W,EAAInL,QAAUoC,EAAKC,IAAiB8I,EAAInL,QAEpD,CAEA,SAAS8jB,EAAUxP,EAAQvS,GAGvB,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,aAEzB,IAAIhE,EAAO,IAAI2U,EAAK3Q,GACpBmhB,EAAQnlB,GAAM,SAAyBgE,GACnC,IAAI8hB,EAAY9lB,EAAMgE,GAGtB,OAAQA,GAEJ,IAAK,OAyKjB,SAAuBuS,GACnBpS,EAAK,KACL,IAAIvE,EAAUsD,IAGd,QAA8BnJ,IAA1B2D,EAAMW,OAAOuB,GACb,MAAM4B,EAAQ5B,EAAS,QAE3BuE,EAAK,KACL,IAAI2iB,EAAY5jB,IAGhB,IAAK4gB,EAAU9gB,KAAK8jB,GAChB,MAAMtlB,EAAQslB,EAAW,QAE7B3iB,EAAK,KACL,IAAIvI,EAAOsH,IAGX,IAAK2gB,EAAO7gB,KAAKpH,GACb,MAAM4F,EAAQ5F,EAAM,QAExBuI,EAAK,KACL,IAAItF,EAAQ,IAAIskB,EAASoB,EAAU3oB,GAAOqpB,EAAQ/hB,KAAStD,EAASknB,GACpE3B,EAAQtmB,GAAO,SAA6BmF,GAGxC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAYvmB,EAAOmF,GACnBG,EAAK,IAIb,IAAG,WACCkhB,GAAmBxmB,EACvB,IACA0X,EAAOsB,IAAIhZ,EACf,CA7MgBkoB,CAAc/mB,GACd,MAEJ,IAAK,WACD,GAAgB,WAAZwV,EACA,MAAMhU,EAAQwC,GAEtB,IAAK,WACD0iB,GAAW1mB,EAAMgE,GACjB,MAEJ,IAAK,WAED,GAAgB,WAAZwR,EACAkR,GAAW1mB,EAAM,uBACd,IAAgB,WAAZwV,EACP,MAAMhU,EAAQwC,GAEd0iB,GAAW1mB,EAAM,WACrB,CACA,MAEJ,IAAK,SAyLjB,SAAoBuW,EAAQvS,GAGxB,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,IAAIqU,EAAQ,IAAIF,EAAMoM,EAAUvgB,IAChCmhB,EAAQ9M,GAAO,SAA0BrU,GACvB,WAAVA,GACAohB,GAAY/M,EAAOrU,GACnBG,EAAK,OAEL9I,EAAK2I,GACL0iB,GAAWrO,EAAO,YAE1B,IACA9B,EAAOsB,IAAIQ,EACf,CAzMgB2O,CAAWhnB,EAAMgE,GACjB,MAEJ,IAAK,aACD8gB,EAAW9kB,EAAKinB,aAAejnB,EAAKinB,WAAa,KACjD,MAEJ,IAAK,WACDnC,EAAW9kB,EAAKknB,WAAalnB,EAAKknB,SAAW,KAAK,GAClD,MAEJ,QAEI,GAAgB,WAAZ1R,IAAyBsO,EAAU9gB,KAAKgB,GACxC,MAAMxC,EAAQwC,GAGlB3I,EAAK2I,GACL0iB,GAAW1mB,EAAM,YAG7B,IACAuW,EAAOsB,IAAI7X,GACPuW,IAAW6N,GACXC,EAAgBhpB,KAAK2E,EAE7B,CAEA,SAAS0mB,GAAWnQ,EAAQ1B,EAAMxO,GAC9B,IAAIrG,EAAOkD,IACX,GAAa,UAATlD,EAAJ,CAWA,KAAOA,EAAKmnB,SAAS,MAAQljB,IAAOmjB,WAAW,MAC3CpnB,GAAQkD,IAIZ,IAAK4gB,EAAU9gB,KAAKhD,GAChB,MAAMwB,EAAQxB,EAAM,QAExB,IAAIpE,EAAOsH,IAIX,IAAK2gB,EAAO7gB,KAAKpH,GACb,MAAM4F,EAAQ5F,EAAM,QAExBA,EAAO2oB,EAAU3oB,GACjBuI,EAAK,KAEL,IAAItF,EAAQ,IAAI2V,EAAM5Y,EAAMqpB,EAAQ/hB,KAASlD,EAAM6U,EAAMxO,GAezD,GAbA8e,EAAQtmB,GAAO,SAA0BmF,GAGrC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAYvmB,EAAOmF,GACnBG,EAAK,IAIb,IAAG,WACCkhB,GAAmBxmB,EACvB,IAEa,oBAATgW,EAA4B,CAE5B,IAAIwD,EAAQ,IAAIF,EAAM,IAAMvc,GAC5BiD,EAAMmX,UAAU,mBAAmB,GACnCqC,EAAMR,IAAIhZ,GACV0X,EAAOsB,IAAIQ,EACf,MACI9B,EAAOsB,IAAIhZ,GAEX0X,IAAW6N,GACXC,EAAgBhpB,KAAKwD,EAnDzB,MAuDJ,SAAoB0X,EAAQ1B,GACxB,GAAIW,GAAW,KACX,MAAMhU,EAAQ,SAElB,IAAI5F,EAAOsH,IAGX,IAAK2gB,EAAO7gB,KAAKpH,GACb,MAAM4F,EAAQ5F,EAAM,QAExB,IAAIgc,EAAYja,EAAK4hB,QAAQ3jB,GACzBA,IAASgc,IACThc,EAAO+B,EAAKyd,QAAQxf,IACxBuI,EAAK,KACL,IAAIoH,EAAK0Z,EAAQ/hB,KACblD,EAAO,IAAI2U,EAAK/Y,GACpBoE,EAAKmX,OAAQ,EACb,IAAItY,EAAQ,IAAI2V,EAAMoD,EAAWrM,EAAI3P,EAAMiZ,GAC3ChW,EAAMmkB,SAAW7C,EAAM6C,SACvBmC,EAAQnlB,GAAM,SAA0BgE,GACpC,OAAQA,GAEJ,IAAK,SACDohB,GAAYplB,EAAMgE,GAClBG,EAAK,KACL,MACJ,IAAK,WACL,IAAK,WACDuiB,GAAW1mB,EAAMgE,GACjB,MAEJ,IAAK,WAGG0iB,GAAW1mB,EADC,WAAZwV,EACiB,kBAEA,YAErB,MAEJ,IAAK,UACDuQ,EAAU/lB,EAAMgE,GAChB,MAEJ,IAAK,OACDgiB,GAAUhmB,EAAMgE,GAChB,MAGJ,QACI,MAAMxC,EAAQwC,GAE1B,IACAuS,EAAOsB,IAAI7X,GACJ6X,IAAIhZ,EACf,CAhHQwoB,CAAW9Q,EAAQ1B,EAuD3B,CAqHA,SAASmR,GAAUzP,EAAQvS,GAGvB,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,IAAI6X,EAAM,IAAInc,EAAKsE,GACnBmhB,EAAQtJ,GAAK,SAAyB7X,GACpC,OAAOA,GACL,IAAK,SACHohB,GAAYvJ,EAAK7X,GACjBG,EAAK,KACL,MAEF,IAAK,WACH2gB,EAAWjJ,EAAIqL,WAAarL,EAAIqL,SAAW,KAAK,QAC5BntB,IAAjB8hB,EAAIqL,WAAwBrL,EAAIqL,SAAW,IAC9C,MAEF,SAUR,SAAwB3Q,EAAQvS,GAG5B,IAAK6f,EAAO7gB,KAAKgB,GACb,MAAMxC,EAAQwC,EAAO,QAEzBG,EAAK,KACL,IAAItK,EAAQorB,EAAQ/hB,KAAQ,GACxBgiB,EAAQ,CACJpQ,aAAS/a,EAEjBmrB,UAAkB,SAAStpB,GACvB,OAAOf,KAAKia,QAAQlZ,EACxB,EACAspB,UAAkB,SAAStpB,EAAM/B,GAC7B4a,EAAiBpa,UAAU2b,UAAUla,KAAKopB,EAAOtpB,EAAM/B,EAC3D,EACAqrB,gBAAwB,WAExB,GACAC,EAAQD,GAAO,SAA8BlhB,GAGzC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAYF,EAAOlhB,GACnBG,EAAK,IAIb,IAAG,WACCkhB,GAAmBH,EACvB,IACA3O,EAAOsB,IAAI7T,EAAOnK,EAAOqrB,EAAMjjB,QAASijB,EAAMoC,eAAiBpC,EAAMpQ,QACzE,CA1CUyS,CAAe1L,EAAK7X,GAE1B,IACAuS,EAAOsB,IAAIgE,GACPtF,IAAW6N,GACXC,EAAgBhpB,KAAKwgB,EAE7B,CAqCA,SAASuJ,GAAY7O,EAAQvS,GACrB,IAAIwjB,EACAC,EACAC,GAAW,EAKf,IAJc,WAAV1jB,IACAA,EAAQd,KAGK,MAAVc,GAAe,CAClB,GAAc,MAAVA,EAAe,CACf,IAAI2jB,EAAczkB,IAClBiB,EAAK,KACLH,EAAQ,IAAM2jB,EAAc,GAChC,CACA,GAAID,EAAU,CAEV,GADAA,GAAW,EACP1jB,EAAM6hB,SAAS,OAAS7hB,EAAM6hB,SAAS,KAAM,CAC7C,IAAI+B,EAAS5jB,EAAMzB,MAAM,KACzBilB,EAASI,EAAO,GAAK,IACrB5jB,EAAQ4jB,EAAO,GACf,QACJ,CACAJ,EAASxjB,CACb,MACIyjB,EAAWA,EAAWA,GAAYzjB,EAAQA,EAE9CA,EAAQd,GACZ,CACA,IACI2kB,EAAcC,GAAiBvR,EADxBkR,EAAWD,EAAOvrB,OAAOwrB,GAAYD,GAEhDC,EAAWA,GAA4B,MAAhBA,EAAS,GAAaA,EAAS1rB,MAAM,GAAK0rB,EA6EzE,SAAyBlR,EAAQ3a,EAAM/B,EAAO4tB,GACtClR,EAAOwR,iBACPxR,EAAOwR,gBAAgBnsB,EAAM/B,EAAO4tB,EAC5C,CA9EQM,CAAgBxR,EADhBiR,EAASA,GAAwC,MAA9BA,EAAOA,EAAOlrB,OAAS,GAAakrB,EAAOzrB,MAAM,GAAI,GAAKyrB,EAC7CK,EAAaJ,EACrD,CAEA,SAASK,GAAiBvR,EAAQ3a,GAE9B,GAAIuI,EAAK,KAAK,GAAO,CAGjB,IAFA,IAAI6jB,EAAe,CAAC,GAEZ7jB,EAAK,KAAK,IAAO,CAErB,IAAK0f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,GAAc,OAAVA,EACF,MAAMxC,EAAQwC,EAAO,gBAGvB,IAAInK,EACA4tB,EAAWzjB,EAIf,GAFAG,EAAK,KAAK,GAEK,MAAXF,IAIApK,EAAQiuB,GAAiBvR,EAAQ3a,EAAO,IAAMoI,QAC3C,GAAe,MAAXC,IAAgB,CAEvB,IAAIgkB,EACJ,GAFApuB,EAAQ,GAEJsK,EAAK,KAAK,GAAO,CACjB,GACI8jB,EAAYxD,GAAU,GACtB5qB,EAAMwB,KAAK4sB,SACN9jB,EAAK,KAAK,IACnBA,EAAK,UACoB,IAAd8jB,GACPjS,GAAUO,EAAQ3a,EAAO,IAAMoI,EAAOikB,EAE9C,CACJ,MACIpuB,EAAQ4qB,GAAU,GAClBzO,GAAUO,EAAQ3a,EAAO,IAAMoI,EAAOnK,GAG1C,IAAIqiB,EAAY8L,EAAaP,GAEzBvL,IACAriB,EAAQ,GAAGoC,OAAOigB,GAAWjgB,OAAOpC,IAExCmuB,EAAaP,GAAY5tB,EAGzBsK,EAAK,KAAK,GACVA,EAAK,KAAK,EACd,CAEA,OAAO6jB,CACX,CAEA,IAAIE,EAAczD,GAAU,GAE5B,OADAzO,GAAUO,EAAQ3a,EAAMssB,GACjBA,CAEX,CAEA,SAASlS,GAAUO,EAAQ3a,EAAM/B,GACzBuqB,IAAQ7N,GAAU,cAAcvT,KAAKpH,GACrC0oB,EAAgB1oB,GAAQ/B,EAGxB0c,EAAOP,WACPO,EAAOP,UAAUpa,EAAM/B,EAC/B,CAOA,SAASwrB,GAAmB9O,GACxB,GAAIpS,EAAK,KAAK,GAAO,CACjB,GACIihB,GAAY7O,EAAQ,gBACfpS,EAAK,KAAK,IACnBA,EAAK,IACT,CACA,OAAOoS,CACX,CAgHA,KAA4B,QAApBvS,EAAQd,MACZ,OAAQc,GAEJ,IAAK,UAGD,IAAKsY,EACD,MAAM9a,EAAQwC,GAElBuhB,IACA,MAEJ,IAAK,SAGD,IAAKjJ,EACD,MAAM9a,EAAQwC,GAElByhB,IACA,MAEJ,IAAK,SAGD,IAAKnJ,EACD,MAAM9a,EAAQwC,GAElB2hB,IACA,MAEJ,IAAK,UAED,IAAKrJ,EACD,MAAM9a,EAAQwC,GAClB4hB,IACA,MAEJ,IAAK,SACDR,GAAYhB,EAAKpgB,GACjBG,EAAK,KAAK,GACV,MAEJ,QAGI,GAAI2hB,EAAY1B,EAAKpgB,GAAQ,CACzBsY,GAAO,EACP,QACJ,CAGA,MAAM9a,EAAQwC,GAO1B,OAt1BIqgB,EAAgBrc,SAAQoF,IACpBA,EAAIqI,SAAWD,EACfhc,OAAOuG,KAAKukB,GAAiBtc,SAAQmgB,SACNpuB,IAAvBqT,EAAIgK,UAAU+Q,IAClB/a,EAAI4I,UAAUmS,EAAK7D,EAAgB6D,IAAM,EAAK,GAChD,IAg1BVhI,EAAM6C,SAAW,KACV,CACH,QAAgBe,EAChB,QAAgBC,EACfC,YAAeA,EACfpY,KAAeA,EAExB,+BCl7BU1S,EA6BNiqB,QAAU,EAAQ,6BClCtBlqB,EAAOC,QAAUivB,EAEjB,IA+DIC,EA/DAC,EAAW,QAsBf,SAASF,EAAOxsB,EAAM2Z,GACb+S,EAAStlB,KAAKpH,KACfA,EAAO,mBAAqBA,EAAO,SACnC2Z,EAAO,CAAEgT,OAAQ,CAAEC,OAAQ,CAAED,OAAQ,CAAE3F,SAAU,CAAE2F,OAAQhT,QAE/D6S,EAAOxsB,GAAQ2Z,CACnB,CAWA6S,EAAO,MAAO,CAUVK,IAAK,CACD1f,OAAQ,CACJ2f,SAAU,CACN1oB,KAAM,SACNuL,GAAI,GAER1R,MAAO,CACHmG,KAAM,QACNuL,GAAI,OAQpB6c,EAAO,WAAY,CAUfO,SAAUN,EAAW,CACjBtf,OAAQ,CACJ6f,QAAS,CACL5oB,KAAM,QACNuL,GAAI,GAERsd,MAAO,CACH7oB,KAAM,QACNuL,GAAI,OAMpB6c,EAAO,YAAa,CAUhBU,UAAWT,IAGfD,EAAO,QAAS,CAOZW,MAAO,CACHhgB,OAAQ,CAAC,KAIjBqf,EAAO,SAAU,CASbY,OAAQ,CACJjgB,OAAQ,CACJA,OAAQ,CACJnJ,QAAS,SACTI,KAAM,QACNuL,GAAI,KAkBhB0d,MAAO,CACHC,OAAQ,CACJC,KAAM,CACF9Q,MAAO,CACH,YACA,cACA,cACA,YACA,cACA,eAIZtP,OAAQ,CACJqgB,UAAW,CACPppB,KAAM,YACNuL,GAAI,GAER8d,YAAa,CACTrpB,KAAM,SACNuL,GAAI,GAER+d,YAAa,CACTtpB,KAAM,SACNuL,GAAI,GAERge,UAAW,CACPvpB,KAAM,OACNuL,GAAI,GAERie,YAAa,CACTxpB,KAAM,SACNuL,GAAI,GAERke,UAAW,CACPzpB,KAAM,YACNuL,GAAI,KAKhBme,UAAW,CACP5rB,OAAQ,CACJ6rB,WAAY,IAWpBC,UAAW,CACP7gB,OAAQ,CACJjL,OAAQ,CACJ+W,KAAM,WACN7U,KAAM,QACNuL,GAAI,OAMpB6c,EAAO,WAAY,CASfyB,YAAa,CACT9gB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhBue,WAAY,CACR/gB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,KAYhBwe,WAAY,CACRhhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,KAYhBye,YAAa,CACTjhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhB0e,WAAY,CACRlhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,KAYhB2e,YAAa,CACTnhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhB4e,UAAW,CACPphB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,OACNuL,GAAI,KAYhB6e,YAAa,CACTrhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhB8e,WAAY,CACRthB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,OAMpB6c,EAAO,aAAc,CASjBkC,UAAW,CACPvhB,OAAQ,CACJwhB,MAAO,CACH1V,KAAM,WACN7U,KAAM,SACNuL,GAAI,OAqBpB6c,EAAOnuB,IAAM,SAAauwB,GACtB,OAAOpC,EAAOoC,IAAS,IAC3B,+BC7YAtxB,EAAOC,QAAUyhB,EAEjB,IAAI4D,EAAY,EAAQ,MAGpB1D,EAFY,EAAQ,KAEfC,CAAQ,MA2BjB,SAASH,EAAMoI,EAAUlO,EAAS2V,GAO9B,MANuB,mBAAZ3V,GACP2V,EAAW3V,EACXA,EAAU,CAAC,GACHA,IACRA,EAAU,CAAC,GAEV2V,GAIA3V,EAAQ4V,KAAO5P,GAAMA,EAAG6P,SAClB7P,EAAG6P,SAAS3H,GAAU,SAA+B1B,EAAKsJ,GAC7D,OAAOtJ,GAAiC,oBAAnBuJ,eACfjQ,EAAM8P,IAAI1H,EAAUlO,EAAS2V,GAC7BnJ,EACAmJ,EAASnJ,GACTmJ,EAAS,KAAM3V,EAAQgW,OAASF,EAAWA,EAAS1pB,SAAS,QACvE,IAGG0Z,EAAM8P,IAAI1H,EAAUlO,EAAS2V,GAbzBjM,EAAU5D,EAAO/f,KAAMmoB,EAAUlO,EAchD,CAuBA8F,EAAM8P,IAAM,SAAmB1H,EAAUlO,EAAS2V,GAC9C,IAAIC,EAAM,IAAIG,eACdH,EAAIK,mBAA4C,WAE5C,GAAuB,IAAnBL,EAAIM,WAAR,CAMA,GAAmB,IAAfN,EAAIO,QAA+B,MAAfP,EAAIO,OACxB,OAAOR,EAASpxB,MAAM,UAAYqxB,EAAIO,SAI1C,GAAInW,EAAQgW,OAAQ,CAChB,IAAIvd,EAASmd,EAAIQ,SACjB,IAAK3d,EAAQ,CACTA,EAAS,GACT,IAAK,IAAInR,EAAI,EAAGA,EAAIsuB,EAAIS,aAAa7uB,SAAUF,EAC3CmR,EAAOlS,KAAsC,IAAjCqvB,EAAIS,aAAajjB,WAAW9L,GAChD,CACA,OAAOquB,EAAS,KAA4B,oBAAf3f,WAA6B,IAAIA,WAAWyC,GAAUA,EACvF,CACA,OAAOkd,EAAS,KAAMC,EAAIS,aAnBN,CAoBxB,EAEIrW,EAAQgW,SAEJ,qBAAsBJ,GACtBA,EAAIU,iBAAiB,sCACzBV,EAAIrE,aAAe,eAGvBqE,EAAIW,KAAK,MAAOrI,GAChB0H,EAAIY,MACR,+BCjHA,IAAI1I,EAAW1pB,EAAOC,QAAU,EAAjB,MAEfypB,EAASE,MAAQ,QAoDjBF,EAASva,KAjCT,SAAc2a,EAAUnX,EAAM4e,GAM1B,MALoB,mBAAT5e,GACP4e,EAAW5e,EACXA,EAAO,IAAI+W,EAASM,MACZrX,IACRA,EAAO,IAAI+W,EAASM,MACjBrX,EAAKxD,KAAK2a,EAAUyH,EAC/B,EA0CA7H,EAAS2I,SANT,SAAkBvI,EAAUnX,GAGxB,OAFKA,IACDA,EAAO,IAAI+W,EAASM,MACjBrX,EAAK0f,SAASvI,EACzB,EAKAJ,EAAS4I,QAAmB,EAAQ,MACpC5I,EAAS6I,QAAmB,EAAQ,MACpC7I,EAAS8I,SAAmB,EAAQ,KACpC9I,EAASta,UAAmB,EAAQ,KAGpCsa,EAASnO,iBAAmB,EAAQ,MACpCmO,EAAS+I,UAAmB,EAAQ,MACpC/I,EAASM,KAAmB,EAAQ,MACpCN,EAASljB,KAAmB,EAAQ,MACpCkjB,EAASjO,KAAmB,EAAQ,MACpCiO,EAASpO,MAAmB,EAAQ,MACpCoO,EAASzK,MAAmB,EAAQ,MACpCyK,EAASO,SAAmB,EAAQ,MACpCP,EAASQ,QAAmB,EAAQ,MACpCR,EAASS,OAAmB,EAAQ,MAGpCT,EAAS9I,QAAmB,EAAQ,MACpC8I,EAASgJ,SAAmB,EAAQ,MAGpChJ,EAASllB,MAAmB,EAAQ,KACpCklB,EAASjlB,KAAmB,EAAQ,MAGpCilB,EAASnO,iBAAiBhK,WAAWmY,EAASM,MAC9CN,EAAS+I,UAAUlhB,WAAWmY,EAASjO,KAAMiO,EAASQ,QAASR,EAASljB,MACxEkjB,EAASM,KAAKzY,WAAWmY,EAASjO,MAClCiO,EAASpO,MAAM/J,WAAWmY,EAASjO,mCCtGnCzb,EAAOC,QAAU+pB,EAGjB,IAAIyI,EAAY,EAAQ,QACtBzI,EAAK7oB,UAAYb,OAAOC,OAAOkyB,EAAUtxB,YAAY8P,YAAc+Y,GAAMxO,UAAY,OAEvF,IAKIC,EACAwL,EACAiI,EAPA5T,EAAU,EAAQ,MAClB9U,EAAU,EAAQ,MAClByY,EAAU,EAAQ,MAClBxa,EAAU,EAAQ,MAatB,SAASulB,EAAKpO,GACV6W,EAAU7vB,KAAKjB,KAAM,GAAIia,GAMzBja,KAAKgxB,SAAW,GAMhBhxB,KAAKixB,MAAQ,GAGbjxB,KAAK4a,SAAW,QACpB,CAsCA,SAASsW,IAAQ,CA9BjB7I,EAAK5N,SAAW,SAAkBC,EAAM1J,GAKpC,OAJKA,IACDA,EAAO,IAAIqX,GACX3N,EAAKT,SACLjJ,EAAKmgB,WAAWzW,EAAKT,SAClBjJ,EAAKogB,QAAQ1W,EAAKgT,QAAQ2D,YACrC,EAUAhJ,EAAK7oB,UAAU8xB,YAAcxuB,EAAKkd,KAAK9b,QAUvCmkB,EAAK7oB,UAAUugB,MAAQjd,EAAKid,MAa5BsI,EAAK7oB,UAAUgO,KAAO,SAASA,EAAK2a,EAAUlO,EAAS2V,GAC5B,mBAAZ3V,IACP2V,EAAW3V,EACXA,OAAU/a,GAEd,IAAIoL,EAAOtK,KACX,IAAK4vB,EACD,OAAO9sB,EAAK6gB,UAAUnW,EAAMlD,EAAM6d,EAAUlO,GAGhD,IAAIsX,EAAO3B,IAAasB,EAGxB,SAAS/N,EAAOsD,EAAKzV,GAEjB,GAAK4e,EAAL,CAGA,GAAI2B,EACA,MAAM9K,EAEV,IAAIQ,EAAK2I,EACTA,EAAW,KACP5e,GACAA,EAAKqgB,aAETpK,EAAGR,EAAKzV,EATR,CAUJ,CAGA,SAASwgB,EAAmBrJ,GACxB,IAAIsJ,EAAMtJ,EAASuJ,YAAY,oBAC/B,GAAID,GAAO,EAAG,CACV,IAAIE,EAAUxJ,EAAS1gB,UAAUgqB,GACjC,GAAIE,KAAWpE,EAAQ,OAAOoE,CAClC,CACA,OAAO,IACX,CAGA,SAASvgB,EAAQ+W,EAAUhiB,GACvB,IAGI,GAFIrD,EAAKqN,SAAShK,IAAgC,MAArBA,EAAOU,OAAO,KACvCV,EAASkf,KAAKC,MAAMnf,IACnBrD,EAAKqN,SAAShK,GAEd,CACDmf,EAAM6C,SAAWA,EACjB,IACI1M,EADAmW,EAAStM,EAAMnf,EAAQmE,EAAM2P,GAE7B1Y,EAAI,EACR,GAAIqwB,EAAOzI,QACP,KAAO5nB,EAAIqwB,EAAOzI,QAAQ1nB,SAAUF,GAC5Bka,EAAW+V,EAAmBI,EAAOzI,QAAQ5nB,KAAO+I,EAAKgnB,YAAYnJ,EAAUyJ,EAAOzI,QAAQ5nB,MAC9Fwe,EAAMtE,GAClB,GAAImW,EAAOxI,YACP,IAAK7nB,EAAI,EAAGA,EAAIqwB,EAAOxI,YAAY3nB,SAAUF,GACrCka,EAAW+V,EAAmBI,EAAOxI,YAAY7nB,KAAO+I,EAAKgnB,YAAYnJ,EAAUyJ,EAAOxI,YAAY7nB,MACtGwe,EAAMtE,GAAU,EAChC,MAdInR,EAAK6mB,WAAWhrB,EAAO8T,SAASmX,QAAQjrB,EAAOunB,OAevD,CAAE,MAAOjH,GACLtD,EAAOsD,EACX,CACK8K,GAASM,GACV1O,EAAO,KAAM7Y,EAErB,CAGA,SAASyV,EAAMoI,EAAU2J,GAIrB,GAHA3J,EAAWqJ,EAAmBrJ,IAAaA,IAGvC7d,EAAK2mB,MAAM9hB,QAAQgZ,IAAa,GAMpC,GAHA7d,EAAK2mB,MAAMzwB,KAAK2nB,GAGZA,KAAYoF,EACRgE,EACAngB,EAAQ+W,EAAUoF,EAAOpF,OAEvB0J,EACFhL,YAAW,aACLgL,EACFzgB,EAAQ+W,EAAUoF,EAAOpF,GAC7B,UAMR,GAAIoJ,EAAM,CACN,IAAIprB,EACJ,IACIA,EAASrD,EAAKmd,GAAG8R,aAAa5J,GAAU9hB,SAAS,OACrD,CAAE,MAAOogB,GAGL,YAFKqL,GACD3O,EAAOsD,GAEf,CACArV,EAAQ+W,EAAUhiB,EACtB,OACM0rB,EACFvnB,EAAKyV,MAAMoI,GAAU,SAAS1B,EAAKtgB,KAC7B0rB,EAEGjC,IAGDnJ,EAEKqL,EAEKD,GACN1O,EAAO,KAAM7Y,GAFb6Y,EAAOsD,GAKfrV,EAAQ+W,EAAUhiB,GACtB,GAER,CACA,IAAI0rB,EAAS,EAIT/uB,EAAKqN,SAASgY,KACdA,EAAW,CAAEA,IAEjB,IAAK,IAAW1M,EAAPla,EAAI,EAAaA,EAAI4mB,EAAS1mB,SAAUF,GACzCka,EAAWnR,EAAKgnB,YAAY,GAAInJ,EAAS5mB,MACzCwe,EAAMtE,GAEd,OADAnR,EAAK+mB,aACDE,GAGCM,GACD1O,EAAO,KAAM7Y,GAHNA,CAOf,EA+BA+d,EAAK7oB,UAAUkxB,SAAW,SAAkBvI,EAAUlO,GAClD,IAAKnX,EAAK8gB,OACN,MAAMplB,MAAM,iBAChB,OAAOwB,KAAKwN,KAAK2a,EAAUlO,EAASiX,EACxC,EAKA7I,EAAK7oB,UAAU6xB,WAAa,WACxB,GAAIrxB,KAAKgxB,SAASvvB,OACd,MAAMjD,MAAM,4BAA8BwB,KAAKgxB,SAAS1sB,KAAI,SAASN,GACjE,MAAO,WAAaA,EAAMwH,OAAS,QAAUxH,EAAM0X,OAAO5N,QAC9D,IAAGjG,KAAK,OACZ,OAAOipB,EAAUtxB,UAAU6xB,WAAWpwB,KAAKjB,KAC/C,EAGA,IAAIgyB,EAAW,SAUf,SAASC,EAAmBjhB,EAAMhN,GAC9B,IAAIkuB,EAAeluB,EAAM0X,OAAOyW,OAAOnuB,EAAMwH,QAC7C,GAAI0mB,EAAc,CACd,IAAIE,EAAc,IAAIzY,EAAM3V,EAAM8J,SAAU9J,EAAM0M,GAAI1M,EAAMmB,KAAMnB,EAAMgW,UAAM9a,EAAW8E,EAAMiW,SAE/F,OAAIiY,EAAa9yB,IAAIgzB,EAAYrxB,QAGjCqxB,EAAY5X,eAAiBxW,EAC7BA,EAAMuW,eAAiB6X,EACvBF,EAAalV,IAAIoV,KAJN,CAMf,CACA,OAAO,CACX,CAQA/J,EAAK7oB,UAAU6yB,WAAa,SAAoB5S,GAC5C,GAAIA,aAAkB9F,OAE2Dza,IAAlBugB,EAAOjU,QAAmDiU,EAAOlF,gBACnH0X,EAAmBjyB,EAAMyf,IAC1Bzf,KAAKgxB,SAASxwB,KAAKif,QAExB,GAAIA,aAAkB5a,EAErBmtB,EAAS7pB,KAAKsX,EAAO1e,QACrB0e,EAAO/D,OAAO+D,EAAO1e,MAAQ0e,EAAOxc,aAErC,KAAMwc,aAAkBnC,GAA6C,CAExE,GAAImC,aAAkB3F,EAClB,IAAK,IAAIvY,EAAI,EAAGA,EAAIvB,KAAKgxB,SAASvvB,QAC1BwwB,EAAmBjyB,EAAMA,KAAKgxB,SAASzvB,IACvCvB,KAAKgxB,SAAS9lB,OAAO3J,EAAG,KAEtBA,EACd,IAAK,IAAIiB,EAAI,EAAGA,EAAsBid,EAAO6S,YAAY7wB,SAAUe,EAC/DxC,KAAKqyB,WAAW5S,EAAO8S,aAAa/vB,IACpCwvB,EAAS7pB,KAAKsX,EAAO1e,QACrB0e,EAAO/D,OAAO+D,EAAO1e,MAAQ0e,EACrC,CAKJ,EAQA4I,EAAK7oB,UAAUgzB,cAAgB,SAAuB/S,GAClD,GAAIA,aAAkB9F,GAElB,QAA+Cza,IAAlBugB,EAAOjU,OAChC,GAA0BiU,EAAOlF,eAC7BkF,EAAOlF,eAAemB,OAAOvc,OAAOsgB,EAAOlF,gBAC3CkF,EAAOlF,eAAiB,SACrB,CACH,IAAI1P,EAAQ7K,KAAKgxB,SAAS7hB,QAAQsQ,GAE9B5U,GAAS,GACT7K,KAAKgxB,SAAS9lB,OAAOL,EAAO,EACpC,OAGD,GAAI4U,aAAkB5a,EAErBmtB,EAAS7pB,KAAKsX,EAAO1e,cACd0e,EAAO/D,OAAO+D,EAAO1e,WAE7B,GAAI0e,aAAkBqR,EAAW,CAEpC,IAAK,IAAIvvB,EAAI,EAAGA,EAAsBke,EAAO6S,YAAY7wB,SAAUF,EAC/DvB,KAAKwyB,cAAc/S,EAAO8S,aAAahxB,IAEvCywB,EAAS7pB,KAAKsX,EAAO1e,cACd0e,EAAO/D,OAAO+D,EAAO1e,KAEpC,CACJ,EAGAsnB,EAAKzY,WAAa,SAASqN,EAAOwV,EAAQC,GACtC5Y,EAASmD,EACTqI,EAASmN,EACTlF,EAASmF,CACb,uBC9XA,WACE,IAAIC,EAASC,EAAMC,EAAKC,EAAMC,EAAMC,EAAMC,EAASC,EAEnDA,EAAU,SAAS3vB,GAMjB,MAAO,EAJFA,EAAQ,KAAQ,MAAS,IACzBA,EAAQ,KAAQ,MAAS,IAClB,MAAPA,KAAwB,EAClB,IAAPA,GACgBsE,KAAK,IAC3B,EAEAorB,EAAU,SAASE,GACjB,IAAIvS,EAAGzZ,EAAG5F,EAAGiB,EAAGgR,EAAGrP,EAEnB,IADAyc,EAAI,GACCrf,EAAIiB,EAAI,EAAGA,GAAK,GACD,IAAd2wB,EAAG1xB,OADeF,IAAMiB,EAAG,CAI/B,GAAIjB,EAAI,EAAG,CACT,GAAc,MAAV4xB,EAAG,GACL,MAAM,IAAI30B,MAAM,cAElB20B,EAAKA,EAAG1rB,UAAU,EACpB,CACgB+L,GAAhBrP,EAAMyuB,EAAKO,IAAa,GAAIhsB,EAAIhD,EAAI,GACpCgvB,EAAKA,EAAG1rB,UAAUN,GAClByZ,EAAEpgB,KAAKgT,EACT,CACA,GAAkB,IAAd2f,EAAG1xB,OACL,MAAM,IAAIjD,MAAM,cAElB,OAAQoiB,EAAEnf,QACR,KAAK,EACH,GAAImf,EAAE,GAAK,WACT,MAAM,IAAIpiB,MAAM,cAElB,OAAOoiB,EAAE,KAAO,EAClB,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,SACxB,MAAM,IAAIpiB,MAAM,cAElB,OAAQoiB,EAAE,IAAM,GAAKA,EAAE,MAAQ,EACjC,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,KAAQA,EAAE,GAAK,MACvC,MAAM,IAAIpiB,MAAM,cAElB,OAAQoiB,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,IAAIpiB,MAAM,cAElB,OAAQoiB,EAAE,IAAM,GAAKA,EAAE,IAAM,GAAKA,EAAE,IAAM,EAAIA,EAAE,MAAQ,EAC1D,QACE,MAAM,IAAIpiB,MAAM,cAEtB,EAMAs0B,GAJAD,EAAM,SAASjS,GACb,OAAOA,EAAEvT,WAAW,EACtB,GAEW,KAEX2lB,EAAOH,EAAI,KAEXE,EAAOF,EAAI,KAEXD,EAAO,SAAS7vB,GACd,IAAIqwB,EAAMC,EAAM9xB,EAAGiS,EAAGxM,EAgBtB,IAfAwM,EAAI,EACJ4f,EAAO,GACPC,EAAO,IACP9xB,EAAI,EACAwB,EAAEtB,OAAS,GAAc,MAATsB,EAAExB,KACH,MAAbwB,EAAExB,EAAI,IAA2B,MAAbwB,EAAExB,EAAI,IAC5BA,GAAK,EACL6xB,EAAO,IACE,KAAOrwB,EAAExB,EAAI,IAAMwB,EAAExB,EAAI,IAAM,MACxCA,IACA6xB,EAAO,EACPC,EAAO,MAGXrsB,EAAQzF,EACDA,EAAIwB,EAAEtB,QAAQ,CACnB,GAAI,KAAOsB,EAAExB,IAAMwB,EAAExB,IAAM8xB,EACzB7f,EAAKA,EAAI4f,GAAQP,EAAI9vB,EAAExB,IAAMuxB,KAAW,MACnC,IAAa,KAATM,EAST,MARA,GAAI,KAAOrwB,EAAExB,IAAMwB,EAAExB,IAAM,IACzBiS,EAAKA,EAAI4f,GAAQ,GAAKP,EAAI9vB,EAAExB,IAAMyxB,KAAW,MACxC,MAAI,KAAOjwB,EAAExB,IAAMwB,EAAExB,IAAM,KAGhC,MAFAiS,EAAKA,EAAI4f,GAAQ,GAAKP,EAAI9vB,EAAExB,IAAMwxB,KAAW,CAG/C,CAGF,CACA,GAAIvf,EAAI,WACN,MAAM,IAAIhV,MAAM,aAElB+C,GACF,CACA,GAAIA,IAAMyF,EACR,MAAM,IAAIxI,MAAM,eAElB,MAAO,CAACgV,EAAGjS,EACb,EAEAoxB,EAAU,WACR,SAASA,EAAQW,EAAKzU,GACpB,IAAWtd,EAAGiB,EAAG2B,EACjB,GAAmB,iBAARmvB,EACT,MAAM,IAAI90B,MAAM,2BAQlB,GANKqgB,IACH1a,EAAMmvB,EAAI5rB,MAAM,IAAK,GAAI4rB,EAAMnvB,EAAI,GAAI0a,EAAO1a,EAAI,IAE/C0a,IACHA,EAAO,IAEW,iBAATA,GAAqBA,EAAK1P,QAAQ,MAAQ,EAAG,CACtD,IACEnP,KAAKuzB,SAAWN,EAAQpU,EAC1B,CAAE,MAAO2U,GAEP,MAAM,IAAIh1B,MAAM,iBAAmBqgB,EACrC,CACA,IAAKtd,EAAIiB,EAAI,GAAIA,GAAK,EAAGjB,IAAMiB,EAC7B,GAAIxC,KAAKuzB,WAAc,YAAe,GAAKhyB,IAAQ,EAAG,CACpDvB,KAAKyzB,QAAUlyB,EACf,KACF,CAEJ,KAAO,KAAIsd,GAAiB,IAATA,EAOjB,MAAM,IAAIrgB,MAAM,uBANhBwB,KAAKyzB,QAAUjV,SAASK,EAAM,IAC9B7e,KAAKuzB,SAAW,EACZvzB,KAAKyzB,QAAU,IACjBzzB,KAAKuzB,SAAY,YAAe,GAAKvzB,KAAKyzB,UAAc,EAI5D,CACA,IACEzzB,KAAK0zB,SAAWT,EAAQK,GAAOtzB,KAAKuzB,YAAc,CACpD,CAAE,MAAOC,GAEP,MAAM,IAAIh1B,MAAM,wBAA0B80B,EAC5C,CACA,KAAMtzB,KAAKyzB,SAAW,IACpB,MAAM,IAAIj1B,MAAM,yBAA2BqgB,GAE7C7e,KAAKvB,KAAOwK,KAAK0qB,IAAI,EAAG,GAAK3zB,KAAKyzB,SAClCzzB,KAAKozB,KAAOF,EAAQlzB,KAAK0zB,SACzB1zB,KAAK6e,KAAOqU,EAAQlzB,KAAKuzB,UACzBvzB,KAAK4zB,SAAWV,GAASlzB,KAAKuzB,UAC9BvzB,KAAK6zB,MAAQ7zB,KAAKyzB,SAAW,GAAKP,EAAQlzB,KAAK0zB,QAAU,GAAK1zB,KAAKozB,KACnEpzB,KAAK8zB,KAAO9zB,KAAKyzB,SAAW,GAAKP,EAAQlzB,KAAK0zB,QAAU1zB,KAAKvB,KAAO,GAAKy0B,EAAQlzB,KAAK0zB,QAAU1zB,KAAKvB,KAAO,GAC5GuB,KAAK+zB,UAAY/zB,KAAKyzB,SAAW,GAAKP,EAAQlzB,KAAK0zB,QAAU1zB,KAAKvB,KAAO,QAAK,CAChF,CAoCA,OAlCAk0B,EAAQnzB,UAAUw0B,SAAW,SAASb,GAIpC,MAHkB,iBAAPA,IAAoBA,EAAGhkB,QAAQ,KAAO,GAA8B,IAAzBgkB,EAAGzrB,MAAM,KAAKjG,UAClE0xB,EAAK,IAAIR,EAAQQ,IAEfA,aAAcR,EACT3yB,KAAKg0B,SAASb,EAAGC,OAASpzB,KAAKg0B,SAASb,EAAGY,WAAaZ,EAAGW,OAE1Db,EAAQE,GAAMnzB,KAAKuzB,YAAc,IAAOvzB,KAAK0zB,QAAU1zB,KAAKuzB,YAAc,CAEtF,EAEAZ,EAAQnzB,UAAU6I,KAAO,SAASof,GAIhC,OAHa,MAATA,IACFA,EAAQ,GAEH,IAAIkL,EAAQO,EAAQlzB,KAAK0zB,QAAW1zB,KAAKvB,KAAOgpB,GAASznB,KAAK6e,KACvE,EAEA8T,EAAQnzB,UAAU2N,QAAU,SAAStN,GACnC,IAAIgL,EAAOopB,EAAU1wB,EAIrB,IAHAA,EAAO0vB,EAAQjzB,KAAK6zB,OACpBI,EAAWhB,EAAQjzB,KAAK8zB,MACxBjpB,EAAQ,EACDtH,GAAQ0wB,GACbp0B,EAAGqzB,EAAQ3vB,GAAOA,EAAMsH,GACxBA,IACAtH,GAEJ,EAEAovB,EAAQnzB,UAAU6G,SAAW,WAC3B,OAAOrG,KAAKozB,KAAO,IAAMpzB,KAAKyzB,OAChC,EAEOd,CAER,CAxFS,GA0FVr0B,EAAQ20B,QAAUA,EAElB30B,EAAQ40B,QAAUA,EAElB50B,EAAQq0B,QAAUA,CAEnB,GAAE1xB,KAAKjB,sBC/MR3B,EAAOC,QAAU,EAAjB,mCCCAD,EAAOC,QAAUuG,EAGjB,IAAI+U,EAAmB,EAAQ,QAC7B/U,EAAKrF,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAczK,GAAMgV,UAAY,OAE9F,IAAIiX,EAAY,EAAQ,MACpBhuB,EAAO,EAAQ,MAcnB,SAAS+B,EAAK9D,EAAMkC,EAAQgX,EAAS7S,EAASZ,EAAU0tB,GAGpD,GAFAta,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,GAE9BhX,GAA4B,iBAAXA,EACjB,MAAM7C,UAAU,4BAgDpB,GA1CAJ,KAAKyO,WAAa,CAAC,EAMnBzO,KAAKiD,OAAStE,OAAOC,OAAOoB,KAAKyO,YAMjCzO,KAAKoH,QAAUA,EAMfpH,KAAKwG,SAAWA,GAAY,CAAC,EAM7BxG,KAAKk0B,cAAgBA,EAMrBl0B,KAAKm0B,gBAAkB,CAAC,EAMxBn0B,KAAKqsB,cAAWntB,EAMZ+D,EACA,IAAK,IAAIiC,EAAOvG,OAAOuG,KAAKjC,GAAS1B,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAC5B,iBAApB0B,EAAOiC,EAAK3D,MACnBvB,KAAKyO,WAAYzO,KAAKiD,OAAOiC,EAAK3D,IAAM0B,EAAOiC,EAAK3D,KAAQ2D,EAAK3D,GACjF,CAKAsD,EAAKrF,UAAUgd,iBAAmB,SAA0B7B,GASxD,OARAA,EAAU3a,KAAK4a,UAAYD,EAC3Bf,EAAiBpa,UAAUgd,iBAAiBvb,KAAKjB,KAAM2a,GAEvDhc,OAAOuG,KAAKlF,KAAKiD,QAAQkK,SAAQpO,IAC7B,IAAIq1B,EAAqBz1B,OAAO01B,OAAO,CAAC,EAAGr0B,KAAK8a,WAChD9a,KAAKm0B,gBAAgBp1B,GAAOJ,OAAO01B,OAAOD,EAAoBp0B,KAAKk0B,eAAiBl0B,KAAKk0B,cAAcn1B,IAAQiB,KAAKk0B,cAAcn1B,GAAKsd,SAAS,IAG7Irc,IACX,EAgBA6E,EAAK4V,SAAW,SAAkB1Z,EAAM2Z,GACpC,IAAIsG,EAAM,IAAInc,EAAK9D,EAAM2Z,EAAKzX,OAAQyX,EAAKT,QAASS,EAAKtT,QAASsT,EAAKlU,UAKvE,OAJAwa,EAAIqL,SAAW3R,EAAK2R,SAChB3R,EAAKC,UACLqG,EAAIpG,SAAWF,EAAKC,SACxBqG,EAAInG,gBAAkB,SACfmG,CACX,EAOAnc,EAAKrF,UAAU6b,OAAS,SAAgBC,GACpC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAkBnO,KAAKwb,iBACvB,UAAkBxb,KAAKia,QACvB,gBAAkBja,KAAKk0B,cACvB,SAAkBl0B,KAAKiD,OACvB,WAAkBjD,KAAKqsB,UAAYrsB,KAAKqsB,SAAS5qB,OAASzB,KAAKqsB,cAAWntB,EAC1E,UAAkBqc,EAAevb,KAAKoH,aAAUlI,EAChD,WAAkBqc,EAAevb,KAAKwG,cAAWtH,GAEzD,EAYA2F,EAAKrF,UAAUwd,IAAM,SAAajc,EAAM2P,EAAItJ,EAAS6S,GAGjD,IAAKnX,EAAKqN,SAASpP,GACf,MAAMX,UAAU,yBAEpB,IAAK0C,EAAKqX,UAAUzJ,GAChB,MAAMtQ,UAAU,yBAEpB,QAA0BlB,IAAtBc,KAAKiD,OAAOlC,GACZ,MAAMvC,MAAM,mBAAqBuC,EAAO,QAAUf,MAEtD,GAAIA,KAAKs0B,aAAa5jB,GAClB,MAAMlS,MAAM,MAAQkS,EAAK,mBAAqB1Q,MAElD,GAAIA,KAAKu0B,eAAexzB,GACpB,MAAMvC,MAAM,SAAWuC,EAAO,oBAAsBf,MAExD,QAA4Bd,IAAxBc,KAAKyO,WAAWiC,GAAmB,CACnC,IAAM1Q,KAAKia,UAAWja,KAAKia,QAAQua,YAC/B,MAAMh2B,MAAM,gBAAkBkS,EAAK,OAAS1Q,MAChDA,KAAKiD,OAAOlC,GAAQ2P,CACxB,MACI1Q,KAAKyO,WAAWzO,KAAKiD,OAAOlC,GAAQ2P,GAAM3P,EAS9C,OAPIkZ,SAC2B/a,IAAvBc,KAAKk0B,gBACLl0B,KAAKk0B,cAAgB,CAAC,GAC1Bl0B,KAAKk0B,cAAcnzB,GAAQkZ,GAAW,MAG1Cja,KAAKwG,SAASzF,GAAQqG,GAAW,KAC1BpH,IACX,EASA6E,EAAKrF,UAAUL,OAAS,SAAgB4B,GAEpC,IAAK+B,EAAKqN,SAASpP,GACf,MAAMX,UAAU,yBAEpB,IAAI6K,EAAMjL,KAAKiD,OAAOlC,GACtB,GAAW,MAAPkK,EACA,MAAMzM,MAAM,SAAWuC,EAAO,uBAAyBf,MAQ3D,cANOA,KAAKyO,WAAWxD,UAChBjL,KAAKiD,OAAOlC,UACZf,KAAKwG,SAASzF,GACjBf,KAAKk0B,sBACEl0B,KAAKk0B,cAAcnzB,GAEvBf,IACX,EAOA6E,EAAKrF,UAAU80B,aAAe,SAAsB5jB,GAChD,OAAOogB,EAAUwD,aAAat0B,KAAKqsB,SAAU3b,EACjD,EAOA7L,EAAKrF,UAAU+0B,eAAiB,SAAwBxzB,GACpD,OAAO+vB,EAAUyD,eAAev0B,KAAKqsB,SAAUtrB,EACnD,kBC9NA,OASA,WACE,aAEA,IAAIiQ,EAAyB,iBAAXD,OAAsBA,OAAS,CAAC,GACnCC,EAAKyjB,sBAA2C,iBAAZrjB,SAAwBA,QAAQC,UAAYD,QAAQC,SAASC,OAE9GN,EAAOO,QAET,IAAIC,GAAaR,EAAK0jB,wBAAwDr2B,EAAOC,QACjFoT,EAAsC,OACtCijB,EAAqB,mCAAmCjtB,MAAM,IAC9DktB,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,IAGzDtgB,EAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAE/BugB,EAAmB,SAAUC,EAAUC,GACrCA,EAAQtzB,OAAS,KACnBszB,EAAU,MAAQA,EAAQC,QAAQ,KAEpC,IAAIvO,EAAM,IAAIjoB,MAAM,kGAEiBs2B,EAAW,WAAaC,EAAU,OAEvE,MADAtO,EAAIqO,SAAWA,EACTrO,CACR,EAgDIwO,EAAgB,SAAUC,GAC5B,GAAkB,KAAdA,EACF,MAAO,GACF,IAAK,eAAe/sB,KAAK+sB,GAC9B,MAAM,IAAI12B,MAAM,6BAMlB,IAHA,IAAI22B,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI5mB,EAAQ,GAAIjE,EAAQ,EAAGpJ,GAD3DyzB,EAAYA,EAAUlvB,QAAQ,KAAM,KAC0CvE,OAGrEF,EAAI,EAAGkmB,EAAQhmB,GAAU,GAAK,EAAGF,EAAIkmB,GAC5C0N,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCm0B,EAAKd,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CxmB,EAAMjE,KAAkC,KAAtByqB,GAAM,EAAIC,IAAO,GACnCzmB,EAAMjE,KAA4C,KAAhC0qB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7C3mB,EAAMjE,KAA4B,KAAhB4qB,GAAM,EAAIC,GAI9B,IAAIC,EAASl0B,EAASgmB,EAkCtB,OAjCe,IAAXkO,GACFR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,IACf,IAAXO,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IACzB,IAAXK,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CxmB,EAAMjE,KAAkC,KAAtByqB,GAAM,EAAIC,IAAO,IACf,IAAXI,IACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CxmB,EAAMjE,KAAkC,KAAtByqB,GAAM,EAAIC,IAAO,GACnCzmB,EAAMjE,KAA4C,KAAhC0qB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAExC3mB,CACT,EAgOIkN,EAAS,SAAUkZ,EAAWU,GAChC,IAAKA,EACH,OA9Ue,SAAU9mB,GAE3B,IADA,IAAgE8R,EAAGzZ,EAA/DpB,EAAM,GAAItE,EAASqN,EAAMrN,OAAQF,EAAI,EAAGs0B,EAAiB,EACtDt0B,EAAIE,GAET,IADAmf,EAAI9R,EAAMvN,OACD,IACPwE,GAAOiJ,OAAOC,aAAa2R,OAD7B,CAGWA,EAAI,KAAQA,GAAK,KAC1BzZ,EAAQ,GAAJyZ,EACJiV,EAAiB,GACRjV,GAAK,KACdzZ,EAAQ,GAAJyZ,EACJiV,EAAiB,GACRjV,GAAK,KACdzZ,EAAQ,EAAJyZ,EACJiV,EAAiB,GAEjBhB,EAAiBtzB,EAAGwE,GAGtB,IAAK,IAAIvD,EAAI,EAAGA,EAAIqzB,IAAkBrzB,IACpCoe,EAAI9R,EAAMvN,MACF,KAAQqf,EAAI,MAClBiU,EAAiBtzB,EAAGwE,GAEtBoB,IAAM,EACNA,GAAS,GAAJyZ,EAEHzZ,GAAK,OAAUA,GAAK,OACtB0tB,EAAiBtzB,EAAGwE,GAElBoB,EAAI,SACN0tB,EAAiBtzB,EAAGwE,GAGlBoB,GAAK,MACPpB,GAAOiJ,OAAOC,aAAa9H,IAE3BA,GAAK,MACLpB,GAAOiJ,OAAOC,aAAyB,OAAX9H,GAAK,KACjCpB,GAAOiJ,OAAOC,aAA2B,OAAT,KAAJ9H,IAtB9B,CAyBF,OAAOpB,CACT,CAkSW+vB,CAAab,EAAcC,IAEpC,GAAkB,KAAdA,EACF,MAAO,GACF,IAAK,eAAe/sB,KAAK+sB,GAC9B,MAAM,IAAI12B,MAAM,6BAElB,IAAI22B,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI3vB,EAAM,GAAItE,EAASyzB,EAAU/lB,QAAQ,MACzD,IAAZ1N,IACFA,EAASyzB,EAAUzzB,QAIrB,IAAK,IAAIF,EAAI,EAAGkmB,EAAQhmB,GAAU,GAAK,EAAGF,EAAIkmB,GAC5C0N,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCm0B,EAAKd,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDtmB,OAAOC,aAAoC,KAAtBqmB,GAAM,EAAIC,IAAO,IACtCvmB,OAAOC,aAA8C,KAAhCsmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDzmB,OAAOC,aAA8B,KAAhBwmB,GAAM,EAAIC,IAInC,IAAIC,EAASl0B,EAASgmB,EAkCtB,OAjCe,IAAXkO,GACFR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,KACzB,IAAXO,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,KAC9B,IAAXK,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDtmB,OAAOC,aAAoC,KAAtBqmB,GAAM,EAAIC,IAAO,KACpB,IAAXI,IACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDtmB,OAAOC,aAAoC,KAAtBqmB,GAAM,EAAIC,IAAO,IACtCvmB,OAAOC,aAA8C,KAAhCsmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,KAE7C1vB,CACT,EAEIzH,EAAU,CACZ4W,OApFW,SAAU6gB,EAAOH,GAC5B,IAAII,EAA8B,iBAAZ,EAItB,OAHIA,GAAaD,EAAMzmB,cAAgBuC,cACrCkkB,EAAQ,IAAI9lB,WAAW8lB,IAErBC,EAjEY,SAAUlnB,GAE1B,IADA,IAAIqmB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIL,EAAY,GAAIzzB,EAASqN,EAAMrN,OAC9CF,EAAI,EAAGkmB,EAA+B,EAAvBjJ,SAAS/c,EAAS,GAAQF,EAAIkmB,GACpD0N,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,KACX8zB,EAAKvmB,EAAMvN,KACX+zB,EAAKxmB,EAAMvN,KACXg0B,EAAKzmB,EAAMvN,KACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAwB,GAALY,GAIvB,IAAII,EAASl0B,EAASgmB,EAsCtB,OArCe,IAAXkO,GACFR,EAAKrmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAAoBQ,GAAM,EAAK,IAC/B,UACkB,IAAXQ,GACTR,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAAoBS,GAAM,EAAK,IAC/B,QACkB,IAAXO,GACTR,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,KACX8zB,EAAKvmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,GAAM,EAAK,IAC/B,OACkB,IAAXM,IACTR,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,KACX8zB,EAAKvmB,EAAMvN,KACX+zB,EAAKxmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAAoBW,GAAM,EAAK,IAC/B,KAEGJ,CACT,CAQWe,CAAYF,GACVH,EAvNK,SAAU7vB,GAE1B,IADA,IAAIovB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIL,EAAY,GAAIzzB,EAASsE,EAAItE,OAC5CF,EAAI,EAAGkmB,EAA+B,EAAvBjJ,SAAS/c,EAAS,GAAQF,EAAIkmB,GACpD0N,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,KACpB8zB,EAAKtvB,EAAIsH,WAAW9L,KACpB+zB,EAAKvvB,EAAIsH,WAAW9L,KACpBg0B,EAAKxvB,EAAIsH,WAAW9L,KACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAwB,GAALY,GAIvB,IAAII,EAASl0B,EAASgmB,EAsCtB,OArCe,IAAXkO,GACFR,EAAKpvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAAoBQ,GAAM,EAAK,IAC/B,UACkB,IAAXQ,GACTR,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAAoBS,GAAM,EAAK,IAC/B,QACkB,IAAXO,GACTR,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,KACpB8zB,EAAKtvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,GAAM,EAAK,IAC/B,OACkB,IAAXM,IACTR,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,KACpB8zB,EAAKtvB,EAAIsH,WAAW9L,KACpB+zB,EAAKvvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAAoBW,GAAM,EAAK,IAC/B,KAEGJ,CACT,CA8JWgB,CAAYH,GA5JN,SAAUhwB,GACzB,IAAIovB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIxgB,EACXxT,EADiB0F,GAAM,EAAOiuB,EAAY,GACrDrqB,EAAQ,EAAM7D,EAAQ,EAAcvF,EAASsE,EAAItE,OACjD,GAAY,KAARsE,EACF,OAAOmvB,EAEX,EAAG,CAID,IAHA5gB,EAAO,GAAKA,EAAO,GACnBA,EAAO,GAAKA,EAAO,GACnBA,EAAO,GAAKA,EAAO,GACd/S,EAAIyF,EAAO6D,EAAQpJ,GAAUF,EAAI,IAAKsJ,GACzCkK,EAAOhP,EAAIsH,WAAWxC,IACX,IACTyJ,EAAO/S,KAAOwT,EACLA,EAAO,MAChBT,EAAO/S,KAAO,IAAQwT,GAAQ,EAC9BT,EAAO/S,KAAO,IAAe,GAAPwT,GACbA,EAAO,OAAUA,GAAQ,OAClCT,EAAO/S,KAAO,IAAQwT,GAAQ,GAC9BT,EAAO/S,KAAO,IAASwT,GAAQ,EAAK,GACpCT,EAAO/S,KAAO,IAAe,GAAPwT,IAEtBA,EAAO,QAAoB,KAAPA,IAAiB,GAAiC,KAA1BhP,EAAIsH,aAAaxC,IAC7DyJ,EAAO/S,KAAO,IAAQwT,GAAQ,GAC9BT,EAAO/S,KAAO,IAASwT,GAAQ,GAAM,GACrCT,EAAO/S,KAAO,IAASwT,GAAQ,EAAK,GACpCT,EAAO/S,KAAO,IAAe,GAAPwT,GAI1B/N,EAAQzF,EAAI,EACRsJ,IAAUpJ,KACVoJ,EAEAA,EAAQpJ,GAAUF,EAAI,IACxB0F,GAAM,GAERkuB,EAAK7gB,EAAO,GACR/S,EAAI,GACN6zB,EAAK9gB,EAAO,GACZ+gB,EAAK/gB,EAAO,GACZghB,EAAKhhB,EAAO,GACZihB,EAAKjhB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAwB,GAALY,IACN,IAANh0B,EACT2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAAoBQ,GAAM,EAAK,IAC/B,SACa,IAAN5zB,GACT6zB,EAAK9gB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAAoBS,GAAM,EAAK,IAC/B,QACa,IAAN7zB,GACT6zB,EAAK9gB,EAAO,GACZ+gB,EAAK/gB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,GAAM,EAAK,IAC/B,QAEFD,EAAK9gB,EAAO,GACZ+gB,EAAK/gB,EAAO,GACZghB,EAAKhhB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAAoBW,GAAM,EAAK,IAC/B,IAEN,QAAUruB,GACV,OAAOiuB,CACT,CAwEWiB,CAAWJ,EAEtB,EAyEE/Z,OAAQA,GAEVA,EAAOoa,QAAUnB,EAEbzjB,EACFnT,EAAOC,QAAUA,GAEjB0S,EAAKqlB,OAAS/3B,EACVoT,SAGD,KAFD,aACE,OAAOpT,CACR,iCAGN,CAhcD,gCCRAD,EAAOC,QAAUqhB,EAEjB,IAEID,EAFA5c,EAAY,EAAQ,MAIpBib,EAAYjb,EAAKib,SACjBtO,EAAY3M,EAAK2M,KAGrB,SAAS6mB,EAAgBhX,EAAQiX,GAC7B,OAAOC,WAAW,uBAAyBlX,EAAOxY,IAAM,OAASyvB,GAAe,GAAK,MAAQjX,EAAOld,IACxG,CAQA,SAASud,EAAOjN,GAMZ1S,KAAKwP,IAAMkD,EAMX1S,KAAK8G,IAAM,EAMX9G,KAAKoC,IAAMsQ,EAAOjR,MACtB,CAEA,IA4CQzC,EA5CJy3B,EAAqC,oBAAfxmB,WACpB,SAA4ByC,GAC1B,GAAIA,aAAkBzC,YAActO,MAAM2Q,QAAQI,GAC9C,OAAO,IAAIiN,EAAOjN,GACtB,MAAMlU,MAAM,iBAChB,EAEE,SAAsBkU,GACpB,GAAI/Q,MAAM2Q,QAAQI,GACd,OAAO,IAAIiN,EAAOjN,GACtB,MAAMlU,MAAM,iBAChB,EAEAI,EAAS,WACT,OAAOkE,EAAKkN,OACN,SAA6B0C,GAC3B,OAAQiN,EAAO/gB,OAAS,SAAuB8T,GAC3C,OAAO5P,EAAKkN,OAAO0mB,SAAShkB,GACtB,IAAIgN,EAAahN,GAEjB+jB,EAAa/jB,EACvB,GAAGA,EACP,EAEE+jB,CACV,EAuDA,SAASE,IAEL,IAAI1jB,EAAO,IAAI8K,EAAS,EAAG,GACvBxc,EAAI,EACR,KAAIvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GAanB,CACH,KAAOvF,EAAI,IAAKA,EAAG,CAEf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAG1B,GADAiT,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CACf,CAGA,OADAA,EAAK+K,IAAM/K,EAAK+K,IAA6B,IAAvBhe,KAAKwP,IAAIxP,KAAK8G,SAAqB,EAAJvF,KAAW,EACzD0R,CACX,CAzBI,KAAO1R,EAAI,IAAKA,EAGZ,GADA0R,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAKf,GAFAA,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAC3DmM,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAgB,KAAO,EACvD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAgBf,GAfI1R,EAAI,EAeJvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GACtB,KAAOvF,EAAI,IAAKA,EAGZ,GADA0R,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,OAGf,KAAO1R,EAAI,IAAKA,EAAG,CAEf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAG1B,GADAiT,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CACf,CAGJ,MAAMzU,MAAM,0BAChB,CAiCA,SAASo4B,EAAgBpnB,EAAKvI,GAC1B,OAAQuI,EAAIvI,EAAM,GACVuI,EAAIvI,EAAM,IAAM,EAChBuI,EAAIvI,EAAM,IAAM,GAChBuI,EAAIvI,EAAM,IAAM,MAAQ,CACpC,CA8BA,SAAS4vB,IAGL,GAAI72B,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,OAAO,IAAI+d,EAAS6Y,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,GAAI8vB,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,GACxG,CA5KA6Y,EAAO/gB,OAASA,IAEhB+gB,EAAOngB,UAAUogB,OAAS9c,EAAKnB,MAAMnC,UAAUyiB,UAAuCnf,EAAKnB,MAAMnC,UAAU0B,MAO3Gye,EAAOngB,UAAU6Q,QACTrR,EAAQ,WACL,WACuD,GAA1DA,GAAuC,IAArBgB,KAAKwP,IAAIxP,KAAK8G,QAAuB,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAgB,KAAO,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA+B,GAAtBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EAGjG,IAAKgB,KAAK8G,KAAO,GAAK9G,KAAKoC,IAEvB,MADApC,KAAK8G,IAAM9G,KAAKoC,IACVk0B,EAAgBt2B,KAAM,IAEhC,OAAOhB,CACX,GAOJ2gB,EAAOngB,UAAU0iB,MAAQ,WACrB,OAAuB,EAAhBliB,KAAKqQ,QAChB,EAMAsP,EAAOngB,UAAU2iB,OAAS,WACtB,IAAInjB,EAAQgB,KAAKqQ,SACjB,OAAOrR,IAAU,IAAc,EAARA,EAC3B,EAoFA2gB,EAAOngB,UAAU+iB,KAAO,WACpB,OAAyB,IAAlBviB,KAAKqQ,QAChB,EAaAsP,EAAOngB,UAAUgjB,QAAU,WAGvB,GAAIxiB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,OAAO42B,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,EACjD,EAMA6Y,EAAOngB,UAAUijB,SAAW,WAGxB,GAAIziB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,OAAkD,EAA3C42B,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,EACjD,EAkCA6Y,EAAOngB,UAAUojB,MAAQ,WAGrB,GAAI5iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,IAAIhB,EAAQ8D,EAAK8f,MAAMkU,YAAY92B,KAAKwP,IAAKxP,KAAK8G,KAElD,OADA9G,KAAK8G,KAAO,EACL9H,CACX,EAOA2gB,EAAOngB,UAAUsjB,OAAS,WAGtB,GAAI9iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,IAAIhB,EAAQ8D,EAAK8f,MAAMmU,aAAa/2B,KAAKwP,IAAKxP,KAAK8G,KAEnD,OADA9G,KAAK8G,KAAO,EACL9H,CACX,EAMA2gB,EAAOngB,UAAUsP,MAAQ,WACrB,IAAIrN,EAASzB,KAAKqQ,SACdrJ,EAAShH,KAAK8G,IACdG,EAASjH,KAAK8G,IAAMrF,EAGxB,GAAIwF,EAAMjH,KAAKoC,IACX,MAAMk0B,EAAgBt2B,KAAMyB,GAGhC,GADAzB,KAAK8G,KAAOrF,EACRE,MAAM2Q,QAAQtS,KAAKwP,KACnB,OAAOxP,KAAKwP,IAAItO,MAAM8F,EAAOC,GAEjC,GAAID,IAAUC,EAAK,CACf,IAAI+vB,EAAel0B,EAAKkN,OACxB,OAAOgnB,EACDA,EAAannB,MAAM,GACnB,IAAI7P,KAAKwP,IAAIF,YAAY,EACnC,CACA,OAAOtP,KAAK4f,OAAO3e,KAAKjB,KAAKwP,IAAKxI,EAAOC,EAC7C,EAMA0Y,EAAOngB,UAAU+Q,OAAS,WACtB,IAAIzB,EAAQ9O,KAAK8O,QACjB,OAAOW,EAAKyN,KAAKpO,EAAO,EAAGA,EAAMrN,OACrC,EAOAke,EAAOngB,UAAU8J,KAAO,SAAc7H,GAClC,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIzB,KAAK8G,IAAMrF,EAASzB,KAAKoC,IACzB,MAAMk0B,EAAgBt2B,KAAMyB,GAChCzB,KAAK8G,KAAOrF,CAChB,MACI,GAEI,GAAIzB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,YACE,IAAvBA,KAAKwP,IAAIxP,KAAK8G,QAE3B,OAAO9G,IACX,EAOA2f,EAAOngB,UAAUy3B,SAAW,SAASxmB,GACjC,OAAQA,GACJ,KAAK,EACDzQ,KAAKsJ,OACL,MACJ,KAAK,EACDtJ,KAAKsJ,KAAK,GACV,MACJ,KAAK,EACDtJ,KAAKsJ,KAAKtJ,KAAKqQ,UACf,MACJ,KAAK,EACD,KAA0C,IAAlCI,EAA2B,EAAhBzQ,KAAKqQ,WACpBrQ,KAAKi3B,SAASxmB,GAElB,MACJ,KAAK,EACDzQ,KAAKsJ,KAAK,GACV,MAGJ,QACI,MAAM9K,MAAM,qBAAuBiS,EAAW,cAAgBzQ,KAAK8G,KAE3E,OAAO9G,IACX,EAEA2f,EAAO/P,WAAa,SAASsnB,GACzBxX,EAAewX,EACfvX,EAAO/gB,OAASA,IAChB8gB,EAAa9P,aAEb,IAAI/P,EAAKiD,EAAKwX,KAAO,SAAsC,WAC3DxX,EAAKugB,MAAM1D,EAAOngB,UAAW,CAEzB6iB,MAAO,WACH,OAAOsU,EAAe11B,KAAKjB,MAAMH,IAAI,EACzC,EAEAuiB,OAAQ,WACJ,OAAOuU,EAAe11B,KAAKjB,MAAMH,IAAI,EACzC,EAEAyiB,OAAQ,WACJ,OAAOqU,EAAe11B,KAAKjB,MAAMoe,WAAWve,IAAI,EACpD,EAEA6iB,QAAS,WACL,OAAOmU,EAAY51B,KAAKjB,MAAMH,IAAI,EACtC,EAEA8iB,SAAU,WACN,OAAOkU,EAAY51B,KAAKjB,MAAMH,IAAI,EACtC,GAGR,yBC7ZAxB,EAAOC,QAAUU,IAChB,GAA8C,oBAA1CL,OAAOa,UAAU6G,SAASpF,KAAKjC,GAClC,OAAO,EAGR,MAAMQ,EAAYb,OAAOw4B,eAAen4B,GACxC,OAAqB,OAAdQ,GAAsBA,IAAcb,OAAOa,SAAS,+BCD5D,IAAIuxB,EAAWzyB,EAEX2gB,EAAU,EAAQ,MA6BtB8R,EAAS,wBAA0B,CAE/B9iB,WAAY,SAASwR,GAGjB,GAAIA,GAAUA,EAAO,SAAU,CAE3B,IAAI1e,EAAO0e,EAAO,SAAShY,UAAUgY,EAAO,SAASiS,YAAY,KAAO,GACpEvsB,EAAOnF,KAAKmyB,OAAOpxB,GAEvB,GAAIoE,EAAM,CAEN,IAAI0oB,EAAyC,MAA9BpO,EAAO,SAAS5Y,OAAO,GAClC4Y,EAAO,SAASve,MAAM,GAAKue,EAAO,SAKtC,OAH+B,IAA3BoO,EAAS1e,QAAQ,OACjB0e,EAAW,IAAMA,GAEd7tB,KAAKpB,OAAO,CACfivB,SAAUA,EACV7uB,MAAOmG,EAAK+P,OAAO/P,EAAK8I,WAAWwR,IAAS0D,UAEpD,CACJ,CAEA,OAAOnjB,KAAKiO,WAAWwR,EAC3B,EAEAtR,SAAU,SAAS3B,EAASyN,GAGxB,IACIva,EAAS,GACTqB,EAAO,GAGX,GAAIkZ,GAAWA,EAAQS,MAAQlO,EAAQqhB,UAAYrhB,EAAQxN,MAAO,CAE9D+B,EAAOyL,EAAQqhB,SAASpmB,UAAU+E,EAAQqhB,SAAS6D,YAAY,KAAO,GAEtEhyB,EAAS8M,EAAQqhB,SAASpmB,UAAU,EAAG+E,EAAQqhB,SAAS6D,YAAY,KAAO,GAC3E,IAAIvsB,EAAOnF,KAAKmyB,OAAOpxB,GAEnBoE,IACAqH,EAAUrH,EAAK6W,OAAOxP,EAAQxN,OACtC,CAGA,KAAMwN,aAAmBxM,KAAKmc,OAAS3P,aAAmByS,EAAS,CAC/D,IAAIQ,EAASjT,EAAQ2S,MAAMhR,SAAS3B,EAASyN,GAS7C,MALe,KAAXva,IACAA,EAvBQ,wBAyBZqB,EAAOrB,GANyC,MAA9B8M,EAAQ2S,MAAMrR,SAAS,GACrCtB,EAAQ2S,MAAMrR,SAAS5M,MAAM,GAAKsL,EAAQ2S,MAAMrR,UAMpD2R,EAAO,SAAW1e,EACX0e,CACX,CAEA,OAAOzf,KAAKmO,SAAS3B,EAASyN,EAClC,aChGJ,IAAIlX,EAAI,IACJq0B,EAAQ,GAAJr0B,EACJ+S,EAAQ,GAAJshB,EACJ3a,EAAQ,GAAJ3G,EACJ/B,EAAQ,EAAJ0I,EAsJR,SAAS4a,EAAO5sB,EAAI6sB,EAAO9jB,EAAGzS,GAC5B,IAAIw2B,EAAWD,GAAa,IAAJ9jB,EACxB,OAAOvK,KAAKuuB,MAAM/sB,EAAK+I,GAAK,IAAMzS,GAAQw2B,EAAW,IAAM,GAC7D,CAxIAl5B,EAAOC,QAAU,SAAU2M,EAAKgP,GAC9BA,EAAUA,GAAW,CAAC,EACtB,IA8GexP,EACX6sB,EA/GAnyB,SAAc8F,EAClB,GAAa,WAAT9F,GAAqB8F,EAAIxJ,OAAS,EACpC,OAkBJ,SAAesE,GAEb,MADAA,EAAMiJ,OAAOjJ,IACLtE,OAAS,KAAjB,CAGA,IAAIgH,EAAQ,mIAAmIC,KAC7I3C,GAEF,GAAK0C,EAAL,CAGA,IAAI+K,EAAIuW,WAAWthB,EAAM,IAEzB,QADYA,EAAM,IAAM,MAAM2R,eAE5B,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAzDEqC,SAyDKjJ,EACT,IAAK,QACL,IAAK,OACL,IAAK,IACH,OAAOA,EAAIO,EACb,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOP,EAAIiJ,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOjJ,EAAIsC,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOtC,EAAI4jB,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAO5jB,EAAIzQ,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOyQ,EACT,QACE,OA3CJ,CANA,CAmDF,CAzEW8R,CAAMra,GACR,GAAa,WAAT9F,GAAqB0e,SAAS5Y,GACvC,OAAOgP,EAAQ1W,MA0GFkH,EA1GiBQ,GA2G5BqsB,EAAQruB,KAAKsE,IAAI9C,KACRgS,EACJ4a,EAAO5sB,EAAI6sB,EAAO7a,EAAG,OAE1B6a,GAASxhB,EACJuhB,EAAO5sB,EAAI6sB,EAAOxhB,EAAG,QAE1BwhB,GAASF,EACJC,EAAO5sB,EAAI6sB,EAAOF,EAAG,UAE1BE,GAASv0B,EACJs0B,EAAO5sB,EAAI6sB,EAAOv0B,EAAG,UAEvB0H,EAAK,OAvCd,SAAkBA,GAChB,IAAI6sB,EAAQruB,KAAKsE,IAAI9C,GACrB,OAAI6sB,GAAS7a,EACJxT,KAAKuuB,MAAM/sB,EAAKgS,GAAK,IAE1B6a,GAASxhB,EACJ7M,KAAKuuB,MAAM/sB,EAAKqL,GAAK,IAE1BwhB,GAASF,EACJnuB,KAAKuuB,MAAM/sB,EAAK2sB,GAAK,IAE1BE,GAASv0B,EACJkG,KAAKuuB,MAAM/sB,EAAK1H,GAAK,IAEvB0H,EAAK,IACd,CAhGyCgtB,CAASxsB,GAEhD,MAAM,IAAIzM,MACR,wDACE6mB,KAAKE,UAAUta,GAErB,qCCpCA,MAAMysB,EAAiB,EAAQ,OAEzB,eAACj4B,GAAkBd,OAAOa,WAC1B,qBAACm4B,GAAwBh5B,OACzB0K,EAAiB,CAACoW,EAAQ1e,EAAM/B,IAAUL,OAAO0K,eAAeoW,EAAQ1e,EAAM,CACnF/B,QACA0kB,UAAU,EACVhY,YAAY,EACZC,cAAc,IAGTisB,EAAa53B,KACb63B,EAAsB,CAC3BC,cAAc,EACdC,iBAAiB,GAGZC,EAA+Bh5B,IACpC,MAAMkG,EAAO,GAEb,IAAK,MAAMnG,KAAOC,EACbS,EAAewB,KAAKjC,EAAOD,IAC9BmG,EAAK1E,KAAKzB,GAKZ,GAAIJ,OAAOwC,sBAAuB,CACjC,MAAM82B,EAAUt5B,OAAOwC,sBAAsBnC,GAE7C,IAAK,MAAMk5B,KAAUD,EAChBN,EAAqB12B,KAAKjC,EAAOk5B,IACpChzB,EAAK1E,KAAK03B,EAGb,CAEA,OAAOhzB,CAAI,EAGZ,SAASizB,EAAMn5B,GACd,OAAI2C,MAAM2Q,QAAQtT,GAWnB,SAAoB8T,GACnB,MAAMgC,EAAShC,EAAM5R,MAAM,EAAG,GAM9B,OAJA82B,EAA6BllB,GAAO3F,SAAQpO,IAC3CsK,EAAeyL,EAAQ/V,EAAKo5B,EAAMrlB,EAAM/T,IAAM,IAGxC+V,CACR,CAlBSjC,CAAW7T,GAGf04B,EAAe14B,GAiBpB,SAA2BygB,GAC1B,MAAM3K,EAA2C,OAAlCnW,OAAOw4B,eAAe1X,GAAmB9gB,OAAOC,OAAO,MAAQ,CAAC,EAM/E,OAJAo5B,EAA6BvY,GAAQtS,SAAQpO,IAC5CsK,EAAeyL,EAAQ/V,EAAKo5B,EAAM1Y,EAAO1gB,IAAM,IAGzC+V,CACR,CAxBSsjB,CAAkBp5B,GAGnBA,CACR,CA6BA,MAAMq5B,EAAY,CAACC,EAAQnyB,EAAQjB,EAAMqzB,KACxCrzB,EAAKiI,SAAQpO,SACe,IAAhBoH,EAAOpH,IAAwBw5B,EAAOR,kBAK7Ch5B,KAAOu5B,GAAUA,EAAOv5B,KAASJ,OAAOw4B,eAAemB,GAC1DjvB,EAAeivB,EAAQv5B,EAAKskB,EAAMiV,EAAOv5B,GAAMoH,EAAOpH,GAAMw5B,IAE5DlvB,EAAeivB,EAAQv5B,EAAKo5B,EAAMhyB,EAAOpH,KAC1C,IAGMu5B,GAWFR,EAAe,CAACQ,EAAQnyB,EAAQoyB,KACrC,IAAIzjB,EAASwjB,EAAOp3B,MAAM,EAAG,GACzBs3B,EAAc,EAyBlB,MAvBA,CAACF,EAAQnyB,GAAQgH,SAAQ2F,IACxB,MAAM2lB,EAAU,GAGhB,IAAK,IAAIC,EAAI,EAAGA,EAAI5lB,EAAMrR,OAAQi3B,IAC5Bj5B,EAAewB,KAAK6R,EAAO4lB,KAIhCD,EAAQj4B,KAAKwO,OAAO0pB,IAInBrvB,EAAeyL,EAAQ0jB,IAFpB1lB,IAAUwlB,EAEyBxlB,EAAM4lB,GAENP,EAAMrlB,EAAM4lB,MAKpD5jB,EAASujB,EAAUvjB,EAAQhC,EAAOklB,EAA6BllB,GAAOjG,QAAO9N,IAAQ05B,EAAQzN,SAASjsB,KAAOw5B,EAAO,IAG9GzjB,CAAM,EASd,SAASuO,EAAMiV,EAAQnyB,EAAQoyB,GAC9B,OAAIA,EAAOT,cAAgBn2B,MAAM2Q,QAAQgmB,IAAW32B,MAAM2Q,QAAQnM,GAC1D2xB,EAAaQ,EAAQnyB,EAAQoyB,GAGhCb,EAAevxB,IAAYuxB,EAAeY,GAIxCD,EAAUC,EAAQnyB,EAAQ6xB,EAA6B7xB,GAASoyB,GAH/DJ,EAAMhyB,EAIf,CAEA9H,EAAOC,QAAU,YAAa2b,GAC7B,MAAMse,EAASlV,EAAM8U,EAAMN,GAAuB73B,OAAS43B,GAAc53B,MAAS,CAAC,EAAG63B,GACtF,IAAIS,EAAS,CAACK,EAAG,CAAC,GAElB,IAAK,MAAMhM,KAAU1S,EACpB,QAAe/a,IAAXytB,EAAJ,CAIA,IAAK+K,EAAe/K,GACnB,MAAM,IAAIvsB,UAAU,IAAMusB,EAAS,6BAGpC2L,EAASjV,EAAMiV,EAAQ,CAACK,EAAGhM,GAAS4L,EANpC,CASD,OAAOD,EAAOK,CACf,+BCzKAt6B,EAAOC,QAAUsb,EAEjBA,EAAiBC,UAAY,mBAE7B,MAAMyD,EAAQ,EAAQ,MACtB,IAEI+K,EAFAvlB,EAAO,EAAQ,MAMf81B,EAAuB,CAACC,UAAW,OAAQ9d,eAAgB,WAAY+d,YAAa,QAAS7d,iBAAkB,kBAAmBC,wBAAyB,SAAU6d,gBAAiB,UACtLC,EAAiB,CAACH,UAAW,SAAU9d,eAAgB,WAAY+d,YAAa,qBAAsB7d,iBAAkB,kBAAmBC,wBAAyB,WAAY6d,gBAAiB,QACjME,EAAiB,CAACJ,UAAW,OAAQ9d,eAAgB,WAAY+d,YAAa,QAAS7d,iBAAkB,kBAAmBC,wBAAyB,SAAU6d,gBAAiB,UAUpL,SAASnf,EAAiB7Y,EAAMkZ,GAE5B,IAAKnX,EAAKqN,SAASpP,GACf,MAAMX,UAAU,yBAEpB,GAAI6Z,IAAYnX,EAAKoX,SAASD,GAC1B,MAAM7Z,UAAU,6BAMpBJ,KAAKia,QAAUA,EAMfja,KAAKysB,cAAgB,KAMrBzsB,KAAKe,KAAOA,EAMZf,KAAK4a,SAAW,KAOhB5a,KAAK6a,gBAAkB,SAMvB7a,KAAK8a,UAAY,CAAC,EAMlB9a,KAAK0b,OAAS,KAMd1b,KAAKyb,UAAW,EAMhBzb,KAAKoH,QAAU,KAMfpH,KAAKmoB,SAAW,IACpB,CAEAxpB,OAAOu6B,iBAAiBtf,EAAiBpa,UAAW,CAQhDwR,KAAM,CACF5R,IAAK,WAED,IADA,IAAImqB,EAAMvpB,KACY,OAAfupB,EAAI7N,QACP6N,EAAMA,EAAI7N,OACd,OAAO6N,CACX,GASJzb,SAAU,CACN1O,IAAK,WAGD,IAFA,IAAI4gB,EAAO,CAAEhgB,KAAKe,MACdwoB,EAAMvpB,KAAK0b,OACR6N,GACHvJ,EAAKpV,QAAQ2e,EAAIxoB,MACjBwoB,EAAMA,EAAI7N,OAEd,OAAOsE,EAAKnY,KAAK,IACrB,KASR+R,EAAiBpa,UAAU6b,OAAoC,WAC3D,MAAM7c,OACV,EAOAob,EAAiBpa,UAAUke,MAAQ,SAAehC,GAC1C1b,KAAK0b,QAAU1b,KAAK0b,SAAWA,GAC/B1b,KAAK0b,OAAOvc,OAAOa,MACvBA,KAAK0b,OAASA,EACd1b,KAAKyb,UAAW,EAChB,IAAIzK,EAAO0K,EAAO1K,KACdA,aAAgBqX,GAChBrX,EAAKqhB,WAAWryB,KACxB,EAOA4Z,EAAiBpa,UAAUme,SAAW,SAAkBjC,GACpD,IAAI1K,EAAO0K,EAAO1K,KACdA,aAAgBqX,GAChBrX,EAAKwhB,cAAcxyB,MACvBA,KAAK0b,OAAS,KACd1b,KAAKyb,UAAW,CACpB,EAMA7B,EAAiBpa,UAAU0E,QAAU,WACjC,OAAIlE,KAAKyb,UAELzb,gBAAgBqoB,IAChBroB,KAAKm5B,0BAA0Bn5B,KAAK4a,UACpC5a,KAAKyb,UAAW,GAHTzb,IAMf,EAOA4Z,EAAiBpa,UAAU25B,0BAA4B,SAAmCxe,GACtF,OAAO3a,KAAKwc,iBAAiBxc,KAAK4a,UAAYD,EAClD,EAOAf,EAAiBpa,UAAUgd,iBAAmB,SAA0B7B,GACpE,IAAItX,EAAW,CAAC,EAGhB,IAAKsX,EACD,MAAM,IAAInc,MAAM,uBAAyBwB,KAAK8N,UAGlD,IAAIsrB,EAAgBz6B,OAAO01B,OAAOr0B,KAAKia,QAAUtb,OAAO01B,OAAO,CAAC,EAAIr0B,KAAKia,QAAQoC,UAAY,CAAC,EAC1Frc,KAAKoc,0BAA0BzB,IAEnC,GAAI3a,KAAK4a,SAAT,CAGI,GAAgB,WAAZD,EACAtX,EAAW1E,OAAO01B,OAAO,CAAC,EAAG2E,QAC1B,GAAgB,WAAZre,EACPtX,EAAW1E,OAAO01B,OAAO,CAAC,EAAG4E,OAC1B,IAAgB,SAAZte,EAGP,MAAM,IAAInc,MAAM,oBAAsBmc,GAFtCtX,EAAW1E,OAAO01B,OAAO,CAAC,EAAGuE,EAGjC,CACA54B,KAAK8a,UAAYnc,OAAO01B,OAAOhxB,EAAU+1B,GAAiB,CAAC,EAE/D,KAdA,CAmBA,GAAIp5B,KAAK2E,kBAAkB2Y,EAAO,CAC9B,IAAI+b,EAA4B16B,OAAO01B,OAAO,CAAC,EAAGr0B,KAAK2E,OAAOmW,WAC9D9a,KAAK8a,UAAYnc,OAAO01B,OAAOgF,EAA2BD,GAAiB,CAAC,EAChF,MAAO,GAAIp5B,KAAKwa,oBAET,KAAIxa,KAAK0b,OAIZ,MAAM,IAAIld,MAAM,+BAAiCwB,KAAK8N,UAHtD,IAAIsmB,EAAqBz1B,OAAO01B,OAAO,CAAC,EAAGr0B,KAAK0b,OAAOZ,WACvD9a,KAAK8a,UAAYnc,OAAO01B,OAAOD,EAAoBgF,GAAiB,CAAC,EAGzE,CACIp5B,KAAKua,iBAELva,KAAKua,eAAeO,UAAY9a,KAAK8a,UAlBzC,CAoBJ,EAQAlB,EAAiBpa,UAAU4c,0BAA4B,WACnD,MAAO,CAAC,CACZ,EAOAxC,EAAiBpa,UAAU+c,UAAY,SAAmBxb,GACtD,GAAIf,KAAKia,QACL,OAAOja,KAAKia,QAAQlZ,EAE5B,EASA6Y,EAAiBpa,UAAU2b,UAAY,SAAmBpa,EAAM/B,EAAOoc,GAUnE,OATKpb,KAAKia,UACNja,KAAKia,QAAU,CAAC,GAChB,cAAc9R,KAAKpH,GACnB+B,EAAKme,YAAYjhB,KAAKia,QAASlZ,EAAM/B,EAAOoc,GACpCA,QAAmClc,IAAvBc,KAAKia,QAAQlZ,KAC7Bf,KAAKuc,UAAUxb,KAAU/B,IAAOgB,KAAKyb,UAAW,GACpDzb,KAAKia,QAAQlZ,GAAQ/B,GAGlBgB,IACX,EASA4Z,EAAiBpa,UAAU0tB,gBAAkB,SAAyBnsB,EAAM/B,EAAO4tB,GAC1E5sB,KAAKysB,gBACNzsB,KAAKysB,cAAgB,IAEzB,IAAIA,EAAgBzsB,KAAKysB,cACzB,GAAIG,EAAU,CAGV,IAAIU,EAAMb,EAAc6M,MAAK,SAAUhM,GACnC,OAAO3uB,OAAOa,UAAUC,eAAewB,KAAKqsB,EAAKvsB,EACrD,IACA,GAAIusB,EAAK,CAGL,IAAIiM,EAAWjM,EAAIvsB,GACnB+B,EAAKme,YAAYsY,EAAU3M,EAAU5tB,EACzC,MAEIsuB,EAAM,CAAC,GACHvsB,GAAQ+B,EAAKme,YAAY,CAAC,EAAG2L,EAAU5tB,GAC3CytB,EAAcjsB,KAAK8sB,EAE3B,KAAO,CAEH,IAAIkM,EAAS,CAAC,EACdA,EAAOz4B,GAAQ/B,EACfytB,EAAcjsB,KAAKg5B,EACvB,CAEA,OAAOx5B,IACX,EAQA4Z,EAAiBpa,UAAU2xB,WAAa,SAAoBlX,EAASmB,GACjE,GAAInB,EACA,IAAK,IAAI/U,EAAOvG,OAAOuG,KAAK+U,GAAU1Y,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAC5DvB,KAAKmb,UAAUjW,EAAK3D,GAAI0Y,EAAQ/U,EAAK3D,IAAK6Z,GAClD,OAAOpb,IACX,EAMA4Z,EAAiBpa,UAAU6G,SAAW,WAClC,IAAIwT,EAAY7Z,KAAKsP,YAAYuK,UAC7B/L,EAAY9N,KAAK8N,SACrB,OAAIA,EAASrM,OACFoY,EAAY,IAAM/L,EACtB+L,CACX,EAMAD,EAAiBpa,UAAUgc,eAAiB,WACxC,GAAKxb,KAAK4a,UAA8B,WAAlB5a,KAAK4a,SAK3B,OAAO5a,KAAK4a,QAChB,EAGAhB,EAAiBhK,WAAa,SAAS6pB,GACnCpR,EAAOoR,CACX,+BC1WAp7B,EAAOC,QAAUiqB,EAEjB,IAAIzlB,EAAO,EAAQ,MAsCnB,SAASylB,EAAQmR,EAASC,EAAkBC,GAExC,GAAuB,mBAAZF,EACP,MAAMt5B,UAAU,8BAEpB0C,EAAKnC,aAAaM,KAAKjB,MAMvBA,KAAK05B,QAAUA,EAMf15B,KAAK25B,iBAAmB7sB,QAAQ6sB,GAMhC35B,KAAK45B,kBAAoB9sB,QAAQ8sB,EACrC,EA3DCrR,EAAQ/oB,UAAYb,OAAOC,OAAOkE,EAAKnC,aAAanB,YAAY8P,YAAciZ,EAwE/EA,EAAQ/oB,UAAUq6B,QAAU,SAASA,EAAQjmB,EAAQkmB,EAAaC,EAAcC,EAASpK,GAErF,IAAKoK,EACD,MAAM55B,UAAU,6BAEpB,IAAIkK,EAAOtK,KACX,IAAK4vB,EACD,OAAO9sB,EAAK6gB,UAAUkW,EAASvvB,EAAMsJ,EAAQkmB,EAAaC,EAAcC,GAE5E,GAAK1vB,EAAKovB,QAKV,IACI,OAAOpvB,EAAKovB,QACR9lB,EACAkmB,EAAYxvB,EAAKqvB,iBAAmB,kBAAoB,UAAUK,GAAS7W,UAC3E,SAAqBsD,EAAK4J,GAEtB,GAAI5J,EAEA,OADAnc,EAAKzI,KAAK,QAAS4kB,EAAK7S,GACjBgc,EAASnJ,GAGpB,GAAiB,OAAb4J,EAAJ,CAKA,KAAMA,aAAoB0J,GACtB,IACI1J,EAAW0J,EAAazvB,EAAKsvB,kBAAoB,kBAAoB,UAAUvJ,EACnF,CAAE,MAAO5J,GAEL,OADAnc,EAAKzI,KAAK,QAAS4kB,EAAK7S,GACjBgc,EAASnJ,EACpB,CAIJ,OADAnc,EAAKzI,KAAK,OAAQwuB,EAAUzc,GACrBgc,EAAS,KAAMS,EAZtB,CAFI/lB,EAAKrD,KAAqB,EAelC,GAER,CAAE,MAAOwf,GAGL,OAFAnc,EAAKzI,KAAK,QAAS4kB,EAAK7S,QACxBiT,YAAW,WAAa+I,EAASnJ,EAAM,GAAG,EAE9C,MArCII,YAAW,WAAa+I,EAASpxB,MAAM,iBAAmB,GAAG,EAsCrE,EAOA+pB,EAAQ/oB,UAAUyH,IAAM,SAAagzB,GAOjC,OANIj6B,KAAK05B,UACAO,GACDj6B,KAAK05B,QAAQ,KAAM,KAAM,MAC7B15B,KAAK05B,QAAU,KACf15B,KAAK6B,KAAK,OAAOc,OAEd3C,IACX,+BC5IA3B,EAAOC,QAeP,SAAiBoF,GAab,IAXA,IAAIC,EAAMb,EAAKc,QAAQ,CAAC,IAAK,IAAK,KAAMF,EAAM3C,KAAO,UAA3C+B,CACT,6BADSA,CAEL,qBAFKA,CAGT,qDAAuDY,EAAMK,YAAY8I,QAAO,SAAS7I,GAAS,OAAOA,EAAMM,GAAK,IAAG7C,OAAS,WAAa,IAHpIqB,CAIT,kBAJSA,CAKL,mBALKA,CAML,YANKA,CAOD,QAPCA,CAQL,kBAEDvB,EAAI,EACDA,EAAsBmC,EAAMK,YAAYtC,SAAUF,EAAG,CACxD,IAAIyC,EAAQN,EAAMO,aAAa1C,GAAG2C,UAC9BiB,EAAQnB,EAAMiB,wBAAwBJ,EAAO,QAAUb,EAAMmB,KAC7DhB,EAAQ,IAAMrB,EAAKsB,SAASJ,EAAMjD,MAAO4C,EACxC,aAAcK,EAAM0M,IAGrB1M,EAAMM,KAAOX,EACR,4BAA6BQ,EADrBR,CAEJ,QAASQ,EAFLR,CAGR,kCAEiCzE,IAAlC2D,EAAMQ,SAASW,EAAMe,SAAwBpB,EAC5C,OAAQd,EAAMQ,SAASW,EAAMe,UAC7BpB,EACA,eAEwBzE,IAAzB2D,EAAMQ,SAAS8B,GAAqBxB,EACnC,WAAYd,EAAMQ,SAAS8B,IAC3BxB,EACA,cAELA,EACK,mBADLA,CAES,sBAFTA,CAGS,oBAHTA,CAIa,0BAA2BK,EAAMe,QAJ9CpB,CAKa,gBAEazE,IAAtB2D,EAAMO,MAAM+B,GAAqBxB,EACpB,uCAAwCpC,GACpDoC,EACY,eAAgBwB,GAEjCxB,EACiB,QADjBA,CAEa,WAFbA,CAGiB,qBAHjBA,CAIiB,QAJjBA,CAKS,IALTA,CAMK,UAE6BzE,IAA9B2D,EAAMU,KAAKS,EAAMe,SAAwBpB,EACxC,qDAAwDQ,GACxDR,EACA,cAAeQ,IAGbH,EAAMU,UAAYf,EAEpB,uBAAwBQ,EAAKA,EAFTR,CAGhB,QAASQ,QAGSjF,IAAvB2D,EAAMY,OAAO0B,IAAqBxB,EACjC,iBADiCA,CAE7B,0BAF6BA,CAG7B,kBAH6BA,CAIzB,kBAAmBQ,EAAKgB,EAJCxB,CAKjC,cAGqBzE,IAAtB2D,EAAMO,MAAM+B,GAAqBxB,EAAIK,EAAM4M,UACrC,oDACA,0CAA2CzM,EAAK5C,GACrDoC,EACI,kBAAmBQ,EAAKgB,SAGJjG,IAAtB2D,EAAMO,MAAM+B,GAAqBxB,EAAIK,EAAM4M,UAC5C,8CACA,oCAAqCzM,EAAK5C,GAC/CoC,EACI,YAAaQ,EAAKgB,GAC3BxB,EACS,QADTA,CAEK,IAET,CASA,IATEA,EACO,WADPA,CAEW,kBAFXA,CAGW,QAHXA,CAKG,IALHA,CAMD,KAGIpC,EAAI,EAAGA,EAAImC,EAAMO,aAAaxC,SAAUF,EAAG,CAC5C,IAAI24B,EAASx2B,EAAMO,aAAa1C,GAC5B24B,EAAOlf,UAAUrX,EACxB,4BAA6Bu2B,EAAOn5B,KADZ4C,CAEpB,4CAA6Cw2B,EAAQD,GAC1D,CAEA,OAAOv2B,EACN,WAEL,EA3HA,IAAIkB,EAAU,EAAQ,MAClBhC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,MAEtB,SAASq3B,EAAQn2B,GACb,MAAO,qBAAuBA,EAAMjD,KAAO,GAC/C,kBCHAzC,EAAQ6M,WA8IR,SAAoBhJ,GAQnB,GAPAA,EAAK,IAAMnC,KAAKqL,UAAY,KAAO,IAClCrL,KAAK+J,WACJ/J,KAAKqL,UAAY,MAAQ,KAC1BlJ,EAAK,IACJnC,KAAKqL,UAAY,MAAQ,KAC1B,IAAMhN,EAAOC,QAAQ0O,SAAShN,KAAK0K,OAE/B1K,KAAKqL,UACT,OAGD,MAAMlE,EAAI,UAAYnH,KAAKsL,MAC3BnJ,EAAK+I,OAAO,EAAG,EAAG/D,EAAG,kBAKrB,IAAI0D,EAAQ,EACRuvB,EAAQ,EACZj4B,EAAK,GAAG6D,QAAQ,eAAeyC,IAChB,OAAVA,IAGJoC,IACc,OAAVpC,IAGH2xB,EAAQvvB,GACT,IAGD1I,EAAK+I,OAAOkvB,EAAO,EAAGjzB,EACvB,EA9KA7I,EAAQsO,KAgMR,SAAchB,GACb,IACKA,EACHtN,EAAQ+7B,QAAQC,QAAQ,QAAS1uB,GAEjCtN,EAAQ+7B,QAAQE,WAAW,QAE7B,CAAE,MAAO/S,GAGT,CACD,EA1MAlpB,EAAQkP,KAkNR,WACC,IAAIgtB,EACJ,IACCA,EAAIl8B,EAAQ+7B,QAAQI,QAAQ,QAC7B,CAAE,MAAOjT,GAGT,CAOA,OAJKgT,GAAwB,oBAAZppB,SAA2B,QAASA,UACpDopB,EAAIppB,QAAQvH,IAAI6wB,OAGVF,CACR,EAhOAl8B,EAAQ+M,UAyGR,WAIC,GAAsB,oBAAX0F,QAA0BA,OAAOK,UAAoC,aAAxBL,OAAOK,QAAQjM,MAAuB4L,OAAOK,QAAQupB,QAC5G,OAAO,EAIR,GAAyB,oBAAdC,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUzgB,cAAc3R,MAAM,yBACtG,OAAO,EAGR,IAAI2uB,EAKJ,MAA4B,oBAAb0D,UAA4BA,SAASC,iBAAmBD,SAASC,gBAAgBC,OAASF,SAASC,gBAAgBC,MAAMC,kBAEpH,oBAAXlqB,QAA0BA,OAAO9D,UAAY8D,OAAO9D,QAAQiuB,SAAYnqB,OAAO9D,QAAQkuB,WAAapqB,OAAO9D,QAAQmuB,QAGrG,oBAAdR,WAA6BA,UAAUC,YAAczD,EAAIwD,UAAUC,UAAUzgB,cAAc3R,MAAM,oBAAsB+V,SAAS4Y,EAAE,GAAI,KAAO,IAE/H,oBAAdwD,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUzgB,cAAc3R,MAAM,qBACtG,EAlIAnK,EAAQ+7B,QA4OR,WACC,IAGC,OAAOgB,YACR,CAAE,MAAO7T,GAGT,CACD,CArPkB8T,GAClBh9B,EAAQmN,QAAU,MACjB,IAAI8vB,GAAS,EAEb,MAAO,KACDA,IACJA,GAAS,EACTtuB,QAAQC,KAAK,yIACd,CAED,EATiB,GAelB5O,EAAQgP,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,WAyFDhP,EAAQ8M,IAAM6B,QAAQ7C,OAAS6C,QAAQ7B,KAAO,MAAS,GAkEvD/M,EAAOC,QAAU,EAAQ,IAAR,CAAoBA,GAErC,MAAM,WAAC0M,GAAc3M,EAAOC,QAM5B0M,EAAWxI,EAAI,SAAUnD,GACxB,IACC,OAAOgmB,KAAKE,UAAUlmB,EACvB,CAAE,MAAOmoB,GACR,MAAO,+BAAiCA,EAAMhb,OAC/C,CACD,+BC9QAnO,EAAOC,QAAUwb,EAGjB,IAAIgX,EAAY,EAAQ,QACtBhX,EAAKta,UAAYb,OAAOC,OAAOkyB,EAAUtxB,YAAY8P,YAAcwK,GAAMD,UAAY,OAEvF,IAAIhV,EAAY,EAAQ,MACpByY,EAAY,EAAQ,MACpB3D,EAAY,EAAQ,MACpB2O,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBtJ,EAAY,EAAQ,MACpBU,EAAY,EAAQ,MACpBtQ,EAAY,EAAQ,MACpBvM,EAAY,EAAQ,MACpB6tB,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBC,EAAY,EAAQ,KACpBpjB,EAAY,EAAQ,KACpBsjB,EAAY,EAAQ,MAUxB,SAASjX,EAAK/Y,EAAMkZ,GAChB6W,EAAU7vB,KAAKjB,KAAMe,EAAMkZ,GAM3Bja,KAAKkO,OAAS,CAAC,EAMflO,KAAKquB,YAASnvB,EAMdc,KAAKosB,gBAAaltB,EAMlBc,KAAKqsB,cAAWntB,EAMhBc,KAAKsc,WAAQpd,EAObc,KAAKw7B,YAAc,KAOnBx7B,KAAKiE,aAAe,KAOpBjE,KAAKy7B,aAAe,KAOpBz7B,KAAK07B,MAAQ,IACjB,CAyHA,SAASC,EAAWx2B,GAKhB,OAJAA,EAAKq2B,YAAcr2B,EAAKlB,aAAekB,EAAKs2B,aAAe,YACpDt2B,EAAK+P,cACL/P,EAAK6W,cACL7W,EAAKqa,OACLra,CACX,CA7HAxG,OAAOu6B,iBAAiBpf,EAAKta,UAAW,CAQpCo8B,WAAY,CACRx8B,IAAK,WAGD,GAAIY,KAAKw7B,YACL,OAAOx7B,KAAKw7B,YAEhBx7B,KAAKw7B,YAAc,CAAC,EACpB,IAAK,IAAIx6B,EAAQrC,OAAOuG,KAAKlF,KAAKkO,QAAS3M,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EAAG,CACrE,IAAIyC,EAAQhE,KAAKkO,OAAOlN,EAAMO,IAC1BmP,EAAK1M,EAAM0M,GAGf,GAAI1Q,KAAKw7B,YAAY9qB,GACjB,MAAMlS,MAAM,gBAAkBkS,EAAK,OAAS1Q,MAEhDA,KAAKw7B,YAAY9qB,GAAM1M,CAC3B,CACA,OAAOhE,KAAKw7B,WAChB,GASJz3B,YAAa,CACT3E,IAAK,WACD,OAAOY,KAAKiE,eAAiBjE,KAAKiE,aAAenB,EAAKqd,QAAQngB,KAAKkO,QACvE,GASJpK,YAAa,CACT1E,IAAK,WACD,OAAOY,KAAKy7B,eAAiBz7B,KAAKy7B,aAAe34B,EAAKqd,QAAQngB,KAAKquB,QACvE,GASJlS,KAAM,CACF/c,IAAK,WACD,OAAOY,KAAK07B,QAAU17B,KAAKmc,KAAOrC,EAAK+hB,oBAAoB77B,KAAzB8Z,GACtC,EACAxa,IAAK,SAAS6c,GAGV,IAAI3c,EAAY2c,EAAK3c,UACfA,aAAqByf,KACtB9C,EAAK3c,UAAY,IAAIyf,GAAW3P,YAAc6M,EAC/CrZ,EAAKugB,MAAMlH,EAAK3c,UAAWA,IAI/B2c,EAAKgD,MAAQhD,EAAK3c,UAAU2f,MAAQnf,KAGpC8C,EAAKugB,MAAMlH,EAAM8C,GAAS,GAE1Bjf,KAAK07B,MAAQvf,EAIb,IADA,IAAI5a,EAAI,EACDA,EAAsBvB,KAAK+D,YAAYtC,SAAUF,EACpDvB,KAAKiE,aAAa1C,GAAG2C,UAGzB,IAAI43B,EAAiB,CAAC,EACtB,IAAKv6B,EAAI,EAAGA,EAAsBvB,KAAK8D,YAAYrC,SAAUF,EACzDu6B,EAAe97B,KAAKy7B,aAAal6B,GAAG2C,UAAUnD,MAAQ,CAClD3B,IAAK0D,EAAK+a,YAAY7d,KAAKy7B,aAAal6B,GAAGic,OAC3Cle,IAAKwD,EAAKgb,YAAY9d,KAAKy7B,aAAal6B,GAAGic,QAE/Cjc,GACA5C,OAAOu6B,iBAAiB/c,EAAK3c,UAAWs8B,EAChD,KASRhiB,EAAK+hB,oBAAsB,SAA6Bn4B,GAIpD,IAFA,IAEgBM,EAFZL,EAAMb,EAAKc,QAAQ,CAAC,KAAMF,EAAM3C,MAE3BQ,EAAI,EAAUA,EAAImC,EAAMK,YAAYtC,SAAUF,GAC9CyC,EAAQN,EAAMO,aAAa1C,IAAI+C,IAAKX,EACpC,YAAab,EAAKsB,SAASJ,EAAMjD,OAC7BiD,EAAMU,UAAUf,EACpB,YAAab,EAAKsB,SAASJ,EAAMjD,OAC1C,OAAO4C,EACN,wEADMA,CAEF,uBAET,EA2BAmW,EAAKW,SAAW,SAAkB1Z,EAAM2Z,GACpC,IAAIvV,EAAO,IAAI2U,EAAK/Y,EAAM2Z,EAAKT,SAC/B9U,EAAKinB,WAAa1R,EAAK0R,WACvBjnB,EAAKknB,SAAW3R,EAAK2R,SAGrB,IAFA,IAAIrrB,EAAQrC,OAAOuG,KAAKwV,EAAKxM,QACzB3M,EAAI,EACDA,EAAIP,EAAMS,SAAUF,EACvB4D,EAAK6X,UAC0C,IAAlCtC,EAAKxM,OAAOlN,EAAMO,IAAIwD,QAC7BujB,EAAS7N,SACTd,EAAMc,UAAWzZ,EAAMO,GAAImZ,EAAKxM,OAAOlN,EAAMO,MAEvD,GAAImZ,EAAK2T,OACL,IAAKrtB,EAAQrC,OAAOuG,KAAKwV,EAAK2T,QAAS9sB,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EAC9D4D,EAAK6X,IAAIM,EAAM7C,SAASzZ,EAAMO,GAAImZ,EAAK2T,OAAOrtB,EAAMO,MAC5D,GAAImZ,EAAKgT,OACL,IAAK1sB,EAAQrC,OAAOuG,KAAKwV,EAAKgT,QAASnsB,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EAAG,CACjE,IAAImsB,EAAShT,EAAKgT,OAAO1sB,EAAMO,IAC/B4D,EAAK6X,UACe9d,IAAdwuB,EAAOhd,GACPiJ,EAAMc,cACYvb,IAAlBwuB,EAAOxf,OACP4L,EAAKW,cACavb,IAAlBwuB,EAAOzqB,OACP4B,EAAK4V,cACcvb,IAAnBwuB,EAAOja,QACP8U,EAAQ9N,SACRqW,EAAUrW,UAAWzZ,EAAMO,GAAImsB,GAEzC,CAYJ,OAXIhT,EAAK0R,YAAc1R,EAAK0R,WAAW3qB,SACnC0D,EAAKinB,WAAa1R,EAAK0R,YACvB1R,EAAK2R,UAAY3R,EAAK2R,SAAS5qB,SAC/B0D,EAAKknB,SAAW3R,EAAK2R,UACrB3R,EAAK4B,QACLnX,EAAKmX,OAAQ,GACb5B,EAAKtT,UACLjC,EAAKiC,QAAUsT,EAAKtT,SACpBsT,EAAKC,UACLxV,EAAKyV,SAAWF,EAAKC,SACzBxV,EAAK0V,gBAAkB,SAChB1V,CACX,EAOA2U,EAAKta,UAAU6b,OAAS,SAAgBC,GACpC,IAAIygB,EAAYjL,EAAUtxB,UAAU6b,OAAOpa,KAAKjB,KAAMsb,GAClDC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAenO,KAAKwb,iBACpB,UAAeugB,GAAaA,EAAU9hB,cAAW/a,EACjD,SAAe4xB,EAAUkL,YAAYh8B,KAAK8D,YAAawX,GACvD,SAAewV,EAAUkL,YAAYh8B,KAAK+D,YAAY8I,QAAO,SAAS0F,GAAO,OAAQA,EAAIiI,cAAgB,IAAIc,IAAkB,CAAC,EAChI,aAAetb,KAAKosB,YAAcpsB,KAAKosB,WAAW3qB,OAASzB,KAAKosB,gBAAaltB,EAC7E,WAAec,KAAKqsB,UAAYrsB,KAAKqsB,SAAS5qB,OAASzB,KAAKqsB,cAAWntB,EACvE,QAAec,KAAKsc,YAASpd,EAC7B,SAAe68B,GAAaA,EAAUrO,aAAUxuB,EAChD,UAAeqc,EAAevb,KAAKoH,aAAUlI,GAErD,EAKA4a,EAAKta,UAAU6xB,WAAa,WACxBP,EAAUtxB,UAAU6xB,WAAWpwB,KAAKjB,MACpC,IAAIquB,EAASruB,KAAK8D,YAClB,IAD+BvC,EAAI,EAC5BA,EAAI8sB,EAAO5sB,QACd4sB,EAAO9sB,KAAK2C,UAEhB,IADA,IAAIgK,EAASlO,KAAK+D,YAAaxC,EAAI,EAC5BA,EAAI2M,EAAOzM,QACdyM,EAAO3M,KAAK2C,UAChB,OAAOlE,IACX,EAKA8Z,EAAKta,UAAU25B,0BAA4B,SAAmCxe,GAU1E,OATAA,EAAU3a,KAAK4a,UAAYD,EAE3BmW,EAAUtxB,UAAU25B,0BAA0Bl4B,KAAKjB,KAAM2a,GACzD3a,KAAK8D,YAAYqJ,SAAQqQ,IACrBA,EAAMhB,iBAAiB7B,EAAQ,IAEnC3a,KAAK+D,YAAYoJ,SAAQnJ,IACrBA,EAAMwY,iBAAiB7B,EAAQ,IAE5B3a,IACX,EAKA8Z,EAAKta,UAAUJ,IAAM,SAAa2B,GAC9B,OAAOf,KAAKkO,OAAOnN,IACZf,KAAKquB,QAAUruB,KAAKquB,OAAOttB,IAC3Bf,KAAK0tB,QAAU1tB,KAAK0tB,OAAO3sB,IAC3B,IACX,EASA+Y,EAAKta,UAAUwd,IAAM,SAAayC,GAE9B,GAAIzf,KAAKZ,IAAIqgB,EAAO1e,MAChB,MAAMvC,MAAM,mBAAqBihB,EAAO1e,KAAO,QAAUf,MAE7D,GAAIyf,aAAkB9F,QAA2Bza,IAAlBugB,EAAOjU,OAAsB,CAMxD,GAAIxL,KAAKw7B,YAAyCx7B,KAAKw7B,YAAY/b,EAAO/O,IAAM1Q,KAAK47B,WAAWnc,EAAO/O,IACnG,MAAMlS,MAAM,gBAAkBihB,EAAO/O,GAAK,OAAS1Q,MACvD,GAAIA,KAAKs0B,aAAa7U,EAAO/O,IACzB,MAAMlS,MAAM,MAAQihB,EAAO/O,GAAK,mBAAqB1Q,MACzD,GAAIA,KAAKu0B,eAAe9U,EAAO1e,MAC3B,MAAMvC,MAAM,SAAWihB,EAAO1e,KAAO,oBAAsBf,MAO/D,OALIyf,EAAO/D,QACP+D,EAAO/D,OAAOvc,OAAOsgB,GACzBzf,KAAKkO,OAAOuR,EAAO1e,MAAQ0e,EAC3BA,EAAOjT,QAAUxM,KACjByf,EAAO/B,MAAM1d,MACN27B,EAAW37B,KACtB,CACA,OAAIyf,aAAkBnC,GACbtd,KAAKquB,SACNruB,KAAKquB,OAAS,CAAC,GACnBruB,KAAKquB,OAAO5O,EAAO1e,MAAQ0e,EAC3BA,EAAO/B,MAAM1d,MACN27B,EAAW37B,OAEf8wB,EAAUtxB,UAAUwd,IAAI/b,KAAKjB,KAAMyf,EAC9C,EASA3F,EAAKta,UAAUL,OAAS,SAAgBsgB,GACpC,GAAIA,aAAkB9F,QAA2Bza,IAAlBugB,EAAOjU,OAAsB,CAIxD,IAAKxL,KAAKkO,QAAUlO,KAAKkO,OAAOuR,EAAO1e,QAAU0e,EAC7C,MAAMjhB,MAAMihB,EAAS,uBAAyBzf,MAKlD,cAHOA,KAAKkO,OAAOuR,EAAO1e,MAC1B0e,EAAO/D,OAAS,KAChB+D,EAAO9B,SAAS3d,MACT27B,EAAW37B,KACtB,CACA,GAAIyf,aAAkBnC,EAAO,CAGzB,IAAKtd,KAAKquB,QAAUruB,KAAKquB,OAAO5O,EAAO1e,QAAU0e,EAC7C,MAAMjhB,MAAMihB,EAAS,uBAAyBzf,MAKlD,cAHOA,KAAKquB,OAAO5O,EAAO1e,MAC1B0e,EAAO/D,OAAS,KAChB+D,EAAO9B,SAAS3d,MACT27B,EAAW37B,KACtB,CACA,OAAO8wB,EAAUtxB,UAAUL,OAAO8B,KAAKjB,KAAMyf,EACjD,EAOA3F,EAAKta,UAAU80B,aAAe,SAAsB5jB,GAChD,OAAOogB,EAAUwD,aAAat0B,KAAKqsB,SAAU3b,EACjD,EAOAoJ,EAAKta,UAAU+0B,eAAiB,SAAwBxzB,GACpD,OAAO+vB,EAAUyD,eAAev0B,KAAKqsB,SAAUtrB,EACnD,EAOA+Y,EAAKta,UAAUZ,OAAS,SAAgBsgB,GACpC,OAAO,IAAIlf,KAAKmc,KAAK+C,EACzB,EAMApF,EAAKta,UAAUy8B,MAAQ,WAMnB,IAFA,IAAInuB,EAAW9N,KAAK8N,SAChBjL,EAAW,GACNtB,EAAI,EAAGA,EAAsBvB,KAAK+D,YAAYtC,SAAUF,EAC7DsB,EAAMrC,KAAKR,KAAKiE,aAAa1C,GAAG2C,UAAUe,cAG9CjF,KAAKkV,OAASyb,EAAQ3wB,KAAR2wB,CAAc,CACxBthB,OAASA,EACTxM,MAASA,EACTC,KAASA,IAEb9C,KAAKgc,OAAS4U,EAAQ5wB,KAAR4wB,CAAc,CACxBjR,OAASA,EACT9c,MAASA,EACTC,KAASA,IAEb9C,KAAKwf,OAASqR,EAAS7wB,KAAT6wB,CAAe,CACzBhuB,MAAQA,EACRC,KAAQA,IAEZ9C,KAAKiO,WAAaR,EAAUQ,WAAWjO,KAArByN,CAA2B,CACzC5K,MAAQA,EACRC,KAAQA,IAEZ9C,KAAKmO,SAAWV,EAAUU,SAASnO,KAAnByN,CAAyB,CACrC5K,MAAQA,EACRC,KAAQA,IAIZ,IAAIo5B,EAAUnL,EAASjjB,GACvB,GAAIouB,EAAS,CACT,IAAIC,EAAex9B,OAAOC,OAAOoB,MAE7Bm8B,EAAaluB,WAAajO,KAAKiO,WAC/BjO,KAAKiO,WAAaiuB,EAAQjuB,WAAWmuB,KAAKD,GAG1CA,EAAahuB,SAAWnO,KAAKmO,SAC7BnO,KAAKmO,SAAW+tB,EAAQ/tB,SAASiuB,KAAKD,EAE9C,CAEA,OAAOn8B,IACX,EAQA8Z,EAAKta,UAAU0V,OAAS,SAAsB1I,EAAS4S,GACnD,OAAOpf,KAAKi8B,QAAQ/mB,OAAO1I,EAAS4S,EACxC,EAQAtF,EAAKta,UAAU6f,gBAAkB,SAAyB7S,EAAS4S,GAC/D,OAAOpf,KAAKkV,OAAO1I,EAAS4S,GAAUA,EAAOhd,IAAMgd,EAAO6D,OAAS7D,GAAQ8D,QAC/E,EAUApJ,EAAKta,UAAUwc,OAAS,SAAsBsD,EAAQ7d,GAClD,OAAOzB,KAAKi8B,QAAQjgB,OAAOsD,EAAQ7d,EACvC,EASAqY,EAAKta,UAAU+f,gBAAkB,SAAyBD,GAGtD,OAFMA,aAAkBK,IACpBL,EAASK,EAAO/gB,OAAO0gB,IACpBtf,KAAKgc,OAAOsD,EAAQA,EAAOjP,SACtC,EAOAyJ,EAAKta,UAAUggB,OAAS,SAAsBhT,GAC1C,OAAOxM,KAAKi8B,QAAQzc,OAAOhT,EAC/B,EAOAsN,EAAKta,UAAUyO,WAAa,SAAoBwR,GAC5C,OAAOzf,KAAKi8B,QAAQhuB,WAAWwR,EACnC,EA2BA3F,EAAKta,UAAU2O,SAAW,SAAkB3B,EAASyN,GACjD,OAAOja,KAAKi8B,QAAQ9tB,SAAS3B,EAASyN,EAC1C,EAiBAH,EAAK2C,EAAI,SAAsBoE,GAC3B,OAAO,SAAuBqJ,GAC1BpnB,EAAK+Z,aAAaqN,EAAQrJ,EAC9B,CACJ,yBChmBAxiB,EAAOC,QAmBP,SAAmBuB,EAAIioB,GAKnB,IAJA,IAAIuU,EAAU,IAAI16B,MAAMU,UAAUZ,OAAS,GACvCyB,EAAU,EACV2H,EAAU,EACVyxB,GAAU,EACPzxB,EAAQxI,UAAUZ,QACrB46B,EAAOn5B,KAAYb,UAAUwI,KACjC,OAAO,IAAI0xB,SAAQ,SAAkBr4B,EAASs4B,GAC1CH,EAAOn5B,GAAU,SAAkBujB,GAC/B,GAAI6V,EAEA,GADAA,GAAU,EACN7V,EACA+V,EAAO/V,OACN,CAGD,IAFA,IAAI4V,EAAS,IAAI16B,MAAMU,UAAUZ,OAAS,GACtCyB,EAAS,EACNA,EAASm5B,EAAO56B,QACnB46B,EAAOn5B,KAAYb,UAAUa,GACjCgB,EAAQ3B,MAAM,KAAM85B,EACxB,CAER,EACA,IACIx8B,EAAG0C,MAAMulB,GAAO,KAAMuU,EAC1B,CAAE,MAAO5V,GACD6V,IACAA,GAAU,EACVE,EAAO/V,GAEf,CACJ,GACJ,+BClDApoB,EAAOC,QAAUgqB,EAGjB,IAAI3O,EAAQ,EAAQ,QAClB2O,EAAS9oB,UAAYb,OAAOC,OAAO+a,EAAMna,YAAY8P,YAAcgZ,GAAUzO,UAAY,WAE3F,IAAIhX,EAAU,EAAQ,KAClBC,EAAU,EAAQ,MActB,SAASwlB,EAASvnB,EAAM2P,EAAI3L,EAASI,EAAM8U,EAAS7S,GAIhD,GAHAuS,EAAM1Y,KAAKjB,KAAMe,EAAM2P,EAAIvL,OAAMjG,OAAWA,EAAW+a,EAAS7S,IAG3DtE,EAAKqN,SAASpL,GACf,MAAM3E,UAAU,4BAMpBJ,KAAK+E,QAAUA,EAMf/E,KAAKy8B,gBAAkB,KAGvBz8B,KAAKsE,KAAM,CACf,CAuBAgkB,EAAS7N,SAAW,SAAkB1Z,EAAM2Z,GACxC,OAAO,IAAI4N,EAASvnB,EAAM2Z,EAAKhK,GAAIgK,EAAK3V,QAAS2V,EAAKvV,KAAMuV,EAAKT,QAASS,EAAKtT,QACnF,EAOAkhB,EAAS9oB,UAAU6b,OAAS,SAAgBC,GACxC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAK+E,QACjB,OAAY/E,KAAKmF,KACjB,KAAYnF,KAAK0Q,GACjB,SAAY1Q,KAAKwL,OACjB,UAAYxL,KAAKia,QACjB,UAAYsB,EAAevb,KAAKoH,aAAUlI,GAElD,EAKAopB,EAAS9oB,UAAU0E,QAAU,WACzB,GAAIlE,KAAKyb,SACL,OAAOzb,KAGX,QAAmCd,IAA/B2D,EAAMW,OAAOxD,KAAK+E,SAClB,MAAMvG,MAAM,qBAAuBwB,KAAK+E,SAE5C,OAAO4U,EAAMna,UAAU0E,QAAQjD,KAAKjB,KACxC,EAYAsoB,EAAS7L,EAAI,SAA0BC,EAASggB,EAAcC,GAU1D,MAP8B,mBAAnBA,EACPA,EAAiB75B,EAAK+Z,aAAa8f,GAAgB57B,KAG9C47B,GAA4C,iBAAnBA,IAC9BA,EAAiB75B,EAAKga,aAAa6f,GAAgB57B,MAEhD,SAA2BvB,EAAWud,GACzCja,EAAK+Z,aAAard,EAAU8P,aACvB0N,IAAI,IAAIsL,EAASvL,EAAWL,EAASggB,EAAcC,GAC5D,CACJ,kBC7HA,IAAI1X,EAAiB,EAAQ,MAE7B3mB,EAAQs+B,UAAY,SAAS3iB,GAC3B,IAAIiL,EAAW5mB,EAAQ4mB,SAASjL,GAChC,OAAO,IAAIgL,EAAeC,EAAU,CAChCC,QAASlL,IAAYA,EAAQkL,SAAWlL,EAAQ4iB,UAAYjX,KAC5DkB,MAAO7M,GAAWA,EAAQ6M,MAC1BnB,aAAc1L,GAAWA,EAAQ0L,cAEvC,EAEArnB,EAAQ4mB,SAAW,SAASjL,GAC1B,GAAIA,aAAmBtY,MACrB,MAAO,GAAGP,OAAO6Y,GAGnB,IAAI6iB,EAAO,CACTD,QAAS,GACTE,OAAQ,EACRC,WAAY,IACZC,WAAYrX,IACZsX,WAAW,GAEb,IAAK,IAAIn+B,KAAOkb,EACd6iB,EAAK/9B,GAAOkb,EAAQlb,GAGtB,GAAI+9B,EAAKE,WAAaF,EAAKG,WACzB,MAAM,IAAIz+B,MAAM,yCAIlB,IADA,IAAI0mB,EAAW,GACN3jB,EAAI,EAAGA,EAAIu7B,EAAKD,QAASt7B,IAChC2jB,EAAS1kB,KAAKR,KAAKm9B,cAAc57B,EAAGu7B,IAYtC,OATI7iB,GAAWA,EAAQkL,UAAYD,EAASzjB,QAC1CyjB,EAAS1kB,KAAKR,KAAKm9B,cAAc57B,EAAGu7B,IAItC5X,EAAS9W,MAAK,SAASuS,EAAEC,GACvB,OAAOD,EAAIC,CACb,IAEOsE,CACT,EAEA5mB,EAAQ6+B,cAAgB,SAASpW,EAAS+V,GACxC,IAAIM,EAAUN,EAAc,UACvB7zB,KAAKm0B,SAAW,EACjB,EAEAxW,EAAU3d,KAAKuuB,MAAM4F,EAASn0B,KAAK1K,IAAIu+B,EAAKE,WAAY,GAAK/zB,KAAK0qB,IAAImJ,EAAKC,OAAQhW,IAGvF,OAFU9d,KAAKC,IAAI0d,EAASkW,EAAKG,WAGnC,EAEA3+B,EAAQ++B,KAAO,SAAS9qB,EAAK0H,EAASxG,GAMpC,GALIwG,aAAmBtY,QACrB8R,EAAUwG,EACVA,EAAU,OAGPxG,EAEH,IAAK,IAAI1U,KADT0U,EAAU,GACMlB,EACU,mBAAbA,EAAIxT,IACb0U,EAAQjT,KAAKzB,GAKnB,IAAK,IAAIwC,EAAI,EAAGA,EAAIkS,EAAQhS,OAAQF,IAAK,CACvC,IAAIqS,EAAWH,EAAQlS,GACnB+7B,EAAW/qB,EAAIqB,GAEnBrB,EAAIqB,GAAU,SAAsB0pB,GAClC,IAAIC,EAAWj/B,EAAQs+B,UAAU3iB,GAC7B9X,EAAWR,MAAMnC,UAAU0B,MAAMD,KAAKoB,UAAW,GACjDutB,EAAWztB,EAAKq7B,MAEpBr7B,EAAK3B,MAAK,SAASimB,GACb8W,EAAG/W,MAAMC,KAGTA,IACFpkB,UAAU,GAAKk7B,EAAGlW,aAEpBuI,EAASrtB,MAAMvC,KAAMqC,WACvB,IAEAk7B,EAAGxW,SAAQ,WACTuW,EAAS/6B,MAAMgQ,EAAKpQ,EACtB,GACF,EAAEi6B,KAAK7pB,EAAK+qB,GACZ/qB,EAAIqB,GAAQqG,QAAUA,CACxB,CACF,yBCzFA,SAASrW,EAAQ65B,EAAgBC,GAGC,iBAAnBD,IACPC,EAAeD,EACfA,OAAiBv+B,GAGrB,IAAIy+B,EAAO,GAYX,SAASC,EAAQC,GAIb,GAAmC,iBAAxBA,EAAkC,CACzC,IAAI13B,EAASE,IAIb,GAHIzC,EAAQk6B,SACR7wB,QAAQ7B,IAAI,YAAcjF,GAC9BA,EAAS,UAAYA,EACjB03B,EAAqB,CAKrB,IAJA,IAAIE,EAAcp/B,OAAOuG,KAAK24B,GAC1BG,EAAc,IAAIr8B,MAAMo8B,EAAUt8B,OAAS,GAC3Cw8B,EAAc,IAAIt8B,MAAMo8B,EAAUt8B,QAClCy8B,EAAc,EACXA,EAAcH,EAAUt8B,QAC3Bu8B,EAAYE,GAAeH,EAAUG,GACrCD,EAAYC,GAAeL,EAAoBE,EAAUG,MAG7D,OADAF,EAAYE,GAAe/3B,EACpBg4B,SAAS57B,MAAM,KAAMy7B,GAAaz7B,MAAM,KAAM07B,EACzD,CACA,OAAOE,SAASh4B,EAATg4B,EACX,CAKA,IAFA,IAAIC,EAAe,IAAIz8B,MAAMU,UAAUZ,OAAS,GAC5C48B,EAAe,EACZA,EAAeD,EAAa38B,QAC/B28B,EAAaC,GAAgBh8B,YAAYg8B,GAY7C,GAXAA,EAAe,EACfR,EAAsBA,EAAoB73B,QAAQ,gBAAgB,SAAiBC,EAAIC,GACnF,IAAIlH,EAAQo/B,EAAaC,KACzB,OAAQn4B,GACJ,IAAK,IAAK,IAAK,IAAK,OAAO8I,OAAOzE,OAAOvL,IACzC,IAAK,IAAK,OAAOgQ,OAAO/F,KAAK6a,MAAM9kB,IACnC,IAAK,IAAK,OAAOqmB,KAAKE,UAAUvmB,GAChC,IAAK,IAAK,OAAOgQ,OAAOhQ,GAE5B,MAAO,GACX,IACIq/B,IAAiBD,EAAa38B,OAC9B,MAAMjD,MAAM,4BAEhB,OADAm/B,EAAKn9B,KAAKq9B,GACHD,CACX,CAEA,SAASv3B,EAASi4B,GACd,MAAO,aAAeA,GAAwBZ,GAAgB,IAAM,KAAOD,GAAkBA,EAAe51B,KAAK,MAAQ,IAAM,SAAW81B,EAAK91B,KAAK,QAAU,KAClK,CAGA,OADA+1B,EAAQv3B,SAAWA,EACZu3B,CACX,CAjFAv/B,EAAOC,QAAUsF,EAiGjBA,EAAQk6B,SAAU,+BCjGlBz/B,EAAOC,QAAUkqB,EAGjB,IAAI5O,EAAmB,EAAQ,QAC7B4O,EAAOhpB,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAckZ,GAAQ3O,UAAY,SAElG,IAAI/W,EAAO,EAAQ,MAiBnB,SAAS0lB,EAAOznB,EAAMoE,EAAMmmB,EAAaE,EAAcD,EAAeE,EAAgBxR,EAAS7S,EAASqlB,GAYpG,GATI3pB,EAAKoX,SAASqR,IACdtR,EAAUsR,EACVA,EAAgBE,OAAiBvsB,GAC1B4D,EAAKoX,SAASuR,KACrBxR,EAAUwR,EACVA,OAAiBvsB,QAINA,IAATiG,IAAsBrC,EAAKqN,SAAShL,GACtC,MAAM/E,UAAU,yBAGpB,IAAK0C,EAAKqN,SAASmb,GACf,MAAMlrB,UAAU,gCAGpB,IAAK0C,EAAKqN,SAASqb,GACf,MAAMprB,UAAU,iCAEpBwZ,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,GAMlCja,KAAKmF,KAAOA,GAAQ,MAMpBnF,KAAKsrB,YAAcA,EAMnBtrB,KAAKurB,gBAAgBA,QAAuBrsB,EAM5Cc,KAAKwrB,aAAeA,EAMpBxrB,KAAKyrB,iBAAiBA,QAAwBvsB,EAM9Cc,KAAKu+B,oBAAsB,KAM3Bv+B,KAAKw+B,qBAAuB,KAM5Bx+B,KAAKoH,QAAUA,EAKfpH,KAAKysB,cAAgBA,CACzB,CAsBAjE,EAAO/N,SAAW,SAAkB1Z,EAAM2Z,GACtC,OAAO,IAAI8N,EAAOznB,EAAM2Z,EAAKvV,KAAMuV,EAAK4Q,YAAa5Q,EAAK8Q,aAAc9Q,EAAK6Q,cAAe7Q,EAAK+Q,eAAgB/Q,EAAKT,QAASS,EAAKtT,QAASsT,EAAK+R,cACtJ,EAOAjE,EAAOhpB,UAAU6b,OAAS,SAAgBC,GACtC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,OAAiC,QAAdnO,KAAKmF,MAA6CnF,KAAKmF,WAAQjG,EAClF,cAAmBc,KAAKsrB,YACxB,gBAAmBtrB,KAAKurB,cACxB,eAAmBvrB,KAAKwrB,aACxB,iBAAmBxrB,KAAKyrB,eACxB,UAAmBzrB,KAAKia,QACxB,UAAmBsB,EAAevb,KAAKoH,aAAUlI,EACjD,gBAAmBc,KAAKysB,eAEhC,EAKAjE,EAAOhpB,UAAU0E,QAAU,WAGvB,OAAIlE,KAAKyb,SACEzb,MAEXA,KAAKu+B,oBAAsBv+B,KAAK0b,OAAO+iB,WAAWz+B,KAAKsrB,aACvDtrB,KAAKw+B,qBAAuBx+B,KAAK0b,OAAO+iB,WAAWz+B,KAAKwrB,cAEjD5R,EAAiBpa,UAAU0E,QAAQjD,KAAKjB,MACnD,6BCxJA,IAAI+b,EAASzd,EAObyd,EAAOta,OAAS,SAAgB8O,GAC5B,IAAImuB,EAAInuB,EAAO9O,OACf,IAAKi9B,EACD,OAAO,EAEX,IADA,IAAIlrB,EAAI,IACCkrB,EAAI,EAAI,GAA0B,MAArBnuB,EAAO1J,OAAO63B,MAC9BlrB,EACN,OAAOvK,KAAK01B,KAAqB,EAAhBpuB,EAAO9O,QAAc,EAAI+R,CAC9C,EASA,IANA,IAAIorB,EAAM,IAAIj9B,MAAM,IAGhBk9B,EAAM,IAAIl9B,MAAM,KAGXJ,EAAI,EAAGA,EAAI,IAChBs9B,EAAID,EAAIr9B,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,EAAIA,EAAI,GAAK,IAAMA,IASrFwa,EAAO7G,OAAS,SAAgBxC,EAAQ1L,EAAOC,GAM3C,IALA,IAIIkW,EAJAC,EAAQ,KACRC,EAAQ,GACR9b,EAAI,EACJiB,EAAI,EAEDwE,EAAQC,GAAK,CAChB,IAAI2Z,EAAIlO,EAAO1L,KACf,OAAQxE,GACJ,KAAK,EACD6a,EAAM9b,KAAOq9B,EAAIhe,GAAK,GACtBzD,GAAS,EAAJyD,IAAU,EACfpe,EAAI,EACJ,MACJ,KAAK,EACD6a,EAAM9b,KAAOq9B,EAAIzhB,EAAIyD,GAAK,GAC1BzD,GAAS,GAAJyD,IAAW,EAChBpe,EAAI,EACJ,MACJ,KAAK,EACD6a,EAAM9b,KAAOq9B,EAAIzhB,EAAIyD,GAAK,GAC1BvD,EAAM9b,KAAOq9B,EAAQ,GAAJhe,GACjBpe,EAAI,EAGRjB,EAAI,QACH6b,IAAUA,EAAQ,KAAK5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,IAC/D9b,EAAI,EAEZ,CAOA,OANIiB,IACA6a,EAAM9b,KAAOq9B,EAAIzhB,GACjBE,EAAM9b,KAAO,GACH,IAANiB,IACA6a,EAAM9b,KAAO,KAEjB6b,GACI7b,GACA6b,EAAM5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,KACzD6b,EAAMvV,KAAK,KAEfmH,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,GAC5D,EAEA,IAAIu9B,EAAkB,mBAUtB/iB,EAAOC,OAAS,SAAgBzL,EAAQmC,EAAQxP,GAI5C,IAHA,IAEIia,EAFAnW,EAAQ9D,EACRV,EAAI,EAECjB,EAAI,EAAGA,EAAIgP,EAAO9O,QAAS,CAChC,IAAI0F,EAAIoJ,EAAOlD,WAAW9L,KAC1B,GAAU,KAAN4F,GAAY3E,EAAI,EAChB,MACJ,QAAqBtD,KAAhBiI,EAAI03B,EAAI13B,IACT,MAAM3I,MAAMsgC,GAChB,OAAQt8B,GACJ,KAAK,EACD2a,EAAIhW,EACJ3E,EAAI,EACJ,MACJ,KAAK,EACDkQ,EAAOxP,KAAYia,GAAK,GAAS,GAAJhW,IAAW,EACxCgW,EAAIhW,EACJ3E,EAAI,EACJ,MACJ,KAAK,EACDkQ,EAAOxP,MAAiB,GAAJia,IAAW,GAAS,GAAJhW,IAAW,EAC/CgW,EAAIhW,EACJ3E,EAAI,EACJ,MACJ,KAAK,EACDkQ,EAAOxP,MAAiB,EAAJia,IAAU,EAAIhW,EAClC3E,EAAI,EAGhB,CACA,GAAU,IAANA,EACA,MAAMhE,MAAMsgC,GAChB,OAAO57B,EAAS8D,CACpB,EAOA+U,EAAO5T,KAAO,SAAcoI,GACxB,MAAO,mEAAmEpI,KAAKoI,EACnF,+BCzIAlS,EAAOC,QAAUwyB,EAGjB,IAAIlX,EAAmB,EAAQ,QAC7BkX,EAAUtxB,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAcwhB,GAAWjX,UAAY,YAExG,IAIIC,EACAyO,EACA1jB,EANA8U,EAAW,EAAQ,MACnB7W,EAAW,EAAQ,MACnBwa,EAAW,EAAQ,MAoCvB,SAAS0e,EAAYlpB,EAAOwI,GACxB,GAAMxI,GAASA,EAAMrR,OAArB,CAGA,IADA,IAAI8Q,EAAM,CAAC,EACFhR,EAAI,EAAGA,EAAIuR,EAAMrR,SAAUF,EAChCgR,EAAIO,EAAMvR,GAAGR,MAAQ+R,EAAMvR,GAAG8Z,OAAOC,GACzC,OAAO/I,CAJa,CAKxB,CA2CA,SAASue,EAAU/vB,EAAMkZ,GACrBL,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,GAMlCja,KAAK0tB,YAASxuB,EAOdc,KAAKuyB,aAAe,IACxB,CAEA,SAASoJ,EAAW5xB,GAEhB,OADAA,EAAUwoB,aAAe,KAClBxoB,CACX,CAjFA+mB,EAAUrW,SAAW,SAAkB1Z,EAAM2Z,GACzC,OAAO,IAAIoW,EAAU/vB,EAAM2Z,EAAKT,SAASmX,QAAQ1W,EAAKgT,OAC1D,EAkBAoD,EAAUkL,YAAcA,EAQxBlL,EAAUwD,aAAe,SAAsBjI,EAAU3b,GACrD,GAAI2b,EACA,IAAK,IAAI9qB,EAAI,EAAGA,EAAI8qB,EAAS5qB,SAAUF,EACnC,GAA2B,iBAAhB8qB,EAAS9qB,IAAmB8qB,EAAS9qB,GAAG,IAAMmP,GAAM2b,EAAS9qB,GAAG,GAAKmP,EAC5E,OAAO,EACnB,OAAO,CACX,EAQAogB,EAAUyD,eAAiB,SAAwBlI,EAAUtrB,GACzD,GAAIsrB,EACA,IAAK,IAAI9qB,EAAI,EAAGA,EAAI8qB,EAAS5qB,SAAUF,EACnC,GAAI8qB,EAAS9qB,KAAOR,EAChB,OAAO,EACnB,OAAO,CACX,EAyCApC,OAAO0K,eAAeynB,EAAUtxB,UAAW,cAAe,CACtDJ,IAAK,WACD,OAAOY,KAAKuyB,eAAiBvyB,KAAKuyB,aAAezvB,EAAKqd,QAAQngB,KAAK0tB,QACvE,IA2BJoD,EAAUtxB,UAAU6b,OAAS,SAAgBC,GACzC,OAAOxY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKia,QACjB,SAAY+hB,EAAYh8B,KAAKsyB,YAAahX,IAElD,EAOAwV,EAAUtxB,UAAU4xB,QAAU,SAAiB2N,GAG3C,GAAIA,EACA,IAAK,IAA4CrR,EAAxC1sB,EAAQrC,OAAOuG,KAAK65B,GAAax9B,EAAI,EAAWA,EAAIP,EAAMS,SAAUF,EACzEmsB,EAASqR,EAAW/9B,EAAMO,IAJzBvB,KAKEgd,UACqB9d,IAAlBwuB,EAAOxf,OACP4L,EAAKW,cACavb,IAAlBwuB,EAAOzqB,OACP4B,EAAK4V,cACcvb,IAAnBwuB,EAAOja,QACP8U,EAAQ9N,cACMvb,IAAdwuB,EAAOhd,GACPiJ,EAAMc,SACNqW,EAAUrW,UAAWzZ,EAAMO,GAAImsB,IAI7C,OAAO1tB,IACX,EAOA8wB,EAAUtxB,UAAUJ,IAAM,SAAa2B,GACnC,OAAOf,KAAK0tB,QAAU1tB,KAAK0tB,OAAO3sB,IAC3B,IACX,EASA+vB,EAAUtxB,UAAUw/B,QAAU,SAAiBj+B,GAC3C,GAAIf,KAAK0tB,QAAU1tB,KAAK0tB,OAAO3sB,aAAiB8D,EAC5C,OAAO7E,KAAK0tB,OAAO3sB,GAAMkC,OAC7B,MAAMzE,MAAM,iBAAmBuC,EACnC,EASA+vB,EAAUtxB,UAAUwd,IAAM,SAAayC,GAEnC,KAAMA,aAAkB9F,QAA2Bza,IAAlBugB,EAAOjU,QAAwBiU,aAAkB3F,GAAS2F,aAAkBnC,GAASmC,aAAkB5a,GAAQ4a,aAAkB8I,GAAW9I,aAAkBqR,GAC3L,MAAM1wB,UAAU,wCAEpB,GAAKJ,KAAK0tB,OAEL,CACD,IAAI7kB,EAAO7I,KAAKZ,IAAIqgB,EAAO1e,MAC3B,GAAI8H,EAAM,CACN,KAAIA,aAAgBioB,GAAarR,aAAkBqR,IAAejoB,aAAgBiR,GAAQjR,aAAgB0f,EAWtG,MAAM/pB,MAAM,mBAAqBihB,EAAO1e,KAAO,QAAUf,MARzD,IADA,IAAI0tB,EAAS7kB,EAAKypB,YACT/wB,EAAI,EAAGA,EAAImsB,EAAOjsB,SAAUF,EACjCke,EAAOzC,IAAI0Q,EAAOnsB,IACtBvB,KAAKb,OAAO0J,GACP7I,KAAK0tB,SACN1tB,KAAK0tB,OAAS,CAAC,GACnBjO,EAAO0R,WAAWtoB,EAAKoR,SAAS,EAIxC,CACJ,MAjBIja,KAAK0tB,OAAS,CAAC,EA6BnB,OAXA1tB,KAAK0tB,OAAOjO,EAAO1e,MAAQ0e,EAErBzf,gBAAgB8Z,GAAQ9Z,gBAAgBuoB,GAAWvoB,gBAAgB6E,GAAQ7E,gBAAgB2Z,GAExF8F,EAAO7E,WAER6E,EAAO7E,SAAW6E,EAAO5E,iBAIjC4E,EAAO/B,MAAM1d,MACN27B,EAAW37B,KACtB,EASA8wB,EAAUtxB,UAAUL,OAAS,SAAgBsgB,GAEzC,KAAMA,aAAkB7F,GACpB,MAAMxZ,UAAU,qCACpB,GAAIqf,EAAO/D,SAAW1b,KAClB,MAAMxB,MAAMihB,EAAS,uBAAyBzf,MAOlD,cALOA,KAAK0tB,OAAOjO,EAAO1e,MACrBpC,OAAOuG,KAAKlF,KAAK0tB,QAAQjsB,SAC1BzB,KAAK0tB,YAASxuB,GAElBugB,EAAO9B,SAAS3d,MACT27B,EAAW37B,KACtB,EAQA8wB,EAAUtxB,UAAUmrB,OAAS,SAAgB3K,EAAMtF,GAE/C,GAAI5X,EAAKqN,SAAS6P,GACdA,EAAOA,EAAKtY,MAAM,UACjB,IAAK/F,MAAM2Q,QAAQ0N,GACpB,MAAM5f,UAAU,gBACpB,GAAI4f,GAAQA,EAAKve,QAAsB,KAAZue,EAAK,GAC5B,MAAMxhB,MAAM,yBAGhB,IADA,IAAI+qB,EAAMvpB,KACHggB,EAAKve,OAAS,GAAG,CACpB,IAAI2f,EAAOpB,EAAK1X,QAChB,GAAIihB,EAAImE,QAAUnE,EAAImE,OAAOtM,IAEzB,MADAmI,EAAMA,EAAImE,OAAOtM,cACI0P,GACjB,MAAMtyB,MAAM,kDAEhB+qB,EAAIvM,IAAIuM,EAAM,IAAIuH,EAAU1P,GACpC,CAGA,OAFI1G,GACA6O,EAAI6H,QAAQ1W,GACT6O,CACX,EAMAuH,EAAUtxB,UAAU6xB,WAAa,WAC7B,IAAI3D,EAAS1tB,KAAKsyB,YAAa/wB,EAAI,EAEnC,IADAvB,KAAKkE,UACE3C,EAAImsB,EAAOjsB,QACVisB,EAAOnsB,aAAcuvB,EACrBpD,EAAOnsB,KAAK8vB,aAEZ3D,EAAOnsB,KAAK2C,UACpB,OAAOlE,IACX,EAKA8wB,EAAUtxB,UAAU25B,0BAA4B,SAAmCxe,GAO/E,OANAA,EAAU3a,KAAK4a,UAAYD,EAE3Bf,EAAiBpa,UAAU25B,0BAA0Bl4B,KAAKjB,KAAM2a,GAChE3a,KAAKsyB,YAAYnlB,SAAQugB,IACrBA,EAAOyL,0BAA0Bxe,EAAQ,IAEtC3a,IACX,EASA8wB,EAAUtxB,UAAU2yB,OAAS,SAAgBnS,EAAMif,EAAaC,GAS5D,GAN2B,kBAAhBD,GACPC,EAAuBD,EACvBA,OAAc//B,GACP+/B,IAAgBt9B,MAAM2Q,QAAQ2sB,KACrCA,EAAc,CAAEA,IAEhBn8B,EAAKqN,SAAS6P,IAASA,EAAKve,OAAQ,CACpC,GAAa,MAATue,EACA,OAAOhgB,KAAKgR,KAChBgP,EAAOA,EAAKtY,MAAM,IACtB,MAAO,IAAKsY,EAAKve,OACb,OAAOzB,KAGX,GAAgB,KAAZggB,EAAK,GACL,OAAOhgB,KAAKgR,KAAKmhB,OAAOnS,EAAK9e,MAAM,GAAI+9B,GAG3C,IAAIE,EAAQn/B,KAAKZ,IAAI4gB,EAAK,IAC1B,GAAImf,GACA,GAAoB,IAAhBnf,EAAKve,QACL,IAAKw9B,GAAeA,EAAY9vB,QAAQgwB,EAAM7vB,cAAgB,EAC1D,OAAO6vB,OACR,GAAIA,aAAiBrO,IAAcqO,EAAQA,EAAMhN,OAAOnS,EAAK9e,MAAM,GAAI+9B,GAAa,IACvF,OAAOE,OAIX,IAAK,IAAI59B,EAAI,EAAGA,EAAIvB,KAAKsyB,YAAY7wB,SAAUF,EAC3C,GAAIvB,KAAKuyB,aAAahxB,aAAcuvB,IAAcqO,EAAQn/B,KAAKuyB,aAAahxB,GAAG4wB,OAAOnS,EAAMif,GAAa,IACrG,OAAOE,EAGnB,OAAoB,OAAhBn/B,KAAK0b,QAAmBwjB,EACjB,KACJl/B,KAAK0b,OAAOyW,OAAOnS,EAAMif,EACpC,EAoBAnO,EAAUtxB,UAAUi/B,WAAa,SAAoBze,GACjD,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAElG,IAChC,IAAKqlB,EACD,MAAM3gC,MAAM,iBAAmBwhB,GACnC,OAAOmf,CACX,EASArO,EAAUtxB,UAAU4/B,WAAa,SAAoBpf,GACjD,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAEnb,IAChC,IAAKs6B,EACD,MAAM3gC,MAAM,iBAAmBwhB,EAAO,QAAUhgB,MACpD,OAAOm/B,CACX,EASArO,EAAUtxB,UAAUmc,iBAAmB,SAA0BqE,GAC7D,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAElG,EAAMjV,IACtC,IAAKs6B,EACD,MAAM3gC,MAAM,yBAA2BwhB,EAAO,QAAUhgB,MAC5D,OAAOm/B,CACX,EASArO,EAAUtxB,UAAU6/B,cAAgB,SAAuBrf,GACvD,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAEuI,IAChC,IAAK4W,EACD,MAAM3gC,MAAM,oBAAsBwhB,EAAO,QAAUhgB,MACvD,OAAOm/B,CACX,EAGArO,EAAUlhB,WAAa,SAASqN,EAAOqiB,EAAUC,GAC7CzlB,EAAUmD,EACVsL,EAAU+W,EACVz6B,EAAU06B,CACd,+BCtcA,IAAIxX,EAAW1pB,EAAOC,QAAU,EAAjB,MAEfypB,EAASE,MAAQ,OAGjBF,EAAS3iB,SAAmB,EAAQ,KACpC2iB,EAASzC,MAAmB,EAAQ,MACpCyC,EAASwF,OAAmB,EAAQ,MAGpCxF,EAASM,KAAKzY,WAAWmY,EAASjO,KAAMiO,EAASzC,MAAOyC,EAASwF,mCCJjE,IAAIvN,EAAO1hB,EAEPkhC,EAMJxf,EAAKwf,WAAa,SAAoBxf,GAClC,MAAO,eAAe7X,KAAK6X,EAC/B,EAEIyf,EAMJzf,EAAKyf,UAAY,SAAmBzf,GAGhC,IAAI5C,GAFJ4C,EAAOA,EAAKha,QAAQ,MAAO,KACfA,QAAQ,UAAW,MACX0B,MAAM,KACtBg4B,EAAWF,EAAWxf,GACtBtgB,EAAW,GACXggC,IACAhgC,EAAS0d,EAAM9U,QAAU,KAC7B,IAAK,IAAI/G,EAAI,EAAGA,EAAI6b,EAAM3b,QACL,OAAb2b,EAAM7b,GACFA,EAAI,GAAsB,OAAjB6b,EAAM7b,EAAI,GACnB6b,EAAMlS,SAAS3J,EAAG,GACbm+B,EACLtiB,EAAMlS,OAAO3J,EAAG,KAEdA,EACc,MAAb6b,EAAM7b,GACb6b,EAAMlS,OAAO3J,EAAG,KAEdA,EAEV,OAAO7B,EAAS0d,EAAMvV,KAAK,IAC/B,EASAmY,EAAK9b,QAAU,SAAiBy7B,EAAYC,EAAaC,GAGrD,OAFKA,IACDD,EAAcH,EAAUG,IACxBJ,EAAWI,GACJA,GACNC,IACDF,EAAaF,EAAUE,KACnBA,EAAaA,EAAW35B,QAAQ,iBAAkB,KAAKvE,OAASg+B,EAAUE,EAAa,IAAMC,GAAeA,EACxH,yBC/DAvhC,EAAOC,QA6BP,SAAcuR,EAAO3O,EAAOzC,GACxB,IAAIqhC,EAASrhC,GAAQ,KACjBshC,EAASD,IAAS,EAClBE,EAAS,KACT98B,EAAS48B,EACb,OAAO,SAAoBrhC,GACvB,GAAIA,EAAO,GAAKA,EAAOshC,EACnB,OAAOlwB,EAAMpR,GACbyE,EAASzE,EAAOqhC,IAChBE,EAAOnwB,EAAMiwB,GACb58B,EAAS,GAEb,IAAIsM,EAAMtO,EAAMD,KAAK++B,EAAM98B,EAAQA,GAAUzE,GAG7C,OAFa,EAATyE,IACAA,EAAwB,GAAL,EAATA,IACPsM,CACX,CACJ,yBCwCA,SAASywB,EAAQ3hC,GAwNb,MArN4B,oBAAjB4hC,aAA8B,WAErC,IAAIC,EAAM,IAAID,aAAa,EAAG,IAC1BE,EAAM,IAAInwB,WAAWkwB,EAAIztB,QACzB2tB,EAAiB,MAAXD,EAAI,GAEd,SAASE,EAAmBr1B,EAAKuE,EAAK1I,GAClCq5B,EAAI,GAAKl1B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAEA,SAASG,EAAmBt1B,EAAKuE,EAAK1I,GAClCq5B,EAAI,GAAKl1B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAOA,SAASI,EAAkBhxB,EAAK1I,GAK5B,OAJAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZq5B,EAAI,EACf,CAEA,SAASM,EAAkBjxB,EAAK1I,GAK5B,OAJAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZq5B,EAAI,EACf,CAlBA7hC,EAAQukB,aAAewd,EAAKC,EAAqBC,EAEjDjiC,EAAQoiC,aAAeL,EAAKE,EAAqBD,EAmBjDhiC,EAAQw4B,YAAcuJ,EAAKG,EAAoBC,EAE/CniC,EAAQqiC,YAAcN,EAAKI,EAAoBD,CAGlD,CAjDwC,GAiD9B,WAEP,SAASI,EAAmBC,EAAW51B,EAAKuE,EAAK1I,GAC7C,IAAIwX,EAAOrT,EAAM,EAAI,EAAI,EAGzB,GAFIqT,IACArT,GAAOA,GACC,IAARA,EACA41B,EAAU,EAAI51B,EAAM,EAAmB,EAAqB,WAAYuE,EAAK1I,QAC5E,GAAIg6B,MAAM71B,GACX41B,EAAU,WAAYrxB,EAAK1I,QAC1B,GAAImE,EAAM,qBACX41B,GAAWviB,GAAQ,GAAK,cAAgB,EAAG9O,EAAK1I,QAC/C,GAAImE,EAAM,sBACX41B,GAAWviB,GAAQ,GAAKrV,KAAKuuB,MAAMvsB,EAAM,yBAA4B,EAAGuE,EAAK1I,OAC5E,CACD,IAAIi6B,EAAW93B,KAAK6a,MAAM7a,KAAKmC,IAAIH,GAAOhC,KAAK+3B,KAE/CH,GAAWviB,GAAQ,GAAKyiB,EAAW,KAAO,GAD0B,QAArD93B,KAAKuuB,MAAMvsB,EAAMhC,KAAK0qB,IAAI,GAAIoN,GAAY,YACI,EAAGvxB,EAAK1I,EACzE,CACJ,CAKA,SAASm6B,EAAkBC,EAAU1xB,EAAK1I,GACtC,IAAIq6B,EAAOD,EAAS1xB,EAAK1I,GACrBwX,EAAsB,GAAd6iB,GAAQ,IAAU,EAC1BJ,EAAWI,IAAS,GAAK,IACzBC,EAAkB,QAAPD,EACf,OAAoB,MAAbJ,EACDK,EACAtX,IACAxL,GAAOsH,KACM,IAAbmb,EACO,qBAAPziB,EAA+B8iB,EAC/B9iB,EAAOrV,KAAK0qB,IAAI,EAAGoN,EAAW,MAAQK,EAAW,QAC3D,CAfA9iC,EAAQukB,aAAe+d,EAAmBxE,KAAK,KAAMiF,GACrD/iC,EAAQoiC,aAAeE,EAAmBxE,KAAK,KAAMkF,GAgBrDhjC,EAAQw4B,YAAcmK,EAAkB7E,KAAK,KAAMmF,GACnDjjC,EAAQqiC,YAAcM,EAAkB7E,KAAK,KAAMoF,EAEtD,CAzCU,GA4CiB,oBAAjBC,aAA8B,WAErC,IAAIC,EAAM,IAAID,aAAa,EAAE,IACzBrB,EAAM,IAAInwB,WAAWyxB,EAAIhvB,QACzB2tB,EAAiB,MAAXD,EAAI,GAEd,SAASuB,EAAoB12B,EAAKuE,EAAK1I,GACnC46B,EAAI,GAAKz2B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAEA,SAASwB,EAAoB32B,EAAKuE,EAAK1I,GACnC46B,EAAI,GAAKz2B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAOA,SAASyB,EAAmBryB,EAAK1I,GAS7B,OARAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZ46B,EAAI,EACf,CAEA,SAASI,EAAmBtyB,EAAK1I,GAS7B,OARAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZ46B,EAAI,EACf,CA1BApjC,EAAQykB,cAAgBsd,EAAKsB,EAAsBC,EAEnDtjC,EAAQyjC,cAAgB1B,EAAKuB,EAAsBD,EA2BnDrjC,EAAQy4B,aAAesJ,EAAKwB,EAAqBC,EAEjDxjC,EAAQ0jC,aAAe3B,EAAKyB,EAAqBD,CAGpD,CAjEwC,GAiE9B,WAEP,SAASI,EAAoBpB,EAAWqB,EAAMC,EAAMl3B,EAAKuE,EAAK1I,GAC1D,IAAIwX,EAAOrT,EAAM,EAAI,EAAI,EAGzB,GAFIqT,IACArT,GAAOA,GACC,IAARA,EACA41B,EAAU,EAAGrxB,EAAK1I,EAAMo7B,GACxBrB,EAAU,EAAI51B,EAAM,EAAmB,EAAqB,WAAYuE,EAAK1I,EAAMq7B,QAChF,GAAIrB,MAAM71B,GACb41B,EAAU,EAAGrxB,EAAK1I,EAAMo7B,GACxBrB,EAAU,WAAYrxB,EAAK1I,EAAMq7B,QAC9B,GAAIl3B,EAAM,sBACb41B,EAAU,EAAGrxB,EAAK1I,EAAMo7B,GACxBrB,GAAWviB,GAAQ,GAAK,cAAgB,EAAG9O,EAAK1I,EAAMq7B,OACnD,CACH,IAAIf,EACJ,GAAIn2B,EAAM,uBAEN41B,GADAO,EAAWn2B,EAAM,UACM,EAAGuE,EAAK1I,EAAMo7B,GACrCrB,GAAWviB,GAAQ,GAAK8iB,EAAW,cAAgB,EAAG5xB,EAAK1I,EAAMq7B,OAC9D,CACH,IAAIpB,EAAW93B,KAAK6a,MAAM7a,KAAKmC,IAAIH,GAAOhC,KAAK+3B,KAC9B,OAAbD,IACAA,EAAW,MAEfF,EAAqB,kBADrBO,EAAWn2B,EAAMhC,KAAK0qB,IAAI,GAAIoN,MACY,EAAGvxB,EAAK1I,EAAMo7B,GACxDrB,GAAWviB,GAAQ,GAAKyiB,EAAW,MAAQ,GAAgB,QAAXK,EAAqB,WAAa,EAAG5xB,EAAK1I,EAAMq7B,EACpG,CACJ,CACJ,CAKA,SAASC,EAAmBlB,EAAUgB,EAAMC,EAAM3yB,EAAK1I,GACnD,IAAIkX,EAAKkjB,EAAS1xB,EAAK1I,EAAMo7B,GACzBjkB,EAAKijB,EAAS1xB,EAAK1I,EAAMq7B,GACzB7jB,EAAoB,GAAZL,GAAM,IAAU,EACxB8iB,EAAW9iB,IAAO,GAAK,KACvBmjB,EAAW,YAAmB,QAALnjB,GAAgBD,EAC7C,OAAoB,OAAb+iB,EACDK,EACAtX,IACAxL,GAAOsH,KACM,IAAbmb,EACO,OAAPziB,EAAgB8iB,EAChB9iB,EAAOrV,KAAK0qB,IAAI,EAAGoN,EAAW,OAASK,EAAW,iBAC5D,CAhBA9iC,EAAQykB,cAAgBkf,EAAoB7F,KAAK,KAAMiF,EAAa,EAAG,GACvE/iC,EAAQyjC,cAAgBE,EAAoB7F,KAAK,KAAMkF,EAAa,EAAG,GAiBvEhjC,EAAQy4B,aAAeqL,EAAmBhG,KAAK,KAAMmF,EAAY,EAAG,GACpEjjC,EAAQ0jC,aAAeI,EAAmBhG,KAAK,KAAMoF,EAAY,EAAG,EAEvE,CArDU,GAuDJljC,CACX,CAIA,SAAS+iC,EAAYp2B,EAAKuE,EAAK1I,GAC3B0I,EAAI1I,GAAyB,IAAbmE,EAChBuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAAK,IAC7BuE,EAAI1I,EAAM,GAAMmE,IAAQ,GAAK,IAC7BuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAC5B,CAEA,SAASq2B,EAAYr2B,EAAKuE,EAAK1I,GAC3B0I,EAAI1I,GAAYmE,IAAQ,GACxBuE,EAAI1I,EAAM,GAAMmE,IAAQ,GAAK,IAC7BuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAAK,IAC7BuE,EAAI1I,EAAM,GAAmB,IAAbmE,CACpB,CAEA,SAASs2B,EAAW/xB,EAAK1I,GACrB,OAAQ0I,EAAI1I,GACJ0I,EAAI1I,EAAM,IAAM,EAChB0I,EAAI1I,EAAM,IAAM,GAChB0I,EAAI1I,EAAM,IAAM,MAAQ,CACpC,CAEA,SAAS06B,EAAWhyB,EAAK1I,GACrB,OAAQ0I,EAAI1I,IAAY,GAChB0I,EAAI1I,EAAM,IAAM,GAChB0I,EAAI1I,EAAM,IAAM,EAChB0I,EAAI1I,EAAM,MAAQ,CAC9B,CA5UAzI,EAAOC,QAAU2hC,EAAQA,gCCDzB5hC,EAAOC,QAAUiqB,EAGjB,IAAIuI,EAAY,EAAQ,QACtBvI,EAAQ/oB,UAAYb,OAAOC,OAAOkyB,EAAUtxB,YAAY8P,YAAciZ,GAAS1O,UAAY,UAE7F,IAAI2O,EAAS,EAAQ,MACjB1lB,EAAS,EAAQ,MACjBolB,EAAS,EAAQ,MAWrB,SAASK,EAAQxnB,EAAMkZ,GACnB6W,EAAU7vB,KAAKjB,KAAMe,EAAMkZ,GAM3Bja,KAAKyT,QAAU,CAAC,EAOhBzT,KAAKqiC,cAAgB,IACzB,CA4DA,SAAS1G,EAAWvQ,GAEhB,OADAA,EAAQiX,cAAgB,KACjBjX,CACX,CA/CA7C,EAAQ9N,SAAW,SAAkB1Z,EAAM2Z,GACvC,IAAI0Q,EAAU,IAAI7C,EAAQxnB,EAAM2Z,EAAKT,SAErC,GAAIS,EAAKjH,QACL,IAAK,IAAIzS,EAAQrC,OAAOuG,KAAKwV,EAAKjH,SAAUlS,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EACnE6pB,EAAQpO,IAAIwL,EAAO/N,SAASzZ,EAAMO,GAAImZ,EAAKjH,QAAQzS,EAAMO,MAOjE,OANImZ,EAAKgT,QACLtC,EAAQgG,QAAQ1W,EAAKgT,QACrBhT,EAAKC,UACLyQ,EAAQxQ,SAAWF,EAAKC,SAC5ByQ,EAAQhkB,QAAUsT,EAAKtT,QACvBgkB,EAAQvQ,gBAAkB,SACnBuQ,CACX,EAOA7C,EAAQ/oB,UAAU6b,OAAS,SAAgBC,GACvC,IAAIygB,EAAYjL,EAAUtxB,UAAU6b,OAAOpa,KAAKjB,KAAMsb,GAClDC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKwb,iBACjB,UAAYugB,GAAaA,EAAU9hB,cAAW/a,EAC9C,UAAY4xB,EAAUkL,YAAYh8B,KAAKsiC,aAAchnB,IAA6C,CAAC,EACnG,SAAYygB,GAAaA,EAAUrO,aAAUxuB,EAC7C,UAAYqc,EAAevb,KAAKoH,aAAUlI,GAElD,EAQAP,OAAO0K,eAAekf,EAAQ/oB,UAAW,eAAgB,CACrDJ,IAAK,WACD,OAAOY,KAAKqiC,gBAAkBriC,KAAKqiC,cAAgBv/B,EAAKqd,QAAQngB,KAAKyT,SACzE,IAWJ8U,EAAQ/oB,UAAUJ,IAAM,SAAa2B,GACjC,OAAOf,KAAKyT,QAAQ1S,IACb+vB,EAAUtxB,UAAUJ,IAAI6B,KAAKjB,KAAMe,EAC9C,EAKAwnB,EAAQ/oB,UAAU6xB,WAAa,WAC3BP,EAAUtxB,UAAU0E,QAAQjD,KAAKjB,MAEjC,IADA,IAAIyT,EAAUzT,KAAKsiC,aACV/gC,EAAI,EAAGA,EAAIkS,EAAQhS,SAAUF,EAClCkS,EAAQlS,GAAG2C,UACf,OAAOlE,IACX,EAKAuoB,EAAQ/oB,UAAU25B,0BAA4B,SAAmCxe,GAO7E,OANAA,EAAU3a,KAAK4a,UAAYD,EAE3BmW,EAAUtxB,UAAU25B,0BAA0Bl4B,KAAKjB,KAAM2a,GACzD3a,KAAKsiC,aAAan1B,SAAQyG,IACtBA,EAAOulB,0BAA0Bxe,EAAQ,IAEtC3a,IACX,EAKAuoB,EAAQ/oB,UAAUwd,IAAM,SAAayC,GAGjC,GAAIzf,KAAKZ,IAAIqgB,EAAO1e,MAChB,MAAMvC,MAAM,mBAAqBihB,EAAO1e,KAAO,QAAUf,MAE7D,OAAIyf,aAAkB+I,GAClBxoB,KAAKyT,QAAQgM,EAAO1e,MAAQ0e,EAC5BA,EAAO/D,OAAS1b,KACT27B,EAAW37B,OAEf8wB,EAAUtxB,UAAUwd,IAAI/b,KAAKjB,KAAMyf,EAC9C,EAKA8I,EAAQ/oB,UAAUL,OAAS,SAAgBsgB,GACvC,GAAIA,aAAkB+I,EAAQ,CAG1B,GAAIxoB,KAAKyT,QAAQgM,EAAO1e,QAAU0e,EAC9B,MAAMjhB,MAAMihB,EAAS,uBAAyBzf,MAIlD,cAFOA,KAAKyT,QAAQgM,EAAO1e,MAC3B0e,EAAO/D,OAAS,KACTigB,EAAW37B,KACtB,CACA,OAAO8wB,EAAUtxB,UAAUL,OAAO8B,KAAKjB,KAAMyf,EACjD,EASA8I,EAAQ/oB,UAAUZ,OAAS,SAAgB86B,EAASC,EAAkBC,GAElE,IADA,IACgBhmB,EADZ2uB,EAAa,IAAIra,EAAIK,QAAQmR,EAASC,EAAkBC,GACnDr4B,EAAI,EAAWA,EAAsBvB,KAAKsiC,aAAa7gC,SAAUF,EAAG,CACzE,IAAI6S,EAAatR,EAAK4hB,SAAS9Q,EAAS5T,KAAKqiC,cAAc9gC,IAAI2C,UAAUnD,MAAMiF,QAAQ,WAAY,IACnGu8B,EAAWnuB,GAActR,EAAKc,QAAQ,CAAC,IAAI,KAAMd,EAAKwd,WAAWlM,GAAcA,EAAa,IAAMA,EAAzEtR,CAAqF,iCAArFA,CAAuH,CAC5Is0B,EAAGxjB,EACH4uB,EAAG5uB,EAAO2qB,oBAAoBpiB,KAC9BpZ,EAAG6Q,EAAO4qB,qBAAqBriB,MAEvC,CACA,OAAOomB,CACX,6BCvLA5jC,OAAO0K,eAAe/K,EAAS,aAAc,CAAEU,OAAO,IACtD,MAAMyjC,EACF,WAAAnzB,GACItP,KAAK0iC,UAAY,GACjB1iC,KAAK2iC,UAAY,GACjB3iC,KAAK4iC,cAAgB,CAAC,EACtB5iC,KAAK6iC,UAAW,EAChB7iC,KAAK8iC,WAAY,CACrB,CACA,IAAAtiC,CAAKxB,GACD,GAAIgB,KAAK8iC,UACL,OACJ,MAAMC,EAAa,CAAE/jC,QAAOgkC,MAAM,GAClC,GAAIhjC,KAAK0iC,UAAUjhC,OAAQ,CACvB,MAAMwhC,EAAcjjC,KAAK0iC,UAAUp6B,QAC/B26B,GACAA,EAAY/+B,QAAQ6+B,EAC5B,MAEI/iC,KAAK2iC,UAAUniC,KAAK+7B,QAAQr4B,QAAQ6+B,SACT7jC,IAAvBc,KAAKkjC,eACLljC,KAAK2iC,UAAUlhC,QAAUzB,KAAKkjC,gBAC7BljC,KAAK6iC,WACN7iC,KAAK6iC,UAAW,EACZ7iC,KAAK4iC,cAAcO,UACnBnjC,KAAK4iC,cAAcO,YAEdl2B,SACLA,QAAQC,KAAK,+BAA+BlN,KAAK2iC,UAAUlhC,gBAI3E,CACA,IAAA6kB,GACI,IAAItmB,KAAK8iC,UAAT,CAEA9iC,KAAK8iC,WAAY,EACjB9iC,KAAKb,SACL,IAAK,MAAM8jC,KAAejjC,KAAK0iC,UAC3BO,EAAY/+B,QAAQ,CAAElF,WAAOE,EAAW8jC,MAAM,IAElDhjC,KAAK0iC,UAAUjhC,OAAS,CANd,CAOd,CACA,IAAA2hC,CAAK5b,GACD,IAAIxnB,KAAK8iC,UAIT,GAFA9iC,KAAK8iC,WAAY,EACjB9iC,KAAKb,SACDa,KAAK0iC,UAAUjhC,OAAQ,CACvB,IAAK,MAAMwhC,KAAejjC,KAAK0iC,UAC3BO,EAAYzG,OAAOhV,GAEvBxnB,KAAK0iC,UAAUjhC,OAAS,CAC5B,KACK,CACD,MAAM4hC,EAAY9G,QAAQC,OAAOhV,GAEjC6b,EAAUC,OAAM,SAChBtjC,KAAK2iC,UAAUniC,KAAK6iC,EACxB,CACJ,CACA,MAAAlkC,GACIo9B,QAAQr4B,UAAUq/B,MAAK,KACfvjC,KAAKwjC,gBACLxjC,KAAKwjC,gBAAgB,GAEjC,CACA,CAACC,OAAOC,iBACJ,MAAO,CACHr7B,KAAOrJ,IACH,MAAM8V,EAAS9U,KAAK2iC,UAAUr6B,QAC9B,OAAIwM,QAC0B5V,IAAtBc,KAAK2jC,cACL3jC,KAAK2iC,UAAUlhC,QAAUzB,KAAK2jC,cAC9B3jC,KAAK6iC,WACL7iC,KAAK6iC,UAAW,EACZ7iC,KAAK4iC,cAAcgB,UACnB5jC,KAAK4iC,cAAcgB,YAGpB9uB,GAEF9U,KAAK8iC,UACHvG,QAAQr4B,QAAQ,CAAElF,WAAOE,EAAW8jC,MAAM,IAG1C,IAAIzG,SAAQ,CAACr4B,EAASs4B,KACzBx8B,KAAK0iC,UAAUliC,KAAK,CAAE0D,UAASs4B,UAAS,GAEhD,EAEJqH,OAAQ,KACJ7jC,KAAK8iC,WAAY,EACjB9iC,KAAK2iC,UAAUlhC,OAAS,EACxBzB,KAAKb,SACEo9B,QAAQr4B,QAAQ,CAAElF,WAAOE,EAAW8jC,MAAM,KAG7D,EAEJ,MAAMp5B,EACF,WAAA0F,CAAYw0B,GAAQ,cAAEZ,EAAgB,IAAG,aAAES,EAAe,GAAM,CAAC,GAC7D,MAAMI,EAAQ,IAAItB,EAClBsB,EAAMb,cAAgBA,EACtBa,EAAMJ,aAAeA,EACrBI,EAAMP,eACFM,EAAO,CACHtjC,KAAMxB,GAAS+kC,EAAMvjC,KAAKxB,GAC1BsnB,KAAM,IAAMyd,EAAMzd,OAClB8c,KAAM5b,GAASuc,EAAMX,KAAK5b,GAC1B/kB,GAAI,CAACtC,EAAON,KACRkkC,EAAMnB,cAAcziC,GAASN,CAAE,KAEjC,MAAU,GACpBG,KAAKyjC,OAAOC,eAAiB,IAAMK,EAAMN,OAAOC,iBAChD/kC,OAAOmd,OAAO9b,KAClB,EAEJ1B,EAAQsL,cAAgBA,EACxBtL,EAAA,QAAkBsL,ICvHdo6B,yBAA2B,CAAC,ECA5BC,eADAC,SDIJ,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeL,yBAAyBI,GAC5C,QAAqBllC,IAAjBmlC,EACH,OAAOA,EAAa/lC,QAGrB,IAAID,EAAS2lC,yBAAyBI,GAAY,CAGjD9lC,QAAS,CAAC,GAOX,OAHAgmC,oBAAoBF,GAAUnjC,KAAK5C,EAAOC,QAASD,EAAQA,EAAOC,QAAS6lC,qBAGpE9lC,EAAOC,OACf,CEtBA6lC,oBAAoBI,KAAO,CAAC,EDAxBL,SAAWvlC,OAAOw4B,eAAkB5kB,GAAS5T,OAAOw4B,eAAe5kB,GAASA,GAASA,EAAa,UAQtG4xB,oBAAoBhnB,EAAI,SAASne,EAAOwlC,GAEvC,GADU,EAAPA,IAAUxlC,EAAQgB,KAAKhB,IAChB,EAAPwlC,EAAU,OAAOxlC,EACpB,GAAoB,iBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAPwlC,GAAaxlC,EAAMylC,WAAY,OAAOzlC,EAC1C,GAAW,GAAPwlC,GAAoC,mBAAfxlC,EAAMukC,KAAqB,OAAOvkC,CAC5D,CACA,IAAI+N,EAAKpO,OAAOC,OAAO,MACvBulC,oBAAoB3J,EAAEztB,GACtB,IAAI23B,EAAM,CAAC,EACXT,eAAiBA,gBAAkB,CAAC,KAAMC,SAAS,CAAC,GAAIA,SAAS,IAAKA,SAASA,WAC/E,IAAI,IAAIS,EAAiB,EAAPH,GAAYxlC,EAAyB,iBAAX2lC,KAAyBV,eAAe90B,QAAQw1B,GAAUA,EAAUT,SAASS,GACxHhmC,OAAOimC,oBAAoBD,GAASx3B,SAASpO,GAAS2lC,EAAI3lC,GAAO,IAAOC,EAAMD,KAI/E,OAFA2lC,EAAa,QAAI,IAAM,EACvBP,oBAAoB1nB,EAAE1P,EAAI23B,GACnB33B,CACR,EExBAo3B,oBAAoB1nB,EAAI,CAACne,EAASumC,KACjC,IAAI,IAAI9lC,KAAO8lC,EACXV,oBAAoBhhC,EAAE0hC,EAAY9lC,KAASolC,oBAAoBhhC,EAAE7E,EAASS,IAC5EJ,OAAO0K,eAAe/K,EAASS,EAAK,CAAE2M,YAAY,EAAMtM,IAAKylC,EAAW9lC,IAE1E,ECNDolC,oBAAoBhhC,EAAI,CAACoP,EAAK5E,IAAUhP,OAAOa,UAAUC,eAAewB,KAAKsR,EAAK5E,GCClFw2B,oBAAoB3J,EAAKl8B,IACH,oBAAXmlC,QAA0BA,OAAOqB,aAC1CnmC,OAAO0K,eAAe/K,EAASmlC,OAAOqB,YAAa,CAAE9lC,MAAO,WAE7DL,OAAO0K,eAAe/K,EAAS,aAAc,CAAEU,OAAO,GAAO,42CCDvD,SAAS6Q,EAAMpR,EAAO,GACzB,OAAO,IAAIwR,WAAWxR,EAC1B,CAMO,SAASumB,EAAYvmB,EAAO,GAC/B,OAAO,IAAIwR,WAAWxR,EAC1B,iFCZA,MAAMsmC,EAAK97B,KAAK0qB,IAAI,EAAG,GACjBqR,EAAK/7B,KAAK0qB,IAAI,EAAG,IACjBsR,EAAKh8B,KAAK0qB,IAAI,EAAG,IACjBuR,EAAKj8B,KAAK0qB,IAAI,EAAG,IACjBwR,EAAKl8B,KAAK0qB,IAAI,EAAG,IACjByR,EAAKn8B,KAAK0qB,IAAI,EAAG,IACjB0R,EAAKp8B,KAAK0qB,IAAI,EAAG,IAEjB2R,EAAM,IAENC,EAAO,IACN,SAASC,EAAexmC,GAC3B,GAAIA,EAAQ+lC,EACR,OAAO,EAEX,GAAI/lC,EAAQgmC,EACR,OAAO,EAEX,GAAIhmC,EAAQimC,EACR,OAAO,EAEX,GAAIjmC,EAAQkmC,EACR,OAAO,EAEX,GAAIlmC,EAAQmmC,EACR,OAAO,EAEX,GAAInmC,EAAQomC,EACR,OAAO,EAEX,GAAIpmC,EAAQqmC,EACR,OAAO,EAEX,GAA+B,MAA3B96B,OAAOk7B,kBAA4BzmC,EAAQuL,OAAOk7B,iBAClD,MAAM,IAAIjP,WAAW,2BAEzB,OAAO,CACX,CACO,SAASkP,EAAiB1mC,EAAOwQ,EAAKtM,EAAS,GAClD,OAAQsiC,EAAexmC,IACnB,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EACjBA,KAAW,EACX,MAEJ,QAAS,MAAM,IAAIR,MAAM,eAE7B,OAAOgR,CACX,CAwCO,SAASm2B,EAAiBn2B,EAAKtM,GAClC,IAAI0d,EAAIpR,EAAItM,GACR0iC,EAAM,EAEV,GADAA,GAAOhlB,EAAI2kB,EACP3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,IAAS,EACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQL,EAChBtkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQJ,EAChBvkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQH,EAChBxkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQF,EAChBzkB,EAAI0kB,EACJ,OAAOM,EAEX,MAAM,IAAIpP,WAAW,0BACzB,CA6CO,SAASthB,EAAOlW,EAAOwQ,EAAKtM,EAAS,GAIxC,OAHW,MAAPsM,IACAA,EAAMwV,EAAYwgB,EAAexmC,KAEjCwQ,aAAeS,WACRy1B,EAAiB1mC,EAAOwQ,EAAKtM,GApIrC,SAA8BlE,EAAOwQ,EAAKtM,EAAS,GACtD,OAAQsiC,EAAexmC,IACnB,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,GACnBA,KAAW,EACX,MAEJ,QAAS,MAAM,IAAIR,MAAM,eAE7B,OAAOgR,CACX,CAiGeq2B,CAAqB7mC,EAAOwQ,EAAKtM,EAEhD,CACO,SAAS8Y,EAAOxM,EAAKtM,EAAS,GACjC,OAAIsM,aAAeS,WACR01B,EAAiBn2B,EAAKtM,GAzD9B,SAA8BsM,EAAKtM,GACtC,IAAI0d,EAAIpR,EAAIpQ,IAAI8D,GACZ0iC,EAAM,EAEV,GADAA,GAAOhlB,EAAI2kB,EACP3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,IAAS,EACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQL,EAChBtkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQJ,EAChBvkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQH,EAChBxkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQF,EAChBzkB,EAAI0kB,EACJ,OAAOM,EAEX,MAAM,IAAIpP,WAAW,0BACzB,CAiBesP,CAAqBt2B,EAAKtM,EAEzC,CChOA,MAAMi9B,EAAM,IAAID,aAAa,EAAE,IACzBE,EAAM,IAAInwB,WAAWkwB,EAAIztB,QAIxB,SAASmQ,EAAa5X,EAAKuE,EAAK1I,GACnCq5B,EAAI,GAAKl1B,EACTuE,EAAI1I,GAAOs5B,EAAI,GACf5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CA+BA,MAAMsB,EAAM,IAAID,aAAa,EAAE,IACzBsE,EAAM,IAAI91B,WAAWyxB,EAAIhvB,QAIxB,SAASqQ,EAAc9X,EAAKuE,EAAK1I,GACpC46B,EAAI,GAAKz2B,EACTuE,EAAI1I,GAAOi/B,EAAI,GACfv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,EACvB,CCxDA,MAAMC,EAA0BC,OAAO17B,OAAOk7B,kBACxCS,EAA0BD,OAAO17B,OAAO47B,kBAUvC,MAAMpoB,EACTC,GACAC,GACA,WAAA3O,CAAY0O,EAAIC,GAMZje,KAAKge,GAAU,EAALA,EAIVhe,KAAKie,GAAU,EAALA,CACd,CAIA,QAAApP,CAASD,GAAW,GAChB,IAAKA,GAAa5O,KAAKie,KAAO,GAAM,EAAG,CACnC,MAAMD,EAAgB,GAAVhe,KAAKge,KAAW,EAC5B,IAAIC,GAAMje,KAAKie,KAAO,EAItB,OAHW,IAAPD,IACAC,EAAKA,EAAK,IAAM,KAEXD,EAAU,WAALC,EAClB,CACA,OAAOje,KAAKge,GAAe,WAAVhe,KAAKie,EAC1B,CAIA,QAAAmoB,CAASx3B,GAAW,GAChB,GAAIA,EACA,OAAOq3B,OAAOjmC,KAAKge,KAAO,IAAMioB,OAAOjmC,KAAKie,KAAO,IAAM,KAE7D,GAAKje,KAAKie,KAAO,IAAQ,EAAG,CACxB,MAAMD,EAAgB,GAAVhe,KAAKge,KAAW,EAC5B,IAAIC,GAAMje,KAAKie,KAAO,EAItB,OAHW,IAAPD,IACAC,EAAKA,EAAK,IAAM,KAEXgoB,OAAOjoB,IAAOioB,OAAOhoB,IAAO,KACzC,CACA,OAAOgoB,OAAOjmC,KAAKge,KAAO,IAAMioB,OAAOjmC,KAAKie,KAAO,IAAM,IAC7D,CAIA,QAAA5X,CAASuI,GAAW,GAChB,OAAO5O,KAAKomC,SAASx3B,GAAUvI,UACnC,CAIA,QAAA8X,GACI,MAAMU,EAAO7e,KAAKie,IAAM,GAGxB,OAFAje,KAAKie,KAAOje,KAAKie,IAAM,EAAIje,KAAKge,KAAO,IAAMa,KAAU,EACvD7e,KAAKge,IAAMhe,KAAKge,IAAM,EAAIa,KAAU,EAC7B7e,IACX,CAIA,QAAAoe,GACI,MAAMS,IAAmB,EAAV7e,KAAKge,IAGpB,OAFAhe,KAAKge,KAAOhe,KAAKge,KAAO,EAAIhe,KAAKie,IAAM,IAAMY,KAAU,EACvD7e,KAAKie,IAAMje,KAAKie,KAAO,EAAIY,KAAU,EAC9B7e,IACX,CAIA,MAAAyB,GACI,MAAMqd,EAAQ9e,KAAKge,GACbe,GAAS/e,KAAKge,KAAO,GAAKhe,KAAKie,IAAM,KAAO,EAC5Ce,EAAQhf,KAAKie,KAAO,GAC1B,OAAiB,IAAVe,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,iBAAOqnB,CAAWrnC,GACd,GAAc,KAAVA,EACA,OAAOkf,EAEX,GAAIlf,EAAQgnC,GAA2BhnC,EAAQknC,EAC3C,OAAOlmC,KAAK6b,WAAWtR,OAAOvL,IAElC,MAAMsnC,EAAWtnC,EAAQ,GACrBsnC,IACAtnC,GAASA,GAEb,IAAIif,EAAKjf,GAAS,IACdgf,EAAKhf,GAASif,GAAM,KAWxB,OAVIqoB,IACAroB,EAAW,IAALA,EACND,EAAW,IAALA,IACAA,EAAKuoB,IACPvoB,EAAK,KACCC,EAAKsoB,IACPtoB,EAAK,MAIV,IAAIF,EAASxT,OAAOyT,GAAKzT,OAAO0T,GAC3C,CAIA,iBAAOpC,CAAW7c,GACd,GAAc,IAAVA,EACA,OAAOkf,EAEX,MAAMI,EAAOtf,EAAQ,EACjBsf,IACAtf,GAASA,GAEb,IAAIgf,EAAKhf,IAAU,EACfif,GAAMjf,EAAQgf,GAAM,aAAe,EAWvC,OAVIM,IACAL,GAAMA,IAAO,EACbD,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACCC,EAAK,aACPA,EAAK,KAIV,IAAIF,EAASC,EAAIC,EAC5B,CAIA,WAAOM,CAAKvf,GACR,MAAqB,iBAAVA,EACA+e,EAASlC,WAAW7c,GAEV,iBAAVA,EACA+e,EAASsoB,WAAWrnC,GAEV,iBAAVA,EACA+e,EAASsoB,WAAWJ,OAAOjnC,IAElB,MAAbA,EAAM0P,KAA6B,MAAd1P,EAAM2P,KAAe,IAAIoP,EAAS/e,EAAM0P,MAAQ,EAAG1P,EAAM2P,OAAS,GAAKuP,CACvG,EAEJ,MAAMA,EAAO,IAAIH,EAAS,EAAG,GAC7BG,EAAKkoB,SAAW,WAAc,OAAO,EAAI,EACzCloB,EAAKC,SAAWD,EAAKE,SAAW,WAAc,OAAOpe,IAAM,EAC3Dke,EAAKzc,OAAS,WAAc,OAAO,CAAG,EACtC,MAAM8kC,EAAS,YCxGR,SAAS72B,EAAMa,EAAQmC,EAAQxP,GAClC,MAAM8D,EAAQ9D,EACd,IAAI8S,EACAC,EACJ,IAAK,IAAI1U,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,EACjCyU,EAAKzF,EAAOlD,WAAW9L,GACnByU,EAAK,IACLtD,EAAOxP,KAAY8S,EAEdA,EAAK,MACVtD,EAAOxP,KAAY8S,GAAM,EAAI,IAC7BtD,EAAOxP,KAAiB,GAAL8S,EAAU,KAEN,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAK1F,EAAOlD,WAAW9L,EAAI,MAC9DyU,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtC1U,EACFmR,EAAOxP,KAAY8S,GAAM,GAAK,IAC9BtD,EAAOxP,KAAY8S,GAAM,GAAK,GAAK,IACnCtD,EAAOxP,KAAY8S,GAAM,EAAI,GAAK,IAClCtD,EAAOxP,KAAiB,GAAL8S,EAAU,MAG7BtD,EAAOxP,KAAY8S,GAAM,GAAK,IAC9BtD,EAAOxP,KAAY8S,GAAM,EAAI,GAAK,IAClCtD,EAAOxP,KAAiB,GAAL8S,EAAU,KAGrC,OAAO9S,EAAS8D,CACpB,CC3FA,SAASsvB,EAAgBhX,EAAQiX,GAC7B,OAAOC,WAAW,uBAAuBlX,EAAOxY,SAASyvB,GAAe,OAAOjX,EAAOld,MAC1F,CACA,SAASokC,EAAeh3B,EAAKvI,GACzB,OAAQuI,EAAIvI,EAAM,GACduI,EAAIvI,EAAM,IAAM,EAChBuI,EAAIvI,EAAM,IAAM,GAChBuI,EAAIvI,EAAM,IAAM,MAAQ,CAChC,CAIO,MAAMw/B,EACTj3B,IACA1I,IACA1E,IACAwd,OAAS3P,WAAWzQ,UAAUyiB,SAC9B,WAAA3S,CAAYoD,GAIR1S,KAAKwP,IAAMkD,EAIX1S,KAAK8G,IAAM,EAIX9G,KAAKoC,IAAMsQ,EAAOjR,MACtB,CAIA,MAAA4O,GACI,IAAIrR,EAAQ,WAEZ,GADAA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,QAAgB,EACnC9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,KAAO,EAClD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EACnD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EACnD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,GAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAc,MAAQ,EAClD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EACX,IAAKgB,KAAK8G,KAAO,GAAK9G,KAAKoC,IAEvB,MADApC,KAAK8G,IAAM9G,KAAKoC,IACVk0B,EAAgBt2B,KAAM,IAEhC,OAAOhB,CACX,CAIA,KAAAkjB,GACI,OAAuB,EAAhBliB,KAAKqQ,QAChB,CAIA,MAAA8R,GACI,MAAMnjB,EAAQgB,KAAKqQ,SACnB,OAAOrR,IAAU,IAAc,EAARA,EAC3B,CAIA,IAAAujB,GACI,OAAyB,IAAlBviB,KAAKqQ,QAChB,CAIA,OAAAmS,GACI,GAAIxiB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAGhC,OADYwmC,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,EAErD,CAIA,QAAA2b,GACI,GAAIziB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAGhC,OADsD,EAA1CwmC,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,EAErD,CAIA,KAAA8b,GACI,GAAI5iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,MAAMhB,GHnFcwQ,EGmFMxP,KAAKwP,IHnFN1I,EGmFW9G,KAAK8G,IHlF7Cs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZq5B,EAAI,IALR,IAAqB3wB,EAAK1I,EGqFzB,OADA9G,KAAK8G,KAAO,EACL9H,CACX,CAIA,MAAA8jB,GAEI,GAAI9iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,MAAMhB,GH7CewQ,EG6CMxP,KAAKwP,IH7CN1I,EG6CW9G,KAAK8G,IH5C9Ci/B,EAAI,GAAKv2B,EAAI1I,GACbi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACZ46B,EAAI,IATR,IAAsBlyB,EAAK1I,EG+C1B,OADA9G,KAAK8G,KAAO,EACL9H,CACX,CAIA,KAAA8P,GACI,MAAMrN,EAASzB,KAAKqQ,SACdrJ,EAAQhH,KAAK8G,IACbG,EAAMjH,KAAK8G,IAAMrF,EAEvB,GAAIwF,EAAMjH,KAAKoC,IACX,MAAMk0B,EAAgBt2B,KAAMyB,GAGhC,OADAzB,KAAK8G,KAAOrF,EACLuF,IAAUC,EACX,IAAIgJ,WAAW,GACfjQ,KAAKwP,IAAIyS,SAASjb,EAAOC,EACnC,CAIA,MAAAsJ,GACI,MAAMzB,EAAQ9O,KAAK8O,QACnB,ODtHD,SAAc4D,EAAQ1L,EAAOC,GAEhC,GADYA,EAAMD,EACR,EACN,MAAO,GAEX,IAAIoW,EACJ,MAAMC,EAAQ,GACd,IACIF,EADA5b,EAAI,EAER,KAAOyF,EAAQC,GACXkW,EAAIzK,EAAO1L,KACPmW,EAAI,IACJE,EAAM9b,KAAO4b,EAERA,EAAI,KAAOA,EAAI,IACpBE,EAAM9b,MAAY,GAAJ4b,IAAW,EAAsB,GAAlBzK,EAAO1L,KAE/BmW,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlBzK,EAAO1L,OAAkB,IAAwB,GAAlB0L,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,MAAiB,MAC1GqW,EAAM9b,KAAO,OAAU4b,GAAK,IAC5BE,EAAM9b,KAAO,OAAc,KAAJ4b,IAGvBE,EAAM9b,MAAY,GAAJ4b,IAAW,IAAwB,GAAlBzK,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,KAEnEzF,EAAI,QACH6b,IAAUA,EAAQ,KAAK5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,IAC/D9b,EAAI,GAGZ,OAAa,MAAT6b,GACI7b,EAAI,GACJ6b,EAAM5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,KAEzD6b,EAAMvV,KAAK,KAEfmH,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,GAC5D,CCiFe,CAAUuN,EAAO,EAAGA,EAAMrN,OACrC,CAIA,IAAA6H,CAAK7H,GACD,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIzB,KAAK8G,IAAMrF,EAASzB,KAAKoC,IACzB,MAAMk0B,EAAgBt2B,KAAMyB,GAEhCzB,KAAK8G,KAAOrF,CAChB,MAEI,GAEI,GAAIzB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,YAEG,IAAvBA,KAAKwP,IAAIxP,KAAK8G,QAE5B,OAAO9G,IACX,CAIA,QAAAi3B,CAASxmB,GACL,OAAQA,GACJ,KAAK,EACDzQ,KAAKsJ,OACL,MACJ,KAAK,EACDtJ,KAAKsJ,KAAK,GACV,MACJ,KAAK,EACDtJ,KAAKsJ,KAAKtJ,KAAKqQ,UACf,MACJ,KAAK,EACD,KAA0C,IAAlCI,EAA2B,EAAhBzQ,KAAKqQ,WACpBrQ,KAAKi3B,SAASxmB,GAElB,MACJ,KAAK,EACDzQ,KAAKsJ,KAAK,GACV,MAEJ,QACI,MAAM9K,MAAM,qBAAqBiS,eAAsBzQ,KAAK8G,OAEpE,OAAO9G,IACX,CACA,cAAA22B,GAEI,MAAM1jB,EAAO,IAAI8K,EAAS,EAAG,GAC7B,IAAIxc,EAAI,EACR,KAAIvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GAgBrB,CACD,KAAOvF,EAAI,IAAKA,EAAG,CAEf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAI1B,GADAiT,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CAEf,CAGA,OADAA,EAAK+K,IAAM/K,EAAK+K,IAA6B,IAAvBhe,KAAKwP,IAAIxP,KAAK8G,SAAqB,EAAJvF,KAAW,EACzD0R,CACX,CA9BI,KAAO1R,EAAI,IAAKA,EAGZ,GADA0R,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAMf,GAFAA,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAC3DmM,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAe,KAAO,EACtD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAoBf,GAlBI1R,EAAI,EAkBJvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GACtB,KAAOvF,EAAI,IAAKA,EAGZ,GADA0R,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,OAKf,KAAO1R,EAAI,IAAKA,EAAG,CACf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAI1B,GADAiT,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CAEf,CAEJ,MAAMzU,MAAM,0BAChB,CACA,WAAAq4B,GACI,GAAI72B,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,MAAMge,EAAKwoB,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,GAC1CmX,EAAKuoB,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,GAChD,OAAO,IAAIiX,EAASC,EAAIC,EAC5B,CAIA,KAAAoE,GACI,OAAOriB,KAAK22B,iBAAiByP,UACjC,CAKA,WAAAM,GACI,OAAO1mC,KAAK22B,iBAAiB9nB,UACjC,CAIA,WAAA83B,GACI,OAAO3mC,KAAK22B,iBAAiBtwB,UACjC,CAIA,MAAA+b,GACI,OAAOpiB,KAAK22B,iBAAiByP,UAAS,EAC1C,CAKA,YAAAQ,GACI,MAAM5nC,EAAQ2mC,EAAiB3lC,KAAKwP,IAAKxP,KAAK8G,KAE9C,OADA9G,KAAK8G,KAAO0+B,EAAexmC,GACpBA,CACX,CAIA,YAAA6nC,GACI,OAAO7mC,KAAK22B,iBAAiBtwB,UAAS,EAC1C,CAIA,MAAAic,GACI,OAAOtiB,KAAK22B,iBAAiBvY,WAAWgoB,UAC5C,CAKA,YAAAU,GACI,OAAO9mC,KAAK22B,iBAAiBvY,WAAWvP,UAC5C,CAKA,YAAAk4B,GACI,OAAO/mC,KAAK22B,iBAAiBvY,WAAW/X,UAC5C,CAIA,OAAAqc,GACI,OAAO1iB,KAAK62B,cAAcuP,UAC9B,CAIA,aAAAY,GACI,OAAOhnC,KAAK62B,cAAchoB,UAC9B,CAIA,aAAAo4B,GACI,OAAOjnC,KAAK62B,cAAcxwB,UAC9B,CAIA,QAAAsc,GACI,OAAO3iB,KAAK62B,cAAcuP,UAC9B,CAKA,cAAAc,GACI,OAAOlnC,KAAK62B,cAAchoB,UAC9B,CAIA,cAAAs4B,GACI,OAAOnnC,KAAK62B,cAAcxwB,UAC9B,ECtWG,SAAS+gC,EAAc53B,EAAK63B,EAAOvK,GACtC,MAAMxd,EDuWH,SAAsB9P,GACzB,OAAO,IAAIi3B,EAAiBj3B,aAAeS,WAAaT,EAAMA,EAAIyS,WACtE,CCzWmBqlB,CAAa93B,GAC5B,OAAO63B,EAAMrrB,OAAOsD,OAAQpgB,EAAW49B,EAC3C,CCiBO,SAASnyB,EAAOxH,GACnB,GAAIA,aAAa8M,YAAqC,eAAvB9M,EAAEmM,YAAYvO,KACzC,OAAOoC,EACX,GAAIA,aAAa0O,YACb,OAAO,IAAI5B,WAAW9M,GAC1B,GAAI0O,YAAYW,OAAOrP,GACnB,OAAO,IAAI8M,WAAW9M,EAAEuP,OAAQvP,EAAEokC,WAAYpkC,EAAEqN,YAEpD,MAAM,IAAIhS,MAAM,oCACpB,CA9BqB,IAAIyR,WAAW,GCwKpC,QA9JA,SAAcu3B,EAAUzmC,GACpB,GAAIymC,EAAS/lC,QAAU,IACnB,MAAM,IAAIrB,UAAU,qBAGxB,IADA,IAAIqnC,EAAW,IAAIx3B,WAAW,KACrBzN,EAAI,EAAGA,EAAIilC,EAAShmC,OAAQe,IACjCilC,EAASjlC,GAAK,IAElB,IAAK,IAAIjB,EAAI,EAAGA,EAAIimC,EAAS/lC,OAAQF,IAAK,CACtC,IAAI4T,EAAIqyB,EAAS3gC,OAAOtF,GACpBmmC,EAAKvyB,EAAE9H,WAAW,GACtB,GAAqB,MAAjBo6B,EAASC,GACT,MAAM,IAAItnC,UAAU+U,EAAI,iBAE5BsyB,EAASC,GAAMnmC,CACnB,CACA,IAAIomC,EAAOH,EAAS/lC,OAChBmmC,EAASJ,EAAS3gC,OAAO,GACzBghC,EAAS5+B,KAAKmC,IAAIu8B,GAAQ1+B,KAAKmC,IAAI,KACnC08B,EAAU7+B,KAAKmC,IAAI,KAAOnC,KAAKmC,IAAIu8B,GA+DvC,SAASI,EAAa5hC,GAClB,GAAsB,iBAAXA,EACP,MAAM,IAAI/F,UAAU,mBAExB,GAAsB,IAAlB+F,EAAO1E,OACP,OAAO,IAAIwO,WAEf,IAAI+3B,EAAM,EAEV,GAAoB,MAAhB7hC,EAAO6hC,GAAX,CAMA,IAFA,IAAIC,EAAS,EACTxmC,EAAS,EACN0E,EAAO6hC,KAASJ,GACnBK,IACAD,IAMJ,IAHA,IAAIvpC,GAAU0H,EAAO1E,OAASumC,GAAOH,EAAU,IAAO,EAClDK,EAAO,IAAIj4B,WAAWxR,GAEnB0H,EAAO6hC,IAAM,CAEhB,IAAIG,EAAQV,EAASthC,EAAOkH,WAAW26B,IAEvC,GAAc,MAAVG,EACA,OAGJ,IADA,IAAI5mC,EAAI,EACC6mC,EAAM3pC,EAAO,GAAc,IAAV0pC,GAAe5mC,EAAIE,KAAqB,IAAT2mC,EAAaA,IAAO7mC,IACzE4mC,GAAUR,EAAOO,EAAKE,KAAU,EAChCF,EAAKE,GAAQD,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE9B,GAAc,IAAVA,EACA,MAAM,IAAI3pC,MAAM,kBAEpBiD,EAASF,EACTymC,GACJ,CAEA,GAAoB,MAAhB7hC,EAAO6hC,GAAX,CAKA,IADA,IAAIK,EAAM5pC,EAAOgD,EACV4mC,IAAQ5pC,GAAsB,IAAdypC,EAAKG,IACxBA,IAIJ,IAFA,IAAIC,EAAM,IAAIr4B,WAAWg4B,GAAUxpC,EAAO4pC,IACtC7lC,EAAIylC,EACDI,IAAQ5pC,GACX6pC,EAAI9lC,KAAO0lC,EAAKG,KAEpB,OAAOC,CAXP,CAlCA,CA8CJ,CAWA,MAAO,CACHpzB,OAhIJ,SAAgB/O,GAUZ,GARIA,aAAkB8J,aAEb4B,YAAYW,OAAOrM,GACxBA,EAAS,IAAI8J,WAAW9J,EAAOuM,OAAQvM,EAAOohC,WAAYphC,EAAOqK,YAE5D7O,MAAM2Q,QAAQnM,KACnBA,EAAS8J,WAAWsO,KAAKpY,OAEvBA,aAAkB8J,YACpB,MAAM,IAAI7P,UAAU,uBAExB,GAAsB,IAAlB+F,EAAO1E,OACP,MAAO,GAOX,IAJA,IAAIwmC,EAAS,EACTxmC,EAAS,EACT8mC,EAAS,EACTC,EAAOriC,EAAO1E,OACX8mC,IAAWC,GAA2B,IAAnBriC,EAAOoiC,IAC7BA,IACAN,IAMJ,IAHA,IAAIxpC,GAAS+pC,EAAOD,GAAUT,EAAU,IAAO,EAC3CW,EAAM,IAAIx4B,WAAWxR,GAElB8pC,IAAWC,GAAM,CAIpB,IAHA,IAAIL,EAAQhiC,EAAOoiC,GAEfhnC,EAAI,EACCmnC,EAAMjqC,EAAO,GAAc,IAAV0pC,GAAe5mC,EAAIE,KAAqB,IAATinC,EAAaA,IAAOnnC,IACzE4mC,GAAU,IAAMM,EAAIC,KAAU,EAC9BD,EAAIC,GAAQP,EAAQR,IAAU,EAC9BQ,EAASA,EAAQR,IAAU,EAE/B,GAAc,IAAVQ,EACA,MAAM,IAAI3pC,MAAM,kBAEpBiD,EAASF,EACTgnC,GACJ,CAGA,IADA,IAAII,EAAMlqC,EAAOgD,EACVknC,IAAQlqC,GAAqB,IAAbgqC,EAAIE,IACvBA,IAIJ,IADA,IAAI5iC,EAAM6hC,EAAOh/B,OAAOq/B,GACjBU,EAAMlqC,IAAQkqC,EACjB5iC,GAAOyhC,EAAS3gC,OAAO4hC,EAAIE,IAE/B,OAAO5iC,CACX,EA0EIgiC,aAAcA,EACd/rB,OAVJ,SAAgBzL,GACZ,IAAImC,EAASq1B,EAAax3B,GAC1B,GAAImC,EACA,OAAOA,EAEX,MAAM,IAAIlU,MAAM,OAAOuC,cAC3B,EAMJ,EC9JA,MAAM6nC,EACF7nC,KACArB,OACAmpC,WACA,WAAAv5B,CAAYvO,EAAMrB,EAAQmpC,GACtB7oC,KAAKe,KAAOA,EACZf,KAAKN,OAASA,EACdM,KAAK6oC,WAAaA,CACtB,CACA,MAAA3zB,CAAOpG,GACH,GAAIA,aAAiBmB,WACjB,MAAO,GAAGjQ,KAAKN,SAASM,KAAK6oC,WAAW/5B,KAGxC,MAAMtQ,MAAM,oCAEpB,EAOJ,MAAMsqC,EACF/nC,KACArB,OACAqpC,WACAC,gBACA,WAAA15B,CAAYvO,EAAMrB,EAAQqpC,GACtB/oC,KAAKe,KAAOA,EACZf,KAAKN,OAASA,EACd,MAAMspC,EAAkBtpC,EAAOupC,YAAY,GAE3C,QAAwB/pC,IAApB8pC,EACA,MAAM,IAAIxqC,MAAM,4BAEpBwB,KAAKgpC,gBAAkBA,EACvBhpC,KAAK+oC,WAAaA,CACtB,CACA,MAAA/sB,CAAOpU,GACH,GAAoB,iBAATA,EAAmB,CAC1B,GAAIA,EAAKqhC,YAAY,KAAOjpC,KAAKgpC,gBAC7B,MAAMxqC,MAAM,qCAAqC6mB,KAAKE,UAAU3d,OAAU5H,KAAKe,mDAAmDf,KAAKN,UAE3I,OAAOM,KAAK+oC,WAAWnhC,EAAK1G,MAAMlB,KAAKN,OAAO+B,QAClD,CAEI,MAAMjD,MAAM,oCAEpB,CACA,EAAA0qC,CAAGtY,GACC,OAAOsY,EAAGlpC,KAAM4wB,EACpB,EAEJ,MAAMuY,EACFC,SACA,WAAA95B,CAAY85B,GACRppC,KAAKopC,SAAWA,CACpB,CACA,EAAAF,CAAGtY,GACC,OAAOsY,EAAGlpC,KAAM4wB,EACpB,CACA,MAAA5U,CAAO+Z,GACH,MAAMr2B,EAASq2B,EAAM,GACfnF,EAAU5wB,KAAKopC,SAAS1pC,GAC9B,GAAe,MAAXkxB,EACA,OAAOA,EAAQ5U,OAAO+Z,GAGtB,MAAMS,WAAW,qCAAqCnR,KAAKE,UAAUwQ,iCAAqCp3B,OAAOuG,KAAKlF,KAAKopC,0BAEnI,EAEG,SAASF,EAAGG,EAAMj0B,GAErB,OAAO,IAAI+zB,EAAgB,IACnBE,EAAKD,UAAY,CAAE,CAACC,EAAK3pC,QAAS2pC,MAClCj0B,EAAMg0B,UAAY,CAAE,CAACh0B,EAAM1V,QAAS0V,IAEhD,CACO,MAAMk0B,EACTvoC,KACArB,OACAmpC,WACAE,WACApY,QACAC,QACA,WAAAthB,CAAYvO,EAAMrB,EAAQmpC,EAAYE,GAClC/oC,KAAKe,KAAOA,EACZf,KAAKN,OAASA,EACdM,KAAK6oC,WAAaA,EAClB7oC,KAAK+oC,WAAaA,EAClB/oC,KAAK2wB,QAAU,IAAIiY,EAAQ7nC,EAAMrB,EAAQmpC,GACzC7oC,KAAK4wB,QAAU,IAAIkY,EAAQ/nC,EAAMrB,EAAQqpC,EAC7C,CACA,MAAA7zB,CAAO6gB,GACH,OAAO/1B,KAAK2wB,QAAQzb,OAAO6gB,EAC/B,CACA,MAAA/Z,CAAO+Z,GACH,OAAO/1B,KAAK4wB,QAAQ5U,OAAO+Z,EAC/B,EAEG,SAASxX,GAAK,KAAExd,EAAI,OAAErB,EAAM,OAAEwV,EAAM,OAAE8G,IACzC,OAAO,IAAIstB,EAAMvoC,EAAMrB,EAAQwV,EAAQ8G,EAC3C,CACO,SAASutB,IAAM,KAAExoC,EAAI,OAAErB,EAAM,SAAE8pC,IAClC,MAAM,OAAEt0B,EAAM,OAAE8G,GAAW,EAAMwtB,EAAUzoC,GAC3C,OAAOwd,EAAK,CACR7e,SACAqB,OACAmU,SACA8G,OAASpU,GAAS+C,EAAOqR,EAAOpU,KAExC,CAsEO,SAAS6hC,IAAQ,KAAE1oC,EAAI,OAAErB,EAAM,YAAEgqC,EAAW,SAAEF,IACjD,OAAOjrB,EAAK,CACR7e,SACAqB,OACAmU,OAAO6gB,GAnCf,SAAgB4T,EAAMH,EAAUE,GAC5B,MAAME,EAAwC,MAAlCJ,EAASA,EAAS/nC,OAAS,GACjCod,GAAQ,GAAK6qB,GAAe,EAClC,IAAIG,EAAM,GACN52B,EAAO,EACPP,EAAS,EACb,IAAK,IAAInR,EAAI,EAAGA,EAAIooC,EAAKloC,SAAUF,EAK/B,IAHAmR,EAAUA,GAAU,EAAKi3B,EAAKpoC,GAC9B0R,GAAQ,EAEDA,EAAOy2B,GACVz2B,GAAQy2B,EACRG,GAAOL,EAAS3qB,EAAQnM,GAAUO,GAQ1C,GAJa,IAATA,IACA42B,GAAOL,EAAS3qB,EAAQnM,GAAWg3B,EAAcz2B,IAGjD22B,EACA,KAASC,EAAIpoC,OAASioC,EAAe,GACjCG,GAAO,IAGf,OAAOA,CACX,CASmB,CAAO9T,EAAOyT,EAAUE,GAEnC1tB,OAAO+Z,GA5Ef,SAAgBxlB,EAAQi5B,EAAUE,EAAa3oC,GAE3C,MAAM+oC,EAAQ,CAAC,EACf,IAAK,IAAIvoC,EAAI,EAAGA,EAAIioC,EAAS/nC,SAAUF,EACnCuoC,EAAMN,EAASjoC,IAAMA,EAGzB,IAAI0F,EAAMsJ,EAAO9O,OACjB,KAA2B,MAApB8O,EAAOtJ,EAAM,MACdA,EAGN,MAAM4iC,EAAM,IAAI55B,WAAYhJ,EAAMyiC,EAAc,EAAK,GAErD,IAAIz2B,EAAO,EACPP,EAAS,EACTq3B,EAAU,EACd,IAAK,IAAIxoC,EAAI,EAAGA,EAAI0F,IAAO1F,EAAG,CAE1B,MAAMvC,EAAQ8qC,EAAMv5B,EAAOhP,IAC3B,QAAcrC,IAAVF,EACA,MAAM,IAAIgrC,YAAY,OAAOjpC,eAGjC2R,EAAUA,GAAUg3B,EAAe1qC,EACnCiU,GAAQy2B,EAEJz2B,GAAQ,IACRA,GAAQ,EACR42B,EAAIE,KAAa,IAAQr3B,GAAUO,EAE3C,CAEA,GAAIA,GAAQy2B,GAAgB,IAAQh3B,GAAW,EAAIO,EAC/C,MAAM,IAAI+2B,YAAY,0BAE1B,OAAOH,CACX,CAwCmB,CAAO9T,EAAOyT,EAAUE,EAAa3oC,IAGxD,CCxMO,MAAMkpC,GAASV,GAAM,CACxB7pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,eCHDU,GAAST,GAAQ,CAC1B/pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,mBACVE,YAAa,IAEJS,GAAcV,GAAQ,CAC/B/pC,OAAQ,IACRqB,KAAM,cACNyoC,SAAU,mBACVE,YAAa,ICVJU,GAAQX,GAAQ,CACzB/pC,OAAQ,IACRqB,KAAM,QACNyoC,SAAU,KACVE,YAAa,ICJXF,GAAW7nC,MAAM4c,KAAK,0eACtB8rB,GAAwBb,GAASc,QAAO,CAAC5L,EAAGv3B,EAAG5F,KAAQm9B,EAAEn9B,GAAK4F,EAAUu3B,IAAM,IAC9E6L,GAAwBf,GAASc,QAAO,CAAC5L,EAAGv3B,EAAG5F,KACjD,MAAMipC,EAAYrjC,EAAE8hC,YAAY,GAChC,GAAiB,MAAbuB,EACA,MAAM,IAAIhsC,MAAM,sBAAsB2I,KAG1C,OADAu3B,EAAE8L,GAAajpC,EACRm9B,CAAC,GACT,IAsBU+L,GAAelsB,EAAK,CAC7B7e,OAAQ,KACRqB,KAAM,eACNmU,OAxBJ,SAAgBy0B,GACZ,OAAOA,EAAKW,QAAO,CAAC5L,EAAGv3B,IACnBu3B,EAAK2L,GAAqBljC,IAE3B,GACP,EAoBI6U,OAnBJ,SAAgBjW,GACZ,MAAM2kC,EAAO,GACb,IAAK,MAAMC,KAAQ5kC,EAAK,CACpB,MAAMykC,EAAYG,EAAK1B,YAAY,GACnC,GAAiB,MAAbuB,EACA,MAAM,IAAIhsC,MAAM,sBAAsBmsC,KAE1C,MAAMC,EAAML,GAAqBC,GACjC,GAAW,MAAPI,EACA,MAAM,IAAIpsC,MAAM,+BAA+BmsC,KAEnDD,EAAKlqC,KAAKoqC,EACd,CACA,OAAO,IAAI36B,WAAWy6B,EAC1B,IC9BarU,GAASoT,GAAQ,CAC1B/pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,mCACVE,YAAa,IAEJmB,GAAcpB,GAAQ,CAC/B/pC,OAAQ,IACRqB,KAAM,cACNyoC,SAAU,mCACVE,YAAa,IAEJoB,GAAYrB,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,oCACVE,YAAa,IAEJqB,GAAiBtB,GAAQ,CAClC/pC,OAAQ,IACRqB,KAAM,iBACNyoC,SAAU,oCACVE,YAAa,IAEJsB,GAAYvB,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,mCACVE,YAAa,IAEJuB,GAAiBxB,GAAQ,CAClC/pC,OAAQ,IACRqB,KAAM,iBACNyoC,SAAU,mCACVE,YAAa,IAEJwB,GAAezB,GAAQ,CAChC/pC,OAAQ,IACRqB,KAAM,eACNyoC,SAAU,oCACVE,YAAa,IAEJyB,GAAoB1B,GAAQ,CACrC/pC,OAAQ,IACRqB,KAAM,oBACNyoC,SAAU,oCACVE,YAAa,IAEJ0B,GAAU3B,GAAQ,CAC3B/pC,OAAQ,IACRqB,KAAM,UACNyoC,SAAU,mCACVE,YAAa,ICpDJ2B,GAAS9B,GAAM,CACxB7pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,yCAED8B,GAAc/B,GAAM,CAC7B7pC,OAAQ,IACRqB,KAAM,cACNyoC,SAAU,yCCRD+B,GAAYhC,GAAM,CAC3BxoC,KAAM,YACNrB,OAAQ,IACR8pC,SAAU,+DAEDgC,GAAejC,GAAM,CAC9BxoC,KAAM,eACNrB,OAAQ,IACR8pC,SAAU,+DCRDztB,GAAS0tB,GAAQ,CAC1B/pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,mEACVE,YAAa,IAEJ+B,GAAYhC,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,oEACVE,YAAa,IAEJgC,GAAYjC,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,mEACVE,YAAa,IAEJiC,GAAelC,GAAQ,CAChC/pC,OAAQ,IACRqB,KAAM,eACNyoC,SAAU,oEACVE,YAAa,ICtBJkC,GAAQnC,GAAQ,CACzB/pC,OAAQ,IACRqB,KAAM,QACNyoC,SAAU,WACVE,YAAa,ICHJmC,GAAWttB,EAAK,CACzB7e,OAAQ,KACRqB,KAAM,WACNmU,OAAS1F,IAAQ,OZgCIoR,EYhCKpR,GZiCnB,IAAIs8B,aAAc9vB,OAAO4E,GAD7B,IAAkBA,CYhCS,EAC9B5E,OAASjW,GZ4BN,SAAoBA,GACvB,OAAO,IAAIgmC,aAAc72B,OAAOnP,EACpC,CY9BqB0Y,CAAW1Y,KCN1BimC,GAAc,IAAID,YAClBE,GAAc,IAAIH,YACX,GAAO,OACP/2B,GAAO,IACb,SAAS,GAAOzD,GACnB,OAAO06B,GAAY92B,OAAOmQ,KAAKE,UAAUjU,GAC7C,CACO,SAAS,GAAOq4B,GACnB,OAAOtkB,KAAKC,MAAM2mB,GAAYjwB,OAAO2tB,GACzC,CCRO,MAAM,GAAO,MACP,GAAO,GACb,SAAS,GAAOr4B,GACnB,OAAO3G,EAAO2G,EAClB,CACO,SAAS,GAAOq4B,GACnB,OAAOh/B,EAAOg/B,EAClB,CCPA,IACI,GAAM,IAAmBuC,IAAS,IAAOC,GAAMljC,KAAK0qB,IAAI,EAAG,IAwB3DyY,GAAQ,IAAMC,GAAS,IAuBvB,GAAKpjC,KAAK0qB,IAAI,EAAG,GACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB2Y,GAAKrjC,KAAK0qB,IAAI,EAAG,IACjB4Y,GAAKtjC,KAAK0qB,IAAI,EAAG,IAmBrB,SANa,CACTze,OA/DJ,SAAS,EAAOs3B,EAAK3C,EAAK3mC,GACtB2mC,EAAMA,GAAO,GAGb,IADA,IAAI4C,EADJvpC,EAASA,GAAU,EAEZspC,GAAOL,IACVtC,EAAI3mC,KAAmB,IAANspC,EAAc,GAC/BA,GAAO,IAEX,KAAOA,EAAMN,IACTrC,EAAI3mC,KAAmB,IAANspC,EAAc,GAC/BA,KAAS,EAKb,OAHA3C,EAAI3mC,GAAgB,EAANspC,EAEd,EAAO19B,MAAQ5L,EAASupC,EAAY,EAC7B5C,CACX,EAgDI7tB,OAzCJ,SAAS,EAAKxM,EAAKtM,GACf,IAAgE0d,EAA5DglB,EAAM,EAAyBt9B,EAAQ,EAAGokC,EAAjCxpC,EAASA,GAAU,EAAmC1B,EAAIgO,EAAI/N,OAC3E,EAAG,CACC,GAAIirC,GAAWlrC,EAGX,MADA,EAAKsN,MAAQ,EACP,IAAI0nB,WAAW,2BAEzB5V,EAAIpR,EAAIk9B,KACR9G,GAAOt9B,EAAQ,IACRsY,EAAIyrB,KAAW/jC,GACfsY,EAAIyrB,IAAUpjC,KAAK0qB,IAAI,EAAGrrB,GACjCA,GAAS,CACb,OAASsY,GAAKwrB,IAGd,OADA,EAAKt9B,MAAQ49B,EAAUxpC,EAChB0iC,CACX,EAyBIJ,eAfS,SAAgCxmC,GACzC,OAAQA,EAAQ,GAAK,EACfA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQstC,GAAK,EACTttC,EAAQutC,GAAK,EACT,EAC1C,GCpEO,SAAS,GAAO5C,EAAMzmC,EAAS,GAElC,MAAO,CADM,GAAO8Y,OAAO2tB,EAAMzmC,GACnB,GAAO8Y,OAAOlN,MAChC,CACO,SAAS69B,GAASC,EAAK1iB,EAAQhnB,EAAS,GAE3C,OADA,GAAOgS,OAAO03B,EAAK1iB,EAAQhnB,GACpBgnB,CACX,CACO,SAAS,GAAe0iB,GAC3B,OAAO,GAAOpH,eAAeoH,EACjC,CCNO,SAAS,GAAO73B,EAAMc,GACzB,MAAMpX,EAAOoX,EAAOrF,WACdq8B,EAAa,GAAsB93B,GACnC+3B,EAAeD,EAAa,GAAsBpuC,GAClDqQ,EAAQ,IAAImB,WAAW68B,EAAeruC,GAI5C,OAHA,GAAgBsW,EAAMjG,EAAO,GAC7B,GAAgBrQ,EAAMqQ,EAAO+9B,GAC7B/9B,EAAMxP,IAAIuW,EAAQi3B,GACX,IAAIC,GAAOh4B,EAAMtW,EAAMoX,EAAQ/G,EAC1C,CAIO,SAAS,GAAOk+B,GACnB,MAAMl+B,EAAQnE,EAAOqiC,IACdj4B,EAAM83B,GAAc,GAAc/9B,IAClCrQ,EAAMquC,GAAgB,GAAch+B,EAAMmT,SAAS4qB,IACpDh3B,EAAS/G,EAAMmT,SAAS4qB,EAAaC,GAC3C,GAAIj3B,EAAOrF,aAAe/R,EACtB,MAAM,IAAID,MAAM,oBAEpB,OAAO,IAAIuuC,GAAOh4B,EAAMtW,EAAMoX,EAAQ/G,EAC1C,CAiBO,MAAMi+B,GACTh4B,KACAtW,KACAoX,OACA/G,MAIA,WAAAQ,CAAYyF,EAAMtW,EAAMoX,EAAQ/G,GAC5B9O,KAAK+U,KAAOA,EACZ/U,KAAKvB,KAAOA,EACZuB,KAAK6V,OAASA,EACd7V,KAAK8O,MAAQA,CACjB,ECvDJ,MAEM,GAASnE,EAIF,GAAW,CAAEoK,KANb,EAMiB,KALjB,WAKuB,OAAQ,UAH5C,SAAgBghB,GACZ,OAAO,GAJE,EAIkB,GAAOA,GACtC,GCNO,SAAS,IAAK,KAAEh1B,EAAI,KAAEgU,EAAI,OAAEG,IAC/B,OAAO,IAAI+3B,GAAOlsC,EAAMgU,EAAMG,EAClC,CAKO,MAAM+3B,GACTlsC,KACAgU,KACAG,OACA,WAAA5F,CAAYvO,EAAMgU,EAAMG,GACpBlV,KAAKe,KAAOA,EACZf,KAAK+U,KAAOA,EACZ/U,KAAKkV,OAASA,CAClB,CACA,MAAAW,CAAOkgB,GACH,GAAIA,aAAiB9lB,WAAY,CAC7B,MAAM6E,EAAS9U,KAAKkV,OAAO6gB,GAC3B,OAAOjhB,aAAkB7E,WACnB,GAAcjQ,KAAK+U,KAAMD,GAEzBA,EAAOyuB,MAAK1tB,GAAU,GAAc7V,KAAK+U,KAAMc,IACzD,CAEI,MAAMrX,MAAM,oCAGpB,EC3BJ,SAAS0uC,GAAInsC,GACT,OAAOosC,MAAOxD,GAAS,IAAI15B,iBAAiBm9B,OAAOC,OAAOx3B,OAAO9U,EAAM4oC,GAC3E,CACO,MAAM,GAAS,GAAK,CACvB5oC,KAAM,WACNgU,KAAM,GACNG,OAAQg4B,GAAI,aAEH,GAAS,GAAK,CACvBnsC,KAAM,WACNgU,KAAM,GACNG,OAAQg4B,GAAI,aCLT,SAASpiC,GAAOwiC,EAAMla,GACzB,MAAM,MAAEtkB,EAAK,QAAEy+B,GAAYD,EAC3B,OACS,IADDC,EAyUZ,SAAoBz+B,EAAOpQ,EAAO00B,GAC9B,MAAM,OAAE1zB,GAAW0zB,EACnB,GAAI1zB,IAAW6rC,GAAU7rC,OACrB,MAAMlB,MAAM,8BAA8B40B,EAAKryB,iBAEnD,MAAMysC,EAAM9uC,EAAMU,IAAIM,GACtB,GAAW,MAAP8tC,EAAa,CACb,MAAMA,EAAMpa,EAAKle,OAAOpG,GAAO5N,MAAM,GAErC,OADAxC,EAAMY,IAAII,EAAQ8tC,GACXA,CACX,CAEI,OAAOA,CAEf,CArVmBC,CAAW3+B,EAAO4+B,GAAUJ,GAAOla,GAAQmY,GAAU5a,SAsVxE,SAAoB7hB,EAAOpQ,EAAO00B,GAC9B,MAAM,OAAE1zB,GAAW0zB,EACboa,EAAM9uC,EAAMU,IAAIM,GACtB,GAAW,MAAP8tC,EAAa,CACb,MAAMA,EAAMpa,EAAKle,OAAOpG,GAExB,OADApQ,EAAMY,IAAII,EAAQ8tC,GACXA,CACX,CAEI,OAAOA,CAEf,CA/VmBG,CAAW7+B,EAAO4+B,GAAUJ,GAAQla,GAAQiD,GAAO1F,QAEtE,CASA,MAAMjyB,GAAQ,IAAIkvC,QAClB,SAASF,GAAUF,GACf,MAAME,EAAYhvC,GAAMU,IAAIouC,GAC5B,GAAiB,MAAbE,EAAmB,CACnB,MAAMA,EAAY,IAAIG,IAEtB,OADAnvC,GAAMY,IAAIkuC,EAAKE,GACRA,CACX,CACA,OAAOA,CACX,CACO,MAAMI,GACT/4B,KACAw4B,QACAP,UACAl+B,MACA,IAMA,WAAAQ,CAAYi+B,EAASx4B,EAAMi4B,EAAWl+B,GAClC9O,KAAK+U,KAAOA,EACZ/U,KAAKutC,QAAUA,EACfvtC,KAAKgtC,UAAYA,EACjBhtC,KAAK8O,MAAQA,EAGb9O,KAAK,KAAO8O,CAChB,CAOA,SAAIi/B,GACA,OAAO/tC,IACX,CAEA,cAAIunC,GACA,OAAOvnC,KAAK8O,MAAMy4B,UACtB,CAEA,cAAI/2B,GACA,OAAOxQ,KAAK8O,MAAM0B,UACtB,CACA,IAAAw9B,GACI,OAAQhuC,KAAKutC,SACT,KAAK,EACD,OAAOvtC,KAEX,KAAK,EAAG,CACJ,MAAM,KAAE+U,EAAI,UAAEi4B,GAAchtC,KAC5B,GAAI+U,IAASk5B,GACT,MAAM,IAAIzvC,MAAM,4CAGpB,GAAIwuC,EAAUj4B,OAASm5B,GACnB,MAAM,IAAI1vC,MAAM,sDAEpB,OAAQsvC,GAAIK,SAASnB,EACzB,CACA,QACI,MAAMxuC,MAAM,+BAA+BwB,KAAKutC,qDAG5D,CACA,IAAAa,GACI,OAAQpuC,KAAKutC,SACT,KAAK,EAAG,CACJ,MAAM,KAAEx4B,EAAI,OAAEc,GAAW7V,KAAKgtC,UACxBA,EAAY,GAAcj4B,EAAMc,GACtC,OAAQi4B,GAAIO,SAASruC,KAAK+U,KAAMi4B,EACpC,CACA,KAAK,EACD,OAAOhtC,KAEX,QACI,MAAMxB,MAAM,+BAA+BwB,KAAKutC,qDAG5D,CACA,MAAAe,CAAOC,GACH,OAAOT,GAAIQ,OAAOtuC,KAAMuuC,EAC5B,CACA,aAAOD,CAAOhkC,EAAMikC,GAChB,MAAMC,EAAUD,EAChB,OAAmB,MAAXC,GACJlkC,EAAKyK,OAASy5B,EAAQz5B,MACtBzK,EAAKijC,UAAYiB,EAAQjB,SJvF9B,SAAgB5sB,EAAGC,GACtB,GAAID,IAAMC,EACN,OAAO,EAEN,CACD,MAAM+oB,EAAO/oB,EACb,OAAQD,EAAE5L,OAAS40B,EAAK50B,MACpB4L,EAAEliB,OAASkrC,EAAKlrC,MAChBkrC,EAAK76B,iBAAiBmB,YjB5B3B,SAAgBw+B,EAAIC,GACvB,GAAID,IAAOC,EACP,OAAO,EACX,GAAID,EAAGj+B,aAAek+B,EAAGl+B,WACrB,OAAO,EAEX,IAAK,IAAIm+B,EAAK,EAAGA,EAAKF,EAAGj+B,WAAYm+B,IACjC,GAAIF,EAAGE,KAAQD,EAAGC,GACd,OAAO,EAGf,OAAO,CACX,CiBiBY,CAAWhuB,EAAE7R,MAAO66B,EAAK76B,MACjC,CACJ,CI6EY,CAAcxE,EAAK0iC,UAAWwB,EAAQxB,UAC9C,CACA,QAAA3mC,CAAS+sB,GACL,OAAOtoB,GAAO9K,KAAMozB,EACxB,CACA,MAAA/X,GACI,MAAO,CAAE,IAAKvQ,GAAO9K,MACzB,CACA,IAAAstC,GACI,OAAOttC,IACX,CACA,CAACyjC,OAAOqB,aAAe,MAEvB,CAACrB,OAAOmL,IAAI,iCACR,MAAO,OAAO5uC,KAAKqG,aACvB,CAWA,YAAO0nC,CAAMhY,GACT,GAAa,MAATA,EACA,OAAO,KAEX,MAAM/2B,EAAQ+2B,EACd,GAAI/2B,aAAiB8uC,GAEjB,OAAO9uC,EAEN,GAAmB,MAAdA,EAAM,MAAgBA,EAAM,OAASA,EAAM8P,OAAU9P,EAAM+uC,QAAU/uC,EAAO,CAMlF,MAAM,QAAEuuC,EAAO,KAAEx4B,EAAI,UAAEi4B,EAAS,MAAEl+B,GAAU9P,EAC5C,OAAO,IAAI8uC,GAAIP,EAASx4B,EAAMi4B,EAAWl+B,GAAS+/B,GAAUtB,EAASx4B,EAAMi4B,EAAUl+B,OACzF,CACK,IAAyB,IAArB9P,EAAM8vC,IAAqB,CAIhC,MAAM,QAAEvB,EAAO,UAAEP,EAAS,KAAEj4B,GAAS/V,EAC/B6W,EAAS,GAAcm3B,GAC7B,OAAOc,GAAIlvC,OAAO2uC,EAASx4B,EAAMc,EACrC,CAII,OAAO,IAEf,CAMA,aAAOjX,CAAO2uC,EAASx4B,EAAMc,GACzB,GAAoB,iBAATd,EACP,MAAM,IAAIvW,MAAM,yCAEpB,KAAMqX,EAAO/G,iBAAiBmB,YAC1B,MAAM,IAAIzR,MAAM,kBAEpB,OAAQ+uC,GACJ,KAAK,EACD,GAAIx4B,IAASk5B,GACT,MAAM,IAAIzvC,MAAM,wCAAwCyvC,sBAGxD,OAAO,IAAIH,GAAIP,EAASx4B,EAAMc,EAAQA,EAAO/G,OAGrD,KAAK,EAAG,CACJ,MAAMA,EAAQ+/B,GAAUtB,EAASx4B,EAAMc,EAAO/G,OAC9C,OAAO,IAAIg/B,GAAIP,EAASx4B,EAAMc,EAAQ/G,EAC1C,CACA,QACI,MAAM,IAAItQ,MAAM,mBAG5B,CAIA,eAAO2vC,CAASt4B,GACZ,OAAOi4B,GAAIlvC,OAAO,EAAGqvC,GAAap4B,EACtC,CAOA,eAAOw4B,CAASt5B,EAAMc,GAClB,OAAOi4B,GAAIlvC,OAAO,EAAGmW,EAAMc,EAC/B,CAQA,aAAOmG,CAAOlN,GACV,MAAO0+B,EAAKuB,GAAajB,GAAIkB,YAAYlgC,GACzC,GAAyB,IAArBigC,EAAUttC,OACV,MAAM,IAAIjD,MAAM,oBAEpB,OAAOgvC,CACX,CAUA,kBAAOwB,CAAYlgC,GACf,MAAMmgC,EAAQnB,GAAIoB,aAAapgC,GACzBqgC,EAAaF,EAAMxwC,KAAOwwC,EAAMG,cAChCC,EAAiB1kC,EAAOmE,EAAMmT,SAASktB,EAAYA,EAAaF,EAAMG,gBAC5E,GAAIC,EAAe7+B,aAAey+B,EAAMG,cACpC,MAAM,IAAI5wC,MAAM,oBAEpB,MAAM8wC,EAAcD,EAAeptB,SAASgtB,EAAMG,cAAgBH,EAAMM,YAClE15B,EAAS,IAAIk3B,GAAckC,EAAMO,cAAeP,EAAMM,WAAYD,EAAaD,GAIrF,MAAO,CAHuB,IAAlBJ,EAAM1B,QACZO,GAAIK,SAASt4B,GACbi4B,GAAIO,SAASY,EAAM5H,MAAOxxB,GACnB/G,EAAMmT,SAASgtB,EAAMxwC,MACtC,CAUA,mBAAOywC,CAAaO,GAChB,IAAIvsC,EAAS,EACb,MAAMmF,EAAO,KACT,MAAO9G,EAAGE,GAAU,GAAcguC,EAAaxtB,SAAS/e,IAExD,OADAA,GAAUzB,EACHF,CAAC,EAEZ,IAAIgsC,EAAUllC,IACVg/B,EAAQ4G,GASZ,GARgB,KAAZV,GAEAA,EAAU,EACVrqC,EAAS,GAGTmkC,EAAQh/B,IAEI,IAAZklC,GAA6B,IAAZA,EACjB,MAAM,IAAI/W,WAAW,uBAAuB+W,KAEhD,MAAM4B,EAAajsC,EACbssC,EAAgBnnC,IAChBknC,EAAalnC,IACb5J,EAAOyE,EAASqsC,EAEtB,MAAO,CAAEhC,UAASlG,QAAOmI,gBAAeD,aAAYH,cAD9B3wC,EAAO0wC,EACsC1wC,OACvE,CAOA,YAAO6mB,CAAMnf,EAAQitB,GACjB,MAAO1zB,EAAQoP,GAUvB,SAAyB3I,EAAQitB,GAC7B,OAAQjtB,EAAO,IAEX,IAAK,IAAK,CACN,MAAMyqB,EAAUwC,GAAQmY,GACxB,MAAO,CACHA,GAAU7rC,OACVkxB,EAAQ5U,OAAO,GAAGuvB,GAAU7rC,SAASyG,KAE7C,CACA,KAAKolC,GAAU7rC,OAAQ,CACnB,MAAMkxB,EAAUwC,GAAQmY,GACxB,MAAO,CAACA,GAAU7rC,OAAQkxB,EAAQ5U,OAAO7V,GAC7C,CACA,KAAKkwB,GAAO32B,OAAQ,CAChB,MAAMkxB,EAAUwC,GAAQiD,GACxB,MAAO,CAACA,GAAO32B,OAAQkxB,EAAQ5U,OAAO7V,GAC1C,CACA,KAAKklC,GAAO3rC,OAAQ,CAChB,MAAMkxB,EAAUwC,GAAQiY,GACxB,MAAO,CAACA,GAAO3rC,OAAQkxB,EAAQ5U,OAAO7V,GAC1C,CACA,QACI,GAAY,MAARitB,EACA,MAAM50B,MAAM,2FAEhB,MAAO,CAAC2H,EAAO,GAAIitB,EAAKpX,OAAO7V,IAG3C,CAvCgCupC,CAAgBvpC,EAAQitB,GAC1Coa,EAAMM,GAAI9xB,OAAOlN,GACvB,GAAoB,IAAhB0+B,EAAID,SAA+B,MAAdpnC,EAAO,GAC5B,MAAM3H,MAAM,0DAIhB,OADAkvC,GAAUF,GAAKluC,IAAII,EAAQyG,GACpBqnC,CACX,EA2DJ,MAAMS,GAAc,IACdC,GAAe,GACrB,SAASW,GAAUtB,EAASx4B,EAAMi4B,GAC9B,MAAM2C,EAAa,GAAsBpC,GACnCqC,EAAaD,EAAa,GAAsB56B,GAChDjG,EAAQ,IAAImB,WAAW2/B,EAAa5C,EAAUx8B,YAIpD,OAHA,GAAgB+8B,EAASz+B,EAAO,GAChC,GAAgBiG,EAAMjG,EAAO6gC,GAC7B7gC,EAAMxP,IAAI0tC,EAAW4C,GACd9gC,CACX,CACA,MAAMggC,GAAYrL,OAAOmL,IAAI,oBC1WhBiB,GAAQ,IAAK,KAAiB,KAAU,KAAU,KAAW,KAAW,KAAW,KAAW,KAAW,KAAW,GCbjI,SAASC,GAAY/uC,EAAMrB,EAAQwV,EAAQ8G,GACvC,MAAO,CACHjb,OACArB,SACAixB,QAAS,CACL5vB,OACArB,SACAwV,UAEJ0b,QAAS,CACL5U,UAGZ,CACA,MAAMzL,GAASu/B,GAAY,OAAQ,KAAMtgC,GAE9B,IADS,IAAIs8B,YAAY,QACX9vB,OAAOxM,KAC5BzJ,IACgB,IAAIgmC,aACL72B,OAAOnP,EAAI0B,UAAU,MAElCsoC,GAAQD,GAAY,QAAS,KAAMtgC,IACrC,IAAIe,EAAS,IACb,IAAK,IAAIhP,EAAI,EAAGA,EAAIiO,EAAI/N,OAAQF,IAC5BgP,GAAUvB,OAAOC,aAAaO,EAAIjO,IAEtC,OAAOgP,CAAM,IACbxK,IAEA,MAAMyJ,EAAMwV,GADZjf,EAAMA,EAAI0B,UAAU,IACQhG,QAC5B,IAAK,IAAIF,EAAI,EAAGA,EAAIwE,EAAItE,OAAQF,IAC5BiO,EAAIjO,GAAKwE,EAAIsH,WAAW9L,GAE5B,OAAOiO,CAAG,IAWd,GATc,CACVC,KAAMc,GACN,QAASA,GACTmF,IAAKm6B,GAAM3F,OACX8F,OAAQD,GACRA,SACA9f,OAAQ8f,MACLF,ICpCA,SAAS,GAAWt/B,EAAQwU,EAAW,QAC1C,MAAMqO,EAAO,GAAMrO,GACnB,GAAY,MAARqO,EACA,MAAM,IAAI50B,MAAM,yBAAyBumB,MAG7C,OAAOqO,EAAKxC,QAAQ5U,OAAO,GAAGoX,EAAK1zB,SAAS6Q,IAChD,CCHA,MAAM+Q,GAIFzhB,GAIAuC,IAIAiG,KAIA4C,IACA,WAAAqE,CAAYzP,EAAIuC,EAAK6I,GACjBjL,KAAKH,GAAKA,EACVG,KAAKoC,IAAMA,EACXpC,KAAKqI,UAAOnJ,EACZc,KAAKiL,IAAMA,CACf,EAGJ,SAASsW,KAAS,CAIlB,MAAMC,GAIFC,KAIAC,KAIAtf,IAIAiG,KACA,WAAAiH,CAAY8P,GACRpf,KAAKyhB,KAAOrC,EAAOqC,KACnBzhB,KAAK0hB,KAAOtC,EAAOsC,KACnB1hB,KAAKoC,IAAMgd,EAAOhd,IAClBpC,KAAKqI,KAAO+W,EAAOuC,MACvB,EAEJ,MAAMsuB,GC7DS,WACX,MAAMnQ,EAAe,KAErB,IAAIE,EACA98B,EAAS48B,EACb,OAAO,SAAmBrhC,GACtB,GAAIA,EAAO,GAAKA,EAJRqhC,KAKJ,OAAO9a,EAAYvmB,GAEnByE,EAASzE,EAAOqhC,IAChBE,EAAOhb,EAAY8a,GACnB58B,EAAS,GAEb,MAAMsM,EAAMwwB,EAAK/d,SAAS/e,EAAQA,GAAUzE,GAK5C,OAJc,EAATyE,IAEDA,EAAwB,GAAL,EAATA,IAEPsM,CACX,CACJ,CDyCmBwS,GAiBnB,MAAMkuB,GAIF9tC,IAIAqf,KAIAC,KAIAC,OACA,WAAArS,GACItP,KAAKoC,IAAM,EACXpC,KAAKyhB,KAAO,IAAIH,GAAGC,GAAM,EAAG,GAC5BvhB,KAAK0hB,KAAO1hB,KAAKyhB,KACjBzhB,KAAK2hB,OAAS,IAClB,CAIA,KAAArR,CAAMzQ,EAAIuC,EAAK6I,GAGX,OAFAjL,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIiZ,GAAGzhB,EAAIuC,EAAK6I,GAC7CjL,KAAKoC,KAAOA,EACLpC,IACX,CAIA,MAAAqQ,CAAOrR,GAaH,OAVAgB,KAAKoC,MAAQpC,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIwZ,IAAU7iB,KAAkB,GACtE,IACE,EACAA,EAAQ,MACJ,EACAA,EAAQ,QACJ,EACAA,EAAQ,UACJ,EACA,EAAGA,IAAQoD,IACtBpC,IACX,CAIA,KAAAkiB,CAAMljB,GACF,OAAOA,EAAQ,EACTgB,KAAKsQ,MAAMwR,GAAe,GAAI/D,EAASlC,WAAW7c,IAClDgB,KAAKqQ,OAAOrR,EACtB,CAIA,MAAAmjB,CAAOnjB,GACH,OAAOgB,KAAKqQ,QAAQrR,GAAS,EAAIA,GAAS,MAAQ,EACtD,CAIA,MAAAojB,CAAOpjB,GACH,MAAMiU,EAAO8K,EAASsoB,WAAWrnC,GACjC,OAAOgB,KAAKsQ,MAAMwR,GAAe7O,EAAKxR,SAAUwR,EACpD,CAIA,YAAA2zB,CAAa5nC,GACT,OAAOgB,KAAKsQ,MAAMo1B,EAAkBF,EAAexmC,GAAQA,EAC/D,CAIA,YAAA6nC,CAAa7nC,GACT,OAAOgB,KAAKoiB,OAAO6jB,OAAOjnC,GAC9B,CAIA,KAAAqjB,CAAMrjB,GACF,OAAOgB,KAAKoiB,OAAOpjB,EACvB,CAIA,WAAA0nC,CAAY1nC,GACR,OAAOgB,KAAK4mC,aAAa5nC,EAC7B,CAIA,WAAA2nC,CAAY3nC,GACR,OAAOgB,KAAK6mC,aAAa7nC,EAC7B,CAIA,MAAAsjB,CAAOtjB,GACH,MAAMiU,EAAO8K,EAASsoB,WAAWrnC,GAAOmf,WACxC,OAAOne,KAAKsQ,MAAMwR,GAAe7O,EAAKxR,SAAUwR,EACpD,CAIA,YAAA6zB,CAAa9nC,GACT,MAAMiU,EAAO8K,EAASlC,WAAW7c,GAAOmf,WACxC,OAAOne,KAAKsQ,MAAMwR,GAAe7O,EAAKxR,SAAUwR,EACpD,CAIA,YAAA8zB,CAAa/nC,GACT,OAAOgB,KAAKsiB,OAAO2jB,OAAOjnC,GAC9B,CAIA,IAAAujB,CAAKvjB,GACD,OAAOgB,KAAKsQ,MAAMsR,GAAW,EAAG5iB,EAAQ,EAAI,EAChD,CAIA,OAAAwjB,CAAQxjB,GACJ,OAAOgB,KAAKsQ,MAAMyR,GAAc,EAAG/iB,IAAU,EACjD,CAIA,QAAAyjB,CAASzjB,GACL,OAAOgB,KAAKwiB,QAAQxjB,EACxB,CAIA,OAAA0jB,CAAQ1jB,GACJ,MAAMiU,EAAO8K,EAASsoB,WAAWrnC,GACjC,OAAOgB,KAAKsQ,MAAMyR,GAAc,EAAG9O,EAAK+K,IAAI1N,MAAMyR,GAAc,EAAG9O,EAAKgL,GAC5E,CAIA,aAAA+oB,CAAchoC,GACV,MAAMiU,EAAO8K,EAASlC,WAAW7c,GACjC,OAAOgB,KAAKsQ,MAAMyR,GAAc,EAAG9O,EAAK+K,IAAI1N,MAAMyR,GAAc,EAAG9O,EAAKgL,GAC5E,CAIA,aAAAgpB,CAAcjoC,GACV,OAAOgB,KAAK0iB,QAAQujB,OAAOjnC,GAC/B,CAIA,QAAA2jB,CAAS3jB,GACL,OAAOgB,KAAK0iB,QAAQ1jB,EACxB,CAIA,cAAAkoC,CAAeloC,GACX,OAAOgB,KAAKgnC,cAAchoC,EAC9B,CAIA,cAAAmoC,CAAenoC,GACX,OAAOgB,KAAKinC,cAAcjoC,EAC9B,CAIA,KAAA4jB,CAAM5jB,GACF,OAAOgB,KAAKsQ,MAAMuS,EAAc,EAAG7jB,EACvC,CAQA,MAAA8jB,CAAO9jB,GACH,OAAOgB,KAAKsQ,MAAMyS,EAAe,EAAG/jB,EACxC,CAIA,KAAA8P,CAAM9P,GACF,MAAMoD,EAAMpD,EAAMyC,SAAW,EAC7B,OAAY,IAARW,EACOpC,KAAKsQ,MAAMsR,GAAW,EAAG,GAE7B5hB,KAAKqQ,OAAOjO,GAAKkO,MAAM0S,GAAY5gB,EAAKpD,EACnD,CAIA,MAAAuR,CAAOvR,GACH,MAAMoD,E5B7RP,SAAgBmO,GACnB,IAAInO,EAAM,EACN+E,EAAI,EACR,IAAK,IAAI5F,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,EACjC4F,EAAIoJ,EAAOlD,WAAW9L,GAClB4F,EAAI,IACJ/E,GAAO,EAEF+E,EAAI,KACT/E,GAAO,EAEe,QAAZ,MAAJ+E,IAAkE,QAAZ,MAA3BoJ,EAAOlD,WAAW9L,EAAI,OACrDA,EACFa,GAAO,GAGPA,GAAO,EAGf,OAAOA,CACX,C4ByQoB,CAAYpD,GACxB,OAAe,IAARoD,EACDpC,KAAKqQ,OAAOjO,GAAKkO,MAAM,EAAYlO,EAAKpD,GACxCgB,KAAKsQ,MAAMsR,GAAW,EAAG,EACnC,CAKA,IAAAqB,GAII,OAHAjjB,KAAK2hB,OAAS,IAAIH,GAAMxhB,MACxBA,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,GAAGC,GAAM,EAAG,GACxCvhB,KAAKoC,IAAM,EACJpC,IACX,CAIA,KAAAuU,GAWI,OAVmB,MAAfvU,KAAK2hB,QACL3hB,KAAKyhB,KAAOzhB,KAAK2hB,OAAOF,KACxBzhB,KAAK0hB,KAAO1hB,KAAK2hB,OAAOD,KACxB1hB,KAAKoC,IAAMpC,KAAK2hB,OAAOvf,IACvBpC,KAAK2hB,OAAS3hB,KAAK2hB,OAAOtZ,OAG1BrI,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,GAAGC,GAAM,EAAG,GACxCvhB,KAAKoC,IAAM,GAERpC,IACX,CAIA,MAAAkjB,GACI,MAAMzB,EAAOzhB,KAAKyhB,KACZC,EAAO1hB,KAAK0hB,KACZtf,EAAMpC,KAAKoC,IAOjB,OANApC,KAAKuU,QAAQlE,OAAOjO,GACR,IAARA,IACApC,KAAK0hB,KAAKrZ,KAAOoZ,EAAKpZ,KACtBrI,KAAK0hB,KAAOA,EACZ1hB,KAAKoC,KAAOA,GAETpC,IACX,CAIA,MAAAmjB,GACI,IAAI1B,EAAOzhB,KAAKyhB,KAAKpZ,KACrB,MAAMmH,GA9QC/Q,EA8QWuB,KAAKoC,IA7QF,MAArBw1B,WAAW5nB,OACJgV,EAAYvmB,GAEhBwxC,GAAWxxC,IAJtB,IAAeA,EA+QP,IAAIqI,EAAM,EACV,KAAe,MAAR2a,GACHA,EAAK5hB,GAAG4hB,EAAKxW,IAAKuE,EAAK1I,GACvBA,GAAO2a,EAAKrf,IACZqf,EAAOA,EAAKpZ,KAGhB,OAAOmH,CACX,EAEJ,SAASoS,GAAU3W,EAAKuE,EAAK1I,GACzB0I,EAAI1I,GAAa,IAANmE,CACf,CACA,SAASklC,GAAcllC,EAAKuE,EAAK1I,GAC7B,KAAOmE,EAAM,KACTuE,EAAI1I,KAAe,IAANmE,EAAY,IACzBA,KAAS,EAEbuE,EAAI1I,GAAOmE,CACf,CAMA,MAAM4W,WAAiBP,GACnBjZ,KACA,WAAAiH,CAAYlN,EAAK6I,GACbmlC,MAAMD,GAAe/tC,EAAK6I,GAC1BjL,KAAKqI,UAAOnJ,CAChB,EAEJ,SAAS4iB,GAAc7W,EAAKuE,EAAK1I,GAC7B,KAAkB,IAAXmE,EAAIgT,IACPzO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,IAAM/S,EAAI+S,KAAO,EAAI/S,EAAIgT,IAAM,MAAQ,EAC3ChT,EAAIgT,MAAQ,EAEhB,KAAOhT,EAAI+S,GAAK,KACZxO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,GAAK/S,EAAI+S,KAAO,EAExBxO,EAAI1I,KAASmE,EAAI+S,EACrB,CACA,SAAS+D,GAAa9W,EAAKuE,EAAK1I,GAC5B0I,EAAI1I,GAAa,IAANmE,EACXuE,EAAI1I,EAAM,GAAKmE,IAAQ,EAAI,IAC3BuE,EAAI1I,EAAM,GAAKmE,IAAQ,GAAK,IAC5BuE,EAAI1I,EAAM,GAAKmE,IAAQ,EAC3B,CACA,SAAS+X,GAAW/X,EAAKuE,EAAK1I,GAC1B0I,EAAIlQ,IAAI2L,EAAKnE,EACjB,CAmBA,SAASiJ,GAAiB9E,EAAKuE,EAAK1I,GAChC0I,EAAIlQ,IAAI2L,EAAKnE,EAEjB,CACA,SAASyI,GAAkBtE,EAAKuE,EAAK1I,GAC7BmE,EAAIxJ,OAAS,GAEb,EAAWwJ,EAAKuE,EAAK1I,GAGC,MAAjB0I,EAAIG,UAETH,EAAIG,UAAU1E,EAAKnE,GAGnB0I,EAAIlQ,IAAI,GAAqB2L,GAAMnE,EAE3C,CE3aO,SAASupC,GAAc7jC,EAAS66B,GACnC,MAAMtzB,EF+aC,IAAIm8B,GE3aX,OAHA7I,EAAMnyB,OAAO1I,EAASuH,EAAG,CACrBu8B,iBAAiB,IAEdv8B,EAAEoP,QACb,CCNO,IAAIotB,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,GC3DAC,GTIJ,SAAS,GAAYxwC,EAAMoE,EAAM+P,EAAQ8G,GAC5C,MAAO,CACHjb,OACAoE,OACA+P,SACA8G,SAER,CUhBO,SAASw1B,GAAYnyC,GACxB,SAASoyC,EAAUxmC,GAGf,GAAyB,MAArB5L,EAAE4L,EAAI5E,YACN,MAAM,IAAI7H,MAAM,sBAEpB,OAAOa,EAAE4L,EACb,CAUA,OAAO,GAAY,OAAQslC,GAAYmB,QATxB,SAAoBzmC,EAAKmU,GACpC,MAAMuyB,EAAYF,EAAUxmC,GAC5BmU,EAAO8C,MAAMyvB,EACjB,IACe,SAAoBryB,GAE/B,OAAOmyB,EADKnyB,EAAO4C,QAEvB,GAGJ,CCnBO,SAAS1V,GAAQ0I,EAAQ8G,GAC5B,OAAO,GAAY,UAAWu0B,GAAYqB,iBAAkB18B,EAAQ8G,EACxE,CdsYyB,MAArB4b,WAAW5nB,SACXkgC,GAAiB1wC,UAAUsP,MAAQ,SAAU9P,GACzC,MAAMoD,EAAMpD,EAAMyC,SAAW,EAK7B,OAJAzB,KAAKqQ,OAAOjO,GACRA,EAAM,GACNpC,KAAKsQ,MAAMP,GAAkB3N,EAAKpD,GAE/BgB,IACX,EACAkwC,GAAiB1wC,UAAU+Q,OAAS,SAAUvR,GAC1C,MAAMoD,EAAMw1B,WAAW5nB,OAAOQ,WAAWxR,GAKzC,OAJAgB,KAAKqQ,OAAOjO,GACRA,EAAM,GACNpC,KAAKsQ,MAAMf,GAAmBnN,EAAKpD,GAEhCgB,IACX,GGvZJ,SAAWuwC,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,IYaH/xC,MAUxB,MAAMqzC,WAAuBrzC,MAMhCuW,KAAO,iBACPhU,KAAO,iBAKJ,MAAM+wC,WAAqBtzC,MAM9BuW,KAAO,eACPhU,KAAO,eCnDJ,SAASgxC,GAAU/yC,GACtB,OAAO8N,QAAQ9N,EACnB,CCFO,SAASgzC,GAAoB/uC,GAChC,MAAMgvC,EAAkB,IAAIpE,IAS5B,OARA5qC,EAAOkK,SAASnO,IACZ,IAAIkzC,EAAOD,EAAgB7yC,IAAIJ,EAAMmzC,cAChCD,IACDD,EAAgB3yC,IAAIN,EAAMmzC,aAAc,IACxCD,EAAOD,EAAgB7yC,IAAIJ,EAAMmzC,eAErCD,EAAK1xC,KAAKxB,EAAM,IAEbizC,CACX,CCkCA,SAASG,GAAK3nC,GACV,OAAO,IAAI8xB,SAASr4B,IAChB2iB,WAAW3iB,EAASuG,EAAG,GAE/B,EdzCA,SAAW+lC,GACP,IAAI6B,EACJ7B,EAAenJ,MAAQ,KACL,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAI+/B,OAAiB//B,EAAI+/B,MAAM9hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI+/B,QAEO,MAAlB//B,EAAIggC,YAAsBhgC,EAAIggC,WAAW/hC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,aAEE,MAAbhgC,EAAIigC,OAAiBjgC,EAAIigC,MAAMhiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,QAEG,MAAdjgC,EAAIkgC,QAAkBlgC,EAAIkgC,OAAOjiC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,SAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEM,MAAjBngC,EAAIogC,WAAqBpgC,EAAIogC,UAAUniC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,YAEU,MAArBpgC,EAAIqgC,eAAyBrgC,EAAIqgC,cAAcpiC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,iBAEa,IAAzB9V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+/B,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B3rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI+/B,MAAQhzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIggC,WAAajzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIigC,MAAQlzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIkgC,OAASnzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,UAAYrzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIqgC,cAAgBtzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX7B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG0T,KAAmBA,GAAiB,CAAC,IAExC,SAAWC,GACP,IAAI4B,EACJ5B,EAAYpJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIugC,SAAmBvgC,EAAIugC,QAAQtiC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIugC,UAES,MAApBvgC,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,eAEE,MAAf5/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIwgC,YACJh/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIwgC,YAED,MAAZxgC,EAAIygC,OACJj/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIygC,OAEU,MAAtBzgC,EAAI0gC,iBACJl/B,EAAE1D,OAAO,KACTmgC,GAAenJ,QAAQnyB,OAAO3C,EAAI0gC,eAAgBl/B,IAEjC,MAAjBxB,EAAI2gC,YACJn/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI2gC,aAEc,IAAzBpW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRugC,QAAS,EAAgB,GACzBX,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIugC,QAAUxzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI4/B,aAAe7yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIwgC,UAAYzzB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIygC,KAAO1zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI0gC,eAAiBzC,GAAenJ,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE8iC,OAAQrW,EAAKqW,QAAQF,iBAEzB,MAEJ,KAAK,GACD1gC,EAAI2gC,UAAY5zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX5B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG2T,KAAgBA,GAAc,CAAC,ICnMlC,SAAWC,GACP,IAAI0C,EA8CAf,GA7CJ,SAAWe,GACP,IAAIf,EACJe,EAAc/L,MAAQ,KACJ,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEmB,MAApB1Q,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,gBAEY,IAAzBrV,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR4/B,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACXwiC,IAAQ,GACP,EACDtgC,EAAI4/B,aAAe7yB,EAAO/O,SAI1B+O,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXe,EAAcl+B,OAAU3C,GACb89B,GAAc99B,EAAK6gC,EAAc/L,SAE5C+L,EAAcp3B,OAAS,CAACxM,EAAKstB,IAClBsK,EAAc53B,EAAK4jC,EAAc/L,QAASvK,EAExD,CA5CD,CA4CGsW,EAAgB1C,EAAc0C,gBAAkB1C,EAAc0C,cAAgB,CAAC,IAElF1C,EAAcrJ,MAAQ,KACJ,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAY9B,IAX6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAI8gC,YAAuC,IAAlB9gC,EAAI8gC,YAC9Bt/B,EAAE1D,OAAO,GACT0D,EAAEwO,KAAKhQ,EAAI8gC,YAEG,MAAb9gC,EAAI+gC,OAA+B,KAAd/gC,EAAI+gC,QAC1Bv/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI+gC,QAES,MAAtB/gC,EAAIghC,eACJ,IAAK,MAAMv0C,KAASuT,EAAIghC,eACpBx/B,EAAE1D,OAAO,IACTqgC,EAAc0C,cAAc/L,QAAQnyB,OAAOlW,EAAO+U,IAG7B,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR8gC,WAAW,EACXC,MAAO,GACPC,eAAgB,IAEdtsC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI8gC,UAAY/zB,EAAOiD,OACvB,MAEJ,KAAK,EACDhQ,EAAI+gC,MAAQh0B,EAAO/O,SACnB,MAEJ,KAAK,EACD,GAAmC,MAA/BusB,EAAKqW,QAAQI,gBAA0BhhC,EAAIghC,eAAe9xC,SAAWq7B,EAAKqW,OAAOI,eACjF,MAAM,IAAI1B,GAAe,mEAE7Bt/B,EAAIghC,eAAe/yC,KAAKkwC,EAAc0C,cAAc/L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxF8iC,OAAQrW,EAAKqW,QAAQK,mBAEzB,MAEJ,QACIl0B,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX3B,EAAcx7B,OAAU3C,GACb89B,GAAc99B,EAAKm+B,EAAcrJ,SAE5CqJ,EAAc10B,OAAS,CAACxM,EAAKstB,IAClBsK,EAAc53B,EAAKkhC,EAAcrJ,QAASvK,EAExD,CAnHD,CAmHG4T,KAAkBA,GAAgB,CAAC,IAEtC,SAAWC,GACP,IAAI0B,EACJ1B,EAAYtJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAhB1Q,EAAIkhC,SACJ,IAAK,MAAMz0C,KAASuT,EAAIkhC,SACpB1/B,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAOlW,EAAO+U,IAGb,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRkhC,SAAU,IAERxsC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,GAAQwiC,IAAQ,GACP,EAAL,CACI,GAA6B,MAAzB/V,EAAKqW,QAAQM,UAAoBlhC,EAAIkhC,SAAShyC,SAAWq7B,EAAKqW,OAAOM,SACrE,MAAM,IAAI5B,GAAe,6DAE7Bt/B,EAAIkhC,SAASjzC,KAAK,GAAY6mC,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAClE8iC,OAAQrW,EAAKqW,QAAQO,YAG7B,MAEIp0B,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX1B,EAAYz7B,OAAU3C,GACX89B,GAAc99B,EAAKo+B,EAAYtJ,SAE1CsJ,EAAY30B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKmhC,EAAYtJ,QAASvK,EAEtD,CAnDD,CAmDG6T,KAAgBA,GAAc,CAAC,IAElC,SAAWC,GACP,IAAIyB,EACJzB,EAAUvJ,MAAQ,KACA,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIohC,WAAuC,KAAlBphC,EAAIohC,YAC9B5/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIohC,YAEE,MAAfphC,EAAIynB,UACJjmB,EAAE1D,OAAO,IACTqgC,GAAcrJ,QAAQnyB,OAAO3C,EAAIynB,QAASjmB,IAE9B,MAAZxB,EAAI/R,OACJuT,EAAE1D,OAAO,IACTsgC,GAAYtJ,QAAQnyB,OAAO3C,EAAI/R,KAAMuT,KAEZ,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRohC,UAAW,IAET1sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIohC,UAAYr0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIynB,QAAU0W,GAAcrJ,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAChE8iC,OAAQrW,EAAKqW,QAAQnZ,UAEzB,MAEJ,KAAK,EACDznB,EAAI/R,KAAOmwC,GAAYtJ,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC3D8iC,OAAQrW,EAAKqW,QAAQ3yC,OAEzB,MAEJ,QACI8e,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXzB,EAAU17B,OAAU3C,GACT89B,GAAc99B,EAAKq+B,EAAUvJ,SAExCuJ,EAAU50B,OAAS,CAACxM,EAAKstB,IACdsK,EAAc53B,EAAKohC,EAAUvJ,QAASvK,EAEpD,CAhED,CAgEG8T,KAAcA,GAAY,CAAC,IAE9B,SAAWJ,GACP,IAAI6B,EACJ7B,EAAenJ,MAAQ,KACL,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAI+/B,OAAiB//B,EAAI+/B,MAAM9hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI+/B,QAEO,MAAlB//B,EAAIggC,YAAsBhgC,EAAIggC,WAAW/hC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,aAEE,MAAbhgC,EAAIigC,OAAiBjgC,EAAIigC,MAAMhiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,QAEG,MAAdjgC,EAAIkgC,QAAkBlgC,EAAIkgC,OAAOjiC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,SAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEM,MAAjBngC,EAAIogC,WAAqBpgC,EAAIogC,UAAUniC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,YAEU,MAArBpgC,EAAIqgC,eAAyBrgC,EAAIqgC,cAAcpiC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,iBAEa,IAAzB9V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+/B,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B3rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI+/B,MAAQhzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIggC,WAAajzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIigC,MAAQlzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIkgC,OAASnzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,UAAYrzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIqgC,cAAgBtzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX7B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI4B,EACJ5B,EAAYpJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIugC,SAAmBvgC,EAAIugC,QAAQtiC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIugC,UAES,MAApBvgC,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,eAEE,MAAf5/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIwgC,YACJh/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIwgC,YAED,MAAZxgC,EAAIygC,OACJj/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIygC,OAEU,MAAtBzgC,EAAI0gC,iBACJl/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI0gC,eAAgBl/B,IAEjC,MAAjBxB,EAAI2gC,YACJn/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI2gC,aAEc,IAAzBpW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRugC,QAAS,EAAgB,GACzBX,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIugC,QAAUxzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI4/B,aAAe7yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIwgC,UAAYzzB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIygC,KAAO1zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI0gC,eAAiB,GAAe5L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE8iC,OAAQrW,EAAKqW,QAAQF,iBAEzB,MAEJ,KAAK,GACD1gC,EAAI2gC,UAAY5zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX5B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,IChblC,SAAW+T,GACP,IAAIwB,EACJxB,EAAiBxJ,MAAQ,KACP,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEmB,MAApB1Q,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,gBAEY,IAAzBrV,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR4/B,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACXwiC,IAAQ,GACP,EACDtgC,EAAI4/B,aAAe7yB,EAAO/O,SAI1B+O,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXxB,EAAiB37B,OAAU3C,GAChB89B,GAAc99B,EAAKs+B,EAAiBxJ,SAE/CwJ,EAAiB70B,OAAS,CAACxM,EAAKstB,IACrBsK,EAAc53B,EAAKqhC,EAAiBxJ,QAASvK,EAE3D,CA5CD,CA4CG+T,KAAqBA,GAAmB,CAAC,IC3C5C,SAAWC,GACP,IAAI8C,EAOAC,EAYAxB,GAlBJ,SAAWuB,GACPA,EAAqC,gBAAI,kBACzCA,EAA+B,UAAI,YACnCA,EAAiC,YAAI,cACrCA,EAAqC,gBAAI,iBAC5C,CALD,CAKGA,EAAsB9C,EAAuB8C,sBAAwB9C,EAAuB8C,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,EAAoBvM,MAAQ,IACjBmK,GAAYqC,EAE1B,CAJD,CAIGD,EAAsB9C,EAAuB8C,sBAAwB9C,EAAuB8C,oBAAsB,CAAC,IAEtH9C,EAAuBzJ,MAAQ,KACb,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIohC,WAAuC,KAAlBphC,EAAIohC,YAC9B5/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIohC,YAEc,MAA3BphC,EAAIuhC,qBAAwF,IAAzDD,EAA4BthC,EAAIuhC,uBACnE//B,EAAE1D,OAAO,IACTygC,EAAuB8C,oBAAoBvM,QAAQnyB,OAAO3C,EAAIuhC,oBAAqB//B,IAEhE,MAAnBxB,EAAIwhC,cACJhgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIwhC,cAEQ,MAArBxhC,EAAIyhC,cACJ,IAAK,MAAMh1C,KAASuT,EAAIyhC,cACpBjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,IAGY,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRohC,UAAW,GACXG,oBAAqBF,EAAoBK,gBACzCD,cAAe,IAEb/sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIohC,UAAYr0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIuhC,oBAAsBhD,EAAuB8C,oBAAoBvM,QAAQrrB,OAAOsD,GACpF,MAEJ,KAAK,GACD/M,EAAIwhC,YAAcz0B,EAAO/O,SACzB,MAEJ,KAAK,GACD,GAAkC,MAA9BusB,EAAKqW,QAAQa,eAAyBzhC,EAAIyhC,cAAcvyC,SAAWq7B,EAAKqW,OAAOa,cAC/E,MAAM,IAAInC,GAAe,kEAE7Bt/B,EAAIyhC,cAAcxzC,KAAK8e,EAAO/O,UAC9B,MAEJ,QACI+O,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXvB,EAAuB57B,OAAU3C,GACtB89B,GAAc99B,EAAKu+B,EAAuBzJ,SAErDyJ,EAAuB90B,OAAS,CAACxM,EAAKstB,IAC3BsK,EAAc53B,EAAKshC,EAAuBzJ,QAASvK,EAEjE,CA9FD,CA8FGgU,KAA2BA,GAAyB,CAAC,IAExD,SAAWoD,GACP,IAAI7B,EACJ6B,EAAwB7M,MAAQ,KACd,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIohC,WAAuC,KAAlBphC,EAAIohC,YAC9B5/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIohC,YAEM,MAAlBphC,EAAI4hC,YAAyC,IAAnB5hC,EAAI4hC,aAC/BpgC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAI4hC,aAEK,MAAlB5hC,EAAI6hC,aACJrgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6hC,cAEY,IAAzBtX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRohC,UAAW,GACXQ,WAAY,GAEVltC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIohC,UAAYr0B,EAAO/O,SACvB,MAEJ,KAAK,GACDgC,EAAI4hC,WAAa70B,EAAOjP,SACxB,MAEJ,KAAK,GACDkC,EAAI6hC,WAAa90B,EAAO/O,SACxB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX6B,EAAwBh/B,OAAU3C,GACvB89B,GAAc99B,EAAK2hC,EAAwB7M,SAEtD6M,EAAwBl4B,OAAS,CAACxM,EAAKstB,IAC5BsK,EAAc53B,EAAK0kC,EAAwB7M,QAASvK,EAElE,CA7DD,CA6DG,KAA4B,GAA0B,CAAC,IAE1D,SAAW6T,GACP,IAAI0B,EACJ1B,EAAYtJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEiB,MAAnB1Q,EAAI8hC,cACJtgC,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAO3C,EAAI8hC,YAAatgC,IAEzB,MAAnBxB,EAAIwhC,cACJhgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIwhC,eAEY,IAAzBjX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI8hC,YAAc,GAAYhN,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAClE8iC,OAAQrW,EAAKqW,QAAQkB,cAEzB,MAEJ,KAAK,EACD9hC,EAAIwhC,YAAcz0B,EAAO/O,SACzB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX1B,EAAYz7B,OAAU3C,GACX89B,GAAc99B,EAAKo+B,EAAYtJ,SAE1CsJ,EAAY30B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKmhC,EAAYtJ,QAASvK,EAEtD,CApDD,CAoDG,KAAgB,GAAc,CAAC,IAElC,SAAW0T,GACP,IAAI6B,EACJ7B,EAAenJ,MAAQ,KACL,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAI+/B,OAAiB//B,EAAI+/B,MAAM9hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI+/B,QAEO,MAAlB//B,EAAIggC,YAAsBhgC,EAAIggC,WAAW/hC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,aAEE,MAAbhgC,EAAIigC,OAAiBjgC,EAAIigC,MAAMhiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,QAEG,MAAdjgC,EAAIkgC,QAAkBlgC,EAAIkgC,OAAOjiC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,SAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEM,MAAjBngC,EAAIogC,WAAqBpgC,EAAIogC,UAAUniC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,YAEU,MAArBpgC,EAAIqgC,eAAyBrgC,EAAIqgC,cAAcpiC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,iBAEa,IAAzB9V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+/B,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B3rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI+/B,MAAQhzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIggC,WAAajzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIigC,MAAQlzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIkgC,OAASnzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,UAAYrzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIqgC,cAAgBtzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX7B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI4B,EACJ5B,EAAYpJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIugC,SAAmBvgC,EAAIugC,QAAQtiC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIugC,UAES,MAApBvgC,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,eAEE,MAAf5/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIwgC,YACJh/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIwgC,YAED,MAAZxgC,EAAIygC,OACJj/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIygC,OAEU,MAAtBzgC,EAAI0gC,iBACJl/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI0gC,eAAgBl/B,IAEjC,MAAjBxB,EAAI2gC,YACJn/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI2gC,aAEc,IAAzBpW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRugC,QAAS,EAAgB,GACzBX,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIugC,QAAUxzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI4/B,aAAe7yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIwgC,UAAYzzB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIygC,KAAO1zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI0gC,eAAiB,GAAe5L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE8iC,OAAQrW,EAAKqW,QAAQF,iBAEzB,MAEJ,KAAK,GACD1gC,EAAI2gC,UAAY5zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX5B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,ICxZlC,SAAWiU,GACP,IAAIsB,EACJtB,EAAY1J,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEkB,MAAnB1Q,EAAIwhC,aAA2C,KAApBxhC,EAAIwhC,cAChChgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIwhC,cAEE,MAAfxhC,EAAI/F,UACJuH,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAO3C,EAAI/F,QAASuH,KAEf,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRwhC,YAAa,IAEX9sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIwhC,YAAcz0B,EAAO/O,SACzB,MAEJ,KAAK,EACDgC,EAAI/F,QAAU,GAAY66B,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9D8iC,OAAQrW,EAAKqW,QAAQ3mC,UAEzB,MAEJ,QACI8S,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXtB,EAAY77B,OAAU3C,GACX89B,GAAc99B,EAAKw+B,EAAY1J,SAE1C0J,EAAY/0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKuhC,EAAY1J,QAASvK,EAEtD,CAtDD,CAsDGiU,KAAgBA,GAAc,CAAC,IAElC,SAAWC,GACP,IAAIqB,EACJrB,EAAa3J,MAAQ,KACH,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAI+hC,YAAuC,IAAlB/hC,EAAI+hC,YAC9BvgC,EAAE1D,OAAO,GACT0D,EAAEwO,KAAKhQ,EAAI+hC,YAEC,MAAZ/hC,EAAIgiC,OACJxgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIgiC,QAEY,IAAzBzX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+hC,WAAW,GAETrtC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI+hC,UAAYh1B,EAAOiD,OACvB,MAEJ,KAAK,EACDhQ,EAAIgiC,KAAOj1B,EAAO/O,SAClB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXrB,EAAa97B,OAAU3C,GACZ89B,GAAc99B,EAAKy+B,EAAa3J,SAE3C2J,EAAah1B,OAAS,CAACxM,EAAKstB,IACjBsK,EAAc53B,EAAKwhC,EAAa3J,QAASvK,EAEvD,CApDD,CAoDGkU,KAAiBA,GAAe,CAAC,IAEpC,SAAWwD,GACP,IAAInC,EACJmC,EAAQnN,MAAQ,KACE,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIohC,WAAuC,KAAlBphC,EAAIohC,YAC9B5/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIohC,YAEE,MAAfphC,EAAIynB,UACJjmB,EAAE1D,OAAO,IACT0gC,GAAY1J,QAAQnyB,OAAO3C,EAAIynB,QAASjmB,IAExB,MAAhBxB,EAAI8d,WACJtc,EAAE1D,OAAO,IACT2gC,GAAa3J,QAAQnyB,OAAO3C,EAAI8d,SAAUtc,KAEjB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRohC,UAAW,IAET1sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIohC,UAAYr0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIynB,QAAU+W,GAAY1J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9D8iC,OAAQrW,EAAKqW,QAAQnZ,UAEzB,MAEJ,KAAK,EACDznB,EAAI8d,SAAW2gB,GAAa3J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAChE8iC,OAAQrW,EAAKqW,QAAQ9iB,WAEzB,MAEJ,QACI/Q,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXmC,EAAQt/B,OAAU3C,GACP89B,GAAc99B,EAAKiiC,EAAQnN,SAEtCmN,EAAQx4B,OAAS,CAACxM,EAAKstB,IACZsK,EAAc53B,EAAKglC,EAAQnN,QAASvK,EAElD,CAhED,CAgEG,KAAY,GAAU,CAAC,IAE1B,SAAW0T,GACP,IAAI6B,EACJ7B,EAAenJ,MAAQ,KACL,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAI+/B,OAAiB//B,EAAI+/B,MAAM9hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI+/B,QAEO,MAAlB//B,EAAIggC,YAAsBhgC,EAAIggC,WAAW/hC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,aAEE,MAAbhgC,EAAIigC,OAAiBjgC,EAAIigC,MAAMhiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,QAEG,MAAdjgC,EAAIkgC,QAAkBlgC,EAAIkgC,OAAOjiC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,SAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEM,MAAjBngC,EAAIogC,WAAqBpgC,EAAIogC,UAAUniC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,YAEU,MAArBpgC,EAAIqgC,eAAyBrgC,EAAIqgC,cAAcpiC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,iBAEa,IAAzB9V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+/B,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B3rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI+/B,MAAQhzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIggC,WAAajzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIigC,MAAQlzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIkgC,OAASnzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,UAAYrzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIqgC,cAAgBtzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX7B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI4B,EACJ5B,EAAYpJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIugC,SAAmBvgC,EAAIugC,QAAQtiC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIugC,UAES,MAApBvgC,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,eAEE,MAAf5/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIwgC,YACJh/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIwgC,YAED,MAAZxgC,EAAIygC,OACJj/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIygC,OAEU,MAAtBzgC,EAAI0gC,iBACJl/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI0gC,eAAgBl/B,IAEjC,MAAjBxB,EAAI2gC,YACJn/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI2gC,aAEc,IAAzBpW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRugC,QAAS,EAAgB,GACzBX,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIugC,QAAUxzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI4/B,aAAe7yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIwgC,UAAYzzB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIygC,KAAO1zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI0gC,eAAiB,GAAe5L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE8iC,OAAQrW,EAAKqW,QAAQF,iBAEzB,MAEJ,KAAK,GACD1gC,EAAI2gC,UAAY5zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX5B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,ICnXlC,SAAWmU,GACP,IAAIoB,EACJpB,EAAoB5J,MAAQ,KACV,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEiB,MAAnB1Q,EAAIkiC,cACJ1gC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkiC,cAEG,MAAfliC,EAAI/F,UACJuH,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAO3C,EAAI/F,QAASuH,IAErB,MAAnBxB,EAAIwhC,cACJhgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIwhC,eAEY,IAAzBjX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIkiC,YAAcn1B,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAI/F,QAAU,GAAY66B,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9D8iC,OAAQrW,EAAKqW,QAAQ3mC,UAEzB,MAEJ,KAAK,EACD+F,EAAIwhC,YAAcz0B,EAAO/O,SACzB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXpB,EAAoB/7B,OAAU3C,GACnB89B,GAAc99B,EAAK0+B,EAAoB5J,SAElD4J,EAAoBj1B,OAAS,CAACxM,EAAKstB,IACxBsK,EAAc53B,EAAKyhC,EAAoB5J,QAASvK,EAE9D,CA5DD,CA4DGmU,KAAwBA,GAAsB,CAAC,IAElD,SAAWyD,GACP,IAAIrC,EACJqC,EAAkBrN,MAAQ,KACR,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIohC,WAAuC,KAAlBphC,EAAIohC,YAC9B5/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIohC,YAEO,MAAnBphC,EAAIoiC,cAA2C,IAApBpiC,EAAIoiC,cAChC5gC,EAAE1D,OAAO,IACT0D,EAAEwO,KAAKhQ,EAAIoiC,cAEQ,MAAnBpiC,EAAIwhC,cACJhgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIwhC,cAEQ,MAArBxhC,EAAIyhC,cACJ,IAAK,MAAMh1C,KAASuT,EAAIyhC,cACpBjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAWjB,GARqB,MAAjBuT,EAAIqiC,YACJ7gC,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIqiC,YAEE,MAAfriC,EAAIsiC,UACJ9gC,EAAE1D,OAAO,KACT0D,EAAEuO,OAAO/P,EAAIsiC,UAEQ,MAArBtiC,EAAIuiC,cACJ,IAAK,MAAM91C,KAASuT,EAAIuiC,cACpB/gC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAM9P,GAGY,MAAxBuT,EAAIwiC,mBACJhhC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAMyD,EAAIwiC,mBAEc,MAAzBxiC,EAAIyiC,oBAAuD,IAA1BziC,EAAIyiC,oBACtCjhC,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAIyiC,oBAEY,MAAvBziC,EAAI0iC,kBACJlhC,EAAE1D,OAAO,KACT0D,EAAEqO,OAAO7P,EAAI0iC,mBAEY,IAAzBnY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRohC,UAAW,GACXgB,aAAa,EACbX,cAAe,GACfc,cAAe,GACfE,mBAAmB,GAEjB/tC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIohC,UAAYr0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIoiC,YAAcr1B,EAAOiD,OACzB,MAEJ,KAAK,GACDhQ,EAAIwhC,YAAcz0B,EAAO/O,SACzB,MAEJ,KAAK,GACD,GAAkC,MAA9BusB,EAAKqW,QAAQa,eAAyBzhC,EAAIyhC,cAAcvyC,SAAWq7B,EAAKqW,OAAOa,cAC/E,MAAM,IAAInC,GAAe,kEAE7Bt/B,EAAIyhC,cAAcxzC,KAAK8e,EAAO/O,UAC9B,MAEJ,KAAK,GACDgC,EAAIqiC,UAAYt1B,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIsiC,QAAUv1B,EAAOgD,SACrB,MAEJ,KAAK,GACD,GAAkC,MAA9Bwa,EAAKqW,QAAQ2B,eAAyBviC,EAAIuiC,cAAcrzC,SAAWq7B,EAAKqW,OAAO2B,cAC/E,MAAM,IAAIjD,GAAe,kEAE7Bt/B,EAAIuiC,cAAct0C,KAAK8e,EAAOxQ,SAC9B,MAEJ,KAAK,GACDyD,EAAIwiC,iBAAmBz1B,EAAOxQ,QAC9B,MAEJ,KAAK,GACDyD,EAAIyiC,kBAAoB11B,EAAOiD,OAC/B,MAEJ,KAAK,GACDhQ,EAAI0iC,gBAAkB31B,EAAO8C,SAC7B,MAEJ,QACI9C,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXqC,EAAkBx/B,OAAU3C,GACjB89B,GAAc99B,EAAKmiC,EAAkBrN,SAEhDqN,EAAkB14B,OAAS,CAACxM,EAAKstB,IACtBsK,EAAc53B,EAAKklC,EAAkBrN,QAASvK,EAE5D,CAlID,CAkIG,KAAsB,GAAoB,CAAC,IAE9C,SAAWoY,GACP,IAAI7C,EACJ6C,EAAmB7N,MAAQ,KACT,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIohC,WAAuC,KAAlBphC,EAAIohC,YAC9B5/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIohC,YAEK,MAAlBphC,EAAI4hC,aACJpgC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAI4hC,aAEK,MAAlB5hC,EAAI6hC,aACJrgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6hC,aAEG,MAAhB7hC,EAAIkhC,SACJ,IAAK,MAAMz0C,KAASuT,EAAIkhC,SACpB1/B,EAAE1D,OAAO,KACT4gC,GAAoB5J,QAAQnyB,OAAOlW,EAAO+U,GAGtB,MAAxBxB,EAAIwiC,mBACJhhC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAMyD,EAAIwiC,oBAEa,IAAzBjY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRohC,UAAW,GACXF,SAAU,IAERxsC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIohC,UAAYr0B,EAAO/O,SACvB,MAEJ,KAAK,GACDgC,EAAI4hC,WAAa70B,EAAOjP,SACxB,MAEJ,KAAK,GACDkC,EAAI6hC,WAAa90B,EAAO/O,SACxB,MAEJ,KAAK,GACD,GAA6B,MAAzBusB,EAAKqW,QAAQM,UAAoBlhC,EAAIkhC,SAAShyC,SAAWq7B,EAAKqW,OAAOM,SACrE,MAAM,IAAI5B,GAAe,6DAE7Bt/B,EAAIkhC,SAASjzC,KAAKywC,GAAoB5J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC1E8iC,OAAQrW,EAAKqW,QAAQO,aAEzB,MAEJ,KAAK,GACDnhC,EAAIwiC,iBAAmBz1B,EAAOxQ,QAC9B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX6C,EAAmBhgC,OAAU3C,GAClB89B,GAAc99B,EAAK2iC,EAAmB7N,SAEjD6N,EAAmBl5B,OAAS,CAACxM,EAAKstB,IACvBsK,EAAc53B,EAAK0lC,EAAmB7N,QAASvK,EAE7D,CApFD,CAoFG,KAAuB,GAAqB,CAAC,IAEhD,SAAW0T,GACP,IAAI6B,EACJ7B,EAAenJ,MAAQ,KACL,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAI+/B,OAAiB//B,EAAI+/B,MAAM9hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI+/B,QAEO,MAAlB//B,EAAIggC,YAAsBhgC,EAAIggC,WAAW/hC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,aAEE,MAAbhgC,EAAIigC,OAAiBjgC,EAAIigC,MAAMhiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,QAEG,MAAdjgC,EAAIkgC,QAAkBlgC,EAAIkgC,OAAOjiC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,SAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEM,MAAjBngC,EAAIogC,WAAqBpgC,EAAIogC,UAAUniC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,YAEU,MAArBpgC,EAAIqgC,eAAyBrgC,EAAIqgC,cAAcpiC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,iBAEa,IAAzB9V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+/B,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B3rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI+/B,MAAQhzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIggC,WAAajzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIigC,MAAQlzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIkgC,OAASnzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,UAAYrzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIqgC,cAAgBtzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX7B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI4B,EACJ5B,EAAYpJ,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIugC,SAAmBvgC,EAAIugC,QAAQtiC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIugC,UAES,MAApBvgC,EAAI4/B,cAA6C,KAArB5/B,EAAI4/B,eACjCp+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI4/B,eAEE,MAAf5/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIwgC,YACJh/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIwgC,YAED,MAAZxgC,EAAIygC,OACJj/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIygC,OAEU,MAAtBzgC,EAAI0gC,iBACJl/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI0gC,eAAgBl/B,IAEjC,MAAjBxB,EAAI2gC,YACJn/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI2gC,aAEc,IAAzBpW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRugC,QAAS,EAAgB,GACzBX,aAAc,IAEZlrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIugC,QAAUxzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI4/B,aAAe7yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIwgC,UAAYzzB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIygC,KAAO1zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI0gC,eAAiB,GAAe5L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE8iC,OAAQrW,EAAKqW,QAAQF,iBAEzB,MAEJ,KAAK,GACD1gC,EAAI2gC,UAAY5zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX5B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,IC5dlC,SAAWoU,GACP,IAAImB,EACJnB,EAAS7J,MAAQ,KACC,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAES,MAAX1Q,EAAI4iC,MACJphC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI4iC,OAEa,IAAzBrY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACXwiC,IAAQ,GACP,EACDtgC,EAAI4iC,IAAM71B,EAAOxQ,QAIjBwQ,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXnB,EAASh8B,OAAU3C,GACR89B,GAAc99B,EAAK2+B,EAAS7J,SAEvC6J,EAASl1B,OAAS,CAACxM,EAAKstB,IACbsK,EAAc53B,EAAK0hC,EAAS7J,QAASvK,EAEnD,CA1CD,CA0CGoU,KAAaA,GAAW,CAAC,IAE5B,SAAWC,GACP,IAAIkB,EACJlB,EAAkB9J,MAAQ,KACR,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAhB1Q,EAAI6iC,WACJrhC,EAAE1D,OAAO,GACT0D,EAAEqO,OAAO7P,EAAI6iC,YAEY,IAAzBtY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACXwiC,IAAQ,GACP,EACDtgC,EAAI6iC,SAAW91B,EAAO8C,SAItB9C,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXlB,EAAkBj8B,OAAU3C,GACjB89B,GAAc99B,EAAK4+B,EAAkB9J,SAEhD8J,EAAkBn1B,OAAS,CAACxM,EAAKstB,IACtBsK,EAAc53B,EAAK2hC,EAAkB9J,QAASvK,EAE5D,CA1CD,CA0CGqU,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACP,IAAIiB,EACJjB,EAAqB/J,MAAQ,KACX,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAI8iC,UACJ,IAAK,MAAMr2C,KAASuT,EAAI8iC,UACpBthC,EAAE1D,OAAO,IACT6gC,GAAS7J,QAAQnyB,OAAOlW,EAAO+U,IAGV,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR8iC,UAAW,IAETpuC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,GAAQwiC,IAAQ,GACP,EAAL,CACI,GAA8B,MAA1B/V,EAAKqW,QAAQkC,WAAqB9iC,EAAI8iC,UAAU5zC,SAAWq7B,EAAKqW,OAAOkC,UACvE,MAAM,IAAIxD,GAAe,8DAE7Bt/B,EAAI8iC,UAAU70C,KAAK0wC,GAAS7J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAChE8iC,OAAQrW,EAAKqW,QAAQmC,aAG7B,MAEIh2B,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXjB,EAAqBl8B,OAAU3C,GACpB89B,GAAc99B,EAAK6+B,EAAqB/J,SAEnD+J,EAAqBp1B,OAAS,CAACxM,EAAKstB,IACzBsK,EAAc53B,EAAK4hC,EAAqB/J,QAASvK,EAE/D,CAnDD,CAmDGsU,KAAyBA,GAAuB,CAAC,IAEpD,SAAWmE,GACP,IAAIlD,EACJkD,EAAgBlO,MAAQ,KACN,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEW,MAAb1Q,EAAIijC,QACJzhC,EAAE1D,OAAO,IACT8gC,GAAkB9J,QAAQnyB,OAAO3C,EAAIijC,MAAOzhC,IAE5B,MAAhBxB,EAAI8d,WACJtc,EAAE1D,OAAO,IACT+gC,GAAqB/J,QAAQnyB,OAAO3C,EAAI8d,SAAUtc,KAEzB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIijC,MAAQrE,GAAkB9J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAClE8iC,OAAQrW,EAAKqW,QAAQqC,QAEzB,MAEJ,KAAK,EACDjjC,EAAI8d,SAAW+gB,GAAqB/J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE8iC,OAAQrW,EAAKqW,QAAQ9iB,WAEzB,MAEJ,QACI/Q,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXkD,EAAgBrgC,OAAU3C,GACf89B,GAAc99B,EAAKgjC,EAAgBlO,SAE9CkO,EAAgBv5B,OAAS,CAACxM,EAAKstB,IACpBsK,EAAc53B,EAAK+lC,EAAgBlO,QAASvK,EAE1D,CAtDD,CAsDG,KAAoB,GAAkB,CAAC,ICnM1C,SAAWuU,GACP,IAAIgB,EACJhB,EAAoBhK,MAAQ,KACV,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAQ9B,IAP6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAIkjC,YACJ1hC,EAAE1D,OAAO,GACT0D,EAAE1D,OAAOkC,EAAIkjC,YAEC,MAAdljC,EAAImjC,OACJ,IAAK,MAAM12C,KAASuT,EAAImjC,OACpB3hC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOrR,IAGY,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRmjC,OAAQ,IAENzuC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIkjC,UAAYn2B,EAAOjP,SACvB,MAEJ,KAAK,EACD,GAA2B,MAAvBysB,EAAKqW,QAAQuC,QAAkBnjC,EAAImjC,OAAOj0C,SAAWq7B,EAAKqW,OAAOuC,OACjE,MAAM,IAAI7D,GAAe,2DAE7Bt/B,EAAImjC,OAAOl1C,KAAK8e,EAAOjP,UACvB,MAEJ,QACIiP,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXhB,EAAoBn8B,OAAU3C,GACnB89B,GAAc99B,EAAK8+B,EAAoBhK,SAElDgK,EAAoBr1B,OAAS,CAACxM,EAAKstB,IACxBsK,EAAc53B,EAAK6hC,EAAoBhK,QAASvK,EAE9D,CAzDD,CAyDGuU,KAAwBA,GAAsB,CAAC,IAElD,SAAWC,GACP,IAAIe,EACJf,EAAqBjK,MAAQ,KACX,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAQ9B,IAP6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAIkjC,YACJ1hC,EAAE1D,OAAO,GACT0D,EAAE1D,OAAOkC,EAAIkjC,YAEC,MAAdljC,EAAImjC,OACJ,IAAK,MAAM12C,KAASuT,EAAImjC,OACpB3hC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOrR,IAGY,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRmjC,OAAQ,IAENzuC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIkjC,UAAYn2B,EAAOjP,SACvB,MAEJ,KAAK,EACD,GAA2B,MAAvBysB,EAAKqW,QAAQuC,QAAkBnjC,EAAImjC,OAAOj0C,SAAWq7B,EAAKqW,OAAOuC,OACjE,MAAM,IAAI7D,GAAe,2DAE7Bt/B,EAAImjC,OAAOl1C,KAAK8e,EAAOjP,UACvB,MAEJ,QACIiP,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXf,EAAqBp8B,OAAU3C,GACpB89B,GAAc99B,EAAK++B,EAAqBjK,SAEnDiK,EAAqBt1B,OAAS,CAACxM,EAAKstB,IACzBsK,EAAc53B,EAAK8hC,EAAqBjK,QAASvK,EAE/D,CAzDD,CAyDGwU,KAAyBA,GAAuB,CAAC,ICpHpD,SAAWC,GACP,IAAIc,EACJd,EAAWlK,MAAQ,KACD,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIojC,WAAuC,KAAlBpjC,EAAIojC,YAC9B5hC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIojC,YAEK,MAAjBpjC,EAAIqjC,WAAuC,KAAlBrjC,EAAIqjC,YAC9B7hC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqjC,YAEW,MAAxBrjC,EAAIsjC,mBACJ9hC,EAAE1D,OAAO,IACT0D,EAAEmO,MAAM3P,EAAIsjC,mBAES,MAArBtjC,EAAIujC,cACJ,IAAK,MAAM92C,KAASuT,EAAIujC,cACpB/hC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAGM,MAAnBuT,EAAIwjC,cACJhiC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwjC,cAEG,MAAfxjC,EAAIyjC,UACJjiC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAMyD,EAAIyjC,WAEa,IAAzBlZ,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRojC,UAAW,GACXC,UAAW,GACXE,cAAe,IAEb7uC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIojC,UAAYr2B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIqjC,UAAYt2B,EAAO/O,SACvB,MAEJ,KAAK,GACDgC,EAAIsjC,iBAAmBv2B,EAAO4C,QAC9B,MAEJ,KAAK,GACD,GAAkC,MAA9B4a,EAAKqW,QAAQ2C,eAAyBvjC,EAAIujC,cAAcr0C,SAAWq7B,EAAKqW,OAAO2C,cAC/E,MAAM,IAAIjE,GAAe,kEAE7Bt/B,EAAIujC,cAAct1C,KAAK8e,EAAO/O,UAC9B,MAEJ,KAAK,GACDgC,EAAIwjC,YAAcz2B,EAAOxQ,QACzB,MAEJ,KAAK,GACDyD,EAAIyjC,QAAU12B,EAAOxQ,QACrB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXd,EAAWr8B,OAAU3C,GACV89B,GAAc99B,EAAKg/B,EAAWlK,SAEzCkK,EAAWv1B,OAAS,CAACxM,EAAKstB,IACfsK,EAAc53B,EAAK+hC,EAAWlK,QAASvK,EAErD,CA3FD,CA2FGyU,KAAeA,GAAa,CAAC,IO7FhC,SAAS0E,GAAQziC,GACb,IAAKjJ,OAAO2rC,cAAc1iC,IAAMA,EAAI,EAChC,MAAM,IAAIhV,MAAM,kCAAoCgV,EAC5D,CAMA,SAAS,GAAOoN,KAAMu1B,GAClB,MALax1B,EAKAC,aAJO3Q,YAAe4B,YAAYW,OAAOmO,IAA6B,eAAvBA,EAAErR,YAAYvO,MAKtE,MAAM,IAAIvC,MAAM,uBANxB,IAAiBmiB,EAOb,GAAIw1B,EAAQ10C,OAAS,IAAM00C,EAAQnrB,SAASpK,EAAEnf,QAC1C,MAAM,IAAIjD,MAAM,iCAAmC23C,EAAU,gBAAkBv1B,EAAEnf,OACzF,CAEA,SAAS20C,GAAMtgC,GACX,GAAiB,mBAANA,GAAwC,mBAAbA,EAAElX,OACpC,MAAM,IAAIJ,MAAM,mDACpBy3C,GAAQngC,EAAEugC,WACVJ,GAAQngC,EAAEwgC,SACd,CAEA,SAASC,GAAQC,EAAUC,GAAgB,GACvC,GAAID,EAASE,UACT,MAAM,IAAIl4C,MAAM,oCACpB,GAAIi4C,GAAiBD,EAASG,SAC1B,MAAM,IAAIn4C,MAAM,wCACxB,CCjCO,MAAM,GAA+B,iBAAfo5B,YAA2B,WAAYA,WAAaA,WAAWwV,YAASluC,EC0B9F,SAAS03C,GAAWC,GACvB,OAAO,IAAIC,SAASD,EAAInkC,OAAQmkC,EAAItP,WAAYsP,EAAIrmC,WACxD,CAEO,SAASumC,GAAKC,EAAM1uC,GACvB,OAAQ0uC,GAAS,GAAK1uC,EAAW0uC,IAAS1uC,CAC9C,CAoHO,SAAS2uC,GAAQtN,GAIpB,MAHoB,iBAATA,IACPA,EAZD,SAAqB5jC,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvH,MAAM,2CAA6CuH,GACjE,OAAO,IAAIkK,YAAW,IAAI87B,aAAc72B,OAAOnP,GACnD,CAQe,CAAY4jC,IACvB,GAAOA,GACAA,CACX,CA9FqC,mBAA9B15B,WAAWsO,KAAK,IAAI24B,OAA+BjnC,WAAWknC,QAkH9D,MAAMC,GAET,KAAAjf,GACI,OAAOn4B,KAAKq3C,YAChB,EASG,SAAS,GAAgBC,GAC5B,MAAMC,EAASC,GAAQF,IAAWx4C,OAAOm4C,GAAQO,IAAM3hC,SACjD4hC,EAAMH,IAIZ,OAHAC,EAAMlB,UAAYoB,EAAIpB,UACtBkB,EAAMjB,SAAWmB,EAAInB,SACrBiB,EAAM34C,OAAS,IAAM04C,IACdC,CACX,CAkBO,SAAS,GAAYG,EAAc,IACtC,GAAI,IAA4C,mBAA3B,GAAOC,gBACxB,OAAO,GAAOA,gBAAgB,IAAI1nC,WAAWynC,IAGjD,GAAI,IAAwC,mBAAvB,GAAOE,YACxB,OAAO3nC,WAAWsO,KAAK,GAAOq5B,YAAYF,IAE9C,MAAM,IAAIl5C,MAAM,yCACpB,CCpMO,SAASq5C,GAAIl3B,EAAGC,EAAGzZ,GACtB,OAAQwZ,EAAIC,EAAMD,EAAIxZ,EAAMyZ,EAAIzZ,CACpC,CAKO,MAAM2wC,WAAeV,GACxB,WAAA9nC,CAAYgnC,EAAUD,EAAW0B,EAAWC,GACxC5H,QACApwC,KAAK22C,UAAW,EAChB32C,KAAKyB,OAAS,EACdzB,KAAK8G,IAAM,EACX9G,KAAK02C,WAAY,EACjB12C,KAAKs2C,SAAWA,EAChBt2C,KAAKq2C,UAAYA,EACjBr2C,KAAK+3C,UAAYA,EACjB/3C,KAAKg4C,KAAOA,EACZh4C,KAAK0S,OAAS,IAAIzC,WAAWqmC,GAC7Bt2C,KAAKi4C,KAAOrB,GAAW52C,KAAK0S,OAChC,CACA,MAAA5T,CAAO6qC,GACH4M,GAAQv2C,MACR,MAAM,KAAEi4C,EAAI,OAAEvlC,EAAM,SAAE4jC,GAAat2C,KAE7BoC,GADNunC,EAAOsN,GAAQtN,IACEloC,OACjB,IAAK,IAAIqF,EAAM,EAAGA,EAAM1E,GAAM,CAC1B,MAAM81C,EAAOjvC,KAAKC,IAAIotC,EAAWt2C,KAAK8G,IAAK1E,EAAM0E,GAEjD,GAAIoxC,IAAS5B,EAMb5jC,EAAOpT,IAAIqqC,EAAK1nB,SAASnb,EAAKA,EAAMoxC,GAAOl4C,KAAK8G,KAChD9G,KAAK8G,KAAOoxC,EACZpxC,GAAOoxC,EACHl4C,KAAK8G,MAAQwvC,IACbt2C,KAAKoR,QAAQ6mC,EAAM,GACnBj4C,KAAK8G,IAAM,OAXf,CACI,MAAMqxC,EAAWvB,GAAWjN,GAC5B,KAAO2M,GAAYl0C,EAAM0E,EAAKA,GAAOwvC,EACjCt2C,KAAKoR,QAAQ+mC,EAAUrxC,EAE/B,CAQJ,CAGA,OAFA9G,KAAKyB,QAAUkoC,EAAKloC,OACpBzB,KAAKo4C,aACEp4C,IACX,CACA,UAAAq4C,CAAWxO,GACP0M,GAAQv2C,MHrChB,SAAiB6pC,EAAK2M,GAClB,GAAO3M,GACP,MAAM3gC,EAAMstC,EAASH,UACrB,GAAIxM,EAAIpoC,OAASyH,EACb,MAAM,IAAI1K,MAAM,yDAA2D0K,EAEnF,CGgCQovC,CAAQzO,EAAK7pC,MACbA,KAAK22C,UAAW,EAIhB,MAAM,OAAEjkC,EAAM,KAAEulC,EAAI,SAAE3B,EAAQ,KAAE0B,GAASh4C,KACzC,IAAI,IAAE8G,GAAQ9G,KAEd0S,EAAO5L,KAAS,IAChB9G,KAAK0S,OAAOuP,SAASnb,GAAKyxC,KAAK,GAG3Bv4C,KAAK+3C,UAAYzB,EAAWxvC,IAC5B9G,KAAKoR,QAAQ6mC,EAAM,GACnBnxC,EAAM,GAGV,IAAK,IAAIvF,EAAIuF,EAAKvF,EAAI+0C,EAAU/0C,IAC5BmR,EAAOnR,GAAK,GApFjB,SAAsB02C,EAAM1Q,EAAYvoC,EAAOg5C,GAClD,GAAiC,mBAAtBC,EAAKO,aACZ,OAAOP,EAAKO,aAAajR,EAAYvoC,EAAOg5C,GAChD,MAAMS,EAAOxS,OAAO,IACdyS,EAAWzS,OAAO,YAClB0S,EAAKpuC,OAAQvL,GAASy5C,EAAQC,GAC9BE,EAAKruC,OAAOvL,EAAQ05C,GACpB5iC,EAAIkiC,EAAO,EAAI,EACfx2C,EAAIw2C,EAAO,EAAI,EACrBC,EAAKY,UAAUtR,EAAazxB,EAAG6iC,EAAIX,GACnCC,EAAKY,UAAUtR,EAAa/lC,EAAGo3C,EAAIZ,EACvC,CA6EQQ,CAAaP,EAAM3B,EAAW,EAAGrQ,OAAqB,EAAdjmC,KAAKyB,QAAau2C,GAC1Dh4C,KAAKoR,QAAQ6mC,EAAM,GACnB,MAAMa,EAAQlC,GAAW/M,GACnBznC,EAAMpC,KAAKq2C,UAEjB,GAAIj0C,EAAM,EACN,MAAM,IAAI5D,MAAM,+CACpB,MAAMu6C,EAAS32C,EAAM,EACf42C,EAAQh5C,KAAKZ,MACnB,GAAI25C,EAASC,EAAMv3C,OACf,MAAM,IAAIjD,MAAM,sCACpB,IAAK,IAAI+C,EAAI,EAAGA,EAAIw3C,EAAQx3C,IACxBu3C,EAAMD,UAAU,EAAIt3C,EAAGy3C,EAAMz3C,GAAIy2C,EACzC,CACA,MAAAniC,GACI,MAAM,OAAEnD,EAAM,UAAE2jC,GAAcr2C,KAC9BA,KAAKq4C,WAAW3lC,GAChB,MAAMkzB,EAAMlzB,EAAOxR,MAAM,EAAGm1C,GAE5B,OADAr2C,KAAKyL,UACEm6B,CACX,CACA,UAAAyR,CAAW4B,GACPA,IAAOA,EAAK,IAAIj5C,KAAKsP,aACrB2pC,EAAG35C,OAAOU,KAAKZ,OACf,MAAM,SAAEk3C,EAAQ,OAAE5jC,EAAM,OAAEjR,EAAM,SAAEk1C,EAAQ,UAAED,EAAS,IAAE5vC,GAAQ9G,KAO/D,OANAi5C,EAAGx3C,OAASA,EACZw3C,EAAGnyC,IAAMA,EACTmyC,EAAGtC,SAAWA,EACdsC,EAAGvC,UAAYA,EACXj1C,EAAS60C,GACT2C,EAAGvmC,OAAOpT,IAAIoT,GACXumC,CACX,EClHJ,MAAMC,GAA2B,IAAItjC,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,aAIlFujC,GAA4B,IAAIvjC,YAAY,CAC9C,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAMlFwjC,GAA2B,IAAIxjC,YAAY,IAC1C,MAAMyjC,WAAevB,GACxB,WAAAxoC,CAAY+mC,EAAY,IACpBjG,MAAM,GAAIiG,EAAW,GAAG,GAGxBr2C,KAAKs5C,EAAmB,EAAfH,GAAU,GACnBn5C,KAAKu5C,EAAmB,EAAfJ,GAAU,GACnBn5C,KAAKw5C,EAAmB,EAAfL,GAAU,GACnBn5C,KAAKy5C,EAAmB,EAAfN,GAAU,GACnBn5C,KAAK05C,EAAmB,EAAfP,GAAU,GACnBn5C,KAAK25C,EAAmB,EAAfR,GAAU,GACnBn5C,KAAK45C,EAAmB,EAAfT,GAAU,GACnBn5C,KAAK65C,EAAmB,EAAfV,GAAU,EACvB,CACA,GAAA/5C,GACI,MAAM,EAAEk6C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAM75C,KACnC,MAAO,CAACs5C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAAv6C,CAAIg6C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrB75C,KAAKs5C,EAAQ,EAAJA,EACTt5C,KAAKu5C,EAAQ,EAAJA,EACTv5C,KAAKw5C,EAAQ,EAAJA,EACTx5C,KAAKy5C,EAAQ,EAAJA,EACTz5C,KAAK05C,EAAQ,EAAJA,EACT15C,KAAK25C,EAAQ,EAAJA,EACT35C,KAAK45C,EAAQ,EAAJA,EACT55C,KAAK65C,EAAQ,EAAJA,CACb,CACA,OAAAzoC,CAAQ6mC,EAAM/0C,GAEV,IAAK,IAAI3B,EAAI,EAAGA,EAAI,GAAIA,IAAK2B,GAAU,EACnCk2C,GAAS73C,GAAK02C,EAAK6B,UAAU52C,GAAQ,GACzC,IAAK,IAAI3B,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAMw4C,EAAMX,GAAS73C,EAAI,IACnBy4C,EAAKZ,GAAS73C,EAAI,GAClB04C,EAAKlD,GAAKgD,EAAK,GAAKhD,GAAKgD,EAAK,IAAOA,IAAQ,EAC7CG,EAAKnD,GAAKiD,EAAI,IAAMjD,GAAKiD,EAAI,IAAOA,IAAO,GACjDZ,GAAS73C,GAAM24C,EAAKd,GAAS73C,EAAI,GAAK04C,EAAKb,GAAS73C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAE+3C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAM75C,KACjC,IAAK,IAAIuB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM44C,EAAMN,GADG9C,GAAK2C,EAAG,GAAK3C,GAAK2C,EAAG,IAAM3C,GAAK2C,EAAG,ODxD1C/4B,ECyDqB+4B,GAAGC,GDxDrBh5B,ECwDwBi5B,GAAKV,GAAS33C,GAAK63C,GAAS73C,GAAM,EAE/D64C,GADSrD,GAAKuC,EAAG,GAAKvC,GAAKuC,EAAG,IAAMvC,GAAKuC,EAAG,KAC7BzB,GAAIyB,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIU,EAAM,EACfV,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKa,EAAKC,EAAM,CACpB,CDpED,IAAaz5B,ECsEZ24B,EAAKA,EAAIt5C,KAAKs5C,EAAK,EACnBC,EAAKA,EAAIv5C,KAAKu5C,EAAK,EACnBC,EAAKA,EAAIx5C,KAAKw5C,EAAK,EACnBC,EAAKA,EAAIz5C,KAAKy5C,EAAK,EACnBC,EAAKA,EAAI15C,KAAK05C,EAAK,EACnBC,EAAKA,EAAI35C,KAAK25C,EAAK,EACnBC,EAAKA,EAAI55C,KAAK45C,EAAK,EACnBC,EAAKA,EAAI75C,KAAK65C,EAAK,EACnB75C,KAAKV,IAAIg6C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzB,GACIgB,GAASb,KAAK,EAClB,CACA,OAAA9sC,GACIzL,KAAKV,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BU,KAAK0S,OAAO6lC,KAAK,EACrB,EAmBG,MAAM,GAAyB,IAAgB,IAAM,IAAIc,KC7HzD,IAAIgB,GAOA11B,GCPA21B,GAMAC,GAOAC,IDZX,SAAWH,GACPA,EAAiB,MAAI,QACrBA,EAAiB,MAAI,QACrBA,EAAqB,UAAI,YACzBA,EAAkB,OAAI,QACzB,CALD,CAKGA,KAAcA,GAAY,CAAC,IAE9B,SAAW11B,GAOPA,EAA4B,aAAI,gBAMhCA,EAAoC,qBAAI,uBAKxCA,EAA6B,cAAI,mBAOjCA,EAAiC,kBAAI,oBAKrCA,EAAmC,oBAAI,sBAKvCA,EAA2B,YAAI,uBAQ/BA,EAA6B,cAAI,mBAKjCA,EAA6B,cAAI,mBAKjCA,EAA4B,aAAI,kBAKhCA,EAAoC,qBAAI,uBAIxCA,EAA8B,eAAI,iBAKlCA,EAAoC,qBAAI,0BAQxCA,EAAsC,uBAAI,yBAK1CA,EAAsC,uBAAI,wBAC7C,CAjFD,CAiFGA,KAAkBA,GAAgB,CAAC,ICxFtC,SAAW21B,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,kBCepBC,GAJmB,CAC5BjF,UAT8B,EAU9BC,OAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,ICb9B,IAAIiF,GAIAC,GCIJ,SAAS,GAAS9nC,EAAOiS,EAAW,QACvC,MAAMqO,EAAO,GAAMrO,GACnB,GAAY,MAARqO,EACA,MAAM,IAAI50B,MAAM,yBAAyBumB,MAG7C,OAAOqO,EAAKzC,QAAQzb,OAAOpC,GAAOrL,UAAU,EAChD,CCRO,SAAS,GAAWiO,GACvB,MAAmB,iBAARA,EAEA,GADMA,EAAI1P,QAAQ,OAAQ,IACVoU,cAAe,UAEnC1E,CACX,EFZA,SAAWilC,GACPA,EAAuC,aAAI,eAC9C,CAFD,CAEGA,KAA6BA,GAA2B,CAAC,IAE5D,SAAWC,GACPA,EAAwB,UAAI,YAC5BA,EAA+B,iBAAI,mBACnCA,EAAkC,oBAAI,qBACzC,CAJD,CAIGA,KAAiBA,GAAe,CAAC,IEmB7B,MAAM,GAAc9rC,GAAU,GAASA,EAAO,UAIxC+rC,GAAej6B,GAAM,GAASA,EAAG,QAIjC,GAAe7d,GAAM,GAAWA,EAAG,QAIzC,SAAS,GAAO+3C,EAAYC,GAC/B,MAAM34C,EAAM24C,GAAeD,EAAWxQ,QAAO,CAAC0Q,EAAKlyC,IAASkyC,EAAMlyC,EAAKrH,QAAQ,GACzEmkC,EAAM,IAAI31B,WAAW7N,GAC3B,IAAIc,EAAS,EACb,IAAK,MAAM4L,KAASgsC,EAChBlV,EAAItmC,IAAIwP,EAAO5L,GACfA,GAAU4L,EAAMrN,OAEpB,OAAOmkC,CACX,CC3BO,MAoBMqV,GAA2BC,IACpC,GAAI,kBAAmBA,GAAaA,EAAUlH,cAE1C,OAAOryC,MAAM4c,KAAK,IAAI48B,IAAID,EAAUlH,cAAc1vC,KAAK6tC,GAAiBiJ,GAA0BjJ,EAAc+I,EAAUzF,eAEzH,GAAI,WAAYyF,EAAW,CAE5B,QAAyBh8C,IAArBg8C,EAAUxF,OACV,MAAM,IAAIl3C,MAAM,iBACpB,OAAOmD,MAAM4c,KAAK,IAAI48B,IAAID,EAAUxF,OAAOpxC,KAAKuG,GAAU,cAAcqwC,EAAUzF,WJhDxD,KIgD2F5qC,OACzH,CACK,GAAI,gBAAiBqwC,GAAa,YAAaA,EAEhD,MAAO,CACHE,GAA0B,IAAIF,EAAUG,eAAeH,EAAU3N,0BAA2B2N,EAAUzF,YAI1G,MAAM,IAAIj3C,MAAM,qDACpB,EAES88C,GAAgCC,IACzC,MAAMn+B,EAAQm+B,EAAa7zC,MAAM,KACjC,GAAoB,GAAhB0V,EAAM3b,QACO,SAAb2b,EAAM,IACO,MAAbA,EAAM,IACO,OAAbA,EAAM,GACN,MAAM,IAAI5e,MAAM,wBACpB,MAAMi3C,EAAYj3B,SAASpB,EAAM,IAC3Bo+B,EAAQh9B,SAASpB,EAAM,IAC7B,GAAI0jB,MAAM2U,IAAc3U,MAAM0a,GAC1B,MAAM,IAAIh9C,MAAM,8BACpB,MAAO,CACHi3C,YACA+F,QACH,EAEQC,GAA2BF,IACpC,MAAMG,EAAe,IAAIP,IACnBQ,EAAa,IAAIR,IACvB,IAAK,MAAM7H,KAASiI,EAAc,CAC9B,MAAM,UAAE9F,EAAS,MAAE+F,GAAUF,GAA6BhI,GAC1DoI,EAAa1+B,IAAI,GAAGy4B,KAAa+F,KACjCG,EAAW3+B,IAAIy4B,EACnB,CACA,GAA0B,IAAtBiG,EAAaj9C,KACb,MAAM,IAAID,MAAM,mCAEpB,GAAIm9C,EAAWl9C,KAAO,EAClB,MAAM,IAAID,MAAM,6DAIpB,MAAO,CACHi3C,UAHckG,EAAW14C,SAASoF,OAAOrJ,MAIzC02C,OAHW/zC,MAAM4c,KAAKm9B,GAAcp3C,KAAKiwC,GAAS/1B,SAAS+1B,EAAK7sC,MAAM,KAAK,MAI9E,EAIE,SAASk0C,GAA8B7H,EAAa8H,GACvD,IAAKA,EAAiB7wB,SAAS+oB,GAC3B,MAAM,IAAIv1C,MAAM,gBAAgBu1C,sEAAgF8H,8FAExH,CAoDO,SAASC,GAAyB3J,EAAc4J,EAAgB,GACnE,MAAM,YAAEV,EAAW,QAAE9N,GA/ClB,SAAiC4E,GACpC,MAAM/0B,EAAQ+0B,EAAazqC,MAAM,KACjC,GAAI0V,EAAM3b,OAAS,GAAK2b,EAAM3b,OAAS,EACnC,MAAMjD,MAAM,mCAGhB,IAAIw9C,EAAa,EACjB,GAAoB,GAAhB5+B,EAAM3b,OAAa,CAEnB,GADAu6C,EAAax9B,SAASpB,EAAM,IACxB0jB,MAAMkb,GACN,MAAM,IAAIx9C,MAAM,6CAEpB,GAAIw9C,EAAa,EACb,MAAM,IAAIx9C,MAAM,6CAExB,CAEA,MAAM0P,EAASkP,EAAMlS,QAAQ,GAE7B,GAAwB,GAApBgD,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,qCAGpB,GAAwB,GAApB0P,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,iCAGpB,GAAwB,GAApB0P,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,oCAGpB,GAAwB,GAApB0P,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,kCAEpB,MAAO,CACHw9C,aACAX,YAAantC,EAAO,GACpBq/B,QAASr/B,EAAO,GAChB+tC,UAAW/tC,EAAO,GAClB6W,SAAU7W,EAAO,GAEzB,CAMqCguC,CAAwB/J,GACnDt8B,EAAS,GAAO,GAAO,CAAC,GAAYwlC,GAAc,GAAY9N,MAC9D4O,EAAW,IAAIrF,SAASjhC,EAAOnD,OAAOxR,OAAO,IACnD,OAAOqJ,OAAO4xC,EAASC,aAAa,GAAG,GAASnW,OAAO8V,GAC3D,CACO,SAASX,GAA0BjJ,EAAcsD,EJjKtB,EIiKsDsG,EAAgB,GACpG,IAAK5J,EACD,MAAM3zC,MAAM,mCAGhB,MAAO,cAAci3C,KADFqG,GAAyB3J,EAAc4J,IAE9D,CAqBO,SAASM,GAAqBlK,EAErCmK,GACI,MAAmC,iBAAxBA,EACAA,OAE4Bp9C,IAAhCo9C,GAAsBd,MA/KW,CAACN,IACzC,QAAwBh8C,IAApBg8C,EAAUM,MACV,MAAM,IAAIh9C,MAAM,iBACpB,MAAO,cAAc08C,EAAUzF,WJtBD,KIsBoCyF,EAAUM,OAAO,EA6K7Ee,CAA6BD,GAC7BlB,GAA0BjJ,EAAcmK,GAAsB7G,WJpMtC,EIqMlC,CAKO,MC7MM+G,GAAoB1tC,IAI7B,IADAA,EAAQ,IAAImB,WAAWnB,IACbrN,OAAS,EACf,MAAM,IAAIjD,MAAM,qBACpB,MAAMy5C,EAAO,IAAInB,SAAShoC,EAAM4D,QAC1B+iC,EAAYwC,EAAKwE,UAAU,GAC3B/G,EAAS,GACf,GAAqB,MAAjB5mC,EAAMrN,OAEN,IAAK,IAAIF,EAAI,EAAGA,EAAI,KAAMA,IAAK,CAC3B,MAAMm7C,EAAYzzC,KAAK6a,MAAMviB,EAAI,GAAK,EAChCo7C,EAAW,EAAKp7C,EAAI,EACtB02C,EAAK2E,SAASF,GAAc,GAAKC,GACjCjH,EAAOl1C,KAAKe,EAEpB,KAEC,CAED,MAAMs7C,EAAa5E,EAAK2E,SAAS,GACjC,IAAK,IAAIr7C,EAAI,EAAG2B,EAAS,EAAG3B,EAAIs7C,EAAYt7C,IAAK2B,GAAU,EAAG,CAC1D,GAAIA,EAAS,GAAK4L,EAAMrN,OACpB,MAAM,IAAIjD,MAAM,0BACpBk3C,EAAOl1C,KAAKy3C,EAAKwE,UAAUv5C,GAC/B,CACJ,CACA,MAAO,CAAEuyC,YAAWC,SAAQ,EAEnBoH,GAAoB5B,IAC7B,MAAM,UAAEzF,EAAS,OAAEC,GAAWwF,EACxBH,EAAcrF,EAAOj0C,QAAU,GAAK,IAAM,EAAI,EAAIi0C,EAAOj0C,OACzDiR,EAAS,IAAIb,YAAYkpC,GACzB9C,EAAO,IAAInB,SAASpkC,GAE1B,GADAulC,EAAK8E,UAAU,EAAGtH,GACdC,EAAOj0C,QAAU,GAEjB,IAAK,MAAMoJ,KAAS6qC,EAAQ,CACxB,MAAMgH,EAAYzzC,KAAK6a,MAAMjZ,EAAQ,GAAK,EACpC8xC,EAAW,EAAK9xC,EAAQ,EAC9BotC,EAAK+E,SAASN,EAAWzE,EAAK2E,SAASF,GAAc,GAAKC,EAC9D,KAEC,CAED1E,EAAK+E,SAAS,EAAGtH,EAAOj0C,QACxB,IAAK,IAAIF,EAAI,EAAG2B,EAAS,EAAG3B,EAAIm0C,EAAOj0C,OAAQF,IAAK2B,GAAU,EAC1D+0C,EAAK8E,UAAU75C,EAAQwyC,EAAOn0C,GAEtC,CACA,OAAO,IAAI0O,WAAWyC,EAAO,mCClDjC,MAAMuqC,GAAW,OACV,MAAMC,GACTC,MACAC,MACAC,OACA,2BAAOC,CAAqBC,EAAO79C,GAC/B,OAAOA,EAAS,GAAGu9C,MAAYM,KAAS79C,IAAW,GAAGu9C,MAAYM,GACtE,CACA,WAAAjuC,CAAY5P,GACRM,KAAKm9C,MAAQ,GAAMD,GAAOI,qBAAqB,OAAQ59C,IACvDM,KAAKo9C,MAAQ,GAAMF,GAAOI,qBAAqB,OAAQ59C,IACvDM,KAAKq9C,OAAS,GAAMH,GAAOI,qBAAqB,QAAS59C,GAC7D,CACA,QAAI60C,GACA,OAAOv0C,KAAKm9C,KAChB,CACA,QAAIjwC,GACA,OAAOlN,KAAKo9C,KAChB,CACA,SAAI51B,GACA,OAAOxnB,KAAKq9C,MAChB,CACA,GAAAjyC,CAAImyC,KAAUp7C,IAEVq7C,EADex9C,KAAKu9C,OACVp7C,EACd,ECxBJ,MAAMiJ,GAAM,IAAI8xC,GAAO,qBACjBO,GAAaxX,OAAO,KAGnB,MAAMyX,GACT3J,YACA4J,MACA,WAAAruC,CAAYykC,EAAa4J,GACrB39C,KAAK+zC,YAAcA,EACnB/zC,KAAK29C,MAAQA,CACjB,CACA,aAAIzK,GACA,OAAOpmC,QAAQ9M,KAAK29C,MAAMzK,UAC9B,CACA,WAAIJ,GACA,OAAO9yC,KAAK29C,MAAM7K,OACtB,CACA,gBAAIX,GACA,OAAOnyC,KAAK29C,MAAMxL,YACtB,CACA,iBAAIyL,GACA,OAAO59C,KAAK29C,MAAM5K,SACtB,CACA,aAAIA,GAGA,IACI,GAAI/yC,KAAK29C,MAAM5K,UAAW,CAEtB,MAAMA,EAAY/yC,KAAK29C,MAAM5K,UAAY0K,GACzC,OAAO,IAAIjzC,KAAKD,OAAOwoC,GAC3B,CACA,MACJ,CACA,MAAO9uB,GACH,MACJ,CACJ,CACA,QAAI+uB,GACA,OAAOhzC,KAAK29C,MAAM3K,IACtB,CACA,WAAIzF,GAGA,OAAOvtC,KAAK29C,MAAMpQ,SAAW,CACjC,CACA,kBAAI0F,GACA,OAAOjzC,KAAK29C,MAAM1K,cACtB,EAEG,MAAM,GACTd,aACAe,UACAa,YACA8J,WACA,WAAAvuC,CAAY6iC,EAAce,GAAY,EAAOa,EAAa8J,GAKtD,GAJA79C,KAAKmyC,aAAeA,EACpBnyC,KAAKkzC,UAAYA,EACjBlzC,KAAK+zC,YAAcA,EACnB/zC,KAAK69C,WAAaA,GACb1L,GAAiC,KAAjBA,EACjB,MAAM,IAAI3zC,MAAM,kCAExB,CACA,YAAMs/C,CAAOtxC,GACT,OAAO,GAAkB0I,aAAalV,KAAK+9C,WAAWvxC,GAC1D,CACA,gBAAMuxC,CAAWvxC,GACb,MAAMumC,EAAYvmC,EAAQumC,WAAa,IAAIvoC,KACrCwzC,EAAe,CACjBlL,QAAStmC,EAAQsmC,QACjBvF,QArEW,EAsEX4E,aAAcnyC,KAAKmyC,aACnBY,UAAW9M,OAAO8M,EAAUkL,WAAaR,GACzCzK,UAAM9zC,EACN+zC,eAAgBzmC,EAAQymC,eACxBC,UAAWlzC,KAAKkzC,WAEpB,GAAIlzC,KAAK69C,WAAY,CACjB,MAAM7K,EAAOhzC,KAAK69C,WAAWG,GAC7B,MAAO,IAAKA,EAAchL,OAC9B,CACA,OAAOgL,CACX,EAUG,SAASE,IAAc,YAAEnK,EAAW,qBAAEuI,EAAoB,aAAEnK,EAAY,UAAEe,EAAS,WAAE2K,IACxF,OAAO,IAAI,GAAQ1L,EAAce,EAAWmJ,GAAqBlK,EAAc4B,GAAeuI,GAAuBuB,EACzH,CACO,MAAM,GACT9J,YACA5B,aACA,WAAA7iC,CAAYykC,EAAa5B,GAGrB,GAFAnyC,KAAK+zC,YAAcA,EACnB/zC,KAAKmyC,aAAeA,GACfA,GAAiC,KAAjBA,EACjB,MAAM,IAAI3zC,MAAM,kCAExB,CACA,kBAAA2/C,CAAmBrvC,GACf,MAAMkvC,EAAe,GAAkBhiC,OAAOlN,GAC9C,OAAOytB,QAAQr4B,QAAQ,CACnB4uC,QAASkL,EAAalL,QACtBX,aAAc6L,EAAa7L,aAC3B5E,QAASyQ,EAAazQ,cAAWruC,EACjC6zC,UAAWiL,EAAajL,gBAAa7zC,EACrC8zC,KAAMgL,EAAahL,WAAQ9zC,EAC3B+zC,eAAgB+K,EAAa/K,qBAAkB/zC,EAC/Cg0C,UAAW8K,EAAa9K,YAAa,GAE7C,CACA,kBAAMkL,CAAarK,EAAa4J,GAG5B,OAAIA,EAAMpQ,SACNniC,GAAIoc,MAAM,uDAxHC,EAwHgE,YAAam2B,EAAMpQ,SACvFhR,QAAQr4B,aAAQhF,IAEpB,IAAIw+C,GAAe3J,EAAa4J,EAC3C,EAYG,SAASU,GAAclM,EAAcmK,GACxC,OAAO,IAAI,GAAQD,GAAqBlK,EAAcmK,GAAuBnK,EACjF,CC3FA,SAhBA,SAAahsC,GACT,GAHsC,MAGlBA,EAHPs9B,OAAOC,eAIhB,MAAO,WACH,MAAMmT,EAAM,GACZ,UAAW,MAAMyH,KAASn4C,EACtB0wC,EAAIr2C,KAAK89C,GAEb,OAAOzH,CACV,EANM,GAQX,MAAMA,EAAM,GACZ,IAAK,MAAMyH,KAASn4C,EAChB0wC,EAAIr2C,KAAK89C,GAEb,OAAOzH,CACX,EC7CO,SAAS,GAAO0H,EAAQ98C,GACb,MAAVA,IACAA,EAAS88C,EAAOjU,QAAO,CAAC0Q,EAAKlyC,IAASkyC,EAAMlyC,EAAKrH,QAAQ,IAE7D,MAAM+8C,EAASx5B,EAAYvjB,GAC3B,IAAIyB,EAAS,EACb,IAAK,MAAM2zC,KAAO0H,EACdC,EAAOl/C,IAAIu3C,EAAK3zC,GAChBA,GAAU2zC,EAAIp1C,OAElB,OAAoB+8C,CACxB,CCbO,SAAS,GAAO79B,EAAGC,GACtB,GAAID,IAAMC,EACN,OAAO,EAEX,GAAID,EAAEnQ,aAAeoQ,EAAEpQ,WACnB,OAAO,EAEX,IAAK,IAAIjP,EAAI,EAAGA,EAAIof,EAAEnQ,WAAYjP,IAC9B,GAAIof,EAAEpf,KAAOqf,EAAErf,GACX,OAAO,EAGf,OAAO,CACX,CCqEA,MAAM22B,GAASuL,OAAOmL,IAAI,+BAC1B,SAAS6P,GAAiBC,EAAM7zC,GAC5B,GAAa,MAATA,GAAiBA,EAAQ,EACzB,MAAM,IAAI2rB,WAAW,0BAEzB,IAAItzB,EAAS,EACb,IAAK,MAAMsM,KAAOkvC,EAAM,CACpB,MAAMC,EAASz7C,EAASsM,EAAIgB,WAC5B,GAAI3F,EAAQ8zC,EACR,MAAO,CACHnvC,MACA3E,MAAOA,EAAQ3H,GAGvBA,EAASy7C,CACb,CACA,MAAM,IAAInoB,WAAW,yBACzB,CAcO,SAASooB,GAAiB5/C,GAC7B,OAAO8N,QAAQ9N,IAAQk5B,IAC3B,CACO,MAAM2mB,GACTH,KACAj9C,OACA,CAACy2B,KAAU,EACX,WAAA5oB,IAAeq6B,GACX3pC,KAAK0+C,KAAO,GACZ1+C,KAAKyB,OAAS,EACVkoC,EAAKloC,OAAS,GACdzB,KAAK8+C,UAAUnV,EAEvB,CACA,EAAElG,OAAOsb,kBACE/+C,KAAK0+C,IAChB,CACA,cAAIluC,GACA,OAAOxQ,KAAKyB,MAChB,CAIA,MAAAu9C,IAAUN,GACN1+C,KAAK8+C,UAAUJ,EACnB,CAIA,SAAAI,CAAUJ,GACN,IAAIj9C,EAAS,EACb,IAAK,MAAM+N,KAAOkvC,EACd,GAAIlvC,aAAeS,WACfxO,GAAU+N,EAAIgB,WACdxQ,KAAK0+C,KAAKl+C,KAAKgP,OAEd,KAAIovC,GAAiBpvC,GAKtB,MAAM,IAAIhR,MAAM,qEAJhBiD,GAAU+N,EAAIgB,WACdxQ,KAAK0+C,KAAKl+C,QAAQgP,EAAIkvC,KAI1B,CAEJ1+C,KAAKyB,QAAUA,CACnB,CAIA,OAAAw9C,IAAWP,GACP1+C,KAAKk/C,WAAWR,EACpB,CAIA,UAAAQ,CAAWR,GACP,IAAIj9C,EAAS,EACb,IAAK,MAAM+N,KAAOkvC,EAAKS,UACnB,GAAI3vC,aAAeS,WACfxO,GAAU+N,EAAIgB,WACdxQ,KAAK0+C,KAAK9zC,QAAQ4E,OAEjB,KAAIovC,GAAiBpvC,GAKtB,MAAM,IAAIhR,MAAM,sEAJhBiD,GAAU+N,EAAIgB,WACdxQ,KAAK0+C,KAAK9zC,WAAW4E,EAAIkvC,KAI7B,CAEJ1+C,KAAKyB,QAAUA,CACnB,CAIA,GAAArC,CAAIyL,GACA,MAAM+6B,EAAM6Y,GAAiBz+C,KAAK0+C,KAAM7zC,GACxC,OAAO+6B,EAAIp2B,IAAIo2B,EAAI/6B,MACvB,CAIA,GAAAvL,CAAIuL,EAAO7L,GACP,MAAM4mC,EAAM6Y,GAAiBz+C,KAAK0+C,KAAM7zC,GACxC+6B,EAAIp2B,IAAIo2B,EAAI/6B,OAAS7L,CACzB,CAIA,KAAA0Q,CAAMF,EAAKtM,EAAS,GAChB,GAAIsM,aAAeS,WACf,IAAK,IAAI1O,EAAI,EAAGA,EAAIiO,EAAI/N,OAAQF,IAC5BvB,KAAKV,IAAI4D,EAAS3B,EAAGiO,EAAIjO,QAG5B,KAAIq9C,GAAiBpvC,GAMtB,MAAM,IAAIhR,MAAM,oEALhB,IAAK,IAAI+C,EAAI,EAAGA,EAAIiO,EAAI/N,OAAQF,IAC5BvB,KAAKV,IAAI4D,EAAS3B,EAAGiO,EAAIpQ,IAAImC,GAKrC,CACJ,CAIA,OAAA69C,CAAQtwC,GAIJ,GAFAA,EAAQ7F,KAAKo2C,MAAMvwC,KAEfvE,OAAOu2B,MAAMhyB,IAAUA,GAAS,GAApC,CAIA,GAAIA,IAAU9O,KAAKwQ,WAGf,OAFAxQ,KAAK0+C,KAAO,QACZ1+C,KAAKyB,OAAS,GAGlB,KAAOzB,KAAK0+C,KAAKj9C,OAAS,GAAG,CACzB,KAAIqN,GAAS9O,KAAK0+C,KAAK,GAAGluC,YAKrB,CACDxQ,KAAK0+C,KAAK,GAAK1+C,KAAK0+C,KAAK,GAAGz8B,SAASnT,GACrC9O,KAAKyB,QAAUqN,EACf,KACJ,CARIA,GAAS9O,KAAK0+C,KAAK,GAAGluC,WACtBxQ,KAAKyB,QAAUzB,KAAK0+C,KAAK,GAAGluC,WAC5BxQ,KAAK0+C,KAAKp2C,OAOlB,CAlBA,CAmBJ,CAOA,KAAApH,CAAMo+C,EAAgBC,GAClB,MAAM,KAAEb,EAAI,OAAEj9C,GAAWzB,KAAKw/C,SAASF,EAAgBC,GACvD,OAAO,GAAOb,EAAMj9C,EACxB,CAOA,QAAAwgB,CAASq9B,EAAgBC,GACrB,MAAM,KAAEb,EAAI,OAAEj9C,GAAWzB,KAAKw/C,SAASF,EAAgBC,GACvD,OAAoB,IAAhBb,EAAKj9C,OACEi9C,EAAK,GAET,GAAOA,EAAMj9C,EACxB,CAMA,OAAAg+C,CAAQH,EAAgBC,GACpB,MAAM,KAAEb,EAAI,OAAEj9C,GAAWzB,KAAKw/C,SAASF,EAAgBC,GACjDG,EAAO,IAAIb,GAIjB,OAHAa,EAAKj+C,OAASA,EAEdi+C,EAAKhB,KAAO,IAAIA,GACTgB,CACX,CACA,QAAAF,CAASF,EAAgBC,GASrB,GARAD,EAAiBA,GAAkB,EACnCC,EAAeA,GAAgBv/C,KAAKyB,OAChC69C,EAAiB,IACjBA,EAAiBt/C,KAAKyB,OAAS69C,GAE/BC,EAAe,IACfA,EAAev/C,KAAKyB,OAAS89C,GAE7BD,EAAiB,GAAKC,EAAev/C,KAAKyB,OAC1C,MAAM,IAAI+0B,WAAW,0BAEzB,GAAI8oB,IAAmBC,EACnB,MAAO,CAAEb,KAAM,GAAIj9C,OAAQ,GAE/B,GAAuB,IAAnB69C,GAAwBC,IAAiBv/C,KAAKyB,OAC9C,MAAO,CAAEi9C,KAAM1+C,KAAK0+C,KAAMj9C,OAAQzB,KAAKyB,QAE3C,MAAMi9C,EAAO,GACb,IAAIx7C,EAAS,EACb,IAAK,IAAI3B,EAAI,EAAGA,EAAIvB,KAAK0+C,KAAKj9C,OAAQF,IAAK,CACvC,MAAMiO,EAAMxP,KAAK0+C,KAAKn9C,GAChBo+C,EAAWz8C,EACXy7C,EAASgB,EAAWnwC,EAAIgB,WAG9B,GADAtN,EAASy7C,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,EAAKl+C,KAAKgP,GACV,KACJ,CAEA,MAAMxI,EAAQs4C,EAAiBK,EAC/BjB,EAAKl+C,KAAKgP,EAAIyS,SAASjb,EAAOA,GAASu4C,EAAeD,KACtD,KACJ,CACA,GAAIM,EAAJ,CAEI,GAAuB,IAAnBN,EAAsB,CAEtBZ,EAAKl+C,KAAKgP,GACV,QACJ,CAEAkvC,EAAKl+C,KAAKgP,EAAIyS,SAASq9B,EAAiBK,GAE5C,KAVA,CAWA,GAAIE,EAAgB,CAChB,GAAIN,IAAiBZ,EAAQ,CAEzBD,EAAKl+C,KAAKgP,GACV,KACJ,CAEAkvC,EAAKl+C,KAAKgP,EAAIyS,SAAS,EAAGs9B,EAAeI,IACzC,KACJ,CAEAjB,EAAKl+C,KAAKgP,EAZV,CAaJ,CACA,MAAO,CAAEkvC,OAAMj9C,OAAQ89C,EAAeD,EAC1C,CACA,OAAAnwC,CAAQlD,EAAQ/I,EAAS,GACrB,KAAK07C,GAAiB3yC,IAAaA,aAAkBgE,YACjD,MAAM,IAAI7P,UAAU,+DAExB,MAAM0/C,EAAS7zC,aAAkBgE,WAAahE,EAASA,EAAOgW,WAW9D,GAVA/e,EAASqH,OAAOrH,GAAU,GACtB49B,MAAM59B,KACNA,EAAS,GAETA,EAAS,IACTA,EAASlD,KAAKyB,OAASyB,GAEvBA,EAAS,IACTA,EAAS,GAES,IAAlB+I,EAAOxK,OACP,OAAOyB,EAASlD,KAAKyB,OAASzB,KAAKyB,OAASyB,EAGhD,MAAM68C,EAAID,EAAOtvC,WACjB,GAAU,IAANuvC,EACA,MAAM,IAAI3/C,UAAU,uCAGxB,MACM4/C,EAAqB,IAAIC,WADjB,KAGd,IAAK,IAAI94C,EAAI,EAAGA,EAHF,IAGaA,IAEvB64C,EAAmB74C,IAAM,EAE7B,IAAK,IAAI3E,EAAI,EAAGA,EAAIu9C,EAAGv9C,IAEnBw9C,EAAmBF,EAAOt9C,IAAMA,EAGpC,MAAM4S,EAAQ4qC,EACRx3C,EAAYxI,KAAKwQ,WAAasvC,EAAOtvC,WACrC0vC,EAAeJ,EAAOtvC,WAAa,EACzC,IAAIlH,EACJ,IAAK,IAAI/H,EAAI2B,EAAQ3B,GAAKiH,EAAWjH,GAAK+H,EAAM,CAC5CA,EAAO,EACP,IAAK,IAAI9G,EAAI09C,EAAc19C,GAAK,EAAGA,IAAK,CACpC,MAAMmoC,EAAO3qC,KAAKZ,IAAImC,EAAIiB,GAC1B,GAAIs9C,EAAOt9C,KAAOmoC,EAAM,CACpBrhC,EAAOL,KAAK1K,IAAI,EAAGiE,EAAI4S,EAAMu1B,IAC7B,KACJ,CACJ,CACA,GAAa,IAATrhC,EACA,OAAO/H,CAEf,CACA,OAAQ,CACZ,CACA,OAAA4+C,CAAQ5Y,GACJ,MAAM/3B,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9C2vC,QAAQ,EACxB,CACA,OAAAC,CAAQ7Y,EAAYvoC,GAChB,MAAMwQ,EAAMwV,EAAY,GACX,IAAI8xB,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrD4vC,QAAQ,EAAGphD,GAChBgB,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,QAAA8Y,CAAS9Y,EAAY+Y,GACjB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9C6vC,SAAS,EAAGC,EAC5B,CACA,QAAAC,CAAShZ,EAAYvoC,EAAOshD,GACxB,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrD+vC,SAAS,EAAGvhD,EAAOshD,GACxBtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,QAAAiZ,CAASjZ,EAAY+Y,GACjB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CgwC,SAAS,EAAGF,EAC5B,CACA,QAAAG,CAASlZ,EAAYvoC,EAAOshD,GACxB,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDiwC,SAAS,EAAGzhD,EAAOshD,GACxBtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,WAAAmZ,CAAYnZ,EAAY+Y,GACpB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CkwC,YAAY,EAAGJ,EAC/B,CACA,WAAAK,CAAYpZ,EAAYvoC,EAAOshD,GAC3B,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDmwC,YAAY,EAAG3hD,EAAOshD,GAC3BtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,QAAAqV,CAASrV,GACL,MAAM/3B,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CosC,SAAS,EACzB,CACA,QAAAI,CAASzV,EAAYvoC,GACjB,MAAMwQ,EAAMwV,EAAY,GACX,IAAI8xB,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDwsC,SAAS,EAAGh+C,GACjBgB,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,SAAAkV,CAAUlV,EAAY+Y,GAClB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CisC,UAAU,EAAG6D,EAC7B,CACA,SAAAvD,CAAUxV,EAAYvoC,EAAOshD,GACzB,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDusC,UAAU,EAAG/9C,EAAOshD,GACzBtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,SAAAuS,CAAUvS,EAAY+Y,GAClB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CspC,UAAU,EAAGwG,EAC7B,CACA,SAAAzH,CAAUtR,EAAYvoC,EAAOshD,GACzB,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDqoC,UAAU,EAAG75C,EAAOshD,GACzBtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,YAAA6U,CAAa7U,EAAY+Y,GACrB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9C4rC,aAAa,EAAGkE,EAChC,CACA,YAAA9H,CAAajR,EAAYvoC,EAAOshD,GAC5B,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDgoC,aAAa,EAAGx5C,EAAOshD,GAC5BtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,UAAAqZ,CAAWrZ,EAAY+Y,GACnB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CowC,WAAW,EAAGN,EAC9B,CACA,UAAAO,CAAWtZ,EAAYvoC,EAAOshD,GAC1B,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDqwC,WAAW,EAAG7hD,EAAOshD,GAC1BtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,UAAAuZ,CAAWvZ,EAAY+Y,GACnB,MAAM9wC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAIuP,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CswC,WAAW,EAAGR,EAC9B,CACA,UAAAS,CAAWxZ,EAAYvoC,EAAOshD,GAC1B,MAAM9wC,EAAMK,EAAM,GACL,IAAIinC,SAAStnC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDuwC,WAAW,EAAG/hD,EAAOshD,GAC1BtgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,MAAA+G,CAAOC,GACH,GAAa,MAATA,EACA,OAAO,EAEX,KAAMA,aAAiBsQ,IACnB,OAAO,EAEX,GAAItQ,EAAMmQ,KAAKj9C,SAAWzB,KAAK0+C,KAAKj9C,OAChC,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAIvB,KAAK0+C,KAAKj9C,OAAQF,IAClC,IAAK,GAAOvB,KAAK0+C,KAAKn9C,GAAIgtC,EAAMmQ,KAAKn9C,IACjC,OAAO,EAGf,OAAO,CACX,CAKA,sBAAOy/C,CAAgBtC,EAAMj9C,GACzB,MAAMi+C,EAAO,IAAIb,GAMjB,OALAa,EAAKhB,KAAOA,EACE,MAAVj9C,IACAA,EAASi9C,EAAKpU,QAAO,CAAC0Q,EAAKlyC,IAASkyC,EAAMlyC,EAAK0H,YAAY,IAE/DkvC,EAAKj+C,OAASA,EACPi+C,CACX,ECriBG,SAAS,GAAgBuB,GAC5B,OAAsC,MAA/BA,EAAMxd,OAAOC,cACxB,CCEA,MAAMwd,GAAkBz/C,IACpB,MAAM0/C,EAAe,EAAsB1/C,GACrC2/C,EAAYp8B,EAAYm8B,GAG9B,OAFA,EAAc1/C,EAAQ2/C,GACtBF,GAAepyC,MAAQqyC,EAChBC,CAAS,EAGb,SAAS,GAAOj7C,EAAQ8T,GAE3B,MAAMonC,GADNpnC,EAAUA,GAAW,CAAC,GACOqnC,eAAiBJ,GAC9C,SAAUK,EAAWlkC,GAEjB,MAAM5b,EAAS4/C,EAAahkC,EAAM7M,YAE9B/O,aAAkBwO,iBACZxO,QAGCA,EAGP4b,aAAiBpN,iBACXoN,QAGCA,CAEf,CACA,OAAI,GAAgBlX,GACT,kBACH,UAAW,MAAMkX,KAASlX,QACfo7C,EAAWlkC,EAEzB,CAJM,GAMJ,YACH,IAAK,MAAMA,KAASlX,QACTo7C,EAAWlkC,EAEzB,CAJM,EAKX,CAlCA6jC,GAAepyC,MAAQ,EAmCvB,GAAO0yC,OAAS,CAACnkC,EAAOpD,KAEpB,MAAMonC,GADNpnC,EAAUA,GAAW,CAAC,GACOqnC,eAAiBJ,GAC9C,OAAO,IAAIrC,GAAewC,EAAahkC,EAAM7M,YAAa6M,EAAM,EC9C7D,MAAMokC,WAAkCjjD,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM2sC,WAA+BljD,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM4sC,WAAqCnjD,MAC9CuC,KAAO,+BACPgU,KAAO,0BAKJ,MAAM6sC,WAA2BpjD,MACpCuC,KAAO,qBACPgU,KAAO,qBCnBX,IAAI8sC,IACJ,SAAWA,GACPA,EAASA,EAAiB,OAAI,GAAK,SACnCA,EAASA,EAAe,KAAI,GAAK,MACpC,CAHD,CAGGA,KAAaA,GAAW,CAAC,IAC5B,MAAMC,GAAkBtyC,IACpB,MAAM/N,EAAS,EAAc+N,GAE7B,OADAsyC,GAAehzC,MAAQ,EAAsBrN,GACtCA,CAAM,EAGV,SAAS,GAAO0E,EAAQ8T,GAC3B,MAAMvH,EAAS,IAAImsC,GACnB,IAAIra,EAAOqd,GAASE,OAChBC,GAAc,EAClB,MAAMC,EAAgBhoC,GAASgoC,eAAiBH,GAC1CI,EAAkBjoC,GAASioC,iBAnBJ,EAoBvBC,EAAgBloC,GAASkoC,eAlBJ,QAmB3B,SAAUZ,IACN,KAAO7uC,EAAOlC,WAAa,GAAG,CAC1B,GAAIg0B,IAASqd,GAASE,OAElB,IAEI,GADAC,EAAaC,EAAcvvC,GACvBsvC,EAAa,EACb,MAAM,IAAIP,GAA0B,0BAExC,GAAIO,EAAaG,EACb,MAAM,IAAIT,GAAuB,2BAErC,MAAMU,EAAmBH,EAAcnzC,MACvC4D,EAAO0sC,QAAQgD,GACU,MAArBnoC,GAASooC,UACTpoC,EAAQooC,SAASL,GAErBxd,EAAOqd,GAASS,IACpB,CACA,MAAO77B,GACH,GAAIA,aAAe+P,WAAY,CAC3B,GAAI9jB,EAAOlC,WAAa0xC,EACpB,MAAM,IAAIP,GAA6B,kCAE3C,KACJ,CACA,MAAMl7B,CACV,CAEJ,GAAI+d,IAASqd,GAASS,KAAM,CACxB,GAAI5vC,EAAOlC,WAAawxC,EAEpB,MAEJ,MAAMrY,EAAOj3B,EAAO+sC,QAAQ,EAAGuC,GAC/BtvC,EAAO0sC,QAAQ4C,GACQ,MAAnB/nC,GAASsoC,QACTtoC,EAAQsoC,OAAO5Y,SAEbA,EACNnF,EAAOqd,GAASE,MACpB,CACJ,CACJ,CACA,OAAI,GAAgB57C,GACT,kBACH,UAAW,MAAMqJ,KAAOrJ,EACpBuM,EAAOssC,OAAOxvC,SACP+xC,IAEX,GAAI7uC,EAAOlC,WAAa,EACpB,MAAM,IAAIoxC,GAAmB,0BAEpC,CARM,GAUJ,YACH,IAAK,MAAMpyC,KAAOrJ,EACduM,EAAOssC,OAAOxvC,SACP+xC,IAEX,GAAI7uC,EAAOlC,WAAa,EACpB,MAAM,IAAIoxC,GAAmB,0BAEpC,CARM,EASX,CC3Fe,SAASY,KACvB,MAAMxxB,EAAW,CAAC,EAOlB,OALAA,EAASyxB,QAAU,IAAIlmB,SAAQ,CAACr4B,EAASs4B,KACxCxL,EAAS9sB,QAAUA,EACnB8sB,EAASwL,OAASA,CAAM,IAGlBxL,CACR,CDUA8wB,GAAehzC,MAAQ,EAyEvB,GAAO4zC,WAAa,CAACpjC,EAAQrF,KACzB,IAAIzJ,EAAa,EA4BjB,OAAO,GA3BgB28B,kBACnB,OACI,IACI,MAAM,KAAEnK,EAAI,MAAEhkC,SAAgBsgB,EAAOjX,KAAKmI,GAC1C,IAAa,IAATwyB,EACA,OAES,MAAThkC,UACMA,EAEd,CACA,MAAOynB,GACH,GAAiB,mBAAbA,EAAI1R,KACJ,MAAO,CAAEiuB,MAAM,EAAMhkC,MAAO,MAEhC,MAAMynB,CACV,CACA,QAEIjW,EAAa,CACjB,CAER,CAtBsB,GA2BO,IACrByJ,GAAW,CAAC,EAChBooC,SAHc7gD,IAAQgP,EAAahP,CAAC,GAItC,EE3HN,MAAMmhD,GACFjwC,OACAmM,KACA+jC,IACAC,IACAx6C,KACA,WAAAiH,CAAYwzC,GACR,KAAMA,EAAM,IAAQA,EAAM,EAAKA,EAC3B,MAAM,IAAItkD,MAAM,qDAEpBwB,KAAK0S,OAAS,IAAI/Q,MAAMmhD,GACxB9iD,KAAK6e,KAAOikC,EAAM,EAClB9iD,KAAK4iD,IAAM,EACX5iD,KAAK6iD,IAAM,EACX7iD,KAAKqI,KAAO,IAChB,CACA,IAAA7H,CAAKmpC,GACD,YAA8BzqC,IAA1Bc,KAAK0S,OAAO1S,KAAK4iD,OAGrB5iD,KAAK0S,OAAO1S,KAAK4iD,KAAOjZ,EACxB3pC,KAAK4iD,IAAO5iD,KAAK4iD,IAAM,EAAK5iD,KAAK6e,MAC1B,EACX,CACA,KAAAvW,GACI,MAAMwrB,EAAO9zB,KAAK0S,OAAO1S,KAAK6iD,KAC9B,QAAa3jD,IAAT40B,EAKJ,OAFA9zB,KAAK0S,OAAO1S,KAAK6iD,UAAO3jD,EACxBc,KAAK6iD,IAAO7iD,KAAK6iD,IAAM,EAAK7iD,KAAK6e,KAC1BiV,CACX,CACA,OAAAivB,GACI,YAAiC7jD,IAA1Bc,KAAK0S,OAAO1S,KAAK6iD,IAC5B,EAEG,MAAMG,GACTvkD,KACAqkD,IACArhC,KACAC,KACA,WAAApS,CAAY2K,EAAU,CAAC,GACnBja,KAAK8iD,IAAM7oC,EAAQgpC,YAAc,GACjCjjD,KAAKyhB,KAAO,IAAIkhC,GAAU3iD,KAAK8iD,KAC/B9iD,KAAK0hB,KAAO1hB,KAAKyhB,KACjBzhB,KAAKvB,KAAO,CAChB,CACA,aAAAykD,CAAc3wC,GACV,OAAuB,MAAnBA,GAAK/B,WACE+B,EAAI/B,WAER,CACX,CACA,IAAAhQ,CAAKyK,GAID,GAHkB,MAAdA,GAAKjM,QACLgB,KAAKvB,MAAQuB,KAAKkjD,cAAcj4C,EAAIjM,SAEnCgB,KAAKyhB,KAAKjhB,KAAKyK,GAAM,CACtB,MAAMpC,EAAO7I,KAAKyhB,KAClBzhB,KAAKyhB,KAAO5Y,EAAKR,KAAO,IAAIs6C,GAAU,EAAI3iD,KAAKyhB,KAAK/O,OAAOjR,QAC3DzB,KAAKyhB,KAAKjhB,KAAKyK,EACnB,CACJ,CACA,KAAA3C,GACI,IAAI2C,EAAMjL,KAAK0hB,KAAKpZ,QACpB,QAAYpJ,IAAR+L,GAAwC,MAAlBjL,KAAK0hB,KAAKrZ,KAAe,CAC/C,MAAMA,EAAOrI,KAAK0hB,KAAKrZ,KACvBrI,KAAK0hB,KAAKrZ,KAAO,KACjBrI,KAAK0hB,KAAOrZ,EACZ4C,EAAMjL,KAAK0hB,KAAKpZ,OACpB,CAIA,OAHkB,MAAd2C,GAAKjM,QACLgB,KAAKvB,MAAQuB,KAAKkjD,cAAcj4C,EAAIjM,QAEjCiM,CACX,CACA,OAAA83C,GACI,OAAO/iD,KAAKyhB,KAAKshC,SACrB,EC9BG,MAAMI,WAAmB3kD,MAC5B2G,KACA4P,KACA,WAAAzF,CAAY9C,EAASuI,GACjBq7B,MAAM5jC,GAAW,6BACjBxM,KAAKmF,KAAO,UACZnF,KAAK+U,KAAOA,GAAQ,WACxB,EAEG,SAASquC,GAASnpC,EAAU,CAAC,GAehC,OA6BJ,SAAmBopC,EAASppC,GAExB,IAEImpC,EACAE,EACAC,EAJAC,GADJvpC,EAAUA,GAAW,CAAC,GACFupC,MAChB9wC,EAAS,IAAIswC,GAIbS,EAAQ,KACZ,MAiCMC,EAAcr7C,GACF,MAAVi7C,EACOA,EAAOj7C,IAElBqK,EAAOlS,KAAK6H,GACL+6C,GAUL5iD,EAAQxB,IACV,GAAIukD,EACA,OAAOH,EAGX,IAA4B,IAAxBnpC,GAAS0pC,YAA4C,MAArB3kD,GAAOwR,WACvC,MAAM,IAAIhS,MAAM,kEAEpB,OAAOklD,EAAW,CAAE1gB,MAAM,EAAOhkC,SAAQ,EAEvCiI,EAAOwf,GACL88B,EACOH,GACXG,GAAQ,EACO,MAAP98B,EAtBQ,CAACA,IACjB/T,EAAS,IAAIswC,GACC,MAAVM,EACOA,EAAO,CAAE97B,MAAOf,KAE3B/T,EAAOlS,KAAK,CAAEgnB,MAAOf,IACd28B,IAgBgBQ,CAAYn9B,GAAOi9B,EAAW,CAAE1gB,MAAM,KAkDjE,GAvCAogB,EAAW,CACP,CAAC3f,OAAOC,iBAAmB,OAAO1jC,IAAM,EACxCqI,KA3Ea8kC,UACb,IACI,OAAKz6B,EAAOqwC,UAGRQ,EACO,CAAEvgB,MAAM,SAEN,IAAIzG,SAAQ,CAACr4B,EAASs4B,KAC/B8mB,EAAUj7C,IACNi7C,EAAS,KACT5wC,EAAOlS,KAAK6H,GACZ,IACInE,EAAQm/C,EAAQ3wC,GACpB,CACA,MAAO+T,GACH+V,EAAO/V,EACX,CACA,OAAO28B,CAAQ,CAClB,IAhBMC,EAAQ3wC,EAkBvB,CACA,QACQA,EAAOqwC,WAGPc,gBAAe,KACXJ,EAAMv/C,UACNu/C,EAAQ,IAAU,GAG9B,GA6CA5f,OAZY,KACZnxB,EAAS,IAAIswC,GACb/7C,IACO,CAAE+7B,MAAM,IAUf8gB,MARYr9B,IACZxf,EAAIwf,GACG,CAAEuc,MAAM,IAOfxiC,OACAyG,MACA,kBAAI88C,GACA,OAAOrxC,EAAOjU,IAClB,EACAulD,QAAS7W,MAAOlzB,IACZ,MAAMgqC,EAAShqC,GAASgqC,OAExB,GADAA,GAAQC,iBACJxxC,EAAOqwC,UACP,OAEJ,IAAIoB,EACA9jD,EACU,MAAV4jD,IACAE,EAAS,IAAI5nB,SAAQ,CAACr4B,EAASs4B,KAC3Bn8B,EAAW,KACPm8B,EAAO,IAAI2mB,GAAa,EAE5Bc,EAAOG,iBAAiB,QAAS/jD,EAAS,KAGlD,UACUk8B,QAAQ8nB,KAAK,CACfZ,EAAMhB,QACN0B,GAER,CACA,QACoB,MAAZ9jD,GAA8B,MAAV4jD,GACpBA,GAAQK,oBAAoB,QAASjkD,EAE7C,IAGK,MAATmjD,EACA,OAAOJ,EAEX,MAAMmB,EAAYnB,EAsClB,OArCAA,EAAW,CACP,CAAC3f,OAAOC,iBAAmB,OAAO1jC,IAAM,EACxCqI,KAAI,IACOk8C,EAAUl8C,OAErBy7C,MAAMr9B,IACF89B,EAAUT,MAAMr9B,GACH,MAAT+8B,IACAA,EAAM/8B,GACN+8B,OAAQtkD,GAEL,CAAE8jC,MAAM,IAEnBa,OAAM,KACF0gB,EAAU1gB,SACG,MAAT2f,IACAA,IACAA,OAAQtkD,GAEL,CAAE8jC,MAAM,IAEnBxiC,OACAyG,IAAIwf,IACA89B,EAAUt9C,IAAIwf,GACD,MAAT+8B,IACAA,EAAM/8B,GACN+8B,OAAQtkD,GAELkkD,GAEX,kBAAIW,GACA,OAAOQ,EAAUR,cACrB,EACAC,QAAUlnB,GACCynB,EAAUP,QAAQlnB,IAG1BsmB,CACX,CA/LWmB,EAdU7xC,IACb,MAAMrK,EAAOqK,EAAOpK,QACpB,GAAY,MAARD,EACA,MAAO,CAAE26B,MAAM,GAEnB,GAAkB,MAAd36B,EAAKmf,MACL,MAAMnf,EAAKmf,MAEf,MAAO,CACHwb,MAAoB,IAAd36B,EAAK26B,KAEXhkC,MAAOqJ,EAAKrJ,MACf,GAEqBib,EAC9B,CCxEO,MAAM,WAAmBzb,MAC5B2G,KACA4P,KACA,WAAAzF,CAAY9C,EAASuI,EAAMhU,GACvBqvC,MAAM5jC,GAAW,6BACjBxM,KAAKmF,KAAO,UACZnF,KAAKe,KAAOA,GAAQ,aACpBf,KAAK+U,KAAOA,GAAQ,WACxB,EAKGo4B,eAAeqX,GAAW/B,EAASwB,EAAQnnB,GAC9C,GAAc,MAAVmnB,EACA,OAAOxB,EAEX,GAAIwB,EAAOQ,QAIP,OADAhC,EAAQnf,OAAM,SACP/G,QAAQC,OAAO,IAAI,GAAWM,GAAM4nB,aAAc5nB,GAAM6nB,UAAW7nB,GAAM8nB,YAEpF,IAAIvkD,EAEJ,MAAMmnB,EAAQ,IAAI,GAAWsV,GAAM4nB,aAAc5nB,GAAM6nB,UAAW7nB,GAAM8nB,WACxE,IACI,aAAaroB,QAAQ8nB,KAAK,CACtB5B,EACA,IAAIlmB,SAAQ,CAACr4B,EAASs4B,KAClBn8B,EAAW,KACPm8B,EAAOhV,EAAM,EAEjBy8B,EAAOG,iBAAiB,QAAS/jD,EAAS,KAGtD,CACA,QACoB,MAAZA,GACA4jD,EAAOK,oBAAoB,QAASjkD,EAE5C,CACJ,CCdA,MAAMwkD,GACFC,SACAC,SACAxB,MACAyB,WACAx9B,MACA,WAAAlY,GACItP,KAAKujD,OAAQ,EACbvjD,KAAK8kD,SAAW,KAChB9kD,KAAK+kD,SAAW,IACpB,CACA,CAACthB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKglD,kBAEChlD,KAAK+kD,SAAStC,QAED,MAAnBziD,KAAKglD,WACL,MAAM,IAAIxmD,MAAM,0DAEpB,MAAMwmD,EAAahlD,KAAKglD,WAKxB,OAJAhlD,KAAKglD,gBAAa9lD,EAElBc,KAAK8kD,SAAS5gD,UACdlE,KAAK8kD,SAAW,KACTE,CACX,CACA,WAAM,CAAMv+B,GAaR,OAZAzmB,KAAKujD,OAAQ,EACbvjD,KAAKwnB,MAAQf,EACF,MAAPA,IAGAzmB,KAAK+kD,SAAStC,QAAQnf,OAAM,SAC5BtjC,KAAK+kD,SAASvoB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAalwC,EAElB9U,KAAK+kD,SAAS7gD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAK8jD,MAAMr9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAKujD,MACtB,MAAMvjD,KAAKwnB,OAAS,IAAIhpB,MAAM,4CAGlC,KAA0B,MAAnBwB,KAAKglD,kBACFhlD,KAAK8kD,SAASrC,QAEX,MAATzjD,EACAgB,KAAKglD,WAAa,CAAEhiB,MAAM,EAAOhkC,UAGjCgB,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAa,CAAEhiB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAK+kD,SAAS7gD,UACdlE,KAAK+kD,SAAW,WAGVP,GAAWxkD,KAAK8kD,SAASrC,QAASxoC,GAASgqC,OAAQhqC,EAC7D,ECpCJ,SAbA,YAAkBgrC,GACd,MAAMC,EAAc,GACpB,IAAK,MAAM/+C,KAAU8+C,EA7BiB,MA8Bb9+C,EA9BZs9B,OAAOC,gBA+BZwhB,EAAY1kD,KAAK2F,GAGzB,OAAI++C,EAAYzjD,SAAWwjD,EAAQxjD,OAZvC,UAA2ByjD,GACvB,IAAK,MAAM/+C,KAAU++C,QACV/+C,CAEf,CAUeg/C,CAAiBD,GApBhC/X,gBAA6B8X,GACzB,MAAMzG,ED8DC,IAAIqG,IC7Ef1X,eAAgC8X,EAASzG,GACrC,UACUjiB,QAAQ6oB,IAAIH,EAAQ3gD,KAAI6oC,MAAOhnC,IACjC,UAAW,MAAMk/C,KAAQl/C,QACfq4C,EAAOh+C,KAAK6kD,EACtB,WAEE7G,EAAOv3C,KACjB,CACA,MAAOwf,SACG+3B,EAAOv3C,IAAIwf,GACZ6c,OAAM,QACf,CACJ,EAGIgiB,CAAiBL,EAASzG,GACrBlb,OAAM,eACJkb,CACX,CAiBW+G,CAAaN,EACxB,EChFO,SAASO,GAAK3xB,KAAU4xB,GAC3B,GAAa,MAAT5xB,EACA,MAAM,IAAIr1B,MAAM,kBAGpB,GAAIknD,GAAS7xB,GAAQ,CACjB,MAAM8xB,EAAS9xB,EACfA,EAAQ,IAAM8xB,EAAOx/C,MAEzB,MACK,GAAIy/C,GAAW/xB,IAAU,GAAgBA,GAAQ,CAClD,MAAM1tB,EAAS0tB,EACfA,EAAQ,IAAM1tB,CAClB,CACA,MAAM0/C,EAAM,CAAChyB,KAAU4xB,GAOvB,GANII,EAAIpkD,OAAS,GAETikD,GAASG,EAAIA,EAAIpkD,OAAS,MAC1BokD,EAAIA,EAAIpkD,OAAS,GAAKokD,EAAIA,EAAIpkD,OAAS,GAAGqkD,MAG9CD,EAAIpkD,OAAS,EAEb,IAAK,IAAIF,EAAI,EAAGA,EAAIskD,EAAIpkD,OAAS,EAAGF,IAC5BmkD,GAASG,EAAItkD,MACbskD,EAAItkD,GAAKwkD,GAAiBF,EAAItkD,KAI1C,OAAOykD,MAAWH,EACtB,CACO,MAAMG,GAAU,IAAIH,KACvB,IAAIjgB,EACJ,KAAOigB,EAAIpkD,OAAS,GAChBmkC,EAAMigB,EAAIv9C,OAAJu9C,CAAYjgB,GAEtB,OAAOA,CAAG,EAER,GAAmBrzB,GACiB,MAA/BA,IAAMkxB,OAAOC,eAElBkiB,GAAcrzC,GACiB,MAA1BA,IAAMkxB,OAAOsb,UAElB2G,GAAYnzC,GACH,MAAPA,GAGe,MAAZA,EAAIuzC,MAA8B,MAAdvzC,EAAIpM,OAE7B4/C,GAAoBJ,GACdx/C,IACJ,MAAMu4B,EAAIinB,EAAOG,KAAK3/C,GACtB,GAAe,MAAXu4B,GAAG6E,KAAc,CACjB,MAAM0iB,EAAS7C,GAAS,CACpBO,YAAY,IAOhB,IAAIuC,EALJxnB,EAAE6E,MAAK,KACH0iB,EAAOh/C,KAAK,IACZwf,IACAw/B,EAAOh/C,IAAIwf,EAAI,IAGnB,MAAMtgB,EAASw/C,EAAOx/C,OACtB,GAAI,GAAgBA,GAChB+/C,EAAa/Y,wBACFhnC,EACP8/C,EAAOh/C,KACX,MAEC,KAAI2+C,GAAWz/C,GAOhB,MAAM,IAAI3H,MAAM,kEANhB0nD,EAAa,kBACF//C,EACP8/C,EAAOh/C,KACX,CAIJ,CACA,OAAO,GAAMg/C,EAAQC,IACzB,CACA,OAAOP,EAAOx/C,MAAM,ECnFrB,SAASggD,GAAqBC,GACjC,OAAOA,EACFv5C,QAAQ1F,GAAmB,SAAbA,EAAEipB,SAChBhiB,MAAK,CAACi7B,EAAMj0B,IAAUA,EAAMixC,SAAS71B,KAAO6Y,EAAKgd,SAAS71B,OAC1D81B,GAAG,EACZ,CCHA,MAAMC,GAAkB,WACjB,MAAMC,GACTC,WACAC,eACAtC,iBACAh5C,IACAu7C,gBAAkB,IAAIxL,IACtByL,WAAa,IAAI/Y,IACjB,WAAAv+B,CAAYm3C,EAAYC,EAAgBtC,GACpCpkD,KAAKymD,WAAaA,EAClBzmD,KAAK0mD,eAAiBA,EACtB1mD,KAAKokD,iBAAmBA,EACxBpkD,KAAKoL,IAAM,IAAI8xC,GAAO,kBAAkBuJ,KACxCzmD,KAAKokD,iBAAiB,cAAepkD,KAAK6mD,2BAC9C,CACA,eAAMC,CAAUC,GACZ,MAAMC,EAAYD,EAAO1gD,WACnB4gD,EAAkBjnD,KAAK4mD,WAAWxnD,IAAI4nD,GACxCC,IACAjnD,KAAK4mD,WAAWM,OAAOF,SACjBC,GAEV,IAAIhB,EAASjmD,KAAKmnD,sBAAsBJ,GACxC,OAAId,GACAjmD,KAAKoL,IAAImpC,KAAK,gCAAgCyS,gBAAwBhnD,KAAKymD,cAC3EzmD,KAAKonD,WAAWJ,EAAWf,GACpBA,IAEXA,QAAejmD,KAAKqnD,aAAaN,GACjC/mD,KAAKonD,WAAWJ,EAAWf,GACpBA,EACX,CACA,kBAAMoB,CAAaN,EAAQlqB,EAAU,GACjC,MACMyqB,EAAanB,GADCnmD,KAAK0mD,eAAeK,IAExC,IAAKO,EACD,MAAM,IAAI9oD,MAAM,iDAAiDuoD,EAAO1gD,yBAAyBrG,KAAKymD,cAE1G,IAAIc,EACAtB,EACJ,IAAK,IAAI1kD,EAAI,EAAGA,EAAIs7B,EAAU,EAAGt7B,IAC7B,IACIvB,KAAKoL,IAAImpC,KAAK,4CAA4CwS,EAAO1gD,yBAAyBrG,KAAKymD,cAC/FR,QAAeqB,EAAWE,UAAUxnD,KAAKymD,YACzCzmD,KAAKoL,IAAImpC,KAAK,6BAA6BwS,EAAO1gD,yBAAyBrG,KAAKymD,cAChF,KACJ,CACA,MAAOj/B,GACH+/B,EAAY//B,CAChB,CAEJ,IAAKy+B,EACD,MAAM,IAAIznD,MAAM,qCAAqCuoD,EAAO1gD,iBAAmBkhD,GAEnF,OAAOtB,CACX,CACA,0BAAMwB,CAAqBC,GACvB,MAAMX,EAASW,EAAKh3C,GAAGrK,WACvB,GAAIrG,KAAK2mD,gBAAgB1nD,IAAI8nD,GACzB/mD,KAAKoL,IAAImpC,KAAK,wDAAwDwS,gBAAqB/mD,KAAKymD,mBAGpG,IACIzmD,KAAK2mD,gBAAgB3pC,IAAI+pC,SACnB/mD,KAAKqnD,aAAaK,EAAKh3C,GACjC,CACA,MAAO8W,GACHxnB,KAAKoL,IAAIoc,MAAM,kCAAmCA,EACtD,CACA,QACIxnB,KAAK2mD,gBAAgBO,OAAOH,EAChC,CAEJ,CACAF,2BAA8BvmD,IAC1B,MAAM,KAAEonD,GAASpnD,EAAIqnD,OAChBD,EAAKE,UAAU58B,SAAShrB,KAAKymD,cAGnBzmD,KAAKmnD,sBAAsBO,EAAKh3C,KAI/C1Q,KAAK6nD,kBAAkBH,GAAK,EAEhC,iBAAAG,CAAkBH,GACd1nD,KAAKoL,IAAImpC,KAAK,8CAA8CmT,EAAKh3C,GAAGrK,yBAAyBrG,KAAKymD,cAE9FzmD,KAAK4mD,WAAW3nD,IAAIyoD,EAAKh3C,GAAGrK,aAC5BrG,KAAK4mD,WAAWM,OAAOQ,EAAKh3C,GAAGrK,YAEnCrG,KAAK4mD,WAAWtnD,IAAIooD,EAAKh3C,GAAGrK,WAAYrG,KAAKynD,qBAAqBC,GACtE,CACA,qBAAAP,CAAsBJ,GAClB,MACMO,EAAanB,GADCnmD,KAAK0mD,eAAeK,IAExC,IAAKO,EACD,OAEJ,MAAMrB,EAASqB,EAAWQ,QAAQxuB,MAAMv2B,GAAMA,EAAEglD,WAAa/nD,KAAKymD,aAClE,OAAKR,EAGoB,CAAC,OAAQ,SAAU,WAAWj7B,SAASi7B,EAAO+B,aAAe,KAC9DhoD,KAAKioD,eAAehC,QAA5C,EAGOA,OAPP,CAQJ,CACA,UAAAmB,CAAWL,EAAQd,GACfjmD,KAAKoL,IAAImpC,KAAK,6BAA6BwS,eAAoBd,EAAOv1C,MACtEu1C,EAAOiC,SAAS3B,KAAmB,CACvC,CACA,cAAA0B,CAAehC,GACX,QAASA,EAAOiC,SAAS3B,GAC7B,EChHG,MAAM4B,GACT1B,WACA2B,WACA7M,aACA8M,uBACAC,0BACAC,cACA,WAAAj5C,CAAYm3C,EAAY2B,EAAY7M,GAChCv7C,KAAKymD,WAAaA,EAClBzmD,KAAKooD,WAAaA,EAClBpoD,KAAKu7C,aAAeA,EACpBv7C,KAAKqoD,uBAAyBD,EAAWtnD,OAAOsjD,iBAAiBhoB,KAAKgsB,EAAWtnD,QACjFd,KAAKsoD,0BAA4BF,EAAWtnD,OAAOwjD,oBAAoBloB,KAAKgsB,EAAWtnD,QACvFd,KAAKuoD,cAAgB,IAAI/B,GAAcC,EAAY2B,EAAWI,kBAAkB9B,eAAetqB,KAAKgsB,EAAWI,mBAAoBxoD,KAAKqoD,uBAC5I,CACA,eAAMvB,CAAUC,GACZ,OAAO/mD,KAAKuoD,cAAczB,UAAUC,EACxC,ECtBJ,MACA,IACE0B,WAFmC,oBAAXrb,QAA0BA,OAAOqb,YAAcrb,OAAOqb,WAAWrsB,KAAKgR,SCGhG,IAAIuK,GACJ,MAAM+Q,GAAQ,IAAIz4C,WAAW,IACd,SAAS04C,KAEtB,IAAKhR,KAEHA,GAAoC,oBAAXvK,QAA0BA,OAAOuK,iBAAmBvK,OAAOuK,gBAAgBvb,KAAKgR,SAEpGuK,IACH,MAAM,IAAIn5C,MAAM,4GAIpB,OAAOm5C,GAAgB+Q,GACzB,CCXA,MAAME,GAAY,GAElB,IAAK,IAAIrnD,EAAI,EAAGA,EAAI,MAAOA,EACzBqnD,GAAUpoD,MAAMe,EAAI,KAAO8E,SAAS,IAAInF,MAAM,ICmBhD,SAxBA,SAAY+Y,EAASzK,EAAKtM,GACxB,GAAI,GAAOulD,aAAej5C,IAAQyK,EAChC,OAAO,GAAOwuC,aAIhB,MAAMI,GADN5uC,EAAUA,GAAW,CAAC,GACDmjB,SAAWnjB,EAAQ0uC,KAAOA,MAK/C,GAHAE,EAAK,GAAe,GAAVA,EAAK,GAAY,GAC3BA,EAAK,GAAe,GAAVA,EAAK,GAAY,IAEvBr5C,EAAK,CACPtM,EAASA,GAAU,EAEnB,IAAK,IAAI3B,EAAI,EAAGA,EAAI,KAAMA,EACxBiO,EAAItM,EAAS3B,GAAKsnD,EAAKtnD,GAGzB,OAAOiO,CACT,CAEA,ODbK,SAAyBqnC,EAAK3zC,EAAS,GAG5C,OAAO0lD,GAAU/R,EAAI3zC,EAAS,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM0lD,GAAU/R,EAAI3zC,EAAS,IAAM,IAAM0lD,GAAU/R,EAAI3zC,EAAS,KAAO0lD,GAAU/R,EAAI3zC,EAAS,KAAO0lD,GAAU/R,EAAI3zC,EAAS,KAAO0lD,GAAU/R,EAAI3zC,EAAS,KAAO0lD,GAAU/R,EAAI3zC,EAAS,KAAO0lD,GAAU/R,EAAI3zC,EAAS,IAChf,CCSS4lD,CAAgBD,EACzB,ECpBO,MAAME,GACTpL,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,aAAO3hC,CAAOlN,GACV,MAAM82B,EAAM,GAAkB5pB,OAAOlN,GACrC,OAAO,IAAIi6C,GAAcnjB,EAC7B,CACA,MAAA1wB,GACI,OAAO,GAAkBA,OAAOlV,KAAK29C,MACzC,CACA,eAAItJ,GACA,OAAOr0C,KAAK29C,MAAMtJ,WACtB,CAKA,eAAIN,GACA,OAAO/zC,KAAK29C,MAAM5J,WACtB,EAEG,MAAMiV,GACTrL,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,6BAAOsL,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,aAAOh4B,CAAOlN,GACV,MAAM82B,EAAM,GAA6B5pB,OAAOlN,GAChD,OAAO,IAAIk6C,GAAmBpjB,EAClC,CACA,MAAA1wB,GACI,OAAO,GAA6BA,OAAOlV,KAAK29C,MACpD,CACA,uBAAI7J,GACA,OAAO9zC,KAAK29C,MAAM7J,mBACtB,CACA,aAAIH,GACA,OAAO3zC,KAAK29C,MAAMhK,SACtB,CACA,eAAII,GACA,OAAO/zC,KAAK29C,MAAM5J,WACtB,CACA,iBAAIC,GACA,OAAOh0C,KAAK29C,MAAM3J,aACtB,EAEG,MAAME,GACTyJ,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,aAAO3hC,CAAOlN,GACV,MAAM82B,EAAM,GAA8B5pB,OAAOlN,GACjD,OAAO,IAAIolC,GAAwBtO,EACvC,CACA,MAAA1wB,GACI,OAAO,GAA8BA,OAAOlV,KAAK29C,MACrD,CACA,cAAIxJ,GACA,OAAOn0C,KAAK29C,MAAMxJ,UACtB,CACA,cAAIC,GACA,OAAOp0C,KAAK29C,MAAMvJ,UACtB,CACA,aAAIT,GACA,OAAO3zC,KAAK29C,MAAMhK,SACtB,ECnGJ,MAAM,GAAM,IAAIuJ,GAAO,aACVsM,GACE,yCADFA,GAEH,oCAEH,MAAMC,WAAmBtB,GAC5BuB,sBACAnO,aACA,WAAAjsC,CAAYo6C,EAAuBnO,EAAcoO,GAC7CvZ,MAAMoZ,GAAwBG,EAAOvB,WAAY7M,GACjDv7C,KAAK0pD,sBAAwBA,EAC7B1pD,KAAKu7C,aAAeA,EACpBoO,EACKC,OAAOJ,GAAmBxpD,KAAK6pD,UAAUztB,KAAKp8B,MAAO,CACtD8pD,kBAAmB,MAElBxmB,OAAOrf,IACR,GAAIuD,MAAM,sBAAuBgiC,GAAmBvlC,EAAE,GAE9D,CACA,eAAMovB,CAAUU,EAAagT,EAAQ/S,GACjC,MAAMiS,QAAejmD,KAAK8mD,UAAUC,GAC9B/sB,EAAUgvB,GAAmBC,uBAAuBlV,EAAaC,GACvE,IAAIpO,EACJ,IACIA,QAAY4f,GAAK,CAACxrB,EAAQ9kB,UAAW,GAAW+wC,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,IACnG,CACA,MAAOqhB,GAEH,OADA,GAAIA,MAAM,mCAAoCA,GACvC,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcslC,aACrBlD,OAAQA,GAGpB,CACA,MAAM,WAAE5S,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwBl4B,OAAO4pB,EAAI,GAAG1kC,SACpF,OAAIizC,EAAa,KAAOA,GAAc,KAClC,GAAI3sB,MAAM,4BAA4BmsB,6BAAqCQ,MAAeC,KACnF,CACH4V,QAAS,CACLxiC,MAAO7C,GAAculC,qBACrBnD,OAAQA,GAEZgD,QAAS,OAGV,CACHC,QAAS,KACTD,QAAShD,EAEjB,CACA,iBAAMoD,CAAYpW,EAAagT,EAAQ/S,GACnC,IAAIiS,EACJ,IACIA,QAAejmD,KAAK8mD,UAAUC,EAClC,CACA,MAAOv/B,GAEH,OADA,GAAIA,MAAM,yCAAyCu/B,EAAO1gD,aAAcmhB,GACjE,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcylC,oBACrBrD,OAAQA,GAGpB,CACA,MAAMsD,EAAqBrB,GAAmBG,yBAAyBpV,EAAaC,GACpF,UACUwR,GAAK,CAAC6E,EAAmBn1C,UAAW,GAAW+wC,EAAOH,KAChE,CACA,MAAOt+B,GAEH,OADA,GAAIA,MAAM,qCAAsCA,GACzC,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcslC,aACrBlD,OAAQA,GAGpB,CACA,MAAO,CACHgD,QAAShD,EACTiD,QAAS,KAEjB,CACA,oBAAMM,CAAevW,EAAagT,GAC9B,MAAMd,QAAejmD,KAAK8mD,UAAUC,GAC9B/sB,EAAUgvB,GAAmBK,4BAA4BtV,GACzDnO,QAAY4f,GAAK,CAACxrB,EAAQ9kB,UAAW,GAAW+wC,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,KACrG,IAAKy/B,IAAQA,EAAInkC,OACb,MAAO,CACHuoD,QAAS,CACLxiC,MAAO7C,GAAc4lC,YACrBxD,OAAQA,GAEZgD,QAAS,MAGjB,MAAM,WAAE5V,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwBl4B,OAAO4pB,EAAI,GAAG1kC,SACpF,OAAIizC,EAAa,KAAOA,GAAc,KAClC,GAAI3sB,MAAM,kCAAkCmsB,6BAAqCQ,MAAeC,KACzF,CACH4V,QAAS,CACLxiC,MAAO7C,GAAculC,qBACrBnD,OAAQA,GAEZgD,QAAS,OAGV,CACHC,QAAS,KACTD,QAAShD,EAEjB,CACA,UAAMyD,CAAKzD,GACP,IAAId,EACJ,IACIA,QAAejmD,KAAK8mD,UAAUC,EAClC,CACA,MAAOv/B,GAEH,OADA,GAAIA,MAAM,yCAAyCu/B,EAAO1gD,aAAcmhB,GACjE,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcylC,oBACrBrD,OAAQA,GAGpB,CACA,MAAM/sB,EAAUgvB,GAAmBO,8BACnC,IAAI3jB,EACJ,IACIA,QAAY4f,GAAK,CAACxrB,EAAQ9kB,UAAW,GAAW+wC,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,IACnG,CACA,MAAOqhB,GAEH,OADA,GAAIA,MAAM,8BAA+BA,GAClC,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcslC,aACrBlD,OAAQA,GAGpB,CACA,IAAKnhB,IAAQA,EAAInkC,OACb,MAAO,CACHsoD,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAc4lC,YACrBxD,OAAQA,IAIpB,MAAM,WAAE5S,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwBl4B,OAAO4pB,EAAI,GAAG1kC,SACpF,OAAIizC,EAAa,KAAOA,GAAc,KAClC,GAAI3sB,MAAM,uBAAuBmsB,6BAAqCQ,MAAeC,KAC9E,CACH2V,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAculC,qBACrBnD,OAAQA,KAIb,CACHgD,QAAShD,EACTiD,QAAS,KAEjB,CACA,SAAAH,CAAUY,GACN,MAAM,WAAEnD,EAAU,OAAErB,GAAWwE,GACzB,WAAEC,GAAepD,EACvB,GAAI/S,KAAK,yBAAyBmW,EAAWrkD,cAC7C,IACIm/C,GAAKS,EAAQ,IAAW9Y,MAAOhnC,IAC3B,UAAW,MAAM2I,KAAS3I,EAAQ,CAC9B,MAAMkqB,EAAW04B,GAAc/sC,OAAOlN,EAAM5N,UACtC,YAAE6yC,EAAW,YAAEM,GAAgBhkB,EACrC,IAAKgkB,EAED,YADA,GAAI7sB,MAAM,0BAGd,IAAKusB,EAED,YADA,GAAIvsB,MAAM,gDAGRxnB,KAAK0pD,sBAAsB3V,EAAaM,EAAaiT,EAAWoD,WAAWrkD,WACrF,KACDk9B,MAAK,KACJ,GAAIgR,KAAK,yBAAyB,IACnCpH,MAAOlpB,IACN,GAAIuD,MAAM,qCAAqC8/B,EAAWoD,WAAWrkD,wBAAwB4/C,EAAOv1C,kBAAkBu1C,EAAO8B,aAAc9jC,EAAE,GAErJ,CACA,MAAOA,GACH,GAAIuD,MAAM,yBAA0BvD,EACxC,CACJ,EC5MG,MAAMuwB,GACTmJ,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,oBAAOgN,CAAcn+C,EAASunC,GAC1B,OAAO,IAAIS,GAAQ,CACfb,UAAW,KACX3Z,QAAS,CACLxtB,QAASA,EACTunC,YAAaA,GAEjB1jB,cAAUnxB,GAElB,CACA,aAAO8c,CAAOlN,GACV,MAAM82B,EAAM,GAAc5pB,OAAOlN,GACjC,OAAO,IAAI0lC,GAAQ5O,EACvB,CACA,MAAA1wB,GACI,OAAO,GAAcA,OAAOlV,KAAK29C,MACrC,CACA,SAAInI,GACA,OAAOx1C,KAAK29C,MAAM3jB,OACtB,CACA,YAAI3J,GACA,OAAOrwB,KAAK29C,MAAMttB,QACtB,EC1BJ,MCQM,GAAM,IAAI6sB,GAAO,cACV0N,GAAiB,kCAKvB,MAAMC,WAAsB1C,GAC/B5M,aACA,WAAAjsC,CAAYisC,EAAcoO,GACtBvZ,MAAMwa,GAAgBjB,EAAOvB,WAAY7M,GACzCv7C,KAAKu7C,aAAeA,CACxB,CACA,wBAAMuP,CAAmBn6B,EAASnkB,GAC9B,IACI,IAAKA,EAAQsmC,SAAsC,IAA3BtmC,EAAQsmC,QAAQrxC,OAEpC,OADA,GAAI+lB,MAAM,oDACH,CAAEguB,MAAO,KAAMhuB,MAAO7C,GAAcomC,eAE/C,UCpBL5d,eAAqCxc,EAASnkB,GACjD,MAAMgD,QAAYmhB,EAAQmtB,OAAOtxC,GACjC,QAAKgD,GAIyB,CAACA,GAAQA,EAAI/N,OAfpC,SACY,EAYZupD,CAAmBx7C,EAC9B,CDewBy7C,CAAsBt6B,EAASnkB,GAEvC,OADA,GAAIgb,MAAM,8DACH,CAAEguB,MAAO,KAAMhuB,MAAO7C,GAAcumC,cAE/C,MAAMlN,QAAqBrtB,EAAQotB,WAAWvxC,GAC9C,OAAKwxC,EAQE,CAAExI,MADKhB,GAAQmW,cAAc3M,EAAcrtB,EAAQojB,aAC1CvsB,MAAO,OAPnB,GAAIA,MAAM,mDACH,CACHguB,MAAO,KACPhuB,MAAO7C,GAAcwmC,eAKjC,CACA,MAAO3jC,GAEH,OADA,GAAIA,MAAM,iCAAkCA,GACrC,CACHguB,MAAO,KACPhuB,MAAO7C,GAAcslC,aAE7B,CACJ,CACA,UAAMx5B,CAAKE,EAASnkB,EAASu6C,GACzB,MAAM,MAAEvR,EAAOhuB,MAAO4jC,SAA2BprD,KAAK8qD,mBAAmBn6B,EAASnkB,GAClF,GAAI4+C,IAAqB5V,EACrB,MAAO,CACHuU,QAAS,KACTC,QAAS,CACLxiC,MAAO4jC,EACPrE,WAIZ,IAAId,EAcArgB,EAbJ,IACIqgB,QAAejmD,KAAK8mD,UAAUC,EAClC,CACA,MAAOv/B,GAEH,OADA,GAAIA,MAAM,uBAAwBA,GAC3B,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcylC,oBACrBrD,OAAQA,GAGpB,CAEA,IACInhB,QAAY4f,GAAK,CAAChQ,EAAMtgC,UAAW,GAAW+wC,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,IACjG,CACA,MAAOsgB,GAGH,OADA,GAAIe,MAAM,yCAA0Cf,GAC7C,CACHsjC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAc0mC,eACrBtE,OAAQA,GAGpB,CACA,MAAMj4C,EAAQ,IAAI+vC,GAIlB,IAAIxuB,EAHJuV,EAAIz4B,SAASkQ,IACTvO,EAAMkwC,OAAO3hC,EAAM,IAGvB,IACIgT,EAAWmkB,GAAQx4B,OAAOlN,GAAOuhB,QACrC,CACA,MAAO5J,GAEH,OADA,GAAIe,MAAM,8BAA+Bf,GAClC,CACHsjC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAc2mC,cACrBvE,OAAQA,GAGpB,CACA,OAAK12B,GDrGsBkkB,EC+GJlkB,EAASkkB,QD3G5BA,EAAKvpB,SAVmB,iCAW5BupB,EAAKvpB,SAVuB,0DAW5BupB,EAAKvpB,SAPiB,2BCiHlB,GAAIxD,MAAM,qCACH,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAc4mC,qBACrBxE,OAAQA,KAIf12B,EAASikB,UAUP,CAAEyV,QAAShD,EAAQiD,QAAS,OAT/B,GAAIxiC,MAAM,qCAAsC6I,EAASkkB,MAClD,CACHwV,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAculC,qBACrBnD,OAAQA,MAzBhB,GAAIv/B,MAAM,6CACH,CACHuiC,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAc4lC,YACrBxD,OAAQA,KD3GM,IAACxS,CCoI/B,EE7IJ,MAAMiX,GAAe,CACjB1Y,QAAS,IAAI7iC,WACbkiC,aAAc,GACd5E,aAASruC,EACT6zC,eAAW7zC,EACX8zC,UAAM9zC,EACN+zC,oBAAgB/zC,EAChBg0C,eAAWh0C,GCFTusD,GAAc,IACb,MAAM/W,GACTiJ,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,aAAO/+C,CAAOy9B,GACV,MAAMrC,EAAU,IAAI0a,GAAkB,IAC/BrY,EACHsX,UAAW,KACXiB,UAAWvY,EAAOuY,UACZ3O,OAAO5J,EAAOuY,UAAUjuB,UAAY8kC,SACpCvsD,EACN21C,QAASxY,EAAOwY,QACV5O,OAAO5J,EAAOwY,QAAQluB,UAAY8kC,SAClCvsD,EACN41C,cAAezY,EAAOyY,eAAiB,GACvCG,gBAAiB5Y,EAAO4Y,gBAClBhP,OAAO5J,EAAO4Y,sBACd/1C,IAGV,GAAKm9B,EAAO0X,cAAgB1X,EAAO2X,gBAC7B3X,EAAO0X,aAAe1X,EAAO2X,cAC/B,MAAM,IAAIx1C,MAAM,2DAEpB,GAAI69B,EAAOyY,gBACNzY,EAAO0X,aACJ1X,EAAO2X,eACP3X,EAAOuY,WACPvY,EAAOwY,SACX,MAAM,IAAIr2C,MAAM,sEAEpB,OAAOw7B,CACX,CACA,aAAOhe,CAAOlN,GACV,MAAM82B,EAAM,GAAwB5pB,OAAOlN,GAC3C,OAAO,IAAI4lC,GAAkB9O,EACjC,CACA,MAAA1wB,GACI,OAAO,GAAwBA,OAAOlV,KAAK29C,MAC/C,EAEG,MAAMzI,GACTyI,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,aAAO3hC,CAAOlN,GACV,MAAM82B,EAAM,GAAyB5pB,OAAOlN,GAC5C,OAAO,IAAIomC,GAAmBtP,EAClC,CACA,MAAA1wB,GACI,OAAO,GAAyBA,OAAOlV,KAAK29C,MAChD,CACA,cAAIxJ,GACA,OAAOn0C,KAAK29C,MAAMxJ,UACtB,CACA,cAAIC,GACA,OAAOp0C,KAAK29C,MAAMvJ,UACtB,CACA,YAAIX,GACA,OAAOzzC,KAAK29C,MAAMlK,QACtB,CACA,oBAAIsB,GACA,OAAO/0C,KAAK29C,MAAM5I,gBACtB,EC/DJ,MAAM,GAAM,IAAImI,GAAO,SACVwO,GAAa,8BACnB,MAAMC,WAAkBxD,GAC3B5M,aACA,WAAAjsC,CAAYisC,EAAcoO,GACtBvZ,MAAMsb,GAAY/B,EAAOvB,WAAY7M,GACrCv7C,KAAKu7C,aAAeA,CACxB,CACA,kBAAOqQ,CAAaC,EAAWziB,EAAU2d,GACrC,GAAI8E,EAAU7X,cAAc3tC,aACxB1E,MAAM4c,KAAK6qB,EAASlkC,QAAQmB,WAC5B,MAAM,IAAI7H,MAAM,wEAEpB,IAAIstD,EAAgBD,EAAU9W,iBAC9B,OAAa,CACT,MAAMgX,EAAoBrX,GAAkB91C,OAAO,IAC5CitD,EACH9W,iBAAkB+W,IAEtB,IAAI7F,EACJ,IACIA,QAAejmD,KAAK8mD,UAAUC,EAClC,CACA,MAAO9iC,GACH,GAAIuD,MAAM,uBAAwBvD,GAClC,KACJ,CACA,MAAM2hB,QAAY4f,GAAK,CAACuG,EAAkB72C,UAAW,GAAW+wC,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,KACzG2I,EAAQ,IAAI+vC,GAClBjZ,EAAIz4B,SAASkQ,IACTvO,EAAMkwC,OAAO3hC,EAAM,IAEvB,MAAM2uC,EAAqB9W,GAAmBl5B,OAAOlN,GACrD,IAAKk9C,EAAmB7X,YACpB6X,EAAmB7X,YAAc,IAAK,CACtC,MAAMuQ,EAAe,wCAAwCsH,EAAmB7X,4BAA4B6X,EAAmB5X,aAE/H,MADA,GAAI5sB,MAAMk9B,GACJ,IAAIlmD,MAAMkmD,EACpB,CACA,IAAKsH,EAAmBvY,WAAauY,EAAmBvY,SAAShyC,OAAQ,CACrE,GAAIyL,KAAK,yDACT,KACJ,CACA,GAAIqnC,KAAK,GAAGyX,EAAmBvY,SAAShyC,wCACxC,MAAMwqD,EAAkBD,EAAmBvY,SAASnvC,KAAK4nD,IACrD,IAAKA,EAAS1/C,QACV,OAAO+vB,QAAQr4B,aAAQhF,GAE3B,MAAMizC,EAAe+Z,EAAS1/C,QAAQ2lC,aACtC,GAAIA,EAAc,CACd,MAAMvhB,EAAUwY,EAAShqC,IAAI+yC,GAC7B,GAAIvhB,EACA,OAAOA,EAAQwtB,aAAa8N,EAASnY,aAAe,IFnD7CoY,EEmDgED,EAAS1/C,QFlD7F,IAAKg/C,MAAiBW,IEoDjB,CFrDT,IAAwBA,EEsDf,OAAO5vB,QAAQr4B,aAAQhF,EAAU,IAWrC,SATM+sD,EAEFH,EADAD,EAAU7W,kBAENgX,EAAmBvY,SAASuY,EAAmBvY,SAAShyC,OAAS,GAC5DgzC,YAGOuX,EAAmBvY,SAAS,GAAGgB,YAE/CuX,EAAmBvY,SAAShyC,ODtEf,KCuEbuqD,EAAmBvY,SAAShyC,QACvBoqD,EAAU5W,iBDzEE,IC0EjB,KAER,CACJ,EC3EG,MAAMmX,WAA0BC,YACnC,GAAa,IAAIxe,IACjB,WAAAv+B,GACI8gC,OAIJ,CACA,aAAAxuC,CAAcuD,GACV,MAAM9D,EAAYrB,MAAK,EAAWZ,IAAI+F,GACtC,OAAiB,MAAb9D,EACO,EAEJA,EAAUI,MACrB,CACA,gBAAA2iD,CAAiBj/C,EAAM9E,EAAU4Z,GAC7Bm2B,MAAMgU,iBAAiBj/C,EAAM9E,EAAU4Z,GACvC,IAAIylC,EAAO1/C,MAAK,EAAWZ,IAAI+F,GACnB,MAARu6C,IACAA,EAAO,GACP1/C,MAAK,EAAWV,IAAI6F,EAAMu6C,IAE9BA,EAAKl/C,KAAK,CACNovB,SAAUvvB,EACVN,OAAmB,IAAZka,IAAgC,IAAZA,GAAqBA,GAASla,QAAS,GAE1E,CACA,mBAAAukD,CAAoBn/C,EAAM9E,EAAU4Z,GAChCm2B,MAAMkU,oBAAoBn/C,EAAKkB,WAAYhG,GAAY,KAAM4Z,GAC7D,IAAIylC,EAAO1/C,MAAK,EAAWZ,IAAI+F,GACnB,MAARu6C,IAGJA,EAAOA,EAAK7yC,QAAO,EAAG+iB,cAAeA,IAAavvB,IAClDL,MAAK,EAAWV,IAAI6F,EAAMu6C,GAC9B,CACA,aAAA4M,CAAcnsD,GACV,MAAM2U,EAASs7B,MAAMkc,cAAcnsD,GACnC,IAAIu/C,EAAO1/C,MAAK,EAAWZ,IAAIe,EAAMgF,MACrC,OAAY,MAARu6C,IAGJA,EAAOA,EAAK7yC,QAAO,EAAG9M,WAAYA,IAClCC,MAAK,EAAWV,IAAIa,EAAMgF,KAAMu6C,IAHrB5qC,CAKf,CACA,iBAAAy3C,CAAkBpnD,EAAMwiD,EAAS,CAAC,GAC9B,OAAO3nD,KAAKssD,cAAc,IAAIE,YAAYrnD,EAAMwiD,GACpD,ECjDG,MAAM8E,GAAehpB,OAAOmL,IAAI,mBAIhC,SAAS8d,GAASne,GACrB,OAAOzhC,QAAQyhC,IAAQke,IAC3B,CCRA,MAEME,GAAS,ICHR,MACH9hD,MAAQ,EACRkrB,MAAQ,GACR,IAAIA,GAGA,OAFA/1B,KAAK6K,MAAQ,EACb7K,KAAK+1B,MAAQA,EACN/1B,IACX,CAEA,cAAA4sD,CAAe/sD,GACX,MAAMgL,EAAQ7K,KAAK6K,MACbiK,EAASjV,IAIf,YAHeX,IAAX4V,IACA9U,KAAK6K,MAAQA,GAEViK,CACX,CAEA,SAAA+3C,CAAUhtD,GACN,MAAMiV,EAASjV,IACf,GAAIG,KAAK6K,QAAU7K,KAAK+1B,MAAMt0B,OAG9B,OAAOqT,CACX,CAEA,QAAAg4C,GACI,KAAI9sD,KAAK6K,OAAS7K,KAAK+1B,MAAMt0B,QAG7B,OAAOzB,KAAK+1B,MAAM/1B,KAAK6K,MAC3B,CAEA,QAAAkiD,GACI,KAAI/sD,KAAK6K,OAAS7K,KAAK+1B,MAAMt0B,QAG7B,OAAOzB,KAAK+1B,MAAM/1B,KAAK6K,QAC3B,CAEA,aAAAmiD,CAAc9iC,GACV,OAAOlqB,KAAK4sD,gBAAe,KACvB,MAAMjiB,EAAO3qC,KAAK+sD,WAClB,GAAIpiB,IAASzgB,EAGb,OAAOygB,CAAI,GAEnB,CAOA,aAAAsiB,CAAcC,EAAKriD,EAAOsiD,GACtB,OAAOntD,KAAK4sD,gBAAe,KACvB,KAAI/hD,EAAQ,QACwB3L,IAA5Bc,KAAKgtD,cAAcE,IAI3B,OAAOC,GAAO,GAEtB,CAMA,UAAAC,CAAWC,EAAOC,EAAWC,EAAiBC,GAC1C,OAAOxtD,KAAK4sD,gBAAe,KACvB,IAAI93C,EAAS,EACT24C,EAAa,EACjB,MAAMC,EAAc1tD,KAAK8sD,WACzB,QAAoB5tD,IAAhBwuD,EACA,OAEJ,MAAMC,EAAiC,MAAhBD,EACjBE,EAAW,IAAM,EAAIJ,GAAY,EAEvC,OAAa,CACT,MAAMK,EAAQ7tD,KAAK4sD,gBAAe,KAC9B,MAAMjiB,EAAO3qC,KAAK+sD,WAClB,QAAa7tD,IAATyrC,EACA,OAEJ,MAAM6B,EAAMjiC,OAAOiU,SAASmsB,EAAM0iB,GAClC,OAAI9iD,OAAOu2B,MAAM0L,QAAjB,EAGOA,CAAG,IAEd,QAActtC,IAAV2uD,EACA,MAIJ,GAFA/4C,GAAUu4C,EACVv4C,GAAU+4C,EACN/4C,EAAS84C,EACT,OAGJ,GADAH,GAAc,OACIvuD,IAAdouD,GACIG,EAAaH,EACb,MAGZ,CACA,OAAmB,IAAfG,IAGMF,GAAmBI,GAAkBF,EAAa,OAFxD,EAMO34C,CACX,GAER,CAEA,YAAAg5C,GACI,OAAO9tD,KAAK4sD,gBAAe,KACvB,MAAM/iB,EAAM,IAAI55B,WAAW,GAC3B,IAAK,IAAI1O,EAAI,EAAGA,EAAIsoC,EAAIpoC,OAAQF,IAAK,CACjC,MAAMwsD,EAAK/tD,KAAKitD,cAAc,IAAK1rD,GAAG,IAAMvB,KAAKotD,WAAW,GAAI,GAAG,EAAO,KAC1E,QAAWluD,IAAP6uD,EACA,OAEJlkB,EAAItoC,GAAKwsD,CACb,CACA,OAAOlkB,CAAG,GAElB,CAEA,YAAAmkB,GAQI,MAAMC,EAAcC,IAChB,IAAK,IAAI3sD,EAAI,EAAGA,EAAI2sD,EAAOzsD,OAAS,EAAGF,IAAK,CACxC,MAAMwsD,EAAS,EAAJxsD,EAEX,GAAIA,EAAI2sD,EAAOzsD,OAAS,EAAG,CACvB,MAAM0sD,EAAOnuD,KAAKitD,cAAc,IAAK1rD,GAAG,IAAMvB,KAAK8tD,iBACnD,QAAa5uD,IAATivD,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,MAAMzxC,EAAQtc,KAAKitD,cAAc,IAAK1rD,GAAG,IAAMvB,KAAKotD,WAAW,GAAI,GAAG,EAAM,KAC5E,QAAcluD,IAAVod,EACA,MAAO,CAACyxC,GAAI,GAEhBG,EAAOH,GAAMzxC,GAAS,EACtB4xC,EAAOH,EAAK,GAAa,IAARzxC,CACrB,CACA,MAAO,CAAC4xC,EAAOzsD,QAAQ,EAAM,EAEjC,OAAOzB,KAAK4sD,gBAAe,KAEvB,MAAMnrC,EAAO,IAAIxR,WAAW,KACrBm+C,EAAUC,GAAWJ,EAAWxsC,GACvC,GAAiB,KAAb2sC,EACA,OAAO3sC,EAGX,GAAI4sC,EACA,OAIJ,QAAgCnvD,IAA5Bc,KAAKgtD,cAAc,KACnB,OAEJ,QAAgC9tD,IAA5Bc,KAAKgtD,cAAc,KACnB,OAIJ,MAAMtrC,EAAO,IAAIzR,WAAW,IACtBq+C,EAAQ,IAAMF,EAAW,IACxBG,GAAYN,EAAWvsC,EAAKO,SAAS,EAAGqsC,IAG/C,OADA7sC,EAAKniB,IAAIoiB,EAAKO,SAAS,EAAGssC,GAAW,GAAKA,GACnC9sC,CAAI,GAEnB,CAEA,UAAA+sC,GACI,OAAOxuD,KAAK8tD,gBAAkB9tD,KAAKguD,cACvC,GDhMG,SAASS,GAAU14B,GACtB,KAAIA,EAAMt0B,OAJU,IAOpB,OAAOkrD,GAAO+B,IAAI34B,GAAO82B,WAAU,IAAMF,GAAOmB,gBACpD,CAaO,SAASa,GAAU54B,GAKtB,GAHIA,EAAM/K,SAAS,OACf+K,EAAQA,EAAMruB,MAAM,KAAK,MAEzBquB,EAAMt0B,OA3BU,IA8BpB,OAAOkrD,GAAO+B,IAAI34B,GAAO82B,WAAU,IAAMF,GAAOqB,gBACpD,CAEO,SAASY,GAAQ74B,EAAO84B,GAAgB,GAK3C,GAHI94B,EAAM/K,SAAS,OACf+K,EAAQA,EAAMruB,MAAM,KAAK,IAEzBquB,EAAMt0B,OAtCU,GAuChB,OAEJ,MAAMqtD,EAAOnC,GAAO+B,IAAI34B,GAAO82B,WAAU,IAAMF,GAAO6B,eACtD,OAAKM,EAGDD,GAAiC,IAAhBC,EAAKrtD,OACfwO,WAAWsO,KAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAM,IAAMuwC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,KAE/FA,OANP,CAOJ,CEjDO,MAGMC,IADevwC,SAAS,SAAU,IACrB,IAAIvO,WAAW,CACrC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,OAEhC,SAAS++C,GAAO77B,EAAItU,GALJ,KAMfA,EAAKpd,QAPU,IAOY0xB,EAAG1xB,QCR/B,SAAekf,GAClB,IAAIpf,EAAI,EACR,IAAK,MAAM0iB,KAAKtD,EACZ,KAAIpf,EDK4D,GCLhE,CAEA,GAAIA,EDG+D,GCF/D,MACJ,GAAU,MAAN0iB,EACA,OAAO,EACX1iB,GALY,CAOhB,OAAO,CACX,CDJ4D0tD,CAAMpwC,KAC1DA,EAAOA,EAAK3d,MAAM,KARH,IAUf2d,EAAKpd,QATU,KAUf0xB,EAAG1xB,QCCJ,SAAmBkf,EAAGC,GACzB,IAAIrf,EAAI,EACR,IAAK,MAAM0iB,KAAKtD,EACZ,KAAIpf,EDHsB,GCG1B,CAEA,GAAIA,EDLyB,GCMzB,MACJ,GAAI0iB,IAAMrD,EAAErf,GACR,OAAO,EACXA,GALY,CAOhB,OAAO,CACX,CDZQ,CAAU4xB,EAAI47B,MACd57B,EAAKA,EAAGjyB,MAAM,KAElB,MAAMsS,EAAI2f,EAAG1xB,OACb,GAAI+R,GAAKqL,EAAKpd,OACV,MAAM,IAAIjD,MAAM,qBAEpB,MAAMqrC,EAAM,IAAI55B,WAAWuD,GAC3B,IAAK,IAAIjS,EAAI,EAAGA,EAAIiS,EAAGjS,IACnBsoC,EAAItoC,GAAK4xB,EAAG5xB,GAAKsd,EAAKtd,GAE1B,OAAOsoC,CACX,CECO,SAASqlB,GAASC,EAAMl8C,GAC3B,GAAa,KAATA,GAAiC,MAATA,EACxB,MAAM,IAAIzU,MAAM,qBACpB,GAAI2wD,EAAO,GAAKA,EAAOl8C,EACnB,MAAM,IAAIzU,MAAM,qBACpB,MAAMgD,EAAIyR,EAAO,EACXmkB,EAAI,IAAInnB,WAAWzO,GACzB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAGD,IACf4tD,GAAQ,GACR/3B,EAAE71B,GAAK,IACP4tD,GAAQ,IAGZ/3B,EAAE71B,GAAK,KAAO,KAAQ4tD,GACtBA,EAAO,GAEX,OAAO/3B,CACX,CCxCO,MAAM,GAMT,WAAA9nB,CAAY8/C,EAAUvwC,GAClB,GAAY,MAARA,IACGwwC,QAASrvD,KAAKqvD,QAASxwC,KAAM7e,KAAK6e,MDV1C,SAAmB9b,GACtB,MAAOusD,EAASC,GAAcxsD,EAAE2E,MAAM,KACtC,IAAK4nD,IAAYC,EACb,MAAM,IAAI/wD,MAAM,+BAAiCuE,GACrD,IAAIysD,EFJe,EEKfr8B,EAAKs7B,GAAUa,GACnB,GAAU,MAANn8B,IACAq8B,EFNe,GEOfr8B,EAAKw7B,GAAUW,GACL,MAANn8B,GACA,MAAM,IAAI30B,MAAM,+BAAiCuE,GAEzD,MAAMq0B,EAAI5Y,SAAS+wC,EAAY,IAC/B,GAAIhlD,OAAOu2B,MAAM1J,IACbpoB,OAAOooB,GAAG31B,SAAW8tD,EAAW9tD,QAChC21B,EAAI,GACJA,EAAe,EAAXo4B,EACJ,MAAM,IAAIhxD,MAAM,+BAAiCuE,GAErD,MAAM8b,EAAOqwC,GAAS93B,EAAG,EAAIo4B,GAC7B,MAAO,CACHH,QAASL,GAAO77B,EAAItU,GACpBA,OAER,CCd0D4wC,CAAUL,QAEvD,CACD,MAAMM,EAAWd,GAAQQ,GACzB,GAAgB,MAAZM,EACA,MAAM,IAAIlxD,MAAM,2BAEpBqgB,EAAO7P,OAAO6P,GACd,MAAMuY,EAAI5Y,SAASK,EAAM,IACzB,GAAItU,OAAOu2B,MAAM1J,IACbpoB,OAAOooB,GAAG31B,SAAWod,EAAKpd,QAC1B21B,EAAI,GACJA,EAAsB,EAAlBs4B,EAASjuD,OAAY,CACzB,MAAMkuD,EAAaf,GAAQ/vC,GAC3B,GAAkB,MAAd8wC,EACA,MAAM,IAAInxD,MAAM,wBAEpBwB,KAAK6e,KAAO8wC,CAChB,MAEI3vD,KAAK6e,KAAOqwC,GAAS93B,EAAG,EAAIs4B,EAASjuD,QAEzCzB,KAAKqvD,QAAUL,GAAOU,EAAU1vD,KAAK6e,KACzC,CACJ,CAMA,QAAAmV,CAASb,GACL,OHhBD,SAAoBG,EAAKH,GAI5B,GAHkB,iBAAPA,IACPA,EAAKy7B,GAAQz7B,IAEP,MAANA,EACA,MAAM,IAAI30B,MAAM,cACpB,GAAI20B,EAAG1xB,SAAW6xB,EAAI+7B,QAAQ5tD,OAC1B,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAI4xB,EAAG1xB,OAAQF,IAC3B,IAAK+xB,EAAI+7B,QAAQ9tD,GAAK+xB,EAAIzU,KAAKtd,MAAS4xB,EAAG5xB,GAAK+xB,EAAIzU,KAAKtd,IACrD,OAAO,EAGf,OAAO,CACX,CGCequD,CAAW,CAAEP,QAASrvD,KAAKqvD,QAASxwC,KAAM7e,KAAK6e,MAAQsU,EAClE,CAEA,QAAA9sB,GACI,MAAM7E,EFMP,SAA0Bqd,GAC7B,IAAIswC,EAAO,EAEX,IAAK,IAAKtkD,EAAOglD,KAAShxC,EAAKixC,UAAW,CACtC,GAAa,MAATD,EAAJ,CAIA,KAAe,IAAPA,GACJV,IACAU,IAAe,EAEnB,GAAY,IAAPA,EACD,OAAQ,EAEZ,IAAK,IAAItuD,EAAIsJ,EAAQ,EAAGtJ,EAAIsd,EAAKpd,OAAQF,IACrC,GAAe,GAAXsd,EAAKtd,GACL,OAAQ,EAGhB,KAbA,CAFI4tD,GAAQ,CAgBhB,CACA,OAAOA,CACX,CE7BkBY,CAAiB/vD,KAAK6e,MAC1BA,GAAc,IAAPrd,EAAWwN,OAAOxN,GF6BhC,SAAmBqd,GACtB,IAAInJ,EAAM,KACV,IAAK,MAAMm6C,KAAQhxC,EACfnJ,IAAQm6C,GAAQ,GAAGxpD,SAAS,KAAc,GAAPwpD,GAAaxpD,SAAS,IAE7D,OAAOqP,CACX,CEnC4Cs6C,CAAUhwD,KAAK6e,MACnD,OFnBD,SAAoBsU,GACvB,OAAQA,EAAG1xB,QACP,KD9Be,EC+BX,OAAO0xB,EAAGtrB,KAAK,KAEnB,KDhCe,GCgCD,CACV,MAAMiN,EAAS,GACf,IAAK,IAAIvT,EAAI,EAAGA,EAAI4xB,EAAG1xB,OAAQF,IACvBA,EAAI,GAAM,GACVuT,EAAOtU,KAAK2yB,EAAG5xB,GAAG8E,SAAS,IAAI4pD,SAAS,EAAG,KACvC98B,EAAG5xB,EAAI,GAAG8E,SAAS,IAAI4pD,SAAS,EAAG,MAG/C,OAAOn7C,EAAOjN,KAAK,IACvB,CACA,QACI,MAAM,IAAIrJ,MAAM,qBAG5B,CEAe0xD,CAAWlwD,KAAKqvD,SAAW,IAAMxwC,CAC5C,EChDG,SAASsxC,GAAOp6B,GACnB,OAAOjpB,QAAQ2hD,GAAU14B,GAC7B,CAEO,SAASq6B,GAAOr6B,GACnB,OAAOjpB,QAAQ6hD,GAAU54B,GAC7B,CAEO,SAASs6B,GAAKt6B,GACjB,OAAOjpB,QAAQ8hD,GAAQ74B,GAC3B,CCTO,MAAMu6B,GAAOH,GACPI,GAAOH,GAGP,GAAU,SAAUj9B,GAC7B,IAAIjwB,EAAS,EAEb,GADAiwB,EAAKA,EAAG9sB,WAAWsB,OACf2oD,GAAKn9B,GAAK,CACV,MAAMrkB,EAAQ,IAAImB,WAAW/M,EAAS,GAItC,OAHAiwB,EAAGzrB,MAAM,OAAOyF,SAAS0iD,IACrB/gD,EAAM5L,KAAiC,IAArBsb,SAASqxC,EAAM,GAAU,IAExC/gD,CACX,CACA,GAAIyhD,GAAKp9B,GAAK,CACV,MAAMq9B,EAAWr9B,EAAGzrB,MAAM,IAAK,GAC/B,IAAInG,EACJ,IAAKA,EAAI,EAAGA,EAAIivD,EAAS/uD,OAAQF,IAAK,CAElC,IAAIkvD,EADSH,GAAKE,EAASjvD,MAGvBkvD,EAAW,GAAQD,EAASjvD,IAC5BivD,EAASjvD,GAAK,GAAmBkvD,EAASvvD,MAAM,EAAG,GAAI,WAE3C,MAAZuvD,KAAsBlvD,EAAI,GAC1BivD,EAAStlD,OAAO3J,EAAG,EAAG,GAAmBkvD,EAASvvD,MAAM,EAAG,GAAI,UAEvE,CACA,GAAoB,KAAhBsvD,EAAS,GACT,KAAOA,EAAS/uD,OAAS,GACrB+uD,EAAS5lD,QAAQ,UAEpB,GAAsC,KAAlC4lD,EAASA,EAAS/uD,OAAS,GAChC,KAAO+uD,EAAS/uD,OAAS,GACrB+uD,EAAShwD,KAAK,UAEjB,GAAIgwD,EAAS/uD,OAAS,EAAG,CAC1B,IAAKF,EAAI,EAAGA,EAAIivD,EAAS/uD,QAA0B,KAAhB+uD,EAASjvD,GAAWA,KAEvD,MAAMmvD,EAAO,CAACnvD,EAAG,GACjB,IAAKA,EAAI,EAAIivD,EAAS/uD,OAAQF,EAAI,EAAGA,IACjCmvD,EAAKlwD,KAAK,KAEdgwD,EAAStlD,OAAO3I,MAAMiuD,EAAUE,EACpC,CACA,MAAM5hD,EAAQ,IAAImB,WAAW/M,EAAS,IACtC,IAAK3B,EAAI,EAAGA,EAAIivD,EAAS/uD,OAAQF,IAAK,CAClC,MAAMy1C,EAAOx4B,SAASgyC,EAASjvD,GAAI,IACnCuN,EAAM5L,KAAa8zC,GAAQ,EAAK,IAChCloC,EAAM5L,KAAmB,IAAP8zC,CACtB,CACA,OAAOloC,CACX,CACA,MAAM,IAAItQ,MAAM,qBACpB,ECzDMmyD,IAAK,EACE3vD,GAAQ,CAAC,EACT8oC,GAAQ,CAAC,EAyEf,SAAS,GAAY6T,GACxB,GAAqB,iBAAVA,EAAoB,CAC3B,GAAoB,MAAhB7T,GAAM6T,GACN,OAAO7T,GAAM6T,GAEjB,MAAM,IAAIn/C,MAAM,0BAA0Bm/C,IAC9C,CACK,GAAqB,iBAAVA,EAAoB,CAChC,GAAoB,MAAhB38C,GAAM28C,GACN,OAAO38C,GAAM28C,GAEjB,MAAM,IAAIn/C,MAAM,0BAA0Bm/C,IAC9C,CACA,MAAM,IAAIn/C,MAAM,oCAAoCm/C,EACxD,CC9DO,SAASiT,GAAgBjT,EAAOnuC,GAEnC,OADiB,GAAYmuC,GACZ5oC,MACb,KAAK,EACL,KAAK,GACD,OAmGZ,SAAkB87C,GACd,MAAMC,EFzEc,SAAUthD,EAAKtM,EAAS,EAAGzB,GAC/CyB,IAAWA,EACXzB,EAASA,GAAW+N,EAAI/N,OAASyB,EACjC,MAAM+0C,EAAO,IAAInB,SAAStnC,EAAIkD,QAC9B,GAAe,IAAXjR,EAAc,CACd,MAAMqT,EAAS,GAEf,IAAK,IAAIvT,EAAI,EAAGA,EAAIE,EAAQF,IACxBuT,EAAOtU,KAAKgP,EAAItM,EAAS3B,IAE7B,OAAOuT,EAAOjN,KAAK,IACvB,CACA,GAAe,KAAXpG,EAAe,CACf,MAAMqT,EAAS,GAEf,IAAK,IAAIvT,EAAI,EAAGA,EAAIE,EAAQF,GAAK,EAC7BuT,EAAOtU,KAAKy3C,EAAKwE,UAAUv5C,EAAS3B,GAAG8E,SAAS,KAEpD,OAAOyO,EAAOjN,KAAK,KACd7B,QAAQ,qBAAsB,UAC9BA,QAAQ,SAAU,KAC3B,CACA,MAAO,EACX,CEkDqB,CAAY6qD,EAAQ,EAAGA,EAAOpvD,QAC/C,GAAgB,MAAZqvD,EACA,MAAM,IAAItyD,MAAM,sBAEpB,IAAK,GAAQsyD,GACT,MAAM,IAAItyD,MAAM,sBAEpB,OAAOsyD,CACX,CA5GmBC,CAASvhD,GACpB,KAAK,GASL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACD,OAAOwhD,GAAUxhD,GAdrB,KAAK,GACD,OAAO,GAAmBA,EAAK,UACnC,KAAK,EACL,KAAK,IACL,KAAK,GACL,KAAK,IACD,OAAOyhD,GAAWzhD,GAAKnJ,WAS3B,KAAK,IACD,OA6IZ,SAAkBmJ,GACd,MAAM/Q,EAAO,EAAc+Q,GACrB8/C,EAAU9/C,EAAItO,MAAM,EAAsBzC,IAChD,GAAI6wD,EAAQ7tD,SAAWhD,EACnB,MAAM,IAAID,MAAM,wBAEpB,OAAO,GAAmB8wD,EAAS,YACvC,CApJmB4B,CAAS1hD,GACpB,KAAK,IAEL,KAAK,IACD,OAqLZ,SAAqBA,GACjB,MAAM2hD,EAAY3hD,EAAItO,MAAM,EAAGsO,EAAI/N,OAAS,GACtC2vD,EAAY5hD,EAAItO,MAAMsO,EAAI/N,OAAS,GAGzC,MAAO,GAFM,GAAmB0vD,EAAW,aAC9BF,GAAWG,IAE5B,CA3LmBC,CAAY7hD,GACvB,KAAK,IACD,OA4HZ,SAAkBA,GACd,MAAM/Q,EAAO,EAAc+Q,GACrBpC,EAAOoC,EAAItO,MAAM,EAAsBzC,IAC7C,GAAI2O,EAAK3L,SAAWhD,EAChB,MAAM,IAAID,MAAM,wBAEpB,MAAO,IAAM,GAAmB4O,EAAM,YAC1C,CAnImBkkD,CAAS9hD,GACpB,KAAK,IACD,OAAOooB,WAAW25B,mBAAmBP,GAAUxhD,IACnD,QACI,OAAO,GAAmBA,EAAK,UAE3C,CAEO,SAAS,GAAemuC,EAAO53C,GAElC,OADiB,GAAY43C,GACZ5oC,MACb,KAAK,EAEL,KAAK,GACD,OAsDZ,SAAkB+7C,GACd,IAAK,GAAQA,GACT,MAAM,IAAItyD,MAAM,sBAEpB,OAAO,GAAWsyD,EACtB,CA3DmBU,CAASzrD,GACpB,KAAK,GASL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACD,OAAO0rD,GAAU1rD,GAdrB,KAAK,GACD,OAAO,GAAqBA,EAAK,UACrC,KAAK,EACL,KAAK,IACL,KAAK,GACL,KAAK,IACD,OAAO2rD,GAAWlzC,SAASzY,EAAK,KASpC,KAAK,IACD,OA0EZ,SAAkBqH,GACd,IAAIukD,EAEAA,EADY,MAAZvkD,EAAK,IAA0B,MAAZA,EAAK,GACnB,GAAcm+B,GAAUvvB,OAAO,IAAI5O,MAAS0B,MAG5Cg/B,GAAIxoB,MAAMlY,GAAM4/B,UAAUl+B,MAGnC,MAAMrQ,EAAOwR,WAAWsO,KAAK,EAAcozC,EAAGlwD,SAC9C,OAAO,GAAiB,CAAChD,EAAMkzD,GAAKlzD,EAAKgD,OAASkwD,EAAGlwD,OACzD,CArFmBmwD,CAAS7rD,GACpB,KAAK,IACD,OA4GZ,SAAqBA,GACjB,MAAM+oD,EAAO/oD,EAAI2B,MAAM,KACvB,GAAoB,IAAhBonD,EAAKrtD,OACL,MAAM,IAAIjD,MAAM,kCAAkCswD,EAAKjnD,KAAK,8CAEhE,GAAuB,KAAnBinD,EAAK,GAAGrtD,OACR,MAAM,IAAIjD,MAAM,+BAA+BswD,EAAK,+BAGxD,MAAMt/C,EAAM6mB,GAAOra,OAAO,IAAM8yC,EAAK,IAE/B+C,EAAOrzC,SAASswC,EAAK,GAAI,IAC/B,GAAI+C,EAAO,GAAKA,EAAO,MACnB,MAAM,IAAIrzD,MAAM,yCAEpB,MAAMszD,EAAUJ,GAAWG,GAC3B,OAAO,GAAiB,CAACriD,EAAKsiD,GAAUtiD,EAAI/N,OAASqwD,EAAQrwD,OACjE,CA7HmBswD,CAAYhsD,GACvB,KAAK,IACD,OA4HZ,SAAsBA,GAClB,MAAM+oD,EAAO/oD,EAAI2B,MAAM,KACvB,GAAoB,IAAhBonD,EAAKrtD,OACL,MAAM,IAAIjD,MAAM,kCAAkCswD,EAAKjnD,KAAK,8CAEhE,GAAuB,KAAnBinD,EAAK,GAAGrtD,OACR,MAAM,IAAIjD,MAAM,+BAA+BswD,EAAK,gCAGxD,MAAMt/C,EAAM6mB,GAAOra,OAAO,IAAI8yC,EAAK,MAE7B+C,EAAOrzC,SAASswC,EAAK,GAAI,IAC/B,GAAI+C,EAAO,GAAKA,EAAO,MACnB,MAAM,IAAIrzD,MAAM,yCAEpB,MAAMszD,EAAUJ,GAAWG,GAC3B,OAAO,GAAiB,CAACriD,EAAKsiD,GAAUtiD,EAAI/N,OAASqwD,EAAQrwD,OACjE,CA7ImBuwD,CAAajsD,GACxB,KAAK,IACD,OAgFZ,SAAkBksD,GACd,MAAMC,EAAKC,GAAen2C,OAAOi2C,GAC3BxzD,EAAOwR,WAAWsO,KAAK,EAAc2zC,EAAGzwD,SAC9C,OAAO,GAAiB,CAAChD,EAAMyzD,GAAKzzD,EAAKgD,OAASywD,EAAGzwD,OACzD,CApFmB2wD,CAASrsD,GACpB,KAAK,IACD,OAAO0rD,GAAU75B,WAAWy6B,mBAAmBtsD,IACnD,QACI,OAAO,GAAqBA,EAAK,UAE7C,CDnGqB,CACjB,CAAC,EAAG,GAAI,OACR,CAAC,EAAG,GAAI,OACR,CAAC,GAAI,GAAI,QACT,CAAC,GAAI,IAAK,OACV,CAAC,GAAI4qD,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,WAGPxjD,SAAQmlD,IACV,MAAM3U,EAIH,SAAwB5oC,EAAMtW,EAAMsC,EAAMwxD,EAAYvyC,GACzD,MAAO,CACHjL,OACAtW,OACAsC,OACAwxD,WAAYzlD,QAAQylD,GACpBvyC,KAAMlT,QAAQkT,GAEtB,CAZkBwyC,IAAkBF,GAChCxoB,GAAM6T,EAAM5oC,MAAQ4oC,EACpB38C,GAAM28C,EAAM58C,MAAQ48C,CAAK,ICxCT,GAAY,OACZ,GAAY,OACT,GAAY,UAyGnC,MAAMvU,GAAWzqC,OAAOsE,OAAO4sC,IAAOvrC,KAAK6C,GAAMA,EAAEypB,UAC7CuhC,GAAiB,WACnB,IAAInX,EAAM5R,GAAS,GAAGF,GAAGE,GAAS,IAElC,OADAA,GAASloC,MAAM,GAAGiM,SAASsP,GAAOu+B,EAAMA,EAAI9R,GAAGzsB,KACxCu+B,CACV,CAJsB,GAqBvB,SAAS0W,GAAWG,GAChB,MAAMriD,EAAM,IAAIqC,YAAY,GAG5B,OAFa,IAAIilC,SAAStnC,GACrButC,UAAU,EAAG8U,GACX,IAAI5hD,WAAWT,EAC1B,CACA,SAASyhD,GAAWzhD,GAEhB,OADa,IAAIsnC,SAAStnC,EAAIkD,QAClB+pC,UAAUjtC,EAAI+3B,WAC9B,CACA,SAASkqB,GAAU1rD,GACf,MAAMyJ,EAAM,GAAqBzJ,GAC3BtH,EAAOwR,WAAWsO,KAAK,EAAc/O,EAAI/N,SAC/C,OAAO,GAAiB,CAAChD,EAAM+Q,GAAM/Q,EAAKgD,OAAS+N,EAAI/N,OAC3D,CACA,SAASuvD,GAAUxhD,GACf,MAAM/Q,EAAO,EAAc+Q,GAE3B,IADAA,EAAMA,EAAItO,MAAM,EAAsBzC,KAC9BgD,SAAWhD,EACf,MAAM,IAAID,MAAM,wBAEpB,OAAO,GAAmBgR,EAC9B,CC5GO,SAASijD,GAAsB3jD,GAClC,MAAM4jD,EAAS,GACTC,EAAe,GACrB,IAAI3yC,EAAO,KACPze,EAAI,EACR,KAAOA,EAAIuN,EAAMrN,QAAQ,CACrB,MAAMsT,EAAO,EAAcjG,EAAOvN,GAC5BiS,EAAI,EAAsBuB,GAC1B2pB,EAAI,GAAY3pB,GAChBtW,EAAOm0D,GAAYl0B,EAAG5vB,EAAM5N,MAAMK,EAAIiS,IAC5C,GAAa,IAAT/U,EAAY,CACZi0D,EAAOlyD,KAAK,CAACuU,IACb49C,EAAanyD,KAAK,CAACuU,IACnBxT,GAAKiS,EAEL,QACJ,CACA,MAAMs7C,EAAOhgD,EAAM5N,MAAMK,EAAIiS,EAAGjS,EAAIiS,EAAI/U,GAExC,GADA8C,GAAM9C,EAAO+U,EACTjS,EAAIuN,EAAMrN,OACV,MAAM,IAAI,GAAW,+BAAiC,GAAmBqN,EAAO,WAGpF4jD,EAAOlyD,KAAK,CAACuU,EAAM+5C,IACnB,MAAM+D,EAAajC,GAAgB77C,EAAM+5C,GAEzC,GADA6D,EAAanyD,KAAK,CAACuU,EAAM89C,KACV,IAAXn0B,EAAE1e,KAAe,CAIjBA,EAAO6yC,EACP,KACJ,CACJ,CACA,MAAO,CACH/jD,MAAOmB,WAAWsO,KAAKzP,GACvByB,OAAQuiD,GAAqBH,GAC7BD,SACAC,eACA3yC,OAER,CAkBA,SAAS8yC,GAAqBJ,GAC1B,MAAMt1C,EAAQ,GASd,OARAs1C,EAAOpuD,KAAKyuD,IACR,MAAMpV,EAAQ,GAAYoV,EAAI,IAK9B,OAJA31C,EAAM5c,KAAKm9C,EAAM58C,MACbgyD,EAAItxD,OAAS,GAAe,MAAVsxD,EAAI,IACtB31C,EAAM5c,KAAKuyD,EAAI,IAEZ,IAAI,IAERC,GAAU51C,EAAMvV,KAAK,KAChC,CAIO,SAAS,GAAc6qD,GAC1B,OAAO,GAAiBA,EAAOpuD,KAAKyuD,IAChC,MAAMpV,EAAQ,GAAYoV,EAAI,IAC9B,IAAIvjD,EAAMS,WAAWsO,KAAK,EAAco/B,EAAM5oC,OAI9C,OAHIg+C,EAAItxD,OAAS,GAAe,MAAVsxD,EAAI,KACtBvjD,EAAM,GAAiB,CAACA,EAAKujD,EAAI,MAE9BvjD,CAAG,IAElB,CAIA,SAASojD,GAAYl0B,EAAGowB,GACpB,GAAIpwB,EAAEjgC,KAAO,EACT,OAAOigC,EAAEjgC,KAAO,EAEf,GAAe,IAAXigC,EAAEjgC,KACP,OAAO,EAEN,CACD,MAAMA,EAAO,EAAcqwD,aAAgB7+C,WAAa6+C,EAAO7+C,WAAWsO,KAAKuwC,IAC/E,OAAOrwD,EAAO,EAAsBA,EACxC,CACJ,CAyBO,SAASu0D,GAAUjtD,GACtB,MAAO,IAAMA,EAAI4B,OAAOD,MAAM,KAAKmF,QAAQ8T,GAAMA,IAAG9Y,KAAK,IAC7D,CACO,MAAM,WAAmBrJ,MAC5By0D,YAAc,aACdlyD,KAAO,aACP,WAAAuO,CAAYvJ,GACRqqC,MAAM,0BAA0BrqC,IACpC,EClLJ,MAAMmtD,GAAUzvB,OAAOmL,IAAI,8BACd,GAASnL,OAAOmL,IAAI,wCAC3BukB,GAAY,CACd,GAAY,OAAOp+C,KACnB,GAAY,QAAQA,KACpB,GAAY,QAAQA,KACpB,GAAY,WAAWA,MAE3B,MAAMq+C,WAAiC50D,MACnC,WAAA8Q,CAAY9C,EAAU,yBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,0BAChB,EAKG,MAAMsyD,GACTvkD,MACA,GACA,GACA,GACA,GACA,CAAC,KAAU,EACX,WAAAQ,CAAYw/C,GAKR,IAAI1xC,EACJ,GAJY,MAAR0xC,IACAA,EAAO,IAGPA,aAAgB7+C,WAChBmN,EAAQq1C,GAAsB3D,QAE7B,GAAoB,iBAATA,EAAmB,CAC/B,GAAIA,EAAKrtD,OAAS,GAAwB,MAAnBqtD,EAAKjoD,OAAO,GAC/B,MAAM,IAAIrI,MAAM,cAAcswD,4BAElC1xC,EDxCL,SAAgCrX,GAEnC,MAAM2sD,EAAS,GACTC,EAAe,GACrB,IAAI3yC,EAAO,KACX,MAAM5C,GAJNrX,EAAMitD,GAAUjtD,IAIE2B,MAAM,KAAKxG,MAAM,GACnC,GAAqB,IAAjBkc,EAAM3b,QAA6B,KAAb2b,EAAM,GAC5B,MAAO,CACHtO,MAAO,IAAImB,WACXM,OAAQ,IACRmiD,OAAQ,GACRC,aAAc,GACd3yC,KAAM,MAGd,IAAK,IAAI0e,EAAI,EAAGA,EAAIthB,EAAM3b,OAAQi9B,IAAK,CACnC,MACMif,EAAQ,GADDvgC,EAAMshB,IAEnB,GAAmB,IAAfif,EAAMl/C,KAAY,CAClBi0D,EAAOlyD,KAAK,CAACm9C,EAAM5oC,OACnB49C,EAAanyD,KAAK,CAACm9C,EAAM5oC,OAEzB,QACJ,CAEA,GADA2pB,IACIA,GAAKthB,EAAM3b,OACX,MAAM,IAAI,GAAW,oBAAsBsE,GAG/C,IAAmB,IAAf43C,EAAM39B,KAAe,CAIrBA,EAAOgzC,GAAU51C,EAAMlc,MAAMw9B,GAAG72B,KAAK,MACrC6qD,EAAOlyD,KAAK,CAACm9C,EAAM5oC,KAAM,GAAe4oC,EAAM5oC,KAAMiL,KACpD2yC,EAAanyD,KAAK,CAACm9C,EAAM5oC,KAAMiL,IAC/B,KACJ,CACA,MAAMlR,EAAQ,GAAe6uC,EAAM5oC,KAAMqI,EAAMshB,IAC/Cg0B,EAAOlyD,KAAK,CAACm9C,EAAM5oC,KAAMjG,IACzB6jD,EAAanyD,KAAK,CAACm9C,EAAM5oC,KAAM67C,GAAgBjT,EAAM5oC,KAAMjG,IAC/D,CACA,MAAO,CACHyB,OAAQuiD,GAAqBH,GAC7B7jD,MAAO,GAAc4jD,GACrBA,SACAC,eACA3yC,OAER,CCToBszC,CAAuBxE,EACnC,KACK,KAAIyE,GAAYzE,GAIjB,MAAM,IAAItwD,MAAM,uDAHhB4e,EAAQq1C,GAAsB3D,EAAKhgD,MAIvC,CACA9O,KAAK8O,MAAQsO,EAAMtO,MACnB9O,MAAK,EAAUod,EAAM7M,OACrBvQ,MAAK,EAAUod,EAAMs1C,OACrB1yD,MAAK,EAAgBod,EAAMu1C,aAC3B3yD,MAAK,EAAQod,EAAM4C,IACvB,CACA,QAAA3Z,GACI,OAAOrG,MAAK,CAChB,CACA,MAAAqb,GACI,OAAOrb,KAAKqG,UAChB,CACA,SAAAmtD,GACI,IAAIC,EACAC,EACAC,EACA9B,EACA+B,EAAO,GACX,MAAMC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAO,GAAY,QACnBC,EAAU,GAAY,WAC5B,IAAK,MAAOn/C,EAAM/V,KAAUgB,KAAK2yD,eACzB59C,IAASm/C,EAAQn/C,OACjB6+C,EAAO,IAAI50D,GAAS,MAGpBm0D,GAAUnoC,SAASjW,KACnB2+C,EAAyB,QAAbG,EAAI9yD,KAAiB,MAAQ,MACzC8wD,EAAO,IACP8B,EAAO,GAAG30D,GAAS,KAAK40D,IACxBH,EAAS1+C,IAASk/C,EAAKl/C,KAAO,EAAI,GAElCA,IAAS8+C,EAAI9+C,MAAQA,IAAS++C,EAAI/+C,OAClC2+C,EAAuC,QAA3B,GAAY3+C,GAAMhU,KAAiB,MAAQ,MACvD8wD,EAAOrzC,SAASxf,GAAS,KAEzB+V,IAASg/C,EAAIh/C,MAAQA,IAASi/C,EAAIj/C,OAClC2+C,EAAuC,QAA3B,GAAY3+C,GAAMhU,KAAiB,MAAQ,MACvD4yD,EAAO,GAAG30D,GAAS,KAAK40D,IACxBH,EAAS1+C,IAASi/C,EAAIj/C,KAAO,EAAI,GAGzC,GAAc,MAAV0+C,GAA+B,MAAbC,GAA6B,MAARC,GAAwB,MAAR9B,EACvD,MAAM,IAAIrzD,MAAM,uGAQpB,MANa,CACTi1D,SACAE,OACAD,YACA7B,OAGR,CACA,MAAAsC,GACI,OAAOn0D,MAAK,EAAQsE,KAAI,EAAEyQ,KAAUpW,OAAO01B,OAAO,CAAC,EAAG,GAAYtf,KACtE,CACA,UAAAq/C,GACI,OAAOp0D,MAAK,EAAQsE,KAAI,EAAEyQ,KAAUA,GACxC,CACA,UAAAs/C,GACI,OAAOr0D,MAAK,EAAQsE,KAAI,EAAEyQ,KAAU,GAAYA,GAAMhU,MAC1D,CACA,MAAA2xD,GACI,OAAO1yD,MAAK,EAAQsE,KAAI,EAAEyQ,EAAM/V,KACf,MAATA,EACO,CAAC+V,GAEL,CAACA,EAAM/V,IAEtB,CACA,YAAA2zD,GACI,OAAO3yD,MAAK,EAAcsE,KAAI,EAAEyQ,EAAM/V,KACrB,MAATA,EACO,CAAC+V,GAEL,CAACA,EAAM/V,IAEtB,CACA,WAAAs1D,CAAYxF,GAER,OADAA,EAAO,IAAIuE,GAAUvE,GACd,IAAIuE,GAAUrzD,KAAKqG,WAAayoD,EAAKzoD,WAChD,CACA,WAAAkuD,CAAYzF,GACR,MAAM0F,EAAa1F,EAAKzoD,WAClBtD,EAAI/C,KAAKqG,WACT9E,EAAIwB,EAAE2uB,YAAY8iC,GACxB,GAAIjzD,EAAI,EACJ,MAAM,IAAI/C,MAAM,WAAWwB,KAAKqG,2CAA2CyoD,EAAKzoD,cAEpF,OAAO,IAAIgtD,GAAUtwD,EAAE7B,MAAM,EAAGK,GACpC,CACA,eAAAkzD,CAAgB1/C,GACZ,MAAM29C,EAAS1yD,KAAK0yD,SACpB,IAAK,IAAInxD,EAAImxD,EAAOjxD,OAAS,EAAGF,GAAK,EAAGA,IACpC,GAAImxD,EAAOnxD,GAAG,KAAOwT,EACjB,OAAO,IAAIs+C,GAAU,GAAcX,EAAOxxD,MAAM,EAAGK,KAG3D,OAAOvB,IACX,CACA,SAAA00D,GACI,IACI,IAAIhC,EAAS,GACb1yD,KAAK2yD,eAAexlD,SAAQ,EAAE4H,EAAMhU,MAC5BgU,IAAS/T,GAAM2zD,IAAI5/C,MACnB29C,EAAOlyD,KAAK,CAACuU,EAAMhU,IAInBgU,IAAS/T,GAAM,eAAe+T,OAC9B29C,EAAS,GACb,IAGJ,MAAMkC,EAAQlC,EAAOl1B,MACrB,GAAkB,MAAdo3B,IAAQ,GAAY,CACpB,MAAM5N,EAAY4N,EAAM,GAGxB,MAAqB,MAAjB5N,EAAU,IAA+B,MAAjBA,EAAU,GAC3B,GAAmBzb,GAAUvvB,OAAO,IAAIgrC,KAAc,aAG1D,GAAmBlZ,GAAIxoB,MAAM0hC,GAAWha,UAAUl+B,MAAO,YACpE,CACA,OAAO,IACX,CACA,MAAOmV,GACH,OAAO,IACX,CACJ,CACA,OAAA4wC,GACI,OAAO70D,MAAK,CAChB,CACA,MAAAsuC,CAAOwgB,GACH,OAAO,GAAiB9uD,KAAK8O,MAAOggD,EAAKhgD,MAC7C,CACA,aAAM5K,CAAQ+V,GACV,MAAM66C,EAAkB90D,KAAKm0D,SAAS76B,MAAMoF,GAAMA,EAAE6zB,aAEpD,GAAuB,MAAnBuC,EACA,MAAO,CAAC90D,MAEZ,MAAM+0D,EAAWC,GAAU51D,IAAI01D,EAAgB/zD,MAC/C,GAAgB,MAAZg0D,EACA,MAAM,IAAI3B,GAAyB,6BAA6B0B,EAAgB/zD,QAGpF,aADqBg0D,EAAS/0D,KAAMia,IACtB3V,KAAIyB,GAAO,GAAUA,IACvC,CACA,WAAAkvD,GACI,MAAMh7C,EAAUja,KAAKwzD,YACrB,GAA0B,QAAtBv5C,EAAQy5C,WAA6C,QAAtBz5C,EAAQy5C,UACvC,MAAM,IAAIl1D,MAAM,gEAAgEyb,EAAQy5C,kEAE5F,MAAO,CACHD,OAAQx5C,EAAQw5C,OAChBnE,QAASr1C,EAAQ05C,KACjB9B,KAAM53C,EAAQ43C,KAEtB,CACA,kBAAAqD,CAAmBpG,GACf,MAAMqF,GAAUrF,GAAQ9uD,MAAMm0D,SAC9B,QAAsB,IAAlBA,EAAO1yD,QAGY,IAAnB0yD,EAAO,GAAGp/C,MAAiC,KAAnBo/C,EAAO,GAAGp/C,MAGf,IAAnBo/C,EAAO,GAAGp/C,MAAiC,MAAnBo/C,EAAO,GAAGp/C,KAI1C,CAaA,CAACm+C,MACG,MAAO,aAAalzD,MAAK,IAC7B,EChJG,MAAMg1D,GAAY,IAAInnB,IAsHtB,SAAS0lB,GAAYv0D,GACxB,OAAO8N,QAAQ9N,IAAQ,IAC3B,CAcO,SAAS,GAAU8vD,GACtB,OAAO,IAAIuE,GAAevE,EAC9B,CCzOA,MACM,GAAM,IAAI5R,GAAO,cAChB,MAAMiY,GACTC,MACAzL,OACA1vC,QACAo7C,oBAAsB,IAAIxnB,IAC1BynB,qBAAuB,IAAIznB,IAC3B,WAAAv+B,EAAY,QAAE2K,EAAO,MAAEm7C,EAAK,OAAEzL,IAC1B3pD,KAAKia,QAAUA,EACfja,KAAKo1D,MAAQA,EACbp1D,KAAK2pD,OAASA,CAClB,CACA,KAAA3iD,CAAM+/C,GAEF/mD,KAAKsmB,KAAKygC,GACV,MAAQwO,cAAeC,EAAgBC,eAAgBC,GAAoB11D,KAAKia,QAC1E+sC,EAAYD,EAAO1gD,WAGzB,GAAuB,IAAnBmvD,EAAsB,CACtB,MAAMG,EAAWC,aAAY,KACpB,WACD,IAAIpL,EACJ,IAGI,IACIA,QAAaxqD,KAAK2pD,OAAOkM,SAASrL,KAAKA,KAAKzD,GAC5C,GAAIxS,KAAK,mBAAmByS,KAAcwD,EAC9C,CACA,MAAOhjC,GAIH,YAHA,GAAIA,MAAM,yBAAyBw/B,uDACdwO,6BAGzB,CACA,UACUx1D,KAAK2pD,OAAOmM,UAAUzyC,MAAM0jC,EAAQ,CACtCmB,SAAU,CACNsC,KAAM,GAAYA,EAAKnkD,cAGnC,CACA,MAAO4d,GACH,GAAIuD,MAAM,wBAAyBvD,EACvC,CACJ,CACA,MAAOA,GACH,GAAIuD,MAAM,gBAAgBw/B,KAAc/iC,EAC5C,CACH,EA7BI,EA6BD,GACY,IAAjBuxC,GACHx1D,KAAKq1D,oBAAoB/1D,IAAI0nD,EAAW2O,EAC5C,CACA,MAAMP,EAAQp1D,KAAKo1D,MACnB,GAAIA,GAA6B,IAApBM,EAAuB,CAChC,MAAMK,EAAY/1D,KAAKg2D,mBAAmBZ,EAAOM,EAAiB3O,EAAO1gD,YACzErG,KAAKs1D,qBAAqBh2D,IAAIynD,EAAQgP,EAC1C,CACJ,CACA,IAAAzvC,CAAKygC,GACD,MAAMC,EAAYD,EAAO1gD,WACrBrG,KAAKq1D,oBAAoBp2D,IAAI+nD,KAC7BiP,cAAcj2D,KAAKq1D,oBAAoBj2D,IAAI4nD,IAC3ChnD,KAAKq1D,oBAAoBnO,OAAOF,IAEhChnD,KAAKs1D,qBAAqBr2D,IAAI8nD,KAC9B/mD,KAAKs1D,qBAAqBl2D,IAAI2nD,IAASziD,IAAI2xD,eAC3Cj2D,KAAKs1D,qBAAqBpO,OAAOH,GAEzC,CACA,OAAAmP,GACI,IAAK,MAAMC,IAAS,IACbx3D,OAAOsE,OAAOjD,KAAKq1D,wBACnB12D,OAAOsE,OAAOjD,KAAKs1D,uBAEtBW,cAAcE,GAElBn2D,KAAKq1D,oBAAoB91D,QACzBS,KAAKs1D,qBAAqB/1D,OAC9B,CACA,gBAAA62D,GACI,OAAQp2D,KAAKq1D,oBAAoB52D,KAAO,GAAKuB,KAAKs1D,qBAAqB72D,KAAO,CAClF,CACA,kBAAAu3D,CAAmBZ,EAAOM,EAAiB1O,GAEvC,MAAM+O,EAAY,GAClB,IAAK,MAAMziB,KAAS8hB,EAAM7Z,aAAc,CAEpC,IADkB6Z,EAAMiB,aAAa/iB,GACtBtoB,SAASg8B,GACpB,SACJ,MAAMr2B,EAAUutB,GAAc,CAC1B5B,qBAAsBhB,GAA6BhI,GACnDnB,aA9Fc,0BA+Fde,WAAW,IAETyiB,EAAWC,aAAY,KACzB,GAAIrhB,KAAK,mCACT6gB,EACK3kC,KAAKE,EAAS,CAAEmiB,QAAS,IAAI7iC,WAAW,CAAC,MACzCqzB,OAAOrf,GAAM,GAAIuD,MAAM,4BAA6BvD,IAAG,GAC3C,IAAlByxC,GACHK,EAAUv1D,KAAKm1D,EACnB,CACA,OAAOI,CACX,ECvGG,MAAMO,GAAe5O,IACxB,IAAKA,EACD,OAAQ,EAEZ,IACI,MAAM54C,EAAQ44C,EAAKQ,SAAS9oD,IAAI,QAChC,OAAK0P,EAGEvE,OAAOswC,GAAY/rC,KAFd,CAGhB,CACA,MAAOmV,GACH,OAAQ,CACZ,GCXE,GAAM,IAAIi5B,GAAO,sBAMhB,MAAMqZ,WAA0BnK,GAEnC7Q,aACAib,iBACAv8C,QACA0vC,OACA8M,oBAAsB,IAAI5oB,IAC1B6oB,kBAAoB,IAAI7oB,IACxB8oB,+BAAiC,EACjCC,qBAAuB,GACvBC,uBAAwB,EACxB,WAAAC,GACI,QAAIl/B,YAAYgD,YAAchD,YAAYgD,WAAWm8B,SAG9C/2D,KAAK62D,qBAChB,CACA,IAAAvwC,GACItmB,KAAKw2D,iBAAiBN,UACtBl2D,KAAK2pD,OAAOrF,oBAAoB,eAAgBtkD,KAAKg3D,gBAAgB,iBACrEh3D,KAAK2pD,OAAOrF,oBAAoB,kBAAmBtkD,KAAKg3D,gBAAgB,oBACxEh3D,KAAK2pD,OAAOrF,oBAAoB,iBAAkBtkD,KAAKg3D,gBAAgB,mBACvEh3D,KAAKi3D,2BACT,CACA,oBAAMC,CAAenQ,GACjB,IACI/mD,KAAKw2D,iBAAiBlwC,KAAKygC,SACrB/mD,KAAK2pD,OAAOwN,OAAOpQ,GACzB,GAAIxS,KAAK,gCAAgCwS,EAAO1gD,aACpD,CACA,MAAOmhB,GACH,GAAIA,MAAM,uCAAuCu/B,EAAO1gD,gBAAgBmhB,IAC5E,CACJ,CACA,yBAAM4vC,GACF,MAAMC,QAAwBr3D,KAAK2pD,OAAOmM,UAAU1Q,MAC9CkS,EAAiBt3D,KAAK2pD,OACvBjD,iBACApiD,KAAKizD,GAASA,EAAK7M,aAClB8M,EAA6B,GAC7BC,EAAgC,GAChCC,EAAyB,GACzBC,EAA4B,GAC5BC,EAA+B,GAC/BC,EAAwB,GAC9B,IAAK,MAAMnQ,KAAQ2P,EAAiB,CAChC,MAAMS,QAAa93D,KAAK+3D,mBAAmBrQ,EAAKh3C,IAC5ConD,EAAK9sC,SAASsvB,GAAK0d,WACnBR,EAA2Bh3D,KAAKknD,GAE3BoQ,EAAK9sC,SAASsvB,GAAK2d,eACxBR,EAA8Bj3D,KAAKknD,GAE9BoQ,EAAK9sC,SAASsvB,GAAK4d,QACxBR,EAAuBl3D,KAAKknD,EAEpC,CACA,IAAK,MAAMX,KAAUuQ,EAAgB,CACjC,MAAM5P,QAAa1nD,KAAK2pD,OAAOmM,UAAU12D,IAAI2nD,GACvC+Q,QAAa93D,KAAK+3D,mBAAmBhR,GACvC+Q,EAAK9sC,SAASsvB,GAAK0d,WACnBL,EAA0Bn3D,KAAKknD,GAE1BoQ,EAAK9sC,SAASsvB,GAAK2d,eACxBL,EAA6Bp3D,KAAKknD,GAE7BoQ,EAAK9sC,SAASsvB,GAAK4d,QACxBL,EAAsBr3D,KAAKknD,EAEnC,CACA,MAAO,CACHyQ,WAAY,CACR,CAAC7d,GAAK0d,WAAYR,EAClB,CAACld,GAAK2d,eAAgBR,EACtB,CAACnd,GAAK4d,OAAQR,GAElBU,UAAW,CACP,CAAC9d,GAAK0d,WAAYL,EAClB,CAACrd,GAAK2d,eAAgBL,EACtB,CAACtd,GAAK4d,OAAQL,GAG1B,CACA,WAAAvoD,CAAY2K,GACRm2B,QACApwC,KAAK2pD,OAAS1vC,EAAQ0vC,OACtB3pD,KAAKu7C,aAAethC,EAAQshC,aAC5Bv7C,KAAKia,QAAU,CACXo+C,uBA5F+B,EA6F/BC,yBA9FgC,EA+FhCC,iBA7FuB,EA8FvBhD,cA7FwB,IA8FxBE,eA7FyB,OA8FtBx7C,EAAQse,QAEfv4B,KAAKw2D,iBAAmB,IAAIrB,GAAiB,CACzCC,MAAOn7C,EAAQm7C,MACfzL,OAAQ1vC,EAAQ0vC,OAChB1vC,QAAS,CACLs7C,cAAev1D,KAAKia,QAAQs7C,cAC5BE,eAAgBz1D,KAAKia,QAAQw7C,kBAGrCz1D,KAAKw4D,sBACAj1B,MAAK,IAAM,GAAIgR,KAAK,uCACpBjR,OAAO9b,GAAU,GAAIA,MAAM,yCAA0CA,KAI1ExnB,KAAKy4D,qBAAqBn1B,OAAO9b,GAAU,GAAIA,MAAM,kDAAmDA,IAC5G,CACA,uBAAMkxC,CAAkBrxB,GACpB,MAAMsxB,EAAU34D,KAAK2pD,OAAOiP,WAC5B,OAAuB,IAAnBD,EAAQl3D,OACD,UAES86B,QAAQ6oB,IAAIuT,EAAQr0D,KAAI6oC,MAAOz8B,IAC/C,IACI,aAAa1Q,KAAK2pD,OAAOmM,UAAU12D,IAAIsR,EAC3C,CACA,MAAOuT,GACH,OAAO,IACX,OAGCpX,QAAQ6xB,KAAQA,IAChB7xB,QAAQ6xB,IAAO2I,GAAQ3I,EAAEkpB,UAAU58B,SAASqc,KAC5Cj5B,MAAK,CAACi7B,EAAMj0B,IAAUkhD,GAAYjtB,GAAQitB,GAAYlhD,IAC/D,CACA,wBAAMqjD,GACF,MAAMpjB,QAAkBr1C,KAAK2pD,OAAOmM,UAAU1Q,MACxCyT,EAAe,GACrB,IAAK,MAAMC,KAAYzjB,EACfr1C,KAAK2pD,OAAOjD,iBAAiBptB,MAAMnyB,GAAMA,EAAEujD,aAAeoO,EAASpoD,MAEvEmoD,EAAar4D,KAAKR,KAAK+4D,YAAYD,EAASpoD,KAEhD,UACU6rB,QAAQ6oB,IAAIyT,EACtB,CACA,MAAOrxC,GACH,GAAIA,MAAM,kDAAmDA,EACjE,CACJ,CACA,yBAAMgxC,GACFx4D,KAAKg5D,6BACLh5D,KAAKi5D,8BACLj5D,KAAKk5D,iCACLl5D,KAAKm5D,4BACT,CAwCA,cAAMC,CAAS1R,GACX,IAAIJ,EACAP,EACJ,MAAMsS,EAAer5D,KAAKs5D,oBAAoB5R,GACxCV,EAAY0F,GAAS2M,GACrBA,EAAahzD,WACbgzD,EAAa3E,YACnB10D,KAAK22D,gCAAkC,EACvC,IAAI4C,EAAc,EAClB,KAAOA,EAAcv5D,KAAKia,QAAQo+C,wBAC9B,IACI,GAAI9jB,KAAK,gBAAgB8kB,gBAA2BE,EAAc,KAClEjS,QAAmBtnD,KAAK2pD,OAAO6P,KAAKH,GACpCtS,EAASO,EAAWoD,WACpB,MAAMoN,QAAa93D,KAAK+3D,mBAAmBhR,GAG3C/mD,KAAK2pD,OAAOjD,eAAeK,GAAQ55C,SAASoqD,IACxCA,EAAKO,KAAOn2D,MAAM4c,KAAK,IAAI48B,IAAI,IAAIoc,EAAKO,QAASA,IAAO,IAI5D93D,KAAKy2D,oBAAoBn3D,IAAIynD,EAAO1gD,YAAa,GAEjDrG,KAAKw2D,iBAAiBxvD,MAAM+/C,GAC5B,KACJ,CACA,MAAOv/B,GACCA,aAAiBiyC,eAEjB,GAAIjyC,MAAM,sBAAsBw/B,OAAex/B,EAAML,UAIrD,GAAIK,MAAM,sBAAsBw/B,OAAex/B,EAAMhb,WAEzDxM,KAAK02D,kBAAkBp3D,IAAI0nD,EAAWx/B,GACtC+xC,IACAv5D,KAAKy2D,oBAAoBn3D,IAAI0nD,EAAWuS,EAC5C,CAMJ,GAHAv5D,KAAK22D,iCACL32D,KAAK05D,mBAEDH,IAAgBv5D,KAAKia,QAAQo+C,uBAC7B,IACI,MAAM7wC,EAAQxnB,KAAK02D,kBAAkBt3D,IAAI4nD,GACzC,GAAIx/B,EAAO,CACP,IAAIk9B,EACAl9B,aAAiBiyC,eACZjyC,EAAML,OAGsB,IAAxBK,EAAML,OAAO1lB,OAClB,GAAIyL,KAAK,4CAGTw3C,EAAer/B,KAAKE,UAAUiC,EAAML,OAAO,IAN3C,GAAIja,KAAK,4CAUbw3C,EAAel9B,EAAMhb,QAEzB,GAAI+nC,KAAK,4BAA4ByS,8BAAsCtC,IAC/E,CACA1kD,KAAK02D,kBAAkBxP,OAAOF,GAC1BD,SACM/mD,KAAK2pD,OAAOmM,UAAU5O,OAAOH,SAGjC/mD,KAAK25D,qBACf,CACA,MAAOnyC,GACH,MAAM,IAAIhpB,MAAM,kCAAkCwoD,uBAA+Bx/B,IACrF,CAEJ,IAAK8/B,EACD,MAAM,IAAI9oD,MAAM,uBAAuB66D,KAE3C,OAAO/R,CACX,CAQA,8BAAMsS,CAAyBlS,EAAMmS,GACjC,MAAMR,EAAer5D,KAAKs5D,oBAAoB5R,GAC9C,aAAa1nD,KAAK2pD,OAAOmQ,aAAaT,EAAcQ,EACxD,CAMA,mBAAAP,CAAoB5R,GAChB,GAAIgF,GAAShF,GACT,OAAOA,EAEN,CAED,MAAMqS,EAAK,GAAUrS,GAErB,IADkBqS,EAAGrF,YAEjB,MAAM,IAAIl2D,MAAM,6CAEpB,OAAOu7D,CACX,CACJ,CACA,yBAAMJ,GACF,GAAI35D,KAAK2pD,OAAOjD,iBAAiBjlD,OAAS,EACtC,OACJ,UAAWzB,KAAK2pD,OAAOmM,UAAU1Q,OAAO3jD,OAAS,EAC7C,OACJ,GAAI8yC,KAAK,wCACT,MAAMylB,EAAer7D,OAAOsE,OAAOjD,KAAK2pD,OAAOvB,WAAWA,YAAY9uB,MAAMj6B,MACpEA,IAAKA,EAAEgH,WACAhH,EAAEgH,WAAW2kB,SAASyvB,MAIhCuf,SAECA,EAAaC,WACvB,CACA,gBAAAP,GACI,GAAI15D,KAAK42D,qBAAqBn1D,OAAS,GACnCzB,KAAK22D,+BAAiC32D,KAAKia,QAAQs+C,iBAAkB,CACrE,MAAMxR,EAAS/mD,KAAK42D,qBAAqBtuD,QACzC,IAAKy+C,EACD,OACJ/mD,KAAK+4D,YAAYhS,GAAQzjB,OAAO9b,IAC5B,GAAIA,MAAMA,EAAM,GAExB,CACJ,CACA,0BAAAwxC,GACIh5D,KAAK2pD,OAAOvF,iBAAiB,iBAAkBpkD,KAAKg3D,gBAAgB,kBACxE,CACA,2BAAAiC,GACIj5D,KAAK2pD,OAAOvF,iBAAiB,eAAgBpkD,KAAKg3D,gBAAgB,gBACtE,CACA,8BAAAkC,GAaIl5D,KAAK2pD,OAAOvF,iBAAiB,kBAAmBpkD,KAAKg3D,gBAAgB,mBACzE,CACA,iBAAM+B,CAAYhS,SACF/mD,KAAKk6D,eAAenT,KAE5B/mD,KAAK22D,gCAAkC32D,KAAKia,QAAQs+C,iBACpDv4D,KAAK42D,qBAAqBp2D,KAAKumD,SAG7B/mD,KAAKo5D,SAASrS,GACxB,CACAiQ,gBAAkB,CACd,iBAAmB12D,IACV,WACD,MAAQoQ,GAAIq2C,GAAWzmD,EAAIqnD,aACrB3nD,KAAKm6D,uBAAuBpT,GAClC,UACU/mD,KAAK+4D,YAAYhS,EAC3B,CACA,MAAOv/B,GACH,GAAIA,MAAM,sBAAsBu/B,EAAO1gD,gBAAgBmhB,IAC3D,CACH,EATI,EASD,EAER,eAAiBlnB,IACR,WACD,GAAIi0C,KAAK,qBAAqBj0C,EAAIqnD,OAAOthD,cACzC,MAAM0gD,EAASzmD,EAAIqnD,OACnB3nD,KAAKw2D,iBAAiBxvD,MAAM+/C,UACD/mD,KAAK+3D,mBAAmBhR,IAAS/7B,SAASsvB,GAAK0d,WAEzCh4D,KAAK2pD,OAC7BjD,iBACA75C,QAAQ0qD,GAASA,EAAKO,KAAK9sC,SAASsvB,GAAK0d,aAErBv2D,OAASzB,KAAKia,QAAQq+C,+BACrCt4D,KAAKk3D,eAAenQ,GAG1B/mD,KAAKssD,cAAc,IAAIE,YAAYjS,GAAwB6f,uBAAwB,CAC/EzS,OAAQZ,KAKhB/mD,KAAKssD,cAAc,IAAIE,YAAYjS,GAAwB8f,2BAA4B,CACnF1S,OAAQZ,KAGhB/mD,KAAKs6D,wBACR,EAzBI,EAyBD,EAER,kBAAoBh6D,IACX,WACDN,KAAKw2D,iBAAiBlwC,KAAKhmB,EAAIqnD,QAC/B3nD,KAAKu6D,2BACR,EAHI,EAGD,EAER,kBAAmB,KACfv6D,KAAKw6D,6BAA6B,GAW1C,oBAAMN,CAAenT,GAEjB,GADoB/mD,KAAK2pD,OAAOjD,eAAeK,GAAQtlD,OAAS,EAG5D,OADA,GAAIyL,KAAK,6BAA6B65C,EAAO1gD,6BACtC,EAGX,UAD0BrG,KAAKy6D,sBAAsB1T,GACnC,CACd,MAAM7L,QAAkBl7C,KAAK06D,iBAAiB3T,EAAQ/mD,KAAK2pD,OAAOmM,WAGlE,OAFA,GAAI5oD,KAAK,mBAAmB65C,EAAO1gD,6BAA6B60C,yDAAiEl7C,KAAKu7C,6CAE/H,CACX,CAEA,aAD0Cv7C,KAAK26D,qCAAqC5T,IAK9D/mD,KAAKy2D,oBAAoBx3D,IAAI8nD,EAAO1gD,cAEtD,GAAI6G,KAAK,QAAQ65C,EAAO1gD,gHACjB,IANP,GAAI6G,KAAK,QAAQ65C,EAAO1gD,uEACjB,EAQf,CAMA,0CAAMs0D,CAAqC5T,GAGvC,cAFuB/mD,KAAK+3D,mBAAmBhR,IAClB6T,MAAMC,GAAYA,IAAYvgB,GAAK0d,aAI5Bh4D,KAAK2pD,OACpCjD,iBACA75C,QAAQ0qD,GACFA,EAAKO,KAAKx+B,MAAMv4B,GAASA,IAASu5C,GAAK0d,cAC/Cv2D,OACkCzB,KAAKia,QAAQq+C,wBACtD,CACA,4BAAM6B,CAAuBpT,GACzB,MAAM+T,SAAqB96D,KAAK+3D,mBAAmBhR,IAAS/7B,SAASsvB,GAAK0d,WAC1Eh4D,KAAKssD,cAAc,IAAIE,YAAYsO,EAC7BvgB,GAAwBwgB,yBACxBxgB,GAAwBygB,6BAA8B,CACxDrT,OAAQZ,IAEhB,CAIA,wBAAMgR,CAAmBhR,GACrB,IACI,MAAMW,QAAa1nD,KAAK2pD,OAAOmM,UAAU12D,IAAI2nD,GAC7C,OAAOplD,MAAM4c,KAAKmpC,EAAKoQ,KAAK5yD,OAChC,CACA,MAAOsiB,GAEH,OADA,GAAIA,MAAM,sBAAsBu/B,aAAkBv/B,KAC3C,EACX,CACJ,CACA,2BAAMizC,CAAsB1T,GACxB,MAAM7L,QAAkBl7C,KAAK06D,iBAAiB3T,EAAQ/mD,KAAK2pD,OAAOmM,WAElE,OAAK5a,GAEgBD,GAAwBC,GACN0f,MAAMtnB,GAAUtzC,KAAKu7C,aAAavwB,SAASsoB,IAEtF,CACA,sBAAMonB,CAAiB3T,EAAQ+O,GAC3B,MACMmF,SADanF,EAAU12D,IAAI2nD,IACLmB,SAAS9oD,IAAI,aACzC,GAAK67D,EAEL,OAAOze,GAAiBye,EAC5B,CACA,0BAAA9B,GACI,IACIvhC,WAAWwsB,iBAAiB,SAAUpkD,KAAKg3D,gBAAgB,oBAC3Dp/B,WAAWwsB,iBAAiB,UAAWpkD,KAAKg3D,gBAAgB,mBAChE,CACA,MAAOvwC,GACH,GAAIe,MAAM,qCAAqCf,IACnD,CACJ,CACA,yBAAAwwC,GACI,IACIr/B,WAAW0sB,oBAAoB,SAAUtkD,KAAKg3D,gBAAgB,oBAC9Dp/B,WAAW0sB,oBAAoB,UAAWtkD,KAAKg3D,gBAAgB,mBACnE,CACA,MAAOvwC,GACH,GAAIe,MAAM,oCAAoCf,IAClD,CACJ,CACA,sBAAA6zC,GACSt6D,KAAK62D,wBACN72D,KAAK62D,uBAAwB,EAC7B72D,KAAKw6D,8BAEb,CACA,yBAAAD,GACQv6D,KAAK62D,uBACmC,IAAxC72D,KAAK2pD,OAAOjD,iBAAiBjlD,SAC7BzB,KAAK62D,uBAAwB,EAC7B72D,KAAKw6D,8BAEb,CACA,2BAAAA,GACIx6D,KAAKssD,cAAc,IAAIE,YAAYhS,GAAuB0gB,kBAAmB,CACzEvT,OAAQ3nD,KAAK82D,gBAErB,EC1hBJ,MAAM,GAAM,IAAI5Z,GAAO,YACVie,GAAgB,2BAC7B,MAAMC,WAAiBjT,GACnB5M,aACA8f,iBACAC,oBAAsB,IAAIztB,IAC1B,WAAAv+B,CAAYisC,EAAcoO,GACtBvZ,MAAM+qB,GAAexR,EAAOvB,WAAY7M,GACxCv7C,KAAKu7C,aAAeA,EACpBv7C,KAAKq7D,iBAAmB1R,EACnBA,EAAO4R,UAAU3R,OAAOuR,IAAgB1Q,IACpCzqD,KAAK6pD,UAAUY,EAAW,GAEvC,CAIA,WAAMjV,CAAMuR,GACR,MAAM/sB,EAAU,GAAmC9kB,OAAOumC,GAAwBz7C,KAAKu7C,eAEvF,UADmBv7C,KAAKq7D,iBAAiBvF,UAAU12D,IAAI2nD,GAEnD,MAAO,CACH7L,UAAW,KACX1zB,MAAO7C,GAAc62C,mBAG7B,IAAIvV,EACJ,IACIA,QAAejmD,KAAK8mD,UAAUC,EAClC,CACA,MAAOv/B,GAEH,OADA,GAAIA,MAAM,uBAAwBA,GAC3B,CACH0zB,UAAW,KACX1zB,MAAO7C,GAAcylC,oBAE7B,CACA,MAAMqR,QAAwBjW,GAAK,CAACxrB,GAAU,GAAWisB,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,MAClG,MAAEqhB,EAAK,UAAE0zB,GAAcl7C,KAAK07D,uBAAuBD,GACzD,OAAIj0C,EACO,CACH0zB,UAAW,KACX1zB,gBAGFxnB,KAAK27D,kBAAkB5U,EAAQ7L,GAC9B,CACHA,YACA1zB,MAAO,MAEf,CACA,+BAAMo0C,CAA0B7U,GAC5B,MAAM7L,EAAYl7C,KAAKs7D,oBAAoBl8D,IAAI2nD,EAAO1gD,YACtD,OAAI60C,EACO,CACHA,YACA1zB,MAAO,YAGFxnB,KAAKw1C,MAAMuR,EAC5B,CAIA,eAAM8C,CAAUY,GACZ,IACI,MAAM,OAAExE,EAAM,WAAEqB,GAAemD,EACzBoR,EAAmB,GAAoC3mD,OAAOumC,GAAwBz7C,KAAKu7C,eAC3FkgB,QAAwBjW,GAAK,CAACqW,GAAmB,GAAW5V,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,MAC3G,MAAEqhB,EAAK,UAAE0zB,GAAcl7C,KAAK07D,uBAAuBD,GACzD,GAAIj0C,EACA,aAEExnB,KAAK27D,kBAAkBrU,EAAWoD,WAAYxP,EACxD,CACA,MAAO1zB,GACH,GAAIA,MAAM,kCAAmCA,EACjD,CACJ,CACA,sBAAAk0C,CAAuBD,GACnB,MAAM3sD,EAAQ,IAAI+vC,GAClB4c,EAAgBtuD,SAASkQ,IACrBvO,EAAMkwC,OAAO3hC,EAAM,IAEvB,MAAMgT,EAAW,GAAoCrU,OAAOlN,GAC5D,OAAKuhB,EAOE,CACH6qB,UAAW7qB,EACX7I,MAAO,OARP,GAAIA,MAAM,oCACH,CACH0zB,UAAW,KACX1zB,MAAO7C,GAAc2mC,eAOjC,CACA,uBAAMqQ,CAAkB5U,EAAQ7L,SAEtBl7C,KAAKq7D,iBAAiBvF,UAAUzyC,MAAM0jC,EAAQ,CAChDmB,SAAU,CACNhN,UAAW4B,GAAiB5B,MAGpCl7C,KAAKs7D,oBAAoBh8D,IAAIynD,EAAO1gD,WAAY60C,EACpD,EAEG,SAAS4gB,GAAavgB,GACzB,OAAQ6M,GAAe,IAAIgT,GAAS7f,EAAc6M,EACtD,CC9GO,SAAS3T,GAAYV,EAAavnC,GACrC,MAAMuvD,EAAmB,GAAYhoB,GAC/BioB,EAAoB,GAAYxvD,EAAQ2lC,cACxC8pB,EAUV,SAAoClpB,GAChC,IAAKA,EACD,OAEJ,IAAImpB,EAOJ,OALIA,EADqB,iBAAdnpB,EACWA,EAG8B,SAA9B9M,OAAO8M,EAAUkL,WvDfpC,SAAuBj/C,GAC1B,MAAM0T,EAAS,IAAIb,YAAY,GACzBomC,EAAO,IAAInB,SAASpkC,GAO1B,MANqB,iBAAV1T,EACPi5C,EAAK8I,WAAW,EAAG/hD,GAAO,GAG1Bi5C,EAAK0I,YAAY,EAAG3hD,GAAO,GAExB,IAAIiR,WAAWyC,EAC1B,CuDOWypD,CAAcD,EACzB,CAtB2BE,CAA2B5vD,EAAQumC,WACpDjkC,EAAQ,GAAO,CACjBitD,EACAvvD,EAAQsmC,QACRkpB,EACAxvD,EAAQwmC,KACRipB,GACFpvD,OAAOklC,KACT,OAAO,GAAOjjC,EAClB,CCfO,MAAMutD,GAKTC,QAAU,GACVC,WAAY,EACZxoB,YACAxb,OACAoxB,OACA98C,OACA2vD,YACAhU,kBACAiU,oBACAC,oBACAC,mBAAqB,IAAI9uB,IACzB+uB,yBAA2B,IAAIzhB,IAC/B0hB,iBAAmB,IAAI1hB,IACvB2hB,cAAgB,IAAI3hB,IACpB,WAAA7rC,CAAY2K,GACRja,KAAKu4B,OAASte,EAAQse,OACtBv4B,KAAKwoD,kBAAoBvuC,EAAQuuC,kBACjCxoD,KAAK6M,OAASoN,EAAQpN,OACtB7M,KAAKw8D,YAAcviD,EAAQuiD,YAC3Bx8D,KAAK2pD,OAAS1vC,EAAQ0vC,OACtB3pD,KAAKy8D,oBAAsBxiD,EAAQwiD,oBACnCz8D,KAAK+zC,YAAc95B,EAAQ85B,YAC3B/zC,KAAK+8D,mBAAqB/8D,KAAK+8D,mBAAmB3gC,KAAKp8B,MACvDA,KAAKg9D,gBAAkBh9D,KAAKg9D,gBAAgB5gC,KAAKp8B,MACjDA,KAAKi9D,mBAAqBj9D,KAAKi9D,mBAAmB7gC,KAAKp8B,KAC3D,CAIA,wBAAIk9D,GACA,MAAO,gCAAgCl9D,KAAK2pD,OAAO5C,OAAO1gD,iBAC9D,CAMA,KAAAW,GACQhH,KAAKu8D,YAGTv8D,KAAKu8D,WAAY,EACjBv8D,KAAKm9D,iBACLn9D,KAAKo9D,0BACLp9D,KAAKi5D,8BACT,CAIA,IAAA3yC,GACStmB,KAAKu8D,YAGVv8D,KAAKu8D,WAAY,EACjBv8D,KAAKq9D,gBACLr9D,KAAKs9D,yBACLt9D,KAAKu9D,6BACT,CAKA,cAAM3E,GAIF,OAHK54D,KAAKu8D,YACNv8D,KAAKs8D,QAAUt8D,KAAKw8D,YAAY5D,YAE7B54D,KAAKs8D,OAChB,CASA,qBAAAkB,CAAsBzW,EAAQv6C,GAC1B,MAAMY,EAAOpN,KAAKy9D,iBAAiBjxD,GAGnC,OAFAxM,KAAK88D,cAAc9/C,IAAI+pC,GACvB/mD,KAAK48D,yBAAyB5/C,IAAI,GAAG+pC,KAAU35C,OAC3CpN,KAAK68D,iBAAiB59D,IAAImO,KAG9BpN,KAAK68D,iBAAiB7/C,IAAI5P,IACnB,EACX,CACA,gBAAAqwD,CAAiBjxD,GACb,OD/DD,SAAwBunC,EAAavnC,GACxC,MAAMY,EAAOqnC,GAAYV,EAAavnC,GAEtC,OADgB,GAAWY,EAE/B,CC2DeswD,CAAe19D,KAAK+zC,YAAavnC,EAC5C,CACA,uBAAA4wD,GACIp9D,KAAKwoD,kBAAkBpE,iBAAiB5J,GAAuB0gB,kBAAmBl7D,KAAK+8D,mBAC3F,CACA,sBAAAO,GACIt9D,KAAKwoD,kBAAkBlE,oBAAoB9J,GAAuB0gB,kBAAmBl7D,KAAK+8D,mBAC9F,CACA,wBAAMA,EAAqBpV,OAAQmP,IAC1BA,SAICv6B,QAAQ6oB,IAAIplD,KAAKs8D,QAAQh4D,KAAKoM,GAAO1Q,KAAKwqD,KAAK95C,GAAI,MACzD1Q,KAAKm9D,kBAJDn9D,KAAKq9D,eAKb,CACA,cAAAF,GACQn9D,KAAK08D,sBAGT18D,KAAK08D,oBAAsB9G,aAAY,KAC9B51D,KAAKs8D,QAAQh4D,KAAKoM,GAAO1Q,KAAKwqD,KAAK95C,IAAI,GAC7C1Q,KAAKu4B,OAAOolC,qBACnB,CACA,aAAAN,GACSr9D,KAAK08D,sBAGVzG,cAAcj2D,KAAK08D,qBACnB18D,KAAK08D,yBAAsBx9D,EAC/B,CACA,2BAAA+5D,GACIj5D,KAAK2pD,OAAOvF,iBAAiB,eAAgBpkD,KAAKg9D,iBAClDh9D,KAAK2pD,OAAOvF,iBAAiB,kBAAmBpkD,KAAKi9D,mBACzD,CACA,0BAAAM,GACIv9D,KAAK2pD,OAAOrF,oBAAoB,eAAgBtkD,KAAKg9D,iBACrDh9D,KAAK2pD,OAAOrF,oBAAoB,kBAAmBtkD,KAAKi9D,mBAC5D,CAEA,qBAAMD,CAAgBY,GAEG59D,KAAKs8D,QAAQ76D,OAAS,IAI3CzB,KAAKs8D,QAAUt8D,KAAKw8D,YAAY5D,iBAC1Br8B,QAAQ6oB,IAAIplD,KAAKs8D,QAAQh4D,KAAKoM,GAAO1Q,KAAKqzC,UAAU3iC,MAC9D,CAEA,wBAAMusD,CAAmB98D,IACGH,KAAKs8D,QAAQhjC,MAAM5oB,GAAOA,EAAG49B,OAAOnuC,EAAMwnD,YAIlE3nD,KAAKs8D,QAAUt8D,KAAKw8D,YAAY5D,iBAG1Br8B,QAAQ6oB,IAAIplD,KAAKs8D,QAAQh4D,KAAKoM,GAAO1Q,KAAKqzC,UAAU3iC,MAC9D,CACA,eAAM2iC,CAAUwqB,GACZ,IAAI9W,EAAS8W,EACb,IAAK,IAAIt8D,EAAI,EAAGA,EA3JO,EA2JqBA,IAAK,CAC7C,IAAKwlD,EACD,OAGJ,UADuB/mD,KAAK6M,OAAOwmC,UAAUrzC,KAAK+zC,YAAagT,EAAQplD,MAAM4c,KAAKve,KAAKy8D,oBAAoBv3D,UAC9F6kD,QACT,OAEJhD,EAAS/mD,KAAKw8D,YAAYsB,aAAa/W,EAC3C,CACJ,CACA,UAAMyD,CAAKzD,EAAQgX,GAAmB,GAClC,MAAM/W,EAAYD,EAAO1gD,WACnBgqB,QAAiBrwB,KAAK6M,OAAO29C,KAAKzD,GACxC,GAAI12B,EAAS25B,SAAW+T,EAAxB,CACI,MAAMC,EAAUh+D,KAAKw8D,YAAYsB,aAAa/W,SACxC/mD,KAAKqzC,UAAU2qB,EAEzB,KAJA,CAKA,GAAI3tC,EAAS25B,QAAS,CAClB,MAAMnhD,EAAO7I,KAAK28D,mBAAmBv9D,IAAI4nD,IAAc,EACvDhnD,KAAK28D,mBAAmBr9D,IAAI0nD,EAAWn+C,EAAO,EAClD,CAKA,GAJIwnB,EAAS05B,SACT/pD,KAAK28D,mBAAmBr9D,IAAI0nD,EAAW,IAEtBhnD,KAAK28D,mBAAmBv9D,IAAI4nD,IAAc,IAC3ChnD,KAAKu4B,OAAO0lC,uBAAwB,CACpD,MAAMD,EAAUh+D,KAAKw8D,YAAYsB,aAAa/W,SACxC/mD,KAAKqzC,UAAU2qB,EACzB,CAZA,CAaJ,ECzLJ,MAAM,GAAM,IAAI9gB,GAAO,2BAChB,MAAMghB,GACTnqB,YACAgU,SACAxvB,OACA4lC,QACAC,sBAAwB,IAAIvwB,IAC5B,WAAAv+B,CAAYykC,EAAagU,EAAUS,EAAmBgU,EAAa7S,EAAQpxB,EAAQ8lC,GAC/Er+D,KAAK+zC,YAAcA,EACnB/zC,KAAK+nD,SAAWA,EAChB/nD,KAAKu4B,OAASA,EACdv4B,KAAK+zC,YAAcA,EACnB/zC,KAAKm+D,QAAU,IAAI9B,GAAoB,CACnCtoB,cACAxb,SACAoxB,SACAnB,oBACA37C,OAAQk7C,EACRyU,cACA6B,YACA5B,oBAAqBz8D,KAAKo+D,uBAElC,CACA,eAAM/qB,CAAUjK,EAAUxZ,GACtB,MAAM0uC,EAAgB38D,MAAM2Q,QAAQ82B,GAAYA,EAAW,CAACA,GAE5D,IAAK,MAAMxY,KAAW0tC,EAClB,GAAI1tC,EAAQmjB,cAAgB/zC,KAAK+zC,YAC7B,MAAO,CACHwqB,SAAU,CACN,CACI/2C,MAAO7C,GAAc65C,yBAG7BC,UAAW,IAInBz+D,KAAKu4B,OAAOmmC,4BACZJ,EAAc99D,KAAK69C,GAAcr+C,KAAKm+D,QAAQjB,qBAAsBl9D,KAAK+zC,cAE7E,MAAM4qB,EAAsB3sB,GAAoBssB,GAC1CtqB,EAAgBryC,MAAM4c,KAAKogD,EAAoBz5D,QAE/C05D,SADc5+D,KAAKm+D,QAAQvF,YACVt0D,KAAI6oC,MAAOua,GACvB1nD,KAAK+nD,SAAS1U,UAAUrzC,KAAK+zC,YAAa2T,EAAM1T,KAErD6qB,QAAgBtiC,QAAQuiC,WAAWF,GACnCG,EAAc/+D,KAAKg/D,aAAaH,EAAS,aAoB/C,OAhBAF,EAAoBxxD,SAAQ,CAACi8B,EAAU+I,KAGnC,MAAM8sB,EAAuB,CACzB71B,WACAxZ,YAGAuiB,IAAiBnyC,KAAKm+D,QAAQjB,sBAKlCl9D,KAAKo+D,sBAAsB9+D,IAAI6yC,EAAc8sB,EAAqB,IAEtEj/D,KAAKm+D,QAAQn3D,QACN+3D,CACX,CACA,iBAAM5U,CAAYnW,GACd,MACM4qB,SADc5+D,KAAKm+D,QAAQvF,YACVt0D,KAAI6oC,MAAOua,IAC9B,MAAMr3B,QAAiBrwB,KAAK+nD,SAASoC,YAAYnqD,KAAK+zC,YAAa2T,EAAM1T,GAIzE,OAHAA,EAAc7mC,SAASglC,IACnBnyC,KAAKo+D,sBAAsBlX,OAAO/U,EAAa,IAE5C9hB,CAAQ,IAEbwuC,QAAgBtiC,QAAQuiC,WAAWF,GACnCG,EAAc/+D,KAAKg/D,aAAaH,EAAS,eAI/C,OAHwC,IAApC7+D,KAAKo+D,sBAAsB3/D,MAC3BuB,KAAKm+D,QAAQ73C,OAEVy4C,CACX,CACA,UAAMvU,GACF,MACMoU,SADc5+D,KAAKm+D,QAAQvF,YACVt0D,KAAKojD,GAAS1nD,KAAK+nD,SAASyC,KAAK9C,KAClDmX,QAAgBtiC,QAAQuiC,WAAWF,GACzC,OAAO5+D,KAAKg/D,aAAaH,EAAS,OACtC,CACA,oBAAMvU,GACF,MACMsU,SADc5+D,KAAKm+D,QAAQvF,YACVt0D,KAAI6oC,MAAOua,GAAS1nD,KAAK+nD,SAASuC,eAAetqD,KAAK+zC,YAAa2T,KACpFmX,QAAgBtiC,QAAQuiC,WAAWF,GACzC5+D,KAAKo+D,sBAAsB7+D,QAC3B,MAAMw/D,EAAc/+D,KAAKg/D,aAAaH,EAAS,kBAE/C,OADA7+D,KAAKm+D,QAAQ73C,OACNy4C,CACX,CACA,4BAAMG,CAAuB1yD,EAASw6C,GAElC,GADiBhnD,KAAKm+D,QAAQX,sBAAsBxW,EAAWx6C,GAG3D,YADA,GAAI+nC,KAAK,sCAGb,MAAM,aAAEpC,GAAiB3lC,EACnByyD,EAAuBj/D,KAAKo+D,sBAAsBh/D,IAAI+yC,GACvD8sB,GAIL,GAAI1qB,KAAK,yCAA0CpC,EAAc,oBAAqBnyC,KAAK+zC,mBAuBnG5G,eAA2B8xB,EAAsBlrB,EAAavnC,GAC1D,MAAM,SAAE48B,EAAQ,SAAExZ,GAAaqvC,GACzB,aAAE9sB,GAAiB3lC,EACzB,GAAK2lC,EAIL,IACI,MAAMgtB,EAAiB/1B,EAAS9kC,KAAK86D,GAAQA,EACxChhB,aAAarK,EAAavnC,GAC1B+2B,MAAM87B,GAAYA,GAAW9iC,QAAQC,OAAO,uBAC3C8iC,QAAuB/iC,QAAQgjC,IAAIJ,SACnCvvC,EAAS0vC,EACnB,CACA,MAAOr7C,GACH,GAAIuD,MAAM,yBAA0BvD,EACxC,MAZI,GAAI/W,KAAK,yCAajB,CAvCcsyD,CAAYP,EAAsBj/D,KAAK+zC,YAAavnC,IAJtD,GAAIgb,MAAM,0CAA2C2qB,EAK7D,CACA,YAAA6sB,CAAaH,EAAS15D,GAClB,MAAM2P,EAAS,CAAEypD,SAAU,GAAIE,UAAW,IAC1C,IAAK,MAAMgB,KAAiBZ,EACxB,GAA6B,aAAzBY,EAAcrvC,OACd,GAAI5I,MAAM,qBAAqBriB,2BAA+Bs6D,EAAcC,QAC5E5qD,EAAOypD,SAAS/9D,KAAK,CAAEgnB,MAAO7C,GAAcslC,mBAE3C,CACD,MAAM0V,EAAaF,EAAczgE,MAC7B2gE,EAAW3V,QACXl1C,EAAOypD,SAAS/9D,KAAKm/D,EAAW3V,SAGhCl1C,EAAO2pD,UAAUj+D,KAAKm/D,EAAW5V,QAEzC,CAEJ,OAAOj1C,CACX,EC1IG,MCKD,GAAM,IAAIooC,GAAO,cAChB,MAAM0iB,GACT7X,SACAxvB,OACAiwB,kBACAmB,OACA6S,YACA6B,UACA5B,oBAAsB,IAAI5uB,IAC1B,WAAAv+B,CAAY+sB,GCbW,IAAC9D,EDcpBv4B,KAAKu4B,QCdeA,EDcM8D,EAAOpiB,QCb9B,CACH0jD,oBAAqBplC,GAAQolC,qBFHH,IEI1BM,uBAAwB1lC,GAAQ0lC,wBFHP,EEIzBS,2BAA4BnmC,GAAQmmC,6BFHG,ICcvC1+D,KAAKq+D,UAAYhiC,EAAOgiC,UACxBr+D,KAAKw8D,YAAcngC,EAAOmgC,YAC1Bx8D,KAAK2pD,OAASttB,EAAOstB,OACrB3pD,KAAKwoD,kBAAoBnsB,EAAOmsB,kBAChCxoD,KAAK+nD,SAAW,IAAI0B,IAAWtc,MAAO4G,EAAaM,EAAa2S,KAC5D,MAAM6Y,EAAe7/D,KAAK8/D,sBAAsB/rB,GAC3C8rB,QAICA,EAAaX,uBAAuB7qB,EAAa2S,GAHnD,GAAIx/B,MAAM,gDAAgDusB,IAGG,GAClE1X,EAAOmsB,kBAAkBjN,aAAclf,EAAOstB,QACjD3pD,KAAKy8D,oBAAsB,IAAI5uB,GACnC,CAsCA,eAAMwF,CAAUjK,EAAUxZ,GACtB,MAAMmwC,EAAqB//D,KAAKggE,sBAAsB52B,GACtD,GAAkC,IAA9B22B,EAAmBt+D,OACnB,MAAO,CACHo+D,aAAc,KACdr4C,MAAO7C,GAAcs7C,uBACrBpB,QAAS,MAGjB,MAAM9qB,EAAcgsB,EAAmB,IACjC,aAAEF,EAAY,MAAEr4C,SAAgBxnB,KAAKkgE,mBAAmBnsB,GAC9D,GAAIvsB,EACA,MAAO,CACHq4C,aAAc,KACdr4C,MAAOA,EACPq3C,QAAS,MAGjB,MAAM,SAAEN,EAAQ,UAAEE,SAAoBoB,EAAaxsB,UAAUjK,EAAUxZ,GACvE,MAAO,CACHiwC,eACAr4C,MAAO,KACPq3C,QAAS,CACLN,SAAUA,EACVE,UAAWA,GAGvB,CAOA,wBAAMyB,CAAmB5jB,GACrB,MAAMvI,EAA6C,iBAAxBuI,EACrBA,EACArB,GAAwBqB,KAAwB,GACtDV,GAA8B7H,EAAa/zC,KAAK+nD,SAASxM,cACzD,MAAM+gB,EAAUt8D,KAAKw8D,YAAY5D,WACjC,OAAuB,IAAnB0D,EAAQ76D,OACD,CACH+lB,MAAO7C,GAAc62C,kBACrBqE,aAAc,OAGtB,GAAItrB,KAAK,qCAAqC+nB,EAAQ76D,iBAAkB66D,EAAQh4D,KAAKoM,GAAOA,EAAGrK,cAGxF,CACHmhB,MAAO,KACPq4C,aAJiB7/D,KAAK8/D,sBAAsB/rB,IAC5C/zC,KAAKmgE,sBAAsBpsB,EAAa,IAAImqB,GAAanqB,EAAa/zC,KAAK+nD,SAAU/nD,KAAKwoD,kBAAmBxoD,KAAKw8D,YAAax8D,KAAK2pD,OAAQ3pD,KAAKu4B,OAAQv4B,KAAKq+D,aAKtK,CAgBA,8BAAM+B,CAAyBh3B,EAAUxZ,GACrC,MAAMmwC,EAAqB//D,KAAKggE,sBAAsB52B,GACtD,GAAkC,IAA9B22B,EAAmBt+D,OACnB,MAAMjD,MAAM,mEAEhB,GAAIuhE,EAAmBt+D,OAAS,EAC5B,MAAMjD,MAAM,iHAEhB,MAAM,aAAEqhE,EAAY,MAAEr4C,SAAgBxnB,KAAKkgE,mBAAmBH,EAAmB,IACjF,GAAIv4C,EACA,MAAMhpB,MAAM,kCAAkCgpB,WAE5Cq4C,EAAaxsB,UAAUjK,EAAUxZ,GACvC,MAAMokB,EAAgBryC,MAAM4c,KAAKyzB,GAAoBrwC,MAAM2Q,QAAQ82B,GAAYA,EAAW,CAACA,IAAWlkC,QACtG,OAAOioC,gBACG0yB,EAAa1V,YAAYnW,EAAc,CAErD,CACA,sBAAAqsB,CAAuBj3B,GACnB,OvElJD+D,eAA+BmzB,EAAU1vC,EAAS2vC,GACrD,MACM9sB,EAAW,GACjB,IAAI0W,EACJA,QAAoBmW,EAASF,yBAAyBxvC,GAAUpkB,IAC5DinC,EAASjzC,KAAKgM,EAAQ,IAE1B,MAAMg0D,EAAgBj2D,OAAO4P,UAAUomD,GAAiBE,WAElDC,EAAYl2D,KAAKm2D,MAiBvB,MAAO,CACH5hB,SAjBJ5R,kBACI,OAAa,CACT,GAAIqzB,GAAiBh2D,KAAKm2D,MAAQD,GAJM,EAKpC,aAEEtuB,GAxBC,IAyBP,MAAM5lC,EAAUinC,EAASnrC,QACzB,IAAK6hD,GAAmC,IAApB1W,EAAShyC,OACzB,OAAO+K,GAENA,GAAW29C,UAGV39C,EACV,CACJ,CAEcuyC,GACV,UAAMz4B,GACE6jC,UACMA,IACNA,OAAcjrD,EAEtB,EAER,CuE+Ge0hE,CAAgB5gE,KAAMopC,EACjC,CACA,qBAAA02B,CAAsB/rB,GAClB,OAAO/zC,KAAKy8D,oBAAoBr9D,IAAI20C,EACxC,CACA,qBAAAosB,CAAsBpsB,EAAa8rB,GAE/B,OADA7/D,KAAKy8D,oBAAoBn9D,IAAIy0C,EAAa8rB,GACnCA,CACX,CACA,qBAAAG,CAAsB52B,GAClB,IAAKznC,MAAM2Q,QAAQ82B,GACf,MAAO,CAACA,EAAS2K,aAErB,GAAwB,IAApB3K,EAAS3nC,OACT,MAAO,GAEX,MAAM85C,EAAe,IAAIJ,IAAI/R,EAAS9kC,KAAKmY,GAAMA,EAAEs3B,eACnD,MAAO,IAAIwH,EACf,EEzKJ,MAAM,GAAM,IAAI2B,GAAO,oBA4BhB,MAAM2jB,WAAwBzU,GACjCzC,OACA3qD,MAAQ47C,GAAakmB,UACrB,WAAAxxD,CAAY+sB,GACR+T,QACApwC,KAAK2pD,OAASttB,EAAOstB,OACrB3pD,KAAK+gE,aAAe/gE,KAAK+gE,aAAa3kC,KAAKp8B,KAC/C,CAKA,KAAAgH,GACI,GAAIutC,KAAK,qCACTv0C,KAAK2pD,OAAOvF,iBAAiB,eAAgBpkD,KAAK+gE,cAClD/gE,KAAK2pD,OAAOvF,iBAAiB,kBAAmBpkD,KAAK+gE,aACzD,CAKA,IAAAz6C,GACI,GAAIiuB,KAAK,sCACTv0C,KAAK2pD,OAAOrF,oBAAoB,eAAgBtkD,KAAK+gE,cACrD/gE,KAAK2pD,OAAOrF,oBAAoB,kBAAmBtkD,KAAK+gE,aAC5D,CAKA,QAAA16D,GACI,OAAOrG,KAAKhB,KAChB,CAKA,OAAAgiE,GACI,OAAOhhE,KAAKhB,KAChB,CACA,kBAAM+hE,CAAa5gE,GACf,GAAIo0C,KAAK,yCAAyCp0C,EAAMgF,QACxD,MAAMihD,EAAcpmD,KAAK2pD,OAAOjD,iBAC1Bua,QAAc1kC,QAAQ6oB,IAAIgB,EAAY9hD,KAAI6oC,MAAOhmC,IACnD,IACI,aAAanH,KAAK2pD,OAAOmM,UAAU12D,IAAI+H,EAAEujD,WAC7C,CACA,MAAOzmC,GACH,OAAO,IACX,MAEEi9C,EAAcD,EAAMp0D,QAAQ6xB,GAAMA,GAAGkpB,UAAU58B,SAASw+B,MAAyB/nD,OACjF0/D,EAAiBF,EAAMp0D,QAAQ6xB,GAAMA,GAAGkpB,UAAU58B,SAAS4/B,MAAiBnpD,OACvD,IAAvB2kD,EAAY3kD,QACZ,GAAI8yC,KAAK,oCAAoCqG,GAAakmB,aAC1D9gE,KAAKhB,MAAQ47C,GAAakmB,WAErBI,GAAe,GAAKC,GAAkB,GAC3C,GAAI5sB,KAAK,oCAAoCqG,GAAawmB,uBAC1DphE,KAAKhB,MAAQ47C,GAAawmB,qBAEL,IAAhBF,GAAwC,IAAnBC,IAC1B,GAAI5sB,KAAK,oCAAoCqG,GAAaymB,oBAC1DrhE,KAAKhB,MAAQ47C,GAAaymB,kBAE9BrhE,KAAKssD,cAAc,IAAIE,YAAY7R,GAAyB2mB,aAAc,CACtE3Z,OAAQ3nD,KAAKhB,SAGjB,GAAIwoB,MAAM,qFAAqF05C,gBAA0BC,IAC7H,ECrGG,MAUMv6C,GAAWA,GACb,IAAI2V,SAAQ,CAAC5D,EAAG6D,IAAW3V,YAAW,IAAM2V,EAAO,IAAIh+B,MAAM,kBAAkBooB,KCRpF,GAAM,IAAIs2B,GAAO,qBAChB,MAAMqkB,GACTC,WAAa,KACbC,gBACAC,WAAa,EACb39B,MAAQ,GACRy4B,YACA,WAAAltD,CAAYipB,GACRv4B,KAAKw8D,YAAcjkC,EAAOikC,YAC1Bx8D,KAAKyhE,gBAAkBlpC,EAAOkpC,eAClC,CACA,KAAAz6D,GACIhH,KAAKwhE,WAAa5L,aAAY,KAC1B51D,KAAK2hE,cAAc,GACpB3hE,KAAKyhE,gBACZ,CACA,IAAAn7C,GACQtmB,KAAKwhE,aACLvL,cAAcj2D,KAAKwhE,YACnBxhE,KAAKwhE,WAAa,KAE1B,CACA,IAAAhhE,CAAKovB,EAAUgyC,GACX5hE,KAAK+jC,MAAMvjC,KAAK,CACZohE,cACAhyC,YAER,CACA,YAAA+xC,GACI,GAA0B,IAAtB3hE,KAAK+jC,MAAMtiC,OAIf,KAAOzB,KAAK+jC,MAAMtiC,QAAUzB,KAAK0hE,WAnCZ,GAmC+C,CAChE,MAAMG,EAAO7hE,KAAK+jC,MAAMz7B,QACpBu5D,GACA7hE,KAAK8hE,aAAaD,EAE1B,MARI,GAAIttB,KAAK,+BASjB,CACA,YAAAutB,CAAaD,GAMTh7C,YALoBsmB,SACTntC,KAAK+hE,aAAaF,IAIL,IAC5B,CACA,kBAAME,CAAaF,GACf,MAAM9a,EAAS/mD,KAAKw8D,YAAY5D,WAAW,GDpDhB,IAAC5O,ECqD5B,GAAKjD,EAIL,IACI/mD,KAAK0hE,YAAc,EACnB,MAAMrxC,QAAiBkM,QAAQ8nB,KAAK,CAChCz9B,GA1DQ,KA2DRi7C,EAAKjyC,SAASm3B,KAElB,GAAI12B,GAAU25B,QACV,MAAMxrD,MAAM6xB,EAAS25B,QAAQxiC,OAGjC,GADA,GAAI+sB,KAAK,uCACgB,IAArBstB,EAAKD,YAEL,YADA,GAAI10D,KAAK,+DAGblN,KAAK+jC,MAAMvjC,KAAK,IACTqhE,EACHD,YAAaC,EAAKD,YAAc,GAExC,CACA,MAAOI,GACH,MAAMx6C,EAAQw6C,EAKd,GAJA,GAAIx6C,MAAM,kDAAmDA,KD9ErCwiC,EC+EAxiC,EAAMhb,WD9ENmY,GAAculC,sBAC1CF,IAAYrlC,GAAc4lC,aAC1BP,IAAYrlC,GAAc4mC,sBAC1BvB,IAAYrlC,GAAc62C,oBC4ElBx7D,KAAKw8D,YAAYsB,aAAa/W,GAET,IAArB8a,EAAKD,YAEL,YADA,GAAI10D,KAAK,+DAGblN,KAAK+jC,MAAMvjC,KAAK,IACTqhE,EACHD,YAAaC,EAAKD,YAAc,GAExC,CACA,QACI5hE,KAAK0hE,YAAc,CACvB,MAvCI,GAAIx0D,KAAK,mCAwCjB,EC3FJ,MAAM,GAAM,IAAIgwC,GAAO,kBAEjB+kB,GAAuB,CACzBC,WAAW,EACXT,gBAAiB,IACjBG,YAJyB,EAKzBO,cAAe,GAEZ,MAAMC,GACT7pC,OACA8pC,aACA7F,YACAzU,SACA,WAAAz4C,CAAY+sB,GACRr8B,KAAKu4B,OAAS,IACP0pC,MACC5lC,EAAOpiB,SAAW,CAAC,GAE3Bja,KAAKw8D,YAAcngC,EAAOmgC,YAC1Bx8D,KAAK+nD,SAAW,IAAI8C,GAAcxuB,EAAOmsB,kBAAkBjN,aAAclf,EAAOstB,QAChF3pD,KAAKqiE,aAAe,IAAId,GAAa,CACjC/E,YAAangC,EAAOmgC,YACpBiF,gBAAiBzhE,KAAKu4B,OAAOkpC,iBAErC,CACA,KAAAz6D,GACIhH,KAAKqiE,aAAar7D,OACtB,CACA,IAAAsf,GACItmB,KAAKqiE,aAAa/7C,MACtB,CACA,UAAMmK,CAAKE,EAASnkB,EAASyN,EAAU,CAAC,GACpCA,EAAU,IACHja,KAAKu4B,UACLte,GAEP,MAAM,YAAE85B,GAAgBpjB,EAExB,GADA,GAAI4jB,KAAK,qDAAsDR,IAC1D/zC,KAAK+nD,SAASxM,aAAavwB,SAAS+oB,GACrC,MAAO,CACH0qB,UAAW,GACXF,SAAU,CACN,CACI/2C,MAAO7C,GAAc29C,wBAKrC,MAAMhG,EAAUt8D,KAAKw8D,YAChB5D,WACA13D,MAAM,EAAGlB,KAAKu4B,OAAO4pC,eAC1B,GAAuB,IAAnB7F,EAAQ76D,OACR,MAAO,CACHg9D,UAAW,GACXF,SAAU,CACN,CACI/2C,MAAO7C,GAAc62C,qBAKrC,MAAM+G,QAAoBhmC,QAAQ6oB,IAAIkX,EAAQh4D,KAAKyiD,GAAW/mD,KAAK+nD,SAASt3B,KAAKE,EAASnkB,EAASu6C,GAAQzjB,OAAOk/B,IAAO,CACrHzY,QAAS,KACTC,QAAS,CACLxiC,MAAO7C,GAAcslC,qBAGvB4U,EAAU,CACZJ,UAAW8D,EACN11D,QAAQxN,GAAMA,EAAE0qD,UAChBzlD,KAAKjF,GAAMA,EAAE0qD,UAClBwU,SAAUgE,EACL11D,QAAQxN,GAAMA,EAAE2qD,UAChB1lD,KAAKjF,GAAMA,EAAE2qD,WAEtB,GAAI/vC,EAAQioD,WAA0C,IAA7BrD,EAAQJ,UAAUh9D,OAAc,CACrD,MAAMghE,EAAgB1b,GAAW/mD,KAAK+nD,SAASt3B,KAAKE,EAASnkB,EAASu6C,GACtE/mD,KAAKqiE,aAAa7hE,KAAKiiE,EAAarmC,KAAKp8B,MAAOia,EAAQ2nD,aA5EvC,EA6ErB,CACA,OAAO/C,CACX,ECnFJ,MAAM,GAAM,IAAI3hB,GAAO,gBAEjBwlB,GAAsB,oBACrB,MAAMC,GACTR,cACAxY,OACA,WAAAr6C,CAAY+sB,GACRr8B,KAAK4iE,YAAc5iE,KAAK4iE,YAAYxmC,KAAKp8B,MACzCA,KAAK6iE,eAAiB7iE,KAAK6iE,eAAezmC,KAAKp8B,MAC/CA,KAAKmiE,cACD9lC,GAAQ9D,QAAQ4pC,eATK,EAUzBniE,KAAK2pD,OAASttB,EAAOstB,MACzB,CACA,KAAA3iD,GACIhH,KAAKo9D,yBACT,CACA,IAAA92C,GACItmB,KAAKs9D,wBACT,CACA,QAAA1E,GACI,OAAO54D,KAAK8iE,uBAAuBx+D,KAAK6C,GAAMA,EAAEujD,YACpD,CACA,YAAAoT,CAAa/W,GACT,MAAMgc,EAAoB/iE,KAAK8iE,uBACzBE,EAAchjE,KAAKmiE,cAAgBY,EAAkBthE,OAC3D,GAAoB,IAAhBuhE,EACA,OAEJ,MAKMC,EALcjjE,KAAKkjE,yBACpBr2D,QAAQ1F,IAAOA,EAAEujD,WAAWpc,OAAOyY,KACnC7lD,MAAM,EAAG8hE,GACT1+D,KAAK6C,GAAMnH,KAAKmjE,eAAeh8D,KAC/B7C,KAAK6C,GAAMA,EAAEujD,aACY,GAC9B,GAAKuY,EAKL,OADA,GAAI1uB,KAAK,8BAA8BwS,EAAO1gD,iBAAiB48D,EAAU58D,cAClE48D,EAJH,GAAI/1D,KAAK,qCAAqC65C,EAAO1gD,yBAK7D,CACA,uBAAA+2D,GACIp9D,KAAK2pD,OAAOvF,iBAAiB,eAAgBpkD,KAAK4iE,aAClD5iE,KAAK2pD,OAAOvF,iBAAiB,kBAAmBpkD,KAAK6iE,eACzD,CACA,sBAAAvF,GACIt9D,KAAK2pD,OAAOrF,oBAAoB,eAAgBtkD,KAAK4iE,aACrD5iE,KAAK2pD,OAAOrF,oBAAoB,kBAAmBtkD,KAAK6iE,eAC5D,CACA,WAAAD,CAAYziE,GACR,MAAM4mD,EAAS5mD,EAAMwnD,OACrB3nD,KAAKojE,iBAAiBrc,EAC1B,CACA,cAAA8b,CAAe1iE,GACX,MAAM4mD,EAAS5mD,EAAMwnD,OACrB3nD,KAAK89D,aAAa/W,EACtB,CACA,gBAAAqc,CAAiBrc,GACb,MAAMgc,EAAoB/iE,KAAK8iE,uBAEX,GADA9iE,KAAKmiE,cAAgBY,EAAkBthE,QAI3DzB,KAAKkjE,yBACAr2D,QAAQ1F,GAAMA,EAAEujD,WAAWpc,OAAOyY,KAClCziD,KAAK6C,GAAMnH,KAAKmjE,eAAeh8D,IACxC,CACA,oBAAA27D,GACI,OAAO9iE,KAAK2pD,OACPjD,iBACA75C,QAAQ1F,GAAmB,SAAbA,EAAEipB,QAAqBpwB,KAAKqjE,mBAAmBl8D,IACtE,CACA,sBAAA+7D,GACI,OAAOljE,KAAK2pD,OACPjD,iBACA75C,QAAQ1F,GAAmB,SAAbA,EAAEipB,SAAsBpwB,KAAKqjE,mBAAmBl8D,IACvE,CACA,cAAAg8D,CAAeh8D,GAGX,OAFA,GAAIotC,KAAK,+CAA+CptC,EAAEujD,WAAWrkD,cACrEc,EAAE2wD,KAAKt3D,KAAKkiE,IACLv7D,CACX,CACA,kBAAAk8D,CAAmBl8D,GACf,OAAOA,EAAE2wD,KAAK9sC,SAAS03C,GAC3B,EClFJ,MAAM,GAAM,IAAIxlB,GAAO,kBAKhB,MAAMomB,GACTrpD,QACAuiD,YACAhU,kBACAT,SACA,WAAAz4C,CAAY+sB,GACRr8B,KAAKia,QAAUoiB,EAAOpiB,SAAW,CAAC,EAClCja,KAAKw8D,YAAcngC,EAAOmgC,YAC1Bx8D,KAAKwoD,kBAAoBnsB,EAAOmsB,kBAChCxoD,KAAK+nD,SAAW,IAAI4D,GAAUtvB,EAAOmsB,kBAAkBjN,aAAclf,EAAOstB,OAChF,CAUA,oBAAO4Z,CAAen6B,EAAUnvB,GAC5B,MAAM,YAAE85B,EAAW,cAAEC,EAAa,cAAEwvB,GAAkBxjE,KAAKyjE,+BAA+Br6B,GACpFyiB,EAAY,CACd9X,cACAC,gBACAW,aAAa,EACbK,mBAAmB,KAChB/6B,GAEDytC,QAAa1nD,KAAK0jE,eACxB,IAAKhc,EAED,MADA,GAAIlgC,MAAM,+BACJ,IAAIhpB,MAAM,+BAEpB,GAAI+1C,KAAK,gCAAgClvB,KAAKE,UAAUtL,MACxD,MAAM0pD,EAAoB3jE,KAAK+nD,SAAS6D,aAAaC,EAAW2X,EAAe9b,GAC/E,UAAW,MAAMjU,KAAYkwB,QACnBlwB,CAEd,CASA,8BAAMmwB,CAAyBx6B,EAAUxZ,EAAU3V,GAC/C,GAAIs6B,KAAK,wCACT,UAAW,MAAMqqB,KAAY5+D,KAAKujE,eAAen6B,EAAUnvB,GACvD,SAAUja,KAAK6jE,gBAAgBjF,EAAUhvC,GACrC,KAEZ,CASA,8BAAMk0C,CAAyB16B,EAAUxZ,EAAU3V,GAC/C,GAAIs6B,KAAK,wCACT,IAAIwvB,GAAQ,EACZ,UAAW,MAAMC,KAAQhkE,KAAKujE,eAAen6B,EAAUnvB,GAAU,CAC7D,MAAMgqD,EAAYD,EAAK1/D,KAAI6oC,MAAO+2B,IAC1BH,IAEJA,EAAQj3D,cAAc8iB,EAASs0C,IAAY,IAG/C,SADM3nC,QAAQ6oB,IAAI6e,GACdF,EACA,KACR,CACJ,CASA,qBAAMF,CAAgBpwB,EAAU7jB,GAC5B,IAAIm0C,GAAQ,EACZ,MACMI,SADwB5nC,QAAQ6oB,IAAI3R,IACA5mC,OAAOklC,IAMjD,aALMxV,QAAQ6oB,IAAI+e,EAAkB7/D,KAAI6oC,MAAOqK,IACvCA,IAAQusB,IACRA,EAAQj3D,cAAc8iB,EAAS4nB,IACnC,KAEGusB,CACX,CAOA,YAAAK,CAAa53D,GACT,OAAOioC,GAAYjoC,EAAQunC,YAAavnC,EAC5C,CASA,8BAAAi3D,CAA+Br6B,GAC3B,GAAwB,IAApBA,EAAS3nC,OAET,MADA,GAAI+lB,MAAM,wBACJ,IAAIhpB,MAAM,wBAEpB,MAAM6lE,EAA4B1iE,MAAM4c,KAAK,IAAI48B,IAAI/R,EAAS9kC,KAAKssB,GAAYA,EAAQmjB,gBACvF,GAAIswB,EAA0B5iE,OAAS,EAEnC,MADA,GAAI+lB,MAAM,gEACJ,IAAIhpB,MAAM,gEAEpB,MAAM8lE,EAAsBD,EAA0B,GACtDzoB,GAA8B0oB,EAAqBtkE,KAAK+nD,SAASxM,cACjE,MAAMioB,EAAgB,IAAI31B,IAC1BzE,EAASj8B,SAASiyD,IACd,GAAIoE,EAAcvkE,IAAImgE,EAAIjtB,cAEtB,MADA,GAAI3qB,MAAM,4DACJ,IAAIhpB,MAAM,4DAEpBglE,EAAclkE,IAAI8/D,EAAIjtB,aAAcitB,EAAI,IAE5C,MAAMprB,EAAgB5K,EACjBv8B,QAAQ+jB,GAAYA,EAAQmjB,cAAgBuwB,IAC5ChgE,KAAK86D,GAAQA,EAAIjtB,eACtB,GAA6B,IAAzB6B,EAAcvyC,OAEd,MADA,GAAI+lB,MAAM,+BAA+B88C,KACnC,IAAI9lE,MAAM,+BAAiC8lE,GAErD,MAAO,CACHvwB,YAAauwB,EACbtwB,gBACAwvB,gBAER,CACA,kBAAME,GACF,IAAI3c,EACJ,GAAI/mD,KAAKia,SAASytC,KAAM,CACpB,MACMA,SADuB1nD,KAAKwoD,kBAAkBkQ,qBACxBp/B,MAAMoF,GAAMA,EAAEhuB,GAAGrK,aAAerG,KAAKia,SAASytC,OAC1EX,EAASW,GAAMh3C,GACVq2C,GACD,GAAI75C,KAAK,2CAA2ClN,KAAKia,QAAQytC,wCAEzE,CACA,MAAM4U,EAAUt8D,KAAKw8D,YAAY5D,WACjC,GAAI0D,EAAQ76D,OAAS,EAEjB,OAAO66D,EAAQrzD,KAAK6a,MAAM7a,KAAKm0B,SAAWk/B,EAAQ76D,SAEtD,GAAI+lB,MAAM,6BAEd,ECvKG,MAGM+8C,GAA2B,CAACloC,EAAQmoC,KAC7C,MAAM/uB,EAAapZ,EAAO6e,WAAWzF,WACjC+uB,EAAc/uB,UACZgvB,EAAqBpoC,EAAO6e,WAAa,uBAAwB7e,EAAO6e,UACxE7e,EAAO6e,UAAUupB,mBtEJO,EsES9B,MAAO,CACHhvB,YACA+F,MALenf,EAAO6e,WAAa,UAAW7e,EAAO6e,UACnD7e,EAAO6e,UAAUM,MACjBM,GAAyBzf,EAAO8V,aAAcsyB,GAInD,EAEQC,GAAoB,CAACxpB,EAAWspB,IACrCA,EAAc/uB,YAAcyF,EAAUzF,aAGtC,WAAY+uB,IACXA,EAAc9uB,OAAO1qB,SAASkwB,EAAUM,QCvB3C,GAAM,IAAI0B,GAAO,wBA+DvB/P,eAAew3B,GAAiBC,EAAMhd,GAClC,MAAMgX,EAAW,GAajB,OAZIgG,EAAKxP,OAASxN,EAAU58B,SAASqvB,GAAUwqB,QAC3CjG,EAASp+D,KAAKokE,EAAKxP,MAAM0P,gBAEzBF,EAAKG,OAASnd,EAAU58B,SAASqvB,GAAUipB,QAC3C1E,EAASp+D,KAAKwkE,GAAqBtZ,GAAYkZ,EAAKjb,SAEpDib,EAAKvG,WAAazW,EAAU58B,SAASqvB,GAAU+nB,YAC/CxD,EAASp+D,KAAKwkE,GAAqBpa,GAAgBga,EAAKjb,SAExDib,EAAK/3D,QAAU+6C,EAAU58B,SAASqvB,GAAUulB,SAC5ChB,EAASp+D,KAAKwkE,GAAqBxb,GAAwBob,EAAKjb,SAE7DptB,QAAQ6oB,IAAIwZ,EACvB,CAKAzxB,eAAe63B,GAAqB39B,EAAOsiB,GACvC,GAAIpV,KAAK,eAAelN,iBAClB,IAAI9K,SAASr4B,IACf,MAAM+iB,EAAK,MAAQ3mB,IACf,GAAIA,EAAIqnD,QAAQC,WAAW58B,SAASqc,GAAQ,CACxC,MAAM49B,EAAkBtb,EAAOkM,SAAS3N,SACxC,IAAK+c,EAGD,OAFAtb,EAAOrF,oBAAoB,gBAAiBr9B,QAC5C/iB,IAGJ,UACU+gE,EAAgBrJ,0BAA0Bt7D,EAAIqnD,OAAOZ,QAC3D4C,EAAOrF,oBAAoB,gBAAiBr9B,GAC5C/iB,GACJ,CACA,MAAO+f,GAEY,gCAAXA,EAAElP,MACF,GAAIyS,MAAM,4DAEd,GAAIA,MAAM,+BAA+BvD,IAC7C,CACJ,CACH,EACD0lC,EAAOvF,iBAAiB,gBAAiBn9B,EAAG,GAEpD,CAyCA,MAAMi+C,GAAe,CAACz6D,EAAI06D,IAAiB,IAAI5oC,SAAQ,CAAC6oC,EAAU5oC,IAAW3V,YAAW,IAAM2V,EAAOh+B,MAAM2mE,KAAgB16D,KChJrH,GAAM,IAAIyyC,GAAO,QAChB,MAAMmoB,GACT9pB,aACAoO,OACAyL,MACA2P,MACAl4D,OACAwxD,UACA7V,kBACA8c,OACAd,cAEAe,gBAAiB,EACjBC,cAAe,EACfhJ,YACA,WAAAltD,CAAYisC,EAActhC,EAAS0vC,EAAQ8b,EAAkBrQ,GACzDp1D,KAAKu7C,aAAeA,EACpBv7C,KAAKo1D,MAAQA,EACbp1D,KAAK2pD,OAASA,EACd3pD,KAAKwkE,cAAgBvqD,EAAQuqD,eAAiB9pB,GAC9C+qB,EAAmB,CACf54D,QAAQ,EACR64D,WAAW,EACXX,OAAO,KACJU,GAEP,MAAM1e,EAAS/mD,KAAK2pD,OAAO5C,OAAO1gD,WAClCrG,KAAKwoD,kBAAoB,IAAI+N,GAAkB,CAC3C5M,SACAyL,MAAOp1D,KAAKo1D,MACZ7Z,aAAcv7C,KAAKu7C,aACnBhjB,OAAQte,GAASuuC,oBAErBxoD,KAAKw8D,YAAc,IAAImG,GAAY,CAC/BhZ,SACApxB,OAAQ,CACJ4pC,cAAeloD,EAAQkoD,iBAG/BniE,KAAKslE,OAAS,IAAIzE,GAAgB,CAAElX,WAChC8b,EAAiBV,QACb9qD,EAAQ8qD,OAAOrd,MACf1nD,KAAKwoD,kBACAoR,yBAAyB3/C,EAAQ8qD,MAAMrd,KAAM,CAACgE,KAC9CpoB,OAAOrf,IACR,GAAIuD,MAAM,4BAA6BvD,EAAE,IAGjDjkB,KAAK+kE,MAAQ,IAAIzB,GAAM,CACnB3Z,SACAnB,kBAAmBxoD,KAAKwoD,kBACxBgU,YAAax8D,KAAKw8D,YAClBviD,QAAS,CACLytC,KAAMztC,EAAQ8qD,OAAOrd,SAI7B+d,EAAiBC,YACjB1lE,KAAKq+D,UAAY,IAAI+D,GAAU,CAC3BzY,SACA6S,YAAax8D,KAAKw8D,YAClBhU,kBAAmBxoD,KAAKwoD,kBACxBvuC,QAASA,GAASokD,aAGtBoH,EAAiB54D,SACjB7M,KAAK6M,OAAS,IAAI+yD,GAAO,CACrBjW,SACAnB,kBAAmBxoD,KAAKwoD,kBACxBgU,YAAax8D,KAAKw8D,YAClB6B,UAAWr+D,KAAKq+D,UAChBpkD,QAASA,EAAQpN,UAGzB,GAAI0nC,KAAK,oBAAqBwS,EAAQ,YAAY/mD,KAAKo1D,mBAAmBp1D,KAAK+kE,wBAAwB/kE,KAClGq+D,wBAAwBr+D,KAAK6M,SACtC,CACA,UAAIk6C,GACA,OAAO/mD,KAAK2pD,OAAO5C,MACvB,CACA,aAAIa,GACA,OAAO5nD,KAAK2pD,OAAOgc,cACvB,CACA,UAAMnM,CAAK9R,EAAME,GACb,MAAMge,EAAahe,GAAa,QACP,IAAdA,IACP5nD,KAAKo1D,OAASwQ,EAAWplE,KAAK65C,GAAUwqB,OACxC7kE,KAAK+kE,OAASa,EAAWplE,KAAK65C,GAAUipB,OACxCtjE,KAAK6M,QAAU+4D,EAAWplE,KAAK65C,GAAUulB,QACzC5/D,KAAKq+D,WAAauH,EAAWplE,KAAK65C,GAAU+nB,YAEhD,MAAMyD,EAAS,GACXD,EAAW56C,SAASqvB,GAAUwqB,SAC1B7kE,KAAKo1D,MACLp1D,KAAKo1D,MAAM0Q,UAAUC,YAAY54D,SAASk6B,GAAUw+B,EAAOrlE,KAAK6mC,KAGhE,GAAI7f,MAAM,yEAGdo+C,EAAW56C,SAASqvB,GAAUipB,SAC1BtjE,KAAK+kE,MACLc,EAAOrlE,KAAKR,KAAK+kE,MAAMhd,SAAStB,YAGhC,GAAIj/B,MAAM,yEAGdo+C,EAAW56C,SAASqvB,GAAU+nB,aAC1BpiE,KAAKq+D,UACLwH,EAAOrlE,KAAKR,KAAKq+D,UAAUtW,SAAStB,YAGpC,GAAIj/B,MAAM,8EAGdo+C,EAAW56C,SAASqvB,GAAUulB,UAC1B5/D,KAAK6M,OACLg5D,EAAOrlE,KAAKR,KAAK6M,OAAOk7C,SAAStB,YAGjC,GAAIj/B,MAAM,0EAGlB,MAAMu/B,EFlIwB,CAACA,GAC5B2F,GAAS3F,GAAUA,EAAS,GAAUA,GEiI1Bif,CAAuBte,GAEtC,OADA,GAAInT,KAAK,cAAcwS,EAAO1gD,6BAA6Bu/D,WAC9C5lE,KAAKwoD,kBAAkBoR,yBAAyBlS,EAAMme,EACvE,CACA,WAAM7+D,GACEhH,KAAKulE,gBAAkBvlE,KAAKu8D,cAEhCv8D,KAAKulE,gBAAiB,QAChBvlE,KAAK2pD,OAAO3iD,QAClBhH,KAAKw8D,YAAYx1D,QACjBhH,KAAKslE,OAAOt+D,QACZhH,KAAKq+D,WAAWr3D,QAChBhH,KAAKulE,gBAAiB,EACtBvlE,KAAKwlE,cAAe,EACxB,CACA,UAAMl/C,IACEtmB,KAAKulE,gBAAmBvlE,KAAKu8D,cAEjCv8D,KAAKulE,gBAAiB,EACtBvlE,KAAKq+D,WAAW/3C,OAChBtmB,KAAKslE,OAAOh/C,OACZtmB,KAAKw8D,YAAYl2C,OACjBtmB,KAAKwoD,kBAAkBliC,aACjBtmB,KAAK2pD,OAAOrjC,OAClBtmB,KAAKulE,gBAAiB,EACtBvlE,KAAKwlE,cAAe,EACxB,CACA,uBAAM9M,GACF,OAAO14D,KAAKwoD,kBAAkBkQ,mBAClC,CACA,kBAAMoM,CAAald,EAAW6Y,GAC1B,OD5IDtzB,eAAiCy3B,EAAMhd,EAAW6Y,GAErD7Y,EAAYA,GAAWnmD,OAASmmD,EAmIpC,SAA6Bgd,GACzB,MAAMhd,EAAY,GAalB,OAZIgd,EAAKxP,OACLxN,EAAUpnD,KAAK65C,GAAUwqB,OAEzBD,EAAK/3D,QACL+6C,EAAUpnD,KAAK65C,GAAUulB,QAEzBgF,EAAKG,OACLnd,EAAUpnD,KAAK65C,GAAUipB,OAEzBsB,EAAKvG,WACLzW,EAAUpnD,KAAK65C,GAAU+nB,WAEtBxa,CACX,CAlJgDqe,CAAoBrB,GAChE,MAAMxe,EAAcwe,EAAKjb,OAAOjD,iBAChC,IAAKke,EAAKrI,YACN,MAAM/9D,MAAM,4BAEhB,IAAK,MAAMupD,KAAYH,EACnB,OAAQG,GACJ,KAAK1N,GAAUwqB,MACX,IAAKD,EAAKxP,MACN,MAAM52D,MAAM,oDAChB,MACJ,KAAK67C,GAAU+nB,UACX,IAAKwC,EAAKvG,UACN,MAAM7/D,MAAM,wDAChB,MACJ,KAAK67C,GAAUipB,MACX,IAAKsB,EAAKG,MACN,MAAMvmE,MAAM,oDAChB,MACJ,KAAK67C,GAAUulB,OACX,IAAKgF,EAAK/3D,OACN,MAAMrO,MAAM,qDAI5B,MAAMogE,EAAW,CAAC+F,GAAiBC,EAAMhd,IACrCxB,EAAY3kD,OAAS,IAAMmmD,EAAU58B,SAASqvB,GAAUwqB,QACxDjG,EAASp+D,KA+DjB2sC,eAA+By3B,EAAMhd,GACjC,MAAMse,EAAiBtB,EAAKjb,OAAOiP,WAC7BqM,EAAkBL,EAAKjb,OAAOkM,SAAS3N,SACvCie,EAsDV,SAA8Bve,GAC1B,MAAMie,EAAS,IAAIh4B,IACbu4B,EAAkB,CACpB,CAAC/rB,GAAUulB,QAASpW,GACpB,CAACnP,GAAU+nB,WAAYxX,GACvB,CAACvQ,GAAUipB,OAAQ5X,IAEvB,IAAK,MAAM3D,KAAYH,EACfwe,EAAgBre,IAChB8d,EAAOvmE,IAAI8mE,EAAgBre,IAAW,GAG9C,OAAO8d,CACX,CAnEyBQ,CAAqBze,GAC1C,GAAKse,EAAezkE,QAAWwjE,EAI/B,IAAK,MAAMle,KAAUmf,EACjB,IACI,MAAMxe,QAAakd,EAAKjb,OAAOmM,UAAU12D,IAAI2nD,GAE7C,GADqBW,EAAKE,UAAUgT,MAAMzzD,GAAMg/D,EAAalnE,IAAIkI,cAEtC89D,EAAgBrJ,0BAA0B7U,IACnDv/B,QACVkgC,EAAKE,UAAUz6C,SAAShG,IAChBg/D,EAAalnE,IAAIkI,IACjBg/D,EAAa7mE,IAAI6H,GAAG,EACxB,IAEuBxF,MAAM4c,KAAK4nD,EAAaljE,UAAUqjE,OAAOjnE,GAAMA,KAEtE,MAIhB,CACA,MAAO4kB,GAEY,gCAAXA,EAAElP,MACF,GAAIyS,MAAM,4DAEd,GAAIA,MAAM,wCAAwCvD,KAClD,QACJ,MA7BA,GAAIswB,KAAK,uDAAuD2xB,EAAezkE,+BAA+BwjE,IA+BtH,CAnGsBsB,CAAgB3B,EAAMhd,IAEpC6Y,QAmGRtzB,eAA+BsV,EAASge,SAC9BlkC,QAAQ8nB,KAAK,CAAC5B,EAASyiB,GAAazE,EAnGkB,yCAoGhE,CApGc+F,CAAgBjqC,QAAQgjC,IAAIX,GAAW6B,SAGvClkC,QAAQgjC,IAAIX,EAE1B,CCuGe6H,CAAkBzmE,KAAM4nD,EAAW6Y,EAC9C,CACA,SAAAlE,GACI,OAAOv8D,KAAKwlE,cAAuC,YAAvBxlE,KAAK2pD,OAAOv5B,MAC5C,CACA,WAAA0mC,GACI,OAAO92D,KAAKwoD,kBAAkBsO,aAClC,CACA,aAAAzY,CAAchiB,GACV,MAAMqqC,EAAkBnC,GAAyBloC,EAAQr8B,KAAKwkE,eAE9D,GADA,GAAIjwB,KAAK,+BAA+BlvB,KAAKE,UAAU8W,EAAO6e,0BAA0B71B,KAAKE,UAAUmhD,gBAA8BrhD,KAAKE,UAAUvlB,KAAKwkE,oBACpJE,GAAkBgC,EAAiB1mE,KAAKwkE,eACzC,MAAMhmE,MAAM,4DAEhB,OAAO6/C,GAAchiB,EAAO8V,aAAcu0B,EAC9C,CACA,aAAAxoB,CAAc7hB,GACV,MAAMqqC,EAAkBnC,GAAyBloC,EAAQr8B,KAAKwkE,eAE9D,GADA,GAAIjwB,KAAK,+BAA+BlvB,KAAKE,UAAU8W,EAAO6e,0BAA0B71B,KAAKE,UAAUmhD,gBAA8BrhD,KAAKE,UAAUvlB,KAAKwkE,oBACpJE,GAAkBgC,EAAiB1mE,KAAKwkE,eACzC,MAAMhmE,MAAM,4DAEhB,OAAO0/C,GAAc,CACjB/L,aAAc9V,EAAO8V,aACrBe,UAAW7W,EAAO6W,UAClBoJ,qBAAsBoqB,GAE9B,EC3LG,MAAM,WAAmBloE,MAC5By0D,YAAc,aACd,WAAA3jD,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,YAChB,EAKG,MAAM4lE,WAA4BnoE,MACrCy0D,YAAc,sBACd,WAAA3jD,CAAY9C,EAAU,mBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAK4CvC,MAUzC,MAAM,WAA+BA,MACxCy0D,YAAc,yBACd,WAAA3jD,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAKG,MAAM6lE,WAA8BpoE,MACvCy0D,YAAc,wBACd,WAAA3jD,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAM8lE,WAA+BroE,MACxCy0D,YAAc,yBACd,WAAA3jD,CAAY9C,EAAU,uBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAK2CvC,MAUxC,MAAMsoE,WAA+BtoE,MACxCy0D,YAAc,yBACd,WAAA3jD,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAKG,MAAMgmE,WAA8BvoE,MACvCy0D,YAAc,wBACd,WAAA3jD,CAAY9C,EAAU,4BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMimE,WAA8BxoE,MACvCy0D,YAAc,wBACd,WAAA3jD,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMkmE,WAAyBzoE,MAClCy0D,YAAc,mBACd,WAAA3jD,CAAY9C,EAAU,uBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,kBAChB,EAKG,MAAMmmE,WAAyB1oE,MAClCy0D,YAAc,mBACd,WAAA3jD,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,kBAChB,EAKG,MAAMomE,WAAyB3oE,MAClCy0D,YAAc,mBACd,WAAA3jD,CAAY9C,EAAU,qCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,kBAChB,EAKG,MAAMqmE,WAAsB5oE,MAC/By0D,YAAc,gBACd,WAAA3jD,CAAY9C,EAAU,aAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,eAChB,EAKG,MAAMsmE,WAA2B7oE,MACpCy0D,YAAc,qBACd,WAAA3jD,CAAY9C,EAAU,kBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,oBAChB,EAKG,MAAMumE,WAA8B9oE,MACvCy0D,YAAc,wBACd,WAAA3jD,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMwmE,WAAwB/oE,MACjCy0D,YAAc,kBACd,WAAA3jD,CAAY9C,EAAU,eAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,iBAChB,EAKG,MAAMymE,WAA8BhpE,MACvCy0D,YAAc,wBACd,WAAA3jD,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAM0mE,WAAiCjpE,MAC1Cy0D,YAAc,2BACd,WAAA3jD,CAAY9C,EAAU,8BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,0BAChB,EAKG,MAAM2mE,WAA4BlpE,MACrCy0D,YAAc,sBACd,WAAA3jD,CAAY9C,EAAU,mBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAMG,MAAM,WAAsBvC,MAC/By0D,YAAc,gBACd,WAAA3jD,CAAY9C,EAAU,kBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,eAChB,EAKG,MAAM4mE,WAAqBnpE,MAC9By0D,YAAc,eACd,WAAA3jD,CAAY9C,EAAU,aAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,cAChB,EAMG,MAAM6mE,WAAwBppE,MACjCy0D,YAAc,kBACd,WAAA3jD,CAAY9C,EAAU,eAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,iBAChB,EAKqCvC,MAUlC,MAAMqpE,WAAkBrpE,MAC3By0D,YAAc,YACd,WAAA3jD,CAAY9C,EAAU,cAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,WAChB,EAK6BvC,MAY1B,MAAMspE,WAA+BtpE,MACxCy0D,YAAc,yBACd,WAAA3jD,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAKG,MAAMgnE,WAA2CvpE,MACpDy0D,YAAc,qCACd,WAAA3jD,CAAY9C,EAAU,qCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,oCAChB,EAKG,MAAMinE,WAA4CxpE,MACrDy0D,YAAc,sCACd,WAAA3jD,CAAY9C,EAAU,sCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qCAChB,EAKG,MAAM,WAAgCvC,MACzCy0D,YAAc,0BACd,WAAA3jD,CAAY9C,EAAU,wBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,yBAChB,EC/SJ,MAAMknE,GAAWzpD,SAAS,QAAS,GAC7B0pD,GAAmB1pD,SAAS,WAAY,GACxC2pD,GAAyB3pD,SAAS,WAAY,GAC9C,GAAW,CACb,EAAK4pD,GACL,EAAKA,GACL,EAkDJ,SAAqB54D,EAAK1P,GACtB,MAAM2B,EAAS4mE,GAAW74D,EAAK1P,GACzBkH,EAAQlH,EAAQoD,OAChB+D,EAAMnH,EAAQoD,OAASzB,EACvB6mE,EAAO,GACb,IAAK,IAAI/mE,EAAIyF,EAAOzF,EAAI0F,EAAK1F,IACrBA,IAAMyF,GAAoB,IAAXwI,EAAIjO,IAGvB+mE,EAAK9nE,KAAKgP,EAAIjO,IAGlB,OADAzB,EAAQoD,QAAUzB,EACXwO,WAAWsO,KAAK+pD,EAC3B,EA9DI,EA0GJ,SAAuB94D,EAAK1P,GACxB,MAAM2B,EAAS4mE,GAAW74D,EAAK1P,GACzByoE,EAAa/4D,EAAI1P,EAAQoD,QAC/BpD,EAAQoD,SACR,MAAM4L,EAAQU,EAAIyS,SAASniB,EAAQoD,OAAQpD,EAAQoD,OAASzB,EAAS,GAErE,GADA3B,EAAQoD,QAAUzB,EACC,IAAf8mE,EAEA,MAAM,IAAI/pE,MAAM,8CAEpB,OAAOsQ,CACX,EApHI,EAqHJ,SAAyBU,EAAK1P,GAC1B,MAAM2B,EAAS4mE,GAAW74D,EAAK1P,GACzBgP,EAAQU,EAAIyS,SAASniB,EAAQoD,OAAQpD,EAAQoD,OAASzB,GAE5D,OADA3B,EAAQoD,QAAUzB,EACXqN,CACX,EAzHI,EAoGJ,SAAkBU,EAAK1P,GAEnB,OADAA,EAAQoD,SACD,IACX,EAtGI,EA4DJ,SAA8BsM,EAAK1P,GAC/B,MAAM2nB,EAAQ4gD,GAAW74D,EAAK1P,GACxB0oE,EAAc1oE,EAAQoD,OAASukB,EAC/BooC,EAAOrgD,EAAI1P,EAAQoD,QACzBpD,EAAQoD,SACR,IAAIulE,EAAO,EACPC,EAAO,EACP7Y,EAAO,IACP4Y,EAAO,EACPC,EAAO7Y,GAEFA,EAAO,IACZ4Y,EAAO,EACPC,EAAO7Y,EAAO,KAGd4Y,EAAO,EACPC,EAAO7Y,EAAO,IAElB,IAAI8Y,EAAM,GAAGF,KAAQC,IACjBl8B,EAAM,GACV,KAAO1sC,EAAQoD,OAASslE,GAAa,CACjC,MAAM3Y,EAAOrgD,EAAI1P,EAAQoD,QAIzB,GAHApD,EAAQoD,SAERspC,EAAIhsC,KAAY,IAAPqvD,GACLA,EAAO,IAAK,CACZrjB,EAAI2S,UAEJ,IAAIl0C,EAAM,EACV,IAAK,IAAI1J,EAAI,EAAGA,EAAIirC,EAAI/qC,OAAQF,IAC5B0J,GAAOuhC,EAAIjrC,IAAW,EAAJA,EAEtBonE,GAAO,IAAI19D,IACXuhC,EAAM,EACV,CACJ,CACA,OAAOm8B,CACX,EAjGI,GAAMP,GACN,GAAMA,GACN,GAAMA,IAEH,SAAS,GAAU54D,EAAK1P,EAAU,CAAEoD,OAAQ,IAC/C,MAAM2vC,EAAMrjC,EAAI1P,EAAQoD,QAAU+kE,GAElC,GADAnoE,EAAQoD,SACa,MAAjB,GAAS2vC,GACT,OAAO,GAASA,GAAKrjC,EAAK1P,GAE9B,MAAM,IAAItB,MAAM,sBAAwBq0C,EAC5C,CACA,SAASw1B,GAAW74D,EAAK1P,GACrB,IAAI2B,EAAS,EACb,IAAK+N,EAAI1P,EAAQoD,QAAUglE,MAAsBA,GAAkB,CAE/D,MAAMzgD,EAAQjY,EAAI1P,EAAQoD,QAAUilE,GACpC,IAAIpiE,EAAM,KACVjG,EAAQoD,SACR,IAAK,IAAI3B,EAAI,EAAGA,EAAIkmB,EAAOlmB,IAAKzB,EAAQoD,SACpC6C,GAAOyJ,EAAI1P,EAAQoD,QAAQmD,SAAS,IAAI4pD,SAAS,EAAG,KAExDxuD,EAAS+c,SAASzY,EAAK,GAC3B,MAEItE,EAAS+N,EAAI1P,EAAQoD,QACrBpD,EAAQoD,SAEZ,OAAOzB,CACX,CACA,SAAS2mE,GAAa54D,EAAK1P,GACvBuoE,GAAW74D,EAAK1P,GAChB,MAAMgwD,EAAU,GAChB,OACQhwD,EAAQoD,QAAUsM,EAAIgB,aADjB,CAIT,MAAMsE,EAAS,GAAUtF,EAAK1P,GAC9B,GAAe,OAAXgV,EACA,MAEJg7C,EAAQtvD,KAAKsU,EACjB,CACA,OAAOg7C,CACX,CAuFA,SAASzO,GAAavyC,GAClB,GAAIA,EAAM0B,WAAa,IACnB,OAAOP,WAAWsO,KAAK,CAACzP,EAAM0B,aAGlC,MAAM/O,EAhBV,SAAsBzC,GAClB,IAAI4pE,EAAS5pE,EAAMqH,SAAS,IACxBuiE,EAAOnnE,OAAS,GAAM,IACtBmnE,EAAS,IAAMA,GAEnB,MAAM91D,EAAQ,IAAI+rC,GAClB,IAAK,IAAIt9C,EAAI,EAAGA,EAAIqnE,EAAOnnE,OAAQF,GAAK,EACpCuR,EAAMksC,OAAO/uC,WAAWsO,KAAK,CAACC,SAAS,GAAGoqD,EAAOrnE,KAAKqnE,EAAOrnE,EAAI,KAAM,OAE3E,OAAOuR,CACX,CAMmB+1D,CAAa/5D,EAAM0B,YAClC,OAAO,IAAIquC,GAAe5uC,WAAWsO,KAAK,CACtC9c,EAAO+O,WAAa03D,KACpBzmE,EACR,CACO,SAASqnE,GAAc9pE,GAC1B,MAAM+wB,EAAW,IAAI8uB,GAOrB,QANa,KACK7/C,EAAMijB,WAAW,KAE/B8N,EAASivB,OAAO/uC,WAAWsO,KAAK,CAAC,KAErCwR,EAASivB,OAAOhgD,GACT,IAAI6/C,GAAe5uC,WAAWsO,KAAK,CAAC,IAAQ8iC,GAAatxB,GAAWA,EAC/E,CACO,SAASg5C,GAAgB/pE,GAE5B,MAAMupE,EAAat4D,WAAWsO,KAAK,CAAC,IAC9BwR,EAAW,IAAI8uB,GAAe0pB,EAAYvpE,GAChD,OAAO,IAAI6/C,GAAe5uC,WAAWsO,KAAK,CAAC,IAAQ8iC,GAAatxB,GAAWA,EAC/E,CAIO,SAASi5C,GAAe/lE,EAAQ4vC,EAAM,IACzC,MAAM2L,EAAS,IAAIK,GACnB,IAAK,MAAMrvC,KAAOvM,EACdu7C,EAAOQ,OAAOxvC,GAElB,OAAO,IAAIqvC,GAAe5uC,WAAWsO,KAAK,CAACs0B,IAAOwO,GAAa7C,GAASA,EAC5E,CC3KO,MAAMyqB,GACT9jE,KAAO,QACP+jE,IACAC,KACA,WAAA75D,CAAY45D,GACRlpE,KAAKkpE,IAAMA,CACf,CACA,OAAIE,GCoHD,IAA+BC,EDhH9B,OAHiB,MAAbrpE,KAAKmpE,OACLnpE,KAAKmpE,MCkHqBE,EDlHQrpE,KAAKkpE,ICmHxCF,GAAe,CAClBF,GAAc74D,WAAWsO,KAAK,CAAC,KAC/ByqD,GAAe,CACXM,GAAOD,EAAUE,MAClB,KACHP,GAAe,CACXD,GAAgB,IAAIlqB,GAAe5uC,WAAWsO,KAAK,CAAC,IAAQ,GAAqB8qD,EAAUl0D,GAAK,GAAI,aAAc,GAAqBk0D,EAAUG,GAAK,GAAI,gBAC3J,OACJvnD,aDzHQjiB,KAAKmpE,IAChB,CACA,WAAAM,GACI,OAAO,GAAS5zD,OAAO6zD,GAAoB1pE,MAC/C,CACA,KAAA2pE,GACI,OAAO77B,GAAIO,SAAS,IAAKruC,KAAKypE,cAClC,CACA,QAAApjE,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAKypE,cAAc36D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,YAAM5pD,CAAOmqB,EAAMigC,GACf,OEVDz8B,eAA6BpuC,EAAK6qE,EAAKpyB,GAC1C,MAAM6xB,QAAkBj8B,OAAOC,OAAOw8B,UAAU,MAAO9qE,EAAK,CACxDgC,KAAM,QACN+oE,WAAY/qE,EAAIwqE,KAAO,UACxB,EAAO,CAAC,WACX,OAAOn8B,OAAOC,OAAO7tB,OAAO,CACxBze,KAAM,QACNqM,KAAM,CACFrM,KAAM,YAEXsoE,EAAWO,EAAKpyB,EAAIv1B,WAC3B,CFDe8nD,CAAc/pE,KAAKkpE,IAAKU,EAAKjgC,EACxC,EAEG,MAAMqgC,GACT7kE,KAAO,QACP+jE,IACAG,UACAF,KACA,WAAA75D,CAAY45D,GACRlpE,KAAKkpE,IAAMA,EACXlpE,KAAKqpE,UAAY,IAAIJ,GAAe,CAChCM,IAAKL,EAAIK,IACTU,IAAKf,EAAIe,IACTC,QAAS,CAAC,UACVC,IAAK,KACLh1D,EAAG+zD,EAAI/zD,EACPq0D,EAAGN,EAAIM,GAEf,CACA,OAAIJ,GC+DD,IAAgCgB,EFmDLprE,EC9G1B,OAHiB,MAAbgB,KAAKmpE,OACLnpE,KAAKmpE,MC6DsBiB,ED7DQpqE,KAAKkpE,IC8DzCF,GAAe,CAClBF,GAAc74D,WAAWsO,KAAK,CAAC,MFiDLvf,EEhDR,GAAqBorE,EAAW3tD,GAAK,GAAI,aFiDxD,IAAIoiC,GAAe5uC,WAAWsO,KAAK,CAAC,IAAQ8iC,GAAariD,GAAQA,IEhDpEgqE,GAAe,CACXM,GAAOc,EAAWb,MACnB,KACHP,GAAe,CACXD,GAAgB,IAAIlqB,GAAe5uC,WAAWsO,KAAK,CAAC,IAAQ,GAAqB6rD,EAAWj1D,GAAK,GAAI,aAAc,GAAqBi1D,EAAWZ,GAAK,GAAI,gBAC7J,OACJvnD,aDrEQjiB,KAAKmpE,IAChB,CACA,MAAA76B,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,UAAM9qD,CAAK9R,GACP,OEvDD2gC,eAA2BpuC,EAAKy4C,GACnC,MAAM4yB,QAAmBh9B,OAAOC,OAAOw8B,UAAU,MAAO9qE,EAAK,CACzDgC,KAAM,QACN+oE,WAAY/qE,EAAIwqE,KAAO,UACxB,EAAO,CAAC,SACLc,QAAkBj9B,OAAOC,OAAO/uB,KAAK,CACvCvd,KAAM,QACNqM,KAAM,CACFrM,KAAM,YAEXqpE,EAAY5yB,EAAIv1B,YACnB,OAAO,IAAIhS,WAAWo6D,EAAW,EAAGA,EAAU75D,WAClD,CF2Ce85D,CAAYtqE,KAAKkpE,IAAK18D,EACjC,EC7DJ,MAAM+9D,GAAUt6D,WAAWsO,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,GAAM,IAAM,GAAM,EAAM,EAAM,IAEjFisD,GAAUv6D,WAAWsO,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,EAAM,EAAM,KAE/DksD,GAAUx6D,WAAWsO,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,EAAM,EAAM,KAC/DmsD,GAAgB,CAClBT,KAAK,EACLE,IAAK,KACLZ,IAAK,SAEHoB,GAAgB,CAClBV,KAAK,EACLE,IAAK,KACLZ,IAAK,SAEHqB,GAAgB,CAClBX,KAAK,EACLE,IAAK,KACLZ,IAAK,SAmDF,SAASsB,GAAwB/7D,GAEpC,OAAOg8D,GADS,GAAUh8D,GAE9B,CACO,SAASg8D,GAA2Bt+D,GACvC,MAAMu+D,EAAcv+D,EAAQ,GAAG,GAAG,GAElC,IAAI2I,EACAq0D,EACJ,GAA+B,KAA3BuB,EAAYv6D,WAGZ,OAFA2E,EAAI,GAAmB41D,EAAY9oD,SAJxB,EAIyC/e,IAA4B,aAChFsmE,EAAI,GAAmBuB,EAAY9oD,SAAS/e,IAA4B,aACjE,IAAI+lE,GAAoB,IACxByB,GACHR,QAAS,CAAC,UACV/0D,IACAq0D,MAGR,GAA+B,KAA3BuB,EAAYv6D,WAGZ,OAFA2E,EAAI,GAAmB41D,EAAY9oD,SAdxB,EAcyC/e,IAA4B,aAChFsmE,EAAI,GAAmBuB,EAAY9oD,SAAS/e,IAA4B,aACjE,IAAI+lE,GAAoB,IACxB0B,GACHT,QAAS,CAAC,UACV/0D,IACAq0D,MAGR,GAA+B,MAA3BuB,EAAYv6D,WAGZ,OAFA2E,EAAI,GAAmB41D,EAAY9oD,SAxBxB,EAwByC/e,IAA4B,aAChFsmE,EAAI,GAAmBuB,EAAY9oD,SAAS/e,IAA4B,aACjE,IAAI+lE,GAAoB,IACxB2B,GACHV,QAAS,CAAC,UACV/0D,IACAq0D,MAGR,MAAM,IAAI,GAAuB,sCAAsCuB,EAAYv6D,qCACvF,CAwBA,SAAS84D,GAAO0B,GACZ,GAAc,UAAVA,EACA,OAAOT,GAEX,GAAc,UAAVS,EACA,OAAOR,GAEX,GAAc,UAAVQ,EACA,OAAOP,GAEX,MAAM,IAAI,GAAuB,iBAAiBO,IACtD,CEnJA,MAAMC,GAA6BhlC,OAAO,GAAK,GAAK,GAC9CwS,GAAuBxS,OAAO,IACpC,SAASilC,GAAQ13D,EAAG6sB,GAAK,GACrB,OAAIA,EACO,CAAEvqB,EAAGvL,OAAOiJ,EAAIy3D,IAAazpE,EAAG+I,OAAQiJ,GAAKilC,GAAQwyB,KACzD,CAAEn1D,EAAsC,EAAnCvL,OAAQiJ,GAAKilC,GAAQwyB,IAAiBzpE,EAA4B,EAAzB+I,OAAOiJ,EAAIy3D,IACpE,CAoCA,MASME,GAAM,CACRD,WAASxjE,MA7Cb,SAAe0jE,EAAK/qC,GAAK,GACrB,IAAIgrC,EAAK,IAAIz1D,YAAYw1D,EAAI3pE,QACzB6pE,EAAK,IAAI11D,YAAYw1D,EAAI3pE,QAC7B,IAAK,IAAIF,EAAI,EAAGA,EAAI6pE,EAAI3pE,OAAQF,IAAK,CACjC,MAAM,EAAEuU,EAAC,EAAEtU,GAAM0pE,GAAQE,EAAI7pE,GAAI8+B,IAChCgrC,EAAG9pE,GAAI+pE,EAAG/pE,IAAM,CAACuU,EAAGtU,EACzB,CACA,MAAO,CAAC6pE,EAAIC,EAChB,EAqCoBC,MApCN,CAACz1D,EAAGtU,IAAOykC,OAAOnwB,IAAM,IAAM2iC,GAAQxS,OAAOzkC,IAAM,GAqC7DgqE,MAnCU,CAAC11D,EAAG21D,EAAI1oE,IAAM+S,IAAM/S,EAmCvB2oE,MAlCG,CAAC51D,EAAGtU,EAAGuB,IAAO+S,GAAM,GAAK/S,EAAOvB,IAAMuB,EAmChD4oE,OAjCW,CAAC71D,EAAGtU,EAAGuB,IAAO+S,IAAM/S,EAAMvB,GAAM,GAAKuB,EAiCxC6oE,OAhCG,CAAC91D,EAAGtU,EAAGuB,IAAO+S,GAAM,GAAK/S,EAAOvB,IAAMuB,EAgCjC8oE,OA9BL,CAAC/1D,EAAGtU,EAAGuB,IAAO+S,GAAM,GAAK/S,EAAOvB,IAAOuB,EAAI,GA8B9B+oE,OA7Bb,CAACh2D,EAAGtU,EAAGuB,IAAO+S,IAAO/S,EAAI,GAAQvB,GAAM,GAAKuB,EA8BvDgpE,QA5BY,CAACC,EAAIxqE,IAAMA,EA4BdyqE,QA3BG,CAACn2D,EAAG21D,IAAO31D,EA4BvBo2D,OA1BW,CAACp2D,EAAGtU,EAAGuB,IAAO+S,GAAK/S,EAAMvB,IAAO,GAAKuB,EA0BxCopE,OAzBG,CAACr2D,EAAGtU,EAAGuB,IAAOvB,GAAKuB,EAAM+S,IAAO,GAAK/S,EAyBhCqpE,OAvBL,CAACt2D,EAAGtU,EAAGuB,IAAOvB,GAAMuB,EAAI,GAAQ+S,IAAO,GAAK/S,EAuB/BspE,OAtBb,CAACv2D,EAAGtU,EAAGuB,IAAO+S,GAAM/S,EAAI,GAAQvB,IAAO,GAAKuB,EAuBvDia,IApBJ,SAAaquD,EAAIC,EAAIgB,EAAIC,GACrB,MAAM/qE,GAAK8pE,IAAO,IAAMiB,IAAO,GAC/B,MAAO,CAAEz2D,EAAIu1D,EAAKiB,GAAO9qE,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBSgrE,MAfK,CAAClB,EAAIiB,EAAIE,KAAQnB,IAAO,IAAMiB,IAAO,IAAME,IAAO,GAehDC,MAdF,CAACh+D,EAAK28D,EAAIiB,EAAIK,IAAQtB,EAAKiB,EAAKK,GAAOj+D,EAAM,GAAK,GAAM,GAAM,EAcrDk+D,MAbT,CAACtB,EAAIiB,EAAIE,EAAII,KAAQvB,IAAO,IAAMiB,IAAO,IAAME,IAAO,IAAMI,IAAO,GAanDC,MAZhB,CAACp+D,EAAK28D,EAAIiB,EAAIK,EAAII,IAAQ1B,EAAKiB,EAAKK,EAAKI,GAAOr+D,EAAM,GAAK,GAAM,GAAM,EAYhDs+D,MAVvB,CAACt+D,EAAK28D,EAAIiB,EAAIK,EAAII,EAAIE,IAAQ5B,EAAKiB,EAAKK,EAAKI,EAAKE,GAAOv+D,EAAM,GAAK,GAAM,GAAM,EAUlDw+D,MAX9B,CAAC5B,EAAIiB,EAAIE,EAAII,EAAIM,KAAQ7B,IAAO,IAAMiB,IAAO,IAAME,IAAO,IAAMI,IAAO,IAAMM,IAAO,IAalG,OCpDOC,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,sBACpE/oE,KAAIkP,GAAKyyB,OAAOzyB,MArB6B,GAuBzC85D,GAA6B,IAAI13D,YAAY,IAC7C23D,GAA6B,IAAI33D,YAAY,IAC5C,MAAM43D,WAAe11B,GACxB,WAAAxoC,CAAY+mC,EAAY,IACpBjG,MAAM,IAAKiG,EAAW,IAAI,GAK1Br2C,KAAKqrE,GAAK,WACVrrE,KAAKsrE,IAAK,UACVtrE,KAAKssE,IAAK,WACVtsE,KAAKusE,IAAK,WACVvsE,KAAK2sE,GAAK,WACV3sE,KAAKysE,IAAK,SACVzsE,KAAK+sE,IAAK,WACV/sE,KAAK6sE,GAAK,WACV7sE,KAAKitE,GAAK,WACVjtE,KAAKmtE,IAAK,WACVntE,KAAKytE,IAAK,WACVztE,KAAK0tE,GAAK,UACV1tE,KAAK2tE,GAAK,UACV3tE,KAAK4tE,IAAK,SACV5tE,KAAK6tE,GAAK,WACV7tE,KAAK8tE,GAAK,SACd,CAEA,GAAA1uE,GACI,MAAM,GAAEisE,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,GAAO9tE,KAC3E,MAAO,CAACqrE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CAEA,GAAAxuE,CAAI+rE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5D9tE,KAAKqrE,GAAU,EAALA,EACVrrE,KAAKsrE,GAAU,EAALA,EACVtrE,KAAKssE,GAAU,EAALA,EACVtsE,KAAKusE,GAAU,EAALA,EACVvsE,KAAK2sE,GAAU,EAALA,EACV3sE,KAAKysE,GAAU,EAALA,EACVzsE,KAAK+sE,GAAU,EAALA,EACV/sE,KAAK6sE,GAAU,EAALA,EACV7sE,KAAKitE,GAAU,EAALA,EACVjtE,KAAKmtE,GAAU,EAALA,EACVntE,KAAKytE,GAAU,EAALA,EACVztE,KAAK0tE,GAAU,EAALA,EACV1tE,KAAK2tE,GAAU,EAALA,EACV3tE,KAAK4tE,GAAU,EAALA,EACV5tE,KAAK6tE,GAAU,EAALA,EACV7tE,KAAK8tE,GAAU,EAALA,CACd,CACA,OAAA18D,CAAQ6mC,EAAM/0C,GAEV,IAAK,IAAI3B,EAAI,EAAGA,EAAI,GAAIA,IAAK2B,GAAU,EACnCoqE,GAAW/rE,GAAK02C,EAAK6B,UAAU52C,GAC/BqqE,GAAWhsE,GAAK02C,EAAK6B,UAAW52C,GAAU,GAE9C,IAAK,IAAI3B,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAMwsE,EAA4B,EAArBT,GAAW/rE,EAAI,IACtBysE,EAA4B,EAArBT,GAAWhsE,EAAI,IACtB0sE,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,GAAW/rE,EAAI,GACrB6sE,EAA0B,EAApBb,GAAWhsE,EAAI,GACrB8sE,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,GAAWhsE,EAAI,GAAIgsE,GAAWhsE,EAAI,KAC7DitE,EAAO,SAAUD,EAAMN,EAAKI,EAAKf,GAAW/rE,EAAI,GAAI+rE,GAAW/rE,EAAI,KACzE+rE,GAAW/rE,GAAY,EAAPitE,EAChBjB,GAAWhsE,GAAY,EAAPgtE,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,GAAO9tE,KAEzE,IAAK,IAAIuB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMktE,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,GAAU9rE,GAAIgsE,GAAWhsE,IAC7DutE,EAAM,SAAUD,EAAMhB,EAAIY,EAASE,EAAMvB,GAAU7rE,GAAI+rE,GAAW/rE,IAClEwtE,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,IACFr3D,EAAGm3D,EAAIzrE,EAAG2rE,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,GAEGt5D,EAAGu1D,EAAI7pE,EAAG8pE,GAAO,OAAkB,EAAVtrE,KAAKqrE,GAAkB,EAAVrrE,KAAKsrE,GAAa,EAALD,EAAa,EAALC,MAC3Dx1D,EAAGw2D,EAAI9qE,EAAG+qE,GAAO,OAAkB,EAAVvsE,KAAKssE,GAAkB,EAAVtsE,KAAKusE,GAAa,EAALD,EAAa,EAALC,MAC3Dz2D,EAAG62D,EAAInrE,EAAGirE,GAAO,OAAkB,EAAVzsE,KAAK2sE,GAAkB,EAAV3sE,KAAKysE,GAAa,EAALE,EAAa,EAALF,MAC3D32D,EAAGi3D,EAAIvrE,GAAU,OAAkB,EAAVxB,KAAK+sE,GAAkB,EAAV/sE,KAAK6sE,GAAa,EAALE,EAAa,EAALF,MAC3D/2D,EAAGm3D,EAAIzrE,EAAG2rE,GAAO,OAAkB,EAAVntE,KAAKitE,GAAkB,EAAVjtE,KAAKmtE,GAAa,EAALF,EAAa,EAALE,MAC3Dr3D,EAAG23D,EAAIjsE,EAAGksE,GAAO,OAAkB,EAAV1tE,KAAKytE,GAAkB,EAAVztE,KAAK0tE,GAAa,EAALD,EAAa,EAALC,MAC3D53D,EAAG63D,EAAInsE,EAAGosE,GAAO,OAAkB,EAAV5tE,KAAK2tE,GAAkB,EAAV3tE,KAAK4tE,GAAa,EAALD,EAAa,EAALC,MAC3D93D,EAAG+3D,EAAIrsE,EAAGssE,GAAO,OAAkB,EAAV9tE,KAAK6tE,GAAkB,EAAV7tE,KAAK8tE,GAAa,EAALD,EAAa,EAALC,IAC9D9tE,KAAKV,IAAI+rE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACzE,CACA,UAAA11B,GACIk1B,GAAW/0B,KAAK,GAChBg1B,GAAWh1B,KAAK,EACpB,CACA,OAAA9sC,GACIzL,KAAK0S,OAAO6lC,KAAK,GACjBv4C,KAAKV,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC1D,EAqEG,MAAM,GAAyB,IAAgB,IAAM,IAAIkuE,KC9N1D6B,GAAsBppC,OAAO,GAC7BqpC,GAAsBrpC,OAAO,GAC5B,SAAS,GAAQtlB,GACpB,OAAOA,aAAa1Q,YAAe4B,YAAYW,OAAOmO,IAA6B,eAAvBA,EAAErR,YAAYvO,IAC9E,CACO,SAAS,GAAOskD,GACnB,IAAK,GAAQA,GACT,MAAM,IAAI7mD,MAAM,sBACxB,CACO,SAAS+wE,GAAMC,EAAOxwE,GACzB,GAAqB,kBAAVA,EACP,MAAM,IAAIR,MAAMgxE,EAAQ,0BAA4BxwE,EAC5D,CACO,SAASywE,GAAoBjjC,GAChC,MAAM92B,EAAM82B,EAAInmC,SAAS,IACzB,OAAoB,EAAbqP,EAAIjU,OAAa,IAAMiU,EAAMA,CACxC,CACO,SAASg6D,GAAYh6D,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIlX,MAAM,mCAAqCkX,GACzD,MAAe,KAARA,EAAa25D,GAAMppC,OAAO,KAAOvwB,EAC5C,CAEA,MAAM,GAE+B,mBAA9BzF,WAAWsO,KAAK,IAAI24B,OAAsD,mBAAvBjnC,WAAWknC,QAE/D,GAAwBx1C,MAAM4c,KAAK,CAAE9c,OAAQ,MAAO,CAACk3B,EAAGp3B,IAAMA,EAAE8E,SAAS,IAAI4pD,SAAS,EAAG,OAKxF,SAAS,GAAWnhD,GAGvB,GAFA,GAAOA,GAEH,GACA,OAAOA,EAAMooC,QAEjB,IAAIxhC,EAAM,GACV,IAAK,IAAInU,EAAI,EAAGA,EAAIuN,EAAMrN,OAAQF,IAC9BmU,GAAO,GAAM5G,EAAMvN,IAEvB,OAAOmU,CACX,CAGA,SAAS,GAAci6D,GACnB,OAAIA,GAFa,IAEMA,GAFE,GAGdA,EAHM,GAIbA,GAJ4B,IAIVA,GAJiB,GAK5BA,EAAK,GACZA,GAN0C,IAMxBA,GAN+B,IAO1CA,EAAK,QADhB,CAGJ,CAKO,SAAS,GAAWj6D,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAIlX,MAAM,mCAAqCkX,GAEzD,GAAI,GACA,OAAOzF,WAAWknC,QAAQzhC,GAC9B,MAAMk6D,EAAKl6D,EAAIjU,OACTouE,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAIpxE,MAAM,mDAAqDoxE,GACzE,MAAM98D,EAAQ,IAAI7C,WAAW4/D,GAC7B,IAAK,IAAIC,EAAK,EAAG7xD,EAAK,EAAG6xD,EAAKD,EAAIC,IAAM7xD,GAAM,EAAG,CAC7C,MAAM8xD,EAAK,GAAcr6D,EAAIrI,WAAW4Q,IAClC+xD,EAAK,GAAct6D,EAAIrI,WAAW4Q,EAAK,IAC7C,QAAW/e,IAAP6wE,QAA2B7wE,IAAP8wE,EAAkB,CACtC,MAAMrlC,EAAOj1B,EAAIuI,GAAMvI,EAAIuI,EAAK,GAChC,MAAM,IAAIzf,MAAM,+CAAiDmsC,EAAO,cAAgB1sB,EAC5F,CACAnL,EAAMg9D,GAAW,GAALC,EAAUC,CAC1B,CACA,OAAOl9D,CACX,CAEO,SAAS,GAAgBhE,GAC5B,OAAO4gE,GAAY,GAAW5gE,GAClC,CACO,SAAS,GAAgBA,GAE5B,OADA,GAAOA,GACA4gE,GAAY,GAAWz/D,WAAWsO,KAAKzP,GAAOqwC,WACzD,CACO,SAAS,GAAgB3rC,EAAGpR,GAC/B,OAAO,GAAWoR,EAAEnN,SAAS,IAAI4pD,SAAe,EAAN7tD,EAAS,KACvD,CACO,SAAS,GAAgBoR,EAAGpR,GAC/B,OAAO,GAAgBoR,EAAGpR,GAAK+8C,SACnC,CAcO,SAAS,GAAYqwB,EAAO95D,EAAKu6D,GACpC,IAAIrqC,EACJ,GAAmB,iBAARlwB,EACP,IACIkwB,EAAM,GAAWlwB,EACrB,CACA,MAAOuO,GACH,MAAM,IAAIzlB,MAAMgxE,EAAQ,6CAA+CvrD,EAC3E,KAEC,KAAI,GAAQvO,GAMb,MAAM,IAAIlX,MAAMgxE,EAAQ,qCAHxB5pC,EAAM31B,WAAWsO,KAAK7I,EAI1B,CACA,MAAMtT,EAAMwjC,EAAInkC,OAChB,GAA8B,iBAAnBwuE,GAA+B7tE,IAAQ6tE,EAC9C,MAAM,IAAIzxE,MAAMgxE,EAAQ,cAAgBS,EAAiB,kBAAoB7tE,GACjF,OAAOwjC,CACX,CAIO,SAAS,MAAe2Y,GAC3B,IAAI2xB,EAAM,EACV,IAAK,IAAI3uE,EAAI,EAAGA,EAAIg9C,EAAO98C,OAAQF,IAAK,CACpC,MAAMof,EAAI49B,EAAOh9C,GACjB,GAAOof,GACPuvD,GAAOvvD,EAAElf,MACb,CACA,MAAMmkC,EAAM,IAAI31B,WAAWigE,GAC3B,IAAK,IAAI3uE,EAAI,EAAGqoC,EAAM,EAAGroC,EAAIg9C,EAAO98C,OAAQF,IAAK,CAC7C,MAAMof,EAAI49B,EAAOh9C,GACjBqkC,EAAItmC,IAAIqhB,EAAGipB,GACXA,GAAOjpB,EAAElf,MACb,CACA,OAAOmkC,CACX,CAmBA,MAAMuqC,GAAY38D,GAAmB,iBAANA,GAAkB67D,IAAO77D,EACjD,SAAS,GAAQA,EAAGtK,EAAK3K,GAC5B,OAAO4xE,GAAS38D,IAAM28D,GAASjnE,IAAQinE,GAAS5xE,IAAQ2K,GAAOsK,GAAKA,EAAIjV,CAC5E,CAMO,SAAS,GAASixE,EAAOh8D,EAAGtK,EAAK3K,GAMpC,IAAK,GAAQiV,EAAGtK,EAAK3K,GACjB,MAAM,IAAIC,MAAM,kBAAoBgxE,EAAQ,KAAOtmE,EAAM,WAAa3K,EAAM,SAAWiV,EAC/F,CA8BO,MAAM,GAAWA,IAAO87D,IAAOrpC,OAAOzyB,IAAM87D,GAE7Cc,GAAOhuE,GAAQ,IAAI6N,WAAW7N,GAC9BiuE,GAAQx5B,GAAQ5mC,WAAWsO,KAAKs4B,GA4DhCy5B,GAAe,CACjBC,OAAStlE,GAAuB,iBAARA,EACxBulE,SAAWvlE,GAAuB,mBAARA,EAC1BwlE,QAAUxlE,GAAuB,kBAARA,EACzBsF,OAAStF,GAAuB,iBAARA,EACxBylE,mBAAqBzlE,GAAuB,iBAARA,GAAoB,GAAQA,GAChEirC,cAAgBjrC,GAAQV,OAAO2rC,cAAcjrC,GAC7C6H,MAAQ7H,GAAQtJ,MAAM2Q,QAAQrH,GAC9BjH,MAAO,CAACiH,EAAKwU,IAAWA,EAAOkxD,GAAGC,QAAQ3lE,GAC1CmC,KAAOnC,GAAuB,mBAARA,GAAsBV,OAAO2rC,cAAcjrC,EAAIorC,YAGlE,SAASw6B,GAAepxD,EAAQqxD,EAAYC,EAAgB,CAAC,GAChE,MAAMC,EAAa,CAACj0D,EAAW5X,EAAM8rE,KACjC,MAAMC,EAAWZ,GAAanrE,GAC9B,GAAwB,mBAAb+rE,EACP,MAAM,IAAI1yE,MAAM,8BACpB,MAAMyM,EAAMwU,EAAO1C,GACnB,KAAIk0D,QAAsB/xE,IAAR+L,GAEbimE,EAASjmE,EAAKwU,IACf,MAAM,IAAIjhB,MAAM,SAAWwQ,OAAO+N,GAAa,yBAA2B5X,EAAO,SAAW8F,EAChG,EAEJ,IAAK,MAAO8R,EAAW5X,KAASxG,OAAOmxD,QAAQghB,GAC3CE,EAAWj0D,EAAW5X,GAAM,GAChC,IAAK,MAAO4X,EAAW5X,KAASxG,OAAOmxD,QAAQihB,GAC3CC,EAAWj0D,EAAW5X,GAAM,GAChC,OAAOsa,CACX,CAmBO,SAAS0xD,GAAStxE,GACrB,MAAMyE,EAAM,IAAIspC,QAChB,MAAO,CAACwjC,KAAQjvE,KACZ,MAAM8I,EAAM3G,EAAIlF,IAAIgyE,GACpB,QAAYlyE,IAAR+L,EACA,OAAOA,EACX,MAAMomE,EAAWxxE,EAAGuxE,KAAQjvE,GAE5B,OADAmC,EAAIhF,IAAI8xE,EAAKC,GACNA,CAAQ,CAEvB,CC/UA,MAAM,GAAMprC,OAAO,GAAI,GAAMA,OAAO,GAAIqrC,GAAsBrrC,OAAO,GAAIsrC,GAAsBtrC,OAAO,GAEhGurC,GAAsBvrC,OAAO,GAAIwrC,GAAsBxrC,OAAO,GAAIyrC,GAAsBzrC,OAAO,GAI9F,SAAS,GAAItlB,EAAGC,GACnB,MAAM9L,EAAS6L,EAAIC,EACnB,OAAO9L,GAAU,GAAMA,EAAS8L,EAAI9L,CACxC,CAQO,SAAS6e,GAAI6Y,EAAKmlC,EAAOC,GAC5B,GAAID,EAAQ,GACR,MAAM,IAAInzE,MAAM,2CACpB,GAAIozE,GAAU,GACV,MAAM,IAAIpzE,MAAM,mBACpB,GAAIozE,IAAW,GACX,OAAO,GACX,IAAIhsC,EAAM,GACV,KAAO+rC,EAAQ,IACPA,EAAQ,KACR/rC,EAAOA,EAAM4G,EAAOolC,GACxBplC,EAAOA,EAAMA,EAAOolC,EACpBD,IAAU,GAEd,OAAO/rC,CACX,CAEO,SAASisC,GAAK18D,EAAGw8D,EAAOC,GAC3B,IAAIhsC,EAAMzwB,EACV,KAAOw8D,KAAU,IACb/rC,GAAOA,EACPA,GAAOgsC,EAEX,OAAOhsC,CACX,CAKO,SAASksC,GAAOlJ,EAAQgJ,GAC3B,GAAIhJ,IAAW,GACX,MAAM,IAAIpqE,MAAM,oCACpB,GAAIozE,GAAU,GACV,MAAM,IAAIpzE,MAAM,0CAA4CozE,GAEhE,IAAIjxD,EAAI,GAAIioD,EAAQgJ,GAChBhxD,EAAIgxD,EAEJz8D,EAAI,GAAKq0D,EAAI,GAAKuI,EAAI,GAAK1yE,EAAI,GACnC,KAAOshB,IAAM,IAAK,CAEd,MAAM6hB,EAAI5hB,EAAID,EACR6Z,EAAI5Z,EAAID,EACRyW,EAAIjiB,EAAI48D,EAAIvvC,EACZhvB,EAAIg2D,EAAInqE,EAAImjC,EAElB5hB,EAAID,EAAGA,EAAI6Z,EAAGrlB,EAAI48D,EAAGvI,EAAInqE,EAAG0yE,EAAI36C,EAAG/3B,EAAImU,CAC3C,CAEA,GADYoN,IACA,GACR,MAAM,IAAIpiB,MAAM,0BACpB,OAAO,GAAI2W,EAAGy8D,EAClB,CAwIO,MAEDI,GAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,QAqFrB,SAASC,GAAQz+D,EAAG0+D,GAEvB,MAAMC,OAA6BjzE,IAAfgzE,EAA2BA,EAAa1+D,EAAEnN,SAAS,GAAG5E,OAE1E,MAAO,CAAEywE,WAAYC,EAAaC,YADdnpE,KAAK01B,KAAKwzC,EAAc,GAEhD,CAgBO,SAAS,GAAME,EAAOC,EAAQt6B,GAAO,EAAOu6B,EAAQ,CAAC,GACxD,GAAIF,GAAS,GACT,MAAM,IAAI7zE,MAAM,0CAA4C6zE,GAChE,MAAQH,WAAYhgE,EAAMkgE,YAAaI,GAAUP,GAAQI,EAAOC,GAChE,GAAIE,EAAQ,KACR,MAAM,IAAIh0E,MAAM,kDACpB,IAAIi0E,EACJ,MAAMx9D,EAAItW,OAAOmd,OAAO,CACpBu2D,QACAr6B,OACA9lC,OACAsgE,QACAE,KAAM,GAAQxgE,GACdygE,KAAM,GACNC,IAAK,GACLh0E,OAAS4tC,GAAQ,GAAIA,EAAK6lC,GAC1BzB,QAAUpkC,IACN,GAAmB,iBAARA,EACP,MAAM,IAAIhuC,MAAM,sDAAwDguC,GAC5E,OAAO,IAAOA,GAAOA,EAAM6lC,CAAK,EAEpCQ,IAAMrmC,GAAQA,IAAQ,GACtBsmC,MAAQtmC,IAASA,EAAM,MAAS,GAChCumC,IAAMvmC,GAAQ,IAAKA,EAAK6lC,GACxBW,IAAK,CAACC,EAAKC,IAAQD,IAAQC,EAC3BC,IAAM3mC,GAAQ,GAAIA,EAAMA,EAAK6lC,GAC7Br1D,IAAK,CAACi2D,EAAKC,IAAQ,GAAID,EAAMC,EAAKb,GAClCe,IAAK,CAACH,EAAKC,IAAQ,GAAID,EAAMC,EAAKb,GAClCgB,IAAK,CAACJ,EAAKC,IAAQ,GAAID,EAAMC,EAAKb,GAClC1+C,IAAK,CAAC6Y,EAAKmlC,IAnHZ,SAAe18D,EAAGu3B,EAAKmlC,GAG1B,GAAIA,EAAQ,GACR,MAAM,IAAInzE,MAAM,2CACpB,GAAImzE,IAAU,GACV,OAAO18D,EAAE29D,IACb,GAAIjB,IAAU,GACV,OAAOnlC,EACX,IAAI9N,EAAIzpB,EAAE29D,IACNn2D,EAAI+vB,EACR,KAAOmlC,EAAQ,IACPA,EAAQ,KACRjzC,EAAIzpB,EAAEo+D,IAAI30C,EAAGjiB,IACjBA,EAAIxH,EAAEk+D,IAAI12D,GACVk1D,IAAU,GAEd,OAAOjzC,CACX,CAiG6B40C,CAAMr+D,EAAGu3B,EAAKmlC,GACnC4B,IAAK,CAACN,EAAKC,IAAQ,GAAID,EAAMnB,GAAOoB,EAAKb,GAAQA,GAEjDmB,KAAOhnC,GAAQA,EAAMA,EACrBinC,KAAM,CAACR,EAAKC,IAAQD,EAAMC,EAC1BQ,KAAM,CAACT,EAAKC,IAAQD,EAAMC,EAC1BS,KAAM,CAACV,EAAKC,IAAQD,EAAMC,EAC1BU,IAAMpnC,GAAQslC,GAAOtlC,EAAK6lC,GAC1BwB,KAAMtB,EAAMsB,MACR,CAAErgE,IACOi/D,IACDA,EAhNb,SAAgBqB,GAGnB,GAAIA,EAAItC,KAAQD,GAAK,CAKjB,MAAMwC,GAAUD,EAAI,IAAOtC,GAC3B,OAAO,SAAmBb,EAAIn9D,GAC1B,MAAMxC,EAAO2/D,EAAGh9C,IAAIngB,EAAGugE,GAEvB,IAAKpD,EAAGqC,IAAIrC,EAAGwC,IAAIniE,GAAOwC,GACtB,MAAM,IAAIhV,MAAM,2BACpB,OAAOwS,CACX,CACJ,CAEA,GAAI8iE,EAAIpC,KAAQD,GAAK,CACjB,MAAMz7D,GAAM89D,EAAIrC,IAAOC,GACvB,OAAO,SAAmBf,EAAIn9D,GAC1B,MAAMw8D,EAAKW,EAAG0C,IAAI7/D,EAAG89D,IACfjyE,EAAIsxE,EAAGh9C,IAAIq8C,EAAIh6D,GACfg+D,EAAKrD,EAAG0C,IAAI7/D,EAAGnU,GACfkC,EAAIovE,EAAG0C,IAAI1C,EAAG0C,IAAIW,EAAI1C,IAAMjyE,GAC5B2R,EAAO2/D,EAAG0C,IAAIW,EAAIrD,EAAGyC,IAAI7xE,EAAGovE,EAAGiC,MACrC,IAAKjC,EAAGqC,IAAIrC,EAAGwC,IAAIniE,GAAOwC,GACtB,MAAM,IAAIhV,MAAM,2BACpB,OAAOwS,CACX,CACJ,CAwBA,OA5HG,SAAuB8iE,GAM1B,MAAMG,GAAaH,EAAI,IAAOxC,GAC9B,IAAI4C,EAAGC,EAAGC,EAGV,IAAKF,EAAIJ,EAAI,GAAKK,EAAI,EAAGD,EAAI5C,KAAQ,GAAK4C,GAAK5C,GAAK6C,KAGpD,IAAKC,EAAI9C,GAAK8C,EAAIN,GAAKngD,GAAIygD,EAAGH,EAAWH,KAAOA,EAAI,GAAKM,IAErD,GAAIA,EAAI,IACJ,MAAM,IAAI51E,MAAM,+CAGxB,GAAU,IAAN21E,EAAS,CACT,MAAMJ,GAAUD,EAAI,IAAOtC,GAC3B,OAAO,SAAqBb,EAAIn9D,GAC5B,MAAMxC,EAAO2/D,EAAGh9C,IAAIngB,EAAGugE,GACvB,IAAKpD,EAAGqC,IAAIrC,EAAGwC,IAAIniE,GAAOwC,GACtB,MAAM,IAAIhV,MAAM,2BACpB,OAAOwS,CACX,CACJ,CAEA,MAAMqjE,GAAUH,EAAI,IAAO5C,GAC3B,OAAO,SAAqBX,EAAIn9D,GAE5B,GAAIm9D,EAAGh9C,IAAIngB,EAAGygE,KAAetD,EAAGoC,IAAIpC,EAAGiC,KACnC,MAAM,IAAIp0E,MAAM,2BACpB,IAAIg8B,EAAI25C,EAEJG,EAAI3D,EAAGh9C,IAAIg9C,EAAG0C,IAAI1C,EAAGiC,IAAKwB,GAAIF,GAC9B/+D,EAAIw7D,EAAGh9C,IAAIngB,EAAG6gE,GACdzzD,EAAI+vD,EAAGh9C,IAAIngB,EAAG0gE,GAClB,MAAQvD,EAAGqC,IAAIpyD,EAAG+vD,EAAGiC,MAAM,CACvB,GAAIjC,EAAGqC,IAAIpyD,EAAG+vD,EAAGgC,MACb,OAAOhC,EAAGgC,KAEd,IAAIv7C,EAAI,EACR,IAAK,IAAIm9C,EAAK5D,EAAGwC,IAAIvyD,GAAIwW,EAAIoD,IACrBm2C,EAAGqC,IAAIuB,EAAI5D,EAAGiC,KADUx7C,IAG5Bm9C,EAAK5D,EAAGwC,IAAIoB,GAGhB,MAAMC,EAAK7D,EAAGh9C,IAAI2gD,EAAG,IAAOruC,OAAOzL,EAAIpD,EAAI,IAC3Ck9C,EAAI3D,EAAGwC,IAAIqB,GACXr/D,EAAIw7D,EAAG0C,IAAIl+D,EAAGq/D,GACd5zD,EAAI+vD,EAAG0C,IAAIzyD,EAAG0zD,GACd95C,EAAIpD,CACR,CACA,OAAOjiB,CACX,CACJ,CAkEWs/D,CAAcX,EACzB,CAyJ4BY,CAAOrC,IACZI,EAAMx9D,EAAGzB,KAExBmhE,YAAcvJ,GA1Gf,SAAuBn2D,EAAG2/D,GAC7B,MAAMn9B,EAAM,IAAI91C,MAAMizE,EAAKnzE,QAErBozE,EAAiBD,EAAKtqC,QAAO,CAAC0Q,EAAKxO,EAAKjrC,IACtC0T,EAAE49D,IAAIrmC,GACCwO,GACXvD,EAAIl2C,GAAKy5C,EACF/lC,EAAEo+D,IAAIr4B,EAAKxO,KACnBv3B,EAAE29D,KAECkC,EAAW7/D,EAAE2+D,IAAIiB,GAQvB,OANAD,EAAKG,aAAY,CAAC/5B,EAAKxO,EAAKjrC,IACpB0T,EAAE49D,IAAIrmC,GACCwO,GACXvD,EAAIl2C,GAAK0T,EAAEo+D,IAAIr4B,EAAKvD,EAAIl2C,IACjB0T,EAAEo+D,IAAIr4B,EAAKxO,KACnBsoC,GACIr9B,CACX,CAuF8Bu9B,CAAc//D,EAAGm2D,GAGvC6J,KAAM,CAACt0D,EAAGC,EAAGzZ,IAAOA,EAAIyZ,EAAID,EAC5Bs2B,QAAUzK,GAASwL,EAAO,GAAgBxL,EAAKgmC,GAAS,GAAgBhmC,EAAKgmC,GAC7E0C,UAAYpmE,IACR,GAAIA,EAAMrN,SAAW+wE,EACjB,MAAM,IAAIh0E,MAAM,6BAA+Bg0E,EAAQ,eAAiB1jE,EAAMrN,QAClF,OAAOu2C,EAAO,GAAgBlpC,GAAS,GAAgBA,EAAM,IAGrE,OAAOnQ,OAAOmd,OAAO7G,EACzB,CAkCO,SAASkgE,GAAoBC,GAChC,GAA0B,iBAAfA,EACP,MAAM,IAAI52E,MAAM,8BACpB,MAAM62E,EAAYD,EAAW/uE,SAAS,GAAG5E,OACzC,OAAOwH,KAAK01B,KAAK02C,EAAY,EACjC,CAQO,SAASC,GAAiBF,GAC7B,MAAM3zE,EAAS0zE,GAAoBC,GACnC,OAAO3zE,EAASwH,KAAK01B,KAAKl9B,EAAS,EACvC,CCtaA,MAAM,GAAMwkC,OAAO,GACb,GAAMA,OAAO,GACnB,SAASsvC,GAAgBC,EAAWnwB,GAChC,MAAM0tB,EAAM1tB,EAAKowB,SACjB,OAAOD,EAAYzC,EAAM1tB,CAC7B,CACA,SAASqwB,GAAUC,EAAG1iE,GAClB,IAAK1I,OAAO2rC,cAAcy/B,IAAMA,GAAK,GAAKA,EAAI1iE,EAC1C,MAAM,IAAIzU,MAAM,qCAAuCyU,EAAO,YAAc0iE,EACpF,CACA,SAASC,GAAUD,EAAGE,GAClBH,GAAUC,EAAGE,GACb,MAEMC,EAAY,GAAKH,EAGvB,MAAO,CAAEI,QALO9sE,KAAK01B,KAAKk3C,EAAaF,GAAK,EAK1BK,WAJC,IAAML,EAAI,GAIC92D,KAFjB,GAAQ82D,GAEeG,YAAWG,QAD/BhwC,OAAO0vC,GAE3B,CACA,SAASO,GAAY1iE,EAAGzC,EAAQolE,GAC5B,MAAM,WAAEH,EAAU,KAAEn3D,EAAI,UAAEi3D,EAAS,QAAEG,GAAYE,EACjD,IAAIC,EAAQ7rE,OAAOiJ,EAAIqL,GACnBw3D,EAAQ7iE,GAAKyiE,EAMbG,EAAQJ,IAERI,GAASN,EACTO,GAAS,IAEb,MAAMC,EAAcvlE,EAASilE,EAM7B,MAAO,CAAEK,QAAOnzE,OALDozE,EAAcrtE,KAAKsE,IAAI6oE,GAAS,EAKvBG,OAJC,IAAVH,EAIiBI,MAHlBJ,EAAQ,EAGiBK,OAFxB1lE,EAAS,GAAM,EAEiB2lE,QAD/BJ,EAEpB,CAoBA,MAAMK,GAAmB,IAAI/oC,QACvBgpC,GAAmB,IAAIhpC,QAC7B,SAASipC,GAAK/C,GACV,OAAO8C,GAAiBx3E,IAAI00E,IAAM,CACtC,CAeO,SAASgD,GAAK3vE,EAAG8L,GACpB,MAAO,CACHsiE,mBACAwB,eAAeC,GACU,IAAdH,GAAKG,GAGhB,YAAAC,CAAaD,EAAKxjE,EAAGkrB,EAAIv3B,EAAEwrE,MACvB,IAAIl2D,EAAIu6D,EACR,KAAOxjE,EAAI,IACHA,EAAI,KACJkrB,EAAIA,EAAE1hB,IAAIP,IACdA,EAAIA,EAAEqG,SACNtP,IAAM,GAEV,OAAOkrB,CACX,EAaA,gBAAAw4C,CAAiBF,EAAKrB,GAClB,MAAM,QAAEI,EAAO,WAAEC,GAAeJ,GAAUD,EAAG1iE,GACvCkkE,EAAS,GACf,IAAIz4C,EAAIs4C,EACJ5jD,EAAOsL,EACX,IAAK,IAAI3tB,EAAS,EAAGA,EAASglE,EAAShlE,IAAU,CAC7CqiB,EAAOsL,EACPy4C,EAAO32E,KAAK4yB,GAEZ,IAAK,IAAI7xB,EAAI,EAAGA,EAAIy0E,EAAYz0E,IAC5B6xB,EAAOA,EAAKpW,IAAI0hB,GAChBy4C,EAAO32E,KAAK4yB,GAEhBsL,EAAItL,EAAKtQ,QACb,CACA,OAAOq0D,CACX,EAQA,IAAAL,CAAKnB,EAAGyB,EAAa5jE,GAOjB,IAAIkrB,EAAIv3B,EAAEwrE,KACN19D,EAAI9N,EAAEwgC,KAMV,MAAM0vC,EAAKzB,GAAUD,EAAG1iE,GACxB,IAAK,IAAIlC,EAAS,EAAGA,EAASsmE,EAAGtB,QAAShlE,IAAU,CAEhD,MAAM,MAAEslE,EAAK,OAAEnzE,EAAM,OAAEqzE,EAAM,MAAEC,EAAK,OAAEC,EAAM,QAAEC,GAAYR,GAAY1iE,EAAGzC,EAAQsmE,GACjF7jE,EAAI6iE,EACAE,EAGAthE,EAAIA,EAAE+H,IAAIu4D,GAAgBkB,EAAQW,EAAYV,KAI9Ch4C,EAAIA,EAAE1hB,IAAIu4D,GAAgBiB,EAAOY,EAAYl0E,IAErD,CAIA,MAAO,CAAEw7B,IAAGzpB,IAChB,EASA,UAAAqiE,CAAW3B,EAAGyB,EAAa5jE,EAAGwnC,EAAM7zC,EAAEwrE,MAClC,MAAM0E,EAAKzB,GAAUD,EAAG1iE,GACxB,IAAK,IAAIlC,EAAS,EAAGA,EAASsmE,EAAGtB,SACzBviE,IAAM,GAD4BzC,IAAU,CAGhD,MAAM,MAAEslE,EAAK,OAAEnzE,EAAM,OAAEqzE,EAAM,MAAEC,GAAUN,GAAY1iE,EAAGzC,EAAQsmE,GAEhE,GADA7jE,EAAI6iE,GACAE,EAKC,CACD,MAAMlxB,EAAO+xB,EAAYl0E,GACzB83C,EAAMA,EAAIh+B,IAAIw5D,EAAQnxB,EAAKowB,SAAWpwB,EAC1C,CACJ,CACA,OAAOrK,CACX,EACA,cAAAu8B,CAAe5B,EAAG7B,EAAG0D,GAEjB,IAAIC,EAAOd,GAAiBv3E,IAAI00E,GAMhC,OALK2D,IACDA,EAAOz3E,KAAKk3E,iBAAiBpD,EAAG6B,GACtB,IAANA,GACAgB,GAAiBr3E,IAAIw0E,EAAG0D,EAAUC,KAEnCA,CACX,EACA,UAAAC,CAAW5D,EAAGtgE,EAAGgkE,GACb,MAAM7B,EAAIkB,GAAK/C,GACf,OAAO9zE,KAAK82E,KAAKnB,EAAG31E,KAAKu3E,eAAe5B,EAAG7B,EAAG0D,GAAYhkE,EAC9D,EACA,gBAAAmkE,CAAiB7D,EAAGtgE,EAAGgkE,EAAW3uE,GAC9B,MAAM8sE,EAAIkB,GAAK/C,GACf,OAAU,IAAN6B,EACO31E,KAAKi3E,aAAanD,EAAGtgE,EAAG3K,GAC5B7I,KAAKs3E,WAAW3B,EAAG31E,KAAKu3E,eAAe5B,EAAG7B,EAAG0D,GAAYhkE,EAAG3K,EACvE,EAIA,aAAA+uE,CAAc9D,EAAG6B,GACbD,GAAUC,EAAG1iE,GACb2jE,GAAiBt3E,IAAIw0E,EAAG6B,GACxBgB,GAAiBzvB,OAAO4sB,EAC5B,EAER,CAWO,SAAS,GAAU3sE,EAAG0wE,EAAQV,EAAQW,GASzC,GAzMJ,SAA2BX,EAAQhwE,GAC/B,IAAKxF,MAAM2Q,QAAQ6kE,GACf,MAAM,IAAI34E,MAAM,kBACpB24E,EAAOhqE,SAAQ,CAACuxB,EAAGn9B,KACf,KAAMm9B,aAAav3B,GACf,MAAM,IAAI3I,MAAM,0BAA4B+C,EAAE,GAE1D,CAgMIw2E,CAAkBZ,EAAQhwE,GA/L9B,SAA4B2wE,EAAS9zE,GACjC,IAAKrC,MAAM2Q,QAAQwlE,GACf,MAAM,IAAIt5E,MAAM,6BACpBs5E,EAAQ3qE,SAAQ,CAACpK,EAAGxB,KAChB,IAAKyC,EAAM4sE,QAAQ7tE,GACf,MAAM,IAAIvE,MAAM,2BAA6B+C,EAAE,GAE3D,CAyLIy2E,CAAmBF,EAASD,GACxBV,EAAO11E,SAAWq2E,EAAQr2E,OAC1B,MAAM,IAAIjD,MAAM,uDACpB,MAAM0f,EAAO/W,EAAEwrE,KACTyD,EFtDH,SAAgB5iE,GACnB,IAAIpR,EACJ,IAAKA,EAAM,EAAGoR,EAAI67D,GAAK77D,IAAM87D,GAAKltE,GAAO,GAEzC,OAAOA,CACX,CEiDkBkwE,CAAOrsC,OAAOkxC,EAAO11E,SAC7Bu0E,EAAaI,EAAQ,GAAKA,EAAQ,EAAIA,EAAQ,EAAIA,EAAQ,EAAIA,EAAQ,EAAI,EAC1E1D,EAAO,GAAQsD,GACfiC,EAAU,IAAIt2E,MAAM4I,OAAOmoE,GAAQ,GAAGn6B,KAAKr6B,GAEjD,IAAIgyD,EAAMhyD,EACV,IAAK,IAAI3c,EAFQ0H,KAAK6a,OAAO+zD,EAAO3lE,KAAO,GAAK8jE,GAAcA,EAEvCz0E,GAAK,EAAGA,GAAKy0E,EAAY,CAC5CiC,EAAQ1/B,KAAKr6B,GACb,IAAK,IAAI1b,EAAI,EAAGA,EAAIs1E,EAAQr2E,OAAQe,IAAK,CACrC,MAAM01E,EAASJ,EAAQt1E,GACjB4zE,EAAQ7rE,OAAQ2tE,GAAUjyC,OAAO1kC,GAAMmxE,GAC7CuF,EAAQ7B,GAAS6B,EAAQ7B,GAAOp5D,IAAIm6D,EAAO30E,GAC/C,CACA,IAAI21E,EAAOj6D,EAEX,IAAK,IAAI1b,EAAIy1E,EAAQx2E,OAAS,EAAG22E,EAAOl6D,EAAM1b,EAAI,EAAGA,IACjD41E,EAAOA,EAAKp7D,IAAIi7D,EAAQz1E,IACxB21E,EAAOA,EAAKn7D,IAAIo7D,GAGpB,GADAlI,EAAMA,EAAIlzD,IAAIm7D,GACJ,IAAN52E,EACA,IAAK,IAAIiB,EAAI,EAAGA,EAAIwzE,EAAYxzE,IAC5B0tE,EAAMA,EAAIptD,QACtB,CACA,OAAOotD,CACX,CAgFO,SAASmI,GAAcrN,GAY1B,ODrJG,SAAuBhnE,GAC1B,MAMM84B,EAAOk1C,GAAa1nC,QAAO,CAAChmC,EAAK2G,KACnC3G,EAAI2G,GAAO,WACJ3G,IARK,CACZ+tE,MAAO,SACPK,KAAM,SACNF,MAAO,gBACPtgE,KAAM,kBAMH2+D,GAAe7sE,EAAO84B,EACjC,CC8HI,CAAckuC,EAAM2F,IACpBE,GAAe7F,EAAO,CAClBx3D,EAAG,SACHsC,EAAG,SACHwiE,GAAI,QACJC,GAAI,SACL,CACCrG,WAAY,gBACZE,YAAa,kBAGVzzE,OAAOmd,OAAO,IACdm2D,GAAQjH,EAAMx3D,EAAGw3D,EAAMkH,eACvBlH,EACEtsC,EAAGssC,EAAM2F,GAAG0B,OAEzB,CC3WA,MAAM,GAAMpsC,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAEhEuyC,GAAiB,CAAEC,QAAQ,GCLjC,MAAM,GAAMxyC,OAAO,GACb,GAAMA,OAAO,GCOnB,MAAMyyC,GAAYzyC,OAAO,iFAGnB0yC,GAAkC1yC,OAAO,iFAExB,IAAXA,OAAO,GAAUA,OAAO,IAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAEhE,GAAMA,OAAO,GAAI,GAAMA,OAAO,GACpC,SAAS2yC,GAAoBzjE,GAEzB,MAAM0jE,EAAO5yC,OAAO,IAAK6yC,EAAO7yC,OAAO,IAAK8yC,EAAO9yC,OAAO,IAAK+yC,EAAO/yC,OAAO,IACvE6tC,EAAI4E,GAEJ/hE,EADMxB,EAAIA,EAAK2+D,EACJ3+D,EAAK2+D,EAChBj9D,EAAMg7D,GAAKl7D,EAAI,GAAKm9D,GAAKn9D,EAAMm9D,EAC/Bh9D,EAAM+6D,GAAKh7D,EAAI,GAAKi9D,GAAK3+D,EAAK2+D,EAC9B38D,EAAO06D,GAAK/6D,EAAI,GAAKg9D,GAAKh9D,EAAMg9D,EAChCj8D,EAAOg6D,GAAK16D,EAAK0hE,EAAM/E,GAAK38D,EAAO28D,EACnC76D,EAAO44D,GAAKh6D,EAAKihE,EAAMhF,GAAKj8D,EAAOi8D,EACnCmF,EAAOpH,GAAK54D,EAAK8/D,EAAMjF,GAAK76D,EAAO66D,EACnCoF,EAAQrH,GAAKoH,EAAKD,EAAMlF,GAAKmF,EAAOnF,EACpCqF,EAAQtH,GAAKqH,EAAMF,EAAMlF,GAAKmF,EAAOnF,EACrCsF,EAAQvH,GAAKsH,EAAMN,EAAM/E,GAAK38D,EAAO28D,EAG3C,MAAO,CAAEuF,UAFUxH,GAAKuH,EAAM,GAAKtF,GAAK3+D,EAAK2+D,EAEzBn9D,KACxB,CACA,SAAS2iE,GAAkBxqE,GAQvB,OALAA,EAAM,IAAM,IAEZA,EAAM,KAAO,IAEbA,EAAM,KAAO,GACNA,CACX,CAEA,SAASyqE,GAAQxH,EAAG1yE,GAChB,MAAMy0E,EAAI4E,GACJrjD,EAAK,GAAIh2B,EAAIA,EAAIA,EAAGy0E,GACpBr+C,EAAK,GAAIJ,EAAKA,EAAKh2B,EAAGy0E,GAG5B,IAAI3+D,EAAI,GAAI48D,EAAI18C,EADJujD,GAAoB7G,EAAIt8C,GAAI4jD,UACdvF,GAC1B,MAAM0F,EAAM,GAAIn6E,EAAI8V,EAAIA,EAAG2+D,GACrB2F,EAAQtkE,EACRukE,EAAQ,GAAIvkE,EAAIwjE,GAAiB7E,GACjC6F,EAAWH,IAAQzH,EACnB6H,EAAWJ,IAAQ,IAAKzH,EAAG+B,GAC3B+F,EAASL,IAAQ,IAAKzH,EAAI4G,GAAiB7E,GAOjD,OANI6F,IACAxkE,EAAIskE,IACJG,GAAYC,KACZ1kE,EAAIukE,IJ+IkC,GI9IzBvkE,EAAG2+D,GJ8IyC,MAAS,KI7IlE3+D,EAAI,IAAKA,EAAG2+D,IACT,CAAElD,QAAS+I,GAAYC,EAAU56E,MAAOmW,EACnD,CAEO,MAUDw7D,GAAqB,KAAO,GAAM+H,QAAWx5E,GAAW,GAAnC,GACrB46E,GAAkC,MAAO,CAE3Cn5D,EAAGgwD,GAAG/xE,OAAOqnC,QAAQ,IAErBxpB,EAAGwpB,OAAO,iFAEV0qC,MAEAn9D,EAAGyyB,OAAO,gFACVnwB,EAAG,GACHwiE,GAAIryC,OAAO,iFACXsyC,GAAItyC,OAAO,iFACX74B,KAAM,GACNwqC,YAAW,GACX0hC,qBAIAC,aAlBoC,GA+B3BQ,GAA0B,KFjFhC,SAAwBC,GAC3B,MAAMC,EAxBV,SAAsBjP,GAClB,MAAMluC,EAAOu7C,GAAcrN,GAa3B,OAZA6F,GAAe7F,EAAO,CAClB59D,KAAM,WACNuT,EAAG,SACHlE,EAAG,SACHm7B,YAAa,YACd,CACC0hC,kBAAmB,WACnBY,OAAQ,WACRX,QAAS,WACTY,WAAY,aAGTx7E,OAAOmd,OAAO,IAAKghB,GAC9B,CASkBs9C,CAAaJ,IACrB,GAAErJ,EAAIn9D,EAAgB6mE,QAASA,EAASjtE,KAAMktE,EAAK,YAAE1iC,EAAW,YAAEw6B,EAAat8D,EAAGykE,GAAcN,EAKhGvH,EAAO,IAAQzsC,OAAqB,EAAdmsC,GAAmB,GACzCoI,EAAO7J,EAAG/xE,OACV67E,EAAK,GAAMR,EAAMzmE,EAAGymE,EAAM/H,YAE1BqH,EAAUU,EAAMV,SAClB,EAAExH,EAAG1yE,KACD,IACI,MAAO,CAAEuxE,SAAS,EAAM5xE,MAAO2xE,EAAGkD,KAAK9B,EAAIpB,EAAGiD,IAAIv0E,IACtD,CACA,MAAO4kB,GACH,MAAO,CAAE2sD,SAAS,EAAO5xE,MAAO,GACpC,CACH,GACCs6E,EAAoBW,EAAMX,mBAAqB,CAAExqE,GAAUA,GAC3DorE,EAASD,EAAMC,QACjB,EAAEvwC,EAAM7hB,EAAK4yD,KAET,GADAnL,GAAM,SAAUmL,GACZ5yD,EAAIrmB,QAAUi5E,EACd,MAAM,IAAIl8E,MAAM,uCACpB,OAAOmrC,CACV,GAGL,SAASgxC,EAAYnL,EAAOh8D,EAAGonE,GAAU,GAErC,GAAS,cAAgBpL,EAAOh8D,EADpBonE,EAAU,GAAM,GACYlI,EAC5C,CACA,SAASmI,EAAUtsC,GACf,KAAMA,aAAiBusC,GACnB,MAAM,IAAIt8E,MAAM,yBACxB,CAGA,MAAMu8E,EAAe5J,IAAS,CAACzyC,EAAGs8C,KAC9B,MAAQC,GAAI9lE,EAAG+lE,GAAI1R,EAAG2R,GAAIC,GAAM18C,EAC1Bm0C,EAAMn0C,EAAEm0C,MACJ,MAANmI,IACAA,EAAKnI,EAAM,GAAMlC,EAAGiD,IAAIwH,IAC5B,MAAMC,EAAKb,EAAKrlE,EAAI6lE,GACdM,EAAKd,EAAKhR,EAAIwR,GACdO,EAAKf,EAAKY,EAAIJ,GACpB,GAAInI,EACA,MAAO,CAAE19D,EAAG,GAAKq0D,EAAG,IACxB,GAAI+R,IAAO,GACP,MAAM,IAAI/8E,MAAM,oBACpB,MAAO,CAAE2W,EAAGkmE,EAAI7R,EAAG8R,EAAI,IAErBE,EAAkBrK,IAAUzyC,IAC9B,MAAM,EAAE/d,EAAC,EAAElE,GAAMw9D,EACjB,GAAIv7C,EAAEm0C,MACF,MAAM,IAAIr0E,MAAM,mBAGpB,MAAQy8E,GAAIQ,EAAGP,GAAIQ,EAAGP,GAAI/G,EAAGuH,GAAIC,GAAMl9C,EACjCm9C,EAAKrB,EAAKiB,EAAIA,GACdK,EAAKtB,EAAKkB,EAAIA,GACdK,EAAKvB,EAAKpG,EAAIA,GACd4H,EAAKxB,EAAKuB,EAAKA,GACfE,EAAMzB,EAAKqB,EAAKl7D,GAGtB,GAFa65D,EAAKuB,EAAKvB,EAAKyB,EAAMH,MACpBtB,EAAKwB,EAAKxB,EAAK/9D,EAAI+9D,EAAKqB,EAAKC,KAEvC,MAAM,IAAIt9E,MAAM,yCAIpB,GAFWg8E,EAAKiB,EAAIC,KACTlB,EAAKpG,EAAIwH,GAEhB,MAAM,IAAIp9E,MAAM,yCACpB,OAAO,CAAI,IAIf,MAAMs8E,EACF,WAAAxrE,CAAY2rE,EAAIC,EAAIC,EAAIQ,GACpBhB,EAAY,IAAKM,GACjBN,EAAY,IAAKO,GACjBP,EAAY,IAAKQ,GAAI,GACrBR,EAAY,IAAKgB,GACjB37E,KAAKi7E,GAAKA,EACVj7E,KAAKk7E,GAAKA,EACVl7E,KAAKm7E,GAAKA,EACVn7E,KAAK27E,GAAKA,EACVh9E,OAAOmd,OAAO9b,KAClB,CACA,KAAImV,GACA,OAAOnV,KAAKk8E,WAAW/mE,CAC3B,CACA,KAAIq0D,GACA,OAAOxpE,KAAKk8E,WAAW1S,CAC3B,CACA,iBAAO2S,CAAWz9C,GACd,GAAIA,aAAao8C,EACb,MAAM,IAAIt8E,MAAM,8BACpB,MAAM,EAAE2W,EAAC,EAAEq0D,GAAM9qC,GAAK,CAAC,EAGvB,OAFAi8C,EAAY,IAAKxlE,GACjBwlE,EAAY,IAAKnR,GACV,IAAIsR,EAAM3lE,EAAGq0D,EAAG,GAAKgR,EAAKrlE,EAAIq0D,GACzC,CACA,iBAAO4S,CAAWjF,GACd,MAAMkF,EAAQ1L,EAAGgE,YAAYwC,EAAO7yE,KAAKo6B,GAAMA,EAAEy8C,MACjD,OAAOhE,EAAO7yE,KAAI,CAACo6B,EAAGn9B,IAAMm9B,EAAEw9C,SAASG,EAAM96E,MAAK+C,IAAIw2E,EAAMqB,WAChE,CAEA,UAAOG,CAAInF,EAAQW,GACf,OAAO,GAAUgD,EAAOL,EAAItD,EAAQW,EACxC,CAEA,cAAAyE,CAAevG,GACXwG,EAAK5E,cAAc53E,KAAMg2E,EAC7B,CAGA,cAAAyG,GACIjB,EAAgBx7E,KACpB,CAEA,MAAAsuC,CAAOC,GACHssC,EAAUtsC,GACV,MAAQ0sC,GAAIyB,EAAIxB,GAAIyB,EAAIxB,GAAIyB,GAAO58E,MAC3Bi7E,GAAIY,EAAIX,GAAIY,EAAIX,GAAIY,GAAOxtC,EAC7BsuC,EAAOrC,EAAKkC,EAAKX,GACjBe,EAAOtC,EAAKqB,EAAKe,GACjBG,EAAOvC,EAAKmC,EAAKZ,GACjBiB,EAAOxC,EAAKsB,EAAKc,GACvB,OAAOC,IAASC,GAAQC,IAASC,CACrC,CACA,GAAAnK,GACI,OAAO7yE,KAAKsuC,OAAOwsC,EAAMnI,KAC7B,CACA,MAAA8C,GAEI,OAAO,IAAIqF,EAAMN,GAAMx6E,KAAKi7E,IAAKj7E,KAAKk7E,GAAIl7E,KAAKm7E,GAAIX,GAAMx6E,KAAK27E,IAClE,CAIA,MAAA74D,GACI,MAAM,EAAEnC,GAAMs5D,GACNgB,GAAIyB,EAAIxB,GAAIyB,EAAIxB,GAAIyB,GAAO58E,KAC7Bs5C,EAAIkhC,EAAKkC,EAAKA,GACdnjC,EAAIihC,EAAKmC,EAAKA,GACdnjC,EAAIghC,EAAK,GAAMA,EAAKoC,EAAKA,IACzBnjC,EAAI+gC,EAAK75D,EAAI24B,GACb2jC,EAAOP,EAAKC,EACZjjC,EAAI8gC,EAAKA,EAAKyC,EAAOA,GAAQ3jC,EAAIC,GACjCK,EAAIH,EAAIF,EACRI,EAAIC,EAAIJ,EACRK,EAAIJ,EAAIF,EACR2jC,EAAK1C,EAAK9gC,EAAIC,GACdwjC,EAAK3C,EAAK5gC,EAAIC,GACdujC,EAAK5C,EAAK9gC,EAAIG,GACdwjC,EAAK7C,EAAK7gC,EAAIC,GACpB,OAAO,IAAIkhC,EAAMoC,EAAIC,EAAIE,EAAID,EACjC,CAIA,GAAApgE,CAAIuxB,GACAssC,EAAUtsC,GACV,MAAM,EAAE5tB,EAAC,EAAElE,GAAMw9D,GACTgB,GAAIyB,EAAIxB,GAAIyB,EAAIxB,GAAIyB,EAAIjB,GAAIxhC,GAAOn6C,MACnCi7E,GAAIY,EAAIX,GAAIY,EAAIX,GAAIY,EAAIJ,GAAIvhC,GAAO7L,EACrC+K,EAAIkhC,EAAKkC,EAAKb,GACdtiC,EAAIihC,EAAKmC,EAAKb,GACdtiC,EAAIghC,EAAKrgC,EAAK19B,EAAI29B,GAClBX,EAAI+gC,EAAKoC,EAAKb,GACdriC,EAAI8gC,GAAMkC,EAAKC,IAAOd,EAAKC,GAAMxiC,EAAIC,GACrCI,EAAIF,EAAID,EACRI,EAAIH,EAAID,EACRK,EAAI2gC,EAAKjhC,EAAI54B,EAAI24B,GACjB4jC,EAAK1C,EAAK9gC,EAAIC,GACdwjC,EAAK3C,EAAK5gC,EAAIC,GACdujC,EAAK5C,EAAK9gC,EAAIG,GACdwjC,EAAK7C,EAAK7gC,EAAIC,GACpB,OAAO,IAAIkhC,EAAMoC,EAAIC,EAAIE,EAAID,EACjC,CACA,QAAAE,CAAS/uC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMknC,SAC1B,CACA,IAAAqB,CAAKtjE,GACD,OAAOgpE,EAAK9E,WAAW13E,KAAMwT,EAAGsnE,EAAMsB,WAC1C,CAEA,QAAAmB,CAASrF,GACL,MAAM1kE,EAAI0kE,EACV,GAAS,SAAU1kE,EAAG,GAAKgqE,GAC3B,MAAM,EAAE9+C,EAAC,EAAEzpB,GAAMjV,KAAK82E,KAAKtjE,GAC3B,OAAOsnE,EAAMsB,WAAW,CAAC19C,EAAGzpB,IAAI,EACpC,CAMA,cAAAwoE,CAAevF,EAAQl9B,EAAM8/B,EAAMnI,MAC/B,MAAMn/D,EAAI0kE,EAEV,OADA,GAAS,SAAU1kE,EAAG,GAAKgqE,GACvBhqE,IAAM,GACCkqE,EACP19E,KAAK6yE,OAASr/D,IAAM,GACbxT,KACJw8E,EAAK7E,iBAAiB33E,KAAMwT,EAAGsnE,EAAMsB,WAAYphC,EAC5D,CAKA,YAAA2iC,GACI,OAAO39E,KAAKy9E,eAAelD,GAAU1H,KACzC,CAGA,aAAA+K,GACI,OAAOpB,EAAKvF,aAAaj3E,KAAMw9E,GAAa3K,KAChD,CAGA,QAAAqJ,CAASlB,GACL,OAAOD,EAAa/6E,KAAMg7E,EAC9B,CACA,aAAA6C,GACI,MAAQ/nE,EAAGykE,GAAaN,EACxB,OAAIM,IAAa,GACNv6E,KACJA,KAAKy9E,eAAelD,EAC/B,CAGA,cAAOpjC,CAAQzhC,EAAK+iE,GAAS,GACzB,MAAM,EAAEh8D,EAAC,EAAEkE,GAAMs5D,EACX73E,EAAMuuE,EAAG6B,MACf98D,EAAM,GAAY,WAAYA,EAAKtT,GACnCmtE,GAAM,SAAUkJ,GAChB,MAAMqF,EAASpoE,EAAIxU,QACb68E,EAAWroE,EAAItT,EAAM,GAC3B07E,EAAO17E,EAAM,IAAgB,IAAX27E,EAClB,MAAMvU,EAAI,GAAgBsU,GAKpBv/E,EAAMk6E,EAAS/F,EAAO/B,EAAG0B,MAC/B,GAAS,aAAc7I,EAAG,GAAKjrE,GAG/B,MAAMy/E,EAAKxD,EAAKhR,EAAIA,GACduI,EAAIyI,EAAKwD,EAAK,IACd3+E,EAAIm7E,EAAK/9D,EAAIuhE,EAAKr9D,GACxB,IAAI,QAAEiwD,EAAS5xE,MAAOmW,GAAMokE,EAAQxH,EAAG1yE,GACvC,IAAKuxE,EACD,MAAM,IAAIpyE,MAAM,uCACpB,MAAMy/E,GAAU9oE,EAAI,MAAS,GACvB+oE,KAA4B,IAAXH,GACvB,IAAKtF,GAAUtjE,IAAM,IAAO+oE,EAExB,MAAM,IAAI1/E,MAAM,gCAGpB,OAFI0/E,IAAkBD,IAClB9oE,EAAIqlE,GAAMrlE,IACP2lE,EAAMqB,WAAW,CAAEhnE,IAAGq0D,KACjC,CACA,qBAAO2U,CAAeC,GAClB,MAAM,OAAElG,GAAWmG,EAAiBD,GACpC,OAAOxkC,EAAE2jC,SAASrF,EACtB,CACA,UAAAoG,GACI,MAAM,EAAEnpE,EAAC,EAAEq0D,GAAMxpE,KAAKk8E,WAChBptE,EAAQ,GAAgB06D,EAAGmH,EAAG6B,OAEpC,OADA1jE,EAAMA,EAAMrN,OAAS,IAAM0T,EAAI,GAAM,IAAO,EACrCrG,CACX,CACA,KAAAooC,GACI,OAAO,GAAWl3C,KAAKs+E,aAC3B,EAEJxD,EAAMnzC,KAAO,IAAImzC,EAAMb,EAAM3B,GAAI2B,EAAM1B,GAAI,GAAKiC,EAAKP,EAAM3B,GAAK2B,EAAM1B,KACtEuC,EAAMnI,KAAO,IAAImI,EAAM,GAAK,GAAK,GAAK,IACtC,MAAQnzC,KAAMiS,EAAG+4B,KAAM+K,GAAM5C,EACvB0B,EAAO1F,GAAKgE,EAAqB,EAAd1I,GACzB,SAASmM,EAAK59D,GACV,OAAO,GAAIA,EAAG68D,EAClB,CAEA,SAASgB,EAAQpxE,GACb,OAAOmxE,EAAK,GAAgBnxE,GAChC,CAEA,SAASixE,EAAiBt/E,GACtB,MAAMqD,EAAMuuE,EAAG6B,MACfzzE,EAAM,GAAY,cAAeA,EAAKqD,GAGtC,MAAMq8E,EAAS,GAAY,qBAAsBnE,EAAMv7E,GAAM,EAAIqD,GAC3Dqf,EAAO63D,EAAkBmF,EAAOv9E,MAAM,EAAGkB,IAG/C,MAAO,CAAEqf,OAAM/hB,OAFA++E,EAAOv9E,MAAMkB,EAAK,EAAIA,GAEd81E,OADRsG,EAAQ/8D,GAE3B,CAEA,SAASi9D,EAAqB3/E,GAC1B,MAAM,KAAE0iB,EAAI,OAAE/hB,EAAM,OAAEw4E,GAAWmG,EAAiBt/E,GAC5C4/E,EAAQ/kC,EAAE2jC,SAASrF,GACnB0G,EAAaD,EAAML,aACzB,MAAO,CAAE78D,OAAM/hB,SAAQw4E,SAAQyG,QAAOC,aAC1C,CAMA,SAASC,EAAmB/+E,EAAU,IAAImQ,cAAiB6uE,GACvD,MAAMtnC,EAAM,MAAesnC,GAC3B,OAAON,EAAQlE,EAAMJ,EAAO1iC,EAAK,GAAY,UAAW13C,KAAYu6E,IACxE,CAeA,MAAM0E,EAAavG,GAqDnB,OAjBA5+B,EAAE2iC,eAAe,GAiBV,CACHtC,QACA+E,aA7EJ,SAAsBZ,GAClB,OAAOM,EAAqBN,GAASQ,UACzC,EA4EItgE,KArEJ,SAAck5B,EAAK4mC,EAASnkE,EAAU,CAAC,GACnCu9B,EAAM,GAAY,UAAWA,GACzB6iC,IACA7iC,EAAM6iC,EAAQ7iC,IAClB,MAAM,OAAE93C,EAAM,OAAEw4E,EAAM,WAAE0G,GAAeF,EAAqBN,GACtD5jD,EAAIqkD,EAAmB5kE,EAAQna,QAASJ,EAAQ83C,GAChDynC,EAAIrlC,EAAE2jC,SAAS/iD,GAAG8jD,aAElBv7E,EAAIw7E,EAAK/jD,EADLqkD,EAAmB5kE,EAAQna,QAASm/E,EAAGL,EAAYpnC,GACtC0gC,GAGvB,OAFA,GAAS,cAAen1E,EAAG,GAAKy6E,GAEzB,GAAY,SADP,GAAYyB,EAAG,GAAgBl8E,EAAG4tE,EAAG6B,QACJ,EAAX7B,EAAG6B,MACzC,EA0DIhzD,OApDJ,SAAgBoqD,EAAKpyB,EAAK6xB,EAAWpvD,EAAU8kE,GAC3C,MAAM,QAAEj/E,EAAO,OAAE24E,GAAWx+D,EACtB7X,EAAMuuE,EAAG6B,MACf5I,EAAM,GAAY,YAAaA,EAAK,EAAIxnE,GACxCo1C,EAAM,GAAY,UAAWA,GAC7B6xB,EAAY,GAAY,YAAaA,EAAWjnE,QACjClD,IAAXu5E,GACAlJ,GAAM,SAAUkJ,GAChB4B,IACA7iC,EAAM6iC,EAAQ7iC,IAClB,MAAMz0C,EAAI,GAAgB6mE,EAAI1oE,MAAMkB,EAAK,EAAIA,IAC7C,IAAIk3C,EAAG2lC,EAAGC,EACV,IAII5lC,EAAIwhC,EAAM3jC,QAAQkyB,EAAWoP,GAC7BwG,EAAInE,EAAM3jC,QAAQyyB,EAAI1oE,MAAM,EAAGkB,GAAMq2E,GACrCyG,EAAKtlC,EAAE6jC,eAAe16E,EAC1B,CACA,MAAOykB,GACH,OAAO,CACX,CACA,IAAKixD,GAAUn/B,EAAEqkC,eACb,OAAO,EACX,MAAMjlD,EAAImmD,EAAmB/+E,EAASm/E,EAAEX,aAAchlC,EAAEglC,aAAc9mC,GAItE,OAHYynC,EAAEjiE,IAAIs8B,EAAEmkC,eAAe/kD,IAGxB4kD,SAAS4B,GAAIrB,gBAAgBvvC,OAAOwsC,EAAMnI,KACzD,EAuBIwM,cAAerE,EACfsE,MAtBU,CACVV,uBAEAW,iBAAkB,IAAMznC,EAAY+4B,EAAG6B,OAOvC8M,WAAU,CAACtJ,EAAa,EAAG2I,EAAQ7D,EAAMnzC,QACrCg3C,EAAMpC,eAAevG,GACrB2I,EAAMpB,SAASt3C,OAAO,IACf04C,IAWnB,CE1T8C,CAAe7E,IAAtB,GAwB1ByF,GAAyB,KDrH/B,SAAoBvF,GACvB,MAAMC,GAfNpJ,GADkB7F,EAgBSgP,EAfL,CAClBr5D,EAAG,UACJ,CACC6+D,eAAgB,gBAChBpN,YAAa,gBACbkH,kBAAmB,WACnBY,OAAQ,WACRuF,WAAY,WACZC,GAAI,WAGD/gF,OAAOmd,OAAO,IAAKkvD,KAZ9B,IAAsBA,EAiBlB,MAAM,EAAE8I,GAAMmG,EACRO,EAAQhnE,GAAM,GAAIA,EAAGsgE,GACrB0L,EAAiBvF,EAAMuF,eACvBG,EAAkB12E,KAAK01B,KAAK6gD,EAAiB,GAC7CI,EAAW3F,EAAM7H,YACjBkH,EAAoBW,EAAMX,mBAAqB,CAAExqE,GAAUA,GAC3D2wE,EAAaxF,EAAMwF,YAAc,CAAEtqE,GAAMwe,GAAIxe,EAAG2+D,EAAI7tC,OAAO,GAAI6tC,IAWrE,SAAS+L,EAAMC,EAAMC,EAAKC,GACtB,MAAM31D,EAAQmwD,EAAKsF,GAAQC,EAAMC,IAGjC,MAAO,CAFPD,EAAMvF,EAAKuF,EAAM11D,GACjB21D,EAAMxF,EAAKwF,EAAM31D,GAErB,CAGA,MAAM41D,GAAOhG,EAAMt5D,EAAIslB,OAAO,IAAMA,OAAO,GA2D3C,SAASi6C,EAAkBnO,GACvB,OAAO,GAAgByI,EAAKzI,GAAI4N,EACpC,CAkBA,SAASQ,EAAWjI,EAAQnG,GACxB,MAAMqO,EAlBV,SAA2BC,GAGvB,MAAMtO,EAAI,GAAY,eAAgBsO,EAAMV,GAG5C,OAFiB,KAAbC,IACA7N,EAAE,KAAO,KACN,GAAgBA,EAC3B,CAWmBuO,CAAkBvO,GAC3BwO,EAXV,SAAsB/sE,GAClB,MAAM1E,EAAQ,GAAY,SAAU0E,GAC9BpR,EAAM0M,EAAMrN,OAClB,GAAIW,IAAQu9E,GAAmBv9E,IAAQw9E,EAEnC,MAAM,IAAIphF,MAAM,4BADCmhF,EAAkB,OAASC,EACU,eAAiBx9E,GAE3E,OAAO,GAAgBk3E,EAAkBxqE,GAC7C,CAGoB0xE,CAAatI,GACvBuI,EA3EV,SAA0B1O,EAAGmG,GACzB,GAAS,IAAKnG,EAAG,GAAK+B,GACtB,GAAS,SAAUoE,EAAQ,GAAKpE,GAGhC,MAAMp7C,EAAIw/C,EACJwI,EAAM3O,EACZ,IAKI4O,EALAZ,EAAM,GACNa,EAAM,GACNZ,EAAMjO,EACN8O,EAAM,GACNf,EAAO,GAEX,IAAK,IAAI3iE,EAAI8oB,OAAOu5C,EAAiB,GAAIriE,GAAK,GAAKA,IAAK,CACpD,MAAM2jE,EAAOpoD,GAAKvb,EAAK,GACvB2iE,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,MAAMxnC,EAAIymC,EAAMa,EACVG,EAAKvG,EAAKlhC,EAAIA,GACdC,EAAIwmC,EAAMa,EACVI,EAAKxG,EAAKjhC,EAAIA,GACdG,EAAIqnC,EAAKC,EACTxnC,EAAIwmC,EAAMa,EAEVI,EAAKzG,GADDwF,EAAMa,GACIvnC,GACd4nC,EAAK1G,EAAKhhC,EAAID,GACd4nC,EAAOF,EAAKC,EACZE,EAAQH,EAAKC,EACnBlB,EAAMxF,EAAK2G,EAAOA,GAClBN,EAAMrG,EAAKkG,EAAMlG,EAAK4G,EAAQA,IAC9BrB,EAAMvF,EAAKuG,EAAKC,GAChBJ,EAAMpG,EAAK9gC,GAAKqnC,EAAKvG,EAAKyF,EAAMvmC,IACpC,CAEAinC,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,OAAOpG,EAAKuF,EAAMsB,EACtB,CAwBeC,CAAiBlB,EAAQG,GAGpC,GAAIE,IAAO,GACP,MAAM,IAAIjiF,MAAM,0CACpB,OAAO0hF,EAAkBO,EAC7B,CAEA,MAAMc,EAAUrB,EAAkBjG,EAAMyF,IACxC,SAAS8B,EAAetJ,GACpB,OAAOiI,EAAWjI,EAAQqJ,EAC9B,CACA,MAAO,CACHpB,aACAqB,iBACAC,gBAAiB,CAACrX,EAAYf,IAAc8W,EAAW/V,EAAYf,GACnE2V,aAAe5U,GAAeoX,EAAepX,GAC7CgV,MAAO,CAAEC,iBAAkB,IAAMpF,EAAMriC,YAAYqiC,EAAM7H,cACzDmP,QAASA,EAEjB,CCZ6CG,CAAW,CACpD5N,EAAG4E,GACH/3D,EAAGslB,OAAO,QACVu5C,eAAgB,IAChBpN,YAAa,GACbsN,GAAIz5C,OAAO,GACXw5C,WAAatqE,IACT,MAAM2+D,EAAI4E,IAEJ,UAAEW,EAAS,GAAE1iE,GAAOiiE,GAAoBzjE,GAC9C,OAAO,GAAI08D,GAAKwH,EAAW,GAAKvF,GAAKn9D,EAAIm9D,EAAE,EAE/CwF,qBACA1hC,YAAW,KAbuB,GCpGtC,SAAS+pC,GAAWC,EAAevY,GAC/B,MAAMe,EAAa,IAAIn6D,WA1CK,IA2C5B,IAAK,IAAI1O,EAAI,EAAGA,EA1CK,GA0CiBA,IAClC6oE,EAAW7oE,GAAKqgF,EAAcrgF,GAC9B6oE,EA5CiB,GA4Ca7oE,GAAK8nE,EAAU9nE,GAEjD,OAAO6oE,CACX,CC1CO,MAAMyX,GACT18E,KAAO,UACPikE,IACA,WAAA95D,CAAYvQ,GACRiB,KAAKopE,IAAM0Y,GAAiB/iF,EDXL,GCY3B,CACA,WAAA0qE,GACI,OAAO,GAAS5zD,OAAO6zD,GAAoB1pE,MAC/C,CACA,KAAA2pE,GACI,OAAO77B,GAAIO,SAAS,IAAKruC,KAAKypE,cAClC,CACA,QAAApjE,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAKypE,cAAc36D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,MAAA5pD,CAAOmqB,EAAMigC,GACT,ODUD,SAAuBP,EAAWO,EAAKpyB,GAC1C,OAAO,GAAGh4B,OAAOoqD,EAAKpyB,aAAevnC,WAAaunC,EAAMA,EAAIv1B,WAAYonD,EAC5E,CCZe,CAAqBrpE,KAAKopE,IAAKQ,EAAKjgC,EAC/C,EAEG,MAAMo4C,GACT58E,KAAO,UACPikE,IACAC,UAGA,WAAA/5D,CAAYvQ,EAAKsqE,GACbrpE,KAAKopE,IAAM0Y,GAAiB/iF,EDtCJ,ICuCxBiB,KAAKqpE,UAAY,IAAIwY,GAAiBxY,EAC1C,CACA,MAAA/6B,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,IAAA9qD,CAAK9R,GACD,ODdD,SAAqB49D,EAAY5yB,GACpC,MAAMoqC,EAAgBxX,EAAWnoD,SAAS,EAlCrB,IAmCrB,OAAO,GAAG3D,KAAKk5B,aAAevnC,WAAaunC,EAAMA,EAAIv1B,WAAY2/D,EACrE,CCWe,CAAmB5hF,KAAKopE,IAAK58D,EACxC,ECnCG,SAASw1E,GAA0BlzE,GAEtC,OADAA,EAAQgzE,GAAiBhzE,EFhBE,IEiBpB,IAAI+yE,GAAsB/yE,EACrC,CASO,SAASgzE,GAAiB/iF,EAAK0C,GAElC,IADA1C,EAAMkR,WAAWsO,KAAKxf,GAAO,KACrB0C,SAAWA,EACf,MAAM,IAAI,GAAuB,sCAAsCA,UAAe1C,EAAI0C,UAE9F,OAAO1C,CACX,CC5BO,IAAIkjF,GAOPC,GAYOC,GAoDAC,IAtEX,SAAWH,GACPA,EAAa,IAAI,MACjBA,EAAiB,QAAI,UACrBA,EAAmB,UAAI,YACvBA,EAAe,MAAI,OACtB,CALD,CAKGA,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACPA,EAAgBA,EAAqB,IAAI,GAAK,MAC9CA,EAAgBA,EAAyB,QAAI,GAAK,UAClDA,EAAgBA,EAA2B,UAAI,GAAK,YACpDA,EAAgBA,EAAuB,MAAI,GAAK,OACnD,CALD,CAKGA,KAAoBA,GAAkB,CAAC,IAC1C,SAAWD,GACPA,EAAQ56C,MAAQ,IACLmK,GAAY0wC,GAE1B,CAJD,CAIGD,KAAYA,GAAU,CAAC,IAE1B,SAAWE,GACP,IAAI9vC,EACJ8vC,EAAU96C,MAAQ,KACA,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAZ1Q,EAAIuH,OACJ/F,EAAE1D,OAAO,GACT4xE,GAAQ56C,QAAQnyB,OAAO3C,EAAIuH,KAAM/F,IAErB,MAAZxB,EAAI8vE,OACJtuE,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI8vE,QAEa,IAAzBvlD,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIuH,KAAOmoE,GAAQ56C,QAAQrrB,OAAOsD,GAClC,MAEJ,KAAK,EACD/M,EAAI8vE,KAAO/iE,EAAOxQ,QAClB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX8vC,EAAUjtE,OAAU3C,GACT89B,GAAc99B,EAAK4vE,EAAU96C,SAExC86C,EAAUnmE,OAAS,CAACxM,EAAKstB,IACdsK,EAAc53B,EAAK2yE,EAAU96C,QAASvK,EAEpD,CAlDD,CAkDGqlD,KAAcA,GAAY,CAAC,IAE9B,SAAWC,GACP,IAAI/vC,EACJ+vC,EAAW/6C,MAAQ,KACD,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAZ1Q,EAAIuH,OACJ/F,EAAE1D,OAAO,GACT4xE,GAAQ56C,QAAQnyB,OAAO3C,EAAIuH,KAAM/F,IAErB,MAAZxB,EAAI8vE,OACJtuE,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI8vE,QAEa,IAAzBvlD,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIuH,KAAOmoE,GAAQ56C,QAAQrrB,OAAOsD,GAClC,MAEJ,KAAK,EACD/M,EAAI8vE,KAAO/iE,EAAOxQ,QAClB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEX+vC,EAAWltE,OAAU3C,GACV89B,GAAc99B,EAAK6vE,EAAW/6C,SAEzC+6C,EAAWpmE,OAAS,CAACxM,EAAKstB,IACfsK,EAAc53B,EAAK4yE,EAAW/6C,QAASvK,EAErD,CAlDD,CAkDGslD,KAAeA,GAAa,CAAC,IC7HzB,MAAME,WAAqB9jF,MAC9B,WAAA8Q,CAAY9C,EAAU,6CAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,cAChB,EAKG,MAAMwhF,WAA0B/jF,MACnC,WAAA8Q,CAAY9C,EAAU,+CAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,mBAChB,EAKG,MAAMyhF,WAA8BhkF,MACvC,WAAA8Q,CAAY9C,EAAU,0BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,ECrBJ,MCHA,GDGA,CACI,GAAA3B,CAAIqjF,EAAM7qD,YACN,MAAM8qD,EAAeD,EAAIr1C,OACzB,GAA4B,MAAxBs1C,GAAcr1C,OACd,MAAM,IAAIm1C,GAAsB,uRAMpC,OAAOE,CACX,GEVG,MAAMC,GACTx9E,KAAO,MACP+jE,IACAC,KACAyZ,WACA,WAAAtzE,CAAY45D,EAAKrzD,GACb7V,KAAKkpE,IAAMA,EACXlpE,KAAK4iF,WAAa/sE,CACtB,CACA,OAAIuzD,GAIA,OAHiB,MAAbppE,KAAKmpE,OACLnpE,KAAKmpE,KAAO,GAAgBnpE,KAAKkpE,MAE9BlpE,KAAKmpE,IAChB,CACA,WAAAM,GACI,OAAOzpE,KAAK4iF,UAChB,CACA,KAAAjZ,GACI,OAAO77B,GAAIO,SAAS,IAAKruC,KAAK4iF,WAClC,CACA,QAAAv8E,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAKypE,cAAc36D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,MAAA5pD,CAAOmqB,EAAMigC,GACT,OCPDz8B,eAA6BpuC,EAAK6qE,EAAKpyB,GAC1C,MAAM6xB,QAAkBwZ,GAAUzjF,MAAMiuC,OAAOw8B,UAAU,MAAO9qE,EAAK,CACjEgC,KAAM,oBACNqM,KAAM,CAAErM,KAAM,aACf,EAAO,CAAC,WACX,OAAO8hF,GAAUzjF,MAAMiuC,OAAO7tB,OAAO,CAAEze,KAAM,qBAAuBsoE,EAAWO,EAAKpyB,aAAevnC,WAAaunC,EAAMA,EAAIv1B,WAC9H,CDCe,CAAcjiB,KAAKkpE,IAAKU,EAAKjgC,EACxC,EAEG,MAAMm5C,GACT39E,KAAO,MACP+jE,IACAC,KACAE,UACA,WAAA/5D,CAAY45D,EAAKG,GACbrpE,KAAKkpE,IAAMA,EACXlpE,KAAKqpE,UAAYA,CACrB,CACA,OAAID,GAIA,OAHiB,MAAbppE,KAAKmpE,OACLnpE,KAAKmpE,KETV,SAAoBD,GACvB,GAAa,MAATA,EAAI11D,GAAsB,MAAT01D,EAAIjlD,GAAsB,MAATilD,EAAIzsD,GAAsB,MAATysD,EAAIxqC,GAAsB,MAATwqC,EAAI1mC,GAAuB,MAAV0mC,EAAI6Z,IAAwB,MAAV7Z,EAAI8Z,IAAwB,MAAV9Z,EAAI+Z,GAC7H,MAAM,IAAI,GAAuB,8BAErC,OAAOja,GAAe,CAClBF,GAAc74D,WAAWsO,KAAK,CAAC,KAC/BuqD,GAAc,GAAqBI,EAAI11D,EAAG,cAC1Cs1D,GAAc,GAAqBI,EAAIjlD,EAAG,cAC1C6kD,GAAc,GAAqBI,EAAIzsD,EAAG,cAC1CqsD,GAAc,GAAqBI,EAAIxqC,EAAG,cAC1CoqC,GAAc,GAAqBI,EAAI1mC,EAAG,cAC1CsmC,GAAc,GAAqBI,EAAI6Z,GAAI,cAC3Cja,GAAc,GAAqBI,EAAI8Z,GAAI,cAC3Cla,GAAc,GAAqBI,EAAI+Z,GAAI,gBAC5ChhE,UACP,CFNwB,CAAiBjiB,KAAKkpE,MAE/BlpE,KAAKmpE,IAChB,CACA,MAAA76B,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,IAAA9qD,CAAK9R,GACD,OCxCD2gC,eAA2BpuC,EAAKy4C,GACnC,MAAM4yB,QAAmByY,GAAUzjF,MAAMiuC,OAAOw8B,UAAU,MAAO9qE,EAAK,CAClEgC,KAAM,oBACNqM,KAAM,CAAErM,KAAM,aACf,EAAO,CAAC,SACL6oE,QAAYiZ,GAAUzjF,MAAMiuC,OAAO/uB,KAAK,CAAEvd,KAAM,qBAAuBqpE,EAAY5yB,aAAevnC,WAAaunC,EAAMA,EAAIv1B,YAC/H,OAAO,IAAIhS,WAAW25D,EAAK,EAAGA,EAAIp5D,WACtC,CDiCe,CAAYxQ,KAAKkpE,IAAK18D,EACjC,EErDG,MAGD02E,GAA2BjzE,WAAWsO,KAAK,CAC7C,GAAM,GAAM,EAAM,EAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,EAAM,EAAM,EAAM,EAAM,IAoEjF,SAAS4kE,GAAUja,GACtB,GAAa,MAATA,EAAI11D,GAAsB,MAAT01D,EAAIjlD,EACrB,MAAM,IAAI,GAAuB,8BASrC,OAP6B+kD,GAAe,CACxCka,GACAna,GAAgBC,GAAe,CAC3BF,GAAc,GAAqBI,EAAI11D,EAAG,cAC1Cs1D,GAAc,GAAqBI,EAAIjlD,EAAG,mBAGtBhC,UAChC,CA2BO,SAASmhE,GAA0B52E,EAASsC,EAAO+G,GACtD,MAAMqzD,EAvDH,SAA0B18D,GAC7B,MAAMtH,EAAO,GAAUsH,EAAQ,GAAI,CAC/BtJ,OAAQ,IAIZ,MAAO,CACHinE,IAAK,MACL32D,EAAG,GAAmBtO,EAAK,GAAI,aAC/B+e,EAAG,GAAmB/e,EAAK,GAAI,aAEvC,CA4CgBm+E,CAAiB72E,GAQ7B,OAPc,MAAVqJ,IAKAA,EAAS,GArHK,GAiHD,GAAO,GAAaX,OAAO,CACpC4E,KAAM,GAAWwpE,IACjBjB,KAAMvzE,OAIP,IAAI6zE,GAAkBzZ,EAAKrzD,EACtC,CC5HO,MAAM0tE,WAAansC,GACtB,WAAA9nC,CAAYlC,EAAMo2E,GACdpzC,QACApwC,KAAK22C,UAAW,EAChB32C,KAAK02C,WAAY,EACjBN,GAAMhpC,GACN,MAAMrO,EAAMk4C,GAAQusC,GAEpB,GADAxjF,KAAKyjF,MAAQr2E,EAAKxO,SACe,mBAAtBoB,KAAKyjF,MAAM3kF,OAClB,MAAM,IAAIN,MAAM,uDACpBwB,KAAKs2C,SAAWt2C,KAAKyjF,MAAMntC,SAC3Bt2C,KAAKq2C,UAAYr2C,KAAKyjF,MAAMptC,UAC5B,MAAMC,EAAWt2C,KAAKs2C,SAChB1M,EAAM,IAAI35B,WAAWqmC,GAE3B1M,EAAItqC,IAAIP,EAAI0C,OAAS60C,EAAWlpC,EAAKxO,SAASE,OAAOC,GAAK8W,SAAW9W,GACrE,IAAK,IAAIwC,EAAI,EAAGA,EAAIqoC,EAAInoC,OAAQF,IAC5BqoC,EAAIroC,IAAM,GACdvB,KAAKyjF,MAAM3kF,OAAO8qC,GAElB5pC,KAAK0jF,MAAQt2E,EAAKxO,SAElB,IAAK,IAAI2C,EAAI,EAAGA,EAAIqoC,EAAInoC,OAAQF,IAC5BqoC,EAAIroC,IAAM,IACdvB,KAAK0jF,MAAM5kF,OAAO8qC,GAClBA,EAAI2O,KAAK,EACb,CACA,MAAAz5C,CAAO0Q,GAGH,OAFA+mC,GAAQv2C,MACRA,KAAKyjF,MAAM3kF,OAAO0Q,GACXxP,IACX,CACA,UAAAq4C,CAAWxO,GACP0M,GAAQv2C,MACR,GAAO6pC,EAAK7pC,KAAKq2C,WACjBr2C,KAAK22C,UAAW,EAChB32C,KAAKyjF,MAAMprC,WAAWxO,GACtB7pC,KAAK0jF,MAAM5kF,OAAO+qC,GAClB7pC,KAAK0jF,MAAMrrC,WAAWxO,GACtB7pC,KAAKyL,SACT,CACA,MAAAoK,GACI,MAAMg0B,EAAM,IAAI55B,WAAWjQ,KAAK0jF,MAAMrtC,WAEtC,OADAr2C,KAAKq4C,WAAWxO,GACTA,CACX,CACA,UAAAwN,CAAW4B,GAEPA,IAAOA,EAAKt6C,OAAOC,OAAOD,OAAOw4B,eAAen3B,MAAO,CAAC,IACxD,MAAM,MAAE0jF,EAAK,MAAED,EAAK,SAAE9sC,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAcr2C,KAQnE,OANAi5C,EAAGtC,SAAWA,EACdsC,EAAGvC,UAAYA,EACfuC,EAAG3C,SAAWA,EACd2C,EAAG5C,UAAYA,EACf4C,EAAGyqC,MAAQA,EAAMrsC,WAAW4B,EAAGyqC,OAC/BzqC,EAAGwqC,MAAQA,EAAMpsC,WAAW4B,EAAGwqC,OACxBxqC,CACX,CACA,OAAAxtC,GACIzL,KAAK02C,WAAY,EACjB12C,KAAK0jF,MAAMj4E,UACXzL,KAAKyjF,MAAMh4E,SACf,EAYG,MAAMk4E,GAAO,CAACv2E,EAAMrO,EAAKyN,IAAY,IAAI+2E,GAAKn2E,EAAMrO,GAAKD,OAAO0N,GAASqJ,SCnChF,SAAS+tE,GAAmB9mD,QACN59B,IAAd49B,EAAK+mD,MACLtU,GAAM,OAAQzyC,EAAK+mD,WACF3kF,IAAjB49B,EAAKu9C,SACL9K,GAAM,UAAWzyC,EAAKu9C,QAC9B,CD+BAsJ,GAAK/kF,OAAS,CAACwO,EAAMrO,IAAQ,IAAIwkF,GAAKn2E,EAAMrO,GCHrC,MAAM+kF,WAAetlF,MACxB,WAAA8Q,CAAY8nB,EAAI,IACZgZ,MAAMhZ,EACV,EASG,MAAM2sD,GAAM,CAEfC,IAAKF,GAELG,KAAM,CACF/uE,OAAQ,CAAC29B,EAAKlJ,KACV,MAAQq6C,IAAKtqC,GAAMqqC,GACnB,GAAIlxC,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAI6G,EAAE,yBAChB,GAAkB,EAAd/P,EAAKloC,OACL,MAAM,IAAIi4C,EAAE,6BAChB,MAAMwqC,EAAUv6C,EAAKloC,OAAS,EACxBW,EAAMqtE,GAAoByU,GAChC,GAAK9hF,EAAIX,OAAS,EAAK,IACnB,MAAM,IAAIi4C,EAAE,wCAEhB,MAAMyqC,EAASD,EAAU,IAAMzU,GAAqBrtE,EAAIX,OAAS,EAAK,KAAO,GAE7E,OADUguE,GAAoB58B,GACnBsxC,EAAS/hF,EAAMunC,CAAI,EAGlC,MAAA3tB,CAAO62B,EAAKlJ,GACR,MAAQq6C,IAAKtqC,GAAMqqC,GACnB,IAAIj9E,EAAM,EACV,GAAI+rC,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAI6G,EAAE,yBAChB,GAAI/P,EAAKloC,OAAS,GAAKkoC,EAAK7iC,OAAW+rC,EACnC,MAAM,IAAI6G,EAAE,yBAChB,MAAM7lB,EAAQ8V,EAAK7iC,KAEnB,IAAIrF,EAAS,EACb,GAF0B,IAARoyB,EAIb,CAED,MAAMswD,EAAiB,IAARtwD,EACf,IAAKswD,EACD,MAAM,IAAIzqC,EAAE,qDAChB,GAAIyqC,EAAS,EACT,MAAM,IAAIzqC,EAAE,4CAChB,MAAM0qC,EAAcz6C,EAAK1nB,SAASnb,EAAKA,EAAMq9E,GAC7C,GAAIC,EAAY3iF,SAAW0iF,EACvB,MAAM,IAAIzqC,EAAE,yCAChB,GAAuB,IAAnB0qC,EAAY,GACZ,MAAM,IAAI1qC,EAAE,wCAChB,IAAK,MAAM94B,KAAKwjE,EACZ3iF,EAAUA,GAAU,EAAKmf,EAE7B,GADA9Z,GAAOq9E,EACH1iF,EAAS,IACT,MAAM,IAAIi4C,EAAE,yCACpB,MAlBIj4C,EAASoyB,EAmBb,MAAMx0B,EAAIsqC,EAAK1nB,SAASnb,EAAKA,EAAMrF,GACnC,GAAIpC,EAAEoC,SAAWA,EACb,MAAM,IAAIi4C,EAAE,kCAChB,MAAO,CAAEr6C,IAAGmC,EAAGmoC,EAAK1nB,SAASnb,EAAMrF,GACvC,GAMJ4iF,KAAM,CACF,MAAAnvE,CAAOs3B,GACH,MAAQw3C,IAAKtqC,GAAMqqC,GACnB,GAAIv3C,EAAM,GACN,MAAM,IAAIkN,EAAE,8CAChB,IAAIhkC,EAAM+5D,GAAoBjjC,GAI9B,GAFkC,EAA9BjiC,OAAOiU,SAAS9I,EAAI,GAAI,MACxBA,EAAM,KAAOA,GACA,EAAbA,EAAIjU,OACJ,MAAM,IAAIi4C,EAAE,kDAChB,OAAOhkC,CACX,EACA,MAAAsG,CAAO2tB,GACH,MAAQq6C,IAAKtqC,GAAMqqC,GACnB,GAAc,IAAVp6C,EAAK,GACL,MAAM,IAAI+P,EAAE,uCAChB,GAAgB,IAAZ/P,EAAK,MAA2B,IAAVA,EAAK,IAC3B,MAAM,IAAI+P,EAAE,uDAChB,OAAO,GAAgB/P,EAC3B,GAEJ,KAAA26C,CAAM5uE,GAEF,MAAQsuE,IAAKtqC,EAAG2qC,KAAMz3C,EAAKq3C,KAAMM,GAAQR,GACnCp6C,EAAO,GAAY,YAAaj0B,IAC9BrW,EAAGmlF,EAAUhjF,EAAGijF,GAAiBF,EAAIvoE,OAAO,GAAM2tB,GAC1D,GAAI86C,EAAahjF,OACb,MAAM,IAAIi4C,EAAE,+CAChB,MAAQr6C,EAAGqlF,EAAQljF,EAAGmjF,GAAeJ,EAAIvoE,OAAO,EAAMwoE,IAC9CnlF,EAAGulF,EAAQpjF,EAAGqjF,GAAeN,EAAIvoE,OAAO,EAAM2oE,GACtD,GAAIE,EAAWpjF,OACX,MAAM,IAAIi4C,EAAE,+CAChB,MAAO,CAAElf,EAAGoS,EAAI5wB,OAAO0oE,GAAS3hF,EAAG6pC,EAAI5wB,OAAO4oE,GAClD,EACA,UAAAE,CAAWlb,GACP,MAAQqa,KAAMM,EAAKF,KAAMz3C,GAAQm3C,GAG3BgB,EAFKR,EAAIrvE,OAAO,EAAM03B,EAAI13B,OAAO00D,EAAIpvC,IAChC+pD,EAAIrvE,OAAO,EAAM03B,EAAI13B,OAAO00D,EAAI7mE,IAE3C,OAAOwhF,EAAIrvE,OAAO,GAAM6vE,EAC5B,GAIE,GAAM9+C,OAAO,GAAI,GAAMA,OAAO,GAAqB,IAAXA,OAAO,GAAUA,OAAO,IA+c/D,SAAS++C,GAAYhL,GACxB,MAAMC,EArBV,SAAsBjP,GAClB,MAAMluC,EAAOu7C,GAAcrN,GAU3B,OATA6F,GAAe/zC,EAAM,CACjB1vB,KAAM,OACNu2E,KAAM,WACN/rC,YAAa,YACd,CACCqtC,SAAU,WACVC,cAAe,WACfrB,KAAM,YAEHllF,OAAOmd,OAAO,CAAE+nE,MAAM,KAAS/mD,GAC1C,CASkB,CAAak9C,IACrB,GAAErJ,EAAIn9D,GAAmBymE,EACzBkL,EAAgBxU,EAAG6B,MAAQ,EAC3B4S,EAAkB,EAAIzU,EAAG6B,MAAQ,EACvC,SAAS+L,EAAK59D,GACV,OAAO,GAAIA,EAAG68D,EAClB,CACA,SAAS6H,EAAK1kE,GACV,OAAOmxD,GAAOnxD,EAAG68D,EACrB,CACA,MAAQ8H,gBAAiBxK,EAAK,uBAAEyK,EAAsB,oBAAEC,EAAmB,mBAAEC,GAzd1E,SAA2B3oD,GAC9B,MAAMm9C,EAnJV,SAA2BjP,GACvB,MAAMluC,EAAOu7C,GAAcrN,GAC3B6F,GAAe/zC,EAAM,CACjBnc,EAAG,QACHC,EAAG,SACJ,CACC8kE,yBAA0B,QAC1BC,eAAgB,UAChB/H,cAAe,WACfC,cAAe,WACf+H,mBAAoB,UACpB1Q,UAAW,WACXj+B,QAAS,aAEb,MAAM,KAAE4uC,EAAI,GAAElV,EAAE,EAAEhwD,GAAMmc,EACxB,GAAI+oD,EAAM,CACN,IAAKlV,EAAGqC,IAAIryD,EAAGgwD,EAAGgC,MACd,MAAM,IAAIn0E,MAAM,8EAEpB,GAAoB,iBAATqnF,GACc,iBAAdA,EAAKC,MACgB,mBAArBD,EAAKE,YACZ,MAAM,IAAIvnF,MAAM,wEAExB,CACA,OAAOG,OAAOmd,OAAO,IAAKghB,GAC9B,CAyHkBkpD,CAAkBlpD,IAC1B,GAAE6zC,GAAOsJ,EACTQ,EAAK,GAAMR,EAAMzmE,EAAGymE,EAAM/H,YAC1Bj7B,EAAUgjC,EAAMhjC,SAClB,EAAEgvC,EAAItH,EAAOuH,KACT,MAAMvlE,EAAIg+D,EAAMzC,WAChB,OAAO,GAAYjsE,WAAWsO,KAAK,CAAC,IAAQoyD,EAAG15B,QAAQt2B,EAAExL,GAAIw7D,EAAG15B,QAAQt2B,EAAE6oD,GAC7E,GACC0L,EAAY+E,EAAM/E,WACpB,CAAEpmE,IAEE,MAAM4S,EAAO5S,EAAMmT,SAAS,GAI5B,MAAO,CAAE9M,EAFCw7D,EAAGuE,UAAUxzD,EAAKO,SAAS,EAAG0uD,EAAG6B,QAE/BhJ,EADFmH,EAAGuE,UAAUxzD,EAAKO,SAAS0uD,EAAG6B,MAAO,EAAI7B,EAAG6B,QAEzD,GAKL,SAASgT,EAAoBrwE,GACzB,MAAM,EAAEwL,EAAC,EAAEC,GAAMq5D,EACXkM,EAAKxV,EAAGwC,IAAIh+D,GACZixE,EAAKzV,EAAG0C,IAAI8S,EAAIhxE,GACtB,OAAOw7D,EAAG3zD,IAAI2zD,EAAG3zD,IAAIopE,EAAIzV,EAAG0C,IAAIl+D,EAAGwL,IAAKC,EAC5C,CAKA,IAAK+vD,EAAGqC,IAAIrC,EAAGwC,IAAI8G,EAAM1B,IAAKiN,EAAoBvL,EAAM3B,KACpD,MAAM,IAAI95E,MAAM,+CAOpB,SAAS+mF,EAAuBxmF,GAC5B,MAAQ2mF,yBAA0BvvC,EAAO,YAAEi8B,EAAW,eAAEuT,EAAgBnyE,EAAG6yE,GAAMpM,EACjF,GAAI9jC,GAA0B,iBAARp3C,EAAkB,CAIpC,GAHI,GAAQA,KACRA,EAAM,GAAWA,IAEF,iBAARA,IAAqBo3C,EAAQnrB,SAASjsB,EAAI0C,QACjD,MAAM,IAAIjD,MAAM,uBACpBO,EAAMA,EAAIkxD,SAAuB,EAAdmiB,EAAiB,IACxC,CACA,IAAI5lC,EACJ,IACIA,EACmB,iBAARztC,EACDA,EACA,GAAgB,GAAY,cAAeA,EAAKqzE,GAC9D,CACA,MAAO5qD,GACH,MAAM,IAAIhpB,MAAM,wCAA0C4zE,EAAc,sBAAwBrzE,EACpG,CAIA,OAHI4mF,IACAn5C,EAAM,GAAIA,EAAK65C,IACnB,GAAS,cAAe75C,EAAK,GAAK65C,GAC3B75C,CACX,CACA,SAAS85C,EAAU/3C,GACf,KAAMA,aAAiBusC,GACnB,MAAM,IAAIt8E,MAAM,2BACxB,CAKA,MAAMu8E,EAAe5J,IAAS,CAACzyC,EAAGs8C,KAC9B,MAAQuL,GAAIpxE,EAAGqxE,GAAIhd,EAAGid,GAAIrL,GAAM18C,EAEhC,GAAIiyC,EAAGqC,IAAIoI,EAAGzK,EAAGiC,KACb,MAAO,CAAEz9D,IAAGq0D,KAChB,MAAMqJ,EAAMn0C,EAAEm0C,MAGJ,MAANmI,IACAA,EAAKnI,EAAMlC,EAAGiC,IAAMjC,EAAGiD,IAAIwH,IAC/B,MAAMC,EAAK1K,EAAG0C,IAAIl+D,EAAG6lE,GACfM,EAAK3K,EAAG0C,IAAI7J,EAAGwR,GACfO,EAAK5K,EAAG0C,IAAI+H,EAAGJ,GACrB,GAAInI,EACA,MAAO,CAAE19D,EAAGw7D,EAAGgC,KAAMnJ,EAAGmH,EAAGgC,MAC/B,IAAKhC,EAAGqC,IAAIuI,EAAI5K,EAAGiC,KACf,MAAM,IAAIp0E,MAAM,oBACpB,MAAO,CAAE2W,EAAGkmE,EAAI7R,EAAG8R,EAAI,IAIrBE,EAAkBrK,IAAUzyC,IAC9B,GAAIA,EAAEm0C,MAAO,CAIT,GAAIoH,EAAM2L,qBAAuBjV,EAAGkC,IAAIn0C,EAAE8nD,IACtC,OACJ,MAAM,IAAIhoF,MAAM,kBACpB,CAEA,MAAM,EAAE2W,EAAC,EAAEq0D,GAAM9qC,EAAEw9C,WAEnB,IAAKvL,EAAGC,QAAQz7D,KAAOw7D,EAAGC,QAAQpH,GAC9B,MAAM,IAAIhrE,MAAM,4BACpB,MAAM6qC,EAAOsnC,EAAGwC,IAAI3J,GACdp0D,EAAQowE,EAAoBrwE,GAClC,IAAKw7D,EAAGqC,IAAI3pC,EAAMj0B,GACd,MAAM,IAAI5W,MAAM,qCACpB,IAAKkgC,EAAEk/C,gBACH,MAAM,IAAIp/E,MAAM,0CACpB,OAAO,CAAI,IAOf,MAAMs8E,EACF,WAAAxrE,CAAYi3E,EAAIC,EAAIC,GAChB,GAAU,MAANF,IAAe5V,EAAGC,QAAQ2V,GAC1B,MAAM,IAAI/nF,MAAM,cACpB,GAAU,MAANgoF,IAAe7V,EAAGC,QAAQ4V,GAC1B,MAAM,IAAIhoF,MAAM,cACpB,GAAU,MAANioF,IAAe9V,EAAGC,QAAQ6V,GAC1B,MAAM,IAAIjoF,MAAM,cACpBwB,KAAKumF,GAAKA,EACVvmF,KAAKwmF,GAAKA,EACVxmF,KAAKymF,GAAKA,EACV9nF,OAAOmd,OAAO9b,KAClB,CAGA,iBAAOm8E,CAAWz9C,GACd,MAAM,EAAEvpB,EAAC,EAAEq0D,GAAM9qC,GAAK,CAAC,EACvB,IAAKA,IAAMiyC,EAAGC,QAAQz7D,KAAOw7D,EAAGC,QAAQpH,GACpC,MAAM,IAAIhrE,MAAM,wBACpB,GAAIkgC,aAAao8C,EACb,MAAM,IAAIt8E,MAAM,gCACpB,MAAMq0E,EAAOtxE,GAAMovE,EAAGqC,IAAIzxE,EAAGovE,EAAGgC,MAEhC,OAAIE,EAAI19D,IAAM09D,EAAIrJ,GACPsR,EAAMnI,KACV,IAAImI,EAAM3lE,EAAGq0D,EAAGmH,EAAGiC,IAC9B,CACA,KAAIz9D,GACA,OAAOnV,KAAKk8E,WAAW/mE,CAC3B,CACA,KAAIq0D,GACA,OAAOxpE,KAAKk8E,WAAW1S,CAC3B,CAOA,iBAAO4S,CAAWjF,GACd,MAAMkF,EAAQ1L,EAAGgE,YAAYwC,EAAO7yE,KAAKo6B,GAAMA,EAAE+nD,MACjD,OAAOtP,EAAO7yE,KAAI,CAACo6B,EAAGn9B,IAAMm9B,EAAEw9C,SAASG,EAAM96E,MAAK+C,IAAIw2E,EAAMqB,WAChE,CAKA,cAAOhlC,CAAQzhC,GACX,MAAMo+D,EAAIgH,EAAMqB,WAAWjH,EAAU,GAAY,WAAYx/D,KAE7D,OADAo+D,EAAE2I,iBACK3I,CACX,CAEA,qBAAOqK,CAAe/T,GAClB,OAAO0Q,EAAMnzC,KAAK41C,SAASgI,EAAuBnb,GACtD,CAEA,UAAOkS,CAAInF,EAAQW,GACf,OAAO,GAAUgD,EAAOL,EAAItD,EAAQW,EACxC,CAEA,cAAAyE,CAAevG,GACXwG,EAAK5E,cAAc53E,KAAMg2E,EAC7B,CAEA,cAAAyG,GACIjB,EAAgBx7E,KACpB,CACA,QAAA0mF,GACI,MAAM,EAAEld,GAAMxpE,KAAKk8E,WACnB,GAAIvL,EAAGmC,MACH,OAAQnC,EAAGmC,MAAMtJ,GACrB,MAAM,IAAIhrE,MAAM,8BACpB,CAIA,MAAA8vC,CAAOC,GACH+3C,EAAU/3C,GACV,MAAQg4C,GAAI7J,EAAI8J,GAAI7J,EAAI8J,GAAI7J,GAAO58E,MAC3BumF,GAAI1K,EAAI2K,GAAI1K,EAAI2K,GAAI1K,GAAOxtC,EAC7Bo4C,EAAKhW,EAAGqC,IAAIrC,EAAG0C,IAAIqJ,EAAIX,GAAKpL,EAAG0C,IAAIwI,EAAIe,IACvCgK,EAAKjW,EAAGqC,IAAIrC,EAAG0C,IAAIsJ,EAAIZ,GAAKpL,EAAG0C,IAAIyI,EAAIc,IAC7C,OAAO+J,GAAMC,CACjB,CAIA,MAAAnR,GACI,OAAO,IAAIqF,EAAM96E,KAAKumF,GAAI5V,EAAGoC,IAAI/yE,KAAKwmF,IAAKxmF,KAAKymF,GACpD,CAKA,MAAA3jE,GACI,MAAM,EAAEnC,EAAC,EAAEC,GAAMq5D,EACXrjE,EAAK+5D,EAAG0C,IAAIzyD,EAAG,KACb2lE,GAAI7J,EAAI8J,GAAI7J,EAAI8J,GAAI7J,GAAO58E,KACnC,IAAIk9E,EAAKvM,EAAGgC,KAAMwK,EAAKxM,EAAGgC,KAAM0K,EAAK1M,EAAGgC,KACpCkU,EAAKlW,EAAG0C,IAAIqJ,EAAIA,GAChBoK,EAAKnW,EAAG0C,IAAIsJ,EAAIA,GAChBpI,EAAK5D,EAAG0C,IAAIuJ,EAAIA,GAChBmK,EAAKpW,EAAG0C,IAAIqJ,EAAIC,GA4BpB,OA3BAoK,EAAKpW,EAAG3zD,IAAI+pE,EAAIA,GAChB1J,EAAK1M,EAAG0C,IAAIqJ,EAAIE,GAChBS,EAAK1M,EAAG3zD,IAAIqgE,EAAIA,GAChBH,EAAKvM,EAAG0C,IAAI1yD,EAAG08D,GACfF,EAAKxM,EAAG0C,IAAIz8D,EAAI29D,GAChB4I,EAAKxM,EAAG3zD,IAAIkgE,EAAIC,GAChBD,EAAKvM,EAAGyC,IAAI0T,EAAI3J,GAChBA,EAAKxM,EAAG3zD,IAAI8pE,EAAI3J,GAChBA,EAAKxM,EAAG0C,IAAI6J,EAAIC,GAChBD,EAAKvM,EAAG0C,IAAI0T,EAAI7J,GAChBG,EAAK1M,EAAG0C,IAAIz8D,EAAIymE,GAChB9I,EAAK5D,EAAG0C,IAAI1yD,EAAG4zD,GACfwS,EAAKpW,EAAGyC,IAAIyT,EAAItS,GAChBwS,EAAKpW,EAAG0C,IAAI1yD,EAAGomE,GACfA,EAAKpW,EAAG3zD,IAAI+pE,EAAI1J,GAChBA,EAAK1M,EAAG3zD,IAAI6pE,EAAIA,GAChBA,EAAKlW,EAAG3zD,IAAIqgE,EAAIwJ,GAChBA,EAAKlW,EAAG3zD,IAAI6pE,EAAItS,GAChBsS,EAAKlW,EAAG0C,IAAIwT,EAAIE,GAChB5J,EAAKxM,EAAG3zD,IAAImgE,EAAI0J,GAChBtS,EAAK5D,EAAG0C,IAAIsJ,EAAIC,GAChBrI,EAAK5D,EAAG3zD,IAAIu3D,EAAIA,GAChBsS,EAAKlW,EAAG0C,IAAIkB,EAAIwS,GAChB7J,EAAKvM,EAAGyC,IAAI8J,EAAI2J,GAChBxJ,EAAK1M,EAAG0C,IAAIkB,EAAIuS,GAChBzJ,EAAK1M,EAAG3zD,IAAIqgE,EAAIA,GAChBA,EAAK1M,EAAG3zD,IAAIqgE,EAAIA,GACT,IAAIvC,EAAMoC,EAAIC,EAAIE,EAC7B,CAKA,GAAArgE,CAAIuxB,GACA+3C,EAAU/3C,GACV,MAAQg4C,GAAI7J,EAAI8J,GAAI7J,EAAI8J,GAAI7J,GAAO58E,MAC3BumF,GAAI1K,EAAI2K,GAAI1K,EAAI2K,GAAI1K,GAAOxtC,EACnC,IAAI2uC,EAAKvM,EAAGgC,KAAMwK,EAAKxM,EAAGgC,KAAM0K,EAAK1M,EAAGgC,KACxC,MAAMhyD,EAAIs5D,EAAMt5D,EACV/J,EAAK+5D,EAAG0C,IAAI4G,EAAMr5D,EAAG,IAC3B,IAAIimE,EAAKlW,EAAG0C,IAAIqJ,EAAIb,GAChBiL,EAAKnW,EAAG0C,IAAIsJ,EAAIb,GAChBvH,EAAK5D,EAAG0C,IAAIuJ,EAAIb,GAChBgL,EAAKpW,EAAG3zD,IAAI0/D,EAAIC,GAChBqK,EAAKrW,EAAG3zD,IAAI6+D,EAAIC,GACpBiL,EAAKpW,EAAG0C,IAAI0T,EAAIC,GAChBA,EAAKrW,EAAG3zD,IAAI6pE,EAAIC,GAChBC,EAAKpW,EAAGyC,IAAI2T,EAAIC,GAChBA,EAAKrW,EAAG3zD,IAAI0/D,EAAIE,GAChB,IAAIqK,EAAKtW,EAAG3zD,IAAI6+D,EAAIE,GA+BpB,OA9BAiL,EAAKrW,EAAG0C,IAAI2T,EAAIC,GAChBA,EAAKtW,EAAG3zD,IAAI6pE,EAAItS,GAChByS,EAAKrW,EAAGyC,IAAI4T,EAAIC,GAChBA,EAAKtW,EAAG3zD,IAAI2/D,EAAIC,GAChBM,EAAKvM,EAAG3zD,IAAI8+D,EAAIC,GAChBkL,EAAKtW,EAAG0C,IAAI4T,EAAI/J,GAChBA,EAAKvM,EAAG3zD,IAAI8pE,EAAIvS,GAChB0S,EAAKtW,EAAGyC,IAAI6T,EAAI/J,GAChBG,EAAK1M,EAAG0C,IAAI1yD,EAAGqmE,GACf9J,EAAKvM,EAAG0C,IAAIz8D,EAAI29D,GAChB8I,EAAK1M,EAAG3zD,IAAIkgE,EAAIG,GAChBH,EAAKvM,EAAGyC,IAAI0T,EAAIzJ,GAChBA,EAAK1M,EAAG3zD,IAAI8pE,EAAIzJ,GAChBF,EAAKxM,EAAG0C,IAAI6J,EAAIG,GAChByJ,EAAKnW,EAAG3zD,IAAI6pE,EAAIA,GAChBC,EAAKnW,EAAG3zD,IAAI8pE,EAAID,GAChBtS,EAAK5D,EAAG0C,IAAI1yD,EAAG4zD,GACfyS,EAAKrW,EAAG0C,IAAIz8D,EAAIowE,GAChBF,EAAKnW,EAAG3zD,IAAI8pE,EAAIvS,GAChBA,EAAK5D,EAAGyC,IAAIyT,EAAItS,GAChBA,EAAK5D,EAAG0C,IAAI1yD,EAAG4zD,GACfyS,EAAKrW,EAAG3zD,IAAIgqE,EAAIzS,GAChBsS,EAAKlW,EAAG0C,IAAIyT,EAAIE,GAChB7J,EAAKxM,EAAG3zD,IAAImgE,EAAI0J,GAChBA,EAAKlW,EAAG0C,IAAI4T,EAAID,GAChB9J,EAAKvM,EAAG0C,IAAI0T,EAAI7J,GAChBA,EAAKvM,EAAGyC,IAAI8J,EAAI2J,GAChBA,EAAKlW,EAAG0C,IAAI0T,EAAID,GAChBzJ,EAAK1M,EAAG0C,IAAI4T,EAAI5J,GAChBA,EAAK1M,EAAG3zD,IAAIqgE,EAAIwJ,GACT,IAAI/L,EAAMoC,EAAIC,EAAIE,EAC7B,CACA,QAAAC,CAAS/uC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMknC,SAC1B,CACA,GAAA5C,GACI,OAAO7yE,KAAKsuC,OAAOwsC,EAAMnI,KAC7B,CACA,IAAAmE,CAAKtjE,GACD,OAAOgpE,EAAK9E,WAAW13E,KAAMwT,EAAGsnE,EAAMsB,WAC1C,CAMA,cAAAqB,CAAeyJ,GACX,MAAM,KAAErB,EAAMryE,EAAG6yE,GAAMpM,EACvB,GAAS,SAAUiN,EAAI,GAAKb,GAC5B,MAAM3I,EAAI5C,EAAMnI,KAChB,GAAIuU,IAAO,GACP,OAAOxJ,EACX,GAAI19E,KAAK6yE,OAASqU,IAAO,GACrB,OAAOlnF,KAEX,IAAK6lF,GAAQrJ,EAAKzF,eAAe/2E,MAC7B,OAAOw8E,EAAK7E,iBAAiB33E,KAAMknF,EAAIpM,EAAMsB,YAEjD,IAAI,MAAE+K,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,EAAKE,YAAYmB,GAC5CK,EAAM7J,EACN8J,EAAM9J,EACNjhE,EAAIzc,KACR,KAAOonF,EAAK,IAAOE,EAAK,IAChBF,EAAK,KACLG,EAAMA,EAAIvqE,IAAIP,IACd6qE,EAAK,KACLE,EAAMA,EAAIxqE,IAAIP,IAClBA,EAAIA,EAAEqG,SACNskE,IAAO,GACPE,IAAO,GAOX,OALIH,IACAI,EAAMA,EAAI9R,UACV4R,IACAG,EAAMA,EAAI/R,UACd+R,EAAM,IAAI1M,EAAMnK,EAAG0C,IAAImU,EAAIjB,GAAIV,EAAKC,MAAO0B,EAAIhB,GAAIgB,EAAIf,IAChDc,EAAIvqE,IAAIwqE,EACnB,CAUA,QAAAjK,CAASrF,GACL,MAAM,KAAE2N,EAAMryE,EAAG6yE,GAAMpM,EAEvB,IAAI0E,EAAO8I,EACX,GAFA,GAAS,SAAUvP,EAAQ,GAAKmO,GAE5BR,EAAM,CACN,MAAM,MAAEsB,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,EAAKE,YAAY7N,GAClD,IAAMx5C,EAAG6oD,EAAKtyE,EAAGyyE,GAAQ1nF,KAAK82E,KAAKsQ,IAC7B1oD,EAAG8oD,EAAKvyE,GAAWjV,KAAK82E,KAAKwQ,GACnCC,EAAM/K,EAAKjH,gBAAgB4R,EAAOI,GAClCC,EAAMhL,EAAKjH,gBAAgB8R,EAAOG,GAClCA,EAAM,IAAI1M,EAAMnK,EAAG0C,IAAImU,EAAIjB,GAAIV,EAAKC,MAAO0B,EAAIhB,GAAIgB,EAAIf,IACvD9H,EAAQ4I,EAAIvqE,IAAIwqE,GAChBC,EAAOC,EAAI1qE,IAAI2qE,EACnB,KACK,CACD,MAAM,EAAEjpD,EAAC,EAAEzpB,GAAMjV,KAAK82E,KAAKoB,GAC3ByG,EAAQjgD,EACR+oD,EAAOxyE,CACX,CAEA,OAAO6lE,EAAMsB,WAAW,CAACuC,EAAO8I,IAAO,EAC3C,CAOA,oBAAAG,CAAqB1T,EAAGvzD,EAAGC,GACvB,MAAMg5B,EAAIkhC,EAAMnzC,KACV0rC,EAAM,CAACS,EAAGnzD,IACVA,IAAM,IAAOA,IAAM,IAAQmzD,EAAExlC,OAAOsL,GAA2Bk6B,EAAEyJ,SAAS58D,GAAjCmzD,EAAE2J,eAAe98D,GAC1DuvD,EAAMmD,EAAIrzE,KAAM2gB,GAAG3D,IAAIq2D,EAAIa,EAAGtzD,IACpC,OAAOsvD,EAAI2C,WAAQ3zE,EAAYgxE,CACnC,CAIA,QAAAgM,CAASlB,GACL,OAAOD,EAAa/6E,KAAMg7E,EAC9B,CACA,aAAA4C,GACI,MAAQ9nE,EAAGykE,EAAQ,cAAEqD,GAAkB3D,EACvC,GAAIM,IAAa,GACb,OAAO,EACX,GAAIqD,EACA,OAAOA,EAAc9C,EAAO96E,MAChC,MAAM,IAAIxB,MAAM,+DACpB,CACA,aAAAq/E,GACI,MAAQ/nE,EAAGykE,EAAQ,cAAEsD,GAAkB5D,EACvC,OAAIM,IAAa,GACNv6E,KACP69E,EACOA,EAAc/C,EAAO96E,MACzBA,KAAKy9E,eAAexD,EAAMnkE,EACrC,CACA,UAAAwoE,CAAWuJ,GAAe,GAGtB,OAFAtY,GAAM,eAAgBsY,GACtB7nF,KAAKy8E,iBACExlC,EAAQ6jC,EAAO96E,KAAM6nF,EAChC,CACA,KAAA3wC,CAAM2wC,GAAe,GAEjB,OADAtY,GAAM,eAAgBsY,GACf,GAAW7nF,KAAKs+E,WAAWuJ,GACtC,EAEJ/M,EAAMnzC,KAAO,IAAImzC,EAAMb,EAAM3B,GAAI2B,EAAM1B,GAAI5H,EAAGiC,KAC9CkI,EAAMnI,KAAO,IAAImI,EAAMnK,EAAGgC,KAAMhC,EAAGiC,IAAKjC,EAAGgC,MAC3C,MAAMmV,EAAQ7N,EAAM/H,WACdsK,EAAO1F,GAAKgE,EAAOb,EAAM4L,KAAO58E,KAAK01B,KAAKmpD,EAAQ,GAAKA,GAE7D,MAAO,CACH7N,QACAqL,gBAAiBxK,EACjByK,yBACAC,sBACAC,mBApZJ,SAA4Bj5C,GACxB,OAAO,GAAQA,EAAK,GAAKytC,EAAMzmE,EACnC,EAoZJ,CAgCyGu0E,CAAkB,IAChH9N,EACH,OAAAhjC,CAAQgvC,EAAItH,EAAOkJ,GACf,MAAMlnE,EAAIg+D,EAAMzC,WACV/mE,EAAIw7D,EAAG15B,QAAQt2B,EAAExL,GACjB6yE,EAAM,GAEZ,OADAzY,GAAM,eAAgBsY,GAClBA,EACOG,EAAI/3E,WAAWsO,KAAK,CAACogE,EAAM+H,WAAa,EAAO,IAAQvxE,GAGvD6yE,EAAI/3E,WAAWsO,KAAK,CAAC,IAAQpJ,EAAGw7D,EAAG15B,QAAQt2B,EAAE6oD,GAE5D,EACA,SAAA0L,CAAUpmE,GACN,MAAM1M,EAAM0M,EAAMrN,OACZggB,EAAO3S,EAAM,GACb4S,EAAO5S,EAAMmT,SAAS,GAE5B,GAAI7f,IAAQ+iF,GAA2B,IAAT1jE,GAA0B,IAATA,EAoB1C,IAAIrf,IAAQgjF,GAA4B,IAAT3jE,EAGhC,MAAO,CAAEtM,EAFCw7D,EAAGuE,UAAUxzD,EAAKO,SAAS,EAAG0uD,EAAG6B,QAE/BhJ,EADFmH,EAAGuE,UAAUxzD,EAAKO,SAAS0uD,EAAG6B,MAAO,EAAI7B,EAAG6B,SAMtD,MAAM,IAAIh0E,MAAM,qCAFL2mF,EAEiD,qBADjDC,EAC6E,SAAWhjF,EACvG,CA7B+D,CAC3D,MAAM+S,EAAI,GAAgBuM,GAC1B,IAAK,GAAQvM,EAAG,GAAKw7D,EAAG0B,OACpB,MAAM,IAAI7zE,MAAM,yBACpB,MAAMw/E,EAAKwH,EAAoBrwE,GAC/B,IAAIq0D,EACJ,IACIA,EAAImH,EAAGkD,KAAKmK,EAChB,CACA,MAAOiK,GACH,MAAMC,EAASD,aAAqBzpF,MAAQ,KAAOypF,EAAUz7E,QAAU,GACvE,MAAM,IAAIhO,MAAM,wBAA0B0pF,EAC9C,CAMA,QAHiC,GAAdzmE,MAFH+nD,EAAI,MAAS,MAIzBA,EAAImH,EAAGoC,IAAIvJ,IACR,CAAEr0D,IAAGq0D,IAChB,CAWJ,IAEE2e,EAAiB37C,GAAQ,GAAW,GAAgBA,EAAKytC,EAAM7H,cACrE,SAASgW,EAAsBxf,GAE3B,OAAOA,EADM4U,GAAe,EAEhC,CAKA,MAAM6K,EAAS,CAACznE,EAAGrC,EAAM06B,IAAO,GAAgBr4B,EAAE1f,MAAMqd,EAAM06B,IAI9D,MAAMqvC,EACF,WAAAh5E,CAAYkrB,EAAGz3B,EAAGwlF,GACd,GAAS,IAAK/tD,EAAG,GAAKgjD,GACtB,GAAS,IAAKz6E,EAAG,GAAKy6E,GACtBx9E,KAAKw6B,EAAIA,EACTx6B,KAAK+C,EAAIA,EACO,MAAZwlF,IACAvoF,KAAKuoF,SAAWA,GACpB5pF,OAAOmd,OAAO9b,KAClB,CAEA,kBAAOwoF,CAAY9yE,GACf,MAAMlU,EAAIy4E,EAAM7H,YAEhB,OADA18D,EAAM,GAAY,mBAAoBA,EAAS,EAAJlU,GACpC,IAAI8mF,EAAUD,EAAO3yE,EAAK,EAAGlU,GAAI6mF,EAAO3yE,EAAKlU,EAAG,EAAIA,GAC/D,CAGA,cAAOinF,CAAQ/yE,GACX,MAAM,EAAE8kB,EAAC,EAAEz3B,GAAMghF,GAAIO,MAAM,GAAY,MAAO5uE,IAC9C,OAAO,IAAI4yE,EAAU9tD,EAAGz3B,EAC5B,CAKA,cAAA05E,GAAmB,CACnB,cAAAiM,CAAeH,GACX,OAAO,IAAID,EAAUtoF,KAAKw6B,EAAGx6B,KAAK+C,EAAGwlF,EACzC,CACA,gBAAAI,CAAiBC,GACb,MAAM,EAAEpuD,EAAC,EAAK+tD,SAAUM,GAAQ7oF,KAC1B8V,EAAIovE,EAAc,GAAY,UAAW0D,IAC/C,GAAW,MAAPC,IAAgB,CAAC,EAAG,EAAG,EAAG,GAAG79D,SAAS69D,GACtC,MAAM,IAAIrqF,MAAM,uBACpB,MAAMsqF,EAAe,IAARD,GAAqB,IAARA,EAAYruD,EAAIy/C,EAAMzmE,EAAIgnB,EACpD,GAAIsuD,GAAQnY,EAAG0B,MACX,MAAM,IAAI7zE,MAAM,8BACpB,MAAMkB,EAAgB,EAANmpF,EAAwB,KAAP,KAC3B5J,EAAInE,EAAM3jC,QAAQz3C,EAASyoF,EAAcW,IACzCC,EAAK1D,EAAKyD,GACVE,EAAKzK,GAAMzoE,EAAIizE,GACfE,EAAK1K,EAAKx7E,EAAIgmF,GACd7U,EAAI4G,EAAMnzC,KAAKigD,qBAAqB3I,EAAG+J,EAAIC,GACjD,IAAK/U,EACD,MAAM,IAAI11E,MAAM,qBAEpB,OADA01E,EAAEuI,iBACKvI,CACX,CAEA,QAAAgV,GACI,OAAOd,EAAsBpoF,KAAK+C,EACtC,CACA,UAAAomF,GACI,OAAOnpF,KAAKkpF,WAAa,IAAIZ,EAAUtoF,KAAKw6B,EAAG+jD,GAAMv+E,KAAK+C,GAAI/C,KAAKuoF,UAAYvoF,IACnF,CAEA,aAAAopF,GACI,OAAO,GAAWppF,KAAKqpF,WAC3B,CACA,QAAAA,GACI,OAAOtF,GAAIe,WAAW,CAAEtqD,EAAGx6B,KAAKw6B,EAAGz3B,EAAG/C,KAAK+C,GAC/C,CAEA,iBAAAumF,GACI,OAAO,GAAWtpF,KAAKupF,eAC3B,CACA,YAAAA,GACI,OAAOpB,EAAcnoF,KAAKw6B,GAAK2tD,EAAcnoF,KAAK+C,EACtD,EAEJ,MAAMq8E,EAAQ,CACV,iBAAAoK,CAAkBpf,GACd,IAEI,OADAmb,EAAuBnb,IAChB,CACX,CACA,MAAO5iD,GACH,OAAO,CACX,CACJ,EACA+9D,uBAAwBA,EAKxBlG,iBAAkB,KACd,MAAM59E,EAAS6zE,GAAiB2E,EAAMzmE,GACtC,OhB3XL,SAAwBzU,EAAKq2E,EAAYp9B,GAAO,GACnD,MAAM51C,EAAMrD,EAAI0C,OACVm+E,EAAWzK,GAAoBC,GAC/BqU,EAASnU,GAAiBF,GAEhC,GAAIhzE,EAAM,IAAMA,EAAMqnF,GAAUrnF,EAAM,KAClC,MAAM,IAAI5D,MAAM,YAAcirF,EAAS,6BAA+BrnF,GAC1E,MAEMsnF,EAAU,GAFJ1xC,EAAO,GAAgBj5C,GAAO,GAAgBA,GAEjCq2E,EAAa,IAAO,GAC7C,OAAOp9B,EAAO,GAAgB0xC,EAAS9J,GAAY,GAAgB8J,EAAS9J,EAChF,CgBgXmB+J,CAAe1P,EAAMriC,YAAYn2C,GAASw4E,EAAMzmE,EAAE,EAU7D8rE,WAAU,CAACtJ,EAAa,EAAG2I,EAAQ7D,EAAMnzC,QACrCg3C,EAAMpC,eAAevG,GACrB2I,EAAMpB,SAASt3C,OAAO,IACf04C,IAef,SAASiL,EAAUvkC,GACf,MAAMxO,EAAM,GAAQwO,GACdt/C,EAAsB,iBAATs/C,EACbjjD,GAAOy0C,GAAO9wC,IAAQs/C,EAAK5jD,OACjC,OAAIo1C,EACOz0C,IAAQ+iF,GAAiB/iF,IAAQgjF,EACxCr/E,EACO3D,IAAQ,EAAI+iF,GAAiB/iF,IAAQ,EAAIgjF,EAChD//B,aAAgBy1B,CAGxB,CAuBA,MAAMmK,EAAWhL,EAAMgL,UACnB,SAAUn2E,GAEN,GAAIA,EAAMrN,OAAS,KACf,MAAM,IAAIjD,MAAM,sBAGpB,MAAMguC,EAAM,GAAgB19B,GACtB+6E,EAAuB,EAAf/6E,EAAMrN,OAAaw4E,EAAM/H,WACvC,OAAO2X,EAAQ,EAAIr9C,GAAOvG,OAAO4jD,GAASr9C,CAC9C,EACE04C,EAAgBjL,EAAMiL,eACxB,SAAUp2E,GACN,OAAOyvE,EAAK0G,EAASn2E,GACzB,EAEEg7E,EAAa,GAAQ7P,EAAM/H,YAIjC,SAAS6X,EAAWv9C,GAGhB,OAFA,GAAS,WAAaytC,EAAM/H,WAAY1lC,EAAK,GAAKs9C,GAE3C,GAAgBt9C,EAAKytC,EAAM7H,YACtC,CA0DA,MAAM4X,EAAiB,CAAEnG,KAAM5J,EAAM4J,KAAMxJ,SAAS,GAC9C4P,EAAiB,CAAEpG,KAAM5J,EAAM4J,KAAMxJ,SAAS,GAiGpD,OA5EAS,EAAMnzC,KAAK40C,eAAe,GA4EnB,CACHtC,QACA+E,aA9NJ,SAAsB5U,EAAYyd,GAAe,GAC7C,OAAO/M,EAAMqD,eAAe/T,GAAYkU,WAAWuJ,EACvD,EA6NIpG,gBAnMJ,SAAyByI,EAAUC,EAAStC,GAAe,GACvD,GAAI+B,EAAUM,GACV,MAAM,IAAI1rF,MAAM,iCACpB,IAAKorF,EAAUO,GACX,MAAM,IAAI3rF,MAAM,iCAEpB,OADUs8E,EAAM3jC,QAAQgzC,GACf5M,SAASgI,EAAuB2E,IAAW5L,WAAWuJ,EACnE,EA6LIvpE,KAvFJ,SAAcsqE,EAASxK,EAASthD,EAAOktD,GACnC,MAAM,KAAEI,EAAI,MAAEC,GApElB,SAAiBzB,EAASxe,EAAYttC,EAAOktD,GACzC,GAAI,CAAC,YAAa,aAAapvB,MAAMliC,GAAMA,KAAKoE,IAC5C,MAAM,IAAIt+B,MAAM,uCACpB,MAAM,KAAE4O,EAAI,YAAEwqC,GAAgBqiC,EAC9B,IAAI,KAAE4J,EAAI,QAAExJ,EAASiQ,aAAcC,GAAQztD,EAC/B,MAAR+mD,IACAA,GAAO,GACX+E,EAAU,GAAY,UAAWA,GACjChF,GAAmB9mD,GACfu9C,IACAuO,EAAU,GAAY,oBAAqBx7E,EAAKw7E,KAIpD,MAAM4B,EAAQtF,EAAc0D,GACtBnsE,EAAI8oE,EAAuBnb,GAC3BqgB,EAAW,CAACV,EAAWttE,GAAIstE,EAAWS,IAE5C,GAAW,MAAPD,IAAuB,IAARA,EAAe,CAE9B,MAAMtmE,GAAY,IAARsmE,EAAe3yC,EAAY+4B,EAAG6B,OAAS+X,EACjDE,EAASjqF,KAAK,GAAY,eAAgByjB,GAC9C,CACA,MAAMmmE,EAAO,MAAeK,GACtBrzD,EAAIozD,EA0BV,MAAO,CAAEJ,OAAMC,MAxBf,SAAeK,GAEX,MAAMhyD,EAAIusD,EAASyF,GACnB,IAAKjF,EAAmB/sD,GACpB,OACJ,MAAMiyD,EAAKtF,EAAK3sD,GACV8J,EAAIs4C,EAAMnzC,KAAK41C,SAAS7kD,GAAGwjD,WAC3B1hD,EAAI+jD,EAAK/7C,EAAErtB,GACjB,GAAIqlB,IAAM,GACN,OAIJ,MAAMz3B,EAAIw7E,EAAKoM,EAAKpM,EAAKnnD,EAAIoD,EAAI/d,IACjC,GAAI1Z,IAAM,GACN,OACJ,IAAIwlF,GAAY/lD,EAAErtB,IAAMqlB,EAAI,EAAI,GAAKjwB,OAAOi4B,EAAEgnC,EAAI,IAC9CohB,EAAQ7nF,EAKZ,OAJI8gF,GAAQuE,EAAsBrlF,KAC9B6nF,EAzOZ,SAAoB7nF,GAChB,OAAOqlF,EAAsBrlF,GAAKw7E,GAAMx7E,GAAKA,CACjD,CAuOoBomF,CAAWpmF,GACnBwlF,GAAY,GAET,IAAID,EAAU9tD,EAAGowD,EAAOrC,EACnC,EAEJ,CAiB4BsC,CAAQjC,EAASxK,EAASthD,GAC5C0c,EAAIygC,EACJ6Q,EjB/uBP,SAAwBC,EAASC,EAAUC,GAC9C,GAAuB,iBAAZF,GAAwBA,EAAU,EACzC,MAAM,IAAIvsF,MAAM,4BACpB,GAAwB,iBAAbwsF,GAAyBA,EAAW,EAC3C,MAAM,IAAIxsF,MAAM,6BACpB,GAAsB,mBAAXysF,EACP,MAAM,IAAIzsF,MAAM,6BAEpB,IAAIa,EAAI+wE,GAAI2a,GACRryD,EAAI03C,GAAI2a,GACRxpF,EAAI,EACR,MAAMgT,EAAQ,KACVlV,EAAEk5C,KAAK,GACP7f,EAAE6f,KAAK,GACPh3C,EAAI,CAAC,EAEHuU,EAAI,IAAI8K,IAAMqqE,EAAOvyD,EAAGr5B,KAAMuhB,GAC9BsqE,EAAS,CAACd,EAAOha,GAAI,MAEvB13C,EAAI5iB,EAAEu6D,GAAK,CAAC,IAAQ+Z,GACpB/qF,EAAIyW,IACgB,IAAhBs0E,EAAK3oF,SAETi3B,EAAI5iB,EAAEu6D,GAAK,CAAC,IAAQ+Z,GACpB/qF,EAAIyW,IAAG,EAELnS,EAAM,KAER,GAAIpC,KAAO,IACP,MAAM,IAAI/C,MAAM,2BACpB,IAAI4D,EAAM,EACV,MAAMynC,EAAM,GACZ,KAAOznC,EAAM4oF,GAAU,CACnB3rF,EAAIyW,IACJ,MAAMq1E,EAAK9rF,EAAE6B,QACb2oC,EAAIrpC,KAAK2qF,GACT/oF,GAAO/C,EAAEoC,MACb,CACA,OAAO,MAAeooC,EAAI,EAW9B,MATiB,CAACugD,EAAMgB,KAGpB,IAAIxlD,EACJ,IAHArxB,IACA22E,EAAOd,KAEExkD,EAAMwlD,EAAKznF,OAChBunF,IAEJ,OADA32E,IACOqxB,CAAG,CAGlB,CiB6rBqBylD,CAAe7xC,EAAEpsC,KAAKipC,UAAWmD,EAAE44B,YAAa54B,EAAEmqC,MAC/D,OAAOmH,EAAKV,EAAMC,EACtB,EAmFI7qE,OAlEJ,SAAgB6qD,EAAWue,EAASvf,EAAWvsC,EAAOmtD,GAClD,MAAMqB,EAAKjhB,EACXue,EAAU,GAAY,UAAWA,GACjCvf,EAAY,GAAY,YAAaA,GACrC,MAAM,KAAEwa,EAAI,QAAExJ,EAAO,OAAEvvE,GAAWgyB,EAGlC,GADA8mD,GAAmB9mD,GACf,WAAYA,EACZ,MAAM,IAAIt+B,MAAM,sCACpB,QAAeU,IAAX4L,GAAmC,YAAXA,GAAmC,QAAXA,EAChD,MAAM,IAAItM,MAAM,iCACpB,MAAM+sF,EAAsB,iBAAPD,GAAmB,GAAQA,GAC1CE,GAASD,IACVzgF,GACa,iBAAPwgF,GACA,OAAPA,GACgB,iBAATA,EAAG9wD,GACM,iBAAT8wD,EAAGvoF,EACd,IAAKwoF,IAAUC,EACX,MAAM,IAAIhtF,MAAM,4EACpB,IAAIitF,EACA3X,EACJ,IAGI,GAFI0X,IACAC,EAAO,IAAInD,EAAUgD,EAAG9wD,EAAG8wD,EAAGvoF,IAC9BwoF,EAAO,CAGP,IACmB,YAAXzgF,IACA2gF,EAAOnD,EAAUG,QAAQ6C,GACjC,CACA,MAAOI,GACH,KAAMA,aAAoB3H,GAAIC,KAC1B,MAAM0H,CACd,CACKD,GAAmB,QAAX3gF,IACT2gF,EAAOnD,EAAUE,YAAY8C,GACrC,CACAxX,EAAIgH,EAAM3jC,QAAQkyB,EACtB,CACA,MAAO7hD,GACH,OAAO,CACX,CACA,IAAKikE,EACD,OAAO,EACX,GAAI5H,GAAQ4H,EAAKvC,WACb,OAAO,EACP7O,IACAuO,EAAU3O,EAAM7sE,KAAKw7E,IACzB,MAAM,EAAEpuD,EAAC,EAAEz3B,GAAM0oF,EACX31E,EAAIovE,EAAc0D,GAClB+C,EAAKtG,EAAKtiF,GACVimF,EAAKzK,EAAKzoE,EAAI61E,GACd1C,EAAK1K,EAAK/jD,EAAImxD,GACd1M,EAAInE,EAAMnzC,KAAKigD,qBAAqB9T,EAAGkV,EAAIC,IAAK/M,WACtD,QAAK+C,GAEKV,EAAKU,EAAE9pE,KACJqlB,CACjB,EAOI8qD,gBAAiBxK,EACjBwN,YACAlJ,QAER,CC1iCO,SAASwM,GAAQx+E,GACpB,MAAO,CACHA,OACAu2E,KAAM,CAAC5kF,KAAQ+/E,IAAS6E,GAAKv2E,EAAMrO,ExGiJpC,YAAwBw/C,GAC3B,IAAI2xB,EAAM,EACV,IAAK,IAAI3uE,EAAI,EAAGA,EAAIg9C,EAAO98C,OAAQF,IAAK,CACpC,MAAMof,EAAI49B,EAAOh9C,GACjB,GAAOof,GACPuvD,GAAOvvD,EAAElf,MACb,CACA,MAAMmkC,EAAM,IAAI31B,WAAWigE,GAC3B,IAAK,IAAI3uE,EAAI,EAAGqoC,EAAM,EAAGroC,EAAIg9C,EAAO98C,OAAQF,IAAK,CAC7C,MAAMof,EAAI49B,EAAOh9C,GACjBqkC,EAAItmC,IAAIqhB,EAAGipB,GACXA,GAAOjpB,EAAElf,MACb,CACA,OAAOmkC,CACX,CwG/JgD,IAAek5C,IACvDlnC,YAAW,GAEnB,CDsLgF3R,OAAO,GEjLvF,MAAM4lD,GAAa5lD,OAAO,sEACpB6lD,GAAa7lD,OAAO,sEACpB,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb8lD,GAAa,CAACprE,EAAGC,KAAOD,EAAIC,EAAI,IAAOA,EA6B7C,MAAMorE,GAAO,GAAMH,QAAY3sF,OAAWA,EAAW,CAAE20E,KAxBvD,SAAiBrK,GACb,MAAMsK,EAAI+X,GAEJta,EAAMtrC,OAAO,GAAIgmD,EAAMhmD,OAAO,GAAIimD,EAAOjmD,OAAO,IAAKkmD,EAAOlmD,OAAO,IAEnEmmD,EAAOnmD,OAAO,IAAKomD,EAAOpmD,OAAO,IAAKqmD,EAAOrmD,OAAO,IACpDtvB,EAAM6yD,EAAIA,EAAIA,EAAKsK,EACnBl9D,EAAMD,EAAKA,EAAK6yD,EAAKsK,EACrB/8D,EAAM86D,GAAKj7D,EAAI26D,EAAKuC,GAAKl9D,EAAMk9D,EAC/B58D,EAAM26D,GAAK96D,EAAIw6D,EAAKuC,GAAKl9D,EAAMk9D,EAC/B18D,EAAOy6D,GAAK36D,EAAI,GAAK48D,GAAKn9D,EAAMm9D,EAChC/7D,EAAO85D,GAAKz6D,EAAK80E,EAAMpY,GAAK18D,EAAO08D,EACnCz6D,EAAOw4D,GAAK95D,EAAKo0E,EAAMrY,GAAK/7D,EAAO+7D,EACnCyY,EAAO1a,GAAKx4D,EAAKgzE,EAAMvY,GAAKz6D,EAAOy6D,EACnC0Y,EAAQ3a,GAAK0a,EAAKD,EAAMxY,GAAKyY,EAAOzY,EACpC2Y,EAAQ5a,GAAK2a,EAAMH,EAAMvY,GAAKz6D,EAAOy6D,EACrC4Y,EAAQ7a,GAAK4a,EAAMlb,EAAKuC,GAAKl9D,EAAMk9D,EACnCgT,EAAMjV,GAAK6a,EAAMN,EAAMtY,GAAK/7D,EAAO+7D,EACnCS,EAAM1C,GAAKiV,EAAImF,EAAKnY,GAAKn9D,EAAMm9D,EAC/B9iE,EAAO6gE,GAAK0C,EAAI,GAAKT,GAC3B,IAAKkY,GAAKhZ,IAAIgZ,GAAK7Y,IAAIniE,GAAOw4D,GAC1B,MAAM,IAAIhrE,MAAM,2BACpB,OAAOwS,CACX,IAiBa27E,GDrDN,SAAqB3S,EAAU4S,GAClC,MAAMhuF,EAAUwO,GAAS43E,GAAY,IAAKhL,KAAa4R,GAAQx+E,KAC/D,MAAO,IAAKxO,EAAOguF,GAAUhuF,SACjC,CCkDyBiuF,CAAY,CACjClsE,EAAGslB,OAAO,GACVrlB,EAAGqlB,OAAO,GACV0qC,GAAIqb,GACJx4E,EAAGs4E,GACHxT,GAAIryC,OAAO,iFACXsyC,GAAItyC,OAAO,iFACXnwB,EAAGmwB,OAAO,GACV49C,MAAM,EACNgC,KAAM,CAEFC,KAAM7/C,OAAO,sEACb8/C,YAAcrtD,IACV,MAAMllB,EAAIs4E,GACJhqF,EAAKmkC,OAAO,sCACZvvB,GAAM,GAAMuvB,OAAO,sCACnBlkC,EAAKkkC,OAAO,uCACZtvB,EAAK7U,EACLgrF,EAAY7mD,OAAO,uCACnBjwB,EAAK+1E,GAAWp1E,EAAK+hB,EAAGllB,GACxByC,EAAK81E,IAAYr1E,EAAKgiB,EAAGllB,GAC/B,IAAI4zE,EAAK,GAAI1uD,EAAI1iB,EAAKlU,EAAKmU,EAAKlU,EAAIyR,GAChC8zE,EAAK,IAAKtxE,EAAKU,EAAKT,EAAKU,EAAInD,GACjC,MAAM2zE,EAAQC,EAAK0F,EACbzF,EAAQC,EAAKwF,EAKnB,GAJI3F,IACAC,EAAK5zE,EAAI4zE,GACTC,IACAC,EAAK9zE,EAAI8zE,GACTF,EAAK0F,GAAaxF,EAAKwF,EACvB,MAAM,IAAItuF,MAAM,uCAAyCk6B,GAE7D,MAAO,CAAEyuD,QAAOC,KAAIC,QAAOC,KAAI,IAGxC,IC7FI,SAASyF,GAAU9rC,GACtB,OAAa,MAATA,GAGyB,mBAAfA,EAAM1d,MACO,mBAAhB0d,EAAM3d,OACY,mBAAlB2d,EAAM+rC,OACrB,CDyFY/mD,OAAO,GAiBL0mD,GAAUrH,gBErHjB,MAAM2H,GACT9nF,KAAO,YACPikE,IACAoa,KACA,WAAAl0E,CAAYvQ,GACRiB,KAAKwjF,KCoBN,SAAoCzkF,GACvC,IAEI,OADA,GAAKumF,gBAAgBnuC,QAAQp4C,GACtBA,CACX,CACA,MAAO0nB,GACH,MAAM,IAAImgD,GAAsB53D,OAAOyX,GAC3C,CACJ,CD5BoBymE,CAA2BnuF,GACvCiB,KAAKopE,ICEN,SAAoCrqE,GAEvC,OADc,GAAKumF,gBAAgBnuC,QAAQp4C,GAAKu/E,YAAW,EAE/D,CDLmB6O,CAA2BntF,KAAKwjF,KAC/C,CACA,WAAA/Z,GACI,OAAO,GAAS5zD,OAAO6zD,GAAoB1pE,MAC/C,CACA,KAAA2pE,GACI,OAAO77B,GAAIO,SAAS,IAAKruC,KAAKypE,cAClC,CACA,QAAApjE,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAKypE,cAAc36D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,MAAA5pD,CAAOmqB,EAAMigC,GACT,OEFD,SAAuB7qE,EAAK6qE,EAAKpyB,GACpC,MAAM9Y,EAAI,GAAO7oB,OAAO2hC,aAAevnC,WAAaunC,EAAMA,EAAIv1B,YAC9D,GAAI8qE,GAAUruD,GACV,OAAOA,EAAE6E,MAAK,EAAG1tB,YAAa,GAAK2J,OAAOoqD,EAAK/zD,EAAQ9W,KAClDukC,OAAM7c,IACP,MAAM,IAAI87D,GAAkBvzE,OAAOyX,GAAK,IAGhD,IACI,OAAO,GAAKjH,OAAOoqD,EAAKlrC,EAAE7oB,OAAQ9W,EACtC,CACA,MAAO0nB,GACH,MAAM,IAAI87D,GAAkBvzE,OAAOyX,GACvC,CACJ,CFZe,CAAczmB,KAAKwjF,KAAM5Z,EAAKjgC,EACzC,EAEG,MAAMyjD,GACTjoF,KAAO,YACPikE,IACAC,UACA,WAAA/5D,CAAYvQ,EAAKsqE,GACbrpE,KAAKopE,IChBN,SAAqCrqE,GACxC,IAEI,OADA,GAAKigF,aAAajgF,GAAK,GAChBA,CACX,CACA,MAAO0nB,GACH,MAAM,IAAIogD,GAAuB73D,OAAOyX,GAC5C,CACJ,CDQmB4mE,CAA4BtuF,GACvCiB,KAAKqpE,UAAY,IAAI4jB,GAAmB5jB,GCCzC,SAAmCe,GACtC,IACI,OAAO,GAAK4U,aAAa5U,GAAY,EACzC,CACA,MAAO3jD,GACH,MAAM,IAAIogD,GAAuB73D,OAAOyX,GAC5C,CACJ,CDR6D6mE,CAA0BvuF,GACnF,CACA,MAAAuvC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAIqqE,eAAen5D,YAGjC,GAAiBjQ,KAAKopE,IAAKrqE,EAAIqqE,IAC1C,CACA,IAAA9qD,CAAK9R,GACD,OEtCD,SAAqBzN,EAAKy4C,GAC7B,MAAM9Y,EAAI,GAAO7oB,OAAO2hC,aAAevnC,WAAaunC,EAAMA,EAAIv1B,YAC9D,GAAI8qE,GAAUruD,GACV,OAAOA,EAAE6E,MAAK,EAAG1tB,YAAa,GAAKyI,KAAKzI,EAAQ9W,GAAKqqF,kBAChD9lD,OAAM7c,IACP,MAAM,IAAI67D,GAAatzE,OAAOyX,GAAK,IAG3C,IACI,OAAO,GAAKnI,KAAKogB,EAAE7oB,OAAQ9W,GAAKqqF,eACpC,CACA,MAAO3iE,GACH,MAAM,IAAI67D,GAAatzE,OAAOyX,GAClC,CACJ,CFwBe,CAAYzmB,KAAKopE,IAAK58D,EACjC,EC1CG,SAAS+gF,GAA4Bz+E,GACxC,OAAO,IAAIm+E,GAAwBn+E,EACvC,CEaOq+B,eAAeqgD,GAAgBroF,EAAM8N,GACxC,GAAa,YAAT9N,EACA,OhBLDgoC,iBACH,MAAM,WAAEi9B,EAAU,UAAEf,GFfjB,WAEH,MAAMuY,EAAgB,GAAGxC,MAAMC,mBACzBhW,EAAY,GAAG2V,aAAa4C,GAGlC,MAAO,CACHxX,WAFeuX,GAAWC,EAAevY,GAGzCA,YAER,CEKsC,GAClC,OAAO,IAAI0Y,GAAuB3X,EAAYf,EAClD,CgBEeokB,GAEX,GAAa,cAATtoF,EACA,OFjBDgoC,iBACH,MAAMugD,EAsCC,GAAKtO,MAAMC,mBArClB,OAAO,IAAI+N,GAAyBM,EACxC,CEceC,GAEX,GAAa,QAATxoF,EACA,OTgHDgoC,eAAkCl6B,GACrC,GAAIA,EAvIwB,KAwIxB,MAAM,IAAI,GAAuB,yBAErC,MAAM/N,QD5IHioC,eAA8Bl6B,GACjC,MAAM26E,QAAa/K,GAAUzjF,MAAMiuC,OAAOwgD,YAAY,CAClD9sF,KAAM,oBACN+sF,cAAe76E,EACf86E,eAAgB,IAAI99E,WAAW,CAAC,EAAM,EAAM,IAC5C7C,KAAM,CAAErM,KAAM,aACf,EAAM,CAAC,OAAQ,WACZmE,QAsBVioC,eAAyBygD,GACrB,GAAuB,MAAnBA,EAAKxjB,YAAwC,MAAlBwjB,EAAKvkB,UAChC,MAAM,IAAI,GAAuB,uCAErC,OAAO9sC,QAAQ6oB,IAAI,CACfy9B,GAAUzjF,MAAMiuC,OAAO2gD,UAAU,MAAOJ,EAAKxjB,YAC7CyY,GAAUzjF,MAAMiuC,OAAO2gD,UAAU,MAAOJ,EAAKvkB,YAErD,CA9BuB2kB,CAAUJ,GAC7B,MAAO,CACHxjB,WAAYllE,EAAK,GACjBmkE,UAAWnkE,EAAK,GAExB,CCgIuB+oF,CAAeh7E,GAK5B4C,EAAS,GA9IG,GA0IL,GAAO,GAAaX,OAAO,CACpC4E,KAAM,GAAWwpE,IACjBjB,KAAMc,GAAUj+E,EAAKmkE,eAGzB,OAAO,IAAIyZ,GAAmB59E,EAAKklE,WAAY,IAAIuY,GAAkBz9E,EAAKmkE,UAAWxzD,GACzF,CS3Heq4E,CA0If,SAAgBj7E,GACZ,OAAY,MAARA,EACO,KAEJuL,SAASvL,EAAM,GAC1B,CA/IkCk7E,CAAOl7E,IAErC,GAAa,UAAT9N,EACA,O5BuHDgoC,eAAoC69B,EAAQ,SAC/C,MAAMjsE,QCvJHouC,eAAgC69B,EAAQ,SAC3C,MAAMojB,QAAgBhhD,OAAOC,OAAOwgD,YAAY,CAC5C9sF,KAAM,QACN+oE,WAAYkB,IACb,EAAM,CAAC,OAAQ,WAClB,MAAO,CACH3B,gBAAiBj8B,OAAOC,OAAO2gD,UAAU,MAAOI,EAAQ/kB,WACxDe,iBAAkBh9B,OAAOC,OAAO2gD,UAAU,MAAOI,EAAQhkB,YAEjE,CD8IsBikB,CAAiBrjB,GACnC,OAAO,IAAIhB,GAAqBjrE,EAAIqrE,WACxC,C4B1HekkB,CA6If,SAAiBtjB,GACb,GAAc,UAAVA,GAA8B,MAATA,EACrB,MAAO,QAEX,GAAc,UAAVA,EACA,MAAO,QAEX,GAAc,UAAVA,EACA,MAAO,QAEX,MAAM,IAAI,GAAuB,qDACrC,CAxJoCujB,CAAQt7E,IAExC,MAAM,IAAI,EACd,CACOk6B,eAAeqhD,GAAwBrpF,EAAMilF,GAChD,GAAa,YAATjlF,EACA,MAAM,IAAI,GAAwB,uDAEtC,OhBlBGgoC,eAA8Ci9C,GACjD,MAAM,WAAEhgB,EAAU,UAAEf,GFLjB,SAA6B+gB,GAChC,GAlBqB,KAkBjBA,EAAK3oF,OACL,MAAM,IAAIrB,UAAU,sCAEnB,KAAMgqF,aAAgBn6E,YACvB,MAAM,IAAI7P,UAAU,mDAGxB,MAAMwhF,EAAgBwI,EAChB/gB,EAAY,GAAG2V,aAAa4C,GAElC,MAAO,CACHxX,WAFeuX,GAAWC,EAAevY,GAGzCA,YAER,CEVsC,CAA2B+gB,GAC7D,OAAO,IAAIrI,GAAuB3X,EAAYf,EAClD,CgBeWolB,CAA+BrE,EAC1C,CAUO,SAASsE,GAAsBl/E,EAAKqG,GACvC,MAAM,KAAEiE,EAAI,KAAEuoE,GAAS,GAAarmE,OAAOxM,GACrCm6B,EAAO04C,GAAQ,IAAIpyE,WACzB,OAAQ6J,GACJ,KAAK,GAAWwpE,IACZ,OTqDL,SAA4Bx0E,EAAO+G,GACtC,GAAI/G,EAAM0B,YArGW,KAsGjB,MAAM,IAAIo2D,GAAsB,yBAKpC,OAAOwc,GAHS,GAAUt0E,EAAO,CAC7B5L,OAAQ,IAE8B4L,EAAO+G,EACrD,CS7DmB84E,CAAmBhlD,EAAM9zB,GACpC,KAAK,GAAW+4E,QACZ,OAAO5M,GAA0Br4C,GACrC,KAAK,GAAWgjD,UACZ,OAAOY,GAA4B5jD,GACvC,KAAK,GAAWklD,MACZ,OAAOhkB,GAAwBlhC,GACnC,QACI,MAAM,IAAI,GAEtB,CA6CO,SAAS+/B,GAAoB3qE,GAChC,OAAO,GAAamW,OAAO,CACvB4E,KAAM,GAAW/a,EAAIoG,MACrBk9E,KAAMtjF,EAAIqqE,KAElB,CChGO,MAAM0lB,GAAsBrrD,OAAOmL,IAAI,gCAQjCmgD,GAAsBtrD,OAAOmL,IAAI,gCCRxC,GAAUnL,OAAOmL,IAAI,8BAG3B,MAAMogD,GACF7pF,KACA6nC,UACAq8B,UACA94D,OACA,WAAAjB,CAAYzD,GACR7L,KAAKmF,KAAO0G,EAAK1G,KACjBnF,KAAKgtC,UAAYnhC,EAAKmhC,UAEtBruC,OAAO0K,eAAerJ,KAAM,SAAU,CAClC0L,YAAY,EACZgY,UAAU,GAElB,CACA,IAAK+f,OAAOqB,eACR,MAAO,UAAU9kC,KAAKqG,aAC1B,CACA,CAAComD,KAAgB,EACjB,QAAApmD,GAII,OAHmB,MAAfrG,KAAKuQ,SACLvQ,KAAKuQ,OAASg7B,GAAUr2B,OAAOlV,KAAKgtC,UAAUl+B,OAAO5N,MAAM,IAExDlB,KAAKuQ,MAChB,CACA,WAAAk5D,GACI,OAAOzpE,KAAKgtC,SAChB,CAGA,KAAA28B,GACI,OAAO77B,GAAIO,SA/BK,IA+BqBruC,KAAKgtC,UAC9C,CACA,MAAA3xB,GACI,OAAOrb,KAAKqG,UAChB,CAIA,MAAAioC,CAAO59B,GACH,GAAU,MAANA,EACA,OAAO,EAEX,GAAIA,aAAcT,WACd,OAAO,GAAiBjQ,KAAKgtC,UAAUl+B,MAAO4B,GAE7C,GAAkB,iBAAPA,EACZ,OAAO1Q,KAAKqG,aAAeqK,EAE1B,GAAgC,MAA5BA,GAAI+4D,eAAe36D,MACxB,OAAO,GAAiB9O,KAAKgtC,UAAUl+B,MAAO4B,EAAG+4D,cAAc36D,OAG/D,MAAM,IAAItQ,MAAM,eAExB,CAaA,CAAC,MACG,MAAO,UAAUwB,KAAKqG,aAC1B,EAEG,MAAM4oF,WAAkBD,GAC3B7pF,KAAO,MACPkkE,UACA,WAAA/5D,CAAYzD,GACRukC,MAAM,IAAKvkC,EAAM1G,KAAM,QACvBnF,KAAKqpE,UAAYx9D,EAAKw9D,SAC1B,EAEG,MAAM6lB,WAAsBF,GAC/B7pF,KAAO,UACPkkE,UACA,WAAA/5D,CAAYzD,GACRukC,MAAM,IAAKvkC,EAAM1G,KAAM,YACvBnF,KAAKqpE,UAAYx9D,EAAKw9D,SAC1B,EAEG,MAAM8lB,WAAwBH,GACjC7pF,KAAO,YACPkkE,UACA,WAAA/5D,CAAYzD,GACRukC,MAAM,IAAKvkC,EAAM1G,KAAM,cACvBnF,KAAKqpE,UAAYx9D,EAAKw9D,SAC1B,EAIG,MAAM+lB,GACTjqF,KAAO,MACP6nC,UACAq8B,UACAgmB,IACA,WAAA//E,CAAY+/E,GACRrvF,KAAKqvF,IAAMA,EAAIhpF,WACfrG,KAAKgtC,UAAY,GAASn3B,OAAO,GAAqB7V,KAAKqvF,KAC/D,CACA,CAAC,MACG,MAAO,UAAUrvF,KAAKqvF,MAC1B,CACA,CAAC5iC,KAAgB,EACjB,QAAApmD,GACI,OAAOrG,KAAK2pE,QAAQtjE,UACxB,CACA,WAAAojE,GACI,OAAOzpE,KAAKgtC,SAChB,CACA,KAAA28B,GACI,OAAO77B,GAAIO,SArBsB,KAqBqBruC,KAAKypE,cAC/D,CACA,MAAApuD,GACI,OAAOrb,KAAKqG,UAChB,CACA,MAAAioC,CAAOC,GACH,OAAa,MAATA,IAGAA,aAAiBt+B,aACjBs+B,EAAQ,GAAmBA,IAExBA,EAAMloC,aAAerG,KAAKqG,WACrC,EChIG,SAASipF,GAAiBvpF,EAAK6qB,GAClC,IAAIoc,EACJ,GAAsB,MAAlBjnC,EAAIc,OAAO,IAAgC,MAAlBd,EAAIc,OAAO,GAGpCmmC,EAAY,GAAczB,GAAUvvB,OAAO,IAAIjW,UAE9C,IAAIA,EAAIwmB,WAAW,gBAAkBxmB,EAAIwmB,WAAW,gBAAkBxmB,EAAIwmB,WAAW,WAAaxmB,EAAIwmB,WAAW,QAElH,OAAOgjE,GAAczhD,GAAIxoB,MAAMvf,IAG/B,GAAe,MAAX6qB,EACA,MAAM,IAAI,GAAuB,iFAErCoc,EAAY,GAAcpc,EAAQ5U,OAAOjW,GAC7C,CACA,OAAOypF,GAAoBxiD,EAC/B,CACO,SAASyiD,GAAoBpmB,GAChC,GAAuB,YAAnBA,EAAUlkE,KACV,OAAO,IAAI+pF,GAAmB,CAC1BliD,UAAWq8B,EAAUM,QAAQ38B,UAC7Bq8B,cAGH,GAAuB,cAAnBA,EAAUlkE,KACf,OAAO,IAAIgqF,GAAqB,CAC5BniD,UAAWq8B,EAAUM,QAAQ38B,UAC7Bq8B,cAGH,GAAuB,QAAnBA,EAAUlkE,KACf,OAAO,IAAI8pF,GAAe,CACtBjiD,UAAWq8B,EAAUM,QAAQ38B,UAC7Bq8B,cAGR,MAAM,IAAI,EACd,CAIO,SAASmmB,GAAoBxiD,GAChC,GAkCJ,SAA2BA,GACvB,OAAOA,EAAUj4B,OAAS,GAAOA,IACrC,CApCQ26E,CAAkB1iD,GAClB,OAAO,IAAIiiD,GAAe,CAAEjiD,cAE3B,GA4BT,SAA6BA,GACzB,OAAOA,EAAUj4B,OAAS,GAASA,IACvC,CA9Ba46E,CAAoB3iD,GACzB,IACI,MAAMq8B,EHoBX,SAAgCxzD,GACnC,MAAM,KAAEiE,EAAI,KAAEuoE,GAAS,GAAarmE,OAAOnG,EAAOA,QAC5C8zB,EAAO04C,GAAQ,IAAIpyE,WACzB,OAAQ6J,GACJ,KAAK,GAAW80E,QACZ,OAAO5M,GAA0Br4C,GACrC,KAAK,GAAWgjD,UACZ,OAAOY,GAA4B5jD,GACvC,KAAK,GAAWklD,MACZ,OAAOhkB,GAAwBlhC,GACnC,QACI,MAAM,IAAI,GAEtB,CGjC8BimD,CAAuB5iD,GACzC,GAAuB,YAAnBq8B,EAAUlkE,KACV,OAAO,IAAI+pF,GAAmB,CAAEliD,YAAWq8B,cAE1C,GAAuB,cAAnBA,EAAUlkE,KACf,OAAO,IAAIgqF,GAAqB,CAAEniD,YAAWq8B,aAErD,CACA,MAAO5iD,GAEH,MAAM4oE,EAAM,GAAmBriD,EAAUn3B,QACzC,OAAO,IAAIu5E,GAAe,IAAIS,IAAIR,GACtC,CAEJ,MAAM,IAAI7nB,GAAsB,uCACpC,CACO,SAAS+nB,GAAc/hD,GAC1B,GAAsB,MAAlBA,GAAKR,WAAoC,MAAfQ,EAAID,SAAoC,IAAhBC,EAAID,SApEtC,MAoEwDC,EAAIz4B,MAnE3C,OAmEwEy4B,EAAIz4B,KAC7G,MAAM,IAAIwyD,GAAgB,kCAE9B,GAtEqC,OAsEjC/5B,EAAIz4B,KAA2C,CAC/C,MAAMs6E,EAAM,GAAmB7hD,EAAIR,UAAUn3B,QAC7C,OAAO,IAAIu5E,GAAe,IAAIS,IAAIR,GACtC,CACA,OAAOG,GAAoBhiD,EAAIR,UACnC,CCtEA,MAAM,GACF8X,SACAC,SACAxB,MACAyB,WACA,WAAA11C,GACItP,KAAKujD,OAAQ,EACbvjD,KAAK8kD,SAAW,KAChB9kD,KAAK+kD,SAAW,IACpB,CACA,CAACthB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKglD,kBAEChlD,KAAK+kD,SAAStC,QAED,MAAnBziD,KAAKglD,WACL,MAAM,IAAIxmD,MAAM,0DAEpB,MAAMwmD,EAAahlD,KAAKglD,WAKxB,OAJAhlD,KAAKglD,gBAAa9lD,EAElBc,KAAK8kD,SAAS5gD,UACdlE,KAAK8kD,SAAW,KACTE,CACX,CACA,WAAM,CAAMv+B,GAYR,OAXAzmB,KAAKujD,OAAQ,EACF,MAAP98B,IAGAzmB,KAAK+kD,SAAStC,QAAQnf,OAAM,SAC5BtjC,KAAK+kD,SAASvoB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAalwC,EAElB9U,KAAK+kD,SAAS7gD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAK8jD,MAAMr9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAKujD,MACtB,MAAM,IAAI/kD,MAAM,4CAGpB,KAA0B,MAAnBwB,KAAKglD,kBACFhlD,KAAK8kD,SAASrC,QAEX,MAATzjD,EACAgB,KAAKglD,WAAa,CAAEhiB,MAAM,EAAOhkC,UAGjCgB,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAa,CAAEhiB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAK+kD,SAAS7gD,UACdlE,KAAK+kD,SAAW,WAGVP,GAAWxkD,KAAK8kD,SAASrC,QAASxoC,GAASgqC,OAAQhqC,EAC7D,EClHG,MAAM,WAA2Bzb,MACpCuC,KAAO,qBACPgU,KAAO,qBCuBJ,MAAM,WAAkBvW,MAC3BuW,KACA,WAAAzF,CAAY9C,EAASuI,GACjBq7B,MAAM5jC,GACNxM,KAAK+U,KAAOA,CAChB,EAKG,MAAM,WAAmB,GAC5B5P,KACA,WAAAmK,CAAY9C,GACR4jC,MAAM5jC,EAAS,aACfxM,KAAKmF,KAAO,UACZnF,KAAKe,KAAO,YAChB,EAEG,SAAS+uF,GAAWnqC,EAAQ7oB,GAC/B,MAAMptB,EFyEC,IAAI,GExEXi2C,EAAOG,KAAKp2C,GAAO4zB,OAAM6J,MAAO1mB,UACtB/W,EAAMzI,IAAIwf,EAAI,IAExBk/B,EAAOG,KAAO3Y,MAAOhnC,IACjB,UAAW,MAAMqJ,KAAOrJ,QACduJ,EAAMlP,KAAKgP,SAEfE,EAAMzI,KAAK,EAErB,IAAId,EAASw/C,EAAOx/C,OACkB,MAAlCw/C,EAAOx/C,OAAOs9B,OAAOsb,UACrB54C,EAASw/C,EAAOx/C,OAAOs9B,OAAOsb,YAEc,MAAvC4G,EAAOx/C,OAAOs9B,OAAOC,iBAC1Bv9B,EAASw/C,EAAOx/C,OAAOs9B,OAAOC,kBAElC,MAAMqsD,EAAa,IAAIlxC,GACjB82B,EAAI,CACNz4D,KAAMiwB,MAAOr+B,EAAOmL,KAEhB,IAAI5Z,EADJ4Z,GAASgqC,QAAQC,iBAEjB,MAAM8rC,EAAe,IAAIzzD,SAAQ,CAACr4B,EAASs4B,KACvCn8B,EAAW,KACPm8B,EAAO,IAAI,GAAW,gBAAgB,EAE1CviB,GAASgqC,QAAQG,iBAAiB,QAAS/jD,EAAS,IAExD,IACI,GAAa,MAATyO,EAAe,CAEf,MAAM,KAAEk0B,EAAI,MAAEhkC,SAAgBu9B,QAAQ8nB,KAAK,CACvCl+C,EAAOkC,OACP2nF,IAEJ,OAAa,IAAThtD,EACO,IAAI6b,GAER7/C,CACX,CACA,KAAO+wF,EAAWv/E,WAAa1B,GAAO,CAClC,MAAM,MAAE9P,EAAK,KAAEgkC,SAAezG,QAAQ8nB,KAAK,CACvCl+C,EAAOkC,OACP2nF,IAEJ,IAAa,IAAThtD,EACA,MAAM,IAAI,GAAmB,2BAEjC+sD,EAAW/wC,OAAOhgD,EACtB,CACA,MAAMwQ,EAAMugF,EAAWtwC,QAAQ,EAAG3wC,GAElC,OADAihF,EAAW3wC,QAAQtwC,GACZU,CACX,CACA,QACoB,MAAZnP,GACA4Z,GAASgqC,QAAQK,oBAAoB,QAASjkD,EAEtD,GAEJqP,MAAOy9B,MAAOxD,EAAM1vB,KAChBA,GAASgqC,QAAQC,iBAEbva,aAAgB15B,iBACVP,EAAMlP,KAAKmpC,EAAM1vB,SAGjBvK,EAAMlP,KAAKmpC,EAAK1nB,WAAYhI,EACtC,EAEJg2E,OAAQ,KACJ,GAAIF,EAAWv/E,WAAa,EAAG,CAC3B,MAAM0/E,EAAiBvqC,EAAOx/C,OAC9Bw/C,EAAOx/C,OAAUgnC,mBACY,IAArBrQ,GAAMqzD,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAOvqC,CAAM,GAGrB,OAAOgwB,CACX,CCnIO,MAAM,WAAkCn3E,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BCQJ,SAASq7E,GAASzqC,EAAQ7oB,EAAO,CAAC,GACrC,MAAMhuB,EAAQghF,GAAWnqC,EAAQ7oB,GACP,MAAtBA,EAAKqlB,eAAiD,MAAxBrlB,EAAKolB,kBAGnCplB,EAAKolB,gBAAkB,EAAsBplB,EAAKqlB,gBAEtD,MAAMkuC,EAAevzD,GAAMmlB,eAAiB,EACtCZ,EAAevkB,GAAMwkB,eAAiB,EA6C5C,MA5CU,CACNpkC,KAAMiwB,MAAOlzB,IACT,IAAI+nC,GAAc,EAClB,MAAMsuC,EAAe,IAAIzxC,GACzB,OAAa,CAETyxC,EAAatxC,aAAalwC,EAAMoO,KAAK,EAAGjD,IACxC,IACI+nC,EAAaquC,EAAaC,EAC9B,CACA,MAAO7pE,GACH,GAAIA,aAAe+P,WACf,SAEJ,MAAM/P,CACV,CACA,GAAIu7B,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzBllB,GAAMolB,iBAA2BouC,EAAa9/E,WAAassB,EAAKolB,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvBllB,GAAMqlB,eAAyBH,EAAallB,EAAKqlB,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAOrzC,EAAMoO,KAAK8kC,EAAY/nC,EAAQ,EAE1CvK,MAAOy9B,MAAOxD,EAAM1vB,WAEVnL,EAAMY,MAAM,IAAImvC,GAAewC,EAAa1X,EAAKn5B,YAAam5B,GAAO1vB,EAAQ,EAEvFs2E,OAAQpjD,MAAOxD,EAAM1vB,KACjB,MAAMylC,EAAO,IAAIb,MAAkBlV,EAAK6mD,SAAQhhF,GAAO,CAAE6xC,EAAa7xC,EAAIgB,YAAahB,YAEjFV,EAAMY,MAAMgwC,EAAMzlC,EAAQ,EAEpCg2E,OAAQ,IACGnhF,EAAMmhF,SAIzB,CC/EO,SAASrC,KACZ,MAAM58D,EAAW,KACjB,IAAIy/D,GAAQ,EACZ,MAAO,CACH3qC,KAAM3Y,MAAOhnC,IACT,GAAIsqF,EACA,MAAM,IAAIjyF,MAAM,iBAEpBiyF,GAAQ,EACRz/D,EAAS9sB,QAAQiC,EAAO,EAE5BA,OAASgnC,kBACL,MAAMhnC,QAAe6qB,EAASyxB,cACvBt8C,CACX,CAHQ,GAKhB,CCpBO,MAAMuqF,GAA6B,MAE7BC,GAAoB7jF,QAAQ8qB,WAAWxmB,SAASvH,KAAK8mF,mBCFlE,SAAS/nB,GAAOp1D,GACZ,IAAKjJ,OAAO2rC,cAAc1iC,IAAMA,EAAI,EAChC,MAAM,IAAIhV,MAAM,kCAAkCgV,IAC1D,CACA,SAAS+O,GAAK3B,GACV,GAAiB,kBAANA,EACP,MAAM,IAAIpiB,MAAM,yBAAyBoiB,IACjD,CACO,SAAS,GAAQD,GACpB,OAAQA,aAAa1Q,YACX,MAAL0Q,GAA0B,iBAANA,GAAyC,eAAvBA,EAAErR,YAAYvO,IAC7D,CACA,SAAS+N,GAAM8R,KAAMu1B,GACjB,IAAK,GAAQv1B,GACT,MAAM,IAAIpiB,MAAM,uBACpB,GAAI23C,EAAQ10C,OAAS,IAAM00C,EAAQnrB,SAASpK,EAAEnf,QAC1C,MAAM,IAAIjD,MAAM,iCAAiC23C,oBAA0Bv1B,EAAEnf,SACrF,CAOA,SAASmvF,GAAOp6C,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAIl4C,MAAM,oCACpB,GAAIi4C,GAAiBD,EAASG,SAC1B,MAAM,IAAIn4C,MAAM,wCACxB,CASA,MCjCa,GAAOq4C,GAAQ,IAAIjhC,YAAYihC,EAAInkC,OAAQmkC,EAAItP,WAAYt+B,KAAK6a,MAAM+yB,EAAIrmC,WAAa,IAMpG,GADgF,KAA5D,IAAIP,WAAW,IAAI2F,YAAY,CAAC,YAAalD,QAAQ,GAErE,MAAM,IAAIlU,MAAM,+CAiGb,SAAS,GAAQmrC,GACpB,GAAoB,iBAATA,EACPA,EAlBD,SAAqB5jC,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvH,MAAM,+BAA+BuH,GACnD,OAAO,IAAIkK,YAAW,IAAI87B,aAAc72B,OAAOnP,GACnD,CAce,CAAY4jC,OAClB,KAAI,GAAQA,GAGb,MAAM,IAAInrC,MAAM,mCAAmCmrC,GAFnDA,EAAOknD,GAAUlnD,EAEyC,CAC9D,OAAOA,CACX,CAwCO,MAAMmnD,GAAa,CAACz0D,EAAQl1B,KAC/BxI,OAAO01B,OAAOltB,EAAGk1B,GACVl1B,GAGJ,SAAS,GAAa8wC,EAAM1Q,EAAYvoC,EAAOg5C,GAClD,GAAiC,mBAAtBC,EAAKO,aACZ,OAAOP,EAAKO,aAAajR,EAAYvoC,EAAOg5C,GAChD,MAAMS,EAAOxS,OAAO,IACdyS,EAAWzS,OAAO,YAClB0S,EAAKpuC,OAAQvL,GAASy5C,EAAQC,GAC9BE,EAAKruC,OAAOvL,EAAQ05C,GACpB5iC,EAAIkiC,EAAO,EAAI,EACfx2C,EAAIw2C,EAAO,EAAI,EACrBC,EAAKY,UAAUtR,EAAazxB,EAAG6iC,EAAIX,GACnCC,EAAKY,UAAUtR,EAAa/lC,EAAGo3C,EAAIZ,EACvC,CAaO,SAAS64C,GAAU/hF,GACtB,OAAOmB,WAAWsO,KAAKzP,EAC3B,CACO,SAASiiF,MAASxyC,GACrB,IAAK,IAAIh9C,EAAI,EAAGA,EAAIg9C,EAAO98C,OAAQF,IAC/Bg9C,EAAOh9C,GAAGg3C,KAAK,EAEvB,CC1JA,MAAMy4C,GAAgBjrF,GAAQkK,WAAWsO,KAAKxY,EAAI2B,MAAM,IAAIpD,KAAK6C,GAAMA,EAAEkG,WAAW,MAC9E4jF,GAAUD,GAAa,oBACvBE,GAAUF,GAAa,oBACvBG,GAAa,GAAIF,IACjBG,GAAa,GAAIF,IAEhB,SAAS,GAAKvwE,EAAGC,GACpB,OAAQD,GAAKC,EAAMD,IAAO,GAAKC,CACnC,CAEA,SAAS,GAAYA,GACjB,OAAOA,EAAE2mB,WAAa,GAAM,CAChC,CAPqB6pD,GAAWlwF,QAShC,MAIMmwF,GAAc,GAAK,GAAK,EACxBC,GAAY,IAAI17E,YAiCf,SAAS27E,GAAaC,EAAM10D,GAC/B,MAAM,eAAE20D,EAAc,cAAEC,EAAa,cAAEC,EAAa,aAAEC,EAAY,OAAEC,GD4CjE,SAAmBxuF,EAAUy5B,GAChC,GAAY,MAARA,GAAgC,iBAATA,EACvB,MAAM,IAAIt+B,MAAM,2BAEpB,OADeG,OAAO01B,OC/CmE,CAAEo9D,gBAAgB,EAAOE,cAAe,EAAGC,cAAc,EAAOC,OAAQ,ID+C1H/0D,EAE3C,CCjDmF,CAAU,EAA8EA,GACvK,GAAoB,mBAAT00D,EACP,MAAM,IAAIhzF,MAAM,2BAKpB,OAJA,GAAQmzF,GACR,GAAQE,GACR,GAAMD,GACN,GAAMH,GACC,CAAC1yF,EAAK+yF,EAAOnoD,EAAM6U,EAAQ9R,EAAU,KACxC,GAAO3tC,GACP,GAAO+yF,GACP,GAAOnoD,GACP,MAAMvnC,EAAMunC,EAAKloC,OAKjB,QAJevC,IAAXs/C,IACAA,EAAS,IAAIvuC,WAAW7N,IAC5B,GAAOo8C,GACP,GAAQ9R,GACJA,EAAU,GAAKA,GAAW2kD,GAC1B,MAAM,IAAI7yF,MAAM,yBACpB,GAAIggD,EAAO/8C,OAASW,EAChB,MAAM,IAAI5D,MAAM,gBAAgBggD,EAAO/8C,iCAAiCW,MAC5E,MAAM2vF,EAAU,GAIhB,IAAoBr5D,EAAGs5D,EAAnBxwF,EAAIzC,EAAI0C,OACZ,GAAU,KAAND,EACAuwF,EAAQvxF,KAAMk4B,EAAIm4D,GAAU9xF,IAC5BizF,EAAQZ,OAEP,IAAU,KAAN5vF,IAAYiwF,EAQjB,MAAM,IAAIjzF,MAAM,wCAAwCgD,KAPxDk3B,EAAI,IAAIzoB,WAAW,IACnByoB,EAAEp5B,IAAIP,GACN25B,EAAEp5B,IAAIP,EAAK,IACXizF,EAAQb,GACRY,EAAQvxF,KAAKk4B,EAIjB,CAQK,GAAYo5D,IACbC,EAAQvxF,KAAMsxF,EAAQjB,GAAUiB,IACpC,MAAMG,EAAM,GAAIv5D,GAEhB,GAAIg5D,EAAe,CACf,GAAqB,KAAjBI,EAAMrwF,OACN,MAAM,IAAIjD,MAAM,wCACpBkzF,EAAcM,EAAOC,EAAK,GAAIH,EAAM7vE,SAAS,EAAG,KAAMgwE,GACtDH,EAAQA,EAAM7vE,SAAS,GAC3B,CAEA,MAAMiwE,EAAa,GAAKP,EACxB,GAAIO,IAAeJ,EAAMrwF,OACrB,MAAM,IAAIjD,MAAM,sBAAsB0zF,iBAE1C,GAAmB,KAAfA,EAAmB,CACnB,MAAMC,EAAK,IAAIliF,WAAW,IAC1BkiF,EAAG7yF,IAAIwyF,EAAOF,EAAe,EAAI,GAAKE,EAAMrwF,QAC5CqwF,EAAQK,EACRJ,EAAQvxF,KAAKsxF,EACjB,CACA,MAAMM,EAAM,GAAIN,GAGhB,OAvGR,SAAmBN,EAAMQ,EAAOjzF,EAAK+yF,EAAOnoD,EAAM6U,EAAQ9R,EAASmlD,GAC/D,MAAMzvF,EAAMunC,EAAKloC,OACXgT,EAAQ,IAAIxE,WARJ,IASRwI,EAAM,GAAIhE,GAEV49E,EAAY,GAAY1oD,IAAS,GAAY6U,GAC7C8zC,EAAMD,EAAY,GAAI1oD,GAAQ2nD,GAC9BiB,EAAMF,EAAY,GAAI7zC,GAAU8yC,GACtC,IAAK,IAAIxqF,EAAM,EAAGA,EAAM1E,EAAKsqC,IAAW,CAEpC,GADA8kD,EAAKQ,EAAOjzF,EAAK+yF,EAAOr5E,EAAKi0B,EAASmlD,GAClCnlD,GAAW2kD,GACX,MAAM,IAAI7yF,MAAM,yBACpB,MAAM05C,EAAOjvC,KAAKC,IAlBR,GAkBuB9G,EAAM0E,GAEvC,GAAIurF,GApBM,KAoBOn6C,EAAjB,CACI,MAAMs6C,EAAQ1rF,EAAM,EACpB,GAAIA,EAAM,GAAM,EACZ,MAAM,IAAItI,MAAM,+BACpB,IAAK,IAAWi0F,EAAPjwF,EAAI,EAASA,EAvBd,GAuB+BA,IACnCiwF,EAAOD,EAAQhwF,EACf+vF,EAAIE,GAAQH,EAAIG,GAAQh6E,EAAIjW,GAEhCsE,GA5BM,EA8BV,KAVA,CAWA,IAAK,IAAW2rF,EAAPjwF,EAAI,EAASA,EAAI01C,EAAM11C,IAC5BiwF,EAAO3rF,EAAMtE,EACbg8C,EAAOi0C,GAAQ9oD,EAAK8oD,GAAQh+E,EAAMjS,GAEtCsE,GAAOoxC,CALP,CAMJ,CACJ,CAsEQw6C,CAAUlB,EAAMQ,EAAOC,EAAKG,EAAKzoD,EAAM6U,EAAQ9R,EAASmlD,GACxDd,MAASgB,GACFvzC,CAAM,CAErB,CC9JA,MAAMm0C,GAAS,CAAChyE,EAAGpf,IAAgB,IAATof,EAAEpf,MAA0B,IAATof,EAAEpf,OAAgB,EAC/D,MAAMqxF,GACF,WAAAtjF,CAAYvQ,GACRiB,KAAKs2C,SAAW,GAChBt2C,KAAKq2C,UAAY,GACjBr2C,KAAK0S,OAAS,IAAIzC,WAAW,IAC7BjQ,KAAKw6B,EAAI,IAAIq4D,YAAY,IACzB7yF,KAAK8V,EAAI,IAAI+8E,YAAY,IACzB7yF,KAAK4pC,IAAM,IAAIipD,YAAY,GAC3B7yF,KAAK8G,IAAM,EACX9G,KAAK22C,UAAW,EAEhB,GADA53C,EAAM,GAAQA,GACF,IACZ,MAAM8nF,EAAK8L,GAAO5zF,EAAK,GACjB+nF,EAAK6L,GAAO5zF,EAAK,GACjBw1E,EAAKoe,GAAO5zF,EAAK,GACjBgoF,EAAK4L,GAAO5zF,EAAK,GACjBioF,EAAK2L,GAAO5zF,EAAK,GACjBkoF,EAAK0L,GAAO5zF,EAAK,IACjB+zF,EAAKH,GAAO5zF,EAAK,IACjBg0F,EAAKJ,GAAO5zF,EAAK,IAEvBiB,KAAKw6B,EAAE,GAAU,KAALqsD,EACZ7mF,KAAKw6B,EAAE,GAAiC,MAA1BqsD,IAAO,GAAOC,GAAM,GAClC9mF,KAAKw6B,EAAE,GAAiC,MAA1BssD,IAAO,GAAOvS,GAAM,GAClCv0E,KAAKw6B,EAAE,GAAgC,MAAzB+5C,IAAO,EAAMwS,GAAM,GACjC/mF,KAAKw6B,EAAE,GAAiC,KAA1BusD,IAAO,EAAMC,GAAM,IACjChnF,KAAKw6B,EAAE,GAAMwsD,IAAO,EAAK,KACzBhnF,KAAKw6B,EAAE,GAAiC,MAA1BwsD,IAAO,GAAOC,GAAM,GAClCjnF,KAAKw6B,EAAE,GAAiC,MAA1BysD,IAAO,GAAO6L,GAAM,GAClC9yF,KAAKw6B,EAAE,GAAgC,MAAzBs4D,IAAO,EAAMC,GAAM,GACjC/yF,KAAKw6B,EAAE,GAAMu4D,IAAO,EAAK,IACzB,IAAK,IAAIxxF,EAAI,EAAGA,EAAI,EAAGA,IACnBvB,KAAK4pC,IAAIroC,GAAKoxF,GAAO5zF,EAAK,GAAK,EAAIwC,EAC3C,CACA,OAAA6P,CAAQu4B,EAAMzmC,EAAQ8vF,GAAS,GAC3B,MAAMC,EAAQD,EAAS,EAAI,MACrB,EAAEl9E,EAAC,EAAE0kB,GAAMx6B,KACXkzF,EAAK14D,EAAE,GACP24D,EAAK34D,EAAE,GACP44D,EAAK54D,EAAE,GACP64D,EAAK74D,EAAE,GACP84D,EAAK94D,EAAE,GACP+4D,EAAK/4D,EAAE,GACPg5D,EAAKh5D,EAAE,GACPi5D,EAAKj5D,EAAE,GACPk5D,EAAKl5D,EAAE,GACPm5D,EAAKn5D,EAAE,GACPqsD,EAAK8L,GAAOhpD,EAAMzmC,EAAS,GAC3B4jF,EAAK6L,GAAOhpD,EAAMzmC,EAAS,GAC3BqxE,EAAKoe,GAAOhpD,EAAMzmC,EAAS,GAC3B6jF,EAAK4L,GAAOhpD,EAAMzmC,EAAS,GAC3B8jF,EAAK2L,GAAOhpD,EAAMzmC,EAAS,GAC3B+jF,EAAK0L,GAAOhpD,EAAMzmC,EAAS,IAC3B4vF,EAAKH,GAAOhpD,EAAMzmC,EAAS,IAC3B6vF,EAAKJ,GAAOhpD,EAAMzmC,EAAS,IACjC,IAAI0wF,EAAK99E,EAAE,IAAW,KAAL+wE,GACbgN,EAAK/9E,EAAE,IAAkC,MAA1B+wE,IAAO,GAAOC,GAAM,IACnCgN,EAAKh+E,EAAE,IAAkC,MAA1BgxE,IAAO,GAAOvS,GAAM,IACnCwf,EAAKj+E,EAAE,IAAiC,MAAzBy+D,IAAO,EAAMwS,GAAM,IAClCiN,EAAKl+E,EAAE,IAAkC,MAA1BixE,IAAO,EAAMC,GAAM,KAClCiN,EAAKn+E,EAAE,IAAOkxE,IAAO,EAAK,MAC1BkN,EAAKp+E,EAAE,IAAkC,MAA1BkxE,IAAO,GAAOC,GAAM,IACnCkN,EAAKr+E,EAAE,IAAkC,MAA1BmxE,IAAO,GAAO6L,GAAM,IACnCsB,EAAKt+E,EAAE,IAAiC,MAAzBg9E,IAAO,EAAMC,GAAM,IAClCsB,EAAKv+E,EAAE,IAAOi9E,IAAO,EAAKE,GAC1B9rF,EAAI,EACJmtF,EAAKntF,EAAIysF,EAAKV,EAAKW,GAAM,EAAIF,GAAMG,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GACjFrsF,EAAImtF,IAAO,GACXA,GAAM,KACNA,GAAML,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAAMe,GAAM,EAAIhB,GAAMiB,GAAM,EAAIlB,GAChFhsF,GAAKmtF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKptF,EAAIysF,EAAKT,EAAKU,EAAKX,EAAKY,GAAM,EAAIH,GAAMI,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAC3EtsF,EAAIotF,IAAO,GACXA,GAAM,KACNA,GAAMN,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAAMc,GAAM,EAAIf,GAAMgB,GAAM,EAAIjB,GAChFjsF,GAAKotF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKrtF,EAAIysF,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GACrEvsF,EAAIqtF,IAAO,GACXA,GAAM,KACNA,GAAMP,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAAMe,GAAM,EAAIhB,GAChFlsF,GAAKqtF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKttF,EAAIysF,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAAKc,GAAM,EAAIL,GAC/DxsF,EAAIstF,IAAO,GACXA,GAAM,KACNA,GAAMR,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAAMc,GAAM,EAAIf,GAChFnsF,GAAKstF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKvtF,EAAIysF,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,EAAKd,EAC1D/rF,EAAIutF,IAAO,GACXA,GAAM,KACNA,GAAMT,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAChFpsF,GAAKutF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKxtF,EAAIysF,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAC1DhsF,EAAIwtF,IAAO,GACXA,GAAM,KACNA,GAAMV,EAAKf,EAAKgB,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAC1ErsF,GAAKwtF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKztF,EAAIysF,EAAKJ,EAAKK,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAC1DjsF,EAAIytF,IAAO,GACXA,GAAM,KACNA,GAAMX,EAAKd,EAAKe,EAAKhB,EAAKiB,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GACpEtsF,GAAKytF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK1tF,EAAIysF,EAAKH,EAAKI,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAC1DlsF,EAAI0tF,IAAO,GACXA,GAAM,KACNA,GAAMZ,EAAKb,EAAKc,EAAKf,EAAKgB,EAAKjB,EAAKkB,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAC9DvsF,GAAK0tF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK3tF,EAAIysF,EAAKF,EAAKG,EAAKJ,EAAKK,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAC1DnsF,EAAI2tF,IAAO,GACXA,GAAM,KACNA,GAAMb,EAAKZ,EAAKa,EAAKd,EAAKe,EAAKhB,EAAKiB,EAAKlB,EAAKmB,GAAM,EAAIV,GACxDxsF,GAAK2tF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK5tF,EAAIysF,EAAKD,EAAKE,EAAKH,EAAKI,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAC1DpsF,EAAI4tF,IAAO,GACXA,GAAM,KACNA,GAAMd,EAAKX,EAAKY,EAAKb,EAAKc,EAAKf,EAAKgB,EAAKjB,EAAKkB,EAAKnB,EACnD/rF,GAAK4tF,IAAO,GACZA,GAAM,KACN5tF,GAAMA,GAAK,GAAKA,EAAK,EACrBA,EAAKA,EAAImtF,EAAM,EACfA,EAAS,KAAJntF,EACLA,KAAU,GACVotF,GAAMptF,EACN2O,EAAE,GAAKw+E,EACPx+E,EAAE,GAAKy+E,EACPz+E,EAAE,GAAK0+E,EACP1+E,EAAE,GAAK2+E,EACP3+E,EAAE,GAAK4+E,EACP5+E,EAAE,GAAK6+E,EACP7+E,EAAE,GAAK8+E,EACP9+E,EAAE,GAAK++E,EACP/+E,EAAE,GAAKg/E,EACPh/E,EAAE,GAAKi/E,CACX,CACA,QAAAt/E,GACI,MAAM,EAAEK,EAAC,IAAE8zB,GAAQ5pC,KACbs0E,EAAI,IAAIue,YAAY,IAC1B,IAAI1rF,EAAI2O,EAAE,KAAO,GACjBA,EAAE,IAAM,KACR,IAAK,IAAIvU,EAAI,EAAGA,EAAI,GAAIA,IACpBuU,EAAEvU,IAAM4F,EACRA,EAAI2O,EAAEvU,KAAO,GACbuU,EAAEvU,IAAM,KAEZuU,EAAE,IAAU,EAAJ3O,EACRA,EAAI2O,EAAE,KAAO,GACbA,EAAE,IAAM,KACRA,EAAE,IAAM3O,EACRA,EAAI2O,EAAE,KAAO,GACbA,EAAE,IAAM,KACRA,EAAE,IAAM3O,EACRmtE,EAAE,GAAKx+D,EAAE,GAAK,EACd3O,EAAImtE,EAAE,KAAO,GACbA,EAAE,IAAM,KACR,IAAK,IAAI/yE,EAAI,EAAGA,EAAI,GAAIA,IACpB+yE,EAAE/yE,GAAKuU,EAAEvU,GAAK4F,EACdA,EAAImtE,EAAE/yE,KAAO,GACb+yE,EAAE/yE,IAAM,KAEZ+yE,EAAE,IAAM,KACR,IAAIz1D,GAAY,EAAJ1X,GAAS,EACrB,IAAK,IAAI5F,EAAI,EAAGA,EAAI,GAAIA,IACpB+yE,EAAE/yE,IAAMsd,EACZA,GAAQA,EACR,IAAK,IAAItd,EAAI,EAAGA,EAAI,GAAIA,IACpBuU,EAAEvU,GAAMuU,EAAEvU,GAAKsd,EAAQy1D,EAAE/yE,GAC7BuU,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,GAAK8zB,EAAI,GACnB9zB,EAAE,GAAS,MAAJb,EACP,IAAK,IAAI1T,EAAI,EAAGA,EAAI,EAAGA,IACnB0T,GAAOa,EAAEvU,GAAKqoC,EAAIroC,GAAM,IAAM0T,IAAM,IAAO,EAC3Ca,EAAEvU,GAAS,MAAJ0T,EAEX87E,GAAMzc,EACV,CACA,MAAAx1E,CAAO6qC,GACH,GAAQ3pC,MACR,MAAM,OAAE0S,EAAM,SAAE4jC,GAAat2C,KAEvBoC,GADNunC,EAAO,GAAQA,IACEloC,OACjB,IAAK,IAAIqF,EAAM,EAAGA,EAAM1E,GAAM,CAC1B,MAAM81C,EAAOjvC,KAAKC,IAAIotC,EAAWt2C,KAAK8G,IAAK1E,EAAM0E,GAEjD,GAAIoxC,IAAS5B,EAKb5jC,EAAOpT,IAAIqqC,EAAK1nB,SAASnb,EAAKA,EAAMoxC,GAAOl4C,KAAK8G,KAChD9G,KAAK8G,KAAOoxC,EACZpxC,GAAOoxC,EACHl4C,KAAK8G,MAAQwvC,IACbt2C,KAAKoR,QAAQsB,EAAQ,GAAG,GACxB1S,KAAK8G,IAAM,QATX,KAAOwvC,GAAYl0C,EAAM0E,EAAKA,GAAOwvC,EACjCt2C,KAAKoR,QAAQu4B,EAAM7iC,EAU/B,CACA,OAAO9G,IACX,CACA,OAAAyL,GACIslF,GAAM/wF,KAAK8V,EAAG9V,KAAKw6B,EAAGx6B,KAAK0S,OAAQ1S,KAAK4pC,IAC5C,CACA,UAAAyO,CAAWxO,GACP,GAAQ7pC,MHlMhB,SAAgB6pC,EAAK2M,GACjB1nC,GAAM+6B,GACN,MAAM3gC,EAAMstC,EAASH,UACrB,GAAIxM,EAAIpoC,OAASyH,EACb,MAAM,IAAI1K,MAAM,yDAAyD0K,IAEjF,CG6LQ,CAAQ2gC,EAAK7pC,MACbA,KAAK22C,UAAW,EAChB,MAAM,OAAEjkC,EAAM,EAAEoD,GAAM9V,KACtB,IAAI,IAAE8G,GAAQ9G,KACd,GAAI8G,EAAK,CAEL,IADA4L,EAAO5L,KAAS,EACTA,EAAM,GAAIA,IACb4L,EAAO5L,GAAO,EAClB9G,KAAKoR,QAAQsB,EAAQ,GAAG,EAC5B,CACA1S,KAAKyV,WACL,IAAIu/E,EAAO,EACX,IAAK,IAAIzzF,EAAI,EAAGA,EAAI,EAAGA,IACnBsoC,EAAImrD,KAAUl/E,EAAEvU,KAAO,EACvBsoC,EAAImrD,KAAUl/E,EAAEvU,KAAO,EAE3B,OAAOsoC,CACX,CACA,MAAAh0B,GACI,MAAM,OAAEnD,EAAM,UAAE2jC,GAAcr2C,KAC9BA,KAAKq4C,WAAW3lC,GAChB,MAAMkzB,EAAMlzB,EAAOxR,MAAM,EAAGm1C,GAE5B,OADAr2C,KAAKyL,UACEm6B,CACX,EAUG,MAAMqvD,GARN,SAAgC39C,GACnC,MAAMC,EAAQ,CAACC,EAAKz4C,IAAQu4C,EAASv4C,GAAKD,OAAO,GAAQ04C,IAAM3hC,SACzD4hC,EAAMH,EAAS,IAAIrnC,WAAW,KAIpC,OAHAsnC,EAAMlB,UAAYoB,EAAIpB,UACtBkB,EAAMjB,SAAWmB,EAAInB,SACrBiB,EAAM34C,OAAUG,GAAQu4C,EAASv4C,GAC1Bw4C,CACX,CACwB29C,EAAwBn2F,GAAQ,IAAI6zF,GAAS7zF,KCvPrE,SAASo2F,GAAWpyF,EAAG21B,EAAGllB,EAAGq2B,EAAKurD,EAAKvD,EAAS,IAC5C,IAAIwD,EAAMtyF,EAAE,GAAIuyF,EAAMvyF,EAAE,GAAIwyF,EAAMxyF,EAAE,GAAIyyF,EAAMzyF,EAAE,GAChD0yF,EAAM/8D,EAAE,GAAIg9D,EAAMh9D,EAAE,GAAIi9D,EAAMj9D,EAAE,GAAIk9D,EAAMl9D,EAAE,GAC5Cm9D,EAAMn9D,EAAE,GAAIo9D,EAAMp9D,EAAE,GAAIq9D,EAAMr9D,EAAE,GAAIs9D,EAAMt9D,EAAE,GAC5Cu9D,EAAMb,EAAKc,EAAM1iF,EAAE,GAAI2iF,EAAM3iF,EAAE,GAAI4iF,EAAM5iF,EAAE,GAEvC6iF,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,IAAI57D,EAAI,EAAGA,EAAIq3D,EAAQr3D,GAAK,EAC7B67D,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,EACTxtD,EAAIwtD,KAAShC,EAAMgB,EAAO,EAC1BxsD,EAAIwtD,KAAS/B,EAAMgB,EAAO,EAC1BzsD,EAAIwtD,KAAS9B,EAAMgB,EAAO,EAC1B1sD,EAAIwtD,KAAS7B,EAAMgB,EAAO,EAC1B3sD,EAAIwtD,KAAS5B,EAAMgB,EAAO,EAC1B5sD,EAAIwtD,KAAS3B,EAAMgB,EAAO,EAC1B7sD,EAAIwtD,KAAS1B,EAAMgB,EAAO,EAC1B9sD,EAAIwtD,KAASzB,EAAMgB,EAAO,EAC1B/sD,EAAIwtD,KAASxB,EAAMgB,EAAO,EAC1BhtD,EAAIwtD,KAASvB,EAAMgB,EAAO,EAC1BjtD,EAAIwtD,KAAStB,EAAMgB,EAAO,EAC1BltD,EAAIwtD,KAASrB,EAAMgB,EAAO,EAC1BntD,EAAIwtD,KAASpB,EAAMgB,EAAO,EAC1BptD,EAAIwtD,KAASnB,EAAMgB,EAAO,EAC1BrtD,EAAIwtD,KAASlB,EAAMgB,EAAO,EAC1BttD,EAAIwtD,KAASjB,EAAMgB,EAAO,CAC9B,CAyFO,MASME,GAA2B/F,GAAa4D,GAAY,CAC7DvD,cAAc,EACdD,cAAe,EACfF,gBAAgB,IAOP8F,GAA4BhG,GAAa4D,GAAY,CAC9DvD,cAAc,EACdD,cAAe,EACfD,cAvGG,SAAiB3uF,EAAG21B,EAAGn3B,EAAGgxF,GAC7B,IAAI8D,EAAMtzF,EAAE,GAAIuzF,EAAMvzF,EAAE,GAAIwzF,EAAMxzF,EAAE,GAAIyzF,EAAMzzF,EAAE,GAAI0zF,EAAM/9D,EAAE,GAAIg+D,EAAMh+D,EAAE,GAAIi+D,EAAMj+D,EAAE,GAAIk+D,EAAMl+D,EAAE,GAAIm+D,EAAMn+D,EAAE,GAAIo+D,EAAMp+D,EAAE,GAAIq+D,EAAMr+D,EAAE,GAAIs+D,EAAMt+D,EAAE,GAAIu+D,EAAM11F,EAAE,GAAI21F,EAAM31F,EAAE,GAAI41F,EAAM51F,EAAE,GAAI61F,EAAM71F,EAAE,GAChM,IAAK,IAAIi5B,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACzB67D,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,EACT9E,EAAI8E,KAAQhB,EACZ9D,EAAI8E,KAAQf,EACZ/D,EAAI8E,KAAQd,EACZhE,EAAI8E,KAAQb,EACZjE,EAAI8E,KAAQJ,EACZ1E,EAAI8E,KAAQH,EACZ3E,EAAI8E,KAAQF,EACZ5E,EAAI8E,KAAQD,CAChB,EA2BI3F,gBAAgB,IAkBd+F,GAA0B,IAAIvnF,WAAW,IAEzCwnF,GAAe,CAAC3hF,EAAG0hC,KACrB1hC,EAAEhX,OAAO04C,GACT,MAAMnO,EAAOmO,EAAI/1C,OAAS,GACtB4nC,GACAvzB,EAAEhX,OAAO04F,GAAQv1E,SAASonB,GAAM,EAElCquD,GAA0B,IAAIznF,WAAW,IAC/C,SAAS0nF,GAAW93F,EAAId,EAAK+yF,EAAOnoD,EAAMiuD,GACtC,MAAMC,EAAUh4F,EAAGd,EAAK+yF,EAAO4F,IACzB5hF,EAAIm/E,GAASr2F,OAAOi5F,GACtBD,GACAH,GAAa3hF,EAAG8hF,GACpBH,GAAa3hF,EAAG6zB,GAChB,MAAM6C,EAAM,IAAIv8B,WAAW,IACrBgoC,GHlPiBpB,EGkPCrK,EHlPO,IAAIsK,SAASD,EAAInkC,OAAQmkC,EAAItP,WAAYsP,EAAIrmC,aAAtD,IAACqmC,EGmPvB,GAAaoB,EAAM,EAAGhS,OAAO2xD,EAAMA,EAAIn2F,OAAS,IAAI,GACpD,GAAaw2C,EAAM,EAAGhS,OAAO0D,EAAKloC,SAAS,GAC3CqU,EAAEhX,OAAO0tC,GACT,MAAM5G,EAAM9vB,EAAED,SAEd,OADAk7E,GAAM8G,EAASrrD,GACR5G,CACX,CAUO,MAAMkyD,GAAkBC,GAAc,CAACh5F,EAAK+yF,EAAO8F,KAEtD,GAAO74F,EAAK,IACZ,GAAO+yF,GACA,CACH,OAAAkG,CAAQC,EAAWz5C,GACf,MAAM05C,EAAUD,EAAUx2F,OACpB02F,EAAUD,EANN,GAON15C,EACA,GAAOA,EAAQ25C,GAGf35C,EAAS,IAAIvuC,WAAWkoF,GAE5BJ,EAAUh5F,EAAK+yF,EAAOmG,EAAWz5C,EAAQ,GACzC,MAAM3L,EAAM8kD,GAAWI,EAAWh5F,EAAK+yF,EAAOtzC,EAAOv8B,SAAS,GAAG,IAAa21E,GAG9E,OAFAp5C,EAAOl/C,IAAIuzC,EAAKqlD,GAChBnH,GAAMl+C,GACC2L,CACX,EACA,OAAA45C,CAAQC,EAAY75C,GAChB,MAAM25C,EAAUE,EAAW52F,OACrBy2F,EAAUC,EArBN,GAsBV,GAAIA,EAtBM,GAuBN,MAAM,IAAI35F,MAAM,4CAChBggD,EACA,GAAOA,EAAQ05C,GAGf15C,EAAS,IAAIvuC,WAAWioF,GAE5B,MAAMvuD,EAAO0uD,EAAWp2E,SAAS,GAAG,IAC9Bq2E,EAAYD,EAAWp2E,UAAS,IAChC4wB,EAAM8kD,GAAWI,EAAWh5F,EAAK+yF,EAAOnoD,EAAMiuD,GACpD,IH7JL,SAAoBj3E,EAAGC,GAC1B,GAAID,EAAElf,SAAWmf,EAAEnf,OACf,OAAO,EACX,IAAIiJ,EAAO,EACX,IAAK,IAAInJ,EAAI,EAAGA,EAAIof,EAAElf,OAAQF,IAC1BmJ,GAAQiW,EAAEpf,GAAKqf,EAAErf,GACrB,OAAgB,IAATmJ,CACX,CGsJiB,CAAW4tF,EAAWzlD,GACvB,MAAM,IAAIr0C,MAAM,eAGpB,OAFAu5F,EAAUh5F,EAAK+yF,EAAOnoD,EAAM6U,EAAQ,GACpCuyC,GAAMl+C,GACC2L,CACX,IAOK+5C,GAAmCzH,GAAW,CAAE0H,UAAW,GAAIC,YAAa,GAAIC,UAAW,IAAMZ,GAAeR,KAMdQ,GAAeP,ICtS9H,MAAMoB,GAA+B,IAAI1oF,WAAW,CAAC,IAC/C2oF,GAA+B,IAAI3oF,WAwDlC,MChFM4oF,GCGe,CACxBC,WAAWnvD,GACA,GAAOA,EAAK1nB,YAEvB,OAAA82E,CAAQC,EAAIC,GACR,MAAMC,EFMP,SAAiB9rF,EAAM6rF,EAAKE,GAO/B,OANA/iD,GAAMhpC,QAIOlO,IAATi6F,IACAA,EAAO,IAAIlpF,WAAW7C,EAAKipC,YACxBstC,GAAKv2E,EAAM6pC,GAAQkiD,GAAOliD,GAAQgiD,GAC7C,CEdoBG,CAAQ,GAAQH,EAAKD,GAE3BK,EFsBP,SAAgBjsF,EAAM8rF,EAAK3kD,EAAM9yC,EAAS,IAG7C,GAFA20C,GAAMhpC,GACN6oC,GAAQx0C,GACJA,EAAS,IAAM2L,EAAKipC,UACpB,MAAM,IAAI73C,MAAM,mCACpB,MAAM8V,EAASrL,KAAK01B,KAAKl9B,EAAS2L,EAAKipC,gBAC1Bn3C,IAATq1C,IACAA,EAAOqkD,IAEX,MAAMS,EAAM,IAAIppF,WAAWqE,EAASlH,EAAKipC,WAEnCktC,EAAOI,GAAK/kF,OAAOwO,EAAM8rF,GACzBI,EAAU/V,EAAKlsC,aACfukC,EAAI,IAAI3rE,WAAWszE,EAAKltC,WAC9B,IAAK,IAAI3J,EAAU,EAAGA,EAAUp4B,EAAQo4B,IACpCisD,GAAa,GAAKjsD,EAAU,EAG5B4sD,EAAQx6F,OAAmB,IAAZ4tC,EAAgBksD,GAAehd,GACzC98E,OAAOy1C,GACPz1C,OAAO65F,IACPtgD,WAAWujC,GAChByd,EAAI/5F,IAAIs8E,EAAGxuE,EAAKipC,UAAY3J,GAC5B62C,EAAKlsC,WAAWiiD,GAMpB,OAJA/V,EAAK93E,UACL6tF,EAAQ7tF,UACRmwE,EAAErjC,KAAK,GACPogD,GAAapgD,KAAK,GACX8gD,EAAIn4F,MAAM,EAAGO,EACxB,CErD2B83F,CAAO,GAAQL,OAAKh6F,EAAW,IAKlD,MAAO,CAHIm6F,EAAIp3E,SAAS,EAAG,IAChBo3E,EAAIp3E,SAAS,GAAI,IACjBo3E,EAAIp3E,SAAS,GAAI,IAEhC,EACA,qBAAAu3E,GACI,MAAMC,EAAYla,GAAOH,MAAMC,mBAE/B,MAAO,CACHhW,UAFckW,GAAOP,aAAaya,GAGlCrvB,WAAYqvB,EAEpB,EACAC,8BAA8BtP,IAEnB,CACH/gB,UAFckW,GAAOP,aAAaoL,GAGlChgB,WAAYggB,IAGpBuP,wBAAuB,CAACvvB,EAAYf,IACzBkW,GAAOkC,gBAAgBrX,EAAWnoD,WAAYonD,EAAUpnD,YAEnE23E,wBAAuB,CAAC3B,EAAWnG,EAAO+H,EAAInhE,IACnC6/D,GAAiB7/D,EAAGo5D,EAAO+H,GAAI7B,QAAQC,EAAUh2E,YAE5D63E,wBAAuB,CAACzB,EAAYvG,EAAO+H,EAAInhE,EAAGxX,IACvCq3E,GAAiB7/D,EAAGo5D,EAAO+H,GAAIzB,QAAQC,EAAWp2E,WAAYf,ICrChE64E,GAAkB/6F,IAC3B,MAAMkrB,EAAS,EAAsB,GAGrC,OAFAA,EAAO,GAAKlrB,GAAS,EACrBkrB,EAAO,GAAKlrB,EACLkrB,CAAM,EAEjB6vE,GAAejrF,MAAQ,EAChB,MAAMkrF,GAAkBrwD,IAC3B,GAAIA,EAAKloC,OAAS,EACd,MAAM+0B,WAAW,4BACrB,GAAImT,aAAgB15B,WAAY,CAC5B,IAAIjR,EAAQ,EAGZ,OAFAA,GAAS2qC,EAAK,IAAM,EACpB3qC,GAAS2qC,EAAK,GACP3qC,CACX,CACA,OAAO2qC,EAAK8S,UAAU,EAAE,EChBrB,SAASw9C,GAAmBl3F,EAAGm3F,GAC7BA,EAAU7vF,SAAYsmF,KAGvB5tF,GACAm3F,EAAU,2BAA2B,GAAmBn3F,EAAEsmE,UAAW,UACrE6wB,EAAU,4BAA4B,GAAmBn3F,EAAEqnE,WAAY,WAGvE8vB,EAAU,8BAElB,CACO,SAASC,GAAsBl2E,EAAGi2E,GAChCA,EAAU7vF,SAAYsmF,KAGvB1sE,GACAi2E,EAAU,8BAA8B,GAAmBj2E,EAAEolD,UAAW,UACxE6wB,EAAU,+BAA+B,GAAmBj2E,EAAEmmD,WAAY,WAG1E8vB,EAAU,iCAElB,CAYO,SAASE,GAAsB7xF,EAAI2xF,GACjCA,EAAU7vF,SAAYsmF,IAIvBuJ,EADA3xF,EACU,+BAA+B,GAAmBA,EAAG0Z,WAAY,SAGjE,iCAElB,CACO,SAASo4E,GAAeC,EAAKC,EAAKL,GAChCA,EAAU7vF,SAAYsmF,KAG3BuJ,EAAU,kBAAkBI,EAAI9mF,EAAEgnF,eAAeF,EAAI5hE,GAAK,GAAmB4hE,EAAI5hE,EAAG,UACpFwhE,EAAU,kBAAkBK,EAAI/mF,EAAEgnF,eAAeD,EAAI7hE,GAAK,GAAmB6hE,EAAI7hE,EAAG,UACxF,CDlCAshE,GAAelrF,MAAQ,EEpBhB,MAAM,WAAmCtQ,MAC5CuW,KACA,WAAAzF,CAAY9C,EAAU,2BAClB4jC,MAAM5jC,GACNxM,KAAK+U,KAAO,GAA2BA,IAC3C,CACAk+C,YAAc,8BCQX,MAAMwnC,GACTjnF,EACA1E,MACAmpC,KACA,WAAA3oC,CAAYkE,EAjBS,GAkBjBxT,KAAKwT,EAAIA,EACTxT,KAAK8O,MAAQ,EAAgB,IAC7B9O,KAAKi4C,KAAO,IAAInB,SAAS92C,KAAK8O,MAAM4D,OAAQ1S,KAAK8O,MAAMy4B,WAAYvnC,KAAK8O,MAAM0B,YAC9ExQ,KAAKi4C,KAAKY,UAAU,EAAGrlC,GAAG,EAC9B,CACA,SAAAknF,GACI16F,KAAKwT,IAELxT,KAAKi4C,KAAKY,UAAU,EAAG74C,KAAKwT,GAAG,EACnC,CACA,QAAAmnF,GACI,OAAO36F,KAAK8O,KAChB,CACA,SAAA0rF,GACI,OAAOx6F,KAAKwT,CAChB,CACA,WAAAonF,GACI,GAAI56F,KAAKwT,EA5BQ,WA6Bb,MAAM,IAAIhV,MA5BA,uEA8BlB,EChCG,MAAMq8F,GAAU,EAAgB,GAChC,MAAMC,GACTpiE,EACAllB,EACA45B,OACA,WAAA99B,CAAY89B,EAAQ1U,OAAIx5B,EAAWsU,EAAI,GACnCxT,KAAKotC,OAASA,EACdptC,KAAK04B,EAAIA,EACT14B,KAAKwT,EAAI,IAAIinF,GAAMjnF,EACvB,CACA,MAAAunF,GACI,OAAOjuF,QAAQ9M,KAAK04B,EACxB,CACA,aAAAsiE,CAAcnB,EAAI5B,GACd,IAAKj4F,KAAK+6F,SACN,OAAO9C,EAEXj4F,KAAKwT,EAAEonF,cACP,MAAM32E,EAAIjkB,KAAKotC,OAAO4qD,QAAQC,EAAWj4F,KAAKwT,EAAEmnF,WAAYd,EAAI75F,KAAK04B,GAErE,OADA14B,KAAKwT,EAAEknF,YACAz2E,CACX,CACA,aAAAg3E,CAAcpB,EAAIxB,EAAYn3E,GAC1B,IAAKlhB,KAAK+6F,SACN,OAAO1C,EAEXr4F,KAAKwT,EAAEonF,cACP,MAAM3C,EAAYj4F,KAAKotC,OAAOgrD,QAAQC,EAAYr4F,KAAKwT,EAAEmnF,WAAYd,EAAI75F,KAAK04B,EAAGxX,GAEjF,OADAlhB,KAAKwT,EAAEknF,YACAzC,CACX,EAEG,MAAMiD,GACTC,GACAnC,GACAljF,EACAs3B,OACA,WAAA99B,CAAY89B,EAAQguD,GAChBp7F,KAAKotC,OAASA,EACd,MAAMiuD,EAAoB,GAAqBD,EAAc,SAC7Dp7F,KAAK8V,EAuMb,SAA0Bs3B,EAAQguD,GAC9B,GAAIA,EAAa35F,QAAU,GAAI,CAC3B,MAAMqU,EAAI,EAAgB,IAE1B,OADAA,EAAExW,IAAI87F,GACCtlF,CACX,CAEI,OAAOs3B,EAAOhgC,KAAKguF,EAE3B,CAhNiBE,CAAiBluD,EAAQiuD,GAClCr7F,KAAKg5F,GAAKh5F,KAAK8V,EACf9V,KAAKm7F,GAAK,IAAIL,GAAY1tD,EAC9B,CACA,MAAAmuD,CAAOtC,GACH,MAAOD,EAAIwC,GAASx7F,KAAKotC,OAAOquD,KAAKz7F,KAAKg5F,GAAIC,GAC9Cj5F,KAAKg5F,GAAKA,EACVh5F,KAAKm7F,GAAK,IAAIL,GAAY96F,KAAKotC,OAAQouD,EAC3C,CACA,OAAAE,CAAQ/xD,GACJ3pC,KAAK8V,EAAI9V,KAAKotC,OAAOhgC,KAAK,IAAIyxC,GAAe7+C,KAAK8V,EAAG6zB,GACzD,CACA,cAAAgyD,CAAe1D,GACX,MAAMI,EAAar4F,KAAKm7F,GAAGH,cAAch7F,KAAK8V,EAAGmiF,GAEjD,OADAj4F,KAAK07F,QAAQrD,GACNA,CACX,CACA,cAAAuD,CAAevD,GACX,MAAMJ,EAAYj4F,KAAKm7F,GAAGF,cAAcj7F,KAAK8V,EAAGuiF,GAEhD,OADAr4F,KAAK07F,QAAQrD,GACNJ,CACX,CACA,KAAAvwF,GACI,MAAOm0F,EAAQC,GAAU97F,KAAKotC,OAAOquD,KAAKz7F,KAAKg5F,GAAI6B,IACnD,MAAO,CAAC,IAAIC,GAAY96F,KAAKotC,OAAQyuD,GAAS,IAAIf,GAAY96F,KAAKotC,OAAQ0uD,GAC/E,EAEG,MAAMC,GACTC,GACAj5F,EACAkhB,EACAg4E,GACA1zF,GACA2zF,UACA9uD,OACA,WAAA99B,CAAYzD,GACR,MAAM,OAAEuhC,EAAM,aAAEguD,EAAY,SAAEe,EAAQ,UAAED,EAAS,EAAEn5F,EAAC,EAAEkhB,EAAC,GAAEg4E,EAAE,GAAE1zF,GAAOsD,EACpE7L,KAAKotC,OAASA,EACdptC,KAAKg8F,GAAK,IAAId,GAAe9tD,EAAQguD,GACrCp7F,KAAKg8F,GAAGN,QAAQS,GAChBn8F,KAAKk8F,UAAYA,EACjBl8F,KAAK+C,EAAIA,EACT/C,KAAKikB,EAAIA,EACTjkB,KAAKi8F,GAAKA,EACVj8F,KAAKuI,GAAKA,CACd,CACA,MAAA6zF,GACI,GAAIp8F,KAAKikB,EACL,MAAM,IAAIzlB,MAAM,oCAEpB,MAAMylB,EAAIjkB,KAAKotC,OAAOivD,kBAGtB,OAFAr8F,KAAKg8F,GAAGN,QAAQz3E,EAAEolD,WAClBrpE,KAAKikB,EAAIA,EACFA,EAAEolD,SACb,CACA,MAAAizB,GACI,IAAKt8F,KAAK+C,EACN,MAAM,IAAIvE,MAAM,6BAEpB,OAAOwB,KAAKg8F,GAAGL,eAAe37F,KAAK+C,EAAEsmE,UACzC,CACA,OAAAkzB,GACI,IAAKv8F,KAAKikB,EACN,MAAM,IAAIzlB,MAAM,gCAEpB,IAAKwB,KAAKuI,GACN,MAAM,IAAI/J,MAAM,0CAEpBwB,KAAKg8F,GAAGT,OAAOv7F,KAAKotC,OAAOovD,GAAGx8F,KAAKikB,EAAGjkB,KAAKuI,IAC/C,CACA,OAAAk0F,GACI,GAAIz8F,KAAKk8F,UAAW,CAChB,IAAKl8F,KAAKikB,EACN,MAAM,IAAIzlB,MAAM,gCAEpB,IAAKwB,KAAKi8F,GACN,MAAM,IAAIz9F,MAAM,uCAEpBwB,KAAKg8F,GAAGT,OAAOv7F,KAAKotC,OAAOovD,GAAGx8F,KAAKikB,EAAGjkB,KAAKi8F,IAC/C,KACK,CACD,IAAKj8F,KAAK+C,EACN,MAAM,IAAIvE,MAAM,6BAEpB,IAAKwB,KAAKuI,GACN,MAAM,IAAI/J,MAAM,0CAEpBwB,KAAKg8F,GAAGT,OAAOv7F,KAAKotC,OAAOovD,GAAGx8F,KAAK+C,EAAG/C,KAAKuI,IAC/C,CACJ,CACA,OAAAm0F,GACI,GAAI18F,KAAKk8F,UAAW,CAChB,IAAKl8F,KAAK+C,EACN,MAAM,IAAIvE,MAAM,6BAEpB,IAAKwB,KAAKuI,GACN,MAAM,IAAI/J,MAAM,0CAEpBwB,KAAKg8F,GAAGT,OAAOv7F,KAAKotC,OAAOovD,GAAGx8F,KAAK+C,EAAG/C,KAAKuI,IAC/C,KACK,CACD,IAAKvI,KAAKikB,EACN,MAAM,IAAIzlB,MAAM,gCAEpB,IAAKwB,KAAKi8F,GACN,MAAM,IAAIz9F,MAAM,uCAEpBwB,KAAKg8F,GAAGT,OAAOv7F,KAAKotC,OAAOovD,GAAGx8F,KAAKikB,EAAGjkB,KAAKi8F,IAC/C,CACJ,CACA,KAAAU,CAAMnwF,EAAStJ,EAAS,GACpB,GAAIlD,KAAKuI,GACL,MAAM,IAAI/J,MAAM,8CAEpB,GAAIgO,EAAQgE,WAAatN,EAAS,GAC9B,MAAM,IAAI1E,MAAM,8BAEpBwB,KAAKuI,GAAKiE,EAAQizC,QAAQv8C,EAAQA,EAAS,IAC3ClD,KAAKg8F,GAAGN,QAAQ17F,KAAKuI,GACzB,CACA,KAAAq0F,CAAMpwF,EAAStJ,EAAS,GACpB,GAAIlD,KAAKi8F,GACL,MAAM,IAAIz9F,MAAM,2CAEpB,MAAMq+F,EAAe,IAAM78F,KAAKg8F,GAAGb,GAAGJ,SAAW,GAAK,GACtD,GAAIvuF,EAAQgE,WAAatN,EAAS25F,EAC9B,MAAM,IAAIr+F,MAAM,8BAEpB,MAAMs+F,EAAOtwF,EAAQizC,QAAQv8C,EAAQA,EAAS25F,GAE9C,OADA78F,KAAKi8F,GAAKj8F,KAAKg8F,GAAGJ,eAAekB,GAC1BD,CACX,CACA,MAAAE,GACI/8F,KAAKu8F,SACT,CACA,MAAAS,GACIh9F,KAAKy8F,SACT,CACA,MAAAQ,GACIj9F,KAAK08F,SACT,EAKG,MAAMQ,WAAyBnB,GAElC,aAAAoB,CAAcrqD,GACV,OAAO,IAAI+L,GAAe7+C,KAAKo8F,SAAUp8F,KAAKg8F,GAAGL,eAAe7oD,GACpE,CAEA,aAAAsqD,CAActqD,GACV,MAAM7uB,EAAIjkB,KAAKo8F,SACfp8F,KAAKu8F,UACL,MAAMc,EAAOr9F,KAAKs8F,SAElB,OADAt8F,KAAKy8F,UACE,IAAI59C,GAAe56B,EAAGo5E,EAAMr9F,KAAKg8F,GAAGL,eAAe7oD,GAC9D,CAEA,aAAAwqD,CAAcxqD,GACV,MAAMuqD,EAAOr9F,KAAKs8F,SAElB,OADAt8F,KAAK08F,UACE,IAAI79C,GAAew+C,EAAMr9F,KAAKg8F,GAAGL,eAAe7oD,GAC3D,CAEA,YAAAyqD,CAAa/wF,GACT,IAEI,OADAxM,KAAK28F,MAAMnwF,GACJxM,KAAKg8F,GAAGJ,eAAepvF,EAAQizC,QAAQ,IAClD,CACA,MAAOx7B,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEzX,UACjF,CACJ,CAEA,YAAAgxF,CAAahxF,GACT,IACIxM,KAAK28F,MAAMnwF,GACXxM,KAAK+8F,SACL,MAAMU,EAAWz9F,KAAK48F,MAAMpwF,EAAS,IAErC,OADAxM,KAAKg9F,SACEh9F,KAAKg8F,GAAGJ,eAAepvF,EAAQizC,QAAQ,GAAKg+C,GACvD,CACA,MAAOx5E,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEzX,UACjF,CACJ,CAEA,YAAAkxF,CAAalxF,GACT,IACI,MAAMixF,EAAWz9F,KAAK48F,MAAMpwF,GAE5B,OADAxM,KAAKi9F,SACEj9F,KAAKg8F,GAAGJ,eAAepvF,EAAQizC,QAAQg+C,GAClD,CACA,MAAOx5E,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEzX,UACjF,CACJ,EC7OG,IAAImxF,GAgDAC,GCjDJzwD,eAAe0wD,GAAuBzzB,EAAY0zB,EAAiB1xE,GACtE,MAAM2xE,QAAoB3zB,EAAW9rD,KAAK0/E,GAAoBF,IAC9D,OAAOF,GAAsB1oF,OAAO,CAChC+oF,YAAav0B,GAAoBU,EAAWf,WAC5C00B,cACA3xE,cAER,CACO+gB,eAAe+wD,GAAuBC,EAAcC,EAAiBC,GACxE,IACI,MAAMvrD,EAAU8qD,GAAsB5hF,OAAOmiF,GACvC90B,EAAYqlB,GAAsB57C,EAAQmrD,aAChD,IAA6C,IAAzCI,GAAmB/vD,OAAO+6B,GAC1B,MAAM,IAAI7qE,MAAM,wBAAwB6qE,iDAAyDg1B,KAErG,IAAKD,EACD,MAAM,IAAI5/F,MAAM,gCAEpB,MAAM8/F,EAAmBN,GAAoBI,GAC7C,UAAY/0B,EAAU7pD,OAAO8+E,EAAkBxrD,EAAQirD,aACnD,MAAM,IAAIv/F,MAAM,6BAEpB,OAAOs0C,CACX,CACA,MAAO7uB,GACH,MAAM,IAAI0iD,GAAoB1iD,EAAEzX,QACpC,CACJ,CACO,SAASwxF,GAAoB30B,GAChC,MAAM3pE,EAAS,GAAqB,4BACpC,OAAI2pE,aAAqBp5D,WACd,GAAiB,CAACvQ,EAAQ2pE,GAAY3pE,EAAO+B,OAAS4nE,EAAU5nE,SAE3E4nE,EAAUpqB,QAAQv/C,GACX2pE,EACX,EDjCA,SAAWs0B,GACP,IAAItrD,EACJsrD,EAAgBt2D,MAAQ,KACN,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAE4B,MAA9B1Q,EAAIgsF,uBACJ,IAAK,MAAMv/F,KAASuT,EAAIgsF,uBACpBxqF,EAAE1D,OAAO,IACT0D,EAAEjF,MAAM9P,IAGa,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,KACR,MAAM8Q,EAAM,CACRgsF,uBAAwB,IAEtBt3F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACXwiC,IAAQ,GACP,EACDtgC,EAAIgsF,uBAAuB/9F,KAAK8e,EAAOxQ,SAIvCwQ,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXsrD,EAAgBzoF,OAAU3C,GACf89B,GAAc99B,EAAKorF,EAAgBt2D,SAE9Cs2D,EAAgB3hF,OAAUxM,GACf43B,EAAc53B,EAAKmuF,EAAgBt2D,QAEjD,CA9CD,CA8CGs2D,KAAoBA,GAAkB,CAAC,IAE1C,SAAWC,GACP,IAAIvrD,EACJurD,EAAsBv2D,MAAQ,KACZ,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEkB,MAAnB1Q,EAAI0rF,aAAuB1rF,EAAI0rF,YAAYztF,WAAa,IACzDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0rF,cAEQ,MAAnB1rF,EAAIwrF,aAAuBxrF,EAAIwrF,YAAYvtF,WAAa,IACzDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwrF,cAEM,MAAlBxrF,EAAI6Z,aACJrY,EAAE1D,OAAO,IACTstF,GAAgBt2D,QAAQnyB,OAAO3C,EAAI6Z,WAAYrY,KAEtB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,KACR,MAAM8Q,EAAM,CACR0rF,YAAa,EAAgB,GAC7BF,YAAa,EAAgB,IAE3B92F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI0rF,YAAc3+E,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAIwrF,YAAcz+E,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAI6Z,WAAauxE,GAAgBt2D,QAAQrrB,OAAOsD,EAAQA,EAAOjP,UAC/D,MAEJ,QACIiP,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXurD,EAAsB1oF,OAAU3C,GACrB89B,GAAc99B,EAAKqrF,EAAsBv2D,SAEpDu2D,EAAsB5hF,OAAUxM,GACrB43B,EAAc53B,EAAKouF,EAAsBv2D,QAEvD,CA7DD,CA6DGu2D,KAA0BA,GAAwB,CAAC,IEtG/C,MAAMY,GACTz2C,SAAW,SACX3a,OACA+uD,SACAsC,UACAryE,WACAsyE,QACAt2C,WACA,WAAA94C,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B,MAAM,eAAE8yF,EAAc,WAAEvyE,EAAU,OAAEghB,EAAM,cAAEwxD,GAAkB/yF,GACxD,QAAE6yF,GAAYt2C,EACpBpoD,KAAKooD,WAAaA,EAClB,MAAMy2C,EAAUzxD,GAAUyrD,GAC1B74F,KAAKotC,OC5BN,SAAoBA,GACvB,MAAO,CACHivD,gBAAiBjvD,EAAOosD,sBACxBgD,GAAI,CAACsC,EAASz1B,IAAcj8B,EAAOusD,wBAAwBmF,EAAQ10B,WAAYf,GAAWpnD,SAAS,EAAG,IACtG+1E,QAAS5qD,EAAOwsD,wBAChBxB,QAAShrD,EAAO0sD,wBAChB1sF,KAAMggC,EAAO0rD,WACb2C,KAAMruD,EAAO2rD,QAErB,CDmBsBgG,CAAWF,GACzB7+F,KAAKosB,WAAaA,EAClBpsB,KAAK0+F,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,QAAWx/F,EAGhDc,KAAKy+F,UAFLE,EAEiBE,EAAQnF,8BAA8BiF,GAGtCE,EAAQrF,wBAE7Bx5F,KAAKm8F,SAAWyC,GAAiB,EAAgB,EACrD,CACA,CAACn7D,OAAOqB,aAAe,0BACvB,CAACgqD,IAAuB,CACpB,gCACA,2BAUJ,oBAAM0Q,CAAel4C,EAAYrtC,GAC7B,MAAMwlF,EAAoBrP,GAAS9oC,EAAY,CAC3ChG,cAAey4C,GACf93C,cAAe+3C,GACf73C,cAAeuuC,KAEbgP,QAAkB1/F,KAAK2/F,0BAA0BF,EAAmBz/F,KAAKooD,WAAWgiB,WAAYnwD,GAASywC,YAAY2e,UAAWpvD,GAChIs9C,QAAav3D,KAAK4/F,uBAAuBH,EAAmBC,GAClEp4C,EAAWnhD,OAASoxD,EAAKpxD,OACzBmhD,EAAWxB,KAAOyR,EAAKzR,KACvB,MAAMujB,EAAYqlB,GAAsBgR,EAAU5sD,QAAQmrD,aAC1D,MAAO,CACH1mC,KAAMjQ,EACNu4C,iBAAkBH,EAAU5sD,QAAQ1mB,WACpCs+B,WAAY+kC,GAAoBpmB,GAExC,CASA,mBAAMy2B,CAAcx4C,EAAYrtC,GAC5B,MAAMwlF,EAAoBrP,GAAS9oC,EAAY,CAC3ChG,cAAey4C,GACf93C,cAAe+3C,GACf73C,cAAeuuC,KAEbgP,QAAkB1/F,KAAK+/F,0BAA0BN,EAAmBz/F,KAAKooD,WAAWgiB,WAAYnwD,GAASywC,YAAY2e,UAAWpvD,GAChIs9C,QAAav3D,KAAK4/F,uBAAuBH,EAAmBC,GAClEp4C,EAAWnhD,OAASoxD,EAAKpxD,OACzBmhD,EAAWxB,KAAOyR,EAAKzR,KACvB,MAAMujB,EAAYqlB,GAAsBgR,EAAU5sD,QAAQmrD,aAC1D,MAAO,CACH1mC,KAAMjQ,EACNu4C,iBAAkBH,EAAU5sD,QAAQ1mB,WACpCs+B,WAAY+kC,GAAoBpmB,GAExC,CAIA,+BAAMs2B,CAA0Br4C,EAEhC8iB,EAAYi0B,EAAmBpkF,GAC3B,IAAInF,EACJ,IACIA,QGpGLq4B,eAAyCthC,EAAMoO,GAClD,MAAM,IAAE7O,EAAG,WAAEk8C,EAAU,OAAEla,EAAM,WAAEg9B,EAAU,SAAE+xB,EAAQ,EAAEp5F,EAAC,kBAAEs7F,EAAiB,WAAEjyE,GAAevgB,EACtFinC,QAAgB+qD,GAAuBzzB,EAAYrnE,EAAEsmE,UAAWj9C,GAChE4zE,EAAK,IAAI9C,GAAiB,CAC5B9vD,SACAguD,aAAc,mCACdc,WAAW,EACXC,WACAp5F,MAEJk3F,GAAmB+F,EAAGj9F,EAAGqI,GACzBA,EAAI60F,MAAM,6DACJ34C,EAAW53C,MAAMswF,EAAG7C,cAActC,IAAU5gF,GAClD7O,EAAI60F,MAAM,uDACV9F,GAAsB6F,EAAG/7E,EAAG7Y,GAC5BA,EAAI60F,MAAM,0EACV,MAAMhI,EAAY+H,EAAGxC,mBAAmBl2C,EAAWpqC,KAAKjD,ITOrD,IAA4BgiF,EAAI/B,ESNnC9uF,EAAI60F,MAAM,6CACV7F,GAAsB4F,EAAGz3F,GAAI6C,GTKE6wF,ESJZ+D,EAAG/D,ITIa/B,ESJT9uF,GTKXf,SAAYsmF,IAIvBuJ,EADA+B,EACU,4BAA4B,GAAmBA,EAAGh6E,WAAY,SAG9D,qCSXd7W,EAAI60F,MAAM,kDACV,MAAMC,QAAwBhC,GAAuBjG,EAAW+H,EAAG/D,GAAIoC,GACvEjzF,EAAI60F,MAAM,gCACV70F,EAAI60F,MAAM,8DACJ34C,EAAW53C,MAAMswF,EAAG1C,cAAcxqD,GAAU74B,GAClD7O,EAAI60F,MAAM,yDACV,MAAO3F,EAAKC,GAAOyF,EAAGhE,GAAGt0F,QAEzB,OADA2yF,GAAeC,EAAKC,EAAKnvF,GAClB,CACH0nC,QAASotD,EACTlI,QAAUC,GAAcqC,EAAIU,cAAcH,GAAS5C,GACnDG,QAAS,CAACC,EAAYn3E,IAAQq5E,EAAIU,cAAcJ,GAASxC,EAAYn3E,GAE7E,CHmE2By+E,CAA0B,CACrCr4C,aACA8iB,aACAi0B,oBACAjzF,IAAKpL,KAAKooD,WAAW5K,OAAO2iD,aAAa,4BACzC/yD,OAAQptC,KAAKotC,OACb+uD,SAAUn8F,KAAKm8F,SACfp5F,EAAG/C,KAAKy+F,UACRryE,WAAYpsB,KAAKosB,YAClBnS,GACHja,KAAK0+F,SAASM,qBAAqBtE,WACvC,CACA,MAAOz2E,GAEH,MADAjkB,KAAK0+F,SAASS,kBAAkBzE,YAC1Bz2E,CACV,CACA,OAAOnP,CACX,CAIA,+BAAMirF,CAA0Bz4C,EAAY8iB,EAAYi0B,EAAmBpkF,GACvE,IAAInF,EACJ,IACIA,QG1FLq4B,eAAyCthC,EAAMoO,GAClD,MAAM,IAAE7O,EAAG,WAAEk8C,EAAU,OAAEla,EAAM,WAAEg9B,EAAU,SAAE+xB,EAAQ,EAAEp5F,EAAC,kBAAEs7F,EAAiB,WAAEjyE,GAAevgB,EACtFinC,QAAgB+qD,GAAuBzzB,EAAYrnE,EAAEsmE,UAAWj9C,GAChE4zE,EAAK,IAAI9C,GAAiB,CAC5B9vD,SACAguD,aAAc,mCACdc,WAAW,EACXC,WACAp5F,MAEJk3F,GAAmB+F,EAAGj9F,EAAGqI,GACzBA,EAAI60F,MAAM,yDACVD,EAAGzC,mBAAmBj2C,EAAWpqC,KAAKjD,IACtC7O,EAAI60F,MAAM,+CACV7F,GAAsB4F,EAAGz3F,GAAI6C,GAC7BA,EAAI60F,MAAM,2FACJ34C,EAAW53C,MAAMswF,EAAG5C,cAActqD,GAAU74B,GAClD7O,EAAI60F,MAAM,8EACV9F,GAAsB6F,EAAG/7E,EAAG7Y,GAC5BA,EAAI60F,MAAM,8DACV,MAAMhI,EAAY+H,EAAGtC,mBAAmBp2C,EAAWpqC,KAAKjD,IACxD7O,EAAI60F,MAAM,iEACV,MAAMC,QAAwBhC,GAAuBjG,EAAW+H,EAAG/D,GAAIoC,IAChE/D,EAAKC,GAAOyF,EAAGhE,GAAGt0F,QAEzB,OADA2yF,GAAeC,EAAKC,EAAKnvF,GAClB,CACH0nC,QAASotD,EACTlI,QAAUC,GAAcsC,EAAIS,cAAcH,GAAS5C,GACnDG,QAAS,CAACC,EAAYn3E,IAAQo5E,EAAIW,cAAcJ,GAASxC,EAAYn3E,GAE7E,CH4D2B6+E,CAA0B,CACrCz4C,aACA8iB,aACAi0B,oBACAjzF,IAAKpL,KAAKooD,WAAW5K,OAAO2iD,aAAa,4BACzC/yD,OAAQptC,KAAKotC,OACb+uD,SAAUn8F,KAAKm8F,SACfp5F,EAAG/C,KAAKy+F,UACRryE,WAAYpsB,KAAKosB,YAClBnS,GACHja,KAAK0+F,SAASM,qBAAqBtE,WACvC,CACA,MAAOz2E,GAEH,MADAjkB,KAAK0+F,SAASS,kBAAkBzE,YAC1Bz2E,CACV,CACA,OAAOnP,CACX,CACA,4BAAM8qF,CAAuBt4C,EAAYo4C,GAErC,MAAOU,EAAQC,GI/IhB,WACH,MAAM1/E,EAAIitE,KACJhtE,EAAIgtE,KACV,MAAO,CACH,CACIznF,OAAQwa,EAAExa,OACV2/C,KAAMllC,EAAEklC,MAEZ,CACI3/C,OAAQya,EAAEza,OACV2/C,KAAMnlC,EAAEmlC,MAGpB,CJkI+Bw6C,GACjBjxC,EAAU/H,EAAW2oC,SAQ3B,aAPMzqC,GAAK46C,EKhJZ,SAAuBV,EAAWhB,GACrC,OAAOvxD,gBAAiBhnC,GACpB,UAAW,MAAMkX,KAASlX,EACtB,IAAK,IAAI5E,EAAI,EAAGA,EAAI8b,EAAM5b,OAAQF,GrBPQmvF,MqBOqC,CAC3E,IAII/mD,EAJA1iC,EAAM1F,ErBR4BmvF,MqBSlCzpF,EAAMoW,EAAM5b,SACZwF,EAAMoW,EAAM5b,QAIZkoC,EADAtsB,aAAiBpN,WACVyvF,EAAU1H,QAAQ36E,EAAM4E,SAAS1gB,EAAG0F,IAGpCy4F,EAAU1H,QAAQ36E,EAAMoiC,QAAQl+C,EAAG0F,IAE9Cy3F,GAASU,iBAAiB1E,kBACpB,IAAI77C,GAAek7C,GAAepwD,EAAKn5B,YAAam5B,EAC9D,CAER,CACJ,CL6HQ42D,CAAcb,EAAW1/F,KAAK0+F,SAC9BrvC,GACClpD,GAAW,GAAOA,EAAQ,CAAE87C,cAAe+3C,MK7H7C,SAAuB0F,EAAWhB,GACrC,OAAOvxD,gBAAiBhnC,GACpB,UAAW,MAAMkX,KAASlX,EACtB,IAAK,IAAI5E,EAAI,EAAGA,EAAI8b,EAAM5b,OAAQF,GAAKmvF,GAA4B,CAC/D,IAAIzpF,EAAM1F,EAAImvF,GAId,GAHIzpF,EAAMoW,EAAM5b,SACZwF,EAAMoW,EAAM5b,QAEZwF,EAhCM,GAgCoB1F,EAC1B,MAAM,IAAI/C,MAAM,iBAEpB,MAAMgiG,EAAYnjF,EAAMoiC,QAAQl+C,EAAG0F,GAK7Bia,EAAM7D,EAAM4E,SAAS1gB,EAAG0F,EAxCpB,IAyCV,IACI,MAAMgxF,EAAYyH,EAAUtH,QAAQoI,EAAWt/E,GAC/Cw9E,GAASW,iBAAiB3E,kBACpBzC,CACV,CACA,MAAOh0E,GAEH,MADAy6E,GAASY,cAAc5E,YACjBz2E,CACV,CACJ,CAER,CACJ,CLiGQw8E,CAAcf,EAAW1/F,KAAK0+F,SAC9B0B,GAEOC,CACX,EMtHG,SAASK,GAAM70F,EAAO,CAAC,GAC1B,OAAQu8C,GAAe,IAAIo2C,GAAMp2C,EAAYv8C,EACjD,CCtBO,MAAM80F,GAAsBl9D,OAAOmL,IAAI,0BCfjCgyD,GAAO,GAAK,QACZC,GAAO,GAAK,QACZC,GAAU,GAAK,WACf,GAAM,GAAG,GAAK,OAAQA,GAASF,GAAMC,IACrCE,GAAK,GAAG,GAAK,OAAQ,GAAK,QAC1BC,GAAM,GAAGC,GAAIF,GAAI,GAAK,QAASE,GAAI,GAAK,GAAK,SAC7CC,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,GAAI,GAAK,GAAK,QAC9C,GAAa,GAAGA,GAAIK,GAAa,GAAK,QAASA,IACtDC,GAAoB,GAAGN,GAAID,GAAK,GAAK,QAASC,GAAI,GAAK,GAAK,QAASA,GAAID,GAAK,GAAK,OAAQ,GAAK,OAAQC,GAAI,GAAK,GAAK,OAAQ,GAAK,QAC5H,GAAmB,GAAGA,GAAIM,GAAmB,GAAK,QAASA,IAC3DC,GAAO,GAAGP,GAAID,GAAK,GAAK,SAAUC,GAAIF,GAAI,GAAK,SAAUE,GAAI,GAAK,GAAK,UACvEQ,GAAQ,GAAGR,GAAID,GAAK,GAAK,UAAWC,GAAIF,GAAI,GAAK,UAAWE,GAAI,GAAK,GAAK,WACjFS,GAAgBT,GAAIC,GAAK,GAAK,iBAAkB,GAAK,aAC9CS,GAAe,GAAGV,GAAIS,GAAe,GAAK,QAASA,IAC1DE,GAAgBX,GAAII,GAAQ,GAAK,gBAAiB,GAAK,YAAa,GAAK,aAClEQ,GAAe,GAAGZ,GAAIW,GAAe,GAAK,QAASA,IAInDE,GAAgB,GAAGb,GAAI,GAAY,GAAK,mBAAoB,GAAK,QAASA,GAAI,GAAkB,GAAK,mBAAoB,GAAK,QAASA,GAAI,GAAY,GAAK,oBAAqBA,GAAI,GAAkB,GAAK,qBAK5Mc,IAJgB,GAAGd,GAAI,GAAY,GAAK,sBAAuB,GAAK,QAASA,GAAI,GAAkB,GAAK,sBAAuB,GAAK,QAASA,GAAI,GAAY,GAAK,uBAAwBA,GAAI,GAAkB,GAAK,wBAInM,GAAGA,GAAIO,GAAM,GAAK,qBAAsB,GAAK,QAASP,GAAIQ,GAAO,GAAK,qBAAsB,GAAK,QAASR,GAAIO,GAAM,GAAK,sBAAuBP,GAAIQ,GAAO,GAAK,wBAClLO,GAAW,GAAGV,GAAaC,GAAmBC,GAAMC,GAAOK,GAAeC,GAAiBf,GAAKG,GAAKC,GAAM,GAAKO,GAAcE,IAGrII,IADkB,GAAGhB,GAAIe,GAAU,GAAK,gBAAiB,GAAK,QAASf,GAAIe,GAAU,GAAK,kBACnF,GAAGf,GAAIe,GAAU,GAAK,QAASF,GAAeC,GAAiBJ,GAAcE,GAAc,GAAK,SACvGK,GAAW,GAAGjB,GAAIgB,GAAM,GAAK,eAAgBA,IAAOhB,GAAIgB,GAAM,GAAK,gBAAiBhB,GAAI,GAAK,eAAgBgB,IAAOhB,GAAIe,GAAU,GAAK,gBAAiBf,GAAI,GAAK,eAAgBe,IAAW,GAAK,gBACjMG,GAAmB,IAAM,GAAGlB,GAAIiB,GAAUC,IAAmBD,IACtDE,GAAUD,KACVE,GAAM,GAAGpB,GAAImB,GAASH,GAAMG,IAAUnB,GAAIgB,GAAMG,IAAUnB,GAAImB,GAASH,IAAOG,GAASH,IAMpG,SAASK,GAAoBC,GAkBzB,OAjBA,SAAiB5hF,GACb,IAAIo5C,EACJ,IACIA,EAAK,GAAUp5C,EACnB,CACA,MAAO8F,GACH,OAAO,CACX,CACA,MAAMojB,EAAM04D,EAAaxoC,EAAG1F,cAC5B,OAAY,OAARxqB,KAGQ,IAARA,IAAwB,IAARA,EACTA,EAEW,IAAfA,EAAIpoC,OACf,CAEJ,CACA,SAASw/F,MAAO9+F,GACZ,SAASogG,EAAa5hF,GAClB,GAAIA,EAAElf,OAASU,EAAKV,OAChB,OAAO,KAEX,IAAIooC,EAAMlpB,EAaV,OAZAxe,EAAKy4D,MAAMwW,IACPvnC,EAAqB,mBAARunC,EACPA,IAAMmxB,aAAa5hF,GACnBywD,EAAImxB,aAAa5hF,GACnBhf,MAAM2Q,QAAQu3B,KACdlpB,EAAIkpB,GAEI,OAARA,KAKDA,CACX,CACA,MAAO,CACHxjC,SAAU,WAAc,MAAO,KAAOlE,EAAK0F,KAAK,KAAO,IAAM,EAC7DkuB,MAAO5zB,EACPqgG,QAASF,GAAoBC,GAC7BA,eAER,CACA,SAAS,MAAMpgG,GACX,SAASogG,EAAa5hF,GAClB,IAAIkpB,EAAM,KAWV,OAVA1nC,EAAKy4D,MAAMwW,IACP,MAAMxrC,EAAqB,mBAARwrC,EACbA,IAAMmxB,aAAa5hF,GACnBywD,EAAImxB,aAAa5hF,GACvB,OAAW,MAAPilB,IACAiE,EAAMjE,GACC,EAEC,IAETiE,CACX,CAOA,MANe,CACXxjC,SAAU,WAAc,MAAO,KAAOlE,EAAK0F,KAAK,KAAO,IAAM,EAC7DkuB,MAAO5zB,EACPqgG,QAASF,GAAoBC,GAC7BA,eAGR,CACA,SAAS,GAAK/uF,GACV,MAAMzS,EAAOyS,EAwBb,MAAO,CACHnN,SAAU,WAAc,OAAOtF,CAAM,EACrCyhG,QAzBJ,SAAiB7hF,GACb,IAAIo5C,EACJ,IACIA,EAAK,GAAUp5C,EACnB,CACA,MAAO8F,GACH,OAAO,CACX,CACA,MAAMg8E,EAAS1oC,EAAG1F,aAClB,OAAsB,IAAlBouC,EAAOhhG,QAAgBghG,EAAO,KAAO1hG,CAI7C,EAaIwhG,aAZJ,SAAsBpuC,GAClB,OAAsB,IAAlBA,EAAO1yD,OACA,KAEP0yD,EAAO,KAAOpzD,EACPozD,EAAOjzD,MAAM,GAEjB,IACX,EAMJ,CAxGsB,GAAG+/F,GAAImB,GAAS,GAAK,UAAW,GAAK,QAASnB,GAAImB,GAAS,GAAK,WAAYnB,GAAIe,GAAU,GAAK,UAAW,GAAK,QAASf,GAAIe,GAAU,GAAK,WAAY,GAAK,WCClL,MAAMU,WAAkBt2C,GACpB6G,WAAa,YACb7nD,IACA+qD,MACAzW,KACA94B,QACAwhC,WACAu6C,MACA,WAAArzF,CAAY84C,EAAYnuC,EAAU,CAAEylC,KAAM,KACtC,GAAoB,MAAhBzlC,EAAQylC,MAAwC,IAAxBzlC,EAAQylC,KAAKj+C,OACrC,MAAM,IAAIjD,MAAM,+CAEpB4xC,QACApwC,KAAKooD,WAAaA,EAClBpoD,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,oBAC1CngG,KAAK4mB,QAAU3M,EAAQ2M,SAnBa,IAoBpC5mB,KAAK0/C,KAAO,GACZ,IAAK,MAAMkjD,KAAa3oF,EAAQylC,KAAM,CAClC,IAAK2iD,GAAIG,QAAQI,GAAY,CACzB5iG,KAAKoL,IAAIoc,MAAM,qBACf,QACJ,CACA,MAAMuyC,EAAK,GAAU6oC,GACf57C,EAAY+S,EAAGrF,YACrB,GAAiB,MAAb1N,EAAmB,CACnBhnD,KAAKoL,IAAIoc,MAAM,+CACf,QACJ,CACA,MAAMq7E,EAAW,CACbnyF,GAAI4+E,GAAiBtoC,GACrB87C,WAAY,CAAC/oC,IAEjB/5D,KAAK0/C,KAAKl/C,KAAKqiG,EACnB,CACA7iG,KAAK2iG,MAAQ1oF,CACjB,CACA,CAAC0mF,IAAuB3gG,KACxB,CAACyjC,OAAOqB,aAAe,oBACvB,CAACgqD,IAAuB,CACpB,0BAEJ,SAAAvyB,GACI,OAAOzvD,QAAQ9M,KAAKm2D,MACxB,CAIA,KAAAnvD,GACQhH,KAAKu8D,cAGTv8D,KAAKoL,IAAI,mEAAoEpL,KAAK4mB,SAClF5mB,KAAKm2D,MAAQtvC,YAAW,KACf7mB,KAAK+iG,0BACLz/D,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GACrB,GACHzmB,KAAK4mB,SACZ,CAIA,6BAAMm8E,GACF,GAAkB,MAAd/iG,KAAKm2D,MAGT,IAAK,MAAM0sC,KAAY7iG,KAAK0/C,KAAM,CAW9B,SAVM1/C,KAAKooD,WAAW0N,UAAUzyC,MAAMw/E,EAASnyF,GAAI,CAC/ConD,KAAM,CACF,CAAC93D,KAAK2iG,MAAM9nC,SA3EG,aA2EqC,CAChD77D,MAAOgB,KAAK2iG,MAAMK,UA3EN,GA4EZC,IAAKjjG,KAAK2iG,MAAMO,SAGxBJ,WAAYD,EAASC,aAGP,MAAd9iG,KAAKm2D,MACL,OAEJn2D,KAAKusD,kBAAkB,OAAQ,CAAE5E,OAAQk7C,IACzC7iG,KAAKooD,WAAWI,kBAAkB26C,eAAeN,EAASnyF,IACrD4yB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,mCAAoCq7E,EAASnyF,GAAI+V,EAAI,GAE5E,CACJ,CAIA,IAAAH,GACsB,MAAdtmB,KAAKm2D,OACL5vC,aAAavmB,KAAKm2D,OAEtBn2D,KAAKm2D,WAAQj3D,CACjB,ECzIG,MAIMkkG,GAAoCnzF,WAAWsO,KAAK,CAAC,EAAG,ICE9D,IAAI,GCAA8kF,IDCX,SAAWC,GACP,IAAIC,EA8CAlxD,GA7CJ,SAAWkxD,GACP,IAAIlxD,EACJkxD,EAAYl8D,MAAQ,KACF,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIixF,WAAqBjxF,EAAIixF,UAAUhzF,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIixF,aAEa,IAAzB1mE,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRixF,UAAW,EAAgB,IAEzBv8F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACXwiC,IAAQ,GACP,EACDtgC,EAAIixF,UAAYlkF,EAAOxQ,QAIvBwQ,EAAO2X,SAAe,EAAN4b,EAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXkxD,EAAYruF,OAAU3C,GACX89B,GAAc99B,EAAKgxF,EAAYl8D,SAE1Ck8D,EAAYvnF,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAK+zF,EAAYl8D,QAASvK,EAEtD,CA5CD,CA4CGymE,EAAcD,EAAWC,cAAgBD,EAAWC,YAAc,CAAC,IAEtED,EAAWj8D,MAAQ,KACD,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAY9B,IAX6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEa,MAAd1Q,EAAIw0C,QAAkBx0C,EAAIw0C,OAAOv2C,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIw0C,SAEA,MAAXx0C,EAAIwyE,KAA2B,KAAZxyE,EAAIwyE,MACxBhxE,EAAE1D,OAAO,IACT0D,EAAEqO,OAAO7P,EAAIwyE,MAEI,MAAjBxyE,EAAIkxF,UACJ,IAAK,MAAMzkG,KAASuT,EAAIkxF,UACpB1vF,EAAE1D,OAAO,IACTizF,EAAWC,YAAYl8D,QAAQnyB,OAAOlW,EAAO+U,IAGxB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRw0C,OAAQ,EAAgB,GACxBg+B,IAAK,GACL0e,UAAW,IAETx8F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIw0C,OAASznC,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIwyE,IAAMzlE,EAAO8C,SACjB,MAEJ,KAAK,EACD,GAA8B,MAA1B0a,EAAKqW,QAAQswD,WAAqBlxF,EAAIkxF,UAAUhiG,SAAWq7B,EAAKqW,OAAOswD,UACvE,MAAM,IAAI5xD,GAAe,8DAE7Bt/B,EAAIkxF,UAAUjjG,KAAK8iG,EAAWC,YAAYl8D,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9E8iC,OAAQrW,EAAKqW,QAAQuwD,cAEzB,MAEJ,QACIpkF,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXixD,EAAWpuF,OAAU3C,GACV89B,GAAc99B,EAAK+wF,EAAWj8D,SAEzCi8D,EAAWtnF,OAAS,CAACxM,EAAKstB,IACfsK,EAAc53B,EAAK8zF,EAAWj8D,QAASvK,EAErD,CAnHD,CAmHG,KAAe,GAAa,CAAC,IEjHzB,MAAMwmE,GAITrwC,0BAA6BzjD,IACzB,MAAMm0F,EAAa,GAAS3nF,OAAOxM,GAC7Bu3C,EAASyoC,GAAoB,GAAcmU,EAAW58C,SACtD+7C,GAAca,EAAWF,WAAa,IAAIn/F,KAAKqc,GAAM,GAAUA,EAAE6iF,aACjEI,EAAYD,EAAW5e,IAC7B,OAAO,IAAIue,GAAW,CAAEv8C,SAAQ+7C,aAAYc,aAAY,EAE5D3wC,cHpBuC,qBGqBvCA,aAAemwC,GACfr8C,OACA+7C,WACAc,UACA1pB,OAASopB,GAAWO,OACpBx8D,MAAQi8D,GAAWQ,MACnBC,UACA,WAAAz0F,CAAYzD,GACR,MAAM,OAAEk7C,EAAM,WAAE+7C,EAAU,UAAEc,GAAc/3F,EAC1C7L,KAAK+mD,OAASA,EACd/mD,KAAK8iG,WAAaA,GAAc,GAChC9iG,KAAK4jG,UAAYA,GAAa39D,OAAOz7B,KAAKm2D,MAC9C,CAIA,OAAAqjC,GAUI,OATsB,MAAlBhkG,KAAK+jG,YACL/jG,KAAK+jG,UAAY,GAAS7uF,OAAO,CAC7B6xC,OAAQ/mD,KAAK+mD,OAAO0iB,cAAc36D,MAClCi2E,IAAK9+C,OAAOjmC,KAAK4jG,WACjBH,UAAWzjG,KAAK8iG,WAAWx+F,KAAK8yB,IAAM,CAClCosE,UAAWpsE,EAAEtoB,aAIlB9O,KAAK+jG,SAChB,CAIA,MAAAz1D,CAAOC,GACH,OAAMA,aAAiB+0D,MAIlBtjG,KAAK+mD,OAAOzY,OAAOC,EAAMwY,SAI1B/mD,KAAK4jG,YAAcr1D,EAAMq1D,aCxC9B,SAAqBjjF,EAAGC,GAC3B,MAAMxS,EAAO,CAACuS,EAAGC,IAAMD,EAAEta,WAAW49F,cAAcrjF,EAAEva,YACpD,OAAIsa,EAAElf,SAAWmf,EAAEnf,SAGnBmf,EAAExS,KAAKA,GACAuS,EAAEvS,KAAKA,GAAMk4D,OAAM,CAACjhB,EAAMx6C,IAAU+V,EAAE/V,GAAOyjC,OAAO+W,KAC/D,CDqCa6+C,CAAYlkG,KAAK8iG,WAAYv0D,EAAMu0D,WAI5C,GD9DJ,SAAWO,GACP,IAAIhxD,EACJgxD,EAASh8D,MAAQ,KACC,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAI82D,WAAqB92D,EAAI82D,UAAU74D,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI82D,YAEQ,MAAnB92D,EAAI4xF,aAAuB5xF,EAAI4xF,YAAY3zF,WAAa,IACzDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI4xF,cAEI,MAAf5xF,EAAIugC,SAAmBvgC,EAAIugC,QAAQtiC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIugC,UAEM,MAAjBvgC,EAAI83D,WAAqB93D,EAAI83D,UAAU75D,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI83D,aAEa,IAAzBvtC,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR82D,UAAW,EAAgB,GAC3B86B,YAAa,EAAgB,GAC7BrxD,QAAS,EAAgB,GACzBu3B,UAAW,EAAgB,IAEzBpjE,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAI82D,UAAY/pD,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAI4xF,YAAc7kF,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAIugC,QAAUxzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI83D,UAAY/qD,EAAOxQ,QACvB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXgxD,EAASnuF,OAAU3C,GACR89B,GAAc99B,EAAK8wF,EAASh8D,SAEvCg8D,EAASrnF,OAAS,CAACxM,EAAKstB,IACbsK,EAAc53B,EAAK6zF,EAASh8D,QAASvK,EAEnD,CAvED,CAuEGumE,KAAaA,GAAW,CAAC,IG5ErB,MAAMe,WAA8B5lG,MACvC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,ECAG,MAAMsjG,GAITpxC,0BAA4B9lB,MAAOxD,IAC/B,MAAM26D,EAAe,GAAStoF,OAAO2tB,GAC/B0/B,EAAYqlB,GAAsB4V,EAAaj7B,WACrD,OAAO,IAAIg7B,GAAe,CACtBh7B,YACA86B,YAAaG,EAAaH,YAC1BrxD,QAASwxD,EAAaxxD,QACtBu3B,UAAWi6B,EAAaj6B,WAC1B,EAMNpX,YAAc9lB,MAAOo3D,EAAQn6B,KACzB,GAAkB,MAAdA,EACA,MAAM,IAAI5rE,MAAM,uBAEpB,MAAM07E,EAASqqB,EAAOrqB,OAChBiqB,EAAcI,EAAOl9D,MACrByL,EAAUyxD,EAAOP,UACjBQ,EAAWC,GAAuBvqB,EAAQiqB,EAAarxD,GACvDu3B,QAAkBD,EAAW9rD,KAAKkmF,EAASviF,YACjD,OAAO,IAAIoiF,GAAe,CACtBh7B,UAAWe,EAAWf,UACtB86B,cACArxD,UACAu3B,aACF,EAMNpX,sBAAwB9lB,MAAOxD,EAAMuwC,KACjC,MAAMwqB,QAAiBL,GAAeM,mBAAmBh7D,GAEzD,UADoB+6D,EAASE,SAAS1qB,GAElC,MAAM,IAAIkqB,GAAsB,wDAEpC,OAAOM,CAAQ,EAEnBr7B,UACA86B,YACArxD,QACAu3B,UACA05B,UAKA,WAAAz0F,CAAYzD,GACR,MAAM,UAAEw9D,EAAS,YAAE86B,EAAW,QAAErxD,EAAO,UAAEu3B,GAAcx+D,EACvD7L,KAAKqpE,UAAYA,EACjBrpE,KAAKmkG,YAAcA,EACnBnkG,KAAK8yC,QAAUA,EACf9yC,KAAKqqE,UAAYA,CACrB,CAIA,OAAA25B,GASI,OARsB,MAAlBhkG,KAAK+jG,YACL/jG,KAAK+jG,UAAY,GAAS7uF,OAAO,CAC7Bm0D,UAAWK,GAAoB1pE,KAAKqpE,WACpC86B,YAAankG,KAAKmkG,YAClBrxD,QAAS9yC,KAAK8yC,QAAQ7wB,WACtBooD,UAAWrqE,KAAKqqE,aAGjBrqE,KAAK+jG,SAChB,CAIA,MAAAz1D,CAAOC,GACH,OAAO,GAAiBvuC,KAAKgkG,UAAWz1D,EAAMy1D,UAClD,CAIA,cAAMY,CAAS1qB,GACX,MAAMsqB,EAAWC,GAAuBvqB,EAAQl6E,KAAKmkG,YAAankG,KAAK8yC,SACvE,OAAO9yC,KAAKqpE,UAAU7pD,OAAOglF,EAASviF,WAAYjiB,KAAKqqE,UAC3D,EAKJ,MAAMo6B,GAAyB,CAACvqB,EAAQiqB,EAAarxD,KAQjD,MAAM+xD,EAAmB,GAAsB3qB,GACzC4qB,EAAe,EAAcD,EAAiBr0F,YAC9Cu0F,EAAoB,EAAcZ,EAAY1iG,QAC9CujG,EAAgB,EAAclyD,EAAQrxC,QAC5C,OAAO,IAAIo9C,GAAeimD,EAAcD,EAAkBE,EAAmBZ,EAAaa,EAAelyD,EAAQ,mCC9GrH,MA0BMmyD,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,sBAEqC3gG,KAAI4gG,GAAW,IAAI,GAAAvyE,QAAQuyE,KACpE,SAASC,GAAUC,GACf,IAAK,MAAM5qE,KAAKyqE,GACZ,GAAIzqE,EAAExG,SAASoxE,GACX,OAAO,EAEf,OAAO,CACX,CAyCO,SAASC,GAAYlyE,GACxB,OAAIg9B,GAAOh9B,GACAgyE,GAAUhyE,GAzCd,iDAAiDhrB,KA0C9BgrB,GArC9B,SAA6BiyE,GACzB,MAAMhoF,EAAQgoF,EAAO19F,MAAM,KAC3B,GAAI0V,EAAM3b,OAAS,EACf,OAAO,EAEX,MAAM6jG,EAAUloF,EAAMA,EAAM3b,OAAS,GAAGwuD,SAAS,EAAG,KAC9Cs1C,EAAUnoF,EAAMA,EAAM3b,OAAS,GAAGwuD,SAAS,EAAG,KAEpD,OAAOk1C,GADK,GAAG3mF,SAAS+mF,EAAQ99F,UAAU,EAAG,GAAI,OAAO+W,SAAS+mF,EAAQ99F,UAAU,GAAI,OAAO+W,SAAS8mF,EAAQ79F,UAAU,EAAG,GAAI,OAAO+W,SAAS8mF,EAAQ79F,UAAU,GAAI,MAE1K,CA6Be+9F,CAAoBryE,GAxBxB,kEAAkEhrB,KAyB7CgrB,GAvBhC,SAA+BiyE,GAC3B,MAAMhoF,EAAQgoF,EAAO19F,MAAM,KAE3B,OAAOy9F,GADK/nF,EAAMA,EAAM3b,OAAS,GAErC,CAoBegkG,CAAsBtyE,GACxBi9B,GAAOj9B,GApBpB,SAAmBiyE,GACf,MAAO,OAAOj9F,KAAKi9F,IACf,QAAQj9F,KAAKi9F,IACb,oEAAoEj9F,KAAKi9F,IACzE,wFAAwFj9F,KAAKi9F,IAC7F,iIAAiIj9F,KAAKi9F,IACtI,6IAA6Ij9F,KAAKi9F,IAClJ,oIAAoIj9F,KAAKi9F,IACzI,oJAAoJj9F,KAAKi9F,IACzJ,8BAA8Bj9F,KAAKi9F,IACnC,8BAA8Bj9F,KAAKi9F,IACnC,0BAA0Bj9F,KAAKi9F,EACvC,CASeM,CAAUvyE,QAEjB,CACR,CClFO,SAASwyE,GAAU5rC,GACtB,IACI,ICFD,SAAmBA,GACtB,IACI,OAAQ1yB,IAAU0yB,EAAGpH,eACrB,OARU,IAQHtrB,GAPG,KAOoBA,CAClC,CACA,MACA,CACA,OAAO,CACX,CDNau+D,CAAU7rC,GAEX,OAAO,EAEX,OAAQ,CAAE/6D,IAAU+6D,EAAGpH,eACvB,OAAa,MAAT3zD,IAGGqmG,GAAYrmG,KAAU,EACjC,CACA,MACA,CACA,OAAO,CACX,CEfA,MAGa6mG,GAAQhmG,IACV,CACH4I,MAAQ6/D,KACAA,EAAK7mE,OAAS,MAGd5B,EAAGyoE,EAAK,KACDA,EAAKpnE,MAAM,GAI1B4kG,QAAS,OAGJC,GAAWhgG,IACb,CACH0C,MAAQ6/D,GAASu9B,IAAM56F,GAAQA,IAAQlF,IAAK0C,MAAM6/D,GAClDw9B,QAAS//F,IAGJ,GAAS,KACX,CACH0C,MAAQ6/D,GAASu9B,IAAM56F,GAAuB,iBAARA,IAAkBxC,MAAM6/D,GAC9Dw9B,QAAS,aAGJ,GAAS,KACX,CACHr9F,MAAQ6/D,GAASu9B,IAAM56F,IAAS61B,MAAMtiB,SAASvT,MAAOxC,MAAM6/D,GAC5Dw9B,QAAS,aAGJ/+C,GAAS,KACX,CACHt+C,MAAQ6/D,IACJ,GAAIA,EAAK7mE,OAAS,EACd,OAAO,EAEX,GAAgB,QAAZ6mE,EAAK,IAA4B,SAAZA,EAAK,GAC1B,OAAO,EAGX,IAAIA,EAAK,GAAG/7C,WAAW,OAAQ+7C,EAAK,GAAG/7C,WAAW,KAS9C,OAAO,EARP,IACIgf,GAAUvvB,OAAO,IAAIssD,EAAK,KAC9B,CACA,MAAO7hD,GACH,OAAO,CACX,CAKJ,OAAO6hD,EAAKpnE,MAAM,EAAE,EAExB4kG,QAAS,kBAGJE,GAAW,KACb,CACHv9F,MAAQ6/D,IACJ,GAAIA,EAAK7mE,OAAS,EACd,OAAO,EAEX,GAAgB,aAAZ6mE,EAAK,GACL,OAAO,EAEX,IACI58B,GAAU1vB,OAAOssD,EAAK,GAC1B,CACA,MACI,OAAO,CACX,CACA,OAAOA,EAAKpnE,MAAM,EAAE,EAExB4kG,QAAS,yBAGJzhG,GAAY4hG,IACd,CACHx9F,MAAQ6/D,IACJ,MAAMxzD,EAASmxF,EAAQx9F,MAAM6/D,GAC7B,OAAe,IAAXxzD,EACOwzD,EAEJxzD,CAAM,EAEjBgxF,QAAS,YAAYG,EAAQH,aAGxB,GAAK,IAAII,KACX,CACHz9F,MAAQ6/D,IACJ,IAAIk6B,EACJ,IAAK,MAAMyD,KAAWC,EAAU,CAC5B,MAAMpxF,EAASmxF,EAAQx9F,MAAM6/D,IAEd,IAAXxzD,IAIW,MAAX0tF,GAAmB1tF,EAAOrT,OAAS+gG,EAAQ/gG,UAC3C+gG,EAAU1tF,EAElB,CACA,OAAe,MAAX0tF,GAGGA,CAAO,EAElBsD,QAAS,MAAMI,EAAS5hG,KAAI8yB,GAAKA,EAAE0uE,UAASj+F,KAAK,WAG5C,GAAM,IAAIq+F,KACZ,CACHz9F,MAAQ6/D,IACJ,IAAK,MAAM29B,KAAWC,EAAU,CAE5B,MAAMpxF,EAASmxF,EAAQx9F,MAAM6/D,GAE7B,IAAe,IAAXxzD,EACA,OAAO,EAEXwzD,EAAOxzD,CACX,CACA,OAAOwzD,CAAI,EAEfw9B,QAAS,OAAOI,EAAS5hG,KAAI8yB,GAAKA,EAAE0uE,UAASj+F,KAAK,WAGnD,SAASs+F,MAAOD,GACnB,SAASz9F,EAAMsxD,GACX,IAAI38C,EAvII,CAAC28C,GACNA,EAAG1zD,WAAWqB,MAAM,KAAKxG,MAAM,GAsItBklG,CAAQrsC,GACpB,IAAK,MAAMksC,KAAWC,EAAU,CAC5B,MAAMpxF,EAASmxF,EAAQx9F,MAAM2U,GAC7B,IAAe,IAAXtI,EACA,OAAO,EAEXsI,EAAQtI,CACZ,CACA,OAAOsI,CACX,CAYA,MAAO,CACH8oF,WACA1D,QAbJ,SAAiBzoC,GAEb,OAAkB,IADHtxD,EAAMsxD,EAEzB,EAWIssC,WAVJ,SAAoBtsC,GAChB,MAAMjlD,EAASrM,EAAMsxD,GACrB,OAAe,IAAXjlD,GAGqB,IAAlBA,EAAOrT,MAClB,EAMJ,CCrHuB0kG,GADNp/C,MAAjB,MAKMu/C,GAAQ,GAAIP,GAAQ,QAAS,MAC7BQ,GAAQ,GAAIR,GAAQ,QAAS,MAC7BS,GAAW,GAAIT,GAAQ,WAAY,MACnCU,GAAO,GAAIV,GAAQ,OAAQ,MA+D3BW,IAhDcP,GAAIG,GAAOjiG,GAAS0iD,OAepBo/C,GAAII,GAAOliG,GAAS0iD,OAgBjBo/C,GAAIK,GAAUniG,GAAS0iD,OAgB3Bo/C,GAAI,GAAGM,GAAMD,GAAUF,GAAOC,IAAQliG,GAAS0iD,OACrD,GAAIg/C,GAAQ,OAAQF,GAAK11C,MAChCw2C,GAAO,GAAIZ,GAAQ,OAAQF,GAAKz1C,KAChCw2C,GAAM,GAAGF,GAAMC,IACfE,GAAgB,GAAGD,GAAKH,GAAMH,GAAOC,GAAOC,IAgBrCM,GAAeX,GAAI,GAAGS,GAAK,GAAI,GAAGH,GAAMD,GAAUF,GAAOC,IAAQliG,GAAS0iD,SAiDjFggD,IAhCaZ,GAAIO,IAiBJP,GAAIQ,IAcLR,GAAIS,IACT,GAAIC,GAAed,GAAQ,OAAQ,OAC1CiB,GAAO,GAAIH,GAAed,GAAQ,OAAQ,MAanC,GAAMI,GAAI,GAAIY,GAAM1iG,GAAS0iD,QAcpCkgD,IADad,GAAIa,IACT,GAAIA,GAAMjB,GAAQ,QAAS1hG,GAAS0iD,QAC5CmgD,GAAU,GAAIF,GAAMjB,GAAQ,WAAY1hG,GAAS0iD,OACjDogD,GAAgB,GAAGF,GAAOC,IA2B1BE,IAdcjB,GAAIc,IAaFd,GAAIe,IACb,GAAGL,GAAeE,GAAMC,GAAMC,GAAOC,KAC5C,GAAc,GAAG,GAAIE,GAAMrB,GAAQ,MAAO1hG,GAAS0iD,QAa5C,GAAao/C,GAAI,IACxB,GAAoB,GAAG,GAAIiB,GAAMrB,GAAQ,OAAQ1hG,GAAS0iD,OAAY,GAAIqgD,GAAMrB,GAAQ,OAAQ1hG,GAAS,GAAI0hG,GAAQ,OAAQ,OAAYA,GAAQ,MAAO1hG,GAAS0iD,QAa1J,GAAmBo/C,GAAI,IAC9B,GAAgB,GAAIa,GAAMjB,GAAQ,iBAAkB1hG,GAAS2hG,MAAa3hG,GAAS2hG,MAAa3hG,GAAS0iD,OAalG,GAAeo/C,GAAI,IAC1B,GAAgB,GAAIe,GAASnB,GAAQ,gBAAiB1hG,GAAS2hG,MAAa3hG,GAAS2hG,MAAa3hG,GAAS0iD,OAapG,GAAeo/C,GAAI,IAC1B,GAAO,GAAG,GAAa,GAAmB,GAAIY,GAAM1iG,GAAS0iD,OAAY,GAAIogD,GAAe9iG,GAAS0iD,OAAY,GAAI8/C,GAAexiG,GAAS0iD,OAAY,GAAe,GAAeA,MA2BhL,IAdMo/C,GAAI,IAcAA,GAbN,GAAI,GAAMJ,GAAQ,eAAgBh/C,QA2BtC,GAASo/C,GAbN,GAAG,GAAI,GAAMJ,GAAQ,eAAgBA,GAAQ,UAAW1hG,GAAS0iD,OAAY,GAAI,GAAMg/C,GAAQ,UAAW1hG,GAAS0iD,OAAY,GAAIg/C,GAAQ,UAAW1hG,GAAS0iD,SA2B3Jo/C,GAbN,GAAG,GAAIU,GAAed,GAAQ,OAAQ,KAAUA,GAAQ,QAAS1hG,GAAS0iD,OAAY,GAAI8/C,GAAed,GAAQ,QAAS1hG,GAAS0iD,SA2B5Ho/C,GAbN,GAAG,GAAIU,GAAed,GAAQ,OAAQ,GAAG,GAAIA,GAAQ,OAAQA,GAAQ,SAAU,GAAI,KAAUA,GAAQ,WAAY1hG,GAAS0iD,OAAY,GAAI8/C,GAAed,GAAQ,OAAQA,GAAQ,QAAS1hG,GAAS0iD,OAAY,GAAI8/C,GAAed,GAAQ,SAAU1hG,GAAS0iD,SA2BtPo/C,GAbN,GAAG,GAAIJ,GAAQ,UAAW,KAAU1hG,GAAS0iD,SCpV7D,MAAM,GACFjC,SACAC,SACAxB,MACAyB,WACAx9B,MACA,WAAAlY,GACItP,KAAKujD,OAAQ,EACbvjD,KAAK8kD,SAAW,KAChB9kD,KAAK+kD,SAAW,IACpB,CACA,CAACthB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKglD,kBAEChlD,KAAK+kD,SAAStC,QAED,MAAnBziD,KAAKglD,WACL,MAAM,IAAIxmD,MAAM,0DAEpB,MAAMwmD,EAAahlD,KAAKglD,WAKxB,OAJAhlD,KAAKglD,gBAAa9lD,EAElBc,KAAK8kD,SAAS5gD,UACdlE,KAAK8kD,SAAW,KACTE,CACX,CACA,WAAM,CAAMv+B,GAaR,OAZAzmB,KAAKujD,OAAQ,EACbvjD,KAAKwnB,MAAQf,EACF,MAAPA,IAGAzmB,KAAK+kD,SAAStC,QAAQnf,OAAM,SAC5BtjC,KAAK+kD,SAASvoB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAalwC,EAElB9U,KAAK+kD,SAAS7gD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAK8jD,MAAMr9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAKujD,MACtB,MAAMvjD,KAAKwnB,OAAS,IAAIhpB,MAAM,4CAGlC,KAA0B,MAAnBwB,KAAKglD,kBACFhlD,KAAK8kD,SAASrC,QAEX,MAATzjD,EACAgB,KAAKglD,WAAa,CAAEhiB,MAAM,EAAOhkC,UAGjCgB,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAa,CAAEhiB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAK+kD,SAAS7gD,UACdlE,KAAK+kD,SAAW,WAGVP,GAAWxkD,KAAK8kD,SAASrC,QAASxoC,GAASgqC,OAAQhqC,EAC7D,ECpHG,MAAM,WAA2Bzb,MACpCuC,KAAO,qBACPgU,KAAO,qBCFJ,MAAM,WAAkCvW,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BCMJ,SAASsyF,GAAS1hD,EAAQ7oB,GAC7B,MAAMwqE,ECCH,SAAkB3hD,EAAQ7oB,EAAO,CAAC,GACrC,MAAMhuB,ECJH,SAAoB62C,EAAQ7oB,GAC/B,MAAMptB,EL+FC,IAAI,GK9FXi2C,EAAOG,KAAKp2C,GAAO4zB,OAAM6J,MAAO1mB,UACtB/W,EAAMzI,IAAIwf,EAAI,IAExBk/B,EAAOG,KAAO3Y,MAAOhnC,IACjB,UAAW,MAAMqJ,KAAOrJ,QACduJ,EAAMlP,KAAKgP,SAEfE,EAAMzI,KAAK,EAErB,IAAId,EAASw/C,EAAOx/C,OACkB,MAAlCw/C,EAAOx/C,OAAOs9B,OAAOsb,UACrB54C,EAASw/C,EAAOx/C,OAAOs9B,OAAOsb,YAEc,MAAvC4G,EAAOx/C,OAAOs9B,OAAOC,iBAC1Bv9B,EAASw/C,EAAOx/C,OAAOs9B,OAAOC,kBAElC,MAAMqsD,EAAa,IAAIlxC,GAiDvB,MAhDU,CACN3hC,KAAMiwB,MAAOlzB,IAET,GADAA,GAASgqC,QAAQC,iBACK,MAAlBjqC,GAASnL,MAAe,CAExB,MAAM,KAAEk0B,EAAI,MAAEhkC,SAAgBwlD,GAAWr+C,EAAOkC,OAAQ4R,GAASgqC,QACjE,OAAa,IAATjhB,EACO,KAEJhkC,CACX,CACA,KAAO+wF,EAAWv/E,WAAayJ,EAAQnL,OAAO,CAC1C,MAAM,MAAE9P,EAAK,KAAEgkC,SAAewhB,GAAWr+C,EAAOkC,OAAQ4R,GAASgqC,QACjE,IAAa,IAATjhB,EACA,MAAM,IAAI,GAAmB,2BAEjC+sD,EAAW/wC,OAAOhgD,EACtB,CACA,MAAMwQ,EAAMugF,EAAWtwC,QAAQ,EAAGxlC,EAAQnL,OAE1C,OADAihF,EAAW3wC,QAAQnlC,EAAQnL,OACpBU,CAAG,EAEdE,MAAOy9B,MAAOxD,EAAM1vB,KAChBA,GAASgqC,QAAQC,iBAEbva,aAAgB15B,iBACVP,EAAMlP,KAAKmpC,EAAM1vB,SAGjBvK,EAAMlP,KAAKmpC,EAAK1nB,WAAYhI,EACtC,EAEJg2E,OAAQ,KACJ,GAAIF,EAAWv/E,WAAa,EAAG,CAC3B,MAAM0/E,EAAiBvqC,EAAOx/C,OAC9Bw/C,EAAOx/C,OAAUgnC,mBACY,IAArBrQ,GAAMqzD,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAOvqC,CAAM,EAIzB,CDhEkB,CAAWA,EAAQ7oB,GACP,MAAtBA,EAAKqlB,eAAiD,MAAxBrlB,EAAKolB,kBAGnCplB,EAAKolB,gBAAkB,EAAsBplB,EAAKqlB,gBAEtD,MAAMkuC,EAAevzD,GAAMmlB,eAAiB,EACtCZ,EAAevkB,GAAMwkB,eAAiB,EAmD5C,MAlDU,CACNpkC,KAAMiwB,MAAOlzB,IACT,IAAI+nC,GAAc,EAClB,MAAMsuC,EAAe,IAAIzxC,GACzB,OAAa,CAETyxC,EAAatxC,aAAalwC,EAAMoO,KAAK,IAC9BjD,EACHnL,MAAO,KAEX,IACIkzC,EAAaquC,EAAaC,EAC9B,CACA,MAAO7pE,GACH,GAAIA,aAAe+P,WACf,SAEJ,MAAM/P,CACV,CACA,GAAIu7B,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzBllB,GAAMolB,iBAA2BouC,EAAa9/E,WAAassB,EAAKolB,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvBllB,GAAMqlB,eAAyBH,EAAallB,EAAKqlB,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAOrzC,EAAMoO,KAAK,IACXjD,EACHnL,MAAOkzC,GACT,EAENtyC,MAAOy9B,MAAOxD,EAAM1vB,WAEVnL,EAAMY,MAAM,IAAImvC,GAAewC,EAAa1X,EAAKn5B,YAAam5B,GAAO1vB,EAAQ,EAEvFs2E,OAAQpjD,MAAOxD,EAAM1vB,KACjB,MAAMylC,EAAO,IAAIb,MAAkBlV,EAAK6mD,SAAQhhF,GAAO,CAAE6xC,EAAa7xC,EAAIgB,YAAahB,YAEjFV,EAAMY,MAAMgwC,EAAMzlC,EAAQ,EAEpCg2E,OAAQ,IACGnhF,EAAMmhF,SAIzB,CD7De,CAAStqC,EAAQ7oB,GACtB64C,EAAI,CACNz4D,KAAMiwB,MAAOwQ,EAAO1jC,KAEhB,MAAMjb,QAAcsoG,EAAGpqF,KAAKjD,GAC5B,OAAO0jC,EAAM3hC,OAAOhd,EAAM,EAE9B0Q,MAAOy9B,MAAO3gC,EAASmxC,EAAO1jC,WAEpBqtF,EAAG53F,MAAMiuC,EAAMzoC,OAAO1I,GAAUyN,EAAQ,EAElDs2E,OAAQpjD,MAAOsG,EAAUkK,EAAO1jC,WAEtBqtF,EAAG/W,OAAO98C,EAASnvC,KAAIkI,GAAWmxC,EAAMzoC,OAAO1I,KAAWyN,EAAQ,EAE5EstF,GAAK5pD,IACM,CACHzgC,KAAMiwB,MAAOlzB,GAAY07D,EAAEz4D,KAAKygC,EAAO1jC,GACvCvK,MAAOy9B,MAAO1wB,EAAGxC,IAAY07D,EAAEjmE,MAAM+M,EAAGkhC,EAAO1jC,GAC/Cs2E,OAAQpjD,MAAO1wB,EAAGxC,IAAY07D,EAAE4a,OAAO9zE,EAAGkhC,EAAO1jC,GACjDg2E,OAAQ,IAAMta,IAGtBsa,OAAQ,IACGqX,EAAGrX,UAGlB,OAAOta,CACX,CGlDO,IAAI,IACX,SAAW6xB,GACP,IAAIn1D,EACJm1D,EAASngE,MAAQ,KACC,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEqB,MAAvB1Q,EAAIk1F,kBACJ1zF,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIk1F,kBAEO,MAApBl1F,EAAIm1F,eACJ3zF,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIm1F,eAEI,MAAjBn1F,EAAI82D,YACJt1D,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI82D,YAEO,MAAnB92D,EAAIo1F,YACJ,IAAK,MAAM3oG,KAASuT,EAAIo1F,YACpB5zF,EAAE1D,OAAO,IACT0D,EAAEjF,MAAM9P,GAOhB,GAJwB,MAApBuT,EAAIq1F,eACJ7zF,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIq1F,eAEK,MAAjBr1F,EAAIq1C,UACJ,IAAK,MAAM5oD,KAASuT,EAAIq1C,UACpB7zC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAGW,MAAxBuT,EAAIs1F,mBACJ9zF,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIs1F,oBAEa,IAAzB/qE,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRo1F,YAAa,GACb//C,UAAW,IAET3gD,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIk1F,gBAAkBnoF,EAAO/O,SAC7B,MAEJ,KAAK,EACDgC,EAAIm1F,aAAepoF,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAI82D,UAAY/pD,EAAOxQ,QACvB,MAEJ,KAAK,EACD,GAAgC,MAA5BguB,EAAKqW,QAAQw0D,aAAuBp1F,EAAIo1F,YAAYlmG,SAAWq7B,EAAKqW,OAAOw0D,YAC3E,MAAM,IAAI91D,GAAe,gEAE7Bt/B,EAAIo1F,YAAYnnG,KAAK8e,EAAOxQ,SAC5B,MAEJ,KAAK,EACDyD,EAAIq1F,aAAetoF,EAAOxQ,QAC1B,MAEJ,KAAK,EACD,GAA8B,MAA1BguB,EAAKqW,QAAQyU,WAAqBr1C,EAAIq1C,UAAUnmD,SAAWq7B,EAAKqW,OAAOyU,UACvE,MAAM,IAAI/V,GAAe,8DAE7Bt/B,EAAIq1C,UAAUpnD,KAAK8e,EAAO/O,UAC1B,MAEJ,KAAK,EACDgC,EAAIs1F,iBAAmBvoF,EAAOxQ,QAC9B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXm1D,EAAStyF,OAAU3C,GACR89B,GAAc99B,EAAKi1F,EAASngE,SAEvCmgE,EAASxrF,OAAS,CAACxM,EAAKstB,IACbsK,EAAc53B,EAAKg4F,EAASngE,QAASvK,EAEnD,CAvGD,CAuGG,KAAa,GAAW,CAAC,ICvGrB,MAAMgrE,GACO,OADPA,GAEA,IAFAA,GAGU,EAHVA,GAIW,EAJXA,GAKa,GALbA,GCE4B,KDF5BA,IAOY,EAPZA,IASe,EAgIrB,MAAMC,GACTp0C,KACA5L,SACAigD,QACAphF,QACAmgC,OACAqjB,WACAtU,UACAyF,UACA0sC,eACAn+C,kBACAo+C,mBACAC,eACAC,qBACAtnG,OACAunG,uBACAj9F,IACA,WAAAkE,CAAY84C,EAAYv8C,GAlIrB,IAAyBy8F,EAAUZ,EAmIlC1nG,KAAK+nD,SAAWl8C,EAAKk8C,SACrB/nD,KAAKgoG,SAAU,EACfhoG,KAAK+mD,OAASqB,EAAWrB,OACzB/mD,KAAKoqE,WAAahiB,EAAWgiB,WAC7BpqE,KAAK81D,UAAY1N,EAAW0N,UAC5B91D,KAAKu7D,UAAYnT,EAAWmT,UAC5Bv7D,KAAKioG,eAAiB7/C,EAAW6/C,eACjCjoG,KAAKc,OAASsnD,EAAWtnD,OACzBd,KAAKoL,IAAMS,EAAKT,IAChBpL,KAAK4mB,QAAU/a,EAAK+a,SAAWkhF,GAC/B9nG,KAAK8pD,kBAAoBj+C,EAAKi+C,mBAAqBg+C,GACnD9nG,KAAKkoG,mBAAqBr8F,EAAKq8F,oBAAsBJ,GACrD9nG,KAAKmoG,eAAiBt8F,EAAKs8F,gBAAkBL,GAC7C9nG,KAAKooG,qBAAuBv8F,EAAKu8F,sBAAwBN,GACzD9nG,KAAKqoG,uBAAyBx8F,EAAKw8F,wBAA0BP,GAE7D9nG,KAAK2zD,KAAO,CACR8zC,gBAAiB,GAAG57F,EAAK08F,gBAAkBT,WAC3CJ,cArJoBY,EAqJUlgD,EAAWkgD,SArJXZ,EAqJqB77F,EAAK67F,aApJ5C,MAAhBA,EACOA,EAEJY,EAASztE,WAmJhB,CACA,SAAA0hC,GACI,OAAOv8D,KAAKgoG,OAChB,CACA,WAAMhhG,GACEhH,KAAKgoG,gBAGHhoG,KAAK81D,UAAUzyC,MAAMrjB,KAAK+mD,OAAQ,CACpCmB,SAAU,CACNsgD,aAAc,GAAqBxoG,KAAK2zD,KAAK+zC,cAC7Ce,gBAAiB,GAAqBzoG,KAAK2zD,KAAK8zC,0BAGlDznG,KAAKu7D,UAAU3R,OAAO5pD,KAAK+nD,UAAWpe,IACnC3pC,KAAK0oG,eAAe/+D,GAAMrG,OAAM7c,IACjCzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GACrB,GACH,CACCqjC,kBAAmB9pD,KAAK8pD,kBACxBo+C,mBAAoBloG,KAAKkoG,mBACzBG,uBAAwBroG,KAAKqoG,yBAEjCroG,KAAKgoG,SAAU,EACnB,CACA,UAAM1hF,SACItmB,KAAKu7D,UAAUotC,SAAS3oG,KAAK+nD,UACnC/nD,KAAKgoG,SAAU,CACnB,EEpMG,MAAMR,WAAiBO,GAC1B,WAAAz4F,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5BukC,MAAMgY,EAAY,IACXv8C,EACHk8C,SAAU,IAAIl8C,EAAK08F,gBAAkBT,cACrC18F,IAAKg9C,EAAW5K,OAAO2iD,aAAa,sBAEpCt0F,EAAK+8F,qBAAuBd,KAE5B1/C,EAAWtnD,OAAOsjD,iBAAiB,mBAAoB9jD,IACnD,MAAMgnD,EAAahnD,EAAIqnD,OACvB3nD,KAAK6oG,SAASvhD,GACThkB,OAAM7c,IACHA,EAAI1lB,OAAS0mE,GAAyB1mE,MAI1Cf,KAAKoL,IAAIoc,MAAM,mDAAoDf,EAAI,GACzE,GAGd,CACA,CAACqoE,IAAuB,CACpB,oBAEJ,eAAMga,CAAUxhD,EAAYrtC,EAAU,CAAC,GACnC,IAAIgsC,EACJ,GAAsB,MAAlBhsC,EAAQgqC,OAAgB,CACxB,MAAMA,EAAS8kD,YAAYniF,QAAQ5mB,KAAK4mB,SAExC3M,EAAU,IACHA,EACHgqC,SAER,CACA,IACIgC,QAAeqB,EAAWE,UAAUxnD,KAAK+nD,SAAU,IAC5C9tC,EACHouF,uBAAwBroG,KAAKqoG,yBAEjC,MAAMd,EAAKF,GAASphD,EAAQ,CACxB9D,cAAeniD,KAAKmoG,iBACrBZ,GAAG,IACA/6F,QAAgB+6F,EAAGrqF,KAAKjD,GAE9B,aADMgsC,EAAO+iD,MAAM/uF,GACZzN,CACX,CACA,MAAOia,GAEH,MADAw/B,GAAQ8d,MAAMt9C,GACRA,CACV,CACJ,CACA,cAAMoiF,CAASvhD,EAAYrtC,EAAU,CAAC,GAClC,MAAMzN,QAAgBxM,KAAK8oG,UAAUxhD,EAAYrtC,IAC3C,UAAEovD,EAAS,UAAEzhB,EAAS,aAAEggD,GAAiBp7F,EAC/C,GAAiB,MAAb68D,EACA,MAAM,IAAI3B,GAAoB,gDAElC,MACMh3D,EAAK6+E,GADCb,GAAsBrlB,GACLM,SAC7B,IAAKriB,EAAWoD,WAAWpc,OAAO59B,GAC9B,MAAM,IAAIg3D,GAAoB,oDAElC,GAAI1nE,KAAK+mD,OAAOzY,OAAO59B,GACnB,MAAM,IAAIg3D,GAAoB,uCAMlC,OAFA1nE,KAAKipG,wBAAwBrB,GAC7B5nG,KAAKoL,IAAI,kDAAmDsF,EAAIk3C,GF9CjEza,eAAsC2oB,EAAWh1D,EAAQsK,EAAKk8C,EAAY96C,GAE7E,GADApB,EAAI,4BAA6Bk8C,EAAWoD,YAC7B,MAAXl+C,EACA,MAAM,IAAIk7D,GAAoB,iCAElC,MAAMhgB,EAAO,CAAC,EAUd,GATIl7C,EAAQm7F,YAAYlmG,OAAS,IAC7BimD,EAAK+7C,UAAYj3F,EAAQm7F,YAAYrjG,KAAIkL,IAAO,CAC5C05F,aAAa,EACb1F,UAAW,GAAUh0F,QAGzBhD,EAAQo7C,UAAUnmD,OAAS,IAC3BimD,EAAKE,UAAYp7C,EAAQo7C,WAEJ,MAArBp7C,EAAQ68D,UAAmB,CAC3B,MAAMA,EAAYqlB,GAAsBliF,EAAQ68D,WAEhD,IADeomB,GAAoBpmB,GACvB/6B,OAAOgZ,EAAWoD,YAC1B,MAAM,IAAIgd,GAAoB,0CAElChgB,EAAK2hB,UAAYA,CACrB,CACA,IAAI7qB,EAEJ,GAAgC,MAA5BhyC,EAAQq7F,iBAA0B,CAClCz8F,EAAI60F,MAAM,oCAAqC34C,EAAWoD,YAC1D,IAAIy+C,EAAqB38F,EAAQq7F,iBACjC,MAAMnD,QAAiBL,GAAe+E,eAAeD,EAAoB7F,GAAWO,QACpF,IAAIF,EAAaL,GAAWqB,mBAAmBD,EAAS5xD,SACxD,MAAMu2D,EAAe9Z,GAAcmV,EAASr7B,UAAUM,SAEtD,IAAKg6B,EAAW58C,OAAOzY,OAAO+6D,GAC1B,MAAM,IAAI3hC,GAAoB,uDAGlC,IAAKpgB,EAAWoD,WAAWpc,OAAOq1D,EAAW58C,QACzC,MAAM,IAAI2gB,GAAoB,4CAElC,IAAI4hC,EACJ,IACIA,QAAqBxzC,EAAU12D,IAAIukG,EAAW58C,OAClD,CACA,MAAOtgC,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,GAAoB,MAAhB6iF,IAEA5hD,EAAKQ,SAAWohD,EAAaphD,SAEU,MAAnCohD,EAAaH,oBAA4B,CACzC,MAAMI,QAAuBlF,GAAeM,mBAAmB2E,EAAaH,oBACtEK,EAAelG,GAAWqB,mBAAmB4E,EAAez2D,SAE9D02D,EAAa5F,WAAaD,EAAWC,YACrCx4F,EAAI,2FAA4Fo+F,EAAa5F,UAAWD,EAAWC,WACnID,EAAa6F,EACbL,EAAqBG,EAAaH,mBAE1C,CAGJzhD,EAAKyhD,mBAAqBA,EAE1BzhD,EAAK+7C,UAAYE,EAAWb,WAAWx+F,KAAIk/F,IAAa,CACpD0F,aAAa,EACb1F,gBAEJhlD,EAAS,CACLumC,IAAK4e,EAAWC,UAChBH,UAAWE,EAAWb,WAE9B,MAEI13F,EAAI,uCAAwCk8C,EAAWoD,YAI3D,GAFAt/C,EAAI60F,MAAM,mBAAoB34C,EAAWoD,WAAYhD,SAC/CoO,EAAU2zC,MAAMniD,EAAWoD,WAAYhD,GACjB,MAAxBl7C,EAAQk7F,cAAmD,MAA3Bl7F,EAAQi7F,gBAAyB,CACjE,MAAMv/C,EAAW,CAAC,EACU,MAAxB17C,EAAQk7F,eACRx/C,EAASsgD,aAAe,GAAqBh8F,EAAQk7F,eAE1B,MAA3Bl7F,EAAQi7F,kBACRv/C,EAASugD,gBAAkB,GAAqBj8F,EAAQi7F,kBAE5Dr8F,EAAI60F,MAAM,sBAAuB34C,EAAWoD,WAAYxC,SAClD4N,EAAUzyC,MAAMikC,EAAWoD,WAAY,CACzCxC,YAER,CACA,MAAMpzC,EAAS,CACXiyC,OAAQO,EAAWoD,WACnB+8C,gBAAiBj7F,EAAQi7F,gBACzBC,aAAcl7F,EAAQk7F,aACtBr+B,UAAW78D,EAAQ68D,UACnBs+B,YAAan7F,EAAQm7F,YAAYrjG,KAAIkL,GAAO,GAAUA,KACtDo4F,aAAsC,MAAxBp7F,EAAQo7F,kBAAuB1oG,EAAY,GAAUsN,EAAQo7F,cAC3EhgD,UAAWp7C,EAAQo7C,UACnBigD,iBAAkBrpD,EAClB8I,cAGJ,OADAxmD,EAAOyrD,kBAAkB,gBAAiB,CAAE5E,OAAQ7yC,IAC7CA,CACX,CE3De40F,CAAuB1pG,KAAK81D,UAAW91D,KAAKc,OAAQd,KAAKoL,IAAKk8C,EAAY96C,EACrF,CACA,uBAAAy8F,CAAwBrB,GACpB,MAAM+B,EFjEP,SAA2B76C,GAC9B,GAAY,MAARA,GAAgBA,EAAKrtD,OAAS,EAC9B,IACI,OAAO,GAAUqtD,EACrB,CACA,MACA,CAER,CEyDkC86C,CAAkBhC,GACnB,MAArB+B,IAGJ3pG,KAAKoL,IAAI60F,MAAM,8BAA+B0J,GAC1ChE,GAAUgE,GACV3pG,KAAKoL,IAAI60F,MAAM,oCAhFT,KAmFK0J,EAAkBh3C,eACtB,GAAG,IC5Ff,SAAyBoH,GAC5B,IACI,OAAQ1yB,EAAOroC,IAAU+6D,EAAGpH,eAC5B,GAAa,MAAT3zD,EACA,OAAO,EAEX,GAVU,KAUNqoC,EACA,OCDuBlU,EDCSn0B,ECA1B,IAAI,GDAU,YCCfg1B,SAASb,EDCtB,CACA,MACA,CCLG,IAA4BA,EDM/B,OAAO,CACX,CD+E2C02E,CAAgBF,GAI/C,GAAItD,WAAWsD,KAOnB3pG,KAAKoL,IAAI60F,MAAM,gCACfjgG,KAAKioG,eAAe6B,gBAAgBH,IAXhC3pG,KAAKoL,IAAI60F,MAAM,kEAYvB,CAKA,oBAAMyI,CAAe/+D,GACjB,MAAM,WAAE2d,EAAU,OAAErB,GAAWtc,EACzBsa,EAAS8kD,YAAYniF,QAAQ5mB,KAAK4mB,SAExC,IACI,MAAMi8E,QAAiB7iG,KAAK81D,UAAU12D,IAAIY,KAAK+mD,QACzC+7C,EAAa9iG,KAAKioG,eAAe8B,eAAezlG,KAAIy1D,GAAMA,EAAGtF,gBAAgB,GAAU,OAAO1/C,QACpG,IAAI8yF,EAAmBhF,EAASsG,mBAChC,GAAIrG,EAAWrhG,OAAS,GAAyB,MAApBomG,EAA0B,CACnD,MAAMlE,EAAa,IAAIL,GAAW,CAC9Bv8C,OAAQ/mD,KAAK+mD,OACb+7C,eAGJ+E,SADuBxD,GAAe2F,KAAKrG,EAAY3jG,KAAKoqE,aAChC45B,UAAU/hF,UAC1C,CACA,IAAI2lF,EAAetgD,EAAW2iD,WAAWn7F,MACpCg4F,GAAatE,QAAQl7C,EAAW2iD,cACjCrC,OAAe1oG,GAEnB,MAAMqoG,EAAKF,GAASphD,GAAQshD,GAAG,UACzBA,EAAG73F,MAAM,CACX+3F,gBAAiBznG,KAAK2zD,KAAK8zC,gBAC3BC,aAAc1nG,KAAK2zD,KAAK+zC,aACxBr+B,UAAWK,GAAoB1pE,KAAKoqE,WAAWf,WAC/Cs+B,YAAa7E,EAAWx+F,KAAIwqD,GAAQA,EAAKhgD,QACzC+4F,mBACAD,eACAhgD,UAAWi7C,EAASj7C,WACrB,CACC3D,iBAEEgC,EAAO+iD,MAAM,CACf/kD,UAER,CACA,MAAOx9B,GACHzmB,KAAKoL,IAAIoc,MAAM,wCAAyCf,GACxDw/B,EAAO8d,MAAMt9C,EACjB,CACJ,EG/GG,SAASoiF,GAASh9F,EAAO,CAAC,GAC7B,OAAQu8C,GAAe,IAAIo/C,GAAcp/C,EAAYv8C,EACzD,CC5CO,SAASq+F,GAAY/jG,EAAQiF,GAChC,MAAMw6B,ECHH,SAAqBrzB,GACxB,GAAW,MAAPA,EAAa,CACb,GAAoC,mBAAzBA,EAAIkxB,OAAOsb,UAClB,OAAOxsC,EAAIkxB,OAAOsb,YAEtB,GAAyC,mBAA9BxsC,EAAIkxB,OAAOC,eAClB,OAAOnxB,EAAIkxB,OAAOC,iBAEtB,GAAwB,mBAAbnxB,EAAIlK,KACX,OAAOkK,CAEf,CACA,MAAM,IAAI/T,MAAM,0CACpB,CDVgB2rG,CAAYhkG,GAAQ09B,WEH7B,IAAmBod,EACT,OADSA,EFIRrb,IEAe,mBAAfqb,EAAM1d,MACO,mBAAhB0d,EAAM3d,OACY,mBAAlB2d,EAAM+rC,SFDbpnD,EAAItC,OAAM7c,IACNrb,EAAIoc,MAAM,qCAAsCf,EAAI,GAGhE,CGRA,MAEM2jF,GAAmB,KACxB,MAAM5iF,EAAQ,IAAIhpB,MAAM,iBAExB,OADAgpB,EAAMzmB,KAAO,aACNymB,CAAK,EAGP6iF,GAAe,IAAIz8D,QAoDzB,GAlDO,UAAsBrnB,aAAc+jF,EAAczjF,WAAY0jF,GAAc,CAAC,GAEnF,MAAO,CAACC,GAAexrG,QAAOilD,UAAU,CAAC,KAExC,GAAIA,GAAQQ,QACX,OAAOloB,QAAQC,OAAO4tE,MAGvB,IAAIK,EACAC,EACAC,EACJ,MAAMprG,EAAQ+qG,GAAgB/jF,aAExBqkF,EAAiB,KACtBrrG,EAAMkrG,GACNE,EAAeP,KAAmB,EAS7BS,EAAe,IAAItuE,SAAQ,CAACr4B,EAASs4B,KAC1CkuE,EAAS,KANLzmD,GACHA,EAAOK,oBAAoB,QAASsmD,GAOpC1mG,EAAQlF,EAAM,EAGf2rG,EAAiBnuE,EACjBiuE,GAAaF,GAAc1jF,YAAY6jF,EAAQF,EAAa,IAa7D,OAVIvmD,GACHA,EAAOG,iBAAiB,QAASwmD,EAAgB,CAAC7qG,MAAM,IAGzDsqG,GAAa/qG,IAAIurG,GAAc,KAC9BtrG,EAAMkrG,GACNA,EAAY,KACZC,GAAQ,IAGFG,CAAY,CAErB,CAEcC,GCxDP,MAAMC,WAAuBvsG,MAChCwsG,gBACAC,aACAC,eACAC,kBACA,WAAA77F,CAAY9C,EAAU,sBAAuB4+F,GACzCh7D,MAAM5jC,GACNxM,KAAKe,KAAO,iBACZf,KAAKgrG,gBAAkBI,EAAMJ,gBAC7BhrG,KAAKirG,aAAeG,EAAMH,aAC1BjrG,KAAKkrG,eAAiBE,EAAMF,eAC5BlrG,KAAKmrG,kBAAoBC,EAAMD,iBACnC,EAEG,MAAME,WAAuB7sG,MAChCy0D,YAAc,iBACd,WAAA3jD,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,gBAChB,ECpBG,MAAMuqG,GACTC,cACAp0B,OACAq0B,SACAC,cACAC,WACAC,qBACAC,UACA,WAAAt8F,CAAYwtB,EAAO,CAAC,GAChB98B,KAAKm3E,OAASr6C,EAAKq6C,QAAU,EAC7Bn3E,KAAKwrG,SAAW1uE,EAAK0uE,UAAY,EACjCxrG,KAAKyrG,cAAgB3uE,EAAK2uE,eAAiB,EAC3CzrG,KAAK0rG,WAAa5uE,EAAK4uE,aAAc,EACrC1rG,KAAK2rG,qBAAuB7uE,EAAK6uE,sBAAyC,IAAhB3rG,KAAKwrG,SAAkBxrG,KAAKm3E,OACtFn3E,KAAK4rG,UAAY9uE,EAAK8uE,WAAa,QACnC5rG,KAAKurG,cAAgB,IAAIM,EAC7B,CACA,aAAMzsD,CAAQrgD,EAAK+sG,EAAkB,EAAG7xF,EAAU,CAAC,GAC/C,MAAM8xF,EAAQ/rG,KAAKgsG,OAAOjtG,GACpBktG,EAAcjsG,KAAKksG,mBAAmBjyF,GAC5C,IAAI2rB,EAAM5lC,KAAKurG,cAAcY,OAAOJ,EAAOD,EAAiBG,GAE5D,GADArmE,EAAIolE,gBAAkB/hG,KAAK1K,IAAIyB,KAAKm3E,OAASvxC,EAAIslE,eAAgB,GAC7DtlE,EAAIslE,eAAiBlrG,KAAKm3E,OAM1B,MAJIn3E,KAAKyrG,cAAgB,GAAK7lE,EAAIslE,gBAAmBlrG,KAAKm3E,OAAS20B,IAE/DlmE,EAAM5lC,KAAKurG,cAAcjsG,IAAIysG,EAAOnmE,EAAIslE,eAAgBlrG,KAAKyrG,gBAE3D,IAAIV,GAAe,sBAAuBnlE,GAE/C,GAAI5lC,KAAK0rG,YAAc9lE,EAAIqlE,aAAe,IAAMrlE,EAAIulE,kBAAmB,CAExE,IAAIiB,EAAUnjG,KAAK01B,KAAKiH,EAAIqlE,cAAgBrlE,EAAIolE,gBAAkB,IAC9DoB,EAAUpsG,KAAK2rG,uBACfS,EAAUxmE,EAAIslE,eAAiBlrG,KAAK2rG,4BAElC,GAAMS,EAChB,CACA,OAAOxmE,CACX,CACA,OAAAymE,CAAQttG,EAAKo4E,EAAS,EAAGl9D,EAAU,CAAC,GAChC,MAAM8xF,EAAQ/rG,KAAKgsG,OAAOjtG,GACpBktG,EAAcjsG,KAAKksG,mBAAmBjyF,GACtC2rB,EAAM5lC,KAAKurG,cAAcY,OAAOJ,EAAO50B,EAAQ80B,GAErD,OADArmE,EAAIolE,gBAAkB/hG,KAAK1K,IAAIyB,KAAKm3E,OAASvxC,EAAIslE,eAAgB,GAC1DtlE,CACX,CACA,MAAA0mE,CAAOvtG,EAAKo4E,EAAS,EAAGl9D,EAAU,CAAC,GAC/B,MAAM8xF,EAAQ/rG,KAAKgsG,OAAOjtG,GACpBktG,EAAcjsG,KAAKksG,mBAAmBjyF,GACtC2rB,EAAM5lC,KAAKurG,cAAcY,OAAOJ,GAAQ50B,EAAQ80B,GAEtD,OADArmE,EAAIolE,gBAAkB/hG,KAAK1K,IAAIyB,KAAKm3E,OAASvxC,EAAIslE,eAAgB,GAC1DtlE,CACX,CAOA,KAAAnxB,CAAM1V,EAAKktG,GACP,MAAMM,EAA2B,IAAdN,EACbO,EAAaxsG,KAAKm3E,OAAS,EAEjC,OADAn3E,KAAKurG,cAAcjsG,IAAIU,KAAKgsG,OAAOjtG,GAAMytG,EAAYP,GAC9C,CACHjB,gBAAiB,EACjBC,aAA6B,IAAfsB,GAAoB,EAAIA,EACtCrB,eAAgBsB,EAChBrB,mBAAmB,EAE3B,CACA,GAAA7rG,CAAIP,EAAKo4E,EAAQ80B,EAAc,GAC3B,MAAMM,EAAgE,KAAlDN,GAAe,EAAIA,EAAcjsG,KAAKwrG,UAE1D,OADAxrG,KAAKurG,cAAcjsG,IAAIU,KAAKgsG,OAAOjtG,GAAMo4E,EAAQ80B,GAC1C,CACHjB,gBAAiB,EACjBC,aAA6B,IAAfsB,GAAoB,EAAIA,EACtCrB,eAAgB/zB,EAChBg0B,mBAAmB,EAE3B,CACA,GAAA/rG,CAAIL,GACA,MAAM6mC,EAAM5lC,KAAKurG,cAAcnsG,IAAIY,KAAKgsG,OAAOjtG,IAI/C,OAHW,MAAP6mC,IACAA,EAAIolE,gBAAkB/hG,KAAK1K,IAAIyB,KAAKm3E,OAASvxC,EAAIslE,eAAgB,IAE9DtlE,CACX,CACA,OAAO7mC,GACHiB,KAAKurG,cAAcrkD,OAAOlnD,KAAKgsG,OAAOjtG,GAC1C,CACA,kBAAAmtG,CAAmBjyF,GACf,OAA+B,MAA3BA,GAASwyF,gBAA0BxyF,EAAQwyF,gBAAkB,EACtDxyF,EAAQwyF,eAEZzsG,KAAKwrG,QAChB,CACA,MAAAQ,CAAOjtG,GACH,OAAOiB,KAAK4rG,UAAUnqG,OAAS,EAAI,GAAGzB,KAAK4rG,aAAa7sG,IAAQA,CACpE,CACA,QAAA2tG,CAASX,GACL,OAAOA,EAAMtkG,UAAUzH,KAAK4rG,UAAUnqG,OAC1C,EAEG,MAAMoqG,GACTxxE,QACA,WAAA/qB,GACItP,KAAKq6B,QAAU,IAAIwT,GACvB,CACA,MAAAs+D,CAAOptG,EAAKC,EAAO2tG,GACf,MAAMC,EAAW5sG,KAAKq6B,QAAQj7B,IAAIL,GAClC,GAAgB,MAAZ6tG,EAAkB,CAClB,MAAMC,EAAwC,MAAtBD,EAASE,UAC3BF,EAASE,UAAUnmF,WAAY,IAAInc,MAAOmc,WACzC,EACP,OAA0B,MAAtBimF,EAASE,WAAqBD,EAAkB,GAEhDD,EAAS5tG,OAASA,EACX,CACHgsG,gBAAiB,EACjBC,aAAc4B,EACd3B,eAAgB0B,EAAS5tG,MACzBmsG,mBAAmB,IAGpBnrG,KAAKV,IAAIP,EAAKC,EAAO2tG,EAChC,CACA,OAAO3sG,KAAKV,IAAIP,EAAKC,EAAO2tG,EAChC,CACA,GAAArtG,CAAIP,EAAKC,EAAO2tG,GACZ,MAAMI,EAA2B,IAAdJ,EACbC,EAAW5sG,KAAKq6B,QAAQj7B,IAAIL,GAClB,MAAZ6tG,GACArmF,aAAaqmF,EAASnC,WAE1B,MAAMlG,EAAS,CACXvlG,QACA8tG,UAAWC,EAAa,EAAI,IAAIviG,KAAKA,KAAKm2D,MAAQosC,QAAc7tG,GAWpE,OATAc,KAAKq6B,QAAQ/6B,IAAIP,EAAKwlG,GAClBwI,EAAa,IACbxI,EAAOkG,UAAY5jF,YAAW,KAC1B7mB,KAAKq6B,QAAQ6sB,OAAOnoD,EAAI,GACzBguG,GAC2B,MAA1BxI,EAAOkG,UAAU3jF,OACjBy9E,EAAOkG,UAAU3jF,SAGlB,CACHkkF,gBAAiB,EACjBC,aAA6B,IAAf8B,GAAoB,EAAIA,EACtC7B,eAAgB3G,EAAOvlG,MACvBmsG,mBAAmB,EAE3B,CACA,GAAA/rG,CAAIL,GACA,MAAM6tG,EAAW5sG,KAAKq6B,QAAQj7B,IAAIL,GAClC,GAAgB,MAAZ6tG,EAIA,MAAO,CACH5B,gBAAiB,EACjBC,aAL0C,MAAtB2B,EAASE,UAC3BF,EAASE,UAAUnmF,WAAY,IAAInc,MAAOmc,WACzC,EAIHukF,eAAgB0B,EAAS5tG,MACzBmsG,mBAAmB,EAG/B,CACA,OAAOpsG,GACH,MAAMwlG,EAASvkG,KAAKq6B,QAAQj7B,IAAIL,GAChC,OAAc,MAAVwlG,IACwB,MAApBA,EAAOkG,WACPlkF,aAAag+E,EAAOkG,WAExBzqG,KAAKq6B,QAAQ6sB,OAAOnoD,IACb,EAGf,ECrLG,IAAIiuG,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,GAAmBtuG,OAAOmd,OAAO,CAC1C,EAAG,aACH,EAAG,mBACH,EAAG,oBACH,EAAG,iBACH,EAAG,kBACH,EAAG,iBACH,EAAG,oBAEMoxF,GAAwBvuG,OAAOmd,OAAO,CAC/CqxF,WAAYH,GAAaG,WACzBC,QAASJ,GAAaK,kBACtBC,MAAON,GAAaO,gBACpBC,MAAOR,GAAaS,kBAEXC,GAAuB/uG,OAAOmd,OAAO,CAC9CsxF,QAASJ,GAAaW,iBACtBL,MAAON,GAAaY,eACpBJ,MAAOR,GAAaa,iBCzBXC,GAAe,GAAK,GAE1B,MAAM,GACTC,QACAC,YACAC,gBACAC,gCACA,WAAA5+F,CAAY64F,EAAiB2F,GAAcK,EANb,SAO1BnuG,KAAK+tG,QAAU,IAAIlvD,GACnB7+C,KAAKguG,YAAc,KACnBhuG,KAAKiuG,gBAAkB9F,EACvBnoG,KAAKkuG,gCAAkCC,CAC3C,CACA,KAAAz+F,CAAM2N,GACF,GAAa,MAATA,GAAkC,IAAjBA,EAAM5b,OACvB,MAAO,GAGX,GADAzB,KAAK+tG,QAAQ/uD,OAAO3hC,GAChBrd,KAAK+tG,QAAQv9F,WAAaxQ,KAAKkuG,gCAC/B,MAAM,IAAIxmC,GAAoB,6CAElC,MAAMoX,EAAO,GACb,KAA+B,IAAxB9+E,KAAK+tG,QAAQtsG,QAAc,CAC9B,GAAwB,MAApBzB,KAAKguG,YACL,IACIhuG,KAAKguG,YAAchuG,KAAKouG,cAAcpuG,KAAK+tG,QAC/C,CACA,MAAOtnF,GACH,GAAiB,wBAAbA,EAAI1lB,KACJ,MAAM0lB,EAEV,KACJ,CAEJ,MAAM,GAAE/V,EAAE,KAAEvL,EAAI,OAAE1D,EAAM,OAAEyB,GAAWlD,KAAKguG,YAE1C,GAD2BhuG,KAAK+tG,QAAQtsG,OAASyB,EACxBzB,EACrB,MAEJ,MAAM+1C,EAAM,CACR9mC,KACAvL,QAEAA,IAAS6nG,GAAaG,YAAchoG,IAAS6nG,GAAaK,mBAAqBloG,IAAS6nG,GAAaW,mBACrGn2D,EAAI7N,KAAO3pC,KAAK+tG,QAAQtuD,QAAQv8C,EAAQA,EAASzB,IAErDq9E,EAAKt+E,KAAKg3C,GACVx3C,KAAK+tG,QAAQ3uD,QAAQl8C,EAASzB,GAC9BzB,KAAKguG,YAAc,IACvB,CACA,OAAOlvB,CACX,CAIA,aAAAsvB,CAAczkE,GACV,MAAQ3qC,MAAO8W,EAAC,OAAE5S,GAAWmrG,GAAW1kE,IAChC3qC,MAAOyC,EAAQyB,OAAQ+D,GAAQonG,GAAW1kE,EAAMzmC,GAClDiC,EAAW,EAAJ2Q,EAEb,GAA8B,MAA1Bm3F,GAAiB9nG,GACjB,MAAM,IAAI3G,MAAM,0BAA0B2G,KAG9C,GAAI1D,EAASzB,KAAKiuG,gBACd,MAAM,IAAIvmC,GAAoB,0BAGlC,MAAO,CAAEh3D,GAAIoF,GAAK,EAAG3Q,OAAMjC,OAAQA,EAAS+D,EAAKxF,SACrD,EAEJ,MAAM,GAAM,IACN,GAAO,IACb,SAAS4sG,GAAW7+F,EAAKtM,EAAS,GAC9B,IAGI0d,EAHAglB,EAAM,EACNt9B,EAAQ,EACRokC,EAAUxpC,EAEd,MAAM1B,EAAIgO,EAAI/N,OACd,EAAG,CACC,GAAIirC,GAAWlrC,GAAK8G,EAAQ,GAExB,MADApF,EAAS,EACH,IAAIszB,WAAW,2BAEzB5V,EAAIpR,EAAIpQ,IAAIstC,KACZ9G,GAAOt9B,EAAQ,IACRsY,EAAI,KAAStY,GACbsY,EAAI,IAAQ3X,KAAK0qB,IAAI,EAAGrrB,GAC/BA,GAAS,CACb,OAASsY,GAAK,IAEd,MAAO,CACH5hB,MAAO4mC,EACP1iC,OAHJA,EAASwpC,EAAUxpC,EAKvB,CC9FA,MAAMorG,GAAY,MAsCZ39E,GAAU,IArChB,MACI49E,MACAC,YACA,WAAAl/F,GACItP,KAAKuuG,MAAQvpF,EAAYspF,IACzBtuG,KAAKwuG,YAAc,CACvB,CAIA,KAAA9+F,CAAM8nC,EAAKkI,GACP,MAAM19B,EAAOhiB,KAAKuuG,MAClB,IAAIrrG,EAASlD,KAAKwuG,YAClB,EAAch3D,EAAI9mC,IAAM,EAAI8mC,EAAIryC,KAAM6c,EAAM9e,GAC5CA,GAAU,EAAsBs0C,EAAI9mC,IAAM,EAAI8mC,EAAIryC,MAC7CqyC,EAAIryC,OAAS6nG,GAAaG,YAAc31D,EAAIryC,OAAS6nG,GAAaK,mBAAqB71D,EAAIryC,OAAS6nG,GAAaW,kBAAiC,MAAZn2D,EAAI7N,MAK3I,EAAc,EAAG3nB,EAAM9e,GACvBA,GAAU,EAAsB,KALhC,EAAcs0C,EAAI7N,KAAKloC,OAAQugB,EAAM9e,GACrCA,GAAU,EAAsBs0C,EAAI7N,KAAKloC,SAM7C,MAAMgtG,EAASzsF,EAAKC,SAASjiB,KAAKwuG,YAAatrG,GAC3CorG,GAAYprG,EAAS,KACrBlD,KAAKuuG,MAAQvpF,EAAYspF,IACzBtuG,KAAKwuG,YAAc,GAGnBxuG,KAAKwuG,YAActrG,EAEvBw8C,EAAKV,OAAOyvD,GACPj3D,EAAIryC,OAAS6nG,GAAaG,YAAc31D,EAAIryC,OAAS6nG,GAAaK,mBAAqB71D,EAAIryC,OAAS6nG,GAAaW,kBAAiC,MAAZn2D,EAAI7N,MAC3I+V,EAAKV,OAAOxH,EAAI7N,KAExB,GCrCG,MAAM+kE,WAA+BlwG,MACxC,WAAA8Q,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,ECCJ,SAAS,GAAUkgD,GACf,OAAa,MAATA,GAGyB,mBAAfA,EAAM1d,MACO,mBAAhB0d,EAAM3d,OACY,mBAAlB2d,EAAM+rC,OACrB,CACO,MAAM2hB,GACTj+F,GACAk+F,UACAvoD,SACA0B,SACAG,SACA/hD,OACAiqB,OACAy+E,WACA7mD,YACA58C,IACA0jG,eACAC,QACAC,OACAC,OACAC,aACA1rD,MACA2rD,YACAC,aACAC,QACAC,QACAC,sBACAC,YACA,WAAAlgG,CAAYzD,GACR7L,KAAK8uG,eAAiB,IAAIW,gBAC1BzvG,KAAK+uG,QAAU,KACf/uG,KAAKgvG,OAAS,KACdhvG,KAAKoL,IAAMS,EAAKT,IAEhBpL,KAAKowB,OAAS,OACdpwB,KAAK6uG,WAAa,QAClB7uG,KAAKgoD,YAAc,QACnBhoD,KAAK0Q,GAAK7E,EAAK6E,GACf1Q,KAAKkoD,SAAWr8C,EAAKq8C,UAAY,CAAC,EAClCloD,KAAK4uG,UAAY/iG,EAAK+iG,UACtB5uG,KAAKqmD,SAAW,CACZ71B,KAAMhmB,KAAKm2D,OAEf3gE,KAAKuvG,sBAAwB1jG,EAAK0jG,uBA/CD,IAgDjCvvG,KAAKwjD,MAAQ33C,EAAK23C,MAClBxjD,KAAKmvG,YAActjG,GAAMsjG,YACzBnvG,KAAKovG,aAAevjG,GAAMujG,aAC1BpvG,KAAKqvG,QAAUxjG,GAAMwjG,QACrBrvG,KAAKsvG,QAAUzjG,GAAMyjG,QACrBtvG,KAAKmG,OAASnG,KAAKkvG,aAAe9rD,GAAS,CACvCI,MAAQ/8B,IACO,MAAPA,EACAzmB,KAAKoL,IAAI60F,MAAM,0BAA2Bx5E,GAG1CzmB,KAAKoL,IAAI60F,MAAM,gBAEnBjgG,KAAK0vG,YAAYjpF,EAAI,IAI7BzmB,KAAK8lD,KAAO9lD,KAAK8lD,KAAK1pB,KAAKp8B,KAC/B,CACA,UAAM8lD,CAAK3/C,GACP,GAAyB,UAArBnG,KAAKgoD,YACL,MAAM,IAAImf,GAAiB,0BAA0BnnE,KAAKgoD,4BAE9D,IACIhoD,KAAKgoD,YAAc,UACnB,MAAM/tC,EAAU,CACZgqC,OAAQjkD,KAAK8uG,eAAe7qD,QAEhC,GAAuB,aAAnBjkD,KAAK4uG,UAA0B,CAC/B,MAAMhpE,EAAM5lC,KAAK2vG,cAAc11F,GAC3B,GAAU2rB,UACJA,CAEd,CACA,MAAMgqE,EAAgB,KAClB1F,GAAY/jG,EAAQnG,KAAKoL,IAAI,EAEjC,IACIpL,KAAK8uG,eAAe7qD,OAAOG,iBAAiB,QAASwrD,GACrD5vG,KAAKoL,IAAI60F,MAAM,4BACf,UAAW,IAAIt2D,KAAQxjC,EAAQ,CAC3BwjC,EAAOA,aAAgB15B,WAAa,IAAI4uC,GAAelV,GAAQA,EAC/D,MAAM/D,EAAM5lC,KAAK6vG,SAASlmE,EAAM1vB,GAC5B,GAAU2rB,KACV5lC,KAAKwvG,YAAchtD,WACb5c,EACN5lC,KAAKwvG,YAAYtrG,UACjBlE,KAAKwvG,iBAActwG,EAE3B,CACJ,CACA,QACIc,KAAK8uG,eAAe7qD,OAAOK,oBAAoB,QAASsrD,EAC5D,CACA5vG,KAAKoL,IAAI60F,MAAM,0DAA2DjgG,KAAKgoD,aACtD,YAArBhoD,KAAKgoD,cACLhoD,KAAKgoD,YAAc,UACnBhoD,KAAKoL,IAAI60F,MAAM,oCACTjgG,KAAK8vG,eAAe,CACtB7rD,OAAQ8kD,YAAYniF,QAAQ5mB,KAAKuvG,yBAErCvvG,KAAKgoD,YAAc,UAEvBhoD,KAAK+vG,WACT,CACA,MAAOtpF,GAGH,MAFAzmB,KAAKoL,IAAI60F,MAAM,kDAAmDx5E,GAClEzmB,KAAK+jE,MAAMt9C,GACLA,CACV,CACA,QACIzmB,KAAKoL,IAAI60F,MAAM,oBACfjgG,KAAK+uG,QAAQ7qG,SACjB,CACJ,CACA,WAAAwrG,CAAYjpF,GACuB,MAA3BzmB,KAAKqmD,SAAS2pD,YAGlBhwG,KAAKqmD,SAAS2pD,UAAYxlG,KAAKm2D,MAC/B3gE,KAAK6uG,WAAa,SACP,MAAPpoF,GAA8B,MAAfzmB,KAAKivG,SACpBjvG,KAAKivG,OAASxoF,GAElBzmB,KAAKmvG,gBAC2B,MAA5BnvG,KAAKqmD,SAAS4pD,YACdjwG,KAAKoL,IAAI60F,MAAM,yBACfjgG,KAAKqmD,SAAS2iD,MAAQx+F,KAAKm2D,MACP,YAAhB3gE,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,SAClCpwB,KAAKowB,OAAS,UAEA,MAAdpwB,KAAKwjD,OACLxjD,KAAKwjD,MAAMxjD,KAAKivG,QAEpBjvG,KAAKgvG,OAAO9qG,WAGZlE,KAAKoL,IAAI60F,MAAM,yCAEvB,CACA,SAAA8P,CAAUtpF,GAC0B,MAA5BzmB,KAAKqmD,SAAS4pD,aAGlBjwG,KAAKqmD,SAAS4pD,WAAazlG,KAAKm2D,MAChC3gE,KAAKgoD,YAAc,SACR,MAAPvhC,GAA8B,MAAfzmB,KAAKivG,SACpBjvG,KAAKivG,OAASxoF,GAElBzmB,KAAKovG,iBAC0B,MAA3BpvG,KAAKqmD,SAAS2pD,WACdhwG,KAAKoL,IAAI60F,MAAM,yBACfjgG,KAAKqmD,SAAS2iD,MAAQx+F,KAAKm2D,MACP,YAAhB3gE,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,SAClCpwB,KAAKowB,OAAS,UAEA,MAAdpwB,KAAKwjD,OACLxjD,KAAKwjD,MAAMxjD,KAAKivG,QAEpBjvG,KAAKgvG,OAAO9qG,WAGZlE,KAAKoL,IAAI60F,MAAM,yCAEvB,CAEA,WAAM+I,CAAM/uF,GACY,SAAhBja,KAAKowB,SAGTpwB,KAAKoL,IAAI60F,MAAM,sBACfjgG,KAAKowB,OAAS,gBAERo0B,GAAWjoB,QAAQ6oB,IAAI,CACzBplD,KAAKiwG,WAAWh2F,GAChBja,KAAKgwG,UAAU/1F,GACfja,KAAKgvG,OAAOvsD,UACZxoC,GAASgqC,QACbjkD,KAAKowB,OAAS,SACdpwB,KAAKoL,IAAI60F,MAAM,qBACnB,CACA,eAAM+P,CAAU/1F,EAAU,CAAC,GACvB,GAAwB,YAApBja,KAAK6uG,YAAgD,WAApB7uG,KAAK6uG,WACtC,OAEJ7uG,KAAKoL,IAAI60F,MAAM,gEAAiEjgG,KAAK6uG,YACrF,MAAMA,EAAa7uG,KAAK6uG,WACxB7uG,KAAK6uG,WAAa,UACE,UAAhB7uG,KAAKowB,QAAsC,YAAhBpwB,KAAKowB,QAAmD,MAA3BpwB,KAAKqmD,SAAS2pD,YACtEhwG,KAAKoL,IAAI60F,MAAM,mCACTjgG,KAAKkwG,cAAcj2F,IAEV,UAAf40F,IACA7uG,KAAKoL,IAAI60F,MAAM,oDAAqDjgG,KAAKkvG,aAAanrD,gBACtF/jD,KAAKkvG,aAAajoG,OAEtBjH,KAAKoL,IAAI60F,MAAM,gCACnB,CACA,gBAAMgQ,CAAWh2F,EAAU,CAAC,GACC,YAArBja,KAAKgoD,aAAkD,WAArBhoD,KAAKgoD,cAG3ChoD,KAAKoL,IAAI60F,MAAM,iEAAkEjgG,KAAKgoD,aAC7D,UAArBhoD,KAAKgoD,cACLhoD,KAAKoL,IAAI60F,MAAM,kDACTz7C,GAAWxkD,KAAK8lD,KAAK,IAAK7rC,EAAQgqC,SAEnB,YAArBjkD,KAAKgoD,cAEmB,MAApBhoD,KAAKwvG,mBACChrD,GAAWxkD,KAAKwvG,YAAY/sD,QAASxoC,EAAQgqC,QAGvDjkD,KAAKoL,IAAI60F,MAAM,mCACfjgG,KAAK8uG,eAAe/qC,cACdvf,GAAWxkD,KAAK+uG,QAAQtsD,QAASxoC,EAAQgqC,SAEnDjkD,KAAKgoD,YAAc,SACnBhoD,KAAKoL,IAAI60F,MAAM,iCACnB,CAKA,KAAAl8B,CAAMt9C,GACF,GAAoB,WAAhBzmB,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,OAC9D,OAEJpwB,KAAKoL,IAAI,mBAAoBqb,GAE7BzmB,KAAKoL,IAAI,+BACT,MAAMw6B,EAAM5lC,KAAKmwG,YACb,GAAUvqE,IACVA,EAAItC,OAAO7c,IACPzmB,KAAKoL,IAAIoc,MAAM,8BAA+Bf,EAAI,IAG1DzmB,KAAKowB,OAAS,UACdpwB,KAAKqmD,SAAS0d,MAAQv5D,KAAKm2D,MAC3B3gE,KAAKowG,oBAAoB3pF,GACzBzmB,KAAKsvG,UAAU7oF,EACnB,CAKA,KAAAlS,GACI,GAAoB,WAAhBvU,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,OAC9D,OAEJ,MAAM3J,EAAM,IAAIygD,GAAiB,gBACjClnE,KAAKowB,OAAS,QACdpwB,KAAKqmD,SAAS9xC,MAAQ/J,KAAKm2D,MAC3B3gE,KAAKowG,oBAAoB3pF,GACzBzmB,KAAKqvG,WACT,CACA,mBAAAe,CAAoB3pF,GAChBzmB,KAAKqwG,WAAW5pF,GAChBzmB,KAAKswG,aAAa7pF,EACtB,CACA,UAAA4pF,CAAW5pF,GAEkB,YAArBzmB,KAAKgoD,cACLhoD,KAAKoL,IAAI60F,MAAM,mBACfjgG,KAAK8uG,eAAe/qC,SAExB/jE,KAAK+vG,UAAUtpF,EACnB,CACA,YAAA6pF,CAAa7pF,GAEe,YAApBzmB,KAAK6uG,YAAgD,WAApB7uG,KAAK6uG,aACtC7uG,KAAKoL,IAAI60F,MAAM,qDAAsDjgG,KAAKkvG,aAAanrD,gBACvF/jD,KAAK6uG,WAAa,UAClB7uG,KAAKkvG,aAAajoG,IAAIwf,GAE9B,CAKA,gBAAA8pF,GAC4B,YAApBvwG,KAAK6uG,YAAgD,WAApB7uG,KAAK6uG,YAI1C7uG,KAAKoL,IAAI60F,MAAM,sBACfjgG,KAAKswG,gBAJDtwG,KAAKoL,IAAI,iEAKjB,CAKA,eAAAolG,GAC6B,YAArBxwG,KAAKgoD,aAAkD,WAArBhoD,KAAKgoD,aAI3ChoD,KAAKoL,IAAI60F,MAAM,qBACfjgG,KAAKqwG,cAJDrwG,KAAKoL,IAAI,8DAKjB,CAKA,OAAAK,GACwB,WAAhBzL,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,QAIlEpwB,KAAKoL,IAAI60F,MAAM,oBACfjgG,KAAKowG,uBAJDpwG,KAAKoL,IAAI,6CAKjB,CAKA,UAAAqlG,CAAW9mE,GACP3pC,KAAKkvG,aAAa1uG,KAAKmpC,EAC3B,CAKA,oBAAA+mE,GACI,OAAO1wG,KAAKkvG,aAAanrD,cAC7B,EC/UG,MAAM4sD,WAAoBhC,GAC7B5tG,KACA6vG,SACAngF,KACA5tB,MACAguG,YACA,WAAAvhG,CAAYzD,GACRukC,MAAMvkC,GACN7L,KAAK6C,MAA2B,aAAnBgJ,EAAK+iG,UAA2B1B,GAAwBQ,GACrE1tG,KAAKywB,KAAO5kB,EAAK4kB,KACjBzwB,KAAKe,KAAO8K,EAAK9K,KACjBf,KAAK4wG,SAAW/kG,EAAK+kG,SACrB5wG,KAAK6wG,YAAchlG,EAAKglG,WAC5B,CACA,mBAAMlB,SACI3vG,KAAKywB,KAAK,CAAE/f,GAAI1Q,KAAK4wG,SAAUzrG,KAAM+nG,GAAsBC,WAAYxjE,KAAM,IAAIkV,GAAe,GAAqB7+C,KAAKe,QACpI,CACA,cAAM8uG,CAASlmE,GAEX,IADAA,EAAOA,EAAK8V,UACL9V,EAAKn5B,WAAa,GAAG,CACxB,MAAMsgG,EAAS7nG,KAAKC,IAAIygC,EAAKn5B,WAAYxQ,KAAK6wG,mBACxC7wG,KAAKywB,KAAK,CACZ/f,GAAI1Q,KAAK4wG,SACTzrG,KAAMnF,KAAK6C,MAAMuqG,QACjBzjE,KAAMA,EAAK8V,QAAQ,EAAGqxD,KAE1BnnE,EAAKyV,QAAQ0xD,EACjB,CACJ,CACA,eAAMX,SACInwG,KAAKywB,KAAK,CAAE/f,GAAI1Q,KAAK4wG,SAAUzrG,KAAMnF,KAAK6C,MAAM2qG,OAC1D,CACA,oBAAMsC,SACI9vG,KAAKywB,KAAK,CAAE/f,GAAI1Q,KAAK4wG,SAAUzrG,KAAMnF,KAAK6C,MAAMyqG,OAC1D,CACA,mBAAM4C,GAEN,EC1BJ,SAASa,GAAav5D,GAClB,MAAMgH,EAAS,IACRhH,EACHryC,KAAM,GAAG8nG,GAAiBz1D,EAAIryC,UAAUqyC,EAAIryC,SAQhD,OANIqyC,EAAIryC,OAAS6nG,GAAaG,aAC1B3uD,EAAO7U,KAAO,GAAmB6N,EAAI7N,gBAAgB15B,WAAaunC,EAAI7N,KAAO6N,EAAI7N,KAAK1nB,aAEtFu1B,EAAIryC,OAAS6nG,GAAaK,mBAAqB71D,EAAIryC,OAAS6nG,GAAaW,mBACzEnvD,EAAO7U,KAAO,GAAmB6N,EAAI7N,gBAAgB15B,WAAaunC,EAAI7N,KAAO6N,EAAI7N,KAAK1nB,WAAY,WAE/Fu8B,CACX,CACO,MAAMwyD,GACTjpD,SAAW,eACXjC,KACA3/C,OACAiF,IACA6lG,UACAC,SACAvO,MACAwO,QACAC,gBACAC,YACAC,aACA9zD,OACA,WAAAluC,CAAY84C,EAAYv8C,GACpBA,EAAOA,GAAQ,CAAC,EAChB7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,gBAC1CngG,KAAKw9C,OAAS4K,EAAW5K,OACzBx9C,KAAKixG,UAAY,EACjBjxG,KAAKkxG,SAAW,CAIZK,WAAY,IAAI1jE,IAIhB2jE,UAAW,IAAI3jE,KAEnB7tC,KAAK2iG,MAAQ92F,EACb7L,KAAKsxG,aAAezlG,EAAKylG,cA3CX,IA+CdtxG,KAAK8lD,KAAO9lD,KAAKyxG,cAIjBzxG,KAAKmxG,QAAU/tD,GAAS,CACpBO,YAAY,EACZH,MAAO,KAGH,IAAK,MAAMyC,KAAUjmD,KAAKkxG,SAASK,WAAWtuG,SAC1CgjD,EAAOx6C,UAEX,IAAK,MAAMw6C,KAAUjmD,KAAKkxG,SAASM,UAAUvuG,SACzCgjD,EAAOx6C,SACX,IAGRzL,KAAKmG,OAASq/C,GAAKxlD,KAAKmxG,SAAShrG,GJjClCgnC,gBAAuBhnC,GAC1B,UAAW,MAAMqG,KAAWrG,EAAQ,CAChC,MAAMu5C,EAAO,IAAIb,GACjBluB,GAAQjhB,MAAMlD,EAASkzC,SACjBA,CACV,CACJ,CI2BmD,CAAOv5C,KAIlDnG,KAAKoxG,gBAAkB,IAAI3B,gBAC3BzvG,KAAKqxG,YAAc,IAAI/F,GAAY,CAC/Bn0B,OAAQtrE,EAAK6lG,qBAvEI,EAwEjBlG,SAAU,GAElB,CAIA,WAAI1jD,GAEA,MAAMA,EAAU,GAChB,IAAK,MAAM7B,KAAUjmD,KAAKkxG,SAASK,WAAWtuG,SAC1C6kD,EAAQtnD,KAAKylD,GAEjB,IAAK,MAAMA,KAAUjmD,KAAKkxG,SAASM,UAAUvuG,SACzC6kD,EAAQtnD,KAAKylD,GAEjB,OAAO6B,CACX,CAKA,SAAAN,CAAUzmD,GACN,GAAIf,KAAKoxG,gBAAgBntD,OAAOQ,QAC5B,MAAM,IAAIwiB,GAAiB,wBAE/B,MAAMv2D,EAAK1Q,KAAKixG,YAChBlwG,EAAe,MAARA,EAAe2P,EAAGrK,WAAatF,EAAKsF,WAC3C,MAAMsrG,EAAW3xG,KAAKkxG,SAASK,WAC/B,OAAOvxG,KAAK4xG,WAAW,CAAElhG,KAAI3P,OAAMoE,KAAM,YAAawsG,YAC1D,CAIA,WAAM3I,CAAM/uF,GACR,GAAIja,KAAKoxG,gBAAgBntD,OAAOQ,QAC5B,OAEJ,MAAMR,EAAShqC,GAASgqC,QAAU8kD,YAAYniF,QAAQ5mB,KAAKsxG,cAC3D,UAEU/0E,QAAQ6oB,IAAIplD,KAAK8nD,QAAQxjD,KAAI6oC,MAAOpqC,GAAMA,EAAEimG,MAAM,CACpD/kD,cAEJjkD,KAAKmxG,QAAQlqG,YAEPjH,KAAKmxG,QAAQntD,QAAQ,CACvBC,WAEJjkD,KAAKoxG,gBAAgBrtC,OACzB,CACA,MAAOt9C,GACHzmB,KAAK+jE,MAAMt9C,EACf,CACJ,CACA,KAAAs9C,CAAMt9C,GACEzmB,KAAKoxG,gBAAgBntD,OAAOQ,UAGhCzkD,KAAK8nD,QAAQ36C,SAAQpK,IAAOA,EAAEghE,MAAMt9C,EAAI,IACxCzmB,KAAKoxG,gBAAgBrtC,MAAMt9C,GAC/B,CAIA,kBAAAorF,CAAmB53F,GACf,MAAM,GAAEvJ,EAAE,KAAE3P,GAASkZ,EACf03F,EAAW3xG,KAAKkxG,SAASM,UAC/B,OAAOxxG,KAAK4xG,WAAW,CAAElhG,KAAI3P,OAAMoE,KAAM,WAAYwsG,YACzD,CACA,UAAAC,CAAW33F,GACP,MAAM,GAAEvJ,EAAE,KAAE3P,EAAI,KAAEoE,EAAI,SAAEwsG,GAAa13F,EAErC,GADAja,KAAKoL,IAAI,mBAAoBjG,EAAMuL,GACtB,cAATvL,GAAwBnF,KAAKkxG,SAASK,WAAW9yG,QAAUuB,KAAK2iG,MAAMuF,oBAlJ9B,MAmJxC,MAAM,IAAIlgC,GAAoC,kCAElD,GAAI2pC,EAAS1yG,IAAIyR,GACb,MAAM,IAAIlS,MAAM,GAAG2G,YAAeuL,qBAEtC,MAaMu1C,EDrIP,SAAsBhsC,GACzB,MAAM,GAAEvJ,EAAE,KAAE3P,EAAI,KAAE0vB,EAAI,MAAE+yB,EAAK,KAAEr+C,EAAO,YAAW,WAAE2sG,EAAahE,IAAiB7zF,EACjF,OAAO,IAAI02F,GAAY,CACnBjgG,GAAa,cAATvL,EAAuB,IAAKuL,IAAQ,IAAIA,IAC5CkgG,SAAUlgG,EACV3P,KAAM,GAAGA,GAAQ2P,IACjBk+F,UAAoB,cAATzpG,EAAuB,WAAa,UAC/C0rG,YAAaiB,EACbtuD,QACA/yB,OACArlB,IAAK6O,EAAQujC,OAAO2iD,aAAa,uBAAuBh7F,KAAQuL,MAExE,CCyHuB22C,CAAa,CAAE32C,KAAI3P,OAAM0vB,KAb3B0c,MAAOqK,IACZx3C,KAAKoL,IAAIf,SACTrK,KAAKoL,IAAI60F,MAAM,oBAAqB96F,EAAMuL,EAAIqgG,GAAav5D,IAE/Dx3C,KAAKmxG,QAAQ3wG,KAAKg3C,EAAI,EASoBryC,OAAMq+C,MAPtC,KACVxjD,KAAKoL,IAAI,6CAA8CjG,EAAMuL,EAAIu1C,EAAO8B,UACxE4pD,EAASzqD,OAAOx2C,GACc,MAA1B1Q,KAAK2iG,MAAMoP,aACX/xG,KAAK2iG,MAAMoP,YAAY9rD,EAC3B,EAEuD6rD,WAAY9xG,KAAK2iG,MAAMmP,WAAYt0D,OAAQx9C,KAAKw9C,SAE3G,OADAm0D,EAASryG,IAAIoR,EAAIu1C,GACVA,CACX,CAKA,WAAAwrD,GAuBI,OAtBatkE,MAAOhnC,IAChB,MAAMypG,EAAgB,KAClB1F,GAAY/jG,EAAQnG,KAAKoL,IAAI,EAEjCpL,KAAKoxG,gBAAgBntD,OAAOG,iBAAiB,QAASwrD,GACtD,IACI,MAAMh/E,EAAU,IAAI,GAAQ5wB,KAAK2iG,MAAMmP,WAAY9xG,KAAK2iG,MAAMwL,gCAC9D,UAAW,MAAM9wF,KAASlX,EACtB,IAAK,MAAMqxC,KAAO5mB,EAAQlhB,MAAM2N,SACtBrd,KAAKgyG,gBAAgBx6D,GAGnCx3C,KAAKmxG,QAAQlqG,KACjB,CACA,MAAOwf,GACHzmB,KAAKoL,IAAI,gBAAiBqb,GAC1BzmB,KAAKmxG,QAAQlqG,IAAIwf,EACrB,CACA,QACIzmB,KAAKoxG,gBAAgBntD,OAAOK,oBAAoB,QAASsrD,EAC7D,EAGR,CACA,qBAAMoC,CAAgBxlG,GAClB,MAAM,GAAEkE,EAAE,KAAEvL,GAASqH,EAKrB,GAJIxM,KAAKoL,IAAIf,SACTrK,KAAKoL,IAAI60F,MAAM,mBAAoB8Q,GAAavkG,IAGhDA,EAAQrH,OAAS6nG,GAAaG,WAAY,CAC1C,GAAIntG,KAAKkxG,SAASM,UAAU/yG,QAAUuB,KAAK2iG,MAAM74C,mBA9MV,MA8M4E,CAC/G9pD,KAAKoL,IAAI,iCAGTpL,KAAKmxG,QAAQ3wG,KAAK,CACdkQ,KACAvL,KAAM6nG,GAAaa,iBAKvB,UACU7tG,KAAKqxG,YAAYjyD,QAAQ,aAAc,EACjD,CACA,MAII,OAHAp/C,KAAKoL,IAAI,mHAETpL,KAAK+jE,MAAM,IAAIvlE,MAAM,yBAEzB,CACA,MACJ,CACA,MAAMynD,EAASjmD,KAAK6xG,mBAAmB,CAAEnhG,KAAI3P,KAAM,GAAmByL,EAAQm9B,gBAAgB15B,WAAazD,EAAQm9B,KAAOn9B,EAAQm9B,KAAK1nB,cAIvI,YAHmC,MAA/BjiB,KAAK2iG,MAAMsP,kBACXjyG,KAAK2iG,MAAMsP,iBAAiBhsD,GAGpC,CACA,MACMA,GADsB,GAAd9gD,EAA6CnF,KAAKkxG,SAASM,UAAzCxxG,KAAKkxG,SAASK,YAC1BnyG,IAAIsR,GACxB,GAAc,MAAVu1C,EAAgB,CAChBjmD,KAAKoL,IAAI,wCAAyCsF,EAAIu8F,GAAiB9nG,IAIvE,UACUnF,KAAKqxG,YAAYjyD,QAAQ,iBAAkB,EACrD,CACA,MAII,OAHAp/C,KAAKoL,IAAI,yGAETpL,KAAK+jE,MAAM,IAAIvlE,MAAM,yCAEzB,CACA,MACJ,CACA,MAAM0zG,EAAgBlyG,KAAK2iG,MAAMwP,qBA1PV,QA2PvB,IACI,OAAQhtG,GACJ,KAAK6nG,GAAaK,kBAClB,KAAKL,GAAaW,iBACd,GAAI1nD,EAAOyqD,uBAAyBwB,EAOhC,MALAlyG,KAAKmxG,QAAQ3wG,KAAK,CACdkQ,GAAIlE,EAAQkE,GACZvL,KAAMA,IAAS6nG,GAAaK,kBAAoBL,GAAaa,eAAiBb,GAAaS,kBAGzF,IAAIiB,GAAuB,kFAGrCzoD,EAAOwqD,WAAWjkG,EAAQm9B,MAC1B,MACJ,KAAKqjE,GAAaO,gBAClB,KAAKP,GAAaY,eAEd3nD,EAAOsqD,mBACP,MACJ,KAAKvD,GAAaS,gBAClB,KAAKT,GAAaa,eAEd5nD,EAAO1xC,QACP,MACJ,QACIvU,KAAKoL,IAAI,0BAA2BjG,GAEhD,CACA,MAAOshB,GACHzmB,KAAKoL,IAAIoc,MAAM,iCAAkCf,GACjDw/B,EAAO8d,MAAMt9C,EACjB,CACJ,ECxQJ,MAAM2rF,GACFrqD,SAAW,eACX46C,MACAv6C,WACA,WAAA94C,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKooD,WAAaA,EAClBpoD,KAAK2iG,MAAQ92F,CACjB,CACA,CAAC43B,OAAOqB,aAAe,gBACvB,CAACgqD,IAAuB,CACpB,+BAEJ,iBAAAujB,CAAkBxmG,EAAO,CAAC,GACtB,OAAO,IAAImlG,GAAiBhxG,KAAKooD,WAAY,IACtCv8C,KACA7L,KAAK2iG,OAEhB,EAKG,SAAS2P,GAAMzmG,EAAO,CAAC,GAC1B,OAAQu8C,GAAe,IAAIgqD,GAAMhqD,EAAYv8C,EACjD,CCrDe,SAAS,GAAYpK,GAChC,GAAIq/B,MAAMr/B,IAAWA,GAAU,EAC3B,MAAM,IAAI,GAAuB,sDAErC,OAAO,GAAMA,EACjB,CCJO,MAAM8wG,GACTxqD,SACAK,WACA4/C,QACAphF,QACAkjC,kBACAo+C,mBACAG,uBACAj9F,IACA,WAAAkE,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKooD,WAAaA,EAClBpoD,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,eAC1CngG,KAAKgoG,SAAU,EACfhoG,KAAK+nD,SAAW,IAAIl8C,EAAK08F,gBCfF,oBDgBvBvoG,KAAK4mB,QAAU/a,EAAK+a,SCfL,IDgBf5mB,KAAK8pD,kBAAoBj+C,EAAKi+C,mBCTH,EDU3B9pD,KAAKkoG,mBAAqBr8F,EAAKq8F,oBCTH,EDU5BloG,KAAKqoG,uBAAyBx8F,EAAKw8F,yBAA0B,EAC7DroG,KAAKwyG,cAAgBxyG,KAAKwyG,cAAcp2E,KAAKp8B,KACjD,CACA,CAACyjC,OAAOqB,aAAe,eACvB,WAAM99B,SACIhH,KAAKooD,WAAWmT,UAAU3R,OAAO5pD,KAAK+nD,SAAU/nD,KAAKwyG,cAAe,CACtE1oD,kBAAmB9pD,KAAK8pD,kBACxBo+C,mBAAoBloG,KAAKkoG,mBACzBG,uBAAwBroG,KAAKqoG,yBAEjCroG,KAAKgoG,SAAU,CACnB,CACA,UAAM1hF,SACItmB,KAAKooD,WAAWmT,UAAUotC,SAAS3oG,KAAK+nD,UAC9C/nD,KAAKgoG,SAAU,CACnB,CACA,SAAAzrC,GACI,OAAOv8D,KAAKgoG,OAChB,CAIA,aAAAwK,CAAc7oE,GACV3pC,KAAKoL,IAAI,wBAAyBu+B,EAAK2d,WAAWoD,YAClD,MAAM,OAAEzE,GAAWtc,EACb3iC,EAAQwD,KAAKm2D,MACJooC,YAAYniF,QAAQ5mB,KAAK4mB,SACjCw9B,iBAAiB,SAAS,KAC7B6B,GAAQ8d,MAAM,IAAI4D,GAAa,gBAAgB,IAE9CniB,GAAKS,GAAQ9Y,gBAAiBhnC,GAC/B,IAAIssG,EAAW,EACf,UAAW,MAAMjjG,KAAOrJ,EAAQ,CAE5B,GADAssG,GAAYjjG,EAAIgB,WACZiiG,ECxDO,GD0DP,YADAxsD,GAAQ8d,MAAM,IAAI2D,GAAoB,iCAGpCl4D,CACV,CACJ,GAAGy2C,GACE3iB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,0CAA2CmiB,EAAK2d,WAAWoD,WAAYjkC,GACtFw/B,GAAQ8d,MAAMt9C,EAAI,IAEjBumE,SAAQ,KACT,MAAMviF,EAAKD,KAAKm2D,MAAQ35D,EACxBhH,KAAKoL,IAAI,yCAA0Cu+B,EAAK2d,WAAWoD,WAAYjgD,EAAG,GAE1F,CAIA,UAAM+/C,CAAK9C,EAAMztC,EAAU,CAAC,GACxBja,KAAKoL,IAAI,aAAcs8C,GACvB,MAAM1gD,EAAQwD,KAAKm2D,MACbh3B,EAAO,GC9EM,ID+Eb2d,QAAmBtnD,KAAKooD,WAAWI,kBAAkB26C,eAAez7C,EAAMztC,GAChF,IAAIgsC,EACAqpD,EAAU,OACd,GAAsB,MAAlBr1F,EAAQgqC,OAAgB,CACxB,MAAMA,EAAS8kD,YAAYniF,QAAQ5mB,KAAK4mB,SACxC3M,EAAU,IACHA,EACHgqC,SAER,CACA,IACIgC,QAAeqB,EAAWE,UAAUxnD,KAAK+nD,SAAU,IAC5C9tC,EACHouF,uBAAwBroG,KAAKqoG,yBAEjCiH,EAAU,KACNrpD,GAAQ8d,MAAM,IAAI,GAAa,EAGnC9pD,EAAQgqC,QAAQG,iBAAiB,QAASkrD,EAAS,CAAEvvG,MAAM,IAC3D,MAAM+U,QAAe0wC,GAAK,CAAC7b,GAAOsc,GAAQ9Y,MAAOhnC,GEjE7D,SAAeA,GACX,GAHsC,MAGlBA,EAHPs9B,OAAOC,eAIhB,MAAO,WACH,UAAW,MAAM4a,KAASn4C,EACtB,OAAOm4C,CAGd,EALM,GAOX,IAAK,MAAMA,KAASn4C,EAChB,OAAOm4C,CAGf,CFoDwE,CAAMn4C,KAC5DsE,EAAKD,KAAKm2D,MAAQ35D,EACxB,GAAc,MAAV8N,EACA,MAAM,IAAI,GAAc,oCAAoCrK,OAEhE,IAAK,GAAiBk/B,EAAM70B,EAAOmN,YAC/B,MAAM,IAAI,GAAc,iCAAiCxX,OAG7D,OADAzK,KAAKoL,IAAI,2BAA4Bk8C,EAAWoD,WAAYjgD,GACrDA,CACX,CACA,MAAOgc,GAGH,MAFAzmB,KAAKoL,IAAIoc,MAAM,yBAA0B8/B,EAAWoD,WAAYjkC,GAChEw/B,GAAQ8d,MAAMt9C,GACRA,CACV,CACA,QACIxM,EAAQgqC,QAAQK,oBAAoB,QAASgrD,GAC/B,MAAVrpD,SACMA,EAAO+iD,OAErB,CACJ,EGlGG,SAASx+C,GAAK3+C,EAAO,CAAC,GACzB,OAAQu8C,GAAe,IAAImqD,GAAiBnqD,EAAYv8C,EAC5D,CC1BO,MAAM6mG,GAAkBjvE,OAAOmL,IAAI,qBAOnC,IAAI+jE,IACX,SAAWA,GAIPA,EAAeA,EAA0B,UAAI,GAAK,YAIlDA,EAAeA,EAAyB,SAAI,GAAK,UACpD,CATD,CASGA,KAAmBA,GAAiB,CAAC,ICcxC,MAAMC,GAAoB,CACtB,GAAU,OAAO79F,KACjB,GAAU,OAAOA,KACjB,GAAU,WAAWA,KACrB,GAAU,QAAQA,KAClB,GAAU,QAAQA,MAEtB,SAAS89F,GAAW94C,GAChB,OAAO+4C,GAAa,MAAO/4C,KAAM,EACrC,CACA,SAASg5C,GAAYh5C,GACjB,MAAMlI,EAAOihD,GAAa,MAAO/4C,KAAM,GACvC,OAAY,MAARlI,EACO,GAEJ,IAAIA,GACf,CACA,SAASihD,GAAa/xG,EAAMg5D,GACxB,IAAIhlD,EACJ,IACIA,EAAO,GAAUhU,GAAMgU,IAC3B,CACA,MAAOkP,GAEH,MACJ,CACA,IAAK,MAAO05B,EAAO3+C,KAAU+6D,EACzB,GAAIpc,IAAU5oC,GAAiB,MAAT/V,EAClB,MAAO,CAAC2+C,EAAO3+C,EAG3B,CACA,SAASg0G,GAAOj5C,GACZ,OAAOA,EAAGa,MAAK,EAAEjd,EAAOhlB,KAAOglB,IAAU,GAAU,OAAO5oC,MAC9D,CACA,SAASk+F,GAAcC,EAAeC,EAAcC,GAChD,MAAMC,EAAcC,GAAa,GAAUJ,GAAenyG,MAC1D,GAAmB,MAAfsyG,EACA,MAAM,IAAI70G,MAAM,4BAA4B,GAAU00G,GAAenyG,QAEzE,MAAMwyG,EAAUF,EAAYF,EAAcC,GAC1C,OAAIF,IAAkB,GAAU,OAAOn+F,KAC5B,IAAIw+F,KAERA,CACX,CACA,MAAMD,GAAe,CACjBv/C,IAAK,CAAC/0D,EAAOo0G,IAAWp0G,EACxBg1D,IAAK,CAACh1D,EAAOo0G,IACa,IAAlBA,EAAO3xG,OACAzC,EAEJ,IAAIA,KAEf60D,IAAK,CAAC70D,EAAOo0G,KACT,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,MAAO,SAASy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAAWp0G,GAAO,EAEtF80D,IAAK,CAAC90D,EAAOo0G,KACT,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,MAAO,SAASy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAAWp0G,GAAO,EAEtFy0G,QAAS,CAACz0G,EAAOo0G,IAAWp0G,EAC5B00G,KAAM,CAAC10G,EAAOo0G,IAAWp0G,EACzBi1D,KAAM,CAACj1D,EAAOo0G,IAAWp0G,EACzB20G,IAAK,CAAC30G,EAAOo0G,IAAWp0G,EACxB40G,KAAM,CAAC50G,EAAOo0G,KACV,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,MAAO,GAAGy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,IAAS,EAEvEz+C,IAAK,CAAC31D,EAAOo0G,KACT,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,MAAO,GAAGy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,IAAS,EAEvES,KAAM,CAAC70G,EAAOo0G,KACV,MAAMU,EAAWd,GAAOI,GAClBW,EAAMlB,GAAWO,GACjBvhD,EAAOkhD,GAAYK,GACzB,GAAIU,GAAmB,MAAPC,EACZ,MAAO,WAAWA,IAAMliD,IAE5B,MAAM9J,EAAW+rD,EAAW,WAAa,UACnCN,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,IAAIw1G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQhuG,QAAQ,SAAU,IAC7B,GAAG+hD,IAAWisD,GAAS,EAElC,YAAa,CAACh1G,EAAOo0G,KACjB,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAIpB,MAAO,GAFSy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAC3C/gD,mBAAmBrzD,IACL,EAEvCi1G,IAAK,CAACj1G,EAAOo0G,KAGT,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,OAAOy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,EAAO,EAElEW,IAAK,CAAC/0G,EAAOo0G,KAGT,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,OAAOy0G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,EAAO,EAElEc,MAAO,CAACl1G,EAAOo0G,KACX,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,IAAIw1G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQhuG,QAAQ,SAAU,IAC7B,WAAWguG,GAAS,EAE/BG,GAAI,CAACn1G,EAAOo0G,KACR,MAAMU,EAAWd,GAAOI,GAClBW,EAAMlB,GAAWO,GACjBvhD,EAAOkhD,GAAYK,GACzB,GAAIU,GAAmB,MAAPC,EACZ,MAAO,SAASA,IAAMliD,IAE1B,MAAM9J,EAAW+rD,EAAW,SAAW,QACjCN,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,IAAIw1G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQhuG,QAAQ,SAAU,IAC7B,GAAG+hD,IAAWisD,GAAS,EAElCI,IAAK,CAACp1G,EAAOo0G,KACT,MAAMI,EAAYJ,EAAO51E,MACzB,GAAiB,MAAbg2E,EACA,MAAM,IAAIh1G,MAAM,+BAEpB,IAAIw1G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQhuG,QAAQ,SAAU,IAC7B,SAASguG,GAAS,GCpMjC,SAAsBK,IAElB,GAAIA,EAAOlkF,YAAc,EACrB,MAAM,IAAI3xB,MAAM,iBAGM,IAAtB61G,EAAOlkF,kBAGL,IAAIoM,SAAQ,CAACr4B,EAASs4B,KACxB,SAAS83E,IACLD,EAAO/vD,oBAAoB,OAAQiwD,GACnCF,EAAO/vD,oBAAoB,QAASkwD,EACxC,CACA,SAASD,IACLD,IACApwG,GACJ,CACA,SAASswG,EAAUr0G,GACfm0G,IACA93E,EAAOr8B,EAAMqnB,OAAS,IAAIhpB,MAAM,wBAAwB61G,EAAOhlB,OACnE,CACAglB,EAAOjwD,iBAAiB,OAAQmwD,GAChCF,EAAOjwD,iBAAiB,QAASowD,EAAU,GAElD,ECxBD,IAAgBH,EAAQp6F,MACpBA,EAAUA,GAAW,CAAC,GACdw6F,YAAoC,IAAvBx6F,EAAQw6F,WAChBtnE,MAAOhnC,IAChB,UAAW,MAAMwjC,KAAQxjC,EAAQ,CAC7B,UACUuuG,GAAML,EAChB,CACA,MAAO5tF,GACH,GAAoB,kBAAhBA,EAAIja,QACJ,MACJ,MAAMia,CACV,CAGA,GAAI4tF,EAAOlkF,aAAekkF,EAAOM,SAAWN,EAAOlkF,aAAekkF,EAAOO,OACrE,MAEJP,EAAO5jF,KAAKkZ,EAChB,CAC0B,MAAtB1vB,EAAQw6F,YAAsBJ,EAAOlkF,YAAc,SAC7C,IAAIoM,SAAQ,CAACr4B,EAASs4B,KACxB63E,EAAOjwD,iBAAiB,SAASjkD,IAC7B,GAAIA,EAAM00G,UAA2B,OAAf10G,EAAM4U,KACxB7Q,QAEC,CACD,MAAMuiB,EAAM9nB,OAAO01B,OAAO,IAAI71B,MAAM,YAAa,CAAE2B,UACnDq8B,EAAO/V,EACX,KAEJI,YAAW,KAAQwtF,EAAOrL,OAAO,GAAI,GAE7C,mCC9BR,SAAS8L,GAAcviG,GACnB,OAAQA,aAAeV,aACS,gBAA3BU,GAAKjD,aAAavO,MAAqD,iBAApBwR,GAAK/B,UACjE,CACA,MCPA,aCDMlM,GAAM,CAAE,QAAS,MAAO,SAAU,QCIjC,SAASywG,GAAQjmD,EAAMhyB,GAE1BA,EAAOA,GAAQ,CAAC,EAChB,MAAMuyD,EDLV,EAAgBA,EAAK2lB,KAIjB,GAHI3lB,EAAI9iE,WAAW,QACf8iE,EAAM,GAAG2lB,GAAUjtD,UAHH,QAGiCsnC,KAEjDA,EAAI9iE,WAAW,MAAoB,MAAZyoF,EAAkB,CACzC,MAAMr3D,EAAQq3D,EAASjtD,UANP,MAOV4L,EAAOqhD,EAASrhD,KAChB9B,EAAwB,MAAjBmjD,EAASnjD,OAAwD,IAAxC8B,GAAMrnC,SAAS,IAAI0oF,EAASnjD,QAAmB,IAAImjD,EAASnjD,OAAS,GAC3Gw9B,EAAM,GAAG1xC,MAAUgW,IAAO9B,IAAOw9B,GACrC,CACA,MAAM4lB,EAAQ,IAAIplB,IAAIR,GACtB,IAAK,MAAO6lB,EAAWC,KAAYx2G,OAAOmxD,QAAQxrD,IAC1C2wG,EAAMltD,WAAamtD,IACnBD,EAAMltD,SAAWotD,GAGzB,OAAOF,CACV,ECZe,CAAMnmD,EAFiB,oBAAX/9C,YAAyB7R,EAAY6R,OAAOikG,UAKpE,MCRJ,EAAgBX,EAAQp6F,KACpBA,EAAUA,GAAW,CAAC,EACtB,MAAMm7F,EJIV,CAAgBf,IACZA,EAAOgB,WAAa,cACpB,MAAMC,EAAYnoE,gBACR,IAAI5Q,SAAQ,CAACr4B,EAASs4B,KACxB,GAAIs6B,EAEA,YADA5yD,IAGJ,GAAiB,MAAbqxG,EAEA,YADA/4E,EAAO+4E,GAGX,MAAMC,EAAWC,IACbpB,EAAO/vD,oBAAoB,OAAQoxD,GACnCrB,EAAO/vD,oBAAoB,QAASqxD,GACpCF,GAAM,EAEJC,EAAS,KAAQF,EAAQtxG,EAAQ,EACjCyxG,EAAWx1G,IACbq1G,GAAQ,KAAQh5E,EAAOr8B,EAAMqnB,OAAS,IAAIhpB,MAAM,wBAAwB61G,EAAOhlB,OAAO,GAAI,EAE9FglB,EAAOjwD,iBAAiB,OAAQsxD,GAChCrB,EAAOjwD,iBAAiB,QAASuxD,EAAQ,GAC3C,EAEAxvG,EAAUgnC,kBACZ,MAAMsG,EAAW,IAAI,OAAc,EAAGjzC,OAAM8lB,OAAM8c,WAC9C,MAAMwyE,EAAaz1G,IACf,IAAIwpC,EAAO,KACe,iBAAfxpC,EAAMwpC,OACbA,EAAO,GAAqBxpC,EAAMwpC,OAElCmrE,GAAc30G,EAAMwpC,QACpBA,EAAO,IAAI15B,WAAW9P,EAAMwpC,OAE5BxpC,EAAMwpC,gBAAgB15B,aACtB05B,EAAOxpC,EAAMwpC,MAEL,MAARA,GAGJnpC,EAAKmpC,EAAK,EAERgsE,EAAWx1G,IAAYijC,EAAKjjC,EAAMqnB,OAAS,IAAIhpB,MAAM,gBAAgB,EAI3E,OAHA61G,EAAOjwD,iBAAiB,UAAWwxD,GACnCvB,EAAOjwD,iBAAiB,QAASuxD,GACjCtB,EAAOjwD,iBAAiB,QAAS99B,GAC1B,KACH+tF,EAAO/vD,oBAAoB,UAAWsxD,GACtCvB,EAAO/vD,oBAAoB,QAASqxD,GACpCtB,EAAO/vD,oBAAoB,QAASh+B,EAAK,CAC5C,GACF,CAAE4c,cAAetd,YACd0vF,IACN,UAAW,MAAMj4F,KAASo2B,QAChBqhE,GAAcz3F,GAAS,IAAIpN,WAAWoN,GAASA,CAE7D,CAhCe,GAiCf,IACIk4F,EADAz+C,EAAoC,IAAtBu9C,EAAOlkF,WAezB,OAbAkkF,EAAOjwD,iBAAiB,QAAQ,KAC5B0S,GAAc,EACdy+C,EAAY,IAAI,IAEpBlB,EAAOjwD,iBAAiB,SAAS,KAC7B0S,GAAc,EACdy+C,EAAY,IAAI,IAEpBlB,EAAOjwD,iBAAiB,SAASjkD,IACxB22D,IACDy+C,EAAYp1G,EAAMqnB,OAAS,IAAIhpB,MAAM,wBAAwB61G,EAAOhlB,OACxE,IAEG1wF,OAAO01B,OAAOluB,EAAQ,CACzBmvG,aAEP,EIhF2BnvG,CAAOkuG,GAC/B,IAAIwB,EAAgB57F,EAAQ47F,cACxBC,EAAa77F,EAAQ67F,WACzB,GAAkB,MAAdzB,EAAOhlB,IAEP,IACI,MAAMA,EAAM,IAAIQ,IAAIwkB,EAAOhlB,KAC3BwmB,EAAgBxmB,EAAI0mB,SACpBD,EAAat3F,SAAS6wE,EAAIx9B,KAAM,GACpC,CACA,MAAQ,CAEZ,GAAqB,MAAjBgkD,GAAuC,MAAdC,EACzB,MAAM,IAAIt3G,MAAM,sDA4BpB,MA1Be,CACXsnD,KAAMA,GAAKuuD,EAAQp6F,GACnB9T,OAAQivG,EACRE,UAAWnoE,gBAAoBioE,EAAgBE,WAAW,EAC1DtM,MAAO77D,UACCknE,EAAOlkF,aAAekkF,EAAO2B,YAAc3B,EAAOlkF,aAAekkF,EAAO4B,YAClE,IAAI15E,SAASr4B,IACfmwG,EAAOjwD,iBAAiB,SAAS,KAC7BlgD,GAAS,IAEbmwG,EAAOrL,OAAO,GAEtB,EAEJv9F,QAAS,KACmB,MAApB4oG,EAAO6B,UACP7B,EAAO6B,YAGP7B,EAAOrL,OACX,EAEJ6M,gBACAC,aACAzB,SAGP,EDpCU1uD,CADQ,IAAI,GAAU0pC,EAAIhpF,WAAYy2B,EAAKq5E,WAC5Br5E,EAC1B,CENO,MAAMs5E,WAA4BC,MACrClxG,KACAwiD,OACA,WAAAr4C,CAAYnK,EAAMwiD,GACdvX,MAAMjrC,GACNnF,KAAKmF,KAAOA,EAEZnF,KAAK2nD,OAASA,CAClB,ECTG,SAAS,GAAIm7C,GAChB,OAAOA,EAAWj2F,QAAQktD,GACf,GAAiBssC,WAAWtsC,IAAO,GAAWssC,WAAWtsC,IAExE,CAIO,SAASq6C,GAAItR,GAChB,OAAOA,EAAWj2F,QAAQktD,GACf,GAAiBssC,WAAWtsC,IAE3C,CCiBA,MAAM,GACF3uD,IACAS,KACA2xC,OACAkhD,QACAt2C,WACA,WAAA94C,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,qBAC1CngG,KAAKw9C,OAAS4K,EAAW5K,OACzBx9C,KAAKooD,WAAaA,EAClBpoD,KAAK6L,KAAOA,EACc,MAAtBu8C,EAAWs2C,UACX1+F,KAAK0+F,QAAU,CACX4X,aAAcluD,EAAWs2C,QAAQ6X,qBAAqB,wCAAyC,CAC3FC,MAAO,QACPtX,KAAM,qDAItB,CACA,CAACwT,KAAmB,EACpB,CAACjvE,OAAOqB,aAAe,qBACvB,CAACgqD,IAAuB,CACpB,qBAEJ,UAAMt1B,CAAKO,EAAI9/C,GACXja,KAAKoL,IAAI,aAAc2uD,GACvB9/C,EAAUA,GAAW,CAAC,EACtB,MACMw8F,EC1DP,SAAwBxwD,EAAQgkD,EAAYhwF,GAC/C,MAAM7O,EAAM6O,EAAQujC,OAAO2iD,aAAa,4BAClCzB,EAAUzkF,EAAQykF,QAClBgY,EAAez8F,EAAQy8F,cAAgB,GACvCD,EAAS,CACXrrG,MACA,UAAM06C,CAAK3/C,GACP,UACU8/C,EAAOH,KAAK,kBACd,UAAW,MAAMt2C,KAAOrJ,EAChBqJ,aAAeS,iBACTT,QAGAA,EAAIyS,UAGrB,CATiB,GAUtB,CACA,MAAOwE,GACc,YAAbA,EAAIthB,MACJiG,EAAIoc,MAAMf,EAElB,CACJ,EACAtgB,OAAQ8/C,EAAO9/C,OACf8jG,aACA5jD,SAAU,CAAE71B,KAAMhmB,KAAKm2D,OACvB,WAAMqoC,CAAM/uF,EAAU,CAAC,GACnB,MAAMjT,EAAQwD,KAAKm2D,MACnB,GAAsB,MAAlB1mD,EAAQgqC,OAAgB,CACxB,MAAMA,EAAS8kD,YAAYniF,QClCd,KDmCb3M,EAAU,IACHA,EACHgqC,SAER,CACA,MAAM5jD,EAAW,KACb,MAAM,KAAEszD,EAAI,KAAE9B,GAAS4kD,EAAOxM,WAAWz2C,YACzCpoD,EAAI,qEAAsEuoD,EAAM9B,EAAMrnD,KAAKm2D,MAAQ35D,GACnGhH,KAAK+jE,MAAM,IAAI,GAAW,wBAAwB,EAEtD9pD,EAAQgqC,QAAQG,iBAAiB,QAAS/jD,GAC1C,UACU4lD,EAAO+iD,OACjB,CACA,MAAOviF,GACHrb,EAAIoc,MAAM,qCAAsCf,GAChDzmB,KAAK+jE,MAAMt9C,EACf,CACA,QACIxM,EAAQgqC,QAAQK,oBAAoB,QAASjkD,GAC7Co2G,EAAOpwD,SAAS2iD,MAAQx+F,KAAKm2D,KACjC,CACJ,EACA,KAAAoD,CAAMt9C,GACF,MAAM,KAAEktC,EAAI,KAAE9B,GAAS4kD,EAAOxM,WAAWz2C,YACzCpoD,EAAI,+CAAgDuoD,EAAM9B,EAAMprC,GAChEw/B,EAAOx6C,UACPgrG,EAAOpwD,SAAS2iD,MAAQx+F,KAAKm2D,MAK7B+9B,GAAShE,UAAU,CAAE,CAAC,GAAGgc,WAAsB,GACnD,GAWJ,OATAzwD,EAAOouD,OAAOjwD,iBAAiB,SAAS,KACpCs6C,GAAShE,UAAU,CAAE,CAAC,GAAGgc,WAAsB,IAIlB,MAAzBD,EAAOpwD,SAAS2iD,QAChByN,EAAOpwD,SAAS2iD,MAAQx+F,KAAKm2D,MACjC,GACD,CAAE5gE,MAAM,IACJ02G,CACX,CDnBuBE,OADM32G,KAAK42G,SAAS78C,EAAI9/C,GACD8/C,EAAI,CACtCvc,OAAQx9C,KAAKw9C,OACbkhD,QAAS1+F,KAAK0+F,SAAS4X,eAE3Bt2G,KAAKoL,IAAI,6BAA8BqrG,EAAOxM,YAC9C,MAAM1yC,QAAat9C,EAAQ48F,SAASC,gBAAgBL,EAAQx8F,GAE5D,OADAja,KAAKoL,IAAI,kCAAmCqrG,EAAOxM,YAC5C1yC,CACX,CACA,cAAMq/C,CAAS78C,EAAI9/C,GACfA,GAASgqC,QAAQC,iBACjB,MAAM6yD,EAAQh9C,EAAGvG,YACjBxzD,KAAKoL,IAAI,gBAAiB2rG,EAAMpjD,KAAMojD,EAAMllD,MAC5C,MAAMmlD,EAAex0D,KACfy0D,EAAYlC,GV2HnB,SAAwBh/E,GAC3B,MACM3Y,EADK,GAAU2Y,GACJ48B,eACXlxC,EAAOrE,EAAMogB,MACnB,GAAY,MAAR/b,EACA,MAAM,IAAIjjB,MAAM,+BAEpB,MAAMupD,EAAW,GAAUtmC,EAAK,IAC1B4xF,EAAcC,GAAavrD,EAAShnD,MAC1C,GAAmB,MAAfsyG,EACA,MAAM,IAAI70G,MAAM,4BAA4BupD,EAAShnD,QAEzD,IAAIm2G,EAAM7D,EAAY5xF,EAAK,IAAM,GAAIrE,GAmBrC,OAlBkCw1F,GAAkB5nF,SAASvJ,EAAK,MAE9Dy1F,EAAMA,EAAIlxG,QAAQ,WAAY,IAE1BkxG,EADY,QAAZz1F,EAAK,GACC,WAAWy1F,IAGX,UAAUA,MAGpBA,EAAI3qF,WAAW,YAAc2qF,EAAI3qF,WAAW,aAAe2qF,EAAI3qF,WAAW,UAAY2qF,EAAI3qF,WAAW,aAErG2qF,EAAM,IAAIrnB,IAAIqnB,GAAK7wG,WAEf6wG,EAAI5qF,SAAS,OACb4qF,EAAMA,EAAIzvG,UAAU,EAAGyvG,EAAIz1G,OAAS,KAGrCy1G,CACX,CU3JkC,CAAMn9C,GAAK/5D,KAAK6L,MAC1CorG,EAAU5C,OAAOjwD,iBAAiB,SAAS,KAIvC,MAAM39B,EAAM,IAAIugD,GAAsB,wBAAwBjN,EAAG1zD,cACjErG,KAAKoL,IAAIoc,MAAM,oBAAqBf,GACpCzmB,KAAK0+F,SAAS4X,aAAa5b,UAAU,CAAElzE,OAAO,IAC9CwvF,EAAax6E,OAAO/V,EAAI,IAE5B,IACIxM,EAAQk9F,aAAa,IAAIf,GAAoB,qCACvC5xD,GAAWjoB,QAAQ8nB,KAAK,CAAC4yD,EAAU3B,YAAa0B,EAAav0D,UAAWxoC,EAAQgqC,OAC1F,CACA,MAAOx9B,GAQH,MAPIxM,EAAQgqC,QAAQQ,SAChBzkD,KAAK0+F,SAAS4X,aAAa5b,UAAU,CAAE32B,OAAO,IAElDkzC,EAAUjO,QACL1lE,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,2BAA4Bf,EAAI,IAE7CA,CACV,CAGA,OAFAzmB,KAAKoL,IAAI,eAAgB2uD,GACzB/5D,KAAK0+F,SAAS4X,aAAa5b,UAAU,CAAEqa,SAAS,IACzCkC,CACX,CAMA,cAAAG,CAAen9F,GACX,OG9GD,WACH,MAAM,IAAIzb,MAAM,uDACpB,CH4Ge44G,EACKp3G,KAAKw9C,OACLx9C,KAAKooD,WAAWtnD,OACfd,KAAKooD,WAAWs2C,SAEtB1+F,KAAK6L,KAGhB,CAMA,YAAAwrG,CAAavU,GAET,OADAA,EAAanhG,MAAM2Q,QAAQwwF,GAAcA,EAAa,CAACA,GAC9B,MAArB9iG,KAAK6L,MAAMgB,OACJ7M,KAAK6L,MAAMgB,OAAOi2F,GAEtB,GAAYA,EACvB,CAIA,UAAAwU,CAAWxU,GACP,OAAO9iG,KAAKq3G,aAAavU,EAC7B,EAEG,SAASyU,GAAW1rG,EAAO,CAAC,GAC/B,OAAQu8C,GACG,IAAI,GAAWA,EAAYv8C,EAE1C,iCI9IO,MAAM,WAAqBrN,MACjC,WAAA8Q,CAAY9C,GACX4jC,MAAM5jC,GACNxM,KAAKe,KAAO,cACb,EAOM,MAAM,WAAmBvC,MAC/B,WAAA8Q,CAAY9C,GACX4jC,QACApwC,KAAKe,KAAO,aACZf,KAAKwM,QAAUA,CAChB,EAMD,MAAMgrG,GAAkB9yD,QAA4CxlD,IAA5B04B,WAAW6/E,aAChD,IAAI,GAAW/yD,GACf,IAAI+yD,aAAa/yD,GAKdgzD,GAAmBzzD,IACxB,MAAMyb,OAA2BxgE,IAAlB+kD,EAAOyb,OACnB83C,GAAgB,+BAChBvzD,EAAOyb,OAEV,OAAOA,aAAkBlhE,MAAQkhE,EAAS83C,GAAgB93C,EAAO,EAGnD,SAASi4C,GAASl1D,EAASxoC,GACzC,MAAM,aACLuwF,EAAY,SACZoN,EAAQ,QACRprG,EAAO,aACPqrG,EAAe,CAAChxF,WAAYN,eACzBtM,EAEJ,IAAIk8C,EACA2hD,EAEJ,MA4DMC,EA5DiB,IAAIx7E,SAAQ,CAACr4B,EAASs4B,KAC5C,GAA4B,iBAAjBguE,GAAyD,IAA5BvhG,KAAKqV,KAAKksF,GACjD,MAAM,IAAIpqG,UAAU,4DAA4DoqG,OAGjF,GAAIvwF,EAAQgqC,OAAQ,CACnB,MAAM,OAACA,GAAUhqC,EACbgqC,EAAOQ,SACVjoB,EAAOk7E,GAAiBzzD,IAGzB6zD,EAAe,KACdt7E,EAAOk7E,GAAiBzzD,GAAQ,EAGjCA,EAAOG,iBAAiB,QAAS0zD,EAAc,CAAC/3G,MAAM,GACvD,CAEA,GAAIyqG,IAAiBjgG,OAAOytG,kBAE3B,YADAv1D,EAAQlf,KAAKr/B,EAASs4B,GAKvB,MAAMy7E,EAAe,IAAI,GAEzB9hD,EAAQ0hD,EAAahxF,WAAW5lB,UAAK/B,GAAW,KAC/C,GAAI04G,EACH,IACC1zG,EAAQ0zG,IACT,CAAE,MAAOpwF,GACRgV,EAAOhV,EACR,KAK6B,mBAAnBi7B,EAAQ0B,QAClB1B,EAAQ0B,UAGO,IAAZ33C,EACHtI,IACUsI,aAAmBhO,MAC7Bg+B,EAAOhwB,IAEPyrG,EAAazrG,QAAUA,GAAW,2BAA2Bg+F,iBAC7DhuE,EAAOy7E,GACR,GACEzN,GAEH,WACC,IACCtmG,QAAcu+C,EACf,CAAE,MAAOj7B,GACRgV,EAAOhV,EACR,CACA,EAND,EAMI,IAGoCwlE,SAAQ,KAChD+qB,EAAkBx4G,QACdu4G,GAAgB79F,EAAQgqC,QAC3BhqC,EAAQgqC,OAAOK,oBAAoB,QAASwzD,EAC7C,IAQD,OALAC,EAAkBx4G,MAAQ,KACzBs4G,EAAatxF,aAAatlB,UAAK/B,EAAWi3D,GAC1CA,OAAQj3D,CAAS,EAGX64G,CACR,CCxHe,MAAMG,GACjB,GAAS,GACT,OAAAC,CAAQC,EAAKn+F,GAKT,MAAMo+F,EAAU,CACZC,UALJr+F,EAAU,CACNq+F,SAAU,KACPr+F,IAGeq+F,SAClB5nG,GAAIuJ,EAAQvJ,GACZ0nG,OAEJ,GAAkB,IAAdp4G,KAAKvB,MAAcuB,MAAK,EAAOA,KAAKvB,KAAO,GAAG65G,UAAYr+F,EAAQq+F,SAElE,YADAt4G,MAAK,EAAOQ,KAAK63G,GAGrB,MAAMxtG,ECfC,SAAoBiI,EAAO9T,GACtC,IAAI60B,EAAQ,EACRpM,EAAQ3U,EAAMrR,OAClB,KAAOgmB,EAAQ,GAAG,CACd,MAAM8wF,EAAOtvG,KAAKo2C,MAAM53B,EAAQ,GAChC,IAAI+wF,EAAK3kF,EAAQ0kF,EDU+B53F,ECTjC7N,EAAM0lG,GAAKx5G,EDSiCs5G,SAAW33F,EAAE23F,UCTpC,GAChCzkF,IAAU2kF,EACV/wF,GAAS8wF,EAAO,GAGhB9wF,EAAQ8wF,CAEhB,CDEmD,IAAC53F,ECDpD,OAAOkT,CACX,CDAsB4kF,CAAWz4G,MAAK,EAAQq4G,GACtCr4G,MAAK,EAAOkL,OAAOL,EAAO,EAAGwtG,EACjC,CACA,WAAAK,CAAYhoG,EAAI4nG,GACZ,MAAMztG,EAAQ7K,MAAK,EAAO24G,WAAWN,GAAYA,EAAQ3nG,KAAOA,IAChE,IAAe,IAAX7F,EACA,MAAM,IAAI+tG,eAAe,oCAAoCloG,2BAEjE,MAAO20C,GAAQrlD,MAAK,EAAOkL,OAAOL,EAAO,GACzC7K,KAAKm4G,QAAQ9yD,EAAK+yD,IAAK,CAAEE,WAAU5nG,MACvC,CACA,OAAAmoG,GACI,MAAMxzD,EAAOrlD,MAAK,EAAOsI,QACzB,OAAO+8C,GAAM+yD,GACjB,CACA,MAAAvrG,CAAOoN,GACH,OAAOja,MAAK,EAAO6M,QAAQwrG,GAAYA,EAAQC,WAAar+F,EAAQq+F,WAAUh0G,KAAK+zG,GAAYA,EAAQD,KAC3G,CACA,QAAI35G,GACA,OAAOuB,MAAK,EAAOyB,MACvB,EE/BW,MAAMq3G,WAAe,GAChC,GACA,GACA,GAAiB,EACjB,GACA,GACA,GAAe,EACf,GACA,GACA,GACA,GACA,GAAW,EAEX,GACA,GACA,GAEA,GAAc,GAMdlyF,QAEA,WAAAtX,CAAY2K,GAYR,GAXAm2B,UAWqC,iBATrCn2B,EAAU,CACN8+F,2BAA2B,EAC3BC,YAAazuG,OAAOytG,kBACpBriD,SAAU,EACVsjD,YAAa1uG,OAAOytG,kBACpBkB,WAAW,EACXC,WAAYjB,MACTj+F,IAEc++F,aAA4B/+F,EAAQ++F,aAAe,GACpE,MAAM,IAAI54G,UAAU,gEAAgE6Z,EAAQ++F,aAAa3yG,YAAc,gBAAgB4T,EAAQ++F,gBAEnJ,QAAyB95G,IAArB+a,EAAQ07C,YAA4BprD,OAAOsZ,SAAS5J,EAAQ07C,WAAa17C,EAAQ07C,UAAY,GAC7F,MAAM,IAAIv1D,UAAU,2DAA2D6Z,EAAQ07C,UAAUtvD,YAAc,gBAAgB4T,EAAQ07C,aAE3I31D,MAAK,EAA6Bia,EAAQ8+F,0BAC1C/4G,MAAK,EAAqBia,EAAQ++F,cAAgBzuG,OAAOytG,mBAA0C,IAArB/9F,EAAQ07C,SACtF31D,MAAK,EAAeia,EAAQ++F,YAC5Bh5G,MAAK,EAAYia,EAAQ07C,SACzB31D,MAAK,EAAS,IAAIia,EAAQk/F,WAC1Bn5G,MAAK,EAAcia,EAAQk/F,WAC3Bn5G,KAAKi5G,YAAch/F,EAAQg/F,YAC3Bj5G,KAAK4mB,QAAU3M,EAAQ2M,QACvB5mB,MAAK,GAA6C,IAA3Bia,EAAQm/F,eAC/Bp5G,MAAK,GAAkC,IAAtBia,EAAQi/F,SAC7B,CACA,KAAI,GACA,OAAOl5G,MAAK,GAAsBA,MAAK,EAAiBA,MAAK,CACjE,CACA,KAAI,GACA,OAAOA,MAAK,EAAWA,MAAK,CAChC,CACA,KACIA,MAAK,IACLA,MAAK,IACLA,KAAK6B,KAAK,OACd,CACA,KACI7B,MAAK,IACLA,MAAK,IACLA,MAAK,OAAad,CACtB,CACA,KAAI,GACA,MAAMyhE,EAAMn2D,KAAKm2D,MACjB,QAAyBzhE,IAArBc,MAAK,EAA2B,CAChC,MAAMq5G,EAAQr5G,MAAK,EAAe2gE,EAClC,KAAI04C,EAAQ,GAYR,YALwBn6G,IAApBc,MAAK,IACLA,MAAK,EAAa6mB,YAAW,KACzB7mB,MAAK,GAAmB,GACzBq5G,KAEA,EATPr5G,MAAK,EAAkBA,MAA+B,EAAIA,MAAK,EAAW,CAWlF,CACA,OAAO,CACX,CACA,KACI,GAAyB,IAArBA,MAAK,EAAOvB,KAWZ,OARIuB,MAAK,GACLi2D,cAAcj2D,MAAK,GAEvBA,MAAK,OAAcd,EACnBc,KAAK6B,KAAK,SACY,IAAlB7B,MAAK,GACLA,KAAK6B,KAAK,SAEP,EAEX,IAAK7B,MAAK,EAAW,CACjB,MAAMs5G,GAAyBt5G,MAAK,EACpC,GAAIA,MAAK,GAA6BA,MAAK,EAA6B,CACpE,MAAMu5G,EAAMv5G,MAAK,EAAO64G,UACxB,QAAKU,IAGLv5G,KAAK6B,KAAK,UACV03G,IACID,GACAt5G,MAAK,KAEF,EACX,CACJ,CACA,OAAO,CACX,CACA,KACQA,MAAK,QAA2Cd,IAArBc,MAAK,IAGpCA,MAAK,EAAc41D,aAAY,KAC3B51D,MAAK,GAAa,GACnBA,MAAK,GACRA,MAAK,EAAewK,KAAKm2D,MAAQ3gE,MAAK,EAC1C,CACA,KACgC,IAAxBA,MAAK,GAA0C,IAAlBA,MAAK,GAAkBA,MAAK,IACzDi2D,cAAcj2D,MAAK,GACnBA,MAAK,OAAcd,GAEvBc,MAAK,EAAiBA,MAAK,EAA6BA,MAAK,EAAW,EACxEA,MAAK,GACT,CAIA,KAEI,KAAOA,MAAK,MAChB,CACA,eAAIi5G,GACA,OAAOj5G,MAAK,CAChB,CACA,eAAIi5G,CAAYO,GACZ,KAAgC,iBAAnBA,GAA+BA,GAAkB,GAC1D,MAAM,IAAIp5G,UAAU,gEAAgEo5G,eAA4BA,MAEpHx5G,MAAK,EAAew5G,EACpBx5G,MAAK,GACT,CACA,OAAM,CAAcikD,GAChB,OAAO,IAAI1nB,SAAQ,CAAC6oC,EAAU5oC,KAC1BynB,EAAOG,iBAAiB,SAAS,KAC7B5nB,EAAOynB,EAAOyb,OAAO,GACtB,CAAE3/D,MAAM,GAAO,GAE1B,CAqCA,WAAA24G,CAAYhoG,EAAI4nG,GACZt4G,MAAK,EAAO04G,YAAYhoG,EAAI4nG,EAChC,CACA,SAAMt7F,CAAIy8F,EAAWx/F,EAAU,CAAC,GAQ5B,OANAA,EAAQvJ,MAAQ1Q,MAAK,KAAeqG,WACpC4T,EAAU,CACN2M,QAAS5mB,KAAK4mB,QACdwyF,eAAgBp5G,MAAK,KAClBia,GAEA,IAAIsiB,SAAQ,CAACr4B,EAASs4B,KACzBx8B,MAAK,EAAOm4G,SAAQhrE,UAChBntC,MAAK,IACLA,MAAK,IACL,IACIia,EAAQgqC,QAAQC,iBAChB,IAAItnB,EAAY68E,EAAU,CAAEx1D,OAAQhqC,EAAQgqC,SACxChqC,EAAQ2M,UACRgW,EAAY+6E,GAASp7E,QAAQr4B,QAAQ04B,GAAY,CAAE4tE,aAAcvwF,EAAQ2M,WAEzE3M,EAAQgqC,SACRrnB,EAAYL,QAAQ8nB,KAAK,CAACznB,EAAW58B,MAAK,EAAcia,EAAQgqC,WAEpE,MAAMnvC,QAAe8nB,EACrB14B,EAAQ4Q,GACR9U,KAAK6B,KAAK,YAAaiT,EAC3B,CACA,MAAO0S,GACH,GAAIA,aAAiB,KAAiBvN,EAAQm/F,eAE1C,YADAl1G,IAGJs4B,EAAOhV,GACPxnB,KAAK6B,KAAK,QAAS2lB,EACvB,CACA,QACIxnB,MAAK,GACT,IACDia,GACHja,KAAK6B,KAAK,OACV7B,MAAK,GAAoB,GAEjC,CACA,YAAM05G,CAAOC,EAAW1/F,GACpB,OAAOsiB,QAAQ6oB,IAAIu0D,EAAUr1G,KAAI6oC,MAAOssE,GAAcz5G,KAAKgd,IAAIy8F,EAAWx/F,KAC9E,CAIA,KAAAjT,GACI,OAAKhH,MAAK,GAGVA,MAAK,GAAY,EACjBA,MAAK,IACEA,MAJIA,IAKf,CAIA,KAAA45G,GACI55G,MAAK,GAAY,CACrB,CAIA,KAAAT,GACIS,MAAK,EAAS,IAAIA,MAAK,CAC3B,CAMA,aAAMgkD,GAEuB,IAArBhkD,MAAK,EAAOvB,YAGVuB,MAAK,EAAS,QACxB,CAQA,oBAAM65G,CAAevrD,GAEbtuD,MAAK,EAAOvB,KAAO6vD,SAGjBtuD,MAAK,EAAS,QAAQ,IAAMA,MAAK,EAAOvB,KAAO6vD,GACzD,CAMA,YAAMwrD,GAEoB,IAAlB95G,MAAK,GAAuC,IAArBA,MAAK,EAAOvB,YAGjCuB,MAAK,EAAS,OACxB,CACA,OAAM,CAASG,EAAO0M,GAClB,OAAO,IAAI0vB,SAAQr4B,IACf,MAAM7D,EAAW,KACTwM,IAAWA,MAGf7M,KAAK2C,IAAIxC,EAAOE,GAChB6D,IAAS,EAEblE,KAAKyC,GAAGtC,EAAOE,EAAS,GAEhC,CAIA,QAAI5B,GACA,OAAOuB,MAAK,EAAOvB,IACvB,CAMA,MAAAs7G,CAAO9/F,GAEH,OAAOja,MAAK,EAAO6M,OAAOoN,GAASxY,MACvC,CAIA,WAAI66B,GACA,OAAOt8B,MAAK,CAChB,CAIA,YAAI6iC,GACA,OAAO7iC,MAAK,CAChB,EC9VG,SAASg6G,GAASn3G,GACrB,MAAMo3G,EAAgB,CAClBC,GAAW5gE,GAEf,OAAa,MAATz2C,EACOo3G,EAEPt4G,MAAM2Q,QAAQzP,GACO,IAAjBA,EAAMpB,OACCw4G,EAEJp3G,EAEJ,CACHA,EAER,CCXO,SAASs3G,GAAc5nG,GAC1B,MAAO,CACH6nG,OAAQ7nG,EAAI6nG,QAAU,EACtBC,GAAI9nG,EAAI8nG,IAAM9nG,EAAI+nG,UAAW,EAC7BC,GAAIhoG,EAAIgoG,IAAMhoG,EAAIioG,UAAW,EAC7BC,GAAIloG,EAAIkoG,IAAMloG,EAAImoG,UAAW,EAC7BC,GAAIpoG,EAAIooG,IAAMpoG,EAAIqoG,UAAW,EAC7BC,GAAItoG,EAAIsoG,IAAMtoG,EAAIuoG,UAAW,EAC7BC,UAAWxoG,EAAIwoG,UAAYxoG,EAAIyoG,WAAa,IAAI12G,KAAK22G,IAC1C,CACHl6G,KAAMk6G,EAASl6G,KACfoE,KAAM+0G,GAAWe,EAAS91G,UAGlC+1G,QAAS3oG,EAAI2oG,QAAU3oG,EAAI4oG,SAAW,IAAI72G,KAAK82G,IACpC,CACHr6G,KAAMq6G,EAAOr6G,KACboE,KAAM+0G,GAAWkB,EAAOj2G,MACxBk2G,IAAMD,EAAOC,KAAOD,EAAOnY,KAnBhB,GAoBXt5D,KAAMyxE,EAAOzxE,gBAAgB15B,WAAa,GAAmBmrG,EAAOzxE,MAAQyxE,EAAOzxE,SAInG,CCFO,SAAS2xE,GAAiBjsB,EAAKxjF,EAAO,CAAC,GAC1C,MAAM0vG,EAAY,IAAIzC,GAAO,CACzBG,YAAaptG,EAAK2vG,kBAlBe,IAoBrC,OAAOruE,MAAOsuE,EAAMxhG,EAAU,CAAC,KAC3B,MAAMyhG,EAAe,IAAIC,gBACzBD,EAAap8G,IAAI,OAAQm8G,GACzBzB,GAAS//F,EAAQpX,OAAOsK,SAAQhI,IAE5Bu2G,EAAa18D,OAAO,OAAQk7D,GAAW/0G,GAAM,IAEjD8U,EAAQk9F,aAAa,IAAIf,GAAoB,YAAa,CAAEzuD,OAAQ8zD,KAEpE,MAAMprF,QAAiBkrF,EAAUv+F,KAAImwB,UACjC,MAAMvH,QAAY7lB,MAAM,GAAGsvE,KAAOqsB,IAAgB,CAC9CE,QAAS,CACLC,OAAQ,wBAEZ53D,OAAQhqC,GAASgqC,SAErB,GAAmB,MAAfre,EAAIxV,OACJ,MAAM,IAAI5xB,MAAM,2BAA2BonC,EAAIxV,YAAYwV,EAAIk2E,cAEnE,MAAMzrF,EAAW8pF,SAAoBv0E,EAAIlrB,QAEzC,OADAT,EAAQk9F,aAAa,IAAIf,GAAoB,eAAgB,CAAEzuD,OAAQt3B,KAChEA,CAAQ,GAChB,CACC4zB,OAAQhqC,EAAQgqC,SAEpB,GAAgB,MAAZ5zB,EACA,MAAM,IAAI7xB,MAAM,4BAEpB,OAAO6xB,CAAQ,CAEvB,KC0BW6pF,+BC/EX,MAAM6B,GACFC,IACA,WAAA1sG,CAAY2sG,GACRj8G,KAAKg8G,IAAME,GAAQD,EACvB,CACA,GAAA78G,CAAIq8G,EAAM54G,GACN,IAAIs5G,GAAkB,EACtB,MAAMhB,EAAU,GAChB,IAAK,MAAMh2G,KAAQtC,EAAO,CACtB,MAAMu5G,EAASp8G,KAAKq8G,WAAWZ,EAAMt2G,GACrC,GAAsB,IAAlBi3G,EAAO36G,OAAc,CACrB06G,GAAkB,EAClB,KACJ,CACAhB,EAAQ36G,QAAQ47G,EACpB,CACA,GAAID,EACA,OAAOhC,GAAc,CAAEgB,WAE/B,CACA,UAAAkB,CAAWniC,EAAQ/0E,GACf,MAAMpG,EAAM,GAAGm7E,EAAO9/D,iBAAiBjV,IACjCg2G,EAAUn7G,KAAKg8G,IAAI58G,IAAIL,GAC7B,GAAe,MAAXo8G,EAAiB,CACjB,MAAMmB,EAAgBnB,EACjBtuG,QAAQyxC,GACFA,EAAMi+D,QAAU/xG,KAAKm2D,QAE3Br8D,KAAI,EAAGi4G,UAASv9G,YAAY,IAC1BA,EACHq8G,IAAKpyG,KAAKuuB,OAAO+kF,EAAU/xG,KAAKm2D,OAAS,KACzCx7D,KAAM+0G,GAAWl7G,EAAMmG,UAO3B,OAL6B,IAAzBm3G,EAAc76G,QACdzB,KAAKg8G,IAAI78G,OAAOJ,GAIbu9G,CACX,CACA,MAAO,EACX,CACA,GAAAt/F,CAAIk9D,EAAQkhC,GACR,MAAMr8G,EAAM,GAAGm7E,EAAO9/D,iBAAiBghG,EAAOj2G,OACxCg2G,EAAUn7G,KAAKg8G,IAAI58G,IAAIL,IAAQ,GACrCo8G,EAAQ36G,KAAK,CACT+7G,QAAS/xG,KAAKm2D,MAAuC,KAA7By6C,EAAOC,KHjDhB,IGkDfr8G,MAAOo8G,IAEXp7G,KAAKg8G,IAAI18G,IAAIP,EAAKo8G,EACtB,CACA,MAAAh8G,CAAO+6E,EAAQ/0E,GACX,MAAMpG,EAAM,GAAGm7E,EAAO9/D,iBAAiBjV,IACvCnF,KAAKg8G,IAAI78G,OAAOJ,EACpB,CACA,KAAAQ,GACIS,KAAKg8G,IAAIz8G,OACb,EC5DG,MAAM,GACTy1D,UACAt2D,MACA,WAAA4Q,CAAYzD,GD8DT,IAAepN,EC7DduB,KAAKg1D,UAAY,CAAC,EAClBh1D,KAAKtB,OD4DSD,EC5DKoN,EAAK2wG,WANE,IDmEvB,IAAIT,GAAct9G,IC5DrBE,OAAOmxD,QAAQjkD,EAAKmpD,WAAa,CAAC,GAAG7nD,SAAQ,EAAEsvG,EAAK1nD,MAC3CpzD,MAAM2Q,QAAQyiD,KACfA,EAAW,CAACA,IAGX0nD,EAAInwF,SAAS,OACdmwF,EAAM,GAAGA,MAEbz8G,KAAKg1D,UAAUynD,GAAO1nD,CAAQ,IAGP,MAAvB/0D,KAAKg1D,UAAU,OACfh1D,KAAKg1D,UAAU,KCrBhB,CACHsmD,GAAiB,wCACjBA,GAAiB,+BDqBrB,CASA,WAAM9lE,CAAM0kC,EAAQjgE,EAAU,CAAC,GAC3B,MAAMpX,EAAQm3G,GAAS//F,EAAQpX,OACzBu5G,GAA4B,IAAnBniG,EAAQmiG,OAAmBp8G,KAAKtB,MAAMU,IAAI86E,EAAQr3E,QAAS3D,EAC1E,GAAc,MAAVk9G,EAEA,OADAniG,EAAQk9F,aAAa,IAAIf,GAAoB,YAAa,CAAEzuD,OAAQy0D,KAC7DA,EAEX,MAAMK,EAAM,GAAGviC,EAAOxyE,MAAM,KAAK81B,SAC3Bw3B,GAAah1D,KAAKg1D,UAAUynD,IAAQz8G,KAAKg1D,UAAU,MAAM5mD,MAAK,IACxDnF,KAAKm0B,SAAW,IAAQ,EAAI,IAElCjW,EAAS,GACf,IAAK,MAAM4tC,KAAYC,EAAW,CAE9B,IAAgC,IAA5B/6C,EAAQgqC,QAAQQ,QAChB,MAEJ,IACI,MAAM3vC,QAAeigD,EAASmlB,EAAQ,IAC/BjgE,EACHpX,UAEJ,IAAK,MAAMu4G,KAAUtmG,EAAOomG,OACxBl7G,KAAKtB,MAAMse,IAAIk9D,EAAQkhC,GAE3B,OAAOtmG,CACX,CACA,MAAO2R,GACHU,EAAO3mB,KAAKimB,GACZxM,EAAQk9F,aAAa,IAAIf,GAAoB,YAAa,CAAEzuD,OAAQlhC,IACxE,CACJ,CACA,GAAsB,IAAlBU,EAAO1lB,OACP,MAAM0lB,EAAO,GAEjB,MAAM,IAAIsyC,eAAetyC,EAAQ,iBAAiB+yD,KAAUr3E,WAChE,GFkBJ,SAAWq3G,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,II1FhC,MACQnlG,KAAM2nG,IAAgB,GAAY,WAC1C,MAAMC,WAA4Bn+G,MAC9B,WAAA8Q,CAAY9C,EAAU,+BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAEG,MAAM67G,GAAkBzvE,eAA+B4sB,EAAI9/C,EAAU,CAAC,GACzE,MAAM4iG,EAAiB5iG,EAAQ6iG,mBATP,GAUxB,GAAuB,IAAnBD,EACA,MAAM,IAAIF,GAAoB,+BAElC,MAAO,CAAE5G,GAAYh8C,EAAGpH,eAAer5B,MAAK,EAAEqkB,KAAWA,IAAU++D,MAAgB,GAC7E3nD,EAAW96C,GAAS05F,KJiFvB,SAAa9nG,EAAO,CAAC,GACxB,OAAO,IAAI,GAASA,EACxB,CInFqC8nG,GAC3B7+F,QAAeigD,EAASvf,MAAM,YAAYugE,IAAY,CACxD9xD,OAAQhqC,GAASgqC,OACjBphD,MAAO,CACHq3G,GAAW6C,OAGbh2D,EAASgT,EAAGrF,YACZlW,EAAS,GACf,IAAK,MAAM48D,KAAUtmG,EAAOomG,OAAQ,CAChC,MAAMpsD,EAAOssD,EAAOzxE,KACf3jC,QAAQ,QAAS,IACjB2B,OACAD,MAAM,KAAK,GAChB,GAAY,MAARonD,EACA,SAEJ,GAAc,MAAV/H,IAAmB+H,EAAK9jC,SAAS+7B,GACjC,SAEJ,MAAMgT,EAAK,GAAUjL,GACrB,GAAIA,EAAKviC,WAAW,YAAa,CAC7B,MAAM9Q,QAAiBs+C,EAAG71D,QAAQ,IAC3B+V,EACH6iG,kBAAmBD,EAAiB,IAExCr+D,EAAOh+C,QAAQib,EAASnX,KAAIy1D,GAAMA,EAAG1zD,aACzC,MAEIm4C,EAAOh+C,KAAKu5D,EAAG1zD,WAEvB,CACA,OAAOm4C,CACX,EC3CA,6BCJMw+D,GAAgB,CAClBvZ,UAAW,CACP3/D,OAAQ,GACRm5E,SAAU,GACVC,WAAY,GACZC,eAAiBra,GAAeA,GAEpCt6C,kBAAmB,CACfwM,UAAW,CACPy+C,QAASmJ,KAGjBQ,iBAAkB,CACdC,eAAgB1K,GAAe2K,YAGhCnwE,eAAeowE,GAAezgF,GACjC,MAAM0gF,EAAmB,GAAaR,GAAelgF,GACrD,GAA6C,OAAzC0gF,EAAiBC,qBAA8E,MAA9C7lF,WAAWxmB,SAASvH,KAAK6zG,kBAC1E,MAAM,IAAI,GAAuB,8DAErC,OAAOF,CACX,CCNO,MAAMG,GAAuBl6E,OAAOmL,IAAI,2BCAlCgvE,GAAoBn6E,OAAOmL,IAAI,wBClBtC7rC,GAAI,IACJq0B,GAAQ,GAAJr0B,GACJ+S,GAAQ,GAAJshB,GACJ3a,GAAQ,GAAJ3G,GACJ/B,GAAQ,EAAJ0I,GA6EV,GA3EA,SAAYzd,EAAOib,GACf,IACI,GAAqB,iBAAVjb,GAAsBA,EAAMyC,OAAS,EAC5C,OAiBZ,SAAesE,GAEX,IADAA,EAAMiJ,OAAOjJ,IACLtE,OAAS,IACb,MAAM,IAAIjD,MAAM,uDAEpB,MAAMiK,EAAQ,mIAAmIC,KAAK3C,GACtJ,IAAK0C,EACD,OAAOqhB,IAEX,MAAMtW,EAAIuW,WAAWthB,EAAM,IACrBtD,GAAQsD,EAAM,IAAM,MAAM2R,cAChC,OAAQjV,GACJ,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACD,OAtCFsX,SAsCSjJ,EACX,IAAK,QACL,IAAK,OACL,IAAK,IACD,OAAOA,EAAIO,GACf,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOP,EAAIiJ,GACf,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACD,OAAOjJ,EAAIsC,GACf,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOtC,EAAI4jB,GACf,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAO5jB,EAAIzQ,GACf,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACD,OAAOyQ,EACX,QAEI,MAAM,IAAIhV,MAAM,YAAY2G,+CAExC,CAvEmBmgB,CAAMtmB,GAEZ,GAAqB,iBAAVA,GAAsB6kB,SAAS7kB,GAC3C,OAAOib,GAAS1W,KA4F5B,SAAiBkH,GACb,MAAM6sB,EAAQruB,KAAKsE,IAAI9C,GACvB,OAAI6sB,GAAS7a,GACF4a,GAAO5sB,EAAI6sB,EAAO7a,GAAG,OAE5B6a,GAASxhB,GACFuhB,GAAO5sB,EAAI6sB,EAAOxhB,GAAG,QAE5BwhB,GAASF,GACFC,GAAO5sB,EAAI6sB,EAAOF,GAAG,UAE5BE,GAASv0B,GACFs0B,GAAO5sB,EAAI6sB,EAAOv0B,GAAG,UAEzB,GAAG0H,MACd,CA3GmCozG,CAAQ7+G,GAyE3C,SAAkByL,GACd,MAAM6sB,EAAQruB,KAAKsE,IAAI9C,GACvB,OAAI6sB,GAAS7a,GACF,GAAGxT,KAAKuuB,MAAM/sB,EAAKgS,OAE1B6a,GAASxhB,GACF,GAAG7M,KAAKuuB,MAAM/sB,EAAKqL,OAE1BwhB,GAASF,GACF,GAAGnuB,KAAKuuB,MAAM/sB,EAAK2sB,OAE1BE,GAASv0B,GACF,GAAGkG,KAAKuuB,MAAM/sB,EAAK1H,OAEvB,GAAG0H,KACd,CAxFoDgtB,CAASz4B,GAErD,MAAM,IAAIR,MAAM,mCACpB,CACA,MAAOgpB,GACH,MAAMhb,EAiHd,SAAiBgb,GACb,MAAwB,iBAAVA,GAAgC,OAAVA,GAAkB,YAAaA,CACvE,CAnHwBs2F,CAAQt2F,GAClB,GAAGA,EAAMhb,kBAAkB6Y,KAAKE,UAAUvmB,KAC1C,gCACN,MAAM,IAAIR,MAAMgO,EACpB,CACJ,EAqGA,SAAS6qB,GAAO5sB,EAAI6sB,EAAO9jB,EAAGzS,GAC1B,MAAMw2B,EAAWD,GAAa,IAAJ9jB,EAC1B,MAAO,GAAGvK,KAAKuuB,MAAM/sB,EAAK+I,MAAMzS,IAAOw2B,EAAW,IAAM,IAC5D,CCtHA,MAAM8C,GAyMN,WACI,IAGI,OAAOgB,YACX,CACA,MAAO7T,GAGP,CACJ,CAnNgB8T,GA0JV,GAAMruB,QAAQ7C,OAAS6C,QAAQ7B,KAAO,MAAU,GAuEtD,GCnOe,SAAevB,GA8C1B,SAASC,EAAYC,GACjB,IAAIC,EAEAC,EACAC,EAFAC,EAAiB,KAGrB,SAASC,KAASjI,GAGd,IAAKiI,EAAMC,QACP,OAEJ,MAAMC,EAAOF,EAEPtB,EAAOyB,OAAO,IAAIC,MAClBC,EAAK3B,GAAQkB,GAAYlB,GAC/BwB,EAAKI,KAAOD,EACZH,EAAKzB,KAAOmB,EACZM,EAAKxB,KAAOA,EACZkB,EAAWlB,EACX3G,EAAK,GAAK2H,EAAYa,OAAOxI,EAAK,IACX,iBAAZA,EAAK,IAEZA,EAAKyI,QAAQ,MAGjB,IAAIC,EAAQ,EACZ1I,EAAK,GAAKA,EAAK,GAAG6D,QAAQ,iBAAiB,CAACyC,EAAOqC,KAE/C,GAAc,OAAVrC,EACA,MAAO,IAEXoC,IAEA,MAAME,EAAYjB,EAAYkB,WAAWF,GACzC,GAAyB,mBAAdC,EAA0B,CACjC,MAAME,EAAM9I,EAAK0I,GACjBpC,EAAQsC,EAAU9J,KAAKqJ,EAAMW,GAE7B9I,EAAK+I,OAAOL,EAAO,GACnBA,GACJ,CACA,OAAOpC,CAAK,IAIhBqB,EAAYqB,WAAWlK,KAAKqJ,EAAMnI,IAEpBmI,EAAKc,KAAOtB,EAAYsB,KAChC7I,MAAM+H,EAAMnI,EACtB,CAiCA,OAhCAiI,EAAML,UAAYA,EAElBK,EAAMiB,UAAYvB,EAAYuB,YAC9BjB,EAAMkB,MAAQxB,EAAYyB,YAAYxB,GACtCK,EAAMoB,OAASA,EACfpB,EAAMqB,QAAU3B,EAAY2B,QAC5B9M,OAAO0K,eAAee,EAAO,UAAW,CACpCsB,YAAY,EACZC,cAAc,EACdvM,IAAK,IACsB,OAAnB+K,EACOA,GAGPF,IAAoBH,EAAY8B,aAEhC3B,EAAkBH,EAAY8B,WAC9B1B,EAAeJ,EAAYO,QAAQN,IAEhCG,GAEX5K,IAAKD,IACD8K,EAAiB9K,CAAC,IAKM,mBAArByK,EAAY+B,MAEnB/B,EAAY+B,KAAKzB,GAGdA,CACX,CACA,SAASoB,EAAOzB,EAAW+B,GACvB,MAAMC,EAAWjC,EAAY9J,KAAK+J,gBAAkC,IAAd+B,EAA4B,IAAMA,GAAa/B,GAErG,OADAgC,EAASX,IAAMpL,KAAKoL,IACbW,CACX,CAuEA,SAASgyG,EAAYC,GACjB,OAAOA,EAAO33G,WACToB,UAAU,EAAGu2G,EAAO33G,WAAW5E,OAAS,GACxCuE,QAAQ,UAAW,IAC5B,CAsBA,OAtOA8D,EAAYM,MAAQN,EACpBA,EAAYyC,QAAUzC,EACtBA,EAAYa,OAkNZ,SAAgBM,GACZ,OAAIA,aAAezM,MACRyM,EAAIxE,OAASwE,EAAIuB,QAErBvB,CACX,EAtNAnB,EAAY2C,QAsKZ,WACI,MAAMb,EAAa,IACZ9B,EAAY9I,MAAMsD,IAAIy5G,MACtBj0G,EAAY4C,MAAMpI,IAAIy5G,GAAaz5G,KAAIyF,GAAa,IAAMA,KAC/DlC,KAAK,KAEP,OADAiC,EAAY6C,OAAO,IACZf,CACX,EA5KA9B,EAAY6C,OAwIZ,SAAgBf,GAOZ,IAAIrK,EALJuI,EAAY8C,KAAKhB,GAEjB9B,EAAY8B,WAAaA,EACzB9B,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAEpB,MAAMhF,GAA+B,iBAAfkE,EAA0BA,EAAa,IAAIlE,MAAM,UACjEtF,EAAMsF,EAAMjG,OAClB,IAAKF,EAAI,EAAGA,EAAIa,EAAKb,IACZmG,EAAMnG,KAKW,OADtBqK,EAAalE,EAAMnG,GAAGyE,QAAQ,MAAO,QACtB,GACX8D,EAAY4C,MAAMlM,KAAK,IAAIy9G,OAAO,IAAMryG,EAAWopB,OAAO,GAAK,MAG/DlrB,EAAY9I,MAAMR,KAAK,IAAIy9G,OAAO,IAAMryG,EAAa,MAGjE,EA9JA9B,EAAYO,QAkLZ,SAAiBtJ,GACb,GAA8B,MAA1BA,EAAKA,EAAKU,OAAS,GACnB,OAAO,EAEX,IAAIF,EACAa,EACJ,IAAKb,EAAI,EAAGa,EAAM0H,EAAY4C,MAAMjL,OAAQF,EAAIa,EAAKb,IACjD,GAAIuI,EAAY4C,MAAMnL,GAAG4G,KAAKpH,GAC1B,OAAO,EAGf,IAAKQ,EAAI,EAAGa,EAAM0H,EAAY9I,MAAMS,OAAQF,EAAIa,EAAKb,IACjD,GAAIuI,EAAY9I,MAAMO,GAAG4G,KAAKpH,GAC1B,OAAO,EAGf,OAAO,CACX,EAlMA+I,EAAYkD,SAAW,GACvBlD,EAAY2B,QAuNZ,WACIwB,QAAQC,KAAK,wIACjB,EAxNAvO,OAAOuG,KAAK2E,GAAKsD,SAAQpO,IAErB+K,EAAY/K,GAAO8K,EAAI9K,EAAI,IAK/B+K,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAMpB5C,EAAYkB,WAAa,CAAC,EAgB1BlB,EAAYyB,YATZ,SAAqBxB,GACjB,IAAIqD,EAAO,EACX,IAAK,IAAI7L,EAAI,EAAGA,EAAIwI,EAAUtI,OAAQF,IAClC6L,GAASA,GAAQ,GAAKA,EAAQrD,EAAUsD,WAAW9L,GACnD6L,GAAQ,EAGZ,OAAOtD,EAAYwD,OAAOrE,KAAKsE,IAAIH,GAAQtD,EAAYwD,OAAO7L,OAClE,EA6LAqI,EAAYo0G,gBAAgBp0G,EAAYkB,YAExClB,EAAY6C,OAAO7C,EAAY0D,QAExB1D,CACX,CDLA,CAAqB,CAAEqB,WA3GvB,SAAoBhJ,GAOhB,GANAA,EAAK,IAAMnC,KAAKqL,UAAY,KAAO,IAC/BrL,KAAK+J,WACJ/J,KAAKqL,UAAY,MAAQ,KAC1BlJ,EAAK,IACJnC,KAAKqL,UAAY,MAAQ,KAC1B,IAAM,GAASrL,KAAK0K,OACnB1K,KAAKqL,UACN,OAEJ,MAAMlE,EAAI,UAAYnH,KAAKsL,MAC3BnJ,EAAK+I,OAAO,EAAG,EAAG/D,EAAG,kBAIrB,IAAI0D,EAAQ,EACRuvB,EAAQ,EACZj4B,EAAK,GAAG6D,QAAQ,eAAgByC,IACd,OAAVA,IAGJoC,IACc,OAAVpC,IAGA2xB,EAAQvvB,GACZ,IAEJ1I,EAAK+I,OAAOkvB,EAAO,EAAGjzB,EAC1B,EA8EmCyF,KAjEnC,SAAchB,GACV,IACQA,EACAyuB,IAASC,QAAQ,QAAS1uB,GAG1ByuB,IAASE,WAAW,QAE5B,CACA,MAAO/S,GAGP,CACJ,EAoDyCha,KA9CzC,WACI,IAAIgtB,EACJ,IACIA,EAAIH,IAASI,QAAQ,QACzB,CACA,MAAOjT,GAGP,CAKA,OAHKgT,QAAmC,IAAvB5C,WAAWxmB,SAA2B,QAASwmB,WAAWxmB,UACvEopB,EAAI5C,WAAWxmB,QAAQvH,IAAI6wB,OAExBF,CACX,EAgC+CnvB,UAvI/C,WAKI,QAAsB,oBAAX0F,SAA0BA,OAAOK,SAAoC,aAAxBL,OAAOK,QAAQjM,OAAuB4L,OAAOK,QAAQupB,UAIpF,oBAAdC,WAAmG,MAArEA,UAAUC,WAAWzgB,cAAc3R,MAAM,4BAMtD,oBAAbqyB,UAA4BA,SAASC,iBAAiBC,OAAOC,kBAGrD,oBAAXlqB,QAA0BA,OAAO9D,UAAY8D,OAAO9D,QAAQiuB,SAAYnqB,OAAO9D,QAAQkuB,WAAapqB,OAAO9D,QAAQmuB,QAGrG,oBAAdR,WAA4F,MAA9DA,UAAUC,WAAWzgB,cAAc3R,MAAM,mBAA8B+V,SAASy/F,OAAO/3G,GAAI,KAAO,IAElH,oBAAd00B,WAA6BA,UAAUC,WAAWzgB,cAAc3R,MAAM,sBACtF,EA+G0Dy1G,gBAb1D,SAAyBlzG,GAIrBA,EAAWxI,EAAI,SAAUnD,GACrB,IACI,OAAOgmB,KAAKE,UAAUlmB,EAC1B,CACA,MAAOmoB,GACH,MAAO,+BAAiCA,EAAMhb,OAClD,CACJ,CACJ,EAC2Ec,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+E+sB,WAASjvB,IAAG,KE3N/F,MC8HO,SAAS+yG,KACZ,MAAO,CACHhe,aAAap/F,GAkBd,SAAgBA,GAEnB,IAAIk/F,EA7FR,SAA8Bl2F,GAC1B,MAAMyzC,EAAS,OAQf,OAPAA,EAAOnzC,SAAU,EACjBmzC,EAAOlyC,MAAQ,GACfkyC,EAAO9yC,KAAO,EACd8yC,EAAOpyC,IAAM,OACboyC,EAAOzzC,UAAYA,EACnByzC,EAAO/xC,QAAU,KAAM,EACvB+xC,EAAOhyC,OAAS,IAAMgyC,EACfA,CACX,CAmFgB4gE,CAAqB,GAAGr9G,WAKpC,OAHI,GAAMsJ,QAAQ,GAAGtJ,YAA2F,MAA1E,GAAMC,MAAMsD,KAAKk2B,GAAMA,EAAEn0B,aAAYizB,MAAM9lB,GAAMA,EAAEwX,SAAS,cAC9Fi1E,EAAQ,GAAM,GAAGl/F,YAEdpC,OAAO01B,OAAO,GAAMtzB,GAAO,CAC9BymB,MAAO,GAAM,GAAGzmB,WAChBk/F,SAER,CA5BmBziD,CAAOz8C,GAG1B,CAmCA,SAASs9G,GAASt4G,GACd,GAAW,MAAPA,GAIe,KADnBA,EAAMA,EAAI4B,QACFlG,OAGR,OAAOsE,CACX,CCzLO,SAASu4G,GAAYC,EAAMj6G,GAC9B,MAAMy6C,EAAW,CACb,CAACtb,OAAOsb,UAAW,IACRA,EAEX12C,KAAM,KACF,MAAMA,EAAOk2G,EAAKl2G,OACZ4C,EAAM5C,EAAKrJ,MACjB,OAAkB,IAAdqJ,EAAK26B,MAAwB,MAAP/3B,EACP,CACX+3B,MAAM,EACNhkC,WAAOE,GAIR,CACH8jC,MAAM,EACNhkC,MAAOsF,EAAI2G,GACd,GAGT,OAAO8zC,CACX,CACO,SAAS,GAAiBh5C,GAE7B,OAAOypF,GADW,GAAcjkD,GAAUvvB,OAAO,IAAIjW,MAEzD,CDOA,GAAMiF,WAAW4V,EAAKvhB,GACN,MAALA,EAAY,YAAcksC,GAAU1C,WAAWxpC,GAG1D,GAAM2L,WAAWmS,EAAK9d,GACN,MAALA,EAAY,YAAcg3B,GAAOwS,WAAWxpC,GAGvD,GAAM2L,WAAWosB,EAAK/3B,GACN,MAALA,EAAY,YAAc0c,GAAO8sB,WAAWxpC,GAGvD,GAAM2L,WAAW0zB,EAAKr/B,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAW7D,EAAK9H,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAW0tB,EAAKr5B,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAW2V,EAAKthB,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAWiZ,EAAK5kB,GACN,MAALA,EAAY,YAAcg/G,GAASh/G,EAAEoH,QAAU43G,GAASh/G,EAAEmN,UAAYnN,EAAEgH,WElD5E,MAAMm4G,GACTl/G,IACA,WAAAgQ,CAAYhQ,GAER,GADAU,KAAKV,IAAM,IAAI67C,IACJ,MAAP77C,EACA,IAAK,MAAMP,KAAOO,EACdU,KAAKV,IAAI0d,IAAIje,EAAIsH,WAG7B,CACA,QAAI5H,GACA,OAAOuB,KAAKV,IAAIb,IACpB,CACA,CAACglC,OAAOsb,YACJ,OAAO/+C,KAAKiD,QAChB,CACA,GAAA+Z,CAAI0qC,GACA1nD,KAAKV,IAAI0d,IAAI0qC,EAAKrhD,WACtB,CACA,KAAA9G,GACIS,KAAKV,IAAIC,OACb,CACA,OAAOmoD,GACH1nD,KAAKV,IAAI4nD,OAAOQ,EAAKrhD,WACzB,CACA,OAAAypD,GACI,OAAOwuD,GAAYt+G,KAAKV,IAAIwwD,WAAY7kD,IACpC,MAAM87C,EAAS,GAAiB97C,EAAI,IACpC,MAAO,CAAC87C,EAAQA,EAAO,GAE/B,CACA,OAAA55C,CAAQsxG,GACJz+G,KAAKV,IAAI6N,SAASpH,IACd,MAAMghD,EAAS,GAAiBhhD,GAChC04G,EAAU13D,EAAQA,EAAQ/mD,KAAK,GAEvC,CACA,GAAAf,CAAIyoD,GACA,OAAO1nD,KAAKV,IAAIL,IAAIyoD,EAAKrhD,WAC7B,CACA,MAAApD,GACI,OAAOq7G,GAAYt+G,KAAKV,IAAI2D,UAAWgI,GAC5B,GAAiBA,IAEhC,CACA,YAAAyzG,CAAanwE,GACT,MAAMiQ,EAAS,IAAIggE,GACnB,IAAK,MAAMz3D,KAAUxY,EACbvuC,KAAKf,IAAI8nD,IACTvI,EAAOxhC,IAAI+pC,GAGnB,OAAOvI,CACX,CACA,UAAAmgE,CAAWpwE,GACP,MAAMiQ,EAAS,IAAIggE,GACnB,IAAK,MAAMz3D,KAAU/mD,KACZuuC,EAAMtvC,IAAI8nD,IACXvI,EAAOxhC,IAAI+pC,GAGnB,OAAOvI,CACX,CACA,KAAAogE,CAAMrwE,GACF,MAAMiQ,EAAS,IAAIggE,GACnB,IAAK,MAAMz3D,KAAUxY,EACjBiQ,EAAOxhC,IAAI+pC,GAEf,IAAK,MAAMA,KAAU/mD,KACjBw+C,EAAOxhC,IAAI+pC,GAEf,OAAOvI,CACX,EC1FJ,MAAM19C,GAAS,CAAC,EACV+9G,GAAcC,IAChBA,EAAO16D,iBAAiB,WAAYjkD,IAChC0+G,GAAWvyD,cAAc,UAAWwyD,EAAQ3+G,EAAM,IAEnC,MAAf2+G,EAAOjtD,MACPitD,EAAOjtD,KAAKzN,iBAAiB,WAAYjkD,IACrC0+G,GAAWvyD,cAAc,UAAWwyD,EAAQ3+G,EAAM,GAE1D,EAEJ0+G,GAAWz6D,iBAAmB,CAACj/C,EAAMtF,KACb,MAAhBiB,GAAOqE,KACPrE,GAAOqE,GAAQ,IAEnBrE,GAAOqE,GAAM3E,KAAKX,EAAG,EAEzBg/G,GAAWv6D,oBAAsB,CAACn/C,EAAMtF,KAChB,MAAhBiB,GAAOqE,KAGXrE,GAAOqE,GAAQrE,GAAOqE,GACjB0H,QAAOxM,GAAYA,IAAaR,IAAG,EAE5Cg/G,GAAWvyD,cAAgB,SAAUnnD,EAAM25G,EAAQ3+G,GAC3B,MAAhBW,GAAOqE,IAGXrE,GAAOqE,GAAMgI,SAAQtN,GAAMA,EAAGi/G,EAAQ3+G,IAC1C,EACA,YC9Ba4+G,GAA2B,2BAC3BC,GAA2B,2BAC3BC,GAAyB,yBACzBC,GAA4B,4BAC5BC,GAA4B,4BAC5BC,GAA0B,0BCFjCC,GAA0B,CAACn/G,EAASo/G,EAAah0F,EAAai0F,EAAaC,IACtE,CAACV,EAAQ3+G,KACZ,GAAIA,EAAMwpC,KAAKxkC,OAASmmB,EACpB,OAEJ,MAAMm0F,EAAe,CACjBt6G,KAAMhF,EAAMwpC,KAAKxkC,KACjBpE,KAAMZ,EAAMwpC,KAAK5oC,KACjB2+G,WAAYv/G,EAAMwpC,KAAK+1E,YAE3Bx/G,EAAQosD,cAAc,IAAIqzD,aAAaL,EAAa,CAChD31E,KAAM,CACF5oC,KAAM0+G,EAAa1+G,KACnB6+G,QAASzyE,UAEL2xE,EAAOe,YAAY,CACf16G,KAAMq6G,EACNz+G,KAAM0+G,EAAa1+G,KACnB2+G,WAAYD,EAAaC,mBAGvB,IAAInjF,SAASr4B,IACf,MAAM47G,EAAwB3/G,IAC1B,GAAmB,MAAfA,GAAOwpC,KACP,OAEJ,MAAMo2E,EACI5/G,EAAMwpC,KAAKxkC,KADf46G,GAEI5/G,EAAMwpC,KAAK5oC,KACLZ,EAAMwpC,KAAK+1E,YAEvBK,IAAsBR,GAAeQ,IAA4BN,EAAaC,aAC9EZ,EAAOx6D,oBAAoB,UAAWw7D,GACtC57G,IACJ,EAEJ46G,EAAO16D,iBAAiB,UAAW07D,EAAqB,GAC1D,KAGX,EAGLE,GAAwB,CAACj/G,EAAMuqB,EAAak0F,EAAWD,IAClDpyE,UACH,MAAMz8B,EC/CHzH,KAAKm0B,SAAS/2B,WAAWoB,UAAU,GDqDtC,OALAmwB,WAAWioF,YAAY,CACnB16G,KAAMmmB,EACNo0F,WAAYhvG,EACZ3P,SAEG,IAAIw7B,SAASr4B,IAChB,MAAM7D,EAAYF,IACd,GAAmB,MAAfA,GAAOwpC,KACP,OAEJ,MAAMs2E,EACI9/G,EAAMwpC,KAAKxkC,KADf86G,EAEU9/G,EAAMwpC,KAAK+1E,WAEvBO,IAAuBT,GAAaS,IAA6BvvG,IACjEknB,WAAW0sB,oBAAoB,UAAWjkD,GAE1C6D,GAAQ,KAEJ0zB,WAAWioF,YAAY,CACnB16G,KAAMo6G,EACNG,WAAYhvG,EACZ3P,QACF,IAEV,EAEJ62B,WAAWwsB,iBAAiB,UAAW/jD,EAAS,GAClD,EAGJ6/G,GAAiB,CACnBC,eAAe,GEgCbC,GAAU,CAAC,EACjB,IAAIC,GACJlzE,eAAemzE,GAAkBv8E,EAAO9pB,GACpC,IAAI2rB,EACJ,MAAMlH,EAAI,IAAInC,SAASr4B,IACnB0hC,EAAM1hC,CAAO,IAWjB,OATK6/B,EAAM/mB,KAAImwB,SAAYwqE,GAAS,iBAC1B,IAAIp7E,SAASr4B,IACf0hC,GAAI,KACA1hC,GAAS,GACX,GAET,EANmC,GAM9B,CACFsmG,aAAcvwF,EAAQ2M,YAEnB8X,CACX,CACA,MAgDM,GAAiB,CACnB39B,KAAM,OACNk4G,YAAarzF,IACbgB,QAAS,MACTu5F,eAAe,GChLZ,IAAII,GA4OAC,GA8DAC,GC3SX,SAASC,GAAkB35D,EAAQh/B,GAC/B,GAAwB,MAApBg/B,EAAOsiB,WAA2C,MAAtBthD,EAASshD,UACrC,OAAOtiB,EAEX,IAAIlxC,EAOJ,MANoB,QAAhBkxC,EAAO5hD,OAGP0Q,EAAS,GADS01B,GAAUvvB,OAAO,IAAI+qC,OAIpC0oC,GADWf,GAAsB3mE,EAASshD,UAAWxzD,GAEhE,CACO,SAAS8qG,GAAY55D,EAAQv3C,EAAKoxG,GAErC,OAAOC,GAAS95D,EADHw5D,GAAOvkG,OAAOxM,GACGoxG,EAClC,CACO,SAASC,GAAS95D,EAAQW,EAAMk5D,GACnC,MAAM9oD,EAAO,IAAIjqB,IAEX8yB,EAAM16B,OAAOz7B,KAAKm2D,OACxB,IAAK,MAAO5hE,EAAK8zC,KAAQ6U,EAAKoQ,KAAKhI,UACb,MAAdjd,EAAIiuE,QAAkBjuE,EAAIiuE,OAASngD,GAGvC7I,EAAKx4D,IAAIP,EAAK8zC,GAElB,MAAO,IACA6U,EACHh3C,GAAIgwG,GAAkB35D,EAAQW,GAC9B+7C,UAAW/7C,EAAK+7C,UAEX52F,QAAO,EAAGk0G,cAA2B,MAAZA,GAAoBA,EAAYv2G,KAAKm2D,MAAQigD,IACtEt8G,KAAI,EAAGk/F,UAAWzpC,EAAImvC,kBAChB,CACH1F,UAAW,GAAUzpC,GACrBmvC,YAAaA,IAAe,MAGpChhD,SAAUR,EAAKQ,SACfihD,mBAAoBzhD,EAAKyhD,yBAAsBjqG,EAC/C44D,OAER,CCdA,SAASkpD,GAA2BC,EAAMC,GACtC,OAAY,MAARD,GAAwB,MAARC,GAGR,MAARD,GAAwB,MAARC,GACT,GAAiBD,EAAMC,EAGtC,CACA,SAASC,GAAcF,EAAMC,EAAME,GAC/B,GAAIH,EAAKx/G,SAAWy/G,EAAKz/G,OACrB,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAI0/G,EAAKx/G,OAAQF,IAC7B,IAAK6/G,EAAQH,EAAK1/G,GAAI2/G,EAAK3/G,IACvB,OAAO,EAGf,OAAO,CACX,CACA,SAAS8/G,GAAYC,EAAMC,EAAMH,GAC7B,GAAIE,EAAK7iH,OAAS8iH,EAAK9iH,KACnB,OAAO,EAEX,IAAK,MAAOM,EAAKC,KAAUsiH,EAAKxxD,UAAW,CACvC,MAAM0xD,EAASD,EAAKniH,IAAIL,GACxB,GAAc,MAAVyiH,EACA,OAAO,EAEX,IAAKJ,EAAQpiH,EAAOwiH,GAChB,OAAO,CAEf,CACA,OAAO,CACX,EF7DA,SAAWjB,GACP,IAAIkB,EAuDAC,EAwDArvE,GA9GJ,SAAWovE,GACP,IAAIpvE,EACJovE,EAAmBp6E,MAAQ,KACT,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAX1Q,EAAIxT,KAA2B,KAAZwT,EAAIxT,MACxBgV,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIxT,MAEC,MAAbwT,EAAIvT,OAAiBuT,EAAIvT,MAAMwR,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIvT,SAEa,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRxT,IAAK,GACLC,MAAO,EAAgB,IAErBiI,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIxT,IAAMugB,EAAO/O,SACjB,MAEJ,KAAK,EACDgC,EAAIvT,MAAQsgB,EAAOxQ,QACnB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXovE,EAAmBvsG,OAAU3C,GAClB89B,GAAc99B,EAAKkvG,EAAmBp6E,SAEjDo6E,EAAmBzlG,OAAS,CAACxM,EAAKstB,IACvBsK,EAAc53B,EAAKiyG,EAAmBp6E,QAASvK,EAE7D,CArDD,CAqDG2kF,EAAqBlB,EAAKkB,qBAAuBlB,EAAKkB,mBAAqB,CAAC,IAE/E,SAAWC,GACP,IAAIrvE,EACJqvE,EAAer6E,MAAQ,KACL,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAX1Q,EAAIxT,KAA2B,KAAZwT,EAAIxT,MACxBgV,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIxT,MAEA,MAAbwT,EAAIvT,QACJ+U,EAAE1D,OAAO,IACTowG,GAAIp5E,QAAQnyB,OAAO3C,EAAIvT,MAAO+U,KAEL,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRxT,IAAK,IAEHkI,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIxT,IAAMugB,EAAO/O,SACjB,MAEJ,KAAK,EACDgC,EAAIvT,MAAQyhH,GAAIp5E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACpD8iC,OAAQrW,EAAKqW,QAAQn0C,QAEzB,MAEJ,QACIsgB,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXqvE,EAAexsG,OAAU3C,GACd89B,GAAc99B,EAAKmvG,EAAer6E,SAE7Cq6E,EAAe1lG,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKkyG,EAAer6E,QAASvK,EAEzD,CAtDD,CAsDG4kF,EAAiBnB,EAAKmB,iBAAmBnB,EAAKmB,eAAiB,CAAC,IAEnEnB,EAAKl5E,MAAQ,KACK,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAIkxF,UACJ,IAAK,MAAMzkG,KAASuT,EAAIkxF,UACpB1vF,EAAE1D,OAAO,IACTmwG,GAAQn5E,QAAQnyB,OAAOlW,EAAO+U,GAGtC,GAAqB,MAAjBxB,EAAIq1C,UACJ,IAAK,MAAM5oD,KAASuT,EAAIq1C,UACpB7zC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAWjB,GARqB,MAAjBuT,EAAI82D,YACJt1D,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI82D,YAEc,MAA1B92D,EAAI42F,qBACJp1F,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI42F,qBAEI,MAAhB52F,EAAI21C,UAA0C,IAAtB31C,EAAI21C,SAASzpD,KACrC,IAAK,MAAOM,EAAKC,KAAUuT,EAAI21C,SAAS4H,UACpC/7C,EAAE1D,OAAO,IACTkwG,EAAKkB,mBAAmBp6E,QAAQnyB,OAAO,CAAEnW,MAAKC,SAAS+U,GAG/D,GAAgB,MAAZxB,EAAIulD,MAAkC,IAAlBvlD,EAAIulD,KAAKr5D,KAC7B,IAAK,MAAOM,EAAKC,KAAUuT,EAAIulD,KAAKhI,UAChC/7C,EAAE1D,OAAO,IACTkwG,EAAKmB,eAAer6E,QAAQnyB,OAAO,CAAEnW,MAAKC,SAAS+U,GAGxC,MAAfxB,EAAIovG,UACJ5tG,EAAE1D,OAAO,IACT0D,EAAE6yB,aAAar0B,EAAIovG,WAEM,IAAzB7kF,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRkxF,UAAW,GACX77C,UAAW,GACXM,SAAU,IAAIra,IACdiqB,KAAM,IAAIjqB,KAER5mC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACD,GAA8B,MAA1B/V,EAAKqW,QAAQswD,WAAqBlxF,EAAIkxF,UAAUhiG,SAAWq7B,EAAKqW,OAAOswD,UACvE,MAAM,IAAI5xD,GAAe,8DAE7Bt/B,EAAIkxF,UAAUjjG,KAAKggH,GAAQn5E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC/D8iC,OAAQrW,EAAKqW,QAAQuwD,cAEzB,MAEJ,KAAK,EACD,GAA8B,MAA1B5mE,EAAKqW,QAAQyU,WAAqBr1C,EAAIq1C,UAAUnmD,SAAWq7B,EAAKqW,OAAOyU,UACvE,MAAM,IAAI/V,GAAe,8DAE7Bt/B,EAAIq1C,UAAUpnD,KAAK8e,EAAO/O,UAC1B,MAEJ,KAAK,EACDgC,EAAI82D,UAAY/pD,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAI42F,mBAAqB7pF,EAAOxQ,QAChC,MAEJ,KAAK,EAAG,CACJ,GAA6B,MAAzBguB,EAAKqW,QAAQ+U,UAAoB31C,EAAI21C,SAASzpD,OAASq+B,EAAKqW,OAAO+U,SACnE,MAAM,IAAIpW,GAAa,6DAE3B,MAAMwM,EAAQiiE,EAAKkB,mBAAmBp6E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,UACpEkC,EAAI21C,SAAS5oD,IAAIg/C,EAAMv/C,IAAKu/C,EAAMt/C,OAClC,KACJ,CACA,KAAK,EAAG,CACJ,GAAyB,MAArB89B,EAAKqW,QAAQ2kB,MAAgBvlD,EAAIulD,KAAKr5D,OAASq+B,EAAKqW,OAAO2kB,KAC3D,MAAM,IAAIhmB,GAAa,yDAE3B,MAAMwM,EAAQiiE,EAAKmB,eAAer6E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACtE8iC,OAAQ,CACJn0C,MAAO89B,EAAKqW,QAAQyuE,cAG5BrvG,EAAIulD,KAAKx4D,IAAIg/C,EAAMv/C,IAAKu/C,EAAMt/C,OAC9B,KACJ,CACA,KAAK,EACDuT,EAAIovG,QAAUriG,EAAOsnB,eACrB,MAEJ,QACItnB,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXkuE,EAAKrrG,OAAU3C,GACJ89B,GAAc99B,EAAKguG,EAAKl5E,SAEnCk5E,EAAKvkG,OAAS,CAACxM,EAAKstB,IACTsK,EAAc53B,EAAK+wG,EAAKl5E,QAASvK,EAE/C,CA1OD,CA0OGyjF,KAASA,GAAO,CAAC,IAEpB,SAAWC,GACP,IAAInuE,EACJmuE,EAAQn5E,MAAQ,KACE,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIixF,WAAqBjxF,EAAIixF,UAAUhzF,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIixF,YAEO,MAAnBjxF,EAAI22F,cACJn1F,EAAE1D,OAAO,IACT0D,EAAEwO,KAAKhQ,EAAI22F,cAEK,MAAhB32F,EAAIwuG,WACJhtG,EAAE1D,OAAO,IACT0D,EAAE6yB,aAAar0B,EAAIwuG,YAEM,IAAzBjkF,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRixF,UAAW,EAAgB,IAEzBv8F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIixF,UAAYlkF,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAI22F,YAAc5pF,EAAOiD,OACzB,MAEJ,KAAK,EACDhQ,EAAIwuG,SAAWzhG,EAAOsnB,eACtB,MAEJ,QACItnB,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXmuE,EAAQtrG,OAAU3C,GACP89B,GAAc99B,EAAKiuG,EAAQn5E,SAEtCm5E,EAAQxkG,OAAS,CAACxM,EAAKstB,IACZsK,EAAc53B,EAAKgxG,EAAQn5E,QAASvK,EAElD,CA5DD,CA4DG0jF,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACP,IAAIpuE,EACJouE,EAAIp5E,MAAQ,KACM,MAAVgL,IACAA,EAAS7lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIvT,OAA+B,IAAduT,EAAIvT,QAC1B+U,EAAE1D,OAAO,GACT0D,EAAE1D,OAAOkC,EAAIvT,QAEC,MAAduT,EAAIuuG,SACJ/sG,EAAE1D,OAAO,IACT0D,EAAEqO,OAAO7P,EAAIuuG,UAEY,IAAzBhkF,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRvT,MAAO,GAELiI,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM4rC,EAAMvzB,EAAOjP,SACnB,OAAQwiC,IAAQ,GACZ,KAAK,EACDtgC,EAAIvT,MAAQsgB,EAAOjP,SACnB,MAEJ,KAAK,EACDkC,EAAIuuG,OAASxhG,EAAO8C,SACpB,MAEJ,QACI9C,EAAO2X,SAAe,EAAN4b,GAI5B,CACA,OAAOtgC,CAAG,KAGX8/B,GAEXouE,EAAIvrG,OAAU3C,GACH89B,GAAc99B,EAAKkuG,EAAIp5E,SAElCo5E,EAAIzkG,OAAS,CAACxM,EAAKstB,IACRsK,EAAc53B,EAAKixG,EAAIp5E,QAASvK,EAE9C,CApDD,CAoDG2jF,KAAQA,GAAM,CAAC,IGpWlB,MAAMoB,GAAW,IACXC,IAAW,IAAI/1E,aAAc72B,OAAO2sG,IACpCE,GAAUD,GAAS,GAiBlB,MAAME,GACTC,KAKA,WAAA3yG,CAAYvM,EAAGguF,GACX,GAAiB,iBAANhuF,EACP/C,KAAKiiH,KAAO,GAAqBl/G,OAEhC,MAAIA,aAAakN,YAIlB,MAAM,IAAIzR,MAAM,+CAHhBwB,KAAKiiH,KAAOl/G,CAIhB,CAOA,GANa,MAATguF,IACAA,GAAQ,GAERA,GACA/wF,KAAK+wF,QAEoB,IAAzB/wF,KAAKiiH,KAAKzxG,YAAoBxQ,KAAKiiH,KAAK,KAAOF,GAC/C,MAAM,IAAIvjH,MAAM,cAExB,CAOA,QAAA6H,CAAS0e,EAAW,QAChB,OAAO,GAAmB/kB,KAAKiiH,KAAMl9F,EACzC,CAMA,UAAAm9F,GACI,OAAOliH,KAAKiiH,IAChB,CAMA,IAAKx+E,OAAOqB,eACR,MAAO,OAAO9kC,KAAKqG,aACvB,CAaA,qBAAO87G,CAAeziE,GAClB,OAAO,IAAIsiE,GAAItiE,EAAK73C,KAAKg6G,IAC7B,CAYA,aAAOzkF,GACH,OAAO,IAAI4kF,GAAI/4G,KAAKm0B,SAAS/2B,WAAWoB,UAAU,GACtD,CAIA,YAAO26G,CAAM7zE,GACT,OAAIA,aAAiBt+B,YAA+B,iBAAVs+B,EAE/B,IAAIyzE,GAAIzzE,GAEa,mBAArBA,EAAM2zE,WAEN,IAAIF,GAAIzzE,EAAM2zE,cAElB,IACX,CAMA,KAAAnxB,GAII,GAHiB,MAAb/wF,KAAKiiH,MAAyC,IAAzBjiH,KAAKiiH,KAAKzxG,aAC/BxQ,KAAKiiH,KAAOH,IAEZ9hH,KAAKiiH,KAAK,KAAOF,GAAS,CAC1B,MAAMjzG,EAAQ,IAAImB,WAAWjQ,KAAKiiH,KAAKzxG,WAAa,GACpD1B,EAAMypC,KAAKwpE,GAAS,EAAG,GACvBjzG,EAAMxP,IAAIU,KAAKiiH,KAAM,GACrBjiH,KAAKiiH,KAAOnzG,CAChB,CAEA,KAAO9O,KAAKiiH,KAAKzxG,WAAa,GAAKxQ,KAAKiiH,KAAKjiH,KAAKiiH,KAAKzxG,WAAa,KAAOuxG,IACvE/hH,KAAKiiH,KAAOjiH,KAAKiiH,KAAKhgG,SAAS,GAAI,EAE3C,CAOA,IAAAogG,CAAKtjH,GACD,MAAMujH,EAAQtiH,KAAK0/C,OACb6iE,EAAQxjH,EAAI2gD,OAClB,IAAK,IAAIn+C,EAAI,EAAGA,EAAI+gH,EAAM7gH,OAAQF,IAAK,CACnC,GAAIghH,EAAM9gH,OAASF,EAAI,EACnB,OAAO,EAEX,MAAMyU,EAAKssG,EAAM/gH,GACX0U,EAAKssG,EAAMhhH,GACjB,GAAIyU,EAAKC,EACL,OAAO,EAEN,GAAID,EAAKC,EACV,OAAO,CAEf,CACA,OAAOqsG,EAAM7gH,OAAS8gH,EAAM9gH,MAChC,CAYA,OAAA09C,GACI,OAAO6iE,GAAIG,eAAeniH,KAAK0/C,OAAOx+C,QAAQi+C,UAClD,CAMA,UAAAvzC,GACI,OAAO5L,KAAK0/C,MAChB,CAWA,aAAA8iE,GACI,MAAMz1G,EAAK/M,KAAK4L,aAChB,OAAOmB,EAAGA,EAAGtL,OAAS,EAC1B,CAYA,IAAAi+C,GACI,OAAO1/C,KAAKqG,WAAWqB,MAAMm6G,IAAU3gH,MAAM,EACjD,CAYA,IAAAiE,GACI,OAqJR,SAAuB4H,GACnB,MAAMqQ,EAAQrQ,EAAGrF,MAAM,KACvB,OAAI0V,EAAM3b,OAAS,EACR,GAEJ2b,EAAMlc,MAAM,GAAI,GAAG2G,KAAK,IACnC,CA3Je46G,CAAcziH,KAAKwiH,gBAC9B,CAYA,IAAAzhH,GACI,OAoJR,SAAwBgM,GACpB,MAAMqQ,EAAQrQ,EAAGrF,MAAM,KACvB,OAAO0V,EAAMA,EAAM3b,OAAS,EAChC,CAvJeihH,CAAe1iH,KAAKwiH,gBAC/B,CAaA,QAAAhsE,CAASzzC,GACL,OAAO,IAAIi/G,GAAIhiH,KAAKqG,WAAa,IAAMtD,EAC3C,CAYA,IAAAid,GACI,IAAI0e,EAAI1+B,KAAK0b,SAASrV,WAKtB,OAJKq4B,EAAEpS,SAASu1F,MACZnjF,GAAKmjF,IAETnjF,GAAK1+B,KAAKmF,OACH,IAAI68G,GAAItjF,EACnB,CAYA,MAAAhjB,GACI,MAAMgkC,EAAO1/C,KAAK0/C,OAClB,OAAoB,IAAhBA,EAAKj+C,OACE,IAAIugH,GAAIH,IAEZ,IAAIG,GAAItiE,EAAKx+C,MAAM,GAAI,GAAG2G,KAAKg6G,IAC1C,CAaA,KAAAc,CAAM5jH,GACF,OAAIiB,KAAKqG,aAAew7G,GACb9iH,EAEFA,EAAIsH,aAAew7G,GACjB7hH,KAEJ,IAAIgiH,GAAIhiH,KAAKqG,WAAatH,EAAIsH,YAAY,EACrD,CAaA,YAAAu8G,CAAar0E,GACT,OAAIA,EAAMloC,aAAerG,KAAKqG,YAGvBkoC,EAAMloC,WAAWkmB,WAAWvsB,KAAKqG,WAC5C,CAaA,aAAAw8G,CAAct0E,GACV,OAAIA,EAAMloC,aAAerG,KAAKqG,YAGvBrG,KAAKqG,WAAWkmB,WAAWgiB,EAAMloC,WAC5C,CAMA,UAAAy8G,GACI,OAA8B,IAAvB9iH,KAAK0/C,OAAOj+C,MACvB,CAOA,MAAAL,IAAU8D,GACN,OAAO88G,GAAIG,eAAe,IAAIniH,KAAK4L,iBAiC1BirC,EAjCmD3xC,EAAKZ,KAAIvF,GAAOA,EAAI6M,eAkC7E,GAAKxK,UAAUy1C,MAD1B,IAAiBA,CAhCb,ECvWG,MAAMksE,GAAmB,UACzB,SAASC,GAAqBj8D,GACjC,IAAK2F,GAAS3F,IAA0B,MAAfA,EAAO5hD,KAC5B,MAAM,IAAI,GAAuB,kBAErC,MAAM89G,EAASl8D,EAAO4iB,QAAQtjE,WAC9B,OAAO,IAAI27G,GAAI,GAAGe,KAAmBE,IACzC,CCRO91E,eAAe+1E,GAA6Bn8D,EAAQl6C,EAAQ42F,EAAW0f,GAC1E,MAAMC,EAAa,IAAIv1E,IACvB,IAAK,MAAMihB,KAAQ20C,EAAW,CAC1B,GAAY,MAAR30C,EACA,SAKJ,GAHIA,EAAK00C,qBAAqBvzF,aAC1B6+C,EAAK00C,UAAY,GAAU10C,EAAK00C,aAE/BjwC,GAAYzE,EAAK00C,WAClB,MAAM,IAAI,GAAuB,yBAErC,UAAY32F,EAAOk6C,EAAQ+H,EAAK00C,WAC5B,SAEJ,MAAM0F,EAAcp6C,EAAKo6C,cAAe,EAClCma,EAAQv0D,EAAK00C,UAAUn9F,WACvBi9G,EAAeF,EAAWhkH,IAAIikH,GAChB,MAAhBC,EACAx0D,EAAKo6C,YAAcoa,EAAapa,aAAeA,EAG/Cka,EAAW9jH,IAAI+jH,EAAO,CAClB7f,UAAW10C,EAAK00C,UAChB0F,eAGZ,CACA,MAAO,IAAIka,EAAWngH,UACjBmL,MAAK,CAACuS,EAAGC,IACHD,EAAE6iF,UAAUn9F,WAAW49F,cAAcrjF,EAAE4iF,UAAUn9F,cAEvD/B,KAAI,EAAG4kG,cAAa1F,gBAAgB,CACrC0F,cACA1F,UAAWA,EAAU10F,SAE7B,CCjCOq+B,eAAeo2E,GAASx8D,EAAQpd,EAAM65E,EAAUvpG,GACnD,GAAY,MAAR0vB,EACA,MAAM,IAAI,GAAuB,oBAErC,GAAsB,MAAlBA,EAAK0/B,WAAyC,MAApBtiB,EAAOsiB,YAAsB1/B,EAAK0/B,UAAU/6B,OAAOyY,EAAOsiB,WACpF,MAAM,IAAI,GAAuB,wDAErC,MAAMigC,EAAervF,EAAQqvF,cAAc5hD,KAC3C,GAAoB,MAAhB4hD,IAAyBviD,EAAOzY,OAAOg7D,EAAa54F,IACpD,MAAM,IAAI,GAAuB,0CAErC,IAuFI24D,EAvFAo6B,EAAY6F,GAAc7F,WAAa,GACvC77C,EAAY,IAAIzM,IAAImuD,GAAc1hD,WAAa,IAC/CM,EAAWohD,GAAcphD,UAAY,IAAIra,IACzCiqB,EAAOwxC,GAAcxxC,MAAQ,IAAIjqB,IACjCs7D,EAAqBG,GAAcH,mBAoCvC,GAlCiB,UAAbqa,IACuB,MAAnB75E,EAAKm5D,YAAwC,MAAlBn5D,EAAK85D,YAChCA,EAAY,GACW,MAAnB95D,EAAKm5D,YACLW,EAAUjjG,QAAQmpC,EAAKm5D,WAAWx+F,KAAIk/F,IAAa,CAC/C0F,aAAa,EACb1F,iBAGc,MAAlB75D,EAAK85D,WACLA,EAAUjjG,QAAQmpC,EAAK85D,YAGT,MAAlB95D,EAAKie,YACLA,EAAY,IAAIzM,IAAIxR,EAAKie,YAER,MAAjBje,EAAKue,WAELA,EAAWu7D,GADa95E,EAAKue,oBAAoBra,IAAM,IAAIlE,EAAKue,SAAS4H,WAAanxD,OAAOmxD,QAAQnmB,EAAKue,UAC9D,CACxC08C,SAAU8e,MAGD,MAAb/5E,EAAKmuB,OAELA,EAAO2rD,GADa95E,EAAKmuB,gBAAgBjqB,IAAM,IAAIlE,EAAKmuB,KAAKhI,WAAanxD,OAAOmxD,QAAQnmB,EAAKmuB,MAC1D,CAChC8sC,SAAU+e,GACVr/G,IAAKs/G,MAGkB,MAA3Bj6E,EAAKw/D,qBACLA,EAAqBx/D,EAAKw/D,qBAIjB,UAAbqa,EAAsB,CAatB,GAZuB,MAAnB75E,EAAKm5D,YACLW,EAAUjjG,QAAQmpC,EAAKm5D,WAAWx+F,KAAIk/F,IAAa,CAC/C0F,aAAa,EACb1F,iBAGc,MAAlB75D,EAAK85D,WACLA,EAAUjjG,QAAQmpC,EAAK85D,WAEL,MAAlB95D,EAAKie,YACLA,EAAY,IAAIzM,IAAI,IAAIyM,KAAcje,EAAKie,aAE1B,MAAjBje,EAAKue,SAAkB,CACvB,MAAM27D,EAAkBl6E,EAAKue,oBAAoBra,IAAM,IAAIlE,EAAKue,SAAS4H,WAAanxD,OAAOmxD,QAAQnmB,EAAKue,UAC1G,IAAK,MAAOnpD,EAAKC,KAAU6kH,EACV,MAAT7kH,EACAkpD,EAAShB,OAAOnoD,GAGhBmpD,EAAS5oD,IAAIP,EAAKC,GAG1BkpD,EAAWu7D,GAAgB,IAAIv7D,EAAS4H,WAAY,CAChD80C,SAAU8e,IAElB,CACA,GAAiB,MAAb/5E,EAAKmuB,KAAc,CACnB,MAAMgsD,EAAcn6E,EAAKmuB,gBAAgBjqB,IAAM,IAAIlE,EAAKmuB,KAAKhI,WAAanxD,OAAOmxD,QAAQnmB,EAAKmuB,MACxFisD,EAAa,IAAIl2E,IAAIiqB,GAC3B,IAAK,MAAO/4D,EAAKC,KAAU8kH,EACV,MAAT9kH,EACA+kH,EAAW78D,OAAOnoD,GAGlBglH,EAAWzkH,IAAIP,EAAKC,GAG5B84D,EAAO2rD,GAAgB,IAAIM,EAAWj0D,WAAY,CAC9C80C,SAAU+e,GACVr/G,IAAKs/G,IAEb,CAC+B,MAA3Bj6E,EAAKw/D,qBACLA,EAAqBx/D,EAAKw/D,mBAElC,CAEkC,MAA9BG,GAAc54F,GAAG24D,UACjBA,EAAYK,GAAoB4/B,EAAa54F,GAAG24D,WAEzB,MAAlB1/B,EAAK0/B,UACVA,EAAYK,GAAoB//B,EAAK0/B,WAEZ,MAApBtiB,EAAOsiB,YACZA,EAAYK,GAAoB3iB,EAAOsiB,YAE3C,MAAM7qB,EAAS,CACXilD,gBAAiByf,GAA6Bn8D,EAAQ9sC,EAAQ+pG,eAAiB,WAAa,GAAOvgB,EAAWxpF,EAAQqvF,cAAc2a,OAAOxgB,WAC3I77C,UAAW,IAAIA,EAAU3kD,UAAUmL,MAAK,CAACuS,EAAGC,IACjCD,EAAEsjF,cAAcrjF,KAE3BsnC,WACA4P,OACAuR,YACA8/B,sBAUJ,OAPA3qD,EAAOilD,UAAUt2F,SAAQ2hD,IACrBA,EAAKiyD,SAAW9mG,EAAQqvF,cAAc2a,OAAOxgB,WAAWnqE,MAAKw1B,GAAQ,GAAiBA,EAAK00C,UAAW10C,EAAK00C,cAAaud,UAAYv2G,KAAKm2D,KAAK,IAG9H,QAAhB5Z,EAAO5hD,aACAq5C,EAAO6qB,UAEX7qB,CACX,CAKA,SAASilE,GAAgB3zD,EAAS71C,GAC9B,MAAMukC,EAAS,IAAI3Q,IACnB,IAAK,MAAO9uC,EAAKC,KAAU8wD,EACV,MAAT9wD,GAGJib,EAAQ2qF,SAAS7lG,EAAKC,GAE1B,IAAK,MAAOD,EAAKC,KAAU8wD,EAAQ1hD,MAAK,EAAEuS,IAAKC,KACpCD,EAAEsjF,cAAcrjF,KAEV,MAAT5hB,GACAw/C,EAAOl/C,IAAIP,EAAKkb,EAAQ3V,MAAMvF,EAAKC,IAAUA,GAGrD,OAAOw/C,CACX,CACA,SAASklE,GAAiB3kH,EAAKC,GAC3B,GAAmB,iBAARD,EACP,MAAM,IAAI,GAAuB,iCAErC,KAAMC,aAAiBiR,YACnB,MAAM,IAAI,GAAuB,sCAEzC,CACA,SAAS0zG,GAAY5kH,EAAK8zC,GACtB,GAAmB,iBAAR9zC,EACP,MAAM,IAAI,GAAuB,6BAErC,GAAiB,MAAb8zC,EAAI7zC,MAAe,CACnB,GAAIwf,SAAS,GAAGq0B,EAAI7zC,QAAS,MAAQ6zC,EAAI7zC,MACrC,MAAM,IAAI,GAAuB,gCAErC,GAAI6zC,EAAI7zC,MAAQ,GAAK6zC,EAAI7zC,MAAQ,IAC7B,MAAM,IAAI,GAAuB,kCAEzC,CACA,GAAe,MAAX6zC,EAAIowD,IAAa,CACjB,GAAIzkF,SAAS,GAAGq0B,EAAIowD,MAAO,MAAQpwD,EAAIowD,IACnC,MAAM,IAAI,GAAuB,8BAErC,GAAIpwD,EAAIowD,IAAM,EACV,MAAM,IAAI,GAAuB,yCAEzC,CACJ,CACA,SAAS2gB,GAAO7kH,EAAK8zC,GACjB,IAAIiuE,EAOJ,OANkB,MAAdjuE,EAAIiuE,SACJA,EAASjuE,EAAIiuE,QAEF,MAAXjuE,EAAIowD,MACJ6d,EAAS76E,OAAOz7B,KAAKm2D,MAAQp2D,OAAOsoC,EAAIowD,OAErC,CACHjkG,MAAO6zC,EAAI7zC,OAAS,EACpB8hH,SAER,CCxLA,SAASoD,GAAYnlH,GAEjB,MAAMm2B,EAAYn2B,EAAIsH,WAAWqB,MAAM,KAAK,GAE5C,OAAO6nF,GADKzhD,GAAIxoB,MAAM4P,EAAWmB,IAErC,CACA,SAAS8tF,GAAWplH,EAAKC,EAAO4hH,GAE5B,OAAOD,GADQuD,GAAYnlH,GACAC,EAAO4hH,EACtC,CAYO,MAAMwD,GACTr9D,OACAs9D,UACAC,KACAN,cACA54G,IACAw1G,cACA2D,WACA,WAAAj1G,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,qBAC1CngG,KAAK+mD,OAASqB,EAAWrB,OACzB/mD,KAAKqkH,UAAYj8D,EAAWi8D,UAC5BrkH,KAAKgkH,cAAgBn4G,EAAKm4G,cAC1BhkH,KAAKskH,KR4IE,SAAuBrqG,GAClC,MAAM6iB,EAAOn+B,OAAO01B,OAAO,CAAC,EAAG,GAAgBpa,GAwB/C,OAvBsB,MAAlBomG,KACAA,GFzGR,CAAgBpmG,IAGZ,GAFAA,EAAUtb,OAAO01B,OAAO,CAAC,EAAG6rF,GAAgBjmG,GAC1BnN,QAAQ8qB,WAAWkD,WAAa7gB,EAAQkmG,cAC3C,CACX,MAAMjgH,EAAU,IAAImsD,YAGpB,OAFA,GAASjI,iBAAiB,UAAWi7D,GAAwBn/G,EAAS,kBAAmB6+G,GAA0BC,GAA0BC,KAC7I,GAAS76D,iBAAiB,UAAWi7D,GAAwBn/G,EAAS,mBAAoBg/G,GAA2BC,GAA2BC,KACzIl/G,CACX,CACA,MAAO,CACHskH,UAAU,EACVC,SAAW1jH,GAASi/G,GAAsBj/G,EAAMg+G,GAA0BE,GAAwBD,IAClG0F,UAAY3jH,GAASi/G,GAAsBj/G,EAAMm+G,GAA2BE,GAAyBD,IAE5G,EE2FwB,CAAKriF,IACU,IAA5BujF,GAAemE,WAEfnE,GAAej8D,iBAAiB,mBAAoBjkD,IAChB,MAA5BigH,GAAQjgH,EAAMwpC,KAAK5oC,OAGlBq/G,GAAQjgH,EAAMwpC,KAAK5oC,MAAM0jH,WACzBlhF,MAAK4J,MAAOw3E,GAAYxkH,EAAMwpC,KAAKi2E,UAAU5yB,SAAQ,KAAQ23B,GAAS,KAAK,IAEpFtE,GAAej8D,iBAAiB,oBAAoBjX,MAAOhtC,IACvB,MAA5BigH,GAAQjgH,EAAMwpC,KAAK5oC,OAGlBq/G,GAAQjgH,EAAMwpC,KAAK5oC,MAAM2jH,YACzBnhF,MAAK4J,MAAOw3E,GAAYxkH,EAAMwpC,KAAKi2E,UAAU5yB,SAAQ,KAAQ23B,GAAS,KAAK,MAIlE,MAAtBvE,GAAQtjF,EAAK/7B,QACbq/G,GAAQtjF,EAAK/7B,MA7ED,EAACA,EAAMkZ,KACvB,IAAgC,IAA5BomG,GAAemE,SACf,MAAO,CACHC,SAAUpE,GAAeoE,SAAS1jH,EAAMkZ,GACxCyqG,UAAWrE,GAAeqE,UAAU3jH,EAAMkZ,IAGlD,MAAM2qG,EAAc,IAAI9L,GAAO,CAAEG,YAAa,IAC9C,IAAI4L,EACJ,MAAO,CACH,cAAMJ,GAEF,GAAiB,MAAbI,EACA,OAAOvE,GAAkBuE,EAAW5qG,GAGxC4qG,EAAY,IAAI/L,GAAO,CACnBG,YAAah/F,EAAQg/F,YACrBC,WAAW,IAEf,MAAM4L,EAAiBD,EAEjBE,EAAczE,GAAkBuE,EAAW5qG,GAejD,OAdK2qG,EAAY5nG,KAAImwB,UAGjB23E,EAAe99G,cAIT89G,EAAehL,SAChBv2E,MAAK,KACFshF,IAAcC,IACdD,EAAY,KAChB,GACF,IAECE,CACX,EACA53E,UAAe,UAIX03E,EAAY,KACLvE,GAAkBsE,EAAa3qG,IAE7C,EA+BwB+qG,CAAYloF,EAAK/7B,KAAM+7B,IAEzCsjF,GAAQtjF,EAAK/7B,KACxB,CQtKoB,CAAQ,CAChBA,KAAM,aACNo/G,eAAe,IAEnBngH,KAAK4gH,cAAgB/0G,EAAK+0G,eCjDH,KDkDvB5gH,KAAKukH,WAAa14G,EAAK04G,YCjDH,KDkDxB,CACA,SAAMtlH,CAAI8nD,GACN,IAEI,aADM/mD,KAAKwN,KAAKu5C,IACT,CACX,CACA,MAAOtgC,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,OAAO,CACX,CACA,YAAM,CAAOsgC,GACL/mD,KAAK+mD,OAAOzY,OAAOyY,UAGjB/mD,KAAKqkH,UAAUn9D,OAAO87D,GAAqBj8D,GACrD,CACA,UAAMv5C,CAAKu5C,GACP,MAAMhoD,EAAMikH,GAAqBj8D,GAC3Bv3C,QAAYxP,KAAKqkH,UAAUjlH,IAAIL,GAC/B2oD,EAAO64D,GAAOvkG,OAAOxM,GAC3B,GAAIxP,MAAK,EAAe+mD,EAAQW,GAE5B,YADM1nD,KAAKqkH,UAAUn9D,OAAOnoD,GACtB,IAAIqoE,GAEd,OAAOy5C,GAAS95D,EAAQW,EAAM1nD,KAAK+mD,OAAOzY,OAAOyY,GAAUnhC,IAAW5lB,KAAK4gH,cAC/E,CACA,UAAMh0G,CAAKm6C,EAAQpd,GACf,MAAM2/D,QAAqBtpG,MAAK,EAAkB+mD,GAC5Ck+D,QAAe1B,GAASx8D,EAAQpd,EAAM,QAAS,CACjDq6E,cAAehkH,KAAKgkH,gBAExB,OAAOhkH,MAAK,EAAiB+mD,EAAQk+D,EAAQ3b,EACjD,CACA,WAAMG,CAAM1iD,EAAQpd,GAChB,MAAM2/D,QAAqBtpG,MAAK,EAAkB+mD,GAC5Ck+D,QAAe1B,GAASx8D,EAAQpd,EAAM,QAAS,CACjDq6E,cAAehkH,KAAKgkH,cACpB1a,iBAEJ,OAAOtpG,MAAK,EAAiB+mD,EAAQk+D,EAAQ3b,EACjD,CACA,WAAMjmF,CAAM0jC,EAAQpd,GAChB,MAAM2/D,QAAqBtpG,MAAK,EAAkB+mD,GAC5Ck+D,QAAe1B,GAASx8D,EAAQpd,EAAM,QAAS,CACjDq6E,cAAehkH,KAAKgkH,cACpB1a,iBAEJ,OAAOtpG,MAAK,EAAiB+mD,EAAQk+D,EAAQ3b,EACjD,CACA,SAAOlkD,CAAI5P,GACP,UAAW,MAAM,IAAEz2C,EAAG,MAAEC,KAAWgB,KAAKqkH,UAAU7uE,MAnF1D,SAAkBA,EAAOorE,GACrB,MAAO,CACHlhH,OAAQqjH,GACRmC,SAAU1vE,EAAM0vE,SAAW,IAAI5gH,KAAIzE,GAAM,EAAGd,MAAKC,WACtCa,EAAGskH,GAAWplH,EAAKC,EAAO4hH,MAErCuE,QAAS3vE,EAAM2vE,QAAU,IAAI7gH,KAAIzE,GAAM,CAAC8gB,EAAGC,IAChC/gB,EAAGskH,GAAWxjG,EAAE5hB,IAAK4hB,EAAE3hB,MAAO4hH,GAAgBuD,GAAWvjG,EAAE7hB,IAAK6hB,EAAE5hB,MAAO4hH,MAG5F,CAyEgEwE,CAAS5vE,GAAS,CAAC,EAAGx1C,KAAK4gH,gBAAiB,CAChG,MAAM75D,EAASm9D,GAAYnlH,GAE3B,GAAIgoD,EAAOzY,OAAOtuC,KAAK+mD,QACnB,SAEJ,MAAMW,EAAO64D,GAAOvkG,OAAOhd,GAEvBgB,MAAK,EAAe+mD,EAAQW,SACtB1nD,KAAKqkH,UAAUn9D,OAAOnoD,SAG1B8hH,GAAS95D,EAAQW,EAAM1nD,KAAK+mD,OAAOzY,OAAOyY,GAAUnhC,IAAW5lB,KAAK4gH,cAC9E,CACJ,CACA,OAAM,CAAkB75D,GACpB,IACI,MAAMhoD,EAAMikH,GAAqBj8D,GAC3Bv3C,QAAYxP,KAAKqkH,UAAUjlH,IAAIL,GAC/BklH,EAAS1D,GAAOvkG,OAAOxM,GAE7B,GAAIxP,MAAK,EAAe+mD,EAAQk9D,GAE5B,YADMjkH,KAAKqkH,UAAUn9D,OAAOnoD,GACtB,IAAIqoE,GAEd,MAAO,CACH68C,SACAv8D,KAAMi5D,GAAY55D,EAAQv3C,EAAKxP,KAAK4gH,eAE5C,CACA,MAAOn6F,GACc,kBAAbA,EAAI1lB,MACJf,KAAKoL,IAAIoc,MAAM,6CAA8Cf,EAErE,CACJ,CACA,OAAM,CAAiBsgC,EAAQW,EAAM4hD,GAEjC5hD,EAAKi6D,QAAUn3G,KAAKm2D,MACpB,MAAMnxD,EAAM+wG,GAAOrrG,OAAOwyC,GAE1B,aADM1nD,KAAKqkH,UAAUgB,IAAIrC,GAAqBj8D,GAASv3C,GAChD,CACHk4C,KAAMi5D,GAAY55D,EAAQv3C,EAAKxP,KAAK4gH,eACpC0E,SAAUhc,GAAc5hD,KACxBi6D,QAAyB,MAAhBrY,ILnJMic,EKmJ8B79D,ELnJvB89D,EKmJ6Blc,EAAa2a,SL1IjE9C,GAReoE,EAAM9hB,UAAW+hB,EAAM/hB,WAQA,CAAC9iF,EAAGC,IACzCD,EAAEuoF,cAAgBtoF,EAAEsoF,eAGnB,GAAiBvoF,EAAE6iF,UAAW5iF,EAAE4iF,cAOlC2d,GAlBYoE,EAAM39D,UAAW49D,EAAM59D,WAkBG,CAACjnC,EAAGC,IAAMD,IAAMC,KAGtDogG,GApBYuE,EAAMl8C,UAAWm8C,EAAMn8C,YAuBnC23C,GAtBgBuE,EAAMpc,mBAAoBqc,EAAMrc,qBAyBhDkY,GAxBWkE,EAAMr9D,SAAUs9D,EAAMt9D,UAwBC,CAACvnC,EAAGC,IAAM,GAAiBD,EAAGC,OAExD6kG,EAzBDF,EAAMztD,KAyBM4tD,EAzBAF,EAAM1tD,KA0BzBupD,GAAYoE,EAAWC,GAAW,CAAC/kG,EAAGC,IAAMD,EAAE3hB,QAAU4hB,EAAE5hB,OAAS2hB,EAAEmgG,SAAWlgG,EAAEkgG,aAD7F,IAAmB2E,EAAWC,EA/BHH,EAAOC,CKqJ9B,CACA,GAAez+D,EAAQW,GACnB,GAAoB,MAAhBA,EAAKi6D,QACL,OAAO,EAEX,GAAI3hH,KAAK+mD,OAAOzY,OAAOyY,GACnB,OAAO,EAEX,MAAM4+D,EAAUj+D,EAAKi6D,QAAWn3G,KAAKm2D,MAAQ3gE,KAAKukH,WAC5CqB,EAAqBp7G,KAAKm2D,MAAQ3gE,KAAK4gH,cACvCiF,EAAQn+D,EAAK+7C,UAAU52F,QAAOiiD,GACR,MAAjBA,EAAKiyD,UAAoBjyD,EAAKiyD,SAAW6E,IAEpD,OAAOD,GAA4B,IAAjBE,EAAMpkH,MAC5B,EExJJ,MAAMqkH,GACF/gD,MACAjkE,OACAimD,OACA37C,IACA,WAAAkE,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,qBAC1CngG,KAAKc,OAASsnD,EAAWtnD,OACzBd,KAAK+mD,OAASqB,EAAWrB,OACzB/mD,KAAK+kE,MAAQ,IAAIq/C,GAAgBh8D,EAAYv8C,EACjD,CACA,CAAC43B,OAAOqB,aAAe,qBACvB,aAAM33B,CAAQtN,EAAI21C,GACdx1C,KAAKoL,IAAI60F,MAAM,2BACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKG,WACtCzkH,KAAKoL,IAAI60F,MAAM,yBACf,IACI,UAAW,MAAMv4C,KAAQ1nD,KAAK+kE,MAAM3f,IAAI5P,GACpC31C,EAAG6nD,EAEX,CACA,QACI1nD,KAAKoL,IAAI60F,MAAM,6BACf0kB,GACJ,CACJ,CACA,SAAMv/D,CAAI5P,GACNx1C,KAAKoL,IAAI60F,MAAM,uBACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKG,WACtCzkH,KAAKoL,IAAI60F,MAAM,qBACf,IACI,aAAa,GAAIjgG,KAAK+kE,MAAM3f,IAAI5P,GACpC,CACA,QACIx1C,KAAKoL,IAAI60F,MAAM,yBACf0kB,GACJ,CACJ,CACA,YAAM,CAAO59D,GACT/mD,KAAKoL,IAAI60F,MAAM,2BACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKI,YACtC1kH,KAAKoL,IAAI60F,MAAM,yBACf,UACUjgG,KAAK+kE,MAAM7d,OAAOH,EAC5B,CACA,QACI/mD,KAAKoL,IAAI60F,MAAM,6BACf0kB,GACJ,CACJ,CACA,SAAM1lH,CAAI8nD,GACN/mD,KAAKoL,IAAI60F,MAAM,uBACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKG,WACtCzkH,KAAKoL,IAAI60F,MAAM,qBACf,IACI,aAAajgG,KAAK+kE,MAAM9lE,IAAI8nD,EAChC,CACA,QACI/mD,KAAKoL,IAAI60F,MAAM,yBACf0kB,GACJ,CACJ,CACA,SAAMvlH,CAAI2nD,GACN/mD,KAAKoL,IAAI60F,MAAM,uBACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKG,WACtCzkH,KAAKoL,IAAI60F,MAAM,qBACf,IACI,aAAajgG,KAAK+kE,MAAMv3D,KAAKu5C,EACjC,CACA,QACI/mD,KAAKoL,IAAI60F,MAAM,yBACf0kB,GACJ,CACJ,CACA,UAAM/3G,CAAK8D,EAAIi5B,GACX3pC,KAAKoL,IAAI60F,MAAM,yBACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKI,YACtC1kH,KAAKoL,IAAI60F,MAAM,uBACf,IACI,MAAMnrF,QAAe9U,KAAK+kE,MAAMn4D,KAAK8D,EAAIi5B,GAEzC,OADA3pC,MAAK,EAAe0Q,EAAIoE,GACjBA,EAAO4yC,IAClB,CACA,QACI1nD,KAAKoL,IAAI60F,MAAM,2BACf0kB,GACJ,CACJ,CACA,WAAMlb,CAAM/4F,EAAIi5B,GACZ3pC,KAAKoL,IAAI60F,MAAM,0BACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKI,YACtC1kH,KAAKoL,IAAI60F,MAAM,wBACf,IACI,MAAMnrF,QAAe9U,KAAK+kE,MAAM0kC,MAAM/4F,EAAIi5B,GAE1C,OADA3pC,MAAK,EAAe0Q,EAAIoE,GACjBA,EAAO4yC,IAClB,CACA,QACI1nD,KAAKoL,IAAI60F,MAAM,4BACf0kB,GACJ,CACJ,CACA,WAAMthG,CAAM3S,EAAIi5B,GACZ3pC,KAAKoL,IAAI60F,MAAM,0BACf,MAAM0kB,QAAgB3kH,KAAK+kE,MAAMu/C,KAAKI,YACtC1kH,KAAKoL,IAAI60F,MAAM,wBACf,IACI,MAAMnrF,QAAe9U,KAAK+kE,MAAM1hD,MAAM3S,EAAIi5B,GAE1C,OADA3pC,MAAK,EAAe0Q,EAAIoE,GACjBA,EAAO4yC,IAClB,CACA,QACI1nD,KAAKoL,IAAI60F,MAAM,4BACf0kB,GACJ,CACJ,CACA,uBAAMoB,CAAkBv2G,EAAKw2G,GACzB,MAAMthB,QAAiBL,GAAe+E,eAAe55F,EAAK8zF,GAAWO,QAC/D98C,EAASwoC,GAAcmV,EAASr7B,UAAUM,SAChD,IAAqC,IAAjCq8C,GAAc13E,OAAOyY,GAErB,OADA/mD,KAAKoL,IAAI,4EAA6E46G,EAAcj/D,IAC7F,EAEX,MAAM48C,EAAaL,GAAWqB,mBAAmBD,EAAS5xD,SAC1D,IAAI4U,EACJ,IACIA,QAAa1nD,KAAKZ,IAAI2nD,EAC1B,CACA,MAAOtgC,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CAEA,GAAgC,MAA5BihC,GAAMyhD,mBAA4B,CAClC,MAAMI,QAAuBlF,GAAeM,mBAAmBj9C,EAAKyhD,oBAC9DK,EAAelG,GAAWqB,mBAAmB4E,EAAez2D,SAClE,GAAI02D,EAAa5F,WAAaD,EAAWC,UAErC,OADA5jG,KAAKoL,IAAI,2FAA4Fo+F,EAAa5F,UAAWD,EAAWC,YACjI,CAEf,CAQA,aAPM5jG,KAAKypG,MAAM9F,EAAW58C,OAAQ,CAChCoiD,mBAAoB35F,EACpBi0F,UAAWE,EAAWb,WAAWx+F,KAAIk/F,IAAa,CAC9C0F,aAAa,EACb1F,mBAGD,CACX,CACA,GAAe9yF,EAAIoE,GACVA,EAAO6sG,UAGR3hH,KAAK+mD,OAAOzY,OAAO59B,GACnB1Q,KAAKc,OAAOyrD,kBAAkB,mBAAoB,CAAE5E,OAAQ7yC,IAG5D9U,KAAKc,OAAOyrD,kBAAkB,cAAe,CAAE5E,OAAQ7yC,IAE/D,EC7KiCtW,MASCA,MASFA,MASAA,MASGA,MASHA,MAS7B,MAAM,WAAsBA,MAC/By0D,YAAc,gBACdA,YAAc,gBACdlyD,KAAO,GAAcA,KACrBgU,KAAO,GAAcA,KACrB,WAAAzF,CAAY9C,EAAU,aAClB4jC,MAAM5jC,EACV,EAE4BhO,MCtBhC,SAVA,SAAe2H,GACX,GAHsC,MAGlBA,EAHPs9B,OAAOC,eAIhB,MAAO,WACH,UAAW,MAAM/K,KAAKxyB,GACzB,EAFM,GAKP,IAAK,MAAMwyB,KAAKxyB,GAExB,EC6CA,GA3CA,SAAgBA,EAAQtG,GACpB,IAAIgL,EAAQ,EACZ,GAJsC,MAIlB1E,EAJPs9B,OAAOC,eAKhB,OAAO,kBACH,UAAW,MAAM4a,KAASn4C,QACZtG,EAAGy+C,EAAOzzC,aACVyzC,EAGjB,CANM,GASX,MAAM2nE,ECRV,SAAkBC,GAEd,MAAOnnE,EAAU7mB,GAA4C,MAAlCguF,EAASziF,OAAOC,eAErC,CAACwiF,EAASziF,OAAOC,iBAAkBD,OAAOC,eAE1C,CAACwiF,EAASziF,OAAOsb,YAAatb,OAAOsb,UACrChb,EAAQ,GAEd,MAAO,CACH36B,KAAM,IACK21C,EAAS12C,OAEpB7H,KAAOxB,IACH+kC,EAAMvjC,KAAKxB,EAAM,EAErBqJ,KAAM,IACE07B,EAAMtiC,OAAS,EACR,CACHuhC,MAAM,EACNhkC,MAAO+kC,EAAMz7B,SAGdy2C,EAAS12C,OAEpB,CAAC6vB,KACG,OAAOl4B,IACX,EAER,CDrBqB,CAAKmG,IAChB,MAAEnH,EAAK,KAAEgkC,GAASijF,EAAS59G,OACjC,IAAa,IAAT26B,EACA,OAAQ,YAAe,CAAhB,GAEX,MAAM4C,EAAM/lC,EAAGb,EAAO6L,KAEtB,GAAwB,mBAAb+6B,EAAIrC,KACX,OAAO,wBACOqC,UACA5mC,GAEV,UAAW,MAAMs/C,KAAS2nE,QACZpmH,EAAGy+C,EAAOzzC,aACVyzC,EAGjB,CATM,GAWX,MAAMunD,EAAOhmG,EACb,OAAO,aACS,IAAR+lC,UACM5mC,GAEV,IAAK,MAAMs/C,KAAS2nE,EACZpgB,EAAKvnD,EAAOzzC,aACNyzC,EAGjB,CATM,EAUX,EE1BA,GAZA,SAAcn4C,EAAQggH,GAClB,OAHsC,MAGlBhgH,EAHPs9B,OAAOC,eAIT,kBACH,MAAMmT,QAAY,GAAI1wC,SACf0wC,EAAIzoC,KAAK+3G,EACnB,CAHM,GAKJ,YACH,MAAMtvE,EAAM,GAAI1wC,SACT0wC,EAAIzoC,KAAK+3G,EACnB,CAHM,EAIX,ECUA,GA9BA,SAAchgH,EAAQmoD,GAClB,OAHsC,MAGlBnoD,EAHPs9B,OAAOC,eAIT,kBACH,IAAI0iF,EAAQ,EACZ,KAAI93D,EAAQ,GAGZ,UAAW,MAAMhQ,KAASn4C,EAGtB,SAFMm4C,EACN8nE,IACIA,IAAU93D,EACV,MAGX,CAZM,GAcJ,YACH,IAAI83D,EAAQ,EACZ,KAAI93D,EAAQ,GAGZ,IAAK,MAAMhQ,KAASn4C,EAGhB,SAFMm4C,EACN8nE,IACIA,IAAU93D,EACV,MAGX,CAZM,EAaX,EC9DO,MAAM+3D,GACT,GAAAhB,CAAItmH,EAAKkM,EAAKgP,GACV,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,2BACpC,CACA,GAAAY,CAAIL,EAAKkb,GACL,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,2BACpC,CACA,GAAAS,CAAIF,EAAKkb,GACL,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,2BACpC,CACA,OAAOO,EAAKkb,GACR,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,8BACpC,CACA,aAAO8nH,CAAQngH,EAAQ8T,EAAU,CAAC,GAC9B,UAAW,MAAM,IAAElb,EAAG,MAAEC,KAAWmH,QACzBnG,KAAKqlH,IAAItmH,EAAKC,EAAOib,SACrBlb,CAEd,CACA,aAAOwnH,CAAQpgH,EAAQ8T,EAAU,CAAC,GAC9B,UAAW,MAAMlb,KAAOoH,OACd,CACFpH,MACAC,YAAagB,KAAKZ,IAAIL,EAAKkb,GAGvC,CACA,gBAAOusG,CAAWrgH,EAAQ8T,EAAU,CAAC,GACjC,UAAW,MAAMlb,KAAOoH,QACdnG,KAAKknD,OAAOnoD,EAAKkb,SACjBlb,CAEd,CACA,KAAA0nH,GACI,IAAIC,EAAO,GACPC,EAAO,GACX,MAAO,CACH,GAAAtB,CAAItmH,EAAKC,GACL0nH,EAAKlmH,KAAK,CAAEzB,MAAKC,SACrB,EACA,OAAOD,GACH4nH,EAAKnmH,KAAKzB,EACd,EACA6nH,OAAQz5E,MAAOlzB,UACL,GAAMja,KAAKsmH,QAAQI,EAAMzsG,IAC/BysG,EAAO,SACD,GAAM1mH,KAAKwmH,WAAWG,EAAM1sG,IAClC0sG,EAAO,EAAE,EAGrB,CAKA,UAAOE,CAAKrkF,EAAGvoB,GACX,MAAM,IAAIzb,MAAM,2BACpB,CAKA,cAAOsoH,CAAStkF,EAAGvoB,GACf,MAAM,IAAIzb,MAAM,+BACpB,CACA,KAAAg3C,CAAMhT,EAAGvoB,GACL,IAAIu+F,EAAKx4G,KAAK6mH,KAAKrkF,EAAGvoB,GACtB,GAAgB,MAAZuoB,EAAE9iC,OAAgB,CAClB,MAAMA,EAAS8iC,EAAE9iC,OACjB84G,EAAK,GAAOA,GAAKv0F,GAAMA,EAAEllB,IAAIsH,WAAWkmB,WAAW7sB,IACvD,CAOA,GANIiC,MAAM2Q,QAAQkwB,EAAE0iF,WAChB1M,EAAKh2E,EAAE0iF,QAAQ56E,QAAO,CAACkuE,EAAIvjG,IAAM,GAAOujG,EAAIvjG,IAAIujG,IAEhD72G,MAAM2Q,QAAQkwB,EAAE2iF,UAChB3M,EAAKh2E,EAAE2iF,OAAO76E,QAAO,CAACkuE,EAAIvjG,IAAM,GAAKujG,EAAIvjG,IAAIujG,IAEjC,MAAZh2E,EAAEt/B,OAAgB,CAClB,IAAI3B,EAAI,EACR,MAAM2B,EAASs/B,EAAEt/B,OACjBs1G,EAAK,GAAOA,GAAI,IAAMj3G,KAAO2B,GACjC,CAIA,OAHe,MAAXs/B,EAAE8rB,QACFkqD,EAAK,GAAKA,EAAIh2E,EAAE8rB,QAEbkqD,CACX,CACA,SAAAuO,CAAUvkF,EAAGvoB,GACT,IAAIu+F,EAAKx4G,KAAK8mH,SAAStkF,EAAGvoB,GAC1B,GAAgB,MAAZuoB,EAAE9iC,OAAgB,CAClB,MAAMA,EAAS8iC,EAAE9iC,OACjB84G,EAAK,GAAOA,GAAKz5G,GAAQA,EAAIsH,WAAWkmB,WAAW7sB,IACvD,CAOA,GANIiC,MAAM2Q,QAAQkwB,EAAE0iF,WAChB1M,EAAKh2E,EAAE0iF,QAAQ56E,QAAO,CAACkuE,EAAIvjG,IAAM,GAAOujG,EAAIvjG,IAAIujG,IAEhD72G,MAAM2Q,QAAQkwB,EAAE2iF,UAChB3M,EAAKh2E,EAAE2iF,OAAO76E,QAAO,CAACkuE,EAAIvjG,IAAM,GAAKujG,EAAIvjG,IAAIujG,IAEjC,MAAZh2E,EAAEt/B,OAAgB,CAClB,MAAMA,EAASs/B,EAAEt/B,OACjB,IAAI3B,EAAI,EACRi3G,EAAK,GAAOA,GAAI,IAAMj3G,KAAO2B,GACjC,CAIA,OAHe,MAAXs/B,EAAE8rB,QACFkqD,EAAK,GAAKA,EAAIh2E,EAAE8rB,QAEbkqD,CACX,EC7GG,MAAMwO,WAAwBX,GACjC18E,KACA,WAAAr6B,GACI8gC,QACApwC,KAAK2pC,KAAO,IAAIkE,GACpB,CACA,GAAAw3E,CAAItmH,EAAKkM,GAEL,OADAjL,KAAK2pC,KAAKrqC,IAAIP,EAAIsH,WAAY4E,GACvBlM,CACX,CACA,GAAAK,CAAIL,GACA,MAAM+V,EAAS9U,KAAK2pC,KAAKvqC,IAAIL,EAAIsH,YACjC,GAAc,MAAVyO,EACA,MAAM,IAAI,GAEd,OAAOA,CACX,CACA,GAAA7V,CAAIF,GACA,OAAOiB,KAAK2pC,KAAK1qC,IAAIF,EAAIsH,WAC7B,CACA,OAAOtH,GACHiB,KAAK2pC,KAAKud,OAAOnoD,EAAIsH,WACzB,CACA,KAACwgH,GACG,IAAK,MAAO9nH,EAAKC,KAAUgB,KAAK2pC,KAAKmmB,eAC3B,CAAE/wD,IAAK,IAAIijH,GAAIjjH,GAAMC,QAEnC,CACA,SAAC8nH,GACG,IAAK,MAAM/nH,KAAOiB,KAAK2pC,KAAKzkC,aAClB,IAAI88G,GAAIjjH,EAEtB,EChCJ,MAAMkoH,GAAwBpB,GAAUA,EAIxC,SAASqB,GAAYntD,EAAIhT,GACrB,MAAMogE,EAAoBptD,EAAGrF,YAS7B,OAPyB,MAArByyD,GACuB73B,GAAiB63B,GAErB74E,OAAOyY,KACtBgT,EAAKA,EAAGxF,YAAY,GAAU,QAAQxN,EAAO1gD,gBAG9C0zD,CACX,CACO,MAAMqtD,GACTh8G,IACAg9C,WAEAtkB,OACAm5E,SACA8D,SACA5D,eAOA,WAAA7tG,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B,MAAM,OAAEi4B,EAAS,GAAE,SAAEm5E,EAAW,IAAOpxG,EACvC7L,KAAKooD,WAAaA,EAClBpoD,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,0BAC1CngG,KAAK8jC,OAASA,EAAOx/B,KAAIy1D,GAAMA,EAAG1zD,aAClCrG,KAAKi9G,SAAW,IAAI9hE,IAAI8hE,EAAS34G,KAAIy1D,GAAMA,EAAG1zD,cAC9CrG,KAAK+gH,SAAW,IAAIlzE,IACpB7tC,KAAKm9G,eAAiBtxG,EAAKsxG,gBAAkB8J,GAG7CjnH,KAAKqnH,0BC3CN,SAAkBxhB,GACrB,IAAIj/E,EACJ,OAAO,WAKHL,aAAaK,GACbA,EAAUC,YALI,WACVD,OAAU1nB,EACV2mG,GACJ,GDqCqF,IClCzF,CACJ,CDiCyCyhB,CAAStnH,KAAKqnH,0BAA0BjrF,KAAKp8B,OAE9EooD,EAAWtnD,OAAOsjD,iBAAiB,uBAAuB,KACtDpkD,KAAKqnH,2BAA2B,IAGpCj/D,EAAWtnD,OAAOsjD,iBAAiB,mBAAmB,KAClDpkD,KAAKqnH,2BAA2B,GAExC,CACA,CAAC5jF,OAAOqB,aAAe,0BACvB,yBAAAuiF,GAGI,MAAMxB,EAAQ7lH,KAAKunH,mBACdnmH,OAAOpB,KAAKooD,WAAWg1D,iBAAiBoK,YACxCpmH,OAAO,IAAIpB,KAAK+gH,SAASjxD,WACzBjjD,QAAO,EAAE8rB,EAAGuvB,KAAcA,EAASu/D,YACnCnjH,KAAI,EAAEyB,KAAS,GAAUA,MAAOzB,KAAIy1D,GAEjCA,EAAGrF,cAAgB10D,KAAKooD,WAAWrB,OAAO1gD,WACnC0zD,EAAGxF,YAAY,QAAQv0D,KAAKooD,WAAWrB,OAAO1gD,cAElD0zD,IAEX/5D,KAAKooD,WAAW0N,UAAU2zC,MAAMzpG,KAAKooD,WAAWrB,OAAQ,CACpD+7C,WAAY+iB,IAEXviF,OAAM7c,IAASzmB,KAAKoL,IAAIoc,MAAM,2BAA4Bf,EAAI,GACvE,CAIA,cAAAihG,GACI,OAAO/lH,MAAM4c,KAAKve,KAAK8jC,QAAQx/B,KAAKqc,GAAM,GAAUA,IACxD,CAIA,gBAAA4mG,GACI,OAAO5lH,MAAM4c,KAAKve,KAAKi9G,UAAU34G,KAAKqc,GAAM,GAAUA,IAC1D,CAIA,gBAAAgnG,GACI,OAAOhmH,MAAM4c,KAAKve,KAAK+gH,UAAUz8G,KAAI,EAAEqc,KAAO,GAAUA,IAC5D,CAIA,eAAAmpF,CAAgBh7C,GAEZ,MAAM0F,GADN1F,EAAOo4D,GAAYp4D,EAAM9uD,KAAKooD,WAAWrB,SACjB1gD,WAEpBrG,KAAK+gH,SAAS9hH,IAAIu1D,IAGtBx0D,KAAK+gH,SAASzhH,IAAIk1D,EAAY,CAC1BizD,WAAW,GAEnB,CACA,mBAAAG,CAAoB94D,GAEhB,MAAM0F,GADN1F,EAAOo4D,GAAYp4D,EAAM9uD,KAAKooD,WAAWrB,SACjB1gD,WAIlBwhH,GAHW7nH,KAAK+gH,SAAS3hH,IAAIo1D,IAAe,CAC9CizD,WAAW,IAEqBA,UACpCznH,KAAK+gH,SAASzhH,IAAIk1D,EAAY,CAC1BizD,WAAW,IAGVI,GACD7nH,KAAKqnH,2BAEb,CACA,kBAAAS,CAAmBh5D,GAEf,MAAM0F,GADN1F,EAAOo4D,GAAYp4D,EAAM9uD,KAAKooD,WAAWrB,SACjB1gD,WACxBrG,KAAK+gH,SAAS75D,OAAOsN,EACzB,CACA,YAAAu1C,GACI,IAAI8b,EAAQ7lH,KAAKunH,mBAAmBjjH,KAAIy1D,GAAMA,EAAG1zD,aAC5B,IAAjBw/G,EAAMpkH,SAENokH,EAAQ7lH,KAAKooD,WAAWg1D,iBAAiBoK,WAAWljH,KAAIy1D,GAAMA,EAAG1zD,cAGrEw/G,EAAQA,EAAMzkH,OAAOO,MAAM4c,KAAKve,KAAK+gH,UAChCl0G,QAAO,EAAEktD,EAAI7R,KAAcA,EAASu/D,YACpCnjH,KAAI,EAAEy1D,KAAQA,KAEnB,MAAMguD,EAAU,IAAI5sE,IAAI0qE,GAExB,OAAO7lH,KAAKm9G,eAAex7G,MAAM4c,KAAKwpG,GACjCzjH,KAAIyB,GAAO,GAAUA,MACrBzB,KAAIy1D,IAE2B,IAA5BA,EAAG5F,SAAS32B,OAAOxd,MAGnB+5C,EAAGrF,cAAgB10D,KAAKooD,WAAWrB,OAAO1gD,WAFnC0zD,EAKJA,EAAGzF,YAAY,QAAQt0D,KAAKooD,WAAWrB,OAAO1gD,eAE7D,EEtJG,SAAS2hH,GAAYz1G,GACxB,OAAc,MAAPA,GAAoC,mBAAdA,EAAIvL,OAA4C,mBAAbuL,EAAI+T,IACxE,CCFO,IAAImtB,IACX,SAAWA,GACPA,EAA0B,gBAAI,qCAC9BA,EAAoB,UAAI,WAC3B,CAHD,CAGGA,KAAaA,GAAW,CAAC,IACrB,MAAMw0E,WAA4BzpH,MACrC,WAAA8Q,CAAY9C,EAAU,mBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAEG,MAAMmnH,WAAsC1pH,MAC/C,WAAA8Q,CAAY9C,EAAU,8BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,+BAChB,EAEG,MAAMonH,WAA8B3pH,MACvC,WAAA8Q,CAAY9C,EAAU,gCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAMqnH,WAA2B5pH,MACpC,WAAA8Q,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,oBAChB,EAEG,MAAMsnH,WAA4B7pH,MACrC,WAAA8Q,CAAY9C,EAAU,+BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAEG,MAAMunH,WAA+B9pH,MACxC,WAAA8Q,CAAY9C,EAAU,4BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAEG,MAAMwnH,WAAsC/pH,MAC/C,WAAA8Q,CAAY9C,EAAU,oCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,+BAChB,EAEG,MAAMynH,WAAwBhqH,MACjC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,iBAChB,EAEG,MAAM0nH,WAA8BjqH,MACvC,WAAA8Q,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAM2nH,WAAmClqH,MAC5C,WAAA8Q,CAAY9C,EAAU,0BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,4BAChB,EAEG,MAAM4nH,WAA8BnqH,MACvC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAM6nH,WAA8BpqH,MACvC,WAAA8Q,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAM8nH,WAA8BrqH,MACvC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAM+nH,WAAkCtqH,MAC3C,WAAA8Q,CAAY9C,EAAU,yBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,2BAChB,ECnFJ,MAAMgoH,GACF3gE,WAAa,CAAC,EACd4gE,UAAW,EACX,WAAA15G,CAAYzD,EAAO,CAAC,GAChB7L,KAAKooD,WAAa,CAAC,EACnB,IAAK,MAAOrpD,EAAKC,KAAUL,OAAOmxD,QAAQjkD,GACtC7L,KAAKooD,WAAWrpD,GAAOC,EAEG,MAA1BgB,KAAKooD,WAAW5K,SAChBx9C,KAAKooD,WAAW5K,OAAS2gE,KAEjC,CACA,SAAA5hD,GACI,OAAOv8D,KAAKgpH,QAChB,CACA,4BAAMC,CAAuB70G,SACnBmoB,QAAQ6oB,IAAIzmD,OAAOsE,OAAOjD,KAAKooD,YAChCv7C,QAAO0F,GAAOy1G,GAAYz1G,KAC1BjO,KAAI6oC,MAAO+7E,UACNA,EAAU90G,OAAe,IAEvC,CACA,iBAAM+0G,SACInpH,KAAKipH,uBAAuB,cACtC,CACA,WAAMjiH,SACIhH,KAAKipH,uBAAuB,SAClCjpH,KAAKgpH,UAAW,CACpB,CACA,gBAAMI,SACIppH,KAAKipH,uBAAuB,aACtC,CACA,gBAAMI,SACIrpH,KAAKipH,uBAAuB,aACtC,CACA,UAAM3iG,SACItmB,KAAKipH,uBAAuB,QAClCjpH,KAAKgpH,UAAW,CACpB,CACA,eAAMM,SACItpH,KAAKipH,uBAAuB,YACtC,EAEJ,MAAMM,GAAoB,CACtB,UACA,sBACA,OAEEC,GAAyB,CAC3B,aACA,YACA,cACA,QACA,aACA,aACA,OACA,YACA,OACA,0BA2CJ,SAASC,GAAuBr+F,GAC5B,OAAIzpB,MAAM2Q,QAAQ8Y,IAAU0jE,KACjB1jE,EAAQ0jE,IAEZ,EACX,CACA,SAAS46B,GAAuBt+F,GAC5B,OAAIzpB,MAAM2Q,QAAQ8Y,IAAU2jE,KACjB3jE,EAAQ2jE,IAEZ,EACX,CACA,SAAS46B,GAAev+F,GACpB,OAAOA,IAAUqY,OAAOqB,cAAgB1Z,GAAS/kB,YAAc,SACnE,CCjHO,SAASujH,GAAgBC,EAAQ,CAAC,GACrC,MAAO,CACHC,aAAc38E,UAAY,EAC1B48E,kBAAmB58E,MAAOq2D,IACtB,MAAM9wC,EAAS8wC,EAAU7wC,eACzB,OAAqB,IAAjBD,EAAO,GAAG,IAA6B,KAAjBA,EAAO,GAAG,KACzB5lD,QAAQu4F,GAAY,GAAG3yC,EAAO,GAAG,MAEhC,EAEhBs3D,sBAAuB78E,UAAY,EACnC88E,uBAAwB98E,UAAY,EACpC+8E,+BAAgC/8E,UAAY,EAC5Cg9E,gCAAiCh9E,UAAY,EAC7Ci9E,8BAA+Bj9E,UAAY,EAC3Ck9E,+BAAgCl9E,UAAY,EAC5Cm9E,uBAAwBn9E,UAAY,KACjC08E,EAEX,CCPO,MAAMU,GACTjmH,IACA,WAAAgL,CAAYhL,GAER,GADAtE,KAAKsE,IAAM,IAAIupC,IACJ,MAAPvpC,EACA,IAAK,MAAOvF,EAAKC,KAAUsF,EAAIwrD,UAC3B9vD,KAAKsE,IAAIhF,IAAIP,EAAIsH,WAAY,CAAEtH,MAAKC,SAGhD,CACA,CAACykC,OAAOsb,YACJ,OAAO/+C,KAAK8vD,SAChB,CACA,KAAAvwD,GACIS,KAAKsE,IAAI/E,OACb,CACA,OAAOmoD,GACH,OAAO1nD,KAAKsE,IAAI4iD,OAAOQ,EAAKrhD,WAChC,CACA,OAAAypD,GACI,OAAOwuD,GAAYt+G,KAAKsE,IAAIwrD,WAAY7kD,GAC7B,CAACA,EAAI,GAAGlM,IAAKkM,EAAI,GAAGjM,QAEnC,CACA,OAAAmO,CAAQtN,GACJG,KAAKsE,IAAI6I,SAAQ,CAACnO,EAAOD,KACrBc,EAAGb,EAAMA,MAAOA,EAAMD,IAAKiB,KAAK,GAExC,CACA,GAAAZ,CAAIsoD,GACA,OAAO1nD,KAAKsE,IAAIlF,IAAIsoD,EAAKrhD,aAAarH,KAC1C,CACA,GAAAC,CAAIyoD,GACA,OAAO1nD,KAAKsE,IAAIrF,IAAIyoD,EAAKrhD,WAC7B,CACA,GAAA/G,CAAIooD,EAAM1oD,GACNgB,KAAKsE,IAAIhF,IAAIooD,EAAKrhD,WAAY,CAAEtH,IAAK2oD,EAAM1oD,SAC/C,CACA,IAAAkG,GACI,OAAOo5G,GAAYt+G,KAAKsE,IAAIrB,UAAWgI,GAC5BA,EAAIlM,KAEnB,CACA,MAAAkE,GACI,OAAOq7G,GAAYt+G,KAAKsE,IAAIrB,UAAWgI,GAAQA,EAAIjM,OACvD,CACA,QAAIP,GACA,OAAOuB,KAAKsE,IAAI7F,IACpB,EC5DG,SAAS+rH,GAAe9iE,GAC3B,GAAIgF,GAAShF,GACT,MAAO,CAAEX,OAAQW,EAAMo7C,WAAY,IAKvC,IAAI/7C,EACJ,GAJKplD,MAAM2Q,QAAQo1C,KACfA,EAAO,CAACA,IAGRA,EAAKjmD,OAAS,EAAG,CACjB,MAAMulD,EAAYU,EAAK,GAAGgN,YAC1B3N,EAAsB,MAAbC,OAAoB9nD,EAAYowF,GAAiBtoC,GAE1DU,EAAKv6C,SAAQ4sD,IACT,IAAKxG,GAAYwG,GACb,MAAM,IAAIuN,GAAsB,qBAEpC,MAAMmjD,EAAc1wD,EAAGrF,YACvB,GAAmB,MAAf+1D,GACA,GAAc,MAAV1jE,EACA,MAAM,IAAI,GAAuB,oEAGpC,CACD,MAAM2jE,EAAWp7B,GAAiBm7B,GAClC,IAAiC,IAA7B1jE,GAAQzY,OAAOo8E,GACf,MAAM,IAAI,GAAuB,+DAEzC,IAER,CACA,MAAO,CACH3jE,SACA+7C,WAAYp7C,EAEpB,CCrBA,MAAMijE,GAA6B,CAE/B,iBAEA,sBAEA,wBAEA,iBCxBE,GAAiB,CACnBC,eCA2B,IDC3BC,MAAO,IAKJ,MAAMC,GACTF,eACApiE,kBACAsN,UACA+0D,MACA/pH,OACAsK,IACA,WAAAkE,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAK4qH,eAAiB/+G,EAAK++G,gBAAkB,GAAeA,eAC5D5qH,KAAK6qH,MAAQh/G,EAAKg/G,OAAS,GAAeA,MAC1C7qH,KAAKwoD,kBAAoBJ,EAAWI,kBACpCxoD,KAAK81D,UAAY1N,EAAW0N,UAC5B91D,KAAKc,OAASsnD,EAAWtnD,OACzBd,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,+CAC1CngG,KAAK+qH,sBAAwB/qH,KAAK+qH,sBAAsB3uF,KAAKp8B,KACjE,CACA,KAAAgH,GACIhH,KAAKc,OAAOsjD,iBAAiB,kBAAmBpkD,KAAK+qH,sBACzD,CACA,IAAAzkG,GACItmB,KAAKc,OAAOwjD,oBAAoB,kBAAmBtkD,KAAK+qH,sBAC5D,CACA,qBAAAA,GACI/qH,KAAKgrH,yBACA1nF,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,qCAAsCf,EAAI,GAEjE,CAKA,4BAAMukG,GACF,MAAM5kE,EAAcpmD,KAAKwoD,kBAAkB9B,iBACrCukE,EAAiB7kE,EAAY3kD,OAEnC,GADAzB,KAAKoL,IAAI,uCAAwC6/G,EAAgBjrH,KAAK4qH,gBAClEK,GAAkBjrH,KAAK4qH,eACvB,OAEJ,MAAMM,EAAa,IAAIX,GAEvB,IAAK,MAAMjjE,KAAclB,EAAa,CAClC,MAAMsE,EAAapD,EAAWoD,WAC9B,IAAIwgE,EAAWjsH,IAAIyrD,GAAnB,CAGAwgE,EAAW5rH,IAAIorD,EAAY,GAC3B,IACI,MAAMhD,QAAa1nD,KAAK81D,UAAU12D,IAAIsrD,GAEtCwgE,EAAW5rH,IAAIorD,EAAY,IAAIhD,EAAKoQ,KAAK70D,UAAUqnC,QAAO,CAAC0Q,EAAKlyC,IACrDkyC,EAAMlyC,EAAK9J,OACnB,GACP,CACA,MAAOynB,GACc,kBAAbA,EAAI1lB,MACJf,KAAKoL,IAAIoc,MAAM,0BAA2Bf,EAElD,CAbA,CAcJ,CACA,MAAM0kG,EAAoBnrH,KAAKorH,gBAAgBhlE,EAAa8kE,GAEtDG,EAAUpiH,KAAK1K,IAAI0sH,EAAiBjrH,KAAK4qH,eAAgB,GACzDU,EAAU,GAChB,IAAK,MAAMhkE,KAAc6jE,EAUrB,GATAnrH,KAAKoL,IAAI,yDAA0Dk8C,EAAWoD,YAEhD1qD,KAAK6qH,MAAMjwD,MAAMb,GACpCzS,EAAW2iD,WAAW5jG,WAAWkmB,WAAWwtC,EAAG1zD,eAItDilH,EAAQ9qH,KAAK8mD,GAEbgkE,EAAQ7pH,SAAW4pH,EACnB,YAIF9uF,QAAQ6oB,IAAIkmE,EAAQhnH,KAAI6oC,MAAOma,UDxDtCna,eAA6Cma,EAAYrtC,GAC5D,MAAMsxG,EAAkBjkE,GAAYQ,SAASxjD,KAAI2hD,GAAUA,EAAO8B,YAAa,GACzEyjE,EAAoBvxG,GAASuxG,mBAAqBb,GAGxD,KAAIY,EAAgB1+G,QAAO8wC,GAAkB,MAATA,IAAkB6tE,EAAkBxgG,SAAS2yB,KAAQl8C,OAAS,GAGlG,UACU6lD,GAAY0hD,MAAM/uF,GAC5B,CACA,MAAOwM,GACH6gC,GAAYyc,MAAMt9C,EACtB,CACJ,CC2CkBglG,CAA8BnkE,EAAY,CAC5CrD,OAAQ8kD,YAAYniF,QAAQ,MAC9B,KAGN5mB,KAAKc,OAAOyrD,kBAAkB,mBAAoB,CAAE5E,OAAQ2jE,GAChE,CACA,eAAAF,CAAgBhlE,EAAa8kE,GACzB,OAAO9kE,EAEFh4C,MAAK,CAACuS,EAAGC,KACV,MAAM8qG,EAAsB/qG,EAAE0lC,SAAS71B,KACjCm7F,EAAsB/qG,EAAEylC,SAAS71B,KACvC,OAAIk7F,EAAsBC,EACf,EAEPD,EAAsBC,GACd,EAEL,CAAC,IAGPv9G,MAAK,CAACuS,EAAGC,IACU,aAAhBD,EAAEiuF,WAA4C,YAAhBhuF,EAAEguF,UACzB,EAES,YAAhBjuF,EAAEiuF,WAA2C,aAAhBhuF,EAAEguF,WACvB,EAEL,IAGNxgG,MAAK,CAACuS,EAAGC,IACND,EAAEmnC,QAAQrmD,OAASmf,EAAEknC,QAAQrmD,OACtB,EAEPkf,EAAEmnC,QAAQrmD,OAASmf,EAAEknC,QAAQrmD,QACrB,EAEL,IAGN2M,MAAK,CAACuS,EAAGC,KACV,MAAMgrG,EAAaV,EAAW9rH,IAAIuhB,EAAE+pC,aAAe,EAC7CmhE,EAAaX,EAAW9rH,IAAIwhB,EAAE8pC,aAAe,EACnD,OAAIkhE,EAAaC,EACN,EAEPD,EAAaC,GACL,EAEL,CAAC,GAEhB,EE5IG,MAiCMC,GAAwB,oBAMxBC,GAAwB,oBCuE9B,MAAM,WAAmBvtH,MAC5B2G,KACA4P,KACA,WAAAzF,CAAY9C,EAASuI,GACjBq7B,MAAM5jC,GAAW,6BACjBxM,KAAKmF,KAAO,UACZnF,KAAKe,KAAO,aACZf,KAAK+U,KAAOA,GAAQ,WACxB,EAKGo4B,eAAe6+E,GAAU9rH,EAAS+rH,EAAWhoE,EAAQnnB,GAExD,MAAMtV,EAAQ,IAAI,GAAWsV,GAAM4nB,aAAc5nB,GAAM6nB,WACvD,OAAwB,IAApBV,GAAQQ,QACDloB,QAAQC,OAAOhV,GAEnB,IAAI+U,SAAQ,CAACr4B,EAASs4B,KACzB,SAAS0vF,IACLjoE,GAAQK,oBAAoB,QAASsrD,GACrC1vG,EAAQokD,oBAAoB2nE,EAAWE,GACf,MAApBrvF,GAAMsvF,YACNlsH,EAAQokD,oBAAoBxnB,EAAKsvF,WAAYC,EAErD,CACA,MAAMF,EAAiB7rH,IACnB,IACI,IAA4B,IAAxBw8B,GAAMjwB,SAASvM,GACf,MAER,CACA,MAAOmmB,GAGH,OAFAylG,SACA1vF,EAAO/V,EAEX,CACAylG,IACAhoH,EAAQ5D,EAAI,EAEV+rH,EAAsB/rH,IACxB4rH,IACA1vF,EAAOl8B,EAAIqnD,OAAO,EAEhBioD,EAAgB,KAClBsc,IACA1vF,EAAOhV,EAAM,EAEjBy8B,GAAQG,iBAAiB,QAASwrD,GAClC1vG,EAAQkkD,iBAAiB6nE,EAAWE,GACZ,MAApBrvF,GAAMsvF,YACNlsH,EAAQkkD,iBAAiBtnB,EAAKsvF,WAAYC,EAC9C,GAER,CCtKO,MAAMC,GACTt7F,SACAizB,OACA,WAAA30C,CAAY20C,GACRjkD,KAAKikD,OAASA,EACdjkD,KAAKgxB,SAAWwxB,KAChBxiD,KAAKsvG,QAAUtvG,KAAKsvG,QAAQlzE,KAAKp8B,MACjCA,KAAKikD,QAAQG,iBAAiB,QAASpkD,KAAKsvG,QAChD,CACA,OAAAA,GACItvG,KAAKgxB,SAASwL,OAAOx8B,KAAKikD,QAAQyb,QAAU,IAAI,GACpD,CACA,OAAA40C,GACIt0G,KAAKikD,QAAQK,oBAAoB,QAAStkD,KAAKsvG,QACnD,ECPG,MAAMid,GACT77G,GACA7Q,GACAoa,QACAuyG,WACAp8F,OACAi2B,SACAomE,WACA,WAAAn9G,CAAYzP,EAAIoa,GACZja,KAAK0Q,GAXF,GAAI8N,SAASxP,OAAuB,IAAhB/F,KAAKm0B,UAAiB,IAAK/2B,aAAamE,KAAKm2D,QAYpE3gE,KAAKowB,OAAS,SACdpwB,KAAKH,GAAKA,EACVG,KAAKia,QAAUA,EACfja,KAAKwsH,WAAa,GAClBxsH,KAAKqmD,SAAW,CACZqmE,QAASliH,KAAKm2D,OAElB3gE,KAAKysH,WAAa,IAAIhd,gBACIzvG,KAAKysH,WAAWxoE,OAC1CjkD,KAAKsvG,QAAUtvG,KAAKsvG,QAAQlzE,KAAKp8B,KACrC,CACA,KAAA+jE,CAAMt9C,GACFzmB,KAAKysH,WAAW1oD,MAAMt9C,EAC1B,CACA,OAAA6oF,GACuBtvG,KAAKwsH,WAAWliF,QAAO,CAAC0Q,EAAKlyC,IACrCkyC,IAAiC,IAAzBlyC,EAAKm7C,QAAQQ,UAC7B,KAGCzkD,KAAKysH,WAAW1oD,MAAM,IAAI,IAC1B/jE,KAAKs0G,UAEb,CACA,UAAMzsG,CAAKoS,EAAU,CAAC,GAClB,MAAM0yG,EAAY,IAAIL,GAAaryG,EAAQgqC,QAG3C,OAFAjkD,KAAKwsH,WAAWhsH,KAAKmsH,GACrB1yG,EAAQgqC,QAAQG,iBAAiB,QAASpkD,KAAKsvG,SACxCqd,EAAU37F,SAASyxB,OAC9B,CACA,SAAM21D,GACFp4G,KAAKowB,OAAS,UACdpwB,KAAKqmD,SAAS2hD,QAAUx9F,KAAKm2D,MAC7B,IACI3gE,KAAKysH,WAAWxoE,OAAOC,iBACvB,MAAMpvC,QAAe0vC,GAAWxkD,KAAKH,GAAG,IAChCG,KAAKia,SAAW,CAAC,EACrBgqC,OAAQjkD,KAAKysH,WAAWxoE,SACxBjkD,KAAKysH,WAAWxoE,QACpBjkD,KAAKwsH,WAAWr/G,SAAQw/G,IACpBA,EAAU37F,SAAS9sB,QAAQ4Q,EAAO,IAEtC9U,KAAKowB,OAAS,UAClB,CACA,MAAO3J,GACHzmB,KAAKwsH,WAAWr/G,SAAQw/G,IACpBA,EAAU37F,SAASwL,OAAO/V,EAAI,IAElCzmB,KAAKowB,OAAS,SAClB,CACA,QACIpwB,KAAKqmD,SAAS1P,SAAWnsC,KAAKm2D,MAC9B3gE,KAAKs0G,SACT,CACJ,CACA,OAAAA,GACIt0G,KAAKwsH,WAAWr/G,SAAQw/G,IACpBA,EAAUrY,UACVqY,EAAU1oE,QAAQK,oBAAoB,QAAStkD,KAAKsvG,QAAQ,GAEpE,ECpEG,MAAMsd,WAAcxgE,GACvB6sD,YACAgD,QACAl4E,MACAzH,QACAluB,KACA,WAAAkB,CAAYzD,EAAO,CAAC,GAChBukC,QACApwC,KAAKi5G,YAAcptG,EAAKotG,aAAe1uG,OAAOytG,kBAC9Ch4G,KAAKi8G,QAAUpwG,EAAKowG,SAAW1xG,OAAOytG,kBACtCh4G,KAAKs8B,QAAU,EACQ,MAAnBzwB,EAAKghH,YACLhhH,EAAK6yF,SAASouB,oBAAoBjhH,EAAKghH,WAAY,CAC/CE,UAAW,KACA,CACHtuH,KAAMuB,KAAK+jC,MAAMtiC,OACjBurH,QAAShtH,KAAKs8B,QACdzK,OAAQ7xB,KAAK+jC,MAAMtiC,OAASzB,KAAKs8B,YAKjDt8B,KAAKoO,KAAOvC,EAAKuC,KACjBpO,KAAK+jC,MAAQ,EACjB,CACA,iBAAAkpF,GACI,GAAkB,IAAdjtH,KAAKvB,KAaL,OAVAolD,gBAAe,KACX7jD,KAAKusD,kBAAkB,QAAQ,IAEd,IAAjBvsD,KAAKgtH,SAGLnpE,gBAAe,KACX7jD,KAAKusD,kBAAkB,OAAO,KAG/B,EAEX,GAAIvsD,KAAKs8B,QAAUt8B,KAAKi5G,YAAa,CACjC,IAAIM,EACJ,IAAK,MAAM/2G,KAAKxC,KAAK+jC,MACjB,GAAiB,WAAbvhC,EAAE4tB,OAAqB,CACvBmpF,EAAM/2G,EACN,KACJ,CAEJ,OAAW,MAAP+2G,IAGJv5G,KAAKusD,kBAAkB,UACvBvsD,KAAKs8B,UACAi9E,EAAInB,MACJprB,SAAQ,KAET,IAAK,IAAIzrF,EAAI,EAAGA,EAAIvB,KAAK+jC,MAAMtiC,OAAQF,IACnC,GAAIvB,KAAK+jC,MAAMxiC,KAAOg4G,EAAK,CACvBv5G,KAAK+jC,MAAM74B,OAAO3J,EAAG,GACrB,KACJ,CAEJvB,KAAKs8B,UACLt8B,KAAKitH,oBACLjtH,KAAKusD,kBAAkB,OAAO,KAE3B,EACX,CACA,OAAO,CACX,CACA,OAAA4rD,CAAQoB,GACJv5G,KAAK+jC,MAAMvjC,KAAK+4G,GACC,MAAbv5G,KAAKoO,MACLpO,KAAK+jC,MAAM31B,KAAKpO,KAAKoO,KAE7B,CAIA,SAAM4O,CAAInd,EAAIoa,GAEV,GADAA,GAASgqC,QAAQC,iBACblkD,KAAKvB,OAASuB,KAAKi8G,QACnB,MAAM,IAAI5Q,GAEd,MAAMkO,EAAM,IAAIgT,GAAI1sH,EAAIoa,GAIxB,OAHAja,KAAKm4G,QAAQoB,GACbv5G,KAAKusD,kBAAkB,OACvBvsD,KAAKitH,oBACE1T,EAAI1xG,KAAKoS,GACXspB,MAAKzuB,IACN9U,KAAKusD,kBAAkB,YAAa,CAAE5E,OAAQ7yC,IAC9C9U,KAAKusD,kBAAkB,UAAW,CAAE5E,OAAQ,CAAE4xD,MAAKzkG,YAC5CA,KAENwuB,OAAM7c,IACP,GAAmB,WAAf8yF,EAAInpF,OAEJ,IAAK,IAAI7uB,EAAI,EAAGA,EAAIvB,KAAK+jC,MAAMtiC,OAAQF,IACnC,GAAIvB,KAAK+jC,MAAMxiC,KAAOg4G,EAAK,CACvBv5G,KAAK+jC,MAAM74B,OAAO3J,EAAG,GACrB,KACJ,CAKR,MAFAvB,KAAKusD,kBAAkB,QAAS,CAAE5E,OAAQlhC,IAC1CzmB,KAAKusD,kBAAkB,UAAW,CAAE5E,OAAQ,CAAE4xD,MAAK/xF,MAAOf,KACpDA,CAAG,GAEjB,CAIA,KAAAlnB,GACIS,KAAK+jC,MAAM74B,OAAO,EAAGlL,KAAK+jC,MAAMtiC,OACpC,CAIA,KAAAsiE,GACI/jE,KAAK+jC,MAAM52B,SAAQosG,IACfA,EAAIx1C,MAAM,IAAI,GAAa,IAE/B/jE,KAAKT,OACT,CAMA,aAAMykD,CAAQ/pC,GAEQ,IAAdja,KAAKvB,YAGHutH,GAAUhsH,KAAM,QAASia,GAASgqC,OAC5C,CAYA,oBAAM41D,CAAevrD,EAAOr0C,GAEpBja,KAAKvB,KAAO6vD,SAGV09D,GAAUhsH,KAAM,OAAQia,GAASgqC,OAAQ,CAC3Cp3C,OAAQ,IAAM7M,KAAKvB,KAAO6vD,GAElC,CASA,YAAMwrD,CAAO7/F,GAEY,IAAjBja,KAAKs8B,SAA+B,IAAdt8B,KAAKvB,YAGzButH,GAAUhsH,KAAM,OAAQia,GAASgqC,OAC3C,CAIA,QAAIxlD,GACA,OAAOuB,KAAK+jC,MAAMtiC,MACtB,CAIA,UAAIowB,GACA,OAAO7xB,KAAK+jC,MAAMtiC,OAASzB,KAAKs8B,OACpC,CAIA,WAAI0wF,GACA,OAAOhtH,KAAKs8B,OAChB,CAWA,iBAAO4wF,CAAYjzG,GACfA,GAASgqC,QAAQC,iBACjB,MAAM+B,EAAS7C,GAAS,CACpBO,YAAY,IAEV2wD,EAAW7tF,IACF,MAAPA,EACAzmB,KAAK+jE,QAGL/jE,KAAKT,QAET0mD,EAAOh/C,IAAIwf,EAAI,EAEb0mG,EAAsB7sH,IACN,MAAdA,EAAIqnD,QACJ1B,EAAOzlD,KAAKF,EAAIqnD,OACpB,EAEEylE,EAAgB9sH,IAClBg0G,EAAQh0G,EAAIqnD,OAAO,EAEjB0lE,EAAc,KAChB/Y,GAAS,EAGPgZ,EAAgB,KAClBhZ,EAAQ,IAAI,GAAW,iBAAiB,EAG5Ct0G,KAAKokD,iBAAiB,YAAa+oE,GACnCntH,KAAKokD,iBAAiB,QAASgpE,GAC/BptH,KAAKokD,iBAAiB,OAAQipE,GAC9BpzG,GAASgqC,QAAQG,iBAAiB,QAASkpE,GAC3C,UACWrnE,CACX,CACA,QAEIjmD,KAAKskD,oBAAoB,YAAa6oE,GACtCntH,KAAKskD,oBAAoB,QAAS8oE,GAClCptH,KAAKskD,oBAAoB,OAAQ+oE,GACjCpzG,GAASgqC,QAAQK,oBAAoB,QAASgpE,GAE9ChZ,GACJ,CACJ,EChQG,MAAM,WAAsBsY,GAC/B,WAAAt9G,CAAYzD,EAAO,CAAC,GAChBukC,MAAM,IACCvkC,EACHuC,KAAM,CAACuS,EAAGC,IACFD,EAAE1G,QAAQq+F,SAAW13F,EAAE3G,QAAQq+F,UACvB,EAER33F,EAAE1G,QAAQq+F,SAAW13F,EAAE3G,QAAQq+F,SACxB,EAEJ,GAGnB,ECXG,SAASiV,GAAUC,GACtB,MAAMf,EAAa,IAAI70F,WAAW63E,gBAClC,SAASH,IACLmd,EAAW1oD,QACX,IAAK,MAAM9f,KAAUupE,EACkB,MAA/BvpE,GAAQK,qBACRL,EAAOK,oBAAoB,QAASgrD,EAGhD,CACA,IAAK,MAAMrrD,KAAUupE,EAAS,CAC1B,IAAwB,IAApBvpE,GAAQQ,QAAkB,CAC1B6qD,IACA,KACJ,CACgC,MAA5BrrD,GAAQG,kBACRH,EAAOG,iBAAiB,QAASkrD,EAEzC,CAQA,MAAMrrD,EAASwoE,EAAWxoE,OAE1B,OADAA,EAAO1kD,MARP,WACI,IAAK,MAAM0kD,KAAUupE,EACkB,MAA/BvpE,GAAQK,qBACRL,EAAOK,oBAAoB,QAASgrD,EAGhD,EAGOrrD,CACX,CCxBO,SAASwpE,GAAwB9sG,EAAGC,GACvC,MAAM8sG,EAAS,GAAIrnB,WAAW1lF,EAAE6iF,WAC1BmqB,EAAS,GAAItnB,WAAWzlF,EAAE4iF,WAChC,GAAIkqB,IAAWC,EACX,OAAQ,EAEZ,IAAKD,GAAUC,EACX,OAAO,EAEX,MAAMC,EAAqB,GAAiBvnB,WAAW1lF,EAAE6iF,WACnDqqB,EAAqB,GAAiBxnB,WAAWzlF,EAAE4iF,WACzD,GAAIoqB,IAAuBC,EACvB,OAAQ,EAEZ,IAAKD,GAAsBC,EACvB,OAAO,EAEX,MAAMC,EAAe,GAAWznB,WAAW1lF,EAAE6iF,WACvCuqB,EAAe,GAAW1nB,WAAWzlF,EAAE4iF,WAC7C,GAAIsqB,IAAiBC,EACjB,OAAQ,EAEZ,IAAKD,GAAgBC,EACjB,OAAO,EAEX,MAAMC,EAAY,GAAO3nB,WAAW1lF,EAAE6iF,WAChCyqB,EAAY,GAAO5nB,WAAWzlF,EAAE4iF,WACtC,GAAIwqB,IAAcC,EACd,OAAQ,EAEZ,IAAKD,GAAaC,EACd,OAAO,EAEX,MAAMC,EAAkB,GAAa7nB,WAAW1lF,EAAE6iF,WAC5C2qB,EAAkB,GAAa9nB,WAAWzlF,EAAE4iF,WAClD,GAAI0qB,IAAoBC,EACpB,OAAQ,EAEZ,IAAKD,GAAmBC,EACpB,OAAO,EAEX,MAAMC,EAAkB,GAAa/nB,WAAW1lF,EAAE6iF,WAC5C6qB,EAAkB,GAAahoB,WAAWzlF,EAAE4iF,WAClD,OAAI4qB,IAAoBC,GACZ,GAEPD,GAAmBC,EACb,EAGJ,CACX,CAKO,SAASC,GAAqB3tG,EAAGC,GACpC,MAAM2tG,EAAa5oB,GAAUhlF,EAAE6iF,WACzBgrB,EAAa7oB,GAAU/kF,EAAE4iF,WAC/B,OAAI+qB,IAAeC,EACR,GAEDD,GAAcC,GACZ,EAEL,CACX,CAKO,SAASC,GAAwB9tG,EAAGC,GACvC,OAAID,EAAEuoF,cAAgBtoF,EAAEsoF,aACZ,GAEFvoF,EAAEuoF,aAAetoF,EAAEsoF,YAClB,EAEJ,CACX,CAKO,SAASwlB,GAA0B/tG,EAAGC,GACzC,MAAM+tG,EAAa,GAAQtoB,WAAW1lF,EAAE6iF,WAClCorB,EAAa,GAAQvoB,WAAWzlF,EAAE4iF,WACxC,OAAImrB,IAAeC,EACR,GAEDD,GAAcC,GACZ,EAEL,CACX,CC9EO,MAAMC,GACT9qF,MACAqkB,WACA0mE,cACAC,mBACAC,mBACAC,YACAC,mBACA9oE,YACAh7C,IACA,WAAAkE,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAK8uH,cAAgBjjH,EAAKijH,cAC1B9uH,KAAK+uH,mBAAqBljH,EAAKkjH,oBRtBD,GQuB9B/uH,KAAKgvH,mBAAqBnjH,EAAKmjH,oBRQF,IQP7BhvH,KAAKivH,YAAcpjH,EAAKojH,aRpCJ,IQqCpBjvH,KAAKomD,YAAcv6C,EAAKu6C,aAAe,IAAImkE,GAC3CvqH,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,wCAC1CngG,KAAKooD,WAAaA,EAClBpoD,KAAKkvH,mBAAqB,IAAIzf,gBACJzvG,KAAKkvH,mBAAmBjrE,OAClD,IAAK,MAAOllD,EAAKC,KAAUL,OAAOmxD,QAAQjkD,EAAKmpD,WAAa,CAAC,GACzDA,GAAU11D,IAAIP,EAAKC,GAGvBgB,KAAK+jC,MAAQ,IAAI,GAAc,CAC3Bk1E,YAAaptG,EAAK0sD,kBT1CI,GS2CtBs0D,WAAY,oBACZnuB,QAASt2C,EAAWs2C,UAGxB1+F,KAAK+jC,MAAMqgB,iBAAiB,SAAUjkD,IAC9BA,EAAMwnD,OAAO5mD,OAAS,GAAWA,MACjCf,KAAKoL,IAAIoc,MAAM,2BAA4BrnB,EAAMwnD,OACrD,GAER,CACA,KAAA3gD,GACIhH,KAAKkvH,mBAAqB,IAAIzf,gBACJzvG,KAAKkvH,mBAAmBjrE,MACtD,CAIA,IAAA39B,GACItmB,KAAKkvH,mBAAmBnrD,QACxB/jE,KAAK+jC,MAAMggC,OACf,CAaA,UAAMvK,CAAK21D,EAAmBl1G,EAAU,CAAC,GACrC,MAAM,OAAE8sC,EAAM,WAAE+7C,GAAe0nB,GAAe2E,GAGxCC,EAAqBztH,MAAM4c,KAAKve,KAAKomD,YAAYnjD,UAAUosH,OAAO/1F,MAAKi+B,IACnD,IAAlBt9C,EAAQq1G,UAGR/3D,EAAK7M,WAAWpc,OAAOyY,IAGpB+7C,EAAWxpE,MAAKw1B,GACZA,EAAKxgB,OAAOipB,EAAK0yC,iBAGhC,GAAmC,SAA/BmlB,GAAoBh/F,OAGpB,OAFApwB,KAAKoL,IAAI,0BAA2BgkH,EAAmBnlB,YACvDhwF,EAAQk9F,aAAa,IAAIf,GAAoB,iCACtCgZ,EAIX,MAAMG,EAAevvH,KAAK+jC,MAAMA,MAAMzK,MAAKigF,IACvC,IAA2C,IAAvCxyD,GAAQzY,OAAOirE,EAAIt/F,QAAQ8sC,QAC3B,OAAO,EAGX,MAAM08C,EAAY8V,EAAIt/F,QAAQ6oF,WAC9B,GAAiB,MAAbW,EACA,OAAO,EAEX,IAAK,MAAMD,KAAaV,EACpB,GAAIW,EAAUxkG,IAAIukG,EAAUn9F,YACxB,OAAO,EAGf,OAAO,CAAK,IAEhB,GAAoB,MAAhBkpH,EAAsB,CACtBvvH,KAAKoL,IAAI,sCAAuC27C,GAEhD,IAAK,MAAMy8C,KAAaV,EACpBysB,EAAat1G,QAAQ6oF,WAAW9lF,IAAIwmF,EAAUn9F,YAGlD,OADA4T,EAAQk9F,aAAa,IAAIf,GAAoB,qCACtCmZ,EAAa1nH,KAAKoS,EAC7B,CACA,GAAIja,KAAK+jC,MAAMtlC,MAAQuB,KAAKgvH,mBACxB,MAAM,IAAInnD,GAAU,sBAIxB,OAFA7nE,KAAKoL,IAAI,8BAA+B27C,EAAQ+7C,EAAWx+F,KAAIy1D,GAAMA,EAAG1zD,cACxE4T,EAAQk9F,aAAa,IAAIf,GAAoB,iCACtCp2G,KAAK+jC,MAAM/mB,KAAImwB,MAAOlzB,IACzBA,GAASk9F,aAAa,IAAIf,GAAoB,0BAG9C,MAAMnyD,EAASjkD,KAAKwvH,0BAA0Bv1G,GAASgqC,QACvD,IAAIwrE,EACJ,IAGIA,QAAoBzvH,KAAK0vH,oBAAoB3oE,EAAQ9sC,GAAS6oF,WAAY,IACnE7oF,EACHgqC,WAEJhqC,GAASk9F,aAAa,IAAIf,GAAoB,kCAAmCqZ,IACjFA,EAAYnrH,KAAI,EAAGk/F,eAAgBA,EAAUn9F,aAAY8G,SAAQ2hD,IAC7D70C,GAAS6oF,WAAW9lF,IAAI8xC,EAAK,GAErC,CACA,MAAOroC,GAEH,MADAw9B,EAAO1kD,QACDknB,CACV,CACA,IACI,IAAIkpG,EAAS,EACb,MAAMxoG,EAAS,GACf,IAAK,MAAMmoC,KAAWmgE,EAAa,CAC/B,GAAIE,IAAW3vH,KAAK+uH,mBAEhB,MADA/uH,KAAKoL,IAAI,yEAA0EukH,EAAQ5oE,GACrF,IAAI8gB,GAAU,yCAExB8nD,IACA,IACI,MAAMp4D,QAAav3D,KAAKooD,WAAWg1D,iBAAiB5jD,KAAKlK,EAAQk0C,UAAW,IACrEvpF,EACHgqC,WAEJjkD,KAAKoL,IAAI,uBAAwBkkD,EAAQk0C,WAEzC,UACUxjG,KAAKooD,WAAW0N,UAAUzyC,MAAMk0C,EAAK7M,WAAY,CACnDo4C,WAAY,CACRvrC,EAAK0yC,YAET/hD,SAAU,CACN,CAAC6jE,IAAwB,GAAqBvhH,KAAKm2D,MAAMt6D,cAGrE,CACA,MAAOogB,GACHzmB,KAAKoL,IAAIoc,MAAM,gDAAiDu/B,EAAQtgC,EAC5E,CACA,OAAO8wC,CACX,CACA,MAAO9wC,GAEH,GADAzmB,KAAKoL,IAAIoc,MAAM,oBAAqB8nC,EAAQk0C,UAAW/8E,GACzC,MAAVsgC,EAEA,UACU/mD,KAAKooD,WAAW0N,UAAUzyC,MAAM0jC,EAAQ,CAC1CmB,SAAU,CACN,CAAC4jE,IAAwB,GAAqBthH,KAAKm2D,MAAMt6D,cAGrE,CACA,MAAOogB,GACHzmB,KAAKoL,IAAIoc,MAAM,gDAAiDu/B,EAAQtgC,EAC5E,CAGJ,GAAIw9B,EAAOQ,QACP,MAAM,IAAIkjB,GAAalhD,EAAIja,SAE/B2a,EAAO3mB,KAAKimB,EAChB,CACJ,CACA,GAAsB,IAAlBU,EAAO1lB,OACP,MAAM0lB,EAAO,GAEjB,MAAM,IAAIsyC,eAAetyC,EAAQ,6BACrC,CACA,QAEI88B,EAAO1kD,OACX,IACD,CACCwnD,SACAuxD,SAAUr+F,EAAQq+F,UAAYsX,GAC9B9sB,WAAY,IAAI3nD,IAAI2nD,EAAWx+F,KAAIy1D,GAAMA,EAAG1zD,cAC5C49C,OAAQhqC,EAAQgqC,OAChBkzD,WAAYl9F,EAAQk9F,YAE5B,CACA,yBAAAqY,CAA0BK,GAStB,OAPetC,GAAU,CACrBxkB,YAAYniF,QAAQ5mB,KAAKivH,aACzBjvH,KAAKkvH,mBAAmBjrE,OACxB4rE,GAKR,CAEA,yBAAMH,CAAoB3oE,EAAQ+7C,EAAa,IAAI3nD,IAAOlhC,EAAU,CAAC,GACjE,MAAM4rG,EAAQ,IAAI/iB,GAAYx+F,KAAIy1D,IAAM,CACpCypC,UAAW,GAAUzpC,GACrBmvC,aAAa,MAGjB,GAAc,MAAVniD,EAAgB,CAChB,GAAI/mD,KAAKooD,WAAWrB,OAAOzY,OAAOyY,GAC9B,MAAM,IAAI8gB,GAAU,sBAExB,IAAuE,UAA5D7nE,KAAKooD,WAAWwhE,gBAAgBE,eAAe/iE,IACtD,MAAM,IAAIyhE,GAAgB,sDAI9B,GAAqB,IAAjB3C,EAAMpkH,OAAc,CACpBzB,KAAKoL,IAAI,4BAA6B27C,GACtC,IACI,MAAMW,QAAa1nD,KAAKooD,WAAW0N,UAAU12D,IAAI2nD,GACjD8+D,EAAMrlH,QAAQknD,EAAK+7C,WACnBzjG,KAAKoL,IAAI,2BAA4B27C,EAAQ8+D,EAAMvhH,KAAI,EAAGk/F,eAAgBA,EAAUn9F,aACxF,CACA,MAAOogB,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACJ,CAGA,GAAqB,IAAjBo/F,EAAMpkH,OAAc,CACpBzB,KAAKoL,IAAI,mDAAoD27C,GAC7D,IACI,MAAM+R,QAAiB94D,KAAKooD,WAAW0nE,YAAYC,SAAShpE,GAC5D/mD,KAAKoL,IAAI,8CAA+C27C,EAAQ8+D,EAAMvhH,KAAI,EAAGk/F,eAAgBA,EAAUn9F,cACvGw/G,EAAMrlH,QAAQs4D,EAASgqC,WAAWx+F,KAAIk/F,IAAa,CAC/CA,YACA0F,aAAa,MAErB,CACA,MAAOziF,GACc,uBAAbA,EAAI1lB,MACJf,KAAKoL,IAAIoc,MAAM,0DAA2Du/B,EAAQtgC,EAE1F,CACJ,CACJ,CAGA,IAAIupG,SAA2BzzF,QAAQ6oB,IAAIygE,EAAMvhH,KAAI6oC,MAAO2hB,IACxD,MAAMh6C,QC9RXq4B,eAAiC4sB,EAAI9/C,GAExC,IAAIs4C,GAAa,EACjB,IAAK,MAAMxzD,KAAOi2D,GAAU9vD,OAExB,GADAqtD,EAAawH,EAAG1F,aAAarpC,SAASjsB,GAClCwzD,EACA,MAIR,IAAKA,EACD,MAAO,CAACwH,GAEZ,MAAMvb,QAAeub,EAAG71D,QAAQ+V,GAEhC,OADAA,EAAQ7O,IAAI,iBAAkB2uD,EAAIvb,EAAOl6C,KAAIy1D,GAAMA,EAAG1zD,cAC/Cm4C,CACX,CD8QiCyxE,CAAkBnhE,EAAK00C,UAAW,CACnDmQ,IAAK3zG,KAAKooD,WAAWurD,OAClB15F,EACH7O,IAAKpL,KAAKoL,MAEd,OAAsB,IAAlB0J,EAAOrT,QAAgBqT,EAAO,GAAGw5B,OAAOwgB,EAAK00C,WACtC10C,EAEJh6C,EAAOxQ,KAAIk/F,IAAa,CAC3BA,YACA0F,aAAa,KACd,MAEFmmB,OAEL,GAAc,MAAVtoE,EAAgB,CAChB,MAAMmpE,EAAkB,QAAQnpE,EAAO1gD,aACvC2pH,EAAoBA,EAAkB1rH,KAAIwqD,IACtC,MAAMqhE,EAAYrhE,EAAK00C,UAAUrvC,SAAS32B,MAE1C,OAAwB,IAApB2yF,GAAWnwG,KACJ8uC,EAGuB,MAA9BA,EAAK00C,UAAU9uC,YACR,CACH8uC,UAAW10C,EAAK00C,UAAUlvC,YAAY47D,GACtChnB,YAAap6C,EAAKo6C,aAGnBp6C,CAAI,GAEnB,CACA,MAAMshE,EAAgBJ,EAAkBnjH,QAAOiiD,IAE3C,GAAkF,MAA9E9uD,KAAKooD,WAAWg1D,iBAAiBiT,0BAA0BvhE,EAAK00C,WAChE,OAAO,EAKX,MAAM8sB,EAAaxhE,EAAK00C,UAAU9uC,YAClC,OAAc,MAAV3N,GAAgC,MAAdupE,GACXvpE,EAAOzY,OAAOgiF,EAEd,IAGTC,EAAe,IAAI1iF,IACzB,IAAK,MAAMihB,KAAQshE,EAAe,CAC9B,MAAM/M,EAAQv0D,EAAK00C,UAAUn9F,WACvBumG,EAAW2jB,EAAanxH,IAAIikH,GAClB,MAAZzW,EAIJ2jB,EAAajxH,IAAI+jH,EAAOv0D,GAHpB89C,EAAS1D,YAAc0D,EAAS1D,aAAep6C,EAAKo6C,cAAe,CAI3E,CACA,MAAMsnB,EAAoB,IAAID,EAAattH,UAE3C,GAAiC,IAA7ButH,EAAkB/uH,OAClB,MAAM,IAAIgnH,GAAsB,2CAEpC,MAAMgI,EAAY,GAClB,IAAK,MAAM3hE,KAAQ0hE,EAC0C,MAArDxwH,KAAKooD,WAAWwhE,gBAAgBG,yBAAmC/pH,KAAKooD,WAAWwhE,gBAAgBG,kBAAkBj7D,EAAK00C,YAG9HitB,EAAUjwH,KAAKsuD,GAEnB,MAAM4hE,EAAyC,MAAtB1wH,KAAK8uH,cAA6C2B,ED9P1EriH,KAAKq/G,IACLr/G,KAAKqgH,IACLrgH,KAAKsgH,IACLtgH,KAAKkgH,IC2PkFmC,EAAUriH,KAAKpO,KAAK8uH,eAE5G,GAAgC,IAA5B4B,EAAiBjvH,OACjB,MAAM,IAAI+mH,GAAgB,iEAI9B,OAFAxoH,KAAKoL,IAAI60F,MAAM,oCAAqCl5C,GAAU,eAAgBipE,EAAkB1rH,KAAI,EAAGk/F,eAAgBA,EAAUn9F,cACjIrG,KAAKoL,IAAI60F,MAAM,mCAAoCl5C,GAAU,eAAgB2pE,EAAiBpsH,KAAI,EAAGk/F,eAAgBA,EAAUn9F,cACxHqqH,CACX,CACA,gBAAMC,CAAWntB,EAAWvpF,EAAU,CAAC,GAC9BtY,MAAM2Q,QAAQkxF,KACfA,EAAY,CAACA,IAEjB,IACI,MAAMC,QAAkBzjG,KAAK0vH,yBAAoBxwH,EAAW,IAAIi8C,IAAIqoD,EAAUl/F,KAAIy1D,GAAMA,EAAG1zD,cAAc4T,GACzG,OAAuC,IAAnCA,EAAQouF,wBAIF,MAFC5E,EAAUnqE,MAAKw1B,IACV,GAAQ0zC,QAAQ1zC,EAAK00C,YAIzC,CACA,MAAO/8E,GACHzmB,KAAKoL,IAAI60F,MAAM,kDAAmDx5E,EACtE,CACA,OAAO,CACX,EE3XG,MAAMmqG,GAAa,aCJnB,MAAMC,WAAkBjE,GAC3B,GAAA3tH,CAAI8nD,GACA,OAA4B,MAArB/mD,KAAKs5B,KAAKytB,EACrB,CACA,IAAAztB,CAAKytB,GACD,OAAO/mD,KAAK+jC,MAAMzK,MAAKigF,GACZxyD,EAAOzY,OAAOirE,EAAIt/F,QAAQ8sC,SAEzC,mCCZJ,MAAM+pE,GAAiBnyH,OAAOa,UAAU6G,SAIlC0qH,GAAgB,IAAI51E,IAAI,CAC7B,gBACA,kBACA,kDACA,iDACA,cACA,yBACA,eACA,eCTM,MAAM,WAAmB38C,MAC/B,WAAA8Q,CAAY9C,GACX4jC,QAEI5jC,aAAmBhO,OACtBwB,KAAKgxH,cAAgBxkH,IACnBA,WAAWA,KAEbxM,KAAKgxH,cAAgB,IAAIxyH,MAAMgO,GAC/BxM,KAAKgxH,cAAcvqH,MAAQzG,KAAKyG,OAGjCzG,KAAKe,KAAO,aACZf,KAAKwM,QAAUA,CAChB,EAGD,MAAMykH,GAA0B,CAACzpG,EAAO0pG,EAAej3G,KAEtD,MAAMk3G,EAAcl3G,EAAQ4iB,SAAWq0F,EAAgB,GAIvD,OAFA1pG,EAAM0pG,cAAgBA,EACtB1pG,EAAM2pG,YAAcA,EACb3pG,CAAK,EClBN,MAAM4pG,GACThmH,IACA24B,MACAikE,QACAlyC,UACAj5B,QACAw0F,cACAC,cACA9oE,kBACA1nD,OACA,WAAAwO,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,0BAC1CngG,KAAK81D,UAAY1N,EAAW0N,UAC5B91D,KAAKwoD,kBAAoBJ,EAAWI,kBACpCxoD,KAAK+jC,MAAQ,IAAI8sF,GAAU,CACvB5X,YAAaptG,EAAK0lH,uBdIS,EcH3B1E,WAAY,yBACZnuB,QAASt2C,EAAWs2C,UAExB1+F,KAAKgoG,SAAU,EACfhoG,KAAK68B,QAAUhxB,EAAKgxB,SAAW,EAC/B78B,KAAKsxH,cAAgBzlH,EAAKylH,cAC1BtxH,KAAKqxH,cAAgBxlH,EAAKwlH,cAC1BrxH,KAAKc,OAASsnD,EAAWtnD,OACzBsnD,EAAWtnD,OAAOsjD,iBAAiB,mBAAoB9jD,IACnDN,KAAKwxH,eAAelxH,EAAIqnD,QACnBrkB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,uCAAwClnB,EAAIqnD,OAAQlhC,EAAI,GACzE,GAEV,CACA,oBAAM+qG,CAAezqE,GACjB,IAAK/mD,KAAKgoG,QACN,OAEJ,MAAMtgD,QAAa1nD,KAAK81D,UAAU12D,IAAI2nD,GACjC0qE,GAAgB/pE,KAGjB1nD,KAAK+jC,MAAM9kC,IAAI8nD,IAGnB/mD,KAAK+jC,MAAM/mB,KAAImwB,MAAOlzB,UDrBfkzB,eAAsBpX,EAAO9b,GAC3C,OAAO,IAAIsiB,SAAQ,CAACr4B,EAASs4B,KAC5BviB,EAAU,IAAIA,GACdA,EAAQy3G,kBAAoB,OAC5Bz3G,EAAQ03G,cAAgB,KAAM,EAC9B13G,EAAQ4iB,UAAY,GAEpB,MAAMD,EAAYpW,GAAMoW,UAAU3iB,GAE5B69F,EAAe,KACpBl7E,EAAUtW,OACVkW,EAAOviB,EAAQgqC,QAAQyb,OAAO,EAG3BzlD,EAAQgqC,SAAWhqC,EAAQgqC,OAAOQ,SACrCxqC,EAAQgqC,OAAOG,iBAAiB,QAAS0zD,EAAc,CAAC/3G,MAAM,IAG/D,MAAMy1G,EAAU,KACfv7F,EAAQgqC,QAAQK,oBAAoB,QAASwzD,GAC7Cl7E,EAAUtW,MAAM,EAGjBsW,EAAU7V,SAAQomB,UACjB,IACC,MAAMr4B,QAAeihB,EAAMm7F,GAC3B1b,IACAtxG,EAAQ4Q,EACT,CAAE,MAAO0S,GACR,IACC,KAAMA,aAAiBhpB,OACtB,MAAM,IAAI4B,UAAU,0BAA0BonB,qCAG/C,GAAIA,aAAiB,GACpB,MAAMA,EAAMwpG,cAGb,GAAIxpG,aAAiBpnB,YDpDX,SAAwBonB,GAbvBxoB,MAmBf,SALgBwoB,IAdDxoB,EAeHwoB,EAf2C,mBAA/BspG,GAAe7vH,KAAKjC,KAgBzB,cAAfwoB,EAAMzmB,MACmB,iBAAlBymB,EAAMhb,WAQK,gBAAlBgb,EAAMhb,aACctN,IAAhBsoB,EAAM/gB,MAGPsqH,GAAc9xH,IAAIuoB,EAAMhb,SAChC,CCmCwColH,CAAepqG,GACjD,MAAMA,EAYP,GATAypG,GAAwBzpG,EAAO0pG,EAAej3G,SAElCA,EAAQ03G,YAAYnqG,KAC/BoV,EAAUtW,OACVkW,EAAOhV,UAGFvN,EAAQy3G,gBAAgBlqG,IAEzBoV,EAAUpW,MAAMgB,GACpB,MAAMoV,EAAUvV,WAElB,CAAE,MAAOwqG,GACRZ,GAAwBY,EAAYX,EAAej3G,GACnDu7F,IACAh5E,EAAOq1F,EACR,CACD,IACC,GAEJ,CCxCkBC,EAAO3kF,MAAOpmB,IAChB,GAAK/mB,KAAKgoG,QAGV,UACUhoG,KAAKwoD,kBAAkB26C,eAAep8C,EAAQ,CAChD9C,OAAQhqC,GAASgqC,QAEzB,CACA,MAAOx9B,GAEH,MADAzmB,KAAKoL,IAAI,kDAAmD27C,EAAQhgC,EAAS/mB,KAAK68B,QAASpW,GACrFA,CACV,IACD,CACCw9B,OAAQhqC,GAASgqC,OACjBpnB,QAAS78B,KAAK68B,QACdE,OAAQ/8B,KAAKsxH,cACbt0F,WAAYh9B,KAAKqxH,eACnB,GACH,CACCtqE,WAECzjB,OAAM6J,MAAO1mB,IACdzmB,KAAKoL,IAAIoc,MAAM,iCAAkCu/B,EAAQtgC,GACzD,MAAMqxC,EAAO,CAAC,EACd,IAAIpQ,EAAKoQ,KAAK5yD,QAAQiI,SAAQpO,IACtBA,EAAIwtB,WAAWqkG,MACf94D,EAAK/4D,QAAOG,EAChB,UAEEc,KAAK81D,UAAUzyC,MAAM0jC,EAAQ,CAC/B+Q,SAEJ93D,KAAKc,OAAOyrD,kBAAkB,yBAA0B,CACpD5E,OAAQZ,GACV,IAEDzjB,OAAM6J,MAAO1mB,IACdzmB,KAAKoL,IAAIoc,MAAM,+CAAgDu/B,EAAQtgC,EAAI,IAEnF,CACA,KAAAzf,GACIhH,KAAKgoG,SAAU,CACnB,CACA,gBAAMohB,GAEG7sF,QAAQr4B,UACRq/B,MAAK4J,UACN,MAAM4kF,QAAuB/xH,KAAK81D,UAAU1Q,IAAI,CAC5C8/D,QAAS,CACJx9D,GAAS+pE,GAAgB/pE,YAG5BnrB,QAAQ6oB,IAAI2sE,EAAeztH,KAAI6oC,MAAOua,UAClC1nD,KAAKwoD,kBAAkB26C,eAAez7C,EAAKh3C,IAC5C4yB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GACrB,IACH,IAEF6c,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GAE3B,CACA,IAAAH,GACItmB,KAAKgoG,SAAU,EACfhoG,KAAK+jC,MAAMggC,OACf,EAEJ,SAAS0tD,GAAgB/pE,GACrB,IAAK,MAAM7U,KAAO6U,EAAKoQ,KAAK5yD,OACxB,GAAI2tC,EAAItmB,WAAWqkG,IACf,OAAO,EAGf,OAAO,CACX,CCpHO,MAAMhB,GAAwB,GAS9B,MAAMoC,GACThqB,QACA5hD,YACAykE,MACAoH,KACAC,8BACAC,2BACAC,2BACAxH,eACAyH,UACAC,eACAC,iBACAC,6BACA18D,UACA4oC,QACA59F,OACAsK,IACA27C,OACA,WAAAz3C,CAAY84C,EAAYv8C,EAAO,CAAC,GAE5B,GADA7L,KAAK4qH,eAAiB/+G,EAAK++G,gBhBnCJ,IgBoCnB5qH,KAAK4qH,eAAiB,EACtB,MAAM,IAAI,GAAuB,4DAKrC5qH,KAAKomD,YAAc,IAAImkE,GACvBvqH,KAAKgoG,SAAU,EACfhoG,KAAK+mD,OAASqB,EAAWrB,OACzB/mD,KAAK81D,UAAY1N,EAAW0N,UAC5B91D,KAAK0+F,QAAUt2C,EAAWs2C,QAC1B1+F,KAAKc,OAASsnD,EAAWtnD,OACzBd,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,6BAC1CngG,KAAKyyH,UAAYzyH,KAAKyyH,UAAUr2F,KAAKp8B,MACrCA,KAAK0yH,aAAe1yH,KAAK0yH,aAAat2F,KAAKp8B,MAE3CA,KAAK6qH,OAASh/G,EAAKg/G,OAAS,IAAIvmH,KAAIy1D,GAAM,GAAUA,KACpD/5D,KAAKiyH,MAAQpmH,EAAKomH,MAAQ,IAAI3tH,KAAIy1D,GAAM,GAAUA,KAClD/5D,KAAKmyH,2BAA6B,EAClCnyH,KAAKkyH,8BAAgCrmH,EAAKqmH,+BfpCF,GeqCxClyH,KAAKoyH,2BAA6B,EAElCpyH,KAAKwyH,6BAA+B,IAAIlnB,GAAY,CAChDn0B,OAAQtrE,EAAK8mH,4Bf5CmB,Ee6ChCnnB,SAAU,IAGdxrG,KAAKuyH,iBAAmB,IAAIzH,GAAiB,CACzCtiE,kBAAmBxoD,KACnB81D,UAAW1N,EAAW0N,UACtBh1D,OAAQsnD,EAAWtnD,OACnB08C,OAAQ4K,EAAW5K,QACpB,CACCotE,eAAgB5qH,KAAK4qH,eACrBC,MAAO7qH,KAAK6qH,QAEhB7qH,KAAKqyH,UAAY,IAAIxD,GAAUzmE,EAAY,CACvC0mE,cAAejjH,EAAKijH,cACpBv2D,iBAAkB1sD,EAAK0sD,kBhBtED,GgBuEtBy2D,mBAAoBnjH,EAAKmjH,oBfjCA,IekCzBD,mBAAoBljH,EAAKkjH,oBfjEC,GekE1BE,YAAapjH,EAAKojH,af9EF,Ie+EhBj6D,UAAWnpD,EAAKmpD,WAAa,CACzBy+C,QAASmJ,IAEbx2D,YAAapmD,KAAKomD,cAEtBpmD,KAAKsyH,eAAiB,IAAIlB,GAAe,CACrCtwH,OAAQsnD,EAAWtnD,OACnBg1D,UAAW1N,EAAW0N,UACtBtY,OAAQ4K,EAAW5K,OACnBgL,kBAAmBxoD,MACpB,CACC68B,QAAShxB,EAAK+mH,iBACdvB,cAAexlH,EAAKgnH,uBACpBvB,cAAezlH,EAAKinH,uBACpBvB,sBAAuB1lH,EAAK0lH,uBAEpC,CACA,CAAC9tF,OAAOqB,aAAe,6BAKvB,WAAM99B,GAEFhH,KAAK0+F,SAASouB,oBAAoB,wCAAyC,CACvEC,UAAW,KACP,MAAMgG,EAAS,CACXC,QAAS,EACT,kBAAmBhzH,KAAKmyH,2BACxBc,SAAU,EACV,mBAAoBjzH,KAAKoyH,4BAE7B,IAAK,MAAMc,KAASlzH,KAAKomD,YAAYnjD,SACjC,IAAK,MAAMs0D,KAAQ27D,EACfH,EAAOx7D,EAAKq3C,aAGpB,OAAOmkB,CAAM,IAIrB/yH,KAAK0+F,SAASouB,oBAAoB,gCAAiC,CAC/DtW,MAAO,WACPuW,UAAW,KACP,MAAMgG,EAAS,CAAC,EAChB,IAAK,MAAMG,KAASlzH,KAAKomD,YAAYnjD,SACjC,IAAK,MAAMs0D,KAAQ27D,EACf,IAAK,MAAMjtE,KAAUsR,EAAKzP,QAAS,CAC/B,MAAM/oD,EAAM,GAAGknD,EAAO2oD,aAAa3oD,EAAO8B,UAAY,iBACtDgrE,EAAOh0H,IAAQg0H,EAAOh0H,IAAQ,GAAK,CACvC,CAGR,OAAOg0H,CAAM,IAIrB/yH,KAAK0+F,SAASouB,oBAAoB,4EAA6E,CAC3GtW,MAAO,WACPuW,UAAW,KACP,MAAMoG,EAAa,CAAC,EACpB,IAAK,MAAMD,KAASlzH,KAAKomD,YAAYnjD,SACjC,IAAK,MAAMs0D,KAAQ27D,EAAO,CACtB,MAAMprE,EAAU,CAAC,EACjB,IAAK,MAAM7B,KAAUsR,EAAKzP,QAAS,CAC/B,MAAM/oD,EAAM,GAAGknD,EAAO2oD,aAAa3oD,EAAO8B,UAAY,iBACtDD,EAAQ/oD,IAAQ+oD,EAAQ/oD,IAAQ,GAAK,CACzC,CACA,IAAK,MAAOgpD,EAAUtgC,KAAU9oB,OAAOmxD,QAAQhI,GAC3CqrE,EAAWprE,GAAYorE,EAAWprE,IAAa,GAC/CorE,EAAWprE,GAAUvnD,KAAKinB,EAElC,CAEJ,MAAMsrG,EAAS,CAAC,EAChB,IAAK,IAAKhrE,EAAUzgC,KAAW3oB,OAAOmxD,QAAQqjE,GAAa,CACvD7rG,EAASA,EAAOlZ,MAAK,CAACuS,EAAGC,IAAMD,EAAIC,IACnC,MAAM/V,EAAQ5B,KAAK6a,MAAsB,GAAhBwD,EAAO7lB,QAChCsxH,EAAOhrE,GAAYzgC,EAAOzc,EAC9B,CACA,OAAOkoH,CAAM,IAGrB/yH,KAAKc,OAAOsjD,iBAAiB,kBAAmBpkD,KAAKyyH,WACrDzyH,KAAKc,OAAOsjD,iBAAiB,mBAAoBpkD,KAAK0yH,oBxBnKvDvlF,kBAAwBimF,GAC3B,MAAMC,EAAa,GACnB,IAAK,MAAM9gH,KAAO6gH,EACVpL,GAAYz1G,IACZ8gH,EAAW7yH,KAAK+R,SAGlBgqB,QAAQ6oB,IAAIiuE,EAAW/uH,KAAI6oC,MAAOpqC,IACf,MAAjBA,EAAEomH,mBACIpmH,EAAEomH,aACZ,WAEE5sF,QAAQ6oB,IAAIiuE,EAAW/uH,KAAI6oC,MAAOpqC,UAC9BA,EAAEiE,OAAO,WAEbu1B,QAAQ6oB,IAAIiuE,EAAW/uH,KAAI6oC,MAAOpqC,IAChB,MAAhBA,EAAEqmH,kBACIrmH,EAAEqmH,YACZ,IAER,CwBgJcpiH,CAAMhH,KAAKqyH,UAAWryH,KAAKsyH,eAAgBtyH,KAAKuyH,kBACtDvyH,KAAKgoG,SAAU,EACfhoG,KAAKoL,IAAI,UACb,CAIA,UAAMkb,GACFtmB,KAAKc,OAAOwjD,oBAAoB,kBAAmBtkD,KAAKyyH,WACxDzyH,KAAKc,OAAOwjD,oBAAoB,mBAAoBtkD,KAAK0yH,oBxBxJ1DvlF,kBAAuBimF,GAC1B,MAAMC,EAAa,GACnB,IAAK,MAAM9gH,KAAO6gH,EACVpL,GAAYz1G,IACZ8gH,EAAW7yH,KAAK+R,SAGlBgqB,QAAQ6oB,IAAIiuE,EAAW/uH,KAAI6oC,MAAOpqC,IAChB,MAAhBA,EAAEsmH,kBACItmH,EAAEsmH,YACZ,WAEE9sF,QAAQ6oB,IAAIiuE,EAAW/uH,KAAI6oC,MAAOpqC,UAC9BA,EAAEujB,MAAM,WAEZiW,QAAQ6oB,IAAIiuE,EAAW/uH,KAAI6oC,MAAOpqC,IACjB,MAAfA,EAAEumH,iBACIvmH,EAAEumH,WACZ,IAER,CwBqIchjG,CAAKtmB,KAAKsyH,eAAgBtyH,KAAKqyH,UAAWryH,KAAKuyH,kBAErD,MAAMe,EAAQ,GACd,IAAK,MAAMC,KAAkBvzH,KAAKomD,YAAYnjD,SAC1C,IAAK,MAAMqkD,KAAcisE,EACrBD,EAAM9yH,KAAK,WACP,UACU8mD,EAAW0hD,OACrB,CACA,MAAOviF,GACHzmB,KAAKoL,IAAIoc,MAAMf,EACnB,CACH,EAPU,IAUnBzmB,KAAKoL,IAAI,yBAA0BkoH,EAAM7xH,cACnC86B,QAAQ6oB,IAAIkuE,GAClBtzH,KAAKomD,YAAY7mD,QACjBS,KAAKoL,IAAI,UACb,CACA,SAAAqnH,CAAUnyH,GACDN,KAAKwzH,WAAWlzH,GAAKgjC,OAAM7c,IAC5BzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GAE3B,CAIA,gBAAM+sG,CAAWlzH,GACb,MAAQqnD,OAAQL,GAAehnD,EAC/B,IAAKN,KAAKgoG,QAGN,kBADM1gD,EAAW0hD,QAGrB,GAA0B,SAAtB1hD,EAAWl3B,OAGX,OAEJ,MAAM22B,EAASO,EAAWoD,WACpB+oE,GAAazzH,KAAKomD,YAAYnnD,IAAI8nD,GAClC2sE,EAAc1zH,KAAKomD,YAAYhnD,IAAI2nD,IAAW,GACpD2sE,EAAYlzH,KAAK8mD,GACjBtnD,KAAKomD,YAAY9mD,IAAIynD,EAAQ2sE,GAEL,MAApB3sE,EAAOsiB,WAAqC,QAAhBtiB,EAAO5hD,YAC7BnF,KAAK81D,UAAU2zC,MAAM1iD,EAAQ,CAC/BsiB,UAAWtiB,EAAOsiB,YAGtBoqD,GACAzzH,KAAKc,OAAOyrD,kBAAkB,eAAgB,CAAE5E,OAAQL,EAAWoD,YAE3E,CAIA,YAAAgoE,CAAapyH,GACT,MAAQqnD,OAAQL,GAAehnD,EACzBymD,EAASO,EAAWoD,WAGpBipE,GAFY3zH,KAAKomD,YAAYhnD,IAAI2nD,IAAW,IAEdl6C,QAAO0qD,GAAQA,EAAK7mD,KAAO42C,EAAW52C,KAE1E1Q,KAAKomD,YAAY9mD,IAAIynD,EAAQ4sE,GACI,IAA7BA,EAAkBlyH,SAElBzB,KAAKoL,IAAI,kDAAmD27C,GAC5D/mD,KAAKomD,YAAYc,OAAOH,GAExB/mD,KAAKc,OAAOyrD,kBAAkB,kBAAmB,CAAE5E,OAAQL,EAAWoD,aAE9E,CACA,cAAAhE,CAAeK,GACX,GAAc,MAAVA,EACA,OAAO/mD,KAAKomD,YAAYhnD,IAAI2nD,IAAW,GAE3C,IAAImsE,EAAQ,GACZ,IAAK,MAAM/rH,KAAKnH,KAAKomD,YAAYnjD,SAC7BiwH,EAAQA,EAAM9xH,OAAO+F,GAEzB,OAAO+rH,CACX,CACA,iBAAAU,GACI,OAAO5zH,KAAKomD,WAChB,CACA,oBAAM+8C,CAAegsB,EAAmBl1G,EAAU,CAAC,GAC/C,IAAKja,KAAKgoG,QACN,MAAM,IAAIpgC,GAAgB,eAE9B5nE,KAAKoyH,6BACL,IACIn4G,EAAQgqC,QAAQC,iBAChB,MAAM,OAAE6C,GAAWyjE,GAAe2E,GAClC,GAAInvH,KAAK+mD,OAAOzY,OAAOyY,GACnB,MAAM,IAAIsgB,GAAmB,qBAEjC,GAAc,MAAVtgB,IAAoC,IAAlB9sC,EAAQq1G,MAAgB,CAC1CtvH,KAAKoL,IAAI,UAAW27C,GACpB,MAAMqoE,EAAqBpvH,KAAK0mD,eAAeK,GAC1CztB,MAAKi+B,GAAuB,MAAfA,EAAKpkB,SACvB,GAA0B,MAAtBi8E,EAGA,OAFApvH,KAAKoL,IAAI,+CAAgD27C,GACzD9sC,EAAQk9F,aAAa,IAAIf,GAAoB,iCACtCgZ,CAEf,CACA,MAAM9nE,QAAmBtnD,KAAKqyH,UAAU74D,KAAK21D,EAAmB,IACzDl1G,EACHq+F,SAAUr+F,EAAQq+F,UAAYsX,KAElC,GAA0B,SAAtBtoE,EAAWl3B,OACX,MAAM,IAAI22C,GAAsB,2CAEpC,IAAI8sD,EAAkB7zH,KAAKomD,YAAYhnD,IAAIkoD,EAAWoD,YAC/B,MAAnBmpE,IACAA,EAAkB,GAClB7zH,KAAKomD,YAAY9mD,IAAIgoD,EAAWoD,WAAYmpE,IAKhD,IAAIC,GAAoB,EACxB,IAAK,MAAMv8D,KAAQs8D,EAKf,GAJIt8D,EAAK7mD,KAAO42C,EAAW52C,KACvBojH,GAAoB,IAGF,IAAlB75G,EAAQq1G,OAAkB/3D,EAAK7mD,KAAO42C,EAAW52C,IAAM6mD,EAAK0yC,WAAW37D,OAAOgZ,EAAW2iD,YAGzF,OAFA3iD,EAAWyc,MAAM,IAAIuD,GAAsB,mCAEpC/P,EAMf,OAHKu8D,GACDD,EAAgBrzH,KAAK8mD,GAElBA,CACX,CACA,QACItnD,KAAKoyH,4BACT,CACJ,CACA,sBAAM2B,CAAiBhtE,EAAQ9sC,EAAU,CAAC,GACtC,MAAMmsC,EAAcpmD,KAAKomD,YAAYhnD,IAAI2nD,IAAW,SAC9CxqB,QAAQ6oB,IAAIgB,EAAY9hD,KAAI6oC,MAAOma,IACrC,UACUA,EAAW0hD,MAAM/uF,EAC3B,CACA,MAAOwM,GACH6gC,EAAWyc,MAAMt9C,EACrB,KAER,CACA,8BAAMutG,CAAyBvd,GAK3B,GAHuBz2G,KAAKiyH,KAAKr3D,MAAKb,GAC3B08C,EAAOxM,WAAW5jG,WAAWkmB,WAAWwtC,EAAG1zD,cAIlD,OADArG,KAAKoL,IAAI,0EAA2EqrG,EAAOxM,aACpF,EAMX,GAHwBjqG,KAAK6qH,MAAMjwD,MAAKb,GAC7B08C,EAAOxM,WAAW5jG,WAAWkmB,WAAWwtC,EAAG1zD,cAIlD,OADArG,KAAKmyH,8BACE,EAGX,GAAInyH,KAAKmyH,6BAA+BnyH,KAAKkyH,8BAEzC,OADAlyH,KAAKoL,IAAI,2EAA4EqrG,EAAOxM,aACrF,EAEX,GAAIwM,EAAOxM,WAAW/0C,qBAAsB,CACxC,MAAMvB,EAAO8iD,EAAOxM,WAAWh1C,cAAc3F,QAC7C,UACUtvD,KAAKwyH,6BAA6BpzE,QAAQuU,EAAM,EAC1D,CACA,MAEI,OADA3zD,KAAKoL,IAAI,8EAA+EqrG,EAAOxM,WAAYt2C,IACpG,CACX,CACJ,CACA,OAAI3zD,KAAK0mD,iBAAiBjlD,OAASzB,KAAK4qH,gBACpC5qH,KAAKmyH,8BACE,IAEXnyH,KAAKoL,IAAI,uDAAwDqrG,EAAOxM,aACjE,EACX,CACA,mBAAAgqB,GACIj0H,KAAKmyH,4BACT,CACA,YAAA+B,GACI,MAAMC,EAAY,CACdtiG,OAAQ,SACRm7F,QAAS,SACToH,QAAS,QACTC,SAAU,WAEd,OAAOr0H,KAAKqyH,UAAUtuF,MAAMA,MAAMz/B,KAAIi1G,IAC3B,CACH7oG,GAAI6oG,EAAI7oG,GACR0f,OAAQ+jG,EAAU5a,EAAInpF,QACtB22B,OAAQwyD,EAAIt/F,QAAQ8sC,OACpB+7C,WAAY,IAAIyW,EAAIt/F,QAAQ6oF,YAAYx+F,KAAIy1D,GAAM,GAAUA,QAGxE,CACA,gBAAM42D,CAAWntB,EAAWvpF,EAAU,CAAC,GACnC,OAAOja,KAAKqyH,UAAU1B,WAAWntB,EAAWvpF,EAChD,EClYG,MAAMq6G,GACTC,cACAC,SACAC,UACAC,SACAC,SACAC,aACA,WAAAtlH,CAAYqlH,GACR30H,KAAK20H,SAAWA,EAChB30H,KAAKu0H,cAAgB,EACrBv0H,KAAKw0H,SAAW,EAChBx0H,KAAKy0H,UAAY,EACjBz0H,KAAK00H,SAAW,CACpB,CACA,KAAAG,CAAM13G,EAAG23G,GACL,OAAO,EAAK7rH,KAAK8rH,MAAM53G,EAAI23G,GAAM90H,KAAK20H,SAC1C,CACA,IAAAn0H,CAAKxB,EAAOg2H,EAAOxqH,KAAKm2D,OACpB,GAAyB,MAArB3gE,KAAK40H,aAAsB,CAE3B,MAAMj0G,EAAI3gB,KAAK60H,MAAMG,EAAMh1H,KAAK40H,cAC1BlqH,EAAO1L,EAAQgB,KAAKu0H,cACpBU,EAAOt0G,EAAIjW,EACjB1K,KAAKu0H,cAAgB5zG,EAAI3hB,GAAS,EAAI2hB,GAAK3gB,KAAKu0H,cAEhDv0H,KAAKw0H,UAAY,EAAI7zG,IAAM3gB,KAAKw0H,SAAW9pH,EAAOuqH,GAClDj1H,KAAKy0H,UAAYxrH,KAAK4qE,KAAK7zE,KAAKw0H,UAEhCx0H,KAAK00H,SAAW10H,KAAKu0H,cAAgB5zG,EAAIjW,CAC7C,MAEI1K,KAAKu0H,cAAgBv1H,EAEzBgB,KAAK40H,aAAeI,CACxB,EClCG,MAAME,GACTnrE,QACAC,QACA3hD,KACA0qH,OACAoC,kBACAC,kBACAp4F,WACA,WAAA1tB,CAAYzD,EAAO,CAAC,GAChB7L,KAAK+pD,QAAU,IAAIuqE,GAAczoH,EAAK8pD,UAAY,KAClD31D,KAAKgqD,QAAU,IAAIsqE,GAAczoH,EAAK8pD,UAAY,KAClD31D,KAAKqI,KAAO,IAAIisH,GAAczoH,EAAK8pD,UAAY,KAC/C31D,KAAKo1H,kBAAoBvpH,EAAKupH,mBAdI,EAelCp1H,KAAKm1H,kBAAoBtpH,EAAKspH,mBAhBI,IAiBlCn1H,KAAKg9B,WAAanxB,EAAKmxB,YAfI,IAgBJ,MAAnBnxB,EAAKghH,aACL7sH,KAAK+yH,OAASlnH,EAAK6yF,SAASouB,oBAAoBjhH,EAAKghH,YAE7D,CACA,gBAAAwI,CAAiBp7G,EAAU,CAAC,GAGxB,MAAM2M,EAAU3d,KAAK1K,IAAI0K,KAAKuuB,MAAMx3B,KAAKqI,KAAKksH,eAAiBt6G,EAAQq7G,eAAiBt1H,KAAKm1H,oBAAqBn1H,KAAKg9B,YACjHu4F,EAAcxsB,YAAYniF,QAAQA,GAClC4uG,EAAgBjI,GAAU,CAACtzG,EAAQgqC,OAAQsxE,IAIjD,OAFAC,EAAcxuH,MAAQwD,KAAKm2D,MAC3B60D,EAAc5uG,QAAUA,EACjB4uG,CACX,CACA,OAAAhgB,CAAQvxD,GACJ,MAAM+wE,EAAOxqH,KAAKm2D,MAAQ1c,EAAOj9C,MAC7Bi9C,EAAOQ,SACPzkD,KAAKgqD,QAAQxpD,KAAKw0H,GAClBh1H,KAAKqI,KAAK7H,KAAKw0H,EAAOh1H,KAAKo1H,mBAC3Bp1H,KAAK+yH,QAAQj0H,OAAO,CAChB22H,qBAAsBz1H,KAAKgqD,QAAQuqE,cACnCmB,iBAAkB11H,KAAKgqD,QAAQyqE,UAC/BkB,gBAAiB31H,KAAKgqD,QAAQ0qE,SAC9BkB,gBAAiB51H,KAAKgqD,QAAQwqE,SAC9BxqE,QAASgrE,MAIbh1H,KAAK+pD,QAAQvpD,KAAKw0H,GAClBh1H,KAAKqI,KAAK7H,KAAKw0H,GACfh1H,KAAK+yH,QAAQj0H,OAAO,CAChB+2H,qBAAsB71H,KAAK+pD,QAAQwqE,cACnCuB,iBAAkB91H,KAAK+pD,QAAQ0qE,UAC/BsB,gBAAiB/1H,KAAK+pD,QAAQ2qE,SAC9BsB,gBAAiBh2H,KAAK+pD,QAAQyqE,SAC9BzqE,QAASirE,IAGrB,EClDG,MAAMiB,GACTluE,SACAK,WACAh9C,IACA8qH,kBACAC,eACAC,gBACAxvG,QACAyvG,6BACA,WAAA/mH,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKooD,WAAaA,EAClBpoD,KAAK+nD,SAAW,IAAIl8C,EAAK08F,gBAdT,oBAehBvoG,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,6BAC1CngG,KAAKm2H,eAAiBtqH,EAAKyqH,cAnBF,IAoBzBt2H,KAAKq2H,6BAA+BxqH,EAAKwqH,+BAfA,EAgBzCr2H,KAAK4mB,QAAU,IAAIsuG,GAAgB,IAC3BrpH,EAAK0qH,aAAe,CAAC,EACzB73B,QAASt2C,EAAWs2C,QACpBmuB,WAAY,oDAEpB,CACA,CAACppF,OAAOqB,aAAe,6BACvB,CAACgqD,IAAuB,CACpB,8BAEJ,KAAA9nF,GACIhH,KAAKo2H,gBAAkB,IAAI3mB,gBACDzvG,KAAKo2H,gBAAgBnyE,OAC/CjkD,KAAKk2H,kBAAoBtgE,aAAY,KACjC51D,KAAKooD,WAAWI,kBAAkB9B,iBAAiBv5C,SAAQoqD,IACvDh7B,QAAQr4B,UAAUq/B,MAAK4J,UACnB,IAAInmC,EAAQwD,KAAKm2D,MACjB,IACI,MAAM1c,EAASjkD,KAAK4mB,QAAQyuG,iBAAiB,CACzCpxE,OAAQjkD,KAAKo2H,iBAAiBnyE,SAM5BuyE,EAAK1mC,SAJUv4B,EAAK/P,UAAUxnD,KAAK+nD,SAAU,CAC/C9D,SACAokD,wBAAwB,KAG5BrhG,EAAQwD,KAAKm2D,YACPpkC,QAAQ6oB,IAAI,CACdoxE,EAAG9mH,MAAM,GA7CjB,IA6C2C,CAC/Bu0C,WAEJuyE,EAAGt5G,KAhDX,GAgD6B,CACjB+mC,aAGRsT,EAAKk/D,IAAMjsH,KAAKm2D,MAAQ35D,QAClBwvH,EAAGvmC,SAAS+Y,MAAM,CACpB/kD,UAER,CACA,MAAOx9B,GACH,GAAiB,6BAAbA,EAAI1lB,KACJ,MAAM0lB,EAMV8wC,EAAKk/D,KAAOjsH,KAAKm2D,MAAQ35D,GAAS,CACtC,KAECs8B,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,yBAA0Bf,GACrCzmB,KAAKq2H,8BACLr2H,KAAKoL,IAAIoc,MAAM,2CACf+vC,EAAKwM,MAAMt9C,IAGXzmB,KAAKoL,IAAI,oFACb,GACF,GACJ,GACHpL,KAAKm2H,eACZ,CACA,IAAA7vG,GACItmB,KAAKo2H,iBAAiBryD,QACQ,MAA1B/jE,KAAKk2H,mBACLjgE,cAAcj2D,KAAKk2H,kBAE3B,EC1FG,MAAMQ,GACTC,QACA3uB,QACA5/C,WACA,WAAA94C,CAAY84C,EAAYv8C,GACpB7L,KAAK22H,QAAU9qH,EAAK8qH,SAAW,GAC/B32H,KAAKgoG,SAAU,EACfhoG,KAAKooD,WAAaA,CACtB,CACA,CAAC3kB,OAAOqB,aAAe,0BACvB,SAAAy3B,GACI,OAAOv8D,KAAKgoG,OAChB,CACA,WAAMhhG,GACFhH,KAAKgoG,SAAU,CACnB,CACA,UAAM1hF,GACFtmB,KAAKgoG,SAAU,CACnB,CAIA,mBAAO4uB,CAAc73H,EAAKkb,EAAU,CAAC,GACjC,GAA4B,IAAxBja,KAAK22H,QAAQl1H,OACb,MAAM,IAAI0mH,GAAsB,gCAEpC,MAAM79G,EAAOtK,KACP62H,EAAO,IAAIrY,GACjB,UAAW,MAAM92D,KAAQ,MAASp9C,EAAKqsH,QAAQryH,KAAIwyH,GAAUA,EAAOF,cAAc73H,EAAKkb,MAGvE,MAARytC,IAIAA,EAAKo7C,WAAWrhG,OAAS,SACnBzB,KAAKooD,WAAW0N,UAAUzyC,MAAMqkC,EAAKh3C,GAAI,CAC3CoyF,WAAYp7C,EAAKo7C,aAIrB+zB,EAAK53H,IAAIyoD,EAAKh3C,MAGlBmmH,EAAK75G,IAAI0qC,EAAKh3C,UACRg3C,GAEd,CAKA,aAAMqvE,CAAQh4H,EAAKkb,EAAU,CAAC,GAC1B,GAA4B,IAAxBja,KAAK22H,QAAQl1H,OACb,MAAM,IAAI0mH,GAAsB,sCAE9B5rF,QAAQ6oB,IAAIplD,KAAK22H,QAAQryH,KAAI6oC,MAAO2pF,UAChCA,EAAOC,QAAQh4H,EAAKkb,EAAQ,IAE1C,CAIA,SAAMorG,CAAItmH,EAAKC,EAAOib,GAClB,IAAKja,KAAKu8D,YACN,MAAM,IAAIqL,SAERrrC,QAAQ6oB,IAAIplD,KAAK22H,QAAQryH,KAAI6oC,MAAO2pF,UAChCA,EAAOzR,IAAItmH,EAAKC,EAAOib,EAAQ,IAE7C,CAKA,SAAM7a,CAAIL,EAAKkb,GACX,IAAKja,KAAKu8D,YACN,MAAM,IAAIqL,GAEd,OAAOrrC,QAAQgjC,IAAIv/D,KAAK22H,QAAQryH,KAAI6oC,MAAO2pF,GAChCA,EAAO13H,IAAIL,EAAKkb,KAE/B,ECnFG,MAAM+8G,GACTC,GACAnhH,EACAs0E,KACA,WAAA96E,CAAYE,EAAKpC,EAAMg9E,EAAM8sC,EAAkB,GAC3C,GAAIA,EANwB,GAOxB,MAAM,IAAI92H,UAAU,4BAExB,MAAM+2H,EAAM/pH,EAAKgqH,MAAM5nH,EAAK46E,GACtB6sC,EAAK,EAAgBC,GAC3B,IAAK,IAAI31H,EAAI,EAAGA,EAAI01H,EAAGx1H,OAAQF,IAC3B01H,EAAG11H,GAAK41H,EAAI51H,GAEE,IAAd01H,EAAGx1H,SACHw1H,EAAG,GAAK,GAEZj3H,KAAKi3H,GAAKA,EACVj3H,KAAK8V,EAAI1I,EACTpN,KAAKoqF,KAAOA,CAChB,CACA,IAAAh9E,GACI,OAAOpN,KAAK8V,EAAE1I,KAAKpN,KAAKi3H,GAAIj3H,KAAKoqF,KACrC,CACA,MAAA97C,CAAOC,GACH,OAAMA,GAAO0oF,cAAchnH,YAGpB,GAAiBjQ,KAAKi3H,GAAI1oF,EAAM0oF,GAC3C,EC/BG,SAASI,GAAanuH,EAAK3K,GAC9B,OAAO0K,KAAK6a,MAAM7a,KAAKm0B,UAAY7+B,EAAM2K,IAAQA,CACrD,CCAO,MAAMouH,GACTvnG,SACA,WAAAzgB,CAAY7Q,GACRuB,KAAK+vB,SAAW,IAAIpuB,MAAMlD,GAAM85C,KAAK,KACzC,CACA,GAAAt5C,CAAIs4H,GACA,KAAMA,aAAuBP,IACzB,MAAM,IAAI52H,UAAU,uBAExB,OAAOJ,KAAK+vB,SAAS6qC,MAAMq8D,GAChBM,EAAYjpF,OAAO2oF,IAElC,CACA,GAAAj6G,CAAIu6G,GACA,KAAMA,aAAuBP,IACzB,MAAM,IAAI52H,UAAU,uBAExB,IAAK,IAAImB,EAAI,EAAGA,EAAIvB,KAAK+vB,SAAStuB,OAAQF,IACtC,GAAwB,MAApBvB,KAAK+vB,SAASxuB,GAEd,OADAvB,KAAK+vB,SAASxuB,GAAKg2H,GACZ,EAGf,OAAO,CACX,CACA,IAAAz3C,CAAKy3C,GACD,KAAMA,aAAuBP,IACzB,MAAM,IAAI52H,UAAU,uBAExB,MAAMmB,EAAI81H,GAAa,EAAGr3H,KAAK+vB,SAAStuB,OAAS,GAC3CkjC,EAAU3kC,KAAK+vB,SAASxuB,GAE9B,OADAvB,KAAK+vB,SAASxuB,GAAKg2H,EACZ5yF,CACX,CACA,MAAAxlC,CAAOo4H,GACH,KAAMA,aAAuBP,IACzB,MAAM,IAAI52H,UAAU,uBAExB,MAAM++B,EAAQn/B,KAAK+vB,SAAS4oF,WAAWse,GAC5BM,EAAYjpF,OAAO2oF,KAE9B,OAAI93F,GAAS,IACTn/B,KAAK+vB,SAASoP,GAAS,MAChB,EAKf,EC/CJ,MAAMq4F,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,IAAI9/F,WAAWmU,YCnB9B,MAAM,GAAQ,CACjB3+B,KAAO2oB,GACIxrB,ODqDA,SAAevL,GAAO,KAACP,EAAO,GAAE,WAAEk5H,GAAc,CAAC,GAC/D,IAAKH,GAAW/4H,GACf,MAAM,IAAID,MAAM,mEAGjB,GAAqB,iBAAVQ,EAAoB,CAC9B,GAAI24H,EACH,OA5BH,SAAyBpnH,EAAQ9R,EAAMk5H,GACtC,GAA0B,IAAtBA,EAAWl2H,OACd,MAAM,IAAIjD,MAAM,gEAGjB,MAAMo5H,EAAWJ,GAAW/4H,GAC5B,IAAI2O,EAAOqqH,GAAYh5H,GACnBo5H,EAAYtnH,EAEhB,KAAOsnH,EAAUp2H,OAAS,GAAG,CAC5B,MAAMqT,EAAS4iH,GAAcI,WAAWD,EAAWF,GACnDE,EAAYA,EAAU32H,MAAM4T,EAAOoI,MACnC,IAAK,IAAIrS,EAAQ,EAAGA,EAAQiK,EAAOi1B,QAASl/B,IAC3CuC,GAAQ64B,OAAO0xF,EAAW9sH,IAC1BuC,EAAO64B,OAAO8xF,QAAQt5H,EAAM2O,EAAOwqH,EAErC,CAEA,OAAOxqH,CACR,CASU4qH,CAAgBh5H,EAAOP,EAAMk5H,GAGrC34H,EAAQ04H,GAAcxiH,OAAOlW,EAC9B,CAEA,OA/CD,SAAyBkjH,EAAYzjH,GACpC,MAAMm5H,EAAWJ,GAAW/4H,GAC5B,IAAI2O,EAAOqqH,GAAYh5H,GAGvB,IAAK,IAAIoM,EAAQ,EAAGA,EAAQq3G,EAAWzgH,OAAQoJ,IAC9CuC,GAAQ64B,OAAOi8E,EAAWr3G,IAC1BuC,EAAO64B,OAAO8xF,QAAQt5H,EAAM2O,EAAOwqH,GAGpC,OAAOxqH,CACR,CAoCQ6qH,CAAgBj5H,EAAOP,EAC/B,CCnEsBy5H,CAAUniG,EAAO,CAC3Bt3B,KAAM,MAGd24H,MAAO,CAACrhG,EAAOq0D,IAIZ,SAAwB59C,GAC3B,IAAI92B,EAAM82B,EAAInmC,SAAS,IAIvB,OAHIqP,EAAIjU,OAAS,GAAM,IACnBiU,EAAM,IAAIA,KAEP,GAAqBA,EAAK,SACrC,CATeyiH,CAAe,GAAM/qH,KAAK2oB,EAAOq0D,KCHzC,MAAMguC,GACTC,WACAC,WACApB,gBACAj/C,QACAxwD,MACAra,KACAg9E,KACA,WAAA96E,CAAYzD,GACR7L,KAAKs4H,WAAazsH,EAAKysH,WACvBt4H,KAAKq4H,WAAaxsH,EAAKwsH,YAAc,EACrCr4H,KAAKk3H,gBAAkBrrH,EAAKqrH,iBAAmB,EAC/Cl3H,KAAKynB,MAAQ,EACbznB,KAAKi4E,QAAU,GACfj4E,KAAKoN,KAAOvB,EAAKuB,MAAQ,GACzBpN,KAAKoqF,KAAOv+E,EAAKu+E,MAAQitC,GAAa,EAAGpuH,KAAK0qB,IAAI,EAAG,IACzD,CACA,GAAA3W,CAAIqoC,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAMkyE,EAAc,IAAIP,GAAY3xE,EAAMrlD,KAAKoN,KAAMpN,KAAKoqF,KAAMpqF,KAAKk3H,iBAC/D10H,EAAIxC,KAAKoN,KAAKA,KAAKi4C,EAAMrlD,KAAKoqF,MAAQpqF,KAAKs4H,WAC3C5/F,GAAKl2B,EAAI+0H,EAAYnqH,QAAUpN,KAAKs4H,WAO1C,GANuB,MAAnBt4H,KAAKi4E,QAAQz1E,KACbxC,KAAKi4E,QAAQz1E,GAAK,IAAI80H,GAAOt3H,KAAKq4H,aAEf,MAAnBr4H,KAAKi4E,QAAQv/C,KACb14B,KAAKi4E,QAAQv/C,GAAK,IAAI4+F,GAAOt3H,KAAKq4H,aAElCr4H,KAAKi4E,QAAQz1E,GAAGwa,IAAIu6G,IAAgBv3H,KAAKi4E,QAAQv/C,GAAG1b,IAAIu6G,GAExD,OADAv3H,KAAKynB,SACE,EAEX,MAAM8wG,EAAO,CAAC/1H,EAAGk2B,GACjB,IAAIn3B,EAAIg3H,EAAKlB,GAAa,EAAGkB,EAAK92H,OAAS,IACpB,MAAnBzB,KAAKi4E,QAAQ12E,KACbvB,KAAKi4E,QAAQ12E,GAAK,IAAI+1H,GAAOt3H,KAAKq4H,aAEtC,IAAK,IAAI7kH,EAAI,EAAGA,EAxCD,IAwCqBA,IAAK,CACrC,MAAMglH,EAAUx4H,KAAKi4E,QAAQ12E,GAAGu+E,KAAKy3C,GACrC,GAAe,MAAXiB,IAGJj3H,GAAKA,EAAIi3H,EAAQprH,QAAUpN,KAAKs4H,WACT,MAAnBt4H,KAAKi4E,QAAQ12E,KACbvB,KAAKi4E,QAAQ12E,GAAK,IAAI+1H,GAAOt3H,KAAKq4H,aAElCr4H,KAAKi4E,QAAQ12E,GAAGyb,IAAIw7G,IAEpB,OADAx4H,KAAKynB,SACE,CAKf,CACA,OAAO,CACX,CACA,GAAAxoB,CAAIomD,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAMkyE,EAAc,IAAIP,GAAY3xE,EAAMrlD,KAAKoN,KAAMpN,KAAKoqF,KAAMpqF,KAAKk3H,iBAC/D10H,EAAIxC,KAAKoN,KAAKA,KAAKi4C,EAAMrlD,KAAKoqF,MAAQpqF,KAAKs4H,WAC3CG,EAAMz4H,KAAKi4E,QAAQz1E,IAAIvD,IAAIs4H,KAAgB,EACjD,GAAIkB,EACA,OAAOA,EAEX,MAAM//F,GAAKl2B,EAAI+0H,EAAYnqH,QAAUpN,KAAKs4H,WAC1C,OAAOt4H,KAAKi4E,QAAQv/C,IAAIz5B,IAAIs4H,KAAgB,CAChD,CACA,MAAAp4H,CAAOkmD,GACiB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAMkyE,EAAc,IAAIP,GAAY3xE,EAAMrlD,KAAKoN,KAAMpN,KAAKoqF,KAAMpqF,KAAKk3H,iBAC/D10H,EAAIxC,KAAKoN,KAAKA,KAAKi4C,EAAMrlD,KAAKoqF,MAAQpqF,KAAKs4H,WAC3CG,EAAMz4H,KAAKi4E,QAAQz1E,IAAIrD,OAAOo4H,KAAgB,EACpD,GAAIkB,EAEA,OADAz4H,KAAKynB,QACEgxG,EAEX,MAAM//F,GAAKl2B,EAAI+0H,EAAYnqH,QAAUpN,KAAKs4H,WACpCI,EAAM14H,KAAKi4E,QAAQv/C,IAAIv5B,OAAOo4H,KAAgB,EAIpD,OAHImB,GACA14H,KAAKynB,QAEFixG,CACX,CACA,YAAIC,GACA,OAAO1vH,KAAK6a,MAAa9jB,KAAKynB,MAAQznB,KAAKs4H,WAAzB,MAAyC,EAC/D,EAGJ,MAAMM,GAAW,CACb,EAAG,GACH,EAAG,IACH,EAAG,IACH,EAAG,KAWA,SAASC,GAASC,EAAUC,EAAY,MAG3C,MAAMV,EAZV,SAA6BU,EAAY,MACrC,OAAIA,EAAY,KACL,EAEPA,EAAY,KACL,EAEJ,CACX,CAIuBC,CAAoBD,GACjCvrH,EAAOorH,GAASP,GAItB,MAAO,CACHC,WAHervH,KAAKuuB,MAAMshG,EAAWtrH,GAIrC6qH,aACAnB,gBAJoBjuH,KAAKC,IAAID,KAAK01B,KAAK11B,KAAKgwH,KAAK,EAAIF,GAAa9vH,KAAKgwH,KAAK,EAAIZ,ILxHpD,IK8HpC,CC5HO,MAAMa,GACTZ,WACAD,WACAnB,gBACAiC,MACAC,aACAhsH,KACAg9E,KACA,WAAA96E,CAAYzD,GACR7L,KAAKq4H,WAAaxsH,EAAKwsH,YAAc,EACrCr4H,KAAKs4H,WAAazsH,EAAKysH,aAAe,GAAK,IAAMt4H,KAAKq4H,WACtDr4H,KAAKk3H,gBAAkBrrH,EAAKqrH,iBAAmB,EAC/Cl3H,KAAKm5H,MAAQttH,EAAKstH,OAAS,EAC3Bn5H,KAAKoN,KAAOvB,EAAKuB,MAAQ,GACzBpN,KAAKoqF,KAAOv+E,EAAKu+E,MAAQitC,GAAa,EAAGpuH,KAAK0qB,IAAI,EAAG,KACrD3zB,KAAKo5H,aAAe,CAChB,IAAIhB,GAAa,CACbE,WAAYt4H,KAAKs4H,WACjBD,WAAYr4H,KAAKq4H,WACjBnB,gBAAiBl3H,KAAKk3H,gBACtB9pH,KAAMpN,KAAKoN,KACXg9E,KAAMpqF,KAAKoqF,OAGvB,CACA,GAAAptE,CAAIqoC,GAIA,GAHoB,iBAATA,IACPA,EAAO,GAAqBA,IAE5BrlD,KAAKf,IAAIomD,GACT,OAAO,EAEX,IAAI1gB,EAAU3kC,KAAKo5H,aAAa9/F,MAAM+/F,GAC3BA,EAAOV,WAElB,GAAe,MAAXh0F,EAAiB,CACjB,MAAM20F,EAAUt5H,KAAKs4H,WAAarvH,KAAK0qB,IAAI3zB,KAAKm5H,MAAOn5H,KAAKo5H,aAAa33H,QACzEkjC,EAAU,IAAIyzF,GAAa,CACvBE,WAAYgB,EACZjB,WAAYr4H,KAAKq4H,WACjBnB,gBAAiBl3H,KAAKk3H,gBACtB9pH,KAAMpN,KAAKoN,KACXg9E,KAAMpqF,KAAKoqF,OAEfpqF,KAAKo5H,aAAa54H,KAAKmkC,EAC3B,CACA,OAAOA,EAAQ3nB,IAAIqoC,EACvB,CACA,GAAApmD,CAAIomD,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,IAAK,IAAI9jD,EAAI,EAAGA,EAAIvB,KAAKo5H,aAAa33H,OAAQF,IAC1C,GAAIvB,KAAKo5H,aAAa73H,GAAGtC,IAAIomD,GACzB,OAAO,EAGf,OAAO,CACX,CACA,MAAAlmD,CAAOkmD,GACiB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,IAAK,IAAI9jD,EAAI,EAAGA,EAAIvB,KAAKo5H,aAAa33H,OAAQF,IAC1C,GAAIvB,KAAKo5H,aAAa73H,GAAGpC,OAAOkmD,GAC5B,OAAO,EAGf,OAAO,CACX,CACA,SAAI59B,GACA,OAAOznB,KAAKo5H,aAAa9uF,QAAO,CAAC0Q,EAAKlyC,IAC3BkyC,EAAMlyC,EAAK2e,OACnB,EACP,ECNJ,MAAM,GAAcmQ,WAAW40B,aAAe6pD,MCnEvC,MAAMkjB,GACTnuH,IACA27C,OACA+O,UACA6gE,QACA,WAAArnH,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,uBAC1CngG,KAAK+mD,OAASqB,EAAWrB,OACzB/mD,KAAK81D,UAAY1N,EAAW0N,UAC5B91D,KAAK22H,QAAU9qH,EAAK8qH,SAAW,EACnC,CACA,CAAClzF,OAAOqB,aAAe,uBAIvB,cAAMirF,CAASr/G,EAAIuJ,GACf,GAA4B,IAAxBja,KAAK22H,QAAQl1H,OACb,MAAM,IAAI2mH,GAAmB,6BAEjC,GAAI13G,EAAGrK,aAAerG,KAAK+mD,OAAO1gD,WAC9B,MAAM,IAAIgiH,GAAoB,+BAElC,MAAM/9G,EAAOtK,KACPmG,EAAS,MAASnG,KAAK22H,QAAQryH,KAAIwyH,GAAU,kBAC/C,gBACgBA,EAAO/G,SAASr/G,EAAIuJ,EACpC,CACA,MAAOwM,GACHnc,EAAKc,IAAIoc,MAAMf,EACnB,CACH,CAPkD,MAQnD,UAAW,MAAMihC,KAAQvhD,EACrB,GAAY,MAARuhD,EASJ,OALIA,EAAKo7C,WAAWrhG,OAAS,SACnBzB,KAAK81D,UAAUzyC,MAAMqkC,EAAKh3C,GAAI,CAChCoyF,WAAYp7C,EAAKo7C,aAGlBp7C,EAEX,MAAM,IAAI0f,EACd,CAIA,qBAAOoyD,CAAgBz6H,EAAKkb,EAAU,CAAC,GACnC,GAA4B,IAAxBja,KAAK22H,QAAQl1H,OACb,MAAM,IAAI2mH,GAAmB,6BAEjC,MAAM99G,EAAOtK,KACP62H,EFsBP,SAAoCiC,EAAUC,EAAY,KAAO9+G,GACpE,OAAO,IAAIi/G,GAAqB,IACzBL,GExBqC,KFwBlBE,MAClB9+G,GAAW,CAAC,GAExB,CE3BqBw/G,GACb,UAAW,MAAM/xE,KDmBVva,gBAAyBhnC,EAAQ8T,EAAU,CAAC,GACvD,IAAIg/F,EAAch/F,EAAQg/F,aAAerzF,IACrCqzF,EAAc,IACdA,EAAcrzF,KAElB,MAAM8zG,EAAUz/G,EAAQy/G,UAAW,EAC7Bx5H,EAAU,IAAImsD,YACdstE,EAAM,GACZ,IAGIC,EAHAC,EAAgB,KAChBC,EAAkB,KAClBC,GAAiB,EAEjBC,GAAU,EAsCd,SAASC,IACL,OAAIP,EACOC,EAAI,IAAI32F,KAEZl2B,QAAQ6sH,EAAIrgG,MAAKiE,GAAMA,EAAGyF,OACrC,CACA,SAAUk3F,IACN,KAAQP,EAAIl4H,OAAS,GAAMk4H,EAAI,GAAG32F,MAAM,CACpC,MAAMzF,EAAKo8F,EAAI,GAEf,GADAA,EAAIrxH,SACAi1B,EAAG48F,GAOH,MAFAH,GAAU,EACVH,EAAc31H,UACRq5B,EAAG9W,UANH8W,EAAGv+B,MAQb66H,EAAc31H,SAClB,CACJ,CACA,SAAUk2H,IAGN,KAAOH,KACH,IAAK,IAAI14H,EAAI,EAAGA,EAAIo4H,EAAIl4H,OAAQF,IAC5B,GAAIo4H,EAAIp4H,GAAGyhC,KAAM,CACb,MAAMzF,EAAKo8F,EAAIp4H,GAGf,GAFAo4H,EAAIzuH,OAAO3J,EAAG,GACdA,KACIg8B,EAAG48F,GAMH,MAFAH,GAAU,EACVH,EAAc31H,UACRq5B,EAAG9W,UALH8W,EAAGv+B,MAOb66H,EAAc31H,SAClB,CAGZ,CACA,IAjFAhE,EAAQkkD,iBAAiB,iBAAiB,KACtC01E,EAAgB51H,SAAS,IAExBq4B,QAAQr4B,UAAUq/B,MAAK4J,UACxB,IACI,UAAW,MAAM00B,KAAQ17D,EAAQ,CAK7B,GAJIwzH,EAAIl4H,SAAWw3G,IACf4gB,EAAgB,WACVA,EAAcp3E,SAEpBu3E,EACA,MAEJ,MAAMz8F,EAAK,CACPyF,MAAM,GAEV22F,EAAIn5H,KAAK+8B,GACTskC,IACKt+B,MAAKzuB,IACNyoB,EAAGyF,MAAO,EACVzF,EAAG48F,IAAK,EACR58F,EAAGv+B,MAAQ8V,EACX5U,EAAQosD,cAAc,IAAI,GAAY,iBAAiB,IACxD7lC,IACC8W,EAAGyF,MAAO,EACVzF,EAAG9W,IAAMA,EACTvmB,EAAQosD,cAAc,IAAI,GAAY,iBAAiB,GAE/D,CACAytE,GAAiB,EACjB75H,EAAQosD,cAAc,IAAI,GAAY,iBAC1C,CACA,MAAO7lC,GACHmzG,EAAYnzG,EACZvmB,EAAQosD,cAAc,IAAI,GAAY,iBAC1C,OA8CS,CAKT,GAJK2tE,MACDH,EAAkB,WACZA,EAAgBr3E,SAET,MAAbm3E,EAEA,MAAMA,EAQV,GANIF,QACOQ,UAGAE,IAEPL,GAAiC,IAAfJ,EAAIl4H,OAEtB,KAER,CACJ,CCrIiC44H,CAASltF,kBAC9B,MAAMhnC,EAAS,MAASmE,EAAKqsH,QAAQryH,KAAIwyH,GAAUA,EAAO0C,gBAAgBz6H,EAAKkb,MAC/E,UAAW,IAAIytC,KAAQvhD,QACbgnC,UAEF,GAA+B,IAA3Bua,EAAKo7C,WAAWrhG,OAChB,IACIimD,QAAap9C,EAAKylH,SAASroE,EAAKh3C,GAAI,IAC7BuJ,EACHqgH,UAAU,GAElB,CACA,MAAO7zG,GAEH,YADAnc,EAAKc,IAAIoc,MAAM,iCAAkCf,EAErD,CAEJ,OAAOihC,CAAI,CAGvB,CApBkCva,IAqBlB,MAARua,IAIAA,EAAKo7C,WAAWrhG,OAAS,SACnBzB,KAAK81D,UAAUzyC,MAAMqkC,EAAKh3C,GAAI,CAChCoyF,WAAYp7C,EAAKo7C,aAIrB+zB,EAAK53H,IAAIyoD,EAAKh3C,GAAG+4D,cAAc36D,SAGnC+nH,EAAK75G,IAAI0qC,EAAKh3C,GAAG+4D,cAAc36D,aACzB44C,GAEd,EC1FG,MAAM6yE,WAAmBnuE,GAC5B0jE,YACA1kH,IACAovH,QACAC,QACAC,mBACAC,eACAC,SACA,WAAAtrH,CAAY84C,GACRhY,QACApwC,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,sBAC1CngG,KAAK8vH,YAAc1nE,EAAW0nE,YAC9B9vH,KAAKy6H,QAAU,EACfz6H,KAAKw6H,SAAU,EAEfx6H,KAAK06H,mBAAqB,IAAIjrB,gBACJzvG,KAAK06H,mBAAmBz2E,MACtD,CACA,CAACxgB,OAAOqB,aAAe,sBACvB,KAAA99B,GACIhH,KAAK06H,mBAAqB,IAAIjrB,gBACJzvG,KAAK06H,mBAAmBz2E,MACtD,CACA,IAAA39B,GACItmB,KAAK06H,mBAAmB32D,OAC5B,CACA,UAAO82D,CAAK5gH,GACHja,KAAKw6H,SAENx6H,KAAK86H,YAET96H,KAAKy6H,UACL,MAAMx2E,EAASspE,GAAU,CAACvtH,KAAK06H,mBAAmBz2E,OAAQhqC,GAASgqC,SAEnE,IACI,OAAa,CAETjkD,KAAK46H,UAAU12H,UACflE,KAAK46H,SAAWp4E,KAEhB,MAAMriD,QAAc6rH,GAAUhsH,KAAM,YAAaikD,EAAQ,CACrDmoE,WAAY,qBAEVjsH,EAAMwnD,MAChB,CACJ,CACA,QACI1D,EAAO1kD,QACPS,KAAKy6H,UAEgB,IAAjBz6H,KAAKy6H,UACLz6H,KAAK26H,gBAAgB52D,QACrB/jE,KAAK26H,oBAAiBz7H,EAE9B,CACJ,CACA,SAAA47H,GACI96H,KAAKw6H,SAAU,EAGfx6H,KAAK26H,eAAiB,IAAIlrB,gBACAzvG,KAAK26H,eAAe12E,OAC9C,MAAMA,EAASspE,GAAU,CAACvtH,KAAK26H,eAAe12E,OAAQjkD,KAAK06H,mBAAmBz2E,SAExEj9C,EAAQwD,KAAKm2D,MACnB,IAAIxhC,EAAQ,EACZ5C,QAAQr4B,UAAUq/B,MAAK4J,UAGnB,IAFAntC,KAAKoL,IAAI,cAEFpL,KAAKy6H,QAAU,GAClB,IACI,MAAM9wF,EAAO,GAAY,IACzB,IAAI5mC,EAAIyH,KAAKm2D,MACb,UAAW,MAAMjZ,KAAQ1nD,KAAK8vH,YAAY0J,gBAAgB7vF,EAAM,CAAEsa,WAC1DA,EAAOQ,SACPzkD,KAAKoL,IAAI,iBAEb64C,EAAOC,iBACPlkD,KAAKoL,IAAI,0CAA2Cs8C,EAAKh3C,GAAIlG,KAAKm2D,MAAQ59D,EAAG/C,KAAKy6H,SAClFt7F,IACAn/B,KAAKusD,kBAAkB,YAAa,CAChC5E,OAAQD,IAIS,IAAjB1nD,KAAKy6H,SAAkC,MAAjBz6H,KAAK46H,WAC3B56H,KAAKoL,IAAI,4BACHo5C,GAAWxkD,KAAK46H,SAASn4E,QAASwB,IAE5ClhD,EAAIyH,KAAKm2D,MAEb3gE,KAAKoL,IAAI,gEAAiEu+B,EAAM3pC,KAAKy6H,QAASt7F,EAClG,CACA,MAAO1Y,GACHzmB,KAAKoL,IAAIoc,MAAM,qBAAsBf,GACrCzmB,KAAKusD,kBAAkB,aAAc,CACjC5E,OAAQlhC,GAEhB,CAEJzmB,KAAKoL,IAAI,8BAA8B,IAEtCk4B,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,qBAAsBf,EAAI,IAExCumE,SAAQ,KACThtF,KAAKoL,IAAI,2CAA4C+zB,EAAO30B,KAAKm2D,MAAQ35D,GACzEhH,KAAKw6H,SAAU,CAAK,GAE5B,EC3GG,MAAMO,GACT3vH,IACA4vH,WACA15H,SACA8mD,WACA,WAAA94C,CAAY84C,GACRpoD,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,oBAC1CngG,KAAKg7H,WAAa,IAAIntF,IACtB7tC,KAAKsB,SAAW,IAAIusC,IACpB7tC,KAAKooD,WAAaA,EAClBpoD,KAAKi7H,cAAgBj7H,KAAKi7H,cAAc7+F,KAAKp8B,MAC7CA,KAAKk7H,cAAgBl7H,KAAKk7H,cAAc9+F,KAAKp8B,MAC7CA,KAAKm7H,gBAAkBn7H,KAAKm7H,gBAAgB/+F,KAAKp8B,MACjDA,KAAKooD,WAAWtnD,OAAOsjD,iBAAiB,kBAAmBpkD,KAAKi7H,eAChEj7H,KAAKooD,WAAWtnD,OAAOsjD,iBAAiB,cAAepkD,KAAKk7H,eAC5Dl7H,KAAKooD,WAAWtnD,OAAOsjD,iBAAiB,gBAAiBpkD,KAAKm7H,gBAClE,CACA,CAAC13F,OAAOqB,aAAe,oBACvB,YAAA6gC,GACI,OAAOhkE,MAAM4c,KAAK,IAAI48B,IAAI,IACnBn7C,KAAKsB,SAAS4D,UACjBkJ,MACR,CACA,UAAAgtH,CAAWrzE,GACP,MAAM63D,EAAU5/G,KAAKsB,SAASlC,IAAI2oD,GAClC,GAAe,MAAX63D,EACA,MAAM,IAAI,GAAgC,sCAAsC73D,KAEpF,OAAO63D,CACX,CACA,aAAAyb,CAActzE,GACV,MAAMizE,EAAah7H,KAAKg7H,WAAW57H,IAAI2oD,GACvC,OAAkB,MAAdizE,EACO,GAEJ,IACAA,EAAW/3H,SAEtB,CAIA,YAAM2mD,CAAO7B,EAAU63D,EAAS9iF,GAC5B,GAAI98B,KAAKsB,SAASrC,IAAI8oD,GAClB,MAAM,IAAI,GAAuC,2CAA2CA,KAEhG,MAAM9tC,EAAU,GAAMmiB,KAAK,CAAErE,iBAAiB,GAA9B,CAAsC,CAClD+xB,kBApD+B,GAqD/Bo+C,mBApDgC,IAqDjCprE,GACH98B,KAAKsB,SAAShC,IAAIyoD,EAAU,CACxB63D,UACA3lG,kBAGEja,KAAKooD,WAAW0N,UAAUzyC,MAAMrjB,KAAKooD,WAAWrB,OAAQ,CAC1Da,UAAW,CAACG,IAEpB,CAKA,cAAM4gD,CAAS/gD,IACUjmD,MAAM2Q,QAAQs1C,GAAaA,EAAY,CAACA,IAChDz6C,SAAQ46C,IACjB/nD,KAAKsB,SAAS4lD,OAAOa,EAAS,UAG5B/nD,KAAKooD,WAAW0N,UAAU2zC,MAAMzpG,KAAKooD,WAAWrB,OAAQ,CAC1Da,UAAW5nD,KAAK2lE,gBAExB,CAIA,cAAM21D,CAASvzE,EAAUwzE,GACrB,GAAgB,MAAZA,EACA,MAAM,IAAI,GAAuB,oBAGrC,MAAM7qH,EAAK,IAAoB,IAAhBzH,KAAKm0B,UAAgB/2B,SAAS,MAAMmE,KAAKm2D,QACxD,IAAIq6D,EAAah7H,KAAKg7H,WAAW57H,IAAI2oD,GAMrC,OALkB,MAAdizE,IACAA,EAAa,IAAIntF,IACjB7tC,KAAKg7H,WAAW17H,IAAIyoD,EAAUizE,IAElCA,EAAW17H,IAAIoR,EAAI6qH,GACZ7qH,CACX,CAIA,UAAA8qH,CAAW9qH,GACP,IAAK,MAAOq3C,EAAUizE,KAAeh7H,KAAKg7H,WAAWlrE,UAC7CkrE,EAAW/7H,IAAIyR,KACfsqH,EAAW9zE,OAAOx2C,GACM,IAApBsqH,EAAWv8H,MACXuB,KAAKg7H,WAAW9zE,OAAOa,GAIvC,CAIA,aAAAkzE,CAAc36H,GACV,MAAMoqD,EAAapqD,EAAIqnD,OAClB3nD,KAAKooD,WAAW0N,UAAU12D,IAAIsrD,GAC9BnnB,MAAKmkB,IACN,IAAK,MAAMK,KAAYL,EAAKE,UAAW,CACnC,MAAMozE,EAAah7H,KAAKg7H,WAAW57H,IAAI2oD,GACvC,GAAkB,MAAdizE,EAIJ,IAAK,MAAMO,KAAYP,EAAW/3H,UACW,IAArCs4H,EAAS1uH,QAAQ5N,IAAIyrD,KAGzB6wE,EAAS1uH,QAAQ1N,OAAOurD,GACxB6wE,EAAS7I,eAAehoE,GAEhC,KAECpnB,OAAM7c,IACU,kBAAbA,EAAI1lB,MAIRf,KAAKoL,IAAIoc,MAAM,uDAAwDkjC,EAAYjkC,EAAI,GAE/F,CAKA,aAAAy0G,CAAc56H,GACV,MAAM,KAAEonD,EAAI,SAAE49D,GAAahlH,EAAIqnD,OACzB8zE,GAAWnW,GAAU19D,WAAa,IAAI/6C,QAAOk7C,IAAaL,EAAKE,UAAU58B,SAAS+8B,KACxF,IAAK,MAAMA,KAAY0zE,EAAS,CAC5B,MAAMT,EAAah7H,KAAKg7H,WAAW57H,IAAI2oD,GACvC,GAAkB,MAAdizE,EAIJ,IAAK,MAAMO,KAAYP,EAAW/3H,UACQ,IAAlCs4H,EAAS1uH,QAAQ5N,IAAIyoD,EAAKh3C,MAG9B6qH,EAAS1uH,QAAQ1N,OAAOuoD,EAAKh3C,IAC7B6qH,EAAS7I,eAAehrE,EAAKh3C,IAErC,CACJ,CAKA,eAAAyqH,CAAgB76H,GACZ,MAAMsnD,EAAYtnD,EAAIqnD,OAAOC,UACvBN,EAAahnD,EAAIqnD,OAAOL,WACxBP,EAASzmD,EAAIqnD,OAAOZ,OAC1B,IAAK,MAAMgB,KAAYH,EAAW,CAC9B,MAAMozE,EAAah7H,KAAKg7H,WAAW57H,IAAI2oD,GACvC,GAAkB,MAAdizE,EAIJ,IAAK,MAAMO,KAAYP,EAAW/3H,SACL,MAArBqkD,EAAWnU,SAAyD,IAAvCooF,EAASG,4BAGL,IAAjCH,EAAS1uH,QAAQ5N,IAAI8nD,KAGzBw0E,EAAS1uH,QAAQmQ,IAAI+pC,GACrBw0E,EAAS9I,YAAY1rE,EAAQO,GAErC,CACJ,EC5LJ,MAAMq0E,WAAmB9tF,IACrBklF,OACA,WAAAzjH,CAAYzD,GACRukC,QACA,MAAM,KAAErvC,EAAI,QAAE29F,GAAY7yF,EAC1B7L,KAAK+yH,OAASr0B,EAAQk9B,eAAe76H,GACrCf,KAAK67H,uBACT,CACA,GAAAv8H,CAAIP,EAAKC,GAGL,OAFAoxC,MAAM9wC,IAAIP,EAAKC,GACfgB,KAAK67H,wBACE77H,IACX,CACA,OAAOjB,GACH,MAAM+8H,EAAU1rF,MAAM8W,OAAOnoD,GAE7B,OADAiB,KAAK67H,wBACEC,CACX,CACA,KAAAv8H,GACI6wC,MAAM7wC,QACNS,KAAK67H,uBACT,CACA,qBAAAA,GACI77H,KAAK+yH,OAAOj0H,OAAOkB,KAAKvB,KAC5B,ECpBG,MAAMs9H,GACT3wH,IACAg9C,WACA4zE,WACA36H,UACAg8G,eACArV,QACA,WAAA14F,CAAY84C,EAAYv8C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMg9C,EAAW5K,OAAO2iD,aAAa,qBAC1CngG,KAAKooD,WAAaA,EAClBpoD,KAAKgoG,SAAU,EACfhoG,KAAKg8H,WAAa,IAAInuF,IACtB7tC,KAAKqB,UDUN,SAAoBk3B,GACvB,MAAM,KAAEx3B,EAAI,QAAE29F,GAAYnmE,EAC1B,IAAIj0B,EAOJ,OALIA,EADW,MAAXo6F,EACM,IAAIi9B,GAAW,CAAE56H,OAAM29F,YAGvB,IAAI7wD,IAEPvpC,CACX,CCpByB23H,CAAW,CACxBl7H,KAAM,qCACN29F,QAAS1+F,KAAKooD,WAAWs2C,UAE7B1+F,KAAKq9G,eAAiBxxG,EAAKwxG,gBAAkB1K,GAAe2K,SAChE,CACA,CAAC75E,OAAOqB,aAAe,4BAIvB,GAAA9nB,CAAI02C,GACA,MAAM7gB,EAAM6gB,EAAUjwB,OAAOqB,aAC7B,GAAW,MAAP+N,EACA,MAAM,IAAI,GAAuB,mCAErC,GAAI7yC,KAAKg8H,WAAW/8H,IAAI4zC,GACpB,MAAM,IAAI,GAAuB,6CAA6CA,KAElF7yC,KAAKoL,IAAI,sBAAuBynC,GAChC7yC,KAAKg8H,WAAW18H,IAAIuzC,EAAK6gB,GACpB1zD,KAAKqB,UAAUpC,IAAI4zC,IACpB7yC,KAAKqB,UAAU/B,IAAIuzC,EAAK,GAEhC,CACA,SAAA0pB,GACI,OAAOv8D,KAAKgoG,OAChB,CACA,KAAAhhG,GACIhH,KAAKgoG,SAAU,CACnB,CACA,gBAAMohB,GAEF,MAAMvD,EAAQ7lH,KAAKooD,WAAW6/C,eAAeyf,uBACvC1nH,KAAK8jC,OAAO+hF,EACtB,CAIA,UAAMv/F,GACF,MAAMgtG,EAAQ,GACd,IAAK,MAAOv0H,EAAKsC,KAAcrB,KAAKqB,UAEhC,IADArB,KAAKoL,IAAI,2BAA4BrM,GAC9BsC,EAAUI,OAAS,GAAG,CACzB,MAAMpB,EAAWgB,EAAUm8B,MACX,MAAZn9B,GAGJizH,EAAM9yH,KAAKH,EAAS2oG,QACxB,OAEEzsE,QAAQ6oB,IAAIkuE,GAClBtzH,KAAKoL,IAAI,wBACT,IAAK,MAAMrM,KAAOiB,KAAKqB,UAAU6D,OAC7BlF,KAAKqB,UAAU/B,IAAIP,EAAK,IAE5BiB,KAAKgoG,SAAU,CACnB,CAIA,UAAMxuC,CAAKO,EAAI9/C,GACX,MAAMy5C,EAAY1zD,KAAKqwH,0BAA0Bt2D,GACjD,GAAiB,MAAbrG,EACA,MAAM,IAAIo1D,GAA0B,sCAAsC95G,OAAO+qD,MAMrF,OAJA9/C,GAASk9F,aAAa,IAAIf,GAAoB,uCAAwC1iD,EAAUjwB,OAAOqB,eAIhG4uB,EAAU8F,KAAKO,EAAI,IACnB9/C,EACH48F,SAAU72G,KAAKooD,WAAWyuD,UAElC,CAIA,QAAA2Q,GACI,IAAI3B,EAAQ,GACZ,IAAK,MAAMxkH,KAAarB,KAAKqB,UAAU4B,SACnC,IAAK,MAAM5C,KAAYgB,EACnBwkH,EAAQ,IAAIA,KAAUxlH,EAASmnH,YAGvC,OAAO3B,CACX,CAIA,aAAAqW,GACI,OAAOv6H,MAAMw6H,MAAMn8H,KAAKg8H,WAAW/4H,SACvC,CAIA,YAAAm5H,GACI,OAAOz6H,MAAMw6H,MAAMn8H,KAAKqB,UAAU4B,UAAUosH,MAChD,CAIA,yBAAAgB,CAA0Bt2D,GACtB,IAAK,MAAMrG,KAAa1zD,KAAKg8H,WAAW/4H,SAEpC,GADcywD,EAAU4jD,WAAW,CAACv9C,IAC1Bt4D,OAAS,EACf,OAAOiyD,CAGnB,CAIA,2BAAA2oE,CAA4BtiE,GACxB,IAAK,MAAMrG,KAAa1zD,KAAKg8H,WAAW/4H,SAEpC,GADcywD,EAAU2jD,aAAa,CAACt9C,IAC5Bt4D,OAAS,EACf,OAAOiyD,CAGnB,CAIA,YAAM5vB,CAAO+hF,GACT,IAAK7lH,KAAKu8D,YACN,MAAM,IAAIqL,GAAgB,eAE9B,GAAa,MAATi+C,GAAkC,IAAjBA,EAAMpkH,OAEvB,YADAzB,KAAKoL,IAAI,oEAGb,MAAMkxH,EAAiB,GACvB,IAAK,MAAOv9H,EAAK20D,KAAc1zD,KAAKg8H,WAAWlsE,UAAW,CACtD,MAAMysE,EAAiB7oE,EAAU2jD,aAAawO,GACxCyN,EAAQ,GAEd,IAAK,MAAMxkE,KAAQytE,EAAgB,CAC/Bv8H,KAAKoL,IAAI,iCAAkCrM,EAAK+vD,GAChD,MAAMzuD,EAAWqzD,EAAU0jD,eAAe,CACtCP,SAAU72G,KAAKooD,WAAWyuD,WAE9B,IAAIx1G,EAAYrB,KAAKqB,UAAUjC,IAAIL,IAAQ,GAC1B,MAAbsC,IACAA,EAAY,GACZrB,KAAKqB,UAAU/B,IAAIP,EAAKsC,IAE5BA,EAAUb,KAAKH,GAEfA,EAAS+jD,iBAAiB,aAAa,KACnCpkD,KAAKooD,WAAWtnD,OAAOyrD,kBAAkB,sBAAuB,CAC5D5E,OAAQtnD,GACV,IAENA,EAAS+jD,iBAAiB,SAAS,KAC/B,MAAMv5C,EAAQxJ,EAAUs3G,WAAUn3G,GAAKA,IAAMnB,IAE7CgB,EAAU6J,OAAOL,EAAO,GACxB7K,KAAKooD,WAAWtnD,OAAOyrD,kBAAkB,kBAAmB,CACxD5E,OAAQtnD,GACV,IAGNizH,EAAM9yH,KAAKH,EAASyjC,OAAOgrB,GAC/B,CAEA,GAAqB,IAAjBwkE,EAAM7xH,QAUV,GAAoB,aANE86B,QAAQuiC,WAAWw0D,IAKbh6F,MAAKkB,GAAkB,cAAbA,EAAEpK,UACXpwB,KAAKq9G,iBAAmB1K,GAAe6pB,SAChE,MAAM,IAAI/T,GAAsB,cAAc1pH,qDAV9Cu9H,EAAe97H,KAAKzB,EAY5B,CAGA,GAAIu9H,EAAe76H,SAAWzB,KAAKg8H,WAAWv9H,KAAM,CAChD,MAAM+N,EAAU,oDAAoD8vH,EAAez0H,KAAK,SACxF,GAAI7H,KAAKq9G,iBAAmB1K,GAAe2K,UACvC,MAAM,IAAImL,GAAsBj8G,GAEpCxM,KAAKoL,IAAI,6BAA6BoB,IAC1C,CACJ,CAKA,YAAMrN,CAAOJ,GACT,MAAMsC,EAAYrB,KAAKqB,UAAUjC,IAAIL,IAAQ,GAC7CiB,KAAKoL,IAAI60F,MAAM,wBAAyBlhG,GAExC,MAAMu0H,EAAQ,GAEd,IADAtzH,KAAKoL,IAAI60F,MAAM,2BAA4BlhG,GACpCsC,EAAUI,OAAS,GAAG,CACzB,MAAMpB,EAAWgB,EAAUm8B,MACX,MAAZn9B,GAGJizH,EAAM9yH,KAAKH,EAAS2oG,QACxB,OACMzsE,QAAQ6oB,IAAIkuE,GAClBtzH,KAAKg8H,WAAW90E,OAAOnoD,GACvBiB,KAAKqB,UAAU6lD,OAAOnoD,EAC1B,CAOA,eAAM09H,GACF,MAAMnJ,EAAQ,GACd,IAAK,MAAMv0H,KAAOiB,KAAKg8H,WAAW92H,OAC9BouH,EAAM9yH,KAAKR,KAAKb,OAAOJ,UAErBw9B,QAAQ6oB,IAAIkuE,EACtB,EC7OG,MAEM,GAAkB,QCAxB,MAAM,WAAkC90H,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BAKJ,MAAM,WAA2BvW,MACpCuC,KAAO,qBACPgU,KAAO,qBC5BJ,SAAS,GAAgBksC,GAC5B,OAAsC,MAA/BA,EAAMxd,OAAOC,cACxB,CCKA,SAASg5F,GAAsBr/G,EAAO8kC,GAClC,GAAI9kC,EAAM7M,WAAa2xC,EACnB,MAAM,IAAI,GAAuB,0BAEzC,CACA,MAAM,GAAkB1gD,IACpB,MAAM0/C,EAAe,EAAsB1/C,GACrC2/C,EAAYp8B,EAAYm8B,GAG9B,OAFA,EAAc1/C,EAAQ2/C,GACtB,GAAetyC,MAAQqyC,EAChBC,CAAS,EAGb,SAAS,GAAOj7C,EAAQ8T,GAE3B,MAAMonC,GADNpnC,EAAUA,GAAW,CAAC,GACOqnC,eAAiB,GACxCa,EAAgBloC,GAASkoC,eAAiB,GAChD,SAAUZ,EAAWlkC,GACjBq/G,GAAsBr/G,EAAO8kC,GAE7B,MAAM1gD,EAAS4/C,EAAahkC,EAAM7M,YAE9B/O,aAAkBwO,iBACZxO,QAGCA,EAGP4b,aAAiBpN,iBACXoN,QAGCA,CAEf,CACA,OAAI,GAAgBlX,GACT,kBACH,UAAW,MAAMkX,KAASlX,QACfo7C,EAAWlkC,EAEzB,CAJM,GAMJ,YACH,IAAK,MAAMA,KAASlX,QACTo7C,EAAWlkC,EAEzB,CAJM,EAKX,CCjDA,IAAI,GDaJ,GAAevO,MAAQ,EAqCvB,GAAO0yC,OAAS,CAACnkC,EAAOpD,KAEpB,MAAMonC,GADNpnC,EAAUA,GAAW,CAAC,GACOqnC,eAAiB,GAG9C,OADAo7E,GAAsBr/G,EADApD,GAASkoC,eAAiB,IAEzC,IAAItD,GAAewC,EAAahkC,EAAM7M,YAAa6M,EAAM,ECtDpE,SAAWwkC,GACPA,EAASA,EAAiB,OAAI,GAAK,SACnCA,EAASA,EAAe,KAAI,GAAK,MACpC,CAHD,CAGG,KAAa,GAAW,CAAC,IAC5B,MAAM,GAAkBryC,IACpB,MAAM/N,EAAS,EAAc+N,GAE7B,OADA,GAAeV,MAAQ,EAAsBrN,GACtCA,CAAM,EAGV,SAAS,GAAO0E,EAAQ8T,GAC3B,MAAMvH,EAAS,IAAImsC,GACnB,IAAIra,EAAO,GAASud,OAChBC,GAAc,EAClB,MAAMC,EAAgBhoC,GAASgoC,eAAiB,GAC1CC,EAAkBjoC,GAASioC,iBJrBJ,EIsBvBC,EAAgBloC,GAASkoC,eAAiB,GAChD,SAAUZ,IACN,KAAO7uC,EAAOlC,WAAa,GAAG,CAC1B,GAAIg0B,IAAS,GAASud,OAElB,IAEI,GADAC,EAAaC,EAAcvvC,GACvBsvC,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAAIA,EAAaG,EACb,MAAM,IAAI,GAAuB,2BAErC,MAAMC,EAAmBH,EAAcnzC,MACvC4D,EAAO0sC,QAAQgD,GACU,MAArBnoC,GAASooC,UACTpoC,EAAQooC,SAASL,GAErBxd,EAAO,GAAS8d,IACpB,CACA,MAAO77B,GACH,GAAIA,aAAe+P,WAAY,CAC3B,GAAI9jB,EAAOlC,WAAa0xC,EACpB,MAAM,IAAI,GAA6B,kCAE3C,KACJ,CACA,MAAMz7B,CACV,CAEJ,GAAI+d,IAAS,GAAS8d,KAAM,CACxB,GAAI5vC,EAAOlC,WAAawxC,EAEpB,MAEJ,MAAMrY,EAAOj3B,EAAO+sC,QAAQ,EAAGuC,GAC/BtvC,EAAO0sC,QAAQ4C,GACQ,MAAnB/nC,GAASsoC,QACTtoC,EAAQsoC,OAAO5Y,SAEbA,EACNnF,EAAO,GAASud,MACpB,CACJ,CACJ,CACA,OAAI,GAAgB57C,GACT,kBACH,UAAW,MAAMqJ,KAAOrJ,EACpBuM,EAAOssC,OAAOxvC,SACP+xC,IAEX,GAAI7uC,EAAOlC,WAAa,EACpB,MAAM,IAAI,GAAmB,0BAEpC,CARM,GAUJ,YACH,IAAK,MAAMhB,KAAOrJ,EACduM,EAAOssC,OAAOxvC,SACP+xC,IAEX,GAAI7uC,EAAOlC,WAAa,EACpB,MAAM,IAAI,GAAmB,0BAEpC,CARM,EASX,CAxEA,GAAe1B,MAAQ,EAyEvB,GAAO4zC,WAAa,CAACpjC,EAAQrF,KACzB,IAAIzJ,EAAa,EA4BjB,OAAO,GA3BgB28B,kBACnB,OACI,IACI,MAAM,KAAEnK,EAAI,MAAEhkC,SAAgBsgB,EAAOjX,KAAKmI,GAC1C,IAAa,IAATwyB,EACA,OAES,MAAThkC,UACMA,EAEd,CACA,MAAOynB,GACH,GAAiB,mBAAbA,EAAI1R,KACJ,MAAO,CAAEiuB,MAAM,EAAMhkC,MAAO,MAEhC,MAAMynB,CACV,CACA,QAEIjW,EAAa,CACjB,CAER,CAtBsB,GA2BO,IACrByJ,GAAW,CAAC,EAChBooC,SAHc7gD,IAAQgP,EAAahP,CAAC,GAItC,EC1FN,MAAM,GACFsjD,SACAC,SACAxB,MACAyB,WACAx9B,MACA,WAAAlY,GACItP,KAAKujD,OAAQ,EACbvjD,KAAK8kD,SAAW,KAChB9kD,KAAK+kD,SAAW,IACpB,CACA,CAACthB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKglD,kBAEChlD,KAAK+kD,SAAStC,QAED,MAAnBziD,KAAKglD,WACL,MAAM,IAAIxmD,MAAM,0DAEpB,MAAMwmD,EAAahlD,KAAKglD,WAKxB,OAJAhlD,KAAKglD,gBAAa9lD,EAElBc,KAAK8kD,SAAS5gD,UACdlE,KAAK8kD,SAAW,KACTE,CACX,CACA,WAAM,CAAMv+B,GAaR,OAZAzmB,KAAKujD,OAAQ,EACbvjD,KAAKwnB,MAAQf,EACF,MAAPA,IAGAzmB,KAAK+kD,SAAStC,QAAQnf,OAAM,SAC5BtjC,KAAK+kD,SAASvoB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAalwC,EAElB9U,KAAK+kD,SAAS7gD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAK8jD,MAAMr9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAKujD,MACtB,MAAMvjD,KAAKwnB,OAAS,IAAIhpB,MAAM,4CAGlC,KAA0B,MAAnBwB,KAAKglD,kBACFhlD,KAAK8kD,SAASrC,QAEX,MAATzjD,EACAgB,KAAKglD,WAAa,CAAEhiB,MAAM,EAAOhkC,UAGjCgB,KAAKujD,OAAQ,EACbvjD,KAAKglD,WAAa,CAAEhiB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAK+kD,SAAS7gD,UACdlE,KAAK+kD,SAAW,WAGVP,GAAWxkD,KAAK8kD,SAASrC,QAASxoC,GAASgqC,OAAQhqC,EAC7D,ECpHG,MAAM,WAA2Bzb,MACpCuC,KAAO,qBACPgU,KAAO,qBCFJ,MAAM,WAAkCvW,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BCQJ,SAAS,GAAS4wC,EAAQ7oB,EAAO,CAAC,GACrC,MAAMhuB,ECJH,SAAoB62C,EAAQ7oB,GAC/B,MAAMptB,EJ+FC,IAAI,GI9FXi2C,EAAOG,KAAKp2C,GAAO4zB,OAAM6J,MAAO1mB,UACtB/W,EAAMzI,IAAIwf,EAAI,IAExBk/B,EAAOG,KAAO3Y,MAAOhnC,IACjB,UAAW,MAAMqJ,KAAOrJ,QACduJ,EAAMlP,KAAKgP,SAEfE,EAAMzI,KAAK,EAErB,IAAId,EAASw/C,EAAOx/C,OACkB,MAAlCw/C,EAAOx/C,OAAOs9B,OAAOsb,UACrB54C,EAASw/C,EAAOx/C,OAAOs9B,OAAOsb,YAEc,MAAvC4G,EAAOx/C,OAAOs9B,OAAOC,iBAC1Bv9B,EAASw/C,EAAOx/C,OAAOs9B,OAAOC,kBAElC,MAAMqsD,EAAa,IAAIlxC,GAiDvB,MAhDU,CACN3hC,KAAMiwB,MAAOlzB,IAET,GADAA,GAASgqC,QAAQC,iBACK,MAAlBjqC,GAASnL,MAAe,CAExB,MAAM,KAAEk0B,EAAI,MAAEhkC,SAAgBwlD,GAAWr+C,EAAOkC,OAAQ4R,GAASgqC,QACjE,OAAa,IAATjhB,EACO,KAEJhkC,CACX,CACA,KAAO+wF,EAAWv/E,WAAayJ,EAAQnL,OAAO,CAC1C,MAAM,MAAE9P,EAAK,KAAEgkC,SAAewhB,GAAWr+C,EAAOkC,OAAQ4R,GAASgqC,QACjE,IAAa,IAATjhB,EACA,MAAM,IAAI,GAAmB,2BAEjC+sD,EAAW/wC,OAAOhgD,EACtB,CACA,MAAMwQ,EAAMugF,EAAWtwC,QAAQ,EAAGxlC,EAAQnL,OAE1C,OADAihF,EAAW3wC,QAAQnlC,EAAQnL,OACpBU,CAAG,EAEdE,MAAOy9B,MAAOxD,EAAM1vB,KAChBA,GAASgqC,QAAQC,iBAEbva,aAAgB15B,iBACVP,EAAMlP,KAAKmpC,EAAM1vB,SAGjBvK,EAAMlP,KAAKmpC,EAAK1nB,WAAYhI,EACtC,EAEJg2E,OAAQ,KACJ,GAAIF,EAAWv/E,WAAa,EAAG,CAC3B,MAAM0/E,EAAiBvqC,EAAOx/C,OAC9Bw/C,EAAOx/C,OAAUgnC,mBACY,IAArBrQ,GAAMqzD,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAOvqC,CAAM,EAIzB,CDhEkB,CAAWA,EAAQ7oB,GACP,MAAtBA,EAAKqlB,eAAiD,MAAxBrlB,EAAKolB,kBAGnCplB,EAAKolB,gBAAkB,EAAsBplB,EAAKqlB,gBAEtD,MAAMkuC,EAAevzD,GAAMmlB,eAAiB,EACtCZ,EAAevkB,GAAMwkB,eAAiB,EAmD5C,MAlDU,CACNpkC,KAAMiwB,MAAOlzB,IACT,IAAI+nC,GAAc,EAClB,MAAMsuC,EAAe,IAAIzxC,GACzB,OAAa,CAETyxC,EAAatxC,aAAalwC,EAAMoO,KAAK,IAC9BjD,EACHnL,MAAO,KAEX,IACIkzC,EAAaquC,EAAaC,EAC9B,CACA,MAAO7pE,GACH,GAAIA,aAAe+P,WACf,SAEJ,MAAM/P,CACV,CACA,GAAIu7B,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzBllB,GAAMolB,iBAA2BouC,EAAa9/E,WAAassB,EAAKolB,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvBllB,GAAMqlB,eAAyBH,EAAallB,EAAKqlB,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAOrzC,EAAMoO,KAAK,IACXjD,EACHnL,MAAOkzC,GACT,EAENtyC,MAAOy9B,MAAOxD,EAAM1vB,WAEVnL,EAAMY,MAAM,IAAImvC,GAAewC,EAAa1X,EAAKn5B,YAAam5B,GAAO1vB,EAAQ,EAEvFs2E,OAAQpjD,MAAOxD,EAAM1vB,KACjB,MAAMylC,EAAO,IAAIb,MAAkBlV,EAAK6mD,SAAQhhF,GAAO,CAAE6xC,EAAa7xC,EAAIgB,YAAahB,YAEjFV,EAAMY,MAAMgwC,EAAMzlC,EAAQ,EAEpCg2E,OAAQ,IACGnhF,EAAMmhF,SAIzB,CEzFO,MAAM0sC,GAAc,qBAGdC,GAAsB,KCC7BC,GAAU,GAAqB,MAI9B1vF,eAAe,GAAM/tB,EAAQ1M,EAAQuH,SAClCmF,EAAO1P,MAAMgD,EAAQuH,EAC/B,CAqBOkzB,eAAexkC,GAAW2W,EAAQrF,GACrC,MAAMzK,QAZH29B,eAAoB7tB,EAAQrF,GAC/B,MAAMzK,QAAY8P,EAAOpC,KAAKjD,GAC9B,GAAuB,IAAnBzK,EAAIgB,YAAoBhB,EAAIpQ,IAAIoQ,EAAIgB,WAAa,KAAOqsH,GAAQ,GAEhE,MADA5iH,EAAQ7O,IAAIoc,MAAM,wCAAyChY,GACrD,IAAIk4D,GAAoB,mBAElC,OAAOl4D,EAAIiwC,QAAQ,GAAI,EAC3B,CAKsB,CAAKngC,EAAQrF,GAC/B,OAAO,GAAmBzK,EAAIyS,WAClC,CCkBOkrB,eAAeyc,GAAO3D,EAAQ2B,EAAW3tC,GAC5C2tC,EAAYjmD,MAAM2Q,QAAQs1C,GAAaA,EAAY,CAACA,GACpD3tC,EAAQ7O,IAAI60F,MAAM,iCAAkCr4C,GACpD,MAAM0/C,EAAK,GAASrhD,EAAQ,IACrBhsC,EACHkoC,cAAey6E,GACf16E,gBAAiB,IAErB,OAAa,CACTjoC,EAAQ7O,IAAI60F,MAAM,mCAClB,MAAMl4C,QAAiB,GAAuBu/C,EAAIrtF,GAElD,GADAA,EAAQ7O,IAAI60F,MAAM,oBAAqBl4C,GACnCA,IAAa40E,GAAjB,CAMA,GAAI/0E,EAAU58B,SAAS+8B,GAInB,OAHA9tC,EAAQ7O,IAAI60F,MAAM,qCAAsCl4C,EAAUA,SAC5D,GAAkBu/C,EAAI,GAAqB,GAAGv/C,OAAe9tC,GACnEA,EAAQ7O,IAAI60F,MAAM,uCAAwCl4C,EAAUA,GAC7D,CAAE9B,OAAQqhD,EAAGrX,SAAUloC,YAElC,GAAiB,OAAbA,EAQJ9tC,EAAQ7O,IAAI60F,MAAM,qCAAsCl4C,SAClD,GAAkBu/C,EAAI,GAAqB,QAASrtF,GAC1DA,EAAQ7O,IAAI,uCAAwC28C,OAVpD,CAEI,MAAMoM,EAAS,IAAItV,MAAkB+I,EAAUtjD,KAAIo6B,GAAK,GAAO8iB,OAAO,GAAqB,GAAG9iB,UAAU,GAAqB,OAC7HzkB,EAAQ7O,IAAI60F,MAAM,mCAAoCr4C,EAAWG,SAC3D,GAAkBu/C,EAAInzC,EAAQl6C,GACpCA,EAAQ7O,IAAI60F,MAAM,qCAAsCr4C,EAAWG,EAEvE,CAdA,MAJI9tC,EAAQ7O,IAAI60F,MAAM,qCAAsC08B,GAAa50E,SAC/D,GAAkBu/C,EAAI,GAAqB,GAAGq1B,QAAkB1iH,GACtEA,EAAQ7O,IAAI60F,MAAM,uCAAwC08B,GAAa50E,EAoB/E,CACJ,CCnCO5a,eAAe,GAAO8Y,EAAQ2B,EAAW3tC,GAE5C,GAAyB,KADzB2tC,EAAYjmD,MAAM2Q,QAAQs1C,GAAa,IAAIA,GAAa,CAACA,IAC3CnmD,SAA2C,IAA3BwY,EAAQ6iH,eAClC,OAgDR,SAA0B72E,EAAQ8B,EAAU9tC,GACxC,MAAM8iH,EAAe92E,EAAOH,KAAK1pB,KAAK6pB,GAChC+2E,EAAiB/2E,EAAO9/C,OAC9B,IAAI82H,GAAa,EACbC,GAAc,EAClB,MAAMC,EAAkB36E,KACxB,IAAI46E,GAAe,EACfC,GAAkB,EACtB,MAAMC,EAAsB96E,KAC5B,IAAI+6E,GAAe,EACfC,GAAkB,EACtB,MAAMC,EAAsBj7E,KACtB8kD,EAAK,GAAS,CAChBxhD,KAAMi3E,EACN52H,OAAQ62H,GACT,IACI/iH,EACHkoC,cAAey6E,KAyCnBzvF,eAAeuwF,IACX,GAAIR,EAGA,OAFAjjH,EAAQ7O,IAAI60F,MAAM,4CAA6Cl4C,cACzDo1E,EAAgB16E,QAG1By6E,GAAc,EACd,IAESE,IACDnjH,EAAQ7O,IAAI60F,MAAM,gDAAiDl4C,SAe/E5a,iBACI,GAAIkwF,QACMC,EAAoB76E,YAD9B,CAIA46E,GAAkB,EAClB,IACIpjH,EAAQ7O,IAAI60F,MAAM,iDAAkD08B,GAAa50E,SAC3Eu/C,EAAG/W,OAAO,CACZ,GAAqB,GAAGosC,QACxB,GAAqB,GAAG50E,SAE5B9tC,EAAQ7O,IAAI60F,MAAM,iDAAkD08B,GAAa50E,EACrF,CACA,QACIq1E,GAAe,EACfC,GAAkB,EAClBC,EAAoBp5H,SACxB,CAdA,CAeJ,CAjCkBy5H,IAGLJ,IACDtjH,EAAQ7O,IAAI60F,MAAM,gDAAiDl4C,SA8B/E5a,iBACI,GAAIqwF,QACMC,EAAoBh7E,YAD9B,CAIA+6E,GAAkB,EAClB,IACIvjH,EAAQ7O,IAAI60F,MAAM,iDAClB,IAAI5vE,QAAiB,GAAuBi3E,EAAIrtF,GAMhD,GALAA,EAAQ7O,IAAI60F,MAAM,kDAAmD5vE,GACjEA,IAAassG,KACbtsG,QAAiB,GAAuBi3E,EAAIrtF,IAEhDA,EAAQ7O,IAAI60F,MAAM,iDAAkD5vE,EAAU03B,GAC1E13B,IAAa03B,EACb,MAAM,IAAI0f,GAAyB,4BAE3C,CACA,QACI81D,GAAe,EACfC,GAAkB,EAClBC,EAAoBv5H,SACxB,CAlBA,CAmBJ,CApDkB05H,GAEd,CACA,QACIV,GAAc,EACdD,GAAa,EACbE,EAAgBj5H,SACpB,CACJ,CAmDA,GAlHA+hD,EAAOH,KAAO3Y,MAAOhnC,IACjB,MAAM,KAAE2/C,GAASwhD,EAAGrX,eACdnqC,EAAK3Y,kBACP,IAAI0wF,GAAW,EACf,UAAW,MAAMruH,KAAOrJ,EAAQ,CAM5B,GAJIk3H,SACMC,EAAoB76E,QAGzB26E,QAkBK5tH,MAlBS,CACf6tH,GAAkB,EAClBpjH,EAAQ7O,IAAI60F,MAAM,mDAAoD08B,GAAa50E,EAAUv4C,EAAIgB,YACjG,MAAMstH,EAAiB,GAAG/1E,YAEpB,IAAIlJ,GAAe5uC,WAAWsO,KAAK,CAAC,KAC1C,GAAqB,GAAGo+G,QAAkB,EAAcmB,EAAer8H,QAAS,GAAqBq8H,GAAiBtuH,GAAKyS,WAC3HhI,EAAQ7O,IAAI60F,MAAM,mDAAoD08B,GAAa50E,EAAUv4C,EAAIgB,YACjG4sH,GAAe,EACfC,GAAkB,EAClBC,EAAoBp5H,UAEpBw5H,IACKp6F,OAAM7c,IACPxM,EAAQ7O,IAAIoc,MAAM,yDAA0DugC,EAAUthC,EAAI,GAElG,CAIAo3G,GAAW,CACf,CAGKA,SACKH,GAEd,CAnCWvwF,GAmCP,EAuER8Y,EAAO9/C,OAAS,wBAENu3H,IACNzjH,EAAQ7O,IAAI60F,MAAM,4CAA6Cl4C,SACxDu/C,EAAGrX,SAAS9pF,MACtB,CALe,GAMQ,MAApB8/C,EAAO+pD,UAAmB,CAC1B,MAAM+tB,EAAoB93E,EAAO+pD,UAAU5zE,KAAK6pB,GAChDA,EAAO+pD,UAAY7iE,MAAOrQ,IAGjBmgG,SACKS,IAAYp6F,OAAM7c,IACpBxM,EAAQ7O,IAAIoc,MAAM,iDAAkDf,EAAI,UAI1Es3G,EAAkBjhG,EAAK,CAErC,CACA,GAAyB,MAArBmpB,EAAOgqD,WAAoB,CAC3B,MAAM+tB,EAAqB/3E,EAAOgqD,WAAW7zE,KAAK6pB,GAClDA,EAAOgqD,WAAa9iE,MAAOrQ,IAGlBmgG,SACKS,IAAYp6F,OAAM7c,IACpBxM,EAAQ7O,IAAIoc,MAAM,kDAAmDf,EAAI,UAI3Eu3G,EAAmBlhG,EAAK,CAEtC,CACA,GAAoB,MAAhBmpB,EAAO+iD,MAAe,CACtB,MAAMi1B,EAAgBh4E,EAAO+iD,MAAM5sE,KAAK6pB,GACxCA,EAAO+iD,MAAQ77D,MAAOrQ,IAGlB,MAAMw2F,EAAQ,GACV+J,GACA/J,EAAM9yH,KAAK88H,EAAoB76E,SAE/B+6E,GACAlK,EAAM9yH,KAAKi9H,EAAoBh7E,SAE/B6wE,EAAM7xH,OAAS,QAET+iD,GAAWjoB,QAAQ6oB,IAAIkuE,GAAQx2F,GAAMmnB,SAI3Cg5E,GAAa,EACbC,GAAc,EACdC,EAAgBj5H,iBAGd+5H,EAAcnhG,EAAK,CAEjC,CACA,MAAO,CACHmpB,SACA8B,WAER,CA/Oem2E,CAAiBj4E,EAAQ2B,EAAU,GAAI3tC,GAElD,MAAMqtF,EAAK,GAASrhD,EAAQ,IACrBhsC,EACHkoC,cAAey6E,KAEb70E,EAAWH,EAAUt/C,QAC3B,GAAgB,MAAZy/C,EACA,MAAM,IAAIvpD,MAAM,2CAEpByb,EAAQ7O,IAAI60F,MAAM,6BAA8B08B,GAAa50E,GAC7D,MAAMo2E,EAAK,GAAqB,GAAGxB,QAC7ByB,EAAK,GAAqB,GAAGr2E,aFtDhC5a,eAAwB/tB,EAAQi/G,EAASpkH,SACtCmF,EAAOmxE,OAAO8tC,EAASpkH,EACjC,CEqDU,CAAqBqtF,EAAI,CAAC62B,EAAIC,GAAKnkH,GACzCA,EAAQ7O,IAAI60F,MAAM,6CAClB,IAAI5vE,QAAiB,GAAuBi3E,EAAIrtF,GAShD,GARAA,EAAQ7O,IAAI60F,MAAM,oBAAqB5vE,GAEnCA,IAAassG,KACb1iH,EAAQ7O,IAAI60F,MAAM,qCAClB5vE,QAAiB,GAAuBi3E,EAAIrtF,GAC5CA,EAAQ7O,IAAI60F,MAAM,oBAAqB5vE,IAGvCA,IAAa03B,EACb,MAAO,CAAE9B,OAAQqhD,EAAGrX,SAAUloC,YAGlC,IAAK,MAAMA,KAAYH,EAAW,CAC9B3tC,EAAQ7O,IAAI60F,MAAM,qBAAsBl4C,SAClC,GAAkBu/C,EAAI,GAAqB,GAAGv/C,OAAe9tC,GACnEA,EAAQ7O,IAAI60F,MAAM,qCAClB,MAAM5vE,QAAiB,GAAuBi3E,EAAIrtF,GAElD,GADAA,EAAQ7O,IAAI60F,MAAM,6BAA8B5vE,EAAU03B,GACtD13B,IAAa03B,EACb,MAAO,CAAE9B,OAAQqhD,EAAGrX,SAAUloC,WAEtC,CACA,MAAM,IAAI0f,GAAyB,4BACvC,CC/FO,MAAM62D,GAAmB76F,OAAOmL,IAAI,sBCMpC,MAAM2vF,GAIT7tH,GAIAu5F,WAIAv/C,WACAkkD,UACAvoD,SACAm4E,YACAC,WACAruG,OACA+iB,OACA/nC,IAKA0sD,KAIA85C,WAIA8sB,OACAC,OAIAC,YAKA,WAAAtvH,CAAYzD,GACR,MAAM,WAAEo+F,EAAU,WAAEv/C,EAAU,UAAElD,EAAS,MAAEwhD,EAAK,MAAEjlC,EAAK,WAAE86D,GAAehzH,EACxE7L,KAAK0Q,GAAK,GAAI8N,SAASxP,OAAuB,IAAhB/F,KAAKm0B,WAAkB/2B,SAAS,MAAMmE,KAAKm2D,QACzE3gE,KAAKiqG,WAAaA,EAClBjqG,KAAK0qD,WAAaA,EAClB1qD,KAAK4uG,UAAY/iG,EAAK+iG,UACtB5uG,KAAKowB,OAAS,OACdpwB,KAAKqmD,SAAWx6C,EAAKw6C,SACrBrmD,KAAKw+H,YAAc3yH,EAAK2yH,YACxBx+H,KAAKy+H,WAAa5yH,EAAK4yH,WACvBz+H,KAAKmzC,OAAStnC,EAAKsnC,OACnBnzC,KAAKoL,IAAMS,EAAK2xC,OAAO2iD,aAAa,qBAAqBngG,KAAK4uG,aAAa5uG,KAAK0Q,MAC7C,MAA/B1Q,KAAKiqG,WAAWv1C,cAChB10D,KAAKiqG,WAAajqG,KAAKiqG,WAAW31C,YAAY,QAAQt0D,KAAK0qD,eAE/D1qD,KAAK4xG,WAAapqD,EAClBxnD,KAAK0+H,OAAS11B,EACdhpG,KAAK2+H,OAAS56D,EACd/jE,KAAK4+H,YAAcC,EACnB7+H,KAAK83D,KAAO,EAChB,CACA,CAACr0B,OAAOqB,aAAe,aACvB,CAACw5F,KAAoB,EAIrB,WAAIx2E,GACA,OAAO9nD,KAAK4+H,aAChB,CAIA,eAAMp3E,CAAUI,EAAW3tC,GACvB,GAAoB,YAAhBja,KAAKowB,OACL,MAAM,IAAI02C,GAAuB,kCAErC,GAAoB,WAAhB9mE,KAAKowB,OACL,MAAM,IAAI22C,GAAsB,4BAKpC,GAHKplE,MAAM2Q,QAAQs1C,KACfA,EAAY,CAACA,IAEE,MAAf5nD,KAAKmzC,SAAsD,IAApCl5B,GAASouF,uBAChC,MAAM,IAAIvgC,GAAuB,qDAErC,MAAM7hB,QAAejmD,KAAK4xG,WAAWhqD,EAAW3tC,GAEhD,OADAgsC,EAAO2oD,UAAY,WACZ3oD,CACX,CAIA,WAAM+iD,CAAM/uF,EAAU,CAAC,GACnB,GAAoB,WAAhBja,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,OAArC,CAKA,GAFApwB,KAAKoL,IAAI,2BAA4BpL,KAAKiqG,YAC1CjqG,KAAKowB,OAAS,UACQ,MAAlBnW,EAAQgqC,OAAgB,CACxB,MAAMA,EAAS8kD,YAAYniF,QA1GjB,KA4GV3M,EAAU,IACHA,EACHgqC,SAER,CACA,IACIjkD,KAAKoL,IAAI60F,MAAM,sCAETjgG,KAAK0+H,OAAOzkH,GAClBja,KAAKoL,IAAI60F,MAAM,qCACfjgG,KAAKowB,OAAS,SACdpwB,KAAKqmD,SAAS2iD,MAAQx+F,KAAKm2D,KAC/B,CACA,MAAOl6C,GACHzmB,KAAKoL,IAAIoc,MAAM,8DAA+DxnB,KAAKiqG,WAAYxjF,GAC/FzmB,KAAK+jE,MAAMt9C,EACf,CAtBA,CAuBJ,CACA,KAAAs9C,CAAMt9C,GACkB,WAAhBzmB,KAAKowB,SAGTpwB,KAAKoL,IAAIoc,MAAM,yCAA0CxnB,KAAKiqG,WAAYxjF,GAC1EzmB,KAAKowB,OAAS,UAEdpwB,KAAK2+H,OAAOl4G,GACZzmB,KAAKowB,OAAS,SACdpwB,KAAKqmD,SAAS2iD,MAAQx+F,KAAKm2D,MAC/B,ECtGJ,SAASm+D,GAAa/2E,EAAU6mD,EAAWtnD,GACvC,IAAIy3E,EAAc,EAMlB,OALAz3E,EAAWQ,QAAQ36C,SAAQ84C,IACnBA,EAAO2oD,YAAcA,GAAa3oD,EAAO8B,WAAaA,GACtDg3E,GACJ,IAEGA,CACX,CACO,MAAMC,GACT52E,WACA62E,qBACAC,aACAC,sBACAC,uBACAC,wCACAC,yCACAx+H,OACA49F,QACA,WAAApvF,CAAY84C,EAAYv8C,GACpB7L,KAAKooD,WAAaA,EAClBpoD,KAAKi/H,qBAAuB,IAAIpxF,IAChChiC,EAAKozH,qBAAqB9xH,SAAQoyH,IAC9Bv/H,KAAKi/H,qBAAqB3/H,IAAIigI,EAAUx3E,SAAUw3E,EAAU,IAEhEv/H,KAAKk/H,aAAe,IAAIrxF,IACxBhiC,EAAKqzH,aAAa/xH,SAAQqyH,IACtBx/H,KAAKk/H,aAAa5/H,IAAIkgI,EAAMz3E,SAAUy3E,EAAM,IAEhDx/H,KAAKm/H,sBAAwBtzH,EAAKszH,uBjDzDX,IiD0DvBn/H,KAAKo/H,uBAAyBvzH,EAAKuzH,wBjD1DZ,IiD2DvBp/H,KAAKq/H,wCAA0CxzH,EAAKwzH,yCjDvDhB,IiDwDpCr/H,KAAKs/H,yCAA2CzzH,EAAKyzH,0CjDxDjB,IiDyDpCt/H,KAAKc,OAASsnD,EAAWtnD,OACzBd,KAAK0+F,QAAU,CACX+gC,MAAOr3E,EAAWs2C,SAAS6X,qBAAqB,yCAChDpvF,OAAQihC,EAAWs2C,SAAS6X,qBAAqB,+CAEzD,CACA,CAAC9yE,OAAOqB,aAAe,mBACvB,2BAAM46F,CAAsB9rH,KAAWzR,GACnC,MAAMw9H,EAAgB3/H,KAAKooD,WAAWwhE,gBAAgBh2G,GACtD,GAAqB,MAAjB+rH,IAIW,UADMA,EAAcp9H,MAAMvC,KAAKooD,WAAWwhE,gBAAiBznH,GAEtE,MAAM,IAAIumH,GAA2B,gDAAgD90G,IAE7F,CAIA,oBAAMgsH,CAAenpB,EAAQ35E,EAAO,CAAC,GACjC,IAKI,GAJA98B,KAAK0+F,QAAQ+gC,OAAO/kC,UAAU,CAC1Bs4B,SAAS,WAEQhzH,KAAKooD,WAAWI,kBAAkBwrE,yBAAyBvd,GAE5E,MAAM,IAAIkS,GAAsB,qBAIpC,aAFM3oH,KAAK0/H,sBAAsB,wBAAyBjpB,SACvCz2G,KAAK6/H,gBAAgBppB,EAAQ,UAAW35E,EAE/D,CACA,MAAOrW,GAIH,MAHAzmB,KAAK0+F,QAAQv3E,QAAQuzE,UAAU,CAC3Bs4B,SAAS,IAEPvsG,CACV,CACA,QACIzmB,KAAKooD,WAAWI,kBAAkByrE,qBACtC,CACJ,CAIA,qBAAMnd,CAAgBL,EAAQ35E,EAAO,CAAC,GAClC,IACI98B,KAAK0+F,QAAQ+gC,OAAO/kC,UAAU,CAC1Bu4B,UAAU,IAEd,MAAM6M,EAAQrpB,EAAOxM,WAAWv1C,YAChC,IAAIqrE,EAKJ,OAJa,MAATD,IACAC,EAAezwC,GAAiBwwC,SAC1B9/H,KAAK0/H,sBAAsB,yBAA0BK,EAActpB,UAEhEz2G,KAAK6/H,gBAAgBppB,EAAQ,WAAY35E,EAC1D,CACA,MAAOrW,GAIH,MAHAzmB,KAAK0+F,QAAQv3E,QAAQuzE,UAAU,CAC3Bu4B,UAAU,IAERxsG,CACV,CACJ,CACA,qBAAMo5G,CAAgBppB,EAAQ7H,EAAW9xE,GACrC,IAAIkjG,EACAt1E,EACAu1E,EACAC,EACAC,EACJ,MACMl8E,EAASspE,GAAU,CADIxkB,YAAYniF,QAAsB,YAAdgoF,EAA0B5uG,KAAKm/H,sBAAwBn/H,KAAKo/H,wBAC7DtiG,EAAKmnB,SAErDnnB,EAAKmnB,OAASA,EACdjkD,KAAKooD,WAAWs2C,SAAS0hC,yBAAyB3pB,GAClDA,EAAOrrG,IAAI60F,MAAM,qCAAsC2O,GAEvD,IAAIyxB,EAAgB5pB,EACpB,IAA6B,IAAzB35E,GAAMwjG,eAAyB,CAC/B,MAAMC,EAAYvgI,KAAKooD,WAAWq1D,oBACjB,MAAb8iB,IACA9pB,EAAOrrG,IAAI,+BAAgCwjG,GAC3CyxB,QAAsBE,EAAUC,QAAQ/pB,EAAQ35E,GAExD,CACA,IAGI,GADAkjG,EAAgBK,GACa,IAAzBvjG,GAAM2jG,eAAyB,CAC/B3jG,GAAMq6E,aAAa,IAAIf,GAAoB,oBAAoBxH,mBAE3Dr3C,KAAMyoE,EACNt1E,aACA3C,SAAUo4E,SACW,YAAdvxB,EACL5uG,KAAK0gI,gBAAgBL,EAAe,IAC/BvjG,EACHmnB,WAEFjkD,KAAK2gI,iBAAiBN,EAAe,IAChCvjG,EACHmnB,aAER,MAAMwyD,EAAS,IACR4pB,KACAL,SAEDhgI,KAAK0/H,sBAAoC,YAAd9wB,EAA0B,iCAAmC,kCAAmClkD,EAAY+rD,EACjJ,KACK,CACD,MAAMqpB,EAAQrpB,EAAOxM,WAAWv1C,YAChC,GAAa,MAATorE,EACA,MAAM,IAAIx4D,GAAsB,GAAGsnC,4DAEvC,MAAMmxB,EAAezwC,GAAiBwwC,GACtCK,EAAiB,SACjBz1E,EAAaq1E,CACjB,CAGA,GAAIr1E,EAAWpc,OAAOtuC,KAAKooD,WAAWrB,QAAS,CAC3C,MAAMtgC,EAAM,IAAI4gD,GAAmB,qBAEnC,MADAovC,EAAO1yC,MAAMt9C,GACPA,CACV,CAEA,GADAw5G,EAAeD,EACW,MAAtBljG,GAAMojG,aACNA,EAAepjG,EAAKojG,kBAEnB,GAAIlgI,KAAKk/H,aAAazgI,KAAO,EAAG,CACjCq+B,GAAMq6E,aAAa,IAAIf,GAAoB,sBAAsBxH,iBAEjE,MAAMgyB,QAAmC,YAAdhyB,EACrB5uG,KAAK6gI,kBAAkB,IAClBR,KACAL,GACJhgI,KAAKk/H,aAAcpiG,GACpB98B,KAAK8gI,mBAAmB,IACnBT,KACAL,GACJhgI,KAAKk/H,aAAcpiG,IAC1BojG,EAAeU,EAAYV,aAC3BD,EAAeW,EAAY36E,MAC/B,CACJ,CACA,MAAOx/B,GAEH,MADAgwF,EAAOrrG,IAAIoc,MAAM,kDAAiE,YAAdonF,EAA0B,OAAS,KAAM6H,EAAOxM,WAAYxjF,GAC1HA,CACV,CACA,QACIw9B,EAAO1kD,OACX,CAGA,aAFMS,KAAK0/H,sBAAoC,YAAd9wB,EAA0B,gCAAkC,iCAAkClkD,EAAY+rD,GAC3IA,EAAOrrG,IAAI,sCAAuCwjG,GAC3C5uG,KAAK+gI,kBAAkB,CAC1BZ,iBACAvxB,YACA6H,SACAwpB,eACAC,eACAx1E,aACAvX,OAAQrW,GAAMqW,QAEtB,CAIA,iBAAA4tF,CAAkBjkG,GACd,MAAM,eAAEqjG,EAAc,UAAEvxB,EAAS,OAAE6H,EAAM,aAAEwpB,EAAY,WAAEv1E,EAAU,aAAEw1E,EAAY,OAAE/sF,GAAWrW,EAC9F,IAAI0iG,EACAh4E,EACAF,EACgB,MAAhB44E,IAEAV,EAAQU,EAAa7tB,kBAAkB,CACnCzD,YAEAqD,iBAAkB+uB,IACI,MAAd15E,GAGC/qB,QAAQr4B,UACRq/B,MAAK4J,UACN,MAAMya,EAAY5nD,KAAKooD,WAAWmT,UAAUoK,eACtC1hB,EAAS8kD,YAAYniF,QAAQ5mB,KAAKq/H,0CAElC,OAAEp5E,EAAM,SAAE8B,SAAmB,GAAWi5E,EAAap5E,EAAW,CAClE3D,SACA74C,IAAK41H,EAAY51H,IACjB+kF,YAAY,IAEhB,GAAkB,MAAd7oC,EACA,OAEJA,EAAWl8C,IAAI,+BAAgC28C,GAC/C,MAAMk5E,EAhQ9B,SAAiCl5E,EAAUwT,GACvC,IACI,MAAM,QAAEthD,GAAYshD,EAAU6/D,WAAWrzE,GACzC,OAAO9tC,EAAQ6vC,iBACnB,CACA,MAAOrjC,GACH,GAAiB,2BAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,OnBhBuC,EmBiB3C,CAqP8Cy6G,CAAwBn5E,EAAU/nD,KAAKooD,WAAWmT,WAExE,GADoBujE,GAAa/2E,EAAU,UAAWT,KAClC25E,EAAe,CAC/B,MAAMx6G,EAAM,IAAIshD,GAAmC,mDAAmDhgB,cAAqBk5E,KAE3H,MADAD,EAAYj9D,MAAMt9C,GACZA,CACV,CAGAu6G,EAAY76H,OAAS8/C,EAAO9/C,OAC5B66H,EAAYl7E,KAAOG,EAAOH,KAC1Bk7E,EAAYj5E,SAAWA,EAEE,MAArB9B,EAAOgqD,aACP+wB,EAAY/wB,WAAahqD,EAAOgqD,YAGZ,MAApBhqD,EAAO+pD,YACPgxB,EAAYhxB,UAAY/pD,EAAO+pD,WAGf,MAAhB/pD,EAAO+iD,QACPg4B,EAAYh4B,MAAQ/iD,EAAO+iD,aAIzBhpG,KAAKooD,WAAW0N,UAAUzyC,MAAMqnC,EAAY,CAC9C9C,UAAW,CAACG,KAEhB/nD,KAAKooD,WAAWs2C,SAASyiC,oBAAoBH,EAAa15E,GAC1DtnD,KAAKohI,UAAU,CAAE95E,aAAYrB,OAAQ+6E,EAAaj5E,YAAW,IAE5DzkB,OAAM6J,MAAO1mB,IACd6gC,EAAWl8C,IAAIoc,MAAM,4CAA6Cw5G,EAAYtwH,GAAI+V,GAChD,MAA9Bu6G,EAAY36E,SAAS2iD,aACfg4B,EAAYh4B,OACtB,GACF,IAGVxhD,EAAYra,MAAOya,EAAW3tC,EAAU,CAAC,KACrC,GAAa,MAATulH,EACA,MAAM,IAAI5W,GAAsB,iCAEpCthE,EAAWl8C,IAAI60F,MAAM,uCAAwCr4C,GAC7D,MAAMo5E,QAAoBxB,EAAMh4E,YAChCF,EAAWl8C,IAAI60F,MAAM,yCAA0C+gC,EAAYtwH,GAAIk3C,GAC/E,IACI,GAAsB,MAAlB3tC,EAAQgqC,OAAgB,CACxB+8E,EAAY51H,IAAI,oGAAqGw8C,GACrH,MAAM3D,EAAS8kD,YAAYniF,QAAQ5mB,KAAKs/H,0CAExCrlH,EAAU,IACHA,EACHgqC,SAER,CACA+8E,EAAY51H,IAAI60F,MAAM,uCAAwCr4C,GAC9D,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWi5E,EAAap5E,EAAW,IAC/D3tC,EACH7O,IAAK41H,EAAY51H,IACjB+kF,YAAY,IAEhB6wC,EAAY51H,IAAI60F,MAAM,uBAAwBl4C,GAC9C,MAAMs5E,EApT1B,SAAiCt5E,EAAUwT,EAAWthD,EAAU,CAAC,GAC7D,IACI,MAAM,QAAEA,GAAYshD,EAAU6/D,WAAWrzE,GACzC,GAAkC,MAA9B9tC,EAAQiuF,mBACR,OAAOjuF,EAAQiuF,kBAEvB,CACA,MAAOzhF,GACH,GAAiB,2BAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,OAAOxM,EAAQiuF,oBnB7ByB,EmB8B5C,CAuS0Co5B,CAAwBv5E,EAAU/nD,KAAKooD,WAAWmT,UAAWthD,GAC7E8kH,EAAcD,GAAa/2E,EAAU,WAAYT,GACvD,GAAIy3E,GAAesC,EAAe,CAC9B,MAAM56G,EAAM,IAAIuhD,GAAoC,oDAAoDjgB,QAAeg3E,KAAesC,KAEtI,MADAL,EAAYj9D,MAAMt9C,GACZA,CACV,CAwBA,aArBMzmB,KAAKooD,WAAW0N,UAAUzyC,MAAMqnC,EAAY,CAC9C9C,UAAW,CAACG,KAIhBi5E,EAAY76H,OAAS8/C,EAAO9/C,OAC5B66H,EAAYl7E,KAAOG,EAAOH,KAC1Bk7E,EAAYj5E,SAAWA,EAEE,MAArB9B,EAAOgqD,aACP+wB,EAAY/wB,WAAahqD,EAAOgqD,YAGZ,MAApBhqD,EAAO+pD,YACPgxB,EAAYhxB,UAAY/pD,EAAO+pD,WAGf,MAAhB/pD,EAAO+iD,QACPg4B,EAAYh4B,MAAQ/iD,EAAO+iD,OAE/BhpG,KAAKooD,WAAWs2C,SAASyiC,oBAAoBH,EAAa15E,GACnD05E,CACX,CACA,MAAOv6G,GAKH,MAJA6gC,EAAWl8C,IAAIoc,MAAM,iFAAgG,YAAdonF,EAA0B,OAAS,KAAM9xE,EAAK25E,OAAOxM,WAAYriD,EAAWnhC,GACjJ,MAA9Bu6G,EAAY36E,SAAS2iD,OACrBg4B,EAAYj9D,MAAMt9C,GAEhBA,CACV,GAGC8V,QAAQ6oB,IAAI,CACbo6E,EAAM15E,KAAKm6E,EAAa95H,QACxB85H,EAAan6E,KAAK05E,EAAMr5H,UACzBm9B,OAAM7c,IACL6gC,EAAWl8C,IAAIoc,MAAM,uCAAwCf,EAAI,KAGzE,MAAM86G,EAAY9qB,EAAOpwD,SD9O1B,IAA0Bx6C,EC4SzB,OA7DA4qG,EAAOpwD,SAAW,IAAIm7E,MAAMD,EAAW,CACnCjiI,IAAK,IAAI6C,KACW,UAAZA,EAAK,IAA6B,MAAXA,EAAK,IAAiC,MAAnBo/H,EAAUv4B,OAEpD,WACI,IAC8B,SAAtB1hD,EAAWl3B,cACLk3B,EAAW0hD,OAEzB,CACA,MAAOviF,GACH6gC,EAAWl8C,IAAIoc,MAAM,mDAAoDf,EAC7E,CACA,QACIzmB,KAAKc,OAAOyrD,kBAAkB,mBAAoB,CAC9C5E,OAAQL,GAEhB,CACH,EAdD,GAcKhkB,OAAM7c,IACP6gC,EAAWl8C,IAAIoc,MAAM,2DAA4Df,EAAI,IAGtFg7G,QAAQniI,OAAO6C,MAG9Bs0G,EAAOpwD,SAASq7E,SAAWl3H,KAAKm2D,MDxQP90D,EC6QK,CAC1Bo+F,WAAYwM,EAAOxM,WACnBv/C,aACAt6B,OAAQ,OACRw+E,YACAvoD,SAAUowD,EAAOpwD,SACjBm4E,YAAagB,GAAOz3E,SACpB02E,WAAY0B,EACZhtF,SACAqK,OAAQx9C,KAAKooD,WAAW5K,OACxBgK,UAAWA,GAdqB,MAChC,MAAM,IAAIohE,GAAsB,gCAAgC,GAchEiW,WAAY,IACDW,GAAO13E,SAAW,GAE7BkhD,MAAO77D,MAAOlzB,UAEJulH,GAAOx2B,MAAM/uF,UAEbw8F,EAAOzN,MAAM/uF,EAAQ,EAE/B8pD,MAAQt9C,IACJgwF,EAAO1yC,MAAMt9C,GAEb+4G,GAAOz7D,MAAMt9C,EAAI,GAvBzB6gC,ED5QG,IAAIi3E,GAAe1yH,GCsStB7L,KAAKc,OAAOyrD,kBAAkB,kBAAmB,CAC7C5E,OAAQL,IAGZA,EAAWq6E,iBAAmBJ,EACvBj6E,CACX,CAIA,SAAA85E,CAAUtkG,GACN,MAAM,WAAEwqB,EAAU,OAAErB,EAAM,SAAE8B,GAAajrB,GACnC,QAAE8iF,EAAO,QAAE3lG,GAAYja,KAAKooD,WAAWmT,UAAU6/D,WAAWrzE,GAClE,GAAyB,MAArBT,EAAWnU,SAAqD,IAAnCl5B,EAAQouF,uBACrC,MAAM,IAAIvgC,GAAuB,qDAErC83C,EAAQ,CAAEt4D,aAAYrB,UAC1B,CAIA,qBAAMy6E,CAAgBp5E,EAAYrtC,GAC9B,MAAM2tC,EAAYjmD,MAAM4c,KAAKve,KAAKi/H,qBAAqB/5H,QACvD,IACI,MAAM,OAAE+gD,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D3tC,EACH7O,IAAKk8C,EAAWl8C,MAEdm0H,EAAYv/H,KAAKi/H,qBAAqB7/H,IAAI2oD,GAChD,GAAiB,MAAbw3E,EACA,MAAM,IAAI1W,GAAsB,8BAA8B9gE,KAGlE,OADAT,EAAWl8C,IAAI,+CAAgDk8C,EAAW2iD,WAAYliD,GAC/E,UACMw3E,EAAUz/B,cAAc75C,EAAQhsC,GACzC8tC,WAER,CACA,MAAOthC,GAEH,MADA6gC,EAAWl8C,IAAIoc,MAAM,+CAAgD8/B,EAAW2iD,WAAYxjF,GACtF,IAAIoiG,GAAsBpiG,EAAIja,QACxC,CACJ,CAKA,sBAAMm0H,CAAiBr5E,EAAYrtC,GAC/B,MAAM2tC,EAAYjmD,MAAM4c,KAAKve,KAAKi/H,qBAAqB/5H,QACvD,IACIoiD,EAAWl8C,IAAI60F,MAAM,8BAA+Br4C,GACpD,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D3tC,EACH7O,IAAKk8C,EAAWl8C,IAChB+kF,YAAY,IAEVovC,EAAYv/H,KAAKi/H,qBAAqB7/H,IAAI2oD,GAChD,GAAiB,MAAbw3E,EACA,MAAM,IAAI1W,GAAsB,8BAA8B9gE,KAGlE,OADAT,EAAWl8C,IAAI,gDAAiDk8C,EAAW2iD,WAAYliD,GAChF,UACMw3E,EAAU//B,eAAev5C,EAAQhsC,GAC1C8tC,WAER,CACA,MAAOthC,GAEH,MADA6gC,EAAWl8C,IAAIoc,MAAM,8CAA+C8/B,EAAW2iD,WAAYxjF,GACrF,IAAIoiG,GAAsBpiG,EAAIja,QACxC,CACJ,CAKA,wBAAMs0H,CAAmBx5E,EAAYs6E,EAAQ3nH,GACzC,MAAM2tC,EAAYjmD,MAAM4c,KAAKqjH,EAAO18H,QACpCoiD,EAAWl8C,IAAI,8BAA+Bw8C,GAC9C,IACIN,EAAWl8C,IAAI60F,MAAM,iCAAkCr4C,GACvD,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D3tC,EACH7O,IAAKk8C,EAAWl8C,IAChB+kF,YAAY,IAIhB,OAFA7oC,EAAWl8C,IAAI,gCAAiC28C,GAEzC,CAAE9B,SAAQi6E,aADI0B,EAAOxiI,IAAI2oD,GAEpC,CACA,MAAOthC,GAEH,MADA6gC,EAAWl8C,IAAIoc,MAAM,yCAA0Cf,GACzD,IAAImiG,GAAsB55G,OAAOyX,GAC3C,CACJ,CAKA,uBAAMo6G,CAAkBv5E,EAAYs6E,EAAQ3nH,GACxC,MAAM2tC,EAAYjmD,MAAM4c,KAAKqjH,EAAO18H,QACpCoiD,EAAWl8C,IAAI,6BAA8Bw8C,GAC7C,IACI,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D3tC,EACH7O,IAAKk8C,EAAWl8C,MAGpB,MAAO,CAAE66C,SAAQi6E,aADI0B,EAAOxiI,IAAI2oD,GAEpC,CACA,MAAOthC,GAEH,MADA6gC,EAAWl8C,IAAIoc,MAAM,wCAAyCf,GACxD,IAAImiG,GAAsB55G,OAAOyX,GAC3C,CACJ,EC7gBG,MAAMo7G,WAAez1E,GACxBrF,OACA+O,UACAgsE,eACAhS,YACApxB,QACA7oC,SACArY,OACAptB,OACAg4B,WACAh9C,IACA,WAAAkE,CAAYzD,GACRukC,QACApwC,KAAKowB,OAAS,UAGd,MAAMtvB,EAAS,IAAIsrD,GACb21E,EAAmBjhI,EAAOwrD,cAAclwB,KAAKt7B,GACnDA,EAAOwrD,cAAiBhsD,IACpB,MAAM0hI,EAAiBD,EAAiBzhI,GAClC2hI,EAAiBjiI,KAAKssD,cAAc,IAAIE,YAAYlsD,EAAI6E,KAAM,CAAEwiD,OAAQrnD,EAAIqnD,UAClF,OAAOq6E,GAAkBC,CAAc,EAI3CjiI,KAAK+mD,OAASl7C,EAAKk7C,OACnB/mD,KAAKw9C,OAAS3xC,EAAK2xC,QAAU2gE,KAC7Bn+G,KAAKoL,IAAMpL,KAAKw9C,OAAO2iD,aAAa,UAEpCngG,KAAK61D,SAAW,CAAC,EAEjB,MAAMzN,EAAapoD,KAAKooD,WzDWzB,SAA2Bv8C,EAAO,CAAC,GACtC,MAAMu8C,EAAa,IAAI2gE,GAAkBl9G,GAuBzC,OAtBc,IAAI21H,MAAMp5E,EAAY,CAChC,GAAAhpD,CAAI8qB,EAAQvc,EAAM2yD,GACd,GAAoB,iBAAT3yD,IAAsB67G,GAAuBx+F,SAASrd,GAAO,CACpE,MAAMyd,EAAUg9B,EAAWA,WAAWz6C,GACtC,GAAe,MAAXyd,IAAoBm+F,GAAkBv+F,SAASrd,GAC/C,MAAM,IAAIs6G,GAAoB,GAAGt6G,aAErC,OAAOyd,CACX,CACA,OAAOq2G,QAAQriI,IAAI8qB,EAAQvc,EAAM2yD,EACrC,EACAhhE,IAAG,CAAC4qB,EAAQvc,EAAM3O,KACM,iBAAT2O,EACPy6C,EAAWA,WAAWz6C,GAAQ3O,EAG9ByiI,QAAQniI,IAAI4qB,EAAQvc,EAAM3O,IAEvB,IAKnB,CyDpC6CkjI,CAAkB,CACnDn7E,OAAQl7C,EAAKk7C,OACbqjB,WAAYv+D,EAAKu+D,WACjBk+B,SAAUz8F,EAAKy8F,UAAY,CACvBvnG,KCxDI,SDyDJwsC,QC1DO,SD4DXiQ,OAAQx9C,KAAKw9C,OACb18C,SACAujH,UAAWx4G,EAAKw4G,WAAa,IAAI2C,GACjC4C,gBAAiBA,GAAgB/9G,EAAK+9G,iBACtCjW,IAAK9nG,EAAK8nG,MAEd3zG,KAAK81D,UAAY91D,KAAKmiI,mBAAmB,YtE6G1C,SAA6B/5E,EAAYv8C,EAAO,CAAC,GACpD,OAAO,IAAIi6G,GAAoB19D,EAAYv8C,EAC/C,CsE/G8Du2H,CAAoBh6E,EAAY,CAClF47D,cAAehkH,KAAKooD,WAAWwhE,gBAAgBU,0BAC5Cz+G,EAAKiqD,aAGQ,MAAhBjqD,EAAK6yF,UACL1+F,KAAK0+F,QAAU1+F,KAAKmiI,mBAAmB,UAAWt2H,EAAK6yF,QAAQ1+F,KAAKooD,cAExEA,EAAWtnD,OAAOsjD,iBAAiB,eAAe9jD,IAE9C,GAA2B,MAAvBA,EAAIqnD,OAAO29D,SAAkB,CAC7B,MAAMxsD,EAAW,CACbpoD,GAAIpQ,EAAIqnD,OAAOD,KAAKh3C,GACpBoyF,WAAYxiG,EAAIqnD,OAAOD,KAAK+7C,UAAUn/F,KAAIqc,GAAKA,EAAE6iF,aAErDp7C,EAAWtnD,OAAOyrD,kBAAkB,iBAAkB,CAAE5E,OAAQmR,GACpE,KAG4B,MAA5BjtD,EAAK4xG,qBACLz9G,KAAKmiI,mBAAmB,sBAAuBt2H,EAAK4xG,oBAAoBr1D,IAG5EpoD,KAAKooD,WAAWyuD,SAAW,IAAImoB,GAAgBh/H,KAAKooD,WAAY,CAC5D62E,sBAAuBpzH,EAAKozH,sBAAwB,IAAI36H,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKmiI,mBAAmB,yBAAyBt3H,IAAShL,EAAGG,KAAKooD,eAC7I82E,cAAerzH,EAAKqzH,cAAgB,IAAI56H,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKmiI,mBAAmB,iBAAiBt3H,IAAShL,EAAGG,KAAKooD,eACrH+2E,sBAAuBtzH,EAAK28C,mBAAmB22E,sBAC/CC,uBAAwBvzH,EAAK28C,mBAAmB42E,yBAGpDp/H,KAAKmiI,mBAAmB,mBAAoB,IAAIpG,GAAwB/7H,KAAKooD,WAAYv8C,EAAKuxG,mBAE9Fp9G,KAAKmiI,mBAAmB,oBAAqB,IAAInQ,GAAyBhyH,KAAKooD,WAAYv8C,EAAK28C,qBACxD,IAApC38C,EAAKw2H,mBAAmBh4H,SAExBrK,KAAKmiI,mBAAmB,oBAAqB,IAAIlM,GAAkBj2H,KAAKooD,WAAYv8C,EAAKw2H,oBAG7FriI,KAAKmiI,mBAAmB,YAAa,IAAIpH,GAAiB/6H,KAAKooD,aAE/DpoD,KAAKmiI,mBAAmB,iBAAkB,IAAI/a,GAAsBpnH,KAAKooD,WAAYv8C,EAAK43F,YAE1F,MAAM6+B,GAAez2H,EAAKy2H,aAAe,IAAIh+H,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKmiI,mBAAmB,eAAet3H,IAAShL,EAAGG,KAAKooD,eACxHpoD,KAAK8vH,YAAc9vH,KAAKooD,WAAW0nE,YAAc9vH,KAAKmiI,mBAAmB,cAAe,IAAI5I,GAAmBv5H,KAAKooD,WAAY,CAC5HuuE,QAAS2L,KAGb,MAAMC,GAAkB12H,EAAK02H,gBAAkB,IAAIj+H,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKmiI,mBAAmB,kBAAkBt3H,IAAShL,EAAGG,KAAKooD,eAiBjI,GAhBApoD,KAAK8hI,eAAiB9hI,KAAKooD,WAAW05E,eAAiB9hI,KAAKmiI,mBAAmB,iBAAkB,IAAIzL,GAAuB12H,KAAKooD,WAAY,CACzIuuE,QAAS4L,KAGbviI,KAAKmiI,mBAAmB,aAAc,IAAI5H,GAAWv6H,KAAKooD,cACzDv8C,EAAK22H,eAAiB,IAAIr1H,SAAQ,CAACtN,EAAIgL,KACpB7K,KAAKmiI,mBAAmB,kBAAkBt3H,IAAShL,EAAGG,KAAKooD,aACnEhE,iBAAiB,QAAS9jD,IAC9BN,MAAK,EAAiBM,EAAI,GAC5B,IAGNuL,EAAKmwH,YAAY7uH,SAAQ,CAACtN,EAAIgL,KAC1B7K,KAAKooD,WAAWg1D,iBAAiBpgG,IAAIhd,KAAKmiI,mBAAmB,aAAat3H,IAAShL,EAAGG,KAAKooD,aAAa,IAGvF,MAAjBv8C,EAAKgqD,SACL,IAAK,MAAM90D,KAAQpC,OAAOuG,KAAK2G,EAAKgqD,UAAW,CAC3C,MACMzqC,GAAUq3G,EADM52H,EAAKgqD,SAAS90D,IACNf,KAAKooD,YACpB,MAAXh9B,GAIJprB,KAAK61D,SAAS90D,GAAQqqB,EACtBprB,KAAKmiI,mBAAmBphI,EAAMqqB,GACO,MAAjCA,EAAQuyF,MACR39G,KAAKoL,IAAI,6CAA8CrK,GACvDwhI,EAAe/hI,KAAK4qB,EAAQuyF,MAEE,MAA9BvyF,EAAQwyF,MACR59G,KAAKoL,IAAI,0CAA2CrK,GACpDuhI,EAAY9hI,KAAK4qB,EAAQwyF,MAEO,MAAhCxyF,EAAQu1E,MACR3gG,KAAKoL,IAAI,4CAA6CrK,GACtDqqB,EAAQu1E,IAAqBv8C,mBAAmB,QAAS9jD,IACrDN,MAAK,EAAiBM,EAAI,MAhB9BN,KAAKoL,IAAIoc,MAAM,yDAA0DzmB,EAmBjF,EzDhEL,SAAkCqnD,GACrC,MAAM0mC,EAAsB,CAAC,EAC7B,IAAK,MAAM1jE,KAAWzsB,OAAOsE,OAAOmlD,EAAWA,YAC3C,IAAK,MAAMs6E,KAAcjZ,GAAuBr+F,GAC5C0jE,EAAoB4zC,IAAc,EAG1C,IAAK,MAAMt3G,KAAWzsB,OAAOsE,OAAOmlD,EAAWA,YAC3C,IAAK,MAAMs6E,KAAchZ,GAAuBt+F,GAC5C,IAAwC,IAApC0jE,EAAoB4zC,GACpB,MAAM,IAAIxa,GAA8B,YAAYyB,GAAev+F,4BAAkCs3G,qHAIrH,CyDqDQC,CAAyBv6E,EAC7B,CACA,kBAAA+5E,CAAmBphI,EAAM6hI,GAMrB,OALiB,MAAbA,GACA5iI,KAAKoL,IAAIoc,MAAM,qCAAsCzmB,GAGzDf,KAAKooD,WAAWrnD,GAAQ6hI,EACjBA,CACX,CAIA,WAAM57H,GACF,GAAoB,YAAhBhH,KAAKowB,OAAT,CAGApwB,KAAKowB,OAAS,WACdpwB,KAAKoL,IAAI,sBACT,UACUpL,KAAKooD,WAAW+gE,uBAChBnpH,KAAKooD,WAAWphD,cAChBhH,KAAKooD,WAAWghE,gBACtBppH,KAAKowB,OAAS,UACdpwB,KAAKusD,kBAAkB,QAAS,CAAE5E,OAAQ3nD,OAC1CA,KAAKoL,IAAI,qBACb,CACA,MAAOqb,GAKH,MAJAzmB,KAAKoL,IAAIoc,MAAM,oCAAqCf,GAEpDzmB,KAAKowB,OAAS,gBACRpwB,KAAKsmB,OACLG,CACV,CAjBA,CAkBJ,CAIA,UAAMH,GACkB,YAAhBtmB,KAAKowB,SAGTpwB,KAAKoL,IAAI,sBACTpL,KAAKowB,OAAS,iBACRpwB,KAAKooD,WAAWihE,sBAChBrpH,KAAKooD,WAAW9hC,aAChBtmB,KAAKooD,WAAWkhE,eACtBtpH,KAAKowB,OAAS,UACdpwB,KAAKusD,kBAAkB,OAAQ,CAAE5E,OAAQ3nD,OACzCA,KAAKoL,IAAI,sBACb,CACA,cAAAs7C,CAAeK,GACX,OAAO/mD,KAAKooD,WAAWI,kBAAkB9B,eAAeK,EAC5D,CACA,YAAAmtE,GACI,OAAOl0H,KAAKooD,WAAWI,kBAAkB0rE,cAC7C,CACA,QAAAt7D,GACI,MAAMiqE,EAAU,IAAIrkB,GACpB,IAAK,MAAMjnD,KAAQv3D,KAAKooD,WAAWI,kBAAkB9B,iBACjDm8E,EAAQ7lH,IAAIu6C,EAAK7M,YAErB,OAAO/oD,MAAM4c,KAAKskH,EACtB,CACA,UAAMrpE,CAAK9R,EAAMztC,EAAU,CAAC,GACxB,OAAOja,KAAKooD,WAAWI,kBAAkB26C,eAAez7C,EAAM,CAE1D4wD,SAAU,MACPr+F,GAEX,CACA,kBAAM6/C,CAAapS,EAAME,EAAW3tC,EAAU,CAAC,GAC3C,GAAiB,MAAb2tC,EACA,MAAM,IAAI,GAAuB,+CAGrC,GAAyB,KADzBA,EAAYjmD,MAAM2Q,QAAQs1C,GAAaA,EAAY,CAACA,IACtCnmD,OACV,MAAM,IAAI,GAAuB,+CAGrC,aADyBzB,KAAKw5D,KAAK9R,EAAMztC,IACvButC,UAAUI,EAAW3tC,EAC3C,CACA,aAAA6oH,GACI,OAAO9iI,KAAKooD,WAAW6/C,eAAe8B,cAC1C,CACA,YAAApkC,GACI,OAAO3lE,KAAKooD,WAAWmT,UAAUoK,cACrC,CACA,YAAMxO,CAAOzP,EAAMztC,EAAU,CAAC,GACtBs5C,GAAY7L,KACZA,EAAO4nC,GAAiB5nC,EAAKgN,aAAe,WAE1C10D,KAAKooD,WAAWI,kBAAkBurE,iBAAiBrsE,EAAMztC,EACnE,CACA,kBAAM+kE,CAAat3B,EAAMztC,EAAU,CAAC,GAEhC,GADAja,KAAKoL,IAAI,kBAAmBs8C,GACN,MAAlBA,EAAK2hB,UACL,OAAO3hB,EAAK2hB,UAEhB,IACI,MAAMvQ,QAAiB94D,KAAK81D,UAAU12D,IAAIsoD,GAC1C,GAA6B,MAAzBoR,EAASpoD,GAAG24D,UACZ,OAAOvQ,EAASpoD,GAAG24D,SAE3B,CACA,MAAO5iD,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,MAAMs8G,EAAU,GAAiB,CAC7B,GAAqB,QACrBr7E,EAAK+hB,cAAc36D,QAKjBu6D,EAAYqlB,SAFE1uF,KAAK8hI,eAAe1iI,IAAI2jI,EAAS9oH,IAMrD,aAHMja,KAAK81D,UAAU2zC,MAAM/hD,EAAM,CAC7B2hB,cAEGA,CACX,CACA,YAAMzf,CAAOhC,EAAWg4D,EAAS3lG,GACxBtY,MAAM2Q,QAAQs1C,KACfA,EAAY,CAACA,UAEXrrB,QAAQ6oB,IAAIwC,EAAUtjD,KAAI6oC,MAAO4a,UAC7B/nD,KAAKooD,WAAWmT,UAAU3R,OAAO7B,EAAU63D,EAAS3lG,EAAQ,IAE1E,CACA,cAAM0uF,CAAS/gD,GACNjmD,MAAM2Q,QAAQs1C,KACfA,EAAY,CAACA,UAEXrrB,QAAQ6oB,IAAIwC,EAAUtjD,KAAI6oC,MAAO4a,UAC7B/nD,KAAKooD,WAAWmT,UAAUotC,SAAS5gD,EAAS,IAE1D,CACA,cAAMuzE,CAASvzE,EAAUwzE,GACrB,OAAOv7H,KAAKooD,WAAWmT,UAAU+/D,SAASvzE,EAAUwzE,EACxD,CACA,UAAAC,CAAW9qH,GACP1Q,KAAKooD,WAAWmT,UAAUigE,WAAW9qH,EACzC,CACA,gBAAMigH,CAAWntB,EAAWvpF,EAAU,CAAC,GACnC,OAAOja,KAAKooD,WAAWI,kBAAkBmoE,WAAWntB,EAAWvpF,EACnE,CAKA,GAAiB3Z,GACb,MAAQqnD,OAAQD,GAASpnD,EACrBonD,EAAKh3C,GAAGrK,aAAerG,KAAK+mD,OAAO1gD,WAIlCrG,KAAKooD,WAAW0N,UAAUzyC,MAAMqkC,EAAKh3C,GAAI,CAC1CoyF,WAAYp7C,EAAKo7C,aAEhBx/D,OAAM7c,IAASzmB,KAAKoL,IAAIoc,MAAMf,EAAI,IANnCzmB,KAAKoL,IAAIoc,MAAM,2CAOvB,EE/TG,SAASw7G,KACZ,IACI,OAAO,CACX,CACA,MAAOxgE,GAEH,OAAO,CACX,CACJ,CCJO,MAIM,GAA6B,YAG7BygE,GAA4B,CACrCl+D,MAAO,EACPl4D,OAAQ,EACRwxD,UAAW,kECZf,MAAM,GAAMp4B,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACbg0C,GAAQt7E,OAAOmd,OAAO,CACxB6E,EAAG,GACHC,EAAGqlB,OAAO,GACV6tC,EAAG7tC,OAAO,sEACVzyB,EAAGyyB,OAAO,sEACVnwB,EAAG,GACHwiE,GAAIryC,OAAO,iFACXsyC,GAAItyC,OAAO,iFACX6/C,KAAM7/C,OAAO,wEAEX,GAAa,CAACtlB,EAAGC,KAAOD,EAAIC,EAAI,IAAOA,EACvCilE,GAAO,CACTC,KAAM7/C,OAAO,sEACb,WAAA8/C,CAAYrtD,GACR,MAAM,EAAEllB,GAAMymE,GACRn4E,EAAKmkC,OAAO,sCACZvvB,GAAM,GAAMuvB,OAAO,sCACnBlkC,EAAKkkC,OAAO,uCACZtvB,EAAK7U,EACLgrF,EAAY7mD,OAAO,uCACnBjwB,EAAK,GAAWW,EAAK+hB,EAAGllB,GACxByC,EAAK,IAAYS,EAAKgiB,EAAGllB,GAC/B,IAAI4zE,EAAK,GAAI1uD,EAAI1iB,EAAKlU,EAAKmU,EAAKlU,EAAIyR,GAChC8zE,EAAK,IAAKtxE,EAAKU,EAAKT,EAAKU,EAAInD,GACjC,MAAM2zE,EAAQC,EAAK0F,EACbzF,EAAQC,EAAKwF,EAKnB,GAJI3F,IACAC,EAAK5zE,EAAI4zE,GACTC,IACAC,EAAK9zE,EAAI8zE,GACTF,EAAK0F,GAAaxF,EAAKwF,EACvB,MAAM,IAAItuF,MAAM,2CAA6Ck6B,GAEjE,MAAO,CAAEyuD,QAAOC,KAAIC,QAAOC,KAC/B,GAQJ,SAAS,GAAYnyE,GACjB,MAAM,EAAEwL,EAAC,EAAEC,GAAMq5D,GACXkM,EAAK,GAAIhxE,EAAIA,GACbixE,EAAK,GAAID,EAAKhxE,GACpB,OAAO,GAAIixE,EAAKzlE,EAAIxL,EAAIyL,EAC5B,CACA,MAAMsiH,GAAmBjpD,GAAMt5D,IAAM,GACrC,MAAMwiH,WAAiB3kI,MACnB,WAAA8Q,CAAY9C,GACR4jC,MAAM5jC,EACV,EAEJ,SAAS42H,GAAe70F,GACpB,KAAMA,aAAiB80F,IACnB,MAAM,IAAIjjI,UAAU,yBAC5B,CACA,MAAMijI,GACF,WAAA/zH,CAAY6F,EAAGq0D,EAAG4R,GACdp7E,KAAKmV,EAAIA,EACTnV,KAAKwpE,EAAIA,EACTxpE,KAAKo7E,EAAIA,CACb,CACA,iBAAOe,CAAWz9C,GACd,KAAMA,aAAa,IACf,MAAM,IAAIt+B,UAAU,4CAExB,OAAIs+B,EAAE4P,OAAO,GAAMqkC,MACR0wD,GAAc1wD,KAClB,IAAI0wD,GAAc3kG,EAAEvpB,EAAGupB,EAAE8qC,EAAG,GACvC,CACA,oBAAO85D,CAAcnsD,GACjB,MAAMkF,EAmlBd,SAAqBzH,EAAMl2C,EAAIu7C,GAAMnG,GACjC,MAAMyvD,EAAU,IAAI5hI,MAAMizE,EAAKnzE,QAOzBqzE,EAAW,GANMF,EAAKtqC,QAAO,CAAC0Q,EAAKxO,EAAKjrC,IACtCirC,IAAQ,GACDwO,GACXuoF,EAAQhiI,GAAKy5C,EACN,GAAIA,EAAMxO,EAAK9N,KACvB,IACqCA,GAOxC,OANAk2C,EAAKG,aAAY,CAAC/5B,EAAKxO,EAAKjrC,IACpBirC,IAAQ,GACDwO,GACXuoF,EAAQhiI,GAAK,GAAIy5C,EAAMuoF,EAAQhiI,GAAIm9B,GAC5B,GAAIsc,EAAMxO,EAAK9N,KACvBo2C,GACIyuD,CACX,CAnmBsB5uD,CAAYwC,EAAO7yE,KAAKo6B,GAAMA,EAAE08C,KAC9C,OAAOjE,EAAO7yE,KAAI,CAACo6B,EAAGn9B,IAAMm9B,EAAEw9C,SAASG,EAAM96E,KACjD,CACA,iBAAO66E,CAAWjF,GACd,OAAOksD,GAAcC,cAAcnsD,GAAQ7yE,IAAI++H,GAAclnD,WACjE,CACA,MAAA7tC,CAAOC,GACH60F,GAAe70F,GACf,MAAQp5B,EAAGunE,EAAIlT,EAAGmT,EAAIvB,EAAGwB,GAAO58E,MACxBmV,EAAG0mE,EAAIrS,EAAGsS,EAAIV,EAAGW,GAAOxtC,EAC1Bi1F,EAAO,GAAI5mD,EAAKA,GAChB6mD,EAAO,GAAI1nD,EAAKA,GAChB4K,EAAK,GAAIjK,EAAK+mD,GACd78C,EAAK,GAAI/K,EAAK2nD,GACdE,EAAK,GAAI,GAAI/mD,EAAKZ,GAAM0nD,GACxBE,EAAK,GAAI,GAAI7nD,EAAKc,GAAM4mD,GAC9B,OAAO78C,IAAOC,GAAM88C,IAAOC,CAC/B,CACA,MAAAluD,GACI,OAAO,IAAI4tD,GAAcrjI,KAAKmV,EAAG,IAAKnV,KAAKwpE,GAAIxpE,KAAKo7E,EACxD,CACA,MAAAt4D,GACI,MAAQ3N,EAAGunE,EAAIlT,EAAGmT,EAAIvB,EAAGwB,GAAO58E,KAC1Bs5C,EAAI,GAAIojC,EAAKA,GACbnjC,EAAI,GAAIojC,EAAKA,GACbnjC,EAAI,GAAID,EAAIA,GACZqqF,EAAMlnD,EAAKnjC,EACXE,EAAI,GAAI,IAAO,GAAImqF,EAAMA,GAAOtqF,EAAIE,IACpCE,EAAI,GAAI,GAAMJ,GACdK,EAAI,GAAID,EAAIA,GACZwjC,EAAK,GAAIvjC,EAAI,GAAMF,GACnB0jC,EAAK,GAAIzjC,GAAKD,EAAIyjC,GAAM,GAAM1jC,GAC9B6jC,EAAK,GAAI,GAAMV,EAAKC,GAC1B,OAAO,IAAIymD,GAAcnmD,EAAIC,EAAIE,EACrC,CACA,GAAArgE,CAAIuxB,GACA60F,GAAe70F,GACf,MAAQp5B,EAAGunE,EAAIlT,EAAGmT,EAAIvB,EAAGwB,GAAO58E,MACxBmV,EAAG0mE,EAAIrS,EAAGsS,EAAIV,EAAGW,GAAOxtC,EAChC,GAAIstC,IAAO,IAAOC,IAAO,GACrB,OAAO97E,KACX,GAAI08E,IAAO,IAAOC,IAAO,GACrB,OAAOpuC,EACX,MAAMi1F,EAAO,GAAI5mD,EAAKA,GAChB6mD,EAAO,GAAI1nD,EAAKA,GAChB4K,EAAK,GAAIjK,EAAK+mD,GACd78C,EAAK,GAAI/K,EAAK2nD,GACdE,EAAK,GAAI,GAAI/mD,EAAKZ,GAAM0nD,GACxBE,EAAK,GAAI,GAAI7nD,EAAKc,GAAM4mD,GACxB3pF,EAAI,GAAI+sC,EAAKD,GACbnsD,EAAI,GAAImpG,EAAKD,GACnB,GAAI7pF,IAAM,GACN,OAAIrf,IAAM,GACCx6B,KAAK8iB,SAGLugH,GAAc1wD,KAG7B,MAAMkxD,EAAK,GAAIhqF,EAAIA,GACbiqF,EAAM,GAAIjqF,EAAIgqF,GACdlzE,EAAI,GAAIg2B,EAAKk9C,GACb3mD,EAAK,GAAI1iD,EAAIA,EAAIspG,EAAM,GAAMnzE,GAC7BwsB,EAAK,GAAI3iD,GAAKm2B,EAAIusB,GAAMwmD,EAAKI,GAC7BzmD,EAAK,GAAIT,EAAKb,EAAKliC,GACzB,OAAO,IAAIwpF,GAAcnmD,EAAIC,EAAIE,EACrC,CACA,QAAAC,CAAS/uC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMknC,SAC1B,CACA,cAAAgI,CAAevF,GACX,MAAM6rD,EAAKV,GAAc1wD,KACzB,GAAsB,iBAAXuF,GAAuBA,IAAW,GACzC,OAAO6rD,EACX,IAAIvwH,EAAIwwH,GAAgB9rD,GACxB,GAAI1kE,IAAM,GACN,OAAOxT,KACX,IAAKkjI,GAAkB,CACnB,IAAIxkG,EAAIqlG,EACJtnH,EAAIzc,KACR,KAAOwT,EAAI,IACHA,EAAI,KACJkrB,EAAIA,EAAE1hB,IAAIP,IACdA,EAAIA,EAAEqG,SACNtP,IAAM,GAEV,OAAOkrB,CACX,CACA,IAAI,MAAEyoD,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,GAAKE,YAAYvyE,GAC5C+zE,EAAMw8C,EACNv8C,EAAMu8C,EACNtnH,EAAIzc,KACR,KAAOonF,EAAK,IAAOE,EAAK,IAChBF,EAAK,KACLG,EAAMA,EAAIvqE,IAAIP,IACd6qE,EAAK,KACLE,EAAMA,EAAIxqE,IAAIP,IAClBA,EAAIA,EAAEqG,SACNskE,IAAO,GACPE,IAAO,GAOX,OALIH,IACAI,EAAMA,EAAI9R,UACV4R,IACAG,EAAMA,EAAI/R,UACd+R,EAAM,IAAI67C,GAAc,GAAI77C,EAAIryE,EAAI0wE,GAAKC,MAAO0B,EAAIhe,EAAGge,EAAIpM,GACpDmM,EAAIvqE,IAAIwqE,EACnB,CACA,gBAAAtQ,CAAiBvB,GACb,MAAMI,EAAUmtD,GAAmB,IAAMvtD,EAAI,EAAI,IAAMA,EAAI,EACrDwB,EAAS,GACf,IAAIz4C,EAAI1+B,KACJozB,EAAOsL,EACX,IAAK,IAAI3tB,EAAS,EAAGA,EAASglE,EAAShlE,IAAU,CAC7CqiB,EAAOsL,EACPy4C,EAAO32E,KAAK4yB,GACZ,IAAK,IAAI7xB,EAAI,EAAGA,EAAI,IAAMo0E,EAAI,GAAIp0E,IAC9B6xB,EAAOA,EAAKpW,IAAI0hB,GAChBy4C,EAAO32E,KAAK4yB,GAEhBsL,EAAItL,EAAKtQ,QACb,CACA,OAAOq0D,CACX,CACA,IAAAL,CAAKtjE,EAAGywH,IACCA,GAAejkI,KAAKsuC,OAAO+0F,GAAc17F,QAC1Cs8F,EAAc,GAAMt8F,MACxB,MAAMguC,EAAKsuD,GAAeA,EAAYC,cAAiB,EACvD,GAAI,IAAMvuD,EACN,MAAM,IAAIn3E,MAAM,iEAEpB,IAAI44E,EAAc6sD,GAAe,GAAiB7kI,IAAI6kI,GACjD7sD,IACDA,EAAcp3E,KAAKk3E,iBAAiBvB,GAChCsuD,GAAqB,IAANtuD,IACfyB,EAAcisD,GAAcjnD,WAAWhF,GACvC,GAAiB93E,IAAI2kI,EAAa7sD,KAG1C,IAAI14C,EAAI2kG,GAAc1wD,KAClB19D,EAAIouH,GAAc17F,KACtB,MAAMouC,EAAU,GAAKmtD,GAAmB,IAAMvtD,EAAI,IAAMA,GAClDK,EAAa,IAAML,EAAI,GACvB92D,EAAOonB,OAAO,GAAK0vC,EAAI,GACvBG,EAAY,GAAKH,EACjBM,EAAUhwC,OAAO0vC,GACvB,IAAK,IAAI5kE,EAAS,EAAGA,EAASglE,EAAShlE,IAAU,CAC7C,MAAM7N,EAAS6N,EAASilE,EACxB,IAAII,EAAQ7rE,OAAOiJ,EAAIqL,GACvBrL,IAAMyiE,EACFG,EAAQJ,IACRI,GAASN,EACTtiE,GAAK,IAET,MAAM2wH,EAAUjhI,EACVkhI,EAAUlhI,EAAS+F,KAAKsE,IAAI6oE,GAAS,EACrCiuD,EAAQtzH,EAAS,GAAM,EACvBuzH,EAAQluD,EAAQ,EACR,IAAVA,EACAnhE,EAAIA,EAAE+H,IAAI,GAAgBqnH,EAAOjtD,EAAY+sD,KAG7CzlG,EAAIA,EAAE1hB,IAAI,GAAgBsnH,EAAOltD,EAAYgtD,IAErD,CACA,MAAO,CAAE1lG,IAAGzpB,IAChB,CACA,QAAAsoE,CAASrF,EAAQ+rD,GACb,IACItlD,EACA8I,EAFAj0E,EAAIwwH,GAAgB9rD,GAGxB,GAAIgrD,GAAkB,CAClB,MAAM,MAAE/7C,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,GAAKE,YAAYvyE,GAClD,IAAMkrB,EAAG6oD,EAAKtyE,EAAGyyE,GAAQ1nF,KAAK82E,KAAKsQ,EAAI68C,IACjCvlG,EAAG8oD,EAAKvyE,EAAG0yE,GAAQ3nF,KAAK82E,KAAKwQ,EAAI28C,GACvC18C,EAAM,GAAgBJ,EAAOI,GAC7BC,EAAM,GAAgBH,EAAOG,GAC7BA,EAAM,IAAI67C,GAAc,GAAI77C,EAAIryE,EAAI0wE,GAAKC,MAAO0B,EAAIhe,EAAGge,EAAIpM,GAC3DuD,EAAQ4I,EAAIvqE,IAAIwqE,GAChBC,EAAOC,EAAI1qE,IAAI2qE,EACnB,KACK,CACD,MAAM,EAAEjpD,EAAC,EAAEzpB,GAAMjV,KAAK82E,KAAKtjE,EAAGywH,GAC9BtlD,EAAQjgD,EACR+oD,EAAOxyE,CACX,CACA,OAAOouH,GAAcjnD,WAAW,CAACuC,EAAO8I,IAAO,EACnD,CACA,QAAAvL,CAASqoD,GACL,MAAM,EAAEpvH,EAAC,EAAEq0D,EAAC,EAAE4R,GAAMp7E,KACd6yE,EAAM7yE,KAAKsuC,OAAO+0F,GAAc1wD,MAC1B,MAAR4xD,IACAA,EAAO1xD,EAAM,GAAM,GAAOuI,IAC9B,MAAMopD,EAAMD,EACNE,EAAM,GAAID,EAAMA,GAChBE,EAAM,GAAID,EAAMD,GAChBnpD,EAAK,GAAIlmE,EAAIsvH,GACbnpD,EAAK,GAAI9R,EAAIk7D,GACbnpD,EAAK,GAAIH,EAAIopD,GACnB,GAAI3xD,EACA,OAAO,GAAMF,KACjB,GAAI4I,IAAO,GACP,MAAM,IAAI/8E,MAAM,oBACpB,OAAO,IAAI,GAAM68E,EAAIC,EACzB,EAIJ,SAAS,GAAgB9F,EAAWnwB,GAChC,MAAM0tB,EAAM1tB,EAAKowB,SACjB,OAAOD,EAAYzC,EAAM1tB,CAC7B,CALAg+E,GAAc17F,KAAO,IAAI07F,GAAcppD,GAAM3B,GAAI2B,GAAM1B,GAAI,IAC3D8qD,GAAc1wD,KAAO,IAAI0wD,GAAc,GAAK,GAAK,IAKjD,MAAM,GAAmB,IAAIz1F,QACtB,MAAM,GACT,WAAAt+B,CAAY6F,EAAGq0D,GACXxpE,KAAKmV,EAAIA,EACTnV,KAAKwpE,EAAIA,CACb,CACA,cAAA+S,CAAevG,GACXh2E,KAAKkkI,aAAeluD,EACpB,GAAiB9uB,OAAOlnD,KAC5B,CACA,QAAA0mF,GACI,OAAO1mF,KAAKwpE,EAAI,KAAQ,EAC5B,CACA,wBAAOm7D,CAAkB71H,GACrB,MAAM81H,EAA2B,KAAjB91H,EAAMrN,OAChB0T,EAAI0vH,GAAcD,EAAU91H,EAAQA,EAAMmT,SAAS,IACzD,IAAK6iH,GAAoB3vH,GACrB,MAAM,IAAI3W,MAAM,yBAEpB,IAAIgrE,EA8TZ,SAAiBr0D,GACb,MAAM,EAAE2+D,GAAMmG,GACRgS,EAAMhmD,OAAO,GACbimD,EAAOjmD,OAAO,IACdkmD,EAAOlmD,OAAO,IACdmmD,EAAOnmD,OAAO,IACdomD,EAAOpmD,OAAO,IACdqmD,EAAOrmD,OAAO,IACdtvB,EAAMxB,EAAIA,EAAIA,EAAK2+D,EACnBl9D,EAAMD,EAAKA,EAAKxB,EAAK2+D,EACrB/8D,EAAM,GAAKH,EAAI,IAAOA,EAAMk9D,EAC5B58D,EAAM,GAAKH,EAAI,IAAOH,EAAMk9D,EAC5B18D,EAAO,GAAKF,EAAI,IAAOP,EAAMm9D,EAC7B/7D,EAAO,GAAKX,EAAK80E,GAAQ90E,EAAO08D,EAChCz6D,EAAO,GAAKtB,EAAKo0E,GAAQp0E,EAAO+7D,EAChCyY,EAAO,GAAKlzE,EAAKgzE,GAAQhzE,EAAOy6D,EAChC0Y,EAAQ,GAAKD,EAAKD,GAAQC,EAAOzY,EACjC2Y,EAAQ,GAAKD,EAAMH,GAAQhzE,EAAOy6D,EAClC4Y,EAAQ,GAAKD,EAAM,IAAO71E,EAAMk9D,EAChCgT,EAAM,GAAK4F,EAAMN,GAAQr0E,EAAO+7D,EAChCS,EAAM,GAAKuS,EAAImF,GAAOt1E,EAAMm9D,EAC5BixD,EAAK,GAAKxwD,EAAI,IAEpB,GADYwwD,EAAKA,EAAMjxD,IACZ3+D,EACP,MAAM,IAAI3W,MAAM,2BACpB,OAAOumI,CACX,CAxVgB,CADG,GAAY5vH,IAEvB,MAAM6vH,GAAUx7D,EAAI,MAAS,GACzBo7D,EACII,IACAx7D,EAAI,IAAKA,MAG6B,GAAlB16D,EAAM,MACPk2H,IACnBx7D,EAAI,IAAKA,IAEjB,MAAMmV,EAAQ,IAAI,GAAMxpE,EAAGq0D,GAE3B,OADAmV,EAAMlC,iBACCkC,CACX,CACA,0BAAOsmD,CAAoBn2H,GACvB,MAAMqG,EAAI0vH,GAAc/1H,EAAMmT,SAAS,EAAG29D,KACpCpW,EAAIq7D,GAAc/1H,EAAMmT,SAAS29D,GAAcA,KAC/CjB,EAAQ,IAAI,GAAMxpE,EAAGq0D,GAE3B,OADAmV,EAAMlC,iBACCkC,CACX,CACA,cAAOxnC,CAAQzhC,GACX,MAAM5G,EAAQ,GAAY4G,GACpBtT,EAAM0M,EAAMrN,OACZgtG,EAAS3/F,EAAM,GACrB,GAtSS,KAsSL1M,EACA,OAAOpC,KAAK2kI,kBAAkB71H,GAClC,GArSc8wE,KAqSVx9E,IAAqC,IAAXqsG,GAA8B,IAAXA,GAC7C,OAAOzuG,KAAK2kI,kBAAkB71H,GAElC,GAvSgB,KAuSZ1M,GAAsC,IAAXqsG,EAC3B,OAAOzuG,KAAKilI,oBAAoBn2H,GACpC,MAAM,IAAItQ,MAAM,wGAAsI4D,IAC1J,CACA,qBAAO+7E,CAAe/T,GAClB,OAAO,GAAMziC,KAAK41C,SAAS2nD,GAAoB96D,GACnD,CACA,oBAAO+6D,CAAcv8C,EAASve,EAAWke,GACrC,MAAM,EAAE/tD,EAAC,GAAQ4qG,GAAmB/6D,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAGr/C,SAASu9D,GACvB,MAAM,IAAI/pF,MAAM,wCACpB,MAAMsX,EAAIuvH,GAAa,GAAYz8C,KAC7B,EAAEp1E,GAAMymE,GACR6O,EAAoB,IAAbP,GAA+B,IAAbA,EAAiB/tD,EAAIhnB,EAAIgnB,EAClD8qG,EAAO,GAAOx8C,EAAMt1E,GACpBw1E,EAAK,IAAKlzE,EAAIwvH,EAAM9xH,GACpBy1E,EAAK,GAAIlmF,EAAIuiI,EAAM9xH,GACnB9T,EAAoB,EAAX6oF,EAAe,KAAO,KAC/BtJ,EAAI,GAAM9nC,QAAQz3C,EAAS6lI,GAAYz8C,IACvC5U,EAAI,GAAMvsC,KAAKigD,qBAAqB3I,EAAG+J,EAAIC,GACjD,IAAK/U,EACD,MAAM,IAAI11E,MAAM,+CAEpB,OADA01E,EAAEuI,iBACKvI,CACX,CACA,UAAAoK,CAAWuJ,GAAe,GACtB,OAAO,GAAW7nF,KAAKk3C,MAAM2wC,GACjC,CACA,KAAA3wC,CAAM2wC,GAAe,GACjB,MAAM1yE,EAAIowH,GAAYvlI,KAAKmV,GAC3B,OAAI0yE,EAEO,GADQ7nF,KAAK0mF,WAAa,KAAO,OACrBvxE,IAGZ,KAAKA,IAAIowH,GAAYvlI,KAAKwpE,IAEzC,CACA,MAAAg8D,GACI,OAAOxlI,KAAKk3C,OAAM,GAAMh2C,MAAM,EAClC,CACA,MAAAukI,GACI,OAAOzlI,KAAKs+E,YAAW,GAAMp9E,MAAM,EACvC,CACA,cAAAu7E,GACI,MAAMjlC,EAAM,kCACN,EAAEriC,EAAC,EAAEq0D,GAAMxpE,KACjB,IAAK8kI,GAAoB3vH,KAAO2vH,GAAoBt7D,GAChD,MAAM,IAAIhrE,MAAMg5C,GACpB,MAAMnO,EAAO,GAAImgC,EAAIA,GAErB,GAAI,GAAIngC,EADM,GAAYl0B,MACA,GACtB,MAAM,IAAI3W,MAAMg5C,EACxB,CACA,MAAAlJ,CAAOC,GACH,OAAOvuC,KAAKmV,IAAMo5B,EAAMp5B,GAAKnV,KAAKwpE,IAAMj7B,EAAMi7B,CAClD,CACA,MAAAiM,GACI,OAAO,IAAI,GAAMz1E,KAAKmV,EAAG,IAAKnV,KAAKwpE,GACvC,CACA,MAAA1mD,GACI,OAAOugH,GAAclnD,WAAWn8E,MAAM8iB,SAASo5D,UACnD,CACA,GAAAl/D,CAAIuxB,GACA,OAAO80F,GAAclnD,WAAWn8E,MAAMgd,IAAIqmH,GAAclnD,WAAW5tC,IAAQ2tC,UAC/E,CACA,QAAAoB,CAAS/uC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMknC,SAC1B,CACA,QAAA8H,CAASrF,GACL,OAAOmrD,GAAclnD,WAAWn8E,MAAMu9E,SAASrF,EAAQl4E,MAAMk8E,UACjE,CACA,oBAAA0L,CAAqB1T,EAAGvzD,EAAGC,GACvB,MAAMkzD,EAAIuvD,GAAclnD,WAAWn8E,MAC7B0lI,EAAK/kH,IAAM,IAAOA,IAAM,IAAO3gB,OAAS,GAAM2nC,KAAOmsC,EAAE2J,eAAe98D,GAAKmzD,EAAEyJ,SAAS58D,GACtFglH,EAAKtC,GAAclnD,WAAWjI,GAAGuJ,eAAe78D,GAChDsvD,EAAMw1D,EAAG1oH,IAAI2oH,GACnB,OAAOz1D,EAAI5hC,OAAO+0F,GAAc1wD,WAAQzzE,EAAYgxE,EAAIgM,UAC5D,EAIJ,SAAS0pD,GAAS7iI,GACd,OAAOwH,OAAOiU,SAASzb,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAAS8iI,GAAYl8F,GACjB,GAAIA,EAAKloC,OAAS,GAAiB,IAAZkoC,EAAK,GACxB,MAAM,IAAInrC,MAAM,kCAAkC,GAAWmrC,MAEjE,MAAMvnC,EAAMunC,EAAK,GACX/D,EAAM+D,EAAK1nB,SAAS,EAAG7f,EAAM,GACnC,IAAKA,GAAOwjC,EAAInkC,SAAWW,EACvB,MAAM,IAAI5D,MAAM,2CAEpB,GAAe,IAAXonC,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAIpnC,MAAM,8CAEpB,MAAO,CAAEmrC,KAAMk7F,GAAcj/F,GAAMyD,KAAMM,EAAK1nB,SAAS7f,EAAM,GACjE,CAlBA,GAAMulC,KAAO,IAAI,GAAMsyC,GAAM3B,GAAI2B,GAAM1B,IACvC,GAAM5F,KAAO,IAAI,GAAM,GAAK,IAgCrB,MAAM2V,GACT,WAAAh5E,CAAYkrB,EAAGz3B,GACX/C,KAAKw6B,EAAIA,EACTx6B,KAAK+C,EAAIA,EACT/C,KAAKy8E,gBACT,CACA,kBAAO+L,CAAY9yE,GACf,MAAMmhC,EAAM,GAAQnhC,GACd3U,EAAO,wBACb,GAAmB,iBAAR2U,IAAqBmhC,EAC5B,MAAM,IAAIz2C,UAAU,GAAGW,oCAC3B,MAAMgF,EAAM8wC,EAAM,GAAWnhC,GAAOA,EACpC,GAAmB,MAAf3P,EAAItE,OACJ,MAAM,IAAIjD,MAAM,GAAGuC,2BACvB,OAAO,IAAIunF,GAAU,GAAYviF,EAAI7E,MAAM,EAAG,KAAM,GAAY6E,EAAI7E,MAAM,GAAI,MAClF,CACA,cAAOunF,CAAQ/yE,GACX,MAAMmhC,EAAM,GAAQnhC,GACpB,GAAmB,iBAARA,IAAqBmhC,EAC5B,MAAM,IAAIz2C,UAAU,oDACxB,MAAM,EAAG,EAAE2C,GAlCnB,SAA2B4mC,GACvB,GAAIA,EAAKloC,OAAS,GAAgB,IAAXkoC,EAAK,GACxB,MAAM,IAAInrC,MAAM,0BAA0B,GAAWmrC,MAEzD,GAAIA,EAAK,KAAOA,EAAKloC,OAAS,EAC1B,MAAM,IAAIjD,MAAM,uCAEpB,MAAQmrC,KAAMnP,EAAG6O,KAAMu7C,GAAWihD,GAAYl8F,EAAK1nB,SAAS,KACpD0nB,KAAM5mC,EAAGsmC,KAAMy8F,GAAeD,GAAYjhD,GAClD,GAAIkhD,EAAWrkI,OACX,MAAM,IAAIjD,MAAM,gDAAgD,GAAWsnI,MAE/E,MAAO,CAAEtrG,IAAGz3B,IAChB,CAqByBgjI,CAAkBlvF,EAAMnhC,EAAM,GAAWA,IAC1D,OAAO,IAAI4yE,GAAU9tD,EAAGz3B,EAC5B,CACA,cAAOo0C,CAAQzhC,GACX,OAAO1V,KAAKyoF,QAAQ/yE,EACxB,CACA,cAAA+mE,GACI,MAAM,EAAEjiD,EAAC,EAAEz3B,GAAM/C,KACjB,IAAKylF,GAAmBjrD,GACpB,MAAM,IAAIh8B,MAAM,0CACpB,IAAKinF,GAAmB1iF,GACpB,MAAM,IAAIvE,MAAM,yCACxB,CACA,QAAA0qF,GACI,MAAM88C,EAAO/rD,GAAMzmE,GAAK,GACxB,OAAOxT,KAAK+C,EAAIijI,CACpB,CACA,UAAA78C,GACI,OAAOnpF,KAAKkpF,WAAa,IAAIZ,GAAUtoF,KAAKw6B,EAAG,IAAKx6B,KAAK+C,EAAGk3E,GAAMzmE,IAAMxT,IAC5E,CACA,aAAAopF,GACI,OAAO,GAAWppF,KAAKqpF,WAC3B,CACA,QAAAA,GACI,MAAM48C,EAAOL,GAAS,GAAoB5lI,KAAK+C,IACzCmjI,EAAON,GAAS,GAAoB5lI,KAAKw6B,IACzC2rG,EAAQF,EAAKxkI,OAAS,EACtB2kI,EAAQF,EAAKzkI,OAAS,EACtB4kI,EAAO,GAAoBF,GAC3BG,EAAO,GAAoBF,GAEjC,MAAO,KADQ,GAAoBA,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOJ,GAClD,CACA,UAAA3nD,GACI,OAAOt+E,KAAKopF,eAChB,CACA,KAAAlyC,GACI,OAAOl3C,KAAKqpF,UAChB,CACA,iBAAAC,GACI,OAAO,GAAWtpF,KAAKupF,eAC3B,CACA,YAAAA,GACI,OAAOg8C,GAAYvlI,KAAKw6B,GAAK+qG,GAAYvlI,KAAK+C,EAClD,EAEJ,SAAS,GAAQ4d,GACb,OAAOA,aAAa1Q,YAAe4B,YAAYW,OAAOmO,IAA6B,eAAvBA,EAAErR,YAAYvO,IAC9E,CACA,SAAS,GAAOskD,GACZ,IAAK,GAAQA,GACT,MAAM,IAAI7mD,MAAM,sBACxB,CACA,SAAS,MAAe+/C,GAEpB,GADAA,EAAO+nB,MAAM,IACS,IAAlB/nB,EAAO98C,OACP,OAAO88C,EAAO,GAClB,MAAM98C,EAAS88C,EAAOjU,QAAO,CAAC3pB,EAAGk2B,IAAQl2B,EAAIk2B,EAAIp1C,QAAQ,GACnDqT,EAAS,IAAI7E,WAAWxO,GAC9B,IAAK,IAAIF,EAAI,EAAGqoC,EAAM,EAAGroC,EAAIg9C,EAAO98C,OAAQF,IAAK,CAC7C,MAAMs1C,EAAM0H,EAAOh9C,GACnBuT,EAAOxV,IAAIu3C,EAAKjN,GAChBA,GAAOiN,EAAIp1C,MACf,CACA,OAAOqT,CACX,CACA,MAAM,GAAQnT,MAAM4c,KAAK,CAAE9c,OAAQ,MAAO,CAACk3B,EAAGp3B,IAAMA,EAAE8E,SAAS,IAAI4pD,SAAS,EAAG,OACxE,SAAS,GAAWnhD,GACvB,GAAOA,GACP,IAAI4G,EAAM,GACV,IAAK,IAAInU,EAAI,EAAGA,EAAIuN,EAAMrN,OAAQF,IAC9BmU,GAAO,GAAM5G,EAAMvN,IAEvB,OAAOmU,CACX,CACA,MAAM,GAAS,CAAE6wH,GAAI,GAAIC,GAAI,GAAIltF,EAAG,GAAIK,EAAG,GAAIh5B,EAAG,GAAI1L,EAAG,KACzD,SAAS,GAAc06D,GACnB,OAAIA,GAAM,GAAO42D,IAAM52D,GAAM,GAAO62D,GACzB72D,EAAK,GAAO42D,GACnB52D,GAAM,GAAOr2B,GAAKq2B,GAAM,GAAOh2B,EACxBg2B,GAAM,GAAOr2B,EAAI,IACxBq2B,GAAM,GAAOhvD,GAAKgvD,GAAM,GAAO16D,EACxB06D,GAAM,GAAOhvD,EAAI,SAD5B,CAGJ,CACO,SAAS,GAAWjL,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAIlX,MAAM,mCAAqCkX,GACzD,MAAMk6D,EAAKl6D,EAAIjU,OACTouE,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAIpxE,MAAM,mDAAqDoxE,GACzE,MAAM98D,EAAQ,IAAI7C,WAAW4/D,GAC7B,IAAK,IAAIC,EAAK,EAAG7xD,EAAK,EAAG6xD,EAAKD,EAAIC,IAAM7xD,GAAM,EAAG,CAC7C,MAAM8xD,EAAK,GAAcr6D,EAAIrI,WAAW4Q,IAClC+xD,EAAK,GAAct6D,EAAIrI,WAAW4Q,EAAK,IAC7C,QAAW/e,IAAP6wE,QAA2B7wE,IAAP8wE,EAAkB,CACtC,MAAMrlC,EAAOj1B,EAAIuI,GAAMvI,EAAIuI,EAAK,GAChC,MAAM,IAAIzf,MAAM,+CAAiDmsC,EAAO,cAAgB1sB,EAC5F,CACAnL,EAAMg9D,GAAW,GAALC,EAAUC,CAC1B,CACA,OAAOl9D,CACX,CACA,MAAM2zH,GAAYxgG,OAAO,uEACzB,SAASs/F,GAAY/4F,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAIhuC,MAAM,mBACpB,KAAM,IAAOguC,GAAOA,EAAMi6F,IACtB,MAAM,IAAIjoI,MAAM,kCACpB,OAAOguC,EAAInmC,SAAS,IAAI4pD,SAAS,GAAI,IACzC,CACA,SAAS,GAASzjB,GACd,MAAM5rB,EAAI,GAAW2kH,GAAY/4F,IACjC,GAAiB,KAAb5rB,EAAEnf,OACF,MAAM,IAAIjD,MAAM,4BACpB,OAAOoiB,CACX,CACA,SAAS,GAAoB4rB,GACzB,MAAM92B,EAAM82B,EAAInmC,SAAS,IACzB,OAAoB,EAAbqP,EAAIjU,OAAa,IAAIiU,IAAQA,CACxC,CACA,SAAS,GAAYA,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAItV,UAAU,4CAA8CsV,GAEtE,OAAOuwB,OAAO,KAAKvwB,IACvB,CACA,SAASmvH,GAAc/1H,GACnB,OAAO,GAAY,GAAWA,GAClC,CACA,SAAS,GAAY4G,GACjB,OAAO,GAAQA,GAAOzF,WAAWsO,KAAK7I,GAAO,GAAWA,EAC5D,CACA,SAASsuH,GAAgBx3F,GACrB,GAAmB,iBAARA,GAAoBjiC,OAAO2rC,cAAc1J,IAAQA,EAAM,EAC9D,OAAOvG,OAAOuG,GAClB,GAAmB,iBAARA,GAAoBi5C,GAAmBj5C,GAC9C,OAAOA,EACX,MAAM,IAAIpsC,UAAU,sDACxB,CACA,SAAS,GAAIugB,EAAGC,EAAIq5D,GAAMnG,GACtB,MAAMh/D,EAAS6L,EAAIC,EACnB,OAAO9L,GAAU,GAAMA,EAAS8L,EAAI9L,CACxC,CACA,SAAS,GAAKK,EAAGw8D,GACb,MAAM,EAAEmC,GAAMmG,GACd,IAAIr0C,EAAMzwB,EACV,KAAOw8D,KAAU,IACb/rC,GAAOA,EACPA,GAAOkuC,EAEX,OAAOluC,CACX,CA4BA,SAAS,GAAOgjC,EAAQgJ,EAASqI,GAAMnG,GACnC,GAAIlL,IAAW,IAAOgJ,GAAU,GAC5B,MAAM,IAAIpzE,MAAM,6CAA6CoqE,SAAcgJ,KAE/E,IAAIjxD,EAAI,GAAIioD,EAAQgJ,GAChBhxD,EAAIgxD,EACJz8D,EAAI,GAAKq0D,EAAI,GAAKuI,EAAI,GAAK1yE,EAAI,GACnC,KAAOshB,IAAM,IAAK,CACd,MAAM6hB,EAAI5hB,EAAID,EACR6Z,EAAI5Z,EAAID,EACRyW,EAAIjiB,EAAI48D,EAAIvvC,EACZhvB,EAAIg2D,EAAInqE,EAAImjC,EAClB5hB,EAAID,EAAGA,EAAI6Z,EAAGrlB,EAAI48D,EAAGvI,EAAInqE,EAAG0yE,EAAI36C,EAAG/3B,EAAImU,CAC3C,CAEA,GADYoN,IACA,GACR,MAAM,IAAIpiB,MAAM,0BACpB,OAAO,GAAI2W,EAAGy8D,EAClB,CAuBA,SAASyzD,GAAaj4H,EAAMs5H,GAAe,GACvC,MAAM5wH,EANV,SAAoBhH,GAChB,MAAM+6E,EAAuB,EAAf/6E,EAAMrN,OAAaklI,IAC3Bn6F,EAAMq4F,GAAc/1H,GAC1B,OAAO+6E,EAAQ,EAAIr9C,GAAOvG,OAAO4jD,GAASr9C,CAC9C,CAEco6F,CAAWx5H,GACrB,GAAIs5H,EACA,OAAO5wH,EACX,MAAM,GAAQmkE,GACd,OAAOnkE,GAAKtC,EAAIsC,EAAItC,EAAIsC,CAC5B,CACA,IAAI+wH,GACAC,GACJ,MAAMC,GACF,WAAAz3H,CAAYy7E,EAASC,GAGjB,GAFAhrF,KAAK+qF,QAAUA,EACf/qF,KAAKgrF,SAAWA,EACO,iBAAZD,GAAwBA,EAAU,EACzC,MAAM,IAAIvsF,MAAM,4BACpB,GAAwB,iBAAbwsF,GAAyBA,EAAW,EAC3C,MAAM,IAAIxsF,MAAM,6BACpBwB,KAAKX,EAAI,IAAI4Q,WAAW86E,GAASxyC,KAAK,GACtCv4C,KAAK04B,EAAI,IAAIzoB,WAAW86E,GAASxyC,KAAK,GACtCv4C,KAAK0sC,QAAU,CACnB,CACA,IAAAi3C,IAAQ1gF,GACJ,OAAOm8E,GAAM4nD,WAAWhnI,KAAK04B,KAAMz1B,EACvC,CACA,QAAAgkI,IAAYhkI,GACR,OAAO6jI,GAAgB9mI,KAAK04B,KAAMz1B,EACtC,CACA,SAAAikI,GACI,GAA+B,mBAApBJ,GACP,MAAM,IAAI3D,GAAS,iCAC3B,CACA,IAAAlO,GACI,GAAIj1H,KAAK0sC,SAAW,IAChB,MAAM,IAAIluC,MAAM,qDACpBwB,KAAK0sC,SAAW,CACpB,CACA,YAAMw+C,CAAOd,EAAO,IAAIn6E,YACpBjQ,KAAK04B,QAAU14B,KAAK2jF,KAAK3jF,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQ6rE,GAC1DpqF,KAAKX,QAAUW,KAAK2jF,KAAK3jF,KAAKX,GACV,IAAhB+qF,EAAK3oF,SAETzB,KAAK04B,QAAU14B,KAAK2jF,KAAK3jF,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQ6rE,GAC1DpqF,KAAKX,QAAUW,KAAK2jF,KAAK3jF,KAAKX,GAClC,CACA,UAAA8nI,CAAW/8C,EAAO,IAAIn6E,YAClBjQ,KAAKknI,YACLlnI,KAAK04B,EAAI14B,KAAKinI,SAASjnI,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQ6rE,GACxDpqF,KAAKX,EAAIW,KAAKinI,SAASjnI,KAAKX,GACR,IAAhB+qF,EAAK3oF,SAETzB,KAAK04B,EAAI14B,KAAKinI,SAASjnI,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQ6rE,GACxDpqF,KAAKX,EAAIW,KAAKinI,SAASjnI,KAAKX,GAChC,CACA,cAAM+nI,GACFpnI,KAAKi1H,OACL,IAAI7yH,EAAM,EACV,MAAMynC,EAAM,GACZ,KAAOznC,EAAMpC,KAAKgrF,UAAU,CACxBhrF,KAAKX,QAAUW,KAAK2jF,KAAK3jF,KAAKX,GAC9B,MAAM8rF,EAAKnrF,KAAKX,EAAE6B,QAClB2oC,EAAIrpC,KAAK2qF,GACT/oF,GAAOpC,KAAKX,EAAEoC,MAClB,CACA,OAAO,MAAeooC,EAC1B,CACA,YAAAw9F,GACIrnI,KAAKknI,YACLlnI,KAAKi1H,OACL,IAAI7yH,EAAM,EACV,MAAMynC,EAAM,GACZ,KAAOznC,EAAMpC,KAAKgrF,UAAU,CACxBhrF,KAAKX,EAAIW,KAAKinI,SAASjnI,KAAKX,GAC5B,MAAM8rF,EAAKnrF,KAAKX,EAAE6B,QAClB2oC,EAAIrpC,KAAK2qF,GACT/oF,GAAOpC,KAAKX,EAAEoC,MAClB,CACA,OAAO,MAAeooC,EAC1B,EAEJ,SAAS47C,GAAmBj5C,GACxB,OAAO,GAAMA,GAAOA,EAAMytC,GAAMzmE,CACpC,CACA,SAASsxH,GAAoBt4F,GACzB,OAAO,GAAMA,GAAOA,EAAMytC,GAAMnG,CACpC,CACA,SAASwzD,GAAS58C,EAAQtzD,EAAG3a,EAAGonE,GAAO,GACnC,MAAM,EAAErwE,GAAMymE,GACRvhD,EAAI2sG,GAAa36C,GAAQ,GAC/B,IAAKjF,GAAmB/sD,GACpB,OACJ,MAAM6uG,EAAO,GAAO7uG,EAAGllB,GACjBgvB,EAAI,GAAMmF,KAAK41C,SAAS7kD,GACxB8B,EAAI,GAAIgI,EAAErtB,EAAG3B,GACnB,GAAIgnB,IAAM,GACN,OACJ,MAAMz3B,EAAI,GAAIwkI,EAAO,GAAInwG,EAAI3a,EAAI+d,EAAGhnB,GAAIA,GACxC,GAAIzQ,IAAM,GACN,OACJ,IAAI6mE,EAAM,IAAI0e,GAAU9tD,EAAGz3B,GACvBwlF,GAAY/lD,EAAErtB,IAAMy0D,EAAIpvC,EAAI,EAAI,GAAKjwB,OAAOi4B,EAAEgnC,EAAI,IAKtD,OAJIqa,GAAQja,EAAIsf,aACZtf,EAAMA,EAAIuf,aACVZ,GAAY,GAET,CAAE3e,MAAK2e,WAClB,CACA,SAAS28C,GAAoBnmI,GACzB,IAAIytC,EACJ,GAAmB,iBAARztC,EACPytC,EAAMztC,OAEL,GAAmB,iBAARA,GAAoBwL,OAAO2rC,cAAcn3C,IAAQA,EAAM,EACnEytC,EAAMvG,OAAOlnC,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAmB,KAAfA,EAAI0C,OACJ,MAAM,IAAIjD,MAAM,oCACpBguC,EAAM,GAAYztC,EACtB,KACK,KAAI,GAAQA,GAMb,MAAM,IAAIqB,UAAU,8BALpB,GArwBS,KAqwBLrB,EAAI0C,OACJ,MAAM,IAAIjD,MAAM,oCACpBguC,EAAMq4F,GAAc9lI,EAIxB,CACA,IAAK0mF,GAAmBj5C,GACpB,MAAM,IAAIhuC,MAAM,qCACpB,OAAOguC,CACX,CAUA,SAAS44F,GAAmB/6D,GACxB,GAAIA,aAAqBie,GAErB,OADAje,EAAUoS,iBACHpS,EAEX,IACI,OAAOie,GAAUG,QAAQpe,EAC7B,CACA,MAAO7iD,GACH,OAAO8gE,GAAUE,YAAYne,EACjC,CACJ,CA4BA,SAAS4a,GAASn2E,GAEd,OAAO+1H,GADO/1H,EAAMrN,OAl0BP,GAk0B2BqN,EAAM5N,MAAM,EAl0BvC,IAk0BsD4N,EAEvE,CACA,SAAS04H,GAAY14H,GACjB,MAAM24H,EAAKxiD,GAASn2E,GACduyE,EAAK,GAAIomD,EAAIxtD,GAAMzmE,GACzB,OAAOu2E,GAAW1I,EAAK,GAAMomD,EAAKpmD,EACtC,CACA,SAAS0I,GAAWv9C,GAChB,OAAO,GAASA,EACpB,CA4CA,MAAMk7F,GAAQ,CAAEC,QAAQ,GA4KxB,GAAMhgG,KAAK40C,eAAe,GAC1B,MAAM,GAAS,CACXjrE,KAAM,GACNs2H,IAAqB,iBAATt9H,MAAqB,WAAYA,KAAOA,KAAK8iC,YAASluC,GAOhE,GAAuB,CAAC,EACjBkgF,GAAQ,CACjByoD,WAAU,GACVC,WAAU,GACVC,YAAW,GACXpgH,IAAG,GACHmqD,OAAM,GACN,iBAAA0X,CAAkBpf,GACd,IAEI,OADA86D,GAAoB96D,IACb,CACX,CACA,MAAO5iD,GACH,OAAO,CACX,CACJ,EACAwgH,iBAAkB,GAClBC,qBAAsB/C,GACtBgD,iBAAmB96H,IAGf,IAFAA,EAAO,GAAYA,IAEV3L,OADMklI,IACav5H,EAAK3L,OAAS,KACtC,MAAM,IAAIjD,MAAM,uDAGpB,OAAO,GADK,GAAIqmI,GAAcz3H,GAAO6sE,GAAMzmE,EAAI,IAAO,GAClC,EAExBokC,YAAa,CAACF,EAAc,MACxB,GAAI,GAAOkwF,IACP,OAAO,GAAOA,IAAIjwF,gBAAgB,IAAI1nC,WAAWynC,IAEhD,GAAI,GAAOpmC,KAAM,CAClB,MAAM,YAAEsmC,GAAgB,GAAOtmC,KAC/B,OAAOrB,WAAWsO,KAAKq5B,EAAYF,GACvC,CAEI,MAAM,IAAIl5C,MAAM,oDACpB,EAEJ6gF,iBAAkB,IAAMD,GAAM8oD,iBAAiB9oD,GAAMxnC,YAAY+uF,KACjE,UAAArnD,CAAWtJ,EAAa,EAAG2I,EAAQ,GAAMh3C,MACrC,MAAMy0E,EAASz9B,IAAU,GAAMh3C,KAAOg3C,EAAQ,IAAI,GAAMA,EAAMxpE,EAAGwpE,EAAMnV,GAGvE,OAFA4yC,EAAO7/B,eAAevG,GACtBomC,EAAO7+B,SAAS,IACT6+B,CACX,EACA+rB,OAAQh7F,SAAUsG,KACd,GAAI,GAAOm0F,IAAK,CACZ,MAAMl1H,QAAe,GAAOk1H,IAAIv6F,OAAOx3B,OAAO,UAAW,MAAe49B,IACxE,OAAO,IAAIxjC,WAAWyC,EAC1B,CACK,GAAI,GAAOpB,KAAM,CAClB,MAAM,WAAE82H,GAAe,GAAO92H,KACxBlE,EAAOg7H,EAAW,UAExB,OADA30F,EAAStmC,SAASiqB,GAAMhqB,EAAKtO,OAAOs4B,KAC7BnnB,WAAWsO,KAAKnR,EAAKyI,SAChC,CAEI,MAAM,IAAIrX,MAAM,+CACpB,EAEJwoI,WAAY75F,MAAOpuC,KAAQ00C,KACvB,GAAI,GAAOm0F,IAAK,CACZ,MAAMS,QAAa,GAAOT,IAAIv6F,OAAOw8B,UAAU,MAAO9qE,EAAK,CAAEgC,KAAM,OAAQqM,KAAM,CAAErM,KAAM,aAAe,EAAO,CAAC,SAC1GyL,EAAU,MAAeinC,GACzB/gC,QAAe,GAAOk1H,IAAIv6F,OAAO/uB,KAAK,OAAQ+pH,EAAM77H,GAC1D,OAAO,IAAIyD,WAAWyC,EAC1B,CACK,GAAI,GAAOpB,KAAM,CAClB,MAAM,WAAEg3H,GAAe,GAAOh3H,KACxBlE,EAAOk7H,EAAW,SAAUvpI,GAElC,OADA00C,EAAStmC,SAASiqB,GAAMhqB,EAAKtO,OAAOs4B,KAC7BnnB,WAAWsO,KAAKnR,EAAKyI,SAChC,CAEI,MAAM,IAAIrX,MAAM,oDACpB,EAEJ+pI,gBAAYrpI,EACZspI,oBAAgBtpI,EAChBupI,WAAYt7F,MAAO0F,KAAQY,KACvB,IAAIi1F,EAAO,GAAqB71F,GAChC,QAAa3zC,IAATwpI,EAAoB,CACpB,MAAMC,QAAavpD,GAAM+oD,OAAOl4H,WAAWsO,KAAKs0B,GAAM1rC,GAAMA,EAAEkG,WAAW,MACzEq7H,EAAO,GAAYC,EAAMA,GACzB,GAAqB91F,GAAO61F,CAChC,CACA,OAAOtpD,GAAM+oD,OAAOO,KAASj1F,EAAS,EAE1Cm1F,eAAgB,CAAC/1F,KAAQY,KACrB,GAA2B,mBAAhBozF,GACP,MAAM,IAAI1D,GAAS,+CACvB,IAAIuF,EAAO,GAAqB71F,GAChC,QAAa3zC,IAATwpI,EAAoB,CACpB,MAAMC,EAAO9B,GAAY52H,WAAWsO,KAAKs0B,GAAM1rC,GAAMA,EAAEkG,WAAW,MAClEq7H,EAAO,GAAYC,EAAMA,GACzB,GAAqB91F,GAAO61F,CAChC,CACA,OAAO7B,GAAY6B,KAASj1F,EAAS,EAEzCo1F,eAAgBxF,IAEpB1kI,OAAOu6B,iBAAiBkmD,GAAO,CAC3BmpD,WAAY,CACR58H,cAAc,EACdvM,IAAG,IACQynI,GAEX,GAAAvnI,CAAI2L,GACK47H,KACDA,GAAc57H,EACtB,GAEJu9H,eAAgB,CACZ78H,cAAc,EACdvM,IAAG,IACQ0nI,GAEX,GAAAxnI,CAAI2L,GACK67H,KACDA,GAAkB77H,EAC1B,sCChsCD,SAAS69H,GAAU/yG,GACtB,OAAO,IAAI9lB,WAAW84H,GAAKD,UAAUnzH,YAAYogB,GACrD,CAWO,SAASizG,GAAgB3+D,EAAW79D,EAAS68D,GAChD,IAEI,ODk4BD,SAAgBgB,EAAWue,EAASvf,EAAWvsC,EAAO4qG,IACzD,IAAI99D,EACJ,IACIA,EAAMw7D,GAAmB/6D,GACzBue,EAAU,GAAYA,EAC1B,CACA,MAAOphE,GACH,OAAO,CACX,CACA,MAAM,EAAEgT,EAAC,EAAEz3B,GAAM6mE,EACjB,GAAI9sC,EAAK6qG,QAAU/9D,EAAIsf,WACnB,OAAO,EACX,MAAMpzE,EAAIuvH,GAAaz8C,GACvB,IAAI9U,EACJ,IACIA,EAvHR,SAA4BzK,GACxB,OAAIA,aAAqB,IACrBA,EAAUoT,iBACHpT,GAGA,GAAMlyB,QAAQkyB,EAE7B,CA+GY4/D,CAAmB5/D,EAC3B,CACA,MAAO7hD,GACH,OAAO,CACX,CACA,MAAM,EAAEhU,GAAMymE,GACRivD,EAAO,GAAOnmI,EAAGyQ,GACjBw1E,EAAK,GAAIlzE,EAAIozH,EAAM11H,GACnBy1E,EAAK,GAAIzuD,EAAI0uG,EAAM11H,GACnByrE,EAAI,GAAMt3C,KAAKigD,qBAAqB9T,EAAGkV,EAAIC,GACjD,QAAKhK,GAEK,GAAIA,EAAE9pE,EAAG3B,KACNgnB,CACjB,CC/5Be,CADY,GAAeguD,YAAYne,EAAUnpE,MAAM,EAAG,KAClCsL,EAAS68D,EAC5C,CACA,MACI,OAAO,CACX,CACJ,CCtCO,MACM8/D,GAAiB,oBCDvB,SAASC,GAA+Bj0F,EAAK4S,GAChD,OAAQA,GACJ,IAAK,MACD,OAAQqhF,GAA+Bj0F,EAAK,SACxCi0F,GAA+Bj0F,EAAK,QAC5C,IAAK,MACD,OAAQi0F,GAA+Bj0F,EAAK,SACxCi0F,GAA+Bj0F,EAAK,QAEhD,MAAMk0F,EAASthF,EAASz7B,SAAS,KAC3Bg9G,EAAQn0F,EAAI/1C,IAAIiqI,EAAS,MAAQ,MACvC,IAAKC,EACD,OACJ,MAAMC,EAAYxhF,EAAS7mD,MAAM,EAAG,GACpC,IAAIsoI,EACJ,OAAQD,GACJ,IAAK,MACDC,EAAWH,EAASl0F,EAAI/1C,IAAI,QAAU+1C,EAAI/1C,IAAI,OAC9C,MACJ,IAAK,MACDoqI,EAAWH,EAASl0F,EAAI/1C,IAAI,QAAU+1C,EAAI/1C,IAAI,OAC9C,MACJ,QACI,OAER,OAAKoqI,ECxBF,SAA6BC,EAAU1hF,EAAU2hF,EAASC,GAC7D,IAAI5vE,EAAK,GAAU,IAAM0vE,EAAW,IAAM74E,GAAgB64E,EAAUC,IAEpE,OADA3vE,EAAKA,EAAGzF,YAAY,GAAU,IAAMvM,EAAW,IAAM6I,GAAgB7I,EAAU4hF,KACxE5vE,CACX,CDsBW6vE,CAAoBP,EAAS,MAAQ,MAAOE,EAAWD,EAAOE,QAFrE,CAGJ,CEdO,SAASK,GAAiB/mC,GAC7B,MAAM/nD,EAAc+nD,EAAWx4D,QAAO,CAAC0Q,EAAK+e,IAAO/e,EHVlB,EGUgD+e,EAAGjrD,MAAMrN,QAAQ,GAC5FqN,EAAQ,IAAImB,WAAW8qC,GACvB5C,EAAW,IAAIrB,SAAShoC,EAAM4D,QACpC,IAAI7H,EAAQ,EAUZ,OATAi4F,EAAW31F,SAASq2F,IAChB,GAAIA,EAAU9uC,YACV,MAAM,IAAIl2D,MAAM,8CAEpB25C,EAAS4E,UAAUlyC,EAAO24F,EAAU10F,MAAMrN,QAC1CoJ,GHnB6B,EGoB7BiE,EAAMxP,IAAIkkG,EAAU10F,MAAOjE,GAC3BA,GAAS24F,EAAU10F,MAAMrN,MAAM,IAE5BqN,CACX,CC9BO,SAASg7H,GAAYliF,GACxB,IAAIiI,EAAO,EAYX,OAXIjI,EAAUyW,YACVxO,GAAQ,GACZA,IAAe,EACXjI,EAAU/6C,SACVgjD,GAAQ,GACZA,IAAe,EACXjI,EAAUmd,QACVlV,GAAQ,GACZA,IAAe,EACXjI,EAAUwN,QACVvF,GAAQ,GACLA,CACX,CCRO,MAAMk6E,WAAel8F,IACxBk3C,IACA1a,UACA,WAAA/6D,CAAY06H,EAAM,CAAC,EAAGjlD,EAAM9+C,OAAO,GAAIokC,GACnCj6B,MAAMzxC,OAAOmxD,QAAQk6E,IACrBhqI,KAAK+kF,IAAMA,EACX/kF,KAAKqqE,UAAYA,CACrB,CACA,GAAA/qE,CAAIo5B,EAAGr5B,GAGH,OAFAW,KAAKqqE,eAAYnrE,EACjBc,KAAK+kF,MACE30C,MAAM9wC,IAAIo5B,EAAGr5B,EACxB,CACA,MAAIqR,GACA,MAAMA,EAAK1Q,KAAKZ,IAAI,MACpB,IAAKsR,EACD,MAAM,IAAIlS,MAAM,iBACpB,OAAOq8C,GAAYnqC,EACvB,CACA,aAAI24D,GACA,GACS,OADDrpE,KAAK0Q,GAEL,OAAO1Q,KAAKZ,IAAI,aAEhB,MAAM,IAAIZ,MAAM2qI,GAE5B,CACA,MAAIltC,GACA,MAAMA,EAAKj8F,KAAKZ,IAAI,MACpB,GAAK68F,EAEL,OAAOz/C,GAAiBy/C,EAC5B,CACA,OAAIguC,GACA,MAAMA,EAAMjqI,KAAKZ,IAAI,OACrB,GAAK6qI,EAEL,OAAOztF,GAAiBytF,EAC5B,CACA,MAAI92G,GACA,OAAO+2G,GAAelqI,KAAM,KAAM,MACtC,CACA,MAAImzB,CAAGA,GACHg3G,GAAenqI,KAAM,KAAM,MAAOmzB,EACtC,CACA,OAAI0gC,GACA,OAAOu2E,GAAuBpqI,KAAM,MAAO,MAC/C,CACA,OAAI6zD,CAAIhC,GACJw4E,GAAuBrqI,KAAM,MAAO,MAAO6xD,EAC/C,CACA,OAAIiC,GACA,OAAOs2E,GAAuBpqI,KAAM,MAAO,MAC/C,CACA,OAAI8zD,CAAIjC,GACJw4E,GAAuBrqI,KAAM,MAAO,MAAO6xD,EAC/C,CACA,OAAImC,GACA,OAAOk2E,GAAelqI,KAAM,MAAO,MACvC,CACA,OAAIg0D,CAAI7gC,GACJg3G,GAAenqI,KAAM,MAAO,MAAOmzB,EACvC,CACA,QAAIm3G,GACA,OAAOF,GAAuBpqI,KAAM,OAAQ,MAChD,CACA,QAAIsqI,CAAKz4E,GACLw4E,GAAuBrqI,KAAM,OAAQ,MAAO6xD,EAChD,CACA,QAAI04E,GACA,OAAOH,GAAuBpqI,KAAM,OAAQ,MAChD,CACA,QAAIuqI,CAAK14E,GACLw4E,GAAuBrqI,KAAM,OAAQ,MAAO6xD,EAChD,CAaA,cAAIixC,GACA,MAAM15B,EAAMppE,KAAKZ,IAAI,cACrB,GAAIgqE,EACA,OF9FL,SAA0Bt6D,GAC7B,MAAMg0F,EAAa,GACnB,IAAIj4F,EAAQ,EACZ,KAAOA,EAAQiE,EAAMrN,QAAQ,CACzB,MACMhD,EADe,IAAIq4C,SAAShoC,EAAM4D,OAAQ7H,EHAnB,GGCH4xC,UAAU,GACpC5xC,GHF6B,EGG7B,MAAM2/H,EAAiB17H,EAAM5N,MAAM2J,EAAOA,EAAQpM,GAClDoM,GAASpM,EACTqkG,EAAWtiG,KAAK,GAAUgqI,GAC9B,CACA,OAAO1nC,CACX,CEkFmB2nC,CAAiBrhE,EAEhC,CAaA,cAAI05B,CAAWA,GACX4nC,GAAgB1qI,KAAM,aAAc8iG,EAAY+mC,GACpD,CAIA,SAAIc,GACA,MAAMvhE,EAAMppE,KAAKZ,IAAI,SACrB,GAAIgqE,EACA,ODzGL,SAAqBvZ,GACxB,MAAM86E,EAAQ,CACVv1E,OAAO,EACP2P,OAAO,EACPl4D,QAAQ,EACRwxD,WAAW,GAaf,OAXIxO,EAAO,IACP86E,EAAMv1E,OAAQ,IAClBvF,IAAe,GACJ,IACP86E,EAAM5lE,OAAQ,IAClBlV,IAAe,GACJ,IACP86E,EAAM99H,QAAS,IACnBgjD,IAAe,GACJ,IACP86E,EAAMtsE,WAAY,GACfssE,CACX,CCsFmBC,CAAYxhE,EAAI,GAE/B,CAIA,SAAIuhE,CAAMA,GACND,GAAgB1qI,KAAM,QAAS2qI,GAAQ52H,GAAM,IAAI9D,WAAW,CAAC65H,GAAY/1H,MAC7E,EAEJ,SAASm2H,GAAe5lI,EAAKvF,EAAK4+C,GAC9B,MAAMyrB,EAAM9kE,EAAIlF,IAAIL,GACpB,GAAKqqE,EAEL,OAAOxY,GAAgBjT,EAAOyrB,EAClC,CACA,SAASghE,GAAuB9lI,EAAKvF,EAAK4+C,GACtC,MAAMyrB,EAAM9kE,EAAIlF,IAAIL,GACpB,GAAKqqE,EAEL,OAAO7+D,OAAOqmD,GAAgBjT,EAAOyrB,GACzC,CACA,SAAS+gE,GAAe7lI,EAAKvF,EAAK4+C,EAAO3+C,GACrC0rI,GAAgBpmI,EAAKvF,EAAKC,EAAO,GAAeo9B,KAAK,CAAC,EAAGuhB,GAC7D,CACA,SAAS0sF,GAAuB/lI,EAAKvF,EAAK4+C,EAAO3+C,GAC7CmrI,GAAe7lI,EAAKvF,EAAK4+C,EAAO3+C,GAAOqH,SAAS,IACpD,CACA,SAASqkI,GAAgBpmI,EAAKvF,EAAKC,EAAOw4E,QACxBt4E,IAAVF,EACAsF,EAAIhF,IAAIP,EAAKy4E,EAAUx4E,IAGvBsF,EAAI4iD,OAAOnoD,EAEnB,CCxJOouC,eAAe,GAAKixC,EAAS5mC,GAChC,OR44BJrK,eAAoBy7C,EAASxK,EAASthD,EAAO,CAAC,GAC1C,MAAM,KAAEstD,EAAI,EAAEhzD,EAAC,EAAE3a,GAzBrB,SAAqBmsE,EAASxe,EAAYkgB,GACtC,GAAe,MAAX1B,EACA,MAAM,IAAIpqF,MAAM,2CAA2CoqF,MAC/D,MAAMiL,EAAK,GAAYjL,GACjBnsE,EAAIyoH,GAAoB96D,GACxBqgB,EAAW,CAACV,GAAWttE,GAAI+qH,GAAY3zC,IAC7C,GAAoB,MAAhBvJ,EAAsB,EACD,IAAjBA,IACAA,EAAelL,GAAMxnC,YAr1BhB,KAs1BT,MAAM3zB,EAAI,GAAYqmE,GACtB,GAv1BS,KAu1BLrmE,EAAExiB,OACF,MAAM,IAAIjD,MAAM,yCACpBisF,EAASjqF,KAAKyjB,EAClB,CAGA,MAAO,CAAEmmE,KAFI,MAAeK,GAEbrzD,EADL6tD,GAAS4O,GACDp3E,IACtB,CAQ2BouH,CAAYjiD,EAASxK,EAASthD,EAAKwtD,cACpDQ,EAAO,IAAIi8C,GAr2BL,GADC,IAw2Bb,IAAIn9D,EACJ,UAFMkhB,EAAKI,OAAOd,KAETxgB,EAAM09D,SAAex8C,EAAKs8C,WAAYhwG,EAAG3a,EAAGqgB,EAAKguG,mBAChDhgD,EAAKI,SACf,OAbJ,SAAqB6/C,EAAQjuG,GACzB,MAAM,IAAE8sC,EAAG,SAAE2e,GAAawiD,GACpB,IAAEC,EAAG,UAAEC,GAActsI,OAAO01B,OAAO,CAAEy2G,WAAW,EAAME,KAAK,GAAQluG,GACnE2hD,EAASusD,EAAMphE,EAAIwf,gBAAkBxf,EAAI0f,oBAC/C,OAAO2hD,EAAY,CAACxsD,EAAQ8J,GAAY9J,CAC5C,CAQWysD,CAAYthE,EAAK9sC,EAC5B,CQp5BW,CAAUgsG,GAAUtxF,GAAM4mC,EAAS,CACtC4sD,KAAK,GAEb,CCAA,MAAM,GAAM,IAAI9tF,GAAO,OAChB,IAAIiuF,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,GACrB92E,qBAAuB,OACvBlM,OACA,aAAOnoD,CAAOorI,EAAM,CAAC,EAAGjlD,EAAM9+C,OAAO,GAAIokC,GACrC,MAAMl1B,EAAM,IAAI,GAAI60F,EAAKjlD,EAAK1a,GAC9B,IACI,MAAMhB,EAAYl0B,EAAIk0B,UAClBA,IACAl0B,EAAI4R,OCzBb,SAAmCsiB,GACtC,MAAMgiE,ExNoEH,SAA0B77H,GAC7B,GlBxE2B,KkBwEvBA,EAAIgB,WACJ,OAAOwxE,GAA0BxyE,GAEhC,GDxEsB,KCwElBA,EAAIgB,WACT,OAAO+8E,GAA4B/9E,GAEvC,MAAMhD,EAAU,GAAUgD,GACpB87H,EAAW9+H,EAAQ,KAAK,GAC9B,G3BjF2B,wB2BiFvB8+H,G3BhFuB,iB2BgFSA,G3B/ET,iB2B+EyCA,EAChE,OAAOxgE,GAA2Bt+D,GAEtC,GV/EgC,yBU+E5BA,EAAQ,KAAK,GACb,OAAO42E,GAA0B52E,EAASgD,GAE9C,MAAM,IAAI,GAAuB,8CACrC,CwNpFmB+7H,CAAiBliE,GAChC,GAAoB,cAAhBgiE,EAAOlmI,KACP,MAAM,IAAI3G,MAJsB,gCAMpC,OAAOixF,GAAoB47C,EAC/B,CDmB6BG,CAA0BniE,GAE/C,CACA,MAAOplD,GACH,GAAIuD,MAAM,sCAAuCvD,EACrD,CACA,OAAOkxB,CACX,CACA,UAAIs2F,GACA,GACS,OADDzrI,KAAK0Q,GAEL,OAAO1Q,KAAKqpE,UD/BrB,SAAgBgiE,GACnB,MACMK,EADY,GAAWv0F,QAAQk0F,GACA/sD,YAAW,GAChD,OAAO,GAAWwqD,GAAU4C,EAAmBxqI,MAAM,IACzD,CC2BwC,CAAUlB,KAAKqpE,gBAAanqE,EAEpD,MAAM,IAAIV,MAAM2qI,GAE5B,CACAwC,qBAAuBvC,GAA+BhtG,KAAK,CAAC,EAAGp8B,MAC/D,aAAIk7C,GAIA,OAHIl7C,KAAKi8F,IAAMj8F,KAAKiqI,KAChB,GAAI/8H,KAAK,4CAENlN,KAAKi8F,IAAMj8F,KAAKiqI,GAC3B,CACA,oBAAA2B,CAAqBpoC,GACjB,MAAMnvC,EAAamvC,EAAUnvC,aAC7B,GAA0B,IAAtBA,EAAW5yD,QACO,QAAlB4yD,EAAW,IACO,QAAlBA,EAAW,GACX,MAAM,IAAI71D,MAAM,qBAEpB,MAAMk0D,EAAS8wC,EAAU9wC,SACzB,IAAKA,EAAO,GAAG,KAAOA,EAAO,GAAG,GAC5B,MAAM,IAAIl0D,MAAM,qBAGC,IAAjBk0D,EAAO,GAAG,IACV1yD,KAAKV,IAAI,KAAMozD,EAAO,GAAG,IACzB1yD,KAAKV,IAAI+0D,EAAW,GAAI3B,EAAO,GAAG,MAGlC1yD,KAAKV,IAAI,MAAOozD,EAAO,GAAG,IAC1B1yD,KAAKV,IAAI+0D,EAAW,GAAK,IAAK3B,EAAO,GAAG,IAEhD,CACA,wBAAAm5E,GACI,MAAM/oC,EAAa,GACnB,IAAK,MAAM/6C,KAAYppD,OAAOsE,OAAOmoI,IAAgC,CACjE,MAAMrxE,EAAK/5D,KAAK2rI,qBAAqB5jF,GACjCgS,GACA+oC,EAAWtiG,KAAKu5D,EACxB,CACA,MAAM+xE,EAAc9rI,KAAK8iG,YAAc,GACvC,OAAOA,EAAW1hG,OAAO0qI,GAAaxnI,KAAKy1D,GACnC/5D,KAAK+mD,OACEgT,EAAGzF,YAAY,QAAQt0D,KAAK+mD,OAAO1gD,cAEvC0zD,GAEf,CACA,YAAIjB,GACA,MAAMpoD,EAAK1Q,KAAK+mD,OAChB,GAAKr2C,EAEL,MAAO,CACHA,KACAoyF,WAAY9iG,KAAK6rI,2BAEzB,CASA,gBAAAE,CAAiBhkF,GACb,GAAI/nD,KAAK+mD,OAAQ,CACb,MAAMilF,EAAoBhsI,KAAK2rI,qBAAqB5jF,GACpD,GAAIikF,EACA,OAAOA,EAAkB13E,YAAY,QAAQt0D,KAAK+mD,OAAO1gD,aAEjE,CAEJ,CAIA,iBAAA4lI,GACI,GAAIjsI,KAAK+mD,QAAU/mD,KAAK8iG,WAAY,CAChC,MAAM/7C,EAAS/mD,KAAK+mD,OACpB,OAAO/mD,KAAK8iG,WAAWx+F,KAAKy1D,GACjBA,EAAGzF,YAAY,QAAQvN,EAAO1gD,eAE7C,CACA,MAAO,EACX,CACA,MAAAmZ,CAAOmqB,EAAM0gC,GACT,IAAKrqE,KAAKZ,IAAI,OAAqB,OAAZY,KAAK0Q,GACxB,MAAM,IAAIlS,MAAM2qI,IAEpB,IAAKnpI,KAAKqpE,UACN,MAAM,IAAI7qE,MAAM,uCAEpB,OAAOwqI,GAAgB3+D,EAAWy+D,GAAUn/F,GAAO3pC,KAAKqpE,UAC5D,CACA,UAAM/qD,CAAKqrB,EAAMygC,GACb,GACS,OADDpqE,KAAK0Q,GAKL,MAAM,IAAIlS,MAAM2qI,IAExB,OALQnpI,KAAKqqE,gBAAkB,GAAQD,EAAYzgC,GAK5C3pC,KAAKqqE,SAChB,EE9IJ,IAAI6hE,IAAyB,EACzBC,IAAgB,EACpB,MAAMC,GAAY,CAAEhiI,MAAO,EAAG,QAAW,EAAGmqC,KAAM,EAAG83F,QAAS,EAAG7kH,MAAO,EAAG7kB,IAAK,GAChF,IAAI2pI,GAAYF,GAAmB,QAE/BG,GAAgB,KA4BpB,MAAMC,GA3BN,WACI,IACI,MAAMryG,EAAU,GAahB,GAXA,CAAC,MAAO,MAAO,OAAQ,QAAQhtB,SAASs/H,IACpC,IACI,GAA+B,SAA3B,OAAOhtG,UAAUgtG,GACjB,MAAM,IAAIjuI,MAAM,gBAGxB,CACA,MAAOgpB,GACH2S,EAAQ35B,KAAKisI,EACjB,KAEAtyG,EAAQ14B,OACR,MAAM,IAAIjD,MAAM,WAAa27B,EAAQtyB,KAAK,OAE9C,GAAImH,OAAOC,aAAa,KAAMwwB,UAAU,SAAWzwB,OAAOC,aAAa,IAAM,KACzE,MAAM,IAAIzQ,MAAM,wBAExB,CACA,MAAOgpB,GACH,OAAOA,EAAMhb,OACjB,CACA,OAAO,IACX,CACwBkgI,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,WAAAv9H,CAAYi+B,GACR5uC,OAAO0K,eAAerJ,KAAM,UAAW,CACnC0L,YAAY,EACZ1M,MAAOuuC,EACP7pB,UAAU,GAElB,CACA,IAAAopH,CAAKC,EAAU5qI,GACX,MAAMo7C,EAAQwvF,EAAS3yH,cACC,MAApBgyH,GAAU7uF,IACVv9C,KAAKgtI,mBAAmB,yBAA0B,WAAYD,GAE9DT,GAAYF,GAAU7uF,IAG1BtwC,QAAQ7B,IAAI7I,MAAM0K,QAAS9K,EAC/B,CACA,KAAAiI,IAASjI,GACLnC,KAAK8sI,KAAK,GAAOG,OAAOvyG,MAAOv4B,EACnC,CACA,IAAAoyC,IAAQpyC,GACJnC,KAAK8sI,KAAK,GAAOG,OAAOC,KAAM/qI,EAClC,CACA,IAAA+K,IAAQ/K,GACJnC,KAAK8sI,KAAK,GAAOG,OAAOE,QAAShrI,EACrC,CACA,SAAAirI,CAAU5gI,EAASuI,EAAMsnB,GAErB,GAAI8vG,GACA,OAAOnsI,KAAKotI,UAAU,iBAAkBr4H,EAAM,CAAC,GAE9CA,IACDA,EAAO,GAAOoS,OAAOkmH,eAEpBhxG,IACDA,EAAS,CAAC,GAEd,MAAMixG,EAAiB,GACvB3uI,OAAOuG,KAAKm3B,GAAQlvB,SAASpO,IACzB,MAAMC,EAAQq9B,EAAOt9B,GACrB,IACI,GAAIC,aAAiBiR,WAAY,CAC7B,IAAIyF,EAAM,GACV,IAAK,IAAInU,EAAI,EAAGA,EAAIvC,EAAMyC,OAAQF,IAC9BmU,GAAOm3H,GAAI7tI,EAAMuC,IAAM,GACvBmU,GAAOm3H,GAAe,GAAX7tI,EAAMuC,IAErB+rI,EAAe9sI,KAAKzB,EAAM,iBAAmB2W,EAAM,IACvD,MAEI43H,EAAe9sI,KAAKzB,EAAM,IAAMsmB,KAAKE,UAAUvmB,GAEvD,CACA,MAAOwoB,GACH8lH,EAAe9sI,KAAKzB,EAAM,IAAMsmB,KAAKE,UAAU8W,EAAOt9B,GAAKsH,YAC/D,KAEJinI,EAAe9sI,KAAK,QAAQuU,KAC5Bu4H,EAAe9sI,KAAK,WAAWR,KAAKutC,WACpC,MAAMmyB,EAASlzD,EACf,IAAI6iF,EAAM,GACV,OAAQt6E,GACJ,KAAK63H,GAAUW,cAAe,CAC1Bl+C,EAAM,gBACN,MAAMm+C,EAAQhhI,EACd,OAAQghI,GACJ,IAAK,WACL,IAAK,YACL,IAAK,mBACDn+C,GAAO,IAAMm+C,EACb,MACJ,IAAK,iBACL,IAAK,iBACDn+C,GAAO,eACP,MACJ,IAAK,yBACDA,GAAO,kBAGf,KACJ,CACA,KAAKu9C,GAAUa,eACf,KAAKb,GAAUc,mBACf,KAAKd,GAAUe,YACf,KAAKf,GAAUgB,cACf,KAAKhB,GAAUiB,wBACf,KAAKjB,GAAUkB,qBACf,KAAKlB,GAAUmB,wBACX1+C,EAAMt6E,EAGVs6E,IACA7iF,GAAW,8CAAiD6iF,EAAM,MAElEi+C,EAAe7rI,SACf+K,GAAW,KAAO8gI,EAAezlI,KAAK,MAAQ,KAGlD,MAAM2f,EAAQ,IAAIhpB,MAAMgO,GAMxB,OALAgb,EAAMk4C,OAASA,EACfl4C,EAAMzS,KAAOA,EACbpW,OAAOuG,KAAKm3B,GAAQlvB,SAAQ,SAAUpO,GAClCyoB,EAAMzoB,GAAOs9B,EAAOt9B,EACxB,IACOyoB,CACX,CACA,UAAAwmH,CAAWxhI,EAASuI,EAAMsnB,GACtB,MAAMr8B,KAAKotI,UAAU5gI,EAASuI,EAAMsnB,EACxC,CACA,kBAAA2wG,CAAmBxgI,EAASzL,EAAM/B,GAC9B,OAAOgB,KAAKguI,WAAWxhI,EAAS,GAAO2a,OAAO8mH,iBAAkB,CAC5DC,SAAUntI,EACV/B,MAAOA,GAEf,CACA,MAAAmvI,CAAO34D,EAAWhpE,EAASuI,EAAMsnB,GACvBm5C,GAGNx1E,KAAKguI,WAAWxhI,EAASuI,EAAMsnB,EACnC,CACA,cAAA+xG,CAAe54D,EAAWhpE,EAASzL,EAAM/B,GAC/Bw2E,GAGNx1E,KAAKgtI,mBAAmBxgI,EAASzL,EAAM/B,EAC3C,CACA,cAAAqvI,CAAe7hI,GACI,MAAXA,IACAA,EAAU,+CAEVggI,IACAxsI,KAAKguI,WAAW,8CAA+C,GAAO7mH,OAAOmnH,sBAAuB,CAChG1xG,UAAW,6BAA8B6vG,KAAMD,IAG3D,CACA,eAAA+B,CAAgBvvI,EAAOwN,GACI,iBAAZ,IAGI,MAAXA,IACAA,EAAU,mBAEVxN,EAAQ,GAAKA,GAAS,mBACtBgB,KAAKguI,WAAWxhI,EAAS,GAAO2a,OAAOomH,cAAe,CAClD3wG,UAAW,mBACX4wG,MAAO,oBACPxuI,MAAOA,IAGXA,EAAQ,GACRgB,KAAKguI,WAAWxhI,EAAS,GAAO2a,OAAOomH,cAAe,CAClD3wG,UAAW,mBACX4wG,MAAO,cACPxuI,MAAOA,IAGnB,CACA,kBAAAwvI,CAAmB/mH,EAAOgnH,EAAejiI,GAEjCA,EADAA,EACU,KAAOA,EAGP,GAEVib,EAAQgnH,GACRzuI,KAAKguI,WAAW,mBAAqBxhI,EAAS,GAAO2a,OAAOunH,iBAAkB,CAC1EjnH,MAAOA,EACPgnH,cAAeA,IAGnBhnH,EAAQgnH,GACRzuI,KAAKguI,WAAW,qBAAuBxhI,EAAS,GAAO2a,OAAOwnH,oBAAqB,CAC/ElnH,MAAOA,EACPgnH,cAAeA,GAG3B,CACA,QAAAG,CAAS1kH,EAAQoE,GACTpE,IAAWvrB,QAAoB,MAAVurB,GACrBlqB,KAAKguI,WAAW,cAAe,GAAO7mH,OAAOwmH,YAAa,CAAE5sI,KAAMutB,EAAKvtB,MAE/E,CACA,aAAA8tI,CAAc3kH,EAAQoE,GACdpE,IAAWoE,EACXtuB,KAAKguI,WAAW,qCAAuC3oH,KAAKE,UAAU+I,EAAKvtB,MAAQ,6BAA8B,GAAOomB,OAAOmnH,sBAAuB,CAAEvtI,KAAMmpB,EAAOnpB,KAAM67B,UAAW,QAEjL1S,IAAWvrB,QAAoB,MAAVurB,GAC1BlqB,KAAKguI,WAAW,cAAe,GAAO7mH,OAAOwmH,YAAa,CAAE5sI,KAAMutB,EAAKvtB,MAE/E,CACA,mBAAO+tI,GAIH,OAHKvC,KACDA,GAAgB,IAAI,GC/TT,iBDiURA,EACX,CACA,oBAAOwC,CAAcC,EAAYC,GAM7B,IALKD,GAAcC,GACfjvI,KAAK8uI,eAAed,WAAW,wCAAyC,GAAO7mH,OAAOmnH,sBAAuB,CACzG1xG,UAAW,kBAGfsvG,GAAwB,CACxB,IAAK8C,EACD,OAEJhvI,KAAK8uI,eAAed,WAAW,6BAA8B,GAAO7mH,OAAOmnH,sBAAuB,CAC9F1xG,UAAW,iBAEnB,CACAuvG,KAAkB6C,EAClB9C,KAA2B+C,CAC/B,CACA,kBAAOC,CAAYnC,GACf,MAAMxvF,EAAQ6uF,GAAUW,EAAS3yH,eACpB,MAATmjC,EAIJ+uF,GAAY/uF,EAHR,GAAOuxF,eAAe5hI,KAAK,uBAAyB6/H,EAI5D,CACA,WAAOxuH,CAAKgvB,GACR,OAAO,IAAI,GAAOA,EACtB,EAEJ,GAAOpmB,OAASylH,GAChB,GAAOK,OAASN,GEjWT,MCGD,GAAS,IAAI,GDHI,eCKvB,SAASwC,GAAUnwI,GACf,QAAUA,EAAiB,WAC/B,CACA,SAASowI,GAASt8H,GACd,OAAIA,EAAM5R,QAGV4R,EAAM5R,MAAQ,WACV,MAAMiB,EAAOR,MAAMnC,UAAU0B,MAAMD,KAAKoB,WACxC,OAAO+sI,GAAS,IAAIn/H,WAAWtO,MAAMnC,UAAU0B,MAAMqB,MAAMuQ,EAAO3Q,IACtE,GALW2Q,CAOf,CAIA,SAASqH,GAAUnb,GACf,MAA2B,iBAAZ,GAAwBA,GAASA,GAAUA,EAAQ,GAAO,CAC7E,CACO,SAAS,GAAQA,GACpB,GAAa,MAATA,EACA,OAAO,EAEX,GAAIA,EAAMsQ,cAAgBW,WACtB,OAAO,EAEX,GAAuB,iBAAZ,EACP,OAAO,EAEX,IAAKkK,GAAUnb,EAAMyC,SAAWzC,EAAMyC,OAAS,EAC3C,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAIvC,EAAMyC,OAAQF,IAAK,CACnC,MAAMlC,EAAIL,EAAMuC,GAChB,IAAK4Y,GAAU9a,IAAMA,EAAI,GAAKA,GAAK,IAC/B,OAAO,CAEf,CACA,OAAO,CACX,CACO,SAASgwI,GAASrwI,EAAOib,GAI5B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7B,GAAOs0H,gBAAgBvvI,EAAO,0BAC9B,MAAM8V,EAAS,GACf,KAAO9V,GACH8V,EAAOlK,QAAgB,IAAR5L,GACfA,EAAQwf,SAASxP,OAAOhQ,EAAQ,MAKpC,OAHsB,IAAlB8V,EAAOrT,QACPqT,EAAOtU,KAAK,GAET4uI,GAAS,IAAIn/H,WAAW6E,GACnC,CAOA,GANImF,EAAQq1H,oBAAyC,iBAAZ,GAAkD,OAA1BtwI,EAAMyI,UAAU,EAAG,KAChFzI,EAAQ,KAAOA,GAEfmwI,GAAUnwI,KACVA,EAAQA,EAAMuwI,eAEdC,GAAYxwI,GAAQ,CACpB,IAAI0W,EAAM1W,EAAMyI,UAAU,GACtBiO,EAAIjU,OAAS,IACU,SAAnBwY,EAAQw1H,OACR/5H,EAAM,IAAMA,EAEY,UAAnBuE,EAAQw1H,OACb/5H,GAAO,IAGP,GAAOs3H,mBAAmB,yBAA0B,QAAShuI,IAGrE,MAAM8V,EAAS,GACf,IAAK,IAAIvT,EAAI,EAAGA,EAAImU,EAAIjU,OAAQF,GAAK,EACjCuT,EAAOtU,KAAKge,SAAS9I,EAAIjO,UAAUlG,EAAGA,EAAI,GAAI,KAElD,OAAO6tI,GAAS,IAAIn/H,WAAW6E,GACnC,CACA,OAAI,GAAQ9V,GACDowI,GAAS,IAAIn/H,WAAWjR,IAE5B,GAAOguI,mBAAmB,yBAA0B,QAAShuI,EACxE,CAoCO,SAASwwI,GAAYxwI,EAAOyC,GAC/B,QAAuB,iBAAZ,IAAyBzC,EAAMyJ,MAAM,qBAG5ChH,GAAUzC,EAAMyC,SAAW,EAAI,EAAIA,EAI3C,CACA,MAAMiuI,GAAgB,mBACf,SAASC,GAAQ3wI,EAAOib,GAI3B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7B,GAAOs0H,gBAAgBvvI,EAAO,yBAC9B,IAAI0W,EAAM,GACV,KAAO1W,GACH0W,EAAMg6H,GAAsB,GAAR1wI,GAAe0W,EACnC1W,EAAQiK,KAAK6a,MAAM9kB,EAAQ,IAE/B,OAAI0W,EAAIjU,QACAiU,EAAIjU,OAAS,IACbiU,EAAM,IAAMA,GAET,KAAOA,GAEX,MACX,CACA,GAAuB,iBAAZ,EAEP,OADA1W,EAAQA,EAAMqH,SAAS,KACb5E,OAAS,EACP,MAAQzC,EAEb,KAAOA,EAKlB,GAHIib,EAAQq1H,oBAAyC,iBAAZ,GAAkD,OAA1BtwI,EAAMyI,UAAU,EAAG,KAChFzI,EAAQ,KAAOA,GAEfmwI,GAAUnwI,GACV,OAAOA,EAAMuwI,cAEjB,GAAIC,GAAYxwI,GAYZ,OAXIA,EAAMyC,OAAS,IACQ,SAAnBwY,EAAQw1H,OACRzwI,EAAQ,MAAQA,EAAMyI,UAAU,GAER,UAAnBwS,EAAQw1H,OACbzwI,GAAS,IAGT,GAAOguI,mBAAmB,yBAA0B,QAAShuI,IAG9DA,EAAMob,cAEjB,GAAI,GAAQpb,GAAQ,CAChB,IAAI8V,EAAS,KACb,IAAK,IAAIvT,EAAI,EAAGA,EAAIvC,EAAMyC,OAAQF,IAAK,CACnC,IAAIlC,EAAIL,EAAMuC,GACduT,GAAU46H,IAAmB,IAAJrwI,IAAa,GAAKqwI,GAAkB,GAAJrwI,EAC7D,CACA,OAAOyV,CACX,CACA,OAAO,GAAOk4H,mBAAmB,wBAAyB,QAAShuI,EACvE,CC/LO,MCKD,GAAS,IAAI,GDLI,aCMvB,SAAS4wI,GAAgB5wI,GACrB,MAAM8V,EAAS,GACf,KAAO9V,GACH8V,EAAOlK,QAAgB,IAAR5L,GACfA,IAAU,EAEd,OAAO8V,CACX,CACA,SAAS+6H,GAAkBlmG,EAAMzmC,EAAQzB,GACrC,IAAIqT,EAAS,EACb,IAAK,IAAIvT,EAAI,EAAGA,EAAIE,EAAQF,IACxBuT,EAAmB,IAATA,EAAgB60B,EAAKzmC,EAAS3B,GAE5C,OAAOuT,CACX,CACA,SAASg7H,GAAQrwH,GACb,GAAI9d,MAAM2Q,QAAQmN,GAAS,CACvB,IAAIqzB,EAAU,GAId,GAHArzB,EAAOtS,SAAQ,SAAUw1G,GACrB7vE,EAAUA,EAAQ1xC,OAAO0uI,GAAQntB,GACrC,IACI7vE,EAAQrxC,QAAU,GAElB,OADAqxC,EAAQloC,QAAQ,IAAOkoC,EAAQrxC,QACxBqxC,EAEX,MAAMrxC,EAASmuI,GAAgB98F,EAAQrxC,QAEvC,OADAA,EAAOmJ,QAAQ,IAAOnJ,EAAOA,QACtBA,EAAOL,OAAO0xC,EACzB,CFhBG,IAAqB9zC,EACfwwI,GADexwI,EEiBPygB,MFhBgBzgB,EAAMyC,OAAS,IAAO,GAAQzC,IEiB3D,GAAOguI,mBAAmB,+BAAgC,SAAUvtH,GAExE,MAAMkqB,EAAOhoC,MAAMnC,UAAU0B,MAAMD,KAAKouI,GAAS5vH,IACjD,GAAoB,IAAhBkqB,EAAKloC,QAAgBkoC,EAAK,IAAM,IAChC,OAAOA,EAEN,GAAIA,EAAKloC,QAAU,GAEpB,OADAkoC,EAAK/+B,QAAQ,IAAO++B,EAAKloC,QAClBkoC,EAEX,MAAMloC,EAASmuI,GAAgBjmG,EAAKloC,QAEpC,OADAA,EAAOmJ,QAAQ,IAAOnJ,EAAOA,QACtBA,EAAOL,OAAOuoC,EACzB,CAIA,SAASomG,GAAgBpmG,EAAMzmC,EAAQ8sI,EAAavuI,GAChD,MAAMqT,EAAS,GACf,KAAOk7H,EAAc9sI,EAAS,EAAIzB,GAAQ,CACtC,MAAM49D,EAAU4wE,GAAQtmG,EAAMqmG,GAC9Bl7H,EAAOtU,KAAK6+D,EAAQvqD,SACpBk7H,GAAe3wE,EAAQo+B,UACLv6F,EAAS,EAAIzB,GAC3B,GAAOusI,WAAW,uBAAwB,GAAO7mH,OAAO+oH,eAAgB,CAAC,EAEjF,CACA,MAAO,CAAEzyC,SAAW,EAAIh8F,EAASqT,OAAQA,EAC7C,CAEA,SAASm7H,GAAQtmG,EAAMzmC,GAKnB,GAJoB,IAAhBymC,EAAKloC,QACL,GAAOusI,WAAW,iBAAkB,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAGnEvmG,EAAKzmC,IAAW,IAAM,CACtB,MAAMi+C,EAAexX,EAAKzmC,GAAU,IAChCA,EAAS,EAAIi+C,EAAexX,EAAKloC,QACjC,GAAOusI,WAAW,+BAAgC,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAErF,MAAMzuI,EAASouI,GAAkBlmG,EAAMzmC,EAAS,EAAGi+C,GAInD,OAHIj+C,EAAS,EAAIi+C,EAAe1/C,EAASkoC,EAAKloC,QAC1C,GAAOusI,WAAW,8BAA+B,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAE7EH,GAAgBpmG,EAAMzmC,EAAQA,EAAS,EAAIi+C,EAAcA,EAAe1/C,EACnF,CACK,GAAIkoC,EAAKzmC,IAAW,IAAM,CAC3B,MAAMzB,EAASkoC,EAAKzmC,GAAU,IAI9B,OAHIA,EAAS,EAAIzB,EAASkoC,EAAKloC,QAC3B,GAAOusI,WAAW,uBAAwB,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAEtEH,GAAgBpmG,EAAMzmC,EAAQA,EAAS,EAAGzB,EACrD,CACK,GAAIkoC,EAAKzmC,IAAW,IAAM,CAC3B,MAAMi+C,EAAexX,EAAKzmC,GAAU,IAChCA,EAAS,EAAIi+C,EAAexX,EAAKloC,QACjC,GAAOusI,WAAW,uBAAwB,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAE7E,MAAMzuI,EAASouI,GAAkBlmG,EAAMzmC,EAAS,EAAGi+C,GAKnD,OAJIj+C,EAAS,EAAIi+C,EAAe1/C,EAASkoC,EAAKloC,QAC1C,GAAOusI,WAAW,uBAAwB,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAGtE,CAAEzyC,SAAW,EAAIt8C,EAAe1/C,EAASqT,OADjC66H,GAAQhmG,EAAKzoC,MAAMgC,EAAS,EAAIi+C,EAAcj+C,EAAS,EAAIi+C,EAAe1/C,IAE7F,CACK,GAAIkoC,EAAKzmC,IAAW,IAAM,CAC3B,MAAMzB,EAASkoC,EAAKzmC,GAAU,IAK9B,OAJIA,EAAS,EAAIzB,EAASkoC,EAAKloC,QAC3B,GAAOusI,WAAW,iBAAkB,GAAO7mH,OAAO+oH,eAAgB,CAAC,GAGhE,CAAEzyC,SAAW,EAAIh8F,EAASqT,OADlB66H,GAAQhmG,EAAKzoC,MAAMgC,EAAS,EAAGA,EAAS,EAAIzB,IAE/D,CACA,MAAO,CAAEg8F,SAAU,EAAG3oF,OAAQ66H,GAAQhmG,EAAKzmC,IAC/C,CCzGA,MAAM,GAAM,IAAIg6C,GAAO,eAChB,MAAMizF,GACT,iBAAO1xH,CAAW2xH,GACd,IAAKA,EAAQ7jH,WAAW,GAAI8jH,eACxB,MAAM,IAAI7xI,MAAM,wCAAwC,GAAI6xI,kBAEhE,OAAOF,GAAWG,QAAQ,GAAWF,EAAQlvI,MAAM,GAAI,aAC3D,CACA,cAAOovI,CAAQF,GACX,MAAM/wE,EDiGP,SAAgB11B,GACnB,MAAM76B,EAAQugI,GAAS1lG,GACjB01B,EAAU4wE,GAAQnhI,EAAO,GAI/B,OAHIuwD,EAAQo+B,WAAa3uF,EAAMrN,QAC3B,GAAOurI,mBAAmB,mBAAoB,OAAQrjG,GAEnD01B,EAAQvqD,MACnB,CCxGwB,CAAWs7H,GAAS9rI,IAAI,IACxC,OAGR6oC,eAA0BlqC,GACtB,MAAM,UAAEonE,EAAS,IAAE0a,EAAG,IAAEilD,GAqB5B,SAAqB/mI,GACjB,IAAKtB,MAAM2Q,QAAQrP,GACf,MAAM,IAAIzE,MAAM,gCAEpB,GAAIyE,EAAOxB,OAAS,GAAM,EACtB,MAAM,IAAIjD,MAAM,oDAEpB,MAAO6rE,EAAW0a,KAAQilD,GAAO/mI,EACjC,IAAKonE,GAAa1oE,MAAM2Q,QAAQ+3D,GAC5B,MAAM,IAAI7rE,MAAM,uDAEpB,IAAKumF,GAAOpjF,MAAM2Q,QAAQyyE,GACtB,MAAM,IAAIvmF,MAAM,6DAEpB,MAAO,CAAE6rE,YAAW0a,MAAKilD,MAC7B,CApCoCuG,CAAYttI,GACtCsP,EAAM,CAAC,EACb,IAAK,IAAIhR,EAAI,EAAGA,EAAIyoI,EAAIvoI,OAAQF,GAAK,EACjC,IACIgR,EAAIsoC,GAAYmvF,EAAIzoI,KAAOyoI,EAAIzoI,EAAI,EACvC,CACA,MAAO0iB,GACH,GAAIuD,MAAM,iDAAkDwiH,EAAIzoI,GAAI0iB,EACxE,CAEJ,MAAMusH,EAKV,SAAmBzrD,GAEf,OAAKA,EAAItjF,OAEFwkC,OAAO,KAAO,GAAW8+C,IADrB9+C,OAAO,EAEtB,CAViBwqG,CAAU1rD,GACjB5vC,EAAM,GAAIv2C,OAAO2T,EAAKi+H,EAAMnmE,GAElC,OAwBJ,SAAwB0a,EAAKilD,EAAK70F,EAAKk1B,GACnC,MAAMqmE,EAAkB,GDNjBf,GAAQG,GCM+B,CAAC/qD,KAAQilD,MACvD,IAAK70F,EAAI31B,OAAOkxH,EAAiBrmE,GAC7B,MAAM,IAAI7rE,MAAM,iCAExB,CA9BImyI,CAAe5rD,EAAKilD,EAAK70F,EAAKk1B,GACvBl1B,CACX,CAlBey7F,CAAWvxE,EACtB,EChBW,MAAMwxE,WAAiBhjG,IACrC,GAAQ,EACR,GAAS,IAAIA,IACb,GAAY,IAAIA,IAChB,GACA,GACA,GAEA,WAAAv+B,CAAY2K,EAAU,CAAC,GAGtB,GAFAm2B,UAEMn2B,EAAQgiG,SAAWhiG,EAAQgiG,QAAU,GAC1C,MAAM,IAAI77G,UAAU,6CAGrB,GAA8B,iBAAnB6Z,EAAQ62H,QAA0C,IAAnB72H,EAAQ62H,OACjD,MAAM,IAAI1wI,UAAU,4CAGrBJ,MAAK,EAAWia,EAAQgiG,QACxBj8G,MAAK,EAAUia,EAAQ62H,QAAUvmI,OAAOytG,kBACxCh4G,MAAK,EAAcia,EAAQ82H,UAC5B,CAGA,cAAIC,GACH,OAAOhxI,MAAK,CACb,CAEA,GAAetB,GACd,GAAgC,mBAArBsB,MAAK,EAIhB,IAAK,MAAOjB,EAAKsmD,KAAS3mD,EACzBsB,MAAK,EAAYjB,EAAKsmD,EAAKrmD,MAE7B,CAEA,GAAiBD,EAAKsmD,GACrB,MAA2B,iBAAhBA,EAAKy7D,QAAuBz7D,EAAKy7D,QAAUt2G,KAAKm2D,QAC1B,mBAArB3gE,MAAK,GACfA,MAAK,EAAYjB,EAAKsmD,EAAKrmD,OAGrBgB,KAAKknD,OAAOnoD,GAIrB,CAEA,GAAsBA,EAAKsmD,GAE1B,IAAgB,IADArlD,MAAK,EAAiBjB,EAAKsmD,GAE1C,OAAOA,EAAKrmD,KAEd,CAEA,GAAcD,EAAKsmD,GAClB,OAAOA,EAAKy7D,OAAS9gH,MAAK,EAAsBjB,EAAKsmD,GAAQA,EAAKrmD,KACnE,CAEA,GAAMD,EAAKL,GACV,MAAM2mD,EAAO3mD,EAAMU,IAAIL,GAEvB,OAAOiB,MAAK,EAAcjB,EAAKsmD,EAChC,CAEA,GAAKtmD,EAAKC,GACTgB,MAAK,EAAOV,IAAIP,EAAKC,GACrBgB,MAAK,IAEDA,MAAK,GAASA,MAAK,IACtBA,MAAK,EAAQ,EACbA,MAAK,EAAeA,MAAK,GACzBA,MAAK,EAAYA,MAAK,EACtBA,MAAK,EAAS,IAAI6tC,IAEpB,CAEA,GAAc9uC,EAAKsmD,GAClBrlD,MAAK,EAAUknD,OAAOnoD,GACtBiB,MAAK,EAAKjB,EAAKsmD,EAChB,CAEA,GAAE,GACD,IAAK,MAAMA,KAAQrlD,MAAK,EAAW,CAClC,MAAOjB,EAAKC,GAASqmD,EAChBrlD,MAAK,EAAOf,IAAIF,KAEJ,IADAiB,MAAK,EAAiBjB,EAAKC,WAEpCqmD,EAGT,CAEA,IAAK,MAAMA,KAAQrlD,MAAK,EAAQ,CAC/B,MAAOjB,EAAKC,GAASqmD,GAEL,IADArlD,MAAK,EAAiBjB,EAAKC,WAEpCqmD,EAER,CACD,CAEA,GAAAjmD,CAAIL,GACH,GAAIiB,MAAK,EAAOf,IAAIF,GAAM,CACzB,MAAMsmD,EAAOrlD,MAAK,EAAOZ,IAAIL,GAC7B,OAAOiB,MAAK,EAAcjB,EAAKsmD,EAChC,CAEA,GAAIrlD,MAAK,EAAUf,IAAIF,GAAM,CAC5B,MAAMsmD,EAAOrlD,MAAK,EAAUZ,IAAIL,GAChC,IAAyC,IAArCiB,MAAK,EAAiBjB,EAAKsmD,GAE9B,OADArlD,MAAK,EAAcjB,EAAKsmD,GACjBA,EAAKrmD,KAEd,CACD,CAEA,GAAAM,CAAIP,EAAKC,GAAO,OAAC8xI,EAAS9wI,MAAK,GAAW,CAAC,GAC1C,MAAM8gH,EAA2B,iBAAXgwB,GAAuBA,IAAWvmI,OAAOytG,kBAC3DxtG,KAAKm2D,MAAQmwE,OACd5xI,EAWH,OATIc,MAAK,EAAOf,IAAIF,GACnBiB,MAAK,EAAOV,IAAIP,EAAK,CACpBC,QACA8hH,WAGD9gH,MAAK,EAAKjB,EAAK,CAACC,QAAO8hH,WAGjB9gH,IACR,CAEA,GAAAf,CAAIF,GACH,OAAIiB,MAAK,EAAOf,IAAIF,IACXiB,MAAK,EAAiBjB,EAAKiB,MAAK,EAAOZ,IAAIL,MAGhDiB,MAAK,EAAUf,IAAIF,KACdiB,MAAK,EAAiBjB,EAAKiB,MAAK,EAAUZ,IAAIL,GAIxD,CAEA,IAAAqK,CAAKrK,GACJ,OAAIiB,MAAK,EAAOf,IAAIF,GACZiB,MAAK,EAAMjB,EAAKiB,MAAK,GAGzBA,MAAK,EAAUf,IAAIF,GACfiB,MAAK,EAAMjB,EAAKiB,MAAK,QAD7B,CAGD,CAEA,OAAOjB,GACN,MAAM+8H,EAAU97H,MAAK,EAAOknD,OAAOnoD,GAKnC,OAJI+8H,GACH97H,MAAK,IAGCA,MAAK,EAAUknD,OAAOnoD,IAAQ+8H,CACtC,CAEA,KAAAv8H,GACCS,MAAK,EAAOT,QACZS,MAAK,EAAUT,QACfS,MAAK,EAAQ,CACd,CAEA,MAAAixI,CAAOC,GACN,KAAMA,GAAWA,EAAU,GAC1B,MAAM,IAAI9wI,UAAU,6CAGrB,MAAMgmH,EAAQ,IAAIpmH,MAAK,KACjBmxI,EAAc/qB,EAAM3kH,OAASyvI,EAC/BC,EAAc,GACjBnxI,MAAK,EAAS,IAAI6tC,IAAIu4E,GACtBpmH,MAAK,EAAY,IAAI6tC,IACrB7tC,MAAK,EAAQomH,EAAM3kH,SAEf0vI,EAAc,GACjBnxI,MAAK,EAAeomH,EAAMllH,MAAM,EAAGiwI,IAGpCnxI,MAAK,EAAY,IAAI6tC,IAAIu4E,EAAMllH,MAAMiwI,IACrCnxI,MAAK,EAAS,IAAI6tC,IAClB7tC,MAAK,EAAQ,GAGdA,MAAK,EAAWkxI,CACjB,CAEA,KAAEhsI,GACD,IAAK,MAAOnG,KAAQiB,WACbjB,CAER,CAEA,OAAEkE,GACD,IAAK,MAAO,CAAEjE,KAAUgB,WACjBhB,CAER,CAEA,EAAGykC,OAAOsb,YACT,IAAK,MAAMsG,KAAQrlD,MAAK,EAAQ,CAC/B,MAAOjB,EAAKC,GAASqmD,GAEL,IADArlD,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAEpB,CAEA,IAAK,MAAMqmD,KAAQrlD,MAAK,EAAW,CAClC,MAAOjB,EAAKC,GAASqmD,EAChBrlD,MAAK,EAAOf,IAAIF,KAEJ,IADAiB,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAGrB,CACD,CAEA,kBAAEoyI,GACD,IAAIhrB,EAAQ,IAAIpmH,MAAK,GACrB,IAAK,IAAIuB,EAAI6kH,EAAM3kH,OAAS,EAAGF,GAAK,IAAKA,EAAG,CAC3C,MAAM8jD,EAAO+gE,EAAM7kH,IACZxC,EAAKC,GAASqmD,GAEL,IADArlD,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAEpB,CAEAonH,EAAQ,IAAIpmH,MAAK,GACjB,IAAK,IAAIuB,EAAI6kH,EAAM3kH,OAAS,EAAGF,GAAK,IAAKA,EAAG,CAC3C,MAAM8jD,EAAO+gE,EAAM7kH,IACZxC,EAAKC,GAASqmD,EAChBrlD,MAAK,EAAOf,IAAIF,KAEJ,IADAiB,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAGrB,CACD,CAEA,iBAAEqyI,GACD,IAAK,MAAOtyI,EAAKC,KAAUgB,MAAK,SACzB,CAACjB,EAAKC,EAAMA,MAEpB,CAEA,QAAIP,GACH,IAAKuB,MAAK,EACT,OAAOA,MAAK,EAAUvB,KAGvB,IAAI6yI,EAAe,EACnB,IAAK,MAAMvyI,KAAOiB,MAAK,EAAUkF,OAC3BlF,MAAK,EAAOf,IAAIF,IACpBuyI,IAIF,OAAOroI,KAAKC,IAAIlJ,MAAK,EAAQsxI,EAActxI,MAAK,EACjD,CAEA,WAAIi8G,GACH,OAAOj8G,MAAK,CACb,CAEA,OAAA8vD,GACC,OAAO9vD,KAAKqxI,kBACb,CAEA,OAAAlkI,CAAQokI,EAAkBC,EAAexxI,MACxC,IAAK,MAAOjB,EAAKC,KAAUgB,KAAKqxI,mBAC/BE,EAAiBtwI,KAAKuwI,EAAcxyI,EAAOD,EAAKiB,KAElD,CAEA,IAAKyjC,OAAOqB,eACX,MAAO,UACR,CAEA,QAAAz+B,GACC,MAAO,YAAYrG,KAAKvB,QAAQuB,KAAKi8G,UACtC,CAEA,CAACx4E,OAAOmL,IAAI,iCACX,OAAO5uC,KAAKqG,UACb,ECxSM,SAASorI,GAAcC,EAAgB37B,EAAU47B,GACpD,MAAO,GAAGD,UAAuB37B,UAAiB47B,GACtD,CAIOxkG,eAAenT,GAAQ43G,EAAU3tF,GACpC,MAAM4tF,QAAY9xH,MAAM6xH,EAAU,CAC9Bh2B,QAAS,IAAIk2B,QAAQ,CACjBj2B,OAAQ,yBAEZ53D,WAGJ,aADkB4tF,EAAIn3H,MAE1B,CAOO,SAASq3H,GAAYh8B,EAAU47B,GAClC,MAAO,GAAGA,KAAc57B,GAC5B,CCxBA,MAAM,GAAMp3G,OAAO01B,OAAO,GAAM,0BAA2B,CACvD7M,MAAO,GAAM,kCAsMjB,GAhMA,MACI3oB,OACAmzI,UACAC,SACAC,SACAC,kBAOA,WAAA7iI,CAAY2K,EAAU,CAAC,GACnBja,KAAKnB,OAAS,IAAIgyI,GAAS,CAAE50B,QAAShiG,GAASm4H,UAAY,MAC3DpyI,KAAKgyI,UAAY,IAAInB,GAAS,CAAE50B,QAAShiG,GAASm4H,UAAY,MAC9DpyI,KAAKiyI,SAAW,CACZ,uCACA,8BAEJjyI,KAAKkyI,SAAWj4H,EAAQ+f,SAAW,GACnCh6B,KAAKmyI,kBAAoB,EAC7B,CAKA,MAAAhuF,GACInkD,KAAKmyI,kBAAkBhlI,SAAQs/G,IAAgBA,EAAW1oD,OAAO,GACrE,CAKA,UAAAsuE,GACI,OAAOryI,KAAKiyI,QAChB,CAKA,mBAAAK,GACI,MAAMC,EAAa,IAAIvyI,KAAKiyI,UAC5B,IAAK,IAAI1wI,EAAIgxI,EAAW9wI,OAAS,EAAGF,EAAI,EAAGA,IAAK,CAC5C,MAAMiB,EAAIyG,KAAK6a,MAAM7a,KAAKm0B,SAAW77B,GAC/Bu7F,EAAOy1C,EAAWhxI,GACxBgxI,EAAWhxI,GAAKgxI,EAAW/vI,GAC3B+vI,EAAW/vI,GAAKs6F,CACpB,CACA,OAAOy1C,CACX,CAMA,UAAAC,CAAWC,GACPzyI,KAAKiyI,SAAWQ,CACpB,CACA,aAAMvuI,CAAQ6xG,EAAU28B,EAAS,KAC7B,OAAQA,GACJ,IAAK,IACD,OAAO1yI,KAAK2yI,SAAS58B,GACzB,IAAK,OACD,OAAO/1G,KAAK4yI,SAAS78B,GACzB,IAAK,MACD,OAAO/1G,KAAK6yI,WAAW98B,GAC3B,QACI,MAAM,IAAIv3G,MAAM,GAAGk0I,sBAE/B,CAMA,cAAMC,CAAS58B,GACX,MAAM47B,EAAa,IACbv1B,EAASp8G,KAAKnB,OAAOO,IAAI,GAAkB22G,EAAU47B,IAC3D,GAAc,MAAVv1B,EACA,OAAOA,EAEX,IAAI33D,GAAU,EACd,IAAK,MAAMquF,KAAU9yI,KAAKsyI,sBAAuB,CAC7C,MAAM7lB,EAAa,IAAIhd,gBACvBzvG,KAAKmyI,kBAAkB3xI,KAAKisH,GAC5B,IACI,MAAMp8F,QAAiBrwB,KAAKkyI,SAAS,GAAoBY,EAAQ/8B,EAAU47B,GAAallB,EAAWxoE,QAC7Fta,EAAOtZ,EAAS6qF,OAAO52G,KAAIqc,GAAKA,EAAEgpB,OAClCs5D,EAAMh6F,KAAKC,OAAOmnB,EAAS6qF,OAAO52G,KAAIqc,GAAKA,EAAE06F,OAEnD,OADAr7G,KAAKnB,OAAOS,IAAI,GAAkBy2G,EAAU47B,GAAahoG,EAAM,CAAEmnG,OAAQ7tC,IAClEt5D,CACX,CACA,MAAOljB,GACCgmG,EAAWxoE,OAAOQ,UAClBA,GAAU,GAEd,GAAIj9B,MAAM,GAAGsrH,uBAA4B/8B,YAAmB47B,IAChE,CACA,QACI3xI,KAAKmyI,kBAAoBnyI,KAAKmyI,kBAAkBtlI,QAAO1F,GAAKA,IAAMslH,GACtE,CACJ,CACA,GAAIhoE,EACA,MAAM9lD,OAAO01B,OAAO,IAAI71B,MAAM,qBAAsB,CAChDuW,KAAM,eAGd,MAAM,IAAIvW,MAAM,qBAAqBu3G,YAAmB47B,IAC5D,CAMA,cAAMiB,CAAS78B,GACX,MAAM47B,EAAa,OACbv1B,EAASp8G,KAAKnB,OAAOO,IAAI,GAAkB22G,EAAU47B,IAC3D,GAAc,MAAVv1B,EACA,OAAOA,EAEX,IAAI33D,GAAU,EACd,IAAK,MAAMquF,KAAU9yI,KAAKsyI,sBAAuB,CAC7C,MAAM7lB,EAAa,IAAIhd,gBACvBzvG,KAAKmyI,kBAAkB3xI,KAAKisH,GAC5B,IACI,MAAMp8F,QAAiBrwB,KAAKkyI,SAAS,GAAoBY,EAAQ/8B,EAAU47B,GAAallB,EAAWxoE,QAC7Fta,EAAOtZ,EAAS6qF,OAAO52G,KAAIqc,GAAKA,EAAEgpB,OAClCs5D,EAAMh6F,KAAKC,OAAOmnB,EAAS6qF,OAAO52G,KAAIqc,GAAKA,EAAE06F,OAEnD,OADAr7G,KAAKnB,OAAOS,IAAI,GAAkBy2G,EAAU47B,GAAahoG,EAAM,CAAEmnG,OAAQ7tC,IAClEt5D,CACX,CACA,MAAOljB,GACCgmG,EAAWxoE,OAAOQ,UAClBA,GAAU,GAEd,GAAIj9B,MAAM,GAAGsrH,uBAA4B/8B,YAAmB47B,IAChE,CACA,QACI3xI,KAAKmyI,kBAAoBnyI,KAAKmyI,kBAAkBtlI,QAAO1F,GAAKA,IAAMslH,GACtE,CACJ,CACA,GAAIhoE,EACA,MAAM9lD,OAAO01B,OAAO,IAAI71B,MAAM,wBAAyB,CACnDuW,KAAM,eAGd,MAAM,IAAIvW,MAAM,qBAAqBu3G,YAAmB47B,IAC5D,CAMA,gBAAMkB,CAAW98B,GACb,MAAM47B,EAAa,MACbv1B,EAASp8G,KAAKgyI,UAAU5yI,IAAI,GAAkB22G,EAAU47B,IAC9D,GAAc,MAAVv1B,EACA,OAAOA,EAEX,IAAI33D,GAAU,EACd,IAAK,MAAMquF,KAAU9yI,KAAKsyI,sBAAuB,CAC7C,MAAM7lB,EAAa,IAAIhd,gBACvBzvG,KAAKmyI,kBAAkB3xI,KAAKisH,GAC5B,IACI,MAAMp8F,QAAiBrwB,KAAKkyI,SAAS,GAAoBY,EAAQ/8B,EAAU47B,GAAallB,EAAWxoE,QAC7Fta,EAAOtZ,EAAS6qF,OAAO52G,KAAIqc,GAAK,CAACA,EAAEgpB,KAAK3jC,QAAQ,SAAU,OAC1Di9F,EAAMh6F,KAAKC,OAAOmnB,EAAS6qF,OAAO52G,KAAIqc,GAAKA,EAAE06F,OAEnD,OADAr7G,KAAKgyI,UAAU1yI,IAAI,GAAkBy2G,EAAU47B,GAAahoG,EAAM,CAAEmnG,OAAQ7tC,IACrEt5D,CACX,CACA,MAAOljB,GACCgmG,EAAWxoE,OAAOQ,UAClBA,GAAU,GAEd,GAAIj9B,MAAM,GAAGsrH,uBAA4B/8B,YAAmB47B,IAChE,CACA,QACI3xI,KAAKmyI,kBAAoBnyI,KAAKmyI,kBAAkBtlI,QAAO1F,GAAKA,IAAMslH,GACtE,CACJ,CACA,GAAIhoE,EACA,MAAM9lD,OAAO01B,OAAO,IAAI71B,MAAM,uBAAwB,CAClDuW,KAAM,eAGd,MAAM,IAAIvW,MAAM,qBAAqBu3G,YAAmB47B,IAC5D,CACA,UAAAh2G,GACI37B,KAAKnB,OAAOU,QACZS,KAAKgyI,UAAUzyI,OACnB,GCrME,GAAM,IAAI29C,GAAO,kBAChB,MAAM61F,GACTh+E,SAMA,mBAAan2D,GACT,OAAO,IAAIm0I,EACf,CACA,WAAAzjI,CAAYylD,EAAW,IAAI,IACvB/0D,KAAK+0D,SAAWA,CACpB,CAQA,gBAAMi+E,CAAW94D,GACb,IAAIihC,EACJ,IACIA,QAAgBn7G,KAAK+0D,SAAS89E,WAAW34D,EAC7C,CACA,MAAO1yD,GAEH,MADA,GAAIA,MAAM,iBAAkBA,GACtB,IAAIhpB,MAAM,mBACpB,CACA,IAAK28G,EACD,MAAM,IAAI38G,MAAM,qBAAqB07E,KACzC,MAAMplE,EAAS,GAmBf,OAlBAqmG,EAAQhuG,SAASsP,IACI,iBAANA,EACP3H,EAAOtU,KAAKic,GAEP9a,MAAM2Q,QAAQmK,GACnBA,EAAEtP,SAAS8lI,IACW,iBAAPA,EACPn+H,EAAOtU,KAAKyyI,GAGZn+H,EAAOtU,KAAKq6C,GAAYo4F,GAC5B,IAIJn+H,EAAOtU,KAAKq6C,GAAYp+B,GAC5B,IAEG3H,CACX,mCClDG,MAAMo+H,GACTjgF,qBAAuB,GAAIo9E,cAC3Bp9E,mBAAqB,WACrBA,qBAAuB,kBACvBA,mBAAqB,gBAKrB,yBAAOkgF,CAAmBniI,EAAMq4D,GAC5B,IAAKr4D,EAAKub,WAAWvsB,KAAKozI,aACtB,MAAM,IAAI50I,MAAM,uCAAuCwB,KAAKozI,gBAChE,MAAMC,EAAaH,GAAQI,gBAAgBtiI,GACrCuiI,EAAmB,UAAcn9G,QAAQizC,GAIzCmqE,EAAkBxiI,EAAKtJ,MAAM,QAAQ,GACrC+rI,EAAwB,GAAYD,GAG1C,IADmBxK,GADK,GAAWqK,EAAWhpE,UAAW,aAAanpE,MAAM,EAAG,IAC3B4nI,GAAU2K,GAAwB,IAAIxjI,WAAWsjI,IAEjG,MAAM,IAAI/0I,MAAM,2CACpB,OAAO60I,EAAWK,KACtB,CACA,sBAAOJ,CAAgBK,GACnB,MAAMnxC,EAAUmxC,EAAIlrI,MAAM,+DAC1B,IAAK9G,MAAM2Q,QAAQkwF,GACf,MAAM,IAAIhkG,MAAM,sCACpBgkG,EAAQl6F,QACR,MAAOorI,EAAOE,EAAO7uD,EAAK1a,GAAam4B,EACvC,IAAKkxC,EACD,MAAM,IAAIl1I,MAAM,qDACpB,IAAKo1I,EACD,MAAM,IAAIp1I,MAAM,qDACpB,IAAKumF,EACD,MAAM,IAAIvmF,MAAM,uDACpB,IAAK6rE,EACD,MAAM,IAAI7rE,MAAM,uDACpB,MAAO,CAAEk1I,QAAOE,QAAO7uD,IAAKx6E,OAAOw6E,GAAM1a,YAC7C,CAMA,gBAAOwpE,CAAUC,GACb,IAAKA,EAAKvnH,WAAWvsB,KAAK+zI,aACtB,MAAM,IAAIv1I,MAAM,uCAAuCwB,KAAK+zI,gBAChE,MAAMvxC,EAAUsxC,EAAKrrI,MAAM,8BAC3B,IAAK9G,MAAM2Q,QAAQkwF,GACf,MAAM,IAAIhkG,MAAM,sCACpBgkG,EAAQl6F,QACR,MAAO+gE,EAAW6Q,GAAUsoB,EAC5B,IAAKn5B,EACD,MAAM,IAAI7qE,MAAM,sDACpB,IAAK07E,EACD,MAAM,IAAI17E,MAAM,kDACpB,MAAO,CAAE6qE,YAAW6Q,SACxB,CAKA,kBAAO85D,CAAYC,GACf,IAAKA,EAAO1nH,WAAWvsB,KAAKk0I,eACxB,MAAM,IAAI11I,MAAM,yCAAyCwB,KAAKk0I,kBAClE,OAAOD,EAAOvsI,MAAM1H,KAAKk0I,eAAe,GAAGxsI,MAAM,IACrD,ECxEJ,MAAM,GAAM,IAAIw1C,GAAO,yBA6EvB,SAASi3F,GAAYC,EAAQ7qI,GACzB,OAAQA,EAAO6rD,OAASg/E,EAAOh/E,OAC3B7rD,EAAOw7D,OAASqvE,EAAOrvE,OACvBx7D,EAAOsD,QAAUunI,EAAOvnI,QACxBtD,EAAO80D,WAAa+1E,EAAO/1E,SACnC,CACA,SAASo1D,GAAU/rE,EAAMuZ,GACrB,IAAKvZ,EAAK+jF,OACN,OAAO,EACX,IAAK,MAAMniC,KAAgBroC,EACvB,GAAIvZ,EAAK+jF,SAAWniC,EAAamiC,OAC7B,OAAO,EAGf,OAAO,CACX,CACA,SAAS4I,GAAgB/iI,EAAMgjI,GACvBhjI,EAAK8jD,QACLk/E,EAAMl/E,OAAS,GACf9jD,EAAKyzD,QACLuvE,EAAMvvE,OAAS,GACfzzD,EAAKzE,SACLynI,EAAMznI,QAAU,GAChByE,EAAK+sD,YACLi2E,EAAMj2E,WAAa,EAC3B,CAOA,SAASk2E,GAAyBjjI,EAAM8iI,EAAQ7qI,GAC5C,GAAI4qI,GAAYC,EAAQ7qI,GACpB,KAAM,kEAEV,MAAM4wB,EAUV,SAA6Bi6G,EAAQ7qI,GACjC,MAAO,CACH6rD,MAAO7rD,EAAO6rD,MAAQg/E,EAAOh/E,MAC7B2P,MAAOx7D,EAAOw7D,MAAQqvE,EAAOrvE,MAC7Bl4D,OAAQtD,EAAOsD,OAASunI,EAAOvnI,OAC/BwxD,UAAW90D,EAAO80D,UAAY+1E,EAAO/1E,UAE7C,CAjBoBm2E,CAAoBJ,EAAQ7qI,GAC5C,OAAS4wB,EAAQi7B,OAAS9jD,EAAK8jD,OAC1Bj7B,EAAQ4qC,OAASzzD,EAAKyzD,OACtB5qC,EAAQttB,QAAUyE,EAAKzE,QACvBstB,EAAQkkC,WAAa/sD,EAAK+sD,SACnC,CClHA,MAAM,GAAM,IAAInhB,GAAO,iBAChB,MAAMu3F,GACT9gC,IACA+gC,cACAC,gBAAkB,GAClB,wBAAaC,CAAYC,GAIrB,OAHKA,IACDA,QAAkB9B,GAAan0I,UAE5B,IAAI61I,GAAiBI,EAChC,CAQA,cAAMj8E,CAASk8E,EAAaC,GACxB,MAAMC,EAAe/rI,KAAK6a,MAAM7a,KAAKm0B,SAAW03G,EAAYrzI,SACtD,UAAE4nE,EAAS,OAAE6Q,GAAWg5D,GAAQW,UAAUiB,EAAYE,IACtDl1I,EAAU,CACZo6E,SACA7Q,YACA4rE,OAAQ,CAAC,GAEPh0E,QDxBP9zB,eAAoD4nG,EAA2BG,EAAgBC,GAClG,MAAMf,EAAS,CACXh/E,MAAO2/E,EAA0B3/E,OAAS,EAC1C2P,MAAOgwE,EAA0BhwE,OAAS,EAC1Cl4D,OAAQkoI,EAA0BloI,QAAU,EAC5CwxD,UAAW02E,EAA0B12E,WAAa,GAEhD+2E,EAAchB,EAAOh/E,MAAQg/E,EAAOrvE,MAAQqvE,EAAOvnI,OAASunI,EAAO/1E,UACnE90D,EAAS,CACX6rD,MAAO,EACP2P,MAAO,EACPl4D,OAAQ,EACRwxD,UAAW,GAEf,IAAIg3E,EAAgB,EACpB,MAAMp0E,EAAQ,GACd,MAAQkzE,GAAYC,EAAQ7qI,IACxB8rI,EAAgBD,EAAcF,GAAgB,CAC9C,MAAMxtF,QAAaytF,IACfztF,GAAQ+rE,GAAU/rE,EAAMuZ,KAEpBvZ,EAAKijF,OACD4J,GAAyB7sF,EAAKijF,MAAOyJ,EAAQ7qI,KAC7C8qI,GAAgB3sF,EAAKijF,MAAOphI,GAC5B03D,EAAMzgE,KAAKknD,IAGnB,GAAInT,KAAK,2CAA2CmT,EAAK+jF,UAAU/jF,EAAKv0B,OAE5EkiH,GACJ,CACA,OAAOp0E,CACX,CCR4Bq0E,CAAqCP,EAA2B/0I,KAAK20I,iBAAiB,IAAM30I,KAAKu1I,QAAQr7D,EAAQp6E,KAOrI,OANA,GAAIy0C,KAAK,oBAAqB0sB,EAAM38D,KAAKojD,IAC9B,CACHh3C,GAAIg3C,EAAKX,QAAQ1gD,WACjBy8F,WAAYp7C,EAAKo7C,YAAYx+F,KAAKy1D,GAAOA,EAAG1zD,kBAG7C46D,CACX,CACA,WAAA3xD,CAAYqkG,GACR3zG,KAAK00I,cAAgB,CAAC,EACtB10I,KAAK2zG,IAAMA,CACf,CAIA,iBAAO6hC,CAAYV,EAAaC,GAC5B,MAAMC,EAAe/rI,KAAK6a,MAAM7a,KAAKm0B,SAAW03G,EAAYrzI,SACtD,UAAE4nE,EAAS,OAAE6Q,GAAWg5D,GAAQW,UAAUiB,EAAYE,IACtDl1I,EAAU,CACZo6E,SACA7Q,YACA4rE,OAAQ,CAAC,GAEb,UAAW,MAAMvtF,KDVlBva,gBAAqD4nG,EAA2BG,EAAgBC,GACnG,MAAMf,EAAS,CACXh/E,MAAO2/E,EAA0B3/E,OAAS,EAC1C2P,MAAOgwE,EAA0BhwE,OAAS,EAC1Cl4D,OAAQkoI,EAA0BloI,QAAU,EAC5CwxD,UAAW02E,EAA0B12E,WAAa,GAEhD+2E,EAAchB,EAAOh/E,MAAQg/E,EAAOrvE,MAAQqvE,EAAOvnI,OAASunI,EAAO/1E,UACnE90D,EAAS,CACX6rD,MAAO,EACP2P,MAAO,EACPl4D,OAAQ,EACRwxD,UAAW,GAEf,IAAIg3E,EAAgB,EACpB,MAAMI,EAAc,IAAIt6F,IACxB,MAAQg5F,GAAYC,EAAQ7qI,IACxB8rI,EAAgBD,EAAcF,GAAgB,CAC9C,MAAMxtF,QAAaytF,IACfztF,GAAQA,EAAK+jF,SAAWgK,EAAYx2I,IAAIyoD,EAAK+jF,UAC7CgK,EAAYz4H,IAAI0qC,EAAK+jF,QAEjB/jF,EAAKijF,OACD4J,GAAyB7sF,EAAKijF,MAAOyJ,EAAQ7qI,KAC7C8qI,GAAgB3sF,EAAKijF,MAAOphI,SACtBm+C,GAGd,GAAInT,KAAK,2CAA2CmT,EAAK+jF,UAAU/jF,EAAKv0B,OAE5EkiH,GACJ,CACJ,CCtBiCK,CAAqCX,EAA2B/0I,KAAK20I,iBAAiB,IAAM30I,KAAKu1I,QAAQr7D,EAAQp6E,WAChI4nD,CAEd,CAKA,aAAM6tF,CAAQI,EAAW71I,GACrB,IACI,MAAMw+C,QAAct+C,KAAK41I,cAAcD,EAAW71I,GAElD,IAAIuI,EACAwtI,EAFJ/1I,EAAQm1I,OAAOU,IAAa,EAG5B,MAAMG,EAoDlB,SAAsBx3F,GAClB,OAAIA,EAAM/xB,WAAW2mH,GAAQE,aAClBF,GAAQE,YACf90F,EAAM/xB,WAAW2mH,GAAQgB,eAClBhB,GAAQgB,cACf51F,EAAM/xB,WAAW2mH,GAAQ7C,eAClB6C,GAAQ7C,cACZ,EACX,CA5D8B0F,CAAaz3F,GAC/B,IACI,OAAQw3F,GACJ,KAAK5C,GAAQE,YAET,OADA/qI,EAAO6qI,GAAQC,mBAAmB70F,EAAOx+C,EAAQupE,iBACpCrpE,KAAKu1I,QAAQltI,EAAMvI,GACpC,KAAKozI,GAAQgB,cAGT,OAFA2B,EAAW3C,GAAQc,YAAY11F,GAC/Bj2C,EA8DxB,SAA0BwtI,EAAU/1I,GAGhC,MAAMk2I,EAAe,CAAC,EACtB,IAAK,MAAOvkH,EAAKkkH,KAAcE,EAAS/lF,UAChChwD,EAAQm1I,OAAOU,KACfK,EAAavkH,IAAO,GAI5B,GAAI9yB,OAAOuG,KAAK8wI,GAAcv0I,SAAWo0I,EAASp0I,OAC9C,MAAM,IAAIjD,MAAM,uCAGpB,IAAIqM,EACJ,GACIA,EAAQ5B,KAAK6a,MAAM7a,KAAKm0B,SAAWy4G,EAASp0I,cACvCu0I,EAAanrI,IACtB,OAAOgrI,EAAShrI,EACpB,CAjF+BorI,CAAiBJ,EAAU/1I,SACrBE,KAAKu1I,QAAQltI,EAAMvI,GACpC,KAAKozI,GAAQ7C,cACT,OAAOF,GAAW1xH,WAAW6/B,GACjC,QACI,OAAO,KAEnB,CACA,MAAO92B,GAEH,OADA,GAAIA,MAAM,6BAA6BsuH,kBAA0BH,MAAcnuH,KACxE,IACX,CACJ,CACA,MAAOA,GAEH,OADA,GAAIA,MAAM,8CAA8CmuH,MAAcnuH,KAC/D,IACX,CACJ,CAOA,mBAAMouH,CAAcD,EAAW71I,GAC3B,GAAIE,KAAK00I,cAAciB,GACnB,OAAO31I,KAAK00I,cAAciB,GAG9B,MAAM3gC,EAAW2gC,IAAc71I,EAAQo6E,OACjC,GAAGy7D,KAAa71I,EAAQo6E,SACxBp6E,EAAQo6E,OACR7pD,QAAiBrwB,KAAK2zG,IAAIq/B,WAAWh+B,GAC3C,IAAK3kF,EAAS5uB,OACV,MAAM,IAAIjD,MAAM,yDACpB,IAAK6xB,EAAS,GAAG5uB,OACb,MAAM,IAAIjD,MAAM,6BAGpB,MAAMsW,EAASub,EAASxoB,KAAK,IAE7B,OADA7H,KAAK00I,cAAciB,GAAa7gI,EACzBA,CACX,ECjHJ,MAAM,GAAM,IAAIooC,GAAO,sBAIhB,MAAMg5F,WAAyB9pF,GAClC+pF,SACAntB,SACAotB,YACA3wH,SACA,WAAAnW,CAAY84C,EAAYnuC,GACpBm2B,QACApwC,KAAKgpH,UAAW,EAChBhpH,KAAKo2I,YAAchuF,EACnBpoD,KAAKylB,SAAWxL,EAChB,MAAM,QAAEo8H,GAAYp8H,EACpB,GAAIs6B,KAAK,yCAA0C8hG,EACvD,CAIA,WAAMrvI,GACF,GAAIutC,KAAK,mCACTv0C,KAAKgpH,UAAW,QACVhpH,KAAKi6D,WACf,CACA,eAAMA,GACF,IAAKj6D,KAAKm2I,SAAU,CAChB,IAAI,QAAEE,GAAYr2I,KAAKylB,SAClB9jB,MAAM2Q,QAAQ+jI,KACfA,EAAU,CAACA,IACf,MAAM,0BAAEtB,GAA8B/0I,KAAKylB,SACrCkuF,QAAY8gC,GAAiBG,cACnC50I,KAAKm2I,SAAWxiC,EAAI6hC,YAAYp5G,KAAKu3E,EAAK0iC,EAAStB,EACvD,CACA,UAAW,MAAMuB,KAAWt2I,KAAKm2I,WAAY,CACzC,IAAKn2I,KAAKgpH,SACN,OAEJ,MAAM,SAAElwD,EAAQ,UAAE5d,GAAco7F,EAChC,IAAKx9E,EACD,SAEJ,MAAMy9E,EAAe,CACjB,CAAC,IAA6B,CAC1Bv3I,MAAOgB,KAAKylB,SAASu9E,U1BzCE,G0B0CvBC,IAAKjjG,KAAKylB,SAASy9E,Q1BzCE,M0B4C7B,IAAIszC,GAAgB,QACOx2I,KAAKo2I,YAAYtgF,UAAU72D,IAAI65D,EAASpoD,WAE5C1Q,KAAKo2I,YAAYtgF,UAAU12D,IAAI05D,EAASpoD,KAC9BonD,KAAK74D,IAAI,MAElCu3I,GAAgB,QACVx2I,KAAKo2I,YAAYtgF,UAAUzyC,MAAMy1C,EAASpoD,GAAI,CAChDonD,KAAMy+E,MAKdC,GAAgB,QACVx2I,KAAKo2I,YAAYtgF,UAAUlpD,KAAKksD,EAASpoD,GAAI,CAC/ConD,KAAMy+E,KACFr7F,GAAa,CACbgN,SAAU,CACNhN,UAAW4B,GAAiB5B,QAKxCs7F,GACAx2I,KAAKssD,cAAc,IAAIE,YAAY,OAAQ,CAAE7E,OAAQmR,IAE7D,CACJ,CAIA,IAAAxyC,GACItmB,KAAKgpH,UAAW,CACpB,CACA,IAAK,MACD,OAAO,CACX,CACA,IAAKvlF,OAAOqB,eACR,OAAO2V,EACX,EAEG,SAASg8F,GAAiBJ,EAAStB,EAA4B9R,IAClE,OAAQ76E,GAAe,IAAI8tF,GAAiB9tF,EAAY,CAAEiuF,UAAStB,6BACvE,CCjGO,SAAS,GAAqB3uF,GACjC,OAAOA,EACFv5C,QAAQ1F,GAAmB,SAAbA,EAAEipB,SAChBhiB,MAAK,CAACi7B,EAAMj0B,IAAUA,EAAMixC,SAAS71B,KAAO6Y,EAAKgd,SAAS71B,OAC1D81B,GAAG,EACZ,CCHA,MAAM,GAAkB,WACjB,MAAM,GACTG,WACAC,eACAtC,iBACAh5C,IACAu7C,gBAAkB,IAAIxL,IACtByL,WAAa,IAAI/Y,IACjB,WAAAv+B,CAAYm3C,EAAYC,EAAgBtC,GACpCpkD,KAAKymD,WAAaA,EAClBzmD,KAAK0mD,eAAiBA,EACtB1mD,KAAKokD,iBAAmBA,EACxBpkD,KAAKoL,IAAM,IAAI8xC,GAAO,kBAAkBuJ,KACxCzmD,KAAKokD,iBAAiB,cAAepkD,KAAK6mD,2BAC9C,CACA,eAAMC,CAAUC,GACZ,MAAMC,EAAYD,EAAO1gD,WACnB4gD,EAAkBjnD,KAAK4mD,WAAWxnD,IAAI4nD,GACxCC,IACAjnD,KAAK4mD,WAAWM,OAAOF,SACjBC,GAEV,IAAIhB,EAASjmD,KAAKmnD,sBAAsBJ,GACxC,OAAId,GACAjmD,KAAKoL,IAAImpC,KAAK,gCAAgCyS,gBAAwBhnD,KAAKymD,cAC3EzmD,KAAKonD,WAAWJ,EAAWf,GACpBA,IAEXA,QAAejmD,KAAKqnD,aAAaN,GACjC/mD,KAAKonD,WAAWJ,EAAWf,GACpBA,EACX,CACA,kBAAMoB,CAAaN,EAAQlqB,EAAU,GACjC,MACMyqB,EAAa,GADCtnD,KAAK0mD,eAAeK,IAExC,IAAKO,EACD,MAAM,IAAI9oD,MAAM,iDAAiDuoD,EAAO1gD,yBAAyBrG,KAAKymD,cAE1G,IAAIc,EACAtB,EACJ,IAAK,IAAI1kD,EAAI,EAAGA,EAAIs7B,EAAU,EAAGt7B,IAC7B,IACIvB,KAAKoL,IAAImpC,KAAK,4CAA4CwS,EAAO1gD,yBAAyBrG,KAAKymD,cAC/FR,QAAeqB,EAAWE,UAAUxnD,KAAKymD,YACzCzmD,KAAKoL,IAAImpC,KAAK,6BAA6BwS,EAAO1gD,yBAAyBrG,KAAKymD,cAChF,KACJ,CACA,MAAOj/B,GACH+/B,EAAY//B,CAChB,CAEJ,IAAKy+B,EACD,MAAM,IAAIznD,MAAM,qCAAqCuoD,EAAO1gD,iBAAmBkhD,GAEnF,OAAOtB,CACX,CACA,0BAAMwB,CAAqBC,GACvB,MAAMX,EAASW,EAAKh3C,GAAGrK,WACvB,GAAIrG,KAAK2mD,gBAAgB1nD,IAAI8nD,GACzB/mD,KAAKoL,IAAImpC,KAAK,wDAAwDwS,gBAAqB/mD,KAAKymD,mBAGpG,IACIzmD,KAAK2mD,gBAAgB3pC,IAAI+pC,SACnB/mD,KAAKqnD,aAAaK,EAAKh3C,GACjC,CACA,MAAO8W,GACHxnB,KAAKoL,IAAIoc,MAAM,kCAAmCA,EACtD,CACA,QACIxnB,KAAK2mD,gBAAgBO,OAAOH,EAChC,CAEJ,CACAF,2BAA8BvmD,IAC1B,MAAM,KAAEonD,GAASpnD,EAAIqnD,OAChBD,EAAKE,UAAU58B,SAAShrB,KAAKymD,cAGnBzmD,KAAKmnD,sBAAsBO,EAAKh3C,KAI/C1Q,KAAK6nD,kBAAkBH,GAAK,EAEhC,iBAAAG,CAAkBH,GACd1nD,KAAKoL,IAAImpC,KAAK,8CAA8CmT,EAAKh3C,GAAGrK,yBAAyBrG,KAAKymD,cAE9FzmD,KAAK4mD,WAAW3nD,IAAIyoD,EAAKh3C,GAAGrK,aAC5BrG,KAAK4mD,WAAWM,OAAOQ,EAAKh3C,GAAGrK,YAEnCrG,KAAK4mD,WAAWtnD,IAAIooD,EAAKh3C,GAAGrK,WAAYrG,KAAKynD,qBAAqBC,GACtE,CACA,qBAAAP,CAAsBJ,GAClB,MACMO,EAAa,GADCtnD,KAAK0mD,eAAeK,IAExC,IAAKO,EACD,OAEJ,MAAMrB,EAASqB,EAAWQ,QAAQxuB,MAAMv2B,GAAMA,EAAEglD,WAAa/nD,KAAKymD,aAClE,OAAKR,EAGoB,CAAC,OAAQ,SAAU,WAAWj7B,SAASi7B,EAAO+B,aAAe,KAC9DhoD,KAAKioD,eAAehC,QAA5C,EAGOA,OAPP,CAQJ,CACA,UAAAmB,CAAWL,EAAQd,GACfjmD,KAAKoL,IAAImpC,KAAK,6BAA6BwS,eAAoBd,EAAOv1C,MACtEu1C,EAAOiC,SAAS,KAAmB,CACvC,CACA,cAAAD,CAAehC,GACX,QAASA,EAAOiC,SAAS,GAC7B,EChHG,MAAM,GACTzB,WACA2B,WACA7M,aACA8M,uBACAC,0BACAC,cACA,WAAAj5C,CAAYm3C,EAAY2B,EAAY7M,GAChCv7C,KAAKymD,WAAaA,EAClBzmD,KAAKooD,WAAaA,EAClBpoD,KAAKu7C,aAAeA,EACpBv7C,KAAKqoD,uBAAyBD,EAAWtnD,OAAOsjD,iBAAiBhoB,KAAKgsB,EAAWtnD,QACjFd,KAAKsoD,0BAA4BF,EAAWtnD,OAAOwjD,oBAAoBloB,KAAKgsB,EAAWtnD,QACvFd,KAAKuoD,cAAgB,IAAI,GAAc9B,EAAY2B,EAAWI,kBAAkB9B,eAAetqB,KAAKgsB,EAAWI,mBAAoBxoD,KAAKqoD,uBAC5I,CACA,eAAMvB,CAAUC,GACZ,OAAO/mD,KAAKuoD,cAAczB,UAAUC,EACxC,EClBG,MAAMxR,GACToI,MACA,WAAAruC,CAAYquC,GACR39C,KAAK29C,MAAQA,CACjB,CACA,oBAAOgN,CAActuB,GACjB,MAAM,SAAE+Y,GAAa/Y,EACrB,OAAO,IAAIkZ,GAAgB,CACvBC,MAAO,CACHJ,SAAUA,GAEd/kB,cAAUnxB,GAElB,CAKA,MAAAgW,GACI,OAAO,GAAsBA,OAAOlV,KAAK29C,MAC7C,CAKA,aAAO3hC,CAAOlN,GACV,MAAM82B,EAAM,GAAsB5pB,OAAOlN,GACzC,OAAO,IAAIymC,GAAgB3P,EAC/B,CACA,SAAI4P,GACA,OAAOx1C,KAAK29C,MAAMnI,KACtB,CACA,YAAInlB,GACA,OAAOrwB,KAAK29C,MAAMttB,QACtB,EC5BG,MAAMqmH,GAAoB,uCAC3B,GAAM,IAAIx5F,GAAO,iBAIhB,MAAMy5F,WAAyB,GAIlC,WAAArnI,CAAY84C,EAAY7M,GACpBnL,MAAMsmG,GAAmBtuF,EAAY7M,EACzC,CAIA,WAAM/F,CAAMnZ,GACR,MAAM,SAAE+Y,EAAQ,OAAE2R,GAAW1qB,EACvBu6G,EAAWrhG,GAAgBoV,cAAc,CAC3CvV,SAAUnP,OAAOmP,KAGrB,UADmBp1C,KAAKooD,WAAW0N,UAAU12D,IAAI2nD,GAE7C,MAAO,CACH1R,UAAW,KACX7tB,MAAO7C,GAAc62C,mBAG7B,IAAIvV,EACJ,IACIA,QAAejmD,KAAK8mD,UAAUC,EAClC,CACA,MAAOtgC,GAEH,OADA,GAAIe,MAAM,uBAAwBf,GAC3B,CACH4uB,UAAW,KACX7tB,MAAO7C,GAAcylC,oBAE7B,CACA,MAAMxkB,QAAY4f,GAAK,CAACoxF,EAAS1hI,UAAW,GAAW+wC,EAAQ,IAAW9Y,MAAOhnC,SAAiB,GAAIA,KACtG,IACI,MAAM2I,EAAQ,IAAI+vC,GAClBjZ,EAAIz4B,SAASkQ,IACTvO,EAAMkwC,OAAO3hC,EAAM,IAEvB,MAAM,SAAEgT,GAAaklB,GAAgBv5B,OAAOlN,GAC5C,OAAKuhB,EAaE,CACHglB,gBAPoB9Y,QAAQ6oB,IAAI/0B,EAASglB,UACxC/wC,KAAKw0D,GAAaA,EAAS3jB,MAC3BtoC,OAAOklC,IACPztC,KAAI6oC,MAAOgI,IACL,CAAE0hG,UAAW1G,GAAWG,QAAQn7F,QAIvC3tB,MAAO,OAdP,GAAIA,MAAM,+DACH,CACH6tB,UAAW,KACX7tB,MAAO7C,GAAcomC,eAajC,CACA,MAAOtkC,GAEH,OADA,GAAIe,MAAM,8BAA+Bf,GAClC,CACH4uB,UAAW,KACX7tB,MAAO7C,GAAc2mC,cAE7B,CACJ,EC3EJ,MAAM,GAAM,IAAIpO,GAAO,2BAEjB45F,GAA0C,IAC1CC,GAAsB,EACfC,GAAiC18F,GAAK2d,cAG5C,MAAMg/E,WAA8B7qF,GACvChE,WACA8uF,aACAj9H,QACAsiD,UACA46E,cAAgB,IAAIh8F,IACpBi8F,cAAgB,IAAIvpG,IACpBwpG,qBAAwBl3I,IACpB,MAAM,UAAEynD,EAAS,OAAEb,GAAW5mD,EAAMwnD,OAC/BC,EAAU58B,SAAS0rH,MACpB12I,KAAKm3I,cAAcl4I,IAAI8nD,EAAO1gD,cAElCrG,KAAKm3I,cAAcn6H,IAAI+pC,EAAO1gD,YAC9BrG,KAAKs3I,sBAAsBvwF,GAAQzjB,OAAO9b,GAAU,GAAIA,MAAM,uBAAuBA,OAAS,EAElG,WAAAlY,CAAY84C,EAAY7M,EAActhC,EAAU,CAAC,GAC7Cm2B,QACApwC,KAAKooD,WAAaA,EAClBpoD,KAAKk3I,aAAe,IAAIP,GAAiBvuF,EAAY7M,GACrDv7C,KAAKia,QAAUA,EACfja,KAAKu8D,WAAY,CACrB,CAIA,KAAAv1D,GACQhH,KAAKu8D,YAGTv8D,KAAKssD,cAAc,IAAIE,YAAY,6BAA8B,CAAE7E,QAAQ,KAC3E,GAAIpT,KAAK,4DAETv0C,KAAKooD,WAAWtnD,OAAOsjD,iBAAiB,gBAAiBpkD,KAAKq3I,sBAClE,CAIA,IAAA/wH,GACStmB,KAAKu8D,YAEV,GAAIhoB,KAAK,yCACTv0C,KAAKu8D,WAAY,EACjBv8D,KAAKm3I,cAAc53I,QACnBS,KAAKooD,WAAWtnD,OAAOwjD,oBAAoB,gBAAiBtkD,KAAKq3I,sBACrE,CACA,IAAK,MACD,OAAO,CACX,CACA,IAAK5zG,OAAOqB,eACR,MAAO,qBACX,CACAwyG,sBAAwBnqG,MAAO4Z,IAC3B,MAAMC,EAAYD,EAAO1gD,YACnB,cAAEkxI,EAAgBT,GAAuC,WAAEU,EAAaT,IAAwB/2I,KAAKia,QAC3G,GAAIs6B,KAAK,kBAAkByS,cAAsBhnD,KAAKo3I,cAAch4I,IAAI4nD,IAAc,YAChFhnD,KAAKw1C,MAAMuR,GACjB,MAAM0wF,EAAiBz3I,KAAKo3I,cAAch4I,IAAI4nD,IAAc,EACxDywF,EAAiBD,EACjBx3I,KAAK03I,oBAAoB1wF,GAG7BngC,YAAW,KACP7mB,KAAKo3I,cAAc93I,IAAI0nD,EAAWywF,EAAiB,GACnDz3I,KAAKs3I,sBAAsBvwF,GAAQzjB,OAAO9b,IACtC,GAAIA,MAAM,mCAAmCA,IAAQ,GACvD,GACH+vH,EAAgBE,EAAe,EAEtC,WAAMjiG,CAAMuR,GACR,MAAM,MAAEv/B,EAAK,UAAE6tB,SAAoBr1C,KAAKk3I,aAAa1hG,MAAM,CACvDJ,SA5EgC,GA6EhC2R,WAEJ,GAAIv/B,EAEA,OADA,GAAIA,MAAM,6BAA8BA,GACjC,CAAEA,QAAO6tB,UAAW,MAE/B,IAAK,MAAMsiG,KAAatiG,EAAW,CAC/B,MAAM,IAAEwhG,GAAQc,EAChB,IAAKd,EAAK,CACN,GAAI3pI,KAAK,uCACT,QACJ,CACA,MAAM,OAAE65C,EAAM,SAAE+R,EAAQ,UAAE5d,GAAc27F,EACxC,GAAK9vF,GAAW+R,EAAhB,CAIA,SADsB94D,KAAKooD,WAAW0N,UAAU72D,IAAI8nD,GACvC,CACT,MAAM,iBAAE6wF,EAAgB,aAAEC,SAAuB73I,KAAK83I,kBAAkBh/E,EAAU5d,GAClF,GAAI08F,GAAoBC,EAAc,CAClC,GAAItjG,KAAK,QAAQwS,EAAO1gD,4DACpBuxI,IACA,GAAIrjG,KAAK,QAAQwS,EAAO1gD,qDAClBrG,KAAKooD,WAAW0N,UAAU2zC,MAAM1iD,EAAQ,CAC1C+7C,WAAYhqC,EAASgqC,cAGzB+0C,GAAgB38F,IAChB,GAAI3G,KAAK,QAAQwS,EAAO1gD,oDAClBrG,KAAKooD,WAAW0N,UAAUzyC,MAAM0jC,EAAQ,CAC1CmB,SAAU,CACNhN,UAAW4B,GAAiB5B,MAGpCl7C,KAAKssD,cAAc,IAAIE,YAAY,OAAQ,CACvC7E,OAAQ,CACJj3C,GAAIq2C,EACJ+7C,WAAYhqC,EAASgqC,gBAIjC,QACJ,CACJ,OAEM9iG,KAAKooD,WAAW0N,UAAUlpD,KAAKm6C,EAAQ,CACzC+Q,KAAM,CACF,CAACk/E,IAAiC,CAC9Bh4I,MAAOgB,KAAKia,QAAQ+oF,UAzHJ,GA0HhBC,IAAKjjG,KAAKia,QAAQipF,QAzHJ,SA4HlBhoD,GAAa,CACbgN,SAAU,CACNhN,UAAW4B,GAAiB5B,QAGhC4d,EAASgqC,YAAc,CACvBA,WAAYhqC,EAASgqC,cAG7B,GAAIvuD,KAAK,oBAAoBwS,EAAO1gD,cACpCrG,KAAKssD,cAAc,IAAIE,YAAY,OAAQ,CACvC7E,OAAQ,CACJj3C,GAAIq2C,EACJ+7C,WAAYhqC,EAASgqC,cAlD7B,CAqDJ,CACA,MAAO,CAAEt7E,MAAO,KAAM6tB,YAC1B,CACA,mBAAAqiG,CAAoB1wF,GAChB,GAAIzS,KAAK,8BAA8ByS,KACvChnD,KAAKm3I,cAAcjwF,OAAOF,GAC1BhnD,KAAKo3I,cAAclwF,OAAOF,EAC9B,CACA,uBAAM8wF,CAAkBh/E,EAAU5d,GAC9B,MAAQxqC,GAAIq2C,GAAW+R,EACjBpR,QAAa1nD,KAAKooD,WAAW0N,UAAU12D,IAAI2nD,GAC3CgxF,EAAqBrwF,EAAK+7C,UAAUn/F,KAAKqc,GAAMA,EAAE6iF,UAAUn9F,aAC3D2xI,EAAgBl/E,EAASgqC,WAAWx+F,KAAKy1D,GAAOA,EAAG1zD,aACnDuxI,EAAmBG,EAAmBn9E,MAAMb,IAAQi+E,EAAchtH,SAAS+uC,KACjF,IAAI89E,GAAe,EACnB,MAAMI,EAAyBvwF,EAAKQ,SAAS9oD,IAAI,aACjD,GAAI64I,EAAwB,CACxB,MAAMC,EAAoB17F,GAAiBy7F,IACvCC,GAAqBh9F,KACrB28F,EACIK,EAAkBziG,YAAcyF,GAAWzF,WACvCyiG,EAAkBxiG,OAAOklB,MAAMpf,IAAWN,GAAWxF,OAAO1qB,SAASwwB,KAErF,CACA,MAAO,CAAEo8F,mBAAkBC,eAC/B,EAEG,SAASM,GAA0B58F,GACtC,OAAQ6M,GAAe,IAAI6uF,GAAsB7uF,EAAY7M,EACjE,CC/KA,MAAM,GAAM,IAAI2B,GAAO,2BACVk7F,GAAyB99F,GAAK4d,MAGpC,MAAMmgF,WAAgCjsF,GACzChE,WACAnuC,QACAsiD,UACA0E,MAAQ,GACR,WAAA3xD,CAAY84C,EAAYnuC,GACpBm2B,QACApwC,KAAKooD,WAAaA,EAClBpoD,KAAKia,QAAUA,EACfja,KAAKu8D,WAAY,EACjBv8D,KAAKihE,MAAQjhE,KAAKs4I,0BACtB,CACA,IAAK70G,OAAOqB,eACR,MAAO,kCACX,CACA,WAAM99B,GACF,IAAIhH,KAAKu8D,UAAT,CAEA,GAAIhoB,KAAK,oCACTv0C,KAAKooD,WAAWtnD,OAAOsjD,iBAAiB,gBAAiBpkD,KAAKu4I,gBAC9D,IAAK,MAAQ7nI,GAAIovH,EAAK,QAAExwE,KAAatvD,KAAKihE,MAAO,CAC7C,MAAMla,EAASuoC,GAAiBwwC,SACtB9/H,KAAKooD,WAAW0N,UAAU72D,IAAI8nD,WAElC/mD,KAAKooD,WAAW0N,UAAUlpD,KAAKm6C,EAAQ,CACzC+7C,WAAY,CAAC,GAAUxzC,IACvBwI,KAAM,CACF,CAAC93D,KAAKia,SAAS4gD,SAAWu9E,IAAyB,CAC/Cp5I,MAAOgB,KAAKia,SAAS+oF,UA9Bb,GA+BRC,IAAKjjG,KAAKia,SAASipF,QA9Bb,QAkClBljG,KAAKssD,cAAc,IAAIE,YAAY,OAAQ,CACvC7E,OAAQ,CACJj3C,GAAIq2C,EACJ+7C,WAAY,CAAC,GAAUxzC,QAGnC,CACA,GAAI/a,KAAK,cAAcv0C,KAAKihE,MAAMx/D,gBAClCzB,KAAKu8D,WAAY,CAxBP,CAyBd,CACA,IAAAj2C,GACStmB,KAAKu8D,YAEV,GAAIhoB,KAAK,oCACTv0C,KAAKooD,WAAWtnD,OAAOwjD,oBAAoB,gBAAiBtkD,KAAKu4I,gBACjEv4I,KAAKu8D,WAAY,EACjBv8D,KAAKw4I,0BACT,CACAD,eAAkBp4I,IACd,MAAM,OAAE4mD,EAAM,YAAE4gD,GAAgBxnG,EAAMwnD,OAChC8wF,EC9CP,SAAsCh1C,GACzC,MAAMi1C,EAAcj1C,EAAUnqE,MAAMw1B,GAASA,EAAKzoD,WAAW2kB,SAAS,OAAS8jC,EAAKzoD,WAAW2kB,SAAS,SACxG,IAAK0tH,EACD,MAAM,IAAIl6I,MAAM,gDAEpB,OAAOk6I,CACX,CDwCmCC,CAA6BhxC,GAClDixC,EAAoB54I,KAAKs4I,2BACzBO,EAAoBD,EAAkBjgC,WAAWmgC,GAAUA,EAAMpoI,KAAOq2C,EAAO1gD,aACjFwyI,GAAqB,EACrBD,EAAkBC,GAAmBvpF,QACjCmpF,EAAmBpyI,WAGvBuyI,EAAkBp4I,KAAK,CACnBkQ,GAAIq2C,EAAO1gD,WACXipD,QAASmpF,EAAmBpyI,aAGpCrG,KAAKihE,MAAQ23E,EACb54I,KAAKw4I,yBAAyB,EAElC,wBAAAF,GACI,IACI,MAAMS,EAAkB19G,aAAaZ,QAAQ,cAC7C,OAAKs+G,EAES1zH,KAAKC,MAAMyzH,GACZlsI,OAAOmsI,IAFT,EAGf,CACA,MAAOxxH,GAEH,OADA,GAAIA,MAAM,0CAA2CA,GAC9C,EACX,CACJ,CACA,uBAAAgxH,GACI,IACIn9G,aAAaf,QAAQ,aAAcjV,KAAKE,UAAUvlB,KAAKihE,OAC3D,CACA,MAAOz5C,GACH,GAAIA,MAAM,uCAAwCA,EACtD,CACJ,EAEJ,SAASwxH,GAAkBtxF,GACvB,OAAQA,GACY,iBAATA,GACY,iBAAZA,EAAKh3C,IACY,iBAAjBg3C,EAAK4H,OACpB,CE5FA,MAAM,GAAM,IAAIpS,GAAO,cAGhB/P,eAAe8rG,GAAc19F,EAActhC,EAAS4gB,GAClD5gB,GAASi/H,mBAAsBlW,OAEhC/1H,QAAQsnC,KAAK,yCAA0C,sDACvDtnC,QAAQsnC,KAAK,uEAAwE,uDAGzF,MAAM0wB,EAAkB1pB,EAClB,CAAE2M,SAAU4T,GAAavgB,IACzB,CAAC,EAIP,OCgBGpO,eAA4BlzB,EAAU,CAAC,GAC1CA,EAAQmwD,mBAAqBojB,GAAgB,WAC7C,MAAMl8E,EAAO,IAAIuwH,GAAY,UAChBtkB,GAAetjG,GACxB8sC,Q9OkB6BqjB,E8OlBAnwD,EAAQmwD,W9OmBlCqlB,GAAoBrlB,EAAWf,cADnC,IAA8Be,E8ObjC,OAHsB,IAAlBnwD,EAAQjT,aACFsK,EAAKtK,QAERsK,CACX,CD1BW6nI,CAAa,CAChBnd,WAAY,CAACzkB,GAAW,CAAE1qG,QAJe,IAA9BoN,GAASm/H,kBAA8BpW,KAChD,GACA5uB,MAGF8qB,aAAc,CAAC5sB,MACf2sB,qBAAsB,CAACv+B,SACpBzmF,EACH47C,SAAU,CACNgzC,SAAUA,GAAS,CACfnB,aAAc7sE,GAtBL,YAwBb2vB,KAAMA,GAAK,CACPV,kBAAmB7vC,GAASo/H,uBAxBP,QA0BtBp0E,KACAhrD,GAAS47C,WAGxB,CEtCO1oB,eAAemsG,GAAgBr/H,EAAU,CAAC,GAC7C,MAAM,OAAE0vC,EAAM,aAAEpO,SFsCbpO,eAA4ClzB,GAC/C,MAAM,cAAEuqD,GAAkBvqD,EACpBshC,EpV3CH,SAA6CipB,GAChD,GuVLQ,cADqBjsC,EvVMRisC,IuVLY,WAAYjsC,KAAY,kBAAmBA,GvVKvC,CACjC,GAAoC,IAAhCisC,EAAc9uB,OAAOj0C,OACrB,MAAM,IAAIjD,MAAM,mEAEpB,OAAOy8C,GAAwBupB,EACnC,CACK,GuVTF,SAAwBjsC,GAC3B,MAAO,kBAAmBA,CAC9B,CvVOaghH,CAAe/0E,GAAgB,CACpC,GAA2C,IAAvCA,EAAcxwB,cAAcvyC,OAC5B,MAAM,IAAIjD,MAAM,mFAEpB,OAAOgmE,EAAcxwB,cAAc1vC,KAAK6tC,GAAiBiJ,GAA0BjJ,EAAcqyB,EAAc/uB,YACnH,CAEI,MAAM,IAAIj3C,MAAM,kEuVnBjB,IAA0B+5B,CvVqBjC,CoV2ByBihH,CAAoCh1E,GAAiB9pB,IAC1E,GAAInG,KAAK,wCAAyCgH,GAClD,MAAMk+F,EAAgBx/H,GAAS0vC,QAAU,CAAC,EACpC64E,EAAgBiX,EAAcjX,eAAiB,G7MyFlD,IAAmB32H,E6MhFtB,OARIoO,GAASy/H,kBACTlX,EAAchiI,QIpDf,SAAgC+6C,GAOnC,MALoB,CAChBk7F,GAFgB,CvCGX,iGiCsGF,CAACruF,EAAYnuC,IAAY,IAAIo+H,GAAwBjwF,EAAYnuC,GMrGpEk+H,GAA0B58F,GAGlC,CJ4C8Bo+F,CAAuBp+F,IAE7CthC,GAAS2/H,gBACTpX,EAAchiI,M7MoFIqL,E6MpFW,CAAE6zC,KAAMzlC,EAAQ2/H,gB7MqFzCxxF,GAAe,IAAIs6C,GAAUt6C,EAAYv8C,K6MnFjD4tI,EAAcjX,cAAgBA,EAEvB,CAAE74E,aADYsvF,GAAc19F,EAAck+F,EAAex/H,GAAS4gB,WACxD0gB,eACrB,CErD2Cs+F,CAA6B5/H,GAC9D3I,EAAO,IAAI+zD,GAAS9pB,EAActhC,EAAS0vC,EAAQ,CACrDob,OAAO,EACPW,WAAW,EACX74D,QAAQ,IAMZ,OAH2B,IAAvBoN,GAASi/F,iBACH5nG,EAAKtK,QAERsK,CACX,kCGiBWwoI,GAAuB,WAC9B,OAAO7wI,KAAK6a,MAAsB,IAAhB7a,KAAKm0B,SAC3B,EACW,GAAS,SAAUwrC,GAAU,OAvCcmxE,OAuCG,EAvCMC,OAuCE,EAvCaC,EAuCG,WAC7E,IAAItpH,EAASgZ,EAAMj3B,EACnB,OAhC4C,SAAUqnI,EAASp8G,GAC/D,IAAsG1oB,EAAGu0D,EAAGrsD,EAAxGwb,EAAI,CAAE69E,MAAO,EAAG0jC,KAAM,WAAa,GAAW,EAAP/8H,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGg9H,KAAM,GAAIxgB,IAAK,IAAerlD,EAAI31E,OAAOC,QAA4B,mBAAbw7I,SAA0BA,SAAWz7I,QAAQa,WACtL,OAAO80E,EAAEjsE,KAAOgyI,EAAK,GAAI/lE,EAAS,MAAI+lE,EAAK,GAAI/lE,EAAU,OAAI+lE,EAAK,GAAsB,mBAAX52G,SAA0B6wC,EAAE7wC,OAAOsb,UAAY,WAAa,OAAO/+C,IAAM,GAAIs0E,EAC1J,SAAS+lE,EAAK7mI,GAAK,OAAO,SAAUnU,GAAK,OACzC,SAAck+B,GACV,GAAItoB,EAAG,MAAM,IAAI7U,UAAU,mCAC3B,KAAOk0E,IAAMA,EAAI,EAAG/2C,EAAG,KAAO5E,EAAI,IAAKA,OACnC,GAAI1jB,EAAI,EAAGu0D,IAAMrsD,EAAY,EAARogB,EAAG,GAASisC,EAAU,OAAIjsC,EAAG,GAAKisC,EAAS,SAAOrsD,EAAIqsD,EAAU,SAAMrsD,EAAElc,KAAKuoE,GAAI,GAAKA,EAAEnhE,SAAW8U,EAAIA,EAAElc,KAAKuoE,EAAGjsC,EAAG,KAAKyF,KAAM,OAAO7lB,EAE3J,OADIqsD,EAAI,EAAGrsD,IAAGogB,EAAK,CAAS,EAARA,EAAG,GAAQpgB,EAAEne,QACzBu+B,EAAG,IACP,KAAK,EAAG,KAAK,EAAGpgB,EAAIogB,EAAI,MACxB,KAAK,EAAc,OAAX5E,EAAE69E,QAAgB,CAAEx3G,MAAOu+B,EAAG,GAAIyF,MAAM,GAChD,KAAK,EAAGrK,EAAE69E,QAAShtC,EAAIjsC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK5E,EAAEghG,IAAIn8F,MAAO7E,EAAEwhH,KAAK38G,MAAO,SACxC,QACI,MAAkBrgB,GAAZA,EAAIwb,EAAEwhH,MAAY14I,OAAS,GAAK0b,EAAEA,EAAE1b,OAAS,KAAkB,IAAV87B,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE5E,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV4E,EAAG,MAAcpgB,GAAMogB,EAAG,GAAKpgB,EAAE,IAAMogB,EAAG,GAAKpgB,EAAE,IAAM,CAAEwb,EAAE69E,MAAQj5E,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY5E,EAAE69E,MAAQr5F,EAAE,GAAI,CAAEwb,EAAE69E,MAAQr5F,EAAE,GAAIA,EAAIogB,EAAI,KAAO,CACpE,GAAIpgB,GAAKwb,EAAE69E,MAAQr5F,EAAE,GAAI,CAAEwb,EAAE69E,MAAQr5F,EAAE,GAAIwb,EAAEghG,IAAIn5H,KAAK+8B,GAAK,KAAO,CAC9DpgB,EAAE,IAAIwb,EAAEghG,IAAIn8F,MAChB7E,EAAEwhH,KAAK38G,MAAO,SAEtBD,EAAKI,EAAK18B,KAAK84I,EAASphH,EAC5B,CAAE,MAAO1U,GAAKsZ,EAAK,CAAC,EAAGtZ,GAAIulD,EAAI,CAAG,CAAE,QAAUv0D,EAAIkI,EAAI,CAAG,CACzD,GAAY,EAARogB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEv+B,MAAOu+B,EAAG,GAAKA,EAAG,QAAK,EAAQyF,MAAM,EAC9E,CAtBgDu1E,CAAK,CAAC/kG,EAAGnU,GAAK,CAAG,CAuBrE,CAMWi7I,CAAYt6I,MAAM,SAAUu6I,GAC/B,OAAQA,EAAG/jC,OACP,KAAK,EAGD,OAFA7lF,EAAU,IAAIob,YACdpC,EAAOhZ,EAAQzb,OAAO0zD,EAAOviE,YACtB,CAAC,EAAa+mC,OAAOC,OAAOx3B,OAAO,UAAW8zB,IACzD,KAAK,EAED,OADAj3B,EAAS6nI,EAAGL,OACL,CAAC,EAAcv4I,MAAM4c,KAAK,IAAItO,WAAWyC,IACvCpO,KAAI,SAAUsc,GAAK,OAAOA,EAAEva,SAAS,IAAI4pD,SAAS,EAAG,IAAM,IAC3DpoD,KAAK,KAE1B,GACJ,EApDW,KAFgEisE,OAuCF,KArCnDA,EAAIv3C,WAAU,SAAUr4B,EAASs4B,GAC/C,SAASg+G,EAAUx7I,GAAS,IAAMu5G,EAAK0hC,EAAU5xI,KAAKrJ,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC1F,SAASw2H,EAASz7I,GAAS,IAAMu5G,EAAK0hC,EAAiB,MAAEj7I,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC7F,SAASs0F,EAAKzjG,GAJlB,IAAe9V,EAIa8V,EAAOkuB,KAAO9+B,EAAQ4Q,EAAO9V,QAJ1CA,EAIyD8V,EAAO9V,MAJhDA,aAAiB80E,EAAI90E,EAAQ,IAAI80E,GAAE,SAAU5vE,GAAWA,EAAQlF,EAAQ,KAIjBukC,KAAKi3G,EAAWC,EAAW,CAC7GliC,GAAM0hC,EAAYA,EAAU13I,MAAMw3I,EAASC,GAAc,KAAK3xI,OAClE,IAPwC,IAAU0xI,EAASC,EAAYlmE,EAAGmmE,CAsD1E,ECtDA,GAAwC,SAAUF,EAASC,EAAYlmE,EAAGmmE,GAE1E,OAAO,IAAKnmE,IAAMA,EAAIv3C,WAAU,SAAUr4B,EAASs4B,GAC/C,SAASg+G,EAAUx7I,GAAS,IAAMu5G,EAAK0hC,EAAU5xI,KAAKrJ,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC1F,SAASw2H,EAASz7I,GAAS,IAAMu5G,EAAK0hC,EAAiB,MAAEj7I,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC7F,SAASs0F,EAAKzjG,GAJlB,IAAe9V,EAIa8V,EAAOkuB,KAAO9+B,EAAQ4Q,EAAO9V,QAJ1CA,EAIyD8V,EAAO9V,MAJhDA,aAAiB80E,EAAI90E,EAAQ,IAAI80E,GAAE,SAAU5vE,GAAWA,EAAQlF,EAAQ,KAIjBukC,KAAKi3G,EAAWC,EAAW,CAC7GliC,GAAM0hC,EAAYA,EAAU13I,MAAMw3I,EAASC,GAAc,KAAK3xI,OAClE,GACJ,EACI,GAA4C,SAAU0xI,EAASp8G,GAC/D,IAAsG1oB,EAAGu0D,EAAGrsD,EAAxGwb,EAAI,CAAE69E,MAAO,EAAG0jC,KAAM,WAAa,GAAW,EAAP/8H,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGg9H,KAAM,GAAIxgB,IAAK,IAAerlD,EAAI31E,OAAOC,QAA4B,mBAAbw7I,SAA0BA,SAAWz7I,QAAQa,WACtL,OAAO80E,EAAEjsE,KAAOgyI,EAAK,GAAI/lE,EAAS,MAAI+lE,EAAK,GAAI/lE,EAAU,OAAI+lE,EAAK,GAAsB,mBAAX52G,SAA0B6wC,EAAE7wC,OAAOsb,UAAY,WAAa,OAAO/+C,IAAM,GAAIs0E,EAC1J,SAAS+lE,EAAK7mI,GAAK,OAAO,SAAUnU,GAAK,OACzC,SAAck+B,GACV,GAAItoB,EAAG,MAAM,IAAI7U,UAAU,mCAC3B,KAAOk0E,IAAMA,EAAI,EAAG/2C,EAAG,KAAO5E,EAAI,IAAKA,OACnC,GAAI1jB,EAAI,EAAGu0D,IAAMrsD,EAAY,EAARogB,EAAG,GAASisC,EAAU,OAAIjsC,EAAG,GAAKisC,EAAS,SAAOrsD,EAAIqsD,EAAU,SAAMrsD,EAAElc,KAAKuoE,GAAI,GAAKA,EAAEnhE,SAAW8U,EAAIA,EAAElc,KAAKuoE,EAAGjsC,EAAG,KAAKyF,KAAM,OAAO7lB,EAE3J,OADIqsD,EAAI,EAAGrsD,IAAGogB,EAAK,CAAS,EAARA,EAAG,GAAQpgB,EAAEne,QACzBu+B,EAAG,IACP,KAAK,EAAG,KAAK,EAAGpgB,EAAIogB,EAAI,MACxB,KAAK,EAAc,OAAX5E,EAAE69E,QAAgB,CAAEx3G,MAAOu+B,EAAG,GAAIyF,MAAM,GAChD,KAAK,EAAGrK,EAAE69E,QAAShtC,EAAIjsC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK5E,EAAEghG,IAAIn8F,MAAO7E,EAAEwhH,KAAK38G,MAAO,SACxC,QACI,MAAkBrgB,GAAZA,EAAIwb,EAAEwhH,MAAY14I,OAAS,GAAK0b,EAAEA,EAAE1b,OAAS,KAAkB,IAAV87B,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE5E,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV4E,EAAG,MAAcpgB,GAAMogB,EAAG,GAAKpgB,EAAE,IAAMogB,EAAG,GAAKpgB,EAAE,IAAM,CAAEwb,EAAE69E,MAAQj5E,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY5E,EAAE69E,MAAQr5F,EAAE,GAAI,CAAEwb,EAAE69E,MAAQr5F,EAAE,GAAIA,EAAIogB,EAAI,KAAO,CACpE,GAAIpgB,GAAKwb,EAAE69E,MAAQr5F,EAAE,GAAI,CAAEwb,EAAE69E,MAAQr5F,EAAE,GAAIwb,EAAEghG,IAAIn5H,KAAK+8B,GAAK,KAAO,CAC9DpgB,EAAE,IAAIwb,EAAEghG,IAAIn8F,MAChB7E,EAAEwhH,KAAK38G,MAAO,SAEtBD,EAAKI,EAAK18B,KAAK84I,EAASphH,EAC5B,CAAE,MAAO1U,GAAKsZ,EAAK,CAAC,EAAGtZ,GAAIulD,EAAI,CAAG,CAAE,QAAUv0D,EAAIkI,EAAI,CAAG,CACzD,GAAY,EAARogB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEv+B,MAAOu+B,EAAG,GAAKA,EAAG,QAAK,EAAQyF,MAAM,EAC9E,CAtBgDu1E,CAAK,CAAC/kG,EAAGnU,GAAK,CAAG,CAuBrE,EAeIq7I,GAAwB,yCACxBC,GAAwB,IAAI,GAAA7gI,KAAK,oBAChCkD,IAAI,IAAI,GAAArD,MAAM,OAAQ,EAAG,WACzBqD,IAAI,IAAI,GAAArD,MAAM,QAAS,EAAG,WAC1BqD,IAAI,IAAI,GAAArD,MAAM,QAAS,EAAG,WAC1BqD,IAAI,IAAI,GAAArD,MAAM,SAAU,EAAG,WAC5BihI,GAAyB,IAAIpuF,YAAY,qBACzCquF,GAAuB,IAAIruF,YAAY,mBAC3C,SAASsuF,KACL,OAAO,GAAU96I,UAAM,OAAQ,GAAQ,WACnC,IAAIoqF,EAAkB94E,EACtB,OAAO,GAAYtR,MAAM,SAAUu6I,GAC/B,OAAQA,EAAG/jC,OACP,KAAK,EAED,OADApsB,EAAO/uD,aAAaZ,QAAQ,SACT,CAAC,EAAa,GAC1B,CAAC,EAAa,GAAOq/G,OAChC,KAAK,EACD1vD,EAAQmwD,EAAGL,OAAQh5I,MAAM,EAAG,IAC5Bm6B,aAAaf,QAAQ,OAAQ8vD,GAC7BmwD,EAAG/jC,MAAQ,EACf,KAAK,EAAG,MAAO,CAAC,EAAahoB,GAAwB,UAAW,GAAWpE,KAC3E,KAAK,EAED,MAAO,CAAC,EAAakvD,GAAgB,CAC7BI,kBAAkB,EAClBv3E,cAAe,EACfqC,cAAe,CACX/uB,UAAW,GACXC,OAAQ,CAAC,IAEbiU,OAAQ,CACJygB,WATCmwE,EAAGL,WAYpB,KAAK,EAGD,OAFA5oI,EAAOipI,EAAGL,OACVnpI,OAAO6zD,KAAOtzD,EACP,CAAC,EAAaA,EAAKkoD,KAAK,qGACnC,KAAK,EAED,OADA+gF,EAAGL,OACI,CAAC,EAAa5oI,EAAKkoD,KAAK,yGACnC,KAAK,EAED,OADA+gF,EAAGL,OACI,CAAC,EAAa5oI,EAAKkoD,KAAK,sGACnC,KAAK,EAED,OADA+gF,EAAGL,OACI,CAAC,EAAc5oI,GAElC,GACJ,GACJ,CACO,SAASypI,KACZ,OAAO,GAAU/6I,UAAM,OAAQ,GAAQ,WACnC,IAAIsR,EAAMy1C,EAAQp2B,EAASqqH,EAAwBC,EAC/CC,EAAQl7I,KACZ,OAAO,GAAYA,MAAM,SAAUu6I,GAC/B,OAAQA,EAAG/jC,OACP,KAAK,EAAG,MAAO,CAAC,EAAaskC,MAC7B,KAAK,EAGD,OAFAxpI,EAAOipI,EAAGL,OACVjtI,QAAQ7B,IAAI,0BAA2BkG,EAAKq4C,OAAO5C,OAAO1gD,YACnD,CAAC,EAAaiL,EAAKtK,SAC9B,KAAK,EAED,OADAuzI,EAAGL,OACI,CAAC,EAAa5oI,EAAKwzD,gBAC9B,KAAK,EAiGD,OAhGAy1E,EAAGL,OACHnzF,EAASz1C,EAAKq4C,OAAO5C,OAAO1gD,WAC5BsqB,EAAUrf,EAAK4sC,cAAc,CACzB/L,aAAcuoG,KAElBM,EAAyB,SAAUG,GAE/B,IADA,IAAIC,EAAS,GACJC,EAAK,EAAGA,EAAKh5I,UAAUZ,OAAQ45I,IACpCD,EAAOC,EAAK,GAAKh5I,UAAUg5I,GAE/B,OAAO,GAAUH,EA3FW,SAAUjiG,EAAI16B,EAAM+8H,GACpE,GAAIA,GAA6B,IAArBj5I,UAAUZ,OAAc,IAAK,IAA4B85I,EAAxBh6I,EAAI,EAAGC,EAAI+c,EAAK9c,OAAYF,EAAIC,EAAGD,KACxEg6I,GAAQh6I,KAAKgd,IACRg9H,IAAIA,EAAK55I,MAAMnC,UAAU0B,MAAMD,KAAKsd,EAAM,EAAGhd,IAClDg6I,EAAGh6I,GAAKgd,EAAKhd,IAGrB,OAAO03C,EAAG73C,OAAOm6I,GAAM55I,MAAMnC,UAAU0B,MAAMD,KAAKsd,GACtD,CAmFgDi9H,CAAc,CAACL,GAAgBC,GAAQ,QAAO,GAAQ,SAAUK,EAAaC,GACjG,IAAIC,EAAcC,EAAeC,EAAeC,EAC5CZ,EAAQl7I,KAEZ,YADe,IAAX07I,IAAqBA,EAAS,KAC3B,GAAY17I,MAAM,SAAUu6I,GAC/B,OAAQA,EAAG/jC,OACP,KAAK,EAAG,MAAO,CAAC,EAAa,GAAOsjC,OACpC,KAAK,EA+CD,OA9CA6B,EAAepB,EAAGL,OAClB0B,EAAgBH,EAChBI,EAAgB,EAChBC,EAAc,WAAc,OAAO,GAAUZ,OAAO,OAAQ,GAAQ,WAChE,IAAIzmG,EAAwBjoC,EAASsmC,EAASh+B,EAAQinI,EACtD,OAAO,GAAY/7I,MAAM,SAAUu6I,GAC/B,OAAQA,EAAG/jC,OACP,KAAK,EAED,OADA+jC,EAAGJ,KAAK35I,KAAK,CAAC,EAAG,EAAG,CAAE,IACf,CAAC,EAAa,GAAO,GAAGY,OAAOu6I,EAAc,KAAKv6I,OAAOy6I,EAAe,KAAKz6I,OAAOw6I,KAC/F,KAAK,EAUD,OATAnnG,EAAc8lG,EAAGL,OACLjxI,KAAK6a,OAAM,IAAItZ,MAAOmc,UAAY,KAC9Cna,EAAUmuI,GAAsB/7I,OAAO,CACnCwO,KAAMqnC,EACN6/F,MAAOsH,EACP/wI,MAAOgxI,EACPG,OAAQj1F,IAEZjU,EAAU6nG,GAAsBzlI,OAAO1I,GAAS2W,SACzC,CAAC,EAAa7R,EAAK+sD,UAAU5tC,KAAKE,EAAS,CAC1CmiB,QAASA,EACTC,UAAW,IAAIvoC,MAChB,CAAE03D,WAAW,KACxB,KAAK,EAYD,OAXAptD,EAASylI,EAAGL,OACZjtI,QAAQ7B,IAAI,gCAAiC0J,EAAO2pD,UAAUh9D,QAC9DwL,QAAQ7B,IAAI,+BAAgC0J,EAAOypD,SAAS98D,UAE5Do6I,EACoBD,EAChB/0H,WAAWi1H,EAAaJ,GAGxB5gH,SAASwxB,cAAcsuF,IAEpB,CAAC,EAAa,GACzB,KAAK,EAGD,OAFAmB,EAAUxB,EAAGL,OACbjtI,QAAQua,MAAM,+BAAgCu0H,GACvC,CAAC,EAAa,GACzB,KAAK,EAAG,MAAO,CAAC,GAExB,GACJ,GAAI,EACJD,IACO,CAAC,GAEpB,GACJ,GACJ,EACAb,EAA0B,WAAc,OAAO,GAAUC,OAAO,OAAQ,GAAQ,WAC5E,IAAItqH,EAASquC,EACTi8E,EAAQl7I,KACZ,OAAO,GAAYA,MAAM,SAAUu6I,GAC/B,OAAQA,EAAG/jC,OACP,KAAK,EAeD,OAdA5lF,EAAUtf,EAAK+sC,cAAc,CAAElM,aAAcuoG,KAC7Cz7E,EAAuB,SAAUzyD,GAAW,OAAO,GAAU0uI,OAAO,OAAQ,GAAQ,WAChF,IAAI57E,EACJ,OAAO,GAAYt/D,MAAM,SAAUu6I,GAE/B,OADAj7E,EAAiBq7E,GAAsB3+H,OAAOxP,EAAQsmC,UACnCkpG,SAAWj1F,IAGbjsB,SAASmhH,cAAc,OACzBC,YAAc,YAAY96I,OAAOk+D,EAAelyD,MAC/D0tB,SAASwxB,cAAcuuF,KAJZ,CAAC,EAMhB,GACJ,GAAI,EACG,CAAC,EAAavpI,EAAKzE,OAAOwmC,UAAUziB,EAASquC,IACxD,KAAK,EAED,OADAs7E,EAAGL,OACI,CAAC,GAEpB,GACJ,GAAI,EACG,CAAC,EAAc,CACd5oI,KAAMA,EACN0pI,uBAAwBA,EACxBC,wBAAyBA,IAG7C,GACJ,GACJ,CACsB,QAAU,OAAQ,OAAQ,GAAQ,WACpD,IAAIV,EAAIS,EACR,OAAO,GAAYh7I,MAAM,SAAUm8I,GAC/B,OAAQA,EAAG3lC,OACP,KAAK,EAAG,MAAO,CAAC,EAAaukC,MAC7B,KAAK,EAOD,OANAR,EAAK4B,EAAGjC,OAAQc,EAAyBT,EAAGS,wBAAwBC,EAA0BV,EAAGU,2BAEjGngH,SAASspB,iBAAiBw2F,GAAuBz1I,MAAM,WACnD,OAAO61I,EAAuB,GAAI,IACtC,IACAA,EAAuB,GAAI,KACpB,CAAC,GAEpB,GACJ","sources":["webpack://waku-dogfooding/./node_modules/hashlru/index.js","webpack://waku-dogfooding/./node_modules/eventemitter3/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/types.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/verifier.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/tokenize.js","webpack://waku-dogfooding/./node_modules/event-iterator/lib/dom.js","webpack://waku-dogfooding/./node_modules/debug/src/common.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/converter.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/writer_buffer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/encoder.js","webpack://waku-dogfooding/./node_modules/js-sha3/src/sha3.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/field.js","webpack://waku-dogfooding/./node_modules/@protobufjs/utf8/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/oneof.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util/longbits.js","webpack://waku-dogfooding/./node_modules/protobufjs/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/message.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/reader_buffer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/writer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util/minimal.js","webpack://waku-dogfooding/./node_modules/retry/lib/retry_operation.js","webpack://waku-dogfooding/./node_modules/@protobufjs/inquire/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/eventemitter/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index-minimal.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/roots.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/parse.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/rpc.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/common.js","webpack://waku-dogfooding/./node_modules/@protobufjs/fetch/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index-light.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/root.js","webpack://waku-dogfooding/./node_modules/netmask/lib/netmask.js","webpack://waku-dogfooding/./node_modules/retry/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/enum.js","webpack://waku-dogfooding/./node_modules/hi-base32/src/base32.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/reader.js","webpack://waku-dogfooding/./node_modules/is-plain-obj/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/wrappers.js","webpack://waku-dogfooding/./node_modules/ms/index.js","webpack://waku-dogfooding/./node_modules/merge-options/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/object.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/rpc/service.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/decoder.js","webpack://waku-dogfooding/./node_modules/debug/src/browser.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/type.js","webpack://waku-dogfooding/./node_modules/@protobufjs/aspromise/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/mapfield.js","webpack://waku-dogfooding/./node_modules/retry/lib/retry.js","webpack://waku-dogfooding/./node_modules/@protobufjs/codegen/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/method.js","webpack://waku-dogfooding/./node_modules/@protobufjs/base64/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/namespace.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/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/float/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/service.js","webpack://waku-dogfooding/./node_modules/event-iterator/lib/event-iterator.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/@waku/proto/dist/generated/sds_message.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_indicator.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/logger/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/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/race-signal/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-merge/node_modules/it-queueless-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/sdk/node_modules/@waku/core/dist/lib/stream_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/stream_manager/stream_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/base_protocol.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/native.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/rng.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/stringify.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/v4.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/filter/filter_rpc.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/filter/filter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/light_push/push_rpc.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/light_push/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/light_push/light_push.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/is_size_valid.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/to_proto_message.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/store/rpc.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/store/store.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/event-target.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-id.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/netmask/dist/src/ip.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/util.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/cidr.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/ipnet.js","webpack://waku-dogfooding/./node_modules/@chainsafe/is-ip/lib/is-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/sdk/node_modules/@waku/core/dist/lib/connection_manager/keep_alive_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/connection_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/connection_manager/connection_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/metadata/metadata.js","webpack://waku-dogfooding/./node_modules/@waku/message-hash/dist/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/subscription_monitor.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/subscription.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/constants.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/filter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/health_indicator/health_indicator.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/light_push/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/light_push/retry_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/light_push/light_push.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/peer_manager/peer_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/store/store.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku/wait_for_remote_peer.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku/waku.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/der.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ecdsa/ecdsa.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ecdsa/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ecdsa/index.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/index.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ed25519/ed25519.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ed25519/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/keys.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/webcrypto/webcrypto.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/webcrypto/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/rsa.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/index.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/utils.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/hmac.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/util.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1/secp256k1.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1/index.browser.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/peer-id.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-id/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.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/envelope/envelope.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/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/envelope/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/private-ip.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/multiaddr/is-private.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/multiaddr/is-ip-based.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr-matcher/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr-matcher/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-queueless-pushable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-byte-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-length-prefixed-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-length-prefixed-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-byte-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/pb/message.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/utils/dist/src/multiaddr/is-global-unicast.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/index.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/errors.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/mplex/dist/src/errors.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/@libp2p/crypto/dist/src/random-bytes.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/ping.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/it-first/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/transport.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/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/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/listener.browser.js","webpack://waku-dogfooding/./node_modules/p-timeout/index.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/@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/@waku/sdk/node_modules/libp2p/dist/src/config.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/content-routing.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-routing.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/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/pb/peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/bytes-to-peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/peer-equals.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/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/index.js","webpack://waku-dogfooding/./node_modules/interface-store/dist/src/errors.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/@waku/sdk/node_modules/libp2p/dist/src/address-manager/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/address-manager/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/startable.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/components.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/config/connection-gater.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-collections/dist/src/map.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/get-peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/close.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/connection-pruner.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/constants.browser.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/constants.defaults.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/priority-queue.js","webpack://waku-dogfooding/./node_modules/any-signal/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/address-sorter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/dial-queue.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-store.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/peer-queue.js","webpack://waku-dogfooding/./node_modules/is-network-error/index.js","webpack://waku-dogfooding/./node_modules/p-retry/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/reconnect-queue.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/index.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/@waku/sdk/node_modules/libp2p/dist/src/connection-monitor.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/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/@waku/sdk/node_modules/libp2p/dist/src/peer-routing.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/random-walk.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/registrar.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/tracked-map.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/transport-manager.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/encode.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/decode.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-queueless-pushable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-byte-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-byte-stream/dist/src/index.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.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/upgrader.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/libp2p.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/version.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/env.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/quick-lru/index.js","webpack://waku-dogfooding/./node_modules/dns-over-http-resolver/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/dns-over-http-resolver/dist/src/index.js","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/node_modules/@waku/core/dist/lib/stream_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/node_modules/@waku/core/dist/lib/stream_manager/stream_manager.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/node_modules/@waku/core/dist/lib/base_protocol.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/@waku/sdk/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/util.ts","webpack://waku-dogfooding/./src/index.ts"],"sourcesContent":["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","'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","\"use strict\";\n\n/**\n * Common type constants.\n * @namespace\n */\nvar types = exports;\n\nvar util = require(\"./util\");\n\nvar s = [\n \"double\", // 0\n \"float\", // 1\n \"int32\", // 2\n \"uint32\", // 3\n \"sint32\", // 4\n \"fixed32\", // 5\n \"sfixed32\", // 6\n \"int64\", // 7\n \"uint64\", // 8\n \"sint64\", // 9\n \"fixed64\", // 10\n \"sfixed64\", // 11\n \"bool\", // 12\n \"string\", // 13\n \"bytes\" // 14\n];\n\nfunction bake(values, offset) {\n var i = 0, o = {};\n offset |= 0;\n while (i < values.length) o[s[i + offset]] = values[i++];\n return o;\n}\n\n/**\n * Basic type wire types.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n * @property {number} bytes=2 Ldelim wire type\n */\ntypes.basic = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2,\n /* bytes */ 2\n]);\n\n/**\n * Basic type defaults.\n * @type {Object.}\n * @const\n * @property {number} double=0 Double default\n * @property {number} float=0 Float default\n * @property {number} int32=0 Int32 default\n * @property {number} uint32=0 Uint32 default\n * @property {number} sint32=0 Sint32 default\n * @property {number} fixed32=0 Fixed32 default\n * @property {number} sfixed32=0 Sfixed32 default\n * @property {number} int64=0 Int64 default\n * @property {number} uint64=0 Uint64 default\n * @property {number} sint64=0 Sint32 default\n * @property {number} fixed64=0 Fixed64 default\n * @property {number} sfixed64=0 Sfixed64 default\n * @property {boolean} bool=false Bool default\n * @property {string} string=\"\" String default\n * @property {Array.} bytes=Array(0) Bytes default\n * @property {null} message=null Message default\n */\ntypes.defaults = bake([\n /* double */ 0,\n /* float */ 0,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 0,\n /* sfixed32 */ 0,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 0,\n /* sfixed64 */ 0,\n /* bool */ false,\n /* string */ \"\",\n /* bytes */ util.emptyArray,\n /* message */ null\n]);\n\n/**\n * Basic long type wire types.\n * @type {Object.}\n * @const\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n */\ntypes.long = bake([\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1\n], 7);\n\n/**\n * Allowed types for map keys with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n */\ntypes.mapKey = bake([\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2\n], 2);\n\n/**\n * Allowed types for packed repeated fields with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n */\ntypes.packed = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0\n]);\n","\"use strict\";\nmodule.exports = verifier;\n\nvar Enum = require(\"./enum\"),\n util = require(\"./util\");\n\nfunction invalid(field, expected) {\n return field.name + \": \" + expected + (field.repeated && expected !== \"array\" ? \"[]\" : field.map && expected !== \"object\" ? \"{k:\"+field.keyType+\"}\" : \"\") + \" expected\";\n}\n\n/**\n * Generates a partial value verifier.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genVerifyValue(gen, field, fieldIndex, ref) {\n /* eslint-disable no-unexpected-multiline */\n if (field.resolvedType) {\n if (field.resolvedType instanceof Enum) { gen\n (\"switch(%s){\", ref)\n (\"default:\")\n (\"return%j\", invalid(field, \"enum value\"));\n for (var keys = Object.keys(field.resolvedType.values), j = 0; j < keys.length; ++j) gen\n (\"case %i:\", field.resolvedType.values[keys[j]]);\n gen\n (\"break\")\n (\"}\");\n } else {\n gen\n (\"{\")\n (\"var e=types[%i].verify(%s);\", fieldIndex, ref)\n (\"if(e)\")\n (\"return%j+e\", field.name + \".\")\n (\"}\");\n }\n } else {\n switch (field.type) {\n case \"int32\":\n case \"uint32\":\n case \"sint32\":\n case \"fixed32\":\n case \"sfixed32\": gen\n (\"if(!util.isInteger(%s))\", ref)\n (\"return%j\", invalid(field, \"integer\"));\n break;\n case \"int64\":\n case \"uint64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(!util.isInteger(%s)&&!(%s&&util.isInteger(%s.low)&&util.isInteger(%s.high)))\", ref, ref, ref, ref)\n (\"return%j\", invalid(field, \"integer|Long\"));\n break;\n case \"float\":\n case \"double\": gen\n (\"if(typeof %s!==\\\"number\\\")\", ref)\n (\"return%j\", invalid(field, \"number\"));\n break;\n case \"bool\": gen\n (\"if(typeof %s!==\\\"boolean\\\")\", ref)\n (\"return%j\", invalid(field, \"boolean\"));\n break;\n case \"string\": gen\n (\"if(!util.isString(%s))\", ref)\n (\"return%j\", invalid(field, \"string\"));\n break;\n case \"bytes\": gen\n (\"if(!(%s&&typeof %s.length===\\\"number\\\"||util.isString(%s)))\", ref, ref, ref)\n (\"return%j\", invalid(field, \"buffer\"));\n break;\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline */\n}\n\n/**\n * Generates a partial key verifier.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genVerifyKey(gen, field, ref) {\n /* eslint-disable no-unexpected-multiline */\n switch (field.keyType) {\n case \"int32\":\n case \"uint32\":\n case \"sint32\":\n case \"fixed32\":\n case \"sfixed32\": gen\n (\"if(!util.key32Re.test(%s))\", ref)\n (\"return%j\", invalid(field, \"integer key\"));\n break;\n case \"int64\":\n case \"uint64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(!util.key64Re.test(%s))\", ref) // see comment above: x is ok, d is not\n (\"return%j\", invalid(field, \"integer|Long key\"));\n break;\n case \"bool\": gen\n (\"if(!util.key2Re.test(%s))\", ref)\n (\"return%j\", invalid(field, \"boolean key\"));\n break;\n }\n return gen;\n /* eslint-enable no-unexpected-multiline */\n}\n\n/**\n * Generates a verifier specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction verifier(mtype) {\n /* eslint-disable no-unexpected-multiline */\n\n var gen = util.codegen([\"m\"], mtype.name + \"$verify\")\n (\"if(typeof m!==\\\"object\\\"||m===null)\")\n (\"return%j\", \"object expected\");\n var oneofs = mtype.oneofsArray,\n seenFirstField = {};\n if (oneofs.length) gen\n (\"var p={}\");\n\n for (var i = 0; i < /* initializes */ mtype.fieldsArray.length; ++i) {\n var field = mtype._fieldsArray[i].resolve(),\n ref = \"m\" + util.safeProp(field.name);\n\n if (field.optional) gen\n (\"if(%s!=null&&m.hasOwnProperty(%j)){\", ref, field.name); // !== undefined && !== null\n\n // map fields\n if (field.map) { gen\n (\"if(!util.isObject(%s))\", ref)\n (\"return%j\", invalid(field, \"object\"))\n (\"var k=Object.keys(%s)\", ref)\n (\"for(var i=0;i]/g,\n stringDoubleRe = /(?:\"([^\"\\\\]*(?:\\\\.[^\"\\\\]*)*)\")/g,\n stringSingleRe = /(?:'([^'\\\\]*(?:\\\\.[^'\\\\]*)*)')/g;\n\nvar setCommentRe = /^ *[*/]+ */,\n setCommentAltRe = /^\\s*\\*?\\/*/,\n setCommentSplitRe = /\\n/g,\n whitespaceRe = /\\s/,\n unescapeRe = /\\\\(.?)/g;\n\nvar unescapeMap = {\n \"0\": \"\\0\",\n \"r\": \"\\r\",\n \"n\": \"\\n\",\n \"t\": \"\\t\"\n};\n\n/**\n * Unescapes a string.\n * @param {string} str String to unescape\n * @returns {string} Unescaped string\n * @property {Object.} map Special characters map\n * @memberof tokenize\n */\nfunction unescape(str) {\n return str.replace(unescapeRe, function($0, $1) {\n switch ($1) {\n case \"\\\\\":\n case \"\":\n return $1;\n default:\n return unescapeMap[$1] || \"\";\n }\n });\n}\n\ntokenize.unescape = unescape;\n\n/**\n * Gets the next token and advances.\n * @typedef TokenizerHandleNext\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Peeks for the next token.\n * @typedef TokenizerHandlePeek\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Pushes a token back to the stack.\n * @typedef TokenizerHandlePush\n * @type {function}\n * @param {string} token Token\n * @returns {undefined}\n */\n\n/**\n * Skips the next token.\n * @typedef TokenizerHandleSkip\n * @type {function}\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] If optional\n * @returns {boolean} Whether the token matched\n * @throws {Error} If the token didn't match and is not optional\n */\n\n/**\n * Gets the comment on the previous line or, alternatively, the line comment on the specified line.\n * @typedef TokenizerHandleCmnt\n * @type {function}\n * @param {number} [line] Line number\n * @returns {string|null} Comment text or `null` if none\n */\n\n/**\n * Handle object returned from {@link tokenize}.\n * @interface ITokenizerHandle\n * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof)\n * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof)\n * @property {TokenizerHandlePush} push Pushes a token back to the stack\n * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws\n * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any\n * @property {number} line Current line number\n */\n\n/**\n * Tokenizes the given .proto source and returns an object with useful utility functions.\n * @param {string} source Source contents\n * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode.\n * @returns {ITokenizerHandle} Tokenizer handle\n */\nfunction tokenize(source, alternateCommentMode) {\n /* eslint-disable callback-return */\n source = source.toString();\n\n var offset = 0,\n length = source.length,\n line = 1,\n lastCommentLine = 0,\n comments = {};\n\n var stack = [];\n\n var stringDelim = null;\n\n /* istanbul ignore next */\n /**\n * Creates an error for illegal syntax.\n * @param {string} subject Subject\n * @returns {Error} Error created\n * @inner\n */\n function illegal(subject) {\n return Error(\"illegal \" + subject + \" (line \" + line + \")\");\n }\n\n /**\n * Reads a string till its end.\n * @returns {string} String read\n * @inner\n */\n function readString() {\n var re = stringDelim === \"'\" ? stringSingleRe : stringDoubleRe;\n re.lastIndex = offset - 1;\n var match = re.exec(source);\n if (!match)\n throw illegal(\"string\");\n offset = re.lastIndex;\n push(stringDelim);\n stringDelim = null;\n return unescape(match[1]);\n }\n\n /**\n * Gets the character at `pos` within the source.\n * @param {number} pos Position\n * @returns {string} Character\n * @inner\n */\n function charAt(pos) {\n return source.charAt(pos);\n }\n\n /**\n * Sets the current comment text.\n * @param {number} start Start offset\n * @param {number} end End offset\n * @param {boolean} isLeading set if a leading comment\n * @returns {undefined}\n * @inner\n */\n function setComment(start, end, isLeading) {\n var comment = {\n type: source.charAt(start++),\n lineEmpty: false,\n leading: isLeading,\n };\n var lookback;\n if (alternateCommentMode) {\n lookback = 2; // alternate comment parsing: \"//\" or \"/*\"\n } else {\n lookback = 3; // \"///\" or \"/**\"\n }\n var commentOffset = start - lookback,\n c;\n do {\n if (--commentOffset < 0 ||\n (c = source.charAt(commentOffset)) === \"\\n\") {\n comment.lineEmpty = true;\n break;\n }\n } while (c === \" \" || c === \"\\t\");\n var lines = source\n .substring(start, end)\n .split(setCommentSplitRe);\n for (var i = 0; i < lines.length; ++i)\n lines[i] = lines[i]\n .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, \"\")\n .trim();\n comment.text = lines\n .join(\"\\n\")\n .trim();\n\n comments[line] = comment;\n lastCommentLine = line;\n }\n\n function isDoubleSlashCommentLine(startOffset) {\n var endOffset = findEndOfLine(startOffset);\n\n // see if remaining line matches comment pattern\n var lineText = source.substring(startOffset, endOffset);\n var isComment = /^\\s*\\/\\//.test(lineText);\n return isComment;\n }\n\n function findEndOfLine(cursor) {\n // find end of cursor's line\n var endOffset = cursor;\n while (endOffset < length && charAt(endOffset) !== \"\\n\") {\n endOffset++;\n }\n return endOffset;\n }\n\n /**\n * Obtains the next token.\n * @returns {string|null} Next token or `null` on eof\n * @inner\n */\n function next() {\n if (stack.length > 0)\n return stack.shift();\n if (stringDelim)\n return readString();\n var repeat,\n prev,\n curr,\n start,\n isDoc,\n isLeadingComment = offset === 0;\n do {\n if (offset === length)\n return null;\n repeat = false;\n while (whitespaceRe.test(curr = charAt(offset))) {\n if (curr === \"\\n\") {\n isLeadingComment = true;\n ++line;\n }\n if (++offset === length)\n return null;\n }\n\n if (charAt(offset) === \"/\") {\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n if (charAt(offset) === \"/\") { // Line\n if (!alternateCommentMode) {\n // check for triple-slash comment\n isDoc = charAt(start = offset + 1) === \"/\";\n\n while (charAt(++offset) !== \"\\n\") {\n if (offset === length) {\n return null;\n }\n }\n ++offset;\n if (isDoc) {\n setComment(start, offset - 1, isLeadingComment);\n // Trailing comment cannot not be multi-line,\n // so leading comment state should be reset to handle potential next comments\n isLeadingComment = true;\n }\n ++line;\n repeat = true;\n } else {\n // check for double-slash comments, consolidating consecutive lines\n start = offset;\n isDoc = false;\n if (isDoubleSlashCommentLine(offset - 1)) {\n isDoc = true;\n do {\n offset = findEndOfLine(offset);\n if (offset === length) {\n break;\n }\n offset++;\n if (!isLeadingComment) {\n // Trailing comment cannot not be multi-line\n break;\n }\n } while (isDoubleSlashCommentLine(offset));\n } else {\n offset = Math.min(length, findEndOfLine(offset) + 1);\n }\n if (isDoc) {\n setComment(start, offset, isLeadingComment);\n isLeadingComment = true;\n }\n line++;\n repeat = true;\n }\n } else if ((curr = charAt(offset)) === \"*\") { /* Block */\n // check for /** (regular comment mode) or /* (alternate comment mode)\n start = offset + 1;\n isDoc = alternateCommentMode || charAt(start) === \"*\";\n do {\n if (curr === \"\\n\") {\n ++line;\n }\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n prev = curr;\n curr = charAt(offset);\n } while (prev !== \"*\" || curr !== \"/\");\n ++offset;\n if (isDoc) {\n setComment(start, offset - 2, isLeadingComment);\n isLeadingComment = true;\n }\n repeat = true;\n } else {\n return \"/\";\n }\n }\n } while (repeat);\n\n // offset !== length if we got here\n\n var end = offset;\n delimRe.lastIndex = 0;\n var delim = delimRe.test(charAt(end++));\n if (!delim)\n while (end < length && !delimRe.test(charAt(end)))\n ++end;\n var token = source.substring(offset, offset = end);\n if (token === \"\\\"\" || token === \"'\")\n stringDelim = token;\n return token;\n }\n\n /**\n * Pushes a token back to the stack.\n * @param {string} token Token\n * @returns {undefined}\n * @inner\n */\n function push(token) {\n stack.push(token);\n }\n\n /**\n * Peeks for the next token.\n * @returns {string|null} Token or `null` on eof\n * @inner\n */\n function peek() {\n if (!stack.length) {\n var token = next();\n if (token === null)\n return null;\n push(token);\n }\n return stack[0];\n }\n\n /**\n * Skips a token.\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] Whether the token is optional\n * @returns {boolean} `true` when skipped, `false` if not\n * @throws {Error} When a required token is not present\n * @inner\n */\n function skip(expected, optional) {\n var actual = peek(),\n equals = actual === expected;\n if (equals) {\n next();\n return true;\n }\n if (!optional)\n throw illegal(\"token '\" + actual + \"', '\" + expected + \"' expected\");\n return false;\n }\n\n /**\n * Gets a comment.\n * @param {number} [trailingLine] Line number if looking for a trailing comment\n * @returns {string|null} Comment text\n * @inner\n */\n function cmnt(trailingLine) {\n var ret = null;\n var comment;\n if (trailingLine === undefined) {\n comment = comments[line - 1];\n delete comments[line - 1];\n if (comment && (alternateCommentMode || comment.type === \"*\" || comment.lineEmpty)) {\n ret = comment.leading ? comment.text : null;\n }\n } else {\n /* istanbul ignore else */\n if (lastCommentLine < trailingLine) {\n peek();\n }\n comment = comments[trailingLine];\n delete comments[trailingLine];\n if (comment && !comment.lineEmpty && (alternateCommentMode || comment.type === \"/\")) {\n ret = comment.leading ? null : comment.text;\n }\n }\n return ret;\n }\n\n return Object.defineProperty({\n next: next,\n peek: peek,\n push: push,\n skip: skip,\n cmnt: cmnt\n }, \"line\", {\n get: function() { return line; }\n });\n /* eslint-enable callback-return */\n}\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","\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\tconst split = (typeof namespaces === 'string' ? namespaces : '')\n\t\t\t.trim()\n\t\t\t.replace(' ', ',')\n\t\t\t.split(',')\n\t\t\t.filter(Boolean);\n\n\t\tfor (const ns of split) {\n\t\t\tif (ns[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(ns.slice(1));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(ns);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Checks if the given string matches a namespace template, honoring\n\t * asterisks as wildcards.\n\t *\n\t * @param {String} search\n\t * @param {String} template\n\t * @return {Boolean}\n\t */\n\tfunction matchesTemplate(search, template) {\n\t\tlet searchIndex = 0;\n\t\tlet templateIndex = 0;\n\t\tlet starIndex = -1;\n\t\tlet matchIndex = 0;\n\n\t\twhile (searchIndex < search.length) {\n\t\t\tif (templateIndex < template.length && (template[templateIndex] === search[searchIndex] || template[templateIndex] === '*')) {\n\t\t\t\t// Match character or proceed with wildcard\n\t\t\t\tif (template[templateIndex] === '*') {\n\t\t\t\t\tstarIndex = templateIndex;\n\t\t\t\t\tmatchIndex = searchIndex;\n\t\t\t\t\ttemplateIndex++; // Skip the '*'\n\t\t\t\t} else {\n\t\t\t\t\tsearchIndex++;\n\t\t\t\t\ttemplateIndex++;\n\t\t\t\t}\n\t\t\t} else if (starIndex !== -1) { // eslint-disable-line no-negated-condition\n\t\t\t\t// Backtrack to the last '*' and try to match more characters\n\t\t\t\ttemplateIndex = starIndex + 1;\n\t\t\t\tmatchIndex++;\n\t\t\t\tsearchIndex = matchIndex;\n\t\t\t} else {\n\t\t\t\treturn false; // No match\n\t\t\t}\n\t\t}\n\n\t\t// Handle trailing '*' in template\n\t\twhile (templateIndex < template.length && template[templateIndex] === '*') {\n\t\t\ttemplateIndex++;\n\t\t}\n\n\t\treturn templateIndex === template.length;\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,\n\t\t\t...createDebug.skips.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\tfor (const skip of createDebug.skips) {\n\t\t\tif (matchesTemplate(name, skip)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (const ns of createDebug.names) {\n\t\t\tif (matchesTemplate(name, ns)) {\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* 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 * Runtime message from/to plain object converters.\n * @namespace\n */\nvar converter = exports;\n\nvar Enum = require(\"./enum\"),\n util = require(\"./util\");\n\n/**\n * Generates a partial value fromObject conveter.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} prop Property reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genValuePartial_fromObject(gen, field, fieldIndex, prop) {\n var defaultAlreadyEmitted = false;\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n if (field.resolvedType) {\n if (field.resolvedType instanceof Enum) { gen\n (\"switch(d%s){\", prop);\n for (var values = field.resolvedType.values, keys = Object.keys(values), i = 0; i < keys.length; ++i) {\n // enum unknown values passthrough\n if (values[keys[i]] === field.typeDefault && !defaultAlreadyEmitted) { gen\n (\"default:\")\n (\"if(typeof(d%s)===\\\"number\\\"){m%s=d%s;break}\", prop, prop, prop);\n if (!field.repeated) gen // fallback to default value only for\n // arrays, to avoid leaving holes.\n (\"break\"); // for non-repeated fields, just ignore\n defaultAlreadyEmitted = true;\n }\n gen\n (\"case%j:\", keys[i])\n (\"case %i:\", values[keys[i]])\n (\"m%s=%j\", prop, values[keys[i]])\n (\"break\");\n } gen\n (\"}\");\n } else gen\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\n (\"m%s=types[%i].fromObject(d%s)\", prop, fieldIndex, prop);\n } else {\n var isUnsigned = false;\n switch (field.type) {\n case \"double\":\n case \"float\": gen\n (\"m%s=Number(d%s)\", prop, prop); // also catches \"NaN\", \"Infinity\"\n break;\n case \"uint32\":\n case \"fixed32\": gen\n (\"m%s=d%s>>>0\", prop, prop);\n break;\n case \"int32\":\n case \"sint32\":\n case \"sfixed32\": gen\n (\"m%s=d%s|0\", prop, prop);\n break;\n case \"uint64\":\n isUnsigned = true;\n // eslint-disable-next-line no-fallthrough\n case \"int64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(util.Long)\")\n (\"(m%s=util.Long.fromValue(d%s)).unsigned=%j\", prop, prop, isUnsigned)\n (\"else if(typeof d%s===\\\"string\\\")\", prop)\n (\"m%s=parseInt(d%s,10)\", prop, prop)\n (\"else if(typeof d%s===\\\"number\\\")\", prop)\n (\"m%s=d%s\", prop, prop)\n (\"else if(typeof d%s===\\\"object\\\")\", prop)\n (\"m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)\", prop, prop, prop, isUnsigned ? \"true\" : \"\");\n break;\n case \"bytes\": gen\n (\"if(typeof d%s===\\\"string\\\")\", prop)\n (\"util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)\", prop, prop, prop)\n (\"else if(d%s.length >= 0)\", prop)\n (\"m%s=d%s\", prop, prop);\n break;\n case \"string\": gen\n (\"m%s=String(d%s)\", prop, prop);\n break;\n case \"bool\": gen\n (\"m%s=Boolean(d%s)\", prop, prop);\n break;\n /* default: gen\n (\"m%s=d%s\", prop, prop);\n break; */\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a plain object to runtime message converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.fromObject = function fromObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray;\n var gen = util.codegen([\"d\"], mtype.name + \"$fromObject\")\n (\"if(d instanceof this.ctor)\")\n (\"return d\");\n if (!fields.length) return gen\n (\"return new this.ctor\");\n gen\n (\"var m=new this.ctor\");\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n prop = util.safeProp(field.name);\n\n // Map fields\n if (field.map) { gen\n (\"if(d%s){\", prop)\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\n (\"m%s={}\", prop)\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);\n break;\n case \"bytes\": gen\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);\n break;\n default: gen\n (\"d%s=m%s\", prop, prop);\n break;\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a runtime message to plain object converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.toObject = function toObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById);\n if (!fields.length)\n return util.codegen()(\"return {}\");\n var gen = util.codegen([\"m\", \"o\"], mtype.name + \"$toObject\")\n (\"if(!o)\")\n (\"o={}\")\n (\"var d={}\");\n\n var repeatedFields = [],\n mapFields = [],\n normalFields = [],\n i = 0;\n for (; i < fields.length; ++i)\n if (!fields[i].partOf)\n ( fields[i].resolve().repeated ? repeatedFields\n : fields[i].map ? mapFields\n : normalFields).push(fields[i]);\n\n if (repeatedFields.length) { gen\n (\"if(o.arrays||o.defaults){\");\n for (i = 0; i < repeatedFields.length; ++i) gen\n (\"d%s=[]\", util.safeProp(repeatedFields[i].name));\n gen\n (\"}\");\n }\n\n if (mapFields.length) { gen\n (\"if(o.objects||o.defaults){\");\n for (i = 0; i < mapFields.length; ++i) gen\n (\"d%s={}\", util.safeProp(mapFields[i].name));\n gen\n (\"}\");\n }\n\n if (normalFields.length) { gen\n (\"if(o.defaults){\");\n for (i = 0; i < normalFields.length; ++i) {\n var field = normalFields[i],\n prop = util.safeProp(field.name);\n if (field.resolvedType instanceof Enum) gen\n (\"d%s=o.enums===String?%j:%j\", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault);\n else if (field.long) gen\n (\"if(util.Long){\")\n (\"var n=new util.Long(%i,%i,%j)\", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned)\n (\"d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n\", prop)\n (\"}else\")\n (\"d%s=o.longs===String?%j:%i\", prop, field.typeDefault.toString(), field.typeDefault.toNumber());\n else if (field.bytes) {\n var arrayDefault = \"[\" + Array.prototype.slice.call(field.typeDefault).join(\",\") + \"]\";\n gen\n (\"if(o.bytes===String)d%s=%j\", prop, String.fromCharCode.apply(String, field.typeDefault))\n (\"else{\")\n (\"d%s=%s\", prop, arrayDefault)\n (\"if(o.bytes!==Array)d%s=util.newBuffer(d%s)\", prop, prop)\n (\"}\");\n } else gen\n (\"d%s=%j\", prop, field.typeDefault); // also messages (=null)\n } gen\n (\"}\");\n }\n var hasKs2 = false;\n for (i = 0; i < fields.length; ++i) {\n var field = fields[i],\n index = mtype._fieldsArray.indexOf(field),\n prop = util.safeProp(field.name);\n if (field.map) {\n if (!hasKs2) { hasKs2 = true; gen\n (\"var ks2\");\n } gen\n (\"if(m%s&&(ks2=Object.keys(m%s)).length){\", prop, prop)\n (\"d%s={}\", prop)\n (\"for(var j=0;j= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytesBuffer_copy(val, buf, pos) {\n if (val.copy) // Buffer values\n val.copy(buf, pos, 0, val.length);\n else for (var i = 0; i < val.length;) // plain array values\n buf[pos++] = val[i++];\n };\n};\n\n\n/**\n * @override\n */\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\n if (util.isString(value))\n value = util._Buffer_from(value, \"base64\");\n var len = value.length >>> 0;\n this.uint32(len);\n if (len)\n this._push(BufferWriter.writeBytesBuffer, len, value);\n return this;\n};\n\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\n util.utf8.write(val, buf, pos);\n else if (buf.utf8Write)\n buf.utf8Write(val, pos);\n else\n buf.write(val, pos);\n}\n\n/**\n * @override\n */\nBufferWriter.prototype.string = function write_string_buffer(value) {\n var len = util.Buffer.byteLength(value);\n this.uint32(len);\n if (len)\n this._push(writeStringBuffer, len, value);\n return this;\n};\n\n\n/**\n * Finishes the write operation.\n * @name BufferWriter#finish\n * @function\n * @returns {Buffer} Finished buffer\n */\n\nBufferWriter._configure();\n","\"use strict\";\nmodule.exports = encoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Generates a partial message type encoder.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genTypePartial(gen, field, fieldIndex, ref) {\n return field.delimited\n ? gen(\"types[%i].encode(%s,w.uint32(%i)).uint32(%i)\", fieldIndex, ref, (field.id << 3 | 3) >>> 0, (field.id << 3 | 4) >>> 0)\n : gen(\"types[%i].encode(%s,w.uint32(%i).fork()).ldelim()\", fieldIndex, ref, (field.id << 3 | 2) >>> 0);\n}\n\n/**\n * Generates an encoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction encoder(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var gen = util.codegen([\"m\", \"w\"], mtype.name + \"$encode\")\n (\"if(!w)\")\n (\"w=Writer.create()\");\n\n var i, ref;\n\n // \"when a message is serialized its known fields should be written sequentially by field number\"\n var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById);\n\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n index = mtype._fieldsArray.indexOf(field),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n wireType = types.basic[type];\n ref = \"m\" + util.safeProp(field.name);\n\n // Map fields\n if (field.map) {\n gen\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j)){\", ref, field.name) // !== undefined && !== null\n (\"for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType);\n if (wireType === undefined) gen\n (\"types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()\", index, ref); // can't be groups\n else gen\n (\".uint32(%i).%s(%s[ks[i]]).ldelim()\", 16 | wireType, type, ref);\n gen\n (\"}\")\n (\"}\");\n\n // Repeated fields\n } else if (field.repeated) { gen\n (\"if(%s!=null&&%s.length){\", ref, ref); // !== undefined && !== null\n\n // Packed repeated\n if (field.packed && types.packed[type] !== undefined) { gen\n\n (\"w.uint32(%i).fork()\", (field.id << 3 | 2) >>> 0)\n (\"for(var i=0;i<%s.length;++i)\", ref)\n (\"w.%s(%s[i])\", type, ref)\n (\"w.ldelim()\");\n\n // Non-packed\n } else { gen\n\n (\"for(var i=0;i<%s.length;++i)\", ref);\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref + \"[i]\");\n else gen\n (\"w.uint32(%i).%s(%s[i])\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n } gen\n (\"}\");\n\n // Non-repeated\n } else {\n if (field.optional) gen\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j))\", ref, field.name); // !== undefined && !== null\n\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref);\n else gen\n (\"w.uint32(%i).%s(%s)\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n }\n }\n\n return gen\n (\"return w\");\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\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\";\nmodule.exports = Field;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = \"Field\";\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar Type; // cyclic\n\nvar ruleRe = /^required|optional|repeated$/;\n\n/**\n * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class.\n * @name Field\n * @classdesc Reflected message field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a field from a field descriptor.\n * @param {string} name Field name\n * @param {IField} json Field descriptor\n * @returns {Field} Created field\n * @throws {TypeError} If arguments are invalid\n */\nField.fromJSON = function fromJSON(name, json) {\n var field = new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment);\n if (json.edition)\n field._edition = json.edition;\n field._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return field;\n};\n\n/**\n * Not an actual constructor. Use {@link Field} instead.\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.\n * @exports FieldBase\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction Field(name, id, type, rule, extend, options, comment) {\n\n if (util.isObject(rule)) {\n comment = extend;\n options = rule;\n rule = extend = undefined;\n } else if (util.isObject(extend)) {\n comment = options;\n options = extend;\n extend = undefined;\n }\n\n ReflectionObject.call(this, name, options);\n\n if (!util.isInteger(id) || id < 0)\n throw TypeError(\"id must be a non-negative integer\");\n\n if (!util.isString(type))\n throw TypeError(\"type must be a string\");\n\n if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase()))\n throw TypeError(\"rule must be a string rule\");\n\n if (extend !== undefined && !util.isString(extend))\n throw TypeError(\"extend must be a string\");\n\n /**\n * Field rule, if any.\n * @type {string|undefined}\n */\n if (rule === \"proto3_optional\") {\n rule = \"optional\";\n }\n this.rule = rule && rule !== \"optional\" ? rule : undefined; // toJSON\n\n /**\n * Field type.\n * @type {string}\n */\n this.type = type; // toJSON\n\n /**\n * Unique field id.\n * @type {number}\n */\n this.id = id; // toJSON, marker\n\n /**\n * Extended type if different from parent.\n * @type {string|undefined}\n */\n this.extend = extend || undefined; // toJSON\n\n /**\n * Whether this field is repeated.\n * @type {boolean}\n */\n this.repeated = rule === \"repeated\";\n\n /**\n * Whether this field is a map or not.\n * @type {boolean}\n */\n this.map = false;\n\n /**\n * Message this field belongs to.\n * @type {Type|null}\n */\n this.message = null;\n\n /**\n * OneOf this field belongs to, if any,\n * @type {OneOf|null}\n */\n this.partOf = null;\n\n /**\n * The field type's default value.\n * @type {*}\n */\n this.typeDefault = null;\n\n /**\n * The field's default value on prototypes.\n * @type {*}\n */\n this.defaultValue = null;\n\n /**\n * Whether this field's value should be treated as a long.\n * @type {boolean}\n */\n this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false;\n\n /**\n * Whether this field's value is a buffer.\n * @type {boolean}\n */\n this.bytes = type === \"bytes\";\n\n /**\n * Resolved type if not a basic type.\n * @type {Type|Enum|null}\n */\n this.resolvedType = null;\n\n /**\n * Sister-field within the extended type if a declaring extension field.\n * @type {Field|null}\n */\n this.extensionField = null;\n\n /**\n * Sister-field within the declaring namespace if an extended field.\n * @type {Field|null}\n */\n this.declaringField = null;\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Determines whether this field is required.\n * @name Field#required\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"required\", {\n get: function() {\n return this._features.field_presence === \"LEGACY_REQUIRED\";\n }\n});\n\n/**\n * Determines whether this field is not required.\n * @name Field#optional\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"optional\", {\n get: function() {\n return !this.required;\n }\n});\n\n/**\n * Determines whether this field uses tag-delimited encoding. In proto2 this\n * corresponded to group syntax.\n * @name Field#delimited\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"delimited\", {\n get: function() {\n return this.resolvedType instanceof Type &&\n this._features.message_encoding === \"DELIMITED\";\n }\n});\n\n/**\n * Determines whether this field is packed. Only relevant when repeated.\n * @name Field#packed\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"packed\", {\n get: function() {\n return this._features.repeated_field_encoding === \"PACKED\";\n }\n});\n\n/**\n * Determines whether this field tracks presence.\n * @name Field#hasPresence\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"hasPresence\", {\n get: function() {\n if (this.repeated || this.map) {\n return false;\n }\n return this.partOf || // oneofs\n this.declaringField || this.extensionField || // extensions\n this._features.field_presence !== \"IMPLICIT\";\n }\n});\n\n/**\n * @override\n */\nField.prototype.setOption = function setOption(name, value, ifNotSet) {\n return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet);\n};\n\n/**\n * Field descriptor.\n * @interface IField\n * @property {string} [rule=\"optional\"] Field rule\n * @property {string} type Field type\n * @property {number} id Field id\n * @property {Object.} [options] Field options\n */\n\n/**\n * Extension field descriptor.\n * @interface IExtensionField\n * @extends IField\n * @property {string} extend Extended type\n */\n\n/**\n * Converts this field to a field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IField} Field descriptor\n */\nField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"rule\" , this.rule !== \"optional\" && this.rule || undefined,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Resolves this field's type references.\n * @returns {Field} `this`\n * @throws {Error} If any reference cannot be resolved\n */\nField.prototype.resolve = function resolve() {\n\n if (this.resolved)\n return this;\n\n if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it\n this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type);\n if (this.resolvedType instanceof Type)\n this.typeDefault = null;\n else // instanceof Enum\n this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined\n } else if (this.options && this.options.proto3_optional) {\n // proto3 scalar value marked optional; should default to null\n this.typeDefault = null;\n }\n\n // use explicitly set default value if present\n if (this.options && this.options[\"default\"] != null) {\n this.typeDefault = this.options[\"default\"];\n if (this.resolvedType instanceof Enum && typeof this.typeDefault === \"string\")\n this.typeDefault = this.resolvedType.values[this.typeDefault];\n }\n\n // remove unnecessary options\n if (this.options) {\n if (this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum))\n delete this.options.packed;\n if (!Object.keys(this.options).length)\n this.options = undefined;\n }\n\n // convert to internal data type if necesssary\n if (this.long) {\n this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === \"u\");\n\n /* istanbul ignore else */\n if (Object.freeze)\n Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it)\n\n } else if (this.bytes && typeof this.typeDefault === \"string\") {\n var buf;\n if (util.base64.test(this.typeDefault))\n util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0);\n else\n util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0);\n this.typeDefault = buf;\n }\n\n // take special care of maps and repeated fields\n if (this.map)\n this.defaultValue = util.emptyObject;\n else if (this.repeated)\n this.defaultValue = util.emptyArray;\n else\n this.defaultValue = this.typeDefault;\n\n // ensure proper value on prototype\n if (this.parent instanceof Type)\n this.parent.ctor.prototype[this.name] = this.defaultValue;\n\n return ReflectionObject.prototype.resolve.call(this);\n};\n\n/**\n * Infers field features from legacy syntax that may have been specified differently.\n * in older editions.\n * @param {string|undefined} edition The edition this proto is on, or undefined if pre-editions\n * @returns {object} The feature values to override\n */\nField.prototype._inferLegacyProtoFeatures = function _inferLegacyProtoFeatures(edition) {\n if (edition !== \"proto2\" && edition !== \"proto3\") {\n return {};\n }\n\n var features = {};\n this.resolve();\n if (this.rule === \"required\") {\n features.field_presence = \"LEGACY_REQUIRED\";\n }\n if (this.resolvedType instanceof Type && this.resolvedType.group) {\n features.message_encoding = \"DELIMITED\";\n }\n if (this.getOption(\"packed\") === true) {\n features.repeated_field_encoding = \"PACKED\";\n } else if (this.getOption(\"packed\") === false) {\n features.repeated_field_encoding = \"EXPANDED\";\n }\n return features;\n};\n\n/**\n * @override\n */\nField.prototype._resolveFeatures = function _resolveFeatures(edition) {\n return ReflectionObject.prototype._resolveFeatures.call(this, this._edition || edition);\n};\n\n/**\n * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript).\n * @typedef FieldDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} fieldName Field name\n * @returns {undefined}\n */\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"string\"|\"bool\"|\"bytes\"|Object} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @param {T} [defaultValue] Default value\n * @returns {FieldDecorator} Decorator function\n * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[]\n */\nField.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) {\n\n // submessage: decorate the submessage and use its name as the type\n if (typeof fieldType === \"function\")\n fieldType = util.decorateType(fieldType).name;\n\n // enum reference: create a reflected copy of the enum and keep reuseing it\n else if (fieldType && typeof fieldType === \"object\")\n fieldType = util.decorateEnum(fieldType).name;\n\n return function fieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new Field(fieldName, fieldId, fieldType, fieldRule, { \"default\": defaultValue }));\n };\n};\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {Constructor|string} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @returns {FieldDecorator} Decorator function\n * @template T extends Message\n * @variation 2\n */\n// like Field.d but without a default value\n\n// Sets up cyclic dependencies (called in index-light)\nField._configure = function configure(Type_) {\n Type = Type_;\n};\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","\"use strict\";\nmodule.exports = OneOf;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = \"OneOf\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new oneof instance.\n * @classdesc Reflected oneof.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Oneof name\n * @param {string[]|Object.} [fieldNames] Field names\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction OneOf(name, fieldNames, options, comment) {\n if (!Array.isArray(fieldNames)) {\n options = fieldNames;\n fieldNames = undefined;\n }\n ReflectionObject.call(this, name, options);\n\n /* istanbul ignore if */\n if (!(fieldNames === undefined || Array.isArray(fieldNames)))\n throw TypeError(\"fieldNames must be an Array\");\n\n /**\n * Field names that belong to this oneof.\n * @type {string[]}\n */\n this.oneof = fieldNames || []; // toJSON, marker\n\n /**\n * Fields that belong to this oneof as an array for iteration.\n * @type {Field[]}\n * @readonly\n */\n this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Oneof descriptor.\n * @interface IOneOf\n * @property {Array.} oneof Oneof field names\n * @property {Object.} [options] Oneof options\n */\n\n/**\n * Constructs a oneof from a oneof descriptor.\n * @param {string} name Oneof name\n * @param {IOneOf} json Oneof descriptor\n * @returns {OneOf} Created oneof\n * @throws {TypeError} If arguments are invalid\n */\nOneOf.fromJSON = function fromJSON(name, json) {\n return new OneOf(name, json.oneof, json.options, json.comment);\n};\n\n/**\n * Converts this oneof to a oneof descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IOneOf} Oneof descriptor\n */\nOneOf.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , this.options,\n \"oneof\" , this.oneof,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Adds the fields of the specified oneof to the parent if not already done so.\n * @param {OneOf} oneof The oneof\n * @returns {undefined}\n * @inner\n * @ignore\n */\nfunction addFieldsToParent(oneof) {\n if (oneof.parent)\n for (var i = 0; i < oneof.fieldsArray.length; ++i)\n if (!oneof.fieldsArray[i].parent)\n oneof.parent.add(oneof.fieldsArray[i]);\n}\n\n/**\n * Adds a field to this oneof and removes it from its current parent, if any.\n * @param {Field} field Field to add\n * @returns {OneOf} `this`\n */\nOneOf.prototype.add = function add(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n if (field.parent && field.parent !== this.parent)\n field.parent.remove(field);\n this.oneof.push(field.name);\n this.fieldsArray.push(field);\n field.partOf = this; // field.parent remains null\n addFieldsToParent(this);\n return this;\n};\n\n/**\n * Removes a field from this oneof and puts it back to the oneof's parent.\n * @param {Field} field Field to remove\n * @returns {OneOf} `this`\n */\nOneOf.prototype.remove = function remove(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n var index = this.fieldsArray.indexOf(field);\n\n /* istanbul ignore if */\n if (index < 0)\n throw Error(field + \" is not a member of \" + this);\n\n this.fieldsArray.splice(index, 1);\n index = this.oneof.indexOf(field.name);\n\n /* istanbul ignore else */\n if (index > -1) // theoretical\n this.oneof.splice(index, 1);\n\n field.partOf = null;\n return this;\n};\n\n/**\n * @override\n */\nOneOf.prototype.onAdd = function onAdd(parent) {\n ReflectionObject.prototype.onAdd.call(this, parent);\n var self = this;\n // Collect present fields\n for (var i = 0; i < this.oneof.length; ++i) {\n var field = parent.get(this.oneof[i]);\n if (field && !field.partOf) {\n field.partOf = self;\n self.fieldsArray.push(field);\n }\n }\n // Add not yet present fields\n addFieldsToParent(this);\n};\n\n/**\n * @override\n */\nOneOf.prototype.onRemove = function onRemove(parent) {\n for (var i = 0, field; i < this.fieldsArray.length; ++i)\n if ((field = this.fieldsArray[i]).parent)\n field.parent.remove(field);\n ReflectionObject.prototype.onRemove.call(this, parent);\n};\n\n/**\n * Determines whether this field corresponds to a synthetic oneof created for\n * a proto3 optional field. No behavioral logic should depend on this, but it\n * can be relevant for reflection.\n * @name OneOf#isProto3Optional\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(OneOf.prototype, \"isProto3Optional\", {\n get: function() {\n if (this.fieldsArray == null || this.fieldsArray.length !== 1) {\n return false;\n }\n\n var field = this.fieldsArray[0];\n return field.options != null && field.options[\"proto3_optional\"] === true;\n }\n});\n\n/**\n * Decorator function as returned by {@link OneOf.d} (TypeScript).\n * @typedef OneOfDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} oneofName OneOf name\n * @returns {undefined}\n */\n\n/**\n * OneOf decorator (TypeScript).\n * @function\n * @param {...string} fieldNames Field names\n * @returns {OneOfDecorator} Decorator function\n * @template T extends string\n */\nOneOf.d = function decorateOneOf() {\n var fieldNames = new Array(arguments.length),\n index = 0;\n while (index < arguments.length)\n fieldNames[index] = arguments[index++];\n return function oneOfDecorator(prototype, oneofName) {\n util.decorateType(prototype.constructor)\n .add(new OneOf(oneofName, fieldNames));\n Object.defineProperty(prototype, oneofName, {\n get: util.oneOfGetter(fieldNames),\n set: util.oneOfSetter(fieldNames)\n });\n };\n};\n","\"use strict\";\nmodule.exports = LongBits;\n\nvar util = require(\"../util/minimal\");\n\n/**\n * Constructs new long bits.\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @constructor\n * @param {number} lo Low 32 bits, unsigned\n * @param {number} hi High 32 bits, unsigned\n */\nfunction LongBits(lo, hi) {\n\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 /**\n * Low bits.\n * @type {number}\n */\n this.lo = lo >>> 0;\n\n /**\n * High bits.\n * @type {number}\n */\n this.hi = hi >>> 0;\n}\n\n/**\n * Zero bits.\n * @memberof util.LongBits\n * @type {util.LongBits}\n */\nvar zero = LongBits.zero = new LongBits(0, 0);\n\nzero.toNumber = function() { return 0; };\nzero.zzEncode = zero.zzDecode = function() { return this; };\nzero.length = function() { return 1; };\n\n/**\n * Zero hash.\n * @memberof util.LongBits\n * @type {string}\n */\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\n\n/**\n * Constructs new long bits from the specified number.\n * @param {number} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.fromNumber = function fromNumber(value) {\n if (value === 0)\n return zero;\n var sign = value < 0;\n if (sign)\n value = -value;\n var lo = value >>> 0,\n 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 return new LongBits(lo, hi);\n};\n\n/**\n * Constructs new long bits from a number, long or string.\n * @param {Long|number|string} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.from = function from(value) {\n if (typeof value === \"number\")\n return LongBits.fromNumber(value);\n if (util.isString(value)) {\n /* istanbul ignore else */\n if (util.Long)\n value = util.Long.fromString(value);\n else\n return LongBits.fromNumber(parseInt(value, 10));\n }\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n};\n\n/**\n * Converts this long bits to a possibly unsafe JavaScript number.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {number} Possibly unsafe number\n */\nLongBits.prototype.toNumber = function toNumber(unsigned) {\n if (!unsigned && this.hi >>> 31) {\n var lo = ~this.lo + 1 >>> 0,\n hi = ~this.hi >>> 0;\n if (!lo)\n hi = hi + 1 >>> 0;\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n};\n\n/**\n * Converts this long bits to a long.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long} Long\n */\nLongBits.prototype.toLong = function toLong(unsigned) {\n return util.Long\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\n /* istanbul ignore next */\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\n};\n\nvar charCodeAt = String.prototype.charCodeAt;\n\n/**\n * Constructs new long bits from the specified 8 characters long hash.\n * @param {string} hash Hash\n * @returns {util.LongBits} Bits\n */\nLongBits.fromHash = function fromHash(hash) {\n if (hash === zeroHash)\n return zero;\n return new LongBits(\n ( charCodeAt.call(hash, 0)\n | charCodeAt.call(hash, 1) << 8\n | charCodeAt.call(hash, 2) << 16\n | charCodeAt.call(hash, 3) << 24) >>> 0\n ,\n ( charCodeAt.call(hash, 4)\n | charCodeAt.call(hash, 5) << 8\n | charCodeAt.call(hash, 6) << 16\n | charCodeAt.call(hash, 7) << 24) >>> 0\n );\n};\n\n/**\n * Converts this long bits to a 8 characters long hash.\n * @returns {string} Hash\n */\nLongBits.prototype.toHash = function toHash() {\n return String.fromCharCode(\n this.lo & 255,\n this.lo >>> 8 & 255,\n this.lo >>> 16 & 255,\n this.lo >>> 24 ,\n this.hi & 255,\n this.hi >>> 8 & 255,\n this.hi >>> 16 & 255,\n this.hi >>> 24\n );\n};\n\n/**\n * Zig-zag encodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzEncode = function zzEncode() {\n var 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/**\n * Zig-zag decodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzDecode = function zzDecode() {\n var 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/**\n * Calculates the length of this longbits when encoded as a varint.\n * @returns {number} Length\n */\nLongBits.prototype.length = function length() {\n var part0 = this.lo,\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\n 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","// full library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index\");\n","\"use strict\";\nmodule.exports = Message;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new message instance.\n * @classdesc Abstract runtime message.\n * @constructor\n * @param {Properties} [properties] Properties to set\n * @template T extends object = object\n */\nfunction Message(properties) {\n // not used internally\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n this[keys[i]] = properties[keys[i]];\n}\n\n/**\n * Reference to the reflected type.\n * @name Message.$type\n * @type {Type}\n * @readonly\n */\n\n/**\n * Reference to the reflected type.\n * @name Message#$type\n * @type {Type}\n * @readonly\n */\n\n/*eslint-disable valid-jsdoc*/\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.create = function create(properties) {\n return this.$type.create(properties);\n};\n\n/**\n * Encodes a message of this type.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encode = function encode(message, writer) {\n return this.$type.encode(message, writer);\n};\n\n/**\n * Encodes a message of this type preceeded by its length as a varint.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encodeDelimited = function encodeDelimited(message, writer) {\n return this.$type.encodeDelimited(message, writer);\n};\n\n/**\n * Decodes a message of this type.\n * @name Message.decode\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decode = function decode(reader) {\n return this.$type.decode(reader);\n};\n\n/**\n * Decodes a message of this type preceeded by its length as a varint.\n * @name Message.decodeDelimited\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decodeDelimited = function decodeDelimited(reader) {\n return this.$type.decodeDelimited(reader);\n};\n\n/**\n * Verifies a message of this type.\n * @name Message.verify\n * @function\n * @param {Object.} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\nMessage.verify = function verify(message) {\n return this.$type.verify(message);\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object\n * @returns {T} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.fromObject = function fromObject(object) {\n return this.$type.fromObject(object);\n};\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {T} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @template T extends Message\n * @this Constructor\n */\nMessage.toObject = function toObject(message, options) {\n return this.$type.toObject(message, options);\n};\n\n/**\n * Converts this message to JSON.\n * @returns {Object.} JSON object\n */\nMessage.prototype.toJSON = function toJSON() {\n return this.$type.toObject(this, util.toJSONOptions);\n};\n\n/*eslint-enable valid-jsdoc*/","\"use strict\";\nmodule.exports = BufferReader;\n\n// extends Reader\nvar Reader = require(\"./reader\");\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer reader instance.\n * @classdesc Wire format reader using node buffers.\n * @extends Reader\n * @constructor\n * @param {Buffer} buffer Buffer to read from\n */\nfunction BufferReader(buffer) {\n Reader.call(this, buffer);\n\n /**\n * Read buffer.\n * @name BufferReader#buf\n * @type {Buffer}\n */\n}\n\nBufferReader._configure = function () {\n /* istanbul ignore else */\n if (util.Buffer)\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\n};\n\n\n/**\n * @override\n */\nBufferReader.prototype.string = function read_string_buffer() {\n var len = this.uint32(); // modifies pos\n return this.buf.utf8Slice\n ? this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len))\n : this.buf.toString(\"utf-8\", this.pos, this.pos = Math.min(this.pos + len, this.len));\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @name BufferReader#bytes\n * @function\n * @returns {Buffer} Value read\n */\n\nBufferReader._configure();\n","\"use strict\";\n\n/**\n * Various utility functions.\n * @namespace\n */\nvar util = module.exports = require(\"./util/minimal\");\n\nvar roots = require(\"./roots\");\n\nvar Type, // cyclic\n Enum;\n\nutil.codegen = require(\"@protobufjs/codegen\");\nutil.fetch = require(\"@protobufjs/fetch\");\nutil.path = require(\"@protobufjs/path\");\n\n/**\n * Node's fs module if available.\n * @type {Object.}\n */\nutil.fs = util.inquire(\"fs\");\n\n/**\n * Converts an object's values to an array.\n * @param {Object.} object Object to convert\n * @returns {Array.<*>} Converted array\n */\nutil.toArray = function toArray(object) {\n if (object) {\n var keys = Object.keys(object),\n array = new Array(keys.length),\n index = 0;\n while (index < keys.length)\n array[index] = object[keys[index++]];\n return array;\n }\n return [];\n};\n\n/**\n * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values.\n * @param {Array.<*>} array Array to convert\n * @returns {Object.} Converted object\n */\nutil.toObject = function toObject(array) {\n var object = {},\n index = 0;\n while (index < array.length) {\n var key = array[index++],\n val = array[index++];\n if (val !== undefined)\n object[key] = val;\n }\n return object;\n};\n\nvar safePropBackslashRe = /\\\\/g,\n safePropQuoteRe = /\"/g;\n\n/**\n * Tests whether the specified name is a reserved word in JS.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nutil.isReserved = function isReserved(name) {\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);\n};\n\n/**\n * Returns a safe property accessor for the specified property name.\n * @param {string} prop Property name\n * @returns {string} Safe accessor\n */\nutil.safeProp = function safeProp(prop) {\n if (!/^[$\\w_]+$/.test(prop) || util.isReserved(prop))\n return \"[\\\"\" + prop.replace(safePropBackslashRe, \"\\\\\\\\\").replace(safePropQuoteRe, \"\\\\\\\"\") + \"\\\"]\";\n return \".\" + prop;\n};\n\n/**\n * Converts the first character of a string to upper case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.ucFirst = function ucFirst(str) {\n return str.charAt(0).toUpperCase() + str.substring(1);\n};\n\nvar camelCaseRe = /_([a-z])/g;\n\n/**\n * Converts a string to camel case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.camelCase = function camelCase(str) {\n return str.substring(0, 1)\n + str.substring(1)\n .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); });\n};\n\n/**\n * Compares reflected fields by id.\n * @param {Field} a First field\n * @param {Field} b Second field\n * @returns {number} Comparison value\n */\nutil.compareFieldsById = function compareFieldsById(a, b) {\n return a.id - b.id;\n};\n\n/**\n * Decorator helper for types (TypeScript).\n * @param {Constructor} ctor Constructor function\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {Type} Reflected type\n * @template T extends Message\n * @property {Root} root Decorators root\n */\nutil.decorateType = function decorateType(ctor, typeName) {\n\n /* istanbul ignore if */\n if (ctor.$type) {\n if (typeName && ctor.$type.name !== typeName) {\n util.decorateRoot.remove(ctor.$type);\n ctor.$type.name = typeName;\n util.decorateRoot.add(ctor.$type);\n }\n return ctor.$type;\n }\n\n /* istanbul ignore next */\n if (!Type)\n Type = require(\"./type\");\n\n var type = new Type(typeName || ctor.name);\n util.decorateRoot.add(type);\n type.ctor = ctor; // sets up .encode, .decode etc.\n Object.defineProperty(ctor, \"$type\", { value: type, enumerable: false });\n Object.defineProperty(ctor.prototype, \"$type\", { value: type, enumerable: false });\n return type;\n};\n\nvar decorateEnumIndex = 0;\n\n/**\n * Decorator helper for enums (TypeScript).\n * @param {Object} object Enum object\n * @returns {Enum} Reflected enum\n */\nutil.decorateEnum = function decorateEnum(object) {\n\n /* istanbul ignore if */\n if (object.$type)\n return object.$type;\n\n /* istanbul ignore next */\n if (!Enum)\n Enum = require(\"./enum\");\n\n var enm = new Enum(\"Enum\" + decorateEnumIndex++, object);\n util.decorateRoot.add(enm);\n Object.defineProperty(object, \"$type\", { value: enm, enumerable: false });\n return enm;\n};\n\n\n/**\n * Sets the value of a property by property path. If a value already exists, it is turned to an array\n * @param {Object.} dst Destination object\n * @param {string} path dot '.' delimited path of the property to set\n * @param {Object} value the value to set\n * @param {boolean|undefined} [ifNotSet] Sets the option only if it isn't currently set\n * @returns {Object.} Destination object\n */\nutil.setProperty = function setProperty(dst, path, value, ifNotSet) {\n function setProp(dst, path, value) {\n var part = path.shift();\n if (part === \"__proto__\" || part === \"prototype\") {\n return dst;\n }\n if (path.length > 0) {\n dst[part] = setProp(dst[part] || {}, path, value);\n } else {\n var prevValue = dst[part];\n if (prevValue && ifNotSet)\n return dst;\n if (prevValue)\n value = [].concat(prevValue).concat(value);\n dst[part] = value;\n }\n return dst;\n }\n\n if (typeof dst !== \"object\")\n throw TypeError(\"dst must be an object\");\n if (!path)\n throw TypeError(\"path must be specified\");\n\n path = path.split(\".\");\n return setProp(dst, path, value);\n};\n\n/**\n * Decorator root (TypeScript).\n * @name util.decorateRoot\n * @type {Root}\n * @readonly\n */\nObject.defineProperty(util, \"decorateRoot\", {\n get: function() {\n return roots[\"decorated\"] || (roots[\"decorated\"] = new (require(\"./root\"))());\n }\n});\n","\"use strict\";\nmodule.exports = Writer;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferWriter; // cyclic\n\nvar LongBits = util.LongBits,\n base64 = util.base64,\n utf8 = util.utf8;\n\n/**\n * Constructs a new writer operation instance.\n * @classdesc Scheduled writer operation.\n * @constructor\n * @param {function(*, Uint8Array, number)} fn Function to call\n * @param {number} len Value byte length\n * @param {*} val Value to write\n * @ignore\n */\nfunction Op(fn, len, val) {\n\n /**\n * Function to call.\n * @type {function(Uint8Array, number, *)}\n */\n this.fn = fn;\n\n /**\n * Value byte length.\n * @type {number}\n */\n this.len = len;\n\n /**\n * Next operation.\n * @type {Writer.Op|undefined}\n */\n this.next = undefined;\n\n /**\n * Value to write.\n * @type {*}\n */\n this.val = val; // type varies\n}\n\n/* istanbul ignore next */\nfunction noop() {} // eslint-disable-line no-empty-function\n\n/**\n * Constructs a new writer state instance.\n * @classdesc Copied writer state.\n * @memberof Writer\n * @constructor\n * @param {Writer} writer Writer to copy state from\n * @ignore\n */\nfunction State(writer) {\n\n /**\n * Current head.\n * @type {Writer.Op}\n */\n this.head = writer.head;\n\n /**\n * Current tail.\n * @type {Writer.Op}\n */\n this.tail = writer.tail;\n\n /**\n * Current buffer length.\n * @type {number}\n */\n this.len = writer.len;\n\n /**\n * Next state.\n * @type {State|null}\n */\n this.next = writer.states;\n}\n\n/**\n * Constructs a new writer instance.\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n */\nfunction Writer() {\n\n /**\n * Current length.\n * @type {number}\n */\n this.len = 0;\n\n /**\n * Operations head.\n * @type {Object}\n */\n this.head = new Op(noop, 0, 0);\n\n /**\n * Operations tail\n * @type {Object}\n */\n this.tail = this.head;\n\n /**\n * Linked forked states.\n * @type {Object|null}\n */\n this.states = null;\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}\n\nvar create = function create() {\n return util.Buffer\n ? function create_buffer_setup() {\n return (Writer.create = function create_buffer() {\n return new BufferWriter();\n })();\n }\n /* istanbul ignore next */\n : function create_array() {\n return new Writer();\n };\n};\n\n/**\n * Creates a new writer.\n * @function\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\n */\nWriter.create = create();\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Uint8Array} Buffer\n */\nWriter.alloc = function alloc(size) {\n return new util.Array(size);\n};\n\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\n/* istanbul ignore else */\nif (util.Array !== Array)\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\n\n/**\n * Pushes a new operation to the queue.\n * @param {function(Uint8Array, number, *)} fn Function to call\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @returns {Writer} `this`\n * @private\n */\nWriter.prototype._push = function push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n};\n\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\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/**\n * Constructs a new varint writer operation instance.\n * @classdesc Scheduled varint writer operation.\n * @extends Op\n * @constructor\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @ignore\n */\nfunction VarintOp(len, val) {\n this.len = len;\n this.next = undefined;\n this.val = val;\n}\n\nVarintOp.prototype = Object.create(Op.prototype);\nVarintOp.prototype.fn = writeVarint32;\n\n/**\n * Writes an unsigned 32 bit value as a varint.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.uint32 = function write_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(\n (value = value >>> 0)\n < 128 ? 1\n : value < 16384 ? 2\n : value < 2097152 ? 3\n : value < 268435456 ? 4\n : 5,\n value)).len;\n return this;\n};\n\n/**\n * Writes a signed 32 bit value as a varint.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.int32 = function write_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/**\n * Writes a 32 bit value as a varint, zig-zag encoded.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sint32 = function write_sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n};\n\nfunction writeVarint64(val, buf, pos) {\n while (val.hi) {\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}\n\n/**\n * Writes an unsigned 64 bit value as a varint.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.uint64 = function write_uint64(value) {\n var bits = LongBits.from(value);\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a signed 64 bit value as a varint.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.int64 = Writer.prototype.uint64;\n\n/**\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sint64 = function write_sint64(value) {\n var bits = LongBits.from(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a boolish value as a varint.\n * @param {boolean} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bool = function write_bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n};\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}\n\n/**\n * Writes an unsigned 32 bit value as fixed 32 bits.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.fixed32 = function write_fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n};\n\n/**\n * Writes a signed 32 bit value as fixed 32 bits.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\n\n/**\n * Writes an unsigned 64 bit value as fixed 64 bits.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.fixed64 = function write_fixed64(value) {\n var bits = LongBits.from(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n};\n\n/**\n * Writes a signed 64 bit value as fixed 64 bits.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\n\n/**\n * Writes a float (32 bit).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.float = function write_float(value) {\n return this._push(util.float.writeFloatLE, 4, value);\n};\n\n/**\n * Writes a double (64 bit float).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.double = function write_double(value) {\n return this._push(util.float.writeDoubleLE, 8, value);\n};\n\nvar writeBytes = util.Array.prototype.set\n ? function writeBytes_set(val, buf, pos) {\n buf.set(val, pos); // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytes_for(val, buf, pos) {\n for (var i = 0; i < val.length; ++i)\n buf[pos + i] = val[i];\n };\n\n/**\n * Writes a sequence of bytes.\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bytes = function write_bytes(value) {\n var len = value.length >>> 0;\n if (!len)\n return this._push(writeByte, 1, 0);\n if (util.isString(value)) {\n var buf = Writer.alloc(len = base64.length(value));\n base64.decode(value, buf, 0);\n value = buf;\n }\n return this.uint32(len)._push(writeBytes, len, value);\n};\n\n/**\n * Writes a string.\n * @param {string} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.string = function write_string(value) {\n var len = utf8.length(value);\n return len\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n};\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 * @returns {Writer} `this`\n */\nWriter.prototype.fork = function 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/**\n * Resets this instance to the last state.\n * @returns {Writer} `this`\n */\nWriter.prototype.reset = function reset() {\n if (this.states) {\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 } else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n};\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 * @returns {Writer} `this`\n */\nWriter.prototype.ldelim = function ldelim() {\n var head = this.head,\n tail = this.tail,\n len = this.len;\n this.reset().uint32(len);\n if (len) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n};\n\n/**\n * Finishes the write operation.\n * @returns {Uint8Array} Finished buffer\n */\nWriter.prototype.finish = function finish() {\n var head = this.head.next, // skip noop\n buf = this.constructor.alloc(this.len),\n pos = 0;\n while (head) {\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\nWriter._configure = function(BufferWriter_) {\n BufferWriter = BufferWriter_;\n Writer.create = create();\n BufferWriter._configure();\n};\n","\"use strict\";\nvar util = exports;\n\n// used to return a Promise where callback is omitted\nutil.asPromise = require(\"@protobufjs/aspromise\");\n\n// converts to / from base64 encoded strings\nutil.base64 = require(\"@protobufjs/base64\");\n\n// base class of rpc.Service\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\n\n// float handling accross browsers\nutil.float = require(\"@protobufjs/float\");\n\n// requires modules optionally and hides the call from bundlers\nutil.inquire = require(\"@protobufjs/inquire\");\n\n// converts to / from utf8 encoded strings\nutil.utf8 = require(\"@protobufjs/utf8\");\n\n// provides a node-like buffer pool in the browser\nutil.pool = require(\"@protobufjs/pool\");\n\n// utility to work with the low and high bits of a 64 bit value\nutil.LongBits = require(\"./longbits\");\n\n/**\n * Whether running within node or not.\n * @memberof util\n * @type {boolean}\n */\nutil.isNode = Boolean(typeof global !== \"undefined\"\n && global\n && global.process\n && global.process.versions\n && global.process.versions.node);\n\n/**\n * Global object reference.\n * @memberof util\n * @type {Object}\n */\nutil.global = util.isNode && global\n || typeof window !== \"undefined\" && window\n || typeof self !== \"undefined\" && self\n || this; // eslint-disable-line no-invalid-this\n\n/**\n * An immuable empty array.\n * @memberof util\n * @type {Array.<*>}\n * @const\n */\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\n\n/**\n * An immutable empty object.\n * @type {Object}\n * @const\n */\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\n\n/**\n * Tests if the specified value is an integer.\n * @function\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is an integer\n */\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\n};\n\n/**\n * Tests if the specified value is a string.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a string\n */\nutil.isString = function isString(value) {\n return typeof value === \"string\" || value instanceof String;\n};\n\n/**\n * Tests if the specified value is a non-null object.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a non-null object\n */\nutil.isObject = function isObject(value) {\n return value && typeof value === \"object\";\n};\n\n/**\n * Checks if a property on a message is considered to be present.\n * This is an alias of {@link util.isSet}.\n * @function\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isset =\n\n/**\n * Checks if a property on a message is considered to be present.\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isSet = function isSet(obj, prop) {\n var value = obj[prop];\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\n return false;\n};\n\n/**\n * Any compatible Buffer instance.\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\n * @interface Buffer\n * @extends Uint8Array\n */\n\n/**\n * Node's Buffer class if available.\n * @type {Constructor}\n */\nutil.Buffer = (function() {\n try {\n var Buffer = util.inquire(\"buffer\").Buffer;\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\n } catch (e) {\n /* istanbul ignore next */\n return null;\n }\n})();\n\n// Internal alias of or polyfull for Buffer.from.\nutil._Buffer_from = null;\n\n// Internal alias of or polyfill for Buffer.allocUnsafe.\nutil._Buffer_allocUnsafe = null;\n\n/**\n * Creates a new buffer of whatever type supported by the environment.\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\n * @returns {Uint8Array|Buffer} Buffer\n */\nutil.newBuffer = function newBuffer(sizeOrArray) {\n /* istanbul ignore next */\n return typeof sizeOrArray === \"number\"\n ? util.Buffer\n ? util._Buffer_allocUnsafe(sizeOrArray)\n : new util.Array(sizeOrArray)\n : util.Buffer\n ? util._Buffer_from(sizeOrArray)\n : typeof Uint8Array === \"undefined\"\n ? sizeOrArray\n : new Uint8Array(sizeOrArray);\n};\n\n/**\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\n * @type {Constructor}\n */\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\n\n/**\n * Any compatible Long instance.\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\n * @interface Long\n * @property {number} low Low bits\n * @property {number} high High bits\n * @property {boolean} unsigned Whether unsigned or not\n */\n\n/**\n * Long.js's Long class if available.\n * @type {Constructor}\n */\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\n || /* istanbul ignore next */ util.global.Long\n || util.inquire(\"long\");\n\n/**\n * Regular expression used to verify 2 bit (`bool`) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key2Re = /^true|false|0|1$/;\n\n/**\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\n\n/**\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\n\n/**\n * Converts a number or long to an 8 characters long hash string.\n * @param {Long|number} value Value to convert\n * @returns {string} Hash\n */\nutil.longToHash = function longToHash(value) {\n return value\n ? util.LongBits.from(value).toHash()\n : util.LongBits.zeroHash;\n};\n\n/**\n * Converts an 8 characters long hash string to a long or number.\n * @param {string} hash Hash\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long|number} Original value\n */\nutil.longFromHash = function longFromHash(hash, unsigned) {\n var bits = util.LongBits.fromHash(hash);\n if (util.Long)\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\n return bits.toNumber(Boolean(unsigned));\n};\n\n/**\n * Merges the properties of the source object into the destination object.\n * @memberof util\n * @param {Object.} dst Destination object\n * @param {Object.} src Source object\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\n * @returns {Object.} Destination object\n */\nfunction merge(dst, src, ifNotSet) { // used by converters\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\n if (dst[keys[i]] === undefined || !ifNotSet)\n dst[keys[i]] = src[keys[i]];\n return dst;\n}\n\nutil.merge = merge;\n\n/**\n * Converts the first character of a string to lower case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.lcFirst = function lcFirst(str) {\n return str.charAt(0).toLowerCase() + str.substring(1);\n};\n\n/**\n * Creates a custom error constructor.\n * @memberof util\n * @param {string} name Error name\n * @returns {Constructor} Custom error constructor\n */\nfunction newError(name) {\n\n function CustomError(message, properties) {\n\n if (!(this instanceof CustomError))\n return new CustomError(message, properties);\n\n // Error.call(this, message);\n // ^ just returns a new error instance because the ctor can be called as a function\n\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\n\n /* istanbul ignore next */\n if (Error.captureStackTrace) // node\n Error.captureStackTrace(this, CustomError);\n else\n Object.defineProperty(this, \"stack\", { value: new Error().stack || \"\" });\n\n if (properties)\n merge(this, properties);\n }\n\n CustomError.prototype = Object.create(Error.prototype, {\n constructor: {\n value: CustomError,\n writable: true,\n enumerable: false,\n configurable: true,\n },\n name: {\n get: function get() { return name; },\n set: undefined,\n enumerable: false,\n // configurable: false would accurately preserve the behavior of\n // the original, but I'm guessing that was not intentional.\n // For an actual error subclass, this property would\n // be configurable.\n configurable: true,\n },\n toString: {\n value: function value() { return this.name + \": \" + this.message; },\n writable: true,\n enumerable: false,\n configurable: true,\n },\n });\n\n return CustomError;\n}\n\nutil.newError = newError;\n\n/**\n * Constructs a new protocol error.\n * @classdesc Error subclass indicating a protocol specifc error.\n * @memberof util\n * @extends Error\n * @template T extends Message\n * @constructor\n * @param {string} message Error message\n * @param {Object.} [properties] Additional properties\n * @example\n * try {\n * MyMessage.decode(someBuffer); // throws if required fields are missing\n * } catch (e) {\n * if (e instanceof ProtocolError && e.instance)\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\n * }\n */\nutil.ProtocolError = newError(\"ProtocolError\");\n\n/**\n * So far decoded message instance.\n * @name util.ProtocolError#instance\n * @type {Message}\n */\n\n/**\n * A OneOf getter as returned by {@link util.oneOfGetter}.\n * @typedef OneOfGetter\n * @type {function}\n * @returns {string|undefined} Set field name, if any\n */\n\n/**\n * Builds a getter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfGetter} Unbound getter\n */\nutil.oneOfGetter = function getOneOf(fieldNames) {\n var fieldMap = {};\n for (var i = 0; i < fieldNames.length; ++i)\n fieldMap[fieldNames[i]] = 1;\n\n /**\n * @returns {string|undefined} Set field name, if any\n * @this Object\n * @ignore\n */\n return function() { // eslint-disable-line consistent-return\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\n return keys[i];\n };\n};\n\n/**\n * A OneOf setter as returned by {@link util.oneOfSetter}.\n * @typedef OneOfSetter\n * @type {function}\n * @param {string|undefined} value Field name\n * @returns {undefined}\n */\n\n/**\n * Builds a setter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfSetter} Unbound setter\n */\nutil.oneOfSetter = function setOneOf(fieldNames) {\n\n /**\n * @param {string} name Field name\n * @returns {undefined}\n * @this Object\n * @ignore\n */\n return function(name) {\n for (var i = 0; i < fieldNames.length; ++i)\n if (fieldNames[i] !== name)\n delete this[fieldNames[i]];\n };\n};\n\n/**\n * Default conversion options used for {@link Message#toJSON} implementations.\n *\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:\n *\n * - Longs become strings\n * - Enums become string keys\n * - Bytes become base64 encoded strings\n * - (Sub-)Messages become plain objects\n * - Maps become plain objects with all string keys\n * - Repeated fields become arrays\n * - NaN and Infinity for float and double fields become strings\n *\n * @type {IConversionOptions}\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\n */\nutil.toJSONOptions = {\n longs: String,\n enums: String,\n bytes: String,\n json: true\n};\n\n// Sets up buffer utility according to the environment (called in index-minimal)\nutil._configure = function() {\n var Buffer = util.Buffer;\n /* istanbul ignore if */\n if (!Buffer) {\n util._Buffer_from = util._Buffer_allocUnsafe = null;\n return;\n }\n // because node 4.x buffers are incompatible & immutable\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\n /* istanbul ignore next */\n function Buffer_from(value, encoding) {\n return new Buffer(value, encoding);\n };\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\n /* istanbul ignore next */\n function Buffer_allocUnsafe(size) {\n return new Buffer(size);\n };\n};\n","function RetryOperation(timeouts, options) {\n // Compatibility for the old (timeouts, retryForever) signature\n if (typeof options === 'boolean') {\n options = { forever: options };\n }\n\n this._originalTimeouts = JSON.parse(JSON.stringify(timeouts));\n this._timeouts = timeouts;\n this._options = options || {};\n this._maxRetryTime = options && options.maxRetryTime || Infinity;\n this._fn = null;\n this._errors = [];\n this._attempts = 1;\n this._operationTimeout = null;\n this._operationTimeoutCb = null;\n this._timeout = null;\n this._operationStart = null;\n this._timer = null;\n\n if (this._options.forever) {\n this._cachedTimeouts = this._timeouts.slice(0);\n }\n}\nmodule.exports = RetryOperation;\n\nRetryOperation.prototype.reset = function() {\n this._attempts = 1;\n this._timeouts = this._originalTimeouts.slice(0);\n}\n\nRetryOperation.prototype.stop = function() {\n if (this._timeout) {\n clearTimeout(this._timeout);\n }\n if (this._timer) {\n clearTimeout(this._timer);\n }\n\n this._timeouts = [];\n this._cachedTimeouts = null;\n};\n\nRetryOperation.prototype.retry = function(err) {\n if (this._timeout) {\n clearTimeout(this._timeout);\n }\n\n if (!err) {\n return false;\n }\n var currentTime = new Date().getTime();\n if (err && currentTime - this._operationStart >= this._maxRetryTime) {\n this._errors.push(err);\n this._errors.unshift(new Error('RetryOperation timeout occurred'));\n return false;\n }\n\n this._errors.push(err);\n\n var timeout = this._timeouts.shift();\n if (timeout === undefined) {\n if (this._cachedTimeouts) {\n // retry forever, only keep last error\n this._errors.splice(0, this._errors.length - 1);\n timeout = this._cachedTimeouts.slice(-1);\n } else {\n return false;\n }\n }\n\n var self = this;\n this._timer = setTimeout(function() {\n self._attempts++;\n\n if (self._operationTimeoutCb) {\n self._timeout = setTimeout(function() {\n self._operationTimeoutCb(self._attempts);\n }, self._operationTimeout);\n\n if (self._options.unref) {\n self._timeout.unref();\n }\n }\n\n self._fn(self._attempts);\n }, timeout);\n\n if (this._options.unref) {\n this._timer.unref();\n }\n\n return true;\n};\n\nRetryOperation.prototype.attempt = function(fn, timeoutOps) {\n this._fn = fn;\n\n if (timeoutOps) {\n if (timeoutOps.timeout) {\n this._operationTimeout = timeoutOps.timeout;\n }\n if (timeoutOps.cb) {\n this._operationTimeoutCb = timeoutOps.cb;\n }\n }\n\n var self = this;\n if (this._operationTimeoutCb) {\n this._timeout = setTimeout(function() {\n self._operationTimeoutCb();\n }, self._operationTimeout);\n }\n\n this._operationStart = new Date().getTime();\n\n this._fn(this._attempts);\n};\n\nRetryOperation.prototype.try = function(fn) {\n console.log('Using RetryOperation.try() is deprecated');\n this.attempt(fn);\n};\n\nRetryOperation.prototype.start = function(fn) {\n console.log('Using RetryOperation.start() is deprecated');\n this.attempt(fn);\n};\n\nRetryOperation.prototype.start = RetryOperation.prototype.try;\n\nRetryOperation.prototype.errors = function() {\n return this._errors;\n};\n\nRetryOperation.prototype.attempts = function() {\n return this._attempts;\n};\n\nRetryOperation.prototype.mainError = function() {\n if (this._errors.length === 0) {\n return null;\n }\n\n var counts = {};\n var mainError = null;\n var mainErrorCount = 0;\n\n for (var i = 0; i < this._errors.length; i++) {\n var error = this._errors[i];\n var message = error.message;\n var count = (counts[message] || 0) + 1;\n\n counts[message] = count;\n\n if (count >= mainErrorCount) {\n mainError = error;\n mainErrorCount = count;\n }\n }\n\n return mainError;\n};\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\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\";\nvar protobuf = exports;\n\n/**\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\n * @name build\n * @type {string}\n * @const\n */\nprotobuf.build = \"minimal\";\n\n// Serialization\nprotobuf.Writer = require(\"./writer\");\nprotobuf.BufferWriter = require(\"./writer_buffer\");\nprotobuf.Reader = require(\"./reader\");\nprotobuf.BufferReader = require(\"./reader_buffer\");\n\n// Utility\nprotobuf.util = require(\"./util/minimal\");\nprotobuf.rpc = require(\"./rpc\");\nprotobuf.roots = require(\"./roots\");\nprotobuf.configure = configure;\n\n/* istanbul ignore next */\n/**\n * Reconfigures the library according to the environment.\n * @returns {undefined}\n */\nfunction configure() {\n protobuf.util._configure();\n protobuf.Writer._configure(protobuf.BufferWriter);\n protobuf.Reader._configure(protobuf.BufferReader);\n}\n\n// Set up buffer utility according to the environment\nconfigure();\n","\"use strict\";\nmodule.exports = {};\n\n/**\n * Named roots.\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\n * Can also be used manually to make roots available across modules.\n * @name roots\n * @type {Object.}\n * @example\n * // pbjs -r myroot -o compiled.js ...\n *\n * // in another module:\n * require(\"./compiled.js\");\n *\n * // in any subsequent module:\n * var root = protobuf.roots[\"myroot\"];\n */\n","\"use strict\";\nmodule.exports = parse;\n\nparse.filename = null;\nparse.defaults = { keepCase: false };\n\nvar tokenize = require(\"./tokenize\"),\n Root = require(\"./root\"),\n Type = require(\"./type\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n OneOf = require(\"./oneof\"),\n Enum = require(\"./enum\"),\n Service = require(\"./service\"),\n Method = require(\"./method\"),\n ReflectionObject = require(\"./object\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar base10Re = /^[1-9][0-9]*$/,\n base10NegRe = /^-?[1-9][0-9]*$/,\n base16Re = /^0[x][0-9a-fA-F]+$/,\n base16NegRe = /^-?0[x][0-9a-fA-F]+$/,\n base8Re = /^0[0-7]+$/,\n base8NegRe = /^-?0[0-7]+$/,\n numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,\n nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/,\n typeRefRe = /^(?:\\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)*$/;\n\n/**\n * Result object returned from {@link parse}.\n * @interface IParserResult\n * @property {string|undefined} package Package name, if declared\n * @property {string[]|undefined} imports Imports, if any\n * @property {string[]|undefined} weakImports Weak imports, if any\n * @property {Root} root Populated root instance\n */\n\n/**\n * Options modifying the behavior of {@link parse}.\n * @interface IParseOptions\n * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case\n * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments.\n * @property {boolean} [preferTrailingComment=false] Use trailing comment when both leading comment and trailing comment exist.\n */\n\n/**\n * Options modifying the behavior of JSON serialization.\n * @interface IToJSONOptions\n * @property {boolean} [keepComments=false] Serializes comments.\n */\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @param {string} source Source contents\n * @param {Root} root Root to populate\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n */\nfunction parse(source, root, options) {\n /* eslint-disable callback-return */\n if (!(root instanceof Root)) {\n options = root;\n root = new Root();\n }\n if (!options)\n options = parse.defaults;\n\n var preferTrailingComment = options.preferTrailingComment || false;\n var tn = tokenize(source, options.alternateCommentMode || false),\n next = tn.next,\n push = tn.push,\n peek = tn.peek,\n skip = tn.skip,\n cmnt = tn.cmnt;\n\n var head = true,\n pkg,\n imports,\n weakImports,\n edition = \"proto2\";\n\n var ptr = root;\n\n var topLevelObjects = [];\n var topLevelOptions = {};\n\n var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase;\n\n function resolveFileFeatures() {\n topLevelObjects.forEach(obj => {\n obj._edition = edition;\n Object.keys(topLevelOptions).forEach(opt => {\n if (obj.getOption(opt) !== undefined) return;\n obj.setOption(opt, topLevelOptions[opt], true);\n });\n });\n }\n\n /* istanbul ignore next */\n function illegal(token, name, insideTryCatch) {\n var filename = parse.filename;\n if (!insideTryCatch)\n parse.filename = null;\n return Error(\"illegal \" + (name || \"token\") + \" '\" + token + \"' (\" + (filename ? filename + \", \" : \"\") + \"line \" + tn.line + \")\");\n }\n\n function readString() {\n var values = [],\n token;\n do {\n /* istanbul ignore if */\n if ((token = next()) !== \"\\\"\" && token !== \"'\")\n throw illegal(token);\n\n values.push(next());\n skip(token);\n token = peek();\n } while (token === \"\\\"\" || token === \"'\");\n return values.join(\"\");\n }\n\n function readValue(acceptTypeRef) {\n var token = next();\n switch (token) {\n case \"'\":\n case \"\\\"\":\n push(token);\n return readString();\n case \"true\": case \"TRUE\":\n return true;\n case \"false\": case \"FALSE\":\n return false;\n }\n try {\n return parseNumber(token, /* insideTryCatch */ true);\n } catch (e) {\n /* istanbul ignore else */\n if (acceptTypeRef && typeRefRe.test(token))\n return token;\n\n /* istanbul ignore next */\n throw illegal(token, \"value\");\n }\n }\n\n function readRanges(target, acceptStrings) {\n var token, start;\n do {\n if (acceptStrings && ((token = peek()) === \"\\\"\" || token === \"'\")) {\n var str = readString();\n target.push(str);\n if (edition >= 2023) {\n throw illegal(str, \"id\");\n }\n } else {\n try {\n target.push([ start = parseId(next()), skip(\"to\", true) ? parseId(next()) : start ]);\n } catch (err) {\n if (acceptStrings && typeRefRe.test(token) && edition >= 2023) {\n target.push(token);\n } else {\n throw err;\n }\n }\n }\n } while (skip(\",\", true));\n var dummy = {options: undefined};\n dummy.setOption = function(name, value) {\n if (this.options === undefined) this.options = {};\n this.options[name] = value;\n };\n ifBlock(\n dummy,\n function parseRange_block(token) {\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(dummy, token); // skip\n skip(\";\");\n } else\n throw illegal(token);\n },\n function parseRange_line() {\n parseInlineOptions(dummy); // skip\n });\n }\n\n function parseNumber(token, insideTryCatch) {\n var sign = 1;\n if (token.charAt(0) === \"-\") {\n sign = -1;\n token = token.substring(1);\n }\n switch (token) {\n case \"inf\": case \"INF\": case \"Inf\":\n return sign * Infinity;\n case \"nan\": case \"NAN\": case \"Nan\": case \"NaN\":\n return NaN;\n case \"0\":\n return 0;\n }\n if (base10Re.test(token))\n return sign * parseInt(token, 10);\n if (base16Re.test(token))\n return sign * parseInt(token, 16);\n if (base8Re.test(token))\n return sign * parseInt(token, 8);\n\n /* istanbul ignore else */\n if (numberRe.test(token))\n return sign * parseFloat(token);\n\n /* istanbul ignore next */\n throw illegal(token, \"number\", insideTryCatch);\n }\n\n function parseId(token, acceptNegative) {\n switch (token) {\n case \"max\": case \"MAX\": case \"Max\":\n return 536870911;\n case \"0\":\n return 0;\n }\n\n /* istanbul ignore if */\n if (!acceptNegative && token.charAt(0) === \"-\")\n throw illegal(token, \"id\");\n\n if (base10NegRe.test(token))\n return parseInt(token, 10);\n if (base16NegRe.test(token))\n return parseInt(token, 16);\n\n /* istanbul ignore else */\n if (base8NegRe.test(token))\n return parseInt(token, 8);\n\n /* istanbul ignore next */\n throw illegal(token, \"id\");\n }\n\n function parsePackage() {\n /* istanbul ignore if */\n if (pkg !== undefined)\n throw illegal(\"package\");\n\n pkg = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(pkg))\n throw illegal(pkg, \"name\");\n\n ptr = ptr.define(pkg);\n\n skip(\";\");\n }\n\n function parseImport() {\n var token = peek();\n var whichImports;\n switch (token) {\n case \"weak\":\n whichImports = weakImports || (weakImports = []);\n next();\n break;\n case \"public\":\n next();\n // eslint-disable-next-line no-fallthrough\n default:\n whichImports = imports || (imports = []);\n break;\n }\n token = readString();\n skip(\";\");\n whichImports.push(token);\n }\n\n function parseSyntax() {\n skip(\"=\");\n edition = readString();\n\n /* istanbul ignore if */\n if (edition < 2023)\n throw illegal(edition, \"syntax\");\n\n skip(\";\");\n }\n\n function parseEdition() {\n skip(\"=\");\n edition = readString();\n const supportedEditions = [\"2023\"];\n\n /* istanbul ignore if */\n if (!supportedEditions.includes(edition))\n throw illegal(edition, \"edition\");\n\n skip(\";\");\n }\n\n\n function parseCommon(parent, token) {\n switch (token) {\n\n case \"option\":\n parseOption(parent, token);\n skip(\";\");\n return true;\n\n case \"message\":\n parseType(parent, token);\n return true;\n\n case \"enum\":\n parseEnum(parent, token);\n return true;\n\n case \"service\":\n parseService(parent, token);\n return true;\n\n case \"extend\":\n parseExtension(parent, token);\n return true;\n }\n return false;\n }\n\n function ifBlock(obj, fnIf, fnElse) {\n var trailingLine = tn.line;\n if (obj) {\n if(typeof obj.comment !== \"string\") {\n obj.comment = cmnt(); // try block-type comment\n }\n obj.filename = parse.filename;\n }\n if (skip(\"{\", true)) {\n var token;\n while ((token = next()) !== \"}\")\n fnIf(token);\n skip(\";\", true);\n } else {\n if (fnElse)\n fnElse();\n skip(\";\");\n if (obj && (typeof obj.comment !== \"string\" || preferTrailingComment))\n obj.comment = cmnt(trailingLine) || obj.comment; // try line-type comment\n }\n }\n\n function parseType(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"type name\");\n\n var type = new Type(token);\n ifBlock(type, function parseType_block(token) {\n if (parseCommon(type, token))\n return;\n\n switch (token) {\n\n case \"map\":\n parseMapField(type, token);\n break;\n\n case \"required\":\n if (edition !== \"proto2\")\n throw illegal(token);\n /* eslint-disable no-fallthrough */\n case \"repeated\":\n parseField(type, token);\n break;\n\n case \"optional\":\n /* istanbul ignore if */\n if (edition === \"proto3\") {\n parseField(type, \"proto3_optional\");\n } else if (edition !== \"proto2\") {\n throw illegal(token);\n } else {\n parseField(type, \"optional\");\n }\n break;\n\n case \"oneof\":\n parseOneOf(type, token);\n break;\n\n case \"extensions\":\n readRanges(type.extensions || (type.extensions = []));\n break;\n\n case \"reserved\":\n readRanges(type.reserved || (type.reserved = []), true);\n break;\n\n default:\n /* istanbul ignore if */\n if (edition === \"proto2\" || !typeRefRe.test(token)) {\n throw illegal(token);\n }\n\n push(token);\n parseField(type, \"optional\");\n break;\n }\n });\n parent.add(type);\n if (parent === ptr) {\n topLevelObjects.push(type);\n }\n }\n\n function parseField(parent, rule, extend) {\n var type = next();\n if (type === \"group\") {\n parseGroup(parent, rule);\n return;\n }\n // Type names can consume multiple tokens, in multiple variants:\n // package.subpackage field tokens: \"package.subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // package . subpackage field tokens: \"package\" \".\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // package. subpackage field tokens: \"package.\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // package .subpackage field tokens: \"package\" \".subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // Keep reading tokens until we get a type name with no period at the end,\n // and the next token does not start with a period.\n while (type.endsWith(\".\") || peek().startsWith(\".\")) {\n type += next();\n }\n\n /* istanbul ignore if */\n if (!typeRefRe.test(type))\n throw illegal(type, \"type\");\n\n var name = next();\n\n /* istanbul ignore if */\n\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n name = applyCase(name);\n skip(\"=\");\n\n var field = new Field(name, parseId(next()), type, rule, extend);\n\n ifBlock(field, function parseField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseField_line() {\n parseInlineOptions(field);\n });\n\n if (rule === \"proto3_optional\") {\n // for proto3 optional fields, we create a single-member Oneof to mimic \"optional\" behavior\n var oneof = new OneOf(\"_\" + name);\n field.setOption(\"proto3_optional\", true);\n oneof.add(field);\n parent.add(oneof);\n } else {\n parent.add(field);\n }\n if (parent === ptr) {\n topLevelObjects.push(field);\n }\n }\n\n function parseGroup(parent, rule) {\n if (edition >= 2023) {\n throw illegal(\"group\");\n }\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n var fieldName = util.lcFirst(name);\n if (name === fieldName)\n name = util.ucFirst(name);\n skip(\"=\");\n var id = parseId(next());\n var type = new Type(name);\n type.group = true;\n var field = new Field(fieldName, id, name, rule);\n field.filename = parse.filename;\n ifBlock(type, function parseGroup_block(token) {\n switch (token) {\n\n case \"option\":\n parseOption(type, token);\n skip(\";\");\n break;\n case \"required\":\n case \"repeated\":\n parseField(type, token);\n break;\n\n case \"optional\":\n /* istanbul ignore if */\n if (edition === \"proto3\") {\n parseField(type, \"proto3_optional\");\n } else {\n parseField(type, \"optional\");\n }\n break;\n\n case \"message\":\n parseType(type, token);\n break;\n\n case \"enum\":\n parseEnum(type, token);\n break;\n\n /* istanbul ignore next */\n default:\n throw illegal(token); // there are no groups with proto3 semantics\n }\n });\n parent.add(type)\n .add(field);\n }\n\n function parseMapField(parent) {\n skip(\"<\");\n var keyType = next();\n\n /* istanbul ignore if */\n if (types.mapKey[keyType] === undefined)\n throw illegal(keyType, \"type\");\n\n skip(\",\");\n var valueType = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(valueType))\n throw illegal(valueType, \"type\");\n\n skip(\">\");\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n skip(\"=\");\n var field = new MapField(applyCase(name), parseId(next()), keyType, valueType);\n ifBlock(field, function parseMapField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseMapField_line() {\n parseInlineOptions(field);\n });\n parent.add(field);\n }\n\n function parseOneOf(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var oneof = new OneOf(applyCase(token));\n ifBlock(oneof, function parseOneOf_block(token) {\n if (token === \"option\") {\n parseOption(oneof, token);\n skip(\";\");\n } else {\n push(token);\n parseField(oneof, \"optional\");\n }\n });\n parent.add(oneof);\n }\n\n function parseEnum(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var enm = new Enum(token);\n ifBlock(enm, function parseEnum_block(token) {\n switch(token) {\n case \"option\":\n parseOption(enm, token);\n skip(\";\");\n break;\n\n case \"reserved\":\n readRanges(enm.reserved || (enm.reserved = []), true);\n if(enm.reserved === undefined) enm.reserved = [];\n break;\n\n default:\n parseEnumValue(enm, token);\n }\n });\n parent.add(enm);\n if (parent === ptr) {\n topLevelObjects.push(enm);\n }\n }\n\n function parseEnumValue(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token))\n throw illegal(token, \"name\");\n\n skip(\"=\");\n var value = parseId(next(), true),\n dummy = {\n options: undefined\n };\n dummy.getOption = function(name) {\n return this.options[name];\n };\n dummy.setOption = function(name, value) {\n ReflectionObject.prototype.setOption.call(dummy, name, value);\n };\n dummy.setParsedOption = function() {\n return undefined;\n };\n ifBlock(dummy, function parseEnumValue_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(dummy, token); // skip\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseEnumValue_line() {\n parseInlineOptions(dummy); // skip\n });\n parent.add(token, value, dummy.comment, dummy.parsedOptions || dummy.options);\n }\n\n function parseOption(parent, token) {\n var option;\n var propName;\n var isOption = true;\n if (token === \"option\") {\n token = next();\n }\n\n while (token !== \"=\") {\n if (token === \"(\") {\n var parensValue = next();\n skip(\")\");\n token = \"(\" + parensValue + \")\";\n }\n if (isOption) {\n isOption = false;\n if (token.includes(\".\") && !token.includes(\"(\")) {\n var tokens = token.split(\".\");\n option = tokens[0] + \".\";\n token = tokens[1];\n continue;\n }\n option = token;\n } else {\n propName = propName ? propName += token : token;\n }\n token = next();\n }\n var name = propName ? option.concat(propName) : option;\n var optionValue = parseOptionValue(parent, name);\n propName = propName && propName[0] === \".\" ? propName.slice(1) : propName;\n option = option && option[option.length - 1] === \".\" ? option.slice(0, -1) : option;\n setParsedOption(parent, option, optionValue, propName);\n }\n\n function parseOptionValue(parent, name) {\n // { a: \"foo\" b { c: \"bar\" } }\n if (skip(\"{\", true)) {\n var objectResult = {};\n\n while (!skip(\"}\", true)) {\n /* istanbul ignore if */\n if (!nameRe.test(token = next())) {\n throw illegal(token, \"name\");\n }\n if (token === null) {\n throw illegal(token, \"end of input\");\n }\n\n var value;\n var propName = token;\n\n skip(\":\", true);\n\n if (peek() === \"{\") {\n // option (my_option) = {\n // repeated_value: [ \"foo\", \"bar\" ]\n // };\n value = parseOptionValue(parent, name + \".\" + token);\n } else if (peek() === \"[\") {\n value = [];\n var lastValue;\n if (skip(\"[\", true)) {\n do {\n lastValue = readValue(true);\n value.push(lastValue);\n } while (skip(\",\", true));\n skip(\"]\");\n if (typeof lastValue !== \"undefined\") {\n setOption(parent, name + \".\" + token, lastValue);\n }\n }\n } else {\n value = readValue(true);\n setOption(parent, name + \".\" + token, value);\n }\n\n var prevValue = objectResult[propName];\n\n if (prevValue)\n value = [].concat(prevValue).concat(value);\n\n objectResult[propName] = value;\n\n // Semicolons and commas can be optional\n skip(\",\", true);\n skip(\";\", true);\n }\n\n return objectResult;\n }\n\n var simpleValue = readValue(true);\n setOption(parent, name, simpleValue);\n return simpleValue;\n // Does not enforce a delimiter to be universal\n }\n\n function setOption(parent, name, value) {\n if (ptr === parent && /^features\\./.test(name)) {\n topLevelOptions[name] = value;\n return;\n }\n if (parent.setOption)\n parent.setOption(name, value);\n }\n\n function setParsedOption(parent, name, value, propName) {\n if (parent.setParsedOption)\n parent.setParsedOption(name, value, propName);\n }\n\n function parseInlineOptions(parent) {\n if (skip(\"[\", true)) {\n do {\n parseOption(parent, \"option\");\n } while (skip(\",\", true));\n skip(\"]\");\n }\n return parent;\n }\n\n function parseService(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"service name\");\n\n var service = new Service(token);\n ifBlock(service, function parseService_block(token) {\n if (parseCommon(service, token)) {\n return;\n }\n\n /* istanbul ignore else */\n if (token === \"rpc\")\n parseMethod(service, token);\n else\n throw illegal(token);\n });\n parent.add(service);\n if (parent === ptr) {\n topLevelObjects.push(service);\n }\n }\n\n function parseMethod(parent, token) {\n // Get the comment of the preceding line now (if one exists) in case the\n // method is defined across multiple lines.\n var commentText = cmnt();\n\n var type = token;\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var name = token,\n requestType, requestStream,\n responseType, responseStream;\n\n skip(\"(\");\n if (skip(\"stream\", true))\n requestStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n requestType = token;\n skip(\")\"); skip(\"returns\"); skip(\"(\");\n if (skip(\"stream\", true))\n responseStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n responseType = token;\n skip(\")\");\n\n var method = new Method(name, type, requestType, responseType, requestStream, responseStream);\n method.comment = commentText;\n ifBlock(method, function parseMethod_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(method, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n });\n parent.add(method);\n }\n\n function parseExtension(parent, token) {\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token, \"reference\");\n\n var reference = token;\n ifBlock(null, function parseExtension_block(token) {\n switch (token) {\n\n case \"required\":\n case \"repeated\":\n parseField(parent, token, reference);\n break;\n\n case \"optional\":\n /* istanbul ignore if */\n if (edition === \"proto3\") {\n parseField(parent, \"proto3_optional\", reference);\n } else {\n parseField(parent, \"optional\", reference);\n }\n break;\n\n default:\n /* istanbul ignore if */\n if (edition === \"proto2\" || !typeRefRe.test(token))\n throw illegal(token);\n push(token);\n parseField(parent, \"optional\", reference);\n break;\n }\n });\n }\n\n var token;\n while ((token = next()) !== null) {\n switch (token) {\n\n case \"package\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parsePackage();\n break;\n\n case \"import\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseImport();\n break;\n\n case \"syntax\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseSyntax();\n break;\n\n case \"edition\":\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n parseEdition();\n break;\n\n case \"option\":\n parseOption(ptr, token);\n skip(\";\", true);\n break;\n\n default:\n\n /* istanbul ignore else */\n if (parseCommon(ptr, token)) {\n head = false;\n continue;\n }\n\n /* istanbul ignore next */\n throw illegal(token);\n }\n }\n\n resolveFileFeatures();\n\n parse.filename = null;\n return {\n \"package\" : pkg,\n \"imports\" : imports,\n weakImports : weakImports,\n root : root\n };\n}\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @name parse\n * @function\n * @param {string} source Source contents\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n * @variation 2\n */\n","\"use strict\";\n\n/**\n * Streaming RPC helpers.\n * @namespace\n */\nvar rpc = exports;\n\n/**\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\n * @typedef RPCImpl\n * @type {function}\n * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called\n * @param {Uint8Array} requestData Request data\n * @param {RPCImplCallback} callback Callback function\n * @returns {undefined}\n * @example\n * function rpcImpl(method, requestData, callback) {\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\n * throw Error(\"no such method\");\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\n * callback(err, responseData);\n * });\n * }\n */\n\n/**\n * Node-style callback as used by {@link RPCImpl}.\n * @typedef RPCImplCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\n * @returns {undefined}\n */\n\nrpc.Service = require(\"./rpc/service\");\n","\"use strict\";\nmodule.exports = common;\n\nvar commonRe = /\\/|\\./;\n\n/**\n * Provides common type definitions.\n * Can also be used to provide additional google types or your own custom types.\n * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name\n * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition\n * @returns {undefined}\n * @property {INamespace} google/protobuf/any.proto Any\n * @property {INamespace} google/protobuf/duration.proto Duration\n * @property {INamespace} google/protobuf/empty.proto Empty\n * @property {INamespace} google/protobuf/field_mask.proto FieldMask\n * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue\n * @property {INamespace} google/protobuf/timestamp.proto Timestamp\n * @property {INamespace} google/protobuf/wrappers.proto Wrappers\n * @example\n * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension)\n * protobuf.common(\"descriptor\", descriptorJson);\n *\n * // manually provides a custom definition (uses my.foo namespace)\n * protobuf.common(\"my/foo/bar.proto\", myFooBarJson);\n */\nfunction common(name, json) {\n if (!commonRe.test(name)) {\n name = \"google/protobuf/\" + name + \".proto\";\n json = { nested: { google: { nested: { protobuf: { nested: json } } } } };\n }\n common[name] = json;\n}\n\n// Not provided because of limited use (feel free to discuss or to provide yourself):\n//\n// google/protobuf/descriptor.proto\n// google/protobuf/source_context.proto\n// google/protobuf/type.proto\n//\n// Stripped and pre-parsed versions of these non-bundled files are instead available as part of\n// the repository or package within the google/protobuf directory.\n\ncommon(\"any\", {\n\n /**\n * Properties of a google.protobuf.Any message.\n * @interface IAny\n * @type {Object}\n * @property {string} [typeUrl]\n * @property {Uint8Array} [bytes]\n * @memberof common\n */\n Any: {\n fields: {\n type_url: {\n type: \"string\",\n id: 1\n },\n value: {\n type: \"bytes\",\n id: 2\n }\n }\n }\n});\n\nvar timeType;\n\ncommon(\"duration\", {\n\n /**\n * Properties of a google.protobuf.Duration message.\n * @interface IDuration\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Duration: timeType = {\n fields: {\n seconds: {\n type: \"int64\",\n id: 1\n },\n nanos: {\n type: \"int32\",\n id: 2\n }\n }\n }\n});\n\ncommon(\"timestamp\", {\n\n /**\n * Properties of a google.protobuf.Timestamp message.\n * @interface ITimestamp\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Timestamp: timeType\n});\n\ncommon(\"empty\", {\n\n /**\n * Properties of a google.protobuf.Empty message.\n * @interface IEmpty\n * @memberof common\n */\n Empty: {\n fields: {}\n }\n});\n\ncommon(\"struct\", {\n\n /**\n * Properties of a google.protobuf.Struct message.\n * @interface IStruct\n * @type {Object}\n * @property {Object.} [fields]\n * @memberof common\n */\n Struct: {\n fields: {\n fields: {\n keyType: \"string\",\n type: \"Value\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Value message.\n * @interface IValue\n * @type {Object}\n * @property {string} [kind]\n * @property {0} [nullValue]\n * @property {number} [numberValue]\n * @property {string} [stringValue]\n * @property {boolean} [boolValue]\n * @property {IStruct} [structValue]\n * @property {IListValue} [listValue]\n * @memberof common\n */\n Value: {\n oneofs: {\n kind: {\n oneof: [\n \"nullValue\",\n \"numberValue\",\n \"stringValue\",\n \"boolValue\",\n \"structValue\",\n \"listValue\"\n ]\n }\n },\n fields: {\n nullValue: {\n type: \"NullValue\",\n id: 1\n },\n numberValue: {\n type: \"double\",\n id: 2\n },\n stringValue: {\n type: \"string\",\n id: 3\n },\n boolValue: {\n type: \"bool\",\n id: 4\n },\n structValue: {\n type: \"Struct\",\n id: 5\n },\n listValue: {\n type: \"ListValue\",\n id: 6\n }\n }\n },\n\n NullValue: {\n values: {\n NULL_VALUE: 0\n }\n },\n\n /**\n * Properties of a google.protobuf.ListValue message.\n * @interface IListValue\n * @type {Object}\n * @property {Array.} [values]\n * @memberof common\n */\n ListValue: {\n fields: {\n values: {\n rule: \"repeated\",\n type: \"Value\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"wrappers\", {\n\n /**\n * Properties of a google.protobuf.DoubleValue message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n DoubleValue: {\n fields: {\n value: {\n type: \"double\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.FloatValue message.\n * @interface IFloatValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FloatValue: {\n fields: {\n value: {\n type: \"float\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int64Value message.\n * @interface IInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n Int64Value: {\n fields: {\n value: {\n type: \"int64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt64Value message.\n * @interface IUInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n UInt64Value: {\n fields: {\n value: {\n type: \"uint64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int32Value message.\n * @interface IInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n Int32Value: {\n fields: {\n value: {\n type: \"int32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt32Value message.\n * @interface IUInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n UInt32Value: {\n fields: {\n value: {\n type: \"uint32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BoolValue message.\n * @interface IBoolValue\n * @type {Object}\n * @property {boolean} [value]\n * @memberof common\n */\n BoolValue: {\n fields: {\n value: {\n type: \"bool\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.StringValue message.\n * @interface IStringValue\n * @type {Object}\n * @property {string} [value]\n * @memberof common\n */\n StringValue: {\n fields: {\n value: {\n type: \"string\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BytesValue message.\n * @interface IBytesValue\n * @type {Object}\n * @property {Uint8Array} [value]\n * @memberof common\n */\n BytesValue: {\n fields: {\n value: {\n type: \"bytes\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"field_mask\", {\n\n /**\n * Properties of a google.protobuf.FieldMask message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FieldMask: {\n fields: {\n paths: {\n rule: \"repeated\",\n type: \"string\",\n id: 1\n }\n }\n }\n});\n\n/**\n * Gets the root definition of the specified common proto file.\n *\n * Bundled definitions are:\n * - google/protobuf/any.proto\n * - google/protobuf/duration.proto\n * - google/protobuf/empty.proto\n * - google/protobuf/field_mask.proto\n * - google/protobuf/struct.proto\n * - google/protobuf/timestamp.proto\n * - google/protobuf/wrappers.proto\n *\n * @param {string} file Proto file name\n * @returns {INamespace|null} Root definition or `null` if not defined\n */\ncommon.get = function get(file) {\n return common[file] || null;\n};\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\";\nvar protobuf = module.exports = require(\"./index-minimal\");\n\nprotobuf.build = \"light\";\n\n/**\n * A node-style callback as used by {@link load} and {@link Root#load}.\n * @typedef LoadCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Root} [root] Root, if there hasn't been an error\n * @returns {undefined}\n */\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} root Root namespace, defaults to create a new one if omitted.\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n */\nfunction load(filename, root, callback) {\n if (typeof root === \"function\") {\n callback = root;\n root = new protobuf.Root();\n } else if (!root)\n root = new protobuf.Root();\n return root.load(filename, callback);\n}\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Promise} Promise\n * @see {@link Root#load}\n * @variation 3\n */\n// function load(filename:string, [root:Root]):Promise\n\nprotobuf.load = load;\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only).\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n * @see {@link Root#loadSync}\n */\nfunction loadSync(filename, root) {\n if (!root)\n root = new protobuf.Root();\n return root.loadSync(filename);\n}\n\nprotobuf.loadSync = loadSync;\n\n// Serialization\nprotobuf.encoder = require(\"./encoder\");\nprotobuf.decoder = require(\"./decoder\");\nprotobuf.verifier = require(\"./verifier\");\nprotobuf.converter = require(\"./converter\");\n\n// Reflection\nprotobuf.ReflectionObject = require(\"./object\");\nprotobuf.Namespace = require(\"./namespace\");\nprotobuf.Root = require(\"./root\");\nprotobuf.Enum = require(\"./enum\");\nprotobuf.Type = require(\"./type\");\nprotobuf.Field = require(\"./field\");\nprotobuf.OneOf = require(\"./oneof\");\nprotobuf.MapField = require(\"./mapfield\");\nprotobuf.Service = require(\"./service\");\nprotobuf.Method = require(\"./method\");\n\n// Runtime\nprotobuf.Message = require(\"./message\");\nprotobuf.wrappers = require(\"./wrappers\");\n\n// Utility\nprotobuf.types = require(\"./types\");\nprotobuf.util = require(\"./util\");\n\n// Set up possibly cyclic reflection dependencies\nprotobuf.ReflectionObject._configure(protobuf.Root);\nprotobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum);\nprotobuf.Root._configure(protobuf.Type);\nprotobuf.Field._configure(protobuf.Type);\n","\"use strict\";\nmodule.exports = Root;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = \"Root\";\n\nvar Field = require(\"./field\"),\n Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n util = require(\"./util\");\n\nvar Type, // cyclic\n parse, // might be excluded\n common; // \"\n\n/**\n * Constructs a new root namespace instance.\n * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together.\n * @extends NamespaceBase\n * @constructor\n * @param {Object.} [options] Top level options\n */\nfunction Root(options) {\n Namespace.call(this, \"\", options);\n\n /**\n * Deferred extension fields.\n * @type {Field[]}\n */\n this.deferred = [];\n\n /**\n * Resolved file names of loaded files.\n * @type {string[]}\n */\n this.files = [];\n\n // Default to proto2 if unspecified.\n this._edition = \"proto2\";\n}\n\n/**\n * Loads a namespace descriptor into a root namespace.\n * @param {INamespace} json Namespace descriptor\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted\n * @returns {Root} Root namespace\n */\nRoot.fromJSON = function fromJSON(json, root) {\n if (!root)\n root = new Root();\n if (json.options)\n root.setOptions(json.options);\n return root.addJSON(json.nested).resolveAll();\n};\n\n/**\n * Resolves the path of an imported file, relative to the importing origin.\n * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories.\n * @function\n * @param {string} origin The file name of the importing file\n * @param {string} target The file name being imported\n * @returns {string|null} Resolved path to `target` or `null` to skip the file\n */\nRoot.prototype.resolvePath = util.path.resolve;\n\n/**\n * Fetch content from file path or url\n * This method exists so you can override it with your own logic.\n * @function\n * @param {string} path File path or url\n * @param {FetchCallback} callback Callback function\n * @returns {undefined}\n */\nRoot.prototype.fetch = util.fetch;\n\n// A symbol-like function to safely signal synchronous loading\n/* istanbul ignore next */\nfunction SYNC() {} // eslint-disable-line no-empty-function\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} options Parse options\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n */\nRoot.prototype.load = function load(filename, options, callback) {\n if (typeof options === \"function\") {\n callback = options;\n options = undefined;\n }\n var self = this;\n if (!callback) {\n return util.asPromise(load, self, filename, options);\n }\n\n var sync = callback === SYNC; // undocumented\n\n // Finishes loading by calling the callback (exactly once)\n function finish(err, root) {\n /* istanbul ignore if */\n if (!callback) {\n return;\n }\n if (sync) {\n throw err;\n }\n var cb = callback;\n callback = null;\n if (root) {\n root.resolveAll();\n }\n cb(err, root);\n }\n\n // Bundled definition existence checking\n function getBundledFileName(filename) {\n var idx = filename.lastIndexOf(\"google/protobuf/\");\n if (idx > -1) {\n var altname = filename.substring(idx);\n if (altname in common) return altname;\n }\n return null;\n }\n\n // Processes a single file\n function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued) {\n finish(null, self); // only once anyway\n }\n }\n\n // Fetches a single file\n function fetch(filename, weak) {\n filename = getBundledFileName(filename) || filename;\n\n // Skip if already loaded / attempted\n if (self.files.indexOf(filename) > -1) {\n return;\n }\n self.files.push(filename);\n\n // Shortcut bundled definitions\n if (filename in common) {\n if (sync) {\n process(filename, common[filename]);\n } else {\n ++queued;\n setTimeout(function() {\n --queued;\n process(filename, common[filename]);\n });\n }\n return;\n }\n\n // Otherwise fetch from disk or network\n if (sync) {\n var source;\n try {\n source = util.fs.readFileSync(filename).toString(\"utf8\");\n } catch (err) {\n if (!weak)\n finish(err);\n return;\n }\n process(filename, source);\n } else {\n ++queued;\n self.fetch(filename, function(err, source) {\n --queued;\n /* istanbul ignore if */\n if (!callback) {\n return; // terminated meanwhile\n }\n if (err) {\n /* istanbul ignore else */\n if (!weak)\n finish(err);\n else if (!queued) // can't be covered reliably\n finish(null, self);\n return;\n }\n process(filename, source);\n });\n }\n }\n var queued = 0;\n\n // Assembling the root namespace doesn't require working type\n // references anymore, so we can load everything in parallel\n if (util.isString(filename)) {\n filename = [ filename ];\n }\n for (var i = 0, resolved; i < filename.length; ++i)\n if (resolved = self.resolvePath(\"\", filename[i]))\n fetch(resolved);\n self.resolveAll();\n if (sync) {\n return self;\n }\n if (!queued) {\n finish(null, self);\n }\n\n return self;\n};\n// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Promise} Promise\n * @variation 3\n */\n// function load(filename:string, [options:IParseOptions]):Promise\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only).\n * @function Root#loadSync\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n */\nRoot.prototype.loadSync = function loadSync(filename, options) {\n if (!util.isNode)\n throw Error(\"not supported\");\n return this.load(filename, options, SYNC);\n};\n\n/**\n * @override\n */\nRoot.prototype.resolveAll = function resolveAll() {\n if (this.deferred.length)\n throw Error(\"unresolvable extensions: \" + this.deferred.map(function(field) {\n return \"'extend \" + field.extend + \"' in \" + field.parent.fullName;\n }).join(\", \"));\n return Namespace.prototype.resolveAll.call(this);\n};\n\n// only uppercased (and thus conflict-free) children are exposed, see below\nvar exposeRe = /^[A-Z]/;\n\n/**\n * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type.\n * @param {Root} root Root instance\n * @param {Field} field Declaring extension field witin the declaring type\n * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise\n * @inner\n * @ignore\n */\nfunction tryHandleExtension(root, field) {\n var extendedType = field.parent.lookup(field.extend);\n if (extendedType) {\n var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options);\n //do not allow to extend same field twice to prevent the error\n if (extendedType.get(sisterField.name)) {\n return true;\n }\n sisterField.declaringField = field;\n field.extensionField = sisterField;\n extendedType.add(sisterField);\n return true;\n }\n return false;\n}\n\n/**\n * Called when any object is added to this root or its sub-namespaces.\n * @param {ReflectionObject} object Object added\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleAdd = function _handleAdd(object) {\n if (object instanceof Field) {\n\n if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField)\n if (!tryHandleExtension(this, object))\n this.deferred.push(object);\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n object.parent[object.name] = object.values; // expose enum values as property of its parent\n\n } else if (!(object instanceof OneOf)) /* everything else is a namespace */ {\n\n if (object instanceof Type) // Try to handle any deferred extensions\n for (var i = 0; i < this.deferred.length;)\n if (tryHandleExtension(this, this.deferred[i]))\n this.deferred.splice(i, 1);\n else\n ++i;\n for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace\n this._handleAdd(object._nestedArray[j]);\n if (exposeRe.test(object.name))\n object.parent[object.name] = object; // expose namespace as property of its parent\n }\n\n // The above also adds uppercased (and thus conflict-free) nested types, services and enums as\n // properties of namespaces just like static code does. This allows using a .d.ts generated for\n // a static module with reflection-based solutions where the condition is met.\n};\n\n/**\n * Called when any object is removed from this root or its sub-namespaces.\n * @param {ReflectionObject} object Object removed\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleRemove = function _handleRemove(object) {\n if (object instanceof Field) {\n\n if (/* an extension field */ object.extend !== undefined) {\n if (/* already handled */ object.extensionField) { // remove its sister field\n object.extensionField.parent.remove(object.extensionField);\n object.extensionField = null;\n } else { // cancel the extension\n var index = this.deferred.indexOf(object);\n /* istanbul ignore else */\n if (index > -1)\n this.deferred.splice(index, 1);\n }\n }\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose enum values\n\n } else if (object instanceof Namespace) {\n\n for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace\n this._handleRemove(object._nestedArray[i]);\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose namespaces\n\n }\n};\n\n// Sets up cyclic dependencies (called in index-light)\nRoot._configure = function(Type_, parse_, common_) {\n Type = Type_;\n parse = parse_;\n common = common_;\n};\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","module.exports = require('./lib/retry');","\"use strict\";\nmodule.exports = Enum;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = \"Enum\";\n\nvar Namespace = require(\"./namespace\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new enum instance.\n * @classdesc Reflected enum.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {Object.} [values] Enum values as an object, by name\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this enum\n * @param {Object.} [comments] The value comments for this enum\n * @param {Object.>|undefined} [valuesOptions] The value options for this enum\n */\nfunction Enum(name, values, options, comment, comments, valuesOptions) {\n ReflectionObject.call(this, name, options);\n\n if (values && typeof values !== \"object\")\n throw TypeError(\"values must be an object\");\n\n /**\n * Enum values by id.\n * @type {Object.}\n */\n this.valuesById = {};\n\n /**\n * Enum values by name.\n * @type {Object.}\n */\n this.values = Object.create(this.valuesById); // toJSON, marker\n\n /**\n * Enum comment text.\n * @type {string|null}\n */\n this.comment = comment;\n\n /**\n * Value comment texts, if any.\n * @type {Object.}\n */\n this.comments = comments || {};\n\n /**\n * Values options, if any\n * @type {Object>|undefined}\n */\n this.valuesOptions = valuesOptions;\n\n /**\n * Resolved values features, if any\n * @type {Object>|undefined}\n */\n this._valuesFeatures = {};\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n // Note that values inherit valuesById on their prototype which makes them a TypeScript-\n // compatible enum. This is used by pbts to write actual enum definitions that work for\n // static and reflection code alike instead of emitting generic object definitions.\n\n if (values)\n for (var keys = Object.keys(values), i = 0; i < keys.length; ++i)\n if (typeof values[keys[i]] === \"number\") // use forward entries only\n this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i];\n}\n\n/**\n * @override\n */\nEnum.prototype._resolveFeatures = function _resolveFeatures(edition) {\n edition = this._edition || edition;\n ReflectionObject.prototype._resolveFeatures.call(this, edition);\n\n Object.keys(this.values).forEach(key => {\n var parentFeaturesCopy = Object.assign({}, this._features);\n this._valuesFeatures[key] = Object.assign(parentFeaturesCopy, this.valuesOptions && this.valuesOptions[key] && this.valuesOptions[key].features);\n });\n\n return this;\n};\n\n/**\n * Enum descriptor.\n * @interface IEnum\n * @property {Object.} values Enum values\n * @property {Object.} [options] Enum options\n */\n\n/**\n * Constructs an enum from an enum descriptor.\n * @param {string} name Enum name\n * @param {IEnum} json Enum descriptor\n * @returns {Enum} Created enum\n * @throws {TypeError} If arguments are invalid\n */\nEnum.fromJSON = function fromJSON(name, json) {\n var enm = new Enum(name, json.values, json.options, json.comment, json.comments);\n enm.reserved = json.reserved;\n if (json.edition)\n enm._edition = json.edition;\n enm._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return enm;\n};\n\n/**\n * Converts this enum to an enum descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IEnum} Enum descriptor\n */\nEnum.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"options\" , this.options,\n \"valuesOptions\" , this.valuesOptions,\n \"values\" , this.values,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"comment\" , keepComments ? this.comment : undefined,\n \"comments\" , keepComments ? this.comments : undefined\n ]);\n};\n\n/**\n * Adds a value to this enum.\n * @param {string} name Value name\n * @param {number} id Value id\n * @param {string} [comment] Comment, if any\n * @param {Object.|undefined} [options] Options, if any\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a value with this name or id\n */\nEnum.prototype.add = function add(name, id, comment, options) {\n // utilized by the parser but not by .fromJSON\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (!util.isInteger(id))\n throw TypeError(\"id must be an integer\");\n\n if (this.values[name] !== undefined)\n throw Error(\"duplicate name '\" + name + \"' in \" + this);\n\n if (this.isReservedId(id))\n throw Error(\"id \" + id + \" is reserved in \" + this);\n\n if (this.isReservedName(name))\n throw Error(\"name '\" + name + \"' is reserved in \" + this);\n\n if (this.valuesById[id] !== undefined) {\n if (!(this.options && this.options.allow_alias))\n throw Error(\"duplicate id \" + id + \" in \" + this);\n this.values[name] = id;\n } else\n this.valuesById[this.values[name] = id] = name;\n\n if (options) {\n if (this.valuesOptions === undefined)\n this.valuesOptions = {};\n this.valuesOptions[name] = options || null;\n }\n\n this.comments[name] = comment || null;\n return this;\n};\n\n/**\n * Removes a value from this enum\n * @param {string} name Value name\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `name` is not a name of this enum\n */\nEnum.prototype.remove = function remove(name) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n var val = this.values[name];\n if (val == null)\n throw Error(\"name '\" + name + \"' does not exist in \" + this);\n\n delete this.valuesById[val];\n delete this.values[name];\n delete this.comments[name];\n if (this.valuesOptions)\n delete this.valuesOptions[name];\n\n return this;\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\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","\"use strict\";\nmodule.exports = Reader;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferReader; // cyclic\n\nvar LongBits = util.LongBits,\n utf8 = util.utf8;\n\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\n}\n\n/**\n * Constructs a new reader instance using the specified buffer.\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n * @param {Uint8Array} buffer Buffer to read from\n */\nfunction Reader(buffer) {\n\n /**\n * Read buffer.\n * @type {Uint8Array}\n */\n this.buf = buffer;\n\n /**\n * Read buffer position.\n * @type {number}\n */\n this.pos = 0;\n\n /**\n * Read buffer length.\n * @type {number}\n */\n this.len = buffer.length;\n}\n\nvar create_array = typeof Uint8Array !== \"undefined\"\n ? function create_typed_array(buffer) {\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n }\n /* istanbul ignore next */\n : function create_array(buffer) {\n if (Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n };\n\nvar create = function create() {\n return util.Buffer\n ? function create_buffer_setup(buffer) {\n return (Reader.create = function create_buffer(buffer) {\n return util.Buffer.isBuffer(buffer)\n ? new BufferReader(buffer)\n /* istanbul ignore next */\n : create_array(buffer);\n })(buffer);\n }\n /* istanbul ignore next */\n : create_array;\n};\n\n/**\n * Creates a new reader using the specified buffer.\n * @function\n * @param {Uint8Array|Buffer} buffer Buffer to read from\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\n * @throws {Error} If `buffer` is not a valid buffer\n */\nReader.create = create();\n\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\n\n/**\n * Reads a varint as an unsigned 32 bit value.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.uint32 = (function read_uint32_setup() {\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\n return function read_uint32() {\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\n\n /* istanbul ignore if */\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n };\n})();\n\n/**\n * Reads a varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.int32 = function read_int32() {\n return this.uint32() | 0;\n};\n\n/**\n * Reads a zig-zag encoded varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.sint32 = function read_sint32() {\n var value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readLongVarint() {\n // tends to deopt with local vars for octet etc.\n var bits = new LongBits(0, 0);\n var 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 // 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 i = 0;\n } else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\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 // 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 } else {\n for (; i < 5; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\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 /* istanbul ignore next */\n throw Error(\"invalid varint encoding\");\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads a varint as a signed 64 bit value.\n * @name Reader#int64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as an unsigned 64 bit value.\n * @name Reader#uint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a zig-zag encoded varint as a signed 64 bit value.\n * @name Reader#sint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as a boolean.\n * @returns {boolean} Value read\n */\nReader.prototype.bool = function read_bool() {\n return this.uint32() !== 0;\n};\n\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\n return (buf[end - 4]\n | buf[end - 3] << 8\n | buf[end - 2] << 16\n | buf[end - 1] << 24) >>> 0;\n}\n\n/**\n * Reads fixed 32 bits as an unsigned 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.fixed32 = function read_fixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4);\n};\n\n/**\n * Reads fixed 32 bits as a signed 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.sfixed32 = function read_sfixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readFixed64(/* this: Reader */) {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 8);\n\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads fixed 64 bits.\n * @name Reader#fixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads zig-zag encoded fixed 64 bits.\n * @name Reader#sfixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a float (32 bit) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.float = function read_float() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n};\n\n/**\n * Reads a double (64 bit float) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.double = function read_double() {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @returns {Uint8Array} Value read\n */\nReader.prototype.bytes = function read_bytes() {\n var length = this.uint32(),\n start = this.pos,\n end = this.pos + length;\n\n /* istanbul ignore if */\n if (end > this.len)\n throw indexOutOfRange(this, length);\n\n this.pos += length;\n if (Array.isArray(this.buf)) // plain array\n return this.buf.slice(start, end);\n\n if (start === end) { // fix for IE 10/Win8 and others' subarray returning array of size 1\n var nativeBuffer = util.Buffer;\n return nativeBuffer\n ? nativeBuffer.alloc(0)\n : new this.buf.constructor(0);\n }\n return this._slice.call(this.buf, start, end);\n};\n\n/**\n * Reads a string preceeded by its byte length as a varint.\n * @returns {string} Value read\n */\nReader.prototype.string = function read_string() {\n var bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n};\n\n/**\n * Skips the specified number of bytes if specified, otherwise skips a varint.\n * @param {number} [length] Length if known, otherwise a varint is assumed\n * @returns {Reader} `this`\n */\nReader.prototype.skip = function skip(length) {\n if (typeof length === \"number\") {\n /* istanbul ignore if */\n if (this.pos + length > this.len)\n throw indexOutOfRange(this, length);\n this.pos += length;\n } else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n } while (this.buf[this.pos++] & 128);\n }\n return this;\n};\n\n/**\n * Skips the next element of the specified wire type.\n * @param {number} wireType Wire type received\n * @returns {Reader} `this`\n */\nReader.prototype.skipType = function(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\n /* istanbul ignore next */\n default:\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\n }\n return this;\n};\n\nReader._configure = function(BufferReader_) {\n BufferReader = BufferReader_;\n Reader.create = create();\n BufferReader._configure();\n\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\n util.merge(Reader.prototype, {\n\n int64: function read_int64() {\n return readLongVarint.call(this)[fn](false);\n },\n\n uint64: function read_uint64() {\n return readLongVarint.call(this)[fn](true);\n },\n\n sint64: function read_sint64() {\n return readLongVarint.call(this).zzDecode()[fn](false);\n },\n\n fixed64: function read_fixed64() {\n return readFixed64.call(this)[fn](true);\n },\n\n sfixed64: function read_sfixed64() {\n return readFixed64.call(this)[fn](false);\n }\n\n });\n};\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","\"use strict\";\n\n/**\n * Wrappers for common types.\n * @type {Object.}\n * @const\n */\nvar wrappers = exports;\n\nvar Message = require(\"./message\");\n\n/**\n * From object converter part of an {@link IWrapper}.\n * @typedef WrapperFromObjectConverter\n * @type {function}\n * @param {Object.} object Plain object\n * @returns {Message<{}>} Message instance\n * @this Type\n */\n\n/**\n * To object converter part of an {@link IWrapper}.\n * @typedef WrapperToObjectConverter\n * @type {function}\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @this Type\n */\n\n/**\n * Common type wrapper part of {@link wrappers}.\n * @interface IWrapper\n * @property {WrapperFromObjectConverter} [fromObject] From object converter\n * @property {WrapperToObjectConverter} [toObject] To object converter\n */\n\n// Custom wrapper for Any\nwrappers[\".google.protobuf.Any\"] = {\n\n fromObject: function(object) {\n\n // unwrap value type if mapped\n if (object && object[\"@type\"]) {\n // Only use fully qualified type name after the last '/'\n var name = object[\"@type\"].substring(object[\"@type\"].lastIndexOf(\"/\") + 1);\n var type = this.lookup(name);\n /* istanbul ignore else */\n if (type) {\n // type_url does not accept leading \".\"\n var type_url = object[\"@type\"].charAt(0) === \".\" ?\n object[\"@type\"].slice(1) : object[\"@type\"];\n // type_url prefix is optional, but path seperator is required\n if (type_url.indexOf(\"/\") === -1) {\n type_url = \"/\" + type_url;\n }\n return this.create({\n type_url: type_url,\n value: type.encode(type.fromObject(object)).finish()\n });\n }\n }\n\n return this.fromObject(object);\n },\n\n toObject: function(message, options) {\n\n // Default prefix\n var googleApi = \"type.googleapis.com/\";\n var prefix = \"\";\n var name = \"\";\n\n // decode value if requested and unmapped\n if (options && options.json && message.type_url && message.value) {\n // Only use fully qualified type name after the last '/'\n name = message.type_url.substring(message.type_url.lastIndexOf(\"/\") + 1);\n // Separate the prefix used\n prefix = message.type_url.substring(0, message.type_url.lastIndexOf(\"/\") + 1);\n var type = this.lookup(name);\n /* istanbul ignore else */\n if (type)\n message = type.decode(message.value);\n }\n\n // wrap value if unmapped\n if (!(message instanceof this.ctor) && message instanceof Message) {\n var object = message.$type.toObject(message, options);\n var messageName = message.$type.fullName[0] === \".\" ?\n message.$type.fullName.slice(1) : message.$type.fullName;\n // Default to type.googleapis.com prefix if no prefix is used\n if (prefix === \"\") {\n prefix = googleApi;\n }\n name = prefix + messageName;\n object[\"@type\"] = name;\n return object;\n }\n\n return this.toObject(message, options);\n }\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","'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","\"use strict\";\nmodule.exports = ReflectionObject;\n\nReflectionObject.className = \"ReflectionObject\";\n\nconst OneOf = require(\"./oneof\");\nvar util = require(\"./util\");\n\nvar Root; // cyclic\n\n/* eslint-disable no-warning-comments */\n// TODO: Replace with embedded proto.\nvar editions2023Defaults = {enum_type: \"OPEN\", field_presence: \"EXPLICIT\", json_format: \"ALLOW\", message_encoding: \"LENGTH_PREFIXED\", repeated_field_encoding: \"PACKED\", utf8_validation: \"VERIFY\"};\nvar proto2Defaults = {enum_type: \"CLOSED\", field_presence: \"EXPLICIT\", json_format: \"LEGACY_BEST_EFFORT\", message_encoding: \"LENGTH_PREFIXED\", repeated_field_encoding: \"EXPANDED\", utf8_validation: \"NONE\"};\nvar proto3Defaults = {enum_type: \"OPEN\", field_presence: \"IMPLICIT\", json_format: \"ALLOW\", message_encoding: \"LENGTH_PREFIXED\", repeated_field_encoding: \"PACKED\", utf8_validation: \"VERIFY\"};\n\n/**\n * Constructs a new reflection object instance.\n * @classdesc Base class of all reflection objects.\n * @constructor\n * @param {string} name Object name\n * @param {Object.} [options] Declared options\n * @abstract\n */\nfunction ReflectionObject(name, options) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (options && !util.isObject(options))\n throw TypeError(\"options must be an object\");\n\n /**\n * Options.\n * @type {Object.|undefined}\n */\n this.options = options; // toJSON\n\n /**\n * Parsed Options.\n * @type {Array.>|undefined}\n */\n this.parsedOptions = null;\n\n /**\n * Unique name within its namespace.\n * @type {string}\n */\n this.name = name;\n\n /**\n * The edition specified for this object. Only relevant for top-level objects.\n * @type {string}\n */\n this._edition = null;\n\n /**\n * The default edition to use for this object if none is specified. For legacy reasons,\n * this is proto2 except in the JSON parsing case where it was proto3.\n * @type {string}\n */\n this._defaultEdition = \"proto2\";\n\n /**\n * Resolved Features.\n * @type {object}\n */\n this._features = {};\n\n /**\n * Parent namespace.\n * @type {Namespace|null}\n */\n this.parent = null;\n\n /**\n * Whether already resolved or not.\n * @type {boolean}\n */\n this.resolved = false;\n\n /**\n * Comment text, if any.\n * @type {string|null}\n */\n this.comment = null;\n\n /**\n * Defining file name.\n * @type {string|null}\n */\n this.filename = null;\n}\n\nObject.defineProperties(ReflectionObject.prototype, {\n\n /**\n * Reference to the root namespace.\n * @name ReflectionObject#root\n * @type {Root}\n * @readonly\n */\n root: {\n get: function() {\n var ptr = this;\n while (ptr.parent !== null)\n ptr = ptr.parent;\n return ptr;\n }\n },\n\n /**\n * Full name including leading dot.\n * @name ReflectionObject#fullName\n * @type {string}\n * @readonly\n */\n fullName: {\n get: function() {\n var path = [ this.name ],\n ptr = this.parent;\n while (ptr) {\n path.unshift(ptr.name);\n ptr = ptr.parent;\n }\n return path.join(\".\");\n }\n }\n});\n\n/**\n * Converts this reflection object to its descriptor representation.\n * @returns {Object.} Descriptor\n * @abstract\n */\nReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() {\n throw Error(); // not implemented, shouldn't happen\n};\n\n/**\n * Called when this object is added to a parent.\n * @param {ReflectionObject} parent Parent added to\n * @returns {undefined}\n */\nReflectionObject.prototype.onAdd = function onAdd(parent) {\n if (this.parent && this.parent !== parent)\n this.parent.remove(this);\n this.parent = parent;\n this.resolved = false;\n var root = parent.root;\n if (root instanceof Root)\n root._handleAdd(this);\n};\n\n/**\n * Called when this object is removed from a parent.\n * @param {ReflectionObject} parent Parent removed from\n * @returns {undefined}\n */\nReflectionObject.prototype.onRemove = function onRemove(parent) {\n var root = parent.root;\n if (root instanceof Root)\n root._handleRemove(this);\n this.parent = null;\n this.resolved = false;\n};\n\n/**\n * Resolves this objects type references.\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n if (this instanceof Root) {\n this._resolveFeaturesRecursive(this._edition);\n this.resolved = true;\n }\n return this;\n};\n\n/**\n * Resolves this objects editions features.\n * @param {string} edition The edition we're currently resolving for.\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n return this._resolveFeatures(this._edition || edition);\n};\n\n/**\n * Resolves child features from parent features\n * @param {string} edition The edition we're currently resolving for.\n * @returns {undefined}\n */\nReflectionObject.prototype._resolveFeatures = function _resolveFeatures(edition) {\n var defaults = {};\n\n /* istanbul ignore if */\n if (!edition) {\n throw new Error(\"Unknown edition for \" + this.fullName);\n }\n\n var protoFeatures = Object.assign(this.options ? Object.assign({}, this.options.features) : {},\n this._inferLegacyProtoFeatures(edition));\n\n if (this._edition) {\n // For a namespace marked with a specific edition, reset defaults.\n /* istanbul ignore else */\n if (edition === \"proto2\") {\n defaults = Object.assign({}, proto2Defaults);\n } else if (edition === \"proto3\") {\n defaults = Object.assign({}, proto3Defaults);\n } else if (edition === \"2023\") {\n defaults = Object.assign({}, editions2023Defaults);\n } else {\n throw new Error(\"Unknown edition: \" + edition);\n }\n this._features = Object.assign(defaults, protoFeatures || {});\n return;\n }\n\n // fields in Oneofs aren't actually children of them, so we have to\n // special-case it\n /* istanbul ignore else */\n if (this.partOf instanceof OneOf) {\n var lexicalParentFeaturesCopy = Object.assign({}, this.partOf._features);\n this._features = Object.assign(lexicalParentFeaturesCopy, protoFeatures || {});\n } else if (this.declaringField) {\n // Skip feature resolution of sister fields.\n } else if (this.parent) {\n var parentFeaturesCopy = Object.assign({}, this.parent._features);\n this._features = Object.assign(parentFeaturesCopy, protoFeatures || {});\n } else {\n throw new Error(\"Unable to find a parent for \" + this.fullName);\n }\n if (this.extensionField) {\n // Sister fields should have the same features as their extensions.\n this.extensionField._features = this._features;\n }\n};\n\n/**\n * Infers features from legacy syntax that may have been specified differently.\n * in older editions.\n * @param {string|undefined} edition The edition this proto is on, or undefined if pre-editions\n * @returns {object} The feature values to override\n */\nReflectionObject.prototype._inferLegacyProtoFeatures = function _inferLegacyProtoFeatures(/*edition*/) {\n return {};\n};\n\n/**\n * Gets an option value.\n * @param {string} name Option name\n * @returns {*} Option value or `undefined` if not set\n */\nReflectionObject.prototype.getOption = function getOption(name) {\n if (this.options)\n return this.options[name];\n return undefined;\n};\n\n/**\n * Sets an option.\n * @param {string} name Option name\n * @param {*} value Option value\n * @param {boolean|undefined} [ifNotSet] Sets the option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) {\n if (!this.options)\n this.options = {};\n if (/^features\\./.test(name)) {\n util.setProperty(this.options, name, value, ifNotSet);\n } else if (!ifNotSet || this.options[name] === undefined) {\n if (this.getOption(name) !== value) this.resolved = false;\n this.options[name] = value;\n }\n\n return this;\n};\n\n/**\n * Sets a parsed option.\n * @param {string} name parsed Option name\n * @param {*} value Option value\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\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setParsedOption = function setParsedOption(name, value, propName) {\n if (!this.parsedOptions) {\n this.parsedOptions = [];\n }\n var parsedOptions = this.parsedOptions;\n if (propName) {\n // If setting a sub property of an option then try to merge it\n // with an existing option\n var opt = parsedOptions.find(function (opt) {\n return Object.prototype.hasOwnProperty.call(opt, name);\n });\n if (opt) {\n // If we found an existing option - just merge the property value\n // (If it's a feature, will just write over)\n var newValue = opt[name];\n util.setProperty(newValue, propName, value);\n } else {\n // otherwise, create a new option, set its property and add it to the list\n opt = {};\n opt[name] = util.setProperty({}, propName, value);\n parsedOptions.push(opt);\n }\n } else {\n // Always create a new option when setting the value of the option itself\n var newOpt = {};\n newOpt[name] = value;\n parsedOptions.push(newOpt);\n }\n\n return this;\n};\n\n/**\n * Sets multiple options.\n * @param {Object.} options Options to set\n * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) {\n if (options)\n for (var keys = Object.keys(options), i = 0; i < keys.length; ++i)\n this.setOption(keys[i], options[keys[i]], ifNotSet);\n return this;\n};\n\n/**\n * Converts this instance to its string representation.\n * @returns {string} Class name[, space, full name]\n */\nReflectionObject.prototype.toString = function toString() {\n var className = this.constructor.className,\n fullName = this.fullName;\n if (fullName.length)\n return className + \" \" + fullName;\n return className;\n};\n\n/**\n * Converts the edition this object is pinned to for JSON format.\n * @returns {string|undefined} The edition string for JSON representation\n */\nReflectionObject.prototype._editionToJSON = function _editionToJSON() {\n if (!this._edition || this._edition === \"proto3\") {\n // Avoid emitting proto3 since we need to default to it for backwards\n // compatibility anyway.\n return undefined;\n }\n return this._edition;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nReflectionObject._configure = function(Root_) {\n Root = Root_;\n};\n","\"use strict\";\nmodule.exports = Service;\n\nvar util = require(\"../util/minimal\");\n\n// Extends EventEmitter\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\n\n/**\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\n *\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\n * @typedef rpc.ServiceMethodCallback\n * @template TRes extends Message\n * @type {function}\n * @param {Error|null} error Error, if any\n * @param {TRes} [response] Response message\n * @returns {undefined}\n */\n\n/**\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\n * @typedef rpc.ServiceMethod\n * @template TReq extends Message\n * @template TRes extends Message\n * @type {function}\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message\n * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined`\n */\n\n/**\n * Constructs a new RPC service instance.\n * @classdesc An RPC service as returned by {@link Service#create}.\n * @exports rpc.Service\n * @extends util.EventEmitter\n * @constructor\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n */\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\n\n if (typeof rpcImpl !== \"function\")\n throw TypeError(\"rpcImpl must be a function\");\n\n util.EventEmitter.call(this);\n\n /**\n * RPC implementation. Becomes `null` once the service is ended.\n * @type {RPCImpl|null}\n */\n this.rpcImpl = rpcImpl;\n\n /**\n * Whether requests are length-delimited.\n * @type {boolean}\n */\n this.requestDelimited = Boolean(requestDelimited);\n\n /**\n * Whether responses are length-delimited.\n * @type {boolean}\n */\n this.responseDelimited = Boolean(responseDelimited);\n}\n\n/**\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\n * @param {Method|rpc.ServiceMethod} method Reflected or static method\n * @param {Constructor} requestCtor Request constructor\n * @param {Constructor} responseCtor Response constructor\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} callback Service callback\n * @returns {undefined}\n * @template TReq extends Message\n * @template TRes extends Message\n */\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\n\n if (!request)\n throw TypeError(\"request must be specified\");\n\n var self = this;\n if (!callback)\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\n\n if (!self.rpcImpl) {\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\n return undefined;\n }\n\n try {\n return self.rpcImpl(\n method,\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\n function rpcCallback(err, response) {\n\n if (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n\n if (response === null) {\n self.end(/* endedByRPC */ true);\n return undefined;\n }\n\n if (!(response instanceof responseCtor)) {\n try {\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\n } catch (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n }\n\n self.emit(\"data\", response, method);\n return callback(null, response);\n }\n );\n } catch (err) {\n self.emit(\"error\", err, method);\n setTimeout(function() { callback(err); }, 0);\n return undefined;\n }\n};\n\n/**\n * Ends this service and emits the `end` event.\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\n * @returns {rpc.Service} `this`\n */\nService.prototype.end = function end(endedByRPC) {\n if (this.rpcImpl) {\n if (!endedByRPC) // signal end to rpcImpl\n this.rpcImpl(null, null, null);\n this.rpcImpl = null;\n this.emit(\"end\").off();\n }\n return this;\n};\n","\"use strict\";\nmodule.exports = decoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nfunction missing(field) {\n return \"missing required '\" + field.name + \"'\";\n}\n\n/**\n * Generates a decoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction decoder(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"r\", \"l\", \"e\"], mtype.name + \"$decode\")\n (\"if(!(r instanceof Reader))\")\n (\"r=Reader.create(r)\")\n (\"var c=l===undefined?r.len:r.pos+l,m=new this.ctor\" + (mtype.fieldsArray.filter(function(field) { return field.map; }).length ? \",k,value\" : \"\"))\n (\"while(r.pos>>3){\");\n\n var i = 0;\n for (; i < /* initializes */ mtype.fieldsArray.length; ++i) {\n var field = mtype._fieldsArray[i].resolve(),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n ref = \"m\" + util.safeProp(field.name); gen\n (\"case %i: {\", field.id);\n\n // Map fields\n if (field.map) { gen\n (\"if(%s===util.emptyObject)\", ref)\n (\"%s={}\", ref)\n (\"var c2 = r.uint32()+r.pos\");\n\n if (types.defaults[field.keyType] !== undefined) gen\n (\"k=%j\", types.defaults[field.keyType]);\n else gen\n (\"k=null\");\n\n if (types.defaults[type] !== undefined) gen\n (\"value=%j\", types.defaults[type]);\n else gen\n (\"value=null\");\n\n gen\n (\"while(r.pos>>3){\")\n (\"case 1: k=r.%s(); break\", field.keyType)\n (\"case 2:\");\n\n if (types.basic[type] === undefined) gen\n (\"value=types[%i].decode(r,r.uint32())\", i); // can't be groups\n else gen\n (\"value=r.%s()\", type);\n\n gen\n (\"break\")\n (\"default:\")\n (\"r.skipType(tag2&7)\")\n (\"break\")\n (\"}\")\n (\"}\");\n\n if (types.long[field.keyType] !== undefined) gen\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=value\", ref);\n else gen\n (\"%s[k]=value\", ref);\n\n // Repeated fields\n } else if (field.repeated) { gen\n\n (\"if(!(%s&&%s.length))\", ref, ref)\n (\"%s=[]\", ref);\n\n // Packable (always check for forward and backward compatiblity)\n if (types.packed[type] !== undefined) gen\n (\"if((t&7)===2){\")\n (\"var c2=r.uint32()+r.pos\")\n (\"while(r.pos {\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\tlet m;\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\t// eslint-disable-next-line no-return-assign\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 && (m = navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/)) && parseInt(m[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","\"use strict\";\nmodule.exports = Type;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = \"Type\";\n\nvar Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n Service = require(\"./service\"),\n Message = require(\"./message\"),\n Reader = require(\"./reader\"),\n Writer = require(\"./writer\"),\n util = require(\"./util\"),\n encoder = require(\"./encoder\"),\n decoder = require(\"./decoder\"),\n verifier = require(\"./verifier\"),\n converter = require(\"./converter\"),\n wrappers = require(\"./wrappers\");\n\n/**\n * Constructs a new reflected message type instance.\n * @classdesc Reflected message type.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Message name\n * @param {Object.} [options] Declared options\n */\nfunction Type(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Message fields.\n * @type {Object.}\n */\n this.fields = {}; // toJSON, marker\n\n /**\n * Oneofs declared within this namespace, if any.\n * @type {Object.}\n */\n this.oneofs = undefined; // toJSON\n\n /**\n * Extension ranges, if any.\n * @type {number[][]}\n */\n this.extensions = undefined; // toJSON\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n /*?\n * Whether this type is a legacy group.\n * @type {boolean|undefined}\n */\n this.group = undefined; // toJSON\n\n /**\n * Cached fields by id.\n * @type {Object.|null}\n * @private\n */\n this._fieldsById = null;\n\n /**\n * Cached fields as an array.\n * @type {Field[]|null}\n * @private\n */\n this._fieldsArray = null;\n\n /**\n * Cached oneofs as an array.\n * @type {OneOf[]|null}\n * @private\n */\n this._oneofsArray = null;\n\n /**\n * Cached constructor.\n * @type {Constructor<{}>}\n * @private\n */\n this._ctor = null;\n}\n\nObject.defineProperties(Type.prototype, {\n\n /**\n * Message fields by id.\n * @name Type#fieldsById\n * @type {Object.}\n * @readonly\n */\n fieldsById: {\n get: function() {\n\n /* istanbul ignore if */\n if (this._fieldsById)\n return this._fieldsById;\n\n this._fieldsById = {};\n for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) {\n var field = this.fields[names[i]],\n id = field.id;\n\n /* istanbul ignore if */\n if (this._fieldsById[id])\n throw Error(\"duplicate id \" + id + \" in \" + this);\n\n this._fieldsById[id] = field;\n }\n return this._fieldsById;\n }\n },\n\n /**\n * Fields of this message as an array for iteration.\n * @name Type#fieldsArray\n * @type {Field[]}\n * @readonly\n */\n fieldsArray: {\n get: function() {\n return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields));\n }\n },\n\n /**\n * Oneofs of this message as an array for iteration.\n * @name Type#oneofsArray\n * @type {OneOf[]}\n * @readonly\n */\n oneofsArray: {\n get: function() {\n return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs));\n }\n },\n\n /**\n * The registered constructor, if any registered, otherwise a generic constructor.\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.\n * @name Type#ctor\n * @type {Constructor<{}>}\n */\n ctor: {\n get: function() {\n return this._ctor || (this.ctor = Type.generateConstructor(this)());\n },\n set: function(ctor) {\n\n // Ensure proper prototype\n var prototype = ctor.prototype;\n if (!(prototype instanceof Message)) {\n (ctor.prototype = new Message()).constructor = ctor;\n util.merge(ctor.prototype, prototype);\n }\n\n // Classes and messages reference their reflected type\n ctor.$type = ctor.prototype.$type = this;\n\n // Mix in static methods\n util.merge(ctor, Message, true);\n\n this._ctor = ctor;\n\n // Messages have non-enumerable default values on their prototype\n var i = 0;\n for (; i < /* initializes */ this.fieldsArray.length; ++i)\n this._fieldsArray[i].resolve(); // ensures a proper value\n\n // Messages have non-enumerable getters and setters for each virtual oneof field\n var ctorProperties = {};\n for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i)\n ctorProperties[this._oneofsArray[i].resolve().name] = {\n get: util.oneOfGetter(this._oneofsArray[i].oneof),\n set: util.oneOfSetter(this._oneofsArray[i].oneof)\n };\n if (i)\n Object.defineProperties(ctor.prototype, ctorProperties);\n }\n }\n});\n\n/**\n * Generates a constructor function for the specified type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nType.generateConstructor = function generateConstructor(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"p\"], mtype.name);\n // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype\n for (var i = 0, field; i < mtype.fieldsArray.length; ++i)\n if ((field = mtype._fieldsArray[i]).map) gen\n (\"this%s={}\", util.safeProp(field.name));\n else if (field.repeated) gen\n (\"this%s=[]\", util.safeProp(field.name));\n return gen\n (\"if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors\n * @property {Object.} fields Field descriptors\n * @property {number[][]} [extensions] Extension ranges\n * @property {Array.} [reserved] Reserved ranges\n * @property {boolean} [group=false] Whether a legacy group or not\n */\n\n/**\n * Creates a message type from a message type descriptor.\n * @param {string} name Message name\n * @param {IType} json Message type descriptor\n * @returns {Type} Created message type\n */\nType.fromJSON = function fromJSON(name, json) {\n var type = new Type(name, json.options);\n type.extensions = json.extensions;\n type.reserved = json.reserved;\n var names = Object.keys(json.fields),\n i = 0;\n for (; i < names.length; ++i)\n type.add(\n ( typeof json.fields[names[i]].keyType !== \"undefined\"\n ? MapField.fromJSON\n : Field.fromJSON )(names[i], json.fields[names[i]])\n );\n if (json.oneofs)\n for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i)\n type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]]));\n if (json.nested)\n for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) {\n var nested = json.nested[names[i]];\n type.add( // most to least likely\n ( nested.id !== undefined\n ? Field.fromJSON\n : nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n if (json.extensions && json.extensions.length)\n type.extensions = json.extensions;\n if (json.reserved && json.reserved.length)\n type.reserved = json.reserved;\n if (json.group)\n type.group = true;\n if (json.comment)\n type.comment = json.comment;\n if (json.edition)\n type._edition = json.edition;\n type._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return type;\n};\n\n/**\n * Converts this message type to a message type descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IType} Message type descriptor\n */\nType.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"options\" , inherited && inherited.options || undefined,\n \"oneofs\" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions),\n \"fields\" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {},\n \"extensions\" , this.extensions && this.extensions.length ? this.extensions : undefined,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"group\" , this.group || undefined,\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nType.prototype.resolveAll = function resolveAll() {\n Namespace.prototype.resolveAll.call(this);\n var oneofs = this.oneofsArray; i = 0;\n while (i < oneofs.length)\n oneofs[i++].resolve();\n var fields = this.fieldsArray, i = 0;\n while (i < fields.length)\n fields[i++].resolve();\n return this;\n};\n\n/**\n * @override\n */\nType.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n edition = this._edition || edition;\n\n Namespace.prototype._resolveFeaturesRecursive.call(this, edition);\n this.oneofsArray.forEach(oneof => {\n oneof._resolveFeatures(edition);\n });\n this.fieldsArray.forEach(field => {\n field._resolveFeatures(edition);\n });\n return this;\n};\n\n/**\n * @override\n */\nType.prototype.get = function get(name) {\n return this.fields[name]\n || this.oneofs && this.oneofs[name]\n || this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Adds a nested object to this type.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\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\n */\nType.prototype.add = function add(object) {\n\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Field && object.extend === undefined) {\n // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects.\n // The root object takes care of adding distinct sister-fields to the respective extended\n // type instead.\n\n // avoids calling the getter if not absolutely necessary because it's called quite frequently\n if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id])\n throw Error(\"duplicate id \" + object.id + \" in \" + this);\n if (this.isReservedId(object.id))\n throw Error(\"id \" + object.id + \" is reserved in \" + this);\n if (this.isReservedName(object.name))\n throw Error(\"name '\" + object.name + \"' is reserved in \" + this);\n\n if (object.parent)\n object.parent.remove(object);\n this.fields[object.name] = object;\n object.message = this;\n object.onAdd(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n if (!this.oneofs)\n this.oneofs = {};\n this.oneofs[object.name] = object;\n object.onAdd(this);\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * Removes a nested object from this type.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this type\n */\nType.prototype.remove = function remove(object) {\n if (object instanceof Field && object.extend === undefined) {\n // See Type#add for the reason why extension fields are excluded here.\n\n /* istanbul ignore if */\n if (!this.fields || this.fields[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.fields[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n\n /* istanbul ignore if */\n if (!this.oneofs || this.oneofs[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.oneofs[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\n};\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message<{}>} Message instance\n */\nType.prototype.create = function create(properties) {\n return new this.ctor(properties);\n};\n\n/**\n * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}.\n * @returns {Type} `this`\n */\nType.prototype.setup = function setup() {\n // Sets up everything at once so that the prototype chain does not have to be re-evaluated\n // multiple times (V8, soft-deopt prototype-check).\n\n var fullName = this.fullName,\n types = [];\n for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i)\n types.push(this._fieldsArray[i].resolve().resolvedType);\n\n // Replace setup methods with type-specific generated functions\n this.encode = encoder(this)({\n Writer : Writer,\n types : types,\n util : util\n });\n this.decode = decoder(this)({\n Reader : Reader,\n types : types,\n util : util\n });\n this.verify = verifier(this)({\n types : types,\n util : util\n });\n this.fromObject = converter.fromObject(this)({\n types : types,\n util : util\n });\n this.toObject = converter.toObject(this)({\n types : types,\n util : util\n });\n\n // Inject custom wrappers for common types\n var wrapper = wrappers[fullName];\n if (wrapper) {\n var originalThis = Object.create(this);\n // if (wrapper.fromObject) {\n originalThis.fromObject = this.fromObject;\n this.fromObject = wrapper.fromObject.bind(originalThis);\n // }\n // if (wrapper.toObject) {\n originalThis.toObject = this.toObject;\n this.toObject = wrapper.toObject.bind(originalThis);\n // }\n }\n\n return this;\n};\n\n/**\n * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encode = function encode_setup(message, writer) {\n return this.setup().encode(message, writer); // overrides this method\n};\n\n/**\n * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim();\n};\n\n/**\n * Decodes a message of this type.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Length of the message, if known beforehand\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError<{}>} If required fields are missing\n */\nType.prototype.decode = function decode_setup(reader, length) {\n return this.setup().decode(reader, length); // overrides this method\n};\n\n/**\n * Decodes a message of this type preceeded by its byte length as a varint.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError} If required fields are missing\n */\nType.prototype.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof Reader))\n reader = Reader.create(reader);\n return this.decode(reader, reader.uint32());\n};\n\n/**\n * Verifies that field values are valid and that required fields are present.\n * @param {Object.} message Plain object to verify\n * @returns {null|string} `null` if valid, otherwise the reason why it is not\n */\nType.prototype.verify = function verify_setup(message) {\n return this.setup().verify(message); // overrides this method\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object to convert\n * @returns {Message<{}>} Message instance\n */\nType.prototype.fromObject = function fromObject(object) {\n return this.setup().fromObject(object);\n};\n\n/**\n * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}.\n * @interface IConversionOptions\n * @property {Function} [longs] Long conversion type.\n * Valid values are `String` and `Number` (the global types).\n * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library.\n * @property {Function} [enums] Enum value conversion type.\n * Only valid value is `String` (the global type).\n * Defaults to copy the present value, which is the numeric id.\n * @property {Function} [bytes] Bytes value conversion type.\n * Valid values are `Array` and (a base64 encoded) `String` (the global types).\n * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser.\n * @property {boolean} [defaults=false] Also sets default values on the resulting object\n * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false`\n * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false`\n * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any\n * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings\n */\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n */\nType.prototype.toObject = function toObject(message, options) {\n return this.setup().toObject(message, options);\n};\n\n/**\n * Decorator function as returned by {@link Type.d} (TypeScript).\n * @typedef TypeDecorator\n * @type {function}\n * @param {Constructor} target Target constructor\n * @returns {undefined}\n * @template T extends Message\n */\n\n/**\n * Type decorator (TypeScript).\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {TypeDecorator} Decorator function\n * @template T extends Message\n */\nType.d = function decorateType(typeName) {\n return function typeDecorator(target) {\n util.decorateType(target, typeName);\n };\n};\n","\"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\";\nmodule.exports = MapField;\n\n// extends Field\nvar Field = require(\"./field\");\n((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = \"MapField\";\n\nvar types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new map field instance.\n * @classdesc Reflected map field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} keyType Key type\n * @param {string} type Value type\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction MapField(name, id, keyType, type, options, comment) {\n Field.call(this, name, id, type, undefined, undefined, options, comment);\n\n /* istanbul ignore if */\n if (!util.isString(keyType))\n throw TypeError(\"keyType must be a string\");\n\n /**\n * Key type.\n * @type {string}\n */\n this.keyType = keyType; // toJSON, marker\n\n /**\n * Resolved key type if not a basic type.\n * @type {ReflectionObject|null}\n */\n this.resolvedKeyType = null;\n\n // Overrides Field#map\n this.map = true;\n}\n\n/**\n * Map field descriptor.\n * @interface IMapField\n * @extends {IField}\n * @property {string} keyType Key type\n */\n\n/**\n * Extension map field descriptor.\n * @interface IExtensionMapField\n * @extends IMapField\n * @property {string} extend Extended type\n */\n\n/**\n * Constructs a map field from a map field descriptor.\n * @param {string} name Field name\n * @param {IMapField} json Map field descriptor\n * @returns {MapField} Created map field\n * @throws {TypeError} If arguments are invalid\n */\nMapField.fromJSON = function fromJSON(name, json) {\n return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment);\n};\n\n/**\n * Converts this map field to a map field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMapField} Map field descriptor\n */\nMapField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"keyType\" , this.keyType,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nMapField.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n\n // Besides a value type, map fields have a key type that may be \"any scalar type except for floating point types and bytes\"\n if (types.mapKey[this.keyType] === undefined)\n throw Error(\"invalid key type: \" + this.keyType);\n\n return Field.prototype.resolve.call(this);\n};\n\n/**\n * Map field decorator (TypeScript).\n * @name MapField.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"} fieldKeyType Field key type\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"|\"bytes\"|Object|Constructor<{}>} fieldValueType Field value type\n * @returns {FieldDecorator} Decorator function\n * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> }\n */\nMapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) {\n\n // submessage value: decorate the submessage and use its name as the type\n if (typeof fieldValueType === \"function\")\n fieldValueType = util.decorateType(fieldValueType).name;\n\n // enum reference value: create a reflected copy of the enum and keep reuseing it\n else if (fieldValueType && typeof fieldValueType === \"object\")\n fieldValueType = util.decorateEnum(fieldValueType).name;\n\n return function mapFieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType));\n };\n};\n","var RetryOperation = require('./retry_operation');\n\nexports.operation = function(options) {\n var timeouts = exports.timeouts(options);\n return new RetryOperation(timeouts, {\n forever: options && (options.forever || options.retries === Infinity),\n unref: options && options.unref,\n maxRetryTime: options && options.maxRetryTime\n });\n};\n\nexports.timeouts = function(options) {\n if (options instanceof Array) {\n return [].concat(options);\n }\n\n var opts = {\n retries: 10,\n factor: 2,\n minTimeout: 1 * 1000,\n maxTimeout: Infinity,\n randomize: false\n };\n for (var key in options) {\n opts[key] = options[key];\n }\n\n if (opts.minTimeout > opts.maxTimeout) {\n throw new Error('minTimeout is greater than maxTimeout');\n }\n\n var timeouts = [];\n for (var i = 0; i < opts.retries; i++) {\n timeouts.push(this.createTimeout(i, opts));\n }\n\n if (options && options.forever && !timeouts.length) {\n timeouts.push(this.createTimeout(i, opts));\n }\n\n // sort the array numerically ascending\n timeouts.sort(function(a,b) {\n return a - b;\n });\n\n return timeouts;\n};\n\nexports.createTimeout = function(attempt, opts) {\n var random = (opts.randomize)\n ? (Math.random() + 1)\n : 1;\n\n var timeout = Math.round(random * Math.max(opts.minTimeout, 1) * Math.pow(opts.factor, attempt));\n timeout = Math.min(timeout, opts.maxTimeout);\n\n return timeout;\n};\n\nexports.wrap = function(obj, options, methods) {\n if (options instanceof Array) {\n methods = options;\n options = null;\n }\n\n if (!methods) {\n methods = [];\n for (var key in obj) {\n if (typeof obj[key] === 'function') {\n methods.push(key);\n }\n }\n }\n\n for (var i = 0; i < methods.length; i++) {\n var method = methods[i];\n var original = obj[method];\n\n obj[method] = function retryWrapper(original) {\n var op = exports.operation(options);\n var args = Array.prototype.slice.call(arguments, 1);\n var callback = args.pop();\n\n args.push(function(err) {\n if (op.retry(err)) {\n return;\n }\n if (err) {\n arguments[0] = op.mainError();\n }\n callback.apply(this, arguments);\n });\n\n op.attempt(function() {\n original.apply(obj, args);\n });\n }.bind(obj, original);\n obj[method].options = options;\n }\n};\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\";\nmodule.exports = Method;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = \"Method\";\n\nvar util = require(\"./util\");\n\n/**\n * Constructs a new service method instance.\n * @classdesc Reflected service method.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Method name\n * @param {string|undefined} type Method type, usually `\"rpc\"`\n * @param {string} requestType Request message type\n * @param {string} responseType Response message type\n * @param {boolean|Object.} [requestStream] Whether the request is streamed\n * @param {boolean|Object.} [responseStream] Whether the response is streamed\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this method\n * @param {Object.} [parsedOptions] Declared options, properly parsed into an object\n */\nfunction Method(name, type, requestType, responseType, requestStream, responseStream, options, comment, parsedOptions) {\n\n /* istanbul ignore next */\n if (util.isObject(requestStream)) {\n options = requestStream;\n requestStream = responseStream = undefined;\n } else if (util.isObject(responseStream)) {\n options = responseStream;\n responseStream = undefined;\n }\n\n /* istanbul ignore if */\n if (!(type === undefined || util.isString(type)))\n throw TypeError(\"type must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(requestType))\n throw TypeError(\"requestType must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(responseType))\n throw TypeError(\"responseType must be a string\");\n\n ReflectionObject.call(this, name, options);\n\n /**\n * Method type.\n * @type {string}\n */\n this.type = type || \"rpc\"; // toJSON\n\n /**\n * Request type.\n * @type {string}\n */\n this.requestType = requestType; // toJSON, marker\n\n /**\n * Whether requests are streamed or not.\n * @type {boolean|undefined}\n */\n this.requestStream = requestStream ? true : undefined; // toJSON\n\n /**\n * Response type.\n * @type {string}\n */\n this.responseType = responseType; // toJSON\n\n /**\n * Whether responses are streamed or not.\n * @type {boolean|undefined}\n */\n this.responseStream = responseStream ? true : undefined; // toJSON\n\n /**\n * Resolved request type.\n * @type {Type|null}\n */\n this.resolvedRequestType = null;\n\n /**\n * Resolved response type.\n * @type {Type|null}\n */\n this.resolvedResponseType = null;\n\n /**\n * Comment for this method\n * @type {string|null}\n */\n this.comment = comment;\n\n /**\n * Options properly parsed into an object\n */\n this.parsedOptions = parsedOptions;\n}\n\n/**\n * Method descriptor.\n * @interface IMethod\n * @property {string} [type=\"rpc\"] Method type\n * @property {string} requestType Request type\n * @property {string} responseType Response type\n * @property {boolean} [requestStream=false] Whether requests are streamed\n * @property {boolean} [responseStream=false] Whether responses are streamed\n * @property {Object.} [options] Method options\n * @property {string} comment Method comments\n * @property {Object.} [parsedOptions] Method options properly parsed into an object\n */\n\n/**\n * Constructs a method from a method descriptor.\n * @param {string} name Method name\n * @param {IMethod} json Method descriptor\n * @returns {Method} Created method\n * @throws {TypeError} If arguments are invalid\n */\nMethod.fromJSON = function fromJSON(name, json) {\n return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment, json.parsedOptions);\n};\n\n/**\n * Converts this method to a method descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMethod} Method descriptor\n */\nMethod.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"type\" , this.type !== \"rpc\" && /* istanbul ignore next */ this.type || undefined,\n \"requestType\" , this.requestType,\n \"requestStream\" , this.requestStream,\n \"responseType\" , this.responseType,\n \"responseStream\" , this.responseStream,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined,\n \"parsedOptions\" , this.parsedOptions,\n ]);\n};\n\n/**\n * @override\n */\nMethod.prototype.resolve = function resolve() {\n\n /* istanbul ignore if */\n if (this.resolved)\n return this;\n\n this.resolvedRequestType = this.parent.lookupType(this.requestType);\n this.resolvedResponseType = this.parent.lookupType(this.responseType);\n\n return ReflectionObject.prototype.resolve.call(this);\n};\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\";\nmodule.exports = Namespace;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = \"Namespace\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\"),\n OneOf = require(\"./oneof\");\n\nvar Type, // cyclic\n Service,\n Enum;\n\n/**\n * Constructs a new namespace instance.\n * @name Namespace\n * @classdesc Reflected namespace.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a namespace from JSON.\n * @memberof Namespace\n * @function\n * @param {string} name Namespace name\n * @param {Object.} json JSON object\n * @returns {Namespace} Created namespace\n * @throws {TypeError} If arguments are invalid\n */\nNamespace.fromJSON = function fromJSON(name, json) {\n return new Namespace(name, json.options).addJSON(json.nested);\n};\n\n/**\n * Converts an array of reflection objects to JSON.\n * @memberof Namespace\n * @param {ReflectionObject[]} array Object array\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {Object.|undefined} JSON object or `undefined` when array is empty\n */\nfunction arrayToJSON(array, toJSONOptions) {\n if (!(array && array.length))\n return undefined;\n var obj = {};\n for (var i = 0; i < array.length; ++i)\n obj[array[i].name] = array[i].toJSON(toJSONOptions);\n return obj;\n}\n\nNamespace.arrayToJSON = arrayToJSON;\n\n/**\n * Tests if the specified id is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedId = function isReservedId(reserved, id) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (typeof reserved[i] !== \"string\" && reserved[i][0] <= id && reserved[i][1] > id)\n return true;\n return false;\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedName = function isReservedName(reserved, name) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (reserved[i] === name)\n return true;\n return false;\n};\n\n/**\n * Not an actual constructor. Use {@link Namespace} instead.\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.\n * @exports NamespaceBase\n * @extends ReflectionObject\n * @abstract\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n * @see {@link Namespace}\n */\nfunction Namespace(name, options) {\n ReflectionObject.call(this, name, options);\n\n /**\n * Nested objects by name.\n * @type {Object.|undefined}\n */\n this.nested = undefined; // toJSON\n\n /**\n * Cached nested objects as an array.\n * @type {ReflectionObject[]|null}\n * @private\n */\n this._nestedArray = null;\n}\n\nfunction clearCache(namespace) {\n namespace._nestedArray = null;\n return namespace;\n}\n\n/**\n * Nested objects of this namespace as an array for iteration.\n * @name NamespaceBase#nestedArray\n * @type {ReflectionObject[]}\n * @readonly\n */\nObject.defineProperty(Namespace.prototype, \"nestedArray\", {\n get: function() {\n return this._nestedArray || (this._nestedArray = util.toArray(this.nested));\n }\n});\n\n/**\n * Namespace descriptor.\n * @interface INamespace\n * @property {Object.} [options] Namespace options\n * @property {Object.} [nested] Nested object descriptors\n */\n\n/**\n * Any extension field descriptor.\n * @typedef AnyExtensionField\n * @type {IExtensionField|IExtensionMapField}\n */\n\n/**\n * Any nested object descriptor.\n * @typedef AnyNestedObject\n * @type {IEnum|IType|IService|AnyExtensionField|INamespace|IOneOf}\n */\n\n/**\n * Converts this namespace to a namespace descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {INamespace} Namespace descriptor\n */\nNamespace.prototype.toJSON = function toJSON(toJSONOptions) {\n return util.toObject([\n \"options\" , this.options,\n \"nested\" , arrayToJSON(this.nestedArray, toJSONOptions)\n ]);\n};\n\n/**\n * Adds nested objects to this namespace from nested object descriptors.\n * @param {Object.} nestedJson Any nested object descriptors\n * @returns {Namespace} `this`\n */\nNamespace.prototype.addJSON = function addJSON(nestedJson) {\n var ns = this;\n /* istanbul ignore else */\n if (nestedJson) {\n for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) {\n nested = nestedJson[names[i]];\n ns.add( // most to least likely\n ( nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : nested.id !== undefined\n ? Field.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n }\n return this;\n};\n\n/**\n * Gets the nested object of the specified name.\n * @param {string} name Nested object name\n * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist\n */\nNamespace.prototype.get = function get(name) {\n return this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Gets the values of the nested {@link Enum|enum} of the specified name.\n * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`.\n * @param {string} name Nested enum name\n * @returns {Object.} Enum values\n * @throws {Error} If there is no such enum\n */\nNamespace.prototype.getEnum = function getEnum(name) {\n if (this.nested && this.nested[name] instanceof Enum)\n return this.nested[name].values;\n throw Error(\"no such enum: \" + name);\n};\n\n/**\n * Adds a nested object to this namespace.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a nested object with this name\n */\nNamespace.prototype.add = function add(object) {\n\n if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof OneOf || object instanceof Enum || object instanceof Service || object instanceof Namespace))\n throw TypeError(\"object must be a valid nested object\");\n\n if (!this.nested)\n this.nested = {};\n else {\n var prev = this.get(object.name);\n if (prev) {\n if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) {\n // replace plain namespace but keep existing nested elements and options\n var nested = prev.nestedArray;\n for (var i = 0; i < nested.length; ++i)\n object.add(nested[i]);\n this.remove(prev);\n if (!this.nested)\n this.nested = {};\n object.setOptions(prev.options, true);\n\n } else\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n }\n }\n this.nested[object.name] = object;\n\n if (!(this instanceof Type || this instanceof Service || this instanceof Enum || this instanceof Field)) {\n // This is a package or a root namespace.\n if (!object._edition) {\n // Make sure that some edition is set if it hasn't already been specified.\n object._edition = object._defaultEdition;\n }\n }\n\n object.onAdd(this);\n return clearCache(this);\n};\n\n/**\n * Removes a nested object from this namespace.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this namespace\n */\nNamespace.prototype.remove = function remove(object) {\n\n if (!(object instanceof ReflectionObject))\n throw TypeError(\"object must be a ReflectionObject\");\n if (object.parent !== this)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.nested[object.name];\n if (!Object.keys(this.nested).length)\n this.nested = undefined;\n\n object.onRemove(this);\n return clearCache(this);\n};\n\n/**\n * Defines additial namespaces within this one if not yet existing.\n * @param {string|string[]} path Path to create\n * @param {*} [json] Nested types to create from JSON\n * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty\n */\nNamespace.prototype.define = function define(path, json) {\n\n if (util.isString(path))\n path = path.split(\".\");\n else if (!Array.isArray(path))\n throw TypeError(\"illegal path\");\n if (path && path.length && path[0] === \"\")\n throw Error(\"path must be relative\");\n\n var ptr = this;\n while (path.length > 0) {\n var part = path.shift();\n if (ptr.nested && ptr.nested[part]) {\n ptr = ptr.nested[part];\n if (!(ptr instanceof Namespace))\n throw Error(\"path conflicts with non-namespace objects\");\n } else\n ptr.add(ptr = new Namespace(part));\n }\n if (json)\n ptr.addJSON(json);\n return ptr;\n};\n\n/**\n * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost.\n * @returns {Namespace} `this`\n */\nNamespace.prototype.resolveAll = function resolveAll() {\n var nested = this.nestedArray, i = 0;\n this.resolve();\n while (i < nested.length)\n if (nested[i] instanceof Namespace)\n nested[i++].resolveAll();\n else\n nested[i++].resolve();\n return this;\n};\n\n/**\n * @override\n */\nNamespace.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n edition = this._edition || edition;\n\n ReflectionObject.prototype._resolveFeaturesRecursive.call(this, edition);\n this.nestedArray.forEach(nested => {\n nested._resolveFeaturesRecursive(edition);\n });\n return this;\n};\n\n/**\n * Recursively looks up the reflection object matching the specified path in the scope of this namespace.\n * @param {string|string[]} path Path to look up\n * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc.\n * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n */\nNamespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) {\n\n /* istanbul ignore next */\n if (typeof filterTypes === \"boolean\") {\n parentAlreadyChecked = filterTypes;\n filterTypes = undefined;\n } else if (filterTypes && !Array.isArray(filterTypes))\n filterTypes = [ filterTypes ];\n\n if (util.isString(path) && path.length) {\n if (path === \".\")\n return this.root;\n path = path.split(\".\");\n } else if (!path.length)\n return this;\n\n // Start at root if path is absolute\n if (path[0] === \"\")\n return this.root.lookup(path.slice(1), filterTypes);\n\n // Test if the first part matches any nested object, and if so, traverse if path contains more\n var found = this.get(path[0]);\n if (found) {\n if (path.length === 1) {\n if (!filterTypes || filterTypes.indexOf(found.constructor) > -1)\n return found;\n } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true)))\n return found;\n\n // Otherwise try each nested namespace\n } else\n for (var i = 0; i < this.nestedArray.length; ++i)\n if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true)))\n return found;\n\n // If there hasn't been a match, try again at the parent\n if (this.parent === null || parentAlreadyChecked)\n return null;\n return this.parent.lookup(path, filterTypes);\n};\n\n/**\n * Looks up the reflection object at the specified path, relative to this namespace.\n * @name NamespaceBase#lookup\n * @function\n * @param {string|string[]} path Path to look up\n * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n * @variation 2\n */\n// lookup(path: string, [parentAlreadyChecked: boolean])\n\n/**\n * Looks up the {@link Type|type} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type\n * @throws {Error} If `path` does not point to a type\n */\nNamespace.prototype.lookupType = function lookupType(path) {\n var found = this.lookup(path, [ Type ]);\n if (!found)\n throw Error(\"no such type: \" + path);\n return found;\n};\n\n/**\n * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Enum} Looked up enum\n * @throws {Error} If `path` does not point to an enum\n */\nNamespace.prototype.lookupEnum = function lookupEnum(path) {\n var found = this.lookup(path, [ Enum ]);\n if (!found)\n throw Error(\"no such Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type or enum\n * @throws {Error} If `path` does not point to a type or enum\n */\nNamespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) {\n var found = this.lookup(path, [ Type, Enum ]);\n if (!found)\n throw Error(\"no such Type or Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Service|service} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Service} Looked up service\n * @throws {Error} If `path` does not point to a service\n */\nNamespace.prototype.lookupService = function lookupService(path) {\n var found = this.lookup(path, [ Service ]);\n if (!found)\n throw Error(\"no such Service '\" + path + \"' in \" + this);\n return found;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nNamespace._configure = function(Type_, Service_, Enum_) {\n Type = Type_;\n Service = Service_;\n Enum = Enum_;\n};\n","\"use strict\";\nvar protobuf = module.exports = require(\"./index-light\");\n\nprotobuf.build = \"full\";\n\n// Parser\nprotobuf.tokenize = require(\"./tokenize\");\nprotobuf.parse = require(\"./parse\");\nprotobuf.common = require(\"./common\");\n\n// Configure parser\nprotobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common);\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\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\";\nmodule.exports = Service;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = \"Service\";\n\nvar Method = require(\"./method\"),\n util = require(\"./util\"),\n rpc = require(\"./rpc\");\n\n/**\n * Constructs a new service instance.\n * @classdesc Reflected service.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Service name\n * @param {Object.} [options] Service options\n * @throws {TypeError} If arguments are invalid\n */\nfunction Service(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Service methods.\n * @type {Object.}\n */\n this.methods = {}; // toJSON, marker\n\n /**\n * Cached methods as an array.\n * @type {Method[]|null}\n * @private\n */\n this._methodsArray = null;\n}\n\n/**\n * Service descriptor.\n * @interface IService\n * @extends INamespace\n * @property {Object.} methods Method descriptors\n */\n\n/**\n * Constructs a service from a service descriptor.\n * @param {string} name Service name\n * @param {IService} json Service descriptor\n * @returns {Service} Created service\n * @throws {TypeError} If arguments are invalid\n */\nService.fromJSON = function fromJSON(name, json) {\n var service = new Service(name, json.options);\n /* istanbul ignore else */\n if (json.methods)\n for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i)\n service.add(Method.fromJSON(names[i], json.methods[names[i]]));\n if (json.nested)\n service.addJSON(json.nested);\n if (json.edition)\n service._edition = json.edition;\n service.comment = json.comment;\n service._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return service;\n};\n\n/**\n * Converts this service to a service descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IService} Service descriptor\n */\nService.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"options\" , inherited && inherited.options || undefined,\n \"methods\" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {},\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Methods of this service as an array for iteration.\n * @name Service#methodsArray\n * @type {Method[]}\n * @readonly\n */\nObject.defineProperty(Service.prototype, \"methodsArray\", {\n get: function() {\n return this._methodsArray || (this._methodsArray = util.toArray(this.methods));\n }\n});\n\nfunction clearCache(service) {\n service._methodsArray = null;\n return service;\n}\n\n/**\n * @override\n */\nService.prototype.get = function get(name) {\n return this.methods[name]\n || Namespace.prototype.get.call(this, name);\n};\n\n/**\n * @override\n */\nService.prototype.resolveAll = function resolveAll() {\n Namespace.prototype.resolve.call(this);\n var methods = this.methodsArray;\n for (var i = 0; i < methods.length; ++i)\n methods[i].resolve();\n return this;\n};\n\n/**\n * @override\n */\nService.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n edition = this._edition || edition;\n\n Namespace.prototype._resolveFeaturesRecursive.call(this, edition);\n this.methodsArray.forEach(method => {\n method._resolveFeaturesRecursive(edition);\n });\n return this;\n};\n\n/**\n * @override\n */\nService.prototype.add = function add(object) {\n\n /* istanbul ignore if */\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Method) {\n this.methods[object.name] = object;\n object.parent = this;\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * @override\n */\nService.prototype.remove = function remove(object) {\n if (object instanceof Method) {\n\n /* istanbul ignore if */\n if (this.methods[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.methods[object.name];\n object.parent = null;\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Creates a runtime service using the specified rpc implementation.\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed.\n */\nService.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) {\n var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited);\n for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) {\n var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\\w_]/g, \"\");\n rpcService[methodName] = util.codegen([\"r\",\"c\"], util.isReserved(methodName) ? methodName + \"_\" : methodName)(\"return this.rpcCall(m,q,s,r,c)\")({\n m: method,\n q: method.resolvedRequestType.ctor,\n s: method.resolvedResponseType.ctor\n });\n }\n return rpcService;\n};\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","// 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 const prefixCodePoint = prefix.codePointAt(0);\n /* c8 ignore next 3 */\n if (prefixCodePoint === undefined) {\n throw new Error('Invalid prefix character');\n }\n this.prefixCodePoint = prefixCodePoint;\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) => {\n const codePoint = c.codePointAt(0);\n if (codePoint == null) {\n throw new Error(`Invalid character: ${c}`);\n }\n p[codePoint] = i;\n return p;\n}, ([])));\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 codePoint = char.codePointAt(0);\n if (codePoint == null) {\n throw new Error(`Invalid character: ${char}`);\n }\n const byt = alphabetCharsToBytes[codePoint];\n if (byt == null) {\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/**\n * Used to check that the passed multihash has the passed code\n */\nexport function hasCode(digest, code) {\n return digest.code === code;\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 { base36 } from './bases/base36.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 case base36.prefix: {\n const decoder = base ?? base36;\n return [base36.prefix, decoder.decode(source)];\n }\n default: {\n if (base == null) {\n throw Error('To parse non base32, base36 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","/* 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 SdsMessage;\n(function (SdsMessage) {\n let _codec;\n SdsMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.messageId != null && obj.messageId !== '')) {\n w.uint32(18);\n w.string(obj.messageId);\n }\n if ((obj.channelId != null && obj.channelId !== '')) {\n w.uint32(26);\n w.string(obj.channelId);\n }\n if (obj.lamportTimestamp != null) {\n w.uint32(80);\n w.int32(obj.lamportTimestamp);\n }\n if (obj.causalHistory != null) {\n for (const value of obj.causalHistory) {\n w.uint32(90);\n w.string(value);\n }\n }\n if (obj.bloomFilter != null) {\n w.uint32(98);\n w.bytes(obj.bloomFilter);\n }\n if (obj.content != null) {\n w.uint32(162);\n w.bytes(obj.content);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n messageId: '',\n channelId: '',\n causalHistory: []\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.messageId = reader.string();\n break;\n }\n case 3: {\n obj.channelId = reader.string();\n break;\n }\n case 10: {\n obj.lamportTimestamp = reader.int32();\n break;\n }\n case 11: {\n if (opts.limits?.causalHistory != null && obj.causalHistory.length === opts.limits.causalHistory) {\n throw new MaxLengthError('Decode error - map field \"causalHistory\" had too many elements');\n }\n obj.causalHistory.push(reader.string());\n break;\n }\n case 12: {\n obj.bloomFilter = reader.bytes();\n break;\n }\n case 20: {\n obj.content = 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 SdsMessage.encode = (obj) => {\n return encodeMessage(obj, SdsMessage.codec());\n };\n SdsMessage.decode = (buf, opts) => {\n return decodeMessage(buf, SdsMessage.codec(), opts);\n };\n})(SdsMessage || (SdsMessage = {}));\n//# sourceMappingURL=sds_message.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","/**\n * Internal assertion helpers.\n * @module\n */\n/** Asserts something is positive integer. */\nfunction anumber(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error('positive integer expected, got ' + n);\n}\n/** Is number an Uint8Array? Copied from utils for perf. */\nfunction isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is Uint8Array. */\nfunction abytes(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 + ', got length=' + b.length);\n}\n/** Asserts something is hash */\nfunction ahash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nfunction aexists(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}\n/** Asserts output is properly-sized byte array */\nfunction aoutput(out, instance) {\n abytes(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 { anumber, abytes, ahash, aexists, aoutput };\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! 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 { abytes } from \"./_assert.js\";\n// export { isBytes } from './_assert.ts';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n// Cast array to different type\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n// Cast array to view\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n// The byte swap operation for uint32\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const byteSwapIfBE = isLE\n ? (n) => 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// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function';\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 * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\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(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\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 // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('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; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n }\n return array;\n}\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.\n */\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 * Convert JS string to byte array.\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}\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.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}\n/** Wraps hash function, creating an interface on top of it */\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/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n // Legacy Node.js compatibility\n if (crypto && typeof crypto.randomBytes === 'function') {\n return Uint8Array.from(crypto.randomBytes(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { aexists, aoutput } from \"./_assert.js\";\nimport { Hash, createView, toBytes } from \"./utils.js\";\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\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}\n/** Choice: a ? b : c */\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\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.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(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 aexists(this);\n aoutput(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","/**\n * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.\n *\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n *\n * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n */\nimport { Chi, HashMD, Maj } from \"./_md.js\";\nimport { rotr, wrapConstructor } from \"./utils.js\";\n/** Round constants: first 32 bits of 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: first 32 bits of 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/**\n * Temporary buffer, not used to store anything between runs.\n * Named this way because it matches specification.\n */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD {\n constructor(outputLen = 32) {\n super(64, outputLen, 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/**\n * Constants taken from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf.\n */\nclass SHA224 extends SHA256 {\n constructor() {\n super(28);\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 }\n}\n/** SHA2-256 hash function */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\n/** SHA2-224 hash function */\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 //\n // GENERAL ERRORS SECTION\n //\n /**\n * Could not determine the origin of the fault. Best to check connectivity and try again\n * */\n ProtocolError[\"GENERIC_FAIL\"] = \"Generic error\";\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 * 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 * 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 // SEND ERRORS SECTION\n //\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 * 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 * Fails when\n */\n ProtocolError[\"STREAM_ABORTED\"] = \"Stream aborted\";\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 //\n // RECEIVE ERRORS SECTION\n //\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})(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 * The default number of shards under a cluster.\n */\nexport const DEFAULT_NUM_SHARDS = 8;\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 HealthStatusChangeEvents;\n(function (HealthStatusChangeEvents) {\n HealthStatusChangeEvents[\"StatusChange\"] = \"health:change\";\n})(HealthStatusChangeEvents || (HealthStatusChangeEvents = {}));\nexport var HealthStatus;\n(function (HealthStatus) {\n HealthStatus[\"Unhealthy\"] = \"Unhealthy\";\n HealthStatus[\"MinimallyHealthy\"] = \"MinimallyHealthy\";\n HealthStatus[\"SufficientlyHealthy\"] = \"SufficientlyHealthy\";\n})(HealthStatus || (HealthStatus = {}));\n//# sourceMappingURL=health_indicator.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","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 * 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 // the passed promise may yet resolve or reject but the use has signalled\n // they are no longer interested so smother the error\n promise.catch(() => { });\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 error;\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 this.error = err;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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 this.error ?? 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 * @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 { queuelessPushable } from 'it-queueless-pushable';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nasync function addAllToPushable(sources, output) {\n try {\n await Promise.all(sources.map(async (source) => {\n for await (const item of source) {\n await output.push(item);\n }\n }));\n await output.end();\n }\n catch (err) {\n await output.end(err)\n .catch(() => { });\n }\n}\nasync function* mergeSources(sources) {\n const output = queuelessPushable();\n addAllToPushable(sources, output)\n .catch(() => { });\n yield* output;\n}\nfunction* mergeSyncSources(syncSources) {\n for (const source of syncSources) {\n yield* source;\n }\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 mergeSyncSources(syncSources);\n }\n return mergeSources(sources);\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","export function selectOpenConnection(connections) {\n return connections\n .filter((c) => c.status === \"open\")\n .sort((left, right) => right.timeline.open - left.timeline.open)\n .at(0);\n}\n//# sourceMappingURL=utils.js.map","import { Logger } from \"@waku/utils\";\nimport { selectOpenConnection } from \"./utils.js\";\nconst STREAM_LOCK_KEY = \"consumed\";\nexport class StreamManager {\n multicodec;\n getConnections;\n addEventListener;\n log;\n ongoingCreation = new Set();\n streamPool = new Map();\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.addEventListener(\"peer:update\", this.handlePeerUpdateStreamPool);\n }\n async getStream(peerId) {\n const peerIdStr = peerId.toString();\n const scheduledStream = this.streamPool.get(peerIdStr);\n if (scheduledStream) {\n this.streamPool.delete(peerIdStr);\n await scheduledStream;\n }\n let stream = this.getOpenStreamForCodec(peerId);\n if (stream) {\n this.log.info(`Found existing stream peerId=${peerIdStr} multicodec=${this.multicodec}`);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n stream = await this.createStream(peerId);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n async createStream(peerId, retries = 0) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n throw new Error(`Failed to get a connection to the peer peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n }\n let lastError;\n let stream;\n for (let i = 0; i < retries + 1; i++) {\n try {\n this.log.info(`Attempting to create a stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n stream = await connection.newStream(this.multicodec);\n this.log.info(`Created stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n break;\n }\n catch (error) {\n lastError = error;\n }\n }\n if (!stream) {\n throw new Error(`Failed to create a new stream for ${peerId.toString()} -- ` + lastError);\n }\n return stream;\n }\n async createStreamWithLock(peer) {\n const peerId = peer.id.toString();\n if (this.ongoingCreation.has(peerId)) {\n this.log.info(`Skipping creation of a stream due to lock for peerId=${peerId} multicodec=${this.multicodec}`);\n return;\n }\n try {\n this.ongoingCreation.add(peerId);\n await this.createStream(peer.id);\n }\n catch (error) {\n this.log.error(`Failed to createStreamWithLock:`, error);\n }\n finally {\n this.ongoingCreation.delete(peerId);\n }\n return;\n }\n handlePeerUpdateStreamPool = (evt) => {\n const { peer } = evt.detail;\n if (!peer.protocols.includes(this.multicodec)) {\n return;\n }\n const stream = this.getOpenStreamForCodec(peer.id);\n if (stream) {\n return;\n }\n this.scheduleNewStream(peer);\n };\n scheduleNewStream(peer) {\n this.log.info(`Scheduling creation of a stream for peerId=${peer.id.toString()} multicodec=${this.multicodec}`);\n // abandon previous attempt\n if (this.streamPool.has(peer.id.toString())) {\n this.streamPool.delete(peer.id.toString());\n }\n this.streamPool.set(peer.id.toString(), this.createStreamWithLock(peer));\n }\n getOpenStreamForCodec(peerId) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n return;\n }\n const stream = connection.streams.find((s) => s.protocol === this.multicodec);\n if (!stream) {\n return;\n }\n const isStreamUnusable = [\"done\", \"closed\", \"closing\"].includes(stream.writeStatus || \"\");\n if (isStreamUnusable || this.isStreamLocked(stream)) {\n return;\n }\n return stream;\n }\n lockStream(peerId, stream) {\n this.log.info(`Locking stream for peerId:${peerId}\\tstreamId:${stream.id}`);\n stream.metadata[STREAM_LOCK_KEY] = true;\n }\n isStreamLocked(stream) {\n return !!stream.metadata[STREAM_LOCK_KEY];\n }\n}\n//# sourceMappingURL=stream_manager.js.map","import { 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 pubsubTopics;\n addLibp2pEventListener;\n removeLibp2pEventListener;\n streamManager;\n constructor(multicodec, components, pubsubTopics) {\n this.multicodec = multicodec;\n this.components = components;\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(peerId) {\n return this.streamManager.getStream(peerId);\n }\n}\n//# sourceMappingURL=base_protocol.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, 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, peerId, contentTopics) {\n const stream = await this.getStream(peerId);\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: peerId\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: peerId\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peerId\n };\n }\n async unsubscribe(pubsubTopic, peerId, contentTopics) {\n let stream;\n try {\n stream = await this.getStream(peerId);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peerId.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peerId\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: peerId\n }\n };\n }\n return {\n success: peerId,\n failure: null\n };\n }\n async unsubscribeAll(pubsubTopic, peerId) {\n const stream = await this.getStream(peerId);\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: peerId\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: peerId\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peerId\n };\n }\n async ping(peerId) {\n let stream;\n try {\n stream = await this.getStream(peerId);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peerId.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peerId\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: peerId\n }\n };\n }\n if (!res || !res.length) {\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peerId\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: peerId\n }\n };\n }\n return {\n success: peerId,\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 }, async (e) => {\n log.error(`Error with receiving pipe on peer:${connection.remotePeer.toString()} -- stream:${stream.id} -- protocol:${stream.protocol}: `, e);\n });\n }\n catch (e) {\n log.error(\"Error decoding message\", e);\n }\n }\n}\n//# sourceMappingURL=filter.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","// 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 proof\";\nconst RLN_MESSAGE_ID_PREFIX_ERROR = \"could not get new message id to generate an rln proof\";\n// rare case on nwaku side\n// https://github.com/waku-org/nwaku/blob/a4e92a3d02448fd708857b7b6cac2a7faa7eb4f9/waku/waku_lightpush/callbacks.nim#L49\n// https://github.com/waku-org/nwaku/blob/a4e92a3d02448fd708857b7b6cac2a7faa7eb4f9/waku/node/waku_node.nim#L1117\nconst RLN_REMOTE_VALIDATION = \"RLN validation failed\";\nexport const isRLNResponseError = (info) => {\n if (!info) {\n return false;\n }\n return (info.includes(RLN_GENERATION_PREFIX_ERROR) ||\n info.includes(RLN_MESSAGE_ID_PREFIX_ERROR) ||\n info.includes(RLN_REMOTE_VALIDATION));\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 } 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, 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, peerId) {\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\n }\n };\n }\n let stream;\n try {\n stream = await this.getStream(peerId);\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: peerId\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 // can fail only because of `stream` abortion\n log.error(\"Failed to send waku light push request\", err);\n return {\n success: null,\n failure: {\n error: ProtocolError.STREAM_ABORTED,\n peerId: peerId\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: peerId\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: peerId\n }\n };\n }\n if (isRLNResponseError(response.info)) {\n log.error(\"Remote peer fault: RLN generation\");\n return {\n success: null,\n failure: {\n error: ProtocolError.RLN_PROOF_GENERATION,\n peerId: peerId\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: peerId\n }\n };\n }\n return { success: peerId, failure: null };\n }\n}\n//# sourceMappingURL=light_push.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, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n }\n async *queryPerPage(queryOpts, decoders, peerId) {\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(peerId);\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=store.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}\n//# sourceMappingURL=event-target.js.map","/**\n * All PeerId implementations must use this symbol as the name of a property\n * with a boolean `true` value\n */\nexport const peerIdSymbol = Symbol.for('@libp2p/peer-id');\n/**\n * Returns true if the passed argument is a PeerId implementation\n */\nexport function isPeerId(other) {\n return Boolean(other?.[peerIdSymbol]);\n}\n//# sourceMappingURL=peer-id.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 IPv4 `input` into IPv6 with IPv4-mapped bytes, eg ::ffff:1.2.3.4 */\nexport function parseIPv4Mapped(input) {\n if (input.length > MAX_IPV4_LENGTH) {\n return undefined;\n }\n const ipv4 = parser.new(input).parseWith(() => parser.readIPv4Addr());\n if (ipv4 === undefined) {\n return undefined;\n }\n return Uint8Array.from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff, ipv4[0], ipv4[1], ipv4[2], ipv4[3]]);\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, mapIPv4ToIPv6 = false) {\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 const addr = parser.new(input).parseWith(() => parser.readIPAddr());\n if (!addr) {\n return undefined;\n }\n if (mapIPv4ToIPv6 && addr.length === 4) {\n return Uint8Array.from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff, addr[0], addr[1], addr[2], addr[3]]);\n }\n return addr;\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 } 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 { IPv4Len, IPv6Len } from \"./ip.js\";\nexport function allFF(a, from, to) {\n let i = 0;\n for (const e of a) {\n if (i < from)\n continue;\n if (i > to)\n break;\n if (e !== 0xff)\n return false;\n i++;\n }\n return true;\n}\nexport function deepEqual(a, b, from, to) {\n let i = 0;\n for (const e of a) {\n if (i < from)\n continue;\n if (i > to)\n break;\n if (e !== b[i])\n return false;\n i++;\n }\n return true;\n}\n/***\n * Returns long ip format\n */\nexport function ipToString(ip) {\n switch (ip.length) {\n case IPv4Len: {\n return ip.join(\".\");\n }\n case IPv6Len: {\n const result = [];\n for (let i = 0; i < ip.length; i++) {\n if (i % 2 === 0) {\n result.push(ip[i].toString(16).padStart(2, \"0\") +\n ip[i + 1].toString(16).padStart(2, \"0\"));\n }\n }\n return result.join(\":\");\n }\n default: {\n throw new Error(\"Invalid ip length\");\n }\n }\n}\n/**\n * If mask is a sequence of 1 bits followed by 0 bits, return number of 1 bits else -1\n */\nexport function simpleMaskLength(mask) {\n let ones = 0;\n // eslint-disable-next-line prefer-const\n for (let [index, byte] of mask.entries()) {\n if (byte === 0xff) {\n ones += 8;\n continue;\n }\n while ((byte & 0x80) != 0) {\n ones++;\n byte = byte << 1;\n }\n if ((byte & 0x80) != 0) {\n return -1;\n }\n for (let i = index + 1; i < mask.length; i++) {\n if (mask[i] != 0) {\n return -1;\n }\n }\n break;\n }\n return ones;\n}\nexport function maskToHex(mask) {\n let hex = \"0x\";\n for (const byte of mask) {\n hex += (byte >> 4).toString(16) + (byte & 0x0f).toString(16);\n }\n return hex;\n}\n//# sourceMappingURL=util.js.map","import { parseIPv4, parseIPv6 } from \"@chainsafe/is-ip/parse\";\nimport { IPv4Len, IPv6Len, maskIp } from \"./ip.js\";\nexport function parseCidr(s) {\n const [address, maskString] = s.split(\"/\");\n if (!address || !maskString)\n throw new Error(\"Failed to parse given CIDR: \" + s);\n let ipLength = IPv4Len;\n let ip = parseIPv4(address);\n if (ip == null) {\n ipLength = IPv6Len;\n ip = parseIPv6(address);\n if (ip == null)\n throw new Error(\"Failed to parse given CIDR: \" + s);\n }\n const m = parseInt(maskString, 10);\n if (Number.isNaN(m) ||\n String(m).length !== maskString.length ||\n m < 0 ||\n m > ipLength * 8) {\n throw new Error(\"Failed to parse given CIDR: \" + s);\n }\n const mask = cidrMask(m, 8 * ipLength);\n return {\n network: maskIp(ip, mask),\n mask,\n };\n}\nexport function cidrMask(ones, bits) {\n if (bits !== 8 * IPv4Len && bits !== 8 * IPv6Len)\n throw new Error(\"Invalid CIDR mask\");\n if (ones < 0 || ones > bits)\n throw new Error(\"Invalid CIDR mask\");\n const l = bits / 8;\n const m = new Uint8Array(l);\n for (let i = 0; i < l; i++) {\n if (ones >= 8) {\n m[i] = 0xff;\n ones -= 8;\n continue;\n }\n m[i] = 255 - (0xff >> ones);\n ones = 0;\n }\n return m;\n}\n//# sourceMappingURL=cidr.js.map","import { parseIP } from \"@chainsafe/is-ip/parse\";\nimport { cidrMask, parseCidr } from \"./cidr.js\";\nimport { containsIp, maskIp } from \"./ip.js\";\nimport { ipToString, maskToHex, simpleMaskLength } from \"./util.js\";\nexport class IpNet {\n /**\n *\n * @param ipOrCidr either network ip or full cidr address\n * @param mask in case ipOrCidr is network this can be either mask in decimal format or as ip address\n */\n constructor(ipOrCidr, mask) {\n if (mask == null) {\n ({ network: this.network, mask: this.mask } = parseCidr(ipOrCidr));\n }\n else {\n const ipResult = parseIP(ipOrCidr);\n if (ipResult == null) {\n throw new Error(\"Failed to parse network\");\n }\n mask = String(mask);\n const m = parseInt(mask, 10);\n if (Number.isNaN(m) ||\n String(m).length !== mask.length ||\n m < 0 ||\n m > ipResult.length * 8) {\n const maskResult = parseIP(mask);\n if (maskResult == null) {\n throw new Error(\"Failed to parse mask\");\n }\n this.mask = maskResult;\n }\n else {\n this.mask = cidrMask(m, 8 * ipResult.length);\n }\n this.network = maskIp(ipResult, this.mask);\n }\n }\n /**\n * Checks if netmask contains ip address\n * @param ip\n * @returns\n */\n contains(ip) {\n return containsIp({ network: this.network, mask: this.mask }, ip);\n }\n /**Serializes back to string format */\n toString() {\n const l = simpleMaskLength(this.mask);\n const mask = l !== -1 ? String(l) : maskToHex(this.mask);\n return ipToString(this.network) + \"/\" + mask;\n }\n}\n//# sourceMappingURL=ipnet.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 { 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","import { 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 */\n// eslint-disable-next-line complexity\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 43: // ipcidr\n return uint8ArrayToString(buf, 'base10');\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}\n// eslint-disable-next-line complexity\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 43: // ipcidr\n return uint8ArrayFromString(str, 'base10');\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 new 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 new 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 * [[num code, str value?]... ] -> Tuple[]\n */\nexport function stringTuplesToTuples(stringTuples) {\n const tuples = [];\n stringTuples.forEach(([code, value]) => {\n const tuple = [code];\n if (value != null) {\n tuple[1] = convertToBytes(code, value);\n }\n tuples.push(tuple);\n });\n return tuples;\n}\n/**\n * [[num code, str value?]... ] -> 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 new 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 class ParseError extends Error {\n static name = 'ParseError';\n name = 'ParseError';\n constructor(str) {\n super(`Error parsing address: ${str}`);\n }\n}\n//# sourceMappingURL=codec.js.map","/* eslint-disable complexity */\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];\nclass NoAvailableResolverError extends Error {\n constructor(message = 'No available resolver') {\n super(message);\n this.name = 'NoAvailableResolverError';\n }\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 === 'tcp' ? 'tcp' : 'udp';\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 === 'tcp' ? 'tcp' : 'udp';\n port = parseInt(value ?? '');\n }\n if (code === ip4.code || code === ip6.code) {\n transport = getProtocol(code).name === 'tcp' ? 'tcp' : 'udp';\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.map(([code, value]) => {\n if (value == null) {\n return [code];\n }\n return [code, value];\n });\n }\n stringTuples() {\n return this.#stringTuples.map(([code, value]) => {\n if (value == null) {\n return [code];\n }\n return [code, value];\n });\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 NoAvailableResolverError(`no available resolver for ${resolvableProto.name}`);\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 *\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 { dnsaddrResolver } from '@multiformats/multiaddr/resolvers'\n *\n * resolvers.set('dnsaddr', dnsaddrResolver)\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(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 * resolvers: {\n * '.': dnsJsonOverHttps('https://cloudflare-dns.com/dns-query')\n * }\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 { stringTuplesToTuples, tuplesToBytes } from './codec.js';\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 * Create a {@link Multiaddr} from an array of {@link Tuple}s\n *\n * @example\n *\n * ```ts\n * import { fromTuples, multiaddr } from '@multiformats/multiaddr'\n *\n * const ma = multiaddr('/ip4/127.0.0.1')\n * const tuples = ma.tuples()\n *\n * const ma2 = fromTuples(tuples)\n *\n * console.info(ma2)\n * // '/ip4/127.0.0.1'\n * ```\n */\nexport function fromTuples(tuples) {\n return multiaddr(tuplesToBytes(tuples));\n}\n/**\n * Create a {@link Multiaddr} from an array of {@link StringTuple}s\n *\n * @example\n *\n * ```ts\n * import { fromStringTuples, multiaddr } from '@multiformats/multiaddr'\n *\n * const ma = multiaddr('/ip4/127.0.0.1')\n * const tuples = ma.stringTuples()\n *\n * const ma2 = fromStringTuples(tuples)\n *\n * console.info(ma2)\n * // '/ip4/127.0.0.1'\n * ```\n */\nexport function fromStringTuples(tuples) {\n return fromTuples(stringTuplesToTuples(tuples));\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 { Logger, pubsubTopicToSingleShardInfo } from \"@waku/utils\";\nimport { utf8ToBytes } from \"@waku/utils/bytes\";\nimport { createEncoder } from \"../message/version_0.js\";\nconst 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 { bytesToUtf8 } from \"@waku/utils/bytes\";\n/**\n * Reads peer's metadata and retrieves ping value.\n * @param peer Peer or null\n * @returns -1 if no ping attached, otherwise returns ping value\n */\nexport const getPeerPing = (peer) => {\n if (!peer) {\n return -1;\n }\n try {\n const bytes = peer.metadata.get(\"ping\");\n if (!bytes) {\n return -1;\n }\n return Number(bytesToUtf8(bytes));\n }\n catch (e) {\n return -1;\n }\n};\n//# sourceMappingURL=utils.js.map","import { isPeerId, TypedEventEmitter } from \"@libp2p/interface\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\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\";\nimport { getPeerPing } from \"./utils.js\";\nconst log = new Logger(\"connection-manager\");\nconst DEFAULT_MAX_BOOTSTRAP_PEERS_ALLOWED = 1;\nconst DEFAULT_MAX_DIAL_ATTEMPTS_FOR_PEER = 3;\nconst DEFAULT_MAX_PARALLEL_DIALS = 3;\nconst DEFAULT_PING_KEEP_ALIVE_SEC = 5 * 60;\nconst DEFAULT_RELAY_KEEP_ALIVE_SEC = 5 * 60;\nexport class ConnectionManager extends TypedEventEmitter {\n // TODO(weboko): make it private\n pubsubTopics;\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 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(options) {\n super();\n this.libp2p = options.libp2p;\n this.pubsubTopics = options.pubsubTopics;\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 pingKeepAlive: DEFAULT_PING_KEEP_ALIVE_SEC,\n relayKeepAlive: DEFAULT_RELAY_KEEP_ALIVE_SEC,\n ...options.config\n };\n this.keepAliveManager = new KeepAliveManager({\n relay: options.relay,\n libp2p: options.libp2p,\n options: {\n pingKeepAlive: this.options.pingKeepAlive,\n relayKeepAlive: this.options.relayKeepAlive\n }\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 getConnectedPeers(codec) {\n const peerIDs = this.libp2p.getPeers();\n if (peerIDs.length === 0) {\n return [];\n }\n const peers = await Promise.all(peerIDs.map(async (id) => {\n try {\n return await this.libp2p.peerStore.get(id);\n }\n catch (e) {\n return null;\n }\n }));\n return peers\n .filter((p) => !!p)\n .filter((p) => (codec ? p.protocols.includes(codec) : true))\n .sort((left, right) => getPeerPing(left) - getPeerPing(right));\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 /**\n * Attempts to establish a connection with a peer and set up specified protocols.\n * The method handles both PeerId and Multiaddr inputs, manages connection attempts,\n * and maintains the connection state.\n *\n * The dialing process includes:\n * 1. Converting input to dialable peer info\n * 2. Managing parallel dial attempts\n * 3. Attempting to establish protocol-specific connections\n * 4. Handling connection failures and retries\n * 5. Updating the peer store and connection state\n *\n * @param {PeerId | MultiaddrInput} peer - The peer to connect to, either as a PeerId or multiaddr\n * @param {string[]} [protocolCodecs] - Optional array of protocol-specific codec strings to establish\n * (e.g., for LightPush, Filter, Store protocols)\n *\n * @throws {Error} If the multiaddr is missing a peer ID\n * @throws {Error} If the maximum dial attempts are reached and the peer cannot be dialed\n * @throws {Error} If there's an error deleting an undialable peer from the peer store\n *\n * @example\n * ```typescript\n * // Dial using PeerId\n * await connectionManager.dialPeer(peerId);\n *\n * // Dial using multiaddr with specific protocols\n * await connectionManager.dialPeer(multiaddr, [\n * \"/vac/waku/relay/2.0.0\",\n * \"/vac/waku/lightpush/2.0.0-beta1\"\n * ]);\n * ```\n *\n * @remarks\n * - The method implements exponential backoff through multiple dial attempts\n * - Maintains a queue for parallel dial attempts (limited by maxParallelDials)\n * - Integrates with the KeepAliveManager for connection maintenance\n * - Updates the peer store and connection state after successful/failed attempts\n * - If all dial attempts fail, triggers DNS discovery as a fallback\n */\n async dialPeer(peer) {\n let connection;\n let peerId;\n const peerDialInfo = this.getDialablePeerInfo(peer);\n const peerIdStr = isPeerId(peerDialInfo)\n ? peerDialInfo.toString()\n : peerDialInfo.getPeerId();\n this.currentActiveParallelDialCount += 1;\n let dialAttempt = 0;\n while (dialAttempt < this.options.maxDialAttemptsForPeer) {\n try {\n log.info(`Dialing peer ${peerDialInfo} on attempt ${dialAttempt + 1}`);\n connection = await this.libp2p.dial(peerDialInfo);\n peerId = connection.remotePeer;\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 ${peerIdStr} - ${error.errors}`);\n }\n else {\n // Handle generic error\n log.error(`Error dialing peer ${peerIdStr} - ${error.message}`);\n }\n this.dialErrorsForPeer.set(peerIdStr, error);\n dialAttempt++;\n this.dialAttemptsForPeer.set(peerIdStr, 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(peerIdStr);\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 ${peerIdStr} from peer store. Reason: ${errorMessage}`);\n }\n this.dialErrorsForPeer.delete(peerIdStr);\n if (peerId) {\n await this.libp2p.peerStore.delete(peerId);\n }\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 ${peerIdStr} from peer store - ${error}`);\n }\n }\n if (!connection) {\n throw new Error(`Failed to dial peer ${peerDialInfo}`);\n }\n return connection;\n }\n /**\n * Dial a peer with specific protocols.\n * This method is a raw proxy to the libp2p dialProtocol method.\n * @param peer - The peer to connect to, either as a PeerId or multiaddr\n * @param protocolCodecs - Optional array of protocol-specific codec strings to establish\n * @returns A stream to the peer\n */\n async rawDialPeerWithProtocols(peer, protocolCodecs) {\n const peerDialInfo = this.getDialablePeerInfo(peer);\n return await this.libp2p.dialProtocol(peerDialInfo, protocolCodecs);\n }\n /**\n * Internal utility to extract a PeerId or Multiaddr from a peer input.\n * This is used internally by the connection manager to handle different peer input formats.\n * @internal\n */\n getDialablePeerInfo(peer) {\n if (isPeerId(peer)) {\n return peer;\n }\n else {\n // peer is of MultiaddrInput type\n const ma = multiaddr(peer);\n const peerIdStr = ma.getPeerId();\n if (!peerIdStr) {\n throw new Error(\"Failed to dial multiaddr: missing peer ID\");\n }\n return ma;\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.pubsubTopics}).\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.pubsubTopics.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 { 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, 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.libp2pComponents.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(peerId);\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=metadata.js.map","import { sha256 } from \"@noble/hashes/sha256\";\nimport { isDefined } from \"@waku/utils\";\nimport { bytesToHex, 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 = bytesToHex(hash);\n return hashStr;\n}\n//# sourceMappingURL=index.js.map","import { EConnectionStateEvents } from \"@waku/interfaces\";\nimport { messageHashStr } from \"@waku/message-hash\";\n// TODO(weboko): consider adding as config property or combine with maxAllowedPings\nconst MAX_SUBSCRIBE_ATTEMPTS = 3;\nexport class SubscriptionMonitor {\n /**\n * Cached peers that are in use by subscription.\n * Needed to understand if they disconnect later or not.\n */\n peerIds = [];\n isStarted = false;\n pubsubTopic;\n config;\n libp2p;\n filter;\n peerManager;\n connectionManager;\n activeSubscriptions;\n keepAliveIntervalId;\n pingFailedAttempts = new Map();\n receivedMessagesFormPeer = new Set();\n receivedMessages = new Set();\n verifiedPeers = new Set();\n constructor(options) {\n this.config = options.config;\n this.connectionManager = options.connectionManager;\n this.filter = options.filter;\n this.peerManager = options.peerManager;\n this.libp2p = options.libp2p;\n this.activeSubscriptions = options.activeSubscriptions;\n this.pubsubTopic = options.pubsubTopic;\n this.onConnectionChange = this.onConnectionChange.bind(this);\n this.onPeerConnected = this.onPeerConnected.bind(this);\n this.onPeerDisconnected = this.onPeerDisconnected.bind(this);\n }\n /**\n * @returns content topic used for Filter verification\n */\n get reservedContentTopic() {\n return `/js-waku-subscription-ping/1/${this.libp2p.peerId.toString()}/utf8`;\n }\n /**\n * Starts:\n * - recurring ping queries;\n * - connection event observers;\n */\n start() {\n if (this.isStarted) {\n return;\n }\n this.isStarted = true;\n this.startKeepAlive();\n this.startConnectionListener();\n this.startPeerConnectionListener();\n }\n /**\n * Stops all recurring queries, event listeners or timers.\n */\n stop() {\n if (!this.isStarted) {\n return;\n }\n this.isStarted = false;\n this.stopKeepAlive();\n this.stopConnectionListener();\n this.stopPeerConnectionListener();\n }\n /**\n * Method to get peers that are used by particular subscription or, if initially called, peers that can be used by subscription.\n * @returns array of peers\n */\n async getPeers() {\n if (!this.isStarted) {\n this.peerIds = this.peerManager.getPeers();\n }\n return this.peerIds;\n }\n /**\n * Notifies monitor if message was received.\n *\n * @param peerId peer from which message is received\n * @param message received message\n *\n * @returns true if message was received from peer\n */\n notifyMessageReceived(peerId, message) {\n const hash = this.buildMessageHash(message);\n this.verifiedPeers.add(peerId);\n this.receivedMessagesFormPeer.add(`${peerId}-${hash}`);\n if (this.receivedMessages.has(hash)) {\n return true;\n }\n this.receivedMessages.add(hash);\n return false;\n }\n buildMessageHash(message) {\n return messageHashStr(this.pubsubTopic, message);\n }\n startConnectionListener() {\n this.connectionManager.addEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.onConnectionChange);\n }\n stopConnectionListener() {\n this.connectionManager.removeEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.onConnectionChange);\n }\n async onConnectionChange({ detail: isConnected }) {\n if (!isConnected) {\n this.stopKeepAlive();\n return;\n }\n await Promise.all(this.peerIds.map((id) => this.ping(id, true)));\n this.startKeepAlive();\n }\n startKeepAlive() {\n if (this.keepAliveIntervalId) {\n return;\n }\n this.keepAliveIntervalId = setInterval(() => {\n void this.peerIds.map((id) => this.ping(id));\n }, this.config.keepAliveIntervalMs);\n }\n stopKeepAlive() {\n if (!this.keepAliveIntervalId) {\n return;\n }\n clearInterval(this.keepAliveIntervalId);\n this.keepAliveIntervalId = undefined;\n }\n startPeerConnectionListener() {\n this.libp2p.addEventListener(\"peer:connect\", this.onPeerConnected);\n this.libp2p.addEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n stopPeerConnectionListener() {\n this.libp2p.removeEventListener(\"peer:connect\", this.onPeerConnected);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n // this method keeps track of new connections and will trigger subscribe request if needed\n async onPeerConnected(_event) {\n // TODO(weboko): use config.numOfUsedPeers instead of this.peers\n const hasSomePeers = this.peerIds.length > 0;\n if (hasSomePeers) {\n return;\n }\n this.peerIds = this.peerManager.getPeers();\n await Promise.all(this.peerIds.map((id) => this.subscribe(id)));\n }\n // this method keeps track of disconnects and will trigger subscribe request if needed\n async onPeerDisconnected(event) {\n const hasNotBeenUsed = !this.peerIds.find((id) => id.equals(event.detail));\n if (hasNotBeenUsed) {\n return;\n }\n this.peerIds = this.peerManager.getPeers();\n // we trigger subscribe for peer that was used before\n // it will expectedly fail and we will initiate addition of a new peer\n await Promise.all(this.peerIds.map((id) => this.subscribe(id)));\n }\n async subscribe(_peerId) {\n let peerId = _peerId;\n for (let i = 0; i < MAX_SUBSCRIBE_ATTEMPTS; i++) {\n if (!peerId) {\n return;\n }\n const response = await this.filter.subscribe(this.pubsubTopic, peerId, Array.from(this.activeSubscriptions.keys()));\n if (response.success) {\n return;\n }\n peerId = this.peerManager.requestRenew(peerId);\n }\n }\n async ping(peerId, renewOnFirstFail = false) {\n const peerIdStr = peerId.toString();\n const response = await this.filter.ping(peerId);\n if (response.failure && renewOnFirstFail) {\n const newPeer = this.peerManager.requestRenew(peerId);\n await this.subscribe(newPeer);\n return;\n }\n if (response.failure) {\n const prev = this.pingFailedAttempts.get(peerIdStr) || 0;\n this.pingFailedAttempts.set(peerIdStr, prev + 1);\n }\n if (response.success) {\n this.pingFailedAttempts.set(peerIdStr, 0);\n }\n const madeAttempts = this.pingFailedAttempts.get(peerIdStr) || 0;\n if (madeAttempts >= this.config.pingsBeforePeerRenewed) {\n const newPeer = this.peerManager.requestRenew(peerId);\n await this.subscribe(newPeer);\n }\n }\n}\n//# sourceMappingURL=subscription_monitor.js.map","import { createDecoder } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { groupByContentTopic, Logger } from \"@waku/utils\";\nimport { SubscriptionMonitor } from \"./subscription_monitor.js\";\nconst log = new Logger(\"sdk:filter:subscription\");\nexport class Subscription {\n pubsubTopic;\n protocol;\n config;\n monitor;\n subscriptionCallbacks = new Map();\n constructor(pubsubTopic, protocol, connectionManager, peerManager, libp2p, config, lightPush) {\n this.pubsubTopic = pubsubTopic;\n this.protocol = protocol;\n this.config = config;\n this.pubsubTopic = pubsubTopic;\n this.monitor = new SubscriptionMonitor({\n pubsubTopic,\n config,\n libp2p,\n connectionManager,\n filter: protocol,\n peerManager,\n lightPush,\n activeSubscriptions: this.subscriptionCallbacks\n });\n }\n async subscribe(decoders, callback) {\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 if (this.config.enableLightPushFilterCheck) {\n decodersArray.push(createDecoder(this.monitor.reservedContentTopic, this.pubsubTopic));\n }\n const decodersGroupedByCT = groupByContentTopic(decodersArray);\n const contentTopics = Array.from(decodersGroupedByCT.keys());\n const peers = await this.monitor.getPeers();\n const promises = peers.map(async (peer) => {\n return this.protocol.subscribe(this.pubsubTopic, peer, contentTopics);\n });\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 // don't handle case of internal content topic\n if (contentTopic === this.monitor.reservedContentTopic) {\n return;\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.monitor.start();\n return finalResult;\n }\n async unsubscribe(contentTopics) {\n const peers = await this.monitor.getPeers();\n const promises = peers.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.monitor.stop();\n }\n return finalResult;\n }\n async ping() {\n const peers = await this.monitor.getPeers();\n const promises = peers.map((peer) => this.protocol.ping(peer));\n const results = await Promise.allSettled(promises);\n return this.handleResult(results, \"ping\");\n }\n async unsubscribeAll() {\n const peers = await this.monitor.getPeers();\n const promises = peers.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.monitor.stop();\n return finalResult;\n }\n async processIncomingMessage(message, peerIdStr) {\n const received = this.monitor.notifyMessageReceived(peerIdStr, message);\n if (received) {\n log.info(\"Message already received, skipping\");\n return;\n }\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}\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=subscription.js.map","export const DEFAULT_KEEP_ALIVE = 60_000;\nexport const DEFAULT_MAX_PINGS = 3;\nexport const DEFAULT_LIGHT_PUSH_FILTER_CHECK = false;\n//# sourceMappingURL=constants.js.map","import { FilterCore } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { ensurePubsubTopicIsConfigured, groupByContentTopic, Logger, shardInfoToPubsubTopics, toAsyncIterator } from \"@waku/utils\";\nimport { Subscription } from \"./subscription.js\";\nimport { buildConfig } from \"./utils.js\";\nconst log = new Logger(\"sdk:filter\");\nexport class Filter {\n protocol;\n config;\n connectionManager;\n libp2p;\n peerManager;\n lightPush;\n activeSubscriptions = new Map();\n constructor(params) {\n this.config = buildConfig(params.options);\n this.lightPush = params.lightPush;\n this.peerManager = params.peerManager;\n this.libp2p = params.libp2p;\n this.connectionManager = params.connectionManager;\n this.protocol = 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 }, params.connectionManager.pubsubTopics, params.libp2p);\n this.activeSubscriptions = new Map();\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 *\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) {\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);\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);\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) {\n const pubsubTopic = typeof pubsubTopicShardInfo == \"string\"\n ? pubsubTopicShardInfo\n : shardInfoToPubsubTopics(pubsubTopicShardInfo)?.[0];\n ensurePubsubTopicIsConfigured(pubsubTopic, this.protocol.pubsubTopics);\n const peerIds = this.peerManager.getPeers();\n if (peerIds.length === 0) {\n return {\n error: ProtocolError.NO_PEER_AVAILABLE,\n subscription: null\n };\n }\n log.info(`Creating filter subscription with ${peerIds.length} peers: `, peerIds.map((id) => id.toString()));\n const subscription = this.getActiveSubscription(pubsubTopic) ??\n this.setActiveSubscription(pubsubTopic, new Subscription(pubsubTopic, this.protocol, this.connectionManager, this.peerManager, this.libp2p, this.config, this.lightPush));\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) {\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);\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 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}\n//# sourceMappingURL=filter.js.map","import * as C from \"./constants.js\";\nexport const buildConfig = (config) => {\n return {\n keepAliveIntervalMs: config?.keepAliveIntervalMs || C.DEFAULT_KEEP_ALIVE,\n pingsBeforePeerRenewed: config?.pingsBeforePeerRenewed || C.DEFAULT_MAX_PINGS,\n enableLightPushFilterCheck: config?.enableLightPushFilterCheck || C.DEFAULT_LIGHT_PUSH_FILTER_CHECK\n };\n};\n//# sourceMappingURL=utils.js.map","import { TypedEventEmitter } from \"@libp2p/interface\";\nimport { FilterCodecs, LightPushCodec } from \"@waku/core\";\nimport { HealthStatus, HealthStatusChangeEvents } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nconst log = new Logger(\"health-indicator\");\n/**\n * HealthIndicator monitors the health status of a Waku node by tracking peer connections\n * and their supported protocols.\n *\n * The health status can be one of three states:\n * - Unhealthy: No peer connections\n * - MinimallyHealthy: At least 1 peer supporting both Filter and LightPush protocols\n * - SufficientlyHealthy: At least 2 peers supporting both Filter and LightPush protocols\n *\n * @example\n * // Create and start a health indicator\n * const healthIndicator = new HealthIndicator({ libp2p: node.libp2p });\n * healthIndicator.start();\n *\n * // Listen for health status changes\n * healthIndicator.addEventListener(HealthStatusChangeEvents.StatusChange, (event) => {\n * console.log(`Health status changed to: ${event.detail}`);\n * });\n *\n * // Get current health status\n * console.log(`Current health: ${healthIndicator.toString()}`);\n *\n * // Clean up when done\n * healthIndicator.stop();\n *\n * @implements {IHealthIndicator}\n */\nexport class HealthIndicator extends TypedEventEmitter {\n libp2p;\n value = HealthStatus.Unhealthy;\n constructor(params) {\n super();\n this.libp2p = params.libp2p;\n this.onPeerChange = this.onPeerChange.bind(this);\n }\n /**\n * Starts monitoring the health status by adding event listeners to libp2p events.\n * Listens to peer connect and disconnect events to determine the node's health status.\n */\n start() {\n log.info(\"start: adding listeners to libp2p\");\n this.libp2p.addEventListener(\"peer:connect\", this.onPeerChange);\n this.libp2p.addEventListener(\"peer:disconnect\", this.onPeerChange);\n }\n /**\n * Stops monitoring the health status by removing event listeners from libp2p events.\n * Cleans up the peer connect and disconnect event listeners.\n */\n stop() {\n log.info(\"stop: removing listeners to libp2p\");\n this.libp2p.removeEventListener(\"peer:connect\", this.onPeerChange);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onPeerChange);\n }\n /**\n * Returns the current health status as a string.\n * @returns {string} Current health status (Unhealthy, MinimallyHealthy, or SufficientlyHealthy)\n */\n toString() {\n return this.value;\n }\n /**\n * Returns the current health status value.\n * @returns {string} Current health status (Unhealthy, MinimallyHealthy, or SufficientlyHealthy)\n */\n toValue() {\n return this.value;\n }\n async onPeerChange(event) {\n log.info(`onPeerChange: received libp2p event - ${event.type}`);\n const connections = this.libp2p.getConnections();\n const peers = await Promise.all(connections.map(async (c) => {\n try {\n return await this.libp2p.peerStore.get(c.remotePeer);\n }\n catch (e) {\n return null;\n }\n }));\n const filterPeers = peers.filter((p) => p?.protocols.includes(FilterCodecs.SUBSCRIBE)).length;\n const lightPushPeers = peers.filter((p) => p?.protocols.includes(LightPushCodec)).length;\n if (connections.length === 0) {\n log.info(`onPeerChange: node identified as ${HealthStatus.Unhealthy}`);\n this.value = HealthStatus.Unhealthy;\n }\n else if (filterPeers >= 2 && lightPushPeers >= 2) {\n log.info(`onPeerChange: node identified as ${HealthStatus.SufficientlyHealthy}`);\n this.value = HealthStatus.SufficientlyHealthy;\n }\n else if (filterPeers === 1 && lightPushPeers === 1) {\n log.info(`onPeerChange: node identified as ${HealthStatus.MinimallyHealthy}`);\n this.value = HealthStatus.MinimallyHealthy;\n }\n this.dispatchEvent(new CustomEvent(HealthStatusChangeEvents.StatusChange, {\n detail: this.value\n }));\n // this shouldn't happen as we expect service nodes implement Filter and LightPush at the same time\n log.error(`onPeerChange: unexpected state, cannot identify health status of the node: Filter:${filterPeers}; LightPush:${lightPushPeers}`);\n }\n}\n//# sourceMappingURL=health_indicator.js.map","import { ProtocolError } from \"@waku/interfaces\";\nexport const shouldPeerBeChanged = (failure) => {\n const toBeChanged = failure === ProtocolError.REMOTE_PEER_REJECTED ||\n failure === ProtocolError.NO_RESPONSE ||\n failure === ProtocolError.RLN_PROOF_GENERATION ||\n failure === ProtocolError.NO_PEER_AVAILABLE;\n if (toBeChanged) {\n return true;\n }\n return false;\n};\nexport const timeout = (timeout) => {\n return new Promise((_, reject) => setTimeout(() => reject(new Error(\"Task timeout\")), timeout));\n};\n//# sourceMappingURL=utils.js.map","import { Logger } from \"@waku/utils\";\nimport { shouldPeerBeChanged, timeout } from \"./utils.js\";\nconst MAX_CONCURRENT_TASKS = 5;\nconst TASK_TIMEOUT_MS = 10_000;\nconst log = new Logger(\"sdk:retry-manager\");\nexport class RetryManager {\n intervalID = null;\n retryIntervalMs;\n inProgress = 0;\n queue = [];\n peerManager;\n constructor(config) {\n this.peerManager = config.peerManager;\n this.retryIntervalMs = config.retryIntervalMs;\n }\n start() {\n this.intervalID = setInterval(() => {\n this.processQueue();\n }, this.retryIntervalMs);\n }\n stop() {\n if (this.intervalID) {\n clearInterval(this.intervalID);\n this.intervalID = null;\n }\n }\n push(callback, maxAttempts) {\n this.queue.push({\n maxAttempts,\n callback\n });\n }\n processQueue() {\n if (this.queue.length === 0) {\n log.info(\"processQueue: queue is empty\");\n return;\n }\n while (this.queue.length && this.inProgress < MAX_CONCURRENT_TASKS) {\n const task = this.queue.shift();\n if (task) {\n this.scheduleTask(task);\n }\n }\n }\n scheduleTask(task) {\n const delayedTask = async () => {\n return this.taskExecutor(task);\n };\n // schedule execution ASAP\n // need to use setTimeout to avoid blocking main execution\n setTimeout(delayedTask, 100);\n }\n async taskExecutor(task) {\n const peerId = this.peerManager.getPeers()[0];\n if (!peerId) {\n log.warn(\"scheduleTask: no peers, skipping\");\n return;\n }\n try {\n this.inProgress += 1;\n const response = await Promise.race([\n timeout(TASK_TIMEOUT_MS),\n task.callback(peerId)\n ]);\n if (response?.failure) {\n throw Error(response.failure.error);\n }\n log.info(\"scheduleTask: executed successfully\");\n if (task.maxAttempts === 0) {\n log.warn(\"scheduleTask: discarded a task due to limit of max attempts\");\n return;\n }\n this.queue.push({\n ...task,\n maxAttempts: task.maxAttempts - 1\n });\n }\n catch (_err) {\n const error = _err;\n log.error(\"scheduleTask: task execution failed with error:\", error);\n if (shouldPeerBeChanged(error.message)) {\n this.peerManager.requestRenew(peerId);\n }\n if (task.maxAttempts === 0) {\n log.warn(\"scheduleTask: discarded a task due to limit of max attempts\");\n return;\n }\n this.queue.push({\n ...task,\n maxAttempts: task.maxAttempts - 1\n });\n }\n finally {\n this.inProgress -= 1;\n }\n }\n}\n//# sourceMappingURL=retry_manager.js.map","import { LightPushCore } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { RetryManager } from \"./retry_manager.js\";\nconst log = new Logger(\"sdk:light-push\");\nconst DEFAULT_MAX_ATTEMPTS = 3;\nconst DEFAULT_SEND_OPTIONS = {\n autoRetry: true,\n retryIntervalMs: 1000,\n maxAttempts: DEFAULT_MAX_ATTEMPTS,\n numPeersToUse: 1\n};\nexport class LightPush {\n config;\n retryManager;\n peerManager;\n protocol;\n constructor(params) {\n this.config = {\n ...DEFAULT_SEND_OPTIONS,\n ...(params.options || {})\n };\n this.peerManager = params.peerManager;\n this.protocol = new LightPushCore(params.connectionManager.pubsubTopics, params.libp2p);\n this.retryManager = new RetryManager({\n peerManager: params.peerManager,\n retryIntervalMs: this.config.retryIntervalMs\n });\n }\n start() {\n this.retryManager.start();\n }\n stop() {\n this.retryManager.stop();\n }\n async send(encoder, message, options = {}) {\n options = {\n ...this.config,\n ...options\n };\n const { pubsubTopic } = encoder;\n log.info(\"send: attempting to send a message to pubsubTopic:\", pubsubTopic);\n if (!this.protocol.pubsubTopics.includes(pubsubTopic)) {\n return {\n successes: [],\n failures: [\n {\n error: ProtocolError.TOPIC_NOT_CONFIGURED\n }\n ]\n };\n }\n const peerIds = this.peerManager\n .getPeers()\n .slice(0, this.config.numPeersToUse);\n if (peerIds.length === 0) {\n return {\n successes: [],\n failures: [\n {\n error: ProtocolError.NO_PEER_AVAILABLE\n }\n ]\n };\n }\n const coreResults = await Promise.all(peerIds.map((peerId) => this.protocol.send(encoder, message, peerId).catch((_e) => ({\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL\n }\n }))));\n const results = {\n successes: coreResults\n .filter((v) => v.success)\n .map((v) => v.success),\n failures: coreResults\n .filter((v) => v.failure)\n .map((v) => v.failure)\n };\n if (options.autoRetry && results.successes.length === 0) {\n const sendCallback = (peerId) => this.protocol.send(encoder, message, peerId);\n this.retryManager.push(sendCallback.bind(this), options.maxAttempts || DEFAULT_MAX_ATTEMPTS);\n }\n return results;\n }\n}\n//# sourceMappingURL=light_push.js.map","import { Logger } from \"@waku/utils\";\nconst log = new Logger(\"peer-manager\");\nconst DEFAULT_NUM_PEERS_TO_USE = 2;\nconst CONNECTION_LOCK_TAG = \"peer-manager-lock\";\nexport class PeerManager {\n numPeersToUse;\n libp2p;\n constructor(params) {\n this.onConnected = this.onConnected.bind(this);\n this.onDisconnected = this.onDisconnected.bind(this);\n this.numPeersToUse =\n params?.config?.numPeersToUse || DEFAULT_NUM_PEERS_TO_USE;\n this.libp2p = params.libp2p;\n }\n start() {\n this.startConnectionListener();\n }\n stop() {\n this.stopConnectionListener();\n }\n getPeers() {\n return this.getLockedConnections().map((c) => c.remotePeer);\n }\n requestRenew(peerId) {\n const lockedConnections = this.getLockedConnections();\n const neededPeers = this.numPeersToUse - lockedConnections.length;\n if (neededPeers === 0) {\n return;\n }\n const connections = this.getUnlockedConnections()\n .filter((c) => !c.remotePeer.equals(peerId))\n .slice(0, neededPeers)\n .map((c) => this.lockConnection(c))\n .map((c) => c.remotePeer);\n const newPeerId = connections[0];\n if (!newPeerId) {\n log.warn(`requestRenew: Couldn't renew peer ${peerId.toString()} - no peers.`);\n return;\n }\n log.info(`requestRenew: Renewed peer ${peerId.toString()} to ${newPeerId.toString()}`);\n return newPeerId;\n }\n startConnectionListener() {\n this.libp2p.addEventListener(\"peer:connect\", this.onConnected);\n this.libp2p.addEventListener(\"peer:disconnect\", this.onDisconnected);\n }\n stopConnectionListener() {\n this.libp2p.removeEventListener(\"peer:connect\", this.onConnected);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onDisconnected);\n }\n onConnected(event) {\n const peerId = event.detail;\n this.lockPeerIfNeeded(peerId);\n }\n onDisconnected(event) {\n const peerId = event.detail;\n this.requestRenew(peerId);\n }\n lockPeerIfNeeded(peerId) {\n const lockedConnections = this.getLockedConnections();\n const neededPeers = this.numPeersToUse - lockedConnections.length;\n if (neededPeers === 0) {\n return;\n }\n this.getUnlockedConnections()\n .filter((c) => c.remotePeer.equals(peerId))\n .map((c) => this.lockConnection(c));\n }\n getLockedConnections() {\n return this.libp2p\n .getConnections()\n .filter((c) => c.status === \"open\" && this.isConnectionLocked(c));\n }\n getUnlockedConnections() {\n return this.libp2p\n .getConnections()\n .filter((c) => c.status === \"open\" && !this.isConnectionLocked(c));\n }\n lockConnection(c) {\n log.info(`requestRenew: Locking connection for peerId=${c.remotePeer.toString()}`);\n c.tags.push(CONNECTION_LOCK_TAG);\n return c;\n }\n isConnectionLocked(c) {\n return c.tags.includes(CONNECTION_LOCK_TAG);\n }\n}\n//# sourceMappingURL=peer_manager.js.map","import { StoreCore } from \"@waku/core\";\nimport { messageHash } from \"@waku/message-hash\";\nimport { ensurePubsubTopicIsConfigured, isDefined, Logger } from \"@waku/utils\";\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 Store {\n options;\n peerManager;\n connectionManager;\n protocol;\n constructor(params) {\n this.options = params.options || {};\n this.peerManager = params.peerManager;\n this.connectionManager = params.connectionManager;\n this.protocol = new StoreCore(params.connectionManager.pubsubTopics, params.libp2p);\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.getPeerToUse();\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 async getPeerToUse() {\n let peerId;\n if (this.options?.peer) {\n const connectedPeers = await this.connectionManager.getConnectedPeers();\n const peer = connectedPeers.find((p) => p.id.toString() === this.options?.peer);\n peerId = peer?.id;\n if (!peerId) {\n log.warn(`Passed node to use for Store not found: ${this.options.peer}. Attempting to use random peers.`);\n }\n }\n const peerIds = this.peerManager.getPeers();\n if (peerIds.length > 0) {\n // TODO(weboko): implement smart way of getting a peer https://github.com/waku-org/js-waku/issues/2243\n return peerIds[Math.floor(Math.random() * peerIds.length)];\n }\n log.error(\"No peers available to use.\");\n return;\n }\n}\n//# sourceMappingURL=store.js.map","import { isPeerId } from \"@libp2p/interface\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\nimport { DEFAULT_NUM_SHARDS } from \"@waku/interfaces\";\nimport { contentTopicToShardIndex } from \"@waku/utils\";\nexport const mapToPeerIdOrMultiaddr = (peerId) => {\n return isPeerId(peerId) ? peerId : multiaddr(peerId);\n};\nexport const decoderParamsToShardInfo = (params, networkConfig) => {\n const clusterId = (params.shardInfo?.clusterId ||\n networkConfig.clusterId);\n const shardsUnderCluster = params.shardInfo && \"shardsUnderCluster\" in params.shardInfo\n ? params.shardInfo.shardsUnderCluster\n : DEFAULT_NUM_SHARDS;\n const shardIndex = params.shardInfo && \"shard\" in params.shardInfo\n ? params.shardInfo.shard\n : contentTopicToShardIndex(params.contentTopic, shardsUnderCluster);\n return {\n clusterId,\n shard: shardIndex\n };\n};\nexport const isShardCompatible = (shardInfo, networkConfig) => {\n if (networkConfig.clusterId !== shardInfo.clusterId) {\n return false;\n }\n if (\"shards\" in networkConfig &&\n !networkConfig.shards.includes(shardInfo.shard)) {\n return false;\n }\n return true;\n};\n//# sourceMappingURL=utils.js.map","import { FilterCodecs, LightPushCodec, StoreCodec } from \"@waku/core\";\nimport { Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nconst log = new Logger(\"wait-for-remote-peer\");\n/**\n * @deprecated Since @waku/sdk 0.29.0. Will be removed from 0.31.0\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 // if no protocols or empty array passed - try to derive from mounted\n protocols = protocols?.length ? protocols : getEnabledProtocols(waku);\n const connections = waku.libp2p.getConnections();\n if (!waku.isStarted()) {\n throw Error(\"Waku node is not started\");\n }\n for (const protocol of protocols) {\n switch (protocol) {\n case Protocols.Relay:\n if (!waku.relay)\n throw Error(\"Cannot wait for Relay peer: protocol not mounted\");\n break;\n case Protocols.LightPush:\n if (!waku.lightPush)\n throw Error(\"Cannot wait for LightPush peer: protocol not mounted\");\n break;\n case Protocols.Store:\n if (!waku.store)\n throw Error(\"Cannot wait for Store peer: protocol not mounted\");\n break;\n case Protocols.Filter:\n if (!waku.filter)\n throw Error(\"Cannot wait for Filter peer: protocol not mounted\");\n break;\n }\n }\n const promises = [waitForProtocols(waku, protocols)];\n if (connections.length > 0 && !protocols.includes(Protocols.Relay)) {\n promises.push(waitForMetadata(waku, protocols));\n }\n if (timeoutMs) {\n await rejectOnTimeout(Promise.any(promises), timeoutMs, \"Timed out waiting for a remote peer.\");\n }\n else {\n await Promise.any(promises);\n }\n}\n/**\n * Waits for required peers to be connected.\n */\nasync function waitForProtocols(waku, protocols) {\n const promises = [];\n if (waku.relay && protocols.includes(Protocols.Relay)) {\n promises.push(waku.relay.waitForPeers());\n }\n if (waku.store && protocols.includes(Protocols.Store)) {\n promises.push(waitForConnectedPeer(StoreCodec, waku.libp2p));\n }\n if (waku.lightPush && protocols.includes(Protocols.LightPush)) {\n promises.push(waitForConnectedPeer(LightPushCodec, waku.libp2p));\n }\n if (waku.filter && protocols.includes(Protocols.Filter)) {\n promises.push(waitForConnectedPeer(FilterCodecs.SUBSCRIBE, waku.libp2p));\n }\n return Promise.all(promises);\n}\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(codec, libp2p) {\n log.info(`Waiting for ${codec} peer.`);\n await new Promise((resolve) => {\n const cb = (async (evt) => {\n if (evt.detail?.protocols?.includes(codec)) {\n const metadataService = libp2p.services.metadata;\n if (!metadataService) {\n libp2p.removeEventListener(\"peer:identify\", cb);\n resolve();\n return;\n }\n try {\n await metadataService.confirmOrAttemptHandshake(evt.detail.peerId);\n libp2p.removeEventListener(\"peer:identify\", cb);\n resolve();\n }\n catch (e) {\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\") {\n log.error(\"Connection closed. Some peers can be on different shard.\");\n }\n log.error(`Error waiting for metadata: ${e}`);\n }\n }\n });\n libp2p.addEventListener(\"peer:identify\", cb);\n });\n}\n/**\n * Checks existing connections for needed metadata.\n */\nasync function waitForMetadata(waku, protocols) {\n const connectedPeers = waku.libp2p.getPeers();\n const metadataService = waku.libp2p.services.metadata;\n const enabledCodes = mapProtocolsToCodecs(protocols);\n if (!connectedPeers.length || !metadataService) {\n log.info(`Skipping waitForMetadata due to missing connections:${connectedPeers.length} or metadataService:${!!metadataService}`);\n return;\n }\n for (const peerId of connectedPeers) {\n try {\n const peer = await waku.libp2p.peerStore.get(peerId);\n const hasSomeCodes = peer.protocols.some((c) => enabledCodes.has(c));\n if (hasSomeCodes) {\n const response = await metadataService.confirmOrAttemptHandshake(peerId);\n if (!response.error) {\n peer.protocols.forEach((c) => {\n if (enabledCodes.has(c)) {\n enabledCodes.set(c, true);\n }\n });\n const confirmedAllCodecs = Array.from(enabledCodes.values()).every((v) => v);\n if (confirmedAllCodecs) {\n return;\n }\n }\n }\n }\n catch (e) {\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\") {\n log.error(\"Connection closed. Some peers can be on different shard.\");\n }\n log.error(`Error while iterating through peers: ${e}`);\n continue;\n }\n }\n}\nconst awaitTimeout = (ms, rejectReason) => new Promise((_resolve, reject) => setTimeout(() => reject(Error(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}\nfunction mapProtocolsToCodecs(protocols) {\n const codecs = new Map();\n const protocolToCodec = {\n [Protocols.Filter]: FilterCodecs.SUBSCRIBE,\n [Protocols.LightPush]: LightPushCodec,\n [Protocols.Store]: StoreCodec\n };\n for (const protocol of protocols) {\n if (protocolToCodec[protocol]) {\n codecs.set(protocolToCodec[protocol], false);\n }\n }\n return codecs;\n}\n//# sourceMappingURL=wait_for_remote_peer.js.map","import { ConnectionManager, createDecoder, createEncoder, StoreCodec } from \"@waku/core\";\nimport { DefaultNetworkConfig, Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { Filter } from \"../filter/index.js\";\nimport { HealthIndicator } from \"../health_indicator/index.js\";\nimport { LightPush } from \"../light_push/index.js\";\nimport { PeerManager } from \"../peer_manager/index.js\";\nimport { Store } from \"../store/index.js\";\nimport { decoderParamsToShardInfo, isShardCompatible, mapToPeerIdOrMultiaddr } from \"./utils.js\";\nimport { waitForRemotePeer } from \"./wait_for_remote_peer.js\";\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 networkConfig;\n // needed to create a lock for async operations\n _nodeStateLock = false;\n _nodeStarted = false;\n peerManager;\n constructor(pubsubTopics, options, libp2p, protocolsEnabled, relay) {\n this.pubsubTopics = pubsubTopics;\n this.relay = relay;\n this.libp2p = libp2p;\n this.networkConfig = options.networkConfig || DefaultNetworkConfig;\n protocolsEnabled = {\n filter: false,\n lightpush: false,\n store: false,\n ...protocolsEnabled\n };\n const peerId = this.libp2p.peerId.toString();\n this.connectionManager = new ConnectionManager({\n libp2p,\n relay: this.relay,\n pubsubTopics: this.pubsubTopics,\n config: options?.connectionManager\n });\n this.peerManager = new PeerManager({\n libp2p,\n config: {\n numPeersToUse: options.numPeersToUse\n }\n });\n this.health = new HealthIndicator({ libp2p });\n if (protocolsEnabled.store) {\n if (options.store?.peer) {\n this.connectionManager\n .rawDialPeerWithProtocols(options.store.peer, [StoreCodec])\n .catch((e) => {\n log.error(\"Failed to dial store peer\", e);\n });\n }\n this.store = new Store({\n libp2p,\n connectionManager: this.connectionManager,\n peerManager: this.peerManager,\n options: {\n peer: options.store?.peer\n }\n });\n }\n if (protocolsEnabled.lightpush) {\n this.lightPush = new LightPush({\n libp2p,\n peerManager: this.peerManager,\n connectionManager: this.connectionManager,\n options: options?.lightPush\n });\n }\n if (protocolsEnabled.filter) {\n this.filter = new Filter({\n libp2p,\n connectionManager: this.connectionManager,\n peerManager: this.peerManager,\n lightPush: this.lightPush,\n options: options.filter\n });\n }\n log.info(\"Waku node created\", peerId, `relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this\n .lightPush}, filter: ${!!this.filter}`);\n }\n get peerId() {\n return this.libp2p.peerId;\n }\n get protocols() {\n return this.libp2p.getProtocols();\n }\n async dial(peer, protocols) {\n const _protocols = protocols ?? [];\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 const peerId = mapToPeerIdOrMultiaddr(peer);\n log.info(`Dialing to ${peerId.toString()} with protocols ${_protocols}`);\n return await this.connectionManager.rawDialPeerWithProtocols(peer, codecs);\n }\n async start() {\n if (this._nodeStateLock || this.isStarted())\n return;\n this._nodeStateLock = true;\n await this.libp2p.start();\n this.peerManager.start();\n this.health.start();\n this.lightPush?.start();\n this._nodeStateLock = false;\n this._nodeStarted = true;\n }\n async stop() {\n if (this._nodeStateLock || !this.isStarted())\n return;\n this._nodeStateLock = true;\n this.lightPush?.stop();\n this.health.stop();\n this.peerManager.stop();\n this.connectionManager.stop();\n await this.libp2p.stop();\n this._nodeStateLock = false;\n this._nodeStarted = false;\n }\n async getConnectedPeers() {\n return this.connectionManager.getConnectedPeers();\n }\n async waitForPeers(protocols, timeoutMs) {\n return waitForRemotePeer(this, protocols, timeoutMs);\n }\n isStarted() {\n return this._nodeStarted && this.libp2p.status === \"started\";\n }\n isConnected() {\n return this.connectionManager.isConnected();\n }\n createDecoder(params) {\n const singleShardInfo = decoderParamsToShardInfo(params, this.networkConfig);\n log.info(`Creating Decoder with input:${JSON.stringify(params.shardInfo)}, determined:${JSON.stringify(singleShardInfo)}, expected:${JSON.stringify(this.networkConfig)}.`);\n if (!isShardCompatible(singleShardInfo, this.networkConfig)) {\n throw Error(`Cannot create decoder: incompatible shard configuration.`);\n }\n return createDecoder(params.contentTopic, singleShardInfo);\n }\n createEncoder(params) {\n const singleShardInfo = decoderParamsToShardInfo(params, this.networkConfig);\n log.info(`Creating Encoder with input:${JSON.stringify(params.shardInfo)}, determined:${JSON.stringify(singleShardInfo)}, expected:${JSON.stringify(this.networkConfig)}.`);\n if (!isShardCompatible(singleShardInfo, this.networkConfig)) {\n throw Error(`Cannot create encoder: incompatible shard configuration.`);\n }\n return createEncoder({\n contentTopic: params.contentTopic,\n ephemeral: params.ephemeral,\n pubsubTopicShardInfo: singleShardInfo\n });\n }\n}\n//# sourceMappingURL=waku.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 static name = 'AbortError';\n constructor(message = 'The operation was aborted') {\n super(message);\n this.name = 'AbortError';\n }\n}\n/**\n * Thrown when a remote Peer ID does not match the expected one\n */\nexport class UnexpectedPeerError extends Error {\n static name = 'UnexpectedPeerError';\n constructor(message = 'Unexpected Peer') {\n super(message);\n this.name = 'UnexpectedPeerError';\n }\n}\n/**\n * Thrown when a crypto exchange fails\n */\nexport class InvalidCryptoExchangeError extends Error {\n static name = 'InvalidCryptoExchangeError';\n constructor(message = 'Invalid crypto exchange') {\n super(message);\n this.name = 'InvalidCryptoExchangeError';\n }\n}\n/**\n * Thrown when invalid parameters are passed to a function or method call\n */\nexport class InvalidParametersError extends Error {\n static name = 'InvalidParametersError';\n constructor(message = 'Invalid parameters') {\n super(message);\n this.name = 'InvalidParametersError';\n }\n}\n/**\n * Thrown when a public key is invalid\n */\nexport class InvalidPublicKeyError extends Error {\n static name = 'InvalidPublicKeyError';\n constructor(message = 'Invalid public key') {\n super(message);\n this.name = 'InvalidPublicKeyError';\n }\n}\n/**\n * Thrown when a private key is invalid\n */\nexport class InvalidPrivateKeyError extends Error {\n static name = 'InvalidPrivateKeyError';\n constructor(message = 'Invalid private key') {\n super(message);\n this.name = 'InvalidPrivateKeyError';\n }\n}\n/**\n * Thrown when a operation is unsupported\n */\nexport class UnsupportedOperationError extends Error {\n static name = 'UnsupportedOperationError';\n constructor(message = 'Unsupported operation') {\n super(message);\n this.name = 'UnsupportedOperationError';\n }\n}\n/**\n * Thrown when a connection is closing\n */\nexport class ConnectionClosingError extends Error {\n static name = 'ConnectionClosingError';\n constructor(message = 'The connection is closing') {\n super(message);\n this.name = 'ConnectionClosingError';\n }\n}\n/**\n * Thrown when a connection is closed\n */\nexport class ConnectionClosedError extends Error {\n static name = 'ConnectionClosedError';\n constructor(message = 'The connection is closed') {\n super(message);\n this.name = 'ConnectionClosedError';\n }\n}\n/**\n * Thrown when a connection fails\n */\nexport class ConnectionFailedError extends Error {\n static name = 'ConnectionFailedError';\n constructor(message = 'Connection failed') {\n super(message);\n this.name = 'ConnectionFailedError';\n }\n}\n/**\n * Thrown when the muxer is closed and an attempt to open a stream occurs\n */\nexport class MuxerClosedError extends Error {\n static name = 'MuxerClosedError';\n constructor(message = 'The muxer is closed') {\n super(message);\n this.name = 'MuxerClosedError';\n }\n}\n/**\n * Thrown when a protocol stream is reset by the remote muxer\n */\nexport class StreamResetError extends Error {\n static name = 'StreamResetError';\n constructor(message = 'The stream has been reset') {\n super(message);\n this.name = 'StreamResetError';\n }\n}\n/**\n * Thrown when a stream is in an invalid state\n */\nexport class StreamStateError extends Error {\n static name = 'StreamStateError';\n constructor(message = 'The stream is in an invalid state') {\n super(message);\n this.name = 'StreamStateError';\n }\n}\n/**\n * Thrown when a value could not be found\n */\nexport class NotFoundError extends Error {\n static name = 'NotFoundError';\n constructor(message = 'Not found') {\n super(message);\n this.name = 'NotFoundError';\n }\n}\n/**\n * Thrown when an invalid peer ID is encountered\n */\nexport class InvalidPeerIdError extends Error {\n static name = 'InvalidPeerIdError';\n constructor(message = 'Invalid PeerID') {\n super(message);\n this.name = 'InvalidPeerIdError';\n }\n}\n/**\n * Thrown when an invalid multiaddr is encountered\n */\nexport class InvalidMultiaddrError extends Error {\n static name = 'InvalidMultiaddrError';\n constructor(message = 'Invalid multiaddr') {\n super(message);\n this.name = 'InvalidMultiaddrError';\n }\n}\n/**\n * Thrown when an invalid CID is encountered\n */\nexport class InvalidCIDError extends Error {\n static name = 'InvalidCIDError';\n constructor(message = 'Invalid CID') {\n super(message);\n this.name = 'InvalidCIDError';\n }\n}\n/**\n * Thrown when an invalid multihash is encountered\n */\nexport class InvalidMultihashError extends Error {\n static name = 'InvalidMultihashError';\n constructor(message = 'Invalid Multihash') {\n super(message);\n this.name = 'InvalidMultihashError';\n }\n}\n/**\n * Thrown when a protocol is not supported\n */\nexport class UnsupportedProtocolError extends Error {\n static name = 'UnsupportedProtocolError';\n constructor(message = 'Unsupported protocol error') {\n super(message);\n this.name = 'UnsupportedProtocolError';\n }\n}\n/**\n * An invalid or malformed message was encountered during a protocol exchange\n */\nexport class InvalidMessageError extends Error {\n static name = 'InvalidMessageError';\n constructor(message = 'Invalid message') {\n super(message);\n this.name = 'InvalidMessageError';\n }\n}\n/**\n * Thrown when a remote peer sends a structurally valid message that does not\n * comply with the protocol\n */\nexport class ProtocolError extends Error {\n static name = 'ProtocolError';\n constructor(message = 'Protocol error') {\n super(message);\n this.name = 'ProtocolError';\n }\n}\n/**\n * Throw when an operation times out\n */\nexport class TimeoutError extends Error {\n static name = 'TimeoutError';\n constructor(message = 'Timed out') {\n super(message);\n this.name = 'TimeoutError';\n }\n}\n/**\n * Thrown when a startable component is interacted with but it has not been\n * started yet\n */\nexport class NotStartedError extends Error {\n static name = 'NotStartedError';\n constructor(message = 'Not started') {\n super(message);\n this.name = 'NotStartedError';\n }\n}\n/**\n * Thrown when a component is started that has already been started\n */\nexport class AlreadyStartedError extends Error {\n static name = 'AlreadyStartedError';\n constructor(message = 'Already started') {\n super(message);\n this.name = 'AlreadyStartedError';\n }\n}\n/**\n * Thrown when dialing an address failed\n */\nexport class DialError extends Error {\n static name = 'DialError';\n constructor(message = 'Dial error') {\n super(message);\n this.name = 'DialError';\n }\n}\n/**\n * Thrown when listening on an address failed\n */\nexport class ListenError extends Error {\n static name = 'ListenError';\n constructor(message = 'Listen error') {\n super(message);\n this.name = 'ListenError';\n }\n}\n/**\n * This error is thrown when a limited connection is encountered, i.e. if the\n * user tried to open a stream on a connection for a protocol that is not\n * configured to run over limited connections.\n */\nexport class LimitedConnectionError extends Error {\n static name = 'LimitedConnectionError';\n constructor(message = 'Limited connection') {\n super(message);\n this.name = 'LimitedConnectionError';\n }\n}\n/**\n * This error is thrown where there are too many inbound protocols streams open\n */\nexport class TooManyInboundProtocolStreamsError extends Error {\n static name = 'TooManyInboundProtocolStreamsError';\n constructor(message = 'Too many inbound protocol streams') {\n super(message);\n this.name = 'TooManyInboundProtocolStreamsError';\n }\n}\n/**\n * This error is thrown where there are too many outbound protocols streams open\n */\nexport class TooManyOutboundProtocolStreamsError extends Error {\n static name = 'TooManyOutboundProtocolStreamsError';\n constructor(message = 'Too many outbound protocol streams') {\n super(message);\n this.name = 'TooManyOutboundProtocolStreamsError';\n }\n}\n/**\n * Thrown when and attempt to operate on an unsupported key was made\n */\nexport class UnsupportedKeyTypeError extends Error {\n static name = 'UnsupportedKeyTypeError';\n constructor(message = 'Unsupported key type') {\n super(message);\n this.name = 'UnsupportedKeyTypeError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nconst TAG_MASK = parseInt('11111', 2);\nconst LONG_LENGTH_MASK = parseInt('10000000', 2);\nconst LONG_LENGTH_BYTES_MASK = parseInt('01111111', 2);\nconst decoders = {\n 0x0: readSequence,\n 0x1: readSequence,\n 0x2: readInteger,\n 0x3: readBitString,\n 0x4: readOctetString,\n 0x5: readNull,\n 0x6: readObjectIdentifier,\n 0x10: readSequence,\n 0x16: readSequence,\n 0x30: readSequence\n};\nexport function decodeDer(buf, context = { offset: 0 }) {\n const tag = buf[context.offset] & TAG_MASK;\n context.offset++;\n if (decoders[tag] != null) {\n return decoders[tag](buf, context);\n }\n throw new Error('No decoder for tag ' + tag);\n}\nfunction readLength(buf, context) {\n let length = 0;\n if ((buf[context.offset] & LONG_LENGTH_MASK) === LONG_LENGTH_MASK) {\n // long length\n const count = buf[context.offset] & LONG_LENGTH_BYTES_MASK;\n let str = '0x';\n context.offset++;\n for (let i = 0; i < count; i++, context.offset++) {\n str += buf[context.offset].toString(16).padStart(2, '0');\n }\n length = parseInt(str, 16);\n }\n else {\n length = buf[context.offset];\n context.offset++;\n }\n return length;\n}\nfunction readSequence(buf, context) {\n readLength(buf, context);\n const entries = [];\n while (true) {\n if (context.offset >= buf.byteLength) {\n break;\n }\n const result = decodeDer(buf, context);\n if (result === null) {\n break;\n }\n entries.push(result);\n }\n return entries;\n}\nfunction readInteger(buf, context) {\n const length = readLength(buf, context);\n const start = context.offset;\n const end = context.offset + length;\n const vals = [];\n for (let i = start; i < end; i++) {\n if (i === start && buf[i] === 0) {\n continue;\n }\n vals.push(buf[i]);\n }\n context.offset += length;\n return Uint8Array.from(vals);\n}\nfunction readObjectIdentifier(buf, context) {\n const count = readLength(buf, context);\n const finalOffset = context.offset + count;\n const byte = buf[context.offset];\n context.offset++;\n let val1 = 0;\n let val2 = 0;\n if (byte < 40) {\n val1 = 0;\n val2 = byte;\n }\n else if (byte < 80) {\n val1 = 1;\n val2 = byte - 40;\n }\n else {\n val1 = 2;\n val2 = byte - 80;\n }\n let oid = `${val1}.${val2}`;\n let num = [];\n while (context.offset < finalOffset) {\n const byte = buf[context.offset];\n context.offset++;\n // remove msb\n num.push(byte & 0b01111111);\n if (byte < 128) {\n num.reverse();\n // reached the end of the encoding\n let val = 0;\n for (let i = 0; i < num.length; i++) {\n val += num[i] << (i * 7);\n }\n oid += `.${val}`;\n num = [];\n }\n }\n return oid;\n}\nfunction readNull(buf, context) {\n context.offset++;\n return null;\n}\nfunction readBitString(buf, context) {\n const length = readLength(buf, context);\n const unusedBits = buf[context.offset];\n context.offset++;\n const bytes = buf.subarray(context.offset, context.offset + length - 1);\n context.offset += length;\n if (unusedBits !== 0) {\n // need to shift all bytes along by this many bits\n throw new Error('Unused bits in bit string is unimplemented');\n }\n return bytes;\n}\nfunction readOctetString(buf, context) {\n const length = readLength(buf, context);\n const bytes = buf.subarray(context.offset, context.offset + length);\n context.offset += length;\n return bytes;\n}\nfunction encodeNumber(value) {\n let number = value.toString(16);\n if (number.length % 2 === 1) {\n number = '0' + number;\n }\n const array = new Uint8ArrayList();\n for (let i = 0; i < number.length; i += 2) {\n array.append(Uint8Array.from([parseInt(`${number[i]}${number[i + 1]}`, 16)]));\n }\n return array;\n}\nfunction encodeLength(bytes) {\n if (bytes.byteLength < 128) {\n return Uint8Array.from([bytes.byteLength]);\n }\n // long length\n const length = encodeNumber(bytes.byteLength);\n return new Uint8ArrayList(Uint8Array.from([\n length.byteLength | LONG_LENGTH_MASK\n ]), length);\n}\nexport function encodeInteger(value) {\n const contents = new Uint8ArrayList();\n const mask = 0b10000000;\n const positive = (value.subarray()[0] & mask) === mask;\n if (positive) {\n contents.append(Uint8Array.from([0]));\n }\n contents.append(value);\n return new Uint8ArrayList(Uint8Array.from([0x02]), encodeLength(contents), contents);\n}\nexport function encodeBitString(value) {\n // unused bits is always 0 with full-byte-only values\n const unusedBits = Uint8Array.from([0]);\n const contents = new Uint8ArrayList(unusedBits, value);\n return new Uint8ArrayList(Uint8Array.from([0x03]), encodeLength(contents), contents);\n}\nexport function encodeOctetString(value) {\n return new Uint8ArrayList(Uint8Array.from([0x04]), encodeLength(value), value);\n}\nexport function encodeSequence(values, tag = 0x30) {\n const output = new Uint8ArrayList();\n for (const buf of values) {\n output.append(buf);\n }\n return new Uint8ArrayList(Uint8Array.from([tag]), encodeLength(output), output);\n}\n//# sourceMappingURL=der.js.map","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { identity } from 'multiformats/hashes/identity';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { publicKeyToProtobuf } from '../index.js';\nimport { privateKeyToPKIMessage, publicKeyToPKIMessage } from './utils.js';\nimport { hashAndVerify, hashAndSign } from './index.js';\nexport class ECDSAPublicKey {\n type = 'ECDSA';\n jwk;\n _raw;\n constructor(jwk) {\n this.jwk = jwk;\n }\n get raw() {\n if (this._raw == null) {\n this._raw = publicKeyToPKIMessage(this.jwk);\n }\n return this._raw;\n }\n toMultihash() {\n return identity.digest(publicKeyToProtobuf(this));\n }\n toCID() {\n return CID.createV1(114, this.toMultihash());\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n async verify(data, sig) {\n return hashAndVerify(this.jwk, sig, data);\n }\n}\nexport class ECDSAPrivateKey {\n type = 'ECDSA';\n jwk;\n publicKey;\n _raw;\n constructor(jwk) {\n this.jwk = jwk;\n this.publicKey = new ECDSAPublicKey({\n crv: jwk.crv,\n ext: jwk.ext,\n key_ops: ['verify'],\n kty: 'EC',\n x: jwk.x,\n y: jwk.y\n });\n }\n get raw() {\n if (this._raw == null) {\n this._raw = privateKeyToPKIMessage(this.jwk);\n }\n return this._raw;\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n async sign(message) {\n return hashAndSign(this.jwk, message);\n }\n}\n//# sourceMappingURL=ecdsa.js.map","import { InvalidParametersError } from '@libp2p/interface';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { decodeDer, encodeBitString, encodeInteger, encodeOctetString, encodeSequence } from '../rsa/der.js';\nimport { ECDSAPrivateKey as ECDSAPrivateKeyClass, ECDSAPublicKey as ECDSAPublicKeyClass } from './ecdsa.js';\nimport { generateECDSAKey } from './index.js';\n// 1.2.840.10045.3.1.7 prime256v1 (ANSI X9.62 named elliptic curve)\nconst OID_256 = Uint8Array.from([0x06, 0x08, 0x2A, 0x86, 0x48, 0xCE, 0x3D, 0x03, 0x01, 0x07]);\n// 1.3.132.0.34 secp384r1 (SECG (Certicom) named elliptic curve)\nconst OID_384 = Uint8Array.from([0x06, 0x05, 0x2B, 0x81, 0x04, 0x00, 0x22]);\n// 1.3.132.0.35 secp521r1 (SECG (Certicom) named elliptic curve)\nconst OID_521 = Uint8Array.from([0x06, 0x05, 0x2B, 0x81, 0x04, 0x00, 0x23]);\nconst P_256_KEY_JWK = {\n ext: true,\n kty: 'EC',\n crv: 'P-256'\n};\nconst P_384_KEY_JWK = {\n ext: true,\n kty: 'EC',\n crv: 'P-384'\n};\nconst P_521_KEY_JWK = {\n ext: true,\n kty: 'EC',\n crv: 'P-521'\n};\nconst P_256_KEY_LENGTH = 32;\nconst P_384_KEY_LENGTH = 48;\nconst P_521_KEY_LENGTH = 66;\nexport function unmarshalECDSAPrivateKey(bytes) {\n const message = decodeDer(bytes);\n return pkiMessageToECDSAPrivateKey(message);\n}\nexport function pkiMessageToECDSAPrivateKey(message) {\n const privateKey = message[1];\n const d = uint8ArrayToString(privateKey, 'base64url');\n const coordinates = message[2][1][0];\n const offset = 1;\n let x;\n let y;\n if (privateKey.byteLength === P_256_KEY_LENGTH) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_256_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_256_KEY_LENGTH), 'base64url');\n return new ECDSAPrivateKeyClass({\n ...P_256_KEY_JWK,\n key_ops: ['sign'],\n d,\n x,\n y\n });\n }\n if (privateKey.byteLength === P_384_KEY_LENGTH) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_384_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_384_KEY_LENGTH), 'base64url');\n return new ECDSAPrivateKeyClass({\n ...P_384_KEY_JWK,\n key_ops: ['sign'],\n d,\n x,\n y\n });\n }\n if (privateKey.byteLength === P_521_KEY_LENGTH) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_521_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_521_KEY_LENGTH), 'base64url');\n return new ECDSAPrivateKeyClass({\n ...P_521_KEY_JWK,\n key_ops: ['sign'],\n d,\n x,\n y\n });\n }\n throw new InvalidParametersError(`Private key length was wrong length, got ${privateKey.byteLength}, expected 32, 48 or 66`);\n}\nexport function unmarshalECDSAPublicKey(bytes) {\n const message = decodeDer(bytes);\n return pkiMessageToECDSAPublicKey(message);\n}\nexport function pkiMessageToECDSAPublicKey(message) {\n const coordinates = message[1][1][0];\n const offset = 1;\n let x;\n let y;\n if (coordinates.byteLength === ((P_256_KEY_LENGTH * 2) + 1)) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_256_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_256_KEY_LENGTH), 'base64url');\n return new ECDSAPublicKeyClass({\n ...P_256_KEY_JWK,\n key_ops: ['verify'],\n x,\n y\n });\n }\n if (coordinates.byteLength === ((P_384_KEY_LENGTH * 2) + 1)) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_384_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_384_KEY_LENGTH), 'base64url');\n return new ECDSAPublicKeyClass({\n ...P_384_KEY_JWK,\n key_ops: ['verify'],\n x,\n y\n });\n }\n if (coordinates.byteLength === ((P_521_KEY_LENGTH * 2) + 1)) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_521_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_521_KEY_LENGTH), 'base64url');\n return new ECDSAPublicKeyClass({\n ...P_521_KEY_JWK,\n key_ops: ['verify'],\n x,\n y\n });\n }\n throw new InvalidParametersError(`coordinates were wrong length, got ${coordinates.byteLength}, expected 65, 97 or 133`);\n}\nexport function privateKeyToPKIMessage(privateKey) {\n return encodeSequence([\n encodeInteger(Uint8Array.from([1])), // header\n encodeOctetString(uint8ArrayFromString(privateKey.d ?? '', 'base64url')), // body\n encodeSequence([\n getOID(privateKey.crv)\n ], 0xA0),\n encodeSequence([\n encodeBitString(new Uint8ArrayList(Uint8Array.from([0x04]), uint8ArrayFromString(privateKey.x ?? '', 'base64url'), uint8ArrayFromString(privateKey.y ?? '', 'base64url')))\n ], 0xA1)\n ]).subarray();\n}\nexport function publicKeyToPKIMessage(publicKey) {\n return encodeSequence([\n encodeInteger(Uint8Array.from([1])), // header\n encodeSequence([\n getOID(publicKey.crv)\n ], 0xA0),\n encodeSequence([\n encodeBitString(new Uint8ArrayList(Uint8Array.from([0x04]), uint8ArrayFromString(publicKey.x ?? '', 'base64url'), uint8ArrayFromString(publicKey.y ?? '', 'base64url')))\n ], 0xA1)\n ]).subarray();\n}\nfunction getOID(curve) {\n if (curve === 'P-256') {\n return OID_256;\n }\n if (curve === 'P-384') {\n return OID_384;\n }\n if (curve === 'P-521') {\n return OID_521;\n }\n throw new InvalidParametersError(`Invalid curve ${curve}`);\n}\nexport async function generateECDSAKeyPair(curve = 'P-256') {\n const key = await generateECDSAKey(curve);\n return new ECDSAPrivateKeyClass(key.privateKey);\n}\nexport function ensureECDSAKey(key, length) {\n key = Uint8Array.from(key ?? []);\n if (key.length !== length) {\n throw new InvalidParametersError(`Key must be a Uint8Array of length ${length}, got ${key.length}`);\n }\n return key;\n}\n//# sourceMappingURL=utils.js.map","export const ECDSA_P_256_OID = '1.2.840.10045.3.1.7';\nexport const ECDSA_P_384_OID = '1.3.132.0.34';\nexport const ECDSA_P_521_OID = '1.3.132.0.35';\nexport async function generateECDSAKey(curve = 'P-256') {\n const keyPair = await crypto.subtle.generateKey({\n name: 'ECDSA',\n namedCurve: curve\n }, true, ['sign', 'verify']);\n return {\n publicKey: await crypto.subtle.exportKey('jwk', keyPair.publicKey),\n privateKey: await crypto.subtle.exportKey('jwk', keyPair.privateKey)\n };\n}\nexport async function hashAndSign(key, msg) {\n const privateKey = await crypto.subtle.importKey('jwk', key, {\n name: 'ECDSA',\n namedCurve: key.crv ?? 'P-256'\n }, false, ['sign']);\n const signature = await crypto.subtle.sign({\n name: 'ECDSA',\n hash: {\n name: 'SHA-256'\n }\n }, privateKey, msg.subarray());\n return new Uint8Array(signature, 0, signature.byteLength);\n}\nexport async function hashAndVerify(key, sig, msg) {\n const publicKey = await crypto.subtle.importKey('jwk', key, {\n name: 'ECDSA',\n namedCurve: key.crv ?? 'P-256'\n }, false, ['verify']);\n return crypto.subtle.verify({\n name: 'ECDSA',\n hash: {\n name: 'SHA-256'\n }\n }, publicKey, sig, msg.subarray());\n}\n//# sourceMappingURL=index.js.map","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\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","/**\n * SHA2-512 a.k.a. sha512 and sha384. It is slower than sha256 in js because u64 operations are slow.\n *\n * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and\n * [the paper on truncated SHA512/256](https://eprint.iacr.org/2010/548.pdf).\n * @module\n */\nimport { 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(outputLen = 64) {\n super(128, outputLen, 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}\nexport class SHA512_224 extends SHA512 {\n constructor() {\n super(28);\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 }\n}\nexport class SHA512_256 extends SHA512 {\n constructor() {\n super(32);\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 }\n}\nexport class SHA384 extends SHA512 {\n constructor() {\n super(48);\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 }\n}\n/** SHA2-512 hash function. */\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\n/** SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks. */\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\n/** SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks. */\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\n/** SHA2-384 hash function. */\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! 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);\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && 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 + ' boolean expected, got ' + value);\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 return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function';\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 * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\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(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\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 // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('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; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\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 hex string or Uint8Array, 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 + ' of length ' + expectedLength + ' expected, 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('string expected');\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 ' + 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) => (_1n << BigInt(n)) - _1n;\n// DRBG\nconst u8n = (len) => new Uint8Array(len); // 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(0)) => {\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 function');\n const val = object[fieldName];\n if (isOptional && val === undefined)\n return;\n if (!checkVal(val, object)) {\n throw new Error('param ' + String(fieldName) + ' is invalid. Expected ' + type + ', got ' + val);\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","/**\n * Utils for modular division and finite fields.\n * A finite field over 11 is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, validateObject, } from \"./utils.js\";\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3);\n// prettier-ignore\nconst _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _8n = /* @__PURE__ */ BigInt(8);\n// prettier-ignore\nconst _9n = /* @__PURE__ */ BigInt(9), _16n = /* @__PURE__ */ 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 * @todo use field version && remove\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\nexport function pow(num, power, modulo) {\n if (power < _0n)\n throw new Error('invalid exponent, negatives unsupported');\n if (modulo <= _0n)\n throw new Error('invalid modulus');\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/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number, modulo) {\n if (number === _0n)\n throw new Error('invert: expected non-zero number');\n if (modulo <= _0n)\n throw new Error('invert: expected positive modulus, got ' + modulo);\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 // Crash instead of infinity loop, we cannot reasonable count until P.\n if (Z > 1000)\n throw new Error('Cannot find square root: likely non-prime P');\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}\n/**\n * Square root for a finite field. It will try to check if optimizations are applicable and fall back to 4:\n *\n * 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * 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 */\nexport function FpSqrt(P) {\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('invalid exponent, negatives unsupported');\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}\n/**\n * Legendre symbol.\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 */\nexport function FpLegendre(order) {\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.\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 * Fragile: always run a benchmark on a change.\n * Security 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're 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('invalid field: expected ORDER > 0, got ' + ORDER);\n const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n if (BYTES > 2048)\n throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n let sqrtP; // cached sqrtP\n const f = Object.freeze({\n ORDER,\n isLE,\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 ((n) => {\n if (!sqrtP)\n sqrtP = FpSqrt(ORDER);\n return sqrtP(f, n);\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('Field.fromBytes: expected ' + BYTES + ' 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 ? bytesToNumberLE(key) : bytesToNumberBE(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","/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { nLength, validateField } from \"./modular.js\";\nimport { bitLen, bitMask, validateObject } from \"./utils.js\";\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nfunction validateW(W, bits) {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\nfunction calcWOpts(W, scalarBits) {\n validateW(W, scalarBits);\n const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n const windowSize = 2 ** (W - 1); // W=8 128. Not 256, because we skip zero\n const maxNumber = 2 ** W; // W=8 256\n const mask = bitMask(W); // W=8 255 == mask 0b11111111\n const shiftBy = BigInt(W); // W=8 8\n return { windows, windowSize, mask, maxNumber, shiftBy };\n}\nfunction calcOffsets(n, window, wOpts) {\n const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n let wbits = Number(n & mask); // extract W bits.\n let nextN = n >> shiftBy; // shift number by W bits.\n // What actually happens here:\n // const highestBit = Number(mask ^ (mask >> 1n));\n // let wbits2 = wbits - 1; // skip zero\n // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n // split if bits > max: +224 => 256-32\n if (wbits > windowSize) {\n // we skip zero, which means instead of `>= size-1`, we do `> size`\n wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n nextN += _1n; // +256 (carry)\n }\n const offsetStart = window * windowSize;\n const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero\n const isZero = wbits === 0; // is current window slice a 0?\n const isNeg = wbits < 0; // is current window slice negative?\n const isNegF = window % 2 !== 0; // fake random statement for noise\n const offsetF = offsetStart; // fake offset for noise\n return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\nfunction validateMSMPoints(points, c) {\n if (!Array.isArray(points))\n throw new Error('array expected');\n points.forEach((p, i) => {\n if (!(p instanceof c))\n throw new Error('invalid point at index ' + i);\n });\n}\nfunction validateMSMScalars(scalars, field) {\n if (!Array.isArray(scalars))\n throw new Error('array of scalars expected');\n scalars.forEach((s, i) => {\n if (!field.isValid(s))\n throw new Error('invalid scalar at index ' + i);\n });\n}\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap();\nfunction getW(P) {\n return pointWindowSizes.get(P) || 1;\n}\n/**\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 *\n * @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n */\nexport function wNAF(c, bits) {\n return {\n constTimeNegate,\n hasPrecomputes(elm) {\n return getW(elm) !== 1;\n },\n // non-const time multiplication ladder\n unsafeLadder(elm, n, 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 * @param elm Point instance\n * @param W window size\n * @returns precomputed point tables flattened to a single array\n */\n precomputeWindow(elm, W) {\n const { windows, windowSize } = calcWOpts(W, bits);\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 // i=1, bc we skip 0\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 // Smaller version:\n // https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n // TODO: check the scalar is less than group order?\n // wNAF behavior is undefined otherwise. But have to carefully remove\n // other checks before wNAF. ORDER == bits here.\n // Accumulators\n let p = c.ZERO;\n let f = c.BASE;\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 const wo = calcWOpts(W, bits);\n for (let window = 0; window < wo.windows; window++) {\n // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n n = nextN;\n if (isZero) {\n // bits are 0: add garbage to fake point\n // Important part for const-time getPublicKey: add random \"noise\" point to f.\n f = f.add(constTimeNegate(isNegF, precomputes[offsetF]));\n }\n else {\n // bits are 1: add to result point\n p = p.add(constTimeNegate(isNeg, precomputes[offset]));\n }\n }\n // Return both real and fake points: JIT won't eliminate f.\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 /**\n * Implements ec unsafe (non const-time) 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 * @param acc accumulator point to add result of multiplication\n * @returns point\n */\n wNAFUnsafe(W, precomputes, n, acc = c.ZERO) {\n const wo = calcWOpts(W, bits);\n for (let window = 0; window < wo.windows; window++) {\n if (n === _0n)\n break; // Early-exit, skip 0 value\n const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n n = nextN;\n if (isZero) {\n // Window bits are 0: skip processing.\n // Move to next window.\n continue;\n }\n else {\n const item = precomputes[offset];\n acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n }\n }\n return acc;\n },\n getPrecomputes(W, P, transform) {\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 comp;\n },\n wNAFCached(P, n, transform) {\n const W = getW(P);\n return this.wNAF(W, this.getPrecomputes(W, P, transform), n);\n },\n wNAFCachedUnsafe(P, n, transform, prev) {\n const W = getW(P);\n if (W === 1)\n return this.unsafeLadder(P, n, prev); // For W=1 ladder is ~x2 faster\n return this.wNAFUnsafe(W, this.getPrecomputes(W, P, transform), n, prev);\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, bits);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n },\n };\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka private keys / bigints)\n */\nexport function pippenger(c, fieldN, points, scalars) {\n // If we split scalars by some window (let's say 8 bits), every chunk will only\n // take 256 buckets even if there are 4096 scalars, also re-uses double.\n // TODO:\n // - https://eprint.iacr.org/2024/750.pdf\n // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n // 0 is accepted in scalars\n validateMSMPoints(points, c);\n validateMSMScalars(scalars, fieldN);\n if (points.length !== scalars.length)\n throw new Error('arrays of points and scalars must have equal length');\n const zero = c.ZERO;\n const wbits = bitLen(BigInt(points.length));\n const windowSize = wbits > 12 ? wbits - 3 : wbits > 4 ? wbits - 2 : wbits ? 2 : 1; // in bits\n const MASK = bitMask(windowSize);\n const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n let sum = zero;\n for (let i = lastBits; i >= 0; i -= windowSize) {\n buckets.fill(zero);\n for (let j = 0; j < scalars.length; j++) {\n const scalar = scalars[j];\n const wbits = Number((scalar >> BigInt(i)) & MASK);\n buckets[wbits] = buckets[wbits].add(points[j]);\n }\n let resI = zero; // not using this will do small speed-up, but will lose ct\n // Skip first bucket, because it is zero\n for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n sumI = sumI.add(buckets[j]);\n resI = resI.add(sumI);\n }\n sum = sum.add(resI);\n if (i !== 0)\n for (let j = 0; j < windowSize; j++)\n sum = sum.double();\n }\n return sum;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n */\nexport function precomputeMSMUnsafe(c, fieldN, points, windowSize) {\n /**\n * Performance Analysis of Window-based Precomputation\n *\n * Base Case (256-bit scalar, 8-bit window):\n * - Standard precomputation requires:\n * - 31 additions per scalar × 256 scalars = 7,936 ops\n * - Plus 255 summary additions = 8,191 total ops\n * Note: Summary additions can be optimized via accumulator\n *\n * Chunked Precomputation Analysis:\n * - Using 32 chunks requires:\n * - 255 additions per chunk\n * - 256 doublings\n * - Total: (255 × 32) + 256 = 8,416 ops\n *\n * Memory Usage Comparison:\n * Window Size | Standard Points | Chunked Points\n * ------------|-----------------|---------------\n * 4-bit | 520 | 15\n * 8-bit | 4,224 | 255\n * 10-bit | 13,824 | 1,023\n * 16-bit | 557,056 | 65,535\n *\n * Key Advantages:\n * 1. Enables larger window sizes due to reduced memory overhead\n * 2. More efficient for smaller scalar counts:\n * - 16 chunks: (16 × 255) + 256 = 4,336 ops\n * - ~2x faster than standard 8,191 ops\n *\n * Limitations:\n * - Not suitable for plain precomputes (requires 256 constant doublings)\n * - Performance degrades with larger scalar counts:\n * - Optimal for ~256 scalars\n * - Less efficient for 4096+ scalars (Pippenger preferred)\n */\n validateW(windowSize, fieldN.BITS);\n validateMSMPoints(points, c);\n const zero = c.ZERO;\n const tableSize = 2 ** windowSize - 1; // table size (without zero)\n const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n const MASK = bitMask(windowSize);\n const tables = points.map((p) => {\n const res = [];\n for (let i = 0, acc = p; i < tableSize; i++) {\n res.push(acc);\n acc = acc.add(p);\n }\n return res;\n });\n return (scalars) => {\n validateMSMScalars(scalars, fieldN);\n if (scalars.length > points.length)\n throw new Error('array of scalars must be smaller than array of points');\n let res = zero;\n for (let i = 0; i < chunks; i++) {\n // No need to double if accumulator is still zero.\n if (res !== zero)\n for (let j = 0; j < windowSize; j++)\n res = res.double();\n const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n for (let j = 0; j < scalars.length; j++) {\n const n = scalars[j];\n const curr = Number((n >> shiftBy) & MASK);\n if (!curr)\n continue; // skip zero scalars chunks\n res = res.add(tables[j][curr - 1]);\n }\n }\n return res;\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","/**\n * Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y².\n * For design rationale of types / exports, see weierstrass module documentation.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { pippenger, validateBasic, wNAF, } from \"./curve.js\";\nimport { Field, mod } from \"./modular.js\";\n// prettier-ignore\nimport { abool, aInRange, bytesToHex, bytesToNumberLE, concatBytes, ensureBytes, memoized, numberToBytesLE, validateObject } 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 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 // Important:\n // There are some places where Fp.BYTES is used instead of nByteLength.\n // So far, everything has been tested with curves of Fp.BYTES == nByteLength.\n // TODO: test and find curves which behave otherwise.\n const MASK = _2n << (BigInt(nByteLength * 8) - _1n);\n const modP = Fp.create; // Function overrides\n const Fn = Field(CURVE.n, CURVE.nBitLength);\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, banZero = false) {\n const min = banZero ? _1n : _0n;\n aInRange('coordinate ' + title, n, min, MASK);\n }\n function aextpoint(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 aCoordinate('x', ex);\n aCoordinate('y', ey);\n aCoordinate('z', ez, true);\n aCoordinate('t', et);\n this.ex = ex;\n this.ey = ey;\n this.ez = ez;\n this.et = 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 // Multiscalar Multiplication\n static msm(points, scalars) {\n return pippenger(Point, Fn, points, scalars);\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 aextpoint(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 aextpoint(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 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 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 // Accepts optional accumulator to merge with multiply (important for sparse scalars)\n multiplyUnsafe(scalar, acc = Point.ZERO) {\n const n = scalar;\n aInRange('scalar', n, _0n, CURVE_ORDER); // 0 <= scalar < L\n if (n === _0n)\n return I;\n if (this.is0() || n === _1n)\n return this;\n return wnaf.wNAFCachedUnsafe(this, n, Point.normalizeZ, acc);\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 = bytesToNumberLE(normed);\n // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\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 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 const { scalar } = getPrivateScalar(privKey);\n return G.multiply(scalar); // reduced one call of `toRawBytes`\n }\n toRawBytes() {\n const { x, y } = this.toAffine();\n const bytes = 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 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(bytesToNumberLE(hash));\n }\n // Get the hashed private scalar per RFC8032 5.1.5\n function getPrivateScalar(key) {\n const len = Fp.BYTES;\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 return { head, prefix, scalar };\n }\n // Convenience method that creates public key from scalar. RFC8032 5.1.5\n function getExtendedPublicKey(key) {\n const { head, prefix, scalar } = getPrivateScalar(key);\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 = 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 aInRange('signature.s', s, _0n, CURVE_ORDER); // 0 <= s < l\n const res = concatBytes(R, numberToBytesLE(s, Fp.BYTES));\n return ensureBytes('result', res, Fp.BYTES * 2); // 64-byte signature\n }\n const verifyOpts = VERIFY_DEFAULT;\n /**\n * Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n * An extended group equation is checked.\n */\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 publicKey = ensureBytes('publicKey', publicKey, len);\n if (zip215 !== undefined)\n abool('zip215', zip215);\n if (prehash)\n msg = prehash(msg); // for ed25519ph, etc\n const s = bytesToNumberLE(sig.slice(len, 2 * len));\n let A, R, SB;\n try {\n // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n // zip215=true: 0 <= y < MASK (2^256 for ed25519)\n // zip215=false: 0 <= y < P (2^255-19 for ed25519)\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 // Extended group equation\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 priv 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","/**\n * Montgomery curve methods. It's not really whole montgomery curve,\n * just bunch of very specific methods for X25519 / X448 from\n * [RFC 7748](https://www.rfc-editor.org/rfc/rfc7748)\n * @module\n */\n/*! 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// 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 let valid = '' + montgomeryBytes + ' or ' + fieldLen;\n throw new Error('invalid scalar, expected ' + valid + ' bytes, got ' + len);\n }\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","/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha2';\nimport { concatBytes, randomBytes, utf8ToBytes } from '@noble/hashes/utils';\nimport { pippenger } from \"./abstract/curve.js\";\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// 2n**255n - 19n\nconst ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');\n// √(-1) aka √(a) aka 2^((p-1)/4)\n// Fp.sqrt(Fp.neg(1))\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/** Weird / bogus points, useful for debugging. */\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 // Removing Fp.create() will still work, and is 10% faster on sign\n a: Fp.create(BigInt(-1)),\n // d is -121665/121666 a.k.a. Fp.neg(121665 * Fp.inv(121666))\n d: BigInt('37095705934669439343138083508754565189542113879843219016388785533085940283555'),\n // Finite field 2n**255n - 19n\n Fp,\n // Subgroup order 2n**252n + 27742317777372353535851937790883648493n;\n n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),\n h: _8n,\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 * @example\n * import { ed25519 } from '@noble/curves/ed25519';\n * const priv = ed25519.utils.randomPrivateKey();\n * const pub = ed25519.getPublicKey(priv);\n * const msg = new TextEncoder().encode('hello');\n * const sig = ed25519.sign(msg, priv);\n * ed25519.verify(sig, msg, pub); // Default mode: follows ZIP215\n * ed25519.verify(sig, msg, pub, { zip215: false }); // RFC8032 / FIPS 186-5\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})))();\n/**\n * ECDH using curve25519 aka x25519.\n * @example\n * import { x25519 } from '@noble/curves/ed25519';\n * const priv = 'a546e36bf0527c9d3b16154b82465edd62144c0ac1fc5a18506a2244ba449ac4';\n * const pub = 'e6db6867583030db3594c1a424b15f7c726624ec26b3353b10a903a6d0ab1c4c';\n * x25519.getSharedSecret(priv, pub) === x25519.scalarMult(priv, pub); // aliases\n * x25519.getPublicKey(priv) === x25519.scalarMultBase(priv);\n * x25519.getPublicKey(x25519.utils.randomPrivateKey());\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 aristp(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 static msm(points, scalars) {\n const Fn = Field(ed25519.CURVE.n, ed25519.CURVE.nBitLength);\n return pippenger(RistPoint, Fn, points, scalars);\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 aristp(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 aristp(other);\n return new RistPoint(this.ep.add(other.ep));\n }\n subtract(other) {\n aristp(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};\n/** @deprecated */\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=index.browser.js.map","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport {} from 'multiformats/hashes/digest';\nimport { identity } from 'multiformats/hashes/identity';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { publicKeyToProtobuf } from '../index.js';\nimport { ensureEd25519Key } from './utils.js';\nimport * as crypto from './index.js';\nexport class Ed25519PublicKey {\n type = 'Ed25519';\n raw;\n constructor(key) {\n this.raw = ensureEd25519Key(key, crypto.publicKeyLength);\n }\n toMultihash() {\n return identity.digest(publicKeyToProtobuf(this));\n }\n toCID() {\n return CID.createV1(114, this.toMultihash());\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this.raw, sig, data);\n }\n}\nexport class Ed25519PrivateKey {\n type = 'Ed25519';\n raw;\n publicKey;\n // key - 64 byte Uint8Array containing private key\n // publicKey - 32 byte Uint8Array containing public key\n constructor(key, publicKey) {\n this.raw = ensureEd25519Key(key, crypto.privateKeyLength);\n this.publicKey = new Ed25519PublicKey(publicKey);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n sign(message) {\n return crypto.hashAndSign(this.raw, message);\n }\n}\n//# sourceMappingURL=ed25519.js.map","import { InvalidParametersError } from '@libp2p/interface';\nimport { Ed25519PublicKey as Ed25519PublicKeyClass, Ed25519PrivateKey as Ed25519PrivateKeyClass } from './ed25519.js';\nimport * as crypto from './index.js';\nexport function unmarshalEd25519PrivateKey(bytes) {\n // Try the old, redundant public key version\n if (bytes.length > crypto.privateKeyLength) {\n bytes = ensureEd25519Key(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 Ed25519PrivateKeyClass(privateKeyBytes, publicKeyBytes);\n }\n bytes = ensureEd25519Key(bytes, crypto.privateKeyLength);\n const privateKeyBytes = bytes.subarray(0, crypto.privateKeyLength);\n const publicKeyBytes = bytes.subarray(crypto.publicKeyLength);\n return new Ed25519PrivateKeyClass(privateKeyBytes, publicKeyBytes);\n}\nexport function unmarshalEd25519PublicKey(bytes) {\n bytes = ensureEd25519Key(bytes, crypto.publicKeyLength);\n return new Ed25519PublicKeyClass(bytes);\n}\nexport async function generateEd25519KeyPair() {\n const { privateKey, publicKey } = crypto.generateKey();\n return new Ed25519PrivateKeyClass(privateKey, publicKey);\n}\nexport async function generateEd25519KeyPairFromSeed(seed) {\n const { privateKey, publicKey } = crypto.generateKeyFromSeed(seed);\n return new Ed25519PrivateKeyClass(privateKey, publicKey);\n}\nexport function ensureEd25519Key(key, length) {\n key = Uint8Array.from(key ?? []);\n if (key.length !== length) {\n throw new InvalidParametersError(`Key must be a Uint8Array of length ${length}, got ${key.length}`);\n }\n return key;\n}\n//# sourceMappingURL=utils.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, message } from 'protons-runtime';\nexport var KeyType;\n(function (KeyType) {\n KeyType[\"RSA\"] = \"RSA\";\n KeyType[\"Ed25519\"] = \"Ed25519\";\n KeyType[\"secp256k1\"] = \"secp256k1\";\n KeyType[\"ECDSA\"] = \"ECDSA\";\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[\"ECDSA\"] = 3] = \"ECDSA\";\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, 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.Type = KeyType.codec().decode(reader);\n break;\n }\n case 2: {\n obj.Data = 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 PublicKey.encode = (obj) => {\n return encodeMessage(obj, PublicKey.codec());\n };\n PublicKey.decode = (buf, opts) => {\n return decodeMessage(buf, PublicKey.codec(), opts);\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, 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.Type = KeyType.codec().decode(reader);\n break;\n }\n case 2: {\n obj.Data = 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 PrivateKey.encode = (obj) => {\n return encodeMessage(obj, PrivateKey.codec());\n };\n PrivateKey.decode = (buf, opts) => {\n return decodeMessage(buf, PrivateKey.codec(), opts);\n };\n})(PrivateKey || (PrivateKey = {}));\n//# sourceMappingURL=keys.js.map","/**\n * Signing a message failed\n */\nexport class SigningError extends Error {\n constructor(message = 'An error occurred while signing a message') {\n super(message);\n this.name = 'SigningError';\n }\n}\n/**\n * Verifying a message signature failed\n */\nexport class VerificationError extends Error {\n constructor(message = 'An error occurred while verifying a message') {\n super(message);\n this.name = 'VerificationError';\n }\n}\n/**\n * WebCrypto was not available in the current context\n */\nexport class WebCryptoMissingError extends Error {\n constructor(message = 'Missing Web Crypto API') {\n super(message);\n this.name = 'WebCryptoMissingError';\n }\n}\n//# sourceMappingURL=errors.js.map","/* eslint-env browser */\nimport { WebCryptoMissingError } from '../errors.js';\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 new WebCryptoMissingError('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');\n }\n return nativeCrypto;\n }\n};\n//# sourceMappingURL=webcrypto.browser.js.map","import webcrypto from './webcrypto.js';\nexport default webcrypto;\n//# sourceMappingURL=index.js.map","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport {} from 'multiformats/hashes/digest';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { hashAndSign, utils, hashAndVerify } from './index.js';\nexport class RSAPublicKey {\n type = 'RSA';\n jwk;\n _raw;\n _multihash;\n constructor(jwk, digest) {\n this.jwk = jwk;\n this._multihash = digest;\n }\n get raw() {\n if (this._raw == null) {\n this._raw = utils.jwkToPkix(this.jwk);\n }\n return this._raw;\n }\n toMultihash() {\n return this._multihash;\n }\n toCID() {\n return CID.createV1(114, this._multihash);\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n verify(data, sig) {\n return hashAndVerify(this.jwk, sig, data);\n }\n}\nexport class RSAPrivateKey {\n type = 'RSA';\n jwk;\n _raw;\n publicKey;\n constructor(jwk, publicKey) {\n this.jwk = jwk;\n this.publicKey = publicKey;\n }\n get raw() {\n if (this._raw == null) {\n this._raw = utils.jwkToPkcs1(this.jwk);\n }\n return this._raw;\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n sign(message) {\n return hashAndSign(this.jwk, message);\n }\n}\n//# sourceMappingURL=rsa.js.map","import { InvalidParametersError } from '@libp2p/interface';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport randomBytes from '../../random-bytes.js';\nimport webcrypto from '../../webcrypto/index.js';\nimport * as utils from './utils.js';\nexport const RSAES_PKCS1_V1_5_OID = '1.2.840.113549.1.1.1';\nexport { utils };\nexport async function generateRSAKey(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}\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 InvalidParametersError('Private and public key are required');\n }\n return Promise.all([\n webcrypto.get().subtle.exportKey('jwk', pair.privateKey),\n webcrypto.get().subtle.exportKey('jwk', pair.publicKey)\n ]);\n}\nexport function rsaKeySize(jwk) {\n if (jwk.kty !== 'RSA') {\n throw new InvalidParametersError('invalid key type');\n }\n else if (jwk.n == null) {\n throw new InvalidParametersError('invalid key modulus');\n }\n const bytes = uint8ArrayFromString(jwk.n, 'base64url');\n return bytes.length * 8;\n}\n//# sourceMappingURL=index.browser.js.map","import { InvalidParametersError, InvalidPublicKeyError } from '@libp2p/interface';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { create } from 'multiformats/hashes/digest';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport * as pb from '../keys.js';\nimport { decodeDer, encodeBitString, encodeInteger, encodeSequence } from './der.js';\nimport { RSAPrivateKey as RSAPrivateKeyClass, RSAPublicKey as RSAPublicKeyClass } from './rsa.js';\nimport { generateRSAKey, rsaKeySize } from './index.js';\nexport const MAX_RSA_KEY_SIZE = 8192;\nconst SHA2_256_CODE = 0x12;\nconst MAX_RSA_JWK_SIZE = 1062;\nconst RSA_ALGORITHM_IDENTIFIER = Uint8Array.from([\n 0x30, 0x0D, 0x06, 0x09, 0x2A, 0x86, 0x48, 0x86, 0xF7, 0x0D, 0x01, 0x01, 0x01, 0x05, 0x00\n]);\n/**\n * Convert a PKCS#1 in ASN1 DER format to a JWK private key\n */\nexport function pkcs1ToJwk(bytes) {\n const message = decodeDer(bytes);\n return pkcs1MessageToJwk(message);\n}\n/**\n * Convert a PKCS#1 in ASN1 DER format to a JWK private key\n */\nexport function pkcs1MessageToJwk(message) {\n return {\n n: uint8ArrayToString(message[1], 'base64url'),\n e: uint8ArrayToString(message[2], 'base64url'),\n d: uint8ArrayToString(message[3], 'base64url'),\n p: uint8ArrayToString(message[4], 'base64url'),\n q: uint8ArrayToString(message[5], 'base64url'),\n dp: uint8ArrayToString(message[6], 'base64url'),\n dq: uint8ArrayToString(message[7], 'base64url'),\n qi: uint8ArrayToString(message[8], 'base64url'),\n kty: 'RSA'\n };\n}\n/**\n * Convert a JWK private 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 InvalidParametersError('JWK was missing components');\n }\n return encodeSequence([\n encodeInteger(Uint8Array.from([0])),\n encodeInteger(uint8ArrayFromString(jwk.n, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.e, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.d, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.p, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.q, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.dp, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.dq, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.qi, 'base64url'))\n ]).subarray();\n}\n/**\n * Convert a PKIX in ASN1 DER format to a JWK public key\n */\nexport function pkixToJwk(bytes) {\n const message = decodeDer(bytes, {\n offset: 0\n });\n return pkixMessageToJwk(message);\n}\nexport function pkixMessageToJwk(message) {\n const keys = decodeDer(message[1], {\n offset: 0\n });\n // this looks fragile but DER is a canonical format so we are safe to have\n // deeply property chains like this\n return {\n kty: 'RSA',\n n: uint8ArrayToString(keys[0], 'base64url'),\n e: uint8ArrayToString(keys[1], 'base64url')\n };\n}\n/**\n * Convert a JWK public key to PKIX in ASN1 DER format\n */\nexport function jwkToPkix(jwk) {\n if (jwk.n == null || jwk.e == null) {\n throw new InvalidParametersError('JWK was missing components');\n }\n const subjectPublicKeyInfo = encodeSequence([\n RSA_ALGORITHM_IDENTIFIER,\n encodeBitString(encodeSequence([\n encodeInteger(uint8ArrayFromString(jwk.n, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.e, 'base64url'))\n ]))\n ]);\n return subjectPublicKeyInfo.subarray();\n}\n/**\n * Turn PKCS#1 DER bytes into a PrivateKey\n */\nexport function pkcs1ToRSAPrivateKey(bytes) {\n const message = decodeDer(bytes);\n return pkcs1MessageToRSAPrivateKey(message);\n}\n/**\n * Turn PKCS#1 DER bytes into a PrivateKey\n */\nexport function pkcs1MessageToRSAPrivateKey(message) {\n const jwk = pkcs1MessageToJwk(message);\n return jwkToRSAPrivateKey(jwk);\n}\n/**\n * Turn a PKIX message into a PublicKey\n */\nexport function pkixToRSAPublicKey(bytes, digest) {\n if (bytes.byteLength >= MAX_RSA_JWK_SIZE) {\n throw new InvalidPublicKeyError('Key size is too large');\n }\n const message = decodeDer(bytes, {\n offset: 0\n });\n return pkixMessageToRSAPublicKey(message, bytes, digest);\n}\nexport function pkixMessageToRSAPublicKey(message, bytes, digest) {\n const jwk = pkixMessageToJwk(message);\n if (digest == null) {\n const hash = sha256(pb.PublicKey.encode({\n Type: pb.KeyType.RSA,\n Data: bytes\n }));\n digest = create(SHA2_256_CODE, hash);\n }\n return new RSAPublicKeyClass(jwk, digest);\n}\nexport function jwkToRSAPrivateKey(jwk) {\n if (rsaKeySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new InvalidParametersError('Key size is too large');\n }\n const keys = jwkToJWKKeyPair(jwk);\n const hash = sha256(pb.PublicKey.encode({\n Type: pb.KeyType.RSA,\n Data: jwkToPkix(keys.publicKey)\n }));\n const digest = create(SHA2_256_CODE, hash);\n return new RSAPrivateKeyClass(keys.privateKey, new RSAPublicKeyClass(keys.publicKey, digest));\n}\nexport async function generateRSAKeyPair(bits) {\n if (bits > MAX_RSA_KEY_SIZE) {\n throw new InvalidParametersError('Key size is too large');\n }\n const keys = await generateRSAKey(bits);\n const hash = sha256(pb.PublicKey.encode({\n Type: pb.KeyType.RSA,\n Data: jwkToPkix(keys.publicKey)\n }));\n const digest = create(SHA2_256_CODE, hash);\n return new RSAPrivateKeyClass(keys.privateKey, new RSAPublicKeyClass(keys.publicKey, digest));\n}\n/**\n * Takes a jwk key and returns a JWK KeyPair\n */\nexport function jwkToJWKKeyPair(key) {\n if (key == null) {\n throw new InvalidParametersError('Missing key parameter');\n }\n return {\n privateKey: key,\n publicKey: {\n kty: key.kty,\n n: key.n,\n e: key.e\n }\n };\n}\n//# sourceMappingURL=utils.js.map","/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash } from \"./_assert.js\";\nimport { Hash, toBytes } from \"./utils.js\";\nexport class HMAC extends Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n ahash(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 aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n aexists(this);\n abytes(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 * @example\n * import { hmac } from '@noble/hashes/hmac';\n * import { sha256 } from '@noble/hashes/sha2';\n * const mac1 = hmac(sha256, 'key', 'message');\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 * Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.\n *\n * ### Parameters\n *\n * To initialize a weierstrass curve, one needs to pass following params:\n *\n * * a: formula param\n * * b: formula param\n * * Fp: finite Field over which we'll do calculations. Can be complex (Fp2, Fp12)\n * * n: Curve prime subgroup order, total count of valid points in the field\n * * Gx: Base point (x, y) aka generator point x coordinate\n * * Gy: ...y coordinate\n * * h: cofactor, usually 1. h*n = curve group order (n is only subgroup order)\n * * lowS: whether to enable (default) or disable \"low-s\" non-malleable signatures\n *\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n * `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n * `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n * it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance\n * of nominative types in TypeScript and interfaces only check for shape, so it's hard to create\n * unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n * 1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n * which is hard to debug.\n * 2. Params can be generic and we can't enforce them to be constant value:\n * if somebody creates curve from non-constant params,\n * it would be allowed to interact with other curves with non-constant params\n *\n * @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// prettier-ignore\nimport { pippenger, validateBasic, wNAF, } from \"./curve.js\";\n// prettier-ignore\nimport { Field, getMinHashLength, invert, mapHashToField, mod, validateField, } from \"./modular.js\";\n// prettier-ignore\nimport { aInRange, abool, bitMask, bytesToHex, bytesToNumberBE, concatBytes, createHmacDrbg, ensureBytes, hexToBytes, inRange, isBytes, memoized, numberToBytesBE, numberToHexUnpadded, validateObject } 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 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('invalid 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('invalid endomorphism, expected beta: bigint and splitScalar: function');\n }\n }\n return Object.freeze({ ...opts });\n}\nexport class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n}\n/**\n * ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:\n *\n * [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]\n *\n * Docs: https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/, https://luca.ntop.org/Teaching/Appunti/asn1.html\n */\nexport const DER = {\n // asn.1 DER encoding utils\n Err: DERErr,\n // Basic building block is TLV (Tag-Length-Value)\n _tlv: {\n encode: (tag, data) => {\n const { Err: E } = DER;\n if (tag < 0 || tag > 256)\n throw new E('tlv.encode: wrong tag');\n if (data.length & 1)\n throw new E('tlv.encode: unpadded data');\n const dataLen = data.length / 2;\n const len = numberToHexUnpadded(dataLen);\n if ((len.length / 2) & 128)\n throw new E('tlv.encode: long form length too big');\n // length of length with long form flag\n const lenLen = dataLen > 127 ? numberToHexUnpadded((len.length / 2) | 128) : '';\n const t = numberToHexUnpadded(tag);\n return t + lenLen + len + data;\n },\n // v - value, l - left bytes (unparsed)\n decode(tag, data) {\n const { Err: E } = DER;\n let pos = 0;\n if (tag < 0 || tag > 256)\n throw new E('tlv.encode: wrong tag');\n if (data.length < 2 || data[pos++] !== tag)\n throw new E('tlv.decode: wrong tlv');\n const first = data[pos++];\n const isLong = !!(first & 128); // First bit of first length byte is flag for short/long form\n let length = 0;\n if (!isLong)\n length = first;\n else {\n // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n const lenLen = first & 127;\n if (!lenLen)\n throw new E('tlv.decode(long): indefinite length not supported');\n if (lenLen > 4)\n throw new E('tlv.decode(long): byte length is too big'); // this will overflow u32 in js\n const lengthBytes = data.subarray(pos, pos + lenLen);\n if (lengthBytes.length !== lenLen)\n throw new E('tlv.decode: length bytes not complete');\n if (lengthBytes[0] === 0)\n throw new E('tlv.decode(long): zero leftmost byte');\n for (const b of lengthBytes)\n length = (length << 8) | b;\n pos += lenLen;\n if (length < 128)\n throw new E('tlv.decode(long): not minimal encoding');\n }\n const v = data.subarray(pos, pos + length);\n if (v.length !== length)\n throw new E('tlv.decode: wrong value length');\n return { v, l: data.subarray(pos + length) };\n },\n },\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 _int: {\n encode(num) {\n const { Err: E } = DER;\n if (num < _0n)\n throw new E('integer: negative integers are not allowed');\n let hex = numberToHexUnpadded(num);\n // Pad with zero byte if negative flag is present\n if (Number.parseInt(hex[0], 16) & 0b1000)\n hex = '00' + hex;\n if (hex.length & 1)\n throw new E('unexpected DER parsing assertion: unpadded hex');\n return hex;\n },\n decode(data) {\n const { Err: E } = DER;\n if (data[0] & 128)\n throw new E('invalid signature integer: negative');\n if (data[0] === 0x00 && !(data[1] & 128))\n throw new E('invalid signature integer: unnecessary leading zero');\n return bytesToNumberBE(data);\n },\n },\n toSig(hex) {\n // parse DER signature\n const { Err: E, _int: int, _tlv: tlv } = DER;\n const data = ensureBytes('signature', hex);\n const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n if (seqLeftBytes.length)\n throw new E('invalid signature: left bytes after parsing');\n const { v: rBytes, l: rLeftBytes } = tlv.decode(0x02, seqBytes);\n const { v: sBytes, l: sLeftBytes } = tlv.decode(0x02, rLeftBytes);\n if (sLeftBytes.length)\n throw new E('invalid signature: left bytes after parsing');\n return { r: int.decode(rBytes), s: int.decode(sBytes) };\n },\n hexFromSig(sig) {\n const { _tlv: tlv, _int: int } = DER;\n const rs = tlv.encode(0x02, int.encode(sig.r));\n const ss = tlv.encode(0x02, int.encode(sig.s));\n const seq = rs + ss;\n return tlv.encode(0x30, seq);\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 Fn = Field(CURVE.n, CURVE.nBitLength);\n const toBytes = CURVE.toBytes ||\n ((_c, point, _isCompressed) => {\n const a = point.toAffine();\n return 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. Takes x, returns y².\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 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 (isBytes(key))\n key = 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 private key');\n key = key.padStart(nByteLength * 2, '0');\n }\n let num;\n try {\n num =\n typeof key === 'bigint'\n ? key\n : bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n }\n catch (error) {\n throw new Error('invalid private key, expected hex or ' + nByteLength + ' bytes, got ' + typeof key);\n }\n if (wrapPrivateKey)\n num = mod(num, N); // disabled by default, enabled for BLS\n aInRange('private key', num, _1n, N); // num in range [1..N-1]\n return num;\n }\n function aprjpoint(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 invalid representation of ZERO.\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 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 this.px = px;\n this.py = py;\n this.pz = pz;\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 // Multiscalar Multiplication\n static msm(points, scalars) {\n return pippenger(Point, Fn, points, scalars);\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 aprjpoint(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 aprjpoint(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 const { endo, n: N } = CURVE;\n aInRange('scalar', sc, _0n, N);\n const I = Point.ZERO;\n if (sc === _0n)\n return I;\n if (this.is0() || sc === _1n)\n return this;\n // Case a: no endomorphism. Case b: has precomputes.\n if (!endo || wnaf.hasPrecomputes(this))\n return wnaf.wNAFCachedUnsafe(this, sc, Point.normalizeZ);\n // Case c: 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 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 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 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(a, CURVE_ORDER);\n }\n function invN(a) {\n return 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 = 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 = bytesToNumberBE(tail);\n if (!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 const cl = compressedLen;\n const ul = uncompressedLen;\n throw new Error('invalid Point, expected length of ' + cl + ', or uncompressed ' + ul + ', got ' + len);\n }\n },\n });\n const numToNByteHex = (num) => bytesToHex(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) => 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 aInRange('r', r, _1n, CURVE_ORDER); // r in [1..N]\n aInRange('s', s, _1n, CURVE_ORDER); // s in [1..N]\n this.r = r;\n this.s = s;\n if (recovery != null)\n this.recovery = recovery;\n Object.freeze(this);\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 /**\n * @todo remove\n * @deprecated\n */\n assertValidity() { }\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 + numToNByteHex(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 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 hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numToNByteHex(this.r) + numToNByteHex(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 = getMinHashLength(CURVE.n);\n return 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 = 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 // Our custom check \"just in case\"\n if (bytes.length > 8192)\n throw new Error('input is too large');\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 = 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 = 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 aInRange('num < 2^' + CURVE.nBitLength, num, _0n, ORDER_MASK);\n // works with order, can have different size than numToField!\n return 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,\n // this will be invalid at least for P521. 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 = 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 = 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 const { lowS, prehash, format } = opts;\n // Verify opts, deduce signature format\n validateSigVerOpts(opts);\n if ('strict' in opts)\n throw new Error('options.strict was renamed to lowS');\n if (format !== undefined && format !== 'compact' && format !== 'der')\n throw new Error('format must be compact or der');\n const isHex = typeof sg === 'string' || isBytes(sg);\n const isObj = !isHex &&\n !format &&\n typeof sg === 'object' &&\n sg !== null &&\n typeof sg.r === 'bigint' &&\n typeof sg.s === 'bigint';\n if (!isHex && !isObj)\n throw new Error('invalid signature, expected Uint8Array, hex string or Signature instance');\n let _sig = undefined;\n let P;\n try {\n if (isObj)\n _sig = new Signature(sg.r, sg.s);\n if (isHex) {\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 if (format !== 'compact')\n _sig = Signature.fromDER(sg);\n }\n catch (derError) {\n if (!(derError instanceof DER.Err))\n throw derError;\n }\n if (!_sig && format !== 'der')\n _sig = Signature.fromCompact(sg);\n }\n P = Point.fromHex(publicKey);\n }\n catch (error) {\n return false;\n }\n if (!_sig)\n return false;\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 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","/**\n * Utilities for short weierstrass curves, combined with noble-hashes.\n * @module\n */\n/*! 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 { ...create(defHash), create };\n}\n//# sourceMappingURL=_shortw_utils.js.map","/**\n * NIST secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Seems to be rigid (not backdoored)\n * [as per discussion](https://bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975).\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 * [See explanation](https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066).\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha2';\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 { aInRange, bytesToNumberBE, concatBytes, ensureBytes, inRange, 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 (!Fpk1.eql(Fpk1.sqr(root), y))\n throw new Error('Cannot find square root');\n return root;\n}\nconst Fpk1 = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n/**\n * secp256k1 curve, ECDSA and ECDH methods.\n *\n * Field: `2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n`\n *\n * @example\n * ```js\n * import { secp256k1 } from '@noble/curves/secp256k1';\n * const priv = secp256k1.utils.randomPrivateKey();\n * const pub = secp256k1.getPublicKey(priv);\n * const msg = new Uint8Array(32).fill(1); // message hash (not message) in ecdsa\n * const sig = secp256k1.sign(msg, priv); // `{prehash: true}` option is available\n * const isValid = secp256k1.verify(sig, msg, pub) === true;\n * ```\n */\nexport const secp256k1 = createCurve({\n a: BigInt(0),\n b: BigInt(7),\n Fp: Fpk1,\n n: secp256k1N,\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 endo: {\n // Endomorphism, see above\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 * https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n * @example\n * ```js\n * import { schnorr } from '@noble/curves/secp256k1';\n * const priv = schnorr.utils.randomPrivateKey();\n * const pub = schnorr.getPublicKey(priv);\n * const msg = new TextEncoder().encode('hello');\n * const sig = schnorr.sign(msg, priv);\n * const isValid = schnorr.verify(sig, msg, pub);\n * ```\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(Fpk1, [\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(Fpk1, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fpk1.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n const { x, y } = mapSWU(Fpk1.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: Fpk1.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n}))();\n/** secp256k1 hash-to-curve from RFC 9380. */\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\n/** secp256k1 encode-to-curve from RFC 9380. */\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.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","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { identity } from 'multiformats/hashes/identity';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { publicKeyToProtobuf } from '../index.js';\nimport { validateSecp256k1PublicKey, compressSecp256k1PublicKey, computeSecp256k1PublicKey, validateSecp256k1PrivateKey } from './utils.js';\nimport { hashAndVerify, hashAndSign } from './index.js';\nexport class Secp256k1PublicKey {\n type = 'secp256k1';\n raw;\n _key;\n constructor(key) {\n this._key = validateSecp256k1PublicKey(key);\n this.raw = compressSecp256k1PublicKey(this._key);\n }\n toMultihash() {\n return identity.digest(publicKeyToProtobuf(this));\n }\n toCID() {\n return CID.createV1(114, this.toMultihash());\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n verify(data, sig) {\n return hashAndVerify(this._key, sig, data);\n }\n}\nexport class Secp256k1PrivateKey {\n type = 'secp256k1';\n raw;\n publicKey;\n constructor(key, publicKey) {\n this.raw = validateSecp256k1PrivateKey(key);\n this.publicKey = new Secp256k1PublicKey(publicKey ?? computeSecp256k1PublicKey(key));\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n sign(message) {\n return hashAndSign(this.raw, message);\n }\n}\n//# sourceMappingURL=secp256k1.js.map","import { InvalidPrivateKeyError, InvalidPublicKeyError } from '@libp2p/interface';\nimport { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { Secp256k1PublicKey as Secp256k1PublicKeyClass, Secp256k1PrivateKey as Secp256k1PrivateKeyClass } from './secp256k1.js';\nconst PRIVATE_KEY_BYTE_LENGTH = 32;\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\nexport function unmarshalSecp256k1PrivateKey(bytes) {\n return new Secp256k1PrivateKeyClass(bytes);\n}\nexport function unmarshalSecp256k1PublicKey(bytes) {\n return new Secp256k1PublicKeyClass(bytes);\n}\nexport async function generateSecp256k1KeyPair() {\n const privateKeyBytes = generateSecp256k1PrivateKey();\n return new Secp256k1PrivateKeyClass(privateKeyBytes);\n}\nexport function compressSecp256k1PublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(true);\n return point;\n}\nexport function decompressSecp256k1PublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(false);\n return point;\n}\nexport function validateSecp256k1PrivateKey(key) {\n try {\n secp.getPublicKey(key, true);\n return key;\n }\n catch (err) {\n throw new InvalidPrivateKeyError(String(err));\n }\n}\nexport function validateSecp256k1PublicKey(key) {\n try {\n secp.ProjectivePoint.fromHex(key);\n return key;\n }\n catch (err) {\n throw new InvalidPublicKeyError(String(err));\n }\n}\nexport function computeSecp256k1PublicKey(privateKey) {\n try {\n return secp.getPublicKey(privateKey, true);\n }\n catch (err) {\n throw new InvalidPrivateKeyError(String(err));\n }\n}\nexport function generateSecp256k1PrivateKey() {\n return secp.utils.randomPrivateKey();\n}\n//# sourceMappingURL=utils.js.map","import { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { SigningError, VerificationError } from '../../errors.js';\nimport { isPromise } from '../../util.js';\nconst PUBLIC_KEY_BYTE_LENGTH = 33;\nconst PRIVATE_KEY_BYTE_LENGTH = 32;\nexport { PUBLIC_KEY_BYTE_LENGTH as publicKeyLength };\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\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 SigningError(String(err));\n });\n }\n try {\n return secp.sign(p.digest, key).toDERRawBytes();\n }\n catch (err) {\n throw new SigningError(String(err));\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 VerificationError(String(err));\n });\n }\n try {\n return secp.verify(sig, p.digest, key);\n }\n catch (err) {\n throw new VerificationError(String(err));\n }\n}\n//# sourceMappingURL=index.browser.js.map","/**\n * @packageDocumentation\n *\n * ## Supported Key Types\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 { InvalidParametersError, UnsupportedKeyTypeError } from '@libp2p/interface';\nimport { ECDSAPrivateKey as ECDSAPrivateKeyClass } from './ecdsa/ecdsa.js';\nimport { ECDSA_P_256_OID, ECDSA_P_384_OID, ECDSA_P_521_OID } from './ecdsa/index.js';\nimport { generateECDSAKeyPair, pkiMessageToECDSAPrivateKey, pkiMessageToECDSAPublicKey, unmarshalECDSAPrivateKey, unmarshalECDSAPublicKey } from './ecdsa/utils.js';\nimport { privateKeyLength as ed25519PrivateKeyLength, publicKeyLength as ed25519PublicKeyLength } from './ed25519/index.js';\nimport { generateEd25519KeyPair, generateEd25519KeyPairFromSeed, unmarshalEd25519PrivateKey, unmarshalEd25519PublicKey } from './ed25519/utils.js';\nimport * as pb from './keys.js';\nimport { decodeDer } from './rsa/der.js';\nimport { RSAES_PKCS1_V1_5_OID } from './rsa/index.js';\nimport { pkcs1ToRSAPrivateKey, pkixToRSAPublicKey, generateRSAKeyPair, pkcs1MessageToRSAPrivateKey, pkixMessageToRSAPublicKey, jwkToRSAPrivateKey } from './rsa/utils.js';\nimport { privateKeyLength as secp256k1PrivateKeyLength, publicKeyLength as secp256k1PublicKeyLength } from './secp256k1/index.js';\nimport { generateSecp256k1KeyPair, unmarshalSecp256k1PrivateKey, unmarshalSecp256k1PublicKey } from './secp256k1/utils.js';\nexport { generateEphemeralKeyPair } from './ecdh/index.js';\nexport { keyStretcher } from './key-stretcher.js';\nexport async function generateKeyPair(type, bits) {\n if (type === 'Ed25519') {\n return generateEd25519KeyPair();\n }\n if (type === 'secp256k1') {\n return generateSecp256k1KeyPair();\n }\n if (type === 'RSA') {\n return generateRSAKeyPair(toBits(bits));\n }\n if (type === 'ECDSA') {\n return generateECDSAKeyPair(toCurve(bits));\n }\n throw new UnsupportedKeyTypeError();\n}\nexport async function generateKeyPairFromSeed(type, seed) {\n if (type !== 'Ed25519') {\n throw new UnsupportedKeyTypeError('Seed key derivation only supported for Ed25519 keys');\n }\n return generateEd25519KeyPairFromSeed(seed);\n}\n/**\n * Converts a protobuf serialized public key into its representative object.\n *\n * For RSA public keys optionally pass the multihash digest of the public key if\n * it is known. If the digest is omitted it will be calculated which can be\n * expensive.\n *\n * For other key types the digest option is ignored.\n */\nexport function publicKeyFromProtobuf(buf, digest) {\n const { Type, Data } = pb.PublicKey.decode(buf);\n const data = Data ?? new Uint8Array();\n switch (Type) {\n case pb.KeyType.RSA:\n return pkixToRSAPublicKey(data, digest);\n case pb.KeyType.Ed25519:\n return unmarshalEd25519PublicKey(data);\n case pb.KeyType.secp256k1:\n return unmarshalSecp256k1PublicKey(data);\n case pb.KeyType.ECDSA:\n return unmarshalECDSAPublicKey(data);\n default:\n throw new UnsupportedKeyTypeError();\n }\n}\n/**\n * Creates a public key from the raw key bytes\n */\nexport function publicKeyFromRaw(buf) {\n if (buf.byteLength === ed25519PublicKeyLength) {\n return unmarshalEd25519PublicKey(buf);\n }\n else if (buf.byteLength === secp256k1PublicKeyLength) {\n return unmarshalSecp256k1PublicKey(buf);\n }\n const message = decodeDer(buf);\n const ecdsaOid = message[1]?.[0];\n if (ecdsaOid === ECDSA_P_256_OID || ecdsaOid === ECDSA_P_384_OID || ecdsaOid === ECDSA_P_521_OID) {\n return pkiMessageToECDSAPublicKey(message);\n }\n if (message[0]?.[0] === RSAES_PKCS1_V1_5_OID) {\n return pkixMessageToRSAPublicKey(message, buf);\n }\n throw new InvalidParametersError('Could not extract public key from raw bytes');\n}\n/**\n * Creates a public key from an identity multihash which contains a protobuf\n * encoded Ed25519 or secp256k1 public key.\n *\n * RSA keys are not supported as in practice we they are not stored in identity\n * multihash since the hash would be very large.\n */\nexport function publicKeyFromMultihash(digest) {\n const { Type, Data } = pb.PublicKey.decode(digest.digest);\n const data = Data ?? new Uint8Array();\n switch (Type) {\n case pb.KeyType.Ed25519:\n return unmarshalEd25519PublicKey(data);\n case pb.KeyType.secp256k1:\n return unmarshalSecp256k1PublicKey(data);\n case pb.KeyType.ECDSA:\n return unmarshalECDSAPublicKey(data);\n default:\n throw new UnsupportedKeyTypeError();\n }\n}\n/**\n * Converts a public key object into a protobuf serialized public key\n */\nexport function publicKeyToProtobuf(key) {\n return pb.PublicKey.encode({\n Type: pb.KeyType[key.type],\n Data: key.raw\n });\n}\n/**\n * Converts a protobuf serialized private key into its representative object\n */\nexport function privateKeyFromProtobuf(buf) {\n const decoded = pb.PrivateKey.decode(buf);\n const data = decoded.Data ?? new Uint8Array();\n switch (decoded.Type) {\n case pb.KeyType.RSA:\n return pkcs1ToRSAPrivateKey(data);\n case pb.KeyType.Ed25519:\n return unmarshalEd25519PrivateKey(data);\n case pb.KeyType.secp256k1:\n return unmarshalSecp256k1PrivateKey(data);\n case pb.KeyType.ECDSA:\n return unmarshalECDSAPrivateKey(data);\n default:\n throw new UnsupportedKeyTypeError();\n }\n}\n/**\n * Creates a private key from the raw key bytes. For Ed25519 keys this requires\n * the public key to be appended to the private key otherwise we can't\n * differentiate between Ed25519 and secp256k1 keys as they are the same length.\n */\nexport function privateKeyFromRaw(buf) {\n if (buf.byteLength === ed25519PrivateKeyLength) {\n return unmarshalEd25519PrivateKey(buf);\n }\n else if (buf.byteLength === secp256k1PrivateKeyLength) {\n return unmarshalSecp256k1PrivateKey(buf);\n }\n const message = decodeDer(buf);\n const ecdsaOid = message[2]?.[0];\n if (ecdsaOid === ECDSA_P_256_OID || ecdsaOid === ECDSA_P_384_OID || ecdsaOid === ECDSA_P_521_OID) {\n return pkiMessageToECDSAPrivateKey(message);\n }\n if (message.length > 8) {\n return pkcs1MessageToRSAPrivateKey(message);\n }\n throw new InvalidParametersError('Could not extract private key from raw bytes');\n}\n/**\n * Converts a private key object into a protobuf serialized private key\n */\nexport function privateKeyToProtobuf(key) {\n return pb.PrivateKey.encode({\n Type: pb.KeyType[key.type],\n Data: key.raw\n });\n}\nfunction toBits(bits) {\n if (bits == null) {\n return 2048;\n }\n return parseInt(bits, 10);\n}\nfunction toCurve(curve) {\n if (curve === 'P-256' || curve == null) {\n return 'P-256';\n }\n if (curve === 'P-384') {\n return 'P-384';\n }\n if (curve === 'P-521') {\n return 'P-521';\n }\n throw new InvalidParametersError('Unsupported curve, should be P-256, P-384 or P-521');\n}\n/**\n * Convert a libp2p RSA or ECDSA private key to a WebCrypto CryptoKeyPair\n */\nexport async function privateKeyToCryptoKeyPair(privateKey) {\n if (privateKey.type === 'RSA') {\n return {\n privateKey: await crypto.subtle.importKey('jwk', privateKey.jwk, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['sign']),\n publicKey: await crypto.subtle.importKey('jwk', privateKey.publicKey.jwk, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['verify'])\n };\n }\n if (privateKey.type === 'ECDSA') {\n return {\n privateKey: await crypto.subtle.importKey('jwk', privateKey.jwk, {\n name: 'ECDSA',\n namedCurve: privateKey.jwk.crv ?? 'P-256'\n }, true, ['sign']),\n publicKey: await crypto.subtle.importKey('jwk', privateKey.publicKey.jwk, {\n name: 'ECDSA',\n namedCurve: privateKey.publicKey.jwk.crv ?? 'P-256'\n }, true, ['verify'])\n };\n }\n throw new InvalidParametersError('Only RSA and ECDSA keys are supported');\n}\n/**\n * Convert a RSA or ECDSA WebCrypto CryptoKeyPair to a libp2p private key\n */\nexport async function privateKeyFromCryptoKeyPair(keyPair) {\n if (keyPair.privateKey.algorithm.name === 'RSASSA-PKCS1-v1_5') {\n const jwk = await crypto.subtle.exportKey('jwk', keyPair.privateKey);\n return jwkToRSAPrivateKey(jwk);\n }\n if (keyPair.privateKey.algorithm.name === 'ECDSA') {\n const jwk = await crypto.subtle.exportKey('jwk', keyPair.privateKey);\n return new ECDSAPrivateKeyClass(jwk);\n }\n throw new InvalidParametersError('Only RSA and ECDSA keys are supported');\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.js';\nexport * from './connection-encrypter.js';\nexport * from './connection-gater.js';\nexport * from './content-routing.js';\nexport * from './keys.js';\nexport * from './metrics.js';\nexport * from './peer-discovery.js';\nexport * from './peer-id.js';\nexport * from './peer-info.js';\nexport * from './peer-routing.js';\nexport * from './peer-store.js';\nexport * from './pubsub.js';\nexport * from './record.js';\nexport * from './stream-handler.js';\nexport * from './stream-muxer.js';\nexport * from './topology.js';\nexport * from './transport.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 { peerIdSymbol } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { identity } from 'multiformats/hashes/identity';\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');\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst LIBP2P_KEY_CODE = 0x72;\nclass PeerIdImpl {\n type;\n multihash;\n publicKey;\n string;\n constructor(init) {\n this.type = init.type;\n this.multihash = init.multihash;\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 toMultihash() {\n return this.multihash;\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 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 this.toString() === id;\n }\n else if (id?.toMultihash()?.bytes != null) {\n return uint8ArrayEquals(this.multihash.bytes, id.toMultihash().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}\nexport class RSAPeerId extends PeerIdImpl {\n type = 'RSA';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'RSA' });\n this.publicKey = init.publicKey;\n }\n}\nexport class Ed25519PeerId extends PeerIdImpl {\n type = 'Ed25519';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'Ed25519' });\n this.publicKey = init.publicKey;\n }\n}\nexport class Secp256k1PeerId extends PeerIdImpl {\n type = 'secp256k1';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'secp256k1' });\n this.publicKey = init.publicKey;\n }\n}\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst TRANSPORT_IPFS_GATEWAY_HTTP_CODE = 0x0920;\nexport class URLPeerId {\n type = 'url';\n multihash;\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 toMultihash() {\n return this.multihash;\n }\n toCID() {\n return CID.createV1(TRANSPORT_IPFS_GATEWAY_HTTP_CODE, this.toMultihash());\n }\n toJSON() {\n return this.toString();\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}\n//# sourceMappingURL=peer-id.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('12D3KooWKnDdG3iXw9eTFijk3EWSunZcFi54Zka4wmtqtt6rPxc8')\n *\n * console.log(peer.toCID()) // CID(bafzaa...)\n * console.log(peer.toString()) // \"12D3K...\"\n * ```\n */\nimport { publicKeyFromMultihash } from '@libp2p/crypto/keys';\nimport { InvalidCIDError, InvalidMultihashError, InvalidParametersError, UnsupportedKeyTypeError } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\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 { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { RSAPeerId as RSAPeerIdClass, Ed25519PeerId as Ed25519PeerIdClass, Secp256k1PeerId as Secp256k1PeerIdClass, URLPeerId as URLPeerIdClass } from './peer-id.js';\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst LIBP2P_KEY_CODE = 0x72;\nconst TRANSPORT_IPFS_GATEWAY_HTTP_CODE = 0x0920;\nexport function peerIdFromString(str, decoder) {\n let multihash;\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 multihash = Digest.decode(base58btc.decode(`z${str}`));\n }\n else if (str.startsWith('k51qzi5uqu5') || str.startsWith('kzwfwjn5ji4') || str.startsWith('k2k4r8') || str.startsWith('bafz')) {\n // base36 encoded CIDv1 with libp2p-key and identity hash (for ed25519/secp256k1/rsa) or base32 encoded CIDv1 with libp2p-key and identity hash (for ed25519/secp256k1/rsa)\n return peerIdFromCID(CID.parse(str));\n }\n else {\n if (decoder == null) {\n throw new InvalidParametersError('Please pass a multibase decoder for strings that do not start with \"1\" or \"Q\"');\n }\n multihash = Digest.decode(decoder.decode(str));\n }\n return peerIdFromMultihash(multihash);\n}\nexport function peerIdFromPublicKey(publicKey) {\n if (publicKey.type === 'Ed25519') {\n return new Ed25519PeerIdClass({\n multihash: publicKey.toCID().multihash,\n publicKey\n });\n }\n else if (publicKey.type === 'secp256k1') {\n return new Secp256k1PeerIdClass({\n multihash: publicKey.toCID().multihash,\n publicKey\n });\n }\n else if (publicKey.type === 'RSA') {\n return new RSAPeerIdClass({\n multihash: publicKey.toCID().multihash,\n publicKey\n });\n }\n throw new UnsupportedKeyTypeError();\n}\nexport function peerIdFromPrivateKey(privateKey) {\n return peerIdFromPublicKey(privateKey.publicKey);\n}\nexport function peerIdFromMultihash(multihash) {\n if (isSha256Multihash(multihash)) {\n return new RSAPeerIdClass({ multihash });\n }\n else if (isIdentityMultihash(multihash)) {\n try {\n const publicKey = publicKeyFromMultihash(multihash);\n if (publicKey.type === 'Ed25519') {\n return new Ed25519PeerIdClass({ multihash, publicKey });\n }\n else if (publicKey.type === 'secp256k1') {\n return new Secp256k1PeerIdClass({ multihash, publicKey });\n }\n }\n catch (err) {\n // was not Ed or secp key, try URL\n const url = uint8ArrayToString(multihash.digest);\n return new URLPeerIdClass(new URL(url));\n }\n }\n throw new InvalidMultihashError('Supplied PeerID Multihash 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 InvalidCIDError('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 URLPeerIdClass(new URL(url));\n }\n return peerIdFromMultihash(cid.multihash);\n}\nfunction isIdentityMultihash(multihash) {\n return multihash.code === identity.code;\n}\nfunction isSha256Multihash(multihash) {\n return multihash.code === sha256.code;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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","/**\n * HKDF (RFC 5869): extract + expand in one step.\n * See https://soatok.blog/2021/11/17/understanding-hkdf/.\n * @module\n */\nimport { ahash, anumber } from \"./_assert.js\";\nimport { hmac } from \"./hmac.js\";\nimport { toBytes } from \"./utils.js\";\n/**\n * HKDF-extract from spec. Less important part. `HKDF-Extract(IKM, salt) -> PRK`\n * Arguments position differs from spec (IKM is first one, since it is not optional)\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 */\nexport function extract(hash, ikm, salt) {\n ahash(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);\n return hmac(hash, toBytes(salt), toBytes(ikm));\n}\nconst HKDF_COUNTER = /* @__PURE__ */ new Uint8Array([0]);\nconst EMPTY_BUFFER = /* @__PURE__ */ new Uint8Array();\n/**\n * HKDF-expand from the spec. The most important part. `HKDF-Expand(PRK, info, L) -> OKM`\n * @param hash - hash function that would be used (e.g. sha256)\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 bytes\n */\nexport function expand(hash, prk, info, length = 32) {\n ahash(hash);\n anumber(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): derive keys from an initial input.\n * Combines hkdf_extract + hkdf_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 (can be a zero-length string)\n * @param length - length of output keying material in bytes\n * @example\n * import { hkdf } from '@noble/hashes/hkdf';\n * import { sha256 } from '@noble/hashes/sha2';\n * import { randomBytes } from '@noble/hashes/utils';\n * const inputKey = randomBytes(32);\n * const salt = randomBytes(32);\n * const info = 'application-key';\n * const hk1 = hkdf(sha256, inputKey, salt, info, 32);\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 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 { publicKeyFromProtobuf, publicKeyToProtobuf } from '@libp2p/crypto/keys';\nimport { UnexpectedPeerError } from '@libp2p/interface';\nimport {} from 'uint8arraylist';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\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: publicKeyToProtobuf(privateKey.publicKey),\n identitySig,\n extensions\n });\n}\nexport async function decodeHandshakePayload(payloadBytes, remoteStaticKey, remoteIdentityKey) {\n try {\n const payload = NoiseHandshakePayload.decode(payloadBytes);\n const publicKey = publicKeyFromProtobuf(payload.identityKey);\n if (remoteIdentityKey?.equals(publicKey) === false) {\n throw new Error(`Payload identity key ${publicKey} does not match expected remote identity key ${remoteIdentityKey}`);\n }\n if (!remoteStaticKey) {\n throw new Error('Remote static does not exist');\n }\n const signaturePayload = getSignaturePayload(remoteStaticKey);\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 { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { serviceCapabilities } from '@libp2p/interface';\nimport { peerIdFromPublicKey } 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 /**\n * Encrypt outgoing data to the remote party (handshake as initiator)\n *\n * @param connection - streaming iterable duplex that will be encrypted\n * @param options\n * @param options.remotePeer - PeerId of the remote peer. Used to validate the integrity of the remote peer\n * @param options.signal - Used to abort the operation\n */\n async secureOutbound(connection, options) {\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n const handshake = await this.performHandshakeInitiator(wrappedConnection, this.components.privateKey, options?.remotePeer?.publicKey, options);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n const publicKey = publicKeyFromProtobuf(handshake.payload.identityKey);\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: peerIdFromPublicKey(publicKey)\n };\n }\n /**\n * Decrypt incoming data (handshake as responder).\n *\n * @param connection - streaming iterable duplex that will be encrypted\n * @param options\n * @param options.remotePeer - PeerId of the remote peer. Used to validate the integrity of the remote peer\n * @param options.signal - Used to abort the operation\n */\n async secureInbound(connection, options) {\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n const handshake = await this.performHandshakeResponder(wrappedConnection, this.components.privateKey, options?.remotePeer?.publicKey, options);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n const publicKey = publicKeyFromProtobuf(handshake.payload.identityKey);\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: peerIdFromPublicKey(publicKey)\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, options) {\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 }, options);\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, privateKey, remoteIdentityKey, options) {\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 }, options);\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//# 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, options) {\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), options);\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(options));\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), options);\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, options) {\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(options));\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), options);\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(options));\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","/**\n * @packageDocumentation\n *\n * This repository contains TypeScript implementation of noise protocol, an encryption protocol used in libp2p.\n *\n * ## Usage\n *\n * Install with `yarn add @chainsafe/libp2p-noise` or `npm i @chainsafe/libp2p-noise`.\n *\n * Example of using default noise configuration and passing it to the libp2p config:\n *\n * ```ts\n * import {createLibp2p} from \"libp2p\"\n * import {noise} from \"@chainsafe/libp2p-noise\"\n *\n * //custom noise configuration, pass it instead of `noise()`\n * //x25519 private key\n * const n = noise({ staticNoiseKey });\n *\n * const libp2p = await createLibp2p({\n * connectionEncrypters: [noise()],\n * //... other options\n * })\n * ```\n *\n * See the [NoiseInit](https://github.com/ChainSafe/js-libp2p-noise/blob/master/src/noise.ts#L22-L30) interface for noise configuration options.\n *\n * ## API\n *\n * This module exposes an implementation of the [ConnectionEncrypter](https://libp2p.github.io/js-libp2p/interfaces/_libp2p_interface.ConnectionEncrypter.html) interface.\n *\n * ## Bring your own crypto\n *\n * You can provide a custom crypto implementation (instead of the default, based on [@noble](https://paulmillr.com/noble/)) by adding a `crypto` field to the init argument passed to the `Noise` factory.\n *\n * The implementation must conform to the `ICryptoInterface`, defined in \n */\nimport { 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=peer-discovery.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_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\n }\n },\n multiaddrs: peerData.multiaddrs\n });\n // check we are still running\n if (this.timer == null) {\n return;\n }\n this.safeDispatchEvent('peer', { detail: peerData });\n this.components.connectionManager.openConnection(peerData.id)\n .catch(err => {\n this.log.error('could not dial bootstrap peer %p', peerData.id, err);\n });\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 { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\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, opts = {}) => {\n const obj = {\n multiaddr: 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.multiaddr = 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 AddressInfo.encode = (obj) => {\n return encodeMessage(obj, AddressInfo.codec());\n };\n AddressInfo.decode = (buf, opts) => {\n return decodeMessage(buf, AddressInfo.codec(), opts);\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, opts = {}) => {\n const obj = {\n peerId: uint8ArrayAlloc(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 }\n case 2: {\n obj.seq = reader.uint64();\n break;\n }\n case 3: {\n if (opts.limits?.addresses != null && obj.addresses.length === opts.limits.addresses) {\n throw new MaxLengthError('Decode error - map field \"addresses\" had too many elements');\n }\n obj.addresses.push(PeerRecord.AddressInfo.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.addresses$\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 PeerRecord.encode = (obj) => {\n return encodeMessage(obj, PeerRecord.codec());\n };\n PeerRecord.decode = (buf, opts) => {\n return decodeMessage(buf, PeerRecord.codec(), opts);\n };\n})(PeerRecord || (PeerRecord = {}));\n//# sourceMappingURL=peer-record.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 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, opts = {}) => {\n const obj = {\n publicKey: uint8ArrayAlloc(0),\n payloadType: uint8ArrayAlloc(0),\n payload: uint8ArrayAlloc(0),\n signature: 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.publicKey = reader.bytes();\n break;\n }\n case 2: {\n obj.payloadType = reader.bytes();\n break;\n }\n case 3: {\n obj.payload = reader.bytes();\n break;\n }\n case 5: {\n obj.signature = 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 Envelope.encode = (obj) => {\n return encodeMessage(obj, Envelope.codec());\n };\n Envelope.decode = (buf, opts) => {\n return decodeMessage(buf, Envelope.codec(), opts);\n };\n})(Envelope || (Envelope = {}));\n//# sourceMappingURL=envelope.js.map","import { peerIdFromMultihash } from '@libp2p/peer-id';\nimport { arrayEquals } from '@libp2p/utils/array-equals';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport * as Digest from 'multiformats/hashes/digest';\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 = peerIdFromMultihash(Digest.decode(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.toMultihash().bytes,\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","/**\n * The key in the record is not valid for the domain\n */\nexport class InvalidSignatureError extends Error {\n constructor(message = 'Invalid signature') {\n super(message);\n this.name = 'InvalidSignatureError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { publicKeyFromProtobuf, publicKeyToProtobuf } from '@libp2p/crypto/keys';\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 { Envelope as Protobuf } from './envelope.js';\nimport { InvalidSignatureError } from './errors.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 publicKey = publicKeyFromProtobuf(envelopeData.publicKey);\n return new RecordEnvelope({\n publicKey,\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, privateKey) => {\n if (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 signature = await privateKey.sign(signData.subarray());\n return new RecordEnvelope({\n publicKey: privateKey.publicKey,\n payloadType,\n payload,\n signature\n });\n };\n /**\n * Open and certify a given marshaled envelope.\n * Data is unmarshaled 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 InvalidSignatureError('Envelope signature is not valid for the given domain');\n }\n return envelope;\n };\n publicKey;\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 { publicKey, payloadType, payload, signature } = init;\n this.publicKey = publicKey;\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.marshaled == null) {\n this.marshaled = Protobuf.encode({\n publicKey: publicKeyToProtobuf(this.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 return this.publicKey.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","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 '../private-ip.js';\nimport { isIpBased } from './is-ip-based.js';\n/**\n * Check if a given multiaddr starts with a private address\n */\nexport function isPrivate(ma) {\n try {\n if (!isIpBased(ma)) {\n // not an IP based multiaddr, cannot be private\n return false;\n }\n const [[, value]] = ma.stringTuples();\n if (value == null) {\n return false;\n }\n return isPrivateIp(value) ?? false;\n }\n catch {\n }\n return true;\n}\n//# sourceMappingURL=is-private.js.map","const CODEC_IP4 = 0x04;\nconst CODEC_IP6 = 0x29;\n/**\n * Check if a given multiaddr is IP-based\n */\nexport function isIpBased(ma) {\n try {\n const [[codec]] = ma.stringTuples();\n return codec === CODEC_IP4 || codec === CODEC_IP6;\n }\n catch {\n }\n return false;\n}\n//# sourceMappingURL=is-ip-based.js.map","import { 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};\nexport const 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};\nexport const literal = (str) => {\n return {\n match: (vals) => func((val) => val === str).match(vals),\n pattern: str\n };\n};\nexport const string = () => {\n return {\n match: (vals) => func((val) => typeof val === 'string').match(vals),\n pattern: '{string}'\n };\n};\nexport const number = () => {\n return {\n match: (vals) => func((val) => !isNaN(parseInt(val))).match(vals),\n pattern: '{number}'\n };\n};\nexport const 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};\nexport const 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};\nexport const 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};\nexport const 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};\nexport const 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};\nexport function 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 matchers,\n matches,\n exactMatch\n };\n}\n//# sourceMappingURL=utils.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 { and, or, literal, string, peerId, optional, fmt, func, number, certhash } from './utils.js';\n/**\n * Matches PeerId addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { PEER_ID } from '@multiformats/multiaddr-matcher'\n *\n * PEER_ID.matches(multiaddr('/p2p/Qmfoo')) // true\n * PEER_ID.matches(multiaddr('/ipfs/Qmfoo')) // true\n * ```\n */\nconst _PEER_ID = peerId();\nexport const PEER_ID = fmt(_PEER_ID);\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, optional(peerId()));\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, optional(peerId()));\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 * DNSADDR.matches(multiaddr('/dnsaddr/example.org/p2p/Qmfoo')) // true\n * ```\n */\nexport const DNSADDR = fmt(_DNSADDR, optional(peerId()));\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 * DNS.matches(multiaddr('/dns6/example.org/p2p/Qmfoo')) // true\n * ```\n */\nexport const DNS = fmt(or(_DNS, _DNSADDR, _DNS4, _DNS6), optional(peerId()));\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')) // true\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(or(_IP, and(or(_DNS, _DNSADDR, _DNS4, _DNS6), optional(peerId()))));\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(and(_TCP, optional(peerId())));\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'), optional(peerId()));\nconst _QUICV1 = and(_UDP, literal('quic-v1'), optional(peerId()));\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'), optional(and(literal('sni'), string())), 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())), and(literal('webrtc'), optional(peerId())));\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);\nconst _Memory = or(and(literal('memory'), string(), optional(peerId())));\n/**\n * Matches Memory addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { Memory } from '@multiformats/multiaddr-matcher'\n *\n * Memory.matches(multiaddr('/memory/0xDEADBEEF')) // true\n * ```\n */\nexport const Memory = fmt(_Memory);\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 error;\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 this.error = err;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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 this.error ?? 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 * 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 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","/**\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({\n ...options,\n bytes: 1\n }));\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({\n ...options,\n bytes: dataLength\n });\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","/**\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 { raceSignal } from 'race-signal';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { UnexpectedEOFError } from './errors.js';\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 (options) => {\n options?.signal?.throwIfAborted();\n if (options?.bytes == null) {\n // just read whatever arrives\n const { done, value } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n return null;\n }\n return value;\n }\n while (readBuffer.byteLength < options.bytes) {\n const { value, done } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n throw new UnexpectedEOFError('unexpected end of input');\n }\n readBuffer.append(value);\n }\n const buf = readBuffer.sublist(0, options.bytes);\n readBuffer.consume(options.bytes);\n return buf;\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","/* 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 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, opts = {}) => {\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 }\n case 6: {\n obj.agentVersion = reader.string();\n break;\n }\n case 1: {\n obj.publicKey = reader.bytes();\n break;\n }\n case 2: {\n if (opts.limits?.listenAddrs != null && obj.listenAddrs.length === opts.limits.listenAddrs) {\n throw new MaxLengthError('Decode error - map field \"listenAddrs\" had too many elements');\n }\n obj.listenAddrs.push(reader.bytes());\n break;\n }\n case 4: {\n obj.observedAddr = reader.bytes();\n break;\n }\n case 3: {\n if (opts.limits?.protocols != null && obj.protocols.length === opts.limits.protocols) {\n throw new MaxLengthError('Decode error - map field \"protocols\" had too many elements');\n }\n obj.protocols.push(reader.string());\n break;\n }\n case 8: {\n obj.signedPeerRecord = 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 Identify.encode = (obj) => {\n return encodeMessage(obj, Identify.codec());\n };\n Identify.decode = (buf, opts) => {\n return decodeMessage(buf, Identify.codec(), opts);\n };\n})(Identify || (Identify = {}));\n//# sourceMappingURL=message.js.map","import { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { InvalidMessageError } from '@libp2p/interface';\nimport { peerIdFromCID, peerIdFromPublicKey } 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 { 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 runOnLimitedConnection: 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 return nodeInfo.userAgent;\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 InvalidMessageError('message was null or undefined');\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 const publicKey = publicKeyFromProtobuf(message.publicKey);\n const peerId = peerIdFromPublicKey(publicKey);\n if (!peerId.equals(connection.remotePeer)) {\n throw new InvalidMessageError('public key did not match remote PeerId');\n }\n peer.publicKey = publicKey;\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.trace('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 const envelopePeer = peerIdFromCID(envelope.publicKey.toCID());\n // Verify peerId\n if (!peerRecord.peerId.equals(envelopePeer)) {\n throw new InvalidMessageError('signing key does not match PeerId in the PeerRecord');\n }\n // Make sure remote peer is the one sending the record\n if (!connection.remotePeer.equals(peerRecord.peerId)) {\n throw new InvalidMessageError('signing key does not match remote PeerId');\n }\n let existingPeer;\n try {\n existingPeer = await peerStore.get(peerRecord.peerId);\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\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.trace('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.trace('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 privateKey;\n peerStore;\n registrar;\n addressManager;\n maxInboundStreams;\n maxOutboundStreams;\n maxMessageSize;\n maxObservedAddresses;\n events;\n runOnLimitedConnection;\n log;\n constructor(components, init) {\n this.protocol = init.protocol;\n this.started = false;\n this.peerId = components.peerId;\n this.privateKey = components.privateKey;\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.runOnLimitedConnection = init.runOnLimitedConnection ?? defaultValues.runOnLimitedConnection;\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 runOnLimitedConnection: this.runOnLimitedConnection\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 { publicKeyFromProtobuf, publicKeyToProtobuf } from '@libp2p/crypto/keys';\nimport { InvalidMessageError, UnsupportedProtocolError, serviceCapabilities, setMaxListeners } from '@libp2p/interface';\nimport { peerIdFromCID } from '@libp2p/peer-id';\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport { isGlobalUnicast } from '@libp2p/utils/multiaddr/is-global-unicast';\nimport { isPrivate } from '@libp2p/utils/multiaddr/is-private';\nimport { protocols } from '@multiformats/multiaddr';\nimport { IP_OR_DOMAIN, TCP } 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';\nconst CODEC_IP6 = 0x29;\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)\n .catch(err => {\n if (err.name === UnsupportedProtocolError.name) {\n // the remote did not support identify, ignore the error\n return;\n }\n this.log.error('error during identify trigged by connection:open', err);\n });\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 runOnLimitedConnection: this.runOnLimitedConnection\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 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 InvalidMessageError('public key was missing from identify message');\n }\n const key = publicKeyFromProtobuf(publicKey);\n const id = peerIdFromCID(key.toCID());\n if (!connection.remotePeer.equals(id)) {\n throw new InvalidMessageError('identified peer does not match the expected peer');\n }\n if (this.peerId.equals(id)) {\n throw new InvalidMessageError('identified peer is our own peer id?');\n }\n // if the observed address is publicly routable, add it to the address\n // manager for verification via AutoNAT\n this.maybeAddObservedAddress(observedAddr);\n this.log('identify completed for peer %p and protocols %o', id, protocols);\n return consumeIdentifyMessage(this.peerStore, this.events, this.log, connection, message);\n }\n maybeAddObservedAddress(observedAddr) {\n const cleanObservedAddr = getCleanMultiaddr(observedAddr);\n if (cleanObservedAddr == null) {\n return;\n }\n this.log.trace('our observed address was %a', cleanObservedAddr);\n if (isPrivate(cleanObservedAddr)) {\n this.log.trace('our observed address was private');\n return;\n }\n const tuples = cleanObservedAddr.stringTuples();\n if (tuples[0][0] === CODEC_IP6 && !isGlobalUnicast(cleanObservedAddr)) {\n this.log.trace('our observed address was IPv6 but not a global unicast address');\n return;\n }\n if (TCP.exactMatch(cleanObservedAddr)) {\n // TODO: because socket dials can't use the same local port as the TCP\n // listener, many unique observed addresses are reported so ignore all\n // TCP addresses until https://github.com/libp2p/js-libp2p/issues/2620\n // is resolved\n return;\n }\n this.log.trace('storing the observed address');\n this.addressManager.addObservedAddr(cleanObservedAddr);\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 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.privateKey);\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: publicKeyToProtobuf(this.privateKey.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","import { cidrContains } from '@chainsafe/netmask';\nconst CODEC_IP6 = 0x29;\n/**\n * Check if a given multiaddr is an IPv6 global unicast address\n */\nexport function isGlobalUnicast(ma) {\n try {\n const [[codec, value]] = ma.stringTuples();\n if (value == null) {\n return false;\n }\n if (codec === CODEC_IP6) {\n return cidrContains('2000::/3', value);\n }\n }\n catch {\n }\n return false;\n}\n//# sourceMappingURL=is-global-unicast.js.map","import { IpNet } from \"./ipnet.js\";\nexport { ipToString } from \"./util.js\";\nexport { maskIp, iPv4FromIPv6, isIPv4mappedIPv6 } from \"./ip.js\";\nexport { IpNet } from \"./ipnet.js\";\nexport { parseCidr } from \"./cidr.js\";\n/**\n * Checks if cidr block contains ip address\n * @param cidr ipv4 or ipv6 formatted cidr . Example 198.51.100.14/24 or 2001:db8::/48\n * @param ip ipv4 or ipv6 address Example 198.51.100.14 or 2001:db8::\n *\n */\nexport function cidrContains(cidr, ip) {\n const ipnet = new IpNet(cidr);\n return ipnet.contains(ip);\n}\n//# sourceMappingURL=index.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","/**\n * A rate limit was hit\n */\nexport class RateLimitError extends Error {\n remainingPoints;\n msBeforeNext;\n consumedPoints;\n isFirstInDuration;\n constructor(message = 'Rate limit exceeded', props) {\n super(message);\n this.name = 'RateLimitError';\n this.remainingPoints = props.remainingPoints;\n this.msBeforeNext = props.msBeforeNext;\n this.consumedPoints = props.consumedPoints;\n this.isFirstInDuration = props.isFirstInDuration;\n }\n}\nexport class QueueFullError extends Error {\n static name = 'QueueFullError';\n constructor(message = 'The queue was full') {\n super(message);\n this.name = 'QueueFullError';\n }\n}\n//# sourceMappingURL=errors.js.map","import delay from 'delay';\nimport { RateLimitError } from './errors.js';\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 RateLimitError('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}\nexport class 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 { InvalidMessageError } from '@libp2p/interface';\nimport { 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 new InvalidMessageError('Unprocessed message queue size too large!');\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.name === 'InvalidMessageError') {\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 new InvalidMessageError('Message size too large');\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","/**\n * There was an error in the stream input buffer\n */\nexport class StreamInputBufferError extends Error {\n constructor(message = 'Stream input buffer error') {\n super(message);\n this.name = 'StreamInputBufferError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { StreamResetError, StreamStateError } 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 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 StreamStateError(`writable end state is \"${this.writeStatus}\" not \"ready\"`);\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 if (this.status !== 'open') {\n return;\n }\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 StreamResetError('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 { TooManyOutboundProtocolStreamsError, MuxerClosedError } 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 { StreamInputBufferError } from './errors.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 MuxerClosedError('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 TooManyOutboundProtocolStreamsError('Too many outbound streams open');\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 StreamInputBufferError('Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers');\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}\n/**\n * @deprecated mplex is deprecated as it has no flow control. Please use yamux instead.\n */\nexport function mplex(init = {}) {\n return (components) => new Mplex(components, init);\n}\n//# sourceMappingURL=index.js.map","import { InvalidParametersError } 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 InvalidParametersError('random bytes length must be a Number bigger than 0');\n }\n return randB(length);\n}\n//# sourceMappingURL=random-bytes.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { AbortError, InvalidMessageError, ProtocolError, TimeoutError } 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 } from './constants.js';\nexport class PingService {\n protocol;\n components;\n started;\n timeout;\n maxInboundStreams;\n maxOutboundStreams;\n runOnLimitedConnection;\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.runOnLimitedConnection = init.runOnLimitedConnection ?? 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 runOnLimitedConnection: this.runOnLimitedConnection\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 TimeoutError('ping 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 InvalidMessageError('Too much data received'));\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 runOnLimitedConnection: this.runOnLimitedConnection\n });\n onAbort = () => {\n stream?.abort(new AbortError());\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 ProtocolError(`Did not receive a ping ack after ${ms}ms`);\n }\n if (!uint8ArrayEquals(data, result.subarray())) {\n throw new ProtocolError(`Received wrong ping ack after ${ms}ms`);\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","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;\n//# sourceMappingURL=constants.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","/**\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=transport.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 return extractTuple('sni', ma)?.[1];\n}\nfunction extractPort(ma) {\n const port = extractTuple('tcp', ma)?.[1];\n if (port == null) {\n return '';\n }\n return `:${port}`;\n}\nfunction extractTuple(name, ma) {\n let code;\n try {\n code = protocols(name).code;\n }\n catch (e) {\n // No support for protocol in multiaddr\n return;\n }\n for (const [proto, value] of ma) {\n if (proto === code && value != null) {\n return [proto, value];\n }\n }\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 == null) {\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 == null) {\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 == null) {\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 == null) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}`;\n },\n p2p: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto == null) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}`;\n },\n http: (value, restMa) => {\n const maHasTLS = hasTLS(restMa);\n const sni = extractSNI(restMa);\n const port = extractPort(restMa);\n if (maHasTLS && sni != null) {\n return `https://${sni}${port}`;\n }\n const protocol = maHasTLS ? 'https://' : 'http://';\n const tailProto = restMa.pop();\n if (tailProto == null) {\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 == null) {\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 == null) {\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 == null) {\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 == null) {\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 const port = extractPort(restMa);\n if (maHasTLS && sni != null) {\n return `wss://${sni}${port}`;\n }\n const protocol = maHasTLS ? 'wss://' : 'ws://';\n const tailProto = restMa.pop();\n if (tailProto == null) {\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 == null) {\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};\nexport function multiaddrToUri(input, opts) {\n const ma = multiaddr(input);\n const parts = ma.stringTuples();\n const head = parts.pop();\n if (head == null) {\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://') || uri.startsWith('ws://') || uri.startsWith('wss://')) {\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 type;\n detail;\n constructor(type, detail) {\n super(type);\n this.type = type;\n // @ts-expect-error detail may be undefined\n this.detail = detail;\n }\n}\n//# sourceMappingURL=index.js.map","import { WebSocketsSecure, WebSockets, DNS } from '@multiformats/multiaddr-matcher';\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p` with a `denyDialMultiaddr` method that returns `false`\n */\nexport function all(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return WebSocketsSecure.exactMatch(ma) || WebSockets.exactMatch(ma);\n });\n}\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p`\n */\nexport function wss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return WebSocketsSecure.exactMatch(ma);\n });\n}\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p`\n */\nexport function dnsWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return DNS.matches(ma) && WebSocketsSecure.exactMatch(ma);\n });\n}\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p`\n */\nexport function dnsWsOrWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return DNS.matches(ma) && (WebSocketsSecure.exactMatch(ma) || WebSockets.exactMatch(ma));\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('/dns4/example.com/tcp/9090/tls/ws')\n * await node.dial(ma)\n * ```\n */\nimport { transportSymbol, serviceCapabilities, ConnectionFailedError } 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 * 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 ConnectionFailedError(`Could not connect to ${ma.toString()}`);\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) {\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 events: this.components.events,\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 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 { AbortError } 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 AbortError('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","// Time to wait for a connection to close gracefully before destroying it manually\nexport const CLOSE_TIMEOUT = 500;\n//# sourceMappingURL=constants.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","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\tlet abortHandler;\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\tabortHandler = () => {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t};\n\n\t\t\tsignal.addEventListener('abort', abortHandler, {once: true});\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\tif (abortHandler && options.signal) {\n\t\t\toptions.signal.removeEventListener('abort', abortHandler);\n\t\t}\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 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 id: options.id,\n run,\n };\n if (this.size === 0 || 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 setPriority(id, priority) {\n const index = this.#queue.findIndex((element) => element.id === id);\n if (index === -1) {\n throw new ReferenceError(`No promise function with the id \"${id}\" exists in the queue.`);\n }\n const [item] = this.#queue.splice(index, 1);\n this.enqueue(item.run, { priority, id });\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 // Use to assign a unique identifier to a promise function, if not explicitly specified\n #idAssigner = 1n;\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 /**\n Updates the priority of a promise function by its id, affecting its execution order. Requires a defined concurrency limit to take effect.\n\n For example, this can be used to prioritize a promise function to run earlier.\n\n ```js\n import PQueue from 'p-queue';\n\n const queue = new PQueue({concurrency: 1});\n\n queue.add(async () => '🦄', {priority: 1});\n queue.add(async () => '🦀', {priority: 0, id: '🦀'});\n queue.add(async () => '🦄', {priority: 1});\n queue.add(async () => '🦄', {priority: 1});\n\n queue.setPriority('🦀', 2);\n ```\n\n In this case, the promise function with `id: '🦀'` runs second.\n\n You can also deprioritize a promise function to delay its execution:\n\n ```js\n import PQueue from 'p-queue';\n\n const queue = new PQueue({concurrency: 1});\n\n queue.add(async () => '🦄', {priority: 1});\n queue.add(async () => '🦀', {priority: 1, id: '🦀'});\n queue.add(async () => '🦄');\n queue.add(async () => '🦄', {priority: 0});\n\n queue.setPriority('🦀', -1);\n ```\n Here, the promise function with `id: '🦀'` executes last.\n */\n setPriority(id, priority) {\n this.#queue.setPriority(id, priority);\n }\n async add(function_, options = {}) {\n // In case `id` is not defined.\n options.id ??= (this.#idAssigner++).toString();\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","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 { 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');\nclass RecursionLimitError extends Error {\n constructor(message = 'Max recursive depth reached') {\n super(message);\n this.name = 'RecursionLimitError';\n }\n}\nexport const dnsaddrResolver = async function dnsaddrResolver(ma, options = {}) {\n const recursionLimit = options.maxRecursiveDepth ?? MAX_RECURSIVE_DEPTH;\n if (recursionLimit === 0) {\n throw new RecursionLimitError('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","import { FaultTolerance, InvalidParametersError } from '@libp2p/interface';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport mergeOptions from 'merge-options';\nconst DefaultConfig = {\n addresses: {\n listen: [],\n announce: [],\n noAnnounce: [],\n announceFilter: (multiaddrs) => multiaddrs\n },\n connectionManager: {\n resolvers: {\n dnsaddr: dnsaddrResolver\n }\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 InvalidParametersError('Private network is enforced, but no protector was provided');\n }\n return resultingOptions;\n}\n//# sourceMappingURL=config.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=content-routing.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=peer-routing.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 globalThis.process !== 'undefined' && 'env' in globalThis.process) {\n r = globalThis.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 [weald](https://www.npmjs.com/package/weald), a TypeScript port of 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};\n// Add a formatter for stringifying Errors\ndebug.formatters.e = (v) => {\n return v == null ? 'undefined' : notEmpty(v.stack) ?? notEmpty(v.message) ?? 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}\nfunction notEmpty(str) {\n if (str == null) {\n return;\n }\n str = str.trim();\n if (str.length === 0) {\n return;\n }\n return str;\n}\n//# sourceMappingURL=index.js.map","import { peerIdFromMultihash } from '@libp2p/peer-id';\nimport { base58btc } from 'multiformats/bases/base58';\nimport * as Digest from 'multiformats/hashes/digest';\n/**\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}\nexport function peerIdFromString(str) {\n const multihash = Digest.decode(base58btc.decode(`z${str}`));\n return peerIdFromMultihash(multihash);\n}\n//# sourceMappingURL=util.js.map","import { mapIterable, peerIdFromString } 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 peerId = peerIdFromString(str);\n predicate(peerId, peerId, 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","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?.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?.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","/* 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, MaxSizeError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\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, opts = {}) => {\n const obj = {\n key: '',\n value: 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.key = reader.string();\n break;\n }\n case 2: {\n obj.value = 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 Peer$metadataEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$metadataEntry.codec());\n };\n Peer$metadataEntry.decode = (buf, opts) => {\n return decodeMessage(buf, Peer$metadataEntry.codec(), opts);\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, opts = {}) => {\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 }\n case 2: {\n obj.value = Tag.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.value\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 Peer$tagsEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$tagsEntry.codec());\n };\n Peer$tagsEntry.decode = (buf, opts) => {\n return decodeMessage(buf, Peer$tagsEntry.codec(), opts);\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 (obj.updated != null) {\n w.uint32(64);\n w.uint64Number(obj.updated);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\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 if (opts.limits?.addresses != null && obj.addresses.length === opts.limits.addresses) {\n throw new MaxLengthError('Decode error - map field \"addresses\" had too many elements');\n }\n obj.addresses.push(Address.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.addresses$\n }));\n break;\n }\n case 2: {\n if (opts.limits?.protocols != null && obj.protocols.length === opts.limits.protocols) {\n throw new MaxLengthError('Decode error - map field \"protocols\" had too many elements');\n }\n obj.protocols.push(reader.string());\n break;\n }\n case 4: {\n obj.publicKey = reader.bytes();\n break;\n }\n case 5: {\n obj.peerRecordEnvelope = reader.bytes();\n break;\n }\n case 6: {\n if (opts.limits?.metadata != null && obj.metadata.size === opts.limits.metadata) {\n throw new MaxSizeError('Decode error - map field \"metadata\" had too many elements');\n }\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 if (opts.limits?.tags != null && obj.tags.size === opts.limits.tags) {\n throw new MaxSizeError('Decode error - map field \"tags\" had too many elements');\n }\n const entry = Peer.Peer$tagsEntry.codec().decode(reader, reader.uint32(), {\n limits: {\n value: opts.limits?.tags$value\n }\n });\n obj.tags.set(entry.key, entry.value);\n break;\n }\n case 8: {\n obj.updated = reader.uint64Number();\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 Peer.encode = (obj) => {\n return encodeMessage(obj, Peer.codec());\n };\n Peer.decode = (buf, opts) => {\n return decodeMessage(buf, Peer.codec(), opts);\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 (obj.observed != null) {\n w.uint32(24);\n w.uint64Number(obj.observed);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n multiaddr: 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.multiaddr = reader.bytes();\n break;\n }\n case 2: {\n obj.isCertified = reader.bool();\n break;\n }\n case 3: {\n obj.observed = reader.uint64Number();\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 Address.encode = (obj) => {\n return encodeMessage(obj, Address.codec());\n };\n Address.decode = (buf, opts) => {\n return decodeMessage(buf, Address.codec(), opts);\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, opts = {}) => {\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 }\n case 2: {\n obj.expiry = 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 Tag.encode = (obj) => {\n return encodeMessage(obj, Tag.codec());\n };\n Tag.decode = (buf, opts) => {\n return decodeMessage(buf, Tag.codec(), opts);\n };\n})(Tag || (Tag = {}));\n//# sourceMappingURL=peer.js.map","import { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { peerIdFromPublicKey } from '@libp2p/peer-id';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { base58btc } from 'multiformats/bases/base58';\nimport * as Digest from 'multiformats/hashes/digest';\nimport { Peer as PeerPB } from '../pb/peer.js';\nfunction populatePublicKey(peerId, protobuf) {\n if (peerId.publicKey != null || protobuf.publicKey == null) {\n return peerId;\n }\n let digest;\n if (peerId.type === 'RSA') {\n // avoid hashing public key\n const multihash = base58btc.decode(`z${peerId}`);\n digest = Digest.decode(multihash);\n }\n const publicKey = publicKeyFromProtobuf(protobuf.publicKey, digest);\n return peerIdFromPublicKey(publicKey);\n}\nexport function bytesToPeer(peerId, buf, maxAddressAge) {\n const peer = PeerPB.decode(buf);\n return pbToPeer(peerId, peer, maxAddressAge);\n}\nexport function pbToPeer(peerId, peer, maxAddressAge) {\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: populatePublicKey(peerId, peer),\n addresses: peer.addresses\n // remove any expired multiaddrs\n .filter(({ observed }) => observed != null && observed > (Date.now() - maxAddressAge))\n .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 { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nexport function peerEquals(peerA, peerB) {\n return addressesEqual(peerA.addresses, peerB.addresses) &&\n protocolsEqual(peerA.protocols, peerB.protocols) &&\n publicKeyEqual(peerA.publicKey, peerB.publicKey) &&\n peerRecordEnvelope(peerA.peerRecordEnvelope, peerB.peerRecordEnvelope) &&\n metadataEqual(peerA.metadata, peerB.metadata) &&\n tagsEqual(peerA.tags, peerB.tags);\n}\nfunction addressesEqual(addressesA, addressesB) {\n return compareArrays(addressesA, addressesB, (a, b) => {\n if (a.isCertified !== b.isCertified) {\n return false;\n }\n if (!uint8ArrayEquals(a.multiaddr, b.multiaddr)) {\n return false;\n }\n return true;\n });\n}\nfunction protocolsEqual(protocolsA, protocolsB) {\n return compareArrays(protocolsA, protocolsB, (a, b) => a === b);\n}\nfunction publicKeyEqual(publicKeyA, publicKeyB) {\n return compareOptionalUint8Arrays(publicKeyA, publicKeyB);\n}\nfunction peerRecordEnvelope(envelopeA, envelopeB) {\n return compareOptionalUint8Arrays(envelopeA, envelopeB);\n}\nfunction metadataEqual(metadataA, metadataB) {\n return compareMaps(metadataA, metadataB, (a, b) => uint8ArrayEquals(a, b));\n}\nfunction tagsEqual(metadataA, metadataB) {\n return compareMaps(metadataA, metadataB, (a, b) => a.value === b.value && a.expiry === b.expiry);\n}\nfunction compareOptionalUint8Arrays(arrA, arrB) {\n if (arrA == null && arrB == null) {\n return true;\n }\n if (arrA != null && arrB != null) {\n return uint8ArrayEquals(arrA, arrB);\n }\n return false;\n}\nfunction compareArrays(arrA, arrB, compare) {\n if (arrA.length !== arrB.length) {\n return false;\n }\n for (let i = 0; i < arrA.length; i++) {\n if (!compare(arrA[i], arrB[i])) {\n return false;\n }\n }\n return true;\n}\nfunction compareMaps(mapA, mapB, compare) {\n if (mapA.size !== mapB.size) {\n return false;\n }\n for (const [key, value] of mapA.entries()) {\n const valueB = mapB.get(key);\n if (valueB == null) {\n return false;\n }\n if (!compare(value, valueB)) {\n return false;\n }\n }\n return true;\n}\n//# sourceMappingURL=peer-equals.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 { InvalidParametersError } from '@libp2p/interface';\nimport { isPeerId } from '@libp2p/interface';\nimport { Key } from 'interface-datastore/key';\nexport const NAMESPACE_COMMON = '/peers/';\nexport function peerIdToDatastoreKey(peerId) {\n if (!isPeerId(peerId) || peerId.type == null) {\n throw new InvalidParametersError('Invalid PeerId');\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 { InvalidParametersError } from '@libp2p/interface';\nimport { isMultiaddr, multiaddr } from '@multiformats/multiaddr';\nexport async function dedupeFilterAndSortAddresses(peerId, filter, addresses, existingAddresses) {\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 InvalidParametersError('Multiaddr was invalid');\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","/* eslint-disable complexity */\nimport { publicKeyToProtobuf } from '@libp2p/crypto/keys';\nimport { InvalidParametersError } from '@libp2p/interface';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { dedupeFilterAndSortAddresses } from './dedupe-addresses.js';\nexport async function toPeerPB(peerId, data, strategy, options) {\n if (data == null) {\n throw new InvalidParametersError('Invalid PeerData');\n }\n if (data.publicKey != null && peerId.publicKey != null && !data.publicKey.equals(peerId.publicKey)) {\n throw new InvalidParametersError('publicKey bytes do not match peer id publicKey bytes');\n }\n const existingPeer = options.existingPeer?.peer;\n if (existingPeer != null && !peerId.equals(existingPeer.id)) {\n throw new InvalidParametersError('peer id did not match existing peer id');\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 let publicKey;\n if (existingPeer?.id.publicKey != null) {\n publicKey = publicKeyToProtobuf(existingPeer.id.publicKey);\n }\n else if (data.publicKey != null) {\n publicKey = publicKeyToProtobuf(data.publicKey);\n }\n else if (peerId.publicKey != null) {\n publicKey = publicKeyToProtobuf(peerId.publicKey);\n }\n const output = {\n addresses: await dedupeFilterAndSortAddresses(peerId, options.addressFilter ?? (async () => true), addresses, options.existingPeer?.peerPB.addresses),\n protocols: [...protocols.values()].sort((a, b) => {\n return a.localeCompare(b);\n }),\n metadata,\n tags,\n publicKey,\n peerRecordEnvelope\n };\n // add observed addresses to multiaddrs\n output.addresses.forEach(addr => {\n addr.observed = options.existingPeer?.peerPB.addresses?.find(addr => uint8ArrayEquals(addr.multiaddr, addr.multiaddr))?.observed ?? Date.now();\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 InvalidParametersError('Metadata key must be a string');\n }\n if (!(value instanceof Uint8Array)) {\n throw new InvalidParametersError('Metadata value must be a Uint8Array');\n }\n}\nfunction validateTag(key, tag) {\n if (typeof key !== 'string') {\n throw new InvalidParametersError('Tag name must be a string');\n }\n if (tag.value != null) {\n if (parseInt(`${tag.value}`, 10) !== tag.value) {\n throw new InvalidParametersError('Tag value must be an integer');\n }\n if (tag.value < 0 || tag.value > 100) {\n throw new InvalidParametersError('Tag value must be between 0-100');\n }\n }\n if (tag.ttl != null) {\n if (parseInt(`${tag.ttl}`, 10) !== tag.ttl) {\n throw new InvalidParametersError('Tag ttl must be an integer');\n }\n if (tag.ttl < 0) {\n throw new InvalidParametersError('Tag ttl must be between greater than 0');\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 { NotFoundError } from '@libp2p/interface';\nimport { peerIdFromCID } from '@libp2p/peer-id';\nimport mortice, {} from 'mortice';\nimport { base32 } from 'multiformats/bases/base32';\nimport { CID } from 'multiformats/cid';\nimport { MAX_ADDRESS_AGE, MAX_PEER_AGE } from './constants.js';\nimport { Peer as PeerPB } from './pb/peer.js';\nimport { bytesToPeer, pbToPeer } from './utils/bytes-to-peer.js';\nimport { peerEquals } from './utils/peer-equals.js';\nimport { NAMESPACE_COMMON, peerIdToDatastoreKey } from './utils/peer-id-to-datastore-key.js';\nimport { toPeerPB } from './utils/to-peer-pb.js';\nfunction keyToPeerId(key) {\n // /peers/${peer-id-as-libp2p-key-cid-string-in-base-32}\n const base32Str = key.toString().split('/')[2];\n const buf = CID.parse(base32Str, base32);\n return peerIdFromCID(buf);\n}\nfunction decodePeer(key, value, maxAddressAge) {\n const peerId = keyToPeerId(key);\n return bytesToPeer(peerId, value, maxAddressAge);\n}\nfunction mapQuery(query, maxAddressAge) {\n return {\n prefix: NAMESPACE_COMMON,\n filters: (query.filters ?? []).map(fn => ({ key, value }) => {\n return fn(decodePeer(key, value, maxAddressAge));\n }),\n orders: (query.orders ?? []).map(fn => (a, b) => {\n return fn(decodePeer(a.key, a.value, maxAddressAge), decodePeer(b.key, b.value, maxAddressAge));\n })\n };\n}\nexport class PersistentStore {\n peerId;\n datastore;\n lock;\n addressFilter;\n log;\n maxAddressAge;\n maxPeerAge;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:peer-store');\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 this.maxAddressAge = init.maxAddressAge ?? MAX_ADDRESS_AGE;\n this.maxPeerAge = init.maxPeerAge ?? MAX_PEER_AGE;\n }\n async has(peerId) {\n try {\n await this.load(peerId);\n return true;\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\n throw err;\n }\n }\n return false;\n }\n async delete(peerId) {\n if (this.peerId.equals(peerId)) {\n return;\n }\n await this.datastore.delete(peerIdToDatastoreKey(peerId));\n }\n async load(peerId) {\n const key = peerIdToDatastoreKey(peerId);\n const buf = await this.datastore.get(key);\n const peer = PeerPB.decode(buf);\n if (this.#peerIsExpired(peerId, peer)) {\n await this.datastore.delete(key);\n throw new NotFoundError();\n }\n return pbToPeer(peerId, peer, this.peerId.equals(peerId) ? Infinity : this.maxAddressAge);\n }\n async save(peerId, data) {\n const existingPeer = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'patch', {\n addressFilter: this.addressFilter\n });\n return this.#saveIfDifferent(peerId, peerPb, existingPeer);\n }\n async patch(peerId, data) {\n const 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, existingPeer);\n }\n async merge(peerId, data) {\n const 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, existingPeer);\n }\n async *all(query) {\n for await (const { key, value } of this.datastore.query(mapQuery(query ?? {}, this.maxAddressAge))) {\n const peerId = keyToPeerId(key);\n // skip self peer if present\n if (peerId.equals(this.peerId)) {\n continue;\n }\n const peer = PeerPB.decode(value);\n // remove expired peer\n if (this.#peerIsExpired(peerId, peer)) {\n await this.datastore.delete(key);\n continue;\n }\n yield pbToPeer(peerId, peer, this.peerId.equals(peerId) ? Infinity : this.maxAddressAge);\n }\n }\n async #findExistingPeer(peerId) {\n try {\n const key = peerIdToDatastoreKey(peerId);\n const buf = await this.datastore.get(key);\n const peerPB = PeerPB.decode(buf);\n // remove expired peer\n if (this.#peerIsExpired(peerId, peerPB)) {\n await this.datastore.delete(key);\n throw new NotFoundError();\n }\n return {\n peerPB,\n peer: bytesToPeer(peerId, buf, this.maxAddressAge)\n };\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\n this.log.error('invalid peer data found in peer store - %e', err);\n }\n }\n }\n async #saveIfDifferent(peerId, peer, existingPeer) {\n // record last update\n peer.updated = Date.now();\n const buf = PeerPB.encode(peer);\n await this.datastore.put(peerIdToDatastoreKey(peerId), buf);\n return {\n peer: bytesToPeer(peerId, buf, this.maxAddressAge),\n previous: existingPeer?.peer,\n updated: existingPeer == null || !peerEquals(peer, existingPeer.peerPB)\n };\n }\n #peerIsExpired(peerId, peer) {\n if (peer.updated == null) {\n return true;\n }\n if (this.peerId.equals(peerId)) {\n return false;\n }\n const expired = peer.updated < (Date.now() - this.maxPeerAge);\n const minAddressObserved = Date.now() - this.maxAddressAge;\n const addrs = peer.addresses.filter(addr => {\n return addr.observed != null && addr.observed > minAddressObserved;\n });\n return expired && addrs.length === 0;\n }\n}\n//# sourceMappingURL=store.js.map","export const MAX_ADDRESS_AGE = 3_600_000;\nexport const MAX_PEER_AGE = 21_600_000;\n//# sourceMappingURL=constants.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 { peerIdFromCID } from '@libp2p/peer-id';\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 */\nclass 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 const peerId = peerIdFromCID(envelope.publicKey.toCID());\n if (expectedPeer?.equals(peerId) === false) {\n this.log('envelope peer id was not the expected peer id - expected: %p received: %p', expectedPeer, peerId);\n return false;\n }\n const peerRecord = PeerRecord.createFromProtobuf(envelope.payload);\n let peer;\n try {\n peer = await this.get(peerId);\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\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}\nexport function persistentPeerStore(components, init = {}) {\n return new PersistentPeerStore(components, init);\n}\n//# sourceMappingURL=index.js.map","export class OpenFailedError extends Error {\n static name = 'OpenFailedError';\n static code = 'ERR_OPEN_FAILED';\n name = OpenFailedError.name;\n code = OpenFailedError.code;\n constructor(message = 'Open failed') {\n super(message);\n }\n}\nexport class CloseFailedError extends Error {\n static name = 'CloseFailedError';\n static code = 'ERR_CLOSE_FAILED';\n name = CloseFailedError.name;\n code = CloseFailedError.code;\n constructor(message = 'Close failed') {\n super(message);\n }\n}\nexport class PutFailedError extends Error {\n static name = 'PutFailedError';\n static code = 'ERR_PUT_FAILED';\n name = PutFailedError.name;\n code = PutFailedError.code;\n constructor(message = 'Put failed') {\n super(message);\n }\n}\nexport class GetFailedError extends Error {\n static name = 'GetFailedError';\n static code = 'ERR_GET_FAILED';\n name = GetFailedError.name;\n code = GetFailedError.code;\n constructor(message = 'Get failed') {\n super(message);\n }\n}\nexport class DeleteFailedError extends Error {\n static name = 'DeleteFailedError';\n static code = 'ERR_DELETE_FAILED';\n name = DeleteFailedError.name;\n code = DeleteFailedError.code;\n constructor(message = 'Delete failed') {\n super(message);\n }\n}\nexport class HasFailedError extends Error {\n static name = 'HasFailedError';\n static code = 'ERR_HAS_FAILED';\n name = HasFailedError.name;\n code = HasFailedError.code;\n constructor(message = 'Has failed') {\n super(message);\n }\n}\nexport class NotFoundError extends Error {\n static name = 'NotFoundError';\n static code = 'ERR_NOT_FOUND';\n name = NotFoundError.name;\n code = NotFoundError.code;\n constructor(message = 'Not Found') {\n super(message);\n }\n}\nexport class AbortError extends Error {\n static name = 'AbortError';\n static code = 'ERR_ABORTED';\n name = AbortError.name;\n code = AbortError.code;\n constructor(message = 'Aborted') {\n super(message);\n }\n}\n//# sourceMappingURL=errors.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 { NotFoundError } from 'interface-store';\nimport { BaseDatastore } from './base.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 new 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 { 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","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","export var messages;\n(function (messages) {\n messages[\"NOT_STARTED_YET\"] = \"The libp2p node is not started yet\";\n messages[\"NOT_FOUND\"] = \"Not found\";\n})(messages || (messages = {}));\nexport class MissingServiceError extends Error {\n constructor(message = 'Missing service') {\n super(message);\n this.name = 'MissingServiceError';\n }\n}\nexport class UnmetServiceDependenciesError extends Error {\n constructor(message = 'Unmet service dependencies') {\n super(message);\n this.name = 'UnmetServiceDependenciesError';\n }\n}\nexport class NoContentRoutersError extends Error {\n constructor(message = 'No content routers available') {\n super(message);\n this.name = 'NoContentRoutersError';\n }\n}\nexport class NoPeerRoutersError extends Error {\n constructor(message = 'No peer routers available') {\n super(message);\n this.name = 'NoPeerRoutersError';\n }\n}\nexport class QueriedForSelfError extends Error {\n constructor(message = 'Should not try to find self') {\n super(message);\n this.name = 'QueriedForSelfError';\n }\n}\nexport class UnhandledProtocolError extends Error {\n constructor(message = 'Unhandled protocol error') {\n super(message);\n this.name = 'UnhandledProtocolError';\n }\n}\nexport class DuplicateProtocolHandlerError extends Error {\n constructor(message = 'Duplicate protocol handler error') {\n super(message);\n this.name = 'DuplicateProtocolHandlerError';\n }\n}\nexport class DialDeniedError extends Error {\n constructor(message = 'Dial denied error') {\n super(message);\n this.name = 'DialDeniedError';\n }\n}\nexport class NoValidAddressesError extends Error {\n constructor(message = 'No valid addresses') {\n super(message);\n this.name = 'NoValidAddressesError';\n }\n}\nexport class ConnectionInterceptedError extends Error {\n constructor(message = 'Connection intercepted') {\n super(message);\n this.name = 'ConnectionInterceptedError';\n }\n}\nexport class ConnectionDeniedError extends Error {\n constructor(message = 'Connection denied') {\n super(message);\n this.name = 'ConnectionDeniedError';\n }\n}\nexport class MuxerUnavailableError extends Error {\n constructor(message = 'Stream is not multiplexed') {\n super(message);\n this.name = 'MuxerUnavailableError';\n }\n}\nexport class EncryptionFailedError extends Error {\n constructor(message = 'Encryption failed') {\n super(message);\n this.name = 'EncryptionFailedError';\n }\n}\nexport class TransportUnavailableError extends Error {\n constructor(message = 'Transport unavailable') {\n super(message);\n this.name = 'TransportUnavailableError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { serviceCapabilities, serviceDependencies } from '@libp2p/interface';\nimport { isStartable } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nimport { MissingServiceError, UnmetServiceDependenciesError } from './errors.js';\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 MissingServiceError(`${prop} not set`);\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 UnmetServiceDependenciesError(`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.`);\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","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 { 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(), { key, 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 [val[1].key, val[1].value];\n });\n }\n forEach(fn) {\n this.map.forEach((value, key) => {\n fn(value.value, value.key, this);\n });\n }\n get(peer) {\n return this.map.get(peer.toString())?.value;\n }\n has(peer) {\n return this.map.has(peer.toString());\n }\n set(peer, value) {\n this.map.set(peer.toString(), { key: peer, value });\n }\n keys() {\n return mapIterable(this.map.values(), (val) => {\n return val.key;\n });\n }\n values() {\n return mapIterable(this.map.values(), (val) => val.value);\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 { InvalidMultiaddrError, InvalidParametersError, isPeerId } from '@libp2p/interface';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { isMultiaddr } from '@multiformats/multiaddr';\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 InvalidMultiaddrError('Invalid multiaddr');\n }\n const maPeerIdStr = ma.getPeerId();\n if (maPeerIdStr == null) {\n if (peerId != null) {\n throw new InvalidParametersError('Multiaddrs must all have the same peer id or have no peer id');\n }\n }\n else {\n const maPeerId = peerIdFromString(maPeerIdStr);\n if (peerId?.equals(maPeerId) !== true) {\n throw new InvalidParametersError('Multiaddrs must all have the same peer id or have no peer id');\n }\n }\n });\n }\n return {\n peerId,\n multiaddrs: peer\n };\n}\n//# sourceMappingURL=get-peer.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 this.maybePruneConnections = this.maybePruneConnections.bind(this);\n }\n start() {\n this.events.addEventListener('connection:open', this.maybePruneConnections);\n }\n stop() {\n this.events.removeEventListener('connection:open', this.maybePruneConnections);\n }\n maybePruneConnections() {\n this._maybePruneConnections()\n .catch(err => {\n this.log.error('error while pruning connections %e', err);\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.name !== 'NotFoundError') {\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","export * from './constants.defaults.js';\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//# 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#upgradeTimeout\n */\nexport const UPGRADE_TIMEOUT = 3e3;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#protocolNegotiationTimeout\n */\nexport const PROTOCOL_NEGOTIATION_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#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 * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxParallelReconnects\n */\nexport const MAX_PARALLEL_RECONNECTS = 5;\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 attempt failed with the timestamp\n * 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 * 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 attempt succeeded with the\n * timestamp stored as a string.\n */\nexport const LAST_DIAL_SUCCESS_KEY = 'last-dial-success';\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","/**\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, TypedEventEmitter } from '@libp2p/interface';\nimport { pushable } from 'it-pushable';\nimport { raceEvent } from 'race-event';\nimport { QueueFullError } from '../errors.js';\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 maxSize;\n queue;\n pending;\n sort;\n constructor(init = {}) {\n super();\n this.concurrency = init.concurrency ?? Number.POSITIVE_INFINITY;\n this.maxSize = init.maxSize ?? 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 if (this.size === this.maxSize) {\n throw new QueueFullError();\n }\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 AbortError('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';\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","import { isPrivate } from '@libp2p/utils/multiaddr/is-private';\nimport { Circuit, WebSockets, WebSocketsSecure, WebRTC, WebRTCDirect, WebTransport, TCP } from '@multiformats/multiaddr-matcher';\n/**\n * Sorts addresses by order of reliability, where they have presented the fewest\n * problems:\n *\n * TCP -> WebSockets/Secure -> WebRTC -> WebRTCDirect -> WebTransport\n */\n// eslint-disable-next-line complexity\nexport function reliableTransportsFirst(a, b) {\n const isATCP = TCP.exactMatch(a.multiaddr);\n const isBTCP = TCP.exactMatch(b.multiaddr);\n if (isATCP && !isBTCP) {\n return -1;\n }\n if (!isATCP && isBTCP) {\n return 1;\n }\n const isAWebSocketSecure = WebSocketsSecure.exactMatch(a.multiaddr);\n const isBWebSocketSecure = WebSocketsSecure.exactMatch(b.multiaddr);\n if (isAWebSocketSecure && !isBWebSocketSecure) {\n return -1;\n }\n if (!isAWebSocketSecure && isBWebSocketSecure) {\n return 1;\n }\n const isAWebSocket = WebSockets.exactMatch(a.multiaddr);\n const isBWebSocket = WebSockets.exactMatch(b.multiaddr);\n if (isAWebSocket && !isBWebSocket) {\n return -1;\n }\n if (!isAWebSocket && isBWebSocket) {\n return 1;\n }\n const isAWebRTC = WebRTC.exactMatch(a.multiaddr);\n const isBWebRTC = WebRTC.exactMatch(b.multiaddr);\n if (isAWebRTC && !isBWebRTC) {\n return -1;\n }\n if (!isAWebRTC && isBWebRTC) {\n return 1;\n }\n const isAWebRTCDirect = WebRTCDirect.exactMatch(a.multiaddr);\n const isBWebRTCDirect = WebRTCDirect.exactMatch(b.multiaddr);\n if (isAWebRTCDirect && !isBWebRTCDirect) {\n return -1;\n }\n if (!isAWebRTCDirect && isBWebRTCDirect) {\n return 1;\n }\n const isAWebTransport = WebTransport.exactMatch(a.multiaddr);\n const isBWebTransport = WebTransport.exactMatch(b.multiaddr);\n if (isAWebTransport && !isBWebTransport) {\n return -1;\n }\n if (!isAWebTransport && isBWebTransport) {\n return 1;\n }\n // ... everything else\n return 0;\n}\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 * end 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 defaultAddressSorter(addresses) {\n return addresses\n .sort(reliableTransportsFirst)\n .sort(certifiedAddressesFirst)\n .sort(circuitRelayAddressesLast)\n .sort(publicAddressesFirst);\n}\n//# sourceMappingURL=address-sorter.js.map","/* eslint-disable max-depth */\nimport { TimeoutError, DialError, setMaxListeners, AbortError } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\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 { DialDeniedError, NoValidAddressesError } from '../errors.js';\nimport { getPeerAddress } from '../get-peer.js';\nimport { defaultAddressSorter } from './address-sorter.js';\nimport { DIAL_TIMEOUT, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL, LAST_DIAL_FAILURE_KEY, MAX_DIAL_QUEUE_LENGTH, LAST_DIAL_SUCCESS_KEY } from './constants.js';\nimport { resolveMultiaddrs } from './utils.js';\nimport { DEFAULT_DIAL_PRIORITY } from './index.js';\nconst defaultOptions = {\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;\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 if (event.detail.name !== AbortError.name) {\n this.log.error('error in dial queue - %e', event.detail);\n }\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?.status === 'open') {\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 DialError('Dial queue is 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 DialError('Peer had more than maxPeerAddrsToDial');\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 // record the successful dial and the address\n try {\n await this.components.peerStore.merge(conn.remotePeer, {\n multiaddrs: [\n conn.remoteAddr\n ],\n metadata: {\n [LAST_DIAL_SUCCESS_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 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.merge(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 TimeoutError(err.message);\n }\n errors.push(err);\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n throw new AggregateError(errors, 'All multiaddr dials 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 DialError('Tried to dial self');\n }\n if ((await this.components.connectionGater.denyDialPeer?.(peerId)) === true) {\n throw new DialDeniedError('The dial request is blocked by gater.allowDialPeer');\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.name !== 'NotFoundError') {\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.name !== 'NoPeerRoutersError') {\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 NoValidAddressesError('The dial request has 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 = this.addressSorter == null ? defaultAddressSorter(gatedAdrs) : gatedAdrs.sort(this.addressSorter);\n // make sure we actually have some addresses to dial\n if (sortedGatedAddrs.length === 0) {\n throw new DialDeniedError('The connection gater denied all addresses in the dial request');\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.runOnLimitedConnection === 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","/**\n * When a peer that is tagged with this prefix disconnects, we will attempt to\n * redial it, up to a limit.\n *\n * To allow multiple components to add/remove their own keep-alive tags without\n * accidentally overwriting those of other components, attach a unique suffix to\n * the tag, e.g. `keep-alive-circuit-relay` or `keep-alive-kad-dht`, etc.\n */\nexport const KEEP_ALIVE = 'keep-alive';\n//# sourceMappingURL=peer-store.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","const objectToString = Object.prototype.toString;\n\nconst isError = value => objectToString.call(value) === '[object Error]';\n\nconst errorMessages = new Set([\n\t'network error', // Chrome\n\t'Failed to fetch', // Chrome\n\t'NetworkError when attempting to fetch resource.', // Firefox\n\t'The Internet connection appears to be offline.', // Safari 16\n\t'Load failed', // Safari 17+\n\t'Network request failed', // `cross-fetch`\n\t'fetch failed', // Undici (Node.js)\n\t'terminated', // Undici (Node.js)\n]);\n\nexport default function isNetworkError(error) {\n\tconst isValid = error\n\t\t&& isError(error)\n\t\t&& error.name === 'TypeError'\n\t\t&& typeof error.message === 'string';\n\n\tif (!isValid) {\n\t\treturn false;\n\t}\n\n\t// We do an extra check for Safari 17+ as it has a very generic error message.\n\t// Network errors in Safari have no stack.\n\tif (error.message === 'Load failed') {\n\t\treturn error.stack === undefined;\n\t}\n\n\treturn errorMessages.has(error.message);\n}\n","import retry from 'retry';\nimport isNetworkError from 'is-network-error';\n\nexport class AbortError extends Error {\n\tconstructor(message) {\n\t\tsuper();\n\n\t\tif (message instanceof Error) {\n\t\t\tthis.originalError = message;\n\t\t\t({message} = message);\n\t\t} else {\n\t\t\tthis.originalError = new Error(message);\n\t\t\tthis.originalError.stack = this.stack;\n\t\t}\n\n\t\tthis.name = 'AbortError';\n\t\tthis.message = message;\n\t}\n}\n\nconst decorateErrorWithCounts = (error, attemptNumber, options) => {\n\t// Minus 1 from attemptNumber because the first attempt does not count as a retry\n\tconst retriesLeft = options.retries - (attemptNumber - 1);\n\n\terror.attemptNumber = attemptNumber;\n\terror.retriesLeft = retriesLeft;\n\treturn error;\n};\n\nexport default async function pRetry(input, options) {\n\treturn new Promise((resolve, reject) => {\n\t\toptions = {...options};\n\t\toptions.onFailedAttempt ??= () => {};\n\t\toptions.shouldRetry ??= () => true;\n\t\toptions.retries ??= 10;\n\n\t\tconst operation = retry.operation(options);\n\n\t\tconst abortHandler = () => {\n\t\t\toperation.stop();\n\t\t\treject(options.signal?.reason);\n\t\t};\n\n\t\tif (options.signal && !options.signal.aborted) {\n\t\t\toptions.signal.addEventListener('abort', abortHandler, {once: true});\n\t\t}\n\n\t\tconst cleanUp = () => {\n\t\t\toptions.signal?.removeEventListener('abort', abortHandler);\n\t\t\toperation.stop();\n\t\t};\n\n\t\toperation.attempt(async attemptNumber => {\n\t\t\ttry {\n\t\t\t\tconst result = await input(attemptNumber);\n\t\t\t\tcleanUp();\n\t\t\t\tresolve(result);\n\t\t\t} catch (error) {\n\t\t\t\ttry {\n\t\t\t\t\tif (!(error instanceof Error)) {\n\t\t\t\t\t\tthrow new TypeError(`Non-error was thrown: \"${error}\". You should only throw errors.`);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (error instanceof AbortError) {\n\t\t\t\t\t\tthrow error.originalError;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (error instanceof TypeError && !isNetworkError(error)) {\n\t\t\t\t\t\tthrow error;\n\t\t\t\t\t}\n\n\t\t\t\t\tdecorateErrorWithCounts(error, attemptNumber, options);\n\n\t\t\t\t\tif (!(await options.shouldRetry(error))) {\n\t\t\t\t\t\toperation.stop();\n\t\t\t\t\t\treject(error);\n\t\t\t\t\t}\n\n\t\t\t\t\tawait options.onFailedAttempt(error);\n\n\t\t\t\t\tif (!operation.retry(error)) {\n\t\t\t\t\t\tthrow operation.mainError();\n\t\t\t\t\t}\n\t\t\t\t} catch (finalError) {\n\t\t\t\t\tdecorateErrorWithCounts(finalError, attemptNumber, options);\n\t\t\t\t\tcleanUp();\n\t\t\t\t\treject(finalError);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t});\n}\n","import { KEEP_ALIVE } from '@libp2p/interface';\nimport { PeerQueue } from '@libp2p/utils/peer-queue';\nimport pRetry from 'p-retry';\nimport { MAX_PARALLEL_RECONNECTS } from './constants.js';\n/**\n * When peers tagged with `KEEP_ALIVE` disconnect, this component attempts to\n * redial them\n */\nexport class ReconnectQueue {\n log;\n queue;\n started;\n peerStore;\n retries;\n retryInterval;\n backoffFactor;\n connectionManager;\n events;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:reconnect-queue');\n this.peerStore = components.peerStore;\n this.connectionManager = components.connectionManager;\n this.queue = new PeerQueue({\n concurrency: init.maxParallelReconnects ?? MAX_PARALLEL_RECONNECTS,\n metricName: 'libp2p_reconnect_queue',\n metrics: components.metrics\n });\n this.started = false;\n this.retries = init.retries ?? 5;\n this.backoffFactor = init.backoffFactor;\n this.retryInterval = init.retryInterval;\n this.events = components.events;\n components.events.addEventListener('peer:disconnect', (evt) => {\n this.maybeReconnect(evt.detail)\n .catch(err => {\n this.log.error('failed to maybe reconnect to %p - %e', evt.detail, err);\n });\n });\n }\n async maybeReconnect(peerId) {\n if (!this.started) {\n return;\n }\n const peer = await this.peerStore.get(peerId);\n if (!hasKeepAliveTag(peer)) {\n return;\n }\n if (this.queue.has(peerId)) {\n return;\n }\n this.queue.add(async (options) => {\n await pRetry(async (attempt) => {\n if (!this.started) {\n return;\n }\n try {\n await this.connectionManager.openConnection(peerId, {\n signal: options?.signal\n });\n }\n catch (err) {\n this.log('reconnecting to %p attempt %d of %d failed - %e', peerId, attempt, this.retries, err);\n throw err;\n }\n }, {\n signal: options?.signal,\n retries: this.retries,\n factor: this.backoffFactor,\n minTimeout: this.retryInterval\n });\n }, {\n peerId\n })\n .catch(async (err) => {\n this.log.error('failed to reconnect to %p - %e', peerId, err);\n const tags = {};\n [...peer.tags.keys()].forEach(key => {\n if (key.startsWith(KEEP_ALIVE)) {\n tags[key] = undefined;\n }\n });\n await this.peerStore.merge(peerId, {\n tags\n });\n this.events.safeDispatchEvent('peer:reconnect-failure', {\n detail: peerId\n });\n })\n .catch(async (err) => {\n this.log.error('failed to remove keep-alive tag from %p - %e', peerId, err);\n });\n }\n start() {\n this.started = true;\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: [\n (peer) => hasKeepAliveTag(peer)\n ]\n });\n await Promise.all(keepAlivePeers.map(async (peer) => {\n await this.connectionManager.openConnection(peer.id)\n .catch(err => {\n this.log.error(err);\n });\n }));\n })\n .catch(err => {\n this.log.error(err);\n });\n }\n stop() {\n this.started = false;\n this.queue.abort();\n }\n}\nfunction hasKeepAliveTag(peer) {\n for (const tag of peer.tags.keys()) {\n if (tag.startsWith(KEEP_ALIVE)) {\n return true;\n }\n }\n return false;\n}\n//# sourceMappingURL=reconnect-queue.js.map","import { ConnectionClosedError, InvalidMultiaddrError, InvalidParametersError, InvalidPeerIdError, NotStartedError, start, stop } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { RateLimiter } from '@libp2p/utils/rate-limiter';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport { CustomProgressEvent } from 'progress-events';\nimport { getPeerAddress } from '../get-peer.js';\nimport { ConnectionPruner } from './connection-pruner.js';\nimport { DIAL_TIMEOUT, INBOUND_CONNECTION_THRESHOLD, MAX_CONNECTIONS, MAX_DIAL_QUEUE_LENGTH, MAX_INCOMING_PENDING_CONNECTIONS, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL } from './constants.js';\nimport { DialQueue } from './dial-queue.js';\nimport { ReconnectQueue } from './reconnect-queue.js';\nexport const DEFAULT_DIAL_PRIORITY = 50;\nconst defaultOptions = {\n maxConnections: MAX_CONNECTIONS,\n inboundConnectionThreshold: INBOUND_CONNECTION_THRESHOLD,\n maxIncomingPendingConnections: MAX_INCOMING_PENDING_CONNECTIONS\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 outboundPendingConnections;\n maxConnections;\n dialQueue;\n reconnectQueue;\n connectionPruner;\n inboundConnectionRateLimiter;\n peerStore;\n metrics;\n events;\n log;\n peerId;\n constructor(components, init = {}) {\n this.maxConnections = init.maxConnections ?? defaultOptions.maxConnections;\n if (this.maxConnections < 1) {\n throw new InvalidParametersError('Connection Manager maxConnections must be greater than 0');\n }\n /**\n * Map of connections per peer\n */\n this.connections = new PeerMap();\n this.started = false;\n this.peerId = components.peerId;\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 // 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 this.outboundPendingConnections = 0;\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 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,\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 this.reconnectQueue = new ReconnectQueue({\n events: components.events,\n peerStore: components.peerStore,\n logger: components.logger,\n connectionManager: this\n }, {\n retries: init.reconnectRetries,\n retryInterval: init.reconnectRetryInterval,\n backoffFactor: init.reconnectBackoffFactor,\n maxParallelReconnects: init.maxParallelReconnects\n });\n }\n [Symbol.toStringTag] = '@libp2p/connection-manager';\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 'inbound pending': this.incomingPendingConnections,\n outbound: 0,\n 'outbound pending': this.outboundPendingConnections\n };\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n metric[conn.direction]++;\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.events.addEventListener('connection:open', this.onConnect);\n this.events.addEventListener('connection:close', this.onDisconnect);\n await start(this.dialQueue, this.reconnectQueue, this.connectionPruner);\n this.started = true;\n this.log('started');\n }\n /**\n * Stops the Connection Manager\n */\n async stop() {\n this.events.removeEventListener('connection:open', this.onConnect);\n this.events.removeEventListener('connection:close', this.onDisconnect);\n await stop(this.reconnectQueue, this.dialQueue, this.connectionPruner);\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 if (connection.status !== 'open') {\n // this can happen when the remote closes the connection immediately after\n // opening\n return;\n }\n const peerId = connection.remotePeer;\n const isNewPeer = !this.connections.has(peerId);\n const storedConns = this.connections.get(peerId) ?? [];\n storedConns.push(connection);\n this.connections.set(peerId, storedConns);\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 const peerId = connection.remotePeer;\n const peerConns = this.connections.get(peerId) ?? [];\n // remove closed connection\n const filteredPeerConns = peerConns.filter(conn => conn.id !== connection.id);\n // update peer connections\n this.connections.set(peerId, filteredPeerConns);\n if (filteredPeerConns.length === 0) {\n // trigger disconnect event if no connections remain\n this.log('onDisconnect remove all connections for peer %p', peerId);\n this.connections.delete(peerId);\n // broadcast disconnect event\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.started) {\n throw new NotStartedError('Not started');\n }\n this.outboundPendingConnections++;\n try {\n options.signal?.throwIfAborted();\n const { peerId } = getPeerAddress(peerIdOrMultiaddr);\n if (this.peerId.equals(peerId)) {\n throw new InvalidPeerIdError('Can not dial self');\n }\n if (peerId != null && options.force !== true) {\n this.log('dial %p', peerId);\n const existingConnection = this.getConnections(peerId)\n .find(conn => conn.limits == null);\n if (existingConnection != null) {\n this.log('had an existing non-limited 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 if (connection.status !== 'open') {\n throw new ConnectionClosedError('Remote closed connection during opening');\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 // make sure we don't already have a connection to this multiaddr\n if (options.force !== true && conn.id !== connection.id && conn.remoteAddr.equals(connection.remoteAddr)) {\n connection.abort(new InvalidMultiaddrError('Duplicate multiaddr connection'));\n // return the existing connection\n return conn;\n }\n }\n if (!trackedConnection) {\n peerConnections.push(connection);\n }\n return connection;\n }\n finally {\n this.outboundPendingConnections--;\n }\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","/**\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, setMaxListeners } 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;\nconst DEFAULT_ABORT_CONNECTION_ON_PING_FAILURE = true;\nexport class ConnectionMonitor {\n protocol;\n components;\n log;\n heartbeatInterval;\n pingIntervalMs;\n abortController;\n timeout;\n abortConnectionOnPingFailure;\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.abortConnectionOnPingFailure = init.abortConnectionOnPingFailure ?? DEFAULT_ABORT_CONNECTION_ON_PING_FAILURE;\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 setMaxListeners(Infinity, this.abortController.signal);\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 runOnLimitedConnection: 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.name !== 'UnsupportedProtocolError') {\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', err);\n if (this.abortConnectionOnPingFailure) {\n this.log.error('aborting connection due to ping failure');\n conn.abort(err);\n }\n else {\n this.log('connection ping failed, but not aborting due to abortConnectionOnPingFailure flag');\n }\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 { NotStartedError } from '@libp2p/interface';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport merge from 'it-merge';\nimport { NoContentRoutersError } 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 NoContentRoutersError('No content 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 NoContentRoutersError('No content 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 NotStartedError();\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 NotStartedError();\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 { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\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 ?? false;\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 { NotFoundError } from '@libp2p/interface';\nimport { createScalableCuckooFilter } from '@libp2p/utils/filters';\nimport merge from 'it-merge';\nimport parallel from 'it-parallel';\nimport { NoPeerRoutersError, QueriedForSelfError } 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 NoPeerRoutersError('No peer routers available');\n }\n if (id.toString() === this.peerId.toString()) {\n throw new QueriedForSelfError('Should not try to 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 NotFoundError();\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 NoPeerRoutersError('No peer 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.toMultihash().bytes)) {\n continue;\n }\n seen.add(peer.id.toMultihash().bytes);\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 { InvalidParametersError } from '@libp2p/interface';\nimport merge from 'merge-options';\nimport * as errorsJs 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 errorsJs.UnhandledProtocolError(`No handler registered for protocol ${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 errorsJs.DuplicateProtocolHandlerError(`Handler already registered for protocol ${protocol}`);\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 InvalidParametersError('invalid topology');\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.name === 'NotFoundError') {\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.limits != null && topology.notifyOnLimitedConnection !== 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 { FaultTolerance, InvalidParametersError, NotStartedError } from '@libp2p/interface';\nimport { trackedMap } from '@libp2p/utils/tracked-map';\nimport { CustomProgressEvent } from 'progress-events';\nimport { NoValidAddressesError, TransportUnavailableError } 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 InvalidParametersError('Transport must have a valid tag');\n }\n if (this.transports.has(tag)) {\n throw new InvalidParametersError(`There is already a transport with the tag ${tag}`);\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 TransportUnavailableError(`No transport available for address ${String(ma)}`);\n }\n options?.onProgress?.(new CustomProgressEvent('transport-manager:selected-transport', transport[Symbol.toStringTag]));\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 transport.dial(ma, {\n ...options,\n upgrader: this.components.upgrader\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 NotStartedError('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 NoValidAddressesError(`Transport (${key}) could not listen on any available address`);\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 NoValidAddressesError(message);\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","// 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;\n//# sourceMappingURL=constants.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","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 { MAX_DATA_LENGTH } from './constants.js';\nimport { InvalidDataLengthError } from './errors.js';\nimport { isAsyncIterable } from './utils.js';\n// Helper function to validate the chunk size against maxDataLength\nfunction validateMaxDataLength(chunk, maxDataLength) {\n if (chunk.byteLength > maxDataLength) {\n throw new InvalidDataLengthError('Message length too long');\n }\n}\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 const maxDataLength = options?.maxDataLength ?? MAX_DATA_LENGTH;\n function* maybeYield(chunk) {\n validateMaxDataLength(chunk, maxDataLength);\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 const maxDataLength = options?.maxDataLength ?? MAX_DATA_LENGTH;\n validateMaxDataLength(chunk, maxDataLength);\n return new Uint8ArrayList(encodeLength(chunk.byteLength), chunk);\n};\n//# sourceMappingURL=encode.js.map","/* eslint max-depth: [\"error\", 6] */\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { MAX_DATA_LENGTH, MAX_LENGTH_LENGTH } from './constants.js';\nimport { InvalidDataLengthError, InvalidDataLengthLengthError, InvalidMessageLengthError, UnexpectedEOFError } from './errors.js';\nimport { isAsyncIterable } from './utils.js';\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","/**\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 error;\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 this.error = err;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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 this.error ?? 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 * 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({\n ...options,\n bytes: 1\n }));\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({\n ...options,\n bytes: dataLength\n });\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","/**\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 { raceSignal } from 'race-signal';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { UnexpectedEOFError } from './errors.js';\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 (options) => {\n options?.signal?.throwIfAborted();\n if (options?.bytes == null) {\n // just read whatever arrives\n const { done, value } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n return null;\n }\n return value;\n }\n while (readBuffer.byteLength < options.bytes) {\n const { value, done } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n throw new UnexpectedEOFError('unexpected end of input');\n }\n readBuffer.append(value);\n }\n const buf = readBuffer.sublist(0, options.bytes);\n readBuffer.consume(options.bytes);\n return buf;\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","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 { InvalidMessageError } 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 InvalidMessageError('Missing newline');\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.trace('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 { UnsupportedProtocolError } 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 implementations\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 UnsupportedProtocolError('protocol selection failed');\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 UnsupportedProtocolError('protocol selection failed');\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=connection.js.map","import { connectionSymbol, setMaxListeners, LimitedConnectionError, ConnectionClosedError, ConnectionClosingError } 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 limits;\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.limits = init.limits;\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 ConnectionClosingError('the connection is being closed');\n }\n if (this.status === 'closed') {\n throw new ConnectionClosedError('the connection is closed');\n }\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n if (this.limits != null && options?.runOnLimitedConnection !== true) {\n throw new LimitedConnectionError('Cannot open protocol stream on limited 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 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 if (this.status === 'closed') {\n return;\n }\n this.log.error('aborting connection to %a due to error', this.remoteAddr, err);\n this.status = 'closing';\n // Abort raw connection\n this._abort(err);\n this.status = 'closed';\n this.timeline.close = Date.now();\n }\n}\nexport function createConnection(init) {\n return new ConnectionImpl(init);\n}\n//# sourceMappingURL=index.js.map","import { InvalidMultiaddrError, TooManyInboundProtocolStreamsError, TooManyOutboundProtocolStreamsError, LimitedConnectionError, setMaxListeners, InvalidPeerIdError } from '@libp2p/interface';\nimport * as mss from '@libp2p/multistream-select';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { anySignal } from 'any-signal';\nimport { CustomProgressEvent } from 'progress-events';\nimport { createConnection } from './connection/index.js';\nimport { PROTOCOL_NEGOTIATION_TIMEOUT, UPGRADE_TIMEOUT } from './connection-manager/constants.js';\nimport { ConnectionDeniedError, ConnectionInterceptedError, EncryptionFailedError, MuxerUnavailableError } from './errors.js';\nimport { DEFAULT_MAX_INBOUND_STREAMS, DEFAULT_MAX_OUTBOUND_STREAMS } from './registrar.js';\nfunction findIncomingStreamLimit(protocol, registrar) {\n try {\n const { options } = registrar.getHandler(protocol);\n return options.maxInboundStreams;\n }\n catch (err) {\n if (err.name !== 'UnhandledProtocolError') {\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.name !== 'UnhandledProtocolError') {\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 connectionEncrypters;\n streamMuxers;\n inboundUpgradeTimeout;\n outboundUpgradeTimeout;\n inboundStreamProtocolNegotiationTimeout;\n outboundStreamProtocolNegotiationTimeout;\n events;\n metrics;\n constructor(components, init) {\n this.components = components;\n this.connectionEncrypters = new Map();\n init.connectionEncrypters.forEach(encrypter => {\n this.connectionEncrypters.set(encrypter.protocol, encrypter);\n });\n this.streamMuxers = new Map();\n init.streamMuxers.forEach(muxer => {\n this.streamMuxers.set(muxer.protocol, muxer);\n });\n this.inboundUpgradeTimeout = init.inboundUpgradeTimeout ?? UPGRADE_TIMEOUT;\n this.outboundUpgradeTimeout = init.outboundUpgradeTimeout ?? UPGRADE_TIMEOUT;\n this.inboundStreamProtocolNegotiationTimeout = init.inboundStreamProtocolNegotiationTimeout ?? PROTOCOL_NEGOTIATION_TIMEOUT;\n this.outboundStreamProtocolNegotiationTimeout = init.outboundStreamProtocolNegotiationTimeout ?? PROTOCOL_NEGOTIATION_TIMEOUT;\n this.events = components.events;\n this.metrics = {\n dials: components.metrics?.registerCounterGroup('libp2p_connection_manager_dials_total'),\n errors: components.metrics?.registerCounterGroup('libp2p_connection_manager_dial_errors_total')\n };\n }\n [Symbol.toStringTag] = '@libp2p/upgrader';\n async shouldBlockConnection(method, ...args) {\n const denyOperation = this.components.connectionGater[method];\n if (denyOperation == null) {\n return;\n }\n const result = await denyOperation.apply(this.components.connectionGater, args);\n if (result === true) {\n throw new ConnectionInterceptedError(`The multiaddr connection is blocked by gater.${method}`);\n }\n }\n /**\n * Upgrades an inbound connection\n */\n async upgradeInbound(maConn, opts = {}) {\n try {\n this.metrics.dials?.increment({\n inbound: true\n });\n const accept = await this.components.connectionManager.acceptIncomingConnection(maConn);\n if (!accept) {\n throw new ConnectionDeniedError('connection denied');\n }\n await this.shouldBlockConnection('denyInboundConnection', maConn);\n const conn = await this._performUpgrade(maConn, 'inbound', opts);\n return conn;\n }\n catch (err) {\n this.metrics.errors?.increment({\n inbound: true\n });\n throw err;\n }\n finally {\n this.components.connectionManager.afterUpgradeInbound();\n }\n }\n /**\n * Upgrades an outbound connection\n */\n async upgradeOutbound(maConn, opts = {}) {\n try {\n this.metrics.dials?.increment({\n outbound: true\n });\n const idStr = maConn.remoteAddr.getPeerId();\n let remotePeerId;\n if (idStr != null) {\n remotePeerId = peerIdFromString(idStr);\n await this.shouldBlockConnection('denyOutboundConnection', remotePeerId, maConn);\n }\n return await this._performUpgrade(maConn, 'outbound', opts);\n }\n catch (err) {\n this.metrics.errors?.increment({\n outbound: true\n });\n throw err;\n }\n }\n async _performUpgrade(maConn, direction, opts) {\n let encryptedConn;\n let remotePeer;\n let upgradedConn;\n let muxerFactory;\n let cryptoProtocol;\n const upgradeTimeoutSignal = AbortSignal.timeout(direction === 'inbound' ? this.inboundUpgradeTimeout : this.outboundUpgradeTimeout);\n const signal = anySignal([upgradeTimeoutSignal, opts.signal]);\n setMaxListeners(Infinity, upgradeTimeoutSignal, signal);\n opts.signal = signal;\n this.components.metrics?.trackMultiaddrConnection(maConn);\n maConn.log.trace('starting the %s connection upgrade', direction);\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 %s connection', direction);\n protectedConn = await protector.protect(maConn, opts);\n }\n }\n try {\n // Encrypt the connection\n encryptedConn = protectedConn;\n if (opts?.skipEncryption !== true) {\n opts?.onProgress?.(new CustomProgressEvent(`upgrader:encrypt-${direction}-connection`));\n ({\n conn: encryptedConn,\n remotePeer,\n protocol: cryptoProtocol\n } = await (direction === 'inbound'\n ? this._encryptInbound(protectedConn, {\n ...opts,\n signal\n })\n : this._encryptOutbound(protectedConn, {\n ...opts,\n signal\n })));\n const maConn = {\n ...protectedConn,\n ...encryptedConn\n };\n await this.shouldBlockConnection(direction === 'inbound' ? 'denyInboundEncryptedConnection' : 'denyOutboundEncryptedConnection', remotePeer, maConn);\n }\n else {\n const idStr = maConn.remoteAddr.getPeerId();\n if (idStr == null) {\n throw new InvalidMultiaddrError(`${direction} connection that skipped encryption must have a peer id`);\n }\n const remotePeerId = peerIdFromString(idStr);\n cryptoProtocol = 'native';\n remotePeer = remotePeerId;\n }\n // this can happen if we dial a multiaddr without a peer id, we only find\n // out the identity of the remote after the connection is encrypted\n if (remotePeer.equals(this.components.peerId)) {\n const err = new InvalidPeerIdError('Can not dial self');\n maConn.abort(err);\n throw err;\n }\n upgradedConn = encryptedConn;\n if (opts?.muxerFactory != null) {\n muxerFactory = opts.muxerFactory;\n }\n else if (this.streamMuxers.size > 0) {\n opts?.onProgress?.(new CustomProgressEvent(`upgrader:multiplex-${direction}-connection`));\n // Multiplex the connection\n const multiplexed = await (direction === 'inbound'\n ? this._multiplexInbound({\n ...protectedConn,\n ...encryptedConn\n }, this.streamMuxers, opts)\n : this._multiplexOutbound({\n ...protectedConn,\n ...encryptedConn\n }, this.streamMuxers, opts));\n muxerFactory = multiplexed.muxerFactory;\n upgradedConn = multiplexed.stream;\n }\n }\n catch (err) {\n maConn.log.error('failed to upgrade inbound connection %s %a - %e', direction === 'inbound' ? 'from' : 'to', maConn.remoteAddr, err);\n throw err;\n }\n finally {\n signal.clear();\n }\n await this.shouldBlockConnection(direction === 'inbound' ? 'denyInboundUpgradedConnection' : 'denyOutboundUpgradedConnection', remotePeer, maConn);\n maConn.log('successfully upgraded %s connection', direction);\n return this._createConnection({\n cryptoProtocol,\n direction,\n maConn,\n upgradedConn,\n muxerFactory,\n remotePeer,\n limits: opts?.limits\n });\n }\n /**\n * A convenience method for generating a new `Connection`\n */\n _createConnection(opts) {\n const { cryptoProtocol, direction, maConn, upgradedConn, remotePeer, muxerFactory, limits } = 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 signal = AbortSignal.timeout(this.inboundStreamProtocolNegotiationTimeout);\n setMaxListeners(Infinity, signal);\n const { stream, protocol } = await mss.handle(muxedStream, protocols, {\n signal,\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 TooManyInboundProtocolStreamsError(`Too many inbound protocol streams for protocol \"${protocol}\" - limit ${incomingLimit}`);\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 - %e', muxedStream.id, err);\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 MuxerUnavailableError('Connection is not multiplexed');\n }\n connection.log.trace('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(this.outboundStreamProtocolNegotiationTimeout);\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.trace('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 TooManyOutboundProtocolStreamsError(`Too many outbound protocol streams for protocol \"${protocol}\" - ${streamCount}/${outgoingLimit}`);\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 outbound stream on connection %s %a for protocols %s - %e', direction === 'inbound' ? 'from' : 'to', opts.maConn.remoteAddr, protocols, err);\n if (muxedStream.timeline.close == null) {\n muxedStream.abort(err);\n }\n throw err;\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 - %e', err);\n });\n }\n const _timeline = maConn.timeline;\n maConn.timeline = new Proxy(_timeline, {\n set: (...args) => {\n if (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 %e', 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 %e', err);\n });\n }\n return Reflect.set(...args);\n }\n });\n maConn.timeline.upgraded = Date.now();\n const errConnectionNotMultiplexed = () => {\n throw new MuxerUnavailableError('Connection is 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 limits,\n logger: this.components.logger,\n newStream: newStream ?? errConnectionNotMultiplexed,\n getStreams: () => {\n return muxer?.streams ?? [];\n },\n close: async (options) => {\n // ensure remaining streams are closed gracefully\n await muxer?.close(options);\n // close the underlying transport\n await maConn.close(options);\n },\n abort: (err) => {\n maConn.abort(err);\n // ensure remaining streams are aborted\n muxer?.abort(err);\n }\n });\n this.events.safeDispatchEvent('connection:open', {\n detail: connection\n });\n // @ts-expect-error nah\n connection.__maConnTimeline = _timeline;\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.limits != null && options.runOnLimitedConnection !== true) {\n throw new LimitedConnectionError('Cannot open protocol stream on limited connection');\n }\n handler({ connection, stream });\n }\n /**\n * Attempts to encrypt the incoming `connection` with the provided `cryptos`\n */\n async _encryptInbound(connection, options) {\n const protocols = Array.from(this.connectionEncrypters.keys());\n try {\n const { stream, protocol } = await mss.handle(connection, protocols, {\n ...options,\n log: connection.log\n });\n const encrypter = this.connectionEncrypters.get(protocol);\n if (encrypter == null) {\n throw new EncryptionFailedError(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting inbound connection to %a using %s', connection.remoteAddr, protocol);\n return {\n ...await encrypter.secureInbound(stream, options),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting inbound connection from %a failed', connection.remoteAddr, err);\n throw new EncryptionFailedError(err.message);\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, options) {\n const protocols = Array.from(this.connectionEncrypters.keys());\n try {\n connection.log.trace('selecting encrypter from %s', protocols);\n const { stream, protocol } = await mss.select(connection, protocols, {\n ...options,\n log: connection.log,\n yieldBytes: true\n });\n const encrypter = this.connectionEncrypters.get(protocol);\n if (encrypter == null) {\n throw new EncryptionFailedError(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting outbound connection to %a using %s', connection.remoteAddr, protocol);\n return {\n ...await encrypter.secureOutbound(stream, options),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting outbound connection to %a failed', connection.remoteAddr, err);\n throw new EncryptionFailedError(err.message);\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, options) {\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 ...options,\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 MuxerUnavailableError(String(err));\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, options) {\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 ...options,\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 MuxerUnavailableError(String(err));\n }\n }\n}\n//# sourceMappingURL=upgrader.js.map","import { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { contentRoutingSymbol, TypedEventEmitter, setMaxListeners, peerDiscoverySymbol, peerRoutingSymbol, InvalidParametersError } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport { peerIdFromString } from '@libp2p/peer-id';\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 { DefaultConnectionManager } from './connection-manager/index.js';\nimport { ConnectionMonitor } from './connection-monitor.js';\nimport { CompoundContentRouting } from './content-routing.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 Libp2p 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', 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 connectionEncrypters: (init.connectionEncrypters ?? []).map((fn, index) => this.configureComponent(`connection-encryption-${index}`, fn(this.components))),\n streamMuxers: (init.streamMuxers ?? []).map((fn, index) => this.configureComponent(`stream-muxers-${index}`, fn(this.components))),\n inboundUpgradeTimeout: init.connectionManager?.inboundUpgradeTimeout,\n outboundUpgradeTimeout: init.connectionManager?.outboundUpgradeTimeout\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 InvalidParametersError('no protocols were provided to open a stream');\n }\n protocols = Array.isArray(protocols) ? protocols : [protocols];\n if (protocols.length === 0) {\n throw new InvalidParametersError('no protocols were provided to open a 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 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.name !== 'NotFoundError') {\n throw err;\n }\n }\n const peerKey = uint8ArrayConcat([\n uint8ArrayFromString('/pk/'),\n peer.toMultihash().bytes\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 const publicKey = publicKeyFromProtobuf(bytes);\n await this.peerStore.patch(peer, {\n publicKey\n });\n return publicKey;\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('peer discovery mechanism 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//# sourceMappingURL=libp2p.js.map","export const version = '2.1.8';\nexport const name = 'libp2p';\n//# sourceMappingURL=version.js.map","export function isTestEnvironment() {\n try {\n return process?.env?.NODE_ENV === \"test\";\n }\n catch (_e) {\n // process variable is not defined in PROD environment\n return false;\n }\n}\n//# sourceMappingURL=env.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 = isBytes(hex);\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 = isBytes(hex);\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 isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\nfunction abytes(item) {\n if (!isBytes(item))\n throw new Error('Uint8Array expected');\n}\nfunction concatBytes(...arrays) {\n arrays.every(abytes);\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 }, (_, i) => i.toString(16).padStart(2, '0'));\nexport function bytesToHex(bytes) {\n abytes(bytes);\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0;\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10);\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10);\n return;\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('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}\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 bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return isBytes(hex) ? 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 (isBytes(key)) {\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 = 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 === 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 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 = 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 { publicKeyFromRaw } from \"@libp2p/crypto/keys\";\nimport { peerIdFromPublicKey } from \"@libp2p/peer-id\";\nexport const ERR_TYPE_NOT_IMPLEMENTED = \"Keypair type not implemented\";\nexport function createPeerIdFromPublicKey(publicKey) {\n const pubKey = publicKeyFromRaw(publicKey);\n if (pubKey.type !== \"secp256k1\") {\n throw new Error(ERR_TYPE_NOT_IMPLEMENTED);\n }\n return peerIdFromPublicKey(pubKey);\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.8.0\";\n//# sourceMappingURL=_version.js.map","export const version = \"bytes/5.8.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.8.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 = 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","export default class QuickLRU extends Map {\n\t#size = 0;\n\t#cache = new Map();\n\t#oldCache = new Map();\n\t#maxSize;\n\t#maxAge;\n\t#onEviction;\n\n\tconstructor(options = {}) {\n\t\tsuper();\n\n\t\tif (!(options.maxSize && options.maxSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tif (typeof options.maxAge === 'number' && options.maxAge === 0) {\n\t\t\tthrow new TypeError('`maxAge` must be a number greater than 0');\n\t\t}\n\n\t\tthis.#maxSize = options.maxSize;\n\t\tthis.#maxAge = options.maxAge || Number.POSITIVE_INFINITY;\n\t\tthis.#onEviction = options.onEviction;\n\t}\n\n\t// For tests.\n\tget __oldCache() {\n\t\treturn this.#oldCache;\n\t}\n\n\t#emitEvictions(cache) {\n\t\tif (typeof this.#onEviction !== 'function') {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (const [key, item] of cache) {\n\t\t\tthis.#onEviction(key, item.value);\n\t\t}\n\t}\n\n\t#deleteIfExpired(key, item) {\n\t\tif (typeof item.expiry === 'number' && item.expiry <= Date.now()) {\n\t\t\tif (typeof this.#onEviction === 'function') {\n\t\t\t\tthis.#onEviction(key, item.value);\n\t\t\t}\n\n\t\t\treturn this.delete(key);\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t#getOrDeleteIfExpired(key, item) {\n\t\tconst deleted = this.#deleteIfExpired(key, item);\n\t\tif (deleted === false) {\n\t\t\treturn item.value;\n\t\t}\n\t}\n\n\t#getItemValue(key, item) {\n\t\treturn item.expiry ? this.#getOrDeleteIfExpired(key, item) : item.value;\n\t}\n\n\t#peek(key, cache) {\n\t\tconst item = cache.get(key);\n\n\t\treturn this.#getItemValue(key, item);\n\t}\n\n\t#set(key, value) {\n\t\tthis.#cache.set(key, value);\n\t\tthis.#size++;\n\n\t\tif (this.#size >= this.#maxSize) {\n\t\t\tthis.#size = 0;\n\t\t\tthis.#emitEvictions(this.#oldCache);\n\t\t\tthis.#oldCache = this.#cache;\n\t\t\tthis.#cache = new Map();\n\t\t}\n\t}\n\n\t#moveToRecent(key, item) {\n\t\tthis.#oldCache.delete(key);\n\t\tthis.#set(key, item);\n\t}\n\n\t* #entriesAscending() {\n\t\tfor (const item of this.#oldCache) {\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield item;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (const item of this.#cache) {\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield item;\n\t\t\t}\n\t\t}\n\t}\n\n\tget(key) {\n\t\tif (this.#cache.has(key)) {\n\t\t\tconst item = this.#cache.get(key);\n\t\t\treturn this.#getItemValue(key, item);\n\t\t}\n\n\t\tif (this.#oldCache.has(key)) {\n\t\t\tconst item = this.#oldCache.get(key);\n\t\t\tif (this.#deleteIfExpired(key, item) === false) {\n\t\t\t\tthis.#moveToRecent(key, item);\n\t\t\t\treturn item.value;\n\t\t\t}\n\t\t}\n\t}\n\n\tset(key, value, {maxAge = this.#maxAge} = {}) {\n\t\tconst expiry = typeof maxAge === 'number' && maxAge !== Number.POSITIVE_INFINITY\n\t\t\t? (Date.now() + maxAge)\n\t\t\t: undefined;\n\n\t\tif (this.#cache.has(key)) {\n\t\t\tthis.#cache.set(key, {\n\t\t\t\tvalue,\n\t\t\t\texpiry,\n\t\t\t});\n\t\t} else {\n\t\t\tthis.#set(key, {value, expiry});\n\t\t}\n\n\t\treturn this;\n\t}\n\n\thas(key) {\n\t\tif (this.#cache.has(key)) {\n\t\t\treturn !this.#deleteIfExpired(key, this.#cache.get(key));\n\t\t}\n\n\t\tif (this.#oldCache.has(key)) {\n\t\t\treturn !this.#deleteIfExpired(key, this.#oldCache.get(key));\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tpeek(key) {\n\t\tif (this.#cache.has(key)) {\n\t\t\treturn this.#peek(key, this.#cache);\n\t\t}\n\n\t\tif (this.#oldCache.has(key)) {\n\t\t\treturn this.#peek(key, this.#oldCache);\n\t\t}\n\t}\n\n\tdelete(key) {\n\t\tconst deleted = this.#cache.delete(key);\n\t\tif (deleted) {\n\t\t\tthis.#size--;\n\t\t}\n\n\t\treturn this.#oldCache.delete(key) || deleted;\n\t}\n\n\tclear() {\n\t\tthis.#cache.clear();\n\t\tthis.#oldCache.clear();\n\t\tthis.#size = 0;\n\t}\n\n\tresize(newSize) {\n\t\tif (!(newSize && newSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tconst items = [...this.#entriesAscending()];\n\t\tconst removeCount = items.length - newSize;\n\t\tif (removeCount < 0) {\n\t\t\tthis.#cache = new Map(items);\n\t\t\tthis.#oldCache = new Map();\n\t\t\tthis.#size = items.length;\n\t\t} else {\n\t\t\tif (removeCount > 0) {\n\t\t\t\tthis.#emitEvictions(items.slice(0, removeCount));\n\t\t\t}\n\n\t\t\tthis.#oldCache = new Map(items.slice(removeCount));\n\t\t\tthis.#cache = new Map();\n\t\t\tthis.#size = 0;\n\t\t}\n\n\t\tthis.#maxSize = newSize;\n\t}\n\n\t* keys() {\n\t\tfor (const [key] of this) {\n\t\t\tyield key;\n\t\t}\n\t}\n\n\t* values() {\n\t\tfor (const [, value] of this) {\n\t\t\tyield value;\n\t\t}\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tfor (const item of this.#cache) {\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield [key, value.value];\n\t\t\t}\n\t\t}\n\n\t\tfor (const item of this.#oldCache) {\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield [key, value.value];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t* entriesDescending() {\n\t\tlet items = [...this.#cache];\n\t\tfor (let i = items.length - 1; i >= 0; --i) {\n\t\t\tconst item = items[i];\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield [key, value.value];\n\t\t\t}\n\t\t}\n\n\t\titems = [...this.#oldCache];\n\t\tfor (let i = items.length - 1; i >= 0; --i) {\n\t\t\tconst item = items[i];\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield [key, value.value];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t* entriesAscending() {\n\t\tfor (const [key, value] of this.#entriesAscending()) {\n\t\t\tyield [key, value.value];\n\t\t}\n\t}\n\n\tget size() {\n\t\tif (!this.#size) {\n\t\t\treturn this.#oldCache.size;\n\t\t}\n\n\t\tlet oldCacheSize = 0;\n\t\tfor (const key of this.#oldCache.keys()) {\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\toldCacheSize++;\n\t\t\t}\n\t\t}\n\n\t\treturn Math.min(this.#size + oldCacheSize, this.#maxSize);\n\t}\n\n\tget maxSize() {\n\t\treturn this.#maxSize;\n\t}\n\n\tentries() {\n\t\treturn this.entriesAscending();\n\t}\n\n\tforEach(callbackFunction, thisArgument = this) {\n\t\tfor (const [key, value] of this.entriesAscending()) {\n\t\t\tcallbackFunction.call(thisArgument, value, key, this);\n\t\t}\n\t}\n\n\tget [Symbol.toStringTag]() {\n\t\treturn 'QuickLRU';\n\t}\n\n\ttoString() {\n\t\treturn `QuickLRU(${this.size}/${this.maxSize})`;\n\t}\n\n\t[Symbol.for('nodejs.util.inspect.custom')]() {\n\t\treturn this.toString();\n\t}\n}\n","/**\n * Build fetch resource for request\n */\nexport function buildResource(serverResolver, hostname, recordType) {\n return `${serverResolver}?name=${hostname}&type=${recordType}`;\n}\n/**\n * Use fetch to find the record\n */\nexport async function request(resource, signal) {\n const req = await fetch(resource, {\n headers: new Headers({\n accept: 'application/dns-json'\n }),\n signal\n });\n const res = await req.json();\n return res;\n}\n/**\n * Creates cache key composed by recordType and hostname\n *\n * @param {string} hostname\n * @param {string} recordType\n */\nexport function getCacheKey(hostname, recordType) {\n return `${recordType}_${hostname}`;\n}\n//# sourceMappingURL=utils.js.map","import QuickLRU from 'quick-lru';\nimport debug from 'weald';\nimport * as utils from './utils.js';\nconst log = Object.assign(debug('dns-over-http-resolver'), {\n error: debug('dns-over-http-resolver:error')\n});\n/**\n * DNS over HTTP resolver.\n * Uses a list of servers to resolve DNS records with HTTP requests.\n */\nclass Resolver {\n _cache;\n _TXTcache;\n _servers;\n _request;\n _abortControllers;\n /**\n * @class\n * @param {object} [options]\n * @param {number} [options.maxCache = 100] - maximum number of cached dns records\n * @param {Request} [options.request] - function to return DNSJSON\n */\n constructor(options = {}) {\n this._cache = new QuickLRU({ maxSize: options?.maxCache ?? 100 });\n this._TXTcache = new QuickLRU({ maxSize: options?.maxCache ?? 100 });\n this._servers = [\n 'https://cloudflare-dns.com/dns-query',\n 'https://dns.google/resolve'\n ];\n this._request = options.request ?? utils.request;\n this._abortControllers = [];\n }\n /**\n * Cancel all outstanding DNS queries made by this resolver. Any outstanding\n * requests will be aborted and promises rejected.\n */\n cancel() {\n this._abortControllers.forEach(controller => { controller.abort(); });\n }\n /**\n * Get an array of the IP addresses currently configured for DNS resolution.\n * These addresses are formatted according to RFC 5952. It can include a custom port.\n */\n getServers() {\n return this._servers;\n }\n /**\n * Get a shuffled array of the IP addresses currently configured for DNS resolution.\n * These addresses are formatted according to RFC 5952. It can include a custom port.\n */\n _getShuffledServers() {\n const newServers = [...this._servers];\n for (let i = newServers.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * i);\n const temp = newServers[i];\n newServers[i] = newServers[j];\n newServers[j] = temp;\n }\n return newServers;\n }\n /**\n * Sets the IP address and port of servers to be used when performing DNS resolution.\n *\n * @param {string[]} servers - array of RFC 5952 formatted addresses.\n */\n setServers(servers) {\n this._servers = servers;\n }\n async resolve(hostname, rrType = 'A') {\n switch (rrType) {\n case 'A':\n return this.resolve4(hostname);\n case 'AAAA':\n return this.resolve6(hostname);\n case 'TXT':\n return this.resolveTxt(hostname);\n default:\n throw new Error(`${rrType} is not supported`);\n }\n }\n /**\n * Uses the DNS protocol to resolve the given host name into IPv4 addresses\n *\n * @param {string} hostname - host name to resolve\n */\n async resolve4(hostname) {\n const recordType = 'A';\n const cached = this._cache.get(utils.getCacheKey(hostname, recordType));\n if (cached != null) {\n return cached;\n }\n let aborted = false;\n for (const server of this._getShuffledServers()) {\n const controller = new AbortController();\n this._abortControllers.push(controller);\n try {\n const response = await this._request(utils.buildResource(server, hostname, recordType), controller.signal);\n const data = response.Answer.map(a => a.data);\n const ttl = Math.min(...response.Answer.map(a => a.TTL));\n this._cache.set(utils.getCacheKey(hostname, recordType), data, { maxAge: ttl });\n return data;\n }\n catch (err) {\n if (controller.signal.aborted) {\n aborted = true;\n }\n log.error(`${server} could not resolve ${hostname} record ${recordType}`);\n }\n finally {\n this._abortControllers = this._abortControllers.filter(c => c !== controller);\n }\n }\n if (aborted) {\n throw Object.assign(new Error('queryA ECANCELLED'), {\n code: 'ECANCELLED'\n });\n }\n throw new Error(`Could not resolve ${hostname} record ${recordType}`);\n }\n /**\n * Uses the DNS protocol to resolve the given host name into IPv6 addresses\n *\n * @param {string} hostname - host name to resolve\n */\n async resolve6(hostname) {\n const recordType = 'AAAA';\n const cached = this._cache.get(utils.getCacheKey(hostname, recordType));\n if (cached != null) {\n return cached;\n }\n let aborted = false;\n for (const server of this._getShuffledServers()) {\n const controller = new AbortController();\n this._abortControllers.push(controller);\n try {\n const response = await this._request(utils.buildResource(server, hostname, recordType), controller.signal);\n const data = response.Answer.map(a => a.data);\n const ttl = Math.min(...response.Answer.map(a => a.TTL));\n this._cache.set(utils.getCacheKey(hostname, recordType), data, { maxAge: ttl });\n return data;\n }\n catch (err) {\n if (controller.signal.aborted) {\n aborted = true;\n }\n log.error(`${server} could not resolve ${hostname} record ${recordType}`);\n }\n finally {\n this._abortControllers = this._abortControllers.filter(c => c !== controller);\n }\n }\n if (aborted) {\n throw Object.assign(new Error('queryAaaa ECANCELLED'), {\n code: 'ECANCELLED'\n });\n }\n throw new Error(`Could not resolve ${hostname} record ${recordType}`);\n }\n /**\n * Uses the DNS protocol to resolve the given host name into a Text record\n *\n * @param {string} hostname - host name to resolve\n */\n async resolveTxt(hostname) {\n const recordType = 'TXT';\n const cached = this._TXTcache.get(utils.getCacheKey(hostname, recordType));\n if (cached != null) {\n return cached;\n }\n let aborted = false;\n for (const server of this._getShuffledServers()) {\n const controller = new AbortController();\n this._abortControllers.push(controller);\n try {\n const response = await this._request(utils.buildResource(server, hostname, recordType), controller.signal);\n const data = response.Answer.map(a => [a.data.replace(/['\"]+/g, '')]);\n const ttl = Math.min(...response.Answer.map(a => a.TTL));\n this._TXTcache.set(utils.getCacheKey(hostname, recordType), data, { maxAge: ttl });\n return data;\n }\n catch (err) {\n if (controller.signal.aborted) {\n aborted = true;\n }\n log.error(`${server} could not resolve ${hostname} record ${recordType}`);\n }\n finally {\n this._abortControllers = this._abortControllers.filter(c => c !== controller);\n }\n }\n if (aborted) {\n throw Object.assign(new Error('queryTxt ECANCELLED'), {\n code: 'ECANCELLED'\n });\n }\n throw new Error(`Could not resolve ${hostname} record ${recordType}`);\n }\n clearCache() {\n this._cache.clear();\n this._TXTcache.clear();\n }\n}\nexport default Resolver;\n//# sourceMappingURL=index.js.map","import { Logger } from \"@waku/utils\";\nimport { bytesToUtf8 } from \"@waku/utils/bytes\";\nimport DnsOverHttpResolver from \"dns-over-http-resolver\";\nconst log = new Logger(\"dns-over-https\");\nexport class DnsOverHttps {\n resolver;\n /**\n * Create new Dns-Over-Http DNS client.\n *\n * @throws {code: string} If DNS query fails.\n */\n static async create() {\n return new DnsOverHttps();\n }\n constructor(resolver = new DnsOverHttpResolver()) {\n this.resolver = resolver;\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 answers = await this.resolver.resolveTxt(domain);\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 result = [];\n answers.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 { 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","export function selectOpenConnection(connections) {\n return connections\n .filter((c) => c.status === \"open\")\n .sort((left, right) => right.timeline.open - left.timeline.open)\n .at(0);\n}\n//# sourceMappingURL=utils.js.map","import { Logger } from \"@waku/utils\";\nimport { selectOpenConnection } from \"./utils.js\";\nconst STREAM_LOCK_KEY = \"consumed\";\nexport class StreamManager {\n multicodec;\n getConnections;\n addEventListener;\n log;\n ongoingCreation = new Set();\n streamPool = new Map();\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.addEventListener(\"peer:update\", this.handlePeerUpdateStreamPool);\n }\n async getStream(peerId) {\n const peerIdStr = peerId.toString();\n const scheduledStream = this.streamPool.get(peerIdStr);\n if (scheduledStream) {\n this.streamPool.delete(peerIdStr);\n await scheduledStream;\n }\n let stream = this.getOpenStreamForCodec(peerId);\n if (stream) {\n this.log.info(`Found existing stream peerId=${peerIdStr} multicodec=${this.multicodec}`);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n stream = await this.createStream(peerId);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n async createStream(peerId, retries = 0) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n throw new Error(`Failed to get a connection to the peer peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n }\n let lastError;\n let stream;\n for (let i = 0; i < retries + 1; i++) {\n try {\n this.log.info(`Attempting to create a stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n stream = await connection.newStream(this.multicodec);\n this.log.info(`Created stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n break;\n }\n catch (error) {\n lastError = error;\n }\n }\n if (!stream) {\n throw new Error(`Failed to create a new stream for ${peerId.toString()} -- ` + lastError);\n }\n return stream;\n }\n async createStreamWithLock(peer) {\n const peerId = peer.id.toString();\n if (this.ongoingCreation.has(peerId)) {\n this.log.info(`Skipping creation of a stream due to lock for peerId=${peerId} multicodec=${this.multicodec}`);\n return;\n }\n try {\n this.ongoingCreation.add(peerId);\n await this.createStream(peer.id);\n }\n catch (error) {\n this.log.error(`Failed to createStreamWithLock:`, error);\n }\n finally {\n this.ongoingCreation.delete(peerId);\n }\n return;\n }\n handlePeerUpdateStreamPool = (evt) => {\n const { peer } = evt.detail;\n if (!peer.protocols.includes(this.multicodec)) {\n return;\n }\n const stream = this.getOpenStreamForCodec(peer.id);\n if (stream) {\n return;\n }\n this.scheduleNewStream(peer);\n };\n scheduleNewStream(peer) {\n this.log.info(`Scheduling creation of a stream for peerId=${peer.id.toString()} multicodec=${this.multicodec}`);\n // abandon previous attempt\n if (this.streamPool.has(peer.id.toString())) {\n this.streamPool.delete(peer.id.toString());\n }\n this.streamPool.set(peer.id.toString(), this.createStreamWithLock(peer));\n }\n getOpenStreamForCodec(peerId) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n return;\n }\n const stream = connection.streams.find((s) => s.protocol === this.multicodec);\n if (!stream) {\n return;\n }\n const isStreamUnusable = [\"done\", \"closed\", \"closing\"].includes(stream.writeStatus || \"\");\n if (isStreamUnusable || this.isStreamLocked(stream)) {\n return;\n }\n return stream;\n }\n lockStream(peerId, stream) {\n this.log.info(`Locking stream for peerId:${peerId}\\tstreamId:${stream.id}`);\n stream.metadata[STREAM_LOCK_KEY] = true;\n }\n isStreamLocked(stream) {\n return !!stream.metadata[STREAM_LOCK_KEY];\n }\n}\n//# sourceMappingURL=stream_manager.js.map","import { 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 pubsubTopics;\n addLibp2pEventListener;\n removeLibp2pEventListener;\n streamManager;\n constructor(multicodec, components, pubsubTopics) {\n this.multicodec = multicodec;\n this.components = components;\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(peerId) {\n return this.streamManager.getStream(peerId);\n }\n}\n//# sourceMappingURL=base_protocol.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, 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.components.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(peerId);\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 { 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 { peerIdFromString } from \"@libp2p/peer-id\";\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 = peerIdFromString(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 { isTestEnvironment } from \"../env.js\";\nimport { defaultPeerDiscoveries } from \"./discovery.js\";\nconst log = new Logger(\"sdk:create\");\nconst DefaultUserAgent = \"js-waku\";\nconst DefaultPingMaxInboundStreams = 10;\nexport async function defaultLibp2p(pubsubTopics, options, userAgent) {\n if (!options?.hideWebSocketInfo && !isTestEnvironment()) {\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 || isTestEnvironment()\n ? filterAll\n : wss;\n return createLibp2p({\n transports: [webSockets({ filter: filter })],\n streamMuxers: [mplex()],\n connectionEncrypters: [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 { generateKeyPair } from '@libp2p/crypto/keys';\nimport { peerIdFromPrivateKey } from '@libp2p/peer-id';\nimport { validateConfig } from './config.js';\nimport { Libp2p as Libp2pClass } 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 * connectionEncrypters: [noise()]\n * }\n *\n * // create libp2p\n * const libp2p = await createLibp2p(options)\n * ```\n */\nexport async function createLibp2p(options = {}) {\n options.privateKey ??= await generateKeyPair('Ed25519');\n const node = new Libp2pClass({\n ...await validateConfig(options),\n peerId: peerIdFromPrivateKey(options.privateKey)\n });\n if (options.start !== false) {\n await node.start();\n }\n return node;\n}\n//# sourceMappingURL=index.js.map","import { WakuNode } from \"../waku/index.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 const node = new WakuNode(pubsubTopics, options, libp2p, {\n store: true,\n lightpush: true,\n filter: true\n });\n // only if `false` is passed explicitly\n if (options?.autoStart !== false) {\n await node.start();\n }\n return node;\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\"]];\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 = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"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 sha256 = 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 = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"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, } from \"@waku/sdk\";\nimport { generateKeyPairFromSeed } from \"@libp2p/crypto/keys\";\nimport { fromString } from \"uint8arrays\";\nimport { Type, Field } from \"protobufjs\";\nimport { generateRandomNumber, sha256, } from \"./util\";\nvar DEFAULT_CONTENT_TOPIC = \"/js-waku-examples/1/message-ratio/utf8\";\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 messageReceivedEvent = new CustomEvent(\"messageReceived\");\nfunction wakuNode() {\n return __awaiter(this, void 0, void 0, function () {\n var seed, privateKey, node;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n seed = localStorage.getItem(\"seed\");\n if (!!seed) return [3 /*break*/, 2];\n return [4 /*yield*/, sha256(generateRandomNumber())];\n case 1:\n seed = (_a.sent()).slice(0, 32);\n localStorage.setItem(\"seed\", seed);\n _a.label = 2;\n case 2: return [4 /*yield*/, generateKeyPairFromSeed(\"Ed25519\", fromString(seed))];\n case 3:\n privateKey = _a.sent();\n return [4 /*yield*/, createLightNode({\n defaultBootstrap: false,\n numPeersToUse: 2,\n networkConfig: {\n clusterId: 42,\n shards: [0]\n },\n libp2p: {\n privateKey: privateKey,\n },\n })];\n case 4:\n node = _a.sent();\n window.waku = node;\n return [4 /*yield*/, node.dial(\"/dns4/waku-test.bloxy.one/tcp/8095/wss/p2p/16Uiu2HAmSZbDB7CusdRhgkD81VssRjQV5ZH13FbzCGcdnbbh6VwZ\")];\n case 5:\n _a.sent();\n return [4 /*yield*/, node.dial(\"/dns4/vps-aaa00d52.vps.ovh.ca/tcp/8000/wss/p2p/16Uiu2HAm9PftGgHZwWE3wzdMde4m3kT2eYJFXLZfGoSED3gysofk\")];\n case 6:\n _a.sent();\n return [4 /*yield*/, node.dial(\"/dns4/waku.fryorcraken.xyz/tcp/8000/wss/p2p/16Uiu2HAmMRvhDHrtiHft1FTUYnn6cVA8AWVrTyLUayJJ3MWpUZDB\")];\n case 7:\n _a.sent();\n return [2 /*return*/, node];\n }\n });\n });\n}\nexport function app() {\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 console.log(\"DEBUG: your peer ID is:\", node.libp2p.peerId.toString());\n return [4 /*yield*/, node.start()];\n case 2:\n _a.sent();\n return [4 /*yield*/, node.waitForPeers()];\n case 3:\n _a.sent();\n peerId = node.libp2p.peerId.toString();\n encoder = node.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*/, sha256(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 messageHash, timestamp, message, payload, result, error_1;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n _a.trys.push([0, 3, , 4]);\n return [4 /*yield*/, sha256(\"\".concat(sequenceHash, \"-\").concat(sequenceIndex, \"-\").concat(sequenceTotal))];\n case 1:\n messageHash = _a.sent();\n timestamp = Math.floor(new Date().getTime() / 1000);\n message = ProtoSequencedMessage.create({\n hash: messageHash,\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 }, { autoRetry: true })];\n case 2:\n result = _a.sent();\n console.log(\"DEBUG: light push successes: \", result.successes.length);\n console.log(\"DEBUG: light push failures: \", result.failures.length);\n // Increment sequence\n sequenceIndex++;\n if (sequenceIndex < sequenceTotal) {\n setTimeout(sendMessage, period); // Schedule the next send\n }\n else {\n document.dispatchEvent(sequenceCompletedEvent);\n }\n return [3 /*break*/, 4];\n case 3:\n error_1 = _a.sent();\n console.error(\"DEBUG: Error sending message\", error_1);\n return [3 /*break*/, 4];\n case 4: 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, subscriptionCallback;\n var _this = this;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n decoder = node.createDecoder({ contentTopic: DEFAULT_CONTENT_TOPIC });\n subscriptionCallback = function (message) { return __awaiter(_this, void 0, void 0, function () {\n var decodedMessage, messageElement;\n return __generator(this, function (_a) {\n decodedMessage = ProtoSequencedMessage.decode(message.payload);\n if (decodedMessage.sender === peerId) {\n return [2 /*return*/];\n }\n messageElement = document.createElement(\"div\");\n messageElement.textContent = \"Message: \".concat(decodedMessage.hash);\n document.dispatchEvent(messageReceivedEvent);\n return [2 /*return*/];\n });\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 var _a, startLightPushSequence, startFilterSubscription;\n return __generator(this, function (_b) {\n switch (_b.label) {\n case 0: return [4 /*yield*/, app()];\n case 1:\n _a = _b.sent(), startLightPushSequence = _a.startLightPushSequence, startFilterSubscription = _a.startFilterSubscription;\n startFilterSubscription();\n document.addEventListener(sequenceCompletedEvent.type, function () {\n return startLightPushSequence(10, 3000);\n });\n startLightPushSequence(10, 3000);\n return [2 /*return*/];\n }\n });\n}); })();\n"],"names":["module","exports","max","Error","size","cache","Object","create","_cache","update","key","value","has","undefined","remove","get","v","set","clear","prototype","hasOwnProperty","prefix","Events","EE","fn","context","once","this","addListener","emitter","event","TypeError","listener","evt","_events","push","_eventsCount","clearEvent","EventEmitter","__proto__","eventNames","events","name","names","call","slice","getOwnPropertySymbols","concat","listeners","handlers","i","l","length","ee","Array","listenerCount","emit","a1","a2","a3","a4","a5","args","len","arguments","removeListener","apply","j","on","removeAllListeners","off","prefixed","types","util","s","bake","values","offset","o","basic","defaults","emptyArray","long","mapKey","packed","mtype","gen","codegen","seenFirstField","oneofsArray","fieldsArray","field","_fieldsArray","resolve","ref","safeProp","optional","map","invalid","genVerifyKey","genVerifyValue","repeated","partOf","oneofProp","Enum","expected","keyType","fieldIndex","resolvedType","keys","type","tokenize","delimRe","stringDoubleRe","stringSingleRe","setCommentRe","setCommentAltRe","setCommentSplitRe","whitespaceRe","unescapeRe","unescapeMap","unescape","str","replace","$0","$1","source","alternateCommentMode","toString","line","lastCommentLine","comments","stack","stringDelim","illegal","subject","charAt","pos","setComment","start","end","isLeading","c","comment","lineEmpty","leading","commentOffset","lines","substring","split","trim","text","join","isDoubleSlashCommentLine","startOffset","endOffset","findEndOfLine","lineText","test","cursor","next","shift","re","lastIndex","match","exec","readString","repeat","prev","curr","isDoc","isLeadingComment","Math","min","token","peek","defineProperty","skip","actual","cmnt","trailingLine","ret","event_iterator_1","EventIterator","env","createDebug","namespace","prevTime","namespacesCache","enabledCache","enableOverride","debug","enabled","self","Number","Date","ms","diff","coerce","unshift","index","format","formatter","formatters","val","splice","formatArgs","log","useColors","color","selectColor","extend","destroy","enumerable","configurable","namespaces","init","delimiter","newDebug","matchesTemplate","search","template","searchIndex","templateIndex","starIndex","matchIndex","default","message","disable","skips","enable","save","filter","Boolean","ns","humanize","console","warn","forEach","hash","charCodeAt","colors","abs","load","converter","genValuePartial_fromObject","prop","defaultAlreadyEmitted","typeDefault","fullName","isUnsigned","genValuePartial_toObject","fromObject","fields","toObject","sort","compareFieldsById","repeatedFields","mapFields","normalFields","valuesById","low","high","unsigned","toNumber","bytes","arrayDefault","String","fromCharCode","hasKs2","indexOf","BufferWriter","Writer","constructor","writeStringBuffer","buf","utf8","write","utf8Write","_configure","alloc","_Buffer_allocUnsafe","writeBytesBuffer","Buffer","Uint8Array","copy","isString","_Buffer_from","uint32","_push","string","byteLength","wireType","id","genTypePartial","delimited","INPUT_ERROR","WINDOW","window","root","JS_SHA3_NO_WINDOW","WEB_WORKER","JS_SHA3_NO_NODE_JS","process","versions","node","global","COMMON_JS","JS_SHA3_NO_COMMON_JS","AMD","ARRAY_BUFFER","JS_SHA3_NO_ARRAY_BUFFER","ArrayBuffer","HEX_CHARS","CSHAKE_PADDING","SHIFT","RC","BITS","SHAKE_BITS","OUTPUT_TYPES","CSHAKE_BYTEPAD","isArray","obj","isView","JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW","buffer","formatMessage","empty","cloneArray","array","newArray","createOutputMethod","bits","padding","outputType","Keccak","createShakeOutputMethod","outputBits","createCshakeOutputMethod","n","methods","createKmacOutputMethod","createOutputMethods","method","createMethod","algorithms","w","bytepad","Kmac","methodNames","algorithm","methodName","newMethodName","blocks","reset","finalized","block","blockCount","byteCount","outputBlocks","extraBytes","result","code","lastByteIndex","f","encode","x","right","encodeString","strs","paddingBytes","zeros","finalize","hex","arrayBuffer","Uint32Array","digest","h","c0","c1","c2","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","Field","ReflectionObject","className","Type","ruleRe","rule","options","isObject","isInteger","toLowerCase","defaultValue","Long","extensionField","declaringField","fromJSON","json","edition","_edition","_defaultEdition","_features","field_presence","required","message_encoding","repeated_field_encoding","setOption","ifNotSet","toJSON","toJSONOptions","keepComments","_editionToJSON","resolved","parent","lookupTypeOrEnum","proto3_optional","fromNumber","freeze","base64","decode","newBuffer","emptyObject","ctor","_inferLegacyProtoFeatures","features","group","getOption","_resolveFeatures","d","fieldId","fieldType","fieldRule","decorateType","decorateEnum","fieldName","add","Type_","read","t","parts","chunk","OneOf","fieldNames","oneof","addFieldsToParent","onAdd","onRemove","oneofName","oneOfGetter","oneOfSetter","LongBits","lo","hi","zero","zzEncode","zzDecode","zeroHash","sign","from","parseInt","fromString","toLong","fromHash","toHash","mask","part0","part1","part2","Message","properties","$type","writer","encodeDelimited","reader","decodeDelimited","verify","object","BufferReader","Reader","_slice","utf8Slice","roots","fetch","path","fs","inquire","toArray","safePropBackslashRe","safePropQuoteRe","isReserved","ucFirst","toUpperCase","camelCaseRe","camelCase","a","b","typeName","decorateRoot","decorateEnumIndex","enm","setProperty","dst","setProp","part","prevValue","Op","noop","State","head","tail","states","writeByte","VarintOp","writeVarint64","writeFixed32","pool","subarray","int32","sint32","uint64","int64","sint64","bool","fixed32","sfixed32","fixed64","sfixed64","float","writeFloatLE","double","writeDoubleLE","writeBytes","fork","ldelim","finish","BufferWriter_","merge","src","newError","CustomError","captureStackTrace","writable","asPromise","isNode","isFinite","floor","isset","isSet","e","sizeOrArray","dcodeIO","key2Re","key32Re","key64Re","longToHash","longFromHash","fromBits","lcFirst","ProtocolError","fieldMap","longs","enums","encoding","allocUnsafe","RetryOperation","timeouts","forever","_originalTimeouts","JSON","parse","stringify","_timeouts","_options","_maxRetryTime","maxRetryTime","Infinity","_fn","_errors","_attempts","_operationTimeout","_operationTimeoutCb","_timeout","_operationStart","_timer","_cachedTimeouts","stop","clearTimeout","retry","err","currentTime","getTime","timeout","setTimeout","unref","attempt","timeoutOps","cb","try","errors","attempts","mainError","counts","mainErrorCount","error","count","moduleName","mod","eval","_listeners","ctx","protobuf","configure","build","rpc","filename","keepCase","Root","MapField","Service","Method","base10Re","base10NegRe","base16Re","base16NegRe","base8Re","base8NegRe","numberRe","nameRe","typeRefRe","pkg","imports","weakImports","preferTrailingComment","tn","ptr","topLevelObjects","topLevelOptions","applyCase","insideTryCatch","readValue","acceptTypeRef","NaN","parseFloat","parseNumber","readRanges","target","acceptStrings","parseId","dummy","ifBlock","parseOption","parseInlineOptions","acceptNegative","parsePackage","define","parseImport","whichImports","parseSyntax","parseEdition","includes","parseCommon","parseType","parseEnum","service","commentText","requestType","requestStream","responseType","responseStream","parseMethod","parseService","reference","parseField","parseExtension","fnIf","fnElse","valueType","parseMapField","parseOneOf","extensions","reserved","endsWith","startsWith","parseGroup","parsedOptions","parseEnumValue","option","propName","isOption","parensValue","tokens","optionValue","parseOptionValue","setParsedOption","objectResult","lastValue","simpleValue","opt","common","timeType","commonRe","nested","google","Any","type_url","Duration","seconds","nanos","Timestamp","Empty","Struct","Value","oneofs","kind","nullValue","numberValue","stringValue","boolValue","structValue","listValue","NullValue","NULL_VALUE","ListValue","DoubleValue","FloatValue","Int64Value","UInt64Value","Int32Value","UInt32Value","BoolValue","StringValue","BytesValue","FieldMask","paths","file","callback","xhr","readFile","contents","XMLHttpRequest","binary","onreadystatechange","readyState","status","response","responseText","overrideMimeType","open","send","loadSync","encoder","decoder","verifier","Namespace","wrappers","deferred","files","SYNC","setOptions","addJSON","resolveAll","resolvePath","sync","getBundledFileName","idx","lastIndexOf","altname","parsed","queued","weak","readFileSync","exposeRe","tryHandleExtension","extendedType","lookup","sisterField","_handleAdd","nestedArray","_nestedArray","_handleRemove","parse_","common_","Netmask","atob","chr","chr0","chrA","chra","ip2long","long2ip","ip","base","dmax","net","maskLong","error1","bitmask","netLong","pow","hostmask","first","last","broadcast","contains","lastLong","valuesOptions","_valuesFeatures","parentFeaturesCopy","assign","isReservedId","isReservedName","allow_alias","HI_BASE32_NO_NODE_JS","HI_BASE32_NO_COMMON_JS","BASE32_ENCODE_CHAR","BASE32_DECODE_CHAR","throwInvalidUtf8","position","partial","substr","decodeAsBytes","base32Str","v1","v2","v3","v4","v5","v6","v7","v8","remain","asciiOnly","followingChars","toUtf8String","input","notString","encodeBytes","encodeAscii","encodeUtf8","asBytes","base32","indexOutOfRange","writeLength","RangeError","create_array","isBuffer","readLongVarint","readFixed32_end","readFixed64","readFloatLE","readDoubleLE","nativeBuffer","skipType","BufferReader_","getPrototypeOf","m","plural","msAbs","isPlural","round","fmtShort","isOptionObject","propertyIsEnumerable","globalThis","defaultMergeOptions","concatArrays","ignoreUndefined","getEnumerableOwnPropertyKeys","symbols","symbol","clone","cloneOptionObject","mergeKeys","merged","config","resultIndex","indices","k","_","editions2023Defaults","enum_type","json_format","utf8_validation","proto2Defaults","proto3Defaults","defineProperties","_resolveFeaturesRecursive","protoFeatures","lexicalParentFeaturesCopy","find","newValue","newOpt","Root_","rpcImpl","requestDelimited","responseDelimited","rpcCall","requestCtor","responseCtor","request","endedByRPC","rfield","missing","lastC","storage","setItem","removeItem","r","getItem","DEBUG","__nwjs","navigator","userAgent","document","documentElement","style","WebkitAppearance","firebug","exception","table","localStorage","localstorage","warned","_fieldsById","_oneofsArray","_ctor","clearCache","fieldsById","generateConstructor","ctorProperties","inherited","arrayToJSON","setup","wrapper","originalThis","bind","params","pending","Promise","reject","resolvedKeyType","fieldKeyType","fieldValueType","operation","retries","opts","factor","minTimeout","maxTimeout","randomize","createTimeout","random","wrap","original","op","pop","functionParams","functionName","body","Codegen","formatStringOrScope","verbose","scopeKeys","scopeParams","scopeValues","scopeOffset","Function","formatParams","formatOffset","functionNameOverride","resolvedRequestType","resolvedResponseType","lookupType","p","ceil","b64","s64","invalidEncoding","nestedJson","getEnum","filterTypes","parentAlreadyChecked","found","lookupEnum","lookupService","Service_","Enum_","isAbsolute","normalize","absolute","originPath","includePath","alreadyNormalized","SIZE","MAX","slab","factory","Float32Array","f32","f8b","le","writeFloat_f32_cpy","writeFloat_f32_rev","readFloat_f32_cpy","readFloat_f32_rev","writeFloatBE","readFloatBE","writeFloat_ieee754","writeUint","isNaN","exponent","LN2","readFloat_ieee754","readUint","uint","mantissa","writeUintLE","writeUintBE","readUintLE","readUintBE","Float64Array","f64","writeDouble_f64_cpy","writeDouble_f64_rev","readDouble_f64_cpy","readDouble_f64_rev","writeDoubleBE","readDoubleBE","writeDouble_ieee754","off0","off1","readDouble_ieee754","_methodsArray","methodsArray","rpcService","q","EventQueue","pullQueue","pushQueue","eventHandlers","isPaused","isStopped","resolution","done","placeholder","highWaterMark","highWater","fail","rejection","catch","then","removeCallback","Symbol","asyncIterator","lowWaterMark","lowWater","return","listen","queue","__webpack_module_cache__","leafPrototypes","getProto","__webpack_require__","moduleId","cachedModule","__webpack_modules__","amdO","mode","__esModule","def","current","getOwnPropertyNames","definition","toStringTag","N1","N2","N3","N4","N5","N6","N7","MSB","REST","encodingLength","MAX_SAFE_INTEGER","encodeUint8Array","decodeUint8Array","res","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","createReader","byteOffset","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","data","pad","out","codes","written","SyntaxError","base10","base16","base16upper","base2","alphabetBytesToChars","reduce","alphabetCharsToBytes","codePoint","base256emoji","byts","char","byt","base32upper","base32pad","base32padupper","base32hex","base32hexupper","base32hexpad","base32hexpadupper","base32z","base36","base36upper","base58btc","base58flickr","base64pad","base64url","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","remainder","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","SdsMessage","enumeration","findValue","VARINT","enumValue","LENGTH_DELIMITED","MaxLengthError","MaxSizeError","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","messageId","channelId","lamportTimestamp","causalHistory","bloomFilter","content","anumber","isSafeInteger","lengths","ahash","outputLen","blockLen","aexists","instance","checkFinished","destroyed","finished","createView","arr","DataView","rotr","word","toBytes","toHex","fromHex","Hash","_cloneInto","hashCons","hashC","msg","tmp","bytesLength","getRandomValues","randomBytes","Maj","HashMD","padOffset","isLE","view","take","dataView","roundClean","digestInto","aoutput","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","DefaultNetworkConfig","HealthStatusChangeEvents","HealthStatus","bytesToUtf8","byteArrays","totalLength","acc","shardInfoToPubsubTopics","shardInfo","Set","contentTopicToPubsubTopic","application","pubsubTopicToSingleShardInfo","pubsubTopics","shard","pubsubTopicsToShardInfo","shardInfoSet","clusterIds","ensurePubsubTopicIsConfigured","configuredTopics","contentTopicToShardIndex","networkShards","generation","topicName","ensureValidContentTopic","dataview","getBigUint64","determinePubsubTopic","pubsubTopicShardInfo","singleShardInfoToPubsubTopic","decodeRelayShard","getUint16","byteIndex","bitIndex","getUint8","numIndices","encodeRelayShard","setUint16","setUint8","APP_NAME","Logger","_info","_warn","_error","createDebugNamespace","level","logger","OneMillion","DecodedMessage","proto","_rawTimestamp","metaSetter","toWire","toProtoObj","protoMessage","valueOf","createEncoder","fromWireToProtoObj","fromProtoObj","createDecoder","entry","arrays","output","findBufAndOffset","bufs","bufEnd","isUint8ArrayList","Uint8ArrayList","appendAll","iterator","append","prepend","prependAll","reverse","consume","trunc","beginInclusive","endExclusive","_subList","sublist","list","bufStart","sliceStartInBuf","sliceEndsInBuf","needle","M","rightmostPositions","Int32Array","lastPatIndex","getInt8","setInt8","getInt16","littleEndian","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","raceSignal","aborted","errorMessage","errorCode","errorName","QueuelessPushable","readNext","haveNext","nextResult","sources","syncSources","mergeSyncSources","all","item","addAllToPushable","mergeSources","pipe","rest","isDuplex","duplex","isIterable","fns","sink","duplexPipelineFn","rawPipe","stream","sourceWrap","selectOpenConnection","connections","timeline","at","STREAM_LOCK_KEY","StreamManager","multicodec","getConnections","ongoingCreation","streamPool","handlePeerUpdateStreamPool","getStream","peerId","peerIdStr","scheduledStream","delete","getOpenStreamForCodec","lockStream","createStream","connection","lastError","newStream","createStreamWithLock","peer","detail","protocols","scheduleNewStream","streams","protocol","writeStatus","isStreamLocked","metadata","BaseProtocol","components","addLibp2pEventListener","removeLibp2pEventListener","streamManager","connectionManager","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","ping","streamData","remotePeer","createRequest","LightPushCodec","LightPushCore","preparePushMessage","EMPTY_PAYLOAD","isWireSizeUnderCap","isMessageSizeUnderCap","SIZE_TOO_BIG","ENCODE_FAILED","preparationError","STREAM_ABORTED","DECODE_FAILED","RLN_PROOF_GENERATION","EmptyMessage","ONE_MILLION","StoreCodec","StoreCore","queryPerPage","queryOpts","currentCursor","storeQueryRequest","storeQueryResponse","decodedMessages","protoMsg","wire","TypedEventEmitter","EventTarget","dispatchEvent","safeDispatchEvent","CustomEvent","peerIdSymbol","isPeerId","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","parseIPv4","new","parseIPv6","parseIP","mapIPv4ToIPv6","addr","ipv4Prefix","maskIp","allFF","cidrMask","ones","ipOrCidr","network","address","maskString","ipLength","parseCidr","ipResult","maskResult","containsIp","byte","entries","simpleMaskLength","maskToHex","padStart","ipToString","isIPv4","isIPv6","isIP","isV4","isV6","sections","v4Buffer","argv","V","convertToString","ipBuff","ipString","bytes2ip","bytes2str","bytes2port","bytes2mh","addrBytes","portBytes","bytes2onion","bytes2mb","encodeURIComponent","ip2bytes","str2bytes","port2bytes","mh","mh2bytes","port","portBuf","onion2bytes","onion32bytes","mbstr","mb","anybaseDecoder","mb2bytes","decodeURIComponent","row","resolvable","createProtocol","bytesToMultiaddrParts","tuples","stringTuples","sizeForAddr","stringAddr","stringTuplesToString","tup","cleanPath","static","inspect","DNS_CODES","NoAvailableResolverError","Multiaddr","stringToMultiaddrParts","isMultiaddr","toOptions","family","transport","host","zone","tcp","udp","ip4","ip6","dns6","ip6zone","protos","protoCodes","protoNames","encapsulate","decapsulate","addrString","decapsulateCode","getPeerId","p2p","tuple","getPath","resolvableProto","resolver","resolvers","nodeAddress","isThinWaistAddress","KeepAliveManager","relay","pingKeepAliveTimers","relayKeepAliveTimers","pingKeepAlive","pingPeriodSecs","relayKeepAlive","relayPeriodSecs","interval","setInterval","services","peerStore","intervals","scheduleRelayPings","clearInterval","stopAll","timer","connectionsExist","getMeshPeers","getPeerPing","ConnectionManager","keepAliveManager","dialAttemptsForPeer","dialErrorsForPeer","currentActiveParallelDialCount","pendingPeerDialQueue","isP2PNetworkConnected","isConnected","onLine","onEventHandlers","stopNetworkStatusListener","dropConnection","hangUp","getPeersByDiscovery","peersDiscovered","peersConnected","conn","peersDiscoveredByBootstrap","peersDiscoveredByPeerExchange","peersDiscoveredByLocal","peersConnectedByBootstrap","peersConnectedByPeerExchange","peersConnectedByLocal","tags","getTagNamesForPeer","BOOTSTRAP","PEER_EXCHANGE","LOCAL","DISCOVERED","CONNECTED","maxDialAttemptsForPeer","maxBootstrapPeersAllowed","maxParallelDials","startEventListeners","dialPeerStorePeers","getConnectedPeers","peerIDs","getPeers","dialPromises","peerInfo","attemptDial","startPeerDiscoveryListener","startPeerConnectionListener","startPeerDisconnectionListener","startNetworkStatusListener","dialPeer","peerDialInfo","getDialablePeerInfo","dialAttempt","dial","AggregateError","processDialQueue","attemptDnsDiscovery","rawDialPeerWithProtocols","protocolCodecs","dialProtocol","ma","dnsDiscovery","findPeers","shouldDialPeer","dispatchDiscoveryEvent","PEER_CONNECT_BOOTSTRAP","PEER_CONNECT_PEER_EXCHANGE","setP2PNetworkConnected","setP2PNetworkDisconnected","dispatchWakuConnectionEvent","isPeerTopicConfigured","getPeerShardInfo","isPeerDialableBasedOnBootstrapStatus","some","tagName","isBootstrap","PEER_DISCOVERY_BOOTSTRAP","PEER_DISCOVERY_PEER_EXCHANGE","shardInfoBytes","CONNECTION_STATUS","MetadataCodec","Metadata","libp2pComponents","handshakesConfirmed","registrar","NO_PEER_AVAILABLE","encodedResponse","decodeMetadataResponse","savePeerShardInfo","confirmOrAttemptHandshake","encodedShardInfo","wakuMetadata","pubsubTopicBytes","contentTopicBytes","timestampBytes","bigIntTimestamp","numberToBytes","tryConvertTimestampToBytes","SubscriptionMonitor","peerIds","isStarted","peerManager","activeSubscriptions","keepAliveIntervalId","pingFailedAttempts","receivedMessagesFormPeer","receivedMessages","verifiedPeers","onConnectionChange","onPeerConnected","onPeerDisconnected","reservedContentTopic","startKeepAlive","startConnectionListener","stopKeepAlive","stopConnectionListener","stopPeerConnectionListener","notifyMessageReceived","buildMessageHash","messageHashStr","keepAliveIntervalMs","_event","_peerId","requestRenew","renewOnFirstFail","newPeer","pingsBeforePeerRenewed","Subscription","monitor","subscriptionCallbacks","lightPush","decodersArray","failures","TOPIC_DECODER_MISMATCH","successes","enableLightPushFilterCheck","decodersGroupedByCT","promises","results","allSettled","finalResult","handleResult","subscriptionCallback","processIncomingMessage","decodePromises","dec","decoded","decodedMessage","any","pushMessage","promiseResult","reason","coreResult","Filter","subscription","getActiveSubscription","uniquePubsubTopics","getUniquePubsubTopics","INVALID_DECODER_TOPICS","createSubscription","setActiveSubscription","subscribeWithUnsubscribe","toSubscriptionIterator","receiver","iteratorOptions","isWithTimeout","timeoutMs","startTime","now","toAsyncIterator","HealthIndicator","Unhealthy","onPeerChange","toValue","peers","filterPeers","lightPushPeers","SufficientlyHealthy","MinimallyHealthy","StatusChange","RetryManager","intervalID","retryIntervalMs","inProgress","processQueue","maxAttempts","task","scheduleTask","taskExecutor","_err","DEFAULT_SEND_OPTIONS","autoRetry","numPeersToUse","LightPush","retryManager","TOPIC_NOT_CONFIGURED","coreResults","_e","sendCallback","CONNECTION_LOCK_TAG","PeerManager","onConnected","onDisconnected","getLockedConnections","lockedConnections","neededPeers","newPeerId","getUnlockedConnections","lockConnection","lockPeerIfNeeded","isConnectionLocked","Store","queryGenerator","decodersAsMap","validateDecodersAndPubsubTopic","getPeerToUse","responseGenerator","queryWithOrderedCallback","processMessages","queryWithPromiseCallback","abort","page","_promises","msgPromise","processedMessages","createCursor","uniquePubsubTopicsInQuery","pubsubTopicForQuery","decoderParamsToShardInfo","networkConfig","shardsUnderCluster","isShardCompatible","waitForProtocols","waku","Relay","waitForPeers","store","waitForConnectedPeer","metadataService","awaitTimeout","rejectReason","_resolve","WakuNode","health","_nodeStateLock","_nodeStarted","protocolsEnabled","lightpush","getProtocols","_protocols","codecs","gossipSub","multicodecs","mapToPeerIdOrMultiaddr","getEnabledProtocols","connectedPeers","enabledCodes","protocolToCodec","mapProtocolsToCodecs","every","waitForMetadata","rejectOnTimeout","waitForRemotePeer","singleShardInfo","UnexpectedPeerError","InvalidPublicKeyError","InvalidPrivateKeyError","ConnectionClosingError","ConnectionClosedError","ConnectionFailedError","MuxerClosedError","StreamResetError","StreamStateError","NotFoundError","InvalidPeerIdError","InvalidMultiaddrError","InvalidCIDError","InvalidMultihashError","UnsupportedProtocolError","InvalidMessageError","TimeoutError","NotStartedError","DialError","LimitedConnectionError","TooManyInboundProtocolStreamsError","TooManyOutboundProtocolStreamsError","TAG_MASK","LONG_LENGTH_MASK","LONG_LENGTH_BYTES_MASK","readSequence","readLength","vals","unusedBits","finalOffset","val1","val2","oid","number","encodeNumber","encodeInteger","encodeBitString","encodeSequence","ECDSAPublicKey","jwk","_raw","raw","publicKey","getOID","crv","y","toMultihash","publicKeyToProtobuf","toCID","sig","importKey","namedCurve","hashAndVerify","ECDSAPrivateKey","ext","key_ops","kty","privateKey","signature","hashAndSign","OID_256","OID_384","OID_521","P_256_KEY_JWK","P_384_KEY_JWK","P_521_KEY_JWK","unmarshalECDSAPublicKey","pkiMessageToECDSAPublicKey","coordinates","curve","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","abool","title","numberToHexUnpadded","hexToNumber","ch","hl","al","ai","n1","n2","expectedLength","sum","isPosBig","u8n","u8fr","validatorFns","bigint","function","boolean","stringOrUint8Array","Fp","isValid","validateObject","validators","optValidators","checkField","isOptional","checkVal","memoized","arg","computed","_2n","_3n","_4n","_5n","_8n","power","modulo","pow2","invert","u","FIELD_FIELDS","nLength","nBitLength","_nBitLength","nByteLength","ORDER","bitLen","redef","BYTES","sqrtP","MASK","ZERO","ONE","is0","isOdd","neg","eql","lhs","rhs","sqr","sub","mul","FpPow","div","sqrN","addN","subN","mulN","inv","sqrt","P","p1div4","nv","legendreC","Q","S","Z","Q1div2","g","t2","ge","tonelliShanks","FpSqrt","invertBatch","nums","lastMultiplied","inverted","reduceRight","FpInvertBatch","cmov","fromBytes","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","constTimeNegate","condition","negate","validateW","W","calcWOpts","scalarBits","maxNumber","windows","windowSize","shiftBy","calcOffsets","wOpts","wbits","nextN","offsetStart","isZero","isNeg","isNegF","offsetF","pointPrecomputes","pointWindowSizes","getW","wNAF","hasPrecomputes","elm","unsafeLadder","precomputeWindow","points","precomputes","wo","wNAFUnsafe","getPrecomputes","transform","comp","wNAFCached","wNAFCachedUnsafe","setWindowSize","fieldN","scalars","validateMSMPoints","validateMSMScalars","buckets","scalar","resI","sumI","validateBasic","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","ed25519","curveDef","CURVE","domain","mapToCurve","validateOpts","prehash","cHash","cofactor","modP","Fn","phflag","aCoordinate","banZero","aextpoint","Point","toAffineMemo","iz","ex","ey","ez","z","ax","ay","zz","assertValidMemo","X","Y","et","T","X2","Y2","Z2","Z4","aX2","toAffine","fromAffine","normalizeZ","toInv","msm","_setWindowSize","wnaf","assertValidity","X1","Y1","Z1","X1Z2","X2Z1","Y1Z2","Y2Z1","x1y1","X3","Y3","T3","Z3","subtract","multiply","CURVE_ORDER","multiplyUnsafe","I","isSmallOrder","isTorsionFree","clearCofactor","normed","lastByte","y2","isXOdd","isLastByteOdd","fromPrivateKey","privKey","getPrivateScalar","toRawBytes","modN","modN_LE","hashed","getExtendedPublicKey","point","pointBytes","hashDomainToScalar","msgs","verifyOpts","getPublicKey","R","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","montgomery","concatKeys","privateKeyRaw","Ed25519PublicKey","ensureEd25519Key","Ed25519PrivateKey","unmarshalEd25519PublicKey","KeyType","__KeyTypeValues","PublicKey","PrivateKey","Data","SigningError","VerificationError","WebCryptoMissingError","win","nativeCrypto","RSAPublicKey","_multihash","webcrypto","RSAPrivateKey","dp","dq","qi","RSA_ALGORITHM_IDENTIFIER","jwkToPkix","pkixMessageToRSAPublicKey","pkixMessageToJwk","RSA","HMAC","_key","iHash","oHash","hmac","validateSigVerOpts","lowS","DERErr","DER","Err","_tlv","dataLen","lenLen","lengthBytes","_int","toSig","tlv","seqBytes","seqLeftBytes","rBytes","rLeftBytes","sBytes","sLeftBytes","hexFromSig","seq","weierstrass","bits2int","bits2int_modN","compressedLen","uncompressedLen","invN","ProjectivePoint","normPrivateKeyToScalar","weierstrassEquation","isWithinCurveOrder","allowedPrivateKeyLengths","wrapPrivateKey","allowInfinityPoint","endo","beta","splitScalar","validatePointOpts","_c","_isCompressed","x2","x3","N","aprjpoint","px","py","pz","hasEvenY","U1","U2","t0","t1","t3","t4","t5","sc","k1neg","k1","k2neg","k2","k1p","k2p","fake","f1p","f2p","multiplyAndAddUnsafe","isCompressed","_bits","weierstrassPoints","cat","sqrtError","suffix","numToNByteHex","isBiggerThanHalfOrder","slcNum","Signature","recovery","fromCompact","fromDER","addRecoveryBit","recoverPublicKey","msgHash","rec","radj","ir","u1","u2","hasHighS","normalizeS","toDERRawBytes","toDERHex","toCompactRawBytes","toCompactHex","isValidPrivateKey","minLen","reduced","mapHashToField","isProbPub","delta","ORDER_MASK","int2octets","defaultSigOpts","defaultVerOpts","privateA","publicB","seed","k2sig","extraEntropy","ent","h1int","seedArgs","kBytes","ik","normS","prepSig","drbg","hashLen","qByteLen","hmacFn","reseed","sl","pred","createHmacDrbg","sg","isHex","isObj","_sig","derError","is","getHash","secp256k1P","secp256k1N","divNearest","Fpk1","_6n","_11n","_22n","_23n","_44n","_88n","b88","b176","b220","b223","secp256k1","defHash","createCurve","POW_2_128","isPromise","finally","Secp256k1PublicKey","validateSecp256k1PublicKey","compressSecp256k1PublicKey","Secp256k1PrivateKey","validateSecp256k1PrivateKey","computeSecp256k1PublicKey","unmarshalSecp256k1PublicKey","generateKeyPair","generateEd25519KeyPair","privateKeyBytes","generateSecp256k1KeyPair","pair","generateKey","modulusLength","publicExponent","exportKey","generateRSAKey","generateRSAKeyPair","toBits","keyPair","generateECDSAKey","generateECDSAKeyPair","toCurve","generateKeyPairFromSeed","generateEd25519KeyPairFromSeed","publicKeyFromProtobuf","pkixToRSAPublicKey","Ed25519","ECDSA","serviceCapabilities","serviceDependencies","PeerIdImpl","RSAPeerId","Ed25519PeerId","Secp256k1PeerId","URLPeerId","url","peerIdFromString","peerIdFromCID","peerIdFromMultihash","peerIdFromPublicKey","isSha256Multihash","isIdentityMultihash","publicKeyFromMultihash","URL","byteStream","readBuffer","abortPromise","unwrap","originalStream","yieldBytes","lpStream","decodeLength","lengthBuffer","writeV","flatMap","piped","NOISE_MSG_MAX_LENGTH_BYTES","DUMP_SESSION_KEYS","exists","copyBytes","wrapCipher","clean","_utf8ToBytes","sigma16","sigma32","sigma16_32","sigma32_32","MAX_COUNTER","U32_EMPTY","createCipher","core","allowShortKeys","extendNonceFn","counterLength","counterRight","rounds","nonce","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","h1","h2","h3","h4","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","encrypt","plaintext","plength","clength","decrypt","ciphertext","passedTag","chacha20poly1305","blockSize","nonceLength","tagLength","HKDF_COUNTER","EMPTY_BUFFER","defaultCrypto","hashSHA256","getHKDF","ck","ikm","prk","salt","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","signaturePayload","webtransportCerthashes","Noise","staticKey","metrics","staticNoiseKey","prologueBytes","_crypto","keypair","wrapCrypto","xxHandshakeSuccesses","registerCounter","help","xxHandshakeErrors","encryptedPackets","decryptedPackets","decryptErrors","registerMetrics","secureOutbound","wrappedConnection","handshake","performHandshakeInitiator","createSecureConnection","remoteExtensions","secureInbound","performHandshakeResponder","xx","trace","receivedPayload","forComponent","secure","user","duplexPair","encryptStream","encrypted","decryptStream","noise","peerDiscoverySymbol","DNS4","DNS6","DNSADDR","IP","TCP","and","UDP","UTP","QUIC","QUICV1","_WebSockets","_WebSocketsSecure","HTTP","HTTPS","_WebRTCDirect","WebRTCDirect","_WebTransport","WebTransport","P2PWebRTCStar","P2PWebRTCDirect","Reliable","_P2P","_Circuit","CircuitRecursive","Circuit","P2P","makeMatchesFunction","partialMatch","matches","pnames","Bootstrap","_init","candidate","peerData","multiaddrs","_discoverBootstrapPeers","tagValue","ttl","tagTTL","openConnection","ENVELOPE_PAYLOAD_TYPE_PEER_RECORD","Envelope","PeerRecord","AddressInfo","multiaddr","addresses","addresses$","peerRecord","seqNumber","DOMAIN","CODEC","marshaled","marshal","localeCompare","arrayEquals","payloadType","InvalidSignatureError","RecordEnvelope","envelopeData","record","signData","formatSignaturePayload","envelope","createFromProtobuf","validate","domainUint8Array","domainLength","payloadTypeLength","payloadLength","NETMASK_RANGES","ipRange","ipv4Check","ipAddr","isPrivateIp","octet34","octet12","ipv4MappedIpv6Check","ipv4EmbeddedIpv6Check","ipv6Check","isPrivate","isIpBased","func","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","defaultValues","AbstractIdentify","started","addressManager","maxOutboundStreams","maxMessageSize","maxObservedAddresses","runOnLimitedConnection","nodeInfo","protocolPrefix","AgentVersion","ProtocolVersion","handleProtocol","unhandle","runOnConnectionOpen","identify","_identify","AbortSignal","close","maybeAddObservedAddress","isCertified","peerRecordEnvelope","openAndCertify","envelopePeer","existingPeer","storedEnvelope","storedRecord","patch","consumeIdentifyMessage","cleanObservedAddr","getCleanMultiaddr","isGlobalUnicast","addObservedAddr","getAddresses","seal","remoteAddr","closeSource","getIterator","createAbortError","clearMethods","defaultClear","defaultSet","milliseconds","timeoutId","settle","rejectFunction","signalListener","delayPromise","createDelay","RateLimitError","remainingPoints","msBeforeNext","consumedPoints","isFirstInDuration","props","QueueFullError","RateLimiter","memoryStorage","duration","blockDuration","execEvenly","execEvenlyMinDelayMs","keyPrefix","MemoryStorage","pointsToConsume","rlKey","getKey","secDuration","_getKeySecDuration","incrby","delayMs","penalty","reward","msDuration","initPoints","customDuration","parseKey","durationSec","existing","msBeforeExpires","expiresAt","durationMs","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","StreamInputBufferError","AbstractStream","direction","readStatus","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","registry","_newStream","_newReceiverStream","maxMsgSize","onStreamEnd","_handleIncoming","onIncomingStream","maxBufferSize","maxStreamBufferSize","Mplex","createStreamMuxer","mplex","PingService","handleMessage","received","transportSymbol","FaultTolerance","ASSUME_HTTP_CODES","extractSNI","extractTuple","extractPort","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","isArrayBuffer","connect","location","wsUrl","httpProto","wsProto","connectedSource","binaryType","connected","connError","cleanUp","cont","onOpen","onError","onMessage","remoteAddress","remotePort","hostname","CONNECTING","OPEN","terminate","websocket","CustomProgressEvent","Event","dialerEvents","registerCounterGroup","label","maConn","metricPrefix","socketToMaConn","_connect","upgrader","upgradeOutbound","cOpts","errorPromise","rawSocket","uri","onProgress","createListener","listenFilter","dialFilter","webSockets","getDOMException","DOMException","getAbortedReason","pTimeout","fallback","customTimers","abortHandler","cancelablePromise","POSITIVE_INFINITY","timeoutError","PriorityQueue","enqueue","run","element","priority","step","it","lowerBound","setPriority","findIndex","ReferenceError","dequeue","PQueue","carryoverConcurrencyCount","intervalCap","concurrency","autoStart","queueClass","throwOnTimeout","delay","canInitializeInterval","job","newConcurrency","function_","addAll","functions","pause","onSizeLessThan","onIdle","sizeBy","getTypes","DEFAULT_TYPES","RecordType","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","cached","getAnswers","cachedAnswers","expires","cacheSize","tld","dnsaddrCode","RecursionLimitError","dnsaddrResolver","recursionLimit","maxRecursiveDepth","TXT","DefaultConfig","announce","noAnnounce","announceFilter","transportManager","faultTolerance","FATAL_ALL","validateConfig","resultingOptions","connectionProtector","LIBP2P_FORCE_PNET","contentRoutingSymbol","peerRoutingSymbol","fmtLong","isError","toNamespace","regexp","RegExp","setupFormatters","defaultLogger","createDisabledLogger","notEmpty","mapIterable","iter","PeerSet","predicate","intersection","difference","union","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","Peer","Address","Tag","populatePublicKey","bytesToPeer","maxAddressAge","pbToPeer","expiry","observed","compareOptionalUint8Arrays","arrA","arrB","compareArrays","compare","compareMaps","mapA","mapB","valueB","Peer$metadataEntry","Peer$tagsEntry","updated","tags$value","pathSepS","pathSepB","pathSep","Key","_buf","uint8Array","withNamespaces","asKey","less","list1","list2","baseNamespace","namespaceType","namespaceValue","child","isAncestorOf","isDecendantOf","isTopLevel","NAMESPACE_COMMON","peerIdToDatastoreKey","b32key","dedupeFilterAndSortAddresses","existingAddresses","addressMap","maStr","existingAddr","toPeerPB","strategy","createSortedMap","validateMetadata","validateTag","mapTag","metadataEntries","tagsEntries","mergedTags","addressFilter","peerPB","keyToPeerId","decodePeer","PersistentStore","datastore","lock","maxPeerAge","isWorker","readLock","writeLock","release","masterQueue","readQueue","localReadQueue","readPromise","createMutex","peerPb","filters","orders","mapQuery","put","previous","peerA","peerB","metadataA","metadataB","expired","minAddressObserved","addrs","PersistentPeerStore","consumePeerRecord","expectedPeer","peekable","iterable","sorter","items","BaseDatastore","putMany","getMany","deleteMany","batch","puts","dels","commit","_all","_allKeys","queryKeys","MemoryDatastore","defaultAddressFilter","stripPeerId","observedPeerIdStr","DefaultAddressManager","_updatePeerStoreAddresses","debounce","getAnnounceAddrs","getAddrs","confident","getListenAddrs","getObservedAddrs","confirmObservedAddr","startingConfidence","removeObservedAddr","addrSet","isStartable","MissingServiceError","UnmetServiceDependenciesError","NoContentRoutersError","NoPeerRoutersError","QueriedForSelfError","UnhandledProtocolError","DuplicateProtocolHandlerError","DialDeniedError","NoValidAddressesError","ConnectionInterceptedError","ConnectionDeniedError","MuxerUnavailableError","EncryptionFailedError","TransportUnavailableError","DefaultComponents","_started","_invokeStartableMethod","startable","beforeStart","afterStart","beforeStop","afterStop","OPTIONAL_SERVICES","NON_SERVICE_PROPERTIES","getServiceCapabilities","getServiceDependencies","getServiceName","connectionGater","gater","denyDialPeer","denyDialMultiaddr","denyInboundConnection","denyOutboundConnection","denyInboundEncryptedConnection","denyOutboundEncryptedConnection","denyInboundUpgradedConnection","denyOutboundUpgradedConnection","filterMultiaddrForPeer","PeerMap","getPeerAddress","maPeerIdStr","maPeerId","DEFAULT_CLOSABLE_PROTOCOLS","maxConnections","allow","ConnectionPruner","maybePruneConnections","_maybePruneConnections","numConnections","peerValues","sortedConnections","sortConnections","toPrune","toClose","streamProtocols","closableProtocols","safelyCloseConnectionIfUnused","connectionALifespan","connectionBLifespan","peerAValue","peerBValue","LAST_DIAL_FAILURE_KEY","LAST_DIAL_SUCCESS_KEY","raceEvent","eventName","removeListeners","eventListener","errorEvent","errorEventListener","JobRecipient","Job","recipients","controller","created","recipient","Queue","metricName","registerMetricGroup","calculate","running","tryToStartAnother","toGenerator","onQueueJobComplete","onQueueError","onQueueIdle","onSignalAbort","anySignal","signals","reliableTransportsFirst","isATCP","isBTCP","isAWebSocketSecure","isBWebSocketSecure","isAWebSocket","isBWebSocket","isAWebRTC","isBWebRTC","isAWebRTCDirect","isBWebRTCDirect","isAWebTransport","isBWebTransport","publicAddressesFirst","isAPrivate","isBPrivate","certifiedAddressesFirst","circuitRelayAddressesLast","isACircuit","isBCircuit","DialQueue","addressSorter","maxPeerAddrsToDial","maxDialQueueLength","dialTimeout","shutDownController","peerIdOrMultiaddr","existingConnection","flat","force","existingDial","createDialAbortController","addrsToDial","calculateMultiaddrs","dialed","DEFAULT_DIAL_PRIORITY","userSignal","peerRouting","findPeer","resolvedAddresses","resolveMultiaddrs","peerIdMultiaddr","lastProto","filteredAddrs","dialTransportForMultiaddr","addrPeerId","dedupedAddrs","dedupedMultiaddrs","gatedAdrs","sortedGatedAddrs","isDialable","KEEP_ALIVE","PeerQueue","objectToString","errorMessages","originalError","decorateErrorWithCounts","attemptNumber","retriesLeft","ReconnectQueue","retryInterval","backoffFactor","maxParallelReconnects","maybeReconnect","hasKeepAliveTag","onFailedAttempt","shouldRetry","isNetworkError","finalError","pRetry","keepAlivePeers","DefaultConnectionManager","deny","maxIncomingPendingConnections","incomingPendingConnections","outboundPendingConnections","dialQueue","reconnectQueue","connectionPruner","inboundConnectionRateLimiter","onConnect","onDisconnect","inboundConnectionThreshold","reconnectRetries","reconnectRetryInterval","reconnectBackoffFactor","metric","inbound","outbound","conns","allStreams","objs","startables","tasks","connectionList","_onConnect","isNewPeer","storedConns","filteredPeerConns","getConnectionsMap","peerConnections","trackedConnection","closeConnections","acceptIncomingConnection","afterUpgradeInbound","getDialQueue","statusMap","errored","complete","MovingAverage","movingAverage","variance","deviation","forecast","timeSpan","previousTime","alpha","pt","exp","time","incr","AdaptiveTimeout","timeoutMultiplier","failureMultiplier","getTimeoutSignal","timeoutFactor","sendTimeout","timeoutSignal","failureMovingAverage","failureDeviation","failureForecast","failureVariance","successMovingAverage","successDeviation","successForecast","successVariance","ConnectionMonitor","heartbeatInterval","pingIntervalMs","abortController","abortConnectionOnPingFailure","pingInterval","pingTimeout","bs","rtt","CompoundContentRouting","routers","findProviders","seen","router","provide","Fingerprint","fp","fingerprintSize","fnv","hashV","getRandomInt","Bucket","fingerprint","FNV_PRIMES","FNV_OFFSETS","cachedEncoder","utf8Buffer","fnvPrime","remaining","encodeInto","asUintN","fnv1aEncodeInto","fnv1aUint8Array","fnv1a","numberToBuffer","CuckooFilter","bucketSize","filterSize","rand","swapped","inJ","inK","reliable","MAX_LOAD","optimize","maxItems","errorRate","calculateBucketSize","log2","ScalableCuckooFilter","scale","filterSeries","cuckoo","curSize","DefaultPeerRouting","getClosestPeers","createScalableCuckooFilter","ordered","ops","sourceErr","slotAvailable","resultAvailable","sourceFinished","opErred","valuesAvailable","yieldOrderedValues","ok","yieldUnOrderedValues","parallel","useCache","RandomWalk","walking","walkers","shutdownController","walkController","needNext","walk","startWalk","DefaultRegistrar","topologies","_onDisconnect","_onPeerUpdate","_onPeerIdentify","getHandler","getTopologies","register","topology","unregister","removed","notifyOnLimitedConnection","TrackedMap","registerMetric","updateComponentMetric","deleted","DefaultTransportManager","transports","trackedMap","getTransports","of","getListeners","listenTransportForMultiaddr","couldNotListen","supportedAddrs","NO_FATAL","removeAll","validateMaxDataLength","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","buffers","connectionSymbol","ConnectionImpl","multiplexer","encryption","_close","_abort","_getStreams","getStreams","countStreams","streamCount","DefaultUpgrader","connectionEncrypters","streamMuxers","inboundUpgradeTimeout","outboundUpgradeTimeout","inboundStreamProtocolNegotiationTimeout","outboundStreamProtocolNegotiationTimeout","encrypter","muxer","dials","shouldBlockConnection","denyOperation","upgradeInbound","_performUpgrade","idStr","remotePeerId","encryptedConn","upgradedConn","muxerFactory","cryptoProtocol","trackMultiaddrConnection","protectedConn","skipProtection","protector","protect","skipEncryption","_encryptInbound","_encryptOutbound","multiplexed","_multiplexInbound","_multiplexOutbound","_createConnection","muxedStream","incomingLimit","findIncomingStreamLimit","trackProtocolStream","_onStream","outgoingLimit","findOutgoingStreamLimit","_timeline","Proxy","Reflect","upgraded","__maConnTimeline","muxers","Libp2p","contentRouting","originalDispatch","internalResult","externalResult","defaultComponents","configureComponent","persistentPeerStore","connectionMonitor","peerRouters","contentRouters","peerDiscovery","createService","capability","checkServiceDependencies","component","peerSet","getMultiaddrs","peerKey","isTestEnvironment","DEFAULT_NODE_REQUIREMENTS","USE_ENDOMORPHISM","ShaError","assertJacPoint","JacobianPoint","toAffineBatch","scratch","Z1Z1","Z2Z2","S1","S2","x1b","HH","HHH","P0","normalizeScalar","affinePoint","_WINDOW_SIZE","offset1","offset2","cond1","cond2","invZ","iz1","iz2","iz3","fromCompressedHex","isShort","bytesToNumber","isValidFieldElement","rt","isYOdd","fromUncompressedHex","normalizePrivateKey","fromSignature","normalizeSignature","truncateHash","rinv","numTo32bStr","toHexX","toRawX","aP","bQ","sliceDER","parseDERInt","rBytesLeft","parseDERSignature","HALF","sHex","rHex","sHexL","rHexL","sLen","rLen","_0","_9","POW_2_256","truncateOnly","groupLen","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","multiaddrBytes","decodeMultiaddrs","deleteUndefined","waku2","decodeWaku2","initSigArgs","canonical","recSig","der","recovered","finalizeSig","TransportProtocol","TransportProtocolPerIpVersion","pubKey","ecdsaOid","publicKeyFromRaw","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","QuickLRU","maxAge","onEviction","__oldCache","resize","newSize","removeCount","entriesDescending","entriesAscending","oldCacheSize","callbackFunction","thisArgument","buildResource","serverResolver","recordType","resource","req","Headers","getCacheKey","_TXTcache","_servers","_request","_abortControllers","maxCache","getServers","_getShuffledServers","newServers","setServers","servers","rrType","resolve4","resolve6","resolveTxt","server","DnsOverHttps","resolveTXT","sd","ENRTree","parseAndVerifyRoot","ROOT_PREFIX","rootValues","parseRootValues","decodedPublicKey","signedComponent","signedComponentBuffer","eRoot","txt","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","createLibp2p","filterMultiaddrs","pingMaxInboundStreams","createLightNode","isAutoSharding","derivePubsubTopicsFromNetworkConfig","libp2pOptions","defaultBootstrap","defaultPeerDiscoveries","bootstrapPeers","createLibp2pAndUpdateOptions","generateRandomNumber","thisArg","_arguments","generator","sent","trys","Iterator","verb","__generator","_a","fulfilled","rejected","DEFAULT_CONTENT_TOPIC","ProtoSequencedMessage","sequenceCompletedEvent","messageReceivedEvent","wakuNode","app","startLightPushSequence","startFilterSubscription","_this","numMessages_1","args_1","_i","pack","ar","__spreadArray","numMessages","period","sequenceHash","sequenceTotal","sequenceIndex","sendMessage","error_1","sender","createElement","textContent","_b"],"sourceRoot":""} \ No newline at end of file +{"version":3,"file":"index.js","mappings":";uCAAAA,EAAOC,QAAU,SAAUC,GAEzB,IAAKA,EAAK,MAAMC,MAAM,iEAEtB,IAAIC,EAAO,EAAGC,EAAQC,OAAOC,OAAO,MAAOC,EAASF,OAAOC,OAAO,MAElE,SAASE,EAAQC,EAAKC,GACpBN,EAAMK,GAAOC,IACbP,GACWF,IACTE,EAAO,EACPI,EAASH,EACTA,EAAQC,OAAOC,OAAO,MAE1B,CAEA,MAAO,CACLK,IAAK,SAAUF,GACb,YAAsBG,IAAfR,EAAMK,SAAsCG,IAAhBL,EAAOE,EAC5C,EACAI,OAAQ,SAAUJ,QACEG,IAAfR,EAAMK,KACPL,EAAMK,QAAOG,QACIA,IAAhBL,EAAOE,KACRF,EAAOE,QAAOG,EAClB,EACAE,IAAK,SAAUL,GACb,IAAIM,EAAIX,EAAMK,GACd,YAASG,IAANG,EAAwBA,OACFH,KAArBG,EAAIR,EAAOE,KACbD,EAAOC,EAAKM,GACLA,QAFT,CAIF,EACAC,IAAK,SAAUP,EAAKC,QACAE,IAAfR,EAAMK,GAAoBL,EAAMK,GAAOC,EACrCF,EAAOC,EAAKC,EACnB,EACAO,MAAO,WACLb,EAAQC,OAAOC,OAAO,MACtBC,EAASF,OAAOC,OAAO,KACzB,EAEJ,wBCzCA,IAAIK,EAAMN,OAAOa,UAAUC,eACvBC,EAAS,IASb,SAASC,IAAU,CA4BnB,SAASC,EAAGC,EAAIC,EAASC,GACvBC,KAAKH,GAAKA,EACVG,KAAKF,QAAUA,EACfE,KAAKD,KAAOA,IAAQ,CACtB,CAaA,SAASE,EAAYC,EAASC,EAAON,EAAIC,EAASC,GAChD,GAAkB,mBAAPF,EACT,MAAM,IAAIO,UAAU,mCAGtB,IAAIC,EAAW,IAAIT,EAAGC,EAAIC,GAAWI,EAASH,GAC1CO,EAAMZ,EAASA,EAASS,EAAQA,EAMpC,OAJKD,EAAQK,QAAQD,GACXJ,EAAQK,QAAQD,GAAKT,GAC1BK,EAAQK,QAAQD,GAAO,CAACJ,EAAQK,QAAQD,GAAMD,GADhBH,EAAQK,QAAQD,GAAKE,KAAKH,IADlCH,EAAQK,QAAQD,GAAOD,EAAUH,EAAQO,gBAI7DP,CACT,CASA,SAASQ,EAAWR,EAASI,GACI,KAAzBJ,EAAQO,aAAoBP,EAAQK,QAAU,IAAIZ,SAC5CO,EAAQK,QAAQD,EAC9B,CASA,SAASK,IACPX,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,CACtB,CAzEI9B,OAAOC,SACTe,EAAOH,UAAYb,OAAOC,OAAO,OAM5B,IAAIe,GAASiB,YAAWlB,GAAS,IA2ExCiB,EAAanB,UAAUqB,WAAa,WAClC,IACIC,EACAC,EAFAC,EAAQ,GAIZ,GAA0B,IAAtBhB,KAAKS,aAAoB,OAAOO,EAEpC,IAAKD,KAASD,EAASd,KAAKO,QACtBtB,EAAIgC,KAAKH,EAAQC,IAAOC,EAAMR,KAAKd,EAASqB,EAAKG,MAAM,GAAKH,GAGlE,OAAIpC,OAAOwC,sBACFH,EAAMI,OAAOzC,OAAOwC,sBAAsBL,IAG5CE,CACT,EASAL,EAAanB,UAAU6B,UAAY,SAAmBlB,GACpD,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCmB,EAAWtB,KAAKO,QAAQD,GAE5B,IAAKgB,EAAU,MAAO,GACtB,GAAIA,EAASzB,GAAI,MAAO,CAACyB,EAASzB,IAElC,IAAK,IAAI0B,EAAI,EAAGC,EAAIF,EAASG,OAAQC,EAAK,IAAIC,MAAMH,GAAID,EAAIC,EAAGD,IAC7DG,EAAGH,GAAKD,EAASC,GAAG1B,GAGtB,OAAO6B,CACT,EASAf,EAAanB,UAAUoC,cAAgB,SAAuBzB,GAC5D,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCkB,EAAYrB,KAAKO,QAAQD,GAE7B,OAAKe,EACDA,EAAUxB,GAAW,EAClBwB,EAAUI,OAFM,CAGzB,EASAd,EAAanB,UAAUqC,KAAO,SAAc1B,EAAO2B,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAI5B,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAO,EAE/B,IAEI6B,EACAZ,EAHAF,EAAYrB,KAAKO,QAAQD,GACzB8B,EAAMC,UAAUZ,OAIpB,GAAIJ,EAAUxB,GAAI,CAGhB,OAFIwB,EAAUtB,MAAMC,KAAKsC,eAAenC,EAAOkB,EAAUxB,QAAIX,GAAW,GAEhEkD,GACN,KAAK,EAAG,OAAOf,EAAUxB,GAAGoB,KAAKI,EAAUvB,UAAU,EACrD,KAAK,EAAG,OAAOuB,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,IAAK,EACzD,KAAK,EAAG,OAAOT,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAOV,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAOX,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAOZ,EAAUxB,GAAGoB,KAAKI,EAAUvB,QAASgC,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAKX,EAAI,EAAGY,EAAO,IAAIR,MAAMS,EAAK,GAAIb,EAAIa,EAAKb,IAC7CY,EAAKZ,EAAI,GAAKc,UAAUd,GAG1BF,EAAUxB,GAAG0C,MAAMlB,EAAUvB,QAASqC,EACxC,KAAO,CACL,IACIK,EADAf,EAASJ,EAAUI,OAGvB,IAAKF,EAAI,EAAGA,EAAIE,EAAQF,IAGtB,OAFIF,EAAUE,GAAGxB,MAAMC,KAAKsC,eAAenC,EAAOkB,EAAUE,GAAG1B,QAAIX,GAAW,GAEtEkD,GACN,KAAK,EAAGf,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,SAAU,MACpD,KAAK,EAAGuB,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,QAASgC,GAAK,MACxD,KAAK,EAAGT,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,QAASgC,EAAIC,GAAK,MAC5D,KAAK,EAAGV,EAAUE,GAAG1B,GAAGoB,KAAKI,EAAUE,GAAGzB,QAASgC,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKG,EAAM,IAAKK,EAAI,EAAGL,EAAO,IAAIR,MAAMS,EAAK,GAAII,EAAIJ,EAAKI,IACxDL,EAAKK,EAAI,GAAKH,UAAUG,GAG1BnB,EAAUE,GAAG1B,GAAG0C,MAAMlB,EAAUE,GAAGzB,QAASqC,GAGpD,CAEA,OAAO,CACT,EAWAxB,EAAanB,UAAUiD,GAAK,SAAYtC,EAAON,EAAIC,GACjD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAWAa,EAAanB,UAAUO,KAAO,SAAcI,EAAON,EAAIC,GACrD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAYAa,EAAanB,UAAU8C,eAAiB,SAAwBnC,EAAON,EAAIC,EAASC,GAClF,IAAIO,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAON,KAC/B,IAAKH,EAEH,OADAa,EAAWV,KAAMM,GACVN,KAGT,IAAIqB,EAAYrB,KAAKO,QAAQD,GAE7B,GAAIe,EAAUxB,GAEVwB,EAAUxB,KAAOA,GACfE,IAAQsB,EAAUtB,MAClBD,GAAWuB,EAAUvB,UAAYA,GAEnCY,EAAWV,KAAMM,OAEd,CACL,IAAK,IAAIiB,EAAI,EAAGT,EAAS,GAAIW,EAASJ,EAAUI,OAAQF,EAAIE,EAAQF,KAEhEF,EAAUE,GAAG1B,KAAOA,GACnBE,IAASsB,EAAUE,GAAGxB,MACtBD,GAAWuB,EAAUE,GAAGzB,UAAYA,IAErCgB,EAAON,KAAKa,EAAUE,IAOtBT,EAAOW,OAAQzB,KAAKO,QAAQD,GAAyB,IAAlBQ,EAAOW,OAAeX,EAAO,GAAKA,EACpEJ,EAAWV,KAAMM,EACxB,CAEA,OAAON,IACT,EASAW,EAAanB,UAAUkD,mBAAqB,SAA4BvC,GACtE,IAAIG,EAUJ,OARIH,GACFG,EAAMZ,EAASA,EAASS,EAAQA,EAC5BH,KAAKO,QAAQD,IAAMI,EAAWV,KAAMM,KAExCN,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,GAGfT,IACT,EAKAW,EAAanB,UAAUmD,IAAMhC,EAAanB,UAAU8C,eACpD3B,EAAanB,UAAUS,YAAcU,EAAanB,UAAUiD,GAK5D9B,EAAaiC,SAAWlD,EAKxBiB,EAAaA,aAAeA,EAM1BtC,EAAOC,QAAUqC,8BCxUnB,IAAIkC,EAAQvE,EAERwE,EAAO,EAAQ,MAEfC,EAAI,CACJ,SACA,QACA,QACA,SACA,SACA,UACA,WACA,QACA,SACA,SACA,UACA,WACA,OACA,SACA,SAGJ,SAASC,EAAKC,EAAQC,GAClB,IAAI3B,EAAI,EAAG4B,EAAI,CAAC,EAEhB,IADAD,GAAU,EACH3B,EAAI0B,EAAOxB,QAAQ0B,EAAEJ,EAAExB,EAAI2B,IAAWD,EAAO1B,KACpD,OAAO4B,CACX,CAsBAN,EAAMO,MAAQJ,EAAK,CACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,IAwBnBH,EAAMQ,SAAWL,EAAK,CACH,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GACA,EACA,GACAF,EAAKQ,WACL,OAanBT,EAAMU,KAAOP,EAAK,CACC,EACA,EACA,EACA,EACA,GAChB,GAmBHH,EAAMW,OAASR,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,GAChB,GAoBHH,EAAMY,OAAST,EAAK,CACD,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,EACA,gCCjMnB3E,EAAOC,QAwHP,SAAkBoF,GAGd,IAAIC,EAAMb,EAAKc,QAAQ,CAAC,KAAMF,EAAM3C,KAAO,UAAjC+B,CACT,oCADSA,CAEL,WAAY,mBAEbe,EAAiB,CAAC,EADTH,EAAMI,YAERrC,QAAQkC,EAClB,YAED,IAAK,IAAIpC,EAAI,EAAGA,EAAsBmC,EAAMK,YAAYtC,SAAUF,EAAG,CACjE,IAAIyC,EAAQN,EAAMO,aAAa1C,GAAG2C,UAC9BC,EAAQ,IAAMrB,EAAKsB,SAASJ,EAAMjD,MAMtC,GAJIiD,EAAMK,UAAUV,EACnB,sCAAuCQ,EAAKH,EAAMjD,MAG/CiD,EAAMM,IAAOX,EACZ,yBAA0BQ,EADdR,CAER,WAAYY,EAAQP,EAAO,UAFnBL,CAGZ,wBAAyBQ,EAHbR,CAIZ,gCACGa,EAAab,EAAKK,EAAO,QACzBS,EAAed,EAAKK,EAAOzC,EAAG4C,EAAM,SAApCM,CACH,UAGE,GAAIT,EAAMU,SAAYf,EACxB,yBAA0BQ,EADFR,CAEpB,WAAYY,EAAQP,EAAO,SAFPL,CAGxB,gCAAiCQ,GAC9BM,EAAed,EAAKK,EAAOzC,EAAG4C,EAAM,MAApCM,CACH,SAGE,CACH,GAAIT,EAAMW,OAAQ,CACd,IAAIC,EAAY9B,EAAKsB,SAASJ,EAAMW,OAAO5D,MACD,IAAtC8C,EAAeG,EAAMW,OAAO5D,OAAa4C,EAChD,cAAeiB,EADiCjB,CAE5C,WAAYK,EAAMW,OAAO5D,KAAO,qBACjC8C,EAAeG,EAAMW,OAAO5D,MAAQ,EACpC4C,EACH,QAASiB,EACV,CACAH,EAAed,EAAKK,EAAOzC,EAAG4C,EAClC,CACIH,EAAMK,UAAUV,EACnB,IACL,CACA,OAAOA,EACN,cAEL,EA7KA,IAAIkB,EAAY,EAAQ,MACpB/B,EAAY,EAAQ,MAExB,SAASyB,EAAQP,EAAOc,GACpB,OAAOd,EAAMjD,KAAO,KAAO+D,GAAYd,EAAMU,UAAyB,UAAbI,EAAuB,KAAOd,EAAMM,KAAoB,WAAbQ,EAAwB,MAAMd,EAAMe,QAAQ,IAAM,IAAM,WAChK,CAWA,SAASN,EAAed,EAAKK,EAAOgB,EAAYb,GAE5C,GAAIH,EAAMiB,aACN,GAAIjB,EAAMiB,wBAAwBJ,EAAM,CAAElB,EACrC,cAAeQ,EADsBR,CAEjC,WAFiCA,CAG7B,WAAYY,EAAQP,EAAO,eACpC,IAAK,IAAIkB,EAAOvG,OAAOuG,KAAKlB,EAAMiB,aAAahC,QAAST,EAAI,EAAGA,EAAI0C,EAAKzD,SAAUe,EAAGmB,EAChF,WAAYK,EAAMiB,aAAahC,OAAOiC,EAAK1C,KAChDmB,EACS,QADTA,CAEC,IACL,MACIA,EACC,IADDA,CAEK,8BAA+BqB,EAAYb,EAFhDR,CAGK,QAHLA,CAIS,aAAcK,EAAMjD,KAAO,IAJpC4C,CAKC,UAGL,OAAQK,EAAMmB,MACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYxB,EACZ,0BAA2BQ,EADfR,CAER,WAAYY,EAAQP,EAAO,YAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYL,EACZ,kFAAmFQ,EAAKA,EAAKA,EAAKA,EADtFR,CAER,WAAYY,EAAQP,EAAO,iBAChC,MACJ,IAAK,QACL,IAAK,SAAUL,EACV,2BAA8BQ,EADpBR,CAEN,WAAYY,EAAQP,EAAO,WAChC,MACJ,IAAK,OAAQL,EACR,4BAA+BQ,EADvBR,CAEJ,WAAYY,EAAQP,EAAO,YAChC,MACJ,IAAK,SAAUL,EACV,yBAA0BQ,EADhBR,CAEN,WAAYY,EAAQP,EAAO,WAChC,MACJ,IAAK,QAASL,EACT,4DAA+DQ,EAAKA,EAAKA,EADhER,CAEL,WAAYY,EAAQP,EAAO,WAI5C,OAAOL,CAEX,CAUA,SAASa,EAAab,EAAKK,EAAOG,GAE9B,OAAQH,EAAMe,SACV,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYpB,EACZ,6BAA8BQ,EADlBR,CAER,WAAYY,EAAQP,EAAO,gBAChC,MACJ,IAAK,QACL,IAAK,SACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYL,EACZ,6BAA8BQ,EADlBR,CAER,WAAYY,EAAQP,EAAO,qBAChC,MACJ,IAAK,OAAQL,EACR,4BAA6BQ,EADrBR,CAEJ,WAAYY,EAAQP,EAAO,gBAGxC,OAAOL,CAEX,mCCjHAtF,EAAOC,QAAU8G,EAEjB,IAAIC,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,EAASC,GACd,OAAOA,EAAIC,QAAQJ,GAAY,SAASK,EAAIC,GACxC,OAAQA,GACJ,IAAK,KACL,IAAK,GACD,OAAOA,EACX,QACI,OAAOL,EAAYK,IAAO,GAEtC,GACJ,CA6DA,SAASd,EAASe,EAAQC,GAEtBD,EAASA,EAAOE,WAEhB,IAAInD,EAAS,EACTzB,EAAS0E,EAAO1E,OAChB6E,EAAO,EACPC,EAAkB,EAClBC,EAAW,CAAC,EAEZC,EAAQ,GAERC,EAAc,KASlB,SAASC,EAAQC,GACb,OAAOpI,MAAM,WAAaoI,EAAU,UAAYN,EAAO,IAC3D,CAyBA,SAASO,EAAOC,GACZ,OAAOX,EAAOU,OAAOC,EACzB,CAUA,SAASC,EAAWC,EAAOC,EAAKC,GAC5B,IAYIC,EAZAC,EAAU,CACVjC,KAAMgB,EAAOU,OAAOG,KACpBK,WAAW,EACXC,QAASJ,GAQTK,EAAgBP,GALhBZ,EACW,EAEA,GAIf,GACI,KAAMmB,EAAgB,GACyB,QAAtCJ,EAAIhB,EAAOU,OAAOU,IAA0B,CACjDH,EAAQC,WAAY,EACpB,KACJ,QACW,MAANF,GAAmB,OAANA,GAItB,IAHA,IAAIK,EAAQrB,EACPsB,UAAUT,EAAOC,GACjBS,MAAMhC,GACFnE,EAAI,EAAGA,EAAIiG,EAAM/F,SAAUF,EAChCiG,EAAMjG,GAAKiG,EAAMjG,GACZyE,QAAQI,EAAuBX,EAAkBD,EAAc,IAC/DmC,OACTP,EAAQQ,KAAOJ,EACVK,KAAK,MACLF,OAELnB,EAASF,GAAQc,EACjBb,EAAkBD,CACtB,CAEA,SAASwB,EAAyBC,GAC9B,IAAIC,EAAYC,EAAcF,GAG1BG,EAAW/B,EAAOsB,UAAUM,EAAaC,GAE7C,MADgB,WAAWG,KAAKD,EAEpC,CAEA,SAASD,EAAcG,GAGnB,IADA,IAAIJ,EAAYI,EACTJ,EAAYvG,GAAgC,OAAtBoF,EAAOmB,IAChCA,IAEJ,OAAOA,CACX,CAOA,SAASK,IACL,GAAI5B,EAAMhF,OAAS,EACf,OAAOgF,EAAM6B,QACjB,GAAI5B,EACA,OA7FR,WACI,IAAI6B,EAAqB,MAAhB7B,EAAsBnB,EAAiBD,EAChDiD,EAAGC,UAAYtF,EAAS,EACxB,IAAIuF,EAAQF,EAAGG,KAAKvC,GACpB,IAAKsC,EACD,MAAM9B,EAAQ,UAIlB,OAHAzD,EAASqF,EAAGC,UACZhI,EAAKkG,GACLA,EAAc,KACPZ,EAAS2C,EAAM,GAC1B,CAmFeE,GACX,IAAIC,EACAC,EACAC,EACA9B,EACA+B,EACAC,EAA8B,IAAX9F,EACvB,EAAG,CACC,GAAIA,IAAWzB,EACX,OAAO,KAEX,IADAmH,GAAS,EACFjD,EAAawC,KAAKW,EAAOjC,EAAO3D,KAKnC,GAJa,OAAT4F,IACAE,GAAmB,IACjB1C,KAEApD,IAAWzB,EACb,OAAO,KAGf,GAAuB,MAAnBoF,EAAO3D,GAAiB,CACxB,KAAMA,IAAWzB,EACb,MAAMkF,EAAQ,WAElB,GAAuB,MAAnBE,EAAO3D,GACP,GAAKkD,EAkBE,CAIH,GAFAY,EAAQ9D,EACR6F,GAAQ,EACJjB,EAAyB5E,EAAS,GAAI,CACtC6F,GAAQ,EACR,EAAG,CAEC,IADA7F,EAAS+E,EAAc/E,MACRzB,EACX,MAGJ,GADAyB,KACK8F,EAED,KAER,OAASlB,EAAyB5E,GACtC,MACIA,EAAS+F,KAAKC,IAAIzH,EAAQwG,EAAc/E,GAAU,GAElD6F,IACAhC,EAAWC,EAAO9D,EAAQ8F,GAC1BA,GAAmB,GAEvB1C,IACAsC,GAAS,CACb,KA5C2B,CAIvB,IAFAG,EAAuC,MAA/BlC,EAAOG,EAAQ9D,EAAS,GAEJ,OAArB2D,IAAS3D,IACZ,GAAIA,IAAWzB,EACX,OAAO,OAGbyB,EACE6F,IACAhC,EAAWC,EAAO9D,EAAS,EAAG8F,GAG9BA,GAAmB,KAErB1C,EACFsC,GAAS,CACb,KA2BG,IAAgC,OAA3BE,EAAOjC,EAAO3D,IAqBtB,MAAO,IAnBP8D,EAAQ9D,EAAS,EACjB6F,EAAQ3C,GAA0C,MAAlBS,EAAOG,GACvC,EAAG,CAIC,GAHa,OAAT8B,KACExC,IAEApD,IAAWzB,EACb,MAAMkF,EAAQ,WAElBkC,EAAOC,EACPA,EAAOjC,EAAO3D,EAClB,OAAkB,MAAT2F,GAAyB,MAATC,KACvB5F,EACE6F,IACAhC,EAAWC,EAAO9D,EAAS,EAAG8F,GAC9BA,GAAmB,GAEvBJ,GAAS,CAGb,CACJ,CACJ,OAASA,GAIT,IAAI3B,EAAM/D,EAGV,GAFAmC,EAAQmD,UAAY,GACRnD,EAAQ8C,KAAKtB,EAAOI,MAE5B,KAAOA,EAAMxF,IAAW4D,EAAQ8C,KAAKtB,EAAOI,OACtCA,EACV,IAAIkC,EAAQhD,EAAOsB,UAAUvE,EAAQA,EAAS+D,GAG9C,MAFc,MAAVkC,GAA4B,MAAVA,IAClBzC,EAAcyC,GACXA,CACX,CAQA,SAAS3I,EAAK2I,GACV1C,EAAMjG,KAAK2I,EACf,CAOA,SAASC,IACL,IAAK3C,EAAMhF,OAAQ,CACf,IAAI0H,EAAQd,IACZ,GAAc,OAAVc,EACA,OAAO,KACX3I,EAAK2I,EACT,CACA,OAAO1C,EAAM,EACjB,CAmDA,OAAO9H,OAAO0K,eAAe,CACzBhB,KAAMA,EACNe,KAAMA,EACN5I,KAAMA,EACN8I,KA7CJ,SAAcxE,EAAUT,GACpB,IAAIkF,EAASH,IAEb,GADaG,IAAWzE,EAGpB,OADAuD,KACO,EAEX,IAAKhE,EACD,MAAMsC,EAAQ,UAAY4C,EAAS,OAASzE,EAAW,cAC3D,OAAO,CACX,EAoCI0E,KA5BJ,SAAcC,GACV,IACIrC,EADAsC,EAAM,KAmBV,YAjBqBxK,IAAjBuK,GACArC,EAAUZ,EAASF,EAAO,UACnBE,EAASF,EAAO,GACnBc,IAAYhB,GAAyC,MAAjBgB,EAAQjC,MAAgBiC,EAAQC,aACpEqC,EAAMtC,EAAQE,QAAUF,EAAQQ,KAAO,QAIvCrB,EAAkBkD,GAClBL,IAEJhC,EAAUZ,EAASiD,UACZjD,EAASiD,IACZrC,GAAYA,EAAQC,YAAcjB,GAAyC,MAAjBgB,EAAQjC,OAClEuE,EAAMtC,EAAQE,QAAU,KAAOF,EAAQQ,OAGxC8B,CACX,GAQG,OAAQ,CACPtK,IAAK,WAAa,OAAOkH,CAAM,GAGvC,CAxXAlB,EAASU,SAAWA,8BCrCpB,MAAM6D,EAAmB,EAAQ,MACjCrL,EAAQ,GAAgBqL,EAAiBC,cAQvBD,EAAiBC,6BCwRnCvL,EAAOC,QA7RP,SAAeuL,GAqDd,SAASC,EAAYC,GACpB,IAAIC,EAEAC,EACAC,EAFAC,EAAiB,KAIrB,SAASC,KAASjI,GAEjB,IAAKiI,EAAMC,QACV,OAGD,MAAMC,EAAOF,EAGPtB,EAAOyB,OAAO,IAAIC,MAClBC,EAAK3B,GAAQkB,GAAYlB,GAC/BwB,EAAKI,KAAOD,EACZH,EAAKzB,KAAOmB,EACZM,EAAKxB,KAAOA,EACZkB,EAAWlB,EAEX3G,EAAK,GAAK2H,EAAYa,OAAOxI,EAAK,IAEX,iBAAZA,EAAK,IAEfA,EAAKyI,QAAQ,MAId,IAAIC,EAAQ,EACZ1I,EAAK,GAAKA,EAAK,GAAG6D,QAAQ,iBAAiB,CAACyC,EAAOqC,KAElD,GAAc,OAAVrC,EACH,MAAO,IAERoC,IACA,MAAME,EAAYjB,EAAYkB,WAAWF,GACzC,GAAyB,mBAAdC,EAA0B,CACpC,MAAME,EAAM9I,EAAK0I,GACjBpC,EAAQsC,EAAU9J,KAAKqJ,EAAMW,GAG7B9I,EAAK+I,OAAOL,EAAO,GACnBA,GACD,CACA,OAAOpC,CAAK,IAIbqB,EAAYqB,WAAWlK,KAAKqJ,EAAMnI,IAEpBmI,EAAKc,KAAOtB,EAAYsB,KAChC7I,MAAM+H,EAAMnI,EACnB,CAgCA,OA9BAiI,EAAML,UAAYA,EAClBK,EAAMiB,UAAYvB,EAAYuB,YAC9BjB,EAAMkB,MAAQxB,EAAYyB,YAAYxB,GACtCK,EAAMoB,OAASA,EACfpB,EAAMqB,QAAU3B,EAAY2B,QAE5B9M,OAAO0K,eAAee,EAAO,UAAW,CACvCsB,YAAY,EACZC,cAAc,EACdvM,IAAK,IACmB,OAAnB+K,EACIA,GAEJF,IAAoBH,EAAY8B,aACnC3B,EAAkBH,EAAY8B,WAC9B1B,EAAeJ,EAAYO,QAAQN,IAG7BG,GAER5K,IAAKD,IACJ8K,EAAiB9K,CAAC,IAKY,mBAArByK,EAAY+B,MACtB/B,EAAY+B,KAAKzB,GAGXA,CACR,CAEA,SAASoB,EAAOzB,EAAW+B,GAC1B,MAAMC,EAAWjC,EAAY9J,KAAK+J,gBAAkC,IAAd+B,EAA4B,IAAMA,GAAa/B,GAErG,OADAgC,EAASX,IAAMpL,KAAKoL,IACbW,CACR,CAuCA,SAASC,EAAgBC,EAAQC,GAChC,IAAIC,EAAc,EACdC,EAAgB,EAChBC,GAAa,EACbC,EAAa,EAEjB,KAAOH,EAAcF,EAAOxK,QAC3B,GAAI2K,EAAgBF,EAASzK,SAAWyK,EAASE,KAAmBH,EAAOE,IAA4C,MAA5BD,EAASE,IAEnE,MAA5BF,EAASE,IACZC,EAAYD,EACZE,EAAaH,EACbC,MAEAD,IACAC,SAEK,KAAmB,IAAfC,EAMV,OAAO,EAJPD,EAAgBC,EAAY,EAC5BC,IACAH,EAAcG,CAGf,CAID,KAAOF,EAAgBF,EAASzK,QAAsC,MAA5ByK,EAASE,IAClDA,IAGD,OAAOA,IAAkBF,EAASzK,MACnC,CAgEA,OAzRAqI,EAAYM,MAAQN,EACpBA,EAAYyC,QAAUzC,EACtBA,EAAYa,OAsQZ,SAAgBM,GACf,OAAIA,aAAezM,MACXyM,EAAIxE,OAASwE,EAAIuB,QAElBvB,CACR,EA1QAnB,EAAY2C,QA8NZ,WACC,MAAMb,EAAa,IACf9B,EAAY9I,SACZ8I,EAAY4C,MAAMpI,KAAIyF,GAAa,IAAMA,KAC3ClC,KAAK,KAEP,OADAiC,EAAY6C,OAAO,IACZf,CACR,EApOA9B,EAAY6C,OAsJZ,SAAgBf,GACf9B,EAAY8C,KAAKhB,GACjB9B,EAAY8B,WAAaA,EAEzB9B,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAEpB,MAAMhF,GAA+B,iBAAfkE,EAA0BA,EAAa,IAC3DjE,OACA3B,QAAQ,IAAK,KACb0B,MAAM,KACNmF,OAAOC,SAET,IAAK,MAAMC,KAAMrF,EACF,MAAVqF,EAAG,GACNjD,EAAY4C,MAAMlM,KAAKuM,EAAG7L,MAAM,IAEhC4I,EAAY9I,MAAMR,KAAKuM,EAG1B,EAzKAjD,EAAYO,QA4OZ,SAAiBtJ,GAChB,IAAK,MAAMuI,KAAQQ,EAAY4C,MAC9B,GAAIV,EAAgBjL,EAAMuI,GACzB,OAAO,EAIT,IAAK,MAAMyD,KAAMjD,EAAY9I,MAC5B,GAAIgL,EAAgBjL,EAAMgM,GACzB,OAAO,EAIT,OAAO,CACR,EAzPAjD,EAAYkD,SAAW,EAAQ,MAC/BlD,EAAY2B,QA4QZ,WACCwB,QAAQC,KAAK,wIACd,EA5QAvO,OAAOuG,KAAK2E,GAAKsD,SAAQpO,IACxB+K,EAAY/K,GAAO8K,EAAI9K,EAAI,IAO5B+K,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAOpB5C,EAAYkB,WAAa,CAAC,EAkB1BlB,EAAYyB,YAVZ,SAAqBxB,GACpB,IAAIqD,EAAO,EAEX,IAAK,IAAI7L,EAAI,EAAGA,EAAIwI,EAAUtI,OAAQF,IACrC6L,GAASA,GAAQ,GAAKA,EAAQrD,EAAUsD,WAAW9L,GACnD6L,GAAQ,EAGT,OAAOtD,EAAYwD,OAAOrE,KAAKsE,IAAIH,GAAQtD,EAAYwD,OAAO7L,OAC/D,EA6OAqI,EAAY6C,OAAO7C,EAAY0D,QAExB1D,CACR,8BC5RA,IAAI2D,EAAYnP,EAEZuG,EAAO,EAAQ,MACf/B,EAAO,EAAQ,MAWnB,SAAS4K,EAA2B/J,EAAKK,EAAOgB,EAAY2I,GACxD,IAAIC,GAAwB,EAE5B,GAAI5J,EAAMiB,aACN,GAAIjB,EAAMiB,wBAAwBJ,EAAM,CAAElB,EACrC,eAAgBgK,GACjB,IAAK,IAAI1K,EAASe,EAAMiB,aAAahC,OAAQiC,EAAOvG,OAAOuG,KAAKjC,GAAS1B,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAE3F0B,EAAOiC,EAAK3D,MAAQyC,EAAM6J,aAAgBD,IAAyBjK,EAClE,WADkEA,CAE9D,4CAA+CgK,EAAMA,EAAMA,GAC3D3J,EAAMU,UAAUf,EAEhB,SACLiK,GAAwB,GAE5BjK,EACC,UAAWuB,EAAK3D,GADjBoC,CAEC,WAAYV,EAAOiC,EAAK3D,IAFzBoC,CAGK,SAAUgK,EAAM1K,EAAOiC,EAAK3D,IAHjCoC,CAIK,SACPA,EACD,IACL,MAAOA,EACF,4BAA+BgK,EAD7BhK,CAEE,sBAAuBK,EAAM8J,SAAW,oBAF1CnK,CAGF,gCAAiCgK,EAAM3I,EAAY2I,OACrD,CACH,IAAII,GAAa,EACjB,OAAQ/J,EAAMmB,MACV,IAAK,SACL,IAAK,QAASxB,EACT,kBAAmBgK,EAAMA,GAC1B,MACJ,IAAK,SACL,IAAK,UAAWhK,EACX,cAAegK,EAAMA,GACtB,MACJ,IAAK,QACL,IAAK,SACL,IAAK,WAAYhK,EACZ,YAAagK,EAAMA,GACpB,MACJ,IAAK,SACDI,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYpK,EACZ,gBADYA,CAER,6CAA8CgK,EAAMA,EAAMI,EAFlDpK,CAGZ,iCAAoCgK,EAHxBhK,CAIR,uBAAwBgK,EAAMA,EAJtBhK,CAKZ,iCAAoCgK,EALxBhK,CAMR,UAAWgK,EAAMA,EANThK,CAOZ,iCAAoCgK,EAPxBhK,CAQR,+DAAgEgK,EAAMA,EAAMA,EAAMI,EAAa,OAAS,IAC7G,MACJ,IAAK,QAASpK,EACT,4BAA+BgK,EADtBhK,CAEL,wEAAyEgK,EAAMA,EAAMA,EAFhFhK,CAGT,2BAA4BgK,EAHnBhK,CAIL,UAAWgK,EAAMA,GACtB,MACJ,IAAK,SAAUhK,EACV,kBAAmBgK,EAAMA,GAC1B,MACJ,IAAK,OAAQhK,EACR,mBAAoBgK,EAAMA,GAMvC,CACA,OAAOhK,CAEX,CAiEA,SAASqK,EAAyBrK,EAAKK,EAAOgB,EAAY2I,GAEtD,GAAI3J,EAAMiB,aACFjB,EAAMiB,wBAAwBJ,EAAMlB,EACnC,yFAA0FgK,EAAM3I,EAAY2I,EAAMA,EAAM3I,EAAY2I,EAAMA,GAC1IhK,EACA,gCAAiCgK,EAAM3I,EAAY2I,OACrD,CACH,IAAII,GAAa,EACjB,OAAQ/J,EAAMmB,MACV,IAAK,SACL,IAAK,QAASxB,EACb,6CAA8CgK,EAAMA,EAAMA,EAAMA,GAC7D,MACJ,IAAK,SACDI,GAAa,EAEjB,IAAK,QACL,IAAK,SACL,IAAK,UACL,IAAK,WAAYpK,EAChB,4BAA+BgK,EADfhK,CAEZ,uCAAwCgK,EAAMA,EAAMA,EAFxChK,CAGhB,OAHgBA,CAIZ,4IAA6IgK,EAAMA,EAAMA,EAAMA,EAAMI,EAAa,OAAQ,GAAIJ,GAC/L,MACJ,IAAK,QAAShK,EACb,gHAAiHgK,EAAMA,EAAMA,EAAMA,EAAMA,GACtI,MACJ,QAAShK,EACR,UAAWgK,EAAMA,GAG1B,CACA,OAAOhK,CAEX,CA9FA8J,EAAUQ,WAAa,SAAoBvK,GAEvC,IAAIwK,EAASxK,EAAMK,YACfJ,EAAMb,EAAKc,QAAQ,CAAC,KAAMF,EAAM3C,KAAO,cAAjC+B,CACT,6BADSA,CAEL,YACL,IAAKoL,EAAOzM,OAAQ,OAAOkC,EAC1B,wBACDA,EACC,uBACD,IAAK,IAAIpC,EAAI,EAAGA,EAAI2M,EAAOzM,SAAUF,EAAG,CACpC,IAAIyC,EAASkK,EAAO3M,GAAG2C,UACnByJ,EAAS7K,EAAKsB,SAASJ,EAAMjD,MAG7BiD,EAAMM,KAAOX,EACpB,WAAYgK,EADQhK,CAEhB,4BAA+BgK,EAFfhK,CAGZ,sBAAuBK,EAAM8J,SAAW,oBAH5BnK,CAIhB,SAAUgK,EAJMhK,CAKhB,oDAAqDgK,GAClDD,EAA2B/J,EAAKK,EAAwBzC,EAAGoM,EAAO,UAAlED,CACH,IADGA,CAEP,MAGc1J,EAAMU,UAAYf,EAChC,WAAYgK,EADoBhK,CAE5B,0BAA2BgK,EAFChK,CAGxB,sBAAuBK,EAAM8J,SAAW,mBAHhBnK,CAI5B,SAAUgK,EAJkBhK,CAK5B,iCAAkCgK,GAC/BD,EAA2B/J,EAAKK,EAAwBzC,EAAGoM,EAAO,MAAlED,CACH,IADGA,CAEP,OAIa1J,EAAMiB,wBAAwBJ,GAAOlB,EAClD,iBAAkBgK,GACfD,EAA2B/J,EAAKK,EAAwBzC,EAAGoM,GACjD3J,EAAMiB,wBAAwBJ,GAAOlB,EAClD,KAED,CAAE,OAAOA,EACR,WAEL,EAsDA8J,EAAUU,SAAW,SAAkBzK,GAEnC,IAAIwK,EAASxK,EAAMK,YAAY7C,QAAQkN,KAAKtL,EAAKuL,mBACjD,IAAKH,EAAOzM,OACR,OAAOqB,EAAKc,SAALd,CAAe,aAU1B,IATA,IAAIa,EAAMb,EAAKc,QAAQ,CAAC,IAAK,KAAMF,EAAM3C,KAAO,YAAtC+B,CACT,SADSA,CAEL,OAFKA,CAGT,YAEGwL,EAAiB,GACjBC,EAAY,GACZC,EAAe,GACfjN,EAAI,EACDA,EAAI2M,EAAOzM,SAAUF,EACnB2M,EAAO3M,GAAGoD,SACTuJ,EAAO3M,GAAG2C,UAAUQ,SAAW4J,EAC/BJ,EAAO3M,GAAG+C,IAAMiK,EAChBC,GAAchO,KAAK0N,EAAO3M,IAEpC,GAAI+M,EAAe7M,OAAQ,CAEvB,IAFyBkC,EAC5B,6BACQpC,EAAI,EAAGA,EAAI+M,EAAe7M,SAAUF,EAAGoC,EAC3C,SAAUb,EAAKsB,SAASkK,EAAe/M,GAAGR,OAC3C4C,EACH,IACD,CAEA,GAAI4K,EAAU9M,OAAQ,CAElB,IAFoBkC,EACvB,8BACQpC,EAAI,EAAGA,EAAIgN,EAAU9M,SAAUF,EAAGoC,EACtC,SAAUb,EAAKsB,SAASmK,EAAUhN,GAAGR,OACtC4C,EACH,IACD,CAEA,GAAI6K,EAAa/M,OAAQ,CAErB,IAFuBkC,EAC1B,mBACQpC,EAAI,EAAGA,EAAIiN,EAAa/M,SAAUF,EAAG,CACtC,IAAIyC,EAAQwK,EAAajN,GACrBoM,EAAQ7K,EAAKsB,SAASJ,EAAMjD,MAChC,GAAIiD,EAAMiB,wBAAwBJ,EAAMlB,EAC3C,6BAA8BgK,EAAM3J,EAAMiB,aAAawJ,WAAWzK,EAAM6J,aAAc7J,EAAM6J,kBACpF,GAAI7J,EAAMT,KAAMI,EACxB,iBADwBA,CAEpB,gCAAiCK,EAAM6J,YAAYa,IAAK1K,EAAM6J,YAAYc,KAAM3K,EAAM6J,YAAYe,SAF9EjL,CAGpB,oEAAqEgK,EAHjDhK,CAIxB,QAJwBA,CAKpB,6BAA8BgK,EAAM3J,EAAM6J,YAAYxH,WAAYrC,EAAM6J,YAAYgB,iBAChF,GAAI7K,EAAM8K,MAAO,CAClB,IAAIC,EAAe,IAAMpN,MAAMnC,UAAU0B,MAAMD,KAAK+C,EAAM6J,aAAahG,KAAK,KAAO,IACnFlE,EACP,6BAA8BgK,EAAMqB,OAAOC,aAAa1M,MAAMyM,OAAQhL,EAAM6J,aADrElK,CAEP,QAFOA,CAGH,SAAUgK,EAAMoB,EAHbpL,CAIH,6CAA8CgK,EAAMA,EAJjDhK,CAKP,IACG,MAAOA,EACV,SAAUgK,EAAM3J,EAAM6J,YACvB,CAAElK,EACL,IACD,CACA,IAAIuL,GAAS,EACb,IAAK3N,EAAI,EAAGA,EAAI2M,EAAOzM,SAAUF,EAAG,CAC5ByC,EAAQkK,EAAO3M,GAAnB,IACIsJ,EAAQnH,EAAMO,aAAakL,QAAQnL,GACnC2J,EAAQ7K,EAAKsB,SAASJ,EAAMjD,MAC5BiD,EAAMM,KACD4K,IAAUA,GAAS,EAAMvL,EACrC,YACSA,EACT,0CAA2CgK,EAAMA,EADxChK,CAEL,SAAUgK,EAFLhK,CAGL,kCACGqK,EAAyBrK,EAAKK,EAAoB6G,EAAO8C,EAAO,WAAhEK,CACH,MACUhK,EAAMU,UAAYf,EAChC,uBAAwBgK,EAAMA,EADEhK,CAE5B,SAAUgK,EAFkBhK,CAG5B,iCAAkCgK,GAC/BK,EAAyBrK,EAAKK,EAAoB6G,EAAO8C,EAAO,MAAhEK,CACH,OACQrK,EACZ,uCAAwCgK,EAAM3J,EAAMjD,MACjDiN,EAAyBrK,EAAKK,EAAoB6G,EAAO8C,GACrD3J,EAAMW,QAAQhB,EACjB,eADiBA,CAEb,SAAUb,EAAKsB,SAASJ,EAAMW,OAAO5D,MAAOiD,EAAMjD,OAEvD4C,EACH,IACD,CACA,OAAOA,EACN,WAEL,8BC3SAtF,EAAOC,QAAU8Q,EAGjB,IAAIC,EAAS,EAAQ,OACpBD,EAAa5P,UAAYb,OAAOC,OAAOyQ,EAAO7P,YAAY8P,YAAcF,EAEzE,IAAItM,EAAO,EAAQ,MAQnB,SAASsM,IACLC,EAAOpO,KAAKjB,KAChB,CAuCA,SAASuP,EAAkBtE,EAAKuE,EAAK1I,GAC7BmE,EAAIxJ,OAAS,GACbqB,EAAK2M,KAAKC,MAAMzE,EAAKuE,EAAK1I,GACrB0I,EAAIG,UACTH,EAAIG,UAAU1E,EAAKnE,GAEnB0I,EAAIE,MAAMzE,EAAKnE,EACvB,CA5CAsI,EAAaQ,WAAa,WAOtBR,EAAaS,MAAQ/M,EAAKgN,oBAE1BV,EAAaW,iBAAmBjN,EAAKkN,QAAUlN,EAAKkN,OAAOxQ,qBAAqByQ,YAAiD,QAAnCnN,EAAKkN,OAAOxQ,UAAUF,IAAIyB,KAClH,SAA8BkK,EAAKuE,EAAK1I,GACxC0I,EAAIlQ,IAAI2L,EAAKnE,EAEf,EAEE,SAA+BmE,EAAKuE,EAAK1I,GACzC,GAAImE,EAAIiF,KACNjF,EAAIiF,KAAKV,EAAK1I,EAAK,EAAGmE,EAAIxJ,aACvB,IAAK,IAAIF,EAAI,EAAGA,EAAI0J,EAAIxJ,QAC3B+N,EAAI1I,KAASmE,EAAI1J,IACrB,CACR,EAMA6N,EAAa5P,UAAUsP,MAAQ,SAA4B9P,GACnD8D,EAAKqN,SAASnR,KACdA,EAAQ8D,EAAKsN,aAAapR,EAAO,WACrC,IAAIoD,EAAMpD,EAAMyC,SAAW,EAI3B,OAHAzB,KAAKqQ,OAAOjO,GACRA,GACApC,KAAKsQ,MAAMlB,EAAaW,iBAAkB3N,EAAKpD,GAC5CgB,IACX,EAcAoP,EAAa5P,UAAU+Q,OAAS,SAA6BvR,GACzD,IAAIoD,EAAMU,EAAKkN,OAAOQ,WAAWxR,GAIjC,OAHAgB,KAAKqQ,OAAOjO,GACRA,GACApC,KAAKsQ,MAAMf,EAAmBnN,EAAKpD,GAChCgB,IACX,EAUAoP,EAAaQ,0CCnFbvR,EAAOC,QA0BP,SAAiBoF,GAWb,IATA,IAIOS,EAJHR,EAAMb,EAAKc,QAAQ,CAAC,IAAK,KAAMF,EAAM3C,KAAO,UAAtC+B,CACT,SADSA,CAEL,qBAKDoL,EAA2BxK,EAAMK,YAAY7C,QAAQkN,KAAKtL,EAAKuL,mBAE1D9M,EAAI,EAAGA,EAAI2M,EAAOzM,SAAUF,EAAG,CACpC,IAAIyC,EAAWkK,EAAO3M,GAAG2C,UACrB2G,EAAWnH,EAAMO,aAAakL,QAAQnL,GACtCmB,EAAWnB,EAAMiB,wBAAwBJ,EAAO,QAAUb,EAAMmB,KAChEsL,EAAW5N,EAAMO,MAAM+B,GACvBhB,EAAW,IAAMrB,EAAKsB,SAASJ,EAAMjD,MAGrCiD,EAAMM,KACNX,EACP,kDAAmDQ,EAAKH,EAAMjD,KADvD4C,CAEH,mDAAoDQ,EAFjDR,CAGC,4CAA6CK,EAAM0M,IAAM,EAAI,KAAO,EAAG,EAAI7N,EAAMW,OAAOQ,EAAMe,SAAUf,EAAMe,cAC9F7F,IAAbuR,EAAwB9M,EAC3B,oEAAqEkH,EAAO1G,GACxER,EACJ,qCAAsC,GAAK8M,EAAUtL,EAAMhB,GAC5DR,EACH,IADGA,CAEP,MAGcK,EAAMU,UAAYf,EAChC,2BAA4BQ,EAAKA,GAGtBH,EAAMP,aAAiCvE,IAAvB2D,EAAMY,OAAO0B,GAAuBxB,EAE3D,uBAAwBK,EAAM0M,IAAM,EAAI,KAAO,EAFY/M,CAG3D,+BAAgCQ,EAH2BR,CAIvD,cAAewB,EAAMhB,EAJkCR,CAK3D,eAGYA,EAEZ,+BAAgCQ,QACRjF,IAAbuR,EACRE,EAAehN,EAAKK,EAAO6G,EAAO1G,EAAM,OAC/BR,EACR,0BAA2BK,EAAM0M,IAAM,EAAID,KAAc,EAAGtL,EAAMhB,IAEjER,EACT,OAIWK,EAAMK,UAAUV,EAC3B,iDAAkDQ,EAAKH,EAAMjD,WAErC7B,IAAbuR,EACRE,EAAehN,EAAKK,EAAO6G,EAAO1G,GACzBR,EACR,uBAAwBK,EAAM0M,IAAM,EAAID,KAAc,EAAGtL,EAAMhB,GAGpE,CAEA,OAAOR,EACN,WAEL,EAhGA,IAAIkB,EAAW,EAAQ,MACnBhC,EAAW,EAAQ,KACnBC,EAAW,EAAQ,MAWvB,SAAS6N,EAAehN,EAAKK,EAAOgB,EAAYb,GAC5C,OAAOH,EAAM4M,UACPjN,EAAI,+CAAgDqB,EAAYb,GAAMH,EAAM0M,IAAM,EAAI,KAAO,GAAI1M,EAAM0M,IAAM,EAAI,KAAO,GACxH/M,EAAI,oDAAqDqB,EAAYb,GAAMH,EAAM0M,IAAM,EAAI,KAAO,EAC5G,kBCpBA,OASA,WACE,aAEA,IAAIG,EAAc,wBAEdC,EAA2B,iBAAXC,OAChBC,EAAOF,EAASC,OAAS,CAAC,EAC1BC,EAAKC,oBACPH,GAAS,GAEX,IAAII,GAAcJ,GAA0B,iBAATxG,MACpB0G,EAAKG,oBAAyC,iBAAZC,SAAwBA,QAAQC,UAAYD,QAAQC,SAASC,KAE5GN,EAAOO,OACEL,IACTF,EAAO1G,MA+JT,IA7JA,IAAIkH,GAAaR,EAAKS,sBAAsDpT,EAAOC,QAC/EoT,EAAsC,OACtCC,GAAgBX,EAAKY,yBAAkD,oBAAhBC,YACvDC,EAAY,mBAAmBpK,MAAM,IAErCqK,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,EAAUtB,EAAKG,qBAAuBxP,MAAM2Q,QAC5C,SAAUC,GACR,MAA+C,mBAAxC5T,OAAOa,UAAU6G,SAASpF,KAAKsR,EACxC,EACA5Q,MAAM2Q,QAENE,GAAUb,IAAiBX,EAAKyB,iCAAoCZ,YAAYW,OAIhFX,YAAYW,OAHZ,SAAUD,GACR,MAAsB,iBAARA,GAAoBA,EAAIG,QAAUH,EAAIG,OAAOpD,cAAgBuC,WAC7E,EAIAc,EAAgB,SAAUnG,GAC5B,IAAIrH,SAAcqH,EAClB,GAAa,WAATrH,EACF,MAAO,CAACqH,GAAS,GAEnB,GAAa,WAATrH,GAAiC,OAAZqH,EACvB,MAAM,IAAIhO,MAAMqS,GAElB,GAAIc,GAAgBnF,EAAQ8C,cAAgBuC,YAC1C,MAAO,CAAC,IAAI5B,WAAWzD,IAAU,GAEnC,IAAK8F,EAAQ9F,KAAagG,EAAOhG,GAC/B,MAAM,IAAIhO,MAAMqS,GAElB,MAAO,CAACrE,GAAS,EACnB,EAEIoG,EAAQ,SAAUpG,GACpB,OAA4C,IAArCmG,EAAcnG,GAAS,GAAG/K,MACnC,EAEIoR,EAAa,SAAUC,GAEzB,IADA,IAAIC,EAAW,GACNxR,EAAI,EAAGA,EAAIuR,EAAMrR,SAAUF,EAClCwR,EAASxR,GAAKuR,EAAMvR,GAEtB,OAAOwR,CACT,EAEIC,EAAqB,SAAUC,EAAMC,EAASC,GAChD,OAAO,SAAU3G,GACf,OAAO,IAAI4G,EAAOH,EAAMC,EAASD,GAAMnU,OAAO0N,GAAS2G,IACzD,CACF,EAEIE,EAA0B,SAAUJ,EAAMC,EAASC,GACrD,OAAO,SAAU3G,EAAS8G,GACxB,OAAO,IAAIF,EAAOH,EAAMC,EAASI,GAAYxU,OAAO0N,GAAS2G,IAC/D,CACF,EAEII,EAA2B,SAAUN,EAAMC,EAASC,GACtD,OAAO,SAAU3G,EAAS8G,EAAYE,EAAGzQ,GACvC,OAAO0Q,EAAQ,SAAWR,GAAMnU,OAAO0N,EAAS8G,EAAYE,EAAGzQ,GAAGoQ,IACpE,CACF,EAEIO,EAAyB,SAAUT,EAAMC,EAASC,GACpD,OAAO,SAAUpU,EAAKyN,EAAS8G,EAAYvQ,GACzC,OAAO0Q,EAAQ,OAASR,GAAMnU,OAAOC,EAAKyN,EAAS8G,EAAYvQ,GAAGoQ,IACpE,CACF,EAEIQ,EAAsB,SAAUC,EAAQC,EAAcZ,EAAMC,GAC9D,IAAK,IAAI3R,EAAI,EAAGA,EAAI6Q,EAAa3Q,SAAUF,EAAG,CAC5C,IAAI4D,EAAOiN,EAAa7Q,GACxBqS,EAAOzO,GAAQ0O,EAAaZ,EAAMC,EAAS/N,EAC7C,CACA,OAAOyO,CACT,EAEIC,EAAe,SAAUZ,EAAMC,GACjC,IAAIU,EAASZ,EAAmBC,EAAMC,EAAS,OAO/C,OANAU,EAAOhV,OAAS,WACd,OAAO,IAAIwU,EAAOH,EAAMC,EAASD,EACnC,EACAW,EAAO9U,OAAS,SAAU0N,GACxB,OAAOoH,EAAOhV,SAASE,OAAO0N,EAChC,EACOmH,EAAoBC,EAAQZ,EAAoBC,EAAMC,EAC/D,EAyCIY,EAAa,CACf,CAAE/S,KAAM,SAAUmS,QA9IC,CAAC,EAAG,IAAK,MAAO,UA8IQD,KAAMf,EAAM2B,aAAcA,GACrE,CAAE9S,KAAM,OAAQmS,QA9IJ,CAAC,EAAG,KAAM,OAAQ,WA8IID,KAAMf,EAAM2B,aAAcA,GAC5D,CAAE9S,KAAM,QAASmS,QAlJC,CAAC,GAAI,KAAM,QAAS,WAkJGD,KAAMd,EAAY0B,aA1CrC,SAAUZ,EAAMC,GACtC,IAAIU,EAASP,EAAwBJ,EAAMC,EAAS,OAOpD,OANAU,EAAOhV,OAAS,SAAU0U,GACxB,OAAO,IAAIF,EAAOH,EAAMC,EAASI,EACnC,EACAM,EAAO9U,OAAS,SAAU0N,EAAS8G,GACjC,OAAOM,EAAOhV,OAAO0U,GAAYxU,OAAO0N,EAC1C,EACOmH,EAAoBC,EAAQP,EAAyBJ,EAAMC,EACpE,GAkCE,CAAEnS,KAAM,SAAUmS,QAASnB,EAAgBkB,KAAMd,EAAY0B,aAhCtC,SAAUZ,EAAMC,GACvC,IAAIa,EAAI1B,EAAeY,GACnBW,EAASL,EAAyBN,EAAMC,EAAS,OAWrD,OAVAU,EAAOhV,OAAS,SAAU0U,EAAYE,EAAGzQ,GACvC,OAAI6P,EAAMY,IAAMZ,EAAM7P,GACb0Q,EAAQ,QAAUR,GAAMrU,OAAO0U,GAE/B,IAAIF,EAAOH,EAAMC,EAASI,GAAYU,QAAQ,CAACR,EAAGzQ,GAAIgR,EAEjE,EACAH,EAAO9U,OAAS,SAAU0N,EAAS8G,EAAYE,EAAGzQ,GAChD,OAAO6Q,EAAOhV,OAAO0U,EAAYE,EAAGzQ,GAAGjE,OAAO0N,EAChD,EACOmH,EAAoBC,EAAQL,EAA0BN,EAAMC,EACrE,GAmBE,CAAEnS,KAAM,OAAQmS,QAASnB,EAAgBkB,KAAMd,EAAY0B,aAjBtC,SAAUZ,EAAMC,GACrC,IAAIa,EAAI1B,EAAeY,GACnBW,EAASF,EAAuBT,EAAMC,EAAS,OAOnD,OANAU,EAAOhV,OAAS,SAAUG,EAAKuU,EAAYvQ,GACzC,OAAO,IAAIkR,EAAKhB,EAAMC,EAASI,GAAYU,QAAQ,CAAC,OAAQjR,GAAIgR,GAAGC,QAAQ,CAACjV,GAAMgV,EACpF,EACAH,EAAO9U,OAAS,SAAUC,EAAKyN,EAAS8G,EAAYvQ,GAClD,OAAO6Q,EAAOhV,OAAOG,EAAKuU,EAAYvQ,GAAGjE,OAAO0N,EAClD,EACOmH,EAAoBC,EAAQF,EAAwBT,EAAMC,EACnE,IAUIO,EAAU,CAAC,EAAGS,EAAc,GAEvB3S,EAAI,EAAGA,EAAIuS,EAAWrS,SAAUF,EAGvC,IAFA,IAAI4S,EAAYL,EAAWvS,GACvB0R,EAAOkB,EAAUlB,KACZzQ,EAAI,EAAGA,EAAIyQ,EAAKxR,SAAUe,EAAG,CACpC,IAAI4R,EAAaD,EAAUpT,KAAO,IAAMkS,EAAKzQ,GAG7C,GAFA0R,EAAY1T,KAAK4T,GACjBX,EAAQW,GAAcD,EAAUN,aAAaZ,EAAKzQ,GAAI2R,EAAUjB,SACzC,SAAnBiB,EAAUpT,KAAiB,CAC7B,IAAIsT,EAAgBF,EAAUpT,KAAOkS,EAAKzQ,GAC1C0R,EAAY1T,KAAK6T,GACjBZ,EAAQY,GAAiBZ,EAAQW,EACnC,CACF,CAGF,SAAShB,EAAOH,EAAMC,EAASI,GAC7BtT,KAAKsU,OAAS,GACdtU,KAAK+C,EAAI,GACT/C,KAAKkT,QAAUA,EACflT,KAAKsT,WAAaA,EAClBtT,KAAKuU,OAAQ,EACbvU,KAAKwU,WAAY,EACjBxU,KAAKyU,MAAQ,EACbzU,KAAKgH,MAAQ,EACbhH,KAAK0U,WAAc,MAAQzB,GAAQ,IAAO,EAC1CjT,KAAK2U,UAAY3U,KAAK0U,YAAc,EACpC1U,KAAK4U,aAAetB,GAAc,EAClCtT,KAAK6U,YAA2B,GAAbvB,IAAoB,EAEvC,IAAK,IAAI/R,EAAI,EAAGA,EAAI,KAAMA,EACxBvB,KAAK+C,EAAExB,GAAK,CAEhB,CA8OA,SAAS0S,EAAKhB,EAAMC,EAASI,GAC3BF,EAAOnS,KAAKjB,KAAMiT,EAAMC,EAASI,EACnC,CA9OAF,EAAO5T,UAAUV,OAAS,SAAU0N,GAClC,GAAIxM,KAAKwU,UACP,MAAM,IAAIhW,MA9MO,2BAgNnB,IAAIsW,EAASnC,EAAcnG,GAC3BA,EAAUsI,EAAO,GAKjB,IAJA,IAEuDvT,EAAGwT,EAFtD5E,EAAW2E,EAAO,GAClBR,EAAStU,KAAKsU,OAAQK,EAAY3U,KAAK2U,UAAWlT,EAAS+K,EAAQ/K,OACrEiT,EAAa1U,KAAK0U,WAAY7J,EAAQ,EAAG9H,EAAI/C,KAAK+C,EAE7C8H,EAAQpJ,GAAQ,CACrB,GAAIzB,KAAKuU,MAGP,IAFAvU,KAAKuU,OAAQ,EACbD,EAAO,GAAKtU,KAAKyU,MACZlT,EAAI,EAAGA,EAAImT,EAAa,IAAKnT,EAChC+S,EAAO/S,GAAK,EAGhB,GAAI4O,EACF,IAAK5O,EAAIvB,KAAKgH,MAAO6D,EAAQpJ,GAAUF,EAAIoT,IAAa9J,GACtDkK,EAAOvI,EAAQa,WAAWxC,IACf,IACTyJ,EAAO/S,GAAK,IAAMwT,GAAQ/C,EAAY,EAANzQ,KACvBwT,EAAO,MAChBT,EAAO/S,GAAK,KAAO,IAAQwT,GAAQ,IAAO/C,EAAY,EAANzQ,KAChD+S,EAAO/S,GAAK,KAAO,IAAe,GAAPwT,IAAiB/C,EAAY,EAANzQ,MACzCwT,EAAO,OAAUA,GAAQ,OAClCT,EAAO/S,GAAK,KAAO,IAAQwT,GAAQ,KAAQ/C,EAAY,EAANzQ,KACjD+S,EAAO/S,GAAK,KAAO,IAASwT,GAAQ,EAAK,KAAU/C,EAAY,EAANzQ,KACzD+S,EAAO/S,GAAK,KAAO,IAAe,GAAPwT,IAAiB/C,EAAY,EAANzQ,OAElDwT,EAAO,QAAoB,KAAPA,IAAiB,GAAqC,KAA9BvI,EAAQa,aAAaxC,IACjEyJ,EAAO/S,GAAK,KAAO,IAAQwT,GAAQ,KAAQ/C,EAAY,EAANzQ,KACjD+S,EAAO/S,GAAK,KAAO,IAASwT,GAAQ,GAAM,KAAU/C,EAAY,EAANzQ,KAC1D+S,EAAO/S,GAAK,KAAO,IAASwT,GAAQ,EAAK,KAAU/C,EAAY,EAANzQ,KACzD+S,EAAO/S,GAAK,KAAO,IAAe,GAAPwT,IAAiB/C,EAAY,EAANzQ,WAItD,IAAKA,EAAIvB,KAAKgH,MAAO6D,EAAQpJ,GAAUF,EAAIoT,IAAa9J,EACtDyJ,EAAO/S,GAAK,IAAMiL,EAAQ3B,IAAUmH,EAAY,EAANzQ,KAI9C,GADAvB,KAAKgV,cAAgBzT,EACjBA,GAAKoT,EAAW,CAGlB,IAFA3U,KAAKgH,MAAQzF,EAAIoT,EACjB3U,KAAKyU,MAAQH,EAAOI,GACfnT,EAAI,EAAGA,EAAImT,IAAcnT,EAC5BwB,EAAExB,IAAM+S,EAAO/S,GAEjB0T,EAAElS,GACF/C,KAAKuU,OAAQ,CACf,MACEvU,KAAKgH,MAAQzF,CAEjB,CACA,OAAOvB,IACT,EAEAoT,EAAO5T,UAAU0V,OAAS,SAAUC,EAAGC,GACrC,IAAIjS,EAAQ,IAAJgS,EAAS3B,EAAI,EACjB1E,EAAQ,CAAC3L,GAGb,IADAA,EAAQ,KADRgS,IAAS,GAEFhS,EAAI,GACT2L,EAAMlE,QAAQzH,GAEdA,EAAQ,KADRgS,IAAS,KAEP3B,EAQJ,OANI4B,EACFtG,EAAMtO,KAAKgT,GAEX1E,EAAMlE,QAAQ4I,GAEhBxT,KAAKlB,OAAOgQ,GACLA,EAAMrN,MACf,EAEA2R,EAAO5T,UAAU6V,aAAe,SAAUtP,GACxC,IAAI+O,EAASnC,EAAc5M,GAC3BA,EAAM+O,EAAO,GACb,IAAI3E,EAAW2E,EAAO,GAClBhG,EAAQ,EAAGrN,EAASsE,EAAItE,OAC5B,GAAI0O,EACF,IAAK,IAAI5O,EAAI,EAAGA,EAAIwE,EAAItE,SAAUF,EAAG,CACnC,IAAIwT,EAAOhP,EAAIsH,WAAW9L,GACtBwT,EAAO,IACTjG,GAAS,EACAiG,EAAO,KAChBjG,GAAS,EACAiG,EAAO,OAAUA,GAAQ,MAClCjG,GAAS,GAETiG,EAAO,QAAoB,KAAPA,IAAiB,GAA6B,KAAtBhP,EAAIsH,aAAa9L,IAC7DuN,GAAS,EAEb,MAEAA,EAAQrN,EAIV,OAFAqN,GAAS9O,KAAKkV,OAAe,EAARpG,GACrB9O,KAAKlB,OAAOiH,GACL+I,CACT,EAEAsE,EAAO5T,UAAUwU,QAAU,SAAUsB,EAAMvB,GAEzC,IADA,IAAIjF,EAAQ9O,KAAKkV,OAAOnB,GACfxS,EAAI,EAAGA,EAAI+T,EAAK7T,SAAUF,EACjCuN,GAAS9O,KAAKqV,aAAaC,EAAK/T,IAElC,IAAIgU,GAAgBxB,EAAIjF,EAAQiF,GAAKA,EACjCyB,EAAQ,GAGZ,OAFAA,EAAM/T,OAAS8T,EACfvV,KAAKlB,OAAO0W,GACLxV,IACT,EAEAoT,EAAO5T,UAAUiW,SAAW,WAC1B,IAAIzV,KAAKwU,UAAT,CAGAxU,KAAKwU,WAAY,EACjB,IAAIF,EAAStU,KAAKsU,OAAQ/S,EAAIvB,KAAKgV,cAAeN,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAEzF,GADAuR,EAAO/S,GAAK,IAAMvB,KAAKkT,QAAY,EAAJ3R,GAC3BvB,KAAKgV,gBAAkBhV,KAAK2U,UAE9B,IADAL,EAAO,GAAKA,EAAOI,GACdnT,EAAI,EAAGA,EAAImT,EAAa,IAAKnT,EAChC+S,EAAO/S,GAAK,EAIhB,IADA+S,EAAOI,EAAa,IAAM,WACrBnT,EAAI,EAAGA,EAAImT,IAAcnT,EAC5BwB,EAAExB,IAAM+S,EAAO/S,GAEjB0T,EAAElS,EAdF,CAeF,EAEAqQ,EAAO5T,UAAU6G,SAAW+M,EAAO5T,UAAUkW,IAAM,WACjD1V,KAAKyV,WAKL,IAHA,IAEchB,EAFVC,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAAG6R,EAAe5U,KAAK4U,aAChEC,EAAa7U,KAAK6U,WAAYtT,EAAI,EAAGiB,EAAI,EACvCkT,EAAM,GACHlT,EAAIoS,GAAc,CACvB,IAAKrT,EAAI,EAAGA,EAAImT,GAAclS,EAAIoS,IAAgBrT,IAAKiB,EACrDiS,EAAQ1R,EAAExB,GACVmU,GAAO5D,EAAW2C,GAAS,EAAK,IAAQ3C,EAAkB,GAAR2C,GAChD3C,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,EAAK,IAC3D3C,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,GAAM,IAC5D3C,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,GAAM,IAE5DjS,EAAIkS,GAAe,IACrB3R,EAAI8P,EAAW9P,GACfkS,EAAElS,GACFxB,EAAI,EAER,CAWA,OAVIsT,IACFJ,EAAQ1R,EAAExB,GACVmU,GAAO5D,EAAW2C,GAAS,EAAK,IAAQ3C,EAAkB,GAAR2C,GAC9CI,EAAa,IACfa,GAAO5D,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,EAAK,KAEhEI,EAAa,IACfa,GAAO5D,EAAW2C,GAAS,GAAM,IAAQ3C,EAAW2C,GAAS,GAAM,MAGhEiB,CACT,EAEAtC,EAAO5T,UAAUmW,YAAc,WAC7B3V,KAAKyV,WAEL,IAGI/C,EAHAgC,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAAG6R,EAAe5U,KAAK4U,aAChEC,EAAa7U,KAAK6U,WAAYtT,EAAI,EAAGiB,EAAI,EACvCsM,EAAQ9O,KAAKsT,YAAc,EAG7BZ,EADEmC,EACO,IAAIhD,YAAa+C,EAAe,GAAM,GAEtC,IAAI/C,YAAY/C,GAG3B,IADA,IAAIgE,EAAQ,IAAI8C,YAAYlD,GACrBlQ,EAAIoS,GAAc,CACvB,IAAKrT,EAAI,EAAGA,EAAImT,GAAclS,EAAIoS,IAAgBrT,IAAKiB,EACrDsQ,EAAMtQ,GAAKO,EAAExB,GAEXiB,EAAIkS,GAAe,IACrB3R,EAAI8P,EAAW9P,GACfkS,EAAElS,GAEN,CAKA,OAJI8R,IACF/B,EAAMtQ,GAAKO,EAAExB,GACbmR,EAASA,EAAOxR,MAAM,EAAG4N,IAEpB4D,CACT,EAEAU,EAAO5T,UAAUkT,OAASU,EAAO5T,UAAUmW,YAE3CvC,EAAO5T,UAAUqW,OAASzC,EAAO5T,UAAUsT,MAAQ,WACjD9S,KAAKyV,WAKL,IAHA,IAEgBvS,EAAQuR,EAFpBC,EAAa1U,KAAK0U,WAAY3R,EAAI/C,KAAK+C,EAAG6R,EAAe5U,KAAK4U,aAChEC,EAAa7U,KAAK6U,WAAYtT,EAAI,EAAGiB,EAAI,EACvCsQ,EAAQ,GACLtQ,EAAIoS,GAAc,CACvB,IAAKrT,EAAI,EAAGA,EAAImT,GAAclS,EAAIoS,IAAgBrT,IAAKiB,EACrDU,EAASV,GAAK,EACdiS,EAAQ1R,EAAExB,GACVuR,EAAM5P,GAAkB,IAARuR,EAChB3B,EAAM5P,EAAS,GAAMuR,GAAS,EAAK,IACnC3B,EAAM5P,EAAS,GAAMuR,GAAS,GAAM,IACpC3B,EAAM5P,EAAS,GAAMuR,GAAS,GAAM,IAElCjS,EAAIkS,GAAe,IACrB3R,EAAI8P,EAAW9P,GACfkS,EAAElS,GAEN,CAYA,OAXI8R,IACF3R,EAASV,GAAK,EACdiS,EAAQ1R,EAAExB,GACVuR,EAAM5P,GAAkB,IAARuR,EACZI,EAAa,IACf/B,EAAM5P,EAAS,GAAMuR,GAAS,EAAK,KAEjCI,EAAa,IACf/B,EAAM5P,EAAS,GAAMuR,GAAS,GAAM,MAGjC3B,CACT,EAMAmB,EAAKzU,UAAY,IAAI4T,EAErBa,EAAKzU,UAAUiW,SAAW,WAExB,OADAzV,KAAKkV,OAAOlV,KAAKsT,YAAY,GACtBF,EAAO5T,UAAUiW,SAASxU,KAAKjB,KACxC,EAEA,IAAIiV,EAAI,SAAUlS,GAChB,IAAI+S,EAAGtU,EAAGgS,EAAGuC,EAAIC,EAAIC,EAAIC,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,IAAKlG,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACvBuC,EAAKhT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCiT,EAAKjT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCkT,EAAKlT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCmT,EAAKnT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCoT,EAAKpT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCqT,EAAKrT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCsT,EAAKtT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IACtCuT,EAAKvT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAItC+S,GAHAS,EAAKxT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3BkT,GAAM,EAAMC,IAAO,IAC9B1U,GAHAgV,EAAKzT,EAAE,GAAKA,EAAE,IAAMA,EAAE,IAAMA,EAAE,IAAMA,EAAE,MAG3BmT,GAAM,EAAMD,IAAO,IAC9BlT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIC,GAAOI,GAAM,EAAMC,IAAO,IAC9B5U,EAAIwU,GAAOI,GAAM,EAAMD,IAAO,IAC9BpT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIG,GAAOI,GAAM,EAAMC,IAAO,IAC9B9U,EAAI0U,GAAOI,GAAM,EAAMD,IAAO,IAC9BtT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIK,GAAOI,GAAM,EAAMC,IAAO,IAC9BhV,EAAI4U,GAAOI,GAAM,EAAMD,IAAO,IAC9BxT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTsU,EAAIO,GAAON,GAAM,EAAMC,IAAO,IAC9BxU,EAAI8U,GAAON,GAAM,EAAMD,IAAO,IAC9BhT,EAAE,IAAM+S,EACR/S,EAAE,IAAMvB,EACRuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EACTuB,EAAE,KAAO+S,EACT/S,EAAE,KAAOvB,EAETiV,EAAK1T,EAAE,GACP2T,EAAK3T,EAAE,GACP0V,EAAO1V,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2V,EAAO3V,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCwU,EAAOxU,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCyU,EAAOzU,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCwW,GAAOxW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCyW,GAAOzW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCsV,EAAOtV,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCuV,EAAOvV,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC8U,EAAO9U,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9B+U,EAAO/U,EAAE,IAAM,EAAMA,EAAE,KAAO,GAC9B4T,EAAM5T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC6T,EAAM7T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC4V,EAAO5V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC6V,EAAO7V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC0U,EAAO1U,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC2U,EAAO3U,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC0W,GAAO1W,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC2W,GAAO3W,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCkW,GAAOlW,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BmW,GAAOnW,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BgV,EAAOhV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCiV,EAAOjV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChC8T,EAAM9T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC+T,EAAM/T,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChC8V,EAAO9V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC+V,EAAO/V,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjC4U,EAAO5U,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjC6U,EAAO7U,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCoU,EAAOpU,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BqU,EAAOrU,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BoW,GAAOpW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCqW,GAAOrW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCkV,EAAOlV,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCmV,EAAOnV,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCgU,EAAMhU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCiU,EAAMjU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCgW,EAAOhW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCiW,GAAOjW,EAAE,KAAO,GAAOA,EAAE,MAAQ,EACjCwV,EAAOxV,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/ByV,EAAOzV,EAAE,IAAM,GAAOA,EAAE,KAAO,EAC/BsU,EAAOtU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCuU,EAAOvU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GACjCsW,GAAOtW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCuW,GAAOvW,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCoV,EAAOpV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCqV,EAAOrV,EAAE,KAAO,EAAMA,EAAE,MAAQ,GAChCkU,EAAMlU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAChCmU,EAAMnU,EAAE,KAAO,GAAOA,EAAE,MAAQ,GAEhCA,EAAE,GAAK0T,GAAOE,EAAKE,EACnB9T,EAAE,GAAK2T,GAAOE,EAAKE,EACnB/T,EAAE,IAAMoU,GAAQE,EAAME,EACtBxU,EAAE,IAAMqU,GAAQE,EAAME,EACtBzU,EAAE,IAAM8U,GAAQE,EAAME,EACtBlV,EAAE,IAAM+U,GAAQE,EAAME,EACtBnV,EAAE,IAAMwV,GAAQE,EAAME,EACtB5V,EAAE,IAAMyV,GAAQE,EAAME,EACtB7V,EAAE,IAAMkW,IAAQE,GAAME,GACtBtW,EAAE,IAAMmW,IAAQE,GAAME,GACtBvW,EAAE,GAAK4T,GAAOE,EAAKE,EACnBhU,EAAE,GAAK6T,GAAOE,EAAKE,EACnBjU,EAAE,IAAMsU,GAAQE,EAAME,EACtB1U,EAAE,IAAMuU,GAAQE,EAAME,EACtB3U,EAAE,IAAMgV,GAAQE,EAAME,EACtBpV,EAAE,IAAMiV,GAAQE,EAAME,EACtBrV,EAAE,IAAM0V,GAAQE,EAAME,EACtB9V,EAAE,IAAM2V,GAAQE,EAAME,EACtB/V,EAAE,IAAMoW,IAAQE,GAAME,GACtBxW,EAAE,IAAMqW,IAAQE,GAAME,GACtBzW,EAAE,GAAK8T,GAAOE,EAAKE,EACnBlU,EAAE,GAAK+T,GAAOE,EAAKE,EACnBnU,EAAE,IAAMwU,GAAQE,EAAME,EACtB5U,EAAE,IAAMyU,GAAQE,EAAME,EACtB7U,EAAE,IAAMkV,GAAQE,EAAME,EACtBtV,EAAE,IAAMmV,GAAQE,EAAME,EACtBvV,EAAE,IAAM4V,GAAQE,EAAME,EACtBhW,EAAE,IAAM6V,GAAQE,EAAME,GACtBjW,EAAE,IAAMsW,IAAQE,GAAME,GACtB1W,EAAE,IAAMuW,IAAQE,GAAME,GACtB3W,EAAE,GAAKgU,GAAOE,EAAKR,EACnB1T,EAAE,GAAKiU,GAAOE,EAAKR,EACnB3T,EAAE,IAAM0U,GAAQE,EAAMR,EACtBpU,EAAE,IAAM2U,GAAQE,EAAMR,EACtBrU,EAAE,IAAMoV,GAAQE,EAAMR,EACtB9U,EAAE,IAAMqV,GAAQE,EAAMR,EACtB/U,EAAE,IAAM8V,GAAQE,EAAMR,EACtBxV,EAAE,IAAM+V,GAAQE,GAAMR,EACtBzV,EAAE,IAAMwW,IAAQE,GAAMR,GACtBlW,EAAE,IAAMyW,IAAQE,GAAMR,GACtBnW,EAAE,GAAKkU,GAAOR,EAAKE,EACnB5T,EAAE,GAAKmU,GAAOR,EAAKE,EACnB7T,EAAE,IAAM4U,GAAQR,EAAME,EACtBtU,EAAE,IAAM6U,GAAQR,EAAME,EACtBvU,EAAE,IAAMsV,GAAQR,EAAME,EACtBhV,EAAE,IAAMuV,GAAQR,EAAME,EACtBjV,EAAE,IAAMgW,GAAQR,EAAME,EACtB1V,EAAE,IAAMiW,IAAQR,EAAME,EACtB3V,EAAE,IAAM0W,IAAQR,GAAME,GACtBpW,EAAE,IAAM2W,IAAQR,GAAME,GAEtBrW,EAAE,IAAMkP,EAAGuB,GACXzQ,EAAE,IAAMkP,EAAGuB,EAAI,EAEnB,EAEA,GAAIhC,EACFnT,EAAOC,QAAUmV,MACZ,CACL,IAAKlS,EAAI,EAAGA,EAAI2S,EAAYzS,SAAUF,EACpCyP,EAAKkD,EAAY3S,IAAMkS,EAAQS,EAAY3S,IAEzCmQ,SAGD,KAFD,aACE,OAAO+B,CACR,gCAEL,CACD,CA5oBD,gCCRApV,EAAOC,QAAUqb,EAGjB,IAAIC,EAAmB,EAAQ,QAC7BD,EAAMna,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAcqK,GAAOE,UAAY,QAEhG,IAIIC,EAJAjV,EAAQ,EAAQ,MAChBhC,EAAQ,EAAQ,KAChBC,EAAQ,EAAQ,MAIhBiX,EAAS,+BA6Cb,SAASJ,EAAM5Y,EAAM2P,EAAIvL,EAAM6U,EAAMxO,EAAQyO,EAAS7S,GAclD,GAZItE,EAAKoX,SAASF,IACd5S,EAAUoE,EACVyO,EAAUD,EACVA,EAAOxO,OAAStM,GACT4D,EAAKoX,SAAS1O,KACrBpE,EAAU6S,EACVA,EAAUzO,EACVA,OAAStM,GAGb0a,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,IAE7BnX,EAAKqX,UAAUzJ,IAAOA,EAAK,EAC5B,MAAMtQ,UAAU,qCAEpB,IAAK0C,EAAKqN,SAAShL,GACf,MAAM/E,UAAU,yBAEpB,QAAalB,IAAT8a,IAAuBD,EAAO5R,KAAK6R,EAAOA,EAAK3T,WAAW+T,eAC1D,MAAMha,UAAU,8BAEpB,QAAelB,IAAXsM,IAAyB1I,EAAKqN,SAAS3E,GACvC,MAAMpL,UAAU,2BAMP,oBAAT4Z,IACAA,EAAO,YAEXha,KAAKga,KAAOA,GAAiB,aAATA,EAAsBA,OAAO9a,EAMjDc,KAAKmF,KAAOA,EAMZnF,KAAK0Q,GAAKA,EAMV1Q,KAAKwL,OAASA,QAAUtM,EAMxBc,KAAK0E,SAAoB,aAATsV,EAMhBha,KAAKsE,KAAM,EAMXtE,KAAKwM,QAAU,KAMfxM,KAAK2E,OAAS,KAMd3E,KAAK6N,YAAc,KAMnB7N,KAAKqa,aAAe,KAMpBra,KAAKuD,OAAOT,EAAKwX,WAA4Bpb,IAArB2D,EAAMU,KAAK4B,GAMnCnF,KAAK8O,MAAiB,UAAT3J,EAMbnF,KAAKiF,aAAe,KAMpBjF,KAAKua,eAAiB,KAMtBva,KAAKwa,eAAiB,KAMtBxa,KAAKoH,QAAUA,CACnB,CAlJAuS,EAAMc,SAAW,SAAkB1Z,EAAM2Z,GACrC,IAAI1W,EAAQ,IAAI2V,EAAM5Y,EAAM2Z,EAAKhK,GAAIgK,EAAKvV,KAAMuV,EAAKV,KAAMU,EAAKlP,OAAQkP,EAAKT,QAASS,EAAKtT,SAI3F,OAHIsT,EAAKC,UACL3W,EAAM4W,SAAWF,EAAKC,SAC1B3W,EAAM6W,gBAAkB,SACjB7W,CACX,EAoJArF,OAAO0K,eAAesQ,EAAMna,UAAW,WAAY,CAC/CJ,IAAK,WACD,MAAyC,oBAAlCY,KAAK8a,UAAUC,cAC1B,IASJpc,OAAO0K,eAAesQ,EAAMna,UAAW,WAAY,CAC/CJ,IAAK,WACD,OAAQY,KAAKgb,QACjB,IAUJrc,OAAO0K,eAAesQ,EAAMna,UAAW,YAAa,CAChDJ,IAAK,WACD,OAAOY,KAAKiF,wBAAwB6U,GACI,cAApC9Z,KAAK8a,UAAUG,gBACvB,IASJtc,OAAO0K,eAAesQ,EAAMna,UAAW,SAAU,CAC7CJ,IAAK,WACD,MAAkD,WAA3CY,KAAK8a,UAAUI,uBAC1B,IASJvc,OAAO0K,eAAesQ,EAAMna,UAAW,cAAe,CAClDJ,IAAK,WACD,OAAIY,KAAK0E,WAAY1E,KAAKsE,MAGnBtE,KAAK2E,QACR3E,KAAKwa,gBAAkBxa,KAAKua,gBACM,aAAlCva,KAAK8a,UAAUC,eACvB,IAMJpB,EAAMna,UAAU2b,UAAY,SAAmBpa,EAAM/B,EAAOoc,GACxD,OAAOxB,EAAiBpa,UAAU2b,UAAUla,KAAKjB,KAAMe,EAAM/B,EAAOoc,EACxE,EAuBAzB,EAAMna,UAAU6b,OAAS,SAAgBC,GACrC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKwb,iBACjB,OAA0B,aAAdxb,KAAKga,MAAuBha,KAAKga,WAAQ9a,EACrD,OAAYc,KAAKmF,KACjB,KAAYnF,KAAK0Q,GACjB,SAAY1Q,KAAKwL,OACjB,UAAYxL,KAAKia,QACjB,UAAYsB,EAAevb,KAAKoH,aAAUlI,GAElD,EAOAya,EAAMna,UAAU0E,QAAU,WAEtB,GAAIlE,KAAKyb,SACL,OAAOzb,KA6BX,QA3BuDd,KAAlDc,KAAK6N,YAAchL,EAAMQ,SAASrD,KAAKmF,QACxCnF,KAAKiF,cAAgBjF,KAAKwa,eAAiBxa,KAAKwa,eAAekB,OAAS1b,KAAK0b,QAAQC,iBAAiB3b,KAAKmF,MACvGnF,KAAKiF,wBAAwB6U,EAC7B9Z,KAAK6N,YAAc,KAEnB7N,KAAK6N,YAAc7N,KAAKiF,aAAahC,OAAOtE,OAAOuG,KAAKlF,KAAKiF,aAAahC,QAAQ,KAC/EjD,KAAKia,SAAWja,KAAKia,QAAQ2B,kBAEpC5b,KAAK6N,YAAc,MAInB7N,KAAKia,SAAsC,MAA3Bja,KAAKia,QAAiB,UACtCja,KAAK6N,YAAc7N,KAAKia,QAAiB,QACrCja,KAAKiF,wBAAwBJ,GAAoC,iBAArB7E,KAAK6N,cACjD7N,KAAK6N,YAAc7N,KAAKiF,aAAahC,OAAOjD,KAAK6N,eAIrD7N,KAAKia,eACuB/a,IAAxBc,KAAKia,QAAQxW,SAAwBzD,KAAKiF,cAAkBjF,KAAKiF,wBAAwBJ,UAClF7E,KAAKia,QAAQxW,OACnB9E,OAAOuG,KAAKlF,KAAKia,SAASxY,SAC3BzB,KAAKia,aAAU/a,IAInBc,KAAKuD,KACLvD,KAAK6N,YAAc/K,EAAKwX,KAAKuB,WAAW7b,KAAK6N,YAAqC,MAAxB7N,KAAKmF,KAAK0B,OAAO,IAGvElI,OAAOmd,QACPnd,OAAOmd,OAAO9b,KAAK6N,kBAEpB,GAAI7N,KAAK8O,OAAqC,iBAArB9O,KAAK6N,YAA0B,CAC3D,IAAI2B,EACA1M,EAAKiZ,OAAO5T,KAAKnI,KAAK6N,aACtB/K,EAAKiZ,OAAOC,OAAOhc,KAAK6N,YAAa2B,EAAM1M,EAAKmZ,UAAUnZ,EAAKiZ,OAAOta,OAAOzB,KAAK6N,cAAe,GAEjG/K,EAAK2M,KAAKC,MAAM1P,KAAK6N,YAAa2B,EAAM1M,EAAKmZ,UAAUnZ,EAAK2M,KAAKhO,OAAOzB,KAAK6N,cAAe,GAChG7N,KAAK6N,YAAc2B,CACvB,CAcA,OAXIxP,KAAKsE,IACLtE,KAAKqa,aAAevX,EAAKoZ,YACpBlc,KAAK0E,SACV1E,KAAKqa,aAAevX,EAAKQ,WAEzBtD,KAAKqa,aAAera,KAAK6N,YAGzB7N,KAAK0b,kBAAkB5B,IACvB9Z,KAAK0b,OAAOS,KAAK3c,UAAUQ,KAAKe,MAAQf,KAAKqa,cAE1CT,EAAiBpa,UAAU0E,QAAQjD,KAAKjB,KACnD,EAQA2Z,EAAMna,UAAU4c,0BAA4B,SAAmCzB,GAC3E,GAAgB,WAAZA,GAAoC,WAAZA,EACxB,MAAO,CAAC,EAGZ,IAAI0B,EAAW,CAAC,EAahB,OAZArc,KAAKkE,UACa,aAAdlE,KAAKga,OACLqC,EAAStB,eAAiB,mBAE1B/a,KAAKiF,wBAAwB6U,GAAQ9Z,KAAKiF,aAAaqX,QACvDD,EAASpB,iBAAmB,cAEC,IAA7Bjb,KAAKuc,UAAU,UACfF,EAASnB,wBAA0B,UACC,IAA7Blb,KAAKuc,UAAU,YACtBF,EAASnB,wBAA0B,YAEhCmB,CACX,EAKA1C,EAAMna,UAAUgd,iBAAmB,SAA0B7B,GACzD,OAAOf,EAAiBpa,UAAUgd,iBAAiBvb,KAAKjB,KAAMA,KAAK4a,UAAYD,EACnF,EAsBAhB,EAAM8C,EAAI,SAAuBC,EAASC,EAAWC,EAAWvC,GAU5D,MAPyB,mBAAdsC,EACPA,EAAY7Z,EAAK+Z,aAAaF,GAAW5b,KAGpC4b,GAAkC,iBAAdA,IACzBA,EAAY7Z,EAAKga,aAAaH,GAAW5b,MAEtC,SAAwBvB,EAAWud,GACtCja,EAAK+Z,aAAard,EAAU8P,aACvB0N,IAAI,IAAIrD,EAAMoD,EAAWL,EAASC,EAAWC,EAAW,CAAE,QAAWvC,IAC9E,CACJ,EAgBAV,EAAM/J,WAAa,SAAmBqN,GAClCnD,EAAOmD,CACX,6BCvbA,IAAIxN,EAAOnR,EAOXmR,EAAKhO,OAAS,SAAqB8O,GAG/B,IAFA,IAAInO,EAAM,EACN+E,EAAI,EACC5F,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,GACjC4F,EAAIoJ,EAAOlD,WAAW9L,IACd,IACJa,GAAO,EACF+E,EAAI,KACT/E,GAAO,EACe,QAAZ,MAAJ+E,IAAkE,QAAZ,MAA3BoJ,EAAOlD,WAAW9L,EAAI,OACrDA,EACFa,GAAO,GAEPA,GAAO,EAEf,OAAOA,CACX,EASAqN,EAAKyN,KAAO,SAAmBxK,EAAQ1L,EAAOC,GAE1C,GADUA,EAAMD,EACN,EACN,MAAO,GAKX,IAJA,IAGImW,EAHAC,EAAQ,KACRC,EAAQ,GACR9b,EAAI,EAEDyF,EAAQC,IACXkW,EAAIzK,EAAO1L,MACH,IACJqW,EAAM9b,KAAO4b,EACRA,EAAI,KAAOA,EAAI,IACpBE,EAAM9b,MAAY,GAAJ4b,IAAW,EAAsB,GAAlBzK,EAAO1L,KAC/BmW,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlBzK,EAAO1L,OAAkB,IAAwB,GAAlB0L,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,MAAiB,MAC1GqW,EAAM9b,KAAO,OAAU4b,GAAK,IAC5BE,EAAM9b,KAAO,OAAc,KAAJ4b,IAEvBE,EAAM9b,MAAY,GAAJ4b,IAAW,IAAwB,GAAlBzK,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,KACnEzF,EAAI,QACH6b,IAAUA,EAAQ,KAAK5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,IAC/D9b,EAAI,GAGZ,OAAI6b,GACI7b,GACA6b,EAAM5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,KACzD6b,EAAMvV,KAAK,KAEfmH,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,GAC5D,EASAkO,EAAKC,MAAQ,SAAoBa,EAAQmC,EAAQxP,GAI7C,IAHA,IACI8S,EACAC,EAFAjP,EAAQ9D,EAGH3B,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,GACjCyU,EAAKzF,EAAOlD,WAAW9L,IACd,IACLmR,EAAOxP,KAAY8S,EACZA,EAAK,MACZtD,EAAOxP,KAAY8S,GAAM,EAAU,IACnCtD,EAAOxP,KAAuB,GAAX8S,EAAgB,KACV,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAK1F,EAAOlD,WAAW9L,EAAI,MAChEyU,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtC1U,EACFmR,EAAOxP,KAAY8S,GAAM,GAAU,IACnCtD,EAAOxP,KAAY8S,GAAM,GAAK,GAAK,IACnCtD,EAAOxP,KAAY8S,GAAM,EAAK,GAAK,IACnCtD,EAAOxP,KAAuB,GAAX8S,EAAgB,MAEnCtD,EAAOxP,KAAY8S,GAAM,GAAU,IACnCtD,EAAOxP,KAAY8S,GAAM,EAAK,GAAK,IACnCtD,EAAOxP,KAAuB,GAAX8S,EAAgB,KAG3C,OAAO9S,EAAS8D,CACpB,+BCvGA3I,EAAOC,QAAUgf,EAGjB,IAAI1D,EAAmB,EAAQ,QAC7B0D,EAAM9d,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAcgO,GAAOzD,UAAY,QAEhG,IAAIF,EAAQ,EAAQ,MAChB7W,EAAQ,EAAQ,MAYpB,SAASwa,EAAMvc,EAAMwc,EAAYtD,EAAS7S,GAQtC,GAPKzF,MAAM2Q,QAAQiL,KACftD,EAAUsD,EACVA,OAAare,GAEjB0a,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,QAGb/a,IAAfqe,IAA4B5b,MAAM2Q,QAAQiL,GAC5C,MAAMnd,UAAU,+BAMpBJ,KAAKwd,MAAQD,GAAc,GAO3Bvd,KAAK+D,YAAc,GAMnB/D,KAAKoH,QAAUA,CACnB,CAyCA,SAASqW,EAAkBD,GACvB,GAAIA,EAAM9B,OACN,IAAK,IAAIna,EAAI,EAAGA,EAAIic,EAAMzZ,YAAYtC,SAAUF,EACvCic,EAAMzZ,YAAYxC,GAAGma,QACtB8B,EAAM9B,OAAOsB,IAAIQ,EAAMzZ,YAAYxC,GACnD,CA9BA+b,EAAM7C,SAAW,SAAkB1Z,EAAM2Z,GACrC,OAAO,IAAI4C,EAAMvc,EAAM2Z,EAAK8C,MAAO9C,EAAKT,QAASS,EAAKtT,QAC1D,EAOAkW,EAAM9d,UAAU6b,OAAS,SAAgBC,GACrC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKia,QACjB,QAAYja,KAAKwd,MACjB,UAAYjC,EAAevb,KAAKoH,aAAUlI,GAElD,EAqBAoe,EAAM9d,UAAUwd,IAAM,SAAahZ,GAG/B,KAAMA,aAAiB2V,GACnB,MAAMvZ,UAAU,yBAQpB,OANI4D,EAAM0X,QAAU1X,EAAM0X,SAAW1b,KAAK0b,QACtC1X,EAAM0X,OAAOvc,OAAO6E,GACxBhE,KAAKwd,MAAMhd,KAAKwD,EAAMjD,MACtBf,KAAK+D,YAAYvD,KAAKwD,GACtBA,EAAMW,OAAS3E,KACfyd,EAAkBzd,MACXA,IACX,EAOAsd,EAAM9d,UAAUL,OAAS,SAAgB6E,GAGrC,KAAMA,aAAiB2V,GACnB,MAAMvZ,UAAU,yBAEpB,IAAIyK,EAAQ7K,KAAK+D,YAAYoL,QAAQnL,GAGrC,GAAI6G,EAAQ,EACR,MAAMrM,MAAMwF,EAAQ,uBAAyBhE,MAUjD,OARAA,KAAK+D,YAAYmH,OAAOL,EAAO,IAC/BA,EAAQ7K,KAAKwd,MAAMrO,QAAQnL,EAAMjD,QAGpB,GACTf,KAAKwd,MAAMtS,OAAOL,EAAO,GAE7B7G,EAAMW,OAAS,KACR3E,IACX,EAKAsd,EAAM9d,UAAUke,MAAQ,SAAehC,GACnC9B,EAAiBpa,UAAUke,MAAMzc,KAAKjB,KAAM0b,GAG5C,IAFA,IAESna,EAAI,EAAGA,EAAIvB,KAAKwd,MAAM/b,SAAUF,EAAG,CACxC,IAAIyC,EAAQ0X,EAAOtc,IAAIY,KAAKwd,MAAMjc,IAC9ByC,IAAUA,EAAMW,SAChBX,EAAMW,OALH3E,UAME+D,YAAYvD,KAAKwD,GAE9B,CAEAyZ,EAAkBzd,KACtB,EAKAsd,EAAM9d,UAAUme,SAAW,SAAkBjC,GACzC,IAAK,IAAW1X,EAAPzC,EAAI,EAAUA,EAAIvB,KAAK+D,YAAYtC,SAAUF,GAC7CyC,EAAQhE,KAAK+D,YAAYxC,IAAIma,QAC9B1X,EAAM0X,OAAOvc,OAAO6E,GAC5B4V,EAAiBpa,UAAUme,SAAS1c,KAAKjB,KAAM0b,EACnD,EAUA/c,OAAO0K,eAAeiU,EAAM9d,UAAW,mBAAoB,CACvDJ,IAAK,WACD,GAAwB,MAApBY,KAAK+D,aAAmD,IAA5B/D,KAAK+D,YAAYtC,OAC7C,OAAO,EAGX,IAAIuC,EAAQhE,KAAK+D,YAAY,GAC7B,OAAwB,MAAjBC,EAAMiW,UAAwD,IAArCjW,EAAMiW,QAAyB,eACnE,IAmBJqD,EAAMb,EAAI,WAGN,IAFA,IAAIc,EAAa,IAAI5b,MAAMU,UAAUZ,QACjCoJ,EAAQ,EACLA,EAAQxI,UAAUZ,QACrB8b,EAAW1S,GAASxI,UAAUwI,KAClC,OAAO,SAAwBrL,EAAWoe,GACtC9a,EAAK+Z,aAAard,EAAU8P,aACvB0N,IAAI,IAAIM,EAAMM,EAAWL,IAC9B5e,OAAO0K,eAAe7J,EAAWoe,EAAW,CACxCxe,IAAK0D,EAAK+a,YAAYN,GACtBje,IAAKwD,EAAKgb,YAAYP,IAE9B,CACJ,+BC5NAlf,EAAOC,QAAUyf,EAEjB,IAAIjb,EAAO,EAAQ,MAUnB,SAASib,EAASC,EAAIC,GASlBje,KAAKge,GAAKA,IAAO,EAMjBhe,KAAKie,GAAKA,IAAO,CACrB,CAOA,IAAIC,EAAOH,EAASG,KAAO,IAAIH,EAAS,EAAG,GAE3CG,EAAKrP,SAAW,WAAa,OAAO,CAAG,EACvCqP,EAAKC,SAAWD,EAAKE,SAAW,WAAa,OAAOpe,IAAM,EAC1Dke,EAAKzc,OAAS,WAAa,OAAO,CAAG,EAOrC,IAAI4c,EAAWN,EAASM,SAAW,mBAOnCN,EAASlC,WAAa,SAAoB7c,GACtC,GAAc,IAAVA,EACA,OAAOkf,EACX,IAAII,EAAOtf,EAAQ,EACfsf,IACAtf,GAASA,GACb,IAAIgf,EAAKhf,IAAU,EACfif,GAAMjf,EAAQgf,GAAM,aAAe,EAUvC,OATIM,IACAL,GAAMA,IAAO,EACbD,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACCC,EAAK,aACPA,EAAK,KAGV,IAAIF,EAASC,EAAIC,EAC5B,EAOAF,EAASQ,KAAO,SAAcvf,GAC1B,GAAqB,iBAAVA,EACP,OAAO+e,EAASlC,WAAW7c,GAC/B,GAAI8D,EAAKqN,SAASnR,GAAQ,CAEtB,IAAI8D,EAAKwX,KAGL,OAAOyD,EAASlC,WAAW2C,SAASxf,EAAO,KAF3CA,EAAQ8D,EAAKwX,KAAKmE,WAAWzf,EAGrC,CACA,OAAOA,EAAM0P,KAAO1P,EAAM2P,KAAO,IAAIoP,EAAS/e,EAAM0P,MAAQ,EAAG1P,EAAM2P,OAAS,GAAKuP,CACvF,EAOAH,EAASve,UAAUqP,SAAW,SAAkBD,GAC5C,IAAKA,GAAY5O,KAAKie,KAAO,GAAI,CAC7B,IAAID,EAAgB,GAAVhe,KAAKge,KAAW,EACtBC,GAAMje,KAAKie,KAAW,EAG1B,OAFKD,IACDC,EAAKA,EAAK,IAAM,KACXD,EAAU,WAALC,EAClB,CACA,OAAOje,KAAKge,GAAe,WAAVhe,KAAKie,EAC1B,EAOAF,EAASve,UAAUkf,OAAS,SAAgB9P,GACxC,OAAO9L,EAAKwX,KACN,IAAIxX,EAAKwX,KAAe,EAAVta,KAAKge,GAAkB,EAAVhe,KAAKie,GAAQnR,QAAQ8B,IAEhD,CAAEF,IAAe,EAAV1O,KAAKge,GAAQrP,KAAgB,EAAV3O,KAAKie,GAAQrP,SAAU9B,QAAQ8B,GACnE,EAEA,IAAIvB,EAAa2B,OAAOxP,UAAU6N,WAOlC0Q,EAASY,SAAW,SAAkBvR,GAClC,OAAIA,IAASiR,EACFH,EACJ,IAAIH,GACL1Q,EAAWpM,KAAKmM,EAAM,GACtBC,EAAWpM,KAAKmM,EAAM,IAAM,EAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,GAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,MAAQ,GAEpCC,EAAWpM,KAAKmM,EAAM,GACtBC,EAAWpM,KAAKmM,EAAM,IAAM,EAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,GAC5BC,EAAWpM,KAAKmM,EAAM,IAAM,MAAQ,EAE9C,EAMA2Q,EAASve,UAAUof,OAAS,WACxB,OAAO5P,OAAOC,aACO,IAAjBjP,KAAKge,GACLhe,KAAKge,KAAO,EAAK,IACjBhe,KAAKge,KAAO,GAAK,IACjBhe,KAAKge,KAAO,GACK,IAAjBhe,KAAKie,GACLje,KAAKie,KAAO,EAAK,IACjBje,KAAKie,KAAO,GAAK,IACjBje,KAAKie,KAAO,GAEpB,EAMAF,EAASve,UAAU2e,SAAW,WAC1B,IAAIU,EAAS7e,KAAKie,IAAM,GAGxB,OAFAje,KAAKie,KAAQje,KAAKie,IAAM,EAAIje,KAAKge,KAAO,IAAMa,KAAU,EACxD7e,KAAKge,IAAQhe,KAAKge,IAAM,EAAsBa,KAAU,EACjD7e,IACX,EAMA+d,EAASve,UAAU4e,SAAW,WAC1B,IAAIS,IAAmB,EAAV7e,KAAKge,IAGlB,OAFAhe,KAAKge,KAAQhe,KAAKge,KAAO,EAAIhe,KAAKie,IAAM,IAAMY,KAAU,EACxD7e,KAAKie,IAAQje,KAAKie,KAAO,EAAqBY,KAAU,EACjD7e,IACX,EAMA+d,EAASve,UAAUiC,OAAS,WACxB,IAAIqd,EAAS9e,KAAKge,GACde,GAAS/e,KAAKge,KAAO,GAAKhe,KAAKie,IAAM,KAAO,EAC5Ce,EAAShf,KAAKie,KAAO,GACzB,OAAiB,IAAVe,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,+BCpMA3gB,EAAOC,QAAU,EAAjB,mCCFAD,EAAOC,QAAU2gB,EAEjB,IAAInc,EAAO,EAAQ,MASnB,SAASmc,EAAQC,GAEb,GAAIA,EACA,IAAK,IAAIha,EAAOvG,OAAOuG,KAAKga,GAAa3d,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAC/DvB,KAAKkF,EAAK3D,IAAM2d,EAAWha,EAAK3D,GAC5C,CAyBA0d,EAAQrgB,OAAS,SAAgBsgB,GAC7B,OAAOlf,KAAKmf,MAAMvgB,OAAOsgB,EAC7B,EAUAD,EAAQ/J,OAAS,SAAgB1I,EAAS4S,GACtC,OAAOpf,KAAKmf,MAAMjK,OAAO1I,EAAS4S,EACtC,EAUAH,EAAQI,gBAAkB,SAAyB7S,EAAS4S,GACxD,OAAOpf,KAAKmf,MAAME,gBAAgB7S,EAAS4S,EAC/C,EAWAH,EAAQjD,OAAS,SAAgBsD,GAC7B,OAAOtf,KAAKmf,MAAMnD,OAAOsD,EAC7B,EAWAL,EAAQM,gBAAkB,SAAyBD,GAC/C,OAAOtf,KAAKmf,MAAMI,gBAAgBD,EACtC,EASAL,EAAQO,OAAS,SAAgBhT,GAC7B,OAAOxM,KAAKmf,MAAMK,OAAOhT,EAC7B,EASAyS,EAAQhR,WAAa,SAAoBwR,GACrC,OAAOzf,KAAKmf,MAAMlR,WAAWwR,EACjC,EAUAR,EAAQ9Q,SAAW,SAAkB3B,EAASyN,GAC1C,OAAOja,KAAKmf,MAAMhR,SAAS3B,EAASyN,EACxC,EAMAgF,EAAQzf,UAAU6b,OAAS,WACvB,OAAOrb,KAAKmf,MAAMhR,SAASnO,KAAM8C,EAAKwY,cAC1C,+BCvIAjd,EAAOC,QAAUohB,EAGjB,IAAIC,EAAS,EAAQ,OACpBD,EAAalgB,UAAYb,OAAOC,OAAO+gB,EAAOngB,YAAY8P,YAAcoQ,EAEzE,IAAI5c,EAAO,EAAQ,MASnB,SAAS4c,EAAahN,GAClBiN,EAAO1e,KAAKjB,KAAM0S,EAOtB,CAEAgN,EAAa9P,WAAa,WAElB9M,EAAKkN,SACL0P,EAAalgB,UAAUogB,OAAS9c,EAAKkN,OAAOxQ,UAAU0B,MAC9D,EAMAwe,EAAalgB,UAAU+Q,OAAS,WAC5B,IAAInO,EAAMpC,KAAKqQ,SACf,OAAOrQ,KAAKwP,IAAIqQ,UACV7f,KAAKwP,IAAIqQ,UAAU7f,KAAK8G,IAAK9G,KAAK8G,IAAMmC,KAAKC,IAAIlJ,KAAK8G,IAAM1E,EAAKpC,KAAKoC,MACtEpC,KAAKwP,IAAInJ,SAAS,QAASrG,KAAK8G,IAAK9G,KAAK8G,IAAMmC,KAAKC,IAAIlJ,KAAK8G,IAAM1E,EAAKpC,KAAKoC,KACxF,EASAsd,EAAa9P,0CC5Cb,IAIIkK,EACAjV,EALA/B,EAAOzE,EAAOC,QAAU,EAAjB,MAEPwhB,EAAQ,EAAQ,MAKpBhd,EAAKc,QAAU,EAAQ,MACvBd,EAAKid,MAAU,EAAQ,MACvBjd,EAAKkd,KAAU,EAAQ,MAMvBld,EAAKmd,GAAKnd,EAAKod,QAAQ,MAOvBpd,EAAKqd,QAAU,SAAiBV,GAC5B,GAAIA,EAAQ,CAIR,IAHA,IAAIva,EAAQvG,OAAOuG,KAAKua,GACpB3M,EAAQ,IAAInR,MAAMuD,EAAKzD,QACvBoJ,EAAQ,EACLA,EAAQ3F,EAAKzD,QAChBqR,EAAMjI,GAAS4U,EAAOva,EAAK2F,MAC/B,OAAOiI,CACX,CACA,MAAO,EACX,EAOAhQ,EAAKqL,SAAW,SAAkB2E,GAG9B,IAFA,IAAI2M,EAAS,CAAC,EACV5U,EAAS,EACNA,EAAQiI,EAAMrR,QAAQ,CACzB,IAAI1C,EAAM+T,EAAMjI,KACZI,EAAM6H,EAAMjI,UACJ3L,IAAR+L,IACAwU,EAAO1gB,GAAOkM,EACtB,CACA,OAAOwU,CACX,EAEA,IAAIW,EAAsB,MACtBC,EAAsB,KAO1Bvd,EAAKwd,WAAa,SAAoBvf,GAClC,MAAO,uTAAuToH,KAAKpH,EACvU,EAOA+B,EAAKsB,SAAW,SAAkBuJ,GAC9B,OAAK,YAAYxF,KAAKwF,IAAS7K,EAAKwd,WAAW3S,GACpC,KAAQA,EAAK3H,QAAQoa,EAAqB,QAAQpa,QAAQqa,EAAiB,OAAU,KACzF,IAAM1S,CACjB,EAOA7K,EAAKyd,QAAU,SAAiBxa,GAC5B,OAAOA,EAAIc,OAAO,GAAG2Z,cAAgBza,EAAI0B,UAAU,EACvD,EAEA,IAAIgZ,EAAc,YAOlB3d,EAAK4d,UAAY,SAAmB3a,GAChC,OAAOA,EAAI0B,UAAU,EAAG,GACjB1B,EAAI0B,UAAU,GACTzB,QAAQya,GAAa,SAASxa,EAAIC,GAAM,OAAOA,EAAGsa,aAAe,GACjF,EAQA1d,EAAKuL,kBAAoB,SAA2BsS,EAAGC,GACnD,OAAOD,EAAEjQ,GAAKkQ,EAAElQ,EACpB,EAUA5N,EAAK+Z,aAAe,SAAsBV,EAAM0E,GAG5C,GAAI1E,EAAKgD,MAML,OALI0B,GAAY1E,EAAKgD,MAAMpe,OAAS8f,IAChC/d,EAAKge,aAAa3hB,OAAOgd,EAAKgD,OAC9BhD,EAAKgD,MAAMpe,KAAO8f,EAClB/d,EAAKge,aAAa9D,IAAIb,EAAKgD,QAExBhD,EAAKgD,MAIXrF,IACDA,EAAO,EAAQ,OAEnB,IAAI3U,EAAO,IAAI2U,EAAK+G,GAAY1E,EAAKpb,MAKrC,OAJA+B,EAAKge,aAAa9D,IAAI7X,GACtBA,EAAKgX,KAAOA,EACZxd,OAAO0K,eAAe8S,EAAM,QAAS,CAAEnd,MAAOmG,EAAMuG,YAAY,IAChE/M,OAAO0K,eAAe8S,EAAK3c,UAAW,QAAS,CAAER,MAAOmG,EAAMuG,YAAY,IACnEvG,CACX,EAEA,IAAI4b,EAAoB,EAOxBje,EAAKga,aAAe,SAAsB2C,GAGtC,GAAIA,EAAON,MACP,OAAOM,EAAON,MAGbta,IACDA,EAAO,EAAQ,OAEnB,IAAImc,EAAM,IAAInc,EAAK,OAASkc,IAAqBtB,GAGjD,OAFA3c,EAAKge,aAAa9D,IAAIgE,GACtBriB,OAAO0K,eAAeoW,EAAQ,QAAS,CAAEzgB,MAAOgiB,EAAKtV,YAAY,IAC1DsV,CACX,EAWAle,EAAKme,YAAc,SAAqBC,EAAKlB,EAAMhhB,EAAOoc,GAmBtD,GAAmB,iBAAR8F,EACP,MAAM9gB,UAAU,yBACpB,IAAK4f,EACD,MAAM5f,UAAU,0BAGpB,OAxBA,SAAS+gB,EAAQD,EAAKlB,EAAMhhB,GACxB,IAAIoiB,EAAOpB,EAAK1X,QAChB,GAAa,cAAT8Y,GAAiC,cAATA,EAC1B,OAAOF,EAET,GAAIlB,EAAKve,OAAS,EACdyf,EAAIE,GAAQD,EAAQD,EAAIE,IAAS,CAAC,EAAGpB,EAAMhhB,OACxC,CACH,IAAIqiB,EAAYH,EAAIE,GACpB,GAAIC,GAAajG,EACb,OAAO8F,EACPG,IACAriB,EAAQ,GAAGoC,OAAOigB,GAAWjgB,OAAOpC,IACxCkiB,EAAIE,GAAQpiB,CAChB,CACA,OAAOkiB,CACX,CAQOC,CAAQD,EADflB,EAAOA,EAAKtY,MAAM,KACQ1I,EAC9B,EAQAL,OAAO0K,eAAevG,EAAM,eAAgB,CACxC1D,IAAK,WACD,OAAO0gB,EAAiB,YAAMA,EAAiB,UAAI,IAAK,EAAQ,OACpE,iCCpNJzhB,EAAOC,QAAU+Q,EAEjB,IAEID,EAFAtM,EAAY,EAAQ,MAIpBib,EAAYjb,EAAKib,SACjBhC,EAAYjZ,EAAKiZ,OACjBtM,EAAY3M,EAAK2M,KAWrB,SAAS6R,EAAGzhB,EAAIuC,EAAK6I,GAMjBjL,KAAKH,GAAKA,EAMVG,KAAKoC,IAAMA,EAMXpC,KAAKqI,UAAOnJ,EAMZc,KAAKiL,IAAMA,CACf,CAGA,SAASsW,IAAQ,CAUjB,SAASC,EAAMpC,GAMXpf,KAAKyhB,KAAOrC,EAAOqC,KAMnBzhB,KAAK0hB,KAAOtC,EAAOsC,KAMnB1hB,KAAKoC,IAAMgd,EAAOhd,IAMlBpC,KAAKqI,KAAO+W,EAAOuC,MACvB,CAOA,SAAStS,IAMLrP,KAAKoC,IAAM,EAMXpC,KAAKyhB,KAAO,IAAIH,EAAGC,EAAM,EAAG,GAM5BvhB,KAAK0hB,KAAO1hB,KAAKyhB,KAMjBzhB,KAAK2hB,OAAS,IAOlB,CAEA,IAAI/iB,EAAS,WACT,OAAOkE,EAAKkN,OACN,WACE,OAAQX,EAAOzQ,OAAS,WACpB,OAAO,IAAIwQ,CACf,IACJ,EAEE,WACE,OAAO,IAAIC,CACf,CACR,EAqCA,SAASuS,EAAU3W,EAAKuE,EAAK1I,GACzB0I,EAAI1I,GAAa,IAANmE,CACf,CAmBA,SAAS4W,EAASzf,EAAK6I,GACnBjL,KAAKoC,IAAMA,EACXpC,KAAKqI,UAAOnJ,EACZc,KAAKiL,IAAMA,CACf,CA6CA,SAAS6W,EAAc7W,EAAKuE,EAAK1I,GAC7B,KAAOmE,EAAIgT,IACPzO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,IAAM/S,EAAI+S,KAAO,EAAI/S,EAAIgT,IAAM,MAAQ,EAC3ChT,EAAIgT,MAAQ,EAEhB,KAAOhT,EAAI+S,GAAK,KACZxO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,GAAK/S,EAAI+S,KAAO,EAExBxO,EAAI1I,KAASmE,EAAI+S,EACrB,CA0CA,SAAS+D,EAAa9W,EAAKuE,EAAK1I,GAC5B0I,EAAI1I,GAA0B,IAAdmE,EAChBuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAAM,IAC9BuE,EAAI1I,EAAM,GAAMmE,IAAQ,GAAM,IAC9BuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAC5B,CA9JAoE,EAAOzQ,OAASA,IAOhByQ,EAAOQ,MAAQ,SAAepR,GAC1B,OAAO,IAAIqE,EAAKnB,MAAMlD,EAC1B,EAIIqE,EAAKnB,QAAUA,QACf0N,EAAOQ,MAAQ/M,EAAKkf,KAAK3S,EAAOQ,MAAO/M,EAAKnB,MAAMnC,UAAUyiB,WAUhE5S,EAAO7P,UAAU8Q,MAAQ,SAAczQ,EAAIuC,EAAK6I,GAG5C,OAFAjL,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIiZ,EAAGzhB,EAAIuC,EAAK6I,GAC7CjL,KAAKoC,KAAOA,EACLpC,IACX,EA6BA6hB,EAASriB,UAAYb,OAAOC,OAAO0iB,EAAG9hB,WACtCqiB,EAASriB,UAAUK,GAxBnB,SAAuBoL,EAAKuE,EAAK1I,GAC7B,KAAOmE,EAAM,KACTuE,EAAI1I,KAAe,IAANmE,EAAY,IACzBA,KAAS,EAEbuE,EAAI1I,GAAOmE,CACf,EAyBAoE,EAAO7P,UAAU6Q,OAAS,SAAsBrR,GAW5C,OARAgB,KAAKoC,MAAQpC,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIwZ,GACzC7iB,KAAkB,GACT,IAAY,EACpBA,EAAQ,MAAY,EACpBA,EAAQ,QAAY,EACpBA,EAAQ,UAAY,EACA,EAC1BA,IAAQoD,IACDpC,IACX,EAQAqP,EAAO7P,UAAU0iB,MAAQ,SAAqBljB,GAC1C,OAAOA,EAAQ,EACTgB,KAAKsQ,MAAMwR,EAAe,GAAI/D,EAASlC,WAAW7c,IAClDgB,KAAKqQ,OAAOrR,EACtB,EAOAqQ,EAAO7P,UAAU2iB,OAAS,SAAsBnjB,GAC5C,OAAOgB,KAAKqQ,QAAQrR,GAAS,EAAIA,GAAS,MAAQ,EACtD,EAqBAqQ,EAAO7P,UAAU4iB,OAAS,SAAsBpjB,GAC5C,IAAIiU,EAAO8K,EAASQ,KAAKvf,GACzB,OAAOgB,KAAKsQ,MAAMwR,EAAe7O,EAAKxR,SAAUwR,EACpD,EASA5D,EAAO7P,UAAU6iB,MAAQhT,EAAO7P,UAAU4iB,OAQ1C/S,EAAO7P,UAAU8iB,OAAS,SAAsBtjB,GAC5C,IAAIiU,EAAO8K,EAASQ,KAAKvf,GAAOmf,WAChC,OAAOne,KAAKsQ,MAAMwR,EAAe7O,EAAKxR,SAAUwR,EACpD,EAOA5D,EAAO7P,UAAU+iB,KAAO,SAAoBvjB,GACxC,OAAOgB,KAAKsQ,MAAMsR,EAAW,EAAG5iB,EAAQ,EAAI,EAChD,EAcAqQ,EAAO7P,UAAUgjB,QAAU,SAAuBxjB,GAC9C,OAAOgB,KAAKsQ,MAAMyR,EAAc,EAAG/iB,IAAU,EACjD,EAQAqQ,EAAO7P,UAAUijB,SAAWpT,EAAO7P,UAAUgjB,QAQ7CnT,EAAO7P,UAAUkjB,QAAU,SAAuB1jB,GAC9C,IAAIiU,EAAO8K,EAASQ,KAAKvf,GACzB,OAAOgB,KAAKsQ,MAAMyR,EAAc,EAAG9O,EAAK+K,IAAI1N,MAAMyR,EAAc,EAAG9O,EAAKgL,GAC5E,EASA5O,EAAO7P,UAAUmjB,SAAWtT,EAAO7P,UAAUkjB,QAQ7CrT,EAAO7P,UAAUojB,MAAQ,SAAqB5jB,GAC1C,OAAOgB,KAAKsQ,MAAMxN,EAAK8f,MAAMC,aAAc,EAAG7jB,EAClD,EAQAqQ,EAAO7P,UAAUsjB,OAAS,SAAsB9jB,GAC5C,OAAOgB,KAAKsQ,MAAMxN,EAAK8f,MAAMG,cAAe,EAAG/jB,EACnD,EAEA,IAAIgkB,EAAalgB,EAAKnB,MAAMnC,UAAUF,IAChC,SAAwB2L,EAAKuE,EAAK1I,GAChC0I,EAAIlQ,IAAI2L,EAAKnE,EACjB,EAEE,SAAwBmE,EAAKuE,EAAK1I,GAChC,IAAK,IAAIvF,EAAI,EAAGA,EAAI0J,EAAIxJ,SAAUF,EAC9BiO,EAAI1I,EAAMvF,GAAK0J,EAAI1J,EAC3B,EAOJ8N,EAAO7P,UAAUsP,MAAQ,SAAqB9P,GAC1C,IAAIoD,EAAMpD,EAAMyC,SAAW,EAC3B,IAAKW,EACD,OAAOpC,KAAKsQ,MAAMsR,EAAW,EAAG,GACpC,GAAI9e,EAAKqN,SAASnR,GAAQ,CACtB,IAAIwQ,EAAMH,EAAOQ,MAAMzN,EAAM2Z,EAAOta,OAAOzC,IAC3C+c,EAAOC,OAAOhd,EAAOwQ,EAAK,GAC1BxQ,EAAQwQ,CACZ,CACA,OAAOxP,KAAKqQ,OAAOjO,GAAKkO,MAAM0S,EAAY5gB,EAAKpD,EACnD,EAOAqQ,EAAO7P,UAAU+Q,OAAS,SAAsBvR,GAC5C,IAAIoD,EAAMqN,EAAKhO,OAAOzC,GACtB,OAAOoD,EACDpC,KAAKqQ,OAAOjO,GAAKkO,MAAMb,EAAKC,MAAOtN,EAAKpD,GACxCgB,KAAKsQ,MAAMsR,EAAW,EAAG,EACnC,EAOAvS,EAAO7P,UAAUyjB,KAAO,WAIpB,OAHAjjB,KAAK2hB,OAAS,IAAIH,EAAMxhB,MACxBA,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,EAAGC,EAAM,EAAG,GACxCvhB,KAAKoC,IAAM,EACJpC,IACX,EAMAqP,EAAO7P,UAAU+U,MAAQ,WAUrB,OATIvU,KAAK2hB,QACL3hB,KAAKyhB,KAASzhB,KAAK2hB,OAAOF,KAC1BzhB,KAAK0hB,KAAS1hB,KAAK2hB,OAAOD,KAC1B1hB,KAAKoC,IAASpC,KAAK2hB,OAAOvf,IAC1BpC,KAAK2hB,OAAS3hB,KAAK2hB,OAAOtZ,OAE1BrI,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,EAAGC,EAAM,EAAG,GACxCvhB,KAAKoC,IAAO,GAETpC,IACX,EAMAqP,EAAO7P,UAAU0jB,OAAS,WACtB,IAAIzB,EAAOzhB,KAAKyhB,KACZC,EAAO1hB,KAAK0hB,KACZtf,EAAOpC,KAAKoC,IAOhB,OANApC,KAAKuU,QAAQlE,OAAOjO,GAChBA,IACApC,KAAK0hB,KAAKrZ,KAAOoZ,EAAKpZ,KACtBrI,KAAK0hB,KAAOA,EACZ1hB,KAAKoC,KAAOA,GAETpC,IACX,EAMAqP,EAAO7P,UAAU2jB,OAAS,WAItB,IAHA,IAAI1B,EAAOzhB,KAAKyhB,KAAKpZ,KACjBmH,EAAOxP,KAAKsP,YAAYO,MAAM7P,KAAKoC,KACnC0E,EAAO,EACJ2a,GACHA,EAAK5hB,GAAG4hB,EAAKxW,IAAKuE,EAAK1I,GACvBA,GAAO2a,EAAKrf,IACZqf,EAAOA,EAAKpZ,KAGhB,OAAOmH,CACX,EAEAH,EAAOO,WAAa,SAASwT,GACzBhU,EAAegU,EACf/T,EAAOzQ,OAASA,IAChBwQ,EAAaQ,YACjB,qCC/cA,IAAI9M,EAAOxE,EA2OX,SAAS+kB,EAAMnC,EAAKoC,EAAKlI,GACrB,IAAK,IAAIlW,EAAOvG,OAAOuG,KAAKoe,GAAM/hB,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,OACnCrC,IAAjBgiB,EAAIhc,EAAK3D,KAAsB6Z,IAC/B8F,EAAIhc,EAAK3D,IAAM+hB,EAAIpe,EAAK3D,KAChC,OAAO2f,CACX,CAmBA,SAASqC,EAASxiB,GAEd,SAASyiB,EAAYhX,EAAS0S,GAE1B,KAAMlf,gBAAgBwjB,GAClB,OAAO,IAAIA,EAAYhX,EAAS0S,GAKpCvgB,OAAO0K,eAAerJ,KAAM,UAAW,CAAEZ,IAAK,WAAa,OAAOoN,CAAS,IAGvEhO,MAAMilB,kBACNjlB,MAAMilB,kBAAkBzjB,KAAMwjB,GAE9B7kB,OAAO0K,eAAerJ,KAAM,QAAS,CAAEhB,OAAO,IAAIR,OAAQiI,OAAS,KAEnEyY,GACAmE,EAAMrjB,KAAMkf,EACpB,CA2BA,OAzBAsE,EAAYhkB,UAAYb,OAAOC,OAAOJ,MAAMgB,UAAW,CACnD8P,YAAa,CACTtQ,MAAOwkB,EACPE,UAAU,EACVhY,YAAY,EACZC,cAAc,GAElB5K,KAAM,CACF3B,IAAK,WAAiB,OAAO2B,CAAM,EACnCzB,SAAKJ,EACLwM,YAAY,EAKZC,cAAc,GAElBtF,SAAU,CACNrH,MAAO,WAAmB,OAAOgB,KAAKe,KAAO,KAAOf,KAAKwM,OAAS,EAClEkX,UAAU,EACVhY,YAAY,EACZC,cAAc,KAIf6X,CACX,CAhTA1gB,EAAK6gB,UAAY,EAAQ,MAGzB7gB,EAAKiZ,OAAS,EAAQ,MAGtBjZ,EAAKnC,aAAe,EAAQ,MAG5BmC,EAAK8f,MAAQ,EAAQ,MAGrB9f,EAAKod,QAAU,EAAQ,MAGvBpd,EAAK2M,KAAO,EAAQ,MAGpB3M,EAAKkf,KAAO,EAAQ,MAGpBlf,EAAKib,SAAW,EAAQ,MAOxBjb,EAAK8gB,OAAS9W,QAA0B,oBAAXyE,QACPA,QACAA,OAAOH,SACPG,OAAOH,QAAQC,UACfE,OAAOH,QAAQC,SAASC,MAO9CxO,EAAKyO,OAASzO,EAAK8gB,QAAUrS,QACG,oBAAXR,QAA0BA,QACf,oBAAXzG,MAA0BA,MACjCtK,KAQd8C,EAAKQ,WAAa3E,OAAOmd,OAASnd,OAAOmd,OAAO,IAAiC,GAOjFhZ,EAAKoZ,YAAcvd,OAAOmd,OAASnd,OAAOmd,OAAO,CAAC,GAAgC,CAAC,EAQnFhZ,EAAKqX,UAAY5P,OAAO4P,WAAwC,SAAmBnb,GAC/E,MAAwB,iBAAVA,GAAsB6kB,SAAS7kB,IAAUiK,KAAK6a,MAAM9kB,KAAWA,CACjF,EAOA8D,EAAKqN,SAAW,SAAkBnR,GAC9B,MAAwB,iBAAVA,GAAsBA,aAAiBgQ,MACzD,EAOAlM,EAAKoX,SAAW,SAAkBlb,GAC9B,OAAOA,GAA0B,iBAAVA,CAC3B,EAUA8D,EAAKihB,MAQLjhB,EAAKkhB,MAAQ,SAAezR,EAAK5E,GAC7B,IAAI3O,EAAQuT,EAAI5E,GAChB,QAAa,MAAT3O,IAAiBuT,EAAI9S,eAAekO,MACZ,iBAAV3O,IAAuB2C,MAAM2Q,QAAQtT,GAASA,EAAMyC,OAAS9C,OAAOuG,KAAKlG,GAAOyC,QAAU,EAEhH,EAaAqB,EAAKkN,OAAS,WACV,IACI,IAAIA,EAASlN,EAAKod,QAAQ,UAAUlQ,OAEpC,OAAOA,EAAOxQ,UAAUmQ,UAAYK,EAAoC,IAC5E,CAAE,MAAOiU,GAEL,OAAO,IACX,CACH,CATa,GAYdnhB,EAAKsN,aAAe,KAGpBtN,EAAKgN,oBAAsB,KAO3BhN,EAAKmZ,UAAY,SAAmBiI,GAEhC,MAA8B,iBAAhBA,EACRphB,EAAKkN,OACDlN,EAAKgN,oBAAoBoU,GACzB,IAAIphB,EAAKnB,MAAMuiB,GACnBphB,EAAKkN,OACDlN,EAAKsN,aAAa8T,GACI,oBAAfjU,WACHiU,EACA,IAAIjU,WAAWiU,EACjC,EAMAphB,EAAKnB,MAA8B,oBAAfsO,WAA6BA,WAAwCtO,MAezFmB,EAAKwX,KAAkCxX,EAAKyO,OAAO4S,SAAsCrhB,EAAKyO,OAAO4S,QAAQ7J,MACtExX,EAAKyO,OAAO+I,MACvCxX,EAAKod,QAAQ,QAOzBpd,EAAKshB,OAAS,mBAOdthB,EAAKuhB,QAAU,wBAOfvhB,EAAKwhB,QAAU,6CAOfxhB,EAAKyhB,WAAa,SAAoBvlB,GAClC,OAAOA,EACD8D,EAAKib,SAASQ,KAAKvf,GAAO4f,SAC1B9b,EAAKib,SAASM,QACxB,EAQAvb,EAAK0hB,aAAe,SAAsBpX,EAAMwB,GAC5C,IAAIqE,EAAOnQ,EAAKib,SAASY,SAASvR,GAClC,OAAItK,EAAKwX,KACExX,EAAKwX,KAAKmK,SAASxR,EAAK+K,GAAI/K,EAAKgL,GAAIrP,GACzCqE,EAAKpE,SAAS/B,QAAQ8B,GACjC,EAiBA9L,EAAKugB,MAAQA,EAObvgB,EAAK4hB,QAAU,SAAiB3e,GAC5B,OAAOA,EAAIc,OAAO,GAAGuT,cAAgBrU,EAAI0B,UAAU,EACvD,EA0DA3E,EAAKygB,SAAWA,EAmBhBzgB,EAAK6hB,cAAgBpB,EAAS,iBAoB9BzgB,EAAK+a,YAAc,SAAkBN,GAEjC,IADA,IAAIqH,EAAW,CAAC,EACPrjB,EAAI,EAAGA,EAAIgc,EAAW9b,SAAUF,EACrCqjB,EAASrH,EAAWhc,IAAM,EAO9B,OAAO,WACH,IAAK,IAAI2D,EAAOvG,OAAOuG,KAAKlF,MAAOuB,EAAI2D,EAAKzD,OAAS,EAAGF,GAAK,IAAKA,EAC9D,GAA0B,IAAtBqjB,EAAS1f,EAAK3D,UAA+BrC,IAAlBc,KAAKkF,EAAK3D,KAAuC,OAAlBvB,KAAKkF,EAAK3D,IACpE,OAAO2D,EAAK3D,EACxB,CACJ,EAeAuB,EAAKgb,YAAc,SAAkBP,GAQjC,OAAO,SAASxc,GACZ,IAAK,IAAIQ,EAAI,EAAGA,EAAIgc,EAAW9b,SAAUF,EACjCgc,EAAWhc,KAAOR,UACXf,KAAKud,EAAWhc,GACnC,CACJ,EAkBAuB,EAAKwY,cAAgB,CACjBuJ,MAAO7V,OACP8V,MAAO9V,OACPF,MAAOE,OACP0L,MAAM,GAIV5X,EAAK8M,WAAa,WACd,IAAII,EAASlN,EAAKkN,OAEbA,GAMLlN,EAAKsN,aAAeJ,EAAOuO,OAAStO,WAAWsO,MAAQvO,EAAOuO,MAE1D,SAAqBvf,EAAO+lB,GACxB,OAAO,IAAI/U,EAAOhR,EAAO+lB,EAC7B,EACJjiB,EAAKgN,oBAAsBE,EAAOgV,aAE9B,SAA4BvmB,GACxB,OAAO,IAAIuR,EAAOvR,EACtB,GAdAqE,EAAKsN,aAAetN,EAAKgN,oBAAsB,IAevD,YCrbA,SAASmV,EAAeC,EAAUjL,GAET,kBAAZA,IACTA,EAAU,CAAEkL,QAASlL,IAGvBja,KAAKolB,kBAAoBC,KAAKC,MAAMD,KAAKE,UAAUL,IACnDllB,KAAKwlB,UAAYN,EACjBllB,KAAKylB,SAAWxL,GAAW,CAAC,EAC5Bja,KAAK0lB,cAAgBzL,GAAWA,EAAQ0L,cAAgBC,IACxD5lB,KAAK6lB,IAAM,KACX7lB,KAAK8lB,QAAU,GACf9lB,KAAK+lB,UAAY,EACjB/lB,KAAKgmB,kBAAoB,KACzBhmB,KAAKimB,oBAAsB,KAC3BjmB,KAAKkmB,SAAW,KAChBlmB,KAAKmmB,gBAAkB,KACvBnmB,KAAKomB,OAAS,KAEVpmB,KAAKylB,SAASN,UAChBnlB,KAAKqmB,gBAAkBrmB,KAAKwlB,UAAUtkB,MAAM,GAEhD,CACA7C,EAAOC,QAAU2mB,EAEjBA,EAAezlB,UAAU+U,MAAQ,WAC/BvU,KAAK+lB,UAAY,EACjB/lB,KAAKwlB,UAAYxlB,KAAKolB,kBAAkBlkB,MAAM,EAChD,EAEA+jB,EAAezlB,UAAU8mB,KAAO,WAC1BtmB,KAAKkmB,UACPK,aAAavmB,KAAKkmB,UAEhBlmB,KAAKomB,QACPG,aAAavmB,KAAKomB,QAGpBpmB,KAAKwlB,UAAkB,GACvBxlB,KAAKqmB,gBAAkB,IACzB,EAEApB,EAAezlB,UAAUgnB,MAAQ,SAASC,GAKxC,GAJIzmB,KAAKkmB,UACPK,aAAavmB,KAAKkmB,WAGfO,EACH,OAAO,EAET,IAAIC,GAAc,IAAIlc,MAAOmc,UAC7B,GAAIF,GAAOC,EAAc1mB,KAAKmmB,iBAAmBnmB,KAAK0lB,cAGpD,OAFA1lB,KAAK8lB,QAAQtlB,KAAKimB,GAClBzmB,KAAK8lB,QAAQlb,QAAQ,IAAIpM,MAAM,qCACxB,EAGTwB,KAAK8lB,QAAQtlB,KAAKimB,GAElB,IAAIG,EAAU5mB,KAAKwlB,UAAUld,QAC7B,QAAgBpJ,IAAZ0nB,EAAuB,CACzB,IAAI5mB,KAAKqmB,gBAKP,OAAO,EAHPrmB,KAAK8lB,QAAQ5a,OAAO,EAAGlL,KAAK8lB,QAAQrkB,OAAS,GAC7CmlB,EAAU5mB,KAAKqmB,gBAAgBnlB,OAAO,EAI1C,CAEA,IAAIoJ,EAAOtK,KAqBX,OApBAA,KAAKomB,OAASS,YAAW,WACvBvc,EAAKyb,YAEDzb,EAAK2b,sBACP3b,EAAK4b,SAAWW,YAAW,WACzBvc,EAAK2b,oBAAoB3b,EAAKyb,UAChC,GAAGzb,EAAK0b,mBAEJ1b,EAAKmb,SAASqB,OACdxc,EAAK4b,SAASY,SAIpBxc,EAAKub,IAAIvb,EAAKyb,UAChB,GAAGa,GAEC5mB,KAAKylB,SAASqB,OACd9mB,KAAKomB,OAAOU,SAGT,CACT,EAEA7B,EAAezlB,UAAUunB,QAAU,SAASlnB,EAAImnB,GAC9ChnB,KAAK6lB,IAAMhmB,EAEPmnB,IACEA,EAAWJ,UACb5mB,KAAKgmB,kBAAoBgB,EAAWJ,SAElCI,EAAWC,KACbjnB,KAAKimB,oBAAsBe,EAAWC,KAI1C,IAAI3c,EAAOtK,KACPA,KAAKimB,sBACPjmB,KAAKkmB,SAAWW,YAAW,WACzBvc,EAAK2b,qBACP,GAAG3b,EAAK0b,oBAGVhmB,KAAKmmB,iBAAkB,IAAI3b,MAAOmc,UAElC3mB,KAAK6lB,IAAI7lB,KAAK+lB,UAChB,EAEAd,EAAezlB,UAAU0nB,IAAM,SAASrnB,GACtCoN,QAAQ7B,IAAI,4CACZpL,KAAK+mB,QAAQlnB,EACf,EAEAolB,EAAezlB,UAAUwH,MAAQ,SAASnH,GACxCoN,QAAQ7B,IAAI,8CACZpL,KAAK+mB,QAAQlnB,EACf,EAEAolB,EAAezlB,UAAUwH,MAAQie,EAAezlB,UAAU0nB,IAE1DjC,EAAezlB,UAAU2nB,OAAS,WAChC,OAAOnnB,KAAK8lB,OACd,EAEAb,EAAezlB,UAAU4nB,SAAW,WAClC,OAAOpnB,KAAK+lB,SACd,EAEAd,EAAezlB,UAAU6nB,UAAY,WACnC,GAA4B,IAAxBrnB,KAAK8lB,QAAQrkB,OACf,OAAO,KAOT,IAJA,IAAI6lB,EAAS,CAAC,EACVD,EAAY,KACZE,EAAiB,EAEZhmB,EAAI,EAAGA,EAAIvB,KAAK8lB,QAAQrkB,OAAQF,IAAK,CAC5C,IAAIimB,EAAQxnB,KAAK8lB,QAAQvkB,GACrBiL,EAAUgb,EAAMhb,QAChBib,GAASH,EAAO9a,IAAY,GAAK,EAErC8a,EAAO9a,GAAWib,EAEdA,GAASF,IACXF,EAAYG,EACZD,EAAiBE,EAErB,CAEA,OAAOJ,CACT,8BCxJA,SAASnH,QAAQwH,YACb,IACI,IAAIC,IAAMC,KAAK,QAAQ5hB,QAAQ,IAAI,MAAzB4hB,CAAgCF,YAC1C,GAAIC,MAAQA,IAAIlmB,QAAU9C,OAAOuG,KAAKyiB,KAAKlmB,QACvC,OAAOkmB,GACf,CAAE,MAAO1D,GAAI,CACb,OAAO,IACX,CAfA5lB,OAAOC,QAAU4hB,+BCQjB,SAASvf,IAOLX,KAAK6nB,WAAa,CAAC,CACvB,CAhBAxpB,EAAOC,QAAUqC,EAyBjBA,EAAanB,UAAUiD,GAAK,SAAYnC,EAAKT,EAAIioB,GAK7C,OAJC9nB,KAAK6nB,WAAWvnB,KAASN,KAAK6nB,WAAWvnB,GAAO,KAAKE,KAAK,CACvDX,GAAMA,EACNioB,IAAMA,GAAO9nB,OAEVA,IACX,EAQAW,EAAanB,UAAUmD,IAAM,SAAarC,EAAKT,GAC3C,QAAYX,IAARoB,EACAN,KAAK6nB,WAAa,CAAC,OAEnB,QAAW3oB,IAAPW,EACAG,KAAK6nB,WAAWvnB,GAAO,QAGvB,IADA,IAAIe,EAAYrB,KAAK6nB,WAAWvnB,GACvBiB,EAAI,EAAGA,EAAIF,EAAUI,QACtBJ,EAAUE,GAAG1B,KAAOA,EACpBwB,EAAU6J,OAAO3J,EAAG,KAElBA,EAGlB,OAAOvB,IACX,EAQAW,EAAanB,UAAUqC,KAAO,SAAcvB,GACxC,IAAIe,EAAYrB,KAAK6nB,WAAWvnB,GAChC,GAAIe,EAAW,CAGX,IAFA,IAAIc,EAAO,GACPZ,EAAI,EACDA,EAAIc,UAAUZ,QACjBU,EAAK3B,KAAK6B,UAAUd,MACxB,IAAKA,EAAI,EAAGA,EAAIF,EAAUI,QACtBJ,EAAUE,GAAG1B,GAAG0C,MAAMlB,EAAUE,KAAKumB,IAAK3lB,EAClD,CACA,OAAOnC,IACX,+BC1EA,IAAI+nB,EAAWzpB,EA2Bf,SAAS0pB,IACLD,EAASjlB,KAAK8M,aACdmY,EAAS1Y,OAAOO,WAAWmY,EAAS3Y,cACpC2Y,EAASpI,OAAO/P,WAAWmY,EAASrI,aACxC,CAvBAqI,EAASE,MAAQ,UAGjBF,EAAS1Y,OAAe,EAAQ,MAChC0Y,EAAS3Y,aAAe,EAAQ,KAChC2Y,EAASpI,OAAe,EAAQ,MAChCoI,EAASrI,aAAe,EAAQ,MAGhCqI,EAASjlB,KAAe,EAAQ,MAChCilB,EAASG,IAAe,EAAQ,MAChCH,EAASjI,MAAe,EAAQ,MAChCiI,EAASC,UAAeA,EAcxBA,2BClCA3pB,EAAOC,QAAU,CAAC,+BCAlBD,EAAOC,QAAUgnB,EAEjBA,EAAM6C,SAAW,KACjB7C,EAAMjiB,SAAW,CAAE+kB,UAAU,GAE7B,IAAIhjB,EAAY,EAAQ,KACpBijB,EAAY,EAAQ,MACpBvO,EAAY,EAAQ,MACpBH,EAAY,EAAQ,MACpB2O,EAAY,EAAQ,MACpBhL,EAAY,EAAQ,MACpBzY,EAAY,EAAQ,MACpB0jB,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpB5O,EAAmB,EAAQ,MAC3B/W,EAAY,EAAQ,KACpBC,EAAY,EAAQ,MAEpB2lB,EAAc,gBACdC,EAAc,kBACdC,EAAc,qBACdC,EAAc,uBACdC,EAAc,YACdC,EAAc,cACdC,EAAc,oDACdC,EAAc,2BACdC,EAAc,+DAkClB,SAAS3D,EAAMnf,EAAQ6K,EAAMiJ,GAEnBjJ,aAAgBqX,IAClBpO,EAAUjJ,EACVA,EAAO,IAAIqX,GAEVpO,IACDA,EAAUqL,EAAMjiB,UAEpB,IASI6lB,EACAC,EACAC,EAsyBAjgB,EAjzBAkgB,EAAwBpP,EAAQoP,wBAAyB,EACzDC,EAAKlkB,EAASe,EAAQ8T,EAAQ7T,uBAAwB,GACtDiC,EAAOihB,EAAGjhB,KACV7H,EAAO8oB,EAAG9oB,KACV4I,EAAOkgB,EAAGlgB,KACVE,EAAOggB,EAAGhgB,KACVE,EAAO8f,EAAG9f,KAEViY,GAAO,EAIP9G,EAAU,SAEV4O,EAAMvY,EAENwY,EAAkB,GAClBC,EAAkB,CAAC,EAEnBC,EAAYzP,EAAQmO,SAAW,SAASrnB,GAAQ,OAAOA,CAAM,EAAI+B,EAAK4d,UAa1E,SAAS/Z,EAAQwC,EAAOpI,EAAM4oB,GAC1B,IAAIxB,EAAW7C,EAAM6C,SAGrB,OAFKwB,IACDrE,EAAM6C,SAAW,MACd3pB,MAAM,YAAcuC,GAAQ,SAAW,KAAOoI,EAAQ,OAASgf,EAAWA,EAAW,KAAO,IAAM,QAAUmB,EAAGhjB,KAAO,IACjI,CAEA,SAASqC,IACL,IACIQ,EADAlG,EAAS,GAEb,EAAG,CAEC,GAAyB,OAApBkG,EAAQd,MAA8B,MAAVc,EAC7B,MAAMxC,EAAQwC,GAElBlG,EAAOzC,KAAK6H,KACZiB,EAAKH,GACLA,EAAQC,GACZ,OAAmB,MAAVD,GAA4B,MAAVA,GAC3B,OAAOlG,EAAO4E,KAAK,GACvB,CAEA,SAAS+hB,EAAUC,GACf,IAAI1gB,EAAQd,IACZ,OAAQc,GACJ,IAAK,IACL,IAAK,IAED,OADA3I,EAAK2I,GACER,IACX,IAAK,OAAQ,IAAK,OACd,OAAO,EACX,IAAK,QAAS,IAAK,QACf,OAAO,EAEf,IACI,OAoDR,SAAqBQ,GACjB,IAAImV,EAAO,EAKX,OAJwB,MAApBnV,EAAMtC,OAAO,KACbyX,GAAQ,EACRnV,EAAQA,EAAM1B,UAAU,IAEpB0B,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAOmV,GAAOsH,KAClB,IAAK,MAAO,IAAK,MAAO,IAAK,MAAO,IAAK,MACrC,OAAOkE,IACX,IAAK,IACD,OAAO,EAEf,GAAIrB,EAAStgB,KAAKgB,GACd,OAAOmV,EAAOE,SAASrV,EAAO,IAClC,GAAIwf,EAASxgB,KAAKgB,GACd,OAAOmV,EAAOE,SAASrV,EAAO,IAClC,GAAI0f,EAAQ1gB,KAAKgB,GACb,OAAOmV,EAAOE,SAASrV,EAAO,GAGlC,GAAI4f,EAAS5gB,KAAKgB,GACd,OAAOmV,EAAOyL,WAAW5gB,GAG7B,MAAMxC,EAAQwC,EAAO,UA9E8B,EA+EvD,CA/Ee6gB,CAAY7gB,EACvB,CAAE,MAAO8a,GAEL,GAAI4F,GAAiBZ,EAAU9gB,KAAKgB,GAChC,OAAOA,EAGX,MAAMxC,EAAQwC,EAAO,QACzB,CACJ,CAEA,SAAS8gB,EAAWC,EAAQC,GACxB,IAAIhhB,EAAOnC,EACX,GACI,IAAImjB,GAAuC,OAApBhhB,EAAQC,MAA8B,MAAVD,EAO/C,IACI+gB,EAAO1pB,KAAK,CAAEwG,EAAQojB,EAAQ/hB,KAASiB,EAAK,MAAM,GAAQ8gB,EAAQ/hB,KAAUrB,GAChF,CAAE,MAAOyf,GACL,KAAI0D,GAAiBlB,EAAU9gB,KAAKgB,IAAUwR,GAAW,MAGrD,MAAM8L,EAFNyD,EAAO1pB,KAAK2I,EAIpB,KAf+D,CAC/D,IAAIpD,EAAM4C,IAEV,GADAuhB,EAAO1pB,KAAKuF,GACR4U,GAAW,KACX,MAAMhU,EAAQZ,EAAK,KAE3B,QAWKuD,EAAK,KAAK,IACnB,IAAI+gB,EAAQ,CAACpQ,aAAS/a,EACtBmrB,UAAkB,SAAStpB,EAAM/B,QACVE,IAAjBc,KAAKia,UAAuBja,KAAKia,QAAU,CAAC,GAChDja,KAAKia,QAAQlZ,GAAQ/B,CACvB,GACAsrB,EACID,GACA,SAA0BlhB,GAExB,GAAc,WAAVA,EAIF,MAAMxC,EAAQwC,GAHdohB,GAAYF,EAAOlhB,GACnBG,EAAK,IAGT,IACA,WACEkhB,GAAmBH,EACrB,GACR,CA+BA,SAASD,EAAQjhB,EAAOshB,GACpB,OAAQthB,GACJ,IAAK,MAAO,IAAK,MAAO,IAAK,MACzB,OAAO,UACX,IAAK,IACD,OAAO,EAIf,IAAKshB,GAAsC,MAApBthB,EAAMtC,OAAO,GAChC,MAAMF,EAAQwC,EAAO,MAEzB,GAAIuf,EAAYvgB,KAAKgB,GACjB,OAAOqV,SAASrV,EAAO,IAC3B,GAAIyf,EAAYzgB,KAAKgB,GACjB,OAAOqV,SAASrV,EAAO,IAG3B,GAAI2f,EAAW3gB,KAAKgB,GAChB,OAAOqV,SAASrV,EAAO,GAG3B,MAAMxC,EAAQwC,EAAO,KACzB,CAEA,SAASuhB,IAEL,QAAYxrB,IAARgqB,EACA,MAAMviB,EAAQ,WAKlB,GAHAuiB,EAAM7gB,KAGD4gB,EAAU9gB,KAAK+gB,GAChB,MAAMviB,EAAQuiB,EAAK,QAEvBK,EAAMA,EAAIoB,OAAOzB,GAEjB5f,EAAK,IACT,CAEA,SAASshB,IACL,IACIC,EADA1hB,EAAQC,IAEZ,OAAQD,GACJ,IAAK,OACD0hB,EAAezB,IAAgBA,EAAc,IAC7C/gB,IACA,MACJ,IAAK,SACDA,IAEJ,QACIwiB,EAAe1B,IAAYA,EAAU,IAG7ChgB,EAAQR,IACRW,EAAK,KACLuhB,EAAarqB,KAAK2I,EACtB,CAEA,SAAS2hB,IAKL,GAJAxhB,EAAK,MACLqR,EAAUhS,KAGI,KACV,MAAMhC,EAAQgU,EAAS,UAE3BrR,EAAK,IACT,CAEA,SAASyhB,IAML,GALAzhB,EAAK,KACLqR,EAAUhS,KACgB,CAAC,QAGJqiB,SAASrQ,GAC5B,MAAMhU,EAAQgU,EAAS,WAE3BrR,EAAK,IACT,CAGA,SAAS2hB,EAAYvP,EAAQvS,GACzB,OAAQA,GAEJ,IAAK,SAGD,OAFAohB,GAAY7O,EAAQvS,GACpBG,EAAK,MACE,EAEX,IAAK,UAED,OADA4hB,EAAUxP,EAAQvS,IACX,EAEX,IAAK,OAED,OADAgiB,GAAUzP,EAAQvS,IACX,EAEX,IAAK,UAED,OAycZ,SAAsBuS,EAAQvS,GAG1B,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,gBAEzB,IAAIiiB,EAAU,IAAI7C,EAAQpf,GAC1BmhB,EAAQc,GAAS,SAA4BjiB,GACzC,IAAI8hB,EAAYG,EAASjiB,GAAzB,CAKA,GAAc,QAAVA,EAGA,MAAMxC,EAAQwC,IAQ1B,SAAqBuS,EAAQvS,GAGzB,IAAIkiB,EAAc7hB,IAEdrE,EAAOgE,EAGX,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,IACImiB,EAAaC,EACbC,EAAcC,EAFd1qB,EAAOoI,EASX,GALAG,EAAK,KACDA,EAAK,UAAU,KACfiiB,GAAgB,IAGftC,EAAU9gB,KAAKgB,EAAQd,KACxB,MAAM1B,EAAQwC,GAQlB,GANAmiB,EAAcniB,EACdG,EAAK,KAAMA,EAAK,WAAYA,EAAK,KAC7BA,EAAK,UAAU,KACfmiB,GAAiB,IAGhBxC,EAAU9gB,KAAKgB,EAAQd,KACxB,MAAM1B,EAAQwC,GAElBqiB,EAAeriB,EACfG,EAAK,KAEL,IAAIsK,EAAS,IAAI4U,EAAOznB,EAAMoE,EAAMmmB,EAAaE,EAAcD,EAAeE,GAC9E7X,EAAOxM,QAAUikB,EACjBf,EAAQ1W,GAAQ,SAA2BzK,GAGvC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAY3W,EAAQzK,GACpBG,EAAK,IAIb,IACAoS,EAAOsB,IAAIpJ,EACf,CA1DY8X,CAAYN,EAASjiB,EAJzB,CAOJ,IACAuS,EAAOsB,IAAIoO,GACP1P,IAAW6N,GACXC,EAAgBhpB,KAAK4qB,EAE7B,CAheYO,CAAajQ,EAAQvS,IACd,EAEX,IAAK,SAED,OA+gBZ,SAAwBuS,EAAQvS,GAG5B,IAAK8f,EAAU9gB,KAAKgB,EAAQd,KACxB,MAAM1B,EAAQwC,EAAO,aAEzB,IAAIyiB,EAAYziB,EAChBmhB,EAAQ,MAAM,SAA8BnhB,GACxC,OAAQA,GAEJ,IAAK,WACL,IAAK,WACD0iB,GAAWnQ,EAAQvS,EAAOyiB,GAC1B,MAEJ,IAAK,WAGGC,GAAWnQ,EADC,WAAZf,EACmB,kBAEA,WAFmBiR,GAI1C,MAEJ,QAEI,GAAgB,WAAZjR,IAAyBsO,EAAU9gB,KAAKgB,GACxC,MAAMxC,EAAQwC,GAClB3I,EAAK2I,GACL0iB,GAAWnQ,EAAQ,WAAYkQ,GAG3C,GACJ,CAjjBYE,CAAepQ,EAAQvS,IAChB,EAEf,OAAO,CACX,CAEA,SAASmhB,EAAQ/X,EAAKwZ,EAAMC,GACxB,IAAIviB,EAAe6f,EAAGhjB,KAOtB,GANIiM,IAC0B,iBAAhBA,EAAInL,UACZmL,EAAInL,QAAUoC,KAEhB+I,EAAI4V,SAAW7C,EAAM6C,UAErB7e,EAAK,KAAK,GAAO,CAEjB,IADA,IAAIH,EACwB,OAApBA,EAAQd,MACZ0jB,EAAK5iB,GACTG,EAAK,KAAK,EACd,MACQ0iB,GACAA,IACJ1iB,EAAK,KACDiJ,IAA+B,iBAAhBA,EAAInL,SAAwBiiB,KAC3C9W,EAAInL,QAAUoC,EAAKC,IAAiB8I,EAAInL,QAEpD,CAEA,SAAS8jB,EAAUxP,EAAQvS,GAGvB,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,aAEzB,IAAIhE,EAAO,IAAI2U,EAAK3Q,GACpBmhB,EAAQnlB,GAAM,SAAyBgE,GACnC,IAAI8hB,EAAY9lB,EAAMgE,GAGtB,OAAQA,GAEJ,IAAK,OAyKjB,SAAuBuS,GACnBpS,EAAK,KACL,IAAIvE,EAAUsD,IAGd,QAA8BnJ,IAA1B2D,EAAMW,OAAOuB,GACb,MAAM4B,EAAQ5B,EAAS,QAE3BuE,EAAK,KACL,IAAI2iB,EAAY5jB,IAGhB,IAAK4gB,EAAU9gB,KAAK8jB,GAChB,MAAMtlB,EAAQslB,EAAW,QAE7B3iB,EAAK,KACL,IAAIvI,EAAOsH,IAGX,IAAK2gB,EAAO7gB,KAAKpH,GACb,MAAM4F,EAAQ5F,EAAM,QAExBuI,EAAK,KACL,IAAItF,EAAQ,IAAIskB,EAASoB,EAAU3oB,GAAOqpB,EAAQ/hB,KAAStD,EAASknB,GACpE3B,EAAQtmB,GAAO,SAA6BmF,GAGxC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAYvmB,EAAOmF,GACnBG,EAAK,IAIb,IAAG,WACCkhB,GAAmBxmB,EACvB,IACA0X,EAAOsB,IAAIhZ,EACf,CA7MgBkoB,CAAc/mB,GACd,MAEJ,IAAK,WACD,GAAgB,WAAZwV,EACA,MAAMhU,EAAQwC,GAEtB,IAAK,WACD0iB,GAAW1mB,EAAMgE,GACjB,MAEJ,IAAK,WAED,GAAgB,WAAZwR,EACAkR,GAAW1mB,EAAM,uBACd,IAAgB,WAAZwV,EACP,MAAMhU,EAAQwC,GAEd0iB,GAAW1mB,EAAM,WACrB,CACA,MAEJ,IAAK,SAyLjB,SAAoBuW,EAAQvS,GAGxB,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,IAAIqU,EAAQ,IAAIF,EAAMoM,EAAUvgB,IAChCmhB,EAAQ9M,GAAO,SAA0BrU,GACvB,WAAVA,GACAohB,GAAY/M,EAAOrU,GACnBG,EAAK,OAEL9I,EAAK2I,GACL0iB,GAAWrO,EAAO,YAE1B,IACA9B,EAAOsB,IAAIQ,EACf,CAzMgB2O,CAAWhnB,EAAMgE,GACjB,MAEJ,IAAK,aACD8gB,EAAW9kB,EAAKinB,aAAejnB,EAAKinB,WAAa,KACjD,MAEJ,IAAK,WACDnC,EAAW9kB,EAAKknB,WAAalnB,EAAKknB,SAAW,KAAK,GAClD,MAEJ,QAEI,GAAgB,WAAZ1R,IAAyBsO,EAAU9gB,KAAKgB,GACxC,MAAMxC,EAAQwC,GAGlB3I,EAAK2I,GACL0iB,GAAW1mB,EAAM,YAG7B,IACAuW,EAAOsB,IAAI7X,GACPuW,IAAW6N,GACXC,EAAgBhpB,KAAK2E,EAE7B,CAEA,SAAS0mB,GAAWnQ,EAAQ1B,EAAMxO,GAC9B,IAAIrG,EAAOkD,IACX,GAAa,UAATlD,EAAJ,CAWA,KAAOA,EAAKmnB,SAAS,MAAQljB,IAAOmjB,WAAW,MAC3CpnB,GAAQkD,IAIZ,IAAK4gB,EAAU9gB,KAAKhD,GAChB,MAAMwB,EAAQxB,EAAM,QAExB,IAAIpE,EAAOsH,IAIX,IAAK2gB,EAAO7gB,KAAKpH,GACb,MAAM4F,EAAQ5F,EAAM,QAExBA,EAAO2oB,EAAU3oB,GACjBuI,EAAK,KAEL,IAAItF,EAAQ,IAAI2V,EAAM5Y,EAAMqpB,EAAQ/hB,KAASlD,EAAM6U,EAAMxO,GAezD,GAbA8e,EAAQtmB,GAAO,SAA0BmF,GAGrC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAYvmB,EAAOmF,GACnBG,EAAK,IAIb,IAAG,WACCkhB,GAAmBxmB,EACvB,IAEa,oBAATgW,EAA4B,CAE5B,IAAIwD,EAAQ,IAAIF,EAAM,IAAMvc,GAC5BiD,EAAMmX,UAAU,mBAAmB,GACnCqC,EAAMR,IAAIhZ,GACV0X,EAAOsB,IAAIQ,EACf,MACI9B,EAAOsB,IAAIhZ,GAEX0X,IAAW6N,GACXC,EAAgBhpB,KAAKwD,EAnDzB,MAuDJ,SAAoB0X,EAAQ1B,GACxB,GAAIW,GAAW,KACX,MAAMhU,EAAQ,SAElB,IAAI5F,EAAOsH,IAGX,IAAK2gB,EAAO7gB,KAAKpH,GACb,MAAM4F,EAAQ5F,EAAM,QAExB,IAAIgc,EAAYja,EAAK4hB,QAAQ3jB,GACzBA,IAASgc,IACThc,EAAO+B,EAAKyd,QAAQxf,IACxBuI,EAAK,KACL,IAAIoH,EAAK0Z,EAAQ/hB,KACblD,EAAO,IAAI2U,EAAK/Y,GACpBoE,EAAKmX,OAAQ,EACb,IAAItY,EAAQ,IAAI2V,EAAMoD,EAAWrM,EAAI3P,EAAMiZ,GAC3ChW,EAAMmkB,SAAW7C,EAAM6C,SACvBmC,EAAQnlB,GAAM,SAA0BgE,GACpC,OAAQA,GAEJ,IAAK,SACDohB,GAAYplB,EAAMgE,GAClBG,EAAK,KACL,MACJ,IAAK,WACL,IAAK,WACDuiB,GAAW1mB,EAAMgE,GACjB,MAEJ,IAAK,WAGG0iB,GAAW1mB,EADC,WAAZwV,EACiB,kBAEA,YAErB,MAEJ,IAAK,UACDuQ,EAAU/lB,EAAMgE,GAChB,MAEJ,IAAK,OACDgiB,GAAUhmB,EAAMgE,GAChB,MAGJ,QACI,MAAMxC,EAAQwC,GAE1B,IACAuS,EAAOsB,IAAI7X,GACJ6X,IAAIhZ,EACf,CAhHQwoB,CAAW9Q,EAAQ1B,EAuD3B,CAqHA,SAASmR,GAAUzP,EAAQvS,GAGvB,IAAK6f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,IAAI6X,EAAM,IAAInc,EAAKsE,GACnBmhB,EAAQtJ,GAAK,SAAyB7X,GACpC,OAAOA,GACL,IAAK,SACHohB,GAAYvJ,EAAK7X,GACjBG,EAAK,KACL,MAEF,IAAK,WACH2gB,EAAWjJ,EAAIqL,WAAarL,EAAIqL,SAAW,KAAK,QAC5BntB,IAAjB8hB,EAAIqL,WAAwBrL,EAAIqL,SAAW,IAC9C,MAEF,SAUR,SAAwB3Q,EAAQvS,GAG5B,IAAK6f,EAAO7gB,KAAKgB,GACb,MAAMxC,EAAQwC,EAAO,QAEzBG,EAAK,KACL,IAAItK,EAAQorB,EAAQ/hB,KAAQ,GACxBgiB,EAAQ,CACJpQ,aAAS/a,EAEjBmrB,UAAkB,SAAStpB,GACvB,OAAOf,KAAKia,QAAQlZ,EACxB,EACAspB,UAAkB,SAAStpB,EAAM/B,GAC7B4a,EAAiBpa,UAAU2b,UAAUla,KAAKopB,EAAOtpB,EAAM/B,EAC3D,EACAqrB,gBAAwB,WAExB,GACAC,EAAQD,GAAO,SAA8BlhB,GAGzC,GAAc,WAAVA,EAIA,MAAMxC,EAAQwC,GAHdohB,GAAYF,EAAOlhB,GACnBG,EAAK,IAIb,IAAG,WACCkhB,GAAmBH,EACvB,IACA3O,EAAOsB,IAAI7T,EAAOnK,EAAOqrB,EAAMjjB,QAASijB,EAAMoC,eAAiBpC,EAAMpQ,QACzE,CA1CUyS,CAAe1L,EAAK7X,GAE1B,IACAuS,EAAOsB,IAAIgE,GACPtF,IAAW6N,GACXC,EAAgBhpB,KAAKwgB,EAE7B,CAqCA,SAASuJ,GAAY7O,EAAQvS,GACrB,IAAIwjB,EACAC,EACAC,GAAW,EAKf,IAJc,WAAV1jB,IACAA,EAAQd,KAGK,MAAVc,GAAe,CAClB,GAAc,MAAVA,EAAe,CACf,IAAI2jB,EAAczkB,IAClBiB,EAAK,KACLH,EAAQ,IAAM2jB,EAAc,GAChC,CACA,GAAID,EAAU,CAEV,GADAA,GAAW,EACP1jB,EAAM6hB,SAAS,OAAS7hB,EAAM6hB,SAAS,KAAM,CAC7C,IAAI+B,EAAS5jB,EAAMzB,MAAM,KACzBilB,EAASI,EAAO,GAAK,IACrB5jB,EAAQ4jB,EAAO,GACf,QACJ,CACAJ,EAASxjB,CACb,MACIyjB,EAAWA,EAAWA,GAAYzjB,EAAQA,EAE9CA,EAAQd,GACZ,CACA,IACI2kB,EAAcC,GAAiBvR,EADxBkR,EAAWD,EAAOvrB,OAAOwrB,GAAYD,GAEhDC,EAAWA,GAA4B,MAAhBA,EAAS,GAAaA,EAAS1rB,MAAM,GAAK0rB,EA6EzE,SAAyBlR,EAAQ3a,EAAM/B,EAAO4tB,GACtClR,EAAOwR,iBACPxR,EAAOwR,gBAAgBnsB,EAAM/B,EAAO4tB,EAC5C,CA9EQM,CAAgBxR,EADhBiR,EAASA,GAAwC,MAA9BA,EAAOA,EAAOlrB,OAAS,GAAakrB,EAAOzrB,MAAM,GAAI,GAAKyrB,EAC7CK,EAAaJ,EACrD,CAEA,SAASK,GAAiBvR,EAAQ3a,GAE9B,GAAIuI,EAAK,KAAK,GAAO,CAGjB,IAFA,IAAI6jB,EAAe,CAAC,GAEZ7jB,EAAK,KAAK,IAAO,CAErB,IAAK0f,EAAO7gB,KAAKgB,EAAQd,KACrB,MAAM1B,EAAQwC,EAAO,QAEzB,GAAc,OAAVA,EACF,MAAMxC,EAAQwC,EAAO,gBAGvB,IAAInK,EACA4tB,EAAWzjB,EAIf,GAFAG,EAAK,KAAK,GAEK,MAAXF,IAIApK,EAAQiuB,GAAiBvR,EAAQ3a,EAAO,IAAMoI,QAC3C,GAAe,MAAXC,IAAgB,CAEvB,IAAIgkB,EACJ,GAFApuB,EAAQ,GAEJsK,EAAK,KAAK,GAAO,CACjB,GACI8jB,EAAYxD,GAAU,GACtB5qB,EAAMwB,KAAK4sB,SACN9jB,EAAK,KAAK,IACnBA,EAAK,UACoB,IAAd8jB,GACPjS,GAAUO,EAAQ3a,EAAO,IAAMoI,EAAOikB,EAE9C,CACJ,MACIpuB,EAAQ4qB,GAAU,GAClBzO,GAAUO,EAAQ3a,EAAO,IAAMoI,EAAOnK,GAG1C,IAAIqiB,EAAY8L,EAAaP,GAEzBvL,IACAriB,EAAQ,GAAGoC,OAAOigB,GAAWjgB,OAAOpC,IAExCmuB,EAAaP,GAAY5tB,EAGzBsK,EAAK,KAAK,GACVA,EAAK,KAAK,EACd,CAEA,OAAO6jB,CACX,CAEA,IAAIE,EAAczD,GAAU,GAE5B,OADAzO,GAAUO,EAAQ3a,EAAMssB,GACjBA,CAEX,CAEA,SAASlS,GAAUO,EAAQ3a,EAAM/B,GACzBuqB,IAAQ7N,GAAU,cAAcvT,KAAKpH,GACrC0oB,EAAgB1oB,GAAQ/B,EAGxB0c,EAAOP,WACPO,EAAOP,UAAUpa,EAAM/B,EAC/B,CAOA,SAASwrB,GAAmB9O,GACxB,GAAIpS,EAAK,KAAK,GAAO,CACjB,GACIihB,GAAY7O,EAAQ,gBACfpS,EAAK,KAAK,IACnBA,EAAK,IACT,CACA,OAAOoS,CACX,CAgHA,KAA4B,QAApBvS,EAAQd,MACZ,OAAQc,GAEJ,IAAK,UAGD,IAAKsY,EACD,MAAM9a,EAAQwC,GAElBuhB,IACA,MAEJ,IAAK,SAGD,IAAKjJ,EACD,MAAM9a,EAAQwC,GAElByhB,IACA,MAEJ,IAAK,SAGD,IAAKnJ,EACD,MAAM9a,EAAQwC,GAElB2hB,IACA,MAEJ,IAAK,UAED,IAAKrJ,EACD,MAAM9a,EAAQwC,GAClB4hB,IACA,MAEJ,IAAK,SACDR,GAAYhB,EAAKpgB,GACjBG,EAAK,KAAK,GACV,MAEJ,QAGI,GAAI2hB,EAAY1B,EAAKpgB,GAAQ,CACzBsY,GAAO,EACP,QACJ,CAGA,MAAM9a,EAAQwC,GAO1B,OAt1BIqgB,EAAgBrc,SAAQoF,IACpBA,EAAIqI,SAAWD,EACfhc,OAAOuG,KAAKukB,GAAiBtc,SAAQmgB,SACNpuB,IAAvBqT,EAAIgK,UAAU+Q,IAClB/a,EAAI4I,UAAUmS,EAAK7D,EAAgB6D,IAAM,EAAK,GAChD,IAg1BVhI,EAAM6C,SAAW,KACV,CACH,QAAgBe,EAChB,QAAgBC,EACfC,YAAeA,EACfpY,KAAeA,EAExB,+BCl7BU1S,EA6BNiqB,QAAU,EAAQ,6BClCtBlqB,EAAOC,QAAUivB,EAEjB,IA+DIC,EA/DAC,EAAW,QAsBf,SAASF,EAAOxsB,EAAM2Z,GACb+S,EAAStlB,KAAKpH,KACfA,EAAO,mBAAqBA,EAAO,SACnC2Z,EAAO,CAAEgT,OAAQ,CAAEC,OAAQ,CAAED,OAAQ,CAAE3F,SAAU,CAAE2F,OAAQhT,QAE/D6S,EAAOxsB,GAAQ2Z,CACnB,CAWA6S,EAAO,MAAO,CAUVK,IAAK,CACD1f,OAAQ,CACJ2f,SAAU,CACN1oB,KAAM,SACNuL,GAAI,GAER1R,MAAO,CACHmG,KAAM,QACNuL,GAAI,OAQpB6c,EAAO,WAAY,CAUfO,SAAUN,EAAW,CACjBtf,OAAQ,CACJ6f,QAAS,CACL5oB,KAAM,QACNuL,GAAI,GAERsd,MAAO,CACH7oB,KAAM,QACNuL,GAAI,OAMpB6c,EAAO,YAAa,CAUhBU,UAAWT,IAGfD,EAAO,QAAS,CAOZW,MAAO,CACHhgB,OAAQ,CAAC,KAIjBqf,EAAO,SAAU,CASbY,OAAQ,CACJjgB,OAAQ,CACJA,OAAQ,CACJnJ,QAAS,SACTI,KAAM,QACNuL,GAAI,KAkBhB0d,MAAO,CACHC,OAAQ,CACJC,KAAM,CACF9Q,MAAO,CACH,YACA,cACA,cACA,YACA,cACA,eAIZtP,OAAQ,CACJqgB,UAAW,CACPppB,KAAM,YACNuL,GAAI,GAER8d,YAAa,CACTrpB,KAAM,SACNuL,GAAI,GAER+d,YAAa,CACTtpB,KAAM,SACNuL,GAAI,GAERge,UAAW,CACPvpB,KAAM,OACNuL,GAAI,GAERie,YAAa,CACTxpB,KAAM,SACNuL,GAAI,GAERke,UAAW,CACPzpB,KAAM,YACNuL,GAAI,KAKhBme,UAAW,CACP5rB,OAAQ,CACJ6rB,WAAY,IAWpBC,UAAW,CACP7gB,OAAQ,CACJjL,OAAQ,CACJ+W,KAAM,WACN7U,KAAM,QACNuL,GAAI,OAMpB6c,EAAO,WAAY,CASfyB,YAAa,CACT9gB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhBue,WAAY,CACR/gB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,KAYhBwe,WAAY,CACRhhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,KAYhBye,YAAa,CACTjhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhB0e,WAAY,CACRlhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,KAYhB2e,YAAa,CACTnhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhB4e,UAAW,CACPphB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,OACNuL,GAAI,KAYhB6e,YAAa,CACTrhB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,SACNuL,GAAI,KAYhB8e,WAAY,CACRthB,OAAQ,CACJlP,MAAO,CACHmG,KAAM,QACNuL,GAAI,OAMpB6c,EAAO,aAAc,CASjBkC,UAAW,CACPvhB,OAAQ,CACJwhB,MAAO,CACH1V,KAAM,WACN7U,KAAM,SACNuL,GAAI,OAqBpB6c,EAAOnuB,IAAM,SAAauwB,GACtB,OAAOpC,EAAOoC,IAAS,IAC3B,+BC7YAtxB,EAAOC,QAAUyhB,EAEjB,IAAI4D,EAAY,EAAQ,MAGpB1D,EAFY,EAAQ,KAEfC,CAAQ,MA2BjB,SAASH,EAAMoI,EAAUlO,EAAS2V,GAO9B,MANuB,mBAAZ3V,GACP2V,EAAW3V,EACXA,EAAU,CAAC,GACHA,IACRA,EAAU,CAAC,GAEV2V,GAIA3V,EAAQ4V,KAAO5P,GAAMA,EAAG6P,SAClB7P,EAAG6P,SAAS3H,GAAU,SAA+B1B,EAAKsJ,GAC7D,OAAOtJ,GAAiC,oBAAnBuJ,eACfjQ,EAAM8P,IAAI1H,EAAUlO,EAAS2V,GAC7BnJ,EACAmJ,EAASnJ,GACTmJ,EAAS,KAAM3V,EAAQgW,OAASF,EAAWA,EAAS1pB,SAAS,QACvE,IAGG0Z,EAAM8P,IAAI1H,EAAUlO,EAAS2V,GAbzBjM,EAAU5D,EAAO/f,KAAMmoB,EAAUlO,EAchD,CAuBA8F,EAAM8P,IAAM,SAAmB1H,EAAUlO,EAAS2V,GAC9C,IAAIC,EAAM,IAAIG,eACdH,EAAIK,mBAA4C,WAE5C,GAAuB,IAAnBL,EAAIM,WAAR,CAMA,GAAmB,IAAfN,EAAIO,QAA+B,MAAfP,EAAIO,OACxB,OAAOR,EAASpxB,MAAM,UAAYqxB,EAAIO,SAI1C,GAAInW,EAAQgW,OAAQ,CAChB,IAAIvd,EAASmd,EAAIQ,SACjB,IAAK3d,EAAQ,CACTA,EAAS,GACT,IAAK,IAAInR,EAAI,EAAGA,EAAIsuB,EAAIS,aAAa7uB,SAAUF,EAC3CmR,EAAOlS,KAAsC,IAAjCqvB,EAAIS,aAAajjB,WAAW9L,GAChD,CACA,OAAOquB,EAAS,KAA4B,oBAAf3f,WAA6B,IAAIA,WAAWyC,GAAUA,EACvF,CACA,OAAOkd,EAAS,KAAMC,EAAIS,aAnBN,CAoBxB,EAEIrW,EAAQgW,SAEJ,qBAAsBJ,GACtBA,EAAIU,iBAAiB,sCACzBV,EAAIrE,aAAe,eAGvBqE,EAAIW,KAAK,MAAOrI,GAChB0H,EAAIY,MACR,+BCjHA,IAAI1I,EAAW1pB,EAAOC,QAAU,EAAjB,MAEfypB,EAASE,MAAQ,QAoDjBF,EAASva,KAjCT,SAAc2a,EAAUnX,EAAM4e,GAM1B,MALoB,mBAAT5e,GACP4e,EAAW5e,EACXA,EAAO,IAAI+W,EAASM,MACZrX,IACRA,EAAO,IAAI+W,EAASM,MACjBrX,EAAKxD,KAAK2a,EAAUyH,EAC/B,EA0CA7H,EAAS2I,SANT,SAAkBvI,EAAUnX,GAGxB,OAFKA,IACDA,EAAO,IAAI+W,EAASM,MACjBrX,EAAK0f,SAASvI,EACzB,EAKAJ,EAAS4I,QAAmB,EAAQ,MACpC5I,EAAS6I,QAAmB,EAAQ,MACpC7I,EAAS8I,SAAmB,EAAQ,KACpC9I,EAASta,UAAmB,EAAQ,KAGpCsa,EAASnO,iBAAmB,EAAQ,MACpCmO,EAAS+I,UAAmB,EAAQ,MACpC/I,EAASM,KAAmB,EAAQ,MACpCN,EAASljB,KAAmB,EAAQ,MACpCkjB,EAASjO,KAAmB,EAAQ,MACpCiO,EAASpO,MAAmB,EAAQ,MACpCoO,EAASzK,MAAmB,EAAQ,MACpCyK,EAASO,SAAmB,EAAQ,MACpCP,EAASQ,QAAmB,EAAQ,MACpCR,EAASS,OAAmB,EAAQ,MAGpCT,EAAS9I,QAAmB,EAAQ,MACpC8I,EAASgJ,SAAmB,EAAQ,MAGpChJ,EAASllB,MAAmB,EAAQ,KACpCklB,EAASjlB,KAAmB,EAAQ,MAGpCilB,EAASnO,iBAAiBhK,WAAWmY,EAASM,MAC9CN,EAAS+I,UAAUlhB,WAAWmY,EAASjO,KAAMiO,EAASQ,QAASR,EAASljB,MACxEkjB,EAASM,KAAKzY,WAAWmY,EAASjO,MAClCiO,EAASpO,MAAM/J,WAAWmY,EAASjO,mCCtGnCzb,EAAOC,QAAU+pB,EAGjB,IAAIyI,EAAY,EAAQ,QACtBzI,EAAK7oB,UAAYb,OAAOC,OAAOkyB,EAAUtxB,YAAY8P,YAAc+Y,GAAMxO,UAAY,OAEvF,IAKIC,EACAwL,EACAiI,EAPA5T,EAAU,EAAQ,MAClB9U,EAAU,EAAQ,MAClByY,EAAU,EAAQ,MAClBxa,EAAU,EAAQ,MAatB,SAASulB,EAAKpO,GACV6W,EAAU7vB,KAAKjB,KAAM,GAAIia,GAMzBja,KAAKgxB,SAAW,GAMhBhxB,KAAKixB,MAAQ,GAGbjxB,KAAK4a,SAAW,QACpB,CAsCA,SAASsW,IAAQ,CA9BjB7I,EAAK5N,SAAW,SAAkBC,EAAM1J,GAKpC,OAJKA,IACDA,EAAO,IAAIqX,GACX3N,EAAKT,SACLjJ,EAAKmgB,WAAWzW,EAAKT,SAClBjJ,EAAKogB,QAAQ1W,EAAKgT,QAAQ2D,YACrC,EAUAhJ,EAAK7oB,UAAU8xB,YAAcxuB,EAAKkd,KAAK9b,QAUvCmkB,EAAK7oB,UAAUugB,MAAQjd,EAAKid,MAa5BsI,EAAK7oB,UAAUgO,KAAO,SAASA,EAAK2a,EAAUlO,EAAS2V,GAC5B,mBAAZ3V,IACP2V,EAAW3V,EACXA,OAAU/a,GAEd,IAAIoL,EAAOtK,KACX,IAAK4vB,EACD,OAAO9sB,EAAK6gB,UAAUnW,EAAMlD,EAAM6d,EAAUlO,GAGhD,IAAIsX,EAAO3B,IAAasB,EAGxB,SAAS/N,EAAOsD,EAAKzV,GAEjB,GAAK4e,EAAL,CAGA,GAAI2B,EACA,MAAM9K,EAEV,IAAIQ,EAAK2I,EACTA,EAAW,KACP5e,GACAA,EAAKqgB,aAETpK,EAAGR,EAAKzV,EATR,CAUJ,CAGA,SAASwgB,EAAmBrJ,GACxB,IAAIsJ,EAAMtJ,EAASuJ,YAAY,oBAC/B,GAAID,GAAO,EAAG,CACV,IAAIE,EAAUxJ,EAAS1gB,UAAUgqB,GACjC,GAAIE,KAAWpE,EAAQ,OAAOoE,CAClC,CACA,OAAO,IACX,CAGA,SAASvgB,EAAQ+W,EAAUhiB,GACvB,IAGI,GAFIrD,EAAKqN,SAAShK,IAAgC,MAArBA,EAAOU,OAAO,KACvCV,EAASkf,KAAKC,MAAMnf,IACnBrD,EAAKqN,SAAShK,GAEd,CACDmf,EAAM6C,SAAWA,EACjB,IACI1M,EADAmW,EAAStM,EAAMnf,EAAQmE,EAAM2P,GAE7B1Y,EAAI,EACR,GAAIqwB,EAAOzI,QACP,KAAO5nB,EAAIqwB,EAAOzI,QAAQ1nB,SAAUF,GAC5Bka,EAAW+V,EAAmBI,EAAOzI,QAAQ5nB,KAAO+I,EAAKgnB,YAAYnJ,EAAUyJ,EAAOzI,QAAQ5nB,MAC9Fwe,EAAMtE,GAClB,GAAImW,EAAOxI,YACP,IAAK7nB,EAAI,EAAGA,EAAIqwB,EAAOxI,YAAY3nB,SAAUF,GACrCka,EAAW+V,EAAmBI,EAAOxI,YAAY7nB,KAAO+I,EAAKgnB,YAAYnJ,EAAUyJ,EAAOxI,YAAY7nB,MACtGwe,EAAMtE,GAAU,EAChC,MAdInR,EAAK6mB,WAAWhrB,EAAO8T,SAASmX,QAAQjrB,EAAOunB,OAevD,CAAE,MAAOjH,GACLtD,EAAOsD,EACX,CACK8K,GAASM,GACV1O,EAAO,KAAM7Y,EAErB,CAGA,SAASyV,EAAMoI,EAAU2J,GAIrB,GAHA3J,EAAWqJ,EAAmBrJ,IAAaA,IAGvC7d,EAAK2mB,MAAM9hB,QAAQgZ,IAAa,GAMpC,GAHA7d,EAAK2mB,MAAMzwB,KAAK2nB,GAGZA,KAAYoF,EACRgE,EACAngB,EAAQ+W,EAAUoF,EAAOpF,OAEvB0J,EACFhL,YAAW,aACLgL,EACFzgB,EAAQ+W,EAAUoF,EAAOpF,GAC7B,UAMR,GAAIoJ,EAAM,CACN,IAAIprB,EACJ,IACIA,EAASrD,EAAKmd,GAAG8R,aAAa5J,GAAU9hB,SAAS,OACrD,CAAE,MAAOogB,GAGL,YAFKqL,GACD3O,EAAOsD,GAEf,CACArV,EAAQ+W,EAAUhiB,EACtB,OACM0rB,EACFvnB,EAAKyV,MAAMoI,GAAU,SAAS1B,EAAKtgB,KAC7B0rB,EAEGjC,IAGDnJ,EAEKqL,EAEKD,GACN1O,EAAO,KAAM7Y,GAFb6Y,EAAOsD,GAKfrV,EAAQ+W,EAAUhiB,GACtB,GAER,CACA,IAAI0rB,EAAS,EAIT/uB,EAAKqN,SAASgY,KACdA,EAAW,CAAEA,IAEjB,IAAK,IAAW1M,EAAPla,EAAI,EAAaA,EAAI4mB,EAAS1mB,SAAUF,GACzCka,EAAWnR,EAAKgnB,YAAY,GAAInJ,EAAS5mB,MACzCwe,EAAMtE,GAEd,OADAnR,EAAK+mB,aACDE,GAGCM,GACD1O,EAAO,KAAM7Y,GAHNA,CAOf,EA+BA+d,EAAK7oB,UAAUkxB,SAAW,SAAkBvI,EAAUlO,GAClD,IAAKnX,EAAK8gB,OACN,MAAMplB,MAAM,iBAChB,OAAOwB,KAAKwN,KAAK2a,EAAUlO,EAASiX,EACxC,EAKA7I,EAAK7oB,UAAU6xB,WAAa,WACxB,GAAIrxB,KAAKgxB,SAASvvB,OACd,MAAMjD,MAAM,4BAA8BwB,KAAKgxB,SAAS1sB,KAAI,SAASN,GACjE,MAAO,WAAaA,EAAMwH,OAAS,QAAUxH,EAAM0X,OAAO5N,QAC9D,IAAGjG,KAAK,OACZ,OAAOipB,EAAUtxB,UAAU6xB,WAAWpwB,KAAKjB,KAC/C,EAGA,IAAIgyB,EAAW,SAUf,SAASC,EAAmBjhB,EAAMhN,GAC9B,IAAIkuB,EAAeluB,EAAM0X,OAAOyW,OAAOnuB,EAAMwH,QAC7C,GAAI0mB,EAAc,CACd,IAAIE,EAAc,IAAIzY,EAAM3V,EAAM8J,SAAU9J,EAAM0M,GAAI1M,EAAMmB,KAAMnB,EAAMgW,UAAM9a,EAAW8E,EAAMiW,SAE/F,OAAIiY,EAAa9yB,IAAIgzB,EAAYrxB,QAGjCqxB,EAAY5X,eAAiBxW,EAC7BA,EAAMuW,eAAiB6X,EACvBF,EAAalV,IAAIoV,KAJN,CAMf,CACA,OAAO,CACX,CAQA/J,EAAK7oB,UAAU6yB,WAAa,SAAoB5S,GAC5C,GAAIA,aAAkB9F,OAE2Dza,IAAlBugB,EAAOjU,QAAmDiU,EAAOlF,gBACnH0X,EAAmBjyB,EAAMyf,IAC1Bzf,KAAKgxB,SAASxwB,KAAKif,QAExB,GAAIA,aAAkB5a,EAErBmtB,EAAS7pB,KAAKsX,EAAO1e,QACrB0e,EAAO/D,OAAO+D,EAAO1e,MAAQ0e,EAAOxc,aAErC,KAAMwc,aAAkBnC,GAA6C,CAExE,GAAImC,aAAkB3F,EAClB,IAAK,IAAIvY,EAAI,EAAGA,EAAIvB,KAAKgxB,SAASvvB,QAC1BwwB,EAAmBjyB,EAAMA,KAAKgxB,SAASzvB,IACvCvB,KAAKgxB,SAAS9lB,OAAO3J,EAAG,KAEtBA,EACd,IAAK,IAAIiB,EAAI,EAAGA,EAAsBid,EAAO6S,YAAY7wB,SAAUe,EAC/DxC,KAAKqyB,WAAW5S,EAAO8S,aAAa/vB,IACpCwvB,EAAS7pB,KAAKsX,EAAO1e,QACrB0e,EAAO/D,OAAO+D,EAAO1e,MAAQ0e,EACrC,CAKJ,EAQA4I,EAAK7oB,UAAUgzB,cAAgB,SAAuB/S,GAClD,GAAIA,aAAkB9F,GAElB,QAA+Cza,IAAlBugB,EAAOjU,OAChC,GAA0BiU,EAAOlF,eAC7BkF,EAAOlF,eAAemB,OAAOvc,OAAOsgB,EAAOlF,gBAC3CkF,EAAOlF,eAAiB,SACrB,CACH,IAAI1P,EAAQ7K,KAAKgxB,SAAS7hB,QAAQsQ,GAE9B5U,GAAS,GACT7K,KAAKgxB,SAAS9lB,OAAOL,EAAO,EACpC,OAGD,GAAI4U,aAAkB5a,EAErBmtB,EAAS7pB,KAAKsX,EAAO1e,cACd0e,EAAO/D,OAAO+D,EAAO1e,WAE7B,GAAI0e,aAAkBqR,EAAW,CAEpC,IAAK,IAAIvvB,EAAI,EAAGA,EAAsBke,EAAO6S,YAAY7wB,SAAUF,EAC/DvB,KAAKwyB,cAAc/S,EAAO8S,aAAahxB,IAEvCywB,EAAS7pB,KAAKsX,EAAO1e,cACd0e,EAAO/D,OAAO+D,EAAO1e,KAEpC,CACJ,EAGAsnB,EAAKzY,WAAa,SAASqN,EAAOwV,EAAQC,GACtC5Y,EAASmD,EACTqI,EAASmN,EACTlF,EAASmF,CACb,uBC9XA,WACE,IAAIC,EAASC,EAAMC,EAAKC,EAAMC,EAAMC,EAAMC,EAASC,EAEnDA,EAAU,SAAS3vB,GAMjB,MAAO,EAJFA,EAAQ,KAAQ,MAAS,IACzBA,EAAQ,KAAQ,MAAS,IAClB,MAAPA,KAAwB,EAClB,IAAPA,GACgBsE,KAAK,IAC3B,EAEAorB,EAAU,SAASE,GACjB,IAAIvS,EAAGzZ,EAAG5F,EAAGiB,EAAGgR,EAAGrP,EAEnB,IADAyc,EAAI,GACCrf,EAAIiB,EAAI,EAAGA,GAAK,GACD,IAAd2wB,EAAG1xB,OADeF,IAAMiB,EAAG,CAI/B,GAAIjB,EAAI,EAAG,CACT,GAAc,MAAV4xB,EAAG,GACL,MAAM,IAAI30B,MAAM,cAElB20B,EAAKA,EAAG1rB,UAAU,EACpB,CACgB+L,GAAhBrP,EAAMyuB,EAAKO,IAAa,GAAIhsB,EAAIhD,EAAI,GACpCgvB,EAAKA,EAAG1rB,UAAUN,GAClByZ,EAAEpgB,KAAKgT,EACT,CACA,GAAkB,IAAd2f,EAAG1xB,OACL,MAAM,IAAIjD,MAAM,cAElB,OAAQoiB,EAAEnf,QACR,KAAK,EACH,GAAImf,EAAE,GAAK,WACT,MAAM,IAAIpiB,MAAM,cAElB,OAAOoiB,EAAE,KAAO,EAClB,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,SACxB,MAAM,IAAIpiB,MAAM,cAElB,OAAQoiB,EAAE,IAAM,GAAKA,EAAE,MAAQ,EACjC,KAAK,EACH,GAAIA,EAAE,GAAK,KAAQA,EAAE,GAAK,KAAQA,EAAE,GAAK,MACvC,MAAM,IAAIpiB,MAAM,cAElB,OAAQoiB,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,IAAIpiB,MAAM,cAElB,OAAQoiB,EAAE,IAAM,GAAKA,EAAE,IAAM,GAAKA,EAAE,IAAM,EAAIA,EAAE,MAAQ,EAC1D,QACE,MAAM,IAAIpiB,MAAM,cAEtB,EAMAs0B,GAJAD,EAAM,SAASjS,GACb,OAAOA,EAAEvT,WAAW,EACtB,GAEW,KAEX2lB,EAAOH,EAAI,KAEXE,EAAOF,EAAI,KAEXD,EAAO,SAAS7vB,GACd,IAAIqwB,EAAMC,EAAM9xB,EAAGiS,EAAGxM,EAgBtB,IAfAwM,EAAI,EACJ4f,EAAO,GACPC,EAAO,IACP9xB,EAAI,EACAwB,EAAEtB,OAAS,GAAc,MAATsB,EAAExB,KACH,MAAbwB,EAAExB,EAAI,IAA2B,MAAbwB,EAAExB,EAAI,IAC5BA,GAAK,EACL6xB,EAAO,IACE,KAAOrwB,EAAExB,EAAI,IAAMwB,EAAExB,EAAI,IAAM,MACxCA,IACA6xB,EAAO,EACPC,EAAO,MAGXrsB,EAAQzF,EACDA,EAAIwB,EAAEtB,QAAQ,CACnB,GAAI,KAAOsB,EAAExB,IAAMwB,EAAExB,IAAM8xB,EACzB7f,EAAKA,EAAI4f,GAAQP,EAAI9vB,EAAExB,IAAMuxB,KAAW,MACnC,IAAa,KAATM,EAST,MARA,GAAI,KAAOrwB,EAAExB,IAAMwB,EAAExB,IAAM,IACzBiS,EAAKA,EAAI4f,GAAQ,GAAKP,EAAI9vB,EAAExB,IAAMyxB,KAAW,MACxC,MAAI,KAAOjwB,EAAExB,IAAMwB,EAAExB,IAAM,KAGhC,MAFAiS,EAAKA,EAAI4f,GAAQ,GAAKP,EAAI9vB,EAAExB,IAAMwxB,KAAW,CAG/C,CAGF,CACA,GAAIvf,EAAI,WACN,MAAM,IAAIhV,MAAM,aAElB+C,GACF,CACA,GAAIA,IAAMyF,EACR,MAAM,IAAIxI,MAAM,eAElB,MAAO,CAACgV,EAAGjS,EACb,EAEAoxB,EAAU,WACR,SAASA,EAAQW,EAAKzU,GACpB,IAAWtd,EAAGiB,EAAG2B,EACjB,GAAmB,iBAARmvB,EACT,MAAM,IAAI90B,MAAM,2BAQlB,GANKqgB,IACH1a,EAAMmvB,EAAI5rB,MAAM,IAAK,GAAI4rB,EAAMnvB,EAAI,GAAI0a,EAAO1a,EAAI,IAE/C0a,IACHA,EAAO,IAEW,iBAATA,GAAqBA,EAAK1P,QAAQ,MAAQ,EAAG,CACtD,IACEnP,KAAKuzB,SAAWN,EAAQpU,EAC1B,CAAE,MAAO2U,GAEP,MAAM,IAAIh1B,MAAM,iBAAmBqgB,EACrC,CACA,IAAKtd,EAAIiB,EAAI,GAAIA,GAAK,EAAGjB,IAAMiB,EAC7B,GAAIxC,KAAKuzB,WAAc,YAAe,GAAKhyB,IAAQ,EAAG,CACpDvB,KAAKyzB,QAAUlyB,EACf,KACF,CAEJ,KAAO,KAAIsd,GAAiB,IAATA,EAOjB,MAAM,IAAIrgB,MAAM,uBANhBwB,KAAKyzB,QAAUjV,SAASK,EAAM,IAC9B7e,KAAKuzB,SAAW,EACZvzB,KAAKyzB,QAAU,IACjBzzB,KAAKuzB,SAAY,YAAe,GAAKvzB,KAAKyzB,UAAc,EAI5D,CACA,IACEzzB,KAAK0zB,SAAWT,EAAQK,GAAOtzB,KAAKuzB,YAAc,CACpD,CAAE,MAAOC,GAEP,MAAM,IAAIh1B,MAAM,wBAA0B80B,EAC5C,CACA,KAAMtzB,KAAKyzB,SAAW,IACpB,MAAM,IAAIj1B,MAAM,yBAA2BqgB,GAE7C7e,KAAKvB,KAAOwK,KAAK0qB,IAAI,EAAG,GAAK3zB,KAAKyzB,SAClCzzB,KAAKozB,KAAOF,EAAQlzB,KAAK0zB,SACzB1zB,KAAK6e,KAAOqU,EAAQlzB,KAAKuzB,UACzBvzB,KAAK4zB,SAAWV,GAASlzB,KAAKuzB,UAC9BvzB,KAAK6zB,MAAQ7zB,KAAKyzB,SAAW,GAAKP,EAAQlzB,KAAK0zB,QAAU,GAAK1zB,KAAKozB,KACnEpzB,KAAK8zB,KAAO9zB,KAAKyzB,SAAW,GAAKP,EAAQlzB,KAAK0zB,QAAU1zB,KAAKvB,KAAO,GAAKy0B,EAAQlzB,KAAK0zB,QAAU1zB,KAAKvB,KAAO,GAC5GuB,KAAK+zB,UAAY/zB,KAAKyzB,SAAW,GAAKP,EAAQlzB,KAAK0zB,QAAU1zB,KAAKvB,KAAO,QAAK,CAChF,CAoCA,OAlCAk0B,EAAQnzB,UAAUw0B,SAAW,SAASb,GAIpC,MAHkB,iBAAPA,IAAoBA,EAAGhkB,QAAQ,KAAO,GAA8B,IAAzBgkB,EAAGzrB,MAAM,KAAKjG,UAClE0xB,EAAK,IAAIR,EAAQQ,IAEfA,aAAcR,EACT3yB,KAAKg0B,SAASb,EAAGC,OAASpzB,KAAKg0B,SAASb,EAAGY,WAAaZ,EAAGW,OAE1Db,EAAQE,GAAMnzB,KAAKuzB,YAAc,IAAOvzB,KAAK0zB,QAAU1zB,KAAKuzB,YAAc,CAEtF,EAEAZ,EAAQnzB,UAAU6I,KAAO,SAASof,GAIhC,OAHa,MAATA,IACFA,EAAQ,GAEH,IAAIkL,EAAQO,EAAQlzB,KAAK0zB,QAAW1zB,KAAKvB,KAAOgpB,GAASznB,KAAK6e,KACvE,EAEA8T,EAAQnzB,UAAU2N,QAAU,SAAStN,GACnC,IAAIgL,EAAOopB,EAAU1wB,EAIrB,IAHAA,EAAO0vB,EAAQjzB,KAAK6zB,OACpBI,EAAWhB,EAAQjzB,KAAK8zB,MACxBjpB,EAAQ,EACDtH,GAAQ0wB,GACbp0B,EAAGqzB,EAAQ3vB,GAAOA,EAAMsH,GACxBA,IACAtH,GAEJ,EAEAovB,EAAQnzB,UAAU6G,SAAW,WAC3B,OAAOrG,KAAKozB,KAAO,IAAMpzB,KAAKyzB,OAChC,EAEOd,CAER,CAxFS,GA0FVr0B,EAAQ20B,QAAUA,EAElB30B,EAAQ40B,QAAUA,EAElB50B,EAAQq0B,QAAUA,CAEnB,GAAE1xB,KAAKjB,sBC/MR3B,EAAOC,QAAU,EAAjB,mCCCAD,EAAOC,QAAUuG,EAGjB,IAAI+U,EAAmB,EAAQ,QAC7B/U,EAAKrF,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAczK,GAAMgV,UAAY,OAE9F,IAAIiX,EAAY,EAAQ,MACpBhuB,EAAO,EAAQ,MAcnB,SAAS+B,EAAK9D,EAAMkC,EAAQgX,EAAS7S,EAASZ,EAAU0tB,GAGpD,GAFAta,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,GAE9BhX,GAA4B,iBAAXA,EACjB,MAAM7C,UAAU,4BAgDpB,GA1CAJ,KAAKyO,WAAa,CAAC,EAMnBzO,KAAKiD,OAAStE,OAAOC,OAAOoB,KAAKyO,YAMjCzO,KAAKoH,QAAUA,EAMfpH,KAAKwG,SAAWA,GAAY,CAAC,EAM7BxG,KAAKk0B,cAAgBA,EAMrBl0B,KAAKm0B,gBAAkB,CAAC,EAMxBn0B,KAAKqsB,cAAWntB,EAMZ+D,EACA,IAAK,IAAIiC,EAAOvG,OAAOuG,KAAKjC,GAAS1B,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAC5B,iBAApB0B,EAAOiC,EAAK3D,MACnBvB,KAAKyO,WAAYzO,KAAKiD,OAAOiC,EAAK3D,IAAM0B,EAAOiC,EAAK3D,KAAQ2D,EAAK3D,GACjF,CAKAsD,EAAKrF,UAAUgd,iBAAmB,SAA0B7B,GASxD,OARAA,EAAU3a,KAAK4a,UAAYD,EAC3Bf,EAAiBpa,UAAUgd,iBAAiBvb,KAAKjB,KAAM2a,GAEvDhc,OAAOuG,KAAKlF,KAAKiD,QAAQkK,SAAQpO,IAC7B,IAAIq1B,EAAqBz1B,OAAO01B,OAAO,CAAC,EAAGr0B,KAAK8a,WAChD9a,KAAKm0B,gBAAgBp1B,GAAOJ,OAAO01B,OAAOD,EAAoBp0B,KAAKk0B,eAAiBl0B,KAAKk0B,cAAcn1B,IAAQiB,KAAKk0B,cAAcn1B,GAAKsd,SAAS,IAG7Irc,IACX,EAgBA6E,EAAK4V,SAAW,SAAkB1Z,EAAM2Z,GACpC,IAAIsG,EAAM,IAAInc,EAAK9D,EAAM2Z,EAAKzX,OAAQyX,EAAKT,QAASS,EAAKtT,QAASsT,EAAKlU,UAKvE,OAJAwa,EAAIqL,SAAW3R,EAAK2R,SAChB3R,EAAKC,UACLqG,EAAIpG,SAAWF,EAAKC,SACxBqG,EAAInG,gBAAkB,SACfmG,CACX,EAOAnc,EAAKrF,UAAU6b,OAAS,SAAgBC,GACpC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAkBnO,KAAKwb,iBACvB,UAAkBxb,KAAKia,QACvB,gBAAkBja,KAAKk0B,cACvB,SAAkBl0B,KAAKiD,OACvB,WAAkBjD,KAAKqsB,UAAYrsB,KAAKqsB,SAAS5qB,OAASzB,KAAKqsB,cAAWntB,EAC1E,UAAkBqc,EAAevb,KAAKoH,aAAUlI,EAChD,WAAkBqc,EAAevb,KAAKwG,cAAWtH,GAEzD,EAYA2F,EAAKrF,UAAUwd,IAAM,SAAajc,EAAM2P,EAAItJ,EAAS6S,GAGjD,IAAKnX,EAAKqN,SAASpP,GACf,MAAMX,UAAU,yBAEpB,IAAK0C,EAAKqX,UAAUzJ,GAChB,MAAMtQ,UAAU,yBAEpB,QAA0BlB,IAAtBc,KAAKiD,OAAOlC,GACZ,MAAMvC,MAAM,mBAAqBuC,EAAO,QAAUf,MAEtD,GAAIA,KAAKs0B,aAAa5jB,GAClB,MAAMlS,MAAM,MAAQkS,EAAK,mBAAqB1Q,MAElD,GAAIA,KAAKu0B,eAAexzB,GACpB,MAAMvC,MAAM,SAAWuC,EAAO,oBAAsBf,MAExD,QAA4Bd,IAAxBc,KAAKyO,WAAWiC,GAAmB,CACnC,IAAM1Q,KAAKia,UAAWja,KAAKia,QAAQua,YAC/B,MAAMh2B,MAAM,gBAAkBkS,EAAK,OAAS1Q,MAChDA,KAAKiD,OAAOlC,GAAQ2P,CACxB,MACI1Q,KAAKyO,WAAWzO,KAAKiD,OAAOlC,GAAQ2P,GAAM3P,EAS9C,OAPIkZ,SAC2B/a,IAAvBc,KAAKk0B,gBACLl0B,KAAKk0B,cAAgB,CAAC,GAC1Bl0B,KAAKk0B,cAAcnzB,GAAQkZ,GAAW,MAG1Cja,KAAKwG,SAASzF,GAAQqG,GAAW,KAC1BpH,IACX,EASA6E,EAAKrF,UAAUL,OAAS,SAAgB4B,GAEpC,IAAK+B,EAAKqN,SAASpP,GACf,MAAMX,UAAU,yBAEpB,IAAI6K,EAAMjL,KAAKiD,OAAOlC,GACtB,GAAW,MAAPkK,EACA,MAAMzM,MAAM,SAAWuC,EAAO,uBAAyBf,MAQ3D,cANOA,KAAKyO,WAAWxD,UAChBjL,KAAKiD,OAAOlC,UACZf,KAAKwG,SAASzF,GACjBf,KAAKk0B,sBACEl0B,KAAKk0B,cAAcnzB,GAEvBf,IACX,EAOA6E,EAAKrF,UAAU80B,aAAe,SAAsB5jB,GAChD,OAAOogB,EAAUwD,aAAat0B,KAAKqsB,SAAU3b,EACjD,EAOA7L,EAAKrF,UAAU+0B,eAAiB,SAAwBxzB,GACpD,OAAO+vB,EAAUyD,eAAev0B,KAAKqsB,SAAUtrB,EACnD,kBC9NA,OASA,WACE,aAEA,IAAIiQ,EAAyB,iBAAXD,OAAsBA,OAAS,CAAC,GACnCC,EAAKyjB,sBAA2C,iBAAZrjB,SAAwBA,QAAQC,UAAYD,QAAQC,SAASC,OAE9GN,EAAOO,QAET,IAAIC,GAAaR,EAAK0jB,wBAAwDr2B,EAAOC,QACjFoT,EAAsC,OACtCijB,EAAqB,mCAAmCjtB,MAAM,IAC9DktB,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,IAGzDtgB,EAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAE/BugB,EAAmB,SAAUC,EAAUC,GACrCA,EAAQtzB,OAAS,KACnBszB,EAAU,MAAQA,EAAQC,QAAQ,KAEpC,IAAIvO,EAAM,IAAIjoB,MAAM,kGAEiBs2B,EAAW,WAAaC,EAAU,OAEvE,MADAtO,EAAIqO,SAAWA,EACTrO,CACR,EAgDIwO,EAAgB,SAAUC,GAC5B,GAAkB,KAAdA,EACF,MAAO,GACF,IAAK,eAAe/sB,KAAK+sB,GAC9B,MAAM,IAAI12B,MAAM,6BAMlB,IAHA,IAAI22B,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI5mB,EAAQ,GAAIjE,EAAQ,EAAGpJ,GAD3DyzB,EAAYA,EAAUlvB,QAAQ,KAAM,KAC0CvE,OAGrEF,EAAI,EAAGkmB,EAAQhmB,GAAU,GAAK,EAAGF,EAAIkmB,GAC5C0N,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCm0B,EAAKd,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CxmB,EAAMjE,KAAkC,KAAtByqB,GAAM,EAAIC,IAAO,GACnCzmB,EAAMjE,KAA4C,KAAhC0qB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7C3mB,EAAMjE,KAA4B,KAAhB4qB,GAAM,EAAIC,GAI9B,IAAIC,EAASl0B,EAASgmB,EAkCtB,OAjCe,IAAXkO,GACFR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,IACf,IAAXO,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IACzB,IAAXK,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CxmB,EAAMjE,KAAkC,KAAtByqB,GAAM,EAAIC,IAAO,IACf,IAAXI,IACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCuN,EAAMjE,KAAkC,KAAtBsqB,GAAM,EAAIC,IAAO,GACnCtmB,EAAMjE,KAA4C,KAAhCuqB,GAAM,EAAIC,GAAM,EAAIC,IAAO,GAC7CxmB,EAAMjE,KAAkC,KAAtByqB,GAAM,EAAIC,IAAO,GACnCzmB,EAAMjE,KAA4C,KAAhC0qB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAExC3mB,CACT,EAgOIkN,EAAS,SAAUkZ,EAAWU,GAChC,IAAKA,EACH,OA9Ue,SAAU9mB,GAE3B,IADA,IAAgE8R,EAAGzZ,EAA/DpB,EAAM,GAAItE,EAASqN,EAAMrN,OAAQF,EAAI,EAAGs0B,EAAiB,EACtDt0B,EAAIE,GAET,IADAmf,EAAI9R,EAAMvN,OACD,IACPwE,GAAOiJ,OAAOC,aAAa2R,OAD7B,CAGWA,EAAI,KAAQA,GAAK,KAC1BzZ,EAAQ,GAAJyZ,EACJiV,EAAiB,GACRjV,GAAK,KACdzZ,EAAQ,GAAJyZ,EACJiV,EAAiB,GACRjV,GAAK,KACdzZ,EAAQ,EAAJyZ,EACJiV,EAAiB,GAEjBhB,EAAiBtzB,EAAGwE,GAGtB,IAAK,IAAIvD,EAAI,EAAGA,EAAIqzB,IAAkBrzB,IACpCoe,EAAI9R,EAAMvN,MACF,KAAQqf,EAAI,MAClBiU,EAAiBtzB,EAAGwE,GAEtBoB,IAAM,EACNA,GAAS,GAAJyZ,EAEHzZ,GAAK,OAAUA,GAAK,OACtB0tB,EAAiBtzB,EAAGwE,GAElBoB,EAAI,SACN0tB,EAAiBtzB,EAAGwE,GAGlBoB,GAAK,MACPpB,GAAOiJ,OAAOC,aAAa9H,IAE3BA,GAAK,MACLpB,GAAOiJ,OAAOC,aAAyB,OAAX9H,GAAK,KACjCpB,GAAOiJ,OAAOC,aAA2B,OAAT,KAAJ9H,IAtB9B,CAyBF,OAAOpB,CACT,CAkSW+vB,CAAab,EAAcC,IAEpC,GAAkB,KAAdA,EACF,MAAO,GACF,IAAK,eAAe/sB,KAAK+sB,GAC9B,MAAM,IAAI12B,MAAM,6BAElB,IAAI22B,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EAAI3vB,EAAM,GAAItE,EAASyzB,EAAU/lB,QAAQ,MACzD,IAAZ1N,IACFA,EAASyzB,EAAUzzB,QAIrB,IAAK,IAAIF,EAAI,EAAGkmB,EAAQhmB,GAAU,GAAK,EAAGF,EAAIkmB,GAC5C0N,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCm0B,EAAKd,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDtmB,OAAOC,aAAoC,KAAtBqmB,GAAM,EAAIC,IAAO,IACtCvmB,OAAOC,aAA8C,KAAhCsmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDzmB,OAAOC,aAA8B,KAAhBwmB,GAAM,EAAIC,IAInC,IAAIC,EAASl0B,EAASgmB,EAkCtB,OAjCe,IAAXkO,GACFR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,KACzB,IAAXO,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,KAC9B,IAAXK,GACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDtmB,OAAOC,aAAoC,KAAtBqmB,GAAM,EAAIC,IAAO,KACpB,IAAXI,IACTR,EAAKP,EAAmBM,EAAUruB,OAAOtF,MACzC6zB,EAAKR,EAAmBM,EAAUruB,OAAOtF,MACzC8zB,EAAKT,EAAmBM,EAAUruB,OAAOtF,MACzC+zB,EAAKV,EAAmBM,EAAUruB,OAAOtF,MACzCg0B,EAAKX,EAAmBM,EAAUruB,OAAOtF,MACzCi0B,EAAKZ,EAAmBM,EAAUruB,OAAOtF,MACzCk0B,EAAKb,EAAmBM,EAAUruB,OAAOtF,MACzCwE,GAAOiJ,OAAOC,aAAoC,KAAtBkmB,GAAM,EAAIC,IAAO,IAC3CpmB,OAAOC,aAA8C,KAAhCmmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,IAChDtmB,OAAOC,aAAoC,KAAtBqmB,GAAM,EAAIC,IAAO,IACtCvmB,OAAOC,aAA8C,KAAhCsmB,GAAM,EAAIC,GAAM,EAAIC,IAAO,KAE7C1vB,CACT,EAEIzH,EAAU,CACZ4W,OApFW,SAAU6gB,EAAOH,GAC5B,IAAII,EAA8B,iBAAZ,EAItB,OAHIA,GAAaD,EAAMzmB,cAAgBuC,cACrCkkB,EAAQ,IAAI9lB,WAAW8lB,IAErBC,EAjEY,SAAUlnB,GAE1B,IADA,IAAIqmB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIL,EAAY,GAAIzzB,EAASqN,EAAMrN,OAC9CF,EAAI,EAAGkmB,EAA+B,EAAvBjJ,SAAS/c,EAAS,GAAQF,EAAIkmB,GACpD0N,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,KACX8zB,EAAKvmB,EAAMvN,KACX+zB,EAAKxmB,EAAMvN,KACXg0B,EAAKzmB,EAAMvN,KACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAwB,GAALY,GAIvB,IAAII,EAASl0B,EAASgmB,EAsCtB,OArCe,IAAXkO,GACFR,EAAKrmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAAoBQ,GAAM,EAAK,IAC/B,UACkB,IAAXQ,GACTR,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAAoBS,GAAM,EAAK,IAC/B,QACkB,IAAXO,GACTR,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,KACX8zB,EAAKvmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,GAAM,EAAK,IAC/B,OACkB,IAAXM,IACTR,EAAKrmB,EAAMvN,KACX6zB,EAAKtmB,EAAMvN,KACX8zB,EAAKvmB,EAAMvN,KACX+zB,EAAKxmB,EAAMvN,GACX2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAAoBW,GAAM,EAAK,IAC/B,KAEGJ,CACT,CAQWe,CAAYF,GACVH,EAvNK,SAAU7vB,GAE1B,IADA,IAAIovB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIL,EAAY,GAAIzzB,EAASsE,EAAItE,OAC5CF,EAAI,EAAGkmB,EAA+B,EAAvBjJ,SAAS/c,EAAS,GAAQF,EAAIkmB,GACpD0N,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,KACpB8zB,EAAKtvB,EAAIsH,WAAW9L,KACpB+zB,EAAKvvB,EAAIsH,WAAW9L,KACpBg0B,EAAKxvB,EAAIsH,WAAW9L,KACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAwB,GAALY,GAIvB,IAAII,EAASl0B,EAASgmB,EAsCtB,OArCe,IAAXkO,GACFR,EAAKpvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAAoBQ,GAAM,EAAK,IAC/B,UACkB,IAAXQ,GACTR,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAAoBS,GAAM,EAAK,IAC/B,QACkB,IAAXO,GACTR,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,KACpB8zB,EAAKtvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,GAAM,EAAK,IAC/B,OACkB,IAAXM,IACTR,EAAKpvB,EAAIsH,WAAW9L,KACpB6zB,EAAKrvB,EAAIsH,WAAW9L,KACpB8zB,EAAKtvB,EAAIsH,WAAW9L,KACpB+zB,EAAKvvB,EAAIsH,WAAW9L,GACpB2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAAoBW,GAAM,EAAK,IAC/B,KAEGJ,CACT,CA8JWgB,CAAYH,GA5JN,SAAUhwB,GACzB,IAAIovB,EAAIC,EAAIC,EAAIC,EAAIC,EAAIxgB,EACXxT,EADiB0F,GAAM,EAAOiuB,EAAY,GACrDrqB,EAAQ,EAAM7D,EAAQ,EAAcvF,EAASsE,EAAItE,OACjD,GAAY,KAARsE,EACF,OAAOmvB,EAEX,EAAG,CAID,IAHA5gB,EAAO,GAAKA,EAAO,GACnBA,EAAO,GAAKA,EAAO,GACnBA,EAAO,GAAKA,EAAO,GACd/S,EAAIyF,EAAO6D,EAAQpJ,GAAUF,EAAI,IAAKsJ,GACzCkK,EAAOhP,EAAIsH,WAAWxC,IACX,IACTyJ,EAAO/S,KAAOwT,EACLA,EAAO,MAChBT,EAAO/S,KAAO,IAAQwT,GAAQ,EAC9BT,EAAO/S,KAAO,IAAe,GAAPwT,GACbA,EAAO,OAAUA,GAAQ,OAClCT,EAAO/S,KAAO,IAAQwT,GAAQ,GAC9BT,EAAO/S,KAAO,IAASwT,GAAQ,EAAK,GACpCT,EAAO/S,KAAO,IAAe,GAAPwT,IAEtBA,EAAO,QAAoB,KAAPA,IAAiB,GAAiC,KAA1BhP,EAAIsH,aAAaxC,IAC7DyJ,EAAO/S,KAAO,IAAQwT,GAAQ,GAC9BT,EAAO/S,KAAO,IAASwT,GAAQ,GAAM,GACrCT,EAAO/S,KAAO,IAASwT,GAAQ,EAAK,GACpCT,EAAO/S,KAAO,IAAe,GAAPwT,GAI1B/N,EAAQzF,EAAI,EACRsJ,IAAUpJ,KACVoJ,EAEAA,EAAQpJ,GAAUF,EAAI,IACxB0F,GAAM,GAERkuB,EAAK7gB,EAAO,GACR/S,EAAI,GACN6zB,EAAK9gB,EAAO,GACZ+gB,EAAK/gB,EAAO,GACZghB,EAAKhhB,EAAO,GACZihB,EAAKjhB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAA0C,IAAtBW,GAAM,EAAIC,IAAO,IACrCZ,EAAwB,GAALY,IACN,IAANh0B,EACT2zB,GAAaP,EAAmBQ,IAAO,GACrCR,EAAoBQ,GAAM,EAAK,IAC/B,SACa,IAAN5zB,GACT6zB,EAAK9gB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAAoBS,GAAM,EAAK,IAC/B,QACa,IAAN7zB,GACT6zB,EAAK9gB,EAAO,GACZ+gB,EAAK/gB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAAoBU,GAAM,EAAK,IAC/B,QAEFD,EAAK9gB,EAAO,GACZ+gB,EAAK/gB,EAAO,GACZghB,EAAKhhB,EAAO,GACZ4gB,GAAaP,EAAmBQ,IAAO,GACrCR,EAA0C,IAAtBQ,GAAM,EAAIC,IAAO,IACrCT,EAAoBS,IAAO,EAAK,IAChCT,EAA0C,IAAtBS,GAAM,EAAIC,IAAO,IACrCV,EAA0C,IAAtBU,GAAM,EAAIC,IAAO,IACrCX,EAAoBW,IAAO,EAAK,IAChCX,EAAoBW,GAAM,EAAK,IAC/B,IAEN,QAAUruB,GACV,OAAOiuB,CACT,CAwEWiB,CAAWJ,EAEtB,EAyEE/Z,OAAQA,GAEVA,EAAOoa,QAAUnB,EAEbzjB,EACFnT,EAAOC,QAAUA,GAEjB0S,EAAKqlB,OAAS/3B,EACVoT,SAGD,KAFD,aACE,OAAOpT,CACR,iCAGN,CAhcD,gCCRAD,EAAOC,QAAUqhB,EAEjB,IAEID,EAFA5c,EAAY,EAAQ,MAIpBib,EAAYjb,EAAKib,SACjBtO,EAAY3M,EAAK2M,KAGrB,SAAS6mB,EAAgBhX,EAAQiX,GAC7B,OAAOC,WAAW,uBAAyBlX,EAAOxY,IAAM,OAASyvB,GAAe,GAAK,MAAQjX,EAAOld,IACxG,CAQA,SAASud,EAAOjN,GAMZ1S,KAAKwP,IAAMkD,EAMX1S,KAAK8G,IAAM,EAMX9G,KAAKoC,IAAMsQ,EAAOjR,MACtB,CAEA,IA4CQzC,EA5CJy3B,EAAqC,oBAAfxmB,WACpB,SAA4ByC,GAC1B,GAAIA,aAAkBzC,YAActO,MAAM2Q,QAAQI,GAC9C,OAAO,IAAIiN,EAAOjN,GACtB,MAAMlU,MAAM,iBAChB,EAEE,SAAsBkU,GACpB,GAAI/Q,MAAM2Q,QAAQI,GACd,OAAO,IAAIiN,EAAOjN,GACtB,MAAMlU,MAAM,iBAChB,EAEAI,EAAS,WACT,OAAOkE,EAAKkN,OACN,SAA6B0C,GAC3B,OAAQiN,EAAO/gB,OAAS,SAAuB8T,GAC3C,OAAO5P,EAAKkN,OAAO0mB,SAAShkB,GACtB,IAAIgN,EAAahN,GAEjB+jB,EAAa/jB,EACvB,GAAGA,EACP,EAEE+jB,CACV,EAuDA,SAASE,IAEL,IAAI1jB,EAAO,IAAI8K,EAAS,EAAG,GACvBxc,EAAI,EACR,KAAIvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GAanB,CACH,KAAOvF,EAAI,IAAKA,EAAG,CAEf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAG1B,GADAiT,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CACf,CAGA,OADAA,EAAK+K,IAAM/K,EAAK+K,IAA6B,IAAvBhe,KAAKwP,IAAIxP,KAAK8G,SAAqB,EAAJvF,KAAW,EACzD0R,CACX,CAzBI,KAAO1R,EAAI,IAAKA,EAGZ,GADA0R,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAKf,GAFAA,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAC3DmM,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAgB,KAAO,EACvD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAgBf,GAfI1R,EAAI,EAeJvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GACtB,KAAOvF,EAAI,IAAKA,EAGZ,GADA0R,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,OAGf,KAAO1R,EAAI,IAAKA,EAAG,CAEf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAG1B,GADAiT,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CACf,CAGJ,MAAMzU,MAAM,0BAChB,CAiCA,SAASo4B,EAAgBpnB,EAAKvI,GAC1B,OAAQuI,EAAIvI,EAAM,GACVuI,EAAIvI,EAAM,IAAM,EAChBuI,EAAIvI,EAAM,IAAM,GAChBuI,EAAIvI,EAAM,IAAM,MAAQ,CACpC,CA8BA,SAAS4vB,IAGL,GAAI72B,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,OAAO,IAAI+d,EAAS6Y,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,GAAI8vB,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,GACxG,CA5KA6Y,EAAO/gB,OAASA,IAEhB+gB,EAAOngB,UAAUogB,OAAS9c,EAAKnB,MAAMnC,UAAUyiB,UAAuCnf,EAAKnB,MAAMnC,UAAU0B,MAO3Gye,EAAOngB,UAAU6Q,QACTrR,EAAQ,WACL,WACuD,GAA1DA,GAAuC,IAArBgB,KAAKwP,IAAIxP,KAAK8G,QAAuB,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAgB,KAAO,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EACvC,GAA1DA,GAASA,GAA+B,GAAtBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAAO9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IAAK,OAAO9H,EAGjG,IAAKgB,KAAK8G,KAAO,GAAK9G,KAAKoC,IAEvB,MADApC,KAAK8G,IAAM9G,KAAKoC,IACVk0B,EAAgBt2B,KAAM,IAEhC,OAAOhB,CACX,GAOJ2gB,EAAOngB,UAAU0iB,MAAQ,WACrB,OAAuB,EAAhBliB,KAAKqQ,QAChB,EAMAsP,EAAOngB,UAAU2iB,OAAS,WACtB,IAAInjB,EAAQgB,KAAKqQ,SACjB,OAAOrR,IAAU,IAAc,EAARA,EAC3B,EAoFA2gB,EAAOngB,UAAU+iB,KAAO,WACpB,OAAyB,IAAlBviB,KAAKqQ,QAChB,EAaAsP,EAAOngB,UAAUgjB,QAAU,WAGvB,GAAIxiB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,OAAO42B,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,EACjD,EAMA6Y,EAAOngB,UAAUijB,SAAW,WAGxB,GAAIziB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,OAAkD,EAA3C42B,EAAgB52B,KAAKwP,IAAKxP,KAAK8G,KAAO,EACjD,EAkCA6Y,EAAOngB,UAAUojB,MAAQ,WAGrB,GAAI5iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,IAAIhB,EAAQ8D,EAAK8f,MAAMkU,YAAY92B,KAAKwP,IAAKxP,KAAK8G,KAElD,OADA9G,KAAK8G,KAAO,EACL9H,CACX,EAOA2gB,EAAOngB,UAAUsjB,OAAS,WAGtB,GAAI9iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,IAAIhB,EAAQ8D,EAAK8f,MAAMmU,aAAa/2B,KAAKwP,IAAKxP,KAAK8G,KAEnD,OADA9G,KAAK8G,KAAO,EACL9H,CACX,EAMA2gB,EAAOngB,UAAUsP,MAAQ,WACrB,IAAIrN,EAASzB,KAAKqQ,SACdrJ,EAAShH,KAAK8G,IACdG,EAASjH,KAAK8G,IAAMrF,EAGxB,GAAIwF,EAAMjH,KAAKoC,IACX,MAAMk0B,EAAgBt2B,KAAMyB,GAGhC,GADAzB,KAAK8G,KAAOrF,EACRE,MAAM2Q,QAAQtS,KAAKwP,KACnB,OAAOxP,KAAKwP,IAAItO,MAAM8F,EAAOC,GAEjC,GAAID,IAAUC,EAAK,CACf,IAAI+vB,EAAel0B,EAAKkN,OACxB,OAAOgnB,EACDA,EAAannB,MAAM,GACnB,IAAI7P,KAAKwP,IAAIF,YAAY,EACnC,CACA,OAAOtP,KAAK4f,OAAO3e,KAAKjB,KAAKwP,IAAKxI,EAAOC,EAC7C,EAMA0Y,EAAOngB,UAAU+Q,OAAS,WACtB,IAAIzB,EAAQ9O,KAAK8O,QACjB,OAAOW,EAAKyN,KAAKpO,EAAO,EAAGA,EAAMrN,OACrC,EAOAke,EAAOngB,UAAU8J,KAAO,SAAc7H,GAClC,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIzB,KAAK8G,IAAMrF,EAASzB,KAAKoC,IACzB,MAAMk0B,EAAgBt2B,KAAMyB,GAChCzB,KAAK8G,KAAOrF,CAChB,MACI,GAEI,GAAIzB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,YACE,IAAvBA,KAAKwP,IAAIxP,KAAK8G,QAE3B,OAAO9G,IACX,EAOA2f,EAAOngB,UAAUy3B,SAAW,SAASxmB,GACjC,OAAQA,GACJ,KAAK,EACDzQ,KAAKsJ,OACL,MACJ,KAAK,EACDtJ,KAAKsJ,KAAK,GACV,MACJ,KAAK,EACDtJ,KAAKsJ,KAAKtJ,KAAKqQ,UACf,MACJ,KAAK,EACD,KAA0C,IAAlCI,EAA2B,EAAhBzQ,KAAKqQ,WACpBrQ,KAAKi3B,SAASxmB,GAElB,MACJ,KAAK,EACDzQ,KAAKsJ,KAAK,GACV,MAGJ,QACI,MAAM9K,MAAM,qBAAuBiS,EAAW,cAAgBzQ,KAAK8G,KAE3E,OAAO9G,IACX,EAEA2f,EAAO/P,WAAa,SAASsnB,GACzBxX,EAAewX,EACfvX,EAAO/gB,OAASA,IAChB8gB,EAAa9P,aAEb,IAAI/P,EAAKiD,EAAKwX,KAAO,SAAsC,WAC3DxX,EAAKugB,MAAM1D,EAAOngB,UAAW,CAEzB6iB,MAAO,WACH,OAAOsU,EAAe11B,KAAKjB,MAAMH,IAAI,EACzC,EAEAuiB,OAAQ,WACJ,OAAOuU,EAAe11B,KAAKjB,MAAMH,IAAI,EACzC,EAEAyiB,OAAQ,WACJ,OAAOqU,EAAe11B,KAAKjB,MAAMoe,WAAWve,IAAI,EACpD,EAEA6iB,QAAS,WACL,OAAOmU,EAAY51B,KAAKjB,MAAMH,IAAI,EACtC,EAEA8iB,SAAU,WACN,OAAOkU,EAAY51B,KAAKjB,MAAMH,IAAI,EACtC,GAGR,yBC7ZAxB,EAAOC,QAAUU,IAChB,GAA8C,oBAA1CL,OAAOa,UAAU6G,SAASpF,KAAKjC,GAClC,OAAO,EAGR,MAAMQ,EAAYb,OAAOw4B,eAAen4B,GACxC,OAAqB,OAAdQ,GAAsBA,IAAcb,OAAOa,SAAS,+BCD5D,IAAIuxB,EAAWzyB,EAEX2gB,EAAU,EAAQ,MA6BtB8R,EAAS,wBAA0B,CAE/B9iB,WAAY,SAASwR,GAGjB,GAAIA,GAAUA,EAAO,SAAU,CAE3B,IAAI1e,EAAO0e,EAAO,SAAShY,UAAUgY,EAAO,SAASiS,YAAY,KAAO,GACpEvsB,EAAOnF,KAAKmyB,OAAOpxB,GAEvB,GAAIoE,EAAM,CAEN,IAAI0oB,EAAyC,MAA9BpO,EAAO,SAAS5Y,OAAO,GAClC4Y,EAAO,SAASve,MAAM,GAAKue,EAAO,SAKtC,OAH+B,IAA3BoO,EAAS1e,QAAQ,OACjB0e,EAAW,IAAMA,GAEd7tB,KAAKpB,OAAO,CACfivB,SAAUA,EACV7uB,MAAOmG,EAAK+P,OAAO/P,EAAK8I,WAAWwR,IAAS0D,UAEpD,CACJ,CAEA,OAAOnjB,KAAKiO,WAAWwR,EAC3B,EAEAtR,SAAU,SAAS3B,EAASyN,GAGxB,IACIva,EAAS,GACTqB,EAAO,GAGX,GAAIkZ,GAAWA,EAAQS,MAAQlO,EAAQqhB,UAAYrhB,EAAQxN,MAAO,CAE9D+B,EAAOyL,EAAQqhB,SAASpmB,UAAU+E,EAAQqhB,SAAS6D,YAAY,KAAO,GAEtEhyB,EAAS8M,EAAQqhB,SAASpmB,UAAU,EAAG+E,EAAQqhB,SAAS6D,YAAY,KAAO,GAC3E,IAAIvsB,EAAOnF,KAAKmyB,OAAOpxB,GAEnBoE,IACAqH,EAAUrH,EAAK6W,OAAOxP,EAAQxN,OACtC,CAGA,KAAMwN,aAAmBxM,KAAKmc,OAAS3P,aAAmByS,EAAS,CAC/D,IAAIQ,EAASjT,EAAQ2S,MAAMhR,SAAS3B,EAASyN,GAS7C,MALe,KAAXva,IACAA,EAvBQ,wBAyBZqB,EAAOrB,GANyC,MAA9B8M,EAAQ2S,MAAMrR,SAAS,GACrCtB,EAAQ2S,MAAMrR,SAAS5M,MAAM,GAAKsL,EAAQ2S,MAAMrR,UAMpD2R,EAAO,SAAW1e,EACX0e,CACX,CAEA,OAAOzf,KAAKmO,SAAS3B,EAASyN,EAClC,aChGJ,IAAIlX,EAAI,IACJq0B,EAAQ,GAAJr0B,EACJ+S,EAAQ,GAAJshB,EACJ3a,EAAQ,GAAJ3G,EACJ/B,EAAQ,EAAJ0I,EAsJR,SAAS4a,EAAO5sB,EAAI6sB,EAAO9jB,EAAGzS,GAC5B,IAAIw2B,EAAWD,GAAa,IAAJ9jB,EACxB,OAAOvK,KAAKuuB,MAAM/sB,EAAK+I,GAAK,IAAMzS,GAAQw2B,EAAW,IAAM,GAC7D,CAxIAl5B,EAAOC,QAAU,SAAU2M,EAAKgP,GAC9BA,EAAUA,GAAW,CAAC,EACtB,IA8GexP,EACX6sB,EA/GAnyB,SAAc8F,EAClB,GAAa,WAAT9F,GAAqB8F,EAAIxJ,OAAS,EACpC,OAkBJ,SAAesE,GAEb,MADAA,EAAMiJ,OAAOjJ,IACLtE,OAAS,KAAjB,CAGA,IAAIgH,EAAQ,mIAAmIC,KAC7I3C,GAEF,GAAK0C,EAAL,CAGA,IAAI+K,EAAIuW,WAAWthB,EAAM,IAEzB,QADYA,EAAM,IAAM,MAAM2R,eAE5B,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAzDEqC,SAyDKjJ,EACT,IAAK,QACL,IAAK,OACL,IAAK,IACH,OAAOA,EAAIO,EACb,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOP,EAAIiJ,EACb,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACH,OAAOjJ,EAAIsC,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAOtC,EAAI4jB,EACb,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACH,OAAO5jB,EAAIzQ,EACb,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACH,OAAOyQ,EACT,QACE,OA3CJ,CANA,CAmDF,CAzEW8R,CAAMra,GACR,GAAa,WAAT9F,GAAqB0e,SAAS5Y,GACvC,OAAOgP,EAAQ1W,MA0GFkH,EA1GiBQ,GA2G5BqsB,EAAQruB,KAAKsE,IAAI9C,KACRgS,EACJ4a,EAAO5sB,EAAI6sB,EAAO7a,EAAG,OAE1B6a,GAASxhB,EACJuhB,EAAO5sB,EAAI6sB,EAAOxhB,EAAG,QAE1BwhB,GAASF,EACJC,EAAO5sB,EAAI6sB,EAAOF,EAAG,UAE1BE,GAASv0B,EACJs0B,EAAO5sB,EAAI6sB,EAAOv0B,EAAG,UAEvB0H,EAAK,OAvCd,SAAkBA,GAChB,IAAI6sB,EAAQruB,KAAKsE,IAAI9C,GACrB,OAAI6sB,GAAS7a,EACJxT,KAAKuuB,MAAM/sB,EAAKgS,GAAK,IAE1B6a,GAASxhB,EACJ7M,KAAKuuB,MAAM/sB,EAAKqL,GAAK,IAE1BwhB,GAASF,EACJnuB,KAAKuuB,MAAM/sB,EAAK2sB,GAAK,IAE1BE,GAASv0B,EACJkG,KAAKuuB,MAAM/sB,EAAK1H,GAAK,IAEvB0H,EAAK,IACd,CAhGyCgtB,CAASxsB,GAEhD,MAAM,IAAIzM,MACR,wDACE6mB,KAAKE,UAAUta,GAErB,qCCpCA,MAAMysB,EAAiB,EAAQ,OAEzB,eAACj4B,GAAkBd,OAAOa,WAC1B,qBAACm4B,GAAwBh5B,OACzB0K,EAAiB,CAACoW,EAAQ1e,EAAM/B,IAAUL,OAAO0K,eAAeoW,EAAQ1e,EAAM,CACnF/B,QACA0kB,UAAU,EACVhY,YAAY,EACZC,cAAc,IAGTisB,EAAa53B,KACb63B,EAAsB,CAC3BC,cAAc,EACdC,iBAAiB,GAGZC,EAA+Bh5B,IACpC,MAAMkG,EAAO,GAEb,IAAK,MAAMnG,KAAOC,EACbS,EAAewB,KAAKjC,EAAOD,IAC9BmG,EAAK1E,KAAKzB,GAKZ,GAAIJ,OAAOwC,sBAAuB,CACjC,MAAM82B,EAAUt5B,OAAOwC,sBAAsBnC,GAE7C,IAAK,MAAMk5B,KAAUD,EAChBN,EAAqB12B,KAAKjC,EAAOk5B,IACpChzB,EAAK1E,KAAK03B,EAGb,CAEA,OAAOhzB,CAAI,EAGZ,SAASizB,EAAMn5B,GACd,OAAI2C,MAAM2Q,QAAQtT,GAWnB,SAAoB8T,GACnB,MAAMgC,EAAShC,EAAM5R,MAAM,EAAG,GAM9B,OAJA82B,EAA6BllB,GAAO3F,SAAQpO,IAC3CsK,EAAeyL,EAAQ/V,EAAKo5B,EAAMrlB,EAAM/T,IAAM,IAGxC+V,CACR,CAlBSjC,CAAW7T,GAGf04B,EAAe14B,GAiBpB,SAA2BygB,GAC1B,MAAM3K,EAA2C,OAAlCnW,OAAOw4B,eAAe1X,GAAmB9gB,OAAOC,OAAO,MAAQ,CAAC,EAM/E,OAJAo5B,EAA6BvY,GAAQtS,SAAQpO,IAC5CsK,EAAeyL,EAAQ/V,EAAKo5B,EAAM1Y,EAAO1gB,IAAM,IAGzC+V,CACR,CAxBSsjB,CAAkBp5B,GAGnBA,CACR,CA6BA,MAAMq5B,EAAY,CAACC,EAAQnyB,EAAQjB,EAAMqzB,KACxCrzB,EAAKiI,SAAQpO,SACe,IAAhBoH,EAAOpH,IAAwBw5B,EAAOR,kBAK7Ch5B,KAAOu5B,GAAUA,EAAOv5B,KAASJ,OAAOw4B,eAAemB,GAC1DjvB,EAAeivB,EAAQv5B,EAAKskB,EAAMiV,EAAOv5B,GAAMoH,EAAOpH,GAAMw5B,IAE5DlvB,EAAeivB,EAAQv5B,EAAKo5B,EAAMhyB,EAAOpH,KAC1C,IAGMu5B,GAWFR,EAAe,CAACQ,EAAQnyB,EAAQoyB,KACrC,IAAIzjB,EAASwjB,EAAOp3B,MAAM,EAAG,GACzBs3B,EAAc,EAyBlB,MAvBA,CAACF,EAAQnyB,GAAQgH,SAAQ2F,IACxB,MAAM2lB,EAAU,GAGhB,IAAK,IAAIC,EAAI,EAAGA,EAAI5lB,EAAMrR,OAAQi3B,IAC5Bj5B,EAAewB,KAAK6R,EAAO4lB,KAIhCD,EAAQj4B,KAAKwO,OAAO0pB,IAInBrvB,EAAeyL,EAAQ0jB,IAFpB1lB,IAAUwlB,EAEyBxlB,EAAM4lB,GAENP,EAAMrlB,EAAM4lB,MAKpD5jB,EAASujB,EAAUvjB,EAAQhC,EAAOklB,EAA6BllB,GAAOjG,QAAO9N,IAAQ05B,EAAQzN,SAASjsB,KAAOw5B,EAAO,IAG9GzjB,CAAM,EASd,SAASuO,EAAMiV,EAAQnyB,EAAQoyB,GAC9B,OAAIA,EAAOT,cAAgBn2B,MAAM2Q,QAAQgmB,IAAW32B,MAAM2Q,QAAQnM,GAC1D2xB,EAAaQ,EAAQnyB,EAAQoyB,GAGhCb,EAAevxB,IAAYuxB,EAAeY,GAIxCD,EAAUC,EAAQnyB,EAAQ6xB,EAA6B7xB,GAASoyB,GAH/DJ,EAAMhyB,EAIf,CAEA9H,EAAOC,QAAU,YAAa2b,GAC7B,MAAMse,EAASlV,EAAM8U,EAAMN,GAAuB73B,OAAS43B,GAAc53B,MAAS,CAAC,EAAG63B,GACtF,IAAIS,EAAS,CAACK,EAAG,CAAC,GAElB,IAAK,MAAMhM,KAAU1S,EACpB,QAAe/a,IAAXytB,EAAJ,CAIA,IAAK+K,EAAe/K,GACnB,MAAM,IAAIvsB,UAAU,IAAMusB,EAAS,6BAGpC2L,EAASjV,EAAMiV,EAAQ,CAACK,EAAGhM,GAAS4L,EANpC,CASD,OAAOD,EAAOK,CACf,+BCzKAt6B,EAAOC,QAAUsb,EAEjBA,EAAiBC,UAAY,mBAE7B,MAAMyD,EAAQ,EAAQ,MACtB,IAEI+K,EAFAvlB,EAAO,EAAQ,MAMf81B,EAAuB,CAACC,UAAW,OAAQ9d,eAAgB,WAAY+d,YAAa,QAAS7d,iBAAkB,kBAAmBC,wBAAyB,SAAU6d,gBAAiB,UACtLC,EAAiB,CAACH,UAAW,SAAU9d,eAAgB,WAAY+d,YAAa,qBAAsB7d,iBAAkB,kBAAmBC,wBAAyB,WAAY6d,gBAAiB,QACjME,EAAiB,CAACJ,UAAW,OAAQ9d,eAAgB,WAAY+d,YAAa,QAAS7d,iBAAkB,kBAAmBC,wBAAyB,SAAU6d,gBAAiB,UAUpL,SAASnf,EAAiB7Y,EAAMkZ,GAE5B,IAAKnX,EAAKqN,SAASpP,GACf,MAAMX,UAAU,yBAEpB,GAAI6Z,IAAYnX,EAAKoX,SAASD,GAC1B,MAAM7Z,UAAU,6BAMpBJ,KAAKia,QAAUA,EAMfja,KAAKysB,cAAgB,KAMrBzsB,KAAKe,KAAOA,EAMZf,KAAK4a,SAAW,KAOhB5a,KAAK6a,gBAAkB,SAMvB7a,KAAK8a,UAAY,CAAC,EAMlB9a,KAAK0b,OAAS,KAMd1b,KAAKyb,UAAW,EAMhBzb,KAAKoH,QAAU,KAMfpH,KAAKmoB,SAAW,IACpB,CAEAxpB,OAAOu6B,iBAAiBtf,EAAiBpa,UAAW,CAQhDwR,KAAM,CACF5R,IAAK,WAED,IADA,IAAImqB,EAAMvpB,KACY,OAAfupB,EAAI7N,QACP6N,EAAMA,EAAI7N,OACd,OAAO6N,CACX,GASJzb,SAAU,CACN1O,IAAK,WAGD,IAFA,IAAI4gB,EAAO,CAAEhgB,KAAKe,MACdwoB,EAAMvpB,KAAK0b,OACR6N,GACHvJ,EAAKpV,QAAQ2e,EAAIxoB,MACjBwoB,EAAMA,EAAI7N,OAEd,OAAOsE,EAAKnY,KAAK,IACrB,KASR+R,EAAiBpa,UAAU6b,OAAoC,WAC3D,MAAM7c,OACV,EAOAob,EAAiBpa,UAAUke,MAAQ,SAAehC,GAC1C1b,KAAK0b,QAAU1b,KAAK0b,SAAWA,GAC/B1b,KAAK0b,OAAOvc,OAAOa,MACvBA,KAAK0b,OAASA,EACd1b,KAAKyb,UAAW,EAChB,IAAIzK,EAAO0K,EAAO1K,KACdA,aAAgBqX,GAChBrX,EAAKqhB,WAAWryB,KACxB,EAOA4Z,EAAiBpa,UAAUme,SAAW,SAAkBjC,GACpD,IAAI1K,EAAO0K,EAAO1K,KACdA,aAAgBqX,GAChBrX,EAAKwhB,cAAcxyB,MACvBA,KAAK0b,OAAS,KACd1b,KAAKyb,UAAW,CACpB,EAMA7B,EAAiBpa,UAAU0E,QAAU,WACjC,OAAIlE,KAAKyb,UAELzb,gBAAgBqoB,IAChBroB,KAAKm5B,0BAA0Bn5B,KAAK4a,UACpC5a,KAAKyb,UAAW,GAHTzb,IAMf,EAOA4Z,EAAiBpa,UAAU25B,0BAA4B,SAAmCxe,GACtF,OAAO3a,KAAKwc,iBAAiBxc,KAAK4a,UAAYD,EAClD,EAOAf,EAAiBpa,UAAUgd,iBAAmB,SAA0B7B,GACpE,IAAItX,EAAW,CAAC,EAGhB,IAAKsX,EACD,MAAM,IAAInc,MAAM,uBAAyBwB,KAAK8N,UAGlD,IAAIsrB,EAAgBz6B,OAAO01B,OAAOr0B,KAAKia,QAAUtb,OAAO01B,OAAO,CAAC,EAAIr0B,KAAKia,QAAQoC,UAAY,CAAC,EAC1Frc,KAAKoc,0BAA0BzB,IAEnC,GAAI3a,KAAK4a,SAAT,CAGI,GAAgB,WAAZD,EACAtX,EAAW1E,OAAO01B,OAAO,CAAC,EAAG2E,QAC1B,GAAgB,WAAZre,EACPtX,EAAW1E,OAAO01B,OAAO,CAAC,EAAG4E,OAC1B,IAAgB,SAAZte,EAGP,MAAM,IAAInc,MAAM,oBAAsBmc,GAFtCtX,EAAW1E,OAAO01B,OAAO,CAAC,EAAGuE,EAGjC,CACA54B,KAAK8a,UAAYnc,OAAO01B,OAAOhxB,EAAU+1B,GAAiB,CAAC,EAE/D,KAdA,CAmBA,GAAIp5B,KAAK2E,kBAAkB2Y,EAAO,CAC9B,IAAI+b,EAA4B16B,OAAO01B,OAAO,CAAC,EAAGr0B,KAAK2E,OAAOmW,WAC9D9a,KAAK8a,UAAYnc,OAAO01B,OAAOgF,EAA2BD,GAAiB,CAAC,EAChF,MAAO,GAAIp5B,KAAKwa,oBAET,KAAIxa,KAAK0b,OAIZ,MAAM,IAAIld,MAAM,+BAAiCwB,KAAK8N,UAHtD,IAAIsmB,EAAqBz1B,OAAO01B,OAAO,CAAC,EAAGr0B,KAAK0b,OAAOZ,WACvD9a,KAAK8a,UAAYnc,OAAO01B,OAAOD,EAAoBgF,GAAiB,CAAC,EAGzE,CACIp5B,KAAKua,iBAELva,KAAKua,eAAeO,UAAY9a,KAAK8a,UAlBzC,CAoBJ,EAQAlB,EAAiBpa,UAAU4c,0BAA4B,WACnD,MAAO,CAAC,CACZ,EAOAxC,EAAiBpa,UAAU+c,UAAY,SAAmBxb,GACtD,GAAIf,KAAKia,QACL,OAAOja,KAAKia,QAAQlZ,EAE5B,EASA6Y,EAAiBpa,UAAU2b,UAAY,SAAmBpa,EAAM/B,EAAOoc,GAUnE,OATKpb,KAAKia,UACNja,KAAKia,QAAU,CAAC,GAChB,cAAc9R,KAAKpH,GACnB+B,EAAKme,YAAYjhB,KAAKia,QAASlZ,EAAM/B,EAAOoc,GACpCA,QAAmClc,IAAvBc,KAAKia,QAAQlZ,KAC7Bf,KAAKuc,UAAUxb,KAAU/B,IAAOgB,KAAKyb,UAAW,GACpDzb,KAAKia,QAAQlZ,GAAQ/B,GAGlBgB,IACX,EASA4Z,EAAiBpa,UAAU0tB,gBAAkB,SAAyBnsB,EAAM/B,EAAO4tB,GAC1E5sB,KAAKysB,gBACNzsB,KAAKysB,cAAgB,IAEzB,IAAIA,EAAgBzsB,KAAKysB,cACzB,GAAIG,EAAU,CAGV,IAAIU,EAAMb,EAAc6M,MAAK,SAAUhM,GACnC,OAAO3uB,OAAOa,UAAUC,eAAewB,KAAKqsB,EAAKvsB,EACrD,IACA,GAAIusB,EAAK,CAGL,IAAIiM,EAAWjM,EAAIvsB,GACnB+B,EAAKme,YAAYsY,EAAU3M,EAAU5tB,EACzC,MAEIsuB,EAAM,CAAC,GACHvsB,GAAQ+B,EAAKme,YAAY,CAAC,EAAG2L,EAAU5tB,GAC3CytB,EAAcjsB,KAAK8sB,EAE3B,KAAO,CAEH,IAAIkM,EAAS,CAAC,EACdA,EAAOz4B,GAAQ/B,EACfytB,EAAcjsB,KAAKg5B,EACvB,CAEA,OAAOx5B,IACX,EAQA4Z,EAAiBpa,UAAU2xB,WAAa,SAAoBlX,EAASmB,GACjE,GAAInB,EACA,IAAK,IAAI/U,EAAOvG,OAAOuG,KAAK+U,GAAU1Y,EAAI,EAAGA,EAAI2D,EAAKzD,SAAUF,EAC5DvB,KAAKmb,UAAUjW,EAAK3D,GAAI0Y,EAAQ/U,EAAK3D,IAAK6Z,GAClD,OAAOpb,IACX,EAMA4Z,EAAiBpa,UAAU6G,SAAW,WAClC,IAAIwT,EAAY7Z,KAAKsP,YAAYuK,UAC7B/L,EAAY9N,KAAK8N,SACrB,OAAIA,EAASrM,OACFoY,EAAY,IAAM/L,EACtB+L,CACX,EAMAD,EAAiBpa,UAAUgc,eAAiB,WACxC,GAAKxb,KAAK4a,UAA8B,WAAlB5a,KAAK4a,SAK3B,OAAO5a,KAAK4a,QAChB,EAGAhB,EAAiBhK,WAAa,SAAS6pB,GACnCpR,EAAOoR,CACX,+BC1WAp7B,EAAOC,QAAUiqB,EAEjB,IAAIzlB,EAAO,EAAQ,MAsCnB,SAASylB,EAAQmR,EAASC,EAAkBC,GAExC,GAAuB,mBAAZF,EACP,MAAMt5B,UAAU,8BAEpB0C,EAAKnC,aAAaM,KAAKjB,MAMvBA,KAAK05B,QAAUA,EAMf15B,KAAK25B,iBAAmB7sB,QAAQ6sB,GAMhC35B,KAAK45B,kBAAoB9sB,QAAQ8sB,EACrC,EA3DCrR,EAAQ/oB,UAAYb,OAAOC,OAAOkE,EAAKnC,aAAanB,YAAY8P,YAAciZ,EAwE/EA,EAAQ/oB,UAAUq6B,QAAU,SAASA,EAAQjmB,EAAQkmB,EAAaC,EAAcC,EAASpK,GAErF,IAAKoK,EACD,MAAM55B,UAAU,6BAEpB,IAAIkK,EAAOtK,KACX,IAAK4vB,EACD,OAAO9sB,EAAK6gB,UAAUkW,EAASvvB,EAAMsJ,EAAQkmB,EAAaC,EAAcC,GAE5E,GAAK1vB,EAAKovB,QAKV,IACI,OAAOpvB,EAAKovB,QACR9lB,EACAkmB,EAAYxvB,EAAKqvB,iBAAmB,kBAAoB,UAAUK,GAAS7W,UAC3E,SAAqBsD,EAAK4J,GAEtB,GAAI5J,EAEA,OADAnc,EAAKzI,KAAK,QAAS4kB,EAAK7S,GACjBgc,EAASnJ,GAGpB,GAAiB,OAAb4J,EAAJ,CAKA,KAAMA,aAAoB0J,GACtB,IACI1J,EAAW0J,EAAazvB,EAAKsvB,kBAAoB,kBAAoB,UAAUvJ,EACnF,CAAE,MAAO5J,GAEL,OADAnc,EAAKzI,KAAK,QAAS4kB,EAAK7S,GACjBgc,EAASnJ,EACpB,CAIJ,OADAnc,EAAKzI,KAAK,OAAQwuB,EAAUzc,GACrBgc,EAAS,KAAMS,EAZtB,CAFI/lB,EAAKrD,KAAqB,EAelC,GAER,CAAE,MAAOwf,GAGL,OAFAnc,EAAKzI,KAAK,QAAS4kB,EAAK7S,QACxBiT,YAAW,WAAa+I,EAASnJ,EAAM,GAAG,EAE9C,MArCII,YAAW,WAAa+I,EAASpxB,MAAM,iBAAmB,GAAG,EAsCrE,EAOA+pB,EAAQ/oB,UAAUyH,IAAM,SAAagzB,GAOjC,OANIj6B,KAAK05B,UACAO,GACDj6B,KAAK05B,QAAQ,KAAM,KAAM,MAC7B15B,KAAK05B,QAAU,KACf15B,KAAK6B,KAAK,OAAOc,OAEd3C,IACX,+BC5IA3B,EAAOC,QAeP,SAAiBoF,GAab,IAXA,IAAIC,EAAMb,EAAKc,QAAQ,CAAC,IAAK,IAAK,KAAMF,EAAM3C,KAAO,UAA3C+B,CACT,6BADSA,CAEL,qBAFKA,CAGT,qDAAuDY,EAAMK,YAAY8I,QAAO,SAAS7I,GAAS,OAAOA,EAAMM,GAAK,IAAG7C,OAAS,WAAa,IAHpIqB,CAIT,kBAJSA,CAKL,mBALKA,CAML,YANKA,CAOD,QAPCA,CAQL,kBAEDvB,EAAI,EACDA,EAAsBmC,EAAMK,YAAYtC,SAAUF,EAAG,CACxD,IAAIyC,EAAQN,EAAMO,aAAa1C,GAAG2C,UAC9BiB,EAAQnB,EAAMiB,wBAAwBJ,EAAO,QAAUb,EAAMmB,KAC7DhB,EAAQ,IAAMrB,EAAKsB,SAASJ,EAAMjD,MAAO4C,EACxC,aAAcK,EAAM0M,IAGrB1M,EAAMM,KAAOX,EACR,4BAA6BQ,EADrBR,CAEJ,QAASQ,EAFLR,CAGR,kCAEiCzE,IAAlC2D,EAAMQ,SAASW,EAAMe,SAAwBpB,EAC5C,OAAQd,EAAMQ,SAASW,EAAMe,UAC7BpB,EACA,eAEwBzE,IAAzB2D,EAAMQ,SAAS8B,GAAqBxB,EACnC,WAAYd,EAAMQ,SAAS8B,IAC3BxB,EACA,cAELA,EACK,mBADLA,CAES,sBAFTA,CAGS,oBAHTA,CAIa,0BAA2BK,EAAMe,QAJ9CpB,CAKa,gBAEazE,IAAtB2D,EAAMO,MAAM+B,GAAqBxB,EACpB,uCAAwCpC,GACpDoC,EACY,eAAgBwB,GAEjCxB,EACiB,QADjBA,CAEa,WAFbA,CAGiB,qBAHjBA,CAIiB,QAJjBA,CAKS,IALTA,CAMK,UAE6BzE,IAA9B2D,EAAMU,KAAKS,EAAMe,SAAwBpB,EACxC,qDAAwDQ,GACxDR,EACA,cAAeQ,IAGbH,EAAMU,UAAYf,EAEpB,uBAAwBQ,EAAKA,EAFTR,CAGhB,QAASQ,QAGSjF,IAAvB2D,EAAMY,OAAO0B,IAAqBxB,EACjC,iBADiCA,CAE7B,0BAF6BA,CAG7B,kBAH6BA,CAIzB,kBAAmBQ,EAAKgB,EAJCxB,CAKjC,cAGqBzE,IAAtB2D,EAAMO,MAAM+B,GAAqBxB,EAAIK,EAAM4M,UACrC,oDACA,0CAA2CzM,EAAK5C,GACrDoC,EACI,kBAAmBQ,EAAKgB,SAGJjG,IAAtB2D,EAAMO,MAAM+B,GAAqBxB,EAAIK,EAAM4M,UAC5C,8CACA,oCAAqCzM,EAAK5C,GAC/CoC,EACI,YAAaQ,EAAKgB,GAC3BxB,EACS,QADTA,CAEK,IAET,CASA,IATEA,EACO,WADPA,CAEW,kBAFXA,CAGW,QAHXA,CAKG,IALHA,CAMD,KAGIpC,EAAI,EAAGA,EAAImC,EAAMO,aAAaxC,SAAUF,EAAG,CAC5C,IAAI24B,EAASx2B,EAAMO,aAAa1C,GAC5B24B,EAAOlf,UAAUrX,EACxB,4BAA6Bu2B,EAAOn5B,KADZ4C,CAEpB,4CAA6Cw2B,EAAQD,GAC1D,CAEA,OAAOv2B,EACN,WAEL,EA3HA,IAAIkB,EAAU,EAAQ,MAClBhC,EAAU,EAAQ,KAClBC,EAAU,EAAQ,MAEtB,SAASq3B,EAAQn2B,GACb,MAAO,qBAAuBA,EAAMjD,KAAO,GAC/C,kBCHAzC,EAAQ6M,WA8IR,SAAoBhJ,GAQnB,GAPAA,EAAK,IAAMnC,KAAKqL,UAAY,KAAO,IAClCrL,KAAK+J,WACJ/J,KAAKqL,UAAY,MAAQ,KAC1BlJ,EAAK,IACJnC,KAAKqL,UAAY,MAAQ,KAC1B,IAAMhN,EAAOC,QAAQ0O,SAAShN,KAAK0K,OAE/B1K,KAAKqL,UACT,OAGD,MAAMlE,EAAI,UAAYnH,KAAKsL,MAC3BnJ,EAAK+I,OAAO,EAAG,EAAG/D,EAAG,kBAKrB,IAAI0D,EAAQ,EACRuvB,EAAQ,EACZj4B,EAAK,GAAG6D,QAAQ,eAAeyC,IAChB,OAAVA,IAGJoC,IACc,OAAVpC,IAGH2xB,EAAQvvB,GACT,IAGD1I,EAAK+I,OAAOkvB,EAAO,EAAGjzB,EACvB,EA9KA7I,EAAQsO,KAgMR,SAAchB,GACb,IACKA,EACHtN,EAAQ+7B,QAAQC,QAAQ,QAAS1uB,GAEjCtN,EAAQ+7B,QAAQE,WAAW,QAE7B,CAAE,MAAO/S,GAGT,CACD,EA1MAlpB,EAAQkP,KAkNR,WACC,IAAIgtB,EACJ,IACCA,EAAIl8B,EAAQ+7B,QAAQI,QAAQ,QAC7B,CAAE,MAAOjT,GAGT,CAOA,OAJKgT,GAAwB,oBAAZppB,SAA2B,QAASA,UACpDopB,EAAIppB,QAAQvH,IAAI6wB,OAGVF,CACR,EAhOAl8B,EAAQ+M,UAyGR,WAIC,GAAsB,oBAAX0F,QAA0BA,OAAOK,UAAoC,aAAxBL,OAAOK,QAAQjM,MAAuB4L,OAAOK,QAAQupB,QAC5G,OAAO,EAIR,GAAyB,oBAAdC,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUzgB,cAAc3R,MAAM,yBACtG,OAAO,EAGR,IAAI2uB,EAKJ,MAA4B,oBAAb0D,UAA4BA,SAASC,iBAAmBD,SAASC,gBAAgBC,OAASF,SAASC,gBAAgBC,MAAMC,kBAEpH,oBAAXlqB,QAA0BA,OAAO9D,UAAY8D,OAAO9D,QAAQiuB,SAAYnqB,OAAO9D,QAAQkuB,WAAapqB,OAAO9D,QAAQmuB,QAGrG,oBAAdR,WAA6BA,UAAUC,YAAczD,EAAIwD,UAAUC,UAAUzgB,cAAc3R,MAAM,oBAAsB+V,SAAS4Y,EAAE,GAAI,KAAO,IAE/H,oBAAdwD,WAA6BA,UAAUC,WAAaD,UAAUC,UAAUzgB,cAAc3R,MAAM,qBACtG,EAlIAnK,EAAQ+7B,QA4OR,WACC,IAGC,OAAOgB,YACR,CAAE,MAAO7T,GAGT,CACD,CArPkB8T,GAClBh9B,EAAQmN,QAAU,MACjB,IAAI8vB,GAAS,EAEb,MAAO,KACDA,IACJA,GAAS,EACTtuB,QAAQC,KAAK,yIACd,CAED,EATiB,GAelB5O,EAAQgP,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,WAyFDhP,EAAQ8M,IAAM6B,QAAQ7C,OAAS6C,QAAQ7B,KAAO,MAAS,GAkEvD/M,EAAOC,QAAU,EAAQ,IAAR,CAAoBA,GAErC,MAAM,WAAC0M,GAAc3M,EAAOC,QAM5B0M,EAAWxI,EAAI,SAAUnD,GACxB,IACC,OAAOgmB,KAAKE,UAAUlmB,EACvB,CAAE,MAAOmoB,GACR,MAAO,+BAAiCA,EAAMhb,OAC/C,CACD,+BC9QAnO,EAAOC,QAAUwb,EAGjB,IAAIgX,EAAY,EAAQ,QACtBhX,EAAKta,UAAYb,OAAOC,OAAOkyB,EAAUtxB,YAAY8P,YAAcwK,GAAMD,UAAY,OAEvF,IAAIhV,EAAY,EAAQ,MACpByY,EAAY,EAAQ,MACpB3D,EAAY,EAAQ,MACpB2O,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBtJ,EAAY,EAAQ,MACpBU,EAAY,EAAQ,MACpBtQ,EAAY,EAAQ,MACpBvM,EAAY,EAAQ,MACpB6tB,EAAY,EAAQ,MACpBC,EAAY,EAAQ,MACpBC,EAAY,EAAQ,KACpBpjB,EAAY,EAAQ,KACpBsjB,EAAY,EAAQ,MAUxB,SAASjX,EAAK/Y,EAAMkZ,GAChB6W,EAAU7vB,KAAKjB,KAAMe,EAAMkZ,GAM3Bja,KAAKkO,OAAS,CAAC,EAMflO,KAAKquB,YAASnvB,EAMdc,KAAKosB,gBAAaltB,EAMlBc,KAAKqsB,cAAWntB,EAMhBc,KAAKsc,WAAQpd,EAObc,KAAKw7B,YAAc,KAOnBx7B,KAAKiE,aAAe,KAOpBjE,KAAKy7B,aAAe,KAOpBz7B,KAAK07B,MAAQ,IACjB,CAyHA,SAASC,EAAWx2B,GAKhB,OAJAA,EAAKq2B,YAAcr2B,EAAKlB,aAAekB,EAAKs2B,aAAe,YACpDt2B,EAAK+P,cACL/P,EAAK6W,cACL7W,EAAKqa,OACLra,CACX,CA7HAxG,OAAOu6B,iBAAiBpf,EAAKta,UAAW,CAQpCo8B,WAAY,CACRx8B,IAAK,WAGD,GAAIY,KAAKw7B,YACL,OAAOx7B,KAAKw7B,YAEhBx7B,KAAKw7B,YAAc,CAAC,EACpB,IAAK,IAAIx6B,EAAQrC,OAAOuG,KAAKlF,KAAKkO,QAAS3M,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EAAG,CACrE,IAAIyC,EAAQhE,KAAKkO,OAAOlN,EAAMO,IAC1BmP,EAAK1M,EAAM0M,GAGf,GAAI1Q,KAAKw7B,YAAY9qB,GACjB,MAAMlS,MAAM,gBAAkBkS,EAAK,OAAS1Q,MAEhDA,KAAKw7B,YAAY9qB,GAAM1M,CAC3B,CACA,OAAOhE,KAAKw7B,WAChB,GASJz3B,YAAa,CACT3E,IAAK,WACD,OAAOY,KAAKiE,eAAiBjE,KAAKiE,aAAenB,EAAKqd,QAAQngB,KAAKkO,QACvE,GASJpK,YAAa,CACT1E,IAAK,WACD,OAAOY,KAAKy7B,eAAiBz7B,KAAKy7B,aAAe34B,EAAKqd,QAAQngB,KAAKquB,QACvE,GASJlS,KAAM,CACF/c,IAAK,WACD,OAAOY,KAAK07B,QAAU17B,KAAKmc,KAAOrC,EAAK+hB,oBAAoB77B,KAAzB8Z,GACtC,EACAxa,IAAK,SAAS6c,GAGV,IAAI3c,EAAY2c,EAAK3c,UACfA,aAAqByf,KACtB9C,EAAK3c,UAAY,IAAIyf,GAAW3P,YAAc6M,EAC/CrZ,EAAKugB,MAAMlH,EAAK3c,UAAWA,IAI/B2c,EAAKgD,MAAQhD,EAAK3c,UAAU2f,MAAQnf,KAGpC8C,EAAKugB,MAAMlH,EAAM8C,GAAS,GAE1Bjf,KAAK07B,MAAQvf,EAIb,IADA,IAAI5a,EAAI,EACDA,EAAsBvB,KAAK+D,YAAYtC,SAAUF,EACpDvB,KAAKiE,aAAa1C,GAAG2C,UAGzB,IAAI43B,EAAiB,CAAC,EACtB,IAAKv6B,EAAI,EAAGA,EAAsBvB,KAAK8D,YAAYrC,SAAUF,EACzDu6B,EAAe97B,KAAKy7B,aAAal6B,GAAG2C,UAAUnD,MAAQ,CAClD3B,IAAK0D,EAAK+a,YAAY7d,KAAKy7B,aAAal6B,GAAGic,OAC3Cle,IAAKwD,EAAKgb,YAAY9d,KAAKy7B,aAAal6B,GAAGic,QAE/Cjc,GACA5C,OAAOu6B,iBAAiB/c,EAAK3c,UAAWs8B,EAChD,KASRhiB,EAAK+hB,oBAAsB,SAA6Bn4B,GAIpD,IAFA,IAEgBM,EAFZL,EAAMb,EAAKc,QAAQ,CAAC,KAAMF,EAAM3C,MAE3BQ,EAAI,EAAUA,EAAImC,EAAMK,YAAYtC,SAAUF,GAC9CyC,EAAQN,EAAMO,aAAa1C,IAAI+C,IAAKX,EACpC,YAAab,EAAKsB,SAASJ,EAAMjD,OAC7BiD,EAAMU,UAAUf,EACpB,YAAab,EAAKsB,SAASJ,EAAMjD,OAC1C,OAAO4C,EACN,wEADMA,CAEF,uBAET,EA2BAmW,EAAKW,SAAW,SAAkB1Z,EAAM2Z,GACpC,IAAIvV,EAAO,IAAI2U,EAAK/Y,EAAM2Z,EAAKT,SAC/B9U,EAAKinB,WAAa1R,EAAK0R,WACvBjnB,EAAKknB,SAAW3R,EAAK2R,SAGrB,IAFA,IAAIrrB,EAAQrC,OAAOuG,KAAKwV,EAAKxM,QACzB3M,EAAI,EACDA,EAAIP,EAAMS,SAAUF,EACvB4D,EAAK6X,UAC0C,IAAlCtC,EAAKxM,OAAOlN,EAAMO,IAAIwD,QAC7BujB,EAAS7N,SACTd,EAAMc,UAAWzZ,EAAMO,GAAImZ,EAAKxM,OAAOlN,EAAMO,MAEvD,GAAImZ,EAAK2T,OACL,IAAKrtB,EAAQrC,OAAOuG,KAAKwV,EAAK2T,QAAS9sB,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EAC9D4D,EAAK6X,IAAIM,EAAM7C,SAASzZ,EAAMO,GAAImZ,EAAK2T,OAAOrtB,EAAMO,MAC5D,GAAImZ,EAAKgT,OACL,IAAK1sB,EAAQrC,OAAOuG,KAAKwV,EAAKgT,QAASnsB,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EAAG,CACjE,IAAImsB,EAAShT,EAAKgT,OAAO1sB,EAAMO,IAC/B4D,EAAK6X,UACe9d,IAAdwuB,EAAOhd,GACPiJ,EAAMc,cACYvb,IAAlBwuB,EAAOxf,OACP4L,EAAKW,cACavb,IAAlBwuB,EAAOzqB,OACP4B,EAAK4V,cACcvb,IAAnBwuB,EAAOja,QACP8U,EAAQ9N,SACRqW,EAAUrW,UAAWzZ,EAAMO,GAAImsB,GAEzC,CAYJ,OAXIhT,EAAK0R,YAAc1R,EAAK0R,WAAW3qB,SACnC0D,EAAKinB,WAAa1R,EAAK0R,YACvB1R,EAAK2R,UAAY3R,EAAK2R,SAAS5qB,SAC/B0D,EAAKknB,SAAW3R,EAAK2R,UACrB3R,EAAK4B,QACLnX,EAAKmX,OAAQ,GACb5B,EAAKtT,UACLjC,EAAKiC,QAAUsT,EAAKtT,SACpBsT,EAAKC,UACLxV,EAAKyV,SAAWF,EAAKC,SACzBxV,EAAK0V,gBAAkB,SAChB1V,CACX,EAOA2U,EAAKta,UAAU6b,OAAS,SAAgBC,GACpC,IAAIygB,EAAYjL,EAAUtxB,UAAU6b,OAAOpa,KAAKjB,KAAMsb,GAClDC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAenO,KAAKwb,iBACpB,UAAeugB,GAAaA,EAAU9hB,cAAW/a,EACjD,SAAe4xB,EAAUkL,YAAYh8B,KAAK8D,YAAawX,GACvD,SAAewV,EAAUkL,YAAYh8B,KAAK+D,YAAY8I,QAAO,SAAS0F,GAAO,OAAQA,EAAIiI,cAAgB,IAAIc,IAAkB,CAAC,EAChI,aAAetb,KAAKosB,YAAcpsB,KAAKosB,WAAW3qB,OAASzB,KAAKosB,gBAAaltB,EAC7E,WAAec,KAAKqsB,UAAYrsB,KAAKqsB,SAAS5qB,OAASzB,KAAKqsB,cAAWntB,EACvE,QAAec,KAAKsc,YAASpd,EAC7B,SAAe68B,GAAaA,EAAUrO,aAAUxuB,EAChD,UAAeqc,EAAevb,KAAKoH,aAAUlI,GAErD,EAKA4a,EAAKta,UAAU6xB,WAAa,WACxBP,EAAUtxB,UAAU6xB,WAAWpwB,KAAKjB,MACpC,IAAIquB,EAASruB,KAAK8D,YAClB,IAD+BvC,EAAI,EAC5BA,EAAI8sB,EAAO5sB,QACd4sB,EAAO9sB,KAAK2C,UAEhB,IADA,IAAIgK,EAASlO,KAAK+D,YAAaxC,EAAI,EAC5BA,EAAI2M,EAAOzM,QACdyM,EAAO3M,KAAK2C,UAChB,OAAOlE,IACX,EAKA8Z,EAAKta,UAAU25B,0BAA4B,SAAmCxe,GAU1E,OATAA,EAAU3a,KAAK4a,UAAYD,EAE3BmW,EAAUtxB,UAAU25B,0BAA0Bl4B,KAAKjB,KAAM2a,GACzD3a,KAAK8D,YAAYqJ,SAAQqQ,IACrBA,EAAMhB,iBAAiB7B,EAAQ,IAEnC3a,KAAK+D,YAAYoJ,SAAQnJ,IACrBA,EAAMwY,iBAAiB7B,EAAQ,IAE5B3a,IACX,EAKA8Z,EAAKta,UAAUJ,IAAM,SAAa2B,GAC9B,OAAOf,KAAKkO,OAAOnN,IACZf,KAAKquB,QAAUruB,KAAKquB,OAAOttB,IAC3Bf,KAAK0tB,QAAU1tB,KAAK0tB,OAAO3sB,IAC3B,IACX,EASA+Y,EAAKta,UAAUwd,IAAM,SAAayC,GAE9B,GAAIzf,KAAKZ,IAAIqgB,EAAO1e,MAChB,MAAMvC,MAAM,mBAAqBihB,EAAO1e,KAAO,QAAUf,MAE7D,GAAIyf,aAAkB9F,QAA2Bza,IAAlBugB,EAAOjU,OAAsB,CAMxD,GAAIxL,KAAKw7B,YAAyCx7B,KAAKw7B,YAAY/b,EAAO/O,IAAM1Q,KAAK47B,WAAWnc,EAAO/O,IACnG,MAAMlS,MAAM,gBAAkBihB,EAAO/O,GAAK,OAAS1Q,MACvD,GAAIA,KAAKs0B,aAAa7U,EAAO/O,IACzB,MAAMlS,MAAM,MAAQihB,EAAO/O,GAAK,mBAAqB1Q,MACzD,GAAIA,KAAKu0B,eAAe9U,EAAO1e,MAC3B,MAAMvC,MAAM,SAAWihB,EAAO1e,KAAO,oBAAsBf,MAO/D,OALIyf,EAAO/D,QACP+D,EAAO/D,OAAOvc,OAAOsgB,GACzBzf,KAAKkO,OAAOuR,EAAO1e,MAAQ0e,EAC3BA,EAAOjT,QAAUxM,KACjByf,EAAO/B,MAAM1d,MACN27B,EAAW37B,KACtB,CACA,OAAIyf,aAAkBnC,GACbtd,KAAKquB,SACNruB,KAAKquB,OAAS,CAAC,GACnBruB,KAAKquB,OAAO5O,EAAO1e,MAAQ0e,EAC3BA,EAAO/B,MAAM1d,MACN27B,EAAW37B,OAEf8wB,EAAUtxB,UAAUwd,IAAI/b,KAAKjB,KAAMyf,EAC9C,EASA3F,EAAKta,UAAUL,OAAS,SAAgBsgB,GACpC,GAAIA,aAAkB9F,QAA2Bza,IAAlBugB,EAAOjU,OAAsB,CAIxD,IAAKxL,KAAKkO,QAAUlO,KAAKkO,OAAOuR,EAAO1e,QAAU0e,EAC7C,MAAMjhB,MAAMihB,EAAS,uBAAyBzf,MAKlD,cAHOA,KAAKkO,OAAOuR,EAAO1e,MAC1B0e,EAAO/D,OAAS,KAChB+D,EAAO9B,SAAS3d,MACT27B,EAAW37B,KACtB,CACA,GAAIyf,aAAkBnC,EAAO,CAGzB,IAAKtd,KAAKquB,QAAUruB,KAAKquB,OAAO5O,EAAO1e,QAAU0e,EAC7C,MAAMjhB,MAAMihB,EAAS,uBAAyBzf,MAKlD,cAHOA,KAAKquB,OAAO5O,EAAO1e,MAC1B0e,EAAO/D,OAAS,KAChB+D,EAAO9B,SAAS3d,MACT27B,EAAW37B,KACtB,CACA,OAAO8wB,EAAUtxB,UAAUL,OAAO8B,KAAKjB,KAAMyf,EACjD,EAOA3F,EAAKta,UAAU80B,aAAe,SAAsB5jB,GAChD,OAAOogB,EAAUwD,aAAat0B,KAAKqsB,SAAU3b,EACjD,EAOAoJ,EAAKta,UAAU+0B,eAAiB,SAAwBxzB,GACpD,OAAO+vB,EAAUyD,eAAev0B,KAAKqsB,SAAUtrB,EACnD,EAOA+Y,EAAKta,UAAUZ,OAAS,SAAgBsgB,GACpC,OAAO,IAAIlf,KAAKmc,KAAK+C,EACzB,EAMApF,EAAKta,UAAUy8B,MAAQ,WAMnB,IAFA,IAAInuB,EAAW9N,KAAK8N,SAChBjL,EAAW,GACNtB,EAAI,EAAGA,EAAsBvB,KAAK+D,YAAYtC,SAAUF,EAC7DsB,EAAMrC,KAAKR,KAAKiE,aAAa1C,GAAG2C,UAAUe,cAG9CjF,KAAKkV,OAASyb,EAAQ3wB,KAAR2wB,CAAc,CACxBthB,OAASA,EACTxM,MAASA,EACTC,KAASA,IAEb9C,KAAKgc,OAAS4U,EAAQ5wB,KAAR4wB,CAAc,CACxBjR,OAASA,EACT9c,MAASA,EACTC,KAASA,IAEb9C,KAAKwf,OAASqR,EAAS7wB,KAAT6wB,CAAe,CACzBhuB,MAAQA,EACRC,KAAQA,IAEZ9C,KAAKiO,WAAaR,EAAUQ,WAAWjO,KAArByN,CAA2B,CACzC5K,MAAQA,EACRC,KAAQA,IAEZ9C,KAAKmO,SAAWV,EAAUU,SAASnO,KAAnByN,CAAyB,CACrC5K,MAAQA,EACRC,KAAQA,IAIZ,IAAIo5B,EAAUnL,EAASjjB,GACvB,GAAIouB,EAAS,CACT,IAAIC,EAAex9B,OAAOC,OAAOoB,MAE7Bm8B,EAAaluB,WAAajO,KAAKiO,WAC/BjO,KAAKiO,WAAaiuB,EAAQjuB,WAAWmuB,KAAKD,GAG1CA,EAAahuB,SAAWnO,KAAKmO,SAC7BnO,KAAKmO,SAAW+tB,EAAQ/tB,SAASiuB,KAAKD,EAE9C,CAEA,OAAOn8B,IACX,EAQA8Z,EAAKta,UAAU0V,OAAS,SAAsB1I,EAAS4S,GACnD,OAAOpf,KAAKi8B,QAAQ/mB,OAAO1I,EAAS4S,EACxC,EAQAtF,EAAKta,UAAU6f,gBAAkB,SAAyB7S,EAAS4S,GAC/D,OAAOpf,KAAKkV,OAAO1I,EAAS4S,GAAUA,EAAOhd,IAAMgd,EAAO6D,OAAS7D,GAAQ8D,QAC/E,EAUApJ,EAAKta,UAAUwc,OAAS,SAAsBsD,EAAQ7d,GAClD,OAAOzB,KAAKi8B,QAAQjgB,OAAOsD,EAAQ7d,EACvC,EASAqY,EAAKta,UAAU+f,gBAAkB,SAAyBD,GAGtD,OAFMA,aAAkBK,IACpBL,EAASK,EAAO/gB,OAAO0gB,IACpBtf,KAAKgc,OAAOsD,EAAQA,EAAOjP,SACtC,EAOAyJ,EAAKta,UAAUggB,OAAS,SAAsBhT,GAC1C,OAAOxM,KAAKi8B,QAAQzc,OAAOhT,EAC/B,EAOAsN,EAAKta,UAAUyO,WAAa,SAAoBwR,GAC5C,OAAOzf,KAAKi8B,QAAQhuB,WAAWwR,EACnC,EA2BA3F,EAAKta,UAAU2O,SAAW,SAAkB3B,EAASyN,GACjD,OAAOja,KAAKi8B,QAAQ9tB,SAAS3B,EAASyN,EAC1C,EAiBAH,EAAK2C,EAAI,SAAsBoE,GAC3B,OAAO,SAAuBqJ,GAC1BpnB,EAAK+Z,aAAaqN,EAAQrJ,EAC9B,CACJ,yBChmBAxiB,EAAOC,QAmBP,SAAmBuB,EAAIioB,GAKnB,IAJA,IAAIuU,EAAU,IAAI16B,MAAMU,UAAUZ,OAAS,GACvCyB,EAAU,EACV2H,EAAU,EACVyxB,GAAU,EACPzxB,EAAQxI,UAAUZ,QACrB46B,EAAOn5B,KAAYb,UAAUwI,KACjC,OAAO,IAAI0xB,SAAQ,SAAkBr4B,EAASs4B,GAC1CH,EAAOn5B,GAAU,SAAkBujB,GAC/B,GAAI6V,EAEA,GADAA,GAAU,EACN7V,EACA+V,EAAO/V,OACN,CAGD,IAFA,IAAI4V,EAAS,IAAI16B,MAAMU,UAAUZ,OAAS,GACtCyB,EAAS,EACNA,EAASm5B,EAAO56B,QACnB46B,EAAOn5B,KAAYb,UAAUa,GACjCgB,EAAQ3B,MAAM,KAAM85B,EACxB,CAER,EACA,IACIx8B,EAAG0C,MAAMulB,GAAO,KAAMuU,EAC1B,CAAE,MAAO5V,GACD6V,IACAA,GAAU,EACVE,EAAO/V,GAEf,CACJ,GACJ,+BClDApoB,EAAOC,QAAUgqB,EAGjB,IAAI3O,EAAQ,EAAQ,QAClB2O,EAAS9oB,UAAYb,OAAOC,OAAO+a,EAAMna,YAAY8P,YAAcgZ,GAAUzO,UAAY,WAE3F,IAAIhX,EAAU,EAAQ,KAClBC,EAAU,EAAQ,MActB,SAASwlB,EAASvnB,EAAM2P,EAAI3L,EAASI,EAAM8U,EAAS7S,GAIhD,GAHAuS,EAAM1Y,KAAKjB,KAAMe,EAAM2P,EAAIvL,OAAMjG,OAAWA,EAAW+a,EAAS7S,IAG3DtE,EAAKqN,SAASpL,GACf,MAAM3E,UAAU,4BAMpBJ,KAAK+E,QAAUA,EAMf/E,KAAKy8B,gBAAkB,KAGvBz8B,KAAKsE,KAAM,CACf,CAuBAgkB,EAAS7N,SAAW,SAAkB1Z,EAAM2Z,GACxC,OAAO,IAAI4N,EAASvnB,EAAM2Z,EAAKhK,GAAIgK,EAAK3V,QAAS2V,EAAKvV,KAAMuV,EAAKT,QAASS,EAAKtT,QACnF,EAOAkhB,EAAS9oB,UAAU6b,OAAS,SAAgBC,GACxC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAK+E,QACjB,OAAY/E,KAAKmF,KACjB,KAAYnF,KAAK0Q,GACjB,SAAY1Q,KAAKwL,OACjB,UAAYxL,KAAKia,QACjB,UAAYsB,EAAevb,KAAKoH,aAAUlI,GAElD,EAKAopB,EAAS9oB,UAAU0E,QAAU,WACzB,GAAIlE,KAAKyb,SACL,OAAOzb,KAGX,QAAmCd,IAA/B2D,EAAMW,OAAOxD,KAAK+E,SAClB,MAAMvG,MAAM,qBAAuBwB,KAAK+E,SAE5C,OAAO4U,EAAMna,UAAU0E,QAAQjD,KAAKjB,KACxC,EAYAsoB,EAAS7L,EAAI,SAA0BC,EAASggB,EAAcC,GAU1D,MAP8B,mBAAnBA,EACPA,EAAiB75B,EAAK+Z,aAAa8f,GAAgB57B,KAG9C47B,GAA4C,iBAAnBA,IAC9BA,EAAiB75B,EAAKga,aAAa6f,GAAgB57B,MAEhD,SAA2BvB,EAAWud,GACzCja,EAAK+Z,aAAard,EAAU8P,aACvB0N,IAAI,IAAIsL,EAASvL,EAAWL,EAASggB,EAAcC,GAC5D,CACJ,kBC7HA,IAAI1X,EAAiB,EAAQ,MAE7B3mB,EAAQs+B,UAAY,SAAS3iB,GAC3B,IAAIiL,EAAW5mB,EAAQ4mB,SAASjL,GAChC,OAAO,IAAIgL,EAAeC,EAAU,CAChCC,QAASlL,IAAYA,EAAQkL,SAAWlL,EAAQ4iB,UAAYjX,KAC5DkB,MAAO7M,GAAWA,EAAQ6M,MAC1BnB,aAAc1L,GAAWA,EAAQ0L,cAEvC,EAEArnB,EAAQ4mB,SAAW,SAASjL,GAC1B,GAAIA,aAAmBtY,MACrB,MAAO,GAAGP,OAAO6Y,GAGnB,IAAI6iB,EAAO,CACTD,QAAS,GACTE,OAAQ,EACRC,WAAY,IACZC,WAAYrX,IACZsX,WAAW,GAEb,IAAK,IAAIn+B,KAAOkb,EACd6iB,EAAK/9B,GAAOkb,EAAQlb,GAGtB,GAAI+9B,EAAKE,WAAaF,EAAKG,WACzB,MAAM,IAAIz+B,MAAM,yCAIlB,IADA,IAAI0mB,EAAW,GACN3jB,EAAI,EAAGA,EAAIu7B,EAAKD,QAASt7B,IAChC2jB,EAAS1kB,KAAKR,KAAKm9B,cAAc57B,EAAGu7B,IAYtC,OATI7iB,GAAWA,EAAQkL,UAAYD,EAASzjB,QAC1CyjB,EAAS1kB,KAAKR,KAAKm9B,cAAc57B,EAAGu7B,IAItC5X,EAAS9W,MAAK,SAASuS,EAAEC,GACvB,OAAOD,EAAIC,CACb,IAEOsE,CACT,EAEA5mB,EAAQ6+B,cAAgB,SAASpW,EAAS+V,GACxC,IAAIM,EAAUN,EAAc,UACvB7zB,KAAKm0B,SAAW,EACjB,EAEAxW,EAAU3d,KAAKuuB,MAAM4F,EAASn0B,KAAK1K,IAAIu+B,EAAKE,WAAY,GAAK/zB,KAAK0qB,IAAImJ,EAAKC,OAAQhW,IAGvF,OAFU9d,KAAKC,IAAI0d,EAASkW,EAAKG,WAGnC,EAEA3+B,EAAQ++B,KAAO,SAAS9qB,EAAK0H,EAASxG,GAMpC,GALIwG,aAAmBtY,QACrB8R,EAAUwG,EACVA,EAAU,OAGPxG,EAEH,IAAK,IAAI1U,KADT0U,EAAU,GACMlB,EACU,mBAAbA,EAAIxT,IACb0U,EAAQjT,KAAKzB,GAKnB,IAAK,IAAIwC,EAAI,EAAGA,EAAIkS,EAAQhS,OAAQF,IAAK,CACvC,IAAIqS,EAAWH,EAAQlS,GACnB+7B,EAAW/qB,EAAIqB,GAEnBrB,EAAIqB,GAAU,SAAsB0pB,GAClC,IAAIC,EAAWj/B,EAAQs+B,UAAU3iB,GAC7B9X,EAAWR,MAAMnC,UAAU0B,MAAMD,KAAKoB,UAAW,GACjDutB,EAAWztB,EAAKq7B,MAEpBr7B,EAAK3B,MAAK,SAASimB,GACb8W,EAAG/W,MAAMC,KAGTA,IACFpkB,UAAU,GAAKk7B,EAAGlW,aAEpBuI,EAASrtB,MAAMvC,KAAMqC,WACvB,IAEAk7B,EAAGxW,SAAQ,WACTuW,EAAS/6B,MAAMgQ,EAAKpQ,EACtB,GACF,EAAEi6B,KAAK7pB,EAAK+qB,GACZ/qB,EAAIqB,GAAQqG,QAAUA,CACxB,CACF,yBCzFA,SAASrW,EAAQ65B,EAAgBC,GAGC,iBAAnBD,IACPC,EAAeD,EACfA,OAAiBv+B,GAGrB,IAAIy+B,EAAO,GAYX,SAASC,EAAQC,GAIb,GAAmC,iBAAxBA,EAAkC,CACzC,IAAI13B,EAASE,IAIb,GAHIzC,EAAQk6B,SACR7wB,QAAQ7B,IAAI,YAAcjF,GAC9BA,EAAS,UAAYA,EACjB03B,EAAqB,CAKrB,IAJA,IAAIE,EAAcp/B,OAAOuG,KAAK24B,GAC1BG,EAAc,IAAIr8B,MAAMo8B,EAAUt8B,OAAS,GAC3Cw8B,EAAc,IAAIt8B,MAAMo8B,EAAUt8B,QAClCy8B,EAAc,EACXA,EAAcH,EAAUt8B,QAC3Bu8B,EAAYE,GAAeH,EAAUG,GACrCD,EAAYC,GAAeL,EAAoBE,EAAUG,MAG7D,OADAF,EAAYE,GAAe/3B,EACpBg4B,SAAS57B,MAAM,KAAMy7B,GAAaz7B,MAAM,KAAM07B,EACzD,CACA,OAAOE,SAASh4B,EAATg4B,EACX,CAKA,IAFA,IAAIC,EAAe,IAAIz8B,MAAMU,UAAUZ,OAAS,GAC5C48B,EAAe,EACZA,EAAeD,EAAa38B,QAC/B28B,EAAaC,GAAgBh8B,YAAYg8B,GAY7C,GAXAA,EAAe,EACfR,EAAsBA,EAAoB73B,QAAQ,gBAAgB,SAAiBC,EAAIC,GACnF,IAAIlH,EAAQo/B,EAAaC,KACzB,OAAQn4B,GACJ,IAAK,IAAK,IAAK,IAAK,OAAO8I,OAAOzE,OAAOvL,IACzC,IAAK,IAAK,OAAOgQ,OAAO/F,KAAK6a,MAAM9kB,IACnC,IAAK,IAAK,OAAOqmB,KAAKE,UAAUvmB,GAChC,IAAK,IAAK,OAAOgQ,OAAOhQ,GAE5B,MAAO,GACX,IACIq/B,IAAiBD,EAAa38B,OAC9B,MAAMjD,MAAM,4BAEhB,OADAm/B,EAAKn9B,KAAKq9B,GACHD,CACX,CAEA,SAASv3B,EAASi4B,GACd,MAAO,aAAeA,GAAwBZ,GAAgB,IAAM,KAAOD,GAAkBA,EAAe51B,KAAK,MAAQ,IAAM,SAAW81B,EAAK91B,KAAK,QAAU,KAClK,CAGA,OADA+1B,EAAQv3B,SAAWA,EACZu3B,CACX,CAjFAv/B,EAAOC,QAAUsF,EAiGjBA,EAAQk6B,SAAU,+BCjGlBz/B,EAAOC,QAAUkqB,EAGjB,IAAI5O,EAAmB,EAAQ,QAC7B4O,EAAOhpB,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAckZ,GAAQ3O,UAAY,SAElG,IAAI/W,EAAO,EAAQ,MAiBnB,SAAS0lB,EAAOznB,EAAMoE,EAAMmmB,EAAaE,EAAcD,EAAeE,EAAgBxR,EAAS7S,EAASqlB,GAYpG,GATI3pB,EAAKoX,SAASqR,IACdtR,EAAUsR,EACVA,EAAgBE,OAAiBvsB,GAC1B4D,EAAKoX,SAASuR,KACrBxR,EAAUwR,EACVA,OAAiBvsB,QAINA,IAATiG,IAAsBrC,EAAKqN,SAAShL,GACtC,MAAM/E,UAAU,yBAGpB,IAAK0C,EAAKqN,SAASmb,GACf,MAAMlrB,UAAU,gCAGpB,IAAK0C,EAAKqN,SAASqb,GACf,MAAMprB,UAAU,iCAEpBwZ,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,GAMlCja,KAAKmF,KAAOA,GAAQ,MAMpBnF,KAAKsrB,YAAcA,EAMnBtrB,KAAKurB,gBAAgBA,QAAuBrsB,EAM5Cc,KAAKwrB,aAAeA,EAMpBxrB,KAAKyrB,iBAAiBA,QAAwBvsB,EAM9Cc,KAAKu+B,oBAAsB,KAM3Bv+B,KAAKw+B,qBAAuB,KAM5Bx+B,KAAKoH,QAAUA,EAKfpH,KAAKysB,cAAgBA,CACzB,CAsBAjE,EAAO/N,SAAW,SAAkB1Z,EAAM2Z,GACtC,OAAO,IAAI8N,EAAOznB,EAAM2Z,EAAKvV,KAAMuV,EAAK4Q,YAAa5Q,EAAK8Q,aAAc9Q,EAAK6Q,cAAe7Q,EAAK+Q,eAAgB/Q,EAAKT,QAASS,EAAKtT,QAASsT,EAAK+R,cACtJ,EAOAjE,EAAOhpB,UAAU6b,OAAS,SAAgBC,GACtC,IAAIC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,OAAiC,QAAdnO,KAAKmF,MAA6CnF,KAAKmF,WAAQjG,EAClF,cAAmBc,KAAKsrB,YACxB,gBAAmBtrB,KAAKurB,cACxB,eAAmBvrB,KAAKwrB,aACxB,iBAAmBxrB,KAAKyrB,eACxB,UAAmBzrB,KAAKia,QACxB,UAAmBsB,EAAevb,KAAKoH,aAAUlI,EACjD,gBAAmBc,KAAKysB,eAEhC,EAKAjE,EAAOhpB,UAAU0E,QAAU,WAGvB,OAAIlE,KAAKyb,SACEzb,MAEXA,KAAKu+B,oBAAsBv+B,KAAK0b,OAAO+iB,WAAWz+B,KAAKsrB,aACvDtrB,KAAKw+B,qBAAuBx+B,KAAK0b,OAAO+iB,WAAWz+B,KAAKwrB,cAEjD5R,EAAiBpa,UAAU0E,QAAQjD,KAAKjB,MACnD,6BCxJA,IAAI+b,EAASzd,EAObyd,EAAOta,OAAS,SAAgB8O,GAC5B,IAAImuB,EAAInuB,EAAO9O,OACf,IAAKi9B,EACD,OAAO,EAEX,IADA,IAAIlrB,EAAI,IACCkrB,EAAI,EAAI,GAA0B,MAArBnuB,EAAO1J,OAAO63B,MAC9BlrB,EACN,OAAOvK,KAAK01B,KAAqB,EAAhBpuB,EAAO9O,QAAc,EAAI+R,CAC9C,EASA,IANA,IAAIorB,EAAM,IAAIj9B,MAAM,IAGhBk9B,EAAM,IAAIl9B,MAAM,KAGXJ,EAAI,EAAGA,EAAI,IAChBs9B,EAAID,EAAIr9B,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,GAAKA,EAAI,EAAIA,EAAI,GAAK,IAAMA,IASrFwa,EAAO7G,OAAS,SAAgBxC,EAAQ1L,EAAOC,GAM3C,IALA,IAIIkW,EAJAC,EAAQ,KACRC,EAAQ,GACR9b,EAAI,EACJiB,EAAI,EAEDwE,EAAQC,GAAK,CAChB,IAAI2Z,EAAIlO,EAAO1L,KACf,OAAQxE,GACJ,KAAK,EACD6a,EAAM9b,KAAOq9B,EAAIhe,GAAK,GACtBzD,GAAS,EAAJyD,IAAU,EACfpe,EAAI,EACJ,MACJ,KAAK,EACD6a,EAAM9b,KAAOq9B,EAAIzhB,EAAIyD,GAAK,GAC1BzD,GAAS,GAAJyD,IAAW,EAChBpe,EAAI,EACJ,MACJ,KAAK,EACD6a,EAAM9b,KAAOq9B,EAAIzhB,EAAIyD,GAAK,GAC1BvD,EAAM9b,KAAOq9B,EAAQ,GAAJhe,GACjBpe,EAAI,EAGRjB,EAAI,QACH6b,IAAUA,EAAQ,KAAK5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,IAC/D9b,EAAI,EAEZ,CAOA,OANIiB,IACA6a,EAAM9b,KAAOq9B,EAAIzhB,GACjBE,EAAM9b,KAAO,GACH,IAANiB,IACA6a,EAAM9b,KAAO,KAEjB6b,GACI7b,GACA6b,EAAM5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,KACzD6b,EAAMvV,KAAK,KAEfmH,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,GAC5D,EAEA,IAAIu9B,EAAkB,mBAUtB/iB,EAAOC,OAAS,SAAgBzL,EAAQmC,EAAQxP,GAI5C,IAHA,IAEIia,EAFAnW,EAAQ9D,EACRV,EAAI,EAECjB,EAAI,EAAGA,EAAIgP,EAAO9O,QAAS,CAChC,IAAI0F,EAAIoJ,EAAOlD,WAAW9L,KAC1B,GAAU,KAAN4F,GAAY3E,EAAI,EAChB,MACJ,QAAqBtD,KAAhBiI,EAAI03B,EAAI13B,IACT,MAAM3I,MAAMsgC,GAChB,OAAQt8B,GACJ,KAAK,EACD2a,EAAIhW,EACJ3E,EAAI,EACJ,MACJ,KAAK,EACDkQ,EAAOxP,KAAYia,GAAK,GAAS,GAAJhW,IAAW,EACxCgW,EAAIhW,EACJ3E,EAAI,EACJ,MACJ,KAAK,EACDkQ,EAAOxP,MAAiB,GAAJia,IAAW,GAAS,GAAJhW,IAAW,EAC/CgW,EAAIhW,EACJ3E,EAAI,EACJ,MACJ,KAAK,EACDkQ,EAAOxP,MAAiB,EAAJia,IAAU,EAAIhW,EAClC3E,EAAI,EAGhB,CACA,GAAU,IAANA,EACA,MAAMhE,MAAMsgC,GAChB,OAAO57B,EAAS8D,CACpB,EAOA+U,EAAO5T,KAAO,SAAcoI,GACxB,MAAO,mEAAmEpI,KAAKoI,EACnF,+BCzIAlS,EAAOC,QAAUwyB,EAGjB,IAAIlX,EAAmB,EAAQ,QAC7BkX,EAAUtxB,UAAYb,OAAOC,OAAOgb,EAAiBpa,YAAY8P,YAAcwhB,GAAWjX,UAAY,YAExG,IAIIC,EACAyO,EACA1jB,EANA8U,EAAW,EAAQ,MACnB7W,EAAW,EAAQ,MACnBwa,EAAW,EAAQ,MAoCvB,SAAS0e,EAAYlpB,EAAOwI,GACxB,GAAMxI,GAASA,EAAMrR,OAArB,CAGA,IADA,IAAI8Q,EAAM,CAAC,EACFhR,EAAI,EAAGA,EAAIuR,EAAMrR,SAAUF,EAChCgR,EAAIO,EAAMvR,GAAGR,MAAQ+R,EAAMvR,GAAG8Z,OAAOC,GACzC,OAAO/I,CAJa,CAKxB,CA2CA,SAASue,EAAU/vB,EAAMkZ,GACrBL,EAAiB3Y,KAAKjB,KAAMe,EAAMkZ,GAMlCja,KAAK0tB,YAASxuB,EAOdc,KAAKuyB,aAAe,IACxB,CAEA,SAASoJ,EAAW5xB,GAEhB,OADAA,EAAUwoB,aAAe,KAClBxoB,CACX,CAjFA+mB,EAAUrW,SAAW,SAAkB1Z,EAAM2Z,GACzC,OAAO,IAAIoW,EAAU/vB,EAAM2Z,EAAKT,SAASmX,QAAQ1W,EAAKgT,OAC1D,EAkBAoD,EAAUkL,YAAcA,EAQxBlL,EAAUwD,aAAe,SAAsBjI,EAAU3b,GACrD,GAAI2b,EACA,IAAK,IAAI9qB,EAAI,EAAGA,EAAI8qB,EAAS5qB,SAAUF,EACnC,GAA2B,iBAAhB8qB,EAAS9qB,IAAmB8qB,EAAS9qB,GAAG,IAAMmP,GAAM2b,EAAS9qB,GAAG,GAAKmP,EAC5E,OAAO,EACnB,OAAO,CACX,EAQAogB,EAAUyD,eAAiB,SAAwBlI,EAAUtrB,GACzD,GAAIsrB,EACA,IAAK,IAAI9qB,EAAI,EAAGA,EAAI8qB,EAAS5qB,SAAUF,EACnC,GAAI8qB,EAAS9qB,KAAOR,EAChB,OAAO,EACnB,OAAO,CACX,EAyCApC,OAAO0K,eAAeynB,EAAUtxB,UAAW,cAAe,CACtDJ,IAAK,WACD,OAAOY,KAAKuyB,eAAiBvyB,KAAKuyB,aAAezvB,EAAKqd,QAAQngB,KAAK0tB,QACvE,IA2BJoD,EAAUtxB,UAAU6b,OAAS,SAAgBC,GACzC,OAAOxY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKia,QACjB,SAAY+hB,EAAYh8B,KAAKsyB,YAAahX,IAElD,EAOAwV,EAAUtxB,UAAU4xB,QAAU,SAAiB2N,GAG3C,GAAIA,EACA,IAAK,IAA4CrR,EAAxC1sB,EAAQrC,OAAOuG,KAAK65B,GAAax9B,EAAI,EAAWA,EAAIP,EAAMS,SAAUF,EACzEmsB,EAASqR,EAAW/9B,EAAMO,IAJzBvB,KAKEgd,UACqB9d,IAAlBwuB,EAAOxf,OACP4L,EAAKW,cACavb,IAAlBwuB,EAAOzqB,OACP4B,EAAK4V,cACcvb,IAAnBwuB,EAAOja,QACP8U,EAAQ9N,cACMvb,IAAdwuB,EAAOhd,GACPiJ,EAAMc,SACNqW,EAAUrW,UAAWzZ,EAAMO,GAAImsB,IAI7C,OAAO1tB,IACX,EAOA8wB,EAAUtxB,UAAUJ,IAAM,SAAa2B,GACnC,OAAOf,KAAK0tB,QAAU1tB,KAAK0tB,OAAO3sB,IAC3B,IACX,EASA+vB,EAAUtxB,UAAUw/B,QAAU,SAAiBj+B,GAC3C,GAAIf,KAAK0tB,QAAU1tB,KAAK0tB,OAAO3sB,aAAiB8D,EAC5C,OAAO7E,KAAK0tB,OAAO3sB,GAAMkC,OAC7B,MAAMzE,MAAM,iBAAmBuC,EACnC,EASA+vB,EAAUtxB,UAAUwd,IAAM,SAAayC,GAEnC,KAAMA,aAAkB9F,QAA2Bza,IAAlBugB,EAAOjU,QAAwBiU,aAAkB3F,GAAS2F,aAAkBnC,GAASmC,aAAkB5a,GAAQ4a,aAAkB8I,GAAW9I,aAAkBqR,GAC3L,MAAM1wB,UAAU,wCAEpB,GAAKJ,KAAK0tB,OAEL,CACD,IAAI7kB,EAAO7I,KAAKZ,IAAIqgB,EAAO1e,MAC3B,GAAI8H,EAAM,CACN,KAAIA,aAAgBioB,GAAarR,aAAkBqR,IAAejoB,aAAgBiR,GAAQjR,aAAgB0f,EAWtG,MAAM/pB,MAAM,mBAAqBihB,EAAO1e,KAAO,QAAUf,MARzD,IADA,IAAI0tB,EAAS7kB,EAAKypB,YACT/wB,EAAI,EAAGA,EAAImsB,EAAOjsB,SAAUF,EACjCke,EAAOzC,IAAI0Q,EAAOnsB,IACtBvB,KAAKb,OAAO0J,GACP7I,KAAK0tB,SACN1tB,KAAK0tB,OAAS,CAAC,GACnBjO,EAAO0R,WAAWtoB,EAAKoR,SAAS,EAIxC,CACJ,MAjBIja,KAAK0tB,OAAS,CAAC,EA6BnB,OAXA1tB,KAAK0tB,OAAOjO,EAAO1e,MAAQ0e,EAErBzf,gBAAgB8Z,GAAQ9Z,gBAAgBuoB,GAAWvoB,gBAAgB6E,GAAQ7E,gBAAgB2Z,GAExF8F,EAAO7E,WAER6E,EAAO7E,SAAW6E,EAAO5E,iBAIjC4E,EAAO/B,MAAM1d,MACN27B,EAAW37B,KACtB,EASA8wB,EAAUtxB,UAAUL,OAAS,SAAgBsgB,GAEzC,KAAMA,aAAkB7F,GACpB,MAAMxZ,UAAU,qCACpB,GAAIqf,EAAO/D,SAAW1b,KAClB,MAAMxB,MAAMihB,EAAS,uBAAyBzf,MAOlD,cALOA,KAAK0tB,OAAOjO,EAAO1e,MACrBpC,OAAOuG,KAAKlF,KAAK0tB,QAAQjsB,SAC1BzB,KAAK0tB,YAASxuB,GAElBugB,EAAO9B,SAAS3d,MACT27B,EAAW37B,KACtB,EAQA8wB,EAAUtxB,UAAUmrB,OAAS,SAAgB3K,EAAMtF,GAE/C,GAAI5X,EAAKqN,SAAS6P,GACdA,EAAOA,EAAKtY,MAAM,UACjB,IAAK/F,MAAM2Q,QAAQ0N,GACpB,MAAM5f,UAAU,gBACpB,GAAI4f,GAAQA,EAAKve,QAAsB,KAAZue,EAAK,GAC5B,MAAMxhB,MAAM,yBAGhB,IADA,IAAI+qB,EAAMvpB,KACHggB,EAAKve,OAAS,GAAG,CACpB,IAAI2f,EAAOpB,EAAK1X,QAChB,GAAIihB,EAAImE,QAAUnE,EAAImE,OAAOtM,IAEzB,MADAmI,EAAMA,EAAImE,OAAOtM,cACI0P,GACjB,MAAMtyB,MAAM,kDAEhB+qB,EAAIvM,IAAIuM,EAAM,IAAIuH,EAAU1P,GACpC,CAGA,OAFI1G,GACA6O,EAAI6H,QAAQ1W,GACT6O,CACX,EAMAuH,EAAUtxB,UAAU6xB,WAAa,WAC7B,IAAI3D,EAAS1tB,KAAKsyB,YAAa/wB,EAAI,EAEnC,IADAvB,KAAKkE,UACE3C,EAAImsB,EAAOjsB,QACVisB,EAAOnsB,aAAcuvB,EACrBpD,EAAOnsB,KAAK8vB,aAEZ3D,EAAOnsB,KAAK2C,UACpB,OAAOlE,IACX,EAKA8wB,EAAUtxB,UAAU25B,0BAA4B,SAAmCxe,GAO/E,OANAA,EAAU3a,KAAK4a,UAAYD,EAE3Bf,EAAiBpa,UAAU25B,0BAA0Bl4B,KAAKjB,KAAM2a,GAChE3a,KAAKsyB,YAAYnlB,SAAQugB,IACrBA,EAAOyL,0BAA0Bxe,EAAQ,IAEtC3a,IACX,EASA8wB,EAAUtxB,UAAU2yB,OAAS,SAAgBnS,EAAMif,EAAaC,GAS5D,GAN2B,kBAAhBD,GACPC,EAAuBD,EACvBA,OAAc//B,GACP+/B,IAAgBt9B,MAAM2Q,QAAQ2sB,KACrCA,EAAc,CAAEA,IAEhBn8B,EAAKqN,SAAS6P,IAASA,EAAKve,OAAQ,CACpC,GAAa,MAATue,EACA,OAAOhgB,KAAKgR,KAChBgP,EAAOA,EAAKtY,MAAM,IACtB,MAAO,IAAKsY,EAAKve,OACb,OAAOzB,KAGX,GAAgB,KAAZggB,EAAK,GACL,OAAOhgB,KAAKgR,KAAKmhB,OAAOnS,EAAK9e,MAAM,GAAI+9B,GAG3C,IAAIE,EAAQn/B,KAAKZ,IAAI4gB,EAAK,IAC1B,GAAImf,GACA,GAAoB,IAAhBnf,EAAKve,QACL,IAAKw9B,GAAeA,EAAY9vB,QAAQgwB,EAAM7vB,cAAgB,EAC1D,OAAO6vB,OACR,GAAIA,aAAiBrO,IAAcqO,EAAQA,EAAMhN,OAAOnS,EAAK9e,MAAM,GAAI+9B,GAAa,IACvF,OAAOE,OAIX,IAAK,IAAI59B,EAAI,EAAGA,EAAIvB,KAAKsyB,YAAY7wB,SAAUF,EAC3C,GAAIvB,KAAKuyB,aAAahxB,aAAcuvB,IAAcqO,EAAQn/B,KAAKuyB,aAAahxB,GAAG4wB,OAAOnS,EAAMif,GAAa,IACrG,OAAOE,EAGnB,OAAoB,OAAhBn/B,KAAK0b,QAAmBwjB,EACjB,KACJl/B,KAAK0b,OAAOyW,OAAOnS,EAAMif,EACpC,EAoBAnO,EAAUtxB,UAAUi/B,WAAa,SAAoBze,GACjD,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAElG,IAChC,IAAKqlB,EACD,MAAM3gC,MAAM,iBAAmBwhB,GACnC,OAAOmf,CACX,EASArO,EAAUtxB,UAAU4/B,WAAa,SAAoBpf,GACjD,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAEnb,IAChC,IAAKs6B,EACD,MAAM3gC,MAAM,iBAAmBwhB,EAAO,QAAUhgB,MACpD,OAAOm/B,CACX,EASArO,EAAUtxB,UAAUmc,iBAAmB,SAA0BqE,GAC7D,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAElG,EAAMjV,IACtC,IAAKs6B,EACD,MAAM3gC,MAAM,yBAA2BwhB,EAAO,QAAUhgB,MAC5D,OAAOm/B,CACX,EASArO,EAAUtxB,UAAU6/B,cAAgB,SAAuBrf,GACvD,IAAImf,EAAQn/B,KAAKmyB,OAAOnS,EAAM,CAAEuI,IAChC,IAAK4W,EACD,MAAM3gC,MAAM,oBAAsBwhB,EAAO,QAAUhgB,MACvD,OAAOm/B,CACX,EAGArO,EAAUlhB,WAAa,SAASqN,EAAOqiB,EAAUC,GAC7CzlB,EAAUmD,EACVsL,EAAU+W,EACVz6B,EAAU06B,CACd,+BCtcA,IAAIxX,EAAW1pB,EAAOC,QAAU,EAAjB,MAEfypB,EAASE,MAAQ,OAGjBF,EAAS3iB,SAAmB,EAAQ,KACpC2iB,EAASzC,MAAmB,EAAQ,MACpCyC,EAASwF,OAAmB,EAAQ,MAGpCxF,EAASM,KAAKzY,WAAWmY,EAASjO,KAAMiO,EAASzC,MAAOyC,EAASwF,mCCJjE,IAAIvN,EAAO1hB,EAEPkhC,EAMJxf,EAAKwf,WAAa,SAAoBxf,GAClC,MAAO,eAAe7X,KAAK6X,EAC/B,EAEIyf,EAMJzf,EAAKyf,UAAY,SAAmBzf,GAGhC,IAAI5C,GAFJ4C,EAAOA,EAAKha,QAAQ,MAAO,KACfA,QAAQ,UAAW,MACX0B,MAAM,KACtBg4B,EAAWF,EAAWxf,GACtBtgB,EAAW,GACXggC,IACAhgC,EAAS0d,EAAM9U,QAAU,KAC7B,IAAK,IAAI/G,EAAI,EAAGA,EAAI6b,EAAM3b,QACL,OAAb2b,EAAM7b,GACFA,EAAI,GAAsB,OAAjB6b,EAAM7b,EAAI,GACnB6b,EAAMlS,SAAS3J,EAAG,GACbm+B,EACLtiB,EAAMlS,OAAO3J,EAAG,KAEdA,EACc,MAAb6b,EAAM7b,GACb6b,EAAMlS,OAAO3J,EAAG,KAEdA,EAEV,OAAO7B,EAAS0d,EAAMvV,KAAK,IAC/B,EASAmY,EAAK9b,QAAU,SAAiBy7B,EAAYC,EAAaC,GAGrD,OAFKA,IACDD,EAAcH,EAAUG,IACxBJ,EAAWI,GACJA,GACNC,IACDF,EAAaF,EAAUE,KACnBA,EAAaA,EAAW35B,QAAQ,iBAAkB,KAAKvE,OAASg+B,EAAUE,EAAa,IAAMC,GAAeA,EACxH,yBC/DAvhC,EAAOC,QA6BP,SAAcuR,EAAO3O,EAAOzC,GACxB,IAAIqhC,EAASrhC,GAAQ,KACjBshC,EAASD,IAAS,EAClBE,EAAS,KACT98B,EAAS48B,EACb,OAAO,SAAoBrhC,GACvB,GAAIA,EAAO,GAAKA,EAAOshC,EACnB,OAAOlwB,EAAMpR,GACbyE,EAASzE,EAAOqhC,IAChBE,EAAOnwB,EAAMiwB,GACb58B,EAAS,GAEb,IAAIsM,EAAMtO,EAAMD,KAAK++B,EAAM98B,EAAQA,GAAUzE,GAG7C,OAFa,EAATyE,IACAA,EAAwB,GAAL,EAATA,IACPsM,CACX,CACJ,yBCwCA,SAASywB,EAAQ3hC,GAwNb,MArN4B,oBAAjB4hC,aAA8B,WAErC,IAAIC,EAAM,IAAID,aAAa,EAAG,IAC1BE,EAAM,IAAInwB,WAAWkwB,EAAIztB,QACzB2tB,EAAiB,MAAXD,EAAI,GAEd,SAASE,EAAmBr1B,EAAKuE,EAAK1I,GAClCq5B,EAAI,GAAKl1B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAEA,SAASG,EAAmBt1B,EAAKuE,EAAK1I,GAClCq5B,EAAI,GAAKl1B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAOA,SAASI,EAAkBhxB,EAAK1I,GAK5B,OAJAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZq5B,EAAI,EACf,CAEA,SAASM,EAAkBjxB,EAAK1I,GAK5B,OAJAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZq5B,EAAI,EACf,CAlBA7hC,EAAQukB,aAAewd,EAAKC,EAAqBC,EAEjDjiC,EAAQoiC,aAAeL,EAAKE,EAAqBD,EAmBjDhiC,EAAQw4B,YAAcuJ,EAAKG,EAAoBC,EAE/CniC,EAAQqiC,YAAcN,EAAKI,EAAoBD,CAGlD,CAjDwC,GAiD9B,WAEP,SAASI,EAAmBC,EAAW51B,EAAKuE,EAAK1I,GAC7C,IAAIwX,EAAOrT,EAAM,EAAI,EAAI,EAGzB,GAFIqT,IACArT,GAAOA,GACC,IAARA,EACA41B,EAAU,EAAI51B,EAAM,EAAmB,EAAqB,WAAYuE,EAAK1I,QAC5E,GAAIg6B,MAAM71B,GACX41B,EAAU,WAAYrxB,EAAK1I,QAC1B,GAAImE,EAAM,qBACX41B,GAAWviB,GAAQ,GAAK,cAAgB,EAAG9O,EAAK1I,QAC/C,GAAImE,EAAM,sBACX41B,GAAWviB,GAAQ,GAAKrV,KAAKuuB,MAAMvsB,EAAM,yBAA4B,EAAGuE,EAAK1I,OAC5E,CACD,IAAIi6B,EAAW93B,KAAK6a,MAAM7a,KAAKmC,IAAIH,GAAOhC,KAAK+3B,KAE/CH,GAAWviB,GAAQ,GAAKyiB,EAAW,KAAO,GAD0B,QAArD93B,KAAKuuB,MAAMvsB,EAAMhC,KAAK0qB,IAAI,GAAIoN,GAAY,YACI,EAAGvxB,EAAK1I,EACzE,CACJ,CAKA,SAASm6B,EAAkBC,EAAU1xB,EAAK1I,GACtC,IAAIq6B,EAAOD,EAAS1xB,EAAK1I,GACrBwX,EAAsB,GAAd6iB,GAAQ,IAAU,EAC1BJ,EAAWI,IAAS,GAAK,IACzBC,EAAkB,QAAPD,EACf,OAAoB,MAAbJ,EACDK,EACAtX,IACAxL,GAAOsH,KACM,IAAbmb,EACO,qBAAPziB,EAA+B8iB,EAC/B9iB,EAAOrV,KAAK0qB,IAAI,EAAGoN,EAAW,MAAQK,EAAW,QAC3D,CAfA9iC,EAAQukB,aAAe+d,EAAmBxE,KAAK,KAAMiF,GACrD/iC,EAAQoiC,aAAeE,EAAmBxE,KAAK,KAAMkF,GAgBrDhjC,EAAQw4B,YAAcmK,EAAkB7E,KAAK,KAAMmF,GACnDjjC,EAAQqiC,YAAcM,EAAkB7E,KAAK,KAAMoF,EAEtD,CAzCU,GA4CiB,oBAAjBC,aAA8B,WAErC,IAAIC,EAAM,IAAID,aAAa,EAAE,IACzBrB,EAAM,IAAInwB,WAAWyxB,EAAIhvB,QACzB2tB,EAAiB,MAAXD,EAAI,GAEd,SAASuB,EAAoB12B,EAAKuE,EAAK1I,GACnC46B,EAAI,GAAKz2B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAEA,SAASwB,EAAoB32B,EAAKuE,EAAK1I,GACnC46B,EAAI,GAAKz2B,EACTuE,EAAI1I,GAAWs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CAOA,SAASyB,EAAmBryB,EAAK1I,GAS7B,OARAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZ46B,EAAI,EACf,CAEA,SAASI,EAAmBtyB,EAAK1I,GAS7B,OARAs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZ46B,EAAI,EACf,CA1BApjC,EAAQykB,cAAgBsd,EAAKsB,EAAsBC,EAEnDtjC,EAAQyjC,cAAgB1B,EAAKuB,EAAsBD,EA2BnDrjC,EAAQy4B,aAAesJ,EAAKwB,EAAqBC,EAEjDxjC,EAAQ0jC,aAAe3B,EAAKyB,EAAqBD,CAGpD,CAjEwC,GAiE9B,WAEP,SAASI,EAAoBpB,EAAWqB,EAAMC,EAAMl3B,EAAKuE,EAAK1I,GAC1D,IAAIwX,EAAOrT,EAAM,EAAI,EAAI,EAGzB,GAFIqT,IACArT,GAAOA,GACC,IAARA,EACA41B,EAAU,EAAGrxB,EAAK1I,EAAMo7B,GACxBrB,EAAU,EAAI51B,EAAM,EAAmB,EAAqB,WAAYuE,EAAK1I,EAAMq7B,QAChF,GAAIrB,MAAM71B,GACb41B,EAAU,EAAGrxB,EAAK1I,EAAMo7B,GACxBrB,EAAU,WAAYrxB,EAAK1I,EAAMq7B,QAC9B,GAAIl3B,EAAM,sBACb41B,EAAU,EAAGrxB,EAAK1I,EAAMo7B,GACxBrB,GAAWviB,GAAQ,GAAK,cAAgB,EAAG9O,EAAK1I,EAAMq7B,OACnD,CACH,IAAIf,EACJ,GAAIn2B,EAAM,uBAEN41B,GADAO,EAAWn2B,EAAM,UACM,EAAGuE,EAAK1I,EAAMo7B,GACrCrB,GAAWviB,GAAQ,GAAK8iB,EAAW,cAAgB,EAAG5xB,EAAK1I,EAAMq7B,OAC9D,CACH,IAAIpB,EAAW93B,KAAK6a,MAAM7a,KAAKmC,IAAIH,GAAOhC,KAAK+3B,KAC9B,OAAbD,IACAA,EAAW,MAEfF,EAAqB,kBADrBO,EAAWn2B,EAAMhC,KAAK0qB,IAAI,GAAIoN,MACY,EAAGvxB,EAAK1I,EAAMo7B,GACxDrB,GAAWviB,GAAQ,GAAKyiB,EAAW,MAAQ,GAAgB,QAAXK,EAAqB,WAAa,EAAG5xB,EAAK1I,EAAMq7B,EACpG,CACJ,CACJ,CAKA,SAASC,EAAmBlB,EAAUgB,EAAMC,EAAM3yB,EAAK1I,GACnD,IAAIkX,EAAKkjB,EAAS1xB,EAAK1I,EAAMo7B,GACzBjkB,EAAKijB,EAAS1xB,EAAK1I,EAAMq7B,GACzB7jB,EAAoB,GAAZL,GAAM,IAAU,EACxB8iB,EAAW9iB,IAAO,GAAK,KACvBmjB,EAAW,YAAmB,QAALnjB,GAAgBD,EAC7C,OAAoB,OAAb+iB,EACDK,EACAtX,IACAxL,GAAOsH,KACM,IAAbmb,EACO,OAAPziB,EAAgB8iB,EAChB9iB,EAAOrV,KAAK0qB,IAAI,EAAGoN,EAAW,OAASK,EAAW,iBAC5D,CAhBA9iC,EAAQykB,cAAgBkf,EAAoB7F,KAAK,KAAMiF,EAAa,EAAG,GACvE/iC,EAAQyjC,cAAgBE,EAAoB7F,KAAK,KAAMkF,EAAa,EAAG,GAiBvEhjC,EAAQy4B,aAAeqL,EAAmBhG,KAAK,KAAMmF,EAAY,EAAG,GACpEjjC,EAAQ0jC,aAAeI,EAAmBhG,KAAK,KAAMoF,EAAY,EAAG,EAEvE,CArDU,GAuDJljC,CACX,CAIA,SAAS+iC,EAAYp2B,EAAKuE,EAAK1I,GAC3B0I,EAAI1I,GAAyB,IAAbmE,EAChBuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAAK,IAC7BuE,EAAI1I,EAAM,GAAMmE,IAAQ,GAAK,IAC7BuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAC5B,CAEA,SAASq2B,EAAYr2B,EAAKuE,EAAK1I,GAC3B0I,EAAI1I,GAAYmE,IAAQ,GACxBuE,EAAI1I,EAAM,GAAMmE,IAAQ,GAAK,IAC7BuE,EAAI1I,EAAM,GAAMmE,IAAQ,EAAK,IAC7BuE,EAAI1I,EAAM,GAAmB,IAAbmE,CACpB,CAEA,SAASs2B,EAAW/xB,EAAK1I,GACrB,OAAQ0I,EAAI1I,GACJ0I,EAAI1I,EAAM,IAAM,EAChB0I,EAAI1I,EAAM,IAAM,GAChB0I,EAAI1I,EAAM,IAAM,MAAQ,CACpC,CAEA,SAAS06B,EAAWhyB,EAAK1I,GACrB,OAAQ0I,EAAI1I,IAAY,GAChB0I,EAAI1I,EAAM,IAAM,GAChB0I,EAAI1I,EAAM,IAAM,EAChB0I,EAAI1I,EAAM,MAAQ,CAC9B,CA5UAzI,EAAOC,QAAU2hC,EAAQA,gCCDzB5hC,EAAOC,QAAUiqB,EAGjB,IAAIuI,EAAY,EAAQ,QACtBvI,EAAQ/oB,UAAYb,OAAOC,OAAOkyB,EAAUtxB,YAAY8P,YAAciZ,GAAS1O,UAAY,UAE7F,IAAI2O,EAAS,EAAQ,MACjB1lB,EAAS,EAAQ,MACjBolB,EAAS,EAAQ,MAWrB,SAASK,EAAQxnB,EAAMkZ,GACnB6W,EAAU7vB,KAAKjB,KAAMe,EAAMkZ,GAM3Bja,KAAKyT,QAAU,CAAC,EAOhBzT,KAAKqiC,cAAgB,IACzB,CA4DA,SAAS1G,EAAWvQ,GAEhB,OADAA,EAAQiX,cAAgB,KACjBjX,CACX,CA/CA7C,EAAQ9N,SAAW,SAAkB1Z,EAAM2Z,GACvC,IAAI0Q,EAAU,IAAI7C,EAAQxnB,EAAM2Z,EAAKT,SAErC,GAAIS,EAAKjH,QACL,IAAK,IAAIzS,EAAQrC,OAAOuG,KAAKwV,EAAKjH,SAAUlS,EAAI,EAAGA,EAAIP,EAAMS,SAAUF,EACnE6pB,EAAQpO,IAAIwL,EAAO/N,SAASzZ,EAAMO,GAAImZ,EAAKjH,QAAQzS,EAAMO,MAOjE,OANImZ,EAAKgT,QACLtC,EAAQgG,QAAQ1W,EAAKgT,QACrBhT,EAAKC,UACLyQ,EAAQxQ,SAAWF,EAAKC,SAC5ByQ,EAAQhkB,QAAUsT,EAAKtT,QACvBgkB,EAAQvQ,gBAAkB,SACnBuQ,CACX,EAOA7C,EAAQ/oB,UAAU6b,OAAS,SAAgBC,GACvC,IAAIygB,EAAYjL,EAAUtxB,UAAU6b,OAAOpa,KAAKjB,KAAMsb,GAClDC,IAAeD,GAAgBxO,QAAQwO,EAAcC,cACzD,OAAOzY,EAAKqL,SAAS,CACjB,UAAYnO,KAAKwb,iBACjB,UAAYugB,GAAaA,EAAU9hB,cAAW/a,EAC9C,UAAY4xB,EAAUkL,YAAYh8B,KAAKsiC,aAAchnB,IAA6C,CAAC,EACnG,SAAYygB,GAAaA,EAAUrO,aAAUxuB,EAC7C,UAAYqc,EAAevb,KAAKoH,aAAUlI,GAElD,EAQAP,OAAO0K,eAAekf,EAAQ/oB,UAAW,eAAgB,CACrDJ,IAAK,WACD,OAAOY,KAAKqiC,gBAAkBriC,KAAKqiC,cAAgBv/B,EAAKqd,QAAQngB,KAAKyT,SACzE,IAWJ8U,EAAQ/oB,UAAUJ,IAAM,SAAa2B,GACjC,OAAOf,KAAKyT,QAAQ1S,IACb+vB,EAAUtxB,UAAUJ,IAAI6B,KAAKjB,KAAMe,EAC9C,EAKAwnB,EAAQ/oB,UAAU6xB,WAAa,WAC3BP,EAAUtxB,UAAU0E,QAAQjD,KAAKjB,MAEjC,IADA,IAAIyT,EAAUzT,KAAKsiC,aACV/gC,EAAI,EAAGA,EAAIkS,EAAQhS,SAAUF,EAClCkS,EAAQlS,GAAG2C,UACf,OAAOlE,IACX,EAKAuoB,EAAQ/oB,UAAU25B,0BAA4B,SAAmCxe,GAO7E,OANAA,EAAU3a,KAAK4a,UAAYD,EAE3BmW,EAAUtxB,UAAU25B,0BAA0Bl4B,KAAKjB,KAAM2a,GACzD3a,KAAKsiC,aAAan1B,SAAQyG,IACtBA,EAAOulB,0BAA0Bxe,EAAQ,IAEtC3a,IACX,EAKAuoB,EAAQ/oB,UAAUwd,IAAM,SAAayC,GAGjC,GAAIzf,KAAKZ,IAAIqgB,EAAO1e,MAChB,MAAMvC,MAAM,mBAAqBihB,EAAO1e,KAAO,QAAUf,MAE7D,OAAIyf,aAAkB+I,GAClBxoB,KAAKyT,QAAQgM,EAAO1e,MAAQ0e,EAC5BA,EAAO/D,OAAS1b,KACT27B,EAAW37B,OAEf8wB,EAAUtxB,UAAUwd,IAAI/b,KAAKjB,KAAMyf,EAC9C,EAKA8I,EAAQ/oB,UAAUL,OAAS,SAAgBsgB,GACvC,GAAIA,aAAkB+I,EAAQ,CAG1B,GAAIxoB,KAAKyT,QAAQgM,EAAO1e,QAAU0e,EAC9B,MAAMjhB,MAAMihB,EAAS,uBAAyBzf,MAIlD,cAFOA,KAAKyT,QAAQgM,EAAO1e,MAC3B0e,EAAO/D,OAAS,KACTigB,EAAW37B,KACtB,CACA,OAAO8wB,EAAUtxB,UAAUL,OAAO8B,KAAKjB,KAAMyf,EACjD,EASA8I,EAAQ/oB,UAAUZ,OAAS,SAAgB86B,EAASC,EAAkBC,GAElE,IADA,IACgBhmB,EADZ2uB,EAAa,IAAIra,EAAIK,QAAQmR,EAASC,EAAkBC,GACnDr4B,EAAI,EAAWA,EAAsBvB,KAAKsiC,aAAa7gC,SAAUF,EAAG,CACzE,IAAI6S,EAAatR,EAAK4hB,SAAS9Q,EAAS5T,KAAKqiC,cAAc9gC,IAAI2C,UAAUnD,MAAMiF,QAAQ,WAAY,IACnGu8B,EAAWnuB,GAActR,EAAKc,QAAQ,CAAC,IAAI,KAAMd,EAAKwd,WAAWlM,GAAcA,EAAa,IAAMA,EAAzEtR,CAAqF,iCAArFA,CAAuH,CAC5Is0B,EAAGxjB,EACH4uB,EAAG5uB,EAAO2qB,oBAAoBpiB,KAC9BpZ,EAAG6Q,EAAO4qB,qBAAqBriB,MAEvC,CACA,OAAOomB,CACX,6BCvLA5jC,OAAO0K,eAAe/K,EAAS,aAAc,CAAEU,OAAO,IACtD,MAAMyjC,EACF,WAAAnzB,GACItP,KAAK0iC,UAAY,GACjB1iC,KAAK2iC,UAAY,GACjB3iC,KAAK4iC,cAAgB,CAAC,EACtB5iC,KAAK6iC,UAAW,EAChB7iC,KAAK8iC,WAAY,CACrB,CACA,IAAAtiC,CAAKxB,GACD,GAAIgB,KAAK8iC,UACL,OACJ,MAAMC,EAAa,CAAE/jC,QAAOgkC,MAAM,GAClC,GAAIhjC,KAAK0iC,UAAUjhC,OAAQ,CACvB,MAAMwhC,EAAcjjC,KAAK0iC,UAAUp6B,QAC/B26B,GACAA,EAAY/+B,QAAQ6+B,EAC5B,MAEI/iC,KAAK2iC,UAAUniC,KAAK+7B,QAAQr4B,QAAQ6+B,SACT7jC,IAAvBc,KAAKkjC,eACLljC,KAAK2iC,UAAUlhC,QAAUzB,KAAKkjC,gBAC7BljC,KAAK6iC,WACN7iC,KAAK6iC,UAAW,EACZ7iC,KAAK4iC,cAAcO,UACnBnjC,KAAK4iC,cAAcO,YAEdl2B,SACLA,QAAQC,KAAK,+BAA+BlN,KAAK2iC,UAAUlhC,gBAI3E,CACA,IAAA6kB,GACI,IAAItmB,KAAK8iC,UAAT,CAEA9iC,KAAK8iC,WAAY,EACjB9iC,KAAKb,SACL,IAAK,MAAM8jC,KAAejjC,KAAK0iC,UAC3BO,EAAY/+B,QAAQ,CAAElF,WAAOE,EAAW8jC,MAAM,IAElDhjC,KAAK0iC,UAAUjhC,OAAS,CANd,CAOd,CACA,IAAA2hC,CAAK5b,GACD,IAAIxnB,KAAK8iC,UAIT,GAFA9iC,KAAK8iC,WAAY,EACjB9iC,KAAKb,SACDa,KAAK0iC,UAAUjhC,OAAQ,CACvB,IAAK,MAAMwhC,KAAejjC,KAAK0iC,UAC3BO,EAAYzG,OAAOhV,GAEvBxnB,KAAK0iC,UAAUjhC,OAAS,CAC5B,KACK,CACD,MAAM4hC,EAAY9G,QAAQC,OAAOhV,GAEjC6b,EAAUC,OAAM,SAChBtjC,KAAK2iC,UAAUniC,KAAK6iC,EACxB,CACJ,CACA,MAAAlkC,GACIo9B,QAAQr4B,UAAUq/B,MAAK,KACfvjC,KAAKwjC,gBACLxjC,KAAKwjC,gBAAgB,GAEjC,CACA,CAACC,OAAOC,iBACJ,MAAO,CACHr7B,KAAOrJ,IACH,MAAM8V,EAAS9U,KAAK2iC,UAAUr6B,QAC9B,OAAIwM,QAC0B5V,IAAtBc,KAAK2jC,cACL3jC,KAAK2iC,UAAUlhC,QAAUzB,KAAK2jC,cAC9B3jC,KAAK6iC,WACL7iC,KAAK6iC,UAAW,EACZ7iC,KAAK4iC,cAAcgB,UACnB5jC,KAAK4iC,cAAcgB,YAGpB9uB,GAEF9U,KAAK8iC,UACHvG,QAAQr4B,QAAQ,CAAElF,WAAOE,EAAW8jC,MAAM,IAG1C,IAAIzG,SAAQ,CAACr4B,EAASs4B,KACzBx8B,KAAK0iC,UAAUliC,KAAK,CAAE0D,UAASs4B,UAAS,GAEhD,EAEJqH,OAAQ,KACJ7jC,KAAK8iC,WAAY,EACjB9iC,KAAK2iC,UAAUlhC,OAAS,EACxBzB,KAAKb,SACEo9B,QAAQr4B,QAAQ,CAAElF,WAAOE,EAAW8jC,MAAM,KAG7D,EAEJ,MAAMp5B,EACF,WAAA0F,CAAYw0B,GAAQ,cAAEZ,EAAgB,IAAG,aAAES,EAAe,GAAM,CAAC,GAC7D,MAAMI,EAAQ,IAAItB,EAClBsB,EAAMb,cAAgBA,EACtBa,EAAMJ,aAAeA,EACrBI,EAAMP,eACFM,EAAO,CACHtjC,KAAMxB,GAAS+kC,EAAMvjC,KAAKxB,GAC1BsnB,KAAM,IAAMyd,EAAMzd,OAClB8c,KAAM5b,GAASuc,EAAMX,KAAK5b,GAC1B/kB,GAAI,CAACtC,EAAON,KACRkkC,EAAMnB,cAAcziC,GAASN,CAAE,KAEjC,MAAU,GACpBG,KAAKyjC,OAAOC,eAAiB,IAAMK,EAAMN,OAAOC,iBAChD/kC,OAAOmd,OAAO9b,KAClB,EAEJ1B,EAAQsL,cAAgBA,EACxBtL,EAAA,QAAkBsL,ICvHdo6B,yBAA2B,CAAC,ECA5BC,eADAC,SDIJ,SAASC,oBAAoBC,GAE5B,IAAIC,EAAeL,yBAAyBI,GAC5C,QAAqBllC,IAAjBmlC,EACH,OAAOA,EAAa/lC,QAGrB,IAAID,EAAS2lC,yBAAyBI,GAAY,CAGjD9lC,QAAS,CAAC,GAOX,OAHAgmC,oBAAoBF,GAAUnjC,KAAK5C,EAAOC,QAASD,EAAQA,EAAOC,QAAS6lC,qBAGpE9lC,EAAOC,OACf,CEtBA6lC,oBAAoBI,KAAO,CAAC,EDAxBL,SAAWvlC,OAAOw4B,eAAkB5kB,GAAS5T,OAAOw4B,eAAe5kB,GAASA,GAASA,EAAa,UAQtG4xB,oBAAoBhnB,EAAI,SAASne,EAAOwlC,GAEvC,GADU,EAAPA,IAAUxlC,EAAQgB,KAAKhB,IAChB,EAAPwlC,EAAU,OAAOxlC,EACpB,GAAoB,iBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAPwlC,GAAaxlC,EAAMylC,WAAY,OAAOzlC,EAC1C,GAAW,GAAPwlC,GAAoC,mBAAfxlC,EAAMukC,KAAqB,OAAOvkC,CAC5D,CACA,IAAI+N,EAAKpO,OAAOC,OAAO,MACvBulC,oBAAoB3J,EAAEztB,GACtB,IAAI23B,EAAM,CAAC,EACXT,eAAiBA,gBAAkB,CAAC,KAAMC,SAAS,CAAC,GAAIA,SAAS,IAAKA,SAASA,WAC/E,IAAI,IAAIS,EAAiB,EAAPH,GAAYxlC,EAAyB,iBAAX2lC,KAAyBV,eAAe90B,QAAQw1B,GAAUA,EAAUT,SAASS,GACxHhmC,OAAOimC,oBAAoBD,GAASx3B,SAASpO,GAAS2lC,EAAI3lC,GAAO,IAAOC,EAAMD,KAI/E,OAFA2lC,EAAa,QAAI,IAAM,EACvBP,oBAAoB1nB,EAAE1P,EAAI23B,GACnB33B,CACR,EExBAo3B,oBAAoB1nB,EAAI,CAACne,EAASumC,KACjC,IAAI,IAAI9lC,KAAO8lC,EACXV,oBAAoBhhC,EAAE0hC,EAAY9lC,KAASolC,oBAAoBhhC,EAAE7E,EAASS,IAC5EJ,OAAO0K,eAAe/K,EAASS,EAAK,CAAE2M,YAAY,EAAMtM,IAAKylC,EAAW9lC,IAE1E,ECNDolC,oBAAoBhhC,EAAI,CAACoP,EAAK5E,IAAUhP,OAAOa,UAAUC,eAAewB,KAAKsR,EAAK5E,GCClFw2B,oBAAoB3J,EAAKl8B,IACH,oBAAXmlC,QAA0BA,OAAOqB,aAC1CnmC,OAAO0K,eAAe/K,EAASmlC,OAAOqB,YAAa,CAAE9lC,MAAO,WAE7DL,OAAO0K,eAAe/K,EAAS,aAAc,CAAEU,OAAO,GAAO,42CCDvD,SAAS6Q,EAAMpR,EAAO,GACzB,OAAO,IAAIwR,WAAWxR,EAC1B,CAMO,SAASumB,EAAYvmB,EAAO,GAC/B,OAAO,IAAIwR,WAAWxR,EAC1B,iFCZA,MAAMsmC,EAAK97B,KAAK0qB,IAAI,EAAG,GACjBqR,EAAK/7B,KAAK0qB,IAAI,EAAG,IACjBsR,EAAKh8B,KAAK0qB,IAAI,EAAG,IACjBuR,EAAKj8B,KAAK0qB,IAAI,EAAG,IACjBwR,EAAKl8B,KAAK0qB,IAAI,EAAG,IACjByR,EAAKn8B,KAAK0qB,IAAI,EAAG,IACjB0R,EAAKp8B,KAAK0qB,IAAI,EAAG,IAEjB2R,EAAM,IAENC,EAAO,IACN,SAASC,EAAexmC,GAC3B,GAAIA,EAAQ+lC,EACR,OAAO,EAEX,GAAI/lC,EAAQgmC,EACR,OAAO,EAEX,GAAIhmC,EAAQimC,EACR,OAAO,EAEX,GAAIjmC,EAAQkmC,EACR,OAAO,EAEX,GAAIlmC,EAAQmmC,EACR,OAAO,EAEX,GAAInmC,EAAQomC,EACR,OAAO,EAEX,GAAIpmC,EAAQqmC,EACR,OAAO,EAEX,GAA+B,MAA3B96B,OAAOk7B,kBAA4BzmC,EAAQuL,OAAOk7B,iBAClD,MAAM,IAAIjP,WAAW,2BAEzB,OAAO,CACX,CACO,SAASkP,EAAiB1mC,EAAOwQ,EAAKtM,EAAS,GAClD,OAAQsiC,EAAexmC,IACnB,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EAAgBsmC,EACjCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAItM,KAAqB,IAARlE,EACjBA,KAAW,EACX,MAEJ,QAAS,MAAM,IAAIR,MAAM,eAE7B,OAAOgR,CACX,CAwCO,SAASm2B,EAAiBn2B,EAAKtM,GAClC,IAAI0d,EAAIpR,EAAItM,GACR0iC,EAAM,EAEV,GADAA,GAAOhlB,EAAI2kB,EACP3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,IAAS,EACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQL,EAChBtkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQJ,EAChBvkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQH,EAChBxkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAItM,EAAS,GACjB0iC,IAAQhlB,EAAI2kB,GAAQF,EAChBzkB,EAAI0kB,EACJ,OAAOM,EAEX,MAAM,IAAIpP,WAAW,0BACzB,CA6CO,SAASthB,EAAOlW,EAAOwQ,EAAKtM,EAAS,GAIxC,OAHW,MAAPsM,IACAA,EAAMwV,EAAYwgB,EAAexmC,KAEjCwQ,aAAeS,WACRy1B,EAAiB1mC,EAAOwQ,EAAKtM,GApIrC,SAA8BlE,EAAOwQ,EAAKtM,EAAS,GACtD,OAAQsiC,EAAexmC,IACnB,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,GAAS,IAEb,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,EAAgBsmC,GACnCtmC,KAAW,EAEf,KAAK,EACDwQ,EAAIlQ,IAAI4D,IAAmB,IAARlE,GACnBA,KAAW,EACX,MAEJ,QAAS,MAAM,IAAIR,MAAM,eAE7B,OAAOgR,CACX,CAiGeq2B,CAAqB7mC,EAAOwQ,EAAKtM,EAEhD,CACO,SAAS8Y,EAAOxM,EAAKtM,EAAS,GACjC,OAAIsM,aAAeS,WACR01B,EAAiBn2B,EAAKtM,GAzD9B,SAA8BsM,EAAKtM,GACtC,IAAI0d,EAAIpR,EAAIpQ,IAAI8D,GACZ0iC,EAAM,EAEV,GADAA,GAAOhlB,EAAI2kB,EACP3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,IAAS,EACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,IAAS,GACjB3kB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQL,EAChBtkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQJ,EAChBvkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQH,EAChBxkB,EAAI0kB,EACJ,OAAOM,EAIX,GAFAhlB,EAAIpR,EAAIpQ,IAAI8D,EAAS,GACrB0iC,IAAQhlB,EAAI2kB,GAAQF,EAChBzkB,EAAI0kB,EACJ,OAAOM,EAEX,MAAM,IAAIpP,WAAW,0BACzB,CAiBesP,CAAqBt2B,EAAKtM,EAEzC,CChOA,MAAMi9B,EAAM,IAAID,aAAa,EAAE,IACzBE,EAAM,IAAInwB,WAAWkwB,EAAIztB,QAIxB,SAASmQ,EAAa5X,EAAKuE,EAAK1I,GACnCq5B,EAAI,GAAKl1B,EACTuE,EAAI1I,GAAOs5B,EAAI,GACf5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,GACnB5wB,EAAI1I,EAAM,GAAKs5B,EAAI,EACvB,CA+BA,MAAMsB,EAAM,IAAID,aAAa,EAAE,IACzBsE,EAAM,IAAI91B,WAAWyxB,EAAIhvB,QAIxB,SAASqQ,EAAc9X,EAAKuE,EAAK1I,GACpC46B,EAAI,GAAKz2B,EACTuE,EAAI1I,GAAOi/B,EAAI,GACfv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,GACnBv2B,EAAI1I,EAAM,GAAKi/B,EAAI,EACvB,CCxDA,MAAMC,EAA0BC,OAAO17B,OAAOk7B,kBACxCS,EAA0BD,OAAO17B,OAAO47B,kBAUvC,MAAMpoB,EACTC,GACAC,GACA,WAAA3O,CAAY0O,EAAIC,GAMZje,KAAKge,GAAU,EAALA,EAIVhe,KAAKie,GAAU,EAALA,CACd,CAIA,QAAApP,CAASD,GAAW,GAChB,IAAKA,GAAa5O,KAAKie,KAAO,GAAM,EAAG,CACnC,MAAMD,EAAgB,GAAVhe,KAAKge,KAAW,EAC5B,IAAIC,GAAMje,KAAKie,KAAO,EAItB,OAHW,IAAPD,IACAC,EAAKA,EAAK,IAAM,KAEXD,EAAU,WAALC,EAClB,CACA,OAAOje,KAAKge,GAAe,WAAVhe,KAAKie,EAC1B,CAIA,QAAAmoB,CAASx3B,GAAW,GAChB,GAAIA,EACA,OAAOq3B,OAAOjmC,KAAKge,KAAO,IAAMioB,OAAOjmC,KAAKie,KAAO,IAAM,KAE7D,GAAKje,KAAKie,KAAO,IAAQ,EAAG,CACxB,MAAMD,EAAgB,GAAVhe,KAAKge,KAAW,EAC5B,IAAIC,GAAMje,KAAKie,KAAO,EAItB,OAHW,IAAPD,IACAC,EAAKA,EAAK,IAAM,KAEXgoB,OAAOjoB,IAAOioB,OAAOhoB,IAAO,KACzC,CACA,OAAOgoB,OAAOjmC,KAAKge,KAAO,IAAMioB,OAAOjmC,KAAKie,KAAO,IAAM,IAC7D,CAIA,QAAA5X,CAASuI,GAAW,GAChB,OAAO5O,KAAKomC,SAASx3B,GAAUvI,UACnC,CAIA,QAAA8X,GACI,MAAMU,EAAO7e,KAAKie,IAAM,GAGxB,OAFAje,KAAKie,KAAOje,KAAKie,IAAM,EAAIje,KAAKge,KAAO,IAAMa,KAAU,EACvD7e,KAAKge,IAAMhe,KAAKge,IAAM,EAAIa,KAAU,EAC7B7e,IACX,CAIA,QAAAoe,GACI,MAAMS,IAAmB,EAAV7e,KAAKge,IAGpB,OAFAhe,KAAKge,KAAOhe,KAAKge,KAAO,EAAIhe,KAAKie,IAAM,IAAMY,KAAU,EACvD7e,KAAKie,IAAMje,KAAKie,KAAO,EAAIY,KAAU,EAC9B7e,IACX,CAIA,MAAAyB,GACI,MAAMqd,EAAQ9e,KAAKge,GACbe,GAAS/e,KAAKge,KAAO,GAAKhe,KAAKie,IAAM,KAAO,EAC5Ce,EAAQhf,KAAKie,KAAO,GAC1B,OAAiB,IAAVe,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,iBAAOqnB,CAAWrnC,GACd,GAAc,KAAVA,EACA,OAAOkf,EAEX,GAAIlf,EAAQgnC,GAA2BhnC,EAAQknC,EAC3C,OAAOlmC,KAAK6b,WAAWtR,OAAOvL,IAElC,MAAMsnC,EAAWtnC,EAAQ,GACrBsnC,IACAtnC,GAASA,GAEb,IAAIif,EAAKjf,GAAS,IACdgf,EAAKhf,GAASif,GAAM,KAWxB,OAVIqoB,IACAroB,EAAW,IAALA,EACND,EAAW,IAALA,IACAA,EAAKuoB,IACPvoB,EAAK,KACCC,EAAKsoB,IACPtoB,EAAK,MAIV,IAAIF,EAASxT,OAAOyT,GAAKzT,OAAO0T,GAC3C,CAIA,iBAAOpC,CAAW7c,GACd,GAAc,IAAVA,EACA,OAAOkf,EAEX,MAAMI,EAAOtf,EAAQ,EACjBsf,IACAtf,GAASA,GAEb,IAAIgf,EAAKhf,IAAU,EACfif,GAAMjf,EAAQgf,GAAM,aAAe,EAWvC,OAVIM,IACAL,GAAMA,IAAO,EACbD,GAAMA,IAAO,IACPA,EAAK,aACPA,EAAK,IACCC,EAAK,aACPA,EAAK,KAIV,IAAIF,EAASC,EAAIC,EAC5B,CAIA,WAAOM,CAAKvf,GACR,MAAqB,iBAAVA,EACA+e,EAASlC,WAAW7c,GAEV,iBAAVA,EACA+e,EAASsoB,WAAWrnC,GAEV,iBAAVA,EACA+e,EAASsoB,WAAWJ,OAAOjnC,IAElB,MAAbA,EAAM0P,KAA6B,MAAd1P,EAAM2P,KAAe,IAAIoP,EAAS/e,EAAM0P,MAAQ,EAAG1P,EAAM2P,OAAS,GAAKuP,CACvG,EAEJ,MAAMA,EAAO,IAAIH,EAAS,EAAG,GAC7BG,EAAKkoB,SAAW,WAAc,OAAO,EAAI,EACzCloB,EAAKC,SAAWD,EAAKE,SAAW,WAAc,OAAOpe,IAAM,EAC3Dke,EAAKzc,OAAS,WAAc,OAAO,CAAG,EACtC,MAAM8kC,EAAS,YCxGR,SAAS72B,EAAMa,EAAQmC,EAAQxP,GAClC,MAAM8D,EAAQ9D,EACd,IAAI8S,EACAC,EACJ,IAAK,IAAI1U,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,EACjCyU,EAAKzF,EAAOlD,WAAW9L,GACnByU,EAAK,IACLtD,EAAOxP,KAAY8S,EAEdA,EAAK,MACVtD,EAAOxP,KAAY8S,GAAM,EAAI,IAC7BtD,EAAOxP,KAAiB,GAAL8S,EAAU,KAEN,QAAZ,MAALA,IAA0E,QAAZ,OAAjCC,EAAK1F,EAAOlD,WAAW9L,EAAI,MAC9DyU,EAAK,QAAiB,KAALA,IAAgB,KAAY,KAALC,KACtC1U,EACFmR,EAAOxP,KAAY8S,GAAM,GAAK,IAC9BtD,EAAOxP,KAAY8S,GAAM,GAAK,GAAK,IACnCtD,EAAOxP,KAAY8S,GAAM,EAAI,GAAK,IAClCtD,EAAOxP,KAAiB,GAAL8S,EAAU,MAG7BtD,EAAOxP,KAAY8S,GAAM,GAAK,IAC9BtD,EAAOxP,KAAY8S,GAAM,EAAI,GAAK,IAClCtD,EAAOxP,KAAiB,GAAL8S,EAAU,KAGrC,OAAO9S,EAAS8D,CACpB,CC3FA,SAASsvB,EAAgBhX,EAAQiX,GAC7B,OAAOC,WAAW,uBAAuBlX,EAAOxY,SAASyvB,GAAe,OAAOjX,EAAOld,MAC1F,CACA,SAASokC,EAAeh3B,EAAKvI,GACzB,OAAQuI,EAAIvI,EAAM,GACduI,EAAIvI,EAAM,IAAM,EAChBuI,EAAIvI,EAAM,IAAM,GAChBuI,EAAIvI,EAAM,IAAM,MAAQ,CAChC,CAIO,MAAMw/B,EACTj3B,IACA1I,IACA1E,IACAwd,OAAS3P,WAAWzQ,UAAUyiB,SAC9B,WAAA3S,CAAYoD,GAIR1S,KAAKwP,IAAMkD,EAIX1S,KAAK8G,IAAM,EAIX9G,KAAKoC,IAAMsQ,EAAOjR,MACtB,CAIA,MAAA4O,GACI,IAAIrR,EAAQ,WAEZ,GADAA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,QAAgB,EACnC9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,KAAO,EAClD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EACnD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,IAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EACnD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EAEX,GADAA,GAASA,GAA8B,GAArBgB,KAAKwP,IAAIxP,KAAK8G,OAAc,MAAQ,EAClD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAO9H,EACX,IAAKgB,KAAK8G,KAAO,GAAK9G,KAAKoC,IAEvB,MADApC,KAAK8G,IAAM9G,KAAKoC,IACVk0B,EAAgBt2B,KAAM,IAEhC,OAAOhB,CACX,CAIA,KAAAkjB,GACI,OAAuB,EAAhBliB,KAAKqQ,QAChB,CAIA,MAAA8R,GACI,MAAMnjB,EAAQgB,KAAKqQ,SACnB,OAAOrR,IAAU,IAAc,EAARA,EAC3B,CAIA,IAAAujB,GACI,OAAyB,IAAlBviB,KAAKqQ,QAChB,CAIA,OAAAmS,GACI,GAAIxiB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAGhC,OADYwmC,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,EAErD,CAIA,QAAA2b,GACI,GAAIziB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAGhC,OADsD,EAA1CwmC,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,EAErD,CAIA,KAAA8b,GACI,GAAI5iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,MAAMhB,GHnFcwQ,EGmFMxP,KAAKwP,IHnFN1I,EGmFW9G,KAAK8G,IHlF7Cs5B,EAAI,GAAK5wB,EAAI1I,GACbs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACnBs5B,EAAI,GAAK5wB,EAAI1I,EAAM,GACZq5B,EAAI,IALR,IAAqB3wB,EAAK1I,EGqFzB,OADA9G,KAAK8G,KAAO,EACL9H,CACX,CAIA,MAAA8jB,GAEI,GAAI9iB,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,MAAMhB,GH7CewQ,EG6CMxP,KAAKwP,IH7CN1I,EG6CW9G,KAAK8G,IH5C9Ci/B,EAAI,GAAKv2B,EAAI1I,GACbi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACnBi/B,EAAI,GAAKv2B,EAAI1I,EAAM,GACZ46B,EAAI,IATR,IAAsBlyB,EAAK1I,EG+C1B,OADA9G,KAAK8G,KAAO,EACL9H,CACX,CAIA,KAAA8P,GACI,MAAMrN,EAASzB,KAAKqQ,SACdrJ,EAAQhH,KAAK8G,IACbG,EAAMjH,KAAK8G,IAAMrF,EAEvB,GAAIwF,EAAMjH,KAAKoC,IACX,MAAMk0B,EAAgBt2B,KAAMyB,GAGhC,OADAzB,KAAK8G,KAAOrF,EACLuF,IAAUC,EACX,IAAIgJ,WAAW,GACfjQ,KAAKwP,IAAIyS,SAASjb,EAAOC,EACnC,CAIA,MAAAsJ,GACI,MAAMzB,EAAQ9O,KAAK8O,QACnB,ODtHD,SAAc4D,EAAQ1L,EAAOC,GAEhC,GADYA,EAAMD,EACR,EACN,MAAO,GAEX,IAAIoW,EACJ,MAAMC,EAAQ,GACd,IACIF,EADA5b,EAAI,EAER,KAAOyF,EAAQC,GACXkW,EAAIzK,EAAO1L,KACPmW,EAAI,IACJE,EAAM9b,KAAO4b,EAERA,EAAI,KAAOA,EAAI,IACpBE,EAAM9b,MAAY,GAAJ4b,IAAW,EAAsB,GAAlBzK,EAAO1L,KAE/BmW,EAAI,KAAOA,EAAI,KACpBA,IAAU,EAAJA,IAAU,IAAwB,GAAlBzK,EAAO1L,OAAkB,IAAwB,GAAlB0L,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,MAAiB,MAC1GqW,EAAM9b,KAAO,OAAU4b,GAAK,IAC5BE,EAAM9b,KAAO,OAAc,KAAJ4b,IAGvBE,EAAM9b,MAAY,GAAJ4b,IAAW,IAAwB,GAAlBzK,EAAO1L,OAAkB,EAAsB,GAAlB0L,EAAO1L,KAEnEzF,EAAI,QACH6b,IAAUA,EAAQ,KAAK5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,IAC/D9b,EAAI,GAGZ,OAAa,MAAT6b,GACI7b,EAAI,GACJ6b,EAAM5c,KAAKwO,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,KAEzD6b,EAAMvV,KAAK,KAEfmH,OAAOC,aAAa1M,MAAMyM,OAAQqO,EAAMnc,MAAM,EAAGK,GAC5D,CCiFe,CAAUuN,EAAO,EAAGA,EAAMrN,OACrC,CAIA,IAAA6H,CAAK7H,GACD,GAAsB,iBAAXA,EAAqB,CAE5B,GAAIzB,KAAK8G,IAAMrF,EAASzB,KAAKoC,IACzB,MAAMk0B,EAAgBt2B,KAAMyB,GAEhCzB,KAAK8G,KAAOrF,CAChB,MAEI,GAEI,GAAIzB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,YAEG,IAAvBA,KAAKwP,IAAIxP,KAAK8G,QAE5B,OAAO9G,IACX,CAIA,QAAAi3B,CAASxmB,GACL,OAAQA,GACJ,KAAK,EACDzQ,KAAKsJ,OACL,MACJ,KAAK,EACDtJ,KAAKsJ,KAAK,GACV,MACJ,KAAK,EACDtJ,KAAKsJ,KAAKtJ,KAAKqQ,UACf,MACJ,KAAK,EACD,KAA0C,IAAlCI,EAA2B,EAAhBzQ,KAAKqQ,WACpBrQ,KAAKi3B,SAASxmB,GAElB,MACJ,KAAK,EACDzQ,KAAKsJ,KAAK,GACV,MAEJ,QACI,MAAM9K,MAAM,qBAAqBiS,eAAsBzQ,KAAK8G,OAEpE,OAAO9G,IACX,CACA,cAAA22B,GAEI,MAAM1jB,EAAO,IAAI8K,EAAS,EAAG,GAC7B,IAAIxc,EAAI,EACR,KAAIvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GAgBrB,CACD,KAAOvF,EAAI,IAAKA,EAAG,CAEf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAI1B,GADAiT,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CAEf,CAGA,OADAA,EAAK+K,IAAM/K,EAAK+K,IAA6B,IAAvBhe,KAAKwP,IAAIxP,KAAK8G,SAAqB,EAAJvF,KAAW,EACzD0R,CACX,CA9BI,KAAO1R,EAAI,IAAKA,EAGZ,GADA0R,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,KAAW,EAC1DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAMf,GAFAA,EAAK+K,IAAM/K,EAAK+K,IAA2B,IAArBhe,KAAKwP,IAAIxP,KAAK8G,OAAe,MAAQ,EAC3DmM,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAe,KAAO,EACtD9G,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,EAoBf,GAlBI1R,EAAI,EAkBJvB,KAAKoC,IAAMpC,KAAK8G,IAAM,GACtB,KAAOvF,EAAI,IAAKA,EAGZ,GADA0R,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,OAKf,KAAO1R,EAAI,IAAKA,EAAG,CACf,GAAIvB,KAAK8G,KAAO9G,KAAKoC,IACjB,MAAMk0B,EAAgBt2B,MAI1B,GADAiT,EAAKgL,IAAMhL,EAAKgL,IAA2B,IAArBje,KAAKwP,IAAIxP,KAAK8G,OAAmB,EAAJvF,EAAQ,KAAO,EAC9DvB,KAAKwP,IAAIxP,KAAK8G,OAAS,IACvB,OAAOmM,CAEf,CAEJ,MAAMzU,MAAM,0BAChB,CACA,WAAAq4B,GACI,GAAI72B,KAAK8G,IAAM,EAAI9G,KAAKoC,IACpB,MAAMk0B,EAAgBt2B,KAAM,GAEhC,MAAMge,EAAKwoB,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,GAC1CmX,EAAKuoB,EAAexmC,KAAKwP,IAAKxP,KAAK8G,KAAO,GAChD,OAAO,IAAIiX,EAASC,EAAIC,EAC5B,CAIA,KAAAoE,GACI,OAAOriB,KAAK22B,iBAAiByP,UACjC,CAKA,WAAAM,GACI,OAAO1mC,KAAK22B,iBAAiB9nB,UACjC,CAIA,WAAA83B,GACI,OAAO3mC,KAAK22B,iBAAiBtwB,UACjC,CAIA,MAAA+b,GACI,OAAOpiB,KAAK22B,iBAAiByP,UAAS,EAC1C,CAKA,YAAAQ,GACI,MAAM5nC,EAAQ2mC,EAAiB3lC,KAAKwP,IAAKxP,KAAK8G,KAE9C,OADA9G,KAAK8G,KAAO0+B,EAAexmC,GACpBA,CACX,CAIA,YAAA6nC,GACI,OAAO7mC,KAAK22B,iBAAiBtwB,UAAS,EAC1C,CAIA,MAAAic,GACI,OAAOtiB,KAAK22B,iBAAiBvY,WAAWgoB,UAC5C,CAKA,YAAAU,GACI,OAAO9mC,KAAK22B,iBAAiBvY,WAAWvP,UAC5C,CAKA,YAAAk4B,GACI,OAAO/mC,KAAK22B,iBAAiBvY,WAAW/X,UAC5C,CAIA,OAAAqc,GACI,OAAO1iB,KAAK62B,cAAcuP,UAC9B,CAIA,aAAAY,GACI,OAAOhnC,KAAK62B,cAAchoB,UAC9B,CAIA,aAAAo4B,GACI,OAAOjnC,KAAK62B,cAAcxwB,UAC9B,CAIA,QAAAsc,GACI,OAAO3iB,KAAK62B,cAAcuP,UAC9B,CAKA,cAAAc,GACI,OAAOlnC,KAAK62B,cAAchoB,UAC9B,CAIA,cAAAs4B,GACI,OAAOnnC,KAAK62B,cAAcxwB,UAC9B,ECtWG,SAAS+gC,EAAc53B,EAAK63B,EAAOvK,GACtC,MAAMxd,EDuWH,SAAsB9P,GACzB,OAAO,IAAIi3B,EAAiBj3B,aAAeS,WAAaT,EAAMA,EAAIyS,WACtE,CCzWmBqlB,CAAa93B,GAC5B,OAAO63B,EAAMrrB,OAAOsD,OAAQpgB,EAAW49B,EAC3C,CCiBO,SAASnyB,EAAOxH,GACnB,GAAIA,aAAa8M,YAAqC,eAAvB9M,EAAEmM,YAAYvO,KACzC,OAAOoC,EACX,GAAIA,aAAa0O,YACb,OAAO,IAAI5B,WAAW9M,GAC1B,GAAI0O,YAAYW,OAAOrP,GACnB,OAAO,IAAI8M,WAAW9M,EAAEuP,OAAQvP,EAAEokC,WAAYpkC,EAAEqN,YAEpD,MAAM,IAAIhS,MAAM,oCACpB,CA9BqB,IAAIyR,WAAW,GCwKpC,QA9JA,SAAcu3B,EAAUzmC,GACpB,GAAIymC,EAAS/lC,QAAU,IACnB,MAAM,IAAIrB,UAAU,qBAGxB,IADA,IAAIqnC,EAAW,IAAIx3B,WAAW,KACrBzN,EAAI,EAAGA,EAAIilC,EAAShmC,OAAQe,IACjCilC,EAASjlC,GAAK,IAElB,IAAK,IAAIjB,EAAI,EAAGA,EAAIimC,EAAS/lC,OAAQF,IAAK,CACtC,IAAI4T,EAAIqyB,EAAS3gC,OAAOtF,GACpBmmC,EAAKvyB,EAAE9H,WAAW,GACtB,GAAqB,MAAjBo6B,EAASC,GACT,MAAM,IAAItnC,UAAU+U,EAAI,iBAE5BsyB,EAASC,GAAMnmC,CACnB,CACA,IAAIomC,EAAOH,EAAS/lC,OAChBmmC,EAASJ,EAAS3gC,OAAO,GACzBghC,EAAS5+B,KAAKmC,IAAIu8B,GAAQ1+B,KAAKmC,IAAI,KACnC08B,EAAU7+B,KAAKmC,IAAI,KAAOnC,KAAKmC,IAAIu8B,GA+DvC,SAASI,EAAa5hC,GAClB,GAAsB,iBAAXA,EACP,MAAM,IAAI/F,UAAU,mBAExB,GAAsB,IAAlB+F,EAAO1E,OACP,OAAO,IAAIwO,WAEf,IAAI+3B,EAAM,EAEV,GAAoB,MAAhB7hC,EAAO6hC,GAAX,CAMA,IAFA,IAAIC,EAAS,EACTxmC,EAAS,EACN0E,EAAO6hC,KAASJ,GACnBK,IACAD,IAMJ,IAHA,IAAIvpC,GAAU0H,EAAO1E,OAASumC,GAAOH,EAAU,IAAO,EAClDK,EAAO,IAAIj4B,WAAWxR,GAEnB0H,EAAO6hC,IAAM,CAEhB,IAAIG,EAAQV,EAASthC,EAAOkH,WAAW26B,IAEvC,GAAc,MAAVG,EACA,OAGJ,IADA,IAAI5mC,EAAI,EACC6mC,EAAM3pC,EAAO,GAAc,IAAV0pC,GAAe5mC,EAAIE,KAAqB,IAAT2mC,EAAaA,IAAO7mC,IACzE4mC,GAAUR,EAAOO,EAAKE,KAAU,EAChCF,EAAKE,GAAQD,EAAQ,MAAS,EAC9BA,EAASA,EAAQ,MAAS,EAE9B,GAAc,IAAVA,EACA,MAAM,IAAI3pC,MAAM,kBAEpBiD,EAASF,EACTymC,GACJ,CAEA,GAAoB,MAAhB7hC,EAAO6hC,GAAX,CAKA,IADA,IAAIK,EAAM5pC,EAAOgD,EACV4mC,IAAQ5pC,GAAsB,IAAdypC,EAAKG,IACxBA,IAIJ,IAFA,IAAIC,EAAM,IAAIr4B,WAAWg4B,GAAUxpC,EAAO4pC,IACtC7lC,EAAIylC,EACDI,IAAQ5pC,GACX6pC,EAAI9lC,KAAO0lC,EAAKG,KAEpB,OAAOC,CAXP,CAlCA,CA8CJ,CAWA,MAAO,CACHpzB,OAhIJ,SAAgB/O,GAUZ,GARIA,aAAkB8J,aAEb4B,YAAYW,OAAOrM,GACxBA,EAAS,IAAI8J,WAAW9J,EAAOuM,OAAQvM,EAAOohC,WAAYphC,EAAOqK,YAE5D7O,MAAM2Q,QAAQnM,KACnBA,EAAS8J,WAAWsO,KAAKpY,OAEvBA,aAAkB8J,YACpB,MAAM,IAAI7P,UAAU,uBAExB,GAAsB,IAAlB+F,EAAO1E,OACP,MAAO,GAOX,IAJA,IAAIwmC,EAAS,EACTxmC,EAAS,EACT8mC,EAAS,EACTC,EAAOriC,EAAO1E,OACX8mC,IAAWC,GAA2B,IAAnBriC,EAAOoiC,IAC7BA,IACAN,IAMJ,IAHA,IAAIxpC,GAAS+pC,EAAOD,GAAUT,EAAU,IAAO,EAC3CW,EAAM,IAAIx4B,WAAWxR,GAElB8pC,IAAWC,GAAM,CAIpB,IAHA,IAAIL,EAAQhiC,EAAOoiC,GAEfhnC,EAAI,EACCmnC,EAAMjqC,EAAO,GAAc,IAAV0pC,GAAe5mC,EAAIE,KAAqB,IAATinC,EAAaA,IAAOnnC,IACzE4mC,GAAU,IAAMM,EAAIC,KAAU,EAC9BD,EAAIC,GAAQP,EAAQR,IAAU,EAC9BQ,EAASA,EAAQR,IAAU,EAE/B,GAAc,IAAVQ,EACA,MAAM,IAAI3pC,MAAM,kBAEpBiD,EAASF,EACTgnC,GACJ,CAGA,IADA,IAAII,EAAMlqC,EAAOgD,EACVknC,IAAQlqC,GAAqB,IAAbgqC,EAAIE,IACvBA,IAIJ,IADA,IAAI5iC,EAAM6hC,EAAOh/B,OAAOq/B,GACjBU,EAAMlqC,IAAQkqC,EACjB5iC,GAAOyhC,EAAS3gC,OAAO4hC,EAAIE,IAE/B,OAAO5iC,CACX,EA0EIgiC,aAAcA,EACd/rB,OAVJ,SAAgBzL,GACZ,IAAImC,EAASq1B,EAAax3B,GAC1B,GAAImC,EACA,OAAOA,EAEX,MAAM,IAAIlU,MAAM,OAAOuC,cAC3B,EAMJ,EC9JA,MAAM6nC,EACF7nC,KACArB,OACAmpC,WACA,WAAAv5B,CAAYvO,EAAMrB,EAAQmpC,GACtB7oC,KAAKe,KAAOA,EACZf,KAAKN,OAASA,EACdM,KAAK6oC,WAAaA,CACtB,CACA,MAAA3zB,CAAOpG,GACH,GAAIA,aAAiBmB,WACjB,MAAO,GAAGjQ,KAAKN,SAASM,KAAK6oC,WAAW/5B,KAGxC,MAAMtQ,MAAM,oCAEpB,EAOJ,MAAMsqC,EACF/nC,KACArB,OACAqpC,WACAC,gBACA,WAAA15B,CAAYvO,EAAMrB,EAAQqpC,GACtB/oC,KAAKe,KAAOA,EACZf,KAAKN,OAASA,EACd,MAAMspC,EAAkBtpC,EAAOupC,YAAY,GAE3C,QAAwB/pC,IAApB8pC,EACA,MAAM,IAAIxqC,MAAM,4BAEpBwB,KAAKgpC,gBAAkBA,EACvBhpC,KAAK+oC,WAAaA,CACtB,CACA,MAAA/sB,CAAOpU,GACH,GAAoB,iBAATA,EAAmB,CAC1B,GAAIA,EAAKqhC,YAAY,KAAOjpC,KAAKgpC,gBAC7B,MAAMxqC,MAAM,qCAAqC6mB,KAAKE,UAAU3d,OAAU5H,KAAKe,mDAAmDf,KAAKN,UAE3I,OAAOM,KAAK+oC,WAAWnhC,EAAK1G,MAAMlB,KAAKN,OAAO+B,QAClD,CAEI,MAAMjD,MAAM,oCAEpB,CACA,EAAA0qC,CAAGtY,GACC,OAAOsY,EAAGlpC,KAAM4wB,EACpB,EAEJ,MAAMuY,EACFC,SACA,WAAA95B,CAAY85B,GACRppC,KAAKopC,SAAWA,CACpB,CACA,EAAAF,CAAGtY,GACC,OAAOsY,EAAGlpC,KAAM4wB,EACpB,CACA,MAAA5U,CAAO+Z,GACH,MAAMr2B,EAASq2B,EAAM,GACfnF,EAAU5wB,KAAKopC,SAAS1pC,GAC9B,GAAe,MAAXkxB,EACA,OAAOA,EAAQ5U,OAAO+Z,GAGtB,MAAMS,WAAW,qCAAqCnR,KAAKE,UAAUwQ,iCAAqCp3B,OAAOuG,KAAKlF,KAAKopC,0BAEnI,EAEG,SAASF,EAAGG,EAAMj0B,GAErB,OAAO,IAAI+zB,EAAgB,IACnBE,EAAKD,UAAY,CAAE,CAACC,EAAK3pC,QAAS2pC,MAClCj0B,EAAMg0B,UAAY,CAAE,CAACh0B,EAAM1V,QAAS0V,IAEhD,CACO,MAAMk0B,EACTvoC,KACArB,OACAmpC,WACAE,WACApY,QACAC,QACA,WAAAthB,CAAYvO,EAAMrB,EAAQmpC,EAAYE,GAClC/oC,KAAKe,KAAOA,EACZf,KAAKN,OAASA,EACdM,KAAK6oC,WAAaA,EAClB7oC,KAAK+oC,WAAaA,EAClB/oC,KAAK2wB,QAAU,IAAIiY,EAAQ7nC,EAAMrB,EAAQmpC,GACzC7oC,KAAK4wB,QAAU,IAAIkY,EAAQ/nC,EAAMrB,EAAQqpC,EAC7C,CACA,MAAA7zB,CAAO6gB,GACH,OAAO/1B,KAAK2wB,QAAQzb,OAAO6gB,EAC/B,CACA,MAAA/Z,CAAO+Z,GACH,OAAO/1B,KAAK4wB,QAAQ5U,OAAO+Z,EAC/B,EAEG,SAASxX,GAAK,KAAExd,EAAI,OAAErB,EAAM,OAAEwV,EAAM,OAAE8G,IACzC,OAAO,IAAIstB,EAAMvoC,EAAMrB,EAAQwV,EAAQ8G,EAC3C,CACO,SAASutB,IAAM,KAAExoC,EAAI,OAAErB,EAAM,SAAE8pC,IAClC,MAAM,OAAEt0B,EAAM,OAAE8G,GAAW,EAAMwtB,EAAUzoC,GAC3C,OAAOwd,EAAK,CACR7e,SACAqB,OACAmU,SACA8G,OAASpU,GAAS+C,EAAOqR,EAAOpU,KAExC,CAsEO,SAAS6hC,IAAQ,KAAE1oC,EAAI,OAAErB,EAAM,YAAEgqC,EAAW,SAAEF,IACjD,OAAOjrB,EAAK,CACR7e,SACAqB,OACAmU,OAAO6gB,GAnCf,SAAgB4T,EAAMH,EAAUE,GAC5B,MAAME,EAAwC,MAAlCJ,EAASA,EAAS/nC,OAAS,GACjCod,GAAQ,GAAK6qB,GAAe,EAClC,IAAIG,EAAM,GACN52B,EAAO,EACPP,EAAS,EACb,IAAK,IAAInR,EAAI,EAAGA,EAAIooC,EAAKloC,SAAUF,EAK/B,IAHAmR,EAAUA,GAAU,EAAKi3B,EAAKpoC,GAC9B0R,GAAQ,EAEDA,EAAOy2B,GACVz2B,GAAQy2B,EACRG,GAAOL,EAAS3qB,EAAQnM,GAAUO,GAQ1C,GAJa,IAATA,IACA42B,GAAOL,EAAS3qB,EAAQnM,GAAWg3B,EAAcz2B,IAGjD22B,EACA,KAASC,EAAIpoC,OAASioC,EAAe,GACjCG,GAAO,IAGf,OAAOA,CACX,CASmB,CAAO9T,EAAOyT,EAAUE,GAEnC1tB,OAAO+Z,GA5Ef,SAAgBxlB,EAAQi5B,EAAUE,EAAa3oC,GAE3C,MAAM+oC,EAAQ,CAAC,EACf,IAAK,IAAIvoC,EAAI,EAAGA,EAAIioC,EAAS/nC,SAAUF,EACnCuoC,EAAMN,EAASjoC,IAAMA,EAGzB,IAAI0F,EAAMsJ,EAAO9O,OACjB,KAA2B,MAApB8O,EAAOtJ,EAAM,MACdA,EAGN,MAAM4iC,EAAM,IAAI55B,WAAYhJ,EAAMyiC,EAAc,EAAK,GAErD,IAAIz2B,EAAO,EACPP,EAAS,EACTq3B,EAAU,EACd,IAAK,IAAIxoC,EAAI,EAAGA,EAAI0F,IAAO1F,EAAG,CAE1B,MAAMvC,EAAQ8qC,EAAMv5B,EAAOhP,IAC3B,QAAcrC,IAAVF,EACA,MAAM,IAAIgrC,YAAY,OAAOjpC,eAGjC2R,EAAUA,GAAUg3B,EAAe1qC,EACnCiU,GAAQy2B,EAEJz2B,GAAQ,IACRA,GAAQ,EACR42B,EAAIE,KAAa,IAAQr3B,GAAUO,EAE3C,CAEA,GAAIA,GAAQy2B,GAAgB,IAAQh3B,GAAW,EAAIO,EAC/C,MAAM,IAAI+2B,YAAY,0BAE1B,OAAOH,CACX,CAwCmB,CAAO9T,EAAOyT,EAAUE,EAAa3oC,IAGxD,CCxMO,MAAMkpC,GAASV,GAAM,CACxB7pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,eCHDU,GAAST,GAAQ,CAC1B/pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,mBACVE,YAAa,IAEJS,GAAcV,GAAQ,CAC/B/pC,OAAQ,IACRqB,KAAM,cACNyoC,SAAU,mBACVE,YAAa,ICVJU,GAAQX,GAAQ,CACzB/pC,OAAQ,IACRqB,KAAM,QACNyoC,SAAU,KACVE,YAAa,ICJXF,GAAW7nC,MAAM4c,KAAK,0eACtB8rB,GAAwBb,GAASc,QAAO,CAAC5L,EAAGv3B,EAAG5F,KAAQm9B,EAAEn9B,GAAK4F,EAAUu3B,IAAM,IAC9E6L,GAAwBf,GAASc,QAAO,CAAC5L,EAAGv3B,EAAG5F,KACjD,MAAMipC,EAAYrjC,EAAE8hC,YAAY,GAChC,GAAiB,MAAbuB,EACA,MAAM,IAAIhsC,MAAM,sBAAsB2I,KAG1C,OADAu3B,EAAE8L,GAAajpC,EACRm9B,CAAC,GACT,IAsBU+L,GAAelsB,EAAK,CAC7B7e,OAAQ,KACRqB,KAAM,eACNmU,OAxBJ,SAAgBy0B,GACZ,OAAOA,EAAKW,QAAO,CAAC5L,EAAGv3B,IACnBu3B,EAAK2L,GAAqBljC,IAE3B,GACP,EAoBI6U,OAnBJ,SAAgBjW,GACZ,MAAM2kC,EAAO,GACb,IAAK,MAAMC,KAAQ5kC,EAAK,CACpB,MAAMykC,EAAYG,EAAK1B,YAAY,GACnC,GAAiB,MAAbuB,EACA,MAAM,IAAIhsC,MAAM,sBAAsBmsC,KAE1C,MAAMC,EAAML,GAAqBC,GACjC,GAAW,MAAPI,EACA,MAAM,IAAIpsC,MAAM,+BAA+BmsC,KAEnDD,EAAKlqC,KAAKoqC,EACd,CACA,OAAO,IAAI36B,WAAWy6B,EAC1B,IC9BarU,GAASoT,GAAQ,CAC1B/pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,mCACVE,YAAa,IAEJmB,GAAcpB,GAAQ,CAC/B/pC,OAAQ,IACRqB,KAAM,cACNyoC,SAAU,mCACVE,YAAa,IAEJoB,GAAYrB,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,oCACVE,YAAa,IAEJqB,GAAiBtB,GAAQ,CAClC/pC,OAAQ,IACRqB,KAAM,iBACNyoC,SAAU,oCACVE,YAAa,IAEJsB,GAAYvB,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,mCACVE,YAAa,IAEJuB,GAAiBxB,GAAQ,CAClC/pC,OAAQ,IACRqB,KAAM,iBACNyoC,SAAU,mCACVE,YAAa,IAEJwB,GAAezB,GAAQ,CAChC/pC,OAAQ,IACRqB,KAAM,eACNyoC,SAAU,oCACVE,YAAa,IAEJyB,GAAoB1B,GAAQ,CACrC/pC,OAAQ,IACRqB,KAAM,oBACNyoC,SAAU,oCACVE,YAAa,IAEJ0B,GAAU3B,GAAQ,CAC3B/pC,OAAQ,IACRqB,KAAM,UACNyoC,SAAU,mCACVE,YAAa,ICpDJ2B,GAAS9B,GAAM,CACxB7pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,yCAED8B,GAAc/B,GAAM,CAC7B7pC,OAAQ,IACRqB,KAAM,cACNyoC,SAAU,yCCRD+B,GAAYhC,GAAM,CAC3BxoC,KAAM,YACNrB,OAAQ,IACR8pC,SAAU,+DAEDgC,GAAejC,GAAM,CAC9BxoC,KAAM,eACNrB,OAAQ,IACR8pC,SAAU,+DCRDztB,GAAS0tB,GAAQ,CAC1B/pC,OAAQ,IACRqB,KAAM,SACNyoC,SAAU,mEACVE,YAAa,IAEJ+B,GAAYhC,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,oEACVE,YAAa,IAEJgC,GAAYjC,GAAQ,CAC7B/pC,OAAQ,IACRqB,KAAM,YACNyoC,SAAU,mEACVE,YAAa,IAEJiC,GAAelC,GAAQ,CAChC/pC,OAAQ,IACRqB,KAAM,eACNyoC,SAAU,oEACVE,YAAa,ICtBJkC,GAAQnC,GAAQ,CACzB/pC,OAAQ,IACRqB,KAAM,QACNyoC,SAAU,WACVE,YAAa,ICHJmC,GAAWttB,EAAK,CACzB7e,OAAQ,KACRqB,KAAM,WACNmU,OAAS1F,IAAQ,OZgCIoR,EYhCKpR,GZiCnB,IAAIs8B,aAAc9vB,OAAO4E,GAD7B,IAAkBA,CYhCS,EAC9B5E,OAASjW,GZ4BN,SAAoBA,GACvB,OAAO,IAAIgmC,aAAc72B,OAAOnP,EACpC,CY9BqB0Y,CAAW1Y,KCN1BimC,GAAc,IAAID,YAClBE,GAAc,IAAIH,YACX,GAAO,OACP/2B,GAAO,IACb,SAAS,GAAOzD,GACnB,OAAO06B,GAAY92B,OAAOmQ,KAAKE,UAAUjU,GAC7C,CACO,SAAS,GAAOq4B,GACnB,OAAOtkB,KAAKC,MAAM2mB,GAAYjwB,OAAO2tB,GACzC,CCRO,MAAM,GAAO,MACP,GAAO,GACb,SAAS,GAAOr4B,GACnB,OAAO3G,EAAO2G,EAClB,CACO,SAAS,GAAOq4B,GACnB,OAAOh/B,EAAOg/B,EAClB,CCPA,IACI,GAAM,IAAmBuC,IAAS,IAAOC,GAAMljC,KAAK0qB,IAAI,EAAG,IAwB3DyY,GAAQ,IAAMC,GAAS,IAuBvB,GAAKpjC,KAAK0qB,IAAI,EAAG,GACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB,GAAK1qB,KAAK0qB,IAAI,EAAG,IACjB2Y,GAAKrjC,KAAK0qB,IAAI,EAAG,IACjB4Y,GAAKtjC,KAAK0qB,IAAI,EAAG,IAmBrB,SANa,CACTze,OA/DJ,SAAS,EAAOs3B,EAAK3C,EAAK3mC,GACtB2mC,EAAMA,GAAO,GAGb,IADA,IAAI4C,EADJvpC,EAASA,GAAU,EAEZspC,GAAOL,IACVtC,EAAI3mC,KAAmB,IAANspC,EAAc,GAC/BA,GAAO,IAEX,KAAOA,EAAMN,IACTrC,EAAI3mC,KAAmB,IAANspC,EAAc,GAC/BA,KAAS,EAKb,OAHA3C,EAAI3mC,GAAgB,EAANspC,EAEd,EAAO19B,MAAQ5L,EAASupC,EAAY,EAC7B5C,CACX,EAgDI7tB,OAzCJ,SAAS,EAAKxM,EAAKtM,GACf,IAAgE0d,EAA5DglB,EAAM,EAAyBt9B,EAAQ,EAAGokC,EAAjCxpC,EAASA,GAAU,EAAmC1B,EAAIgO,EAAI/N,OAC3E,EAAG,CACC,GAAIirC,GAAWlrC,EAGX,MADA,EAAKsN,MAAQ,EACP,IAAI0nB,WAAW,2BAEzB5V,EAAIpR,EAAIk9B,KACR9G,GAAOt9B,EAAQ,IACRsY,EAAIyrB,KAAW/jC,GACfsY,EAAIyrB,IAAUpjC,KAAK0qB,IAAI,EAAGrrB,GACjCA,GAAS,CACb,OAASsY,GAAKwrB,IAGd,OADA,EAAKt9B,MAAQ49B,EAAUxpC,EAChB0iC,CACX,EAyBIJ,eAfS,SAAgCxmC,GACzC,OAAQA,EAAQ,GAAK,EACfA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQ,GAAK,EACTA,EAAQstC,GAAK,EACTttC,EAAQutC,GAAK,EACT,EAC1C,GCpEO,SAAS,GAAO5C,EAAMzmC,EAAS,GAElC,MAAO,CADM,GAAO8Y,OAAO2tB,EAAMzmC,GACnB,GAAO8Y,OAAOlN,MAChC,CACO,SAAS69B,GAASC,EAAK1iB,EAAQhnB,EAAS,GAE3C,OADA,GAAOgS,OAAO03B,EAAK1iB,EAAQhnB,GACpBgnB,CACX,CACO,SAAS,GAAe0iB,GAC3B,OAAO,GAAOpH,eAAeoH,EACjC,CCNO,SAAS,GAAO73B,EAAMc,GACzB,MAAMpX,EAAOoX,EAAOrF,WACdq8B,EAAa,GAAsB93B,GACnC+3B,EAAeD,EAAa,GAAsBpuC,GAClDqQ,EAAQ,IAAImB,WAAW68B,EAAeruC,GAI5C,OAHA,GAAgBsW,EAAMjG,EAAO,GAC7B,GAAgBrQ,EAAMqQ,EAAO+9B,GAC7B/9B,EAAMxP,IAAIuW,EAAQi3B,GACX,IAAIC,GAAOh4B,EAAMtW,EAAMoX,EAAQ/G,EAC1C,CAIO,SAAS,GAAOk+B,GACnB,MAAMl+B,EAAQnE,EAAOqiC,IACdj4B,EAAM83B,GAAc,GAAc/9B,IAClCrQ,EAAMquC,GAAgB,GAAch+B,EAAMmT,SAAS4qB,IACpDh3B,EAAS/G,EAAMmT,SAAS4qB,EAAaC,GAC3C,GAAIj3B,EAAOrF,aAAe/R,EACtB,MAAM,IAAID,MAAM,oBAEpB,OAAO,IAAIuuC,GAAOh4B,EAAMtW,EAAMoX,EAAQ/G,EAC1C,CAiBO,MAAMi+B,GACTh4B,KACAtW,KACAoX,OACA/G,MAIA,WAAAQ,CAAYyF,EAAMtW,EAAMoX,EAAQ/G,GAC5B9O,KAAK+U,KAAOA,EACZ/U,KAAKvB,KAAOA,EACZuB,KAAK6V,OAASA,EACd7V,KAAK8O,MAAQA,CACjB,ECvDJ,MAEM,GAASnE,EAIF,GAAW,CAAEoK,KANb,EAMiB,KALjB,WAKuB,OAAQ,UAH5C,SAAgBghB,GACZ,OAAO,GAJE,EAIkB,GAAOA,GACtC,GCNO,SAAS,IAAK,KAAEh1B,EAAI,KAAEgU,EAAI,OAAEG,IAC/B,OAAO,IAAI+3B,GAAOlsC,EAAMgU,EAAMG,EAClC,CAKO,MAAM+3B,GACTlsC,KACAgU,KACAG,OACA,WAAA5F,CAAYvO,EAAMgU,EAAMG,GACpBlV,KAAKe,KAAOA,EACZf,KAAK+U,KAAOA,EACZ/U,KAAKkV,OAASA,CAClB,CACA,MAAAW,CAAOkgB,GACH,GAAIA,aAAiB9lB,WAAY,CAC7B,MAAM6E,EAAS9U,KAAKkV,OAAO6gB,GAC3B,OAAOjhB,aAAkB7E,WACnB,GAAcjQ,KAAK+U,KAAMD,GAEzBA,EAAOyuB,MAAK1tB,GAAU,GAAc7V,KAAK+U,KAAMc,IACzD,CAEI,MAAMrX,MAAM,oCAGpB,EC3BJ,SAAS0uC,GAAInsC,GACT,OAAOosC,MAAOxD,GAAS,IAAI15B,iBAAiBm9B,OAAOC,OAAOx3B,OAAO9U,EAAM4oC,GAC3E,CACO,MAAM,GAAS,GAAK,CACvB5oC,KAAM,WACNgU,KAAM,GACNG,OAAQg4B,GAAI,aAEH,GAAS,GAAK,CACvBnsC,KAAM,WACNgU,KAAM,GACNG,OAAQg4B,GAAI,aCLT,SAASpiC,GAAOwiC,EAAMla,GACzB,MAAM,MAAEtkB,EAAK,QAAEy+B,GAAYD,EAC3B,OACS,IADDC,EAyUZ,SAAoBz+B,EAAOpQ,EAAO00B,GAC9B,MAAM,OAAE1zB,GAAW0zB,EACnB,GAAI1zB,IAAW6rC,GAAU7rC,OACrB,MAAMlB,MAAM,8BAA8B40B,EAAKryB,iBAEnD,MAAMysC,EAAM9uC,EAAMU,IAAIM,GACtB,GAAW,MAAP8tC,EAAa,CACb,MAAMA,EAAMpa,EAAKle,OAAOpG,GAAO5N,MAAM,GAErC,OADAxC,EAAMY,IAAII,EAAQ8tC,GACXA,CACX,CAEI,OAAOA,CAEf,CArVmBC,CAAW3+B,EAAO4+B,GAAUJ,GAAOla,GAAQmY,GAAU5a,SAsVxE,SAAoB7hB,EAAOpQ,EAAO00B,GAC9B,MAAM,OAAE1zB,GAAW0zB,EACboa,EAAM9uC,EAAMU,IAAIM,GACtB,GAAW,MAAP8tC,EAAa,CACb,MAAMA,EAAMpa,EAAKle,OAAOpG,GAExB,OADApQ,EAAMY,IAAII,EAAQ8tC,GACXA,CACX,CAEI,OAAOA,CAEf,CA/VmBG,CAAW7+B,EAAO4+B,GAAUJ,GAAQla,GAAQiD,GAAO1F,QAEtE,CASA,MAAMjyB,GAAQ,IAAIkvC,QAClB,SAASF,GAAUF,GACf,MAAME,EAAYhvC,GAAMU,IAAIouC,GAC5B,GAAiB,MAAbE,EAAmB,CACnB,MAAMA,EAAY,IAAIG,IAEtB,OADAnvC,GAAMY,IAAIkuC,EAAKE,GACRA,CACX,CACA,OAAOA,CACX,CACO,MAAMI,GACT/4B,KACAw4B,QACAP,UACAl+B,MACA,IAMA,WAAAQ,CAAYi+B,EAASx4B,EAAMi4B,EAAWl+B,GAClC9O,KAAK+U,KAAOA,EACZ/U,KAAKutC,QAAUA,EACfvtC,KAAKgtC,UAAYA,EACjBhtC,KAAK8O,MAAQA,EAGb9O,KAAK,KAAO8O,CAChB,CAOA,SAAIi/B,GACA,OAAO/tC,IACX,CAEA,cAAIunC,GACA,OAAOvnC,KAAK8O,MAAMy4B,UACtB,CAEA,cAAI/2B,GACA,OAAOxQ,KAAK8O,MAAM0B,UACtB,CACA,IAAAw9B,GACI,OAAQhuC,KAAKutC,SACT,KAAK,EACD,OAAOvtC,KAEX,KAAK,EAAG,CACJ,MAAM,KAAE+U,EAAI,UAAEi4B,GAAchtC,KAC5B,GAAI+U,IAASk5B,GACT,MAAM,IAAIzvC,MAAM,4CAGpB,GAAIwuC,EAAUj4B,OAASm5B,GACnB,MAAM,IAAI1vC,MAAM,sDAEpB,OAAQsvC,GAAIK,SAASnB,EACzB,CACA,QACI,MAAMxuC,MAAM,+BAA+BwB,KAAKutC,qDAG5D,CACA,IAAAa,GACI,OAAQpuC,KAAKutC,SACT,KAAK,EAAG,CACJ,MAAM,KAAEx4B,EAAI,OAAEc,GAAW7V,KAAKgtC,UACxBA,EAAY,GAAcj4B,EAAMc,GACtC,OAAQi4B,GAAIO,SAASruC,KAAK+U,KAAMi4B,EACpC,CACA,KAAK,EACD,OAAOhtC,KAEX,QACI,MAAMxB,MAAM,+BAA+BwB,KAAKutC,qDAG5D,CACA,MAAAe,CAAOC,GACH,OAAOT,GAAIQ,OAAOtuC,KAAMuuC,EAC5B,CACA,aAAOD,CAAOhkC,EAAMikC,GAChB,MAAMC,EAAUD,EAChB,OAAmB,MAAXC,GACJlkC,EAAKyK,OAASy5B,EAAQz5B,MACtBzK,EAAKijC,UAAYiB,EAAQjB,SJvF9B,SAAgB5sB,EAAGC,GACtB,GAAID,IAAMC,EACN,OAAO,EAEN,CACD,MAAM+oB,EAAO/oB,EACb,OAAQD,EAAE5L,OAAS40B,EAAK50B,MACpB4L,EAAEliB,OAASkrC,EAAKlrC,MAChBkrC,EAAK76B,iBAAiBmB,YjB5B3B,SAAgBw+B,EAAIC,GACvB,GAAID,IAAOC,EACP,OAAO,EACX,GAAID,EAAGj+B,aAAek+B,EAAGl+B,WACrB,OAAO,EAEX,IAAK,IAAIm+B,EAAK,EAAGA,EAAKF,EAAGj+B,WAAYm+B,IACjC,GAAIF,EAAGE,KAAQD,EAAGC,GACd,OAAO,EAGf,OAAO,CACX,CiBiBY,CAAWhuB,EAAE7R,MAAO66B,EAAK76B,MACjC,CACJ,CI6EY,CAAcxE,EAAK0iC,UAAWwB,EAAQxB,UAC9C,CACA,QAAA3mC,CAAS+sB,GACL,OAAOtoB,GAAO9K,KAAMozB,EACxB,CACA,MAAA/X,GACI,MAAO,CAAE,IAAKvQ,GAAO9K,MACzB,CACA,IAAAstC,GACI,OAAOttC,IACX,CACA,CAACyjC,OAAOqB,aAAe,MAEvB,CAACrB,OAAOmL,IAAI,iCACR,MAAO,OAAO5uC,KAAKqG,aACvB,CAWA,YAAO0nC,CAAMhY,GACT,GAAa,MAATA,EACA,OAAO,KAEX,MAAM/2B,EAAQ+2B,EACd,GAAI/2B,aAAiB8uC,GAEjB,OAAO9uC,EAEN,GAAmB,MAAdA,EAAM,MAAgBA,EAAM,OAASA,EAAM8P,OAAU9P,EAAM+uC,QAAU/uC,EAAO,CAMlF,MAAM,QAAEuuC,EAAO,KAAEx4B,EAAI,UAAEi4B,EAAS,MAAEl+B,GAAU9P,EAC5C,OAAO,IAAI8uC,GAAIP,EAASx4B,EAAMi4B,EAAWl+B,GAAS+/B,GAAUtB,EAASx4B,EAAMi4B,EAAUl+B,OACzF,CACK,IAAyB,IAArB9P,EAAM8vC,IAAqB,CAIhC,MAAM,QAAEvB,EAAO,UAAEP,EAAS,KAAEj4B,GAAS/V,EAC/B6W,EAAS,GAAcm3B,GAC7B,OAAOc,GAAIlvC,OAAO2uC,EAASx4B,EAAMc,EACrC,CAII,OAAO,IAEf,CAMA,aAAOjX,CAAO2uC,EAASx4B,EAAMc,GACzB,GAAoB,iBAATd,EACP,MAAM,IAAIvW,MAAM,yCAEpB,KAAMqX,EAAO/G,iBAAiBmB,YAC1B,MAAM,IAAIzR,MAAM,kBAEpB,OAAQ+uC,GACJ,KAAK,EACD,GAAIx4B,IAASk5B,GACT,MAAM,IAAIzvC,MAAM,wCAAwCyvC,sBAGxD,OAAO,IAAIH,GAAIP,EAASx4B,EAAMc,EAAQA,EAAO/G,OAGrD,KAAK,EAAG,CACJ,MAAMA,EAAQ+/B,GAAUtB,EAASx4B,EAAMc,EAAO/G,OAC9C,OAAO,IAAIg/B,GAAIP,EAASx4B,EAAMc,EAAQ/G,EAC1C,CACA,QACI,MAAM,IAAItQ,MAAM,mBAG5B,CAIA,eAAO2vC,CAASt4B,GACZ,OAAOi4B,GAAIlvC,OAAO,EAAGqvC,GAAap4B,EACtC,CAOA,eAAOw4B,CAASt5B,EAAMc,GAClB,OAAOi4B,GAAIlvC,OAAO,EAAGmW,EAAMc,EAC/B,CAQA,aAAOmG,CAAOlN,GACV,MAAO0+B,EAAKuB,GAAajB,GAAIkB,YAAYlgC,GACzC,GAAyB,IAArBigC,EAAUttC,OACV,MAAM,IAAIjD,MAAM,oBAEpB,OAAOgvC,CACX,CAUA,kBAAOwB,CAAYlgC,GACf,MAAMmgC,EAAQnB,GAAIoB,aAAapgC,GACzBqgC,EAAaF,EAAMxwC,KAAOwwC,EAAMG,cAChCC,EAAiB1kC,EAAOmE,EAAMmT,SAASktB,EAAYA,EAAaF,EAAMG,gBAC5E,GAAIC,EAAe7+B,aAAey+B,EAAMG,cACpC,MAAM,IAAI5wC,MAAM,oBAEpB,MAAM8wC,EAAcD,EAAeptB,SAASgtB,EAAMG,cAAgBH,EAAMM,YAClE15B,EAAS,IAAIk3B,GAAckC,EAAMO,cAAeP,EAAMM,WAAYD,EAAaD,GAIrF,MAAO,CAHuB,IAAlBJ,EAAM1B,QACZO,GAAIK,SAASt4B,GACbi4B,GAAIO,SAASY,EAAM5H,MAAOxxB,GACnB/G,EAAMmT,SAASgtB,EAAMxwC,MACtC,CAUA,mBAAOywC,CAAaO,GAChB,IAAIvsC,EAAS,EACb,MAAMmF,EAAO,KACT,MAAO9G,EAAGE,GAAU,GAAcguC,EAAaxtB,SAAS/e,IAExD,OADAA,GAAUzB,EACHF,CAAC,EAEZ,IAAIgsC,EAAUllC,IACVg/B,EAAQ4G,GASZ,GARgB,KAAZV,GAEAA,EAAU,EACVrqC,EAAS,GAGTmkC,EAAQh/B,IAEI,IAAZklC,GAA6B,IAAZA,EACjB,MAAM,IAAI/W,WAAW,uBAAuB+W,KAEhD,MAAM4B,EAAajsC,EACbssC,EAAgBnnC,IAChBknC,EAAalnC,IACb5J,EAAOyE,EAASqsC,EAEtB,MAAO,CAAEhC,UAASlG,QAAOmI,gBAAeD,aAAYH,cAD9B3wC,EAAO0wC,EACsC1wC,OACvE,CAOA,YAAO6mB,CAAMnf,EAAQitB,GACjB,MAAO1zB,EAAQoP,GAUvB,SAAyB3I,EAAQitB,GAC7B,OAAQjtB,EAAO,IAEX,IAAK,IAAK,CACN,MAAMyqB,EAAUwC,GAAQmY,GACxB,MAAO,CACHA,GAAU7rC,OACVkxB,EAAQ5U,OAAO,GAAGuvB,GAAU7rC,SAASyG,KAE7C,CACA,KAAKolC,GAAU7rC,OAAQ,CACnB,MAAMkxB,EAAUwC,GAAQmY,GACxB,MAAO,CAACA,GAAU7rC,OAAQkxB,EAAQ5U,OAAO7V,GAC7C,CACA,KAAKkwB,GAAO32B,OAAQ,CAChB,MAAMkxB,EAAUwC,GAAQiD,GACxB,MAAO,CAACA,GAAO32B,OAAQkxB,EAAQ5U,OAAO7V,GAC1C,CACA,KAAKklC,GAAO3rC,OAAQ,CAChB,MAAMkxB,EAAUwC,GAAQiY,GACxB,MAAO,CAACA,GAAO3rC,OAAQkxB,EAAQ5U,OAAO7V,GAC1C,CACA,QACI,GAAY,MAARitB,EACA,MAAM50B,MAAM,2FAEhB,MAAO,CAAC2H,EAAO,GAAIitB,EAAKpX,OAAO7V,IAG3C,CAvCgCupC,CAAgBvpC,EAAQitB,GAC1Coa,EAAMM,GAAI9xB,OAAOlN,GACvB,GAAoB,IAAhB0+B,EAAID,SAA+B,MAAdpnC,EAAO,GAC5B,MAAM3H,MAAM,0DAIhB,OADAkvC,GAAUF,GAAKluC,IAAII,EAAQyG,GACpBqnC,CACX,EA2DJ,MAAMS,GAAc,IACdC,GAAe,GACrB,SAASW,GAAUtB,EAASx4B,EAAMi4B,GAC9B,MAAM2C,EAAa,GAAsBpC,GACnCqC,EAAaD,EAAa,GAAsB56B,GAChDjG,EAAQ,IAAImB,WAAW2/B,EAAa5C,EAAUx8B,YAIpD,OAHA,GAAgB+8B,EAASz+B,EAAO,GAChC,GAAgBiG,EAAMjG,EAAO6gC,GAC7B7gC,EAAMxP,IAAI0tC,EAAW4C,GACd9gC,CACX,CACA,MAAMggC,GAAYrL,OAAOmL,IAAI,oBC1WhBiB,GAAQ,IAAK,KAAiB,KAAU,KAAU,KAAW,KAAW,KAAW,KAAW,KAAW,KAAW,GCbjI,SAASC,GAAY/uC,EAAMrB,EAAQwV,EAAQ8G,GACvC,MAAO,CACHjb,OACArB,SACAixB,QAAS,CACL5vB,OACArB,SACAwV,UAEJ0b,QAAS,CACL5U,UAGZ,CACA,MAAMzL,GAASu/B,GAAY,OAAQ,KAAMtgC,GAE9B,IADS,IAAIs8B,YAAY,QACX9vB,OAAOxM,KAC5BzJ,IACgB,IAAIgmC,aACL72B,OAAOnP,EAAI0B,UAAU,MAElCsoC,GAAQD,GAAY,QAAS,KAAMtgC,IACrC,IAAIe,EAAS,IACb,IAAK,IAAIhP,EAAI,EAAGA,EAAIiO,EAAI/N,OAAQF,IAC5BgP,GAAUvB,OAAOC,aAAaO,EAAIjO,IAEtC,OAAOgP,CAAM,IACbxK,IAEA,MAAMyJ,EAAMwV,GADZjf,EAAMA,EAAI0B,UAAU,IACQhG,QAC5B,IAAK,IAAIF,EAAI,EAAGA,EAAIwE,EAAItE,OAAQF,IAC5BiO,EAAIjO,GAAKwE,EAAIsH,WAAW9L,GAE5B,OAAOiO,CAAG,IAWd,GATc,CACVC,KAAMc,GACN,QAASA,GACTmF,IAAKm6B,GAAM3F,OACX8F,OAAQD,GACRA,SACA9f,OAAQ8f,MACLF,ICpCA,SAAS,GAAWt/B,EAAQwU,EAAW,QAC1C,MAAMqO,EAAO,GAAMrO,GACnB,GAAY,MAARqO,EACA,MAAM,IAAI50B,MAAM,yBAAyBumB,MAG7C,OAAOqO,EAAKxC,QAAQ5U,OAAO,GAAGoX,EAAK1zB,SAAS6Q,IAChD,CCHA,MAAM+Q,GAIFzhB,GAIAuC,IAIAiG,KAIA4C,IACA,WAAAqE,CAAYzP,EAAIuC,EAAK6I,GACjBjL,KAAKH,GAAKA,EACVG,KAAKoC,IAAMA,EACXpC,KAAKqI,UAAOnJ,EACZc,KAAKiL,IAAMA,CACf,EAGJ,SAASsW,KAAS,CAIlB,MAAMC,GAIFC,KAIAC,KAIAtf,IAIAiG,KACA,WAAAiH,CAAY8P,GACRpf,KAAKyhB,KAAOrC,EAAOqC,KACnBzhB,KAAK0hB,KAAOtC,EAAOsC,KACnB1hB,KAAKoC,IAAMgd,EAAOhd,IAClBpC,KAAKqI,KAAO+W,EAAOuC,MACvB,EAEJ,MAAMsuB,GC7DS,WACX,MAAMnQ,EAAe,KAErB,IAAIE,EACA98B,EAAS48B,EACb,OAAO,SAAmBrhC,GACtB,GAAIA,EAAO,GAAKA,EAJRqhC,KAKJ,OAAO9a,EAAYvmB,GAEnByE,EAASzE,EAAOqhC,IAChBE,EAAOhb,EAAY8a,GACnB58B,EAAS,GAEb,MAAMsM,EAAMwwB,EAAK/d,SAAS/e,EAAQA,GAAUzE,GAK5C,OAJc,EAATyE,IAEDA,EAAwB,GAAL,EAATA,IAEPsM,CACX,CACJ,CDyCmBwS,GAiBnB,MAAMkuB,GAIF9tC,IAIAqf,KAIAC,KAIAC,OACA,WAAArS,GACItP,KAAKoC,IAAM,EACXpC,KAAKyhB,KAAO,IAAIH,GAAGC,GAAM,EAAG,GAC5BvhB,KAAK0hB,KAAO1hB,KAAKyhB,KACjBzhB,KAAK2hB,OAAS,IAClB,CAIA,KAAArR,CAAMzQ,EAAIuC,EAAK6I,GAGX,OAFAjL,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIiZ,GAAGzhB,EAAIuC,EAAK6I,GAC7CjL,KAAKoC,KAAOA,EACLpC,IACX,CAIA,MAAAqQ,CAAOrR,GAaH,OAVAgB,KAAKoC,MAAQpC,KAAK0hB,KAAO1hB,KAAK0hB,KAAKrZ,KAAO,IAAIwZ,IAAU7iB,KAAkB,GACtE,IACE,EACAA,EAAQ,MACJ,EACAA,EAAQ,QACJ,EACAA,EAAQ,UACJ,EACA,EAAGA,IAAQoD,IACtBpC,IACX,CAIA,KAAAkiB,CAAMljB,GACF,OAAOA,EAAQ,EACTgB,KAAKsQ,MAAMwR,GAAe,GAAI/D,EAASlC,WAAW7c,IAClDgB,KAAKqQ,OAAOrR,EACtB,CAIA,MAAAmjB,CAAOnjB,GACH,OAAOgB,KAAKqQ,QAAQrR,GAAS,EAAIA,GAAS,MAAQ,EACtD,CAIA,MAAAojB,CAAOpjB,GACH,MAAMiU,EAAO8K,EAASsoB,WAAWrnC,GACjC,OAAOgB,KAAKsQ,MAAMwR,GAAe7O,EAAKxR,SAAUwR,EACpD,CAIA,YAAA2zB,CAAa5nC,GACT,OAAOgB,KAAKsQ,MAAMo1B,EAAkBF,EAAexmC,GAAQA,EAC/D,CAIA,YAAA6nC,CAAa7nC,GACT,OAAOgB,KAAKoiB,OAAO6jB,OAAOjnC,GAC9B,CAIA,KAAAqjB,CAAMrjB,GACF,OAAOgB,KAAKoiB,OAAOpjB,EACvB,CAIA,WAAA0nC,CAAY1nC,GACR,OAAOgB,KAAK4mC,aAAa5nC,EAC7B,CAIA,WAAA2nC,CAAY3nC,GACR,OAAOgB,KAAK6mC,aAAa7nC,EAC7B,CAIA,MAAAsjB,CAAOtjB,GACH,MAAMiU,EAAO8K,EAASsoB,WAAWrnC,GAAOmf,WACxC,OAAOne,KAAKsQ,MAAMwR,GAAe7O,EAAKxR,SAAUwR,EACpD,CAIA,YAAA6zB,CAAa9nC,GACT,MAAMiU,EAAO8K,EAASlC,WAAW7c,GAAOmf,WACxC,OAAOne,KAAKsQ,MAAMwR,GAAe7O,EAAKxR,SAAUwR,EACpD,CAIA,YAAA8zB,CAAa/nC,GACT,OAAOgB,KAAKsiB,OAAO2jB,OAAOjnC,GAC9B,CAIA,IAAAujB,CAAKvjB,GACD,OAAOgB,KAAKsQ,MAAMsR,GAAW,EAAG5iB,EAAQ,EAAI,EAChD,CAIA,OAAAwjB,CAAQxjB,GACJ,OAAOgB,KAAKsQ,MAAMyR,GAAc,EAAG/iB,IAAU,EACjD,CAIA,QAAAyjB,CAASzjB,GACL,OAAOgB,KAAKwiB,QAAQxjB,EACxB,CAIA,OAAA0jB,CAAQ1jB,GACJ,MAAMiU,EAAO8K,EAASsoB,WAAWrnC,GACjC,OAAOgB,KAAKsQ,MAAMyR,GAAc,EAAG9O,EAAK+K,IAAI1N,MAAMyR,GAAc,EAAG9O,EAAKgL,GAC5E,CAIA,aAAA+oB,CAAchoC,GACV,MAAMiU,EAAO8K,EAASlC,WAAW7c,GACjC,OAAOgB,KAAKsQ,MAAMyR,GAAc,EAAG9O,EAAK+K,IAAI1N,MAAMyR,GAAc,EAAG9O,EAAKgL,GAC5E,CAIA,aAAAgpB,CAAcjoC,GACV,OAAOgB,KAAK0iB,QAAQujB,OAAOjnC,GAC/B,CAIA,QAAA2jB,CAAS3jB,GACL,OAAOgB,KAAK0iB,QAAQ1jB,EACxB,CAIA,cAAAkoC,CAAeloC,GACX,OAAOgB,KAAKgnC,cAAchoC,EAC9B,CAIA,cAAAmoC,CAAenoC,GACX,OAAOgB,KAAKinC,cAAcjoC,EAC9B,CAIA,KAAA4jB,CAAM5jB,GACF,OAAOgB,KAAKsQ,MAAMuS,EAAc,EAAG7jB,EACvC,CAQA,MAAA8jB,CAAO9jB,GACH,OAAOgB,KAAKsQ,MAAMyS,EAAe,EAAG/jB,EACxC,CAIA,KAAA8P,CAAM9P,GACF,MAAMoD,EAAMpD,EAAMyC,SAAW,EAC7B,OAAY,IAARW,EACOpC,KAAKsQ,MAAMsR,GAAW,EAAG,GAE7B5hB,KAAKqQ,OAAOjO,GAAKkO,MAAM0S,GAAY5gB,EAAKpD,EACnD,CAIA,MAAAuR,CAAOvR,GACH,MAAMoD,E5B7RP,SAAgBmO,GACnB,IAAInO,EAAM,EACN+E,EAAI,EACR,IAAK,IAAI5F,EAAI,EAAGA,EAAIgP,EAAO9O,SAAUF,EACjC4F,EAAIoJ,EAAOlD,WAAW9L,GAClB4F,EAAI,IACJ/E,GAAO,EAEF+E,EAAI,KACT/E,GAAO,EAEe,QAAZ,MAAJ+E,IAAkE,QAAZ,MAA3BoJ,EAAOlD,WAAW9L,EAAI,OACrDA,EACFa,GAAO,GAGPA,GAAO,EAGf,OAAOA,CACX,C4ByQoB,CAAYpD,GACxB,OAAe,IAARoD,EACDpC,KAAKqQ,OAAOjO,GAAKkO,MAAM,EAAYlO,EAAKpD,GACxCgB,KAAKsQ,MAAMsR,GAAW,EAAG,EACnC,CAKA,IAAAqB,GAII,OAHAjjB,KAAK2hB,OAAS,IAAIH,GAAMxhB,MACxBA,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,GAAGC,GAAM,EAAG,GACxCvhB,KAAKoC,IAAM,EACJpC,IACX,CAIA,KAAAuU,GAWI,OAVmB,MAAfvU,KAAK2hB,QACL3hB,KAAKyhB,KAAOzhB,KAAK2hB,OAAOF,KACxBzhB,KAAK0hB,KAAO1hB,KAAK2hB,OAAOD,KACxB1hB,KAAKoC,IAAMpC,KAAK2hB,OAAOvf,IACvBpC,KAAK2hB,OAAS3hB,KAAK2hB,OAAOtZ,OAG1BrI,KAAKyhB,KAAOzhB,KAAK0hB,KAAO,IAAIJ,GAAGC,GAAM,EAAG,GACxCvhB,KAAKoC,IAAM,GAERpC,IACX,CAIA,MAAAkjB,GACI,MAAMzB,EAAOzhB,KAAKyhB,KACZC,EAAO1hB,KAAK0hB,KACZtf,EAAMpC,KAAKoC,IAOjB,OANApC,KAAKuU,QAAQlE,OAAOjO,GACR,IAARA,IACApC,KAAK0hB,KAAKrZ,KAAOoZ,EAAKpZ,KACtBrI,KAAK0hB,KAAOA,EACZ1hB,KAAKoC,KAAOA,GAETpC,IACX,CAIA,MAAAmjB,GACI,IAAI1B,EAAOzhB,KAAKyhB,KAAKpZ,KACrB,MAAMmH,GA9QC/Q,EA8QWuB,KAAKoC,IA7QF,MAArBw1B,WAAW5nB,OACJgV,EAAYvmB,GAEhBwxC,GAAWxxC,IAJtB,IAAeA,EA+QP,IAAIqI,EAAM,EACV,KAAe,MAAR2a,GACHA,EAAK5hB,GAAG4hB,EAAKxW,IAAKuE,EAAK1I,GACvBA,GAAO2a,EAAKrf,IACZqf,EAAOA,EAAKpZ,KAGhB,OAAOmH,CACX,EAEJ,SAASoS,GAAU3W,EAAKuE,EAAK1I,GACzB0I,EAAI1I,GAAa,IAANmE,CACf,CACA,SAASklC,GAAcllC,EAAKuE,EAAK1I,GAC7B,KAAOmE,EAAM,KACTuE,EAAI1I,KAAe,IAANmE,EAAY,IACzBA,KAAS,EAEbuE,EAAI1I,GAAOmE,CACf,CAMA,MAAM4W,WAAiBP,GACnBjZ,KACA,WAAAiH,CAAYlN,EAAK6I,GACbmlC,MAAMD,GAAe/tC,EAAK6I,GAC1BjL,KAAKqI,UAAOnJ,CAChB,EAEJ,SAAS4iB,GAAc7W,EAAKuE,EAAK1I,GAC7B,KAAkB,IAAXmE,EAAIgT,IACPzO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,IAAM/S,EAAI+S,KAAO,EAAI/S,EAAIgT,IAAM,MAAQ,EAC3ChT,EAAIgT,MAAQ,EAEhB,KAAOhT,EAAI+S,GAAK,KACZxO,EAAI1I,KAAkB,IAATmE,EAAI+S,GAAW,IAC5B/S,EAAI+S,GAAK/S,EAAI+S,KAAO,EAExBxO,EAAI1I,KAASmE,EAAI+S,EACrB,CACA,SAAS+D,GAAa9W,EAAKuE,EAAK1I,GAC5B0I,EAAI1I,GAAa,IAANmE,EACXuE,EAAI1I,EAAM,GAAKmE,IAAQ,EAAI,IAC3BuE,EAAI1I,EAAM,GAAKmE,IAAQ,GAAK,IAC5BuE,EAAI1I,EAAM,GAAKmE,IAAQ,EAC3B,CACA,SAAS+X,GAAW/X,EAAKuE,EAAK1I,GAC1B0I,EAAIlQ,IAAI2L,EAAKnE,EACjB,CAmBA,SAASiJ,GAAiB9E,EAAKuE,EAAK1I,GAChC0I,EAAIlQ,IAAI2L,EAAKnE,EAEjB,CACA,SAASyI,GAAkBtE,EAAKuE,EAAK1I,GAC7BmE,EAAIxJ,OAAS,GAEb,EAAWwJ,EAAKuE,EAAK1I,GAGC,MAAjB0I,EAAIG,UAETH,EAAIG,UAAU1E,EAAKnE,GAGnB0I,EAAIlQ,IAAI,GAAqB2L,GAAMnE,EAE3C,CE3aO,SAASupC,GAAc7jC,EAAS66B,GACnC,MAAMtzB,EF+aC,IAAIm8B,GE3aX,OAHA7I,EAAMnyB,OAAO1I,EAASuH,EAAG,CACrBu8B,iBAAiB,IAEdv8B,EAAEoP,QACb,CCNO,IAAIotB,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,GC3DAC,GAsDAC,GTlDJ,SAAS,GAAYzwC,EAAMoE,EAAM+P,EAAQ8G,GAC5C,MAAO,CACHjb,OACAoE,OACA+P,SACA8G,SAER,CUhBO,SAASy1B,GAAYpyC,GACxB,SAASqyC,EAAUzmC,GAGf,GAAyB,MAArB5L,EAAE4L,EAAI5E,YACN,MAAM,IAAI7H,MAAM,sBAEpB,OAAOa,EAAE4L,EACb,CAUA,OAAO,GAAY,OAAQslC,GAAYoB,QATxB,SAAoB1mC,EAAKmU,GACpC,MAAMwyB,EAAYF,EAAUzmC,GAC5BmU,EAAO8C,MAAM0vB,EACjB,IACe,SAAoBtyB,GAE/B,OAAOoyB,EADKpyB,EAAO4C,QAEvB,GAGJ,CCnBO,SAAS1V,GAAQ0I,EAAQ8G,GAC5B,OAAO,GAAY,UAAWu0B,GAAYsB,iBAAkB38B,EAAQ8G,EACxE,CdsYyB,MAArB4b,WAAW5nB,SACXkgC,GAAiB1wC,UAAUsP,MAAQ,SAAU9P,GACzC,MAAMoD,EAAMpD,EAAMyC,SAAW,EAK7B,OAJAzB,KAAKqQ,OAAOjO,GACRA,EAAM,GACNpC,KAAKsQ,MAAMP,GAAkB3N,EAAKpD,GAE/BgB,IACX,EACAkwC,GAAiB1wC,UAAU+Q,OAAS,SAAUvR,GAC1C,MAAMoD,EAAMw1B,WAAW5nB,OAAOQ,WAAWxR,GAKzC,OAJAgB,KAAKqQ,OAAOjO,GACRA,EAAM,GACNpC,KAAKsQ,MAAMf,GAAmBnN,EAAKpD,GAEhCgB,IACX,GGvZJ,SAAWuwC,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,IYaH/xC,MAUxB,MAAMszC,WAAuBtzC,MAMhCuW,KAAO,iBACPhU,KAAO,iBAKJ,MAAMgxC,WAAqBvzC,MAM9BuW,KAAO,eACPhU,KAAO,eCnDJ,SAASixC,GAAUhzC,GACtB,OAAO8N,QAAQ9N,EACnB,CCFO,SAASizC,GAAoBhvC,GAChC,MAAMivC,EAAkB,IAAIrE,IAS5B,OARA5qC,EAAOkK,SAASnO,IACZ,IAAImzC,EAAOD,EAAgB9yC,IAAIJ,EAAMozC,cAChCD,IACDD,EAAgB5yC,IAAIN,EAAMozC,aAAc,IACxCD,EAAOD,EAAgB9yC,IAAIJ,EAAMozC,eAErCD,EAAK3xC,KAAKxB,EAAM,IAEbkzC,CACX,CCkCA,SAASG,GAAK5nC,GACV,OAAO,IAAI8xB,SAASr4B,IAChB2iB,WAAW3iB,EAASuG,EAAG,GAE/B,EdzCA,SAAW+lC,GACP,IAAI8B,EACJ9B,EAAenJ,MAAQ,KACL,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIggC,OAAiBhgC,EAAIggC,MAAM/hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,QAEO,MAAlBhgC,EAAIigC,YAAsBjgC,EAAIigC,WAAWhiC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,aAEE,MAAbjgC,EAAIkgC,OAAiBlgC,EAAIkgC,MAAMjiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,QAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEG,MAAdngC,EAAIogC,QAAkBpgC,EAAIogC,OAAOniC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,SAEM,MAAjBpgC,EAAIqgC,WAAqBrgC,EAAIqgC,UAAUpiC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,YAEU,MAArBrgC,EAAIsgC,eAAyBtgC,EAAIsgC,cAAcriC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIsgC,iBAEa,IAAzB/V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRggC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B5rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIggC,MAAQjzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIigC,WAAalzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIkgC,MAAQnzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,OAASrzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIqgC,UAAYtzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIsgC,cAAgBvzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX9B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG0T,KAAmBA,GAAiB,CAAC,IAExC,SAAWC,GACP,IAAI6B,EACJ7B,EAAYpJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIwgC,SAAmBxgC,EAAIwgC,QAAQviC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwgC,UAES,MAApBxgC,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,eAEE,MAAf7/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIygC,YACJj/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIygC,YAED,MAAZzgC,EAAI0gC,OACJl/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0gC,OAEU,MAAtB1gC,EAAI2gC,iBACJn/B,EAAE1D,OAAO,KACTmgC,GAAenJ,QAAQnyB,OAAO3C,EAAI2gC,eAAgBn/B,IAEjC,MAAjBxB,EAAI4gC,YACJp/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI4gC,aAEc,IAAzBrW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRwgC,QAAS,EAAgB,GACzBX,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIwgC,QAAUzzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI6/B,aAAe9yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIygC,UAAY1zB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAI0gC,KAAO3zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI2gC,eAAiB1C,GAAenJ,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQF,iBAEzB,MAEJ,KAAK,GACD3gC,EAAI4gC,UAAY7zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX7B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG2T,KAAgBA,GAAc,CAAC,ICnMlC,SAAWC,GACP,IAAI2C,EA8CAf,GA7CJ,SAAWe,GACP,IAAIf,EACJe,EAAchM,MAAQ,KACJ,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEmB,MAApB1Q,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,gBAEY,IAAzBtV,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR6/B,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACXyiC,IAAQ,GACP,EACDvgC,EAAI6/B,aAAe9yB,EAAO/O,SAI1B+O,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXe,EAAcn+B,OAAU3C,GACb89B,GAAc99B,EAAK8gC,EAAchM,SAE5CgM,EAAcr3B,OAAS,CAACxM,EAAKstB,IAClBsK,EAAc53B,EAAK6jC,EAAchM,QAASvK,EAExD,CA5CD,CA4CGuW,EAAgB3C,EAAc2C,gBAAkB3C,EAAc2C,cAAgB,CAAC,IAElF3C,EAAcrJ,MAAQ,KACJ,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAY9B,IAX6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAI+gC,YAAuC,IAAlB/gC,EAAI+gC,YAC9Bv/B,EAAE1D,OAAO,GACT0D,EAAEwO,KAAKhQ,EAAI+gC,YAEG,MAAb/gC,EAAIghC,OAA+B,KAAdhhC,EAAIghC,QAC1Bx/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIghC,QAES,MAAtBhhC,EAAIihC,eACJ,IAAK,MAAMx0C,KAASuT,EAAIihC,eACpBz/B,EAAE1D,OAAO,IACTqgC,EAAc2C,cAAchM,QAAQnyB,OAAOlW,EAAO+U,IAG7B,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+gC,WAAW,EACXC,MAAO,GACPC,eAAgB,IAEdvsC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAI+gC,UAAYh0B,EAAOiD,OACvB,MAEJ,KAAK,EACDhQ,EAAIghC,MAAQj0B,EAAO/O,SACnB,MAEJ,KAAK,EACD,GAAmC,MAA/BusB,EAAKsW,QAAQI,gBAA0BjhC,EAAIihC,eAAe/xC,SAAWq7B,EAAKsW,OAAOI,eACjF,MAAM,IAAI1B,GAAe,mEAE7Bv/B,EAAIihC,eAAehzC,KAAKkwC,EAAc2C,cAAchM,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxF+iC,OAAQtW,EAAKsW,QAAQK,mBAEzB,MAEJ,QACIn0B,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX5B,EAAcx7B,OAAU3C,GACb89B,GAAc99B,EAAKm+B,EAAcrJ,SAE5CqJ,EAAc10B,OAAS,CAACxM,EAAKstB,IAClBsK,EAAc53B,EAAKkhC,EAAcrJ,QAASvK,EAExD,CAnHD,CAmHG4T,KAAkBA,GAAgB,CAAC,IAEtC,SAAWC,GACP,IAAI2B,EACJ3B,EAAYtJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAhB1Q,EAAImhC,SACJ,IAAK,MAAM10C,KAASuT,EAAImhC,SACpB3/B,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAOlW,EAAO+U,IAGb,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRmhC,SAAU,IAERzsC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,GAAQyiC,IAAQ,GACP,EAAL,CACI,GAA6B,MAAzBhW,EAAKsW,QAAQM,UAAoBnhC,EAAImhC,SAASjyC,SAAWq7B,EAAKsW,OAAOM,SACrE,MAAM,IAAI5B,GAAe,6DAE7Bv/B,EAAImhC,SAASlzC,KAAK,GAAY6mC,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAClE+iC,OAAQtW,EAAKsW,QAAQO,YAG7B,MAEIr0B,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX3B,EAAYz7B,OAAU3C,GACX89B,GAAc99B,EAAKo+B,EAAYtJ,SAE1CsJ,EAAY30B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKmhC,EAAYtJ,QAASvK,EAEtD,CAnDD,CAmDG6T,KAAgBA,GAAc,CAAC,IAElC,SAAWC,GACP,IAAI0B,EACJ1B,EAAUvJ,MAAQ,KACA,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqhC,WAAuC,KAAlBrhC,EAAIqhC,YAC9B7/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqhC,YAEE,MAAfrhC,EAAIynB,UACJjmB,EAAE1D,OAAO,IACTqgC,GAAcrJ,QAAQnyB,OAAO3C,EAAIynB,QAASjmB,IAE9B,MAAZxB,EAAI/R,OACJuT,EAAE1D,OAAO,IACTsgC,GAAYtJ,QAAQnyB,OAAO3C,EAAI/R,KAAMuT,KAEZ,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqhC,UAAW,IAET3sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqhC,UAAYt0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIynB,QAAU0W,GAAcrJ,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAChE+iC,OAAQtW,EAAKsW,QAAQpZ,UAEzB,MAEJ,KAAK,EACDznB,EAAI/R,KAAOmwC,GAAYtJ,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC3D+iC,OAAQtW,EAAKsW,QAAQ5yC,OAEzB,MAEJ,QACI8e,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX1B,EAAU17B,OAAU3C,GACT89B,GAAc99B,EAAKq+B,EAAUvJ,SAExCuJ,EAAU50B,OAAS,CAACxM,EAAKstB,IACdsK,EAAc53B,EAAKohC,EAAUvJ,QAASvK,EAEpD,CAhED,CAgEG8T,KAAcA,GAAY,CAAC,IAE9B,SAAWJ,GACP,IAAI8B,EACJ9B,EAAenJ,MAAQ,KACL,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIggC,OAAiBhgC,EAAIggC,MAAM/hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,QAEO,MAAlBhgC,EAAIigC,YAAsBjgC,EAAIigC,WAAWhiC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,aAEE,MAAbjgC,EAAIkgC,OAAiBlgC,EAAIkgC,MAAMjiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,QAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEG,MAAdngC,EAAIogC,QAAkBpgC,EAAIogC,OAAOniC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,SAEM,MAAjBpgC,EAAIqgC,WAAqBrgC,EAAIqgC,UAAUpiC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,YAEU,MAArBrgC,EAAIsgC,eAAyBtgC,EAAIsgC,cAAcriC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIsgC,iBAEa,IAAzB/V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRggC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B5rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIggC,MAAQjzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIigC,WAAalzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIkgC,MAAQnzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,OAASrzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIqgC,UAAYtzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIsgC,cAAgBvzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX9B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI6B,EACJ7B,EAAYpJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIwgC,SAAmBxgC,EAAIwgC,QAAQviC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwgC,UAES,MAApBxgC,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,eAEE,MAAf7/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIygC,YACJj/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIygC,YAED,MAAZzgC,EAAI0gC,OACJl/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0gC,OAEU,MAAtB1gC,EAAI2gC,iBACJn/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI2gC,eAAgBn/B,IAEjC,MAAjBxB,EAAI4gC,YACJp/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI4gC,aAEc,IAAzBrW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRwgC,QAAS,EAAgB,GACzBX,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIwgC,QAAUzzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI6/B,aAAe9yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIygC,UAAY1zB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAI0gC,KAAO3zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI2gC,eAAiB,GAAe7L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQF,iBAEzB,MAEJ,KAAK,GACD3gC,EAAI4gC,UAAY7zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX7B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,IChblC,SAAW+T,GACP,IAAIyB,EACJzB,EAAiBxJ,MAAQ,KACP,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEmB,MAApB1Q,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,gBAEY,IAAzBtV,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR6/B,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACXyiC,IAAQ,GACP,EACDvgC,EAAI6/B,aAAe9yB,EAAO/O,SAI1B+O,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXzB,EAAiB37B,OAAU3C,GAChB89B,GAAc99B,EAAKs+B,EAAiBxJ,SAE/CwJ,EAAiB70B,OAAS,CAACxM,EAAKstB,IACrBsK,EAAc53B,EAAKqhC,EAAiBxJ,QAASvK,EAE3D,CA5CD,CA4CG+T,KAAqBA,GAAmB,CAAC,IC3C5C,SAAWC,GACP,IAAI+C,EAOAC,EAYAxB,GAlBJ,SAAWuB,GACPA,EAAqC,gBAAI,kBACzCA,EAA+B,UAAI,YACnCA,EAAiC,YAAI,cACrCA,EAAqC,gBAAI,iBAC5C,CALD,CAKGA,EAAsB/C,EAAuB+C,sBAAwB/C,EAAuB+C,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,EAAoBxM,MAAQ,IACjBoK,GAAYqC,EAE1B,CAJD,CAIGD,EAAsB/C,EAAuB+C,sBAAwB/C,EAAuB+C,oBAAsB,CAAC,IAEtH/C,EAAuBzJ,MAAQ,KACb,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqhC,WAAuC,KAAlBrhC,EAAIqhC,YAC9B7/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqhC,YAEc,MAA3BrhC,EAAIwhC,qBAAwF,IAAzDD,EAA4BvhC,EAAIwhC,uBACnEhgC,EAAE1D,OAAO,IACTygC,EAAuB+C,oBAAoBxM,QAAQnyB,OAAO3C,EAAIwhC,oBAAqBhgC,IAEhE,MAAnBxB,EAAIyhC,cACJjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIyhC,cAEQ,MAArBzhC,EAAI0hC,cACJ,IAAK,MAAMj1C,KAASuT,EAAI0hC,cACpBlgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,IAGY,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqhC,UAAW,GACXG,oBAAqBF,EAAoBK,gBACzCD,cAAe,IAEbhtC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqhC,UAAYt0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIwhC,oBAAsBjD,EAAuB+C,oBAAoBxM,QAAQrrB,OAAOsD,GACpF,MAEJ,KAAK,GACD/M,EAAIyhC,YAAc10B,EAAO/O,SACzB,MAEJ,KAAK,GACD,GAAkC,MAA9BusB,EAAKsW,QAAQa,eAAyB1hC,EAAI0hC,cAAcxyC,SAAWq7B,EAAKsW,OAAOa,cAC/E,MAAM,IAAInC,GAAe,kEAE7Bv/B,EAAI0hC,cAAczzC,KAAK8e,EAAO/O,UAC9B,MAEJ,QACI+O,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXxB,EAAuB57B,OAAU3C,GACtB89B,GAAc99B,EAAKu+B,EAAuBzJ,SAErDyJ,EAAuB90B,OAAS,CAACxM,EAAKstB,IAC3BsK,EAAc53B,EAAKshC,EAAuBzJ,QAASvK,EAEjE,CA9FD,CA8FGgU,KAA2BA,GAAyB,CAAC,IAExD,SAAWqD,GACP,IAAI7B,EACJ6B,EAAwB9M,MAAQ,KACd,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqhC,WAAuC,KAAlBrhC,EAAIqhC,YAC9B7/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqhC,YAEM,MAAlBrhC,EAAI6hC,YAAyC,IAAnB7hC,EAAI6hC,aAC/BrgC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAI6hC,aAEK,MAAlB7hC,EAAI8hC,aACJtgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI8hC,cAEY,IAAzBvX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqhC,UAAW,GACXQ,WAAY,GAEVntC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqhC,UAAYt0B,EAAO/O,SACvB,MAEJ,KAAK,GACDgC,EAAI6hC,WAAa90B,EAAOjP,SACxB,MAEJ,KAAK,GACDkC,EAAI8hC,WAAa/0B,EAAO/O,SACxB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX6B,EAAwBj/B,OAAU3C,GACvB89B,GAAc99B,EAAK4hC,EAAwB9M,SAEtD8M,EAAwBn4B,OAAS,CAACxM,EAAKstB,IAC5BsK,EAAc53B,EAAK2kC,EAAwB9M,QAASvK,EAElE,CA7DD,CA6DG,KAA4B,GAA0B,CAAC,IAE1D,SAAW6T,GACP,IAAI2B,EACJ3B,EAAYtJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEiB,MAAnB1Q,EAAI+hC,cACJvgC,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAO3C,EAAI+hC,YAAavgC,IAEzB,MAAnBxB,EAAIyhC,cACJjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIyhC,eAEY,IAAzBlX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAI+hC,YAAc,GAAYjN,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAClE+iC,OAAQtW,EAAKsW,QAAQkB,cAEzB,MAEJ,KAAK,EACD/hC,EAAIyhC,YAAc10B,EAAO/O,SACzB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX3B,EAAYz7B,OAAU3C,GACX89B,GAAc99B,EAAKo+B,EAAYtJ,SAE1CsJ,EAAY30B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKmhC,EAAYtJ,QAASvK,EAEtD,CApDD,CAoDG,KAAgB,GAAc,CAAC,IAElC,SAAW0T,GACP,IAAI8B,EACJ9B,EAAenJ,MAAQ,KACL,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIggC,OAAiBhgC,EAAIggC,MAAM/hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,QAEO,MAAlBhgC,EAAIigC,YAAsBjgC,EAAIigC,WAAWhiC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,aAEE,MAAbjgC,EAAIkgC,OAAiBlgC,EAAIkgC,MAAMjiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,QAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEG,MAAdngC,EAAIogC,QAAkBpgC,EAAIogC,OAAOniC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,SAEM,MAAjBpgC,EAAIqgC,WAAqBrgC,EAAIqgC,UAAUpiC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,YAEU,MAArBrgC,EAAIsgC,eAAyBtgC,EAAIsgC,cAAcriC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIsgC,iBAEa,IAAzB/V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRggC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B5rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIggC,MAAQjzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIigC,WAAalzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIkgC,MAAQnzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,OAASrzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIqgC,UAAYtzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIsgC,cAAgBvzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX9B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI6B,EACJ7B,EAAYpJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIwgC,SAAmBxgC,EAAIwgC,QAAQviC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwgC,UAES,MAApBxgC,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,eAEE,MAAf7/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIygC,YACJj/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIygC,YAED,MAAZzgC,EAAI0gC,OACJl/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0gC,OAEU,MAAtB1gC,EAAI2gC,iBACJn/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI2gC,eAAgBn/B,IAEjC,MAAjBxB,EAAI4gC,YACJp/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI4gC,aAEc,IAAzBrW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRwgC,QAAS,EAAgB,GACzBX,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIwgC,QAAUzzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI6/B,aAAe9yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIygC,UAAY1zB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAI0gC,KAAO3zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI2gC,eAAiB,GAAe7L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQF,iBAEzB,MAEJ,KAAK,GACD3gC,EAAI4gC,UAAY7zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX7B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,ICxZlC,SAAWiU,GACP,IAAIuB,EACJvB,EAAY1J,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEkB,MAAnB1Q,EAAIyhC,aAA2C,KAApBzhC,EAAIyhC,cAChCjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIyhC,cAEE,MAAfzhC,EAAI/F,UACJuH,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAO3C,EAAI/F,QAASuH,KAEf,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRyhC,YAAa,IAEX/sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIyhC,YAAc10B,EAAO/O,SACzB,MAEJ,KAAK,EACDgC,EAAI/F,QAAU,GAAY66B,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9D+iC,OAAQtW,EAAKsW,QAAQ5mC,UAEzB,MAEJ,QACI8S,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXvB,EAAY77B,OAAU3C,GACX89B,GAAc99B,EAAKw+B,EAAY1J,SAE1C0J,EAAY/0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKuhC,EAAY1J,QAASvK,EAEtD,CAtDD,CAsDGiU,KAAgBA,GAAc,CAAC,IAElC,SAAWC,GACP,IAAIsB,EACJtB,EAAa3J,MAAQ,KACH,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIgiC,YAAuC,IAAlBhiC,EAAIgiC,YAC9BxgC,EAAE1D,OAAO,GACT0D,EAAEwO,KAAKhQ,EAAIgiC,YAEC,MAAZhiC,EAAIiiC,OACJzgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIiiC,QAEY,IAAzB1X,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRgiC,WAAW,GAETttC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIgiC,UAAYj1B,EAAOiD,OACvB,MAEJ,KAAK,EACDhQ,EAAIiiC,KAAOl1B,EAAO/O,SAClB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXtB,EAAa97B,OAAU3C,GACZ89B,GAAc99B,EAAKy+B,EAAa3J,SAE3C2J,EAAah1B,OAAS,CAACxM,EAAKstB,IACjBsK,EAAc53B,EAAKwhC,EAAa3J,QAASvK,EAEvD,CApDD,CAoDGkU,KAAiBA,GAAe,CAAC,IAEpC,SAAWyD,GACP,IAAInC,EACJmC,EAAQpN,MAAQ,KACE,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqhC,WAAuC,KAAlBrhC,EAAIqhC,YAC9B7/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqhC,YAEE,MAAfrhC,EAAIynB,UACJjmB,EAAE1D,OAAO,IACT0gC,GAAY1J,QAAQnyB,OAAO3C,EAAIynB,QAASjmB,IAExB,MAAhBxB,EAAI8d,WACJtc,EAAE1D,OAAO,IACT2gC,GAAa3J,QAAQnyB,OAAO3C,EAAI8d,SAAUtc,KAEjB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqhC,UAAW,IAET3sC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqhC,UAAYt0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIynB,QAAU+W,GAAY1J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9D+iC,OAAQtW,EAAKsW,QAAQpZ,UAEzB,MAEJ,KAAK,EACDznB,EAAI8d,SAAW2gB,GAAa3J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAChE+iC,OAAQtW,EAAKsW,QAAQ/iB,WAEzB,MAEJ,QACI/Q,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXmC,EAAQv/B,OAAU3C,GACP89B,GAAc99B,EAAKkiC,EAAQpN,SAEtCoN,EAAQz4B,OAAS,CAACxM,EAAKstB,IACZsK,EAAc53B,EAAKilC,EAAQpN,QAASvK,EAElD,CAhED,CAgEG,KAAY,GAAU,CAAC,IAE1B,SAAW0T,GACP,IAAI8B,EACJ9B,EAAenJ,MAAQ,KACL,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIggC,OAAiBhgC,EAAIggC,MAAM/hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,QAEO,MAAlBhgC,EAAIigC,YAAsBjgC,EAAIigC,WAAWhiC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,aAEE,MAAbjgC,EAAIkgC,OAAiBlgC,EAAIkgC,MAAMjiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,QAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEG,MAAdngC,EAAIogC,QAAkBpgC,EAAIogC,OAAOniC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,SAEM,MAAjBpgC,EAAIqgC,WAAqBrgC,EAAIqgC,UAAUpiC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,YAEU,MAArBrgC,EAAIsgC,eAAyBtgC,EAAIsgC,cAAcriC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIsgC,iBAEa,IAAzB/V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRggC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B5rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIggC,MAAQjzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIigC,WAAalzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIkgC,MAAQnzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,OAASrzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIqgC,UAAYtzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIsgC,cAAgBvzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX9B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI6B,EACJ7B,EAAYpJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIwgC,SAAmBxgC,EAAIwgC,QAAQviC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwgC,UAES,MAApBxgC,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,eAEE,MAAf7/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIygC,YACJj/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIygC,YAED,MAAZzgC,EAAI0gC,OACJl/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0gC,OAEU,MAAtB1gC,EAAI2gC,iBACJn/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI2gC,eAAgBn/B,IAEjC,MAAjBxB,EAAI4gC,YACJp/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI4gC,aAEc,IAAzBrW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRwgC,QAAS,EAAgB,GACzBX,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIwgC,QAAUzzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI6/B,aAAe9yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIygC,UAAY1zB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAI0gC,KAAO3zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI2gC,eAAiB,GAAe7L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQF,iBAEzB,MAEJ,KAAK,GACD3gC,EAAI4gC,UAAY7zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX7B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,ICnXlC,SAAWmU,GACP,IAAIqB,EACJrB,EAAoB5J,MAAQ,KACV,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEiB,MAAnB1Q,EAAImiC,cACJ3gC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImiC,cAEG,MAAfniC,EAAI/F,UACJuH,EAAE1D,OAAO,IACT,GAAYg3B,QAAQnyB,OAAO3C,EAAI/F,QAASuH,IAErB,MAAnBxB,EAAIyhC,cACJjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIyhC,eAEY,IAAzBlX,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAImiC,YAAcp1B,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAI/F,QAAU,GAAY66B,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9D+iC,OAAQtW,EAAKsW,QAAQ5mC,UAEzB,MAEJ,KAAK,EACD+F,EAAIyhC,YAAc10B,EAAO/O,SACzB,MAEJ,QACI+O,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXrB,EAAoB/7B,OAAU3C,GACnB89B,GAAc99B,EAAK0+B,EAAoB5J,SAElD4J,EAAoBj1B,OAAS,CAACxM,EAAKstB,IACxBsK,EAAc53B,EAAKyhC,EAAoB5J,QAASvK,EAE9D,CA5DD,CA4DGmU,KAAwBA,GAAsB,CAAC,IAElD,SAAW0D,GACP,IAAIrC,EACJqC,EAAkBtN,MAAQ,KACR,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqhC,WAAuC,KAAlBrhC,EAAIqhC,YAC9B7/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqhC,YAEO,MAAnBrhC,EAAIqiC,cAA2C,IAApBriC,EAAIqiC,cAChC7gC,EAAE1D,OAAO,IACT0D,EAAEwO,KAAKhQ,EAAIqiC,cAEQ,MAAnBriC,EAAIyhC,cACJjgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIyhC,cAEQ,MAArBzhC,EAAI0hC,cACJ,IAAK,MAAMj1C,KAASuT,EAAI0hC,cACpBlgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAWjB,GARqB,MAAjBuT,EAAIsiC,YACJ9gC,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIsiC,YAEE,MAAftiC,EAAIuiC,UACJ/gC,EAAE1D,OAAO,KACT0D,EAAEuO,OAAO/P,EAAIuiC,UAEQ,MAArBviC,EAAIwiC,cACJ,IAAK,MAAM/1C,KAASuT,EAAIwiC,cACpBhhC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAM9P,GAGY,MAAxBuT,EAAIyiC,mBACJjhC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAMyD,EAAIyiC,mBAEc,MAAzBziC,EAAI0iC,oBAAuD,IAA1B1iC,EAAI0iC,oBACtClhC,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI0iC,oBAEY,MAAvB1iC,EAAI2iC,kBACJnhC,EAAE1D,OAAO,KACT0D,EAAEqO,OAAO7P,EAAI2iC,mBAEY,IAAzBpY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqhC,UAAW,GACXgB,aAAa,EACbX,cAAe,GACfc,cAAe,GACfE,mBAAmB,GAEjBhuC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqhC,UAAYt0B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIqiC,YAAct1B,EAAOiD,OACzB,MAEJ,KAAK,GACDhQ,EAAIyhC,YAAc10B,EAAO/O,SACzB,MAEJ,KAAK,GACD,GAAkC,MAA9BusB,EAAKsW,QAAQa,eAAyB1hC,EAAI0hC,cAAcxyC,SAAWq7B,EAAKsW,OAAOa,cAC/E,MAAM,IAAInC,GAAe,kEAE7Bv/B,EAAI0hC,cAAczzC,KAAK8e,EAAO/O,UAC9B,MAEJ,KAAK,GACDgC,EAAIsiC,UAAYv1B,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAIuiC,QAAUx1B,EAAOgD,SACrB,MAEJ,KAAK,GACD,GAAkC,MAA9Bwa,EAAKsW,QAAQ2B,eAAyBxiC,EAAIwiC,cAActzC,SAAWq7B,EAAKsW,OAAO2B,cAC/E,MAAM,IAAIjD,GAAe,kEAE7Bv/B,EAAIwiC,cAAcv0C,KAAK8e,EAAOxQ,SAC9B,MAEJ,KAAK,GACDyD,EAAIyiC,iBAAmB11B,EAAOxQ,QAC9B,MAEJ,KAAK,GACDyD,EAAI0iC,kBAAoB31B,EAAOiD,OAC/B,MAEJ,KAAK,GACDhQ,EAAI2iC,gBAAkB51B,EAAO8C,SAC7B,MAEJ,QACI9C,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXqC,EAAkBz/B,OAAU3C,GACjB89B,GAAc99B,EAAKoiC,EAAkBtN,SAEhDsN,EAAkB34B,OAAS,CAACxM,EAAKstB,IACtBsK,EAAc53B,EAAKmlC,EAAkBtN,QAASvK,EAE5D,CAlID,CAkIG,KAAsB,GAAoB,CAAC,IAE9C,SAAWqY,GACP,IAAI7C,EACJ6C,EAAmB9N,MAAQ,KACT,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqhC,WAAuC,KAAlBrhC,EAAIqhC,YAC9B7/B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqhC,YAEK,MAAlBrhC,EAAI6hC,aACJrgC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAI6hC,aAEK,MAAlB7hC,EAAI8hC,aACJtgC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI8hC,aAEG,MAAhB9hC,EAAImhC,SACJ,IAAK,MAAM10C,KAASuT,EAAImhC,SACpB3/B,EAAE1D,OAAO,KACT4gC,GAAoB5J,QAAQnyB,OAAOlW,EAAO+U,GAGtB,MAAxBxB,EAAIyiC,mBACJjhC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAMyD,EAAIyiC,oBAEa,IAAzBlY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqhC,UAAW,GACXF,SAAU,IAERzsC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqhC,UAAYt0B,EAAO/O,SACvB,MAEJ,KAAK,GACDgC,EAAI6hC,WAAa90B,EAAOjP,SACxB,MAEJ,KAAK,GACDkC,EAAI8hC,WAAa/0B,EAAO/O,SACxB,MAEJ,KAAK,GACD,GAA6B,MAAzBusB,EAAKsW,QAAQM,UAAoBnhC,EAAImhC,SAASjyC,SAAWq7B,EAAKsW,OAAOM,SACrE,MAAM,IAAI5B,GAAe,6DAE7Bv/B,EAAImhC,SAASlzC,KAAKywC,GAAoB5J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC1E+iC,OAAQtW,EAAKsW,QAAQO,aAEzB,MAEJ,KAAK,GACDphC,EAAIyiC,iBAAmB11B,EAAOxQ,QAC9B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX6C,EAAmBjgC,OAAU3C,GAClB89B,GAAc99B,EAAK4iC,EAAmB9N,SAEjD8N,EAAmBn5B,OAAS,CAACxM,EAAKstB,IACvBsK,EAAc53B,EAAK2lC,EAAmB9N,QAASvK,EAE7D,CApFD,CAoFG,KAAuB,GAAqB,CAAC,IAEhD,SAAW0T,GACP,IAAI8B,EACJ9B,EAAenJ,MAAQ,KACL,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIggC,OAAiBhgC,EAAIggC,MAAM/hC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIggC,QAEO,MAAlBhgC,EAAIigC,YAAsBjgC,EAAIigC,WAAWhiC,WAAa,IACvDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIigC,aAEE,MAAbjgC,EAAIkgC,OAAiBlgC,EAAIkgC,MAAMjiC,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIkgC,QAEG,MAAdlgC,EAAImgC,QAAkBngC,EAAImgC,OAAOliC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAImgC,SAEG,MAAdngC,EAAIogC,QAAkBpgC,EAAIogC,OAAOniC,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIogC,SAEM,MAAjBpgC,EAAIqgC,WAAqBrgC,EAAIqgC,UAAUpiC,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIqgC,YAEU,MAArBrgC,EAAIsgC,eAAyBtgC,EAAIsgC,cAAcriC,WAAa,IAC7DuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIsgC,iBAEa,IAAzB/V,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRggC,MAAO,EAAgB,GACvBC,WAAY,EAAgB,GAC5BC,MAAO,EAAgB,GACvBC,OAAQ,EAAgB,GACxBC,OAAQ,EAAgB,GACxBC,UAAW,EAAgB,GAC3BC,cAAe,EAAgB,IAE7B5rC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIggC,MAAQjzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAIigC,WAAalzB,EAAOxQ,QACxB,MAEJ,KAAK,EACDyD,EAAIkgC,MAAQnzB,EAAOxQ,QACnB,MAEJ,KAAK,EACDyD,EAAImgC,OAASpzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIogC,OAASrzB,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAIqgC,UAAYtzB,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIsgC,cAAgBvzB,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX9B,EAAet7B,OAAU3C,GACd89B,GAAc99B,EAAKi+B,EAAenJ,SAE7CmJ,EAAex0B,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKghC,EAAenJ,QAASvK,EAEzD,CAlGD,CAkGG,KAAmB,GAAiB,CAAC,IAExC,SAAW2T,GACP,IAAI6B,EACJ7B,EAAYpJ,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAf1Q,EAAIwgC,SAAmBxgC,EAAIwgC,QAAQviC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwgC,UAES,MAApBxgC,EAAI6/B,cAA6C,KAArB7/B,EAAI6/B,eACjCr+B,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAI6/B,eAEE,MAAf7/B,EAAIg7B,UACJx5B,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOkC,EAAIg7B,UAEI,MAAjBh7B,EAAIygC,YACJj/B,EAAE1D,OAAO,IACT0D,EAAEuO,OAAO/P,EAAIygC,YAED,MAAZzgC,EAAI0gC,OACJl/B,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0gC,OAEU,MAAtB1gC,EAAI2gC,iBACJn/B,EAAE1D,OAAO,KACT,GAAeg3B,QAAQnyB,OAAO3C,EAAI2gC,eAAgBn/B,IAEjC,MAAjBxB,EAAI4gC,YACJp/B,EAAE1D,OAAO,KACT0D,EAAEwO,KAAKhQ,EAAI4gC,aAEc,IAAzBrW,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRwgC,QAAS,EAAgB,GACzBX,aAAc,IAEZnrC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIwgC,QAAUzzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAI6/B,aAAe9yB,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIg7B,QAAUjuB,EAAOjP,SACrB,MAEJ,KAAK,GACDkC,EAAIygC,UAAY1zB,EAAOgD,SACvB,MAEJ,KAAK,GACD/P,EAAI0gC,KAAO3zB,EAAOxQ,QAClB,MAEJ,KAAK,GACDyD,EAAI2gC,eAAiB,GAAe7L,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQF,iBAEzB,MAEJ,KAAK,GACD3gC,EAAI4gC,UAAY7zB,EAAOiD,OACvB,MAEJ,QACIjD,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX7B,EAAYv7B,OAAU3C,GACX89B,GAAc99B,EAAKk+B,EAAYpJ,SAE1CoJ,EAAYz0B,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKihC,EAAYpJ,QAASvK,EAEtD,CA/FD,CA+FG,KAAgB,GAAc,CAAC,IC5dlC,SAAWoU,GACP,IAAIoB,EACJpB,EAAS7J,MAAQ,KACC,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAES,MAAX1Q,EAAI6iC,MACJrhC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI6iC,OAEa,IAAzBtY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACXyiC,IAAQ,GACP,EACDvgC,EAAI6iC,IAAM91B,EAAOxQ,QAIjBwQ,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXpB,EAASh8B,OAAU3C,GACR89B,GAAc99B,EAAK2+B,EAAS7J,SAEvC6J,EAASl1B,OAAS,CAACxM,EAAKstB,IACbsK,EAAc53B,EAAK0hC,EAAS7J,QAASvK,EAEnD,CA1CD,CA0CGoU,KAAaA,GAAW,CAAC,IAE5B,SAAWC,GACP,IAAImB,EACJnB,EAAkB9J,MAAQ,KACR,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEc,MAAhB1Q,EAAI8iC,WACJthC,EAAE1D,OAAO,GACT0D,EAAEqO,OAAO7P,EAAI8iC,YAEY,IAAzBvY,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACXyiC,IAAQ,GACP,EACDvgC,EAAI8iC,SAAW/1B,EAAO8C,SAItB9C,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXnB,EAAkBj8B,OAAU3C,GACjB89B,GAAc99B,EAAK4+B,EAAkB9J,SAEhD8J,EAAkBn1B,OAAS,CAACxM,EAAKstB,IACtBsK,EAAc53B,EAAK2hC,EAAkB9J,QAASvK,EAE5D,CA1CD,CA0CGqU,KAAsBA,GAAoB,CAAC,IAE9C,SAAWC,GACP,IAAIkB,EACJlB,EAAqB/J,MAAQ,KACX,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAI+iC,UACJ,IAAK,MAAMt2C,KAASuT,EAAI+iC,UACpBvhC,EAAE1D,OAAO,IACT6gC,GAAS7J,QAAQnyB,OAAOlW,EAAO+U,IAGV,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR+iC,UAAW,IAETruC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,GAAQyiC,IAAQ,GACP,EAAL,CACI,GAA8B,MAA1BhW,EAAKsW,QAAQkC,WAAqB/iC,EAAI+iC,UAAU7zC,SAAWq7B,EAAKsW,OAAOkC,UACvE,MAAM,IAAIxD,GAAe,8DAE7Bv/B,EAAI+iC,UAAU90C,KAAK0wC,GAAS7J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAChE+iC,OAAQtW,EAAKsW,QAAQmC,aAG7B,MAEIj2B,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXlB,EAAqBl8B,OAAU3C,GACpB89B,GAAc99B,EAAK6+B,EAAqB/J,SAEnD+J,EAAqBp1B,OAAS,CAACxM,EAAKstB,IACzBsK,EAAc53B,EAAK4hC,EAAqB/J,QAASvK,EAE/D,CAnDD,CAmDGsU,KAAyBA,GAAuB,CAAC,IAEpD,SAAWoE,GACP,IAAIlD,EACJkD,EAAgBnO,MAAQ,KACN,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEW,MAAb1Q,EAAIkjC,QACJ1hC,EAAE1D,OAAO,IACT8gC,GAAkB9J,QAAQnyB,OAAO3C,EAAIkjC,MAAO1hC,IAE5B,MAAhBxB,EAAI8d,WACJtc,EAAE1D,OAAO,IACT+gC,GAAqB/J,QAAQnyB,OAAO3C,EAAI8d,SAAUtc,KAEzB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIkjC,MAAQtE,GAAkB9J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAClE+iC,OAAQtW,EAAKsW,QAAQqC,QAEzB,MAEJ,KAAK,EACDljC,EAAI8d,SAAW+gB,GAAqB/J,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQ/iB,WAEzB,MAEJ,QACI/Q,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXkD,EAAgBtgC,OAAU3C,GACf89B,GAAc99B,EAAKijC,EAAgBnO,SAE9CmO,EAAgBx5B,OAAS,CAACxM,EAAKstB,IACpBsK,EAAc53B,EAAKgmC,EAAgBnO,QAASvK,EAE1D,CAtDD,CAsDG,KAAoB,GAAkB,CAAC,ICnM1C,SAAWuU,GACP,IAAIiB,EACJjB,EAAoBhK,MAAQ,KACV,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAQ9B,IAP6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAImjC,YACJ3hC,EAAE1D,OAAO,GACT0D,EAAE1D,OAAOkC,EAAImjC,YAEC,MAAdnjC,EAAIojC,OACJ,IAAK,MAAM32C,KAASuT,EAAIojC,OACpB5hC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOrR,IAGY,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRojC,OAAQ,IAEN1uC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAImjC,UAAYp2B,EAAOjP,SACvB,MAEJ,KAAK,EACD,GAA2B,MAAvBysB,EAAKsW,QAAQuC,QAAkBpjC,EAAIojC,OAAOl0C,SAAWq7B,EAAKsW,OAAOuC,OACjE,MAAM,IAAI7D,GAAe,2DAE7Bv/B,EAAIojC,OAAOn1C,KAAK8e,EAAOjP,UACvB,MAEJ,QACIiP,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXjB,EAAoBn8B,OAAU3C,GACnB89B,GAAc99B,EAAK8+B,EAAoBhK,SAElDgK,EAAoBr1B,OAAS,CAACxM,EAAKstB,IACxBsK,EAAc53B,EAAK6hC,EAAoBhK,QAASvK,EAE9D,CAzDD,CAyDGuU,KAAwBA,GAAsB,CAAC,IAElD,SAAWC,GACP,IAAIgB,EACJhB,EAAqBjK,MAAQ,KACX,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAQ9B,IAP6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAImjC,YACJ3hC,EAAE1D,OAAO,GACT0D,EAAE1D,OAAOkC,EAAImjC,YAEC,MAAdnjC,EAAIojC,OACJ,IAAK,MAAM32C,KAASuT,EAAIojC,OACpB5hC,EAAE1D,OAAO,IACT0D,EAAE1D,OAAOrR,IAGY,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRojC,OAAQ,IAEN1uC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAImjC,UAAYp2B,EAAOjP,SACvB,MAEJ,KAAK,EACD,GAA2B,MAAvBysB,EAAKsW,QAAQuC,QAAkBpjC,EAAIojC,OAAOl0C,SAAWq7B,EAAKsW,OAAOuC,OACjE,MAAM,IAAI7D,GAAe,2DAE7Bv/B,EAAIojC,OAAOn1C,KAAK8e,EAAOjP,UACvB,MAEJ,QACIiP,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXhB,EAAqBp8B,OAAU3C,GACpB89B,GAAc99B,EAAK++B,EAAqBjK,SAEnDiK,EAAqBt1B,OAAS,CAACxM,EAAKstB,IACzBsK,EAAc53B,EAAK8hC,EAAqBjK,QAASvK,EAE/D,CAzDD,CAyDGwU,KAAyBA,GAAuB,CAAC,ICpHpD,SAAWC,GACP,IAAIe,EACJf,EAAalK,MAAQ,KACH,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqjC,WAAuC,KAAlBrjC,EAAIqjC,YAC9B7hC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqjC,YAEQ,MAArBrjC,EAAIsjC,gBACJ9hC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIsjC,iBAEa,IAAzB/Y,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqjC,UAAW,IAET3uC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqjC,UAAYt2B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIsjC,cAAgBv2B,EAAOxQ,QAC3B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXf,EAAar8B,OAAU3C,GACZ89B,GAAc99B,EAAKg/B,EAAalK,SAE3CkK,EAAav1B,OAAS,CAACxM,EAAKstB,IACjBsK,EAAc53B,EAAK+hC,EAAalK,QAASvK,EAEvD,CApDD,CAoDGyU,KAAiBA,GAAe,CAAC,IAEpC,SAAWC,GACP,IAAIc,EACJd,EAAWnK,MAAQ,KACD,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIqjC,WAAuC,KAAlBrjC,EAAIqjC,YAC9B7hC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIqjC,YAEK,MAAjBrjC,EAAIujC,WAAuC,KAAlBvjC,EAAIujC,YAC9B/hC,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIujC,YAEW,MAAxBvjC,EAAIwjC,mBACJhiC,EAAE1D,OAAO,IACT0D,EAAEmO,MAAM3P,EAAIwjC,mBAES,MAArBxjC,EAAIyjC,cACJ,IAAK,MAAMh3C,KAASuT,EAAIyjC,cACpBjiC,EAAE1D,OAAO,IACTkhC,GAAalK,QAAQnyB,OAAOlW,EAAO+U,GAGpB,MAAnBxB,EAAI0jC,cACJliC,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI0jC,cAEG,MAAf1jC,EAAI2jC,UACJniC,EAAE1D,OAAO,KACT0D,EAAEjF,MAAMyD,EAAI2jC,WAEa,IAAzBpZ,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRqjC,UAAW,GACXE,UAAW,GACXE,cAAe,IAEb/uC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIqjC,UAAYt2B,EAAO/O,SACvB,MAEJ,KAAK,EACDgC,EAAIujC,UAAYx2B,EAAO/O,SACvB,MAEJ,KAAK,GACDgC,EAAIwjC,iBAAmBz2B,EAAO4C,QAC9B,MAEJ,KAAK,GACD,GAAkC,MAA9B4a,EAAKsW,QAAQ4C,eAAyBzjC,EAAIyjC,cAAcv0C,SAAWq7B,EAAKsW,OAAO4C,cAC/E,MAAM,IAAIlE,GAAe,kEAE7Bv/B,EAAIyjC,cAAcx1C,KAAK+wC,GAAalK,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACxE+iC,OAAQtW,EAAKsW,QAAQ+C,kBAEzB,MAEJ,KAAK,GACD5jC,EAAI0jC,YAAc32B,EAAOxQ,QACzB,MAEJ,KAAK,GACDyD,EAAI2jC,QAAU52B,EAAOxQ,QACrB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXd,EAAWt8B,OAAU3C,GACV89B,GAAc99B,EAAKi/B,EAAWnK,SAEzCmK,EAAWx1B,OAAS,CAACxM,EAAKstB,IACfsK,EAAc53B,EAAKgiC,EAAWnK,QAASvK,EAErD,CA7FD,CA6FG0U,KAAeA,GAAa,CAAC,IOrJhC,SAAS4E,GAAQ5iC,GACb,IAAKjJ,OAAO8rC,cAAc7iC,IAAMA,EAAI,EAChC,MAAM,IAAIhV,MAAM,kCAAoCgV,EAC5D,CAMA,SAAS,GAAOoN,KAAM01B,GAClB,MALa31B,EAKAC,aAJO3Q,YAAe4B,YAAYW,OAAOmO,IAA6B,eAAvBA,EAAErR,YAAYvO,MAKtE,MAAM,IAAIvC,MAAM,uBANxB,IAAiBmiB,EAOb,GAAI21B,EAAQ70C,OAAS,IAAM60C,EAAQtrB,SAASpK,EAAEnf,QAC1C,MAAM,IAAIjD,MAAM,iCAAmC83C,EAAU,gBAAkB11B,EAAEnf,OACzF,CAEA,SAAS80C,GAAMzgC,GACX,GAAiB,mBAANA,GAAwC,mBAAbA,EAAElX,OACpC,MAAM,IAAIJ,MAAM,mDACpB43C,GAAQtgC,EAAE0gC,WACVJ,GAAQtgC,EAAE2gC,SACd,CAEA,SAASC,GAAQC,EAAUC,GAAgB,GACvC,GAAID,EAASE,UACT,MAAM,IAAIr4C,MAAM,oCACpB,GAAIo4C,GAAiBD,EAASG,SAC1B,MAAM,IAAIt4C,MAAM,wCACxB,CCjCO,MAAM,GAA+B,iBAAfo5B,YAA2B,WAAYA,WAAaA,WAAWwV,YAASluC,EC0B9F,SAAS63C,GAAWC,GACvB,OAAO,IAAIC,SAASD,EAAItkC,OAAQskC,EAAIzP,WAAYyP,EAAIxmC,WACxD,CAEO,SAAS0mC,GAAKC,EAAM7uC,GACvB,OAAQ6uC,GAAS,GAAK7uC,EAAW6uC,IAAS7uC,CAC9C,CAoHO,SAAS8uC,GAAQzN,GAIpB,MAHoB,iBAATA,IACPA,EAZD,SAAqB5jC,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvH,MAAM,2CAA6CuH,GACjE,OAAO,IAAIkK,YAAW,IAAI87B,aAAc72B,OAAOnP,GACnD,CAQe,CAAY4jC,IACvB,GAAOA,GACAA,CACX,CA9FqC,mBAA9B15B,WAAWsO,KAAK,IAAI84B,OAA+BpnC,WAAWqnC,QAkH9D,MAAMC,GAET,KAAApf,GACI,OAAOn4B,KAAKw3C,YAChB,EASG,SAAS,GAAgBC,GAC5B,MAAMC,EAASC,GAAQF,IAAW34C,OAAOs4C,GAAQO,IAAM9hC,SACjD+hC,EAAMH,IAIZ,OAHAC,EAAMlB,UAAYoB,EAAIpB,UACtBkB,EAAMjB,SAAWmB,EAAInB,SACrBiB,EAAM94C,OAAS,IAAM64C,IACdC,CACX,CAkBO,SAAS,GAAYG,EAAc,IACtC,GAAI,IAA4C,mBAA3B,GAAOC,gBACxB,OAAO,GAAOA,gBAAgB,IAAI7nC,WAAW4nC,IAGjD,GAAI,IAAwC,mBAAvB,GAAOE,YACxB,OAAO9nC,WAAWsO,KAAK,GAAOw5B,YAAYF,IAE9C,MAAM,IAAIr5C,MAAM,yCACpB,CCpMO,SAASw5C,GAAIr3B,EAAGC,EAAGzZ,GACtB,OAAQwZ,EAAIC,EAAMD,EAAIxZ,EAAMyZ,EAAIzZ,CACpC,CAKO,MAAM8wC,WAAeV,GACxB,WAAAjoC,CAAYmnC,EAAUD,EAAW0B,EAAWC,GACxC/H,QACApwC,KAAK82C,UAAW,EAChB92C,KAAKyB,OAAS,EACdzB,KAAK8G,IAAM,EACX9G,KAAK62C,WAAY,EACjB72C,KAAKy2C,SAAWA,EAChBz2C,KAAKw2C,UAAYA,EACjBx2C,KAAKk4C,UAAYA,EACjBl4C,KAAKm4C,KAAOA,EACZn4C,KAAK0S,OAAS,IAAIzC,WAAWwmC,GAC7Bz2C,KAAKo4C,KAAOrB,GAAW/2C,KAAK0S,OAChC,CACA,MAAA5T,CAAO6qC,GACH+M,GAAQ12C,MACR,MAAM,KAAEo4C,EAAI,OAAE1lC,EAAM,SAAE+jC,GAAaz2C,KAE7BoC,GADNunC,EAAOyN,GAAQzN,IACEloC,OACjB,IAAK,IAAIqF,EAAM,EAAGA,EAAM1E,GAAM,CAC1B,MAAMi2C,EAAOpvC,KAAKC,IAAIutC,EAAWz2C,KAAK8G,IAAK1E,EAAM0E,GAEjD,GAAIuxC,IAAS5B,EAMb/jC,EAAOpT,IAAIqqC,EAAK1nB,SAASnb,EAAKA,EAAMuxC,GAAOr4C,KAAK8G,KAChD9G,KAAK8G,KAAOuxC,EACZvxC,GAAOuxC,EACHr4C,KAAK8G,MAAQ2vC,IACbz2C,KAAKoR,QAAQgnC,EAAM,GACnBp4C,KAAK8G,IAAM,OAXf,CACI,MAAMwxC,EAAWvB,GAAWpN,GAC5B,KAAO8M,GAAYr0C,EAAM0E,EAAKA,GAAO2vC,EACjCz2C,KAAKoR,QAAQknC,EAAUxxC,EAE/B,CAQJ,CAGA,OAFA9G,KAAKyB,QAAUkoC,EAAKloC,OACpBzB,KAAKu4C,aACEv4C,IACX,CACA,UAAAw4C,CAAW3O,GACP6M,GAAQ12C,MHrChB,SAAiB6pC,EAAK8M,GAClB,GAAO9M,GACP,MAAM3gC,EAAMytC,EAASH,UACrB,GAAI3M,EAAIpoC,OAASyH,EACb,MAAM,IAAI1K,MAAM,yDAA2D0K,EAEnF,CGgCQuvC,CAAQ5O,EAAK7pC,MACbA,KAAK82C,UAAW,EAIhB,MAAM,OAAEpkC,EAAM,KAAE0lC,EAAI,SAAE3B,EAAQ,KAAE0B,GAASn4C,KACzC,IAAI,IAAE8G,GAAQ9G,KAEd0S,EAAO5L,KAAS,IAChB9G,KAAK0S,OAAOuP,SAASnb,GAAK4xC,KAAK,GAG3B14C,KAAKk4C,UAAYzB,EAAW3vC,IAC5B9G,KAAKoR,QAAQgnC,EAAM,GACnBtxC,EAAM,GAGV,IAAK,IAAIvF,EAAIuF,EAAKvF,EAAIk1C,EAAUl1C,IAC5BmR,EAAOnR,GAAK,GApFjB,SAAsB62C,EAAM7Q,EAAYvoC,EAAOm5C,GAClD,GAAiC,mBAAtBC,EAAKO,aACZ,OAAOP,EAAKO,aAAapR,EAAYvoC,EAAOm5C,GAChD,MAAMS,EAAO3S,OAAO,IACd4S,EAAW5S,OAAO,YAClB6S,EAAKvuC,OAAQvL,GAAS45C,EAAQC,GAC9BE,EAAKxuC,OAAOvL,EAAQ65C,GACpB/iC,EAAIqiC,EAAO,EAAI,EACf32C,EAAI22C,EAAO,EAAI,EACrBC,EAAKY,UAAUzR,EAAazxB,EAAGgjC,EAAIX,GACnCC,EAAKY,UAAUzR,EAAa/lC,EAAGu3C,EAAIZ,EACvC,CA6EQQ,CAAaP,EAAM3B,EAAW,EAAGxQ,OAAqB,EAAdjmC,KAAKyB,QAAa02C,GAC1Dn4C,KAAKoR,QAAQgnC,EAAM,GACnB,MAAMa,EAAQlC,GAAWlN,GACnBznC,EAAMpC,KAAKw2C,UAEjB,GAAIp0C,EAAM,EACN,MAAM,IAAI5D,MAAM,+CACpB,MAAM06C,EAAS92C,EAAM,EACf+2C,EAAQn5C,KAAKZ,MACnB,GAAI85C,EAASC,EAAM13C,OACf,MAAM,IAAIjD,MAAM,sCACpB,IAAK,IAAI+C,EAAI,EAAGA,EAAI23C,EAAQ33C,IACxB03C,EAAMD,UAAU,EAAIz3C,EAAG43C,EAAM53C,GAAI42C,EACzC,CACA,MAAAtiC,GACI,MAAM,OAAEnD,EAAM,UAAE8jC,GAAcx2C,KAC9BA,KAAKw4C,WAAW9lC,GAChB,MAAMkzB,EAAMlzB,EAAOxR,MAAM,EAAGs1C,GAE5B,OADAx2C,KAAKyL,UACEm6B,CACX,CACA,UAAA4R,CAAW4B,GACPA,IAAOA,EAAK,IAAIp5C,KAAKsP,aACrB8pC,EAAG95C,OAAOU,KAAKZ,OACf,MAAM,SAAEq3C,EAAQ,OAAE/jC,EAAM,OAAEjR,EAAM,SAAEq1C,EAAQ,UAAED,EAAS,IAAE/vC,GAAQ9G,KAO/D,OANAo5C,EAAG33C,OAASA,EACZ23C,EAAGtyC,IAAMA,EACTsyC,EAAGtC,SAAWA,EACdsC,EAAGvC,UAAYA,EACXp1C,EAASg1C,GACT2C,EAAG1mC,OAAOpT,IAAIoT,GACX0mC,CACX,EClHJ,MAAMC,GAA2B,IAAIzjC,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,aAIlF0jC,GAA4B,IAAI1jC,YAAY,CAC9C,WAAY,WAAY,WAAY,WAAY,WAAY,WAAY,UAAY,aAMlF2jC,GAA2B,IAAI3jC,YAAY,IAC1C,MAAM4jC,WAAevB,GACxB,WAAA3oC,CAAYknC,EAAY,IACpBpG,MAAM,GAAIoG,EAAW,GAAG,GAGxBx2C,KAAKy5C,EAAmB,EAAfH,GAAU,GACnBt5C,KAAK05C,EAAmB,EAAfJ,GAAU,GACnBt5C,KAAK25C,EAAmB,EAAfL,GAAU,GACnBt5C,KAAK45C,EAAmB,EAAfN,GAAU,GACnBt5C,KAAK65C,EAAmB,EAAfP,GAAU,GACnBt5C,KAAK85C,EAAmB,EAAfR,GAAU,GACnBt5C,KAAK+5C,EAAmB,EAAfT,GAAU,GACnBt5C,KAAKg6C,EAAmB,EAAfV,GAAU,EACvB,CACA,GAAAl6C,GACI,MAAM,EAAEq6C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMh6C,KACnC,MAAO,CAACy5C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EACjC,CAEA,GAAA16C,CAAIm6C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,GACrBh6C,KAAKy5C,EAAQ,EAAJA,EACTz5C,KAAK05C,EAAQ,EAAJA,EACT15C,KAAK25C,EAAQ,EAAJA,EACT35C,KAAK45C,EAAQ,EAAJA,EACT55C,KAAK65C,EAAQ,EAAJA,EACT75C,KAAK85C,EAAQ,EAAJA,EACT95C,KAAK+5C,EAAQ,EAAJA,EACT/5C,KAAKg6C,EAAQ,EAAJA,CACb,CACA,OAAA5oC,CAAQgnC,EAAMl1C,GAEV,IAAK,IAAI3B,EAAI,EAAGA,EAAI,GAAIA,IAAK2B,GAAU,EACnCq2C,GAASh4C,GAAK62C,EAAK6B,UAAU/2C,GAAQ,GACzC,IAAK,IAAI3B,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC1B,MAAM24C,EAAMX,GAASh4C,EAAI,IACnB44C,EAAKZ,GAASh4C,EAAI,GAClB64C,EAAKlD,GAAKgD,EAAK,GAAKhD,GAAKgD,EAAK,IAAOA,IAAQ,EAC7CG,EAAKnD,GAAKiD,EAAI,IAAMjD,GAAKiD,EAAI,IAAOA,IAAO,GACjDZ,GAASh4C,GAAM84C,EAAKd,GAASh4C,EAAI,GAAK64C,EAAKb,GAASh4C,EAAI,IAAO,CACnE,CAEA,IAAI,EAAEk4C,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,EAAC,EAAEC,GAAMh6C,KACjC,IAAK,IAAIuB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACzB,MACM+4C,EAAMN,GADG9C,GAAK2C,EAAG,GAAK3C,GAAK2C,EAAG,IAAM3C,GAAK2C,EAAG,ODxD1Cl5B,ECyDqBk5B,GAAGC,GDxDrBn5B,ECwDwBo5B,GAAKV,GAAS93C,GAAKg4C,GAASh4C,GAAM,EAE/Dg5C,GADSrD,GAAKuC,EAAG,GAAKvC,GAAKuC,EAAG,IAAMvC,GAAKuC,EAAG,KAC7BzB,GAAIyB,EAAGC,EAAGC,GAAM,EACrCK,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKD,EAAIU,EAAM,EACfV,EAAID,EACJA,EAAID,EACJA,EAAID,EACJA,EAAKa,EAAKC,EAAM,CACpB,CDpED,IAAa55B,ECsEZ84B,EAAKA,EAAIz5C,KAAKy5C,EAAK,EACnBC,EAAKA,EAAI15C,KAAK05C,EAAK,EACnBC,EAAKA,EAAI35C,KAAK25C,EAAK,EACnBC,EAAKA,EAAI55C,KAAK45C,EAAK,EACnBC,EAAKA,EAAI75C,KAAK65C,EAAK,EACnBC,EAAKA,EAAI95C,KAAK85C,EAAK,EACnBC,EAAKA,EAAI/5C,KAAK+5C,EAAK,EACnBC,EAAKA,EAAIh6C,KAAKg6C,EAAK,EACnBh6C,KAAKV,IAAIm6C,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAAGC,EAClC,CACA,UAAAzB,GACIgB,GAASb,KAAK,EAClB,CACA,OAAAjtC,GACIzL,KAAKV,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAC9BU,KAAK0S,OAAOgmC,KAAK,EACrB,EAmBG,MAAM,GAAyB,IAAgB,IAAM,IAAIc,KC7HzD,IAAIgB,GAOA71B,GCPA81B,GAMAC,GAOAC,IDZX,SAAWH,GACPA,EAAiB,MAAI,QACrBA,EAAiB,MAAI,QACrBA,EAAqB,UAAI,YACzBA,EAAkB,OAAI,QACzB,CALD,CAKGA,KAAcA,GAAY,CAAC,IAE9B,SAAW71B,GAOPA,EAA4B,aAAI,gBAMhCA,EAAoC,qBAAI,uBAKxCA,EAA6B,cAAI,mBAOjCA,EAAiC,kBAAI,oBAKrCA,EAAmC,oBAAI,sBAKvCA,EAA2B,YAAI,uBAQ/BA,EAA6B,cAAI,mBAKjCA,EAA6B,cAAI,mBAKjCA,EAA4B,aAAI,kBAKhCA,EAAoC,qBAAI,uBAIxCA,EAA8B,eAAI,iBAKlCA,EAAoC,qBAAI,0BAQxCA,EAAsC,uBAAI,yBAK1CA,EAAsC,uBAAI,wBAC7C,CAjFD,CAiFGA,KAAkBA,GAAgB,CAAC,ICxFtC,SAAW81B,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,kBCepBC,GAJmB,CAC5BnF,UAT8B,EAU9BC,OAAQ,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,ICb9B,IAAImF,GAIAC,GCIJ,SAAS,GAASjoC,EAAOiS,EAAW,QACvC,MAAMqO,EAAO,GAAMrO,GACnB,GAAY,MAARqO,EACA,MAAM,IAAI50B,MAAM,yBAAyBumB,MAG7C,OAAOqO,EAAKzC,QAAQzb,OAAOpC,GAAOrL,UAAU,EAChD,CCRO,SAAS,GAAWiO,GACvB,MAAmB,iBAARA,EAEA,GADMA,EAAI1P,QAAQ,OAAQ,IACVoU,cAAe,UAEnC1E,CACX,EFZA,SAAWolC,GACPA,EAAuC,aAAI,eAC9C,CAFD,CAEGA,KAA6BA,GAA2B,CAAC,IAE5D,SAAWC,GACPA,EAAwB,UAAI,YAC5BA,EAA+B,iBAAI,mBACnCA,EAAkC,oBAAI,qBACzC,CAJD,CAIGA,KAAiBA,GAAe,CAAC,IEmB7B,MAAM,GAAcjsC,GAAU,GAASA,EAAO,UAIxCksC,GAAep6B,GAAM,GAASA,EAAG,QAIjC,GAAe7d,GAAM,GAAWA,EAAG,QAIzC,SAAS,GAAOk4C,EAAYC,GAC/B,MAAM94C,EAAM84C,GAAeD,EAAW3Q,QAAO,CAAC6Q,EAAKryC,IAASqyC,EAAMryC,EAAKrH,QAAQ,GACzEmkC,EAAM,IAAI31B,WAAW7N,GAC3B,IAAIc,EAAS,EACb,IAAK,MAAM4L,KAASmsC,EAChBrV,EAAItmC,IAAIwP,EAAO5L,GACfA,GAAU4L,EAAMrN,OAEpB,OAAOmkC,CACX,CC3BO,MAoBMwV,GAA2BC,IACpC,GAAI,kBAAmBA,GAAaA,EAAUpH,cAE1C,OAAOtyC,MAAM4c,KAAK,IAAI+8B,IAAID,EAAUpH,cAAc3vC,KAAK8tC,GAAiBmJ,GAA0BnJ,EAAciJ,EAAU3F,eAEzH,GAAI,WAAY2F,EAAW,CAE5B,QAAyBn8C,IAArBm8C,EAAU1F,OACV,MAAM,IAAIn3C,MAAM,iBACpB,OAAOmD,MAAM4c,KAAK,IAAI+8B,IAAID,EAAU1F,OAAOrxC,KAAKuG,GAAU,cAAcwwC,EAAU3F,WJhDxD,KIgD2F7qC,OACzH,CACK,GAAI,gBAAiBwwC,GAAa,YAAaA,EAEhD,MAAO,CACHE,GAA0B,IAAIF,EAAUG,eAAeH,EAAU9N,0BAA2B8N,EAAU3F,YAI1G,MAAM,IAAIl3C,MAAM,qDACpB,EAESi9C,GAAgCC,IACzC,MAAMt+B,EAAQs+B,EAAah0C,MAAM,KACjC,GAAoB,GAAhB0V,EAAM3b,QACO,SAAb2b,EAAM,IACO,MAAbA,EAAM,IACO,OAAbA,EAAM,GACN,MAAM,IAAI5e,MAAM,wBACpB,MAAMk3C,EAAYl3B,SAASpB,EAAM,IAC3Bu+B,EAAQn9B,SAASpB,EAAM,IAC7B,GAAI0jB,MAAM4U,IAAc5U,MAAM6a,GAC1B,MAAM,IAAIn9C,MAAM,8BACpB,MAAO,CACHk3C,YACAiG,QACH,EAEQC,GAA2BF,IACpC,MAAMG,EAAe,IAAIP,IACnBQ,EAAa,IAAIR,IACvB,IAAK,MAAM/H,KAASmI,EAAc,CAC9B,MAAM,UAAEhG,EAAS,MAAEiG,GAAUF,GAA6BlI,GAC1DsI,EAAa7+B,IAAI,GAAG04B,KAAaiG,KACjCG,EAAW9+B,IAAI04B,EACnB,CACA,GAA0B,IAAtBmG,EAAap9C,KACb,MAAM,IAAID,MAAM,mCAEpB,GAAIs9C,EAAWr9C,KAAO,EAClB,MAAM,IAAID,MAAM,6DAIpB,MAAO,CACHk3C,UAHcoG,EAAW74C,SAASoF,OAAOrJ,MAIzC22C,OAHWh0C,MAAM4c,KAAKs9B,GAAcv3C,KAAKkwC,GAASh2B,SAASg2B,EAAK9sC,MAAM,KAAK,MAI9E,EAIE,SAASq0C,GAA8B/H,EAAagI,GACvD,IAAKA,EAAiBhxB,SAASgpB,GAC3B,MAAM,IAAIx1C,MAAM,gBAAgBw1C,sEAAgFgI,8FAExH,CAoDO,SAASC,GAAyB7J,EAAc8J,EAAgB,GACnE,MAAM,YAAEV,EAAW,QAAEjO,GA/ClB,SAAiC6E,GACpC,MAAMh1B,EAAQg1B,EAAa1qC,MAAM,KACjC,GAAI0V,EAAM3b,OAAS,GAAK2b,EAAM3b,OAAS,EACnC,MAAMjD,MAAM,mCAGhB,IAAI29C,EAAa,EACjB,GAAoB,GAAhB/+B,EAAM3b,OAAa,CAEnB,GADA06C,EAAa39B,SAASpB,EAAM,IACxB0jB,MAAMqb,GACN,MAAM,IAAI39C,MAAM,6CAEpB,GAAI29C,EAAa,EACb,MAAM,IAAI39C,MAAM,6CAExB,CAEA,MAAM0P,EAASkP,EAAMlS,QAAQ,GAE7B,GAAwB,GAApBgD,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,qCAGpB,GAAwB,GAApB0P,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,iCAGpB,GAAwB,GAApB0P,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,oCAGpB,GAAwB,GAApB0P,EAAO,GAAGzM,OACV,MAAM,IAAIjD,MAAM,kCAEpB,MAAO,CACH29C,aACAX,YAAattC,EAAO,GACpBq/B,QAASr/B,EAAO,GAChBkuC,UAAWluC,EAAO,GAClB6W,SAAU7W,EAAO,GAEzB,CAMqCmuC,CAAwBjK,GACnDv8B,EAAS,GAAO,GAAO,CAAC,GAAY2lC,GAAc,GAAYjO,MAC9D+O,EAAW,IAAIrF,SAASphC,EAAOnD,OAAOxR,OAAO,IACnD,OAAOqJ,OAAO+xC,EAASC,aAAa,GAAG,GAAStW,OAAOiW,GAC3D,CACO,SAASX,GAA0BnJ,EAAcsD,EJjKtB,EIiKsDwG,EAAgB,GACpG,IAAK9J,EACD,MAAM5zC,MAAM,mCAGhB,MAAO,cAAck3C,KADFuG,GAAyB7J,EAAc8J,IAE9D,CAqBO,SAASM,GAAqBpK,EAErCqK,GACI,MAAmC,iBAAxBA,EACAA,OAE4Bv9C,IAAhCu9C,GAAsBd,MA/KW,CAACN,IACzC,QAAwBn8C,IAApBm8C,EAAUM,MACV,MAAM,IAAIn9C,MAAM,iBACpB,MAAO,cAAc68C,EAAU3F,WJtBD,KIsBoC2F,EAAUM,OAAO,EA6K7Ee,CAA6BD,GAC7BlB,GAA0BnJ,EAAcqK,GAAsB/G,WJpMtC,EIqMlC,CAKO,MC7MMiH,GAAoB7tC,IAI7B,IADAA,EAAQ,IAAImB,WAAWnB,IACbrN,OAAS,EACf,MAAM,IAAIjD,MAAM,qBACpB,MAAM45C,EAAO,IAAInB,SAASnoC,EAAM4D,QAC1BgjC,EAAY0C,EAAKwE,UAAU,GAC3BjH,EAAS,GACf,GAAqB,MAAjB7mC,EAAMrN,OAEN,IAAK,IAAIF,EAAI,EAAGA,EAAI,KAAMA,IAAK,CAC3B,MAAMs7C,EAAY5zC,KAAK6a,MAAMviB,EAAI,GAAK,EAChCu7C,EAAW,EAAKv7C,EAAI,EACtB62C,EAAK2E,SAASF,GAAc,GAAKC,GACjCnH,EAAOn1C,KAAKe,EAEpB,KAEC,CAED,MAAMy7C,EAAa5E,EAAK2E,SAAS,GACjC,IAAK,IAAIx7C,EAAI,EAAG2B,EAAS,EAAG3B,EAAIy7C,EAAYz7C,IAAK2B,GAAU,EAAG,CAC1D,GAAIA,EAAS,GAAK4L,EAAMrN,OACpB,MAAM,IAAIjD,MAAM,0BACpBm3C,EAAOn1C,KAAK43C,EAAKwE,UAAU15C,GAC/B,CACJ,CACA,MAAO,CAAEwyC,YAAWC,SAAQ,EAEnBsH,GAAoB5B,IAC7B,MAAM,UAAE3F,EAAS,OAAEC,GAAW0F,EACxBH,EAAcvF,EAAOl0C,QAAU,GAAK,IAAM,EAAI,EAAIk0C,EAAOl0C,OACzDiR,EAAS,IAAIb,YAAYqpC,GACzB9C,EAAO,IAAInB,SAASvkC,GAE1B,GADA0lC,EAAK8E,UAAU,EAAGxH,GACdC,EAAOl0C,QAAU,GAEjB,IAAK,MAAMoJ,KAAS8qC,EAAQ,CACxB,MAAMkH,EAAY5zC,KAAK6a,MAAMjZ,EAAQ,GAAK,EACpCiyC,EAAW,EAAKjyC,EAAQ,EAC9ButC,EAAK+E,SAASN,EAAWzE,EAAK2E,SAASF,GAAc,GAAKC,EAC9D,KAEC,CAED1E,EAAK+E,SAAS,EAAGxH,EAAOl0C,QACxB,IAAK,IAAIF,EAAI,EAAG2B,EAAS,EAAG3B,EAAIo0C,EAAOl0C,OAAQF,IAAK2B,GAAU,EAC1Dk1C,EAAK8E,UAAUh6C,EAAQyyC,EAAOp0C,GAEtC,CACA,OAAO,IAAI0O,WAAWyC,EAAO,mCClDjC,MAAM0qC,GAAW,OACV,MAAMC,GACTC,MACAC,MACAC,OACA,2BAAOC,CAAqBC,EAAOh+C,GAC/B,OAAOA,EAAS,GAAG09C,MAAYM,KAASh+C,IAAW,GAAG09C,MAAYM,GACtE,CACA,WAAApuC,CAAY5P,GACRM,KAAKs9C,MAAQ,GAAMD,GAAOI,qBAAqB,OAAQ/9C,IACvDM,KAAKu9C,MAAQ,GAAMF,GAAOI,qBAAqB,OAAQ/9C,IACvDM,KAAKw9C,OAAS,GAAMH,GAAOI,qBAAqB,QAAS/9C,GAC7D,CACA,QAAI80C,GACA,OAAOx0C,KAAKs9C,KAChB,CACA,QAAIpwC,GACA,OAAOlN,KAAKu9C,KAChB,CACA,SAAI/1B,GACA,OAAOxnB,KAAKw9C,MAChB,CACA,GAAApyC,CAAIsyC,KAAUv7C,IAEVw7C,EADe39C,KAAK09C,OACVv7C,EACd,ECxBJ,MAAMiJ,GAAM,IAAIiyC,GAAO,qBACjBO,GAAa3X,OAAO,KAGnB,MAAM4X,GACT7J,YACA8J,MACA,WAAAxuC,CAAY0kC,EAAa8J,GACrB99C,KAAKg0C,YAAcA,EACnBh0C,KAAK89C,MAAQA,CACjB,CACA,aAAI3K,GACA,OAAOrmC,QAAQ9M,KAAK89C,MAAM3K,UAC9B,CACA,WAAIJ,GACA,OAAO/yC,KAAK89C,MAAM/K,OACtB,CACA,gBAAIX,GACA,OAAOpyC,KAAK89C,MAAM1L,YACtB,CACA,iBAAI2L,GACA,OAAO/9C,KAAK89C,MAAM9K,SACtB,CACA,aAAIA,GAGA,IACI,GAAIhzC,KAAK89C,MAAM9K,UAAW,CAEtB,MAAMA,EAAYhzC,KAAK89C,MAAM9K,UAAY4K,GACzC,OAAO,IAAIpzC,KAAKD,OAAOyoC,GAC3B,CACA,MACJ,CACA,MAAO/uB,GACH,MACJ,CACJ,CACA,QAAIgvB,GACA,OAAOjzC,KAAK89C,MAAM7K,IACtB,CACA,WAAI1F,GAGA,OAAOvtC,KAAK89C,MAAMvQ,SAAW,CACjC,CACA,kBAAI2F,GACA,OAAOlzC,KAAK89C,MAAM5K,cACtB,EAEG,MAAM,GACTd,aACAe,UACAa,YACAgK,WACA,WAAA1uC,CAAY8iC,EAAce,GAAY,EAAOa,EAAagK,GAKtD,GAJAh+C,KAAKoyC,aAAeA,EACpBpyC,KAAKmzC,UAAYA,EACjBnzC,KAAKg0C,YAAcA,EACnBh0C,KAAKg+C,WAAaA,GACb5L,GAAiC,KAAjBA,EACjB,MAAM,IAAI5zC,MAAM,kCAExB,CACA,YAAMy/C,CAAOzxC,GACT,OAAO,GAAkB0I,aAAalV,KAAKk+C,WAAW1xC,GAC1D,CACA,gBAAM0xC,CAAW1xC,GACb,MAAMwmC,EAAYxmC,EAAQwmC,WAAa,IAAIxoC,KACrC2zC,EAAe,CACjBpL,QAASvmC,EAAQumC,QACjBxF,QArEW,EAsEX6E,aAAcpyC,KAAKoyC,aACnBY,UAAW/M,OAAO+M,EAAUoL,WAAaR,GACzC3K,UAAM/zC,EACNg0C,eAAgB1mC,EAAQ0mC,eACxBC,UAAWnzC,KAAKmzC,WAEpB,GAAInzC,KAAKg+C,WAAY,CACjB,MAAM/K,EAAOjzC,KAAKg+C,WAAWG,GAC7B,MAAO,IAAKA,EAAclL,OAC9B,CACA,OAAOkL,CACX,EAUG,SAASE,IAAc,YAAErK,EAAW,qBAAEyI,EAAoB,aAAErK,EAAY,UAAEe,EAAS,WAAE6K,IACxF,OAAO,IAAI,GAAQ5L,EAAce,EAAWqJ,GAAqBpK,EAAc4B,GAAeyI,GAAuBuB,EACzH,CACO,MAAM,GACThK,YACA5B,aACA,WAAA9iC,CAAY0kC,EAAa5B,GAGrB,GAFApyC,KAAKg0C,YAAcA,EACnBh0C,KAAKoyC,aAAeA,GACfA,GAAiC,KAAjBA,EACjB,MAAM,IAAI5zC,MAAM,kCAExB,CACA,kBAAA8/C,CAAmBxvC,GACf,MAAMqvC,EAAe,GAAkBniC,OAAOlN,GAC9C,OAAOytB,QAAQr4B,QAAQ,CACnB6uC,QAASoL,EAAapL,QACtBX,aAAc+L,EAAa/L,aAC3B7E,QAAS4Q,EAAa5Q,cAAWruC,EACjC8zC,UAAWmL,EAAanL,gBAAa9zC,EACrC+zC,KAAMkL,EAAalL,WAAQ/zC,EAC3Bg0C,eAAgBiL,EAAajL,qBAAkBh0C,EAC/Ci0C,UAAWgL,EAAahL,YAAa,GAE7C,CACA,kBAAMoL,CAAavK,EAAa8J,GAG5B,OAAIA,EAAMvQ,SACNniC,GAAIoc,MAAM,uDAxHC,EAwHgE,YAAas2B,EAAMvQ,SACvFhR,QAAQr4B,aAAQhF,IAEpB,IAAI2+C,GAAe7J,EAAa8J,EAC3C,EAYG,SAASU,GAAcpM,EAAcqK,GACxC,OAAO,IAAI,GAAQD,GAAqBpK,EAAcqK,GAAuBrK,EACjF,CC3FA,SAhBA,SAAajsC,GACT,GAHsC,MAGlBA,EAHPs9B,OAAOC,eAIhB,MAAO,WACH,MAAMsT,EAAM,GACZ,UAAW,MAAMyH,KAASt4C,EACtB6wC,EAAIx2C,KAAKi+C,GAEb,OAAOzH,CACV,EANM,GAQX,MAAMA,EAAM,GACZ,IAAK,MAAMyH,KAASt4C,EAChB6wC,EAAIx2C,KAAKi+C,GAEb,OAAOzH,CACX,EC7CO,SAAS,GAAO0H,EAAQj9C,GACb,MAAVA,IACAA,EAASi9C,EAAOpU,QAAO,CAAC6Q,EAAKryC,IAASqyC,EAAMryC,EAAKrH,QAAQ,IAE7D,MAAMk9C,EAAS35B,EAAYvjB,GAC3B,IAAIyB,EAAS,EACb,IAAK,MAAM8zC,KAAO0H,EACdC,EAAOr/C,IAAI03C,EAAK9zC,GAChBA,GAAU8zC,EAAIv1C,OAElB,OAAoBk9C,CACxB,CCbO,SAAS,GAAOh+B,EAAGC,GACtB,GAAID,IAAMC,EACN,OAAO,EAEX,GAAID,EAAEnQ,aAAeoQ,EAAEpQ,WACnB,OAAO,EAEX,IAAK,IAAIjP,EAAI,EAAGA,EAAIof,EAAEnQ,WAAYjP,IAC9B,GAAIof,EAAEpf,KAAOqf,EAAErf,GACX,OAAO,EAGf,OAAO,CACX,CCqEA,MAAM22B,GAASuL,OAAOmL,IAAI,+BAC1B,SAASgQ,GAAiBC,EAAMh0C,GAC5B,GAAa,MAATA,GAAiBA,EAAQ,EACzB,MAAM,IAAI2rB,WAAW,0BAEzB,IAAItzB,EAAS,EACb,IAAK,MAAMsM,KAAOqvC,EAAM,CACpB,MAAMC,EAAS57C,EAASsM,EAAIgB,WAC5B,GAAI3F,EAAQi0C,EACR,MAAO,CACHtvC,MACA3E,MAAOA,EAAQ3H,GAGvBA,EAAS47C,CACb,CACA,MAAM,IAAItoB,WAAW,yBACzB,CAcO,SAASuoB,GAAiB//C,GAC7B,OAAO8N,QAAQ9N,IAAQk5B,IAC3B,CACO,MAAM8mB,GACTH,KACAp9C,OACA,CAACy2B,KAAU,EACX,WAAA5oB,IAAeq6B,GACX3pC,KAAK6+C,KAAO,GACZ7+C,KAAKyB,OAAS,EACVkoC,EAAKloC,OAAS,GACdzB,KAAKi/C,UAAUtV,EAEvB,CACA,EAAElG,OAAOyb,kBACEl/C,KAAK6+C,IAChB,CACA,cAAIruC,GACA,OAAOxQ,KAAKyB,MAChB,CAIA,MAAA09C,IAAUN,GACN7+C,KAAKi/C,UAAUJ,EACnB,CAIA,SAAAI,CAAUJ,GACN,IAAIp9C,EAAS,EACb,IAAK,MAAM+N,KAAOqvC,EACd,GAAIrvC,aAAeS,WACfxO,GAAU+N,EAAIgB,WACdxQ,KAAK6+C,KAAKr+C,KAAKgP,OAEd,KAAIuvC,GAAiBvvC,GAKtB,MAAM,IAAIhR,MAAM,qEAJhBiD,GAAU+N,EAAIgB,WACdxQ,KAAK6+C,KAAKr+C,QAAQgP,EAAIqvC,KAI1B,CAEJ7+C,KAAKyB,QAAUA,CACnB,CAIA,OAAA29C,IAAWP,GACP7+C,KAAKq/C,WAAWR,EACpB,CAIA,UAAAQ,CAAWR,GACP,IAAIp9C,EAAS,EACb,IAAK,MAAM+N,KAAOqvC,EAAKS,UACnB,GAAI9vC,aAAeS,WACfxO,GAAU+N,EAAIgB,WACdxQ,KAAK6+C,KAAKj0C,QAAQ4E,OAEjB,KAAIuvC,GAAiBvvC,GAKtB,MAAM,IAAIhR,MAAM,sEAJhBiD,GAAU+N,EAAIgB,WACdxQ,KAAK6+C,KAAKj0C,WAAW4E,EAAIqvC,KAI7B,CAEJ7+C,KAAKyB,QAAUA,CACnB,CAIA,GAAArC,CAAIyL,GACA,MAAM+6B,EAAMgZ,GAAiB5+C,KAAK6+C,KAAMh0C,GACxC,OAAO+6B,EAAIp2B,IAAIo2B,EAAI/6B,MACvB,CAIA,GAAAvL,CAAIuL,EAAO7L,GACP,MAAM4mC,EAAMgZ,GAAiB5+C,KAAK6+C,KAAMh0C,GACxC+6B,EAAIp2B,IAAIo2B,EAAI/6B,OAAS7L,CACzB,CAIA,KAAA0Q,CAAMF,EAAKtM,EAAS,GAChB,GAAIsM,aAAeS,WACf,IAAK,IAAI1O,EAAI,EAAGA,EAAIiO,EAAI/N,OAAQF,IAC5BvB,KAAKV,IAAI4D,EAAS3B,EAAGiO,EAAIjO,QAG5B,KAAIw9C,GAAiBvvC,GAMtB,MAAM,IAAIhR,MAAM,oEALhB,IAAK,IAAI+C,EAAI,EAAGA,EAAIiO,EAAI/N,OAAQF,IAC5BvB,KAAKV,IAAI4D,EAAS3B,EAAGiO,EAAIpQ,IAAImC,GAKrC,CACJ,CAIA,OAAAg+C,CAAQzwC,GAIJ,GAFAA,EAAQ7F,KAAKu2C,MAAM1wC,KAEfvE,OAAOu2B,MAAMhyB,IAAUA,GAAS,GAApC,CAIA,GAAIA,IAAU9O,KAAKwQ,WAGf,OAFAxQ,KAAK6+C,KAAO,QACZ7+C,KAAKyB,OAAS,GAGlB,KAAOzB,KAAK6+C,KAAKp9C,OAAS,GAAG,CACzB,KAAIqN,GAAS9O,KAAK6+C,KAAK,GAAGruC,YAKrB,CACDxQ,KAAK6+C,KAAK,GAAK7+C,KAAK6+C,KAAK,GAAG58B,SAASnT,GACrC9O,KAAKyB,QAAUqN,EACf,KACJ,CARIA,GAAS9O,KAAK6+C,KAAK,GAAGruC,WACtBxQ,KAAKyB,QAAUzB,KAAK6+C,KAAK,GAAGruC,WAC5BxQ,KAAK6+C,KAAKv2C,OAOlB,CAlBA,CAmBJ,CAOA,KAAApH,CAAMu+C,EAAgBC,GAClB,MAAM,KAAEb,EAAI,OAAEp9C,GAAWzB,KAAK2/C,SAASF,EAAgBC,GACvD,OAAO,GAAOb,EAAMp9C,EACxB,CAOA,QAAAwgB,CAASw9B,EAAgBC,GACrB,MAAM,KAAEb,EAAI,OAAEp9C,GAAWzB,KAAK2/C,SAASF,EAAgBC,GACvD,OAAoB,IAAhBb,EAAKp9C,OACEo9C,EAAK,GAET,GAAOA,EAAMp9C,EACxB,CAMA,OAAAm+C,CAAQH,EAAgBC,GACpB,MAAM,KAAEb,EAAI,OAAEp9C,GAAWzB,KAAK2/C,SAASF,EAAgBC,GACjDG,EAAO,IAAIb,GAIjB,OAHAa,EAAKp+C,OAASA,EAEdo+C,EAAKhB,KAAO,IAAIA,GACTgB,CACX,CACA,QAAAF,CAASF,EAAgBC,GASrB,GARAD,EAAiBA,GAAkB,EACnCC,EAAeA,GAAgB1/C,KAAKyB,OAChCg+C,EAAiB,IACjBA,EAAiBz/C,KAAKyB,OAASg+C,GAE/BC,EAAe,IACfA,EAAe1/C,KAAKyB,OAASi+C,GAE7BD,EAAiB,GAAKC,EAAe1/C,KAAKyB,OAC1C,MAAM,IAAI+0B,WAAW,0BAEzB,GAAIipB,IAAmBC,EACnB,MAAO,CAAEb,KAAM,GAAIp9C,OAAQ,GAE/B,GAAuB,IAAnBg+C,GAAwBC,IAAiB1/C,KAAKyB,OAC9C,MAAO,CAAEo9C,KAAM7+C,KAAK6+C,KAAMp9C,OAAQzB,KAAKyB,QAE3C,MAAMo9C,EAAO,GACb,IAAI37C,EAAS,EACb,IAAK,IAAI3B,EAAI,EAAGA,EAAIvB,KAAK6+C,KAAKp9C,OAAQF,IAAK,CACvC,MAAMiO,EAAMxP,KAAK6+C,KAAKt9C,GAChBu+C,EAAW58C,EACX47C,EAASgB,EAAWtwC,EAAIgB,WAG9B,GADAtN,EAAS47C,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,EAAKr+C,KAAKgP,GACV,KACJ,CAEA,MAAMxI,EAAQy4C,EAAiBK,EAC/BjB,EAAKr+C,KAAKgP,EAAIyS,SAASjb,EAAOA,GAAS04C,EAAeD,KACtD,KACJ,CACA,GAAIM,EAAJ,CAEI,GAAuB,IAAnBN,EAAsB,CAEtBZ,EAAKr+C,KAAKgP,GACV,QACJ,CAEAqvC,EAAKr+C,KAAKgP,EAAIyS,SAASw9B,EAAiBK,GAE5C,KAVA,CAWA,GAAIE,EAAgB,CAChB,GAAIN,IAAiBZ,EAAQ,CAEzBD,EAAKr+C,KAAKgP,GACV,KACJ,CAEAqvC,EAAKr+C,KAAKgP,EAAIyS,SAAS,EAAGy9B,EAAeI,IACzC,KACJ,CAEAjB,EAAKr+C,KAAKgP,EAZV,CAaJ,CACA,MAAO,CAAEqvC,OAAMp9C,OAAQi+C,EAAeD,EAC1C,CACA,OAAAtwC,CAAQlD,EAAQ/I,EAAS,GACrB,KAAK67C,GAAiB9yC,IAAaA,aAAkBgE,YACjD,MAAM,IAAI7P,UAAU,+DAExB,MAAM6/C,EAASh0C,aAAkBgE,WAAahE,EAASA,EAAOgW,WAW9D,GAVA/e,EAASqH,OAAOrH,GAAU,GACtB49B,MAAM59B,KACNA,EAAS,GAETA,EAAS,IACTA,EAASlD,KAAKyB,OAASyB,GAEvBA,EAAS,IACTA,EAAS,GAES,IAAlB+I,EAAOxK,OACP,OAAOyB,EAASlD,KAAKyB,OAASzB,KAAKyB,OAASyB,EAGhD,MAAMg9C,EAAID,EAAOzvC,WACjB,GAAU,IAAN0vC,EACA,MAAM,IAAI9/C,UAAU,uCAGxB,MACM+/C,EAAqB,IAAIC,WADjB,KAGd,IAAK,IAAIj5C,EAAI,EAAGA,EAHF,IAGaA,IAEvBg5C,EAAmBh5C,IAAM,EAE7B,IAAK,IAAI3E,EAAI,EAAGA,EAAI09C,EAAG19C,IAEnB29C,EAAmBF,EAAOz9C,IAAMA,EAGpC,MAAM4S,EAAQ+qC,EACR33C,EAAYxI,KAAKwQ,WAAayvC,EAAOzvC,WACrC6vC,EAAeJ,EAAOzvC,WAAa,EACzC,IAAIlH,EACJ,IAAK,IAAI/H,EAAI2B,EAAQ3B,GAAKiH,EAAWjH,GAAK+H,EAAM,CAC5CA,EAAO,EACP,IAAK,IAAI9G,EAAI69C,EAAc79C,GAAK,EAAGA,IAAK,CACpC,MAAMmoC,EAAO3qC,KAAKZ,IAAImC,EAAIiB,GAC1B,GAAIy9C,EAAOz9C,KAAOmoC,EAAM,CACpBrhC,EAAOL,KAAK1K,IAAI,EAAGiE,EAAI4S,EAAMu1B,IAC7B,KACJ,CACJ,CACA,GAAa,IAATrhC,EACA,OAAO/H,CAEf,CACA,OAAQ,CACZ,CACA,OAAA++C,CAAQ/Y,GACJ,MAAM/3B,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9C8vC,QAAQ,EACxB,CACA,OAAAC,CAAQhZ,EAAYvoC,GAChB,MAAMwQ,EAAMwV,EAAY,GACX,IAAIiyB,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrD+vC,QAAQ,EAAGvhD,GAChBgB,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,QAAAiZ,CAASjZ,EAAYkZ,GACjB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CgwC,SAAS,EAAGC,EAC5B,CACA,QAAAC,CAASnZ,EAAYvoC,EAAOyhD,GACxB,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDkwC,SAAS,EAAG1hD,EAAOyhD,GACxBzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,QAAAoZ,CAASpZ,EAAYkZ,GACjB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CmwC,SAAS,EAAGF,EAC5B,CACA,QAAAG,CAASrZ,EAAYvoC,EAAOyhD,GACxB,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDowC,SAAS,EAAG5hD,EAAOyhD,GACxBzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,WAAAsZ,CAAYtZ,EAAYkZ,GACpB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CqwC,YAAY,EAAGJ,EAC/B,CACA,WAAAK,CAAYvZ,EAAYvoC,EAAOyhD,GAC3B,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDswC,YAAY,EAAG9hD,EAAOyhD,GAC3BzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,QAAAwV,CAASxV,GACL,MAAM/3B,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CusC,SAAS,EACzB,CACA,QAAAI,CAAS5V,EAAYvoC,GACjB,MAAMwQ,EAAMwV,EAAY,GACX,IAAIiyB,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrD2sC,SAAS,EAAGn+C,GACjBgB,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,SAAAqV,CAAUrV,EAAYkZ,GAClB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CosC,UAAU,EAAG6D,EAC7B,CACA,SAAAvD,CAAU3V,EAAYvoC,EAAOyhD,GACzB,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrD0sC,UAAU,EAAGl+C,EAAOyhD,GACzBzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,SAAA0S,CAAU1S,EAAYkZ,GAClB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CypC,UAAU,EAAGwG,EAC7B,CACA,SAAAzH,CAAUzR,EAAYvoC,EAAOyhD,GACzB,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDwoC,UAAU,EAAGh6C,EAAOyhD,GACzBzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,YAAAgV,CAAahV,EAAYkZ,GACrB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9C+rC,aAAa,EAAGkE,EAChC,CACA,YAAA9H,CAAapR,EAAYvoC,EAAOyhD,GAC5B,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDmoC,aAAa,EAAG35C,EAAOyhD,GAC5BzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,UAAAwZ,CAAWxZ,EAAYkZ,GACnB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CuwC,WAAW,EAAGN,EAC9B,CACA,UAAAO,CAAWzZ,EAAYvoC,EAAOyhD,GAC1B,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrDwwC,WAAW,EAAGhiD,EAAOyhD,GAC1BzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,UAAA0Z,CAAW1Z,EAAYkZ,GACnB,MAAMjxC,EAAMxP,KAAKiiB,SAASslB,EAAYA,EAAa,GAEnD,OADa,IAAI0P,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YAC9CywC,WAAW,EAAGR,EAC9B,CACA,UAAAS,CAAW3Z,EAAYvoC,EAAOyhD,GAC1B,MAAMjxC,EAAMK,EAAM,GACL,IAAIonC,SAASznC,EAAIkD,OAAQlD,EAAI+3B,WAAY/3B,EAAIgB,YACrD0wC,WAAW,EAAGliD,EAAOyhD,GAC1BzgD,KAAK0P,MAAMF,EAAK+3B,EACpB,CACA,MAAA+G,CAAOC,GACH,GAAa,MAATA,EACA,OAAO,EAEX,KAAMA,aAAiByQ,IACnB,OAAO,EAEX,GAAIzQ,EAAMsQ,KAAKp9C,SAAWzB,KAAK6+C,KAAKp9C,OAChC,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAIvB,KAAK6+C,KAAKp9C,OAAQF,IAClC,IAAK,GAAOvB,KAAK6+C,KAAKt9C,GAAIgtC,EAAMsQ,KAAKt9C,IACjC,OAAO,EAGf,OAAO,CACX,CAKA,sBAAO4/C,CAAgBtC,EAAMp9C,GACzB,MAAMo+C,EAAO,IAAIb,GAMjB,OALAa,EAAKhB,KAAOA,EACE,MAAVp9C,IACAA,EAASo9C,EAAKvU,QAAO,CAAC6Q,EAAKryC,IAASqyC,EAAMryC,EAAK0H,YAAY,IAE/DqvC,EAAKp+C,OAASA,EACPo+C,CACX,ECriBG,SAAS,GAAgBuB,GAC5B,OAAsC,MAA/BA,EAAM3d,OAAOC,cACxB,CCEA,MAAM2d,GAAkB5/C,IACpB,MAAM6/C,EAAe,EAAsB7/C,GACrC8/C,EAAYv8B,EAAYs8B,GAG9B,OAFA,EAAc7/C,EAAQ8/C,GACtBF,GAAevyC,MAAQwyC,EAChBC,CAAS,EAGb,SAAS,GAAOp7C,EAAQ8T,GAE3B,MAAMunC,GADNvnC,EAAUA,GAAW,CAAC,GACOwnC,eAAiBJ,GAC9C,SAAUK,EAAWrkC,GAEjB,MAAM5b,EAAS+/C,EAAankC,EAAM7M,YAE9B/O,aAAkBwO,iBACZxO,QAGCA,EAGP4b,aAAiBpN,iBACXoN,QAGCA,CAEf,CACA,OAAI,GAAgBlX,GACT,kBACH,UAAW,MAAMkX,KAASlX,QACfu7C,EAAWrkC,EAEzB,CAJM,GAMJ,YACH,IAAK,MAAMA,KAASlX,QACTu7C,EAAWrkC,EAEzB,CAJM,EAKX,CAlCAgkC,GAAevyC,MAAQ,EAmCvB,GAAO6yC,OAAS,CAACtkC,EAAOpD,KAEpB,MAAMunC,GADNvnC,EAAUA,GAAW,CAAC,GACOwnC,eAAiBJ,GAC9C,OAAO,IAAIrC,GAAewC,EAAankC,EAAM7M,YAAa6M,EAAM,EC9C7D,MAAMukC,WAAkCpjD,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM8sC,WAA+BrjD,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM+sC,WAAqCtjD,MAC9CuC,KAAO,+BACPgU,KAAO,0BAKJ,MAAMgtC,WAA2BvjD,MACpCuC,KAAO,qBACPgU,KAAO,qBCnBX,IAAIitC,IACJ,SAAWA,GACPA,EAASA,EAAiB,OAAI,GAAK,SACnCA,EAASA,EAAe,KAAI,GAAK,MACpC,CAHD,CAGGA,KAAaA,GAAW,CAAC,IAC5B,MAAMC,GAAkBzyC,IACpB,MAAM/N,EAAS,EAAc+N,GAE7B,OADAyyC,GAAenzC,MAAQ,EAAsBrN,GACtCA,CAAM,EAGV,SAAS,GAAO0E,EAAQ8T,GAC3B,MAAMvH,EAAS,IAAIssC,GACnB,IAAIxa,EAAOwd,GAASE,OAChBC,GAAc,EAClB,MAAMC,EAAgBnoC,GAASmoC,eAAiBH,GAC1CI,EAAkBpoC,GAASooC,iBAnBJ,EAoBvBC,EAAgBroC,GAASqoC,eAlBJ,QAmB3B,SAAUZ,IACN,KAAOhvC,EAAOlC,WAAa,GAAG,CAC1B,GAAIg0B,IAASwd,GAASE,OAElB,IAEI,GADAC,EAAaC,EAAc1vC,GACvByvC,EAAa,EACb,MAAM,IAAIP,GAA0B,0BAExC,GAAIO,EAAaG,EACb,MAAM,IAAIT,GAAuB,2BAErC,MAAMU,EAAmBH,EAActzC,MACvC4D,EAAO6sC,QAAQgD,GACU,MAArBtoC,GAASuoC,UACTvoC,EAAQuoC,SAASL,GAErB3d,EAAOwd,GAASS,IACpB,CACA,MAAOh8B,GACH,GAAIA,aAAe+P,WAAY,CAC3B,GAAI9jB,EAAOlC,WAAa6xC,EACpB,MAAM,IAAIP,GAA6B,kCAE3C,KACJ,CACA,MAAMr7B,CACV,CAEJ,GAAI+d,IAASwd,GAASS,KAAM,CACxB,GAAI/vC,EAAOlC,WAAa2xC,EAEpB,MAEJ,MAAMxY,EAAOj3B,EAAOktC,QAAQ,EAAGuC,GAC/BzvC,EAAO6sC,QAAQ4C,GACQ,MAAnBloC,GAASyoC,QACTzoC,EAAQyoC,OAAO/Y,SAEbA,EACNnF,EAAOwd,GAASE,MACpB,CACJ,CACJ,CACA,OAAI,GAAgB/7C,GACT,kBACH,UAAW,MAAMqJ,KAAOrJ,EACpBuM,EAAOysC,OAAO3vC,SACPkyC,IAEX,GAAIhvC,EAAOlC,WAAa,EACpB,MAAM,IAAIuxC,GAAmB,0BAEpC,CARM,GAUJ,YACH,IAAK,MAAMvyC,KAAOrJ,EACduM,EAAOysC,OAAO3vC,SACPkyC,IAEX,GAAIhvC,EAAOlC,WAAa,EACpB,MAAM,IAAIuxC,GAAmB,0BAEpC,CARM,EASX,CC3Fe,SAASY,KACvB,MAAM3xB,EAAW,CAAC,EAOlB,OALAA,EAAS4xB,QAAU,IAAIrmB,SAAQ,CAACr4B,EAASs4B,KACxCxL,EAAS9sB,QAAUA,EACnB8sB,EAASwL,OAASA,CAAM,IAGlBxL,CACR,CDUAixB,GAAenzC,MAAQ,EAyEvB,GAAO+zC,WAAa,CAACvjC,EAAQrF,KACzB,IAAIzJ,EAAa,EA4BjB,OAAO,GA3BgB28B,kBACnB,OACI,IACI,MAAM,KAAEnK,EAAI,MAAEhkC,SAAgBsgB,EAAOjX,KAAKmI,GAC1C,IAAa,IAATwyB,EACA,OAES,MAAThkC,UACMA,EAEd,CACA,MAAOynB,GACH,GAAiB,mBAAbA,EAAI1R,KACJ,MAAO,CAAEiuB,MAAM,EAAMhkC,MAAO,MAEhC,MAAMynB,CACV,CACA,QAEIjW,EAAa,CACjB,CAER,CAtBsB,GA2BO,IACrByJ,GAAW,CAAC,EAChBuoC,SAHchhD,IAAQgP,EAAahP,CAAC,GAItC,EE3HN,MAAMshD,GACFpwC,OACAmM,KACAkkC,IACAC,IACA36C,KACA,WAAAiH,CAAY2zC,GACR,KAAMA,EAAM,IAAQA,EAAM,EAAKA,EAC3B,MAAM,IAAIzkD,MAAM,qDAEpBwB,KAAK0S,OAAS,IAAI/Q,MAAMshD,GACxBjjD,KAAK6e,KAAOokC,EAAM,EAClBjjD,KAAK+iD,IAAM,EACX/iD,KAAKgjD,IAAM,EACXhjD,KAAKqI,KAAO,IAChB,CACA,IAAA7H,CAAKmpC,GACD,YAA8BzqC,IAA1Bc,KAAK0S,OAAO1S,KAAK+iD,OAGrB/iD,KAAK0S,OAAO1S,KAAK+iD,KAAOpZ,EACxB3pC,KAAK+iD,IAAO/iD,KAAK+iD,IAAM,EAAK/iD,KAAK6e,MAC1B,EACX,CACA,KAAAvW,GACI,MAAMwrB,EAAO9zB,KAAK0S,OAAO1S,KAAKgjD,KAC9B,QAAa9jD,IAAT40B,EAKJ,OAFA9zB,KAAK0S,OAAO1S,KAAKgjD,UAAO9jD,EACxBc,KAAKgjD,IAAOhjD,KAAKgjD,IAAM,EAAKhjD,KAAK6e,KAC1BiV,CACX,CACA,OAAAovB,GACI,YAAiChkD,IAA1Bc,KAAK0S,OAAO1S,KAAKgjD,IAC5B,EAEG,MAAMG,GACT1kD,KACAwkD,IACAxhC,KACAC,KACA,WAAApS,CAAY2K,EAAU,CAAC,GACnBja,KAAKijD,IAAMhpC,EAAQmpC,YAAc,GACjCpjD,KAAKyhB,KAAO,IAAIqhC,GAAU9iD,KAAKijD,KAC/BjjD,KAAK0hB,KAAO1hB,KAAKyhB,KACjBzhB,KAAKvB,KAAO,CAChB,CACA,aAAA4kD,CAAc9wC,GACV,OAAuB,MAAnBA,GAAK/B,WACE+B,EAAI/B,WAER,CACX,CACA,IAAAhQ,CAAKyK,GAID,GAHkB,MAAdA,GAAKjM,QACLgB,KAAKvB,MAAQuB,KAAKqjD,cAAcp4C,EAAIjM,SAEnCgB,KAAKyhB,KAAKjhB,KAAKyK,GAAM,CACtB,MAAMpC,EAAO7I,KAAKyhB,KAClBzhB,KAAKyhB,KAAO5Y,EAAKR,KAAO,IAAIy6C,GAAU,EAAI9iD,KAAKyhB,KAAK/O,OAAOjR,QAC3DzB,KAAKyhB,KAAKjhB,KAAKyK,EACnB,CACJ,CACA,KAAA3C,GACI,IAAI2C,EAAMjL,KAAK0hB,KAAKpZ,QACpB,QAAYpJ,IAAR+L,GAAwC,MAAlBjL,KAAK0hB,KAAKrZ,KAAe,CAC/C,MAAMA,EAAOrI,KAAK0hB,KAAKrZ,KACvBrI,KAAK0hB,KAAKrZ,KAAO,KACjBrI,KAAK0hB,KAAOrZ,EACZ4C,EAAMjL,KAAK0hB,KAAKpZ,OACpB,CAIA,OAHkB,MAAd2C,GAAKjM,QACLgB,KAAKvB,MAAQuB,KAAKqjD,cAAcp4C,EAAIjM,QAEjCiM,CACX,CACA,OAAAi4C,GACI,OAAOljD,KAAKyhB,KAAKyhC,SACrB,EC9BG,MAAMI,WAAmB9kD,MAC5B2G,KACA4P,KACA,WAAAzF,CAAY9C,EAASuI,GACjBq7B,MAAM5jC,GAAW,6BACjBxM,KAAKmF,KAAO,UACZnF,KAAK+U,KAAOA,GAAQ,WACxB,EAEG,SAASwuC,GAAStpC,EAAU,CAAC,GAehC,OA6BJ,SAAmBupC,EAASvpC,GAExB,IAEIspC,EACAE,EACAC,EAJAC,GADJ1pC,EAAUA,GAAW,CAAC,GACF0pC,MAChBjxC,EAAS,IAAIywC,GAIbS,EAAQ,KACZ,MAiCMC,EAAcx7C,GACF,MAAVo7C,EACOA,EAAOp7C,IAElBqK,EAAOlS,KAAK6H,GACLk7C,GAUL/iD,EAAQxB,IACV,GAAI0kD,EACA,OAAOH,EAGX,IAA4B,IAAxBtpC,GAAS6pC,YAA4C,MAArB9kD,GAAOwR,WACvC,MAAM,IAAIhS,MAAM,kEAEpB,OAAOqlD,EAAW,CAAE7gB,MAAM,EAAOhkC,SAAQ,EAEvCiI,EAAOwf,GACLi9B,EACOH,GACXG,GAAQ,EACO,MAAPj9B,EAtBQ,CAACA,IACjB/T,EAAS,IAAIywC,GACC,MAAVM,EACOA,EAAO,CAAEj8B,MAAOf,KAE3B/T,EAAOlS,KAAK,CAAEgnB,MAAOf,IACd88B,IAgBgBQ,CAAYt9B,GAAOo9B,EAAW,CAAE7gB,MAAM,KAkDjE,GAvCAugB,EAAW,CACP,CAAC9f,OAAOC,iBAAmB,OAAO1jC,IAAM,EACxCqI,KA3Ea8kC,UACb,IACI,OAAKz6B,EAAOwwC,UAGRQ,EACO,CAAE1gB,MAAM,SAEN,IAAIzG,SAAQ,CAACr4B,EAASs4B,KAC/BinB,EAAUp7C,IACNo7C,EAAS,KACT/wC,EAAOlS,KAAK6H,GACZ,IACInE,EAAQs/C,EAAQ9wC,GACpB,CACA,MAAO+T,GACH+V,EAAO/V,EACX,CACA,OAAO88B,CAAQ,CAClB,IAhBMC,EAAQ9wC,EAkBvB,CACA,QACQA,EAAOwwC,WAGPc,gBAAe,KACXJ,EAAM1/C,UACN0/C,EAAQ,IAAU,GAG9B,GA6CA/f,OAZY,KACZnxB,EAAS,IAAIywC,GACbl8C,IACO,CAAE+7B,MAAM,IAUfihB,MARYx9B,IACZxf,EAAIwf,GACG,CAAEuc,MAAM,IAOfxiC,OACAyG,MACA,kBAAIi9C,GACA,OAAOxxC,EAAOjU,IAClB,EACA0lD,QAAShX,MAAOlzB,IACZ,MAAMmqC,EAASnqC,GAASmqC,OAExB,GADAA,GAAQC,iBACJ3xC,EAAOwwC,UACP,OAEJ,IAAIoB,EACAjkD,EACU,MAAV+jD,IACAE,EAAS,IAAI/nB,SAAQ,CAACr4B,EAASs4B,KAC3Bn8B,EAAW,KACPm8B,EAAO,IAAI8mB,GAAa,EAE5Bc,EAAOG,iBAAiB,QAASlkD,EAAS,KAGlD,UACUk8B,QAAQioB,KAAK,CACfZ,EAAMhB,QACN0B,GAER,CACA,QACoB,MAAZjkD,GAA8B,MAAV+jD,GACpBA,GAAQK,oBAAoB,QAASpkD,EAE7C,IAGK,MAATsjD,EACA,OAAOJ,EAEX,MAAMmB,EAAYnB,EAsClB,OArCAA,EAAW,CACP,CAAC9f,OAAOC,iBAAmB,OAAO1jC,IAAM,EACxCqI,KAAI,IACOq8C,EAAUr8C,OAErB47C,MAAMx9B,IACFi+B,EAAUT,MAAMx9B,GACH,MAATk9B,IACAA,EAAMl9B,GACNk9B,OAAQzkD,GAEL,CAAE8jC,MAAM,IAEnBa,OAAM,KACF6gB,EAAU7gB,SACG,MAAT8f,IACAA,IACAA,OAAQzkD,GAEL,CAAE8jC,MAAM,IAEnBxiC,OACAyG,IAAIwf,IACAi+B,EAAUz9C,IAAIwf,GACD,MAATk9B,IACAA,EAAMl9B,GACNk9B,OAAQzkD,GAELqkD,GAEX,kBAAIW,GACA,OAAOQ,EAAUR,cACrB,EACAC,QAAUrnB,GACC4nB,EAAUP,QAAQrnB,IAG1BymB,CACX,CA/LWmB,EAdUhyC,IACb,MAAMrK,EAAOqK,EAAOpK,QACpB,GAAY,MAARD,EACA,MAAO,CAAE26B,MAAM,GAEnB,GAAkB,MAAd36B,EAAKmf,MACL,MAAMnf,EAAKmf,MAEf,MAAO,CACHwb,MAAoB,IAAd36B,EAAK26B,KAEXhkC,MAAOqJ,EAAKrJ,MACf,GAEqBib,EAC9B,CCxEO,MAAM,WAAmBzb,MAC5B2G,KACA4P,KACA,WAAAzF,CAAY9C,EAASuI,EAAMhU,GACvBqvC,MAAM5jC,GAAW,6BACjBxM,KAAKmF,KAAO,UACZnF,KAAKe,KAAOA,GAAQ,aACpBf,KAAK+U,KAAOA,GAAQ,WACxB,EAKGo4B,eAAewX,GAAW/B,EAASwB,EAAQtnB,GAC9C,GAAc,MAAVsnB,EACA,OAAOxB,EAEX,GAAIwB,EAAOQ,QAIP,OADAhC,EAAQtf,OAAM,SACP/G,QAAQC,OAAO,IAAI,GAAWM,GAAM+nB,aAAc/nB,GAAMgoB,UAAWhoB,GAAMioB,YAEpF,IAAI1kD,EAEJ,MAAMmnB,EAAQ,IAAI,GAAWsV,GAAM+nB,aAAc/nB,GAAMgoB,UAAWhoB,GAAMioB,WACxE,IACI,aAAaxoB,QAAQioB,KAAK,CACtB5B,EACA,IAAIrmB,SAAQ,CAACr4B,EAASs4B,KAClBn8B,EAAW,KACPm8B,EAAOhV,EAAM,EAEjB48B,EAAOG,iBAAiB,QAASlkD,EAAS,KAGtD,CACA,QACoB,MAAZA,GACA+jD,EAAOK,oBAAoB,QAASpkD,EAE5C,CACJ,CCdA,MAAM2kD,GACFC,SACAC,SACAxB,MACAyB,WACA39B,MACA,WAAAlY,GACItP,KAAK0jD,OAAQ,EACb1jD,KAAKilD,SAAW,KAChBjlD,KAAKklD,SAAW,IACpB,CACA,CAACzhB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKmlD,kBAECnlD,KAAKklD,SAAStC,QAED,MAAnB5iD,KAAKmlD,WACL,MAAM,IAAI3mD,MAAM,0DAEpB,MAAM2mD,EAAanlD,KAAKmlD,WAKxB,OAJAnlD,KAAKmlD,gBAAajmD,EAElBc,KAAKilD,SAAS/gD,UACdlE,KAAKilD,SAAW,KACTE,CACX,CACA,WAAM,CAAM1+B,GAaR,OAZAzmB,KAAK0jD,OAAQ,EACb1jD,KAAKwnB,MAAQf,EACF,MAAPA,IAGAzmB,KAAKklD,SAAStC,QAAQtf,OAAM,SAC5BtjC,KAAKklD,SAAS1oB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAarwC,EAElB9U,KAAKklD,SAAShhD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAKikD,MAAMx9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAK0jD,MACtB,MAAM1jD,KAAKwnB,OAAS,IAAIhpB,MAAM,4CAGlC,KAA0B,MAAnBwB,KAAKmlD,kBACFnlD,KAAKilD,SAASrC,QAEX,MAAT5jD,EACAgB,KAAKmlD,WAAa,CAAEniB,MAAM,EAAOhkC,UAGjCgB,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAa,CAAEniB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAKklD,SAAShhD,UACdlE,KAAKklD,SAAW,WAGVP,GAAW3kD,KAAKilD,SAASrC,QAAS3oC,GAASmqC,OAAQnqC,EAC7D,ECpCJ,SAbA,YAAkBmrC,GACd,MAAMC,EAAc,GACpB,IAAK,MAAMl/C,KAAUi/C,EA7BiB,MA8Bbj/C,EA9BZs9B,OAAOC,gBA+BZ2hB,EAAY7kD,KAAK2F,GAGzB,OAAIk/C,EAAY5jD,SAAW2jD,EAAQ3jD,OAZvC,UAA2B4jD,GACvB,IAAK,MAAMl/C,KAAUk/C,QACVl/C,CAEf,CAUem/C,CAAiBD,GApBhClY,gBAA6BiY,GACzB,MAAMzG,ED8DC,IAAIqG,IC7Ef7X,eAAgCiY,EAASzG,GACrC,UACUpiB,QAAQgpB,IAAIH,EAAQ9gD,KAAI6oC,MAAOhnC,IACjC,UAAW,MAAMq/C,KAAQr/C,QACfw4C,EAAOn+C,KAAKglD,EACtB,WAEE7G,EAAO13C,KACjB,CACA,MAAOwf,SACGk4B,EAAO13C,IAAIwf,GACZ6c,OAAM,QACf,CACJ,EAGImiB,CAAiBL,EAASzG,GACrBrb,OAAM,eACJqb,CACX,CAiBW+G,CAAaN,EACxB,EChFO,SAASO,GAAK9xB,KAAU+xB,GAC3B,GAAa,MAAT/xB,EACA,MAAM,IAAIr1B,MAAM,kBAGpB,GAAIqnD,GAAShyB,GAAQ,CACjB,MAAMiyB,EAASjyB,EACfA,EAAQ,IAAMiyB,EAAO3/C,MAEzB,MACK,GAAI4/C,GAAWlyB,IAAU,GAAgBA,GAAQ,CAClD,MAAM1tB,EAAS0tB,EACfA,EAAQ,IAAM1tB,CAClB,CACA,MAAM6/C,EAAM,CAACnyB,KAAU+xB,GAOvB,GANII,EAAIvkD,OAAS,GAETokD,GAASG,EAAIA,EAAIvkD,OAAS,MAC1BukD,EAAIA,EAAIvkD,OAAS,GAAKukD,EAAIA,EAAIvkD,OAAS,GAAGwkD,MAG9CD,EAAIvkD,OAAS,EAEb,IAAK,IAAIF,EAAI,EAAGA,EAAIykD,EAAIvkD,OAAS,EAAGF,IAC5BskD,GAASG,EAAIzkD,MACbykD,EAAIzkD,GAAK2kD,GAAiBF,EAAIzkD,KAI1C,OAAO4kD,MAAWH,EACtB,CACO,MAAMG,GAAU,IAAIH,KACvB,IAAIpgB,EACJ,KAAOogB,EAAIvkD,OAAS,GAChBmkC,EAAMogB,EAAI19C,OAAJ09C,CAAYpgB,GAEtB,OAAOA,CAAG,EAER,GAAmBrzB,GACiB,MAA/BA,IAAMkxB,OAAOC,eAElBqiB,GAAcxzC,GACiB,MAA1BA,IAAMkxB,OAAOyb,UAElB2G,GAAYtzC,GACH,MAAPA,GAGe,MAAZA,EAAI0zC,MAA8B,MAAd1zC,EAAIpM,OAE7B+/C,GAAoBJ,GACd3/C,IACJ,MAAMu4B,EAAIonB,EAAOG,KAAK9/C,GACtB,GAAe,MAAXu4B,GAAG6E,KAAc,CACjB,MAAM6iB,EAAS7C,GAAS,CACpBO,YAAY,IAOhB,IAAIuC,EALJ3nB,EAAE6E,MAAK,KACH6iB,EAAOn/C,KAAK,IACZwf,IACA2/B,EAAOn/C,IAAIwf,EAAI,IAGnB,MAAMtgB,EAAS2/C,EAAO3/C,OACtB,GAAI,GAAgBA,GAChBkgD,EAAalZ,wBACFhnC,EACPigD,EAAOn/C,KACX,MAEC,KAAI8+C,GAAW5/C,GAOhB,MAAM,IAAI3H,MAAM,kEANhB6nD,EAAa,kBACFlgD,EACPigD,EAAOn/C,KACX,CAIJ,CACA,OAAO,GAAMm/C,EAAQC,IACzB,CACA,OAAOP,EAAO3/C,MAAM,ECnFrB,SAASmgD,GAAqBC,GACjC,OAAOA,EACF15C,QAAQ1F,GAAmB,SAAbA,EAAEipB,SAChBhiB,MAAK,CAACi7B,EAAMj0B,IAAUA,EAAMoxC,SAASh2B,KAAO6Y,EAAKmd,SAASh2B,OAC1Di2B,GAAG,EACZ,CCHA,MAAMC,GAAkB,WACjB,MAAMC,GACTC,WACAC,eACAtC,iBACAn5C,IACA07C,gBAAkB,IAAIxL,IACtByL,WAAa,IAAIlZ,IACjB,WAAAv+B,CAAYs3C,EAAYC,EAAgBtC,GACpCvkD,KAAK4mD,WAAaA,EAClB5mD,KAAK6mD,eAAiBA,EACtB7mD,KAAKukD,iBAAmBA,EACxBvkD,KAAKoL,IAAM,IAAIiyC,GAAO,kBAAkBuJ,KACxC5mD,KAAKukD,iBAAiB,cAAevkD,KAAKgnD,2BAC9C,CACA,eAAMC,CAAUC,GACZ,MAAMC,EAAYD,EAAO7gD,WACnB+gD,EAAkBpnD,KAAK+mD,WAAW3nD,IAAI+nD,GACxCC,IACApnD,KAAK+mD,WAAWM,OAAOF,SACjBC,GAEV,IAAIhB,EAASpmD,KAAKsnD,sBAAsBJ,GACxC,OAAId,GACApmD,KAAKoL,IAAIopC,KAAK,gCAAgC2S,gBAAwBnnD,KAAK4mD,cAC3E5mD,KAAKunD,WAAWJ,EAAWf,GACpBA,IAEXA,QAAepmD,KAAKwnD,aAAaN,GACjClnD,KAAKunD,WAAWJ,EAAWf,GACpBA,EACX,CACA,kBAAMoB,CAAaN,EAAQrqB,EAAU,GACjC,MACM4qB,EAAanB,GADCtmD,KAAK6mD,eAAeK,IAExC,IAAKO,EACD,MAAM,IAAIjpD,MAAM,iDAAiD0oD,EAAO7gD,yBAAyBrG,KAAK4mD,cAE1G,IAAIc,EACAtB,EACJ,IAAK,IAAI7kD,EAAI,EAAGA,EAAIs7B,EAAU,EAAGt7B,IAC7B,IACIvB,KAAKoL,IAAIopC,KAAK,4CAA4C0S,EAAO7gD,yBAAyBrG,KAAK4mD,cAC/FR,QAAeqB,EAAWE,UAAU3nD,KAAK4mD,YACzC5mD,KAAKoL,IAAIopC,KAAK,6BAA6B0S,EAAO7gD,yBAAyBrG,KAAK4mD,cAChF,KACJ,CACA,MAAOp/B,GACHkgC,EAAYlgC,CAChB,CAEJ,IAAK4+B,EACD,MAAM,IAAI5nD,MAAM,qCAAqC0oD,EAAO7gD,iBAAmBqhD,GAEnF,OAAOtB,CACX,CACA,0BAAMwB,CAAqBC,GACvB,MAAMX,EAASW,EAAKn3C,GAAGrK,WACvB,GAAIrG,KAAK8mD,gBAAgB7nD,IAAIioD,GACzBlnD,KAAKoL,IAAIopC,KAAK,wDAAwD0S,gBAAqBlnD,KAAK4mD,mBAGpG,IACI5mD,KAAK8mD,gBAAgB9pC,IAAIkqC,SACnBlnD,KAAKwnD,aAAaK,EAAKn3C,GACjC,CACA,MAAO8W,GACHxnB,KAAKoL,IAAIoc,MAAM,kCAAmCA,EACtD,CACA,QACIxnB,KAAK8mD,gBAAgBO,OAAOH,EAChC,CAEJ,CACAF,2BAA8B1mD,IAC1B,MAAM,KAAEunD,GAASvnD,EAAIwnD,OAChBD,EAAKE,UAAU/8B,SAAShrB,KAAK4mD,cAGnB5mD,KAAKsnD,sBAAsBO,EAAKn3C,KAI/C1Q,KAAKgoD,kBAAkBH,GAAK,EAEhC,iBAAAG,CAAkBH,GACd7nD,KAAKoL,IAAIopC,KAAK,8CAA8CqT,EAAKn3C,GAAGrK,yBAAyBrG,KAAK4mD,cAE9F5mD,KAAK+mD,WAAW9nD,IAAI4oD,EAAKn3C,GAAGrK,aAC5BrG,KAAK+mD,WAAWM,OAAOQ,EAAKn3C,GAAGrK,YAEnCrG,KAAK+mD,WAAWznD,IAAIuoD,EAAKn3C,GAAGrK,WAAYrG,KAAK4nD,qBAAqBC,GACtE,CACA,qBAAAP,CAAsBJ,GAClB,MACMO,EAAanB,GADCtmD,KAAK6mD,eAAeK,IAExC,IAAKO,EACD,OAEJ,MAAMrB,EAASqB,EAAWQ,QAAQ3uB,MAAMv2B,GAAMA,EAAEmlD,WAAaloD,KAAK4mD,aAClE,OAAKR,EAGoB,CAAC,OAAQ,SAAU,WAAWp7B,SAASo7B,EAAO+B,aAAe,KAC9DnoD,KAAKooD,eAAehC,QAA5C,EAGOA,OAPP,CAQJ,CACA,UAAAmB,CAAWL,EAAQd,GACfpmD,KAAKoL,IAAIopC,KAAK,6BAA6B0S,eAAoBd,EAAO11C,MACtE01C,EAAOiC,SAAS3B,KAAmB,CACvC,CACA,cAAA0B,CAAehC,GACX,QAASA,EAAOiC,SAAS3B,GAC7B,EChHG,MAAM4B,GACT1B,WACA2B,WACA7M,aACA8M,uBACAC,0BACAC,cACA,WAAAp5C,CAAYs3C,EAAY2B,EAAY7M,GAChC17C,KAAK4mD,WAAaA,EAClB5mD,KAAKuoD,WAAaA,EAClBvoD,KAAK07C,aAAeA,EACpB17C,KAAKwoD,uBAAyBD,EAAWznD,OAAOyjD,iBAAiBnoB,KAAKmsB,EAAWznD,QACjFd,KAAKyoD,0BAA4BF,EAAWznD,OAAO2jD,oBAAoBroB,KAAKmsB,EAAWznD,QACvFd,KAAK0oD,cAAgB,IAAI/B,GAAcC,EAAY2B,EAAWI,kBAAkB9B,eAAezqB,KAAKmsB,EAAWI,mBAAoB3oD,KAAKwoD,uBAC5I,CACA,eAAMvB,CAAUC,GACZ,OAAOlnD,KAAK0oD,cAAczB,UAAUC,EACxC,ECtBJ,MACA,IACE0B,WAFmC,oBAAXxb,QAA0BA,OAAOwb,YAAcxb,OAAOwb,WAAWxsB,KAAKgR,SCGhG,IAAI0K,GACJ,MAAM+Q,GAAQ,IAAI54C,WAAW,IACd,SAAS64C,KAEtB,IAAKhR,KAEHA,GAAoC,oBAAX1K,QAA0BA,OAAO0K,iBAAmB1K,OAAO0K,gBAAgB1b,KAAKgR,SAEpG0K,IACH,MAAM,IAAIt5C,MAAM,4GAIpB,OAAOs5C,GAAgB+Q,GACzB,CCXA,MAAME,GAAY,GAElB,IAAK,IAAIxnD,EAAI,EAAGA,EAAI,MAAOA,EACzBwnD,GAAUvoD,MAAMe,EAAI,KAAO8E,SAAS,IAAInF,MAAM,ICmBhD,SAxBA,SAAY+Y,EAASzK,EAAKtM,GACxB,GAAI,GAAO0lD,aAAep5C,IAAQyK,EAChC,OAAO,GAAO2uC,aAIhB,MAAMI,GADN/uC,EAAUA,GAAW,CAAC,GACDmjB,SAAWnjB,EAAQ6uC,KAAOA,MAK/C,GAHAE,EAAK,GAAe,GAAVA,EAAK,GAAY,GAC3BA,EAAK,GAAe,GAAVA,EAAK,GAAY,IAEvBx5C,EAAK,CACPtM,EAASA,GAAU,EAEnB,IAAK,IAAI3B,EAAI,EAAGA,EAAI,KAAMA,EACxBiO,EAAItM,EAAS3B,GAAKynD,EAAKznD,GAGzB,OAAOiO,CACT,CAEA,ODbK,SAAyBwnC,EAAK9zC,EAAS,GAG5C,OAAO6lD,GAAU/R,EAAI9zC,EAAS,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM6lD,GAAU/R,EAAI9zC,EAAS,IAAM,IAAM6lD,GAAU/R,EAAI9zC,EAAS,KAAO6lD,GAAU/R,EAAI9zC,EAAS,KAAO6lD,GAAU/R,EAAI9zC,EAAS,KAAO6lD,GAAU/R,EAAI9zC,EAAS,KAAO6lD,GAAU/R,EAAI9zC,EAAS,KAAO6lD,GAAU/R,EAAI9zC,EAAS,IAChf,CCSS+lD,CAAgBD,EACzB,ECpBO,MAAME,GACTpL,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,aAAO9hC,CAAOlN,GACV,MAAM82B,EAAM,GAAkB5pB,OAAOlN,GACrC,OAAO,IAAIo6C,GAActjB,EAC7B,CACA,MAAA1wB,GACI,OAAO,GAAkBA,OAAOlV,KAAK89C,MACzC,CACA,eAAIxJ,GACA,OAAOt0C,KAAK89C,MAAMxJ,WACtB,CAKA,eAAIN,GACA,OAAOh0C,KAAK89C,MAAM9J,WACtB,EAEG,MAAMmV,GACTrL,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,6BAAOsL,CAAuBpV,EAAaC,GACvC,OAAO,IAAIkV,GAAmB,CAC1BvV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoBwV,UACtErV,cACAC,iBAER,CACA,+BAAOqV,CAAyBtV,EAAaC,GACzC,OAAO,IAAIkV,GAAmB,CAC1BvV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoB0V,YACtEvV,cACAC,iBAER,CACA,kCAAOuV,CAA4BxV,GAC/B,OAAO,IAAImV,GAAmB,CAC1BvV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoB4V,gBACtEzV,cACAC,cAAe,IAEvB,CACA,kCAAOyV,GACH,OAAO,IAAIP,GAAmB,CAC1BvV,UAAW,KACXG,oBAAqB,GAA6BF,oBAAoBK,gBACtEF,YAAa,GACbC,cAAe,IAEvB,CACA,aAAOj4B,CAAOlN,GACV,MAAM82B,EAAM,GAA6B5pB,OAAOlN,GAChD,OAAO,IAAIq6C,GAAmBvjB,EAClC,CACA,MAAA1wB,GACI,OAAO,GAA6BA,OAAOlV,KAAK89C,MACpD,CACA,uBAAI/J,GACA,OAAO/zC,KAAK89C,MAAM/J,mBACtB,CACA,aAAIH,GACA,OAAO5zC,KAAK89C,MAAMlK,SACtB,CACA,eAAII,GACA,OAAOh0C,KAAK89C,MAAM9J,WACtB,CACA,iBAAIC,GACA,OAAOj0C,KAAK89C,MAAM7J,aACtB,EAEG,MAAME,GACT2J,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,aAAO9hC,CAAOlN,GACV,MAAM82B,EAAM,GAA8B5pB,OAAOlN,GACjD,OAAO,IAAIqlC,GAAwBvO,EACvC,CACA,MAAA1wB,GACI,OAAO,GAA8BA,OAAOlV,KAAK89C,MACrD,CACA,cAAI1J,GACA,OAAOp0C,KAAK89C,MAAM1J,UACtB,CACA,cAAIC,GACA,OAAOr0C,KAAK89C,MAAMzJ,UACtB,CACA,aAAIT,GACA,OAAO5zC,KAAK89C,MAAMlK,SACtB,ECnGJ,MAAM,GAAM,IAAIyJ,GAAO,aACVsM,GACE,yCADFA,GAEH,oCAEH,MAAMC,WAAmBtB,GAC5B5M,aACAmO,6BACA,WAAAv6C,CAAYw6C,EAAuBpO,EAAcqO,GAC7C3Z,MAAMuZ,GAAwBI,EAAOxB,WAAY7M,GACjD17C,KAAK07C,aAAeA,EAEpB,MAAMsO,EAAcJ,GAAWE,sBAC/BF,GAAWE,sBAAyBE,EAE9B7c,MAAO6G,EAAaxnC,EAAS26C,KAC3B,UACU6C,EAAYhW,EAAaxnC,EAAS26C,EAC5C,CACA,MAAOljC,GACH,GAAIuD,MAAM,uDAAwDvD,EACtE,CACA,UACU6lC,EAAsB9V,EAAaxnC,EAAS26C,EACtD,CACA,MAAOljC,GACH,GAAIuD,MAAM,sDAAuDvD,EACrE,CACM,EAdR6lC,EAgBNC,EACKE,OAAON,GAAmB3pD,KAAKkqD,UAAU9tB,KAAKp8B,MAAO,CACtDmqD,kBAAmB,MAElB7mB,OAAOrf,IACR,GAAIuD,MAAM,sBAAuBmiC,GAAmB1lC,EAAE,GAE9D,CACA,eAAMqvB,CAAUU,EAAakT,EAAQjT,GACjC,MAAMmS,QAAepmD,KAAKinD,UAAUC,GAC9BltB,EAAUmvB,GAAmBC,uBAAuBpV,EAAaC,GACvE,IAAIrO,EACJ,IACIA,QAAY+f,GAAK,CAAC3rB,EAAQ9kB,UAAW,GAAWkxC,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,IACnG,CACA,MAAOqhB,GAEH,OADA,GAAIA,MAAM,mCAAoCA,GACvC,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc2lC,aACrBpD,OAAQA,GAGpB,CACA,MAAM,WAAE9S,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwBn4B,OAAO4pB,EAAI,GAAG1kC,SACpF,OAAIkzC,EAAa,KAAOA,GAAc,KAClC,GAAI5sB,MAAM,4BAA4BosB,6BAAqCQ,MAAeC,KACnF,CACHgW,QAAS,CACL7iC,MAAO7C,GAAc4lC,qBACrBrD,OAAQA,GAEZkD,QAAS,OAGV,CACHC,QAAS,KACTD,QAASlD,EAEjB,CACA,iBAAMsD,CAAYxW,EAAakT,EAAQjT,GACnC,IAAImS,EACJ,IACIA,QAAepmD,KAAKinD,UAAUC,EAClC,CACA,MAAO1/B,GAEH,OADA,GAAIA,MAAM,yCAAyC0/B,EAAO7gD,aAAcmhB,GACjE,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc8lC,oBACrBvD,OAAQA,GAGpB,CACA,MAAMwD,EAAqBvB,GAAmBG,yBAAyBtV,EAAaC,GACpF,UACU0R,GAAK,CAAC+E,EAAmBx1C,UAAW,GAAWkxC,EAAOH,KAChE,CACA,MAAOz+B,GAEH,OADA,GAAIA,MAAM,qCAAsCA,GACzC,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc2lC,aACrBpD,OAAQA,GAGpB,CACA,MAAO,CACHkD,QAASlD,EACTmD,QAAS,KAEjB,CACA,oBAAMM,CAAe3W,EAAakT,GAC9B,MAAMd,QAAepmD,KAAKinD,UAAUC,GAC9BltB,EAAUmvB,GAAmBK,4BAA4BxV,GACzDpO,QAAY+f,GAAK,CAAC3rB,EAAQ9kB,UAAW,GAAWkxC,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,KACrG,IAAKy/B,IAAQA,EAAInkC,OACb,MAAO,CACH4oD,QAAS,CACL7iC,MAAO7C,GAAcimC,YACrB1D,OAAQA,GAEZkD,QAAS,MAGjB,MAAM,WAAEhW,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwBn4B,OAAO4pB,EAAI,GAAG1kC,SACpF,OAAIkzC,EAAa,KAAOA,GAAc,KAClC,GAAI5sB,MAAM,kCAAkCosB,6BAAqCQ,MAAeC,KACzF,CACHgW,QAAS,CACL7iC,MAAO7C,GAAc4lC,qBACrBrD,OAAQA,GAEZkD,QAAS,OAGV,CACHC,QAAS,KACTD,QAASlD,EAEjB,CACA,UAAM2D,CAAK3D,GACP,IAAId,EACJ,IACIA,QAAepmD,KAAKinD,UAAUC,EAClC,CACA,MAAO1/B,GAEH,OADA,GAAIA,MAAM,yCAAyC0/B,EAAO7gD,aAAcmhB,GACjE,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc8lC,oBACrBvD,OAAQA,GAGpB,CACA,MAAMltB,EAAUmvB,GAAmBO,8BACnC,IAAI9jB,EACJ,IACIA,QAAY+f,GAAK,CAAC3rB,EAAQ9kB,UAAW,GAAWkxC,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,IACnG,CACA,MAAOqhB,GAEH,OADA,GAAIA,MAAM,8BAA+BA,GAClC,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc2lC,aACrBpD,OAAQA,GAGpB,CACA,IAAKthB,IAAQA,EAAInkC,OACb,MAAO,CACH2oD,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAcimC,YACrB1D,OAAQA,IAIpB,MAAM,WAAE9S,EAAU,UAAER,EAAS,WAAES,GAAeF,GAAwBn4B,OAAO4pB,EAAI,GAAG1kC,SACpF,OAAIkzC,EAAa,KAAOA,GAAc,KAClC,GAAI5sB,MAAM,uBAAuBosB,6BAAqCQ,MAAeC,KAC9E,CACH+V,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc4lC,qBACrBrD,OAAQA,KAIb,CACHkD,QAASlD,EACTmD,QAAS,KAEjB,CACA,SAAAH,CAAUY,GACN,MAAM,WAAErD,EAAU,OAAErB,GAAW0E,GACzB,WAAEC,GAAetD,EACvB,GAAIjT,KAAK,yBAAyBuW,EAAW1kD,cAC7C,IACIs/C,GAAKS,EAAQ,IAAWjZ,MAAOhnC,IAC3B,UAAW,MAAM2I,KAAS3I,EAAQ,CAC9B,MAAMkqB,EAAW64B,GAAcltC,OAAOlN,EAAM5N,UACtC,YAAE8yC,EAAW,YAAEM,GAAgBjkB,EACrC,IAAKikB,EAED,YADA,GAAI9sB,MAAM,0BAGd,IAAKwsB,EAED,YADA,GAAIxsB,MAAM,gDAGRoiC,GAAWE,wBAAwB9V,EAAaM,EAAamT,EAAWsD,WAAW1kD,YAC7F,KACDk9B,MAAK,KACJ,GAAIiR,KAAK,yBAAyB,IACnCrH,MAAOlpB,IACN,GAAIuD,MAAM,qCAAqCigC,EAAWsD,WAAW1kD,wBAAwB+/C,EAAO11C,kBAAkB01C,EAAO8B,aAAcjkC,EAAE,GAErJ,CACA,MAAOA,GACH,GAAIuD,MAAM,yBAA0BvD,EACxC,CACJ,EC9NG,MAAMwwB,GACTqJ,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,oBAAOkN,CAAcx+C,EAASwnC,GAC1B,OAAO,IAAIS,GAAQ,CACfb,UAAW,KACX5Z,QAAS,CACLxtB,QAASA,EACTwnC,YAAaA,GAEjB3jB,cAAUnxB,GAElB,CACA,aAAO8c,CAAOlN,GACV,MAAM82B,EAAM,GAAc5pB,OAAOlN,GACjC,OAAO,IAAI2lC,GAAQ7O,EACvB,CACA,MAAA1wB,GACI,OAAO,GAAcA,OAAOlV,KAAK89C,MACrC,CACA,SAAIrI,GACA,OAAOz1C,KAAK89C,MAAM9jB,OACtB,CACA,YAAI3J,GACA,OAAOrwB,KAAK89C,MAAMztB,QACtB,EC1BJ,MCQM,GAAM,IAAIgtB,GAAO,cACV4N,GAAiB,kCAKvB,MAAMC,WAAsB5C,GAC/B5M,aACA,WAAApsC,CAAYosC,EAAcqO,GACtB3Z,MAAM6a,GAAgBlB,EAAOxB,WAAY7M,GACzC17C,KAAK07C,aAAeA,CACxB,CACA,wBAAMyP,CAAmBx6B,EAASnkB,GAC9B,IACI,IAAKA,EAAQumC,SAAsC,IAA3BvmC,EAAQumC,QAAQtxC,OAEpC,OADA,GAAI+lB,MAAM,oDACH,CAAEiuB,MAAO,KAAMjuB,MAAO7C,GAAcymC,eAE/C,UCpBLje,eAAqCxc,EAASnkB,GACjD,MAAMgD,QAAYmhB,EAAQstB,OAAOzxC,GACjC,QAAKgD,GAIyB,CAACA,GAAQA,EAAI/N,OAfpC,SACY,EAYZ4pD,CAAmB77C,EAC9B,CDewB87C,CAAsB36B,EAASnkB,GAEvC,OADA,GAAIgb,MAAM,8DACH,CAAEiuB,MAAO,KAAMjuB,MAAO7C,GAAc4mC,cAE/C,MAAMpN,QAAqBxtB,EAAQutB,WAAW1xC,GAC9C,OAAK2xC,EAQE,CAAE1I,MADKhB,GAAQuW,cAAc7M,EAAcxtB,EAAQqjB,aAC1CxsB,MAAO,OAPnB,GAAIA,MAAM,mDACH,CACHiuB,MAAO,KACPjuB,MAAO7C,GAAc6mC,eAKjC,CACA,MAAOhkC,GAEH,OADA,GAAIA,MAAM,iCAAkCA,GACrC,CACHiuB,MAAO,KACPjuB,MAAO7C,GAAc2lC,aAE7B,CACJ,CACA,UAAM75B,CAAKE,EAASnkB,EAAS06C,GACzB,MAAM,MAAEzR,EAAOjuB,MAAOikC,SAA2BzrD,KAAKmrD,mBAAmBx6B,EAASnkB,GAClF,GAAIi/C,IAAqBhW,EACrB,MAAO,CACH2U,QAAS,KACTC,QAAS,CACL7iC,MAAOikC,EACPvE,WAIZ,IAAId,EAcAxgB,EAbJ,IACIwgB,QAAepmD,KAAKinD,UAAUC,EAClC,CACA,MAAO1/B,GAEH,OADA,GAAIA,MAAM,uBAAwBA,GAC3B,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc8lC,oBACrBvD,OAAQA,GAGpB,CAEA,IACIthB,QAAY+f,GAAK,CAAClQ,EAAMvgC,UAAW,GAAWkxC,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,IACjG,CACA,MAAOsgB,GAGH,OADA,GAAIe,MAAM,yCAA0Cf,GAC7C,CACH2jC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc+mC,eACrBxE,OAAQA,GAGpB,CACA,MAAMp4C,EAAQ,IAAIkwC,GAIlB,IAAI3uB,EAHJuV,EAAIz4B,SAASkQ,IACTvO,EAAMqwC,OAAO9hC,EAAM,IAGvB,IACIgT,EAAWokB,GAAQz4B,OAAOlN,GAAOuhB,QACrC,CACA,MAAO5J,GAEH,OADA,GAAIe,MAAM,8BAA+Bf,GAClC,CACH2jC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAcgnC,cACrBzE,OAAQA,GAGpB,CACA,OAAK72B,GDrGsBmkB,EC+GJnkB,EAASmkB,QD3G5BA,EAAKxpB,SAVmB,iCAW5BwpB,EAAKxpB,SAVuB,0DAW5BwpB,EAAKxpB,SAPiB,2BCiHlB,GAAIxD,MAAM,qCACH,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAcinC,qBACrB1E,OAAQA,KAIf72B,EAASkkB,UAUP,CAAE6V,QAASlD,EAAQmD,QAAS,OAT/B,GAAI7iC,MAAM,qCAAsC6I,EAASmkB,MAClD,CACH4V,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc4lC,qBACrBrD,OAAQA,MAzBhB,GAAI1/B,MAAM,6CACH,CACH4iC,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAcimC,YACrB1D,OAAQA,KD3GM,IAAC1S,CCoI/B,EE7IJ,MAAMqX,GAAe,CACjB9Y,QAAS,IAAI9iC,WACbmiC,aAAc,GACd7E,aAASruC,EACT8zC,eAAW9zC,EACX+zC,UAAM/zC,EACNg0C,oBAAgBh0C,EAChBi0C,eAAWj0C,GCFT4sD,GAAc,IACb,MAAMnX,GACTmJ,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,aAAOl/C,CAAOy9B,GACV,MAAMrC,EAAU,IAAI2a,GAAkB,IAC/BtY,EACHuX,UAAW,KACXiB,UAAWxY,EAAOwY,UACZ5O,OAAO5J,EAAOwY,UAAUluB,UAAYmlC,SACpC5sD,EACN41C,QAASzY,EAAOyY,QACV7O,OAAO5J,EAAOyY,QAAQnuB,UAAYmlC,SAClC5sD,EACN61C,cAAe1Y,EAAO0Y,eAAiB,GACvCG,gBAAiB7Y,EAAO6Y,gBAClBjP,OAAO5J,EAAO6Y,sBACdh2C,IAGV,GAAKm9B,EAAO2X,cAAgB3X,EAAO4X,gBAC7B5X,EAAO2X,aAAe3X,EAAO4X,cAC/B,MAAM,IAAIz1C,MAAM,2DAEpB,GAAI69B,EAAO0Y,gBACN1Y,EAAO2X,aACJ3X,EAAO4X,eACP5X,EAAOwY,WACPxY,EAAOyY,SACX,MAAM,IAAIt2C,MAAM,sEAEpB,OAAOw7B,CACX,CACA,aAAOhe,CAAOlN,GACV,MAAM82B,EAAM,GAAwB5pB,OAAOlN,GAC3C,OAAO,IAAI6lC,GAAkB/O,EACjC,CACA,MAAA1wB,GACI,OAAO,GAAwBA,OAAOlV,KAAK89C,MAC/C,EAEG,MAAM3I,GACT2I,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,aAAO9hC,CAAOlN,GACV,MAAM82B,EAAM,GAAyB5pB,OAAOlN,GAC5C,OAAO,IAAIqmC,GAAmBvP,EAClC,CACA,MAAA1wB,GACI,OAAO,GAAyBA,OAAOlV,KAAK89C,MAChD,CACA,cAAI1J,GACA,OAAOp0C,KAAK89C,MAAM1J,UACtB,CACA,cAAIC,GACA,OAAOr0C,KAAK89C,MAAMzJ,UACtB,CACA,YAAIX,GACA,OAAO1zC,KAAK89C,MAAMpK,QACtB,CACA,oBAAIsB,GACA,OAAOh1C,KAAK89C,MAAM9I,gBACtB,EC/DJ,MAAM,GAAM,IAAIqI,GAAO,SACV0O,GAAa,8BACnB,MAAMC,WAAkB1D,GAC3B5M,aACA,WAAApsC,CAAYosC,EAAcqO,GACtB3Z,MAAM2b,GAAYhC,EAAOxB,WAAY7M,GACrC17C,KAAK07C,aAAeA,CACxB,CACA,kBAAOuQ,CAAaC,EAAW9iB,EAAU8d,GACrC,GAAIgF,EAAUjY,cAAc5tC,aACxB1E,MAAM4c,KAAK6qB,EAASlkC,QAAQmB,WAC5B,MAAM,IAAI7H,MAAM,wEAEpB,IAAI2tD,EAAgBD,EAAUlX,iBAC9B,OAAa,CACT,MAAMoX,EAAoBzX,GAAkB/1C,OAAO,IAC5CstD,EACHlX,iBAAkBmX,IAEtB,IAAI/F,EACJ,IACIA,QAAepmD,KAAKinD,UAAUC,EAClC,CACA,MAAOjjC,GACH,GAAIuD,MAAM,uBAAwBvD,GAClC,KACJ,CACA,MAAM2hB,QAAY+f,GAAK,CAACyG,EAAkBl3C,UAAW,GAAWkxC,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,KACzG2I,EAAQ,IAAIkwC,GAClBpZ,EAAIz4B,SAASkQ,IACTvO,EAAMqwC,OAAO9hC,EAAM,IAEvB,MAAMgvC,EAAqBlX,GAAmBn5B,OAAOlN,GACrD,IAAKu9C,EAAmBjY,YACpBiY,EAAmBjY,YAAc,IAAK,CACtC,MAAMyQ,EAAe,wCAAwCwH,EAAmBjY,4BAA4BiY,EAAmBhY,aAE/H,MADA,GAAI7sB,MAAMq9B,GACJ,IAAIrmD,MAAMqmD,EACpB,CACA,IAAKwH,EAAmB3Y,WAAa2Y,EAAmB3Y,SAASjyC,OAAQ,CACrE,GAAIyL,KAAK,yDACT,KACJ,CACA,GAAIsnC,KAAK,GAAG6X,EAAmB3Y,SAASjyC,wCACxC,MAAM6qD,EAAkBD,EAAmB3Y,SAASpvC,KAAKioD,IACrD,IAAKA,EAAS//C,QACV,OAAO+vB,QAAQr4B,aAAQhF,GAE3B,MAAMkzC,EAAema,EAAS//C,QAAQ4lC,aACtC,GAAIA,EAAc,CACd,MAAMxhB,EAAUwY,EAAShqC,IAAIgzC,GAC7B,GAAIxhB,EACA,OAAOA,EAAQ2tB,aAAagO,EAASvY,aAAe,IFnD7CwY,EEmDgED,EAAS//C,QFlD7F,IAAKq/C,MAAiBW,IEoDjB,CFrDT,IAAwBA,EEsDf,OAAOjwB,QAAQr4B,aAAQhF,EAAU,IAWrC,SATMotD,EAEFH,EADAD,EAAUjX,kBAENoX,EAAmB3Y,SAAS2Y,EAAmB3Y,SAASjyC,OAAS,GAC5DizC,YAGO2X,EAAmB3Y,SAAS,GAAGgB,YAE/C2X,EAAmB3Y,SAASjyC,ODtEf,KCuEb4qD,EAAmB3Y,SAASjyC,QACvByqD,EAAUhX,iBDzEE,IC0EjB,KAER,CACJ,EC3EG,MAAMuX,WAA0BC,YACnC,GAAa,IAAI7e,IACjB,WAAAv+B,GACI8gC,OAIJ,CACA,aAAAxuC,CAAcuD,GACV,MAAM9D,EAAYrB,MAAK,EAAWZ,IAAI+F,GACtC,OAAiB,MAAb9D,EACO,EAEJA,EAAUI,MACrB,CACA,gBAAA8iD,CAAiBp/C,EAAM9E,EAAU4Z,GAC7Bm2B,MAAMmU,iBAAiBp/C,EAAM9E,EAAU4Z,GACvC,IAAI4lC,EAAO7/C,MAAK,EAAWZ,IAAI+F,GACnB,MAAR06C,IACAA,EAAO,GACP7/C,MAAK,EAAWV,IAAI6F,EAAM06C,IAE9BA,EAAKr/C,KAAK,CACNovB,SAAUvvB,EACVN,OAAmB,IAAZka,IAAgC,IAAZA,GAAqBA,GAASla,QAAS,GAE1E,CACA,mBAAA0kD,CAAoBt/C,EAAM9E,EAAU4Z,GAChCm2B,MAAMqU,oBAAoBt/C,EAAKkB,WAAYhG,GAAY,KAAM4Z,GAC7D,IAAI4lC,EAAO7/C,MAAK,EAAWZ,IAAI+F,GACnB,MAAR06C,IAGJA,EAAOA,EAAKhzC,QAAO,EAAG+iB,cAAeA,IAAavvB,IAClDL,MAAK,EAAWV,IAAI6F,EAAM06C,GAC9B,CACA,aAAA8M,CAAcxsD,GACV,MAAM2U,EAASs7B,MAAMuc,cAAcxsD,GACnC,IAAI0/C,EAAO7/C,MAAK,EAAWZ,IAAIe,EAAMgF,MACrC,OAAY,MAAR06C,IAGJA,EAAOA,EAAKhzC,QAAO,EAAG9M,WAAYA,IAClCC,MAAK,EAAWV,IAAIa,EAAMgF,KAAM06C,IAHrB/qC,CAKf,CACA,iBAAA83C,CAAkBznD,EAAM2iD,EAAS,CAAC,GAC9B,OAAO9nD,KAAK2sD,cAAc,IAAIE,YAAY1nD,EAAM2iD,GACpD,ECjDG,MAAMgF,GAAerpB,OAAOmL,IAAI,mBAIhC,SAASme,GAASxe,GACrB,OAAOzhC,QAAQyhC,IAAQue,IAC3B,CCRA,MAEME,GAAS,ICHR,MACHniD,MAAQ,EACRkrB,MAAQ,GACR,IAAIA,GAGA,OAFA/1B,KAAK6K,MAAQ,EACb7K,KAAK+1B,MAAQA,EACN/1B,IACX,CAEA,cAAAitD,CAAeptD,GACX,MAAMgL,EAAQ7K,KAAK6K,MACbiK,EAASjV,IAIf,YAHeX,IAAX4V,IACA9U,KAAK6K,MAAQA,GAEViK,CACX,CAEA,SAAAo4C,CAAUrtD,GACN,MAAMiV,EAASjV,IACf,GAAIG,KAAK6K,QAAU7K,KAAK+1B,MAAMt0B,OAG9B,OAAOqT,CACX,CAEA,QAAAq4C,GACI,KAAIntD,KAAK6K,OAAS7K,KAAK+1B,MAAMt0B,QAG7B,OAAOzB,KAAK+1B,MAAM/1B,KAAK6K,MAC3B,CAEA,QAAAuiD,GACI,KAAIptD,KAAK6K,OAAS7K,KAAK+1B,MAAMt0B,QAG7B,OAAOzB,KAAK+1B,MAAM/1B,KAAK6K,QAC3B,CAEA,aAAAwiD,CAAcnjC,GACV,OAAOlqB,KAAKitD,gBAAe,KACvB,MAAMtiB,EAAO3qC,KAAKotD,WAClB,GAAIziB,IAASzgB,EAGb,OAAOygB,CAAI,GAEnB,CAOA,aAAA2iB,CAAcC,EAAK1iD,EAAO2iD,GACtB,OAAOxtD,KAAKitD,gBAAe,KACvB,KAAIpiD,EAAQ,QACwB3L,IAA5Bc,KAAKqtD,cAAcE,IAI3B,OAAOC,GAAO,GAEtB,CAMA,UAAAC,CAAWC,EAAOC,EAAWC,EAAiBC,GAC1C,OAAO7tD,KAAKitD,gBAAe,KACvB,IAAIn4C,EAAS,EACTg5C,EAAa,EACjB,MAAMC,EAAc/tD,KAAKmtD,WACzB,QAAoBjuD,IAAhB6uD,EACA,OAEJ,MAAMC,EAAiC,MAAhBD,EACjBE,EAAW,IAAM,EAAIJ,GAAY,EAEvC,OAAa,CACT,MAAMK,EAAQluD,KAAKitD,gBAAe,KAC9B,MAAMtiB,EAAO3qC,KAAKotD,WAClB,QAAaluD,IAATyrC,EACA,OAEJ,MAAM6B,EAAMjiC,OAAOiU,SAASmsB,EAAM+iB,GAClC,OAAInjD,OAAOu2B,MAAM0L,QAAjB,EAGOA,CAAG,IAEd,QAActtC,IAAVgvD,EACA,MAIJ,GAFAp5C,GAAU44C,EACV54C,GAAUo5C,EACNp5C,EAASm5C,EACT,OAGJ,GADAH,GAAc,OACI5uD,IAAdyuD,GACIG,EAAaH,EACb,MAGZ,CACA,OAAmB,IAAfG,IAGMF,GAAmBI,GAAkBF,EAAa,OAFxD,EAMOh5C,CACX,GAER,CAEA,YAAAq5C,GACI,OAAOnuD,KAAKitD,gBAAe,KACvB,MAAMpjB,EAAM,IAAI55B,WAAW,GAC3B,IAAK,IAAI1O,EAAI,EAAGA,EAAIsoC,EAAIpoC,OAAQF,IAAK,CACjC,MAAM6sD,EAAKpuD,KAAKstD,cAAc,IAAK/rD,GAAG,IAAMvB,KAAKytD,WAAW,GAAI,GAAG,EAAO,KAC1E,QAAWvuD,IAAPkvD,EACA,OAEJvkB,EAAItoC,GAAK6sD,CACb,CACA,OAAOvkB,CAAG,GAElB,CAEA,YAAAwkB,GAQI,MAAMC,EAAcC,IAChB,IAAK,IAAIhtD,EAAI,EAAGA,EAAIgtD,EAAO9sD,OAAS,EAAGF,IAAK,CACxC,MAAM6sD,EAAS,EAAJ7sD,EAEX,GAAIA,EAAIgtD,EAAO9sD,OAAS,EAAG,CACvB,MAAM+sD,EAAOxuD,KAAKstD,cAAc,IAAK/rD,GAAG,IAAMvB,KAAKmuD,iBACnD,QAAajvD,IAATsvD,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,MAAM9xC,EAAQtc,KAAKstD,cAAc,IAAK/rD,GAAG,IAAMvB,KAAKytD,WAAW,GAAI,GAAG,EAAM,KAC5E,QAAcvuD,IAAVod,EACA,MAAO,CAAC8xC,GAAI,GAEhBG,EAAOH,GAAM9xC,GAAS,EACtBiyC,EAAOH,EAAK,GAAa,IAAR9xC,CACrB,CACA,MAAO,CAACiyC,EAAO9sD,QAAQ,EAAM,EAEjC,OAAOzB,KAAKitD,gBAAe,KAEvB,MAAMxrC,EAAO,IAAIxR,WAAW,KACrBw+C,EAAUC,GAAWJ,EAAW7sC,GACvC,GAAiB,KAAbgtC,EACA,OAAOhtC,EAGX,GAAIitC,EACA,OAIJ,QAAgCxvD,IAA5Bc,KAAKqtD,cAAc,KACnB,OAEJ,QAAgCnuD,IAA5Bc,KAAKqtD,cAAc,KACnB,OAIJ,MAAM3rC,EAAO,IAAIzR,WAAW,IACtB0+C,EAAQ,IAAMF,EAAW,IACxBG,GAAYN,EAAW5sC,EAAKO,SAAS,EAAG0sC,IAG/C,OADAltC,EAAKniB,IAAIoiB,EAAKO,SAAS,EAAG2sC,GAAW,GAAKA,GACnCntC,CAAI,GAEnB,CAEA,UAAAotC,GACI,OAAO7uD,KAAKmuD,gBAAkBnuD,KAAKquD,cACvC,GDhMG,SAASS,GAAU/4B,GACtB,KAAIA,EAAMt0B,OAJU,IAOpB,OAAOurD,GAAO+B,IAAIh5B,GAAOm3B,WAAU,IAAMF,GAAOmB,gBACpD,CAaO,SAASa,GAAUj5B,GAKtB,GAHIA,EAAM/K,SAAS,OACf+K,EAAQA,EAAMruB,MAAM,KAAK,MAEzBquB,EAAMt0B,OA3BU,IA8BpB,OAAOurD,GAAO+B,IAAIh5B,GAAOm3B,WAAU,IAAMF,GAAOqB,gBACpD,CAEO,SAASY,GAAQl5B,EAAOm5B,GAAgB,GAK3C,GAHIn5B,EAAM/K,SAAS,OACf+K,EAAQA,EAAMruB,MAAM,KAAK,IAEzBquB,EAAMt0B,OAtCU,GAuChB,OAEJ,MAAM0tD,EAAOnC,GAAO+B,IAAIh5B,GAAOm3B,WAAU,IAAMF,GAAO6B,eACtD,OAAKM,EAGDD,GAAiC,IAAhBC,EAAK1tD,OACfwO,WAAWsO,KAAK,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAM,IAAM4wC,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,KAE/FA,OANP,CAOJ,CEjDO,MAGMC,IADe5wC,SAAS,SAAU,IACrB,IAAIvO,WAAW,CACrC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,IAAK,OAEhC,SAASo/C,GAAOl8B,EAAItU,GALJ,KAMfA,EAAKpd,QAPU,IAOY0xB,EAAG1xB,QCR/B,SAAekf,GAClB,IAAIpf,EAAI,EACR,IAAK,MAAM0iB,KAAKtD,EACZ,KAAIpf,EDK4D,GCLhE,CAEA,GAAIA,EDG+D,GCF/D,MACJ,GAAU,MAAN0iB,EACA,OAAO,EACX1iB,GALY,CAOhB,OAAO,CACX,CDJ4D+tD,CAAMzwC,KAC1DA,EAAOA,EAAK3d,MAAM,KARH,IAUf2d,EAAKpd,QATU,KAUf0xB,EAAG1xB,QCCJ,SAAmBkf,EAAGC,GACzB,IAAIrf,EAAI,EACR,IAAK,MAAM0iB,KAAKtD,EACZ,KAAIpf,EDHsB,GCG1B,CAEA,GAAIA,EDLyB,GCMzB,MACJ,GAAI0iB,IAAMrD,EAAErf,GACR,OAAO,EACXA,GALY,CAOhB,OAAO,CACX,CDZQ,CAAU4xB,EAAIi8B,MACdj8B,EAAKA,EAAGjyB,MAAM,KAElB,MAAMsS,EAAI2f,EAAG1xB,OACb,GAAI+R,GAAKqL,EAAKpd,OACV,MAAM,IAAIjD,MAAM,qBAEpB,MAAMqrC,EAAM,IAAI55B,WAAWuD,GAC3B,IAAK,IAAIjS,EAAI,EAAGA,EAAIiS,EAAGjS,IACnBsoC,EAAItoC,GAAK4xB,EAAG5xB,GAAKsd,EAAKtd,GAE1B,OAAOsoC,CACX,CECO,SAAS0lB,GAASC,EAAMv8C,GAC3B,GAAa,KAATA,GAAiC,MAATA,EACxB,MAAM,IAAIzU,MAAM,qBACpB,GAAIgxD,EAAO,GAAKA,EAAOv8C,EACnB,MAAM,IAAIzU,MAAM,qBACpB,MAAMgD,EAAIyR,EAAO,EACXmkB,EAAI,IAAInnB,WAAWzO,GACzB,IAAK,IAAID,EAAI,EAAGA,EAAIC,EAAGD,IACfiuD,GAAQ,GACRp4B,EAAE71B,GAAK,IACPiuD,GAAQ,IAGZp4B,EAAE71B,GAAK,KAAO,KAAQiuD,GACtBA,EAAO,GAEX,OAAOp4B,CACX,CCxCO,MAAM,GAMT,WAAA9nB,CAAYmgD,EAAU5wC,GAClB,GAAY,MAARA,IACG6wC,QAAS1vD,KAAK0vD,QAAS7wC,KAAM7e,KAAK6e,MDV1C,SAAmB9b,GACtB,MAAO4sD,EAASC,GAAc7sD,EAAE2E,MAAM,KACtC,IAAKioD,IAAYC,EACb,MAAM,IAAIpxD,MAAM,+BAAiCuE,GACrD,IAAI8sD,EFJe,EEKf18B,EAAK27B,GAAUa,GACnB,GAAU,MAANx8B,IACA08B,EFNe,GEOf18B,EAAK67B,GAAUW,GACL,MAANx8B,GACA,MAAM,IAAI30B,MAAM,+BAAiCuE,GAEzD,MAAMq0B,EAAI5Y,SAASoxC,EAAY,IAC/B,GAAIrlD,OAAOu2B,MAAM1J,IACbpoB,OAAOooB,GAAG31B,SAAWmuD,EAAWnuD,QAChC21B,EAAI,GACJA,EAAe,EAAXy4B,EACJ,MAAM,IAAIrxD,MAAM,+BAAiCuE,GAErD,MAAM8b,EAAO0wC,GAASn4B,EAAG,EAAIy4B,GAC7B,MAAO,CACHH,QAASL,GAAOl8B,EAAItU,GACpBA,OAER,CCd0DixC,CAAUL,QAEvD,CACD,MAAMM,EAAWd,GAAQQ,GACzB,GAAgB,MAAZM,EACA,MAAM,IAAIvxD,MAAM,2BAEpBqgB,EAAO7P,OAAO6P,GACd,MAAMuY,EAAI5Y,SAASK,EAAM,IACzB,GAAItU,OAAOu2B,MAAM1J,IACbpoB,OAAOooB,GAAG31B,SAAWod,EAAKpd,QAC1B21B,EAAI,GACJA,EAAsB,EAAlB24B,EAAStuD,OAAY,CACzB,MAAMuuD,EAAaf,GAAQpwC,GAC3B,GAAkB,MAAdmxC,EACA,MAAM,IAAIxxD,MAAM,wBAEpBwB,KAAK6e,KAAOmxC,CAChB,MAEIhwD,KAAK6e,KAAO0wC,GAASn4B,EAAG,EAAI24B,EAAStuD,QAEzCzB,KAAK0vD,QAAUL,GAAOU,EAAU/vD,KAAK6e,KACzC,CACJ,CAMA,QAAAmV,CAASb,GACL,OHhBD,SAAoBG,EAAKH,GAI5B,GAHkB,iBAAPA,IACPA,EAAK87B,GAAQ97B,IAEP,MAANA,EACA,MAAM,IAAI30B,MAAM,cACpB,GAAI20B,EAAG1xB,SAAW6xB,EAAIo8B,QAAQjuD,OAC1B,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAI4xB,EAAG1xB,OAAQF,IAC3B,IAAK+xB,EAAIo8B,QAAQnuD,GAAK+xB,EAAIzU,KAAKtd,MAAS4xB,EAAG5xB,GAAK+xB,EAAIzU,KAAKtd,IACrD,OAAO,EAGf,OAAO,CACX,CGCe0uD,CAAW,CAAEP,QAAS1vD,KAAK0vD,QAAS7wC,KAAM7e,KAAK6e,MAAQsU,EAClE,CAEA,QAAA9sB,GACI,MAAM7E,EFMP,SAA0Bqd,GAC7B,IAAI2wC,EAAO,EAEX,IAAK,IAAK3kD,EAAOqlD,KAASrxC,EAAKsxC,UAAW,CACtC,GAAa,MAATD,EAAJ,CAIA,KAAe,IAAPA,GACJV,IACAU,IAAe,EAEnB,GAAY,IAAPA,EACD,OAAQ,EAEZ,IAAK,IAAI3uD,EAAIsJ,EAAQ,EAAGtJ,EAAIsd,EAAKpd,OAAQF,IACrC,GAAe,GAAXsd,EAAKtd,GACL,OAAQ,EAGhB,KAbA,CAFIiuD,GAAQ,CAgBhB,CACA,OAAOA,CACX,CE7BkBY,CAAiBpwD,KAAK6e,MAC1BA,GAAc,IAAPrd,EAAWwN,OAAOxN,GF6BhC,SAAmBqd,GACtB,IAAInJ,EAAM,KACV,IAAK,MAAMw6C,KAAQrxC,EACfnJ,IAAQw6C,GAAQ,GAAG7pD,SAAS,KAAc,GAAP6pD,GAAa7pD,SAAS,IAE7D,OAAOqP,CACX,CEnC4C26C,CAAUrwD,KAAK6e,MACnD,OFnBD,SAAoBsU,GACvB,OAAQA,EAAG1xB,QACP,KD9Be,EC+BX,OAAO0xB,EAAGtrB,KAAK,KAEnB,KDhCe,GCgCD,CACV,MAAMiN,EAAS,GACf,IAAK,IAAIvT,EAAI,EAAGA,EAAI4xB,EAAG1xB,OAAQF,IACvBA,EAAI,GAAM,GACVuT,EAAOtU,KAAK2yB,EAAG5xB,GAAG8E,SAAS,IAAIiqD,SAAS,EAAG,KACvCn9B,EAAG5xB,EAAI,GAAG8E,SAAS,IAAIiqD,SAAS,EAAG,MAG/C,OAAOx7C,EAAOjN,KAAK,IACvB,CACA,QACI,MAAM,IAAIrJ,MAAM,qBAG5B,CEAe+xD,CAAWvwD,KAAK0vD,SAAW,IAAM7wC,CAC5C,EChDG,SAAS2xC,GAAOz6B,GACnB,OAAOjpB,QAAQgiD,GAAU/4B,GAC7B,CAEO,SAAS06B,GAAO16B,GACnB,OAAOjpB,QAAQkiD,GAAUj5B,GAC7B,CAEO,SAAS26B,GAAK36B,GACjB,OAAOjpB,QAAQmiD,GAAQl5B,GAC3B,CCTO,MAAM46B,GAAOH,GACPI,GAAOH,GAGP,GAAU,SAAUt9B,GAC7B,IAAIjwB,EAAS,EAEb,GADAiwB,EAAKA,EAAG9sB,WAAWsB,OACfgpD,GAAKx9B,GAAK,CACV,MAAMrkB,EAAQ,IAAImB,WAAW/M,EAAS,GAItC,OAHAiwB,EAAGzrB,MAAM,OAAOyF,SAAS+iD,IACrBphD,EAAM5L,KAAiC,IAArBsb,SAAS0xC,EAAM,GAAU,IAExCphD,CACX,CACA,GAAI8hD,GAAKz9B,GAAK,CACV,MAAM09B,EAAW19B,EAAGzrB,MAAM,IAAK,GAC/B,IAAInG,EACJ,IAAKA,EAAI,EAAGA,EAAIsvD,EAASpvD,OAAQF,IAAK,CAElC,IAAIuvD,EADSH,GAAKE,EAAStvD,MAGvBuvD,EAAW,GAAQD,EAAStvD,IAC5BsvD,EAAStvD,GAAK,GAAmBuvD,EAAS5vD,MAAM,EAAG,GAAI,WAE3C,MAAZ4vD,KAAsBvvD,EAAI,GAC1BsvD,EAAS3lD,OAAO3J,EAAG,EAAG,GAAmBuvD,EAAS5vD,MAAM,EAAG,GAAI,UAEvE,CACA,GAAoB,KAAhB2vD,EAAS,GACT,KAAOA,EAASpvD,OAAS,GACrBovD,EAASjmD,QAAQ,UAEpB,GAAsC,KAAlCimD,EAASA,EAASpvD,OAAS,GAChC,KAAOovD,EAASpvD,OAAS,GACrBovD,EAASrwD,KAAK,UAEjB,GAAIqwD,EAASpvD,OAAS,EAAG,CAC1B,IAAKF,EAAI,EAAGA,EAAIsvD,EAASpvD,QAA0B,KAAhBovD,EAAStvD,GAAWA,KAEvD,MAAMwvD,EAAO,CAACxvD,EAAG,GACjB,IAAKA,EAAI,EAAIsvD,EAASpvD,OAAQF,EAAI,EAAGA,IACjCwvD,EAAKvwD,KAAK,KAEdqwD,EAAS3lD,OAAO3I,MAAMsuD,EAAUE,EACpC,CACA,MAAMjiD,EAAQ,IAAImB,WAAW/M,EAAS,IACtC,IAAK3B,EAAI,EAAGA,EAAIsvD,EAASpvD,OAAQF,IAAK,CAClC,MAAM41C,EAAO34B,SAASqyC,EAAStvD,GAAI,IACnCuN,EAAM5L,KAAai0C,GAAQ,EAAK,IAChCroC,EAAM5L,KAAmB,IAAPi0C,CACtB,CACA,OAAOroC,CACX,CACA,MAAM,IAAItQ,MAAM,qBACpB,ECzDMwyD,IAAK,EACEhwD,GAAQ,CAAC,EACT8oC,GAAQ,CAAC,EAyEf,SAAS,GAAYgU,GACxB,GAAqB,iBAAVA,EAAoB,CAC3B,GAAoB,MAAhBhU,GAAMgU,GACN,OAAOhU,GAAMgU,GAEjB,MAAM,IAAIt/C,MAAM,0BAA0Bs/C,IAC9C,CACK,GAAqB,iBAAVA,EAAoB,CAChC,GAAoB,MAAhB98C,GAAM88C,GACN,OAAO98C,GAAM88C,GAEjB,MAAM,IAAIt/C,MAAM,0BAA0Bs/C,IAC9C,CACA,MAAM,IAAIt/C,MAAM,oCAAoCs/C,EACxD,CC9DO,SAASmT,GAAgBnT,EAAOtuC,GAEnC,OADiB,GAAYsuC,GACZ/oC,MACb,KAAK,EACL,KAAK,GACD,OAmGZ,SAAkBm8C,GACd,MAAMC,EFzEc,SAAU3hD,EAAKtM,EAAS,EAAGzB,GAC/CyB,IAAWA,EACXzB,EAASA,GAAW+N,EAAI/N,OAASyB,EACjC,MAAMk1C,EAAO,IAAInB,SAASznC,EAAIkD,QAC9B,GAAe,IAAXjR,EAAc,CACd,MAAMqT,EAAS,GAEf,IAAK,IAAIvT,EAAI,EAAGA,EAAIE,EAAQF,IACxBuT,EAAOtU,KAAKgP,EAAItM,EAAS3B,IAE7B,OAAOuT,EAAOjN,KAAK,IACvB,CACA,GAAe,KAAXpG,EAAe,CACf,MAAMqT,EAAS,GAEf,IAAK,IAAIvT,EAAI,EAAGA,EAAIE,EAAQF,GAAK,EAC7BuT,EAAOtU,KAAK43C,EAAKwE,UAAU15C,EAAS3B,GAAG8E,SAAS,KAEpD,OAAOyO,EAAOjN,KAAK,KACd7B,QAAQ,qBAAsB,UAC9BA,QAAQ,SAAU,KAC3B,CACA,MAAO,EACX,CEkDqB,CAAYkrD,EAAQ,EAAGA,EAAOzvD,QAC/C,GAAgB,MAAZ0vD,EACA,MAAM,IAAI3yD,MAAM,sBAEpB,IAAK,GAAQ2yD,GACT,MAAM,IAAI3yD,MAAM,sBAEpB,OAAO2yD,CACX,CA5GmBC,CAAS5hD,GACpB,KAAK,GASL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACD,OAAO6hD,GAAU7hD,GAdrB,KAAK,GACD,OAAO,GAAmBA,EAAK,UACnC,KAAK,EACL,KAAK,IACL,KAAK,GACL,KAAK,IACD,OAAO8hD,GAAW9hD,GAAKnJ,WAS3B,KAAK,IACD,OA6IZ,SAAkBmJ,GACd,MAAM/Q,EAAO,EAAc+Q,GACrBmgD,EAAUngD,EAAItO,MAAM,EAAsBzC,IAChD,GAAIkxD,EAAQluD,SAAWhD,EACnB,MAAM,IAAID,MAAM,wBAEpB,OAAO,GAAmBmxD,EAAS,YACvC,CApJmB4B,CAAS/hD,GACpB,KAAK,IAEL,KAAK,IACD,OAqLZ,SAAqBA,GACjB,MAAMgiD,EAAYhiD,EAAItO,MAAM,EAAGsO,EAAI/N,OAAS,GACtCgwD,EAAYjiD,EAAItO,MAAMsO,EAAI/N,OAAS,GAGzC,MAAO,GAFM,GAAmB+vD,EAAW,aAC9BF,GAAWG,IAE5B,CA3LmBC,CAAYliD,GACvB,KAAK,IACD,OA4HZ,SAAkBA,GACd,MAAM/Q,EAAO,EAAc+Q,GACrBpC,EAAOoC,EAAItO,MAAM,EAAsBzC,IAC7C,GAAI2O,EAAK3L,SAAWhD,EAChB,MAAM,IAAID,MAAM,wBAEpB,MAAO,IAAM,GAAmB4O,EAAM,YAC1C,CAnImBukD,CAASniD,GACpB,KAAK,IACD,OAAOooB,WAAWg6B,mBAAmBP,GAAU7hD,IACnD,QACI,OAAO,GAAmBA,EAAK,UAE3C,CAEO,SAAS,GAAesuC,EAAO/3C,GAElC,OADiB,GAAY+3C,GACZ/oC,MACb,KAAK,EAEL,KAAK,GACD,OAsDZ,SAAkBo8C,GACd,IAAK,GAAQA,GACT,MAAM,IAAI3yD,MAAM,sBAEpB,OAAO,GAAW2yD,EACtB,CA3DmBU,CAAS9rD,GACpB,KAAK,GASL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,GACL,KAAK,IACL,KAAK,IACL,KAAK,IACD,OAAO+rD,GAAU/rD,GAdrB,KAAK,GACD,OAAO,GAAqBA,EAAK,UACrC,KAAK,EACL,KAAK,IACL,KAAK,GACL,KAAK,IACD,OAAOgsD,GAAWvzC,SAASzY,EAAK,KASpC,KAAK,IACD,OA0EZ,SAAkBqH,GACd,IAAI4kD,EAEAA,EADY,MAAZ5kD,EAAK,IAA0B,MAAZA,EAAK,GACnB,GAAcm+B,GAAUvvB,OAAO,IAAI5O,MAAS0B,MAG5Cg/B,GAAIxoB,MAAMlY,GAAM4/B,UAAUl+B,MAGnC,MAAMrQ,EAAOwR,WAAWsO,KAAK,EAAcyzC,EAAGvwD,SAC9C,OAAO,GAAiB,CAAChD,EAAMuzD,GAAKvzD,EAAKgD,OAASuwD,EAAGvwD,OACzD,CArFmBwwD,CAASlsD,GACpB,KAAK,IACD,OA4GZ,SAAqBA,GACjB,MAAMopD,EAAOppD,EAAI2B,MAAM,KACvB,GAAoB,IAAhBynD,EAAK1tD,OACL,MAAM,IAAIjD,MAAM,kCAAkC2wD,EAAKtnD,KAAK,8CAEhE,GAAuB,KAAnBsnD,EAAK,GAAG1tD,OACR,MAAM,IAAIjD,MAAM,+BAA+B2wD,EAAK,+BAGxD,MAAM3/C,EAAM6mB,GAAOra,OAAO,IAAMmzC,EAAK,IAE/B+C,EAAO1zC,SAAS2wC,EAAK,GAAI,IAC/B,GAAI+C,EAAO,GAAKA,EAAO,MACnB,MAAM,IAAI1zD,MAAM,yCAEpB,MAAM2zD,EAAUJ,GAAWG,GAC3B,OAAO,GAAiB,CAAC1iD,EAAK2iD,GAAU3iD,EAAI/N,OAAS0wD,EAAQ1wD,OACjE,CA7HmB2wD,CAAYrsD,GACvB,KAAK,IACD,OA4HZ,SAAsBA,GAClB,MAAMopD,EAAOppD,EAAI2B,MAAM,KACvB,GAAoB,IAAhBynD,EAAK1tD,OACL,MAAM,IAAIjD,MAAM,kCAAkC2wD,EAAKtnD,KAAK,8CAEhE,GAAuB,KAAnBsnD,EAAK,GAAG1tD,OACR,MAAM,IAAIjD,MAAM,+BAA+B2wD,EAAK,gCAGxD,MAAM3/C,EAAM6mB,GAAOra,OAAO,IAAImzC,EAAK,MAE7B+C,EAAO1zC,SAAS2wC,EAAK,GAAI,IAC/B,GAAI+C,EAAO,GAAKA,EAAO,MACnB,MAAM,IAAI1zD,MAAM,yCAEpB,MAAM2zD,EAAUJ,GAAWG,GAC3B,OAAO,GAAiB,CAAC1iD,EAAK2iD,GAAU3iD,EAAI/N,OAAS0wD,EAAQ1wD,OACjE,CA7ImB4wD,CAAatsD,GACxB,KAAK,IACD,OAgFZ,SAAkBusD,GACd,MAAMC,EAAKC,GAAex2C,OAAOs2C,GAC3B7zD,EAAOwR,WAAWsO,KAAK,EAAcg0C,EAAG9wD,SAC9C,OAAO,GAAiB,CAAChD,EAAM8zD,GAAK9zD,EAAKgD,OAAS8wD,EAAG9wD,OACzD,CApFmBgxD,CAAS1sD,GACpB,KAAK,IACD,OAAO+rD,GAAUl6B,WAAW86B,mBAAmB3sD,IACnD,QACI,OAAO,GAAqBA,EAAK,UAE7C,CDnGqB,CACjB,CAAC,EAAG,GAAI,OACR,CAAC,EAAG,GAAI,OACR,CAAC,GAAI,GAAI,QACT,CAAC,GAAI,IAAK,OACV,CAAC,GAAIirD,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,WAGP7jD,SAAQwlD,IACV,MAAM7U,EAIH,SAAwB/oC,EAAMtW,EAAMsC,EAAM6xD,EAAY5yC,GACzD,MAAO,CACHjL,OACAtW,OACAsC,OACA6xD,WAAY9lD,QAAQ8lD,GACpB5yC,KAAMlT,QAAQkT,GAEtB,CAZkB6yC,IAAkBF,GAChC7oB,GAAMgU,EAAM/oC,MAAQ+oC,EACpB98C,GAAM88C,EAAM/8C,MAAQ+8C,CAAK,ICxCT,GAAY,OACZ,GAAY,OACT,GAAY,UAyGnC,MAAM1U,GAAWzqC,OAAOsE,OAAO4sC,IAAOvrC,KAAK6C,GAAMA,EAAEypB,UAC7C4hC,GAAiB,WACnB,IAAIrX,EAAM/R,GAAS,GAAGF,GAAGE,GAAS,IAElC,OADAA,GAASloC,MAAM,GAAGiM,SAASsP,GAAO0+B,EAAMA,EAAIjS,GAAGzsB,KACxC0+B,CACV,CAJsB,GAqBvB,SAAS4W,GAAWG,GAChB,MAAM1iD,EAAM,IAAIqC,YAAY,GAG5B,OAFa,IAAIolC,SAASznC,GACrB0tC,UAAU,EAAGgV,GACX,IAAIjiD,WAAWT,EAC1B,CACA,SAAS8hD,GAAW9hD,GAEhB,OADa,IAAIynC,SAASznC,EAAIkD,QAClBkqC,UAAUptC,EAAI+3B,WAC9B,CACA,SAASuqB,GAAU/rD,GACf,MAAMyJ,EAAM,GAAqBzJ,GAC3BtH,EAAOwR,WAAWsO,KAAK,EAAc/O,EAAI/N,SAC/C,OAAO,GAAiB,CAAChD,EAAM+Q,GAAM/Q,EAAKgD,OAAS+N,EAAI/N,OAC3D,CACA,SAAS4vD,GAAU7hD,GACf,MAAM/Q,EAAO,EAAc+Q,GAE3B,IADAA,EAAMA,EAAItO,MAAM,EAAsBzC,KAC9BgD,SAAWhD,EACf,MAAM,IAAID,MAAM,wBAEpB,OAAO,GAAmBgR,EAC9B,CC5GO,SAASsjD,GAAsBhkD,GAClC,MAAMikD,EAAS,GACTC,EAAe,GACrB,IAAIhzC,EAAO,KACPze,EAAI,EACR,KAAOA,EAAIuN,EAAMrN,QAAQ,CACrB,MAAMsT,EAAO,EAAcjG,EAAOvN,GAC5BiS,EAAI,EAAsBuB,GAC1B2pB,EAAI,GAAY3pB,GAChBtW,EAAOw0D,GAAYv0B,EAAG5vB,EAAM5N,MAAMK,EAAIiS,IAC5C,GAAa,IAAT/U,EAAY,CACZs0D,EAAOvyD,KAAK,CAACuU,IACbi+C,EAAaxyD,KAAK,CAACuU,IACnBxT,GAAKiS,EAEL,QACJ,CACA,MAAM27C,EAAOrgD,EAAM5N,MAAMK,EAAIiS,EAAGjS,EAAIiS,EAAI/U,GAExC,GADA8C,GAAM9C,EAAO+U,EACTjS,EAAIuN,EAAMrN,OACV,MAAM,IAAI,GAAW,+BAAiC,GAAmBqN,EAAO,WAGpFikD,EAAOvyD,KAAK,CAACuU,EAAMo6C,IACnB,MAAM+D,EAAajC,GAAgBl8C,EAAMo6C,GAEzC,GADA6D,EAAaxyD,KAAK,CAACuU,EAAMm+C,KACV,IAAXx0B,EAAE1e,KAAe,CAIjBA,EAAOkzC,EACP,KACJ,CACJ,CACA,MAAO,CACHpkD,MAAOmB,WAAWsO,KAAKzP,GACvByB,OAAQ4iD,GAAqBH,GAC7BD,SACAC,eACAhzC,OAER,CAkBA,SAASmzC,GAAqBJ,GAC1B,MAAM31C,EAAQ,GASd,OARA21C,EAAOzuD,KAAK8uD,IACR,MAAMtV,EAAQ,GAAYsV,EAAI,IAK9B,OAJAh2C,EAAM5c,KAAKs9C,EAAM/8C,MACbqyD,EAAI3xD,OAAS,GAAe,MAAV2xD,EAAI,IACtBh2C,EAAM5c,KAAK4yD,EAAI,IAEZ,IAAI,IAERC,GAAUj2C,EAAMvV,KAAK,KAChC,CAIO,SAAS,GAAckrD,GAC1B,OAAO,GAAiBA,EAAOzuD,KAAK8uD,IAChC,MAAMtV,EAAQ,GAAYsV,EAAI,IAC9B,IAAI5jD,EAAMS,WAAWsO,KAAK,EAAcu/B,EAAM/oC,OAI9C,OAHIq+C,EAAI3xD,OAAS,GAAe,MAAV2xD,EAAI,KACtB5jD,EAAM,GAAiB,CAACA,EAAK4jD,EAAI,MAE9B5jD,CAAG,IAElB,CAIA,SAASyjD,GAAYv0B,EAAGywB,GACpB,GAAIzwB,EAAEjgC,KAAO,EACT,OAAOigC,EAAEjgC,KAAO,EAEf,GAAe,IAAXigC,EAAEjgC,KACP,OAAO,EAEN,CACD,MAAMA,EAAO,EAAc0wD,aAAgBl/C,WAAak/C,EAAOl/C,WAAWsO,KAAK4wC,IAC/E,OAAO1wD,EAAO,EAAsBA,EACxC,CACJ,CAyBO,SAAS40D,GAAUttD,GACtB,MAAO,IAAMA,EAAI4B,OAAOD,MAAM,KAAKmF,QAAQ8T,GAAMA,IAAG9Y,KAAK,IAC7D,CACO,MAAM,WAAmBrJ,MAC5BqrD,YAAc,aACd9oD,KAAO,aACP,WAAAuO,CAAYvJ,GACRqqC,MAAM,0BAA0BrqC,IACpC,EClLJ,MAAMutD,GAAU7vB,OAAOmL,IAAI,8BACd,GAASnL,OAAOmL,IAAI,wCAC3B2kB,GAAY,CACd,GAAY,OAAOx+C,KACnB,GAAY,QAAQA,KACpB,GAAY,QAAQA,KACpB,GAAY,WAAWA,MAE3B,MAAMy+C,WAAiCh1D,MACnC,WAAA8Q,CAAY9C,EAAU,yBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,0BAChB,EAKG,MAAM0yD,GACT3kD,MACA,GACA,GACA,GACA,GACA,CAAC,KAAU,EACX,WAAAQ,CAAY6/C,GAKR,IAAI/xC,EACJ,GAJY,MAAR+xC,IACAA,EAAO,IAGPA,aAAgBl/C,WAChBmN,EAAQ01C,GAAsB3D,QAE7B,GAAoB,iBAATA,EAAmB,CAC/B,GAAIA,EAAK1tD,OAAS,GAAwB,MAAnB0tD,EAAKtoD,OAAO,GAC/B,MAAM,IAAIrI,MAAM,cAAc2wD,4BAElC/xC,EDxCL,SAAgCrX,GAEnC,MAAMgtD,EAAS,GACTC,EAAe,GACrB,IAAIhzC,EAAO,KACX,MAAM5C,GAJNrX,EAAMstD,GAAUttD,IAIE2B,MAAM,KAAKxG,MAAM,GACnC,GAAqB,IAAjBkc,EAAM3b,QAA6B,KAAb2b,EAAM,GAC5B,MAAO,CACHtO,MAAO,IAAImB,WACXM,OAAQ,IACRwiD,OAAQ,GACRC,aAAc,GACdhzC,KAAM,MAGd,IAAK,IAAI0e,EAAI,EAAGA,EAAIthB,EAAM3b,OAAQi9B,IAAK,CACnC,MACMof,EAAQ,GADD1gC,EAAMshB,IAEnB,GAAmB,IAAfof,EAAMr/C,KAAY,CAClBs0D,EAAOvyD,KAAK,CAACs9C,EAAM/oC,OACnBi+C,EAAaxyD,KAAK,CAACs9C,EAAM/oC,OAEzB,QACJ,CAEA,GADA2pB,IACIA,GAAKthB,EAAM3b,OACX,MAAM,IAAI,GAAW,oBAAsBsE,GAG/C,IAAmB,IAAf+3C,EAAM99B,KAAe,CAIrBA,EAAOqzC,GAAUj2C,EAAMlc,MAAMw9B,GAAG72B,KAAK,MACrCkrD,EAAOvyD,KAAK,CAACs9C,EAAM/oC,KAAM,GAAe+oC,EAAM/oC,KAAMiL,KACpDgzC,EAAaxyD,KAAK,CAACs9C,EAAM/oC,KAAMiL,IAC/B,KACJ,CACA,MAAMlR,EAAQ,GAAegvC,EAAM/oC,KAAMqI,EAAMshB,IAC/Cq0B,EAAOvyD,KAAK,CAACs9C,EAAM/oC,KAAMjG,IACzBkkD,EAAaxyD,KAAK,CAACs9C,EAAM/oC,KAAMk8C,GAAgBnT,EAAM/oC,KAAMjG,IAC/D,CACA,MAAO,CACHyB,OAAQ4iD,GAAqBH,GAC7BlkD,MAAO,GAAcikD,GACrBA,SACAC,eACAhzC,OAER,CCToB0zC,CAAuBvE,EACnC,KACK,KAAIwE,GAAYxE,GAIjB,MAAM,IAAI3wD,MAAM,uDAHhB4e,EAAQ01C,GAAsB3D,EAAKrgD,MAIvC,CACA9O,KAAK8O,MAAQsO,EAAMtO,MACnB9O,MAAK,EAAUod,EAAM7M,OACrBvQ,MAAK,EAAUod,EAAM21C,OACrB/yD,MAAK,EAAgBod,EAAM41C,aAC3BhzD,MAAK,EAAQod,EAAM4C,IACvB,CACA,QAAA3Z,GACI,OAAOrG,MAAK,CAChB,CACA,MAAAqb,GACI,OAAOrb,KAAKqG,UAChB,CACA,SAAAutD,GACI,IAAIC,EACAC,EACAC,EACA7B,EACA8B,EAAO,GACX,MAAMC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAM,GAAY,OAClBC,EAAO,GAAY,QACnBC,EAAU,GAAY,WAC5B,IAAK,MAAOv/C,EAAM/V,KAAUgB,KAAKgzD,eACzBj+C,IAASu/C,EAAQv/C,OACjBi/C,EAAO,IAAIh1D,GAAS,MAGpBu0D,GAAUvoC,SAASjW,KACnB++C,EAAyB,QAAbG,EAAIlzD,KAAiB,MAAQ,MACzCmxD,EAAO,IACP6B,EAAO,GAAG/0D,GAAS,KAAKg1D,IACxBH,EAAS9+C,IAASs/C,EAAKt/C,KAAO,EAAI,GAElCA,IAASk/C,EAAIl/C,MAAQA,IAASm/C,EAAIn/C,OAClC++C,EAAuC,QAA3B,GAAY/+C,GAAMhU,KAAiB,MAAQ,MACvDmxD,EAAO1zC,SAASxf,GAAS,KAEzB+V,IAASo/C,EAAIp/C,MAAQA,IAASq/C,EAAIr/C,OAClC++C,EAAuC,QAA3B,GAAY/+C,GAAMhU,KAAiB,MAAQ,MACvDgzD,EAAO,GAAG/0D,GAAS,KAAKg1D,IACxBH,EAAS9+C,IAASq/C,EAAIr/C,KAAO,EAAI,GAGzC,GAAc,MAAV8+C,GAA+B,MAAbC,GAA6B,MAARC,GAAwB,MAAR7B,EACvD,MAAM,IAAI1zD,MAAM,uGAQpB,MANa,CACTq1D,SACAE,OACAD,YACA5B,OAGR,CACA,MAAAqC,GACI,OAAOv0D,MAAK,EAAQsE,KAAI,EAAEyQ,KAAUpW,OAAO01B,OAAO,CAAC,EAAG,GAAYtf,KACtE,CACA,UAAAy/C,GACI,OAAOx0D,MAAK,EAAQsE,KAAI,EAAEyQ,KAAUA,GACxC,CACA,UAAA0/C,GACI,OAAOz0D,MAAK,EAAQsE,KAAI,EAAEyQ,KAAU,GAAYA,GAAMhU,MAC1D,CACA,MAAAgyD,GACI,OAAO/yD,MAAK,EAAQsE,KAAI,EAAEyQ,EAAM/V,KACf,MAATA,EACO,CAAC+V,GAEL,CAACA,EAAM/V,IAEtB,CACA,YAAAg0D,GACI,OAAOhzD,MAAK,EAAcsE,KAAI,EAAEyQ,EAAM/V,KACrB,MAATA,EACO,CAAC+V,GAEL,CAACA,EAAM/V,IAEtB,CACA,WAAA01D,CAAYvF,GAER,OADAA,EAAO,IAAIsE,GAAUtE,GACd,IAAIsE,GAAUzzD,KAAKqG,WAAa8oD,EAAK9oD,WAChD,CACA,WAAAsuD,CAAYxF,GACR,MAAMyF,EAAazF,EAAK9oD,WAClBtD,EAAI/C,KAAKqG,WACT9E,EAAIwB,EAAE2uB,YAAYkjC,GACxB,GAAIrzD,EAAI,EACJ,MAAM,IAAI/C,MAAM,WAAWwB,KAAKqG,2CAA2C8oD,EAAK9oD,cAEpF,OAAO,IAAIotD,GAAU1wD,EAAE7B,MAAM,EAAGK,GACpC,CACA,eAAAszD,CAAgB9/C,GACZ,MAAMg+C,EAAS/yD,KAAK+yD,SACpB,IAAK,IAAIxxD,EAAIwxD,EAAOtxD,OAAS,EAAGF,GAAK,EAAGA,IACpC,GAAIwxD,EAAOxxD,GAAG,KAAOwT,EACjB,OAAO,IAAI0+C,GAAU,GAAcV,EAAO7xD,MAAM,EAAGK,KAG3D,OAAOvB,IACX,CACA,SAAA80D,GACI,IACI,IAAI/B,EAAS,GACb/yD,KAAKgzD,eAAe7lD,SAAQ,EAAE4H,EAAMhU,MAC5BgU,IAAS/T,GAAM+zD,IAAIhgD,MACnBg+C,EAAOvyD,KAAK,CAACuU,EAAMhU,IAInBgU,IAAS/T,GAAM,eAAe+T,OAC9Bg+C,EAAS,GACb,IAGJ,MAAMiC,EAAQjC,EAAOv1B,MACrB,GAAkB,MAAdw3B,IAAQ,GAAY,CACpB,MAAM7N,EAAY6N,EAAM,GAGxB,MAAqB,MAAjB7N,EAAU,IAA+B,MAAjBA,EAAU,GAC3B,GAAmB5b,GAAUvvB,OAAO,IAAImrC,KAAc,aAG1D,GAAmBrZ,GAAIxoB,MAAM6hC,GAAWna,UAAUl+B,MAAO,YACpE,CACA,OAAO,IACX,CACA,MAAOmV,GACH,OAAO,IACX,CACJ,CACA,OAAAgxC,GACI,OAAOj1D,MAAK,CAChB,CACA,MAAAsuC,CAAO6gB,GACH,OAAO,GAAiBnvD,KAAK8O,MAAOqgD,EAAKrgD,MAC7C,CACA,aAAM5K,CAAQ+V,GACV,MAAMi7C,EAAkBl1D,KAAKu0D,SAASj7B,MAAMoF,GAAMA,EAAEk0B,aAEpD,GAAuB,MAAnBsC,EACA,MAAO,CAACl1D,MAEZ,MAAMm1D,EAAWC,GAAUh2D,IAAI81D,EAAgBn0D,MAC/C,GAAgB,MAAZo0D,EACA,MAAM,IAAI3B,GAAyB,6BAA6B0B,EAAgBn0D,QAGpF,aADqBo0D,EAASn1D,KAAMia,IACtB3V,KAAIyB,GAAO,GAAUA,IACvC,CACA,WAAAsvD,GACI,MAAMp7C,EAAUja,KAAK4zD,YACrB,GAA0B,QAAtB35C,EAAQ65C,WAA6C,QAAtB75C,EAAQ65C,UACvC,MAAM,IAAIt1D,MAAM,gEAAgEyb,EAAQ65C,kEAE5F,MAAO,CACHD,OAAQ55C,EAAQ45C,OAChBlE,QAAS11C,EAAQ85C,KACjB7B,KAAMj4C,EAAQi4C,KAEtB,CACA,kBAAAoD,CAAmBnG,GACf,MAAMoF,GAAUpF,GAAQnvD,MAAMu0D,SAC9B,QAAsB,IAAlBA,EAAO9yD,QAGY,IAAnB8yD,EAAO,GAAGx/C,MAAiC,KAAnBw/C,EAAO,GAAGx/C,MAGf,IAAnBw/C,EAAO,GAAGx/C,MAAiC,MAAnBw/C,EAAO,GAAGx/C,KAI1C,CAaA,CAACu+C,MACG,MAAO,aAAatzD,MAAK,IAC7B,EChJG,MAAMo1D,GAAY,IAAIvnB,IAsHtB,SAAS8lB,GAAY30D,GACxB,OAAO8N,QAAQ9N,IAAQ,IAC3B,CAcO,SAAS,GAAUmwD,GACtB,OAAO,IAAIsE,GAAetE,EAC9B,CCzOA,MACM,GAAM,IAAI9R,GAAO,cAChB,MAAMkY,GACTC,MACAzL,OACA9vC,QACAw7C,oBAAsB,IAAI5nB,IAC1B6nB,qBAAuB,IAAI7nB,IAC3B,WAAAv+B,EAAY,QAAE2K,EAAO,MAAEu7C,EAAK,OAAEzL,IAC1B/pD,KAAKia,QAAUA,EACfja,KAAKw1D,MAAQA,EACbx1D,KAAK+pD,OAASA,CAClB,CACA,KAAA/iD,CAAMkgD,GAEFlnD,KAAKsmB,KAAK4gC,GACV,MAAQyO,cAAeC,EAAgBC,eAAgBC,GAAoB91D,KAAKia,QAC1EktC,EAAYD,EAAO7gD,WAGzB,GAAuB,IAAnBuvD,EAAsB,CACtB,MAAMG,EAAWC,aAAY,KACpB,WACD,IAAInL,EACJ,IAGI,IACIA,QAAa7qD,KAAK+pD,OAAOkM,SAASpL,KAAKA,KAAK3D,GAC5C,GAAI1S,KAAK,mBAAmB2S,KAAc0D,EAC9C,CACA,MAAOrjC,GAIH,YAHA,GAAIA,MAAM,yBAAyB2/B,uDACdyO,6BAGzB,CACA,UACU51D,KAAK+pD,OAAOmM,UAAU7yC,MAAM6jC,EAAQ,CACtCmB,SAAU,CACNwC,KAAM,GAAYA,EAAKxkD,cAGnC,CACA,MAAO4d,GACH,GAAIuD,MAAM,wBAAyBvD,EACvC,CACJ,CACA,MAAOA,GACH,GAAIuD,MAAM,gBAAgB2/B,KAAcljC,EAC5C,CACH,EA7BI,EA6BD,GACY,IAAjB2xC,GACH51D,KAAKy1D,oBAAoBn2D,IAAI6nD,EAAW4O,EAC5C,CACA,MAAMP,EAAQx1D,KAAKw1D,MACnB,GAAIA,GAA6B,IAApBM,EAAuB,CAChC,MAAMK,EAAYn2D,KAAKo2D,mBAAmBZ,EAAOM,EAAiB5O,EAAO7gD,YACzErG,KAAK01D,qBAAqBp2D,IAAI4nD,EAAQiP,EAC1C,CACJ,CACA,IAAA7vC,CAAK4gC,GACD,MAAMC,EAAYD,EAAO7gD,WACrBrG,KAAKy1D,oBAAoBx2D,IAAIkoD,KAC7BkP,cAAcr2D,KAAKy1D,oBAAoBr2D,IAAI+nD,IAC3CnnD,KAAKy1D,oBAAoBpO,OAAOF,IAEhCnnD,KAAK01D,qBAAqBz2D,IAAIioD,KAC9BlnD,KAAK01D,qBAAqBt2D,IAAI8nD,IAAS5iD,IAAI+xD,eAC3Cr2D,KAAK01D,qBAAqBrO,OAAOH,GAEzC,CACA,OAAAoP,GACI,IAAK,MAAMC,IAAS,IACb53D,OAAOsE,OAAOjD,KAAKy1D,wBACnB92D,OAAOsE,OAAOjD,KAAK01D,uBAEtBW,cAAcE,GAElBv2D,KAAKy1D,oBAAoBl2D,QACzBS,KAAK01D,qBAAqBn2D,OAC9B,CACA,gBAAAi3D,GACI,OAAQx2D,KAAKy1D,oBAAoBh3D,KAAO,GAAKuB,KAAK01D,qBAAqBj3D,KAAO,CAClF,CACA,kBAAA23D,CAAmBZ,EAAOM,EAAiB3O,GAEvC,MAAMgP,EAAY,GAClB,IAAK,MAAM5iB,KAASiiB,EAAM9Z,aAAc,CAEpC,IADkB8Z,EAAMiB,aAAaljB,GACtBvoB,SAASm8B,GACpB,SACJ,MAAMx2B,EAAU0tB,GAAc,CAC1B5B,qBAAsBhB,GAA6BlI,GACnDnB,aA9Fc,0BA+Fde,WAAW,IAET4iB,EAAWC,aAAY,KACzB,GAAIxhB,KAAK,mCACTghB,EACK/kC,KAAKE,EAAS,CAAEoiB,QAAS,IAAI9iC,WAAW,CAAC,MACzCqzB,OAAOrf,GAAM,GAAIuD,MAAM,4BAA6BvD,IAAG,GAC3C,IAAlB6xC,GACHK,EAAU31D,KAAKu1D,EACnB,CACA,OAAOI,CACX,ECvGG,MAAMO,GAAe7O,IACxB,IAAKA,EACD,OAAQ,EAEZ,IACI,MAAM/4C,EAAQ+4C,EAAKQ,SAASjpD,IAAI,QAChC,OAAK0P,EAGEvE,OAAOywC,GAAYlsC,KAFd,CAGhB,CACA,MAAOmV,GACH,OAAQ,CACZ,GCXE,GAAM,IAAIo5B,GAAO,sBAMhB,MAAMsZ,WAA0BlK,GAEnC/Q,aACAkb,iBACA38C,QACA8vC,OACA8M,oBAAsB,IAAIhpB,IAC1BipB,kBAAoB,IAAIjpB,IACxBkpB,+BAAiC,EACjCC,qBAAuB,GACvBC,uBAAwB,EACxB,WAAAC,GACI,QAAIt/B,YAAYgD,YAAchD,YAAYgD,WAAWu8B,SAG9Cn3D,KAAKi3D,qBAChB,CACA,IAAA3wC,GACItmB,KAAK42D,iBAAiBN,UACtBt2D,KAAK+pD,OAAOtF,oBAAoB,eAAgBzkD,KAAKo3D,gBAAgB,iBACrEp3D,KAAK+pD,OAAOtF,oBAAoB,kBAAmBzkD,KAAKo3D,gBAAgB,oBACxEp3D,KAAK+pD,OAAOtF,oBAAoB,iBAAkBzkD,KAAKo3D,gBAAgB,mBACvEp3D,KAAKq3D,2BACT,CACA,oBAAMC,CAAepQ,GACjB,IACIlnD,KAAK42D,iBAAiBtwC,KAAK4gC,SACrBlnD,KAAK+pD,OAAOwN,OAAOrQ,GACzB,GAAI1S,KAAK,gCAAgC0S,EAAO7gD,aACpD,CACA,MAAOmhB,GACH,GAAIA,MAAM,uCAAuC0/B,EAAO7gD,gBAAgBmhB,IAC5E,CACJ,CACA,yBAAMgwC,GACF,MAAMC,QAAwBz3D,KAAK+pD,OAAOmM,UAAU3Q,MAC9CmS,EAAiB13D,KAAK+pD,OACvBlD,iBACAviD,KAAKqzD,GAASA,EAAK5M,aAClB6M,EAA6B,GAC7BC,EAAgC,GAChCC,EAAyB,GACzBC,EAA4B,GAC5BC,EAA+B,GAC/BC,EAAwB,GAC9B,IAAK,MAAMpQ,KAAQ4P,EAAiB,CAChC,MAAMS,QAAal4D,KAAKm4D,mBAAmBtQ,EAAKn3C,IAC5CwnD,EAAKltC,SAASyvB,GAAK2d,WACnBR,EAA2Bp3D,KAAKqnD,GAE3BqQ,EAAKltC,SAASyvB,GAAK4d,eACxBR,EAA8Br3D,KAAKqnD,GAE9BqQ,EAAKltC,SAASyvB,GAAK6d,QACxBR,EAAuBt3D,KAAKqnD,EAEpC,CACA,IAAK,MAAMX,KAAUwQ,EAAgB,CACjC,MAAM7P,QAAa7nD,KAAK+pD,OAAOmM,UAAU92D,IAAI8nD,GACvCgR,QAAal4D,KAAKm4D,mBAAmBjR,GACvCgR,EAAKltC,SAASyvB,GAAK2d,WACnBL,EAA0Bv3D,KAAKqnD,GAE1BqQ,EAAKltC,SAASyvB,GAAK4d,eACxBL,EAA6Bx3D,KAAKqnD,GAE7BqQ,EAAKltC,SAASyvB,GAAK6d,QACxBL,EAAsBz3D,KAAKqnD,EAEnC,CACA,MAAO,CACH0Q,WAAY,CACR,CAAC9d,GAAK2d,WAAYR,EAClB,CAACnd,GAAK4d,eAAgBR,EACtB,CAACpd,GAAK6d,OAAQR,GAElBU,UAAW,CACP,CAAC/d,GAAK2d,WAAYL,EAClB,CAACtd,GAAK4d,eAAgBL,EACtB,CAACvd,GAAK6d,OAAQL,GAG1B,CACA,WAAA3oD,CAAY2K,GACRm2B,QACApwC,KAAK+pD,OAAS9vC,EAAQ8vC,OACtB/pD,KAAK07C,aAAezhC,EAAQyhC,aAC5B17C,KAAKia,QAAU,CACXw+C,uBA5F+B,EA6F/BC,yBA9FgC,EA+FhCC,iBA7FuB,EA8FvBhD,cA7FwB,IA8FxBE,eA7FyB,OA8FtB57C,EAAQse,QAEfv4B,KAAK42D,iBAAmB,IAAIrB,GAAiB,CACzCC,MAAOv7C,EAAQu7C,MACfzL,OAAQ9vC,EAAQ8vC,OAChB9vC,QAAS,CACL07C,cAAe31D,KAAKia,QAAQ07C,cAC5BE,eAAgB71D,KAAKia,QAAQ47C,kBAGrC71D,KAAK44D,sBACAr1B,MAAK,IAAM,GAAIiR,KAAK,uCACpBlR,OAAO9b,GAAU,GAAIA,MAAM,yCAA0CA,KAI1ExnB,KAAK64D,qBAAqBv1B,OAAO9b,GAAU,GAAIA,MAAM,kDAAmDA,IAC5G,CACA,uBAAMsxC,CAAkBzxB,GACpB,MAAM0xB,EAAU/4D,KAAK+pD,OAAOiP,WAC5B,OAAuB,IAAnBD,EAAQt3D,OACD,UAES86B,QAAQgpB,IAAIwT,EAAQz0D,KAAI6oC,MAAOz8B,IAC/C,IACI,aAAa1Q,KAAK+pD,OAAOmM,UAAU92D,IAAIsR,EAC3C,CACA,MAAOuT,GACH,OAAO,IACX,OAGCpX,QAAQ6xB,KAAQA,IAChB7xB,QAAQ6xB,IAAO2I,GAAQ3I,EAAEqpB,UAAU/8B,SAASqc,KAC5Cj5B,MAAK,CAACi7B,EAAMj0B,IAAUshD,GAAYrtB,GAAQqtB,GAAYthD,IAC/D,CACA,wBAAMyjD,GACF,MAAMvjB,QAAkBt1C,KAAK+pD,OAAOmM,UAAU3Q,MACxC0T,EAAe,GACrB,IAAK,MAAMC,KAAY5jB,EACft1C,KAAK+pD,OAAOlD,iBAAiBvtB,MAAMnyB,GAAMA,EAAE4jD,aAAemO,EAASxoD,MAEvEuoD,EAAaz4D,KAAKR,KAAKm5D,YAAYD,EAASxoD,KAEhD,UACU6rB,QAAQgpB,IAAI0T,EACtB,CACA,MAAOzxC,GACH,GAAIA,MAAM,kDAAmDA,EACjE,CACJ,CACA,yBAAMoxC,GACF54D,KAAKo5D,6BACLp5D,KAAKq5D,8BACLr5D,KAAKs5D,iCACLt5D,KAAKu5D,4BACT,CAwCA,cAAMC,CAAS3R,GACX,IAAIJ,EACAP,EACJ,MAAMuS,EAAez5D,KAAK05D,oBAAoB7R,GACxCV,EAAY4F,GAAS0M,GACrBA,EAAapzD,WACbozD,EAAa3E,YACnB90D,KAAK+2D,gCAAkC,EACvC,IAAI4C,EAAc,EAClB,KAAOA,EAAc35D,KAAKia,QAAQw+C,wBAC9B,IACI,GAAIjkB,KAAK,gBAAgBilB,gBAA2BE,EAAc,KAClElS,QAAmBznD,KAAK+pD,OAAO6P,KAAKH,GACpCvS,EAASO,EAAWsD,WACpB,MAAMmN,QAAal4D,KAAKm4D,mBAAmBjR,GAG3ClnD,KAAK+pD,OAAOlD,eAAeK,GAAQ/5C,SAASwqD,IACxCA,EAAKO,KAAOv2D,MAAM4c,KAAK,IAAI+8B,IAAI,IAAIqc,EAAKO,QAASA,IAAO,IAI5Dl4D,KAAK62D,oBAAoBv3D,IAAI4nD,EAAO7gD,YAAa,GAEjDrG,KAAK42D,iBAAiB5vD,MAAMkgD,GAC5B,KACJ,CACA,MAAO1/B,GACCA,aAAiBqyC,eAEjB,GAAIryC,MAAM,sBAAsB2/B,OAAe3/B,EAAML,UAIrD,GAAIK,MAAM,sBAAsB2/B,OAAe3/B,EAAMhb,WAEzDxM,KAAK82D,kBAAkBx3D,IAAI6nD,EAAW3/B,GACtCmyC,IACA35D,KAAK62D,oBAAoBv3D,IAAI6nD,EAAWwS,EAC5C,CAMJ,GAHA35D,KAAK+2D,iCACL/2D,KAAK85D,mBAEDH,IAAgB35D,KAAKia,QAAQw+C,uBAC7B,IACI,MAAMjxC,EAAQxnB,KAAK82D,kBAAkB13D,IAAI+nD,GACzC,GAAI3/B,EAAO,CACP,IAAIq9B,EACAr9B,aAAiBqyC,eACZryC,EAAML,OAGsB,IAAxBK,EAAML,OAAO1lB,OAClB,GAAIyL,KAAK,4CAGT23C,EAAex/B,KAAKE,UAAUiC,EAAML,OAAO,IAN3C,GAAIja,KAAK,4CAUb23C,EAAer9B,EAAMhb,QAEzB,GAAIgoC,KAAK,4BAA4B2S,8BAAsCtC,IAC/E,CACA7kD,KAAK82D,kBAAkBzP,OAAOF,GAC1BD,SACMlnD,KAAK+pD,OAAOmM,UAAU7O,OAAOH,SAGjClnD,KAAK+5D,qBACf,CACA,MAAOvyC,GACH,MAAM,IAAIhpB,MAAM,kCAAkC2oD,uBAA+B3/B,IACrF,CAEJ,IAAKigC,EACD,MAAM,IAAIjpD,MAAM,uBAAuBi7D,KAE3C,OAAOhS,CACX,CAQA,8BAAMuS,CAAyBnS,EAAMoS,GACjC,MAAMR,EAAez5D,KAAK05D,oBAAoB7R,GAC9C,aAAa7nD,KAAK+pD,OAAOmQ,aAAaT,EAAcQ,EACxD,CAMA,mBAAAP,CAAoB7R,GAChB,GAAIkF,GAASlF,GACT,OAAOA,EAEN,CAED,MAAMsS,EAAK,GAAUtS,GAErB,IADkBsS,EAAGrF,YAEjB,MAAM,IAAIt2D,MAAM,6CAEpB,OAAO27D,CACX,CACJ,CACA,yBAAMJ,GACF,GAAI/5D,KAAK+pD,OAAOlD,iBAAiBplD,OAAS,EACtC,OACJ,UAAWzB,KAAK+pD,OAAOmM,UAAU3Q,OAAO9jD,OAAS,EAC7C,OACJ,GAAI+yC,KAAK,wCACT,MAAM4lB,EAAez7D,OAAOsE,OAAOjD,KAAK+pD,OAAOxB,WAAWA,YAAYjvB,MAAMj6B,MACpEA,IAAKA,EAAEgH,WACAhH,EAAEgH,WAAW2kB,SAAS4vB,MAIhCwf,SAECA,EAAaC,WACvB,CACA,gBAAAP,GACI,GAAI95D,KAAKg3D,qBAAqBv1D,OAAS,GACnCzB,KAAK+2D,+BAAiC/2D,KAAKia,QAAQ0+C,iBAAkB,CACrE,MAAMzR,EAASlnD,KAAKg3D,qBAAqB1uD,QACzC,IAAK4+C,EACD,OACJlnD,KAAKm5D,YAAYjS,GAAQ5jB,OAAO9b,IAC5B,GAAIA,MAAMA,EAAM,GAExB,CACJ,CACA,0BAAA4xC,GACIp5D,KAAK+pD,OAAOxF,iBAAiB,iBAAkBvkD,KAAKo3D,gBAAgB,kBACxE,CACA,2BAAAiC,GACIr5D,KAAK+pD,OAAOxF,iBAAiB,eAAgBvkD,KAAKo3D,gBAAgB,gBACtE,CACA,8BAAAkC,GAaIt5D,KAAK+pD,OAAOxF,iBAAiB,kBAAmBvkD,KAAKo3D,gBAAgB,mBACzE,CACA,iBAAM+B,CAAYjS,SACFlnD,KAAKs6D,eAAepT,KAE5BlnD,KAAK+2D,gCAAkC/2D,KAAKia,QAAQ0+C,iBACpD34D,KAAKg3D,qBAAqBx2D,KAAK0mD,SAG7BlnD,KAAKw5D,SAAStS,GACxB,CACAkQ,gBAAkB,CACd,iBAAmB92D,IACV,WACD,MAAQoQ,GAAIw2C,GAAW5mD,EAAIwnD,aACrB9nD,KAAKu6D,uBAAuBrT,GAClC,UACUlnD,KAAKm5D,YAAYjS,EAC3B,CACA,MAAO1/B,GACH,GAAIA,MAAM,sBAAsB0/B,EAAO7gD,gBAAgBmhB,IAC3D,CACH,EATI,EASD,EAER,eAAiBlnB,IACR,WACD,GAAIk0C,KAAK,qBAAqBl0C,EAAIwnD,OAAOzhD,cACzC,MAAM6gD,EAAS5mD,EAAIwnD,OACnB9nD,KAAK42D,iBAAiB5vD,MAAMkgD,UACDlnD,KAAKm4D,mBAAmBjR,IAASl8B,SAASyvB,GAAK2d,WAEzCp4D,KAAK+pD,OAC7BlD,iBACAh6C,QAAQ8qD,GAASA,EAAKO,KAAKltC,SAASyvB,GAAK2d,aAErB32D,OAASzB,KAAKia,QAAQy+C,+BACrC14D,KAAKs3D,eAAepQ,GAG1BlnD,KAAK2sD,cAAc,IAAIE,YAAYnS,GAAwB8f,uBAAwB,CAC/E1S,OAAQZ,KAKhBlnD,KAAK2sD,cAAc,IAAIE,YAAYnS,GAAwB+f,2BAA4B,CACnF3S,OAAQZ,KAGhBlnD,KAAK06D,wBACR,EAzBI,EAyBD,EAER,kBAAoBp6D,IACX,WACDN,KAAK42D,iBAAiBtwC,KAAKhmB,EAAIwnD,QAC/B9nD,KAAK26D,2BACR,EAHI,EAGD,EAER,kBAAmB,KACf36D,KAAK46D,6BAA6B,GAW1C,oBAAMN,CAAepT,GAEjB,GADoBlnD,KAAK+pD,OAAOlD,eAAeK,GAAQzlD,OAAS,EAG5D,OADA,GAAIyL,KAAK,6BAA6Bg6C,EAAO7gD,6BACtC,EAGX,UAD0BrG,KAAK66D,sBAAsB3T,GACnC,CACd,MAAM7L,QAAkBr7C,KAAK86D,iBAAiB5T,EAAQlnD,KAAK+pD,OAAOmM,WAGlE,OAFA,GAAIhpD,KAAK,mBAAmBg6C,EAAO7gD,6BAA6Bg1C,yDAAiEr7C,KAAK07C,6CAE/H,CACX,CAEA,aAD0C17C,KAAK+6D,qCAAqC7T,IAK9DlnD,KAAK62D,oBAAoB53D,IAAIioD,EAAO7gD,cAEtD,GAAI6G,KAAK,QAAQg6C,EAAO7gD,gHACjB,IANP,GAAI6G,KAAK,QAAQg6C,EAAO7gD,uEACjB,EAQf,CAMA,0CAAM00D,CAAqC7T,GAGvC,cAFuBlnD,KAAKm4D,mBAAmBjR,IAClB8T,MAAMC,GAAYA,IAAYxgB,GAAK2d,aAI5Bp4D,KAAK+pD,OACpClD,iBACAh6C,QAAQ8qD,GACFA,EAAKO,KAAK5+B,MAAMv4B,GAASA,IAAS05C,GAAK2d,cAC/C32D,OACkCzB,KAAKia,QAAQy+C,wBACtD,CACA,4BAAM6B,CAAuBrT,GACzB,MAAMgU,SAAqBl7D,KAAKm4D,mBAAmBjR,IAASl8B,SAASyvB,GAAK2d,WAC1Ep4D,KAAK2sD,cAAc,IAAIE,YAAYqO,EAC7BxgB,GAAwBygB,yBACxBzgB,GAAwB0gB,6BAA8B,CACxDtT,OAAQZ,IAEhB,CAIA,wBAAMiR,CAAmBjR,GACrB,IACI,MAAMW,QAAa7nD,KAAK+pD,OAAOmM,UAAU92D,IAAI8nD,GAC7C,OAAOvlD,MAAM4c,KAAKspC,EAAKqQ,KAAKhzD,OAChC,CACA,MAAOsiB,GAEH,OADA,GAAIA,MAAM,sBAAsB0/B,aAAkB1/B,KAC3C,EACX,CACJ,CACA,2BAAMqzC,CAAsB3T,GACxB,MAAM7L,QAAkBr7C,KAAK86D,iBAAiB5T,EAAQlnD,KAAK+pD,OAAOmM,WAElE,OAAK7a,GAEgBD,GAAwBC,GACN2f,MAAMznB,GAAUvzC,KAAK07C,aAAa1wB,SAASuoB,IAEtF,CACA,sBAAMunB,CAAiB5T,EAAQgP,GAC3B,MACMmF,SADanF,EAAU92D,IAAI8nD,IACLmB,SAASjpD,IAAI,aACzC,GAAKi8D,EAEL,OAAO1e,GAAiB0e,EAC5B,CACA,0BAAA9B,GACI,IACI3hC,WAAW2sB,iBAAiB,SAAUvkD,KAAKo3D,gBAAgB,oBAC3Dx/B,WAAW2sB,iBAAiB,UAAWvkD,KAAKo3D,gBAAgB,mBAChE,CACA,MAAO3wC,GACH,GAAIe,MAAM,qCAAqCf,IACnD,CACJ,CACA,yBAAA4wC,GACI,IACIz/B,WAAW6sB,oBAAoB,SAAUzkD,KAAKo3D,gBAAgB,oBAC9Dx/B,WAAW6sB,oBAAoB,UAAWzkD,KAAKo3D,gBAAgB,mBACnE,CACA,MAAO3wC,GACH,GAAIe,MAAM,oCAAoCf,IAClD,CACJ,CACA,sBAAAi0C,GACS16D,KAAKi3D,wBACNj3D,KAAKi3D,uBAAwB,EAC7Bj3D,KAAK46D,8BAEb,CACA,yBAAAD,GACQ36D,KAAKi3D,uBACmC,IAAxCj3D,KAAK+pD,OAAOlD,iBAAiBplD,SAC7BzB,KAAKi3D,uBAAwB,EAC7Bj3D,KAAK46D,8BAEb,CACA,2BAAAA,GACI56D,KAAK2sD,cAAc,IAAIE,YAAYlS,GAAuB2gB,kBAAmB,CACzExT,OAAQ9nD,KAAKk3D,gBAErB,EC1hBJ,MAAM,GAAM,IAAI7Z,GAAO,YACVke,GAAgB,2BAC7B,MAAMC,WAAiBlT,GACnB5M,aACA+f,iBACAC,oBAAsB,IAAI7tB,IAC1B,WAAAv+B,CAAYosC,EAAcqO,GACtB3Z,MAAMmrB,GAAexR,EAAOxB,WAAY7M,GACxC17C,KAAK07C,aAAeA,EACpB17C,KAAKy7D,iBAAmB1R,EACnBA,EAAO4R,UAAU1R,OAAOsR,IAAgBzQ,IACpC9qD,KAAKkqD,UAAUY,EAAW,GAEvC,CAIA,WAAMrV,CAAMyR,GACR,MAAMltB,EAAU,GAAmC9kB,OAAO0mC,GAAwB57C,KAAK07C,eAEvF,UADmB17C,KAAKy7D,iBAAiBvF,UAAU92D,IAAI8nD,GAEnD,MAAO,CACH7L,UAAW,KACX7zB,MAAO7C,GAAci3C,mBAG7B,IAAIxV,EACJ,IACIA,QAAepmD,KAAKinD,UAAUC,EAClC,CACA,MAAO1/B,GAEH,OADA,GAAIA,MAAM,uBAAwBA,GAC3B,CACH6zB,UAAW,KACX7zB,MAAO7C,GAAc8lC,oBAE7B,CACA,MAAMoR,QAAwBlW,GAAK,CAAC3rB,GAAU,GAAWosB,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,MAClG,MAAEqhB,EAAK,UAAE6zB,GAAcr7C,KAAK87D,uBAAuBD,GACzD,OAAIr0C,EACO,CACH6zB,UAAW,KACX7zB,gBAGFxnB,KAAK+7D,kBAAkB7U,EAAQ7L,GAC9B,CACHA,YACA7zB,MAAO,MAEf,CACA,+BAAMw0C,CAA0B9U,GAC5B,MAAM7L,EAAYr7C,KAAK07D,oBAAoBt8D,IAAI8nD,EAAO7gD,YACtD,OAAIg1C,EACO,CACHA,YACA7zB,MAAO,YAGFxnB,KAAKy1C,MAAMyR,EAC5B,CAIA,eAAMgD,CAAUY,GACZ,IACI,MAAM,OAAE1E,EAAM,WAAEqB,GAAeqD,EACzBmR,EAAmB,GAAoC/mD,OAAO0mC,GAAwB57C,KAAK07C,eAC3FmgB,QAAwBlW,GAAK,CAACsW,GAAmB,GAAW7V,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,MAC3G,MAAEqhB,EAAK,UAAE6zB,GAAcr7C,KAAK87D,uBAAuBD,GACzD,GAAIr0C,EACA,aAEExnB,KAAK+7D,kBAAkBtU,EAAWsD,WAAY1P,EACxD,CACA,MAAO7zB,GACH,GAAIA,MAAM,kCAAmCA,EACjD,CACJ,CACA,sBAAAs0C,CAAuBD,GACnB,MAAM/sD,EAAQ,IAAIkwC,GAClB6c,EAAgB1uD,SAASkQ,IACrBvO,EAAMqwC,OAAO9hC,EAAM,IAEvB,MAAMgT,EAAW,GAAoCrU,OAAOlN,GAC5D,OAAKuhB,EAOE,CACHgrB,UAAWhrB,EACX7I,MAAO,OARP,GAAIA,MAAM,oCACH,CACH6zB,UAAW,KACX7zB,MAAO7C,GAAcgnC,eAOjC,CACA,uBAAMoQ,CAAkB7U,EAAQ7L,SAEtBr7C,KAAKy7D,iBAAiBvF,UAAU7yC,MAAM6jC,EAAQ,CAChDmB,SAAU,CACNhN,UAAW4B,GAAiB5B,MAGpCr7C,KAAK07D,oBAAoBp8D,IAAI4nD,EAAO7gD,WAAYg1C,EACpD,EAEG,SAAS6gB,GAAaxgB,GACzB,OAAQ6M,GAAe,IAAIiT,GAAS9f,EAAc6M,EACtD,CC9GO,SAAS7T,GAAYV,EAAaxnC,GACrC,MAAM2vD,EAAmB,GAAYnoB,GAC/BooB,EAAoB,GAAY5vD,EAAQ4lC,cACxCiqB,EAUV,SAAoCrpB,GAChC,IAAKA,EACD,OAEJ,IAAIspB,EAOJ,OALIA,EADqB,iBAAdtpB,EACWA,EAG8B,SAA9B/M,OAAO+M,EAAUoL,WvDfpC,SAAuBp/C,GAC1B,MAAM0T,EAAS,IAAIb,YAAY,GACzBumC,EAAO,IAAInB,SAASvkC,GAO1B,MANqB,iBAAV1T,EACPo5C,EAAK8I,WAAW,EAAGliD,GAAO,GAG1Bo5C,EAAK0I,YAAY,EAAG9hD,GAAO,GAExB,IAAIiR,WAAWyC,EAC1B,CuDOW6pD,CAAcD,EACzB,CAtB2BE,CAA2BhwD,EAAQwmC,WACpDlkC,EAAQ,GAAO,CACjBqtD,EACA3vD,EAAQumC,QACRqpB,EACA5vD,EAAQymC,KACRopB,GACFxvD,OAAOmlC,KACT,OAAO,GAAOljC,EAClB,CAcO,SAAS2tD,GAAezoB,EAAaxnC,GACxC,MAAMY,EAAOsnC,GAAYV,EAAaxnC,GAEtC,OADgB,GAAWY,EAE/B,CCjCO,MAAMsvD,GAKTC,QAAU,GACVC,WAAY,EACZ5oB,YACAzb,OACAwxB,OACAl9C,OACAgwD,YACAlU,kBACAmU,oBACAC,oBACAC,mBAAqB,IAAInvB,IACzBovB,yBAA2B,IAAI3hB,IAC/B4hB,iBAAmB,IAAI5hB,IACvB6hB,cAAgB,IAAI7hB,IACpB,WAAAhsC,CAAY2K,GACRja,KAAKu4B,OAASte,EAAQse,OACtBv4B,KAAK2oD,kBAAoB1uC,EAAQ0uC,kBACjC3oD,KAAK6M,OAASoN,EAAQpN,OACtB7M,KAAK68D,YAAc5iD,EAAQ4iD,YAC3B78D,KAAK+pD,OAAS9vC,EAAQ8vC,OACtB/pD,KAAK88D,oBAAsB7iD,EAAQ6iD,oBACnC98D,KAAKg0C,YAAc/5B,EAAQ+5B,YAC3Bh0C,KAAKo9D,mBAAqBp9D,KAAKo9D,mBAAmBhhC,KAAKp8B,MACvDA,KAAKq9D,gBAAkBr9D,KAAKq9D,gBAAgBjhC,KAAKp8B,MACjDA,KAAKs9D,mBAAqBt9D,KAAKs9D,mBAAmBlhC,KAAKp8B,KAC3D,CAIA,wBAAIu9D,GACA,MAAO,gCAAgCv9D,KAAK+pD,OAAO7C,OAAO7gD,iBAC9D,CAMA,KAAAW,GACQhH,KAAK48D,YAGT58D,KAAK48D,WAAY,EACjB58D,KAAKw9D,iBACLx9D,KAAKy9D,0BACLz9D,KAAKq5D,8BACT,CAIA,IAAA/yC,GACStmB,KAAK48D,YAGV58D,KAAK48D,WAAY,EACjB58D,KAAK09D,gBACL19D,KAAK29D,yBACL39D,KAAK49D,6BACT,CAKA,cAAM5E,GAIF,OAHKh5D,KAAK48D,YACN58D,KAAK28D,QAAU38D,KAAK68D,YAAY7D,YAE7Bh5D,KAAK28D,OAChB,CASA,qBAAAkB,CAAsB3W,EAAQ16C,GAC1B,MAAMY,EAAOpN,KAAK89D,iBAAiBtxD,GAGnC,OAFAxM,KAAKm9D,cAAcngD,IAAIkqC,GACvBlnD,KAAKi9D,yBAAyBjgD,IAAI,GAAGkqC,KAAU95C,OAC3CpN,KAAKk9D,iBAAiBj+D,IAAImO,KAG9BpN,KAAKk9D,iBAAiBlgD,IAAI5P,IACnB,EACX,CACA,gBAAA0wD,CAAiBtxD,GACb,OAAOiwD,GAAez8D,KAAKg0C,YAAaxnC,EAC5C,CACA,uBAAAixD,GACIz9D,KAAK2oD,kBAAkBpE,iBAAiB5J,GAAuB2gB,kBAAmBt7D,KAAKo9D,mBAC3F,CACA,sBAAAO,GACI39D,KAAK2oD,kBAAkBlE,oBAAoB9J,GAAuB2gB,kBAAmBt7D,KAAKo9D,mBAC9F,CACA,wBAAMA,EAAqBtV,OAAQoP,IAC1BA,SAIC36B,QAAQgpB,IAAIvlD,KAAK28D,QAAQr4D,KAAKoM,GAAO1Q,KAAK6qD,KAAKn6C,GAAI,MACzD1Q,KAAKw9D,kBAJDx9D,KAAK09D,eAKb,CACA,cAAAF,GACQx9D,KAAK+8D,sBAGT/8D,KAAK+8D,oBAAsB/G,aAAY,KAC9Bh2D,KAAK28D,QAAQr4D,KAAKoM,GAAO1Q,KAAK6qD,KAAKn6C,IAAI,GAC7C1Q,KAAKu4B,OAAOwlC,qBACnB,CACA,aAAAL,GACS19D,KAAK+8D,sBAGV1G,cAAcr2D,KAAK+8D,qBACnB/8D,KAAK+8D,yBAAsB79D,EAC/B,CACA,2BAAAm6D,GACIr5D,KAAK+pD,OAAOxF,iBAAiB,eAAgBvkD,KAAKq9D,iBAClDr9D,KAAK+pD,OAAOxF,iBAAiB,kBAAmBvkD,KAAKs9D,mBACzD,CACA,0BAAAM,GACI59D,KAAK+pD,OAAOtF,oBAAoB,eAAgBzkD,KAAKq9D,iBACrDr9D,KAAK+pD,OAAOtF,oBAAoB,kBAAmBzkD,KAAKs9D,mBAC5D,CAEA,qBAAMD,CAAgBW,GAEGh+D,KAAK28D,QAAQl7D,OAAS,IAI3CzB,KAAK28D,QAAU38D,KAAK68D,YAAY7D,iBAC1Bz8B,QAAQgpB,IAAIvlD,KAAK28D,QAAQr4D,KAAKoM,GAAO1Q,KAAKszC,UAAU5iC,MAC9D,CAEA,wBAAM4sD,CAAmBn9D,IACGH,KAAK28D,QAAQrjC,MAAM5oB,GAAOA,EAAG49B,OAAOnuC,EAAM2nD,YAIlE9nD,KAAK28D,QAAU38D,KAAK68D,YAAY7D,iBAG1Bz8B,QAAQgpB,IAAIvlD,KAAK28D,QAAQr4D,KAAKoM,GAAO1Q,KAAKszC,UAAU5iC,MAC9D,CACA,eAAM4iC,CAAU2qB,GACZ,IAAI/W,EAAS+W,EACb,IAAK,IAAI18D,EAAI,EAAGA,EA3JO,EA2JqBA,IAAK,CAC7C,IAAK2lD,EACD,OAGJ,UADuBlnD,KAAK6M,OAAOymC,UAAUtzC,KAAKg0C,YAAakT,EAAQvlD,MAAM4c,KAAKve,KAAK88D,oBAAoB53D,UAC9FklD,QACT,OAEJlD,EAASlnD,KAAK68D,YAAYqB,aAAahX,EAC3C,CACJ,CACA,UAAM2D,CAAK3D,EAAQiX,GAAmB,GAClC,MAAMhX,EAAYD,EAAO7gD,WACnBgqB,QAAiBrwB,KAAK6M,OAAOg+C,KAAK3D,GACxC,GAAI72B,EAASg6B,SAAW8T,EAAxB,CACI,MAAMC,EAAUp+D,KAAK68D,YAAYqB,aAAahX,SACxClnD,KAAKszC,UAAU8qB,EAEzB,KAJA,CAKA,GAAI/tC,EAASg6B,QAAS,CAClB,MAAMxhD,EAAO7I,KAAKg9D,mBAAmB59D,IAAI+nD,IAAc,EACvDnnD,KAAKg9D,mBAAmB19D,IAAI6nD,EAAWt+C,EAAO,EAClD,CAKA,GAJIwnB,EAAS+5B,SACTpqD,KAAKg9D,mBAAmB19D,IAAI6nD,EAAW,IAEtBnnD,KAAKg9D,mBAAmB59D,IAAI+nD,IAAc,IAC3CnnD,KAAKu4B,OAAO8lC,uBAAwB,CACpD,MAAMD,EAAUp+D,KAAK68D,YAAYqB,aAAahX,SACxClnD,KAAKszC,UAAU8qB,EACzB,CAZA,CAaJ,ECzLJ,MAAM,GAAM,IAAI/gB,GAAO,2BAChB,MAAMihB,GACTtqB,YACAkU,SACA3vB,OACAgmC,QACAC,sBAAwB,IAAI3wB,IAC5B,WAAAv+B,CAAY0kC,EAAakU,EAAUS,EAAmBkU,EAAa9S,EAAQxxB,EAAQkmC,GAC/Ez+D,KAAKg0C,YAAcA,EACnBh0C,KAAKkoD,SAAWA,EAChBloD,KAAKu4B,OAASA,EACdv4B,KAAKg0C,YAAcA,EACnBh0C,KAAKu+D,QAAU,IAAI7B,GAAoB,CACnC1oB,cACAzb,SACAwxB,SACApB,oBACA97C,OAAQq7C,EACR2U,cACA4B,YACA3B,oBAAqB98D,KAAKw+D,uBAElC,CACA,eAAMlrB,CAAUlK,EAAUxZ,GACtB,MAAM8uC,EAAgB/8D,MAAM2Q,QAAQ82B,GAAYA,EAAW,CAACA,GAE5D,IAAK,MAAMxY,KAAW8tC,EAClB,GAAI9tC,EAAQojB,cAAgBh0C,KAAKg0C,YAC7B,MAAO,CACH2qB,SAAU,CACN,CACIn3C,MAAO7C,GAAci6C,yBAG7BC,UAAW,IAInB7+D,KAAKu4B,OAAOumC,4BACZJ,EAAcl+D,KAAKg+C,GAAcx+C,KAAKu+D,QAAQhB,qBAAsBv9D,KAAKg0C,cAE7E,MAAM+qB,EAAsB9sB,GAAoBysB,GAC1CzqB,EAAgBtyC,MAAM4c,KAAKwgD,EAAoB75D,QAE/C85D,SADch/D,KAAKu+D,QAAQvF,YACV10D,KAAI6oC,MAAO0a,GACvB7nD,KAAKkoD,SAAS5U,UAAUtzC,KAAKg0C,YAAa6T,EAAM5T,KAErDgrB,QAAgB1iC,QAAQ2iC,WAAWF,GACnCG,EAAcn/D,KAAKo/D,aAAaH,EAAS,aAoB/C,OAhBAF,EAAoB5xD,SAAQ,CAACi8B,EAAUgJ,KAGnC,MAAMitB,EAAuB,CACzBj2B,WACAxZ,YAGAwiB,IAAiBpyC,KAAKu+D,QAAQhB,sBAKlCv9D,KAAKw+D,sBAAsBl/D,IAAI8yC,EAAcitB,EAAqB,IAEtEr/D,KAAKu+D,QAAQv3D,QACNm4D,CACX,CACA,iBAAM3U,CAAYvW,GACd,MACM+qB,SADch/D,KAAKu+D,QAAQvF,YACV10D,KAAI6oC,MAAO0a,IAC9B,MAAMx3B,QAAiBrwB,KAAKkoD,SAASsC,YAAYxqD,KAAKg0C,YAAa6T,EAAM5T,GAIzE,OAHAA,EAAc9mC,SAASilC,IACnBpyC,KAAKw+D,sBAAsBnX,OAAOjV,EAAa,IAE5C/hB,CAAQ,IAEb4uC,QAAgB1iC,QAAQ2iC,WAAWF,GACnCG,EAAcn/D,KAAKo/D,aAAaH,EAAS,eAI/C,OAHwC,IAApCj/D,KAAKw+D,sBAAsB//D,MAC3BuB,KAAKu+D,QAAQj4C,OAEV64C,CACX,CACA,UAAMtU,GACF,MACMmU,SADch/D,KAAKu+D,QAAQvF,YACV10D,KAAKujD,GAAS7nD,KAAKkoD,SAAS2C,KAAKhD,KAClDoX,QAAgB1iC,QAAQ2iC,WAAWF,GACzC,OAAOh/D,KAAKo/D,aAAaH,EAAS,OACtC,CACA,oBAAMtU,GACF,MACMqU,SADch/D,KAAKu+D,QAAQvF,YACV10D,KAAI6oC,MAAO0a,GAAS7nD,KAAKkoD,SAASyC,eAAe3qD,KAAKg0C,YAAa6T,KACpFoX,QAAgB1iC,QAAQ2iC,WAAWF,GACzCh/D,KAAKw+D,sBAAsBj/D,QAC3B,MAAM4/D,EAAcn/D,KAAKo/D,aAAaH,EAAS,kBAE/C,OADAj/D,KAAKu+D,QAAQj4C,OACN64C,CACX,CACA,4BAAMG,CAAuB9yD,EAAS26C,GAElC,GADiBnnD,KAAKu+D,QAAQV,sBAAsB1W,EAAW36C,GAG3D,YADA,GAAIgoC,KAAK,sCAGb,MAAM,aAAEpC,GAAiB5lC,EACnB6yD,EAAuBr/D,KAAKw+D,sBAAsBp/D,IAAIgzC,GACvDitB,GAIL,GAAI7qB,KAAK,yCAA0CpC,EAAc,oBAAqBpyC,KAAKg0C,mBAuBnG7G,eAA2BkyB,EAAsBrrB,EAAaxnC,GAC1D,MAAM,SAAE48B,EAAQ,SAAExZ,GAAayvC,GACzB,aAAEjtB,GAAiB5lC,EACzB,GAAK4lC,EAIL,IACI,MAAMmtB,EAAiBn2B,EAAS9kC,KAAKk7D,GAAQA,EACxCjhB,aAAavK,EAAaxnC,GAC1B+2B,MAAMk8B,GAAYA,GAAWljC,QAAQC,OAAO,uBAC3CkjC,QAAuBnjC,QAAQojC,IAAIJ,SACnC3vC,EAAS8vC,EACnB,CACA,MAAOz7C,GACH,GAAIuD,MAAM,yBAA0BvD,EACxC,MAZI,GAAI/W,KAAK,yCAajB,CAvCc0yD,CAAYP,EAAsBr/D,KAAKg0C,YAAaxnC,IAJtD,GAAIgb,MAAM,0CAA2C4qB,EAK7D,CACA,YAAAgtB,CAAaH,EAAS95D,GAClB,MAAM2P,EAAS,CAAE6pD,SAAU,GAAIE,UAAW,IAC1C,IAAK,MAAMgB,KAAiBZ,EACxB,GAA6B,aAAzBY,EAAczvC,OACd,GAAI5I,MAAM,qBAAqBriB,2BAA+B06D,EAAcC,QAC5EhrD,EAAO6pD,SAASn+D,KAAK,CAAEgnB,MAAO7C,GAAc2lC,mBAE3C,CACD,MAAMyV,EAAaF,EAAc7gE,MAC7B+gE,EAAW1V,QACXv1C,EAAO6pD,SAASn+D,KAAKu/D,EAAW1V,SAGhCv1C,EAAO+pD,UAAUr+D,KAAKu/D,EAAW3V,QAEzC,CAEJ,OAAOt1C,CACX,EC1IG,MCKD,GAAM,IAAIuoC,GAAO,cAChB,MAAM2iB,GACT9X,SACA3vB,OACAowB,kBACAoB,OACA8S,YACA4B,UACA3B,oBAAsB,IAAIjvB,IAC1B,WAAAv+B,CAAY+sB,GCbW,IAAC9D,EDcpBv4B,KAAKu4B,QCdeA,EDcM8D,EAAOpiB,QCb9B,CACH8jD,oBAAqBxlC,GAAQwlC,qBFHH,IEI1BM,uBAAwB9lC,GAAQ8lC,wBFHP,EEIzBS,2BAA4BvmC,GAAQumC,6BFHG,ICcvC9+D,KAAKy+D,UAAYpiC,EAAOoiC,UACxBz+D,KAAK68D,YAAcxgC,EAAOwgC,YAC1B78D,KAAK+pD,OAAS1tB,EAAO0tB,OACrB/pD,KAAK2oD,kBAAoBtsB,EAAOssB,kBAChC3oD,KAAKkoD,SAAW,IAAI0B,IAAWzc,MAAO6G,EAAaM,EAAa6S,KAC5D,MAAM8Y,EAAejgE,KAAKkgE,sBAAsBlsB,GAC3CisB,QAICA,EAAaX,uBAAuBhrB,EAAa6S,GAHnD,GAAI3/B,MAAM,gDAAgDwsB,IAGG,GAClE3X,EAAOssB,kBAAkBjN,aAAcrf,EAAO0tB,QACjD/pD,KAAK88D,oBAAsB,IAAIjvB,GACnC,CAsCA,eAAMyF,CAAUlK,EAAUxZ,GACtB,MAAMuwC,EAAqBngE,KAAKogE,sBAAsBh3B,GACtD,GAAkC,IAA9B+2B,EAAmB1+D,OACnB,MAAO,CACHw+D,aAAc,KACdz4C,MAAO7C,GAAc07C,uBACrBpB,QAAS,MAGjB,MAAMjrB,EAAcmsB,EAAmB,IACjC,aAAEF,EAAY,MAAEz4C,SAAgBxnB,KAAKsgE,mBAAmBtsB,GAC9D,GAAIxsB,EACA,MAAO,CACHy4C,aAAc,KACdz4C,MAAOA,EACPy3C,QAAS,MAGjB,MAAM,SAAEN,EAAQ,UAAEE,SAAoBoB,EAAa3sB,UAAUlK,EAAUxZ,GACvE,MAAO,CACHqwC,eACAz4C,MAAO,KACPy3C,QAAS,CACLN,SAAUA,EACVE,UAAWA,GAGvB,CAOA,wBAAMyB,CAAmB7jB,GACrB,MAAMzI,EAA6C,iBAAxByI,EACrBA,EACArB,GAAwBqB,KAAwB,GACtDV,GAA8B/H,EAAah0C,KAAKkoD,SAASxM,cACzD,MAAMihB,EAAU38D,KAAK68D,YAAY7D,WACjC,OAAuB,IAAnB2D,EAAQl7D,OACD,CACH+lB,MAAO7C,GAAci3C,kBACrBqE,aAAc,OAGtB,GAAIzrB,KAAK,qCAAqCmoB,EAAQl7D,iBAAkBk7D,EAAQr4D,KAAKoM,GAAOA,EAAGrK,cAGxF,CACHmhB,MAAO,KACPy4C,aAJiBjgE,KAAKkgE,sBAAsBlsB,IAC5Ch0C,KAAKugE,sBAAsBvsB,EAAa,IAAIsqB,GAAatqB,EAAah0C,KAAKkoD,SAAUloD,KAAK2oD,kBAAmB3oD,KAAK68D,YAAa78D,KAAK+pD,OAAQ/pD,KAAKu4B,OAAQv4B,KAAKy+D,aAKtK,CAgBA,8BAAM+B,CAAyBp3B,EAAUxZ,GACrC,MAAMuwC,EAAqBngE,KAAKogE,sBAAsBh3B,GACtD,GAAkC,IAA9B+2B,EAAmB1+D,OACnB,MAAMjD,MAAM,mEAEhB,GAAI2hE,EAAmB1+D,OAAS,EAC5B,MAAMjD,MAAM,iHAEhB,MAAM,aAAEyhE,EAAY,MAAEz4C,SAAgBxnB,KAAKsgE,mBAAmBH,EAAmB,IACjF,GAAI34C,EACA,MAAMhpB,MAAM,kCAAkCgpB,WAE5Cy4C,EAAa3sB,UAAUlK,EAAUxZ,GACvC,MAAMqkB,EAAgBtyC,MAAM4c,KAAK0zB,GAAoBtwC,MAAM2Q,QAAQ82B,GAAYA,EAAW,CAACA,IAAWlkC,QACtG,OAAOioC,gBACG8yB,EAAazV,YAAYvW,EAAc,CAErD,CACA,sBAAAwsB,CAAuBr3B,GACnB,OvElJD+D,eAA+BuzB,EAAU9vC,EAAS+vC,GACrD,MACMjtB,EAAW,GACjB,IAAI8W,EACJA,QAAoBkW,EAASF,yBAAyB5vC,GAAUpkB,IAC5DknC,EAASlzC,KAAKgM,EAAQ,IAE1B,MAAMo0D,EAAgBr2D,OAAO4P,UAAUwmD,GAAiBE,WAElDC,EAAYt2D,KAAKu2D,MAiBvB,MAAO,CACH7hB,SAjBJ/R,kBACI,OAAa,CACT,GAAIyzB,GAAiBp2D,KAAKu2D,MAAQD,GAJM,EAKpC,aAEEzuB,GAxBC,IAyBP,MAAM7lC,EAAUknC,EAASprC,QACzB,IAAKkiD,GAAmC,IAApB9W,EAASjyC,OACzB,OAAO+K,GAENA,GAAWg+C,UAGVh+C,EACV,CACJ,CAEc0yC,GACV,UAAM54B,GACEkkC,UACMA,IACNA,OAActrD,EAEtB,EAER,CuE+Ge8hE,CAAgBhhE,KAAMopC,EACjC,CACA,qBAAA82B,CAAsBlsB,GAClB,OAAOh0C,KAAK88D,oBAAoB19D,IAAI40C,EACxC,CACA,qBAAAusB,CAAsBvsB,EAAaisB,GAE/B,OADAjgE,KAAK88D,oBAAoBx9D,IAAI00C,EAAaisB,GACnCA,CACX,CACA,qBAAAG,CAAsBh3B,GAClB,IAAKznC,MAAM2Q,QAAQ82B,GACf,MAAO,CAACA,EAAS4K,aAErB,GAAwB,IAApB5K,EAAS3nC,OACT,MAAO,GAEX,MAAMi6C,EAAe,IAAIJ,IAAIlS,EAAS9kC,KAAKmY,GAAMA,EAAEu3B,eACnD,MAAO,IAAI0H,EACf,EE7KG,MAAMulB,GACTC,MACAC,kBAAoB,KACpBC,gBAAkB,IAAIvzB,IAMtB,WAAAv+B,CAAY4xD,EAAOG,EAAoB,KACnCrhE,KAAKkhE,MAAQA,EACblhE,KAAKshE,qBAAqBD,EAC9B,CACA,OAAAE,GACmC,OAA3BvhE,KAAKmhE,oBACL9K,cAAcr2D,KAAKmhE,mBACnBnhE,KAAKmhE,kBAAoB,MAE7BnhE,KAAKohE,gBAAgB7hE,OACzB,CACA,GAAAyd,CAAIyhC,GAEA,OADAz+C,KAAKohE,gBAAgB9hE,IAAIm/C,EAAOj0C,KAAKu2D,OAC9B/gE,IACX,CACA,GAAAf,CAAIw/C,GACA,OAAOz+C,KAAKohE,gBAAgBniE,IAAIw/C,EACpC,CACA,oBAAA6iB,CAAqBE,GACjBxhE,KAAKmhE,kBAAoBnL,aAAY,KACjCh2D,KAAKyhE,sBAAsB,GAC5BD,EACP,CACA,oBAAAC,GACI,MAAMV,EAAMv2D,KAAKu2D,MACjB,IAAK,MAAOtiB,EAAOzL,KAAchzC,KAAKohE,gBAAgBjR,UAC9C4Q,EAAM/tB,EAAYhzC,KAAKkhE,OACvBlhE,KAAKohE,gBAAgB/Z,OAAO5I,EAGxC,ECnCJ,MAAM,GAAM,IAAIpB,GAAO,2BAChB,MAAM,GACT0M,OACA/V,YACAkU,SACA2U,YACAtkC,OACAqkC,WAAY,EACZ8E,YAAa,EACbC,MAAQ,IAAIrmB,IACZsmB,aAAe,IAAI/zB,IACnBqvB,iBAAmB,IAAI+D,GAAO,KAC9BY,UAAY,IAAIh0B,IAChBi0B,eAAiB,IAAIrV,GACrBsV,yBAA2B,IAAIzmB,IAC/B0mB,2BAA6B,IAAI1mB,IACjC2mB,oBAAsB,KACtBlF,oBAAsB,KACtB,iBAAI9oB,GACA,MAAMiuB,EAAYvgE,MAAM4c,KAAKve,KAAK6hE,UAAU38D,QAAQZ,KAAKo0B,GAAMA,EAAE0Z,eAC3D+vB,EAAe,IAAI7mB,IAAI4mB,GAAWj/D,SACxC,OAAOtB,MAAM4c,KAAK4jD,EACtB,CACA,WAAA7yD,CAAY+sB,GACRr8B,KAAKu4B,OAAS8D,EAAO9D,OACrBv4B,KAAKg0C,YAAc3X,EAAO2X,YAC1Bh0C,KAAK+pD,OAAS1tB,EAAO0tB,OACrB/pD,KAAKkoD,SAAW7rB,EAAO6rB,SACvBloD,KAAK68D,YAAcxgC,EAAOwgC,YAC1B78D,KAAKq9D,gBAAkBr9D,KAAKq9D,gBAAgBjhC,KAAKp8B,MACjDA,KAAKs9D,mBAAqBt9D,KAAKs9D,mBAAmBlhC,KAAKp8B,KAC3D,CACA,KAAAgH,GACI,GAAIwtC,KAAK,0CAA0Cx0C,KAAKg0C,eACpDh0C,KAAK48D,WAAa58D,KAAK0hE,WACvB,GAAIltB,KAAK,gEAGbx0C,KAAK0hE,YAAa,EACb1hE,KAAKoiE,iBAAiB,CACvBC,qBAAqB,IAEzBriE,KAAKsiE,4BACLtiE,KAAKuiE,yBACLviE,KAAKwiE,sBACLxiE,KAAK48D,WAAY,EACjB58D,KAAK0hE,YAAa,EAClB,GAAIltB,KAAK,yCAAyCx0C,KAAKg0C,eAC3D,CACA,IAAA1tB,GACI,GAAIkuB,KAAK,0CAA0Cx0C,KAAKg0C,eACnDh0C,KAAK48D,YAAa58D,KAAK0hE,YAI5B1hE,KAAK0hE,YAAa,EAClB1hE,KAAKyiE,wBACLziE,KAAK0iE,mBACA1iE,KAAK2iE,eACV3iE,KAAK4iE,kBACL5iE,KAAKk9D,iBAAiBqE,UACtBvhE,KAAK0hE,YAAa,EAClB1hE,KAAK48D,WAAY,EACjB,GAAIpoB,KAAK,yCAAyCx0C,KAAKg0C,gBAXnD,GAAIQ,KAAK,8DAYjB,CACA,OAAA0O,GACI,OAA+B,IAAxBljD,KAAK6hE,UAAUpjE,IAC1B,CACA,SAAMue,CAAI4T,EAAShB,GACf,MAAMwZ,EAAWznC,MAAM2Q,QAAQse,GAAWA,EAAU,CAACA,GACrD,IAAK,MAAMA,KAAWwY,EAClBppC,KAAK6iE,UAAUjyC,EAAShB,GAE5B,QAAO5vB,KAAK+hE,yBAAyBtjE,KAAO,UAChCuB,KAAKoiE,iBAAiB,CAAEC,qBAAqB,GAE7D,CACA,YAAMljE,CAAOyxB,GACT,MAAMwY,EAAWznC,MAAM2Q,QAAQse,GAAWA,EAAU,CAACA,GACrD,IAAK,MAAMA,KAAWwY,EAClBppC,KAAK8iE,aAAalyC,GAEtB,QAAO5wB,KAAKgiE,2BAA2BvjE,KAAO,UAClCuB,KAAK+iE,mBAAmB,CAAEV,qBAAqB,GAE/D,CACA,MAAAW,CAAOx2D,EAASyxD,GACRj+D,KAAKijE,kBAAkBz2D,GACvB,GAAIgoC,KAAK,yEAAyEx0C,KAAKg0C,uBAAuBiqB,EAAQ53D,4BAA4BmG,EAAQ4lC,iBAG9J,GAAIoC,KAAK,sCAAsChoC,EAAQ4lC,gBACvDpyC,KAAK8hE,eAAenV,cAAc,IAAIE,YAAYrgD,EAAQ4lC,aAAc,CACpE0V,OAAQt7C,KAEhB,CACA,SAAAq2D,CAAUjyC,EAAShB,GACf,GAAI4kB,KAAK,yCAAyC5jB,EAAQwhB,gBAC1D,MAAM8wB,GAAqBljE,KAAKi0C,cAAcjpB,SAAS4F,EAAQwhB,cAI/D,GAHI8wB,GACAljE,KAAK+hE,yBAAyB/kD,IAAI4T,EAAQwhB,cAE1CpyC,KAAK6hE,UAAU5iE,IAAI2xB,GAAU,CAC7B,GAAI1jB,KAAK,0EAA0E0jB,EAAQojB,gCAAgCpjB,EAAQwhB,gBACnI,MAAMxiB,EAAW5vB,KAAK6hE,UAAUziE,IAAIwxB,GACpC5wB,KAAK6hE,UAAUxa,OAAOz2B,GACtB5wB,KAAK8hE,eAAerd,oBAAoB7zB,EAAQwhB,aAAcxiB,EAClE,CACA,MAAMuzC,EAAgBhjE,IACb,WACD,IACI,MAAMqM,QAAgBokB,EAAQ2tB,aAAa3tB,EAAQojB,YAAa7zC,EAAM2nD,QACjEl4B,EAASpjB,EAClB,CACA,MAAOia,GACH,GAAIe,MAAM,yBAA0Bf,EACxC,CACH,EARI,EAQD,EAERzmB,KAAK6hE,UAAUviE,IAAIsxB,EAASuyC,GAC5BnjE,KAAK8hE,eAAevd,iBAAiB3zB,EAAQwhB,aAAc+wB,GAC3D,GAAI3uB,KAAK,wCAAwC5jB,EAAQwhB,oCAAoC8wB,IACjG,CACA,YAAAJ,CAAalyC,GACT,GAAI4jB,KAAK,2CAA2C5jB,EAAQwhB,gBAC5D,MAAMxiB,EAAW5vB,KAAK6hE,UAAUziE,IAAIwxB,GAC/BhB,GACD,GAAI1iB,KAAK,wDAAwD0jB,EAAQojB,gCAAgCpjB,EAAQwhB,gBAErHpyC,KAAK6hE,UAAUxa,OAAOz2B,GACtB5wB,KAAK8hE,eAAerd,oBAAoB7zB,EAAQwhB,aAAcxiB,GAC9D,MAAMwzC,GAAuBpjE,KAAKi0C,cAAcjpB,SAAS4F,EAAQwhB,cAC7DgxB,GACApjE,KAAKgiE,2BAA2BhlD,IAAI4T,EAAQwhB,cAEhD,GAAIoC,KAAK,0CAA0C5jB,EAAQwhB,sCAAsCgxB,IACrG,CACA,iBAAAH,CAAkBz2D,GACd,IACI,MAAMkoC,EAAc+nB,GAAez8D,KAAKg0C,YAAaxnC,GACrD,GAAIxM,KAAKk9D,iBAAiBj+D,IAAIy1C,GAC1B,OAAO,EAEX10C,KAAKk9D,iBAAiBlgD,IAAI03B,EAC9B,CACA,MAAOzwB,GAEP,CACA,OAAO,CACX,CACA,yBAAAq+C,GAEI,GAAI9tB,KAAK,uDACTx0C,KAAKiiE,oBAAsBjM,aAAY,KACvB7oB,WACJntC,KAAK+hE,yBAAyBtjE,KAAO,IACrC,GAAI+1C,KAAK,0BAA0Bx0C,KAAK+hE,yBAAyBtjE,kCACrDuB,KAAKoiE,iBAAiB,CAAEC,qBAAqB,KAEzDriE,KAAKgiE,2BAA2BvjE,KAAO,IACvC,GAAI+1C,KAAK,0BAA0Bx0C,KAAKgiE,2BAA2BvjE,oCACvDuB,KAAK+iE,mBAAmB,CAAEV,qBAAqB,IAC/D,EAECgB,EAAK,GAbwB,IAe1C,CACA,sBAAAd,GACI,GAAI/tB,KAAK,8CAA8Cx0C,KAAKu4B,OAAOwlC,yBACnE/9D,KAAK+8D,oBAAsB/G,aAAY,KACvB7oB,WACR,GAAIqH,KAAK,mCAAmCx0C,KAAK2hE,MAAMljE,cACvD,IAAI6kE,QAAuB/mC,QAAQgpB,IAAI5jD,MAAM4c,KAAKve,KAAK2hE,MAAM1+D,UAAUqB,KAAI6oC,MAAO0a,IAE9E,UADuB7nD,KAAKkoD,SAAS2C,KAAKhD,IAC7BuC,QAGT,OAFA,GAAI5V,KAAK,6BAA6BqT,EAAKxhD,mBAC3CrG,KAAK4hE,aAAatiE,IAAIuoD,EAAM,GAGhC,IAAI8W,EAAW3+D,KAAK4hE,aAAaxiE,IAAIyoD,IAAS,EAI9C,OAHA8W,GAAY,EACZ3+D,KAAK4hE,aAAatiE,IAAIuoD,EAAM8W,GAC5B,GAAIzxD,KAAK,yBAAyB26C,EAAKxhD,yBAAyBs4D,KAAY3+D,KAAKu4B,OAAO8lC,0BACpFM,EAAW3+D,KAAKu4B,OAAO8lC,4BAA3B,GAGA,GAAI7pB,KAAK,QAAQqT,EAAKxhD,qCAAqCrG,KAAKu4B,OAAO8lC,6CAChExW,EAAI,KAEfyb,EAAiBA,EAAez2D,QAAQ6xB,KAAQA,UAC1CnC,QAAQgpB,IAAI+d,EAAeh/D,KAAKo6B,IAClC1+B,KAAK2hE,MAAMta,OAAO3oB,GAClB1+B,KAAK4hE,aAAava,OAAO3oB,GAClB1+B,KAAKujE,mBAAmB7kC,EAAG1+B,KAAKi0C,mBAEvCqvB,EAAe7hE,OAAS,IACxB,GAAI+yC,KAAK,aAAa8uB,EAAe7hE,6BACzBzB,KAAKoiE,iBAAiB,CAC9BC,qBAAqB,EACrBmB,iBAAiB,IAEzB,EAECH,EAAK,GACXrjE,KAAKu4B,OAAOwlC,oBACnB,CACA,mBAAAyE,GACIxiE,KAAK+pD,OAAOxF,iBAAiB,gBAAiBtgC,IAAWjkB,KAAKq9D,gBAAgBp5C,EAAE,IAChFjkB,KAAK+pD,OAAOxF,iBAAiB,mBAAoBtgC,IAAWjkB,KAAKs9D,mBAAmBr5C,EAAE,GAC1F,CACA,gBAAAy+C,GACQ1iE,KAAKiiE,qBACL5L,cAAcr2D,KAAKiiE,qBAEnBjiE,KAAK+8D,qBACL1G,cAAcr2D,KAAK+8D,oBAE3B,CACA,eAAA6F,GACI,IAAK,MAAOhyC,EAAS6yC,KAAYzjE,KAAK6hE,UAAU1R,UAC5CnwD,KAAK8hE,eAAerd,oBAAoB7zB,EAAQwhB,aAAcqxB,GAElEzjE,KAAK6hE,UAAUtiE,OACnB,CACA,kBAAMojE,SACI3iE,KAAK+iE,mBAAmB,CAAEV,qBAAqB,IACrDriE,KAAK2hE,MAAMpiE,QACXS,KAAK4hE,aAAe,IAAI/zB,GAC5B,CACA,qBAAA40B,GACIziE,KAAK+pD,OAAOtF,oBAAoB,eAAgBzkD,KAAKq9D,iBACrDr9D,KAAK+pD,OAAOtF,oBAAoB,kBAAmBzkD,KAAKs9D,mBAC5D,CACA,eAAAD,CAAgBl9D,GACZ,GAAIq0C,KAAK,mBAAmBr0C,EAAM2nD,OAAOzhD,cAErCrG,KAAK2hE,MAAM1iE,IAAIkB,EAAM2nD,QACrB,GAAItT,KAAK,QAAQr0C,EAAM2nD,OAAOzhD,2CAG7BrG,KAAKoiE,iBAAiB,CACvBC,qBAAqB,EACrBmB,iBAAiB,GAEzB,CACA,kBAAAlG,CAAmBn9D,GACf,GAAIq0C,KAAK,sBAAsBr0C,EAAM2nD,OAAOzhD,cAEvCrG,KAAK2hE,MAAM1iE,IAAIkB,EAAM2nD,SAI1B,GAAItT,KAAK,eAAer0C,EAAM2nD,OAAOzhD,qDACrCrG,KAAK2hE,MAAMta,OAAOlnD,EAAM2nD,QACnB9nD,KAAKoiE,iBAAiB,CACvBC,qBAAqB,EACrBmB,iBAAiB,KAPjB,GAAIhvB,KAAK,qBAAqBr0C,EAAM2nD,OAAOzhD,kCASnD,CACA,sBAAM+7D,CAAiB/lC,GACnB,MAAM,oBAAEgmC,EAAmB,gBAAEmB,GAAkB,GAAUnnC,EACnD4X,EAAgBouB,EAChB1gE,MAAM4c,KAAKve,KAAK+hE,0BAChB/hE,KAAKi0C,cAEX,GADA,GAAIO,KAAK,gDAAgD6tB,sBAAwCmB,oBAAkCvvB,EAAcxyC,WAC5IwyC,EAAcxyC,OAEf,OADA,GAAIyL,KAAK,yDACF,EAEX,MAAMw2D,EAAY,IAAIpoB,IAAIt7C,KAAK2hE,OACzBgC,EAAa3jE,KAAK68D,YAAY7D,WACpC,IAAK,MAAMnR,KAAQ8b,EAAY,CAC3B,GAAI3jE,KAAK2hE,MAAMljE,MAAQuB,KAAKu4B,OAAOqrC,cAC/B,MAEJ5jE,KAAK2hE,MAAM3kD,IAAI6qC,EACnB,CACA,MAAMgc,EAAaL,EACb7hE,MAAM4c,KAAKve,KAAK2hE,MAAM1+D,UAAU4J,QAAQ6xB,IAAOglC,EAAUzkE,IAAIy/B,KAC7D/8B,MAAM4c,KAAKve,KAAK2hE,MAAM1+D,UAE5B,GADA,GAAIuxC,KAAK,oBAAoBqvB,EAAWpiE,oBAAoBwyC,EAAcxyC,yBACtE+hE,GAAyC,IAAtBK,EAAWpiE,OAE9B,OADA,GAAIyL,KAAK,kEACF,EAEX,MAAM+xD,QAAgB1iC,QAAQgpB,IAAIse,EAAWv/D,KAAKo6B,GAAM1+B,KAAK8jE,iBAAiBplC,EAAGuV,MAC3E8vB,EAAe9E,EAAQpyD,QAAQ2tB,GAAMA,IAAG/4B,OAK9C,OAJA,GAAI+yC,KAAK,iCAAiCuvB,KAAgB9E,EAAQx9D,qBAC9D4gE,IACAriE,KAAK+hE,yBAA2B,IAAIzmB,KAEjC2jB,EAAQjE,MAAM37D,GAAMA,GAC/B,CACA,sBAAMykE,CAAiB5c,EAAQjT,GAE3B,GADA,GAAIO,KAAK,iCAAiCx0C,KAAKg0C,8BAA8BC,EAAcpsC,KAAK,SAC3FosC,EAAcxyC,SAAWzB,KAAKg0C,YAE/B,OADA,GAAI9mC,KAAK,8FACF,EAEX,MAAMmjB,QAAiBrwB,KAAKkoD,SAAS5U,UAAUtzC,KAAKg0C,YAAakT,EAAQjT,GACzE,OAAI5jB,EAASg6B,SACT,GAAIn9C,KAAK,yCAAyClN,KAAKg0C,kBAAkBkT,EAAO7gD,yBAAyBgqB,EAASg6B,QAAQ7iC,2BAA2BysB,MAC9I,IAEX,GAAIO,KAAK,gCAAgCx0C,KAAKg0C,kBAAkBkT,EAAO7gD,gCAAgC4tC,MAChG,EACX,CACA,wBAAM8uB,CAAmB1mC,GACrB,MAAM,oBAAEgmC,GAAwBhmC,EAC1B4X,EAAgBouB,EAChB1gE,MAAM4c,KAAKve,KAAKgiE,4BAChBhiE,KAAKi0C,cAEX,GADA,GAAIO,KAAK,kDAAkD6tB,oBAAsCpuB,EAAcxyC,WAC1GwyC,EAAcxyC,OAEf,OADA,GAAIyL,KAAK,yDACF,EAEX,MAAM22D,EAAaliE,MAAM4c,KAAKve,KAAK2hE,MAAM1+D,UACnC6R,QAAeynB,QAAQgpB,IAAIse,EAAWv/D,KAAKo6B,GAAM1+B,KAAKujE,mBAAmB7kC,EAAG2jC,EAAsBpuB,OAAgB/0C,MAClH6kE,EAAejvD,EAAOjI,QAAQ2tB,GAAMA,IAAG/4B,OAK7C,OAJA,GAAI+yC,KAAK,mCAAmCuvB,KAAgBjvD,EAAOrT,qBAC/D4gE,IACAriE,KAAKgiE,2BAA6B,IAAI1mB,KAEnCxmC,EAAOkmD,MAAM37D,GAAMA,GAC9B,CACA,wBAAMkkE,CAAmBrc,EAAQjT,GAC7B,MAAM5jB,EAAW4jB,QACLj0C,KAAKkoD,SAASsC,YAAYxqD,KAAKg0C,YAAakT,EAAQjT,SACpDj0C,KAAKkoD,SAASyC,eAAe3qD,KAAKg0C,YAAakT,GAC3D,OAAI72B,EAASg6B,SACT,GAAIn9C,KAAK,6DAA6DlN,KAAKg0C,2BAA2BkT,EAAO7gD,yBAAyBgqB,EAASg6B,SAAS7iC,2BAA2BysB,MAC5K,IAEX,GAAIO,KAAK,gDAAgDx0C,KAAKg0C,2BAA2BkT,EAAO7gD,gCAAgC4tC,MACzH,EACX,ECjVJ,MAAM,GAAM,IAAIoJ,GAAO,mBAChB,MAAM,GACT0M,OACA7B,SACA2U,YACAlU,kBACApwB,OACAyrC,cAAgB,IAAIn2B,IACpB,WAAAv+B,CAAY+sB,GACRr8B,KAAKu4B,OAAS,CACVqrC,cAAe,EACfvF,uBAAwB,EACxBN,oBAAqB,OAClB1hC,EAAOpiB,SAEdja,KAAK+pD,OAAS1tB,EAAO0tB,OACrB/pD,KAAK68D,YAAcxgC,EAAOwgC,YAC1B78D,KAAK2oD,kBAAoBtsB,EAAOssB,kBAChC3oD,KAAKkoD,SAAW,IAAI0B,GAAW5pD,KAAKikE,kBAAkB7nC,KAAKp8B,MAAOq8B,EAAOssB,kBAAkBjN,aAAcrf,EAAO0tB,OACpH,CAeA,cAAAY,GACI,IAAK,MAAMsV,KAAgBjgE,KAAKgkE,cAAc/gE,SAC1Cg9D,EAAa35C,OAEjBtmB,KAAKgkE,cAAczkE,OACvB,CAwBA,eAAM+zC,CAAU1iB,EAAShB,GACrB,MAAMwZ,EAAWznC,MAAM2Q,QAAQse,GAAWA,EAAU,CAACA,GACrD,GAAwB,IAApBwY,EAAS3nC,OACT,MAAMjD,MAAM,qCAEhB,MAAMk9C,EAAetS,EAAS9kC,KAAKjF,GAAMA,EAAE20C,cACrCC,EAAgB7K,EAAS9kC,KAAKjF,GAAMA,EAAE+yC,eAE5C,IAAKpyC,KAAKkkE,kBAAkB96B,GACxB,MAAM5qC,MAAM,qFAAqFk9C,KAIrG,GAFA,GAAIlH,KAAK,iCAAiCP,oBAAgCyH,MAC7C17C,KAAK2oD,kBAAkBjN,aAAa1wB,SAAS0wB,EAAa,IAEnF,MAAMl9C,MAAM,gBAAgBk9C,EAAa,gDAE7C,IAAIukB,EAAejgE,KAAKgkE,cAAc5kE,IAAIs8C,EAAa,IAClDukB,IACDA,EAAe,IAAI,GAAa,CAC5BjsB,YAAa0H,EAAa,GAC1BqO,OAAQ/pD,KAAK+pD,OACb7B,SAAUloD,KAAKkoD,SACf3vB,OAAQv4B,KAAKu4B,OACbskC,YAAa78D,KAAK68D,cAEtBoD,EAAaj5D,SAEjB,MAAM8N,QAAemrD,EAAajjD,IAAIosB,EAAUxZ,GAGhD,OAFA5vB,KAAKgkE,cAAc1kE,IAAIo8C,EAAa,GAAIukB,GACxC,GAAIzrB,KAAK,gBAAgB1/B,EAAS,aAAe,+BAA+Bm/B,KACzEn/B,CACX,CAsBA,iBAAM01C,CAAY55B,GACd,MAAMwY,EAAWznC,MAAM2Q,QAAQse,GAAWA,EAAU,CAACA,GACrD,GAAwB,IAApBwY,EAAS3nC,OACT,MAAMjD,MAAM,uCAEhB,MAAMk9C,EAAetS,EAAS9kC,KAAKjF,GAAMA,EAAE20C,cACrCC,EAAgB7K,EAAS9kC,KAAKjF,GAAMA,EAAE+yC,eAE5C,IAAKpyC,KAAKkkE,kBAAkB96B,GACxB,MAAM5qC,MAAM,yFAAyFk9C,KAIzG,GAFA,GAAIlH,KAAK,qCAAqCP,oBAAgCyH,MACjD17C,KAAK2oD,kBAAkBjN,aAAa1wB,SAAS0wB,EAAa,IAEnF,MAAMl9C,MAAM,gBAAgBk9C,EAAa,gDAE7C,MAAMukB,EAAejgE,KAAKgkE,cAAc5kE,IAAIs8C,EAAa,IACzD,IAAKukB,EAED,OADA,GAAI/yD,KAAK,kDACF,EAEX,MAAM4H,QAAemrD,EAAa9gE,OAAOiqC,GAOzC,OANI62B,EAAa/c,YACb,GAAIh2C,KAAK,yDACT+yD,EAAa35C,OACbtmB,KAAKgkE,cAAc3c,OAAO3L,EAAa,KAE3C,GAAIlH,KAAK,iBAAiB1/B,EAAS,aAAe,+BAA+Bm/B,KAC1En/B,CACX,CACA,uBAAMmvD,CAAkBjwB,EAAaxnC,EAAS06C,GAC1C,GAAI1S,KAAK,oCAAoCR,mBAA6BxnC,EAAQ4lC,wBAAwB8U,EAAO7gD,cACjH,MAAM45D,EAAejgE,KAAKgkE,cAAc5kE,IAAI40C,GACvCisB,EAILA,EAAa+C,OAAOx2D,EAAS06C,GAHzB,GAAI1/B,MAAM,gDAAgDwsB,IAIlE,CACA,iBAAAkwB,CAAkB96B,GACd,MAAM+6B,EAAS,IAAI7oB,IACnB,IAAK,MAAM1qB,KAAWwY,EAClB+6B,EAAOnnD,IAAI4T,EAAQojB,aAEvB,OAAuB,IAAhBmwB,EAAO1lE,IAClB,EChKJ,MAAM,GAAM,IAAI4+C,GAAO,oBA4BhB,MAAM+mB,WAAwB3X,GACjC1C,OACA/qD,MAAQ+7C,GAAaspB,UACrB,WAAA/0D,CAAY+sB,GACR+T,QACApwC,KAAK+pD,OAAS1tB,EAAO0tB,OACrB/pD,KAAKskE,eAAiBtkE,KAAKskE,eAAeloC,KAAKp8B,MAC/CA,KAAKs9D,mBAAqBt9D,KAAKs9D,mBAAmBlhC,KAAKp8B,KAC3D,CAKA,KAAAgH,GACI,GAAIwtC,KAAK,qCACTx0C,KAAK+pD,OAAOxF,iBAAiB,gBAAiBvkD,KAAKskE,gBACnDtkE,KAAK+pD,OAAOxF,iBAAiB,kBAAmBvkD,KAAKs9D,mBACzD,CAKA,IAAAh3C,GACI,GAAIkuB,KAAK,sCACTx0C,KAAK+pD,OAAOtF,oBAAoB,gBAAiBzkD,KAAKskE,gBACtDtkE,KAAK+pD,OAAOtF,oBAAoB,kBAAmBzkD,KAAKs9D,mBAC5D,CAKA,QAAAj3D,GACI,OAAOrG,KAAKhB,KAChB,CAKA,OAAAulE,GACI,OAAOvkE,KAAKhB,KAChB,CACA,wBAAMs+D,CAAmBU,GACrB,GAAIxpB,KAAK,6CACWx0C,KAAK+pD,OAAOlD,iBAEhBplD,OAAS,GACrB,GAAI+yC,KAAK,iDAEbx0C,KAAKhB,MAAQ+7C,GAAaspB,UAC1B,GAAI7vB,KAAK,0CAA0Cx0C,KAAKhB,SACxDgB,KAAKwkE,qBACT,CACA,oBAAMF,CAAetG,GACjB,GAAIxpB,KAAK,yCACT,MAAM+R,EAAcvmD,KAAK+pD,OAAOlD,iBAC1B8a,QAAcplC,QAAQgpB,IAAIgB,EAAYjiD,KAAI6oC,MAAOhmC,IACnD,IACI,aAAanH,KAAK+pD,OAAOmM,UAAU92D,IAAI+H,EAAE4jD,WAC7C,CACA,MAAO9mC,GACH,OAAO,IACX,MAEEwgD,EAAc9C,EAAM90D,QAAQ6xB,GAAMA,GAAGqpB,UAAU/8B,SAAS2+B,MAAyBloD,OACjFijE,EAAiB/C,EAAM90D,QAAQ6xB,GAAMA,GAAGqpB,UAAU/8B,SAASigC,MAAiBxpD,OAC9D,IAAhBgjE,GAAwC,IAAnBC,EACrB1kE,KAAKhB,MAAQ+7C,GAAaspB,UAErBI,GAAe,GAAKC,GAAkB,EAC3C1kE,KAAKhB,MAAQ+7C,GAAa4pB,oBAEL,IAAhBF,GAAwC,IAAnBC,EAC1B1kE,KAAKhB,MAAQ+7C,GAAa6pB,iBAG1B,GAAIp9C,MAAM,qFAAqFi9C,gBAA0BC,KAE7H,GAAIlwB,KAAK,oCAAoCx0C,KAAKhB,SAClDgB,KAAKwkE,qBACT,CACA,mBAAAA,GACIxkE,KAAK2sD,cAAc,IAAIE,YAAY/R,GAAyB+pB,aAAc,CACtE/c,OAAQ9nD,KAAKhB,QAErB,ECnHG,MAUM4nB,GAAWA,GACb,IAAI2V,SAAQ,CAAC5D,EAAG6D,IAAW3V,YAAW,IAAM2V,EAAO,IAAIh+B,MAAM,kBAAkBooB,KCRpF,GAAM,IAAIy2B,GAAO,qBAChB,MAAMynB,GACTC,WAAa,KACbC,gBACAtD,WAAa,EACb39B,MAAQ,GACR84B,YACA,WAAAvtD,CAAYipB,GACRv4B,KAAK68D,YAActkC,EAAOskC,YAC1B78D,KAAKglE,gBAAkBzsC,EAAOysC,eAClC,CACA,KAAAh+D,GACIhH,KAAK+kE,WAAa/O,aAAY,KAC1Bh2D,KAAKilE,cAAc,GACpBjlE,KAAKglE,gBACZ,CACA,IAAA1+C,GACQtmB,KAAK+kE,aACL1O,cAAcr2D,KAAK+kE,YACnB/kE,KAAK+kE,WAAa,KAE1B,CACA,IAAAvkE,CAAKovB,EAAUs1C,GACXllE,KAAK+jC,MAAMvjC,KAAK,CACZ0kE,cACAt1C,YAER,CACA,YAAAq1C,GACI,GAA0B,IAAtBjlE,KAAK+jC,MAAMtiC,OAIf,KAAOzB,KAAK+jC,MAAMtiC,QAAUzB,KAAK0hE,WAnCZ,GAmC+C,CAChE,MAAMyD,EAAOnlE,KAAK+jC,MAAMz7B,QACpB68D,GACAnlE,KAAKolE,aAAaD,EAE1B,MARI,GAAI3wB,KAAK,+BASjB,CACA,YAAA4wB,CAAaD,GAMTt+C,YALoBsmB,SACTntC,KAAKqlE,aAAaF,IAIL,IAC5B,CACA,kBAAME,CAAaF,GACf,MAAMje,EAASlnD,KAAK68D,YAAY7D,WAAW,GDpDhB,IAAC3O,ECqD5B,GAAKnD,EAIL,IACIlnD,KAAK0hE,YAAc,EACnB,MAAMrxC,QAAiBkM,QAAQioB,KAAK,CAChC59B,GA1DQ,KA2DRu+C,EAAKv1C,SAASs3B,KAElB,GAAI72B,GAAUg6B,QACV,MAAM7rD,MAAM6xB,EAASg6B,QAAQ7iC,OAGjC,GADA,GAAIgtB,KAAK,uCACgB,IAArB2wB,EAAKD,YAEL,YADA,GAAIh4D,KAAK,+DAGblN,KAAK+jC,MAAMvjC,KAAK,IACT2kE,EACHD,YAAaC,EAAKD,YAAc,GAExC,CACA,MAAOI,GACH,MAAM99C,EAAQ89C,EAKd,GAJA,GAAI99C,MAAM,kDAAmDA,KD9ErC6iC,EC+EA7iC,EAAMhb,WD9ENmY,GAAc4lC,sBAC1CF,IAAY1lC,GAAcimC,aAC1BP,IAAY1lC,GAAcinC,sBAC1BvB,IAAY1lC,GAAci3C,oBC4ElB57D,KAAK68D,YAAYqB,aAAahX,GAET,IAArBie,EAAKD,YAEL,YADA,GAAIh4D,KAAK,+DAGblN,KAAK+jC,MAAMvjC,KAAK,IACT2kE,EACHD,YAAaC,EAAKD,YAAc,GAExC,CACA,QACIllE,KAAK0hE,YAAc,CACvB,MAvCI,GAAIx0D,KAAK,mCAwCjB,EC3FJ,MAAM,GAAM,IAAImwC,GAAO,kBAEjBkoB,GAAuB,CACzBC,WAAW,EACXR,gBAAiB,IACjBE,YAJyB,EAKzBtB,cAAe,GAEZ,MAAM6B,GACTltC,OACAmtC,aACA7I,YACA3U,SACA,WAAA54C,CAAY+sB,GACRr8B,KAAKu4B,OAAS,IACPgtC,MACClpC,EAAOpiB,SAAW,CAAC,GAE3Bja,KAAK68D,YAAcxgC,EAAOwgC,YAC1B78D,KAAKkoD,SAAW,IAAIgD,GAAc7uB,EAAOssB,kBAAkBjN,aAAcrf,EAAO0tB,QAChF/pD,KAAK0lE,aAAe,IAAIZ,GAAa,CACjCjI,YAAaxgC,EAAOwgC,YACpBmI,gBAAiBhlE,KAAKu4B,OAAOysC,iBAErC,CACA,KAAAh+D,GACIhH,KAAK0lE,aAAa1+D,OACtB,CACA,IAAAsf,GACItmB,KAAK0lE,aAAap/C,MACtB,CACA,UAAMmK,CAAKE,EAASnkB,EAASyN,EAAU,CAAC,GACpCA,EAAU,IACHja,KAAKu4B,UACLte,GAEP,MAAM,YAAE+5B,GAAgBrjB,EAExB,GADA,GAAI6jB,KAAK,qDAAsDR,IAC1Dh0C,KAAKkoD,SAASxM,aAAa1wB,SAASgpB,GACrC,MAAO,CACH6qB,UAAW,GACXF,SAAU,CACN,CACIn3C,MAAO7C,GAAcghD,wBAKrC,MAAMhJ,EAAU38D,KAAK68D,YAChB7D,WACA93D,MAAM,EAAGlB,KAAKu4B,OAAOqrC,eAC1B,GAAuB,IAAnBjH,EAAQl7D,OACR,MAAO,CACHo9D,UAAW,GACXF,SAAU,CACN,CACIn3C,MAAO7C,GAAci3C,qBAKrC,MAAMgK,QAAoBrpC,QAAQgpB,IAAIoX,EAAQr4D,KAAK4iD,GAAWlnD,KAAKkoD,SAASz3B,KAAKE,EAASnkB,EAAS06C,GAAQ5jB,OAAOuiC,IAAO,CACrHzb,QAAS,KACTC,QAAS,CACL7iC,MAAO7C,GAAc2lC,qBAGvB2U,EAAU,CACZJ,UAAW+G,EACN/4D,QAAQxN,GAAMA,EAAE+qD,UAChB9lD,KAAKjF,GAAMA,EAAE+qD,UAClBuU,SAAUiH,EACL/4D,QAAQxN,GAAMA,EAAEgrD,UAChB/lD,KAAKjF,GAAMA,EAAEgrD,WAEtB,GAAIpwC,EAAQurD,WAA0C,IAA7BvG,EAAQJ,UAAUp9D,OAAc,CACrD,MAAMqkE,EAAgB5e,GAAWlnD,KAAKkoD,SAASz3B,KAAKE,EAASnkB,EAAS06C,GACtElnD,KAAK0lE,aAAallE,KAAKslE,EAAa1pC,KAAKp8B,MAAOia,EAAQirD,aA5EvC,EA6ErB,CACA,OAAOjG,CACX,ECnFJ,MAAM,GAAM,IAAI5hB,GAAO,gBAEjB0oB,GAAsB,oBACrB,MAAMC,GACTpC,cACA7Z,OACA,WAAAz6C,CAAY+sB,GACRr8B,KAAKimE,YAAcjmE,KAAKimE,YAAY7pC,KAAKp8B,MACzCA,KAAKkmE,eAAiBlmE,KAAKkmE,eAAe9pC,KAAKp8B,MAC/CA,KAAK4jE,cACDvnC,GAAQ9D,QAAQqrC,eATK,EAUzB5jE,KAAK+pD,OAAS1tB,EAAO0tB,MACzB,CACA,KAAA/iD,GACIhH,KAAKy9D,yBACT,CACA,IAAAn3C,GACItmB,KAAK29D,wBACT,CACA,QAAA3E,GACI,OAAOh5D,KAAKmmE,uBAAuB7hE,KAAK6C,GAAMA,EAAE4jD,YACpD,CACA,YAAAmT,CAAahX,GACT,MAAMkf,EAAoBpmE,KAAKmmE,uBACzBE,EAAcrmE,KAAK4jE,cAAgBwC,EAAkB3kE,OAC3D,GAAoB,IAAhB4kE,EACA,OAEJ,MAKMC,EALctmE,KAAKumE,yBACpB15D,QAAQ1F,IAAOA,EAAE4jD,WAAWzc,OAAO4Y,KACnChmD,MAAM,EAAGmlE,GACT/hE,KAAK6C,GAAMnH,KAAKwmE,eAAer/D,KAC/B7C,KAAK6C,GAAMA,EAAE4jD,aACY,GAC9B,GAAKub,EAKL,OADA,GAAI9xB,KAAK,8BAA8B0S,EAAO7gD,iBAAiBigE,EAAUjgE,cAClEigE,EAJH,GAAIp5D,KAAK,qCAAqCg6C,EAAO7gD,yBAK7D,CACA,uBAAAo3D,GACIz9D,KAAK+pD,OAAOxF,iBAAiB,eAAgBvkD,KAAKimE,aAClDjmE,KAAK+pD,OAAOxF,iBAAiB,kBAAmBvkD,KAAKkmE,eACzD,CACA,sBAAAvI,GACI39D,KAAK+pD,OAAOtF,oBAAoB,eAAgBzkD,KAAKimE,aACrDjmE,KAAK+pD,OAAOtF,oBAAoB,kBAAmBzkD,KAAKkmE,eAC5D,CACA,WAAAD,CAAY9lE,GACR,MAAM+mD,EAAS/mD,EAAM2nD,OACrB9nD,KAAKymE,iBAAiBvf,EAC1B,CACA,cAAAgf,CAAe/lE,GACX,MAAM+mD,EAAS/mD,EAAM2nD,OACrB9nD,KAAKk+D,aAAahX,EACtB,CACA,gBAAAuf,CAAiBvf,GACb,MAAMkf,EAAoBpmE,KAAKmmE,uBAEX,GADAnmE,KAAK4jE,cAAgBwC,EAAkB3kE,QAI3DzB,KAAKumE,yBACA15D,QAAQ1F,GAAMA,EAAE4jD,WAAWzc,OAAO4Y,KAClC5iD,KAAK6C,GAAMnH,KAAKwmE,eAAer/D,IACxC,CACA,oBAAAg/D,GACI,OAAOnmE,KAAK+pD,OACPlD,iBACAh6C,QAAQ1F,GAAmB,SAAbA,EAAEipB,QAAqBpwB,KAAK0mE,mBAAmBv/D,IACtE,CACA,sBAAAo/D,GACI,OAAOvmE,KAAK+pD,OACPlD,iBACAh6C,QAAQ1F,GAAmB,SAAbA,EAAEipB,SAAsBpwB,KAAK0mE,mBAAmBv/D,IACvE,CACA,cAAAq/D,CAAer/D,GAGX,OAFA,GAAIqtC,KAAK,+CAA+CrtC,EAAE4jD,WAAW1kD,cACrEc,EAAE+wD,KAAK13D,KAAKulE,IACL5+D,CACX,CACA,kBAAAu/D,CAAmBv/D,GACf,OAAOA,EAAE+wD,KAAKltC,SAAS+6C,GAC3B,EClFJ,MAAM,GAAM,IAAI1oB,GAAO,kBAKhB,MAAMspB,GACT1sD,QACA4iD,YACAlU,kBACAT,SACA,WAAA54C,CAAY+sB,GACRr8B,KAAKia,QAAUoiB,EAAOpiB,SAAW,CAAC,EAClCja,KAAK68D,YAAcxgC,EAAOwgC,YAC1B78D,KAAK2oD,kBAAoBtsB,EAAOssB,kBAChC3oD,KAAKkoD,SAAW,IAAI8D,GAAU3vB,EAAOssB,kBAAkBjN,aAAcrf,EAAO0tB,OAChF,CAUA,oBAAO6c,CAAex9B,EAAUnvB,GAC5B,MAAM,YAAE+5B,EAAW,cAAEC,EAAa,cAAE4yB,GAAkB7mE,KAAK8mE,+BAA+B19B,GACpF8iB,EAAY,CACdlY,cACAC,gBACAW,aAAa,EACbK,mBAAmB,KAChBh7B,GAED4tC,QAAa7nD,KAAK+mE,eACxB,IAAKlf,EAED,MADA,GAAIrgC,MAAM,+BACJ,IAAIhpB,MAAM,+BAEpB,GAAIg2C,KAAK,gCAAgCnvB,KAAKE,UAAUtL,MACxD,MAAM+sD,EAAoBhnE,KAAKkoD,SAAS+D,aAAaC,EAAW2a,EAAehf,GAC/E,UAAW,MAAMnU,KAAYszB,QACnBtzB,CAEd,CASA,8BAAMuzB,CAAyB79B,EAAUxZ,EAAU3V,GAC/C,GAAIu6B,KAAK,wCACT,UAAW,MAAMwqB,KAAYh/D,KAAK4mE,eAAex9B,EAAUnvB,GACvD,SAAUja,KAAKknE,gBAAgBlI,EAAUpvC,GACrC,KAEZ,CASA,8BAAMu3C,CAAyB/9B,EAAUxZ,EAAU3V,GAC/C,GAAIu6B,KAAK,wCACT,IAAI4yB,GAAQ,EACZ,UAAW,MAAMC,KAAQrnE,KAAK4mE,eAAex9B,EAAUnvB,GAAU,CAC7D,MAAMqtD,EAAYD,EAAK/iE,KAAI6oC,MAAOo6B,IAC1BH,IAEJA,EAAQt6D,cAAc8iB,EAAS23C,IAAY,IAG/C,SADMhrC,QAAQgpB,IAAI+hB,GACdF,EACA,KACR,CACJ,CASA,qBAAMF,CAAgBxzB,EAAU9jB,GAC5B,IAAIw3C,GAAQ,EACZ,MACMI,SADwBjrC,QAAQgpB,IAAI7R,IACA7mC,OAAOmlC,IAMjD,aALMzV,QAAQgpB,IAAIiiB,EAAkBljE,KAAI6oC,MAAOwK,IACvCA,IAAQyvB,IACRA,EAAQt6D,cAAc8iB,EAAS+nB,IACnC,KAEGyvB,CACX,CAOA,YAAAK,CAAaj7D,GACT,OAAOkoC,GAAYloC,EAAQwnC,YAAaxnC,EAC5C,CASA,8BAAAs6D,CAA+B19B,GAC3B,GAAwB,IAApBA,EAAS3nC,OAET,MADA,GAAI+lB,MAAM,wBACJ,IAAIhpB,MAAM,wBAEpB,MAAMkpE,EAA4B/lE,MAAM4c,KAAK,IAAI+8B,IAAIlS,EAAS9kC,KAAKssB,GAAYA,EAAQojB,gBACvF,GAAI0zB,EAA0BjmE,OAAS,EAEnC,MADA,GAAI+lB,MAAM,gEACJ,IAAIhpB,MAAM,gEAEpB,MAAMmpE,EAAsBD,EAA0B,GACtD3rB,GAA8B4rB,EAAqB3nE,KAAKkoD,SAASxM,cACjE,MAAMmrB,EAAgB,IAAIh5B,IAC1BzE,EAASj8B,SAASqyD,IACd,GAAIqH,EAAc5nE,IAAIugE,EAAIptB,cAEtB,MADA,GAAI5qB,MAAM,4DACJ,IAAIhpB,MAAM,4DAEpBqoE,EAAcvnE,IAAIkgE,EAAIptB,aAAcotB,EAAI,IAE5C,MAAMvrB,EAAgB7K,EACjBv8B,QAAQ+jB,GAAYA,EAAQojB,cAAgB2zB,IAC5CrjE,KAAKk7D,GAAQA,EAAIptB,eACtB,GAA6B,IAAzB6B,EAAcxyC,OAEd,MADA,GAAI+lB,MAAM,+BAA+BmgD,KACnC,IAAInpE,MAAM,+BAAiCmpE,GAErD,MAAO,CACH3zB,YAAa2zB,EACb1zB,gBACA4yB,gBAER,CACA,kBAAME,GACF,IAAI7f,EACJ,GAAIlnD,KAAKia,SAAS4tC,KAAM,CACpB,MACMA,SADuB7nD,KAAK2oD,kBAAkBmQ,qBACxBx/B,MAAMoF,GAAMA,EAAEhuB,GAAGrK,aAAerG,KAAKia,SAAS4tC,OAC1EX,EAASW,GAAMn3C,GACVw2C,GACD,GAAIh6C,KAAK,2CAA2ClN,KAAKia,QAAQ4tC,wCAEzE,CACA,MAAM8U,EAAU38D,KAAK68D,YAAY7D,WACjC,GAAI2D,EAAQl7D,OAAS,EAEjB,OAAOk7D,EAAQ1zD,KAAK6a,MAAM7a,KAAKm0B,SAAWu/B,EAAQl7D,SAEtD,GAAI+lB,MAAM,6BAEd,ECvKG,MAGMogD,GAA2B,CAACvrC,EAAQwrC,KAC7C,MAAMnyB,EAAarZ,EAAOgf,WAAW3F,WACjCmyB,EAAcnyB,UACZoyB,EAAqBzrC,EAAOgf,WAAa,uBAAwBhf,EAAOgf,UACxEhf,EAAOgf,UAAUysB,mBzEJO,EyES9B,MAAO,CACHpyB,YACAiG,MALetf,EAAOgf,WAAa,UAAWhf,EAAOgf,UACnDhf,EAAOgf,UAAUM,MACjBM,GAAyB5f,EAAO+V,aAAc01B,GAInD,EAEQC,GAAoB,CAAC1sB,EAAWwsB,IACrCA,EAAcnyB,YAAc2F,EAAU3F,aAGtC,WAAYmyB,IACXA,EAAclyB,OAAO3qB,SAASqwB,EAAUM,QCvB3C,GAAM,IAAI0B,GAAO,wBA+DvBlQ,eAAe66B,GAAiBC,EAAMlgB,GAClC,MAAMiX,EAAW,GAajB,OAZIiJ,EAAKzS,OAASzN,EAAU/8B,SAASwvB,GAAU0tB,QAC3ClJ,EAASx+D,KAAKynE,EAAKzS,MAAM2S,gBAEzBF,EAAKG,OAASrgB,EAAU/8B,SAASwvB,GAAUmsB,QAC3C3H,EAASx+D,KAAK6nE,GAAqBtc,GAAYkc,EAAKle,SAEpDke,EAAKxJ,WAAa1W,EAAU/8B,SAASwvB,GAAUirB,YAC/CzG,EAASx+D,KAAK6nE,GAAqBpd,GAAgBgd,EAAKle,SAExDke,EAAKp7D,QAAUk7C,EAAU/8B,SAASwvB,GAAUwlB,SAC5ChB,EAASx+D,KAAK6nE,GAAqB1e,GAAwBse,EAAKle,SAE7DxtB,QAAQgpB,IAAIyZ,EACvB,CAKA7xB,eAAek7B,GAAqBhhC,EAAO0iB,GACvC,GAAIvV,KAAK,eAAenN,iBAClB,IAAI9K,SAASr4B,IACf,MAAM+iB,EAAK,MAAQ3mB,IACf,GAAIA,EAAIwnD,QAAQC,WAAW/8B,SAASqc,GAAQ,CACxC,MAAMihC,EAAkBve,EAAOkM,SAAS5N,SACxC,IAAKigB,EAGD,OAFAve,EAAOtF,oBAAoB,gBAAiBx9B,QAC5C/iB,IAGJ,UACUokE,EAAgBtM,0BAA0B17D,EAAIwnD,OAAOZ,QAC3D6C,EAAOtF,oBAAoB,gBAAiBx9B,GAC5C/iB,GACJ,CACA,MAAO+f,GAEY,gCAAXA,EAAElP,MACF,GAAIyS,MAAM,4DAEd,GAAIA,MAAM,+BAA+BvD,IAC7C,CACJ,CACH,EACD8lC,EAAOxF,iBAAiB,gBAAiBt9B,EAAG,GAEpD,CAyCA,MAAMshD,GAAe,CAAC99D,EAAI+9D,IAAiB,IAAIjsC,SAAQ,CAACksC,EAAUjsC,IAAW3V,YAAW,IAAM2V,EAAOh+B,MAAMgqE,KAAgB/9D,KC/IrH,GAAM,IAAI4yC,GAAO,QAChB,MAAMqrB,GACThtB,aACAqO,OACAyL,MACA4S,MACAv7D,OACA87D,WACAlK,UACA9V,kBACAigB,OACAf,cAEAgB,gBAAiB,EACjBC,cAAe,EACfjM,YACA,WAAAvtD,CAAYosC,EAAczhC,EAAS8vC,EAAQgf,EAAkBvT,GACzDx1D,KAAK07C,aAAeA,EACpB17C,KAAKw1D,MAAQA,EACbx1D,KAAK+pD,OAASA,EACd/pD,KAAK6nE,cAAgB5tD,EAAQ4tD,eAAiBhtB,GAC9CkuB,EAAmB,CACfl8D,QAAQ,EACRm8D,WAAW,EACXZ,OAAO,KACJW,GAEP,MAAM7hB,EAASlnD,KAAK+pD,OAAO7C,OAAO7gD,WAClCrG,KAAK2oD,kBAAoB,IAAIgO,GAAkB,CAC3C5M,SACAyL,MAAOx1D,KAAKw1D,MACZ9Z,aAAc17C,KAAK07C,aACnBnjB,OAAQte,GAAS0uC,oBAErB3oD,KAAK68D,YAAc,IAAImJ,GAAY,CAC/Bjc,SACAxxB,OAAQ,CACJqrC,cAAe3pD,EAAQ2pD,iBAG/B5jE,KAAK4oE,OAAS,IAAIxE,GAAgB,CAAEra,WAChCgf,EAAiBX,QACbnuD,EAAQmuD,OAAOvgB,MACf7nD,KAAK2oD,kBACAqR,yBAAyB//C,EAAQmuD,MAAMvgB,KAAM,CAACkE,KAC9CzoB,OAAOrf,IACR,GAAIuD,MAAM,4BAA6BvD,EAAE,IAGjDjkB,KAAKooE,MAAQ,IAAIzB,GAAM,CACnB5c,SACApB,kBAAmB3oD,KAAK2oD,kBACxBkU,YAAa78D,KAAK68D,YAClB5iD,QAAS,CACL4tC,KAAM5tC,EAAQmuD,OAAOvgB,SAI7BkhB,EAAiBC,YACjBhpE,KAAKy+D,UAAY,IAAIgH,GAAU,CAC3B1b,SACA8S,YAAa78D,KAAK68D,YAClBlU,kBAAmB3oD,KAAK2oD,kBACxB1uC,QAASA,GAASwkD,aAGtBsK,EAAiBl8D,SACjB7M,KAAK6M,OAAS,IAAImzD,GAAO,CACrBjW,SACApB,kBAAmB3oD,KAAK2oD,kBACxBkU,YAAa78D,KAAK68D,YAClB4B,UAAWz+D,KAAKy+D,UAChBxkD,QAASA,EAAQpN,SAErB7M,KAAK2oE,WAAa,IAAI,GAAW,CAC7B5e,SACApB,kBAAmB3oD,KAAK2oD,kBACxBkU,YAAa78D,KAAK68D,YAClB5iD,QAASA,EAAQpN,UAGzB,GAAI2nC,KAAK,oBAAqB0S,EAAQ,YAAYlnD,KAAKw1D,mBAAmBx1D,KAAKooE,wBAAwBpoE,KAClGy+D,wBAAwBz+D,KAAK6M,SACtC,CACA,UAAIq6C,GACA,OAAOlnD,KAAK+pD,OAAO7C,MACvB,CACA,aAAIa,GACA,OAAO/nD,KAAK+pD,OAAOkf,cACvB,CACA,UAAMrP,CAAK/R,EAAME,GACb,MAAMmhB,EAAanhB,GAAa,QACP,IAAdA,IACP/nD,KAAKw1D,OAAS0T,EAAW1oE,KAAKg6C,GAAU0tB,OACxCloE,KAAKooE,OAASc,EAAW1oE,KAAKg6C,GAAUmsB,OACxC3mE,KAAK6M,QAAUq8D,EAAW1oE,KAAKg6C,GAAUwlB,QACzChgE,KAAKy+D,WAAayK,EAAW1oE,KAAKg6C,GAAUirB,YAEhD,MAAM0D,EAAS,GACXD,EAAWl+C,SAASwvB,GAAU0tB,SAC1BloE,KAAKw1D,MACLx1D,KAAKw1D,MAAM4T,UAAUC,YAAYl8D,SAASk6B,GAAU8hC,EAAO3oE,KAAK6mC,KAGhE,GAAI7f,MAAM,yEAGd0hD,EAAWl+C,SAASwvB,GAAUmsB,SAC1B3mE,KAAKooE,MACLe,EAAO3oE,KAAKR,KAAKooE,MAAMlgB,SAAStB,YAGhC,GAAIp/B,MAAM,yEAGd0hD,EAAWl+C,SAASwvB,GAAUirB,aAC1BzlE,KAAKy+D,UACL0K,EAAO3oE,KAAKR,KAAKy+D,UAAUvW,SAAStB,YAGpC,GAAIp/B,MAAM,8EAGd0hD,EAAWl+C,SAASwvB,GAAUwlB,UAC1BhgE,KAAK6M,OACLs8D,EAAO3oE,KAAKR,KAAK6M,OAAOq7C,SAAStB,YAGjC,GAAIp/B,MAAM,0EAGlB,MAAM0/B,EF1IwB,CAACA,GAC5B6F,GAAS7F,GAAUA,EAAS,GAAUA,GEyI1BoiB,CAAuBzhB,GAEtC,OADA,GAAIrT,KAAK,cAAc0S,EAAO7gD,6BAA6B6iE,WAC9ClpE,KAAK2oD,kBAAkBqR,yBAAyBnS,EAAMshB,EACvE,CACA,WAAMniE,GACEhH,KAAK6oE,gBAAkB7oE,KAAK48D,cAEhC58D,KAAK6oE,gBAAiB,QAChB7oE,KAAK+pD,OAAO/iD,QAClBhH,KAAK68D,YAAY71D,QACjBhH,KAAK4oE,OAAO5hE,QACZhH,KAAKy+D,WAAWz3D,QAChBhH,KAAK6oE,gBAAiB,EACtB7oE,KAAK8oE,cAAe,EACxB,CACA,UAAMxiD,IACEtmB,KAAK6oE,gBAAmB7oE,KAAK48D,cAEjC58D,KAAK6oE,gBAAiB,EACtB7oE,KAAKy+D,WAAWn4C,OAChBtmB,KAAK4oE,OAAOtiD,OACZtmB,KAAK68D,YAAYv2C,OACjBtmB,KAAK2oD,kBAAkBriC,aACjBtmB,KAAK+pD,OAAOzjC,OAClBtmB,KAAK6oE,gBAAiB,EACtB7oE,KAAK8oE,cAAe,EACxB,CACA,uBAAMhQ,GACF,OAAO94D,KAAK2oD,kBAAkBmQ,mBAClC,CACA,kBAAMqP,CAAapgB,EAAW8Y,GAC1B,ODpJD1zB,eAAiC86B,EAAMlgB,EAAW8Y,GAErD9Y,EAAYA,GAAWtmD,OAASsmD,EAmIpC,SAA6BkgB,GACzB,MAAMlgB,EAAY,GAalB,OAZIkgB,EAAKzS,OACLzN,EAAUvnD,KAAKg6C,GAAU0tB,OAEzBD,EAAKp7D,QACLk7C,EAAUvnD,KAAKg6C,GAAUwlB,QAEzBiI,EAAKG,OACLrgB,EAAUvnD,KAAKg6C,GAAUmsB,OAEzBsB,EAAKxJ,WACL1W,EAAUvnD,KAAKg6C,GAAUirB,WAEtB1d,CACX,CAlJgDwhB,CAAoBtB,GAChE,MAAM1hB,EAAc0hB,EAAKle,OAAOlD,iBAChC,IAAKohB,EAAKrL,YACN,MAAMp+D,MAAM,4BAEhB,IAAK,MAAM0pD,KAAYH,EACnB,OAAQG,GACJ,KAAK1N,GAAU0tB,MACX,IAAKD,EAAKzS,MACN,MAAMh3D,MAAM,oDAChB,MACJ,KAAKg8C,GAAUirB,UACX,IAAKwC,EAAKxJ,UACN,MAAMjgE,MAAM,wDAChB,MACJ,KAAKg8C,GAAUmsB,MACX,IAAKsB,EAAKG,MACN,MAAM5pE,MAAM,oDAChB,MACJ,KAAKg8C,GAAUwlB,OACX,IAAKiI,EAAKp7D,OACN,MAAMrO,MAAM,qDAI5B,MAAMwgE,EAAW,CAACgJ,GAAiBC,EAAMlgB,IACrCxB,EAAY9kD,OAAS,IAAMsmD,EAAU/8B,SAASwvB,GAAU0tB,QACxDlJ,EAASx+D,KA+DjB2sC,eAA+B86B,EAAMlgB,GACjC,MAAMyhB,EAAiBvB,EAAKle,OAAOiP,WAC7BsP,EAAkBL,EAAKle,OAAOkM,SAAS5N,SACvCohB,EAsDV,SAA8B1hB,GAC1B,MAAMohB,EAAS,IAAIt7B,IACb67B,EAAkB,CACpB,CAAClvB,GAAUwlB,QAASrW,GACpB,CAACnP,GAAUirB,WAAYxa,GACvB,CAACzQ,GAAUmsB,OAAQ5a,IAEvB,IAAK,MAAM7D,KAAYH,EACf2hB,EAAgBxhB,IAChBihB,EAAO7pE,IAAIoqE,EAAgBxhB,IAAW,GAG9C,OAAOihB,CACX,CAnEyBQ,CAAqB5hB,GAC1C,GAAKyhB,EAAe/nE,QAAW6mE,EAI/B,IAAK,MAAMphB,KAAUsiB,EACjB,IACI,MAAM3hB,QAAaogB,EAAKle,OAAOmM,UAAU92D,IAAI8nD,GAE7C,GADqBW,EAAKE,UAAUiT,MAAM7zD,GAAMsiE,EAAaxqE,IAAIkI,cAEtCmhE,EAAgBtM,0BAA0B9U,IACnD1/B,QACVqgC,EAAKE,UAAU56C,SAAShG,IAChBsiE,EAAaxqE,IAAIkI,IACjBsiE,EAAanqE,IAAI6H,GAAG,EACxB,IAEuBxF,MAAM4c,KAAKkrD,EAAaxmE,UAAU2mE,OAAOvqE,GAAMA,KAEtE,MAIhB,CACA,MAAO4kB,GAEY,gCAAXA,EAAElP,MACF,GAAIyS,MAAM,4DAEd,GAAIA,MAAM,wCAAwCvD,KAClD,QACJ,MA7BA,GAAIuwB,KAAK,uDAAuDg1B,EAAe/nE,+BAA+B6mE,IA+BtH,CAnGsBuB,CAAgB5B,EAAMlgB,IAEpC8Y,QAmGR1zB,eAA+ByV,EAASie,SAC9BtkC,QAAQioB,KAAK,CAAC5B,EAAS2lB,GAAa1H,EAnGkB,yCAoGhE,CApGciJ,CAAgBvtC,QAAQojC,IAAIX,GAAW6B,SAGvCtkC,QAAQojC,IAAIX,EAE1B,CC+Ge+K,CAAkB/pE,KAAM+nD,EAAW8Y,EAC9C,CACA,SAAAjE,GACI,OAAO58D,KAAK8oE,cAAuC,YAAvB9oE,KAAK+pD,OAAO35B,MAC5C,CACA,WAAA8mC,GACI,OAAOl3D,KAAK2oD,kBAAkBuO,aAClC,CACA,aAAA1Y,CAAcniB,GACV,MAAM2tC,EAAkBpC,GAAyBvrC,EAAQr8B,KAAK6nE,eAE9D,GADA,GAAIrzB,KAAK,+BAA+BnvB,KAAKE,UAAU8W,EAAOgf,0BAA0Bh2B,KAAKE,UAAUykD,gBAA8B3kD,KAAKE,UAAUvlB,KAAK6nE,oBACpJE,GAAkBiC,EAAiBhqE,KAAK6nE,eACzC,MAAMrpE,MAAM,4DAEhB,OAAOggD,GAAcniB,EAAO+V,aAAc43B,EAC9C,CACA,aAAA3rB,CAAchiB,GACV,MAAM2tC,EAAkBpC,GAAyBvrC,EAAQr8B,KAAK6nE,eAE9D,GADA,GAAIrzB,KAAK,+BAA+BnvB,KAAKE,UAAU8W,EAAOgf,0BAA0Bh2B,KAAKE,UAAUykD,gBAA8B3kD,KAAKE,UAAUvlB,KAAK6nE,oBACpJE,GAAkBiC,EAAiBhqE,KAAK6nE,eACzC,MAAMrpE,MAAM,4DAEhB,OAAO6/C,GAAc,CACjBjM,aAAc/V,EAAO+V,aACrBe,UAAW9W,EAAO8W,UAClBsJ,qBAAsButB,GAE9B,ECnMG,MAAM,WAAmBxrE,MAC5BqrD,YAAc,aACd,WAAAv6C,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,YAChB,EAKG,MAAMkpE,WAA4BzrE,MACrCqrD,YAAc,sBACd,WAAAv6C,CAAY9C,EAAU,mBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAK4CvC,MAUzC,MAAM,WAA+BA,MACxCqrD,YAAc,yBACd,WAAAv6C,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAKG,MAAMmpE,WAA8B1rE,MACvCqrD,YAAc,wBACd,WAAAv6C,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMopE,WAA+B3rE,MACxCqrD,YAAc,yBACd,WAAAv6C,CAAY9C,EAAU,uBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAK2CvC,MAUxC,MAAM4rE,WAA+B5rE,MACxCqrD,YAAc,yBACd,WAAAv6C,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAKG,MAAMspE,WAA8B7rE,MACvCqrD,YAAc,wBACd,WAAAv6C,CAAY9C,EAAU,4BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMupE,WAA8B9rE,MACvCqrD,YAAc,wBACd,WAAAv6C,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMwpE,WAAyB/rE,MAClCqrD,YAAc,mBACd,WAAAv6C,CAAY9C,EAAU,uBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,kBAChB,EAKG,MAAMypE,WAAyBhsE,MAClCqrD,YAAc,mBACd,WAAAv6C,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,kBAChB,EAKG,MAAM0pE,WAAyBjsE,MAClCqrD,YAAc,mBACd,WAAAv6C,CAAY9C,EAAU,qCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,kBAChB,EAKG,MAAM2pE,WAAsBlsE,MAC/BqrD,YAAc,gBACd,WAAAv6C,CAAY9C,EAAU,aAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,eAChB,EAKG,MAAM4pE,WAA2BnsE,MACpCqrD,YAAc,qBACd,WAAAv6C,CAAY9C,EAAU,kBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,oBAChB,EAKG,MAAM6pE,WAA8BpsE,MACvCqrD,YAAc,wBACd,WAAAv6C,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAM8pE,WAAwBrsE,MACjCqrD,YAAc,kBACd,WAAAv6C,CAAY9C,EAAU,eAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,iBAChB,EAKG,MAAM+pE,WAA8BtsE,MACvCqrD,YAAc,wBACd,WAAAv6C,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAKG,MAAMgqE,WAAiCvsE,MAC1CqrD,YAAc,2BACd,WAAAv6C,CAAY9C,EAAU,8BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,0BAChB,EAKG,MAAMiqE,WAA4BxsE,MACrCqrD,YAAc,sBACd,WAAAv6C,CAAY9C,EAAU,mBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAMG,MAAM,WAAsBvC,MAC/BqrD,YAAc,gBACd,WAAAv6C,CAAY9C,EAAU,kBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,eAChB,EAKG,MAAMkqE,WAAqBzsE,MAC9BqrD,YAAc,eACd,WAAAv6C,CAAY9C,EAAU,aAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,cAChB,EAMG,MAAMmqE,WAAwB1sE,MACjCqrD,YAAc,kBACd,WAAAv6C,CAAY9C,EAAU,eAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,iBAChB,EAKqCvC,MAUlC,MAAM2sE,WAAkB3sE,MAC3BqrD,YAAc,YACd,WAAAv6C,CAAY9C,EAAU,cAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,WAChB,EAK6BvC,MAY1B,MAAM4sE,WAA+B5sE,MACxCqrD,YAAc,yBACd,WAAAv6C,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAKG,MAAMsqE,WAA2C7sE,MACpDqrD,YAAc,qCACd,WAAAv6C,CAAY9C,EAAU,qCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,oCAChB,EAKG,MAAMuqE,WAA4C9sE,MACrDqrD,YAAc,sCACd,WAAAv6C,CAAY9C,EAAU,sCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qCAChB,EAKG,MAAM,WAAgCvC,MACzCqrD,YAAc,0BACd,WAAAv6C,CAAY9C,EAAU,wBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,yBAChB,EC/SJ,MAAMwqE,GAAW/sD,SAAS,QAAS,GAC7BgtD,GAAmBhtD,SAAS,WAAY,GACxCitD,GAAyBjtD,SAAS,WAAY,GAC9C,GAAW,CACb,EAAKktD,GACL,EAAKA,GACL,EAkDJ,SAAqBl8D,EAAK1P,GACtB,MAAM2B,EAASkqE,GAAWn8D,EAAK1P,GACzBkH,EAAQlH,EAAQoD,OAChB+D,EAAMnH,EAAQoD,OAASzB,EACvBmqE,EAAO,GACb,IAAK,IAAIrqE,EAAIyF,EAAOzF,EAAI0F,EAAK1F,IACrBA,IAAMyF,GAAoB,IAAXwI,EAAIjO,IAGvBqqE,EAAKprE,KAAKgP,EAAIjO,IAGlB,OADAzB,EAAQoD,QAAUzB,EACXwO,WAAWsO,KAAKqtD,EAC3B,EA9DI,EA0GJ,SAAuBp8D,EAAK1P,GACxB,MAAM2B,EAASkqE,GAAWn8D,EAAK1P,GACzB+rE,EAAar8D,EAAI1P,EAAQoD,QAC/BpD,EAAQoD,SACR,MAAM4L,EAAQU,EAAIyS,SAASniB,EAAQoD,OAAQpD,EAAQoD,OAASzB,EAAS,GAErE,GADA3B,EAAQoD,QAAUzB,EACC,IAAfoqE,EAEA,MAAM,IAAIrtE,MAAM,8CAEpB,OAAOsQ,CACX,EApHI,EAqHJ,SAAyBU,EAAK1P,GAC1B,MAAM2B,EAASkqE,GAAWn8D,EAAK1P,GACzBgP,EAAQU,EAAIyS,SAASniB,EAAQoD,OAAQpD,EAAQoD,OAASzB,GAE5D,OADA3B,EAAQoD,QAAUzB,EACXqN,CACX,EAzHI,EAoGJ,SAAkBU,EAAK1P,GAEnB,OADAA,EAAQoD,SACD,IACX,EAtGI,EA4DJ,SAA8BsM,EAAK1P,GAC/B,MAAM2nB,EAAQkkD,GAAWn8D,EAAK1P,GACxBgsE,EAAchsE,EAAQoD,OAASukB,EAC/ByoC,EAAO1gD,EAAI1P,EAAQoD,QACzBpD,EAAQoD,SACR,IAAI6oE,EAAO,EACPC,EAAO,EACP9b,EAAO,IACP6b,EAAO,EACPC,EAAO9b,GAEFA,EAAO,IACZ6b,EAAO,EACPC,EAAO9b,EAAO,KAGd6b,EAAO,EACPC,EAAO9b,EAAO,IAElB,IAAI+b,EAAM,GAAGF,KAAQC,IACjBx/B,EAAM,GACV,KAAO1sC,EAAQoD,OAAS4oE,GAAa,CACjC,MAAM5b,EAAO1gD,EAAI1P,EAAQoD,QAIzB,GAHApD,EAAQoD,SAERspC,EAAIhsC,KAAY,IAAP0vD,GACLA,EAAO,IAAK,CACZ1jB,EAAI8S,UAEJ,IAAIr0C,EAAM,EACV,IAAK,IAAI1J,EAAI,EAAGA,EAAIirC,EAAI/qC,OAAQF,IAC5B0J,GAAOuhC,EAAIjrC,IAAW,EAAJA,EAEtB0qE,GAAO,IAAIhhE,IACXuhC,EAAM,EACV,CACJ,CACA,OAAOy/B,CACX,EAjGI,GAAMP,GACN,GAAMA,GACN,GAAMA,IAEH,SAAS,GAAUl8D,EAAK1P,EAAU,CAAEoD,OAAQ,IAC/C,MAAM4vC,EAAMtjC,EAAI1P,EAAQoD,QAAUqoE,GAElC,GADAzrE,EAAQoD,SACa,MAAjB,GAAS4vC,GACT,OAAO,GAASA,GAAKtjC,EAAK1P,GAE9B,MAAM,IAAItB,MAAM,sBAAwBs0C,EAC5C,CACA,SAAS64B,GAAWn8D,EAAK1P,GACrB,IAAI2B,EAAS,EACb,IAAK+N,EAAI1P,EAAQoD,QAAUsoE,MAAsBA,GAAkB,CAE/D,MAAM/jD,EAAQjY,EAAI1P,EAAQoD,QAAUuoE,GACpC,IAAI1lE,EAAM,KACVjG,EAAQoD,SACR,IAAK,IAAI3B,EAAI,EAAGA,EAAIkmB,EAAOlmB,IAAKzB,EAAQoD,SACpC6C,GAAOyJ,EAAI1P,EAAQoD,QAAQmD,SAAS,IAAIiqD,SAAS,EAAG,KAExD7uD,EAAS+c,SAASzY,EAAK,GAC3B,MAEItE,EAAS+N,EAAI1P,EAAQoD,QACrBpD,EAAQoD,SAEZ,OAAOzB,CACX,CACA,SAASiqE,GAAal8D,EAAK1P,GACvB6rE,GAAWn8D,EAAK1P,GAChB,MAAMqwD,EAAU,GAChB,OACQrwD,EAAQoD,QAAUsM,EAAIgB,aADjB,CAIT,MAAMsE,EAAS,GAAUtF,EAAK1P,GAC9B,GAAe,OAAXgV,EACA,MAEJq7C,EAAQ3vD,KAAKsU,EACjB,CACA,OAAOq7C,CACX,CAuFA,SAAS3O,GAAa1yC,GAClB,GAAIA,EAAM0B,WAAa,IACnB,OAAOP,WAAWsO,KAAK,CAACzP,EAAM0B,aAGlC,MAAM/O,EAhBV,SAAsBzC,GAClB,IAAIktE,EAASltE,EAAMqH,SAAS,IACxB6lE,EAAOzqE,OAAS,GAAM,IACtByqE,EAAS,IAAMA,GAEnB,MAAMp5D,EAAQ,IAAIksC,GAClB,IAAK,IAAIz9C,EAAI,EAAGA,EAAI2qE,EAAOzqE,OAAQF,GAAK,EACpCuR,EAAMqsC,OAAOlvC,WAAWsO,KAAK,CAACC,SAAS,GAAG0tD,EAAO3qE,KAAK2qE,EAAO3qE,EAAI,KAAM,OAE3E,OAAOuR,CACX,CAMmBq5D,CAAar9D,EAAM0B,YAClC,OAAO,IAAIwuC,GAAe/uC,WAAWsO,KAAK,CACtC9c,EAAO+O,WAAag7D,KACpB/pE,EACR,CACO,SAAS2qE,GAAcptE,GAC1B,MAAM+wB,EAAW,IAAIivB,GAOrB,QANa,KACKhgD,EAAMijB,WAAW,KAE/B8N,EAASovB,OAAOlvC,WAAWsO,KAAK,CAAC,KAErCwR,EAASovB,OAAOngD,GACT,IAAIggD,GAAe/uC,WAAWsO,KAAK,CAAC,IAAQijC,GAAazxB,GAAWA,EAC/E,CACO,SAASs8C,GAAgBrtE,GAE5B,MAAM6sE,EAAa57D,WAAWsO,KAAK,CAAC,IAC9BwR,EAAW,IAAIivB,GAAe6sB,EAAY7sE,GAChD,OAAO,IAAIggD,GAAe/uC,WAAWsO,KAAK,CAAC,IAAQijC,GAAazxB,GAAWA,EAC/E,CAIO,SAASu8C,GAAerpE,EAAQ6vC,EAAM,IACzC,MAAM6L,EAAS,IAAIK,GACnB,IAAK,MAAMxvC,KAAOvM,EACd07C,EAAOQ,OAAO3vC,GAElB,OAAO,IAAIwvC,GAAe/uC,WAAWsO,KAAK,CAACu0B,IAAO0O,GAAa7C,GAASA,EAC5E,CC3KO,MAAM4tB,GACTpnE,KAAO,QACPqnE,IACAC,KACA,WAAAn9D,CAAYk9D,GACRxsE,KAAKwsE,IAAMA,CACf,CACA,OAAIE,GCoHD,IAA+BC,EDhH9B,OAHiB,MAAb3sE,KAAKysE,OACLzsE,KAAKysE,MCkHqBE,EDlHQ3sE,KAAKwsE,ICmHxCF,GAAe,CAClBF,GAAcn8D,WAAWsO,KAAK,CAAC,KAC/B+tD,GAAe,CACXM,GAAOD,EAAUE,MAClB,KACHP,GAAe,CACXD,GAAgB,IAAIrtB,GAAe/uC,WAAWsO,KAAK,CAAC,IAAQ,GAAqBouD,EAAUx3D,GAAK,GAAI,aAAc,GAAqBw3D,EAAUG,GAAK,GAAI,gBAC3J,OACJ7qD,aDzHQjiB,KAAKysE,IAChB,CACA,WAAAM,GACI,OAAO,GAASl3D,OAAOm3D,GAAoBhtE,MAC/C,CACA,KAAAitE,GACI,OAAOn/B,GAAIO,SAAS,IAAKruC,KAAK+sE,cAClC,CACA,QAAA1mE,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAK+sE,cAAcj+D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,YAAMltD,CAAOmqB,EAAMujC,GACf,OEVD//B,eAA6BpuC,EAAKmuE,EAAKv1B,GAC1C,MAAMg1B,QAAkBv/B,OAAOC,OAAO8/B,UAAU,MAAOpuE,EAAK,CACxDgC,KAAM,QACNqsE,WAAYruE,EAAI8tE,KAAO,UACxB,EAAO,CAAC,WACX,OAAOz/B,OAAOC,OAAO7tB,OAAO,CACxBze,KAAM,QACNqM,KAAM,CACFrM,KAAM,YAEX4rE,EAAWO,EAAKv1B,EAAI11B,WAC3B,CFDeorD,CAAcrtE,KAAKwsE,IAAKU,EAAKvjC,EACxC,EAEG,MAAM2jC,GACTnoE,KAAO,QACPqnE,IACAG,UACAF,KACA,WAAAn9D,CAAYk9D,GACRxsE,KAAKwsE,IAAMA,EACXxsE,KAAK2sE,UAAY,IAAIJ,GAAe,CAChCM,IAAKL,EAAIK,IACTU,IAAKf,EAAIe,IACTC,QAAS,CAAC,UACVC,IAAK,KACLt4D,EAAGq3D,EAAIr3D,EACP23D,EAAGN,EAAIM,GAEf,CACA,OAAIJ,GC+DD,IAAgCgB,EFmDL1uE,EC9G1B,OAHiB,MAAbgB,KAAKysE,OACLzsE,KAAKysE,MC6DsBiB,ED7DQ1tE,KAAKwsE,IC8DzCF,GAAe,CAClBF,GAAcn8D,WAAWsO,KAAK,CAAC,MFiDLvf,EEhDR,GAAqB0uE,EAAWjxD,GAAK,GAAI,aFiDxD,IAAIuiC,GAAe/uC,WAAWsO,KAAK,CAAC,IAAQijC,GAAaxiD,GAAQA,IEhDpEstE,GAAe,CACXM,GAAOc,EAAWb,MACnB,KACHP,GAAe,CACXD,GAAgB,IAAIrtB,GAAe/uC,WAAWsO,KAAK,CAAC,IAAQ,GAAqBmvD,EAAWv4D,GAAK,GAAI,aAAc,GAAqBu4D,EAAWZ,GAAK,GAAI,gBAC7J,OACJ7qD,aDrEQjiB,KAAKysE,IAChB,CACA,MAAAn+B,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,UAAMpuD,CAAK9R,GACP,OEvDD2gC,eAA2BpuC,EAAK44C,GACnC,MAAM+1B,QAAmBtgC,OAAOC,OAAO8/B,UAAU,MAAOpuE,EAAK,CACzDgC,KAAM,QACNqsE,WAAYruE,EAAI8tE,KAAO,UACxB,EAAO,CAAC,SACLc,QAAkBvgC,OAAOC,OAAO/uB,KAAK,CACvCvd,KAAM,QACNqM,KAAM,CACFrM,KAAM,YAEX2sE,EAAY/1B,EAAI11B,YACnB,OAAO,IAAIhS,WAAW09D,EAAW,EAAGA,EAAUn9D,WAClD,CF2Ceo9D,CAAY5tE,KAAKwsE,IAAKhgE,EACjC,EC7DJ,MAAMqhE,GAAU59D,WAAWsO,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,GAAM,IAAM,GAAM,EAAM,EAAM,IAEjFuvD,GAAU79D,WAAWsO,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,EAAM,EAAM,KAE/DwvD,GAAU99D,WAAWsO,KAAK,CAAC,EAAM,EAAM,GAAM,IAAM,EAAM,EAAM,KAC/DyvD,GAAgB,CAClBT,KAAK,EACLE,IAAK,KACLZ,IAAK,SAEHoB,GAAgB,CAClBV,KAAK,EACLE,IAAK,KACLZ,IAAK,SAEHqB,GAAgB,CAClBX,KAAK,EACLE,IAAK,KACLZ,IAAK,SAmDF,SAASsB,GAAwBr/D,GAEpC,OAAOs/D,GADS,GAAUt/D,GAE9B,CACO,SAASs/D,GAA2B5hE,GACvC,MAAM6hE,EAAc7hE,EAAQ,GAAG,GAAG,GAElC,IAAI2I,EACA23D,EACJ,GAA+B,KAA3BuB,EAAY79D,WAGZ,OAFA2E,EAAI,GAAmBk5D,EAAYpsD,SAJxB,EAIyC/e,IAA4B,aAChF4pE,EAAI,GAAmBuB,EAAYpsD,SAAS/e,IAA4B,aACjE,IAAIqpE,GAAoB,IACxByB,GACHR,QAAS,CAAC,UACVr4D,IACA23D,MAGR,GAA+B,KAA3BuB,EAAY79D,WAGZ,OAFA2E,EAAI,GAAmBk5D,EAAYpsD,SAdxB,EAcyC/e,IAA4B,aAChF4pE,EAAI,GAAmBuB,EAAYpsD,SAAS/e,IAA4B,aACjE,IAAIqpE,GAAoB,IACxB0B,GACHT,QAAS,CAAC,UACVr4D,IACA23D,MAGR,GAA+B,MAA3BuB,EAAY79D,WAGZ,OAFA2E,EAAI,GAAmBk5D,EAAYpsD,SAxBxB,EAwByC/e,IAA4B,aAChF4pE,EAAI,GAAmBuB,EAAYpsD,SAAS/e,IAA4B,aACjE,IAAIqpE,GAAoB,IACxB2B,GACHV,QAAS,CAAC,UACVr4D,IACA23D,MAGR,MAAM,IAAI,GAAuB,sCAAsCuB,EAAY79D,qCACvF,CAwBA,SAASo8D,GAAO0B,GACZ,GAAc,UAAVA,EACA,OAAOT,GAEX,GAAc,UAAVS,EACA,OAAOR,GAEX,GAAc,UAAVQ,EACA,OAAOP,GAEX,MAAM,IAAI,GAAuB,iBAAiBO,IACtD,CEnJA,MAAMC,GAA6BtoC,OAAO,GAAK,GAAK,GAC9C2S,GAAuB3S,OAAO,IACpC,SAASuoC,GAAQh7D,EAAG6sB,GAAK,GACrB,OAAIA,EACO,CAAEvqB,EAAGvL,OAAOiJ,EAAI+6D,IAAa/sE,EAAG+I,OAAQiJ,GAAKolC,GAAQ21B,KACzD,CAAEz4D,EAAsC,EAAnCvL,OAAQiJ,GAAKolC,GAAQ21B,IAAiB/sE,EAA4B,EAAzB+I,OAAOiJ,EAAI+6D,IACpE,CAoCA,MASME,GAAM,CACRD,WAAS9mE,MA7Cb,SAAegnE,EAAKruC,GAAK,GACrB,IAAIsuC,EAAK,IAAI/4D,YAAY84D,EAAIjtE,QACzBmtE,EAAK,IAAIh5D,YAAY84D,EAAIjtE,QAC7B,IAAK,IAAIF,EAAI,EAAGA,EAAImtE,EAAIjtE,OAAQF,IAAK,CACjC,MAAM,EAAEuU,EAAC,EAAEtU,GAAMgtE,GAAQE,EAAIntE,GAAI8+B,IAChCsuC,EAAGptE,GAAIqtE,EAAGrtE,IAAM,CAACuU,EAAGtU,EACzB,CACA,MAAO,CAACmtE,EAAIC,EAChB,EAqCoBC,MApCN,CAAC/4D,EAAGtU,IAAOykC,OAAOnwB,IAAM,IAAM8iC,GAAQ3S,OAAOzkC,IAAM,GAqC7DstE,MAnCU,CAACh5D,EAAGi5D,EAAIhsE,IAAM+S,IAAM/S,EAmCvBisE,MAlCG,CAACl5D,EAAGtU,EAAGuB,IAAO+S,GAAM,GAAK/S,EAAOvB,IAAMuB,EAmChDksE,OAjCW,CAACn5D,EAAGtU,EAAGuB,IAAO+S,IAAM/S,EAAMvB,GAAM,GAAKuB,EAiCxCmsE,OAhCG,CAACp5D,EAAGtU,EAAGuB,IAAO+S,GAAM,GAAK/S,EAAOvB,IAAMuB,EAgCjCosE,OA9BL,CAACr5D,EAAGtU,EAAGuB,IAAO+S,GAAM,GAAK/S,EAAOvB,IAAOuB,EAAI,GA8B9BqsE,OA7Bb,CAACt5D,EAAGtU,EAAGuB,IAAO+S,IAAO/S,EAAI,GAAQvB,GAAM,GAAKuB,EA8BvDssE,QA5BY,CAACC,EAAI9tE,IAAMA,EA4Bd+tE,QA3BG,CAACz5D,EAAGi5D,IAAOj5D,EA4BvB05D,OA1BW,CAAC15D,EAAGtU,EAAGuB,IAAO+S,GAAK/S,EAAMvB,IAAO,GAAKuB,EA0BxC0sE,OAzBG,CAAC35D,EAAGtU,EAAGuB,IAAOvB,GAAKuB,EAAM+S,IAAO,GAAK/S,EAyBhC2sE,OAvBL,CAAC55D,EAAGtU,EAAGuB,IAAOvB,GAAMuB,EAAI,GAAQ+S,IAAO,GAAK/S,EAuB/B4sE,OAtBb,CAAC75D,EAAGtU,EAAGuB,IAAO+S,GAAM/S,EAAI,GAAQvB,IAAO,GAAKuB,EAuBvDia,IApBJ,SAAa2xD,EAAIC,EAAIgB,EAAIC,GACrB,MAAMruE,GAAKotE,IAAO,IAAMiB,IAAO,GAC/B,MAAO,CAAE/5D,EAAI64D,EAAKiB,GAAOpuE,EAAI,GAAK,GAAM,GAAM,EAAGA,EAAO,EAAJA,EACxD,EAiBSsuE,MAfK,CAAClB,EAAIiB,EAAIE,KAAQnB,IAAO,IAAMiB,IAAO,IAAME,IAAO,GAehDC,MAdF,CAACthE,EAAKigE,EAAIiB,EAAIK,IAAQtB,EAAKiB,EAAKK,GAAOvhE,EAAM,GAAK,GAAM,GAAM,EAcrDwhE,MAbT,CAACtB,EAAIiB,EAAIE,EAAII,KAAQvB,IAAO,IAAMiB,IAAO,IAAME,IAAO,IAAMI,IAAO,GAanDC,MAZhB,CAAC1hE,EAAKigE,EAAIiB,EAAIK,EAAII,IAAQ1B,EAAKiB,EAAKK,EAAKI,GAAO3hE,EAAM,GAAK,GAAM,GAAM,EAYhD4hE,MAVvB,CAAC5hE,EAAKigE,EAAIiB,EAAIK,EAAII,EAAIE,IAAQ5B,EAAKiB,EAAKK,EAAKI,EAAKE,GAAO7hE,EAAM,GAAK,GAAM,GAAM,EAUlD8hE,MAX9B,CAAC5B,EAAIiB,EAAIE,EAAII,EAAIM,KAAQ7B,IAAO,IAAMiB,IAAO,IAAME,IAAO,IAAMI,IAAO,IAAMM,IAAO,IAalG,OCpDOC,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,sBACpErsE,KAAIkP,GAAKyyB,OAAOzyB,MArB6B,GAuBzCo9D,GAA6B,IAAIh7D,YAAY,IAC7Ci7D,GAA6B,IAAIj7D,YAAY,IAC5C,MAAMk7D,WAAe74B,GACxB,WAAA3oC,CAAYknC,EAAY,IACpBpG,MAAM,IAAKoG,EAAW,IAAI,GAK1Bx2C,KAAK2uE,GAAK,WACV3uE,KAAK4uE,IAAK,UACV5uE,KAAK4vE,IAAK,WACV5vE,KAAK6vE,IAAK,WACV7vE,KAAKiwE,GAAK,WACVjwE,KAAK+vE,IAAK,SACV/vE,KAAKqwE,IAAK,WACVrwE,KAAKmwE,GAAK,WACVnwE,KAAKuwE,GAAK,WACVvwE,KAAKywE,IAAK,WACVzwE,KAAK+wE,IAAK,WACV/wE,KAAKgxE,GAAK,UACVhxE,KAAKixE,GAAK,UACVjxE,KAAKkxE,IAAK,SACVlxE,KAAKmxE,GAAK,WACVnxE,KAAKoxE,GAAK,SACd,CAEA,GAAAhyE,GACI,MAAM,GAAEuvE,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,GAAOpxE,KAC3E,MAAO,CAAC2uE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACxE,CAEA,GAAA9xE,CAAIqvE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,GAC5DpxE,KAAK2uE,GAAU,EAALA,EACV3uE,KAAK4uE,GAAU,EAALA,EACV5uE,KAAK4vE,GAAU,EAALA,EACV5vE,KAAK6vE,GAAU,EAALA,EACV7vE,KAAKiwE,GAAU,EAALA,EACVjwE,KAAK+vE,GAAU,EAALA,EACV/vE,KAAKqwE,GAAU,EAALA,EACVrwE,KAAKmwE,GAAU,EAALA,EACVnwE,KAAKuwE,GAAU,EAALA,EACVvwE,KAAKywE,GAAU,EAALA,EACVzwE,KAAK+wE,GAAU,EAALA,EACV/wE,KAAKgxE,GAAU,EAALA,EACVhxE,KAAKixE,GAAU,EAALA,EACVjxE,KAAKkxE,GAAU,EAALA,EACVlxE,KAAKmxE,GAAU,EAALA,EACVnxE,KAAKoxE,GAAU,EAALA,CACd,CACA,OAAAhgE,CAAQgnC,EAAMl1C,GAEV,IAAK,IAAI3B,EAAI,EAAGA,EAAI,GAAIA,IAAK2B,GAAU,EACnC0tE,GAAWrvE,GAAK62C,EAAK6B,UAAU/2C,GAC/B2tE,GAAWtvE,GAAK62C,EAAK6B,UAAW/2C,GAAU,GAE9C,IAAK,IAAI3B,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAE1B,MAAM8vE,EAA4B,EAArBT,GAAWrvE,EAAI,IACtB+vE,EAA4B,EAArBT,GAAWtvE,EAAI,IACtBgwE,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,GAAWrvE,EAAI,GACrBmwE,EAA0B,EAApBb,GAAWtvE,EAAI,GACrBowE,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,GAAWtvE,EAAI,GAAIsvE,GAAWtvE,EAAI,KAC7DuwE,EAAO,SAAUD,EAAMN,EAAKI,EAAKf,GAAWrvE,EAAI,GAAIqvE,GAAWrvE,EAAI,KACzEqvE,GAAWrvE,GAAY,EAAPuwE,EAChBjB,GAAWtvE,GAAY,EAAPswE,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,GAAOpxE,KAEzE,IAAK,IAAIuB,EAAI,EAAGA,EAAI,GAAIA,IAAK,CAEzB,MAAMwwE,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,GAAUpvE,GAAIsvE,GAAWtvE,IAC7D6wE,EAAM,SAAUD,EAAMhB,EAAIY,EAASE,EAAMvB,GAAUnvE,GAAIqvE,GAAWrvE,IAClE8wE,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,IACF36D,EAAGy6D,EAAI/uE,EAAGivE,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,GAEG58D,EAAG64D,EAAIntE,EAAGotE,GAAO,OAAkB,EAAV5uE,KAAK2uE,GAAkB,EAAV3uE,KAAK4uE,GAAa,EAALD,EAAa,EAALC,MAC3D94D,EAAG85D,EAAIpuE,EAAGquE,GAAO,OAAkB,EAAV7vE,KAAK4vE,GAAkB,EAAV5vE,KAAK6vE,GAAa,EAALD,EAAa,EAALC,MAC3D/5D,EAAGm6D,EAAIzuE,EAAGuuE,GAAO,OAAkB,EAAV/vE,KAAKiwE,GAAkB,EAAVjwE,KAAK+vE,GAAa,EAALE,EAAa,EAALF,MAC3Dj6D,EAAGu6D,EAAI7uE,GAAU,OAAkB,EAAVxB,KAAKqwE,GAAkB,EAAVrwE,KAAKmwE,GAAa,EAALE,EAAa,EAALF,MAC3Dr6D,EAAGy6D,EAAI/uE,EAAGivE,GAAO,OAAkB,EAAVzwE,KAAKuwE,GAAkB,EAAVvwE,KAAKywE,GAAa,EAALF,EAAa,EAALE,MAC3D36D,EAAGi7D,EAAIvvE,EAAGwvE,GAAO,OAAkB,EAAVhxE,KAAK+wE,GAAkB,EAAV/wE,KAAKgxE,GAAa,EAALD,EAAa,EAALC,MAC3Dl7D,EAAGm7D,EAAIzvE,EAAG0vE,GAAO,OAAkB,EAAVlxE,KAAKixE,GAAkB,EAAVjxE,KAAKkxE,GAAa,EAALD,EAAa,EAALC,MAC3Dp7D,EAAGq7D,EAAI3vE,EAAG4vE,GAAO,OAAkB,EAAVpxE,KAAKmxE,GAAkB,EAAVnxE,KAAKoxE,GAAa,EAALD,EAAa,EAALC,IAC9DpxE,KAAKV,IAAIqvE,EAAIC,EAAIgB,EAAIC,EAAII,EAAIF,EAAIM,EAAIF,EAAII,EAAIE,EAAIM,EAAIC,EAAIC,EAAIC,EAAIC,EAAIC,EACzE,CACA,UAAA74B,GACIq4B,GAAWl4B,KAAK,GAChBm4B,GAAWn4B,KAAK,EACpB,CACA,OAAAjtC,GACIzL,KAAK0S,OAAOgmC,KAAK,GACjB14C,KAAKV,IAAI,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAC1D,EAqEG,MAAM,GAAyB,IAAgB,IAAM,IAAIwxE,KC9N1D6B,GAAsB1sC,OAAO,GAC7B2sC,GAAsB3sC,OAAO,GAC5B,SAAS,GAAQtlB,GACpB,OAAOA,aAAa1Q,YAAe4B,YAAYW,OAAOmO,IAA6B,eAAvBA,EAAErR,YAAYvO,IAC9E,CACO,SAAS,GAAOykD,GACnB,IAAK,GAAQA,GACT,MAAM,IAAIhnD,MAAM,sBACxB,CACO,SAASq0E,GAAMC,EAAO9zE,GACzB,GAAqB,kBAAVA,EACP,MAAM,IAAIR,MAAMs0E,EAAQ,0BAA4B9zE,EAC5D,CACO,SAAS+zE,GAAoBvmC,GAChC,MAAM92B,EAAM82B,EAAInmC,SAAS,IACzB,OAAoB,EAAbqP,EAAIjU,OAAa,IAAMiU,EAAMA,CACxC,CACO,SAASs9D,GAAYt9D,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIlX,MAAM,mCAAqCkX,GACzD,MAAe,KAARA,EAAai9D,GAAM1sC,OAAO,KAAOvwB,EAC5C,CAEA,MAAM,GAE+B,mBAA9BzF,WAAWsO,KAAK,IAAI84B,OAAsD,mBAAvBpnC,WAAWqnC,QAE/D,GAAwB31C,MAAM4c,KAAK,CAAE9c,OAAQ,MAAO,CAACk3B,EAAGp3B,IAAMA,EAAE8E,SAAS,IAAIiqD,SAAS,EAAG,OAKxF,SAAS,GAAWxhD,GAGvB,GAFA,GAAOA,GAEH,GACA,OAAOA,EAAMuoC,QAEjB,IAAI3hC,EAAM,GACV,IAAK,IAAInU,EAAI,EAAGA,EAAIuN,EAAMrN,OAAQF,IAC9BmU,GAAO,GAAM5G,EAAMvN,IAEvB,OAAOmU,CACX,CAGA,SAAS,GAAcu9D,GACnB,OAAIA,GAFa,IAEMA,GAFE,GAGdA,EAHM,GAIbA,GAJ4B,IAIVA,GAJiB,GAK5BA,EAAK,GACZA,GAN0C,IAMxBA,GAN+B,IAO1CA,EAAK,QADhB,CAGJ,CAKO,SAAS,GAAWv9D,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAIlX,MAAM,mCAAqCkX,GAEzD,GAAI,GACA,OAAOzF,WAAWqnC,QAAQ5hC,GAC9B,MAAMw9D,EAAKx9D,EAAIjU,OACT0xE,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI10E,MAAM,mDAAqD00E,GACzE,MAAMpgE,EAAQ,IAAI7C,WAAWkjE,GAC7B,IAAK,IAAIC,EAAK,EAAGn1D,EAAK,EAAGm1D,EAAKD,EAAIC,IAAMn1D,GAAM,EAAG,CAC7C,MAAMo1D,EAAK,GAAc39D,EAAIrI,WAAW4Q,IAClCq1D,EAAK,GAAc59D,EAAIrI,WAAW4Q,EAAK,IAC7C,QAAW/e,IAAPm0E,QAA2Bn0E,IAAPo0E,EAAkB,CACtC,MAAM3oC,EAAOj1B,EAAIuI,GAAMvI,EAAIuI,EAAK,GAChC,MAAM,IAAIzf,MAAM,+CAAiDmsC,EAAO,cAAgB1sB,EAC5F,CACAnL,EAAMsgE,GAAW,GAALC,EAAUC,CAC1B,CACA,OAAOxgE,CACX,CAEO,SAAS,GAAgBhE,GAC5B,OAAOkkE,GAAY,GAAWlkE,GAClC,CACO,SAAS,GAAgBA,GAE5B,OADA,GAAOA,GACAkkE,GAAY,GAAW/iE,WAAWsO,KAAKzP,GAAOwwC,WACzD,CACO,SAAS,GAAgB9rC,EAAGpR,GAC/B,OAAO,GAAWoR,EAAEnN,SAAS,IAAIiqD,SAAe,EAANluD,EAAS,KACvD,CACO,SAAS,GAAgBoR,EAAGpR,GAC/B,OAAO,GAAgBoR,EAAGpR,GAAKk9C,SACnC,CAcO,SAAS,GAAYwzB,EAAOp9D,EAAK69D,GACpC,IAAI3tC,EACJ,GAAmB,iBAARlwB,EACP,IACIkwB,EAAM,GAAWlwB,EACrB,CACA,MAAOuO,GACH,MAAM,IAAIzlB,MAAMs0E,EAAQ,6CAA+C7uD,EAC3E,KAEC,KAAI,GAAQvO,GAMb,MAAM,IAAIlX,MAAMs0E,EAAQ,qCAHxBltC,EAAM31B,WAAWsO,KAAK7I,EAI1B,CACA,MAAMtT,EAAMwjC,EAAInkC,OAChB,GAA8B,iBAAnB8xE,GAA+BnxE,IAAQmxE,EAC9C,MAAM,IAAI/0E,MAAMs0E,EAAQ,cAAgBS,EAAiB,kBAAoBnxE,GACjF,OAAOwjC,CACX,CAIO,SAAS,MAAe8Y,GAC3B,IAAI80B,EAAM,EACV,IAAK,IAAIjyE,EAAI,EAAGA,EAAIm9C,EAAOj9C,OAAQF,IAAK,CACpC,MAAMof,EAAI+9B,EAAOn9C,GACjB,GAAOof,GACP6yD,GAAO7yD,EAAElf,MACb,CACA,MAAMmkC,EAAM,IAAI31B,WAAWujE,GAC3B,IAAK,IAAIjyE,EAAI,EAAGqoC,EAAM,EAAGroC,EAAIm9C,EAAOj9C,OAAQF,IAAK,CAC7C,MAAMof,EAAI+9B,EAAOn9C,GACjBqkC,EAAItmC,IAAIqhB,EAAGipB,GACXA,GAAOjpB,EAAElf,MACb,CACA,OAAOmkC,CACX,CAmBA,MAAM6tC,GAAYjgE,GAAmB,iBAANA,GAAkBm/D,IAAOn/D,EACjD,SAAS,GAAQA,EAAGtK,EAAK3K,GAC5B,OAAOk1E,GAASjgE,IAAMigE,GAASvqE,IAAQuqE,GAASl1E,IAAQ2K,GAAOsK,GAAKA,EAAIjV,CAC5E,CAMO,SAAS,GAASu0E,EAAOt/D,EAAGtK,EAAK3K,GAMpC,IAAK,GAAQiV,EAAGtK,EAAK3K,GACjB,MAAM,IAAIC,MAAM,kBAAoBs0E,EAAQ,KAAO5pE,EAAM,WAAa3K,EAAM,SAAWiV,EAC/F,CA8BO,MAAM,GAAWA,IAAOo/D,IAAO3sC,OAAOzyB,IAAMo/D,GAE7Cc,GAAOtxE,GAAQ,IAAI6N,WAAW7N,GAC9BuxE,GAAQ38B,GAAQ/mC,WAAWsO,KAAKy4B,GA4DhC48B,GAAe,CACjBC,OAAS5oE,GAAuB,iBAARA,EACxB6oE,SAAW7oE,GAAuB,mBAARA,EAC1B8oE,QAAU9oE,GAAuB,kBAARA,EACzBsF,OAAStF,GAAuB,iBAARA,EACxB+oE,mBAAqB/oE,GAAuB,iBAARA,GAAoB,GAAQA,GAChEorC,cAAgBprC,GAAQV,OAAO8rC,cAAcprC,GAC7C6H,MAAQ7H,GAAQtJ,MAAM2Q,QAAQrH,GAC9BjH,MAAO,CAACiH,EAAKwU,IAAWA,EAAOw0D,GAAGC,QAAQjpE,GAC1CmC,KAAOnC,GAAuB,mBAARA,GAAsBV,OAAO8rC,cAAcprC,EAAIurC,YAGlE,SAAS29B,GAAe10D,EAAQ20D,EAAYC,EAAgB,CAAC,GAChE,MAAMC,EAAa,CAACv3D,EAAW5X,EAAMovE,KACjC,MAAMC,EAAWZ,GAAazuE,GAC9B,GAAwB,mBAAbqvE,EACP,MAAM,IAAIh2E,MAAM,8BACpB,MAAMyM,EAAMwU,EAAO1C,GACnB,KAAIw3D,QAAsBr1E,IAAR+L,GAEbupE,EAASvpE,EAAKwU,IACf,MAAM,IAAIjhB,MAAM,SAAWwQ,OAAO+N,GAAa,yBAA2B5X,EAAO,SAAW8F,EAChG,EAEJ,IAAK,MAAO8R,EAAW5X,KAASxG,OAAOwxD,QAAQikB,GAC3CE,EAAWv3D,EAAW5X,GAAM,GAChC,IAAK,MAAO4X,EAAW5X,KAASxG,OAAOwxD,QAAQkkB,GAC3CC,EAAWv3D,EAAW5X,GAAM,GAChC,OAAOsa,CACX,CAmBO,SAASg1D,GAAS50E,GACrB,MAAMyE,EAAM,IAAIspC,QAChB,MAAO,CAAC8mC,KAAQvyE,KACZ,MAAM8I,EAAM3G,EAAIlF,IAAIs1E,GACpB,QAAYx1E,IAAR+L,EACA,OAAOA,EACX,MAAM0pE,EAAW90E,EAAG60E,KAAQvyE,GAE5B,OADAmC,EAAIhF,IAAIo1E,EAAKC,GACNA,CAAQ,CAEvB,CC/UA,MAAM,GAAM1uC,OAAO,GAAI,GAAMA,OAAO,GAAI2uC,GAAsB3uC,OAAO,GAAI4uC,GAAsB5uC,OAAO,GAEhG6uC,GAAsB7uC,OAAO,GAAI8uC,GAAsB9uC,OAAO,GAAI+uC,GAAsB/uC,OAAO,GAI9F,SAAS,GAAItlB,EAAGC,GACnB,MAAM9L,EAAS6L,EAAIC,EACnB,OAAO9L,GAAU,GAAMA,EAAS8L,EAAI9L,CACxC,CAQO,SAAS6e,GAAI6Y,EAAKyoC,EAAOC,GAC5B,GAAID,EAAQ,GACR,MAAM,IAAIz2E,MAAM,2CACpB,GAAI02E,GAAU,GACV,MAAM,IAAI12E,MAAM,mBACpB,GAAI02E,IAAW,GACX,OAAO,GACX,IAAItvC,EAAM,GACV,KAAOqvC,EAAQ,IACPA,EAAQ,KACRrvC,EAAOA,EAAM4G,EAAO0oC,GACxB1oC,EAAOA,EAAMA,EAAO0oC,EACpBD,IAAU,GAEd,OAAOrvC,CACX,CAEO,SAASuvC,GAAKhgE,EAAG8/D,EAAOC,GAC3B,IAAItvC,EAAMzwB,EACV,KAAO8/D,KAAU,IACbrvC,GAAOA,EACPA,GAAOsvC,EAEX,OAAOtvC,CACX,CAKO,SAASwvC,GAAOlJ,EAAQgJ,GAC3B,GAAIhJ,IAAW,GACX,MAAM,IAAI1tE,MAAM,oCACpB,GAAI02E,GAAU,GACV,MAAM,IAAI12E,MAAM,0CAA4C02E,GAEhE,IAAIv0D,EAAI,GAAIurD,EAAQgJ,GAChBt0D,EAAIs0D,EAEJ//D,EAAI,GAAK23D,EAAI,GAAKuI,EAAI,GAAKh2E,EAAI,GACnC,KAAOshB,IAAM,IAAK,CAEd,MAAM6hB,EAAI5hB,EAAID,EACR6Z,EAAI5Z,EAAID,EACRyW,EAAIjiB,EAAIkgE,EAAI7yC,EACZhvB,EAAIs5D,EAAIztE,EAAImjC,EAElB5hB,EAAID,EAAGA,EAAI6Z,EAAGrlB,EAAIkgE,EAAGvI,EAAIztE,EAAGg2E,EAAIj+C,EAAG/3B,EAAImU,CAC3C,CAEA,GADYoN,IACA,GACR,MAAM,IAAIpiB,MAAM,0BACpB,OAAO,GAAI2W,EAAG+/D,EAClB,CAwIO,MAEDI,GAAe,CACjB,SAAU,UAAW,MAAO,MAAO,MAAO,OAAQ,MAClD,MAAO,MAAO,MAAO,MAAO,MAAO,MACnC,OAAQ,OAAQ,OAAQ,QAqFrB,SAASC,GAAQ/hE,EAAGgiE,GAEvB,MAAMC,OAA6Bv2E,IAAfs2E,EAA2BA,EAAahiE,EAAEnN,SAAS,GAAG5E,OAE1E,MAAO,CAAE+zE,WAAYC,EAAaC,YADdzsE,KAAK01B,KAAK82C,EAAc,GAEhD,CAgBO,SAAS,GAAME,EAAOC,EAAQz9B,GAAO,EAAO09B,EAAQ,CAAC,GACxD,GAAIF,GAAS,GACT,MAAM,IAAIn3E,MAAM,0CAA4Cm3E,GAChE,MAAQH,WAAYtjE,EAAMwjE,YAAaI,GAAUP,GAAQI,EAAOC,GAChE,GAAIE,EAAQ,KACR,MAAM,IAAIt3E,MAAM,kDACpB,IAAIu3E,EACJ,MAAM9gE,EAAItW,OAAOmd,OAAO,CACpB65D,QACAx9B,OACAjmC,OACA4jE,QACAE,KAAM,GAAQ9jE,GACd+jE,KAAM,GACNC,IAAK,GACLt3E,OAAS4tC,GAAQ,GAAIA,EAAKmpC,GAC1BzB,QAAU1nC,IACN,GAAmB,iBAARA,EACP,MAAM,IAAIhuC,MAAM,sDAAwDguC,GAC5E,OAAO,IAAOA,GAAOA,EAAMmpC,CAAK,EAEpCQ,IAAM3pC,GAAQA,IAAQ,GACtB4pC,MAAQ5pC,IAASA,EAAM,MAAS,GAChC6pC,IAAM7pC,GAAQ,IAAKA,EAAKmpC,GACxBW,IAAK,CAACC,EAAKC,IAAQD,IAAQC,EAC3BC,IAAMjqC,GAAQ,GAAIA,EAAMA,EAAKmpC,GAC7B34D,IAAK,CAACu5D,EAAKC,IAAQ,GAAID,EAAMC,EAAKb,GAClCe,IAAK,CAACH,EAAKC,IAAQ,GAAID,EAAMC,EAAKb,GAClCgB,IAAK,CAACJ,EAAKC,IAAQ,GAAID,EAAMC,EAAKb,GAClChiD,IAAK,CAAC6Y,EAAKyoC,IAnHZ,SAAehgE,EAAGu3B,EAAKyoC,GAG1B,GAAIA,EAAQ,GACR,MAAM,IAAIz2E,MAAM,2CACpB,GAAIy2E,IAAU,GACV,OAAOhgE,EAAEihE,IACb,GAAIjB,IAAU,GACV,OAAOzoC,EACX,IAAI9N,EAAIzpB,EAAEihE,IACNz5D,EAAI+vB,EACR,KAAOyoC,EAAQ,IACPA,EAAQ,KACRv2C,EAAIzpB,EAAE0hE,IAAIj4C,EAAGjiB,IACjBA,EAAIxH,EAAEwhE,IAAIh6D,GACVw4D,IAAU,GAEd,OAAOv2C,CACX,CAiG6Bk4C,CAAM3hE,EAAGu3B,EAAKyoC,GACnC4B,IAAK,CAACN,EAAKC,IAAQ,GAAID,EAAMnB,GAAOoB,EAAKb,GAAQA,GAEjDmB,KAAOtqC,GAAQA,EAAMA,EACrBuqC,KAAM,CAACR,EAAKC,IAAQD,EAAMC,EAC1BQ,KAAM,CAACT,EAAKC,IAAQD,EAAMC,EAC1BS,KAAM,CAACV,EAAKC,IAAQD,EAAMC,EAC1BU,IAAM1qC,GAAQ4oC,GAAO5oC,EAAKmpC,GAC1BwB,KAAMtB,EAAMsB,MACR,CAAE3jE,IACOuiE,IACDA,EAhNb,SAAgBqB,GAGnB,GAAIA,EAAItC,KAAQD,GAAK,CAKjB,MAAMwC,GAAUD,EAAI,IAAOtC,GAC3B,OAAO,SAAmBb,EAAIzgE,GAC1B,MAAMxC,EAAOijE,EAAGtgD,IAAIngB,EAAG6jE,GAEvB,IAAKpD,EAAGqC,IAAIrC,EAAGwC,IAAIzlE,GAAOwC,GACtB,MAAM,IAAIhV,MAAM,2BACpB,OAAOwS,CACX,CACJ,CAEA,GAAIomE,EAAIpC,KAAQD,GAAK,CACjB,MAAM/+D,GAAMohE,EAAIrC,IAAOC,GACvB,OAAO,SAAmBf,EAAIzgE,GAC1B,MAAM8/D,EAAKW,EAAG0C,IAAInjE,EAAGohE,IACfv1E,EAAI40E,EAAGtgD,IAAI2/C,EAAIt9D,GACfshE,EAAKrD,EAAG0C,IAAInjE,EAAGnU,GACfkC,EAAI0yE,EAAG0C,IAAI1C,EAAG0C,IAAIW,EAAI1C,IAAMv1E,GAC5B2R,EAAOijE,EAAG0C,IAAIW,EAAIrD,EAAGyC,IAAIn1E,EAAG0yE,EAAGiC,MACrC,IAAKjC,EAAGqC,IAAIrC,EAAGwC,IAAIzlE,GAAOwC,GACtB,MAAM,IAAIhV,MAAM,2BACpB,OAAOwS,CACX,CACJ,CAwBA,OA5HG,SAAuBomE,GAM1B,MAAMG,GAAaH,EAAI,IAAOxC,GAC9B,IAAI4C,EAAGC,EAAGC,EAGV,IAAKF,EAAIJ,EAAI,GAAKK,EAAI,EAAGD,EAAI5C,KAAQ,GAAK4C,GAAK5C,GAAK6C,KAGpD,IAAKC,EAAI9C,GAAK8C,EAAIN,GAAKzjD,GAAI+jD,EAAGH,EAAWH,KAAOA,EAAI,GAAKM,IAErD,GAAIA,EAAI,IACJ,MAAM,IAAIl5E,MAAM,+CAGxB,GAAU,IAANi5E,EAAS,CACT,MAAMJ,GAAUD,EAAI,IAAOtC,GAC3B,OAAO,SAAqBb,EAAIzgE,GAC5B,MAAMxC,EAAOijE,EAAGtgD,IAAIngB,EAAG6jE,GACvB,IAAKpD,EAAGqC,IAAIrC,EAAGwC,IAAIzlE,GAAOwC,GACtB,MAAM,IAAIhV,MAAM,2BACpB,OAAOwS,CACX,CACJ,CAEA,MAAM2mE,GAAUH,EAAI,IAAO5C,GAC3B,OAAO,SAAqBX,EAAIzgE,GAE5B,GAAIygE,EAAGtgD,IAAIngB,EAAG+jE,KAAetD,EAAGoC,IAAIpC,EAAGiC,KACnC,MAAM,IAAI13E,MAAM,2BACpB,IAAIg8B,EAAIi9C,EAEJG,EAAI3D,EAAGtgD,IAAIsgD,EAAG0C,IAAI1C,EAAGiC,IAAKwB,GAAIF,GAC9BriE,EAAI8+D,EAAGtgD,IAAIngB,EAAGmkE,GACd/2D,EAAIqzD,EAAGtgD,IAAIngB,EAAGgkE,GAClB,MAAQvD,EAAGqC,IAAI11D,EAAGqzD,EAAGiC,MAAM,CACvB,GAAIjC,EAAGqC,IAAI11D,EAAGqzD,EAAGgC,MACb,OAAOhC,EAAGgC,KAEd,IAAI7+C,EAAI,EACR,IAAK,IAAIygD,EAAK5D,EAAGwC,IAAI71D,GAAIwW,EAAIoD,IACrBy5C,EAAGqC,IAAIuB,EAAI5D,EAAGiC,KADU9+C,IAG5BygD,EAAK5D,EAAGwC,IAAIoB,GAGhB,MAAMC,EAAK7D,EAAGtgD,IAAIikD,EAAG,IAAO3xC,OAAOzL,EAAIpD,EAAI,IAC3CwgD,EAAI3D,EAAGwC,IAAIqB,GACX3iE,EAAI8+D,EAAG0C,IAAIxhE,EAAG2iE,GACdl3D,EAAIqzD,EAAG0C,IAAI/1D,EAAGg3D,GACdp9C,EAAIpD,CACR,CACA,OAAOjiB,CACX,CACJ,CAkEW4iE,CAAcX,EACzB,CAyJ4BY,CAAOrC,IACZI,EAAM9gE,EAAGzB,KAExBykE,YAAcvJ,GA1Gf,SAAuBz5D,EAAGijE,GAC7B,MAAMtgC,EAAM,IAAIj2C,MAAMu2E,EAAKz2E,QAErB02E,EAAiBD,EAAK5tC,QAAO,CAAC6Q,EAAK3O,EAAKjrC,IACtC0T,EAAEkhE,IAAI3pC,GACC2O,GACXvD,EAAIr2C,GAAK45C,EACFlmC,EAAE0hE,IAAIx7B,EAAK3O,KACnBv3B,EAAEihE,KAECkC,EAAWnjE,EAAEiiE,IAAIiB,GAQvB,OANAD,EAAKG,aAAY,CAACl9B,EAAK3O,EAAKjrC,IACpB0T,EAAEkhE,IAAI3pC,GACC2O,GACXvD,EAAIr2C,GAAK0T,EAAE0hE,IAAIx7B,EAAKvD,EAAIr2C,IACjB0T,EAAE0hE,IAAIx7B,EAAK3O,KACnB4rC,GACIxgC,CACX,CAuF8B0gC,CAAcrjE,EAAGy5D,GAGvC6J,KAAM,CAAC53D,EAAGC,EAAGzZ,IAAOA,EAAIyZ,EAAID,EAC5By2B,QAAU5K,GAAS2L,EAAO,GAAgB3L,EAAKspC,GAAS,GAAgBtpC,EAAKspC,GAC7E0C,UAAY1pE,IACR,GAAIA,EAAMrN,SAAWq0E,EACjB,MAAM,IAAIt3E,MAAM,6BAA+Bs3E,EAAQ,eAAiBhnE,EAAMrN,QAClF,OAAO02C,EAAO,GAAgBrpC,GAAS,GAAgBA,EAAM,IAGrE,OAAOnQ,OAAOmd,OAAO7G,EACzB,CAkCO,SAASwjE,GAAoBC,GAChC,GAA0B,iBAAfA,EACP,MAAM,IAAIl6E,MAAM,8BACpB,MAAMm6E,EAAYD,EAAWryE,SAAS,GAAG5E,OACzC,OAAOwH,KAAK01B,KAAKg6C,EAAY,EACjC,CAQO,SAASC,GAAiBF,GAC7B,MAAMj3E,EAASg3E,GAAoBC,GACnC,OAAOj3E,EAASwH,KAAK01B,KAAKl9B,EAAS,EACvC,CCtaA,MAAM,GAAMwkC,OAAO,GACb,GAAMA,OAAO,GACnB,SAAS4yC,GAAgBC,EAAWtzB,GAChC,MAAM6wB,EAAM7wB,EAAKuzB,SACjB,OAAOD,EAAYzC,EAAM7wB,CAC7B,CACA,SAASwzB,GAAUC,EAAGhmE,GAClB,IAAK1I,OAAO8rC,cAAc4iC,IAAMA,GAAK,GAAKA,EAAIhmE,EAC1C,MAAM,IAAIzU,MAAM,qCAAuCyU,EAAO,YAAcgmE,EACpF,CACA,SAASC,GAAUD,EAAGE,GAClBH,GAAUC,EAAGE,GACb,MAEMC,EAAY,GAAKH,EAGvB,MAAO,CAAEI,QALOpwE,KAAK01B,KAAKw6C,EAAaF,GAAK,EAK1BK,WAJC,IAAML,EAAI,GAICp6D,KAFjB,GAAQo6D,GAEeG,YAAWG,QAD/BtzC,OAAOgzC,GAE3B,CACA,SAASO,GAAYhmE,EAAGzC,EAAQ0oE,GAC5B,MAAM,WAAEH,EAAU,KAAEz6D,EAAI,UAAEu6D,EAAS,QAAEG,GAAYE,EACjD,IAAIC,EAAQnvE,OAAOiJ,EAAIqL,GACnB86D,EAAQnmE,GAAK+lE,EAMbG,EAAQJ,IAERI,GAASN,EACTO,GAAS,IAEb,MAAMC,EAAc7oE,EAASuoE,EAM7B,MAAO,CAAEK,QAAOz2E,OALD02E,EAAc3wE,KAAKsE,IAAImsE,GAAS,EAKvBG,OAJC,IAAVH,EAIiBI,MAHlBJ,EAAQ,EAGiBK,OAFxBhpE,EAAS,GAAM,EAEiBipE,QAD/BJ,EAEpB,CAoBA,MAAMK,GAAmB,IAAIrsC,QACvBssC,GAAmB,IAAItsC,QAC7B,SAASusC,GAAK/C,GACV,OAAO8C,GAAiB96E,IAAIg4E,IAAM,CACtC,CAeO,SAASgD,GAAKjzE,EAAG8L,GACpB,MAAO,CACH4lE,mBACAwB,eAAeC,GACU,IAAdH,GAAKG,GAGhB,YAAAC,CAAaD,EAAK9mE,EAAGkrB,EAAIv3B,EAAE8uE,MACvB,IAAIx5D,EAAI69D,EACR,KAAO9mE,EAAI,IACHA,EAAI,KACJkrB,EAAIA,EAAE1hB,IAAIP,IACdA,EAAIA,EAAEqG,SACNtP,IAAM,GAEV,OAAOkrB,CACX,EAaA,gBAAA87C,CAAiBF,EAAKrB,GAClB,MAAM,QAAEI,EAAO,WAAEC,GAAeJ,GAAUD,EAAGhmE,GACvCwnE,EAAS,GACf,IAAI/7C,EAAI47C,EACJlnD,EAAOsL,EACX,IAAK,IAAI3tB,EAAS,EAAGA,EAASsoE,EAAStoE,IAAU,CAC7CqiB,EAAOsL,EACP+7C,EAAOj6E,KAAK4yB,GAEZ,IAAK,IAAI7xB,EAAI,EAAGA,EAAI+3E,EAAY/3E,IAC5B6xB,EAAOA,EAAKpW,IAAI0hB,GAChB+7C,EAAOj6E,KAAK4yB,GAEhBsL,EAAItL,EAAKtQ,QACb,CACA,OAAO23D,CACX,EAQA,IAAAL,CAAKnB,EAAGyB,EAAalnE,GAOjB,IAAIkrB,EAAIv3B,EAAE8uE,KACNhhE,EAAI9N,EAAEwgC,KAMV,MAAMgzC,EAAKzB,GAAUD,EAAGhmE,GACxB,IAAK,IAAIlC,EAAS,EAAGA,EAAS4pE,EAAGtB,QAAStoE,IAAU,CAEhD,MAAM,MAAE4oE,EAAK,OAAEz2E,EAAM,OAAE22E,EAAM,MAAEC,EAAK,OAAEC,EAAM,QAAEC,GAAYR,GAAYhmE,EAAGzC,EAAQ4pE,GACjFnnE,EAAImmE,EACAE,EAGA5kE,EAAIA,EAAE+H,IAAI67D,GAAgBkB,EAAQW,EAAYV,KAI9Ct7C,EAAIA,EAAE1hB,IAAI67D,GAAgBiB,EAAOY,EAAYx3E,IAErD,CAIA,MAAO,CAAEw7B,IAAGzpB,IAChB,EASA,UAAA2lE,CAAW3B,EAAGyB,EAAalnE,EAAG2nC,EAAMh0C,EAAE8uE,MAClC,MAAM0E,EAAKzB,GAAUD,EAAGhmE,GACxB,IAAK,IAAIlC,EAAS,EAAGA,EAAS4pE,EAAGtB,SACzB7lE,IAAM,GAD4BzC,IAAU,CAGhD,MAAM,MAAE4oE,EAAK,OAAEz2E,EAAM,OAAE22E,EAAM,MAAEC,GAAUN,GAAYhmE,EAAGzC,EAAQ4pE,GAEhE,GADAnnE,EAAImmE,GACAE,EAKC,CACD,MAAMr0B,EAAOk1B,EAAYx3E,GACzBi4C,EAAMA,EAAIn+B,IAAI88D,EAAQt0B,EAAKuzB,SAAWvzB,EAC1C,CACJ,CACA,OAAOrK,CACX,EACA,cAAA0/B,CAAe5B,EAAG7B,EAAG0D,GAEjB,IAAIC,EAAOd,GAAiB76E,IAAIg4E,GAMhC,OALK2D,IACDA,EAAO/6E,KAAKw6E,iBAAiBpD,EAAG6B,GACtB,IAANA,GACAgB,GAAiB36E,IAAI83E,EAAG0D,EAAUC,KAEnCA,CACX,EACA,UAAAC,CAAW5D,EAAG5jE,EAAGsnE,GACb,MAAM7B,EAAIkB,GAAK/C,GACf,OAAOp3E,KAAKo6E,KAAKnB,EAAGj5E,KAAK66E,eAAe5B,EAAG7B,EAAG0D,GAAYtnE,EAC9D,EACA,gBAAAynE,CAAiB7D,EAAG5jE,EAAGsnE,EAAWjyE,GAC9B,MAAMowE,EAAIkB,GAAK/C,GACf,OAAU,IAAN6B,EACOj5E,KAAKu6E,aAAanD,EAAG5jE,EAAG3K,GAC5B7I,KAAK46E,WAAW3B,EAAGj5E,KAAK66E,eAAe5B,EAAG7B,EAAG0D,GAAYtnE,EAAG3K,EACvE,EAIA,aAAAqyE,CAAc9D,EAAG6B,GACbD,GAAUC,EAAGhmE,GACbinE,GAAiB56E,IAAI83E,EAAG6B,GACxBgB,GAAiB5yB,OAAO+vB,EAC5B,EAER,CAWO,SAAS,GAAUjwE,EAAGg0E,EAAQV,EAAQW,GASzC,GAzMJ,SAA2BX,EAAQtzE,GAC/B,IAAKxF,MAAM2Q,QAAQmoE,GACf,MAAM,IAAIj8E,MAAM,kBACpBi8E,EAAOttE,SAAQ,CAACuxB,EAAGn9B,KACf,KAAMm9B,aAAav3B,GACf,MAAM,IAAI3I,MAAM,0BAA4B+C,EAAE,GAE1D,CAgMI85E,CAAkBZ,EAAQtzE,GA/L9B,SAA4Bi0E,EAASp3E,GACjC,IAAKrC,MAAM2Q,QAAQ8oE,GACf,MAAM,IAAI58E,MAAM,6BACpB48E,EAAQjuE,SAAQ,CAACpK,EAAGxB,KAChB,IAAKyC,EAAMkwE,QAAQnxE,GACf,MAAM,IAAIvE,MAAM,2BAA6B+C,EAAE,GAE3D,CAyLI+5E,CAAmBF,EAASD,GACxBV,EAAOh5E,SAAW25E,EAAQ35E,OAC1B,MAAM,IAAIjD,MAAM,uDACpB,MAAM0f,EAAO/W,EAAE8uE,KACTyD,EFtDH,SAAgBlmE,GACnB,IAAIpR,EACJ,IAAKA,EAAM,EAAGoR,EAAIm/D,GAAKn/D,IAAMo/D,GAAKxwE,GAAO,GAEzC,OAAOA,CACX,CEiDkBwzE,CAAO3vC,OAAOw0C,EAAOh5E,SAC7B63E,EAAaI,EAAQ,GAAKA,EAAQ,EAAIA,EAAQ,EAAIA,EAAQ,EAAIA,EAAQ,EAAI,EAC1E1D,EAAO,GAAQsD,GACfiC,EAAU,IAAI55E,MAAM4I,OAAOyrE,GAAQ,GAAGt9B,KAAKx6B,GAEjD,IAAIs1D,EAAMt1D,EACV,IAAK,IAAI3c,EAFQ0H,KAAK6a,OAAOq3D,EAAOjpE,KAAO,GAAKonE,GAAcA,EAEvC/3E,GAAK,EAAGA,GAAK+3E,EAAY,CAC5CiC,EAAQ7iC,KAAKx6B,GACb,IAAK,IAAI1b,EAAI,EAAGA,EAAI44E,EAAQ35E,OAAQe,IAAK,CACrC,MAAMg5E,EAASJ,EAAQ54E,GACjBk3E,EAAQnvE,OAAQixE,GAAUv1C,OAAO1kC,GAAMy0E,GAC7CuF,EAAQ7B,GAAS6B,EAAQ7B,GAAO18D,IAAIy9D,EAAOj4E,GAC/C,CACA,IAAIi5E,EAAOv9D,EAEX,IAAK,IAAI1b,EAAI+4E,EAAQ95E,OAAS,EAAGi6E,EAAOx9D,EAAM1b,EAAI,EAAGA,IACjDk5E,EAAOA,EAAK1+D,IAAIu+D,EAAQ/4E,IACxBi5E,EAAOA,EAAKz+D,IAAI0+D,GAGpB,GADAlI,EAAMA,EAAIx2D,IAAIy+D,GACJ,IAANl6E,EACA,IAAK,IAAIiB,EAAI,EAAGA,EAAI82E,EAAY92E,IAC5BgxE,EAAMA,EAAI1wD,QACtB,CACA,OAAO0wD,CACX,CAgFO,SAASmI,GAAcrN,GAY1B,ODrJG,SAAuBtqE,GAC1B,MAMM84B,EAAOw4C,GAAahrC,QAAO,CAAChmC,EAAK2G,KACnC3G,EAAI2G,GAAO,WACJ3G,IARK,CACZqxE,MAAO,SACPK,KAAM,SACNF,MAAO,gBACP5jE,KAAM,kBAMHiiE,GAAenwE,EAAO84B,EACjC,CC8HI,CAAcwxC,EAAM2F,IACpBE,GAAe7F,EAAO,CAClB96D,EAAG,SACHsC,EAAG,SACH8lE,GAAI,QACJC,GAAI,SACL,CACCrG,WAAY,gBACZE,YAAa,kBAGV/2E,OAAOmd,OAAO,IACdy5D,GAAQjH,EAAM96D,EAAG86D,EAAMkH,eACvBlH,EACE5vC,EAAG4vC,EAAM2F,GAAG0B,OAEzB,CC3WA,MAAM,GAAM1vC,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAEhE61C,GAAiB,CAAEC,QAAQ,GCLjC,MAAM,GAAM91C,OAAO,GACb,GAAMA,OAAO,GCOnB,MAAM+1C,GAAY/1C,OAAO,iFAGnBg2C,GAAkCh2C,OAAO,iFAExB,IAAXA,OAAO,GAAUA,OAAO,IAAI,GAAMA,OAAO,GAAI,GAAMA,OAAO,GAEhE,GAAMA,OAAO,GAAI,GAAMA,OAAO,GACpC,SAASi2C,GAAoB/mE,GAEzB,MAAMgnE,EAAOl2C,OAAO,IAAKm2C,EAAOn2C,OAAO,IAAKo2C,EAAOp2C,OAAO,IAAKq2C,EAAOr2C,OAAO,IACvEmxC,EAAI4E,GAEJrlE,EADMxB,EAAIA,EAAKiiE,EACJjiE,EAAKiiE,EAChBvgE,EAAMs+D,GAAKx+D,EAAI,GAAKygE,GAAKzgE,EAAMygE,EAC/BtgE,EAAMq+D,GAAKt+D,EAAI,GAAKugE,GAAKjiE,EAAKiiE,EAC9BjgE,EAAOg+D,GAAKr+D,EAAI,GAAKsgE,GAAKtgE,EAAMsgE,EAChCv/D,EAAOs9D,GAAKh+D,EAAKglE,EAAM/E,GAAKjgE,EAAOigE,EACnCn+D,EAAOk8D,GAAKt9D,EAAKukE,EAAMhF,GAAKv/D,EAAOu/D,EACnCmF,EAAOpH,GAAKl8D,EAAKojE,EAAMjF,GAAKn+D,EAAOm+D,EACnCoF,EAAQrH,GAAKoH,EAAKD,EAAMlF,GAAKmF,EAAOnF,EACpCqF,EAAQtH,GAAKqH,EAAMF,EAAMlF,GAAKmF,EAAOnF,EACrCsF,EAAQvH,GAAKsH,EAAMN,EAAM/E,GAAKjgE,EAAOigE,EAG3C,MAAO,CAAEuF,UAFUxH,GAAKuH,EAAM,GAAKtF,GAAKjiE,EAAKiiE,EAEzBzgE,KACxB,CACA,SAASimE,GAAkB9tE,GAQvB,OALAA,EAAM,IAAM,IAEZA,EAAM,KAAO,IAEbA,EAAM,KAAO,GACNA,CACX,CAEA,SAAS+tE,GAAQxH,EAAGh2E,GAChB,MAAM+3E,EAAI4E,GACJ3mD,EAAK,GAAIh2B,EAAIA,EAAIA,EAAG+3E,GACpB3hD,EAAK,GAAIJ,EAAKA,EAAKh2B,EAAG+3E,GAG5B,IAAIjiE,EAAI,GAAIkgE,EAAIhgD,EADJ6mD,GAAoB7G,EAAI5/C,GAAIknD,UACdvF,GAC1B,MAAM0F,EAAM,GAAIz9E,EAAI8V,EAAIA,EAAGiiE,GACrB2F,EAAQ5nE,EACR6nE,EAAQ,GAAI7nE,EAAI8mE,GAAiB7E,GACjC6F,EAAWH,IAAQzH,EACnB6H,EAAWJ,IAAQ,IAAKzH,EAAG+B,GAC3B+F,EAASL,IAAQ,IAAKzH,EAAI4G,GAAiB7E,GAOjD,OANI6F,IACA9nE,EAAI4nE,IACJG,GAAYC,KACZhoE,EAAI6nE,IJ+IkC,GI9IzB7nE,EAAGiiE,GJ8IyC,MAAS,KI7IlEjiE,EAAI,IAAKA,EAAGiiE,IACT,CAAElD,QAAS+I,GAAYC,EAAUl+E,MAAOmW,EACnD,CAEO,MAUD8+D,GAAqB,KAAO,GAAM+H,QAAW98E,GAAW,GAAnC,GACrBk+E,GAAkC,MAAO,CAE3Cz8D,EAAGszD,GAAGr1E,OAAOqnC,QAAQ,IAErBxpB,EAAGwpB,OAAO,iFAEVguC,MAEAzgE,EAAGyyB,OAAO,gFACVnwB,EAAG,GACH8lE,GAAI31C,OAAO,iFACX41C,GAAI51C,OAAO,iFACX74B,KAAM,GACN2qC,YAAW,GACX6kC,qBAIAC,aAlBoC,GA+B3BQ,GAA0B,KFjFhC,SAAwBC,GAC3B,MAAMC,EAxBV,SAAsBjP,GAClB,MAAMxxC,EAAO6+C,GAAcrN,GAa3B,OAZA6F,GAAe7F,EAAO,CAClBlhE,KAAM,WACNuT,EAAG,SACHlE,EAAG,SACHs7B,YAAa,YACd,CACC6kC,kBAAmB,WACnBY,OAAQ,WACRX,QAAS,WACTY,WAAY,aAGT9+E,OAAOmd,OAAO,IAAKghB,GAC9B,CASkB4gD,CAAaJ,IACrB,GAAErJ,EAAIzgE,EAAgBmqE,QAASA,EAASvwE,KAAMwwE,EAAK,YAAE7lC,EAAW,YAAE29B,EAAa5/D,EAAG+nE,GAAcN,EAKhGvH,EAAO,IAAQ/vC,OAAqB,EAAdyvC,GAAmB,GACzCoI,EAAO7J,EAAGr1E,OACVm/E,EAAK,GAAMR,EAAM/pE,EAAG+pE,EAAM/H,YAE1BqH,EAAUU,EAAMV,SAClB,EAAExH,EAAGh2E,KACD,IACI,MAAO,CAAE60E,SAAS,EAAMl1E,MAAOi1E,EAAGkD,KAAK9B,EAAIpB,EAAGiD,IAAI73E,IACtD,CACA,MAAO4kB,GACH,MAAO,CAAEiwD,SAAS,EAAOl1E,MAAO,GACpC,CACH,GACC49E,EAAoBW,EAAMX,mBAAqB,CAAE9tE,GAAUA,GAC3D0uE,EAASD,EAAMC,QACjB,EAAE7zC,EAAM7hB,EAAKk2D,KAET,GADAnL,GAAM,SAAUmL,GACZl2D,EAAIrmB,QAAUu8E,EACd,MAAM,IAAIx/E,MAAM,uCACpB,OAAOmrC,CACV,GAGL,SAASs0C,EAAYnL,EAAOt/D,EAAG0qE,GAAU,GAErC,GAAS,cAAgBpL,EAAOt/D,EADpB0qE,EAAU,GAAM,GACYlI,EAC5C,CACA,SAASmI,EAAU5vC,GACf,KAAMA,aAAiB6vC,GACnB,MAAM,IAAI5/E,MAAM,yBACxB,CAGA,MAAM6/E,EAAe5J,IAAS,CAAC/1C,EAAG4/C,KAC9B,MAAQC,GAAIppE,EAAGqpE,GAAI1R,EAAG2R,GAAIC,GAAMhgD,EAC1By3C,EAAMz3C,EAAEy3C,MACJ,MAANmI,IACAA,EAAKnI,EAAM,GAAMlC,EAAGiD,IAAIwH,IAC5B,MAAMC,EAAKb,EAAK3oE,EAAImpE,GACdM,EAAKd,EAAKhR,EAAIwR,GACdO,EAAKf,EAAKY,EAAIJ,GACpB,GAAInI,EACA,MAAO,CAAEhhE,EAAG,GAAK23D,EAAG,IACxB,GAAI+R,IAAO,GACP,MAAM,IAAIrgF,MAAM,oBACpB,MAAO,CAAE2W,EAAGwpE,EAAI7R,EAAG8R,EAAI,IAErBE,EAAkBrK,IAAU/1C,IAC9B,MAAM,EAAE/d,EAAC,EAAElE,GAAM8gE,EACjB,GAAI7+C,EAAEy3C,MACF,MAAM,IAAI33E,MAAM,mBAGpB,MAAQ+/E,GAAIQ,EAAGP,GAAIQ,EAAGP,GAAI/G,EAAGuH,GAAIC,GAAMxgD,EACjCygD,EAAKrB,EAAKiB,EAAIA,GACdK,EAAKtB,EAAKkB,EAAIA,GACdK,EAAKvB,EAAKpG,EAAIA,GACd4H,EAAKxB,EAAKuB,EAAKA,GACfE,EAAMzB,EAAKqB,EAAKx+D,GAGtB,GAFam9D,EAAKuB,EAAKvB,EAAKyB,EAAMH,MACpBtB,EAAKwB,EAAKxB,EAAKrhE,EAAIqhE,EAAKqB,EAAKC,KAEvC,MAAM,IAAI5gF,MAAM,yCAIpB,GAFWs/E,EAAKiB,EAAIC,KACTlB,EAAKpG,EAAIwH,GAEhB,MAAM,IAAI1gF,MAAM,yCACpB,OAAO,CAAI,IAIf,MAAM4/E,EACF,WAAA9uE,CAAYivE,EAAIC,EAAIC,EAAIQ,GACpBhB,EAAY,IAAKM,GACjBN,EAAY,IAAKO,GACjBP,EAAY,IAAKQ,GAAI,GACrBR,EAAY,IAAKgB,GACjBj/E,KAAKu+E,GAAKA,EACVv+E,KAAKw+E,GAAKA,EACVx+E,KAAKy+E,GAAKA,EACVz+E,KAAKi/E,GAAKA,EACVtgF,OAAOmd,OAAO9b,KAClB,CACA,KAAImV,GACA,OAAOnV,KAAKw/E,WAAWrqE,CAC3B,CACA,KAAI23D,GACA,OAAO9sE,KAAKw/E,WAAW1S,CAC3B,CACA,iBAAO2S,CAAW/gD,GACd,GAAIA,aAAa0/C,EACb,MAAM,IAAI5/E,MAAM,8BACpB,MAAM,EAAE2W,EAAC,EAAE23D,GAAMpuC,GAAK,CAAC,EAGvB,OAFAu/C,EAAY,IAAK9oE,GACjB8oE,EAAY,IAAKnR,GACV,IAAIsR,EAAMjpE,EAAG23D,EAAG,GAAKgR,EAAK3oE,EAAI23D,GACzC,CACA,iBAAO4S,CAAWjF,GACd,MAAMkF,EAAQ1L,EAAGgE,YAAYwC,EAAOn2E,KAAKo6B,GAAMA,EAAE+/C,MACjD,OAAOhE,EAAOn2E,KAAI,CAACo6B,EAAGn9B,IAAMm9B,EAAE8gD,SAASG,EAAMp+E,MAAK+C,IAAI85E,EAAMqB,WAChE,CAEA,UAAOG,CAAInF,EAAQW,GACf,OAAO,GAAUgD,EAAOL,EAAItD,EAAQW,EACxC,CAEA,cAAAyE,CAAevG,GACXwG,EAAK5E,cAAcl7E,KAAMs5E,EAC7B,CAGA,cAAAyG,GACIjB,EAAgB9+E,KACpB,CAEA,MAAAsuC,CAAOC,GACH4vC,EAAU5vC,GACV,MAAQgwC,GAAIyB,EAAIxB,GAAIyB,EAAIxB,GAAIyB,GAAOlgF,MAC3Bu+E,GAAIY,EAAIX,GAAIY,EAAIX,GAAIY,GAAO9wC,EAC7B4xC,EAAOrC,EAAKkC,EAAKX,GACjBe,EAAOtC,EAAKqB,EAAKe,GACjBG,EAAOvC,EAAKmC,EAAKZ,GACjBiB,EAAOxC,EAAKsB,EAAKc,GACvB,OAAOC,IAASC,GAAQC,IAASC,CACrC,CACA,GAAAnK,GACI,OAAOn2E,KAAKsuC,OAAO8vC,EAAMnI,KAC7B,CACA,MAAA8C,GAEI,OAAO,IAAIqF,EAAMN,GAAM99E,KAAKu+E,IAAKv+E,KAAKw+E,GAAIx+E,KAAKy+E,GAAIX,GAAM99E,KAAKi/E,IAClE,CAIA,MAAAn8D,GACI,MAAM,EAAEnC,GAAM48D,GACNgB,GAAIyB,EAAIxB,GAAIyB,EAAIxB,GAAIyB,GAAOlgF,KAC7By5C,EAAIqkC,EAAKkC,EAAKA,GACdtmC,EAAIokC,EAAKmC,EAAKA,GACdtmC,EAAImkC,EAAK,GAAMA,EAAKoC,EAAKA,IACzBtmC,EAAIkkC,EAAKn9D,EAAI84B,GACb8mC,EAAOP,EAAKC,EACZpmC,EAAIikC,EAAKA,EAAKyC,EAAOA,GAAQ9mC,EAAIC,GACjCK,EAAIH,EAAIF,EACRI,EAAIC,EAAIJ,EACRK,EAAIJ,EAAIF,EACR8mC,EAAK1C,EAAKjkC,EAAIC,GACd2mC,EAAK3C,EAAK/jC,EAAIC,GACd0mC,EAAK5C,EAAKjkC,EAAIG,GACd2mC,EAAK7C,EAAKhkC,EAAIC,GACpB,OAAO,IAAIqkC,EAAMoC,EAAIC,EAAIE,EAAID,EACjC,CAIA,GAAA1jE,CAAIuxB,GACA4vC,EAAU5vC,GACV,MAAM,EAAE5tB,EAAC,EAAElE,GAAM8gE,GACTgB,GAAIyB,EAAIxB,GAAIyB,EAAIxB,GAAIyB,EAAIjB,GAAI3kC,GAAOt6C,MACnCu+E,GAAIY,EAAIX,GAAIY,EAAIX,GAAIY,EAAIJ,GAAI1kC,GAAOhM,EACrCkL,EAAIqkC,EAAKkC,EAAKb,GACdzlC,EAAIokC,EAAKmC,EAAKb,GACdzlC,EAAImkC,EAAKxjC,EAAK79B,EAAI89B,GAClBX,EAAIkkC,EAAKoC,EAAKb,GACdxlC,EAAIikC,GAAMkC,EAAKC,IAAOd,EAAKC,GAAM3lC,EAAIC,GACrCI,EAAIF,EAAID,EACRI,EAAIH,EAAID,EACRK,EAAI8jC,EAAKpkC,EAAI/4B,EAAI84B,GACjB+mC,EAAK1C,EAAKjkC,EAAIC,GACd2mC,EAAK3C,EAAK/jC,EAAIC,GACd0mC,EAAK5C,EAAKjkC,EAAIG,GACd2mC,EAAK7C,EAAKhkC,EAAIC,GACpB,OAAO,IAAIqkC,EAAMoC,EAAIC,EAAIE,EAAID,EACjC,CACA,QAAAE,CAASryC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMwqC,SAC1B,CACA,IAAAqB,CAAK5mE,GACD,OAAOssE,EAAK9E,WAAWh7E,KAAMwT,EAAG4qE,EAAMsB,WAC1C,CAEA,QAAAmB,CAASrF,GACL,MAAMhoE,EAAIgoE,EACV,GAAS,SAAUhoE,EAAG,GAAKstE,GAC3B,MAAM,EAAEpiD,EAAC,EAAEzpB,GAAMjV,KAAKo6E,KAAK5mE,GAC3B,OAAO4qE,EAAMsB,WAAW,CAAChhD,EAAGzpB,IAAI,EACpC,CAMA,cAAA8rE,CAAevF,EAAQrgC,EAAMijC,EAAMnI,MAC/B,MAAMziE,EAAIgoE,EAEV,OADA,GAAS,SAAUhoE,EAAG,GAAKstE,GACvBttE,IAAM,GACCwtE,EACPhhF,KAAKm2E,OAAS3iE,IAAM,GACbxT,KACJ8/E,EAAK7E,iBAAiBj7E,KAAMwT,EAAG4qE,EAAMsB,WAAYvkC,EAC5D,CAKA,YAAA8lC,GACI,OAAOjhF,KAAK+gF,eAAelD,GAAU1H,KACzC,CAGA,aAAA+K,GACI,OAAOpB,EAAKvF,aAAav6E,KAAM8gF,GAAa3K,KAChD,CAGA,QAAAqJ,CAASlB,GACL,OAAOD,EAAar+E,KAAMs+E,EAC9B,CACA,aAAA6C,GACI,MAAQrrE,EAAG+nE,GAAaN,EACxB,OAAIM,IAAa,GACN79E,KACJA,KAAK+gF,eAAelD,EAC/B,CAGA,cAAOvmC,CAAQ5hC,EAAKqmE,GAAS,GACzB,MAAM,EAAEt/D,EAAC,EAAEkE,GAAM48D,EACXn7E,EAAM6xE,EAAG6B,MACfpgE,EAAM,GAAY,WAAYA,EAAKtT,GACnCywE,GAAM,SAAUkJ,GAChB,MAAMqF,EAAS1rE,EAAIxU,QACbmgF,EAAW3rE,EAAItT,EAAM,GAC3Bg/E,EAAOh/E,EAAM,IAAgB,IAAXi/E,EAClB,MAAMvU,EAAI,GAAgBsU,GAKpB7iF,EAAMw9E,EAAS/F,EAAO/B,EAAG0B,MAC/B,GAAS,aAAc7I,EAAG,GAAKvuE,GAG/B,MAAM+iF,EAAKxD,EAAKhR,EAAIA,GACduI,EAAIyI,EAAKwD,EAAK,IACdjiF,EAAIy+E,EAAKrhE,EAAI6kE,EAAK3gE,GACxB,IAAI,QAAEuzD,EAASl1E,MAAOmW,GAAM0nE,EAAQxH,EAAGh2E,GACvC,IAAK60E,EACD,MAAM,IAAI11E,MAAM,uCACpB,MAAM+iF,GAAUpsE,EAAI,MAAS,GACvBqsE,KAA4B,IAAXH,GACvB,IAAKtF,GAAU5mE,IAAM,IAAOqsE,EAExB,MAAM,IAAIhjF,MAAM,gCAGpB,OAFIgjF,IAAkBD,IAClBpsE,EAAI2oE,GAAM3oE,IACPipE,EAAMqB,WAAW,CAAEtqE,IAAG23D,KACjC,CACA,qBAAO2U,CAAeC,GAClB,MAAM,OAAElG,GAAWmG,EAAiBD,GACpC,OAAO3nC,EAAE8mC,SAASrF,EACtB,CACA,UAAAoG,GACI,MAAM,EAAEzsE,EAAC,EAAE23D,GAAM9sE,KAAKw/E,WAChB1wE,EAAQ,GAAgBg+D,EAAGmH,EAAG6B,OAEpC,OADAhnE,EAAMA,EAAMrN,OAAS,IAAM0T,EAAI,GAAM,IAAO,EACrCrG,CACX,CACA,KAAAuoC,GACI,OAAO,GAAWr3C,KAAK4hF,aAC3B,EAEJxD,EAAMz2C,KAAO,IAAIy2C,EAAMb,EAAM3B,GAAI2B,EAAM1B,GAAI,GAAKiC,EAAKP,EAAM3B,GAAK2B,EAAM1B,KACtEuC,EAAMnI,KAAO,IAAImI,EAAM,GAAK,GAAK,GAAK,IACtC,MAAQz2C,KAAMoS,EAAGk8B,KAAM+K,GAAM5C,EACvB0B,EAAO1F,GAAKgE,EAAqB,EAAd1I,GACzB,SAASmM,EAAKlhE,GACV,OAAO,GAAIA,EAAGmgE,EAClB,CAEA,SAASgB,EAAQ10E,GACb,OAAOy0E,EAAK,GAAgBz0E,GAChC,CAEA,SAASu0E,EAAiB5iF,GACtB,MAAMqD,EAAM6xE,EAAG6B,MACf/2E,EAAM,GAAY,cAAeA,EAAKqD,GAGtC,MAAM2/E,EAAS,GAAY,qBAAsBnE,EAAM7+E,GAAM,EAAIqD,GAC3Dqf,EAAOm7D,EAAkBmF,EAAO7gF,MAAM,EAAGkB,IAG/C,MAAO,CAAEqf,OAAM/hB,OAFAqiF,EAAO7gF,MAAMkB,EAAK,EAAIA,GAEdo5E,OADRsG,EAAQrgE,GAE3B,CAEA,SAASugE,EAAqBjjF,GAC1B,MAAM,KAAE0iB,EAAI,OAAE/hB,EAAM,OAAE87E,GAAWmG,EAAiB5iF,GAC5CkjF,EAAQloC,EAAE8mC,SAASrF,GACnB0G,EAAaD,EAAML,aACzB,MAAO,CAAEngE,OAAM/hB,SAAQ87E,SAAQyG,QAAOC,aAC1C,CAMA,SAASC,EAAmBriF,EAAU,IAAImQ,cAAiBmyE,GACvD,MAAMzqC,EAAM,MAAeyqC,GAC3B,OAAON,EAAQlE,EAAMJ,EAAO7lC,EAAK,GAAY,UAAW73C,KAAY69E,IACxE,CAeA,MAAM0E,EAAavG,GAqDnB,OAjBA/hC,EAAE8lC,eAAe,GAiBV,CACHtC,QACA+E,aA7EJ,SAAsBZ,GAClB,OAAOM,EAAqBN,GAASQ,UACzC,EA4EI5jE,KArEJ,SAAcq5B,EAAK+pC,EAASznE,EAAU,CAAC,GACnC09B,EAAM,GAAY,UAAWA,GACzBgmC,IACAhmC,EAAMgmC,EAAQhmC,IAClB,MAAM,OAAEj4C,EAAM,OAAE87E,EAAM,WAAE0G,GAAeF,EAAqBN,GACtDlnD,EAAI2nD,EAAmBloE,EAAQna,QAASJ,EAAQi4C,GAChD4qC,EAAIxoC,EAAE8mC,SAASrmD,GAAGonD,aAElB7+E,EAAI8+E,EAAKrnD,EADL2nD,EAAmBloE,EAAQna,QAASyiF,EAAGL,EAAYvqC,GACtC6jC,GAGvB,OAFA,GAAS,cAAez4E,EAAG,GAAK+9E,GAEzB,GAAY,SADP,GAAYyB,EAAG,GAAgBx/E,EAAGkxE,EAAG6B,QACJ,EAAX7B,EAAG6B,MACzC,EA0DIt2D,OApDJ,SAAgB0tD,EAAKv1B,EAAKg1B,EAAW1yD,EAAUooE,GAC3C,MAAM,QAAEviF,EAAO,OAAEi8E,GAAW9hE,EACtB7X,EAAM6xE,EAAG6B,MACf5I,EAAM,GAAY,YAAaA,EAAK,EAAI9qE,GACxCu1C,EAAM,GAAY,UAAWA,GAC7Bg1B,EAAY,GAAY,YAAaA,EAAWvqE,QACjClD,IAAX68E,GACAlJ,GAAM,SAAUkJ,GAChB4B,IACAhmC,EAAMgmC,EAAQhmC,IAClB,MAAM50C,EAAI,GAAgBmqE,EAAIhsE,MAAMkB,EAAK,EAAIA,IAC7C,IAAIq3C,EAAG8oC,EAAGC,EACV,IAII/oC,EAAI2kC,EAAM9mC,QAAQq1B,EAAWoP,GAC7BwG,EAAInE,EAAM9mC,QAAQ41B,EAAIhsE,MAAM,EAAGkB,GAAM25E,GACrCyG,EAAKzoC,EAAEgnC,eAAeh+E,EAC1B,CACA,MAAOykB,GACH,OAAO,CACX,CACA,IAAKu0D,GAAUtiC,EAAEwnC,eACb,OAAO,EACX,MAAMvoD,EAAIypD,EAAmBriF,EAASyiF,EAAEX,aAAcnoC,EAAEmoC,aAAcjqC,GAItE,OAHY4qC,EAAEvlE,IAAIy8B,EAAEsnC,eAAeroD,IAGxBkoD,SAAS4B,GAAIrB,gBAAgB7yC,OAAO8vC,EAAMnI,KACzD,EAuBIwM,cAAerE,EACfsE,MAtBU,CACVV,uBAEAW,iBAAkB,IAAM5qC,EAAYk8B,EAAG6B,OAOvC8M,WAAU,CAACtJ,EAAa,EAAG2I,EAAQ7D,EAAMz2C,QACrCs6C,EAAMpC,eAAevG,GACrB2I,EAAMpB,SAAS56C,OAAO,IACfg8C,IAWnB,CE1T8C,CAAe7E,IAAtB,GAwB1ByF,GAAyB,KDrH/B,SAAoBvF,GACvB,MAAMC,GAfNpJ,GADkB7F,EAgBSgP,EAfL,CAClB38D,EAAG,UACJ,CACCmiE,eAAgB,gBAChBpN,YAAa,gBACbkH,kBAAmB,WACnBY,OAAQ,WACRuF,WAAY,WACZC,GAAI,WAGDrkF,OAAOmd,OAAO,IAAKwyD,KAZ9B,IAAsBA,EAiBlB,MAAM,EAAE8I,GAAMmG,EACRO,EAAQtqE,GAAM,GAAIA,EAAG4jE,GACrB0L,EAAiBvF,EAAMuF,eACvBG,EAAkBh6E,KAAK01B,KAAKmkD,EAAiB,GAC7CI,EAAW3F,EAAM7H,YACjBkH,EAAoBW,EAAMX,mBAAqB,CAAE9tE,GAAUA,GAC3Di0E,EAAaxF,EAAMwF,YAAc,CAAE5tE,GAAMwe,GAAIxe,EAAGiiE,EAAInxC,OAAO,GAAImxC,IAWrE,SAAS+L,EAAMC,EAAMC,EAAKC,GACtB,MAAMj5D,EAAQyzD,EAAKsF,GAAQC,EAAMC,IAGjC,MAAO,CAFPD,EAAMvF,EAAKuF,EAAMh5D,GACjBi5D,EAAMxF,EAAKwF,EAAMj5D,GAErB,CAGA,MAAMk5D,GAAOhG,EAAM58D,EAAIslB,OAAO,IAAMA,OAAO,GA2D3C,SAASu9C,EAAkBnO,GACvB,OAAO,GAAgByI,EAAKzI,GAAI4N,EACpC,CAkBA,SAASQ,EAAWjI,EAAQnG,GACxB,MAAMqO,EAlBV,SAA2BC,GAGvB,MAAMtO,EAAI,GAAY,eAAgBsO,EAAMV,GAG5C,OAFiB,KAAbC,IACA7N,EAAE,KAAO,KACN,GAAgBA,EAC3B,CAWmBuO,CAAkBvO,GAC3BwO,EAXV,SAAsBrwE,GAClB,MAAM1E,EAAQ,GAAY,SAAU0E,GAC9BpR,EAAM0M,EAAMrN,OAClB,GAAIW,IAAQ6gF,GAAmB7gF,IAAQ8gF,EAEnC,MAAM,IAAI1kF,MAAM,4BADCykF,EAAkB,OAASC,EACU,eAAiB9gF,GAE3E,OAAO,GAAgBw6E,EAAkB9tE,GAC7C,CAGoBg1E,CAAatI,GACvBuI,EA3EV,SAA0B1O,EAAGmG,GACzB,GAAS,IAAKnG,EAAG,GAAK+B,GACtB,GAAS,SAAUoE,EAAQ,GAAKpE,GAGhC,MAAM1+C,EAAI8iD,EACJwI,EAAM3O,EACZ,IAKI4O,EALAZ,EAAM,GACNa,EAAM,GACNZ,EAAMjO,EACN8O,EAAM,GACNf,EAAO,GAEX,IAAK,IAAIjmE,EAAI8oB,OAAO68C,EAAiB,GAAI3lE,GAAK,GAAKA,IAAK,CACpD,MAAMinE,EAAO1rD,GAAKvb,EAAK,GACvBimE,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,MAAM3qC,EAAI4pC,EAAMa,EACVG,EAAKvG,EAAKrkC,EAAIA,GACdC,EAAI2pC,EAAMa,EACVI,EAAKxG,EAAKpkC,EAAIA,GACdG,EAAIwqC,EAAKC,EACT3qC,EAAI2pC,EAAMa,EAEVI,EAAKzG,GADDwF,EAAMa,GACI1qC,GACd+qC,EAAK1G,EAAKnkC,EAAID,GACd+qC,EAAOF,EAAKC,EACZE,EAAQH,EAAKC,EACnBlB,EAAMxF,EAAK2G,EAAOA,GAClBN,EAAMrG,EAAKkG,EAAMlG,EAAK4G,EAAQA,IAC9BrB,EAAMvF,EAAKuG,EAAKC,GAChBJ,EAAMpG,EAAKjkC,GAAKwqC,EAAKvG,EAAKyF,EAAM1pC,IACpC,CAEAoqC,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,OAAOpG,EAAKuF,EAAMsB,EACtB,CAwBeC,CAAiBlB,EAAQG,GAGpC,GAAIE,IAAO,GACP,MAAM,IAAIvlF,MAAM,0CACpB,OAAOglF,EAAkBO,EAC7B,CAEA,MAAMc,EAAUrB,EAAkBjG,EAAMyF,IACxC,SAAS8B,EAAetJ,GACpB,OAAOiI,EAAWjI,EAAQqJ,EAC9B,CACA,MAAO,CACHpB,aACAqB,iBACAC,gBAAiB,CAACrX,EAAYf,IAAc8W,EAAW/V,EAAYf,GACnE2V,aAAe5U,GAAeoX,EAAepX,GAC7CgV,MAAO,CAAEC,iBAAkB,IAAMpF,EAAMxlC,YAAYwlC,EAAM7H,cACzDmP,QAASA,EAEjB,CCZ6CG,CAAW,CACpD5N,EAAG4E,GACHr7D,EAAGslB,OAAO,QACV68C,eAAgB,IAChBpN,YAAa,GACbsN,GAAI/8C,OAAO,GACX88C,WAAa5tE,IACT,MAAMiiE,EAAI4E,IAEJ,UAAEW,EAAS,GAAEhmE,GAAOulE,GAAoB/mE,GAC9C,OAAO,GAAIggE,GAAKwH,EAAW,GAAKvF,GAAKzgE,EAAIygE,EAAE,EAE/CwF,qBACA7kC,YAAW,KAbuB,GCpGtC,SAASktC,GAAWC,EAAevY,GAC/B,MAAMe,EAAa,IAAIz9D,WA1CK,IA2C5B,IAAK,IAAI1O,EAAI,EAAGA,EA1CK,GA0CiBA,IAClCmsE,EAAWnsE,GAAK2jF,EAAc3jF,GAC9BmsE,EA5CiB,GA4CansE,GAAKorE,EAAUprE,GAEjD,OAAOmsE,CACX,CC1CO,MAAMyX,GACThgF,KAAO,UACPunE,IACA,WAAAp9D,CAAYvQ,GACRiB,KAAK0sE,IAAM0Y,GAAiBrmF,EDXL,GCY3B,CACA,WAAAguE,GACI,OAAO,GAASl3D,OAAOm3D,GAAoBhtE,MAC/C,CACA,KAAAitE,GACI,OAAOn/B,GAAIO,SAAS,IAAKruC,KAAK+sE,cAClC,CACA,QAAA1mE,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAK+sE,cAAcj+D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,MAAAltD,CAAOmqB,EAAMujC,GACT,ODUD,SAAuBP,EAAWO,EAAKv1B,GAC1C,OAAO,GAAGn4B,OAAO0tD,EAAKv1B,aAAe1nC,WAAa0nC,EAAMA,EAAI11B,WAAY0qD,EAC5E,CCZe,CAAqB3sE,KAAK0sE,IAAKQ,EAAKvjC,EAC/C,EAEG,MAAM07C,GACTlgF,KAAO,UACPunE,IACAC,UAGA,WAAAr9D,CAAYvQ,EAAK4tE,GACb3sE,KAAK0sE,IAAM0Y,GAAiBrmF,EDtCJ,ICuCxBiB,KAAK2sE,UAAY,IAAIwY,GAAiBxY,EAC1C,CACA,MAAAr+B,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,IAAApuD,CAAK9R,GACD,ODdD,SAAqBkhE,EAAY/1B,GACpC,MAAMutC,EAAgBxX,EAAWzrD,SAAS,EAlCrB,IAmCrB,OAAO,GAAG3D,KAAKq5B,aAAe1nC,WAAa0nC,EAAMA,EAAI11B,WAAYijE,EACrE,CCWe,CAAmBllF,KAAK0sE,IAAKlgE,EACxC,ECnCG,SAAS84E,GAA0Bx2E,GAEtC,OADAA,EAAQs2E,GAAiBt2E,EFhBE,IEiBpB,IAAIq2E,GAAsBr2E,EACrC,CASO,SAASs2E,GAAiBrmF,EAAK0C,GAElC,IADA1C,EAAMkR,WAAWsO,KAAKxf,GAAO,KACrB0C,SAAWA,EACf,MAAM,IAAI,GAAuB,sCAAsCA,UAAe1C,EAAI0C,UAE9F,OAAO1C,CACX,CC5BO,IAAIwmF,GAOPC,GAYOC,GAoDAC,IAtEX,SAAWH,GACPA,EAAa,IAAI,MACjBA,EAAiB,QAAI,UACrBA,EAAmB,UAAI,YACvBA,EAAe,MAAI,OACtB,CALD,CAKGA,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACPA,EAAgBA,EAAqB,IAAI,GAAK,MAC9CA,EAAgBA,EAAyB,QAAI,GAAK,UAClDA,EAAgBA,EAA2B,UAAI,GAAK,YACpDA,EAAgBA,EAAuB,MAAI,GAAK,OACnD,CALD,CAKGA,KAAoBA,GAAkB,CAAC,IAC1C,SAAWD,GACPA,EAAQl+C,MAAQ,IACLoK,GAAY+zC,GAE1B,CAJD,CAIGD,KAAYA,GAAU,CAAC,IAE1B,SAAWE,GACP,IAAInzC,EACJmzC,EAAUp+C,MAAQ,KACA,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAZ1Q,EAAIuH,OACJ/F,EAAE1D,OAAO,GACTk1E,GAAQl+C,QAAQnyB,OAAO3C,EAAIuH,KAAM/F,IAErB,MAAZxB,EAAIozE,OACJ5xE,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIozE,QAEa,IAAzB7oD,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIuH,KAAOyrE,GAAQl+C,QAAQrrB,OAAOsD,GAClC,MAEJ,KAAK,EACD/M,EAAIozE,KAAOrmE,EAAOxQ,QAClB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXmzC,EAAUvwE,OAAU3C,GACT89B,GAAc99B,EAAKkzE,EAAUp+C,SAExCo+C,EAAUzpE,OAAS,CAACxM,EAAKstB,IACdsK,EAAc53B,EAAKi2E,EAAUp+C,QAASvK,EAEpD,CAlDD,CAkDG2oD,KAAcA,GAAY,CAAC,IAE9B,SAAWC,GACP,IAAIpzC,EACJozC,EAAWr+C,MAAQ,KACD,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAZ1Q,EAAIuH,OACJ/F,EAAE1D,OAAO,GACTk1E,GAAQl+C,QAAQnyB,OAAO3C,EAAIuH,KAAM/F,IAErB,MAAZxB,EAAIozE,OACJ5xE,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIozE,QAEa,IAAzB7oD,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CAAC,EACPtL,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIuH,KAAOyrE,GAAQl+C,QAAQrrB,OAAOsD,GAClC,MAEJ,KAAK,EACD/M,EAAIozE,KAAOrmE,EAAOxQ,QAClB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXozC,EAAWxwE,OAAU3C,GACV89B,GAAc99B,EAAKmzE,EAAWr+C,SAEzCq+C,EAAW1pE,OAAS,CAACxM,EAAKstB,IACfsK,EAAc53B,EAAKk2E,EAAWr+C,QAASvK,EAErD,CAlDD,CAkDG4oD,KAAeA,GAAa,CAAC,IC7HzB,MAAME,WAAqBpnF,MAC9B,WAAA8Q,CAAY9C,EAAU,6CAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,cAChB,EAKG,MAAM8kF,WAA0BrnF,MACnC,WAAA8Q,CAAY9C,EAAU,+CAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,mBAChB,EAKG,MAAM+kF,WAA8BtnF,MACvC,WAAA8Q,CAAY9C,EAAU,0BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,ECrBJ,MCHA,GDGA,CACI,GAAA3B,CAAI2mF,EAAMnuD,YACN,MAAMouD,EAAeD,EAAI34C,OACzB,GAA4B,MAAxB44C,GAAc34C,OACd,MAAM,IAAIy4C,GAAsB,uRAMpC,OAAOE,CACX,GEVG,MAAMC,GACT9gF,KAAO,MACPqnE,IACAC,KACAyZ,WACA,WAAA52E,CAAYk9D,EAAK32D,GACb7V,KAAKwsE,IAAMA,EACXxsE,KAAKkmF,WAAarwE,CACtB,CACA,OAAI62D,GAIA,OAHiB,MAAb1sE,KAAKysE,OACLzsE,KAAKysE,KAAO,GAAgBzsE,KAAKwsE,MAE9BxsE,KAAKysE,IAChB,CACA,WAAAM,GACI,OAAO/sE,KAAKkmF,UAChB,CACA,KAAAjZ,GACI,OAAOn/B,GAAIO,SAAS,IAAKruC,KAAKkmF,WAClC,CACA,QAAA7/E,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAK+sE,cAAcj+D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,MAAAltD,CAAOmqB,EAAMujC,GACT,OCPD//B,eAA6BpuC,EAAKmuE,EAAKv1B,GAC1C,MAAMg1B,QAAkBwZ,GAAU/mF,MAAMiuC,OAAO8/B,UAAU,MAAOpuE,EAAK,CACjEgC,KAAM,oBACNqM,KAAM,CAAErM,KAAM,aACf,EAAO,CAAC,WACX,OAAOolF,GAAU/mF,MAAMiuC,OAAO7tB,OAAO,CAAEze,KAAM,qBAAuB4rE,EAAWO,EAAKv1B,aAAe1nC,WAAa0nC,EAAMA,EAAI11B,WAC9H,CDCe,CAAcjiB,KAAKwsE,IAAKU,EAAKvjC,EACxC,EAEG,MAAMy8C,GACTjhF,KAAO,MACPqnE,IACAC,KACAE,UACA,WAAAr9D,CAAYk9D,EAAKG,GACb3sE,KAAKwsE,IAAMA,EACXxsE,KAAK2sE,UAAYA,CACrB,CACA,OAAID,GAIA,OAHiB,MAAb1sE,KAAKysE,OACLzsE,KAAKysE,KETV,SAAoBD,GACvB,GAAa,MAATA,EAAIh5D,GAAsB,MAATg5D,EAAIvoD,GAAsB,MAATuoD,EAAI/vD,GAAsB,MAAT+vD,EAAI9tC,GAAsB,MAAT8tC,EAAIhqC,GAAuB,MAAVgqC,EAAI6Z,IAAwB,MAAV7Z,EAAI8Z,IAAwB,MAAV9Z,EAAI+Z,GAC7H,MAAM,IAAI,GAAuB,8BAErC,OAAOja,GAAe,CAClBF,GAAcn8D,WAAWsO,KAAK,CAAC,KAC/B6tD,GAAc,GAAqBI,EAAIh5D,EAAG,cAC1C44D,GAAc,GAAqBI,EAAIvoD,EAAG,cAC1CmoD,GAAc,GAAqBI,EAAI/vD,EAAG,cAC1C2vD,GAAc,GAAqBI,EAAI9tC,EAAG,cAC1C0tC,GAAc,GAAqBI,EAAIhqC,EAAG,cAC1C4pC,GAAc,GAAqBI,EAAI6Z,GAAI,cAC3Cja,GAAc,GAAqBI,EAAI8Z,GAAI,cAC3Cla,GAAc,GAAqBI,EAAI+Z,GAAI,gBAC5CtkE,UACP,CFNwB,CAAiBjiB,KAAKwsE,MAE/BxsE,KAAKysE,IAChB,CACA,MAAAn+B,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,IAAApuD,CAAK9R,GACD,OCxCD2gC,eAA2BpuC,EAAK44C,GACnC,MAAM+1B,QAAmByY,GAAU/mF,MAAMiuC,OAAO8/B,UAAU,MAAOpuE,EAAK,CAClEgC,KAAM,oBACNqM,KAAM,CAAErM,KAAM,aACf,EAAO,CAAC,SACLmsE,QAAYiZ,GAAU/mF,MAAMiuC,OAAO/uB,KAAK,CAAEvd,KAAM,qBAAuB2sE,EAAY/1B,aAAe1nC,WAAa0nC,EAAMA,EAAI11B,YAC/H,OAAO,IAAIhS,WAAWi9D,EAAK,EAAGA,EAAI18D,WACtC,CDiCe,CAAYxQ,KAAKwsE,IAAKhgE,EACjC,EErDG,MAGDg6E,GAA2Bv2E,WAAWsO,KAAK,CAC7C,GAAM,GAAM,EAAM,EAAM,GAAM,IAAM,GAAM,IAAM,IAAM,GAAM,EAAM,EAAM,EAAM,EAAM,IAoEjF,SAASkoE,GAAUja,GACtB,GAAa,MAATA,EAAIh5D,GAAsB,MAATg5D,EAAIvoD,EACrB,MAAM,IAAI,GAAuB,8BASrC,OAP6BqoD,GAAe,CACxCka,GACAna,GAAgBC,GAAe,CAC3BF,GAAc,GAAqBI,EAAIh5D,EAAG,cAC1C44D,GAAc,GAAqBI,EAAIvoD,EAAG,mBAGtBhC,UAChC,CA2BO,SAASykE,GAA0Bl6E,EAASsC,EAAO+G,GACtD,MAAM22D,EAvDH,SAA0BhgE,GAC7B,MAAMtH,EAAO,GAAUsH,EAAQ,GAAI,CAC/BtJ,OAAQ,IAIZ,MAAO,CACHuqE,IAAK,MACLj6D,EAAG,GAAmBtO,EAAK,GAAI,aAC/B+e,EAAG,GAAmB/e,EAAK,GAAI,aAEvC,CA4CgByhF,CAAiBn6E,GAQ7B,OAPc,MAAVqJ,IAKAA,EAAS,GArHK,GAiHD,GAAO,GAAaX,OAAO,CACpC4E,KAAM,GAAW8sE,IACjBjB,KAAM72E,OAIP,IAAIm3E,GAAkBzZ,EAAK32D,EACtC,CC5HO,MAAMgxE,WAAatvC,GACtB,WAAAjoC,CAAYlC,EAAM05E,GACd12C,QACApwC,KAAK82C,UAAW,EAChB92C,KAAK62C,WAAY,EACjBN,GAAMnpC,GACN,MAAMrO,EAAMq4C,GAAQ0vC,GAEpB,GADA9mF,KAAK+mF,MAAQ35E,EAAKxO,SACe,mBAAtBoB,KAAK+mF,MAAMjoF,OAClB,MAAM,IAAIN,MAAM,uDACpBwB,KAAKy2C,SAAWz2C,KAAK+mF,MAAMtwC,SAC3Bz2C,KAAKw2C,UAAYx2C,KAAK+mF,MAAMvwC,UAC5B,MAAMC,EAAWz2C,KAAKy2C,SAChB7M,EAAM,IAAI35B,WAAWwmC,GAE3B7M,EAAItqC,IAAIP,EAAI0C,OAASg1C,EAAWrpC,EAAKxO,SAASE,OAAOC,GAAK8W,SAAW9W,GACrE,IAAK,IAAIwC,EAAI,EAAGA,EAAIqoC,EAAInoC,OAAQF,IAC5BqoC,EAAIroC,IAAM,GACdvB,KAAK+mF,MAAMjoF,OAAO8qC,GAElB5pC,KAAKgnF,MAAQ55E,EAAKxO,SAElB,IAAK,IAAI2C,EAAI,EAAGA,EAAIqoC,EAAInoC,OAAQF,IAC5BqoC,EAAIroC,IAAM,IACdvB,KAAKgnF,MAAMloF,OAAO8qC,GAClBA,EAAI8O,KAAK,EACb,CACA,MAAA55C,CAAO0Q,GAGH,OAFAknC,GAAQ12C,MACRA,KAAK+mF,MAAMjoF,OAAO0Q,GACXxP,IACX,CACA,UAAAw4C,CAAW3O,GACP6M,GAAQ12C,MACR,GAAO6pC,EAAK7pC,KAAKw2C,WACjBx2C,KAAK82C,UAAW,EAChB92C,KAAK+mF,MAAMvuC,WAAW3O,GACtB7pC,KAAKgnF,MAAMloF,OAAO+qC,GAClB7pC,KAAKgnF,MAAMxuC,WAAW3O,GACtB7pC,KAAKyL,SACT,CACA,MAAAoK,GACI,MAAMg0B,EAAM,IAAI55B,WAAWjQ,KAAKgnF,MAAMxwC,WAEtC,OADAx2C,KAAKw4C,WAAW3O,GACTA,CACX,CACA,UAAA2N,CAAW4B,GAEPA,IAAOA,EAAKz6C,OAAOC,OAAOD,OAAOw4B,eAAen3B,MAAO,CAAC,IACxD,MAAM,MAAEgnF,EAAK,MAAED,EAAK,SAAEjwC,EAAQ,UAAED,EAAS,SAAEJ,EAAQ,UAAED,GAAcx2C,KAQnE,OANAo5C,EAAGtC,SAAWA,EACdsC,EAAGvC,UAAYA,EACfuC,EAAG3C,SAAWA,EACd2C,EAAG5C,UAAYA,EACf4C,EAAG4tC,MAAQA,EAAMxvC,WAAW4B,EAAG4tC,OAC/B5tC,EAAG2tC,MAAQA,EAAMvvC,WAAW4B,EAAG2tC,OACxB3tC,CACX,CACA,OAAA3tC,GACIzL,KAAK62C,WAAY,EACjB72C,KAAKgnF,MAAMv7E,UACXzL,KAAK+mF,MAAMt7E,SACf,EAYG,MAAMw7E,GAAO,CAAC75E,EAAMrO,EAAKyN,IAAY,IAAIq6E,GAAKz5E,EAAMrO,GAAKD,OAAO0N,GAASqJ,SCnChF,SAASqxE,GAAmBpqD,QACN59B,IAAd49B,EAAKqqD,MACLtU,GAAM,OAAQ/1C,EAAKqqD,WACFjoF,IAAjB49B,EAAK6gD,SACL9K,GAAM,UAAW/1C,EAAK6gD,QAC9B,CD+BAsJ,GAAKroF,OAAS,CAACwO,EAAMrO,IAAQ,IAAI8nF,GAAKz5E,EAAMrO,GCHrC,MAAMqoF,WAAe5oF,MACxB,WAAA8Q,CAAY8nB,EAAI,IACZgZ,MAAMhZ,EACV,EASG,MAAMiwD,GAAM,CAEfC,IAAKF,GAELG,KAAM,CACFryE,OAAQ,CAAC49B,EAAKnJ,KACV,MAAQ29C,IAAKztC,GAAMwtC,GACnB,GAAIv0C,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAI+G,EAAE,yBAChB,GAAkB,EAAdlQ,EAAKloC,OACL,MAAM,IAAIo4C,EAAE,6BAChB,MAAM2tC,EAAU79C,EAAKloC,OAAS,EACxBW,EAAM2wE,GAAoByU,GAChC,GAAKplF,EAAIX,OAAS,EAAK,IACnB,MAAM,IAAIo4C,EAAE,wCAEhB,MAAM4tC,EAASD,EAAU,IAAMzU,GAAqB3wE,EAAIX,OAAS,EAAK,KAAO,GAE7E,OADUsxE,GAAoBjgC,GACnB20C,EAASrlF,EAAMunC,CAAI,EAGlC,MAAA3tB,CAAO82B,EAAKnJ,GACR,MAAQ29C,IAAKztC,GAAMwtC,GACnB,IAAIvgF,EAAM,EACV,GAAIgsC,EAAM,GAAKA,EAAM,IACjB,MAAM,IAAI+G,EAAE,yBAChB,GAAIlQ,EAAKloC,OAAS,GAAKkoC,EAAK7iC,OAAWgsC,EACnC,MAAM,IAAI+G,EAAE,yBAChB,MAAMhmB,EAAQ8V,EAAK7iC,KAEnB,IAAIrF,EAAS,EACb,GAF0B,IAARoyB,EAIb,CAED,MAAM4zD,EAAiB,IAAR5zD,EACf,IAAK4zD,EACD,MAAM,IAAI5tC,EAAE,qDAChB,GAAI4tC,EAAS,EACT,MAAM,IAAI5tC,EAAE,4CAChB,MAAM6tC,EAAc/9C,EAAK1nB,SAASnb,EAAKA,EAAM2gF,GAC7C,GAAIC,EAAYjmF,SAAWgmF,EACvB,MAAM,IAAI5tC,EAAE,yCAChB,GAAuB,IAAnB6tC,EAAY,GACZ,MAAM,IAAI7tC,EAAE,wCAChB,IAAK,MAAMj5B,KAAK8mE,EACZjmF,EAAUA,GAAU,EAAKmf,EAE7B,GADA9Z,GAAO2gF,EACHhmF,EAAS,IACT,MAAM,IAAIo4C,EAAE,yCACpB,MAlBIp4C,EAASoyB,EAmBb,MAAMx0B,EAAIsqC,EAAK1nB,SAASnb,EAAKA,EAAMrF,GACnC,GAAIpC,EAAEoC,SAAWA,EACb,MAAM,IAAIo4C,EAAE,kCAChB,MAAO,CAAEx6C,IAAGmC,EAAGmoC,EAAK1nB,SAASnb,EAAMrF,GACvC,GAMJkmF,KAAM,CACF,MAAAzyE,CAAOs3B,GACH,MAAQ86C,IAAKztC,GAAMwtC,GACnB,GAAI76C,EAAM,GACN,MAAM,IAAIqN,EAAE,8CAChB,IAAInkC,EAAMq9D,GAAoBvmC,GAI9B,GAFkC,EAA9BjiC,OAAOiU,SAAS9I,EAAI,GAAI,MACxBA,EAAM,KAAOA,GACA,EAAbA,EAAIjU,OACJ,MAAM,IAAIo4C,EAAE,kDAChB,OAAOnkC,CACX,EACA,MAAAsG,CAAO2tB,GACH,MAAQ29C,IAAKztC,GAAMwtC,GACnB,GAAc,IAAV19C,EAAK,GACL,MAAM,IAAIkQ,EAAE,uCAChB,GAAgB,IAAZlQ,EAAK,MAA2B,IAAVA,EAAK,IAC3B,MAAM,IAAIkQ,EAAE,uDAChB,OAAO,GAAgBlQ,EAC3B,GAEJ,KAAAi+C,CAAMlyE,GAEF,MAAQ4xE,IAAKztC,EAAG8tC,KAAM/6C,EAAK26C,KAAMM,GAAQR,GACnC19C,EAAO,GAAY,YAAaj0B,IAC9BrW,EAAGyoF,EAAUtmF,EAAGumF,GAAiBF,EAAI7rE,OAAO,GAAM2tB,GAC1D,GAAIo+C,EAAatmF,OACb,MAAM,IAAIo4C,EAAE,+CAChB,MAAQx6C,EAAG2oF,EAAQxmF,EAAGymF,GAAeJ,EAAI7rE,OAAO,EAAM8rE,IAC9CzoF,EAAG6oF,EAAQ1mF,EAAG2mF,GAAeN,EAAI7rE,OAAO,EAAMisE,GACtD,GAAIE,EAAW1mF,OACX,MAAM,IAAIo4C,EAAE,+CAChB,MAAO,CAAErf,EAAGoS,EAAI5wB,OAAOgsE,GAASjlF,EAAG6pC,EAAI5wB,OAAOksE,GAClD,EACA,UAAAE,CAAWlb,GACP,MAAQqa,KAAMM,EAAKF,KAAM/6C,GAAQy6C,GAG3BgB,EAFKR,EAAI3yE,OAAO,EAAM03B,EAAI13B,OAAOg4D,EAAI1yC,IAChCqtD,EAAI3yE,OAAO,EAAM03B,EAAI13B,OAAOg4D,EAAInqE,IAE3C,OAAO8kF,EAAI3yE,OAAO,GAAMmzE,EAC5B,GAIE,GAAMpiD,OAAO,GAAI,GAAMA,OAAO,GAAqB,IAAXA,OAAO,GAAUA,OAAO,IA+c/D,SAASqiD,GAAYhL,GACxB,MAAMC,EArBV,SAAsBjP,GAClB,MAAMxxC,EAAO6+C,GAAcrN,GAU3B,OATA6F,GAAer3C,EAAM,CACjB1vB,KAAM,OACN65E,KAAM,WACNlvC,YAAa,YACd,CACCwwC,SAAU,WACVC,cAAe,WACfrB,KAAM,YAEHxoF,OAAOmd,OAAO,CAAEqrE,MAAM,KAASrqD,GAC1C,CASkB,CAAawgD,IACrB,GAAErJ,EAAIzgE,GAAmB+pE,EACzBkL,EAAgBxU,EAAG6B,MAAQ,EAC3B4S,EAAkB,EAAIzU,EAAG6B,MAAQ,EACvC,SAAS+L,EAAKlhE,GACV,OAAO,GAAIA,EAAGmgE,EAClB,CACA,SAAS6H,EAAKhoE,GACV,OAAOy0D,GAAOz0D,EAAGmgE,EACrB,CACA,MAAQ8H,gBAAiBxK,EAAK,uBAAEyK,EAAsB,oBAAEC,EAAmB,mBAAEC,GAzd1E,SAA2BjsD,GAC9B,MAAMygD,EAnJV,SAA2BjP,GACvB,MAAMxxC,EAAO6+C,GAAcrN,GAC3B6F,GAAer3C,EAAM,CACjBnc,EAAG,QACHC,EAAG,SACJ,CACCooE,yBAA0B,QAC1BC,eAAgB,UAChB/H,cAAe,WACfC,cAAe,WACf+H,mBAAoB,UACpB1Q,UAAW,WACXphC,QAAS,aAEb,MAAM,KAAE+xC,EAAI,GAAElV,EAAE,EAAEtzD,GAAMmc,EACxB,GAAIqsD,EAAM,CACN,IAAKlV,EAAGqC,IAAI31D,EAAGszD,EAAGgC,MACd,MAAM,IAAIz3E,MAAM,8EAEpB,GAAoB,iBAAT2qF,GACc,iBAAdA,EAAKC,MACgB,mBAArBD,EAAKE,YACZ,MAAM,IAAI7qF,MAAM,wEAExB,CACA,OAAOG,OAAOmd,OAAO,IAAKghB,GAC9B,CAyHkBwsD,CAAkBxsD,IAC1B,GAAEm3C,GAAOsJ,EACTQ,EAAK,GAAMR,EAAM/pE,EAAG+pE,EAAM/H,YAC1Bp+B,EAAUmmC,EAAMnmC,SAClB,EAAEmyC,EAAItH,EAAOuH,KACT,MAAM7oE,EAAIshE,EAAMzC,WAChB,OAAO,GAAYvvE,WAAWsO,KAAK,CAAC,IAAQ01D,EAAG78B,QAAQz2B,EAAExL,GAAI8+D,EAAG78B,QAAQz2B,EAAEmsD,GAC7E,GACC0L,EAAY+E,EAAM/E,WACpB,CAAE1pE,IAEE,MAAM4S,EAAO5S,EAAMmT,SAAS,GAI5B,MAAO,CAAE9M,EAFC8+D,EAAGuE,UAAU92D,EAAKO,SAAS,EAAGgyD,EAAG6B,QAE/BhJ,EADFmH,EAAGuE,UAAU92D,EAAKO,SAASgyD,EAAG6B,MAAO,EAAI7B,EAAG6B,QAEzD,GAKL,SAASgT,EAAoB3zE,GACzB,MAAM,EAAEwL,EAAC,EAAEC,GAAM28D,EACXkM,EAAKxV,EAAGwC,IAAIthE,GACZu0E,EAAKzV,EAAG0C,IAAI8S,EAAIt0E,GACtB,OAAO8+D,EAAGj3D,IAAIi3D,EAAGj3D,IAAI0sE,EAAIzV,EAAG0C,IAAIxhE,EAAGwL,IAAKC,EAC5C,CAKA,IAAKqzD,EAAGqC,IAAIrC,EAAGwC,IAAI8G,EAAM1B,IAAKiN,EAAoBvL,EAAM3B,KACpD,MAAM,IAAIp9E,MAAM,+CAOpB,SAASqqF,EAAuB9pF,GAC5B,MAAQiqF,yBAA0B1yC,EAAO,YAAEo/B,EAAW,eAAEuT,EAAgBz1E,EAAGm2E,GAAMpM,EACjF,GAAIjnC,GAA0B,iBAARv3C,EAAkB,CAIpC,GAHI,GAAQA,KACRA,EAAM,GAAWA,IAEF,iBAARA,IAAqBu3C,EAAQtrB,SAASjsB,EAAI0C,QACjD,MAAM,IAAIjD,MAAM,uBACpBO,EAAMA,EAAIuxD,SAAuB,EAAdolB,EAAiB,IACxC,CACA,IAAIlpC,EACJ,IACIA,EACmB,iBAARztC,EACDA,EACA,GAAgB,GAAY,cAAeA,EAAK22E,GAC9D,CACA,MAAOluD,GACH,MAAM,IAAIhpB,MAAM,wCAA0Ck3E,EAAc,sBAAwB32E,EACpG,CAIA,OAHIkqF,IACAz8C,EAAM,GAAIA,EAAKm9C,IACnB,GAAS,cAAen9C,EAAK,GAAKm9C,GAC3Bn9C,CACX,CACA,SAASo9C,EAAUr7C,GACf,KAAMA,aAAiB6vC,GACnB,MAAM,IAAI5/E,MAAM,2BACxB,CAKA,MAAM6/E,EAAe5J,IAAS,CAAC/1C,EAAG4/C,KAC9B,MAAQuL,GAAI10E,EAAG20E,GAAIhd,EAAGid,GAAIrL,GAAMhgD,EAEhC,GAAIu1C,EAAGqC,IAAIoI,EAAGzK,EAAGiC,KACb,MAAO,CAAE/gE,IAAG23D,KAChB,MAAMqJ,EAAMz3C,EAAEy3C,MAGJ,MAANmI,IACAA,EAAKnI,EAAMlC,EAAGiC,IAAMjC,EAAGiD,IAAIwH,IAC/B,MAAMC,EAAK1K,EAAG0C,IAAIxhE,EAAGmpE,GACfM,EAAK3K,EAAG0C,IAAI7J,EAAGwR,GACfO,EAAK5K,EAAG0C,IAAI+H,EAAGJ,GACrB,GAAInI,EACA,MAAO,CAAEhhE,EAAG8+D,EAAGgC,KAAMnJ,EAAGmH,EAAGgC,MAC/B,IAAKhC,EAAGqC,IAAIuI,EAAI5K,EAAGiC,KACf,MAAM,IAAI13E,MAAM,oBACpB,MAAO,CAAE2W,EAAGwpE,EAAI7R,EAAG8R,EAAI,IAIrBE,EAAkBrK,IAAU/1C,IAC9B,GAAIA,EAAEy3C,MAAO,CAIT,GAAIoH,EAAM2L,qBAAuBjV,EAAGkC,IAAIz3C,EAAEorD,IACtC,OACJ,MAAM,IAAItrF,MAAM,kBACpB,CAEA,MAAM,EAAE2W,EAAC,EAAE23D,GAAMpuC,EAAE8gD,WAEnB,IAAKvL,EAAGC,QAAQ/+D,KAAO8+D,EAAGC,QAAQpH,GAC9B,MAAM,IAAItuE,MAAM,4BACpB,MAAM6qC,EAAO4qC,EAAGwC,IAAI3J,GACd13D,EAAQ0zE,EAAoB3zE,GAClC,IAAK8+D,EAAGqC,IAAIjtC,EAAMj0B,GACd,MAAM,IAAI5W,MAAM,qCACpB,IAAKkgC,EAAEwiD,gBACH,MAAM,IAAI1iF,MAAM,0CACpB,OAAO,CAAI,IAOf,MAAM4/E,EACF,WAAA9uE,CAAYu6E,EAAIC,EAAIC,GAChB,GAAU,MAANF,IAAe5V,EAAGC,QAAQ2V,GAC1B,MAAM,IAAIrrF,MAAM,cACpB,GAAU,MAANsrF,IAAe7V,EAAGC,QAAQ4V,GAC1B,MAAM,IAAItrF,MAAM,cACpB,GAAU,MAANurF,IAAe9V,EAAGC,QAAQ6V,GAC1B,MAAM,IAAIvrF,MAAM,cACpBwB,KAAK6pF,GAAKA,EACV7pF,KAAK8pF,GAAKA,EACV9pF,KAAK+pF,GAAKA,EACVprF,OAAOmd,OAAO9b,KAClB,CAGA,iBAAOy/E,CAAW/gD,GACd,MAAM,EAAEvpB,EAAC,EAAE23D,GAAMpuC,GAAK,CAAC,EACvB,IAAKA,IAAMu1C,EAAGC,QAAQ/+D,KAAO8+D,EAAGC,QAAQpH,GACpC,MAAM,IAAItuE,MAAM,wBACpB,GAAIkgC,aAAa0/C,EACb,MAAM,IAAI5/E,MAAM,gCACpB,MAAM23E,EAAO50E,GAAM0yE,EAAGqC,IAAI/0E,EAAG0yE,EAAGgC,MAEhC,OAAIE,EAAIhhE,IAAMghE,EAAIrJ,GACPsR,EAAMnI,KACV,IAAImI,EAAMjpE,EAAG23D,EAAGmH,EAAGiC,IAC9B,CACA,KAAI/gE,GACA,OAAOnV,KAAKw/E,WAAWrqE,CAC3B,CACA,KAAI23D,GACA,OAAO9sE,KAAKw/E,WAAW1S,CAC3B,CAOA,iBAAO4S,CAAWjF,GACd,MAAMkF,EAAQ1L,EAAGgE,YAAYwC,EAAOn2E,KAAKo6B,GAAMA,EAAEqrD,MACjD,OAAOtP,EAAOn2E,KAAI,CAACo6B,EAAGn9B,IAAMm9B,EAAE8gD,SAASG,EAAMp+E,MAAK+C,IAAI85E,EAAMqB,WAChE,CAKA,cAAOnoC,CAAQ5hC,GACX,MAAM0hE,EAAIgH,EAAMqB,WAAWjH,EAAU,GAAY,WAAY9iE,KAE7D,OADA0hE,EAAE2I,iBACK3I,CACX,CAEA,qBAAOqK,CAAe/T,GAClB,OAAO0Q,EAAMz2C,KAAKk5C,SAASgI,EAAuBnb,GACtD,CAEA,UAAOkS,CAAInF,EAAQW,GACf,OAAO,GAAUgD,EAAOL,EAAItD,EAAQW,EACxC,CAEA,cAAAyE,CAAevG,GACXwG,EAAK5E,cAAcl7E,KAAMs5E,EAC7B,CAEA,cAAAyG,GACIjB,EAAgB9+E,KACpB,CACA,QAAAgqF,GACI,MAAM,EAAEld,GAAM9sE,KAAKw/E,WACnB,GAAIvL,EAAGmC,MACH,OAAQnC,EAAGmC,MAAMtJ,GACrB,MAAM,IAAItuE,MAAM,8BACpB,CAIA,MAAA8vC,CAAOC,GACHq7C,EAAUr7C,GACV,MAAQs7C,GAAI7J,EAAI8J,GAAI7J,EAAI8J,GAAI7J,GAAOlgF,MAC3B6pF,GAAI1K,EAAI2K,GAAI1K,EAAI2K,GAAI1K,GAAO9wC,EAC7B07C,EAAKhW,EAAGqC,IAAIrC,EAAG0C,IAAIqJ,EAAIX,GAAKpL,EAAG0C,IAAIwI,EAAIe,IACvCgK,EAAKjW,EAAGqC,IAAIrC,EAAG0C,IAAIsJ,EAAIZ,GAAKpL,EAAG0C,IAAIyI,EAAIc,IAC7C,OAAO+J,GAAMC,CACjB,CAIA,MAAAnR,GACI,OAAO,IAAIqF,EAAMp+E,KAAK6pF,GAAI5V,EAAGoC,IAAIr2E,KAAK8pF,IAAK9pF,KAAK+pF,GACpD,CAKA,MAAAjnE,GACI,MAAM,EAAEnC,EAAC,EAAEC,GAAM28D,EACX3mE,EAAKq9D,EAAG0C,IAAI/1D,EAAG,KACbipE,GAAI7J,EAAI8J,GAAI7J,EAAI8J,GAAI7J,GAAOlgF,KACnC,IAAIwgF,EAAKvM,EAAGgC,KAAMwK,EAAKxM,EAAGgC,KAAM0K,EAAK1M,EAAGgC,KACpCkU,EAAKlW,EAAG0C,IAAIqJ,EAAIA,GAChBoK,EAAKnW,EAAG0C,IAAIsJ,EAAIA,GAChBpI,EAAK5D,EAAG0C,IAAIuJ,EAAIA,GAChBmK,EAAKpW,EAAG0C,IAAIqJ,EAAIC,GA4BpB,OA3BAoK,EAAKpW,EAAGj3D,IAAIqtE,EAAIA,GAChB1J,EAAK1M,EAAG0C,IAAIqJ,EAAIE,GAChBS,EAAK1M,EAAGj3D,IAAI2jE,EAAIA,GAChBH,EAAKvM,EAAG0C,IAAIh2D,EAAGggE,GACfF,EAAKxM,EAAG0C,IAAI//D,EAAIihE,GAChB4I,EAAKxM,EAAGj3D,IAAIwjE,EAAIC,GAChBD,EAAKvM,EAAGyC,IAAI0T,EAAI3J,GAChBA,EAAKxM,EAAGj3D,IAAIotE,EAAI3J,GAChBA,EAAKxM,EAAG0C,IAAI6J,EAAIC,GAChBD,EAAKvM,EAAG0C,IAAI0T,EAAI7J,GAChBG,EAAK1M,EAAG0C,IAAI//D,EAAI+pE,GAChB9I,EAAK5D,EAAG0C,IAAIh2D,EAAGk3D,GACfwS,EAAKpW,EAAGyC,IAAIyT,EAAItS,GAChBwS,EAAKpW,EAAG0C,IAAIh2D,EAAG0pE,GACfA,EAAKpW,EAAGj3D,IAAIqtE,EAAI1J,GAChBA,EAAK1M,EAAGj3D,IAAImtE,EAAIA,GAChBA,EAAKlW,EAAGj3D,IAAI2jE,EAAIwJ,GAChBA,EAAKlW,EAAGj3D,IAAImtE,EAAItS,GAChBsS,EAAKlW,EAAG0C,IAAIwT,EAAIE,GAChB5J,EAAKxM,EAAGj3D,IAAIyjE,EAAI0J,GAChBtS,EAAK5D,EAAG0C,IAAIsJ,EAAIC,GAChBrI,EAAK5D,EAAGj3D,IAAI66D,EAAIA,GAChBsS,EAAKlW,EAAG0C,IAAIkB,EAAIwS,GAChB7J,EAAKvM,EAAGyC,IAAI8J,EAAI2J,GAChBxJ,EAAK1M,EAAG0C,IAAIkB,EAAIuS,GAChBzJ,EAAK1M,EAAGj3D,IAAI2jE,EAAIA,GAChBA,EAAK1M,EAAGj3D,IAAI2jE,EAAIA,GACT,IAAIvC,EAAMoC,EAAIC,EAAIE,EAC7B,CAKA,GAAA3jE,CAAIuxB,GACAq7C,EAAUr7C,GACV,MAAQs7C,GAAI7J,EAAI8J,GAAI7J,EAAI8J,GAAI7J,GAAOlgF,MAC3B6pF,GAAI1K,EAAI2K,GAAI1K,EAAI2K,GAAI1K,GAAO9wC,EACnC,IAAIiyC,EAAKvM,EAAGgC,KAAMwK,EAAKxM,EAAGgC,KAAM0K,EAAK1M,EAAGgC,KACxC,MAAMt1D,EAAI48D,EAAM58D,EACV/J,EAAKq9D,EAAG0C,IAAI4G,EAAM38D,EAAG,IAC3B,IAAIupE,EAAKlW,EAAG0C,IAAIqJ,EAAIb,GAChBiL,EAAKnW,EAAG0C,IAAIsJ,EAAIb,GAChBvH,EAAK5D,EAAG0C,IAAIuJ,EAAIb,GAChBgL,EAAKpW,EAAGj3D,IAAIgjE,EAAIC,GAChBqK,EAAKrW,EAAGj3D,IAAImiE,EAAIC,GACpBiL,EAAKpW,EAAG0C,IAAI0T,EAAIC,GAChBA,EAAKrW,EAAGj3D,IAAImtE,EAAIC,GAChBC,EAAKpW,EAAGyC,IAAI2T,EAAIC,GAChBA,EAAKrW,EAAGj3D,IAAIgjE,EAAIE,GAChB,IAAIqK,EAAKtW,EAAGj3D,IAAImiE,EAAIE,GA+BpB,OA9BAiL,EAAKrW,EAAG0C,IAAI2T,EAAIC,GAChBA,EAAKtW,EAAGj3D,IAAImtE,EAAItS,GAChByS,EAAKrW,EAAGyC,IAAI4T,EAAIC,GAChBA,EAAKtW,EAAGj3D,IAAIijE,EAAIC,GAChBM,EAAKvM,EAAGj3D,IAAIoiE,EAAIC,GAChBkL,EAAKtW,EAAG0C,IAAI4T,EAAI/J,GAChBA,EAAKvM,EAAGj3D,IAAIotE,EAAIvS,GAChB0S,EAAKtW,EAAGyC,IAAI6T,EAAI/J,GAChBG,EAAK1M,EAAG0C,IAAIh2D,EAAG2pE,GACf9J,EAAKvM,EAAG0C,IAAI//D,EAAIihE,GAChB8I,EAAK1M,EAAGj3D,IAAIwjE,EAAIG,GAChBH,EAAKvM,EAAGyC,IAAI0T,EAAIzJ,GAChBA,EAAK1M,EAAGj3D,IAAIotE,EAAIzJ,GAChBF,EAAKxM,EAAG0C,IAAI6J,EAAIG,GAChByJ,EAAKnW,EAAGj3D,IAAImtE,EAAIA,GAChBC,EAAKnW,EAAGj3D,IAAIotE,EAAID,GAChBtS,EAAK5D,EAAG0C,IAAIh2D,EAAGk3D,GACfyS,EAAKrW,EAAG0C,IAAI//D,EAAI0zE,GAChBF,EAAKnW,EAAGj3D,IAAIotE,EAAIvS,GAChBA,EAAK5D,EAAGyC,IAAIyT,EAAItS,GAChBA,EAAK5D,EAAG0C,IAAIh2D,EAAGk3D,GACfyS,EAAKrW,EAAGj3D,IAAIstE,EAAIzS,GAChBsS,EAAKlW,EAAG0C,IAAIyT,EAAIE,GAChB7J,EAAKxM,EAAGj3D,IAAIyjE,EAAI0J,GAChBA,EAAKlW,EAAG0C,IAAI4T,EAAID,GAChB9J,EAAKvM,EAAG0C,IAAI0T,EAAI7J,GAChBA,EAAKvM,EAAGyC,IAAI8J,EAAI2J,GAChBA,EAAKlW,EAAG0C,IAAI0T,EAAID,GAChBzJ,EAAK1M,EAAG0C,IAAI4T,EAAI5J,GAChBA,EAAK1M,EAAGj3D,IAAI2jE,EAAIwJ,GACT,IAAI/L,EAAMoC,EAAIC,EAAIE,EAC7B,CACA,QAAAC,CAASryC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMwqC,SAC1B,CACA,GAAA5C,GACI,OAAOn2E,KAAKsuC,OAAO8vC,EAAMnI,KAC7B,CACA,IAAAmE,CAAK5mE,GACD,OAAOssE,EAAK9E,WAAWh7E,KAAMwT,EAAG4qE,EAAMsB,WAC1C,CAMA,cAAAqB,CAAeyJ,GACX,MAAM,KAAErB,EAAM31E,EAAGm2E,GAAMpM,EACvB,GAAS,SAAUiN,EAAI,GAAKb,GAC5B,MAAM3I,EAAI5C,EAAMnI,KAChB,GAAIuU,IAAO,GACP,OAAOxJ,EACX,GAAIhhF,KAAKm2E,OAASqU,IAAO,GACrB,OAAOxqF,KAEX,IAAKmpF,GAAQrJ,EAAKzF,eAAer6E,MAC7B,OAAO8/E,EAAK7E,iBAAiBj7E,KAAMwqF,EAAIpM,EAAMsB,YAEjD,IAAI,MAAE+K,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,EAAKE,YAAYmB,GAC5CK,EAAM7J,EACN8J,EAAM9J,EACNvkE,EAAIzc,KACR,KAAO0qF,EAAK,IAAOE,EAAK,IAChBF,EAAK,KACLG,EAAMA,EAAI7tE,IAAIP,IACdmuE,EAAK,KACLE,EAAMA,EAAI9tE,IAAIP,IAClBA,EAAIA,EAAEqG,SACN4nE,IAAO,GACPE,IAAO,GAOX,OALIH,IACAI,EAAMA,EAAI9R,UACV4R,IACAG,EAAMA,EAAI/R,UACd+R,EAAM,IAAI1M,EAAMnK,EAAG0C,IAAImU,EAAIjB,GAAIV,EAAKC,MAAO0B,EAAIhB,GAAIgB,EAAIf,IAChDc,EAAI7tE,IAAI8tE,EACnB,CAUA,QAAAjK,CAASrF,GACL,MAAM,KAAE2N,EAAM31E,EAAGm2E,GAAMpM,EAEvB,IAAI0E,EAAO8I,EACX,GAFA,GAAS,SAAUvP,EAAQ,GAAKmO,GAE5BR,EAAM,CACN,MAAM,MAAEsB,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,EAAKE,YAAY7N,GAClD,IAAM98C,EAAGmsD,EAAK51E,EAAG+1E,GAAQhrF,KAAKo6E,KAAKsQ,IAC7BhsD,EAAGosD,EAAK71E,GAAWjV,KAAKo6E,KAAKwQ,GACnCC,EAAM/K,EAAKjH,gBAAgB4R,EAAOI,GAClCC,EAAMhL,EAAKjH,gBAAgB8R,EAAOG,GAClCA,EAAM,IAAI1M,EAAMnK,EAAG0C,IAAImU,EAAIjB,GAAIV,EAAKC,MAAO0B,EAAIhB,GAAIgB,EAAIf,IACvD9H,EAAQ4I,EAAI7tE,IAAI8tE,GAChBC,EAAOC,EAAIhuE,IAAIiuE,EACnB,KACK,CACD,MAAM,EAAEvsD,EAAC,EAAEzpB,GAAMjV,KAAKo6E,KAAKoB,GAC3ByG,EAAQvjD,EACRqsD,EAAO91E,CACX,CAEA,OAAOmpE,EAAMsB,WAAW,CAACuC,EAAO8I,IAAO,EAC3C,CAOA,oBAAAG,CAAqB1T,EAAG72D,EAAGC,GACvB,MAAMm5B,EAAIqkC,EAAMz2C,KACVgvC,EAAM,CAACS,EAAGz2D,IACVA,IAAM,IAAOA,IAAM,IAAQy2D,EAAE9oC,OAAOyL,GAA2Bq9B,EAAEyJ,SAASlgE,GAAjCy2D,EAAE2J,eAAepgE,GAC1D6yD,EAAMmD,EAAI32E,KAAM2gB,GAAG3D,IAAI25D,EAAIa,EAAG52D,IACpC,OAAO4yD,EAAI2C,WAAQj3E,EAAYs0E,CACnC,CAIA,QAAAgM,CAASlB,GACL,OAAOD,EAAar+E,KAAMs+E,EAC9B,CACA,aAAA4C,GACI,MAAQprE,EAAG+nE,EAAQ,cAAEqD,GAAkB3D,EACvC,GAAIM,IAAa,GACb,OAAO,EACX,GAAIqD,EACA,OAAOA,EAAc9C,EAAOp+E,MAChC,MAAM,IAAIxB,MAAM,+DACpB,CACA,aAAA2iF,GACI,MAAQrrE,EAAG+nE,EAAQ,cAAEsD,GAAkB5D,EACvC,OAAIM,IAAa,GACN79E,KACPmhF,EACOA,EAAc/C,EAAOp+E,MACzBA,KAAK+gF,eAAexD,EAAMznE,EACrC,CACA,UAAA8rE,CAAWuJ,GAAe,GAGtB,OAFAtY,GAAM,eAAgBsY,GACtBnrF,KAAK+/E,iBACE3oC,EAAQgnC,EAAOp+E,KAAMmrF,EAChC,CACA,KAAA9zC,CAAM8zC,GAAe,GAEjB,OADAtY,GAAM,eAAgBsY,GACf,GAAWnrF,KAAK4hF,WAAWuJ,GACtC,EAEJ/M,EAAMz2C,KAAO,IAAIy2C,EAAMb,EAAM3B,GAAI2B,EAAM1B,GAAI5H,EAAGiC,KAC9CkI,EAAMnI,KAAO,IAAImI,EAAMnK,EAAGgC,KAAMhC,EAAGiC,IAAKjC,EAAGgC,MAC3C,MAAMmV,EAAQ7N,EAAM/H,WACdsK,EAAO1F,GAAKgE,EAAOb,EAAM4L,KAAOlgF,KAAK01B,KAAKysD,EAAQ,GAAKA,GAE7D,MAAO,CACH7N,QACAqL,gBAAiBxK,EACjByK,yBACAC,sBACAC,mBApZJ,SAA4Bv8C,GACxB,OAAO,GAAQA,EAAK,GAAK+wC,EAAM/pE,EACnC,EAoZJ,CAgCyG63E,CAAkB,IAChH9N,EACH,OAAAnmC,CAAQmyC,EAAItH,EAAOkJ,GACf,MAAMxqE,EAAIshE,EAAMzC,WACVrqE,EAAI8+D,EAAG78B,QAAQz2B,EAAExL,GACjBm2E,EAAM,GAEZ,OADAzY,GAAM,eAAgBsY,GAClBA,EACOG,EAAIr7E,WAAWsO,KAAK,CAAC0jE,EAAM+H,WAAa,EAAO,IAAQ70E,GAGvDm2E,EAAIr7E,WAAWsO,KAAK,CAAC,IAAQpJ,EAAG8+D,EAAG78B,QAAQz2B,EAAEmsD,GAE5D,EACA,SAAA0L,CAAU1pE,GACN,MAAM1M,EAAM0M,EAAMrN,OACZggB,EAAO3S,EAAM,GACb4S,EAAO5S,EAAMmT,SAAS,GAE5B,GAAI7f,IAAQqmF,GAA2B,IAAThnE,GAA0B,IAATA,EAoB1C,IAAIrf,IAAQsmF,GAA4B,IAATjnE,EAGhC,MAAO,CAAEtM,EAFC8+D,EAAGuE,UAAU92D,EAAKO,SAAS,EAAGgyD,EAAG6B,QAE/BhJ,EADFmH,EAAGuE,UAAU92D,EAAKO,SAASgyD,EAAG6B,MAAO,EAAI7B,EAAG6B,SAMtD,MAAM,IAAIt3E,MAAM,qCAFLiqF,EAEiD,qBADjDC,EAC6E,SAAWtmF,EACvG,CA7B+D,CAC3D,MAAM+S,EAAI,GAAgBuM,GAC1B,IAAK,GAAQvM,EAAG,GAAK8+D,EAAG0B,OACpB,MAAM,IAAIn3E,MAAM,yBACpB,MAAM8iF,EAAKwH,EAAoB3zE,GAC/B,IAAI23D,EACJ,IACIA,EAAImH,EAAGkD,KAAKmK,EAChB,CACA,MAAOiK,GACH,MAAMC,EAASD,aAAqB/sF,MAAQ,KAAO+sF,EAAU/+E,QAAU,GACvE,MAAM,IAAIhO,MAAM,wBAA0BgtF,EAC9C,CAMA,QAHiC,GAAd/pE,MAFHqrD,EAAI,MAAS,MAIzBA,EAAImH,EAAGoC,IAAIvJ,IACR,CAAE33D,IAAG23D,IAChB,CAWJ,IAEE2e,EAAiBj/C,GAAQ,GAAW,GAAgBA,EAAK+wC,EAAM7H,cACrE,SAASgW,EAAsBxf,GAE3B,OAAOA,EADM4U,GAAe,EAEhC,CAKA,MAAM6K,EAAS,CAAC/qE,EAAGrC,EAAM66B,IAAO,GAAgBx4B,EAAE1f,MAAMqd,EAAM66B,IAI9D,MAAMwyC,EACF,WAAAt8E,CAAYkrB,EAAGz3B,EAAG8oF,GACd,GAAS,IAAKrxD,EAAG,GAAKsmD,GACtB,GAAS,IAAK/9E,EAAG,GAAK+9E,GACtB9gF,KAAKw6B,EAAIA,EACTx6B,KAAK+C,EAAIA,EACO,MAAZ8oF,IACA7rF,KAAK6rF,SAAWA,GACpBltF,OAAOmd,OAAO9b,KAClB,CAEA,kBAAO8rF,CAAYp2E,GACf,MAAMlU,EAAI+7E,EAAM7H,YAEhB,OADAhgE,EAAM,GAAY,mBAAoBA,EAAS,EAAJlU,GACpC,IAAIoqF,EAAUD,EAAOj2E,EAAK,EAAGlU,GAAImqF,EAAOj2E,EAAKlU,EAAG,EAAIA,GAC/D,CAGA,cAAOuqF,CAAQr2E,GACX,MAAM,EAAE8kB,EAAC,EAAEz3B,GAAMskF,GAAIO,MAAM,GAAY,MAAOlyE,IAC9C,OAAO,IAAIk2E,EAAUpxD,EAAGz3B,EAC5B,CAKA,cAAAg9E,GAAmB,CACnB,cAAAiM,CAAeH,GACX,OAAO,IAAID,EAAU5rF,KAAKw6B,EAAGx6B,KAAK+C,EAAG8oF,EACzC,CACA,gBAAAI,CAAiBC,GACb,MAAM,EAAE1xD,EAAC,EAAKqxD,SAAUM,GAAQnsF,KAC1B8V,EAAI0yE,EAAc,GAAY,UAAW0D,IAC/C,GAAW,MAAPC,IAAgB,CAAC,EAAG,EAAG,EAAG,GAAGnhE,SAASmhE,GACtC,MAAM,IAAI3tF,MAAM,uBACpB,MAAM4tF,EAAe,IAARD,GAAqB,IAARA,EAAY3xD,EAAI+iD,EAAM/pE,EAAIgnB,EACpD,GAAI4xD,GAAQnY,EAAG0B,MACX,MAAM,IAAIn3E,MAAM,8BACpB,MAAMkB,EAAgB,EAANysF,EAAwB,KAAP,KAC3B5J,EAAInE,EAAM9mC,QAAQ53C,EAAS+rF,EAAcW,IACzCC,EAAK1D,EAAKyD,GACVE,EAAKzK,GAAM/rE,EAAIu2E,GACfE,EAAK1K,EAAK9+E,EAAIspF,GACd7U,EAAI4G,EAAMz2C,KAAKujD,qBAAqB3I,EAAG+J,EAAIC,GACjD,IAAK/U,EACD,MAAM,IAAIh5E,MAAM,qBAEpB,OADAg5E,EAAEuI,iBACKvI,CACX,CAEA,QAAAgV,GACI,OAAOd,EAAsB1rF,KAAK+C,EACtC,CACA,UAAA0pF,GACI,OAAOzsF,KAAKwsF,WAAa,IAAIZ,EAAU5rF,KAAKw6B,EAAGqnD,GAAM7hF,KAAK+C,GAAI/C,KAAK6rF,UAAY7rF,IACnF,CAEA,aAAA0sF,GACI,OAAO,GAAW1sF,KAAK2sF,WAC3B,CACA,QAAAA,GACI,OAAOtF,GAAIe,WAAW,CAAE5tD,EAAGx6B,KAAKw6B,EAAGz3B,EAAG/C,KAAK+C,GAC/C,CAEA,iBAAA6pF,GACI,OAAO,GAAW5sF,KAAK6sF,eAC3B,CACA,YAAAA,GACI,OAAOpB,EAAczrF,KAAKw6B,GAAKixD,EAAczrF,KAAK+C,EACtD,EAEJ,MAAM2/E,EAAQ,CACV,iBAAAoK,CAAkBpf,GACd,IAEI,OADAmb,EAAuBnb,IAChB,CACX,CACA,MAAOlmD,GACH,OAAO,CACX,CACJ,EACAqhE,uBAAwBA,EAKxBlG,iBAAkB,KACd,MAAMlhF,EAASm3E,GAAiB2E,EAAM/pE,GACtC,OhB3XL,SAAwBzU,EAAK25E,EAAYvgC,GAAO,GACnD,MAAM/1C,EAAMrD,EAAI0C,OACVyhF,EAAWzK,GAAoBC,GAC/BqU,EAASnU,GAAiBF,GAEhC,GAAIt2E,EAAM,IAAMA,EAAM2qF,GAAU3qF,EAAM,KAClC,MAAM,IAAI5D,MAAM,YAAcuuF,EAAS,6BAA+B3qF,GAC1E,MAEM4qF,EAAU,GAFJ70C,EAAO,GAAgBp5C,GAAO,GAAgBA,GAEjC25E,EAAa,IAAO,GAC7C,OAAOvgC,EAAO,GAAgB60C,EAAS9J,GAAY,GAAgB8J,EAAS9J,EAChF,CgBgXmB+J,CAAe1P,EAAMxlC,YAAYt2C,GAAS87E,EAAM/pE,EAAE,EAU7DovE,WAAU,CAACtJ,EAAa,EAAG2I,EAAQ7D,EAAMz2C,QACrCs6C,EAAMpC,eAAevG,GACrB2I,EAAMpB,SAAS56C,OAAO,IACfg8C,IAef,SAASiL,EAAU1nC,GACf,MAAMxO,EAAM,GAAQwO,GACdz/C,EAAsB,iBAATy/C,EACbpjD,GAAO40C,GAAOjxC,IAAQy/C,EAAK/jD,OACjC,OAAIu1C,EACO50C,IAAQqmF,GAAiBrmF,IAAQsmF,EACxC3iF,EACO3D,IAAQ,EAAIqmF,GAAiBrmF,IAAQ,EAAIsmF,EAChDljC,aAAgB44B,CAGxB,CAuBA,MAAMmK,EAAWhL,EAAMgL,UACnB,SAAUz5E,GAEN,GAAIA,EAAMrN,OAAS,KACf,MAAM,IAAIjD,MAAM,sBAGpB,MAAMguC,EAAM,GAAgB19B,GACtBq+E,EAAuB,EAAfr+E,EAAMrN,OAAa87E,EAAM/H,WACvC,OAAO2X,EAAQ,EAAI3gD,GAAOvG,OAAOknD,GAAS3gD,CAC9C,EACEg8C,EAAgBjL,EAAMiL,eACxB,SAAU15E,GACN,OAAO+yE,EAAK0G,EAASz5E,GACzB,EAEEs+E,EAAa,GAAQ7P,EAAM/H,YAIjC,SAAS6X,EAAW7gD,GAGhB,OAFA,GAAS,WAAa+wC,EAAM/H,WAAYhpC,EAAK,GAAK4gD,GAE3C,GAAgB5gD,EAAK+wC,EAAM7H,YACtC,CA0DA,MAAM4X,EAAiB,CAAEnG,KAAM5J,EAAM4J,KAAMxJ,SAAS,GAC9C4P,EAAiB,CAAEpG,KAAM5J,EAAM4J,KAAMxJ,SAAS,GAiGpD,OA5EAS,EAAMz2C,KAAKk4C,eAAe,GA4EnB,CACHtC,QACA+E,aA9NJ,SAAsB5U,EAAYyd,GAAe,GAC7C,OAAO/M,EAAMqD,eAAe/T,GAAYkU,WAAWuJ,EACvD,EA6NIpG,gBAnMJ,SAAyByI,EAAUC,EAAStC,GAAe,GACvD,GAAI+B,EAAUM,GACV,MAAM,IAAIhvF,MAAM,iCACpB,IAAK0uF,EAAUO,GACX,MAAM,IAAIjvF,MAAM,iCAEpB,OADU4/E,EAAM9mC,QAAQm2C,GACf5M,SAASgI,EAAuB2E,IAAW5L,WAAWuJ,EACnE,EA6LI7sE,KAvFJ,SAAc4tE,EAASxK,EAAS5kD,EAAOwwD,GACnC,MAAM,KAAEI,EAAI,MAAEC,GApElB,SAAiBzB,EAASxe,EAAY5wC,EAAOwwD,GACzC,GAAI,CAAC,YAAa,aAAatyB,MAAMtiC,GAAMA,KAAKoE,IAC5C,MAAM,IAAIt+B,MAAM,uCACpB,MAAM,KAAE4O,EAAI,YAAE2qC,GAAgBwlC,EAC9B,IAAI,KAAE4J,EAAI,QAAExJ,EAASiQ,aAAcC,GAAQ/wD,EAC/B,MAARqqD,IACAA,GAAO,GACX+E,EAAU,GAAY,UAAWA,GACjChF,GAAmBpqD,GACf6gD,IACAuO,EAAU,GAAY,oBAAqB9+E,EAAK8+E,KAIpD,MAAM4B,EAAQtF,EAAc0D,GACtBzvE,EAAIosE,EAAuBnb,GAC3BqgB,EAAW,CAACV,EAAW5wE,GAAI4wE,EAAWS,IAE5C,GAAW,MAAPD,IAAuB,IAARA,EAAe,CAE9B,MAAM5pE,GAAY,IAAR4pE,EAAe91C,EAAYk8B,EAAG6B,OAAS+X,EACjDE,EAASvtF,KAAK,GAAY,eAAgByjB,GAC9C,CACA,MAAMypE,EAAO,MAAeK,GACtB32D,EAAI02D,EA0BV,MAAO,CAAEJ,OAAMC,MAxBf,SAAeK,GAEX,MAAMt1D,EAAI6vD,EAASyF,GACnB,IAAKjF,EAAmBrwD,GACpB,OACJ,MAAMu1D,EAAKtF,EAAKjwD,GACV8J,EAAI47C,EAAMz2C,KAAKk5C,SAASnoD,GAAG8mD,WAC3BhlD,EAAIqnD,EAAKr/C,EAAErtB,GACjB,GAAIqlB,IAAM,GACN,OAIJ,MAAMz3B,EAAI8+E,EAAKoM,EAAKpM,EAAKzqD,EAAIoD,EAAI/d,IACjC,GAAI1Z,IAAM,GACN,OACJ,IAAI8oF,GAAYrpD,EAAErtB,IAAMqlB,EAAI,EAAI,GAAKjwB,OAAOi4B,EAAEsqC,EAAI,IAC9CohB,EAAQnrF,EAKZ,OAJIokF,GAAQuE,EAAsB3oF,KAC9BmrF,EAzOZ,SAAoBnrF,GAChB,OAAO2oF,EAAsB3oF,GAAK8+E,GAAM9+E,GAAKA,CACjD,CAuOoB0pF,CAAW1pF,GACnB8oF,GAAY,GAET,IAAID,EAAUpxD,EAAG0zD,EAAOrC,EACnC,EAEJ,CAiB4BsC,CAAQjC,EAASxK,EAAS5kD,GAC5C6c,EAAI4jC,EACJ6Q,EjB/uBP,SAAwBC,EAASC,EAAUC,GAC9C,GAAuB,iBAAZF,GAAwBA,EAAU,EACzC,MAAM,IAAI7vF,MAAM,4BACpB,GAAwB,iBAAb8vF,GAAyBA,EAAW,EAC3C,MAAM,IAAI9vF,MAAM,6BACpB,GAAsB,mBAAX+vF,EACP,MAAM,IAAI/vF,MAAM,6BAEpB,IAAIa,EAAIq0E,GAAI2a,GACR31D,EAAIg7C,GAAI2a,GACR9sF,EAAI,EACR,MAAMgT,EAAQ,KACVlV,EAAEq5C,KAAK,GACPhgB,EAAEggB,KAAK,GACPn3C,EAAI,CAAC,EAEHuU,EAAI,IAAI8K,IAAM2tE,EAAO71D,EAAGr5B,KAAMuhB,GAC9B4tE,EAAS,CAACd,EAAOha,GAAI,MAEvBh7C,EAAI5iB,EAAE69D,GAAK,CAAC,IAAQ+Z,GACpBruF,EAAIyW,IACgB,IAAhB43E,EAAKjsF,SAETi3B,EAAI5iB,EAAE69D,GAAK,CAAC,IAAQ+Z,GACpBruF,EAAIyW,IAAG,EAELnS,EAAM,KAER,GAAIpC,KAAO,IACP,MAAM,IAAI/C,MAAM,2BACpB,IAAI4D,EAAM,EACV,MAAMynC,EAAM,GACZ,KAAOznC,EAAMksF,GAAU,CACnBjvF,EAAIyW,IACJ,MAAM24E,EAAKpvF,EAAE6B,QACb2oC,EAAIrpC,KAAKiuF,GACTrsF,GAAO/C,EAAEoC,MACb,CACA,OAAO,MAAeooC,EAAI,EAW9B,MATiB,CAAC6jD,EAAMgB,KAGpB,IAAI9oD,EACJ,IAHArxB,IACAi6E,EAAOd,KAEE9nD,EAAM8oD,EAAK/qF,OAChB6qF,IAEJ,OADAj6E,IACOqxB,CAAG,CAGlB,CiB6rBqB+oD,CAAeh1C,EAAEvsC,KAAKopC,UAAWmD,EAAE+7B,YAAa/7B,EAAEstC,MAC/D,OAAOmH,EAAKV,EAAMC,EACtB,EAmFInuE,OAlEJ,SAAgBmuD,EAAWue,EAASvf,EAAW7vC,EAAOywD,GAClD,MAAMqB,EAAKjhB,EACXue,EAAU,GAAY,UAAWA,GACjCvf,EAAY,GAAY,YAAaA,GACrC,MAAM,KAAEwa,EAAI,QAAExJ,EAAO,OAAE7yE,GAAWgyB,EAGlC,GADAoqD,GAAmBpqD,GACf,WAAYA,EACZ,MAAM,IAAIt+B,MAAM,sCACpB,QAAeU,IAAX4L,GAAmC,YAAXA,GAAmC,QAAXA,EAChD,MAAM,IAAItM,MAAM,iCACpB,MAAMqwF,EAAsB,iBAAPD,GAAmB,GAAQA,GAC1CE,GAASD,IACV/jF,GACa,iBAAP8jF,GACA,OAAPA,GACgB,iBAATA,EAAGp0D,GACM,iBAATo0D,EAAG7rF,EACd,IAAK8rF,IAAUC,EACX,MAAM,IAAItwF,MAAM,4EACpB,IAAIuwF,EACA3X,EACJ,IAGI,GAFI0X,IACAC,EAAO,IAAInD,EAAUgD,EAAGp0D,EAAGo0D,EAAG7rF,IAC9B8rF,EAAO,CAGP,IACmB,YAAX/jF,IACAikF,EAAOnD,EAAUG,QAAQ6C,GACjC,CACA,MAAOI,GACH,KAAMA,aAAoB3H,GAAIC,KAC1B,MAAM0H,CACd,CACKD,GAAmB,QAAXjkF,IACTikF,EAAOnD,EAAUE,YAAY8C,GACrC,CACAxX,EAAIgH,EAAM9mC,QAAQq1B,EACtB,CACA,MAAOnlD,GACH,OAAO,CACX,CACA,IAAKunE,EACD,OAAO,EACX,GAAI5H,GAAQ4H,EAAKvC,WACb,OAAO,EACP7O,IACAuO,EAAU3O,EAAMnwE,KAAK8+E,IACzB,MAAM,EAAE1xD,EAAC,EAAEz3B,GAAMgsF,EACXj5E,EAAI0yE,EAAc0D,GAClB+C,EAAKtG,EAAK5lF,GACVupF,EAAKzK,EAAK/rE,EAAIm5E,GACd1C,EAAK1K,EAAKrnD,EAAIy0D,GACd1M,EAAInE,EAAMz2C,KAAKujD,qBAAqB9T,EAAGkV,EAAIC,IAAK/M,WACtD,QAAK+C,GAEKV,EAAKU,EAAEptE,KACJqlB,CACjB,EAOIouD,gBAAiBxK,EACjBwN,YACAlJ,QAER,CC1iCO,SAASwM,GAAQ9hF,GACpB,MAAO,CACHA,OACA65E,KAAM,CAACloF,KAAQqjF,IAAS6E,GAAK75E,EAAMrO,E3GiJpC,YAAwB2/C,GAC3B,IAAI80B,EAAM,EACV,IAAK,IAAIjyE,EAAI,EAAGA,EAAIm9C,EAAOj9C,OAAQF,IAAK,CACpC,MAAMof,EAAI+9B,EAAOn9C,GACjB,GAAOof,GACP6yD,GAAO7yD,EAAElf,MACb,CACA,MAAMmkC,EAAM,IAAI31B,WAAWujE,GAC3B,IAAK,IAAIjyE,EAAI,EAAGqoC,EAAM,EAAGroC,EAAIm9C,EAAOj9C,OAAQF,IAAK,CAC7C,MAAMof,EAAI+9B,EAAOn9C,GACjBqkC,EAAItmC,IAAIqhB,EAAGipB,GACXA,GAAOjpB,EAAElf,MACb,CACA,OAAOmkC,CACX,C2G/JgD,IAAew8C,IACvDrqC,YAAW,GAEnB,CDsLgF9R,OAAO,GEjLvF,MAAMkpD,GAAalpD,OAAO,sEACpBmpD,GAAanpD,OAAO,sEACpB,GAAMA,OAAO,GACb,GAAMA,OAAO,GACbopD,GAAa,CAAC1uE,EAAGC,KAAOD,EAAIC,EAAI,IAAOA,EA6B7C,MAAM0uE,GAAO,GAAMH,QAAYjwF,OAAWA,EAAW,CAAEi4E,KAxBvD,SAAiBrK,GACb,MAAMsK,EAAI+X,GAEJta,EAAM5uC,OAAO,GAAIspD,EAAMtpD,OAAO,GAAIupD,EAAOvpD,OAAO,IAAKwpD,EAAOxpD,OAAO,IAEnEypD,EAAOzpD,OAAO,IAAK0pD,EAAO1pD,OAAO,IAAK2pD,EAAO3pD,OAAO,IACpDtvB,EAAMm2D,EAAIA,EAAIA,EAAKsK,EACnBxgE,EAAMD,EAAKA,EAAKm2D,EAAKsK,EACrBrgE,EAAMo+D,GAAKv+D,EAAIi+D,EAAKuC,GAAKxgE,EAAMwgE,EAC/BlgE,EAAMi+D,GAAKp+D,EAAI89D,EAAKuC,GAAKxgE,EAAMwgE,EAC/BhgE,EAAO+9D,GAAKj+D,EAAI,GAAKkgE,GAAKzgE,EAAMygE,EAChCr/D,EAAOo9D,GAAK/9D,EAAKo4E,EAAMpY,GAAKhgE,EAAOggE,EACnC/9D,EAAO87D,GAAKp9D,EAAK03E,EAAMrY,GAAKr/D,EAAOq/D,EACnCyY,EAAO1a,GAAK97D,EAAKs2E,EAAMvY,GAAK/9D,EAAO+9D,EACnC0Y,EAAQ3a,GAAK0a,EAAKD,EAAMxY,GAAKyY,EAAOzY,EACpC2Y,EAAQ5a,GAAK2a,EAAMH,EAAMvY,GAAK/9D,EAAO+9D,EACrC4Y,EAAQ7a,GAAK4a,EAAMlb,EAAKuC,GAAKxgE,EAAMwgE,EACnCgT,EAAMjV,GAAK6a,EAAMN,EAAMtY,GAAKr/D,EAAOq/D,EACnCS,EAAM1C,GAAKiV,EAAImF,EAAKnY,GAAKzgE,EAAMygE,EAC/BpmE,EAAOmkE,GAAK0C,EAAI,GAAKT,GAC3B,IAAKkY,GAAKhZ,IAAIgZ,GAAK7Y,IAAIzlE,GAAO87D,GAC1B,MAAM,IAAItuE,MAAM,2BACpB,OAAOwS,CACX,IAiBai/E,GDrDN,SAAqB3S,EAAU4S,GAClC,MAAMtxF,EAAUwO,GAASk7E,GAAY,IAAKhL,KAAa4R,GAAQ9hF,KAC/D,MAAO,IAAKxO,EAAOsxF,GAAUtxF,SACjC,CCkDyBuxF,CAAY,CACjCxvE,EAAGslB,OAAO,GACVrlB,EAAGqlB,OAAO,GACVguC,GAAIqb,GACJ97E,EAAG47E,GACHxT,GAAI31C,OAAO,iFACX41C,GAAI51C,OAAO,iFACXnwB,EAAGmwB,OAAO,GACVkhD,MAAM,EACNgC,KAAM,CAEFC,KAAMnjD,OAAO,sEACbojD,YAAc3wD,IACV,MAAMllB,EAAI47E,GACJttF,EAAKmkC,OAAO,sCACZvvB,GAAM,GAAMuvB,OAAO,sCACnBlkC,EAAKkkC,OAAO,uCACZtvB,EAAK7U,EACLsuF,EAAYnqD,OAAO,uCACnBjwB,EAAKq5E,GAAW14E,EAAK+hB,EAAGllB,GACxByC,EAAKo5E,IAAY34E,EAAKgiB,EAAGllB,GAC/B,IAAIk3E,EAAK,GAAIhyD,EAAI1iB,EAAKlU,EAAKmU,EAAKlU,EAAIyR,GAChCo3E,EAAK,IAAK50E,EAAKU,EAAKT,EAAKU,EAAInD,GACjC,MAAMi3E,EAAQC,EAAK0F,EACbzF,EAAQC,EAAKwF,EAKnB,GAJI3F,IACAC,EAAKl3E,EAAIk3E,GACTC,IACAC,EAAKp3E,EAAIo3E,GACTF,EAAK0F,GAAaxF,EAAKwF,EACvB,MAAM,IAAI5xF,MAAM,uCAAyCk6B,GAE7D,MAAO,CAAE+xD,QAAOC,KAAIC,QAAOC,KAAI,IAGxC,IC7FI,SAASyF,GAAUjvC,GACtB,OAAa,MAATA,GAGyB,mBAAfA,EAAM7d,MACO,mBAAhB6d,EAAM9d,OACY,mBAAlB8d,EAAMkvC,OACrB,CDyFYrqD,OAAO,GAiBLgqD,GAAUrH,gBErHjB,MAAM2H,GACTprF,KAAO,YACPunE,IACAoa,KACA,WAAAx3E,CAAYvQ,GACRiB,KAAK8mF,KCoBN,SAAoC/nF,GACvC,IAEI,OADA,GAAK6pF,gBAAgBtxC,QAAQv4C,GACtBA,CACX,CACA,MAAO0nB,GACH,MAAM,IAAIyjD,GAAsBl7D,OAAOyX,GAC3C,CACJ,CD5BoB+pE,CAA2BzxF,GACvCiB,KAAK0sE,ICEN,SAAoC3tE,GAEvC,OADc,GAAK6pF,gBAAgBtxC,QAAQv4C,GAAK6iF,YAAW,EAE/D,CDLmB6O,CAA2BzwF,KAAK8mF,KAC/C,CACA,WAAA/Z,GACI,OAAO,GAASl3D,OAAOm3D,GAAoBhtE,MAC/C,CACA,KAAAitE,GACI,OAAOn/B,GAAIO,SAAS,IAAKruC,KAAK+sE,cAClC,CACA,QAAA1mE,GACI,OAAOklC,GAAUr2B,OAAOlV,KAAK+sE,cAAcj+D,OAAOrH,UAAU,EAChE,CACA,MAAA6mC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,MAAAltD,CAAOmqB,EAAMujC,GACT,OEFD,SAAuBnuE,EAAKmuE,EAAKv1B,GACpC,MAAMjZ,EAAI,GAAO7oB,OAAO8hC,aAAe1nC,WAAa0nC,EAAMA,EAAI11B,YAC9D,GAAIouE,GAAU3xD,GACV,OAAOA,EAAE6E,MAAK,EAAG1tB,YAAa,GAAK2J,OAAO0tD,EAAKr3D,EAAQ9W,KAClDukC,OAAM7c,IACP,MAAM,IAAIo/D,GAAkB72E,OAAOyX,GAAK,IAGhD,IACI,OAAO,GAAKjH,OAAO0tD,EAAKxuC,EAAE7oB,OAAQ9W,EACtC,CACA,MAAO0nB,GACH,MAAM,IAAIo/D,GAAkB72E,OAAOyX,GACvC,CACJ,CFZe,CAAczmB,KAAK8mF,KAAM5Z,EAAKvjC,EACzC,EAEG,MAAM+mD,GACTvrF,KAAO,YACPunE,IACAC,UACA,WAAAr9D,CAAYvQ,EAAK4tE,GACb3sE,KAAK0sE,IChBN,SAAqC3tE,GACxC,IAEI,OADA,GAAKujF,aAAavjF,GAAK,GAChBA,CACX,CACA,MAAO0nB,GACH,MAAM,IAAI0jD,GAAuBn7D,OAAOyX,GAC5C,CACJ,CDQmBkqE,CAA4B5xF,GACvCiB,KAAK2sE,UAAY,IAAI4jB,GAAmB5jB,GCCzC,SAAmCe,GACtC,IACI,OAAO,GAAK4U,aAAa5U,GAAY,EACzC,CACA,MAAOjnD,GACH,MAAM,IAAI0jD,GAAuBn7D,OAAOyX,GAC5C,CACJ,CDR6DmqE,CAA0B7xF,GACnF,CACA,MAAAuvC,CAAOvvC,GACH,OAAW,MAAPA,GAAiBA,EAAI2tE,eAAez8D,YAGjC,GAAiBjQ,KAAK0sE,IAAK3tE,EAAI2tE,IAC1C,CACA,IAAApuD,CAAK9R,GACD,OEtCD,SAAqBzN,EAAK44C,GAC7B,MAAMjZ,EAAI,GAAO7oB,OAAO8hC,aAAe1nC,WAAa0nC,EAAMA,EAAI11B,YAC9D,GAAIouE,GAAU3xD,GACV,OAAOA,EAAE6E,MAAK,EAAG1tB,YAAa,GAAKyI,KAAKzI,EAAQ9W,GAAK2tF,kBAChDppD,OAAM7c,IACP,MAAM,IAAIm/D,GAAa52E,OAAOyX,GAAK,IAG3C,IACI,OAAO,GAAKnI,KAAKogB,EAAE7oB,OAAQ9W,GAAK2tF,eACpC,CACA,MAAOjmE,GACH,MAAM,IAAIm/D,GAAa52E,OAAOyX,GAClC,CACJ,CFwBe,CAAYzmB,KAAK0sE,IAAKlgE,EACjC,EC1CG,SAASqkF,GAA4B/hF,GACxC,OAAO,IAAIyhF,GAAwBzhF,EACvC,CEaOq+B,eAAe2jD,GAAgB3rF,EAAM8N,GACxC,GAAa,YAAT9N,EACA,OhBLDgoC,iBACH,MAAM,WAAEugC,EAAU,UAAEf,GFfjB,WAEH,MAAMuY,EAAgB,GAAGxC,MAAMC,mBACzBhW,EAAY,GAAG2V,aAAa4C,GAGlC,MAAO,CACHxX,WAFeuX,GAAWC,EAAevY,GAGzCA,YAER,CEKsC,GAClC,OAAO,IAAI0Y,GAAuB3X,EAAYf,EAClD,CgBEeokB,GAEX,GAAa,cAAT5rF,EACA,OFjBDgoC,iBACH,MAAM6jD,EAsCC,GAAKtO,MAAMC,mBArClB,OAAO,IAAI+N,GAAyBM,EACxC,CEceC,GAEX,GAAa,QAAT9rF,EACA,OTgHDgoC,eAAkCl6B,GACrC,GAAIA,EAvIwB,KAwIxB,MAAM,IAAI,GAAuB,yBAErC,MAAM/N,QD5IHioC,eAA8Bl6B,GACjC,MAAMi+E,QAAa/K,GAAU/mF,MAAMiuC,OAAO8jD,YAAY,CAClDpwF,KAAM,oBACNqwF,cAAen+E,EACfo+E,eAAgB,IAAIphF,WAAW,CAAC,EAAM,EAAM,IAC5C7C,KAAM,CAAErM,KAAM,aACf,EAAM,CAAC,OAAQ,WACZmE,QAsBVioC,eAAyB+jD,GACrB,GAAuB,MAAnBA,EAAKxjB,YAAwC,MAAlBwjB,EAAKvkB,UAChC,MAAM,IAAI,GAAuB,uCAErC,OAAOpwC,QAAQgpB,IAAI,CACf4gC,GAAU/mF,MAAMiuC,OAAOikD,UAAU,MAAOJ,EAAKxjB,YAC7CyY,GAAU/mF,MAAMiuC,OAAOikD,UAAU,MAAOJ,EAAKvkB,YAErD,CA9BuB2kB,CAAUJ,GAC7B,MAAO,CACHxjB,WAAYxoE,EAAK,GACjBynE,UAAWznE,EAAK,GAExB,CCgIuBqsF,CAAet+E,GAK5B4C,EAAS,GA9IG,GA0IL,GAAO,GAAaX,OAAO,CACpC4E,KAAM,GAAW8sE,IACjBjB,KAAMc,GAAUvhF,EAAKynE,eAGzB,OAAO,IAAIyZ,GAAmBlhF,EAAKwoE,WAAY,IAAIuY,GAAkB/gF,EAAKynE,UAAW92D,GACzF,CS3He27E,CA0If,SAAgBv+E,GACZ,OAAY,MAARA,EACO,KAEJuL,SAASvL,EAAM,GAC1B,CA/IkCw+E,CAAOx+E,IAErC,GAAa,UAAT9N,EACA,O5BuHDgoC,eAAoCmhC,EAAQ,SAC/C,MAAMvvE,QCvJHouC,eAAgCmhC,EAAQ,SAC3C,MAAMojB,QAAgBtkD,OAAOC,OAAO8jD,YAAY,CAC5CpwF,KAAM,QACNqsE,WAAYkB,IACb,EAAM,CAAC,OAAQ,WAClB,MAAO,CACH3B,gBAAiBv/B,OAAOC,OAAOikD,UAAU,MAAOI,EAAQ/kB,WACxDe,iBAAkBtgC,OAAOC,OAAOikD,UAAU,MAAOI,EAAQhkB,YAEjE,CD8IsBikB,CAAiBrjB,GACnC,OAAO,IAAIhB,GAAqBvuE,EAAI2uE,WACxC,C4B1HekkB,CA6If,SAAiBtjB,GACb,GAAc,UAAVA,GAA8B,MAATA,EACrB,MAAO,QAEX,GAAc,UAAVA,EACA,MAAO,QAEX,GAAc,UAAVA,EACA,MAAO,QAEX,MAAM,IAAI,GAAuB,qDACrC,CAxJoCujB,CAAQ5+E,IAExC,MAAM,IAAI,EACd,CACOk6B,eAAe2kD,GAAwB3sF,EAAMuoF,GAChD,GAAa,YAATvoF,EACA,MAAM,IAAI,GAAwB,uDAEtC,OhBlBGgoC,eAA8CugD,GACjD,MAAM,WAAEhgB,EAAU,UAAEf,GFLjB,SAA6B+gB,GAChC,GAlBqB,KAkBjBA,EAAKjsF,OACL,MAAM,IAAIrB,UAAU,sCAEnB,KAAMstF,aAAgBz9E,YACvB,MAAM,IAAI7P,UAAU,mDAGxB,MAAM8kF,EAAgBwI,EAChB/gB,EAAY,GAAG2V,aAAa4C,GAElC,MAAO,CACHxX,WAFeuX,GAAWC,EAAevY,GAGzCA,YAER,CEVsC,CAA2B+gB,GAC7D,OAAO,IAAIrI,GAAuB3X,EAAYf,EAClD,CgBeWolB,CAA+BrE,EAC1C,CAUO,SAASsE,GAAsBxiF,EAAKqG,GACvC,MAAM,KAAEiE,EAAI,KAAE6rE,GAAS,GAAa3pE,OAAOxM,GACrCm6B,EAAOg8C,GAAQ,IAAI11E,WACzB,OAAQ6J,GACJ,KAAK,GAAW8sE,IACZ,OTqDL,SAA4B93E,EAAO+G,GACtC,GAAI/G,EAAM0B,YArGW,KAsGjB,MAAM,IAAI05D,GAAsB,yBAKpC,OAAOwc,GAHS,GAAU53E,EAAO,CAC7B5L,OAAQ,IAE8B4L,EAAO+G,EACrD,CS7DmBo8E,CAAmBtoD,EAAM9zB,GACpC,KAAK,GAAWq8E,QACZ,OAAO5M,GAA0B37C,GACrC,KAAK,GAAWsmD,UACZ,OAAOY,GAA4BlnD,GACvC,KAAK,GAAWwoD,MACZ,OAAOhkB,GAAwBxkC,GACnC,QACI,MAAM,IAAI,GAEtB,CA6CO,SAASqjC,GAAoBjuE,GAChC,OAAO,GAAamW,OAAO,CACvB4E,KAAM,GAAW/a,EAAIoG,MACrBwgF,KAAM5mF,EAAI2tE,KAElB,CChGO,MAAM0lB,GAAsB3uD,OAAOmL,IAAI,gCAQjCyjD,GAAsB5uD,OAAOmL,IAAI,gCCRxC,GAAUnL,OAAOmL,IAAI,8BAG3B,MAAM0jD,GACFntF,KACA6nC,UACA2/B,UACAp8D,OACA,WAAAjB,CAAYzD,GACR7L,KAAKmF,KAAO0G,EAAK1G,KACjBnF,KAAKgtC,UAAYnhC,EAAKmhC,UAEtBruC,OAAO0K,eAAerJ,KAAM,SAAU,CAClC0L,YAAY,EACZgY,UAAU,GAElB,CACA,IAAK+f,OAAOqB,eACR,MAAO,UAAU9kC,KAAKqG,aAC1B,CACA,CAACymD,KAAgB,EACjB,QAAAzmD,GAII,OAHmB,MAAfrG,KAAKuQ,SACLvQ,KAAKuQ,OAASg7B,GAAUr2B,OAAOlV,KAAKgtC,UAAUl+B,OAAO5N,MAAM,IAExDlB,KAAKuQ,MAChB,CACA,WAAAw8D,GACI,OAAO/sE,KAAKgtC,SAChB,CAGA,KAAAigC,GACI,OAAOn/B,GAAIO,SA/BK,IA+BqBruC,KAAKgtC,UAC9C,CACA,MAAA3xB,GACI,OAAOrb,KAAKqG,UAChB,CAIA,MAAAioC,CAAO59B,GACH,GAAU,MAANA,EACA,OAAO,EAEX,GAAIA,aAAcT,WACd,OAAO,GAAiBjQ,KAAKgtC,UAAUl+B,MAAO4B,GAE7C,GAAkB,iBAAPA,EACZ,OAAO1Q,KAAKqG,aAAeqK,EAE1B,GAAgC,MAA5BA,GAAIq8D,eAAej+D,MACxB,OAAO,GAAiB9O,KAAKgtC,UAAUl+B,MAAO4B,EAAGq8D,cAAcj+D,OAG/D,MAAM,IAAItQ,MAAM,eAExB,CAaA,CAAC,MACG,MAAO,UAAUwB,KAAKqG,aAC1B,EAEG,MAAMksF,WAAkBD,GAC3BntF,KAAO,MACPwnE,UACA,WAAAr9D,CAAYzD,GACRukC,MAAM,IAAKvkC,EAAM1G,KAAM,QACvBnF,KAAK2sE,UAAY9gE,EAAK8gE,SAC1B,EAEG,MAAM6lB,WAAsBF,GAC/BntF,KAAO,UACPwnE,UACA,WAAAr9D,CAAYzD,GACRukC,MAAM,IAAKvkC,EAAM1G,KAAM,YACvBnF,KAAK2sE,UAAY9gE,EAAK8gE,SAC1B,EAEG,MAAM8lB,WAAwBH,GACjCntF,KAAO,YACPwnE,UACA,WAAAr9D,CAAYzD,GACRukC,MAAM,IAAKvkC,EAAM1G,KAAM,cACvBnF,KAAK2sE,UAAY9gE,EAAK8gE,SAC1B,EAIG,MAAM+lB,GACTvtF,KAAO,MACP6nC,UACA2/B,UACAgmB,IACA,WAAArjF,CAAYqjF,GACR3yF,KAAK2yF,IAAMA,EAAItsF,WACfrG,KAAKgtC,UAAY,GAASn3B,OAAO,GAAqB7V,KAAK2yF,KAC/D,CACA,CAAC,MACG,MAAO,UAAU3yF,KAAK2yF,MAC1B,CACA,CAAC7lC,KAAgB,EACjB,QAAAzmD,GACI,OAAOrG,KAAKitE,QAAQ5mE,UACxB,CACA,WAAA0mE,GACI,OAAO/sE,KAAKgtC,SAChB,CACA,KAAAigC,GACI,OAAOn/B,GAAIO,SArBsB,KAqBqBruC,KAAK+sE,cAC/D,CACA,MAAA1xD,GACI,OAAOrb,KAAKqG,UAChB,CACA,MAAAioC,CAAOC,GACH,OAAa,MAATA,IAGAA,aAAiBt+B,aACjBs+B,EAAQ,GAAmBA,IAExBA,EAAMloC,aAAerG,KAAKqG,WACrC,EChIG,SAASusF,GAAiB7sF,EAAK6qB,GAClC,IAAIoc,EACJ,GAAsB,MAAlBjnC,EAAIc,OAAO,IAAgC,MAAlBd,EAAIc,OAAO,GAGpCmmC,EAAY,GAAczB,GAAUvvB,OAAO,IAAIjW,UAE9C,IAAIA,EAAIwmB,WAAW,gBAAkBxmB,EAAIwmB,WAAW,gBAAkBxmB,EAAIwmB,WAAW,WAAaxmB,EAAIwmB,WAAW,QAElH,OAAOsmE,GAAc/kD,GAAIxoB,MAAMvf,IAG/B,GAAe,MAAX6qB,EACA,MAAM,IAAI,GAAuB,iFAErCoc,EAAY,GAAcpc,EAAQ5U,OAAOjW,GAC7C,CACA,OAAO+sF,GAAoB9lD,EAC/B,CACO,SAAS+lD,GAAoBpmB,GAChC,GAAuB,YAAnBA,EAAUxnE,KACV,OAAO,IAAIqtF,GAAmB,CAC1BxlD,UAAW2/B,EAAUM,QAAQjgC,UAC7B2/B,cAGH,GAAuB,cAAnBA,EAAUxnE,KACf,OAAO,IAAIstF,GAAqB,CAC5BzlD,UAAW2/B,EAAUM,QAAQjgC,UAC7B2/B,cAGH,GAAuB,QAAnBA,EAAUxnE,KACf,OAAO,IAAIotF,GAAe,CACtBvlD,UAAW2/B,EAAUM,QAAQjgC,UAC7B2/B,cAGR,MAAM,IAAI,EACd,CAIO,SAASmmB,GAAoB9lD,GAChC,GAkCJ,SAA2BA,GACvB,OAAOA,EAAUj4B,OAAS,GAAOA,IACrC,CApCQi+E,CAAkBhmD,GAClB,OAAO,IAAIulD,GAAe,CAAEvlD,cAE3B,GA4BT,SAA6BA,GACzB,OAAOA,EAAUj4B,OAAS,GAASA,IACvC,CA9Bak+E,CAAoBjmD,GACzB,IACI,MAAM2/B,EHoBX,SAAgC92D,GACnC,MAAM,KAAEiE,EAAI,KAAE6rE,GAAS,GAAa3pE,OAAOnG,EAAOA,QAC5C8zB,EAAOg8C,GAAQ,IAAI11E,WACzB,OAAQ6J,GACJ,KAAK,GAAWo4E,QACZ,OAAO5M,GAA0B37C,GACrC,KAAK,GAAWsmD,UACZ,OAAOY,GAA4BlnD,GACvC,KAAK,GAAWwoD,MACZ,OAAOhkB,GAAwBxkC,GACnC,QACI,MAAM,IAAI,GAEtB,CGjC8BupD,CAAuBlmD,GACzC,GAAuB,YAAnB2/B,EAAUxnE,KACV,OAAO,IAAIqtF,GAAmB,CAAExlD,YAAW2/B,cAE1C,GAAuB,cAAnBA,EAAUxnE,KACf,OAAO,IAAIstF,GAAqB,CAAEzlD,YAAW2/B,aAErD,CACA,MAAOlmD,GAEH,MAAMksE,EAAM,GAAmB3lD,EAAUn3B,QACzC,OAAO,IAAI68E,GAAe,IAAIS,IAAIR,GACtC,CAEJ,MAAM,IAAI7nB,GAAsB,uCACpC,CACO,SAAS+nB,GAAcrlD,GAC1B,GAAsB,MAAlBA,GAAKR,WAAoC,MAAfQ,EAAID,SAAoC,IAAhBC,EAAID,SApEtC,MAoEwDC,EAAIz4B,MAnE3C,OAmEwEy4B,EAAIz4B,KAC7G,MAAM,IAAI81D,GAAgB,kCAE9B,GAtEqC,OAsEjCr9B,EAAIz4B,KAA2C,CAC/C,MAAM49E,EAAM,GAAmBnlD,EAAIR,UAAUn3B,QAC7C,OAAO,IAAI68E,GAAe,IAAIS,IAAIR,GACtC,CACA,OAAOG,GAAoBtlD,EAAIR,UACnC,CCjGA,MAAM,GAAkBvrC,IACpB,MAAM6/C,EAAe,EAAsB7/C,GACrC8/C,EAAYv8B,EAAYs8B,GAG9B,OAFA,EAAc7/C,EAAQ8/C,GACtB,GAAezyC,MAAQwyC,EAChBC,CAAS,EAEpB,GAAezyC,MAAQ,ECRhB,MAAM,WAAkCtQ,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BAKJ,MAAM,WAA2BvW,MACpCuC,KAAO,qBACPgU,KAAO,qBCnBX,IAAI,IACJ,SAAWitC,GACPA,EAASA,EAAiB,OAAI,GAAK,SACnCA,EAASA,EAAe,KAAI,GAAK,MACpC,CAHD,CAGG,KAAa,GAAW,CAAC,IAC5B,MAAM,GAAkBxyC,IACpB,MAAM/N,EAAS,EAAc+N,GAE7B,OADA,GAAeV,MAAQ,EAAsBrN,GACtCA,CAAM,EAGV,SAAS,GAAO0E,EAAQ8T,GAC3B,MAAMvH,EAAS,IAAIssC,GACnB,IAAIxa,EAAO,GAAS0d,OAChBC,GAAc,EAClB,MAAMC,EAAgBnoC,GAASmoC,eAAiB,GAC1CC,EAAkBpoC,GAASooC,iBAnBJ,EAoBvBC,EAAgBroC,GAASqoC,eAlBJ,QAmB3B,SAAUZ,IACN,KAAOhvC,EAAOlC,WAAa,GAAG,CAC1B,GAAIg0B,IAAS,GAAS0d,OAElB,IAEI,GADAC,EAAaC,EAAc1vC,GACvByvC,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAAIA,EAAaG,EACb,MAAM,IAAI,GAAuB,2BAErC,MAAMC,EAAmBH,EAActzC,MACvC4D,EAAO6sC,QAAQgD,GACU,MAArBtoC,GAASuoC,UACTvoC,EAAQuoC,SAASL,GAErB3d,EAAO,GAASie,IACpB,CACA,MAAOh8B,GACH,GAAIA,aAAe+P,WAAY,CAC3B,GAAI9jB,EAAOlC,WAAa6xC,EACpB,MAAM,IAAI,GAA6B,kCAE3C,KACJ,CACA,MAAM57B,CACV,CAEJ,GAAI+d,IAAS,GAASie,KAAM,CACxB,GAAI/vC,EAAOlC,WAAa2xC,EAEpB,MAEJ,MAAMxY,EAAOj3B,EAAOktC,QAAQ,EAAGuC,GAC/BzvC,EAAO6sC,QAAQ4C,GACQ,MAAnBloC,GAASyoC,QACTzoC,EAAQyoC,OAAO/Y,SAEbA,EACNnF,EAAO,GAAS0d,MACpB,CACJ,CACJ,CACA,OCtEsC,MDsElB/7C,ECtEPs9B,OAAOC,eDuET,kBACH,UAAW,MAAMl0B,KAAOrJ,EACpBuM,EAAOysC,OAAO3vC,SACPkyC,IAEX,GAAIhvC,EAAOlC,WAAa,EACpB,MAAM,IAAI,GAAmB,0BAEpC,CARM,GAUJ,YACH,IAAK,MAAMhB,KAAOrJ,EACduM,EAAOysC,OAAO3vC,SACPkyC,IAEX,GAAIhvC,EAAOlC,WAAa,EACpB,MAAM,IAAI,GAAmB,0BAEpC,CARM,EASX,CAxEA,GAAe1B,MAAQ,EAyEvB,GAAO+zC,WAAa,CAACvjC,EAAQrF,KACzB,IAAIzJ,EAAa,EA4BjB,OAAO,GA3BgB28B,kBACnB,OACI,IACI,MAAM,KAAEnK,EAAI,MAAEhkC,SAAgBsgB,EAAOjX,KAAKmI,GAC1C,IAAa,IAATwyB,EACA,OAES,MAAThkC,UACMA,EAEd,CACA,MAAOynB,GACH,GAAiB,mBAAbA,EAAI1R,KACJ,MAAO,CAAEiuB,MAAM,EAAMhkC,MAAO,MAEhC,MAAMynB,CACV,CACA,QAEIjW,EAAa,CACjB,CAER,CAtBsB,GA2BO,IACrByJ,GAAW,CAAC,EAChBuoC,SAHchhD,IAAQgP,EAAahP,CAAC,GAItC,EE7FN,MAAM,GACFyjD,SACAC,SACAxB,MACAyB,WACA,WAAA71C,GACItP,KAAK0jD,OAAQ,EACb1jD,KAAKilD,SAAW,KAChBjlD,KAAKklD,SAAW,IACpB,CACA,CAACzhB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKmlD,kBAECnlD,KAAKklD,SAAStC,QAED,MAAnB5iD,KAAKmlD,WACL,MAAM,IAAI3mD,MAAM,0DAEpB,MAAM2mD,EAAanlD,KAAKmlD,WAKxB,OAJAnlD,KAAKmlD,gBAAajmD,EAElBc,KAAKilD,SAAS/gD,UACdlE,KAAKilD,SAAW,KACTE,CACX,CACA,WAAM,CAAM1+B,GAYR,OAXAzmB,KAAK0jD,OAAQ,EACF,MAAPj9B,IAGAzmB,KAAKklD,SAAStC,QAAQtf,OAAM,SAC5BtjC,KAAKklD,SAAS1oB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAarwC,EAElB9U,KAAKklD,SAAShhD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAKikD,MAAMx9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAK0jD,MACtB,MAAM,IAAIllD,MAAM,4CAGpB,KAA0B,MAAnBwB,KAAKmlD,kBACFnlD,KAAKilD,SAASrC,QAEX,MAAT5jD,EACAgB,KAAKmlD,WAAa,CAAEniB,MAAM,EAAOhkC,UAGjCgB,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAa,CAAEniB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAKklD,SAAShhD,UACdlE,KAAKklD,SAAW,WAGVP,GAAW3kD,KAAKilD,SAASrC,QAAS3oC,GAASmqC,OAAQnqC,EAC7D,EClHG,MAAM,WAA2Bzb,MACpCuC,KAAO,qBACPgU,KAAO,qBCuBJ,MAAM,WAAkBvW,MAC3BuW,KACA,WAAAzF,CAAY9C,EAASuI,GACjBq7B,MAAM5jC,GACNxM,KAAK+U,KAAOA,CAChB,EAKG,MAAM,WAAmB,GAC5B5P,KACA,WAAAmK,CAAY9C,GACR4jC,MAAM5jC,EAAS,aACfxM,KAAKmF,KAAO,UACZnF,KAAKe,KAAO,YAChB,EAEG,SAASqyF,GAAWttC,EAAQhpB,GAC/B,MAAMptB,EFyEC,IAAI,GExEXo2C,EAAOG,KAAKv2C,GAAO4zB,OAAM6J,MAAO1mB,UACtB/W,EAAMzI,IAAIwf,EAAI,IAExBq/B,EAAOG,KAAO9Y,MAAOhnC,IACjB,UAAW,MAAMqJ,KAAOrJ,QACduJ,EAAMlP,KAAKgP,SAEfE,EAAMzI,KAAK,EAErB,IAAId,EAAS2/C,EAAO3/C,OACkB,MAAlC2/C,EAAO3/C,OAAOs9B,OAAOyb,UACrB/4C,EAAS2/C,EAAO3/C,OAAOs9B,OAAOyb,YAEc,MAAvC4G,EAAO3/C,OAAOs9B,OAAOC,iBAC1Bv9B,EAAS2/C,EAAO3/C,OAAOs9B,OAAOC,kBAElC,MAAM2vD,EAAa,IAAIr0C,GACjBi6B,EAAI,CACN/7D,KAAMiwB,MAAOr+B,EAAOmL,KAEhB,IAAI5Z,EADJ4Z,GAASmqC,QAAQC,iBAEjB,MAAMivC,EAAe,IAAI/2D,SAAQ,CAACr4B,EAASs4B,KACvCn8B,EAAW,KACPm8B,EAAO,IAAI,GAAW,gBAAgB,EAE1CviB,GAASmqC,QAAQG,iBAAiB,QAASlkD,EAAS,IAExD,IACI,GAAa,MAATyO,EAAe,CAEf,MAAM,KAAEk0B,EAAI,MAAEhkC,SAAgBu9B,QAAQioB,KAAK,CACvCr+C,EAAOkC,OACPirF,IAEJ,OAAa,IAATtwD,EACO,IAAIgc,GAERhgD,CACX,CACA,KAAOq0F,EAAW7iF,WAAa1B,GAAO,CAClC,MAAM,MAAE9P,EAAK,KAAEgkC,SAAezG,QAAQioB,KAAK,CACvCr+C,EAAOkC,OACPirF,IAEJ,IAAa,IAATtwD,EACA,MAAM,IAAI,GAAmB,2BAEjCqwD,EAAWl0C,OAAOngD,EACtB,CACA,MAAMwQ,EAAM6jF,EAAWzzC,QAAQ,EAAG9wC,GAElC,OADAukF,EAAW9zC,QAAQzwC,GACZU,CACX,CACA,QACoB,MAAZnP,GACA4Z,GAASmqC,QAAQK,oBAAoB,QAASpkD,EAEtD,GAEJqP,MAAOy9B,MAAOxD,EAAM1vB,KAChBA,GAASmqC,QAAQC,iBAEb1a,aAAgB15B,iBACVP,EAAMlP,KAAKmpC,EAAM1vB,SAGjBvK,EAAMlP,KAAKmpC,EAAK1nB,WAAYhI,EACtC,EAEJs5E,OAAQ,KACJ,GAAIF,EAAW7iF,WAAa,EAAG,CAC3B,MAAMgjF,EAAiB1tC,EAAO3/C,OAC9B2/C,EAAO3/C,OAAUgnC,mBACY,IAArBrQ,GAAM22D,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAO1tC,CAAM,GAGrB,OAAOmzB,CACX,CCnIO,MAAM,WAAkCz6E,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BCQJ,SAAS2+E,GAAS5tC,EAAQhpB,EAAO,CAAC,GACrC,MAAMhuB,EAAQskF,GAAWttC,EAAQhpB,GACP,MAAtBA,EAAKwlB,eAAiD,MAAxBxlB,EAAKulB,kBAGnCvlB,EAAKulB,gBAAkB,EAAsBvlB,EAAKwlB,gBAEtD,MAAMqxC,EAAe72D,GAAMslB,eAAiB,EACtCZ,EAAe1kB,GAAM2kB,eAAiB,EA6C5C,MA5CU,CACNvkC,KAAMiwB,MAAOlzB,IACT,IAAIkoC,GAAc,EAClB,MAAMyxC,EAAe,IAAI50C,GACzB,OAAa,CAET40C,EAAaz0C,aAAarwC,EAAMoO,KAAK,EAAGjD,IACxC,IACIkoC,EAAawxC,EAAaC,EAC9B,CACA,MAAOntE,GACH,GAAIA,aAAe+P,WACf,SAEJ,MAAM/P,CACV,CACA,GAAI07B,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzBrlB,GAAMulB,iBAA2BuxC,EAAapjF,WAAassB,EAAKulB,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvBrlB,GAAMwlB,eAAyBH,EAAarlB,EAAKwlB,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAOxzC,EAAMoO,KAAKilC,EAAYloC,EAAQ,EAE1CvK,MAAOy9B,MAAOxD,EAAM1vB,WAEVnL,EAAMY,MAAM,IAAIsvC,GAAewC,EAAa7X,EAAKn5B,YAAam5B,GAAO1vB,EAAQ,EAEvF45E,OAAQ1mD,MAAOxD,EAAM1vB,KACjB,MAAM4lC,EAAO,IAAIb,MAAkBrV,EAAKmqD,SAAQtkF,GAAO,CAAEgyC,EAAahyC,EAAIgB,YAAahB,YAEjFV,EAAMY,MAAMmwC,EAAM5lC,EAAQ,EAEpCs5E,OAAQ,IACGzkF,EAAMykF,SAIzB,CC/EO,SAASrC,KACZ,MAAMlgE,EAAW,KACjB,IAAI+iE,GAAQ,EACZ,MAAO,CACH9tC,KAAM9Y,MAAOhnC,IACT,GAAI4tF,EACA,MAAM,IAAIv1F,MAAM,iBAEpBu1F,GAAQ,EACR/iE,EAAS9sB,QAAQiC,EAAO,EAE5BA,OAASgnC,kBACL,MAAMhnC,QAAe6qB,EAAS4xB,cACvBz8C,CACX,CAHQ,GAKhB,CCpBO,MAAM6tF,GAA6B,MAE7BC,GAAoBnnF,QAAQ8qB,WAAWxmB,SAASvH,KAAKoqF,mBCFlE,SAAS/nB,GAAO14D,GACZ,IAAKjJ,OAAO8rC,cAAc7iC,IAAMA,EAAI,EAChC,MAAM,IAAIhV,MAAM,kCAAkCgV,IAC1D,CACA,SAAS+O,GAAK3B,GACV,GAAiB,kBAANA,EACP,MAAM,IAAIpiB,MAAM,yBAAyBoiB,IACjD,CACO,SAAS,GAAQD,GACpB,OAAQA,aAAa1Q,YACX,MAAL0Q,GAA0B,iBAANA,GAAyC,eAAvBA,EAAErR,YAAYvO,IAC7D,CACA,SAAS+N,GAAM8R,KAAM01B,GACjB,IAAK,GAAQ11B,GACT,MAAM,IAAIpiB,MAAM,uBACpB,GAAI83C,EAAQ70C,OAAS,IAAM60C,EAAQtrB,SAASpK,EAAEnf,QAC1C,MAAM,IAAIjD,MAAM,iCAAiC83C,oBAA0B11B,EAAEnf,SACrF,CAOA,SAASyyF,GAAOv9C,EAAUC,GAAgB,GACtC,GAAID,EAASE,UACT,MAAM,IAAIr4C,MAAM,oCACpB,GAAIo4C,GAAiBD,EAASG,SAC1B,MAAM,IAAIt4C,MAAM,wCACxB,CASA,MCjCa,GAAOw4C,GAAQ,IAAIphC,YAAYohC,EAAItkC,OAAQskC,EAAIzP,WAAYt+B,KAAK6a,MAAMkzB,EAAIxmC,WAAa,IAMpG,GADgF,KAA5D,IAAIP,WAAW,IAAI2F,YAAY,CAAC,YAAalD,QAAQ,GAErE,MAAM,IAAIlU,MAAM,+CAiGb,SAAS,GAAQmrC,GACpB,GAAoB,iBAATA,EACPA,EAlBD,SAAqB5jC,GACxB,GAAmB,iBAARA,EACP,MAAM,IAAIvH,MAAM,+BAA+BuH,GACnD,OAAO,IAAIkK,YAAW,IAAI87B,aAAc72B,OAAOnP,GACnD,CAce,CAAY4jC,OAClB,KAAI,GAAQA,GAGb,MAAM,IAAInrC,MAAM,mCAAmCmrC,GAFnDA,EAAOwqD,GAAUxqD,EAEyC,CAC9D,OAAOA,CACX,CAwCO,MAAMyqD,GAAa,CAAC/3D,EAAQl1B,KAC/BxI,OAAO01B,OAAOltB,EAAGk1B,GACVl1B,GAGJ,SAAS,GAAaixC,EAAM7Q,EAAYvoC,EAAOm5C,GAClD,GAAiC,mBAAtBC,EAAKO,aACZ,OAAOP,EAAKO,aAAapR,EAAYvoC,EAAOm5C,GAChD,MAAMS,EAAO3S,OAAO,IACd4S,EAAW5S,OAAO,YAClB6S,EAAKvuC,OAAQvL,GAAS45C,EAAQC,GAC9BE,EAAKxuC,OAAOvL,EAAQ65C,GACpB/iC,EAAIqiC,EAAO,EAAI,EACf32C,EAAI22C,EAAO,EAAI,EACrBC,EAAKY,UAAUzR,EAAazxB,EAAGgjC,EAAIX,GACnCC,EAAKY,UAAUzR,EAAa/lC,EAAGu3C,EAAIZ,EACvC,CAaO,SAASg8C,GAAUrlF,GACtB,OAAOmB,WAAWsO,KAAKzP,EAC3B,CACO,SAASulF,MAAS31C,GACrB,IAAK,IAAIn9C,EAAI,EAAGA,EAAIm9C,EAAOj9C,OAAQF,IAC/Bm9C,EAAOn9C,GAAGm3C,KAAK,EAEvB,CC1JA,MAAM47C,GAAgBvuF,GAAQkK,WAAWsO,KAAKxY,EAAI2B,MAAM,IAAIpD,KAAK6C,GAAMA,EAAEkG,WAAW,MAC9EknF,GAAUD,GAAa,oBACvBE,GAAUF,GAAa,oBACvBG,GAAa,GAAIF,IACjBG,GAAa,GAAIF,IAEhB,SAAS,GAAK7zE,EAAGC,GACpB,OAAQD,GAAKC,EAAMD,IAAO,GAAKC,CACnC,CAEA,SAAS,GAAYA,GACjB,OAAOA,EAAE2mB,WAAa,GAAM,CAChC,CAPqBmtD,GAAWxzF,QAShC,MAIMyzF,GAAc,GAAK,GAAK,EACxBC,GAAY,IAAIh/E,YAiCf,SAASi/E,GAAaC,EAAMh4D,GAC/B,MAAM,eAAEi4D,EAAc,cAAEC,EAAa,cAAEC,EAAa,aAAEC,EAAY,OAAEC,GD4CjE,SAAmB9xF,EAAUy5B,GAChC,GAAY,MAARA,GAAgC,iBAATA,EACvB,MAAM,IAAIt+B,MAAM,2BAEpB,OADeG,OAAO01B,OC/CmE,CAAE0gE,gBAAgB,EAAOE,cAAe,EAAGC,cAAc,EAAOC,OAAQ,ID+C1Hr4D,EAE3C,CCjDmF,CAAU,EAA8EA,GACvK,GAAoB,mBAATg4D,EACP,MAAM,IAAIt2F,MAAM,2BAKpB,OAJA,GAAQy2F,GACR,GAAQE,GACR,GAAMD,GACN,GAAMH,GACC,CAACh2F,EAAKq2F,EAAOzrD,EAAMgV,EAAQjS,EAAU,KACxC,GAAO3tC,GACP,GAAOq2F,GACP,GAAOzrD,GACP,MAAMvnC,EAAMunC,EAAKloC,OAKjB,QAJevC,IAAXy/C,IACAA,EAAS,IAAI1uC,WAAW7N,IAC5B,GAAOu8C,GACP,GAAQjS,GACJA,EAAU,GAAKA,GAAWioD,GAC1B,MAAM,IAAIn2F,MAAM,yBACpB,GAAImgD,EAAOl9C,OAASW,EAChB,MAAM,IAAI5D,MAAM,gBAAgBmgD,EAAOl9C,iCAAiCW,MAC5E,MAAMizF,EAAU,GAIhB,IAAoB38D,EAAG48D,EAAnB9zF,EAAIzC,EAAI0C,OACZ,GAAU,KAAND,EACA6zF,EAAQ70F,KAAMk4B,EAAIy7D,GAAUp1F,IAC5Bu2F,EAAQZ,OAEP,IAAU,KAANlzF,IAAYuzF,EAQjB,MAAM,IAAIv2F,MAAM,wCAAwCgD,KAPxDk3B,EAAI,IAAIzoB,WAAW,IACnByoB,EAAEp5B,IAAIP,GACN25B,EAAEp5B,IAAIP,EAAK,IACXu2F,EAAQb,GACRY,EAAQ70F,KAAKk4B,EAIjB,CAQK,GAAY08D,IACbC,EAAQ70F,KAAM40F,EAAQjB,GAAUiB,IACpC,MAAMG,EAAM,GAAI78D,GAEhB,GAAIs8D,EAAe,CACf,GAAqB,KAAjBI,EAAM3zF,OACN,MAAM,IAAIjD,MAAM,wCACpBw2F,EAAcM,EAAOC,EAAK,GAAIH,EAAMnzE,SAAS,EAAG,KAAMszE,GACtDH,EAAQA,EAAMnzE,SAAS,GAC3B,CAEA,MAAMuzE,EAAa,GAAKP,EACxB,GAAIO,IAAeJ,EAAM3zF,OACrB,MAAM,IAAIjD,MAAM,sBAAsBg3F,iBAE1C,GAAmB,KAAfA,EAAmB,CACnB,MAAMC,EAAK,IAAIxlF,WAAW,IAC1BwlF,EAAGn2F,IAAI81F,EAAOF,EAAe,EAAI,GAAKE,EAAM3zF,QAC5C2zF,EAAQK,EACRJ,EAAQ70F,KAAK40F,EACjB,CACA,MAAMM,EAAM,GAAIN,GAGhB,OAvGR,SAAmBN,EAAMQ,EAAOv2F,EAAKq2F,EAAOzrD,EAAMgV,EAAQjS,EAASyoD,GAC/D,MAAM/yF,EAAMunC,EAAKloC,OACXgT,EAAQ,IAAIxE,WARJ,IASRwI,EAAM,GAAIhE,GAEVkhF,EAAY,GAAYhsD,IAAS,GAAYgV,GAC7Ci3C,EAAMD,EAAY,GAAIhsD,GAAQirD,GAC9BiB,EAAMF,EAAY,GAAIh3C,GAAUi2C,GACtC,IAAK,IAAI9tF,EAAM,EAAGA,EAAM1E,EAAKsqC,IAAW,CAEpC,GADAooD,EAAKQ,EAAOv2F,EAAKq2F,EAAO38E,EAAKi0B,EAASyoD,GAClCzoD,GAAWioD,GACX,MAAM,IAAIn2F,MAAM,yBACpB,MAAM65C,EAAOpvC,KAAKC,IAlBR,GAkBuB9G,EAAM0E,GAEvC,GAAI6uF,GApBM,KAoBOt9C,EAAjB,CACI,MAAMy9C,EAAQhvF,EAAM,EACpB,GAAIA,EAAM,GAAM,EACZ,MAAM,IAAItI,MAAM,+BACpB,IAAK,IAAWu3F,EAAPvzF,EAAI,EAASA,EAvBd,GAuB+BA,IACnCuzF,EAAOD,EAAQtzF,EACfqzF,EAAIE,GAAQH,EAAIG,GAAQt9E,EAAIjW,GAEhCsE,GA5BM,EA8BV,KAVA,CAWA,IAAK,IAAWivF,EAAPvzF,EAAI,EAASA,EAAI61C,EAAM71C,IAC5BuzF,EAAOjvF,EAAMtE,EACbm8C,EAAOo3C,GAAQpsD,EAAKosD,GAAQthF,EAAMjS,GAEtCsE,GAAOuxC,CALP,CAMJ,CACJ,CAsEQ29C,CAAUlB,EAAMQ,EAAOC,EAAKG,EAAK/rD,EAAMgV,EAAQjS,EAASyoD,GACxDd,MAASgB,GACF12C,CAAM,CAErB,CC9JA,MAAMs3C,GAAS,CAACt1E,EAAGpf,IAAgB,IAATof,EAAEpf,MAA0B,IAATof,EAAEpf,OAAgB,EAC/D,MAAM20F,GACF,WAAA5mF,CAAYvQ,GACRiB,KAAKy2C,SAAW,GAChBz2C,KAAKw2C,UAAY,GACjBx2C,KAAK0S,OAAS,IAAIzC,WAAW,IAC7BjQ,KAAKw6B,EAAI,IAAI27D,YAAY,IACzBn2F,KAAK8V,EAAI,IAAIqgF,YAAY,IACzBn2F,KAAK4pC,IAAM,IAAIusD,YAAY,GAC3Bn2F,KAAK8G,IAAM,EACX9G,KAAK82C,UAAW,EAEhB,GADA/3C,EAAM,GAAQA,GACF,IACZ,MAAMorF,EAAK8L,GAAOl3F,EAAK,GACjBqrF,EAAK6L,GAAOl3F,EAAK,GACjB84E,EAAKoe,GAAOl3F,EAAK,GACjBsrF,EAAK4L,GAAOl3F,EAAK,GACjBurF,EAAK2L,GAAOl3F,EAAK,GACjBwrF,EAAK0L,GAAOl3F,EAAK,IACjBq3F,EAAKH,GAAOl3F,EAAK,IACjBs3F,EAAKJ,GAAOl3F,EAAK,IAEvBiB,KAAKw6B,EAAE,GAAU,KAAL2vD,EACZnqF,KAAKw6B,EAAE,GAAiC,MAA1B2vD,IAAO,GAAOC,GAAM,GAClCpqF,KAAKw6B,EAAE,GAAiC,MAA1B4vD,IAAO,GAAOvS,GAAM,GAClC73E,KAAKw6B,EAAE,GAAgC,MAAzBq9C,IAAO,EAAMwS,GAAM,GACjCrqF,KAAKw6B,EAAE,GAAiC,KAA1B6vD,IAAO,EAAMC,GAAM,IACjCtqF,KAAKw6B,EAAE,GAAM8vD,IAAO,EAAK,KACzBtqF,KAAKw6B,EAAE,GAAiC,MAA1B8vD,IAAO,GAAOC,GAAM,GAClCvqF,KAAKw6B,EAAE,GAAiC,MAA1B+vD,IAAO,GAAO6L,GAAM,GAClCp2F,KAAKw6B,EAAE,GAAgC,MAAzB47D,IAAO,EAAMC,GAAM,GACjCr2F,KAAKw6B,EAAE,GAAM67D,IAAO,EAAK,IACzB,IAAK,IAAI90F,EAAI,EAAGA,EAAI,EAAGA,IACnBvB,KAAK4pC,IAAIroC,GAAK00F,GAAOl3F,EAAK,GAAK,EAAIwC,EAC3C,CACA,OAAA6P,CAAQu4B,EAAMzmC,EAAQozF,GAAS,GAC3B,MAAMC,EAAQD,EAAS,EAAI,MACrB,EAAExgF,EAAC,EAAE0kB,GAAMx6B,KACXw2F,EAAKh8D,EAAE,GACPi8D,EAAKj8D,EAAE,GACPk8D,EAAKl8D,EAAE,GACPm8D,EAAKn8D,EAAE,GACPo8D,EAAKp8D,EAAE,GACPq8D,EAAKr8D,EAAE,GACPs8D,EAAKt8D,EAAE,GACPu8D,EAAKv8D,EAAE,GACPw8D,EAAKx8D,EAAE,GACPy8D,EAAKz8D,EAAE,GACP2vD,EAAK8L,GAAOtsD,EAAMzmC,EAAS,GAC3BknF,EAAK6L,GAAOtsD,EAAMzmC,EAAS,GAC3B20E,EAAKoe,GAAOtsD,EAAMzmC,EAAS,GAC3BmnF,EAAK4L,GAAOtsD,EAAMzmC,EAAS,GAC3BonF,EAAK2L,GAAOtsD,EAAMzmC,EAAS,GAC3BqnF,EAAK0L,GAAOtsD,EAAMzmC,EAAS,IAC3BkzF,EAAKH,GAAOtsD,EAAMzmC,EAAS,IAC3BmzF,EAAKJ,GAAOtsD,EAAMzmC,EAAS,IACjC,IAAIg0F,EAAKphF,EAAE,IAAW,KAALq0E,GACbgN,EAAKrhF,EAAE,IAAkC,MAA1Bq0E,IAAO,GAAOC,GAAM,IACnCgN,EAAKthF,EAAE,IAAkC,MAA1Bs0E,IAAO,GAAOvS,GAAM,IACnCwf,EAAKvhF,EAAE,IAAiC,MAAzB+hE,IAAO,EAAMwS,GAAM,IAClCiN,EAAKxhF,EAAE,IAAkC,MAA1Bu0E,IAAO,EAAMC,GAAM,KAClCiN,EAAKzhF,EAAE,IAAOw0E,IAAO,EAAK,MAC1BkN,EAAK1hF,EAAE,IAAkC,MAA1Bw0E,IAAO,GAAOC,GAAM,IACnCkN,EAAK3hF,EAAE,IAAkC,MAA1By0E,IAAO,GAAO6L,GAAM,IACnCsB,EAAK5hF,EAAE,IAAiC,MAAzBsgF,IAAO,EAAMC,GAAM,IAClCsB,EAAK7hF,EAAE,IAAOugF,IAAO,EAAKE,GAC1BpvF,EAAI,EACJywF,EAAKzwF,EAAI+vF,EAAKV,EAAKW,GAAM,EAAIF,GAAMG,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GACjF3vF,EAAIywF,IAAO,GACXA,GAAM,KACNA,GAAML,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAAMe,GAAM,EAAIhB,GAAMiB,GAAM,EAAIlB,GAChFtvF,GAAKywF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK1wF,EAAI+vF,EAAKT,EAAKU,EAAKX,EAAKY,GAAM,EAAIH,GAAMI,GAAM,EAAIL,GAAMM,GAAM,EAAIP,GAC3E5vF,EAAI0wF,IAAO,GACXA,GAAM,KACNA,GAAMN,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAAMc,GAAM,EAAIf,GAAMgB,GAAM,EAAIjB,GAChFvvF,GAAK0wF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK3wF,EAAI+vF,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,GAAM,EAAIJ,GAAMK,GAAM,EAAIN,GACrE7vF,EAAI2wF,IAAO,GACXA,GAAM,KACNA,GAAMP,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAAMe,GAAM,EAAIhB,GAChFxvF,GAAK2wF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK5wF,EAAI+vF,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAAKc,GAAM,EAAIL,GAC/D9vF,EAAI4wF,IAAO,GACXA,GAAM,KACNA,GAAMR,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAAMc,GAAM,EAAIf,GAChFzvF,GAAK4wF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK7wF,EAAI+vF,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAAKa,EAAKd,EAC1DrvF,EAAI6wF,IAAO,GACXA,GAAM,KACNA,GAAMT,GAAM,EAAIN,GAAMO,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GAAMa,GAAM,EAAId,GAChF1vF,GAAK6wF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK9wF,EAAI+vF,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAAKY,EAAKb,EAC1DtvF,EAAI8wF,IAAO,GACXA,GAAM,KACNA,GAAMV,EAAKf,EAAKgB,GAAM,EAAIP,GAAMQ,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAAMY,GAAM,EAAIb,GAC1E3vF,GAAK8wF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAK/wF,EAAI+vF,EAAKJ,EAAKK,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAAKW,EAAKZ,EAC1DvvF,EAAI+wF,IAAO,GACXA,GAAM,KACNA,GAAMX,EAAKd,EAAKe,EAAKhB,EAAKiB,GAAM,EAAIR,GAAMS,GAAM,EAAIV,GAAMW,GAAM,EAAIZ,GACpE5vF,GAAK+wF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKhxF,EAAI+vF,EAAKH,EAAKI,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAAKU,EAAKX,EAC1DxvF,EAAIgxF,IAAO,GACXA,GAAM,KACNA,GAAMZ,EAAKb,EAAKc,EAAKf,EAAKgB,EAAKjB,EAAKkB,GAAM,EAAIT,GAAMU,GAAM,EAAIX,GAC9D7vF,GAAKgxF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKjxF,EAAI+vF,EAAKF,EAAKG,EAAKJ,EAAKK,EAAKN,EAAKO,EAAKR,EAAKS,EAAKV,EAC1DzvF,EAAIixF,IAAO,GACXA,GAAM,KACNA,GAAMb,EAAKZ,EAAKa,EAAKd,EAAKe,EAAKhB,EAAKiB,EAAKlB,EAAKmB,GAAM,EAAIV,GACxD9vF,GAAKixF,IAAO,GACZA,GAAM,KACN,IAAIC,EAAKlxF,EAAI+vF,EAAKD,EAAKE,EAAKH,EAAKI,EAAKL,EAAKM,EAAKP,EAAKQ,EAAKT,EAC1D1vF,EAAIkxF,IAAO,GACXA,GAAM,KACNA,GAAMd,EAAKX,EAAKY,EAAKb,EAAKc,EAAKf,EAAKgB,EAAKjB,EAAKkB,EAAKnB,EACnDrvF,GAAKkxF,IAAO,GACZA,GAAM,KACNlxF,GAAMA,GAAK,GAAKA,EAAK,EACrBA,EAAKA,EAAIywF,EAAM,EACfA,EAAS,KAAJzwF,EACLA,KAAU,GACV0wF,GAAM1wF,EACN2O,EAAE,GAAK8hF,EACP9hF,EAAE,GAAK+hF,EACP/hF,EAAE,GAAKgiF,EACPhiF,EAAE,GAAKiiF,EACPjiF,EAAE,GAAKkiF,EACPliF,EAAE,GAAKmiF,EACPniF,EAAE,GAAKoiF,EACPpiF,EAAE,GAAKqiF,EACPriF,EAAE,GAAKsiF,EACPtiF,EAAE,GAAKuiF,CACX,CACA,QAAA5iF,GACI,MAAM,EAAEK,EAAC,IAAE8zB,GAAQ5pC,KACb43E,EAAI,IAAIue,YAAY,IAC1B,IAAIhvF,EAAI2O,EAAE,KAAO,GACjBA,EAAE,IAAM,KACR,IAAK,IAAIvU,EAAI,EAAGA,EAAI,GAAIA,IACpBuU,EAAEvU,IAAM4F,EACRA,EAAI2O,EAAEvU,KAAO,GACbuU,EAAEvU,IAAM,KAEZuU,EAAE,IAAU,EAAJ3O,EACRA,EAAI2O,EAAE,KAAO,GACbA,EAAE,IAAM,KACRA,EAAE,IAAM3O,EACRA,EAAI2O,EAAE,KAAO,GACbA,EAAE,IAAM,KACRA,EAAE,IAAM3O,EACRywE,EAAE,GAAK9hE,EAAE,GAAK,EACd3O,EAAIywE,EAAE,KAAO,GACbA,EAAE,IAAM,KACR,IAAK,IAAIr2E,EAAI,EAAGA,EAAI,GAAIA,IACpBq2E,EAAEr2E,GAAKuU,EAAEvU,GAAK4F,EACdA,EAAIywE,EAAEr2E,KAAO,GACbq2E,EAAEr2E,IAAM,KAEZq2E,EAAE,IAAM,KACR,IAAI/4D,GAAY,EAAJ1X,GAAS,EACrB,IAAK,IAAI5F,EAAI,EAAGA,EAAI,GAAIA,IACpBq2E,EAAEr2E,IAAMsd,EACZA,GAAQA,EACR,IAAK,IAAItd,EAAI,EAAGA,EAAI,GAAIA,IACpBuU,EAAEvU,GAAMuU,EAAEvU,GAAKsd,EAAQ+4D,EAAEr2E,GAC7BuU,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,GAAK8zB,EAAI,GACnB9zB,EAAE,GAAS,MAAJb,EACP,IAAK,IAAI1T,EAAI,EAAGA,EAAI,EAAGA,IACnB0T,GAAOa,EAAEvU,GAAKqoC,EAAIroC,GAAM,IAAM0T,IAAM,IAAO,EAC3Ca,EAAEvU,GAAS,MAAJ0T,EAEXo/E,GAAMzc,EACV,CACA,MAAA94E,CAAO6qC,GACH,GAAQ3pC,MACR,MAAM,OAAE0S,EAAM,SAAE+jC,GAAaz2C,KAEvBoC,GADNunC,EAAO,GAAQA,IACEloC,OACjB,IAAK,IAAIqF,EAAM,EAAGA,EAAM1E,GAAM,CAC1B,MAAMi2C,EAAOpvC,KAAKC,IAAIutC,EAAWz2C,KAAK8G,IAAK1E,EAAM0E,GAEjD,GAAIuxC,IAAS5B,EAKb/jC,EAAOpT,IAAIqqC,EAAK1nB,SAASnb,EAAKA,EAAMuxC,GAAOr4C,KAAK8G,KAChD9G,KAAK8G,KAAOuxC,EACZvxC,GAAOuxC,EACHr4C,KAAK8G,MAAQ2vC,IACbz2C,KAAKoR,QAAQsB,EAAQ,GAAG,GACxB1S,KAAK8G,IAAM,QATX,KAAO2vC,GAAYr0C,EAAM0E,EAAKA,GAAO2vC,EACjCz2C,KAAKoR,QAAQu4B,EAAM7iC,EAU/B,CACA,OAAO9G,IACX,CACA,OAAAyL,GACI4oF,GAAMr0F,KAAK8V,EAAG9V,KAAKw6B,EAAGx6B,KAAK0S,OAAQ1S,KAAK4pC,IAC5C,CACA,UAAA4O,CAAW3O,GACP,GAAQ7pC,MHlMhB,SAAgB6pC,EAAK8M,GACjB7nC,GAAM+6B,GACN,MAAM3gC,EAAMytC,EAASH,UACrB,GAAI3M,EAAIpoC,OAASyH,EACb,MAAM,IAAI1K,MAAM,yDAAyD0K,IAEjF,CG6LQ,CAAQ2gC,EAAK7pC,MACbA,KAAK82C,UAAW,EAChB,MAAM,OAAEpkC,EAAM,EAAEoD,GAAM9V,KACtB,IAAI,IAAE8G,GAAQ9G,KACd,GAAI8G,EAAK,CAEL,IADA4L,EAAO5L,KAAS,EACTA,EAAM,GAAIA,IACb4L,EAAO5L,GAAO,EAClB9G,KAAKoR,QAAQsB,EAAQ,GAAG,EAC5B,CACA1S,KAAKyV,WACL,IAAI6iF,EAAO,EACX,IAAK,IAAI/2F,EAAI,EAAGA,EAAI,EAAGA,IACnBsoC,EAAIyuD,KAAUxiF,EAAEvU,KAAO,EACvBsoC,EAAIyuD,KAAUxiF,EAAEvU,KAAO,EAE3B,OAAOsoC,CACX,CACA,MAAAh0B,GACI,MAAM,OAAEnD,EAAM,UAAE8jC,GAAcx2C,KAC9BA,KAAKw4C,WAAW9lC,GAChB,MAAMkzB,EAAMlzB,EAAOxR,MAAM,EAAGs1C,GAE5B,OADAx2C,KAAKyL,UACEm6B,CACX,EAUG,MAAM2yD,GARN,SAAgC9gD,GACnC,MAAMC,EAAQ,CAACC,EAAK54C,IAAQ04C,EAAS14C,GAAKD,OAAO,GAAQ64C,IAAM9hC,SACzD+hC,EAAMH,EAAS,IAAIxnC,WAAW,KAIpC,OAHAynC,EAAMlB,UAAYoB,EAAIpB,UACtBkB,EAAMjB,SAAWmB,EAAInB,SACrBiB,EAAM94C,OAAUG,GAAQ04C,EAAS14C,GAC1B24C,CACX,CACwB8gD,EAAwBz5F,GAAQ,IAAIm3F,GAASn3F,KCvPrE,SAAS05F,GAAW11F,EAAG21B,EAAGllB,EAAGq2B,EAAK6uD,EAAKvD,EAAS,IAC5C,IAAIwD,EAAM51F,EAAE,GAAI61F,EAAM71F,EAAE,GAAI81F,EAAM91F,EAAE,GAAI+1F,EAAM/1F,EAAE,GAChDg2F,EAAMrgE,EAAE,GAAIsgE,EAAMtgE,EAAE,GAAIugE,EAAMvgE,EAAE,GAAIwgE,EAAMxgE,EAAE,GAC5CygE,EAAMzgE,EAAE,GAAI0gE,EAAM1gE,EAAE,GAAI2gE,EAAM3gE,EAAE,GAAI4gE,EAAM5gE,EAAE,GAC5C6gE,EAAMb,EAAKc,EAAMhmF,EAAE,GAAIimF,EAAMjmF,EAAE,GAAIkmF,EAAMlmF,EAAE,GAEvCmmF,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,IAAIl/D,EAAI,EAAGA,EAAI26D,EAAQ36D,GAAK,EAC7Bm/D,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,EACT9wD,EAAI8wD,KAAShC,EAAMgB,EAAO,EAC1B9vD,EAAI8wD,KAAS/B,EAAMgB,EAAO,EAC1B/vD,EAAI8wD,KAAS9B,EAAMgB,EAAO,EAC1BhwD,EAAI8wD,KAAS7B,EAAMgB,EAAO,EAC1BjwD,EAAI8wD,KAAS5B,EAAMgB,EAAO,EAC1BlwD,EAAI8wD,KAAS3B,EAAMgB,EAAO,EAC1BnwD,EAAI8wD,KAAS1B,EAAMgB,EAAO,EAC1BpwD,EAAI8wD,KAASzB,EAAMgB,EAAO,EAC1BrwD,EAAI8wD,KAASxB,EAAMgB,EAAO,EAC1BtwD,EAAI8wD,KAASvB,EAAMgB,EAAO,EAC1BvwD,EAAI8wD,KAAStB,EAAMgB,EAAO,EAC1BxwD,EAAI8wD,KAASrB,EAAMgB,EAAO,EAC1BzwD,EAAI8wD,KAASpB,EAAMgB,EAAO,EAC1B1wD,EAAI8wD,KAASnB,EAAMgB,EAAO,EAC1B3wD,EAAI8wD,KAASlB,EAAMgB,EAAO,EAC1B5wD,EAAI8wD,KAASjB,EAAMgB,EAAO,CAC9B,CAyFO,MASME,GAA2B/F,GAAa4D,GAAY,CAC7DvD,cAAc,EACdD,cAAe,EACfF,gBAAgB,IAOP8F,GAA4BhG,GAAa4D,GAAY,CAC9DvD,cAAc,EACdD,cAAe,EACfD,cAvGG,SAAiBjyF,EAAG21B,EAAGn3B,EAAGs0F,GAC7B,IAAI8D,EAAM52F,EAAE,GAAI62F,EAAM72F,EAAE,GAAI82F,EAAM92F,EAAE,GAAI+2F,EAAM/2F,EAAE,GAAIg3F,EAAMrhE,EAAE,GAAIshE,EAAMthE,EAAE,GAAIuhE,EAAMvhE,EAAE,GAAIwhE,EAAMxhE,EAAE,GAAIyhE,EAAMzhE,EAAE,GAAI0hE,EAAM1hE,EAAE,GAAI2hE,EAAM3hE,EAAE,GAAI4hE,EAAM5hE,EAAE,GAAI6hE,EAAMh5F,EAAE,GAAIi5F,EAAMj5F,EAAE,GAAIk5F,EAAMl5F,EAAE,GAAIm5F,EAAMn5F,EAAE,GAChM,IAAK,IAAIi5B,EAAI,EAAGA,EAAI,GAAIA,GAAK,EACzBm/D,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,EACT9E,EAAI8E,KAAQhB,EACZ9D,EAAI8E,KAAQf,EACZ/D,EAAI8E,KAAQd,EACZhE,EAAI8E,KAAQb,EACZjE,EAAI8E,KAAQJ,EACZ1E,EAAI8E,KAAQH,EACZ3E,EAAI8E,KAAQF,EACZ5E,EAAI8E,KAAQD,CAChB,EA2BI3F,gBAAgB,IAkBd+F,GAA0B,IAAI7qF,WAAW,IAEzC8qF,GAAe,CAACjlF,EAAG6hC,KACrB7hC,EAAEhX,OAAO64C,GACT,MAAMtO,EAAOsO,EAAIl2C,OAAS,GACtB4nC,GACAvzB,EAAEhX,OAAOg8F,GAAQ74E,SAASonB,GAAM,EAElC2xD,GAA0B,IAAI/qF,WAAW,IAC/C,SAASgrF,GAAWp7F,EAAId,EAAKq2F,EAAOzrD,EAAMuxD,GACtC,MAAMC,EAAUt7F,EAAGd,EAAKq2F,EAAO4F,IACzBllF,EAAIyiF,GAAS35F,OAAOu8F,GACtBD,GACAH,GAAajlF,EAAGolF,GACpBH,GAAajlF,EAAG6zB,GAChB,MAAM6C,EAAM,IAAIv8B,WAAW,IACrBmoC,GHlPiBpB,EGkPCxK,EHlPO,IAAIyK,SAASD,EAAItkC,OAAQskC,EAAIzP,WAAYyP,EAAIxmC,aAAtD,IAACwmC,EGmPvB,GAAaoB,EAAM,EAAGnS,OAAOi1D,EAAMA,EAAIz5F,OAAS,IAAI,GACpD,GAAa22C,EAAM,EAAGnS,OAAO0D,EAAKloC,SAAS,GAC3CqU,EAAEhX,OAAO0tC,GACT,MAAM5G,EAAM9vB,EAAED,SAEd,OADAw+E,GAAM8G,EAAS3uD,GACR5G,CACX,CAUO,MAAMw1D,GAAkBC,GAAc,CAACt8F,EAAKq2F,EAAO8F,KAEtD,GAAOn8F,EAAK,IACZ,GAAOq2F,GACA,CACH,OAAAkG,CAAQC,EAAW58C,GACf,MAAM68C,EAAUD,EAAU95F,OACpBg6F,EAAUD,EANN,GAON78C,EACA,GAAOA,EAAQ88C,GAGf98C,EAAS,IAAI1uC,WAAWwrF,GAE5BJ,EAAUt8F,EAAKq2F,EAAOmG,EAAW58C,EAAQ,GACzC,MAAM7L,EAAMmoD,GAAWI,EAAWt8F,EAAKq2F,EAAOz2C,EAAO18B,SAAS,GAAG,IAAai5E,GAG9E,OAFAv8C,EAAOr/C,IAAIwzC,EAAK0oD,GAChBnH,GAAMvhD,GACC6L,CACX,EACA,OAAA+8C,CAAQC,EAAYh9C,GAChB,MAAM88C,EAAUE,EAAWl6F,OACrB+5F,EAAUC,EArBN,GAsBV,GAAIA,EAtBM,GAuBN,MAAM,IAAIj9F,MAAM,4CAChBmgD,EACA,GAAOA,EAAQ68C,GAGf78C,EAAS,IAAI1uC,WAAWurF,GAE5B,MAAM7xD,EAAOgyD,EAAW15E,SAAS,GAAG,IAC9B25E,EAAYD,EAAW15E,UAAS,IAChC6wB,EAAMmoD,GAAWI,EAAWt8F,EAAKq2F,EAAOzrD,EAAMuxD,GACpD,IH7JL,SAAoBv6E,EAAGC,GAC1B,GAAID,EAAElf,SAAWmf,EAAEnf,OACf,OAAO,EACX,IAAIiJ,EAAO,EACX,IAAK,IAAInJ,EAAI,EAAGA,EAAIof,EAAElf,OAAQF,IAC1BmJ,GAAQiW,EAAEpf,GAAKqf,EAAErf,GACrB,OAAgB,IAATmJ,CACX,CGsJiB,CAAWkxF,EAAW9oD,GACvB,MAAM,IAAIt0C,MAAM,eAGpB,OAFA68F,EAAUt8F,EAAKq2F,EAAOzrD,EAAMgV,EAAQ,GACpC01C,GAAMvhD,GACC6L,CACX,IAOKk9C,GAAmCzH,GAAW,CAAE0H,UAAW,GAAIC,YAAa,GAAIC,UAAW,IAAMZ,GAAeR,KAMdQ,GAAeP,ICtS9H,MAAMoB,GAA+B,IAAIhsF,WAAW,CAAC,IAC/CisF,GAA+B,IAAIjsF,WAwDlC,MChFMksF,GCGe,CACxBC,WAAWzyD,GACA,GAAOA,EAAK1nB,YAEvB,OAAAo6E,CAAQC,EAAIC,GACR,MAAMC,EFMP,SAAiBpvF,EAAMmvF,EAAKE,GAO/B,OANAlmD,GAAMnpC,QAIOlO,IAATu9F,IACAA,EAAO,IAAIxsF,WAAW7C,EAAKopC,YACxBywC,GAAK75E,EAAMgqC,GAAQqlD,GAAOrlD,GAAQmlD,GAC7C,CEdoBG,CAAQ,GAAQH,EAAKD,GAE3BK,EFsBP,SAAgBvvF,EAAMovF,EAAKhoD,EAAM/yC,EAAS,IAG7C,GAFA80C,GAAMnpC,GACNgpC,GAAQ30C,GACJA,EAAS,IAAM2L,EAAKopC,UACpB,MAAM,IAAIh4C,MAAM,mCACpB,MAAM8V,EAASrL,KAAK01B,KAAKl9B,EAAS2L,EAAKopC,gBAC1Bt3C,IAATs1C,IACAA,EAAO0nD,IAEX,MAAMS,EAAM,IAAI1sF,WAAWqE,EAASlH,EAAKopC,WAEnCqwC,EAAOI,GAAKroF,OAAOwO,EAAMovF,GACzBI,EAAU/V,EAAKrvC,aACf0nC,EAAI,IAAIjvE,WAAW42E,EAAKrwC,WAC9B,IAAK,IAAI9J,EAAU,EAAGA,EAAUp4B,EAAQo4B,IACpCuvD,GAAa,GAAKvvD,EAAU,EAG5BkwD,EAAQ99F,OAAmB,IAAZ4tC,EAAgBwvD,GAAehd,GACzCpgF,OAAO01C,GACP11C,OAAOm9F,IACPzjD,WAAW0mC,GAChByd,EAAIr9F,IAAI4/E,EAAG9xE,EAAKopC,UAAY9J,GAC5Bm6C,EAAKrvC,WAAWolD,GAMpB,OAJA/V,EAAKp7E,UACLmxF,EAAQnxF,UACRyzE,EAAExmC,KAAK,GACPujD,GAAavjD,KAAK,GACXikD,EAAIz7F,MAAM,EAAGO,EACxB,CErD2Bo7F,CAAO,GAAQL,OAAKt9F,EAAW,IAKlD,MAAO,CAHIy9F,EAAI16E,SAAS,EAAG,IAChB06E,EAAI16E,SAAS,GAAI,IACjB06E,EAAI16E,SAAS,GAAI,IAEhC,EACA,qBAAA66E,GACI,MAAMC,EAAYla,GAAOH,MAAMC,mBAE/B,MAAO,CACHhW,UAFckW,GAAOP,aAAaya,GAGlCrvB,WAAYqvB,EAEpB,EACAC,8BAA8BtP,IAEnB,CACH/gB,UAFckW,GAAOP,aAAaoL,GAGlChgB,WAAYggB,IAGpBuP,wBAAuB,CAACvvB,EAAYf,IACzBkW,GAAOkC,gBAAgBrX,EAAWzrD,WAAY0qD,EAAU1qD,YAEnEi7E,wBAAuB,CAAC3B,EAAWnG,EAAO+H,EAAIzkE,IACnCmjE,GAAiBnjE,EAAG08D,EAAO+H,GAAI7B,QAAQC,EAAUt5E,YAE5Dm7E,wBAAuB,CAACzB,EAAYvG,EAAO+H,EAAIzkE,EAAGxX,IACvC26E,GAAiBnjE,EAAG08D,EAAO+H,GAAIzB,QAAQC,EAAW15E,WAAYf,ICrChEm8E,GAAkBr+F,IAC3B,MAAMkrB,EAAS,EAAsB,GAGrC,OAFAA,EAAO,GAAKlrB,GAAS,EACrBkrB,EAAO,GAAKlrB,EACLkrB,CAAM,EAEjBmzE,GAAevuF,MAAQ,EAChB,MAAMwuF,GAAkB3zD,IAC3B,GAAIA,EAAKloC,OAAS,EACd,MAAM+0B,WAAW,4BACrB,GAAImT,aAAgB15B,WAAY,CAC5B,IAAIjR,EAAQ,EAGZ,OAFAA,GAAS2qC,EAAK,IAAM,EACpB3qC,GAAS2qC,EAAK,GACP3qC,CACX,CACA,OAAO2qC,EAAKiT,UAAU,EAAE,EChBrB,SAAS2gD,GAAmBx6F,EAAGy6F,GAC7BA,EAAUnzF,SAAY4pF,KAGvBlxF,GACAy6F,EAAU,2BAA2B,GAAmBz6F,EAAE4pE,UAAW,UACrE6wB,EAAU,4BAA4B,GAAmBz6F,EAAE2qE,WAAY,WAGvE8vB,EAAU,8BAElB,CACO,SAASC,GAAsBx5E,EAAGu5E,GAChCA,EAAUnzF,SAAY4pF,KAGvBhwE,GACAu5E,EAAU,8BAA8B,GAAmBv5E,EAAE0oD,UAAW,UACxE6wB,EAAU,+BAA+B,GAAmBv5E,EAAEypD,WAAY,WAG1E8vB,EAAU,iCAElB,CAYO,SAASE,GAAsBn1F,EAAIi1F,GACjCA,EAAUnzF,SAAY4pF,IAIvBuJ,EADAj1F,EACU,+BAA+B,GAAmBA,EAAG0Z,WAAY,SAGjE,iCAElB,CACO,SAAS07E,GAAeC,EAAKC,EAAKL,GAChCA,EAAUnzF,SAAY4pF,KAG3BuJ,EAAU,kBAAkBI,EAAIpqF,EAAEsqF,eAAeF,EAAIllE,GAAK,GAAmBklE,EAAIllE,EAAG,UACpF8kE,EAAU,kBAAkBK,EAAIrqF,EAAEsqF,eAAeD,EAAInlE,GAAK,GAAmBmlE,EAAInlE,EAAG,UACxF,CDlCA4kE,GAAexuF,MAAQ,EEpBhB,MAAM,WAAmCtQ,MAC5CuW,KACA,WAAAzF,CAAY9C,EAAU,2BAClB4jC,MAAM5jC,GACNxM,KAAK+U,KAAO,GAA2BA,IAC3C,CACA80C,YAAc,8BCQX,MAAMk0C,GACTvqF,EACA1E,MACAspC,KACA,WAAA9oC,CAAYkE,EAjBS,GAkBjBxT,KAAKwT,EAAIA,EACTxT,KAAK8O,MAAQ,EAAgB,IAC7B9O,KAAKo4C,KAAO,IAAInB,SAASj3C,KAAK8O,MAAM4D,OAAQ1S,KAAK8O,MAAMy4B,WAAYvnC,KAAK8O,MAAM0B,YAC9ExQ,KAAKo4C,KAAKY,UAAU,EAAGxlC,GAAG,EAC9B,CACA,SAAAwqF,GACIh+F,KAAKwT,IAELxT,KAAKo4C,KAAKY,UAAU,EAAGh5C,KAAKwT,GAAG,EACnC,CACA,QAAAyqF,GACI,OAAOj+F,KAAK8O,KAChB,CACA,SAAAgvF,GACI,OAAO99F,KAAKwT,CAChB,CACA,WAAA0qF,GACI,GAAIl+F,KAAKwT,EA5BQ,WA6Bb,MAAM,IAAIhV,MA5BA,uEA8BlB,EChCG,MAAM2/F,GAAU,EAAgB,GAChC,MAAMC,GACT1lE,EACAllB,EACA45B,OACA,WAAA99B,CAAY89B,EAAQ1U,OAAIx5B,EAAWsU,EAAI,GACnCxT,KAAKotC,OAASA,EACdptC,KAAK04B,EAAIA,EACT14B,KAAKwT,EAAI,IAAIuqF,GAAMvqF,EACvB,CACA,MAAA6qF,GACI,OAAOvxF,QAAQ9M,KAAK04B,EACxB,CACA,aAAA4lE,CAAcnB,EAAI5B,GACd,IAAKv7F,KAAKq+F,SACN,OAAO9C,EAEXv7F,KAAKwT,EAAE0qF,cACP,MAAMj6E,EAAIjkB,KAAKotC,OAAOkuD,QAAQC,EAAWv7F,KAAKwT,EAAEyqF,WAAYd,EAAIn9F,KAAK04B,GAErE,OADA14B,KAAKwT,EAAEwqF,YACA/5E,CACX,CACA,aAAAs6E,CAAcpB,EAAIxB,EAAYz6E,GAC1B,IAAKlhB,KAAKq+F,SACN,OAAO1C,EAEX37F,KAAKwT,EAAE0qF,cACP,MAAM3C,EAAYv7F,KAAKotC,OAAOsuD,QAAQC,EAAY37F,KAAKwT,EAAEyqF,WAAYd,EAAIn9F,KAAK04B,EAAGxX,GAEjF,OADAlhB,KAAKwT,EAAEwqF,YACAzC,CACX,EAEG,MAAMiD,GACTC,GACAnC,GACAxmF,EACAs3B,OACA,WAAA99B,CAAY89B,EAAQsxD,GAChB1+F,KAAKotC,OAASA,EACd,MAAMuxD,EAAoB,GAAqBD,EAAc,SAC7D1+F,KAAK8V,EAuMb,SAA0Bs3B,EAAQsxD,GAC9B,GAAIA,EAAaj9F,QAAU,GAAI,CAC3B,MAAMqU,EAAI,EAAgB,IAE1B,OADAA,EAAExW,IAAIo/F,GACC5oF,CACX,CAEI,OAAOs3B,EAAOhgC,KAAKsxF,EAE3B,CAhNiBE,CAAiBxxD,EAAQuxD,GAClC3+F,KAAKs8F,GAAKt8F,KAAK8V,EACf9V,KAAKy+F,GAAK,IAAIL,GAAYhxD,EAC9B,CACA,MAAAyxD,CAAOtC,GACH,MAAOD,EAAIwC,GAAS9+F,KAAKotC,OAAO2xD,KAAK/+F,KAAKs8F,GAAIC,GAC9Cv8F,KAAKs8F,GAAKA,EACVt8F,KAAKy+F,GAAK,IAAIL,GAAYp+F,KAAKotC,OAAQ0xD,EAC3C,CACA,OAAAE,CAAQr1D,GACJ3pC,KAAK8V,EAAI9V,KAAKotC,OAAOhgC,KAAK,IAAI4xC,GAAeh/C,KAAK8V,EAAG6zB,GACzD,CACA,cAAAs1D,CAAe1D,GACX,MAAMI,EAAa37F,KAAKy+F,GAAGH,cAAct+F,KAAK8V,EAAGylF,GAEjD,OADAv7F,KAAKg/F,QAAQrD,GACNA,CACX,CACA,cAAAuD,CAAevD,GACX,MAAMJ,EAAYv7F,KAAKy+F,GAAGF,cAAcv+F,KAAK8V,EAAG6lF,GAEhD,OADA37F,KAAKg/F,QAAQrD,GACNJ,CACX,CACA,KAAA7zF,GACI,MAAOy3F,EAAQC,GAAUp/F,KAAKotC,OAAO2xD,KAAK/+F,KAAKs8F,GAAI6B,IACnD,MAAO,CAAC,IAAIC,GAAYp+F,KAAKotC,OAAQ+xD,GAAS,IAAIf,GAAYp+F,KAAKotC,OAAQgyD,GAC/E,EAEG,MAAMC,GACTC,GACAv8F,EACAkhB,EACAs7E,GACAh3F,GACAi3F,UACApyD,OACA,WAAA99B,CAAYzD,GACR,MAAM,OAAEuhC,EAAM,aAAEsxD,EAAY,SAAEe,EAAQ,UAAED,EAAS,EAAEz8F,EAAC,EAAEkhB,EAAC,GAAEs7E,EAAE,GAAEh3F,GAAOsD,EACpE7L,KAAKotC,OAASA,EACdptC,KAAKs/F,GAAK,IAAId,GAAepxD,EAAQsxD,GACrC1+F,KAAKs/F,GAAGN,QAAQS,GAChBz/F,KAAKw/F,UAAYA,EACjBx/F,KAAK+C,EAAIA,EACT/C,KAAKikB,EAAIA,EACTjkB,KAAKu/F,GAAKA,EACVv/F,KAAKuI,GAAKA,CACd,CACA,MAAAm3F,GACI,GAAI1/F,KAAKikB,EACL,MAAM,IAAIzlB,MAAM,oCAEpB,MAAMylB,EAAIjkB,KAAKotC,OAAOuyD,kBAGtB,OAFA3/F,KAAKs/F,GAAGN,QAAQ/6E,EAAE0oD,WAClB3sE,KAAKikB,EAAIA,EACFA,EAAE0oD,SACb,CACA,MAAAizB,GACI,IAAK5/F,KAAK+C,EACN,MAAM,IAAIvE,MAAM,6BAEpB,OAAOwB,KAAKs/F,GAAGL,eAAej/F,KAAK+C,EAAE4pE,UACzC,CACA,OAAAkzB,GACI,IAAK7/F,KAAKikB,EACN,MAAM,IAAIzlB,MAAM,gCAEpB,IAAKwB,KAAKuI,GACN,MAAM,IAAI/J,MAAM,0CAEpBwB,KAAKs/F,GAAGT,OAAO7+F,KAAKotC,OAAO0yD,GAAG9/F,KAAKikB,EAAGjkB,KAAKuI,IAC/C,CACA,OAAAw3F,GACI,GAAI//F,KAAKw/F,UAAW,CAChB,IAAKx/F,KAAKikB,EACN,MAAM,IAAIzlB,MAAM,gCAEpB,IAAKwB,KAAKu/F,GACN,MAAM,IAAI/gG,MAAM,uCAEpBwB,KAAKs/F,GAAGT,OAAO7+F,KAAKotC,OAAO0yD,GAAG9/F,KAAKikB,EAAGjkB,KAAKu/F,IAC/C,KACK,CACD,IAAKv/F,KAAK+C,EACN,MAAM,IAAIvE,MAAM,6BAEpB,IAAKwB,KAAKuI,GACN,MAAM,IAAI/J,MAAM,0CAEpBwB,KAAKs/F,GAAGT,OAAO7+F,KAAKotC,OAAO0yD,GAAG9/F,KAAK+C,EAAG/C,KAAKuI,IAC/C,CACJ,CACA,OAAAy3F,GACI,GAAIhgG,KAAKw/F,UAAW,CAChB,IAAKx/F,KAAK+C,EACN,MAAM,IAAIvE,MAAM,6BAEpB,IAAKwB,KAAKuI,GACN,MAAM,IAAI/J,MAAM,0CAEpBwB,KAAKs/F,GAAGT,OAAO7+F,KAAKotC,OAAO0yD,GAAG9/F,KAAK+C,EAAG/C,KAAKuI,IAC/C,KACK,CACD,IAAKvI,KAAKikB,EACN,MAAM,IAAIzlB,MAAM,gCAEpB,IAAKwB,KAAKu/F,GACN,MAAM,IAAI/gG,MAAM,uCAEpBwB,KAAKs/F,GAAGT,OAAO7+F,KAAKotC,OAAO0yD,GAAG9/F,KAAKikB,EAAGjkB,KAAKu/F,IAC/C,CACJ,CACA,KAAAU,CAAMzzF,EAAStJ,EAAS,GACpB,GAAIlD,KAAKuI,GACL,MAAM,IAAI/J,MAAM,8CAEpB,GAAIgO,EAAQgE,WAAatN,EAAS,GAC9B,MAAM,IAAI1E,MAAM,8BAEpBwB,KAAKuI,GAAKiE,EAAQozC,QAAQ18C,EAAQA,EAAS,IAC3ClD,KAAKs/F,GAAGN,QAAQh/F,KAAKuI,GACzB,CACA,KAAA23F,CAAM1zF,EAAStJ,EAAS,GACpB,GAAIlD,KAAKu/F,GACL,MAAM,IAAI/gG,MAAM,2CAEpB,MAAM2hG,EAAe,IAAMngG,KAAKs/F,GAAGb,GAAGJ,SAAW,GAAK,GACtD,GAAI7xF,EAAQgE,WAAatN,EAASi9F,EAC9B,MAAM,IAAI3hG,MAAM,8BAEpB,MAAM4hG,EAAO5zF,EAAQozC,QAAQ18C,EAAQA,EAASi9F,GAE9C,OADAngG,KAAKu/F,GAAKv/F,KAAKs/F,GAAGJ,eAAekB,GAC1BD,CACX,CACA,MAAAE,GACIrgG,KAAK6/F,SACT,CACA,MAAAS,GACItgG,KAAK+/F,SACT,CACA,MAAAQ,GACIvgG,KAAKggG,SACT,EAKG,MAAMQ,WAAyBnB,GAElC,aAAAoB,CAAc1tD,GACV,OAAO,IAAIiM,GAAeh/C,KAAK0/F,SAAU1/F,KAAKs/F,GAAGL,eAAelsD,GACpE,CAEA,aAAA2tD,CAAc3tD,GACV,MAAM9uB,EAAIjkB,KAAK0/F,SACf1/F,KAAK6/F,UACL,MAAMc,EAAO3gG,KAAK4/F,SAElB,OADA5/F,KAAK+/F,UACE,IAAI/gD,GAAe/6B,EAAG08E,EAAM3gG,KAAKs/F,GAAGL,eAAelsD,GAC9D,CAEA,aAAA6tD,CAAc7tD,GACV,MAAM4tD,EAAO3gG,KAAK4/F,SAElB,OADA5/F,KAAKggG,UACE,IAAIhhD,GAAe2hD,EAAM3gG,KAAKs/F,GAAGL,eAAelsD,GAC3D,CAEA,YAAA8tD,CAAar0F,GACT,IAEI,OADAxM,KAAKigG,MAAMzzF,GACJxM,KAAKs/F,GAAGJ,eAAe1yF,EAAQozC,QAAQ,IAClD,CACA,MAAO37B,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEzX,UACjF,CACJ,CAEA,YAAAs0F,CAAat0F,GACT,IACIxM,KAAKigG,MAAMzzF,GACXxM,KAAKqgG,SACL,MAAMU,EAAW/gG,KAAKkgG,MAAM1zF,EAAS,IAErC,OADAxM,KAAKsgG,SACEtgG,KAAKs/F,GAAGJ,eAAe1yF,EAAQozC,QAAQ,GAAKmhD,GACvD,CACA,MAAO98E,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEzX,UACjF,CACJ,CAEA,YAAAw0F,CAAax0F,GACT,IACI,MAAMu0F,EAAW/gG,KAAKkgG,MAAM1zF,GAE5B,OADAxM,KAAKugG,SACEvgG,KAAKs/F,GAAGJ,eAAe1yF,EAAQozC,QAAQmhD,GAClD,CACA,MAAO98E,GACH,MAAM,IAAI,GAA2B,sCAAsCA,EAAEzX,UACjF,CACJ,EC7OG,IAAIy0F,GAgDAC,GCjDJ/zD,eAAeg0D,GAAuBzzB,EAAY0zB,EAAiBh1E,GACtE,MAAMi1E,QAAoB3zB,EAAWpvD,KAAKgjF,GAAoBF,IAC9D,OAAOF,GAAsBhsF,OAAO,CAChCqsF,YAAav0B,GAAoBU,EAAWf,WAC5C00B,cACAj1E,cAER,CACO+gB,eAAeq0D,GAAuBC,EAAcC,EAAiBC,GACxE,IACI,MAAM5uD,EAAUmuD,GAAsBllF,OAAOylF,GACvC90B,EAAYqlB,GAAsBj/C,EAAQwuD,aAChD,IAA6C,IAAzCI,GAAmBrzD,OAAOq+B,GAC1B,MAAM,IAAInuE,MAAM,wBAAwBmuE,iDAAyDg1B,KAErG,IAAKD,EACD,MAAM,IAAIljG,MAAM,gCAEpB,MAAMojG,EAAmBN,GAAoBI,GAC7C,UAAY/0B,EAAUntD,OAAOoiF,EAAkB7uD,EAAQsuD,aACnD,MAAM,IAAI7iG,MAAM,6BAEpB,OAAOu0C,CACX,CACA,MAAO9uB,GACH,MAAM,IAAIgmD,GAAoBhmD,EAAEzX,QACpC,CACJ,CACO,SAAS80F,GAAoB30B,GAChC,MAAMjtE,EAAS,GAAqB,4BACpC,OAAIitE,aAAqB18D,WACd,GAAiB,CAACvQ,EAAQitE,GAAYjtE,EAAO+B,OAASkrE,EAAUlrE,SAE3EkrE,EAAUvtB,QAAQ1/C,GACXitE,EACX,EDjCA,SAAWs0B,GACP,IAAI3uD,EACJ2uD,EAAgB55D,MAAQ,KACN,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAE4B,MAA9B1Q,EAAIsvF,uBACJ,IAAK,MAAM7iG,KAASuT,EAAIsvF,uBACpB9tF,EAAE1D,OAAO,IACT0D,EAAEjF,MAAM9P,IAGa,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,KACR,MAAM8Q,EAAM,CACRsvF,uBAAwB,IAEtB56F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACXyiC,IAAQ,GACP,EACDvgC,EAAIsvF,uBAAuBrhG,KAAK8e,EAAOxQ,SAIvCwQ,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX2uD,EAAgB/rF,OAAU3C,GACf89B,GAAc99B,EAAK0uF,EAAgB55D,SAE9C45D,EAAgBjlF,OAAUxM,GACf43B,EAAc53B,EAAKyxF,EAAgB55D,QAEjD,CA9CD,CA8CG45D,KAAoBA,GAAkB,CAAC,IAE1C,SAAWC,GACP,IAAI5uD,EACJ4uD,EAAsB75D,MAAQ,KACZ,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEkB,MAAnB1Q,EAAIgvF,aAAuBhvF,EAAIgvF,YAAY/wF,WAAa,IACzDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIgvF,cAEQ,MAAnBhvF,EAAI8uF,aAAuB9uF,EAAI8uF,YAAY7wF,WAAa,IACzDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI8uF,cAEM,MAAlB9uF,EAAI6Z,aACJrY,EAAE1D,OAAO,IACT4wF,GAAgB55D,QAAQnyB,OAAO3C,EAAI6Z,WAAYrY,KAEtB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,KACR,MAAM8Q,EAAM,CACRgvF,YAAa,EAAgB,GAC7BF,YAAa,EAAgB,IAE3Bp6F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIgvF,YAAcjiF,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAI8uF,YAAc/hF,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAI6Z,WAAa60E,GAAgB55D,QAAQrrB,OAAOsD,EAAQA,EAAOjP,UAC/D,MAEJ,QACIiP,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEX4uD,EAAsBhsF,OAAU3C,GACrB89B,GAAc99B,EAAK2uF,EAAsB75D,SAEpD65D,EAAsBllF,OAAUxM,GACrB43B,EAAc53B,EAAK0xF,EAAsB75D,QAEvD,CA7DD,CA6DG65D,KAA0BA,GAAwB,CAAC,IEtG/C,MAAMY,GACT55C,SAAW,SACX9a,OACAqyD,SACAsC,UACA31E,WACA41E,QACAz5C,WACA,WAAAj5C,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B,MAAM,eAAEo2F,EAAc,WAAE71E,EAAU,OAAEghB,EAAM,cAAE80D,GAAkBr2F,GACxD,QAAEm2F,GAAYz5C,EACpBvoD,KAAKuoD,WAAaA,EAClB,MAAM45C,EAAU/0D,GAAU+uD,GAC1Bn8F,KAAKotC,OC5BN,SAAoBA,GACvB,MAAO,CACHuyD,gBAAiBvyD,EAAO0vD,sBACxBgD,GAAI,CAACsC,EAASz1B,IAAcv/B,EAAO6vD,wBAAwBmF,EAAQ10B,WAAYf,GAAW1qD,SAAS,EAAG,IACtGq5E,QAASluD,EAAO8vD,wBAChBxB,QAAStuD,EAAOgwD,wBAChBhwF,KAAMggC,EAAOgvD,WACb2C,KAAM3xD,EAAOivD,QAErB,CDmBsBgG,CAAWF,GACzBniG,KAAKosB,WAAaA,EAClBpsB,KAAKgiG,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,QAAW9iG,EAGhDc,KAAK+hG,UAFLE,EAEiBE,EAAQnF,8BAA8BiF,GAGtCE,EAAQrF,wBAE7B98F,KAAKy/F,SAAWyC,GAAiB,EAAgB,EACrD,CACA,CAACz+D,OAAOqB,aAAe,0BACvB,CAACstD,IAAuB,CACpB,gCACA,2BAUJ,oBAAM0Q,CAAer7C,EAAYxtC,GAC7B,MAAM8oF,EAAoBrP,GAASjsC,EAAY,CAC3ChG,cAAe47C,GACfj7C,cAAek7C,GACfh7C,cAAe0xC,KAEbgP,QAAkBhjG,KAAKijG,0BAA0BF,EAAmB/iG,KAAKuoD,WAAWmlB,WAAYzzD,GAAS8wC,YAAY4hB,UAAW1yD,GAChI09C,QAAa33D,KAAKkjG,uBAAuBH,EAAmBC,GAClEv7C,EAAWthD,OAASwxD,EAAKxxD,OACzBshD,EAAWxB,KAAO0R,EAAK1R,KACvB,MAAM0mB,EAAYqlB,GAAsBgR,EAAUjwD,QAAQwuD,aAC1D,MAAO,CACH5pC,KAAMlQ,EACN07C,iBAAkBH,EAAUjwD,QAAQ3mB,WACpC2+B,WAAYgoC,GAAoBpmB,GAExC,CASA,mBAAMy2B,CAAc37C,EAAYxtC,GAC5B,MAAM8oF,EAAoBrP,GAASjsC,EAAY,CAC3ChG,cAAe47C,GACfj7C,cAAek7C,GACfh7C,cAAe0xC,KAEbgP,QAAkBhjG,KAAKqjG,0BAA0BN,EAAmB/iG,KAAKuoD,WAAWmlB,WAAYzzD,GAAS8wC,YAAY4hB,UAAW1yD,GAChI09C,QAAa33D,KAAKkjG,uBAAuBH,EAAmBC,GAClEv7C,EAAWthD,OAASwxD,EAAKxxD,OACzBshD,EAAWxB,KAAO0R,EAAK1R,KACvB,MAAM0mB,EAAYqlB,GAAsBgR,EAAUjwD,QAAQwuD,aAC1D,MAAO,CACH5pC,KAAMlQ,EACN07C,iBAAkBH,EAAUjwD,QAAQ3mB,WACpC2+B,WAAYgoC,GAAoBpmB,GAExC,CAIA,+BAAMs2B,CAA0Bx7C,EAEhCimB,EAAYi0B,EAAmB1nF,GAC3B,IAAInF,EACJ,IACIA,QGpGLq4B,eAAyCthC,EAAMoO,GAClD,MAAM,IAAE7O,EAAG,WAAEq8C,EAAU,OAAEra,EAAM,WAAEsgC,EAAU,SAAE+xB,EAAQ,EAAE18F,EAAC,kBAAE4+F,EAAiB,WAAEv1E,GAAevgB,EACtFknC,QAAgBouD,GAAuBzzB,EAAY3qE,EAAE4pE,UAAWvgD,GAChEk3E,EAAK,IAAI9C,GAAiB,CAC5BpzD,SACAsxD,aAAc,mCACdc,WAAW,EACXC,WACA18F,MAEJw6F,GAAmB+F,EAAGvgG,EAAGqI,GACzBA,EAAIm4F,MAAM,6DACJ97C,EAAW/3C,MAAM4zF,EAAG7C,cAActC,IAAUlkF,GAClD7O,EAAIm4F,MAAM,uDACV9F,GAAsB6F,EAAGr/E,EAAG7Y,GAC5BA,EAAIm4F,MAAM,0EACV,MAAMhI,EAAY+H,EAAGxC,mBAAmBr5C,EAAWvqC,KAAKjD,ITOrD,IAA4BslF,EAAI/B,ESNnCpyF,EAAIm4F,MAAM,6CACV7F,GAAsB4F,EAAG/6F,GAAI6C,GTKEm0F,ESJZ+D,EAAG/D,ITIa/B,ESJTpyF,GTKXf,SAAY4pF,IAIvBuJ,EADA+B,EACU,4BAA4B,GAAmBA,EAAGt9E,WAAY,SAG9D,qCSXd7W,EAAIm4F,MAAM,kDACV,MAAMC,QAAwBhC,GAAuBjG,EAAW+H,EAAG/D,GAAIoC,GACvEv2F,EAAIm4F,MAAM,gCACVn4F,EAAIm4F,MAAM,8DACJ97C,EAAW/3C,MAAM4zF,EAAG1C,cAAc7tD,GAAU94B,GAClD7O,EAAIm4F,MAAM,yDACV,MAAO3F,EAAKC,GAAOyF,EAAGhE,GAAG53F,QAEzB,OADAi2F,GAAeC,EAAKC,EAAKzyF,GAClB,CACH2nC,QAASywD,EACTlI,QAAUC,GAAcqC,EAAIU,cAAcH,GAAS5C,GACnDG,QAAS,CAACC,EAAYz6E,IAAQ28E,EAAIU,cAAcJ,GAASxC,EAAYz6E,GAE7E,CHmE2B+hF,CAA0B,CACrCx7C,aACAimB,aACAi0B,oBACAv2F,IAAKpL,KAAKuoD,WAAW5K,OAAO8lD,aAAa,4BACzCr2D,OAAQptC,KAAKotC,OACbqyD,SAAUz/F,KAAKy/F,SACf18F,EAAG/C,KAAK+hG,UACR31E,WAAYpsB,KAAKosB,YAClBnS,GACHja,KAAKgiG,SAASM,qBAAqBtE,WACvC,CACA,MAAO/5E,GAEH,MADAjkB,KAAKgiG,SAASS,kBAAkBzE,YAC1B/5E,CACV,CACA,OAAOnP,CACX,CAIA,+BAAMuuF,CAA0B57C,EAAYimB,EAAYi0B,EAAmB1nF,GACvE,IAAInF,EACJ,IACIA,QG1FLq4B,eAAyCthC,EAAMoO,GAClD,MAAM,IAAE7O,EAAG,WAAEq8C,EAAU,OAAEra,EAAM,WAAEsgC,EAAU,SAAE+xB,EAAQ,EAAE18F,EAAC,kBAAE4+F,EAAiB,WAAEv1E,GAAevgB,EACtFknC,QAAgBouD,GAAuBzzB,EAAY3qE,EAAE4pE,UAAWvgD,GAChEk3E,EAAK,IAAI9C,GAAiB,CAC5BpzD,SACAsxD,aAAc,mCACdc,WAAW,EACXC,WACA18F,MAEJw6F,GAAmB+F,EAAGvgG,EAAGqI,GACzBA,EAAIm4F,MAAM,yDACVD,EAAGzC,mBAAmBp5C,EAAWvqC,KAAKjD,IACtC7O,EAAIm4F,MAAM,+CACV7F,GAAsB4F,EAAG/6F,GAAI6C,GAC7BA,EAAIm4F,MAAM,2FACJ97C,EAAW/3C,MAAM4zF,EAAG5C,cAAc3tD,GAAU94B,GAClD7O,EAAIm4F,MAAM,8EACV9F,GAAsB6F,EAAGr/E,EAAG7Y,GAC5BA,EAAIm4F,MAAM,8DACV,MAAMhI,EAAY+H,EAAGtC,mBAAmBv5C,EAAWvqC,KAAKjD,IACxD7O,EAAIm4F,MAAM,iEACV,MAAMC,QAAwBhC,GAAuBjG,EAAW+H,EAAG/D,GAAIoC,IAChE/D,EAAKC,GAAOyF,EAAGhE,GAAG53F,QAEzB,OADAi2F,GAAeC,EAAKC,EAAKzyF,GAClB,CACH2nC,QAASywD,EACTlI,QAAUC,GAAcsC,EAAIS,cAAcH,GAAS5C,GACnDG,QAAS,CAACC,EAAYz6E,IAAQ08E,EAAIW,cAAcJ,GAASxC,EAAYz6E,GAE7E,CH4D2BmiF,CAA0B,CACrC57C,aACAimB,aACAi0B,oBACAv2F,IAAKpL,KAAKuoD,WAAW5K,OAAO8lD,aAAa,4BACzCr2D,OAAQptC,KAAKotC,OACbqyD,SAAUz/F,KAAKy/F,SACf18F,EAAG/C,KAAK+hG,UACR31E,WAAYpsB,KAAKosB,YAClBnS,GACHja,KAAKgiG,SAASM,qBAAqBtE,WACvC,CACA,MAAO/5E,GAEH,MADAjkB,KAAKgiG,SAASS,kBAAkBzE,YAC1B/5E,CACV,CACA,OAAOnP,CACX,CACA,4BAAMouF,CAAuBz7C,EAAYu7C,GAErC,MAAOU,EAAQC,GI/IhB,WACH,MAAMhjF,EAAIuwE,KACJtwE,EAAIswE,KACV,MAAO,CACH,CACI/qF,OAAQwa,EAAExa,OACV8/C,KAAMrlC,EAAEqlC,MAEZ,CACI9/C,OAAQya,EAAEza,OACV8/C,KAAMtlC,EAAEslC,MAGpB,CJkI+B29C,GACjBl0C,EAAUjI,EAAW8rC,SAQ3B,aAPM5tC,GAAK+9C,EKhJZ,SAAuBV,EAAWhB,GACrC,OAAO70D,gBAAiBhnC,GACpB,UAAW,MAAMkX,KAASlX,EACtB,IAAK,IAAI5E,EAAI,EAAGA,EAAI8b,EAAM5b,OAAQF,GrBPQyyF,MqBOqC,CAC3E,IAIIrqD,EAJA1iC,EAAM1F,ErBR4ByyF,MqBSlC/sF,EAAMoW,EAAM5b,SACZwF,EAAMoW,EAAM5b,QAIZkoC,EADAtsB,aAAiBpN,WACV+yF,EAAU1H,QAAQj+E,EAAM4E,SAAS1gB,EAAG0F,IAGpC+7F,EAAU1H,QAAQj+E,EAAMuiC,QAAQr+C,EAAG0F,IAE9C+6F,GAASU,iBAAiB1E,kBACpB,IAAIh/C,GAAeq+C,GAAe1zD,EAAKn5B,YAAam5B,EAC9D,CAER,CACJ,CL6HQk6D,CAAcb,EAAWhjG,KAAKgiG,SAC9BtyC,GACCvpD,GAAW,GAAOA,EAAQ,CAAEi8C,cAAek7C,MK7H7C,SAAuB0F,EAAWhB,GACrC,OAAO70D,gBAAiBhnC,GACpB,UAAW,MAAMkX,KAASlX,EACtB,IAAK,IAAI5E,EAAI,EAAGA,EAAI8b,EAAM5b,OAAQF,GAAKyyF,GAA4B,CAC/D,IAAI/sF,EAAM1F,EAAIyyF,GAId,GAHI/sF,EAAMoW,EAAM5b,SACZwF,EAAMoW,EAAM5b,QAEZwF,EAhCM,GAgCoB1F,EAC1B,MAAM,IAAI/C,MAAM,iBAEpB,MAAMslG,EAAYzmF,EAAMuiC,QAAQr+C,EAAG0F,GAK7Bia,EAAM7D,EAAM4E,SAAS1gB,EAAG0F,EAxCpB,IAyCV,IACI,MAAMs0F,EAAYyH,EAAUtH,QAAQoI,EAAW5iF,GAC/C8gF,GAASW,iBAAiB3E,kBACpBzC,CACV,CACA,MAAOt3E,GAEH,MADA+9E,GAASY,cAAc5E,YACjB/5E,CACV,CACJ,CAER,CACJ,CLiGQ8/E,CAAcf,EAAWhjG,KAAKgiG,SAC9B0B,GAEOC,CACX,EMtHG,SAASK,GAAMn4F,EAAO,CAAC,GAC1B,OAAQ08C,GAAe,IAAIu5C,GAAMv5C,EAAY18C,EACjD,CCtBO,MAAMo4F,GAAsBxgE,OAAOmL,IAAI,0BCfjCs1D,GAAO,GAAK,QACZC,GAAO,GAAK,QACZC,GAAU,GAAK,WACf,GAAM,GAAG,GAAK,OAAQA,GAASF,GAAMC,IACrCE,GAAK,GAAG,GAAK,OAAQ,GAAK,QAC1BC,GAAM,GAAGC,GAAIF,GAAI,GAAK,QAASE,GAAI,GAAK,GAAK,SAC7CC,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,GAAI,GAAK,GAAK,QAC9C,GAAa,GAAGA,GAAIK,GAAa,GAAK,QAASA,IACtDC,GAAoB,GAAGN,GAAID,GAAK,GAAK,QAASC,GAAI,GAAK,GAAK,QAASA,GAAID,GAAK,GAAK,OAAQ,GAAK,OAAQC,GAAI,GAAK,GAAK,OAAQ,GAAK,QAC5H,GAAmB,GAAGA,GAAIM,GAAmB,GAAK,QAASA,IAC3DC,GAAO,GAAGP,GAAID,GAAK,GAAK,SAAUC,GAAIF,GAAI,GAAK,SAAUE,GAAI,GAAK,GAAK,UACvEQ,GAAQ,GAAGR,GAAID,GAAK,GAAK,UAAWC,GAAIF,GAAI,GAAK,UAAWE,GAAI,GAAK,GAAK,WACjFS,GAAgBT,GAAIC,GAAK,GAAK,iBAAkB,GAAK,aAC9CS,GAAe,GAAGV,GAAIS,GAAe,GAAK,QAASA,IAC1DE,GAAgBX,GAAII,GAAQ,GAAK,gBAAiB,GAAK,YAAa,GAAK,aAClEQ,GAAe,GAAGZ,GAAIW,GAAe,GAAK,QAASA,IAInDE,GAAgB,GAAGb,GAAI,GAAY,GAAK,mBAAoB,GAAK,QAASA,GAAI,GAAkB,GAAK,mBAAoB,GAAK,QAASA,GAAI,GAAY,GAAK,oBAAqBA,GAAI,GAAkB,GAAK,qBAK5Mc,IAJgB,GAAGd,GAAI,GAAY,GAAK,sBAAuB,GAAK,QAASA,GAAI,GAAkB,GAAK,sBAAuB,GAAK,QAASA,GAAI,GAAY,GAAK,uBAAwBA,GAAI,GAAkB,GAAK,wBAInM,GAAGA,GAAIO,GAAM,GAAK,qBAAsB,GAAK,QAASP,GAAIQ,GAAO,GAAK,qBAAsB,GAAK,QAASR,GAAIO,GAAM,GAAK,sBAAuBP,GAAIQ,GAAO,GAAK,wBAClLO,GAAW,GAAGV,GAAaC,GAAmBC,GAAMC,GAAOK,GAAeC,GAAiBf,GAAKG,GAAKC,GAAM,GAAKO,GAAcE,IAGrII,IADkB,GAAGhB,GAAIe,GAAU,GAAK,gBAAiB,GAAK,QAASf,GAAIe,GAAU,GAAK,kBACnF,GAAGf,GAAIe,GAAU,GAAK,QAASF,GAAeC,GAAiBJ,GAAcE,GAAc,GAAK,SACvGK,GAAW,GAAGjB,GAAIgB,GAAM,GAAK,eAAgBA,IAAOhB,GAAIgB,GAAM,GAAK,gBAAiBhB,GAAI,GAAK,eAAgBgB,IAAOhB,GAAIe,GAAU,GAAK,gBAAiBf,GAAI,GAAK,eAAgBe,IAAW,GAAK,gBACjMG,GAAmB,IAAM,GAAGlB,GAAIiB,GAAUC,IAAmBD,IACtDE,GAAUD,KACVE,GAAM,GAAGpB,GAAImB,GAASH,GAAMG,IAAUnB,GAAIgB,GAAMG,IAAUnB,GAAImB,GAASH,IAAOG,GAASH,IAMpG,SAASK,GAAoBC,GAkBzB,OAjBA,SAAiBllF,GACb,IAAIw5C,EACJ,IACIA,EAAK,GAAUx5C,EACnB,CACA,MAAO8F,GACH,OAAO,CACX,CACA,MAAMojB,EAAMg8D,EAAa1rC,EAAG1F,cAC5B,OAAY,OAAR5qB,KAGQ,IAARA,IAAwB,IAARA,EACTA,EAEW,IAAfA,EAAIpoC,OACf,CAEJ,CACA,SAAS8iG,MAAOpiG,GACZ,SAAS0jG,EAAallF,GAClB,GAAIA,EAAElf,OAASU,EAAKV,OAChB,OAAO,KAEX,IAAIooC,EAAMlpB,EAaV,OAZAxe,EAAK64D,MAAM0Z,IACP7qC,EAAqB,mBAAR6qC,EACPA,IAAMmxB,aAAallF,GACnB+zD,EAAImxB,aAAallF,GACnBhf,MAAM2Q,QAAQu3B,KACdlpB,EAAIkpB,GAEI,OAARA,KAKDA,CACX,CACA,MAAO,CACHxjC,SAAU,WAAc,MAAO,KAAOlE,EAAK0F,KAAK,KAAO,IAAM,EAC7DkuB,MAAO5zB,EACP2jG,QAASF,GAAoBC,GAC7BA,eAER,CACA,SAAS,MAAM1jG,GACX,SAAS0jG,EAAallF,GAClB,IAAIkpB,EAAM,KAWV,OAVA1nC,EAAK64D,MAAM0Z,IACP,MAAM9uC,EAAqB,mBAAR8uC,EACbA,IAAMmxB,aAAallF,GACnB+zD,EAAImxB,aAAallF,GACvB,OAAW,MAAPilB,IACAiE,EAAMjE,GACC,EAEC,IAETiE,CACX,CAOA,MANe,CACXxjC,SAAU,WAAc,MAAO,KAAOlE,EAAK0F,KAAK,KAAO,IAAM,EAC7DkuB,MAAO5zB,EACP2jG,QAASF,GAAoBC,GAC7BA,eAGR,CACA,SAAS,GAAKryF,GACV,MAAMzS,EAAOyS,EAwBb,MAAO,CACHnN,SAAU,WAAc,OAAOtF,CAAM,EACrC+kG,QAzBJ,SAAiBnlF,GACb,IAAIw5C,EACJ,IACIA,EAAK,GAAUx5C,EACnB,CACA,MAAO8F,GACH,OAAO,CACX,CACA,MAAMs/E,EAAS5rC,EAAG1F,aAClB,OAAsB,IAAlBsxC,EAAOtkG,QAAgBskG,EAAO,KAAOhlG,CAI7C,EAaI8kG,aAZJ,SAAsBtxC,GAClB,OAAsB,IAAlBA,EAAO9yD,OACA,KAEP8yD,EAAO,KAAOxzD,EACPwzD,EAAOrzD,MAAM,GAEjB,IACX,EAMJ,CAxGsB,GAAGqjG,GAAImB,GAAS,GAAK,UAAW,GAAK,QAASnB,GAAImB,GAAS,GAAK,WAAYnB,GAAIe,GAAU,GAAK,UAAW,GAAK,QAASf,GAAIe,GAAU,GAAK,WAAY,GAAK,WCClL,MAAMU,WAAkBv5C,GACpB5C,WAAa,YACbz+C,IACAmrD,MACA1W,KACAj5B,QACA2hC,WACA09C,MACA,WAAA32F,CAAYi5C,EAAYtuC,EAAU,CAAE4lC,KAAM,KACtC,GAAoB,MAAhB5lC,EAAQ4lC,MAAwC,IAAxB5lC,EAAQ4lC,KAAKp+C,OACrC,MAAM,IAAIjD,MAAM,+CAEpB4xC,QACApwC,KAAKuoD,WAAaA,EAClBvoD,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,oBAC1CzjG,KAAK4mB,QAAU3M,EAAQ2M,SAnBa,IAoBpC5mB,KAAK6/C,KAAO,GACZ,IAAK,MAAMqmD,KAAajsF,EAAQ4lC,KAAM,CAClC,IAAK8lD,GAAIG,QAAQI,GAAY,CACzBlmG,KAAKoL,IAAIoc,MAAM,qBACf,QACJ,CACA,MAAM2yC,EAAK,GAAU+rC,GACf/+C,EAAYgT,EAAGrF,YACrB,GAAiB,MAAb3N,EAAmB,CACnBnnD,KAAKoL,IAAIoc,MAAM,+CACf,QACJ,CACA,MAAM2+E,EAAW,CACbz1F,GAAIkiF,GAAiBzrC,GACrBi/C,WAAY,CAACjsC,IAEjBn6D,KAAK6/C,KAAKr/C,KAAK2lG,EACnB,CACAnmG,KAAKimG,MAAQhsF,CACjB,CACA,CAACgqF,IAAuBjkG,KACxB,CAACyjC,OAAOqB,aAAe,oBACvB,CAACstD,IAAuB,CACpB,0BAEJ,SAAAx1B,GACI,OAAO9vD,QAAQ9M,KAAKu2D,MACxB,CAIA,KAAAvvD,GACQhH,KAAK48D,cAGT58D,KAAKoL,IAAI,mEAAoEpL,KAAK4mB,SAClF5mB,KAAKu2D,MAAQ1vC,YAAW,KACf7mB,KAAKqmG,0BACL/iE,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GACrB,GACHzmB,KAAK4mB,SACZ,CAIA,6BAAMy/E,GACF,GAAkB,MAAdrmG,KAAKu2D,MAGT,IAAK,MAAM4vC,KAAYnmG,KAAK6/C,KAAM,CAW9B,SAVM7/C,KAAKuoD,WAAW2N,UAAU7yC,MAAM8iF,EAASz1F,GAAI,CAC/CwnD,KAAM,CACF,CAACl4D,KAAKimG,MAAMhrC,SA3EG,aA2EqC,CAChDj8D,MAAOgB,KAAKimG,MAAMK,UA3EN,GA4EZC,IAAKvmG,KAAKimG,MAAMO,SAGxBJ,WAAYD,EAASC,aAGP,MAAdpmG,KAAKu2D,MACL,OAEJv2D,KAAK4sD,kBAAkB,OAAQ,CAAE9E,OAAQq+C,IACzCnmG,KAAKuoD,WAAWI,kBAAkB89C,eAAeN,EAASz1F,IACrD4yB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,mCAAoC2+E,EAASz1F,GAAI+V,EAAI,GAE5E,CACJ,CAIA,IAAAH,GACsB,MAAdtmB,KAAKu2D,OACLhwC,aAAavmB,KAAKu2D,OAEtBv2D,KAAKu2D,WAAQr3D,CACjB,ECzIG,MAIMwnG,GAAoCz2F,WAAWsO,KAAK,CAAC,EAAG,ICE9D,IAAI,GCAAooF,IDCX,SAAWC,GACP,IAAIC,EA8CAv0D,GA7CJ,SAAWu0D,GACP,IAAIv0D,EACJu0D,EAAYx/D,MAAQ,KACF,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIu0F,WAAqBv0F,EAAIu0F,UAAUt2F,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIu0F,aAEa,IAAzBhqE,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRu0F,UAAW,EAAgB,IAEzB7/F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACXyiC,IAAQ,GACP,EACDvgC,EAAIu0F,UAAYxnF,EAAOxQ,QAIvBwQ,EAAO2X,SAAe,EAAN6b,EAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXu0D,EAAY3xF,OAAU3C,GACX89B,GAAc99B,EAAKs0F,EAAYx/D,SAE1Cw/D,EAAY7qF,OAAS,CAACxM,EAAKstB,IAChBsK,EAAc53B,EAAKq3F,EAAYx/D,QAASvK,EAEtD,CA5CD,CA4CG+pE,EAAcD,EAAWC,cAAgBD,EAAWC,YAAc,CAAC,IAEtED,EAAWv/D,MAAQ,KACD,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAY9B,IAX6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEa,MAAd1Q,EAAI20C,QAAkB30C,EAAI20C,OAAO12C,WAAa,IAC/CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI20C,SAEA,MAAX30C,EAAI81E,KAA2B,KAAZ91E,EAAI81E,MACxBt0E,EAAE1D,OAAO,IACT0D,EAAEqO,OAAO7P,EAAI81E,MAEI,MAAjB91E,EAAIw0F,UACJ,IAAK,MAAM/nG,KAASuT,EAAIw0F,UACpBhzF,EAAE1D,OAAO,IACTu2F,EAAWC,YAAYx/D,QAAQnyB,OAAOlW,EAAO+U,IAGxB,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR20C,OAAQ,EAAgB,GACxBmhC,IAAK,GACL0e,UAAW,IAET9/F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAI20C,OAAS5nC,EAAOxQ,QACpB,MAEJ,KAAK,EACDyD,EAAI81E,IAAM/oE,EAAO8C,SACjB,MAEJ,KAAK,EACD,GAA8B,MAA1B0a,EAAKsW,QAAQ2zD,WAAqBx0F,EAAIw0F,UAAUtlG,SAAWq7B,EAAKsW,OAAO2zD,UACvE,MAAM,IAAIj1D,GAAe,8DAE7Bv/B,EAAIw0F,UAAUvmG,KAAKomG,EAAWC,YAAYx/D,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC9E+iC,OAAQtW,EAAKsW,QAAQ4zD,cAEzB,MAEJ,QACI1nF,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXs0D,EAAW1xF,OAAU3C,GACV89B,GAAc99B,EAAKq0F,EAAWv/D,SAEzCu/D,EAAW5qF,OAAS,CAACxM,EAAKstB,IACfsK,EAAc53B,EAAKo3F,EAAWv/D,QAASvK,EAErD,CAnHD,CAmHG,KAAe,GAAa,CAAC,IEjHzB,MAAM8pE,GAIT/8C,0BAA6Br6C,IACzB,MAAMy3F,EAAa,GAASjrF,OAAOxM,GAC7B03C,EAAS4rC,GAAoB,GAAcmU,EAAW//C,SACtDk/C,GAAca,EAAWF,WAAa,IAAIziG,KAAKqc,GAAM,GAAUA,EAAEmmF,aACjEI,EAAYD,EAAW5e,IAC7B,OAAO,IAAIue,GAAW,CAAE1/C,SAAQk/C,aAAYc,aAAY,EAE5Dr9C,cHpBuC,qBGqBvCA,aAAe68C,GACfx/C,OACAk/C,WACAc,UACA1pB,OAASopB,GAAWO,OACpB9/D,MAAQu/D,GAAWQ,MACnBC,UACA,WAAA/3F,CAAYzD,GACR,MAAM,OAAEq7C,EAAM,WAAEk/C,EAAU,UAAEc,GAAcr7F,EAC1C7L,KAAKknD,OAASA,EACdlnD,KAAKomG,WAAaA,GAAc,GAChCpmG,KAAKknG,UAAYA,GAAajhE,OAAOz7B,KAAKu2D,MAC9C,CAIA,OAAAumC,GAUI,OATsB,MAAlBtnG,KAAKqnG,YACLrnG,KAAKqnG,UAAY,GAASnyF,OAAO,CAC7BgyC,OAAQlnD,KAAKknD,OAAO6lB,cAAcj+D,MAClCu5E,IAAKpiD,OAAOjmC,KAAKknG,WACjBH,UAAW/mG,KAAKomG,WAAW9hG,KAAK8yB,IAAM,CAClC0vE,UAAW1vE,EAAEtoB,aAIlB9O,KAAKqnG,SAChB,CAIA,MAAA/4D,CAAOC,GACH,OAAMA,aAAiBq4D,MAIlB5mG,KAAKknD,OAAO5Y,OAAOC,EAAM2Y,SAI1BlnD,KAAKknG,YAAc34D,EAAM24D,aCxC9B,SAAqBvmF,EAAGC,GAC3B,MAAMxS,EAAO,CAACuS,EAAGC,IAAMD,EAAEta,WAAWkhG,cAAc3mF,EAAEva,YACpD,OAAIsa,EAAElf,SAAWmf,EAAEnf,SAGnBmf,EAAExS,KAAKA,GACAuS,EAAEvS,KAAKA,GAAMw7D,OAAM,CAACpkB,EAAM36C,IAAU+V,EAAE/V,GAAOyjC,OAAOkX,KAC/D,CDqCagiD,CAAYxnG,KAAKomG,WAAY73D,EAAM63D,WAI5C,GD9DJ,SAAWO,GACP,IAAIr0D,EACJq0D,EAASt/D,MAAQ,KACC,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIo6D,WAAqBp6D,EAAIo6D,UAAUn8D,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIo6D,YAEQ,MAAnBp6D,EAAIk1F,aAAuBl1F,EAAIk1F,YAAYj3F,WAAa,IACzDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIk1F,cAEI,MAAfl1F,EAAIwgC,SAAmBxgC,EAAIwgC,QAAQviC,WAAa,IACjDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIwgC,UAEM,MAAjBxgC,EAAIo7D,WAAqBp7D,EAAIo7D,UAAUn9D,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIo7D,aAEa,IAAzB7wC,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRo6D,UAAW,EAAgB,GAC3B86B,YAAa,EAAgB,GAC7B10D,QAAS,EAAgB,GACzB46B,UAAW,EAAgB,IAEzB1mE,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIo6D,UAAYrtD,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIk1F,YAAcnoF,EAAOxQ,QACzB,MAEJ,KAAK,EACDyD,EAAIwgC,QAAUzzB,EAAOxQ,QACrB,MAEJ,KAAK,EACDyD,EAAIo7D,UAAYruD,EAAOxQ,QACvB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXq0D,EAASzxF,OAAU3C,GACR89B,GAAc99B,EAAKo0F,EAASt/D,SAEvCs/D,EAAS3qF,OAAS,CAACxM,EAAKstB,IACbsK,EAAc53B,EAAKm3F,EAASt/D,QAASvK,EAEnD,CAvED,CAuEG6pE,KAAaA,GAAW,CAAC,IG5ErB,MAAMe,WAA8BlpG,MACvC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,ECAG,MAAM4mG,GAIT99C,0BAA4B1c,MAAOxD,IAC/B,MAAMi+D,EAAe,GAAS5rF,OAAO2tB,GAC/BgjC,EAAYqlB,GAAsB4V,EAAaj7B,WACrD,OAAO,IAAIg7B,GAAe,CACtBh7B,YACA86B,YAAaG,EAAaH,YAC1B10D,QAAS60D,EAAa70D,QACtB46B,UAAWi6B,EAAaj6B,WAC1B,EAMN9jB,YAAc1c,MAAO06D,EAAQn6B,KACzB,GAAkB,MAAdA,EACA,MAAM,IAAIlvE,MAAM,uBAEpB,MAAMg/E,EAASqqB,EAAOrqB,OAChBiqB,EAAcI,EAAOxgE,MACrB0L,EAAU80D,EAAOP,UACjBQ,EAAWC,GAAuBvqB,EAAQiqB,EAAa10D,GACvD46B,QAAkBD,EAAWpvD,KAAKwpF,EAAS7lF,YACjD,OAAO,IAAI0lF,GAAe,CACtBh7B,UAAWe,EAAWf,UACtB86B,cACA10D,UACA46B,aACF,EAMN9jB,sBAAwB1c,MAAOxD,EAAM6zC,KACjC,MAAMwqB,QAAiBL,GAAeM,mBAAmBt+D,GAEzD,UADoBq+D,EAASE,SAAS1qB,GAElC,MAAM,IAAIkqB,GAAsB,wDAEpC,OAAOM,CAAQ,EAEnBr7B,UACA86B,YACA10D,QACA46B,UACA05B,UAKA,WAAA/3F,CAAYzD,GACR,MAAM,UAAE8gE,EAAS,YAAE86B,EAAW,QAAE10D,EAAO,UAAE46B,GAAc9hE,EACvD7L,KAAK2sE,UAAYA,EACjB3sE,KAAKynG,YAAcA,EACnBznG,KAAK+yC,QAAUA,EACf/yC,KAAK2tE,UAAYA,CACrB,CAIA,OAAA25B,GASI,OARsB,MAAlBtnG,KAAKqnG,YACLrnG,KAAKqnG,UAAY,GAASnyF,OAAO,CAC7By3D,UAAWK,GAAoBhtE,KAAK2sE,WACpC86B,YAAaznG,KAAKynG,YAClB10D,QAAS/yC,KAAK+yC,QAAQ9wB,WACtB0rD,UAAW3tE,KAAK2tE,aAGjB3tE,KAAKqnG,SAChB,CAIA,MAAA/4D,CAAOC,GACH,OAAO,GAAiBvuC,KAAKsnG,UAAW/4D,EAAM+4D,UAClD,CAIA,cAAMY,CAAS1qB,GACX,MAAMsqB,EAAWC,GAAuBvqB,EAAQx9E,KAAKynG,YAAaznG,KAAK+yC,SACvE,OAAO/yC,KAAK2sE,UAAUntD,OAAOsoF,EAAS7lF,WAAYjiB,KAAK2tE,UAC3D,EAKJ,MAAMo6B,GAAyB,CAACvqB,EAAQiqB,EAAa10D,KAQjD,MAAMo1D,EAAmB,GAAsB3qB,GACzC4qB,EAAe,EAAcD,EAAiB33F,YAC9C63F,EAAoB,EAAcZ,EAAYhmG,QAC9C6mG,EAAgB,EAAcv1D,EAAQtxC,QAC5C,OAAO,IAAIu9C,GAAeopD,EAAcD,EAAkBE,EAAmBZ,EAAaa,EAAev1D,EAAQ,mCC9GrH,MA0BMw1D,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,sBAEqCjkG,KAAIkkG,GAAW,IAAI,GAAA71E,QAAQ61E,KACpE,SAASC,GAAUC,GACf,IAAK,MAAMluE,KAAK+tE,GACZ,GAAI/tE,EAAExG,SAAS00E,GACX,OAAO,EAEf,OAAO,CACX,CAyCO,SAASC,GAAYx1E,GACxB,OAAIq9B,GAAOr9B,GACAs1E,GAAUt1E,GAzCd,iDAAiDhrB,KA0C9BgrB,GArC9B,SAA6Bu1E,GACzB,MAAMtrF,EAAQsrF,EAAOhhG,MAAM,KAC3B,GAAI0V,EAAM3b,OAAS,EACf,OAAO,EAEX,MAAMmnG,EAAUxrF,EAAMA,EAAM3b,OAAS,GAAG6uD,SAAS,EAAG,KAC9Cu4C,EAAUzrF,EAAMA,EAAM3b,OAAS,GAAG6uD,SAAS,EAAG,KAEpD,OAAOm4C,GADK,GAAGjqF,SAASqqF,EAAQphG,UAAU,EAAG,GAAI,OAAO+W,SAASqqF,EAAQphG,UAAU,GAAI,OAAO+W,SAASoqF,EAAQnhG,UAAU,EAAG,GAAI,OAAO+W,SAASoqF,EAAQnhG,UAAU,GAAI,MAE1K,CA6BeqhG,CAAoB31E,GAxBxB,kEAAkEhrB,KAyB7CgrB,GAvBhC,SAA+Bu1E,GAC3B,MAAMtrF,EAAQsrF,EAAOhhG,MAAM,KAE3B,OAAO+gG,GADKrrF,EAAMA,EAAM3b,OAAS,GAErC,CAoBesnG,CAAsB51E,GACxBs9B,GAAOt9B,GApBpB,SAAmBu1E,GACf,MAAO,OAAOvgG,KAAKugG,IACf,QAAQvgG,KAAKugG,IACb,oEAAoEvgG,KAAKugG,IACzE,wFAAwFvgG,KAAKugG,IAC7F,iIAAiIvgG,KAAKugG,IACtI,6IAA6IvgG,KAAKugG,IAClJ,oIAAoIvgG,KAAKugG,IACzI,oJAAoJvgG,KAAKugG,IACzJ,8BAA8BvgG,KAAKugG,IACnC,8BAA8BvgG,KAAKugG,IACnC,0BAA0BvgG,KAAKugG,EACvC,CASeM,CAAU71E,QAEjB,CACR,CClFO,SAAS81E,GAAU9uC,GACtB,IACI,ICFD,SAAmBA,GACtB,IACI,OAAQ9yB,IAAU8yB,EAAGnH,eACrB,OARU,IAQH3rB,GAPG,KAOoBA,CAClC,CACA,MACA,CACA,OAAO,CACX,CDNa6hE,CAAU/uC,GAEX,OAAO,EAEX,OAAQ,CAAEn7D,IAAUm7D,EAAGnH,eACvB,OAAa,MAATh0D,IAGG2pG,GAAY3pG,KAAU,EACjC,CACA,MACA,CACA,OAAO,CACX,CEfA,MAGamqG,GAAQtpG,IACV,CACH4I,MAAQmjE,KACAA,EAAKnqE,OAAS,MAGd5B,EAAG+rE,EAAK,KACDA,EAAK1qE,MAAM,GAI1BkoG,QAAS,OAGJC,GAAWtjG,IACb,CACH0C,MAAQmjE,GAASu9B,IAAMl+F,GAAQA,IAAQlF,IAAK0C,MAAMmjE,GAClDw9B,QAASrjG,IAGJ,GAAS,KACX,CACH0C,MAAQmjE,GAASu9B,IAAMl+F,GAAuB,iBAARA,IAAkBxC,MAAMmjE,GAC9Dw9B,QAAS,aAGJ,GAAS,KACX,CACH3gG,MAAQmjE,GAASu9B,IAAMl+F,IAAS61B,MAAMtiB,SAASvT,MAAOxC,MAAMmjE,GAC5Dw9B,QAAS,aAGJliD,GAAS,KACX,CACHz+C,MAAQmjE,IACJ,GAAIA,EAAKnqE,OAAS,EACd,OAAO,EAEX,GAAgB,QAAZmqE,EAAK,IAA4B,SAAZA,EAAK,GAC1B,OAAO,EAGX,IAAIA,EAAK,GAAGr/C,WAAW,OAAQq/C,EAAK,GAAGr/C,WAAW,KAS9C,OAAO,EARP,IACIgf,GAAUvvB,OAAO,IAAI4vD,EAAK,KAC9B,CACA,MAAOnlD,GACH,OAAO,CACX,CAKJ,OAAOmlD,EAAK1qE,MAAM,EAAE,EAExBkoG,QAAS,kBAGJE,GAAW,KACb,CACH7gG,MAAQmjE,IACJ,GAAIA,EAAKnqE,OAAS,EACd,OAAO,EAEX,GAAgB,aAAZmqE,EAAK,GACL,OAAO,EAEX,IACIlgC,GAAU1vB,OAAO4vD,EAAK,GAC1B,CACA,MACI,OAAO,CACX,CACA,OAAOA,EAAK1qE,MAAM,EAAE,EAExBkoG,QAAS,yBAGJ/kG,GAAYklG,IACd,CACH9gG,MAAQmjE,IACJ,MAAM92D,EAASy0F,EAAQ9gG,MAAMmjE,GAC7B,OAAe,IAAX92D,EACO82D,EAEJ92D,CAAM,EAEjBs0F,QAAS,YAAYG,EAAQH,aAGxB,GAAK,IAAII,KACX,CACH/gG,MAAQmjE,IACJ,IAAIk6B,EACJ,IAAK,MAAMyD,KAAWC,EAAU,CAC5B,MAAM10F,EAASy0F,EAAQ9gG,MAAMmjE,IAEd,IAAX92D,IAIW,MAAXgxF,GAAmBhxF,EAAOrT,OAASqkG,EAAQrkG,UAC3CqkG,EAAUhxF,EAElB,CACA,OAAe,MAAXgxF,GAGGA,CAAO,EAElBsD,QAAS,MAAMI,EAASllG,KAAI8yB,GAAKA,EAAEgyE,UAASvhG,KAAK,WAG5C,GAAM,IAAI2hG,KACZ,CACH/gG,MAAQmjE,IACJ,IAAK,MAAM29B,KAAWC,EAAU,CAE5B,MAAM10F,EAASy0F,EAAQ9gG,MAAMmjE,GAE7B,IAAe,IAAX92D,EACA,OAAO,EAEX82D,EAAO92D,CACX,CACA,OAAO82D,CAAI,EAEfw9B,QAAS,OAAOI,EAASllG,KAAI8yB,GAAKA,EAAEgyE,UAASvhG,KAAK,WAGnD,SAAS4hG,MAAOD,GACnB,SAAS/gG,EAAM0xD,GACX,IAAI/8C,EAvII,CAAC+8C,GACNA,EAAG9zD,WAAWqB,MAAM,KAAKxG,MAAM,GAsItBwoG,CAAQvvC,GACpB,IAAK,MAAMovC,KAAWC,EAAU,CAC5B,MAAM10F,EAASy0F,EAAQ9gG,MAAM2U,GAC7B,IAAe,IAAXtI,EACA,OAAO,EAEXsI,EAAQtI,CACZ,CACA,OAAOsI,CACX,CAYA,MAAO,CACHosF,WACA1D,QAbJ,SAAiB3rC,GAEb,OAAkB,IADH1xD,EAAM0xD,EAEzB,EAWIwvC,WAVJ,SAAoBxvC,GAChB,MAAMrlD,EAASrM,EAAM0xD,GACrB,OAAe,IAAXrlD,GAGqB,IAAlBA,EAAOrT,MAClB,EAMJ,CCrHuBgoG,GADNviD,MAAjB,MAKM0iD,GAAQ,GAAIP,GAAQ,QAAS,MAC7BQ,GAAQ,GAAIR,GAAQ,QAAS,MAC7BS,GAAW,GAAIT,GAAQ,WAAY,MACnCU,GAAO,GAAIV,GAAQ,OAAQ,MA+D3BW,IAhDcP,GAAIG,GAAOvlG,GAAS6iD,OAepBuiD,GAAII,GAAOxlG,GAAS6iD,OAgBjBuiD,GAAIK,GAAUzlG,GAAS6iD,OAgB3BuiD,GAAI,GAAGM,GAAMD,GAAUF,GAAOC,IAAQxlG,GAAS6iD,OACrD,GAAImiD,GAAQ,OAAQF,GAAK34C,MAChCy5C,GAAO,GAAIZ,GAAQ,OAAQF,GAAK14C,KAChCy5C,GAAM,GAAGF,GAAMC,IACfE,GAAgB,GAAGD,GAAKH,GAAMH,GAAOC,GAAOC,IAgBrCM,GAAeX,GAAI,GAAGS,GAAK,GAAI,GAAGH,GAAMD,GAAUF,GAAOC,IAAQxlG,GAAS6iD,SAiDjFmjD,IAhCaZ,GAAIO,IAiBJP,GAAIQ,IAcLR,GAAIS,IACT,GAAIC,GAAed,GAAQ,OAAQ,OAC1CiB,GAAO,GAAIH,GAAed,GAAQ,OAAQ,MAanC,GAAMI,GAAI,GAAIY,GAAMhmG,GAAS6iD,QAcpCqjD,IADad,GAAIa,IACT,GAAIA,GAAMjB,GAAQ,QAAShlG,GAAS6iD,QAC5CsjD,GAAU,GAAIF,GAAMjB,GAAQ,WAAYhlG,GAAS6iD,OACjDujD,GAAgB,GAAGF,GAAOC,IA2B1BE,IAdcjB,GAAIc,IAaFd,GAAIe,IACb,GAAGL,GAAeE,GAAMC,GAAMC,GAAOC,KAC5C,GAAc,GAAG,GAAIE,GAAMrB,GAAQ,MAAOhlG,GAAS6iD,QAa5C,GAAauiD,GAAI,IACxB,GAAoB,GAAG,GAAIiB,GAAMrB,GAAQ,OAAQhlG,GAAS6iD,OAAY,GAAIwjD,GAAMrB,GAAQ,OAAQhlG,GAAS,GAAIglG,GAAQ,OAAQ,OAAYA,GAAQ,MAAOhlG,GAAS6iD,QAa1J,GAAmBuiD,GAAI,IAC9B,GAAgB,GAAIa,GAAMjB,GAAQ,iBAAkBhlG,GAASilG,MAAajlG,GAASilG,MAAajlG,GAAS6iD,OAalG,GAAeuiD,GAAI,IAC1B,GAAgB,GAAIe,GAASnB,GAAQ,gBAAiBhlG,GAASilG,MAAajlG,GAASilG,MAAajlG,GAAS6iD,OAapG,GAAeuiD,GAAI,IAC1B,GAAO,GAAG,GAAa,GAAmB,GAAIY,GAAMhmG,GAAS6iD,OAAY,GAAIujD,GAAepmG,GAAS6iD,OAAY,GAAIijD,GAAe9lG,GAAS6iD,OAAY,GAAe,GAAeA,MA2BhL,IAdMuiD,GAAI,IAcAA,GAbN,GAAI,GAAMJ,GAAQ,eAAgBniD,QA2BtC,GAASuiD,GAbN,GAAG,GAAI,GAAMJ,GAAQ,eAAgBA,GAAQ,UAAWhlG,GAAS6iD,OAAY,GAAI,GAAMmiD,GAAQ,UAAWhlG,GAAS6iD,OAAY,GAAImiD,GAAQ,UAAWhlG,GAAS6iD,SA2B3JuiD,GAbN,GAAG,GAAIU,GAAed,GAAQ,OAAQ,KAAUA,GAAQ,QAAShlG,GAAS6iD,OAAY,GAAIijD,GAAed,GAAQ,QAAShlG,GAAS6iD,SA2B5HuiD,GAbN,GAAG,GAAIU,GAAed,GAAQ,OAAQ,GAAG,GAAIA,GAAQ,OAAQA,GAAQ,SAAU,GAAI,KAAUA,GAAQ,WAAYhlG,GAAS6iD,OAAY,GAAIijD,GAAed,GAAQ,OAAQA,GAAQ,QAAShlG,GAAS6iD,OAAY,GAAIijD,GAAed,GAAQ,SAAUhlG,GAAS6iD,SA2BtPuiD,GAbN,GAAG,GAAIJ,GAAQ,UAAW,KAAUhlG,GAAS6iD,SCpV7D,MAAM,GACFjC,SACAC,SACAxB,MACAyB,WACA39B,MACA,WAAAlY,GACItP,KAAK0jD,OAAQ,EACb1jD,KAAKilD,SAAW,KAChBjlD,KAAKklD,SAAW,IACpB,CACA,CAACzhB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKmlD,kBAECnlD,KAAKklD,SAAStC,QAED,MAAnB5iD,KAAKmlD,WACL,MAAM,IAAI3mD,MAAM,0DAEpB,MAAM2mD,EAAanlD,KAAKmlD,WAKxB,OAJAnlD,KAAKmlD,gBAAajmD,EAElBc,KAAKilD,SAAS/gD,UACdlE,KAAKilD,SAAW,KACTE,CACX,CACA,WAAM,CAAM1+B,GAaR,OAZAzmB,KAAK0jD,OAAQ,EACb1jD,KAAKwnB,MAAQf,EACF,MAAPA,IAGAzmB,KAAKklD,SAAStC,QAAQtf,OAAM,SAC5BtjC,KAAKklD,SAAS1oB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAarwC,EAElB9U,KAAKklD,SAAShhD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAKikD,MAAMx9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAK0jD,MACtB,MAAM1jD,KAAKwnB,OAAS,IAAIhpB,MAAM,4CAGlC,KAA0B,MAAnBwB,KAAKmlD,kBACFnlD,KAAKilD,SAASrC,QAEX,MAAT5jD,EACAgB,KAAKmlD,WAAa,CAAEniB,MAAM,EAAOhkC,UAGjCgB,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAa,CAAEniB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAKklD,SAAShhD,UACdlE,KAAKklD,SAAW,WAGVP,GAAW3kD,KAAKilD,SAASrC,QAAS3oC,GAASmqC,OAAQnqC,EAC7D,ECpHG,MAAM,WAA2Bzb,MACpCuC,KAAO,qBACPgU,KAAO,qBCFJ,MAAM,WAAkCvW,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BCMJ,SAAS41F,GAAS7kD,EAAQhpB,GAC7B,MAAM8tE,ECCH,SAAkB9kD,EAAQhpB,EAAO,CAAC,GACrC,MAAMhuB,ECJH,SAAoBg3C,EAAQhpB,GAC/B,MAAMptB,EL+FC,IAAI,GK9FXo2C,EAAOG,KAAKv2C,GAAO4zB,OAAM6J,MAAO1mB,UACtB/W,EAAMzI,IAAIwf,EAAI,IAExBq/B,EAAOG,KAAO9Y,MAAOhnC,IACjB,UAAW,MAAMqJ,KAAOrJ,QACduJ,EAAMlP,KAAKgP,SAEfE,EAAMzI,KAAK,EAErB,IAAId,EAAS2/C,EAAO3/C,OACkB,MAAlC2/C,EAAO3/C,OAAOs9B,OAAOyb,UACrB/4C,EAAS2/C,EAAO3/C,OAAOs9B,OAAOyb,YAEc,MAAvC4G,EAAO3/C,OAAOs9B,OAAOC,iBAC1Bv9B,EAAS2/C,EAAO3/C,OAAOs9B,OAAOC,kBAElC,MAAM2vD,EAAa,IAAIr0C,GAiDvB,MAhDU,CACN9hC,KAAMiwB,MAAOlzB,IAET,GADAA,GAASmqC,QAAQC,iBACK,MAAlBpqC,GAASnL,MAAe,CAExB,MAAM,KAAEk0B,EAAI,MAAEhkC,SAAgB2lD,GAAWx+C,EAAOkC,OAAQ4R,GAASmqC,QACjE,OAAa,IAATphB,EACO,KAEJhkC,CACX,CACA,KAAOq0F,EAAW7iF,WAAayJ,EAAQnL,OAAO,CAC1C,MAAM,MAAE9P,EAAK,KAAEgkC,SAAe2hB,GAAWx+C,EAAOkC,OAAQ4R,GAASmqC,QACjE,IAAa,IAATphB,EACA,MAAM,IAAI,GAAmB,2BAEjCqwD,EAAWl0C,OAAOngD,EACtB,CACA,MAAMwQ,EAAM6jF,EAAWzzC,QAAQ,EAAG3lC,EAAQnL,OAE1C,OADAukF,EAAW9zC,QAAQtlC,EAAQnL,OACpBU,CAAG,EAEdE,MAAOy9B,MAAOxD,EAAM1vB,KAChBA,GAASmqC,QAAQC,iBAEb1a,aAAgB15B,iBACVP,EAAMlP,KAAKmpC,EAAM1vB,SAGjBvK,EAAMlP,KAAKmpC,EAAK1nB,WAAYhI,EACtC,EAEJs5E,OAAQ,KACJ,GAAIF,EAAW7iF,WAAa,EAAG,CAC3B,MAAMgjF,EAAiB1tC,EAAO3/C,OAC9B2/C,EAAO3/C,OAAUgnC,mBACY,IAArBrQ,GAAM22D,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAO1tC,CAAM,EAIzB,CDhEkB,CAAWA,EAAQhpB,GACP,MAAtBA,EAAKwlB,eAAiD,MAAxBxlB,EAAKulB,kBAGnCvlB,EAAKulB,gBAAkB,EAAsBvlB,EAAKwlB,gBAEtD,MAAMqxC,EAAe72D,GAAMslB,eAAiB,EACtCZ,EAAe1kB,GAAM2kB,eAAiB,EAmD5C,MAlDU,CACNvkC,KAAMiwB,MAAOlzB,IACT,IAAIkoC,GAAc,EAClB,MAAMyxC,EAAe,IAAI50C,GACzB,OAAa,CAET40C,EAAaz0C,aAAarwC,EAAMoO,KAAK,IAC9BjD,EACHnL,MAAO,KAEX,IACIqzC,EAAawxC,EAAaC,EAC9B,CACA,MAAOntE,GACH,GAAIA,aAAe+P,WACf,SAEJ,MAAM/P,CACV,CACA,GAAI07B,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzBrlB,GAAMulB,iBAA2BuxC,EAAapjF,WAAassB,EAAKulB,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvBrlB,GAAMwlB,eAAyBH,EAAarlB,EAAKwlB,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAOxzC,EAAMoO,KAAK,IACXjD,EACHnL,MAAOqzC,GACT,EAENzyC,MAAOy9B,MAAOxD,EAAM1vB,WAEVnL,EAAMY,MAAM,IAAIsvC,GAAewC,EAAa7X,EAAKn5B,YAAam5B,GAAO1vB,EAAQ,EAEvF45E,OAAQ1mD,MAAOxD,EAAM1vB,KACjB,MAAM4lC,EAAO,IAAIb,MAAkBrV,EAAKmqD,SAAQtkF,GAAO,CAAEgyC,EAAahyC,EAAIgB,YAAahB,YAEjFV,EAAMY,MAAMmwC,EAAM5lC,EAAQ,EAEpCs5E,OAAQ,IACGzkF,EAAMykF,SAIzB,CD7De,CAASztC,EAAQhpB,GACtBm8C,EAAI,CACN/7D,KAAMiwB,MAAO2Q,EAAO7jC,KAEhB,MAAMjb,QAAc4rG,EAAG1tF,KAAKjD,GAC5B,OAAO6jC,EAAM9hC,OAAOhd,EAAM,EAE9B0Q,MAAOy9B,MAAO3gC,EAASsxC,EAAO7jC,WAEpB2wF,EAAGl7F,MAAMouC,EAAM5oC,OAAO1I,GAAUyN,EAAQ,EAElD45E,OAAQ1mD,MAAOuG,EAAUoK,EAAO7jC,WAEtB2wF,EAAG/W,OAAOngD,EAASpvC,KAAIkI,GAAWsxC,EAAM5oC,OAAO1I,KAAWyN,EAAQ,EAE5E4wF,GAAK/sD,IACM,CACH5gC,KAAMiwB,MAAOlzB,GAAYg/D,EAAE/7D,KAAK4gC,EAAO7jC,GACvCvK,MAAOy9B,MAAO1wB,EAAGxC,IAAYg/D,EAAEvpE,MAAM+M,EAAGqhC,EAAO7jC,GAC/C45E,OAAQ1mD,MAAO1wB,EAAGxC,IAAYg/D,EAAE4a,OAAOp3E,EAAGqhC,EAAO7jC,GACjDs5E,OAAQ,IAAMta,IAGtBsa,OAAQ,IACGqX,EAAGrX,UAGlB,OAAOta,CACX,CGlDO,IAAI,IACX,SAAW6xB,GACP,IAAIx4D,EACJw4D,EAASzjE,MAAQ,KACC,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAgB9B,IAf6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEqB,MAAvB1Q,EAAIw4F,kBACJh3F,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIw4F,kBAEO,MAApBx4F,EAAIy4F,eACJj3F,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIy4F,eAEI,MAAjBz4F,EAAIo6D,YACJ54D,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIo6D,YAEO,MAAnBp6D,EAAI04F,YACJ,IAAK,MAAMjsG,KAASuT,EAAI04F,YACpBl3F,EAAE1D,OAAO,IACT0D,EAAEjF,MAAM9P,GAOhB,GAJwB,MAApBuT,EAAI24F,eACJn3F,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI24F,eAEK,MAAjB34F,EAAIw1C,UACJ,IAAK,MAAM/oD,KAASuT,EAAIw1C,UACpBh0C,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAGW,MAAxBuT,EAAI44F,mBACJp3F,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAI44F,oBAEa,IAAzBruE,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACR04F,YAAa,GACbljD,UAAW,IAET9gD,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIw4F,gBAAkBzrF,EAAO/O,SAC7B,MAEJ,KAAK,EACDgC,EAAIy4F,aAAe1rF,EAAO/O,SAC1B,MAEJ,KAAK,EACDgC,EAAIo6D,UAAYrtD,EAAOxQ,QACvB,MAEJ,KAAK,EACD,GAAgC,MAA5BguB,EAAKsW,QAAQ63D,aAAuB14F,EAAI04F,YAAYxpG,SAAWq7B,EAAKsW,OAAO63D,YAC3E,MAAM,IAAIn5D,GAAe,gEAE7Bv/B,EAAI04F,YAAYzqG,KAAK8e,EAAOxQ,SAC5B,MAEJ,KAAK,EACDyD,EAAI24F,aAAe5rF,EAAOxQ,QAC1B,MAEJ,KAAK,EACD,GAA8B,MAA1BguB,EAAKsW,QAAQ2U,WAAqBx1C,EAAIw1C,UAAUtmD,SAAWq7B,EAAKsW,OAAO2U,UACvE,MAAM,IAAIjW,GAAe,8DAE7Bv/B,EAAIw1C,UAAUvnD,KAAK8e,EAAO/O,UAC1B,MAEJ,KAAK,EACDgC,EAAI44F,iBAAmB7rF,EAAOxQ,QAC9B,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXw4D,EAAS51F,OAAU3C,GACR89B,GAAc99B,EAAKu4F,EAASzjE,SAEvCyjE,EAAS9uF,OAAS,CAACxM,EAAKstB,IACbsK,EAAc53B,EAAKs7F,EAASzjE,QAASvK,EAEnD,CAvGD,CAuGG,KAAa,GAAW,CAAC,ICvGrB,MAAMsuE,GACO,OADPA,GAEA,IAFAA,GAGU,EAHVA,GAIW,EAJXA,GAKa,GALbA,GCE4B,KDF5BA,IAOY,EAPZA,IASe,EAgIrB,MAAMC,GACTt3C,KACA7L,SACAojD,QACA1kF,QACAsgC,OACAwmB,WACAxX,UACAyF,UACA4vC,eACAphD,kBACAqhD,mBACAC,eACAC,qBACA5qG,OACA6qG,uBACAvgG,IACA,WAAAkE,CAAYi5C,EAAY18C,GAlIrB,IAAyB+/F,EAAUZ,EAmIlChrG,KAAKkoD,SAAWr8C,EAAKq8C,SACrBloD,KAAKsrG,SAAU,EACftrG,KAAKknD,OAASqB,EAAWrB,OACzBlnD,KAAK0tE,WAAanlB,EAAWmlB,WAC7B1tE,KAAKk2D,UAAY3N,EAAW2N,UAC5Bl2D,KAAK27D,UAAYpT,EAAWoT,UAC5B37D,KAAKurG,eAAiBhjD,EAAWgjD,eACjCvrG,KAAKc,OAASynD,EAAWznD,OACzBd,KAAKoL,IAAMS,EAAKT,IAChBpL,KAAK4mB,QAAU/a,EAAK+a,SAAWwkF,GAC/BprG,KAAKmqD,kBAAoBt+C,EAAKs+C,mBAAqBihD,GACnDprG,KAAKwrG,mBAAqB3/F,EAAK2/F,oBAAsBJ,GACrDprG,KAAKyrG,eAAiB5/F,EAAK4/F,gBAAkBL,GAC7CprG,KAAK0rG,qBAAuB7/F,EAAK6/F,sBAAwBN,GACzDprG,KAAK2rG,uBAAyB9/F,EAAK8/F,wBAA0BP,GAE7DprG,KAAK+zD,KAAO,CACRg3C,gBAAiB,GAAGl/F,EAAKggG,gBAAkBT,WAC3CJ,cArJoBY,EAqJUrjD,EAAWqjD,SArJXZ,EAqJqBn/F,EAAKm/F,aApJ5C,MAAhBA,EACOA,EAEJY,EAAS/wE,WAmJhB,CACA,SAAA+hC,GACI,OAAO58D,KAAKsrG,OAChB,CACA,WAAMtkG,GACEhH,KAAKsrG,gBAGHtrG,KAAKk2D,UAAU7yC,MAAMrjB,KAAKknD,OAAQ,CACpCmB,SAAU,CACNyjD,aAAc,GAAqB9rG,KAAK+zD,KAAKi3C,cAC7Ce,gBAAiB,GAAqB/rG,KAAK+zD,KAAKg3C,0BAGlD/qG,KAAK27D,UAAU1R,OAAOjqD,KAAKkoD,UAAWve,IACnC3pC,KAAKgsG,eAAeriE,GAAMrG,OAAM7c,IACjCzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GACrB,GACH,CACC0jC,kBAAmBnqD,KAAKmqD,kBACxBqhD,mBAAoBxrG,KAAKwrG,mBACzBG,uBAAwB3rG,KAAK2rG,yBAEjC3rG,KAAKsrG,SAAU,EACnB,CACA,UAAMhlF,SACItmB,KAAK27D,UAAUswC,SAASjsG,KAAKkoD,UACnCloD,KAAKsrG,SAAU,CACnB,EEpMG,MAAMR,WAAiBO,GAC1B,WAAA/7F,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5BukC,MAAMmY,EAAY,IACX18C,EACHq8C,SAAU,IAAIr8C,EAAKggG,gBAAkBT,cACrChgG,IAAKm9C,EAAW5K,OAAO8lD,aAAa,sBAEpC53F,EAAKqgG,qBAAuBd,KAE5B7iD,EAAWznD,OAAOyjD,iBAAiB,mBAAoBjkD,IACnD,MAAMmnD,EAAannD,EAAIwnD,OACvB9nD,KAAKmsG,SAAS1kD,GACTnkB,OAAM7c,IACHA,EAAI1lB,OAASgqE,GAAyBhqE,MAI1Cf,KAAKoL,IAAIoc,MAAM,mDAAoDf,EAAI,GACzE,GAGd,CACA,CAAC2rE,IAAuB,CACpB,oBAEJ,eAAMga,CAAU3kD,EAAYxtC,EAAU,CAAC,GACnC,IAAImsC,EACJ,GAAsB,MAAlBnsC,EAAQmqC,OAAgB,CACxB,MAAMA,EAASioD,YAAYzlF,QAAQ5mB,KAAK4mB,SAExC3M,EAAU,IACHA,EACHmqC,SAER,CACA,IACIgC,QAAeqB,EAAWE,UAAU3nD,KAAKkoD,SAAU,IAC5CjuC,EACH0xF,uBAAwB3rG,KAAK2rG,yBAEjC,MAAMd,EAAKF,GAASvkD,EAAQ,CACxB9D,cAAetiD,KAAKyrG,iBACrBZ,GAAG,IACAr+F,QAAgBq+F,EAAG3tF,KAAKjD,GAE9B,aADMmsC,EAAOkmD,MAAMryF,GACZzN,CACX,CACA,MAAOia,GAEH,MADA2/B,GAAQghB,MAAM3gD,GACRA,CACV,CACJ,CACA,cAAM0lF,CAAS1kD,EAAYxtC,EAAU,CAAC,GAClC,MAAMzN,QAAgBxM,KAAKosG,UAAU3kD,EAAYxtC,IAC3C,UAAE0yD,EAAS,UAAE5kB,EAAS,aAAEmjD,GAAiB1+F,EAC/C,GAAiB,MAAbmgE,EACA,MAAM,IAAI3B,GAAoB,gDAElC,MACMt6D,EAAKmiF,GADCb,GAAsBrlB,GACLM,SAC7B,IAAKxlB,EAAWsD,WAAWzc,OAAO59B,GAC9B,MAAM,IAAIs6D,GAAoB,oDAElC,GAAIhrE,KAAKknD,OAAO5Y,OAAO59B,GACnB,MAAM,IAAIs6D,GAAoB,uCAMlC,OAFAhrE,KAAKusG,wBAAwBrB,GAC7BlrG,KAAKoL,IAAI,kDAAmDsF,EAAIq3C,GF9CjE5a,eAAsC+oB,EAAWp1D,EAAQsK,EAAKq8C,EAAYj7C,GAE7E,GADApB,EAAI,4BAA6Bq8C,EAAWsD,YAC7B,MAAXv+C,EACA,MAAM,IAAIw+D,GAAoB,iCAElC,MAAMnjB,EAAO,CAAC,EAUd,GATIr7C,EAAQy+F,YAAYxpG,OAAS,IAC7BomD,EAAKk/C,UAAYv6F,EAAQy+F,YAAY3mG,KAAIkL,IAAO,CAC5Cg9F,aAAa,EACb1F,UAAW,GAAUt3F,QAGzBhD,EAAQu7C,UAAUtmD,OAAS,IAC3BomD,EAAKE,UAAYv7C,EAAQu7C,WAEJ,MAArBv7C,EAAQmgE,UAAmB,CAC3B,MAAMA,EAAYqlB,GAAsBxlF,EAAQmgE,WAEhD,IADeomB,GAAoBpmB,GACvBr+B,OAAOmZ,EAAWsD,YAC1B,MAAM,IAAIigB,GAAoB,0CAElCnjB,EAAK8kB,UAAYA,CACrB,CACA,IAAIhuB,EAEJ,GAAgC,MAA5BnyC,EAAQ2+F,iBAA0B,CAClC//F,EAAIm4F,MAAM,oCAAqC97C,EAAWsD,YAC1D,IAAI0hD,EAAqBjgG,EAAQ2+F,iBACjC,MAAMnD,QAAiBL,GAAe+E,eAAeD,EAAoB7F,GAAWO,QACpF,IAAIF,EAAaL,GAAWqB,mBAAmBD,EAASj1D,SACxD,MAAM45D,EAAe9Z,GAAcmV,EAASr7B,UAAUM,SAEtD,IAAKg6B,EAAW//C,OAAO5Y,OAAOq+D,GAC1B,MAAM,IAAI3hC,GAAoB,uDAGlC,IAAKvjB,EAAWsD,WAAWzc,OAAO24D,EAAW//C,QACzC,MAAM,IAAI8jB,GAAoB,4CAElC,IAAI4hC,EACJ,IACIA,QAAqB12C,EAAU92D,IAAI6nG,EAAW//C,OAClD,CACA,MAAOzgC,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,GAAoB,MAAhBmmF,IAEA/kD,EAAKQ,SAAWukD,EAAavkD,SAEU,MAAnCukD,EAAaH,oBAA4B,CACzC,MAAMI,QAAuBlF,GAAeM,mBAAmB2E,EAAaH,oBACtEK,EAAelG,GAAWqB,mBAAmB4E,EAAe95D,SAE9D+5D,EAAa5F,WAAaD,EAAWC,YACrC97F,EAAI,2FAA4F0hG,EAAa5F,UAAWD,EAAWC,WACnID,EAAa6F,EACbL,EAAqBG,EAAaH,mBAE1C,CAGJ5kD,EAAK4kD,mBAAqBA,EAE1B5kD,EAAKk/C,UAAYE,EAAWb,WAAW9hG,KAAIwiG,IAAa,CACpD0F,aAAa,EACb1F,gBAEJnoD,EAAS,CACL0pC,IAAK4e,EAAWC,UAChBH,UAAWE,EAAWb,WAE9B,MAEIh7F,EAAI,uCAAwCq8C,EAAWsD,YAI3D,GAFA3/C,EAAIm4F,MAAM,mBAAoB97C,EAAWsD,WAAYlD,SAC/CqO,EAAU62C,MAAMtlD,EAAWsD,WAAYlD,GACjB,MAAxBr7C,EAAQw+F,cAAmD,MAA3Bx+F,EAAQu+F,gBAAyB,CACjE,MAAM1iD,EAAW,CAAC,EACU,MAAxB77C,EAAQw+F,eACR3iD,EAASyjD,aAAe,GAAqBt/F,EAAQw+F,eAE1B,MAA3Bx+F,EAAQu+F,kBACR1iD,EAAS0jD,gBAAkB,GAAqBv/F,EAAQu+F,kBAE5D3/F,EAAIm4F,MAAM,sBAAuB97C,EAAWsD,WAAY1C,SAClD6N,EAAU7yC,MAAMokC,EAAWsD,WAAY,CACzC1C,YAER,CACA,MAAMvzC,EAAS,CACXoyC,OAAQO,EAAWsD,WACnBggD,gBAAiBv+F,EAAQu+F,gBACzBC,aAAcx+F,EAAQw+F,aACtBr+B,UAAWngE,EAAQmgE,UACnBs+B,YAAaz+F,EAAQy+F,YAAY3mG,KAAIkL,GAAO,GAAUA,KACtD07F,aAAsC,MAAxB1+F,EAAQ0+F,kBAAuBhsG,EAAY,GAAUsN,EAAQ0+F,cAC3EnjD,UAAWv7C,EAAQu7C,UACnBojD,iBAAkBxsD,EAClB8I,cAGJ,OADA3mD,EAAO8rD,kBAAkB,gBAAiB,CAAE9E,OAAQhzC,IAC7CA,CACX,CE3Dek4F,CAAuBhtG,KAAKk2D,UAAWl2D,KAAKc,OAAQd,KAAKoL,IAAKq8C,EAAYj7C,EACrF,CACA,uBAAA+/F,CAAwBrB,GACpB,MAAM+B,EFjEP,SAA2B99C,GAC9B,GAAY,MAARA,GAAgBA,EAAK1tD,OAAS,EAC9B,IACI,OAAO,GAAU0tD,EACrB,CACA,MACA,CAER,CEyDkC+9C,CAAkBhC,GACnB,MAArB+B,IAGJjtG,KAAKoL,IAAIm4F,MAAM,8BAA+B0J,GAC1ChE,GAAUgE,GACVjtG,KAAKoL,IAAIm4F,MAAM,oCAhFT,KAmFK0J,EAAkBj6C,eACtB,GAAG,IC5Ff,SAAyBmH,GAC5B,IACI,OAAQ9yB,EAAOroC,IAAUm7D,EAAGnH,eAC5B,GAAa,MAATh0D,EACA,OAAO,EAEX,GAVU,KAUNqoC,EACA,OCDuBlU,EDCSn0B,ECA1B,IAAI,GDAU,YCCfg1B,SAASb,EDCtB,CACA,MACA,CCLG,IAA4BA,EDM/B,OAAO,CACX,CD+E2Cg6E,CAAgBF,GAI/C,GAAItD,WAAWsD,KAOnBjtG,KAAKoL,IAAIm4F,MAAM,gCACfvjG,KAAKurG,eAAe6B,gBAAgBH,IAXhCjtG,KAAKoL,IAAIm4F,MAAM,kEAYvB,CAKA,oBAAMyI,CAAeriE,GACjB,MAAM,WAAE8d,EAAU,OAAErB,GAAWzc,EACzBya,EAASioD,YAAYzlF,QAAQ5mB,KAAK4mB,SAExC,IACI,MAAMu/E,QAAiBnmG,KAAKk2D,UAAU92D,IAAIY,KAAKknD,QACzCk/C,EAAapmG,KAAKurG,eAAe8B,eAAe/oG,KAAI61D,GAAMA,EAAGtF,gBAAgB,GAAU,OAAO9/C,QACpG,IAAIo2F,EAAmBhF,EAASsG,mBAChC,GAAIrG,EAAW3kG,OAAS,GAAyB,MAApB0pG,EAA0B,CACnD,MAAMlE,EAAa,IAAIL,GAAW,CAC9B1/C,OAAQlnD,KAAKknD,OACbk/C,eAGJ+E,SADuBxD,GAAe2F,KAAKrG,EAAYjnG,KAAK0tE,aAChC45B,UAAUrlF,UAC1C,CACA,IAAIipF,EAAezjD,EAAW8lD,WAAWz+F,MACpCs7F,GAAatE,QAAQr+C,EAAW8lD,cACjCrC,OAAehsG,GAEnB,MAAM2rG,EAAKF,GAASvkD,GAAQykD,GAAG,UACzBA,EAAGn7F,MAAM,CACXq7F,gBAAiB/qG,KAAK+zD,KAAKg3C,gBAC3BC,aAAchrG,KAAK+zD,KAAKi3C,aACxBr+B,UAAWK,GAAoBhtE,KAAK0tE,WAAWf,WAC/Cs+B,YAAa7E,EAAW9hG,KAAI6qD,GAAQA,EAAKrgD,QACzCq8F,mBACAD,eACAnjD,UAAWo+C,EAASp+C,WACrB,CACC3D,iBAEEgC,EAAOkmD,MAAM,CACfloD,UAER,CACA,MAAO39B,GACHzmB,KAAKoL,IAAIoc,MAAM,wCAAyCf,GACxD2/B,EAAOghB,MAAM3gD,EACjB,CACJ,EG/GG,SAAS0lF,GAAStgG,EAAO,CAAC,GAC7B,OAAQ08C,GAAe,IAAIuiD,GAAcviD,EAAY18C,EACzD,CC5CO,SAAS2hG,GAAYrnG,EAAQiF,GAChC,MAAMw6B,ECHH,SAAqBrzB,GACxB,GAAW,MAAPA,EAAa,CACb,GAAoC,mBAAzBA,EAAIkxB,OAAOyb,UAClB,OAAO3sC,EAAIkxB,OAAOyb,YAEtB,GAAyC,mBAA9B3sC,EAAIkxB,OAAOC,eAClB,OAAOnxB,EAAIkxB,OAAOC,iBAEtB,GAAwB,mBAAbnxB,EAAIlK,KACX,OAAOkK,CAEf,CACA,MAAM,IAAI/T,MAAM,0CACpB,CDVgBivG,CAAYtnG,GAAQ09B,WEH7B,IAAmBud,EACT,OADSA,EFIRxb,IEAe,mBAAfwb,EAAM7d,MACO,mBAAhB6d,EAAM9d,OACY,mBAAlB8d,EAAMkvC,SFDb1qD,EAAItC,OAAM7c,IACNrb,EAAIoc,MAAM,qCAAsCf,EAAI,GAGhE,CGRA,MAEMinF,GAAmB,KACxB,MAAMlmF,EAAQ,IAAIhpB,MAAM,iBAExB,OADAgpB,EAAMzmB,KAAO,aACNymB,CAAK,EAGPmmF,GAAe,IAAI//D,QAoDzB,GAlDO,UAAsBrnB,aAAcqnF,EAAc/mF,WAAYgnF,GAAc,CAAC,GAEnF,MAAO,CAACC,GAAe9uG,QAAOolD,UAAU,CAAC,KAExC,GAAIA,GAAQQ,QACX,OAAOroB,QAAQC,OAAOkxE,MAGvB,IAAIK,EACAC,EACAC,EACJ,MAAM1uG,EAAQquG,GAAgBrnF,aAExB2nF,EAAiB,KACtB3uG,EAAMwuG,GACNE,EAAeP,KAAmB,EAS7BS,EAAe,IAAI5xE,SAAQ,CAACr4B,EAASs4B,KAC1CwxE,EAAS,KANL5pD,GACHA,EAAOK,oBAAoB,QAASypD,GAOpChqG,EAAQlF,EAAM,EAGfivG,EAAiBzxE,EACjBuxE,GAAaF,GAAchnF,YAAYmnF,EAAQF,EAAa,IAa7D,OAVI1pD,GACHA,EAAOG,iBAAiB,QAAS2pD,EAAgB,CAACnuG,MAAM,IAGzD4tG,GAAaruG,IAAI6uG,GAAc,KAC9B5uG,EAAMwuG,GACNA,EAAY,KACZC,GAAQ,IAGFG,CAAY,CAErB,CAEcC,GCxDP,MAAMC,WAAuB7vG,MAChC8vG,gBACAC,aACAC,eACAC,kBACA,WAAAn/F,CAAY9C,EAAU,sBAAuBkiG,GACzCt+D,MAAM5jC,GACNxM,KAAKe,KAAO,iBACZf,KAAKsuG,gBAAkBI,EAAMJ,gBAC7BtuG,KAAKuuG,aAAeG,EAAMH,aAC1BvuG,KAAKwuG,eAAiBE,EAAMF,eAC5BxuG,KAAKyuG,kBAAoBC,EAAMD,iBACnC,EAEG,MAAME,WAAuBnwG,MAChCqrD,YAAc,iBACd,WAAAv6C,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,gBAChB,ECpBG,MAAM6tG,GACTC,cACAp0B,OACAq0B,SACAC,cACAC,WACAC,qBACAC,UACA,WAAA5/F,CAAYwtB,EAAO,CAAC,GAChB98B,KAAKy6E,OAAS39C,EAAK29C,QAAU,EAC7Bz6E,KAAK8uG,SAAWhyE,EAAKgyE,UAAY,EACjC9uG,KAAK+uG,cAAgBjyE,EAAKiyE,eAAiB,EAC3C/uG,KAAKgvG,WAAalyE,EAAKkyE,aAAc,EACrChvG,KAAKivG,qBAAuBnyE,EAAKmyE,sBAAyC,IAAhBjvG,KAAK8uG,SAAkB9uG,KAAKy6E,OACtFz6E,KAAKkvG,UAAYpyE,EAAKoyE,WAAa,QACnClvG,KAAK6uG,cAAgB,IAAIM,EAC7B,CACA,aAAM5vD,CAAQxgD,EAAKqwG,EAAkB,EAAGn1F,EAAU,CAAC,GAC/C,MAAMo1F,EAAQrvG,KAAKsvG,OAAOvwG,GACpBwwG,EAAcvvG,KAAKwvG,mBAAmBv1F,GAC5C,IAAI2rB,EAAM5lC,KAAK6uG,cAAcY,OAAOJ,EAAOD,EAAiBG,GAE5D,GADA3pE,EAAI0oE,gBAAkBrlG,KAAK1K,IAAIyB,KAAKy6E,OAAS70C,EAAI4oE,eAAgB,GAC7D5oE,EAAI4oE,eAAiBxuG,KAAKy6E,OAM1B,MAJIz6E,KAAK+uG,cAAgB,GAAKnpE,EAAI4oE,gBAAmBxuG,KAAKy6E,OAAS20B,IAE/DxpE,EAAM5lC,KAAK6uG,cAAcvvG,IAAI+vG,EAAOzpE,EAAI4oE,eAAgBxuG,KAAK+uG,gBAE3D,IAAIV,GAAe,sBAAuBzoE,GAE/C,GAAI5lC,KAAKgvG,YAAcppE,EAAI2oE,aAAe,IAAM3oE,EAAI6oE,kBAAmB,CAExE,IAAIiB,EAAUzmG,KAAK01B,KAAKiH,EAAI2oE,cAAgB3oE,EAAI0oE,gBAAkB,IAC9DoB,EAAU1vG,KAAKivG,uBACfS,EAAU9pE,EAAI4oE,eAAiBxuG,KAAKivG,4BAElC,GAAMS,EAChB,CACA,OAAO9pE,CACX,CACA,OAAA+pE,CAAQ5wG,EAAK07E,EAAS,EAAGxgE,EAAU,CAAC,GAChC,MAAMo1F,EAAQrvG,KAAKsvG,OAAOvwG,GACpBwwG,EAAcvvG,KAAKwvG,mBAAmBv1F,GACtC2rB,EAAM5lC,KAAK6uG,cAAcY,OAAOJ,EAAO50B,EAAQ80B,GAErD,OADA3pE,EAAI0oE,gBAAkBrlG,KAAK1K,IAAIyB,KAAKy6E,OAAS70C,EAAI4oE,eAAgB,GAC1D5oE,CACX,CACA,MAAAgqE,CAAO7wG,EAAK07E,EAAS,EAAGxgE,EAAU,CAAC,GAC/B,MAAMo1F,EAAQrvG,KAAKsvG,OAAOvwG,GACpBwwG,EAAcvvG,KAAKwvG,mBAAmBv1F,GACtC2rB,EAAM5lC,KAAK6uG,cAAcY,OAAOJ,GAAQ50B,EAAQ80B,GAEtD,OADA3pE,EAAI0oE,gBAAkBrlG,KAAK1K,IAAIyB,KAAKy6E,OAAS70C,EAAI4oE,eAAgB,GAC1D5oE,CACX,CAOA,KAAAnxB,CAAM1V,EAAKwwG,GACP,MAAMM,EAA2B,IAAdN,EACbO,EAAa9vG,KAAKy6E,OAAS,EAEjC,OADAz6E,KAAK6uG,cAAcvvG,IAAIU,KAAKsvG,OAAOvwG,GAAM+wG,EAAYP,GAC9C,CACHjB,gBAAiB,EACjBC,aAA6B,IAAfsB,GAAoB,EAAIA,EACtCrB,eAAgBsB,EAChBrB,mBAAmB,EAE3B,CACA,GAAAnvG,CAAIP,EAAK07E,EAAQ80B,EAAc,GAC3B,MAAMM,EAAgE,KAAlDN,GAAe,EAAIA,EAAcvvG,KAAK8uG,UAE1D,OADA9uG,KAAK6uG,cAAcvvG,IAAIU,KAAKsvG,OAAOvwG,GAAM07E,EAAQ80B,GAC1C,CACHjB,gBAAiB,EACjBC,aAA6B,IAAfsB,GAAoB,EAAIA,EACtCrB,eAAgB/zB,EAChBg0B,mBAAmB,EAE3B,CACA,GAAArvG,CAAIL,GACA,MAAM6mC,EAAM5lC,KAAK6uG,cAAczvG,IAAIY,KAAKsvG,OAAOvwG,IAI/C,OAHW,MAAP6mC,IACAA,EAAI0oE,gBAAkBrlG,KAAK1K,IAAIyB,KAAKy6E,OAAS70C,EAAI4oE,eAAgB,IAE9D5oE,CACX,CACA,OAAO7mC,GACHiB,KAAK6uG,cAAcxnD,OAAOrnD,KAAKsvG,OAAOvwG,GAC1C,CACA,kBAAAywG,CAAmBv1F,GACf,OAA+B,MAA3BA,GAAS81F,gBAA0B91F,EAAQ81F,gBAAkB,EACtD91F,EAAQ81F,eAEZ/vG,KAAK8uG,QAChB,CACA,MAAAQ,CAAOvwG,GACH,OAAOiB,KAAKkvG,UAAUztG,OAAS,EAAI,GAAGzB,KAAKkvG,aAAanwG,IAAQA,CACpE,CACA,QAAAixG,CAASX,GACL,OAAOA,EAAM5nG,UAAUzH,KAAKkvG,UAAUztG,OAC1C,EAEG,MAAM0tG,GACT90E,QACA,WAAA/qB,GACItP,KAAKq6B,QAAU,IAAIwT,GACvB,CACA,MAAA4hE,CAAO1wG,EAAKC,EAAOixG,GACf,MAAMC,EAAWlwG,KAAKq6B,QAAQj7B,IAAIL,GAClC,GAAgB,MAAZmxG,EAAkB,CAClB,MAAMC,EAAwC,MAAtBD,EAASE,UAC3BF,EAASE,UAAUzpF,WAAY,IAAInc,MAAOmc,WACzC,EACP,OAA0B,MAAtBupF,EAASE,WAAqBD,EAAkB,GAEhDD,EAASlxG,OAASA,EACX,CACHsvG,gBAAiB,EACjBC,aAAc4B,EACd3B,eAAgB0B,EAASlxG,MACzByvG,mBAAmB,IAGpBzuG,KAAKV,IAAIP,EAAKC,EAAOixG,EAChC,CACA,OAAOjwG,KAAKV,IAAIP,EAAKC,EAAOixG,EAChC,CACA,GAAA3wG,CAAIP,EAAKC,EAAOixG,GACZ,MAAMI,EAA2B,IAAdJ,EACbC,EAAWlwG,KAAKq6B,QAAQj7B,IAAIL,GAClB,MAAZmxG,GACA3pF,aAAa2pF,EAASnC,WAE1B,MAAMlG,EAAS,CACX7oG,QACAoxG,UAAWC,EAAa,EAAI,IAAI7lG,KAAKA,KAAKu2D,MAAQsvC,QAAcnxG,GAWpE,OATAc,KAAKq6B,QAAQ/6B,IAAIP,EAAK8oG,GAClBwI,EAAa,IACbxI,EAAOkG,UAAYlnF,YAAW,KAC1B7mB,KAAKq6B,QAAQgtB,OAAOtoD,EAAI,GACzBsxG,GAC2B,MAA1BxI,EAAOkG,UAAUjnF,OACjB+gF,EAAOkG,UAAUjnF,SAGlB,CACHwnF,gBAAiB,EACjBC,aAA6B,IAAf8B,GAAoB,EAAIA,EACtC7B,eAAgB3G,EAAO7oG,MACvByvG,mBAAmB,EAE3B,CACA,GAAArvG,CAAIL,GACA,MAAMmxG,EAAWlwG,KAAKq6B,QAAQj7B,IAAIL,GAClC,GAAgB,MAAZmxG,EAIA,MAAO,CACH5B,gBAAiB,EACjBC,aAL0C,MAAtB2B,EAASE,UAC3BF,EAASE,UAAUzpF,WAAY,IAAInc,MAAOmc,WACzC,EAIH6nF,eAAgB0B,EAASlxG,MACzByvG,mBAAmB,EAG/B,CACA,OAAO1vG,GACH,MAAM8oG,EAAS7nG,KAAKq6B,QAAQj7B,IAAIL,GAChC,OAAc,MAAV8oG,IACwB,MAApBA,EAAOkG,WACPxnF,aAAashF,EAAOkG,WAExB/tG,KAAKq6B,QAAQgtB,OAAOtoD,IACb,EAGf,ECrLG,IAAIuxG,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,GAAmB5xG,OAAOmd,OAAO,CAC1C,EAAG,aACH,EAAG,mBACH,EAAG,oBACH,EAAG,iBACH,EAAG,kBACH,EAAG,iBACH,EAAG,oBAEM00F,GAAwB7xG,OAAOmd,OAAO,CAC/C20F,WAAYH,GAAaG,WACzBC,QAASJ,GAAaK,kBACtBC,MAAON,GAAaO,gBACpBC,MAAOR,GAAaS,kBAEXC,GAAuBryG,OAAOmd,OAAO,CAC9C40F,QAASJ,GAAaW,iBACtBL,MAAON,GAAaY,eACpBJ,MAAOR,GAAaa,iBCzBXC,GAAe,GAAK,GAE1B,MAAM,GACTC,QACAC,YACAC,gBACAC,gCACA,WAAAliG,CAAYm8F,EAAiB2F,GAAcK,EANb,SAO1BzxG,KAAKqxG,QAAU,IAAIryD,GACnBh/C,KAAKsxG,YAAc,KACnBtxG,KAAKuxG,gBAAkB9F,EACvBzrG,KAAKwxG,gCAAkCC,CAC3C,CACA,KAAA/hG,CAAM2N,GACF,GAAa,MAATA,GAAkC,IAAjBA,EAAM5b,OACvB,MAAO,GAGX,GADAzB,KAAKqxG,QAAQlyD,OAAO9hC,GAChBrd,KAAKqxG,QAAQ7gG,WAAaxQ,KAAKwxG,gCAC/B,MAAM,IAAIxmC,GAAoB,6CAElC,MAAMoX,EAAO,GACb,KAA+B,IAAxBpiF,KAAKqxG,QAAQ5vG,QAAc,CAC9B,GAAwB,MAApBzB,KAAKsxG,YACL,IACItxG,KAAKsxG,YAActxG,KAAK0xG,cAAc1xG,KAAKqxG,QAC/C,CACA,MAAO5qF,GACH,GAAiB,wBAAbA,EAAI1lB,KACJ,MAAM0lB,EAEV,KACJ,CAEJ,MAAM,GAAE/V,EAAE,KAAEvL,EAAI,OAAE1D,EAAM,OAAEyB,GAAWlD,KAAKsxG,YAE1C,GAD2BtxG,KAAKqxG,QAAQ5vG,OAASyB,EACxBzB,EACrB,MAEJ,MAAMk2C,EAAM,CACRjnC,KACAvL,QAEAA,IAASmrG,GAAaG,YAActrG,IAASmrG,GAAaK,mBAAqBxrG,IAASmrG,GAAaW,mBACrGt5D,EAAIhO,KAAO3pC,KAAKqxG,QAAQzxD,QAAQ18C,EAAQA,EAASzB,IAErD2gF,EAAK5hF,KAAKm3C,GACV33C,KAAKqxG,QAAQ9xD,QAAQr8C,EAASzB,GAC9BzB,KAAKsxG,YAAc,IACvB,CACA,OAAOlvB,CACX,CAIA,aAAAsvB,CAAc/nE,GACV,MAAQ3qC,MAAO8W,EAAC,OAAE5S,GAAWyuG,GAAWhoE,IAChC3qC,MAAOyC,EAAQyB,OAAQ+D,GAAQ0qG,GAAWhoE,EAAMzmC,GAClDiC,EAAW,EAAJ2Q,EAEb,GAA8B,MAA1By6F,GAAiBprG,GACjB,MAAM,IAAI3G,MAAM,0BAA0B2G,KAG9C,GAAI1D,EAASzB,KAAKuxG,gBACd,MAAM,IAAIvmC,GAAoB,0BAGlC,MAAO,CAAEt6D,GAAIoF,GAAK,EAAG3Q,OAAMjC,OAAQA,EAAS+D,EAAKxF,SACrD,EAEJ,MAAM,GAAM,IACN,GAAO,IACb,SAASkwG,GAAWniG,EAAKtM,EAAS,GAC9B,IAGI0d,EAHAglB,EAAM,EACNt9B,EAAQ,EACRokC,EAAUxpC,EAEd,MAAM1B,EAAIgO,EAAI/N,OACd,EAAG,CACC,GAAIirC,GAAWlrC,GAAK8G,EAAQ,GAExB,MADApF,EAAS,EACH,IAAIszB,WAAW,2BAEzB5V,EAAIpR,EAAIpQ,IAAIstC,KACZ9G,GAAOt9B,EAAQ,IACRsY,EAAI,KAAStY,GACbsY,EAAI,IAAQ3X,KAAK0qB,IAAI,EAAGrrB,GAC/BA,GAAS,CACb,OAASsY,GAAK,IAEd,MAAO,CACH5hB,MAAO4mC,EACP1iC,OAHJA,EAASwpC,EAAUxpC,EAKvB,CC9FA,MAAM0uG,GAAY,MAsCZjhF,GAAU,IArChB,MACIkhF,MACAC,YACA,WAAAxiG,GACItP,KAAK6xG,MAAQ7sF,EAAY4sF,IACzB5xG,KAAK8xG,YAAc,CACvB,CAIA,KAAApiG,CAAMioC,EAAKkI,GACP,MAAM79B,EAAOhiB,KAAK6xG,MAClB,IAAI3uG,EAASlD,KAAK8xG,YAClB,EAAcn6D,EAAIjnC,IAAM,EAAIinC,EAAIxyC,KAAM6c,EAAM9e,GAC5CA,GAAU,EAAsBy0C,EAAIjnC,IAAM,EAAIinC,EAAIxyC,MAC7CwyC,EAAIxyC,OAASmrG,GAAaG,YAAc94D,EAAIxyC,OAASmrG,GAAaK,mBAAqBh5D,EAAIxyC,OAASmrG,GAAaW,kBAAiC,MAAZt5D,EAAIhO,MAK3I,EAAc,EAAG3nB,EAAM9e,GACvBA,GAAU,EAAsB,KALhC,EAAcy0C,EAAIhO,KAAKloC,OAAQugB,EAAM9e,GACrCA,GAAU,EAAsBy0C,EAAIhO,KAAKloC,SAM7C,MAAMswG,EAAS/vF,EAAKC,SAASjiB,KAAK8xG,YAAa5uG,GAC3C0uG,GAAY1uG,EAAS,KACrBlD,KAAK6xG,MAAQ7sF,EAAY4sF,IACzB5xG,KAAK8xG,YAAc,GAGnB9xG,KAAK8xG,YAAc5uG,EAEvB28C,EAAKV,OAAO4yD,GACPp6D,EAAIxyC,OAASmrG,GAAaG,YAAc94D,EAAIxyC,OAASmrG,GAAaK,mBAAqBh5D,EAAIxyC,OAASmrG,GAAaW,kBAAiC,MAAZt5D,EAAIhO,MAC3IkW,EAAKV,OAAOxH,EAAIhO,KAExB,GCrCG,MAAMqoE,WAA+BxzG,MACxC,WAAA8Q,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,ECCJ,SAAS,GAAUqgD,GACf,OAAa,MAATA,GAGyB,mBAAfA,EAAM7d,MACO,mBAAhB6d,EAAM9d,OACY,mBAAlB8d,EAAMkvC,OACrB,CACO,MAAM2hB,GACTvhG,GACAwhG,UACA1rD,SACA0B,SACAG,SACAliD,OACAiqB,OACA+hF,WACAhqD,YACA/8C,IACAgnG,eACAC,QACAC,OACAC,OACAC,aACA7uD,MACA8uD,YACAC,aACAC,QACAC,QACAC,sBACAC,YACA,WAAAxjG,CAAYzD,GACR7L,KAAKoyG,eAAiB,IAAIW,gBAC1B/yG,KAAKqyG,QAAU,KACfryG,KAAKsyG,OAAS,KACdtyG,KAAKoL,IAAMS,EAAKT,IAEhBpL,KAAKowB,OAAS,OACdpwB,KAAKmyG,WAAa,QAClBnyG,KAAKmoD,YAAc,QACnBnoD,KAAK0Q,GAAK7E,EAAK6E,GACf1Q,KAAKqoD,SAAWx8C,EAAKw8C,UAAY,CAAC,EAClCroD,KAAKkyG,UAAYrmG,EAAKqmG,UACtBlyG,KAAKwmD,SAAW,CACZh2B,KAAMhmB,KAAKu2D,OAEf/gE,KAAK6yG,sBAAwBhnG,EAAKgnG,uBA/CD,IAgDjC7yG,KAAK2jD,MAAQ93C,EAAK83C,MAClB3jD,KAAKyyG,YAAc5mG,GAAM4mG,YACzBzyG,KAAK0yG,aAAe7mG,GAAM6mG,aAC1B1yG,KAAK2yG,QAAU9mG,GAAM8mG,QACrB3yG,KAAK4yG,QAAU/mG,GAAM+mG,QACrB5yG,KAAKmG,OAASnG,KAAKwyG,aAAejvD,GAAS,CACvCI,MAAQl9B,IACO,MAAPA,EACAzmB,KAAKoL,IAAIm4F,MAAM,0BAA2B98E,GAG1CzmB,KAAKoL,IAAIm4F,MAAM,gBAEnBvjG,KAAKgzG,YAAYvsF,EAAI,IAI7BzmB,KAAKimD,KAAOjmD,KAAKimD,KAAK7pB,KAAKp8B,KAC/B,CACA,UAAMimD,CAAK9/C,GACP,GAAyB,UAArBnG,KAAKmoD,YACL,MAAM,IAAIsiB,GAAiB,0BAA0BzqE,KAAKmoD,4BAE9D,IACInoD,KAAKmoD,YAAc,UACnB,MAAMluC,EAAU,CACZmqC,OAAQpkD,KAAKoyG,eAAehuD,QAEhC,GAAuB,aAAnBpkD,KAAKkyG,UAA0B,CAC/B,MAAMtsE,EAAM5lC,KAAKizG,cAAch5F,GAC3B,GAAU2rB,UACJA,CAEd,CACA,MAAMstE,EAAgB,KAClB1F,GAAYrnG,EAAQnG,KAAKoL,IAAI,EAEjC,IACIpL,KAAKoyG,eAAehuD,OAAOG,iBAAiB,QAAS2uD,GACrDlzG,KAAKoL,IAAIm4F,MAAM,4BACf,UAAW,IAAI55D,KAAQxjC,EAAQ,CAC3BwjC,EAAOA,aAAgB15B,WAAa,IAAI+uC,GAAerV,GAAQA,EAC/D,MAAM/D,EAAM5lC,KAAKmzG,SAASxpE,EAAM1vB,GAC5B,GAAU2rB,KACV5lC,KAAK8yG,YAAcnwD,WACb/c,EACN5lC,KAAK8yG,YAAY5uG,UACjBlE,KAAK8yG,iBAAc5zG,EAE3B,CACJ,CACA,QACIc,KAAKoyG,eAAehuD,OAAOK,oBAAoB,QAASyuD,EAC5D,CACAlzG,KAAKoL,IAAIm4F,MAAM,0DAA2DvjG,KAAKmoD,aACtD,YAArBnoD,KAAKmoD,cACLnoD,KAAKmoD,YAAc,UACnBnoD,KAAKoL,IAAIm4F,MAAM,oCACTvjG,KAAKozG,eAAe,CACtBhvD,OAAQioD,YAAYzlF,QAAQ5mB,KAAK6yG,yBAErC7yG,KAAKmoD,YAAc,UAEvBnoD,KAAKqzG,WACT,CACA,MAAO5sF,GAGH,MAFAzmB,KAAKoL,IAAIm4F,MAAM,kDAAmD98E,GAClEzmB,KAAKonE,MAAM3gD,GACLA,CACV,CACA,QACIzmB,KAAKoL,IAAIm4F,MAAM,oBACfvjG,KAAKqyG,QAAQnuG,SACjB,CACJ,CACA,WAAA8uG,CAAYvsF,GACuB,MAA3BzmB,KAAKwmD,SAAS8sD,YAGlBtzG,KAAKwmD,SAAS8sD,UAAY9oG,KAAKu2D,MAC/B/gE,KAAKmyG,WAAa,SACP,MAAP1rF,GAA8B,MAAfzmB,KAAKuyG,SACpBvyG,KAAKuyG,OAAS9rF,GAElBzmB,KAAKyyG,gBAC2B,MAA5BzyG,KAAKwmD,SAAS+sD,YACdvzG,KAAKoL,IAAIm4F,MAAM,yBACfvjG,KAAKwmD,SAAS8lD,MAAQ9hG,KAAKu2D,MACP,YAAhB/gE,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,SAClCpwB,KAAKowB,OAAS,UAEA,MAAdpwB,KAAK2jD,OACL3jD,KAAK2jD,MAAM3jD,KAAKuyG,QAEpBvyG,KAAKsyG,OAAOpuG,WAGZlE,KAAKoL,IAAIm4F,MAAM,yCAEvB,CACA,SAAA8P,CAAU5sF,GAC0B,MAA5BzmB,KAAKwmD,SAAS+sD,aAGlBvzG,KAAKwmD,SAAS+sD,WAAa/oG,KAAKu2D,MAChC/gE,KAAKmoD,YAAc,SACR,MAAP1hC,GAA8B,MAAfzmB,KAAKuyG,SACpBvyG,KAAKuyG,OAAS9rF,GAElBzmB,KAAK0yG,iBAC0B,MAA3B1yG,KAAKwmD,SAAS8sD,WACdtzG,KAAKoL,IAAIm4F,MAAM,yBACfvjG,KAAKwmD,SAAS8lD,MAAQ9hG,KAAKu2D,MACP,YAAhB/gE,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,SAClCpwB,KAAKowB,OAAS,UAEA,MAAdpwB,KAAK2jD,OACL3jD,KAAK2jD,MAAM3jD,KAAKuyG,QAEpBvyG,KAAKsyG,OAAOpuG,WAGZlE,KAAKoL,IAAIm4F,MAAM,yCAEvB,CAEA,WAAM+I,CAAMryF,GACY,SAAhBja,KAAKowB,SAGTpwB,KAAKoL,IAAIm4F,MAAM,sBACfvjG,KAAKowB,OAAS,gBAERu0B,GAAWpoB,QAAQgpB,IAAI,CACzBvlD,KAAKuzG,WAAWt5F,GAChBja,KAAKszG,UAAUr5F,GACfja,KAAKsyG,OAAO1vD,UACZ3oC,GAASmqC,QACbpkD,KAAKowB,OAAS,SACdpwB,KAAKoL,IAAIm4F,MAAM,qBACnB,CACA,eAAM+P,CAAUr5F,EAAU,CAAC,GACvB,GAAwB,YAApBja,KAAKmyG,YAAgD,WAApBnyG,KAAKmyG,WACtC,OAEJnyG,KAAKoL,IAAIm4F,MAAM,gEAAiEvjG,KAAKmyG,YACrF,MAAMA,EAAanyG,KAAKmyG,WACxBnyG,KAAKmyG,WAAa,UACE,UAAhBnyG,KAAKowB,QAAsC,YAAhBpwB,KAAKowB,QAAmD,MAA3BpwB,KAAKwmD,SAAS8sD,YACtEtzG,KAAKoL,IAAIm4F,MAAM,mCACTvjG,KAAKwzG,cAAcv5F,IAEV,UAAfk4F,IACAnyG,KAAKoL,IAAIm4F,MAAM,oDAAqDvjG,KAAKwyG,aAAatuD,gBACtFlkD,KAAKwyG,aAAavrG,OAEtBjH,KAAKoL,IAAIm4F,MAAM,gCACnB,CACA,gBAAMgQ,CAAWt5F,EAAU,CAAC,GACC,YAArBja,KAAKmoD,aAAkD,WAArBnoD,KAAKmoD,cAG3CnoD,KAAKoL,IAAIm4F,MAAM,iEAAkEvjG,KAAKmoD,aAC7D,UAArBnoD,KAAKmoD,cACLnoD,KAAKoL,IAAIm4F,MAAM,kDACT5+C,GAAW3kD,KAAKimD,KAAK,IAAKhsC,EAAQmqC,SAEnB,YAArBpkD,KAAKmoD,cAEmB,MAApBnoD,KAAK8yG,mBACCnuD,GAAW3kD,KAAK8yG,YAAYlwD,QAAS3oC,EAAQmqC,QAGvDpkD,KAAKoL,IAAIm4F,MAAM,mCACfvjG,KAAKoyG,eAAehrC,cACdziB,GAAW3kD,KAAKqyG,QAAQzvD,QAAS3oC,EAAQmqC,SAEnDpkD,KAAKmoD,YAAc,SACnBnoD,KAAKoL,IAAIm4F,MAAM,iCACnB,CAKA,KAAAn8B,CAAM3gD,GACF,GAAoB,WAAhBzmB,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,OAC9D,OAEJpwB,KAAKoL,IAAI,mBAAoBqb,GAE7BzmB,KAAKoL,IAAI,+BACT,MAAMw6B,EAAM5lC,KAAKyzG,YACb,GAAU7tE,IACVA,EAAItC,OAAO7c,IACPzmB,KAAKoL,IAAIoc,MAAM,8BAA+Bf,EAAI,IAG1DzmB,KAAKowB,OAAS,UACdpwB,KAAKwmD,SAAS4gB,MAAQ58D,KAAKu2D,MAC3B/gE,KAAK0zG,oBAAoBjtF,GACzBzmB,KAAK4yG,UAAUnsF,EACnB,CAKA,KAAAlS,GACI,GAAoB,WAAhBvU,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,OAC9D,OAEJ,MAAM3J,EAAM,IAAI+jD,GAAiB,gBACjCxqE,KAAKowB,OAAS,QACdpwB,KAAKwmD,SAASjyC,MAAQ/J,KAAKu2D,MAC3B/gE,KAAK0zG,oBAAoBjtF,GACzBzmB,KAAK2yG,WACT,CACA,mBAAAe,CAAoBjtF,GAChBzmB,KAAK2zG,WAAWltF,GAChBzmB,KAAK4zG,aAAantF,EACtB,CACA,UAAAktF,CAAWltF,GAEkB,YAArBzmB,KAAKmoD,cACLnoD,KAAKoL,IAAIm4F,MAAM,mBACfvjG,KAAKoyG,eAAehrC,SAExBpnE,KAAKqzG,UAAU5sF,EACnB,CACA,YAAAmtF,CAAantF,GAEe,YAApBzmB,KAAKmyG,YAAgD,WAApBnyG,KAAKmyG,aACtCnyG,KAAKoL,IAAIm4F,MAAM,qDAAsDvjG,KAAKwyG,aAAatuD,gBACvFlkD,KAAKmyG,WAAa,UAClBnyG,KAAKwyG,aAAavrG,IAAIwf,GAE9B,CAKA,gBAAAotF,GAC4B,YAApB7zG,KAAKmyG,YAAgD,WAApBnyG,KAAKmyG,YAI1CnyG,KAAKoL,IAAIm4F,MAAM,sBACfvjG,KAAK4zG,gBAJD5zG,KAAKoL,IAAI,iEAKjB,CAKA,eAAA0oG,GAC6B,YAArB9zG,KAAKmoD,aAAkD,WAArBnoD,KAAKmoD,aAI3CnoD,KAAKoL,IAAIm4F,MAAM,qBACfvjG,KAAK2zG,cAJD3zG,KAAKoL,IAAI,8DAKjB,CAKA,OAAAK,GACwB,WAAhBzL,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,QAAwC,UAAhBpwB,KAAKowB,QAIlEpwB,KAAKoL,IAAIm4F,MAAM,oBACfvjG,KAAK0zG,uBAJD1zG,KAAKoL,IAAI,6CAKjB,CAKA,UAAA2oG,CAAWpqE,GACP3pC,KAAKwyG,aAAahyG,KAAKmpC,EAC3B,CAKA,oBAAAqqE,GACI,OAAOh0G,KAAKwyG,aAAatuD,cAC7B,EC/UG,MAAM+vD,WAAoBhC,GAC7BlxG,KACAmzG,SACAzjF,KACA5tB,MACAsxG,YACA,WAAA7kG,CAAYzD,GACRukC,MAAMvkC,GACN7L,KAAK6C,MAA2B,aAAnBgJ,EAAKqmG,UAA2B1B,GAAwBQ,GACrEhxG,KAAKywB,KAAO5kB,EAAK4kB,KACjBzwB,KAAKe,KAAO8K,EAAK9K,KACjBf,KAAKk0G,SAAWroG,EAAKqoG,SACrBl0G,KAAKm0G,YAActoG,EAAKsoG,WAC5B,CACA,mBAAMlB,SACIjzG,KAAKywB,KAAK,CAAE/f,GAAI1Q,KAAKk0G,SAAU/uG,KAAMqrG,GAAsBC,WAAY9mE,KAAM,IAAIqV,GAAe,GAAqBh/C,KAAKe,QACpI,CACA,cAAMoyG,CAASxpE,GAEX,IADAA,EAAOA,EAAKiW,UACLjW,EAAKn5B,WAAa,GAAG,CACxB,MAAM4jG,EAASnrG,KAAKC,IAAIygC,EAAKn5B,WAAYxQ,KAAKm0G,mBACxCn0G,KAAKywB,KAAK,CACZ/f,GAAI1Q,KAAKk0G,SACT/uG,KAAMnF,KAAK6C,MAAM6tG,QACjB/mE,KAAMA,EAAKiW,QAAQ,EAAGw0D,KAE1BzqE,EAAK4V,QAAQ60D,EACjB,CACJ,CACA,eAAMX,SACIzzG,KAAKywB,KAAK,CAAE/f,GAAI1Q,KAAKk0G,SAAU/uG,KAAMnF,KAAK6C,MAAMiuG,OAC1D,CACA,oBAAMsC,SACIpzG,KAAKywB,KAAK,CAAE/f,GAAI1Q,KAAKk0G,SAAU/uG,KAAMnF,KAAK6C,MAAM+tG,OAC1D,CACA,mBAAM4C,GAEN,EC1BJ,SAASa,GAAa18D,GAClB,MAAMgH,EAAS,IACRhH,EACHxyC,KAAM,GAAGorG,GAAiB54D,EAAIxyC,UAAUwyC,EAAIxyC,SAQhD,OANIwyC,EAAIxyC,OAASmrG,GAAaG,aAC1B9xD,EAAOhV,KAAO,GAAmBgO,EAAIhO,gBAAgB15B,WAAa0nC,EAAIhO,KAAOgO,EAAIhO,KAAK1nB,aAEtF01B,EAAIxyC,OAASmrG,GAAaK,mBAAqBh5D,EAAIxyC,OAASmrG,GAAaW,mBACzEtyD,EAAOhV,KAAO,GAAmBgO,EAAIhO,gBAAgB15B,WAAa0nC,EAAIhO,KAAOgO,EAAIhO,KAAK1nB,WAAY,WAE/F08B,CACX,CACO,MAAM21D,GACTpsD,SAAW,eACXjC,KACA9/C,OACAiF,IACAmpG,UACAC,SACAvO,MACAwO,QACAC,gBACAC,YACAC,aACAj3D,OACA,WAAAruC,CAAYi5C,EAAY18C,GACpBA,EAAOA,GAAQ,CAAC,EAChB7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,gBAC1CzjG,KAAK29C,OAAS4K,EAAW5K,OACzB39C,KAAKu0G,UAAY,EACjBv0G,KAAKw0G,SAAW,CAIZK,WAAY,IAAIhnE,IAIhBinE,UAAW,IAAIjnE,KAEnB7tC,KAAKimG,MAAQp6F,EACb7L,KAAK40G,aAAe/oG,EAAK+oG,cA3CX,IA+Cd50G,KAAKimD,KAAOjmD,KAAK+0G,cAIjB/0G,KAAKy0G,QAAUlxD,GAAS,CACpBO,YAAY,EACZH,MAAO,KAGH,IAAK,MAAMyC,KAAUpmD,KAAKw0G,SAASK,WAAW5xG,SAC1CmjD,EAAO36C,UAEX,IAAK,MAAM26C,KAAUpmD,KAAKw0G,SAASM,UAAU7xG,SACzCmjD,EAAO36C,SACX,IAGRzL,KAAKmG,OAASw/C,GAAK3lD,KAAKy0G,SAAStuG,GJjClCgnC,gBAAuBhnC,GAC1B,UAAW,MAAMqG,KAAWrG,EAAQ,CAChC,MAAM05C,EAAO,IAAIb,GACjBruB,GAAQjhB,MAAMlD,EAASqzC,SACjBA,CACV,CACJ,CI2BmD,CAAO15C,KAIlDnG,KAAK00G,gBAAkB,IAAI3B,gBAC3B/yG,KAAK20G,YAAc,IAAI/F,GAAY,CAC/Bn0B,OAAQ5uE,EAAKmpG,qBAvEI,EAwEjBlG,SAAU,GAElB,CAIA,WAAI7mD,GAEA,MAAMA,EAAU,GAChB,IAAK,MAAM7B,KAAUpmD,KAAKw0G,SAASK,WAAW5xG,SAC1CglD,EAAQznD,KAAK4lD,GAEjB,IAAK,MAAMA,KAAUpmD,KAAKw0G,SAASM,UAAU7xG,SACzCglD,EAAQznD,KAAK4lD,GAEjB,OAAO6B,CACX,CAKA,SAAAN,CAAU5mD,GACN,GAAIf,KAAK00G,gBAAgBtwD,OAAOQ,QAC5B,MAAM,IAAI2lB,GAAiB,wBAE/B,MAAM75D,EAAK1Q,KAAKu0G,YAChBxzG,EAAe,MAARA,EAAe2P,EAAGrK,WAAatF,EAAKsF,WAC3C,MAAM4uG,EAAWj1G,KAAKw0G,SAASK,WAC/B,OAAO70G,KAAKk1G,WAAW,CAAExkG,KAAI3P,OAAMoE,KAAM,YAAa8vG,YAC1D,CAIA,WAAM3I,CAAMryF,GACR,GAAIja,KAAK00G,gBAAgBtwD,OAAOQ,QAC5B,OAEJ,MAAMR,EAASnqC,GAASmqC,QAAUioD,YAAYzlF,QAAQ5mB,KAAK40G,cAC3D,UAEUr4E,QAAQgpB,IAAIvlD,KAAKioD,QAAQ3jD,KAAI6oC,MAAOpqC,GAAMA,EAAEupG,MAAM,CACpDloD,cAEJpkD,KAAKy0G,QAAQxtG,YAEPjH,KAAKy0G,QAAQtwD,QAAQ,CACvBC,WAEJpkD,KAAK00G,gBAAgBttC,OACzB,CACA,MAAO3gD,GACHzmB,KAAKonE,MAAM3gD,EACf,CACJ,CACA,KAAA2gD,CAAM3gD,GACEzmB,KAAK00G,gBAAgBtwD,OAAOQ,UAGhC5kD,KAAKioD,QAAQ96C,SAAQpK,IAAOA,EAAEqkE,MAAM3gD,EAAI,IACxCzmB,KAAK00G,gBAAgBttC,MAAM3gD,GAC/B,CAIA,kBAAA0uF,CAAmBl7F,GACf,MAAM,GAAEvJ,EAAE,KAAE3P,GAASkZ,EACfg7F,EAAWj1G,KAAKw0G,SAASM,UAC/B,OAAO90G,KAAKk1G,WAAW,CAAExkG,KAAI3P,OAAMoE,KAAM,WAAY8vG,YACzD,CACA,UAAAC,CAAWj7F,GACP,MAAM,GAAEvJ,EAAE,KAAE3P,EAAI,KAAEoE,EAAI,SAAE8vG,GAAah7F,EAErC,GADAja,KAAKoL,IAAI,mBAAoBjG,EAAMuL,GACtB,cAATvL,GAAwBnF,KAAKw0G,SAASK,WAAWp2G,QAAUuB,KAAKimG,MAAMuF,oBAlJ9B,MAmJxC,MAAM,IAAIlgC,GAAoC,kCAElD,GAAI2pC,EAASh2G,IAAIyR,GACb,MAAM,IAAIlS,MAAM,GAAG2G,YAAeuL,qBAEtC,MAaM01C,EDrIP,SAAsBnsC,GACzB,MAAM,GAAEvJ,EAAE,KAAE3P,EAAI,KAAE0vB,EAAI,MAAEkzB,EAAK,KAAEx+C,EAAO,YAAW,WAAEiwG,EAAahE,IAAiBn3F,EACjF,OAAO,IAAIg6F,GAAY,CACnBvjG,GAAa,cAATvL,EAAuB,IAAKuL,IAAQ,IAAIA,IAC5CwjG,SAAUxjG,EACV3P,KAAM,GAAGA,GAAQ2P,IACjBwhG,UAAoB,cAAT/sG,EAAuB,WAAa,UAC/CgvG,YAAaiB,EACbzxD,QACAlzB,OACArlB,IAAK6O,EAAQ0jC,OAAO8lD,aAAa,uBAAuBt+F,KAAQuL,MAExE,CCyHuB82C,CAAa,CAAE92C,KAAI3P,OAAM0vB,KAb3B0c,MAAOwK,IACZ33C,KAAKoL,IAAIf,SACTrK,KAAKoL,IAAIm4F,MAAM,oBAAqBp+F,EAAMuL,EAAI2jG,GAAa18D,IAE/D33C,KAAKy0G,QAAQj0G,KAAKm3C,EAAI,EASoBxyC,OAAMw+C,MAPtC,KACV3jD,KAAKoL,IAAI,6CAA8CjG,EAAMuL,EAAI01C,EAAO8B,UACxE+sD,EAAS5tD,OAAO32C,GACc,MAA1B1Q,KAAKimG,MAAMoP,aACXr1G,KAAKimG,MAAMoP,YAAYjvD,EAC3B,EAEuDgvD,WAAYp1G,KAAKimG,MAAMmP,WAAYz3D,OAAQ39C,KAAK29C,SAE3G,OADAs3D,EAAS31G,IAAIoR,EAAI01C,GACVA,CACX,CAKA,WAAA2uD,GAuBI,OAtBa5nE,MAAOhnC,IAChB,MAAM+sG,EAAgB,KAClB1F,GAAYrnG,EAAQnG,KAAKoL,IAAI,EAEjCpL,KAAK00G,gBAAgBtwD,OAAOG,iBAAiB,QAAS2uD,GACtD,IACI,MAAMtiF,EAAU,IAAI,GAAQ5wB,KAAKimG,MAAMmP,WAAYp1G,KAAKimG,MAAMwL,gCAC9D,UAAW,MAAMp0F,KAASlX,EACtB,IAAK,MAAMwxC,KAAO/mB,EAAQlhB,MAAM2N,SACtBrd,KAAKs1G,gBAAgB39D,GAGnC33C,KAAKy0G,QAAQxtG,KACjB,CACA,MAAOwf,GACHzmB,KAAKoL,IAAI,gBAAiBqb,GAC1BzmB,KAAKy0G,QAAQxtG,IAAIwf,EACrB,CACA,QACIzmB,KAAK00G,gBAAgBtwD,OAAOK,oBAAoB,QAASyuD,EAC7D,EAGR,CACA,qBAAMoC,CAAgB9oG,GAClB,MAAM,GAAEkE,EAAE,KAAEvL,GAASqH,EAKrB,GAJIxM,KAAKoL,IAAIf,SACTrK,KAAKoL,IAAIm4F,MAAM,mBAAoB8Q,GAAa7nG,IAGhDA,EAAQrH,OAASmrG,GAAaG,WAAY,CAC1C,GAAIzwG,KAAKw0G,SAASM,UAAUr2G,QAAUuB,KAAKimG,MAAM97C,mBA9MV,MA8M4E,CAC/GnqD,KAAKoL,IAAI,iCAGTpL,KAAKy0G,QAAQj0G,KAAK,CACdkQ,KACAvL,KAAMmrG,GAAaa,iBAKvB,UACUnxG,KAAK20G,YAAYp1D,QAAQ,aAAc,EACjD,CACA,MAII,OAHAv/C,KAAKoL,IAAI,mHAETpL,KAAKonE,MAAM,IAAI5oE,MAAM,yBAEzB,CACA,MACJ,CACA,MAAM4nD,EAASpmD,KAAKm1G,mBAAmB,CAAEzkG,KAAI3P,KAAM,GAAmByL,EAAQm9B,gBAAgB15B,WAAazD,EAAQm9B,KAAOn9B,EAAQm9B,KAAK1nB,cAIvI,YAHmC,MAA/BjiB,KAAKimG,MAAMsP,kBACXv1G,KAAKimG,MAAMsP,iBAAiBnvD,GAGpC,CACA,MACMA,GADsB,GAAdjhD,EAA6CnF,KAAKw0G,SAASM,UAAzC90G,KAAKw0G,SAASK,YAC1Bz1G,IAAIsR,GACxB,GAAc,MAAV01C,EAAgB,CAChBpmD,KAAKoL,IAAI,wCAAyCsF,EAAI6/F,GAAiBprG,IAIvE,UACUnF,KAAK20G,YAAYp1D,QAAQ,iBAAkB,EACrD,CACA,MAII,OAHAv/C,KAAKoL,IAAI,yGAETpL,KAAKonE,MAAM,IAAI5oE,MAAM,yCAEzB,CACA,MACJ,CACA,MAAMg3G,EAAgBx1G,KAAKimG,MAAMwP,qBA1PV,QA2PvB,IACI,OAAQtwG,GACJ,KAAKmrG,GAAaK,kBAClB,KAAKL,GAAaW,iBACd,GAAI7qD,EAAO4tD,uBAAyBwB,EAOhC,MALAx1G,KAAKy0G,QAAQj0G,KAAK,CACdkQ,GAAIlE,EAAQkE,GACZvL,KAAMA,IAASmrG,GAAaK,kBAAoBL,GAAaa,eAAiBb,GAAaS,kBAGzF,IAAIiB,GAAuB,kFAGrC5rD,EAAO2tD,WAAWvnG,EAAQm9B,MAC1B,MACJ,KAAK2mE,GAAaO,gBAClB,KAAKP,GAAaY,eAEd9qD,EAAOytD,mBACP,MACJ,KAAKvD,GAAaS,gBAClB,KAAKT,GAAaa,eAEd/qD,EAAO7xC,QACP,MACJ,QACIvU,KAAKoL,IAAI,0BAA2BjG,GAEhD,CACA,MAAOshB,GACHzmB,KAAKoL,IAAIoc,MAAM,iCAAkCf,GACjD2/B,EAAOghB,MAAM3gD,EACjB,CACJ,ECxQJ,MAAMivF,GACFxtD,SAAW,eACX+9C,MACA19C,WACA,WAAAj5C,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKuoD,WAAaA,EAClBvoD,KAAKimG,MAAQp6F,CACjB,CACA,CAAC43B,OAAOqB,aAAe,gBACvB,CAACstD,IAAuB,CACpB,+BAEJ,iBAAAujB,CAAkB9pG,EAAO,CAAC,GACtB,OAAO,IAAIyoG,GAAiBt0G,KAAKuoD,WAAY,IACtC18C,KACA7L,KAAKimG,OAEhB,EAKG,SAAS2P,GAAM/pG,EAAO,CAAC,GAC1B,OAAQ08C,GAAe,IAAImtD,GAAMntD,EAAY18C,EACjD,CCrDe,SAAS,GAAYpK,GAChC,GAAIq/B,MAAMr/B,IAAWA,GAAU,EAC3B,MAAM,IAAI,GAAuB,sDAErC,OAAO,GAAMA,EACjB,CCJO,MAAMo0G,GACT3tD,SACAK,WACA+iD,QACA1kF,QACAujC,kBACAqhD,mBACAG,uBACAvgG,IACA,WAAAkE,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKuoD,WAAaA,EAClBvoD,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,eAC1CzjG,KAAKsrG,SAAU,EACftrG,KAAKkoD,SAAW,IAAIr8C,EAAKggG,gBCfF,oBDgBvB7rG,KAAK4mB,QAAU/a,EAAK+a,SCfL,IDgBf5mB,KAAKmqD,kBAAoBt+C,EAAKs+C,mBCTH,EDU3BnqD,KAAKwrG,mBAAqB3/F,EAAK2/F,oBCTH,EDU5BxrG,KAAK2rG,uBAAyB9/F,EAAK8/F,yBAA0B,EAC7D3rG,KAAK81G,cAAgB91G,KAAK81G,cAAc15E,KAAKp8B,KACjD,CACA,CAACyjC,OAAOqB,aAAe,eACvB,WAAM99B,SACIhH,KAAKuoD,WAAWoT,UAAU1R,OAAOjqD,KAAKkoD,SAAUloD,KAAK81G,cAAe,CACtE3rD,kBAAmBnqD,KAAKmqD,kBACxBqhD,mBAAoBxrG,KAAKwrG,mBACzBG,uBAAwB3rG,KAAK2rG,yBAEjC3rG,KAAKsrG,SAAU,CACnB,CACA,UAAMhlF,SACItmB,KAAKuoD,WAAWoT,UAAUswC,SAASjsG,KAAKkoD,UAC9CloD,KAAKsrG,SAAU,CACnB,CACA,SAAA1uC,GACI,OAAO58D,KAAKsrG,OAChB,CAIA,aAAAwK,CAAcnsE,GACV3pC,KAAKoL,IAAI,wBAAyBu+B,EAAK8d,WAAWsD,YAClD,MAAM,OAAE3E,GAAWzc,EACb3iC,EAAQwD,KAAKu2D,MACJsrC,YAAYzlF,QAAQ5mB,KAAK4mB,SACjC29B,iBAAiB,SAAS,KAC7B6B,GAAQghB,MAAM,IAAI6D,GAAa,gBAAgB,IAE9CtlB,GAAKS,GAAQjZ,gBAAiBhnC,GAC/B,IAAI4vG,EAAW,EACf,UAAW,MAAMvmG,KAAOrJ,EAAQ,CAE5B,GADA4vG,GAAYvmG,EAAIgB,WACZulG,ECxDO,GD0DP,YADA3vD,GAAQghB,MAAM,IAAI4D,GAAoB,iCAGpCx7D,CACV,CACJ,GAAG42C,GACE9iB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,0CAA2CmiB,EAAK8d,WAAWsD,WAAYtkC,GACtF2/B,GAAQghB,MAAM3gD,EAAI,IAEjB6pE,SAAQ,KACT,MAAM7lF,EAAKD,KAAKu2D,MAAQ/5D,EACxBhH,KAAKoL,IAAI,yCAA0Cu+B,EAAK8d,WAAWsD,WAAYtgD,EAAG,GAE1F,CAIA,UAAMogD,CAAKhD,EAAM5tC,EAAU,CAAC,GACxBja,KAAKoL,IAAI,aAAcy8C,GACvB,MAAM7gD,EAAQwD,KAAKu2D,MACbp3B,EAAO,GC9EM,ID+Eb8d,QAAmBznD,KAAKuoD,WAAWI,kBAAkB89C,eAAe5+C,EAAM5tC,GAChF,IAAImsC,EACAwsD,EAAU,OACd,GAAsB,MAAlB34F,EAAQmqC,OAAgB,CACxB,MAAMA,EAASioD,YAAYzlF,QAAQ5mB,KAAK4mB,SACxC3M,EAAU,IACHA,EACHmqC,SAER,CACA,IACIgC,QAAeqB,EAAWE,UAAU3nD,KAAKkoD,SAAU,IAC5CjuC,EACH0xF,uBAAwB3rG,KAAK2rG,yBAEjCiH,EAAU,KACNxsD,GAAQghB,MAAM,IAAI,GAAa,EAGnCntD,EAAQmqC,QAAQG,iBAAiB,QAASquD,EAAS,CAAE7yG,MAAM,IAC3D,MAAM+U,QAAe6wC,GAAK,CAAChc,GAAOyc,GAAQjZ,MAAOhnC,GEjE7D,SAAeA,GACX,GAHsC,MAGlBA,EAHPs9B,OAAOC,eAIhB,MAAO,WACH,UAAW,MAAM+a,KAASt4C,EACtB,OAAOs4C,CAGd,EALM,GAOX,IAAK,MAAMA,KAASt4C,EAChB,OAAOs4C,CAGf,CFoDwE,CAAMt4C,KAC5DsE,EAAKD,KAAKu2D,MAAQ/5D,EACxB,GAAc,MAAV8N,EACA,MAAM,IAAI,GAAc,oCAAoCrK,OAEhE,IAAK,GAAiBk/B,EAAM70B,EAAOmN,YAC/B,MAAM,IAAI,GAAc,iCAAiCxX,OAG7D,OADAzK,KAAKoL,IAAI,2BAA4Bq8C,EAAWsD,WAAYtgD,GACrDA,CACX,CACA,MAAOgc,GAGH,MAFAzmB,KAAKoL,IAAIoc,MAAM,yBAA0BigC,EAAWsD,WAAYtkC,GAChE2/B,GAAQghB,MAAM3gD,GACRA,CACV,CACA,QACIxM,EAAQmqC,QAAQK,oBAAoB,QAASmuD,GAC/B,MAAVxsD,SACMA,EAAOkmD,OAErB,CACJ,EGlGG,SAASzhD,GAAKh/C,EAAO,CAAC,GACzB,OAAQ08C,GAAe,IAAIstD,GAAiBttD,EAAY18C,EAC5D,CC1BO,MAAMmqG,GAAkBvyE,OAAOmL,IAAI,qBAOnC,IAAIqnE,IACX,SAAWA,GAIPA,EAAeA,EAA0B,UAAI,GAAK,YAIlDA,EAAeA,EAAyB,SAAI,GAAK,UACpD,CATD,CASGA,KAAmBA,GAAiB,CAAC,ICcxC,MAAMC,GAAoB,CACtB,GAAU,OAAOnhG,KACjB,GAAU,OAAOA,KACjB,GAAU,WAAWA,KACrB,GAAU,QAAQA,KAClB,GAAU,QAAQA,MAEtB,SAASohG,GAAWh8C,GAChB,OAAOi8C,GAAa,MAAOj8C,KAAM,EACrC,CACA,SAASk8C,GAAYl8C,GACjB,MAAMjI,EAAOkkD,GAAa,MAAOj8C,KAAM,GACvC,OAAY,MAARjI,EACO,GAEJ,IAAIA,GACf,CACA,SAASkkD,GAAar1G,EAAMo5D,GACxB,IAAIplD,EACJ,IACIA,EAAO,GAAUhU,GAAMgU,IAC3B,CACA,MAAOkP,GAEH,MACJ,CACA,IAAK,MAAO65B,EAAO9+C,KAAUm7D,EACzB,GAAIrc,IAAU/oC,GAAiB,MAAT/V,EAClB,MAAO,CAAC8+C,EAAO9+C,EAG3B,CACA,SAASs3G,GAAOn8C,GACZ,OAAOA,EAAGa,MAAK,EAAEld,EAAOnlB,KAAOmlB,IAAU,GAAU,OAAO/oC,MAC9D,CACA,SAASwhG,GAAcC,EAAeC,EAAcC,GAChD,MAAMC,EAAcC,GAAa,GAAUJ,GAAez1G,MAC1D,GAAmB,MAAf41G,EACA,MAAM,IAAIn4G,MAAM,4BAA4B,GAAUg4G,GAAez1G,QAEzE,MAAM81G,EAAUF,EAAYF,EAAcC,GAC1C,OAAIF,IAAkB,GAAU,OAAOzhG,KAC5B,IAAI8hG,KAERA,CACX,CACA,MAAMD,GAAe,CACjBziD,IAAK,CAACn1D,EAAO03G,IAAW13G,EACxBo1D,IAAK,CAACp1D,EAAO03G,IACa,IAAlBA,EAAOj1G,OACAzC,EAEJ,IAAIA,KAEfi1D,IAAK,CAACj1D,EAAO03G,KACT,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,MAAO,SAAS+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAAW13G,GAAO,EAEtFk1D,IAAK,CAACl1D,EAAO03G,KACT,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,MAAO,SAAS+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAAW13G,GAAO,EAEtF+3G,QAAS,CAAC/3G,EAAO03G,IAAW13G,EAC5Bg4G,KAAM,CAACh4G,EAAO03G,IAAW13G,EACzBq1D,KAAM,CAACr1D,EAAO03G,IAAW13G,EACzBi4G,IAAK,CAACj4G,EAAO03G,IAAW13G,EACxBk4G,KAAM,CAACl4G,EAAO03G,KACV,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,MAAO,GAAG+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,IAAS,EAEvE3hD,IAAK,CAAC/1D,EAAO03G,KACT,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,MAAO,GAAG+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,IAAS,EAEvES,KAAM,CAACn4G,EAAO03G,KACV,MAAMU,EAAWd,GAAOI,GAClBW,EAAMlB,GAAWO,GACjBxkD,EAAOmkD,GAAYK,GACzB,GAAIU,GAAmB,MAAPC,EACZ,MAAO,WAAWA,IAAMnlD,IAE5B,MAAMhK,EAAWkvD,EAAW,WAAa,UACnCN,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,IAAI84G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQtxG,QAAQ,SAAU,IAC7B,GAAGkiD,IAAWovD,GAAS,EAElC,YAAa,CAACt4G,EAAO03G,KACjB,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAIpB,MAAO,GAFS+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,MAC3ChkD,mBAAmB1zD,IACL,EAEvCu4G,IAAK,CAACv4G,EAAO03G,KAGT,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,OAAO+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,EAAO,EAElEW,IAAK,CAACr4G,EAAO03G,KAGT,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,OAAO+3G,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,EAAO,EAElEc,MAAO,CAACx4G,EAAO03G,KACX,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,IAAI84G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQtxG,QAAQ,SAAU,IAC7B,WAAWsxG,GAAS,EAE/BG,GAAI,CAACz4G,EAAO03G,KACR,MAAMU,EAAWd,GAAOI,GAClBW,EAAMlB,GAAWO,GACjBxkD,EAAOmkD,GAAYK,GACzB,GAAIU,GAAmB,MAAPC,EACZ,MAAO,SAASA,IAAMnlD,IAE1B,MAAMhK,EAAWkvD,EAAW,SAAW,QACjCN,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,IAAI84G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQtxG,QAAQ,SAAU,IAC7B,GAAGkiD,IAAWovD,GAAS,EAElCI,IAAK,CAAC14G,EAAO03G,KACT,MAAMI,EAAYJ,EAAOl5E,MACzB,GAAiB,MAAbs5E,EACA,MAAM,IAAIt4G,MAAM,+BAEpB,IAAI84G,EAAUf,GAAcO,EAAU,GAAIA,EAAU,IAAM,GAAIJ,GAG9D,OADAY,EAAUA,EAAQtxG,QAAQ,SAAU,IAC7B,SAASsxG,GAAS,GCpMjC,SAAsBK,IAElB,GAAIA,EAAOxnF,YAAc,EACrB,MAAM,IAAI3xB,MAAM,iBAGM,IAAtBm5G,EAAOxnF,kBAGL,IAAIoM,SAAQ,CAACr4B,EAASs4B,KACxB,SAASo7E,IACLD,EAAOlzD,oBAAoB,OAAQozD,GACnCF,EAAOlzD,oBAAoB,QAASqzD,EACxC,CACA,SAASD,IACLD,IACA1zG,GACJ,CACA,SAAS4zG,EAAU33G,GACfy3G,IACAp7E,EAAOr8B,EAAMqnB,OAAS,IAAIhpB,MAAM,wBAAwBm5G,EAAOhlB,OACnE,CACAglB,EAAOpzD,iBAAiB,OAAQszD,GAChCF,EAAOpzD,iBAAiB,QAASuzD,EAAU,GAElD,ECxBD,IAAgBH,EAAQ19F,MACpBA,EAAUA,GAAW,CAAC,GACd89F,YAAoC,IAAvB99F,EAAQ89F,WAChB5qE,MAAOhnC,IAChB,UAAW,MAAMwjC,KAAQxjC,EAAQ,CAC7B,UACU6xG,GAAML,EAChB,CACA,MAAOlxF,GACH,GAAoB,kBAAhBA,EAAIja,QACJ,MACJ,MAAMia,CACV,CAGA,GAAIkxF,EAAOxnF,aAAewnF,EAAOM,SAAWN,EAAOxnF,aAAewnF,EAAOO,OACrE,MAEJP,EAAOlnF,KAAKkZ,EAChB,CAC0B,MAAtB1vB,EAAQ89F,YAAsBJ,EAAOxnF,YAAc,SAC7C,IAAIoM,SAAQ,CAACr4B,EAASs4B,KACxBm7E,EAAOpzD,iBAAiB,SAASpkD,IAC7B,GAAIA,EAAMg4G,UAA2B,OAAfh4G,EAAM4U,KACxB7Q,QAEC,CACD,MAAMuiB,EAAM9nB,OAAO01B,OAAO,IAAI71B,MAAM,YAAa,CAAE2B,UACnDq8B,EAAO/V,EACX,KAEJI,YAAW,KAAQ8wF,EAAOrL,OAAO,GAAI,GAE7C,mCC9BR,SAAS8L,GAAc7lG,GACnB,OAAQA,aAAeV,aACS,gBAA3BU,GAAKjD,aAAavO,MAAqD,iBAApBwR,GAAK/B,UACjE,CACA,MCPA,aCDMlM,GAAM,CAAE,QAAS,MAAO,SAAU,QCIjC,SAAS+zG,GAAQlpD,EAAMryB,GAE1BA,EAAOA,GAAQ,CAAC,EAChB,MAAM61D,EDLV,EAAgBA,EAAK2lB,KAIjB,GAHI3lB,EAAIpmE,WAAW,QACfomE,EAAM,GAAG2lB,GAAUpwD,UAHH,QAGiCyqC,KAEjDA,EAAIpmE,WAAW,MAAoB,MAAZ+rF,EAAkB,CACzC,MAAMx6D,EAAQw6D,EAASpwD,UANP,MAOV6L,EAAOukD,EAASvkD,KAChB7B,EAAwB,MAAjBomD,EAASpmD,OAAwD,IAAxC6B,GAAMznC,SAAS,IAAIgsF,EAASpmD,QAAmB,IAAIomD,EAASpmD,OAAS,GAC3GygC,EAAM,GAAG70C,MAAUiW,IAAO7B,IAAOygC,GACrC,CACA,MAAM4lB,EAAQ,IAAIplB,IAAIR,GACtB,IAAK,MAAO6lB,EAAWC,KAAY95G,OAAOwxD,QAAQ7rD,IAC1Ci0G,EAAMrwD,WAAaswD,IACnBD,EAAMrwD,SAAWuwD,GAGzB,OAAOF,CACV,ECZe,CAAMppD,EAFiB,oBAAXp+C,YAAyB7R,EAAY6R,OAAOunG,UAKpE,MCRJ,EAAgBX,EAAQ19F,KACpBA,EAAUA,GAAW,CAAC,EACtB,MAAMy+F,EJIV,CAAgBf,IACZA,EAAOgB,WAAa,cACpB,MAAMC,EAAYzrE,gBACR,IAAI5Q,SAAQ,CAACr4B,EAASs4B,KACxB,GAAI06B,EAEA,YADAhzD,IAGJ,GAAiB,MAAb20G,EAEA,YADAr8E,EAAOq8E,GAGX,MAAMC,EAAWC,IACbpB,EAAOlzD,oBAAoB,OAAQu0D,GACnCrB,EAAOlzD,oBAAoB,QAASw0D,GACpCF,GAAM,EAEJC,EAAS,KAAQF,EAAQ50G,EAAQ,EACjC+0G,EAAW94G,IACb24G,GAAQ,KAAQt8E,EAAOr8B,EAAMqnB,OAAS,IAAIhpB,MAAM,wBAAwBm5G,EAAOhlB,OAAO,GAAI,EAE9FglB,EAAOpzD,iBAAiB,OAAQy0D,GAChCrB,EAAOpzD,iBAAiB,QAAS00D,EAAQ,GAC3C,EAEA9yG,EAAUgnC,kBACZ,MAAMuG,EAAW,IAAI,OAAc,EAAGlzC,OAAM8lB,OAAM8c,WAC9C,MAAM81E,EAAa/4G,IACf,IAAIwpC,EAAO,KACe,iBAAfxpC,EAAMwpC,OACbA,EAAO,GAAqBxpC,EAAMwpC,OAElCyuE,GAAcj4G,EAAMwpC,QACpBA,EAAO,IAAI15B,WAAW9P,EAAMwpC,OAE5BxpC,EAAMwpC,gBAAgB15B,aACtB05B,EAAOxpC,EAAMwpC,MAEL,MAARA,GAGJnpC,EAAKmpC,EAAK,EAERsvE,EAAW94G,IAAYijC,EAAKjjC,EAAMqnB,OAAS,IAAIhpB,MAAM,gBAAgB,EAI3E,OAHAm5G,EAAOpzD,iBAAiB,UAAW20D,GACnCvB,EAAOpzD,iBAAiB,QAAS00D,GACjCtB,EAAOpzD,iBAAiB,QAASj+B,GAC1B,KACHqxF,EAAOlzD,oBAAoB,UAAWy0D,GACtCvB,EAAOlzD,oBAAoB,QAASw0D,GACpCtB,EAAOlzD,oBAAoB,QAASn+B,EAAK,CAC5C,GACF,CAAE4c,cAAetd,YACdgzF,IACN,UAAW,MAAMv7F,KAASq2B,QAChB0kE,GAAc/6F,GAAS,IAAIpN,WAAWoN,GAASA,CAE7D,CAhCe,GAiCf,IACIw7F,EADA3hD,EAAoC,IAAtBygD,EAAOxnF,WAezB,OAbAwnF,EAAOpzD,iBAAiB,QAAQ,KAC5B2S,GAAc,EACd2hD,EAAY,IAAI,IAEpBlB,EAAOpzD,iBAAiB,SAAS,KAC7B2S,GAAc,EACd2hD,EAAY,IAAI,IAEpBlB,EAAOpzD,iBAAiB,SAASpkD,IACxB+2D,IACD2hD,EAAY14G,EAAMqnB,OAAS,IAAIhpB,MAAM,wBAAwBm5G,EAAOhlB,OACxE,IAEGh0F,OAAO01B,OAAOluB,EAAQ,CACzByyG,aAEP,EIhF2BzyG,CAAOwxG,GAC/B,IAAIwB,EAAgBl/F,EAAQk/F,cACxBC,EAAan/F,EAAQm/F,WACzB,GAAkB,MAAdzB,EAAOhlB,IAEP,IACI,MAAMA,EAAM,IAAIQ,IAAIwkB,EAAOhlB,KAC3BwmB,EAAgBxmB,EAAI0mB,SACpBD,EAAa56F,SAASm0E,EAAIzgC,KAAM,GACpC,CACA,MAAQ,CAEZ,GAAqB,MAAjBinD,GAAuC,MAAdC,EACzB,MAAM,IAAI56G,MAAM,sDA4BpB,MA1Be,CACXynD,KAAMA,GAAK0xD,EAAQ19F,GACnB9T,OAAQuyG,EACRE,UAAWzrE,gBAAoBurE,EAAgBE,WAAW,EAC1DtM,MAAOn/D,UACCwqE,EAAOxnF,aAAewnF,EAAO2B,YAAc3B,EAAOxnF,aAAewnF,EAAO4B,YAClE,IAAIh9E,SAASr4B,IACfyzG,EAAOpzD,iBAAiB,SAAS,KAC7BrgD,GAAS,IAEbyzG,EAAOrL,OAAO,GAEtB,EAEJ7gG,QAAS,KACmB,MAApBksG,EAAO6B,UACP7B,EAAO6B,YAGP7B,EAAOrL,OACX,EAEJ6M,gBACAC,aACAzB,SAGP,EDpCU7xD,CADQ,IAAI,GAAU6sC,EAAItsF,WAAYy2B,EAAK28E,WAC5B38E,EAC1B,CENO,MAAM48E,WAA4BC,MACrCx0G,KACA2iD,OACA,WAAAx4C,CAAYnK,EAAM2iD,GACd1X,MAAMjrC,GACNnF,KAAKmF,KAAOA,EAEZnF,KAAK8nD,OAASA,CAClB,ECTG,SAAS,GAAIs+C,GAChB,OAAOA,EAAWv5F,QAAQstD,GACf,GAAiBwvC,WAAWxvC,IAAO,GAAWwvC,WAAWxvC,IAExE,CAIO,SAASu9C,GAAItR,GAChB,OAAOA,EAAWv5F,QAAQstD,GACf,GAAiBwvC,WAAWxvC,IAE3C,CCiBA,MAAM,GACF/uD,IACAS,KACA8xC,OACAqkD,QACAz5C,WACA,WAAAj5C,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,qBAC1CzjG,KAAK29C,OAAS4K,EAAW5K,OACzB39C,KAAKuoD,WAAaA,EAClBvoD,KAAK6L,KAAOA,EACc,MAAtB08C,EAAWy5C,UACXhiG,KAAKgiG,QAAU,CACX4X,aAAcrxD,EAAWy5C,QAAQ6X,qBAAqB,wCAAyC,CAC3FC,MAAO,QACPtX,KAAM,qDAItB,CACA,CAACwT,KAAmB,EACpB,CAACvyE,OAAOqB,aAAe,qBACvB,CAACstD,IAAuB,CACpB,qBAEJ,UAAMx4B,CAAKO,EAAIlgD,GACXja,KAAKoL,IAAI,aAAc+uD,GACvBlgD,EAAUA,GAAW,CAAC,EACtB,MACM8/F,EC1DP,SAAwB3zD,EAAQmnD,EAAYtzF,GAC/C,MAAM7O,EAAM6O,EAAQ0jC,OAAO8lD,aAAa,4BAClCzB,EAAU/nF,EAAQ+nF,QAClBgY,EAAe//F,EAAQ+/F,cAAgB,GACvCD,EAAS,CACX3uG,MACA,UAAM66C,CAAK9/C,GACP,UACUigD,EAAOH,KAAK,kBACd,UAAW,MAAMz2C,KAAOrJ,EAChBqJ,aAAeS,iBACTT,QAGAA,EAAIyS,UAGrB,CATiB,GAUtB,CACA,MAAOwE,GACc,YAAbA,EAAIthB,MACJiG,EAAIoc,MAAMf,EAElB,CACJ,EACAtgB,OAAQigD,EAAOjgD,OACfonG,aACA/mD,SAAU,CAAEh2B,KAAMhmB,KAAKu2D,OACvB,WAAMurC,CAAMryF,EAAU,CAAC,GACnB,MAAMjT,EAAQwD,KAAKu2D,MACnB,GAAsB,MAAlB9mD,EAAQmqC,OAAgB,CACxB,MAAMA,EAASioD,YAAYzlF,QClCd,KDmCb3M,EAAU,IACHA,EACHmqC,SAER,CACA,MAAM/jD,EAAW,KACb,MAAM,KAAE0zD,EAAI,KAAE7B,GAAS6nD,EAAOxM,WAAW35C,YACzCxoD,EAAI,qEAAsE2oD,EAAM7B,EAAM1nD,KAAKu2D,MAAQ/5D,GACnGhH,KAAKonE,MAAM,IAAI,GAAW,wBAAwB,EAEtDntD,EAAQmqC,QAAQG,iBAAiB,QAASlkD,GAC1C,UACU+lD,EAAOkmD,OACjB,CACA,MAAO7lF,GACHrb,EAAIoc,MAAM,qCAAsCf,GAChDzmB,KAAKonE,MAAM3gD,EACf,CACA,QACIxM,EAAQmqC,QAAQK,oBAAoB,QAASpkD,GAC7C05G,EAAOvzD,SAAS8lD,MAAQ9hG,KAAKu2D,KACjC,CACJ,EACA,KAAAqG,CAAM3gD,GACF,MAAM,KAAEstC,EAAI,KAAE7B,GAAS6nD,EAAOxM,WAAW35C,YACzCxoD,EAAI,+CAAgD2oD,EAAM7B,EAAMzrC,GAChE2/B,EAAO36C,UACPsuG,EAAOvzD,SAAS8lD,MAAQ9hG,KAAKu2D,MAK7BihC,GAAShE,UAAU,CAAE,CAAC,GAAGgc,WAAsB,GACnD,GAWJ,OATA5zD,EAAOuxD,OAAOpzD,iBAAiB,SAAS,KACpCy9C,GAAShE,UAAU,CAAE,CAAC,GAAGgc,WAAsB,IAIlB,MAAzBD,EAAOvzD,SAAS8lD,QAChByN,EAAOvzD,SAAS8lD,MAAQ9hG,KAAKu2D,MACjC,GACD,CAAEhhE,MAAM,IACJg6G,CACX,CDnBuBE,OADMj6G,KAAKk6G,SAAS//C,EAAIlgD,GACDkgD,EAAI,CACtCxc,OAAQ39C,KAAK29C,OACbqkD,QAAShiG,KAAKgiG,SAAS4X,eAE3B55G,KAAKoL,IAAI,6BAA8B2uG,EAAOxM,YAC9C,MAAM51C,QAAa19C,EAAQkgG,SAASC,gBAAgBL,EAAQ9/F,GAE5D,OADAja,KAAKoL,IAAI,kCAAmC2uG,EAAOxM,YAC5C51C,CACX,CACA,cAAMuiD,CAAS//C,EAAIlgD,GACfA,GAASmqC,QAAQC,iBACjB,MAAMg2D,EAAQlgD,EAAGvG,YACjB5zD,KAAKoL,IAAI,gBAAiBivG,EAAMtmD,KAAMsmD,EAAMnoD,MAC5C,MAAMooD,EAAe33D,KACf43D,EAAYlC,GV2HnB,SAAwBtiF,GAC3B,MACM3Y,EADK,GAAU2Y,GACJi9B,eACXvxC,EAAOrE,EAAMogB,MACnB,GAAY,MAAR/b,EACA,MAAM,IAAIjjB,MAAM,+BAEpB,MAAM0pD,EAAW,GAAUzmC,EAAK,IAC1Bk1F,EAAcC,GAAa1uD,EAASnnD,MAC1C,GAAmB,MAAf41G,EACA,MAAM,IAAIn4G,MAAM,4BAA4B0pD,EAASnnD,QAEzD,IAAIy5G,EAAM7D,EAAYl1F,EAAK,IAAM,GAAIrE,GAmBrC,OAlBkC84F,GAAkBlrF,SAASvJ,EAAK,MAE9D+4F,EAAMA,EAAIx0G,QAAQ,WAAY,IAE1Bw0G,EADY,QAAZ/4F,EAAK,GACC,WAAW+4F,IAGX,UAAUA,MAGpBA,EAAIjuF,WAAW,YAAciuF,EAAIjuF,WAAW,aAAeiuF,EAAIjuF,WAAW,UAAYiuF,EAAIjuF,WAAW,aAErGiuF,EAAM,IAAIrnB,IAAIqnB,GAAKn0G,WAEfm0G,EAAIluF,SAAS,OACbkuF,EAAMA,EAAI/yG,UAAU,EAAG+yG,EAAI/4G,OAAS,KAGrC+4G,CACX,CU3JkC,CAAMrgD,GAAKn6D,KAAK6L,MAC1C0uG,EAAU5C,OAAOpzD,iBAAiB,SAAS,KAIvC,MAAM99B,EAAM,IAAI6jD,GAAsB,wBAAwBnQ,EAAG9zD,cACjErG,KAAKoL,IAAIoc,MAAM,oBAAqBf,GACpCzmB,KAAKgiG,SAAS4X,aAAa5b,UAAU,CAAEx2E,OAAO,IAC9C8yF,EAAa99E,OAAO/V,EAAI,IAE5B,IACIxM,EAAQwgG,aAAa,IAAIf,GAAoB,qCACvC/0D,GAAWpoB,QAAQioB,KAAK,CAAC+1D,EAAU3B,YAAa0B,EAAa13D,UAAW3oC,EAAQmqC,OAC1F,CACA,MAAO39B,GAQH,MAPIxM,EAAQmqC,QAAQQ,SAChB5kD,KAAKgiG,SAAS4X,aAAa5b,UAAU,CAAE52B,OAAO,IAElDmzC,EAAUjO,QACLhpE,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,2BAA4Bf,EAAI,IAE7CA,CACV,CAGA,OAFAzmB,KAAKoL,IAAI,eAAgB+uD,GACzBn6D,KAAKgiG,SAAS4X,aAAa5b,UAAU,CAAEqa,SAAS,IACzCkC,CACX,CAMA,cAAAG,CAAezgG,GACX,OG9GD,WACH,MAAM,IAAIzb,MAAM,uDACpB,CH4Gek8G,EACK16G,KAAK29C,OACL39C,KAAKuoD,WAAWznD,OACfd,KAAKuoD,WAAWy5C,SAEtBhiG,KAAK6L,KAGhB,CAMA,YAAA8uG,CAAavU,GAET,OADAA,EAAazkG,MAAM2Q,QAAQ8zF,GAAcA,EAAa,CAACA,GAC9B,MAArBpmG,KAAK6L,MAAMgB,OACJ7M,KAAK6L,MAAMgB,OAAOu5F,GAEtB,GAAYA,EACvB,CAIA,UAAAwU,CAAWxU,GACP,OAAOpmG,KAAK26G,aAAavU,EAC7B,EAEG,SAASyU,GAAWhvG,EAAO,CAAC,GAC/B,OAAQ08C,GACG,IAAI,GAAWA,EAAY18C,EAE1C,iCI9IO,MAAM,WAAqBrN,MACjC,WAAA8Q,CAAY9C,GACX4jC,MAAM5jC,GACNxM,KAAKe,KAAO,cACb,EAOM,MAAM,WAAmBvC,MAC/B,WAAA8Q,CAAY9C,GACX4jC,QACApwC,KAAKe,KAAO,aACZf,KAAKwM,QAAUA,CAChB,EAMD,MAAMsuG,GAAkBj2D,QAA4C3lD,IAA5B04B,WAAWmjF,aAChD,IAAI,GAAWl2D,GACf,IAAIk2D,aAAal2D,GAKdm2D,GAAmB52D,IACxB,MAAM0b,OAA2B5gE,IAAlBklD,EAAO0b,OACnBg7C,GAAgB,+BAChB12D,EAAO0b,OAEV,OAAOA,aAAkBthE,MAAQshE,EAASg7C,GAAgBh7C,EAAO,EAGnD,SAASm7C,GAASr4D,EAAS3oC,GACzC,MAAM,aACL6zF,EAAY,SACZoN,EAAQ,QACR1uG,EAAO,aACP2uG,EAAe,CAACt0F,WAAYN,eACzBtM,EAEJ,IAAIs8C,EACA6kD,EAEJ,MA4DMC,EA5DiB,IAAI9+E,SAAQ,CAACr4B,EAASs4B,KAC5C,GAA4B,iBAAjBsxE,GAAyD,IAA5B7kG,KAAKqV,KAAKwvF,GACjD,MAAM,IAAI1tG,UAAU,4DAA4D0tG,OAGjF,GAAI7zF,EAAQmqC,OAAQ,CACnB,MAAM,OAACA,GAAUnqC,EACbmqC,EAAOQ,SACVpoB,EAAOw+E,GAAiB52D,IAGzBg3D,EAAe,KACd5+E,EAAOw+E,GAAiB52D,GAAQ,EAGjCA,EAAOG,iBAAiB,QAAS62D,EAAc,CAACr7G,MAAM,GACvD,CAEA,GAAI+tG,IAAiBvjG,OAAO+wG,kBAE3B,YADA14D,EAAQrf,KAAKr/B,EAASs4B,GAKvB,MAAM++E,EAAe,IAAI,GAEzBhlD,EAAQ4kD,EAAat0F,WAAW5lB,UAAK/B,GAAW,KAC/C,GAAIg8G,EACH,IACCh3G,EAAQg3G,IACT,CAAE,MAAO1zF,GACRgV,EAAOhV,EACR,KAK6B,mBAAnBo7B,EAAQ0B,QAClB1B,EAAQ0B,UAGO,IAAZ93C,EACHtI,IACUsI,aAAmBhO,MAC7Bg+B,EAAOhwB,IAEP+uG,EAAa/uG,QAAUA,GAAW,2BAA2BshG,iBAC7DtxE,EAAO++E,GACR,GACEzN,GAEH,WACC,IACC5pG,QAAc0+C,EACf,CAAE,MAAOp7B,GACRgV,EAAOhV,EACR,CACA,EAND,EAMI,IAGoC8oE,SAAQ,KAChD+qB,EAAkB97G,QACd67G,GAAgBnhG,EAAQmqC,QAC3BnqC,EAAQmqC,OAAOK,oBAAoB,QAAS22D,EAC7C,IAQD,OALAC,EAAkB97G,MAAQ,KACzB47G,EAAa50F,aAAatlB,UAAK/B,EAAWq3D,GAC1CA,OAAQr3D,CAAS,EAGXm8G,CACR,CCxHe,MAAMG,GACjB,GAAS,GACT,OAAAC,CAAQp4C,EAAKppD,GAKT,MAAMyhG,EAAU,CACZC,UALJ1hG,EAAU,CACN0hG,SAAU,KACP1hG,IAGe0hG,SAClBjrG,GAAIuJ,EAAQvJ,GACZ2yD,OAEJ,GAAkB,IAAdrjE,KAAKvB,MAAcuB,MAAK,EAAOA,KAAKvB,KAAO,GAAGk9G,UAAY1hG,EAAQ0hG,SAElE,YADA37G,MAAK,EAAOQ,KAAKk7G,GAGrB,MAAM7wG,ECfC,SAAoBiI,EAAO9T,GACtC,IAAI60B,EAAQ,EACRpM,EAAQ3U,EAAMrR,OAClB,KAAOgmB,EAAQ,GAAG,CACd,MAAMm0F,EAAO3yG,KAAKu2C,MAAM/3B,EAAQ,GAChC,IAAIo0F,EAAKhoF,EAAQ+nF,EDU+Bj7F,ECTjC7N,EAAM+oG,GAAK78G,EDSiC28G,SAAWh7F,EAAEg7F,UCTpC,GAChC9nF,IAAUgoF,EACVp0F,GAASm0F,EAAO,GAGhBn0F,EAAQm0F,CAEhB,CDEmD,IAACj7F,ECDpD,OAAOkT,CACX,CDAsBioF,CAAW97G,MAAK,EAAQ07G,GACtC17G,MAAK,EAAOkL,OAAOL,EAAO,EAAG6wG,EACjC,CACA,WAAAK,CAAYrrG,EAAIirG,GACZ,MAAM9wG,EAAQ7K,MAAK,EAAOg8G,WAAWN,GAAYA,EAAQhrG,KAAOA,IAChE,IAAe,IAAX7F,EACA,MAAM,IAAIoxG,eAAe,oCAAoCvrG,2BAEjE,MAAO80C,GAAQxlD,MAAK,EAAOkL,OAAOL,EAAO,GACzC7K,KAAKy7G,QAAQj2D,EAAK6d,IAAK,CAAEs4C,WAAUjrG,MACvC,CACA,OAAAwrG,GACI,MAAM12D,EAAOxlD,MAAK,EAAOsI,QACzB,OAAOk9C,GAAM6d,GACjB,CACA,MAAAx2D,CAAOoN,GACH,OAAOja,MAAK,EAAO6M,QAAQ6uG,GAAYA,EAAQC,WAAa1hG,EAAQ0hG,WAAUr3G,KAAKo3G,GAAYA,EAAQr4C,KAC3G,CACA,QAAI5kE,GACA,OAAOuB,MAAK,EAAOyB,MACvB,EE/BW,MAAM06G,WAAe,GAChC,GACA,GACA,GAAiB,EACjB,GACA,GACA,GAAe,EACf,GACA,GACA,GACA,GACA,GAAW,EAEX,GACA,GACA,GAEA,GAAc,GAMdv1F,QAEA,WAAAtX,CAAY2K,GAYR,GAXAm2B,UAWqC,iBATrCn2B,EAAU,CACNmiG,2BAA2B,EAC3BC,YAAa9xG,OAAO+wG,kBACpBvlD,SAAU,EACVumD,YAAa/xG,OAAO+wG,kBACpBiB,WAAW,EACXC,WAAYhB,MACTvhG,IAEcoiG,aAA4BpiG,EAAQoiG,aAAe,GACpE,MAAM,IAAIj8G,UAAU,gEAAgE6Z,EAAQoiG,aAAah2G,YAAc,gBAAgB4T,EAAQoiG,gBAEnJ,QAAyBn9G,IAArB+a,EAAQ87C,YAA4BxrD,OAAOsZ,SAAS5J,EAAQ87C,WAAa97C,EAAQ87C,UAAY,GAC7F,MAAM,IAAI31D,UAAU,2DAA2D6Z,EAAQ87C,UAAU1vD,YAAc,gBAAgB4T,EAAQ87C,aAE3I/1D,MAAK,EAA6Bia,EAAQmiG,0BAC1Cp8G,MAAK,EAAqBia,EAAQoiG,cAAgB9xG,OAAO+wG,mBAA0C,IAArBrhG,EAAQ87C,SACtF/1D,MAAK,EAAeia,EAAQoiG,YAC5Br8G,MAAK,EAAYia,EAAQ87C,SACzB/1D,MAAK,EAAS,IAAIia,EAAQuiG,WAC1Bx8G,MAAK,EAAcia,EAAQuiG,WAC3Bx8G,KAAKs8G,YAAcriG,EAAQqiG,YAC3Bt8G,KAAK4mB,QAAU3M,EAAQ2M,QACvB5mB,MAAK,GAA6C,IAA3Bia,EAAQwiG,eAC/Bz8G,MAAK,GAAkC,IAAtBia,EAAQsiG,SAC7B,CACA,KAAI,GACA,OAAOv8G,MAAK,GAAsBA,MAAK,EAAiBA,MAAK,CACjE,CACA,KAAI,GACA,OAAOA,MAAK,EAAWA,MAAK,CAChC,CACA,KACIA,MAAK,IACLA,MAAK,IACLA,KAAK6B,KAAK,OACd,CACA,KACI7B,MAAK,IACLA,MAAK,IACLA,MAAK,OAAad,CACtB,CACA,KAAI,GACA,MAAM6hE,EAAMv2D,KAAKu2D,MACjB,QAAyB7hE,IAArBc,MAAK,EAA2B,CAChC,MAAM08G,EAAQ18G,MAAK,EAAe+gE,EAClC,KAAI27C,EAAQ,GAYR,YALwBx9G,IAApBc,MAAK,IACLA,MAAK,EAAa6mB,YAAW,KACzB7mB,MAAK,GAAmB,GACzB08G,KAEA,EATP18G,MAAK,EAAkBA,MAA+B,EAAIA,MAAK,EAAW,CAWlF,CACA,OAAO,CACX,CACA,KACI,GAAyB,IAArBA,MAAK,EAAOvB,KAWZ,OARIuB,MAAK,GACLq2D,cAAcr2D,MAAK,GAEvBA,MAAK,OAAcd,EACnBc,KAAK6B,KAAK,SACY,IAAlB7B,MAAK,GACLA,KAAK6B,KAAK,SAEP,EAEX,IAAK7B,MAAK,EAAW,CACjB,MAAM28G,GAAyB38G,MAAK,EACpC,GAAIA,MAAK,GAA6BA,MAAK,EAA6B,CACpE,MAAM48G,EAAM58G,MAAK,EAAOk8G,UACxB,QAAKU,IAGL58G,KAAK6B,KAAK,UACV+6G,IACID,GACA38G,MAAK,KAEF,EACX,CACJ,CACA,OAAO,CACX,CACA,KACQA,MAAK,QAA2Cd,IAArBc,MAAK,IAGpCA,MAAK,EAAcg2D,aAAY,KAC3Bh2D,MAAK,GAAa,GACnBA,MAAK,GACRA,MAAK,EAAewK,KAAKu2D,MAAQ/gE,MAAK,EAC1C,CACA,KACgC,IAAxBA,MAAK,GAA0C,IAAlBA,MAAK,GAAkBA,MAAK,IACzDq2D,cAAcr2D,MAAK,GACnBA,MAAK,OAAcd,GAEvBc,MAAK,EAAiBA,MAAK,EAA6BA,MAAK,EAAW,EACxEA,MAAK,GACT,CAIA,KAEI,KAAOA,MAAK,MAChB,CACA,eAAIs8G,GACA,OAAOt8G,MAAK,CAChB,CACA,eAAIs8G,CAAYO,GACZ,KAAgC,iBAAnBA,GAA+BA,GAAkB,GAC1D,MAAM,IAAIz8G,UAAU,gEAAgEy8G,eAA4BA,MAEpH78G,MAAK,EAAe68G,EACpB78G,MAAK,GACT,CACA,OAAM,CAAcokD,GAChB,OAAO,IAAI7nB,SAAQ,CAACksC,EAAUjsC,KAC1B4nB,EAAOG,iBAAiB,SAAS,KAC7B/nB,EAAO4nB,EAAO0b,OAAO,GACtB,CAAE//D,MAAM,GAAO,GAE1B,CAqCA,WAAAg8G,CAAYrrG,EAAIirG,GACZ37G,MAAK,EAAO+7G,YAAYrrG,EAAIirG,EAChC,CACA,SAAM3+F,CAAI8/F,EAAW7iG,EAAU,CAAC,GAQ5B,OANAA,EAAQvJ,MAAQ1Q,MAAK,KAAeqG,WACpC4T,EAAU,CACN2M,QAAS5mB,KAAK4mB,QACd61F,eAAgBz8G,MAAK,KAClBia,GAEA,IAAIsiB,SAAQ,CAACr4B,EAASs4B,KACzBx8B,MAAK,EAAOy7G,SAAQtuE,UAChBntC,MAAK,IACLA,MAAK,IACL,IACIia,EAAQmqC,QAAQC,iBAChB,IAAIznB,EAAYkgF,EAAU,CAAE14D,OAAQnqC,EAAQmqC,SACxCnqC,EAAQ2M,UACRgW,EAAYq+E,GAAS1+E,QAAQr4B,QAAQ04B,GAAY,CAAEkxE,aAAc7zF,EAAQ2M,WAEzE3M,EAAQmqC,SACRxnB,EAAYL,QAAQioB,KAAK,CAAC5nB,EAAW58B,MAAK,EAAcia,EAAQmqC,WAEpE,MAAMtvC,QAAe8nB,EACrB14B,EAAQ4Q,GACR9U,KAAK6B,KAAK,YAAaiT,EAC3B,CACA,MAAO0S,GACH,GAAIA,aAAiB,KAAiBvN,EAAQwiG,eAE1C,YADAv4G,IAGJs4B,EAAOhV,GACPxnB,KAAK6B,KAAK,QAAS2lB,EACvB,CACA,QACIxnB,MAAK,GACT,IACDia,GACHja,KAAK6B,KAAK,OACV7B,MAAK,GAAoB,GAEjC,CACA,YAAM+8G,CAAOC,EAAW/iG,GACpB,OAAOsiB,QAAQgpB,IAAIy3D,EAAU14G,KAAI6oC,MAAO2vE,GAAc98G,KAAKgd,IAAI8/F,EAAW7iG,KAC9E,CAIA,KAAAjT,GACI,OAAKhH,MAAK,GAGVA,MAAK,GAAY,EACjBA,MAAK,IACEA,MAJIA,IAKf,CAIA,KAAAi9G,GACIj9G,MAAK,GAAY,CACrB,CAIA,KAAAT,GACIS,MAAK,EAAS,IAAIA,MAAK,CAC3B,CAMA,aAAMmkD,GAEuB,IAArBnkD,MAAK,EAAOvB,YAGVuB,MAAK,EAAS,QACxB,CAQA,oBAAMk9G,CAAevuD,GAEb3uD,MAAK,EAAOvB,KAAOkwD,SAGjB3uD,MAAK,EAAS,QAAQ,IAAMA,MAAK,EAAOvB,KAAOkwD,GACzD,CAMA,YAAMwuD,GAEoB,IAAlBn9G,MAAK,GAAuC,IAArBA,MAAK,EAAOvB,YAGjCuB,MAAK,EAAS,OACxB,CACA,OAAM,CAASG,EAAO0M,GAClB,OAAO,IAAI0vB,SAAQr4B,IACf,MAAM7D,EAAW,KACTwM,IAAWA,MAGf7M,KAAK2C,IAAIxC,EAAOE,GAChB6D,IAAS,EAEblE,KAAKyC,GAAGtC,EAAOE,EAAS,GAEhC,CAIA,QAAI5B,GACA,OAAOuB,MAAK,EAAOvB,IACvB,CAMA,MAAA2+G,CAAOnjG,GAEH,OAAOja,MAAK,EAAO6M,OAAOoN,GAASxY,MACvC,CAIA,WAAI66B,GACA,OAAOt8B,MAAK,CAChB,CAIA,YAAI6iC,GACA,OAAO7iC,MAAK,CAChB,EC9VG,SAASq9G,GAASx6G,GACrB,MAAMy6G,EAAgB,CAClBC,GAAW9jE,GAEf,OAAa,MAAT52C,EACOy6G,EAEP37G,MAAM2Q,QAAQzP,GACO,IAAjBA,EAAMpB,OACC67G,EAEJz6G,EAEJ,CACHA,EAER,CCXO,SAAS26G,GAAcjrG,GAC1B,MAAO,CACHkrG,OAAQlrG,EAAIkrG,QAAU,EACtBC,GAAInrG,EAAImrG,IAAMnrG,EAAIorG,UAAW,EAC7BC,GAAIrrG,EAAIqrG,IAAMrrG,EAAIsrG,UAAW,EAC7BC,GAAIvrG,EAAIurG,IAAMvrG,EAAIwrG,UAAW,EAC7BC,GAAIzrG,EAAIyrG,IAAMzrG,EAAI0rG,UAAW,EAC7BC,GAAI3rG,EAAI2rG,IAAM3rG,EAAI4rG,UAAW,EAC7BC,UAAW7rG,EAAI6rG,UAAY7rG,EAAI8rG,WAAa,IAAI/5G,KAAKg6G,IAC1C,CACHv9G,KAAMu9G,EAASv9G,KACfoE,KAAMo4G,GAAWe,EAASn5G,UAGlCo5G,QAAShsG,EAAIgsG,QAAUhsG,EAAIisG,SAAW,IAAIl6G,KAAKm6G,IACpC,CACH19G,KAAM09G,EAAO19G,KACboE,KAAMo4G,GAAWkB,EAAOt5G,MACxBu5G,IAAMD,EAAOC,KAAOD,EAAOlY,KAnBhB,GAoBX58D,KAAM80E,EAAO90E,gBAAgB15B,WAAa,GAAmBwuG,EAAO90E,MAAQ80E,EAAO90E,SAInG,CCFO,SAASg1E,GAAiBhsB,EAAK9mF,EAAO,CAAC,GAC1C,MAAM+yG,EAAY,IAAIzC,GAAO,CACzBG,YAAazwG,EAAKgzG,kBAlBe,IAoBrC,OAAO1xE,MAAO2xE,EAAM7kG,EAAU,CAAC,KAC3B,MAAM8kG,EAAe,IAAIC,gBACzBD,EAAaz/G,IAAI,OAAQw/G,GACzBzB,GAASpjG,EAAQpX,OAAOsK,SAAQhI,IAE5B45G,EAAa5/D,OAAO,OAAQo+D,GAAWp4G,GAAM,IAEjD8U,EAAQwgG,aAAa,IAAIf,GAAoB,YAAa,CAAE5xD,OAAQg3D,KAEpE,MAAMzuF,QAAiBuuF,EAAU5hG,KAAImwB,UACjC,MAAMvH,QAAY7lB,MAAM,GAAG4yE,KAAOosB,IAAgB,CAC9CE,QAAS,CACLC,OAAQ,wBAEZ96D,OAAQnqC,GAASmqC,SAErB,GAAmB,MAAfxe,EAAIxV,OACJ,MAAM,IAAI5xB,MAAM,2BAA2BonC,EAAIxV,YAAYwV,EAAIu5E,cAEnE,MAAM9uF,EAAWmtF,SAAoB53E,EAAIlrB,QAEzC,OADAT,EAAQwgG,aAAa,IAAIf,GAAoB,eAAgB,CAAE5xD,OAAQz3B,KAChEA,CAAQ,GAChB,CACC+zB,OAAQnqC,EAAQmqC,SAEpB,GAAgB,MAAZ/zB,EACA,MAAM,IAAI7xB,MAAM,4BAEpB,OAAO6xB,CAAQ,CAEvB,KC0BWktF,+BC/EX,MAAM6B,GACFC,IACA,WAAA/vG,CAAYgwG,GACRt/G,KAAKq/G,IAAME,GAAQD,EACvB,CACA,GAAAlgH,CAAI0/G,EAAMj8G,GACN,IAAI28G,GAAkB,EACtB,MAAMhB,EAAU,GAChB,IAAK,MAAMr5G,KAAQtC,EAAO,CACtB,MAAM48G,EAASz/G,KAAK0/G,WAAWZ,EAAM35G,GACrC,GAAsB,IAAlBs6G,EAAOh+G,OAAc,CACrB+9G,GAAkB,EAClB,KACJ,CACAhB,EAAQh+G,QAAQi/G,EACpB,CACA,GAAID,EACA,OAAOhC,GAAc,CAAEgB,WAE/B,CACA,UAAAkB,CAAWliC,EAAQr4E,GACf,MAAMpG,EAAM,GAAGy+E,EAAOpjE,iBAAiBjV,IACjCq5G,EAAUx+G,KAAKq/G,IAAIjgH,IAAIL,GAC7B,GAAe,MAAXy/G,EAAiB,CACjB,MAAMmB,EAAgBnB,EACjB3xG,QAAQ4xC,GACFA,EAAMmhE,QAAUp1G,KAAKu2D,QAE3Bz8D,KAAI,EAAGs7G,UAAS5gH,YAAY,IAC1BA,EACH0/G,IAAKz1G,KAAKuuB,OAAOooF,EAAUp1G,KAAKu2D,OAAS,KACzC57D,KAAMo4G,GAAWv+G,EAAMmG,UAO3B,OAL6B,IAAzBw6G,EAAcl+G,QACdzB,KAAKq/G,IAAIlgH,OAAOJ,GAIb4gH,CACX,CACA,MAAO,EACX,CACA,GAAA3iG,CAAIwgE,EAAQihC,GACR,MAAM1/G,EAAM,GAAGy+E,EAAOpjE,iBAAiBqkG,EAAOt5G,OACxCq5G,EAAUx+G,KAAKq/G,IAAIjgH,IAAIL,IAAQ,GACrCy/G,EAAQh+G,KAAK,CACTo/G,QAASp1G,KAAKu2D,MAAuC,KAA7B09C,EAAOC,KHjDhB,IGkDf1/G,MAAOy/G,IAEXz+G,KAAKq/G,IAAI//G,IAAIP,EAAKy/G,EACtB,CACA,MAAAr/G,CAAOq+E,EAAQr4E,GACX,MAAMpG,EAAM,GAAGy+E,EAAOpjE,iBAAiBjV,IACvCnF,KAAKq/G,IAAIlgH,OAAOJ,EACpB,CACA,KAAAQ,GACIS,KAAKq/G,IAAI9/G,OACb,EC5DG,MAAM,GACT61D,UACA12D,MACA,WAAA4Q,CAAYzD,GD8DT,IAAepN,EC7DduB,KAAKo1D,UAAY,CAAC,EAClBp1D,KAAKtB,OD4DSD,EC5DKoN,EAAKg0G,WANE,IDmEvB,IAAIT,GAAc3gH,IC5DrBE,OAAOwxD,QAAQtkD,EAAKupD,WAAa,CAAC,GAAGjoD,SAAQ,EAAE2yG,EAAK3qD,MAC3CxzD,MAAM2Q,QAAQ6iD,KACfA,EAAW,CAACA,IAGX2qD,EAAIxzF,SAAS,OACdwzF,EAAM,GAAGA,MAEb9/G,KAAKo1D,UAAU0qD,GAAO3qD,CAAQ,IAGP,MAAvBn1D,KAAKo1D,UAAU,OACfp1D,KAAKo1D,UAAU,KCrBhB,CACHupD,GAAiB,wCACjBA,GAAiB,+BDqBrB,CASA,WAAMlpE,CAAM+nC,EAAQvjE,EAAU,CAAC,GAC3B,MAAMpX,EAAQw6G,GAASpjG,EAAQpX,OACzB48G,GAA4B,IAAnBxlG,EAAQwlG,OAAmBz/G,KAAKtB,MAAMU,IAAIo+E,EAAQ36E,QAAS3D,EAC1E,GAAc,MAAVugH,EAEA,OADAxlG,EAAQwgG,aAAa,IAAIf,GAAoB,YAAa,CAAE5xD,OAAQ23D,KAC7DA,EAEX,MAAMK,EAAM,GAAGtiC,EAAO91E,MAAM,KAAK81B,SAC3B43B,GAAap1D,KAAKo1D,UAAU0qD,IAAQ9/G,KAAKo1D,UAAU,MAAMhnD,MAAK,IACxDnF,KAAKm0B,SAAW,IAAQ,EAAI,IAElCjW,EAAS,GACf,IAAK,MAAMguC,KAAYC,EAAW,CAE9B,IAAgC,IAA5Bn7C,EAAQmqC,QAAQQ,QAChB,MAEJ,IACI,MAAM9vC,QAAeqgD,EAASqoB,EAAQ,IAC/BvjE,EACHpX,UAEJ,IAAK,MAAM47G,KAAU3pG,EAAOypG,OACxBv+G,KAAKtB,MAAMse,IAAIwgE,EAAQihC,GAE3B,OAAO3pG,CACX,CACA,MAAO2R,GACHU,EAAO3mB,KAAKimB,GACZxM,EAAQwgG,aAAa,IAAIf,GAAoB,YAAa,CAAE5xD,OAAQrhC,IACxE,CACJ,CACA,GAAsB,IAAlBU,EAAO1lB,OACP,MAAM0lB,EAAO,GAEjB,MAAM,IAAI0yC,eAAe1yC,EAAQ,iBAAiBq2D,KAAU36E,WAChE,GFkBJ,SAAW06G,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,II1FhC,MACQxoG,KAAMgrG,IAAgB,GAAY,WAC1C,MAAMC,WAA4BxhH,MAC9B,WAAA8Q,CAAY9C,EAAU,+BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAEG,MAAMk/G,GAAkB9yE,eAA+BgtB,EAAIlgD,EAAU,CAAC,GACzE,MAAMimG,EAAiBjmG,EAAQkmG,mBATP,GAUxB,GAAuB,IAAnBD,EACA,MAAM,IAAIF,GAAoB,+BAElC,MAAO,CAAE3G,GAAYl/C,EAAGnH,eAAe15B,MAAK,EAAEwkB,KAAWA,IAAUiiE,MAAgB,GAC7E5qD,EAAWl7C,GAASg9F,KJiFvB,SAAaprG,EAAO,CAAC,GACxB,OAAO,IAAI,GAASA,EACxB,CInFqCorG,GAC3BniG,QAAeqgD,EAAS1f,MAAM,YAAY4jE,IAAY,CACxDj1D,OAAQnqC,GAASmqC,OACjBvhD,MAAO,CACH06G,GAAW6C,OAGbl5D,EAASiT,EAAGrF,YACZnW,EAAS,GACf,IAAK,MAAM8/D,KAAU3pG,EAAOypG,OAAQ,CAChC,MAAMpvD,EAAOsvD,EAAO90E,KACf3jC,QAAQ,QAAS,IACjB2B,OACAD,MAAM,KAAK,GAChB,GAAY,MAARynD,EACA,SAEJ,GAAc,MAAVjI,IAAmBiI,EAAKnkC,SAASk8B,GACjC,SAEJ,MAAMiT,EAAK,GAAUhL,GACrB,GAAIA,EAAK5iC,WAAW,YAAa,CAC7B,MAAM9Q,QAAiB0+C,EAAGj2D,QAAQ,IAC3B+V,EACHkmG,kBAAmBD,EAAiB,IAExCvhE,EAAOn+C,QAAQib,EAASnX,KAAI61D,GAAMA,EAAG9zD,aACzC,MAEIs4C,EAAOn+C,KAAK25D,EAAG9zD,WAEvB,CACA,OAAOs4C,CACX,EC3CA,6BCJM0hE,GAAgB,CAClBtZ,UAAW,CACPjjE,OAAQ,GACRw8E,SAAU,GACVC,WAAY,GACZC,eAAiBpa,GAAeA,GAEpCz9C,kBAAmB,CACfyM,UAAW,CACP2hD,QAASkJ,KAGjBQ,iBAAkB,CACdC,eAAgBzK,GAAe0K,YAGhCxzE,eAAeyzE,GAAe9jF,GACjC,MAAM+jF,EAAmB,GAAaR,GAAevjF,GACrD,GAA6C,OAAzC+jF,EAAiBC,qBAA8E,MAA9ClpF,WAAWxmB,SAASvH,KAAKk3G,kBAC1E,MAAM,IAAI,GAAuB,8DAErC,OAAOF,CACX,CCNO,MAAMG,GAAuBv9E,OAAOmL,IAAI,2BCAlCqyE,GAAoBx9E,OAAOmL,IAAI,wBClBtC7rC,GAAI,IACJq0B,GAAQ,GAAJr0B,GACJ+S,GAAQ,GAAJshB,GACJ3a,GAAQ,GAAJ3G,GACJ/B,GAAQ,EAAJ0I,GA6EV,GA3EA,SAAYzd,EAAOib,GACf,IACI,GAAqB,iBAAVjb,GAAsBA,EAAMyC,OAAS,EAC5C,OAiBZ,SAAesE,GAEX,IADAA,EAAMiJ,OAAOjJ,IACLtE,OAAS,IACb,MAAM,IAAIjD,MAAM,uDAEpB,MAAMiK,EAAQ,mIAAmIC,KAAK3C,GACtJ,IAAK0C,EACD,OAAOqhB,IAEX,MAAMtW,EAAIuW,WAAWthB,EAAM,IACrBtD,GAAQsD,EAAM,IAAM,MAAM2R,cAChC,OAAQjV,GACJ,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACD,OAtCFsX,SAsCSjJ,EACX,IAAK,QACL,IAAK,OACL,IAAK,IACD,OAAOA,EAAIO,GACf,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOP,EAAIiJ,GACf,IAAK,QACL,IAAK,OACL,IAAK,MACL,IAAK,KACL,IAAK,IACD,OAAOjJ,EAAIsC,GACf,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAOtC,EAAI4jB,GACf,IAAK,UACL,IAAK,SACL,IAAK,OACL,IAAK,MACL,IAAK,IACD,OAAO5jB,EAAIzQ,GACf,IAAK,eACL,IAAK,cACL,IAAK,QACL,IAAK,OACL,IAAK,KACD,OAAOyQ,EACX,QAEI,MAAM,IAAIhV,MAAM,YAAY2G,+CAExC,CAvEmBmgB,CAAMtmB,GAEZ,GAAqB,iBAAVA,GAAsB6kB,SAAS7kB,GAC3C,OAAOib,GAAS1W,KA4F5B,SAAiBkH,GACb,MAAM6sB,EAAQruB,KAAKsE,IAAI9C,GACvB,OAAI6sB,GAAS7a,GACF4a,GAAO5sB,EAAI6sB,EAAO7a,GAAG,OAE5B6a,GAASxhB,GACFuhB,GAAO5sB,EAAI6sB,EAAOxhB,GAAG,QAE5BwhB,GAASF,GACFC,GAAO5sB,EAAI6sB,EAAOF,GAAG,UAE5BE,GAASv0B,GACFs0B,GAAO5sB,EAAI6sB,EAAOv0B,GAAG,UAEzB,GAAG0H,MACd,CA3GmCy2G,CAAQliH,GAyE3C,SAAkByL,GACd,MAAM6sB,EAAQruB,KAAKsE,IAAI9C,GACvB,OAAI6sB,GAAS7a,GACF,GAAGxT,KAAKuuB,MAAM/sB,EAAKgS,OAE1B6a,GAASxhB,GACF,GAAG7M,KAAKuuB,MAAM/sB,EAAKqL,OAE1BwhB,GAASF,GACF,GAAGnuB,KAAKuuB,MAAM/sB,EAAK2sB,OAE1BE,GAASv0B,GACF,GAAGkG,KAAKuuB,MAAM/sB,EAAK1H,OAEvB,GAAG0H,KACd,CAxFoDgtB,CAASz4B,GAErD,MAAM,IAAIR,MAAM,mCACpB,CACA,MAAOgpB,GACH,MAAMhb,EAiHd,SAAiBgb,GACb,MAAwB,iBAAVA,GAAgC,OAAVA,GAAkB,YAAaA,CACvE,CAnHwB25F,CAAQ35F,GAClB,GAAGA,EAAMhb,kBAAkB6Y,KAAKE,UAAUvmB,KAC1C,gCACN,MAAM,IAAIR,MAAMgO,EACpB,CACJ,EAqGA,SAAS6qB,GAAO5sB,EAAI6sB,EAAO9jB,EAAGzS,GAC1B,MAAMw2B,EAAWD,GAAa,IAAJ9jB,EAC1B,MAAO,GAAGvK,KAAKuuB,MAAM/sB,EAAK+I,MAAMzS,IAAOw2B,EAAW,IAAM,IAC5D,CCtHA,MAAM8C,GAyMN,WACI,IAGI,OAAOgB,YACX,CACA,MAAO7T,GAGP,CACJ,CAnNgB8T,GA0JV,GAAMruB,QAAQ7C,OAAS6C,QAAQ7B,KAAO,MAAU,GAuEtD,GCnOe,SAAevB,GA8C1B,SAASC,EAAYC,GACjB,IAAIC,EAEAC,EACAC,EAFAC,EAAiB,KAGrB,SAASC,KAASjI,GAGd,IAAKiI,EAAMC,QACP,OAEJ,MAAMC,EAAOF,EAEPtB,EAAOyB,OAAO,IAAIC,MAClBC,EAAK3B,GAAQkB,GAAYlB,GAC/BwB,EAAKI,KAAOD,EACZH,EAAKzB,KAAOmB,EACZM,EAAKxB,KAAOA,EACZkB,EAAWlB,EACX3G,EAAK,GAAK2H,EAAYa,OAAOxI,EAAK,IACX,iBAAZA,EAAK,IAEZA,EAAKyI,QAAQ,MAGjB,IAAIC,EAAQ,EACZ1I,EAAK,GAAKA,EAAK,GAAG6D,QAAQ,iBAAiB,CAACyC,EAAOqC,KAE/C,GAAc,OAAVrC,EACA,MAAO,IAEXoC,IAEA,MAAME,EAAYjB,EAAYkB,WAAWF,GACzC,GAAyB,mBAAdC,EAA0B,CACjC,MAAME,EAAM9I,EAAK0I,GACjBpC,EAAQsC,EAAU9J,KAAKqJ,EAAMW,GAE7B9I,EAAK+I,OAAOL,EAAO,GACnBA,GACJ,CACA,OAAOpC,CAAK,IAIhBqB,EAAYqB,WAAWlK,KAAKqJ,EAAMnI,IAEpBmI,EAAKc,KAAOtB,EAAYsB,KAChC7I,MAAM+H,EAAMnI,EACtB,CAiCA,OAhCAiI,EAAML,UAAYA,EAElBK,EAAMiB,UAAYvB,EAAYuB,YAC9BjB,EAAMkB,MAAQxB,EAAYyB,YAAYxB,GACtCK,EAAMoB,OAASA,EACfpB,EAAMqB,QAAU3B,EAAY2B,QAC5B9M,OAAO0K,eAAee,EAAO,UAAW,CACpCsB,YAAY,EACZC,cAAc,EACdvM,IAAK,IACsB,OAAnB+K,EACOA,GAGPF,IAAoBH,EAAY8B,aAEhC3B,EAAkBH,EAAY8B,WAC9B1B,EAAeJ,EAAYO,QAAQN,IAEhCG,GAEX5K,IAAKD,IACD8K,EAAiB9K,CAAC,IAKM,mBAArByK,EAAY+B,MAEnB/B,EAAY+B,KAAKzB,GAGdA,CACX,CACA,SAASoB,EAAOzB,EAAW+B,GACvB,MAAMC,EAAWjC,EAAY9J,KAAK+J,gBAAkC,IAAd+B,EAA4B,IAAMA,GAAa/B,GAErG,OADAgC,EAASX,IAAMpL,KAAKoL,IACbW,CACX,CAuEA,SAASq1G,EAAYC,GACjB,OAAOA,EAAOh7G,WACToB,UAAU,EAAG45G,EAAOh7G,WAAW5E,OAAS,GACxCuE,QAAQ,UAAW,IAC5B,CAsBA,OAtOA8D,EAAYM,MAAQN,EACpBA,EAAYyC,QAAUzC,EACtBA,EAAYa,OAkNZ,SAAgBM,GACZ,OAAIA,aAAezM,MACRyM,EAAIxE,OAASwE,EAAIuB,QAErBvB,CACX,EAtNAnB,EAAY2C,QAsKZ,WACI,MAAMb,EAAa,IACZ9B,EAAY9I,MAAMsD,IAAI88G,MACtBt3G,EAAY4C,MAAMpI,IAAI88G,GAAa98G,KAAIyF,GAAa,IAAMA,KAC/DlC,KAAK,KAEP,OADAiC,EAAY6C,OAAO,IACZf,CACX,EA5KA9B,EAAY6C,OAwIZ,SAAgBf,GAOZ,IAAIrK,EALJuI,EAAY8C,KAAKhB,GAEjB9B,EAAY8B,WAAaA,EACzB9B,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAEpB,MAAMhF,GAA+B,iBAAfkE,EAA0BA,EAAa,IAAIlE,MAAM,UACjEtF,EAAMsF,EAAMjG,OAClB,IAAKF,EAAI,EAAGA,EAAIa,EAAKb,IACZmG,EAAMnG,KAKW,OADtBqK,EAAalE,EAAMnG,GAAGyE,QAAQ,MAAO,QACtB,GACX8D,EAAY4C,MAAMlM,KAAK,IAAI8gH,OAAO,IAAM11G,EAAWopB,OAAO,GAAK,MAG/DlrB,EAAY9I,MAAMR,KAAK,IAAI8gH,OAAO,IAAM11G,EAAa,MAGjE,EA9JA9B,EAAYO,QAkLZ,SAAiBtJ,GACb,GAA8B,MAA1BA,EAAKA,EAAKU,OAAS,GACnB,OAAO,EAEX,IAAIF,EACAa,EACJ,IAAKb,EAAI,EAAGa,EAAM0H,EAAY4C,MAAMjL,OAAQF,EAAIa,EAAKb,IACjD,GAAIuI,EAAY4C,MAAMnL,GAAG4G,KAAKpH,GAC1B,OAAO,EAGf,IAAKQ,EAAI,EAAGa,EAAM0H,EAAY9I,MAAMS,OAAQF,EAAIa,EAAKb,IACjD,GAAIuI,EAAY9I,MAAMO,GAAG4G,KAAKpH,GAC1B,OAAO,EAGf,OAAO,CACX,EAlMA+I,EAAYkD,SAAW,GACvBlD,EAAY2B,QAuNZ,WACIwB,QAAQC,KAAK,wIACjB,EAxNAvO,OAAOuG,KAAK2E,GAAKsD,SAAQpO,IAErB+K,EAAY/K,GAAO8K,EAAI9K,EAAI,IAK/B+K,EAAY9I,MAAQ,GACpB8I,EAAY4C,MAAQ,GAMpB5C,EAAYkB,WAAa,CAAC,EAgB1BlB,EAAYyB,YATZ,SAAqBxB,GACjB,IAAIqD,EAAO,EACX,IAAK,IAAI7L,EAAI,EAAGA,EAAIwI,EAAUtI,OAAQF,IAClC6L,GAASA,GAAQ,GAAKA,EAAQrD,EAAUsD,WAAW9L,GACnD6L,GAAQ,EAGZ,OAAOtD,EAAYwD,OAAOrE,KAAKsE,IAAIH,GAAQtD,EAAYwD,OAAO7L,OAClE,EA6LAqI,EAAYy3G,gBAAgBz3G,EAAYkB,YAExClB,EAAY6C,OAAO7C,EAAY0D,QAExB1D,CACX,CDLA,CAAqB,CAAEqB,WA3GvB,SAAoBhJ,GAOhB,GANAA,EAAK,IAAMnC,KAAKqL,UAAY,KAAO,IAC/BrL,KAAK+J,WACJ/J,KAAKqL,UAAY,MAAQ,KAC1BlJ,EAAK,IACJnC,KAAKqL,UAAY,MAAQ,KAC1B,IAAM,GAASrL,KAAK0K,OACnB1K,KAAKqL,UACN,OAEJ,MAAMlE,EAAI,UAAYnH,KAAKsL,MAC3BnJ,EAAK+I,OAAO,EAAG,EAAG/D,EAAG,kBAIrB,IAAI0D,EAAQ,EACRuvB,EAAQ,EACZj4B,EAAK,GAAG6D,QAAQ,eAAgByC,IACd,OAAVA,IAGJoC,IACc,OAAVpC,IAGA2xB,EAAQvvB,GACZ,IAEJ1I,EAAK+I,OAAOkvB,EAAO,EAAGjzB,EAC1B,EA8EmCyF,KAjEnC,SAAchB,GACV,IACQA,EACAyuB,IAASC,QAAQ,QAAS1uB,GAG1ByuB,IAASE,WAAW,QAE5B,CACA,MAAO/S,GAGP,CACJ,EAoDyCha,KA9CzC,WACI,IAAIgtB,EACJ,IACIA,EAAIH,IAASI,QAAQ,QACzB,CACA,MAAOjT,GAGP,CAKA,OAHKgT,QAAmC,IAAvB5C,WAAWxmB,SAA2B,QAASwmB,WAAWxmB,UACvEopB,EAAI5C,WAAWxmB,QAAQvH,IAAI6wB,OAExBF,CACX,EAgC+CnvB,UAvI/C,WAKI,QAAsB,oBAAX0F,SAA0BA,OAAOK,SAAoC,aAAxBL,OAAOK,QAAQjM,OAAuB4L,OAAOK,QAAQupB,UAIpF,oBAAdC,WAAmG,MAArEA,UAAUC,WAAWzgB,cAAc3R,MAAM,4BAMtD,oBAAbqyB,UAA4BA,SAASC,iBAAiBC,OAAOC,kBAGrD,oBAAXlqB,QAA0BA,OAAO9D,UAAY8D,OAAO9D,QAAQiuB,SAAYnqB,OAAO9D,QAAQkuB,WAAapqB,OAAO9D,QAAQmuB,QAGrG,oBAAdR,WAA4F,MAA9DA,UAAUC,WAAWzgB,cAAc3R,MAAM,mBAA8B+V,SAAS8iG,OAAOp7G,GAAI,KAAO,IAElH,oBAAd00B,WAA6BA,UAAUC,WAAWzgB,cAAc3R,MAAM,sBACtF,EA+G0D84G,gBAb1D,SAAyBv2G,GAIrBA,EAAWxI,EAAI,SAAUnD,GACrB,IACI,OAAOgmB,KAAKE,UAAUlmB,EAC1B,CACA,MAAOmoB,GACH,MAAO,+BAAiCA,EAAMhb,OAClD,CACJ,CACJ,EAC2Ec,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+E+sB,WAASjvB,IAAG,KE3N/F,MC8HO,SAASo2G,KACZ,MAAO,CACH/d,aAAa1iG,GAkBd,SAAgBA,GAEnB,IAAIwiG,EA7FR,SAA8Bx5F,GAC1B,MAAM4zC,EAAS,OAQf,OAPAA,EAAOtzC,SAAU,EACjBszC,EAAOryC,MAAQ,GACfqyC,EAAOjzC,KAAO,EACdizC,EAAOvyC,IAAM,OACbuyC,EAAO5zC,UAAYA,EACnB4zC,EAAOlyC,QAAU,KAAM,EACvBkyC,EAAOnyC,OAAS,IAAMmyC,EACfA,CACX,CAmFgB8jE,CAAqB,GAAG1gH,WAKpC,OAHI,GAAMsJ,QAAQ,GAAGtJ,YAA2F,MAA1E,GAAMC,MAAMsD,KAAKk2B,GAAMA,EAAEn0B,aAAYizB,MAAM9lB,GAAMA,EAAEwX,SAAS,cAC9Fu4E,EAAQ,GAAM,GAAGxiG,YAEdpC,OAAO01B,OAAO,GAAMtzB,GAAO,CAC9BymB,MAAO,GAAM,GAAGzmB,WAChBwiG,SAER,CA5BmB5lD,CAAO58C,GAG1B,CAmCA,SAAS2gH,GAAS37G,GACd,GAAW,MAAPA,GAIe,KADnBA,EAAMA,EAAI4B,QACFlG,OAGR,OAAOsE,CACX,CCzLO,SAAS47G,GAAYC,EAAMt9G,GAC9B,MAAM46C,EAAW,CACb,CAACzb,OAAOyb,UAAW,IACRA,EAEX72C,KAAM,KACF,MAAMA,EAAOu5G,EAAKv5G,OACZ4C,EAAM5C,EAAKrJ,MACjB,OAAkB,IAAdqJ,EAAK26B,MAAwB,MAAP/3B,EACP,CACX+3B,MAAM,EACNhkC,WAAOE,GAIR,CACH8jC,MAAM,EACNhkC,MAAOsF,EAAI2G,GACd,GAGT,OAAOi0C,CACX,CACO,SAAS,GAAiBn5C,GAE7B,OAAO+sF,GADW,GAAcvnD,GAAUvvB,OAAO,IAAIjW,MAEzD,CDOA,GAAMiF,WAAW4V,EAAKvhB,GACN,MAALA,EAAY,YAAcksC,GAAU1C,WAAWxpC,GAG1D,GAAM2L,WAAWmS,EAAK9d,GACN,MAALA,EAAY,YAAcg3B,GAAOwS,WAAWxpC,GAGvD,GAAM2L,WAAWosB,EAAK/3B,GACN,MAALA,EAAY,YAAc0c,GAAO8sB,WAAWxpC,GAGvD,GAAM2L,WAAW0zB,EAAKr/B,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAW7D,EAAK9H,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAW0tB,EAAKr5B,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAW2V,EAAKthB,GACN,MAALA,EAAY,YAAcA,EAAEgH,WAGvC,GAAM2E,WAAWiZ,EAAK5kB,GACN,MAALA,EAAY,YAAcqiH,GAASriH,EAAEoH,QAAUi7G,GAASriH,EAAEmN,UAAYnN,EAAEgH,WElD5E,MAAMw7G,GACTviH,IACA,WAAAgQ,CAAYhQ,GAER,GADAU,KAAKV,IAAM,IAAIg8C,IACJ,MAAPh8C,EACA,IAAK,MAAMP,KAAOO,EACdU,KAAKV,IAAI0d,IAAIje,EAAIsH,WAG7B,CACA,QAAI5H,GACA,OAAOuB,KAAKV,IAAIb,IACpB,CACA,CAACglC,OAAOyb,YACJ,OAAOl/C,KAAKiD,QAChB,CACA,GAAA+Z,CAAI6qC,GACA7nD,KAAKV,IAAI0d,IAAI6qC,EAAKxhD,WACtB,CACA,KAAA9G,GACIS,KAAKV,IAAIC,OACb,CACA,OAAOsoD,GACH7nD,KAAKV,IAAI+nD,OAAOQ,EAAKxhD,WACzB,CACA,OAAA8pD,GACI,OAAOwxD,GAAY3hH,KAAKV,IAAI6wD,WAAYllD,IACpC,MAAMi8C,EAAS,GAAiBj8C,EAAI,IACpC,MAAO,CAACi8C,EAAQA,EAAO,GAE/B,CACA,OAAA/5C,CAAQ20G,GACJ9hH,KAAKV,IAAI6N,SAASpH,IACd,MAAMmhD,EAAS,GAAiBnhD,GAChC+7G,EAAU56D,EAAQA,EAAQlnD,KAAK,GAEvC,CACA,GAAAf,CAAI4oD,GACA,OAAO7nD,KAAKV,IAAIL,IAAI4oD,EAAKxhD,WAC7B,CACA,MAAApD,GACI,OAAO0+G,GAAY3hH,KAAKV,IAAI2D,UAAWgI,GAC5B,GAAiBA,IAEhC,CACA,YAAA82G,CAAaxzE,GACT,MAAMoQ,EAAS,IAAIkjE,GACnB,IAAK,MAAM36D,KAAU3Y,EACbvuC,KAAKf,IAAIioD,IACTvI,EAAO3hC,IAAIkqC,GAGnB,OAAOvI,CACX,CACA,UAAAqjE,CAAWzzE,GACP,MAAMoQ,EAAS,IAAIkjE,GACnB,IAAK,MAAM36D,KAAUlnD,KACZuuC,EAAMtvC,IAAIioD,IACXvI,EAAO3hC,IAAIkqC,GAGnB,OAAOvI,CACX,CACA,KAAAsjE,CAAM1zE,GACF,MAAMoQ,EAAS,IAAIkjE,GACnB,IAAK,MAAM36D,KAAU3Y,EACjBoQ,EAAO3hC,IAAIkqC,GAEf,IAAK,MAAMA,KAAUlnD,KACjB2+C,EAAO3hC,IAAIkqC,GAEf,OAAOvI,CACX,EC1FJ,MAAM79C,GAAS,CAAC,EACVohH,GAAcC,IAChBA,EAAO59D,iBAAiB,WAAYpkD,IAChC+hH,GAAWv1D,cAAc,UAAWw1D,EAAQhiH,EAAM,IAEnC,MAAfgiH,EAAOjwD,MACPiwD,EAAOjwD,KAAK3N,iBAAiB,WAAYpkD,IACrC+hH,GAAWv1D,cAAc,UAAWw1D,EAAQhiH,EAAM,GAE1D,EAEJ+hH,GAAW39D,iBAAmB,CAACp/C,EAAMtF,KACb,MAAhBiB,GAAOqE,KACPrE,GAAOqE,GAAQ,IAEnBrE,GAAOqE,GAAM3E,KAAKX,EAAG,EAEzBqiH,GAAWz9D,oBAAsB,CAACt/C,EAAMtF,KAChB,MAAhBiB,GAAOqE,KAGXrE,GAAOqE,GAAQrE,GAAOqE,GACjB0H,QAAOxM,GAAYA,IAAaR,IAAG,EAE5CqiH,GAAWv1D,cAAgB,SAAUxnD,EAAMg9G,EAAQhiH,GAC3B,MAAhBW,GAAOqE,IAGXrE,GAAOqE,GAAMgI,SAAQtN,GAAMA,EAAGsiH,EAAQhiH,IAC1C,EACA,YC9BaiiH,GAA2B,2BAC3BC,GAA2B,2BAC3BC,GAAyB,yBACzBC,GAA4B,4BAC5BC,GAA4B,4BAC5BC,GAA0B,0BCFjCC,GAA0B,CAACxiH,EAASyiH,EAAar3F,EAAas3F,EAAaC,IACtE,CAACV,EAAQhiH,KACZ,GAAIA,EAAMwpC,KAAKxkC,OAASmmB,EACpB,OAEJ,MAAMw3F,EAAe,CACjB39G,KAAMhF,EAAMwpC,KAAKxkC,KACjBpE,KAAMZ,EAAMwpC,KAAK5oC,KACjBgiH,WAAY5iH,EAAMwpC,KAAKo5E,YAE3B7iH,EAAQysD,cAAc,IAAIq2D,aAAaL,EAAa,CAChDh5E,KAAM,CACF5oC,KAAM+hH,EAAa/hH,KACnB0iE,QAASt2B,UAELg1E,EAAOc,YAAY,CACf99G,KAAM09G,EACN9hH,KAAM+hH,EAAa/hH,KACnBgiH,WAAYD,EAAaC,mBAGvB,IAAIxmF,SAASr4B,IACf,MAAMg/G,EAAwB/iH,IAC1B,GAAmB,MAAfA,GAAOwpC,KACP,OAEJ,MAAMw5E,EACIhjH,EAAMwpC,KAAKxkC,KADfg+G,GAEIhjH,EAAMwpC,KAAK5oC,KACLZ,EAAMwpC,KAAKo5E,YAEvBI,IAAsBP,GAAeO,IAA4BL,EAAaC,aAC9EZ,EAAO19D,oBAAoB,UAAWy+D,GACtCh/G,IACJ,EAEJi+G,EAAO59D,iBAAiB,UAAW2+D,EAAqB,GAC1D,KAGX,EAGLE,GAAwB,CAACriH,EAAMuqB,EAAau3F,EAAWD,IAClDz1E,UACH,MAAMz8B,EC/CHzH,KAAKm0B,SAAS/2B,WAAWoB,UAAU,GDqDtC,OALAmwB,WAAWqrF,YAAY,CACnB99G,KAAMmmB,EACNy3F,WAAYryG,EACZ3P,SAEG,IAAIw7B,SAASr4B,IAChB,MAAM7D,EAAYF,IACd,GAAmB,MAAfA,GAAOwpC,KACP,OAEJ,MAAM05E,EACIljH,EAAMwpC,KAAKxkC,KADfk+G,EAEUljH,EAAMwpC,KAAKo5E,WAEvBM,IAAuBR,GAAaQ,IAA6B3yG,IACjEknB,WAAW6sB,oBAAoB,UAAWpkD,GAE1C6D,GAAQ,KAEJ0zB,WAAWqrF,YAAY,CACnB99G,KAAMy9G,EACNG,WAAYryG,EACZ3P,QACF,IAEV,EAEJ62B,WAAW2sB,iBAAiB,UAAWlkD,EAAS,GAClD,EAGJijH,GAAiB,CACnBC,eAAe,GEgCbC,GAAU,CAAC,EACjB,IAAIC,GACJt2E,eAAeu2E,GAAkB3/E,EAAO9pB,GACpC,IAAI2rB,EACJ,MAAMlH,EAAI,IAAInC,SAASr4B,IACnB0hC,EAAM1hC,CAAO,IAWjB,OATK6/B,EAAM/mB,KAAImwB,SAAY8tE,GAAS,iBAC1B,IAAI1+E,SAASr4B,IACf0hC,GAAI,KACA1hC,GAAS,GACX,GAET,EANmC,GAM9B,CACF4pG,aAAc7zF,EAAQ2M,YAEnB8X,CACX,CACA,MAgDM,GAAiB,CACnB39B,KAAM,OACNu7G,YAAa12F,IACbgB,QAAS,MACT28F,eAAe,GChLZ,IAAII,GA4OAC,GA8DAC,GC3SX,SAASC,GAAkB58D,EAAQn/B,GAC/B,GAAwB,MAApBm/B,EAAOylB,WAA2C,MAAtB5kD,EAAS4kD,UACrC,OAAOzlB,EAEX,IAAIrxC,EAOJ,MANoB,QAAhBqxC,EAAO/hD,OAGP0Q,EAAS,GADS01B,GAAUvvB,OAAO,IAAIkrC,OAIpC6rC,GADWf,GAAsBjqE,EAAS4kD,UAAW92D,GAEhE,CACO,SAASkuG,GAAY78D,EAAQ13C,EAAKw0G,GAErC,OAAOC,GAAS/8D,EADHy8D,GAAO3nG,OAAOxM,GACGw0G,EAClC,CACO,SAASC,GAAS/8D,EAAQW,EAAMm8D,GACnC,MAAM9rD,EAAO,IAAIrqB,IAEXkzB,EAAM96B,OAAOz7B,KAAKu2D,OACxB,IAAK,MAAOhiE,EAAK+zC,KAAQ+U,EAAKqQ,KAAK/H,UACb,MAAdrd,EAAIoxE,QAAkBpxE,EAAIoxE,OAASnjD,GAGvC7I,EAAK54D,IAAIP,EAAK+zC,GAElB,MAAO,IACA+U,EACHn3C,GAAIozG,GAAkB58D,EAAQW,GAC9Bk/C,UAAWl/C,EAAKk/C,UAEXl6F,QAAO,EAAGs3G,cAA2B,MAAZA,GAAoBA,EAAY35G,KAAKu2D,MAAQijD,IACtE1/G,KAAI,EAAGwiG,UAAW3sC,EAAIqyC,kBAChB,CACH1F,UAAW,GAAU3sC,GACrBqyC,YAAaA,IAAe,MAGpCnkD,SAAUR,EAAKQ,SACfokD,mBAAoB5kD,EAAK4kD,yBAAsBvtG,EAC/Cg5D,OAER,CCdA,SAASksD,GAA2BC,EAAMC,GACtC,OAAY,MAARD,GAAwB,MAARC,GAGR,MAARD,GAAwB,MAARC,GACT,GAAiBD,EAAMC,EAGtC,CACA,SAASC,GAAcF,EAAMC,EAAME,GAC/B,GAAIH,EAAK5iH,SAAW6iH,EAAK7iH,OACrB,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAI8iH,EAAK5iH,OAAQF,IAC7B,IAAKijH,EAAQH,EAAK9iH,GAAI+iH,EAAK/iH,IACvB,OAAO,EAGf,OAAO,CACX,CACA,SAASkjH,GAAYC,EAAMC,EAAMH,GAC7B,GAAIE,EAAKjmH,OAASkmH,EAAKlmH,KACnB,OAAO,EAEX,IAAK,MAAOM,EAAKC,KAAU0lH,EAAKv0D,UAAW,CACvC,MAAMy0D,EAASD,EAAKvlH,IAAIL,GACxB,GAAc,MAAV6lH,EACA,OAAO,EAEX,IAAKJ,EAAQxlH,EAAO4lH,GAChB,OAAO,CAEf,CACA,OAAO,CACX,EF7DA,SAAWjB,GACP,IAAIkB,EAuDAC,EAwDAxyE,GA9GJ,SAAWuyE,GACP,IAAIvyE,EACJuyE,EAAmBx9E,MAAQ,KACT,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAX1Q,EAAIxT,KAA2B,KAAZwT,EAAIxT,MACxBgV,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIxT,MAEC,MAAbwT,EAAIvT,OAAiBuT,EAAIvT,MAAMwR,WAAa,IAC7CuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIvT,SAEa,IAAzB89B,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRxT,IAAK,GACLC,MAAO,EAAgB,IAErBiI,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIxT,IAAMugB,EAAO/O,SACjB,MAEJ,KAAK,EACDgC,EAAIvT,MAAQsgB,EAAOxQ,QACnB,MAEJ,QACIwQ,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXuyE,EAAmB3vG,OAAU3C,GAClB89B,GAAc99B,EAAKsyG,EAAmBx9E,SAEjDw9E,EAAmB7oG,OAAS,CAACxM,EAAKstB,IACvBsK,EAAc53B,EAAKq1G,EAAmBx9E,QAASvK,EAE7D,CArDD,CAqDG+nF,EAAqBlB,EAAKkB,qBAAuBlB,EAAKkB,mBAAqB,CAAC,IAE/E,SAAWC,GACP,IAAIxyE,EACJwyE,EAAez9E,MAAQ,KACL,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEU,MAAX1Q,EAAIxT,KAA2B,KAAZwT,EAAIxT,MACxBgV,EAAE1D,OAAO,IACT0D,EAAExD,OAAOgC,EAAIxT,MAEA,MAAbwT,EAAIvT,QACJ+U,EAAE1D,OAAO,IACTwzG,GAAIx8E,QAAQnyB,OAAO3C,EAAIvT,MAAO+U,KAEL,IAAzB+oB,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRxT,IAAK,IAEHkI,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIxT,IAAMugB,EAAO/O,SACjB,MAEJ,KAAK,EACDgC,EAAIvT,MAAQ6kH,GAAIx8E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACpD+iC,OAAQtW,EAAKsW,QAAQp0C,QAEzB,MAEJ,QACIsgB,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXwyE,EAAe5vG,OAAU3C,GACd89B,GAAc99B,EAAKuyG,EAAez9E,SAE7Cy9E,EAAe9oG,OAAS,CAACxM,EAAKstB,IACnBsK,EAAc53B,EAAKs1G,EAAez9E,QAASvK,EAEzD,CAtDD,CAsDGgoF,EAAiBnB,EAAKmB,iBAAmBnB,EAAKmB,eAAiB,CAAC,IAEnEnB,EAAKt8E,MAAQ,KACK,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,KAI9B,IAH6B,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEe,MAAjB1Q,EAAIw0F,UACJ,IAAK,MAAM/nG,KAASuT,EAAIw0F,UACpBhzF,EAAE1D,OAAO,IACTuzG,GAAQv8E,QAAQnyB,OAAOlW,EAAO+U,GAGtC,GAAqB,MAAjBxB,EAAIw1C,UACJ,IAAK,MAAM/oD,KAASuT,EAAIw1C,UACpBh0C,EAAE1D,OAAO,IACT0D,EAAExD,OAAOvR,GAWjB,GARqB,MAAjBuT,EAAIo6D,YACJ54D,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIo6D,YAEc,MAA1Bp6D,EAAIk6F,qBACJ14F,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIk6F,qBAEI,MAAhBl6F,EAAI81C,UAA0C,IAAtB91C,EAAI81C,SAAS5pD,KACrC,IAAK,MAAOM,EAAKC,KAAUuT,EAAI81C,SAAS8H,UACpCp8C,EAAE1D,OAAO,IACTszG,EAAKkB,mBAAmBx9E,QAAQnyB,OAAO,CAAEnW,MAAKC,SAAS+U,GAG/D,GAAgB,MAAZxB,EAAI2lD,MAAkC,IAAlB3lD,EAAI2lD,KAAKz5D,KAC7B,IAAK,MAAOM,EAAKC,KAAUuT,EAAI2lD,KAAK/H,UAChCp8C,EAAE1D,OAAO,IACTszG,EAAKmB,eAAez9E,QAAQnyB,OAAO,CAAEnW,MAAKC,SAAS+U,GAGxC,MAAfxB,EAAIwyG,UACJhxG,EAAE1D,OAAO,IACT0D,EAAE6yB,aAAar0B,EAAIwyG,WAEM,IAAzBjoF,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRw0F,UAAW,GACXh/C,UAAW,GACXM,SAAU,IAAIxa,IACdqqB,KAAM,IAAIrqB,KAER5mC,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACD,GAA8B,MAA1BhW,EAAKsW,QAAQ2zD,WAAqBx0F,EAAIw0F,UAAUtlG,SAAWq7B,EAAKsW,OAAO2zD,UACvE,MAAM,IAAIj1D,GAAe,8DAE7Bv/B,EAAIw0F,UAAUvmG,KAAKojH,GAAQv8E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CAC/D+iC,OAAQtW,EAAKsW,QAAQ4zD,cAEzB,MAEJ,KAAK,EACD,GAA8B,MAA1BlqE,EAAKsW,QAAQ2U,WAAqBx1C,EAAIw1C,UAAUtmD,SAAWq7B,EAAKsW,OAAO2U,UACvE,MAAM,IAAIjW,GAAe,8DAE7Bv/B,EAAIw1C,UAAUvnD,KAAK8e,EAAO/O,UAC1B,MAEJ,KAAK,EACDgC,EAAIo6D,UAAYrtD,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIk6F,mBAAqBntF,EAAOxQ,QAChC,MAEJ,KAAK,EAAG,CACJ,GAA6B,MAAzBguB,EAAKsW,QAAQiV,UAAoB91C,EAAI81C,SAAS5pD,OAASq+B,EAAKsW,OAAOiV,SACnE,MAAM,IAAItW,GAAa,6DAE3B,MAAM0M,EAAQklE,EAAKkB,mBAAmBx9E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,UACpEkC,EAAI81C,SAAS/oD,IAAIm/C,EAAM1/C,IAAK0/C,EAAMz/C,OAClC,KACJ,CACA,KAAK,EAAG,CACJ,GAAyB,MAArB89B,EAAKsW,QAAQ8kB,MAAgB3lD,EAAI2lD,KAAKz5D,OAASq+B,EAAKsW,OAAO8kB,KAC3D,MAAM,IAAInmB,GAAa,yDAE3B,MAAM0M,EAAQklE,EAAKmB,eAAez9E,QAAQrrB,OAAOsD,EAAQA,EAAOjP,SAAU,CACtE+iC,OAAQ,CACJp0C,MAAO89B,EAAKsW,QAAQ4xE,cAG5BzyG,EAAI2lD,KAAK54D,IAAIm/C,EAAM1/C,IAAK0/C,EAAMz/C,OAC9B,KACJ,CACA,KAAK,EACDuT,EAAIwyG,QAAUzlG,EAAOsnB,eACrB,MAEJ,QACItnB,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXqxE,EAAKzuG,OAAU3C,GACJ89B,GAAc99B,EAAKoxG,EAAKt8E,SAEnCs8E,EAAK3nG,OAAS,CAACxM,EAAKstB,IACTsK,EAAc53B,EAAKm0G,EAAKt8E,QAASvK,EAE/C,CA1OD,CA0OG6mF,KAASA,GAAO,CAAC,IAEpB,SAAWC,GACP,IAAItxE,EACJsxE,EAAQv8E,MAAQ,KACE,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEgB,MAAjB1Q,EAAIu0F,WAAqBv0F,EAAIu0F,UAAUt2F,WAAa,IACrDuD,EAAE1D,OAAO,IACT0D,EAAEjF,MAAMyD,EAAIu0F,YAEO,MAAnBv0F,EAAIi6F,cACJz4F,EAAE1D,OAAO,IACT0D,EAAEwO,KAAKhQ,EAAIi6F,cAEK,MAAhBj6F,EAAI4xG,WACJpwG,EAAE1D,OAAO,IACT0D,EAAE6yB,aAAar0B,EAAI4xG,YAEM,IAAzBrnF,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRu0F,UAAW,EAAgB,IAEzB7/F,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIu0F,UAAYxnF,EAAOxQ,QACvB,MAEJ,KAAK,EACDyD,EAAIi6F,YAAcltF,EAAOiD,OACzB,MAEJ,KAAK,EACDhQ,EAAI4xG,SAAW7kG,EAAOsnB,eACtB,MAEJ,QACItnB,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXsxE,EAAQ1uG,OAAU3C,GACP89B,GAAc99B,EAAKqxG,EAAQv8E,SAEtCu8E,EAAQ5nG,OAAS,CAACxM,EAAKstB,IACZsK,EAAc53B,EAAKo0G,EAAQv8E,QAASvK,EAElD,CA5DD,CA4DG8mF,KAAYA,GAAU,CAAC,IAE1B,SAAWC,GACP,IAAIvxE,EACJuxE,EAAIx8E,MAAQ,KACM,MAAViL,IACAA,EAAS9lC,IAAQ,CAAC+F,EAAKwB,EAAG+oB,EAAO,CAAC,MACD,IAAzBA,EAAKwT,iBACLv8B,EAAEkP,OAEY,MAAb1Q,EAAIvT,OAA+B,IAAduT,EAAIvT,QAC1B+U,EAAE1D,OAAO,GACT0D,EAAE1D,OAAOkC,EAAIvT,QAEC,MAAduT,EAAI2xG,SACJnwG,EAAE1D,OAAO,IACT0D,EAAEqO,OAAO7P,EAAI2xG,UAEY,IAAzBpnF,EAAKwT,iBACLv8B,EAAEmP,QACN,IACD,CAAC5D,EAAQ7d,EAAQq7B,EAAO,CAAC,KACxB,MAAMvqB,EAAM,CACRvT,MAAO,GAELiI,EAAgB,MAAVxF,EAAiB6d,EAAOld,IAAMkd,EAAOxY,IAAMrF,EACvD,KAAO6d,EAAOxY,IAAMG,GAAK,CACrB,MAAM6rC,EAAMxzB,EAAOjP,SACnB,OAAQyiC,IAAQ,GACZ,KAAK,EACDvgC,EAAIvT,MAAQsgB,EAAOjP,SACnB,MAEJ,KAAK,EACDkC,EAAI2xG,OAAS5kG,EAAO8C,SACpB,MAEJ,QACI9C,EAAO2X,SAAe,EAAN6b,GAI5B,CACA,OAAOvgC,CAAG,KAGX+/B,GAEXuxE,EAAI3uG,OAAU3C,GACH89B,GAAc99B,EAAKsxG,EAAIx8E,SAElCw8E,EAAI7nG,OAAS,CAACxM,EAAKstB,IACRsK,EAAc53B,EAAKq0G,EAAIx8E,QAASvK,EAE9C,CApDD,CAoDG+mF,KAAQA,GAAM,CAAC,IGpWlB,MAAMoB,GAAW,IACXC,IAAW,IAAIn5E,aAAc72B,OAAO+vG,IACpCE,GAAUD,GAAS,GAiBlB,MAAME,GACTC,KAKA,WAAA/1G,CAAYvM,EAAGsxF,GACX,GAAiB,iBAANtxF,EACP/C,KAAKqlH,KAAO,GAAqBtiH,OAEhC,MAAIA,aAAakN,YAIlB,MAAM,IAAIzR,MAAM,+CAHhBwB,KAAKqlH,KAAOtiH,CAIhB,CAOA,GANa,MAATsxF,IACAA,GAAQ,GAERA,GACAr0F,KAAKq0F,QAEoB,IAAzBr0F,KAAKqlH,KAAK70G,YAAoBxQ,KAAKqlH,KAAK,KAAOF,GAC/C,MAAM,IAAI3mH,MAAM,cAExB,CAOA,QAAA6H,CAAS0e,EAAW,QAChB,OAAO,GAAmB/kB,KAAKqlH,KAAMtgG,EACzC,CAMA,UAAAugG,GACI,OAAOtlH,KAAKqlH,IAChB,CAMA,IAAK5hF,OAAOqB,eACR,MAAO,OAAO9kC,KAAKqG,aACvB,CAaA,qBAAOk/G,CAAe1lE,GAClB,OAAO,IAAIulE,GAAIvlE,EAAKh4C,KAAKo9G,IAC7B,CAYA,aAAO7nF,GACH,OAAO,IAAIgoF,GAAIn8G,KAAKm0B,SAAS/2B,WAAWoB,UAAU,GACtD,CAIA,YAAO+9G,CAAMj3E,GACT,OAAIA,aAAiBt+B,YAA+B,iBAAVs+B,EAE/B,IAAI62E,GAAI72E,GAEa,mBAArBA,EAAM+2E,WAEN,IAAIF,GAAI72E,EAAM+2E,cAElB,IACX,CAMA,KAAAjxB,GAII,GAHiB,MAAbr0F,KAAKqlH,MAAyC,IAAzBrlH,KAAKqlH,KAAK70G,aAC/BxQ,KAAKqlH,KAAOH,IAEZllH,KAAKqlH,KAAK,KAAOF,GAAS,CAC1B,MAAMr2G,EAAQ,IAAImB,WAAWjQ,KAAKqlH,KAAK70G,WAAa,GACpD1B,EAAM4pC,KAAKysE,GAAS,EAAG,GACvBr2G,EAAMxP,IAAIU,KAAKqlH,KAAM,GACrBrlH,KAAKqlH,KAAOv2G,CAChB,CAEA,KAAO9O,KAAKqlH,KAAK70G,WAAa,GAAKxQ,KAAKqlH,KAAKrlH,KAAKqlH,KAAK70G,WAAa,KAAO20G,IACvEnlH,KAAKqlH,KAAOrlH,KAAKqlH,KAAKpjG,SAAS,GAAI,EAE3C,CAOA,IAAAwjG,CAAK1mH,GACD,MAAM2mH,EAAQ1lH,KAAK6/C,OACb8lE,EAAQ5mH,EAAI8gD,OAClB,IAAK,IAAIt+C,EAAI,EAAGA,EAAImkH,EAAMjkH,OAAQF,IAAK,CACnC,GAAIokH,EAAMlkH,OAASF,EAAI,EACnB,OAAO,EAEX,MAAMyU,EAAK0vG,EAAMnkH,GACX0U,EAAK0vG,EAAMpkH,GACjB,GAAIyU,EAAKC,EACL,OAAO,EAEN,GAAID,EAAKC,EACV,OAAO,CAEf,CACA,OAAOyvG,EAAMjkH,OAASkkH,EAAMlkH,MAChC,CAYA,OAAA69C,GACI,OAAO8lE,GAAIG,eAAevlH,KAAK6/C,OAAO3+C,QAAQo+C,UAClD,CAMA,UAAA1zC,GACI,OAAO5L,KAAK6/C,MAChB,CAWA,aAAA+lE,GACI,MAAM74G,EAAK/M,KAAK4L,aAChB,OAAOmB,EAAGA,EAAGtL,OAAS,EAC1B,CAYA,IAAAo+C,GACI,OAAO7/C,KAAKqG,WAAWqB,MAAMu9G,IAAU/jH,MAAM,EACjD,CAYA,IAAAiE,GACI,OAqJR,SAAuB4H,GACnB,MAAMqQ,EAAQrQ,EAAGrF,MAAM,KACvB,OAAI0V,EAAM3b,OAAS,EACR,GAEJ2b,EAAMlc,MAAM,GAAI,GAAG2G,KAAK,IACnC,CA3Jeg+G,CAAc7lH,KAAK4lH,gBAC9B,CAYA,IAAA7kH,GACI,OAoJR,SAAwBgM,GACpB,MAAMqQ,EAAQrQ,EAAGrF,MAAM,KACvB,OAAO0V,EAAMA,EAAM3b,OAAS,EAChC,CAvJeqkH,CAAe9lH,KAAK4lH,gBAC/B,CAaA,QAAAjvE,CAAS5zC,GACL,OAAO,IAAIqiH,GAAIplH,KAAKqG,WAAa,IAAMtD,EAC3C,CAYA,IAAAid,GACI,IAAI0e,EAAI1+B,KAAK0b,SAASrV,WAKtB,OAJKq4B,EAAEpS,SAAS24F,MACZvmF,GAAKumF,IAETvmF,GAAK1+B,KAAKmF,OACH,IAAIigH,GAAI1mF,EACnB,CAYA,MAAAhjB,GACI,MAAMmkC,EAAO7/C,KAAK6/C,OAClB,OAAoB,IAAhBA,EAAKp+C,OACE,IAAI2jH,GAAIH,IAEZ,IAAIG,GAAIvlE,EAAK3+C,MAAM,GAAI,GAAG2G,KAAKo9G,IAC1C,CAaA,KAAAc,CAAMhnH,GACF,OAAIiB,KAAKqG,aAAe4+G,GACblmH,EAEFA,EAAIsH,aAAe4+G,GACjBjlH,KAEJ,IAAIolH,GAAIplH,KAAKqG,WAAatH,EAAIsH,YAAY,EACrD,CAaA,YAAA2/G,CAAaz3E,GACT,OAAIA,EAAMloC,aAAerG,KAAKqG,YAGvBkoC,EAAMloC,WAAWkmB,WAAWvsB,KAAKqG,WAC5C,CAaA,aAAA4/G,CAAc13E,GACV,OAAIA,EAAMloC,aAAerG,KAAKqG,YAGvBrG,KAAKqG,WAAWkmB,WAAWgiB,EAAMloC,WAC5C,CAMA,UAAA6/G,GACI,OAA8B,IAAvBlmH,KAAK6/C,OAAOp+C,MACvB,CAOA,MAAAL,IAAU8D,GACN,OAAOkgH,GAAIG,eAAe,IAAIvlH,KAAK4L,iBAiC1BorC,EAjCmD9xC,EAAKZ,KAAIvF,GAAOA,EAAI6M,eAkC7E,GAAKxK,UAAU41C,MAD1B,IAAiBA,CAhCb,ECvWG,MAAMmvE,GAAmB,UACzB,SAASC,GAAqBl/D,GACjC,IAAK6F,GAAS7F,IAA0B,MAAfA,EAAO/hD,KAC5B,MAAM,IAAI,GAAuB,kBAErC,MAAMkhH,EAASn/D,EAAO+lB,QAAQ5mE,WAC9B,OAAO,IAAI++G,GAAI,GAAGe,KAAmBE,IACzC,CCROl5E,eAAem5E,GAA6Bp/D,EAAQr6C,EAAQk6F,EAAWwf,GAC1E,MAAMC,EAAa,IAAI34E,IACvB,IAAK,MAAMshB,KAAQ43C,EAAW,CAC1B,GAAY,MAAR53C,EACA,SAKJ,GAHIA,EAAK23C,qBAAqB72F,aAC1Bk/C,EAAK23C,UAAY,GAAU33C,EAAK23C,aAE/BnzC,GAAYxE,EAAK23C,WAClB,MAAM,IAAI,GAAuB,yBAErC,UAAYj6F,EAAOq6C,EAAQiI,EAAK23C,WAC5B,SAEJ,MAAM0F,EAAcr9C,EAAKq9C,cAAe,EAClCia,EAAQt3D,EAAK23C,UAAUzgG,WACvBqgH,EAAeF,EAAWpnH,IAAIqnH,GAChB,MAAhBC,EACAv3D,EAAKq9C,YAAcka,EAAala,aAAeA,EAG/Cga,EAAWlnH,IAAImnH,EAAO,CAClB3f,UAAW33C,EAAK23C,UAChB0F,eAGZ,CACA,MAAO,IAAIga,EAAWvjH,UACjBmL,MAAK,CAACuS,EAAGC,IACHD,EAAEmmF,UAAUzgG,WAAWkhG,cAAc3mF,EAAEkmF,UAAUzgG,cAEvD/B,KAAI,EAAGkoG,cAAa1F,gBAAgB,CACrC0F,cACA1F,UAAWA,EAAUh4F,SAE7B,CCjCOq+B,eAAew5E,GAASz/D,EAAQvd,EAAMi9E,EAAU3sG,GACnD,GAAY,MAAR0vB,EACA,MAAM,IAAI,GAAuB,oBAErC,GAAsB,MAAlBA,EAAKgjC,WAAyC,MAApBzlB,EAAOylB,YAAsBhjC,EAAKgjC,UAAUr+B,OAAO4Y,EAAOylB,WACpF,MAAM,IAAI,GAAuB,wDAErC,MAAMigC,EAAe3yF,EAAQ2yF,cAAc/kD,KAC3C,GAAoB,MAAhB+kD,IAAyB1lD,EAAO5Y,OAAOs+D,EAAal8F,IACpD,MAAM,IAAI,GAAuB,0CAErC,IAuFIi8D,EAvFAo6B,EAAY6F,GAAc7F,WAAa,GACvCh/C,EAAY,IAAIzM,IAAIsxD,GAAc7kD,WAAa,IAC/CM,EAAWukD,GAAcvkD,UAAY,IAAIxa,IACzCqqB,EAAO00C,GAAc10C,MAAQ,IAAIrqB,IACjC4+D,EAAqBG,GAAcH,mBAoCvC,GAlCiB,UAAbma,IACuB,MAAnBj9E,EAAKy8D,YAAwC,MAAlBz8D,EAAKo9D,YAChCA,EAAY,GACW,MAAnBp9D,EAAKy8D,YACLW,EAAUvmG,QAAQmpC,EAAKy8D,WAAW9hG,KAAIwiG,IAAa,CAC/C0F,aAAa,EACb1F,iBAGc,MAAlBn9D,EAAKo9D,WACLA,EAAUvmG,QAAQmpC,EAAKo9D,YAGT,MAAlBp9D,EAAKoe,YACLA,EAAY,IAAIzM,IAAI3R,EAAKoe,YAER,MAAjBpe,EAAK0e,WAELA,EAAWw+D,GADal9E,EAAK0e,oBAAoBxa,IAAM,IAAIlE,EAAK0e,SAAS8H,WAAaxxD,OAAOwxD,QAAQxmB,EAAK0e,UAC9D,CACxC6/C,SAAU4e,MAGD,MAAbn9E,EAAKuuB,OAELA,EAAO2uD,GADal9E,EAAKuuB,gBAAgBrqB,IAAM,IAAIlE,EAAKuuB,KAAK/H,WAAaxxD,OAAOwxD,QAAQxmB,EAAKuuB,MAC1D,CAChCgwC,SAAU6e,GACVziH,IAAK0iH,MAGkB,MAA3Br9E,EAAK8iE,qBACLA,EAAqB9iE,EAAK8iE,qBAIjB,UAAbma,EAAsB,CAatB,GAZuB,MAAnBj9E,EAAKy8D,YACLW,EAAUvmG,QAAQmpC,EAAKy8D,WAAW9hG,KAAIwiG,IAAa,CAC/C0F,aAAa,EACb1F,iBAGc,MAAlBn9D,EAAKo9D,WACLA,EAAUvmG,QAAQmpC,EAAKo9D,WAEL,MAAlBp9D,EAAKoe,YACLA,EAAY,IAAIzM,IAAI,IAAIyM,KAAcpe,EAAKoe,aAE1B,MAAjBpe,EAAK0e,SAAkB,CACvB,MAAM4+D,EAAkBt9E,EAAK0e,oBAAoBxa,IAAM,IAAIlE,EAAK0e,SAAS8H,WAAaxxD,OAAOwxD,QAAQxmB,EAAK0e,UAC1G,IAAK,MAAOtpD,EAAKC,KAAUioH,EACV,MAATjoH,EACAqpD,EAAShB,OAAOtoD,GAGhBspD,EAAS/oD,IAAIP,EAAKC,GAG1BqpD,EAAWw+D,GAAgB,IAAIx+D,EAAS8H,WAAY,CAChD+3C,SAAU4e,IAElB,CACA,GAAiB,MAAbn9E,EAAKuuB,KAAc,CACnB,MAAMgvD,EAAcv9E,EAAKuuB,gBAAgBrqB,IAAM,IAAIlE,EAAKuuB,KAAK/H,WAAaxxD,OAAOwxD,QAAQxmB,EAAKuuB,MACxFivD,EAAa,IAAIt5E,IAAIqqB,GAC3B,IAAK,MAAOn5D,EAAKC,KAAUkoH,EACV,MAATloH,EACAmoH,EAAW9/D,OAAOtoD,GAGlBooH,EAAW7nH,IAAIP,EAAKC,GAG5Bk5D,EAAO2uD,GAAgB,IAAIM,EAAWh3D,WAAY,CAC9C+3C,SAAU6e,GACVziH,IAAK0iH,IAEb,CAC+B,MAA3Br9E,EAAK8iE,qBACLA,EAAqB9iE,EAAK8iE,mBAElC,CAEkC,MAA9BG,GAAcl8F,GAAGi8D,UACjBA,EAAYK,GAAoB4/B,EAAal8F,GAAGi8D,WAEzB,MAAlBhjC,EAAKgjC,UACVA,EAAYK,GAAoBrjC,EAAKgjC,WAEZ,MAApBzlB,EAAOylB,YACZA,EAAYK,GAAoB9lB,EAAOylB,YAE3C,MAAMhuB,EAAS,CACXooD,gBAAiBuf,GAA6Bp/D,EAAQjtC,EAAQmtG,eAAiB,WAAa,GAAOrgB,EAAW9sF,EAAQ2yF,cAAcya,OAAOtgB,WAC3Ih/C,UAAW,IAAIA,EAAU9kD,UAAUmL,MAAK,CAACuS,EAAGC,IACjCD,EAAE4mF,cAAc3mF,KAE3BynC,WACA6P,OACAyU,YACA8/B,sBAUJ,OAPA9tD,EAAOooD,UAAU55F,SAAQgiD,IACrBA,EAAKg1D,SAAWlqG,EAAQ2yF,cAAcya,OAAOtgB,WAAWztE,MAAK61B,GAAQ,GAAiBA,EAAK23C,UAAW33C,EAAK23C,cAAaqd,UAAY35G,KAAKu2D,KAAK,IAG9H,QAAhB7Z,EAAO/hD,aACAw5C,EAAOguB,UAEXhuB,CACX,CAKA,SAASkoE,GAAgB12D,EAASl2C,GAC9B,MAAM0kC,EAAS,IAAI9Q,IACnB,IAAK,MAAO9uC,EAAKC,KAAUmxD,EACV,MAATnxD,GAGJib,EAAQiuF,SAASnpG,EAAKC,GAE1B,IAAK,MAAOD,EAAKC,KAAUmxD,EAAQ/hD,MAAK,EAAEuS,IAAKC,KACpCD,EAAE4mF,cAAc3mF,KAEV,MAAT5hB,GACA2/C,EAAOr/C,IAAIP,EAAKkb,EAAQ3V,MAAMvF,EAAKC,IAAUA,GAGrD,OAAO2/C,CACX,CACA,SAASmoE,GAAiB/nH,EAAKC,GAC3B,GAAmB,iBAARD,EACP,MAAM,IAAI,GAAuB,iCAErC,KAAMC,aAAiBiR,YACnB,MAAM,IAAI,GAAuB,sCAEzC,CACA,SAAS82G,GAAYhoH,EAAK+zC,GACtB,GAAmB,iBAAR/zC,EACP,MAAM,IAAI,GAAuB,6BAErC,GAAiB,MAAb+zC,EAAI9zC,MAAe,CACnB,GAAIwf,SAAS,GAAGs0B,EAAI9zC,QAAS,MAAQ8zC,EAAI9zC,MACrC,MAAM,IAAI,GAAuB,gCAErC,GAAI8zC,EAAI9zC,MAAQ,GAAK8zC,EAAI9zC,MAAQ,IAC7B,MAAM,IAAI,GAAuB,kCAEzC,CACA,GAAe,MAAX8zC,EAAIyzD,IAAa,CACjB,GAAI/nF,SAAS,GAAGs0B,EAAIyzD,MAAO,MAAQzzD,EAAIyzD,IACnC,MAAM,IAAI,GAAuB,8BAErC,GAAIzzD,EAAIyzD,IAAM,EACV,MAAM,IAAI,GAAuB,yCAEzC,CACJ,CACA,SAASygB,GAAOjoH,EAAK+zC,GACjB,IAAIoxE,EAOJ,OANkB,MAAdpxE,EAAIoxE,SACJA,EAASpxE,EAAIoxE,QAEF,MAAXpxE,EAAIyzD,MACJ2d,EAASj+E,OAAOz7B,KAAKu2D,MAAQx2D,OAAOuoC,EAAIyzD,OAErC,CACHvnG,MAAO8zC,EAAI9zC,OAAS,EACpBklH,SAER,CCxLA,SAASoD,GAAYvoH,GAEjB,MAAMm2B,EAAYn2B,EAAIsH,WAAWqB,MAAM,KAAK,GAE5C,OAAOmrF,GADK/kD,GAAIxoB,MAAM4P,EAAWmB,IAErC,CACA,SAASkxF,GAAWxoH,EAAKC,EAAOglH,GAE5B,OAAOD,GADQuD,GAAYvoH,GACAC,EAAOglH,EACtC,CAYO,MAAMwD,GACTtgE,OACAugE,UACAC,KACAN,cACAh8G,IACA44G,cACA2D,WACA,WAAAr4G,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,qBAC1CzjG,KAAKknD,OAASqB,EAAWrB,OACzBlnD,KAAKynH,UAAYl/D,EAAWk/D,UAC5BznH,KAAKonH,cAAgBv7G,EAAKu7G,cAC1BpnH,KAAK0nH,KR4IE,SAAuBztG,GAClC,MAAM6iB,EAAOn+B,OAAO01B,OAAO,CAAC,EAAG,GAAgBpa,GAwB/C,OAvBsB,MAAlBwpG,KACAA,GFzGR,CAAgBxpG,IAGZ,GAFAA,EAAUtb,OAAO01B,OAAO,CAAC,EAAGivF,GAAgBrpG,GAC1BnN,QAAQ8qB,WAAWkD,WAAa7gB,EAAQspG,cAC3C,CACX,MAAMrjH,EAAU,IAAIwsD,YAGpB,OAFA,GAASnI,iBAAiB,UAAWm+D,GAAwBxiH,EAAS,kBAAmBkiH,GAA0BC,GAA0BC,KAC7I,GAAS/9D,iBAAiB,UAAWm+D,GAAwBxiH,EAAS,mBAAoBqiH,GAA2BC,GAA2BC,KACzIviH,CACX,CACA,MAAO,CACH0nH,UAAU,EACVC,SAAW9mH,GAASqiH,GAAsBriH,EAAMqhH,GAA0BE,GAAwBD,IAClGyF,UAAY/mH,GAASqiH,GAAsBriH,EAAMwhH,GAA2BE,GAAyBD,IAE5G,EE2FwB,CAAK1lF,IACU,IAA5B2mF,GAAemE,WAEfnE,GAAel/D,iBAAiB,mBAAoBpkD,IAChB,MAA5BqjH,GAAQrjH,EAAMwpC,KAAK5oC,OAGlByiH,GAAQrjH,EAAMwpC,KAAK5oC,MAAM8mH,WACzBtkF,MAAK4J,MAAO46E,GAAY5nH,EAAMwpC,KAAK85B,UAAU6sB,SAAQ,KAAQy3B,GAAS,KAAK,IAEpFtE,GAAel/D,iBAAiB,oBAAoBpX,MAAOhtC,IACvB,MAA5BqjH,GAAQrjH,EAAMwpC,KAAK5oC,OAGlByiH,GAAQrjH,EAAMwpC,KAAK5oC,MAAM+mH,YACzBvkF,MAAK4J,MAAO46E,GAAY5nH,EAAMwpC,KAAK85B,UAAU6sB,SAAQ,KAAQy3B,GAAS,KAAK,MAIlE,MAAtBvE,GAAQ1mF,EAAK/7B,QACbyiH,GAAQ1mF,EAAK/7B,MA7ED,EAACA,EAAMkZ,KACvB,IAAgC,IAA5BwpG,GAAemE,SACf,MAAO,CACHC,SAAUpE,GAAeoE,SAAS9mH,EAAMkZ,GACxC6tG,UAAWrE,GAAeqE,UAAU/mH,EAAMkZ,IAGlD,MAAM+tG,EAAc,IAAI7L,GAAO,CAAEG,YAAa,IAC9C,IAAI2L,EACJ,MAAO,CACH,cAAMJ,GAEF,GAAiB,MAAbI,EACA,OAAOvE,GAAkBuE,EAAWhuG,GAGxCguG,EAAY,IAAI9L,GAAO,CACnBG,YAAariG,EAAQqiG,YACrBC,WAAW,IAEf,MAAM2L,EAAiBD,EAEjBE,EAAczE,GAAkBuE,EAAWhuG,GAejD,OAdK+tG,EAAYhrG,KAAImwB,UAGjB+6E,EAAelhH,cAITkhH,EAAe/K,SAChB55E,MAAK,KACF0kF,IAAcC,IACdD,EAAY,KAChB,GACF,IAECE,CACX,EACAh7E,UAAe,UAIX86E,EAAY,KACLvE,GAAkBsE,EAAa/tG,IAE7C,EA+BwBmuG,CAAYtrF,EAAK/7B,KAAM+7B,IAEzC0mF,GAAQ1mF,EAAK/7B,KACxB,CQtKoB,CAAQ,CAChBA,KAAM,aACNwiH,eAAe,IAEnBvjH,KAAKgkH,cAAgBn4G,EAAKm4G,eCjDH,KDkDvBhkH,KAAK2nH,WAAa97G,EAAK87G,YCjDH,KDkDxB,CACA,SAAM1oH,CAAIioD,GACN,IAEI,aADMlnD,KAAKwN,KAAK05C,IACT,CACX,CACA,MAAOzgC,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,OAAO,CACX,CACA,YAAM,CAAOygC,GACLlnD,KAAKknD,OAAO5Y,OAAO4Y,UAGjBlnD,KAAKynH,UAAUpgE,OAAO++D,GAAqBl/D,GACrD,CACA,UAAM15C,CAAK05C,GACP,MAAMnoD,EAAMqnH,GAAqBl/D,GAC3B13C,QAAYxP,KAAKynH,UAAUroH,IAAIL,GAC/B8oD,EAAO87D,GAAO3nG,OAAOxM,GAC3B,GAAIxP,MAAK,EAAeknD,EAAQW,GAE5B,YADM7nD,KAAKynH,UAAUpgE,OAAOtoD,GACtB,IAAI2rE,GAEd,OAAOu5C,GAAS/8D,EAAQW,EAAM7nD,KAAKknD,OAAO5Y,OAAO4Y,GAAUthC,IAAW5lB,KAAKgkH,cAC/E,CACA,UAAMp3G,CAAKs6C,EAAQvd,GACf,MAAMijE,QAAqB5sG,MAAK,EAAkBknD,GAC5CmhE,QAAe1B,GAASz/D,EAAQvd,EAAM,QAAS,CACjDy9E,cAAepnH,KAAKonH,gBAExB,OAAOpnH,MAAK,EAAiBknD,EAAQmhE,EAAQzb,EACjD,CACA,WAAMG,CAAM7lD,EAAQvd,GAChB,MAAMijE,QAAqB5sG,MAAK,EAAkBknD,GAC5CmhE,QAAe1B,GAASz/D,EAAQvd,EAAM,QAAS,CACjDy9E,cAAepnH,KAAKonH,cACpBxa,iBAEJ,OAAO5sG,MAAK,EAAiBknD,EAAQmhE,EAAQzb,EACjD,CACA,WAAMvpF,CAAM6jC,EAAQvd,GAChB,MAAMijE,QAAqB5sG,MAAK,EAAkBknD,GAC5CmhE,QAAe1B,GAASz/D,EAAQvd,EAAM,QAAS,CACjDy9E,cAAepnH,KAAKonH,cACpBxa,iBAEJ,OAAO5sG,MAAK,EAAiBknD,EAAQmhE,EAAQzb,EACjD,CACA,SAAOrnD,CAAI9P,GACP,UAAW,MAAM,IAAE12C,EAAG,MAAEC,KAAWgB,KAAKynH,UAAUhyE,MAnF1D,SAAkBA,EAAOuuE,GACrB,MAAO,CACHtkH,OAAQymH,GACRmC,SAAU7yE,EAAM6yE,SAAW,IAAIhkH,KAAIzE,GAAM,EAAGd,MAAKC,WACtCa,EAAG0nH,GAAWxoH,EAAKC,EAAOglH,MAErCuE,QAAS9yE,EAAM8yE,QAAU,IAAIjkH,KAAIzE,GAAM,CAAC8gB,EAAGC,IAChC/gB,EAAG0nH,GAAW5mG,EAAE5hB,IAAK4hB,EAAE3hB,MAAOglH,GAAgBuD,GAAW3mG,EAAE7hB,IAAK6hB,EAAE5hB,MAAOglH,MAG5F,CAyEgEwE,CAAS/yE,GAAS,CAAC,EAAGz1C,KAAKgkH,gBAAiB,CAChG,MAAM98D,EAASogE,GAAYvoH,GAE3B,GAAImoD,EAAO5Y,OAAOtuC,KAAKknD,QACnB,SAEJ,MAAMW,EAAO87D,GAAO3nG,OAAOhd,GAEvBgB,MAAK,EAAeknD,EAAQW,SACtB7nD,KAAKynH,UAAUpgE,OAAOtoD,SAG1BklH,GAAS/8D,EAAQW,EAAM7nD,KAAKknD,OAAO5Y,OAAO4Y,GAAUthC,IAAW5lB,KAAKgkH,cAC9E,CACJ,CACA,OAAM,CAAkB98D,GACpB,IACI,MAAMnoD,EAAMqnH,GAAqBl/D,GAC3B13C,QAAYxP,KAAKynH,UAAUroH,IAAIL,GAC/BsoH,EAAS1D,GAAO3nG,OAAOxM,GAE7B,GAAIxP,MAAK,EAAeknD,EAAQmgE,GAE5B,YADMrnH,KAAKynH,UAAUpgE,OAAOtoD,GACtB,IAAI2rE,GAEd,MAAO,CACH28C,SACAx/D,KAAMk8D,GAAY78D,EAAQ13C,EAAKxP,KAAKgkH,eAE5C,CACA,MAAOv9F,GACc,kBAAbA,EAAI1lB,MACJf,KAAKoL,IAAIoc,MAAM,6CAA8Cf,EAErE,CACJ,CACA,OAAM,CAAiBygC,EAAQW,EAAM+kD,GAEjC/kD,EAAKk9D,QAAUv6G,KAAKu2D,MACpB,MAAMvxD,EAAMm0G,GAAOzuG,OAAO2yC,GAE1B,aADM7nD,KAAKynH,UAAUgB,IAAIrC,GAAqBl/D,GAAS13C,GAChD,CACHq4C,KAAMk8D,GAAY78D,EAAQ13C,EAAKxP,KAAKgkH,eACpC0E,SAAU9b,GAAc/kD,KACxBk9D,QAAyB,MAAhBnY,ILnJM+b,EKmJ8B9gE,ELnJvB+gE,EKmJ6Bhc,EAAaya,SL1IjE9C,GAReoE,EAAM5hB,UAAW6hB,EAAM7hB,WAQA,CAACpmF,EAAGC,IACzCD,EAAE6rF,cAAgB5rF,EAAE4rF,eAGnB,GAAiB7rF,EAAEmmF,UAAWlmF,EAAEkmF,cAOlCyd,GAlBYoE,EAAM5gE,UAAW6gE,EAAM7gE,WAkBG,CAACpnC,EAAGC,IAAMD,IAAMC,KAGtDwjG,GApBYuE,EAAMh8C,UAAWi8C,EAAMj8C,YAuBnCy3C,GAtBgBuE,EAAMlc,mBAAoBmc,EAAMnc,qBAyBhDgY,GAxBWkE,EAAMtgE,SAAUugE,EAAMvgE,UAwBC,CAAC1nC,EAAGC,IAAM,GAAiBD,EAAGC,OAExDioG,EAzBDF,EAAMzwD,KAyBM4wD,EAzBAF,EAAM1wD,KA0BzBusD,GAAYoE,EAAWC,GAAW,CAACnoG,EAAGC,IAAMD,EAAE3hB,QAAU4hB,EAAE5hB,OAAS2hB,EAAEujG,SAAWtjG,EAAEsjG,aAD7F,IAAmB2E,EAAWC,EA/BHH,EAAOC,CKqJ9B,CACA,GAAe1hE,EAAQW,GACnB,GAAoB,MAAhBA,EAAKk9D,QACL,OAAO,EAEX,GAAI/kH,KAAKknD,OAAO5Y,OAAO4Y,GACnB,OAAO,EAEX,MAAM6hE,EAAUlhE,EAAKk9D,QAAWv6G,KAAKu2D,MAAQ/gE,KAAK2nH,WAC5CqB,EAAqBx+G,KAAKu2D,MAAQ/gE,KAAKgkH,cACvCiF,EAAQphE,EAAKk/C,UAAUl6F,QAAOsiD,GACR,MAAjBA,EAAKg1D,UAAoBh1D,EAAKg1D,SAAW6E,IAEpD,OAAOD,GAA4B,IAAjBE,EAAMxnH,MAC5B,EExJJ,MAAMynH,GACF9gD,MACAtnE,OACAomD,OACA97C,IACA,WAAAkE,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,qBAC1CzjG,KAAKc,OAASynD,EAAWznD,OACzBd,KAAKknD,OAASqB,EAAWrB,OACzBlnD,KAAKooE,MAAQ,IAAIo/C,GAAgBj/D,EAAY18C,EACjD,CACA,CAAC43B,OAAOqB,aAAe,qBACvB,aAAM33B,CAAQtN,EAAI41C,GACdz1C,KAAKoL,IAAIm4F,MAAM,2BACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKG,WACtC7nH,KAAKoL,IAAIm4F,MAAM,yBACf,IACI,UAAW,MAAM17C,KAAQ7nD,KAAKooE,MAAM7iB,IAAI9P,GACpC51C,EAAGgoD,EAEX,CACA,QACI7nD,KAAKoL,IAAIm4F,MAAM,6BACfwkB,GACJ,CACJ,CACA,SAAMxiE,CAAI9P,GACNz1C,KAAKoL,IAAIm4F,MAAM,uBACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKG,WACtC7nH,KAAKoL,IAAIm4F,MAAM,qBACf,IACI,aAAa,GAAIvjG,KAAKooE,MAAM7iB,IAAI9P,GACpC,CACA,QACIz1C,KAAKoL,IAAIm4F,MAAM,yBACfwkB,GACJ,CACJ,CACA,YAAM,CAAO7gE,GACTlnD,KAAKoL,IAAIm4F,MAAM,2BACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKI,YACtC9nH,KAAKoL,IAAIm4F,MAAM,yBACf,UACUvjG,KAAKooE,MAAM/gB,OAAOH,EAC5B,CACA,QACIlnD,KAAKoL,IAAIm4F,MAAM,6BACfwkB,GACJ,CACJ,CACA,SAAM9oH,CAAIioD,GACNlnD,KAAKoL,IAAIm4F,MAAM,uBACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKG,WACtC7nH,KAAKoL,IAAIm4F,MAAM,qBACf,IACI,aAAavjG,KAAKooE,MAAMnpE,IAAIioD,EAChC,CACA,QACIlnD,KAAKoL,IAAIm4F,MAAM,yBACfwkB,GACJ,CACJ,CACA,SAAM3oH,CAAI8nD,GACNlnD,KAAKoL,IAAIm4F,MAAM,uBACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKG,WACtC7nH,KAAKoL,IAAIm4F,MAAM,qBACf,IACI,aAAavjG,KAAKooE,MAAM56D,KAAK05C,EACjC,CACA,QACIlnD,KAAKoL,IAAIm4F,MAAM,yBACfwkB,GACJ,CACJ,CACA,UAAMn7G,CAAK8D,EAAIi5B,GACX3pC,KAAKoL,IAAIm4F,MAAM,yBACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKI,YACtC9nH,KAAKoL,IAAIm4F,MAAM,uBACf,IACI,MAAMzuF,QAAe9U,KAAKooE,MAAMx7D,KAAK8D,EAAIi5B,GAEzC,OADA3pC,MAAK,EAAe0Q,EAAIoE,GACjBA,EAAO+yC,IAClB,CACA,QACI7nD,KAAKoL,IAAIm4F,MAAM,2BACfwkB,GACJ,CACJ,CACA,WAAMhb,CAAMr8F,EAAIi5B,GACZ3pC,KAAKoL,IAAIm4F,MAAM,0BACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKI,YACtC9nH,KAAKoL,IAAIm4F,MAAM,wBACf,IACI,MAAMzuF,QAAe9U,KAAKooE,MAAM2kC,MAAMr8F,EAAIi5B,GAE1C,OADA3pC,MAAK,EAAe0Q,EAAIoE,GACjBA,EAAO+yC,IAClB,CACA,QACI7nD,KAAKoL,IAAIm4F,MAAM,4BACfwkB,GACJ,CACJ,CACA,WAAM1kG,CAAM3S,EAAIi5B,GACZ3pC,KAAKoL,IAAIm4F,MAAM,0BACf,MAAMwkB,QAAgB/nH,KAAKooE,MAAMs/C,KAAKI,YACtC9nH,KAAKoL,IAAIm4F,MAAM,wBACf,IACI,MAAMzuF,QAAe9U,KAAKooE,MAAM/kD,MAAM3S,EAAIi5B,GAE1C,OADA3pC,MAAK,EAAe0Q,EAAIoE,GACjBA,EAAO+yC,IAClB,CACA,QACI7nD,KAAKoL,IAAIm4F,MAAM,4BACfwkB,GACJ,CACJ,CACA,uBAAMoB,CAAkB35G,EAAK45G,GACzB,MAAMphB,QAAiBL,GAAe+E,eAAel9F,EAAKo3F,GAAWO,QAC/DjgD,EAAS2rC,GAAcmV,EAASr7B,UAAUM,SAChD,IAAqC,IAAjCm8C,GAAc96E,OAAO4Y,GAErB,OADAlnD,KAAKoL,IAAI,4EAA6Eg+G,EAAcliE,IAC7F,EAEX,MAAM+/C,EAAaL,GAAWqB,mBAAmBD,EAASj1D,SAC1D,IAAI8U,EACJ,IACIA,QAAa7nD,KAAKZ,IAAI8nD,EAC1B,CACA,MAAOzgC,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CAEA,GAAgC,MAA5BohC,GAAM4kD,mBAA4B,CAClC,MAAMI,QAAuBlF,GAAeM,mBAAmBpgD,EAAK4kD,oBAC9DK,EAAelG,GAAWqB,mBAAmB4E,EAAe95D,SAClE,GAAI+5D,EAAa5F,WAAaD,EAAWC,UAErC,OADAlnG,KAAKoL,IAAI,2FAA4F0hG,EAAa5F,UAAWD,EAAWC,YACjI,CAEf,CAQA,aAPMlnG,KAAK+sG,MAAM9F,EAAW//C,OAAQ,CAChCulD,mBAAoBj9F,EACpBu3F,UAAWE,EAAWb,WAAW9hG,KAAIwiG,IAAa,CAC9C0F,aAAa,EACb1F,mBAGD,CACX,CACA,GAAep2F,EAAIoE,GACVA,EAAOiwG,UAGR/kH,KAAKknD,OAAO5Y,OAAO59B,GACnB1Q,KAAKc,OAAO8rD,kBAAkB,mBAAoB,CAAE9E,OAAQhzC,IAG5D9U,KAAKc,OAAO8rD,kBAAkB,cAAe,CAAE9E,OAAQhzC,IAE/D,EC7KiCtW,MASCA,MASFA,MASAA,MASGA,MASHA,MAS7B,MAAM,WAAsBA,MAC/BqrD,YAAc,gBACdA,YAAc,gBACd9oD,KAAO,GAAcA,KACrBgU,KAAO,GAAcA,KACrB,WAAAzF,CAAY9C,EAAU,aAClB4jC,MAAM5jC,EACV,EAE4BhO,MCtBhC,SAVA,SAAe2H,GACX,GAHsC,MAGlBA,EAHPs9B,OAAOC,eAIhB,MAAO,WACH,UAAW,MAAM/K,KAAKxyB,GACzB,EAFM,GAKP,IAAK,MAAMwyB,KAAKxyB,GAExB,EC6CA,GA3CA,SAAgBA,EAAQtG,GACpB,IAAIgL,EAAQ,EACZ,GAJsC,MAIlB1E,EAJPs9B,OAAOC,eAKhB,OAAO,kBACH,UAAW,MAAM+a,KAASt4C,QACZtG,EAAG4+C,EAAO5zC,aACV4zC,EAGjB,CANM,GASX,MAAM4qE,ECRV,SAAkBC,GAEd,MAAOpqE,EAAUhnB,GAA4C,MAAlCoxF,EAAS7lF,OAAOC,eAErC,CAAC4lF,EAAS7lF,OAAOC,iBAAkBD,OAAOC,eAE1C,CAAC4lF,EAAS7lF,OAAOyb,YAAazb,OAAOyb,UACrCnb,EAAQ,GAEd,MAAO,CACH36B,KAAM,IACK81C,EAAS72C,OAEpB7H,KAAOxB,IACH+kC,EAAMvjC,KAAKxB,EAAM,EAErBqJ,KAAM,IACE07B,EAAMtiC,OAAS,EACR,CACHuhC,MAAM,EACNhkC,MAAO+kC,EAAMz7B,SAGd42C,EAAS72C,OAEpB,CAAC6vB,KACG,OAAOl4B,IACX,EAER,CDrBqB,CAAKmG,IAChB,MAAEnH,EAAK,KAAEgkC,GAASqmF,EAAShhH,OACjC,IAAa,IAAT26B,EACA,OAAQ,YAAe,CAAhB,GAEX,MAAM4C,EAAM/lC,EAAGb,EAAO6L,KAEtB,GAAwB,mBAAb+6B,EAAIrC,KACX,OAAO,wBACOqC,UACA5mC,GAEV,UAAW,MAAMy/C,KAAS4qE,QACZxpH,EAAG4+C,EAAO5zC,aACV4zC,EAGjB,CATM,GAWX,MAAM0qD,EAAOtpG,EACb,OAAO,aACS,IAAR+lC,UACM5mC,GAEV,IAAK,MAAMy/C,KAAS4qE,EACZlgB,EAAK1qD,EAAO5zC,aACN4zC,EAGjB,CATM,EAUX,EE1BA,GAZA,SAAct4C,EAAQojH,GAClB,OAHsC,MAGlBpjH,EAHPs9B,OAAOC,eAIT,kBACH,MAAMsT,QAAY,GAAI7wC,SACf6wC,EAAI5oC,KAAKm7G,EACnB,CAHM,GAKJ,YACH,MAAMvyE,EAAM,GAAI7wC,SACT6wC,EAAI5oC,KAAKm7G,EACnB,CAHM,EAIX,ECUA,GA9BA,SAAcpjH,EAAQwoD,GAClB,OAHsC,MAGlBxoD,EAHPs9B,OAAOC,eAIT,kBACH,IAAI8lF,EAAQ,EACZ,KAAI76D,EAAQ,GAGZ,UAAW,MAAMlQ,KAASt4C,EAGtB,SAFMs4C,EACN+qE,IACIA,IAAU76D,EACV,MAGX,CAZM,GAcJ,YACH,IAAI66D,EAAQ,EACZ,KAAI76D,EAAQ,GAGZ,IAAK,MAAMlQ,KAASt4C,EAGhB,SAFMs4C,EACN+qE,IACIA,IAAU76D,EACV,MAGX,CAZM,EAaX,EC9DO,MAAM86D,GACT,GAAAhB,CAAI1pH,EAAKkM,EAAKgP,GACV,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,2BACpC,CACA,GAAAY,CAAIL,EAAKkb,GACL,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,2BACpC,CACA,GAAAS,CAAIF,EAAKkb,GACL,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,2BACpC,CACA,OAAOO,EAAKkb,GACR,OAAOsiB,QAAQC,OAAO,IAAIh+B,MAAM,8BACpC,CACA,aAAOkrH,CAAQvjH,EAAQ8T,EAAU,CAAC,GAC9B,UAAW,MAAM,IAAElb,EAAG,MAAEC,KAAWmH,QACzBnG,KAAKyoH,IAAI1pH,EAAKC,EAAOib,SACrBlb,CAEd,CACA,aAAO4qH,CAAQxjH,EAAQ8T,EAAU,CAAC,GAC9B,UAAW,MAAMlb,KAAOoH,OACd,CACFpH,MACAC,YAAagB,KAAKZ,IAAIL,EAAKkb,GAGvC,CACA,gBAAO2vG,CAAWzjH,EAAQ8T,EAAU,CAAC,GACjC,UAAW,MAAMlb,KAAOoH,QACdnG,KAAKqnD,OAAOtoD,EAAKkb,SACjBlb,CAEd,CACA,KAAA8qH,GACI,IAAIC,EAAO,GACPC,EAAO,GACX,MAAO,CACH,GAAAtB,CAAI1pH,EAAKC,GACL8qH,EAAKtpH,KAAK,CAAEzB,MAAKC,SACrB,EACA,OAAOD,GACHgrH,EAAKvpH,KAAKzB,EACd,EACAirH,OAAQ78E,MAAOlzB,UACL,GAAMja,KAAK0pH,QAAQI,EAAM7vG,IAC/B6vG,EAAO,SACD,GAAM9pH,KAAK4pH,WAAWG,EAAM9vG,IAClC8vG,EAAO,EAAE,EAGrB,CAKA,UAAOE,CAAKznF,EAAGvoB,GACX,MAAM,IAAIzb,MAAM,2BACpB,CAKA,cAAO0rH,CAAS1nF,EAAGvoB,GACf,MAAM,IAAIzb,MAAM,+BACpB,CACA,KAAAi3C,CAAMjT,EAAGvoB,GACL,IAAI4hG,EAAK77G,KAAKiqH,KAAKznF,EAAGvoB,GACtB,GAAgB,MAAZuoB,EAAE9iC,OAAgB,CAClB,MAAMA,EAAS8iC,EAAE9iC,OACjBm8G,EAAK,GAAOA,GAAK53F,GAAMA,EAAEllB,IAAIsH,WAAWkmB,WAAW7sB,IACvD,CAOA,GANIiC,MAAM2Q,QAAQkwB,EAAE8lF,WAChBzM,EAAKr5E,EAAE8lF,QAAQh+E,QAAO,CAACuxE,EAAI5mG,IAAM,GAAO4mG,EAAI5mG,IAAI4mG,IAEhDl6G,MAAM2Q,QAAQkwB,EAAE+lF,UAChB1M,EAAKr5E,EAAE+lF,OAAOj+E,QAAO,CAACuxE,EAAI5mG,IAAM,GAAK4mG,EAAI5mG,IAAI4mG,IAEjC,MAAZr5E,EAAEt/B,OAAgB,CAClB,IAAI3B,EAAI,EACR,MAAM2B,EAASs/B,EAAEt/B,OACjB24G,EAAK,GAAOA,GAAI,IAAMt6G,KAAO2B,GACjC,CAIA,OAHe,MAAXs/B,EAAEmsB,QACFktD,EAAK,GAAKA,EAAIr5E,EAAEmsB,QAEbktD,CACX,CACA,SAAAsO,CAAU3nF,EAAGvoB,GACT,IAAI4hG,EAAK77G,KAAKkqH,SAAS1nF,EAAGvoB,GAC1B,GAAgB,MAAZuoB,EAAE9iC,OAAgB,CAClB,MAAMA,EAAS8iC,EAAE9iC,OACjBm8G,EAAK,GAAOA,GAAK98G,GAAQA,EAAIsH,WAAWkmB,WAAW7sB,IACvD,CAOA,GANIiC,MAAM2Q,QAAQkwB,EAAE8lF,WAChBzM,EAAKr5E,EAAE8lF,QAAQh+E,QAAO,CAACuxE,EAAI5mG,IAAM,GAAO4mG,EAAI5mG,IAAI4mG,IAEhDl6G,MAAM2Q,QAAQkwB,EAAE+lF,UAChB1M,EAAKr5E,EAAE+lF,OAAOj+E,QAAO,CAACuxE,EAAI5mG,IAAM,GAAK4mG,EAAI5mG,IAAI4mG,IAEjC,MAAZr5E,EAAEt/B,OAAgB,CAClB,MAAMA,EAASs/B,EAAEt/B,OACjB,IAAI3B,EAAI,EACRs6G,EAAK,GAAOA,GAAI,IAAMt6G,KAAO2B,GACjC,CAIA,OAHe,MAAXs/B,EAAEmsB,QACFktD,EAAK,GAAKA,EAAIr5E,EAAEmsB,QAEbktD,CACX,EC7GG,MAAMuO,WAAwBX,GACjC9/E,KACA,WAAAr6B,GACI8gC,QACApwC,KAAK2pC,KAAO,IAAIkE,GACpB,CACA,GAAA46E,CAAI1pH,EAAKkM,GAEL,OADAjL,KAAK2pC,KAAKrqC,IAAIP,EAAIsH,WAAY4E,GACvBlM,CACX,CACA,GAAAK,CAAIL,GACA,MAAM+V,EAAS9U,KAAK2pC,KAAKvqC,IAAIL,EAAIsH,YACjC,GAAc,MAAVyO,EACA,MAAM,IAAI,GAEd,OAAOA,CACX,CACA,GAAA7V,CAAIF,GACA,OAAOiB,KAAK2pC,KAAK1qC,IAAIF,EAAIsH,WAC7B,CACA,OAAOtH,GACHiB,KAAK2pC,KAAK0d,OAAOtoD,EAAIsH,WACzB,CACA,KAAC4jH,GACG,IAAK,MAAOlrH,EAAKC,KAAUgB,KAAK2pC,KAAKwmB,eAC3B,CAAEpxD,IAAK,IAAIqmH,GAAIrmH,GAAMC,QAEnC,CACA,SAACkrH,GACG,IAAK,MAAMnrH,KAAOiB,KAAK2pC,KAAKzkC,aAClB,IAAIkgH,GAAIrmH,EAEtB,EChCJ,MAAMsrH,GAAwBpB,GAAUA,EAIxC,SAASqB,GAAYnwD,EAAIjT,GACrB,MAAMqjE,EAAoBpwD,EAAGrF,YAS7B,OAPyB,MAArBy1D,GACuB33B,GAAiB23B,GAErBj8E,OAAO4Y,KACtBiT,EAAKA,EAAGxF,YAAY,GAAU,QAAQzN,EAAO7gD,gBAG9C8zD,CACX,CACO,MAAMqwD,GACTp/G,IACAm9C,WAEAzkB,OACAw8E,SACA6D,SACA3D,eAOA,WAAAlxG,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B,MAAM,OAAEi4B,EAAS,GAAE,SAAEw8E,EAAW,IAAOz0G,EACvC7L,KAAKuoD,WAAaA,EAClBvoD,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,0BAC1CzjG,KAAK8jC,OAASA,EAAOx/B,KAAI61D,GAAMA,EAAG9zD,aAClCrG,KAAKsgH,SAAW,IAAIhlE,IAAIglE,EAASh8G,KAAI61D,GAAMA,EAAG9zD,cAC9CrG,KAAKmkH,SAAW,IAAIt2E,IACpB7tC,KAAKwgH,eAAiB30G,EAAK20G,gBAAkB6J,GAG7CrqH,KAAKyqH,0BC3CN,SAAkBthB,GACrB,IAAIviF,EACJ,OAAO,WAKHL,aAAaK,GACbA,EAAUC,YALI,WACVD,OAAU1nB,EACViqG,GACJ,GDqCqF,IClCzF,CACJ,CDiCyCuhB,CAAS1qH,KAAKyqH,0BAA0BruF,KAAKp8B,OAE9EuoD,EAAWznD,OAAOyjD,iBAAiB,uBAAuB,KACtDvkD,KAAKyqH,2BAA2B,IAGpCliE,EAAWznD,OAAOyjD,iBAAiB,mBAAmB,KAClDvkD,KAAKyqH,2BAA2B,GAExC,CACA,CAAChnF,OAAOqB,aAAe,0BACvB,yBAAA2lF,GAGI,MAAMxB,EAAQjpH,KAAK2qH,mBACdvpH,OAAOpB,KAAKuoD,WAAWk4D,iBAAiBmK,YACxCxpH,OAAO,IAAIpB,KAAKmkH,SAASh0D,WACzBtjD,QAAO,EAAE8rB,EAAG0vB,KAAcA,EAASwiE,YACnCvmH,KAAI,EAAEyB,KAAS,GAAUA,MAAOzB,KAAI61D,GAEjCA,EAAGrF,cAAgB90D,KAAKuoD,WAAWrB,OAAO7gD,WACnC8zD,EAAGxF,YAAY,QAAQ30D,KAAKuoD,WAAWrB,OAAO7gD,cAElD8zD,IAEXn6D,KAAKuoD,WAAW2N,UAAU62C,MAAM/sG,KAAKuoD,WAAWrB,OAAQ,CACpDk/C,WAAY6iB,IAEX3lF,OAAM7c,IAASzmB,KAAKoL,IAAIoc,MAAM,2BAA4Bf,EAAI,GACvE,CAIA,cAAAqkG,GACI,OAAOnpH,MAAM4c,KAAKve,KAAK8jC,QAAQx/B,KAAKqc,GAAM,GAAUA,IACxD,CAIA,gBAAAgqG,GACI,OAAOhpH,MAAM4c,KAAKve,KAAKsgH,UAAUh8G,KAAKqc,GAAM,GAAUA,IAC1D,CAIA,gBAAAoqG,GACI,OAAOppH,MAAM4c,KAAKve,KAAKmkH,UAAU7/G,KAAI,EAAEqc,KAAO,GAAUA,IAC5D,CAIA,eAAAysF,CAAgBj+C,GAEZ,MAAMyF,GADNzF,EAAOm7D,GAAYn7D,EAAMnvD,KAAKuoD,WAAWrB,SACjB7gD,WAEpBrG,KAAKmkH,SAASllH,IAAI21D,IAGtB50D,KAAKmkH,SAAS7kH,IAAIs1D,EAAY,CAC1Bi2D,WAAW,GAEnB,CACA,mBAAAG,CAAoB77D,GAEhB,MAAMyF,GADNzF,EAAOm7D,GAAYn7D,EAAMnvD,KAAKuoD,WAAWrB,SACjB7gD,WAIlB4kH,GAHWjrH,KAAKmkH,SAAS/kH,IAAIw1D,IAAe,CAC9Ci2D,WAAW,IAEqBA,UACpC7qH,KAAKmkH,SAAS7kH,IAAIs1D,EAAY,CAC1Bi2D,WAAW,IAGVI,GACDjrH,KAAKyqH,2BAEb,CACA,kBAAAS,CAAmB/7D,GAEf,MAAMyF,GADNzF,EAAOm7D,GAAYn7D,EAAMnvD,KAAKuoD,WAAWrB,SACjB7gD,WACxBrG,KAAKmkH,SAAS98D,OAAOuN,EACzB,CACA,YAAAy4C,GACI,IAAI4b,EAAQjpH,KAAK2qH,mBAAmBrmH,KAAI61D,GAAMA,EAAG9zD,aAC5B,IAAjB4iH,EAAMxnH,SAENwnH,EAAQjpH,KAAKuoD,WAAWk4D,iBAAiBmK,WAAWtmH,KAAI61D,GAAMA,EAAG9zD,cAGrE4iH,EAAQA,EAAM7nH,OAAOO,MAAM4c,KAAKve,KAAKmkH,UAChCt3G,QAAO,EAAEstD,EAAI9R,KAAcA,EAASwiE,YACpCvmH,KAAI,EAAE61D,KAAQA,KAEnB,MAAMgxD,EAAU,IAAI7vE,IAAI2tE,GAExB,OAAOjpH,KAAKwgH,eAAe7+G,MAAM4c,KAAK4sG,GACjC7mH,KAAIyB,GAAO,GAAUA,MACrBzB,KAAI61D,IAE2B,IAA5BA,EAAG5F,SAAS/2B,OAAOxd,MAGnBm6C,EAAGrF,cAAgB90D,KAAKuoD,WAAWrB,OAAO7gD,WAFnC8zD,EAKJA,EAAGzF,YAAY,QAAQ10D,KAAKuoD,WAAWrB,OAAO7gD,eAE7D,EEtJG,SAAS+kH,GAAY74G,GACxB,OAAc,MAAPA,GAAoC,mBAAdA,EAAIvL,OAA4C,mBAAbuL,EAAI+T,IACxE,CCFO,IAAIotB,IACX,SAAWA,GACPA,EAA0B,gBAAI,qCAC9BA,EAAoB,UAAI,WAC3B,CAHD,CAGGA,KAAaA,GAAW,CAAC,IACrB,MAAM23E,WAA4B7sH,MACrC,WAAA8Q,CAAY9C,EAAU,mBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAEG,MAAMuqH,WAAsC9sH,MAC/C,WAAA8Q,CAAY9C,EAAU,8BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,+BAChB,EAEG,MAAMwqH,WAA8B/sH,MACvC,WAAA8Q,CAAY9C,EAAU,gCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAMyqH,WAA2BhtH,MACpC,WAAA8Q,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,oBAChB,EAEG,MAAM0qH,WAA4BjtH,MACrC,WAAA8Q,CAAY9C,EAAU,+BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,qBAChB,EAEG,MAAM2qH,WAA+BltH,MACxC,WAAA8Q,CAAY9C,EAAU,4BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,wBAChB,EAEG,MAAM4qH,WAAsCntH,MAC/C,WAAA8Q,CAAY9C,EAAU,oCAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,+BAChB,EAEG,MAAM6qH,WAAwBptH,MACjC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,iBAChB,EAEG,MAAM8qH,WAA8BrtH,MACvC,WAAA8Q,CAAY9C,EAAU,sBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAM+qH,WAAmCttH,MAC5C,WAAA8Q,CAAY9C,EAAU,0BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,4BAChB,EAEG,MAAMgrH,WAA8BvtH,MACvC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAMirH,WAA8BxtH,MACvC,WAAA8Q,CAAY9C,EAAU,6BAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAMkrH,WAA8BztH,MACvC,WAAA8Q,CAAY9C,EAAU,qBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,uBAChB,EAEG,MAAMmrH,WAAkC1tH,MAC3C,WAAA8Q,CAAY9C,EAAU,yBAClB4jC,MAAM5jC,GACNxM,KAAKe,KAAO,2BAChB,ECnFJ,MAAMorH,GACF5jE,WAAa,CAAC,EACd6jE,UAAW,EACX,WAAA98G,CAAYzD,EAAO,CAAC,GAChB7L,KAAKuoD,WAAa,CAAC,EACnB,IAAK,MAAOxpD,EAAKC,KAAUL,OAAOwxD,QAAQtkD,GACtC7L,KAAKuoD,WAAWxpD,GAAOC,EAEG,MAA1BgB,KAAKuoD,WAAW5K,SAChB39C,KAAKuoD,WAAW5K,OAAS6jE,KAEjC,CACA,SAAA5kD,GACI,OAAO58D,KAAKosH,QAChB,CACA,4BAAMC,CAAuBj4G,SACnBmoB,QAAQgpB,IAAI5mD,OAAOsE,OAAOjD,KAAKuoD,YAChC17C,QAAO0F,GAAO64G,GAAY74G,KAC1BjO,KAAI6oC,MAAOm/E,UACNA,EAAUl4G,OAAe,IAEvC,CACA,iBAAMm4G,SACIvsH,KAAKqsH,uBAAuB,cACtC,CACA,WAAMrlH,SACIhH,KAAKqsH,uBAAuB,SAClCrsH,KAAKosH,UAAW,CACpB,CACA,gBAAMI,SACIxsH,KAAKqsH,uBAAuB,aACtC,CACA,gBAAMI,SACIzsH,KAAKqsH,uBAAuB,aACtC,CACA,UAAM/lG,SACItmB,KAAKqsH,uBAAuB,QAClCrsH,KAAKosH,UAAW,CACpB,CACA,eAAMM,SACI1sH,KAAKqsH,uBAAuB,YACtC,EAEJ,MAAMM,GAAoB,CACtB,UACA,sBACA,OAEEC,GAAyB,CAC3B,aACA,YACA,cACA,QACA,aACA,aACA,OACA,YACA,OACA,0BA2CJ,SAASC,GAAuBzhG,GAC5B,OAAIzpB,MAAM2Q,QAAQ8Y,IAAUgnE,KACjBhnE,EAAQgnE,IAEZ,EACX,CACA,SAAS06B,GAAuB1hG,GAC5B,OAAIzpB,MAAM2Q,QAAQ8Y,IAAUinE,KACjBjnE,EAAQinE,IAEZ,EACX,CACA,SAAS06B,GAAe3hG,GACpB,OAAOA,IAAUqY,OAAOqB,cAAgB1Z,GAAS/kB,YAAc,SACnE,CCjHO,SAAS2mH,GAAgBC,EAAQ,CAAC,GACrC,MAAO,CACHC,aAAc//E,UAAY,EAC1BggF,kBAAmBhgF,MAAO25D,IACtB,MAAM/zC,EAAS+zC,EAAU9zC,eACzB,OAAqB,IAAjBD,EAAO,GAAG,IAA6B,KAAjBA,EAAO,GAAG,KACzBjmD,QAAQ67F,GAAY,GAAG51C,EAAO,GAAG,MAEhC,EAEhBq6D,sBAAuBjgF,UAAY,EACnCkgF,uBAAwBlgF,UAAY,EACpCmgF,+BAAgCngF,UAAY,EAC5CogF,gCAAiCpgF,UAAY,EAC7CqgF,8BAA+BrgF,UAAY,EAC3CsgF,+BAAgCtgF,UAAY,EAC5CugF,uBAAwBvgF,UAAY,KACjC8/E,EAEX,CCPO,MAAMU,GACTrpH,IACA,WAAAgL,CAAYhL,GAER,GADAtE,KAAKsE,IAAM,IAAIupC,IACJ,MAAPvpC,EACA,IAAK,MAAOvF,EAAKC,KAAUsF,EAAI6rD,UAC3BnwD,KAAKsE,IAAIhF,IAAIP,EAAIsH,WAAY,CAAEtH,MAAKC,SAGhD,CACA,CAACykC,OAAOyb,YACJ,OAAOl/C,KAAKmwD,SAChB,CACA,KAAA5wD,GACIS,KAAKsE,IAAI/E,OACb,CACA,OAAOsoD,GACH,OAAO7nD,KAAKsE,IAAI+iD,OAAOQ,EAAKxhD,WAChC,CACA,OAAA8pD,GACI,OAAOwxD,GAAY3hH,KAAKsE,IAAI6rD,WAAYllD,GAC7B,CAACA,EAAI,GAAGlM,IAAKkM,EAAI,GAAGjM,QAEnC,CACA,OAAAmO,CAAQtN,GACJG,KAAKsE,IAAI6I,SAAQ,CAACnO,EAAOD,KACrBc,EAAGb,EAAMA,MAAOA,EAAMD,IAAKiB,KAAK,GAExC,CACA,GAAAZ,CAAIyoD,GACA,OAAO7nD,KAAKsE,IAAIlF,IAAIyoD,EAAKxhD,aAAarH,KAC1C,CACA,GAAAC,CAAI4oD,GACA,OAAO7nD,KAAKsE,IAAIrF,IAAI4oD,EAAKxhD,WAC7B,CACA,GAAA/G,CAAIuoD,EAAM7oD,GACNgB,KAAKsE,IAAIhF,IAAIuoD,EAAKxhD,WAAY,CAAEtH,IAAK8oD,EAAM7oD,SAC/C,CACA,IAAAkG,GACI,OAAOy8G,GAAY3hH,KAAKsE,IAAIrB,UAAWgI,GAC5BA,EAAIlM,KAEnB,CACA,MAAAkE,GACI,OAAO0+G,GAAY3hH,KAAKsE,IAAIrB,UAAWgI,GAAQA,EAAIjM,OACvD,CACA,QAAIP,GACA,OAAOuB,KAAKsE,IAAI7F,IACpB,EC5DG,SAASmvH,GAAe/lE,GAC3B,GAAIkF,GAASlF,GACT,MAAO,CAAEX,OAAQW,EAAMu+C,WAAY,IAKvC,IAAIl/C,EACJ,GAJKvlD,MAAM2Q,QAAQu1C,KACfA,EAAO,CAACA,IAGRA,EAAKpmD,OAAS,EAAG,CACjB,MAAM0lD,EAAYU,EAAK,GAAGiN,YAC1B5N,EAAsB,MAAbC,OAAoBjoD,EAAY0zF,GAAiBzrC,GAE1DU,EAAK16C,SAAQgtD,IACT,IAAKxG,GAAYwG,GACb,MAAM,IAAIyQ,GAAsB,qBAEpC,MAAMijD,EAAc1zD,EAAGrF,YACvB,GAAmB,MAAf+4D,GACA,GAAc,MAAV3mE,EACA,MAAM,IAAI,GAAuB,oEAGpC,CACD,MAAM4mE,EAAWl7B,GAAiBi7B,GAClC,IAAiC,IAA7B3mE,GAAQ5Y,OAAOw/E,GACf,MAAM,IAAI,GAAuB,+DAEzC,IAER,CACA,MAAO,CACH5mE,SACAk/C,WAAYv+C,EAEpB,CCrBA,MAAMkmE,GAA6B,CAE/B,iBAEA,sBAEA,wBAEA,iBCxBE,GAAiB,CACnBC,eCA2B,IDC3BC,MAAO,IAKJ,MAAMC,GACTF,eACArlE,kBACAuN,UACA+3D,MACAntH,OACAsK,IACA,WAAAkE,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKguH,eAAiBniH,EAAKmiH,gBAAkB,GAAeA,eAC5DhuH,KAAKiuH,MAAQpiH,EAAKoiH,OAAS,GAAeA,MAC1CjuH,KAAK2oD,kBAAoBJ,EAAWI,kBACpC3oD,KAAKk2D,UAAY3N,EAAW2N,UAC5Bl2D,KAAKc,OAASynD,EAAWznD,OACzBd,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,+CAC1CzjG,KAAKmuH,sBAAwBnuH,KAAKmuH,sBAAsB/xF,KAAKp8B,KACjE,CACA,KAAAgH,GACIhH,KAAKc,OAAOyjD,iBAAiB,kBAAmBvkD,KAAKmuH,sBACzD,CACA,IAAA7nG,GACItmB,KAAKc,OAAO2jD,oBAAoB,kBAAmBzkD,KAAKmuH,sBAC5D,CACA,qBAAAA,GACInuH,KAAKouH,yBACA9qF,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,qCAAsCf,EAAI,GAEjE,CAKA,4BAAM2nG,GACF,MAAM7nE,EAAcvmD,KAAK2oD,kBAAkB9B,iBACrCwnE,EAAiB9nE,EAAY9kD,OAEnC,GADAzB,KAAKoL,IAAI,uCAAwCijH,EAAgBruH,KAAKguH,gBAClEK,GAAkBruH,KAAKguH,eACvB,OAEJ,MAAMM,EAAa,IAAIX,GAEvB,IAAK,MAAMlmE,KAAclB,EAAa,CAClC,MAAMwE,EAAatD,EAAWsD,WAC9B,IAAIujE,EAAWrvH,IAAI8rD,GAAnB,CAGAujE,EAAWhvH,IAAIyrD,EAAY,GAC3B,IACI,MAAMlD,QAAa7nD,KAAKk2D,UAAU92D,IAAI2rD,GAEtCujE,EAAWhvH,IAAIyrD,EAAY,IAAIlD,EAAKqQ,KAAKj1D,UAAUqnC,QAAO,CAAC6Q,EAAKryC,IACrDqyC,EAAMryC,EAAK9J,OACnB,GACP,CACA,MAAOynB,GACc,kBAAbA,EAAI1lB,MACJf,KAAKoL,IAAIoc,MAAM,0BAA2Bf,EAElD,CAbA,CAcJ,CACA,MAAM8nG,EAAoBvuH,KAAKwuH,gBAAgBjoE,EAAa+nE,GAEtDG,EAAUxlH,KAAK1K,IAAI8vH,EAAiBruH,KAAKguH,eAAgB,GACzDU,EAAU,GAChB,IAAK,MAAMjnE,KAAc8mE,EAUrB,GATAvuH,KAAKoL,IAAI,yDAA0Dq8C,EAAWsD,YAEhD/qD,KAAKiuH,MAAMjzD,MAAMb,GACpC1S,EAAW8lD,WAAWlnG,WAAWkmB,WAAW4tC,EAAG9zD,eAItDqoH,EAAQluH,KAAKinD,GAEbinE,EAAQjtH,SAAWgtH,EACnB,YAIFlyF,QAAQgpB,IAAImpE,EAAQpqH,KAAI6oC,MAAOsa,UDxDtCta,eAA6Csa,EAAYxtC,GAC5D,MAAM00G,EAAkBlnE,GAAYQ,SAAS3jD,KAAI8hD,GAAUA,EAAO8B,YAAa,GACzE0mE,EAAoB30G,GAAS20G,mBAAqBb,GAGxD,KAAIY,EAAgB9hH,QAAOixC,GAAkB,MAATA,IAAkB8wE,EAAkB5jG,SAAS8yB,KAAQr8C,OAAS,GAGlG,UACUgmD,GAAY6kD,MAAMryF,GAC5B,CACA,MAAOwM,GACHghC,GAAY2f,MAAM3gD,EACtB,CACJ,CC2CkBooG,CAA8BpnE,EAAY,CAC5CrD,OAAQioD,YAAYzlF,QAAQ,MAC9B,KAGN5mB,KAAKc,OAAO8rD,kBAAkB,mBAAoB,CAAE9E,OAAQ4mE,GAChE,CACA,eAAAF,CAAgBjoE,EAAa+nE,GACzB,OAAO/nE,EAEFn4C,MAAK,CAACuS,EAAGC,KACV,MAAMkuG,EAAsBnuG,EAAE6lC,SAASh2B,KACjCu+F,EAAsBnuG,EAAE4lC,SAASh2B,KACvC,OAAIs+F,EAAsBC,EACf,EAEPD,EAAsBC,GACd,EAEL,CAAC,IAGP3gH,MAAK,CAACuS,EAAGC,IACU,aAAhBD,EAAEuxF,WAA4C,YAAhBtxF,EAAEsxF,UACzB,EAES,YAAhBvxF,EAAEuxF,WAA2C,aAAhBtxF,EAAEsxF,WACvB,EAEL,IAGN9jG,MAAK,CAACuS,EAAGC,IACND,EAAEsnC,QAAQxmD,OAASmf,EAAEqnC,QAAQxmD,OACtB,EAEPkf,EAAEsnC,QAAQxmD,OAASmf,EAAEqnC,QAAQxmD,QACrB,EAEL,IAGN2M,MAAK,CAACuS,EAAGC,KACV,MAAMouG,EAAaV,EAAWlvH,IAAIuhB,EAAEoqC,aAAe,EAC7CkkE,EAAaX,EAAWlvH,IAAIwhB,EAAEmqC,aAAe,EACnD,OAAIikE,EAAaC,EACN,EAEPD,EAAaC,GACL,EAEL,CAAC,GAEhB,EE5IG,MAiCMC,GAAwB,oBAMxBC,GAAwB,oBCuE9B,MAAM,WAAmB3wH,MAC5B2G,KACA4P,KACA,WAAAzF,CAAY9C,EAASuI,GACjBq7B,MAAM5jC,GAAW,6BACjBxM,KAAKmF,KAAO,UACZnF,KAAKe,KAAO,aACZf,KAAK+U,KAAOA,GAAQ,WACxB,EAKGo4B,eAAeiiF,GAAUlvH,EAASmvH,EAAWjrE,EAAQtnB,GAExD,MAAMtV,EAAQ,IAAI,GAAWsV,GAAM+nB,aAAc/nB,GAAMgoB,WACvD,OAAwB,IAApBV,GAAQQ,QACDroB,QAAQC,OAAOhV,GAEnB,IAAI+U,SAAQ,CAACr4B,EAASs4B,KACzB,SAAS8yF,IACLlrE,GAAQK,oBAAoB,QAASyuD,GACrChzG,EAAQukD,oBAAoB4qE,EAAWE,GACf,MAApBzyF,GAAM0yF,YACNtvH,EAAQukD,oBAAoB3nB,EAAK0yF,WAAYC,EAErD,CACA,MAAMF,EAAiBjvH,IACnB,IACI,IAA4B,IAAxBw8B,GAAMjwB,SAASvM,GACf,MAER,CACA,MAAOmmB,GAGH,OAFA6oG,SACA9yF,EAAO/V,EAEX,CACA6oG,IACAprH,EAAQ5D,EAAI,EAEVmvH,EAAsBnvH,IACxBgvH,IACA9yF,EAAOl8B,EAAIwnD,OAAO,EAEhBorD,EAAgB,KAClBoc,IACA9yF,EAAOhV,EAAM,EAEjB48B,GAAQG,iBAAiB,QAAS2uD,GAClChzG,EAAQqkD,iBAAiB8qE,EAAWE,GACZ,MAApBzyF,GAAM0yF,YACNtvH,EAAQqkD,iBAAiBznB,EAAK0yF,WAAYC,EAC9C,GAER,CCtKO,MAAMC,GACT1+F,SACAozB,OACA,WAAA90C,CAAY80C,GACRpkD,KAAKokD,OAASA,EACdpkD,KAAKgxB,SAAW2xB,KAChB3iD,KAAK4yG,QAAU5yG,KAAK4yG,QAAQx2E,KAAKp8B,MACjCA,KAAKokD,QAAQG,iBAAiB,QAASvkD,KAAK4yG,QAChD,CACA,OAAAA,GACI5yG,KAAKgxB,SAASwL,OAAOx8B,KAAKokD,QAAQ0b,QAAU,IAAI,GACpD,CACA,OAAA83C,GACI53G,KAAKokD,QAAQK,oBAAoB,QAASzkD,KAAK4yG,QACnD,ECPG,MAAM+c,GACTj/G,GACA7Q,GACAoa,QACA21G,WACAx/F,OACAo2B,SACAqpE,WACA,WAAAvgH,CAAYzP,EAAIoa,GACZja,KAAK0Q,GAXF,GAAI8N,SAASxP,OAAuB,IAAhB/F,KAAKm0B,UAAiB,IAAK/2B,aAAamE,KAAKu2D,QAYpE/gE,KAAKowB,OAAS,SACdpwB,KAAKH,GAAKA,EACVG,KAAKia,QAAUA,EACfja,KAAK4vH,WAAa,GAClB5vH,KAAKwmD,SAAW,CACZspE,QAAStlH,KAAKu2D,OAElB/gE,KAAK6vH,WAAa,IAAI9c,gBACI/yG,KAAK6vH,WAAWzrE,OAC1CpkD,KAAK4yG,QAAU5yG,KAAK4yG,QAAQx2E,KAAKp8B,KACrC,CACA,KAAAonE,CAAM3gD,GACFzmB,KAAK6vH,WAAWzoD,MAAM3gD,EAC1B,CACA,OAAAmsF,GACuB5yG,KAAK4vH,WAAWtlF,QAAO,CAAC6Q,EAAKryC,IACrCqyC,IAAiC,IAAzBryC,EAAKs7C,QAAQQ,UAC7B,KAGC5kD,KAAK6vH,WAAWzoD,MAAM,IAAI,IAC1BpnE,KAAK43G,UAEb,CACA,UAAM/vG,CAAKoS,EAAU,CAAC,GAClB,MAAM81G,EAAY,IAAIL,GAAaz1G,EAAQmqC,QAG3C,OAFApkD,KAAK4vH,WAAWpvH,KAAKuvH,GACrB91G,EAAQmqC,QAAQG,iBAAiB,QAASvkD,KAAK4yG,SACxCmd,EAAU/+F,SAAS4xB,OAC9B,CACA,SAAMygB,GACFrjE,KAAKowB,OAAS,UACdpwB,KAAKwmD,SAAS8kD,QAAU9gG,KAAKu2D,MAC7B,IACI/gE,KAAK6vH,WAAWzrE,OAAOC,iBACvB,MAAMvvC,QAAe6vC,GAAW3kD,KAAKH,GAAG,IAChCG,KAAKia,SAAW,CAAC,EACrBmqC,OAAQpkD,KAAK6vH,WAAWzrE,SACxBpkD,KAAK6vH,WAAWzrE,QACpBpkD,KAAK4vH,WAAWziH,SAAQ4iH,IACpBA,EAAU/+F,SAAS9sB,QAAQ4Q,EAAO,IAEtC9U,KAAKowB,OAAS,UAClB,CACA,MAAO3J,GACHzmB,KAAK4vH,WAAWziH,SAAQ4iH,IACpBA,EAAU/+F,SAASwL,OAAO/V,EAAI,IAElCzmB,KAAKowB,OAAS,SAClB,CACA,QACIpwB,KAAKwmD,SAAS1P,SAAWtsC,KAAKu2D,MAC9B/gE,KAAK43G,SACT,CACJ,CACA,OAAAA,GACI53G,KAAK4vH,WAAWziH,SAAQ4iH,IACpBA,EAAUnY,UACVmY,EAAU3rE,QAAQK,oBAAoB,QAASzkD,KAAK4yG,QAAQ,GAEpE,ECpEG,MAAMod,WAAcvjE,GACvB6vD,YACAgD,QACAv7E,MACAzH,QACAluB,KACA,WAAAkB,CAAYzD,EAAO,CAAC,GAChBukC,QACApwC,KAAKs8G,YAAczwG,EAAKywG,aAAe/xG,OAAO+wG,kBAC9Ct7G,KAAKs/G,QAAUzzG,EAAKyzG,SAAW/0G,OAAO+wG,kBACtCt7G,KAAKs8B,QAAU,EACQ,MAAnBzwB,EAAKokH,YACLpkH,EAAKm2F,SAASkuB,oBAAoBrkH,EAAKokH,WAAY,CAC/CE,UAAW,KACA,CACH1xH,KAAMuB,KAAK+jC,MAAMtiC,OACjB2uH,QAASpwH,KAAKs8B,QACdzK,OAAQ7xB,KAAK+jC,MAAMtiC,OAASzB,KAAKs8B,YAKjDt8B,KAAKoO,KAAOvC,EAAKuC,KACjBpO,KAAK+jC,MAAQ,EACjB,CACA,iBAAAssF,GACI,GAAkB,IAAdrwH,KAAKvB,KAaL,OAVAulD,gBAAe,KACXhkD,KAAK4sD,kBAAkB,QAAQ,IAEd,IAAjB5sD,KAAKowH,SAGLpsE,gBAAe,KACXhkD,KAAK4sD,kBAAkB,OAAO,KAG/B,EAEX,GAAI5sD,KAAKs8B,QAAUt8B,KAAKs8G,YAAa,CACjC,IAAIM,EACJ,IAAK,MAAMp6G,KAAKxC,KAAK+jC,MACjB,GAAiB,WAAbvhC,EAAE4tB,OAAqB,CACvBwsF,EAAMp6G,EACN,KACJ,CAEJ,OAAW,MAAPo6G,IAGJ58G,KAAK4sD,kBAAkB,UACvB5sD,KAAKs8B,UACAsgF,EAAIv5C,MACJitB,SAAQ,KAET,IAAK,IAAI/uF,EAAI,EAAGA,EAAIvB,KAAK+jC,MAAMtiC,OAAQF,IACnC,GAAIvB,KAAK+jC,MAAMxiC,KAAOq7G,EAAK,CACvB58G,KAAK+jC,MAAM74B,OAAO3J,EAAG,GACrB,KACJ,CAEJvB,KAAKs8B,UACLt8B,KAAKqwH,oBACLrwH,KAAK4sD,kBAAkB,OAAO,KAE3B,EACX,CACA,OAAO,CACX,CACA,OAAA6uD,CAAQmB,GACJ58G,KAAK+jC,MAAMvjC,KAAKo8G,GACC,MAAb58G,KAAKoO,MACLpO,KAAK+jC,MAAM31B,KAAKpO,KAAKoO,KAE7B,CAIA,SAAM4O,CAAInd,EAAIoa,GAEV,GADAA,GAASmqC,QAAQC,iBACbrkD,KAAKvB,OAASuB,KAAKs/G,QACnB,MAAM,IAAI3Q,GAEd,MAAMiO,EAAM,IAAI+S,GAAI9vH,EAAIoa,GAIxB,OAHAja,KAAKy7G,QAAQmB,GACb58G,KAAK4sD,kBAAkB,OACvB5sD,KAAKqwH,oBACEzT,EAAI/0G,KAAKoS,GACXspB,MAAKzuB,IACN9U,KAAK4sD,kBAAkB,YAAa,CAAE9E,OAAQhzC,IAC9C9U,KAAK4sD,kBAAkB,UAAW,CAAE9E,OAAQ,CAAE80D,MAAK9nG,YAC5CA,KAENwuB,OAAM7c,IACP,GAAmB,WAAfm2F,EAAIxsF,OAEJ,IAAK,IAAI7uB,EAAI,EAAGA,EAAIvB,KAAK+jC,MAAMtiC,OAAQF,IACnC,GAAIvB,KAAK+jC,MAAMxiC,KAAOq7G,EAAK,CACvB58G,KAAK+jC,MAAM74B,OAAO3J,EAAG,GACrB,KACJ,CAKR,MAFAvB,KAAK4sD,kBAAkB,QAAS,CAAE9E,OAAQrhC,IAC1CzmB,KAAK4sD,kBAAkB,UAAW,CAAE9E,OAAQ,CAAE80D,MAAKp1F,MAAOf,KACpDA,CAAG,GAEjB,CAIA,KAAAlnB,GACIS,KAAK+jC,MAAM74B,OAAO,EAAGlL,KAAK+jC,MAAMtiC,OACpC,CAIA,KAAA2lE,GACIpnE,KAAK+jC,MAAM52B,SAAQyvG,IACfA,EAAIx1C,MAAM,IAAI,GAAa,IAE/BpnE,KAAKT,OACT,CAMA,aAAM4kD,CAAQlqC,GAEQ,IAAdja,KAAKvB,YAGH2wH,GAAUpvH,KAAM,QAASia,GAASmqC,OAC5C,CAYA,oBAAM84D,CAAevuD,EAAO10C,GAEpBja,KAAKvB,KAAOkwD,SAGVygE,GAAUpvH,KAAM,OAAQia,GAASmqC,OAAQ,CAC3Cv3C,OAAQ,IAAM7M,KAAKvB,KAAOkwD,GAElC,CASA,YAAMwuD,CAAOljG,GAEY,IAAjBja,KAAKs8B,SAA+B,IAAdt8B,KAAKvB,YAGzB2wH,GAAUpvH,KAAM,OAAQia,GAASmqC,OAC3C,CAIA,QAAI3lD,GACA,OAAOuB,KAAK+jC,MAAMtiC,MACtB,CAIA,UAAIowB,GACA,OAAO7xB,KAAK+jC,MAAMtiC,OAASzB,KAAKs8B,OACpC,CAIA,WAAI8zF,GACA,OAAOpwH,KAAKs8B,OAChB,CAWA,iBAAOg0F,CAAYr2G,GACfA,GAASmqC,QAAQC,iBACjB,MAAM+B,EAAS7C,GAAS,CACpBO,YAAY,IAEV8zD,EAAWnxF,IACF,MAAPA,EACAzmB,KAAKonE,QAGLpnE,KAAKT,QAET6mD,EAAOn/C,IAAIwf,EAAI,EAEb8pG,EAAsBjwH,IACN,MAAdA,EAAIwnD,QACJ1B,EAAO5lD,KAAKF,EAAIwnD,OACpB,EAEE0oE,EAAgBlwH,IAClBs3G,EAAQt3G,EAAIwnD,OAAO,EAEjB2oE,EAAc,KAChB7Y,GAAS,EAGP8Y,EAAgB,KAClB9Y,EAAQ,IAAI,GAAW,iBAAiB,EAG5C53G,KAAKukD,iBAAiB,YAAagsE,GACnCvwH,KAAKukD,iBAAiB,QAASisE,GAC/BxwH,KAAKukD,iBAAiB,OAAQksE,GAC9Bx2G,GAASmqC,QAAQG,iBAAiB,QAASmsE,GAC3C,UACWtqE,CACX,CACA,QAEIpmD,KAAKykD,oBAAoB,YAAa8rE,GACtCvwH,KAAKykD,oBAAoB,QAAS+rE,GAClCxwH,KAAKykD,oBAAoB,OAAQgsE,GACjCx2G,GAASmqC,QAAQK,oBAAoB,QAASisE,GAE9C9Y,GACJ,CACJ,EChQG,MAAM,WAAsBoY,GAC/B,WAAA1gH,CAAYzD,EAAO,CAAC,GAChBukC,MAAM,IACCvkC,EACHuC,KAAM,CAACuS,EAAGC,IACFD,EAAE1G,QAAQ0hG,SAAW/6F,EAAE3G,QAAQ0hG,UACvB,EAERh7F,EAAE1G,QAAQ0hG,SAAW/6F,EAAE3G,QAAQ0hG,SACxB,EAEJ,GAGnB,ECXG,SAASgV,GAAUC,GACtB,MAAMf,EAAa,IAAIj4F,WAAWm7E,gBAClC,SAASH,IACLid,EAAWzoD,QACX,IAAK,MAAMhjB,KAAUwsE,EACkB,MAA/BxsE,GAAQK,qBACRL,EAAOK,oBAAoB,QAASmuD,EAGhD,CACA,IAAK,MAAMxuD,KAAUwsE,EAAS,CAC1B,IAAwB,IAApBxsE,GAAQQ,QAAkB,CAC1BguD,IACA,KACJ,CACgC,MAA5BxuD,GAAQG,kBACRH,EAAOG,iBAAiB,QAASquD,EAEzC,CAQA,MAAMxuD,EAASyrE,EAAWzrE,OAE1B,OADAA,EAAO7kD,MARP,WACI,IAAK,MAAM6kD,KAAUwsE,EACkB,MAA/BxsE,GAAQK,qBACRL,EAAOK,oBAAoB,QAASmuD,EAGhD,EAGOxuD,CACX,CCxBO,SAASysE,GAAwBlwG,EAAGC,GACvC,MAAMkwG,EAAS,GAAInnB,WAAWhpF,EAAEmmF,WAC1BiqB,EAAS,GAAIpnB,WAAW/oF,EAAEkmF,WAChC,GAAIgqB,IAAWC,EACX,OAAQ,EAEZ,IAAKD,GAAUC,EACX,OAAO,EAEX,MAAMC,EAAqB,GAAiBrnB,WAAWhpF,EAAEmmF,WACnDmqB,EAAqB,GAAiBtnB,WAAW/oF,EAAEkmF,WACzD,GAAIkqB,IAAuBC,EACvB,OAAQ,EAEZ,IAAKD,GAAsBC,EACvB,OAAO,EAEX,MAAMC,EAAe,GAAWvnB,WAAWhpF,EAAEmmF,WACvCqqB,EAAe,GAAWxnB,WAAW/oF,EAAEkmF,WAC7C,GAAIoqB,IAAiBC,EACjB,OAAQ,EAEZ,IAAKD,GAAgBC,EACjB,OAAO,EAEX,MAAMC,EAAY,GAAOznB,WAAWhpF,EAAEmmF,WAChCuqB,EAAY,GAAO1nB,WAAW/oF,EAAEkmF,WACtC,GAAIsqB,IAAcC,EACd,OAAQ,EAEZ,IAAKD,GAAaC,EACd,OAAO,EAEX,MAAMC,EAAkB,GAAa3nB,WAAWhpF,EAAEmmF,WAC5CyqB,EAAkB,GAAa5nB,WAAW/oF,EAAEkmF,WAClD,GAAIwqB,IAAoBC,EACpB,OAAQ,EAEZ,IAAKD,GAAmBC,EACpB,OAAO,EAEX,MAAMC,EAAkB,GAAa7nB,WAAWhpF,EAAEmmF,WAC5C2qB,EAAkB,GAAa9nB,WAAW/oF,EAAEkmF,WAClD,OAAI0qB,IAAoBC,GACZ,GAEPD,GAAmBC,EACb,EAGJ,CACX,CAKO,SAASC,GAAqB/wG,EAAGC,GACpC,MAAM+wG,EAAa1oB,GAAUtoF,EAAEmmF,WACzB8qB,EAAa3oB,GAAUroF,EAAEkmF,WAC/B,OAAI6qB,IAAeC,EACR,GAEDD,GAAcC,GACZ,EAEL,CACX,CAKO,SAASC,GAAwBlxG,EAAGC,GACvC,OAAID,EAAE6rF,cAAgB5rF,EAAE4rF,aACZ,GAEF7rF,EAAE6rF,aAAe5rF,EAAE4rF,YAClB,EAEJ,CACX,CAKO,SAASslB,GAA0BnxG,EAAGC,GACzC,MAAMmxG,EAAa,GAAQpoB,WAAWhpF,EAAEmmF,WAClCkrB,EAAa,GAAQroB,WAAW/oF,EAAEkmF,WACxC,OAAIirB,IAAeC,EACR,GAEDD,GAAcC,GACZ,EAEL,CACX,CC9EO,MAAMC,GACTluF,MACAwkB,WACA2pE,cACAC,mBACAC,mBACAC,YACAC,mBACA/rE,YACAn7C,IACA,WAAAkE,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKkyH,cAAgBrmH,EAAKqmH,cAC1BlyH,KAAKmyH,mBAAqBtmH,EAAKsmH,oBRtBD,GQuB9BnyH,KAAKoyH,mBAAqBvmH,EAAKumH,oBRQF,IQP7BpyH,KAAKqyH,YAAcxmH,EAAKwmH,aRpCJ,IQqCpBryH,KAAKumD,YAAc16C,EAAK06C,aAAe,IAAIonE,GAC3C3tH,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,wCAC1CzjG,KAAKuoD,WAAaA,EAClBvoD,KAAKsyH,mBAAqB,IAAIvf,gBACJ/yG,KAAKsyH,mBAAmBluE,OAClD,IAAK,MAAOrlD,EAAKC,KAAUL,OAAOwxD,QAAQtkD,EAAKupD,WAAa,CAAC,GACzDA,GAAU91D,IAAIP,EAAKC,GAGvBgB,KAAK+jC,MAAQ,IAAI,GAAc,CAC3Bu4E,YAAazwG,EAAK8sD,kBT1CI,GS2CtBs3D,WAAY,oBACZjuB,QAASz5C,EAAWy5C,UAGxBhiG,KAAK+jC,MAAMwgB,iBAAiB,SAAUpkD,IAC9BA,EAAM2nD,OAAO/mD,OAAS,GAAWA,MACjCf,KAAKoL,IAAIoc,MAAM,2BAA4BrnB,EAAM2nD,OACrD,GAER,CACA,KAAA9gD,GACIhH,KAAKsyH,mBAAqB,IAAIvf,gBACJ/yG,KAAKsyH,mBAAmBluE,MACtD,CAIA,IAAA99B,GACItmB,KAAKsyH,mBAAmBlrD,QACxBpnE,KAAK+jC,MAAMqjC,OACf,CAaA,UAAMxN,CAAK24D,EAAmBt4G,EAAU,CAAC,GACrC,MAAM,OAAEitC,EAAM,WAAEk/C,GAAewnB,GAAe2E,GAGxCC,EAAqB7wH,MAAM4c,KAAKve,KAAKumD,YAAYtjD,UAAUwvH,OAAOn5F,MAAKq+B,IACnD,IAAlB19C,EAAQy4G,UAGR/6D,EAAK5M,WAAWzc,OAAO4Y,IAGpBk/C,EAAW9sE,MAAK61B,GACZA,EAAK7gB,OAAOqpB,EAAK41C,iBAGhC,GAAmC,SAA/BilB,GAAoBpiG,OAGpB,OAFApwB,KAAKoL,IAAI,0BAA2BonH,EAAmBjlB,YACvDtzF,EAAQwgG,aAAa,IAAIf,GAAoB,iCACtC8Y,EAIX,MAAMG,EAAe3yH,KAAK+jC,MAAMA,MAAMzK,MAAKsjF,IACvC,IAA2C,IAAvC11D,GAAQ5Y,OAAOsuE,EAAI3iG,QAAQitC,QAC3B,OAAO,EAGX,MAAM6/C,EAAY6V,EAAI3iG,QAAQmsF,WAC9B,GAAiB,MAAbW,EACA,OAAO,EAEX,IAAK,MAAMD,KAAaV,EACpB,GAAIW,EAAU9nG,IAAI6nG,EAAUzgG,YACxB,OAAO,EAGf,OAAO,CAAK,IAEhB,GAAoB,MAAhBssH,EAAsB,CACtB3yH,KAAKoL,IAAI,sCAAuC87C,GAEhD,IAAK,MAAM4/C,KAAaV,EACpBusB,EAAa14G,QAAQmsF,WAAWppF,IAAI8pF,EAAUzgG,YAGlD,OADA4T,EAAQwgG,aAAa,IAAIf,GAAoB,qCACtCiZ,EAAa9qH,KAAKoS,EAC7B,CACA,GAAIja,KAAK+jC,MAAMtlC,MAAQuB,KAAKoyH,mBACxB,MAAM,IAAIjnD,GAAU,sBAIxB,OAFAnrE,KAAKoL,IAAI,8BAA+B87C,EAAQk/C,EAAW9hG,KAAI61D,GAAMA,EAAG9zD,cACxE4T,EAAQwgG,aAAa,IAAIf,GAAoB,iCACtC15G,KAAK+jC,MAAM/mB,KAAImwB,MAAOlzB,IACzBA,GAASwgG,aAAa,IAAIf,GAAoB,0BAG9C,MAAMt1D,EAASpkD,KAAK4yH,0BAA0B34G,GAASmqC,QACvD,IAAIyuE,EACJ,IAGIA,QAAoB7yH,KAAK8yH,oBAAoB5rE,EAAQjtC,GAASmsF,WAAY,IACnEnsF,EACHmqC,WAEJnqC,GAASwgG,aAAa,IAAIf,GAAoB,kCAAmCmZ,IACjFA,EAAYvuH,KAAI,EAAGwiG,eAAgBA,EAAUzgG,aAAY8G,SAAQgiD,IAC7Dl1C,GAASmsF,WAAWppF,IAAImyC,EAAK,GAErC,CACA,MAAO1oC,GAEH,MADA29B,EAAO7kD,QACDknB,CACV,CACA,IACI,IAAIssG,EAAS,EACb,MAAM5rG,EAAS,GACf,IAAK,MAAMwoC,KAAWkjE,EAAa,CAC/B,GAAIE,IAAW/yH,KAAKmyH,mBAEhB,MADAnyH,KAAKoL,IAAI,yEAA0E2nH,EAAQ7rE,GACrF,IAAIikB,GAAU,yCAExB4nD,IACA,IACI,MAAMp7D,QAAa33D,KAAKuoD,WAAWk4D,iBAAiB7mD,KAAKjK,EAAQm3C,UAAW,IACrE7sF,EACHmqC,WAEJpkD,KAAKoL,IAAI,uBAAwBukD,EAAQm3C,WAEzC,UACU9mG,KAAKuoD,WAAW2N,UAAU7yC,MAAMs0C,EAAK5M,WAAY,CACnDq7C,WAAY,CACRzuC,EAAK41C,YAETllD,SAAU,CACN,CAAC8mE,IAAwB,GAAqB3kH,KAAKu2D,MAAM16D,cAGrE,CACA,MAAOogB,GACHzmB,KAAKoL,IAAIoc,MAAM,gDAAiD0/B,EAAQzgC,EAC5E,CACA,OAAOkxC,CACX,CACA,MAAOlxC,GAEH,GADAzmB,KAAKoL,IAAIoc,MAAM,oBAAqBmoC,EAAQm3C,UAAWrgF,GACzC,MAAVygC,EAEA,UACUlnD,KAAKuoD,WAAW2N,UAAU7yC,MAAM6jC,EAAQ,CAC1CmB,SAAU,CACN,CAAC6mE,IAAwB,GAAqB1kH,KAAKu2D,MAAM16D,cAGrE,CACA,MAAOogB,GACHzmB,KAAKoL,IAAIoc,MAAM,gDAAiD0/B,EAAQzgC,EAC5E,CAGJ,GAAI29B,EAAOQ,QACP,MAAM,IAAIqmB,GAAaxkD,EAAIja,SAE/B2a,EAAO3mB,KAAKimB,EAChB,CACJ,CACA,GAAsB,IAAlBU,EAAO1lB,OACP,MAAM0lB,EAAO,GAEjB,MAAM,IAAI0yC,eAAe1yC,EAAQ,6BACrC,CACA,QAEIi9B,EAAO7kD,OACX,IACD,CACC2nD,SACAy0D,SAAU1hG,EAAQ0hG,UAAYqX,GAC9B5sB,WAAY,IAAI9qD,IAAI8qD,EAAW9hG,KAAI61D,GAAMA,EAAG9zD,cAC5C+9C,OAAQnqC,EAAQmqC,OAChBq2D,WAAYxgG,EAAQwgG,YAE5B,CACA,yBAAAmY,CAA0BK,GAStB,OAPetC,GAAU,CACrBtkB,YAAYzlF,QAAQ5mB,KAAKqyH,aACzBryH,KAAKsyH,mBAAmBluE,OACxB6uE,GAKR,CAEA,yBAAMH,CAAoB5rE,EAAQk/C,EAAa,IAAI9qD,IAAOrhC,EAAU,CAAC,GACjE,MAAMgvG,EAAQ,IAAI7iB,GAAY9hG,KAAI61D,IAAM,CACpC2sC,UAAW,GAAU3sC,GACrBqyC,aAAa,MAGjB,GAAc,MAAVtlD,EAAgB,CAChB,GAAIlnD,KAAKuoD,WAAWrB,OAAO5Y,OAAO4Y,GAC9B,MAAM,IAAIikB,GAAU,sBAExB,IAAuE,UAA5DnrE,KAAKuoD,WAAWykE,gBAAgBE,eAAehmE,IACtD,MAAM,IAAI0kE,GAAgB,sDAI9B,GAAqB,IAAjB3C,EAAMxnH,OAAc,CACpBzB,KAAKoL,IAAI,4BAA6B87C,GACtC,IACI,MAAMW,QAAa7nD,KAAKuoD,WAAW2N,UAAU92D,IAAI8nD,GACjD+hE,EAAMzoH,QAAQqnD,EAAKk/C,WACnB/mG,KAAKoL,IAAI,2BAA4B87C,EAAQ+hE,EAAM3kH,KAAI,EAAGwiG,eAAgBA,EAAUzgG,aACxF,CACA,MAAOogB,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACJ,CAGA,GAAqB,IAAjBwiG,EAAMxnH,OAAc,CACpBzB,KAAKoL,IAAI,mDAAoD87C,GAC7D,IACI,MAAMgS,QAAiBl5D,KAAKuoD,WAAW2qE,YAAYC,SAASjsE,GAC5DlnD,KAAKoL,IAAI,8CAA+C87C,EAAQ+hE,EAAM3kH,KAAI,EAAGwiG,eAAgBA,EAAUzgG,cACvG4iH,EAAMzoH,QAAQ04D,EAASktC,WAAW9hG,KAAIwiG,IAAa,CAC/CA,YACA0F,aAAa,MAErB,CACA,MAAO/lF,GACc,uBAAbA,EAAI1lB,MACJf,KAAKoL,IAAIoc,MAAM,0DAA2D0/B,EAAQzgC,EAE1F,CACJ,CACJ,CAGA,IAAI2sG,SAA2B72F,QAAQgpB,IAAI0jE,EAAM3kH,KAAI6oC,MAAOgiB,IACxD,MAAMr6C,QC9RXq4B,eAAiCgtB,EAAIlgD,GAExC,IAAI24C,GAAa,EACjB,IAAK,MAAM7zD,KAAOq2D,GAAUlwD,OAExB,GADA0tD,EAAauH,EAAG1F,aAAazpC,SAASjsB,GAClC6zD,EACA,MAIR,IAAKA,EACD,MAAO,CAACuH,GAEZ,MAAMxb,QAAewb,EAAGj2D,QAAQ+V,GAEhC,OADAA,EAAQ7O,IAAI,iBAAkB+uD,EAAIxb,EAAOr6C,KAAI61D,GAAMA,EAAG9zD,cAC/Cs4C,CACX,CD8QiC00E,CAAkBlkE,EAAK23C,UAAW,CACnDmQ,IAAKj3G,KAAKuoD,WAAW0uD,OAClBh9F,EACH7O,IAAKpL,KAAKoL,MAEd,OAAsB,IAAlB0J,EAAOrT,QAAgBqT,EAAO,GAAGw5B,OAAO6gB,EAAK23C,WACtC33C,EAEJr6C,EAAOxQ,KAAIwiG,IAAa,CAC3BA,YACA0F,aAAa,KACd,MAEFimB,OAEL,GAAc,MAAVvrE,EAAgB,CAChB,MAAMosE,EAAkB,QAAQpsE,EAAO7gD,aACvC+sH,EAAoBA,EAAkB9uH,KAAI6qD,IACtC,MAAMokE,EAAYpkE,EAAK23C,UAAUvyC,SAAS/2B,MAE1C,OAAwB,IAApB+1F,GAAWvzG,KACJmvC,EAGuB,MAA9BA,EAAK23C,UAAUhyC,YACR,CACHgyC,UAAW33C,EAAK23C,UAAUpyC,YAAY4+D,GACtC9mB,YAAar9C,EAAKq9C,aAGnBr9C,CAAI,GAEnB,CACA,MAAMqkE,EAAgBJ,EAAkBvmH,QAAOsiD,IAE3C,GAAkF,MAA9EnvD,KAAKuoD,WAAWk4D,iBAAiBgT,0BAA0BtkE,EAAK23C,WAChE,OAAO,EAKX,MAAM4sB,EAAavkE,EAAK23C,UAAUhyC,YAClC,OAAc,MAAV5N,GAAgC,MAAdwsE,GACXxsE,EAAO5Y,OAAOolF,EAEd,IAGTC,EAAe,IAAI9lF,IACzB,IAAK,MAAMshB,KAAQqkE,EAAe,CAC9B,MAAM/M,EAAQt3D,EAAK23C,UAAUzgG,WACvB6pG,EAAWyjB,EAAav0H,IAAIqnH,GAClB,MAAZvW,EAIJyjB,EAAar0H,IAAImnH,EAAOt3D,GAHpB+gD,EAAS1D,YAAc0D,EAAS1D,aAAer9C,EAAKq9C,cAAe,CAI3E,CACA,MAAMonB,EAAoB,IAAID,EAAa1wH,UAE3C,GAAiC,IAA7B2wH,EAAkBnyH,OAClB,MAAM,IAAIoqH,GAAsB,2CAEpC,MAAMgI,EAAY,GAClB,IAAK,MAAM1kE,KAAQykE,EAC0C,MAArD5zH,KAAKuoD,WAAWykE,gBAAgBG,yBAAmCntH,KAAKuoD,WAAWykE,gBAAgBG,kBAAkBh+D,EAAK23C,YAG9H+sB,EAAUrzH,KAAK2uD,GAEnB,MAAM2kE,EAAyC,MAAtB9zH,KAAKkyH,cAA6C2B,ED9P1EzlH,KAAKyiH,IACLziH,KAAKyjH,IACLzjH,KAAK0jH,IACL1jH,KAAKsjH,IC2PkFmC,EAAUzlH,KAAKpO,KAAKkyH,eAE5G,GAAgC,IAA5B4B,EAAiBryH,OACjB,MAAM,IAAImqH,GAAgB,iEAI9B,OAFA5rH,KAAKoL,IAAIm4F,MAAM,oCAAqCr8C,GAAU,eAAgBksE,EAAkB9uH,KAAI,EAAGwiG,eAAgBA,EAAUzgG,cACjIrG,KAAKoL,IAAIm4F,MAAM,mCAAoCr8C,GAAU,eAAgB4sE,EAAiBxvH,KAAI,EAAGwiG,eAAgBA,EAAUzgG,cACxHytH,CACX,CACA,gBAAMC,CAAWjtB,EAAW7sF,EAAU,CAAC,GAC9BtY,MAAM2Q,QAAQw0F,KACfA,EAAY,CAACA,IAEjB,IACI,MAAMC,QAAkB/mG,KAAK8yH,yBAAoB5zH,EAAW,IAAIo8C,IAAIwrD,EAAUxiG,KAAI61D,GAAMA,EAAG9zD,cAAc4T,GACzG,OAAuC,IAAnCA,EAAQ0xF,wBAIF,MAFC5E,EAAUztE,MAAK61B,IACV,GAAQ22C,QAAQ32C,EAAK23C,YAIzC,CACA,MAAOrgF,GACHzmB,KAAKoL,IAAIm4F,MAAM,kDAAmD98E,EACtE,CACA,OAAO,CACX,EE3XG,MAAMutG,GAAa,aCJnB,MAAMC,WAAkBjE,GAC3B,GAAA/wH,CAAIioD,GACA,OAA4B,MAArBlnD,KAAKs5B,KAAK4tB,EACrB,CACA,IAAA5tB,CAAK4tB,GACD,OAAOlnD,KAAK+jC,MAAMzK,MAAKsjF,GACZ11D,EAAO5Y,OAAOsuE,EAAI3iG,QAAQitC,SAEzC,mCCZJ,MAAMgtE,GAAiBv1H,OAAOa,UAAU6G,SAIlC8tH,GAAgB,IAAI74E,IAAI,CAC7B,gBACA,kBACA,kDACA,iDACA,cACA,yBACA,eACA,eCTM,MAAM,WAAmB98C,MAC/B,WAAA8Q,CAAY9C,GACX4jC,QAEI5jC,aAAmBhO,OACtBwB,KAAKo0H,cAAgB5nH,IACnBA,WAAWA,KAEbxM,KAAKo0H,cAAgB,IAAI51H,MAAMgO,GAC/BxM,KAAKo0H,cAAc3tH,MAAQzG,KAAKyG,OAGjCzG,KAAKe,KAAO,aACZf,KAAKwM,QAAUA,CAChB,EAGD,MAAM6nH,GAA0B,CAAC7sG,EAAO8sG,EAAer6G,KAEtD,MAAMs6G,EAAct6G,EAAQ4iB,SAAWy3F,EAAgB,GAIvD,OAFA9sG,EAAM8sG,cAAgBA,EACtB9sG,EAAM+sG,YAAcA,EACb/sG,CAAK,EClBN,MAAMgtG,GACTppH,IACA24B,MACAunE,QACAp1C,UACAr5B,QACA43F,cACAC,cACA/rE,kBACA7nD,OACA,WAAAwO,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,0BAC1CzjG,KAAKk2D,UAAY3N,EAAW2N,UAC5Bl2D,KAAK2oD,kBAAoBJ,EAAWI,kBACpC3oD,KAAK+jC,MAAQ,IAAIkwF,GAAU,CACvB3X,YAAazwG,EAAK8oH,uBdIS,EcH3B1E,WAAY,yBACZjuB,QAASz5C,EAAWy5C,UAExBhiG,KAAKsrG,SAAU,EACftrG,KAAK68B,QAAUhxB,EAAKgxB,SAAW,EAC/B78B,KAAK00H,cAAgB7oH,EAAK6oH,cAC1B10H,KAAKy0H,cAAgB5oH,EAAK4oH,cAC1Bz0H,KAAKc,OAASynD,EAAWznD,OACzBynD,EAAWznD,OAAOyjD,iBAAiB,mBAAoBjkD,IACnDN,KAAK40H,eAAet0H,EAAIwnD,QACnBxkB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,uCAAwClnB,EAAIwnD,OAAQrhC,EAAI,GACzE,GAEV,CACA,oBAAMmuG,CAAe1tE,GACjB,IAAKlnD,KAAKsrG,QACN,OAEJ,MAAMzjD,QAAa7nD,KAAKk2D,UAAU92D,IAAI8nD,GACjC2tE,GAAgBhtE,KAGjB7nD,KAAK+jC,MAAM9kC,IAAIioD,IAGnBlnD,KAAK+jC,MAAM/mB,KAAImwB,MAAOlzB,UDrBfkzB,eAAsBpX,EAAO9b,GAC3C,OAAO,IAAIsiB,SAAQ,CAACr4B,EAASs4B,KAC5BviB,EAAU,IAAIA,GACdA,EAAQ66G,kBAAoB,OAC5B76G,EAAQ86G,cAAgB,KAAM,EAC9B96G,EAAQ4iB,UAAY,GAEpB,MAAMD,EAAYpW,GAAMoW,UAAU3iB,GAE5BmhG,EAAe,KACpBx+E,EAAUtW,OACVkW,EAAOviB,EAAQmqC,QAAQ0b,OAAO,EAG3B7lD,EAAQmqC,SAAWnqC,EAAQmqC,OAAOQ,SACrC3qC,EAAQmqC,OAAOG,iBAAiB,QAAS62D,EAAc,CAACr7G,MAAM,IAG/D,MAAM+4G,EAAU,KACf7+F,EAAQmqC,QAAQK,oBAAoB,QAAS22D,GAC7Cx+E,EAAUtW,MAAM,EAGjBsW,EAAU7V,SAAQomB,UACjB,IACC,MAAMr4B,QAAeihB,EAAMu+F,GAC3Bxb,IACA50G,EAAQ4Q,EACT,CAAE,MAAO0S,GACR,IACC,KAAMA,aAAiBhpB,OACtB,MAAM,IAAI4B,UAAU,0BAA0BonB,qCAG/C,GAAIA,aAAiB,GACpB,MAAMA,EAAM4sG,cAGb,GAAI5sG,aAAiBpnB,YDpDX,SAAwBonB,GAbvBxoB,MAmBf,SALgBwoB,IAdDxoB,EAeHwoB,EAf2C,mBAA/B0sG,GAAejzH,KAAKjC,KAgBzB,cAAfwoB,EAAMzmB,MACmB,iBAAlBymB,EAAMhb,WAQK,gBAAlBgb,EAAMhb,aACctN,IAAhBsoB,EAAM/gB,MAGP0tH,GAAcl1H,IAAIuoB,EAAMhb,SAChC,CCmCwCwoH,CAAextG,GACjD,MAAMA,EAYP,GATA6sG,GAAwB7sG,EAAO8sG,EAAer6G,SAElCA,EAAQ86G,YAAYvtG,KAC/BoV,EAAUtW,OACVkW,EAAOhV,UAGFvN,EAAQ66G,gBAAgBttG,IAEzBoV,EAAUpW,MAAMgB,GACpB,MAAMoV,EAAUvV,WAElB,CAAE,MAAO4tG,GACRZ,GAAwBY,EAAYX,EAAer6G,GACnD6+F,IACAt8E,EAAOy4F,EACR,CACD,IACC,GAEJ,CCxCkBC,EAAO/nF,MAAOpmB,IAChB,GAAK/mB,KAAKsrG,QAGV,UACUtrG,KAAK2oD,kBAAkB89C,eAAev/C,EAAQ,CAChD9C,OAAQnqC,GAASmqC,QAEzB,CACA,MAAO39B,GAEH,MADAzmB,KAAKoL,IAAI,kDAAmD87C,EAAQngC,EAAS/mB,KAAK68B,QAASpW,GACrFA,CACV,IACD,CACC29B,OAAQnqC,GAASmqC,OACjBvnB,QAAS78B,KAAK68B,QACdE,OAAQ/8B,KAAK00H,cACb13F,WAAYh9B,KAAKy0H,eACnB,GACH,CACCvtE,WAEC5jB,OAAM6J,MAAO1mB,IACdzmB,KAAKoL,IAAIoc,MAAM,iCAAkC0/B,EAAQzgC,GACzD,MAAMyxC,EAAO,CAAC,EACd,IAAIrQ,EAAKqQ,KAAKhzD,QAAQiI,SAAQpO,IACtBA,EAAIwtB,WAAWynG,MACf97D,EAAKn5D,QAAOG,EAChB,UAEEc,KAAKk2D,UAAU7yC,MAAM6jC,EAAQ,CAC/BgR,SAEJl4D,KAAKc,OAAO8rD,kBAAkB,yBAA0B,CACpD9E,OAAQZ,GACV,IAED5jB,OAAM6J,MAAO1mB,IACdzmB,KAAKoL,IAAIoc,MAAM,+CAAgD0/B,EAAQzgC,EAAI,IAEnF,CACA,KAAAzf,GACIhH,KAAKsrG,SAAU,CACnB,CACA,gBAAMkhB,GAEGjwF,QAAQr4B,UACRq/B,MAAK4J,UACN,MAAMgoF,QAAuBn1H,KAAKk2D,UAAU3Q,IAAI,CAC5C+iE,QAAS,CACJzgE,GAASgtE,GAAgBhtE,YAG5BtrB,QAAQgpB,IAAI4vE,EAAe7wH,KAAI6oC,MAAO0a,UAClC7nD,KAAK2oD,kBAAkB89C,eAAe5+C,EAAKn3C,IAC5C4yB,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GACrB,IACH,IAEF6c,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GAE3B,CACA,IAAAH,GACItmB,KAAKsrG,SAAU,EACftrG,KAAK+jC,MAAMqjC,OACf,EAEJ,SAASytD,GAAgBhtE,GACrB,IAAK,MAAM/U,KAAO+U,EAAKqQ,KAAKhzD,OACxB,GAAI4tC,EAAIvmB,WAAWynG,IACf,OAAO,EAGf,OAAO,CACX,CCpHO,MAAMhB,GAAwB,GAS9B,MAAMoC,GACT9pB,QACA/kD,YACA0nE,MACAoH,KACAC,8BACAC,2BACAC,2BACAxH,eACAyH,UACAC,eACAC,iBACAC,6BACA1/D,UACA8rC,QACAlhG,OACAsK,IACA87C,OACA,WAAA53C,CAAYi5C,EAAY18C,EAAO,CAAC,GAE5B,GADA7L,KAAKguH,eAAiBniH,EAAKmiH,gBhBnCJ,IgBoCnBhuH,KAAKguH,eAAiB,EACtB,MAAM,IAAI,GAAuB,4DAKrChuH,KAAKumD,YAAc,IAAIonE,GACvB3tH,KAAKsrG,SAAU,EACftrG,KAAKknD,OAASqB,EAAWrB,OACzBlnD,KAAKk2D,UAAY3N,EAAW2N,UAC5Bl2D,KAAKgiG,QAAUz5C,EAAWy5C,QAC1BhiG,KAAKc,OAASynD,EAAWznD,OACzBd,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,6BAC1CzjG,KAAK61H,UAAY71H,KAAK61H,UAAUz5F,KAAKp8B,MACrCA,KAAK81H,aAAe91H,KAAK81H,aAAa15F,KAAKp8B,MAE3CA,KAAKiuH,OAASpiH,EAAKoiH,OAAS,IAAI3pH,KAAI61D,GAAM,GAAUA,KACpDn6D,KAAKq1H,MAAQxpH,EAAKwpH,MAAQ,IAAI/wH,KAAI61D,GAAM,GAAUA,KAClDn6D,KAAKu1H,2BAA6B,EAClCv1H,KAAKs1H,8BAAgCzpH,EAAKypH,+BfpCF,GeqCxCt1H,KAAKw1H,2BAA6B,EAElCx1H,KAAK41H,6BAA+B,IAAIhnB,GAAY,CAChDn0B,OAAQ5uE,EAAKkqH,4Bf5CmB,Ee6ChCjnB,SAAU,IAGd9uG,KAAK21H,iBAAmB,IAAIzH,GAAiB,CACzCvlE,kBAAmB3oD,KACnBk2D,UAAW3N,EAAW2N,UACtBp1D,OAAQynD,EAAWznD,OACnB68C,OAAQ4K,EAAW5K,QACpB,CACCqwE,eAAgBhuH,KAAKguH,eACrBC,MAAOjuH,KAAKiuH,QAEhBjuH,KAAKy1H,UAAY,IAAIxD,GAAU1pE,EAAY,CACvC2pE,cAAermH,EAAKqmH,cACpBv5D,iBAAkB9sD,EAAK8sD,kBhBtED,GgBuEtBy5D,mBAAoBvmH,EAAKumH,oBfjCA,IekCzBD,mBAAoBtmH,EAAKsmH,oBfjEC,GekE1BE,YAAaxmH,EAAKwmH,af9EF,Ie+EhBj9D,UAAWvpD,EAAKupD,WAAa,CACzB2hD,QAASkJ,IAEb15D,YAAavmD,KAAKumD,cAEtBvmD,KAAK01H,eAAiB,IAAIlB,GAAe,CACrC1zH,OAAQynD,EAAWznD,OACnBo1D,UAAW3N,EAAW2N,UACtBvY,OAAQ4K,EAAW5K,OACnBgL,kBAAmB3oD,MACpB,CACC68B,QAAShxB,EAAKmqH,iBACdvB,cAAe5oH,EAAKoqH,uBACpBvB,cAAe7oH,EAAKqqH,uBACpBvB,sBAAuB9oH,EAAK8oH,uBAEpC,CACA,CAAClxF,OAAOqB,aAAe,6BAKvB,WAAM99B,GAEFhH,KAAKgiG,SAASkuB,oBAAoB,wCAAyC,CACvEC,UAAW,KACP,MAAMgG,EAAS,CACXC,QAAS,EACT,kBAAmBp2H,KAAKu1H,2BACxBc,SAAU,EACV,mBAAoBr2H,KAAKw1H,4BAE7B,IAAK,MAAMc,KAASt2H,KAAKumD,YAAYtjD,SACjC,IAAK,MAAM00D,KAAQ2+D,EACfH,EAAOx+D,EAAKu6C,aAGpB,OAAOikB,CAAM,IAIrBn2H,KAAKgiG,SAASkuB,oBAAoB,gCAAiC,CAC/DpW,MAAO,WACPqW,UAAW,KACP,MAAMgG,EAAS,CAAC,EAChB,IAAK,MAAMG,KAASt2H,KAAKumD,YAAYtjD,SACjC,IAAK,MAAM00D,KAAQ2+D,EACf,IAAK,MAAMlwE,KAAUuR,EAAK1P,QAAS,CAC/B,MAAMlpD,EAAM,GAAGqnD,EAAO8rD,aAAa9rD,EAAO8B,UAAY,iBACtDiuE,EAAOp3H,IAAQo3H,EAAOp3H,IAAQ,GAAK,CACvC,CAGR,OAAOo3H,CAAM,IAIrBn2H,KAAKgiG,SAASkuB,oBAAoB,4EAA6E,CAC3GpW,MAAO,WACPqW,UAAW,KACP,MAAMoG,EAAa,CAAC,EACpB,IAAK,MAAMD,KAASt2H,KAAKumD,YAAYtjD,SACjC,IAAK,MAAM00D,KAAQ2+D,EAAO,CACtB,MAAMruE,EAAU,CAAC,EACjB,IAAK,MAAM7B,KAAUuR,EAAK1P,QAAS,CAC/B,MAAMlpD,EAAM,GAAGqnD,EAAO8rD,aAAa9rD,EAAO8B,UAAY,iBACtDD,EAAQlpD,IAAQkpD,EAAQlpD,IAAQ,GAAK,CACzC,CACA,IAAK,MAAOmpD,EAAUzgC,KAAU9oB,OAAOwxD,QAAQlI,GAC3CsuE,EAAWruE,GAAYquE,EAAWruE,IAAa,GAC/CquE,EAAWruE,GAAU1nD,KAAKinB,EAElC,CAEJ,MAAM0uG,EAAS,CAAC,EAChB,IAAK,IAAKjuE,EAAU5gC,KAAW3oB,OAAOwxD,QAAQomE,GAAa,CACvDjvG,EAASA,EAAOlZ,MAAK,CAACuS,EAAGC,IAAMD,EAAIC,IACnC,MAAM/V,EAAQ5B,KAAK6a,MAAsB,GAAhBwD,EAAO7lB,QAChC00H,EAAOjuE,GAAY5gC,EAAOzc,EAC9B,CACA,OAAOsrH,CAAM,IAGrBn2H,KAAKc,OAAOyjD,iBAAiB,kBAAmBvkD,KAAK61H,WACrD71H,KAAKc,OAAOyjD,iBAAiB,mBAAoBvkD,KAAK81H,oBxBnKvD3oF,kBAAwBqpF,GAC3B,MAAMC,EAAa,GACnB,IAAK,MAAMlkH,KAAOikH,EACVpL,GAAY74G,IACZkkH,EAAWj2H,KAAK+R,SAGlBgqB,QAAQgpB,IAAIkxE,EAAWnyH,KAAI6oC,MAAOpqC,IACf,MAAjBA,EAAEwpH,mBACIxpH,EAAEwpH,aACZ,WAEEhwF,QAAQgpB,IAAIkxE,EAAWnyH,KAAI6oC,MAAOpqC,UAC9BA,EAAEiE,OAAO,WAEbu1B,QAAQgpB,IAAIkxE,EAAWnyH,KAAI6oC,MAAOpqC,IAChB,MAAhBA,EAAEypH,kBACIzpH,EAAEypH,YACZ,IAER,CwBgJcxlH,CAAMhH,KAAKy1H,UAAWz1H,KAAK01H,eAAgB11H,KAAK21H,kBACtD31H,KAAKsrG,SAAU,EACftrG,KAAKoL,IAAI,UACb,CAIA,UAAMkb,GACFtmB,KAAKc,OAAO2jD,oBAAoB,kBAAmBzkD,KAAK61H,WACxD71H,KAAKc,OAAO2jD,oBAAoB,mBAAoBzkD,KAAK81H,oBxBxJ1D3oF,kBAAuBqpF,GAC1B,MAAMC,EAAa,GACnB,IAAK,MAAMlkH,KAAOikH,EACVpL,GAAY74G,IACZkkH,EAAWj2H,KAAK+R,SAGlBgqB,QAAQgpB,IAAIkxE,EAAWnyH,KAAI6oC,MAAOpqC,IAChB,MAAhBA,EAAE0pH,kBACI1pH,EAAE0pH,YACZ,WAEElwF,QAAQgpB,IAAIkxE,EAAWnyH,KAAI6oC,MAAOpqC,UAC9BA,EAAEujB,MAAM,WAEZiW,QAAQgpB,IAAIkxE,EAAWnyH,KAAI6oC,MAAOpqC,IACjB,MAAfA,EAAE2pH,iBACI3pH,EAAE2pH,WACZ,IAER,CwBqIcpmG,CAAKtmB,KAAK01H,eAAgB11H,KAAKy1H,UAAWz1H,KAAK21H,kBAErD,MAAMe,EAAQ,GACd,IAAK,MAAMC,KAAkB32H,KAAKumD,YAAYtjD,SAC1C,IAAK,MAAMwkD,KAAckvE,EACrBD,EAAMl2H,KAAK,WACP,UACUinD,EAAW6kD,OACrB,CACA,MAAO7lF,GACHzmB,KAAKoL,IAAIoc,MAAMf,EACnB,CACH,EAPU,IAUnBzmB,KAAKoL,IAAI,yBAA0BsrH,EAAMj1H,cACnC86B,QAAQgpB,IAAImxE,GAClB12H,KAAKumD,YAAYhnD,QACjBS,KAAKoL,IAAI,UACb,CACA,SAAAyqH,CAAUv1H,GACDN,KAAK42H,WAAWt2H,GAAKgjC,OAAM7c,IAC5BzmB,KAAKoL,IAAIoc,MAAMf,EAAI,GAE3B,CAIA,gBAAMmwG,CAAWt2H,GACb,MAAQwnD,OAAQL,GAAennD,EAC/B,IAAKN,KAAKsrG,QAGN,kBADM7jD,EAAW6kD,QAGrB,GAA0B,SAAtB7kD,EAAWr3B,OAGX,OAEJ,MAAM82B,EAASO,EAAWsD,WACpB8rE,GAAa72H,KAAKumD,YAAYtnD,IAAIioD,GAClC4vE,EAAc92H,KAAKumD,YAAYnnD,IAAI8nD,IAAW,GACpD4vE,EAAYt2H,KAAKinD,GACjBznD,KAAKumD,YAAYjnD,IAAI4nD,EAAQ4vE,GAEL,MAApB5vE,EAAOylB,WAAqC,QAAhBzlB,EAAO/hD,YAC7BnF,KAAKk2D,UAAU62C,MAAM7lD,EAAQ,CAC/BylB,UAAWzlB,EAAOylB,YAGtBkqD,GACA72H,KAAKc,OAAO8rD,kBAAkB,eAAgB,CAAE9E,OAAQL,EAAWsD,YAE3E,CAIA,YAAA+qE,CAAax1H,GACT,MAAQwnD,OAAQL,GAAennD,EACzB4mD,EAASO,EAAWsD,WAGpBgsE,GAFY/2H,KAAKumD,YAAYnnD,IAAI8nD,IAAW,IAEdr6C,QAAO8qD,GAAQA,EAAKjnD,KAAO+2C,EAAW/2C,KAE1E1Q,KAAKumD,YAAYjnD,IAAI4nD,EAAQ6vE,GACI,IAA7BA,EAAkBt1H,SAElBzB,KAAKoL,IAAI,kDAAmD87C,GAC5DlnD,KAAKumD,YAAYc,OAAOH,GAExBlnD,KAAKc,OAAO8rD,kBAAkB,kBAAmB,CAAE9E,OAAQL,EAAWsD,aAE9E,CACA,cAAAlE,CAAeK,GACX,GAAc,MAAVA,EACA,OAAOlnD,KAAKumD,YAAYnnD,IAAI8nD,IAAW,GAE3C,IAAIovE,EAAQ,GACZ,IAAK,MAAMnvH,KAAKnH,KAAKumD,YAAYtjD,SAC7BqzH,EAAQA,EAAMl1H,OAAO+F,GAEzB,OAAOmvH,CACX,CACA,iBAAAU,GACI,OAAOh3H,KAAKumD,WAChB,CACA,oBAAMkgD,CAAe8rB,EAAmBt4G,EAAU,CAAC,GAC/C,IAAKja,KAAKsrG,QACN,MAAM,IAAIpgC,GAAgB,eAE9BlrE,KAAKw1H,6BACL,IACIv7G,EAAQmqC,QAAQC,iBAChB,MAAM,OAAE6C,GAAW0mE,GAAe2E,GAClC,GAAIvyH,KAAKknD,OAAO5Y,OAAO4Y,GACnB,MAAM,IAAIyjB,GAAmB,qBAEjC,GAAc,MAAVzjB,IAAoC,IAAlBjtC,EAAQy4G,MAAgB,CAC1C1yH,KAAKoL,IAAI,UAAW87C,GACpB,MAAMsrE,EAAqBxyH,KAAK6mD,eAAeK,GAC1C5tB,MAAKq+B,GAAuB,MAAfA,EAAKvkB,SACvB,GAA0B,MAAtBo/E,EAGA,OAFAxyH,KAAKoL,IAAI,+CAAgD87C,GACzDjtC,EAAQwgG,aAAa,IAAIf,GAAoB,iCACtC8Y,CAEf,CACA,MAAM/qE,QAAmBznD,KAAKy1H,UAAU77D,KAAK24D,EAAmB,IACzDt4G,EACH0hG,SAAU1hG,EAAQ0hG,UAAYqX,KAElC,GAA0B,SAAtBvrE,EAAWr3B,OACX,MAAM,IAAIi6C,GAAsB,2CAEpC,IAAI4sD,EAAkBj3H,KAAKumD,YAAYnnD,IAAIqoD,EAAWsD,YAC/B,MAAnBksE,IACAA,EAAkB,GAClBj3H,KAAKumD,YAAYjnD,IAAImoD,EAAWsD,WAAYksE,IAKhD,IAAIC,GAAoB,EACxB,IAAK,MAAMv/D,KAAQs/D,EAKf,GAJIt/D,EAAKjnD,KAAO+2C,EAAW/2C,KACvBwmH,GAAoB,IAGF,IAAlBj9G,EAAQy4G,OAAkB/6D,EAAKjnD,KAAO+2C,EAAW/2C,IAAMinD,EAAK41C,WAAWj/D,OAAOmZ,EAAW8lD,YAGzF,OAFA9lD,EAAW2f,MAAM,IAAIwD,GAAsB,mCAEpCjT,EAMf,OAHKu/D,GACDD,EAAgBz2H,KAAKinD,GAElBA,CACX,CACA,QACIznD,KAAKw1H,4BACT,CACJ,CACA,sBAAM2B,CAAiBjwE,EAAQjtC,EAAU,CAAC,GACtC,MAAMssC,EAAcvmD,KAAKumD,YAAYnnD,IAAI8nD,IAAW,SAC9C3qB,QAAQgpB,IAAIgB,EAAYjiD,KAAI6oC,MAAOsa,IACrC,UACUA,EAAW6kD,MAAMryF,EAC3B,CACA,MAAOwM,GACHghC,EAAW2f,MAAM3gD,EACrB,KAER,CACA,8BAAM2wG,CAAyBrd,GAK3B,GAHuB/5G,KAAKq1H,KAAKr6D,MAAKb,GAC3B4/C,EAAOxM,WAAWlnG,WAAWkmB,WAAW4tC,EAAG9zD,cAIlD,OADArG,KAAKoL,IAAI,0EAA2E2uG,EAAOxM,aACpF,EAMX,GAHwBvtG,KAAKiuH,MAAMjzD,MAAKb,GAC7B4/C,EAAOxM,WAAWlnG,WAAWkmB,WAAW4tC,EAAG9zD,cAIlD,OADArG,KAAKu1H,8BACE,EAGX,GAAIv1H,KAAKu1H,6BAA+Bv1H,KAAKs1H,8BAEzC,OADAt1H,KAAKoL,IAAI,2EAA4E2uG,EAAOxM,aACrF,EAEX,GAAIwM,EAAOxM,WAAWj4C,qBAAsB,CACxC,MAAMvB,EAAOgmD,EAAOxM,WAAWl4C,cAAc1F,QAC7C,UACU3vD,KAAK41H,6BAA6Br2E,QAAQwU,EAAM,EAC1D,CACA,MAEI,OADA/zD,KAAKoL,IAAI,8EAA+E2uG,EAAOxM,WAAYx5C,IACpG,CACX,CACJ,CACA,OAAI/zD,KAAK6mD,iBAAiBplD,OAASzB,KAAKguH,gBACpChuH,KAAKu1H,8BACE,IAEXv1H,KAAKoL,IAAI,uDAAwD2uG,EAAOxM,aACjE,EACX,CACA,mBAAA8pB,GACIr3H,KAAKu1H,4BACT,CACA,YAAA+B,GACI,MAAMC,EAAY,CACd1lG,OAAQ,SACRu+F,QAAS,SACToH,QAAS,QACTC,SAAU,WAEd,OAAOz3H,KAAKy1H,UAAU1xF,MAAMA,MAAMz/B,KAAIs4G,IAC3B,CACHlsG,GAAIksG,EAAIlsG,GACR0f,OAAQmnG,EAAU3a,EAAIxsF,QACtB82B,OAAQ01D,EAAI3iG,QAAQitC,OACpBk/C,WAAY,IAAIwW,EAAI3iG,QAAQmsF,YAAY9hG,KAAI61D,GAAM,GAAUA,QAGxE,CACA,gBAAM45D,CAAWjtB,EAAW7sF,EAAU,CAAC,GACnC,OAAOja,KAAKy1H,UAAU1B,WAAWjtB,EAAW7sF,EAChD,EClYG,MAAMy9G,GACTC,cACAC,SACAC,UACAC,SACAC,SACAC,aACA,WAAA1oH,CAAYyoH,GACR/3H,KAAK+3H,SAAWA,EAChB/3H,KAAK23H,cAAgB,EACrB33H,KAAK43H,SAAW,EAChB53H,KAAK63H,UAAY,EACjB73H,KAAK83H,SAAW,CACpB,CACA,KAAAG,CAAM96G,EAAG+6G,GACL,OAAO,EAAKjvH,KAAKkvH,MAAMh7G,EAAI+6G,GAAMl4H,KAAK+3H,SAC1C,CACA,IAAAv3H,CAAKxB,EAAOo5H,EAAO5tH,KAAKu2D,OACpB,GAAyB,MAArB/gE,KAAKg4H,aAAsB,CAE3B,MAAMr3G,EAAI3gB,KAAKi4H,MAAMG,EAAMp4H,KAAKg4H,cAC1BttH,EAAO1L,EAAQgB,KAAK23H,cACpBU,EAAO13G,EAAIjW,EACjB1K,KAAK23H,cAAgBh3G,EAAI3hB,GAAS,EAAI2hB,GAAK3gB,KAAK23H,cAEhD33H,KAAK43H,UAAY,EAAIj3G,IAAM3gB,KAAK43H,SAAWltH,EAAO2tH,GAClDr4H,KAAK63H,UAAY5uH,KAAKkuE,KAAKn3E,KAAK43H,UAEhC53H,KAAK83H,SAAW93H,KAAK23H,cAAgBh3G,EAAIjW,CAC7C,MAEI1K,KAAK23H,cAAgB34H,EAEzBgB,KAAKg4H,aAAeI,CACxB,EClCG,MAAME,GACTluE,QACAC,QACAhiD,KACA8tH,OACAoC,kBACAC,kBACAx7F,WACA,WAAA1tB,CAAYzD,EAAO,CAAC,GAChB7L,KAAKoqD,QAAU,IAAIstE,GAAc7rH,EAAKkqD,UAAY,KAClD/1D,KAAKqqD,QAAU,IAAIqtE,GAAc7rH,EAAKkqD,UAAY,KAClD/1D,KAAKqI,KAAO,IAAIqvH,GAAc7rH,EAAKkqD,UAAY,KAC/C/1D,KAAKw4H,kBAAoB3sH,EAAK2sH,mBAdI,EAelCx4H,KAAKu4H,kBAAoB1sH,EAAK0sH,mBAhBI,IAiBlCv4H,KAAKg9B,WAAanxB,EAAKmxB,YAfI,IAgBJ,MAAnBnxB,EAAKokH,aACLjwH,KAAKm2H,OAAStqH,EAAKm2F,SAASkuB,oBAAoBrkH,EAAKokH,YAE7D,CACA,gBAAAwI,CAAiBx+G,EAAU,CAAC,GAGxB,MAAM2M,EAAU3d,KAAK1K,IAAI0K,KAAKuuB,MAAMx3B,KAAKqI,KAAKsvH,eAAiB19G,EAAQy+G,eAAiB14H,KAAKu4H,oBAAqBv4H,KAAKg9B,YACjH27F,EAActsB,YAAYzlF,QAAQA,GAClCgyG,EAAgBjI,GAAU,CAAC12G,EAAQmqC,OAAQu0E,IAIjD,OAFAC,EAAc5xH,MAAQwD,KAAKu2D,MAC3B63D,EAAchyG,QAAUA,EACjBgyG,CACX,CACA,OAAA9f,CAAQ10D,GACJ,MAAMg0E,EAAO5tH,KAAKu2D,MAAQ3c,EAAOp9C,MAC7Bo9C,EAAOQ,SACP5kD,KAAKqqD,QAAQ7pD,KAAK43H,GAClBp4H,KAAKqI,KAAK7H,KAAK43H,EAAOp4H,KAAKw4H,mBAC3Bx4H,KAAKm2H,QAAQr3H,OAAO,CAChB+5H,qBAAsB74H,KAAKqqD,QAAQstE,cACnCmB,iBAAkB94H,KAAKqqD,QAAQwtE,UAC/BkB,gBAAiB/4H,KAAKqqD,QAAQytE,SAC9BkB,gBAAiBh5H,KAAKqqD,QAAQutE,SAC9BvtE,QAAS+tE,MAIbp4H,KAAKoqD,QAAQ5pD,KAAK43H,GAClBp4H,KAAKqI,KAAK7H,KAAK43H,GACfp4H,KAAKm2H,QAAQr3H,OAAO,CAChBm6H,qBAAsBj5H,KAAKoqD,QAAQutE,cACnCuB,iBAAkBl5H,KAAKoqD,QAAQytE,UAC/BsB,gBAAiBn5H,KAAKoqD,QAAQ0tE,SAC9BsB,gBAAiBp5H,KAAKoqD,QAAQwtE,SAC9BxtE,QAASguE,IAGrB,EClDG,MAAMiB,GACTnxE,SACAK,WACAn9C,IACAkuH,kBACAC,eACAC,gBACA5yG,QACA6yG,6BACA,WAAAnqH,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKuoD,WAAaA,EAClBvoD,KAAKkoD,SAAW,IAAIr8C,EAAKggG,gBAdT,oBAehB7rG,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,6BAC1CzjG,KAAKu5H,eAAiB1tH,EAAK6tH,cAnBF,IAoBzB15H,KAAKy5H,6BAA+B5tH,EAAK4tH,+BAfA,EAgBzCz5H,KAAK4mB,QAAU,IAAI0xG,GAAgB,IAC3BzsH,EAAK8tH,aAAe,CAAC,EACzB33B,QAASz5C,EAAWy5C,QACpBiuB,WAAY,oDAEpB,CACA,CAACxsF,OAAOqB,aAAe,6BACvB,CAACstD,IAAuB,CACpB,8BAEJ,KAAAprF,GACIhH,KAAKw5H,gBAAkB,IAAIzmB,gBACD/yG,KAAKw5H,gBAAgBp1E,OAC/CpkD,KAAKs5H,kBAAoBtjE,aAAY,KACjCh2D,KAAKuoD,WAAWI,kBAAkB9B,iBAAiB15C,SAAQwqD,IACvDp7B,QAAQr4B,UAAUq/B,MAAK4J,UACnB,IAAInmC,EAAQwD,KAAKu2D,MACjB,IACI,MAAM3c,EAASpkD,KAAK4mB,QAAQ6xG,iBAAiB,CACzCr0E,OAAQpkD,KAAKw5H,iBAAiBp1E,SAM5Bw1E,EAAKxmC,SAJUz7B,EAAKhQ,UAAU3nD,KAAKkoD,SAAU,CAC/C9D,SACAunD,wBAAwB,KAG5B3kG,EAAQwD,KAAKu2D,YACPxkC,QAAQgpB,IAAI,CACdq0E,EAAGlqH,MAAM,GA7CjB,IA6C2C,CAC/B00C,WAEJw1E,EAAG18G,KAhDX,GAgD6B,CACjBknC,aAGRuT,EAAKkiE,IAAMrvH,KAAKu2D,MAAQ/5D,QAClB4yH,EAAGrmC,SAAS+Y,MAAM,CACpBloD,UAER,CACA,MAAO39B,GACH,GAAiB,6BAAbA,EAAI1lB,KACJ,MAAM0lB,EAMVkxC,EAAKkiE,KAAOrvH,KAAKu2D,MAAQ/5D,GAAS,CACtC,KAECs8B,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,yBAA0Bf,GACrCzmB,KAAKy5H,8BACLz5H,KAAKoL,IAAIoc,MAAM,2CACfmwC,EAAKyP,MAAM3gD,IAGXzmB,KAAKoL,IAAI,oFACb,GACF,GACJ,GACHpL,KAAKu5H,eACZ,CACA,IAAAjzG,GACItmB,KAAKw5H,iBAAiBpyD,QACQ,MAA1BpnE,KAAKs5H,mBACLjjE,cAAcr2D,KAAKs5H,kBAE3B,EC1FG,MAAMQ,GACTC,QACAzuB,QACA/iD,WACA,WAAAj5C,CAAYi5C,EAAY18C,GACpB7L,KAAK+5H,QAAUluH,EAAKkuH,SAAW,GAC/B/5H,KAAKsrG,SAAU,EACftrG,KAAKuoD,WAAaA,CACtB,CACA,CAAC9kB,OAAOqB,aAAe,0BACvB,SAAA83B,GACI,OAAO58D,KAAKsrG,OAChB,CACA,WAAMtkG,GACFhH,KAAKsrG,SAAU,CACnB,CACA,UAAMhlF,GACFtmB,KAAKsrG,SAAU,CACnB,CAIA,mBAAO0uB,CAAcj7H,EAAKkb,EAAU,CAAC,GACjC,GAA4B,IAAxBja,KAAK+5H,QAAQt4H,OACb,MAAM,IAAI8pH,GAAsB,gCAEpC,MAAMjhH,EAAOtK,KACPi6H,EAAO,IAAIpY,GACjB,UAAW,MAAMh6D,KAAQ,MAASv9C,EAAKyvH,QAAQz1H,KAAI41H,GAAUA,EAAOF,cAAcj7H,EAAKkb,MAGvE,MAAR4tC,IAIAA,EAAKu+C,WAAW3kG,OAAS,SACnBzB,KAAKuoD,WAAW2N,UAAU7yC,MAAMwkC,EAAKn3C,GAAI,CAC3C01F,WAAYv+C,EAAKu+C,aAIrB6zB,EAAKh7H,IAAI4oD,EAAKn3C,MAGlBupH,EAAKj9G,IAAI6qC,EAAKn3C,UACRm3C,GAEd,CAKA,aAAMsyE,CAAQp7H,EAAKkb,EAAU,CAAC,GAC1B,GAA4B,IAAxBja,KAAK+5H,QAAQt4H,OACb,MAAM,IAAI8pH,GAAsB,sCAE9BhvF,QAAQgpB,IAAIvlD,KAAK+5H,QAAQz1H,KAAI6oC,MAAO+sF,UAChCA,EAAOC,QAAQp7H,EAAKkb,EAAQ,IAE1C,CAIA,SAAMwuG,CAAI1pH,EAAKC,EAAOib,GAClB,IAAKja,KAAK48D,YACN,MAAM,IAAIsO,SAER3uC,QAAQgpB,IAAIvlD,KAAK+5H,QAAQz1H,KAAI6oC,MAAO+sF,UAChCA,EAAOzR,IAAI1pH,EAAKC,EAAOib,EAAQ,IAE7C,CAKA,SAAM7a,CAAIL,EAAKkb,GACX,IAAKja,KAAK48D,YACN,MAAM,IAAIsO,GAEd,OAAO3uC,QAAQojC,IAAI3/D,KAAK+5H,QAAQz1H,KAAI6oC,MAAO+sF,GAChCA,EAAO96H,IAAIL,EAAKkb,KAE/B,ECnFG,MAAMmgH,GACTC,GACAvkH,EACA43E,KACA,WAAAp+E,CAAYE,EAAKpC,EAAMsgF,EAAM4sC,EAAkB,GAC3C,GAAIA,EANwB,GAOxB,MAAM,IAAIl6H,UAAU,4BAExB,MAAMm6H,EAAMntH,EAAKotH,MAAMhrH,EAAKk+E,GACtB2sC,EAAK,EAAgBC,GAC3B,IAAK,IAAI/4H,EAAI,EAAGA,EAAI84H,EAAG54H,OAAQF,IAC3B84H,EAAG94H,GAAKg5H,EAAIh5H,GAEE,IAAd84H,EAAG54H,SACH44H,EAAG,GAAK,GAEZr6H,KAAKq6H,GAAKA,EACVr6H,KAAK8V,EAAI1I,EACTpN,KAAK0tF,KAAOA,CAChB,CACA,IAAAtgF,GACI,OAAOpN,KAAK8V,EAAE1I,KAAKpN,KAAKq6H,GAAIr6H,KAAK0tF,KACrC,CACA,MAAAp/C,CAAOC,GACH,OAAMA,GAAO8rF,cAAcpqH,YAGpB,GAAiBjQ,KAAKq6H,GAAI9rF,EAAM8rF,GAC3C,EC/BG,SAASI,GAAavxH,EAAK3K,GAC9B,OAAO0K,KAAK6a,MAAM7a,KAAKm0B,UAAY7+B,EAAM2K,IAAQA,CACrD,CCAO,MAAMwxH,GACT3qG,SACA,WAAAzgB,CAAY7Q,GACRuB,KAAK+vB,SAAW,IAAIpuB,MAAMlD,GAAMi6C,KAAK,KACzC,CACA,GAAAz5C,CAAI07H,GACA,KAAMA,aAAuBP,IACzB,MAAM,IAAIh6H,UAAU,uBAExB,OAAOJ,KAAK+vB,SAASirC,MAAMq/D,GAChBM,EAAYrsF,OAAO+rF,IAElC,CACA,GAAAr9G,CAAI29G,GACA,KAAMA,aAAuBP,IACzB,MAAM,IAAIh6H,UAAU,uBAExB,IAAK,IAAImB,EAAI,EAAGA,EAAIvB,KAAK+vB,SAAStuB,OAAQF,IACtC,GAAwB,MAApBvB,KAAK+vB,SAASxuB,GAEd,OADAvB,KAAK+vB,SAASxuB,GAAKo5H,GACZ,EAGf,OAAO,CACX,CACA,IAAAv3C,CAAKu3C,GACD,KAAMA,aAAuBP,IACzB,MAAM,IAAIh6H,UAAU,uBAExB,MAAMmB,EAAIk5H,GAAa,EAAGz6H,KAAK+vB,SAAStuB,OAAS,GAC3CkjC,EAAU3kC,KAAK+vB,SAASxuB,GAE9B,OADAvB,KAAK+vB,SAASxuB,GAAKo5H,EACZh2F,CACX,CACA,MAAAxlC,CAAOw7H,GACH,KAAMA,aAAuBP,IACzB,MAAM,IAAIh6H,UAAU,uBAExB,MAAM++B,EAAQn/B,KAAK+vB,SAASisF,WAAWqe,GAC5BM,EAAYrsF,OAAO+rF,KAE9B,OAAIl7F,GAAS,IACTn/B,KAAK+vB,SAASoP,GAAS,MAChB,EAKf,EC/CJ,MAAMy7F,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,IAAIljG,WAAWmU,YCnB9B,MAAM,GAAQ,CACjB3+B,KAAO2oB,GACIxrB,ODqDA,SAAevL,GAAO,KAACP,EAAO,GAAE,WAAEs8H,GAAc,CAAC,GAC/D,IAAKH,GAAWn8H,GACf,MAAM,IAAID,MAAM,mEAGjB,GAAqB,iBAAVQ,EAAoB,CAC9B,GAAI+7H,EACH,OA5BH,SAAyBxqH,EAAQ9R,EAAMs8H,GACtC,GAA0B,IAAtBA,EAAWt5H,OACd,MAAM,IAAIjD,MAAM,gEAGjB,MAAMw8H,EAAWJ,GAAWn8H,GAC5B,IAAI2O,EAAOytH,GAAYp8H,GACnBw8H,EAAY1qH,EAEhB,KAAO0qH,EAAUx5H,OAAS,GAAG,CAC5B,MAAMqT,EAASgmH,GAAcI,WAAWD,EAAWF,GACnDE,EAAYA,EAAU/5H,MAAM4T,EAAOoI,MACnC,IAAK,IAAIrS,EAAQ,EAAGA,EAAQiK,EAAOi1B,QAASl/B,IAC3CuC,GAAQ64B,OAAO80F,EAAWlwH,IAC1BuC,EAAO64B,OAAOk1F,QAAQ18H,EAAM2O,EAAO4tH,EAErC,CAEA,OAAO5tH,CACR,CASUguH,CAAgBp8H,EAAOP,EAAMs8H,GAGrC/7H,EAAQ87H,GAAc5lH,OAAOlW,EAC9B,CAEA,OA/CD,SAAyBsmH,EAAY7mH,GACpC,MAAMu8H,EAAWJ,GAAWn8H,GAC5B,IAAI2O,EAAOytH,GAAYp8H,GAGvB,IAAK,IAAIoM,EAAQ,EAAGA,EAAQy6G,EAAW7jH,OAAQoJ,IAC9CuC,GAAQ64B,OAAOq/E,EAAWz6G,IAC1BuC,EAAO64B,OAAOk1F,QAAQ18H,EAAM2O,EAAO4tH,GAGpC,OAAO5tH,CACR,CAoCQiuH,CAAgBr8H,EAAOP,EAC/B,CCnEsB68H,CAAUvlG,EAAO,CAC3Bt3B,KAAM,MAGd+7H,MAAO,CAACzkG,EAAO23D,IAIZ,SAAwBlhD,GAC3B,IAAI92B,EAAM82B,EAAInmC,SAAS,IAIvB,OAHIqP,EAAIjU,OAAS,GAAM,IACnBiU,EAAM,IAAIA,KAEP,GAAqBA,EAAK,SACrC,CATe6lH,CAAe,GAAMnuH,KAAK2oB,EAAO23D,KCHzC,MAAM8tC,GACTC,WACAC,WACApB,gBACA/+C,QACA9zD,MACAra,KACAsgF,KACA,WAAAp+E,CAAYzD,GACR7L,KAAK07H,WAAa7vH,EAAK6vH,WACvB17H,KAAKy7H,WAAa5vH,EAAK4vH,YAAc,EACrCz7H,KAAKs6H,gBAAkBzuH,EAAKyuH,iBAAmB,EAC/Ct6H,KAAKynB,MAAQ,EACbznB,KAAKu7E,QAAU,GACfv7E,KAAKoN,KAAOvB,EAAKuB,MAAQ,GACzBpN,KAAK0tF,KAAO7hF,EAAK6hF,MAAQ+sC,GAAa,EAAGxxH,KAAK0qB,IAAI,EAAG,IACzD,CACA,GAAA3W,CAAIwoC,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAMm1E,EAAc,IAAIP,GAAY50E,EAAMxlD,KAAKoN,KAAMpN,KAAK0tF,KAAM1tF,KAAKs6H,iBAC/D93H,EAAIxC,KAAKoN,KAAKA,KAAKo4C,EAAMxlD,KAAK0tF,MAAQ1tF,KAAK07H,WAC3ChjG,GAAKl2B,EAAIm4H,EAAYvtH,QAAUpN,KAAK07H,WAO1C,GANuB,MAAnB17H,KAAKu7E,QAAQ/4E,KACbxC,KAAKu7E,QAAQ/4E,GAAK,IAAIk4H,GAAO16H,KAAKy7H,aAEf,MAAnBz7H,KAAKu7E,QAAQ7iD,KACb14B,KAAKu7E,QAAQ7iD,GAAK,IAAIgiG,GAAO16H,KAAKy7H,aAElCz7H,KAAKu7E,QAAQ/4E,GAAGwa,IAAI29G,IAAgB36H,KAAKu7E,QAAQ7iD,GAAG1b,IAAI29G,GAExD,OADA36H,KAAKynB,SACE,EAEX,MAAMk0G,EAAO,CAACn5H,EAAGk2B,GACjB,IAAIn3B,EAAIo6H,EAAKlB,GAAa,EAAGkB,EAAKl6H,OAAS,IACpB,MAAnBzB,KAAKu7E,QAAQh6E,KACbvB,KAAKu7E,QAAQh6E,GAAK,IAAIm5H,GAAO16H,KAAKy7H,aAEtC,IAAK,IAAIjoH,EAAI,EAAGA,EAxCD,IAwCqBA,IAAK,CACrC,MAAMooH,EAAU57H,KAAKu7E,QAAQh6E,GAAG6hF,KAAKu3C,GACrC,GAAe,MAAXiB,IAGJr6H,GAAKA,EAAIq6H,EAAQxuH,QAAUpN,KAAK07H,WACT,MAAnB17H,KAAKu7E,QAAQh6E,KACbvB,KAAKu7E,QAAQh6E,GAAK,IAAIm5H,GAAO16H,KAAKy7H,aAElCz7H,KAAKu7E,QAAQh6E,GAAGyb,IAAI4+G,IAEpB,OADA57H,KAAKynB,SACE,CAKf,CACA,OAAO,CACX,CACA,GAAAxoB,CAAIumD,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAMm1E,EAAc,IAAIP,GAAY50E,EAAMxlD,KAAKoN,KAAMpN,KAAK0tF,KAAM1tF,KAAKs6H,iBAC/D93H,EAAIxC,KAAKoN,KAAKA,KAAKo4C,EAAMxlD,KAAK0tF,MAAQ1tF,KAAK07H,WAC3CG,EAAM77H,KAAKu7E,QAAQ/4E,IAAIvD,IAAI07H,KAAgB,EACjD,GAAIkB,EACA,OAAOA,EAEX,MAAMnjG,GAAKl2B,EAAIm4H,EAAYvtH,QAAUpN,KAAK07H,WAC1C,OAAO17H,KAAKu7E,QAAQ7iD,IAAIz5B,IAAI07H,KAAgB,CAChD,CACA,MAAAx7H,CAAOqmD,GACiB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,MAAMm1E,EAAc,IAAIP,GAAY50E,EAAMxlD,KAAKoN,KAAMpN,KAAK0tF,KAAM1tF,KAAKs6H,iBAC/D93H,EAAIxC,KAAKoN,KAAKA,KAAKo4C,EAAMxlD,KAAK0tF,MAAQ1tF,KAAK07H,WAC3CG,EAAM77H,KAAKu7E,QAAQ/4E,IAAIrD,OAAOw7H,KAAgB,EACpD,GAAIkB,EAEA,OADA77H,KAAKynB,QACEo0G,EAEX,MAAMnjG,GAAKl2B,EAAIm4H,EAAYvtH,QAAUpN,KAAK07H,WACpCI,EAAM97H,KAAKu7E,QAAQ7iD,IAAIv5B,OAAOw7H,KAAgB,EAIpD,OAHImB,GACA97H,KAAKynB,QAEFq0G,CACX,CACA,YAAIC,GACA,OAAO9yH,KAAK6a,MAAa9jB,KAAKynB,MAAQznB,KAAK07H,WAAzB,MAAyC,EAC/D,EAGJ,MAAMM,GAAW,CACb,EAAG,GACH,EAAG,IACH,EAAG,IACH,EAAG,KAWA,SAASC,GAASC,EAAUC,EAAY,MAG3C,MAAMV,EAZV,SAA6BU,EAAY,MACrC,OAAIA,EAAY,KACL,EAEPA,EAAY,KACL,EAEJ,CACX,CAIuBC,CAAoBD,GACjC3uH,EAAOwuH,GAASP,GAItB,MAAO,CACHC,WAHezyH,KAAKuuB,MAAM0kG,EAAW1uH,GAIrCiuH,aACAnB,gBAJoBrxH,KAAKC,IAAID,KAAK01B,KAAK11B,KAAKozH,KAAK,EAAIF,GAAalzH,KAAKozH,KAAK,EAAIZ,ILxHpD,IK8HpC,CC5HO,MAAMa,GACTZ,WACAD,WACAnB,gBACAiC,MACAC,aACApvH,KACAsgF,KACA,WAAAp+E,CAAYzD,GACR7L,KAAKy7H,WAAa5vH,EAAK4vH,YAAc,EACrCz7H,KAAK07H,WAAa7vH,EAAK6vH,aAAe,GAAK,IAAM17H,KAAKy7H,WACtDz7H,KAAKs6H,gBAAkBzuH,EAAKyuH,iBAAmB,EAC/Ct6H,KAAKu8H,MAAQ1wH,EAAK0wH,OAAS,EAC3Bv8H,KAAKoN,KAAOvB,EAAKuB,MAAQ,GACzBpN,KAAK0tF,KAAO7hF,EAAK6hF,MAAQ+sC,GAAa,EAAGxxH,KAAK0qB,IAAI,EAAG,KACrD3zB,KAAKw8H,aAAe,CAChB,IAAIhB,GAAa,CACbE,WAAY17H,KAAK07H,WACjBD,WAAYz7H,KAAKy7H,WACjBnB,gBAAiBt6H,KAAKs6H,gBACtBltH,KAAMpN,KAAKoN,KACXsgF,KAAM1tF,KAAK0tF,OAGvB,CACA,GAAA1wE,CAAIwoC,GAIA,GAHoB,iBAATA,IACPA,EAAO,GAAqBA,IAE5BxlD,KAAKf,IAAIumD,GACT,OAAO,EAEX,IAAI7gB,EAAU3kC,KAAKw8H,aAAaljG,MAAMmjG,GAC3BA,EAAOV,WAElB,GAAe,MAAXp3F,EAAiB,CACjB,MAAM+3F,EAAU18H,KAAK07H,WAAazyH,KAAK0qB,IAAI3zB,KAAKu8H,MAAOv8H,KAAKw8H,aAAa/6H,QACzEkjC,EAAU,IAAI62F,GAAa,CACvBE,WAAYgB,EACZjB,WAAYz7H,KAAKy7H,WACjBnB,gBAAiBt6H,KAAKs6H,gBACtBltH,KAAMpN,KAAKoN,KACXsgF,KAAM1tF,KAAK0tF,OAEf1tF,KAAKw8H,aAAah8H,KAAKmkC,EAC3B,CACA,OAAOA,EAAQ3nB,IAAIwoC,EACvB,CACA,GAAAvmD,CAAIumD,GACoB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,IAAK,IAAIjkD,EAAI,EAAGA,EAAIvB,KAAKw8H,aAAa/6H,OAAQF,IAC1C,GAAIvB,KAAKw8H,aAAaj7H,GAAGtC,IAAIumD,GACzB,OAAO,EAGf,OAAO,CACX,CACA,MAAArmD,CAAOqmD,GACiB,iBAATA,IACPA,EAAO,GAAqBA,IAEhC,IAAK,IAAIjkD,EAAI,EAAGA,EAAIvB,KAAKw8H,aAAa/6H,OAAQF,IAC1C,GAAIvB,KAAKw8H,aAAaj7H,GAAGpC,OAAOqmD,GAC5B,OAAO,EAGf,OAAO,CACX,CACA,SAAI/9B,GACA,OAAOznB,KAAKw8H,aAAalyF,QAAO,CAAC6Q,EAAKryC,IAC3BqyC,EAAMryC,EAAK2e,OACnB,EACP,ECNJ,MAAM,GAAcmQ,WAAWi1B,aAAe8sD,MCnEvC,MAAMgjB,GACTvxH,IACA87C,OACAgP,UACA6jE,QACA,WAAAzqH,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,uBAC1CzjG,KAAKknD,OAASqB,EAAWrB,OACzBlnD,KAAKk2D,UAAY3N,EAAW2N,UAC5Bl2D,KAAK+5H,QAAUluH,EAAKkuH,SAAW,EACnC,CACA,CAACt2F,OAAOqB,aAAe,uBAIvB,cAAMquF,CAASziH,EAAIuJ,GACf,GAA4B,IAAxBja,KAAK+5H,QAAQt4H,OACb,MAAM,IAAI+pH,GAAmB,6BAEjC,GAAI96G,EAAGrK,aAAerG,KAAKknD,OAAO7gD,WAC9B,MAAM,IAAIolH,GAAoB,+BAElC,MAAMnhH,EAAOtK,KACPmG,EAAS,MAASnG,KAAK+5H,QAAQz1H,KAAI41H,GAAU,kBAC/C,gBACgBA,EAAO/G,SAASziH,EAAIuJ,EACpC,CACA,MAAOwM,GACHnc,EAAKc,IAAIoc,MAAMf,EACnB,CACH,CAPkD,MAQnD,UAAW,MAAMohC,KAAQ1hD,EACrB,GAAY,MAAR0hD,EASJ,OALIA,EAAKu+C,WAAW3kG,OAAS,SACnBzB,KAAKk2D,UAAU7yC,MAAMwkC,EAAKn3C,GAAI,CAChC01F,WAAYv+C,EAAKu+C,aAGlBv+C,EAEX,MAAM,IAAI6iB,EACd,CAIA,qBAAOkyD,CAAgB79H,EAAKkb,EAAU,CAAC,GACnC,GAA4B,IAAxBja,KAAK+5H,QAAQt4H,OACb,MAAM,IAAI+pH,GAAmB,6BAEjC,MAAMlhH,EAAOtK,KACPi6H,EFsBP,SAAoCiC,EAAUC,EAAY,KAAOliH,GACpE,OAAO,IAAIqiH,GAAqB,IACzBL,GExBqC,KFwBlBE,MAClBliH,GAAW,CAAC,GAExB,CE3BqB4iH,GACb,UAAW,MAAMh1E,KDmBV1a,gBAAyBhnC,EAAQ8T,EAAU,CAAC,GACvD,IAAIqiG,EAAcriG,EAAQqiG,aAAe12F,IACrC02F,EAAc,IACdA,EAAc12F,KAElB,MAAMk3G,EAAU7iH,EAAQ6iH,UAAW,EAC7B58H,EAAU,IAAIwsD,YACdqwE,EAAM,GACZ,IAGIC,EAHAC,EAAgB,KAChBC,EAAkB,KAClBC,GAAiB,EAEjBC,GAAU,EAsCd,SAASC,IACL,OAAIP,EACOC,EAAI,IAAI/5F,KAEZl2B,QAAQiwH,EAAIzjG,MAAKiE,GAAMA,EAAGyF,OACrC,CACA,SAAUs6F,IACN,KAAQP,EAAIt7H,OAAS,GAAMs7H,EAAI,GAAG/5F,MAAM,CACpC,MAAMzF,EAAKw/F,EAAI,GAEf,GADAA,EAAIz0H,SACAi1B,EAAGggG,GAOH,MAFAH,GAAU,EACVH,EAAc/4H,UACRq5B,EAAG9W,UANH8W,EAAGv+B,MAQbi+H,EAAc/4H,SAClB,CACJ,CACA,SAAUs5H,IAGN,KAAOH,KACH,IAAK,IAAI97H,EAAI,EAAGA,EAAIw7H,EAAIt7H,OAAQF,IAC5B,GAAIw7H,EAAIx7H,GAAGyhC,KAAM,CACb,MAAMzF,EAAKw/F,EAAIx7H,GAGf,GAFAw7H,EAAI7xH,OAAO3J,EAAG,GACdA,KACIg8B,EAAGggG,GAMH,MAFAH,GAAU,EACVH,EAAc/4H,UACRq5B,EAAG9W,UALH8W,EAAGv+B,MAObi+H,EAAc/4H,SAClB,CAGZ,CACA,IAjFAhE,EAAQqkD,iBAAiB,iBAAiB,KACtC24E,EAAgBh5H,SAAS,IAExBq4B,QAAQr4B,UAAUq/B,MAAK4J,UACxB,IACI,UAAW,MAAMg4B,KAAQh/D,EAAQ,CAK7B,GAJI42H,EAAIt7H,SAAW66G,IACf2gB,EAAgB,WACVA,EAAcr6E,SAEpBw6E,EACA,MAEJ,MAAM7/F,EAAK,CACPyF,MAAM,GAEV+5F,EAAIv8H,KAAK+8B,GACT4nC,IACK5hC,MAAKzuB,IACNyoB,EAAGyF,MAAO,EACVzF,EAAGggG,IAAK,EACRhgG,EAAGv+B,MAAQ8V,EACX5U,EAAQysD,cAAc,IAAI,GAAY,iBAAiB,IACxDlmC,IACC8W,EAAGyF,MAAO,EACVzF,EAAG9W,IAAMA,EACTvmB,EAAQysD,cAAc,IAAI,GAAY,iBAAiB,GAE/D,CACAwwE,GAAiB,EACjBj9H,EAAQysD,cAAc,IAAI,GAAY,iBAC1C,CACA,MAAOlmC,GACHu2G,EAAYv2G,EACZvmB,EAAQysD,cAAc,IAAI,GAAY,iBAC1C,OA8CS,CAKT,GAJK0wE,MACDH,EAAkB,WACZA,EAAgBt6E,SAET,MAAbo6E,EAEA,MAAMA,EAQV,GANIF,QACOQ,UAGAE,IAEPL,GAAiC,IAAfJ,EAAIt7H,OAEtB,KAER,CACJ,CCrIiCg8H,CAAStwF,kBAC9B,MAAMhnC,EAAS,MAASmE,EAAKyvH,QAAQz1H,KAAI41H,GAAUA,EAAO0C,gBAAgB79H,EAAKkb,MAC/E,UAAW,IAAI4tC,KAAQ1hD,QACbgnC,UAEF,GAA+B,IAA3B0a,EAAKu+C,WAAW3kG,OAChB,IACIomD,QAAav9C,EAAK6oH,SAAStrE,EAAKn3C,GAAI,IAC7BuJ,EACHyjH,UAAU,GAElB,CACA,MAAOj3G,GAEH,YADAnc,EAAKc,IAAIoc,MAAM,iCAAkCf,EAErD,CAEJ,OAAOohC,CAAI,CAGvB,CApBkC1a,IAqBlB,MAAR0a,IAIAA,EAAKu+C,WAAW3kG,OAAS,SACnBzB,KAAKk2D,UAAU7yC,MAAMwkC,EAAKn3C,GAAI,CAChC01F,WAAYv+C,EAAKu+C,aAIrB6zB,EAAKh7H,IAAI4oD,EAAKn3C,GAAGq8D,cAAcj+D,SAGnCmrH,EAAKj9G,IAAI6qC,EAAKn3C,GAAGq8D,cAAcj+D,aACzB+4C,GAEd,EC1FG,MAAM81E,WAAmBlxE,GAC5BymE,YACA9nH,IACAwyH,QACAC,QACAC,mBACAC,eACAC,SACA,WAAA1uH,CAAYi5C,GACRnY,QACApwC,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,sBAC1CzjG,KAAKkzH,YAAc3qE,EAAW2qE,YAC9BlzH,KAAK69H,QAAU,EACf79H,KAAK49H,SAAU,EAEf59H,KAAK89H,mBAAqB,IAAI/qB,gBACJ/yG,KAAK89H,mBAAmB15E,MACtD,CACA,CAAC3gB,OAAOqB,aAAe,sBACvB,KAAA99B,GACIhH,KAAK89H,mBAAqB,IAAI/qB,gBACJ/yG,KAAK89H,mBAAmB15E,MACtD,CACA,IAAA99B,GACItmB,KAAK89H,mBAAmB12D,OAC5B,CACA,UAAO62D,CAAKhkH,GACHja,KAAK49H,SAEN59H,KAAKk+H,YAETl+H,KAAK69H,UACL,MAAMz5E,EAASusE,GAAU,CAAC3wH,KAAK89H,mBAAmB15E,OAAQnqC,GAASmqC,SAEnE,IACI,OAAa,CAETpkD,KAAKg+H,UAAU95H,UACflE,KAAKg+H,SAAWr7E,KAEhB,MAAMxiD,QAAcivH,GAAUpvH,KAAM,YAAaokD,EAAQ,CACrDorE,WAAY,qBAEVrvH,EAAM2nD,MAChB,CACJ,CACA,QACI1D,EAAO7kD,QACPS,KAAK69H,UAEgB,IAAjB79H,KAAK69H,UACL79H,KAAK+9H,gBAAgB32D,QACrBpnE,KAAK+9H,oBAAiB7+H,EAE9B,CACJ,CACA,SAAAg/H,GACIl+H,KAAK49H,SAAU,EAGf59H,KAAK+9H,eAAiB,IAAIhrB,gBACA/yG,KAAK+9H,eAAe35E,OAC9C,MAAMA,EAASusE,GAAU,CAAC3wH,KAAK+9H,eAAe35E,OAAQpkD,KAAK89H,mBAAmB15E,SAExEp9C,EAAQwD,KAAKu2D,MACnB,IAAI5hC,EAAQ,EACZ5C,QAAQr4B,UAAUq/B,MAAK4J,UAGnB,IAFAntC,KAAKoL,IAAI,cAEFpL,KAAK69H,QAAU,GAClB,IACI,MAAMl0F,EAAO,GAAY,IACzB,IAAI5mC,EAAIyH,KAAKu2D,MACb,UAAW,MAAMlZ,KAAQ7nD,KAAKkzH,YAAY0J,gBAAgBjzF,EAAM,CAAEya,WAC1DA,EAAOQ,SACP5kD,KAAKoL,IAAI,iBAEbg5C,EAAOC,iBACPrkD,KAAKoL,IAAI,0CAA2Cy8C,EAAKn3C,GAAIlG,KAAKu2D,MAAQh+D,EAAG/C,KAAK69H,SAClF1+F,IACAn/B,KAAK4sD,kBAAkB,YAAa,CAChC9E,OAAQD,IAIS,IAAjB7nD,KAAK69H,SAAkC,MAAjB79H,KAAKg+H,WAC3Bh+H,KAAKoL,IAAI,4BACHu5C,GAAW3kD,KAAKg+H,SAASp7E,QAASwB,IAE5CrhD,EAAIyH,KAAKu2D,MAEb/gE,KAAKoL,IAAI,gEAAiEu+B,EAAM3pC,KAAK69H,QAAS1+F,EAClG,CACA,MAAO1Y,GACHzmB,KAAKoL,IAAIoc,MAAM,qBAAsBf,GACrCzmB,KAAK4sD,kBAAkB,aAAc,CACjC9E,OAAQrhC,GAEhB,CAEJzmB,KAAKoL,IAAI,8BAA8B,IAEtCk4B,OAAM7c,IACPzmB,KAAKoL,IAAIoc,MAAM,qBAAsBf,EAAI,IAExC6pE,SAAQ,KACTtwF,KAAKoL,IAAI,2CAA4C+zB,EAAO30B,KAAKu2D,MAAQ/5D,GACzEhH,KAAK49H,SAAU,CAAK,GAE5B,EC3GG,MAAMO,GACT/yH,IACAgzH,WACA98H,SACAinD,WACA,WAAAj5C,CAAYi5C,GACRvoD,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,oBAC1CzjG,KAAKo+H,WAAa,IAAIvwF,IACtB7tC,KAAKsB,SAAW,IAAIusC,IACpB7tC,KAAKuoD,WAAaA,EAClBvoD,KAAKq+H,cAAgBr+H,KAAKq+H,cAAcjiG,KAAKp8B,MAC7CA,KAAKs+H,cAAgBt+H,KAAKs+H,cAAcliG,KAAKp8B,MAC7CA,KAAKu+H,gBAAkBv+H,KAAKu+H,gBAAgBniG,KAAKp8B,MACjDA,KAAKuoD,WAAWznD,OAAOyjD,iBAAiB,kBAAmBvkD,KAAKq+H,eAChEr+H,KAAKuoD,WAAWznD,OAAOyjD,iBAAiB,cAAevkD,KAAKs+H,eAC5Dt+H,KAAKuoD,WAAWznD,OAAOyjD,iBAAiB,gBAAiBvkD,KAAKu+H,gBAClE,CACA,CAAC96F,OAAOqB,aAAe,oBACvB,YAAAmkC,GACI,OAAOtnE,MAAM4c,KAAK,IAAI+8B,IAAI,IACnBt7C,KAAKsB,SAAS4D,UACjBkJ,MACR,CACA,UAAAowH,CAAWt2E,GACP,MAAMub,EAAUzjE,KAAKsB,SAASlC,IAAI8oD,GAClC,GAAe,MAAXub,EACA,MAAM,IAAI,GAAgC,sCAAsCvb,KAEpF,OAAOub,CACX,CACA,aAAAg7D,CAAcv2E,GACV,MAAMk2E,EAAap+H,KAAKo+H,WAAWh/H,IAAI8oD,GACvC,OAAkB,MAAdk2E,EACO,GAEJ,IACAA,EAAWn7H,SAEtB,CAIA,YAAMgnD,CAAO/B,EAAUub,EAAS3mC,GAC5B,GAAI98B,KAAKsB,SAASrC,IAAIipD,GAClB,MAAM,IAAI,GAAuC,2CAA2CA,KAEhG,MAAMjuC,EAAU,GAAMmiB,KAAK,CAAErE,iBAAiB,GAA9B,CAAsC,CAClDoyB,kBApD+B,GAqD/BqhD,mBApDgC,IAqDjC1uE,GACH98B,KAAKsB,SAAShC,IAAI4oD,EAAU,CACxBub,UACAxpD,kBAGEja,KAAKuoD,WAAW2N,UAAU7yC,MAAMrjB,KAAKuoD,WAAWrB,OAAQ,CAC1Da,UAAW,CAACG,IAEpB,CAKA,cAAM+jD,CAASlkD,IACUpmD,MAAM2Q,QAAQy1C,GAAaA,EAAY,CAACA,IAChD56C,SAAQ+6C,IACjBloD,KAAKsB,SAAS+lD,OAAOa,EAAS,UAG5BloD,KAAKuoD,WAAW2N,UAAU62C,MAAM/sG,KAAKuoD,WAAWrB,OAAQ,CAC1Da,UAAW/nD,KAAKipE,gBAExB,CAIA,cAAMy1D,CAASx2E,EAAUy2E,GACrB,GAAgB,MAAZA,EACA,MAAM,IAAI,GAAuB,oBAGrC,MAAMjuH,EAAK,IAAoB,IAAhBzH,KAAKm0B,UAAgB/2B,SAAS,MAAMmE,KAAKu2D,QACxD,IAAIq9D,EAAap+H,KAAKo+H,WAAWh/H,IAAI8oD,GAMrC,OALkB,MAAdk2E,IACAA,EAAa,IAAIvwF,IACjB7tC,KAAKo+H,WAAW9+H,IAAI4oD,EAAUk2E,IAElCA,EAAW9+H,IAAIoR,EAAIiuH,GACZjuH,CACX,CAIA,UAAAkuH,CAAWluH,GACP,IAAK,MAAOw3C,EAAUk2E,KAAep+H,KAAKo+H,WAAWjuE,UAC7CiuE,EAAWn/H,IAAIyR,KACf0tH,EAAW/2E,OAAO32C,GACM,IAApB0tH,EAAW3/H,MACXuB,KAAKo+H,WAAW/2E,OAAOa,GAIvC,CAIA,aAAAm2E,CAAc/9H,GACV,MAAMyqD,EAAazqD,EAAIwnD,OAClB9nD,KAAKuoD,WAAW2N,UAAU92D,IAAI2rD,GAC9BxnB,MAAKskB,IACN,IAAK,MAAMK,KAAYL,EAAKE,UAAW,CACnC,MAAMq2E,EAAap+H,KAAKo+H,WAAWh/H,IAAI8oD,GACvC,GAAkB,MAAdk2E,EAIJ,IAAK,MAAMO,KAAYP,EAAWn7H,UACW,IAArC07H,EAAS9xH,QAAQ5N,IAAI8rD,KAGzB4zE,EAAS9xH,QAAQ1N,OAAO4rD,GACxB4zE,EAAS7I,eAAe/qE,GAEhC,KAECznB,OAAM7c,IACU,kBAAbA,EAAI1lB,MAIRf,KAAKoL,IAAIoc,MAAM,uDAAwDujC,EAAYtkC,EAAI,GAE/F,CAKA,aAAA63G,CAAch+H,GACV,MAAM,KAAEunD,EAAI,SAAE6gE,GAAapoH,EAAIwnD,OACzB+2E,GAAWnW,GAAU3gE,WAAa,IAAIl7C,QAAOq7C,IAAaL,EAAKE,UAAU/8B,SAASk9B,KACxF,IAAK,MAAMA,KAAY22E,EAAS,CAC5B,MAAMT,EAAap+H,KAAKo+H,WAAWh/H,IAAI8oD,GACvC,GAAkB,MAAdk2E,EAIJ,IAAK,MAAMO,KAAYP,EAAWn7H,UACQ,IAAlC07H,EAAS9xH,QAAQ5N,IAAI4oD,EAAKn3C,MAG9BiuH,EAAS9xH,QAAQ1N,OAAO0oD,EAAKn3C,IAC7BiuH,EAAS7I,eAAejuE,EAAKn3C,IAErC,CACJ,CAKA,eAAA6tH,CAAgBj+H,GACZ,MAAMynD,EAAYznD,EAAIwnD,OAAOC,UACvBN,EAAannD,EAAIwnD,OAAOL,WACxBP,EAAS5mD,EAAIwnD,OAAOZ,OAC1B,IAAK,MAAMgB,KAAYH,EAAW,CAC9B,MAAMq2E,EAAap+H,KAAKo+H,WAAWh/H,IAAI8oD,GACvC,GAAkB,MAAdk2E,EAIJ,IAAK,MAAMO,KAAYP,EAAWn7H,SACL,MAArBwkD,EAAWrU,SAAyD,IAAvCurF,EAASG,4BAGL,IAAjCH,EAAS9xH,QAAQ5N,IAAIioD,KAGzBy3E,EAAS9xH,QAAQmQ,IAAIkqC,GACrBy3E,EAAS9I,YAAY3uE,EAAQO,GAErC,CACJ,EC5LJ,MAAMs3E,WAAmBlxF,IACrBsoF,OACA,WAAA7mH,CAAYzD,GACRukC,QACA,MAAM,KAAErvC,EAAI,QAAEihG,GAAYn2F,EAC1B7L,KAAKm2H,OAASn0B,EAAQg9B,eAAej+H,GACrCf,KAAKi/H,uBACT,CACA,GAAA3/H,CAAIP,EAAKC,GAGL,OAFAoxC,MAAM9wC,IAAIP,EAAKC,GACfgB,KAAKi/H,wBACEj/H,IACX,CACA,OAAOjB,GACH,MAAMmgI,EAAU9uF,MAAMiX,OAAOtoD,GAE7B,OADAiB,KAAKi/H,wBACEC,CACX,CACA,KAAA3/H,GACI6wC,MAAM7wC,QACNS,KAAKi/H,uBACT,CACA,qBAAAA,GACIj/H,KAAKm2H,OAAOr3H,OAAOkB,KAAKvB,KAC5B,ECpBG,MAAM0gI,GACT/zH,IACAm9C,WACA62E,WACA/9H,UACAq/G,eACApV,QACA,WAAAh8F,CAAYi5C,EAAY18C,EAAO,CAAC,GAC5B7L,KAAKoL,IAAMm9C,EAAW5K,OAAO8lD,aAAa,qBAC1CzjG,KAAKuoD,WAAaA,EAClBvoD,KAAKsrG,SAAU,EACftrG,KAAKo/H,WAAa,IAAIvxF,IACtB7tC,KAAKqB,UDUN,SAAoBk3B,GACvB,MAAM,KAAEx3B,EAAI,QAAEihG,GAAYzpE,EAC1B,IAAIj0B,EAOJ,OALIA,EADW,MAAX09F,EACM,IAAI+8B,GAAW,CAAEh+H,OAAMihG,YAGvB,IAAIn0D,IAEPvpC,CACX,CCpByB+6H,CAAW,CACxBt+H,KAAM,qCACNihG,QAAShiG,KAAKuoD,WAAWy5C,UAE7BhiG,KAAK0gH,eAAiB70G,EAAK60G,gBAAkBzK,GAAe0K,SAChE,CACA,CAACl9E,OAAOqB,aAAe,4BAIvB,GAAA9nB,CAAI82C,GACA,MAAMhhB,EAAMghB,EAAUrwB,OAAOqB,aAC7B,GAAW,MAAPgO,EACA,MAAM,IAAI,GAAuB,mCAErC,GAAI9yC,KAAKo/H,WAAWngI,IAAI6zC,GACpB,MAAM,IAAI,GAAuB,6CAA6CA,KAElF9yC,KAAKoL,IAAI,sBAAuB0nC,GAChC9yC,KAAKo/H,WAAW9/H,IAAIwzC,EAAKghB,GACpB9zD,KAAKqB,UAAUpC,IAAI6zC,IACpB9yC,KAAKqB,UAAU/B,IAAIwzC,EAAK,GAEhC,CACA,SAAA8pB,GACI,OAAO58D,KAAKsrG,OAChB,CACA,KAAAtkG,GACIhH,KAAKsrG,SAAU,CACnB,CACA,gBAAMkhB,GAEF,MAAMvD,EAAQjpH,KAAKuoD,WAAWgjD,eAAeuf,uBACvC9qH,KAAK8jC,OAAOmlF,EACtB,CAIA,UAAM3iG,GACF,MAAMowG,EAAQ,GACd,IAAK,MAAO33H,EAAKsC,KAAcrB,KAAKqB,UAEhC,IADArB,KAAKoL,IAAI,2BAA4BrM,GAC9BsC,EAAUI,OAAS,GAAG,CACzB,MAAMpB,EAAWgB,EAAUm8B,MACX,MAAZn9B,GAGJq2H,EAAMl2H,KAAKH,EAASisG,QACxB,OAEE/vE,QAAQgpB,IAAImxE,GAClB12H,KAAKoL,IAAI,wBACT,IAAK,MAAMrM,KAAOiB,KAAKqB,UAAU6D,OAC7BlF,KAAKqB,UAAU/B,IAAIP,EAAK,IAE5BiB,KAAKsrG,SAAU,CACnB,CAIA,UAAM1xC,CAAKO,EAAIlgD,GACX,MAAM65C,EAAY9zD,KAAKyzH,0BAA0Bt5D,GACjD,GAAiB,MAAbrG,EACA,MAAM,IAAIo4D,GAA0B,sCAAsCl9G,OAAOmrD,MAMrF,OAJAlgD,GAASwgG,aAAa,IAAIf,GAAoB,uCAAwC5lD,EAAUrwB,OAAOqB,eAIhGgvB,EAAU8F,KAAKO,EAAI,IACnBlgD,EACHkgG,SAAUn6G,KAAKuoD,WAAW4xD,UAElC,CAIA,QAAAyQ,GACI,IAAI3B,EAAQ,GACZ,IAAK,MAAM5nH,KAAarB,KAAKqB,UAAU4B,SACnC,IAAK,MAAM5C,KAAYgB,EACnB4nH,EAAQ,IAAIA,KAAU5oH,EAASuqH,YAGvC,OAAO3B,CACX,CAIA,aAAAqW,GACI,OAAO39H,MAAM49H,MAAMv/H,KAAKo/H,WAAWn8H,SACvC,CAIA,YAAAu8H,GACI,OAAO79H,MAAM49H,MAAMv/H,KAAKqB,UAAU4B,UAAUwvH,MAChD,CAIA,yBAAAgB,CAA0Bt5D,GACtB,IAAK,MAAMrG,KAAa9zD,KAAKo/H,WAAWn8H,SAEpC,GADc6wD,EAAU8mD,WAAW,CAACzgD,IAC1B14D,OAAS,EACf,OAAOqyD,CAGnB,CAIA,2BAAA2rE,CAA4BtlE,GACxB,IAAK,MAAMrG,KAAa9zD,KAAKo/H,WAAWn8H,SAEpC,GADc6wD,EAAU6mD,aAAa,CAACxgD,IAC5B14D,OAAS,EACf,OAAOqyD,CAGnB,CAIA,YAAMhwB,CAAOmlF,GACT,IAAKjpH,KAAK48D,YACN,MAAM,IAAIsO,GAAgB,eAE9B,GAAa,MAAT+9C,GAAkC,IAAjBA,EAAMxnH,OAEvB,YADAzB,KAAKoL,IAAI,oEAGb,MAAMs0H,EAAiB,GACvB,IAAK,MAAO3gI,EAAK+0D,KAAc9zD,KAAKo/H,WAAWjvE,UAAW,CACtD,MAAMwvE,EAAiB7rE,EAAU6mD,aAAasO,GACxCyN,EAAQ,GAEd,IAAK,MAAMvnE,KAAQwwE,EAAgB,CAC/B3/H,KAAKoL,IAAI,iCAAkCrM,EAAKowD,GAChD,MAAM9uD,EAAWyzD,EAAU4mD,eAAe,CACtCP,SAAUn6G,KAAKuoD,WAAW4xD,WAE9B,IAAI94G,EAAYrB,KAAKqB,UAAUjC,IAAIL,IAAQ,GAC1B,MAAbsC,IACAA,EAAY,GACZrB,KAAKqB,UAAU/B,IAAIP,EAAKsC,IAE5BA,EAAUb,KAAKH,GAEfA,EAASkkD,iBAAiB,aAAa,KACnCvkD,KAAKuoD,WAAWznD,OAAO8rD,kBAAkB,sBAAuB,CAC5D9E,OAAQznD,GACV,IAENA,EAASkkD,iBAAiB,SAAS,KAC/B,MAAM15C,EAAQxJ,EAAU26G,WAAUx6G,GAAKA,IAAMnB,IAE7CgB,EAAU6J,OAAOL,EAAO,GACxB7K,KAAKuoD,WAAWznD,OAAO8rD,kBAAkB,kBAAmB,CACxD9E,OAAQznD,GACV,IAGNq2H,EAAMl2H,KAAKH,EAASyjC,OAAOqrB,GAC/B,CAEA,GAAqB,IAAjBunE,EAAMj1H,QAUV,GAAoB,aANE86B,QAAQ2iC,WAAWw3D,IAKbp9F,MAAKkB,GAAkB,cAAbA,EAAEpK,UACXpwB,KAAK0gH,iBAAmBzK,GAAe2pB,SAChE,MAAM,IAAI/T,GAAsB,cAAc9sH,qDAV9C2gI,EAAel/H,KAAKzB,EAY5B,CAGA,GAAI2gI,EAAej+H,SAAWzB,KAAKo/H,WAAW3gI,KAAM,CAChD,MAAM+N,EAAU,oDAAoDkzH,EAAe73H,KAAK,SACxF,GAAI7H,KAAK0gH,iBAAmBzK,GAAe0K,UACvC,MAAM,IAAIkL,GAAsBr/G,GAEpCxM,KAAKoL,IAAI,6BAA6BoB,IAC1C,CACJ,CAKA,YAAMrN,CAAOJ,GACT,MAAMsC,EAAYrB,KAAKqB,UAAUjC,IAAIL,IAAQ,GAC7CiB,KAAKoL,IAAIm4F,MAAM,wBAAyBxkG,GAExC,MAAM23H,EAAQ,GAEd,IADA12H,KAAKoL,IAAIm4F,MAAM,2BAA4BxkG,GACpCsC,EAAUI,OAAS,GAAG,CACzB,MAAMpB,EAAWgB,EAAUm8B,MACX,MAAZn9B,GAGJq2H,EAAMl2H,KAAKH,EAASisG,QACxB,OACM/vE,QAAQgpB,IAAImxE,GAClB12H,KAAKo/H,WAAW/3E,OAAOtoD,GACvBiB,KAAKqB,UAAUgmD,OAAOtoD,EAC1B,CAOA,eAAM8gI,GACF,MAAMnJ,EAAQ,GACd,IAAK,MAAM33H,KAAOiB,KAAKo/H,WAAWl6H,OAC9BwxH,EAAMl2H,KAAKR,KAAKb,OAAOJ,UAErBw9B,QAAQgpB,IAAImxE,EACtB,EC7OG,MAEM,GAAkB,QCAxB,MAAM,WAAkCl4H,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BAKJ,MAAM,WAA2BvW,MACpCuC,KAAO,qBACPgU,KAAO,qBC5BJ,SAAS,GAAgBqsC,GAC5B,OAAsC,MAA/BA,EAAM3d,OAAOC,cACxB,CCKA,SAASo8F,GAAsBziH,EAAOilC,GAClC,GAAIjlC,EAAM7M,WAAa8xC,EACnB,MAAM,IAAI,GAAuB,0BAEzC,CACA,MAAM,GAAkB7gD,IACpB,MAAM6/C,EAAe,EAAsB7/C,GACrC8/C,EAAYv8B,EAAYs8B,GAG9B,OAFA,EAAc7/C,EAAQ8/C,GACtB,GAAezyC,MAAQwyC,EAChBC,CAAS,EAGb,SAAS,GAAOp7C,EAAQ8T,GAE3B,MAAMunC,GADNvnC,EAAUA,GAAW,CAAC,GACOwnC,eAAiB,GACxCa,EAAgBroC,GAASqoC,eAAiB,GAChD,SAAUZ,EAAWrkC,GACjByiH,GAAsBziH,EAAOilC,GAE7B,MAAM7gD,EAAS+/C,EAAankC,EAAM7M,YAE9B/O,aAAkBwO,iBACZxO,QAGCA,EAGP4b,aAAiBpN,iBACXoN,QAGCA,CAEf,CACA,OAAI,GAAgBlX,GACT,kBACH,UAAW,MAAMkX,KAASlX,QACfu7C,EAAWrkC,EAEzB,CAJM,GAMJ,YACH,IAAK,MAAMA,KAASlX,QACTu7C,EAAWrkC,EAEzB,CAJM,EAKX,CCjDA,IAAI,GDaJ,GAAevO,MAAQ,EAqCvB,GAAO6yC,OAAS,CAACtkC,EAAOpD,KAEpB,MAAMunC,GADNvnC,EAAUA,GAAW,CAAC,GACOwnC,eAAiB,GAG9C,OADAq+E,GAAsBziH,EADApD,GAASqoC,eAAiB,IAEzC,IAAItD,GAAewC,EAAankC,EAAM7M,YAAa6M,EAAM,ECtDpE,SAAW2kC,GACPA,EAASA,EAAiB,OAAI,GAAK,SACnCA,EAASA,EAAe,KAAI,GAAK,MACpC,CAHD,CAGG,KAAa,GAAW,CAAC,IAC5B,MAAM,GAAkBxyC,IACpB,MAAM/N,EAAS,EAAc+N,GAE7B,OADA,GAAeV,MAAQ,EAAsBrN,GACtCA,CAAM,EAGV,SAAS,GAAO0E,EAAQ8T,GAC3B,MAAMvH,EAAS,IAAIssC,GACnB,IAAIxa,EAAO,GAAS0d,OAChBC,GAAc,EAClB,MAAMC,EAAgBnoC,GAASmoC,eAAiB,GAC1CC,EAAkBpoC,GAASooC,iBJrBJ,EIsBvBC,EAAgBroC,GAASqoC,eAAiB,GAChD,SAAUZ,IACN,KAAOhvC,EAAOlC,WAAa,GAAG,CAC1B,GAAIg0B,IAAS,GAAS0d,OAElB,IAEI,GADAC,EAAaC,EAAc1vC,GACvByvC,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAAIA,EAAaG,EACb,MAAM,IAAI,GAAuB,2BAErC,MAAMC,EAAmBH,EAActzC,MACvC4D,EAAO6sC,QAAQgD,GACU,MAArBtoC,GAASuoC,UACTvoC,EAAQuoC,SAASL,GAErB3d,EAAO,GAASie,IACpB,CACA,MAAOh8B,GACH,GAAIA,aAAe+P,WAAY,CAC3B,GAAI9jB,EAAOlC,WAAa6xC,EACpB,MAAM,IAAI,GAA6B,kCAE3C,KACJ,CACA,MAAM57B,CACV,CAEJ,GAAI+d,IAAS,GAASie,KAAM,CACxB,GAAI/vC,EAAOlC,WAAa2xC,EAEpB,MAEJ,MAAMxY,EAAOj3B,EAAOktC,QAAQ,EAAGuC,GAC/BzvC,EAAO6sC,QAAQ4C,GACQ,MAAnBloC,GAASyoC,QACTzoC,EAAQyoC,OAAO/Y,SAEbA,EACNnF,EAAO,GAAS0d,MACpB,CACJ,CACJ,CACA,OAAI,GAAgB/7C,GACT,kBACH,UAAW,MAAMqJ,KAAOrJ,EACpBuM,EAAOysC,OAAO3vC,SACPkyC,IAEX,GAAIhvC,EAAOlC,WAAa,EACpB,MAAM,IAAI,GAAmB,0BAEpC,CARM,GAUJ,YACH,IAAK,MAAMhB,KAAOrJ,EACduM,EAAOysC,OAAO3vC,SACPkyC,IAEX,GAAIhvC,EAAOlC,WAAa,EACpB,MAAM,IAAI,GAAmB,0BAEpC,CARM,EASX,CAxEA,GAAe1B,MAAQ,EAyEvB,GAAO+zC,WAAa,CAACvjC,EAAQrF,KACzB,IAAIzJ,EAAa,EA4BjB,OAAO,GA3BgB28B,kBACnB,OACI,IACI,MAAM,KAAEnK,EAAI,MAAEhkC,SAAgBsgB,EAAOjX,KAAKmI,GAC1C,IAAa,IAATwyB,EACA,OAES,MAAThkC,UACMA,EAEd,CACA,MAAOynB,GACH,GAAiB,mBAAbA,EAAI1R,KACJ,MAAO,CAAEiuB,MAAM,EAAMhkC,MAAO,MAEhC,MAAMynB,CACV,CACA,QAEIjW,EAAa,CACjB,CAER,CAtBsB,GA2BO,IACrByJ,GAAW,CAAC,EAChBuoC,SAHchhD,IAAQgP,EAAahP,CAAC,GAItC,EC1FN,MAAM,GACFyjD,SACAC,SACAxB,MACAyB,WACA39B,MACA,WAAAlY,GACItP,KAAK0jD,OAAQ,EACb1jD,KAAKilD,SAAW,KAChBjlD,KAAKklD,SAAW,IACpB,CACA,CAACzhB,OAAOC,iBACJ,OAAO1jC,IACX,CACA,UAAMqI,GAKF,GAJuB,MAAnBrI,KAAKmlD,kBAECnlD,KAAKklD,SAAStC,QAED,MAAnB5iD,KAAKmlD,WACL,MAAM,IAAI3mD,MAAM,0DAEpB,MAAM2mD,EAAanlD,KAAKmlD,WAKxB,OAJAnlD,KAAKmlD,gBAAajmD,EAElBc,KAAKilD,SAAS/gD,UACdlE,KAAKilD,SAAW,KACTE,CACX,CACA,WAAM,CAAM1+B,GAaR,OAZAzmB,KAAK0jD,OAAQ,EACb1jD,KAAKwnB,MAAQf,EACF,MAAPA,IAGAzmB,KAAKklD,SAAStC,QAAQtf,OAAM,SAC5BtjC,KAAKklD,SAAS1oB,OAAO/V,IAEV,CACXuc,MAAM,EACNhkC,WAAOE,EAGf,CACA,YAAM,GACF,MAAM4V,EAAS,CACXkuB,MAAM,EACNhkC,WAAOE,GAMX,OAJAc,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAarwC,EAElB9U,KAAKklD,SAAShhD,UACP4Q,CACX,CACA,UAAMtU,CAAKxB,EAAOib,SACRja,KAAKsQ,MAAMtR,EAAOib,EAC5B,CACA,SAAMhT,CAAIwf,EAAKxM,GACA,MAAPwM,QACMzmB,KAAKikD,MAAMx9B,SAIXzmB,KAAKsQ,WAAMpR,EAAW+a,EAEpC,CACA,WAAM3J,CAAMtR,EAAOib,GACf,GAAa,MAATjb,GAAiBgB,KAAK0jD,MACtB,MAAM1jD,KAAKwnB,OAAS,IAAIhpB,MAAM,4CAGlC,KAA0B,MAAnBwB,KAAKmlD,kBACFnlD,KAAKilD,SAASrC,QAEX,MAAT5jD,EACAgB,KAAKmlD,WAAa,CAAEniB,MAAM,EAAOhkC,UAGjCgB,KAAK0jD,OAAQ,EACb1jD,KAAKmlD,WAAa,CAAEniB,MAAM,EAAMhkC,WAAOE,IAG3Cc,KAAKklD,SAAShhD,UACdlE,KAAKklD,SAAW,WAGVP,GAAW3kD,KAAKilD,SAASrC,QAAS3oC,GAASmqC,OAAQnqC,EAC7D,ECpHG,MAAM,WAA2Bzb,MACpCuC,KAAO,qBACPgU,KAAO,qBCFJ,MAAM,WAAkCvW,MAC3CuC,KAAO,4BACPgU,KAAO,yBAMJ,MAAM,WAA+BvW,MACxCuC,KAAO,yBACPgU,KAAO,wBAMJ,MAAM,WAAqCvW,MAC9CuC,KAAO,+BACPgU,KAAO,0BCQJ,SAAS,GAAS+wC,EAAQhpB,EAAO,CAAC,GACrC,MAAMhuB,ECJH,SAAoBg3C,EAAQhpB,GAC/B,MAAMptB,EJ+FC,IAAI,GI9FXo2C,EAAOG,KAAKv2C,GAAO4zB,OAAM6J,MAAO1mB,UACtB/W,EAAMzI,IAAIwf,EAAI,IAExBq/B,EAAOG,KAAO9Y,MAAOhnC,IACjB,UAAW,MAAMqJ,KAAOrJ,QACduJ,EAAMlP,KAAKgP,SAEfE,EAAMzI,KAAK,EAErB,IAAId,EAAS2/C,EAAO3/C,OACkB,MAAlC2/C,EAAO3/C,OAAOs9B,OAAOyb,UACrB/4C,EAAS2/C,EAAO3/C,OAAOs9B,OAAOyb,YAEc,MAAvC4G,EAAO3/C,OAAOs9B,OAAOC,iBAC1Bv9B,EAAS2/C,EAAO3/C,OAAOs9B,OAAOC,kBAElC,MAAM2vD,EAAa,IAAIr0C,GAiDvB,MAhDU,CACN9hC,KAAMiwB,MAAOlzB,IAET,GADAA,GAASmqC,QAAQC,iBACK,MAAlBpqC,GAASnL,MAAe,CAExB,MAAM,KAAEk0B,EAAI,MAAEhkC,SAAgB2lD,GAAWx+C,EAAOkC,OAAQ4R,GAASmqC,QACjE,OAAa,IAATphB,EACO,KAEJhkC,CACX,CACA,KAAOq0F,EAAW7iF,WAAayJ,EAAQnL,OAAO,CAC1C,MAAM,MAAE9P,EAAK,KAAEgkC,SAAe2hB,GAAWx+C,EAAOkC,OAAQ4R,GAASmqC,QACjE,IAAa,IAATphB,EACA,MAAM,IAAI,GAAmB,2BAEjCqwD,EAAWl0C,OAAOngD,EACtB,CACA,MAAMwQ,EAAM6jF,EAAWzzC,QAAQ,EAAG3lC,EAAQnL,OAE1C,OADAukF,EAAW9zC,QAAQtlC,EAAQnL,OACpBU,CAAG,EAEdE,MAAOy9B,MAAOxD,EAAM1vB,KAChBA,GAASmqC,QAAQC,iBAEb1a,aAAgB15B,iBACVP,EAAMlP,KAAKmpC,EAAM1vB,SAGjBvK,EAAMlP,KAAKmpC,EAAK1nB,WAAYhI,EACtC,EAEJs5E,OAAQ,KACJ,GAAIF,EAAW7iF,WAAa,EAAG,CAC3B,MAAMgjF,EAAiB1tC,EAAO3/C,OAC9B2/C,EAAO3/C,OAAUgnC,mBACY,IAArBrQ,GAAM22D,iBACAJ,QAGCA,QAEJG,CACX,CARgB,EASpB,CACA,OAAO1tC,CAAM,EAIzB,CDhEkB,CAAWA,EAAQhpB,GACP,MAAtBA,EAAKwlB,eAAiD,MAAxBxlB,EAAKulB,kBAGnCvlB,EAAKulB,gBAAkB,EAAsBvlB,EAAKwlB,gBAEtD,MAAMqxC,EAAe72D,GAAMslB,eAAiB,EACtCZ,EAAe1kB,GAAM2kB,eAAiB,EAmD5C,MAlDU,CACNvkC,KAAMiwB,MAAOlzB,IACT,IAAIkoC,GAAc,EAClB,MAAMyxC,EAAe,IAAI50C,GACzB,OAAa,CAET40C,EAAaz0C,aAAarwC,EAAMoO,KAAK,IAC9BjD,EACHnL,MAAO,KAEX,IACIqzC,EAAawxC,EAAaC,EAC9B,CACA,MAAOntE,GACH,GAAIA,aAAe+P,WACf,SAEJ,MAAM/P,CACV,CACA,GAAI07B,EAAa,EACb,MAAM,IAAI,GAA0B,0BAExC,GAA6B,MAAzBrlB,GAAMulB,iBAA2BuxC,EAAapjF,WAAassB,EAAKulB,gBAChE,MAAM,IAAI,GAA6B,kCAE3C,GAAIF,GAAc,EACd,KAER,CACA,GAA2B,MAAvBrlB,GAAMwlB,eAAyBH,EAAarlB,EAAKwlB,cACjD,MAAM,IAAI,GAAuB,2BAErC,OAAOxzC,EAAMoO,KAAK,IACXjD,EACHnL,MAAOqzC,GACT,EAENzyC,MAAOy9B,MAAOxD,EAAM1vB,WAEVnL,EAAMY,MAAM,IAAIsvC,GAAewC,EAAa7X,EAAKn5B,YAAam5B,GAAO1vB,EAAQ,EAEvF45E,OAAQ1mD,MAAOxD,EAAM1vB,KACjB,MAAM4lC,EAAO,IAAIb,MAAkBrV,EAAKmqD,SAAQtkF,GAAO,CAAEgyC,EAAahyC,EAAIgB,YAAahB,YAEjFV,EAAMY,MAAMmwC,EAAM5lC,EAAQ,EAEpCs5E,OAAQ,IACGzkF,EAAMykF,SAIzB,CEzFO,MAAMwsC,GAAc,qBAGdC,GAAsB,KCC7BC,GAAU,GAAqB,MAI9B9yF,eAAe,GAAM/tB,EAAQ1M,EAAQuH,SAClCmF,EAAO1P,MAAMgD,EAAQuH,EAC/B,CAqBOkzB,eAAexkC,GAAW2W,EAAQrF,GACrC,MAAMzK,QAZH29B,eAAoB7tB,EAAQrF,GAC/B,MAAMzK,QAAY8P,EAAOpC,KAAKjD,GAC9B,GAAuB,IAAnBzK,EAAIgB,YAAoBhB,EAAIpQ,IAAIoQ,EAAIgB,WAAa,KAAOyvH,GAAQ,GAEhE,MADAhmH,EAAQ7O,IAAIoc,MAAM,wCAAyChY,GACrD,IAAIw7D,GAAoB,mBAElC,OAAOx7D,EAAIowC,QAAQ,GAAI,EAC3B,CAKsB,CAAKtgC,EAAQrF,GAC/B,OAAO,GAAmBzK,EAAIyS,WAClC,CCkBOkrB,eAAe8c,GAAO7D,EAAQ2B,EAAW9tC,GAC5C8tC,EAAYpmD,MAAM2Q,QAAQy1C,GAAaA,EAAY,CAACA,GACpD9tC,EAAQ7O,IAAIm4F,MAAM,iCAAkCx7C,GACpD,MAAM6iD,EAAK,GAASxkD,EAAQ,IACrBnsC,EACHqoC,cAAe09E,GACf39E,gBAAiB,IAErB,OAAa,CACTpoC,EAAQ7O,IAAIm4F,MAAM,mCAClB,MAAMr7C,QAAiB,GAAuB0iD,EAAI3wF,GAElD,GADAA,EAAQ7O,IAAIm4F,MAAM,oBAAqBr7C,GACnCA,IAAa63E,GAAjB,CAMA,GAAIh4E,EAAU/8B,SAASk9B,GAInB,OAHAjuC,EAAQ7O,IAAIm4F,MAAM,qCAAsCr7C,EAAUA,SAC5D,GAAkB0iD,EAAI,GAAqB,GAAG1iD,OAAejuC,GACnEA,EAAQ7O,IAAIm4F,MAAM,uCAAwCr7C,EAAUA,GAC7D,CAAE9B,OAAQwkD,EAAGrX,SAAUrrC,YAElC,GAAiB,OAAbA,EAQJjuC,EAAQ7O,IAAIm4F,MAAM,qCAAsCr7C,SAClD,GAAkB0iD,EAAI,GAAqB,QAAS3wF,GAC1DA,EAAQ7O,IAAI,uCAAwC88C,OAVpD,CAEI,MAAMqM,EAAS,IAAIvV,MAAkB+I,EAAUzjD,KAAIo6B,GAAK,GAAOijB,OAAO,GAAqB,GAAGjjB,UAAU,GAAqB,OAC7HzkB,EAAQ7O,IAAIm4F,MAAM,mCAAoCx7C,EAAWG,SAC3D,GAAkB0iD,EAAIr2C,EAAQt6C,GACpCA,EAAQ7O,IAAIm4F,MAAM,qCAAsCx7C,EAAWG,EAEvE,CAdA,MAJIjuC,EAAQ7O,IAAIm4F,MAAM,qCAAsCw8B,GAAa73E,SAC/D,GAAkB0iD,EAAI,GAAqB,GAAGm1B,QAAkB9lH,GACtEA,EAAQ7O,IAAIm4F,MAAM,uCAAwCw8B,GAAa73E,EAoB/E,CACJ,CCnCO/a,eAAe,GAAOiZ,EAAQ2B,EAAW9tC,GAE5C,GAAyB,KADzB8tC,EAAYpmD,MAAM2Q,QAAQy1C,GAAa,IAAIA,GAAa,CAACA,IAC3CtmD,SAA2C,IAA3BwY,EAAQimH,eAClC,OAgDR,SAA0B95E,EAAQ8B,EAAUjuC,GACxC,MAAMkmH,EAAe/5E,EAAOH,KAAK7pB,KAAKgqB,GAChCg6E,EAAiBh6E,EAAOjgD,OAC9B,IAAIk6H,GAAa,EACbC,GAAc,EAClB,MAAMC,EAAkB59E,KACxB,IAAI69E,GAAe,EACfC,GAAkB,EACtB,MAAMC,EAAsB/9E,KAC5B,IAAIg+E,GAAe,EACfC,GAAkB,EACtB,MAAMC,EAAsBl+E,KACtBioD,EAAK,GAAS,CAChB3kD,KAAMk6E,EACNh6H,OAAQi6H,GACT,IACInmH,EACHqoC,cAAe09E,KAyCnB7yF,eAAe2zF,IACX,GAAIR,EAGA,OAFArmH,EAAQ7O,IAAIm4F,MAAM,4CAA6Cr7C,cACzDq4E,EAAgB39E,QAG1B09E,GAAc,EACd,IAESE,IACDvmH,EAAQ7O,IAAIm4F,MAAM,gDAAiDr7C,SAe/E/a,iBACI,GAAIszF,QACMC,EAAoB99E,YAD9B,CAIA69E,GAAkB,EAClB,IACIxmH,EAAQ7O,IAAIm4F,MAAM,iDAAkDw8B,GAAa73E,SAC3E0iD,EAAG/W,OAAO,CACZ,GAAqB,GAAGksC,QACxB,GAAqB,GAAG73E,SAE5BjuC,EAAQ7O,IAAIm4F,MAAM,iDAAkDw8B,GAAa73E,EACrF,CACA,QACIs4E,GAAe,EACfC,GAAkB,EAClBC,EAAoBx8H,SACxB,CAdA,CAeJ,CAjCkB68H,IAGLJ,IACD1mH,EAAQ7O,IAAIm4F,MAAM,gDAAiDr7C,SA8B/E/a,iBACI,GAAIyzF,QACMC,EAAoBj+E,YAD9B,CAIAg+E,GAAkB,EAClB,IACI3mH,EAAQ7O,IAAIm4F,MAAM,iDAClB,IAAIlzE,QAAiB,GAAuBu6E,EAAI3wF,GAMhD,GALAA,EAAQ7O,IAAIm4F,MAAM,kDAAmDlzE,GACjEA,IAAa0vG,KACb1vG,QAAiB,GAAuBu6E,EAAI3wF,IAEhDA,EAAQ7O,IAAIm4F,MAAM,iDAAkDlzE,EAAU63B,GAC1E73B,IAAa63B,EACb,MAAM,IAAI6iB,GAAyB,4BAE3C,CACA,QACI41D,GAAe,EACfC,GAAkB,EAClBC,EAAoB38H,SACxB,CAlBA,CAmBJ,CApDkB88H,GAEd,CACA,QACIV,GAAc,EACdD,GAAa,EACbE,EAAgBr8H,SACpB,CACJ,CAmDA,GAlHAkiD,EAAOH,KAAO9Y,MAAOhnC,IACjB,MAAM,KAAE8/C,GAAS2kD,EAAGrX,eACdttC,EAAK9Y,kBACP,IAAI8zF,GAAW,EACf,UAAW,MAAMzxH,KAAOrJ,EAAQ,CAM5B,GAJIs6H,SACMC,EAAoB99E,QAGzB49E,QAkBKhxH,MAlBS,CACfixH,GAAkB,EAClBxmH,EAAQ7O,IAAIm4F,MAAM,mDAAoDw8B,GAAa73E,EAAU14C,EAAIgB,YACjG,MAAM0wH,EAAiB,GAAGh5E,YAEpB,IAAIlJ,GAAe/uC,WAAWsO,KAAK,CAAC,KAC1C,GAAqB,GAAGwhH,QAAkB,EAAcmB,EAAez/H,QAAS,GAAqBy/H,GAAiB1xH,GAAKyS,WAC3HhI,EAAQ7O,IAAIm4F,MAAM,mDAAoDw8B,GAAa73E,EAAU14C,EAAIgB,YACjGgwH,GAAe,EACfC,GAAkB,EAClBC,EAAoBx8H,UAEpB48H,IACKx9F,OAAM7c,IACPxM,EAAQ7O,IAAIoc,MAAM,yDAA0D0gC,EAAUzhC,EAAI,GAElG,CAIAw6G,GAAW,CACf,CAGKA,SACKH,GAEd,CAnCW3zF,GAmCP,EAuERiZ,EAAOjgD,OAAS,wBAEN26H,IACN7mH,EAAQ7O,IAAIm4F,MAAM,4CAA6Cr7C,SACxD0iD,EAAGrX,SAASptF,MACtB,CALe,GAMQ,MAApBigD,EAAOktD,UAAmB,CAC1B,MAAM6tB,EAAoB/6E,EAAOktD,UAAUl3E,KAAKgqB,GAChDA,EAAOktD,UAAYnmE,MAAOrQ,IAGjBujG,SACKS,IAAYx9F,OAAM7c,IACpBxM,EAAQ7O,IAAIoc,MAAM,iDAAkDf,EAAI,UAI1E06G,EAAkBrkG,EAAK,CAErC,CACA,GAAyB,MAArBspB,EAAOmtD,WAAoB,CAC3B,MAAM6tB,EAAqBh7E,EAAOmtD,WAAWn3E,KAAKgqB,GAClDA,EAAOmtD,WAAapmE,MAAOrQ,IAGlBujG,SACKS,IAAYx9F,OAAM7c,IACpBxM,EAAQ7O,IAAIoc,MAAM,kDAAmDf,EAAI,UAI3E26G,EAAmBtkG,EAAK,CAEtC,CACA,GAAoB,MAAhBspB,EAAOkmD,MAAe,CACtB,MAAM+0B,EAAgBj7E,EAAOkmD,MAAMlwE,KAAKgqB,GACxCA,EAAOkmD,MAAQn/D,MAAOrQ,IAGlB,MAAM45F,EAAQ,GACV+J,GACA/J,EAAMl2H,KAAKkgI,EAAoB99E,SAE/Bg+E,GACAlK,EAAMl2H,KAAKqgI,EAAoBj+E,SAE/B8zE,EAAMj1H,OAAS,QAETkjD,GAAWpoB,QAAQgpB,IAAImxE,GAAQ55F,GAAMsnB,SAI3Ci8E,GAAa,EACbC,GAAc,EACdC,EAAgBr8H,iBAGdm9H,EAAcvkG,EAAK,CAEjC,CACA,MAAO,CACHspB,SACA8B,WAER,CA/Oeo5E,CAAiBl7E,EAAQ2B,EAAU,GAAI9tC,GAElD,MAAM2wF,EAAK,GAASxkD,EAAQ,IACrBnsC,EACHqoC,cAAe09E,KAEb93E,EAAWH,EAAUz/C,QAC3B,GAAgB,MAAZ4/C,EACA,MAAM,IAAI1pD,MAAM,2CAEpByb,EAAQ7O,IAAIm4F,MAAM,6BAA8Bw8B,GAAa73E,GAC7D,MAAMq5E,EAAK,GAAqB,GAAGxB,QAC7ByB,EAAK,GAAqB,GAAGt5E,aFtDhC/a,eAAwB/tB,EAAQqiH,EAASxnH,SACtCmF,EAAOy0E,OAAO4tC,EAASxnH,EACjC,CEqDU,CAAqB2wF,EAAI,CAAC22B,EAAIC,GAAKvnH,GACzCA,EAAQ7O,IAAIm4F,MAAM,6CAClB,IAAIlzE,QAAiB,GAAuBu6E,EAAI3wF,GAShD,GARAA,EAAQ7O,IAAIm4F,MAAM,oBAAqBlzE,GAEnCA,IAAa0vG,KACb9lH,EAAQ7O,IAAIm4F,MAAM,qCAClBlzE,QAAiB,GAAuBu6E,EAAI3wF,GAC5CA,EAAQ7O,IAAIm4F,MAAM,oBAAqBlzE,IAGvCA,IAAa63B,EACb,MAAO,CAAE9B,OAAQwkD,EAAGrX,SAAUrrC,YAGlC,IAAK,MAAMA,KAAYH,EAAW,CAC9B9tC,EAAQ7O,IAAIm4F,MAAM,qBAAsBr7C,SAClC,GAAkB0iD,EAAI,GAAqB,GAAG1iD,OAAejuC,GACnEA,EAAQ7O,IAAIm4F,MAAM,qCAClB,MAAMlzE,QAAiB,GAAuBu6E,EAAI3wF,GAElD,GADAA,EAAQ7O,IAAIm4F,MAAM,6BAA8BlzE,EAAU63B,GACtD73B,IAAa63B,EACb,MAAO,CAAE9B,OAAQwkD,EAAGrX,SAAUrrC,WAEtC,CACA,MAAM,IAAI6iB,GAAyB,4BACvC,CC/FO,MAAM22D,GAAmBj+F,OAAOmL,IAAI,sBCMpC,MAAM+yF,GAITjxH,GAIA68F,WAIAxiD,WACAmnD,UACA1rD,SACAo7E,YACAC,WACAzxG,OACAgjB,OACAhoC,IAKA8sD,KAIAg9C,WAIA4sB,OACAC,OAIAC,YAKA,WAAA1yH,CAAYzD,GACR,MAAM,WAAE0hG,EAAU,WAAExiD,EAAU,UAAEpD,EAAS,MAAE2kD,EAAK,MAAEllC,EAAK,WAAE66D,GAAep2H,EACxE7L,KAAK0Q,GAAK,GAAI8N,SAASxP,OAAuB,IAAhB/F,KAAKm0B,WAAkB/2B,SAAS,MAAMmE,KAAKu2D,QACzE/gE,KAAKutG,WAAaA,EAClBvtG,KAAK+qD,WAAaA,EAClB/qD,KAAKkyG,UAAYrmG,EAAKqmG,UACtBlyG,KAAKowB,OAAS,OACdpwB,KAAKwmD,SAAW36C,EAAK26C,SACrBxmD,KAAK4hI,YAAc/1H,EAAK+1H,YACxB5hI,KAAK6hI,WAAah2H,EAAKg2H,WACvB7hI,KAAKozC,OAASvnC,EAAKunC,OACnBpzC,KAAKoL,IAAMS,EAAK8xC,OAAO8lD,aAAa,qBAAqBzjG,KAAKkyG,aAAalyG,KAAK0Q,MAC7C,MAA/B1Q,KAAKutG,WAAWz4C,cAChB90D,KAAKutG,WAAavtG,KAAKutG,WAAW74C,YAAY,QAAQ10D,KAAK+qD,eAE/D/qD,KAAKk1G,WAAavtD,EAClB3nD,KAAK8hI,OAASx1B,EACdtsG,KAAK+hI,OAAS36D,EACdpnE,KAAKgiI,YAAcC,EACnBjiI,KAAKk4D,KAAO,EAChB,CACA,CAACz0B,OAAOqB,aAAe,aACvB,CAAC48F,KAAoB,EAIrB,WAAIz5E,GACA,OAAOjoD,KAAKgiI,aAChB,CAIA,eAAMr6E,CAAUI,EAAW9tC,GACvB,GAAoB,YAAhBja,KAAKowB,OACL,MAAM,IAAIg6C,GAAuB,kCAErC,GAAoB,WAAhBpqE,KAAKowB,OACL,MAAM,IAAIi6C,GAAsB,4BAKpC,GAHK1oE,MAAM2Q,QAAQy1C,KACfA,EAAY,CAACA,IAEE,MAAf/nD,KAAKozC,SAAsD,IAApCn5B,GAAS0xF,uBAChC,MAAM,IAAIvgC,GAAuB,qDAErC,MAAMhlB,QAAepmD,KAAKk1G,WAAWntD,EAAW9tC,GAEhD,OADAmsC,EAAO8rD,UAAY,WACZ9rD,CACX,CAIA,WAAMkmD,CAAMryF,EAAU,CAAC,GACnB,GAAoB,WAAhBja,KAAKowB,QAAuC,YAAhBpwB,KAAKowB,OAArC,CAKA,GAFApwB,KAAKoL,IAAI,2BAA4BpL,KAAKutG,YAC1CvtG,KAAKowB,OAAS,UACQ,MAAlBnW,EAAQmqC,OAAgB,CACxB,MAAMA,EAASioD,YAAYzlF,QA1GjB,KA4GV3M,EAAU,IACHA,EACHmqC,SAER,CACA,IACIpkD,KAAKoL,IAAIm4F,MAAM,sCAETvjG,KAAK8hI,OAAO7nH,GAClBja,KAAKoL,IAAIm4F,MAAM,qCACfvjG,KAAKowB,OAAS,SACdpwB,KAAKwmD,SAAS8lD,MAAQ9hG,KAAKu2D,KAC/B,CACA,MAAOt6C,GACHzmB,KAAKoL,IAAIoc,MAAM,8DAA+DxnB,KAAKutG,WAAY9mF,GAC/FzmB,KAAKonE,MAAM3gD,EACf,CAtBA,CAuBJ,CACA,KAAA2gD,CAAM3gD,GACkB,WAAhBzmB,KAAKowB,SAGTpwB,KAAKoL,IAAIoc,MAAM,yCAA0CxnB,KAAKutG,WAAY9mF,GAC1EzmB,KAAKowB,OAAS,UAEdpwB,KAAK+hI,OAAOt7G,GACZzmB,KAAKowB,OAAS,SACdpwB,KAAKwmD,SAAS8lD,MAAQ9hG,KAAKu2D,MAC/B,ECtGJ,SAASmhE,GAAah6E,EAAUgqD,EAAWzqD,GACvC,IAAI06E,EAAc,EAMlB,OALA16E,EAAWQ,QAAQ96C,SAAQi5C,IACnBA,EAAO8rD,YAAcA,GAAa9rD,EAAO8B,WAAaA,GACtDi6E,GACJ,IAEGA,CACX,CACO,MAAMC,GACT75E,WACA85E,qBACAC,aACAC,sBACAC,uBACAC,wCACAC,yCACA5hI,OACAkhG,QACA,WAAA1yF,CAAYi5C,EAAY18C,GACpB7L,KAAKuoD,WAAaA,EAClBvoD,KAAKqiI,qBAAuB,IAAIx0F,IAChChiC,EAAKw2H,qBAAqBl1H,SAAQw1H,IAC9B3iI,KAAKqiI,qBAAqB/iI,IAAIqjI,EAAUz6E,SAAUy6E,EAAU,IAEhE3iI,KAAKsiI,aAAe,IAAIz0F,IACxBhiC,EAAKy2H,aAAan1H,SAAQy1H,IACtB5iI,KAAKsiI,aAAahjI,IAAIsjI,EAAM16E,SAAU06E,EAAM,IAEhD5iI,KAAKuiI,sBAAwB12H,EAAK02H,uBjDzDX,IiD0DvBviI,KAAKwiI,uBAAyB32H,EAAK22H,wBjD1DZ,IiD2DvBxiI,KAAKyiI,wCAA0C52H,EAAK42H,yCjDvDhB,IiDwDpCziI,KAAK0iI,yCAA2C72H,EAAK62H,0CjDxDjB,IiDyDpC1iI,KAAKc,OAASynD,EAAWznD,OACzBd,KAAKgiG,QAAU,CACX6gC,MAAOt6E,EAAWy5C,SAAS6X,qBAAqB,yCAChD1yF,OAAQohC,EAAWy5C,SAAS6X,qBAAqB,+CAEzD,CACA,CAACp2E,OAAOqB,aAAe,mBACvB,2BAAMg+F,CAAsBlvH,KAAWzR,GACnC,MAAM4gI,EAAgB/iI,KAAKuoD,WAAWykE,gBAAgBp5G,GACtD,GAAqB,MAAjBmvH,IAIW,UADMA,EAAcxgI,MAAMvC,KAAKuoD,WAAWykE,gBAAiB7qH,GAEtE,MAAM,IAAI2pH,GAA2B,gDAAgDl4G,IAE7F,CAIA,oBAAMovH,CAAejpB,EAAQj9E,EAAO,CAAC,GACjC,IAKI,GAJA98B,KAAKgiG,QAAQ6gC,OAAO7kC,UAAU,CAC1Bo4B,SAAS,WAEQp2H,KAAKuoD,WAAWI,kBAAkByuE,yBAAyBrd,GAE5E,MAAM,IAAIgS,GAAsB,qBAIpC,aAFM/rH,KAAK8iI,sBAAsB,wBAAyB/oB,SACvC/5G,KAAKijI,gBAAgBlpB,EAAQ,UAAWj9E,EAE/D,CACA,MAAOrW,GAIH,MAHAzmB,KAAKgiG,QAAQ76E,QAAQ62E,UAAU,CAC3Bo4B,SAAS,IAEP3vG,CACV,CACA,QACIzmB,KAAKuoD,WAAWI,kBAAkB0uE,qBACtC,CACJ,CAIA,qBAAMjd,CAAgBL,EAAQj9E,EAAO,CAAC,GAClC,IACI98B,KAAKgiG,QAAQ6gC,OAAO7kC,UAAU,CAC1Bq4B,UAAU,IAEd,MAAM6M,EAAQnpB,EAAOxM,WAAWz4C,YAChC,IAAIquE,EAKJ,OAJa,MAATD,IACAC,EAAevwC,GAAiBswC,SAC1BljI,KAAK8iI,sBAAsB,yBAA0BK,EAAcppB,UAEhE/5G,KAAKijI,gBAAgBlpB,EAAQ,WAAYj9E,EAC1D,CACA,MAAOrW,GAIH,MAHAzmB,KAAKgiG,QAAQ76E,QAAQ62E,UAAU,CAC3Bq4B,UAAU,IAER5vG,CACV,CACJ,CACA,qBAAMw8G,CAAgBlpB,EAAQ7H,EAAWp1E,GACrC,IAAIsmG,EACAr4E,EACAs4E,EACAC,EACAC,EACJ,MACMn/E,EAASusE,GAAU,CADItkB,YAAYzlF,QAAsB,YAAdsrF,EAA0BlyG,KAAKuiI,sBAAwBviI,KAAKwiI,wBAC7D1lG,EAAKsnB,SAErDtnB,EAAKsnB,OAASA,EACdpkD,KAAKuoD,WAAWy5C,SAASwhC,yBAAyBzpB,GAClDA,EAAO3uG,IAAIm4F,MAAM,qCAAsC2O,GAEvD,IAAIuxB,EAAgB1pB,EACpB,IAA6B,IAAzBj9E,GAAM4mG,eAAyB,CAC/B,MAAMC,EAAY3jI,KAAKuoD,WAAWu4D,oBACjB,MAAb6iB,IACA5pB,EAAO3uG,IAAI,+BAAgC8mG,GAC3CuxB,QAAsBE,EAAUC,QAAQ7pB,EAAQj9E,GAExD,CACA,IAGI,GADAsmG,EAAgBK,GACa,IAAzB3mG,GAAM+mG,eAAyB,CAC/B/mG,GAAM29E,aAAa,IAAIf,GAAoB,oBAAoBxH,mBAE3Dv6C,KAAMyrE,EACNr4E,aACA7C,SAAUq7E,SACW,YAAdrxB,EACLlyG,KAAK8jI,gBAAgBL,EAAe,IAC/B3mG,EACHsnB,WAEFpkD,KAAK+jI,iBAAiBN,EAAe,IAChC3mG,EACHsnB,aAER,MAAM21D,EAAS,IACR0pB,KACAL,SAEDpjI,KAAK8iI,sBAAoC,YAAd5wB,EAA0B,iCAAmC,kCAAmCnnD,EAAYgvD,EACjJ,KACK,CACD,MAAMmpB,EAAQnpB,EAAOxM,WAAWz4C,YAChC,GAAa,MAATouE,EACA,MAAM,IAAIt4D,GAAsB,GAAGsnC,4DAEvC,MAAMixB,EAAevwC,GAAiBswC,GACtCK,EAAiB,SACjBx4E,EAAao4E,CACjB,CAGA,GAAIp4E,EAAWzc,OAAOtuC,KAAKuoD,WAAWrB,QAAS,CAC3C,MAAMzgC,EAAM,IAAIkkD,GAAmB,qBAEnC,MADAovC,EAAO3yC,MAAM3gD,GACPA,CACV,CAEA,GADA48G,EAAeD,EACW,MAAtBtmG,GAAMwmG,aACNA,EAAexmG,EAAKwmG,kBAEnB,GAAItjI,KAAKsiI,aAAa7jI,KAAO,EAAG,CACjCq+B,GAAM29E,aAAa,IAAIf,GAAoB,sBAAsBxH,iBAEjE,MAAM8xB,QAAmC,YAAd9xB,EACrBlyG,KAAKikI,kBAAkB,IAClBR,KACAL,GACJpjI,KAAKsiI,aAAcxlG,GACpB98B,KAAKkkI,mBAAmB,IACnBT,KACAL,GACJpjI,KAAKsiI,aAAcxlG,IAC1BwmG,EAAeU,EAAYV,aAC3BD,EAAeW,EAAY59E,MAC/B,CACJ,CACA,MAAO3/B,GAEH,MADAszF,EAAO3uG,IAAIoc,MAAM,kDAAiE,YAAd0qF,EAA0B,OAAS,KAAM6H,EAAOxM,WAAY9mF,GAC1HA,CACV,CACA,QACI29B,EAAO7kD,OACX,CAGA,aAFMS,KAAK8iI,sBAAoC,YAAd5wB,EAA0B,gCAAkC,iCAAkCnnD,EAAYgvD,GAC3IA,EAAO3uG,IAAI,sCAAuC8mG,GAC3ClyG,KAAKmkI,kBAAkB,CAC1BZ,iBACArxB,YACA6H,SACAspB,eACAC,eACAv4E,aACA3X,OAAQtW,GAAMsW,QAEtB,CAIA,iBAAA+wF,CAAkBrnG,GACd,MAAM,eAAEymG,EAAc,UAAErxB,EAAS,OAAE6H,EAAM,aAAEspB,EAAY,WAAEt4E,EAAU,aAAEu4E,EAAY,OAAElwF,GAAWtW,EAC9F,IAAI8lG,EACAj7E,EACAF,EACgB,MAAhB67E,IAEAV,EAAQU,EAAa3tB,kBAAkB,CACnCzD,YAEAqD,iBAAkB6uB,IACI,MAAd38E,GAGClrB,QAAQr4B,UACRq/B,MAAK4J,UACN,MAAM4a,EAAY/nD,KAAKuoD,WAAWoT,UAAUsN,eACtC7kB,EAASioD,YAAYzlF,QAAQ5mB,KAAKyiI,0CAElC,OAAEr8E,EAAM,SAAE8B,SAAmB,GAAWk8E,EAAar8E,EAAW,CAClE3D,SACAh5C,IAAKg5H,EAAYh5H,IACjBqoF,YAAY,IAEhB,GAAkB,MAAdhsC,EACA,OAEJA,EAAWr8C,IAAI,+BAAgC88C,GAC/C,MAAMm8E,EAhQ9B,SAAiCn8E,EAAUyT,GACvC,IACI,MAAM,QAAE1hD,GAAY0hD,EAAU6iE,WAAWt2E,GACzC,OAAOjuC,EAAQkwC,iBACnB,CACA,MAAO1jC,GACH,GAAiB,2BAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,OnBhBuC,EmBiB3C,CAqP8C69G,CAAwBp8E,EAAUloD,KAAKuoD,WAAWoT,WAExE,GADoBumE,GAAah6E,EAAU,UAAWT,KAClC48E,EAAe,CAC/B,MAAM59G,EAAM,IAAI4kD,GAAmC,mDAAmDnjB,cAAqBm8E,KAE3H,MADAD,EAAYh9D,MAAM3gD,GACZA,CACV,CAGA29G,EAAYj+H,OAASigD,EAAOjgD,OAC5Bi+H,EAAYn+E,KAAOG,EAAOH,KAC1Bm+E,EAAYl8E,SAAWA,EAEE,MAArB9B,EAAOmtD,aACP6wB,EAAY7wB,WAAantD,EAAOmtD,YAGZ,MAApBntD,EAAOktD,YACP8wB,EAAY9wB,UAAYltD,EAAOktD,WAGf,MAAhBltD,EAAOkmD,QACP83B,EAAY93B,MAAQlmD,EAAOkmD,aAIzBtsG,KAAKuoD,WAAW2N,UAAU7yC,MAAM0nC,EAAY,CAC9ChD,UAAW,CAACG,KAEhBloD,KAAKuoD,WAAWy5C,SAASuiC,oBAAoBH,EAAa38E,GAC1DznD,KAAKwkI,UAAU,CAAE/8E,aAAYrB,OAAQg+E,EAAal8E,YAAW,IAE5D5kB,OAAM6J,MAAO1mB,IACdghC,EAAWr8C,IAAIoc,MAAM,4CAA6C48G,EAAY1zH,GAAI+V,GAChD,MAA9B29G,EAAY59E,SAAS8lD,aACf83B,EAAY93B,OACtB,GACF,IAGV3kD,EAAYxa,MAAO4a,EAAW9tC,EAAU,CAAC,KACrC,GAAa,MAAT2oH,EACA,MAAM,IAAI5W,GAAsB,iCAEpCvkE,EAAWr8C,IAAIm4F,MAAM,uCAAwCx7C,GAC7D,MAAMq8E,QAAoBxB,EAAMj7E,YAChCF,EAAWr8C,IAAIm4F,MAAM,yCAA0C6gC,EAAY1zH,GAAIq3C,GAC/E,IACI,GAAsB,MAAlB9tC,EAAQmqC,OAAgB,CACxBggF,EAAYh5H,IAAI,oGAAqG28C,GACrH,MAAM3D,EAASioD,YAAYzlF,QAAQ5mB,KAAK0iI,0CAExCzoH,EAAU,IACHA,EACHmqC,SAER,CACAggF,EAAYh5H,IAAIm4F,MAAM,uCAAwCx7C,GAC9D,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWk8E,EAAar8E,EAAW,IAC/D9tC,EACH7O,IAAKg5H,EAAYh5H,IACjBqoF,YAAY,IAEhB2wC,EAAYh5H,IAAIm4F,MAAM,uBAAwBr7C,GAC9C,MAAMu8E,EApT1B,SAAiCv8E,EAAUyT,EAAW1hD,EAAU,CAAC,GAC7D,IACI,MAAM,QAAEA,GAAY0hD,EAAU6iE,WAAWt2E,GACzC,GAAkC,MAA9BjuC,EAAQuxF,mBACR,OAAOvxF,EAAQuxF,kBAEvB,CACA,MAAO/kF,GACH,GAAiB,2BAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,OAAOxM,EAAQuxF,oBnB7ByB,EmB8B5C,CAuS0Ck5B,CAAwBx8E,EAAUloD,KAAKuoD,WAAWoT,UAAW1hD,GAC7EkoH,EAAcD,GAAah6E,EAAU,WAAYT,GACvD,GAAI06E,GAAesC,EAAe,CAC9B,MAAMh+G,EAAM,IAAI6kD,GAAoC,oDAAoDpjB,QAAei6E,KAAesC,KAEtI,MADAL,EAAYh9D,MAAM3gD,GACZA,CACV,CAwBA,aArBMzmB,KAAKuoD,WAAW2N,UAAU7yC,MAAM0nC,EAAY,CAC9ChD,UAAW,CAACG,KAIhBk8E,EAAYj+H,OAASigD,EAAOjgD,OAC5Bi+H,EAAYn+E,KAAOG,EAAOH,KAC1Bm+E,EAAYl8E,SAAWA,EAEE,MAArB9B,EAAOmtD,aACP6wB,EAAY7wB,WAAantD,EAAOmtD,YAGZ,MAApBntD,EAAOktD,YACP8wB,EAAY9wB,UAAYltD,EAAOktD,WAGf,MAAhBltD,EAAOkmD,QACP83B,EAAY93B,MAAQlmD,EAAOkmD,OAE/BtsG,KAAKuoD,WAAWy5C,SAASuiC,oBAAoBH,EAAa38E,GACnD28E,CACX,CACA,MAAO39G,GAKH,MAJAghC,EAAWr8C,IAAIoc,MAAM,iFAAgG,YAAd0qF,EAA0B,OAAS,KAAMp1E,EAAKi9E,OAAOxM,WAAYxlD,EAAWthC,GACjJ,MAA9B29G,EAAY59E,SAAS8lD,OACrB83B,EAAYh9D,MAAM3gD,GAEhBA,CACV,GAGC8V,QAAQgpB,IAAI,CACbq9E,EAAM38E,KAAKo9E,EAAal9H,QACxBk9H,EAAap9E,KAAK28E,EAAMz8H,UACzBm9B,OAAM7c,IACLghC,EAAWr8C,IAAIoc,MAAM,uCAAwCf,EAAI,KAGzE,MAAMk+G,EAAY5qB,EAAOvzD,SD9O1B,IAA0B36C,EC4SzB,OA7DAkuG,EAAOvzD,SAAW,IAAIo+E,MAAMD,EAAW,CACnCrlI,IAAK,IAAI6C,KACW,UAAZA,EAAK,IAA6B,MAAXA,EAAK,IAAiC,MAAnBwiI,EAAUr4B,OAEpD,WACI,IAC8B,SAAtB7kD,EAAWr3B,cACLq3B,EAAW6kD,OAEzB,CACA,MAAO7lF,GACHghC,EAAWr8C,IAAIoc,MAAM,mDAAoDf,EAC7E,CACA,QACIzmB,KAAKc,OAAO8rD,kBAAkB,mBAAoB,CAC9C9E,OAAQL,GAEhB,CACH,EAdD,GAcKnkB,OAAM7c,IACPghC,EAAWr8C,IAAIoc,MAAM,2DAA4Df,EAAI,IAGtFo+G,QAAQvlI,OAAO6C,MAG9B43G,EAAOvzD,SAASs+E,SAAWt6H,KAAKu2D,MDxQPl1D,EC6QK,CAC1B0hG,WAAYwM,EAAOxM,WACnBxiD,aACA36B,OAAQ,OACR8hF,YACA1rD,SAAUuzD,EAAOvzD,SACjBo7E,YAAagB,GAAO16E,SACpB25E,WAAY0B,EACZnwF,SACAuK,OAAQ39C,KAAKuoD,WAAW5K,OACxBgK,UAAWA,GAdqB,MAChC,MAAM,IAAIqkE,GAAsB,gCAAgC,GAchEiW,WAAY,IACDW,GAAO36E,SAAW,GAE7BqkD,MAAOn/D,MAAOlzB,UAEJ2oH,GAAOt2B,MAAMryF,UAEb8/F,EAAOzN,MAAMryF,EAAQ,EAE/BmtD,MAAQ3gD,IACJszF,EAAO3yC,MAAM3gD,GAEbm8G,GAAOx7D,MAAM3gD,EAAI,GAvBzBghC,ED5QG,IAAIk6E,GAAe91H,GCsStB7L,KAAKc,OAAO8rD,kBAAkB,kBAAmB,CAC7C9E,OAAQL,IAGZA,EAAWs9E,iBAAmBJ,EACvBl9E,CACX,CAIA,SAAA+8E,CAAU1nG,GACN,MAAM,WAAE2qB,EAAU,OAAErB,EAAM,SAAE8B,GAAaprB,GACnC,QAAE2mC,EAAO,QAAExpD,GAAYja,KAAKuoD,WAAWoT,UAAU6iE,WAAWt2E,GAClE,GAAyB,MAArBT,EAAWrU,SAAqD,IAAnCn5B,EAAQ0xF,uBACrC,MAAM,IAAIvgC,GAAuB,qDAErC3H,EAAQ,CAAEhc,aAAYrB,UAC1B,CAIA,qBAAM09E,CAAgBr8E,EAAYxtC,GAC9B,MAAM8tC,EAAYpmD,MAAM4c,KAAKve,KAAKqiI,qBAAqBn9H,QACvD,IACI,MAAM,OAAEkhD,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D9tC,EACH7O,IAAKq8C,EAAWr8C,MAEdu3H,EAAY3iI,KAAKqiI,qBAAqBjjI,IAAI8oD,GAChD,GAAiB,MAAby6E,EACA,MAAM,IAAI1W,GAAsB,8BAA8B/jE,KAGlE,OADAT,EAAWr8C,IAAI,+CAAgDq8C,EAAW8lD,WAAYrlD,GAC/E,UACMy6E,EAAUv/B,cAAch9C,EAAQnsC,GACzCiuC,WAER,CACA,MAAOzhC,GAEH,MADAghC,EAAWr8C,IAAIoc,MAAM,+CAAgDigC,EAAW8lD,WAAY9mF,GACtF,IAAIwlG,GAAsBxlG,EAAIja,QACxC,CACJ,CAKA,sBAAMu3H,CAAiBt8E,EAAYxtC,GAC/B,MAAM8tC,EAAYpmD,MAAM4c,KAAKve,KAAKqiI,qBAAqBn9H,QACvD,IACIuiD,EAAWr8C,IAAIm4F,MAAM,8BAA+Bx7C,GACpD,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D9tC,EACH7O,IAAKq8C,EAAWr8C,IAChBqoF,YAAY,IAEVkvC,EAAY3iI,KAAKqiI,qBAAqBjjI,IAAI8oD,GAChD,GAAiB,MAAby6E,EACA,MAAM,IAAI1W,GAAsB,8BAA8B/jE,KAGlE,OADAT,EAAWr8C,IAAI,gDAAiDq8C,EAAW8lD,WAAYrlD,GAChF,UACMy6E,EAAU7/B,eAAe18C,EAAQnsC,GAC1CiuC,WAER,CACA,MAAOzhC,GAEH,MADAghC,EAAWr8C,IAAIoc,MAAM,8CAA+CigC,EAAW8lD,WAAY9mF,GACrF,IAAIwlG,GAAsBxlG,EAAIja,QACxC,CACJ,CAKA,wBAAM03H,CAAmBz8E,EAAYu9E,EAAQ/qH,GACzC,MAAM8tC,EAAYpmD,MAAM4c,KAAKymH,EAAO9/H,QACpCuiD,EAAWr8C,IAAI,8BAA+B28C,GAC9C,IACIN,EAAWr8C,IAAIm4F,MAAM,iCAAkCx7C,GACvD,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D9tC,EACH7O,IAAKq8C,EAAWr8C,IAChBqoF,YAAY,IAIhB,OAFAhsC,EAAWr8C,IAAI,gCAAiC88C,GAEzC,CAAE9B,SAAQk9E,aADI0B,EAAO5lI,IAAI8oD,GAEpC,CACA,MAAOzhC,GAEH,MADAghC,EAAWr8C,IAAIoc,MAAM,yCAA0Cf,GACzD,IAAIulG,GAAsBh9G,OAAOyX,GAC3C,CACJ,CAKA,uBAAMw9G,CAAkBx8E,EAAYu9E,EAAQ/qH,GACxC,MAAM8tC,EAAYpmD,MAAM4c,KAAKymH,EAAO9/H,QACpCuiD,EAAWr8C,IAAI,6BAA8B28C,GAC7C,IACI,MAAM,OAAE3B,EAAM,SAAE8B,SAAmB,GAAWT,EAAYM,EAAW,IAC9D9tC,EACH7O,IAAKq8C,EAAWr8C,MAGpB,MAAO,CAAEg7C,SAAQk9E,aADI0B,EAAO5lI,IAAI8oD,GAEpC,CACA,MAAOzhC,GAEH,MADAghC,EAAWr8C,IAAIoc,MAAM,wCAAyCf,GACxD,IAAIulG,GAAsBh9G,OAAOyX,GAC3C,CACJ,EC7gBG,MAAMw+G,WAAex4E,GACxBvF,OACAgP,UACAgvE,eACAhS,YACAlxB,QACA/rC,SACAtY,OACAvtB,OACAm4B,WACAn9C,IACA,WAAAkE,CAAYzD,GACRukC,QACApwC,KAAKowB,OAAS,UAGd,MAAMtvB,EAAS,IAAI2rD,GACb04E,EAAmBrkI,EAAO6rD,cAAcvwB,KAAKt7B,GACnDA,EAAO6rD,cAAiBrsD,IACpB,MAAM8kI,EAAiBD,EAAiB7kI,GAClC+kI,EAAiBrlI,KAAK2sD,cAAc,IAAIE,YAAYvsD,EAAI6E,KAAM,CAAE2iD,OAAQxnD,EAAIwnD,UAClF,OAAOs9E,GAAkBC,CAAc,EAI3CrlI,KAAKknD,OAASr7C,EAAKq7C,OACnBlnD,KAAK29C,OAAS9xC,EAAK8xC,QAAU6jE,KAC7BxhH,KAAKoL,IAAMpL,KAAK29C,OAAO8lD,aAAa,UAEpCzjG,KAAKi2D,SAAW,CAAC,EAEjB,MAAM1N,EAAavoD,KAAKuoD,WzDWzB,SAA2B18C,EAAO,CAAC,GACtC,MAAM08C,EAAa,IAAI4jE,GAAkBtgH,GAuBzC,OAtBc,IAAI+4H,MAAMr8E,EAAY,CAChC,GAAAnpD,CAAI8qB,EAAQvc,EAAM+yD,GACd,GAAoB,iBAAT/yD,IAAsBi/G,GAAuB5hG,SAASrd,GAAO,CACpE,MAAMyd,EAAUm9B,EAAWA,WAAW56C,GACtC,GAAe,MAAXyd,IAAoBuhG,GAAkB3hG,SAASrd,GAC/C,MAAM,IAAI09G,GAAoB,GAAG19G,aAErC,OAAOyd,CACX,CACA,OAAOy5G,QAAQzlI,IAAI8qB,EAAQvc,EAAM+yD,EACrC,EACAphE,IAAG,CAAC4qB,EAAQvc,EAAM3O,KACM,iBAAT2O,EACP46C,EAAWA,WAAW56C,GAAQ3O,EAG9B6lI,QAAQvlI,IAAI4qB,EAAQvc,EAAM3O,IAEvB,IAKnB,CyDpC6CsmI,CAAkB,CACnDp+E,OAAQr7C,EAAKq7C,OACbwmB,WAAY7hE,EAAK6hE,WACjBk+B,SAAU//F,EAAK+/F,UAAY,CACvB7qG,KCxDI,SDyDJwsC,QC1DO,SD4DXoQ,OAAQ39C,KAAK29C,OACb78C,SACA2mH,UAAW57G,EAAK47G,WAAa,IAAI2C,GACjC4C,gBAAiBA,GAAgBnhH,EAAKmhH,iBACtC/V,IAAKprG,EAAKorG,MAEdj3G,KAAKk2D,UAAYl2D,KAAKulI,mBAAmB,YtE6G1C,SAA6Bh9E,EAAY18C,EAAO,CAAC,GACpD,OAAO,IAAIq9G,GAAoB3gE,EAAY18C,EAC/C,CsE/G8D25H,CAAoBj9E,EAAY,CAClF6+D,cAAepnH,KAAKuoD,WAAWykE,gBAAgBU,0BAC5C7hH,EAAKqqD,aAGQ,MAAhBrqD,EAAKm2F,UACLhiG,KAAKgiG,QAAUhiG,KAAKulI,mBAAmB,UAAW15H,EAAKm2F,QAAQhiG,KAAKuoD,cAExEA,EAAWznD,OAAOyjD,iBAAiB,eAAejkD,IAE9C,GAA2B,MAAvBA,EAAIwnD,OAAO4gE,SAAkB,CAC7B,MAAMxvD,EAAW,CACbxoD,GAAIpQ,EAAIwnD,OAAOD,KAAKn3C,GACpB01F,WAAY9lG,EAAIwnD,OAAOD,KAAKk/C,UAAUziG,KAAIqc,GAAKA,EAAEmmF,aAErDv+C,EAAWznD,OAAO8rD,kBAAkB,iBAAkB,CAAE9E,OAAQoR,GACpE,KAG4B,MAA5BrtD,EAAKi1G,qBACL9gH,KAAKulI,mBAAmB,sBAAuB15H,EAAKi1G,oBAAoBv4D,IAG5EvoD,KAAKuoD,WAAW4xD,SAAW,IAAIioB,GAAgBpiI,KAAKuoD,WAAY,CAC5D85E,sBAAuBx2H,EAAKw2H,sBAAwB,IAAI/9H,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKulI,mBAAmB,yBAAyB16H,IAAShL,EAAGG,KAAKuoD,eAC7I+5E,cAAez2H,EAAKy2H,cAAgB,IAAIh+H,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKulI,mBAAmB,iBAAiB16H,IAAShL,EAAGG,KAAKuoD,eACrHg6E,sBAAuB12H,EAAK88C,mBAAmB45E,sBAC/CC,uBAAwB32H,EAAK88C,mBAAmB65E,yBAGpDxiI,KAAKulI,mBAAmB,mBAAoB,IAAIpG,GAAwBn/H,KAAKuoD,WAAY18C,EAAK40G,mBAE9FzgH,KAAKulI,mBAAmB,oBAAqB,IAAInQ,GAAyBp1H,KAAKuoD,WAAY18C,EAAK88C,qBACxD,IAApC98C,EAAK45H,mBAAmBp7H,SAExBrK,KAAKulI,mBAAmB,oBAAqB,IAAIlM,GAAkBr5H,KAAKuoD,WAAY18C,EAAK45H,oBAG7FzlI,KAAKulI,mBAAmB,YAAa,IAAIpH,GAAiBn+H,KAAKuoD,aAE/DvoD,KAAKulI,mBAAmB,iBAAkB,IAAI/a,GAAsBxqH,KAAKuoD,WAAY18C,EAAKk7F,YAE1F,MAAM2+B,GAAe75H,EAAK65H,aAAe,IAAIphI,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKulI,mBAAmB,eAAe16H,IAAShL,EAAGG,KAAKuoD,eACxHvoD,KAAKkzH,YAAclzH,KAAKuoD,WAAW2qE,YAAclzH,KAAKulI,mBAAmB,cAAe,IAAI5I,GAAmB38H,KAAKuoD,WAAY,CAC5HwxE,QAAS2L,KAGb,MAAMC,GAAkB95H,EAAK85H,gBAAkB,IAAIrhI,KAAI,CAACzE,EAAIgL,IAAU7K,KAAKulI,mBAAmB,kBAAkB16H,IAAShL,EAAGG,KAAKuoD,eAiBjI,GAhBAvoD,KAAKklI,eAAiBllI,KAAKuoD,WAAW28E,eAAiBllI,KAAKulI,mBAAmB,iBAAkB,IAAIzL,GAAuB95H,KAAKuoD,WAAY,CACzIwxE,QAAS4L,KAGb3lI,KAAKulI,mBAAmB,aAAc,IAAI5H,GAAW39H,KAAKuoD,cACzD18C,EAAK+5H,eAAiB,IAAIz4H,SAAQ,CAACtN,EAAIgL,KACpB7K,KAAKulI,mBAAmB,kBAAkB16H,IAAShL,EAAGG,KAAKuoD,aACnEhE,iBAAiB,QAASjkD,IAC9BN,MAAK,EAAiBM,EAAI,GAC5B,IAGNuL,EAAKuzH,YAAYjyH,SAAQ,CAACtN,EAAIgL,KAC1B7K,KAAKuoD,WAAWk4D,iBAAiBzjG,IAAIhd,KAAKulI,mBAAmB,aAAa16H,IAAShL,EAAGG,KAAKuoD,aAAa,IAGvF,MAAjB18C,EAAKoqD,SACL,IAAK,MAAMl1D,KAAQpC,OAAOuG,KAAK2G,EAAKoqD,UAAW,CAC3C,MACM7qC,GAAUy6G,EADMh6H,EAAKoqD,SAASl1D,IACNf,KAAKuoD,YACpB,MAAXn9B,GAIJprB,KAAKi2D,SAASl1D,GAAQqqB,EACtBprB,KAAKulI,mBAAmBxkI,EAAMqqB,GACO,MAAjCA,EAAQ41F,MACRhhH,KAAKoL,IAAI,6CAA8CrK,GACvD4kI,EAAenlI,KAAK4qB,EAAQ41F,MAEE,MAA9B51F,EAAQ61F,MACRjhH,KAAKoL,IAAI,0CAA2CrK,GACpD2kI,EAAYllI,KAAK4qB,EAAQ61F,MAEO,MAAhC71F,EAAQ64E,MACRjkG,KAAKoL,IAAI,4CAA6CrK,GACtDqqB,EAAQ64E,IAAqB1/C,mBAAmB,QAASjkD,IACrDN,MAAK,EAAiBM,EAAI,MAhB9BN,KAAKoL,IAAIoc,MAAM,yDAA0DzmB,EAmBjF,EzDhEL,SAAkCwnD,GACrC,MAAM6pC,EAAsB,CAAC,EAC7B,IAAK,MAAMhnE,KAAWzsB,OAAOsE,OAAOslD,EAAWA,YAC3C,IAAK,MAAMu9E,KAAcjZ,GAAuBzhG,GAC5CgnE,EAAoB0zC,IAAc,EAG1C,IAAK,MAAM16G,KAAWzsB,OAAOsE,OAAOslD,EAAWA,YAC3C,IAAK,MAAMu9E,KAAchZ,GAAuB1hG,GAC5C,IAAwC,IAApCgnE,EAAoB0zC,GACpB,MAAM,IAAIxa,GAA8B,YAAYyB,GAAe3hG,4BAAkC06G,qHAIrH,CyDqDQC,CAAyBx9E,EAC7B,CACA,kBAAAg9E,CAAmBxkI,EAAMilI,GAMrB,OALiB,MAAbA,GACAhmI,KAAKoL,IAAIoc,MAAM,qCAAsCzmB,GAGzDf,KAAKuoD,WAAWxnD,GAAQilI,EACjBA,CACX,CAIA,WAAMh/H,GACF,GAAoB,YAAhBhH,KAAKowB,OAAT,CAGApwB,KAAKowB,OAAS,WACdpwB,KAAKoL,IAAI,sBACT,UACUpL,KAAKuoD,WAAWgkE,uBAChBvsH,KAAKuoD,WAAWvhD,cAChBhH,KAAKuoD,WAAWikE,gBACtBxsH,KAAKowB,OAAS,UACdpwB,KAAK4sD,kBAAkB,QAAS,CAAE9E,OAAQ9nD,OAC1CA,KAAKoL,IAAI,qBACb,CACA,MAAOqb,GAKH,MAJAzmB,KAAKoL,IAAIoc,MAAM,oCAAqCf,GAEpDzmB,KAAKowB,OAAS,gBACRpwB,KAAKsmB,OACLG,CACV,CAjBA,CAkBJ,CAIA,UAAMH,GACkB,YAAhBtmB,KAAKowB,SAGTpwB,KAAKoL,IAAI,sBACTpL,KAAKowB,OAAS,iBACRpwB,KAAKuoD,WAAWkkE,sBAChBzsH,KAAKuoD,WAAWjiC,aAChBtmB,KAAKuoD,WAAWmkE,eACtB1sH,KAAKowB,OAAS,UACdpwB,KAAK4sD,kBAAkB,OAAQ,CAAE9E,OAAQ9nD,OACzCA,KAAKoL,IAAI,sBACb,CACA,cAAAy7C,CAAeK,GACX,OAAOlnD,KAAKuoD,WAAWI,kBAAkB9B,eAAeK,EAC5D,CACA,YAAAowE,GACI,OAAOt3H,KAAKuoD,WAAWI,kBAAkB2uE,cAC7C,CACA,QAAAt+D,GACI,MAAMitE,EAAU,IAAIpkB,GACpB,IAAK,MAAMlqD,KAAQ33D,KAAKuoD,WAAWI,kBAAkB9B,iBACjDo/E,EAAQjpH,IAAI26C,EAAK5M,YAErB,OAAOppD,MAAM4c,KAAK0nH,EACtB,CACA,UAAMrsE,CAAK/R,EAAM5tC,EAAU,CAAC,GACxB,OAAOja,KAAKuoD,WAAWI,kBAAkB89C,eAAe5+C,EAAM,CAE1D8zD,SAAU,MACP1hG,GAEX,CACA,kBAAMigD,CAAarS,EAAME,EAAW9tC,EAAU,CAAC,GAC3C,GAAiB,MAAb8tC,EACA,MAAM,IAAI,GAAuB,+CAGrC,GAAyB,KADzBA,EAAYpmD,MAAM2Q,QAAQy1C,GAAaA,EAAY,CAACA,IACtCtmD,OACV,MAAM,IAAI,GAAuB,+CAGrC,aADyBzB,KAAK45D,KAAK/R,EAAM5tC,IACvB0tC,UAAUI,EAAW9tC,EAC3C,CACA,aAAAisH,GACI,OAAOlmI,KAAKuoD,WAAWgjD,eAAe8B,cAC1C,CACA,YAAApkC,GACI,OAAOjpE,KAAKuoD,WAAWoT,UAAUsN,cACrC,CACA,YAAM1R,CAAO1P,EAAM5tC,EAAU,CAAC,GACtB05C,GAAY9L,KACZA,EAAO+qC,GAAiB/qC,EAAKiN,aAAe,WAE1C90D,KAAKuoD,WAAWI,kBAAkBwuE,iBAAiBtvE,EAAM5tC,EACnE,CACA,kBAAMqoE,CAAaz6B,EAAM5tC,EAAU,CAAC,GAEhC,GADAja,KAAKoL,IAAI,kBAAmBy8C,GACN,MAAlBA,EAAK8kB,UACL,OAAO9kB,EAAK8kB,UAEhB,IACI,MAAMzT,QAAiBl5D,KAAKk2D,UAAU92D,IAAIyoD,GAC1C,GAA6B,MAAzBqR,EAASxoD,GAAGi8D,UACZ,OAAOzT,EAASxoD,GAAGi8D,SAE3B,CACA,MAAOlmD,GACH,GAAiB,kBAAbA,EAAI1lB,KACJ,MAAM0lB,CAEd,CACA,MAAM0/G,EAAU,GAAiB,CAC7B,GAAqB,QACrBt+E,EAAKklB,cAAcj+D,QAKjB69D,EAAYqlB,SAFEhyF,KAAKklI,eAAe9lI,IAAI+mI,EAASlsH,IAMrD,aAHMja,KAAKk2D,UAAU62C,MAAMllD,EAAM,CAC7B8kB,cAEGA,CACX,CACA,YAAM1iB,CAAOlC,EAAW0b,EAASxpD,GACxBtY,MAAM2Q,QAAQy1C,KACfA,EAAY,CAACA,UAEXxrB,QAAQgpB,IAAIwC,EAAUzjD,KAAI6oC,MAAO+a,UAC7BloD,KAAKuoD,WAAWoT,UAAU1R,OAAO/B,EAAUub,EAASxpD,EAAQ,IAE1E,CACA,cAAMgyF,CAASlkD,GACNpmD,MAAM2Q,QAAQy1C,KACfA,EAAY,CAACA,UAEXxrB,QAAQgpB,IAAIwC,EAAUzjD,KAAI6oC,MAAO+a,UAC7BloD,KAAKuoD,WAAWoT,UAAUswC,SAAS/jD,EAAS,IAE1D,CACA,cAAMw2E,CAASx2E,EAAUy2E,GACrB,OAAO3+H,KAAKuoD,WAAWoT,UAAU+iE,SAASx2E,EAAUy2E,EACxD,CACA,UAAAC,CAAWluH,GACP1Q,KAAKuoD,WAAWoT,UAAUijE,WAAWluH,EACzC,CACA,gBAAMqjH,CAAWjtB,EAAW7sF,EAAU,CAAC,GACnC,OAAOja,KAAKuoD,WAAWI,kBAAkBorE,WAAWjtB,EAAW7sF,EACnE,CAKA,GAAiB3Z,GACb,MAAQwnD,OAAQD,GAASvnD,EACrBunD,EAAKn3C,GAAGrK,aAAerG,KAAKknD,OAAO7gD,WAIlCrG,KAAKuoD,WAAW2N,UAAU7yC,MAAMwkC,EAAKn3C,GAAI,CAC1C01F,WAAYv+C,EAAKu+C,aAEhB9iE,OAAM7c,IAASzmB,KAAKoL,IAAIoc,MAAMf,EAAI,IANnCzmB,KAAKoL,IAAIoc,MAAM,2CAOvB,EE/TG,SAAS4+G,KACZ,IACI,OAAO,CACX,CACA,MAAOvgE,GAEH,OAAO,CACX,CACJ,CCJO,MAIM,GAA6B,YAG7BwgE,GAA4B,CACrCj+D,MAAO,EACPv7D,OAAQ,EACR4xD,UAAW,kECZf,MAAM,GAAMx4B,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACb,GAAMA,OAAO,GACbs3C,GAAQ5+E,OAAOmd,OAAO,CACxB6E,EAAG,GACHC,EAAGqlB,OAAO,GACVmxC,EAAGnxC,OAAO,sEACVzyB,EAAGyyB,OAAO,sEACVnwB,EAAG,GACH8lE,GAAI31C,OAAO,iFACX41C,GAAI51C,OAAO,iFACXmjD,KAAMnjD,OAAO,wEAEX,GAAa,CAACtlB,EAAGC,KAAOD,EAAIC,EAAI,IAAOA,EACvCuoE,GAAO,CACTC,KAAMnjD,OAAO,sEACb,WAAAojD,CAAY3wD,GACR,MAAM,EAAEllB,GAAM+pE,GACRz7E,EAAKmkC,OAAO,sCACZvvB,GAAM,GAAMuvB,OAAO,sCACnBlkC,EAAKkkC,OAAO,uCACZtvB,EAAK7U,EACLsuF,EAAYnqD,OAAO,uCACnBjwB,EAAK,GAAWW,EAAK+hB,EAAGllB,GACxByC,EAAK,IAAYS,EAAKgiB,EAAGllB,GAC/B,IAAIk3E,EAAK,GAAIhyD,EAAI1iB,EAAKlU,EAAKmU,EAAKlU,EAAIyR,GAChCo3E,EAAK,IAAK50E,EAAKU,EAAKT,EAAKU,EAAInD,GACjC,MAAMi3E,EAAQC,EAAK0F,EACbzF,EAAQC,EAAKwF,EAKnB,GAJI3F,IACAC,EAAKl3E,EAAIk3E,GACTC,IACAC,EAAKp3E,EAAIo3E,GACTF,EAAK0F,GAAaxF,EAAKwF,EACvB,MAAM,IAAI5xF,MAAM,2CAA6Ck6B,GAEjE,MAAO,CAAE+xD,QAAOC,KAAIC,QAAOC,KAC/B,GAQJ,SAAS,GAAYz1E,GACjB,MAAM,EAAEwL,EAAC,EAAEC,GAAM28D,GACXkM,EAAK,GAAIt0E,EAAIA,GACbu0E,EAAK,GAAID,EAAKt0E,GACpB,OAAO,GAAIu0E,EAAK/oE,EAAIxL,EAAIyL,EAC5B,CACA,MAAM0lH,GAAmB/oD,GAAM58D,IAAM,GACrC,MAAM4lH,WAAiB/nI,MACnB,WAAA8Q,CAAY9C,GACR4jC,MAAM5jC,EACV,EAEJ,SAASg6H,GAAej4F,GACpB,KAAMA,aAAiBk4F,IACnB,MAAM,IAAIrmI,UAAU,yBAC5B,CACA,MAAMqmI,GACF,WAAAn3H,CAAY6F,EAAG23D,EAAG4R,GACd1+E,KAAKmV,EAAIA,EACTnV,KAAK8sE,EAAIA,EACT9sE,KAAK0+E,EAAIA,CACb,CACA,iBAAOe,CAAW/gD,GACd,KAAMA,aAAa,IACf,MAAM,IAAIt+B,UAAU,4CAExB,OAAIs+B,EAAE4P,OAAO,GAAM2nC,MACRwwD,GAAcxwD,KAClB,IAAIwwD,GAAc/nG,EAAEvpB,EAAGupB,EAAEouC,EAAG,GACvC,CACA,oBAAO45D,CAAcjsD,GACjB,MAAMkF,EAmlBd,SAAqBzH,EAAMx5C,EAAI6+C,GAAMnG,GACjC,MAAMuvD,EAAU,IAAIhlI,MAAMu2E,EAAKz2E,QAOzB22E,EAAW,GANMF,EAAK5tC,QAAO,CAAC6Q,EAAK3O,EAAKjrC,IACtCirC,IAAQ,GACD2O,GACXwrF,EAAQplI,GAAK45C,EACN,GAAIA,EAAM3O,EAAK9N,KACvB,IACqCA,GAOxC,OANAw5C,EAAKG,aAAY,CAACl9B,EAAK3O,EAAKjrC,IACpBirC,IAAQ,GACD2O,GACXwrF,EAAQplI,GAAK,GAAI45C,EAAMwrF,EAAQplI,GAAIm9B,GAC5B,GAAIyc,EAAM3O,EAAK9N,KACvB05C,GACIuuD,CACX,CAnmBsB1uD,CAAYwC,EAAOn2E,KAAKo6B,GAAMA,EAAEggD,KAC9C,OAAOjE,EAAOn2E,KAAI,CAACo6B,EAAGn9B,IAAMm9B,EAAE8gD,SAASG,EAAMp+E,KACjD,CACA,iBAAOm+E,CAAWjF,GACd,OAAOgsD,GAAcC,cAAcjsD,GAAQn2E,IAAImiI,GAAchnD,WACjE,CACA,MAAAnxC,CAAOC,GACHi4F,GAAej4F,GACf,MAAQp5B,EAAG6qE,EAAIlT,EAAGmT,EAAIvB,EAAGwB,GAAOlgF,MACxBmV,EAAGgqE,EAAIrS,EAAGsS,EAAIV,EAAGW,GAAO9wC,EAC1Bq4F,EAAO,GAAI1mD,EAAKA,GAChB2mD,EAAO,GAAIxnD,EAAKA,GAChB4K,EAAK,GAAIjK,EAAK6mD,GACd38C,EAAK,GAAI/K,EAAKynD,GACdE,EAAK,GAAI,GAAI7mD,EAAKZ,GAAMwnD,GACxBE,EAAK,GAAI,GAAI3nD,EAAKc,GAAM0mD,GAC9B,OAAO38C,IAAOC,GAAM48C,IAAOC,CAC/B,CACA,MAAAhuD,GACI,OAAO,IAAI0tD,GAAczmI,KAAKmV,EAAG,IAAKnV,KAAK8sE,GAAI9sE,KAAK0+E,EACxD,CACA,MAAA57D,GACI,MAAQ3N,EAAG6qE,EAAIlT,EAAGmT,EAAIvB,EAAGwB,GAAOlgF,KAC1By5C,EAAI,GAAIumC,EAAKA,GACbtmC,EAAI,GAAIumC,EAAKA,GACbtmC,EAAI,GAAID,EAAIA,GACZstF,EAAMhnD,EAAKtmC,EACXE,EAAI,GAAI,IAAO,GAAIotF,EAAMA,GAAOvtF,EAAIE,IACpCE,EAAI,GAAI,GAAMJ,GACdK,EAAI,GAAID,EAAIA,GACZ2mC,EAAK,GAAI1mC,EAAI,GAAMF,GACnB6mC,EAAK,GAAI5mC,GAAKD,EAAI4mC,GAAM,GAAM7mC,GAC9BgnC,EAAK,GAAI,GAAMV,EAAKC,GAC1B,OAAO,IAAIumD,GAAcjmD,EAAIC,EAAIE,EACrC,CACA,GAAA3jE,CAAIuxB,GACAi4F,GAAej4F,GACf,MAAQp5B,EAAG6qE,EAAIlT,EAAGmT,EAAIvB,EAAGwB,GAAOlgF,MACxBmV,EAAGgqE,EAAIrS,EAAGsS,EAAIV,EAAGW,GAAO9wC,EAChC,GAAI4wC,IAAO,IAAOC,IAAO,GACrB,OAAOp/E,KACX,GAAIggF,IAAO,IAAOC,IAAO,GACrB,OAAO1xC,EACX,MAAMq4F,EAAO,GAAI1mD,EAAKA,GAChB2mD,EAAO,GAAIxnD,EAAKA,GAChB4K,EAAK,GAAIjK,EAAK6mD,GACd38C,EAAK,GAAI/K,EAAKynD,GACdE,EAAK,GAAI,GAAI7mD,EAAKZ,GAAMwnD,GACxBE,EAAK,GAAI,GAAI3nD,EAAKc,GAAM0mD,GACxB5sF,EAAI,GAAIkwC,EAAKD,GACbzvD,EAAI,GAAIusG,EAAKD,GACnB,GAAI9sF,IAAM,GACN,OAAIxf,IAAM,GACCx6B,KAAK8iB,SAGL2jH,GAAcxwD,KAG7B,MAAMgxD,EAAK,GAAIjtF,EAAIA,GACbktF,EAAM,GAAIltF,EAAIitF,GACdj2E,EAAI,GAAIi5B,EAAKg9C,GACbzmD,EAAK,GAAIhmD,EAAIA,EAAI0sG,EAAM,GAAMl2E,GAC7ByvB,EAAK,GAAIjmD,GAAKw2B,EAAIwvB,GAAMsmD,EAAKI,GAC7BvmD,EAAK,GAAIT,EAAKb,EAAKrlC,GACzB,OAAO,IAAIysF,GAAcjmD,EAAIC,EAAIE,EACrC,CACA,QAAAC,CAASryC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMwqC,SAC1B,CACA,cAAAgI,CAAevF,GACX,MAAM2rD,EAAKV,GAAcxwD,KACzB,GAAsB,iBAAXuF,GAAuBA,IAAW,GACzC,OAAO2rD,EACX,IAAI3zH,EAAI4zH,GAAgB5rD,GACxB,GAAIhoE,IAAM,GACN,OAAOxT,KACX,IAAKsmI,GAAkB,CACnB,IAAI5nG,EAAIyoG,EACJ1qH,EAAIzc,KACR,KAAOwT,EAAI,IACHA,EAAI,KACJkrB,EAAIA,EAAE1hB,IAAIP,IACdA,EAAIA,EAAEqG,SACNtP,IAAM,GAEV,OAAOkrB,CACX,CACA,IAAI,MAAE+rD,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,GAAKE,YAAY71E,GAC5Cq3E,EAAMs8C,EACNr8C,EAAMq8C,EACN1qH,EAAIzc,KACR,KAAO0qF,EAAK,IAAOE,EAAK,IAChBF,EAAK,KACLG,EAAMA,EAAI7tE,IAAIP,IACdmuE,EAAK,KACLE,EAAMA,EAAI9tE,IAAIP,IAClBA,EAAIA,EAAEqG,SACN4nE,IAAO,GACPE,IAAO,GAOX,OALIH,IACAI,EAAMA,EAAI9R,UACV4R,IACAG,EAAMA,EAAI/R,UACd+R,EAAM,IAAI27C,GAAc,GAAI37C,EAAI31E,EAAIg0E,GAAKC,MAAO0B,EAAIhe,EAAGge,EAAIpM,GACpDmM,EAAI7tE,IAAI8tE,EACnB,CACA,gBAAAtQ,CAAiBvB,GACb,MAAMI,EAAUitD,GAAmB,IAAMrtD,EAAI,EAAI,IAAMA,EAAI,EACrDwB,EAAS,GACf,IAAI/7C,EAAI1+B,KACJozB,EAAOsL,EACX,IAAK,IAAI3tB,EAAS,EAAGA,EAASsoE,EAAStoE,IAAU,CAC7CqiB,EAAOsL,EACP+7C,EAAOj6E,KAAK4yB,GACZ,IAAK,IAAI7xB,EAAI,EAAGA,EAAI,IAAM03E,EAAI,GAAI13E,IAC9B6xB,EAAOA,EAAKpW,IAAI0hB,GAChB+7C,EAAOj6E,KAAK4yB,GAEhBsL,EAAItL,EAAKtQ,QACb,CACA,OAAO23D,CACX,CACA,IAAAL,CAAK5mE,EAAG6zH,IACCA,GAAernI,KAAKsuC,OAAOm4F,GAAc9+F,QAC1C0/F,EAAc,GAAM1/F,MACxB,MAAMsxC,EAAKouD,GAAeA,EAAYC,cAAiB,EACvD,GAAI,IAAMruD,EACN,MAAM,IAAIz6E,MAAM,iEAEpB,IAAIk8E,EAAc2sD,GAAe,GAAiBjoI,IAAIioI,GACjD3sD,IACDA,EAAc16E,KAAKw6E,iBAAiBvB,GAChCouD,GAAqB,IAANpuD,IACfyB,EAAc+rD,GAAc/mD,WAAWhF,GACvC,GAAiBp7E,IAAI+nI,EAAa3sD,KAG1C,IAAIh8C,EAAI+nG,GAAcxwD,KAClBhhE,EAAIwxH,GAAc9+F,KACtB,MAAM0xC,EAAU,GAAKitD,GAAmB,IAAMrtD,EAAI,IAAMA,GAClDK,EAAa,IAAML,EAAI,GACvBp6D,EAAOonB,OAAO,GAAKgzC,EAAI,GACvBG,EAAY,GAAKH,EACjBM,EAAUtzC,OAAOgzC,GACvB,IAAK,IAAIloE,EAAS,EAAGA,EAASsoE,EAAStoE,IAAU,CAC7C,MAAM7N,EAAS6N,EAASuoE,EACxB,IAAII,EAAQnvE,OAAOiJ,EAAIqL,GACvBrL,IAAM+lE,EACFG,EAAQJ,IACRI,GAASN,EACT5lE,GAAK,IAET,MAAM+zH,EAAUrkI,EACVskI,EAAUtkI,EAAS+F,KAAKsE,IAAImsE,GAAS,EACrC+tD,EAAQ12H,EAAS,GAAM,EACvB22H,EAAQhuD,EAAQ,EACR,IAAVA,EACAzkE,EAAIA,EAAE+H,IAAI,GAAgByqH,EAAO/sD,EAAY6sD,KAG7C7oG,EAAIA,EAAE1hB,IAAI,GAAgB0qH,EAAOhtD,EAAY8sD,IAErD,CACA,MAAO,CAAE9oG,IAAGzpB,IAChB,CACA,QAAA4rE,CAASrF,EAAQ6rD,GACb,IACIplD,EACA8I,EAFAv3E,EAAI4zH,GAAgB5rD,GAGxB,GAAI8qD,GAAkB,CAClB,MAAM,MAAE77C,EAAK,GAAEC,EAAE,MAAEC,EAAK,GAAEC,GAAOzB,GAAKE,YAAY71E,GAClD,IAAMkrB,EAAGmsD,EAAK51E,EAAG+1E,GAAQhrF,KAAKo6E,KAAKsQ,EAAI28C,IACjC3oG,EAAGosD,EAAK71E,EAAGg2E,GAAQjrF,KAAKo6E,KAAKwQ,EAAIy8C,GACvCx8C,EAAM,GAAgBJ,EAAOI,GAC7BC,EAAM,GAAgBH,EAAOG,GAC7BA,EAAM,IAAI27C,GAAc,GAAI37C,EAAI31E,EAAIg0E,GAAKC,MAAO0B,EAAIhe,EAAGge,EAAIpM,GAC3DuD,EAAQ4I,EAAI7tE,IAAI8tE,GAChBC,EAAOC,EAAIhuE,IAAIiuE,EACnB,KACK,CACD,MAAM,EAAEvsD,EAAC,EAAEzpB,GAAMjV,KAAKo6E,KAAK5mE,EAAG6zH,GAC9BplD,EAAQvjD,EACRqsD,EAAO91E,CACX,CACA,OAAOwxH,GAAc/mD,WAAW,CAACuC,EAAO8I,IAAO,EACnD,CACA,QAAAvL,CAASmoD,GACL,MAAM,EAAExyH,EAAC,EAAE23D,EAAC,EAAE4R,GAAM1+E,KACdm2E,EAAMn2E,KAAKsuC,OAAOm4F,GAAcxwD,MAC1B,MAAR0xD,IACAA,EAAOxxD,EAAM,GAAM,GAAOuI,IAC9B,MAAMkpD,EAAMD,EACNE,EAAM,GAAID,EAAMA,GAChBE,EAAM,GAAID,EAAMD,GAChBjpD,EAAK,GAAIxpE,EAAI0yH,GACbjpD,EAAK,GAAI9R,EAAIg7D,GACbjpD,EAAK,GAAIH,EAAIkpD,GACnB,GAAIzxD,EACA,OAAO,GAAMF,KACjB,GAAI4I,IAAO,GACP,MAAM,IAAIrgF,MAAM,oBACpB,OAAO,IAAI,GAAMmgF,EAAIC,EACzB,EAIJ,SAAS,GAAgB9F,EAAWtzB,GAChC,MAAM6wB,EAAM7wB,EAAKuzB,SACjB,OAAOD,EAAYzC,EAAM7wB,CAC7B,CALAihF,GAAc9+F,KAAO,IAAI8+F,GAAclpD,GAAM3B,GAAI2B,GAAM1B,GAAI,IAC3D4qD,GAAcxwD,KAAO,IAAIwwD,GAAc,GAAK,GAAK,IAKjD,MAAM,GAAmB,IAAI74F,QACtB,MAAM,GACT,WAAAt+B,CAAY6F,EAAG23D,GACX9sE,KAAKmV,EAAIA,EACTnV,KAAK8sE,EAAIA,CACb,CACA,cAAA+S,CAAevG,GACXt5E,KAAKsnI,aAAehuD,EACpB,GAAiBjyB,OAAOrnD,KAC5B,CACA,QAAAgqF,GACI,OAAOhqF,KAAK8sE,EAAI,KAAQ,EAC5B,CACA,wBAAOi7D,CAAkBj5H,GACrB,MAAMk5H,EAA2B,KAAjBl5H,EAAMrN,OAChB0T,EAAI8yH,GAAcD,EAAUl5H,EAAQA,EAAMmT,SAAS,IACzD,IAAKimH,GAAoB/yH,GACrB,MAAM,IAAI3W,MAAM,yBAEpB,IAAIsuE,EA8TZ,SAAiB33D,GACb,MAAM,EAAEiiE,GAAMmG,GACRgS,EAAMtpD,OAAO,GACbupD,EAAOvpD,OAAO,IACdwpD,EAAOxpD,OAAO,IACdypD,EAAOzpD,OAAO,IACd0pD,EAAO1pD,OAAO,IACd2pD,EAAO3pD,OAAO,IACdtvB,EAAMxB,EAAIA,EAAIA,EAAKiiE,EACnBxgE,EAAMD,EAAKA,EAAKxB,EAAKiiE,EACrBrgE,EAAM,GAAKH,EAAI,IAAOA,EAAMwgE,EAC5BlgE,EAAM,GAAKH,EAAI,IAAOH,EAAMwgE,EAC5BhgE,EAAO,GAAKF,EAAI,IAAOP,EAAMygE,EAC7Br/D,EAAO,GAAKX,EAAKo4E,GAAQp4E,EAAOggE,EAChC/9D,EAAO,GAAKtB,EAAK03E,GAAQ13E,EAAOq/D,EAChCyY,EAAO,GAAKx2E,EAAKs2E,GAAQt2E,EAAO+9D,EAChC0Y,EAAQ,GAAKD,EAAKD,GAAQC,EAAOzY,EACjC2Y,EAAQ,GAAKD,EAAMH,GAAQt2E,EAAO+9D,EAClC4Y,EAAQ,GAAKD,EAAM,IAAOn5E,EAAMwgE,EAChCgT,EAAM,GAAK4F,EAAMN,GAAQ33E,EAAOq/D,EAChCS,EAAM,GAAKuS,EAAImF,GAAO54E,EAAMygE,EAC5B+wD,EAAK,GAAKtwD,EAAI,IAEpB,GADYswD,EAAKA,EAAM/wD,IACZjiE,EACP,MAAM,IAAI3W,MAAM,2BACpB,OAAO2pI,CACX,CAxVgB,CADG,GAAYhzH,IAEvB,MAAMizH,GAAUt7D,EAAI,MAAS,GACzBk7D,EACII,IACAt7D,EAAI,IAAKA,MAG6B,GAAlBh+D,EAAM,MACPs5H,IACnBt7D,EAAI,IAAKA,IAEjB,MAAMmV,EAAQ,IAAI,GAAM9sE,EAAG23D,GAE3B,OADAmV,EAAMlC,iBACCkC,CACX,CACA,0BAAOomD,CAAoBv5H,GACvB,MAAMqG,EAAI8yH,GAAcn5H,EAAMmT,SAAS,EAAGihE,KACpCpW,EAAIm7D,GAAcn5H,EAAMmT,SAASihE,GAAcA,KAC/CjB,EAAQ,IAAI,GAAM9sE,EAAG23D,GAE3B,OADAmV,EAAMlC,iBACCkC,CACX,CACA,cAAO3qC,CAAQ5hC,GACX,MAAM5G,EAAQ,GAAY4G,GACpBtT,EAAM0M,EAAMrN,OACZswG,EAASjjG,EAAM,GACrB,GAtSS,KAsSL1M,EACA,OAAOpC,KAAK+nI,kBAAkBj5H,GAClC,GArSco0E,KAqSV9gF,IAAqC,IAAX2vG,GAA8B,IAAXA,GAC7C,OAAO/xG,KAAK+nI,kBAAkBj5H,GAElC,GAvSgB,KAuSZ1M,GAAsC,IAAX2vG,EAC3B,OAAO/xG,KAAKqoI,oBAAoBv5H,GACpC,MAAM,IAAItQ,MAAM,wGAAsI4D,IAC1J,CACA,qBAAOq/E,CAAe/T,GAClB,OAAO,GAAM/lC,KAAKk5C,SAASynD,GAAoB56D,GACnD,CACA,oBAAO66D,CAAcr8C,EAASve,EAAWke,GACrC,MAAM,EAAErxD,EAAC,GAAQguG,GAAmB76D,GACpC,IAAK,CAAC,EAAG,EAAG,EAAG,GAAG3iD,SAAS6gE,GACvB,MAAM,IAAIrtF,MAAM,wCACpB,MAAMsX,EAAI2yH,GAAa,GAAYv8C,KAC7B,EAAE14E,GAAM+pE,GACR6O,EAAoB,IAAbP,GAA+B,IAAbA,EAAiBrxD,EAAIhnB,EAAIgnB,EAClDkuG,EAAO,GAAOt8C,EAAM54E,GACpB84E,EAAK,IAAKx2E,EAAI4yH,EAAMl1H,GACpB+4E,EAAK,GAAIxpF,EAAI2lI,EAAMl1H,GACnB9T,EAAoB,EAAXmsF,EAAe,KAAO,KAC/BtJ,EAAI,GAAMjrC,QAAQ53C,EAASipI,GAAYv8C,IACvC5U,EAAI,GAAM7vC,KAAKujD,qBAAqB3I,EAAG+J,EAAIC,GACjD,IAAK/U,EACD,MAAM,IAAIh5E,MAAM,+CAEpB,OADAg5E,EAAEuI,iBACKvI,CACX,CACA,UAAAoK,CAAWuJ,GAAe,GACtB,OAAO,GAAWnrF,KAAKq3C,MAAM8zC,GACjC,CACA,KAAA9zC,CAAM8zC,GAAe,GACjB,MAAMh2E,EAAIwzH,GAAY3oI,KAAKmV,GAC3B,OAAIg2E,EAEO,GADQnrF,KAAKgqF,WAAa,KAAO,OACrB70E,IAGZ,KAAKA,IAAIwzH,GAAY3oI,KAAK8sE,IAEzC,CACA,MAAA87D,GACI,OAAO5oI,KAAKq3C,OAAM,GAAMn2C,MAAM,EAClC,CACA,MAAA2nI,GACI,OAAO7oI,KAAK4hF,YAAW,GAAM1gF,MAAM,EACvC,CACA,cAAA6+E,GACI,MAAMpoC,EAAM,kCACN,EAAExiC,EAAC,EAAE23D,GAAM9sE,KACjB,IAAKkoI,GAAoB/yH,KAAO+yH,GAAoBp7D,GAChD,MAAM,IAAItuE,MAAMm5C,GACpB,MAAMtO,EAAO,GAAIyjC,EAAIA,GAErB,GAAI,GAAIzjC,EADM,GAAYl0B,MACA,GACtB,MAAM,IAAI3W,MAAMm5C,EACxB,CACA,MAAArJ,CAAOC,GACH,OAAOvuC,KAAKmV,IAAMo5B,EAAMp5B,GAAKnV,KAAK8sE,IAAMv+B,EAAMu+B,CAClD,CACA,MAAAiM,GACI,OAAO,IAAI,GAAM/4E,KAAKmV,EAAG,IAAKnV,KAAK8sE,GACvC,CACA,MAAAhqD,GACI,OAAO2jH,GAAchnD,WAAWz/E,MAAM8iB,SAAS08D,UACnD,CACA,GAAAxiE,CAAIuxB,GACA,OAAOk4F,GAAchnD,WAAWz/E,MAAMgd,IAAIypH,GAAchnD,WAAWlxC,IAAQixC,UAC/E,CACA,QAAAoB,CAASryC,GACL,OAAOvuC,KAAKgd,IAAIuxB,EAAMwqC,SAC1B,CACA,QAAA8H,CAASrF,GACL,OAAOirD,GAAchnD,WAAWz/E,MAAM6gF,SAASrF,EAAQx7E,MAAMw/E,UACjE,CACA,oBAAA0L,CAAqB1T,EAAG72D,EAAGC,GACvB,MAAMw2D,EAAIqvD,GAAchnD,WAAWz/E,MAC7B8oI,EAAKnoH,IAAM,IAAOA,IAAM,IAAO3gB,OAAS,GAAM2nC,KAAOyvC,EAAE2J,eAAepgE,GAAKy2D,EAAEyJ,SAASlgE,GACtFooH,EAAKtC,GAAchnD,WAAWjI,GAAGuJ,eAAengE,GAChD4yD,EAAMs1D,EAAG9rH,IAAI+rH,GACnB,OAAOv1D,EAAIllC,OAAOm4F,GAAcxwD,WAAQ/2E,EAAYs0E,EAAIgM,UAC5D,EAIJ,SAASwpD,GAASjmI,GACd,OAAOwH,OAAOiU,SAASzb,EAAE,GAAI,KAAO,EAAI,KAAOA,EAAIA,CACvD,CACA,SAASkmI,GAAYt/F,GACjB,GAAIA,EAAKloC,OAAS,GAAiB,IAAZkoC,EAAK,GACxB,MAAM,IAAInrC,MAAM,kCAAkC,GAAWmrC,MAEjE,MAAMvnC,EAAMunC,EAAK,GACX/D,EAAM+D,EAAK1nB,SAAS,EAAG7f,EAAM,GACnC,IAAKA,GAAOwjC,EAAInkC,SAAWW,EACvB,MAAM,IAAI5D,MAAM,2CAEpB,GAAe,IAAXonC,EAAI,IAAeA,EAAI,IAAM,IAC7B,MAAM,IAAIpnC,MAAM,8CAEpB,MAAO,CAAEmrC,KAAMs+F,GAAcriG,GAAMyD,KAAMM,EAAK1nB,SAAS7f,EAAM,GACjE,CAlBA,GAAMulC,KAAO,IAAI,GAAM41C,GAAM3B,GAAI2B,GAAM1B,IACvC,GAAM5F,KAAO,IAAI,GAAM,GAAK,IAgCrB,MAAM2V,GACT,WAAAt8E,CAAYkrB,EAAGz3B,GACX/C,KAAKw6B,EAAIA,EACTx6B,KAAK+C,EAAIA,EACT/C,KAAK+/E,gBACT,CACA,kBAAO+L,CAAYp2E,GACf,MAAMshC,EAAM,GAAQthC,GACd3U,EAAO,wBACb,GAAmB,iBAAR2U,IAAqBshC,EAC5B,MAAM,IAAI52C,UAAU,GAAGW,oCAC3B,MAAMgF,EAAMixC,EAAM,GAAWthC,GAAOA,EACpC,GAAmB,MAAf3P,EAAItE,OACJ,MAAM,IAAIjD,MAAM,GAAGuC,2BACvB,OAAO,IAAI6qF,GAAU,GAAY7lF,EAAI7E,MAAM,EAAG,KAAM,GAAY6E,EAAI7E,MAAM,GAAI,MAClF,CACA,cAAO6qF,CAAQr2E,GACX,MAAMshC,EAAM,GAAQthC,GACpB,GAAmB,iBAARA,IAAqBshC,EAC5B,MAAM,IAAI52C,UAAU,oDACxB,MAAM,EAAG,EAAE2C,GAlCnB,SAA2B4mC,GACvB,GAAIA,EAAKloC,OAAS,GAAgB,IAAXkoC,EAAK,GACxB,MAAM,IAAInrC,MAAM,0BAA0B,GAAWmrC,MAEzD,GAAIA,EAAK,KAAOA,EAAKloC,OAAS,EAC1B,MAAM,IAAIjD,MAAM,uCAEpB,MAAQmrC,KAAMnP,EAAG6O,KAAM6+C,GAAW+gD,GAAYt/F,EAAK1nB,SAAS,KACpD0nB,KAAM5mC,EAAGsmC,KAAM6/F,GAAeD,GAAY/gD,GAClD,GAAIghD,EAAWznI,OACX,MAAM,IAAIjD,MAAM,gDAAgD,GAAW0qI,MAE/E,MAAO,CAAE1uG,IAAGz3B,IAChB,CAqByBomI,CAAkBnyF,EAAMthC,EAAM,GAAWA,IAC1D,OAAO,IAAIk2E,GAAUpxD,EAAGz3B,EAC5B,CACA,cAAOu0C,CAAQ5hC,GACX,OAAO1V,KAAK+rF,QAAQr2E,EACxB,CACA,cAAAqqE,GACI,MAAM,EAAEvlD,EAAC,EAAEz3B,GAAM/C,KACjB,IAAK+oF,GAAmBvuD,GACpB,MAAM,IAAIh8B,MAAM,0CACpB,IAAKuqF,GAAmBhmF,GACpB,MAAM,IAAIvE,MAAM,yCACxB,CACA,QAAAguF,GACI,MAAM48C,EAAO7rD,GAAM/pE,GAAK,GACxB,OAAOxT,KAAK+C,EAAIqmI,CACpB,CACA,UAAA38C,GACI,OAAOzsF,KAAKwsF,WAAa,IAAIZ,GAAU5rF,KAAKw6B,EAAG,IAAKx6B,KAAK+C,EAAGw6E,GAAM/pE,IAAMxT,IAC5E,CACA,aAAA0sF,GACI,OAAO,GAAW1sF,KAAK2sF,WAC3B,CACA,QAAAA,GACI,MAAM08C,EAAOL,GAAS,GAAoBhpI,KAAK+C,IACzCumI,EAAON,GAAS,GAAoBhpI,KAAKw6B,IACzC+uG,EAAQF,EAAK5nI,OAAS,EACtB+nI,EAAQF,EAAK7nI,OAAS,EACtBgoI,EAAO,GAAoBF,GAC3BG,EAAO,GAAoBF,GAEjC,MAAO,KADQ,GAAoBA,EAAQD,EAAQ,OAC5BG,IAAOJ,MAASG,IAAOJ,GAClD,CACA,UAAAznD,GACI,OAAO5hF,KAAK0sF,eAChB,CACA,KAAAr1C,GACI,OAAOr3C,KAAK2sF,UAChB,CACA,iBAAAC,GACI,OAAO,GAAW5sF,KAAK6sF,eAC3B,CACA,YAAAA,GACI,OAAO87C,GAAY3oI,KAAKw6B,GAAKmuG,GAAY3oI,KAAK+C,EAClD,EAEJ,SAAS,GAAQ4d,GACb,OAAOA,aAAa1Q,YAAe4B,YAAYW,OAAOmO,IAA6B,eAAvBA,EAAErR,YAAYvO,IAC9E,CACA,SAAS,GAAOykD,GACZ,IAAK,GAAQA,GACT,MAAM,IAAIhnD,MAAM,sBACxB,CACA,SAAS,MAAekgD,GAEpB,GADAA,EAAOkrB,MAAM,IACS,IAAlBlrB,EAAOj9C,OACP,OAAOi9C,EAAO,GAClB,MAAMj9C,EAASi9C,EAAOpU,QAAO,CAAC3pB,EAAGq2B,IAAQr2B,EAAIq2B,EAAIv1C,QAAQ,GACnDqT,EAAS,IAAI7E,WAAWxO,GAC9B,IAAK,IAAIF,EAAI,EAAGqoC,EAAM,EAAGroC,EAAIm9C,EAAOj9C,OAAQF,IAAK,CAC7C,MAAMy1C,EAAM0H,EAAOn9C,GACnBuT,EAAOxV,IAAI03C,EAAKpN,GAChBA,GAAOoN,EAAIv1C,MACf,CACA,OAAOqT,CACX,CACA,MAAM,GAAQnT,MAAM4c,KAAK,CAAE9c,OAAQ,MAAO,CAACk3B,EAAGp3B,IAAMA,EAAE8E,SAAS,IAAIiqD,SAAS,EAAG,OACxE,SAAS,GAAWxhD,GACvB,GAAOA,GACP,IAAI4G,EAAM,GACV,IAAK,IAAInU,EAAI,EAAGA,EAAIuN,EAAMrN,OAAQF,IAC9BmU,GAAO,GAAM5G,EAAMvN,IAEvB,OAAOmU,CACX,CACA,MAAM,GAAS,CAAEi0H,GAAI,GAAIC,GAAI,GAAInwF,EAAG,GAAIK,EAAG,GAAIn5B,EAAG,GAAI1L,EAAG,KACzD,SAAS,GAAcg+D,GACnB,OAAIA,GAAM,GAAO02D,IAAM12D,GAAM,GAAO22D,GACzB32D,EAAK,GAAO02D,GACnB12D,GAAM,GAAOx5B,GAAKw5B,GAAM,GAAOn5B,EACxBm5B,GAAM,GAAOx5B,EAAI,IACxBw5B,GAAM,GAAOtyD,GAAKsyD,GAAM,GAAOh+D,EACxBg+D,GAAM,GAAOtyD,EAAI,SAD5B,CAGJ,CACO,SAAS,GAAWjL,GACvB,GAAmB,iBAARA,EACP,MAAM,IAAIlX,MAAM,mCAAqCkX,GACzD,MAAMw9D,EAAKx9D,EAAIjU,OACT0xE,EAAKD,EAAK,EAChB,GAAIA,EAAK,EACL,MAAM,IAAI10E,MAAM,mDAAqD00E,GACzE,MAAMpgE,EAAQ,IAAI7C,WAAWkjE,GAC7B,IAAK,IAAIC,EAAK,EAAGn1D,EAAK,EAAGm1D,EAAKD,EAAIC,IAAMn1D,GAAM,EAAG,CAC7C,MAAMo1D,EAAK,GAAc39D,EAAIrI,WAAW4Q,IAClCq1D,EAAK,GAAc59D,EAAIrI,WAAW4Q,EAAK,IAC7C,QAAW/e,IAAPm0E,QAA2Bn0E,IAAPo0E,EAAkB,CACtC,MAAM3oC,EAAOj1B,EAAIuI,GAAMvI,EAAIuI,EAAK,GAChC,MAAM,IAAIzf,MAAM,+CAAiDmsC,EAAO,cAAgB1sB,EAC5F,CACAnL,EAAMsgE,GAAW,GAALC,EAAUC,CAC1B,CACA,OAAOxgE,CACX,CACA,MAAM+2H,GAAY5jG,OAAO,uEACzB,SAAS0iG,GAAYn8F,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAIhuC,MAAM,mBACpB,KAAM,IAAOguC,GAAOA,EAAMq9F,IACtB,MAAM,IAAIrrI,MAAM,kCACpB,OAAOguC,EAAInmC,SAAS,IAAIiqD,SAAS,GAAI,IACzC,CACA,SAAS,GAAS9jB,GACd,MAAM5rB,EAAI,GAAW+nH,GAAYn8F,IACjC,GAAiB,KAAb5rB,EAAEnf,OACF,MAAM,IAAIjD,MAAM,4BACpB,OAAOoiB,CACX,CACA,SAAS,GAAoB4rB,GACzB,MAAM92B,EAAM82B,EAAInmC,SAAS,IACzB,OAAoB,EAAbqP,EAAIjU,OAAa,IAAIiU,IAAQA,CACxC,CACA,SAAS,GAAYA,GACjB,GAAmB,iBAARA,EACP,MAAM,IAAItV,UAAU,4CAA8CsV,GAEtE,OAAOuwB,OAAO,KAAKvwB,IACvB,CACA,SAASuyH,GAAcn5H,GACnB,OAAO,GAAY,GAAWA,GAClC,CACA,SAAS,GAAY4G,GACjB,OAAO,GAAQA,GAAOzF,WAAWsO,KAAK7I,GAAO,GAAWA,EAC5D,CACA,SAAS0xH,GAAgB56F,GACrB,GAAmB,iBAARA,GAAoBjiC,OAAO8rC,cAAc7J,IAAQA,EAAM,EAC9D,OAAOvG,OAAOuG,GAClB,GAAmB,iBAARA,GAAoBu8C,GAAmBv8C,GAC9C,OAAOA,EACX,MAAM,IAAIpsC,UAAU,sDACxB,CACA,SAAS,GAAIugB,EAAGC,EAAI28D,GAAMnG,GACtB,MAAMtiE,EAAS6L,EAAIC,EACnB,OAAO9L,GAAU,GAAMA,EAAS8L,EAAI9L,CACxC,CACA,SAAS,GAAKK,EAAG8/D,GACb,MAAM,EAAEmC,GAAMmG,GACd,IAAI33C,EAAMzwB,EACV,KAAO8/D,KAAU,IACbrvC,GAAOA,EACPA,GAAOwxC,EAEX,OAAOxxC,CACX,CA4BA,SAAS,GAAOsmC,EAAQgJ,EAASqI,GAAMnG,GACnC,GAAIlL,IAAW,IAAOgJ,GAAU,GAC5B,MAAM,IAAI12E,MAAM,6CAA6C0tE,SAAcgJ,KAE/E,IAAIv0D,EAAI,GAAIurD,EAAQgJ,GAChBt0D,EAAIs0D,EACJ//D,EAAI,GAAK23D,EAAI,GAAKuI,EAAI,GAAKh2E,EAAI,GACnC,KAAOshB,IAAM,IAAK,CACd,MAAM6hB,EAAI5hB,EAAID,EACR6Z,EAAI5Z,EAAID,EACRyW,EAAIjiB,EAAIkgE,EAAI7yC,EACZhvB,EAAIs5D,EAAIztE,EAAImjC,EAClB5hB,EAAID,EAAGA,EAAI6Z,EAAGrlB,EAAIkgE,EAAGvI,EAAIztE,EAAGg2E,EAAIj+C,EAAG/3B,EAAImU,CAC3C,CAEA,GADYoN,IACA,GACR,MAAM,IAAIpiB,MAAM,0BACpB,OAAO,GAAI2W,EAAG+/D,EAClB,CAuBA,SAASuzD,GAAar7H,EAAM08H,GAAe,GACvC,MAAMh0H,EANV,SAAoBhH,GAChB,MAAMq+E,EAAuB,EAAfr+E,EAAMrN,OAAasoI,IAC3Bv9F,EAAMy7F,GAAcn5H,GAC1B,OAAOq+E,EAAQ,EAAI3gD,GAAOvG,OAAOknD,GAAS3gD,CAC9C,CAEcw9F,CAAW58H,GACrB,GAAI08H,EACA,OAAOh0H,EACX,MAAM,GAAQynE,GACd,OAAOznE,GAAKtC,EAAIsC,EAAItC,EAAIsC,CAC5B,CACA,IAAIm0H,GACAC,GACJ,MAAMC,GACF,WAAA76H,CAAY++E,EAASC,GAGjB,GAFAtuF,KAAKquF,QAAUA,EACfruF,KAAKsuF,SAAWA,EACO,iBAAZD,GAAwBA,EAAU,EACzC,MAAM,IAAI7vF,MAAM,4BACpB,GAAwB,iBAAb8vF,GAAyBA,EAAW,EAC3C,MAAM,IAAI9vF,MAAM,6BACpBwB,KAAKX,EAAI,IAAI4Q,WAAWo+E,GAAS31C,KAAK,GACtC14C,KAAK04B,EAAI,IAAIzoB,WAAWo+E,GAAS31C,KAAK,GACtC14C,KAAK0sC,QAAU,CACnB,CACA,IAAAu6C,IAAQhkF,GACJ,OAAOy/E,GAAM0nD,WAAWpqI,KAAK04B,KAAMz1B,EACvC,CACA,QAAAonI,IAAYpnI,GACR,OAAOinI,GAAgBlqI,KAAK04B,KAAMz1B,EACtC,CACA,SAAAqnI,GACI,GAA+B,mBAApBJ,GACP,MAAM,IAAI3D,GAAS,iCAC3B,CACA,IAAAlO,GACI,GAAIr4H,KAAK0sC,SAAW,IAChB,MAAM,IAAIluC,MAAM,qDACpBwB,KAAK0sC,SAAW,CACpB,CACA,YAAM8hD,CAAOd,EAAO,IAAIz9E,YACpBjQ,KAAK04B,QAAU14B,KAAKinF,KAAKjnF,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQmvE,GAC1D1tF,KAAKX,QAAUW,KAAKinF,KAAKjnF,KAAKX,GACV,IAAhBquF,EAAKjsF,SAETzB,KAAK04B,QAAU14B,KAAKinF,KAAKjnF,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQmvE,GAC1D1tF,KAAKX,QAAUW,KAAKinF,KAAKjnF,KAAKX,GAClC,CACA,UAAAkrI,CAAW78C,EAAO,IAAIz9E,YAClBjQ,KAAKsqI,YACLtqI,KAAK04B,EAAI14B,KAAKqqI,SAASrqI,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQmvE,GACxD1tF,KAAKX,EAAIW,KAAKqqI,SAASrqI,KAAKX,GACR,IAAhBquF,EAAKjsF,SAETzB,KAAK04B,EAAI14B,KAAKqqI,SAASrqI,KAAKX,EAAG4Q,WAAWsO,KAAK,CAAC,IAAQmvE,GACxD1tF,KAAKX,EAAIW,KAAKqqI,SAASrqI,KAAKX,GAChC,CACA,cAAMmrI,GACFxqI,KAAKq4H,OACL,IAAIj2H,EAAM,EACV,MAAMynC,EAAM,GACZ,KAAOznC,EAAMpC,KAAKsuF,UAAU,CACxBtuF,KAAKX,QAAUW,KAAKinF,KAAKjnF,KAAKX,GAC9B,MAAMovF,EAAKzuF,KAAKX,EAAE6B,QAClB2oC,EAAIrpC,KAAKiuF,GACTrsF,GAAOpC,KAAKX,EAAEoC,MAClB,CACA,OAAO,MAAeooC,EAC1B,CACA,YAAA4gG,GACIzqI,KAAKsqI,YACLtqI,KAAKq4H,OACL,IAAIj2H,EAAM,EACV,MAAMynC,EAAM,GACZ,KAAOznC,EAAMpC,KAAKsuF,UAAU,CACxBtuF,KAAKX,EAAIW,KAAKqqI,SAASrqI,KAAKX,GAC5B,MAAMovF,EAAKzuF,KAAKX,EAAE6B,QAClB2oC,EAAIrpC,KAAKiuF,GACTrsF,GAAOpC,KAAKX,EAAEoC,MAClB,CACA,OAAO,MAAeooC,EAC1B,EAEJ,SAASk/C,GAAmBv8C,GACxB,OAAO,GAAMA,GAAOA,EAAM+wC,GAAM/pE,CACpC,CACA,SAAS00H,GAAoB17F,GACzB,OAAO,GAAMA,GAAOA,EAAM+wC,GAAMnG,CACpC,CACA,SAASszD,GAAS18C,EAAQ52D,EAAG3a,EAAG0qE,GAAO,GACnC,MAAM,EAAE3zE,GAAM+pE,GACR7kD,EAAI+vG,GAAaz6C,GAAQ,GAC/B,IAAKjF,GAAmBrwD,GACpB,OACJ,MAAMiyG,EAAO,GAAOjyG,EAAGllB,GACjBgvB,EAAI,GAAMmF,KAAKk5C,SAASnoD,GACxB8B,EAAI,GAAIgI,EAAErtB,EAAG3B,GACnB,GAAIgnB,IAAM,GACN,OACJ,MAAMz3B,EAAI,GAAI4nI,EAAO,GAAIvzG,EAAI3a,EAAI+d,EAAGhnB,GAAIA,GACxC,GAAIzQ,IAAM,GACN,OACJ,IAAImqE,EAAM,IAAI0e,GAAUpxD,EAAGz3B,GACvB8oF,GAAYrpD,EAAErtB,IAAM+3D,EAAI1yC,EAAI,EAAI,GAAKjwB,OAAOi4B,EAAEsqC,EAAI,IAKtD,OAJIqa,GAAQja,EAAIsf,aACZtf,EAAMA,EAAIuf,aACVZ,GAAY,GAET,CAAE3e,MAAK2e,WAClB,CACA,SAASy8C,GAAoBvpI,GACzB,IAAIytC,EACJ,GAAmB,iBAARztC,EACPytC,EAAMztC,OAEL,GAAmB,iBAARA,GAAoBwL,OAAO8rC,cAAct3C,IAAQA,EAAM,EACnEytC,EAAMvG,OAAOlnC,QAEZ,GAAmB,iBAARA,EAAkB,CAC9B,GAAmB,KAAfA,EAAI0C,OACJ,MAAM,IAAIjD,MAAM,oCACpBguC,EAAM,GAAYztC,EACtB,KACK,KAAI,GAAQA,GAMb,MAAM,IAAIqB,UAAU,8BALpB,GArwBS,KAqwBLrB,EAAI0C,OACJ,MAAM,IAAIjD,MAAM,oCACpBguC,EAAMy7F,GAAclpI,EAIxB,CACA,IAAKgqF,GAAmBv8C,GACpB,MAAM,IAAIhuC,MAAM,qCACpB,OAAOguC,CACX,CAUA,SAASg8F,GAAmB76D,GACxB,GAAIA,aAAqBie,GAErB,OADAje,EAAUoS,iBACHpS,EAEX,IACI,OAAOie,GAAUG,QAAQpe,EAC7B,CACA,MAAOnmD,GACH,OAAOokE,GAAUE,YAAYne,EACjC,CACJ,CA4BA,SAAS4a,GAASz5E,GAEd,OAAOm5H,GADOn5H,EAAMrN,OAl0BP,GAk0B2BqN,EAAM5N,MAAM,EAl0BvC,IAk0BsD4N,EAEvE,CACA,SAAS87H,GAAY97H,GACjB,MAAM+7H,EAAKtiD,GAASz5E,GACd61E,EAAK,GAAIkmD,EAAIttD,GAAM/pE,GACzB,OAAO65E,GAAW1I,EAAK,GAAMkmD,EAAKlmD,EACtC,CACA,SAAS0I,GAAW7gD,GAChB,OAAO,GAASA,EACpB,CA4CA,MAAMs+F,GAAQ,CAAEC,QAAQ,GA4KxB,GAAMpjG,KAAKk4C,eAAe,GAC1B,MAAM,GAAS,CACXvuE,KAAM,GACN05H,IAAqB,iBAAT1gI,MAAqB,WAAYA,KAAOA,KAAK8iC,YAASluC,GAOhE,GAAuB,CAAC,EACjBwjF,GAAQ,CACjBuoD,WAAU,GACVC,WAAU,GACVC,YAAW,GACXxjH,IAAG,GACHytD,OAAM,GACN,iBAAA0X,CAAkBpf,GACd,IAEI,OADA46D,GAAoB56D,IACb,CACX,CACA,MAAOlmD,GACH,OAAO,CACX,CACJ,EACA4jH,iBAAkB,GAClBC,qBAAsB/C,GACtBgD,iBAAmBl+H,IAGf,IAFAA,EAAO,GAAYA,IAEV3L,OADMsoI,IACa38H,EAAK3L,OAAS,KACtC,MAAM,IAAIjD,MAAM,uDAGpB,OAAO,GADK,GAAIypI,GAAc76H,GAAOmwE,GAAM/pE,EAAI,IAAO,GAClC,EAExBukC,YAAa,CAACF,EAAc,MACxB,GAAI,GAAOmzF,IACP,OAAO,GAAOA,IAAIlzF,gBAAgB,IAAI7nC,WAAW4nC,IAEhD,GAAI,GAAOvmC,KAAM,CAClB,MAAM,YAAEymC,GAAgB,GAAOzmC,KAC/B,OAAOrB,WAAWsO,KAAKw5B,EAAYF,GACvC,CAEI,MAAM,IAAIr5C,MAAM,oDACpB,EAEJmkF,iBAAkB,IAAMD,GAAM4oD,iBAAiB5oD,GAAM3qC,YAAYgyF,KACjE,UAAAnnD,CAAWtJ,EAAa,EAAG2I,EAAQ,GAAMt6C,MACrC,MAAM83E,EAASx9B,IAAU,GAAMt6C,KAAOs6C,EAAQ,IAAI,GAAMA,EAAM9sE,EAAG8sE,EAAMnV,GAGvE,OAFA2yC,EAAO5/B,eAAevG,GACtBmmC,EAAO5+B,SAAS,IACT4+B,CACX,EACA8rB,OAAQp+F,SAAUuG,KACd,GAAI,GAAOs3F,IAAK,CACZ,MAAMt4H,QAAe,GAAOs4H,IAAI39F,OAAOx3B,OAAO,UAAW,MAAe69B,IACxE,OAAO,IAAIzjC,WAAWyC,EAC1B,CACK,GAAI,GAAOpB,KAAM,CAClB,MAAM,WAAEk6H,GAAe,GAAOl6H,KACxBlE,EAAOo+H,EAAW,UAExB,OADA93F,EAASvmC,SAASiqB,GAAMhqB,EAAKtO,OAAOs4B,KAC7BnnB,WAAWsO,KAAKnR,EAAKyI,SAChC,CAEI,MAAM,IAAIrX,MAAM,+CACpB,EAEJ4rI,WAAYj9F,MAAOpuC,KAAQ20C,KACvB,GAAI,GAAOs3F,IAAK,CACZ,MAAMS,QAAa,GAAOT,IAAI39F,OAAO8/B,UAAU,MAAOpuE,EAAK,CAAEgC,KAAM,OAAQqM,KAAM,CAAErM,KAAM,aAAe,EAAO,CAAC,SAC1GyL,EAAU,MAAeknC,GACzBhhC,QAAe,GAAOs4H,IAAI39F,OAAO/uB,KAAK,OAAQmtH,EAAMj/H,GAC1D,OAAO,IAAIyD,WAAWyC,EAC1B,CACK,GAAI,GAAOpB,KAAM,CAClB,MAAM,WAAEo6H,GAAe,GAAOp6H,KACxBlE,EAAOs+H,EAAW,SAAU3sI,GAElC,OADA20C,EAASvmC,SAASiqB,GAAMhqB,EAAKtO,OAAOs4B,KAC7BnnB,WAAWsO,KAAKnR,EAAKyI,SAChC,CAEI,MAAM,IAAIrX,MAAM,oDACpB,EAEJmtI,gBAAYzsI,EACZ0sI,oBAAgB1sI,EAChB2sI,WAAY1+F,MAAO2F,KAAQY,KACvB,IAAIo4F,EAAO,GAAqBh5F,GAChC,QAAa5zC,IAAT4sI,EAAoB,CACpB,MAAMC,QAAarpD,GAAM6oD,OAAOt7H,WAAWsO,KAAKu0B,GAAM3rC,GAAMA,EAAEkG,WAAW,MACzEy+H,EAAO,GAAYC,EAAMA,GACzB,GAAqBj5F,GAAOg5F,CAChC,CACA,OAAOppD,GAAM6oD,OAAOO,KAASp4F,EAAS,EAE1Cs4F,eAAgB,CAACl5F,KAAQY,KACrB,GAA2B,mBAAhBu2F,GACP,MAAM,IAAI1D,GAAS,+CACvB,IAAIuF,EAAO,GAAqBh5F,GAChC,QAAa5zC,IAAT4sI,EAAoB,CACpB,MAAMC,EAAO9B,GAAYh6H,WAAWsO,KAAKu0B,GAAM3rC,GAAMA,EAAEkG,WAAW,MAClEy+H,EAAO,GAAYC,EAAMA,GACzB,GAAqBj5F,GAAOg5F,CAChC,CACA,OAAO7B,GAAY6B,KAASp4F,EAAS,EAEzCu4F,eAAgBxF,IAEpB9nI,OAAOu6B,iBAAiBwpD,GAAO,CAC3BipD,WAAY,CACRhgI,cAAc,EACdvM,IAAG,IACQ6qI,GAEX,GAAA3qI,CAAI2L,GACKg/H,KACDA,GAAch/H,EACtB,GAEJ2gI,eAAgB,CACZjgI,cAAc,EACdvM,IAAG,IACQ8qI,GAEX,GAAA5qI,CAAI2L,GACKi/H,KACDA,GAAkBj/H,EAC1B,sCChsCD,SAASihI,GAAUn2G,GACtB,OAAO,IAAI9lB,WAAWk8H,GAAKD,UAAUv2H,YAAYogB,GACrD,CAWO,SAASq2G,GAAgBz+D,EAAWnhE,EAASmgE,GAChD,IAEI,ODk4BD,SAAgBgB,EAAWue,EAASvf,EAAW7vC,EAAOguG,IACzD,IAAI59D,EACJ,IACIA,EAAMs7D,GAAmB76D,GACzBue,EAAU,GAAYA,EAC1B,CACA,MAAO1kE,GACH,OAAO,CACX,CACA,MAAM,EAAEgT,EAAC,EAAEz3B,GAAMmqE,EACjB,GAAIpwC,EAAKiuG,QAAU79D,EAAIsf,WACnB,OAAO,EACX,MAAM12E,EAAI2yH,GAAav8C,GACvB,IAAI9U,EACJ,IACIA,EAvHR,SAA4BzK,GACxB,OAAIA,aAAqB,IACrBA,EAAUoT,iBACHpT,GAGA,GAAMr1B,QAAQq1B,EAE7B,CA+GY0/D,CAAmB1/D,EAC3B,CACA,MAAOnlD,GACH,OAAO,CACX,CACA,MAAM,EAAEhU,GAAM+pE,GACR+uD,EAAO,GAAOvpI,EAAGyQ,GACjB84E,EAAK,GAAIx2E,EAAIw2H,EAAM94H,GACnB+4E,EAAK,GAAI/xD,EAAI8xG,EAAM94H,GACnB+uE,EAAI,GAAM56C,KAAKujD,qBAAqB9T,EAAGkV,EAAIC,GACjD,QAAKhK,GAEK,GAAIA,EAAEptE,EAAG3B,KACNgnB,CACjB,CC/5Be,CADY,GAAesxD,YAAYne,EAAUzsE,MAAM,EAAG,KAClCsL,EAASmgE,EAC5C,CACA,MACI,OAAO,CACX,CACJ,CCtCO,MACM4/D,GAAiB,oBCDvB,SAASC,GAA+Bp3F,EAAK8S,GAChD,OAAQA,GACJ,IAAK,MACD,OAAQskF,GAA+Bp3F,EAAK,SACxCo3F,GAA+Bp3F,EAAK,QAC5C,IAAK,MACD,OAAQo3F,GAA+Bp3F,EAAK,SACxCo3F,GAA+Bp3F,EAAK,QAEhD,MAAMq3F,EAASvkF,EAAS57B,SAAS,KAC3BogH,EAAQt3F,EAAIh2C,IAAIqtI,EAAS,MAAQ,MACvC,IAAKC,EACD,OACJ,MAAMC,EAAYzkF,EAAShnD,MAAM,EAAG,GACpC,IAAI0rI,EACJ,OAAQD,GACJ,IAAK,MACDC,EAAWH,EAASr3F,EAAIh2C,IAAI,QAAUg2C,EAAIh2C,IAAI,OAC9C,MACJ,IAAK,MACDwtI,EAAWH,EAASr3F,EAAIh2C,IAAI,QAAUg2C,EAAIh2C,IAAI,OAC9C,MACJ,QACI,OAER,OAAKwtI,ECxBF,SAA6BC,EAAU3kF,EAAU4kF,EAASC,GAC7D,IAAI5yE,EAAK,GAAU,IAAM0yE,EAAW,IAAM57E,GAAgB47E,EAAUC,IAEpE,OADA3yE,EAAKA,EAAGzF,YAAY,GAAU,IAAMxM,EAAW,IAAM+I,GAAgB/I,EAAU6kF,KACxE5yE,CACX,CDsBW6yE,CAAoBP,EAAS,MAAQ,MAAOE,EAAWD,EAAOE,QAFrE,CAGJ,CEdO,SAASK,GAAiB7mC,GAC7B,MAAMlrD,EAAckrD,EAAW97D,QAAO,CAAC6Q,EAAKgf,IAAOhf,EHVlB,EGUgDgf,EAAGrrD,MAAMrN,QAAQ,GAC5FqN,EAAQ,IAAImB,WAAWirC,GACvB5C,EAAW,IAAIrB,SAASnoC,EAAM4D,QACpC,IAAI7H,EAAQ,EAUZ,OATAu7F,EAAWj5F,SAAS25F,IAChB,GAAIA,EAAUhyC,YACV,MAAM,IAAIt2D,MAAM,8CAEpB85C,EAAS4E,UAAUryC,EAAOi8F,EAAUh4F,MAAMrN,QAC1CoJ,GHnB6B,EGoB7BiE,EAAMxP,IAAIwnG,EAAUh4F,MAAOjE,GAC3BA,GAASi8F,EAAUh4F,MAAMrN,MAAM,IAE5BqN,CACX,CC9BO,SAASo+H,GAAYnlF,GACxB,IAAImI,EAAO,EAYX,OAXInI,EAAU0W,YACVvO,GAAQ,GACZA,IAAe,EACXnI,EAAUl7C,SACVqjD,GAAQ,GACZA,IAAe,EACXnI,EAAUqgB,QACVlY,GAAQ,GACZA,IAAe,EACXnI,EAAUyN,QACVtF,GAAQ,GACLA,CACX,CCRO,MAAMi9E,WAAet/F,IACxBw6C,IACA1a,UACA,WAAAr+D,CAAY89H,EAAM,CAAC,EAAG/kD,EAAMpiD,OAAO,GAAI0nC,GACnCv9B,MAAMzxC,OAAOwxD,QAAQi9E,IACrBptI,KAAKqoF,IAAMA,EACXroF,KAAK2tE,UAAYA,CACrB,CACA,GAAAruE,CAAIo5B,EAAGr5B,GAGH,OAFAW,KAAK2tE,eAAYzuE,EACjBc,KAAKqoF,MACEj4C,MAAM9wC,IAAIo5B,EAAGr5B,EACxB,CACA,MAAIqR,GACA,MAAMA,EAAK1Q,KAAKZ,IAAI,MACpB,IAAKsR,EACD,MAAM,IAAIlS,MAAM,iBACpB,OAAOw8C,GAAYtqC,EACvB,CACA,aAAIi8D,GACA,GACS,OADD3sE,KAAK0Q,GAEL,OAAO1Q,KAAKZ,IAAI,aAEhB,MAAM,IAAIZ,MAAM+tI,GAE5B,CACA,MAAIhtC,GACA,MAAMA,EAAKv/F,KAAKZ,IAAI,MACpB,GAAKmgG,EAEL,OAAO5iD,GAAiB4iD,EAC5B,CACA,OAAI8tC,GACA,MAAMA,EAAMrtI,KAAKZ,IAAI,OACrB,GAAKiuI,EAEL,OAAO1wF,GAAiB0wF,EAC5B,CACA,MAAIl6G,GACA,OAAOm6G,GAAettI,KAAM,KAAM,MACtC,CACA,MAAImzB,CAAGA,GACHo6G,GAAevtI,KAAM,KAAM,MAAOmzB,EACtC,CACA,OAAI8gC,GACA,OAAOu5E,GAAuBxtI,KAAM,MAAO,MAC/C,CACA,OAAIi0D,CAAI/B,GACJu7E,GAAuBztI,KAAM,MAAO,MAAOkyD,EAC/C,CACA,OAAIgC,GACA,OAAOs5E,GAAuBxtI,KAAM,MAAO,MAC/C,CACA,OAAIk0D,CAAIhC,GACJu7E,GAAuBztI,KAAM,MAAO,MAAOkyD,EAC/C,CACA,OAAIkC,GACA,OAAOk5E,GAAettI,KAAM,MAAO,MACvC,CACA,OAAIo0D,CAAIjhC,GACJo6G,GAAevtI,KAAM,MAAO,MAAOmzB,EACvC,CACA,QAAIu6G,GACA,OAAOF,GAAuBxtI,KAAM,OAAQ,MAChD,CACA,QAAI0tI,CAAKx7E,GACLu7E,GAAuBztI,KAAM,OAAQ,MAAOkyD,EAChD,CACA,QAAIy7E,GACA,OAAOH,GAAuBxtI,KAAM,OAAQ,MAChD,CACA,QAAI2tI,CAAKz7E,GACLu7E,GAAuBztI,KAAM,OAAQ,MAAOkyD,EAChD,CAaA,cAAIk0C,GACA,MAAM15B,EAAM1sE,KAAKZ,IAAI,cACrB,GAAIstE,EACA,OF9FL,SAA0B59D,GAC7B,MAAMs3F,EAAa,GACnB,IAAIv7F,EAAQ,EACZ,KAAOA,EAAQiE,EAAMrN,QAAQ,CACzB,MACMhD,EADe,IAAIw4C,SAASnoC,EAAM4D,OAAQ7H,EHAnB,GGCH+xC,UAAU,GACpC/xC,GHF6B,EGG7B,MAAM+iI,EAAiB9+H,EAAM5N,MAAM2J,EAAOA,EAAQpM,GAClDoM,GAASpM,EACT2nG,EAAW5lG,KAAK,GAAUotI,GAC9B,CACA,OAAOxnC,CACX,CEkFmBynC,CAAiBnhE,EAEhC,CAaA,cAAI05B,CAAWA,GACX0nC,GAAgB9tI,KAAM,aAAcomG,EAAY6mC,GACpD,CAIA,SAAIc,GACA,MAAMrhE,EAAM1sE,KAAKZ,IAAI,SACrB,GAAIstE,EACA,ODzGL,SAAqBxc,GACxB,MAAM69E,EAAQ,CACVv4E,OAAO,EACP4S,OAAO,EACPv7D,QAAQ,EACR4xD,WAAW,GAaf,OAXIvO,EAAO,IACP69E,EAAMv4E,OAAQ,IAClBtF,IAAe,GACJ,IACP69E,EAAM3lE,OAAQ,IAClBlY,IAAe,GACJ,IACP69E,EAAMlhI,QAAS,IACnBqjD,IAAe,GACJ,IACP69E,EAAMtvE,WAAY,GACfsvE,CACX,CCsFmBC,CAAYthE,EAAI,GAE/B,CAIA,SAAIqhE,CAAMA,GACND,GAAgB9tI,KAAM,QAAS+tI,GAAQh6H,GAAM,IAAI9D,WAAW,CAACi9H,GAAYn5H,MAC7E,EAEJ,SAASu5H,GAAehpI,EAAKvF,EAAK++C,GAC9B,MAAM4uB,EAAMpoE,EAAIlF,IAAIL,GACpB,GAAK2tE,EAEL,OAAOzb,GAAgBnT,EAAO4uB,EAClC,CACA,SAAS8gE,GAAuBlpI,EAAKvF,EAAK++C,GACtC,MAAM4uB,EAAMpoE,EAAIlF,IAAIL,GACpB,GAAK2tE,EAEL,OAAOniE,OAAO0mD,GAAgBnT,EAAO4uB,GACzC,CACA,SAAS6gE,GAAejpI,EAAKvF,EAAK++C,EAAO9+C,GACrC8uI,GAAgBxpI,EAAKvF,EAAKC,EAAO,GAAeo9B,KAAK,CAAC,EAAG0hB,GAC7D,CACA,SAAS2vF,GAAuBnpI,EAAKvF,EAAK++C,EAAO9+C,GAC7CuuI,GAAejpI,EAAKvF,EAAK++C,EAAO9+C,GAAOqH,SAAS,IACpD,CACA,SAASynI,GAAgBxpI,EAAKvF,EAAKC,EAAO87E,QACxB57E,IAAVF,EACAsF,EAAIhF,IAAIP,EAAK+7E,EAAU97E,IAGvBsF,EAAI+iD,OAAOtoD,EAEnB,CCxJOouC,eAAe,GAAKu0C,EAAS/pC,GAChC,OR44BJxK,eAAoB++C,EAASxK,EAAS5kD,EAAO,CAAC,GAC1C,MAAM,KAAE4wD,EAAI,EAAEt2D,EAAC,EAAE3a,GAzBrB,SAAqByvE,EAASxe,EAAYkgB,GACtC,GAAe,MAAX1B,EACA,MAAM,IAAI1tF,MAAM,2CAA2C0tF,MAC/D,MAAMiL,EAAK,GAAYjL,GACjBzvE,EAAI6rH,GAAoB56D,GACxBqgB,EAAW,CAACV,GAAW5wE,GAAImuH,GAAYzzC,IAC7C,GAAoB,MAAhBvJ,EAAsB,EACD,IAAjBA,IACAA,EAAelL,GAAM3qC,YAr1BhB,KAs1BT,MAAM9zB,EAAI,GAAY2pE,GACtB,GAv1BS,KAu1BL3pE,EAAExiB,OACF,MAAM,IAAIjD,MAAM,yCACpBuvF,EAASvtF,KAAKyjB,EAClB,CAGA,MAAO,CAAEypE,KAFI,MAAeK,GAEb32D,EADLmxD,GAAS4O,GACD16E,IACtB,CAQ2BwxH,CAAY/hD,EAASxK,EAAS5kD,EAAK8wD,cACpDQ,EAAO,IAAI+7C,GAr2BL,GADC,IAw2Bb,IAAIj9D,EACJ,UAFMkhB,EAAKI,OAAOd,KAETxgB,EAAMw9D,SAAet8C,EAAKo8C,WAAYpzG,EAAG3a,EAAGqgB,EAAKoxG,mBAChD9/C,EAAKI,SACf,OAbJ,SAAqB2/C,EAAQrxG,GACzB,MAAM,IAAEowC,EAAG,SAAE2e,GAAasiD,GACpB,IAAEC,EAAG,UAAEC,GAAc1vI,OAAO01B,OAAO,CAAE65G,WAAW,EAAME,KAAK,GAAQtxG,GACnEilD,EAASqsD,EAAMlhE,EAAIwf,gBAAkBxf,EAAI0f,oBAC/C,OAAOyhD,EAAY,CAACtsD,EAAQ8J,GAAY9J,CAC5C,CAQWusD,CAAYphE,EAAKpwC,EAC5B,CQp5BW,CAAUovG,GAAUv0F,GAAM+pC,EAAS,CACtC0sD,KAAK,GAEb,CCAA,MAAM,GAAM,IAAI/wF,GAAO,OAChB,IAAIkxF,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,GACrBtjF,qBAAuB,OACvB3C,OACA,aAAOtoD,CAAOwuI,EAAM,CAAC,EAAG/kD,EAAMpiD,OAAO,GAAI0nC,GACrC,MAAMv4B,EAAM,IAAI,GAAIg4F,EAAK/kD,EAAK1a,GAC9B,IACI,MAAMhB,EAAYv3B,EAAIu3B,UAClBA,IACAv3B,EAAI8R,OCzBb,SAAmCylB,GACtC,MAAM8hE,E5NoEH,SAA0Bj/H,GAC7B,GlBxE2B,KkBwEvBA,EAAIgB,WACJ,OAAO80E,GAA0B91E,GAEhC,GDxEsB,KCwElBA,EAAIgB,WACT,OAAOqgF,GAA4BrhF,GAEvC,MAAMhD,EAAU,GAAUgD,GACpBk/H,EAAWliI,EAAQ,KAAK,GAC9B,G3BjF2B,wB2BiFvBkiI,G3BhFuB,iB2BgFSA,G3B/ET,iB2B+EyCA,EAChE,OAAOtgE,GAA2B5hE,GAEtC,GV/EgC,yBU+E5BA,EAAQ,KAAK,GACb,OAAOk6E,GAA0Bl6E,EAASgD,GAE9C,MAAM,IAAI,GAAuB,8CACrC,C4NpFmBm/H,CAAiBhiE,GAChC,GAAoB,cAAhB8hE,EAAOtpI,KACP,MAAM,IAAI3G,MAJsB,gCAMpC,OAAOu0F,GAAoB07C,EAC/B,CDmB6BG,CAA0BjiE,GAE/C,CACA,MAAO1oD,GACH,GAAIuD,MAAM,sCAAuCvD,EACrD,CACA,OAAOmxB,CACX,CACA,UAAIy5F,GACA,GACS,OADD7uI,KAAK0Q,GAEL,OAAO1Q,KAAK2sE,UD/BrB,SAAgB8hE,GACnB,MACMK,EADY,GAAWx3F,QAAQm3F,GACA7sD,YAAW,GAChD,OAAO,GAAWsqD,GAAU4C,EAAmB5tI,MAAM,IACzD,CC2BwC,CAAUlB,KAAK2sE,gBAAaztE,EAEpD,MAAM,IAAIV,MAAM+tI,GAE5B,CACAwC,qBAAuBvC,GAA+BpwG,KAAK,CAAC,EAAGp8B,MAC/D,aAAIq7C,GAIA,OAHIr7C,KAAKu/F,IAAMv/F,KAAKqtI,KAChB,GAAIngI,KAAK,4CAENlN,KAAKu/F,IAAMv/F,KAAKqtI,GAC3B,CACA,oBAAA2B,CAAqBloC,GACjB,MAAMryC,EAAaqyC,EAAUryC,aAC7B,GAA0B,IAAtBA,EAAWhzD,QACO,QAAlBgzD,EAAW,IACO,QAAlBA,EAAW,GACX,MAAM,IAAIj2D,MAAM,qBAEpB,MAAMu0D,EAAS+zC,EAAU/zC,SACzB,IAAKA,EAAO,GAAG,KAAOA,EAAO,GAAG,GAC5B,MAAM,IAAIv0D,MAAM,qBAGC,IAAjBu0D,EAAO,GAAG,IACV/yD,KAAKV,IAAI,KAAMyzD,EAAO,GAAG,IACzB/yD,KAAKV,IAAIm1D,EAAW,GAAI1B,EAAO,GAAG,MAGlC/yD,KAAKV,IAAI,MAAOyzD,EAAO,GAAG,IAC1B/yD,KAAKV,IAAIm1D,EAAW,GAAK,IAAK1B,EAAO,GAAG,IAEhD,CACA,wBAAAk8E,GACI,MAAM7oC,EAAa,GACnB,IAAK,MAAMl+C,KAAYvpD,OAAOsE,OAAOurI,IAAgC,CACjE,MAAMr0E,EAAKn6D,KAAK+uI,qBAAqB7mF,GACjCiS,GACAisC,EAAW5lG,KAAK25D,EACxB,CACA,MAAM+0E,EAAclvI,KAAKomG,YAAc,GACvC,OAAOA,EAAWhlG,OAAO8tI,GAAa5qI,KAAK61D,GACnCn6D,KAAKknD,OACEiT,EAAGzF,YAAY,QAAQ10D,KAAKknD,OAAO7gD,cAEvC8zD,GAEf,CACA,YAAIjB,GACA,MAAMxoD,EAAK1Q,KAAKknD,OAChB,GAAKx2C,EAEL,MAAO,CACHA,KACA01F,WAAYpmG,KAAKivI,2BAEzB,CASA,gBAAAE,CAAiBjnF,GACb,GAAIloD,KAAKknD,OAAQ,CACb,MAAMkoF,EAAoBpvI,KAAK+uI,qBAAqB7mF,GACpD,GAAIknF,EACA,OAAOA,EAAkB16E,YAAY,QAAQ10D,KAAKknD,OAAO7gD,aAEjE,CAEJ,CAIA,iBAAAgpI,GACI,GAAIrvI,KAAKknD,QAAUlnD,KAAKomG,WAAY,CAChC,MAAMl/C,EAASlnD,KAAKknD,OACpB,OAAOlnD,KAAKomG,WAAW9hG,KAAK61D,GACjBA,EAAGzF,YAAY,QAAQxN,EAAO7gD,eAE7C,CACA,MAAO,EACX,CACA,MAAAmZ,CAAOmqB,EAAMgkC,GACT,IAAK3tE,KAAKZ,IAAI,OAAqB,OAAZY,KAAK0Q,GACxB,MAAM,IAAIlS,MAAM+tI,IAEpB,IAAKvsI,KAAK2sE,UACN,MAAM,IAAInuE,MAAM,uCAEpB,OAAO4tI,GAAgBz+D,EAAWu+D,GAAUviG,GAAO3pC,KAAK2sE,UAC5D,CACA,UAAMruD,CAAKqrB,EAAM+jC,GACb,GACS,OADD1tE,KAAK0Q,GAKL,MAAM,IAAIlS,MAAM+tI,IAExB,OALQvsI,KAAK2tE,gBAAkB,GAAQD,EAAY/jC,GAK5C3pC,KAAK2tE,SAChB,EE9IJ,IAAI2hE,IAAyB,EACzBC,IAAgB,EACpB,MAAMC,GAAY,CAAEplI,MAAO,EAAG,QAAW,EAAGoqC,KAAM,EAAGi7F,QAAS,EAAGjoH,MAAO,EAAG7kB,IAAK,GAChF,IAAI+sI,GAAYF,GAAmB,QAE/BG,GAAgB,KA4BpB,MAAMC,GA3BN,WACI,IACI,MAAMz1G,EAAU,GAahB,GAXA,CAAC,MAAO,MAAO,OAAQ,QAAQhtB,SAAS0iI,IACpC,IACI,GAA+B,SAA3B,OAAOpwG,UAAUowG,GACjB,MAAM,IAAIrxI,MAAM,gBAGxB,CACA,MAAOgpB,GACH2S,EAAQ35B,KAAKqvI,EACjB,KAEA11G,EAAQ14B,OACR,MAAM,IAAIjD,MAAM,WAAa27B,EAAQtyB,KAAK,OAE9C,GAAImH,OAAOC,aAAa,KAAMwwB,UAAU,SAAWzwB,OAAOC,aAAa,IAAM,KACzE,MAAM,IAAIzQ,MAAM,wBAExB,CACA,MAAOgpB,GACH,OAAOA,EAAMhb,OACjB,CACA,OAAO,IACX,CACwBsjI,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,WAAA3gI,CAAYi+B,GACR5uC,OAAO0K,eAAerJ,KAAM,UAAW,CACnC0L,YAAY,EACZ1M,MAAOuuC,EACP7pB,UAAU,GAElB,CACA,IAAAwsH,CAAKC,EAAUhuI,GACX,MAAMu7C,EAAQyyF,EAAS/1H,cACC,MAApBo1H,GAAU9xF,IACV19C,KAAKowI,mBAAmB,yBAA0B,WAAYD,GAE9DT,GAAYF,GAAU9xF,IAG1BzwC,QAAQ7B,IAAI7I,MAAM0K,QAAS9K,EAC/B,CACA,KAAAiI,IAASjI,GACLnC,KAAKkwI,KAAK,GAAOG,OAAO31G,MAAOv4B,EACnC,CACA,IAAAqyC,IAAQryC,GACJnC,KAAKkwI,KAAK,GAAOG,OAAOC,KAAMnuI,EAClC,CACA,IAAA+K,IAAQ/K,GACJnC,KAAKkwI,KAAK,GAAOG,OAAOE,QAASpuI,EACrC,CACA,SAAAquI,CAAUhkI,EAASuI,EAAMsnB,GAErB,GAAIkzG,GACA,OAAOvvI,KAAKwwI,UAAU,iBAAkBz7H,EAAM,CAAC,GAE9CA,IACDA,EAAO,GAAOoS,OAAOspH,eAEpBp0G,IACDA,EAAS,CAAC,GAEd,MAAMq0G,EAAiB,GACvB/xI,OAAOuG,KAAKm3B,GAAQlvB,SAASpO,IACzB,MAAMC,EAAQq9B,EAAOt9B,GACrB,IACI,GAAIC,aAAiBiR,WAAY,CAC7B,IAAIyF,EAAM,GACV,IAAK,IAAInU,EAAI,EAAGA,EAAIvC,EAAMyC,OAAQF,IAC9BmU,GAAOu6H,GAAIjxI,EAAMuC,IAAM,GACvBmU,GAAOu6H,GAAe,GAAXjxI,EAAMuC,IAErBmvI,EAAelwI,KAAKzB,EAAM,iBAAmB2W,EAAM,IACvD,MAEIg7H,EAAelwI,KAAKzB,EAAM,IAAMsmB,KAAKE,UAAUvmB,GAEvD,CACA,MAAOwoB,GACHkpH,EAAelwI,KAAKzB,EAAM,IAAMsmB,KAAKE,UAAU8W,EAAOt9B,GAAKsH,YAC/D,KAEJqqI,EAAelwI,KAAK,QAAQuU,KAC5B27H,EAAelwI,KAAK,WAAWR,KAAKutC,WACpC,MAAMuyB,EAAStzD,EACf,IAAImmF,EAAM,GACV,OAAQ59E,GACJ,KAAKi7H,GAAUW,cAAe,CAC1Bh+C,EAAM,gBACN,MAAMi+C,EAAQpkI,EACd,OAAQokI,GACJ,IAAK,WACL,IAAK,YACL,IAAK,mBACDj+C,GAAO,IAAMi+C,EACb,MACJ,IAAK,iBACL,IAAK,iBACDj+C,GAAO,eACP,MACJ,IAAK,yBACDA,GAAO,kBAGf,KACJ,CACA,KAAKq9C,GAAUa,eACf,KAAKb,GAAUc,mBACf,KAAKd,GAAUe,YACf,KAAKf,GAAUgB,cACf,KAAKhB,GAAUiB,wBACf,KAAKjB,GAAUkB,qBACf,KAAKlB,GAAUmB,wBACXx+C,EAAM59E,EAGV49E,IACAnmF,GAAW,8CAAiDmmF,EAAM,MAElE+9C,EAAejvI,SACf+K,GAAW,KAAOkkI,EAAe7oI,KAAK,MAAQ,KAGlD,MAAM2f,EAAQ,IAAIhpB,MAAMgO,GAMxB,OALAgb,EAAMs4C,OAASA,EACft4C,EAAMzS,KAAOA,EACbpW,OAAOuG,KAAKm3B,GAAQlvB,SAAQ,SAAUpO,GAClCyoB,EAAMzoB,GAAOs9B,EAAOt9B,EACxB,IACOyoB,CACX,CACA,UAAA4pH,CAAW5kI,EAASuI,EAAMsnB,GACtB,MAAMr8B,KAAKwwI,UAAUhkI,EAASuI,EAAMsnB,EACxC,CACA,kBAAA+zG,CAAmB5jI,EAASzL,EAAM/B,GAC9B,OAAOgB,KAAKoxI,WAAW5kI,EAAS,GAAO2a,OAAOkqH,iBAAkB,CAC5DC,SAAUvwI,EACV/B,MAAOA,GAEf,CACA,MAAAuyI,CAAOz4D,EAAWtsE,EAASuI,EAAMsnB,GACvBy8C,GAGN94E,KAAKoxI,WAAW5kI,EAASuI,EAAMsnB,EACnC,CACA,cAAAm1G,CAAe14D,EAAWtsE,EAASzL,EAAM/B,GAC/B85E,GAGN94E,KAAKowI,mBAAmB5jI,EAASzL,EAAM/B,EAC3C,CACA,cAAAyyI,CAAejlI,GACI,MAAXA,IACAA,EAAU,+CAEVojI,IACA5vI,KAAKoxI,WAAW,8CAA+C,GAAOjqH,OAAOuqH,sBAAuB,CAChG90G,UAAW,6BAA8BizG,KAAMD,IAG3D,CACA,eAAA+B,CAAgB3yI,EAAOwN,GACI,iBAAZ,IAGI,MAAXA,IACAA,EAAU,mBAEVxN,EAAQ,GAAKA,GAAS,mBACtBgB,KAAKoxI,WAAW5kI,EAAS,GAAO2a,OAAOwpH,cAAe,CAClD/zG,UAAW,mBACXg0G,MAAO,oBACP5xI,MAAOA,IAGXA,EAAQ,GACRgB,KAAKoxI,WAAW5kI,EAAS,GAAO2a,OAAOwpH,cAAe,CAClD/zG,UAAW,mBACXg0G,MAAO,cACP5xI,MAAOA,IAGnB,CACA,kBAAA4yI,CAAmBnqH,EAAOoqH,EAAerlI,GAEjCA,EADAA,EACU,KAAOA,EAGP,GAEVib,EAAQoqH,GACR7xI,KAAKoxI,WAAW,mBAAqB5kI,EAAS,GAAO2a,OAAO2qH,iBAAkB,CAC1ErqH,MAAOA,EACPoqH,cAAeA,IAGnBpqH,EAAQoqH,GACR7xI,KAAKoxI,WAAW,qBAAuB5kI,EAAS,GAAO2a,OAAO4qH,oBAAqB,CAC/EtqH,MAAOA,EACPoqH,cAAeA,GAG3B,CACA,QAAAG,CAAS9nH,EAAQoE,GACTpE,IAAWvrB,QAAoB,MAAVurB,GACrBlqB,KAAKoxI,WAAW,cAAe,GAAOjqH,OAAO4pH,YAAa,CAAEhwI,KAAMutB,EAAKvtB,MAE/E,CACA,aAAAkxI,CAAc/nH,EAAQoE,GACdpE,IAAWoE,EACXtuB,KAAKoxI,WAAW,qCAAuC/rH,KAAKE,UAAU+I,EAAKvtB,MAAQ,6BAA8B,GAAOomB,OAAOuqH,sBAAuB,CAAE3wI,KAAMmpB,EAAOnpB,KAAM67B,UAAW,QAEjL1S,IAAWvrB,QAAoB,MAAVurB,GAC1BlqB,KAAKoxI,WAAW,cAAe,GAAOjqH,OAAO4pH,YAAa,CAAEhwI,KAAMutB,EAAKvtB,MAE/E,CACA,mBAAOmxI,GAIH,OAHKvC,KACDA,GAAgB,IAAI,GC/TT,iBDiURA,EACX,CACA,oBAAOwC,CAAcC,EAAYC,GAM7B,IALKD,GAAcC,GACfryI,KAAKkyI,eAAed,WAAW,wCAAyC,GAAOjqH,OAAOuqH,sBAAuB,CACzG90G,UAAW,kBAGf0yG,GAAwB,CACxB,IAAK8C,EACD,OAEJpyI,KAAKkyI,eAAed,WAAW,6BAA8B,GAAOjqH,OAAOuqH,sBAAuB,CAC9F90G,UAAW,iBAEnB,CACA2yG,KAAkB6C,EAClB9C,KAA2B+C,CAC/B,CACA,kBAAOC,CAAYnC,GACf,MAAMzyF,EAAQ8xF,GAAUW,EAAS/1H,eACpB,MAATsjC,EAIJgyF,GAAYhyF,EAHR,GAAOw0F,eAAehlI,KAAK,uBAAyBijI,EAI5D,CACA,WAAO5xH,CAAKgvB,GACR,OAAO,IAAI,GAAOA,EACtB,EAEJ,GAAOpmB,OAAS6oH,GAChB,GAAOK,OAASN,GEjWT,MCGD,GAAS,IAAI,GDHI,eCKvB,SAASwC,GAAUvzI,GACf,QAAUA,EAAiB,WAC/B,CACA,SAASwzI,GAAS1/H,GACd,OAAIA,EAAM5R,QAGV4R,EAAM5R,MAAQ,WACV,MAAMiB,EAAOR,MAAMnC,UAAU0B,MAAMD,KAAKoB,WACxC,OAAOmwI,GAAS,IAAIviI,WAAWtO,MAAMnC,UAAU0B,MAAMqB,MAAMuQ,EAAO3Q,IACtE,GALW2Q,CAOf,CAIA,SAASqH,GAAUnb,GACf,MAA2B,iBAAZ,GAAwBA,GAASA,GAAUA,EAAQ,GAAO,CAC7E,CACO,SAAS,GAAQA,GACpB,GAAa,MAATA,EACA,OAAO,EAEX,GAAIA,EAAMsQ,cAAgBW,WACtB,OAAO,EAEX,GAAuB,iBAAZ,EACP,OAAO,EAEX,IAAKkK,GAAUnb,EAAMyC,SAAWzC,EAAMyC,OAAS,EAC3C,OAAO,EAEX,IAAK,IAAIF,EAAI,EAAGA,EAAIvC,EAAMyC,OAAQF,IAAK,CACnC,MAAMlC,EAAIL,EAAMuC,GAChB,IAAK4Y,GAAU9a,IAAMA,EAAI,GAAKA,GAAK,IAC/B,OAAO,CAEf,CACA,OAAO,CACX,CACO,SAASozI,GAASzzI,EAAOib,GAI5B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7B,GAAO03H,gBAAgB3yI,EAAO,0BAC9B,MAAM8V,EAAS,GACf,KAAO9V,GACH8V,EAAOlK,QAAgB,IAAR5L,GACfA,EAAQwf,SAASxP,OAAOhQ,EAAQ,MAKpC,OAHsB,IAAlB8V,EAAOrT,QACPqT,EAAOtU,KAAK,GAETgyI,GAAS,IAAIviI,WAAW6E,GACnC,CAOA,GANImF,EAAQy4H,oBAAyC,iBAAZ,GAAkD,OAA1B1zI,EAAMyI,UAAU,EAAG,KAChFzI,EAAQ,KAAOA,GAEfuzI,GAAUvzI,KACVA,EAAQA,EAAM2zI,eAEdC,GAAY5zI,GAAQ,CACpB,IAAI0W,EAAM1W,EAAMyI,UAAU,GACtBiO,EAAIjU,OAAS,IACU,SAAnBwY,EAAQ44H,OACRn9H,EAAM,IAAMA,EAEY,UAAnBuE,EAAQ44H,OACbn9H,GAAO,IAGP,GAAO06H,mBAAmB,yBAA0B,QAASpxI,IAGrE,MAAM8V,EAAS,GACf,IAAK,IAAIvT,EAAI,EAAGA,EAAImU,EAAIjU,OAAQF,GAAK,EACjCuT,EAAOtU,KAAKge,SAAS9I,EAAIjO,UAAUlG,EAAGA,EAAI,GAAI,KAElD,OAAOixI,GAAS,IAAIviI,WAAW6E,GACnC,CACA,OAAI,GAAQ9V,GACDwzI,GAAS,IAAIviI,WAAWjR,IAE5B,GAAOoxI,mBAAmB,yBAA0B,QAASpxI,EACxE,CAoCO,SAAS4zI,GAAY5zI,EAAOyC,GAC/B,QAAuB,iBAAZ,IAAyBzC,EAAMyJ,MAAM,qBAG5ChH,GAAUzC,EAAMyC,SAAW,EAAI,EAAIA,EAI3C,CACA,MAAMqxI,GAAgB,mBACf,SAASC,GAAQ/zI,EAAOib,GAI3B,GAHKA,IACDA,EAAU,CAAC,GAEQ,iBAAZ,EAAsB,CAC7B,GAAO03H,gBAAgB3yI,EAAO,yBAC9B,IAAI0W,EAAM,GACV,KAAO1W,GACH0W,EAAMo9H,GAAsB,GAAR9zI,GAAe0W,EACnC1W,EAAQiK,KAAK6a,MAAM9kB,EAAQ,IAE/B,OAAI0W,EAAIjU,QACAiU,EAAIjU,OAAS,IACbiU,EAAM,IAAMA,GAET,KAAOA,GAEX,MACX,CACA,GAAuB,iBAAZ,EAEP,OADA1W,EAAQA,EAAMqH,SAAS,KACb5E,OAAS,EACP,MAAQzC,EAEb,KAAOA,EAKlB,GAHIib,EAAQy4H,oBAAyC,iBAAZ,GAAkD,OAA1B1zI,EAAMyI,UAAU,EAAG,KAChFzI,EAAQ,KAAOA,GAEfuzI,GAAUvzI,GACV,OAAOA,EAAM2zI,cAEjB,GAAIC,GAAY5zI,GAYZ,OAXIA,EAAMyC,OAAS,IACQ,SAAnBwY,EAAQ44H,OACR7zI,EAAQ,MAAQA,EAAMyI,UAAU,GAER,UAAnBwS,EAAQ44H,OACb7zI,GAAS,IAGT,GAAOoxI,mBAAmB,yBAA0B,QAASpxI,IAG9DA,EAAMob,cAEjB,GAAI,GAAQpb,GAAQ,CAChB,IAAI8V,EAAS,KACb,IAAK,IAAIvT,EAAI,EAAGA,EAAIvC,EAAMyC,OAAQF,IAAK,CACnC,IAAIlC,EAAIL,EAAMuC,GACduT,GAAUg+H,IAAmB,IAAJzzI,IAAa,GAAKyzI,GAAkB,GAAJzzI,EAC7D,CACA,OAAOyV,CACX,CACA,OAAO,GAAOs7H,mBAAmB,wBAAyB,QAASpxI,EACvE,CC/LO,MCKD,GAAS,IAAI,GDLI,aCMvB,SAASg0I,GAAgBh0I,GACrB,MAAM8V,EAAS,GACf,KAAO9V,GACH8V,EAAOlK,QAAgB,IAAR5L,GACfA,IAAU,EAEd,OAAO8V,CACX,CACA,SAASm+H,GAAkBtpG,EAAMzmC,EAAQzB,GACrC,IAAIqT,EAAS,EACb,IAAK,IAAIvT,EAAI,EAAGA,EAAIE,EAAQF,IACxBuT,EAAmB,IAATA,EAAgB60B,EAAKzmC,EAAS3B,GAE5C,OAAOuT,CACX,CACA,SAASo+H,GAAQzzH,GACb,GAAI9d,MAAM2Q,QAAQmN,GAAS,CACvB,IAAIszB,EAAU,GAId,GAHAtzB,EAAOtS,SAAQ,SAAU44G,GACrBhzE,EAAUA,EAAQ3xC,OAAO8xI,GAAQntB,GACrC,IACIhzE,EAAQtxC,QAAU,GAElB,OADAsxC,EAAQnoC,QAAQ,IAAOmoC,EAAQtxC,QACxBsxC,EAEX,MAAMtxC,EAASuxI,GAAgBjgG,EAAQtxC,QAEvC,OADAA,EAAOmJ,QAAQ,IAAOnJ,EAAOA,QACtBA,EAAOL,OAAO2xC,EACzB,CFhBG,IAAqB/zC,EACf4zI,GADe5zI,EEiBPygB,MFhBgBzgB,EAAMyC,OAAS,IAAO,GAAQzC,IEiB3D,GAAOoxI,mBAAmB,+BAAgC,SAAU3wH,GAExE,MAAMkqB,EAAOhoC,MAAMnC,UAAU0B,MAAMD,KAAKwxI,GAAShzH,IACjD,GAAoB,IAAhBkqB,EAAKloC,QAAgBkoC,EAAK,IAAM,IAChC,OAAOA,EAEN,GAAIA,EAAKloC,QAAU,GAEpB,OADAkoC,EAAK/+B,QAAQ,IAAO++B,EAAKloC,QAClBkoC,EAEX,MAAMloC,EAASuxI,GAAgBrpG,EAAKloC,QAEpC,OADAA,EAAOmJ,QAAQ,IAAOnJ,EAAOA,QACtBA,EAAOL,OAAOuoC,EACzB,CAIA,SAASwpG,GAAgBxpG,EAAMzmC,EAAQkwI,EAAa3xI,GAChD,MAAMqT,EAAS,GACf,KAAOs+H,EAAclwI,EAAS,EAAIzB,GAAQ,CACtC,MAAMg+D,EAAU4zE,GAAQ1pG,EAAMypG,GAC9Bt+H,EAAOtU,KAAKi/D,EAAQ3qD,SACpBs+H,GAAe3zE,EAAQshC,UACL79F,EAAS,EAAIzB,GAC3B,GAAO2vI,WAAW,uBAAwB,GAAOjqH,OAAOmsH,eAAgB,CAAC,EAEjF,CACA,MAAO,CAAEvyC,SAAW,EAAIt/F,EAASqT,OAAQA,EAC7C,CAEA,SAASu+H,GAAQ1pG,EAAMzmC,GAKnB,GAJoB,IAAhBymC,EAAKloC,QACL,GAAO2vI,WAAW,iBAAkB,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAGnE3pG,EAAKzmC,IAAW,IAAM,CACtB,MAAMo+C,EAAe3X,EAAKzmC,GAAU,IAChCA,EAAS,EAAIo+C,EAAe3X,EAAKloC,QACjC,GAAO2vI,WAAW,+BAAgC,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAErF,MAAM7xI,EAASwxI,GAAkBtpG,EAAMzmC,EAAS,EAAGo+C,GAInD,OAHIp+C,EAAS,EAAIo+C,EAAe7/C,EAASkoC,EAAKloC,QAC1C,GAAO2vI,WAAW,8BAA+B,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAE7EH,GAAgBxpG,EAAMzmC,EAAQA,EAAS,EAAIo+C,EAAcA,EAAe7/C,EACnF,CACK,GAAIkoC,EAAKzmC,IAAW,IAAM,CAC3B,MAAMzB,EAASkoC,EAAKzmC,GAAU,IAI9B,OAHIA,EAAS,EAAIzB,EAASkoC,EAAKloC,QAC3B,GAAO2vI,WAAW,uBAAwB,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAEtEH,GAAgBxpG,EAAMzmC,EAAQA,EAAS,EAAGzB,EACrD,CACK,GAAIkoC,EAAKzmC,IAAW,IAAM,CAC3B,MAAMo+C,EAAe3X,EAAKzmC,GAAU,IAChCA,EAAS,EAAIo+C,EAAe3X,EAAKloC,QACjC,GAAO2vI,WAAW,uBAAwB,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAE7E,MAAM7xI,EAASwxI,GAAkBtpG,EAAMzmC,EAAS,EAAGo+C,GAKnD,OAJIp+C,EAAS,EAAIo+C,EAAe7/C,EAASkoC,EAAKloC,QAC1C,GAAO2vI,WAAW,uBAAwB,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAGtE,CAAEvyC,SAAW,EAAIz/C,EAAe7/C,EAASqT,OADjCi+H,GAAQppG,EAAKzoC,MAAMgC,EAAS,EAAIo+C,EAAcp+C,EAAS,EAAIo+C,EAAe7/C,IAE7F,CACK,GAAIkoC,EAAKzmC,IAAW,IAAM,CAC3B,MAAMzB,EAASkoC,EAAKzmC,GAAU,IAK9B,OAJIA,EAAS,EAAIzB,EAASkoC,EAAKloC,QAC3B,GAAO2vI,WAAW,iBAAkB,GAAOjqH,OAAOmsH,eAAgB,CAAC,GAGhE,CAAEvyC,SAAW,EAAIt/F,EAASqT,OADlBi+H,GAAQppG,EAAKzoC,MAAMgC,EAAS,EAAGA,EAAS,EAAIzB,IAE/D,CACA,MAAO,CAAEs/F,SAAU,EAAGjsF,OAAQi+H,GAAQppG,EAAKzmC,IAC/C,CCzGA,MAAM,GAAM,IAAIm6C,GAAO,eAChB,MAAMk2F,GACT,iBAAO90H,CAAW+0H,GACd,IAAKA,EAAQjnH,WAAW,GAAIknH,eACxB,MAAM,IAAIj1I,MAAM,wCAAwC,GAAIi1I,kBAEhE,OAAOF,GAAWG,QAAQ,GAAWF,EAAQtyI,MAAM,GAAI,aAC3D,CACA,cAAOwyI,CAAQF,GACX,MAAM/zE,EDiGP,SAAgB91B,GACnB,MAAM76B,EAAQ2jI,GAAS9oG,GACjB81B,EAAU4zE,GAAQvkI,EAAO,GAI/B,OAHI2wD,EAAQshC,WAAajyF,EAAMrN,QAC3B,GAAO2uI,mBAAmB,mBAAoB,OAAQzmG,GAEnD81B,EAAQ3qD,MACnB,CCxGwB,CAAW0+H,GAASlvI,IAAI,IACxC,OAGR6oC,eAA0BlqC,GACtB,MAAM,UAAE0qE,EAAS,IAAE0a,EAAG,IAAE+kD,GAqB5B,SAAqBnqI,GACjB,IAAKtB,MAAM2Q,QAAQrP,GACf,MAAM,IAAIzE,MAAM,gCAEpB,GAAIyE,EAAOxB,OAAS,GAAM,EACtB,MAAM,IAAIjD,MAAM,oDAEpB,MAAOmvE,EAAW0a,KAAQ+kD,GAAOnqI,EACjC,IAAK0qE,GAAahsE,MAAM2Q,QAAQq7D,GAC5B,MAAM,IAAInvE,MAAM,uDAEpB,IAAK6pF,GAAO1mF,MAAM2Q,QAAQ+1E,GACtB,MAAM,IAAI7pF,MAAM,6DAEpB,MAAO,CAAEmvE,YAAW0a,MAAK+kD,MAC7B,CApCoCuG,CAAY1wI,GACtCsP,EAAM,CAAC,EACb,IAAK,IAAIhR,EAAI,EAAGA,EAAI6rI,EAAI3rI,OAAQF,GAAK,EACjC,IACIgR,EAAIyoC,GAAYoyF,EAAI7rI,KAAO6rI,EAAI7rI,EAAI,EACvC,CACA,MAAO0iB,GACH,GAAIuD,MAAM,iDAAkD4lH,EAAI7rI,GAAI0iB,EACxE,CAEJ,MAAM2vH,EAKV,SAAmBvrD,GAEf,OAAKA,EAAI5mF,OAEFwkC,OAAO,KAAO,GAAWoiD,IADrBpiD,OAAO,EAEtB,CAViB4tG,CAAUxrD,GACjBjzC,EAAM,GAAIx2C,OAAO2T,EAAKqhI,EAAMjmE,GAElC,OAwBJ,SAAwB0a,EAAK+kD,EAAKh4F,EAAKu4B,GACnC,MAAMmmE,EAAkB,GDNjBf,GAAQG,GCM+B,CAAC7qD,KAAQ+kD,MACvD,IAAKh4F,EAAI51B,OAAOs0H,EAAiBnmE,GAC7B,MAAM,IAAInvE,MAAM,iCAExB,CA9BIu1I,CAAe1rD,EAAK+kD,EAAKh4F,EAAKu4B,GACvBv4B,CACX,CAlBe4+F,CAAWv0E,EACtB,EChBW,MAAMw0E,WAAiBpmG,IACrC,GAAQ,EACR,GAAS,IAAIA,IACb,GAAY,IAAIA,IAChB,GACA,GACA,GAEA,WAAAv+B,CAAY2K,EAAU,CAAC,GAGtB,GAFAm2B,UAEMn2B,EAAQqlG,SAAWrlG,EAAQqlG,QAAU,GAC1C,MAAM,IAAIl/G,UAAU,6CAGrB,GAA8B,iBAAnB6Z,EAAQi6H,QAA0C,IAAnBj6H,EAAQi6H,OACjD,MAAM,IAAI9zI,UAAU,4CAGrBJ,MAAK,EAAWia,EAAQqlG,QACxBt/G,MAAK,EAAUia,EAAQi6H,QAAU3pI,OAAO+wG,kBACxCt7G,MAAK,EAAcia,EAAQk6H,UAC5B,CAGA,cAAIC,GACH,OAAOp0I,MAAK,CACb,CAEA,GAAetB,GACd,GAAgC,mBAArBsB,MAAK,EAIhB,IAAK,MAAOjB,EAAKymD,KAAS9mD,EACzBsB,MAAK,EAAYjB,EAAKymD,EAAKxmD,MAE7B,CAEA,GAAiBD,EAAKymD,GACrB,MAA2B,iBAAhBA,EAAK0+D,QAAuB1+D,EAAK0+D,QAAU15G,KAAKu2D,QAC1B,mBAArB/gE,MAAK,GACfA,MAAK,EAAYjB,EAAKymD,EAAKxmD,OAGrBgB,KAAKqnD,OAAOtoD,GAIrB,CAEA,GAAsBA,EAAKymD,GAE1B,IAAgB,IADAxlD,MAAK,EAAiBjB,EAAKymD,GAE1C,OAAOA,EAAKxmD,KAEd,CAEA,GAAcD,EAAKymD,GAClB,OAAOA,EAAK0+D,OAASlkH,MAAK,EAAsBjB,EAAKymD,GAAQA,EAAKxmD,KACnE,CAEA,GAAMD,EAAKL,GACV,MAAM8mD,EAAO9mD,EAAMU,IAAIL,GAEvB,OAAOiB,MAAK,EAAcjB,EAAKymD,EAChC,CAEA,GAAKzmD,EAAKC,GACTgB,MAAK,EAAOV,IAAIP,EAAKC,GACrBgB,MAAK,IAEDA,MAAK,GAASA,MAAK,IACtBA,MAAK,EAAQ,EACbA,MAAK,EAAeA,MAAK,GACzBA,MAAK,EAAYA,MAAK,EACtBA,MAAK,EAAS,IAAI6tC,IAEpB,CAEA,GAAc9uC,EAAKymD,GAClBxlD,MAAK,EAAUqnD,OAAOtoD,GACtBiB,MAAK,EAAKjB,EAAKymD,EAChB,CAEA,GAAE,GACD,IAAK,MAAMA,KAAQxlD,MAAK,EAAW,CAClC,MAAOjB,EAAKC,GAASwmD,EAChBxlD,MAAK,EAAOf,IAAIF,KAEJ,IADAiB,MAAK,EAAiBjB,EAAKC,WAEpCwmD,EAGT,CAEA,IAAK,MAAMA,KAAQxlD,MAAK,EAAQ,CAC/B,MAAOjB,EAAKC,GAASwmD,GAEL,IADAxlD,MAAK,EAAiBjB,EAAKC,WAEpCwmD,EAER,CACD,CAEA,GAAApmD,CAAIL,GACH,GAAIiB,MAAK,EAAOf,IAAIF,GAAM,CACzB,MAAMymD,EAAOxlD,MAAK,EAAOZ,IAAIL,GAC7B,OAAOiB,MAAK,EAAcjB,EAAKymD,EAChC,CAEA,GAAIxlD,MAAK,EAAUf,IAAIF,GAAM,CAC5B,MAAMymD,EAAOxlD,MAAK,EAAUZ,IAAIL,GAChC,IAAyC,IAArCiB,MAAK,EAAiBjB,EAAKymD,GAE9B,OADAxlD,MAAK,EAAcjB,EAAKymD,GACjBA,EAAKxmD,KAEd,CACD,CAEA,GAAAM,CAAIP,EAAKC,GAAO,OAACk1I,EAASl0I,MAAK,GAAW,CAAC,GAC1C,MAAMkkH,EAA2B,iBAAXgwB,GAAuBA,IAAW3pI,OAAO+wG,kBAC3D9wG,KAAKu2D,MAAQmzE,OACdh1I,EAWH,OATIc,MAAK,EAAOf,IAAIF,GACnBiB,MAAK,EAAOV,IAAIP,EAAK,CACpBC,QACAklH,WAGDlkH,MAAK,EAAKjB,EAAK,CAACC,QAAOklH,WAGjBlkH,IACR,CAEA,GAAAf,CAAIF,GACH,OAAIiB,MAAK,EAAOf,IAAIF,IACXiB,MAAK,EAAiBjB,EAAKiB,MAAK,EAAOZ,IAAIL,MAGhDiB,MAAK,EAAUf,IAAIF,KACdiB,MAAK,EAAiBjB,EAAKiB,MAAK,EAAUZ,IAAIL,GAIxD,CAEA,IAAAqK,CAAKrK,GACJ,OAAIiB,MAAK,EAAOf,IAAIF,GACZiB,MAAK,EAAMjB,EAAKiB,MAAK,GAGzBA,MAAK,EAAUf,IAAIF,GACfiB,MAAK,EAAMjB,EAAKiB,MAAK,QAD7B,CAGD,CAEA,OAAOjB,GACN,MAAMmgI,EAAUl/H,MAAK,EAAOqnD,OAAOtoD,GAKnC,OAJImgI,GACHl/H,MAAK,IAGCA,MAAK,EAAUqnD,OAAOtoD,IAAQmgI,CACtC,CAEA,KAAA3/H,GACCS,MAAK,EAAOT,QACZS,MAAK,EAAUT,QACfS,MAAK,EAAQ,CACd,CAEA,MAAAq0I,CAAOC,GACN,KAAMA,GAAWA,EAAU,GAC1B,MAAM,IAAIl0I,UAAU,6CAGrB,MAAMopH,EAAQ,IAAIxpH,MAAK,KACjBu0I,EAAc/qB,EAAM/nH,OAAS6yI,EAC/BC,EAAc,GACjBv0I,MAAK,EAAS,IAAI6tC,IAAI27E,GACtBxpH,MAAK,EAAY,IAAI6tC,IACrB7tC,MAAK,EAAQwpH,EAAM/nH,SAEf8yI,EAAc,GACjBv0I,MAAK,EAAewpH,EAAMtoH,MAAM,EAAGqzI,IAGpCv0I,MAAK,EAAY,IAAI6tC,IAAI27E,EAAMtoH,MAAMqzI,IACrCv0I,MAAK,EAAS,IAAI6tC,IAClB7tC,MAAK,EAAQ,GAGdA,MAAK,EAAWs0I,CACjB,CAEA,KAAEpvI,GACD,IAAK,MAAOnG,KAAQiB,WACbjB,CAER,CAEA,OAAEkE,GACD,IAAK,MAAO,CAAEjE,KAAUgB,WACjBhB,CAER,CAEA,EAAGykC,OAAOyb,YACT,IAAK,MAAMsG,KAAQxlD,MAAK,EAAQ,CAC/B,MAAOjB,EAAKC,GAASwmD,GAEL,IADAxlD,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAEpB,CAEA,IAAK,MAAMwmD,KAAQxlD,MAAK,EAAW,CAClC,MAAOjB,EAAKC,GAASwmD,EAChBxlD,MAAK,EAAOf,IAAIF,KAEJ,IADAiB,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAGrB,CACD,CAEA,kBAAEw1I,GACD,IAAIhrB,EAAQ,IAAIxpH,MAAK,GACrB,IAAK,IAAIuB,EAAIioH,EAAM/nH,OAAS,EAAGF,GAAK,IAAKA,EAAG,CAC3C,MAAMikD,EAAOgkE,EAAMjoH,IACZxC,EAAKC,GAASwmD,GAEL,IADAxlD,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAEpB,CAEAwqH,EAAQ,IAAIxpH,MAAK,GACjB,IAAK,IAAIuB,EAAIioH,EAAM/nH,OAAS,EAAGF,GAAK,IAAKA,EAAG,CAC3C,MAAMikD,EAAOgkE,EAAMjoH,IACZxC,EAAKC,GAASwmD,EAChBxlD,MAAK,EAAOf,IAAIF,KAEJ,IADAiB,MAAK,EAAiBjB,EAAKC,UAEpC,CAACD,EAAKC,EAAMA,OAGrB,CACD,CAEA,iBAAEy1I,GACD,IAAK,MAAO11I,EAAKC,KAAUgB,MAAK,SACzB,CAACjB,EAAKC,EAAMA,MAEpB,CAEA,QAAIP,GACH,IAAKuB,MAAK,EACT,OAAOA,MAAK,EAAUvB,KAGvB,IAAIi2I,EAAe,EACnB,IAAK,MAAM31I,KAAOiB,MAAK,EAAUkF,OAC3BlF,MAAK,EAAOf,IAAIF,IACpB21I,IAIF,OAAOzrI,KAAKC,IAAIlJ,MAAK,EAAQ00I,EAAc10I,MAAK,EACjD,CAEA,WAAIs/G,GACH,OAAOt/G,MAAK,CACb,CAEA,OAAAmwD,GACC,OAAOnwD,KAAKy0I,kBACb,CAEA,OAAAtnI,CAAQwnI,EAAkBC,EAAe50I,MACxC,IAAK,MAAOjB,EAAKC,KAAUgB,KAAKy0I,mBAC/BE,EAAiB1zI,KAAK2zI,EAAc51I,EAAOD,EAAKiB,KAElD,CAEA,IAAKyjC,OAAOqB,eACX,MAAO,UACR,CAEA,QAAAz+B,GACC,MAAO,YAAYrG,KAAKvB,QAAQuB,KAAKs/G,UACtC,CAEA,CAAC77E,OAAOmL,IAAI,iCACX,OAAO5uC,KAAKqG,UACb,ECxSM,SAASwuI,GAAcC,EAAgBz7B,EAAU07B,GACpD,MAAO,GAAGD,UAAuBz7B,UAAiB07B,GACtD,CAIO5nG,eAAenT,GAAQg7G,EAAU5wF,GACpC,MAAM6wF,QAAYl1H,MAAMi1H,EAAU,CAC9B/1B,QAAS,IAAIi2B,QAAQ,CACjBh2B,OAAQ,yBAEZ96D,WAGJ,aADkB6wF,EAAIv6H,MAE1B,CAOO,SAASy6H,GAAY97B,EAAU07B,GAClC,MAAO,GAAGA,KAAc17B,GAC5B,CCxBA,MAAM,GAAM16G,OAAO01B,OAAO,GAAM,0BAA2B,CACvD7M,MAAO,GAAM,kCAsMjB,GAhMA,MACI3oB,OACAu2I,UACAC,SACAC,SACAC,kBAOA,WAAAjmI,CAAY2K,EAAU,CAAC,GACnBja,KAAKnB,OAAS,IAAIo1I,GAAS,CAAE30B,QAASrlG,GAASu7H,UAAY,MAC3Dx1I,KAAKo1I,UAAY,IAAInB,GAAS,CAAE30B,QAASrlG,GAASu7H,UAAY,MAC9Dx1I,KAAKq1I,SAAW,CACZ,uCACA,8BAEJr1I,KAAKs1I,SAAWr7H,EAAQ+f,SAAW,GACnCh6B,KAAKu1I,kBAAoB,EAC7B,CAKA,MAAAjxF,GACItkD,KAAKu1I,kBAAkBpoI,SAAQ0iH,IAAgBA,EAAWzoD,OAAO,GACrE,CAKA,UAAAquE,GACI,OAAOz1I,KAAKq1I,QAChB,CAKA,mBAAAK,GACI,MAAMC,EAAa,IAAI31I,KAAKq1I,UAC5B,IAAK,IAAI9zI,EAAIo0I,EAAWl0I,OAAS,EAAGF,EAAI,EAAGA,IAAK,CAC5C,MAAMiB,EAAIyG,KAAK6a,MAAM7a,KAAKm0B,SAAW77B,GAC/B6+F,EAAOu1C,EAAWp0I,GACxBo0I,EAAWp0I,GAAKo0I,EAAWnzI,GAC3BmzI,EAAWnzI,GAAK49F,CACpB,CACA,OAAOu1C,CACX,CAMA,UAAAC,CAAWC,GACP71I,KAAKq1I,SAAWQ,CACpB,CACA,aAAM3xI,CAAQm1G,EAAUy8B,EAAS,KAC7B,OAAQA,GACJ,IAAK,IACD,OAAO91I,KAAK+1I,SAAS18B,GACzB,IAAK,OACD,OAAOr5G,KAAKg2I,SAAS38B,GACzB,IAAK,MACD,OAAOr5G,KAAKi2I,WAAW58B,GAC3B,QACI,MAAM,IAAI76G,MAAM,GAAGs3I,sBAE/B,CAMA,cAAMC,CAAS18B,GACX,MAAM07B,EAAa,IACbt1B,EAASz/G,KAAKnB,OAAOO,IAAI,GAAkBi6G,EAAU07B,IAC3D,GAAc,MAAVt1B,EACA,OAAOA,EAEX,IAAI76D,GAAU,EACd,IAAK,MAAMsxF,KAAUl2I,KAAK01I,sBAAuB,CAC7C,MAAM7lB,EAAa,IAAI9c,gBACvB/yG,KAAKu1I,kBAAkB/0I,KAAKqvH,GAC5B,IACI,MAAMx/F,QAAiBrwB,KAAKs1I,SAAS,GAAoBY,EAAQ78B,EAAU07B,GAAallB,EAAWzrE,QAC7Fza,EAAOtZ,EAASkuF,OAAOj6G,KAAIqc,GAAKA,EAAEgpB,OAClC48D,EAAMt9F,KAAKC,OAAOmnB,EAASkuF,OAAOj6G,KAAIqc,GAAKA,EAAE+9F,OAEnD,OADA1+G,KAAKnB,OAAOS,IAAI,GAAkB+5G,EAAU07B,GAAaprG,EAAM,CAAEuqG,OAAQ3tC,IAClE58D,CACX,CACA,MAAOljB,GACCopG,EAAWzrE,OAAOQ,UAClBA,GAAU,GAEd,GAAIp9B,MAAM,GAAG0uH,uBAA4B78B,YAAmB07B,IAChE,CACA,QACI/0I,KAAKu1I,kBAAoBv1I,KAAKu1I,kBAAkB1oI,QAAO1F,GAAKA,IAAM0oH,GACtE,CACJ,CACA,GAAIjrE,EACA,MAAMjmD,OAAO01B,OAAO,IAAI71B,MAAM,qBAAsB,CAChDuW,KAAM,eAGd,MAAM,IAAIvW,MAAM,qBAAqB66G,YAAmB07B,IAC5D,CAMA,cAAMiB,CAAS38B,GACX,MAAM07B,EAAa,OACbt1B,EAASz/G,KAAKnB,OAAOO,IAAI,GAAkBi6G,EAAU07B,IAC3D,GAAc,MAAVt1B,EACA,OAAOA,EAEX,IAAI76D,GAAU,EACd,IAAK,MAAMsxF,KAAUl2I,KAAK01I,sBAAuB,CAC7C,MAAM7lB,EAAa,IAAI9c,gBACvB/yG,KAAKu1I,kBAAkB/0I,KAAKqvH,GAC5B,IACI,MAAMx/F,QAAiBrwB,KAAKs1I,SAAS,GAAoBY,EAAQ78B,EAAU07B,GAAallB,EAAWzrE,QAC7Fza,EAAOtZ,EAASkuF,OAAOj6G,KAAIqc,GAAKA,EAAEgpB,OAClC48D,EAAMt9F,KAAKC,OAAOmnB,EAASkuF,OAAOj6G,KAAIqc,GAAKA,EAAE+9F,OAEnD,OADA1+G,KAAKnB,OAAOS,IAAI,GAAkB+5G,EAAU07B,GAAaprG,EAAM,CAAEuqG,OAAQ3tC,IAClE58D,CACX,CACA,MAAOljB,GACCopG,EAAWzrE,OAAOQ,UAClBA,GAAU,GAEd,GAAIp9B,MAAM,GAAG0uH,uBAA4B78B,YAAmB07B,IAChE,CACA,QACI/0I,KAAKu1I,kBAAoBv1I,KAAKu1I,kBAAkB1oI,QAAO1F,GAAKA,IAAM0oH,GACtE,CACJ,CACA,GAAIjrE,EACA,MAAMjmD,OAAO01B,OAAO,IAAI71B,MAAM,wBAAyB,CACnDuW,KAAM,eAGd,MAAM,IAAIvW,MAAM,qBAAqB66G,YAAmB07B,IAC5D,CAMA,gBAAMkB,CAAW58B,GACb,MAAM07B,EAAa,MACbt1B,EAASz/G,KAAKo1I,UAAUh2I,IAAI,GAAkBi6G,EAAU07B,IAC9D,GAAc,MAAVt1B,EACA,OAAOA,EAEX,IAAI76D,GAAU,EACd,IAAK,MAAMsxF,KAAUl2I,KAAK01I,sBAAuB,CAC7C,MAAM7lB,EAAa,IAAI9c,gBACvB/yG,KAAKu1I,kBAAkB/0I,KAAKqvH,GAC5B,IACI,MAAMx/F,QAAiBrwB,KAAKs1I,SAAS,GAAoBY,EAAQ78B,EAAU07B,GAAallB,EAAWzrE,QAC7Fza,EAAOtZ,EAASkuF,OAAOj6G,KAAIqc,GAAK,CAACA,EAAEgpB,KAAK3jC,QAAQ,SAAU,OAC1DugG,EAAMt9F,KAAKC,OAAOmnB,EAASkuF,OAAOj6G,KAAIqc,GAAKA,EAAE+9F,OAEnD,OADA1+G,KAAKo1I,UAAU91I,IAAI,GAAkB+5G,EAAU07B,GAAaprG,EAAM,CAAEuqG,OAAQ3tC,IACrE58D,CACX,CACA,MAAOljB,GACCopG,EAAWzrE,OAAOQ,UAClBA,GAAU,GAEd,GAAIp9B,MAAM,GAAG0uH,uBAA4B78B,YAAmB07B,IAChE,CACA,QACI/0I,KAAKu1I,kBAAoBv1I,KAAKu1I,kBAAkB1oI,QAAO1F,GAAKA,IAAM0oH,GACtE,CACJ,CACA,GAAIjrE,EACA,MAAMjmD,OAAO01B,OAAO,IAAI71B,MAAM,uBAAwB,CAClDuW,KAAM,eAGd,MAAM,IAAIvW,MAAM,qBAAqB66G,YAAmB07B,IAC5D,CACA,UAAAp5G,GACI37B,KAAKnB,OAAOU,QACZS,KAAKo1I,UAAU71I,OACnB,GCrME,GAAM,IAAI89C,GAAO,kBAChB,MAAM84F,GACThhF,SAMA,mBAAav2D,GACT,OAAO,IAAIu3I,EACf,CACA,WAAA7mI,CAAY6lD,EAAW,IAAI,IACvBn1D,KAAKm1D,SAAWA,CACpB,CAQA,gBAAMihF,CAAW54D,GACb,IAAIghC,EACJ,IACIA,QAAgBx+G,KAAKm1D,SAAS8gF,WAAWz4D,EAC7C,CACA,MAAOh2D,GAEH,MADA,GAAIA,MAAM,iBAAkBA,GACtB,IAAIhpB,MAAM,mBACpB,CACA,IAAKggH,EACD,MAAM,IAAIhgH,MAAM,qBAAqBg/E,KACzC,MAAM1oE,EAAS,GAmBf,OAlBA0pG,EAAQrxG,SAASsP,IACI,iBAANA,EACP3H,EAAOtU,KAAKic,GAEP9a,MAAM2Q,QAAQmK,GACnBA,EAAEtP,SAASkpI,IACW,iBAAPA,EACPvhI,EAAOtU,KAAK61I,GAGZvhI,EAAOtU,KAAKw6C,GAAYq7F,GAC5B,IAIJvhI,EAAOtU,KAAKw6C,GAAYv+B,GAC5B,IAEG3H,CACX,mCClDG,MAAMwhI,GACTzsF,qBAAuB,GAAI4pF,cAC3B5pF,mBAAqB,WACrBA,qBAAuB,kBACvBA,mBAAqB,gBAKrB,yBAAO0sF,CAAmBvlI,EAAM27D,GAC5B,IAAK37D,EAAKub,WAAWvsB,KAAKw2I,aACtB,MAAM,IAAIh4I,MAAM,uCAAuCwB,KAAKw2I,gBAChE,MAAMC,EAAaH,GAAQI,gBAAgB1lI,GACrC2lI,EAAmB,UAAcvgH,QAAQu2C,GAIzCiqE,EAAkB5lI,EAAKtJ,MAAM,QAAQ,GACrCmvI,EAAwB,GAAYD,GAG1C,IADmBxK,GADK,GAAWqK,EAAW9oE,UAAW,aAAazsE,MAAM,EAAG,IAC3BgrI,GAAU2K,GAAwB,IAAI5mI,WAAW0mI,IAEjG,MAAM,IAAIn4I,MAAM,2CACpB,OAAOi4I,EAAWK,KACtB,CACA,sBAAOJ,CAAgBK,GACnB,MAAMjxC,EAAUixC,EAAItuI,MAAM,+DAC1B,IAAK9G,MAAM2Q,QAAQwzF,GACf,MAAM,IAAItnG,MAAM,sCACpBsnG,EAAQx9F,QACR,MAAOwuI,EAAOE,EAAO3uD,EAAK1a,GAAam4B,EACvC,IAAKgxC,EACD,MAAM,IAAIt4I,MAAM,qDACpB,IAAKw4I,EACD,MAAM,IAAIx4I,MAAM,qDACpB,IAAK6pF,EACD,MAAM,IAAI7pF,MAAM,uDACpB,IAAKmvE,EACD,MAAM,IAAInvE,MAAM,uDACpB,MAAO,CAAEs4I,QAAOE,QAAO3uD,IAAK99E,OAAO89E,GAAM1a,YAC7C,CAMA,gBAAOspE,CAAUC,GACb,IAAKA,EAAK3qH,WAAWvsB,KAAKm3I,aACtB,MAAM,IAAI34I,MAAM,uCAAuCwB,KAAKm3I,gBAChE,MAAMrxC,EAAUoxC,EAAKzuI,MAAM,8BAC3B,IAAK9G,MAAM2Q,QAAQwzF,GACf,MAAM,IAAItnG,MAAM,sCACpBsnG,EAAQx9F,QACR,MAAOqkE,EAAW6Q,GAAUsoB,EAC5B,IAAKn5B,EACD,MAAM,IAAInuE,MAAM,sDACpB,IAAKg/E,EACD,MAAM,IAAIh/E,MAAM,kDACpB,MAAO,CAAEmuE,YAAW6Q,SACxB,CAKA,kBAAO45D,CAAYC,GACf,IAAKA,EAAO9qH,WAAWvsB,KAAKs3I,eACxB,MAAM,IAAI94I,MAAM,yCAAyCwB,KAAKs3I,kBAClE,OAAOD,EAAO3vI,MAAM1H,KAAKs3I,eAAe,GAAG5vI,MAAM,IACrD,ECxEJ,MAAM,GAAM,IAAI21C,GAAO,yBA6EvB,SAASk6F,GAAYC,EAAQjuI,GACzB,OAAQA,EAAOisD,OAASgiF,EAAOhiF,OAC3BjsD,EAAO6+D,OAASovE,EAAOpvE,OACvB7+D,EAAOsD,QAAU2qI,EAAO3qI,QACxBtD,EAAOk1D,WAAa+4E,EAAO/4E,SACnC,CACA,SAASo4D,GAAUhvE,EAAM8Z,GACrB,IAAK9Z,EAAKgnF,OACN,OAAO,EACX,IAAK,MAAMjiC,KAAgBjrC,EACvB,GAAI9Z,EAAKgnF,SAAWjiC,EAAaiiC,OAC7B,OAAO,EAGf,OAAO,CACX,CACA,SAAS4I,GAAgBnmI,EAAMomI,GACvBpmI,EAAKkkD,QACLkiF,EAAMliF,OAAS,GACflkD,EAAK82D,QACLsvE,EAAMtvE,OAAS,GACf92D,EAAKzE,SACL6qI,EAAM7qI,QAAU,GAChByE,EAAKmtD,YACLi5E,EAAMj5E,WAAa,EAC3B,CAOA,SAASk5E,GAAyBrmI,EAAMkmI,EAAQjuI,GAC5C,GAAIguI,GAAYC,EAAQjuI,GACpB,KAAM,kEAEV,MAAM4wB,EAUV,SAA6Bq9G,EAAQjuI,GACjC,MAAO,CACHisD,MAAOjsD,EAAOisD,MAAQgiF,EAAOhiF,MAC7B4S,MAAO7+D,EAAO6+D,MAAQovE,EAAOpvE,MAC7Bv7D,OAAQtD,EAAOsD,OAAS2qI,EAAO3qI,OAC/B4xD,UAAWl1D,EAAOk1D,UAAY+4E,EAAO/4E,UAE7C,CAjBoBm5E,CAAoBJ,EAAQjuI,GAC5C,OAAS4wB,EAAQq7B,OAASlkD,EAAKkkD,OAC1Br7B,EAAQiuC,OAAS92D,EAAK82D,OACtBjuC,EAAQttB,QAAUyE,EAAKzE,QACvBstB,EAAQskC,WAAantD,EAAKmtD,SACnC,CClHA,MAAM,GAAM,IAAIphB,GAAO,iBAChB,MAAMw6F,GACT5gC,IACA6gC,cACAC,gBAAkB,GAClB,wBAAaC,CAAYC,GAIrB,OAHKA,IACDA,QAAkB9B,GAAav3I,UAE5B,IAAIi5I,GAAiBI,EAChC,CAQA,cAAMj/E,CAASk/E,EAAaC,GACxB,MAAMC,EAAenvI,KAAK6a,MAAM7a,KAAKm0B,SAAW86G,EAAYz2I,SACtD,UAAEkrE,EAAS,OAAE6Q,GAAW84D,GAAQW,UAAUiB,EAAYE,IACtDt4I,EAAU,CACZ09E,SACA7Q,YACA0rE,OAAQ,CAAC,GAEP12E,QDxBPx0B,eAAoDgrG,EAA2BG,EAAgBC,GAClG,MAAMf,EAAS,CACXhiF,MAAO2iF,EAA0B3iF,OAAS,EAC1C4S,MAAO+vE,EAA0B/vE,OAAS,EAC1Cv7D,OAAQsrI,EAA0BtrI,QAAU,EAC5C4xD,UAAW05E,EAA0B15E,WAAa,GAEhD+5E,EAAchB,EAAOhiF,MAAQgiF,EAAOpvE,MAAQovE,EAAO3qI,OAAS2qI,EAAO/4E,UACnEl1D,EAAS,CACXisD,MAAO,EACP4S,MAAO,EACPv7D,OAAQ,EACR4xD,UAAW,GAEf,IAAIg6E,EAAgB,EACpB,MAAM92E,EAAQ,GACd,MAAQ41E,GAAYC,EAAQjuI,IACxBkvI,EAAgBD,EAAcF,GAAgB,CAC9C,MAAMzwF,QAAa0wF,IACf1wF,GAAQgvE,GAAUhvE,EAAM8Z,KAEpB9Z,EAAKkmF,OACD4J,GAAyB9vF,EAAKkmF,MAAOyJ,EAAQjuI,KAC7CkuI,GAAgB5vF,EAAKkmF,MAAOxkI,GAC5Bo4D,EAAMnhE,KAAKqnD,IAGnB,GAAIrT,KAAK,2CAA2CqT,EAAKgnF,UAAUhnF,EAAK10B,OAE5EslH,GACJ,CACA,OAAO92E,CACX,CCR4B+2E,CAAqCP,EAA2Bn4I,KAAK+3I,iBAAiB,IAAM/3I,KAAK24I,QAAQn7D,EAAQ19E,KAOrI,OANA,GAAI00C,KAAK,oBAAqBmtB,EAAMr9D,KAAKujD,IAC9B,CACHn3C,GAAIm3C,EAAKX,QAAQ7gD,WACjB+/F,WAAYv+C,EAAKu+C,YAAY9hG,KAAK61D,GAAOA,EAAG9zD,kBAG7Cs7D,CACX,CACA,WAAAryD,CAAY2nG,GACRj3G,KAAK83I,cAAgB,CAAC,EACtB93I,KAAKi3G,IAAMA,CACf,CAIA,iBAAO2hC,CAAYV,EAAaC,GAC5B,MAAMC,EAAenvI,KAAK6a,MAAM7a,KAAKm0B,SAAW86G,EAAYz2I,SACtD,UAAEkrE,EAAS,OAAE6Q,GAAW84D,GAAQW,UAAUiB,EAAYE,IACtDt4I,EAAU,CACZ09E,SACA7Q,YACA0rE,OAAQ,CAAC,GAEb,UAAW,MAAMxwF,KDVlB1a,gBAAqDgrG,EAA2BG,EAAgBC,GACnG,MAAMf,EAAS,CACXhiF,MAAO2iF,EAA0B3iF,OAAS,EAC1C4S,MAAO+vE,EAA0B/vE,OAAS,EAC1Cv7D,OAAQsrI,EAA0BtrI,QAAU,EAC5C4xD,UAAW05E,EAA0B15E,WAAa,GAEhD+5E,EAAchB,EAAOhiF,MAAQgiF,EAAOpvE,MAAQovE,EAAO3qI,OAAS2qI,EAAO/4E,UACnEl1D,EAAS,CACXisD,MAAO,EACP4S,MAAO,EACPv7D,OAAQ,EACR4xD,UAAW,GAEf,IAAIg6E,EAAgB,EACpB,MAAMI,EAAc,IAAIv9F,IACxB,MAAQi8F,GAAYC,EAAQjuI,IACxBkvI,EAAgBD,EAAcF,GAAgB,CAC9C,MAAMzwF,QAAa0wF,IACf1wF,GAAQA,EAAKgnF,SAAWgK,EAAY55I,IAAI4oD,EAAKgnF,UAC7CgK,EAAY77H,IAAI6qC,EAAKgnF,QAEjBhnF,EAAKkmF,OACD4J,GAAyB9vF,EAAKkmF,MAAOyJ,EAAQjuI,KAC7CkuI,GAAgB5vF,EAAKkmF,MAAOxkI,SACtBs+C,GAGd,GAAIrT,KAAK,2CAA2CqT,EAAKgnF,UAAUhnF,EAAK10B,OAE5EslH,GACJ,CACJ,CCtBiCK,CAAqCX,EAA2Bn4I,KAAK+3I,iBAAiB,IAAM/3I,KAAK24I,QAAQn7D,EAAQ19E,WAChI+nD,CAEd,CAKA,aAAM8wF,CAAQI,EAAWj5I,GACrB,IACI,MAAM2+C,QAAcz+C,KAAKg5I,cAAcD,EAAWj5I,GAElD,IAAIuI,EACA4wI,EAFJn5I,EAAQu4I,OAAOU,IAAa,EAG5B,MAAMG,EAoDlB,SAAsBz6F,GAClB,OAAIA,EAAMlyB,WAAW+pH,GAAQE,aAClBF,GAAQE,YACf/3F,EAAMlyB,WAAW+pH,GAAQgB,eAClBhB,GAAQgB,cACf74F,EAAMlyB,WAAW+pH,GAAQ7C,eAClB6C,GAAQ7C,cACZ,EACX,CA5D8B0F,CAAa16F,GAC/B,IACI,OAAQy6F,GACJ,KAAK5C,GAAQE,YAET,OADAnuI,EAAOiuI,GAAQC,mBAAmB93F,EAAO3+C,EAAQ6sE,iBACpC3sE,KAAK24I,QAAQtwI,EAAMvI,GACpC,KAAKw2I,GAAQgB,cAGT,OAFA2B,EAAW3C,GAAQc,YAAY34F,GAC/Bp2C,EA8DxB,SAA0B4wI,EAAUn5I,GAGhC,MAAMs5I,EAAe,CAAC,EACtB,IAAK,MAAO3nH,EAAKsnH,KAAcE,EAAS9oF,UAChCrwD,EAAQu4I,OAAOU,KACfK,EAAa3nH,IAAO,GAI5B,GAAI9yB,OAAOuG,KAAKk0I,GAAc33I,SAAWw3I,EAASx3I,OAC9C,MAAM,IAAIjD,MAAM,uCAGpB,IAAIqM,EACJ,GACIA,EAAQ5B,KAAK6a,MAAM7a,KAAKm0B,SAAW67G,EAASx3I,cACvC23I,EAAavuI,IACtB,OAAOouI,EAASpuI,EACpB,CAjF+BwuI,CAAiBJ,EAAUn5I,SACrBE,KAAK24I,QAAQtwI,EAAMvI,GACpC,KAAKw2I,GAAQ7C,cACT,OAAOF,GAAW90H,WAAWggC,GACjC,QACI,OAAO,KAEnB,CACA,MAAOj3B,GAEH,OADA,GAAIA,MAAM,6BAA6B0xH,kBAA0BH,MAAcvxH,KACxE,IACX,CACJ,CACA,MAAOA,GAEH,OADA,GAAIA,MAAM,8CAA8CuxH,MAAcvxH,KAC/D,IACX,CACJ,CAOA,mBAAMwxH,CAAcD,EAAWj5I,GAC3B,GAAIE,KAAK83I,cAAciB,GACnB,OAAO/4I,KAAK83I,cAAciB,GAG9B,MAAMzgC,EAAWygC,IAAcj5I,EAAQ09E,OACjC,GAAGu7D,KAAaj5I,EAAQ09E,SACxB19E,EAAQ09E,OACRntD,QAAiBrwB,KAAKi3G,IAAIm/B,WAAW99B,GAC3C,IAAKjoF,EAAS5uB,OACV,MAAM,IAAIjD,MAAM,yDACpB,IAAK6xB,EAAS,GAAG5uB,OACb,MAAM,IAAIjD,MAAM,6BAGpB,MAAMsW,EAASub,EAASxoB,KAAK,IAE7B,OADA7H,KAAK83I,cAAciB,GAAajkI,EACzBA,CACX,ECjHJ,MAAM,GAAM,IAAIuoC,GAAO,sBAIhB,MAAMi8F,WAAyB7sF,GAClC8sF,SACAntB,SACAotB,YACA/zH,SACA,WAAAnW,CAAYi5C,EAAYtuC,GACpBm2B,QACApwC,KAAKosH,UAAW,EAChBpsH,KAAKw5I,YAAcjxF,EACnBvoD,KAAKylB,SAAWxL,EAChB,MAAM,QAAEw/H,GAAYx/H,EACpB,GAAIu6B,KAAK,yCAA0CilG,EACvD,CAIA,WAAMzyI,GACF,GAAIwtC,KAAK,mCACTx0C,KAAKosH,UAAW,QACVpsH,KAAKq6D,WACf,CACA,eAAMA,GACF,IAAKr6D,KAAKu5I,SAAU,CAChB,IAAI,QAAEE,GAAYz5I,KAAKylB,SAClB9jB,MAAM2Q,QAAQmnI,KACfA,EAAU,CAACA,IACf,MAAM,0BAAEtB,GAA8Bn4I,KAAKylB,SACrCwxF,QAAY4gC,GAAiBG,cACnCh4I,KAAKu5I,SAAWtiC,EAAI2hC,YAAYx8G,KAAK66E,EAAKwiC,EAAStB,EACvD,CACA,UAAW,MAAMuB,KAAW15I,KAAKu5I,WAAY,CACzC,IAAKv5I,KAAKosH,SACN,OAEJ,MAAM,SAAElzD,EAAQ,UAAE7d,GAAcq+F,EAChC,IAAKxgF,EACD,SAEJ,MAAMygF,EAAe,CACjB,CAAC,IAA6B,CAC1B36I,MAAOgB,KAAKylB,SAAS6gF,U1BzCE,G0B0CvBC,IAAKvmG,KAAKylB,SAAS+gF,Q1BzCE,M0B4C7B,IAAIozC,GAAgB,QACO55I,KAAKw5I,YAAYtjF,UAAUj3D,IAAIi6D,EAASxoD,WAE5C1Q,KAAKw5I,YAAYtjF,UAAU92D,IAAI85D,EAASxoD,KAC9BwnD,KAAKj5D,IAAI,MAElC26I,GAAgB,QACV55I,KAAKw5I,YAAYtjF,UAAU7yC,MAAM61C,EAASxoD,GAAI,CAChDwnD,KAAMyhF,MAKdC,GAAgB,QACV55I,KAAKw5I,YAAYtjF,UAAUtpD,KAAKssD,EAASxoD,GAAI,CAC/CwnD,KAAMyhF,KACFt+F,GAAa,CACbgN,SAAU,CACNhN,UAAW4B,GAAiB5B,QAKxCu+F,GACA55I,KAAK2sD,cAAc,IAAIE,YAAY,OAAQ,CAAE/E,OAAQoR,IAE7D,CACJ,CAIA,IAAA5yC,GACItmB,KAAKosH,UAAW,CACpB,CACA,IAAK,MACD,OAAO,CACX,CACA,IAAK3oF,OAAOqB,eACR,OAAO8V,EACX,EC7FG,SAAS,GAAqB2L,GACjC,OAAOA,EACF15C,QAAQ1F,GAAmB,SAAbA,EAAEipB,SAChBhiB,MAAK,CAACi7B,EAAMj0B,IAAUA,EAAMoxC,SAASh2B,KAAO6Y,EAAKmd,SAASh2B,OAC1Di2B,GAAG,EACZ,CCHA,MAAM,GAAkB,WACjB,MAAM,GACTG,WACAC,eACAtC,iBACAn5C,IACA07C,gBAAkB,IAAIxL,IACtByL,WAAa,IAAIlZ,IACjB,WAAAv+B,CAAYs3C,EAAYC,EAAgBtC,GACpCvkD,KAAK4mD,WAAaA,EAClB5mD,KAAK6mD,eAAiBA,EACtB7mD,KAAKukD,iBAAmBA,EACxBvkD,KAAKoL,IAAM,IAAIiyC,GAAO,kBAAkBuJ,KACxC5mD,KAAKukD,iBAAiB,cAAevkD,KAAKgnD,2BAC9C,CACA,eAAMC,CAAUC,GACZ,MAAMC,EAAYD,EAAO7gD,WACnB+gD,EAAkBpnD,KAAK+mD,WAAW3nD,IAAI+nD,GACxCC,IACApnD,KAAK+mD,WAAWM,OAAOF,SACjBC,GAEV,IAAIhB,EAASpmD,KAAKsnD,sBAAsBJ,GACxC,OAAId,GACApmD,KAAKoL,IAAIopC,KAAK,gCAAgC2S,gBAAwBnnD,KAAK4mD,cAC3E5mD,KAAKunD,WAAWJ,EAAWf,GACpBA,IAEXA,QAAepmD,KAAKwnD,aAAaN,GACjClnD,KAAKunD,WAAWJ,EAAWf,GACpBA,EACX,CACA,kBAAMoB,CAAaN,EAAQrqB,EAAU,GACjC,MACM4qB,EAAa,GADCznD,KAAK6mD,eAAeK,IAExC,IAAKO,EACD,MAAM,IAAIjpD,MAAM,iDAAiD0oD,EAAO7gD,yBAAyBrG,KAAK4mD,cAE1G,IAAIc,EACAtB,EACJ,IAAK,IAAI7kD,EAAI,EAAGA,EAAIs7B,EAAU,EAAGt7B,IAC7B,IACIvB,KAAKoL,IAAIopC,KAAK,4CAA4C0S,EAAO7gD,yBAAyBrG,KAAK4mD,cAC/FR,QAAeqB,EAAWE,UAAU3nD,KAAK4mD,YACzC5mD,KAAKoL,IAAIopC,KAAK,6BAA6B0S,EAAO7gD,yBAAyBrG,KAAK4mD,cAChF,KACJ,CACA,MAAOp/B,GACHkgC,EAAYlgC,CAChB,CAEJ,IAAK4+B,EACD,MAAM,IAAI5nD,MAAM,qCAAqC0oD,EAAO7gD,iBAAmBqhD,GAEnF,OAAOtB,CACX,CACA,0BAAMwB,CAAqBC,GACvB,MAAMX,EAASW,EAAKn3C,GAAGrK,WACvB,GAAIrG,KAAK8mD,gBAAgB7nD,IAAIioD,GACzBlnD,KAAKoL,IAAIopC,KAAK,wDAAwD0S,gBAAqBlnD,KAAK4mD,mBAGpG,IACI5mD,KAAK8mD,gBAAgB9pC,IAAIkqC,SACnBlnD,KAAKwnD,aAAaK,EAAKn3C,GACjC,CACA,MAAO8W,GACHxnB,KAAKoL,IAAIoc,MAAM,kCAAmCA,EACtD,CACA,QACIxnB,KAAK8mD,gBAAgBO,OAAOH,EAChC,CAEJ,CACAF,2BAA8B1mD,IAC1B,MAAM,KAAEunD,GAASvnD,EAAIwnD,OAChBD,EAAKE,UAAU/8B,SAAShrB,KAAK4mD,cAGnB5mD,KAAKsnD,sBAAsBO,EAAKn3C,KAI/C1Q,KAAKgoD,kBAAkBH,GAAK,EAEhC,iBAAAG,CAAkBH,GACd7nD,KAAKoL,IAAIopC,KAAK,8CAA8CqT,EAAKn3C,GAAGrK,yBAAyBrG,KAAK4mD,cAE9F5mD,KAAK+mD,WAAW9nD,IAAI4oD,EAAKn3C,GAAGrK,aAC5BrG,KAAK+mD,WAAWM,OAAOQ,EAAKn3C,GAAGrK,YAEnCrG,KAAK+mD,WAAWznD,IAAIuoD,EAAKn3C,GAAGrK,WAAYrG,KAAK4nD,qBAAqBC,GACtE,CACA,qBAAAP,CAAsBJ,GAClB,MACMO,EAAa,GADCznD,KAAK6mD,eAAeK,IAExC,IAAKO,EACD,OAEJ,MAAMrB,EAASqB,EAAWQ,QAAQ3uB,MAAMv2B,GAAMA,EAAEmlD,WAAaloD,KAAK4mD,aAClE,OAAKR,EAGoB,CAAC,OAAQ,SAAU,WAAWp7B,SAASo7B,EAAO+B,aAAe,KAC9DnoD,KAAKooD,eAAehC,QAA5C,EAGOA,OAPP,CAQJ,CACA,UAAAmB,CAAWL,EAAQd,GACfpmD,KAAKoL,IAAIopC,KAAK,6BAA6B0S,eAAoBd,EAAO11C,MACtE01C,EAAOiC,SAAS,KAAmB,CACvC,CACA,cAAAD,CAAehC,GACX,QAASA,EAAOiC,SAAS,GAC7B,EChHG,MAAM,GACTzB,WACA2B,WACA7M,aACA8M,uBACAC,0BACAC,cACA,WAAAp5C,CAAYs3C,EAAY2B,EAAY7M,GAChC17C,KAAK4mD,WAAaA,EAClB5mD,KAAKuoD,WAAaA,EAClBvoD,KAAK07C,aAAeA,EACpB17C,KAAKwoD,uBAAyBD,EAAWznD,OAAOyjD,iBAAiBnoB,KAAKmsB,EAAWznD,QACjFd,KAAKyoD,0BAA4BF,EAAWznD,OAAO2jD,oBAAoBroB,KAAKmsB,EAAWznD,QACvFd,KAAK0oD,cAAgB,IAAI,GAAc9B,EAAY2B,EAAWI,kBAAkB9B,eAAezqB,KAAKmsB,EAAWI,mBAAoB3oD,KAAKwoD,uBAC5I,CACA,eAAMvB,CAAUC,GACZ,OAAOlnD,KAAK0oD,cAAczB,UAAUC,EACxC,EClBG,MAAM1R,GACTsI,MACA,WAAAxuC,CAAYwuC,GACR99C,KAAK89C,MAAQA,CACjB,CACA,oBAAOkN,CAAc3uB,GACjB,MAAM,SAAEgZ,GAAahZ,EACrB,OAAO,IAAImZ,GAAgB,CACvBC,MAAO,CACHJ,SAAUA,GAEdhlB,cAAUnxB,GAElB,CAKA,MAAAgW,GACI,OAAO,GAAsBA,OAAOlV,KAAK89C,MAC7C,CAKA,aAAO9hC,CAAOlN,GACV,MAAM82B,EAAM,GAAsB5pB,OAAOlN,GACzC,OAAO,IAAI0mC,GAAgB5P,EAC/B,CACA,SAAI6P,GACA,OAAOz1C,KAAK89C,MAAMrI,KACtB,CACA,YAAIplB,GACA,OAAOrwB,KAAK89C,MAAMztB,QACtB,EC5BG,MAAMwpH,GAAoB,uCAC3B,GAAM,IAAIx8F,GAAO,iBAIhB,MAAMy8F,WAAyB,GAIlC,WAAAxqI,CAAYi5C,EAAY7M,GACpBtL,MAAMypG,GAAmBtxF,EAAY7M,EACzC,CAIA,WAAMjG,CAAMpZ,GACR,MAAM,SAAEgZ,EAAQ,OAAE6R,GAAW7qB,EACvB09G,EAAWvkG,GAAgBwV,cAAc,CAC3C3V,SAAUpP,OAAOoP,KAGrB,UADmBr1C,KAAKuoD,WAAW2N,UAAU92D,IAAI8nD,GAE7C,MAAO,CACH5R,UAAW,KACX9tB,MAAO7C,GAAci3C,mBAG7B,IAAIxV,EACJ,IACIA,QAAepmD,KAAKinD,UAAUC,EAClC,CACA,MAAOzgC,GAEH,OADA,GAAIe,MAAM,uBAAwBf,GAC3B,CACH6uB,UAAW,KACX9tB,MAAO7C,GAAc8lC,oBAE7B,CACA,MAAM7kB,QAAY+f,GAAK,CAACo0F,EAAS7kI,UAAW,GAAWkxC,EAAQ,IAAWjZ,MAAOhnC,SAAiB,GAAIA,KACtG,IACI,MAAM2I,EAAQ,IAAIkwC,GAClBpZ,EAAIz4B,SAASkQ,IACTvO,EAAMqwC,OAAO9hC,EAAM,IAEvB,MAAM,SAAEgT,GAAamlB,GAAgBx5B,OAAOlN,GAC5C,OAAKuhB,EAaE,CACHilB,gBAPoB/Y,QAAQgpB,IAAIl1B,EAASilB,UACxChxC,KAAK40D,GAAaA,EAAS9jB,MAC3BvoC,OAAOmlC,IACP1tC,KAAI6oC,MAAOiI,IACL,CAAE4kG,UAAWzG,GAAWG,QAAQt+F,QAIvC5tB,MAAO,OAdP,GAAIA,MAAM,+DACH,CACH8tB,UAAW,KACX9tB,MAAO7C,GAAcymC,eAajC,CACA,MAAO3kC,GAEH,OADA,GAAIe,MAAM,8BAA+Bf,GAClC,CACH6uB,UAAW,KACX9tB,MAAO7C,GAAcgnC,cAE7B,CACJ,EC3EJ,MAAM,GAAM,IAAItO,GAAO,2BAEjB48F,GAA0C,IAC1CC,GAAsB,EACfC,GAAiC1/F,GAAK4d,cAG5C,MAAM+hF,WAA8B3tF,GACvClE,WACA8xF,aACApgI,QACA2iD,UACA09E,cAAgB,IAAIh/F,IACpBi/F,cAAgB,IAAI1sG,IACpB2sG,qBAAwBr6I,IACpB,MAAM,UAAE4nD,EAAS,OAAEb,GAAW/mD,EAAM2nD,OAC/BC,EAAU/8B,SAAS6uH,MACpB75I,KAAKs6I,cAAcr7I,IAAIioD,EAAO7gD,cAElCrG,KAAKs6I,cAAct9H,IAAIkqC,EAAO7gD,YAC9BrG,KAAKy6I,sBAAsBvzF,GAAQ5jB,OAAO9b,GAAU,GAAIA,MAAM,uBAAuBA,OAAS,EAElG,WAAAlY,CAAYi5C,EAAY7M,EAAczhC,EAAU,CAAC,GAC7Cm2B,QACApwC,KAAKuoD,WAAaA,EAClBvoD,KAAKq6I,aAAe,IAAIP,GAAiBvxF,EAAY7M,GACrD17C,KAAKia,QAAUA,EACfja,KAAK48D,WAAY,CACrB,CAIA,KAAA51D,GACQhH,KAAK48D,YAGT58D,KAAK2sD,cAAc,IAAIE,YAAY,6BAA8B,CAAE/E,QAAQ,KAC3E,GAAItT,KAAK,4DAETx0C,KAAKuoD,WAAWznD,OAAOyjD,iBAAiB,gBAAiBvkD,KAAKw6I,sBAClE,CAIA,IAAAl0H,GACStmB,KAAK48D,YAEV,GAAIpoB,KAAK,yCACTx0C,KAAK48D,WAAY,EACjB58D,KAAKs6I,cAAc/6I,QACnBS,KAAKuoD,WAAWznD,OAAO2jD,oBAAoB,gBAAiBzkD,KAAKw6I,sBACrE,CACA,IAAK,MACD,OAAO,CACX,CACA,IAAK/2G,OAAOqB,eACR,MAAO,qBACX,CACA21G,sBAAwBttG,MAAO+Z,IAC3B,MAAMC,EAAYD,EAAO7gD,YACnB,cAAEq0I,EAAgBT,GAAuC,WAAEU,EAAaT,IAAwBl6I,KAAKia,QAC3G,GAAIu6B,KAAK,kBAAkB2S,cAAsBnnD,KAAKu6I,cAAcn7I,IAAI+nD,IAAc,YAChFnnD,KAAKy1C,MAAMyR,GACjB,MAAM0zF,EAAiB56I,KAAKu6I,cAAcn7I,IAAI+nD,IAAc,EACxDyzF,EAAiBD,EACjB36I,KAAK66I,oBAAoB1zF,GAG7BtgC,YAAW,KACP7mB,KAAKu6I,cAAcj7I,IAAI6nD,EAAWyzF,EAAiB,GACnD56I,KAAKy6I,sBAAsBvzF,GAAQ5jB,OAAO9b,IACtC,GAAIA,MAAM,mCAAmCA,IAAQ,GACvD,GACHkzH,EAAgBE,EAAe,EAEtC,WAAMnlG,CAAMyR,GACR,MAAM,MAAE1/B,EAAK,UAAE8tB,SAAoBt1C,KAAKq6I,aAAa5kG,MAAM,CACvDJ,SA5EgC,GA6EhC6R,WAEJ,GAAI1/B,EAEA,OADA,GAAIA,MAAM,6BAA8BA,GACjC,CAAEA,QAAO8tB,UAAW,MAE/B,IAAK,MAAMwlG,KAAaxlG,EAAW,CAC/B,MAAM,IAAE0kG,GAAQc,EAChB,IAAKd,EAAK,CACN,GAAI9sI,KAAK,uCACT,QACJ,CACA,MAAM,OAAEg6C,EAAM,SAAEgS,EAAQ,UAAE7d,GAAc2+F,EACxC,GAAK9yF,GAAWgS,EAAhB,CAIA,SADsBl5D,KAAKuoD,WAAW2N,UAAUj3D,IAAIioD,GACvC,CACT,MAAM,iBAAE6zF,EAAgB,aAAEC,SAAuBh7I,KAAKi7I,kBAAkB/hF,EAAU7d,GAClF,GAAI0/F,GAAoBC,EAAc,CAClC,GAAIxmG,KAAK,QAAQ0S,EAAO7gD,4DACpB00I,IACA,GAAIvmG,KAAK,QAAQ0S,EAAO7gD,qDAClBrG,KAAKuoD,WAAW2N,UAAU62C,MAAM7lD,EAAQ,CAC1Ck/C,WAAYltC,EAASktC,cAGzB40C,GAAgB3/F,IAChB,GAAI7G,KAAK,QAAQ0S,EAAO7gD,oDAClBrG,KAAKuoD,WAAW2N,UAAU7yC,MAAM6jC,EAAQ,CAC1CmB,SAAU,CACNhN,UAAW4B,GAAiB5B,MAGpCr7C,KAAK2sD,cAAc,IAAIE,YAAY,OAAQ,CACvC/E,OAAQ,CACJp3C,GAAIw2C,EACJk/C,WAAYltC,EAASktC,gBAIjC,QACJ,CACJ,OAEMpmG,KAAKuoD,WAAW2N,UAAUtpD,KAAKs6C,EAAQ,CACzCgR,KAAM,CACF,CAACiiF,IAAiC,CAC9Bn7I,MAAOgB,KAAKia,QAAQqsF,UAzHJ,GA0HhBC,IAAKvmG,KAAKia,QAAQusF,QAzHJ,SA4HlBnrD,GAAa,CACbgN,SAAU,CACNhN,UAAW4B,GAAiB5B,QAGhC6d,EAASktC,YAAc,CACvBA,WAAYltC,EAASktC,cAG7B,GAAI5xD,KAAK,oBAAoB0S,EAAO7gD,cACpCrG,KAAK2sD,cAAc,IAAIE,YAAY,OAAQ,CACvC/E,OAAQ,CACJp3C,GAAIw2C,EACJk/C,WAAYltC,EAASktC,cAlD7B,CAqDJ,CACA,MAAO,CAAE5+E,MAAO,KAAM8tB,YAC1B,CACA,mBAAAulG,CAAoB1zF,GAChB,GAAI3S,KAAK,8BAA8B2S,KACvCnnD,KAAKs6I,cAAcjzF,OAAOF,GAC1BnnD,KAAKu6I,cAAclzF,OAAOF,EAC9B,CACA,uBAAM8zF,CAAkB/hF,EAAU7d,GAC9B,MAAQ3qC,GAAIw2C,GAAWgS,EACjBrR,QAAa7nD,KAAKuoD,WAAW2N,UAAU92D,IAAI8nD,GAC3Cg0F,EAAqBrzF,EAAKk/C,UAAUziG,KAAKqc,GAAMA,EAAEmmF,UAAUzgG,aAC3D80I,EAAgBjiF,EAASktC,WAAW9hG,KAAK61D,GAAOA,EAAG9zD,aACnD00I,EAAmBG,EAAmBlgF,MAAMb,IAAQghF,EAAcnwH,SAASmvC,KACjF,IAAI6gF,GAAe,EACnB,MAAMI,EAAyBvzF,EAAKQ,SAASjpD,IAAI,aACjD,GAAIg8I,EAAwB,CACxB,MAAMC,EAAoB1+F,GAAiBy+F,IACvCC,GAAqBhgG,KACrB2/F,EACIK,EAAkB3lG,YAAc2F,GAAW3F,WACvC2lG,EAAkB1lG,OAAOqlB,MAAMrf,IAAWN,GAAW1F,OAAO3qB,SAAS2wB,KAErF,CACA,MAAO,CAAEo/F,mBAAkBC,eAC/B,EC3KJ,MAAM,GAAM,IAAI39F,GAAO,2BACVi+F,GAAyB7gG,GAAK6d,MAGpC,MAAMijF,WAAgC9uF,GACzClE,WACAtuC,QACA2iD,UACA+E,MAAQ,GACR,WAAAryD,CAAYi5C,EAAYtuC,GACpBm2B,QACApwC,KAAKuoD,WAAaA,EAClBvoD,KAAKia,QAAUA,EACfja,KAAK48D,WAAY,EACjB58D,KAAK2hE,MAAQ3hE,KAAKw7I,0BACtB,CACA,IAAK/3G,OAAOqB,eACR,MAAO,kCACX,CACA,WAAM99B,GACF,IAAIhH,KAAK48D,UAAT,CAEA,GAAIpoB,KAAK,oCACTx0C,KAAKuoD,WAAWznD,OAAOyjD,iBAAiB,gBAAiBvkD,KAAKy7I,gBAC9D,IAAK,MAAQ/qI,GAAIwyH,EAAK,QAAEvzE,KAAa3vD,KAAK2hE,MAAO,CAC7C,MAAMza,EAAS0rC,GAAiBswC,SACtBljI,KAAKuoD,WAAW2N,UAAUj3D,IAAIioD,WAElClnD,KAAKuoD,WAAW2N,UAAUtpD,KAAKs6C,EAAQ,CACzCk/C,WAAY,CAAC,GAAUz2C,IACvBuI,KAAM,CACF,CAACl4D,KAAKia,SAASghD,SAAWqgF,IAAyB,CAC/Ct8I,MAAOgB,KAAKia,SAASqsF,UA9Bb,GA+BRC,IAAKvmG,KAAKia,SAASusF,QA9Bb,QAkClBxmG,KAAK2sD,cAAc,IAAIE,YAAY,OAAQ,CACvC/E,OAAQ,CACJp3C,GAAIw2C,EACJk/C,WAAY,CAAC,GAAUz2C,QAGnC,CACA,GAAInb,KAAK,cAAcx0C,KAAK2hE,MAAMlgE,gBAClCzB,KAAK48D,WAAY,CAxBP,CAyBd,CACA,IAAAt2C,GACStmB,KAAK48D,YAEV,GAAIpoB,KAAK,oCACTx0C,KAAKuoD,WAAWznD,OAAO2jD,oBAAoB,gBAAiBzkD,KAAKy7I,gBACjEz7I,KAAK48D,WAAY,EACjB58D,KAAK07I,0BACT,CACAD,eAAkBt7I,IACd,MAAM,OAAE+mD,EAAM,YAAE+jD,GAAgB9qG,EAAM2nD,OAChC6zF,EC9CP,SAAsC50C,GACzC,MAAM60C,EAAc70C,EAAUztE,MAAM61B,GAASA,EAAK9oD,WAAW2kB,SAAS,OAASmkC,EAAK9oD,WAAW2kB,SAAS,SACxG,IAAK4wH,EACD,MAAM,IAAIp9I,MAAM,gDAEpB,OAAOo9I,CACX,CDwCmCC,CAA6B5wC,GAClD6wC,EAAoB97I,KAAKw7I,2BACzBO,EAAoBD,EAAkB9/B,WAAWggC,GAAUA,EAAMtrI,KAAOw2C,EAAO7gD,aACjF01I,GAAqB,EACrBD,EAAkBC,GAAmBpsF,QACjCgsF,EAAmBt1I,WAGvBy1I,EAAkBt7I,KAAK,CACnBkQ,GAAIw2C,EAAO7gD,WACXspD,QAASgsF,EAAmBt1I,aAGpCrG,KAAK2hE,MAAQm6E,EACb97I,KAAK07I,yBAAyB,EAElC,wBAAAF,GACI,IACI,MAAMS,EAAkB5gH,aAAaZ,QAAQ,cAC7C,OAAKwhH,EAES52H,KAAKC,MAAM22H,GACZpvI,OAAOqvI,IAFT,EAGf,CACA,MAAO10H,GAEH,OADA,GAAIA,MAAM,0CAA2CA,GAC9C,EACX,CACJ,CACA,uBAAAk0H,GACI,IACIrgH,aAAaf,QAAQ,aAAcjV,KAAKE,UAAUvlB,KAAK2hE,OAC3D,CACA,MAAOn6C,GACH,GAAIA,MAAM,uCAAwCA,EACtD,CACJ,EAEJ,SAAS00H,GAAkBr0F,GACvB,OAAQA,GACY,iBAATA,GACY,iBAAZA,EAAKn3C,IACY,iBAAjBm3C,EAAK8H,OACpB,CExGO,SAASwsF,GAAmBzgG,EAAcrxC,GAC7C,MAAM+xI,EAAc,CnCGX,gGmCFHC,EAAc,GAUpB,OATIhyI,GAAS4sG,KACTolC,EAAY77I,KT0Fb,SAA0Bi5I,EAAStB,EAA4B9R,IAClE,OAAQ99E,GAAe,IAAI+wF,GAAiB/wF,EAAY,CAAEkxF,UAAStB,6BACvE,CS5FyBmE,CAAiBF,IAElC/xI,GAASkyI,gBACTF,EAAY77I,MFmGT,CAAC+nD,EAAYtuC,IAAY,IAAIshI,GAAwBhzF,EAAYtuC,KEjGpE5P,GAASgwI,cACTgC,EAAY77I,KHuKb,SAAmCk7C,GACtC,OAAQ6M,GAAe,IAAI6xF,GAAsB7xF,EAAY7M,EACjE,CGzKyB8gG,CAA0B9gG,IAExC2gG,CACX,CCDA,MAAM,GAAM,IAAIh/F,GAAO,cAGhBlQ,eAAesvG,GAAc/gG,EAAczhC,EAAS4gB,GAClD5gB,GAASyiI,mBAAsBtW,OAEhCn5H,QAAQunC,KAAK,yCAA0C,sDACvDvnC,QAAQunC,KAAK,uEAAwE,uDAGzF,MAAM8zB,EAAkB5sB,EAClB,CAAE2M,SAAU6T,GAAaxgB,IACzB,CAAC,EAIP,OCgBGvO,eAA4BlzB,EAAU,CAAC,GAC1CA,EAAQyzD,mBAAqBojB,GAAgB,WAC7C,MAAMx/E,EAAO,IAAI2zH,GAAY,UAChBrkB,GAAe3mG,GACxBitC,QnPkB6BwmB,EmPlBAzzD,EAAQyzD,WnPmBlCqlB,GAAoBrlB,EAAWf,cADnC,IAA8Be,EmPbjC,OAHsB,IAAlBzzD,EAAQjT,aACFsK,EAAKtK,QAERsK,CACX,CD1BWqrI,CAAa,CAChBvd,WAAY,CAACvkB,GAAW,CAAEhuG,QAJe,IAA9BoN,GAAS2iI,kBAA8BxW,KAChD,GACA1uB,MAGF4qB,aAAc,CAAC1sB,MACfysB,qBAAsB,CAACr+B,SACpB/pF,EACHg8C,SAAU,CACNk2C,SAAUA,GAAS,CACfnB,aAAcnwE,GAtBL,YAwBbgwB,KAAMA,GAAK,CACPV,kBAAmBlwC,GAAS4iI,uBAxBP,QA0BtBv0E,KACAruD,GAASg8C,WAGxB,CACA,MAAM6mF,GAA8B,CAChC7lC,KAAK,EACLojC,cAAc,EACdkC,gBAAgB,GE1CbpvG,eAAe4vG,GAAgB9iI,EAAU,CAAC,GAC7C,MAAM,OAAE8vC,EAAM,aAAErO,SF2CbvO,eAA4ClzB,GAC/C,MAAM,cAAE4tD,GAAkB5tD,EACpByhC,E5VhDH,SAA6CmsB,GAChD,G+VLQ,cADqBtvC,E/VMRsvC,I+VLY,WAAYtvC,KAAY,kBAAmBA,G/VKvC,CACjC,GAAoC,IAAhCsvC,EAAclyB,OAAOl0C,OACrB,MAAM,IAAIjD,MAAM,mEAEpB,OAAO48C,GAAwBysB,EACnC,CACK,G+VTF,SAAwBtvC,GAC3B,MAAO,kBAAmBA,CAC9B,C/VOaykH,CAAen1E,GAAgB,CACpC,GAA2C,IAAvCA,EAAc5zB,cAAcxyC,OAC5B,MAAM,IAAIjD,MAAM,mFAEpB,OAAOqpE,EAAc5zB,cAAc3vC,KAAK8tC,GAAiBmJ,GAA0BnJ,EAAcy1B,EAAcnyB,YACnH,CAEI,MAAM,IAAIl3C,MAAM,kE+VnBjB,IAA0B+5B,C/VqBjC,C4VgCyB0kH,CAAoCp1E,GAAiBhtB,IAC1E,GAAIrG,KAAK,wCAAyCkH,GAClD,MAAMwhG,EAAgBjjI,GAAS8vC,QAAU,CAAC,EACpC67E,EAAgBsX,EAActX,eAAiB,G9MoFlD,IAAmB/5H,E8MrEtB,OAdIoO,GAASkjI,iBACTvX,EAAcplI,QAAQ27I,GAAmBzgG,EAAc,IAChDohG,MACA7iI,EAAQmjI,aAIfxX,EAAcplI,QAAQ27I,GAAmBzgG,EAAczhC,EAAQmjI,YAE/DnjI,GAASojI,gBACTzX,EAAcplI,M9MyEIqL,E8MzEW,CAAEg0C,KAAM5lC,EAAQojI,gB9M0EzC90F,GAAe,IAAIy9C,GAAUz9C,EAAY18C,K8MxEjDqxI,EAActX,cAAgBA,EAEvB,CAAE77E,aADY0yF,GAAc/gG,EAAcwhG,EAAejjI,GAAS4gB,WACxD6gB,eACrB,CEhE2C4hG,CAA6BrjI,GAC9D3I,EAAO,IAAIo3D,GAAShtB,EAAczhC,EAAS8vC,EAAQ,CACrDqe,OAAO,EACPY,WAAW,EACXn8D,QAAQ,IAMZ,OAH2B,IAAvBoN,GAASsiG,iBACHjrG,EAAKtK,QAERsK,CACX,CEiBO,SAAS,GAAO1J,GACnB,OArCkD21I,EAqCjCv9I,KArC0Cw9I,OAqCpC,EArCmDC,EAqCnC,WACnC,IAAI9sH,EAASgZ,EAAM+zG,EACnB,OA9BwC,SAAUH,EAAS5/G,GAC/D,IAAsG1oB,EAAG63D,EAAG3vD,EAAxGwb,EAAI,CAAEmhF,MAAO,EAAG6jC,KAAM,WAAa,GAAW,EAAPxgI,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGygI,KAAM,GAAI7gB,IAAK,IAAenlD,EAAIj5E,OAAOC,QAA4B,mBAAbi/I,SAA0BA,SAAWl/I,QAAQa,WACtL,OAAOo4E,EAAEvvE,KAAOy1I,EAAK,GAAIlmE,EAAS,MAAIkmE,EAAK,GAAIlmE,EAAU,OAAIkmE,EAAK,GAAsB,mBAAXr6G,SAA0Bm0C,EAAEn0C,OAAOyb,UAAY,WAAa,OAAOl/C,IAAM,GAAI43E,EAC1J,SAASkmE,EAAKtqI,GAAK,OAAO,SAAUnU,GAAK,OACzC,SAAck+B,GACV,GAAItoB,EAAG,MAAM,IAAI7U,UAAU,mCAC3B,KAAOw3E,IAAMA,EAAI,EAAGr6C,EAAG,KAAO5E,EAAI,IAAKA,OACnC,GAAI1jB,EAAI,EAAG63D,IAAM3vD,EAAY,EAARogB,EAAG,GAASuvC,EAAU,OAAIvvC,EAAG,GAAKuvC,EAAS,SAAO3vD,EAAI2vD,EAAU,SAAM3vD,EAAElc,KAAK6rE,GAAI,GAAKA,EAAEzkE,SAAW8U,EAAIA,EAAElc,KAAK6rE,EAAGvvC,EAAG,KAAKyF,KAAM,OAAO7lB,EAE3J,OADI2vD,EAAI,EAAG3vD,IAAGogB,EAAK,CAAS,EAARA,EAAG,GAAQpgB,EAAEne,QACzBu+B,EAAG,IACP,KAAK,EAAG,KAAK,EAAGpgB,EAAIogB,EAAI,MACxB,KAAK,EAAc,OAAX5E,EAAEmhF,QAAgB,CAAE96G,MAAOu+B,EAAG,GAAIyF,MAAM,GAChD,KAAK,EAAGrK,EAAEmhF,QAAShtC,EAAIvvC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK5E,EAAEokG,IAAIv/F,MAAO7E,EAAEilH,KAAKpgH,MAAO,SACxC,QACI,MAAkBrgB,GAAZA,EAAIwb,EAAEilH,MAAYn8I,OAAS,GAAK0b,EAAEA,EAAE1b,OAAS,KAAkB,IAAV87B,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE5E,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV4E,EAAG,MAAcpgB,GAAMogB,EAAG,GAAKpgB,EAAE,IAAMogB,EAAG,GAAKpgB,EAAE,IAAM,CAAEwb,EAAEmhF,MAAQv8E,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY5E,EAAEmhF,MAAQ38F,EAAE,GAAI,CAAEwb,EAAEmhF,MAAQ38F,EAAE,GAAIA,EAAIogB,EAAI,KAAO,CACpE,GAAIpgB,GAAKwb,EAAEmhF,MAAQ38F,EAAE,GAAI,CAAEwb,EAAEmhF,MAAQ38F,EAAE,GAAIwb,EAAEokG,IAAIv8H,KAAK+8B,GAAK,KAAO,CAC9DpgB,EAAE,IAAIwb,EAAEokG,IAAIv/F,MAChB7E,EAAEilH,KAAKpgH,MAAO,SAEtBD,EAAKI,EAAK18B,KAAKs8I,EAAS5kH,EAC5B,CAAE,MAAO1U,GAAKsZ,EAAK,CAAC,EAAGtZ,GAAI6oD,EAAI,CAAG,CAAE,QAAU73D,EAAIkI,EAAI,CAAG,CACzD,GAAY,EAARogB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEv+B,MAAOu+B,EAAG,GAAKA,EAAG,QAAK,EAAQyF,MAAM,EAC9E,CAtBgD44E,CAAK,CAACpoG,EAAGnU,GAAK,CAAG,CAuBrE,CAIe0+I,CAAY/9I,MAAM,SAAUg+I,GAC/B,OAAQA,EAAGlkC,OACP,KAAK,EAGD,OAFAnpF,EAAU,IAAIob,YACdpC,EAAOhZ,EAAQzb,OAAOtN,GACf,CAAC,EAAawlC,OAAOC,OAAOx3B,OAAO,UAAW8zB,IACzD,KAAK,EAID,OAHA+zG,EAAaM,EAAGL,OAGT,CAAC,EAFIh8I,MAAM4c,KAAK,IAAItO,WAAWytI,IAClBp5I,KAAI,SAAUsc,GAAK,OAAOA,EAAEva,SAAS,IAAIiqD,SAAS,EAAG,IAAM,IAAGzoD,KAAK,KAGnG,GACJ,EAlDO,KAFgEuvE,OAqCxC,KAnCbA,EAAI76C,WAAU,SAAUr4B,EAASs4B,GAC/C,SAASyhH,EAAUj/I,GAAS,IAAM48G,EAAK6hC,EAAUp1I,KAAKrJ,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC1F,SAASi6H,EAASl/I,GAAS,IAAM48G,EAAK6hC,EAAiB,MAAEz+I,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC7F,SAAS23F,EAAK9mG,GAJlB,IAAe9V,EAIa8V,EAAOkuB,KAAO9+B,EAAQ4Q,EAAO9V,QAJ1CA,EAIyD8V,EAAO9V,MAJhDA,aAAiBo4E,EAAIp4E,EAAQ,IAAIo4E,GAAE,SAAUlzE,GAAWA,EAAQlF,EAAQ,KAIjBukC,KAAK06G,EAAWC,EAAW,CAC7GtiC,GAAM6hC,EAAYA,EAAUl7I,MAAMg7I,EAASC,GAAc,KAAKn1I,OAClE,IAPwC,IAAUk1I,EAASC,EAAYpmE,EAAGqmE,CAqD9E,CCrDA,IAwCWU,GAAwB,yCAC/BC,GAAmB,KAChB,SAASC,KACZ,OA3CkDd,EA2CjCv9I,KA3C0Cw9I,OA2CpC,EA3CmDC,EA2CnC,WACnC,IAAI/vD,EAAkBp8E,EACtB,OApCwC,SAAUisI,EAAS5/G,GAC/D,IAAsG1oB,EAAG63D,EAAG3vD,EAAxGwb,EAAI,CAAEmhF,MAAO,EAAG6jC,KAAM,WAAa,GAAW,EAAPxgI,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGygI,KAAM,GAAI7gB,IAAK,IAAenlD,EAAIj5E,OAAOC,QAA4B,mBAAbi/I,SAA0BA,SAAWl/I,QAAQa,WACtL,OAAOo4E,EAAEvvE,KAAOy1I,EAAK,GAAIlmE,EAAS,MAAIkmE,EAAK,GAAIlmE,EAAU,OAAIkmE,EAAK,GAAsB,mBAAXr6G,SAA0Bm0C,EAAEn0C,OAAOyb,UAAY,WAAa,OAAOl/C,IAAM,GAAI43E,EAC1J,SAASkmE,EAAKtqI,GAAK,OAAO,SAAUnU,GAAK,OACzC,SAAck+B,GACV,GAAItoB,EAAG,MAAM,IAAI7U,UAAU,mCAC3B,KAAOw3E,IAAMA,EAAI,EAAGr6C,EAAG,KAAO5E,EAAI,IAAKA,OACnC,GAAI1jB,EAAI,EAAG63D,IAAM3vD,EAAY,EAARogB,EAAG,GAASuvC,EAAU,OAAIvvC,EAAG,GAAKuvC,EAAS,SAAO3vD,EAAI2vD,EAAU,SAAM3vD,EAAElc,KAAK6rE,GAAI,GAAKA,EAAEzkE,SAAW8U,EAAIA,EAAElc,KAAK6rE,EAAGvvC,EAAG,KAAKyF,KAAM,OAAO7lB,EAE3J,OADI2vD,EAAI,EAAG3vD,IAAGogB,EAAK,CAAS,EAARA,EAAG,GAAQpgB,EAAEne,QACzBu+B,EAAG,IACP,KAAK,EAAG,KAAK,EAAGpgB,EAAIogB,EAAI,MACxB,KAAK,EAAc,OAAX5E,EAAEmhF,QAAgB,CAAE96G,MAAOu+B,EAAG,GAAIyF,MAAM,GAChD,KAAK,EAAGrK,EAAEmhF,QAAShtC,EAAIvvC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK5E,EAAEokG,IAAIv/F,MAAO7E,EAAEilH,KAAKpgH,MAAO,SACxC,QACI,MAAkBrgB,GAAZA,EAAIwb,EAAEilH,MAAYn8I,OAAS,GAAK0b,EAAEA,EAAE1b,OAAS,KAAkB,IAAV87B,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE5E,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV4E,EAAG,MAAcpgB,GAAMogB,EAAG,GAAKpgB,EAAE,IAAMogB,EAAG,GAAKpgB,EAAE,IAAM,CAAEwb,EAAEmhF,MAAQv8E,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY5E,EAAEmhF,MAAQ38F,EAAE,GAAI,CAAEwb,EAAEmhF,MAAQ38F,EAAE,GAAIA,EAAIogB,EAAI,KAAO,CACpE,GAAIpgB,GAAKwb,EAAEmhF,MAAQ38F,EAAE,GAAI,CAAEwb,EAAEmhF,MAAQ38F,EAAE,GAAIwb,EAAEokG,IAAIv8H,KAAK+8B,GAAK,KAAO,CAC9DpgB,EAAE,IAAIwb,EAAEokG,IAAIv/F,MAChB7E,EAAEilH,KAAKpgH,MAAO,SAEtBD,EAAKI,EAAK18B,KAAKs8I,EAAS5kH,EAC5B,CAAE,MAAO1U,GAAKsZ,EAAK,CAAC,EAAGtZ,GAAI6oD,EAAI,CAAG,CAAE,QAAU73D,EAAIkI,EAAI,CAAG,CACzD,GAAY,EAARogB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEv+B,MAAOu+B,EAAG,GAAKA,EAAG,QAAK,EAAQyF,MAAM,EAC9E,CAtBgD44E,CAAK,CAACpoG,EAAGnU,GAAK,CAAG,CAuBrE,CAUe,CAAYW,MAAM,SAAUg+I,GAC/B,OAAQA,EAAGlkC,OACP,KAAK,EACD,OAAIskC,GACO,CAAC,EAAcA,KAE1B1wD,EAAOryD,aAAaZ,QAAQ,SACT,CAAC,EAAa,GAC1B,CAAC,EAAa,GDE9BxxB,KAAKm0B,SAAS/2B,aCDT,KAAK,EACDqnF,EAAQswD,EAAGL,OAAQz8I,MAAM,EAAG,IAC5Bm6B,aAAaf,QAAQ,OAAQozD,GAC7BswD,EAAGlkC,MAAQ,EACf,KAAK,EAAG,MAAO,CAAC,EAAahoB,GAAwB,UAAW,GAAWpE,KAC3E,KAAK,EAED,MAAO,CAAC,EAAaqvD,GAAgB,CAC7BI,kBAAkB,EAClBt1E,cAAe,CACXnyB,UAAW,GACXC,OAAQ,CAAC,IAEbiuB,cAAe,EACf7Z,OAAQ,CACJ2jB,WATCswE,EAAGL,WAYpB,KAAK,EAED,OADArsI,EAAO0sI,EAAGL,OACH,CAAC,EAAaphH,QAAQ2iC,WAAW,CAChC5tD,EAAKsoD,KAAK,oGACVtoD,EAAKsoD,KAAK,2GAEtB,KAAK,EAED,OADAokF,EAAGL,OACI,CAAC,EAAarsI,EAAKtK,SAC9B,KAAK,EAED,OADAg3I,EAAGL,OACI,CAAC,EAAarsI,EAAK62D,gBAC9B,KAAK,EAID,OAHA61E,EAAGL,OACHS,GAAmB9sI,EACnBP,OAAOk3D,KAAO32D,EACP,CAAC,EAAcA,GAElC,GACJ,EAzFO,KAFgE8lE,OA2CxC,KAzCbA,EAAI76C,WAAU,SAAUr4B,EAASs4B,GAC/C,SAASyhH,EAAUj/I,GAAS,IAAM48G,EAAK6hC,EAAUp1I,KAAKrJ,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC1F,SAASi6H,EAASl/I,GAAS,IAAM48G,EAAK6hC,EAAiB,MAAEz+I,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC7F,SAAS23F,EAAK9mG,GAJlB,IAAe9V,EAIa8V,EAAOkuB,KAAO9+B,EAAQ4Q,EAAO9V,QAJ1CA,EAIyD8V,EAAO9V,MAJhDA,aAAiBo4E,EAAIp4E,EAAQ,IAAIo4E,GAAE,SAAUlzE,GAAWA,EAAQlF,EAAQ,KAIjBukC,KAAK06G,EAAWC,EAAW,CAC7GtiC,GAAM6hC,EAAYA,EAAUl7I,MAAMg7I,EAASC,GAAc,KAAKn1I,OAClE,IAPwC,IAAUk1I,EAASC,EAAYpmE,EAAGqmE,CA4F9E,CACO,SAAS3oF,KACZ,OAAOspF,cAA2D,EAASA,GAAiBr0F,OAAO7C,OAAO7gD,UAC9G,KCrFIi4I,gCCPOC,GAAmB,IAAI,GAAAzkI,KAAK,eAClCkD,IAAI,IAAI,GAAArD,MAAM,KAAM,EAAG,WACvBqD,IAAI,IAAI,GAAArD,MAAM,YAAa,EAAG,WAC9BqD,IAAI,IAAI,GAAArD,MAAM,eAAgB,EAAG,WACjCqD,IAAI,IAAI,GAAArD,MAAM,UAAW,EAAG,WDP7B6kI,GAAkB1jH,SAAS2jH,eAAe,iBAC1CC,GAAsB5jH,SAAS2jH,eAAe,qBAC9CE,GAAwB7jH,SAAS2jH,eAAe,uBAChDG,GAAkB9jH,SAAS2jH,eAAe,iBAC1CI,GAAgB/jH,SAAS2jH,eAAe,eACxCK,GAAgBhkH,SAAS2jH,eAAe,eACxCM,GAAW,EACXC,GAAe,EACfC,GAAiB,EACjBC,GAAkB,GAEf,SAASC,GAAoBj4F,GAChCo3F,GAAgBp3F,EACZ03F,KACAA,GAAgBQ,YAAcl4F,EAEtC,CAgBO,SAASm4F,GAAgB7yI,EAASrH,GACrC+5I,GAAgB1+I,KAAKgM,GACrB8yI,IACJ,CACO,SAASA,GAAeC,GAC3B,GAAKV,GAAL,CAEAA,GAAcW,UAAY,GAC1B,IAAIC,EAAmBF,EACjBL,GAAgBryI,QAAO,SAAU8qC,GAC/B,IAAI+nG,EAAaH,EAAWnlI,cAC5B,OAAQu9B,EAAIzB,QAAQ97B,cAAc4Q,SAAS00H,IACvC/nG,EAAIjnC,GAAG0J,cAAc4Q,SAAS00H,IAC9B/nG,EAAIgoG,aAAavlI,cAAc4Q,SAAS00H,EAChD,IACER,GACNO,EAAiBrxI,MAAK,SAAUuS,EAAGC,GAAK,OAAOD,EAAEqyB,UAAYpyB,EAAEoyB,SAAW,IAC1EysG,EAAiBtyI,SAAQ,SAAUX,GAC/B,IAAIg5C,EAAO1qB,SAAS8kH,cAAc,OAClCp6F,EAAKq6F,UAAU7iI,IAAI,gBACnB,IAAI8iI,EAAY,GACZC,EAAe,GACfvzI,EAAQmzI,eAAiBrB,IACzBwB,EAAY,OACZC,EAAe,OAGfD,EAAY,iBACZC,EAAe,UAAU3+I,OAAOoL,EAAQmzI,aAAal4I,UAAU,EAAG,GAAI,SAE1E+9C,EAAKq6F,UAAU7iI,IAAI8iI,GACnB,IAAIE,EAASllH,SAAS8kH,cAAc,KACpCI,EAAOH,UAAU7iI,IAAI,cACrBgjI,EAAOZ,YAAc,OAAOh+I,OAAOoL,EAAQkE,IAC3C,IAAIuvI,EAAWnlH,SAAS8kH,cAAc,KACtCK,EAASJ,UAAU7iI,IAAI,WACvBijI,EAASb,YAAc5yI,EAAQ0pC,QAC/B,IAAIgqG,EAAcplH,SAAS8kH,cAAc,KACzCM,EAAYL,UAAU7iI,IAAI,eAC1BkjI,EAAYd,YAAc,SAASh+I,OAAO2+I,GAC1C,IAAII,EAAarlH,SAAS8kH,cAAc,KACxCO,EAAWN,UAAU7iI,IAAI,aACzBmjI,EAAWf,YAAc,IAAI50I,KAAKgC,EAAQwmC,WAAWotG,qBACrD56F,EAAK66F,YAAYL,GACjBx6F,EAAK66F,YAAYH,GACjB16F,EAAK66F,YAAYJ,GACjBz6F,EAAK66F,YAAYF,GACjBtB,GAAcwB,YAAY76F,EAC9B,GA1CU,CA2Cd,CACO,SAAS86F,KACZ,OAAOxB,GAAgBA,GAAc9/I,MAAQ,EACjD,CEpFA,IAAI,GAAwC,SAAUu+I,EAASC,EAAYpmE,EAAGqmE,GAE1E,OAAO,IAAKrmE,IAAMA,EAAI76C,WAAU,SAAUr4B,EAASs4B,GAC/C,SAASyhH,EAAUj/I,GAAS,IAAM48G,EAAK6hC,EAAUp1I,KAAKrJ,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC1F,SAASi6H,EAASl/I,GAAS,IAAM48G,EAAK6hC,EAAiB,MAAEz+I,GAAS,CAAE,MAAOilB,GAAKuY,EAAOvY,EAAI,CAAE,CAC7F,SAAS23F,EAAK9mG,GAJlB,IAAe9V,EAIa8V,EAAOkuB,KAAO9+B,EAAQ4Q,EAAO9V,QAJ1CA,EAIyD8V,EAAO9V,MAJhDA,aAAiBo4E,EAAIp4E,EAAQ,IAAIo4E,GAAE,SAAUlzE,GAAWA,EAAQlF,EAAQ,KAIjBukC,KAAK06G,EAAWC,EAAW,CAC7GtiC,GAAM6hC,EAAYA,EAAUl7I,MAAMg7I,EAASC,GAAc,KAAKn1I,OAClE,GACJ,EACI,GAA4C,SAAUk1I,EAAS5/G,GAC/D,IAAsG1oB,EAAG63D,EAAG3vD,EAAxGwb,EAAI,CAAEmhF,MAAO,EAAG6jC,KAAM,WAAa,GAAW,EAAPxgI,EAAE,GAAQ,MAAMA,EAAE,GAAI,OAAOA,EAAE,EAAI,EAAGygI,KAAM,GAAI7gB,IAAK,IAAenlD,EAAIj5E,OAAOC,QAA4B,mBAAbi/I,SAA0BA,SAAWl/I,QAAQa,WACtL,OAAOo4E,EAAEvvE,KAAOy1I,EAAK,GAAIlmE,EAAS,MAAIkmE,EAAK,GAAIlmE,EAAU,OAAIkmE,EAAK,GAAsB,mBAAXr6G,SAA0Bm0C,EAAEn0C,OAAOyb,UAAY,WAAa,OAAOl/C,IAAM,GAAI43E,EAC1J,SAASkmE,EAAKtqI,GAAK,OAAO,SAAUnU,GAAK,OACzC,SAAck+B,GACV,GAAItoB,EAAG,MAAM,IAAI7U,UAAU,mCAC3B,KAAOw3E,IAAMA,EAAI,EAAGr6C,EAAG,KAAO5E,EAAI,IAAKA,OACnC,GAAI1jB,EAAI,EAAG63D,IAAM3vD,EAAY,EAARogB,EAAG,GAASuvC,EAAU,OAAIvvC,EAAG,GAAKuvC,EAAS,SAAO3vD,EAAI2vD,EAAU,SAAM3vD,EAAElc,KAAK6rE,GAAI,GAAKA,EAAEzkE,SAAW8U,EAAIA,EAAElc,KAAK6rE,EAAGvvC,EAAG,KAAKyF,KAAM,OAAO7lB,EAE3J,OADI2vD,EAAI,EAAG3vD,IAAGogB,EAAK,CAAS,EAARA,EAAG,GAAQpgB,EAAEne,QACzBu+B,EAAG,IACP,KAAK,EAAG,KAAK,EAAGpgB,EAAIogB,EAAI,MACxB,KAAK,EAAc,OAAX5E,EAAEmhF,QAAgB,CAAE96G,MAAOu+B,EAAG,GAAIyF,MAAM,GAChD,KAAK,EAAGrK,EAAEmhF,QAAShtC,EAAIvvC,EAAG,GAAIA,EAAK,CAAC,GAAI,SACxC,KAAK,EAAGA,EAAK5E,EAAEokG,IAAIv/F,MAAO7E,EAAEilH,KAAKpgH,MAAO,SACxC,QACI,MAAkBrgB,GAAZA,EAAIwb,EAAEilH,MAAYn8I,OAAS,GAAK0b,EAAEA,EAAE1b,OAAS,KAAkB,IAAV87B,EAAG,IAAsB,IAAVA,EAAG,IAAW,CAAE5E,EAAI,EAAG,QAAU,CAC3G,GAAc,IAAV4E,EAAG,MAAcpgB,GAAMogB,EAAG,GAAKpgB,EAAE,IAAMogB,EAAG,GAAKpgB,EAAE,IAAM,CAAEwb,EAAEmhF,MAAQv8E,EAAG,GAAI,KAAO,CACrF,GAAc,IAAVA,EAAG,IAAY5E,EAAEmhF,MAAQ38F,EAAE,GAAI,CAAEwb,EAAEmhF,MAAQ38F,EAAE,GAAIA,EAAIogB,EAAI,KAAO,CACpE,GAAIpgB,GAAKwb,EAAEmhF,MAAQ38F,EAAE,GAAI,CAAEwb,EAAEmhF,MAAQ38F,EAAE,GAAIwb,EAAEokG,IAAIv8H,KAAK+8B,GAAK,KAAO,CAC9DpgB,EAAE,IAAIwb,EAAEokG,IAAIv/F,MAChB7E,EAAEilH,KAAKpgH,MAAO,SAEtBD,EAAKI,EAAK18B,KAAKs8I,EAAS5kH,EAC5B,CAAE,MAAO1U,GAAKsZ,EAAK,CAAC,EAAGtZ,GAAI6oD,EAAI,CAAG,CAAE,QAAU73D,EAAIkI,EAAI,CAAG,CACzD,GAAY,EAARogB,EAAG,GAAQ,MAAMA,EAAG,GAAI,MAAO,CAAEv+B,MAAOu+B,EAAG,GAAKA,EAAG,QAAK,EAAQyF,MAAM,EAC9E,CAtBgD44E,CAAK,CAACpoG,EAAGnU,GAAK,CAAG,CAuBrE,EAKIkhJ,GAAe,EAkJnBzlH,SAASypB,iBAAiB,oBAAoB,WAC1Ct3C,QAAQ7B,IAAI,6DAlJhB,WACW,GAAUpL,UAAM,OAAQ,GAAQ,WACnC,IAAIwgJ,EAAQC,EAAiBC,EAAoBC,EAAqBC,EAAmBC,EAAcC,EAAaC,EAASnC,EACzHoC,EAAQhhJ,KACZ,OAAO,GAAYA,MAAM,SAAUg+I,GAC/B,OAAQA,EAAGlkC,OACP,KAAK,EAGD,OAFAkkC,EAAGJ,KAAKp9I,KAAK,CAAC,EAAG,EAAG,CAAE,IACtByM,QAAQ7B,IAAI,6BACL,CAAC,EAAaizI,MACzB,KAAK,EAsHD,OArHAmC,EAASxC,EAAGL,OACZ8C,EAAkB3rF,KAClB7nD,QAAQ7B,IAAI,kCAAmCq1I,GAC3CA,GACAtB,GAAoBsB,GAExBC,EAAqB,WAAc,OAAO,GAAUM,OAAO,OAAQ,GAAQ,WACvE,IAAIrwH,EAASpvB,EAAG0/I,EAAgBluG,EAASmuG,EAAoBtrG,EAAWurG,EAAarsI,EAAQssI,EAC7F,OAAO,GAAYphJ,MAAM,SAAUg+I,GAC/B,OAAQA,EAAGlkC,OACP,KAAK,EACDnpF,EHkCzB0tB,GAAc,CACjBjM,aAAc+rG,GACd1hG,qBAAsB,CAClB/G,UAAW,GACXiG,MAAO,KGrCiB4kG,KACAtzI,QAAQ7B,IAAI,kBAAkBhK,OAAOm/I,GAAc,QAAQn/I,OA1BlE,EA0BiG,iBAC1FG,EAAI,EACJy8I,EAAGlkC,MAAQ,EACf,KAAK,EACD,KAAMv4G,EA9Bb,GA8B0C,MAAO,CAAC,EAAa,GACxD0/I,EAAiB,SAAS7/I,OAAOm/I,GAAc,WAAWn/I,OAAOG,EAAI,EAAG,OAAOH,QAAO,IAAIoJ,MAAO41I,sBACjGrtG,ED/D7B,SAAuBmD,GAC1B,IAAIxlC,EAAK,GAAGtP,OAAOoJ,KAAKu2D,MAAO,KAAK3/D,OAAO6H,KAAKm0B,SAAS/2B,SAAS,IAAIoB,UAAU,EAAG,IAC/E+E,EAAU+xI,GAAiB3/I,OAAO,CAClC8R,GAAIA,EACJsiC,UAAWxoC,KAAKu2D,MAChB4+E,aAAc7qF,MAAe,UAC7B5e,QAASA,IAEb,OAAOqoG,GAAiBrpI,OAAO1I,GAAS2W,QAC5C,CCsD8C,CAAc89H,GACxBC,EAAqB3C,GAAiBviI,OAAO+2B,GAC7C6C,EAAYsrG,EAAmBxwI,IAAM,WAAWtP,OAAOoJ,KAAKu2D,OAC5DogF,EAAc,CACVzwI,GAAIklC,EACJ5C,UAAWxoC,KAAKu2D,MAChB4+E,aAAcc,GAAmB,UACjCvqG,QAAS+qG,GAEbjD,EAAGlkC,MAAQ,EACf,KAAK,EAED,OADAkkC,EAAGJ,KAAKp9I,KAAK,CAAC,EAAG,EAAG,CAAE,IACf,CAAC,EAAaggJ,EAAO/hF,UAAUhuC,KAAKE,EAAS,CAC5CoiB,QAASA,EACTC,UAAW,IAAIxoC,KAAK22I,EAAYnuG,YACjC,CAAEwyB,WAAW,KACxB,KAAK,EAUD,OATA1wD,EAASkpI,EAAGL,QACD9+E,UAAUp9D,OAAS,GAC1BwL,QAAQ7B,IAAI,WAAWhK,OAAOG,EAAI,EAAG,UAAUH,OAAO+/I,EAAYzwI,GAAI,yBFxE1GquI,KACIP,KACAA,GAAgBY,YAAcL,GAAS14I,YEwEPg5I,GAAgB8B,IAGhBl0I,QAAQC,KAAK,0BAA0B9L,OAAOG,EAAI,EAAG,UAAUH,OAAO+/I,EAAYzwI,GAAI,MAAOoE,EAAO6pD,UAEjG,CAAC,EAAa,GACzB,KAAK,EAGD,OAFAyiF,EAAUpD,EAAGL,OACb1wI,QAAQua,MAAM,yBAAyBpmB,OAAOG,EAAI,EAAG,UAAUH,OAAO+/I,EAAYzwI,GAAI,MAAO0wI,GACtF,CAAC,EAAa,GACzB,KAAK,EAAG,MAAO,CAAC,EAAa,IAAI7kH,SAAQ,SAAUr4B,GAAW,OAAO2iB,WAAW3iB,EAAS,IAAM,KAC/F,KAAK,EACD85I,EAAGL,OACHK,EAAGlkC,MAAQ,EACf,KAAK,EAED,OADAv4G,IACO,CAAC,EAAa,GACzB,KAAK,EAED,OADA0L,QAAQ7B,IAAI,mCACL,CAAC,GAEpB,GACJ,GAAI,EACJu1I,EAAsB,WAAc,OAAO,GAAUK,OAAO,OAAQ,GAAQ,WACxE,IAAIpwH,EACJ,OAAO,GAAY5wB,MAAM,SAAUg+I,GAC/B,OAAQA,EAAGlkC,OACP,KAAK,EAGD,OAFAlpF,EHdzB4tB,GAAc2/F,GAAuB,CAAEzoG,UAAW,GAAIiG,MAAO,IGepC1uC,QAAQ7B,IAAI,8BACL,CAAC,EAAao1I,EAAO3zI,OAAOymC,UAAU1iB,GAAS,SAAU0jB,GACxDrnC,QAAQ7B,IAAI,6CAA8CkpC,EAAYvB,QAAQtxC,QAC9E,IAAI0/I,ED1GzC,SAAuBpuG,GAC1B,IACI,IAAI0sB,EAAU8+E,GAAiBviI,OAAO+2B,GACtC,MAAO,CACHriC,GAAI+uD,EAAQ/uD,GACZsiC,UAAWzoC,OAAOk1D,EAAQzsB,WAC1B2sG,aAAclgF,EAAQkgF,aACtBzpG,QAASupB,EAAQvpB,QAEzB,CACA,MAAO1uB,GAEH,OADAva,QAAQua,MAAM,4BAA6BA,GACpC,IACX,CACJ,CC4F8D,CAAc8sB,EAAYvB,SACxCouG,GACAl0I,QAAQ7B,IAAI,wBAAyB+1I,GACjCA,EAAYxB,eAAiBc,GFxG7EzB,KACIN,KACAA,GAAoBU,YAAcJ,GAAa34I,YEwGH4G,QAAQ7B,IAAI,mCAAoC+1I,EAAYzwI,MFrG5GuuI,KACIN,KACAA,GAAsBS,YAAcH,GAAe54I,YEuGPg5I,GAAgB8B,GAChBl0I,QAAQ7B,IAAI,oCAAqC+1I,EAAYzwI,MAIjEzD,QAAQC,KAAK,2FAErB,KACR,KAAK,EAGD,OAFA8wI,EAAGL,OACH1wI,QAAQ7B,IAAI,wBACL,CAAC,GAEpB,GACJ,GAAI,GACJw1I,EAAoB9lH,SAAS2jH,eAAe,uBAExCmC,EAAkBr8F,iBAAiB,SAAS,WACxCt3C,QAAQ7B,IAAI,+BACZs1I,GACJ,KAEJG,EAAe/lH,SAAS2jH,eAAe,kBAEnCoC,EAAat8F,iBAAiB,SAAS,WACnCt3C,QAAQ7B,IAAI,yBACZk0I,GAAegB,KACnB,KAEJQ,EAAchmH,SAAS2jH,eAAe,iBAElCqC,EAAYv8F,iBAAiB,SAAS,WAClCt3C,QAAQ7B,IAAI,wBACZk0I,GAAegB,KACnB,IAEG,CAAC,EAAaK,KACzB,KAAK,EAGD,OAFA3C,EAAGL,OACH1wI,QAAQ7B,IAAI,gFACL,CAAC,EAAa,GACzB,KAAK,EAMD,OALA21I,EAAU/C,EAAGL,OACb1wI,QAAQua,MAAM,4CAA6Cu5H,IAC3DnC,EAAkB9jH,SAAS2jH,eAAe,oBAEtCG,EAAgBQ,YAAc,qCAC3B,CAAC,EAAa,GACzB,KAAK,EAAG,MAAO,CAAC,GAExB,GACJ,GACJ,CAGIiC,EACJ","sources":["webpack://waku-dogfooding/./node_modules/hashlru/index.js","webpack://waku-dogfooding/./node_modules/eventemitter3/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/types.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/verifier.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/tokenize.js","webpack://waku-dogfooding/./node_modules/event-iterator/lib/dom.js","webpack://waku-dogfooding/./node_modules/debug/src/common.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/converter.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/writer_buffer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/encoder.js","webpack://waku-dogfooding/./node_modules/js-sha3/src/sha3.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/field.js","webpack://waku-dogfooding/./node_modules/@protobufjs/utf8/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/oneof.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util/longbits.js","webpack://waku-dogfooding/./node_modules/protobufjs/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/message.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/reader_buffer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/writer.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/util/minimal.js","webpack://waku-dogfooding/./node_modules/retry/lib/retry_operation.js","webpack://waku-dogfooding/./node_modules/@protobufjs/inquire/index.js","webpack://waku-dogfooding/./node_modules/@protobufjs/eventemitter/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index-minimal.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/roots.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/parse.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/rpc.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/common.js","webpack://waku-dogfooding/./node_modules/@protobufjs/fetch/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/index-light.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/root.js","webpack://waku-dogfooding/./node_modules/netmask/lib/netmask.js","webpack://waku-dogfooding/./node_modules/retry/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/enum.js","webpack://waku-dogfooding/./node_modules/hi-base32/src/base32.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/reader.js","webpack://waku-dogfooding/./node_modules/is-plain-obj/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/wrappers.js","webpack://waku-dogfooding/./node_modules/ms/index.js","webpack://waku-dogfooding/./node_modules/merge-options/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/object.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/rpc/service.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/decoder.js","webpack://waku-dogfooding/./node_modules/debug/src/browser.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/type.js","webpack://waku-dogfooding/./node_modules/@protobufjs/aspromise/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/mapfield.js","webpack://waku-dogfooding/./node_modules/retry/lib/retry.js","webpack://waku-dogfooding/./node_modules/@protobufjs/codegen/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/method.js","webpack://waku-dogfooding/./node_modules/@protobufjs/base64/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/namespace.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/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/float/index.js","webpack://waku-dogfooding/./node_modules/protobufjs/src/service.js","webpack://waku-dogfooding/./node_modules/event-iterator/lib/event-iterator.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/@waku/proto/dist/generated/sds_message.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_indicator.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/logger/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/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/race-signal/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-merge/node_modules/it-queueless-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/sdk/node_modules/@waku/core/dist/lib/stream_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/stream_manager/stream_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/base_protocol.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/native.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/rng.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/stringify.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/uuid/dist/esm-browser/v4.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/filter/filter_rpc.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/filter/filter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/light_push/push_rpc.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/light_push/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/light_push/light_push.js","webpack://waku-dogfooding/./node_modules/@waku/utils/dist/common/is_size_valid.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/to_proto_message.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/store/rpc.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/store/store.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/event-target.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-id.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/netmask/dist/src/ip.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/util.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/cidr.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/ipnet.js","webpack://waku-dogfooding/./node_modules/@chainsafe/is-ip/lib/is-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/sdk/node_modules/@waku/core/dist/lib/connection_manager/keep_alive_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/connection_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/connection_manager/connection_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/@waku/core/dist/lib/metadata/metadata.js","webpack://waku-dogfooding/./node_modules/@waku/message-hash/dist/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/subscription_monitor.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/subscription.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/constants.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/filter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter_next/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter_next/subscription.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/filter_next/filter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/health_indicator/health_indicator.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/light_push/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/light_push/retry_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/light_push/light_push.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/peer_manager/peer_manager.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/store/store.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku/utils.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku/wait_for_remote_peer.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/waku/waku.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/der.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ecdsa/ecdsa.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ecdsa/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ecdsa/index.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/index.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ed25519/ed25519.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/ed25519/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/keys.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/webcrypto/webcrypto.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/webcrypto/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/rsa.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/index.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/rsa/utils.js","webpack://waku-dogfooding/./node_modules/@noble/hashes/esm/hmac.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/util.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1/secp256k1.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/crypto/dist/src/keys/secp256k1/index.browser.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/peer-id.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-id/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/node_modules/it-length-prefixed/dist/src/encode.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/node_modules/it-length-prefixed/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/node_modules/it-length-prefixed/dist/src/decode.js","webpack://waku-dogfooding/./node_modules/@chainsafe/libp2p-noise/node_modules/it-length-prefixed/dist/src/utils.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.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/envelope/envelope.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/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-record/dist/src/envelope/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/private-ip.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/multiaddr/is-private.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/multiaddr/is-ip-based.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr-matcher/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/@multiformats/multiaddr-matcher/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-queueless-pushable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-byte-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-length-prefixed-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-length-prefixed-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/it-protobuf-stream/node_modules/it-byte-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/identify/dist/src/pb/message.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/utils/dist/src/multiaddr/is-global-unicast.js","webpack://waku-dogfooding/./node_modules/@chainsafe/netmask/dist/src/index.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/errors.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/mplex/dist/src/errors.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/@libp2p/crypto/dist/src/random-bytes.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/ping.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/it-first/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/ping/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/transport.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/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/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/websockets/dist/src/listener.browser.js","webpack://waku-dogfooding/./node_modules/p-timeout/index.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/@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/@waku/sdk/node_modules/libp2p/dist/src/config.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/content-routing.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-routing.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/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/pb/peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/bytes-to-peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/utils/peer-equals.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/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-store/dist/src/index.js","webpack://waku-dogfooding/./node_modules/interface-store/dist/src/errors.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/@waku/sdk/node_modules/libp2p/dist/src/address-manager/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/address-manager/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/startable.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/components.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/config/connection-gater.browser.js","webpack://waku-dogfooding/./node_modules/@libp2p/peer-collections/dist/src/map.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/get-peer.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/close.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/connection-pruner.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/constants.browser.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/constants.defaults.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/priority-queue.js","webpack://waku-dogfooding/./node_modules/any-signal/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/address-sorter.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/dial-queue.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/interface/dist/src/peer-store.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/peer-queue.js","webpack://waku-dogfooding/./node_modules/is-network-error/index.js","webpack://waku-dogfooding/./node_modules/p-retry/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/reconnect-queue.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection-manager/index.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/@waku/sdk/node_modules/libp2p/dist/src/connection-monitor.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/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/@waku/sdk/node_modules/libp2p/dist/src/peer-routing.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/random-walk.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/registrar.js","webpack://waku-dogfooding/./node_modules/@libp2p/utils/dist/src/tracked-map.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/transport-manager.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/constants.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/encode.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed/dist/src/decode.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-queueless-pushable/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-byte-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed-stream/dist/src/errors.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-length-prefixed-stream/dist/src/index.js","webpack://waku-dogfooding/./node_modules/@libp2p/multistream-select/node_modules/it-byte-stream/dist/src/index.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.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/connection/index.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/upgrader.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/libp2p.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/node_modules/libp2p/dist/src/version.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/env.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/quick-lru/index.js","webpack://waku-dogfooding/./node_modules/dns-over-http-resolver/dist/src/utils.js","webpack://waku-dogfooding/./node_modules/dns-over-http-resolver/dist/src/index.js","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/node_modules/@waku/core/dist/lib/stream_manager/utils.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/node_modules/@waku/core/dist/lib/stream_manager/stream_manager.js","webpack://waku-dogfooding/./node_modules/@waku/discovery/node_modules/@waku/core/dist/lib/base_protocol.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/discovery.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/dist/create/libp2p.js","webpack://waku-dogfooding/./node_modules/@waku/sdk/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/./src/utils.ts","webpack://waku-dogfooding/./src/waku-service.ts","webpack://waku-dogfooding/./src/ui-manager.ts","webpack://waku-dogfooding/./src/message-service.ts","webpack://waku-dogfooding/./src/index.ts"],"sourcesContent":["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","'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","\"use strict\";\n\n/**\n * Common type constants.\n * @namespace\n */\nvar types = exports;\n\nvar util = require(\"./util\");\n\nvar s = [\n \"double\", // 0\n \"float\", // 1\n \"int32\", // 2\n \"uint32\", // 3\n \"sint32\", // 4\n \"fixed32\", // 5\n \"sfixed32\", // 6\n \"int64\", // 7\n \"uint64\", // 8\n \"sint64\", // 9\n \"fixed64\", // 10\n \"sfixed64\", // 11\n \"bool\", // 12\n \"string\", // 13\n \"bytes\" // 14\n];\n\nfunction bake(values, offset) {\n var i = 0, o = {};\n offset |= 0;\n while (i < values.length) o[s[i + offset]] = values[i++];\n return o;\n}\n\n/**\n * Basic type wire types.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n * @property {number} bytes=2 Ldelim wire type\n */\ntypes.basic = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2,\n /* bytes */ 2\n]);\n\n/**\n * Basic type defaults.\n * @type {Object.}\n * @const\n * @property {number} double=0 Double default\n * @property {number} float=0 Float default\n * @property {number} int32=0 Int32 default\n * @property {number} uint32=0 Uint32 default\n * @property {number} sint32=0 Sint32 default\n * @property {number} fixed32=0 Fixed32 default\n * @property {number} sfixed32=0 Sfixed32 default\n * @property {number} int64=0 Int64 default\n * @property {number} uint64=0 Uint64 default\n * @property {number} sint64=0 Sint32 default\n * @property {number} fixed64=0 Fixed64 default\n * @property {number} sfixed64=0 Sfixed64 default\n * @property {boolean} bool=false Bool default\n * @property {string} string=\"\" String default\n * @property {Array.} bytes=Array(0) Bytes default\n * @property {null} message=null Message default\n */\ntypes.defaults = bake([\n /* double */ 0,\n /* float */ 0,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 0,\n /* sfixed32 */ 0,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 0,\n /* sfixed64 */ 0,\n /* bool */ false,\n /* string */ \"\",\n /* bytes */ util.emptyArray,\n /* message */ null\n]);\n\n/**\n * Basic long type wire types.\n * @type {Object.}\n * @const\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n */\ntypes.long = bake([\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1\n], 7);\n\n/**\n * Allowed types for map keys with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n * @property {number} string=2 Ldelim wire type\n */\ntypes.mapKey = bake([\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0,\n /* string */ 2\n], 2);\n\n/**\n * Allowed types for packed repeated fields with their associated wire type.\n * @type {Object.}\n * @const\n * @property {number} double=1 Fixed64 wire type\n * @property {number} float=5 Fixed32 wire type\n * @property {number} int32=0 Varint wire type\n * @property {number} uint32=0 Varint wire type\n * @property {number} sint32=0 Varint wire type\n * @property {number} fixed32=5 Fixed32 wire type\n * @property {number} sfixed32=5 Fixed32 wire type\n * @property {number} int64=0 Varint wire type\n * @property {number} uint64=0 Varint wire type\n * @property {number} sint64=0 Varint wire type\n * @property {number} fixed64=1 Fixed64 wire type\n * @property {number} sfixed64=1 Fixed64 wire type\n * @property {number} bool=0 Varint wire type\n */\ntypes.packed = bake([\n /* double */ 1,\n /* float */ 5,\n /* int32 */ 0,\n /* uint32 */ 0,\n /* sint32 */ 0,\n /* fixed32 */ 5,\n /* sfixed32 */ 5,\n /* int64 */ 0,\n /* uint64 */ 0,\n /* sint64 */ 0,\n /* fixed64 */ 1,\n /* sfixed64 */ 1,\n /* bool */ 0\n]);\n","\"use strict\";\nmodule.exports = verifier;\n\nvar Enum = require(\"./enum\"),\n util = require(\"./util\");\n\nfunction invalid(field, expected) {\n return field.name + \": \" + expected + (field.repeated && expected !== \"array\" ? \"[]\" : field.map && expected !== \"object\" ? \"{k:\"+field.keyType+\"}\" : \"\") + \" expected\";\n}\n\n/**\n * Generates a partial value verifier.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genVerifyValue(gen, field, fieldIndex, ref) {\n /* eslint-disable no-unexpected-multiline */\n if (field.resolvedType) {\n if (field.resolvedType instanceof Enum) { gen\n (\"switch(%s){\", ref)\n (\"default:\")\n (\"return%j\", invalid(field, \"enum value\"));\n for (var keys = Object.keys(field.resolvedType.values), j = 0; j < keys.length; ++j) gen\n (\"case %i:\", field.resolvedType.values[keys[j]]);\n gen\n (\"break\")\n (\"}\");\n } else {\n gen\n (\"{\")\n (\"var e=types[%i].verify(%s);\", fieldIndex, ref)\n (\"if(e)\")\n (\"return%j+e\", field.name + \".\")\n (\"}\");\n }\n } else {\n switch (field.type) {\n case \"int32\":\n case \"uint32\":\n case \"sint32\":\n case \"fixed32\":\n case \"sfixed32\": gen\n (\"if(!util.isInteger(%s))\", ref)\n (\"return%j\", invalid(field, \"integer\"));\n break;\n case \"int64\":\n case \"uint64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(!util.isInteger(%s)&&!(%s&&util.isInteger(%s.low)&&util.isInteger(%s.high)))\", ref, ref, ref, ref)\n (\"return%j\", invalid(field, \"integer|Long\"));\n break;\n case \"float\":\n case \"double\": gen\n (\"if(typeof %s!==\\\"number\\\")\", ref)\n (\"return%j\", invalid(field, \"number\"));\n break;\n case \"bool\": gen\n (\"if(typeof %s!==\\\"boolean\\\")\", ref)\n (\"return%j\", invalid(field, \"boolean\"));\n break;\n case \"string\": gen\n (\"if(!util.isString(%s))\", ref)\n (\"return%j\", invalid(field, \"string\"));\n break;\n case \"bytes\": gen\n (\"if(!(%s&&typeof %s.length===\\\"number\\\"||util.isString(%s)))\", ref, ref, ref)\n (\"return%j\", invalid(field, \"buffer\"));\n break;\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline */\n}\n\n/**\n * Generates a partial key verifier.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genVerifyKey(gen, field, ref) {\n /* eslint-disable no-unexpected-multiline */\n switch (field.keyType) {\n case \"int32\":\n case \"uint32\":\n case \"sint32\":\n case \"fixed32\":\n case \"sfixed32\": gen\n (\"if(!util.key32Re.test(%s))\", ref)\n (\"return%j\", invalid(field, \"integer key\"));\n break;\n case \"int64\":\n case \"uint64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(!util.key64Re.test(%s))\", ref) // see comment above: x is ok, d is not\n (\"return%j\", invalid(field, \"integer|Long key\"));\n break;\n case \"bool\": gen\n (\"if(!util.key2Re.test(%s))\", ref)\n (\"return%j\", invalid(field, \"boolean key\"));\n break;\n }\n return gen;\n /* eslint-enable no-unexpected-multiline */\n}\n\n/**\n * Generates a verifier specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction verifier(mtype) {\n /* eslint-disable no-unexpected-multiline */\n\n var gen = util.codegen([\"m\"], mtype.name + \"$verify\")\n (\"if(typeof m!==\\\"object\\\"||m===null)\")\n (\"return%j\", \"object expected\");\n var oneofs = mtype.oneofsArray,\n seenFirstField = {};\n if (oneofs.length) gen\n (\"var p={}\");\n\n for (var i = 0; i < /* initializes */ mtype.fieldsArray.length; ++i) {\n var field = mtype._fieldsArray[i].resolve(),\n ref = \"m\" + util.safeProp(field.name);\n\n if (field.optional) gen\n (\"if(%s!=null&&m.hasOwnProperty(%j)){\", ref, field.name); // !== undefined && !== null\n\n // map fields\n if (field.map) { gen\n (\"if(!util.isObject(%s))\", ref)\n (\"return%j\", invalid(field, \"object\"))\n (\"var k=Object.keys(%s)\", ref)\n (\"for(var i=0;i]/g,\n stringDoubleRe = /(?:\"([^\"\\\\]*(?:\\\\.[^\"\\\\]*)*)\")/g,\n stringSingleRe = /(?:'([^'\\\\]*(?:\\\\.[^'\\\\]*)*)')/g;\n\nvar setCommentRe = /^ *[*/]+ */,\n setCommentAltRe = /^\\s*\\*?\\/*/,\n setCommentSplitRe = /\\n/g,\n whitespaceRe = /\\s/,\n unescapeRe = /\\\\(.?)/g;\n\nvar unescapeMap = {\n \"0\": \"\\0\",\n \"r\": \"\\r\",\n \"n\": \"\\n\",\n \"t\": \"\\t\"\n};\n\n/**\n * Unescapes a string.\n * @param {string} str String to unescape\n * @returns {string} Unescaped string\n * @property {Object.} map Special characters map\n * @memberof tokenize\n */\nfunction unescape(str) {\n return str.replace(unescapeRe, function($0, $1) {\n switch ($1) {\n case \"\\\\\":\n case \"\":\n return $1;\n default:\n return unescapeMap[$1] || \"\";\n }\n });\n}\n\ntokenize.unescape = unescape;\n\n/**\n * Gets the next token and advances.\n * @typedef TokenizerHandleNext\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Peeks for the next token.\n * @typedef TokenizerHandlePeek\n * @type {function}\n * @returns {string|null} Next token or `null` on eof\n */\n\n/**\n * Pushes a token back to the stack.\n * @typedef TokenizerHandlePush\n * @type {function}\n * @param {string} token Token\n * @returns {undefined}\n */\n\n/**\n * Skips the next token.\n * @typedef TokenizerHandleSkip\n * @type {function}\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] If optional\n * @returns {boolean} Whether the token matched\n * @throws {Error} If the token didn't match and is not optional\n */\n\n/**\n * Gets the comment on the previous line or, alternatively, the line comment on the specified line.\n * @typedef TokenizerHandleCmnt\n * @type {function}\n * @param {number} [line] Line number\n * @returns {string|null} Comment text or `null` if none\n */\n\n/**\n * Handle object returned from {@link tokenize}.\n * @interface ITokenizerHandle\n * @property {TokenizerHandleNext} next Gets the next token and advances (`null` on eof)\n * @property {TokenizerHandlePeek} peek Peeks for the next token (`null` on eof)\n * @property {TokenizerHandlePush} push Pushes a token back to the stack\n * @property {TokenizerHandleSkip} skip Skips a token, returns its presence and advances or, if non-optional and not present, throws\n * @property {TokenizerHandleCmnt} cmnt Gets the comment on the previous line or the line comment on the specified line, if any\n * @property {number} line Current line number\n */\n\n/**\n * Tokenizes the given .proto source and returns an object with useful utility functions.\n * @param {string} source Source contents\n * @param {boolean} alternateCommentMode Whether we should activate alternate comment parsing mode.\n * @returns {ITokenizerHandle} Tokenizer handle\n */\nfunction tokenize(source, alternateCommentMode) {\n /* eslint-disable callback-return */\n source = source.toString();\n\n var offset = 0,\n length = source.length,\n line = 1,\n lastCommentLine = 0,\n comments = {};\n\n var stack = [];\n\n var stringDelim = null;\n\n /* istanbul ignore next */\n /**\n * Creates an error for illegal syntax.\n * @param {string} subject Subject\n * @returns {Error} Error created\n * @inner\n */\n function illegal(subject) {\n return Error(\"illegal \" + subject + \" (line \" + line + \")\");\n }\n\n /**\n * Reads a string till its end.\n * @returns {string} String read\n * @inner\n */\n function readString() {\n var re = stringDelim === \"'\" ? stringSingleRe : stringDoubleRe;\n re.lastIndex = offset - 1;\n var match = re.exec(source);\n if (!match)\n throw illegal(\"string\");\n offset = re.lastIndex;\n push(stringDelim);\n stringDelim = null;\n return unescape(match[1]);\n }\n\n /**\n * Gets the character at `pos` within the source.\n * @param {number} pos Position\n * @returns {string} Character\n * @inner\n */\n function charAt(pos) {\n return source.charAt(pos);\n }\n\n /**\n * Sets the current comment text.\n * @param {number} start Start offset\n * @param {number} end End offset\n * @param {boolean} isLeading set if a leading comment\n * @returns {undefined}\n * @inner\n */\n function setComment(start, end, isLeading) {\n var comment = {\n type: source.charAt(start++),\n lineEmpty: false,\n leading: isLeading,\n };\n var lookback;\n if (alternateCommentMode) {\n lookback = 2; // alternate comment parsing: \"//\" or \"/*\"\n } else {\n lookback = 3; // \"///\" or \"/**\"\n }\n var commentOffset = start - lookback,\n c;\n do {\n if (--commentOffset < 0 ||\n (c = source.charAt(commentOffset)) === \"\\n\") {\n comment.lineEmpty = true;\n break;\n }\n } while (c === \" \" || c === \"\\t\");\n var lines = source\n .substring(start, end)\n .split(setCommentSplitRe);\n for (var i = 0; i < lines.length; ++i)\n lines[i] = lines[i]\n .replace(alternateCommentMode ? setCommentAltRe : setCommentRe, \"\")\n .trim();\n comment.text = lines\n .join(\"\\n\")\n .trim();\n\n comments[line] = comment;\n lastCommentLine = line;\n }\n\n function isDoubleSlashCommentLine(startOffset) {\n var endOffset = findEndOfLine(startOffset);\n\n // see if remaining line matches comment pattern\n var lineText = source.substring(startOffset, endOffset);\n var isComment = /^\\s*\\/\\//.test(lineText);\n return isComment;\n }\n\n function findEndOfLine(cursor) {\n // find end of cursor's line\n var endOffset = cursor;\n while (endOffset < length && charAt(endOffset) !== \"\\n\") {\n endOffset++;\n }\n return endOffset;\n }\n\n /**\n * Obtains the next token.\n * @returns {string|null} Next token or `null` on eof\n * @inner\n */\n function next() {\n if (stack.length > 0)\n return stack.shift();\n if (stringDelim)\n return readString();\n var repeat,\n prev,\n curr,\n start,\n isDoc,\n isLeadingComment = offset === 0;\n do {\n if (offset === length)\n return null;\n repeat = false;\n while (whitespaceRe.test(curr = charAt(offset))) {\n if (curr === \"\\n\") {\n isLeadingComment = true;\n ++line;\n }\n if (++offset === length)\n return null;\n }\n\n if (charAt(offset) === \"/\") {\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n if (charAt(offset) === \"/\") { // Line\n if (!alternateCommentMode) {\n // check for triple-slash comment\n isDoc = charAt(start = offset + 1) === \"/\";\n\n while (charAt(++offset) !== \"\\n\") {\n if (offset === length) {\n return null;\n }\n }\n ++offset;\n if (isDoc) {\n setComment(start, offset - 1, isLeadingComment);\n // Trailing comment cannot not be multi-line,\n // so leading comment state should be reset to handle potential next comments\n isLeadingComment = true;\n }\n ++line;\n repeat = true;\n } else {\n // check for double-slash comments, consolidating consecutive lines\n start = offset;\n isDoc = false;\n if (isDoubleSlashCommentLine(offset - 1)) {\n isDoc = true;\n do {\n offset = findEndOfLine(offset);\n if (offset === length) {\n break;\n }\n offset++;\n if (!isLeadingComment) {\n // Trailing comment cannot not be multi-line\n break;\n }\n } while (isDoubleSlashCommentLine(offset));\n } else {\n offset = Math.min(length, findEndOfLine(offset) + 1);\n }\n if (isDoc) {\n setComment(start, offset, isLeadingComment);\n isLeadingComment = true;\n }\n line++;\n repeat = true;\n }\n } else if ((curr = charAt(offset)) === \"*\") { /* Block */\n // check for /** (regular comment mode) or /* (alternate comment mode)\n start = offset + 1;\n isDoc = alternateCommentMode || charAt(start) === \"*\";\n do {\n if (curr === \"\\n\") {\n ++line;\n }\n if (++offset === length) {\n throw illegal(\"comment\");\n }\n prev = curr;\n curr = charAt(offset);\n } while (prev !== \"*\" || curr !== \"/\");\n ++offset;\n if (isDoc) {\n setComment(start, offset - 2, isLeadingComment);\n isLeadingComment = true;\n }\n repeat = true;\n } else {\n return \"/\";\n }\n }\n } while (repeat);\n\n // offset !== length if we got here\n\n var end = offset;\n delimRe.lastIndex = 0;\n var delim = delimRe.test(charAt(end++));\n if (!delim)\n while (end < length && !delimRe.test(charAt(end)))\n ++end;\n var token = source.substring(offset, offset = end);\n if (token === \"\\\"\" || token === \"'\")\n stringDelim = token;\n return token;\n }\n\n /**\n * Pushes a token back to the stack.\n * @param {string} token Token\n * @returns {undefined}\n * @inner\n */\n function push(token) {\n stack.push(token);\n }\n\n /**\n * Peeks for the next token.\n * @returns {string|null} Token or `null` on eof\n * @inner\n */\n function peek() {\n if (!stack.length) {\n var token = next();\n if (token === null)\n return null;\n push(token);\n }\n return stack[0];\n }\n\n /**\n * Skips a token.\n * @param {string} expected Expected token\n * @param {boolean} [optional=false] Whether the token is optional\n * @returns {boolean} `true` when skipped, `false` if not\n * @throws {Error} When a required token is not present\n * @inner\n */\n function skip(expected, optional) {\n var actual = peek(),\n equals = actual === expected;\n if (equals) {\n next();\n return true;\n }\n if (!optional)\n throw illegal(\"token '\" + actual + \"', '\" + expected + \"' expected\");\n return false;\n }\n\n /**\n * Gets a comment.\n * @param {number} [trailingLine] Line number if looking for a trailing comment\n * @returns {string|null} Comment text\n * @inner\n */\n function cmnt(trailingLine) {\n var ret = null;\n var comment;\n if (trailingLine === undefined) {\n comment = comments[line - 1];\n delete comments[line - 1];\n if (comment && (alternateCommentMode || comment.type === \"*\" || comment.lineEmpty)) {\n ret = comment.leading ? comment.text : null;\n }\n } else {\n /* istanbul ignore else */\n if (lastCommentLine < trailingLine) {\n peek();\n }\n comment = comments[trailingLine];\n delete comments[trailingLine];\n if (comment && !comment.lineEmpty && (alternateCommentMode || comment.type === \"/\")) {\n ret = comment.leading ? null : comment.text;\n }\n }\n return ret;\n }\n\n return Object.defineProperty({\n next: next,\n peek: peek,\n push: push,\n skip: skip,\n cmnt: cmnt\n }, \"line\", {\n get: function() { return line; }\n });\n /* eslint-enable callback-return */\n}\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","\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\tconst split = (typeof namespaces === 'string' ? namespaces : '')\n\t\t\t.trim()\n\t\t\t.replace(' ', ',')\n\t\t\t.split(',')\n\t\t\t.filter(Boolean);\n\n\t\tfor (const ns of split) {\n\t\t\tif (ns[0] === '-') {\n\t\t\t\tcreateDebug.skips.push(ns.slice(1));\n\t\t\t} else {\n\t\t\t\tcreateDebug.names.push(ns);\n\t\t\t}\n\t\t}\n\t}\n\n\t/**\n\t * Checks if the given string matches a namespace template, honoring\n\t * asterisks as wildcards.\n\t *\n\t * @param {String} search\n\t * @param {String} template\n\t * @return {Boolean}\n\t */\n\tfunction matchesTemplate(search, template) {\n\t\tlet searchIndex = 0;\n\t\tlet templateIndex = 0;\n\t\tlet starIndex = -1;\n\t\tlet matchIndex = 0;\n\n\t\twhile (searchIndex < search.length) {\n\t\t\tif (templateIndex < template.length && (template[templateIndex] === search[searchIndex] || template[templateIndex] === '*')) {\n\t\t\t\t// Match character or proceed with wildcard\n\t\t\t\tif (template[templateIndex] === '*') {\n\t\t\t\t\tstarIndex = templateIndex;\n\t\t\t\t\tmatchIndex = searchIndex;\n\t\t\t\t\ttemplateIndex++; // Skip the '*'\n\t\t\t\t} else {\n\t\t\t\t\tsearchIndex++;\n\t\t\t\t\ttemplateIndex++;\n\t\t\t\t}\n\t\t\t} else if (starIndex !== -1) { // eslint-disable-line no-negated-condition\n\t\t\t\t// Backtrack to the last '*' and try to match more characters\n\t\t\t\ttemplateIndex = starIndex + 1;\n\t\t\t\tmatchIndex++;\n\t\t\t\tsearchIndex = matchIndex;\n\t\t\t} else {\n\t\t\t\treturn false; // No match\n\t\t\t}\n\t\t}\n\n\t\t// Handle trailing '*' in template\n\t\twhile (templateIndex < template.length && template[templateIndex] === '*') {\n\t\t\ttemplateIndex++;\n\t\t}\n\n\t\treturn templateIndex === template.length;\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,\n\t\t\t...createDebug.skips.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\tfor (const skip of createDebug.skips) {\n\t\t\tif (matchesTemplate(name, skip)) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\n\t\tfor (const ns of createDebug.names) {\n\t\t\tif (matchesTemplate(name, ns)) {\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* 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 * Runtime message from/to plain object converters.\n * @namespace\n */\nvar converter = exports;\n\nvar Enum = require(\"./enum\"),\n util = require(\"./util\");\n\n/**\n * Generates a partial value fromObject conveter.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} prop Property reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genValuePartial_fromObject(gen, field, fieldIndex, prop) {\n var defaultAlreadyEmitted = false;\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n if (field.resolvedType) {\n if (field.resolvedType instanceof Enum) { gen\n (\"switch(d%s){\", prop);\n for (var values = field.resolvedType.values, keys = Object.keys(values), i = 0; i < keys.length; ++i) {\n // enum unknown values passthrough\n if (values[keys[i]] === field.typeDefault && !defaultAlreadyEmitted) { gen\n (\"default:\")\n (\"if(typeof(d%s)===\\\"number\\\"){m%s=d%s;break}\", prop, prop, prop);\n if (!field.repeated) gen // fallback to default value only for\n // arrays, to avoid leaving holes.\n (\"break\"); // for non-repeated fields, just ignore\n defaultAlreadyEmitted = true;\n }\n gen\n (\"case%j:\", keys[i])\n (\"case %i:\", values[keys[i]])\n (\"m%s=%j\", prop, values[keys[i]])\n (\"break\");\n } gen\n (\"}\");\n } else gen\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\n (\"m%s=types[%i].fromObject(d%s)\", prop, fieldIndex, prop);\n } else {\n var isUnsigned = false;\n switch (field.type) {\n case \"double\":\n case \"float\": gen\n (\"m%s=Number(d%s)\", prop, prop); // also catches \"NaN\", \"Infinity\"\n break;\n case \"uint32\":\n case \"fixed32\": gen\n (\"m%s=d%s>>>0\", prop, prop);\n break;\n case \"int32\":\n case \"sint32\":\n case \"sfixed32\": gen\n (\"m%s=d%s|0\", prop, prop);\n break;\n case \"uint64\":\n isUnsigned = true;\n // eslint-disable-next-line no-fallthrough\n case \"int64\":\n case \"sint64\":\n case \"fixed64\":\n case \"sfixed64\": gen\n (\"if(util.Long)\")\n (\"(m%s=util.Long.fromValue(d%s)).unsigned=%j\", prop, prop, isUnsigned)\n (\"else if(typeof d%s===\\\"string\\\")\", prop)\n (\"m%s=parseInt(d%s,10)\", prop, prop)\n (\"else if(typeof d%s===\\\"number\\\")\", prop)\n (\"m%s=d%s\", prop, prop)\n (\"else if(typeof d%s===\\\"object\\\")\", prop)\n (\"m%s=new util.LongBits(d%s.low>>>0,d%s.high>>>0).toNumber(%s)\", prop, prop, prop, isUnsigned ? \"true\" : \"\");\n break;\n case \"bytes\": gen\n (\"if(typeof d%s===\\\"string\\\")\", prop)\n (\"util.base64.decode(d%s,m%s=util.newBuffer(util.base64.length(d%s)),0)\", prop, prop, prop)\n (\"else if(d%s.length >= 0)\", prop)\n (\"m%s=d%s\", prop, prop);\n break;\n case \"string\": gen\n (\"m%s=String(d%s)\", prop, prop);\n break;\n case \"bool\": gen\n (\"m%s=Boolean(d%s)\", prop, prop);\n break;\n /* default: gen\n (\"m%s=d%s\", prop, prop);\n break; */\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a plain object to runtime message converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.fromObject = function fromObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray;\n var gen = util.codegen([\"d\"], mtype.name + \"$fromObject\")\n (\"if(d instanceof this.ctor)\")\n (\"return d\");\n if (!fields.length) return gen\n (\"return new this.ctor\");\n gen\n (\"var m=new this.ctor\");\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n prop = util.safeProp(field.name);\n\n // Map fields\n if (field.map) { gen\n (\"if(d%s){\", prop)\n (\"if(typeof d%s!==\\\"object\\\")\", prop)\n (\"throw TypeError(%j)\", field.fullName + \": object expected\")\n (\"m%s={}\", prop)\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);\n break;\n case \"bytes\": gen\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);\n break;\n default: gen\n (\"d%s=m%s\", prop, prop);\n break;\n }\n }\n return gen;\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\n}\n\n/**\n * Generates a runtime message to plain object converter specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nconverter.toObject = function toObject(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var fields = mtype.fieldsArray.slice().sort(util.compareFieldsById);\n if (!fields.length)\n return util.codegen()(\"return {}\");\n var gen = util.codegen([\"m\", \"o\"], mtype.name + \"$toObject\")\n (\"if(!o)\")\n (\"o={}\")\n (\"var d={}\");\n\n var repeatedFields = [],\n mapFields = [],\n normalFields = [],\n i = 0;\n for (; i < fields.length; ++i)\n if (!fields[i].partOf)\n ( fields[i].resolve().repeated ? repeatedFields\n : fields[i].map ? mapFields\n : normalFields).push(fields[i]);\n\n if (repeatedFields.length) { gen\n (\"if(o.arrays||o.defaults){\");\n for (i = 0; i < repeatedFields.length; ++i) gen\n (\"d%s=[]\", util.safeProp(repeatedFields[i].name));\n gen\n (\"}\");\n }\n\n if (mapFields.length) { gen\n (\"if(o.objects||o.defaults){\");\n for (i = 0; i < mapFields.length; ++i) gen\n (\"d%s={}\", util.safeProp(mapFields[i].name));\n gen\n (\"}\");\n }\n\n if (normalFields.length) { gen\n (\"if(o.defaults){\");\n for (i = 0; i < normalFields.length; ++i) {\n var field = normalFields[i],\n prop = util.safeProp(field.name);\n if (field.resolvedType instanceof Enum) gen\n (\"d%s=o.enums===String?%j:%j\", prop, field.resolvedType.valuesById[field.typeDefault], field.typeDefault);\n else if (field.long) gen\n (\"if(util.Long){\")\n (\"var n=new util.Long(%i,%i,%j)\", field.typeDefault.low, field.typeDefault.high, field.typeDefault.unsigned)\n (\"d%s=o.longs===String?n.toString():o.longs===Number?n.toNumber():n\", prop)\n (\"}else\")\n (\"d%s=o.longs===String?%j:%i\", prop, field.typeDefault.toString(), field.typeDefault.toNumber());\n else if (field.bytes) {\n var arrayDefault = \"[\" + Array.prototype.slice.call(field.typeDefault).join(\",\") + \"]\";\n gen\n (\"if(o.bytes===String)d%s=%j\", prop, String.fromCharCode.apply(String, field.typeDefault))\n (\"else{\")\n (\"d%s=%s\", prop, arrayDefault)\n (\"if(o.bytes!==Array)d%s=util.newBuffer(d%s)\", prop, prop)\n (\"}\");\n } else gen\n (\"d%s=%j\", prop, field.typeDefault); // also messages (=null)\n } gen\n (\"}\");\n }\n var hasKs2 = false;\n for (i = 0; i < fields.length; ++i) {\n var field = fields[i],\n index = mtype._fieldsArray.indexOf(field),\n prop = util.safeProp(field.name);\n if (field.map) {\n if (!hasKs2) { hasKs2 = true; gen\n (\"var ks2\");\n } gen\n (\"if(m%s&&(ks2=Object.keys(m%s)).length){\", prop, prop)\n (\"d%s={}\", prop)\n (\"for(var j=0;j= 4 where Buffers extend Uint8Array and set is properly inherited)\n // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytesBuffer_copy(val, buf, pos) {\n if (val.copy) // Buffer values\n val.copy(buf, pos, 0, val.length);\n else for (var i = 0; i < val.length;) // plain array values\n buf[pos++] = val[i++];\n };\n};\n\n\n/**\n * @override\n */\nBufferWriter.prototype.bytes = function write_bytes_buffer(value) {\n if (util.isString(value))\n value = util._Buffer_from(value, \"base64\");\n var len = value.length >>> 0;\n this.uint32(len);\n if (len)\n this._push(BufferWriter.writeBytesBuffer, len, value);\n return this;\n};\n\nfunction writeStringBuffer(val, buf, pos) {\n if (val.length < 40) // plain js is faster for short strings (probably due to redundant assertions)\n util.utf8.write(val, buf, pos);\n else if (buf.utf8Write)\n buf.utf8Write(val, pos);\n else\n buf.write(val, pos);\n}\n\n/**\n * @override\n */\nBufferWriter.prototype.string = function write_string_buffer(value) {\n var len = util.Buffer.byteLength(value);\n this.uint32(len);\n if (len)\n this._push(writeStringBuffer, len, value);\n return this;\n};\n\n\n/**\n * Finishes the write operation.\n * @name BufferWriter#finish\n * @function\n * @returns {Buffer} Finished buffer\n */\n\nBufferWriter._configure();\n","\"use strict\";\nmodule.exports = encoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Generates a partial message type encoder.\n * @param {Codegen} gen Codegen instance\n * @param {Field} field Reflected field\n * @param {number} fieldIndex Field index\n * @param {string} ref Variable reference\n * @returns {Codegen} Codegen instance\n * @ignore\n */\nfunction genTypePartial(gen, field, fieldIndex, ref) {\n return field.delimited\n ? gen(\"types[%i].encode(%s,w.uint32(%i)).uint32(%i)\", fieldIndex, ref, (field.id << 3 | 3) >>> 0, (field.id << 3 | 4) >>> 0)\n : gen(\"types[%i].encode(%s,w.uint32(%i).fork()).ldelim()\", fieldIndex, ref, (field.id << 3 | 2) >>> 0);\n}\n\n/**\n * Generates an encoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction encoder(mtype) {\n /* eslint-disable no-unexpected-multiline, block-scoped-var, no-redeclare */\n var gen = util.codegen([\"m\", \"w\"], mtype.name + \"$encode\")\n (\"if(!w)\")\n (\"w=Writer.create()\");\n\n var i, ref;\n\n // \"when a message is serialized its known fields should be written sequentially by field number\"\n var fields = /* initializes */ mtype.fieldsArray.slice().sort(util.compareFieldsById);\n\n for (var i = 0; i < fields.length; ++i) {\n var field = fields[i].resolve(),\n index = mtype._fieldsArray.indexOf(field),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n wireType = types.basic[type];\n ref = \"m\" + util.safeProp(field.name);\n\n // Map fields\n if (field.map) {\n gen\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j)){\", ref, field.name) // !== undefined && !== null\n (\"for(var ks=Object.keys(%s),i=0;i>> 0, 8 | types.mapKey[field.keyType], field.keyType);\n if (wireType === undefined) gen\n (\"types[%i].encode(%s[ks[i]],w.uint32(18).fork()).ldelim().ldelim()\", index, ref); // can't be groups\n else gen\n (\".uint32(%i).%s(%s[ks[i]]).ldelim()\", 16 | wireType, type, ref);\n gen\n (\"}\")\n (\"}\");\n\n // Repeated fields\n } else if (field.repeated) { gen\n (\"if(%s!=null&&%s.length){\", ref, ref); // !== undefined && !== null\n\n // Packed repeated\n if (field.packed && types.packed[type] !== undefined) { gen\n\n (\"w.uint32(%i).fork()\", (field.id << 3 | 2) >>> 0)\n (\"for(var i=0;i<%s.length;++i)\", ref)\n (\"w.%s(%s[i])\", type, ref)\n (\"w.ldelim()\");\n\n // Non-packed\n } else { gen\n\n (\"for(var i=0;i<%s.length;++i)\", ref);\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref + \"[i]\");\n else gen\n (\"w.uint32(%i).%s(%s[i])\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n } gen\n (\"}\");\n\n // Non-repeated\n } else {\n if (field.optional) gen\n (\"if(%s!=null&&Object.hasOwnProperty.call(m,%j))\", ref, field.name); // !== undefined && !== null\n\n if (wireType === undefined)\n genTypePartial(gen, field, index, ref);\n else gen\n (\"w.uint32(%i).%s(%s)\", (field.id << 3 | wireType) >>> 0, type, ref);\n\n }\n }\n\n return gen\n (\"return w\");\n /* eslint-enable no-unexpected-multiline, block-scoped-var, no-redeclare */\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\";\nmodule.exports = Field;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Field.prototype = Object.create(ReflectionObject.prototype)).constructor = Field).className = \"Field\";\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar Type; // cyclic\n\nvar ruleRe = /^required|optional|repeated$/;\n\n/**\n * Constructs a new message field instance. Note that {@link MapField|map fields} have their own class.\n * @name Field\n * @classdesc Reflected message field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a field from a field descriptor.\n * @param {string} name Field name\n * @param {IField} json Field descriptor\n * @returns {Field} Created field\n * @throws {TypeError} If arguments are invalid\n */\nField.fromJSON = function fromJSON(name, json) {\n var field = new Field(name, json.id, json.type, json.rule, json.extend, json.options, json.comment);\n if (json.edition)\n field._edition = json.edition;\n field._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return field;\n};\n\n/**\n * Not an actual constructor. Use {@link Field} instead.\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.\n * @exports FieldBase\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} type Value type\n * @param {string|Object.} [rule=\"optional\"] Field rule\n * @param {string|Object.} [extend] Extended type if different from parent\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction Field(name, id, type, rule, extend, options, comment) {\n\n if (util.isObject(rule)) {\n comment = extend;\n options = rule;\n rule = extend = undefined;\n } else if (util.isObject(extend)) {\n comment = options;\n options = extend;\n extend = undefined;\n }\n\n ReflectionObject.call(this, name, options);\n\n if (!util.isInteger(id) || id < 0)\n throw TypeError(\"id must be a non-negative integer\");\n\n if (!util.isString(type))\n throw TypeError(\"type must be a string\");\n\n if (rule !== undefined && !ruleRe.test(rule = rule.toString().toLowerCase()))\n throw TypeError(\"rule must be a string rule\");\n\n if (extend !== undefined && !util.isString(extend))\n throw TypeError(\"extend must be a string\");\n\n /**\n * Field rule, if any.\n * @type {string|undefined}\n */\n if (rule === \"proto3_optional\") {\n rule = \"optional\";\n }\n this.rule = rule && rule !== \"optional\" ? rule : undefined; // toJSON\n\n /**\n * Field type.\n * @type {string}\n */\n this.type = type; // toJSON\n\n /**\n * Unique field id.\n * @type {number}\n */\n this.id = id; // toJSON, marker\n\n /**\n * Extended type if different from parent.\n * @type {string|undefined}\n */\n this.extend = extend || undefined; // toJSON\n\n /**\n * Whether this field is repeated.\n * @type {boolean}\n */\n this.repeated = rule === \"repeated\";\n\n /**\n * Whether this field is a map or not.\n * @type {boolean}\n */\n this.map = false;\n\n /**\n * Message this field belongs to.\n * @type {Type|null}\n */\n this.message = null;\n\n /**\n * OneOf this field belongs to, if any,\n * @type {OneOf|null}\n */\n this.partOf = null;\n\n /**\n * The field type's default value.\n * @type {*}\n */\n this.typeDefault = null;\n\n /**\n * The field's default value on prototypes.\n * @type {*}\n */\n this.defaultValue = null;\n\n /**\n * Whether this field's value should be treated as a long.\n * @type {boolean}\n */\n this.long = util.Long ? types.long[type] !== undefined : /* istanbul ignore next */ false;\n\n /**\n * Whether this field's value is a buffer.\n * @type {boolean}\n */\n this.bytes = type === \"bytes\";\n\n /**\n * Resolved type if not a basic type.\n * @type {Type|Enum|null}\n */\n this.resolvedType = null;\n\n /**\n * Sister-field within the extended type if a declaring extension field.\n * @type {Field|null}\n */\n this.extensionField = null;\n\n /**\n * Sister-field within the declaring namespace if an extended field.\n * @type {Field|null}\n */\n this.declaringField = null;\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Determines whether this field is required.\n * @name Field#required\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"required\", {\n get: function() {\n return this._features.field_presence === \"LEGACY_REQUIRED\";\n }\n});\n\n/**\n * Determines whether this field is not required.\n * @name Field#optional\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"optional\", {\n get: function() {\n return !this.required;\n }\n});\n\n/**\n * Determines whether this field uses tag-delimited encoding. In proto2 this\n * corresponded to group syntax.\n * @name Field#delimited\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"delimited\", {\n get: function() {\n return this.resolvedType instanceof Type &&\n this._features.message_encoding === \"DELIMITED\";\n }\n});\n\n/**\n * Determines whether this field is packed. Only relevant when repeated.\n * @name Field#packed\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"packed\", {\n get: function() {\n return this._features.repeated_field_encoding === \"PACKED\";\n }\n});\n\n/**\n * Determines whether this field tracks presence.\n * @name Field#hasPresence\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(Field.prototype, \"hasPresence\", {\n get: function() {\n if (this.repeated || this.map) {\n return false;\n }\n return this.partOf || // oneofs\n this.declaringField || this.extensionField || // extensions\n this._features.field_presence !== \"IMPLICIT\";\n }\n});\n\n/**\n * @override\n */\nField.prototype.setOption = function setOption(name, value, ifNotSet) {\n return ReflectionObject.prototype.setOption.call(this, name, value, ifNotSet);\n};\n\n/**\n * Field descriptor.\n * @interface IField\n * @property {string} [rule=\"optional\"] Field rule\n * @property {string} type Field type\n * @property {number} id Field id\n * @property {Object.} [options] Field options\n */\n\n/**\n * Extension field descriptor.\n * @interface IExtensionField\n * @extends IField\n * @property {string} extend Extended type\n */\n\n/**\n * Converts this field to a field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IField} Field descriptor\n */\nField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"rule\" , this.rule !== \"optional\" && this.rule || undefined,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Resolves this field's type references.\n * @returns {Field} `this`\n * @throws {Error} If any reference cannot be resolved\n */\nField.prototype.resolve = function resolve() {\n\n if (this.resolved)\n return this;\n\n if ((this.typeDefault = types.defaults[this.type]) === undefined) { // if not a basic type, resolve it\n this.resolvedType = (this.declaringField ? this.declaringField.parent : this.parent).lookupTypeOrEnum(this.type);\n if (this.resolvedType instanceof Type)\n this.typeDefault = null;\n else // instanceof Enum\n this.typeDefault = this.resolvedType.values[Object.keys(this.resolvedType.values)[0]]; // first defined\n } else if (this.options && this.options.proto3_optional) {\n // proto3 scalar value marked optional; should default to null\n this.typeDefault = null;\n }\n\n // use explicitly set default value if present\n if (this.options && this.options[\"default\"] != null) {\n this.typeDefault = this.options[\"default\"];\n if (this.resolvedType instanceof Enum && typeof this.typeDefault === \"string\")\n this.typeDefault = this.resolvedType.values[this.typeDefault];\n }\n\n // remove unnecessary options\n if (this.options) {\n if (this.options.packed !== undefined && this.resolvedType && !(this.resolvedType instanceof Enum))\n delete this.options.packed;\n if (!Object.keys(this.options).length)\n this.options = undefined;\n }\n\n // convert to internal data type if necesssary\n if (this.long) {\n this.typeDefault = util.Long.fromNumber(this.typeDefault, this.type.charAt(0) === \"u\");\n\n /* istanbul ignore else */\n if (Object.freeze)\n Object.freeze(this.typeDefault); // long instances are meant to be immutable anyway (i.e. use small int cache that even requires it)\n\n } else if (this.bytes && typeof this.typeDefault === \"string\") {\n var buf;\n if (util.base64.test(this.typeDefault))\n util.base64.decode(this.typeDefault, buf = util.newBuffer(util.base64.length(this.typeDefault)), 0);\n else\n util.utf8.write(this.typeDefault, buf = util.newBuffer(util.utf8.length(this.typeDefault)), 0);\n this.typeDefault = buf;\n }\n\n // take special care of maps and repeated fields\n if (this.map)\n this.defaultValue = util.emptyObject;\n else if (this.repeated)\n this.defaultValue = util.emptyArray;\n else\n this.defaultValue = this.typeDefault;\n\n // ensure proper value on prototype\n if (this.parent instanceof Type)\n this.parent.ctor.prototype[this.name] = this.defaultValue;\n\n return ReflectionObject.prototype.resolve.call(this);\n};\n\n/**\n * Infers field features from legacy syntax that may have been specified differently.\n * in older editions.\n * @param {string|undefined} edition The edition this proto is on, or undefined if pre-editions\n * @returns {object} The feature values to override\n */\nField.prototype._inferLegacyProtoFeatures = function _inferLegacyProtoFeatures(edition) {\n if (edition !== \"proto2\" && edition !== \"proto3\") {\n return {};\n }\n\n var features = {};\n this.resolve();\n if (this.rule === \"required\") {\n features.field_presence = \"LEGACY_REQUIRED\";\n }\n if (this.resolvedType instanceof Type && this.resolvedType.group) {\n features.message_encoding = \"DELIMITED\";\n }\n if (this.getOption(\"packed\") === true) {\n features.repeated_field_encoding = \"PACKED\";\n } else if (this.getOption(\"packed\") === false) {\n features.repeated_field_encoding = \"EXPANDED\";\n }\n return features;\n};\n\n/**\n * @override\n */\nField.prototype._resolveFeatures = function _resolveFeatures(edition) {\n return ReflectionObject.prototype._resolveFeatures.call(this, this._edition || edition);\n};\n\n/**\n * Decorator function as returned by {@link Field.d} and {@link MapField.d} (TypeScript).\n * @typedef FieldDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} fieldName Field name\n * @returns {undefined}\n */\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"string\"|\"bool\"|\"bytes\"|Object} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @param {T} [defaultValue] Default value\n * @returns {FieldDecorator} Decorator function\n * @template T extends number | number[] | Long | Long[] | string | string[] | boolean | boolean[] | Uint8Array | Uint8Array[] | Buffer | Buffer[]\n */\nField.d = function decorateField(fieldId, fieldType, fieldRule, defaultValue) {\n\n // submessage: decorate the submessage and use its name as the type\n if (typeof fieldType === \"function\")\n fieldType = util.decorateType(fieldType).name;\n\n // enum reference: create a reflected copy of the enum and keep reuseing it\n else if (fieldType && typeof fieldType === \"object\")\n fieldType = util.decorateEnum(fieldType).name;\n\n return function fieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new Field(fieldName, fieldId, fieldType, fieldRule, { \"default\": defaultValue }));\n };\n};\n\n/**\n * Field decorator (TypeScript).\n * @name Field.d\n * @function\n * @param {number} fieldId Field id\n * @param {Constructor|string} fieldType Field type\n * @param {\"optional\"|\"required\"|\"repeated\"} [fieldRule=\"optional\"] Field rule\n * @returns {FieldDecorator} Decorator function\n * @template T extends Message\n * @variation 2\n */\n// like Field.d but without a default value\n\n// Sets up cyclic dependencies (called in index-light)\nField._configure = function configure(Type_) {\n Type = Type_;\n};\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","\"use strict\";\nmodule.exports = OneOf;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((OneOf.prototype = Object.create(ReflectionObject.prototype)).constructor = OneOf).className = \"OneOf\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new oneof instance.\n * @classdesc Reflected oneof.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Oneof name\n * @param {string[]|Object.} [fieldNames] Field names\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction OneOf(name, fieldNames, options, comment) {\n if (!Array.isArray(fieldNames)) {\n options = fieldNames;\n fieldNames = undefined;\n }\n ReflectionObject.call(this, name, options);\n\n /* istanbul ignore if */\n if (!(fieldNames === undefined || Array.isArray(fieldNames)))\n throw TypeError(\"fieldNames must be an Array\");\n\n /**\n * Field names that belong to this oneof.\n * @type {string[]}\n */\n this.oneof = fieldNames || []; // toJSON, marker\n\n /**\n * Fields that belong to this oneof as an array for iteration.\n * @type {Field[]}\n * @readonly\n */\n this.fieldsArray = []; // declared readonly for conformance, possibly not yet added to parent\n\n /**\n * Comment for this field.\n * @type {string|null}\n */\n this.comment = comment;\n}\n\n/**\n * Oneof descriptor.\n * @interface IOneOf\n * @property {Array.} oneof Oneof field names\n * @property {Object.} [options] Oneof options\n */\n\n/**\n * Constructs a oneof from a oneof descriptor.\n * @param {string} name Oneof name\n * @param {IOneOf} json Oneof descriptor\n * @returns {OneOf} Created oneof\n * @throws {TypeError} If arguments are invalid\n */\nOneOf.fromJSON = function fromJSON(name, json) {\n return new OneOf(name, json.oneof, json.options, json.comment);\n};\n\n/**\n * Converts this oneof to a oneof descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IOneOf} Oneof descriptor\n */\nOneOf.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"options\" , this.options,\n \"oneof\" , this.oneof,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Adds the fields of the specified oneof to the parent if not already done so.\n * @param {OneOf} oneof The oneof\n * @returns {undefined}\n * @inner\n * @ignore\n */\nfunction addFieldsToParent(oneof) {\n if (oneof.parent)\n for (var i = 0; i < oneof.fieldsArray.length; ++i)\n if (!oneof.fieldsArray[i].parent)\n oneof.parent.add(oneof.fieldsArray[i]);\n}\n\n/**\n * Adds a field to this oneof and removes it from its current parent, if any.\n * @param {Field} field Field to add\n * @returns {OneOf} `this`\n */\nOneOf.prototype.add = function add(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n if (field.parent && field.parent !== this.parent)\n field.parent.remove(field);\n this.oneof.push(field.name);\n this.fieldsArray.push(field);\n field.partOf = this; // field.parent remains null\n addFieldsToParent(this);\n return this;\n};\n\n/**\n * Removes a field from this oneof and puts it back to the oneof's parent.\n * @param {Field} field Field to remove\n * @returns {OneOf} `this`\n */\nOneOf.prototype.remove = function remove(field) {\n\n /* istanbul ignore if */\n if (!(field instanceof Field))\n throw TypeError(\"field must be a Field\");\n\n var index = this.fieldsArray.indexOf(field);\n\n /* istanbul ignore if */\n if (index < 0)\n throw Error(field + \" is not a member of \" + this);\n\n this.fieldsArray.splice(index, 1);\n index = this.oneof.indexOf(field.name);\n\n /* istanbul ignore else */\n if (index > -1) // theoretical\n this.oneof.splice(index, 1);\n\n field.partOf = null;\n return this;\n};\n\n/**\n * @override\n */\nOneOf.prototype.onAdd = function onAdd(parent) {\n ReflectionObject.prototype.onAdd.call(this, parent);\n var self = this;\n // Collect present fields\n for (var i = 0; i < this.oneof.length; ++i) {\n var field = parent.get(this.oneof[i]);\n if (field && !field.partOf) {\n field.partOf = self;\n self.fieldsArray.push(field);\n }\n }\n // Add not yet present fields\n addFieldsToParent(this);\n};\n\n/**\n * @override\n */\nOneOf.prototype.onRemove = function onRemove(parent) {\n for (var i = 0, field; i < this.fieldsArray.length; ++i)\n if ((field = this.fieldsArray[i]).parent)\n field.parent.remove(field);\n ReflectionObject.prototype.onRemove.call(this, parent);\n};\n\n/**\n * Determines whether this field corresponds to a synthetic oneof created for\n * a proto3 optional field. No behavioral logic should depend on this, but it\n * can be relevant for reflection.\n * @name OneOf#isProto3Optional\n * @type {boolean}\n * @readonly\n */\nObject.defineProperty(OneOf.prototype, \"isProto3Optional\", {\n get: function() {\n if (this.fieldsArray == null || this.fieldsArray.length !== 1) {\n return false;\n }\n\n var field = this.fieldsArray[0];\n return field.options != null && field.options[\"proto3_optional\"] === true;\n }\n});\n\n/**\n * Decorator function as returned by {@link OneOf.d} (TypeScript).\n * @typedef OneOfDecorator\n * @type {function}\n * @param {Object} prototype Target prototype\n * @param {string} oneofName OneOf name\n * @returns {undefined}\n */\n\n/**\n * OneOf decorator (TypeScript).\n * @function\n * @param {...string} fieldNames Field names\n * @returns {OneOfDecorator} Decorator function\n * @template T extends string\n */\nOneOf.d = function decorateOneOf() {\n var fieldNames = new Array(arguments.length),\n index = 0;\n while (index < arguments.length)\n fieldNames[index] = arguments[index++];\n return function oneOfDecorator(prototype, oneofName) {\n util.decorateType(prototype.constructor)\n .add(new OneOf(oneofName, fieldNames));\n Object.defineProperty(prototype, oneofName, {\n get: util.oneOfGetter(fieldNames),\n set: util.oneOfSetter(fieldNames)\n });\n };\n};\n","\"use strict\";\nmodule.exports = LongBits;\n\nvar util = require(\"../util/minimal\");\n\n/**\n * Constructs new long bits.\n * @classdesc Helper class for working with the low and high bits of a 64 bit value.\n * @memberof util\n * @constructor\n * @param {number} lo Low 32 bits, unsigned\n * @param {number} hi High 32 bits, unsigned\n */\nfunction LongBits(lo, hi) {\n\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 /**\n * Low bits.\n * @type {number}\n */\n this.lo = lo >>> 0;\n\n /**\n * High bits.\n * @type {number}\n */\n this.hi = hi >>> 0;\n}\n\n/**\n * Zero bits.\n * @memberof util.LongBits\n * @type {util.LongBits}\n */\nvar zero = LongBits.zero = new LongBits(0, 0);\n\nzero.toNumber = function() { return 0; };\nzero.zzEncode = zero.zzDecode = function() { return this; };\nzero.length = function() { return 1; };\n\n/**\n * Zero hash.\n * @memberof util.LongBits\n * @type {string}\n */\nvar zeroHash = LongBits.zeroHash = \"\\0\\0\\0\\0\\0\\0\\0\\0\";\n\n/**\n * Constructs new long bits from the specified number.\n * @param {number} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.fromNumber = function fromNumber(value) {\n if (value === 0)\n return zero;\n var sign = value < 0;\n if (sign)\n value = -value;\n var lo = value >>> 0,\n 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 return new LongBits(lo, hi);\n};\n\n/**\n * Constructs new long bits from a number, long or string.\n * @param {Long|number|string} value Value\n * @returns {util.LongBits} Instance\n */\nLongBits.from = function from(value) {\n if (typeof value === \"number\")\n return LongBits.fromNumber(value);\n if (util.isString(value)) {\n /* istanbul ignore else */\n if (util.Long)\n value = util.Long.fromString(value);\n else\n return LongBits.fromNumber(parseInt(value, 10));\n }\n return value.low || value.high ? new LongBits(value.low >>> 0, value.high >>> 0) : zero;\n};\n\n/**\n * Converts this long bits to a possibly unsafe JavaScript number.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {number} Possibly unsafe number\n */\nLongBits.prototype.toNumber = function toNumber(unsigned) {\n if (!unsigned && this.hi >>> 31) {\n var lo = ~this.lo + 1 >>> 0,\n hi = ~this.hi >>> 0;\n if (!lo)\n hi = hi + 1 >>> 0;\n return -(lo + hi * 4294967296);\n }\n return this.lo + this.hi * 4294967296;\n};\n\n/**\n * Converts this long bits to a long.\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long} Long\n */\nLongBits.prototype.toLong = function toLong(unsigned) {\n return util.Long\n ? new util.Long(this.lo | 0, this.hi | 0, Boolean(unsigned))\n /* istanbul ignore next */\n : { low: this.lo | 0, high: this.hi | 0, unsigned: Boolean(unsigned) };\n};\n\nvar charCodeAt = String.prototype.charCodeAt;\n\n/**\n * Constructs new long bits from the specified 8 characters long hash.\n * @param {string} hash Hash\n * @returns {util.LongBits} Bits\n */\nLongBits.fromHash = function fromHash(hash) {\n if (hash === zeroHash)\n return zero;\n return new LongBits(\n ( charCodeAt.call(hash, 0)\n | charCodeAt.call(hash, 1) << 8\n | charCodeAt.call(hash, 2) << 16\n | charCodeAt.call(hash, 3) << 24) >>> 0\n ,\n ( charCodeAt.call(hash, 4)\n | charCodeAt.call(hash, 5) << 8\n | charCodeAt.call(hash, 6) << 16\n | charCodeAt.call(hash, 7) << 24) >>> 0\n );\n};\n\n/**\n * Converts this long bits to a 8 characters long hash.\n * @returns {string} Hash\n */\nLongBits.prototype.toHash = function toHash() {\n return String.fromCharCode(\n this.lo & 255,\n this.lo >>> 8 & 255,\n this.lo >>> 16 & 255,\n this.lo >>> 24 ,\n this.hi & 255,\n this.hi >>> 8 & 255,\n this.hi >>> 16 & 255,\n this.hi >>> 24\n );\n};\n\n/**\n * Zig-zag encodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzEncode = function zzEncode() {\n var 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/**\n * Zig-zag decodes this long bits.\n * @returns {util.LongBits} `this`\n */\nLongBits.prototype.zzDecode = function zzDecode() {\n var 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/**\n * Calculates the length of this longbits when encoded as a varint.\n * @returns {number} Length\n */\nLongBits.prototype.length = function length() {\n var part0 = this.lo,\n part1 = (this.lo >>> 28 | this.hi << 4) >>> 0,\n 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","// full library entry point.\n\n\"use strict\";\nmodule.exports = require(\"./src/index\");\n","\"use strict\";\nmodule.exports = Message;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new message instance.\n * @classdesc Abstract runtime message.\n * @constructor\n * @param {Properties} [properties] Properties to set\n * @template T extends object = object\n */\nfunction Message(properties) {\n // not used internally\n if (properties)\n for (var keys = Object.keys(properties), i = 0; i < keys.length; ++i)\n this[keys[i]] = properties[keys[i]];\n}\n\n/**\n * Reference to the reflected type.\n * @name Message.$type\n * @type {Type}\n * @readonly\n */\n\n/**\n * Reference to the reflected type.\n * @name Message#$type\n * @type {Type}\n * @readonly\n */\n\n/*eslint-disable valid-jsdoc*/\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.create = function create(properties) {\n return this.$type.create(properties);\n};\n\n/**\n * Encodes a message of this type.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encode = function encode(message, writer) {\n return this.$type.encode(message, writer);\n};\n\n/**\n * Encodes a message of this type preceeded by its length as a varint.\n * @param {T|Object.} message Message to encode\n * @param {Writer} [writer] Writer to use\n * @returns {Writer} Writer\n * @template T extends Message\n * @this Constructor\n */\nMessage.encodeDelimited = function encodeDelimited(message, writer) {\n return this.$type.encodeDelimited(message, writer);\n};\n\n/**\n * Decodes a message of this type.\n * @name Message.decode\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decode = function decode(reader) {\n return this.$type.decode(reader);\n};\n\n/**\n * Decodes a message of this type preceeded by its length as a varint.\n * @name Message.decodeDelimited\n * @function\n * @param {Reader|Uint8Array} reader Reader or buffer to decode\n * @returns {T} Decoded message\n * @template T extends Message\n * @this Constructor\n */\nMessage.decodeDelimited = function decodeDelimited(reader) {\n return this.$type.decodeDelimited(reader);\n};\n\n/**\n * Verifies a message of this type.\n * @name Message.verify\n * @function\n * @param {Object.} message Plain object to verify\n * @returns {string|null} `null` if valid, otherwise the reason why it is not\n */\nMessage.verify = function verify(message) {\n return this.$type.verify(message);\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object\n * @returns {T} Message instance\n * @template T extends Message\n * @this Constructor\n */\nMessage.fromObject = function fromObject(object) {\n return this.$type.fromObject(object);\n};\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {T} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @template T extends Message\n * @this Constructor\n */\nMessage.toObject = function toObject(message, options) {\n return this.$type.toObject(message, options);\n};\n\n/**\n * Converts this message to JSON.\n * @returns {Object.} JSON object\n */\nMessage.prototype.toJSON = function toJSON() {\n return this.$type.toObject(this, util.toJSONOptions);\n};\n\n/*eslint-enable valid-jsdoc*/","\"use strict\";\nmodule.exports = BufferReader;\n\n// extends Reader\nvar Reader = require(\"./reader\");\n(BufferReader.prototype = Object.create(Reader.prototype)).constructor = BufferReader;\n\nvar util = require(\"./util/minimal\");\n\n/**\n * Constructs a new buffer reader instance.\n * @classdesc Wire format reader using node buffers.\n * @extends Reader\n * @constructor\n * @param {Buffer} buffer Buffer to read from\n */\nfunction BufferReader(buffer) {\n Reader.call(this, buffer);\n\n /**\n * Read buffer.\n * @name BufferReader#buf\n * @type {Buffer}\n */\n}\n\nBufferReader._configure = function () {\n /* istanbul ignore else */\n if (util.Buffer)\n BufferReader.prototype._slice = util.Buffer.prototype.slice;\n};\n\n\n/**\n * @override\n */\nBufferReader.prototype.string = function read_string_buffer() {\n var len = this.uint32(); // modifies pos\n return this.buf.utf8Slice\n ? this.buf.utf8Slice(this.pos, this.pos = Math.min(this.pos + len, this.len))\n : this.buf.toString(\"utf-8\", this.pos, this.pos = Math.min(this.pos + len, this.len));\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @name BufferReader#bytes\n * @function\n * @returns {Buffer} Value read\n */\n\nBufferReader._configure();\n","\"use strict\";\n\n/**\n * Various utility functions.\n * @namespace\n */\nvar util = module.exports = require(\"./util/minimal\");\n\nvar roots = require(\"./roots\");\n\nvar Type, // cyclic\n Enum;\n\nutil.codegen = require(\"@protobufjs/codegen\");\nutil.fetch = require(\"@protobufjs/fetch\");\nutil.path = require(\"@protobufjs/path\");\n\n/**\n * Node's fs module if available.\n * @type {Object.}\n */\nutil.fs = util.inquire(\"fs\");\n\n/**\n * Converts an object's values to an array.\n * @param {Object.} object Object to convert\n * @returns {Array.<*>} Converted array\n */\nutil.toArray = function toArray(object) {\n if (object) {\n var keys = Object.keys(object),\n array = new Array(keys.length),\n index = 0;\n while (index < keys.length)\n array[index] = object[keys[index++]];\n return array;\n }\n return [];\n};\n\n/**\n * Converts an array of keys immediately followed by their respective value to an object, omitting undefined values.\n * @param {Array.<*>} array Array to convert\n * @returns {Object.} Converted object\n */\nutil.toObject = function toObject(array) {\n var object = {},\n index = 0;\n while (index < array.length) {\n var key = array[index++],\n val = array[index++];\n if (val !== undefined)\n object[key] = val;\n }\n return object;\n};\n\nvar safePropBackslashRe = /\\\\/g,\n safePropQuoteRe = /\"/g;\n\n/**\n * Tests whether the specified name is a reserved word in JS.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nutil.isReserved = function isReserved(name) {\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);\n};\n\n/**\n * Returns a safe property accessor for the specified property name.\n * @param {string} prop Property name\n * @returns {string} Safe accessor\n */\nutil.safeProp = function safeProp(prop) {\n if (!/^[$\\w_]+$/.test(prop) || util.isReserved(prop))\n return \"[\\\"\" + prop.replace(safePropBackslashRe, \"\\\\\\\\\").replace(safePropQuoteRe, \"\\\\\\\"\") + \"\\\"]\";\n return \".\" + prop;\n};\n\n/**\n * Converts the first character of a string to upper case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.ucFirst = function ucFirst(str) {\n return str.charAt(0).toUpperCase() + str.substring(1);\n};\n\nvar camelCaseRe = /_([a-z])/g;\n\n/**\n * Converts a string to camel case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.camelCase = function camelCase(str) {\n return str.substring(0, 1)\n + str.substring(1)\n .replace(camelCaseRe, function($0, $1) { return $1.toUpperCase(); });\n};\n\n/**\n * Compares reflected fields by id.\n * @param {Field} a First field\n * @param {Field} b Second field\n * @returns {number} Comparison value\n */\nutil.compareFieldsById = function compareFieldsById(a, b) {\n return a.id - b.id;\n};\n\n/**\n * Decorator helper for types (TypeScript).\n * @param {Constructor} ctor Constructor function\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {Type} Reflected type\n * @template T extends Message\n * @property {Root} root Decorators root\n */\nutil.decorateType = function decorateType(ctor, typeName) {\n\n /* istanbul ignore if */\n if (ctor.$type) {\n if (typeName && ctor.$type.name !== typeName) {\n util.decorateRoot.remove(ctor.$type);\n ctor.$type.name = typeName;\n util.decorateRoot.add(ctor.$type);\n }\n return ctor.$type;\n }\n\n /* istanbul ignore next */\n if (!Type)\n Type = require(\"./type\");\n\n var type = new Type(typeName || ctor.name);\n util.decorateRoot.add(type);\n type.ctor = ctor; // sets up .encode, .decode etc.\n Object.defineProperty(ctor, \"$type\", { value: type, enumerable: false });\n Object.defineProperty(ctor.prototype, \"$type\", { value: type, enumerable: false });\n return type;\n};\n\nvar decorateEnumIndex = 0;\n\n/**\n * Decorator helper for enums (TypeScript).\n * @param {Object} object Enum object\n * @returns {Enum} Reflected enum\n */\nutil.decorateEnum = function decorateEnum(object) {\n\n /* istanbul ignore if */\n if (object.$type)\n return object.$type;\n\n /* istanbul ignore next */\n if (!Enum)\n Enum = require(\"./enum\");\n\n var enm = new Enum(\"Enum\" + decorateEnumIndex++, object);\n util.decorateRoot.add(enm);\n Object.defineProperty(object, \"$type\", { value: enm, enumerable: false });\n return enm;\n};\n\n\n/**\n * Sets the value of a property by property path. If a value already exists, it is turned to an array\n * @param {Object.} dst Destination object\n * @param {string} path dot '.' delimited path of the property to set\n * @param {Object} value the value to set\n * @param {boolean|undefined} [ifNotSet] Sets the option only if it isn't currently set\n * @returns {Object.} Destination object\n */\nutil.setProperty = function setProperty(dst, path, value, ifNotSet) {\n function setProp(dst, path, value) {\n var part = path.shift();\n if (part === \"__proto__\" || part === \"prototype\") {\n return dst;\n }\n if (path.length > 0) {\n dst[part] = setProp(dst[part] || {}, path, value);\n } else {\n var prevValue = dst[part];\n if (prevValue && ifNotSet)\n return dst;\n if (prevValue)\n value = [].concat(prevValue).concat(value);\n dst[part] = value;\n }\n return dst;\n }\n\n if (typeof dst !== \"object\")\n throw TypeError(\"dst must be an object\");\n if (!path)\n throw TypeError(\"path must be specified\");\n\n path = path.split(\".\");\n return setProp(dst, path, value);\n};\n\n/**\n * Decorator root (TypeScript).\n * @name util.decorateRoot\n * @type {Root}\n * @readonly\n */\nObject.defineProperty(util, \"decorateRoot\", {\n get: function() {\n return roots[\"decorated\"] || (roots[\"decorated\"] = new (require(\"./root\"))());\n }\n});\n","\"use strict\";\nmodule.exports = Writer;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferWriter; // cyclic\n\nvar LongBits = util.LongBits,\n base64 = util.base64,\n utf8 = util.utf8;\n\n/**\n * Constructs a new writer operation instance.\n * @classdesc Scheduled writer operation.\n * @constructor\n * @param {function(*, Uint8Array, number)} fn Function to call\n * @param {number} len Value byte length\n * @param {*} val Value to write\n * @ignore\n */\nfunction Op(fn, len, val) {\n\n /**\n * Function to call.\n * @type {function(Uint8Array, number, *)}\n */\n this.fn = fn;\n\n /**\n * Value byte length.\n * @type {number}\n */\n this.len = len;\n\n /**\n * Next operation.\n * @type {Writer.Op|undefined}\n */\n this.next = undefined;\n\n /**\n * Value to write.\n * @type {*}\n */\n this.val = val; // type varies\n}\n\n/* istanbul ignore next */\nfunction noop() {} // eslint-disable-line no-empty-function\n\n/**\n * Constructs a new writer state instance.\n * @classdesc Copied writer state.\n * @memberof Writer\n * @constructor\n * @param {Writer} writer Writer to copy state from\n * @ignore\n */\nfunction State(writer) {\n\n /**\n * Current head.\n * @type {Writer.Op}\n */\n this.head = writer.head;\n\n /**\n * Current tail.\n * @type {Writer.Op}\n */\n this.tail = writer.tail;\n\n /**\n * Current buffer length.\n * @type {number}\n */\n this.len = writer.len;\n\n /**\n * Next state.\n * @type {State|null}\n */\n this.next = writer.states;\n}\n\n/**\n * Constructs a new writer instance.\n * @classdesc Wire format writer using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n */\nfunction Writer() {\n\n /**\n * Current length.\n * @type {number}\n */\n this.len = 0;\n\n /**\n * Operations head.\n * @type {Object}\n */\n this.head = new Op(noop, 0, 0);\n\n /**\n * Operations tail\n * @type {Object}\n */\n this.tail = this.head;\n\n /**\n * Linked forked states.\n * @type {Object|null}\n */\n this.states = null;\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}\n\nvar create = function create() {\n return util.Buffer\n ? function create_buffer_setup() {\n return (Writer.create = function create_buffer() {\n return new BufferWriter();\n })();\n }\n /* istanbul ignore next */\n : function create_array() {\n return new Writer();\n };\n};\n\n/**\n * Creates a new writer.\n * @function\n * @returns {BufferWriter|Writer} A {@link BufferWriter} when Buffers are supported, otherwise a {@link Writer}\n */\nWriter.create = create();\n\n/**\n * Allocates a buffer of the specified size.\n * @param {number} size Buffer size\n * @returns {Uint8Array} Buffer\n */\nWriter.alloc = function alloc(size) {\n return new util.Array(size);\n};\n\n// Use Uint8Array buffer pool in the browser, just like node does with buffers\n/* istanbul ignore else */\nif (util.Array !== Array)\n Writer.alloc = util.pool(Writer.alloc, util.Array.prototype.subarray);\n\n/**\n * Pushes a new operation to the queue.\n * @param {function(Uint8Array, number, *)} fn Function to call\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @returns {Writer} `this`\n * @private\n */\nWriter.prototype._push = function push(fn, len, val) {\n this.tail = this.tail.next = new Op(fn, len, val);\n this.len += len;\n return this;\n};\n\nfunction writeByte(val, buf, pos) {\n buf[pos] = val & 255;\n}\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/**\n * Constructs a new varint writer operation instance.\n * @classdesc Scheduled varint writer operation.\n * @extends Op\n * @constructor\n * @param {number} len Value byte length\n * @param {number} val Value to write\n * @ignore\n */\nfunction VarintOp(len, val) {\n this.len = len;\n this.next = undefined;\n this.val = val;\n}\n\nVarintOp.prototype = Object.create(Op.prototype);\nVarintOp.prototype.fn = writeVarint32;\n\n/**\n * Writes an unsigned 32 bit value as a varint.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.uint32 = function write_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(\n (value = value >>> 0)\n < 128 ? 1\n : value < 16384 ? 2\n : value < 2097152 ? 3\n : value < 268435456 ? 4\n : 5,\n value)).len;\n return this;\n};\n\n/**\n * Writes a signed 32 bit value as a varint.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.int32 = function write_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/**\n * Writes a 32 bit value as a varint, zig-zag encoded.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sint32 = function write_sint32(value) {\n return this.uint32((value << 1 ^ value >> 31) >>> 0);\n};\n\nfunction writeVarint64(val, buf, pos) {\n while (val.hi) {\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}\n\n/**\n * Writes an unsigned 64 bit value as a varint.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.uint64 = function write_uint64(value) {\n var bits = LongBits.from(value);\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a signed 64 bit value as a varint.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.int64 = Writer.prototype.uint64;\n\n/**\n * Writes a signed 64 bit value as a varint, zig-zag encoded.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sint64 = function write_sint64(value) {\n var bits = LongBits.from(value).zzEncode();\n return this._push(writeVarint64, bits.length(), bits);\n};\n\n/**\n * Writes a boolish value as a varint.\n * @param {boolean} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bool = function write_bool(value) {\n return this._push(writeByte, 1, value ? 1 : 0);\n};\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}\n\n/**\n * Writes an unsigned 32 bit value as fixed 32 bits.\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.fixed32 = function write_fixed32(value) {\n return this._push(writeFixed32, 4, value >>> 0);\n};\n\n/**\n * Writes a signed 32 bit value as fixed 32 bits.\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.sfixed32 = Writer.prototype.fixed32;\n\n/**\n * Writes an unsigned 64 bit value as fixed 64 bits.\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.fixed64 = function write_fixed64(value) {\n var bits = LongBits.from(value);\n return this._push(writeFixed32, 4, bits.lo)._push(writeFixed32, 4, bits.hi);\n};\n\n/**\n * Writes a signed 64 bit value as fixed 64 bits.\n * @function\n * @param {Long|number|string} value Value to write\n * @returns {Writer} `this`\n * @throws {TypeError} If `value` is a string and no long library is present.\n */\nWriter.prototype.sfixed64 = Writer.prototype.fixed64;\n\n/**\n * Writes a float (32 bit).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.float = function write_float(value) {\n return this._push(util.float.writeFloatLE, 4, value);\n};\n\n/**\n * Writes a double (64 bit float).\n * @function\n * @param {number} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.double = function write_double(value) {\n return this._push(util.float.writeDoubleLE, 8, value);\n};\n\nvar writeBytes = util.Array.prototype.set\n ? function writeBytes_set(val, buf, pos) {\n buf.set(val, pos); // also works for plain array values\n }\n /* istanbul ignore next */\n : function writeBytes_for(val, buf, pos) {\n for (var i = 0; i < val.length; ++i)\n buf[pos + i] = val[i];\n };\n\n/**\n * Writes a sequence of bytes.\n * @param {Uint8Array|string} value Buffer or base64 encoded string to write\n * @returns {Writer} `this`\n */\nWriter.prototype.bytes = function write_bytes(value) {\n var len = value.length >>> 0;\n if (!len)\n return this._push(writeByte, 1, 0);\n if (util.isString(value)) {\n var buf = Writer.alloc(len = base64.length(value));\n base64.decode(value, buf, 0);\n value = buf;\n }\n return this.uint32(len)._push(writeBytes, len, value);\n};\n\n/**\n * Writes a string.\n * @param {string} value Value to write\n * @returns {Writer} `this`\n */\nWriter.prototype.string = function write_string(value) {\n var len = utf8.length(value);\n return len\n ? this.uint32(len)._push(utf8.write, len, value)\n : this._push(writeByte, 1, 0);\n};\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 * @returns {Writer} `this`\n */\nWriter.prototype.fork = function 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/**\n * Resets this instance to the last state.\n * @returns {Writer} `this`\n */\nWriter.prototype.reset = function reset() {\n if (this.states) {\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 } else {\n this.head = this.tail = new Op(noop, 0, 0);\n this.len = 0;\n }\n return this;\n};\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 * @returns {Writer} `this`\n */\nWriter.prototype.ldelim = function ldelim() {\n var head = this.head,\n tail = this.tail,\n len = this.len;\n this.reset().uint32(len);\n if (len) {\n this.tail.next = head.next; // skip noop\n this.tail = tail;\n this.len += len;\n }\n return this;\n};\n\n/**\n * Finishes the write operation.\n * @returns {Uint8Array} Finished buffer\n */\nWriter.prototype.finish = function finish() {\n var head = this.head.next, // skip noop\n buf = this.constructor.alloc(this.len),\n pos = 0;\n while (head) {\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\nWriter._configure = function(BufferWriter_) {\n BufferWriter = BufferWriter_;\n Writer.create = create();\n BufferWriter._configure();\n};\n","\"use strict\";\nvar util = exports;\n\n// used to return a Promise where callback is omitted\nutil.asPromise = require(\"@protobufjs/aspromise\");\n\n// converts to / from base64 encoded strings\nutil.base64 = require(\"@protobufjs/base64\");\n\n// base class of rpc.Service\nutil.EventEmitter = require(\"@protobufjs/eventemitter\");\n\n// float handling accross browsers\nutil.float = require(\"@protobufjs/float\");\n\n// requires modules optionally and hides the call from bundlers\nutil.inquire = require(\"@protobufjs/inquire\");\n\n// converts to / from utf8 encoded strings\nutil.utf8 = require(\"@protobufjs/utf8\");\n\n// provides a node-like buffer pool in the browser\nutil.pool = require(\"@protobufjs/pool\");\n\n// utility to work with the low and high bits of a 64 bit value\nutil.LongBits = require(\"./longbits\");\n\n/**\n * Whether running within node or not.\n * @memberof util\n * @type {boolean}\n */\nutil.isNode = Boolean(typeof global !== \"undefined\"\n && global\n && global.process\n && global.process.versions\n && global.process.versions.node);\n\n/**\n * Global object reference.\n * @memberof util\n * @type {Object}\n */\nutil.global = util.isNode && global\n || typeof window !== \"undefined\" && window\n || typeof self !== \"undefined\" && self\n || this; // eslint-disable-line no-invalid-this\n\n/**\n * An immuable empty array.\n * @memberof util\n * @type {Array.<*>}\n * @const\n */\nutil.emptyArray = Object.freeze ? Object.freeze([]) : /* istanbul ignore next */ []; // used on prototypes\n\n/**\n * An immutable empty object.\n * @type {Object}\n * @const\n */\nutil.emptyObject = Object.freeze ? Object.freeze({}) : /* istanbul ignore next */ {}; // used on prototypes\n\n/**\n * Tests if the specified value is an integer.\n * @function\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is an integer\n */\nutil.isInteger = Number.isInteger || /* istanbul ignore next */ function isInteger(value) {\n return typeof value === \"number\" && isFinite(value) && Math.floor(value) === value;\n};\n\n/**\n * Tests if the specified value is a string.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a string\n */\nutil.isString = function isString(value) {\n return typeof value === \"string\" || value instanceof String;\n};\n\n/**\n * Tests if the specified value is a non-null object.\n * @param {*} value Value to test\n * @returns {boolean} `true` if the value is a non-null object\n */\nutil.isObject = function isObject(value) {\n return value && typeof value === \"object\";\n};\n\n/**\n * Checks if a property on a message is considered to be present.\n * This is an alias of {@link util.isSet}.\n * @function\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isset =\n\n/**\n * Checks if a property on a message is considered to be present.\n * @param {Object} obj Plain object or message instance\n * @param {string} prop Property name\n * @returns {boolean} `true` if considered to be present, otherwise `false`\n */\nutil.isSet = function isSet(obj, prop) {\n var value = obj[prop];\n if (value != null && obj.hasOwnProperty(prop)) // eslint-disable-line eqeqeq, no-prototype-builtins\n return typeof value !== \"object\" || (Array.isArray(value) ? value.length : Object.keys(value).length) > 0;\n return false;\n};\n\n/**\n * Any compatible Buffer instance.\n * This is a minimal stand-alone definition of a Buffer instance. The actual type is that exported by node's typings.\n * @interface Buffer\n * @extends Uint8Array\n */\n\n/**\n * Node's Buffer class if available.\n * @type {Constructor}\n */\nutil.Buffer = (function() {\n try {\n var Buffer = util.inquire(\"buffer\").Buffer;\n // refuse to use non-node buffers if not explicitly assigned (perf reasons):\n return Buffer.prototype.utf8Write ? Buffer : /* istanbul ignore next */ null;\n } catch (e) {\n /* istanbul ignore next */\n return null;\n }\n})();\n\n// Internal alias of or polyfull for Buffer.from.\nutil._Buffer_from = null;\n\n// Internal alias of or polyfill for Buffer.allocUnsafe.\nutil._Buffer_allocUnsafe = null;\n\n/**\n * Creates a new buffer of whatever type supported by the environment.\n * @param {number|number[]} [sizeOrArray=0] Buffer size or number array\n * @returns {Uint8Array|Buffer} Buffer\n */\nutil.newBuffer = function newBuffer(sizeOrArray) {\n /* istanbul ignore next */\n return typeof sizeOrArray === \"number\"\n ? util.Buffer\n ? util._Buffer_allocUnsafe(sizeOrArray)\n : new util.Array(sizeOrArray)\n : util.Buffer\n ? util._Buffer_from(sizeOrArray)\n : typeof Uint8Array === \"undefined\"\n ? sizeOrArray\n : new Uint8Array(sizeOrArray);\n};\n\n/**\n * Array implementation used in the browser. `Uint8Array` if supported, otherwise `Array`.\n * @type {Constructor}\n */\nutil.Array = typeof Uint8Array !== \"undefined\" ? Uint8Array /* istanbul ignore next */ : Array;\n\n/**\n * Any compatible Long instance.\n * This is a minimal stand-alone definition of a Long instance. The actual type is that exported by long.js.\n * @interface Long\n * @property {number} low Low bits\n * @property {number} high High bits\n * @property {boolean} unsigned Whether unsigned or not\n */\n\n/**\n * Long.js's Long class if available.\n * @type {Constructor}\n */\nutil.Long = /* istanbul ignore next */ util.global.dcodeIO && /* istanbul ignore next */ util.global.dcodeIO.Long\n || /* istanbul ignore next */ util.global.Long\n || util.inquire(\"long\");\n\n/**\n * Regular expression used to verify 2 bit (`bool`) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key2Re = /^true|false|0|1$/;\n\n/**\n * Regular expression used to verify 32 bit (`int32` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key32Re = /^-?(?:0|[1-9][0-9]*)$/;\n\n/**\n * Regular expression used to verify 64 bit (`int64` etc.) map keys.\n * @type {RegExp}\n * @const\n */\nutil.key64Re = /^(?:[\\\\x00-\\\\xff]{8}|-?(?:0|[1-9][0-9]*))$/;\n\n/**\n * Converts a number or long to an 8 characters long hash string.\n * @param {Long|number} value Value to convert\n * @returns {string} Hash\n */\nutil.longToHash = function longToHash(value) {\n return value\n ? util.LongBits.from(value).toHash()\n : util.LongBits.zeroHash;\n};\n\n/**\n * Converts an 8 characters long hash string to a long or number.\n * @param {string} hash Hash\n * @param {boolean} [unsigned=false] Whether unsigned or not\n * @returns {Long|number} Original value\n */\nutil.longFromHash = function longFromHash(hash, unsigned) {\n var bits = util.LongBits.fromHash(hash);\n if (util.Long)\n return util.Long.fromBits(bits.lo, bits.hi, unsigned);\n return bits.toNumber(Boolean(unsigned));\n};\n\n/**\n * Merges the properties of the source object into the destination object.\n * @memberof util\n * @param {Object.} dst Destination object\n * @param {Object.} src Source object\n * @param {boolean} [ifNotSet=false] Merges only if the key is not already set\n * @returns {Object.} Destination object\n */\nfunction merge(dst, src, ifNotSet) { // used by converters\n for (var keys = Object.keys(src), i = 0; i < keys.length; ++i)\n if (dst[keys[i]] === undefined || !ifNotSet)\n dst[keys[i]] = src[keys[i]];\n return dst;\n}\n\nutil.merge = merge;\n\n/**\n * Converts the first character of a string to lower case.\n * @param {string} str String to convert\n * @returns {string} Converted string\n */\nutil.lcFirst = function lcFirst(str) {\n return str.charAt(0).toLowerCase() + str.substring(1);\n};\n\n/**\n * Creates a custom error constructor.\n * @memberof util\n * @param {string} name Error name\n * @returns {Constructor} Custom error constructor\n */\nfunction newError(name) {\n\n function CustomError(message, properties) {\n\n if (!(this instanceof CustomError))\n return new CustomError(message, properties);\n\n // Error.call(this, message);\n // ^ just returns a new error instance because the ctor can be called as a function\n\n Object.defineProperty(this, \"message\", { get: function() { return message; } });\n\n /* istanbul ignore next */\n if (Error.captureStackTrace) // node\n Error.captureStackTrace(this, CustomError);\n else\n Object.defineProperty(this, \"stack\", { value: new Error().stack || \"\" });\n\n if (properties)\n merge(this, properties);\n }\n\n CustomError.prototype = Object.create(Error.prototype, {\n constructor: {\n value: CustomError,\n writable: true,\n enumerable: false,\n configurable: true,\n },\n name: {\n get: function get() { return name; },\n set: undefined,\n enumerable: false,\n // configurable: false would accurately preserve the behavior of\n // the original, but I'm guessing that was not intentional.\n // For an actual error subclass, this property would\n // be configurable.\n configurable: true,\n },\n toString: {\n value: function value() { return this.name + \": \" + this.message; },\n writable: true,\n enumerable: false,\n configurable: true,\n },\n });\n\n return CustomError;\n}\n\nutil.newError = newError;\n\n/**\n * Constructs a new protocol error.\n * @classdesc Error subclass indicating a protocol specifc error.\n * @memberof util\n * @extends Error\n * @template T extends Message\n * @constructor\n * @param {string} message Error message\n * @param {Object.} [properties] Additional properties\n * @example\n * try {\n * MyMessage.decode(someBuffer); // throws if required fields are missing\n * } catch (e) {\n * if (e instanceof ProtocolError && e.instance)\n * console.log(\"decoded so far: \" + JSON.stringify(e.instance));\n * }\n */\nutil.ProtocolError = newError(\"ProtocolError\");\n\n/**\n * So far decoded message instance.\n * @name util.ProtocolError#instance\n * @type {Message}\n */\n\n/**\n * A OneOf getter as returned by {@link util.oneOfGetter}.\n * @typedef OneOfGetter\n * @type {function}\n * @returns {string|undefined} Set field name, if any\n */\n\n/**\n * Builds a getter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfGetter} Unbound getter\n */\nutil.oneOfGetter = function getOneOf(fieldNames) {\n var fieldMap = {};\n for (var i = 0; i < fieldNames.length; ++i)\n fieldMap[fieldNames[i]] = 1;\n\n /**\n * @returns {string|undefined} Set field name, if any\n * @this Object\n * @ignore\n */\n return function() { // eslint-disable-line consistent-return\n for (var keys = Object.keys(this), i = keys.length - 1; i > -1; --i)\n if (fieldMap[keys[i]] === 1 && this[keys[i]] !== undefined && this[keys[i]] !== null)\n return keys[i];\n };\n};\n\n/**\n * A OneOf setter as returned by {@link util.oneOfSetter}.\n * @typedef OneOfSetter\n * @type {function}\n * @param {string|undefined} value Field name\n * @returns {undefined}\n */\n\n/**\n * Builds a setter for a oneof's present field name.\n * @param {string[]} fieldNames Field names\n * @returns {OneOfSetter} Unbound setter\n */\nutil.oneOfSetter = function setOneOf(fieldNames) {\n\n /**\n * @param {string} name Field name\n * @returns {undefined}\n * @this Object\n * @ignore\n */\n return function(name) {\n for (var i = 0; i < fieldNames.length; ++i)\n if (fieldNames[i] !== name)\n delete this[fieldNames[i]];\n };\n};\n\n/**\n * Default conversion options used for {@link Message#toJSON} implementations.\n *\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:\n *\n * - Longs become strings\n * - Enums become string keys\n * - Bytes become base64 encoded strings\n * - (Sub-)Messages become plain objects\n * - Maps become plain objects with all string keys\n * - Repeated fields become arrays\n * - NaN and Infinity for float and double fields become strings\n *\n * @type {IConversionOptions}\n * @see https://developers.google.com/protocol-buffers/docs/proto3?hl=en#json\n */\nutil.toJSONOptions = {\n longs: String,\n enums: String,\n bytes: String,\n json: true\n};\n\n// Sets up buffer utility according to the environment (called in index-minimal)\nutil._configure = function() {\n var Buffer = util.Buffer;\n /* istanbul ignore if */\n if (!Buffer) {\n util._Buffer_from = util._Buffer_allocUnsafe = null;\n return;\n }\n // because node 4.x buffers are incompatible & immutable\n // see: https://github.com/dcodeIO/protobuf.js/pull/665\n util._Buffer_from = Buffer.from !== Uint8Array.from && Buffer.from ||\n /* istanbul ignore next */\n function Buffer_from(value, encoding) {\n return new Buffer(value, encoding);\n };\n util._Buffer_allocUnsafe = Buffer.allocUnsafe ||\n /* istanbul ignore next */\n function Buffer_allocUnsafe(size) {\n return new Buffer(size);\n };\n};\n","function RetryOperation(timeouts, options) {\n // Compatibility for the old (timeouts, retryForever) signature\n if (typeof options === 'boolean') {\n options = { forever: options };\n }\n\n this._originalTimeouts = JSON.parse(JSON.stringify(timeouts));\n this._timeouts = timeouts;\n this._options = options || {};\n this._maxRetryTime = options && options.maxRetryTime || Infinity;\n this._fn = null;\n this._errors = [];\n this._attempts = 1;\n this._operationTimeout = null;\n this._operationTimeoutCb = null;\n this._timeout = null;\n this._operationStart = null;\n this._timer = null;\n\n if (this._options.forever) {\n this._cachedTimeouts = this._timeouts.slice(0);\n }\n}\nmodule.exports = RetryOperation;\n\nRetryOperation.prototype.reset = function() {\n this._attempts = 1;\n this._timeouts = this._originalTimeouts.slice(0);\n}\n\nRetryOperation.prototype.stop = function() {\n if (this._timeout) {\n clearTimeout(this._timeout);\n }\n if (this._timer) {\n clearTimeout(this._timer);\n }\n\n this._timeouts = [];\n this._cachedTimeouts = null;\n};\n\nRetryOperation.prototype.retry = function(err) {\n if (this._timeout) {\n clearTimeout(this._timeout);\n }\n\n if (!err) {\n return false;\n }\n var currentTime = new Date().getTime();\n if (err && currentTime - this._operationStart >= this._maxRetryTime) {\n this._errors.push(err);\n this._errors.unshift(new Error('RetryOperation timeout occurred'));\n return false;\n }\n\n this._errors.push(err);\n\n var timeout = this._timeouts.shift();\n if (timeout === undefined) {\n if (this._cachedTimeouts) {\n // retry forever, only keep last error\n this._errors.splice(0, this._errors.length - 1);\n timeout = this._cachedTimeouts.slice(-1);\n } else {\n return false;\n }\n }\n\n var self = this;\n this._timer = setTimeout(function() {\n self._attempts++;\n\n if (self._operationTimeoutCb) {\n self._timeout = setTimeout(function() {\n self._operationTimeoutCb(self._attempts);\n }, self._operationTimeout);\n\n if (self._options.unref) {\n self._timeout.unref();\n }\n }\n\n self._fn(self._attempts);\n }, timeout);\n\n if (this._options.unref) {\n this._timer.unref();\n }\n\n return true;\n};\n\nRetryOperation.prototype.attempt = function(fn, timeoutOps) {\n this._fn = fn;\n\n if (timeoutOps) {\n if (timeoutOps.timeout) {\n this._operationTimeout = timeoutOps.timeout;\n }\n if (timeoutOps.cb) {\n this._operationTimeoutCb = timeoutOps.cb;\n }\n }\n\n var self = this;\n if (this._operationTimeoutCb) {\n this._timeout = setTimeout(function() {\n self._operationTimeoutCb();\n }, self._operationTimeout);\n }\n\n this._operationStart = new Date().getTime();\n\n this._fn(this._attempts);\n};\n\nRetryOperation.prototype.try = function(fn) {\n console.log('Using RetryOperation.try() is deprecated');\n this.attempt(fn);\n};\n\nRetryOperation.prototype.start = function(fn) {\n console.log('Using RetryOperation.start() is deprecated');\n this.attempt(fn);\n};\n\nRetryOperation.prototype.start = RetryOperation.prototype.try;\n\nRetryOperation.prototype.errors = function() {\n return this._errors;\n};\n\nRetryOperation.prototype.attempts = function() {\n return this._attempts;\n};\n\nRetryOperation.prototype.mainError = function() {\n if (this._errors.length === 0) {\n return null;\n }\n\n var counts = {};\n var mainError = null;\n var mainErrorCount = 0;\n\n for (var i = 0; i < this._errors.length; i++) {\n var error = this._errors[i];\n var message = error.message;\n var count = (counts[message] || 0) + 1;\n\n counts[message] = count;\n\n if (count >= mainErrorCount) {\n mainError = error;\n mainErrorCount = count;\n }\n }\n\n return mainError;\n};\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\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\";\nvar protobuf = exports;\n\n/**\n * Build type, one of `\"full\"`, `\"light\"` or `\"minimal\"`.\n * @name build\n * @type {string}\n * @const\n */\nprotobuf.build = \"minimal\";\n\n// Serialization\nprotobuf.Writer = require(\"./writer\");\nprotobuf.BufferWriter = require(\"./writer_buffer\");\nprotobuf.Reader = require(\"./reader\");\nprotobuf.BufferReader = require(\"./reader_buffer\");\n\n// Utility\nprotobuf.util = require(\"./util/minimal\");\nprotobuf.rpc = require(\"./rpc\");\nprotobuf.roots = require(\"./roots\");\nprotobuf.configure = configure;\n\n/* istanbul ignore next */\n/**\n * Reconfigures the library according to the environment.\n * @returns {undefined}\n */\nfunction configure() {\n protobuf.util._configure();\n protobuf.Writer._configure(protobuf.BufferWriter);\n protobuf.Reader._configure(protobuf.BufferReader);\n}\n\n// Set up buffer utility according to the environment\nconfigure();\n","\"use strict\";\nmodule.exports = {};\n\n/**\n * Named roots.\n * This is where pbjs stores generated structures (the option `-r, --root` specifies a name).\n * Can also be used manually to make roots available across modules.\n * @name roots\n * @type {Object.}\n * @example\n * // pbjs -r myroot -o compiled.js ...\n *\n * // in another module:\n * require(\"./compiled.js\");\n *\n * // in any subsequent module:\n * var root = protobuf.roots[\"myroot\"];\n */\n","\"use strict\";\nmodule.exports = parse;\n\nparse.filename = null;\nparse.defaults = { keepCase: false };\n\nvar tokenize = require(\"./tokenize\"),\n Root = require(\"./root\"),\n Type = require(\"./type\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n OneOf = require(\"./oneof\"),\n Enum = require(\"./enum\"),\n Service = require(\"./service\"),\n Method = require(\"./method\"),\n ReflectionObject = require(\"./object\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nvar base10Re = /^[1-9][0-9]*$/,\n base10NegRe = /^-?[1-9][0-9]*$/,\n base16Re = /^0[x][0-9a-fA-F]+$/,\n base16NegRe = /^-?0[x][0-9a-fA-F]+$/,\n base8Re = /^0[0-7]+$/,\n base8NegRe = /^-?0[0-7]+$/,\n numberRe = /^(?![eE])[0-9]*(?:\\.[0-9]*)?(?:[eE][+-]?[0-9]+)?$/,\n nameRe = /^[a-zA-Z_][a-zA-Z_0-9]*$/,\n typeRefRe = /^(?:\\.?[a-zA-Z_][a-zA-Z_0-9]*)(?:\\.[a-zA-Z_][a-zA-Z_0-9]*)*$/;\n\n/**\n * Result object returned from {@link parse}.\n * @interface IParserResult\n * @property {string|undefined} package Package name, if declared\n * @property {string[]|undefined} imports Imports, if any\n * @property {string[]|undefined} weakImports Weak imports, if any\n * @property {Root} root Populated root instance\n */\n\n/**\n * Options modifying the behavior of {@link parse}.\n * @interface IParseOptions\n * @property {boolean} [keepCase=false] Keeps field casing instead of converting to camel case\n * @property {boolean} [alternateCommentMode=false] Recognize double-slash comments in addition to doc-block comments.\n * @property {boolean} [preferTrailingComment=false] Use trailing comment when both leading comment and trailing comment exist.\n */\n\n/**\n * Options modifying the behavior of JSON serialization.\n * @interface IToJSONOptions\n * @property {boolean} [keepComments=false] Serializes comments.\n */\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @param {string} source Source contents\n * @param {Root} root Root to populate\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n */\nfunction parse(source, root, options) {\n /* eslint-disable callback-return */\n if (!(root instanceof Root)) {\n options = root;\n root = new Root();\n }\n if (!options)\n options = parse.defaults;\n\n var preferTrailingComment = options.preferTrailingComment || false;\n var tn = tokenize(source, options.alternateCommentMode || false),\n next = tn.next,\n push = tn.push,\n peek = tn.peek,\n skip = tn.skip,\n cmnt = tn.cmnt;\n\n var head = true,\n pkg,\n imports,\n weakImports,\n edition = \"proto2\";\n\n var ptr = root;\n\n var topLevelObjects = [];\n var topLevelOptions = {};\n\n var applyCase = options.keepCase ? function(name) { return name; } : util.camelCase;\n\n function resolveFileFeatures() {\n topLevelObjects.forEach(obj => {\n obj._edition = edition;\n Object.keys(topLevelOptions).forEach(opt => {\n if (obj.getOption(opt) !== undefined) return;\n obj.setOption(opt, topLevelOptions[opt], true);\n });\n });\n }\n\n /* istanbul ignore next */\n function illegal(token, name, insideTryCatch) {\n var filename = parse.filename;\n if (!insideTryCatch)\n parse.filename = null;\n return Error(\"illegal \" + (name || \"token\") + \" '\" + token + \"' (\" + (filename ? filename + \", \" : \"\") + \"line \" + tn.line + \")\");\n }\n\n function readString() {\n var values = [],\n token;\n do {\n /* istanbul ignore if */\n if ((token = next()) !== \"\\\"\" && token !== \"'\")\n throw illegal(token);\n\n values.push(next());\n skip(token);\n token = peek();\n } while (token === \"\\\"\" || token === \"'\");\n return values.join(\"\");\n }\n\n function readValue(acceptTypeRef) {\n var token = next();\n switch (token) {\n case \"'\":\n case \"\\\"\":\n push(token);\n return readString();\n case \"true\": case \"TRUE\":\n return true;\n case \"false\": case \"FALSE\":\n return false;\n }\n try {\n return parseNumber(token, /* insideTryCatch */ true);\n } catch (e) {\n /* istanbul ignore else */\n if (acceptTypeRef && typeRefRe.test(token))\n return token;\n\n /* istanbul ignore next */\n throw illegal(token, \"value\");\n }\n }\n\n function readRanges(target, acceptStrings) {\n var token, start;\n do {\n if (acceptStrings && ((token = peek()) === \"\\\"\" || token === \"'\")) {\n var str = readString();\n target.push(str);\n if (edition >= 2023) {\n throw illegal(str, \"id\");\n }\n } else {\n try {\n target.push([ start = parseId(next()), skip(\"to\", true) ? parseId(next()) : start ]);\n } catch (err) {\n if (acceptStrings && typeRefRe.test(token) && edition >= 2023) {\n target.push(token);\n } else {\n throw err;\n }\n }\n }\n } while (skip(\",\", true));\n var dummy = {options: undefined};\n dummy.setOption = function(name, value) {\n if (this.options === undefined) this.options = {};\n this.options[name] = value;\n };\n ifBlock(\n dummy,\n function parseRange_block(token) {\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(dummy, token); // skip\n skip(\";\");\n } else\n throw illegal(token);\n },\n function parseRange_line() {\n parseInlineOptions(dummy); // skip\n });\n }\n\n function parseNumber(token, insideTryCatch) {\n var sign = 1;\n if (token.charAt(0) === \"-\") {\n sign = -1;\n token = token.substring(1);\n }\n switch (token) {\n case \"inf\": case \"INF\": case \"Inf\":\n return sign * Infinity;\n case \"nan\": case \"NAN\": case \"Nan\": case \"NaN\":\n return NaN;\n case \"0\":\n return 0;\n }\n if (base10Re.test(token))\n return sign * parseInt(token, 10);\n if (base16Re.test(token))\n return sign * parseInt(token, 16);\n if (base8Re.test(token))\n return sign * parseInt(token, 8);\n\n /* istanbul ignore else */\n if (numberRe.test(token))\n return sign * parseFloat(token);\n\n /* istanbul ignore next */\n throw illegal(token, \"number\", insideTryCatch);\n }\n\n function parseId(token, acceptNegative) {\n switch (token) {\n case \"max\": case \"MAX\": case \"Max\":\n return 536870911;\n case \"0\":\n return 0;\n }\n\n /* istanbul ignore if */\n if (!acceptNegative && token.charAt(0) === \"-\")\n throw illegal(token, \"id\");\n\n if (base10NegRe.test(token))\n return parseInt(token, 10);\n if (base16NegRe.test(token))\n return parseInt(token, 16);\n\n /* istanbul ignore else */\n if (base8NegRe.test(token))\n return parseInt(token, 8);\n\n /* istanbul ignore next */\n throw illegal(token, \"id\");\n }\n\n function parsePackage() {\n /* istanbul ignore if */\n if (pkg !== undefined)\n throw illegal(\"package\");\n\n pkg = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(pkg))\n throw illegal(pkg, \"name\");\n\n ptr = ptr.define(pkg);\n\n skip(\";\");\n }\n\n function parseImport() {\n var token = peek();\n var whichImports;\n switch (token) {\n case \"weak\":\n whichImports = weakImports || (weakImports = []);\n next();\n break;\n case \"public\":\n next();\n // eslint-disable-next-line no-fallthrough\n default:\n whichImports = imports || (imports = []);\n break;\n }\n token = readString();\n skip(\";\");\n whichImports.push(token);\n }\n\n function parseSyntax() {\n skip(\"=\");\n edition = readString();\n\n /* istanbul ignore if */\n if (edition < 2023)\n throw illegal(edition, \"syntax\");\n\n skip(\";\");\n }\n\n function parseEdition() {\n skip(\"=\");\n edition = readString();\n const supportedEditions = [\"2023\"];\n\n /* istanbul ignore if */\n if (!supportedEditions.includes(edition))\n throw illegal(edition, \"edition\");\n\n skip(\";\");\n }\n\n\n function parseCommon(parent, token) {\n switch (token) {\n\n case \"option\":\n parseOption(parent, token);\n skip(\";\");\n return true;\n\n case \"message\":\n parseType(parent, token);\n return true;\n\n case \"enum\":\n parseEnum(parent, token);\n return true;\n\n case \"service\":\n parseService(parent, token);\n return true;\n\n case \"extend\":\n parseExtension(parent, token);\n return true;\n }\n return false;\n }\n\n function ifBlock(obj, fnIf, fnElse) {\n var trailingLine = tn.line;\n if (obj) {\n if(typeof obj.comment !== \"string\") {\n obj.comment = cmnt(); // try block-type comment\n }\n obj.filename = parse.filename;\n }\n if (skip(\"{\", true)) {\n var token;\n while ((token = next()) !== \"}\")\n fnIf(token);\n skip(\";\", true);\n } else {\n if (fnElse)\n fnElse();\n skip(\";\");\n if (obj && (typeof obj.comment !== \"string\" || preferTrailingComment))\n obj.comment = cmnt(trailingLine) || obj.comment; // try line-type comment\n }\n }\n\n function parseType(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"type name\");\n\n var type = new Type(token);\n ifBlock(type, function parseType_block(token) {\n if (parseCommon(type, token))\n return;\n\n switch (token) {\n\n case \"map\":\n parseMapField(type, token);\n break;\n\n case \"required\":\n if (edition !== \"proto2\")\n throw illegal(token);\n /* eslint-disable no-fallthrough */\n case \"repeated\":\n parseField(type, token);\n break;\n\n case \"optional\":\n /* istanbul ignore if */\n if (edition === \"proto3\") {\n parseField(type, \"proto3_optional\");\n } else if (edition !== \"proto2\") {\n throw illegal(token);\n } else {\n parseField(type, \"optional\");\n }\n break;\n\n case \"oneof\":\n parseOneOf(type, token);\n break;\n\n case \"extensions\":\n readRanges(type.extensions || (type.extensions = []));\n break;\n\n case \"reserved\":\n readRanges(type.reserved || (type.reserved = []), true);\n break;\n\n default:\n /* istanbul ignore if */\n if (edition === \"proto2\" || !typeRefRe.test(token)) {\n throw illegal(token);\n }\n\n push(token);\n parseField(type, \"optional\");\n break;\n }\n });\n parent.add(type);\n if (parent === ptr) {\n topLevelObjects.push(type);\n }\n }\n\n function parseField(parent, rule, extend) {\n var type = next();\n if (type === \"group\") {\n parseGroup(parent, rule);\n return;\n }\n // Type names can consume multiple tokens, in multiple variants:\n // package.subpackage field tokens: \"package.subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // package . subpackage field tokens: \"package\" \".\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // package. subpackage field tokens: \"package.\" \"subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // package .subpackage field tokens: \"package\" \".subpackage\" [TYPE NAME ENDS HERE] \"field\"\n // Keep reading tokens until we get a type name with no period at the end,\n // and the next token does not start with a period.\n while (type.endsWith(\".\") || peek().startsWith(\".\")) {\n type += next();\n }\n\n /* istanbul ignore if */\n if (!typeRefRe.test(type))\n throw illegal(type, \"type\");\n\n var name = next();\n\n /* istanbul ignore if */\n\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n name = applyCase(name);\n skip(\"=\");\n\n var field = new Field(name, parseId(next()), type, rule, extend);\n\n ifBlock(field, function parseField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseField_line() {\n parseInlineOptions(field);\n });\n\n if (rule === \"proto3_optional\") {\n // for proto3 optional fields, we create a single-member Oneof to mimic \"optional\" behavior\n var oneof = new OneOf(\"_\" + name);\n field.setOption(\"proto3_optional\", true);\n oneof.add(field);\n parent.add(oneof);\n } else {\n parent.add(field);\n }\n if (parent === ptr) {\n topLevelObjects.push(field);\n }\n }\n\n function parseGroup(parent, rule) {\n if (edition >= 2023) {\n throw illegal(\"group\");\n }\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n var fieldName = util.lcFirst(name);\n if (name === fieldName)\n name = util.ucFirst(name);\n skip(\"=\");\n var id = parseId(next());\n var type = new Type(name);\n type.group = true;\n var field = new Field(fieldName, id, name, rule);\n field.filename = parse.filename;\n ifBlock(type, function parseGroup_block(token) {\n switch (token) {\n\n case \"option\":\n parseOption(type, token);\n skip(\";\");\n break;\n case \"required\":\n case \"repeated\":\n parseField(type, token);\n break;\n\n case \"optional\":\n /* istanbul ignore if */\n if (edition === \"proto3\") {\n parseField(type, \"proto3_optional\");\n } else {\n parseField(type, \"optional\");\n }\n break;\n\n case \"message\":\n parseType(type, token);\n break;\n\n case \"enum\":\n parseEnum(type, token);\n break;\n\n /* istanbul ignore next */\n default:\n throw illegal(token); // there are no groups with proto3 semantics\n }\n });\n parent.add(type)\n .add(field);\n }\n\n function parseMapField(parent) {\n skip(\"<\");\n var keyType = next();\n\n /* istanbul ignore if */\n if (types.mapKey[keyType] === undefined)\n throw illegal(keyType, \"type\");\n\n skip(\",\");\n var valueType = next();\n\n /* istanbul ignore if */\n if (!typeRefRe.test(valueType))\n throw illegal(valueType, \"type\");\n\n skip(\">\");\n var name = next();\n\n /* istanbul ignore if */\n if (!nameRe.test(name))\n throw illegal(name, \"name\");\n\n skip(\"=\");\n var field = new MapField(applyCase(name), parseId(next()), keyType, valueType);\n ifBlock(field, function parseMapField_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(field, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseMapField_line() {\n parseInlineOptions(field);\n });\n parent.add(field);\n }\n\n function parseOneOf(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var oneof = new OneOf(applyCase(token));\n ifBlock(oneof, function parseOneOf_block(token) {\n if (token === \"option\") {\n parseOption(oneof, token);\n skip(\";\");\n } else {\n push(token);\n parseField(oneof, \"optional\");\n }\n });\n parent.add(oneof);\n }\n\n function parseEnum(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var enm = new Enum(token);\n ifBlock(enm, function parseEnum_block(token) {\n switch(token) {\n case \"option\":\n parseOption(enm, token);\n skip(\";\");\n break;\n\n case \"reserved\":\n readRanges(enm.reserved || (enm.reserved = []), true);\n if(enm.reserved === undefined) enm.reserved = [];\n break;\n\n default:\n parseEnumValue(enm, token);\n }\n });\n parent.add(enm);\n if (parent === ptr) {\n topLevelObjects.push(enm);\n }\n }\n\n function parseEnumValue(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token))\n throw illegal(token, \"name\");\n\n skip(\"=\");\n var value = parseId(next(), true),\n dummy = {\n options: undefined\n };\n dummy.getOption = function(name) {\n return this.options[name];\n };\n dummy.setOption = function(name, value) {\n ReflectionObject.prototype.setOption.call(dummy, name, value);\n };\n dummy.setParsedOption = function() {\n return undefined;\n };\n ifBlock(dummy, function parseEnumValue_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(dummy, token); // skip\n skip(\";\");\n } else\n throw illegal(token);\n\n }, function parseEnumValue_line() {\n parseInlineOptions(dummy); // skip\n });\n parent.add(token, value, dummy.comment, dummy.parsedOptions || dummy.options);\n }\n\n function parseOption(parent, token) {\n var option;\n var propName;\n var isOption = true;\n if (token === \"option\") {\n token = next();\n }\n\n while (token !== \"=\") {\n if (token === \"(\") {\n var parensValue = next();\n skip(\")\");\n token = \"(\" + parensValue + \")\";\n }\n if (isOption) {\n isOption = false;\n if (token.includes(\".\") && !token.includes(\"(\")) {\n var tokens = token.split(\".\");\n option = tokens[0] + \".\";\n token = tokens[1];\n continue;\n }\n option = token;\n } else {\n propName = propName ? propName += token : token;\n }\n token = next();\n }\n var name = propName ? option.concat(propName) : option;\n var optionValue = parseOptionValue(parent, name);\n propName = propName && propName[0] === \".\" ? propName.slice(1) : propName;\n option = option && option[option.length - 1] === \".\" ? option.slice(0, -1) : option;\n setParsedOption(parent, option, optionValue, propName);\n }\n\n function parseOptionValue(parent, name) {\n // { a: \"foo\" b { c: \"bar\" } }\n if (skip(\"{\", true)) {\n var objectResult = {};\n\n while (!skip(\"}\", true)) {\n /* istanbul ignore if */\n if (!nameRe.test(token = next())) {\n throw illegal(token, \"name\");\n }\n if (token === null) {\n throw illegal(token, \"end of input\");\n }\n\n var value;\n var propName = token;\n\n skip(\":\", true);\n\n if (peek() === \"{\") {\n // option (my_option) = {\n // repeated_value: [ \"foo\", \"bar\" ]\n // };\n value = parseOptionValue(parent, name + \".\" + token);\n } else if (peek() === \"[\") {\n value = [];\n var lastValue;\n if (skip(\"[\", true)) {\n do {\n lastValue = readValue(true);\n value.push(lastValue);\n } while (skip(\",\", true));\n skip(\"]\");\n if (typeof lastValue !== \"undefined\") {\n setOption(parent, name + \".\" + token, lastValue);\n }\n }\n } else {\n value = readValue(true);\n setOption(parent, name + \".\" + token, value);\n }\n\n var prevValue = objectResult[propName];\n\n if (prevValue)\n value = [].concat(prevValue).concat(value);\n\n objectResult[propName] = value;\n\n // Semicolons and commas can be optional\n skip(\",\", true);\n skip(\";\", true);\n }\n\n return objectResult;\n }\n\n var simpleValue = readValue(true);\n setOption(parent, name, simpleValue);\n return simpleValue;\n // Does not enforce a delimiter to be universal\n }\n\n function setOption(parent, name, value) {\n if (ptr === parent && /^features\\./.test(name)) {\n topLevelOptions[name] = value;\n return;\n }\n if (parent.setOption)\n parent.setOption(name, value);\n }\n\n function setParsedOption(parent, name, value, propName) {\n if (parent.setParsedOption)\n parent.setParsedOption(name, value, propName);\n }\n\n function parseInlineOptions(parent) {\n if (skip(\"[\", true)) {\n do {\n parseOption(parent, \"option\");\n } while (skip(\",\", true));\n skip(\"]\");\n }\n return parent;\n }\n\n function parseService(parent, token) {\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"service name\");\n\n var service = new Service(token);\n ifBlock(service, function parseService_block(token) {\n if (parseCommon(service, token)) {\n return;\n }\n\n /* istanbul ignore else */\n if (token === \"rpc\")\n parseMethod(service, token);\n else\n throw illegal(token);\n });\n parent.add(service);\n if (parent === ptr) {\n topLevelObjects.push(service);\n }\n }\n\n function parseMethod(parent, token) {\n // Get the comment of the preceding line now (if one exists) in case the\n // method is defined across multiple lines.\n var commentText = cmnt();\n\n var type = token;\n\n /* istanbul ignore if */\n if (!nameRe.test(token = next()))\n throw illegal(token, \"name\");\n\n var name = token,\n requestType, requestStream,\n responseType, responseStream;\n\n skip(\"(\");\n if (skip(\"stream\", true))\n requestStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n requestType = token;\n skip(\")\"); skip(\"returns\"); skip(\"(\");\n if (skip(\"stream\", true))\n responseStream = true;\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token);\n\n responseType = token;\n skip(\")\");\n\n var method = new Method(name, type, requestType, responseType, requestStream, responseStream);\n method.comment = commentText;\n ifBlock(method, function parseMethod_block(token) {\n\n /* istanbul ignore else */\n if (token === \"option\") {\n parseOption(method, token);\n skip(\";\");\n } else\n throw illegal(token);\n\n });\n parent.add(method);\n }\n\n function parseExtension(parent, token) {\n\n /* istanbul ignore if */\n if (!typeRefRe.test(token = next()))\n throw illegal(token, \"reference\");\n\n var reference = token;\n ifBlock(null, function parseExtension_block(token) {\n switch (token) {\n\n case \"required\":\n case \"repeated\":\n parseField(parent, token, reference);\n break;\n\n case \"optional\":\n /* istanbul ignore if */\n if (edition === \"proto3\") {\n parseField(parent, \"proto3_optional\", reference);\n } else {\n parseField(parent, \"optional\", reference);\n }\n break;\n\n default:\n /* istanbul ignore if */\n if (edition === \"proto2\" || !typeRefRe.test(token))\n throw illegal(token);\n push(token);\n parseField(parent, \"optional\", reference);\n break;\n }\n });\n }\n\n var token;\n while ((token = next()) !== null) {\n switch (token) {\n\n case \"package\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parsePackage();\n break;\n\n case \"import\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseImport();\n break;\n\n case \"syntax\":\n\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n\n parseSyntax();\n break;\n\n case \"edition\":\n /* istanbul ignore if */\n if (!head)\n throw illegal(token);\n parseEdition();\n break;\n\n case \"option\":\n parseOption(ptr, token);\n skip(\";\", true);\n break;\n\n default:\n\n /* istanbul ignore else */\n if (parseCommon(ptr, token)) {\n head = false;\n continue;\n }\n\n /* istanbul ignore next */\n throw illegal(token);\n }\n }\n\n resolveFileFeatures();\n\n parse.filename = null;\n return {\n \"package\" : pkg,\n \"imports\" : imports,\n weakImports : weakImports,\n root : root\n };\n}\n\n/**\n * Parses the given .proto source and returns an object with the parsed contents.\n * @name parse\n * @function\n * @param {string} source Source contents\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {IParserResult} Parser result\n * @property {string} filename=null Currently processing file name for error reporting, if known\n * @property {IParseOptions} defaults Default {@link IParseOptions}\n * @variation 2\n */\n","\"use strict\";\n\n/**\n * Streaming RPC helpers.\n * @namespace\n */\nvar rpc = exports;\n\n/**\n * RPC implementation passed to {@link Service#create} performing a service request on network level, i.e. by utilizing http requests or websockets.\n * @typedef RPCImpl\n * @type {function}\n * @param {Method|rpc.ServiceMethod,Message<{}>>} method Reflected or static method being called\n * @param {Uint8Array} requestData Request data\n * @param {RPCImplCallback} callback Callback function\n * @returns {undefined}\n * @example\n * function rpcImpl(method, requestData, callback) {\n * if (protobuf.util.lcFirst(method.name) !== \"myMethod\") // compatible with static code\n * throw Error(\"no such method\");\n * asynchronouslyObtainAResponse(requestData, function(err, responseData) {\n * callback(err, responseData);\n * });\n * }\n */\n\n/**\n * Node-style callback as used by {@link RPCImpl}.\n * @typedef RPCImplCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Uint8Array|null} [response] Response data or `null` to signal end of stream, if there hasn't been an error\n * @returns {undefined}\n */\n\nrpc.Service = require(\"./rpc/service\");\n","\"use strict\";\nmodule.exports = common;\n\nvar commonRe = /\\/|\\./;\n\n/**\n * Provides common type definitions.\n * Can also be used to provide additional google types or your own custom types.\n * @param {string} name Short name as in `google/protobuf/[name].proto` or full file name\n * @param {Object.} json JSON definition within `google.protobuf` if a short name, otherwise the file's root definition\n * @returns {undefined}\n * @property {INamespace} google/protobuf/any.proto Any\n * @property {INamespace} google/protobuf/duration.proto Duration\n * @property {INamespace} google/protobuf/empty.proto Empty\n * @property {INamespace} google/protobuf/field_mask.proto FieldMask\n * @property {INamespace} google/protobuf/struct.proto Struct, Value, NullValue and ListValue\n * @property {INamespace} google/protobuf/timestamp.proto Timestamp\n * @property {INamespace} google/protobuf/wrappers.proto Wrappers\n * @example\n * // manually provides descriptor.proto (assumes google/protobuf/ namespace and .proto extension)\n * protobuf.common(\"descriptor\", descriptorJson);\n *\n * // manually provides a custom definition (uses my.foo namespace)\n * protobuf.common(\"my/foo/bar.proto\", myFooBarJson);\n */\nfunction common(name, json) {\n if (!commonRe.test(name)) {\n name = \"google/protobuf/\" + name + \".proto\";\n json = { nested: { google: { nested: { protobuf: { nested: json } } } } };\n }\n common[name] = json;\n}\n\n// Not provided because of limited use (feel free to discuss or to provide yourself):\n//\n// google/protobuf/descriptor.proto\n// google/protobuf/source_context.proto\n// google/protobuf/type.proto\n//\n// Stripped and pre-parsed versions of these non-bundled files are instead available as part of\n// the repository or package within the google/protobuf directory.\n\ncommon(\"any\", {\n\n /**\n * Properties of a google.protobuf.Any message.\n * @interface IAny\n * @type {Object}\n * @property {string} [typeUrl]\n * @property {Uint8Array} [bytes]\n * @memberof common\n */\n Any: {\n fields: {\n type_url: {\n type: \"string\",\n id: 1\n },\n value: {\n type: \"bytes\",\n id: 2\n }\n }\n }\n});\n\nvar timeType;\n\ncommon(\"duration\", {\n\n /**\n * Properties of a google.protobuf.Duration message.\n * @interface IDuration\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Duration: timeType = {\n fields: {\n seconds: {\n type: \"int64\",\n id: 1\n },\n nanos: {\n type: \"int32\",\n id: 2\n }\n }\n }\n});\n\ncommon(\"timestamp\", {\n\n /**\n * Properties of a google.protobuf.Timestamp message.\n * @interface ITimestamp\n * @type {Object}\n * @property {number|Long} [seconds]\n * @property {number} [nanos]\n * @memberof common\n */\n Timestamp: timeType\n});\n\ncommon(\"empty\", {\n\n /**\n * Properties of a google.protobuf.Empty message.\n * @interface IEmpty\n * @memberof common\n */\n Empty: {\n fields: {}\n }\n});\n\ncommon(\"struct\", {\n\n /**\n * Properties of a google.protobuf.Struct message.\n * @interface IStruct\n * @type {Object}\n * @property {Object.} [fields]\n * @memberof common\n */\n Struct: {\n fields: {\n fields: {\n keyType: \"string\",\n type: \"Value\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Value message.\n * @interface IValue\n * @type {Object}\n * @property {string} [kind]\n * @property {0} [nullValue]\n * @property {number} [numberValue]\n * @property {string} [stringValue]\n * @property {boolean} [boolValue]\n * @property {IStruct} [structValue]\n * @property {IListValue} [listValue]\n * @memberof common\n */\n Value: {\n oneofs: {\n kind: {\n oneof: [\n \"nullValue\",\n \"numberValue\",\n \"stringValue\",\n \"boolValue\",\n \"structValue\",\n \"listValue\"\n ]\n }\n },\n fields: {\n nullValue: {\n type: \"NullValue\",\n id: 1\n },\n numberValue: {\n type: \"double\",\n id: 2\n },\n stringValue: {\n type: \"string\",\n id: 3\n },\n boolValue: {\n type: \"bool\",\n id: 4\n },\n structValue: {\n type: \"Struct\",\n id: 5\n },\n listValue: {\n type: \"ListValue\",\n id: 6\n }\n }\n },\n\n NullValue: {\n values: {\n NULL_VALUE: 0\n }\n },\n\n /**\n * Properties of a google.protobuf.ListValue message.\n * @interface IListValue\n * @type {Object}\n * @property {Array.} [values]\n * @memberof common\n */\n ListValue: {\n fields: {\n values: {\n rule: \"repeated\",\n type: \"Value\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"wrappers\", {\n\n /**\n * Properties of a google.protobuf.DoubleValue message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n DoubleValue: {\n fields: {\n value: {\n type: \"double\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.FloatValue message.\n * @interface IFloatValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FloatValue: {\n fields: {\n value: {\n type: \"float\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int64Value message.\n * @interface IInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n Int64Value: {\n fields: {\n value: {\n type: \"int64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt64Value message.\n * @interface IUInt64Value\n * @type {Object}\n * @property {number|Long} [value]\n * @memberof common\n */\n UInt64Value: {\n fields: {\n value: {\n type: \"uint64\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.Int32Value message.\n * @interface IInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n Int32Value: {\n fields: {\n value: {\n type: \"int32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.UInt32Value message.\n * @interface IUInt32Value\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n UInt32Value: {\n fields: {\n value: {\n type: \"uint32\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BoolValue message.\n * @interface IBoolValue\n * @type {Object}\n * @property {boolean} [value]\n * @memberof common\n */\n BoolValue: {\n fields: {\n value: {\n type: \"bool\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.StringValue message.\n * @interface IStringValue\n * @type {Object}\n * @property {string} [value]\n * @memberof common\n */\n StringValue: {\n fields: {\n value: {\n type: \"string\",\n id: 1\n }\n }\n },\n\n /**\n * Properties of a google.protobuf.BytesValue message.\n * @interface IBytesValue\n * @type {Object}\n * @property {Uint8Array} [value]\n * @memberof common\n */\n BytesValue: {\n fields: {\n value: {\n type: \"bytes\",\n id: 1\n }\n }\n }\n});\n\ncommon(\"field_mask\", {\n\n /**\n * Properties of a google.protobuf.FieldMask message.\n * @interface IDoubleValue\n * @type {Object}\n * @property {number} [value]\n * @memberof common\n */\n FieldMask: {\n fields: {\n paths: {\n rule: \"repeated\",\n type: \"string\",\n id: 1\n }\n }\n }\n});\n\n/**\n * Gets the root definition of the specified common proto file.\n *\n * Bundled definitions are:\n * - google/protobuf/any.proto\n * - google/protobuf/duration.proto\n * - google/protobuf/empty.proto\n * - google/protobuf/field_mask.proto\n * - google/protobuf/struct.proto\n * - google/protobuf/timestamp.proto\n * - google/protobuf/wrappers.proto\n *\n * @param {string} file Proto file name\n * @returns {INamespace|null} Root definition or `null` if not defined\n */\ncommon.get = function get(file) {\n return common[file] || null;\n};\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\";\nvar protobuf = module.exports = require(\"./index-minimal\");\n\nprotobuf.build = \"light\";\n\n/**\n * A node-style callback as used by {@link load} and {@link Root#load}.\n * @typedef LoadCallback\n * @type {function}\n * @param {Error|null} error Error, if any, otherwise `null`\n * @param {Root} [root] Root, if there hasn't been an error\n * @returns {undefined}\n */\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} root Root namespace, defaults to create a new one if omitted.\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n */\nfunction load(filename, root, callback) {\n if (typeof root === \"function\") {\n callback = root;\n root = new protobuf.Root();\n } else if (!root)\n root = new protobuf.Root();\n return root.load(filename, callback);\n}\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and calls the callback.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @see {@link Root#load}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into a common root namespace and returns a promise.\n * @name load\n * @function\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Promise} Promise\n * @see {@link Root#load}\n * @variation 3\n */\n// function load(filename:string, [root:Root]):Promise\n\nprotobuf.load = load;\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into a common root namespace (node only).\n * @param {string|string[]} filename One or multiple files to load\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n * @see {@link Root#loadSync}\n */\nfunction loadSync(filename, root) {\n if (!root)\n root = new protobuf.Root();\n return root.loadSync(filename);\n}\n\nprotobuf.loadSync = loadSync;\n\n// Serialization\nprotobuf.encoder = require(\"./encoder\");\nprotobuf.decoder = require(\"./decoder\");\nprotobuf.verifier = require(\"./verifier\");\nprotobuf.converter = require(\"./converter\");\n\n// Reflection\nprotobuf.ReflectionObject = require(\"./object\");\nprotobuf.Namespace = require(\"./namespace\");\nprotobuf.Root = require(\"./root\");\nprotobuf.Enum = require(\"./enum\");\nprotobuf.Type = require(\"./type\");\nprotobuf.Field = require(\"./field\");\nprotobuf.OneOf = require(\"./oneof\");\nprotobuf.MapField = require(\"./mapfield\");\nprotobuf.Service = require(\"./service\");\nprotobuf.Method = require(\"./method\");\n\n// Runtime\nprotobuf.Message = require(\"./message\");\nprotobuf.wrappers = require(\"./wrappers\");\n\n// Utility\nprotobuf.types = require(\"./types\");\nprotobuf.util = require(\"./util\");\n\n// Set up possibly cyclic reflection dependencies\nprotobuf.ReflectionObject._configure(protobuf.Root);\nprotobuf.Namespace._configure(protobuf.Type, protobuf.Service, protobuf.Enum);\nprotobuf.Root._configure(protobuf.Type);\nprotobuf.Field._configure(protobuf.Type);\n","\"use strict\";\nmodule.exports = Root;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Root.prototype = Object.create(Namespace.prototype)).constructor = Root).className = \"Root\";\n\nvar Field = require(\"./field\"),\n Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n util = require(\"./util\");\n\nvar Type, // cyclic\n parse, // might be excluded\n common; // \"\n\n/**\n * Constructs a new root namespace instance.\n * @classdesc Root namespace wrapping all types, enums, services, sub-namespaces etc. that belong together.\n * @extends NamespaceBase\n * @constructor\n * @param {Object.} [options] Top level options\n */\nfunction Root(options) {\n Namespace.call(this, \"\", options);\n\n /**\n * Deferred extension fields.\n * @type {Field[]}\n */\n this.deferred = [];\n\n /**\n * Resolved file names of loaded files.\n * @type {string[]}\n */\n this.files = [];\n\n // Default to proto2 if unspecified.\n this._edition = \"proto2\";\n}\n\n/**\n * Loads a namespace descriptor into a root namespace.\n * @param {INamespace} json Namespace descriptor\n * @param {Root} [root] Root namespace, defaults to create a new one if omitted\n * @returns {Root} Root namespace\n */\nRoot.fromJSON = function fromJSON(json, root) {\n if (!root)\n root = new Root();\n if (json.options)\n root.setOptions(json.options);\n return root.addJSON(json.nested).resolveAll();\n};\n\n/**\n * Resolves the path of an imported file, relative to the importing origin.\n * This method exists so you can override it with your own logic in case your imports are scattered over multiple directories.\n * @function\n * @param {string} origin The file name of the importing file\n * @param {string} target The file name being imported\n * @returns {string|null} Resolved path to `target` or `null` to skip the file\n */\nRoot.prototype.resolvePath = util.path.resolve;\n\n/**\n * Fetch content from file path or url\n * This method exists so you can override it with your own logic.\n * @function\n * @param {string} path File path or url\n * @param {FetchCallback} callback Callback function\n * @returns {undefined}\n */\nRoot.prototype.fetch = util.fetch;\n\n// A symbol-like function to safely signal synchronous loading\n/* istanbul ignore next */\nfunction SYNC() {} // eslint-disable-line no-empty-function\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} options Parse options\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n */\nRoot.prototype.load = function load(filename, options, callback) {\n if (typeof options === \"function\") {\n callback = options;\n options = undefined;\n }\n var self = this;\n if (!callback) {\n return util.asPromise(load, self, filename, options);\n }\n\n var sync = callback === SYNC; // undocumented\n\n // Finishes loading by calling the callback (exactly once)\n function finish(err, root) {\n /* istanbul ignore if */\n if (!callback) {\n return;\n }\n if (sync) {\n throw err;\n }\n var cb = callback;\n callback = null;\n if (root) {\n root.resolveAll();\n }\n cb(err, root);\n }\n\n // Bundled definition existence checking\n function getBundledFileName(filename) {\n var idx = filename.lastIndexOf(\"google/protobuf/\");\n if (idx > -1) {\n var altname = filename.substring(idx);\n if (altname in common) return altname;\n }\n return null;\n }\n\n // Processes a single file\n function process(filename, source) {\n try {\n if (util.isString(source) && source.charAt(0) === \"{\")\n source = JSON.parse(source);\n if (!util.isString(source))\n self.setOptions(source.options).addJSON(source.nested);\n else {\n parse.filename = filename;\n var parsed = parse(source, self, options),\n resolved,\n i = 0;\n if (parsed.imports)\n for (; i < parsed.imports.length; ++i)\n if (resolved = getBundledFileName(parsed.imports[i]) || self.resolvePath(filename, parsed.imports[i]))\n fetch(resolved);\n if (parsed.weakImports)\n for (i = 0; i < parsed.weakImports.length; ++i)\n if (resolved = getBundledFileName(parsed.weakImports[i]) || self.resolvePath(filename, parsed.weakImports[i]))\n fetch(resolved, true);\n }\n } catch (err) {\n finish(err);\n }\n if (!sync && !queued) {\n finish(null, self); // only once anyway\n }\n }\n\n // Fetches a single file\n function fetch(filename, weak) {\n filename = getBundledFileName(filename) || filename;\n\n // Skip if already loaded / attempted\n if (self.files.indexOf(filename) > -1) {\n return;\n }\n self.files.push(filename);\n\n // Shortcut bundled definitions\n if (filename in common) {\n if (sync) {\n process(filename, common[filename]);\n } else {\n ++queued;\n setTimeout(function() {\n --queued;\n process(filename, common[filename]);\n });\n }\n return;\n }\n\n // Otherwise fetch from disk or network\n if (sync) {\n var source;\n try {\n source = util.fs.readFileSync(filename).toString(\"utf8\");\n } catch (err) {\n if (!weak)\n finish(err);\n return;\n }\n process(filename, source);\n } else {\n ++queued;\n self.fetch(filename, function(err, source) {\n --queued;\n /* istanbul ignore if */\n if (!callback) {\n return; // terminated meanwhile\n }\n if (err) {\n /* istanbul ignore else */\n if (!weak)\n finish(err);\n else if (!queued) // can't be covered reliably\n finish(null, self);\n return;\n }\n process(filename, source);\n });\n }\n }\n var queued = 0;\n\n // Assembling the root namespace doesn't require working type\n // references anymore, so we can load everything in parallel\n if (util.isString(filename)) {\n filename = [ filename ];\n }\n for (var i = 0, resolved; i < filename.length; ++i)\n if (resolved = self.resolvePath(\"\", filename[i]))\n fetch(resolved);\n self.resolveAll();\n if (sync) {\n return self;\n }\n if (!queued) {\n finish(null, self);\n }\n\n return self;\n};\n// function load(filename:string, options:IParseOptions, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and calls the callback.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {LoadCallback} callback Callback function\n * @returns {undefined}\n * @variation 2\n */\n// function load(filename:string, callback:LoadCallback):undefined\n\n/**\n * Loads one or multiple .proto or preprocessed .json files into this root namespace and returns a promise.\n * @function Root#load\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Promise} Promise\n * @variation 3\n */\n// function load(filename:string, [options:IParseOptions]):Promise\n\n/**\n * Synchronously loads one or multiple .proto or preprocessed .json files into this root namespace (node only).\n * @function Root#loadSync\n * @param {string|string[]} filename Names of one or multiple files to load\n * @param {IParseOptions} [options] Parse options. Defaults to {@link parse.defaults} when omitted.\n * @returns {Root} Root namespace\n * @throws {Error} If synchronous fetching is not supported (i.e. in browsers) or if a file's syntax is invalid\n */\nRoot.prototype.loadSync = function loadSync(filename, options) {\n if (!util.isNode)\n throw Error(\"not supported\");\n return this.load(filename, options, SYNC);\n};\n\n/**\n * @override\n */\nRoot.prototype.resolveAll = function resolveAll() {\n if (this.deferred.length)\n throw Error(\"unresolvable extensions: \" + this.deferred.map(function(field) {\n return \"'extend \" + field.extend + \"' in \" + field.parent.fullName;\n }).join(\", \"));\n return Namespace.prototype.resolveAll.call(this);\n};\n\n// only uppercased (and thus conflict-free) children are exposed, see below\nvar exposeRe = /^[A-Z]/;\n\n/**\n * Handles a deferred declaring extension field by creating a sister field to represent it within its extended type.\n * @param {Root} root Root instance\n * @param {Field} field Declaring extension field witin the declaring type\n * @returns {boolean} `true` if successfully added to the extended type, `false` otherwise\n * @inner\n * @ignore\n */\nfunction tryHandleExtension(root, field) {\n var extendedType = field.parent.lookup(field.extend);\n if (extendedType) {\n var sisterField = new Field(field.fullName, field.id, field.type, field.rule, undefined, field.options);\n //do not allow to extend same field twice to prevent the error\n if (extendedType.get(sisterField.name)) {\n return true;\n }\n sisterField.declaringField = field;\n field.extensionField = sisterField;\n extendedType.add(sisterField);\n return true;\n }\n return false;\n}\n\n/**\n * Called when any object is added to this root or its sub-namespaces.\n * @param {ReflectionObject} object Object added\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleAdd = function _handleAdd(object) {\n if (object instanceof Field) {\n\n if (/* an extension field (implies not part of a oneof) */ object.extend !== undefined && /* not already handled */ !object.extensionField)\n if (!tryHandleExtension(this, object))\n this.deferred.push(object);\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n object.parent[object.name] = object.values; // expose enum values as property of its parent\n\n } else if (!(object instanceof OneOf)) /* everything else is a namespace */ {\n\n if (object instanceof Type) // Try to handle any deferred extensions\n for (var i = 0; i < this.deferred.length;)\n if (tryHandleExtension(this, this.deferred[i]))\n this.deferred.splice(i, 1);\n else\n ++i;\n for (var j = 0; j < /* initializes */ object.nestedArray.length; ++j) // recurse into the namespace\n this._handleAdd(object._nestedArray[j]);\n if (exposeRe.test(object.name))\n object.parent[object.name] = object; // expose namespace as property of its parent\n }\n\n // The above also adds uppercased (and thus conflict-free) nested types, services and enums as\n // properties of namespaces just like static code does. This allows using a .d.ts generated for\n // a static module with reflection-based solutions where the condition is met.\n};\n\n/**\n * Called when any object is removed from this root or its sub-namespaces.\n * @param {ReflectionObject} object Object removed\n * @returns {undefined}\n * @private\n */\nRoot.prototype._handleRemove = function _handleRemove(object) {\n if (object instanceof Field) {\n\n if (/* an extension field */ object.extend !== undefined) {\n if (/* already handled */ object.extensionField) { // remove its sister field\n object.extensionField.parent.remove(object.extensionField);\n object.extensionField = null;\n } else { // cancel the extension\n var index = this.deferred.indexOf(object);\n /* istanbul ignore else */\n if (index > -1)\n this.deferred.splice(index, 1);\n }\n }\n\n } else if (object instanceof Enum) {\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose enum values\n\n } else if (object instanceof Namespace) {\n\n for (var i = 0; i < /* initializes */ object.nestedArray.length; ++i) // recurse into the namespace\n this._handleRemove(object._nestedArray[i]);\n\n if (exposeRe.test(object.name))\n delete object.parent[object.name]; // unexpose namespaces\n\n }\n};\n\n// Sets up cyclic dependencies (called in index-light)\nRoot._configure = function(Type_, parse_, common_) {\n Type = Type_;\n parse = parse_;\n common = common_;\n};\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","module.exports = require('./lib/retry');","\"use strict\";\nmodule.exports = Enum;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Enum.prototype = Object.create(ReflectionObject.prototype)).constructor = Enum).className = \"Enum\";\n\nvar Namespace = require(\"./namespace\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new enum instance.\n * @classdesc Reflected enum.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {Object.} [values] Enum values as an object, by name\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this enum\n * @param {Object.} [comments] The value comments for this enum\n * @param {Object.>|undefined} [valuesOptions] The value options for this enum\n */\nfunction Enum(name, values, options, comment, comments, valuesOptions) {\n ReflectionObject.call(this, name, options);\n\n if (values && typeof values !== \"object\")\n throw TypeError(\"values must be an object\");\n\n /**\n * Enum values by id.\n * @type {Object.}\n */\n this.valuesById = {};\n\n /**\n * Enum values by name.\n * @type {Object.}\n */\n this.values = Object.create(this.valuesById); // toJSON, marker\n\n /**\n * Enum comment text.\n * @type {string|null}\n */\n this.comment = comment;\n\n /**\n * Value comment texts, if any.\n * @type {Object.}\n */\n this.comments = comments || {};\n\n /**\n * Values options, if any\n * @type {Object>|undefined}\n */\n this.valuesOptions = valuesOptions;\n\n /**\n * Resolved values features, if any\n * @type {Object>|undefined}\n */\n this._valuesFeatures = {};\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n // Note that values inherit valuesById on their prototype which makes them a TypeScript-\n // compatible enum. This is used by pbts to write actual enum definitions that work for\n // static and reflection code alike instead of emitting generic object definitions.\n\n if (values)\n for (var keys = Object.keys(values), i = 0; i < keys.length; ++i)\n if (typeof values[keys[i]] === \"number\") // use forward entries only\n this.valuesById[ this.values[keys[i]] = values[keys[i]] ] = keys[i];\n}\n\n/**\n * @override\n */\nEnum.prototype._resolveFeatures = function _resolveFeatures(edition) {\n edition = this._edition || edition;\n ReflectionObject.prototype._resolveFeatures.call(this, edition);\n\n Object.keys(this.values).forEach(key => {\n var parentFeaturesCopy = Object.assign({}, this._features);\n this._valuesFeatures[key] = Object.assign(parentFeaturesCopy, this.valuesOptions && this.valuesOptions[key] && this.valuesOptions[key].features);\n });\n\n return this;\n};\n\n/**\n * Enum descriptor.\n * @interface IEnum\n * @property {Object.} values Enum values\n * @property {Object.} [options] Enum options\n */\n\n/**\n * Constructs an enum from an enum descriptor.\n * @param {string} name Enum name\n * @param {IEnum} json Enum descriptor\n * @returns {Enum} Created enum\n * @throws {TypeError} If arguments are invalid\n */\nEnum.fromJSON = function fromJSON(name, json) {\n var enm = new Enum(name, json.values, json.options, json.comment, json.comments);\n enm.reserved = json.reserved;\n if (json.edition)\n enm._edition = json.edition;\n enm._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return enm;\n};\n\n/**\n * Converts this enum to an enum descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IEnum} Enum descriptor\n */\nEnum.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"options\" , this.options,\n \"valuesOptions\" , this.valuesOptions,\n \"values\" , this.values,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"comment\" , keepComments ? this.comment : undefined,\n \"comments\" , keepComments ? this.comments : undefined\n ]);\n};\n\n/**\n * Adds a value to this enum.\n * @param {string} name Value name\n * @param {number} id Value id\n * @param {string} [comment] Comment, if any\n * @param {Object.|undefined} [options] Options, if any\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a value with this name or id\n */\nEnum.prototype.add = function add(name, id, comment, options) {\n // utilized by the parser but not by .fromJSON\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (!util.isInteger(id))\n throw TypeError(\"id must be an integer\");\n\n if (this.values[name] !== undefined)\n throw Error(\"duplicate name '\" + name + \"' in \" + this);\n\n if (this.isReservedId(id))\n throw Error(\"id \" + id + \" is reserved in \" + this);\n\n if (this.isReservedName(name))\n throw Error(\"name '\" + name + \"' is reserved in \" + this);\n\n if (this.valuesById[id] !== undefined) {\n if (!(this.options && this.options.allow_alias))\n throw Error(\"duplicate id \" + id + \" in \" + this);\n this.values[name] = id;\n } else\n this.valuesById[this.values[name] = id] = name;\n\n if (options) {\n if (this.valuesOptions === undefined)\n this.valuesOptions = {};\n this.valuesOptions[name] = options || null;\n }\n\n this.comments[name] = comment || null;\n return this;\n};\n\n/**\n * Removes a value from this enum\n * @param {string} name Value name\n * @returns {Enum} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `name` is not a name of this enum\n */\nEnum.prototype.remove = function remove(name) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n var val = this.values[name];\n if (val == null)\n throw Error(\"name '\" + name + \"' does not exist in \" + this);\n\n delete this.valuesById[val];\n delete this.values[name];\n delete this.comments[name];\n if (this.valuesOptions)\n delete this.valuesOptions[name];\n\n return this;\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nEnum.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\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","\"use strict\";\nmodule.exports = Reader;\n\nvar util = require(\"./util/minimal\");\n\nvar BufferReader; // cyclic\n\nvar LongBits = util.LongBits,\n utf8 = util.utf8;\n\n/* istanbul ignore next */\nfunction indexOutOfRange(reader, writeLength) {\n return RangeError(\"index out of range: \" + reader.pos + \" + \" + (writeLength || 1) + \" > \" + reader.len);\n}\n\n/**\n * Constructs a new reader instance using the specified buffer.\n * @classdesc Wire format reader using `Uint8Array` if available, otherwise `Array`.\n * @constructor\n * @param {Uint8Array} buffer Buffer to read from\n */\nfunction Reader(buffer) {\n\n /**\n * Read buffer.\n * @type {Uint8Array}\n */\n this.buf = buffer;\n\n /**\n * Read buffer position.\n * @type {number}\n */\n this.pos = 0;\n\n /**\n * Read buffer length.\n * @type {number}\n */\n this.len = buffer.length;\n}\n\nvar create_array = typeof Uint8Array !== \"undefined\"\n ? function create_typed_array(buffer) {\n if (buffer instanceof Uint8Array || Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n }\n /* istanbul ignore next */\n : function create_array(buffer) {\n if (Array.isArray(buffer))\n return new Reader(buffer);\n throw Error(\"illegal buffer\");\n };\n\nvar create = function create() {\n return util.Buffer\n ? function create_buffer_setup(buffer) {\n return (Reader.create = function create_buffer(buffer) {\n return util.Buffer.isBuffer(buffer)\n ? new BufferReader(buffer)\n /* istanbul ignore next */\n : create_array(buffer);\n })(buffer);\n }\n /* istanbul ignore next */\n : create_array;\n};\n\n/**\n * Creates a new reader using the specified buffer.\n * @function\n * @param {Uint8Array|Buffer} buffer Buffer to read from\n * @returns {Reader|BufferReader} A {@link BufferReader} if `buffer` is a Buffer, otherwise a {@link Reader}\n * @throws {Error} If `buffer` is not a valid buffer\n */\nReader.create = create();\n\nReader.prototype._slice = util.Array.prototype.subarray || /* istanbul ignore next */ util.Array.prototype.slice;\n\n/**\n * Reads a varint as an unsigned 32 bit value.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.uint32 = (function read_uint32_setup() {\n var value = 4294967295; // optimizer type-hint, tends to deopt otherwise (?!)\n return function read_uint32() {\n value = ( this.buf[this.pos] & 127 ) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 7) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 14) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 127) << 21) >>> 0; if (this.buf[this.pos++] < 128) return value;\n value = (value | (this.buf[this.pos] & 15) << 28) >>> 0; if (this.buf[this.pos++] < 128) return value;\n\n /* istanbul ignore if */\n if ((this.pos += 5) > this.len) {\n this.pos = this.len;\n throw indexOutOfRange(this, 10);\n }\n return value;\n };\n})();\n\n/**\n * Reads a varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.int32 = function read_int32() {\n return this.uint32() | 0;\n};\n\n/**\n * Reads a zig-zag encoded varint as a signed 32 bit value.\n * @returns {number} Value read\n */\nReader.prototype.sint32 = function read_sint32() {\n var value = this.uint32();\n return value >>> 1 ^ -(value & 1) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readLongVarint() {\n // tends to deopt with local vars for octet etc.\n var bits = new LongBits(0, 0);\n var 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 // 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 i = 0;\n } else {\n for (; i < 3; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\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 // 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 } else {\n for (; i < 5; ++i) {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\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 /* istanbul ignore next */\n throw Error(\"invalid varint encoding\");\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads a varint as a signed 64 bit value.\n * @name Reader#int64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as an unsigned 64 bit value.\n * @name Reader#uint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a zig-zag encoded varint as a signed 64 bit value.\n * @name Reader#sint64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a varint as a boolean.\n * @returns {boolean} Value read\n */\nReader.prototype.bool = function read_bool() {\n return this.uint32() !== 0;\n};\n\nfunction readFixed32_end(buf, end) { // note that this uses `end`, not `pos`\n return (buf[end - 4]\n | buf[end - 3] << 8\n | buf[end - 2] << 16\n | buf[end - 1] << 24) >>> 0;\n}\n\n/**\n * Reads fixed 32 bits as an unsigned 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.fixed32 = function read_fixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4);\n};\n\n/**\n * Reads fixed 32 bits as a signed 32 bit integer.\n * @returns {number} Value read\n */\nReader.prototype.sfixed32 = function read_sfixed32() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n return readFixed32_end(this.buf, this.pos += 4) | 0;\n};\n\n/* eslint-disable no-invalid-this */\n\nfunction readFixed64(/* this: Reader */) {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 8);\n\n return new LongBits(readFixed32_end(this.buf, this.pos += 4), readFixed32_end(this.buf, this.pos += 4));\n}\n\n/* eslint-enable no-invalid-this */\n\n/**\n * Reads fixed 64 bits.\n * @name Reader#fixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads zig-zag encoded fixed 64 bits.\n * @name Reader#sfixed64\n * @function\n * @returns {Long} Value read\n */\n\n/**\n * Reads a float (32 bit) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.float = function read_float() {\n\n /* istanbul ignore if */\n if (this.pos + 4 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readFloatLE(this.buf, this.pos);\n this.pos += 4;\n return value;\n};\n\n/**\n * Reads a double (64 bit float) as a number.\n * @function\n * @returns {number} Value read\n */\nReader.prototype.double = function read_double() {\n\n /* istanbul ignore if */\n if (this.pos + 8 > this.len)\n throw indexOutOfRange(this, 4);\n\n var value = util.float.readDoubleLE(this.buf, this.pos);\n this.pos += 8;\n return value;\n};\n\n/**\n * Reads a sequence of bytes preceeded by its length as a varint.\n * @returns {Uint8Array} Value read\n */\nReader.prototype.bytes = function read_bytes() {\n var length = this.uint32(),\n start = this.pos,\n end = this.pos + length;\n\n /* istanbul ignore if */\n if (end > this.len)\n throw indexOutOfRange(this, length);\n\n this.pos += length;\n if (Array.isArray(this.buf)) // plain array\n return this.buf.slice(start, end);\n\n if (start === end) { // fix for IE 10/Win8 and others' subarray returning array of size 1\n var nativeBuffer = util.Buffer;\n return nativeBuffer\n ? nativeBuffer.alloc(0)\n : new this.buf.constructor(0);\n }\n return this._slice.call(this.buf, start, end);\n};\n\n/**\n * Reads a string preceeded by its byte length as a varint.\n * @returns {string} Value read\n */\nReader.prototype.string = function read_string() {\n var bytes = this.bytes();\n return utf8.read(bytes, 0, bytes.length);\n};\n\n/**\n * Skips the specified number of bytes if specified, otherwise skips a varint.\n * @param {number} [length] Length if known, otherwise a varint is assumed\n * @returns {Reader} `this`\n */\nReader.prototype.skip = function skip(length) {\n if (typeof length === \"number\") {\n /* istanbul ignore if */\n if (this.pos + length > this.len)\n throw indexOutOfRange(this, length);\n this.pos += length;\n } else {\n do {\n /* istanbul ignore if */\n if (this.pos >= this.len)\n throw indexOutOfRange(this);\n } while (this.buf[this.pos++] & 128);\n }\n return this;\n};\n\n/**\n * Skips the next element of the specified wire type.\n * @param {number} wireType Wire type received\n * @returns {Reader} `this`\n */\nReader.prototype.skipType = function(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\n /* istanbul ignore next */\n default:\n throw Error(\"invalid wire type \" + wireType + \" at offset \" + this.pos);\n }\n return this;\n};\n\nReader._configure = function(BufferReader_) {\n BufferReader = BufferReader_;\n Reader.create = create();\n BufferReader._configure();\n\n var fn = util.Long ? \"toLong\" : /* istanbul ignore next */ \"toNumber\";\n util.merge(Reader.prototype, {\n\n int64: function read_int64() {\n return readLongVarint.call(this)[fn](false);\n },\n\n uint64: function read_uint64() {\n return readLongVarint.call(this)[fn](true);\n },\n\n sint64: function read_sint64() {\n return readLongVarint.call(this).zzDecode()[fn](false);\n },\n\n fixed64: function read_fixed64() {\n return readFixed64.call(this)[fn](true);\n },\n\n sfixed64: function read_sfixed64() {\n return readFixed64.call(this)[fn](false);\n }\n\n });\n};\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","\"use strict\";\n\n/**\n * Wrappers for common types.\n * @type {Object.}\n * @const\n */\nvar wrappers = exports;\n\nvar Message = require(\"./message\");\n\n/**\n * From object converter part of an {@link IWrapper}.\n * @typedef WrapperFromObjectConverter\n * @type {function}\n * @param {Object.} object Plain object\n * @returns {Message<{}>} Message instance\n * @this Type\n */\n\n/**\n * To object converter part of an {@link IWrapper}.\n * @typedef WrapperToObjectConverter\n * @type {function}\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n * @this Type\n */\n\n/**\n * Common type wrapper part of {@link wrappers}.\n * @interface IWrapper\n * @property {WrapperFromObjectConverter} [fromObject] From object converter\n * @property {WrapperToObjectConverter} [toObject] To object converter\n */\n\n// Custom wrapper for Any\nwrappers[\".google.protobuf.Any\"] = {\n\n fromObject: function(object) {\n\n // unwrap value type if mapped\n if (object && object[\"@type\"]) {\n // Only use fully qualified type name after the last '/'\n var name = object[\"@type\"].substring(object[\"@type\"].lastIndexOf(\"/\") + 1);\n var type = this.lookup(name);\n /* istanbul ignore else */\n if (type) {\n // type_url does not accept leading \".\"\n var type_url = object[\"@type\"].charAt(0) === \".\" ?\n object[\"@type\"].slice(1) : object[\"@type\"];\n // type_url prefix is optional, but path seperator is required\n if (type_url.indexOf(\"/\") === -1) {\n type_url = \"/\" + type_url;\n }\n return this.create({\n type_url: type_url,\n value: type.encode(type.fromObject(object)).finish()\n });\n }\n }\n\n return this.fromObject(object);\n },\n\n toObject: function(message, options) {\n\n // Default prefix\n var googleApi = \"type.googleapis.com/\";\n var prefix = \"\";\n var name = \"\";\n\n // decode value if requested and unmapped\n if (options && options.json && message.type_url && message.value) {\n // Only use fully qualified type name after the last '/'\n name = message.type_url.substring(message.type_url.lastIndexOf(\"/\") + 1);\n // Separate the prefix used\n prefix = message.type_url.substring(0, message.type_url.lastIndexOf(\"/\") + 1);\n var type = this.lookup(name);\n /* istanbul ignore else */\n if (type)\n message = type.decode(message.value);\n }\n\n // wrap value if unmapped\n if (!(message instanceof this.ctor) && message instanceof Message) {\n var object = message.$type.toObject(message, options);\n var messageName = message.$type.fullName[0] === \".\" ?\n message.$type.fullName.slice(1) : message.$type.fullName;\n // Default to type.googleapis.com prefix if no prefix is used\n if (prefix === \"\") {\n prefix = googleApi;\n }\n name = prefix + messageName;\n object[\"@type\"] = name;\n return object;\n }\n\n return this.toObject(message, options);\n }\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","'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","\"use strict\";\nmodule.exports = ReflectionObject;\n\nReflectionObject.className = \"ReflectionObject\";\n\nconst OneOf = require(\"./oneof\");\nvar util = require(\"./util\");\n\nvar Root; // cyclic\n\n/* eslint-disable no-warning-comments */\n// TODO: Replace with embedded proto.\nvar editions2023Defaults = {enum_type: \"OPEN\", field_presence: \"EXPLICIT\", json_format: \"ALLOW\", message_encoding: \"LENGTH_PREFIXED\", repeated_field_encoding: \"PACKED\", utf8_validation: \"VERIFY\"};\nvar proto2Defaults = {enum_type: \"CLOSED\", field_presence: \"EXPLICIT\", json_format: \"LEGACY_BEST_EFFORT\", message_encoding: \"LENGTH_PREFIXED\", repeated_field_encoding: \"EXPANDED\", utf8_validation: \"NONE\"};\nvar proto3Defaults = {enum_type: \"OPEN\", field_presence: \"IMPLICIT\", json_format: \"ALLOW\", message_encoding: \"LENGTH_PREFIXED\", repeated_field_encoding: \"PACKED\", utf8_validation: \"VERIFY\"};\n\n/**\n * Constructs a new reflection object instance.\n * @classdesc Base class of all reflection objects.\n * @constructor\n * @param {string} name Object name\n * @param {Object.} [options] Declared options\n * @abstract\n */\nfunction ReflectionObject(name, options) {\n\n if (!util.isString(name))\n throw TypeError(\"name must be a string\");\n\n if (options && !util.isObject(options))\n throw TypeError(\"options must be an object\");\n\n /**\n * Options.\n * @type {Object.|undefined}\n */\n this.options = options; // toJSON\n\n /**\n * Parsed Options.\n * @type {Array.>|undefined}\n */\n this.parsedOptions = null;\n\n /**\n * Unique name within its namespace.\n * @type {string}\n */\n this.name = name;\n\n /**\n * The edition specified for this object. Only relevant for top-level objects.\n * @type {string}\n */\n this._edition = null;\n\n /**\n * The default edition to use for this object if none is specified. For legacy reasons,\n * this is proto2 except in the JSON parsing case where it was proto3.\n * @type {string}\n */\n this._defaultEdition = \"proto2\";\n\n /**\n * Resolved Features.\n * @type {object}\n */\n this._features = {};\n\n /**\n * Parent namespace.\n * @type {Namespace|null}\n */\n this.parent = null;\n\n /**\n * Whether already resolved or not.\n * @type {boolean}\n */\n this.resolved = false;\n\n /**\n * Comment text, if any.\n * @type {string|null}\n */\n this.comment = null;\n\n /**\n * Defining file name.\n * @type {string|null}\n */\n this.filename = null;\n}\n\nObject.defineProperties(ReflectionObject.prototype, {\n\n /**\n * Reference to the root namespace.\n * @name ReflectionObject#root\n * @type {Root}\n * @readonly\n */\n root: {\n get: function() {\n var ptr = this;\n while (ptr.parent !== null)\n ptr = ptr.parent;\n return ptr;\n }\n },\n\n /**\n * Full name including leading dot.\n * @name ReflectionObject#fullName\n * @type {string}\n * @readonly\n */\n fullName: {\n get: function() {\n var path = [ this.name ],\n ptr = this.parent;\n while (ptr) {\n path.unshift(ptr.name);\n ptr = ptr.parent;\n }\n return path.join(\".\");\n }\n }\n});\n\n/**\n * Converts this reflection object to its descriptor representation.\n * @returns {Object.} Descriptor\n * @abstract\n */\nReflectionObject.prototype.toJSON = /* istanbul ignore next */ function toJSON() {\n throw Error(); // not implemented, shouldn't happen\n};\n\n/**\n * Called when this object is added to a parent.\n * @param {ReflectionObject} parent Parent added to\n * @returns {undefined}\n */\nReflectionObject.prototype.onAdd = function onAdd(parent) {\n if (this.parent && this.parent !== parent)\n this.parent.remove(this);\n this.parent = parent;\n this.resolved = false;\n var root = parent.root;\n if (root instanceof Root)\n root._handleAdd(this);\n};\n\n/**\n * Called when this object is removed from a parent.\n * @param {ReflectionObject} parent Parent removed from\n * @returns {undefined}\n */\nReflectionObject.prototype.onRemove = function onRemove(parent) {\n var root = parent.root;\n if (root instanceof Root)\n root._handleRemove(this);\n this.parent = null;\n this.resolved = false;\n};\n\n/**\n * Resolves this objects type references.\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n if (this instanceof Root) {\n this._resolveFeaturesRecursive(this._edition);\n this.resolved = true;\n }\n return this;\n};\n\n/**\n * Resolves this objects editions features.\n * @param {string} edition The edition we're currently resolving for.\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n return this._resolveFeatures(this._edition || edition);\n};\n\n/**\n * Resolves child features from parent features\n * @param {string} edition The edition we're currently resolving for.\n * @returns {undefined}\n */\nReflectionObject.prototype._resolveFeatures = function _resolveFeatures(edition) {\n var defaults = {};\n\n /* istanbul ignore if */\n if (!edition) {\n throw new Error(\"Unknown edition for \" + this.fullName);\n }\n\n var protoFeatures = Object.assign(this.options ? Object.assign({}, this.options.features) : {},\n this._inferLegacyProtoFeatures(edition));\n\n if (this._edition) {\n // For a namespace marked with a specific edition, reset defaults.\n /* istanbul ignore else */\n if (edition === \"proto2\") {\n defaults = Object.assign({}, proto2Defaults);\n } else if (edition === \"proto3\") {\n defaults = Object.assign({}, proto3Defaults);\n } else if (edition === \"2023\") {\n defaults = Object.assign({}, editions2023Defaults);\n } else {\n throw new Error(\"Unknown edition: \" + edition);\n }\n this._features = Object.assign(defaults, protoFeatures || {});\n return;\n }\n\n // fields in Oneofs aren't actually children of them, so we have to\n // special-case it\n /* istanbul ignore else */\n if (this.partOf instanceof OneOf) {\n var lexicalParentFeaturesCopy = Object.assign({}, this.partOf._features);\n this._features = Object.assign(lexicalParentFeaturesCopy, protoFeatures || {});\n } else if (this.declaringField) {\n // Skip feature resolution of sister fields.\n } else if (this.parent) {\n var parentFeaturesCopy = Object.assign({}, this.parent._features);\n this._features = Object.assign(parentFeaturesCopy, protoFeatures || {});\n } else {\n throw new Error(\"Unable to find a parent for \" + this.fullName);\n }\n if (this.extensionField) {\n // Sister fields should have the same features as their extensions.\n this.extensionField._features = this._features;\n }\n};\n\n/**\n * Infers features from legacy syntax that may have been specified differently.\n * in older editions.\n * @param {string|undefined} edition The edition this proto is on, or undefined if pre-editions\n * @returns {object} The feature values to override\n */\nReflectionObject.prototype._inferLegacyProtoFeatures = function _inferLegacyProtoFeatures(/*edition*/) {\n return {};\n};\n\n/**\n * Gets an option value.\n * @param {string} name Option name\n * @returns {*} Option value or `undefined` if not set\n */\nReflectionObject.prototype.getOption = function getOption(name) {\n if (this.options)\n return this.options[name];\n return undefined;\n};\n\n/**\n * Sets an option.\n * @param {string} name Option name\n * @param {*} value Option value\n * @param {boolean|undefined} [ifNotSet] Sets the option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOption = function setOption(name, value, ifNotSet) {\n if (!this.options)\n this.options = {};\n if (/^features\\./.test(name)) {\n util.setProperty(this.options, name, value, ifNotSet);\n } else if (!ifNotSet || this.options[name] === undefined) {\n if (this.getOption(name) !== value) this.resolved = false;\n this.options[name] = value;\n }\n\n return this;\n};\n\n/**\n * Sets a parsed option.\n * @param {string} name parsed Option name\n * @param {*} value Option value\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\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setParsedOption = function setParsedOption(name, value, propName) {\n if (!this.parsedOptions) {\n this.parsedOptions = [];\n }\n var parsedOptions = this.parsedOptions;\n if (propName) {\n // If setting a sub property of an option then try to merge it\n // with an existing option\n var opt = parsedOptions.find(function (opt) {\n return Object.prototype.hasOwnProperty.call(opt, name);\n });\n if (opt) {\n // If we found an existing option - just merge the property value\n // (If it's a feature, will just write over)\n var newValue = opt[name];\n util.setProperty(newValue, propName, value);\n } else {\n // otherwise, create a new option, set its property and add it to the list\n opt = {};\n opt[name] = util.setProperty({}, propName, value);\n parsedOptions.push(opt);\n }\n } else {\n // Always create a new option when setting the value of the option itself\n var newOpt = {};\n newOpt[name] = value;\n parsedOptions.push(newOpt);\n }\n\n return this;\n};\n\n/**\n * Sets multiple options.\n * @param {Object.} options Options to set\n * @param {boolean} [ifNotSet] Sets an option only if it isn't currently set\n * @returns {ReflectionObject} `this`\n */\nReflectionObject.prototype.setOptions = function setOptions(options, ifNotSet) {\n if (options)\n for (var keys = Object.keys(options), i = 0; i < keys.length; ++i)\n this.setOption(keys[i], options[keys[i]], ifNotSet);\n return this;\n};\n\n/**\n * Converts this instance to its string representation.\n * @returns {string} Class name[, space, full name]\n */\nReflectionObject.prototype.toString = function toString() {\n var className = this.constructor.className,\n fullName = this.fullName;\n if (fullName.length)\n return className + \" \" + fullName;\n return className;\n};\n\n/**\n * Converts the edition this object is pinned to for JSON format.\n * @returns {string|undefined} The edition string for JSON representation\n */\nReflectionObject.prototype._editionToJSON = function _editionToJSON() {\n if (!this._edition || this._edition === \"proto3\") {\n // Avoid emitting proto3 since we need to default to it for backwards\n // compatibility anyway.\n return undefined;\n }\n return this._edition;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nReflectionObject._configure = function(Root_) {\n Root = Root_;\n};\n","\"use strict\";\nmodule.exports = Service;\n\nvar util = require(\"../util/minimal\");\n\n// Extends EventEmitter\n(Service.prototype = Object.create(util.EventEmitter.prototype)).constructor = Service;\n\n/**\n * A service method callback as used by {@link rpc.ServiceMethod|ServiceMethod}.\n *\n * Differs from {@link RPCImplCallback} in that it is an actual callback of a service method which may not return `response = null`.\n * @typedef rpc.ServiceMethodCallback\n * @template TRes extends Message\n * @type {function}\n * @param {Error|null} error Error, if any\n * @param {TRes} [response] Response message\n * @returns {undefined}\n */\n\n/**\n * A service method part of a {@link rpc.Service} as created by {@link Service.create}.\n * @typedef rpc.ServiceMethod\n * @template TReq extends Message\n * @template TRes extends Message\n * @type {function}\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} [callback] Node-style callback called with the error, if any, and the response message\n * @returns {Promise>} Promise if `callback` has been omitted, otherwise `undefined`\n */\n\n/**\n * Constructs a new RPC service instance.\n * @classdesc An RPC service as returned by {@link Service#create}.\n * @exports rpc.Service\n * @extends util.EventEmitter\n * @constructor\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n */\nfunction Service(rpcImpl, requestDelimited, responseDelimited) {\n\n if (typeof rpcImpl !== \"function\")\n throw TypeError(\"rpcImpl must be a function\");\n\n util.EventEmitter.call(this);\n\n /**\n * RPC implementation. Becomes `null` once the service is ended.\n * @type {RPCImpl|null}\n */\n this.rpcImpl = rpcImpl;\n\n /**\n * Whether requests are length-delimited.\n * @type {boolean}\n */\n this.requestDelimited = Boolean(requestDelimited);\n\n /**\n * Whether responses are length-delimited.\n * @type {boolean}\n */\n this.responseDelimited = Boolean(responseDelimited);\n}\n\n/**\n * Calls a service method through {@link rpc.Service#rpcImpl|rpcImpl}.\n * @param {Method|rpc.ServiceMethod} method Reflected or static method\n * @param {Constructor} requestCtor Request constructor\n * @param {Constructor} responseCtor Response constructor\n * @param {TReq|Properties} request Request message or plain object\n * @param {rpc.ServiceMethodCallback} callback Service callback\n * @returns {undefined}\n * @template TReq extends Message\n * @template TRes extends Message\n */\nService.prototype.rpcCall = function rpcCall(method, requestCtor, responseCtor, request, callback) {\n\n if (!request)\n throw TypeError(\"request must be specified\");\n\n var self = this;\n if (!callback)\n return util.asPromise(rpcCall, self, method, requestCtor, responseCtor, request);\n\n if (!self.rpcImpl) {\n setTimeout(function() { callback(Error(\"already ended\")); }, 0);\n return undefined;\n }\n\n try {\n return self.rpcImpl(\n method,\n requestCtor[self.requestDelimited ? \"encodeDelimited\" : \"encode\"](request).finish(),\n function rpcCallback(err, response) {\n\n if (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n\n if (response === null) {\n self.end(/* endedByRPC */ true);\n return undefined;\n }\n\n if (!(response instanceof responseCtor)) {\n try {\n response = responseCtor[self.responseDelimited ? \"decodeDelimited\" : \"decode\"](response);\n } catch (err) {\n self.emit(\"error\", err, method);\n return callback(err);\n }\n }\n\n self.emit(\"data\", response, method);\n return callback(null, response);\n }\n );\n } catch (err) {\n self.emit(\"error\", err, method);\n setTimeout(function() { callback(err); }, 0);\n return undefined;\n }\n};\n\n/**\n * Ends this service and emits the `end` event.\n * @param {boolean} [endedByRPC=false] Whether the service has been ended by the RPC implementation.\n * @returns {rpc.Service} `this`\n */\nService.prototype.end = function end(endedByRPC) {\n if (this.rpcImpl) {\n if (!endedByRPC) // signal end to rpcImpl\n this.rpcImpl(null, null, null);\n this.rpcImpl = null;\n this.emit(\"end\").off();\n }\n return this;\n};\n","\"use strict\";\nmodule.exports = decoder;\n\nvar Enum = require(\"./enum\"),\n types = require(\"./types\"),\n util = require(\"./util\");\n\nfunction missing(field) {\n return \"missing required '\" + field.name + \"'\";\n}\n\n/**\n * Generates a decoder specific to the specified message type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nfunction decoder(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"r\", \"l\", \"e\"], mtype.name + \"$decode\")\n (\"if(!(r instanceof Reader))\")\n (\"r=Reader.create(r)\")\n (\"var c=l===undefined?r.len:r.pos+l,m=new this.ctor\" + (mtype.fieldsArray.filter(function(field) { return field.map; }).length ? \",k,value\" : \"\"))\n (\"while(r.pos>>3){\");\n\n var i = 0;\n for (; i < /* initializes */ mtype.fieldsArray.length; ++i) {\n var field = mtype._fieldsArray[i].resolve(),\n type = field.resolvedType instanceof Enum ? \"int32\" : field.type,\n ref = \"m\" + util.safeProp(field.name); gen\n (\"case %i: {\", field.id);\n\n // Map fields\n if (field.map) { gen\n (\"if(%s===util.emptyObject)\", ref)\n (\"%s={}\", ref)\n (\"var c2 = r.uint32()+r.pos\");\n\n if (types.defaults[field.keyType] !== undefined) gen\n (\"k=%j\", types.defaults[field.keyType]);\n else gen\n (\"k=null\");\n\n if (types.defaults[type] !== undefined) gen\n (\"value=%j\", types.defaults[type]);\n else gen\n (\"value=null\");\n\n gen\n (\"while(r.pos>>3){\")\n (\"case 1: k=r.%s(); break\", field.keyType)\n (\"case 2:\");\n\n if (types.basic[type] === undefined) gen\n (\"value=types[%i].decode(r,r.uint32())\", i); // can't be groups\n else gen\n (\"value=r.%s()\", type);\n\n gen\n (\"break\")\n (\"default:\")\n (\"r.skipType(tag2&7)\")\n (\"break\")\n (\"}\")\n (\"}\");\n\n if (types.long[field.keyType] !== undefined) gen\n (\"%s[typeof k===\\\"object\\\"?util.longToHash(k):k]=value\", ref);\n else gen\n (\"%s[k]=value\", ref);\n\n // Repeated fields\n } else if (field.repeated) { gen\n\n (\"if(!(%s&&%s.length))\", ref, ref)\n (\"%s=[]\", ref);\n\n // Packable (always check for forward and backward compatiblity)\n if (types.packed[type] !== undefined) gen\n (\"if((t&7)===2){\")\n (\"var c2=r.uint32()+r.pos\")\n (\"while(r.pos {\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\tlet m;\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\t// eslint-disable-next-line no-return-assign\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 && (m = navigator.userAgent.toLowerCase().match(/firefox\\/(\\d+)/)) && parseInt(m[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","\"use strict\";\nmodule.exports = Type;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Type.prototype = Object.create(Namespace.prototype)).constructor = Type).className = \"Type\";\n\nvar Enum = require(\"./enum\"),\n OneOf = require(\"./oneof\"),\n Field = require(\"./field\"),\n MapField = require(\"./mapfield\"),\n Service = require(\"./service\"),\n Message = require(\"./message\"),\n Reader = require(\"./reader\"),\n Writer = require(\"./writer\"),\n util = require(\"./util\"),\n encoder = require(\"./encoder\"),\n decoder = require(\"./decoder\"),\n verifier = require(\"./verifier\"),\n converter = require(\"./converter\"),\n wrappers = require(\"./wrappers\");\n\n/**\n * Constructs a new reflected message type instance.\n * @classdesc Reflected message type.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Message name\n * @param {Object.} [options] Declared options\n */\nfunction Type(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Message fields.\n * @type {Object.}\n */\n this.fields = {}; // toJSON, marker\n\n /**\n * Oneofs declared within this namespace, if any.\n * @type {Object.}\n */\n this.oneofs = undefined; // toJSON\n\n /**\n * Extension ranges, if any.\n * @type {number[][]}\n */\n this.extensions = undefined; // toJSON\n\n /**\n * Reserved ranges, if any.\n * @type {Array.}\n */\n this.reserved = undefined; // toJSON\n\n /*?\n * Whether this type is a legacy group.\n * @type {boolean|undefined}\n */\n this.group = undefined; // toJSON\n\n /**\n * Cached fields by id.\n * @type {Object.|null}\n * @private\n */\n this._fieldsById = null;\n\n /**\n * Cached fields as an array.\n * @type {Field[]|null}\n * @private\n */\n this._fieldsArray = null;\n\n /**\n * Cached oneofs as an array.\n * @type {OneOf[]|null}\n * @private\n */\n this._oneofsArray = null;\n\n /**\n * Cached constructor.\n * @type {Constructor<{}>}\n * @private\n */\n this._ctor = null;\n}\n\nObject.defineProperties(Type.prototype, {\n\n /**\n * Message fields by id.\n * @name Type#fieldsById\n * @type {Object.}\n * @readonly\n */\n fieldsById: {\n get: function() {\n\n /* istanbul ignore if */\n if (this._fieldsById)\n return this._fieldsById;\n\n this._fieldsById = {};\n for (var names = Object.keys(this.fields), i = 0; i < names.length; ++i) {\n var field = this.fields[names[i]],\n id = field.id;\n\n /* istanbul ignore if */\n if (this._fieldsById[id])\n throw Error(\"duplicate id \" + id + \" in \" + this);\n\n this._fieldsById[id] = field;\n }\n return this._fieldsById;\n }\n },\n\n /**\n * Fields of this message as an array for iteration.\n * @name Type#fieldsArray\n * @type {Field[]}\n * @readonly\n */\n fieldsArray: {\n get: function() {\n return this._fieldsArray || (this._fieldsArray = util.toArray(this.fields));\n }\n },\n\n /**\n * Oneofs of this message as an array for iteration.\n * @name Type#oneofsArray\n * @type {OneOf[]}\n * @readonly\n */\n oneofsArray: {\n get: function() {\n return this._oneofsArray || (this._oneofsArray = util.toArray(this.oneofs));\n }\n },\n\n /**\n * The registered constructor, if any registered, otherwise a generic constructor.\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.\n * @name Type#ctor\n * @type {Constructor<{}>}\n */\n ctor: {\n get: function() {\n return this._ctor || (this.ctor = Type.generateConstructor(this)());\n },\n set: function(ctor) {\n\n // Ensure proper prototype\n var prototype = ctor.prototype;\n if (!(prototype instanceof Message)) {\n (ctor.prototype = new Message()).constructor = ctor;\n util.merge(ctor.prototype, prototype);\n }\n\n // Classes and messages reference their reflected type\n ctor.$type = ctor.prototype.$type = this;\n\n // Mix in static methods\n util.merge(ctor, Message, true);\n\n this._ctor = ctor;\n\n // Messages have non-enumerable default values on their prototype\n var i = 0;\n for (; i < /* initializes */ this.fieldsArray.length; ++i)\n this._fieldsArray[i].resolve(); // ensures a proper value\n\n // Messages have non-enumerable getters and setters for each virtual oneof field\n var ctorProperties = {};\n for (i = 0; i < /* initializes */ this.oneofsArray.length; ++i)\n ctorProperties[this._oneofsArray[i].resolve().name] = {\n get: util.oneOfGetter(this._oneofsArray[i].oneof),\n set: util.oneOfSetter(this._oneofsArray[i].oneof)\n };\n if (i)\n Object.defineProperties(ctor.prototype, ctorProperties);\n }\n }\n});\n\n/**\n * Generates a constructor function for the specified type.\n * @param {Type} mtype Message type\n * @returns {Codegen} Codegen instance\n */\nType.generateConstructor = function generateConstructor(mtype) {\n /* eslint-disable no-unexpected-multiline */\n var gen = util.codegen([\"p\"], mtype.name);\n // explicitly initialize mutable object/array fields so that these aren't just inherited from the prototype\n for (var i = 0, field; i < mtype.fieldsArray.length; ++i)\n if ((field = mtype._fieldsArray[i]).map) gen\n (\"this%s={}\", util.safeProp(field.name));\n else if (field.repeated) gen\n (\"this%s=[]\", util.safeProp(field.name));\n return gen\n (\"if(p)for(var ks=Object.keys(p),i=0;i} [oneofs] Oneof descriptors\n * @property {Object.} fields Field descriptors\n * @property {number[][]} [extensions] Extension ranges\n * @property {Array.} [reserved] Reserved ranges\n * @property {boolean} [group=false] Whether a legacy group or not\n */\n\n/**\n * Creates a message type from a message type descriptor.\n * @param {string} name Message name\n * @param {IType} json Message type descriptor\n * @returns {Type} Created message type\n */\nType.fromJSON = function fromJSON(name, json) {\n var type = new Type(name, json.options);\n type.extensions = json.extensions;\n type.reserved = json.reserved;\n var names = Object.keys(json.fields),\n i = 0;\n for (; i < names.length; ++i)\n type.add(\n ( typeof json.fields[names[i]].keyType !== \"undefined\"\n ? MapField.fromJSON\n : Field.fromJSON )(names[i], json.fields[names[i]])\n );\n if (json.oneofs)\n for (names = Object.keys(json.oneofs), i = 0; i < names.length; ++i)\n type.add(OneOf.fromJSON(names[i], json.oneofs[names[i]]));\n if (json.nested)\n for (names = Object.keys(json.nested), i = 0; i < names.length; ++i) {\n var nested = json.nested[names[i]];\n type.add( // most to least likely\n ( nested.id !== undefined\n ? Field.fromJSON\n : nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n if (json.extensions && json.extensions.length)\n type.extensions = json.extensions;\n if (json.reserved && json.reserved.length)\n type.reserved = json.reserved;\n if (json.group)\n type.group = true;\n if (json.comment)\n type.comment = json.comment;\n if (json.edition)\n type._edition = json.edition;\n type._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return type;\n};\n\n/**\n * Converts this message type to a message type descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IType} Message type descriptor\n */\nType.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"options\" , inherited && inherited.options || undefined,\n \"oneofs\" , Namespace.arrayToJSON(this.oneofsArray, toJSONOptions),\n \"fields\" , Namespace.arrayToJSON(this.fieldsArray.filter(function(obj) { return !obj.declaringField; }), toJSONOptions) || {},\n \"extensions\" , this.extensions && this.extensions.length ? this.extensions : undefined,\n \"reserved\" , this.reserved && this.reserved.length ? this.reserved : undefined,\n \"group\" , this.group || undefined,\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nType.prototype.resolveAll = function resolveAll() {\n Namespace.prototype.resolveAll.call(this);\n var oneofs = this.oneofsArray; i = 0;\n while (i < oneofs.length)\n oneofs[i++].resolve();\n var fields = this.fieldsArray, i = 0;\n while (i < fields.length)\n fields[i++].resolve();\n return this;\n};\n\n/**\n * @override\n */\nType.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n edition = this._edition || edition;\n\n Namespace.prototype._resolveFeaturesRecursive.call(this, edition);\n this.oneofsArray.forEach(oneof => {\n oneof._resolveFeatures(edition);\n });\n this.fieldsArray.forEach(field => {\n field._resolveFeatures(edition);\n });\n return this;\n};\n\n/**\n * @override\n */\nType.prototype.get = function get(name) {\n return this.fields[name]\n || this.oneofs && this.oneofs[name]\n || this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Adds a nested object to this type.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\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\n */\nType.prototype.add = function add(object) {\n\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Field && object.extend === undefined) {\n // NOTE: Extension fields aren't actual fields on the declaring type, but nested objects.\n // The root object takes care of adding distinct sister-fields to the respective extended\n // type instead.\n\n // avoids calling the getter if not absolutely necessary because it's called quite frequently\n if (this._fieldsById ? /* istanbul ignore next */ this._fieldsById[object.id] : this.fieldsById[object.id])\n throw Error(\"duplicate id \" + object.id + \" in \" + this);\n if (this.isReservedId(object.id))\n throw Error(\"id \" + object.id + \" is reserved in \" + this);\n if (this.isReservedName(object.name))\n throw Error(\"name '\" + object.name + \"' is reserved in \" + this);\n\n if (object.parent)\n object.parent.remove(object);\n this.fields[object.name] = object;\n object.message = this;\n object.onAdd(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n if (!this.oneofs)\n this.oneofs = {};\n this.oneofs[object.name] = object;\n object.onAdd(this);\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * Removes a nested object from this type.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Type} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this type\n */\nType.prototype.remove = function remove(object) {\n if (object instanceof Field && object.extend === undefined) {\n // See Type#add for the reason why extension fields are excluded here.\n\n /* istanbul ignore if */\n if (!this.fields || this.fields[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.fields[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n if (object instanceof OneOf) {\n\n /* istanbul ignore if */\n if (!this.oneofs || this.oneofs[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.oneofs[object.name];\n object.parent = null;\n object.onRemove(this);\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Tests if the specified id is reserved.\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedId = function isReservedId(id) {\n return Namespace.isReservedId(this.reserved, id);\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nType.prototype.isReservedName = function isReservedName(name) {\n return Namespace.isReservedName(this.reserved, name);\n};\n\n/**\n * Creates a new message of this type using the specified properties.\n * @param {Object.} [properties] Properties to set\n * @returns {Message<{}>} Message instance\n */\nType.prototype.create = function create(properties) {\n return new this.ctor(properties);\n};\n\n/**\n * Sets up {@link Type#encode|encode}, {@link Type#decode|decode} and {@link Type#verify|verify}.\n * @returns {Type} `this`\n */\nType.prototype.setup = function setup() {\n // Sets up everything at once so that the prototype chain does not have to be re-evaluated\n // multiple times (V8, soft-deopt prototype-check).\n\n var fullName = this.fullName,\n types = [];\n for (var i = 0; i < /* initializes */ this.fieldsArray.length; ++i)\n types.push(this._fieldsArray[i].resolve().resolvedType);\n\n // Replace setup methods with type-specific generated functions\n this.encode = encoder(this)({\n Writer : Writer,\n types : types,\n util : util\n });\n this.decode = decoder(this)({\n Reader : Reader,\n types : types,\n util : util\n });\n this.verify = verifier(this)({\n types : types,\n util : util\n });\n this.fromObject = converter.fromObject(this)({\n types : types,\n util : util\n });\n this.toObject = converter.toObject(this)({\n types : types,\n util : util\n });\n\n // Inject custom wrappers for common types\n var wrapper = wrappers[fullName];\n if (wrapper) {\n var originalThis = Object.create(this);\n // if (wrapper.fromObject) {\n originalThis.fromObject = this.fromObject;\n this.fromObject = wrapper.fromObject.bind(originalThis);\n // }\n // if (wrapper.toObject) {\n originalThis.toObject = this.toObject;\n this.toObject = wrapper.toObject.bind(originalThis);\n // }\n }\n\n return this;\n};\n\n/**\n * Encodes a message of this type. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encode = function encode_setup(message, writer) {\n return this.setup().encode(message, writer); // overrides this method\n};\n\n/**\n * Encodes a message of this type preceeded by its byte length as a varint. Does not implicitly {@link Type#verify|verify} messages.\n * @param {Message<{}>|Object.} message Message instance or plain object\n * @param {Writer} [writer] Writer to encode to\n * @returns {Writer} writer\n */\nType.prototype.encodeDelimited = function encodeDelimited(message, writer) {\n return this.encode(message, writer && writer.len ? writer.fork() : writer).ldelim();\n};\n\n/**\n * Decodes a message of this type.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @param {number} [length] Length of the message, if known beforehand\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError<{}>} If required fields are missing\n */\nType.prototype.decode = function decode_setup(reader, length) {\n return this.setup().decode(reader, length); // overrides this method\n};\n\n/**\n * Decodes a message of this type preceeded by its byte length as a varint.\n * @param {Reader|Uint8Array} reader Reader or buffer to decode from\n * @returns {Message<{}>} Decoded message\n * @throws {Error} If the payload is not a reader or valid buffer\n * @throws {util.ProtocolError} If required fields are missing\n */\nType.prototype.decodeDelimited = function decodeDelimited(reader) {\n if (!(reader instanceof Reader))\n reader = Reader.create(reader);\n return this.decode(reader, reader.uint32());\n};\n\n/**\n * Verifies that field values are valid and that required fields are present.\n * @param {Object.} message Plain object to verify\n * @returns {null|string} `null` if valid, otherwise the reason why it is not\n */\nType.prototype.verify = function verify_setup(message) {\n return this.setup().verify(message); // overrides this method\n};\n\n/**\n * Creates a new message of this type from a plain object. Also converts values to their respective internal types.\n * @param {Object.} object Plain object to convert\n * @returns {Message<{}>} Message instance\n */\nType.prototype.fromObject = function fromObject(object) {\n return this.setup().fromObject(object);\n};\n\n/**\n * Conversion options as used by {@link Type#toObject} and {@link Message.toObject}.\n * @interface IConversionOptions\n * @property {Function} [longs] Long conversion type.\n * Valid values are `String` and `Number` (the global types).\n * Defaults to copy the present value, which is a possibly unsafe number without and a {@link Long} with a long library.\n * @property {Function} [enums] Enum value conversion type.\n * Only valid value is `String` (the global type).\n * Defaults to copy the present value, which is the numeric id.\n * @property {Function} [bytes] Bytes value conversion type.\n * Valid values are `Array` and (a base64 encoded) `String` (the global types).\n * Defaults to copy the present value, which usually is a Buffer under node and an Uint8Array in the browser.\n * @property {boolean} [defaults=false] Also sets default values on the resulting object\n * @property {boolean} [arrays=false] Sets empty arrays for missing repeated fields even if `defaults=false`\n * @property {boolean} [objects=false] Sets empty objects for missing map fields even if `defaults=false`\n * @property {boolean} [oneofs=false] Includes virtual oneof properties set to the present field's name, if any\n * @property {boolean} [json=false] Performs additional JSON compatibility conversions, i.e. NaN and Infinity to strings\n */\n\n/**\n * Creates a plain object from a message of this type. Also converts values to other types if specified.\n * @param {Message<{}>} message Message instance\n * @param {IConversionOptions} [options] Conversion options\n * @returns {Object.} Plain object\n */\nType.prototype.toObject = function toObject(message, options) {\n return this.setup().toObject(message, options);\n};\n\n/**\n * Decorator function as returned by {@link Type.d} (TypeScript).\n * @typedef TypeDecorator\n * @type {function}\n * @param {Constructor} target Target constructor\n * @returns {undefined}\n * @template T extends Message\n */\n\n/**\n * Type decorator (TypeScript).\n * @param {string} [typeName] Type name, defaults to the constructor's name\n * @returns {TypeDecorator} Decorator function\n * @template T extends Message\n */\nType.d = function decorateType(typeName) {\n return function typeDecorator(target) {\n util.decorateType(target, typeName);\n };\n};\n","\"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\";\nmodule.exports = MapField;\n\n// extends Field\nvar Field = require(\"./field\");\n((MapField.prototype = Object.create(Field.prototype)).constructor = MapField).className = \"MapField\";\n\nvar types = require(\"./types\"),\n util = require(\"./util\");\n\n/**\n * Constructs a new map field instance.\n * @classdesc Reflected map field.\n * @extends FieldBase\n * @constructor\n * @param {string} name Unique name within its namespace\n * @param {number} id Unique id within its namespace\n * @param {string} keyType Key type\n * @param {string} type Value type\n * @param {Object.} [options] Declared options\n * @param {string} [comment] Comment associated with this field\n */\nfunction MapField(name, id, keyType, type, options, comment) {\n Field.call(this, name, id, type, undefined, undefined, options, comment);\n\n /* istanbul ignore if */\n if (!util.isString(keyType))\n throw TypeError(\"keyType must be a string\");\n\n /**\n * Key type.\n * @type {string}\n */\n this.keyType = keyType; // toJSON, marker\n\n /**\n * Resolved key type if not a basic type.\n * @type {ReflectionObject|null}\n */\n this.resolvedKeyType = null;\n\n // Overrides Field#map\n this.map = true;\n}\n\n/**\n * Map field descriptor.\n * @interface IMapField\n * @extends {IField}\n * @property {string} keyType Key type\n */\n\n/**\n * Extension map field descriptor.\n * @interface IExtensionMapField\n * @extends IMapField\n * @property {string} extend Extended type\n */\n\n/**\n * Constructs a map field from a map field descriptor.\n * @param {string} name Field name\n * @param {IMapField} json Map field descriptor\n * @returns {MapField} Created map field\n * @throws {TypeError} If arguments are invalid\n */\nMapField.fromJSON = function fromJSON(name, json) {\n return new MapField(name, json.id, json.keyType, json.type, json.options, json.comment);\n};\n\n/**\n * Converts this map field to a map field descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMapField} Map field descriptor\n */\nMapField.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"keyType\" , this.keyType,\n \"type\" , this.type,\n \"id\" , this.id,\n \"extend\" , this.extend,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * @override\n */\nMapField.prototype.resolve = function resolve() {\n if (this.resolved)\n return this;\n\n // Besides a value type, map fields have a key type that may be \"any scalar type except for floating point types and bytes\"\n if (types.mapKey[this.keyType] === undefined)\n throw Error(\"invalid key type: \" + this.keyType);\n\n return Field.prototype.resolve.call(this);\n};\n\n/**\n * Map field decorator (TypeScript).\n * @name MapField.d\n * @function\n * @param {number} fieldId Field id\n * @param {\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"} fieldKeyType Field key type\n * @param {\"double\"|\"float\"|\"int32\"|\"uint32\"|\"sint32\"|\"fixed32\"|\"sfixed32\"|\"int64\"|\"uint64\"|\"sint64\"|\"fixed64\"|\"sfixed64\"|\"bool\"|\"string\"|\"bytes\"|Object|Constructor<{}>} fieldValueType Field value type\n * @returns {FieldDecorator} Decorator function\n * @template T extends { [key: string]: number | Long | string | boolean | Uint8Array | Buffer | number[] | Message<{}> }\n */\nMapField.d = function decorateMapField(fieldId, fieldKeyType, fieldValueType) {\n\n // submessage value: decorate the submessage and use its name as the type\n if (typeof fieldValueType === \"function\")\n fieldValueType = util.decorateType(fieldValueType).name;\n\n // enum reference value: create a reflected copy of the enum and keep reuseing it\n else if (fieldValueType && typeof fieldValueType === \"object\")\n fieldValueType = util.decorateEnum(fieldValueType).name;\n\n return function mapFieldDecorator(prototype, fieldName) {\n util.decorateType(prototype.constructor)\n .add(new MapField(fieldName, fieldId, fieldKeyType, fieldValueType));\n };\n};\n","var RetryOperation = require('./retry_operation');\n\nexports.operation = function(options) {\n var timeouts = exports.timeouts(options);\n return new RetryOperation(timeouts, {\n forever: options && (options.forever || options.retries === Infinity),\n unref: options && options.unref,\n maxRetryTime: options && options.maxRetryTime\n });\n};\n\nexports.timeouts = function(options) {\n if (options instanceof Array) {\n return [].concat(options);\n }\n\n var opts = {\n retries: 10,\n factor: 2,\n minTimeout: 1 * 1000,\n maxTimeout: Infinity,\n randomize: false\n };\n for (var key in options) {\n opts[key] = options[key];\n }\n\n if (opts.minTimeout > opts.maxTimeout) {\n throw new Error('minTimeout is greater than maxTimeout');\n }\n\n var timeouts = [];\n for (var i = 0; i < opts.retries; i++) {\n timeouts.push(this.createTimeout(i, opts));\n }\n\n if (options && options.forever && !timeouts.length) {\n timeouts.push(this.createTimeout(i, opts));\n }\n\n // sort the array numerically ascending\n timeouts.sort(function(a,b) {\n return a - b;\n });\n\n return timeouts;\n};\n\nexports.createTimeout = function(attempt, opts) {\n var random = (opts.randomize)\n ? (Math.random() + 1)\n : 1;\n\n var timeout = Math.round(random * Math.max(opts.minTimeout, 1) * Math.pow(opts.factor, attempt));\n timeout = Math.min(timeout, opts.maxTimeout);\n\n return timeout;\n};\n\nexports.wrap = function(obj, options, methods) {\n if (options instanceof Array) {\n methods = options;\n options = null;\n }\n\n if (!methods) {\n methods = [];\n for (var key in obj) {\n if (typeof obj[key] === 'function') {\n methods.push(key);\n }\n }\n }\n\n for (var i = 0; i < methods.length; i++) {\n var method = methods[i];\n var original = obj[method];\n\n obj[method] = function retryWrapper(original) {\n var op = exports.operation(options);\n var args = Array.prototype.slice.call(arguments, 1);\n var callback = args.pop();\n\n args.push(function(err) {\n if (op.retry(err)) {\n return;\n }\n if (err) {\n arguments[0] = op.mainError();\n }\n callback.apply(this, arguments);\n });\n\n op.attempt(function() {\n original.apply(obj, args);\n });\n }.bind(obj, original);\n obj[method].options = options;\n }\n};\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\";\nmodule.exports = Method;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Method.prototype = Object.create(ReflectionObject.prototype)).constructor = Method).className = \"Method\";\n\nvar util = require(\"./util\");\n\n/**\n * Constructs a new service method instance.\n * @classdesc Reflected service method.\n * @extends ReflectionObject\n * @constructor\n * @param {string} name Method name\n * @param {string|undefined} type Method type, usually `\"rpc\"`\n * @param {string} requestType Request message type\n * @param {string} responseType Response message type\n * @param {boolean|Object.} [requestStream] Whether the request is streamed\n * @param {boolean|Object.} [responseStream] Whether the response is streamed\n * @param {Object.} [options] Declared options\n * @param {string} [comment] The comment for this method\n * @param {Object.} [parsedOptions] Declared options, properly parsed into an object\n */\nfunction Method(name, type, requestType, responseType, requestStream, responseStream, options, comment, parsedOptions) {\n\n /* istanbul ignore next */\n if (util.isObject(requestStream)) {\n options = requestStream;\n requestStream = responseStream = undefined;\n } else if (util.isObject(responseStream)) {\n options = responseStream;\n responseStream = undefined;\n }\n\n /* istanbul ignore if */\n if (!(type === undefined || util.isString(type)))\n throw TypeError(\"type must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(requestType))\n throw TypeError(\"requestType must be a string\");\n\n /* istanbul ignore if */\n if (!util.isString(responseType))\n throw TypeError(\"responseType must be a string\");\n\n ReflectionObject.call(this, name, options);\n\n /**\n * Method type.\n * @type {string}\n */\n this.type = type || \"rpc\"; // toJSON\n\n /**\n * Request type.\n * @type {string}\n */\n this.requestType = requestType; // toJSON, marker\n\n /**\n * Whether requests are streamed or not.\n * @type {boolean|undefined}\n */\n this.requestStream = requestStream ? true : undefined; // toJSON\n\n /**\n * Response type.\n * @type {string}\n */\n this.responseType = responseType; // toJSON\n\n /**\n * Whether responses are streamed or not.\n * @type {boolean|undefined}\n */\n this.responseStream = responseStream ? true : undefined; // toJSON\n\n /**\n * Resolved request type.\n * @type {Type|null}\n */\n this.resolvedRequestType = null;\n\n /**\n * Resolved response type.\n * @type {Type|null}\n */\n this.resolvedResponseType = null;\n\n /**\n * Comment for this method\n * @type {string|null}\n */\n this.comment = comment;\n\n /**\n * Options properly parsed into an object\n */\n this.parsedOptions = parsedOptions;\n}\n\n/**\n * Method descriptor.\n * @interface IMethod\n * @property {string} [type=\"rpc\"] Method type\n * @property {string} requestType Request type\n * @property {string} responseType Response type\n * @property {boolean} [requestStream=false] Whether requests are streamed\n * @property {boolean} [responseStream=false] Whether responses are streamed\n * @property {Object.} [options] Method options\n * @property {string} comment Method comments\n * @property {Object.} [parsedOptions] Method options properly parsed into an object\n */\n\n/**\n * Constructs a method from a method descriptor.\n * @param {string} name Method name\n * @param {IMethod} json Method descriptor\n * @returns {Method} Created method\n * @throws {TypeError} If arguments are invalid\n */\nMethod.fromJSON = function fromJSON(name, json) {\n return new Method(name, json.type, json.requestType, json.responseType, json.requestStream, json.responseStream, json.options, json.comment, json.parsedOptions);\n};\n\n/**\n * Converts this method to a method descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IMethod} Method descriptor\n */\nMethod.prototype.toJSON = function toJSON(toJSONOptions) {\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"type\" , this.type !== \"rpc\" && /* istanbul ignore next */ this.type || undefined,\n \"requestType\" , this.requestType,\n \"requestStream\" , this.requestStream,\n \"responseType\" , this.responseType,\n \"responseStream\" , this.responseStream,\n \"options\" , this.options,\n \"comment\" , keepComments ? this.comment : undefined,\n \"parsedOptions\" , this.parsedOptions,\n ]);\n};\n\n/**\n * @override\n */\nMethod.prototype.resolve = function resolve() {\n\n /* istanbul ignore if */\n if (this.resolved)\n return this;\n\n this.resolvedRequestType = this.parent.lookupType(this.requestType);\n this.resolvedResponseType = this.parent.lookupType(this.responseType);\n\n return ReflectionObject.prototype.resolve.call(this);\n};\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\";\nmodule.exports = Namespace;\n\n// extends ReflectionObject\nvar ReflectionObject = require(\"./object\");\n((Namespace.prototype = Object.create(ReflectionObject.prototype)).constructor = Namespace).className = \"Namespace\";\n\nvar Field = require(\"./field\"),\n util = require(\"./util\"),\n OneOf = require(\"./oneof\");\n\nvar Type, // cyclic\n Service,\n Enum;\n\n/**\n * Constructs a new namespace instance.\n * @name Namespace\n * @classdesc Reflected namespace.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n */\n\n/**\n * Constructs a namespace from JSON.\n * @memberof Namespace\n * @function\n * @param {string} name Namespace name\n * @param {Object.} json JSON object\n * @returns {Namespace} Created namespace\n * @throws {TypeError} If arguments are invalid\n */\nNamespace.fromJSON = function fromJSON(name, json) {\n return new Namespace(name, json.options).addJSON(json.nested);\n};\n\n/**\n * Converts an array of reflection objects to JSON.\n * @memberof Namespace\n * @param {ReflectionObject[]} array Object array\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {Object.|undefined} JSON object or `undefined` when array is empty\n */\nfunction arrayToJSON(array, toJSONOptions) {\n if (!(array && array.length))\n return undefined;\n var obj = {};\n for (var i = 0; i < array.length; ++i)\n obj[array[i].name] = array[i].toJSON(toJSONOptions);\n return obj;\n}\n\nNamespace.arrayToJSON = arrayToJSON;\n\n/**\n * Tests if the specified id is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {number} id Id to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedId = function isReservedId(reserved, id) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (typeof reserved[i] !== \"string\" && reserved[i][0] <= id && reserved[i][1] > id)\n return true;\n return false;\n};\n\n/**\n * Tests if the specified name is reserved.\n * @param {Array.|undefined} reserved Array of reserved ranges and names\n * @param {string} name Name to test\n * @returns {boolean} `true` if reserved, otherwise `false`\n */\nNamespace.isReservedName = function isReservedName(reserved, name) {\n if (reserved)\n for (var i = 0; i < reserved.length; ++i)\n if (reserved[i] === name)\n return true;\n return false;\n};\n\n/**\n * Not an actual constructor. Use {@link Namespace} instead.\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.\n * @exports NamespaceBase\n * @extends ReflectionObject\n * @abstract\n * @constructor\n * @param {string} name Namespace name\n * @param {Object.} [options] Declared options\n * @see {@link Namespace}\n */\nfunction Namespace(name, options) {\n ReflectionObject.call(this, name, options);\n\n /**\n * Nested objects by name.\n * @type {Object.|undefined}\n */\n this.nested = undefined; // toJSON\n\n /**\n * Cached nested objects as an array.\n * @type {ReflectionObject[]|null}\n * @private\n */\n this._nestedArray = null;\n}\n\nfunction clearCache(namespace) {\n namespace._nestedArray = null;\n return namespace;\n}\n\n/**\n * Nested objects of this namespace as an array for iteration.\n * @name NamespaceBase#nestedArray\n * @type {ReflectionObject[]}\n * @readonly\n */\nObject.defineProperty(Namespace.prototype, \"nestedArray\", {\n get: function() {\n return this._nestedArray || (this._nestedArray = util.toArray(this.nested));\n }\n});\n\n/**\n * Namespace descriptor.\n * @interface INamespace\n * @property {Object.} [options] Namespace options\n * @property {Object.} [nested] Nested object descriptors\n */\n\n/**\n * Any extension field descriptor.\n * @typedef AnyExtensionField\n * @type {IExtensionField|IExtensionMapField}\n */\n\n/**\n * Any nested object descriptor.\n * @typedef AnyNestedObject\n * @type {IEnum|IType|IService|AnyExtensionField|INamespace|IOneOf}\n */\n\n/**\n * Converts this namespace to a namespace descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {INamespace} Namespace descriptor\n */\nNamespace.prototype.toJSON = function toJSON(toJSONOptions) {\n return util.toObject([\n \"options\" , this.options,\n \"nested\" , arrayToJSON(this.nestedArray, toJSONOptions)\n ]);\n};\n\n/**\n * Adds nested objects to this namespace from nested object descriptors.\n * @param {Object.} nestedJson Any nested object descriptors\n * @returns {Namespace} `this`\n */\nNamespace.prototype.addJSON = function addJSON(nestedJson) {\n var ns = this;\n /* istanbul ignore else */\n if (nestedJson) {\n for (var names = Object.keys(nestedJson), i = 0, nested; i < names.length; ++i) {\n nested = nestedJson[names[i]];\n ns.add( // most to least likely\n ( nested.fields !== undefined\n ? Type.fromJSON\n : nested.values !== undefined\n ? Enum.fromJSON\n : nested.methods !== undefined\n ? Service.fromJSON\n : nested.id !== undefined\n ? Field.fromJSON\n : Namespace.fromJSON )(names[i], nested)\n );\n }\n }\n return this;\n};\n\n/**\n * Gets the nested object of the specified name.\n * @param {string} name Nested object name\n * @returns {ReflectionObject|null} The reflection object or `null` if it doesn't exist\n */\nNamespace.prototype.get = function get(name) {\n return this.nested && this.nested[name]\n || null;\n};\n\n/**\n * Gets the values of the nested {@link Enum|enum} of the specified name.\n * This methods differs from {@link Namespace#get|get} in that it returns an enum's values directly and throws instead of returning `null`.\n * @param {string} name Nested enum name\n * @returns {Object.} Enum values\n * @throws {Error} If there is no such enum\n */\nNamespace.prototype.getEnum = function getEnum(name) {\n if (this.nested && this.nested[name] instanceof Enum)\n return this.nested[name].values;\n throw Error(\"no such enum: \" + name);\n};\n\n/**\n * Adds a nested object to this namespace.\n * @param {ReflectionObject} object Nested object to add\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If there is already a nested object with this name\n */\nNamespace.prototype.add = function add(object) {\n\n if (!(object instanceof Field && object.extend !== undefined || object instanceof Type || object instanceof OneOf || object instanceof Enum || object instanceof Service || object instanceof Namespace))\n throw TypeError(\"object must be a valid nested object\");\n\n if (!this.nested)\n this.nested = {};\n else {\n var prev = this.get(object.name);\n if (prev) {\n if (prev instanceof Namespace && object instanceof Namespace && !(prev instanceof Type || prev instanceof Service)) {\n // replace plain namespace but keep existing nested elements and options\n var nested = prev.nestedArray;\n for (var i = 0; i < nested.length; ++i)\n object.add(nested[i]);\n this.remove(prev);\n if (!this.nested)\n this.nested = {};\n object.setOptions(prev.options, true);\n\n } else\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n }\n }\n this.nested[object.name] = object;\n\n if (!(this instanceof Type || this instanceof Service || this instanceof Enum || this instanceof Field)) {\n // This is a package or a root namespace.\n if (!object._edition) {\n // Make sure that some edition is set if it hasn't already been specified.\n object._edition = object._defaultEdition;\n }\n }\n\n object.onAdd(this);\n return clearCache(this);\n};\n\n/**\n * Removes a nested object from this namespace.\n * @param {ReflectionObject} object Nested object to remove\n * @returns {Namespace} `this`\n * @throws {TypeError} If arguments are invalid\n * @throws {Error} If `object` is not a member of this namespace\n */\nNamespace.prototype.remove = function remove(object) {\n\n if (!(object instanceof ReflectionObject))\n throw TypeError(\"object must be a ReflectionObject\");\n if (object.parent !== this)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.nested[object.name];\n if (!Object.keys(this.nested).length)\n this.nested = undefined;\n\n object.onRemove(this);\n return clearCache(this);\n};\n\n/**\n * Defines additial namespaces within this one if not yet existing.\n * @param {string|string[]} path Path to create\n * @param {*} [json] Nested types to create from JSON\n * @returns {Namespace} Pointer to the last namespace created or `this` if path is empty\n */\nNamespace.prototype.define = function define(path, json) {\n\n if (util.isString(path))\n path = path.split(\".\");\n else if (!Array.isArray(path))\n throw TypeError(\"illegal path\");\n if (path && path.length && path[0] === \"\")\n throw Error(\"path must be relative\");\n\n var ptr = this;\n while (path.length > 0) {\n var part = path.shift();\n if (ptr.nested && ptr.nested[part]) {\n ptr = ptr.nested[part];\n if (!(ptr instanceof Namespace))\n throw Error(\"path conflicts with non-namespace objects\");\n } else\n ptr.add(ptr = new Namespace(part));\n }\n if (json)\n ptr.addJSON(json);\n return ptr;\n};\n\n/**\n * Resolves this namespace's and all its nested objects' type references. Useful to validate a reflection tree, but comes at a cost.\n * @returns {Namespace} `this`\n */\nNamespace.prototype.resolveAll = function resolveAll() {\n var nested = this.nestedArray, i = 0;\n this.resolve();\n while (i < nested.length)\n if (nested[i] instanceof Namespace)\n nested[i++].resolveAll();\n else\n nested[i++].resolve();\n return this;\n};\n\n/**\n * @override\n */\nNamespace.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n edition = this._edition || edition;\n\n ReflectionObject.prototype._resolveFeaturesRecursive.call(this, edition);\n this.nestedArray.forEach(nested => {\n nested._resolveFeaturesRecursive(edition);\n });\n return this;\n};\n\n/**\n * Recursively looks up the reflection object matching the specified path in the scope of this namespace.\n * @param {string|string[]} path Path to look up\n * @param {*|Array.<*>} filterTypes Filter types, any combination of the constructors of `protobuf.Type`, `protobuf.Enum`, `protobuf.Service` etc.\n * @param {boolean} [parentAlreadyChecked=false] If known, whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n */\nNamespace.prototype.lookup = function lookup(path, filterTypes, parentAlreadyChecked) {\n\n /* istanbul ignore next */\n if (typeof filterTypes === \"boolean\") {\n parentAlreadyChecked = filterTypes;\n filterTypes = undefined;\n } else if (filterTypes && !Array.isArray(filterTypes))\n filterTypes = [ filterTypes ];\n\n if (util.isString(path) && path.length) {\n if (path === \".\")\n return this.root;\n path = path.split(\".\");\n } else if (!path.length)\n return this;\n\n // Start at root if path is absolute\n if (path[0] === \"\")\n return this.root.lookup(path.slice(1), filterTypes);\n\n // Test if the first part matches any nested object, and if so, traverse if path contains more\n var found = this.get(path[0]);\n if (found) {\n if (path.length === 1) {\n if (!filterTypes || filterTypes.indexOf(found.constructor) > -1)\n return found;\n } else if (found instanceof Namespace && (found = found.lookup(path.slice(1), filterTypes, true)))\n return found;\n\n // Otherwise try each nested namespace\n } else\n for (var i = 0; i < this.nestedArray.length; ++i)\n if (this._nestedArray[i] instanceof Namespace && (found = this._nestedArray[i].lookup(path, filterTypes, true)))\n return found;\n\n // If there hasn't been a match, try again at the parent\n if (this.parent === null || parentAlreadyChecked)\n return null;\n return this.parent.lookup(path, filterTypes);\n};\n\n/**\n * Looks up the reflection object at the specified path, relative to this namespace.\n * @name NamespaceBase#lookup\n * @function\n * @param {string|string[]} path Path to look up\n * @param {boolean} [parentAlreadyChecked=false] Whether the parent has already been checked\n * @returns {ReflectionObject|null} Looked up object or `null` if none could be found\n * @variation 2\n */\n// lookup(path: string, [parentAlreadyChecked: boolean])\n\n/**\n * Looks up the {@link Type|type} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type\n * @throws {Error} If `path` does not point to a type\n */\nNamespace.prototype.lookupType = function lookupType(path) {\n var found = this.lookup(path, [ Type ]);\n if (!found)\n throw Error(\"no such type: \" + path);\n return found;\n};\n\n/**\n * Looks up the values of the {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Enum} Looked up enum\n * @throws {Error} If `path` does not point to an enum\n */\nNamespace.prototype.lookupEnum = function lookupEnum(path) {\n var found = this.lookup(path, [ Enum ]);\n if (!found)\n throw Error(\"no such Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Type|type} or {@link Enum|enum} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Type} Looked up type or enum\n * @throws {Error} If `path` does not point to a type or enum\n */\nNamespace.prototype.lookupTypeOrEnum = function lookupTypeOrEnum(path) {\n var found = this.lookup(path, [ Type, Enum ]);\n if (!found)\n throw Error(\"no such Type or Enum '\" + path + \"' in \" + this);\n return found;\n};\n\n/**\n * Looks up the {@link Service|service} at the specified path, relative to this namespace.\n * Besides its signature, this methods differs from {@link Namespace#lookup|lookup} in that it throws instead of returning `null`.\n * @param {string|string[]} path Path to look up\n * @returns {Service} Looked up service\n * @throws {Error} If `path` does not point to a service\n */\nNamespace.prototype.lookupService = function lookupService(path) {\n var found = this.lookup(path, [ Service ]);\n if (!found)\n throw Error(\"no such Service '\" + path + \"' in \" + this);\n return found;\n};\n\n// Sets up cyclic dependencies (called in index-light)\nNamespace._configure = function(Type_, Service_, Enum_) {\n Type = Type_;\n Service = Service_;\n Enum = Enum_;\n};\n","\"use strict\";\nvar protobuf = module.exports = require(\"./index-light\");\n\nprotobuf.build = \"full\";\n\n// Parser\nprotobuf.tokenize = require(\"./tokenize\");\nprotobuf.parse = require(\"./parse\");\nprotobuf.common = require(\"./common\");\n\n// Configure parser\nprotobuf.Root._configure(protobuf.Type, protobuf.parse, protobuf.common);\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\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\";\nmodule.exports = Service;\n\n// extends Namespace\nvar Namespace = require(\"./namespace\");\n((Service.prototype = Object.create(Namespace.prototype)).constructor = Service).className = \"Service\";\n\nvar Method = require(\"./method\"),\n util = require(\"./util\"),\n rpc = require(\"./rpc\");\n\n/**\n * Constructs a new service instance.\n * @classdesc Reflected service.\n * @extends NamespaceBase\n * @constructor\n * @param {string} name Service name\n * @param {Object.} [options] Service options\n * @throws {TypeError} If arguments are invalid\n */\nfunction Service(name, options) {\n Namespace.call(this, name, options);\n\n /**\n * Service methods.\n * @type {Object.}\n */\n this.methods = {}; // toJSON, marker\n\n /**\n * Cached methods as an array.\n * @type {Method[]|null}\n * @private\n */\n this._methodsArray = null;\n}\n\n/**\n * Service descriptor.\n * @interface IService\n * @extends INamespace\n * @property {Object.} methods Method descriptors\n */\n\n/**\n * Constructs a service from a service descriptor.\n * @param {string} name Service name\n * @param {IService} json Service descriptor\n * @returns {Service} Created service\n * @throws {TypeError} If arguments are invalid\n */\nService.fromJSON = function fromJSON(name, json) {\n var service = new Service(name, json.options);\n /* istanbul ignore else */\n if (json.methods)\n for (var names = Object.keys(json.methods), i = 0; i < names.length; ++i)\n service.add(Method.fromJSON(names[i], json.methods[names[i]]));\n if (json.nested)\n service.addJSON(json.nested);\n if (json.edition)\n service._edition = json.edition;\n service.comment = json.comment;\n service._defaultEdition = \"proto3\"; // For backwards-compatibility.\n return service;\n};\n\n/**\n * Converts this service to a service descriptor.\n * @param {IToJSONOptions} [toJSONOptions] JSON conversion options\n * @returns {IService} Service descriptor\n */\nService.prototype.toJSON = function toJSON(toJSONOptions) {\n var inherited = Namespace.prototype.toJSON.call(this, toJSONOptions);\n var keepComments = toJSONOptions ? Boolean(toJSONOptions.keepComments) : false;\n return util.toObject([\n \"edition\" , this._editionToJSON(),\n \"options\" , inherited && inherited.options || undefined,\n \"methods\" , Namespace.arrayToJSON(this.methodsArray, toJSONOptions) || /* istanbul ignore next */ {},\n \"nested\" , inherited && inherited.nested || undefined,\n \"comment\" , keepComments ? this.comment : undefined\n ]);\n};\n\n/**\n * Methods of this service as an array for iteration.\n * @name Service#methodsArray\n * @type {Method[]}\n * @readonly\n */\nObject.defineProperty(Service.prototype, \"methodsArray\", {\n get: function() {\n return this._methodsArray || (this._methodsArray = util.toArray(this.methods));\n }\n});\n\nfunction clearCache(service) {\n service._methodsArray = null;\n return service;\n}\n\n/**\n * @override\n */\nService.prototype.get = function get(name) {\n return this.methods[name]\n || Namespace.prototype.get.call(this, name);\n};\n\n/**\n * @override\n */\nService.prototype.resolveAll = function resolveAll() {\n Namespace.prototype.resolve.call(this);\n var methods = this.methodsArray;\n for (var i = 0; i < methods.length; ++i)\n methods[i].resolve();\n return this;\n};\n\n/**\n * @override\n */\nService.prototype._resolveFeaturesRecursive = function _resolveFeaturesRecursive(edition) {\n edition = this._edition || edition;\n\n Namespace.prototype._resolveFeaturesRecursive.call(this, edition);\n this.methodsArray.forEach(method => {\n method._resolveFeaturesRecursive(edition);\n });\n return this;\n};\n\n/**\n * @override\n */\nService.prototype.add = function add(object) {\n\n /* istanbul ignore if */\n if (this.get(object.name))\n throw Error(\"duplicate name '\" + object.name + \"' in \" + this);\n\n if (object instanceof Method) {\n this.methods[object.name] = object;\n object.parent = this;\n return clearCache(this);\n }\n return Namespace.prototype.add.call(this, object);\n};\n\n/**\n * @override\n */\nService.prototype.remove = function remove(object) {\n if (object instanceof Method) {\n\n /* istanbul ignore if */\n if (this.methods[object.name] !== object)\n throw Error(object + \" is not a member of \" + this);\n\n delete this.methods[object.name];\n object.parent = null;\n return clearCache(this);\n }\n return Namespace.prototype.remove.call(this, object);\n};\n\n/**\n * Creates a runtime service using the specified rpc implementation.\n * @param {RPCImpl} rpcImpl RPC implementation\n * @param {boolean} [requestDelimited=false] Whether requests are length-delimited\n * @param {boolean} [responseDelimited=false] Whether responses are length-delimited\n * @returns {rpc.Service} RPC service. Useful where requests and/or responses are streamed.\n */\nService.prototype.create = function create(rpcImpl, requestDelimited, responseDelimited) {\n var rpcService = new rpc.Service(rpcImpl, requestDelimited, responseDelimited);\n for (var i = 0, method; i < /* initializes */ this.methodsArray.length; ++i) {\n var methodName = util.lcFirst((method = this._methodsArray[i]).resolve().name).replace(/[^$\\w_]/g, \"\");\n rpcService[methodName] = util.codegen([\"r\",\"c\"], util.isReserved(methodName) ? methodName + \"_\" : methodName)(\"return this.rpcCall(m,q,s,r,c)\")({\n m: method,\n q: method.resolvedRequestType.ctor,\n s: method.resolvedResponseType.ctor\n });\n }\n return rpcService;\n};\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","// 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 const prefixCodePoint = prefix.codePointAt(0);\n /* c8 ignore next 3 */\n if (prefixCodePoint === undefined) {\n throw new Error('Invalid prefix character');\n }\n this.prefixCodePoint = prefixCodePoint;\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) => {\n const codePoint = c.codePointAt(0);\n if (codePoint == null) {\n throw new Error(`Invalid character: ${c}`);\n }\n p[codePoint] = i;\n return p;\n}, ([])));\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 codePoint = char.codePointAt(0);\n if (codePoint == null) {\n throw new Error(`Invalid character: ${char}`);\n }\n const byt = alphabetCharsToBytes[codePoint];\n if (byt == null) {\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/**\n * Used to check that the passed multihash has the passed code\n */\nexport function hasCode(digest, code) {\n return digest.code === code;\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 { base36 } from './bases/base36.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 case base36.prefix: {\n const decoder = base ?? base36;\n return [base36.prefix, decoder.decode(source)];\n }\n default: {\n if (base == null) {\n throw Error('To parse non base32, base36 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","/* 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 HistoryEntry;\n(function (HistoryEntry) {\n let _codec;\n HistoryEntry.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.messageId != null && obj.messageId !== '')) {\n w.uint32(10);\n w.string(obj.messageId);\n }\n if (obj.retrievalHint != null) {\n w.uint32(18);\n w.bytes(obj.retrievalHint);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n messageId: ''\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.messageId = reader.string();\n break;\n }\n case 2: {\n obj.retrievalHint = 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 HistoryEntry.encode = (obj) => {\n return encodeMessage(obj, HistoryEntry.codec());\n };\n HistoryEntry.decode = (buf, opts) => {\n return decodeMessage(buf, HistoryEntry.codec(), opts);\n };\n})(HistoryEntry || (HistoryEntry = {}));\nexport var SdsMessage;\n(function (SdsMessage) {\n let _codec;\n SdsMessage.codec = () => {\n if (_codec == null) {\n _codec = message((obj, w, opts = {}) => {\n if (opts.lengthDelimited !== false) {\n w.fork();\n }\n if ((obj.messageId != null && obj.messageId !== '')) {\n w.uint32(18);\n w.string(obj.messageId);\n }\n if ((obj.channelId != null && obj.channelId !== '')) {\n w.uint32(26);\n w.string(obj.channelId);\n }\n if (obj.lamportTimestamp != null) {\n w.uint32(80);\n w.int32(obj.lamportTimestamp);\n }\n if (obj.causalHistory != null) {\n for (const value of obj.causalHistory) {\n w.uint32(90);\n HistoryEntry.codec().encode(value, w);\n }\n }\n if (obj.bloomFilter != null) {\n w.uint32(98);\n w.bytes(obj.bloomFilter);\n }\n if (obj.content != null) {\n w.uint32(162);\n w.bytes(obj.content);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n messageId: '',\n channelId: '',\n causalHistory: []\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.messageId = reader.string();\n break;\n }\n case 3: {\n obj.channelId = reader.string();\n break;\n }\n case 10: {\n obj.lamportTimestamp = reader.int32();\n break;\n }\n case 11: {\n if (opts.limits?.causalHistory != null && obj.causalHistory.length === opts.limits.causalHistory) {\n throw new MaxLengthError('Decode error - map field \"causalHistory\" had too many elements');\n }\n obj.causalHistory.push(HistoryEntry.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.causalHistory$\n }));\n break;\n }\n case 12: {\n obj.bloomFilter = reader.bytes();\n break;\n }\n case 20: {\n obj.content = 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 SdsMessage.encode = (obj) => {\n return encodeMessage(obj, SdsMessage.codec());\n };\n SdsMessage.decode = (buf, opts) => {\n return decodeMessage(buf, SdsMessage.codec(), opts);\n };\n})(SdsMessage || (SdsMessage = {}));\n//# sourceMappingURL=sds_message.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","/**\n * Internal assertion helpers.\n * @module\n */\n/** Asserts something is positive integer. */\nfunction anumber(n) {\n if (!Number.isSafeInteger(n) || n < 0)\n throw new Error('positive integer expected, got ' + n);\n}\n/** Is number an Uint8Array? Copied from utils for perf. */\nfunction isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n/** Asserts something is Uint8Array. */\nfunction abytes(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 + ', got length=' + b.length);\n}\n/** Asserts something is hash */\nfunction ahash(h) {\n if (typeof h !== 'function' || typeof h.create !== 'function')\n throw new Error('Hash should be wrapped by utils.wrapConstructor');\n anumber(h.outputLen);\n anumber(h.blockLen);\n}\n/** Asserts a hash instance has not been destroyed / finished */\nfunction aexists(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}\n/** Asserts output is properly-sized byte array */\nfunction aoutput(out, instance) {\n abytes(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 { anumber, abytes, ahash, aexists, aoutput };\n//# sourceMappingURL=_assert.js.map","export const crypto = typeof globalThis === 'object' && 'crypto' in globalThis ? globalThis.crypto : undefined;\n//# sourceMappingURL=crypto.js.map","/**\n * Utilities for hex, bytes, CSPRNG.\n * @module\n */\n/*! 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 { abytes } from \"./_assert.js\";\n// export { isBytes } from './_assert.ts';\n// We can't reuse isBytes from _assert, because somehow this causes huge perf issues\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\n// Cast array to different type\nexport function u8(arr) {\n return new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);\n}\nexport function u32(arr) {\n return new Uint32Array(arr.buffer, arr.byteOffset, Math.floor(arr.byteLength / 4));\n}\n// Cast array to view\nexport function createView(arr) {\n return new DataView(arr.buffer, arr.byteOffset, arr.byteLength);\n}\n/** The rotate right (circular right shift) operation for uint32 */\nexport function rotr(word, shift) {\n return (word << (32 - shift)) | (word >>> shift);\n}\n/** The rotate left (circular left shift) operation for uint32 */\nexport function rotl(word, shift) {\n return (word << shift) | ((word >>> (32 - shift)) >>> 0);\n}\n/** Is current platform little-endian? Most are. Big-Endian platform: IBM */\nexport const isLE = /* @__PURE__ */ (() => new Uint8Array(new Uint32Array([0x11223344]).buffer)[0] === 0x44)();\n// The byte swap operation for uint32\nexport function byteSwap(word) {\n return (((word << 24) & 0xff000000) |\n ((word << 8) & 0xff0000) |\n ((word >>> 8) & 0xff00) |\n ((word >>> 24) & 0xff));\n}\n/** Conditionally byte swap if on a big-endian platform */\nexport const byteSwapIfBE = isLE\n ? (n) => 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// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function';\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 * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\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(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\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 // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('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; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\n }\n return array;\n}\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.\n */\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 * Convert JS string to byte array.\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}\nexport function checkOpts(defaults, opts) {\n if (opts !== undefined && {}.toString.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}\n/** Wraps hash function, creating an interface on top of it */\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/** Cryptographically secure PRNG. Uses internal OS-level `crypto.getRandomValues`. */\nexport function randomBytes(bytesLength = 32) {\n if (crypto && typeof crypto.getRandomValues === 'function') {\n return crypto.getRandomValues(new Uint8Array(bytesLength));\n }\n // Legacy Node.js compatibility\n if (crypto && typeof crypto.randomBytes === 'function') {\n return Uint8Array.from(crypto.randomBytes(bytesLength));\n }\n throw new Error('crypto.getRandomValues must be defined');\n}\n//# sourceMappingURL=utils.js.map","/**\n * Internal Merkle-Damgard hash utils.\n * @module\n */\nimport { aexists, aoutput } from \"./_assert.js\";\nimport { Hash, createView, toBytes } from \"./utils.js\";\n/** Polyfill for Safari 14. https://caniuse.com/mdn-javascript_builtins_dataview_setbiguint64 */\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}\n/** Choice: a ? b : c */\nexport function Chi(a, b, c) {\n return (a & b) ^ (~a & c);\n}\n/** Majority function, true if any two inputs is true. */\nexport function Maj(a, b, c) {\n return (a & b) ^ (a & c) ^ (b & c);\n}\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.finished = false;\n this.length = 0;\n this.pos = 0;\n this.destroyed = false;\n this.blockLen = blockLen;\n this.outputLen = outputLen;\n this.padOffset = padOffset;\n this.isLE = isLE;\n this.buffer = new Uint8Array(blockLen);\n this.view = createView(this.buffer);\n }\n update(data) {\n aexists(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 aexists(this);\n aoutput(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","/**\n * SHA2-256 a.k.a. sha256. In JS, it is the fastest hash, even faster than Blake3.\n *\n * To break sha256 using birthday attack, attackers need to try 2^128 hashes.\n * BTC network is doing 2^70 hashes/sec (2^95 hashes/year) as per 2025.\n *\n * Check out [FIPS 180-4](https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf).\n * @module\n */\nimport { Chi, HashMD, Maj } from \"./_md.js\";\nimport { rotr, wrapConstructor } from \"./utils.js\";\n/** Round constants: first 32 bits of 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: first 32 bits of 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/**\n * Temporary buffer, not used to store anything between runs.\n * Named this way because it matches specification.\n */\nconst SHA256_W = /* @__PURE__ */ new Uint32Array(64);\nexport class SHA256 extends HashMD {\n constructor(outputLen = 32) {\n super(64, outputLen, 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/**\n * Constants taken from https://nvlpubs.nist.gov/nistpubs/FIPS/NIST.FIPS.180-4.pdf.\n */\nclass SHA224 extends SHA256 {\n constructor() {\n super(28);\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 }\n}\n/** SHA2-256 hash function */\nexport const sha256 = /* @__PURE__ */ wrapConstructor(() => new SHA256());\n/** SHA2-224 hash function */\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 //\n // GENERAL ERRORS SECTION\n //\n /**\n * Could not determine the origin of the fault. Best to check connectivity and try again\n * */\n ProtocolError[\"GENERIC_FAIL\"] = \"Generic error\";\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 * 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 * 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 // SEND ERRORS SECTION\n //\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 * 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 * Fails when\n */\n ProtocolError[\"STREAM_ABORTED\"] = \"Stream aborted\";\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 //\n // RECEIVE ERRORS SECTION\n //\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})(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 * The default number of shards under a cluster.\n */\nexport const DEFAULT_NUM_SHARDS = 8;\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 HealthStatusChangeEvents;\n(function (HealthStatusChangeEvents) {\n HealthStatusChangeEvents[\"StatusChange\"] = \"health:change\";\n})(HealthStatusChangeEvents || (HealthStatusChangeEvents = {}));\nexport var HealthStatus;\n(function (HealthStatus) {\n HealthStatus[\"Unhealthy\"] = \"Unhealthy\";\n HealthStatus[\"MinimallyHealthy\"] = \"MinimallyHealthy\";\n HealthStatus[\"SufficientlyHealthy\"] = \"SufficientlyHealthy\";\n})(HealthStatus || (HealthStatus = {}));\n//# sourceMappingURL=health_indicator.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","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 * 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 // the passed promise may yet resolve or reject but the use has signalled\n // they are no longer interested so smother the error\n promise.catch(() => { });\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 error;\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 this.error = err;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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 this.error ?? 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 * @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 { queuelessPushable } from 'it-queueless-pushable';\nfunction isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\nasync function addAllToPushable(sources, output) {\n try {\n await Promise.all(sources.map(async (source) => {\n for await (const item of source) {\n await output.push(item);\n }\n }));\n await output.end();\n }\n catch (err) {\n await output.end(err)\n .catch(() => { });\n }\n}\nasync function* mergeSources(sources) {\n const output = queuelessPushable();\n addAllToPushable(sources, output)\n .catch(() => { });\n yield* output;\n}\nfunction* mergeSyncSources(syncSources) {\n for (const source of syncSources) {\n yield* source;\n }\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 mergeSyncSources(syncSources);\n }\n return mergeSources(sources);\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","export function selectOpenConnection(connections) {\n return connections\n .filter((c) => c.status === \"open\")\n .sort((left, right) => right.timeline.open - left.timeline.open)\n .at(0);\n}\n//# sourceMappingURL=utils.js.map","import { Logger } from \"@waku/utils\";\nimport { selectOpenConnection } from \"./utils.js\";\nconst STREAM_LOCK_KEY = \"consumed\";\nexport class StreamManager {\n multicodec;\n getConnections;\n addEventListener;\n log;\n ongoingCreation = new Set();\n streamPool = new Map();\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.addEventListener(\"peer:update\", this.handlePeerUpdateStreamPool);\n }\n async getStream(peerId) {\n const peerIdStr = peerId.toString();\n const scheduledStream = this.streamPool.get(peerIdStr);\n if (scheduledStream) {\n this.streamPool.delete(peerIdStr);\n await scheduledStream;\n }\n let stream = this.getOpenStreamForCodec(peerId);\n if (stream) {\n this.log.info(`Found existing stream peerId=${peerIdStr} multicodec=${this.multicodec}`);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n stream = await this.createStream(peerId);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n async createStream(peerId, retries = 0) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n throw new Error(`Failed to get a connection to the peer peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n }\n let lastError;\n let stream;\n for (let i = 0; i < retries + 1; i++) {\n try {\n this.log.info(`Attempting to create a stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n stream = await connection.newStream(this.multicodec);\n this.log.info(`Created stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n break;\n }\n catch (error) {\n lastError = error;\n }\n }\n if (!stream) {\n throw new Error(`Failed to create a new stream for ${peerId.toString()} -- ` + lastError);\n }\n return stream;\n }\n async createStreamWithLock(peer) {\n const peerId = peer.id.toString();\n if (this.ongoingCreation.has(peerId)) {\n this.log.info(`Skipping creation of a stream due to lock for peerId=${peerId} multicodec=${this.multicodec}`);\n return;\n }\n try {\n this.ongoingCreation.add(peerId);\n await this.createStream(peer.id);\n }\n catch (error) {\n this.log.error(`Failed to createStreamWithLock:`, error);\n }\n finally {\n this.ongoingCreation.delete(peerId);\n }\n return;\n }\n handlePeerUpdateStreamPool = (evt) => {\n const { peer } = evt.detail;\n if (!peer.protocols.includes(this.multicodec)) {\n return;\n }\n const stream = this.getOpenStreamForCodec(peer.id);\n if (stream) {\n return;\n }\n this.scheduleNewStream(peer);\n };\n scheduleNewStream(peer) {\n this.log.info(`Scheduling creation of a stream for peerId=${peer.id.toString()} multicodec=${this.multicodec}`);\n // abandon previous attempt\n if (this.streamPool.has(peer.id.toString())) {\n this.streamPool.delete(peer.id.toString());\n }\n this.streamPool.set(peer.id.toString(), this.createStreamWithLock(peer));\n }\n getOpenStreamForCodec(peerId) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n return;\n }\n const stream = connection.streams.find((s) => s.protocol === this.multicodec);\n if (!stream) {\n return;\n }\n const isStreamUnusable = [\"done\", \"closed\", \"closing\"].includes(stream.writeStatus || \"\");\n if (isStreamUnusable || this.isStreamLocked(stream)) {\n return;\n }\n return stream;\n }\n lockStream(peerId, stream) {\n this.log.info(`Locking stream for peerId:${peerId}\\tstreamId:${stream.id}`);\n stream.metadata[STREAM_LOCK_KEY] = true;\n }\n isStreamLocked(stream) {\n return !!stream.metadata[STREAM_LOCK_KEY];\n }\n}\n//# sourceMappingURL=stream_manager.js.map","import { 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 pubsubTopics;\n addLibp2pEventListener;\n removeLibp2pEventListener;\n streamManager;\n constructor(multicodec, components, pubsubTopics) {\n this.multicodec = multicodec;\n this.components = components;\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(peerId) {\n return this.streamManager.getStream(peerId);\n }\n}\n//# sourceMappingURL=base_protocol.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 pubsubTopics;\n static handleIncomingMessage;\n constructor(handleIncomingMessage, pubsubTopics, libp2p) {\n super(FilterCodecs.SUBSCRIBE, libp2p.components, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n // TODO(weboko): remove when @waku/sdk 0.0.33 is released\n const prevHandler = FilterCore.handleIncomingMessage;\n FilterCore.handleIncomingMessage = !prevHandler\n ? handleIncomingMessage\n : async (pubsubTopic, message, peerIdStr) => {\n try {\n await prevHandler(pubsubTopic, message, peerIdStr);\n }\n catch (e) {\n log.error(\"Previous FilterCore incoming message handler failed \", e);\n }\n try {\n await handleIncomingMessage(pubsubTopic, message, peerIdStr);\n }\n catch (e) {\n log.error(\"Present FilterCore incoming message handler failed \", e);\n }\n return;\n };\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, peerId, contentTopics) {\n const stream = await this.getStream(peerId);\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: peerId\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: peerId\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peerId\n };\n }\n async unsubscribe(pubsubTopic, peerId, contentTopics) {\n let stream;\n try {\n stream = await this.getStream(peerId);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peerId.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peerId\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: peerId\n }\n };\n }\n return {\n success: peerId,\n failure: null\n };\n }\n async unsubscribeAll(pubsubTopic, peerId) {\n const stream = await this.getStream(peerId);\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: peerId\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: peerId\n },\n success: null\n };\n }\n return {\n failure: null,\n success: peerId\n };\n }\n async ping(peerId) {\n let stream;\n try {\n stream = await this.getStream(peerId);\n }\n catch (error) {\n log.error(`Failed to get a stream for remote peer${peerId.toString()}`, error);\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_STREAM_AVAILABLE,\n peerId: peerId\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: peerId\n }\n };\n }\n if (!res || !res.length) {\n return {\n success: null,\n failure: {\n error: ProtocolError.NO_RESPONSE,\n peerId: peerId\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: peerId\n }\n };\n }\n return {\n success: peerId,\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 FilterCore.handleIncomingMessage?.(pubsubTopic, wakuMessage, connection.remotePeer.toString());\n }\n }).then(() => {\n log.info(\"Receiving pipe closed.\");\n }, async (e) => {\n log.error(`Error with receiving pipe on peer:${connection.remotePeer.toString()} -- stream:${stream.id} -- protocol:${stream.protocol}: `, e);\n });\n }\n catch (e) {\n log.error(\"Error decoding message\", e);\n }\n }\n}\n//# sourceMappingURL=filter.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","// 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 proof\";\nconst RLN_MESSAGE_ID_PREFIX_ERROR = \"could not get new message id to generate an rln proof\";\n// rare case on nwaku side\n// https://github.com/waku-org/nwaku/blob/a4e92a3d02448fd708857b7b6cac2a7faa7eb4f9/waku/waku_lightpush/callbacks.nim#L49\n// https://github.com/waku-org/nwaku/blob/a4e92a3d02448fd708857b7b6cac2a7faa7eb4f9/waku/node/waku_node.nim#L1117\nconst RLN_REMOTE_VALIDATION = \"RLN validation failed\";\nexport const isRLNResponseError = (info) => {\n if (!info) {\n return false;\n }\n return (info.includes(RLN_GENERATION_PREFIX_ERROR) ||\n info.includes(RLN_MESSAGE_ID_PREFIX_ERROR) ||\n info.includes(RLN_REMOTE_VALIDATION));\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 } 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, 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, peerId) {\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\n }\n };\n }\n let stream;\n try {\n stream = await this.getStream(peerId);\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: peerId\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 // can fail only because of `stream` abortion\n log.error(\"Failed to send waku light push request\", err);\n return {\n success: null,\n failure: {\n error: ProtocolError.STREAM_ABORTED,\n peerId: peerId\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: peerId\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: peerId\n }\n };\n }\n if (isRLNResponseError(response.info)) {\n log.error(\"Remote peer fault: RLN generation\");\n return {\n success: null,\n failure: {\n error: ProtocolError.RLN_PROOF_GENERATION,\n peerId: peerId\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: peerId\n }\n };\n }\n return { success: peerId, failure: null };\n }\n}\n//# sourceMappingURL=light_push.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, pubsubTopics);\n this.pubsubTopics = pubsubTopics;\n }\n async *queryPerPage(queryOpts, decoders, peerId) {\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(peerId);\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=store.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}\n//# sourceMappingURL=event-target.js.map","/**\n * All PeerId implementations must use this symbol as the name of a property\n * with a boolean `true` value\n */\nexport const peerIdSymbol = Symbol.for('@libp2p/peer-id');\n/**\n * Returns true if the passed argument is a PeerId implementation\n */\nexport function isPeerId(other) {\n return Boolean(other?.[peerIdSymbol]);\n}\n//# sourceMappingURL=peer-id.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 IPv4 `input` into IPv6 with IPv4-mapped bytes, eg ::ffff:1.2.3.4 */\nexport function parseIPv4Mapped(input) {\n if (input.length > MAX_IPV4_LENGTH) {\n return undefined;\n }\n const ipv4 = parser.new(input).parseWith(() => parser.readIPv4Addr());\n if (ipv4 === undefined) {\n return undefined;\n }\n return Uint8Array.from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff, ipv4[0], ipv4[1], ipv4[2], ipv4[3]]);\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, mapIPv4ToIPv6 = false) {\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 const addr = parser.new(input).parseWith(() => parser.readIPAddr());\n if (!addr) {\n return undefined;\n }\n if (mapIPv4ToIPv6 && addr.length === 4) {\n return Uint8Array.from([0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0xff, 0xff, addr[0], addr[1], addr[2], addr[3]]);\n }\n return addr;\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 } 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 { IPv4Len, IPv6Len } from \"./ip.js\";\nexport function allFF(a, from, to) {\n let i = 0;\n for (const e of a) {\n if (i < from)\n continue;\n if (i > to)\n break;\n if (e !== 0xff)\n return false;\n i++;\n }\n return true;\n}\nexport function deepEqual(a, b, from, to) {\n let i = 0;\n for (const e of a) {\n if (i < from)\n continue;\n if (i > to)\n break;\n if (e !== b[i])\n return false;\n i++;\n }\n return true;\n}\n/***\n * Returns long ip format\n */\nexport function ipToString(ip) {\n switch (ip.length) {\n case IPv4Len: {\n return ip.join(\".\");\n }\n case IPv6Len: {\n const result = [];\n for (let i = 0; i < ip.length; i++) {\n if (i % 2 === 0) {\n result.push(ip[i].toString(16).padStart(2, \"0\") +\n ip[i + 1].toString(16).padStart(2, \"0\"));\n }\n }\n return result.join(\":\");\n }\n default: {\n throw new Error(\"Invalid ip length\");\n }\n }\n}\n/**\n * If mask is a sequence of 1 bits followed by 0 bits, return number of 1 bits else -1\n */\nexport function simpleMaskLength(mask) {\n let ones = 0;\n // eslint-disable-next-line prefer-const\n for (let [index, byte] of mask.entries()) {\n if (byte === 0xff) {\n ones += 8;\n continue;\n }\n while ((byte & 0x80) != 0) {\n ones++;\n byte = byte << 1;\n }\n if ((byte & 0x80) != 0) {\n return -1;\n }\n for (let i = index + 1; i < mask.length; i++) {\n if (mask[i] != 0) {\n return -1;\n }\n }\n break;\n }\n return ones;\n}\nexport function maskToHex(mask) {\n let hex = \"0x\";\n for (const byte of mask) {\n hex += (byte >> 4).toString(16) + (byte & 0x0f).toString(16);\n }\n return hex;\n}\n//# sourceMappingURL=util.js.map","import { parseIPv4, parseIPv6 } from \"@chainsafe/is-ip/parse\";\nimport { IPv4Len, IPv6Len, maskIp } from \"./ip.js\";\nexport function parseCidr(s) {\n const [address, maskString] = s.split(\"/\");\n if (!address || !maskString)\n throw new Error(\"Failed to parse given CIDR: \" + s);\n let ipLength = IPv4Len;\n let ip = parseIPv4(address);\n if (ip == null) {\n ipLength = IPv6Len;\n ip = parseIPv6(address);\n if (ip == null)\n throw new Error(\"Failed to parse given CIDR: \" + s);\n }\n const m = parseInt(maskString, 10);\n if (Number.isNaN(m) ||\n String(m).length !== maskString.length ||\n m < 0 ||\n m > ipLength * 8) {\n throw new Error(\"Failed to parse given CIDR: \" + s);\n }\n const mask = cidrMask(m, 8 * ipLength);\n return {\n network: maskIp(ip, mask),\n mask,\n };\n}\nexport function cidrMask(ones, bits) {\n if (bits !== 8 * IPv4Len && bits !== 8 * IPv6Len)\n throw new Error(\"Invalid CIDR mask\");\n if (ones < 0 || ones > bits)\n throw new Error(\"Invalid CIDR mask\");\n const l = bits / 8;\n const m = new Uint8Array(l);\n for (let i = 0; i < l; i++) {\n if (ones >= 8) {\n m[i] = 0xff;\n ones -= 8;\n continue;\n }\n m[i] = 255 - (0xff >> ones);\n ones = 0;\n }\n return m;\n}\n//# sourceMappingURL=cidr.js.map","import { parseIP } from \"@chainsafe/is-ip/parse\";\nimport { cidrMask, parseCidr } from \"./cidr.js\";\nimport { containsIp, maskIp } from \"./ip.js\";\nimport { ipToString, maskToHex, simpleMaskLength } from \"./util.js\";\nexport class IpNet {\n /**\n *\n * @param ipOrCidr either network ip or full cidr address\n * @param mask in case ipOrCidr is network this can be either mask in decimal format or as ip address\n */\n constructor(ipOrCidr, mask) {\n if (mask == null) {\n ({ network: this.network, mask: this.mask } = parseCidr(ipOrCidr));\n }\n else {\n const ipResult = parseIP(ipOrCidr);\n if (ipResult == null) {\n throw new Error(\"Failed to parse network\");\n }\n mask = String(mask);\n const m = parseInt(mask, 10);\n if (Number.isNaN(m) ||\n String(m).length !== mask.length ||\n m < 0 ||\n m > ipResult.length * 8) {\n const maskResult = parseIP(mask);\n if (maskResult == null) {\n throw new Error(\"Failed to parse mask\");\n }\n this.mask = maskResult;\n }\n else {\n this.mask = cidrMask(m, 8 * ipResult.length);\n }\n this.network = maskIp(ipResult, this.mask);\n }\n }\n /**\n * Checks if netmask contains ip address\n * @param ip\n * @returns\n */\n contains(ip) {\n return containsIp({ network: this.network, mask: this.mask }, ip);\n }\n /**Serializes back to string format */\n toString() {\n const l = simpleMaskLength(this.mask);\n const mask = l !== -1 ? String(l) : maskToHex(this.mask);\n return ipToString(this.network) + \"/\" + mask;\n }\n}\n//# sourceMappingURL=ipnet.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 { 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","import { 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 */\n// eslint-disable-next-line complexity\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 43: // ipcidr\n return uint8ArrayToString(buf, 'base10');\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}\n// eslint-disable-next-line complexity\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 43: // ipcidr\n return uint8ArrayFromString(str, 'base10');\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 new 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 new 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 * [[num code, str value?]... ] -> Tuple[]\n */\nexport function stringTuplesToTuples(stringTuples) {\n const tuples = [];\n stringTuples.forEach(([code, value]) => {\n const tuple = [code];\n if (value != null) {\n tuple[1] = convertToBytes(code, value);\n }\n tuples.push(tuple);\n });\n return tuples;\n}\n/**\n * [[num code, str value?]... ] -> 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 new 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 class ParseError extends Error {\n static name = 'ParseError';\n name = 'ParseError';\n constructor(str) {\n super(`Error parsing address: ${str}`);\n }\n}\n//# sourceMappingURL=codec.js.map","/* eslint-disable complexity */\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];\nclass NoAvailableResolverError extends Error {\n constructor(message = 'No available resolver') {\n super(message);\n this.name = 'NoAvailableResolverError';\n }\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 === 'tcp' ? 'tcp' : 'udp';\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 === 'tcp' ? 'tcp' : 'udp';\n port = parseInt(value ?? '');\n }\n if (code === ip4.code || code === ip6.code) {\n transport = getProtocol(code).name === 'tcp' ? 'tcp' : 'udp';\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.map(([code, value]) => {\n if (value == null) {\n return [code];\n }\n return [code, value];\n });\n }\n stringTuples() {\n return this.#stringTuples.map(([code, value]) => {\n if (value == null) {\n return [code];\n }\n return [code, value];\n });\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 NoAvailableResolverError(`no available resolver for ${resolvableProto.name}`);\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 *\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 { dnsaddrResolver } from '@multiformats/multiaddr/resolvers'\n *\n * resolvers.set('dnsaddr', dnsaddrResolver)\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(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 * resolvers: {\n * '.': dnsJsonOverHttps('https://cloudflare-dns.com/dns-query')\n * }\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 { stringTuplesToTuples, tuplesToBytes } from './codec.js';\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 * Create a {@link Multiaddr} from an array of {@link Tuple}s\n *\n * @example\n *\n * ```ts\n * import { fromTuples, multiaddr } from '@multiformats/multiaddr'\n *\n * const ma = multiaddr('/ip4/127.0.0.1')\n * const tuples = ma.tuples()\n *\n * const ma2 = fromTuples(tuples)\n *\n * console.info(ma2)\n * // '/ip4/127.0.0.1'\n * ```\n */\nexport function fromTuples(tuples) {\n return multiaddr(tuplesToBytes(tuples));\n}\n/**\n * Create a {@link Multiaddr} from an array of {@link StringTuple}s\n *\n * @example\n *\n * ```ts\n * import { fromStringTuples, multiaddr } from '@multiformats/multiaddr'\n *\n * const ma = multiaddr('/ip4/127.0.0.1')\n * const tuples = ma.stringTuples()\n *\n * const ma2 = fromStringTuples(tuples)\n *\n * console.info(ma2)\n * // '/ip4/127.0.0.1'\n * ```\n */\nexport function fromStringTuples(tuples) {\n return fromTuples(stringTuplesToTuples(tuples));\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 { Logger, pubsubTopicToSingleShardInfo } from \"@waku/utils\";\nimport { utf8ToBytes } from \"@waku/utils/bytes\";\nimport { createEncoder } from \"../message/version_0.js\";\nconst 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 { bytesToUtf8 } from \"@waku/utils/bytes\";\n/**\n * Reads peer's metadata and retrieves ping value.\n * @param peer Peer or null\n * @returns -1 if no ping attached, otherwise returns ping value\n */\nexport const getPeerPing = (peer) => {\n if (!peer) {\n return -1;\n }\n try {\n const bytes = peer.metadata.get(\"ping\");\n if (!bytes) {\n return -1;\n }\n return Number(bytesToUtf8(bytes));\n }\n catch (e) {\n return -1;\n }\n};\n//# sourceMappingURL=utils.js.map","import { isPeerId, TypedEventEmitter } from \"@libp2p/interface\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\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\";\nimport { getPeerPing } from \"./utils.js\";\nconst log = new Logger(\"connection-manager\");\nconst DEFAULT_MAX_BOOTSTRAP_PEERS_ALLOWED = 1;\nconst DEFAULT_MAX_DIAL_ATTEMPTS_FOR_PEER = 3;\nconst DEFAULT_MAX_PARALLEL_DIALS = 3;\nconst DEFAULT_PING_KEEP_ALIVE_SEC = 5 * 60;\nconst DEFAULT_RELAY_KEEP_ALIVE_SEC = 5 * 60;\nexport class ConnectionManager extends TypedEventEmitter {\n // TODO(weboko): make it private\n pubsubTopics;\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 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(options) {\n super();\n this.libp2p = options.libp2p;\n this.pubsubTopics = options.pubsubTopics;\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 pingKeepAlive: DEFAULT_PING_KEEP_ALIVE_SEC,\n relayKeepAlive: DEFAULT_RELAY_KEEP_ALIVE_SEC,\n ...options.config\n };\n this.keepAliveManager = new KeepAliveManager({\n relay: options.relay,\n libp2p: options.libp2p,\n options: {\n pingKeepAlive: this.options.pingKeepAlive,\n relayKeepAlive: this.options.relayKeepAlive\n }\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 getConnectedPeers(codec) {\n const peerIDs = this.libp2p.getPeers();\n if (peerIDs.length === 0) {\n return [];\n }\n const peers = await Promise.all(peerIDs.map(async (id) => {\n try {\n return await this.libp2p.peerStore.get(id);\n }\n catch (e) {\n return null;\n }\n }));\n return peers\n .filter((p) => !!p)\n .filter((p) => (codec ? p.protocols.includes(codec) : true))\n .sort((left, right) => getPeerPing(left) - getPeerPing(right));\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 /**\n * Attempts to establish a connection with a peer and set up specified protocols.\n * The method handles both PeerId and Multiaddr inputs, manages connection attempts,\n * and maintains the connection state.\n *\n * The dialing process includes:\n * 1. Converting input to dialable peer info\n * 2. Managing parallel dial attempts\n * 3. Attempting to establish protocol-specific connections\n * 4. Handling connection failures and retries\n * 5. Updating the peer store and connection state\n *\n * @param {PeerId | MultiaddrInput} peer - The peer to connect to, either as a PeerId or multiaddr\n * @param {string[]} [protocolCodecs] - Optional array of protocol-specific codec strings to establish\n * (e.g., for LightPush, Filter, Store protocols)\n *\n * @throws {Error} If the multiaddr is missing a peer ID\n * @throws {Error} If the maximum dial attempts are reached and the peer cannot be dialed\n * @throws {Error} If there's an error deleting an undialable peer from the peer store\n *\n * @example\n * ```typescript\n * // Dial using PeerId\n * await connectionManager.dialPeer(peerId);\n *\n * // Dial using multiaddr with specific protocols\n * await connectionManager.dialPeer(multiaddr, [\n * \"/vac/waku/relay/2.0.0\",\n * \"/vac/waku/lightpush/2.0.0-beta1\"\n * ]);\n * ```\n *\n * @remarks\n * - The method implements exponential backoff through multiple dial attempts\n * - Maintains a queue for parallel dial attempts (limited by maxParallelDials)\n * - Integrates with the KeepAliveManager for connection maintenance\n * - Updates the peer store and connection state after successful/failed attempts\n * - If all dial attempts fail, triggers DNS discovery as a fallback\n */\n async dialPeer(peer) {\n let connection;\n let peerId;\n const peerDialInfo = this.getDialablePeerInfo(peer);\n const peerIdStr = isPeerId(peerDialInfo)\n ? peerDialInfo.toString()\n : peerDialInfo.getPeerId();\n this.currentActiveParallelDialCount += 1;\n let dialAttempt = 0;\n while (dialAttempt < this.options.maxDialAttemptsForPeer) {\n try {\n log.info(`Dialing peer ${peerDialInfo} on attempt ${dialAttempt + 1}`);\n connection = await this.libp2p.dial(peerDialInfo);\n peerId = connection.remotePeer;\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 ${peerIdStr} - ${error.errors}`);\n }\n else {\n // Handle generic error\n log.error(`Error dialing peer ${peerIdStr} - ${error.message}`);\n }\n this.dialErrorsForPeer.set(peerIdStr, error);\n dialAttempt++;\n this.dialAttemptsForPeer.set(peerIdStr, 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(peerIdStr);\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 ${peerIdStr} from peer store. Reason: ${errorMessage}`);\n }\n this.dialErrorsForPeer.delete(peerIdStr);\n if (peerId) {\n await this.libp2p.peerStore.delete(peerId);\n }\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 ${peerIdStr} from peer store - ${error}`);\n }\n }\n if (!connection) {\n throw new Error(`Failed to dial peer ${peerDialInfo}`);\n }\n return connection;\n }\n /**\n * Dial a peer with specific protocols.\n * This method is a raw proxy to the libp2p dialProtocol method.\n * @param peer - The peer to connect to, either as a PeerId or multiaddr\n * @param protocolCodecs - Optional array of protocol-specific codec strings to establish\n * @returns A stream to the peer\n */\n async rawDialPeerWithProtocols(peer, protocolCodecs) {\n const peerDialInfo = this.getDialablePeerInfo(peer);\n return await this.libp2p.dialProtocol(peerDialInfo, protocolCodecs);\n }\n /**\n * Internal utility to extract a PeerId or Multiaddr from a peer input.\n * This is used internally by the connection manager to handle different peer input formats.\n * @internal\n */\n getDialablePeerInfo(peer) {\n if (isPeerId(peer)) {\n return peer;\n }\n else {\n // peer is of MultiaddrInput type\n const ma = multiaddr(peer);\n const peerIdStr = ma.getPeerId();\n if (!peerIdStr) {\n throw new Error(\"Failed to dial multiaddr: missing peer ID\");\n }\n return ma;\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.pubsubTopics}).\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.pubsubTopics.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 { 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, 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.libp2pComponents.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(peerId);\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=metadata.js.map","import { sha256 } from \"@noble/hashes/sha256\";\nimport { isDefined } from \"@waku/utils\";\nimport { bytesToHex, 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 = bytesToHex(hash);\n return hashStr;\n}\n//# sourceMappingURL=index.js.map","import { EConnectionStateEvents } from \"@waku/interfaces\";\nimport { messageHashStr } from \"@waku/message-hash\";\n// TODO(weboko): consider adding as config property or combine with maxAllowedPings\nconst MAX_SUBSCRIBE_ATTEMPTS = 3;\nexport class SubscriptionMonitor {\n /**\n * Cached peers that are in use by subscription.\n * Needed to understand if they disconnect later or not.\n */\n peerIds = [];\n isStarted = false;\n pubsubTopic;\n config;\n libp2p;\n filter;\n peerManager;\n connectionManager;\n activeSubscriptions;\n keepAliveIntervalId;\n pingFailedAttempts = new Map();\n receivedMessagesFormPeer = new Set();\n receivedMessages = new Set();\n verifiedPeers = new Set();\n constructor(options) {\n this.config = options.config;\n this.connectionManager = options.connectionManager;\n this.filter = options.filter;\n this.peerManager = options.peerManager;\n this.libp2p = options.libp2p;\n this.activeSubscriptions = options.activeSubscriptions;\n this.pubsubTopic = options.pubsubTopic;\n this.onConnectionChange = this.onConnectionChange.bind(this);\n this.onPeerConnected = this.onPeerConnected.bind(this);\n this.onPeerDisconnected = this.onPeerDisconnected.bind(this);\n }\n /**\n * @returns content topic used for Filter verification\n */\n get reservedContentTopic() {\n return `/js-waku-subscription-ping/1/${this.libp2p.peerId.toString()}/utf8`;\n }\n /**\n * Starts:\n * - recurring ping queries;\n * - connection event observers;\n */\n start() {\n if (this.isStarted) {\n return;\n }\n this.isStarted = true;\n this.startKeepAlive();\n this.startConnectionListener();\n this.startPeerConnectionListener();\n }\n /**\n * Stops all recurring queries, event listeners or timers.\n */\n stop() {\n if (!this.isStarted) {\n return;\n }\n this.isStarted = false;\n this.stopKeepAlive();\n this.stopConnectionListener();\n this.stopPeerConnectionListener();\n }\n /**\n * Method to get peers that are used by particular subscription or, if initially called, peers that can be used by subscription.\n * @returns array of peers\n */\n async getPeers() {\n if (!this.isStarted) {\n this.peerIds = this.peerManager.getPeers();\n }\n return this.peerIds;\n }\n /**\n * Notifies monitor if message was received.\n *\n * @param peerId peer from which message is received\n * @param message received message\n *\n * @returns true if message was received from peer\n */\n notifyMessageReceived(peerId, message) {\n const hash = this.buildMessageHash(message);\n this.verifiedPeers.add(peerId);\n this.receivedMessagesFormPeer.add(`${peerId}-${hash}`);\n if (this.receivedMessages.has(hash)) {\n return true;\n }\n this.receivedMessages.add(hash);\n return false;\n }\n buildMessageHash(message) {\n return messageHashStr(this.pubsubTopic, message);\n }\n startConnectionListener() {\n this.connectionManager.addEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.onConnectionChange);\n }\n stopConnectionListener() {\n this.connectionManager.removeEventListener(EConnectionStateEvents.CONNECTION_STATUS, this.onConnectionChange);\n }\n async onConnectionChange({ detail: isConnected }) {\n if (!isConnected) {\n this.stopKeepAlive();\n return;\n }\n await Promise.all(this.peerIds.map((id) => this.ping(id, true)));\n this.startKeepAlive();\n }\n startKeepAlive() {\n if (this.keepAliveIntervalId) {\n return;\n }\n this.keepAliveIntervalId = setInterval(() => {\n void this.peerIds.map((id) => this.ping(id));\n }, this.config.keepAliveIntervalMs);\n }\n stopKeepAlive() {\n if (!this.keepAliveIntervalId) {\n return;\n }\n clearInterval(this.keepAliveIntervalId);\n this.keepAliveIntervalId = undefined;\n }\n startPeerConnectionListener() {\n this.libp2p.addEventListener(\"peer:connect\", this.onPeerConnected);\n this.libp2p.addEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n stopPeerConnectionListener() {\n this.libp2p.removeEventListener(\"peer:connect\", this.onPeerConnected);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n // this method keeps track of new connections and will trigger subscribe request if needed\n async onPeerConnected(_event) {\n // TODO(weboko): use config.numOfUsedPeers instead of this.peers\n const hasSomePeers = this.peerIds.length > 0;\n if (hasSomePeers) {\n return;\n }\n this.peerIds = this.peerManager.getPeers();\n await Promise.all(this.peerIds.map((id) => this.subscribe(id)));\n }\n // this method keeps track of disconnects and will trigger subscribe request if needed\n async onPeerDisconnected(event) {\n const hasNotBeenUsed = !this.peerIds.find((id) => id.equals(event.detail));\n if (hasNotBeenUsed) {\n return;\n }\n this.peerIds = this.peerManager.getPeers();\n // we trigger subscribe for peer that was used before\n // it will expectedly fail and we will initiate addition of a new peer\n await Promise.all(this.peerIds.map((id) => this.subscribe(id)));\n }\n async subscribe(_peerId) {\n let peerId = _peerId;\n for (let i = 0; i < MAX_SUBSCRIBE_ATTEMPTS; i++) {\n if (!peerId) {\n return;\n }\n const response = await this.filter.subscribe(this.pubsubTopic, peerId, Array.from(this.activeSubscriptions.keys()));\n if (response.success) {\n return;\n }\n peerId = this.peerManager.requestRenew(peerId);\n }\n }\n async ping(peerId, renewOnFirstFail = false) {\n const peerIdStr = peerId.toString();\n const response = await this.filter.ping(peerId);\n if (response.failure && renewOnFirstFail) {\n const newPeer = this.peerManager.requestRenew(peerId);\n await this.subscribe(newPeer);\n return;\n }\n if (response.failure) {\n const prev = this.pingFailedAttempts.get(peerIdStr) || 0;\n this.pingFailedAttempts.set(peerIdStr, prev + 1);\n }\n if (response.success) {\n this.pingFailedAttempts.set(peerIdStr, 0);\n }\n const madeAttempts = this.pingFailedAttempts.get(peerIdStr) || 0;\n if (madeAttempts >= this.config.pingsBeforePeerRenewed) {\n const newPeer = this.peerManager.requestRenew(peerId);\n await this.subscribe(newPeer);\n }\n }\n}\n//# sourceMappingURL=subscription_monitor.js.map","import { createDecoder } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { groupByContentTopic, Logger } from \"@waku/utils\";\nimport { SubscriptionMonitor } from \"./subscription_monitor.js\";\nconst log = new Logger(\"sdk:filter:subscription\");\nexport class Subscription {\n pubsubTopic;\n protocol;\n config;\n monitor;\n subscriptionCallbacks = new Map();\n constructor(pubsubTopic, protocol, connectionManager, peerManager, libp2p, config, lightPush) {\n this.pubsubTopic = pubsubTopic;\n this.protocol = protocol;\n this.config = config;\n this.pubsubTopic = pubsubTopic;\n this.monitor = new SubscriptionMonitor({\n pubsubTopic,\n config,\n libp2p,\n connectionManager,\n filter: protocol,\n peerManager,\n lightPush,\n activeSubscriptions: this.subscriptionCallbacks\n });\n }\n async subscribe(decoders, callback) {\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 if (this.config.enableLightPushFilterCheck) {\n decodersArray.push(createDecoder(this.monitor.reservedContentTopic, this.pubsubTopic));\n }\n const decodersGroupedByCT = groupByContentTopic(decodersArray);\n const contentTopics = Array.from(decodersGroupedByCT.keys());\n const peers = await this.monitor.getPeers();\n const promises = peers.map(async (peer) => {\n return this.protocol.subscribe(this.pubsubTopic, peer, contentTopics);\n });\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 // don't handle case of internal content topic\n if (contentTopic === this.monitor.reservedContentTopic) {\n return;\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.monitor.start();\n return finalResult;\n }\n async unsubscribe(contentTopics) {\n const peers = await this.monitor.getPeers();\n const promises = peers.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.monitor.stop();\n }\n return finalResult;\n }\n async ping() {\n const peers = await this.monitor.getPeers();\n const promises = peers.map((peer) => this.protocol.ping(peer));\n const results = await Promise.allSettled(promises);\n return this.handleResult(results, \"ping\");\n }\n async unsubscribeAll() {\n const peers = await this.monitor.getPeers();\n const promises = peers.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.monitor.stop();\n return finalResult;\n }\n async processIncomingMessage(message, peerIdStr) {\n const received = this.monitor.notifyMessageReceived(peerIdStr, message);\n if (received) {\n log.info(\"Message already received, skipping\");\n return;\n }\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}\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=subscription.js.map","export const DEFAULT_KEEP_ALIVE = 60_000;\nexport const DEFAULT_MAX_PINGS = 3;\nexport const DEFAULT_LIGHT_PUSH_FILTER_CHECK = false;\n//# sourceMappingURL=constants.js.map","import { FilterCore } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { ensurePubsubTopicIsConfigured, groupByContentTopic, Logger, shardInfoToPubsubTopics, toAsyncIterator } from \"@waku/utils\";\nimport { Subscription } from \"./subscription.js\";\nimport { buildConfig } from \"./utils.js\";\nconst log = new Logger(\"sdk:filter\");\nexport class Filter {\n protocol;\n config;\n connectionManager;\n libp2p;\n peerManager;\n lightPush;\n activeSubscriptions = new Map();\n constructor(params) {\n this.config = buildConfig(params.options);\n this.lightPush = params.lightPush;\n this.peerManager = params.peerManager;\n this.libp2p = params.libp2p;\n this.connectionManager = params.connectionManager;\n this.protocol = 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 }, params.connectionManager.pubsubTopics, params.libp2p);\n this.activeSubscriptions = new Map();\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 *\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) {\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);\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);\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) {\n const pubsubTopic = typeof pubsubTopicShardInfo == \"string\"\n ? pubsubTopicShardInfo\n : shardInfoToPubsubTopics(pubsubTopicShardInfo)?.[0];\n ensurePubsubTopicIsConfigured(pubsubTopic, this.protocol.pubsubTopics);\n const peerIds = this.peerManager.getPeers();\n if (peerIds.length === 0) {\n return {\n error: ProtocolError.NO_PEER_AVAILABLE,\n subscription: null\n };\n }\n log.info(`Creating filter subscription with ${peerIds.length} peers: `, peerIds.map((id) => id.toString()));\n const subscription = this.getActiveSubscription(pubsubTopic) ??\n this.setActiveSubscription(pubsubTopic, new Subscription(pubsubTopic, this.protocol, this.connectionManager, this.peerManager, this.libp2p, this.config, this.lightPush));\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) {\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);\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 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}\n//# sourceMappingURL=filter.js.map","import * as C from \"./constants.js\";\nexport const buildConfig = (config) => {\n return {\n keepAliveIntervalMs: config?.keepAliveIntervalMs || C.DEFAULT_KEEP_ALIVE,\n pingsBeforePeerRenewed: config?.pingsBeforePeerRenewed || C.DEFAULT_MAX_PINGS,\n enableLightPushFilterCheck: config?.enableLightPushFilterCheck || C.DEFAULT_LIGHT_PUSH_FILTER_CHECK\n };\n};\n//# sourceMappingURL=utils.js.map","export class TTLSet {\n ttlMs;\n cleanupIntervalId = null;\n entryTimestamps = new Map();\n /**\n * Creates a new CustomSet with TTL functionality.\n * @param ttlMs - The time-to-live in milliseconds for each entry.\n * @param cleanupIntervalMs - Optional interval between cleanup operations (default: 5000ms).\n */\n constructor(ttlMs, cleanupIntervalMs = 5000) {\n this.ttlMs = ttlMs;\n this.startCleanupInterval(cleanupIntervalMs);\n }\n dispose() {\n if (this.cleanupIntervalId !== null) {\n clearInterval(this.cleanupIntervalId);\n this.cleanupIntervalId = null;\n }\n this.entryTimestamps.clear();\n }\n add(entry) {\n this.entryTimestamps.set(entry, Date.now());\n return this;\n }\n has(entry) {\n return this.entryTimestamps.has(entry);\n }\n startCleanupInterval(intervalMs) {\n this.cleanupIntervalId = setInterval(() => {\n this.removeExpiredEntries();\n }, intervalMs);\n }\n removeExpiredEntries() {\n const now = Date.now();\n for (const [entry, timestamp] of this.entryTimestamps.entries()) {\n if (now - timestamp > this.ttlMs) {\n this.entryTimestamps.delete(entry);\n }\n }\n }\n}\n//# sourceMappingURL=utils.js.map","import { TypedEventEmitter } from \"@libp2p/interface\";\nimport { messageHashStr } from \"@waku/message-hash\";\nimport { Logger } from \"@waku/utils\";\nimport { TTLSet } from \"./utils.js\";\nconst log = new Logger(\"sdk:filter-subscription\");\nexport class Subscription {\n libp2p;\n pubsubTopic;\n protocol;\n peerManager;\n config;\n isStarted = false;\n inProgress = false;\n peers = new Set();\n peerFailures = new Map();\n receivedMessages = new TTLSet(60_000);\n callbacks = new Map();\n messageEmitter = new TypedEventEmitter();\n toSubscribeContentTopics = new Set();\n toUnsubscribeContentTopics = new Set();\n subscribeIntervalId = null;\n keepAliveIntervalId = null;\n get contentTopics() {\n const allTopics = Array.from(this.callbacks.keys()).map((k) => k.contentTopic);\n const uniqueTopics = new Set(allTopics).values();\n return Array.from(uniqueTopics);\n }\n constructor(params) {\n this.config = params.config;\n this.pubsubTopic = params.pubsubTopic;\n this.libp2p = params.libp2p;\n this.protocol = params.protocol;\n this.peerManager = params.peerManager;\n this.onPeerConnected = this.onPeerConnected.bind(this);\n this.onPeerDisconnected = this.onPeerDisconnected.bind(this);\n }\n start() {\n log.info(`Starting subscription for pubsubTopic: ${this.pubsubTopic}`);\n if (this.isStarted || this.inProgress) {\n log.info(\"Subscription already started or in progress, skipping start\");\n return;\n }\n this.inProgress = true;\n void this.attemptSubscribe({\n useNewContentTopics: false\n });\n this.setupSubscriptionInterval();\n this.setupKeepAliveInterval();\n this.setupEventListeners();\n this.isStarted = true;\n this.inProgress = false;\n log.info(`Subscription started for pubsubTopic: ${this.pubsubTopic}`);\n }\n stop() {\n log.info(`Stopping subscription for pubsubTopic: ${this.pubsubTopic}`);\n if (!this.isStarted || this.inProgress) {\n log.info(\"Subscription not started or stop in progress, skipping stop\");\n return;\n }\n this.inProgress = true;\n this.disposeEventListeners();\n this.disposeIntervals();\n void this.disposePeers();\n this.disposeHandlers();\n this.receivedMessages.dispose();\n this.inProgress = false;\n this.isStarted = false;\n log.info(`Subscription stopped for pubsubTopic: ${this.pubsubTopic}`);\n }\n isEmpty() {\n return this.callbacks.size === 0;\n }\n async add(decoder, callback) {\n const decoders = Array.isArray(decoder) ? decoder : [decoder];\n for (const decoder of decoders) {\n this.addSingle(decoder, callback);\n }\n return this.toSubscribeContentTopics.size > 0\n ? await this.attemptSubscribe({ useNewContentTopics: true })\n : true; // if content topic is not new - subscription, most likely exists\n }\n async remove(decoder) {\n const decoders = Array.isArray(decoder) ? decoder : [decoder];\n for (const decoder of decoders) {\n this.removeSingle(decoder);\n }\n return this.toUnsubscribeContentTopics.size > 0\n ? await this.attemptUnsubscribe({ useNewContentTopics: true })\n : true; // no need to unsubscribe if there are other decoders on the contentTopic\n }\n invoke(message, _peerId) {\n if (this.isMessageReceived(message)) {\n log.info(`Skipping invoking callbacks for already received message: pubsubTopic:${this.pubsubTopic}, peerId:${_peerId.toString()}, contentTopic:${message.contentTopic}`);\n return;\n }\n log.info(`Invoking message for contentTopic: ${message.contentTopic}`);\n this.messageEmitter.dispatchEvent(new CustomEvent(message.contentTopic, {\n detail: message\n }));\n }\n addSingle(decoder, callback) {\n log.info(`Adding subscription for contentTopic: ${decoder.contentTopic}`);\n const isNewContentTopic = !this.contentTopics.includes(decoder.contentTopic);\n if (isNewContentTopic) {\n this.toSubscribeContentTopics.add(decoder.contentTopic);\n }\n if (this.callbacks.has(decoder)) {\n log.warn(`Replacing callback associated associated with decoder with pubsubTopic:${decoder.pubsubTopic} and contentTopic:${decoder.contentTopic}`);\n const callback = this.callbacks.get(decoder);\n this.callbacks.delete(decoder);\n this.messageEmitter.removeEventListener(decoder.contentTopic, callback);\n }\n const eventHandler = (event) => {\n void (async () => {\n try {\n const message = await decoder.fromProtoObj(decoder.pubsubTopic, event.detail);\n void callback(message);\n }\n catch (err) {\n log.error(\"Error decoding message\", err);\n }\n })();\n };\n this.callbacks.set(decoder, eventHandler);\n this.messageEmitter.addEventListener(decoder.contentTopic, eventHandler);\n log.info(`Subscription added for contentTopic: ${decoder.contentTopic}, isNewContentTopic: ${isNewContentTopic}`);\n }\n removeSingle(decoder) {\n log.info(`Removing subscription for contentTopic: ${decoder.contentTopic}`);\n const callback = this.callbacks.get(decoder);\n if (!callback) {\n log.warn(`No callback associated with decoder with pubsubTopic:${decoder.pubsubTopic} and contentTopic:${decoder.contentTopic}`);\n }\n this.callbacks.delete(decoder);\n this.messageEmitter.removeEventListener(decoder.contentTopic, callback);\n const isCompletelyRemoved = !this.contentTopics.includes(decoder.contentTopic);\n if (isCompletelyRemoved) {\n this.toUnsubscribeContentTopics.add(decoder.contentTopic);\n }\n log.info(`Subscription removed for contentTopic: ${decoder.contentTopic}, isCompletelyRemoved: ${isCompletelyRemoved}`);\n }\n isMessageReceived(message) {\n try {\n const messageHash = messageHashStr(this.pubsubTopic, message);\n if (this.receivedMessages.has(messageHash)) {\n return true;\n }\n this.receivedMessages.add(messageHash);\n }\n catch (e) {\n // do nothing on throw, message will be handled as not received\n }\n return false;\n }\n setupSubscriptionInterval() {\n const subscriptionRefreshIntervalMs = 1000;\n log.info(`Setting up subscription interval with period ${subscriptionRefreshIntervalMs}ms`);\n this.subscribeIntervalId = setInterval(() => {\n const run = async () => {\n if (this.toSubscribeContentTopics.size > 0) {\n log.info(`Subscription interval: ${this.toSubscribeContentTopics.size} topics to subscribe`);\n void (await this.attemptSubscribe({ useNewContentTopics: true }));\n }\n if (this.toUnsubscribeContentTopics.size > 0) {\n log.info(`Subscription interval: ${this.toUnsubscribeContentTopics.size} topics to unsubscribe`);\n void (await this.attemptUnsubscribe({ useNewContentTopics: true }));\n }\n };\n void run();\n }, subscriptionRefreshIntervalMs);\n }\n setupKeepAliveInterval() {\n log.info(`Setting up keep-alive interval with period ${this.config.keepAliveIntervalMs}ms`);\n this.keepAliveIntervalId = setInterval(() => {\n const run = async () => {\n log.info(`Keep-alive interval running for ${this.peers.size} peers`);\n let peersToReplace = await Promise.all(Array.from(this.peers.values()).map(async (peer) => {\n const response = await this.protocol.ping(peer);\n if (response.success) {\n log.info(`Ping successful for peer: ${peer.toString()}`);\n this.peerFailures.set(peer, 0);\n return;\n }\n let failures = this.peerFailures.get(peer) || 0;\n failures += 1;\n this.peerFailures.set(peer, failures);\n log.warn(`Ping failed for peer: ${peer.toString()}, failures: ${failures}/${this.config.pingsBeforePeerRenewed}`);\n if (failures < this.config.pingsBeforePeerRenewed) {\n return;\n }\n log.info(`Peer ${peer.toString()} exceeded max failures (${this.config.pingsBeforePeerRenewed}), will be replaced`);\n return peer;\n }));\n peersToReplace = peersToReplace.filter((p) => !!p);\n await Promise.all(peersToReplace.map((p) => {\n this.peers.delete(p);\n this.peerFailures.delete(p);\n return this.requestUnsubscribe(p, this.contentTopics);\n }));\n if (peersToReplace.length > 0) {\n log.info(`Replacing ${peersToReplace.length} failed peers`);\n void (await this.attemptSubscribe({\n useNewContentTopics: false,\n useOnlyNewPeers: true\n }));\n }\n };\n void run();\n }, this.config.keepAliveIntervalMs);\n }\n setupEventListeners() {\n this.libp2p.addEventListener(\"peer:connect\", (e) => void this.onPeerConnected(e));\n this.libp2p.addEventListener(\"peer:disconnect\", (e) => void this.onPeerDisconnected(e));\n }\n disposeIntervals() {\n if (this.subscribeIntervalId) {\n clearInterval(this.subscribeIntervalId);\n }\n if (this.keepAliveIntervalId) {\n clearInterval(this.keepAliveIntervalId);\n }\n }\n disposeHandlers() {\n for (const [decoder, handler] of this.callbacks.entries()) {\n this.messageEmitter.removeEventListener(decoder.contentTopic, handler);\n }\n this.callbacks.clear();\n }\n async disposePeers() {\n await this.attemptUnsubscribe({ useNewContentTopics: false });\n this.peers.clear();\n this.peerFailures = new Map();\n }\n disposeEventListeners() {\n this.libp2p.removeEventListener(\"peer:connect\", this.onPeerConnected);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n onPeerConnected(event) {\n log.info(`Peer connected: ${event.detail.toString()}`);\n // skip the peer we already subscribe to\n if (this.peers.has(event.detail)) {\n log.info(`Peer ${event.detail.toString()} already subscribed, skipping`);\n return;\n }\n void this.attemptSubscribe({\n useNewContentTopics: false,\n useOnlyNewPeers: true\n });\n }\n onPeerDisconnected(event) {\n log.info(`Peer disconnected: ${event.detail.toString()}`);\n // ignore as the peer is not the one that is in use\n if (!this.peers.has(event.detail)) {\n log.info(`Disconnected peer ${event.detail.toString()} not in use, ignoring`);\n return;\n }\n log.info(`Active peer ${event.detail.toString()} disconnected, removing from peers list`);\n this.peers.delete(event.detail);\n void this.attemptSubscribe({\n useNewContentTopics: false,\n useOnlyNewPeers: true\n });\n }\n async attemptSubscribe(params) {\n const { useNewContentTopics, useOnlyNewPeers = false } = params;\n const contentTopics = useNewContentTopics\n ? Array.from(this.toSubscribeContentTopics)\n : this.contentTopics;\n log.info(`Attempting to subscribe: useNewContentTopics=${useNewContentTopics}, useOnlyNewPeers=${useOnlyNewPeers}, contentTopics=${contentTopics.length}`);\n if (!contentTopics.length) {\n log.warn(\"Requested content topics is an empty array, skipping\");\n return false;\n }\n const prevPeers = new Set(this.peers);\n const peersToAdd = this.peerManager.getPeers();\n for (const peer of peersToAdd) {\n if (this.peers.size >= this.config.numPeersToUse) {\n break;\n }\n this.peers.add(peer);\n }\n const peersToUse = useOnlyNewPeers\n ? Array.from(this.peers.values()).filter((p) => !prevPeers.has(p))\n : Array.from(this.peers.values());\n log.info(`Subscribing with ${peersToUse.length} peers for ${contentTopics.length} content topics`);\n if (useOnlyNewPeers && peersToUse.length === 0) {\n log.warn(`Requested to use only new peers, but no peers found, skipping`);\n return false;\n }\n const results = await Promise.all(peersToUse.map((p) => this.requestSubscribe(p, contentTopics)));\n const successCount = results.filter((r) => r).length;\n log.info(`Subscribe attempts completed: ${successCount}/${results.length} successful`);\n if (useNewContentTopics) {\n this.toSubscribeContentTopics = new Set();\n }\n return results.some((v) => v);\n }\n async requestSubscribe(peerId, contentTopics) {\n log.info(`requestSubscribe: pubsubTopic:${this.pubsubTopic}\\tcontentTopics:${contentTopics.join(\",\")}`);\n if (!contentTopics.length || !this.pubsubTopic) {\n log.warn(`requestSubscribe: no contentTopics or pubsubTopic provided, not sending subscribe request`);\n return false;\n }\n const response = await this.protocol.subscribe(this.pubsubTopic, peerId, contentTopics);\n if (response.failure) {\n log.warn(`requestSubscribe: Failed to subscribe ${this.pubsubTopic} to ${peerId.toString()} with error:${response.failure.error} for contentTopics:${contentTopics}`);\n return false;\n }\n log.info(`requestSubscribe: Subscribed ${this.pubsubTopic} to ${peerId.toString()} for contentTopics:${contentTopics}`);\n return true;\n }\n async attemptUnsubscribe(params) {\n const { useNewContentTopics } = params;\n const contentTopics = useNewContentTopics\n ? Array.from(this.toUnsubscribeContentTopics)\n : this.contentTopics;\n log.info(`Attempting to unsubscribe: useNewContentTopics=${useNewContentTopics}, contentTopics=${contentTopics.length}`);\n if (!contentTopics.length) {\n log.warn(\"Requested content topics is an empty array, skipping\");\n return false;\n }\n const peersToUse = Array.from(this.peers.values());\n const result = await Promise.all(peersToUse.map((p) => this.requestUnsubscribe(p, useNewContentTopics ? contentTopics : undefined)));\n const successCount = result.filter((r) => r).length;\n log.info(`Unsubscribe attempts completed: ${successCount}/${result.length} successful`);\n if (useNewContentTopics) {\n this.toUnsubscribeContentTopics = new Set();\n }\n return result.some((v) => v);\n }\n async requestUnsubscribe(peerId, contentTopics) {\n const response = contentTopics\n ? await this.protocol.unsubscribe(this.pubsubTopic, peerId, contentTopics)\n : await this.protocol.unsubscribeAll(this.pubsubTopic, peerId);\n if (response.failure) {\n log.warn(`requestUnsubscribe: Failed to unsubscribe for pubsubTopic:${this.pubsubTopic} from peerId:${peerId.toString()} with error:${response.failure?.error} for contentTopics:${contentTopics}`);\n return false;\n }\n log.info(`requestUnsubscribe: Unsubscribed pubsubTopic:${this.pubsubTopic} from peerId:${peerId.toString()} for contentTopics:${contentTopics}`);\n return true;\n }\n}\n//# sourceMappingURL=subscription.js.map","import { FilterCore } from \"@waku/core\";\nimport { Logger } from \"@waku/utils\";\nimport { Subscription } from \"./subscription.js\";\nconst log = new Logger(\"sdk:next-filter\");\nexport class Filter {\n libp2p;\n protocol;\n peerManager;\n connectionManager;\n config;\n subscriptions = new Map();\n constructor(params) {\n this.config = {\n numPeersToUse: 2,\n pingsBeforePeerRenewed: 3,\n keepAliveIntervalMs: 60_000,\n ...params.options\n };\n this.libp2p = params.libp2p;\n this.peerManager = params.peerManager;\n this.connectionManager = params.connectionManager;\n this.protocol = new FilterCore(this.onIncomingMessage.bind(this), params.connectionManager.pubsubTopics, params.libp2p);\n }\n /**\n * Unsubscribes from all active subscriptions across all pubsub topics.\n *\n * @example\n * // Clean up all subscriptions when React component unmounts\n * useEffect(() => {\n * return () => filter.unsubscribeAll();\n * }, [filter]);\n *\n * @example\n * // Reset subscriptions and start over\n * filter.unsubscribeAll();\n * await filter.subscribe(newDecoder, newCallback);\n */\n unsubscribeAll() {\n for (const subscription of this.subscriptions.values()) {\n subscription.stop();\n }\n this.subscriptions.clear();\n }\n /**\n * Subscribes to messages with specified decoders and executes callback when a message is received.\n * In case no peers available initially - will delay subscription till connects to any peer.\n *\n * @param decoders - Single decoder or array of decoders to subscribe to. All decoders must share the same pubsubTopic.\n * @param callback - Function called when a message matching the decoder's contentTopic is received.\n * @returns Promise that resolves to true if subscription was successful, false otherwise.\n *\n * @example\n * // Subscribe to a single content topic\n * await filter.subscribe(decoder, (msg) => console.log(msg));\n *\n * @example\n * // Subscribe to multiple content topics with the same pubsub topic\n * await filter.subscribe([decoder1, decoder2], (msg) => console.log(msg));\n *\n * @example\n * // Handle subscription failure\n * const success = await filter.subscribe(decoder, handleMessage);\n * if (!success) {\n * console.error(\"Failed to subscribe\");\n * }\n */\n async subscribe(decoder, callback) {\n const decoders = Array.isArray(decoder) ? decoder : [decoder];\n if (decoders.length === 0) {\n throw Error(\"Cannot subscribe with 0 decoders.\");\n }\n const pubsubTopics = decoders.map((v) => v.pubsubTopic);\n const contentTopics = decoders.map((v) => v.contentTopic);\n // doing this for simplicity, we can enable subscription for more than one PubsubTopic at once later when requested\n if (!this.isSamePubsubTopic(decoders)) {\n throw Error(`Cannot subscribe to more than one pubsub topic at the same time, got pubsubTopics:${pubsubTopics}`);\n }\n log.info(`Subscribing to content topic: ${contentTopics}, pubsub topic: ${pubsubTopics}`);\n const supportedPubsubTopic = this.connectionManager.pubsubTopics.includes(pubsubTopics[0]);\n if (!supportedPubsubTopic) {\n throw Error(`Pubsub topic ${pubsubTopics[0]} has not been configured on this instance.`);\n }\n let subscription = this.subscriptions.get(pubsubTopics[0]);\n if (!subscription) {\n subscription = new Subscription({\n pubsubTopic: pubsubTopics[0],\n libp2p: this.libp2p,\n protocol: this.protocol,\n config: this.config,\n peerManager: this.peerManager\n });\n subscription.start();\n }\n const result = await subscription.add(decoders, callback);\n this.subscriptions.set(pubsubTopics[0], subscription);\n log.info(`Subscription ${result ? \"successful\" : \"failed\"} for content topic: ${contentTopics}`);\n return result;\n }\n /**\n * Unsubscribes from messages with specified decoders.\n *\n * @param decoders - Single decoder or array of decoders to unsubscribe from. All decoders must share the same pubsubTopic.\n * @returns Promise that resolves to true if unsubscription was successful, false otherwise.\n *\n * @example\n * // Unsubscribe from a single decoder\n * await filter.unsubscribe(decoder);\n *\n * @example\n * // Unsubscribe from multiple decoders at once\n * await filter.unsubscribe([decoder1, decoder2]);\n *\n * @example\n * // Handle unsubscription failure\n * const success = await filter.unsubscribe(decoder);\n * if (!success) {\n * console.error(\"Failed to unsubscribe\");\n * }\n */\n async unsubscribe(decoder) {\n const decoders = Array.isArray(decoder) ? decoder : [decoder];\n if (decoders.length === 0) {\n throw Error(\"Cannot unsubscribe with 0 decoders.\");\n }\n const pubsubTopics = decoders.map((v) => v.pubsubTopic);\n const contentTopics = decoders.map((v) => v.contentTopic);\n // doing this for simplicity, we can enable unsubscribing with more than one PubsubTopic at once later when requested\n if (!this.isSamePubsubTopic(decoders)) {\n throw Error(`Cannot unsubscribe with more than one pubsub topic at the same time, got pubsubTopics:${pubsubTopics}`);\n }\n log.info(`Unsubscribing from content topic: ${contentTopics}, pubsub topic: ${pubsubTopics}`);\n const supportedPubsubTopic = this.connectionManager.pubsubTopics.includes(pubsubTopics[0]);\n if (!supportedPubsubTopic) {\n throw Error(`Pubsub topic ${pubsubTopics[0]} has not been configured on this instance.`);\n }\n const subscription = this.subscriptions.get(pubsubTopics[0]);\n if (!subscription) {\n log.warn(\"No subscriptions associated with the decoder.\");\n return false;\n }\n const result = await subscription.remove(decoders);\n if (subscription.isEmpty()) {\n log.warn(\"Subscription has no decoders anymore, terminating it.\");\n subscription.stop();\n this.subscriptions.delete(pubsubTopics[0]);\n }\n log.info(`Unsubscribing ${result ? \"successful\" : \"failed\"} for content topic: ${contentTopics}`);\n return result;\n }\n async onIncomingMessage(pubsubTopic, message, peerId) {\n log.info(`Received message for pubsubTopic:${pubsubTopic}, contentTopic:${message.contentTopic}, peerId:${peerId.toString()}`);\n const subscription = this.subscriptions.get(pubsubTopic);\n if (!subscription) {\n log.error(`No subscription locally registered for topic ${pubsubTopic}`);\n return;\n }\n subscription.invoke(message, peerId);\n }\n isSamePubsubTopic(decoders) {\n const topics = new Set();\n for (const decoder of decoders) {\n topics.add(decoder.pubsubTopic);\n }\n return topics.size === 1;\n }\n}\n//# sourceMappingURL=filter.js.map","import { TypedEventEmitter } from \"@libp2p/interface\";\nimport { FilterCodecs, LightPushCodec } from \"@waku/core\";\nimport { HealthStatus, HealthStatusChangeEvents } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nconst log = new Logger(\"health-indicator\");\n/**\n * HealthIndicator monitors the health status of a Waku node by tracking peer connections\n * and their supported protocols.\n *\n * The health status can be one of three states:\n * - Unhealthy: No peer connections\n * - MinimallyHealthy: At least 1 peer supporting both Filter and LightPush protocols\n * - SufficientlyHealthy: At least 2 peers supporting both Filter and LightPush protocols\n *\n * @example\n * // Create and start a health indicator\n * const healthIndicator = new HealthIndicator({ libp2p: node.libp2p });\n * healthIndicator.start();\n *\n * // Listen for health status changes\n * healthIndicator.addEventListener(HealthStatusChangeEvents.StatusChange, (event) => {\n * console.log(`Health status changed to: ${event.detail}`);\n * });\n *\n * // Get current health status\n * console.log(`Current health: ${healthIndicator.toString()}`);\n *\n * // Clean up when done\n * healthIndicator.stop();\n *\n * @implements {IHealthIndicator}\n */\nexport class HealthIndicator extends TypedEventEmitter {\n libp2p;\n value = HealthStatus.Unhealthy;\n constructor(params) {\n super();\n this.libp2p = params.libp2p;\n this.onPeerIdentify = this.onPeerIdentify.bind(this);\n this.onPeerDisconnected = this.onPeerDisconnected.bind(this);\n }\n /**\n * Starts monitoring the health status by adding event listeners to libp2p events.\n * Listens to peer connect and disconnect events to determine the node's health status.\n */\n start() {\n log.info(\"start: adding listeners to libp2p\");\n this.libp2p.addEventListener(\"peer:identify\", this.onPeerIdentify);\n this.libp2p.addEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n /**\n * Stops monitoring the health status by removing event listeners from libp2p events.\n * Cleans up the peer connect and disconnect event listeners.\n */\n stop() {\n log.info(\"stop: removing listeners to libp2p\");\n this.libp2p.removeEventListener(\"peer:identify\", this.onPeerIdentify);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onPeerDisconnected);\n }\n /**\n * Returns the current health status as a string.\n * @returns {string} Current health status (Unhealthy, MinimallyHealthy, or SufficientlyHealthy)\n */\n toString() {\n return this.value;\n }\n /**\n * Returns the current health status value.\n * @returns {string} Current health status (Unhealthy, MinimallyHealthy, or SufficientlyHealthy)\n */\n toValue() {\n return this.value;\n }\n async onPeerDisconnected(_event) {\n log.info(`onPeerDisconnected: received libp2p event`);\n const connections = this.libp2p.getConnections();\n // we handle only Unhealthy here and onPeerIdentify will cover other cases\n if (connections.length > 0) {\n log.info(\"onPeerDisconnected: has connections, ignoring\");\n }\n this.value = HealthStatus.Unhealthy;\n log.info(`onPeerDisconnected: node identified as ${this.value}`);\n this.dispatchHealthEvent();\n }\n async onPeerIdentify(_event) {\n log.info(`onPeerIdentify: received libp2p event`);\n const connections = this.libp2p.getConnections();\n const peers = await Promise.all(connections.map(async (c) => {\n try {\n return await this.libp2p.peerStore.get(c.remotePeer);\n }\n catch (e) {\n return null;\n }\n }));\n const filterPeers = peers.filter((p) => p?.protocols.includes(FilterCodecs.SUBSCRIBE)).length;\n const lightPushPeers = peers.filter((p) => p?.protocols.includes(LightPushCodec)).length;\n if (filterPeers === 0 || lightPushPeers === 0) {\n this.value = HealthStatus.Unhealthy;\n }\n else if (filterPeers >= 2 && lightPushPeers >= 2) {\n this.value = HealthStatus.SufficientlyHealthy;\n }\n else if (filterPeers === 1 && lightPushPeers === 1) {\n this.value = HealthStatus.MinimallyHealthy;\n }\n else {\n log.error(`onPeerChange: unexpected state, cannot identify health status of the node: Filter:${filterPeers}; LightPush:${lightPushPeers}`);\n }\n log.info(`onPeerChange: node identified as ${this.value}`);\n this.dispatchHealthEvent();\n }\n dispatchHealthEvent() {\n this.dispatchEvent(new CustomEvent(HealthStatusChangeEvents.StatusChange, {\n detail: this.value\n }));\n }\n}\n//# sourceMappingURL=health_indicator.js.map","import { ProtocolError } from \"@waku/interfaces\";\nexport const shouldPeerBeChanged = (failure) => {\n const toBeChanged = failure === ProtocolError.REMOTE_PEER_REJECTED ||\n failure === ProtocolError.NO_RESPONSE ||\n failure === ProtocolError.RLN_PROOF_GENERATION ||\n failure === ProtocolError.NO_PEER_AVAILABLE;\n if (toBeChanged) {\n return true;\n }\n return false;\n};\nexport const timeout = (timeout) => {\n return new Promise((_, reject) => setTimeout(() => reject(new Error(\"Task timeout\")), timeout));\n};\n//# sourceMappingURL=utils.js.map","import { Logger } from \"@waku/utils\";\nimport { shouldPeerBeChanged, timeout } from \"./utils.js\";\nconst MAX_CONCURRENT_TASKS = 5;\nconst TASK_TIMEOUT_MS = 10_000;\nconst log = new Logger(\"sdk:retry-manager\");\nexport class RetryManager {\n intervalID = null;\n retryIntervalMs;\n inProgress = 0;\n queue = [];\n peerManager;\n constructor(config) {\n this.peerManager = config.peerManager;\n this.retryIntervalMs = config.retryIntervalMs;\n }\n start() {\n this.intervalID = setInterval(() => {\n this.processQueue();\n }, this.retryIntervalMs);\n }\n stop() {\n if (this.intervalID) {\n clearInterval(this.intervalID);\n this.intervalID = null;\n }\n }\n push(callback, maxAttempts) {\n this.queue.push({\n maxAttempts,\n callback\n });\n }\n processQueue() {\n if (this.queue.length === 0) {\n log.info(\"processQueue: queue is empty\");\n return;\n }\n while (this.queue.length && this.inProgress < MAX_CONCURRENT_TASKS) {\n const task = this.queue.shift();\n if (task) {\n this.scheduleTask(task);\n }\n }\n }\n scheduleTask(task) {\n const delayedTask = async () => {\n return this.taskExecutor(task);\n };\n // schedule execution ASAP\n // need to use setTimeout to avoid blocking main execution\n setTimeout(delayedTask, 100);\n }\n async taskExecutor(task) {\n const peerId = this.peerManager.getPeers()[0];\n if (!peerId) {\n log.warn(\"scheduleTask: no peers, skipping\");\n return;\n }\n try {\n this.inProgress += 1;\n const response = await Promise.race([\n timeout(TASK_TIMEOUT_MS),\n task.callback(peerId)\n ]);\n if (response?.failure) {\n throw Error(response.failure.error);\n }\n log.info(\"scheduleTask: executed successfully\");\n if (task.maxAttempts === 0) {\n log.warn(\"scheduleTask: discarded a task due to limit of max attempts\");\n return;\n }\n this.queue.push({\n ...task,\n maxAttempts: task.maxAttempts - 1\n });\n }\n catch (_err) {\n const error = _err;\n log.error(\"scheduleTask: task execution failed with error:\", error);\n if (shouldPeerBeChanged(error.message)) {\n this.peerManager.requestRenew(peerId);\n }\n if (task.maxAttempts === 0) {\n log.warn(\"scheduleTask: discarded a task due to limit of max attempts\");\n return;\n }\n this.queue.push({\n ...task,\n maxAttempts: task.maxAttempts - 1\n });\n }\n finally {\n this.inProgress -= 1;\n }\n }\n}\n//# sourceMappingURL=retry_manager.js.map","import { LightPushCore } from \"@waku/core\";\nimport { ProtocolError } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { RetryManager } from \"./retry_manager.js\";\nconst log = new Logger(\"sdk:light-push\");\nconst DEFAULT_MAX_ATTEMPTS = 3;\nconst DEFAULT_SEND_OPTIONS = {\n autoRetry: true,\n retryIntervalMs: 1000,\n maxAttempts: DEFAULT_MAX_ATTEMPTS,\n numPeersToUse: 1\n};\nexport class LightPush {\n config;\n retryManager;\n peerManager;\n protocol;\n constructor(params) {\n this.config = {\n ...DEFAULT_SEND_OPTIONS,\n ...(params.options || {})\n };\n this.peerManager = params.peerManager;\n this.protocol = new LightPushCore(params.connectionManager.pubsubTopics, params.libp2p);\n this.retryManager = new RetryManager({\n peerManager: params.peerManager,\n retryIntervalMs: this.config.retryIntervalMs\n });\n }\n start() {\n this.retryManager.start();\n }\n stop() {\n this.retryManager.stop();\n }\n async send(encoder, message, options = {}) {\n options = {\n ...this.config,\n ...options\n };\n const { pubsubTopic } = encoder;\n log.info(\"send: attempting to send a message to pubsubTopic:\", pubsubTopic);\n if (!this.protocol.pubsubTopics.includes(pubsubTopic)) {\n return {\n successes: [],\n failures: [\n {\n error: ProtocolError.TOPIC_NOT_CONFIGURED\n }\n ]\n };\n }\n const peerIds = this.peerManager\n .getPeers()\n .slice(0, this.config.numPeersToUse);\n if (peerIds.length === 0) {\n return {\n successes: [],\n failures: [\n {\n error: ProtocolError.NO_PEER_AVAILABLE\n }\n ]\n };\n }\n const coreResults = await Promise.all(peerIds.map((peerId) => this.protocol.send(encoder, message, peerId).catch((_e) => ({\n success: null,\n failure: {\n error: ProtocolError.GENERIC_FAIL\n }\n }))));\n const results = {\n successes: coreResults\n .filter((v) => v.success)\n .map((v) => v.success),\n failures: coreResults\n .filter((v) => v.failure)\n .map((v) => v.failure)\n };\n if (options.autoRetry && results.successes.length === 0) {\n const sendCallback = (peerId) => this.protocol.send(encoder, message, peerId);\n this.retryManager.push(sendCallback.bind(this), options.maxAttempts || DEFAULT_MAX_ATTEMPTS);\n }\n return results;\n }\n}\n//# sourceMappingURL=light_push.js.map","import { Logger } from \"@waku/utils\";\nconst log = new Logger(\"peer-manager\");\nconst DEFAULT_NUM_PEERS_TO_USE = 2;\nconst CONNECTION_LOCK_TAG = \"peer-manager-lock\";\nexport class PeerManager {\n numPeersToUse;\n libp2p;\n constructor(params) {\n this.onConnected = this.onConnected.bind(this);\n this.onDisconnected = this.onDisconnected.bind(this);\n this.numPeersToUse =\n params?.config?.numPeersToUse || DEFAULT_NUM_PEERS_TO_USE;\n this.libp2p = params.libp2p;\n }\n start() {\n this.startConnectionListener();\n }\n stop() {\n this.stopConnectionListener();\n }\n getPeers() {\n return this.getLockedConnections().map((c) => c.remotePeer);\n }\n requestRenew(peerId) {\n const lockedConnections = this.getLockedConnections();\n const neededPeers = this.numPeersToUse - lockedConnections.length;\n if (neededPeers === 0) {\n return;\n }\n const connections = this.getUnlockedConnections()\n .filter((c) => !c.remotePeer.equals(peerId))\n .slice(0, neededPeers)\n .map((c) => this.lockConnection(c))\n .map((c) => c.remotePeer);\n const newPeerId = connections[0];\n if (!newPeerId) {\n log.warn(`requestRenew: Couldn't renew peer ${peerId.toString()} - no peers.`);\n return;\n }\n log.info(`requestRenew: Renewed peer ${peerId.toString()} to ${newPeerId.toString()}`);\n return newPeerId;\n }\n startConnectionListener() {\n this.libp2p.addEventListener(\"peer:connect\", this.onConnected);\n this.libp2p.addEventListener(\"peer:disconnect\", this.onDisconnected);\n }\n stopConnectionListener() {\n this.libp2p.removeEventListener(\"peer:connect\", this.onConnected);\n this.libp2p.removeEventListener(\"peer:disconnect\", this.onDisconnected);\n }\n onConnected(event) {\n const peerId = event.detail;\n this.lockPeerIfNeeded(peerId);\n }\n onDisconnected(event) {\n const peerId = event.detail;\n this.requestRenew(peerId);\n }\n lockPeerIfNeeded(peerId) {\n const lockedConnections = this.getLockedConnections();\n const neededPeers = this.numPeersToUse - lockedConnections.length;\n if (neededPeers === 0) {\n return;\n }\n this.getUnlockedConnections()\n .filter((c) => c.remotePeer.equals(peerId))\n .map((c) => this.lockConnection(c));\n }\n getLockedConnections() {\n return this.libp2p\n .getConnections()\n .filter((c) => c.status === \"open\" && this.isConnectionLocked(c));\n }\n getUnlockedConnections() {\n return this.libp2p\n .getConnections()\n .filter((c) => c.status === \"open\" && !this.isConnectionLocked(c));\n }\n lockConnection(c) {\n log.info(`requestRenew: Locking connection for peerId=${c.remotePeer.toString()}`);\n c.tags.push(CONNECTION_LOCK_TAG);\n return c;\n }\n isConnectionLocked(c) {\n return c.tags.includes(CONNECTION_LOCK_TAG);\n }\n}\n//# sourceMappingURL=peer_manager.js.map","import { StoreCore } from \"@waku/core\";\nimport { messageHash } from \"@waku/message-hash\";\nimport { ensurePubsubTopicIsConfigured, isDefined, Logger } from \"@waku/utils\";\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 Store {\n options;\n peerManager;\n connectionManager;\n protocol;\n constructor(params) {\n this.options = params.options || {};\n this.peerManager = params.peerManager;\n this.connectionManager = params.connectionManager;\n this.protocol = new StoreCore(params.connectionManager.pubsubTopics, params.libp2p);\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.getPeerToUse();\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 async getPeerToUse() {\n let peerId;\n if (this.options?.peer) {\n const connectedPeers = await this.connectionManager.getConnectedPeers();\n const peer = connectedPeers.find((p) => p.id.toString() === this.options?.peer);\n peerId = peer?.id;\n if (!peerId) {\n log.warn(`Passed node to use for Store not found: ${this.options.peer}. Attempting to use random peers.`);\n }\n }\n const peerIds = this.peerManager.getPeers();\n if (peerIds.length > 0) {\n // TODO(weboko): implement smart way of getting a peer https://github.com/waku-org/js-waku/issues/2243\n return peerIds[Math.floor(Math.random() * peerIds.length)];\n }\n log.error(\"No peers available to use.\");\n return;\n }\n}\n//# sourceMappingURL=store.js.map","import { isPeerId } from \"@libp2p/interface\";\nimport { multiaddr } from \"@multiformats/multiaddr\";\nimport { DEFAULT_NUM_SHARDS } from \"@waku/interfaces\";\nimport { contentTopicToShardIndex } from \"@waku/utils\";\nexport const mapToPeerIdOrMultiaddr = (peerId) => {\n return isPeerId(peerId) ? peerId : multiaddr(peerId);\n};\nexport const decoderParamsToShardInfo = (params, networkConfig) => {\n const clusterId = (params.shardInfo?.clusterId ||\n networkConfig.clusterId);\n const shardsUnderCluster = params.shardInfo && \"shardsUnderCluster\" in params.shardInfo\n ? params.shardInfo.shardsUnderCluster\n : DEFAULT_NUM_SHARDS;\n const shardIndex = params.shardInfo && \"shard\" in params.shardInfo\n ? params.shardInfo.shard\n : contentTopicToShardIndex(params.contentTopic, shardsUnderCluster);\n return {\n clusterId,\n shard: shardIndex\n };\n};\nexport const isShardCompatible = (shardInfo, networkConfig) => {\n if (networkConfig.clusterId !== shardInfo.clusterId) {\n return false;\n }\n if (\"shards\" in networkConfig &&\n !networkConfig.shards.includes(shardInfo.shard)) {\n return false;\n }\n return true;\n};\n//# sourceMappingURL=utils.js.map","import { FilterCodecs, LightPushCodec, StoreCodec } from \"@waku/core\";\nimport { Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nconst log = new Logger(\"wait-for-remote-peer\");\n/**\n * @deprecated Since @waku/sdk 0.29.0. Will be removed from 0.31.0\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 // if no protocols or empty array passed - try to derive from mounted\n protocols = protocols?.length ? protocols : getEnabledProtocols(waku);\n const connections = waku.libp2p.getConnections();\n if (!waku.isStarted()) {\n throw Error(\"Waku node is not started\");\n }\n for (const protocol of protocols) {\n switch (protocol) {\n case Protocols.Relay:\n if (!waku.relay)\n throw Error(\"Cannot wait for Relay peer: protocol not mounted\");\n break;\n case Protocols.LightPush:\n if (!waku.lightPush)\n throw Error(\"Cannot wait for LightPush peer: protocol not mounted\");\n break;\n case Protocols.Store:\n if (!waku.store)\n throw Error(\"Cannot wait for Store peer: protocol not mounted\");\n break;\n case Protocols.Filter:\n if (!waku.filter)\n throw Error(\"Cannot wait for Filter peer: protocol not mounted\");\n break;\n }\n }\n const promises = [waitForProtocols(waku, protocols)];\n if (connections.length > 0 && !protocols.includes(Protocols.Relay)) {\n promises.push(waitForMetadata(waku, protocols));\n }\n if (timeoutMs) {\n await rejectOnTimeout(Promise.any(promises), timeoutMs, \"Timed out waiting for a remote peer.\");\n }\n else {\n await Promise.any(promises);\n }\n}\n/**\n * Waits for required peers to be connected.\n */\nasync function waitForProtocols(waku, protocols) {\n const promises = [];\n if (waku.relay && protocols.includes(Protocols.Relay)) {\n promises.push(waku.relay.waitForPeers());\n }\n if (waku.store && protocols.includes(Protocols.Store)) {\n promises.push(waitForConnectedPeer(StoreCodec, waku.libp2p));\n }\n if (waku.lightPush && protocols.includes(Protocols.LightPush)) {\n promises.push(waitForConnectedPeer(LightPushCodec, waku.libp2p));\n }\n if (waku.filter && protocols.includes(Protocols.Filter)) {\n promises.push(waitForConnectedPeer(FilterCodecs.SUBSCRIBE, waku.libp2p));\n }\n return Promise.all(promises);\n}\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(codec, libp2p) {\n log.info(`Waiting for ${codec} peer.`);\n await new Promise((resolve) => {\n const cb = (async (evt) => {\n if (evt.detail?.protocols?.includes(codec)) {\n const metadataService = libp2p.services.metadata;\n if (!metadataService) {\n libp2p.removeEventListener(\"peer:identify\", cb);\n resolve();\n return;\n }\n try {\n await metadataService.confirmOrAttemptHandshake(evt.detail.peerId);\n libp2p.removeEventListener(\"peer:identify\", cb);\n resolve();\n }\n catch (e) {\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\") {\n log.error(\"Connection closed. Some peers can be on different shard.\");\n }\n log.error(`Error waiting for metadata: ${e}`);\n }\n }\n });\n libp2p.addEventListener(\"peer:identify\", cb);\n });\n}\n/**\n * Checks existing connections for needed metadata.\n */\nasync function waitForMetadata(waku, protocols) {\n const connectedPeers = waku.libp2p.getPeers();\n const metadataService = waku.libp2p.services.metadata;\n const enabledCodes = mapProtocolsToCodecs(protocols);\n if (!connectedPeers.length || !metadataService) {\n log.info(`Skipping waitForMetadata due to missing connections:${connectedPeers.length} or metadataService:${!!metadataService}`);\n return;\n }\n for (const peerId of connectedPeers) {\n try {\n const peer = await waku.libp2p.peerStore.get(peerId);\n const hasSomeCodes = peer.protocols.some((c) => enabledCodes.has(c));\n if (hasSomeCodes) {\n const response = await metadataService.confirmOrAttemptHandshake(peerId);\n if (!response.error) {\n peer.protocols.forEach((c) => {\n if (enabledCodes.has(c)) {\n enabledCodes.set(c, true);\n }\n });\n const confirmedAllCodecs = Array.from(enabledCodes.values()).every((v) => v);\n if (confirmedAllCodecs) {\n return;\n }\n }\n }\n }\n catch (e) {\n // eslint-disable-next-line @typescript-eslint/no-explicit-any\n if (e.code === \"ERR_CONNECTION_BEING_CLOSED\") {\n log.error(\"Connection closed. Some peers can be on different shard.\");\n }\n log.error(`Error while iterating through peers: ${e}`);\n continue;\n }\n }\n}\nconst awaitTimeout = (ms, rejectReason) => new Promise((_resolve, reject) => setTimeout(() => reject(Error(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}\nfunction mapProtocolsToCodecs(protocols) {\n const codecs = new Map();\n const protocolToCodec = {\n [Protocols.Filter]: FilterCodecs.SUBSCRIBE,\n [Protocols.LightPush]: LightPushCodec,\n [Protocols.Store]: StoreCodec\n };\n for (const protocol of protocols) {\n if (protocolToCodec[protocol]) {\n codecs.set(protocolToCodec[protocol], false);\n }\n }\n return codecs;\n}\n//# sourceMappingURL=wait_for_remote_peer.js.map","import { ConnectionManager, createDecoder, createEncoder, StoreCodec } from \"@waku/core\";\nimport { DefaultNetworkConfig, Protocols } from \"@waku/interfaces\";\nimport { Logger } from \"@waku/utils\";\nimport { Filter } from \"../filter/index.js\";\nimport { NextFilter } from \"../filter_next/index.js\";\nimport { HealthIndicator } from \"../health_indicator/index.js\";\nimport { LightPush } from \"../light_push/index.js\";\nimport { PeerManager } from \"../peer_manager/index.js\";\nimport { Store } from \"../store/index.js\";\nimport { decoderParamsToShardInfo, isShardCompatible, mapToPeerIdOrMultiaddr } from \"./utils.js\";\nimport { waitForRemotePeer } from \"./wait_for_remote_peer.js\";\nconst log = new Logger(\"waku\");\nexport class WakuNode {\n pubsubTopics;\n libp2p;\n relay;\n store;\n filter;\n nextFilter;\n lightPush;\n connectionManager;\n health;\n networkConfig;\n // needed to create a lock for async operations\n _nodeStateLock = false;\n _nodeStarted = false;\n peerManager;\n constructor(pubsubTopics, options, libp2p, protocolsEnabled, relay) {\n this.pubsubTopics = pubsubTopics;\n this.relay = relay;\n this.libp2p = libp2p;\n this.networkConfig = options.networkConfig || DefaultNetworkConfig;\n protocolsEnabled = {\n filter: false,\n lightpush: false,\n store: false,\n ...protocolsEnabled\n };\n const peerId = this.libp2p.peerId.toString();\n this.connectionManager = new ConnectionManager({\n libp2p,\n relay: this.relay,\n pubsubTopics: this.pubsubTopics,\n config: options?.connectionManager\n });\n this.peerManager = new PeerManager({\n libp2p,\n config: {\n numPeersToUse: options.numPeersToUse\n }\n });\n this.health = new HealthIndicator({ libp2p });\n if (protocolsEnabled.store) {\n if (options.store?.peer) {\n this.connectionManager\n .rawDialPeerWithProtocols(options.store.peer, [StoreCodec])\n .catch((e) => {\n log.error(\"Failed to dial store peer\", e);\n });\n }\n this.store = new Store({\n libp2p,\n connectionManager: this.connectionManager,\n peerManager: this.peerManager,\n options: {\n peer: options.store?.peer\n }\n });\n }\n if (protocolsEnabled.lightpush) {\n this.lightPush = new LightPush({\n libp2p,\n peerManager: this.peerManager,\n connectionManager: this.connectionManager,\n options: options?.lightPush\n });\n }\n if (protocolsEnabled.filter) {\n this.filter = new Filter({\n libp2p,\n connectionManager: this.connectionManager,\n peerManager: this.peerManager,\n lightPush: this.lightPush,\n options: options.filter\n });\n this.nextFilter = new NextFilter({\n libp2p,\n connectionManager: this.connectionManager,\n peerManager: this.peerManager,\n options: options.filter\n });\n }\n log.info(\"Waku node created\", peerId, `relay: ${!!this.relay}, store: ${!!this.store}, light push: ${!!this\n .lightPush}, filter: ${!!this.filter}`);\n }\n get peerId() {\n return this.libp2p.peerId;\n }\n get protocols() {\n return this.libp2p.getProtocols();\n }\n async dial(peer, protocols) {\n const _protocols = protocols ?? [];\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 const peerId = mapToPeerIdOrMultiaddr(peer);\n log.info(`Dialing to ${peerId.toString()} with protocols ${_protocols}`);\n return await this.connectionManager.rawDialPeerWithProtocols(peer, codecs);\n }\n async start() {\n if (this._nodeStateLock || this.isStarted())\n return;\n this._nodeStateLock = true;\n await this.libp2p.start();\n this.peerManager.start();\n this.health.start();\n this.lightPush?.start();\n this._nodeStateLock = false;\n this._nodeStarted = true;\n }\n async stop() {\n if (this._nodeStateLock || !this.isStarted())\n return;\n this._nodeStateLock = true;\n this.lightPush?.stop();\n this.health.stop();\n this.peerManager.stop();\n this.connectionManager.stop();\n await this.libp2p.stop();\n this._nodeStateLock = false;\n this._nodeStarted = false;\n }\n async getConnectedPeers() {\n return this.connectionManager.getConnectedPeers();\n }\n async waitForPeers(protocols, timeoutMs) {\n return waitForRemotePeer(this, protocols, timeoutMs);\n }\n isStarted() {\n return this._nodeStarted && this.libp2p.status === \"started\";\n }\n isConnected() {\n return this.connectionManager.isConnected();\n }\n createDecoder(params) {\n const singleShardInfo = decoderParamsToShardInfo(params, this.networkConfig);\n log.info(`Creating Decoder with input:${JSON.stringify(params.shardInfo)}, determined:${JSON.stringify(singleShardInfo)}, expected:${JSON.stringify(this.networkConfig)}.`);\n if (!isShardCompatible(singleShardInfo, this.networkConfig)) {\n throw Error(`Cannot create decoder: incompatible shard configuration.`);\n }\n return createDecoder(params.contentTopic, singleShardInfo);\n }\n createEncoder(params) {\n const singleShardInfo = decoderParamsToShardInfo(params, this.networkConfig);\n log.info(`Creating Encoder with input:${JSON.stringify(params.shardInfo)}, determined:${JSON.stringify(singleShardInfo)}, expected:${JSON.stringify(this.networkConfig)}.`);\n if (!isShardCompatible(singleShardInfo, this.networkConfig)) {\n throw Error(`Cannot create encoder: incompatible shard configuration.`);\n }\n return createEncoder({\n contentTopic: params.contentTopic,\n ephemeral: params.ephemeral,\n pubsubTopicShardInfo: singleShardInfo\n });\n }\n}\n//# sourceMappingURL=waku.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 static name = 'AbortError';\n constructor(message = 'The operation was aborted') {\n super(message);\n this.name = 'AbortError';\n }\n}\n/**\n * Thrown when a remote Peer ID does not match the expected one\n */\nexport class UnexpectedPeerError extends Error {\n static name = 'UnexpectedPeerError';\n constructor(message = 'Unexpected Peer') {\n super(message);\n this.name = 'UnexpectedPeerError';\n }\n}\n/**\n * Thrown when a crypto exchange fails\n */\nexport class InvalidCryptoExchangeError extends Error {\n static name = 'InvalidCryptoExchangeError';\n constructor(message = 'Invalid crypto exchange') {\n super(message);\n this.name = 'InvalidCryptoExchangeError';\n }\n}\n/**\n * Thrown when invalid parameters are passed to a function or method call\n */\nexport class InvalidParametersError extends Error {\n static name = 'InvalidParametersError';\n constructor(message = 'Invalid parameters') {\n super(message);\n this.name = 'InvalidParametersError';\n }\n}\n/**\n * Thrown when a public key is invalid\n */\nexport class InvalidPublicKeyError extends Error {\n static name = 'InvalidPublicKeyError';\n constructor(message = 'Invalid public key') {\n super(message);\n this.name = 'InvalidPublicKeyError';\n }\n}\n/**\n * Thrown when a private key is invalid\n */\nexport class InvalidPrivateKeyError extends Error {\n static name = 'InvalidPrivateKeyError';\n constructor(message = 'Invalid private key') {\n super(message);\n this.name = 'InvalidPrivateKeyError';\n }\n}\n/**\n * Thrown when a operation is unsupported\n */\nexport class UnsupportedOperationError extends Error {\n static name = 'UnsupportedOperationError';\n constructor(message = 'Unsupported operation') {\n super(message);\n this.name = 'UnsupportedOperationError';\n }\n}\n/**\n * Thrown when a connection is closing\n */\nexport class ConnectionClosingError extends Error {\n static name = 'ConnectionClosingError';\n constructor(message = 'The connection is closing') {\n super(message);\n this.name = 'ConnectionClosingError';\n }\n}\n/**\n * Thrown when a connection is closed\n */\nexport class ConnectionClosedError extends Error {\n static name = 'ConnectionClosedError';\n constructor(message = 'The connection is closed') {\n super(message);\n this.name = 'ConnectionClosedError';\n }\n}\n/**\n * Thrown when a connection fails\n */\nexport class ConnectionFailedError extends Error {\n static name = 'ConnectionFailedError';\n constructor(message = 'Connection failed') {\n super(message);\n this.name = 'ConnectionFailedError';\n }\n}\n/**\n * Thrown when the muxer is closed and an attempt to open a stream occurs\n */\nexport class MuxerClosedError extends Error {\n static name = 'MuxerClosedError';\n constructor(message = 'The muxer is closed') {\n super(message);\n this.name = 'MuxerClosedError';\n }\n}\n/**\n * Thrown when a protocol stream is reset by the remote muxer\n */\nexport class StreamResetError extends Error {\n static name = 'StreamResetError';\n constructor(message = 'The stream has been reset') {\n super(message);\n this.name = 'StreamResetError';\n }\n}\n/**\n * Thrown when a stream is in an invalid state\n */\nexport class StreamStateError extends Error {\n static name = 'StreamStateError';\n constructor(message = 'The stream is in an invalid state') {\n super(message);\n this.name = 'StreamStateError';\n }\n}\n/**\n * Thrown when a value could not be found\n */\nexport class NotFoundError extends Error {\n static name = 'NotFoundError';\n constructor(message = 'Not found') {\n super(message);\n this.name = 'NotFoundError';\n }\n}\n/**\n * Thrown when an invalid peer ID is encountered\n */\nexport class InvalidPeerIdError extends Error {\n static name = 'InvalidPeerIdError';\n constructor(message = 'Invalid PeerID') {\n super(message);\n this.name = 'InvalidPeerIdError';\n }\n}\n/**\n * Thrown when an invalid multiaddr is encountered\n */\nexport class InvalidMultiaddrError extends Error {\n static name = 'InvalidMultiaddrError';\n constructor(message = 'Invalid multiaddr') {\n super(message);\n this.name = 'InvalidMultiaddrError';\n }\n}\n/**\n * Thrown when an invalid CID is encountered\n */\nexport class InvalidCIDError extends Error {\n static name = 'InvalidCIDError';\n constructor(message = 'Invalid CID') {\n super(message);\n this.name = 'InvalidCIDError';\n }\n}\n/**\n * Thrown when an invalid multihash is encountered\n */\nexport class InvalidMultihashError extends Error {\n static name = 'InvalidMultihashError';\n constructor(message = 'Invalid Multihash') {\n super(message);\n this.name = 'InvalidMultihashError';\n }\n}\n/**\n * Thrown when a protocol is not supported\n */\nexport class UnsupportedProtocolError extends Error {\n static name = 'UnsupportedProtocolError';\n constructor(message = 'Unsupported protocol error') {\n super(message);\n this.name = 'UnsupportedProtocolError';\n }\n}\n/**\n * An invalid or malformed message was encountered during a protocol exchange\n */\nexport class InvalidMessageError extends Error {\n static name = 'InvalidMessageError';\n constructor(message = 'Invalid message') {\n super(message);\n this.name = 'InvalidMessageError';\n }\n}\n/**\n * Thrown when a remote peer sends a structurally valid message that does not\n * comply with the protocol\n */\nexport class ProtocolError extends Error {\n static name = 'ProtocolError';\n constructor(message = 'Protocol error') {\n super(message);\n this.name = 'ProtocolError';\n }\n}\n/**\n * Throw when an operation times out\n */\nexport class TimeoutError extends Error {\n static name = 'TimeoutError';\n constructor(message = 'Timed out') {\n super(message);\n this.name = 'TimeoutError';\n }\n}\n/**\n * Thrown when a startable component is interacted with but it has not been\n * started yet\n */\nexport class NotStartedError extends Error {\n static name = 'NotStartedError';\n constructor(message = 'Not started') {\n super(message);\n this.name = 'NotStartedError';\n }\n}\n/**\n * Thrown when a component is started that has already been started\n */\nexport class AlreadyStartedError extends Error {\n static name = 'AlreadyStartedError';\n constructor(message = 'Already started') {\n super(message);\n this.name = 'AlreadyStartedError';\n }\n}\n/**\n * Thrown when dialing an address failed\n */\nexport class DialError extends Error {\n static name = 'DialError';\n constructor(message = 'Dial error') {\n super(message);\n this.name = 'DialError';\n }\n}\n/**\n * Thrown when listening on an address failed\n */\nexport class ListenError extends Error {\n static name = 'ListenError';\n constructor(message = 'Listen error') {\n super(message);\n this.name = 'ListenError';\n }\n}\n/**\n * This error is thrown when a limited connection is encountered, i.e. if the\n * user tried to open a stream on a connection for a protocol that is not\n * configured to run over limited connections.\n */\nexport class LimitedConnectionError extends Error {\n static name = 'LimitedConnectionError';\n constructor(message = 'Limited connection') {\n super(message);\n this.name = 'LimitedConnectionError';\n }\n}\n/**\n * This error is thrown where there are too many inbound protocols streams open\n */\nexport class TooManyInboundProtocolStreamsError extends Error {\n static name = 'TooManyInboundProtocolStreamsError';\n constructor(message = 'Too many inbound protocol streams') {\n super(message);\n this.name = 'TooManyInboundProtocolStreamsError';\n }\n}\n/**\n * This error is thrown where there are too many outbound protocols streams open\n */\nexport class TooManyOutboundProtocolStreamsError extends Error {\n static name = 'TooManyOutboundProtocolStreamsError';\n constructor(message = 'Too many outbound protocol streams') {\n super(message);\n this.name = 'TooManyOutboundProtocolStreamsError';\n }\n}\n/**\n * Thrown when and attempt to operate on an unsupported key was made\n */\nexport class UnsupportedKeyTypeError extends Error {\n static name = 'UnsupportedKeyTypeError';\n constructor(message = 'Unsupported key type') {\n super(message);\n this.name = 'UnsupportedKeyTypeError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { Uint8ArrayList } from 'uint8arraylist';\nconst TAG_MASK = parseInt('11111', 2);\nconst LONG_LENGTH_MASK = parseInt('10000000', 2);\nconst LONG_LENGTH_BYTES_MASK = parseInt('01111111', 2);\nconst decoders = {\n 0x0: readSequence,\n 0x1: readSequence,\n 0x2: readInteger,\n 0x3: readBitString,\n 0x4: readOctetString,\n 0x5: readNull,\n 0x6: readObjectIdentifier,\n 0x10: readSequence,\n 0x16: readSequence,\n 0x30: readSequence\n};\nexport function decodeDer(buf, context = { offset: 0 }) {\n const tag = buf[context.offset] & TAG_MASK;\n context.offset++;\n if (decoders[tag] != null) {\n return decoders[tag](buf, context);\n }\n throw new Error('No decoder for tag ' + tag);\n}\nfunction readLength(buf, context) {\n let length = 0;\n if ((buf[context.offset] & LONG_LENGTH_MASK) === LONG_LENGTH_MASK) {\n // long length\n const count = buf[context.offset] & LONG_LENGTH_BYTES_MASK;\n let str = '0x';\n context.offset++;\n for (let i = 0; i < count; i++, context.offset++) {\n str += buf[context.offset].toString(16).padStart(2, '0');\n }\n length = parseInt(str, 16);\n }\n else {\n length = buf[context.offset];\n context.offset++;\n }\n return length;\n}\nfunction readSequence(buf, context) {\n readLength(buf, context);\n const entries = [];\n while (true) {\n if (context.offset >= buf.byteLength) {\n break;\n }\n const result = decodeDer(buf, context);\n if (result === null) {\n break;\n }\n entries.push(result);\n }\n return entries;\n}\nfunction readInteger(buf, context) {\n const length = readLength(buf, context);\n const start = context.offset;\n const end = context.offset + length;\n const vals = [];\n for (let i = start; i < end; i++) {\n if (i === start && buf[i] === 0) {\n continue;\n }\n vals.push(buf[i]);\n }\n context.offset += length;\n return Uint8Array.from(vals);\n}\nfunction readObjectIdentifier(buf, context) {\n const count = readLength(buf, context);\n const finalOffset = context.offset + count;\n const byte = buf[context.offset];\n context.offset++;\n let val1 = 0;\n let val2 = 0;\n if (byte < 40) {\n val1 = 0;\n val2 = byte;\n }\n else if (byte < 80) {\n val1 = 1;\n val2 = byte - 40;\n }\n else {\n val1 = 2;\n val2 = byte - 80;\n }\n let oid = `${val1}.${val2}`;\n let num = [];\n while (context.offset < finalOffset) {\n const byte = buf[context.offset];\n context.offset++;\n // remove msb\n num.push(byte & 0b01111111);\n if (byte < 128) {\n num.reverse();\n // reached the end of the encoding\n let val = 0;\n for (let i = 0; i < num.length; i++) {\n val += num[i] << (i * 7);\n }\n oid += `.${val}`;\n num = [];\n }\n }\n return oid;\n}\nfunction readNull(buf, context) {\n context.offset++;\n return null;\n}\nfunction readBitString(buf, context) {\n const length = readLength(buf, context);\n const unusedBits = buf[context.offset];\n context.offset++;\n const bytes = buf.subarray(context.offset, context.offset + length - 1);\n context.offset += length;\n if (unusedBits !== 0) {\n // need to shift all bytes along by this many bits\n throw new Error('Unused bits in bit string is unimplemented');\n }\n return bytes;\n}\nfunction readOctetString(buf, context) {\n const length = readLength(buf, context);\n const bytes = buf.subarray(context.offset, context.offset + length);\n context.offset += length;\n return bytes;\n}\nfunction encodeNumber(value) {\n let number = value.toString(16);\n if (number.length % 2 === 1) {\n number = '0' + number;\n }\n const array = new Uint8ArrayList();\n for (let i = 0; i < number.length; i += 2) {\n array.append(Uint8Array.from([parseInt(`${number[i]}${number[i + 1]}`, 16)]));\n }\n return array;\n}\nfunction encodeLength(bytes) {\n if (bytes.byteLength < 128) {\n return Uint8Array.from([bytes.byteLength]);\n }\n // long length\n const length = encodeNumber(bytes.byteLength);\n return new Uint8ArrayList(Uint8Array.from([\n length.byteLength | LONG_LENGTH_MASK\n ]), length);\n}\nexport function encodeInteger(value) {\n const contents = new Uint8ArrayList();\n const mask = 0b10000000;\n const positive = (value.subarray()[0] & mask) === mask;\n if (positive) {\n contents.append(Uint8Array.from([0]));\n }\n contents.append(value);\n return new Uint8ArrayList(Uint8Array.from([0x02]), encodeLength(contents), contents);\n}\nexport function encodeBitString(value) {\n // unused bits is always 0 with full-byte-only values\n const unusedBits = Uint8Array.from([0]);\n const contents = new Uint8ArrayList(unusedBits, value);\n return new Uint8ArrayList(Uint8Array.from([0x03]), encodeLength(contents), contents);\n}\nexport function encodeOctetString(value) {\n return new Uint8ArrayList(Uint8Array.from([0x04]), encodeLength(value), value);\n}\nexport function encodeSequence(values, tag = 0x30) {\n const output = new Uint8ArrayList();\n for (const buf of values) {\n output.append(buf);\n }\n return new Uint8ArrayList(Uint8Array.from([tag]), encodeLength(output), output);\n}\n//# sourceMappingURL=der.js.map","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { identity } from 'multiformats/hashes/identity';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { publicKeyToProtobuf } from '../index.js';\nimport { privateKeyToPKIMessage, publicKeyToPKIMessage } from './utils.js';\nimport { hashAndVerify, hashAndSign } from './index.js';\nexport class ECDSAPublicKey {\n type = 'ECDSA';\n jwk;\n _raw;\n constructor(jwk) {\n this.jwk = jwk;\n }\n get raw() {\n if (this._raw == null) {\n this._raw = publicKeyToPKIMessage(this.jwk);\n }\n return this._raw;\n }\n toMultihash() {\n return identity.digest(publicKeyToProtobuf(this));\n }\n toCID() {\n return CID.createV1(114, this.toMultihash());\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n async verify(data, sig) {\n return hashAndVerify(this.jwk, sig, data);\n }\n}\nexport class ECDSAPrivateKey {\n type = 'ECDSA';\n jwk;\n publicKey;\n _raw;\n constructor(jwk) {\n this.jwk = jwk;\n this.publicKey = new ECDSAPublicKey({\n crv: jwk.crv,\n ext: jwk.ext,\n key_ops: ['verify'],\n kty: 'EC',\n x: jwk.x,\n y: jwk.y\n });\n }\n get raw() {\n if (this._raw == null) {\n this._raw = privateKeyToPKIMessage(this.jwk);\n }\n return this._raw;\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n async sign(message) {\n return hashAndSign(this.jwk, message);\n }\n}\n//# sourceMappingURL=ecdsa.js.map","import { InvalidParametersError } from '@libp2p/interface';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { decodeDer, encodeBitString, encodeInteger, encodeOctetString, encodeSequence } from '../rsa/der.js';\nimport { ECDSAPrivateKey as ECDSAPrivateKeyClass, ECDSAPublicKey as ECDSAPublicKeyClass } from './ecdsa.js';\nimport { generateECDSAKey } from './index.js';\n// 1.2.840.10045.3.1.7 prime256v1 (ANSI X9.62 named elliptic curve)\nconst OID_256 = Uint8Array.from([0x06, 0x08, 0x2A, 0x86, 0x48, 0xCE, 0x3D, 0x03, 0x01, 0x07]);\n// 1.3.132.0.34 secp384r1 (SECG (Certicom) named elliptic curve)\nconst OID_384 = Uint8Array.from([0x06, 0x05, 0x2B, 0x81, 0x04, 0x00, 0x22]);\n// 1.3.132.0.35 secp521r1 (SECG (Certicom) named elliptic curve)\nconst OID_521 = Uint8Array.from([0x06, 0x05, 0x2B, 0x81, 0x04, 0x00, 0x23]);\nconst P_256_KEY_JWK = {\n ext: true,\n kty: 'EC',\n crv: 'P-256'\n};\nconst P_384_KEY_JWK = {\n ext: true,\n kty: 'EC',\n crv: 'P-384'\n};\nconst P_521_KEY_JWK = {\n ext: true,\n kty: 'EC',\n crv: 'P-521'\n};\nconst P_256_KEY_LENGTH = 32;\nconst P_384_KEY_LENGTH = 48;\nconst P_521_KEY_LENGTH = 66;\nexport function unmarshalECDSAPrivateKey(bytes) {\n const message = decodeDer(bytes);\n return pkiMessageToECDSAPrivateKey(message);\n}\nexport function pkiMessageToECDSAPrivateKey(message) {\n const privateKey = message[1];\n const d = uint8ArrayToString(privateKey, 'base64url');\n const coordinates = message[2][1][0];\n const offset = 1;\n let x;\n let y;\n if (privateKey.byteLength === P_256_KEY_LENGTH) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_256_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_256_KEY_LENGTH), 'base64url');\n return new ECDSAPrivateKeyClass({\n ...P_256_KEY_JWK,\n key_ops: ['sign'],\n d,\n x,\n y\n });\n }\n if (privateKey.byteLength === P_384_KEY_LENGTH) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_384_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_384_KEY_LENGTH), 'base64url');\n return new ECDSAPrivateKeyClass({\n ...P_384_KEY_JWK,\n key_ops: ['sign'],\n d,\n x,\n y\n });\n }\n if (privateKey.byteLength === P_521_KEY_LENGTH) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_521_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_521_KEY_LENGTH), 'base64url');\n return new ECDSAPrivateKeyClass({\n ...P_521_KEY_JWK,\n key_ops: ['sign'],\n d,\n x,\n y\n });\n }\n throw new InvalidParametersError(`Private key length was wrong length, got ${privateKey.byteLength}, expected 32, 48 or 66`);\n}\nexport function unmarshalECDSAPublicKey(bytes) {\n const message = decodeDer(bytes);\n return pkiMessageToECDSAPublicKey(message);\n}\nexport function pkiMessageToECDSAPublicKey(message) {\n const coordinates = message[1][1][0];\n const offset = 1;\n let x;\n let y;\n if (coordinates.byteLength === ((P_256_KEY_LENGTH * 2) + 1)) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_256_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_256_KEY_LENGTH), 'base64url');\n return new ECDSAPublicKeyClass({\n ...P_256_KEY_JWK,\n key_ops: ['verify'],\n x,\n y\n });\n }\n if (coordinates.byteLength === ((P_384_KEY_LENGTH * 2) + 1)) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_384_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_384_KEY_LENGTH), 'base64url');\n return new ECDSAPublicKeyClass({\n ...P_384_KEY_JWK,\n key_ops: ['verify'],\n x,\n y\n });\n }\n if (coordinates.byteLength === ((P_521_KEY_LENGTH * 2) + 1)) {\n x = uint8ArrayToString(coordinates.subarray(offset, offset + P_521_KEY_LENGTH), 'base64url');\n y = uint8ArrayToString(coordinates.subarray(offset + P_521_KEY_LENGTH), 'base64url');\n return new ECDSAPublicKeyClass({\n ...P_521_KEY_JWK,\n key_ops: ['verify'],\n x,\n y\n });\n }\n throw new InvalidParametersError(`coordinates were wrong length, got ${coordinates.byteLength}, expected 65, 97 or 133`);\n}\nexport function privateKeyToPKIMessage(privateKey) {\n return encodeSequence([\n encodeInteger(Uint8Array.from([1])), // header\n encodeOctetString(uint8ArrayFromString(privateKey.d ?? '', 'base64url')), // body\n encodeSequence([\n getOID(privateKey.crv)\n ], 0xA0),\n encodeSequence([\n encodeBitString(new Uint8ArrayList(Uint8Array.from([0x04]), uint8ArrayFromString(privateKey.x ?? '', 'base64url'), uint8ArrayFromString(privateKey.y ?? '', 'base64url')))\n ], 0xA1)\n ]).subarray();\n}\nexport function publicKeyToPKIMessage(publicKey) {\n return encodeSequence([\n encodeInteger(Uint8Array.from([1])), // header\n encodeSequence([\n getOID(publicKey.crv)\n ], 0xA0),\n encodeSequence([\n encodeBitString(new Uint8ArrayList(Uint8Array.from([0x04]), uint8ArrayFromString(publicKey.x ?? '', 'base64url'), uint8ArrayFromString(publicKey.y ?? '', 'base64url')))\n ], 0xA1)\n ]).subarray();\n}\nfunction getOID(curve) {\n if (curve === 'P-256') {\n return OID_256;\n }\n if (curve === 'P-384') {\n return OID_384;\n }\n if (curve === 'P-521') {\n return OID_521;\n }\n throw new InvalidParametersError(`Invalid curve ${curve}`);\n}\nexport async function generateECDSAKeyPair(curve = 'P-256') {\n const key = await generateECDSAKey(curve);\n return new ECDSAPrivateKeyClass(key.privateKey);\n}\nexport function ensureECDSAKey(key, length) {\n key = Uint8Array.from(key ?? []);\n if (key.length !== length) {\n throw new InvalidParametersError(`Key must be a Uint8Array of length ${length}, got ${key.length}`);\n }\n return key;\n}\n//# sourceMappingURL=utils.js.map","export const ECDSA_P_256_OID = '1.2.840.10045.3.1.7';\nexport const ECDSA_P_384_OID = '1.3.132.0.34';\nexport const ECDSA_P_521_OID = '1.3.132.0.35';\nexport async function generateECDSAKey(curve = 'P-256') {\n const keyPair = await crypto.subtle.generateKey({\n name: 'ECDSA',\n namedCurve: curve\n }, true, ['sign', 'verify']);\n return {\n publicKey: await crypto.subtle.exportKey('jwk', keyPair.publicKey),\n privateKey: await crypto.subtle.exportKey('jwk', keyPair.privateKey)\n };\n}\nexport async function hashAndSign(key, msg) {\n const privateKey = await crypto.subtle.importKey('jwk', key, {\n name: 'ECDSA',\n namedCurve: key.crv ?? 'P-256'\n }, false, ['sign']);\n const signature = await crypto.subtle.sign({\n name: 'ECDSA',\n hash: {\n name: 'SHA-256'\n }\n }, privateKey, msg.subarray());\n return new Uint8Array(signature, 0, signature.byteLength);\n}\nexport async function hashAndVerify(key, sig, msg) {\n const publicKey = await crypto.subtle.importKey('jwk', key, {\n name: 'ECDSA',\n namedCurve: key.crv ?? 'P-256'\n }, false, ['verify']);\n return crypto.subtle.verify({\n name: 'ECDSA',\n hash: {\n name: 'SHA-256'\n }\n }, publicKey, sig, msg.subarray());\n}\n//# sourceMappingURL=index.js.map","/**\n * Internal helpers for u64. BigUint64Array is too slow as per 2025, so we implement it using Uint32Array.\n * @todo re-check https://issues.chromium.org/issues/42212588\n * @module\n */\nconst U32_MASK64 = /* @__PURE__ */ BigInt(2 ** 32 - 1);\nconst _32n = /* @__PURE__ */ BigInt(32);\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","/**\n * SHA2-512 a.k.a. sha512 and sha384. It is slower than sha256 in js because u64 operations are slow.\n *\n * Check out [RFC 4634](https://datatracker.ietf.org/doc/html/rfc4634) and\n * [the paper on truncated SHA512/256](https://eprint.iacr.org/2010/548.pdf).\n * @module\n */\nimport { 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(outputLen = 64) {\n super(128, outputLen, 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}\nexport class SHA512_224 extends SHA512 {\n constructor() {\n super(28);\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 }\n}\nexport class SHA512_256 extends SHA512 {\n constructor() {\n super(32);\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 }\n}\nexport class SHA384 extends SHA512 {\n constructor() {\n super(48);\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 }\n}\n/** SHA2-512 hash function. */\nexport const sha512 = /* @__PURE__ */ wrapConstructor(() => new SHA512());\n/** SHA2-512/224 \"truncated\" hash function, with improved resistance to length extension attacks. */\nexport const sha512_224 = /* @__PURE__ */ wrapConstructor(() => new SHA512_224());\n/** SHA2-512/256 \"truncated\" hash function, with improved resistance to length extension attacks. */\nexport const sha512_256 = /* @__PURE__ */ wrapConstructor(() => new SHA512_256());\n/** SHA2-384 hash function. */\nexport const sha384 = /* @__PURE__ */ wrapConstructor(() => new SHA384());\n//# sourceMappingURL=sha512.js.map","/**\n * Hex, bytes and number utilities.\n * @module\n */\n/*! 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);\nexport function isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && 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 + ' boolean expected, got ' + value);\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 return hex === '' ? _0n : BigInt('0x' + hex); // Big Endian\n}\n// Built-in hex conversion https://caniuse.com/mdn-javascript_builtins_uint8array_fromhex\nconst hasHexBuiltin = \n// @ts-ignore\ntypeof Uint8Array.from([]).toHex === 'function' && typeof Uint8Array.fromHex === 'function';\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 * Convert byte array to hex string. Uses built-in function, when available.\n * @example bytesToHex(Uint8Array.from([0xca, 0xfe, 0x01, 0x23])) // 'cafe0123'\n */\nexport function bytesToHex(bytes) {\n abytes(bytes);\n // @ts-ignore\n if (hasHexBuiltin)\n return bytes.toHex();\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(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0; // '2' => 50-48\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10); // 'B' => 66-(65-10)\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10); // 'b' => 98-(97-10)\n return;\n}\n/**\n * Convert hex string to byte array. Uses built-in function, when available.\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 // @ts-ignore\n if (hasHexBuiltin)\n return Uint8Array.fromHex(hex);\n const hl = hex.length;\n const al = hl / 2;\n if (hl % 2)\n throw new Error('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; // multiply first octet, e.g. 'a3' => 10*16+3 => 160 + 3 => 163\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 hex string or Uint8Array, 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 + ' of length ' + expectedLength + ' expected, 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('string expected');\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 ' + 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) => (_1n << BigInt(n)) - _1n;\n// DRBG\nconst u8n = (len) => new Uint8Array(len); // 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(0)) => {\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 function');\n const val = object[fieldName];\n if (isOptional && val === undefined)\n return;\n if (!checkVal(val, object)) {\n throw new Error('param ' + String(fieldName) + ' is invalid. Expected ' + type + ', got ' + val);\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","/**\n * Utils for modular division and finite fields.\n * A finite field over 11 is integer number operations `mod 11`.\n * There is no division: it is replaced by modular multiplicative inverse.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { bitMask, bytesToNumberBE, bytesToNumberLE, ensureBytes, numberToBytesBE, numberToBytesLE, validateObject, } from \"./utils.js\";\n// prettier-ignore\nconst _0n = BigInt(0), _1n = BigInt(1), _2n = /* @__PURE__ */ BigInt(2), _3n = /* @__PURE__ */ BigInt(3);\n// prettier-ignore\nconst _4n = /* @__PURE__ */ BigInt(4), _5n = /* @__PURE__ */ BigInt(5), _8n = /* @__PURE__ */ BigInt(8);\n// prettier-ignore\nconst _9n = /* @__PURE__ */ BigInt(9), _16n = /* @__PURE__ */ 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 * @todo use field version && remove\n * @example\n * pow(2n, 6n, 11n) // 64n % 11n == 9n\n */\nexport function pow(num, power, modulo) {\n if (power < _0n)\n throw new Error('invalid exponent, negatives unsupported');\n if (modulo <= _0n)\n throw new Error('invalid modulus');\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/**\n * Inverses number over modulo.\n * Implemented using [Euclidean GCD](https://brilliant.org/wiki/extended-euclidean-algorithm/).\n */\nexport function invert(number, modulo) {\n if (number === _0n)\n throw new Error('invert: expected non-zero number');\n if (modulo <= _0n)\n throw new Error('invert: expected positive modulus, got ' + modulo);\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 // Crash instead of infinity loop, we cannot reasonable count until P.\n if (Z > 1000)\n throw new Error('Cannot find square root: likely non-prime P');\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}\n/**\n * Square root for a finite field. It will try to check if optimizations are applicable and fall back to 4:\n *\n * 1. P ≡ 3 (mod 4)\n * 2. P ≡ 5 (mod 8)\n * 3. P ≡ 9 (mod 16)\n * 4. Tonelli-Shanks algorithm\n *\n * 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 */\nexport function FpSqrt(P) {\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('invalid exponent, negatives unsupported');\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}\n/**\n * Legendre symbol.\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 */\nexport function FpLegendre(order) {\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.\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 * Fragile: always run a benchmark on a change.\n * Security 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're 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('invalid field: expected ORDER > 0, got ' + ORDER);\n const { nBitLength: BITS, nByteLength: BYTES } = nLength(ORDER, bitLen);\n if (BYTES > 2048)\n throw new Error('invalid field: expected ORDER of <= 2048 bytes');\n let sqrtP; // cached sqrtP\n const f = Object.freeze({\n ORDER,\n isLE,\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 ((n) => {\n if (!sqrtP)\n sqrtP = FpSqrt(ORDER);\n return sqrtP(f, n);\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('Field.fromBytes: expected ' + BYTES + ' 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 ? bytesToNumberLE(key) : bytesToNumberBE(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","/**\n * Methods for elliptic curve multiplication by scalars.\n * Contains wNAF, pippenger\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { nLength, validateField } from \"./modular.js\";\nimport { bitLen, bitMask, validateObject } from \"./utils.js\";\nconst _0n = BigInt(0);\nconst _1n = BigInt(1);\nfunction constTimeNegate(condition, item) {\n const neg = item.negate();\n return condition ? neg : item;\n}\nfunction validateW(W, bits) {\n if (!Number.isSafeInteger(W) || W <= 0 || W > bits)\n throw new Error('invalid window size, expected [1..' + bits + '], got W=' + W);\n}\nfunction calcWOpts(W, scalarBits) {\n validateW(W, scalarBits);\n const windows = Math.ceil(scalarBits / W) + 1; // W=8 33. Not 32, because we skip zero\n const windowSize = 2 ** (W - 1); // W=8 128. Not 256, because we skip zero\n const maxNumber = 2 ** W; // W=8 256\n const mask = bitMask(W); // W=8 255 == mask 0b11111111\n const shiftBy = BigInt(W); // W=8 8\n return { windows, windowSize, mask, maxNumber, shiftBy };\n}\nfunction calcOffsets(n, window, wOpts) {\n const { windowSize, mask, maxNumber, shiftBy } = wOpts;\n let wbits = Number(n & mask); // extract W bits.\n let nextN = n >> shiftBy; // shift number by W bits.\n // What actually happens here:\n // const highestBit = Number(mask ^ (mask >> 1n));\n // let wbits2 = wbits - 1; // skip zero\n // if (wbits2 & highestBit) { wbits2 ^= Number(mask); // (~);\n // split if bits > max: +224 => 256-32\n if (wbits > windowSize) {\n // we skip zero, which means instead of `>= size-1`, we do `> size`\n wbits -= maxNumber; // -32, can be maxNumber - wbits, but then we need to set isNeg here.\n nextN += _1n; // +256 (carry)\n }\n const offsetStart = window * windowSize;\n const offset = offsetStart + Math.abs(wbits) - 1; // -1 because we skip zero\n const isZero = wbits === 0; // is current window slice a 0?\n const isNeg = wbits < 0; // is current window slice negative?\n const isNegF = window % 2 !== 0; // fake random statement for noise\n const offsetF = offsetStart; // fake offset for noise\n return { nextN, offset, isZero, isNeg, isNegF, offsetF };\n}\nfunction validateMSMPoints(points, c) {\n if (!Array.isArray(points))\n throw new Error('array expected');\n points.forEach((p, i) => {\n if (!(p instanceof c))\n throw new Error('invalid point at index ' + i);\n });\n}\nfunction validateMSMScalars(scalars, field) {\n if (!Array.isArray(scalars))\n throw new Error('array of scalars expected');\n scalars.forEach((s, i) => {\n if (!field.isValid(s))\n throw new Error('invalid scalar at index ' + i);\n });\n}\n// Since points in different groups cannot be equal (different object constructor),\n// we can have single place to store precomputes.\n// Allows to make points frozen / immutable.\nconst pointPrecomputes = new WeakMap();\nconst pointWindowSizes = new WeakMap();\nfunction getW(P) {\n return pointWindowSizes.get(P) || 1;\n}\n/**\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 *\n * @todo Research returning 2d JS array of windows, instead of a single window.\n * This would allow windows to be in different memory locations\n */\nexport function wNAF(c, bits) {\n return {\n constTimeNegate,\n hasPrecomputes(elm) {\n return getW(elm) !== 1;\n },\n // non-const time multiplication ladder\n unsafeLadder(elm, n, 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 * @param elm Point instance\n * @param W window size\n * @returns precomputed point tables flattened to a single array\n */\n precomputeWindow(elm, W) {\n const { windows, windowSize } = calcWOpts(W, bits);\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 // i=1, bc we skip 0\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 // Smaller version:\n // https://github.com/paulmillr/noble-secp256k1/blob/47cb1669b6e506ad66b35fe7d76132ae97465da2/index.ts#L502-L541\n // TODO: check the scalar is less than group order?\n // wNAF behavior is undefined otherwise. But have to carefully remove\n // other checks before wNAF. ORDER == bits here.\n // Accumulators\n let p = c.ZERO;\n let f = c.BASE;\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 const wo = calcWOpts(W, bits);\n for (let window = 0; window < wo.windows; window++) {\n // (n === _0n) is handled and not early-exited. isEven and offsetF are used for noise\n const { nextN, offset, isZero, isNeg, isNegF, offsetF } = calcOffsets(n, window, wo);\n n = nextN;\n if (isZero) {\n // bits are 0: add garbage to fake point\n // Important part for const-time getPublicKey: add random \"noise\" point to f.\n f = f.add(constTimeNegate(isNegF, precomputes[offsetF]));\n }\n else {\n // bits are 1: add to result point\n p = p.add(constTimeNegate(isNeg, precomputes[offset]));\n }\n }\n // Return both real and fake points: JIT won't eliminate f.\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 /**\n * Implements ec unsafe (non const-time) 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 * @param acc accumulator point to add result of multiplication\n * @returns point\n */\n wNAFUnsafe(W, precomputes, n, acc = c.ZERO) {\n const wo = calcWOpts(W, bits);\n for (let window = 0; window < wo.windows; window++) {\n if (n === _0n)\n break; // Early-exit, skip 0 value\n const { nextN, offset, isZero, isNeg } = calcOffsets(n, window, wo);\n n = nextN;\n if (isZero) {\n // Window bits are 0: skip processing.\n // Move to next window.\n continue;\n }\n else {\n const item = precomputes[offset];\n acc = acc.add(isNeg ? item.negate() : item); // Re-using acc allows to save adds in MSM\n }\n }\n return acc;\n },\n getPrecomputes(W, P, transform) {\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 comp;\n },\n wNAFCached(P, n, transform) {\n const W = getW(P);\n return this.wNAF(W, this.getPrecomputes(W, P, transform), n);\n },\n wNAFCachedUnsafe(P, n, transform, prev) {\n const W = getW(P);\n if (W === 1)\n return this.unsafeLadder(P, n, prev); // For W=1 ladder is ~x2 faster\n return this.wNAFUnsafe(W, this.getPrecomputes(W, P, transform), n, prev);\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, bits);\n pointWindowSizes.set(P, W);\n pointPrecomputes.delete(P);\n },\n };\n}\n/**\n * Pippenger algorithm for multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * 30x faster vs naive addition on L=4096, 10x faster than precomputes.\n * For N=254bit, L=1, it does: 1024 ADD + 254 DBL. For L=5: 1536 ADD + 254 DBL.\n * Algorithmically constant-time (for same L), even when 1 point + scalar, or when scalar = 0.\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @param scalars array of L scalars (aka private keys / bigints)\n */\nexport function pippenger(c, fieldN, points, scalars) {\n // If we split scalars by some window (let's say 8 bits), every chunk will only\n // take 256 buckets even if there are 4096 scalars, also re-uses double.\n // TODO:\n // - https://eprint.iacr.org/2024/750.pdf\n // - https://tches.iacr.org/index.php/TCHES/article/view/10287\n // 0 is accepted in scalars\n validateMSMPoints(points, c);\n validateMSMScalars(scalars, fieldN);\n if (points.length !== scalars.length)\n throw new Error('arrays of points and scalars must have equal length');\n const zero = c.ZERO;\n const wbits = bitLen(BigInt(points.length));\n const windowSize = wbits > 12 ? wbits - 3 : wbits > 4 ? wbits - 2 : wbits ? 2 : 1; // in bits\n const MASK = bitMask(windowSize);\n const buckets = new Array(Number(MASK) + 1).fill(zero); // +1 for zero array\n const lastBits = Math.floor((fieldN.BITS - 1) / windowSize) * windowSize;\n let sum = zero;\n for (let i = lastBits; i >= 0; i -= windowSize) {\n buckets.fill(zero);\n for (let j = 0; j < scalars.length; j++) {\n const scalar = scalars[j];\n const wbits = Number((scalar >> BigInt(i)) & MASK);\n buckets[wbits] = buckets[wbits].add(points[j]);\n }\n let resI = zero; // not using this will do small speed-up, but will lose ct\n // Skip first bucket, because it is zero\n for (let j = buckets.length - 1, sumI = zero; j > 0; j--) {\n sumI = sumI.add(buckets[j]);\n resI = resI.add(sumI);\n }\n sum = sum.add(resI);\n if (i !== 0)\n for (let j = 0; j < windowSize; j++)\n sum = sum.double();\n }\n return sum;\n}\n/**\n * Precomputed multi-scalar multiplication (MSM, Pa + Qb + Rc + ...).\n * @param c Curve Point constructor\n * @param fieldN field over CURVE.N - important that it's not over CURVE.P\n * @param points array of L curve points\n * @returns function which multiplies points with scaars\n */\nexport function precomputeMSMUnsafe(c, fieldN, points, windowSize) {\n /**\n * Performance Analysis of Window-based Precomputation\n *\n * Base Case (256-bit scalar, 8-bit window):\n * - Standard precomputation requires:\n * - 31 additions per scalar × 256 scalars = 7,936 ops\n * - Plus 255 summary additions = 8,191 total ops\n * Note: Summary additions can be optimized via accumulator\n *\n * Chunked Precomputation Analysis:\n * - Using 32 chunks requires:\n * - 255 additions per chunk\n * - 256 doublings\n * - Total: (255 × 32) + 256 = 8,416 ops\n *\n * Memory Usage Comparison:\n * Window Size | Standard Points | Chunked Points\n * ------------|-----------------|---------------\n * 4-bit | 520 | 15\n * 8-bit | 4,224 | 255\n * 10-bit | 13,824 | 1,023\n * 16-bit | 557,056 | 65,535\n *\n * Key Advantages:\n * 1. Enables larger window sizes due to reduced memory overhead\n * 2. More efficient for smaller scalar counts:\n * - 16 chunks: (16 × 255) + 256 = 4,336 ops\n * - ~2x faster than standard 8,191 ops\n *\n * Limitations:\n * - Not suitable for plain precomputes (requires 256 constant doublings)\n * - Performance degrades with larger scalar counts:\n * - Optimal for ~256 scalars\n * - Less efficient for 4096+ scalars (Pippenger preferred)\n */\n validateW(windowSize, fieldN.BITS);\n validateMSMPoints(points, c);\n const zero = c.ZERO;\n const tableSize = 2 ** windowSize - 1; // table size (without zero)\n const chunks = Math.ceil(fieldN.BITS / windowSize); // chunks of item\n const MASK = bitMask(windowSize);\n const tables = points.map((p) => {\n const res = [];\n for (let i = 0, acc = p; i < tableSize; i++) {\n res.push(acc);\n acc = acc.add(p);\n }\n return res;\n });\n return (scalars) => {\n validateMSMScalars(scalars, fieldN);\n if (scalars.length > points.length)\n throw new Error('array of scalars must be smaller than array of points');\n let res = zero;\n for (let i = 0; i < chunks; i++) {\n // No need to double if accumulator is still zero.\n if (res !== zero)\n for (let j = 0; j < windowSize; j++)\n res = res.double();\n const shiftBy = BigInt(chunks * windowSize - (i + 1) * windowSize);\n for (let j = 0; j < scalars.length; j++) {\n const n = scalars[j];\n const curr = Number((n >> shiftBy) & MASK);\n if (!curr)\n continue; // skip zero scalars chunks\n res = res.add(tables[j][curr - 1]);\n }\n }\n return res;\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","/**\n * Twisted Edwards curve. The formula is: ax² + y² = 1 + dx²y².\n * For design rationale of types / exports, see weierstrass module documentation.\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { pippenger, validateBasic, wNAF, } from \"./curve.js\";\nimport { Field, mod } from \"./modular.js\";\n// prettier-ignore\nimport { abool, aInRange, bytesToHex, bytesToNumberLE, concatBytes, ensureBytes, memoized, numberToBytesLE, validateObject } 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 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 // Important:\n // There are some places where Fp.BYTES is used instead of nByteLength.\n // So far, everything has been tested with curves of Fp.BYTES == nByteLength.\n // TODO: test and find curves which behave otherwise.\n const MASK = _2n << (BigInt(nByteLength * 8) - _1n);\n const modP = Fp.create; // Function overrides\n const Fn = Field(CURVE.n, CURVE.nBitLength);\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, banZero = false) {\n const min = banZero ? _1n : _0n;\n aInRange('coordinate ' + title, n, min, MASK);\n }\n function aextpoint(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 aCoordinate('x', ex);\n aCoordinate('y', ey);\n aCoordinate('z', ez, true);\n aCoordinate('t', et);\n this.ex = ex;\n this.ey = ey;\n this.ez = ez;\n this.et = 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 // Multiscalar Multiplication\n static msm(points, scalars) {\n return pippenger(Point, Fn, points, scalars);\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 aextpoint(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 aextpoint(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 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 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 // Accepts optional accumulator to merge with multiply (important for sparse scalars)\n multiplyUnsafe(scalar, acc = Point.ZERO) {\n const n = scalar;\n aInRange('scalar', n, _0n, CURVE_ORDER); // 0 <= scalar < L\n if (n === _0n)\n return I;\n if (this.is0() || n === _1n)\n return this;\n return wnaf.wNAFCachedUnsafe(this, n, Point.normalizeZ, acc);\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 = bytesToNumberLE(normed);\n // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\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 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 const { scalar } = getPrivateScalar(privKey);\n return G.multiply(scalar); // reduced one call of `toRawBytes`\n }\n toRawBytes() {\n const { x, y } = this.toAffine();\n const bytes = 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 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(bytesToNumberLE(hash));\n }\n // Get the hashed private scalar per RFC8032 5.1.5\n function getPrivateScalar(key) {\n const len = Fp.BYTES;\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 return { head, prefix, scalar };\n }\n // Convenience method that creates public key from scalar. RFC8032 5.1.5\n function getExtendedPublicKey(key) {\n const { head, prefix, scalar } = getPrivateScalar(key);\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 = 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 aInRange('signature.s', s, _0n, CURVE_ORDER); // 0 <= s < l\n const res = concatBytes(R, numberToBytesLE(s, Fp.BYTES));\n return ensureBytes('result', res, Fp.BYTES * 2); // 64-byte signature\n }\n const verifyOpts = VERIFY_DEFAULT;\n /**\n * Verifies EdDSA signature against message and public key. RFC8032 5.1.7.\n * An extended group equation is checked.\n */\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 publicKey = ensureBytes('publicKey', publicKey, len);\n if (zip215 !== undefined)\n abool('zip215', zip215);\n if (prehash)\n msg = prehash(msg); // for ed25519ph, etc\n const s = bytesToNumberLE(sig.slice(len, 2 * len));\n let A, R, SB;\n try {\n // zip215=true is good for consensus-critical apps. =false follows RFC8032 / NIST186-5.\n // zip215=true: 0 <= y < MASK (2^256 for ed25519)\n // zip215=false: 0 <= y < P (2^255-19 for ed25519)\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 // Extended group equation\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 priv 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","/**\n * Montgomery curve methods. It's not really whole montgomery curve,\n * just bunch of very specific methods for X25519 / X448 from\n * [RFC 7748](https://www.rfc-editor.org/rfc/rfc7748)\n * @module\n */\n/*! 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// 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 let valid = '' + montgomeryBytes + ' or ' + fieldLen;\n throw new Error('invalid scalar, expected ' + valid + ' bytes, got ' + len);\n }\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","/**\n * ed25519 Twisted Edwards curve with following addons:\n * - X25519 ECDH\n * - Ristretto cofactor elimination\n * - Elligator hash-to-group / point indistinguishability\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha512 } from '@noble/hashes/sha2';\nimport { concatBytes, randomBytes, utf8ToBytes } from '@noble/hashes/utils';\nimport { pippenger } from \"./abstract/curve.js\";\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// 2n**255n - 19n\nconst ED25519_P = BigInt('57896044618658097711785492504343953926634992332820282019728792003956564819949');\n// √(-1) aka √(a) aka 2^((p-1)/4)\n// Fp.sqrt(Fp.neg(1))\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/** Weird / bogus points, useful for debugging. */\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 // Removing Fp.create() will still work, and is 10% faster on sign\n a: Fp.create(BigInt(-1)),\n // d is -121665/121666 a.k.a. Fp.neg(121665 * Fp.inv(121666))\n d: BigInt('37095705934669439343138083508754565189542113879843219016388785533085940283555'),\n // Finite field 2n**255n - 19n\n Fp,\n // Subgroup order 2n**252n + 27742317777372353535851937790883648493n;\n n: BigInt('7237005577332262213973186563042994240857116359379907606001950938285454250989'),\n h: _8n,\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 * @example\n * import { ed25519 } from '@noble/curves/ed25519';\n * const priv = ed25519.utils.randomPrivateKey();\n * const pub = ed25519.getPublicKey(priv);\n * const msg = new TextEncoder().encode('hello');\n * const sig = ed25519.sign(msg, priv);\n * ed25519.verify(sig, msg, pub); // Default mode: follows ZIP215\n * ed25519.verify(sig, msg, pub, { zip215: false }); // RFC8032 / FIPS 186-5\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})))();\n/**\n * ECDH using curve25519 aka x25519.\n * @example\n * import { x25519 } from '@noble/curves/ed25519';\n * const priv = 'a546e36bf0527c9d3b16154b82465edd62144c0ac1fc5a18506a2244ba449ac4';\n * const pub = 'e6db6867583030db3594c1a424b15f7c726624ec26b3353b10a903a6d0ab1c4c';\n * x25519.getSharedSecret(priv, pub) === x25519.scalarMult(priv, pub); // aliases\n * x25519.getPublicKey(priv) === x25519.scalarMultBase(priv);\n * x25519.getPublicKey(x25519.utils.randomPrivateKey());\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 aristp(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 static msm(points, scalars) {\n const Fn = Field(ed25519.CURVE.n, ed25519.CURVE.nBitLength);\n return pippenger(RistPoint, Fn, points, scalars);\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 aristp(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 aristp(other);\n return new RistPoint(this.ep.add(other.ep));\n }\n subtract(other) {\n aristp(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};\n/** @deprecated */\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=index.browser.js.map","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport {} from 'multiformats/hashes/digest';\nimport { identity } from 'multiformats/hashes/identity';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { publicKeyToProtobuf } from '../index.js';\nimport { ensureEd25519Key } from './utils.js';\nimport * as crypto from './index.js';\nexport class Ed25519PublicKey {\n type = 'Ed25519';\n raw;\n constructor(key) {\n this.raw = ensureEd25519Key(key, crypto.publicKeyLength);\n }\n toMultihash() {\n return identity.digest(publicKeyToProtobuf(this));\n }\n toCID() {\n return CID.createV1(114, this.toMultihash());\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n verify(data, sig) {\n return crypto.hashAndVerify(this.raw, sig, data);\n }\n}\nexport class Ed25519PrivateKey {\n type = 'Ed25519';\n raw;\n publicKey;\n // key - 64 byte Uint8Array containing private key\n // publicKey - 32 byte Uint8Array containing public key\n constructor(key, publicKey) {\n this.raw = ensureEd25519Key(key, crypto.privateKeyLength);\n this.publicKey = new Ed25519PublicKey(publicKey);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n sign(message) {\n return crypto.hashAndSign(this.raw, message);\n }\n}\n//# sourceMappingURL=ed25519.js.map","import { InvalidParametersError } from '@libp2p/interface';\nimport { Ed25519PublicKey as Ed25519PublicKeyClass, Ed25519PrivateKey as Ed25519PrivateKeyClass } from './ed25519.js';\nimport * as crypto from './index.js';\nexport function unmarshalEd25519PrivateKey(bytes) {\n // Try the old, redundant public key version\n if (bytes.length > crypto.privateKeyLength) {\n bytes = ensureEd25519Key(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 Ed25519PrivateKeyClass(privateKeyBytes, publicKeyBytes);\n }\n bytes = ensureEd25519Key(bytes, crypto.privateKeyLength);\n const privateKeyBytes = bytes.subarray(0, crypto.privateKeyLength);\n const publicKeyBytes = bytes.subarray(crypto.publicKeyLength);\n return new Ed25519PrivateKeyClass(privateKeyBytes, publicKeyBytes);\n}\nexport function unmarshalEd25519PublicKey(bytes) {\n bytes = ensureEd25519Key(bytes, crypto.publicKeyLength);\n return new Ed25519PublicKeyClass(bytes);\n}\nexport async function generateEd25519KeyPair() {\n const { privateKey, publicKey } = crypto.generateKey();\n return new Ed25519PrivateKeyClass(privateKey, publicKey);\n}\nexport async function generateEd25519KeyPairFromSeed(seed) {\n const { privateKey, publicKey } = crypto.generateKeyFromSeed(seed);\n return new Ed25519PrivateKeyClass(privateKey, publicKey);\n}\nexport function ensureEd25519Key(key, length) {\n key = Uint8Array.from(key ?? []);\n if (key.length !== length) {\n throw new InvalidParametersError(`Key must be a Uint8Array of length ${length}, got ${key.length}`);\n }\n return key;\n}\n//# sourceMappingURL=utils.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, message } from 'protons-runtime';\nexport var KeyType;\n(function (KeyType) {\n KeyType[\"RSA\"] = \"RSA\";\n KeyType[\"Ed25519\"] = \"Ed25519\";\n KeyType[\"secp256k1\"] = \"secp256k1\";\n KeyType[\"ECDSA\"] = \"ECDSA\";\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[\"ECDSA\"] = 3] = \"ECDSA\";\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, 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.Type = KeyType.codec().decode(reader);\n break;\n }\n case 2: {\n obj.Data = 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 PublicKey.encode = (obj) => {\n return encodeMessage(obj, PublicKey.codec());\n };\n PublicKey.decode = (buf, opts) => {\n return decodeMessage(buf, PublicKey.codec(), opts);\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, 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.Type = KeyType.codec().decode(reader);\n break;\n }\n case 2: {\n obj.Data = 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 PrivateKey.encode = (obj) => {\n return encodeMessage(obj, PrivateKey.codec());\n };\n PrivateKey.decode = (buf, opts) => {\n return decodeMessage(buf, PrivateKey.codec(), opts);\n };\n})(PrivateKey || (PrivateKey = {}));\n//# sourceMappingURL=keys.js.map","/**\n * Signing a message failed\n */\nexport class SigningError extends Error {\n constructor(message = 'An error occurred while signing a message') {\n super(message);\n this.name = 'SigningError';\n }\n}\n/**\n * Verifying a message signature failed\n */\nexport class VerificationError extends Error {\n constructor(message = 'An error occurred while verifying a message') {\n super(message);\n this.name = 'VerificationError';\n }\n}\n/**\n * WebCrypto was not available in the current context\n */\nexport class WebCryptoMissingError extends Error {\n constructor(message = 'Missing Web Crypto API') {\n super(message);\n this.name = 'WebCryptoMissingError';\n }\n}\n//# sourceMappingURL=errors.js.map","/* eslint-env browser */\nimport { WebCryptoMissingError } from '../errors.js';\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 new WebCryptoMissingError('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');\n }\n return nativeCrypto;\n }\n};\n//# sourceMappingURL=webcrypto.browser.js.map","import webcrypto from './webcrypto.js';\nexport default webcrypto;\n//# sourceMappingURL=index.js.map","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport {} from 'multiformats/hashes/digest';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { hashAndSign, utils, hashAndVerify } from './index.js';\nexport class RSAPublicKey {\n type = 'RSA';\n jwk;\n _raw;\n _multihash;\n constructor(jwk, digest) {\n this.jwk = jwk;\n this._multihash = digest;\n }\n get raw() {\n if (this._raw == null) {\n this._raw = utils.jwkToPkix(this.jwk);\n }\n return this._raw;\n }\n toMultihash() {\n return this._multihash;\n }\n toCID() {\n return CID.createV1(114, this._multihash);\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n verify(data, sig) {\n return hashAndVerify(this.jwk, sig, data);\n }\n}\nexport class RSAPrivateKey {\n type = 'RSA';\n jwk;\n _raw;\n publicKey;\n constructor(jwk, publicKey) {\n this.jwk = jwk;\n this.publicKey = publicKey;\n }\n get raw() {\n if (this._raw == null) {\n this._raw = utils.jwkToPkcs1(this.jwk);\n }\n return this._raw;\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n sign(message) {\n return hashAndSign(this.jwk, message);\n }\n}\n//# sourceMappingURL=rsa.js.map","import { InvalidParametersError } from '@libp2p/interface';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport randomBytes from '../../random-bytes.js';\nimport webcrypto from '../../webcrypto/index.js';\nimport * as utils from './utils.js';\nexport const RSAES_PKCS1_V1_5_OID = '1.2.840.113549.1.1.1';\nexport { utils };\nexport async function generateRSAKey(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}\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 InvalidParametersError('Private and public key are required');\n }\n return Promise.all([\n webcrypto.get().subtle.exportKey('jwk', pair.privateKey),\n webcrypto.get().subtle.exportKey('jwk', pair.publicKey)\n ]);\n}\nexport function rsaKeySize(jwk) {\n if (jwk.kty !== 'RSA') {\n throw new InvalidParametersError('invalid key type');\n }\n else if (jwk.n == null) {\n throw new InvalidParametersError('invalid key modulus');\n }\n const bytes = uint8ArrayFromString(jwk.n, 'base64url');\n return bytes.length * 8;\n}\n//# sourceMappingURL=index.browser.js.map","import { InvalidParametersError, InvalidPublicKeyError } from '@libp2p/interface';\nimport { sha256 } from '@noble/hashes/sha256';\nimport { create } from 'multiformats/hashes/digest';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\nimport { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport * as pb from '../keys.js';\nimport { decodeDer, encodeBitString, encodeInteger, encodeSequence } from './der.js';\nimport { RSAPrivateKey as RSAPrivateKeyClass, RSAPublicKey as RSAPublicKeyClass } from './rsa.js';\nimport { generateRSAKey, rsaKeySize } from './index.js';\nexport const MAX_RSA_KEY_SIZE = 8192;\nconst SHA2_256_CODE = 0x12;\nconst MAX_RSA_JWK_SIZE = 1062;\nconst RSA_ALGORITHM_IDENTIFIER = Uint8Array.from([\n 0x30, 0x0D, 0x06, 0x09, 0x2A, 0x86, 0x48, 0x86, 0xF7, 0x0D, 0x01, 0x01, 0x01, 0x05, 0x00\n]);\n/**\n * Convert a PKCS#1 in ASN1 DER format to a JWK private key\n */\nexport function pkcs1ToJwk(bytes) {\n const message = decodeDer(bytes);\n return pkcs1MessageToJwk(message);\n}\n/**\n * Convert a PKCS#1 in ASN1 DER format to a JWK private key\n */\nexport function pkcs1MessageToJwk(message) {\n return {\n n: uint8ArrayToString(message[1], 'base64url'),\n e: uint8ArrayToString(message[2], 'base64url'),\n d: uint8ArrayToString(message[3], 'base64url'),\n p: uint8ArrayToString(message[4], 'base64url'),\n q: uint8ArrayToString(message[5], 'base64url'),\n dp: uint8ArrayToString(message[6], 'base64url'),\n dq: uint8ArrayToString(message[7], 'base64url'),\n qi: uint8ArrayToString(message[8], 'base64url'),\n kty: 'RSA'\n };\n}\n/**\n * Convert a JWK private 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 InvalidParametersError('JWK was missing components');\n }\n return encodeSequence([\n encodeInteger(Uint8Array.from([0])),\n encodeInteger(uint8ArrayFromString(jwk.n, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.e, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.d, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.p, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.q, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.dp, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.dq, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.qi, 'base64url'))\n ]).subarray();\n}\n/**\n * Convert a PKIX in ASN1 DER format to a JWK public key\n */\nexport function pkixToJwk(bytes) {\n const message = decodeDer(bytes, {\n offset: 0\n });\n return pkixMessageToJwk(message);\n}\nexport function pkixMessageToJwk(message) {\n const keys = decodeDer(message[1], {\n offset: 0\n });\n // this looks fragile but DER is a canonical format so we are safe to have\n // deeply property chains like this\n return {\n kty: 'RSA',\n n: uint8ArrayToString(keys[0], 'base64url'),\n e: uint8ArrayToString(keys[1], 'base64url')\n };\n}\n/**\n * Convert a JWK public key to PKIX in ASN1 DER format\n */\nexport function jwkToPkix(jwk) {\n if (jwk.n == null || jwk.e == null) {\n throw new InvalidParametersError('JWK was missing components');\n }\n const subjectPublicKeyInfo = encodeSequence([\n RSA_ALGORITHM_IDENTIFIER,\n encodeBitString(encodeSequence([\n encodeInteger(uint8ArrayFromString(jwk.n, 'base64url')),\n encodeInteger(uint8ArrayFromString(jwk.e, 'base64url'))\n ]))\n ]);\n return subjectPublicKeyInfo.subarray();\n}\n/**\n * Turn PKCS#1 DER bytes into a PrivateKey\n */\nexport function pkcs1ToRSAPrivateKey(bytes) {\n const message = decodeDer(bytes);\n return pkcs1MessageToRSAPrivateKey(message);\n}\n/**\n * Turn PKCS#1 DER bytes into a PrivateKey\n */\nexport function pkcs1MessageToRSAPrivateKey(message) {\n const jwk = pkcs1MessageToJwk(message);\n return jwkToRSAPrivateKey(jwk);\n}\n/**\n * Turn a PKIX message into a PublicKey\n */\nexport function pkixToRSAPublicKey(bytes, digest) {\n if (bytes.byteLength >= MAX_RSA_JWK_SIZE) {\n throw new InvalidPublicKeyError('Key size is too large');\n }\n const message = decodeDer(bytes, {\n offset: 0\n });\n return pkixMessageToRSAPublicKey(message, bytes, digest);\n}\nexport function pkixMessageToRSAPublicKey(message, bytes, digest) {\n const jwk = pkixMessageToJwk(message);\n if (digest == null) {\n const hash = sha256(pb.PublicKey.encode({\n Type: pb.KeyType.RSA,\n Data: bytes\n }));\n digest = create(SHA2_256_CODE, hash);\n }\n return new RSAPublicKeyClass(jwk, digest);\n}\nexport function jwkToRSAPrivateKey(jwk) {\n if (rsaKeySize(jwk) > MAX_RSA_KEY_SIZE) {\n throw new InvalidParametersError('Key size is too large');\n }\n const keys = jwkToJWKKeyPair(jwk);\n const hash = sha256(pb.PublicKey.encode({\n Type: pb.KeyType.RSA,\n Data: jwkToPkix(keys.publicKey)\n }));\n const digest = create(SHA2_256_CODE, hash);\n return new RSAPrivateKeyClass(keys.privateKey, new RSAPublicKeyClass(keys.publicKey, digest));\n}\nexport async function generateRSAKeyPair(bits) {\n if (bits > MAX_RSA_KEY_SIZE) {\n throw new InvalidParametersError('Key size is too large');\n }\n const keys = await generateRSAKey(bits);\n const hash = sha256(pb.PublicKey.encode({\n Type: pb.KeyType.RSA,\n Data: jwkToPkix(keys.publicKey)\n }));\n const digest = create(SHA2_256_CODE, hash);\n return new RSAPrivateKeyClass(keys.privateKey, new RSAPublicKeyClass(keys.publicKey, digest));\n}\n/**\n * Takes a jwk key and returns a JWK KeyPair\n */\nexport function jwkToJWKKeyPair(key) {\n if (key == null) {\n throw new InvalidParametersError('Missing key parameter');\n }\n return {\n privateKey: key,\n publicKey: {\n kty: key.kty,\n n: key.n,\n e: key.e\n }\n };\n}\n//# sourceMappingURL=utils.js.map","/**\n * HMAC: RFC2104 message authentication code.\n * @module\n */\nimport { abytes, aexists, ahash } from \"./_assert.js\";\nimport { Hash, toBytes } from \"./utils.js\";\nexport class HMAC extends Hash {\n constructor(hash, _key) {\n super();\n this.finished = false;\n this.destroyed = false;\n ahash(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 aexists(this);\n this.iHash.update(buf);\n return this;\n }\n digestInto(out) {\n aexists(this);\n abytes(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 * @example\n * import { hmac } from '@noble/hashes/hmac';\n * import { sha256 } from '@noble/hashes/sha2';\n * const mac1 = hmac(sha256, 'key', 'message');\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 * Short Weierstrass curve methods. The formula is: y² = x³ + ax + b.\n *\n * ### Parameters\n *\n * To initialize a weierstrass curve, one needs to pass following params:\n *\n * * a: formula param\n * * b: formula param\n * * Fp: finite Field over which we'll do calculations. Can be complex (Fp2, Fp12)\n * * n: Curve prime subgroup order, total count of valid points in the field\n * * Gx: Base point (x, y) aka generator point x coordinate\n * * Gy: ...y coordinate\n * * h: cofactor, usually 1. h*n = curve group order (n is only subgroup order)\n * * lowS: whether to enable (default) or disable \"low-s\" non-malleable signatures\n *\n * ### Design rationale for types\n *\n * * Interaction between classes from different curves should fail:\n * `k256.Point.BASE.add(p256.Point.BASE)`\n * * For this purpose we want to use `instanceof` operator, which is fast and works during runtime\n * * Different calls of `curve()` would return different classes -\n * `curve(params) !== curve(params)`: if somebody decided to monkey-patch their curve,\n * it won't affect others\n *\n * TypeScript can't infer types for classes created inside a function. Classes is one instance\n * of nominative types in TypeScript and interfaces only check for shape, so it's hard to create\n * unique type for every function call.\n *\n * We can use generic types via some param, like curve opts, but that would:\n * 1. Enable interaction between `curve(params)` and `curve(params)` (curves of same params)\n * which is hard to debug.\n * 2. Params can be generic and we can't enforce them to be constant value:\n * if somebody creates curve from non-constant params,\n * it would be allowed to interact with other curves with non-constant params\n *\n * @todo https://www.typescriptlang.org/docs/handbook/release-notes/typescript-2-7.html#unique-symbol\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\n// prettier-ignore\nimport { pippenger, validateBasic, wNAF, } from \"./curve.js\";\n// prettier-ignore\nimport { Field, getMinHashLength, invert, mapHashToField, mod, validateField, } from \"./modular.js\";\n// prettier-ignore\nimport { aInRange, abool, bitMask, bytesToHex, bytesToNumberBE, concatBytes, createHmacDrbg, ensureBytes, hexToBytes, inRange, isBytes, memoized, numberToBytesBE, numberToHexUnpadded, validateObject } 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 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('invalid 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('invalid endomorphism, expected beta: bigint and splitScalar: function');\n }\n }\n return Object.freeze({ ...opts });\n}\nexport class DERErr extends Error {\n constructor(m = '') {\n super(m);\n }\n}\n/**\n * ASN.1 DER encoding utilities. ASN is very complex & fragile. Format:\n *\n * [0x30 (SEQUENCE), bytelength, 0x02 (INTEGER), intLength, R, 0x02 (INTEGER), intLength, S]\n *\n * Docs: https://letsencrypt.org/docs/a-warm-welcome-to-asn1-and-der/, https://luca.ntop.org/Teaching/Appunti/asn1.html\n */\nexport const DER = {\n // asn.1 DER encoding utils\n Err: DERErr,\n // Basic building block is TLV (Tag-Length-Value)\n _tlv: {\n encode: (tag, data) => {\n const { Err: E } = DER;\n if (tag < 0 || tag > 256)\n throw new E('tlv.encode: wrong tag');\n if (data.length & 1)\n throw new E('tlv.encode: unpadded data');\n const dataLen = data.length / 2;\n const len = numberToHexUnpadded(dataLen);\n if ((len.length / 2) & 128)\n throw new E('tlv.encode: long form length too big');\n // length of length with long form flag\n const lenLen = dataLen > 127 ? numberToHexUnpadded((len.length / 2) | 128) : '';\n const t = numberToHexUnpadded(tag);\n return t + lenLen + len + data;\n },\n // v - value, l - left bytes (unparsed)\n decode(tag, data) {\n const { Err: E } = DER;\n let pos = 0;\n if (tag < 0 || tag > 256)\n throw new E('tlv.encode: wrong tag');\n if (data.length < 2 || data[pos++] !== tag)\n throw new E('tlv.decode: wrong tlv');\n const first = data[pos++];\n const isLong = !!(first & 128); // First bit of first length byte is flag for short/long form\n let length = 0;\n if (!isLong)\n length = first;\n else {\n // Long form: [longFlag(1bit), lengthLength(7bit), length (BE)]\n const lenLen = first & 127;\n if (!lenLen)\n throw new E('tlv.decode(long): indefinite length not supported');\n if (lenLen > 4)\n throw new E('tlv.decode(long): byte length is too big'); // this will overflow u32 in js\n const lengthBytes = data.subarray(pos, pos + lenLen);\n if (lengthBytes.length !== lenLen)\n throw new E('tlv.decode: length bytes not complete');\n if (lengthBytes[0] === 0)\n throw new E('tlv.decode(long): zero leftmost byte');\n for (const b of lengthBytes)\n length = (length << 8) | b;\n pos += lenLen;\n if (length < 128)\n throw new E('tlv.decode(long): not minimal encoding');\n }\n const v = data.subarray(pos, pos + length);\n if (v.length !== length)\n throw new E('tlv.decode: wrong value length');\n return { v, l: data.subarray(pos + length) };\n },\n },\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 _int: {\n encode(num) {\n const { Err: E } = DER;\n if (num < _0n)\n throw new E('integer: negative integers are not allowed');\n let hex = numberToHexUnpadded(num);\n // Pad with zero byte if negative flag is present\n if (Number.parseInt(hex[0], 16) & 0b1000)\n hex = '00' + hex;\n if (hex.length & 1)\n throw new E('unexpected DER parsing assertion: unpadded hex');\n return hex;\n },\n decode(data) {\n const { Err: E } = DER;\n if (data[0] & 128)\n throw new E('invalid signature integer: negative');\n if (data[0] === 0x00 && !(data[1] & 128))\n throw new E('invalid signature integer: unnecessary leading zero');\n return bytesToNumberBE(data);\n },\n },\n toSig(hex) {\n // parse DER signature\n const { Err: E, _int: int, _tlv: tlv } = DER;\n const data = ensureBytes('signature', hex);\n const { v: seqBytes, l: seqLeftBytes } = tlv.decode(0x30, data);\n if (seqLeftBytes.length)\n throw new E('invalid signature: left bytes after parsing');\n const { v: rBytes, l: rLeftBytes } = tlv.decode(0x02, seqBytes);\n const { v: sBytes, l: sLeftBytes } = tlv.decode(0x02, rLeftBytes);\n if (sLeftBytes.length)\n throw new E('invalid signature: left bytes after parsing');\n return { r: int.decode(rBytes), s: int.decode(sBytes) };\n },\n hexFromSig(sig) {\n const { _tlv: tlv, _int: int } = DER;\n const rs = tlv.encode(0x02, int.encode(sig.r));\n const ss = tlv.encode(0x02, int.encode(sig.s));\n const seq = rs + ss;\n return tlv.encode(0x30, seq);\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 Fn = Field(CURVE.n, CURVE.nBitLength);\n const toBytes = CURVE.toBytes ||\n ((_c, point, _isCompressed) => {\n const a = point.toAffine();\n return 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. Takes x, returns y².\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 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 (isBytes(key))\n key = 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 private key');\n key = key.padStart(nByteLength * 2, '0');\n }\n let num;\n try {\n num =\n typeof key === 'bigint'\n ? key\n : bytesToNumberBE(ensureBytes('private key', key, nByteLength));\n }\n catch (error) {\n throw new Error('invalid private key, expected hex or ' + nByteLength + ' bytes, got ' + typeof key);\n }\n if (wrapPrivateKey)\n num = mod(num, N); // disabled by default, enabled for BLS\n aInRange('private key', num, _1n, N); // num in range [1..N-1]\n return num;\n }\n function aprjpoint(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 invalid representation of ZERO.\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 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 this.px = px;\n this.py = py;\n this.pz = pz;\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 // Multiscalar Multiplication\n static msm(points, scalars) {\n return pippenger(Point, Fn, points, scalars);\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 aprjpoint(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 aprjpoint(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 const { endo, n: N } = CURVE;\n aInRange('scalar', sc, _0n, N);\n const I = Point.ZERO;\n if (sc === _0n)\n return I;\n if (this.is0() || sc === _1n)\n return this;\n // Case a: no endomorphism. Case b: has precomputes.\n if (!endo || wnaf.hasPrecomputes(this))\n return wnaf.wNAFCachedUnsafe(this, sc, Point.normalizeZ);\n // Case c: 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 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 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 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(a, CURVE_ORDER);\n }\n function invN(a) {\n return 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 = 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 = bytesToNumberBE(tail);\n if (!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 const cl = compressedLen;\n const ul = uncompressedLen;\n throw new Error('invalid Point, expected length of ' + cl + ', or uncompressed ' + ul + ', got ' + len);\n }\n },\n });\n const numToNByteHex = (num) => bytesToHex(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) => 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 aInRange('r', r, _1n, CURVE_ORDER); // r in [1..N]\n aInRange('s', s, _1n, CURVE_ORDER); // s in [1..N]\n this.r = r;\n this.s = s;\n if (recovery != null)\n this.recovery = recovery;\n Object.freeze(this);\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 /**\n * @todo remove\n * @deprecated\n */\n assertValidity() { }\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 + numToNByteHex(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 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 hexToBytes(this.toCompactHex());\n }\n toCompactHex() {\n return numToNByteHex(this.r) + numToNByteHex(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 = getMinHashLength(CURVE.n);\n return 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 = 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 // Our custom check \"just in case\"\n if (bytes.length > 8192)\n throw new Error('input is too large');\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 = 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 = 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 aInRange('num < 2^' + CURVE.nBitLength, num, _0n, ORDER_MASK);\n // works with order, can have different size than numToField!\n return 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,\n // this will be invalid at least for P521. 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 = 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 = 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 const { lowS, prehash, format } = opts;\n // Verify opts, deduce signature format\n validateSigVerOpts(opts);\n if ('strict' in opts)\n throw new Error('options.strict was renamed to lowS');\n if (format !== undefined && format !== 'compact' && format !== 'der')\n throw new Error('format must be compact or der');\n const isHex = typeof sg === 'string' || isBytes(sg);\n const isObj = !isHex &&\n !format &&\n typeof sg === 'object' &&\n sg !== null &&\n typeof sg.r === 'bigint' &&\n typeof sg.s === 'bigint';\n if (!isHex && !isObj)\n throw new Error('invalid signature, expected Uint8Array, hex string or Signature instance');\n let _sig = undefined;\n let P;\n try {\n if (isObj)\n _sig = new Signature(sg.r, sg.s);\n if (isHex) {\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 if (format !== 'compact')\n _sig = Signature.fromDER(sg);\n }\n catch (derError) {\n if (!(derError instanceof DER.Err))\n throw derError;\n }\n if (!_sig && format !== 'der')\n _sig = Signature.fromCompact(sg);\n }\n P = Point.fromHex(publicKey);\n }\n catch (error) {\n return false;\n }\n if (!_sig)\n return false;\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 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","/**\n * Utilities for short weierstrass curves, combined with noble-hashes.\n * @module\n */\n/*! 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 { ...create(defHash), create };\n}\n//# sourceMappingURL=_shortw_utils.js.map","/**\n * NIST secp256k1. See [pdf](https://www.secg.org/sec2-v2.pdf).\n *\n * Seems to be rigid (not backdoored)\n * [as per discussion](https://bitcointalk.org/index.php?topic=289795.msg3183975#msg3183975).\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 * [See explanation](https://gist.github.com/paulmillr/eb670806793e84df628a7c434a873066).\n * @module\n */\n/*! noble-curves - MIT License (c) 2022 Paul Miller (paulmillr.com) */\nimport { sha256 } from '@noble/hashes/sha2';\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 { aInRange, bytesToNumberBE, concatBytes, ensureBytes, inRange, 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 (!Fpk1.eql(Fpk1.sqr(root), y))\n throw new Error('Cannot find square root');\n return root;\n}\nconst Fpk1 = Field(secp256k1P, undefined, undefined, { sqrt: sqrtMod });\n/**\n * secp256k1 curve, ECDSA and ECDH methods.\n *\n * Field: `2n**256n - 2n**32n - 2n**9n - 2n**8n - 2n**7n - 2n**6n - 2n**4n - 1n`\n *\n * @example\n * ```js\n * import { secp256k1 } from '@noble/curves/secp256k1';\n * const priv = secp256k1.utils.randomPrivateKey();\n * const pub = secp256k1.getPublicKey(priv);\n * const msg = new Uint8Array(32).fill(1); // message hash (not message) in ecdsa\n * const sig = secp256k1.sign(msg, priv); // `{prehash: true}` option is available\n * const isValid = secp256k1.verify(sig, msg, pub) === true;\n * ```\n */\nexport const secp256k1 = createCurve({\n a: BigInt(0),\n b: BigInt(7),\n Fp: Fpk1,\n n: secp256k1N,\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 endo: {\n // Endomorphism, see above\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 * https://github.com/bitcoin/bips/blob/master/bip-0340.mediawiki\n * @example\n * ```js\n * import { schnorr } from '@noble/curves/secp256k1';\n * const priv = schnorr.utils.randomPrivateKey();\n * const pub = schnorr.getPublicKey(priv);\n * const msg = new TextEncoder().encode('hello');\n * const sig = schnorr.sign(msg, priv);\n * const isValid = schnorr.verify(sig, msg, pub);\n * ```\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(Fpk1, [\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(Fpk1, {\n A: BigInt('0x3f8731abdd661adca08a5558f0f5d272e953d363cb6f0e5d405447c01a444533'),\n B: BigInt('1771'),\n Z: Fpk1.create(BigInt('-11')),\n}))();\nconst htf = /* @__PURE__ */ (() => createHasher(secp256k1.ProjectivePoint, (scalars) => {\n const { x, y } = mapSWU(Fpk1.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: Fpk1.ORDER,\n m: 1,\n k: 128,\n expand: 'xmd',\n hash: sha256,\n}))();\n/** secp256k1 hash-to-curve from RFC 9380. */\nexport const hashToCurve = /* @__PURE__ */ (() => htf.hashToCurve)();\n/** secp256k1 encode-to-curve from RFC 9380. */\nexport const encodeToCurve = /* @__PURE__ */ (() => htf.encodeToCurve)();\n//# sourceMappingURL=secp256k1.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","import { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { identity } from 'multiformats/hashes/identity';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { publicKeyToProtobuf } from '../index.js';\nimport { validateSecp256k1PublicKey, compressSecp256k1PublicKey, computeSecp256k1PublicKey, validateSecp256k1PrivateKey } from './utils.js';\nimport { hashAndVerify, hashAndSign } from './index.js';\nexport class Secp256k1PublicKey {\n type = 'secp256k1';\n raw;\n _key;\n constructor(key) {\n this._key = validateSecp256k1PublicKey(key);\n this.raw = compressSecp256k1PublicKey(this._key);\n }\n toMultihash() {\n return identity.digest(publicKeyToProtobuf(this));\n }\n toCID() {\n return CID.createV1(114, this.toMultihash());\n }\n toString() {\n return base58btc.encode(this.toMultihash().bytes).substring(1);\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n verify(data, sig) {\n return hashAndVerify(this._key, sig, data);\n }\n}\nexport class Secp256k1PrivateKey {\n type = 'secp256k1';\n raw;\n publicKey;\n constructor(key, publicKey) {\n this.raw = validateSecp256k1PrivateKey(key);\n this.publicKey = new Secp256k1PublicKey(publicKey ?? computeSecp256k1PublicKey(key));\n }\n equals(key) {\n if (key == null || !(key.raw instanceof Uint8Array)) {\n return false;\n }\n return uint8ArrayEquals(this.raw, key.raw);\n }\n sign(message) {\n return hashAndSign(this.raw, message);\n }\n}\n//# sourceMappingURL=secp256k1.js.map","import { InvalidPrivateKeyError, InvalidPublicKeyError } from '@libp2p/interface';\nimport { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { Secp256k1PublicKey as Secp256k1PublicKeyClass, Secp256k1PrivateKey as Secp256k1PrivateKeyClass } from './secp256k1.js';\nconst PRIVATE_KEY_BYTE_LENGTH = 32;\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\nexport function unmarshalSecp256k1PrivateKey(bytes) {\n return new Secp256k1PrivateKeyClass(bytes);\n}\nexport function unmarshalSecp256k1PublicKey(bytes) {\n return new Secp256k1PublicKeyClass(bytes);\n}\nexport async function generateSecp256k1KeyPair() {\n const privateKeyBytes = generateSecp256k1PrivateKey();\n return new Secp256k1PrivateKeyClass(privateKeyBytes);\n}\nexport function compressSecp256k1PublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(true);\n return point;\n}\nexport function decompressSecp256k1PublicKey(key) {\n const point = secp.ProjectivePoint.fromHex(key).toRawBytes(false);\n return point;\n}\nexport function validateSecp256k1PrivateKey(key) {\n try {\n secp.getPublicKey(key, true);\n return key;\n }\n catch (err) {\n throw new InvalidPrivateKeyError(String(err));\n }\n}\nexport function validateSecp256k1PublicKey(key) {\n try {\n secp.ProjectivePoint.fromHex(key);\n return key;\n }\n catch (err) {\n throw new InvalidPublicKeyError(String(err));\n }\n}\nexport function computeSecp256k1PublicKey(privateKey) {\n try {\n return secp.getPublicKey(privateKey, true);\n }\n catch (err) {\n throw new InvalidPrivateKeyError(String(err));\n }\n}\nexport function generateSecp256k1PrivateKey() {\n return secp.utils.randomPrivateKey();\n}\n//# sourceMappingURL=utils.js.map","import { secp256k1 as secp } from '@noble/curves/secp256k1';\nimport { sha256 } from 'multiformats/hashes/sha2';\nimport { SigningError, VerificationError } from '../../errors.js';\nimport { isPromise } from '../../util.js';\nconst PUBLIC_KEY_BYTE_LENGTH = 33;\nconst PRIVATE_KEY_BYTE_LENGTH = 32;\nexport { PUBLIC_KEY_BYTE_LENGTH as publicKeyLength };\nexport { PRIVATE_KEY_BYTE_LENGTH as privateKeyLength };\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 SigningError(String(err));\n });\n }\n try {\n return secp.sign(p.digest, key).toDERRawBytes();\n }\n catch (err) {\n throw new SigningError(String(err));\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 VerificationError(String(err));\n });\n }\n try {\n return secp.verify(sig, p.digest, key);\n }\n catch (err) {\n throw new VerificationError(String(err));\n }\n}\n//# sourceMappingURL=index.browser.js.map","/**\n * @packageDocumentation\n *\n * ## Supported Key Types\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 { InvalidParametersError, UnsupportedKeyTypeError } from '@libp2p/interface';\nimport { ECDSAPrivateKey as ECDSAPrivateKeyClass } from './ecdsa/ecdsa.js';\nimport { ECDSA_P_256_OID, ECDSA_P_384_OID, ECDSA_P_521_OID } from './ecdsa/index.js';\nimport { generateECDSAKeyPair, pkiMessageToECDSAPrivateKey, pkiMessageToECDSAPublicKey, unmarshalECDSAPrivateKey, unmarshalECDSAPublicKey } from './ecdsa/utils.js';\nimport { privateKeyLength as ed25519PrivateKeyLength, publicKeyLength as ed25519PublicKeyLength } from './ed25519/index.js';\nimport { generateEd25519KeyPair, generateEd25519KeyPairFromSeed, unmarshalEd25519PrivateKey, unmarshalEd25519PublicKey } from './ed25519/utils.js';\nimport * as pb from './keys.js';\nimport { decodeDer } from './rsa/der.js';\nimport { RSAES_PKCS1_V1_5_OID } from './rsa/index.js';\nimport { pkcs1ToRSAPrivateKey, pkixToRSAPublicKey, generateRSAKeyPair, pkcs1MessageToRSAPrivateKey, pkixMessageToRSAPublicKey, jwkToRSAPrivateKey } from './rsa/utils.js';\nimport { privateKeyLength as secp256k1PrivateKeyLength, publicKeyLength as secp256k1PublicKeyLength } from './secp256k1/index.js';\nimport { generateSecp256k1KeyPair, unmarshalSecp256k1PrivateKey, unmarshalSecp256k1PublicKey } from './secp256k1/utils.js';\nexport { generateEphemeralKeyPair } from './ecdh/index.js';\nexport { keyStretcher } from './key-stretcher.js';\nexport async function generateKeyPair(type, bits) {\n if (type === 'Ed25519') {\n return generateEd25519KeyPair();\n }\n if (type === 'secp256k1') {\n return generateSecp256k1KeyPair();\n }\n if (type === 'RSA') {\n return generateRSAKeyPair(toBits(bits));\n }\n if (type === 'ECDSA') {\n return generateECDSAKeyPair(toCurve(bits));\n }\n throw new UnsupportedKeyTypeError();\n}\nexport async function generateKeyPairFromSeed(type, seed) {\n if (type !== 'Ed25519') {\n throw new UnsupportedKeyTypeError('Seed key derivation only supported for Ed25519 keys');\n }\n return generateEd25519KeyPairFromSeed(seed);\n}\n/**\n * Converts a protobuf serialized public key into its representative object.\n *\n * For RSA public keys optionally pass the multihash digest of the public key if\n * it is known. If the digest is omitted it will be calculated which can be\n * expensive.\n *\n * For other key types the digest option is ignored.\n */\nexport function publicKeyFromProtobuf(buf, digest) {\n const { Type, Data } = pb.PublicKey.decode(buf);\n const data = Data ?? new Uint8Array();\n switch (Type) {\n case pb.KeyType.RSA:\n return pkixToRSAPublicKey(data, digest);\n case pb.KeyType.Ed25519:\n return unmarshalEd25519PublicKey(data);\n case pb.KeyType.secp256k1:\n return unmarshalSecp256k1PublicKey(data);\n case pb.KeyType.ECDSA:\n return unmarshalECDSAPublicKey(data);\n default:\n throw new UnsupportedKeyTypeError();\n }\n}\n/**\n * Creates a public key from the raw key bytes\n */\nexport function publicKeyFromRaw(buf) {\n if (buf.byteLength === ed25519PublicKeyLength) {\n return unmarshalEd25519PublicKey(buf);\n }\n else if (buf.byteLength === secp256k1PublicKeyLength) {\n return unmarshalSecp256k1PublicKey(buf);\n }\n const message = decodeDer(buf);\n const ecdsaOid = message[1]?.[0];\n if (ecdsaOid === ECDSA_P_256_OID || ecdsaOid === ECDSA_P_384_OID || ecdsaOid === ECDSA_P_521_OID) {\n return pkiMessageToECDSAPublicKey(message);\n }\n if (message[0]?.[0] === RSAES_PKCS1_V1_5_OID) {\n return pkixMessageToRSAPublicKey(message, buf);\n }\n throw new InvalidParametersError('Could not extract public key from raw bytes');\n}\n/**\n * Creates a public key from an identity multihash which contains a protobuf\n * encoded Ed25519 or secp256k1 public key.\n *\n * RSA keys are not supported as in practice we they are not stored in identity\n * multihash since the hash would be very large.\n */\nexport function publicKeyFromMultihash(digest) {\n const { Type, Data } = pb.PublicKey.decode(digest.digest);\n const data = Data ?? new Uint8Array();\n switch (Type) {\n case pb.KeyType.Ed25519:\n return unmarshalEd25519PublicKey(data);\n case pb.KeyType.secp256k1:\n return unmarshalSecp256k1PublicKey(data);\n case pb.KeyType.ECDSA:\n return unmarshalECDSAPublicKey(data);\n default:\n throw new UnsupportedKeyTypeError();\n }\n}\n/**\n * Converts a public key object into a protobuf serialized public key\n */\nexport function publicKeyToProtobuf(key) {\n return pb.PublicKey.encode({\n Type: pb.KeyType[key.type],\n Data: key.raw\n });\n}\n/**\n * Converts a protobuf serialized private key into its representative object\n */\nexport function privateKeyFromProtobuf(buf) {\n const decoded = pb.PrivateKey.decode(buf);\n const data = decoded.Data ?? new Uint8Array();\n switch (decoded.Type) {\n case pb.KeyType.RSA:\n return pkcs1ToRSAPrivateKey(data);\n case pb.KeyType.Ed25519:\n return unmarshalEd25519PrivateKey(data);\n case pb.KeyType.secp256k1:\n return unmarshalSecp256k1PrivateKey(data);\n case pb.KeyType.ECDSA:\n return unmarshalECDSAPrivateKey(data);\n default:\n throw new UnsupportedKeyTypeError();\n }\n}\n/**\n * Creates a private key from the raw key bytes. For Ed25519 keys this requires\n * the public key to be appended to the private key otherwise we can't\n * differentiate between Ed25519 and secp256k1 keys as they are the same length.\n */\nexport function privateKeyFromRaw(buf) {\n if (buf.byteLength === ed25519PrivateKeyLength) {\n return unmarshalEd25519PrivateKey(buf);\n }\n else if (buf.byteLength === secp256k1PrivateKeyLength) {\n return unmarshalSecp256k1PrivateKey(buf);\n }\n const message = decodeDer(buf);\n const ecdsaOid = message[2]?.[0];\n if (ecdsaOid === ECDSA_P_256_OID || ecdsaOid === ECDSA_P_384_OID || ecdsaOid === ECDSA_P_521_OID) {\n return pkiMessageToECDSAPrivateKey(message);\n }\n if (message.length > 8) {\n return pkcs1MessageToRSAPrivateKey(message);\n }\n throw new InvalidParametersError('Could not extract private key from raw bytes');\n}\n/**\n * Converts a private key object into a protobuf serialized private key\n */\nexport function privateKeyToProtobuf(key) {\n return pb.PrivateKey.encode({\n Type: pb.KeyType[key.type],\n Data: key.raw\n });\n}\nfunction toBits(bits) {\n if (bits == null) {\n return 2048;\n }\n return parseInt(bits, 10);\n}\nfunction toCurve(curve) {\n if (curve === 'P-256' || curve == null) {\n return 'P-256';\n }\n if (curve === 'P-384') {\n return 'P-384';\n }\n if (curve === 'P-521') {\n return 'P-521';\n }\n throw new InvalidParametersError('Unsupported curve, should be P-256, P-384 or P-521');\n}\n/**\n * Convert a libp2p RSA or ECDSA private key to a WebCrypto CryptoKeyPair\n */\nexport async function privateKeyToCryptoKeyPair(privateKey) {\n if (privateKey.type === 'RSA') {\n return {\n privateKey: await crypto.subtle.importKey('jwk', privateKey.jwk, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['sign']),\n publicKey: await crypto.subtle.importKey('jwk', privateKey.publicKey.jwk, {\n name: 'RSASSA-PKCS1-v1_5',\n hash: { name: 'SHA-256' }\n }, true, ['verify'])\n };\n }\n if (privateKey.type === 'ECDSA') {\n return {\n privateKey: await crypto.subtle.importKey('jwk', privateKey.jwk, {\n name: 'ECDSA',\n namedCurve: privateKey.jwk.crv ?? 'P-256'\n }, true, ['sign']),\n publicKey: await crypto.subtle.importKey('jwk', privateKey.publicKey.jwk, {\n name: 'ECDSA',\n namedCurve: privateKey.publicKey.jwk.crv ?? 'P-256'\n }, true, ['verify'])\n };\n }\n throw new InvalidParametersError('Only RSA and ECDSA keys are supported');\n}\n/**\n * Convert a RSA or ECDSA WebCrypto CryptoKeyPair to a libp2p private key\n */\nexport async function privateKeyFromCryptoKeyPair(keyPair) {\n if (keyPair.privateKey.algorithm.name === 'RSASSA-PKCS1-v1_5') {\n const jwk = await crypto.subtle.exportKey('jwk', keyPair.privateKey);\n return jwkToRSAPrivateKey(jwk);\n }\n if (keyPair.privateKey.algorithm.name === 'ECDSA') {\n const jwk = await crypto.subtle.exportKey('jwk', keyPair.privateKey);\n return new ECDSAPrivateKeyClass(jwk);\n }\n throw new InvalidParametersError('Only RSA and ECDSA keys are supported');\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.js';\nexport * from './connection-encrypter.js';\nexport * from './connection-gater.js';\nexport * from './content-routing.js';\nexport * from './keys.js';\nexport * from './metrics.js';\nexport * from './peer-discovery.js';\nexport * from './peer-id.js';\nexport * from './peer-info.js';\nexport * from './peer-routing.js';\nexport * from './peer-store.js';\nexport * from './pubsub.js';\nexport * from './record.js';\nexport * from './stream-handler.js';\nexport * from './stream-muxer.js';\nexport * from './topology.js';\nexport * from './transport.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 { peerIdSymbol } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\nimport { CID } from 'multiformats/cid';\nimport { identity } from 'multiformats/hashes/identity';\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');\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst LIBP2P_KEY_CODE = 0x72;\nclass PeerIdImpl {\n type;\n multihash;\n publicKey;\n string;\n constructor(init) {\n this.type = init.type;\n this.multihash = init.multihash;\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 toMultihash() {\n return this.multihash;\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 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 this.toString() === id;\n }\n else if (id?.toMultihash()?.bytes != null) {\n return uint8ArrayEquals(this.multihash.bytes, id.toMultihash().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}\nexport class RSAPeerId extends PeerIdImpl {\n type = 'RSA';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'RSA' });\n this.publicKey = init.publicKey;\n }\n}\nexport class Ed25519PeerId extends PeerIdImpl {\n type = 'Ed25519';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'Ed25519' });\n this.publicKey = init.publicKey;\n }\n}\nexport class Secp256k1PeerId extends PeerIdImpl {\n type = 'secp256k1';\n publicKey;\n constructor(init) {\n super({ ...init, type: 'secp256k1' });\n this.publicKey = init.publicKey;\n }\n}\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst TRANSPORT_IPFS_GATEWAY_HTTP_CODE = 0x0920;\nexport class URLPeerId {\n type = 'url';\n multihash;\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 toMultihash() {\n return this.multihash;\n }\n toCID() {\n return CID.createV1(TRANSPORT_IPFS_GATEWAY_HTTP_CODE, this.toMultihash());\n }\n toJSON() {\n return this.toString();\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}\n//# sourceMappingURL=peer-id.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('12D3KooWKnDdG3iXw9eTFijk3EWSunZcFi54Zka4wmtqtt6rPxc8')\n *\n * console.log(peer.toCID()) // CID(bafzaa...)\n * console.log(peer.toString()) // \"12D3K...\"\n * ```\n */\nimport { publicKeyFromMultihash } from '@libp2p/crypto/keys';\nimport { InvalidCIDError, InvalidMultihashError, InvalidParametersError, UnsupportedKeyTypeError } from '@libp2p/interface';\nimport { base58btc } from 'multiformats/bases/base58';\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 { toString as uint8ArrayToString } from 'uint8arrays/to-string';\nimport { RSAPeerId as RSAPeerIdClass, Ed25519PeerId as Ed25519PeerIdClass, Secp256k1PeerId as Secp256k1PeerIdClass, URLPeerId as URLPeerIdClass } from './peer-id.js';\n// these values are from https://github.com/multiformats/multicodec/blob/master/table.csv\nconst LIBP2P_KEY_CODE = 0x72;\nconst TRANSPORT_IPFS_GATEWAY_HTTP_CODE = 0x0920;\nexport function peerIdFromString(str, decoder) {\n let multihash;\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 multihash = Digest.decode(base58btc.decode(`z${str}`));\n }\n else if (str.startsWith('k51qzi5uqu5') || str.startsWith('kzwfwjn5ji4') || str.startsWith('k2k4r8') || str.startsWith('bafz')) {\n // base36 encoded CIDv1 with libp2p-key and identity hash (for ed25519/secp256k1/rsa) or base32 encoded CIDv1 with libp2p-key and identity hash (for ed25519/secp256k1/rsa)\n return peerIdFromCID(CID.parse(str));\n }\n else {\n if (decoder == null) {\n throw new InvalidParametersError('Please pass a multibase decoder for strings that do not start with \"1\" or \"Q\"');\n }\n multihash = Digest.decode(decoder.decode(str));\n }\n return peerIdFromMultihash(multihash);\n}\nexport function peerIdFromPublicKey(publicKey) {\n if (publicKey.type === 'Ed25519') {\n return new Ed25519PeerIdClass({\n multihash: publicKey.toCID().multihash,\n publicKey\n });\n }\n else if (publicKey.type === 'secp256k1') {\n return new Secp256k1PeerIdClass({\n multihash: publicKey.toCID().multihash,\n publicKey\n });\n }\n else if (publicKey.type === 'RSA') {\n return new RSAPeerIdClass({\n multihash: publicKey.toCID().multihash,\n publicKey\n });\n }\n throw new UnsupportedKeyTypeError();\n}\nexport function peerIdFromPrivateKey(privateKey) {\n return peerIdFromPublicKey(privateKey.publicKey);\n}\nexport function peerIdFromMultihash(multihash) {\n if (isSha256Multihash(multihash)) {\n return new RSAPeerIdClass({ multihash });\n }\n else if (isIdentityMultihash(multihash)) {\n try {\n const publicKey = publicKeyFromMultihash(multihash);\n if (publicKey.type === 'Ed25519') {\n return new Ed25519PeerIdClass({ multihash, publicKey });\n }\n else if (publicKey.type === 'secp256k1') {\n return new Secp256k1PeerIdClass({ multihash, publicKey });\n }\n }\n catch (err) {\n // was not Ed or secp key, try URL\n const url = uint8ArrayToString(multihash.digest);\n return new URLPeerIdClass(new URL(url));\n }\n }\n throw new InvalidMultihashError('Supplied PeerID Multihash 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 InvalidCIDError('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 URLPeerIdClass(new URL(url));\n }\n return peerIdFromMultihash(cid.multihash);\n}\nfunction isIdentityMultihash(multihash) {\n return multihash.code === identity.code;\n}\nfunction isSha256Multihash(multihash) {\n return multihash.code === sha256.code;\n}\n//# sourceMappingURL=index.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 function isAsyncIterable(thing) {\n return thing[Symbol.asyncIterator] != null;\n}\n//# sourceMappingURL=utils.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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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","/**\n * HKDF (RFC 5869): extract + expand in one step.\n * See https://soatok.blog/2021/11/17/understanding-hkdf/.\n * @module\n */\nimport { ahash, anumber } from \"./_assert.js\";\nimport { hmac } from \"./hmac.js\";\nimport { toBytes } from \"./utils.js\";\n/**\n * HKDF-extract from spec. Less important part. `HKDF-Extract(IKM, salt) -> PRK`\n * Arguments position differs from spec (IKM is first one, since it is not optional)\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 */\nexport function extract(hash, ikm, salt) {\n ahash(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);\n return hmac(hash, toBytes(salt), toBytes(ikm));\n}\nconst HKDF_COUNTER = /* @__PURE__ */ new Uint8Array([0]);\nconst EMPTY_BUFFER = /* @__PURE__ */ new Uint8Array();\n/**\n * HKDF-expand from the spec. The most important part. `HKDF-Expand(PRK, info, L) -> OKM`\n * @param hash - hash function that would be used (e.g. sha256)\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 bytes\n */\nexport function expand(hash, prk, info, length = 32) {\n ahash(hash);\n anumber(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): derive keys from an initial input.\n * Combines hkdf_extract + hkdf_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 (can be a zero-length string)\n * @param length - length of output keying material in bytes\n * @example\n * import { hkdf } from '@noble/hashes/hkdf';\n * import { sha256 } from '@noble/hashes/sha2';\n * import { randomBytes } from '@noble/hashes/utils';\n * const inputKey = randomBytes(32);\n * const salt = randomBytes(32);\n * const info = 'application-key';\n * const hk1 = hkdf(sha256, inputKey, salt, info, 32);\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 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 { publicKeyFromProtobuf, publicKeyToProtobuf } from '@libp2p/crypto/keys';\nimport { UnexpectedPeerError } from '@libp2p/interface';\nimport {} from 'uint8arraylist';\nimport { concat as uint8ArrayConcat } from 'uint8arrays/concat';\nimport { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\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: publicKeyToProtobuf(privateKey.publicKey),\n identitySig,\n extensions\n });\n}\nexport async function decodeHandshakePayload(payloadBytes, remoteStaticKey, remoteIdentityKey) {\n try {\n const payload = NoiseHandshakePayload.decode(payloadBytes);\n const publicKey = publicKeyFromProtobuf(payload.identityKey);\n if (remoteIdentityKey?.equals(publicKey) === false) {\n throw new Error(`Payload identity key ${publicKey} does not match expected remote identity key ${remoteIdentityKey}`);\n }\n if (!remoteStaticKey) {\n throw new Error('Remote static does not exist');\n }\n const signaturePayload = getSignaturePayload(remoteStaticKey);\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 { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { serviceCapabilities } from '@libp2p/interface';\nimport { peerIdFromPublicKey } 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 /**\n * Encrypt outgoing data to the remote party (handshake as initiator)\n *\n * @param connection - streaming iterable duplex that will be encrypted\n * @param options\n * @param options.remotePeer - PeerId of the remote peer. Used to validate the integrity of the remote peer\n * @param options.signal - Used to abort the operation\n */\n async secureOutbound(connection, options) {\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n const handshake = await this.performHandshakeInitiator(wrappedConnection, this.components.privateKey, options?.remotePeer?.publicKey, options);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n const publicKey = publicKeyFromProtobuf(handshake.payload.identityKey);\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: peerIdFromPublicKey(publicKey)\n };\n }\n /**\n * Decrypt incoming data (handshake as responder).\n *\n * @param connection - streaming iterable duplex that will be encrypted\n * @param options\n * @param options.remotePeer - PeerId of the remote peer. Used to validate the integrity of the remote peer\n * @param options.signal - Used to abort the operation\n */\n async secureInbound(connection, options) {\n const wrappedConnection = lpStream(connection, {\n lengthEncoder: uint16BEEncode,\n lengthDecoder: uint16BEDecode,\n maxDataLength: NOISE_MSG_MAX_LENGTH_BYTES\n });\n const handshake = await this.performHandshakeResponder(wrappedConnection, this.components.privateKey, options?.remotePeer?.publicKey, options);\n const conn = await this.createSecureConnection(wrappedConnection, handshake);\n connection.source = conn.source;\n connection.sink = conn.sink;\n const publicKey = publicKeyFromProtobuf(handshake.payload.identityKey);\n return {\n conn: connection,\n remoteExtensions: handshake.payload.extensions,\n remotePeer: peerIdFromPublicKey(publicKey)\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, options) {\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 }, options);\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, privateKey, remoteIdentityKey, options) {\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 }, options);\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//# 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, options) {\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), options);\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(options));\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), options);\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, options) {\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(options));\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), options);\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(options));\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","/**\n * @packageDocumentation\n *\n * This repository contains TypeScript implementation of noise protocol, an encryption protocol used in libp2p.\n *\n * ## Usage\n *\n * Install with `yarn add @chainsafe/libp2p-noise` or `npm i @chainsafe/libp2p-noise`.\n *\n * Example of using default noise configuration and passing it to the libp2p config:\n *\n * ```ts\n * import {createLibp2p} from \"libp2p\"\n * import {noise} from \"@chainsafe/libp2p-noise\"\n *\n * //custom noise configuration, pass it instead of `noise()`\n * //x25519 private key\n * const n = noise({ staticNoiseKey });\n *\n * const libp2p = await createLibp2p({\n * connectionEncrypters: [noise()],\n * //... other options\n * })\n * ```\n *\n * See the [NoiseInit](https://github.com/ChainSafe/js-libp2p-noise/blob/master/src/noise.ts#L22-L30) interface for noise configuration options.\n *\n * ## API\n *\n * This module exposes an implementation of the [ConnectionEncrypter](https://libp2p.github.io/js-libp2p/interfaces/_libp2p_interface.ConnectionEncrypter.html) interface.\n *\n * ## Bring your own crypto\n *\n * You can provide a custom crypto implementation (instead of the default, based on [@noble](https://paulmillr.com/noble/)) by adding a `crypto` field to the init argument passed to the `Noise` factory.\n *\n * The implementation must conform to the `ICryptoInterface`, defined in \n */\nimport { 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=peer-discovery.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_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\n }\n },\n multiaddrs: peerData.multiaddrs\n });\n // check we are still running\n if (this.timer == null) {\n return;\n }\n this.safeDispatchEvent('peer', { detail: peerData });\n this.components.connectionManager.openConnection(peerData.id)\n .catch(err => {\n this.log.error('could not dial bootstrap peer %p', peerData.id, err);\n });\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 { decodeMessage, encodeMessage, MaxLengthError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\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, opts = {}) => {\n const obj = {\n multiaddr: 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.multiaddr = 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 AddressInfo.encode = (obj) => {\n return encodeMessage(obj, AddressInfo.codec());\n };\n AddressInfo.decode = (buf, opts) => {\n return decodeMessage(buf, AddressInfo.codec(), opts);\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, opts = {}) => {\n const obj = {\n peerId: uint8ArrayAlloc(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 }\n case 2: {\n obj.seq = reader.uint64();\n break;\n }\n case 3: {\n if (opts.limits?.addresses != null && obj.addresses.length === opts.limits.addresses) {\n throw new MaxLengthError('Decode error - map field \"addresses\" had too many elements');\n }\n obj.addresses.push(PeerRecord.AddressInfo.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.addresses$\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 PeerRecord.encode = (obj) => {\n return encodeMessage(obj, PeerRecord.codec());\n };\n PeerRecord.decode = (buf, opts) => {\n return decodeMessage(buf, PeerRecord.codec(), opts);\n };\n})(PeerRecord || (PeerRecord = {}));\n//# sourceMappingURL=peer-record.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 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, opts = {}) => {\n const obj = {\n publicKey: uint8ArrayAlloc(0),\n payloadType: uint8ArrayAlloc(0),\n payload: uint8ArrayAlloc(0),\n signature: 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.publicKey = reader.bytes();\n break;\n }\n case 2: {\n obj.payloadType = reader.bytes();\n break;\n }\n case 3: {\n obj.payload = reader.bytes();\n break;\n }\n case 5: {\n obj.signature = 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 Envelope.encode = (obj) => {\n return encodeMessage(obj, Envelope.codec());\n };\n Envelope.decode = (buf, opts) => {\n return decodeMessage(buf, Envelope.codec(), opts);\n };\n})(Envelope || (Envelope = {}));\n//# sourceMappingURL=envelope.js.map","import { peerIdFromMultihash } from '@libp2p/peer-id';\nimport { arrayEquals } from '@libp2p/utils/array-equals';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport * as Digest from 'multiformats/hashes/digest';\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 = peerIdFromMultihash(Digest.decode(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.toMultihash().bytes,\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","/**\n * The key in the record is not valid for the domain\n */\nexport class InvalidSignatureError extends Error {\n constructor(message = 'Invalid signature') {\n super(message);\n this.name = 'InvalidSignatureError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { publicKeyFromProtobuf, publicKeyToProtobuf } from '@libp2p/crypto/keys';\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 { Envelope as Protobuf } from './envelope.js';\nimport { InvalidSignatureError } from './errors.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 publicKey = publicKeyFromProtobuf(envelopeData.publicKey);\n return new RecordEnvelope({\n publicKey,\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, privateKey) => {\n if (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 signature = await privateKey.sign(signData.subarray());\n return new RecordEnvelope({\n publicKey: privateKey.publicKey,\n payloadType,\n payload,\n signature\n });\n };\n /**\n * Open and certify a given marshaled envelope.\n * Data is unmarshaled 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 InvalidSignatureError('Envelope signature is not valid for the given domain');\n }\n return envelope;\n };\n publicKey;\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 { publicKey, payloadType, payload, signature } = init;\n this.publicKey = publicKey;\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.marshaled == null) {\n this.marshaled = Protobuf.encode({\n publicKey: publicKeyToProtobuf(this.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 return this.publicKey.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","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 '../private-ip.js';\nimport { isIpBased } from './is-ip-based.js';\n/**\n * Check if a given multiaddr starts with a private address\n */\nexport function isPrivate(ma) {\n try {\n if (!isIpBased(ma)) {\n // not an IP based multiaddr, cannot be private\n return false;\n }\n const [[, value]] = ma.stringTuples();\n if (value == null) {\n return false;\n }\n return isPrivateIp(value) ?? false;\n }\n catch {\n }\n return true;\n}\n//# sourceMappingURL=is-private.js.map","const CODEC_IP4 = 0x04;\nconst CODEC_IP6 = 0x29;\n/**\n * Check if a given multiaddr is IP-based\n */\nexport function isIpBased(ma) {\n try {\n const [[codec]] = ma.stringTuples();\n return codec === CODEC_IP4 || codec === CODEC_IP6;\n }\n catch {\n }\n return false;\n}\n//# sourceMappingURL=is-ip-based.js.map","import { 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};\nexport const 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};\nexport const literal = (str) => {\n return {\n match: (vals) => func((val) => val === str).match(vals),\n pattern: str\n };\n};\nexport const string = () => {\n return {\n match: (vals) => func((val) => typeof val === 'string').match(vals),\n pattern: '{string}'\n };\n};\nexport const number = () => {\n return {\n match: (vals) => func((val) => !isNaN(parseInt(val))).match(vals),\n pattern: '{number}'\n };\n};\nexport const 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};\nexport const 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};\nexport const 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};\nexport const 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};\nexport const 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};\nexport function 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 matchers,\n matches,\n exactMatch\n };\n}\n//# sourceMappingURL=utils.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 { and, or, literal, string, peerId, optional, fmt, func, number, certhash } from './utils.js';\n/**\n * Matches PeerId addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { PEER_ID } from '@multiformats/multiaddr-matcher'\n *\n * PEER_ID.matches(multiaddr('/p2p/Qmfoo')) // true\n * PEER_ID.matches(multiaddr('/ipfs/Qmfoo')) // true\n * ```\n */\nconst _PEER_ID = peerId();\nexport const PEER_ID = fmt(_PEER_ID);\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, optional(peerId()));\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, optional(peerId()));\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 * DNSADDR.matches(multiaddr('/dnsaddr/example.org/p2p/Qmfoo')) // true\n * ```\n */\nexport const DNSADDR = fmt(_DNSADDR, optional(peerId()));\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 * DNS.matches(multiaddr('/dns6/example.org/p2p/Qmfoo')) // true\n * ```\n */\nexport const DNS = fmt(or(_DNS, _DNSADDR, _DNS4, _DNS6), optional(peerId()));\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')) // true\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(or(_IP, and(or(_DNS, _DNSADDR, _DNS4, _DNS6), optional(peerId()))));\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(and(_TCP, optional(peerId())));\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'), optional(peerId()));\nconst _QUICV1 = and(_UDP, literal('quic-v1'), optional(peerId()));\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'), optional(and(literal('sni'), string())), 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())), and(literal('webrtc'), optional(peerId())));\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);\nconst _Memory = or(and(literal('memory'), string(), optional(peerId())));\n/**\n * Matches Memory addresses\n *\n * @example\n *\n * ```ts\n * import { multiaddr } from '@multiformats/multiaddr'\n * import { Memory } from '@multiformats/multiaddr-matcher'\n *\n * Memory.matches(multiaddr('/memory/0xDEADBEEF')) // true\n * ```\n */\nexport const Memory = fmt(_Memory);\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 error;\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 this.error = err;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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 this.error ?? 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 * 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 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","/**\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({\n ...options,\n bytes: 1\n }));\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({\n ...options,\n bytes: dataLength\n });\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","/**\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 { raceSignal } from 'race-signal';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { UnexpectedEOFError } from './errors.js';\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 (options) => {\n options?.signal?.throwIfAborted();\n if (options?.bytes == null) {\n // just read whatever arrives\n const { done, value } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n return null;\n }\n return value;\n }\n while (readBuffer.byteLength < options.bytes) {\n const { value, done } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n throw new UnexpectedEOFError('unexpected end of input');\n }\n readBuffer.append(value);\n }\n const buf = readBuffer.sublist(0, options.bytes);\n readBuffer.consume(options.bytes);\n return buf;\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","/* 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 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, opts = {}) => {\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 }\n case 6: {\n obj.agentVersion = reader.string();\n break;\n }\n case 1: {\n obj.publicKey = reader.bytes();\n break;\n }\n case 2: {\n if (opts.limits?.listenAddrs != null && obj.listenAddrs.length === opts.limits.listenAddrs) {\n throw new MaxLengthError('Decode error - map field \"listenAddrs\" had too many elements');\n }\n obj.listenAddrs.push(reader.bytes());\n break;\n }\n case 4: {\n obj.observedAddr = reader.bytes();\n break;\n }\n case 3: {\n if (opts.limits?.protocols != null && obj.protocols.length === opts.limits.protocols) {\n throw new MaxLengthError('Decode error - map field \"protocols\" had too many elements');\n }\n obj.protocols.push(reader.string());\n break;\n }\n case 8: {\n obj.signedPeerRecord = 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 Identify.encode = (obj) => {\n return encodeMessage(obj, Identify.codec());\n };\n Identify.decode = (buf, opts) => {\n return decodeMessage(buf, Identify.codec(), opts);\n };\n})(Identify || (Identify = {}));\n//# sourceMappingURL=message.js.map","import { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { InvalidMessageError } from '@libp2p/interface';\nimport { peerIdFromCID, peerIdFromPublicKey } 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 { 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 runOnLimitedConnection: 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 return nodeInfo.userAgent;\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 InvalidMessageError('message was null or undefined');\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 const publicKey = publicKeyFromProtobuf(message.publicKey);\n const peerId = peerIdFromPublicKey(publicKey);\n if (!peerId.equals(connection.remotePeer)) {\n throw new InvalidMessageError('public key did not match remote PeerId');\n }\n peer.publicKey = publicKey;\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.trace('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 const envelopePeer = peerIdFromCID(envelope.publicKey.toCID());\n // Verify peerId\n if (!peerRecord.peerId.equals(envelopePeer)) {\n throw new InvalidMessageError('signing key does not match PeerId in the PeerRecord');\n }\n // Make sure remote peer is the one sending the record\n if (!connection.remotePeer.equals(peerRecord.peerId)) {\n throw new InvalidMessageError('signing key does not match remote PeerId');\n }\n let existingPeer;\n try {\n existingPeer = await peerStore.get(peerRecord.peerId);\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\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.trace('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.trace('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 privateKey;\n peerStore;\n registrar;\n addressManager;\n maxInboundStreams;\n maxOutboundStreams;\n maxMessageSize;\n maxObservedAddresses;\n events;\n runOnLimitedConnection;\n log;\n constructor(components, init) {\n this.protocol = init.protocol;\n this.started = false;\n this.peerId = components.peerId;\n this.privateKey = components.privateKey;\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.runOnLimitedConnection = init.runOnLimitedConnection ?? defaultValues.runOnLimitedConnection;\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 runOnLimitedConnection: this.runOnLimitedConnection\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 { publicKeyFromProtobuf, publicKeyToProtobuf } from '@libp2p/crypto/keys';\nimport { InvalidMessageError, UnsupportedProtocolError, serviceCapabilities, setMaxListeners } from '@libp2p/interface';\nimport { peerIdFromCID } from '@libp2p/peer-id';\nimport { RecordEnvelope, PeerRecord } from '@libp2p/peer-record';\nimport { isGlobalUnicast } from '@libp2p/utils/multiaddr/is-global-unicast';\nimport { isPrivate } from '@libp2p/utils/multiaddr/is-private';\nimport { protocols } from '@multiformats/multiaddr';\nimport { IP_OR_DOMAIN, TCP } 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';\nconst CODEC_IP6 = 0x29;\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)\n .catch(err => {\n if (err.name === UnsupportedProtocolError.name) {\n // the remote did not support identify, ignore the error\n return;\n }\n this.log.error('error during identify trigged by connection:open', err);\n });\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 runOnLimitedConnection: this.runOnLimitedConnection\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 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 InvalidMessageError('public key was missing from identify message');\n }\n const key = publicKeyFromProtobuf(publicKey);\n const id = peerIdFromCID(key.toCID());\n if (!connection.remotePeer.equals(id)) {\n throw new InvalidMessageError('identified peer does not match the expected peer');\n }\n if (this.peerId.equals(id)) {\n throw new InvalidMessageError('identified peer is our own peer id?');\n }\n // if the observed address is publicly routable, add it to the address\n // manager for verification via AutoNAT\n this.maybeAddObservedAddress(observedAddr);\n this.log('identify completed for peer %p and protocols %o', id, protocols);\n return consumeIdentifyMessage(this.peerStore, this.events, this.log, connection, message);\n }\n maybeAddObservedAddress(observedAddr) {\n const cleanObservedAddr = getCleanMultiaddr(observedAddr);\n if (cleanObservedAddr == null) {\n return;\n }\n this.log.trace('our observed address was %a', cleanObservedAddr);\n if (isPrivate(cleanObservedAddr)) {\n this.log.trace('our observed address was private');\n return;\n }\n const tuples = cleanObservedAddr.stringTuples();\n if (tuples[0][0] === CODEC_IP6 && !isGlobalUnicast(cleanObservedAddr)) {\n this.log.trace('our observed address was IPv6 but not a global unicast address');\n return;\n }\n if (TCP.exactMatch(cleanObservedAddr)) {\n // TODO: because socket dials can't use the same local port as the TCP\n // listener, many unique observed addresses are reported so ignore all\n // TCP addresses until https://github.com/libp2p/js-libp2p/issues/2620\n // is resolved\n return;\n }\n this.log.trace('storing the observed address');\n this.addressManager.addObservedAddr(cleanObservedAddr);\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 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.privateKey);\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: publicKeyToProtobuf(this.privateKey.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","import { cidrContains } from '@chainsafe/netmask';\nconst CODEC_IP6 = 0x29;\n/**\n * Check if a given multiaddr is an IPv6 global unicast address\n */\nexport function isGlobalUnicast(ma) {\n try {\n const [[codec, value]] = ma.stringTuples();\n if (value == null) {\n return false;\n }\n if (codec === CODEC_IP6) {\n return cidrContains('2000::/3', value);\n }\n }\n catch {\n }\n return false;\n}\n//# sourceMappingURL=is-global-unicast.js.map","import { IpNet } from \"./ipnet.js\";\nexport { ipToString } from \"./util.js\";\nexport { maskIp, iPv4FromIPv6, isIPv4mappedIPv6 } from \"./ip.js\";\nexport { IpNet } from \"./ipnet.js\";\nexport { parseCidr } from \"./cidr.js\";\n/**\n * Checks if cidr block contains ip address\n * @param cidr ipv4 or ipv6 formatted cidr . Example 198.51.100.14/24 or 2001:db8::/48\n * @param ip ipv4 or ipv6 address Example 198.51.100.14 or 2001:db8::\n *\n */\nexport function cidrContains(cidr, ip) {\n const ipnet = new IpNet(cidr);\n return ipnet.contains(ip);\n}\n//# sourceMappingURL=index.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","/**\n * A rate limit was hit\n */\nexport class RateLimitError extends Error {\n remainingPoints;\n msBeforeNext;\n consumedPoints;\n isFirstInDuration;\n constructor(message = 'Rate limit exceeded', props) {\n super(message);\n this.name = 'RateLimitError';\n this.remainingPoints = props.remainingPoints;\n this.msBeforeNext = props.msBeforeNext;\n this.consumedPoints = props.consumedPoints;\n this.isFirstInDuration = props.isFirstInDuration;\n }\n}\nexport class QueueFullError extends Error {\n static name = 'QueueFullError';\n constructor(message = 'The queue was full') {\n super(message);\n this.name = 'QueueFullError';\n }\n}\n//# sourceMappingURL=errors.js.map","import delay from 'delay';\nimport { RateLimitError } from './errors.js';\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 RateLimitError('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}\nexport class 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 { InvalidMessageError } from '@libp2p/interface';\nimport { 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 new InvalidMessageError('Unprocessed message queue size too large!');\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.name === 'InvalidMessageError') {\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 new InvalidMessageError('Message size too large');\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","/**\n * There was an error in the stream input buffer\n */\nexport class StreamInputBufferError extends Error {\n constructor(message = 'Stream input buffer error') {\n super(message);\n this.name = 'StreamInputBufferError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { StreamResetError, StreamStateError } 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 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 StreamStateError(`writable end state is \"${this.writeStatus}\" not \"ready\"`);\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 if (this.status !== 'open') {\n return;\n }\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 StreamResetError('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 { TooManyOutboundProtocolStreamsError, MuxerClosedError } 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 { StreamInputBufferError } from './errors.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 MuxerClosedError('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 TooManyOutboundProtocolStreamsError('Too many outbound streams open');\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 StreamInputBufferError('Input buffer full - increase Mplex maxBufferSize to accommodate slow consumers');\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}\n/**\n * @deprecated mplex is deprecated as it has no flow control. Please use yamux instead.\n */\nexport function mplex(init = {}) {\n return (components) => new Mplex(components, init);\n}\n//# sourceMappingURL=index.js.map","import { InvalidParametersError } 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 InvalidParametersError('random bytes length must be a Number bigger than 0');\n }\n return randB(length);\n}\n//# sourceMappingURL=random-bytes.js.map","import { randomBytes } from '@libp2p/crypto';\nimport { AbortError, InvalidMessageError, ProtocolError, TimeoutError } 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 } from './constants.js';\nexport class PingService {\n protocol;\n components;\n started;\n timeout;\n maxInboundStreams;\n maxOutboundStreams;\n runOnLimitedConnection;\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.runOnLimitedConnection = init.runOnLimitedConnection ?? 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 runOnLimitedConnection: this.runOnLimitedConnection\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 TimeoutError('ping 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 InvalidMessageError('Too much data received'));\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 runOnLimitedConnection: this.runOnLimitedConnection\n });\n onAbort = () => {\n stream?.abort(new AbortError());\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 ProtocolError(`Did not receive a ping ack after ${ms}ms`);\n }\n if (!uint8ArrayEquals(data, result.subarray())) {\n throw new ProtocolError(`Received wrong ping ack after ${ms}ms`);\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","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;\n//# sourceMappingURL=constants.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","/**\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=transport.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 return extractTuple('sni', ma)?.[1];\n}\nfunction extractPort(ma) {\n const port = extractTuple('tcp', ma)?.[1];\n if (port == null) {\n return '';\n }\n return `:${port}`;\n}\nfunction extractTuple(name, ma) {\n let code;\n try {\n code = protocols(name).code;\n }\n catch (e) {\n // No support for protocol in multiaddr\n return;\n }\n for (const [proto, value] of ma) {\n if (proto === code && value != null) {\n return [proto, value];\n }\n }\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 == null) {\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 == null) {\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 == null) {\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 == null) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}`;\n },\n p2p: (value, restMa) => {\n const tailProto = restMa.pop();\n if (tailProto == null) {\n throw new Error('Unexpected end of multiaddr');\n }\n return `${interpretNext(tailProto[0], tailProto[1] ?? '', restMa)}`;\n },\n http: (value, restMa) => {\n const maHasTLS = hasTLS(restMa);\n const sni = extractSNI(restMa);\n const port = extractPort(restMa);\n if (maHasTLS && sni != null) {\n return `https://${sni}${port}`;\n }\n const protocol = maHasTLS ? 'https://' : 'http://';\n const tailProto = restMa.pop();\n if (tailProto == null) {\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 == null) {\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 == null) {\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 == null) {\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 == null) {\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 const port = extractPort(restMa);\n if (maHasTLS && sni != null) {\n return `wss://${sni}${port}`;\n }\n const protocol = maHasTLS ? 'wss://' : 'ws://';\n const tailProto = restMa.pop();\n if (tailProto == null) {\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 == null) {\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};\nexport function multiaddrToUri(input, opts) {\n const ma = multiaddr(input);\n const parts = ma.stringTuples();\n const head = parts.pop();\n if (head == null) {\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://') || uri.startsWith('ws://') || uri.startsWith('wss://')) {\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 type;\n detail;\n constructor(type, detail) {\n super(type);\n this.type = type;\n // @ts-expect-error detail may be undefined\n this.detail = detail;\n }\n}\n//# sourceMappingURL=index.js.map","import { WebSocketsSecure, WebSockets, DNS } from '@multiformats/multiaddr-matcher';\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p` with a `denyDialMultiaddr` method that returns `false`\n */\nexport function all(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return WebSocketsSecure.exactMatch(ma) || WebSockets.exactMatch(ma);\n });\n}\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p`\n */\nexport function wss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return WebSocketsSecure.exactMatch(ma);\n });\n}\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p`\n */\nexport function dnsWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return DNS.matches(ma) && WebSocketsSecure.exactMatch(ma);\n });\n}\n/**\n * @deprecated Configure this globally by passing a `connectionGater` to `createLibp2p`\n */\nexport function dnsWsOrWss(multiaddrs) {\n return multiaddrs.filter((ma) => {\n return DNS.matches(ma) && (WebSocketsSecure.exactMatch(ma) || WebSockets.exactMatch(ma));\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('/dns4/example.com/tcp/9090/tls/ws')\n * await node.dial(ma)\n * ```\n */\nimport { transportSymbol, serviceCapabilities, ConnectionFailedError } 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 * 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 ConnectionFailedError(`Could not connect to ${ma.toString()}`);\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) {\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 events: this.components.events,\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 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 { AbortError } 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 AbortError('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","// Time to wait for a connection to close gracefully before destroying it manually\nexport const CLOSE_TIMEOUT = 500;\n//# sourceMappingURL=constants.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","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\tlet abortHandler;\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\tabortHandler = () => {\n\t\t\t\treject(getAbortedReason(signal));\n\t\t\t};\n\n\t\t\tsignal.addEventListener('abort', abortHandler, {once: true});\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\tif (abortHandler && options.signal) {\n\t\t\toptions.signal.removeEventListener('abort', abortHandler);\n\t\t}\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 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 id: options.id,\n run,\n };\n if (this.size === 0 || 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 setPriority(id, priority) {\n const index = this.#queue.findIndex((element) => element.id === id);\n if (index === -1) {\n throw new ReferenceError(`No promise function with the id \"${id}\" exists in the queue.`);\n }\n const [item] = this.#queue.splice(index, 1);\n this.enqueue(item.run, { priority, id });\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 // Use to assign a unique identifier to a promise function, if not explicitly specified\n #idAssigner = 1n;\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 /**\n Updates the priority of a promise function by its id, affecting its execution order. Requires a defined concurrency limit to take effect.\n\n For example, this can be used to prioritize a promise function to run earlier.\n\n ```js\n import PQueue from 'p-queue';\n\n const queue = new PQueue({concurrency: 1});\n\n queue.add(async () => '🦄', {priority: 1});\n queue.add(async () => '🦀', {priority: 0, id: '🦀'});\n queue.add(async () => '🦄', {priority: 1});\n queue.add(async () => '🦄', {priority: 1});\n\n queue.setPriority('🦀', 2);\n ```\n\n In this case, the promise function with `id: '🦀'` runs second.\n\n You can also deprioritize a promise function to delay its execution:\n\n ```js\n import PQueue from 'p-queue';\n\n const queue = new PQueue({concurrency: 1});\n\n queue.add(async () => '🦄', {priority: 1});\n queue.add(async () => '🦀', {priority: 1, id: '🦀'});\n queue.add(async () => '🦄');\n queue.add(async () => '🦄', {priority: 0});\n\n queue.setPriority('🦀', -1);\n ```\n Here, the promise function with `id: '🦀'` executes last.\n */\n setPriority(id, priority) {\n this.#queue.setPriority(id, priority);\n }\n async add(function_, options = {}) {\n // In case `id` is not defined.\n options.id ??= (this.#idAssigner++).toString();\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","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 { 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');\nclass RecursionLimitError extends Error {\n constructor(message = 'Max recursive depth reached') {\n super(message);\n this.name = 'RecursionLimitError';\n }\n}\nexport const dnsaddrResolver = async function dnsaddrResolver(ma, options = {}) {\n const recursionLimit = options.maxRecursiveDepth ?? MAX_RECURSIVE_DEPTH;\n if (recursionLimit === 0) {\n throw new RecursionLimitError('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","import { FaultTolerance, InvalidParametersError } from '@libp2p/interface';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport mergeOptions from 'merge-options';\nconst DefaultConfig = {\n addresses: {\n listen: [],\n announce: [],\n noAnnounce: [],\n announceFilter: (multiaddrs) => multiaddrs\n },\n connectionManager: {\n resolvers: {\n dnsaddr: dnsaddrResolver\n }\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 InvalidParametersError('Private network is enforced, but no protector was provided');\n }\n return resultingOptions;\n}\n//# sourceMappingURL=config.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=content-routing.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=peer-routing.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 globalThis.process !== 'undefined' && 'env' in globalThis.process) {\n r = globalThis.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 [weald](https://www.npmjs.com/package/weald), a TypeScript port of 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};\n// Add a formatter for stringifying Errors\ndebug.formatters.e = (v) => {\n return v == null ? 'undefined' : notEmpty(v.stack) ?? notEmpty(v.message) ?? 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}\nfunction notEmpty(str) {\n if (str == null) {\n return;\n }\n str = str.trim();\n if (str.length === 0) {\n return;\n }\n return str;\n}\n//# sourceMappingURL=index.js.map","import { peerIdFromMultihash } from '@libp2p/peer-id';\nimport { base58btc } from 'multiformats/bases/base58';\nimport * as Digest from 'multiformats/hashes/digest';\n/**\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}\nexport function peerIdFromString(str) {\n const multihash = Digest.decode(base58btc.decode(`z${str}`));\n return peerIdFromMultihash(multihash);\n}\n//# sourceMappingURL=util.js.map","import { mapIterable, peerIdFromString } 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 peerId = peerIdFromString(str);\n predicate(peerId, peerId, 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","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?.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?.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","/* 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, MaxSizeError, message } from 'protons-runtime';\nimport { alloc as uint8ArrayAlloc } from 'uint8arrays/alloc';\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, opts = {}) => {\n const obj = {\n key: '',\n value: 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.key = reader.string();\n break;\n }\n case 2: {\n obj.value = 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 Peer$metadataEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$metadataEntry.codec());\n };\n Peer$metadataEntry.decode = (buf, opts) => {\n return decodeMessage(buf, Peer$metadataEntry.codec(), opts);\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, opts = {}) => {\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 }\n case 2: {\n obj.value = Tag.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.value\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 Peer$tagsEntry.encode = (obj) => {\n return encodeMessage(obj, Peer$tagsEntry.codec());\n };\n Peer$tagsEntry.decode = (buf, opts) => {\n return decodeMessage(buf, Peer$tagsEntry.codec(), opts);\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 (obj.updated != null) {\n w.uint32(64);\n w.uint64Number(obj.updated);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\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 if (opts.limits?.addresses != null && obj.addresses.length === opts.limits.addresses) {\n throw new MaxLengthError('Decode error - map field \"addresses\" had too many elements');\n }\n obj.addresses.push(Address.codec().decode(reader, reader.uint32(), {\n limits: opts.limits?.addresses$\n }));\n break;\n }\n case 2: {\n if (opts.limits?.protocols != null && obj.protocols.length === opts.limits.protocols) {\n throw new MaxLengthError('Decode error - map field \"protocols\" had too many elements');\n }\n obj.protocols.push(reader.string());\n break;\n }\n case 4: {\n obj.publicKey = reader.bytes();\n break;\n }\n case 5: {\n obj.peerRecordEnvelope = reader.bytes();\n break;\n }\n case 6: {\n if (opts.limits?.metadata != null && obj.metadata.size === opts.limits.metadata) {\n throw new MaxSizeError('Decode error - map field \"metadata\" had too many elements');\n }\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 if (opts.limits?.tags != null && obj.tags.size === opts.limits.tags) {\n throw new MaxSizeError('Decode error - map field \"tags\" had too many elements');\n }\n const entry = Peer.Peer$tagsEntry.codec().decode(reader, reader.uint32(), {\n limits: {\n value: opts.limits?.tags$value\n }\n });\n obj.tags.set(entry.key, entry.value);\n break;\n }\n case 8: {\n obj.updated = reader.uint64Number();\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 Peer.encode = (obj) => {\n return encodeMessage(obj, Peer.codec());\n };\n Peer.decode = (buf, opts) => {\n return decodeMessage(buf, Peer.codec(), opts);\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 (obj.observed != null) {\n w.uint32(24);\n w.uint64Number(obj.observed);\n }\n if (opts.lengthDelimited !== false) {\n w.ldelim();\n }\n }, (reader, length, opts = {}) => {\n const obj = {\n multiaddr: 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.multiaddr = reader.bytes();\n break;\n }\n case 2: {\n obj.isCertified = reader.bool();\n break;\n }\n case 3: {\n obj.observed = reader.uint64Number();\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 Address.encode = (obj) => {\n return encodeMessage(obj, Address.codec());\n };\n Address.decode = (buf, opts) => {\n return decodeMessage(buf, Address.codec(), opts);\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, opts = {}) => {\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 }\n case 2: {\n obj.expiry = 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 Tag.encode = (obj) => {\n return encodeMessage(obj, Tag.codec());\n };\n Tag.decode = (buf, opts) => {\n return decodeMessage(buf, Tag.codec(), opts);\n };\n})(Tag || (Tag = {}));\n//# sourceMappingURL=peer.js.map","import { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { peerIdFromPublicKey } from '@libp2p/peer-id';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { base58btc } from 'multiformats/bases/base58';\nimport * as Digest from 'multiformats/hashes/digest';\nimport { Peer as PeerPB } from '../pb/peer.js';\nfunction populatePublicKey(peerId, protobuf) {\n if (peerId.publicKey != null || protobuf.publicKey == null) {\n return peerId;\n }\n let digest;\n if (peerId.type === 'RSA') {\n // avoid hashing public key\n const multihash = base58btc.decode(`z${peerId}`);\n digest = Digest.decode(multihash);\n }\n const publicKey = publicKeyFromProtobuf(protobuf.publicKey, digest);\n return peerIdFromPublicKey(publicKey);\n}\nexport function bytesToPeer(peerId, buf, maxAddressAge) {\n const peer = PeerPB.decode(buf);\n return pbToPeer(peerId, peer, maxAddressAge);\n}\nexport function pbToPeer(peerId, peer, maxAddressAge) {\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: populatePublicKey(peerId, peer),\n addresses: peer.addresses\n // remove any expired multiaddrs\n .filter(({ observed }) => observed != null && observed > (Date.now() - maxAddressAge))\n .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 { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nexport function peerEquals(peerA, peerB) {\n return addressesEqual(peerA.addresses, peerB.addresses) &&\n protocolsEqual(peerA.protocols, peerB.protocols) &&\n publicKeyEqual(peerA.publicKey, peerB.publicKey) &&\n peerRecordEnvelope(peerA.peerRecordEnvelope, peerB.peerRecordEnvelope) &&\n metadataEqual(peerA.metadata, peerB.metadata) &&\n tagsEqual(peerA.tags, peerB.tags);\n}\nfunction addressesEqual(addressesA, addressesB) {\n return compareArrays(addressesA, addressesB, (a, b) => {\n if (a.isCertified !== b.isCertified) {\n return false;\n }\n if (!uint8ArrayEquals(a.multiaddr, b.multiaddr)) {\n return false;\n }\n return true;\n });\n}\nfunction protocolsEqual(protocolsA, protocolsB) {\n return compareArrays(protocolsA, protocolsB, (a, b) => a === b);\n}\nfunction publicKeyEqual(publicKeyA, publicKeyB) {\n return compareOptionalUint8Arrays(publicKeyA, publicKeyB);\n}\nfunction peerRecordEnvelope(envelopeA, envelopeB) {\n return compareOptionalUint8Arrays(envelopeA, envelopeB);\n}\nfunction metadataEqual(metadataA, metadataB) {\n return compareMaps(metadataA, metadataB, (a, b) => uint8ArrayEquals(a, b));\n}\nfunction tagsEqual(metadataA, metadataB) {\n return compareMaps(metadataA, metadataB, (a, b) => a.value === b.value && a.expiry === b.expiry);\n}\nfunction compareOptionalUint8Arrays(arrA, arrB) {\n if (arrA == null && arrB == null) {\n return true;\n }\n if (arrA != null && arrB != null) {\n return uint8ArrayEquals(arrA, arrB);\n }\n return false;\n}\nfunction compareArrays(arrA, arrB, compare) {\n if (arrA.length !== arrB.length) {\n return false;\n }\n for (let i = 0; i < arrA.length; i++) {\n if (!compare(arrA[i], arrB[i])) {\n return false;\n }\n }\n return true;\n}\nfunction compareMaps(mapA, mapB, compare) {\n if (mapA.size !== mapB.size) {\n return false;\n }\n for (const [key, value] of mapA.entries()) {\n const valueB = mapB.get(key);\n if (valueB == null) {\n return false;\n }\n if (!compare(value, valueB)) {\n return false;\n }\n }\n return true;\n}\n//# sourceMappingURL=peer-equals.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 { InvalidParametersError } from '@libp2p/interface';\nimport { isPeerId } from '@libp2p/interface';\nimport { Key } from 'interface-datastore/key';\nexport const NAMESPACE_COMMON = '/peers/';\nexport function peerIdToDatastoreKey(peerId) {\n if (!isPeerId(peerId) || peerId.type == null) {\n throw new InvalidParametersError('Invalid PeerId');\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 { InvalidParametersError } from '@libp2p/interface';\nimport { isMultiaddr, multiaddr } from '@multiformats/multiaddr';\nexport async function dedupeFilterAndSortAddresses(peerId, filter, addresses, existingAddresses) {\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 InvalidParametersError('Multiaddr was invalid');\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","/* eslint-disable complexity */\nimport { publicKeyToProtobuf } from '@libp2p/crypto/keys';\nimport { InvalidParametersError } from '@libp2p/interface';\nimport { equals as uint8ArrayEquals } from 'uint8arrays/equals';\nimport { dedupeFilterAndSortAddresses } from './dedupe-addresses.js';\nexport async function toPeerPB(peerId, data, strategy, options) {\n if (data == null) {\n throw new InvalidParametersError('Invalid PeerData');\n }\n if (data.publicKey != null && peerId.publicKey != null && !data.publicKey.equals(peerId.publicKey)) {\n throw new InvalidParametersError('publicKey bytes do not match peer id publicKey bytes');\n }\n const existingPeer = options.existingPeer?.peer;\n if (existingPeer != null && !peerId.equals(existingPeer.id)) {\n throw new InvalidParametersError('peer id did not match existing peer id');\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 let publicKey;\n if (existingPeer?.id.publicKey != null) {\n publicKey = publicKeyToProtobuf(existingPeer.id.publicKey);\n }\n else if (data.publicKey != null) {\n publicKey = publicKeyToProtobuf(data.publicKey);\n }\n else if (peerId.publicKey != null) {\n publicKey = publicKeyToProtobuf(peerId.publicKey);\n }\n const output = {\n addresses: await dedupeFilterAndSortAddresses(peerId, options.addressFilter ?? (async () => true), addresses, options.existingPeer?.peerPB.addresses),\n protocols: [...protocols.values()].sort((a, b) => {\n return a.localeCompare(b);\n }),\n metadata,\n tags,\n publicKey,\n peerRecordEnvelope\n };\n // add observed addresses to multiaddrs\n output.addresses.forEach(addr => {\n addr.observed = options.existingPeer?.peerPB.addresses?.find(addr => uint8ArrayEquals(addr.multiaddr, addr.multiaddr))?.observed ?? Date.now();\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 InvalidParametersError('Metadata key must be a string');\n }\n if (!(value instanceof Uint8Array)) {\n throw new InvalidParametersError('Metadata value must be a Uint8Array');\n }\n}\nfunction validateTag(key, tag) {\n if (typeof key !== 'string') {\n throw new InvalidParametersError('Tag name must be a string');\n }\n if (tag.value != null) {\n if (parseInt(`${tag.value}`, 10) !== tag.value) {\n throw new InvalidParametersError('Tag value must be an integer');\n }\n if (tag.value < 0 || tag.value > 100) {\n throw new InvalidParametersError('Tag value must be between 0-100');\n }\n }\n if (tag.ttl != null) {\n if (parseInt(`${tag.ttl}`, 10) !== tag.ttl) {\n throw new InvalidParametersError('Tag ttl must be an integer');\n }\n if (tag.ttl < 0) {\n throw new InvalidParametersError('Tag ttl must be between greater than 0');\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 { NotFoundError } from '@libp2p/interface';\nimport { peerIdFromCID } from '@libp2p/peer-id';\nimport mortice, {} from 'mortice';\nimport { base32 } from 'multiformats/bases/base32';\nimport { CID } from 'multiformats/cid';\nimport { MAX_ADDRESS_AGE, MAX_PEER_AGE } from './constants.js';\nimport { Peer as PeerPB } from './pb/peer.js';\nimport { bytesToPeer, pbToPeer } from './utils/bytes-to-peer.js';\nimport { peerEquals } from './utils/peer-equals.js';\nimport { NAMESPACE_COMMON, peerIdToDatastoreKey } from './utils/peer-id-to-datastore-key.js';\nimport { toPeerPB } from './utils/to-peer-pb.js';\nfunction keyToPeerId(key) {\n // /peers/${peer-id-as-libp2p-key-cid-string-in-base-32}\n const base32Str = key.toString().split('/')[2];\n const buf = CID.parse(base32Str, base32);\n return peerIdFromCID(buf);\n}\nfunction decodePeer(key, value, maxAddressAge) {\n const peerId = keyToPeerId(key);\n return bytesToPeer(peerId, value, maxAddressAge);\n}\nfunction mapQuery(query, maxAddressAge) {\n return {\n prefix: NAMESPACE_COMMON,\n filters: (query.filters ?? []).map(fn => ({ key, value }) => {\n return fn(decodePeer(key, value, maxAddressAge));\n }),\n orders: (query.orders ?? []).map(fn => (a, b) => {\n return fn(decodePeer(a.key, a.value, maxAddressAge), decodePeer(b.key, b.value, maxAddressAge));\n })\n };\n}\nexport class PersistentStore {\n peerId;\n datastore;\n lock;\n addressFilter;\n log;\n maxAddressAge;\n maxPeerAge;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:peer-store');\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 this.maxAddressAge = init.maxAddressAge ?? MAX_ADDRESS_AGE;\n this.maxPeerAge = init.maxPeerAge ?? MAX_PEER_AGE;\n }\n async has(peerId) {\n try {\n await this.load(peerId);\n return true;\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\n throw err;\n }\n }\n return false;\n }\n async delete(peerId) {\n if (this.peerId.equals(peerId)) {\n return;\n }\n await this.datastore.delete(peerIdToDatastoreKey(peerId));\n }\n async load(peerId) {\n const key = peerIdToDatastoreKey(peerId);\n const buf = await this.datastore.get(key);\n const peer = PeerPB.decode(buf);\n if (this.#peerIsExpired(peerId, peer)) {\n await this.datastore.delete(key);\n throw new NotFoundError();\n }\n return pbToPeer(peerId, peer, this.peerId.equals(peerId) ? Infinity : this.maxAddressAge);\n }\n async save(peerId, data) {\n const existingPeer = await this.#findExistingPeer(peerId);\n const peerPb = await toPeerPB(peerId, data, 'patch', {\n addressFilter: this.addressFilter\n });\n return this.#saveIfDifferent(peerId, peerPb, existingPeer);\n }\n async patch(peerId, data) {\n const 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, existingPeer);\n }\n async merge(peerId, data) {\n const 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, existingPeer);\n }\n async *all(query) {\n for await (const { key, value } of this.datastore.query(mapQuery(query ?? {}, this.maxAddressAge))) {\n const peerId = keyToPeerId(key);\n // skip self peer if present\n if (peerId.equals(this.peerId)) {\n continue;\n }\n const peer = PeerPB.decode(value);\n // remove expired peer\n if (this.#peerIsExpired(peerId, peer)) {\n await this.datastore.delete(key);\n continue;\n }\n yield pbToPeer(peerId, peer, this.peerId.equals(peerId) ? Infinity : this.maxAddressAge);\n }\n }\n async #findExistingPeer(peerId) {\n try {\n const key = peerIdToDatastoreKey(peerId);\n const buf = await this.datastore.get(key);\n const peerPB = PeerPB.decode(buf);\n // remove expired peer\n if (this.#peerIsExpired(peerId, peerPB)) {\n await this.datastore.delete(key);\n throw new NotFoundError();\n }\n return {\n peerPB,\n peer: bytesToPeer(peerId, buf, this.maxAddressAge)\n };\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\n this.log.error('invalid peer data found in peer store - %e', err);\n }\n }\n }\n async #saveIfDifferent(peerId, peer, existingPeer) {\n // record last update\n peer.updated = Date.now();\n const buf = PeerPB.encode(peer);\n await this.datastore.put(peerIdToDatastoreKey(peerId), buf);\n return {\n peer: bytesToPeer(peerId, buf, this.maxAddressAge),\n previous: existingPeer?.peer,\n updated: existingPeer == null || !peerEquals(peer, existingPeer.peerPB)\n };\n }\n #peerIsExpired(peerId, peer) {\n if (peer.updated == null) {\n return true;\n }\n if (this.peerId.equals(peerId)) {\n return false;\n }\n const expired = peer.updated < (Date.now() - this.maxPeerAge);\n const minAddressObserved = Date.now() - this.maxAddressAge;\n const addrs = peer.addresses.filter(addr => {\n return addr.observed != null && addr.observed > minAddressObserved;\n });\n return expired && addrs.length === 0;\n }\n}\n//# sourceMappingURL=store.js.map","export const MAX_ADDRESS_AGE = 3_600_000;\nexport const MAX_PEER_AGE = 21_600_000;\n//# sourceMappingURL=constants.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 { peerIdFromCID } from '@libp2p/peer-id';\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 */\nclass 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 const peerId = peerIdFromCID(envelope.publicKey.toCID());\n if (expectedPeer?.equals(peerId) === false) {\n this.log('envelope peer id was not the expected peer id - expected: %p received: %p', expectedPeer, peerId);\n return false;\n }\n const peerRecord = PeerRecord.createFromProtobuf(envelope.payload);\n let peer;\n try {\n peer = await this.get(peerId);\n }\n catch (err) {\n if (err.name !== 'NotFoundError') {\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}\nexport function persistentPeerStore(components, init = {}) {\n return new PersistentPeerStore(components, init);\n}\n//# sourceMappingURL=index.js.map","export class OpenFailedError extends Error {\n static name = 'OpenFailedError';\n static code = 'ERR_OPEN_FAILED';\n name = OpenFailedError.name;\n code = OpenFailedError.code;\n constructor(message = 'Open failed') {\n super(message);\n }\n}\nexport class CloseFailedError extends Error {\n static name = 'CloseFailedError';\n static code = 'ERR_CLOSE_FAILED';\n name = CloseFailedError.name;\n code = CloseFailedError.code;\n constructor(message = 'Close failed') {\n super(message);\n }\n}\nexport class PutFailedError extends Error {\n static name = 'PutFailedError';\n static code = 'ERR_PUT_FAILED';\n name = PutFailedError.name;\n code = PutFailedError.code;\n constructor(message = 'Put failed') {\n super(message);\n }\n}\nexport class GetFailedError extends Error {\n static name = 'GetFailedError';\n static code = 'ERR_GET_FAILED';\n name = GetFailedError.name;\n code = GetFailedError.code;\n constructor(message = 'Get failed') {\n super(message);\n }\n}\nexport class DeleteFailedError extends Error {\n static name = 'DeleteFailedError';\n static code = 'ERR_DELETE_FAILED';\n name = DeleteFailedError.name;\n code = DeleteFailedError.code;\n constructor(message = 'Delete failed') {\n super(message);\n }\n}\nexport class HasFailedError extends Error {\n static name = 'HasFailedError';\n static code = 'ERR_HAS_FAILED';\n name = HasFailedError.name;\n code = HasFailedError.code;\n constructor(message = 'Has failed') {\n super(message);\n }\n}\nexport class NotFoundError extends Error {\n static name = 'NotFoundError';\n static code = 'ERR_NOT_FOUND';\n name = NotFoundError.name;\n code = NotFoundError.code;\n constructor(message = 'Not Found') {\n super(message);\n }\n}\nexport class AbortError extends Error {\n static name = 'AbortError';\n static code = 'ERR_ABORTED';\n name = AbortError.name;\n code = AbortError.code;\n constructor(message = 'Aborted') {\n super(message);\n }\n}\n//# sourceMappingURL=errors.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 { NotFoundError } from 'interface-store';\nimport { BaseDatastore } from './base.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 new 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 { 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","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","export var messages;\n(function (messages) {\n messages[\"NOT_STARTED_YET\"] = \"The libp2p node is not started yet\";\n messages[\"NOT_FOUND\"] = \"Not found\";\n})(messages || (messages = {}));\nexport class MissingServiceError extends Error {\n constructor(message = 'Missing service') {\n super(message);\n this.name = 'MissingServiceError';\n }\n}\nexport class UnmetServiceDependenciesError extends Error {\n constructor(message = 'Unmet service dependencies') {\n super(message);\n this.name = 'UnmetServiceDependenciesError';\n }\n}\nexport class NoContentRoutersError extends Error {\n constructor(message = 'No content routers available') {\n super(message);\n this.name = 'NoContentRoutersError';\n }\n}\nexport class NoPeerRoutersError extends Error {\n constructor(message = 'No peer routers available') {\n super(message);\n this.name = 'NoPeerRoutersError';\n }\n}\nexport class QueriedForSelfError extends Error {\n constructor(message = 'Should not try to find self') {\n super(message);\n this.name = 'QueriedForSelfError';\n }\n}\nexport class UnhandledProtocolError extends Error {\n constructor(message = 'Unhandled protocol error') {\n super(message);\n this.name = 'UnhandledProtocolError';\n }\n}\nexport class DuplicateProtocolHandlerError extends Error {\n constructor(message = 'Duplicate protocol handler error') {\n super(message);\n this.name = 'DuplicateProtocolHandlerError';\n }\n}\nexport class DialDeniedError extends Error {\n constructor(message = 'Dial denied error') {\n super(message);\n this.name = 'DialDeniedError';\n }\n}\nexport class NoValidAddressesError extends Error {\n constructor(message = 'No valid addresses') {\n super(message);\n this.name = 'NoValidAddressesError';\n }\n}\nexport class ConnectionInterceptedError extends Error {\n constructor(message = 'Connection intercepted') {\n super(message);\n this.name = 'ConnectionInterceptedError';\n }\n}\nexport class ConnectionDeniedError extends Error {\n constructor(message = 'Connection denied') {\n super(message);\n this.name = 'ConnectionDeniedError';\n }\n}\nexport class MuxerUnavailableError extends Error {\n constructor(message = 'Stream is not multiplexed') {\n super(message);\n this.name = 'MuxerUnavailableError';\n }\n}\nexport class EncryptionFailedError extends Error {\n constructor(message = 'Encryption failed') {\n super(message);\n this.name = 'EncryptionFailedError';\n }\n}\nexport class TransportUnavailableError extends Error {\n constructor(message = 'Transport unavailable') {\n super(message);\n this.name = 'TransportUnavailableError';\n }\n}\n//# sourceMappingURL=errors.js.map","import { serviceCapabilities, serviceDependencies } from '@libp2p/interface';\nimport { isStartable } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nimport { MissingServiceError, UnmetServiceDependenciesError } from './errors.js';\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 MissingServiceError(`${prop} not set`);\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 UnmetServiceDependenciesError(`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.`);\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","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 { 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(), { key, 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 [val[1].key, val[1].value];\n });\n }\n forEach(fn) {\n this.map.forEach((value, key) => {\n fn(value.value, value.key, this);\n });\n }\n get(peer) {\n return this.map.get(peer.toString())?.value;\n }\n has(peer) {\n return this.map.has(peer.toString());\n }\n set(peer, value) {\n this.map.set(peer.toString(), { key: peer, value });\n }\n keys() {\n return mapIterable(this.map.values(), (val) => {\n return val.key;\n });\n }\n values() {\n return mapIterable(this.map.values(), (val) => val.value);\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 { InvalidMultiaddrError, InvalidParametersError, isPeerId } from '@libp2p/interface';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { isMultiaddr } from '@multiformats/multiaddr';\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 InvalidMultiaddrError('Invalid multiaddr');\n }\n const maPeerIdStr = ma.getPeerId();\n if (maPeerIdStr == null) {\n if (peerId != null) {\n throw new InvalidParametersError('Multiaddrs must all have the same peer id or have no peer id');\n }\n }\n else {\n const maPeerId = peerIdFromString(maPeerIdStr);\n if (peerId?.equals(maPeerId) !== true) {\n throw new InvalidParametersError('Multiaddrs must all have the same peer id or have no peer id');\n }\n }\n });\n }\n return {\n peerId,\n multiaddrs: peer\n };\n}\n//# sourceMappingURL=get-peer.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 this.maybePruneConnections = this.maybePruneConnections.bind(this);\n }\n start() {\n this.events.addEventListener('connection:open', this.maybePruneConnections);\n }\n stop() {\n this.events.removeEventListener('connection:open', this.maybePruneConnections);\n }\n maybePruneConnections() {\n this._maybePruneConnections()\n .catch(err => {\n this.log.error('error while pruning connections %e', err);\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.name !== 'NotFoundError') {\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","export * from './constants.defaults.js';\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//# 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#upgradeTimeout\n */\nexport const UPGRADE_TIMEOUT = 3e3;\n/**\n * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#protocolNegotiationTimeout\n */\nexport const PROTOCOL_NEGOTIATION_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#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 * @see https://libp2p.github.io/js-libp2p/interfaces/index._internal_.ConnectionManagerConfig.html#maxParallelReconnects\n */\nexport const MAX_PARALLEL_RECONNECTS = 5;\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 attempt failed with the timestamp\n * 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 * 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 attempt succeeded with the\n * timestamp stored as a string.\n */\nexport const LAST_DIAL_SUCCESS_KEY = 'last-dial-success';\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","/**\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, TypedEventEmitter } from '@libp2p/interface';\nimport { pushable } from 'it-pushable';\nimport { raceEvent } from 'race-event';\nimport { QueueFullError } from '../errors.js';\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 maxSize;\n queue;\n pending;\n sort;\n constructor(init = {}) {\n super();\n this.concurrency = init.concurrency ?? Number.POSITIVE_INFINITY;\n this.maxSize = init.maxSize ?? 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 if (this.size === this.maxSize) {\n throw new QueueFullError();\n }\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 AbortError('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';\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","import { isPrivate } from '@libp2p/utils/multiaddr/is-private';\nimport { Circuit, WebSockets, WebSocketsSecure, WebRTC, WebRTCDirect, WebTransport, TCP } from '@multiformats/multiaddr-matcher';\n/**\n * Sorts addresses by order of reliability, where they have presented the fewest\n * problems:\n *\n * TCP -> WebSockets/Secure -> WebRTC -> WebRTCDirect -> WebTransport\n */\n// eslint-disable-next-line complexity\nexport function reliableTransportsFirst(a, b) {\n const isATCP = TCP.exactMatch(a.multiaddr);\n const isBTCP = TCP.exactMatch(b.multiaddr);\n if (isATCP && !isBTCP) {\n return -1;\n }\n if (!isATCP && isBTCP) {\n return 1;\n }\n const isAWebSocketSecure = WebSocketsSecure.exactMatch(a.multiaddr);\n const isBWebSocketSecure = WebSocketsSecure.exactMatch(b.multiaddr);\n if (isAWebSocketSecure && !isBWebSocketSecure) {\n return -1;\n }\n if (!isAWebSocketSecure && isBWebSocketSecure) {\n return 1;\n }\n const isAWebSocket = WebSockets.exactMatch(a.multiaddr);\n const isBWebSocket = WebSockets.exactMatch(b.multiaddr);\n if (isAWebSocket && !isBWebSocket) {\n return -1;\n }\n if (!isAWebSocket && isBWebSocket) {\n return 1;\n }\n const isAWebRTC = WebRTC.exactMatch(a.multiaddr);\n const isBWebRTC = WebRTC.exactMatch(b.multiaddr);\n if (isAWebRTC && !isBWebRTC) {\n return -1;\n }\n if (!isAWebRTC && isBWebRTC) {\n return 1;\n }\n const isAWebRTCDirect = WebRTCDirect.exactMatch(a.multiaddr);\n const isBWebRTCDirect = WebRTCDirect.exactMatch(b.multiaddr);\n if (isAWebRTCDirect && !isBWebRTCDirect) {\n return -1;\n }\n if (!isAWebRTCDirect && isBWebRTCDirect) {\n return 1;\n }\n const isAWebTransport = WebTransport.exactMatch(a.multiaddr);\n const isBWebTransport = WebTransport.exactMatch(b.multiaddr);\n if (isAWebTransport && !isBWebTransport) {\n return -1;\n }\n if (!isAWebTransport && isBWebTransport) {\n return 1;\n }\n // ... everything else\n return 0;\n}\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 * end 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 defaultAddressSorter(addresses) {\n return addresses\n .sort(reliableTransportsFirst)\n .sort(certifiedAddressesFirst)\n .sort(circuitRelayAddressesLast)\n .sort(publicAddressesFirst);\n}\n//# sourceMappingURL=address-sorter.js.map","/* eslint-disable max-depth */\nimport { TimeoutError, DialError, setMaxListeners, AbortError } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\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 { DialDeniedError, NoValidAddressesError } from '../errors.js';\nimport { getPeerAddress } from '../get-peer.js';\nimport { defaultAddressSorter } from './address-sorter.js';\nimport { DIAL_TIMEOUT, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL, LAST_DIAL_FAILURE_KEY, MAX_DIAL_QUEUE_LENGTH, LAST_DIAL_SUCCESS_KEY } from './constants.js';\nimport { resolveMultiaddrs } from './utils.js';\nimport { DEFAULT_DIAL_PRIORITY } from './index.js';\nconst defaultOptions = {\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;\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 if (event.detail.name !== AbortError.name) {\n this.log.error('error in dial queue - %e', event.detail);\n }\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?.status === 'open') {\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 DialError('Dial queue is 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 DialError('Peer had more than maxPeerAddrsToDial');\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 // record the successful dial and the address\n try {\n await this.components.peerStore.merge(conn.remotePeer, {\n multiaddrs: [\n conn.remoteAddr\n ],\n metadata: {\n [LAST_DIAL_SUCCESS_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 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.merge(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 TimeoutError(err.message);\n }\n errors.push(err);\n }\n }\n if (errors.length === 1) {\n throw errors[0];\n }\n throw new AggregateError(errors, 'All multiaddr dials 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 DialError('Tried to dial self');\n }\n if ((await this.components.connectionGater.denyDialPeer?.(peerId)) === true) {\n throw new DialDeniedError('The dial request is blocked by gater.allowDialPeer');\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.name !== 'NotFoundError') {\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.name !== 'NoPeerRoutersError') {\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 NoValidAddressesError('The dial request has 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 = this.addressSorter == null ? defaultAddressSorter(gatedAdrs) : gatedAdrs.sort(this.addressSorter);\n // make sure we actually have some addresses to dial\n if (sortedGatedAddrs.length === 0) {\n throw new DialDeniedError('The connection gater denied all addresses in the dial request');\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.runOnLimitedConnection === 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","/**\n * When a peer that is tagged with this prefix disconnects, we will attempt to\n * redial it, up to a limit.\n *\n * To allow multiple components to add/remove their own keep-alive tags without\n * accidentally overwriting those of other components, attach a unique suffix to\n * the tag, e.g. `keep-alive-circuit-relay` or `keep-alive-kad-dht`, etc.\n */\nexport const KEEP_ALIVE = 'keep-alive';\n//# sourceMappingURL=peer-store.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","const objectToString = Object.prototype.toString;\n\nconst isError = value => objectToString.call(value) === '[object Error]';\n\nconst errorMessages = new Set([\n\t'network error', // Chrome\n\t'Failed to fetch', // Chrome\n\t'NetworkError when attempting to fetch resource.', // Firefox\n\t'The Internet connection appears to be offline.', // Safari 16\n\t'Load failed', // Safari 17+\n\t'Network request failed', // `cross-fetch`\n\t'fetch failed', // Undici (Node.js)\n\t'terminated', // Undici (Node.js)\n]);\n\nexport default function isNetworkError(error) {\n\tconst isValid = error\n\t\t&& isError(error)\n\t\t&& error.name === 'TypeError'\n\t\t&& typeof error.message === 'string';\n\n\tif (!isValid) {\n\t\treturn false;\n\t}\n\n\t// We do an extra check for Safari 17+ as it has a very generic error message.\n\t// Network errors in Safari have no stack.\n\tif (error.message === 'Load failed') {\n\t\treturn error.stack === undefined;\n\t}\n\n\treturn errorMessages.has(error.message);\n}\n","import retry from 'retry';\nimport isNetworkError from 'is-network-error';\n\nexport class AbortError extends Error {\n\tconstructor(message) {\n\t\tsuper();\n\n\t\tif (message instanceof Error) {\n\t\t\tthis.originalError = message;\n\t\t\t({message} = message);\n\t\t} else {\n\t\t\tthis.originalError = new Error(message);\n\t\t\tthis.originalError.stack = this.stack;\n\t\t}\n\n\t\tthis.name = 'AbortError';\n\t\tthis.message = message;\n\t}\n}\n\nconst decorateErrorWithCounts = (error, attemptNumber, options) => {\n\t// Minus 1 from attemptNumber because the first attempt does not count as a retry\n\tconst retriesLeft = options.retries - (attemptNumber - 1);\n\n\terror.attemptNumber = attemptNumber;\n\terror.retriesLeft = retriesLeft;\n\treturn error;\n};\n\nexport default async function pRetry(input, options) {\n\treturn new Promise((resolve, reject) => {\n\t\toptions = {...options};\n\t\toptions.onFailedAttempt ??= () => {};\n\t\toptions.shouldRetry ??= () => true;\n\t\toptions.retries ??= 10;\n\n\t\tconst operation = retry.operation(options);\n\n\t\tconst abortHandler = () => {\n\t\t\toperation.stop();\n\t\t\treject(options.signal?.reason);\n\t\t};\n\n\t\tif (options.signal && !options.signal.aborted) {\n\t\t\toptions.signal.addEventListener('abort', abortHandler, {once: true});\n\t\t}\n\n\t\tconst cleanUp = () => {\n\t\t\toptions.signal?.removeEventListener('abort', abortHandler);\n\t\t\toperation.stop();\n\t\t};\n\n\t\toperation.attempt(async attemptNumber => {\n\t\t\ttry {\n\t\t\t\tconst result = await input(attemptNumber);\n\t\t\t\tcleanUp();\n\t\t\t\tresolve(result);\n\t\t\t} catch (error) {\n\t\t\t\ttry {\n\t\t\t\t\tif (!(error instanceof Error)) {\n\t\t\t\t\t\tthrow new TypeError(`Non-error was thrown: \"${error}\". You should only throw errors.`);\n\t\t\t\t\t}\n\n\t\t\t\t\tif (error instanceof AbortError) {\n\t\t\t\t\t\tthrow error.originalError;\n\t\t\t\t\t}\n\n\t\t\t\t\tif (error instanceof TypeError && !isNetworkError(error)) {\n\t\t\t\t\t\tthrow error;\n\t\t\t\t\t}\n\n\t\t\t\t\tdecorateErrorWithCounts(error, attemptNumber, options);\n\n\t\t\t\t\tif (!(await options.shouldRetry(error))) {\n\t\t\t\t\t\toperation.stop();\n\t\t\t\t\t\treject(error);\n\t\t\t\t\t}\n\n\t\t\t\t\tawait options.onFailedAttempt(error);\n\n\t\t\t\t\tif (!operation.retry(error)) {\n\t\t\t\t\t\tthrow operation.mainError();\n\t\t\t\t\t}\n\t\t\t\t} catch (finalError) {\n\t\t\t\t\tdecorateErrorWithCounts(finalError, attemptNumber, options);\n\t\t\t\t\tcleanUp();\n\t\t\t\t\treject(finalError);\n\t\t\t\t}\n\t\t\t}\n\t\t});\n\t});\n}\n","import { KEEP_ALIVE } from '@libp2p/interface';\nimport { PeerQueue } from '@libp2p/utils/peer-queue';\nimport pRetry from 'p-retry';\nimport { MAX_PARALLEL_RECONNECTS } from './constants.js';\n/**\n * When peers tagged with `KEEP_ALIVE` disconnect, this component attempts to\n * redial them\n */\nexport class ReconnectQueue {\n log;\n queue;\n started;\n peerStore;\n retries;\n retryInterval;\n backoffFactor;\n connectionManager;\n events;\n constructor(components, init = {}) {\n this.log = components.logger.forComponent('libp2p:reconnect-queue');\n this.peerStore = components.peerStore;\n this.connectionManager = components.connectionManager;\n this.queue = new PeerQueue({\n concurrency: init.maxParallelReconnects ?? MAX_PARALLEL_RECONNECTS,\n metricName: 'libp2p_reconnect_queue',\n metrics: components.metrics\n });\n this.started = false;\n this.retries = init.retries ?? 5;\n this.backoffFactor = init.backoffFactor;\n this.retryInterval = init.retryInterval;\n this.events = components.events;\n components.events.addEventListener('peer:disconnect', (evt) => {\n this.maybeReconnect(evt.detail)\n .catch(err => {\n this.log.error('failed to maybe reconnect to %p - %e', evt.detail, err);\n });\n });\n }\n async maybeReconnect(peerId) {\n if (!this.started) {\n return;\n }\n const peer = await this.peerStore.get(peerId);\n if (!hasKeepAliveTag(peer)) {\n return;\n }\n if (this.queue.has(peerId)) {\n return;\n }\n this.queue.add(async (options) => {\n await pRetry(async (attempt) => {\n if (!this.started) {\n return;\n }\n try {\n await this.connectionManager.openConnection(peerId, {\n signal: options?.signal\n });\n }\n catch (err) {\n this.log('reconnecting to %p attempt %d of %d failed - %e', peerId, attempt, this.retries, err);\n throw err;\n }\n }, {\n signal: options?.signal,\n retries: this.retries,\n factor: this.backoffFactor,\n minTimeout: this.retryInterval\n });\n }, {\n peerId\n })\n .catch(async (err) => {\n this.log.error('failed to reconnect to %p - %e', peerId, err);\n const tags = {};\n [...peer.tags.keys()].forEach(key => {\n if (key.startsWith(KEEP_ALIVE)) {\n tags[key] = undefined;\n }\n });\n await this.peerStore.merge(peerId, {\n tags\n });\n this.events.safeDispatchEvent('peer:reconnect-failure', {\n detail: peerId\n });\n })\n .catch(async (err) => {\n this.log.error('failed to remove keep-alive tag from %p - %e', peerId, err);\n });\n }\n start() {\n this.started = true;\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: [\n (peer) => hasKeepAliveTag(peer)\n ]\n });\n await Promise.all(keepAlivePeers.map(async (peer) => {\n await this.connectionManager.openConnection(peer.id)\n .catch(err => {\n this.log.error(err);\n });\n }));\n })\n .catch(err => {\n this.log.error(err);\n });\n }\n stop() {\n this.started = false;\n this.queue.abort();\n }\n}\nfunction hasKeepAliveTag(peer) {\n for (const tag of peer.tags.keys()) {\n if (tag.startsWith(KEEP_ALIVE)) {\n return true;\n }\n }\n return false;\n}\n//# sourceMappingURL=reconnect-queue.js.map","import { ConnectionClosedError, InvalidMultiaddrError, InvalidParametersError, InvalidPeerIdError, NotStartedError, start, stop } from '@libp2p/interface';\nimport { PeerMap } from '@libp2p/peer-collections';\nimport { RateLimiter } from '@libp2p/utils/rate-limiter';\nimport { multiaddr } from '@multiformats/multiaddr';\nimport { dnsaddrResolver } from '@multiformats/multiaddr/resolvers';\nimport { CustomProgressEvent } from 'progress-events';\nimport { getPeerAddress } from '../get-peer.js';\nimport { ConnectionPruner } from './connection-pruner.js';\nimport { DIAL_TIMEOUT, INBOUND_CONNECTION_THRESHOLD, MAX_CONNECTIONS, MAX_DIAL_QUEUE_LENGTH, MAX_INCOMING_PENDING_CONNECTIONS, MAX_PARALLEL_DIALS, MAX_PEER_ADDRS_TO_DIAL } from './constants.js';\nimport { DialQueue } from './dial-queue.js';\nimport { ReconnectQueue } from './reconnect-queue.js';\nexport const DEFAULT_DIAL_PRIORITY = 50;\nconst defaultOptions = {\n maxConnections: MAX_CONNECTIONS,\n inboundConnectionThreshold: INBOUND_CONNECTION_THRESHOLD,\n maxIncomingPendingConnections: MAX_INCOMING_PENDING_CONNECTIONS\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 outboundPendingConnections;\n maxConnections;\n dialQueue;\n reconnectQueue;\n connectionPruner;\n inboundConnectionRateLimiter;\n peerStore;\n metrics;\n events;\n log;\n peerId;\n constructor(components, init = {}) {\n this.maxConnections = init.maxConnections ?? defaultOptions.maxConnections;\n if (this.maxConnections < 1) {\n throw new InvalidParametersError('Connection Manager maxConnections must be greater than 0');\n }\n /**\n * Map of connections per peer\n */\n this.connections = new PeerMap();\n this.started = false;\n this.peerId = components.peerId;\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 // 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 this.outboundPendingConnections = 0;\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 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,\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 this.reconnectQueue = new ReconnectQueue({\n events: components.events,\n peerStore: components.peerStore,\n logger: components.logger,\n connectionManager: this\n }, {\n retries: init.reconnectRetries,\n retryInterval: init.reconnectRetryInterval,\n backoffFactor: init.reconnectBackoffFactor,\n maxParallelReconnects: init.maxParallelReconnects\n });\n }\n [Symbol.toStringTag] = '@libp2p/connection-manager';\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 'inbound pending': this.incomingPendingConnections,\n outbound: 0,\n 'outbound pending': this.outboundPendingConnections\n };\n for (const conns of this.connections.values()) {\n for (const conn of conns) {\n metric[conn.direction]++;\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.events.addEventListener('connection:open', this.onConnect);\n this.events.addEventListener('connection:close', this.onDisconnect);\n await start(this.dialQueue, this.reconnectQueue, this.connectionPruner);\n this.started = true;\n this.log('started');\n }\n /**\n * Stops the Connection Manager\n */\n async stop() {\n this.events.removeEventListener('connection:open', this.onConnect);\n this.events.removeEventListener('connection:close', this.onDisconnect);\n await stop(this.reconnectQueue, this.dialQueue, this.connectionPruner);\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 if (connection.status !== 'open') {\n // this can happen when the remote closes the connection immediately after\n // opening\n return;\n }\n const peerId = connection.remotePeer;\n const isNewPeer = !this.connections.has(peerId);\n const storedConns = this.connections.get(peerId) ?? [];\n storedConns.push(connection);\n this.connections.set(peerId, storedConns);\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 const peerId = connection.remotePeer;\n const peerConns = this.connections.get(peerId) ?? [];\n // remove closed connection\n const filteredPeerConns = peerConns.filter(conn => conn.id !== connection.id);\n // update peer connections\n this.connections.set(peerId, filteredPeerConns);\n if (filteredPeerConns.length === 0) {\n // trigger disconnect event if no connections remain\n this.log('onDisconnect remove all connections for peer %p', peerId);\n this.connections.delete(peerId);\n // broadcast disconnect event\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.started) {\n throw new NotStartedError('Not started');\n }\n this.outboundPendingConnections++;\n try {\n options.signal?.throwIfAborted();\n const { peerId } = getPeerAddress(peerIdOrMultiaddr);\n if (this.peerId.equals(peerId)) {\n throw new InvalidPeerIdError('Can not dial self');\n }\n if (peerId != null && options.force !== true) {\n this.log('dial %p', peerId);\n const existingConnection = this.getConnections(peerId)\n .find(conn => conn.limits == null);\n if (existingConnection != null) {\n this.log('had an existing non-limited 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 if (connection.status !== 'open') {\n throw new ConnectionClosedError('Remote closed connection during opening');\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 // make sure we don't already have a connection to this multiaddr\n if (options.force !== true && conn.id !== connection.id && conn.remoteAddr.equals(connection.remoteAddr)) {\n connection.abort(new InvalidMultiaddrError('Duplicate multiaddr connection'));\n // return the existing connection\n return conn;\n }\n }\n if (!trackedConnection) {\n peerConnections.push(connection);\n }\n return connection;\n }\n finally {\n this.outboundPendingConnections--;\n }\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","/**\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, setMaxListeners } 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;\nconst DEFAULT_ABORT_CONNECTION_ON_PING_FAILURE = true;\nexport class ConnectionMonitor {\n protocol;\n components;\n log;\n heartbeatInterval;\n pingIntervalMs;\n abortController;\n timeout;\n abortConnectionOnPingFailure;\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.abortConnectionOnPingFailure = init.abortConnectionOnPingFailure ?? DEFAULT_ABORT_CONNECTION_ON_PING_FAILURE;\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 setMaxListeners(Infinity, this.abortController.signal);\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 runOnLimitedConnection: 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.name !== 'UnsupportedProtocolError') {\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', err);\n if (this.abortConnectionOnPingFailure) {\n this.log.error('aborting connection due to ping failure');\n conn.abort(err);\n }\n else {\n this.log('connection ping failed, but not aborting due to abortConnectionOnPingFailure flag');\n }\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 { NotStartedError } from '@libp2p/interface';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport merge from 'it-merge';\nimport { NoContentRoutersError } 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 NoContentRoutersError('No content 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 NoContentRoutersError('No content 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 NotStartedError();\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 NotStartedError();\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 { fromString as uint8ArrayFromString } from 'uint8arrays/from-string';\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 ?? false;\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 { NotFoundError } from '@libp2p/interface';\nimport { createScalableCuckooFilter } from '@libp2p/utils/filters';\nimport merge from 'it-merge';\nimport parallel from 'it-parallel';\nimport { NoPeerRoutersError, QueriedForSelfError } 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 NoPeerRoutersError('No peer routers available');\n }\n if (id.toString() === this.peerId.toString()) {\n throw new QueriedForSelfError('Should not try to 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 NotFoundError();\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 NoPeerRoutersError('No peer 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.toMultihash().bytes)) {\n continue;\n }\n seen.add(peer.id.toMultihash().bytes);\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 { InvalidParametersError } from '@libp2p/interface';\nimport merge from 'merge-options';\nimport * as errorsJs 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 errorsJs.UnhandledProtocolError(`No handler registered for protocol ${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 errorsJs.DuplicateProtocolHandlerError(`Handler already registered for protocol ${protocol}`);\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 InvalidParametersError('invalid topology');\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.name === 'NotFoundError') {\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.limits != null && topology.notifyOnLimitedConnection !== 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 { FaultTolerance, InvalidParametersError, NotStartedError } from '@libp2p/interface';\nimport { trackedMap } from '@libp2p/utils/tracked-map';\nimport { CustomProgressEvent } from 'progress-events';\nimport { NoValidAddressesError, TransportUnavailableError } 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 InvalidParametersError('Transport must have a valid tag');\n }\n if (this.transports.has(tag)) {\n throw new InvalidParametersError(`There is already a transport with the tag ${tag}`);\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 TransportUnavailableError(`No transport available for address ${String(ma)}`);\n }\n options?.onProgress?.(new CustomProgressEvent('transport-manager:selected-transport', transport[Symbol.toStringTag]));\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 transport.dial(ma, {\n ...options,\n upgrader: this.components.upgrader\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 NotStartedError('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 NoValidAddressesError(`Transport (${key}) could not listen on any available address`);\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 NoValidAddressesError(message);\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","// 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;\n//# sourceMappingURL=constants.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","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 { MAX_DATA_LENGTH } from './constants.js';\nimport { InvalidDataLengthError } from './errors.js';\nimport { isAsyncIterable } from './utils.js';\n// Helper function to validate the chunk size against maxDataLength\nfunction validateMaxDataLength(chunk, maxDataLength) {\n if (chunk.byteLength > maxDataLength) {\n throw new InvalidDataLengthError('Message length too long');\n }\n}\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 const maxDataLength = options?.maxDataLength ?? MAX_DATA_LENGTH;\n function* maybeYield(chunk) {\n validateMaxDataLength(chunk, maxDataLength);\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 const maxDataLength = options?.maxDataLength ?? MAX_DATA_LENGTH;\n validateMaxDataLength(chunk, maxDataLength);\n return new Uint8ArrayList(encodeLength(chunk.byteLength), chunk);\n};\n//# sourceMappingURL=encode.js.map","/* eslint max-depth: [\"error\", 6] */\nimport * as varint from 'uint8-varint';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { MAX_DATA_LENGTH, MAX_LENGTH_LENGTH } from './constants.js';\nimport { InvalidDataLengthError, InvalidDataLengthLengthError, InvalidMessageLengthError, UnexpectedEOFError } from './errors.js';\nimport { isAsyncIterable } from './utils.js';\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","/**\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 error;\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 this.error = err;\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 this.ended = true;\n this.nextResult = result;\n // let the consumer know we have a new value\n this.haveNext.resolve();\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 this.error ?? 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 * 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({\n ...options,\n bytes: 1\n }));\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({\n ...options,\n bytes: dataLength\n });\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","/**\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 { raceSignal } from 'race-signal';\nimport { Uint8ArrayList } from 'uint8arraylist';\nimport { UnexpectedEOFError } from './errors.js';\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 (options) => {\n options?.signal?.throwIfAborted();\n if (options?.bytes == null) {\n // just read whatever arrives\n const { done, value } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n return null;\n }\n return value;\n }\n while (readBuffer.byteLength < options.bytes) {\n const { value, done } = await raceSignal(source.next(), options?.signal);\n if (done === true) {\n throw new UnexpectedEOFError('unexpected end of input');\n }\n readBuffer.append(value);\n }\n const buf = readBuffer.sublist(0, options.bytes);\n readBuffer.consume(options.bytes);\n return buf;\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","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 { InvalidMessageError } 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 InvalidMessageError('Missing newline');\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.trace('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 { UnsupportedProtocolError } 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 implementations\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 UnsupportedProtocolError('protocol selection failed');\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 UnsupportedProtocolError('protocol selection failed');\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=connection.js.map","import { connectionSymbol, setMaxListeners, LimitedConnectionError, ConnectionClosedError, ConnectionClosingError } 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 limits;\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.limits = init.limits;\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 ConnectionClosingError('the connection is being closed');\n }\n if (this.status === 'closed') {\n throw new ConnectionClosedError('the connection is closed');\n }\n if (!Array.isArray(protocols)) {\n protocols = [protocols];\n }\n if (this.limits != null && options?.runOnLimitedConnection !== true) {\n throw new LimitedConnectionError('Cannot open protocol stream on limited 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 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 if (this.status === 'closed') {\n return;\n }\n this.log.error('aborting connection to %a due to error', this.remoteAddr, err);\n this.status = 'closing';\n // Abort raw connection\n this._abort(err);\n this.status = 'closed';\n this.timeline.close = Date.now();\n }\n}\nexport function createConnection(init) {\n return new ConnectionImpl(init);\n}\n//# sourceMappingURL=index.js.map","import { InvalidMultiaddrError, TooManyInboundProtocolStreamsError, TooManyOutboundProtocolStreamsError, LimitedConnectionError, setMaxListeners, InvalidPeerIdError } from '@libp2p/interface';\nimport * as mss from '@libp2p/multistream-select';\nimport { peerIdFromString } from '@libp2p/peer-id';\nimport { anySignal } from 'any-signal';\nimport { CustomProgressEvent } from 'progress-events';\nimport { createConnection } from './connection/index.js';\nimport { PROTOCOL_NEGOTIATION_TIMEOUT, UPGRADE_TIMEOUT } from './connection-manager/constants.js';\nimport { ConnectionDeniedError, ConnectionInterceptedError, EncryptionFailedError, MuxerUnavailableError } from './errors.js';\nimport { DEFAULT_MAX_INBOUND_STREAMS, DEFAULT_MAX_OUTBOUND_STREAMS } from './registrar.js';\nfunction findIncomingStreamLimit(protocol, registrar) {\n try {\n const { options } = registrar.getHandler(protocol);\n return options.maxInboundStreams;\n }\n catch (err) {\n if (err.name !== 'UnhandledProtocolError') {\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.name !== 'UnhandledProtocolError') {\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 connectionEncrypters;\n streamMuxers;\n inboundUpgradeTimeout;\n outboundUpgradeTimeout;\n inboundStreamProtocolNegotiationTimeout;\n outboundStreamProtocolNegotiationTimeout;\n events;\n metrics;\n constructor(components, init) {\n this.components = components;\n this.connectionEncrypters = new Map();\n init.connectionEncrypters.forEach(encrypter => {\n this.connectionEncrypters.set(encrypter.protocol, encrypter);\n });\n this.streamMuxers = new Map();\n init.streamMuxers.forEach(muxer => {\n this.streamMuxers.set(muxer.protocol, muxer);\n });\n this.inboundUpgradeTimeout = init.inboundUpgradeTimeout ?? UPGRADE_TIMEOUT;\n this.outboundUpgradeTimeout = init.outboundUpgradeTimeout ?? UPGRADE_TIMEOUT;\n this.inboundStreamProtocolNegotiationTimeout = init.inboundStreamProtocolNegotiationTimeout ?? PROTOCOL_NEGOTIATION_TIMEOUT;\n this.outboundStreamProtocolNegotiationTimeout = init.outboundStreamProtocolNegotiationTimeout ?? PROTOCOL_NEGOTIATION_TIMEOUT;\n this.events = components.events;\n this.metrics = {\n dials: components.metrics?.registerCounterGroup('libp2p_connection_manager_dials_total'),\n errors: components.metrics?.registerCounterGroup('libp2p_connection_manager_dial_errors_total')\n };\n }\n [Symbol.toStringTag] = '@libp2p/upgrader';\n async shouldBlockConnection(method, ...args) {\n const denyOperation = this.components.connectionGater[method];\n if (denyOperation == null) {\n return;\n }\n const result = await denyOperation.apply(this.components.connectionGater, args);\n if (result === true) {\n throw new ConnectionInterceptedError(`The multiaddr connection is blocked by gater.${method}`);\n }\n }\n /**\n * Upgrades an inbound connection\n */\n async upgradeInbound(maConn, opts = {}) {\n try {\n this.metrics.dials?.increment({\n inbound: true\n });\n const accept = await this.components.connectionManager.acceptIncomingConnection(maConn);\n if (!accept) {\n throw new ConnectionDeniedError('connection denied');\n }\n await this.shouldBlockConnection('denyInboundConnection', maConn);\n const conn = await this._performUpgrade(maConn, 'inbound', opts);\n return conn;\n }\n catch (err) {\n this.metrics.errors?.increment({\n inbound: true\n });\n throw err;\n }\n finally {\n this.components.connectionManager.afterUpgradeInbound();\n }\n }\n /**\n * Upgrades an outbound connection\n */\n async upgradeOutbound(maConn, opts = {}) {\n try {\n this.metrics.dials?.increment({\n outbound: true\n });\n const idStr = maConn.remoteAddr.getPeerId();\n let remotePeerId;\n if (idStr != null) {\n remotePeerId = peerIdFromString(idStr);\n await this.shouldBlockConnection('denyOutboundConnection', remotePeerId, maConn);\n }\n return await this._performUpgrade(maConn, 'outbound', opts);\n }\n catch (err) {\n this.metrics.errors?.increment({\n outbound: true\n });\n throw err;\n }\n }\n async _performUpgrade(maConn, direction, opts) {\n let encryptedConn;\n let remotePeer;\n let upgradedConn;\n let muxerFactory;\n let cryptoProtocol;\n const upgradeTimeoutSignal = AbortSignal.timeout(direction === 'inbound' ? this.inboundUpgradeTimeout : this.outboundUpgradeTimeout);\n const signal = anySignal([upgradeTimeoutSignal, opts.signal]);\n setMaxListeners(Infinity, upgradeTimeoutSignal, signal);\n opts.signal = signal;\n this.components.metrics?.trackMultiaddrConnection(maConn);\n maConn.log.trace('starting the %s connection upgrade', direction);\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 %s connection', direction);\n protectedConn = await protector.protect(maConn, opts);\n }\n }\n try {\n // Encrypt the connection\n encryptedConn = protectedConn;\n if (opts?.skipEncryption !== true) {\n opts?.onProgress?.(new CustomProgressEvent(`upgrader:encrypt-${direction}-connection`));\n ({\n conn: encryptedConn,\n remotePeer,\n protocol: cryptoProtocol\n } = await (direction === 'inbound'\n ? this._encryptInbound(protectedConn, {\n ...opts,\n signal\n })\n : this._encryptOutbound(protectedConn, {\n ...opts,\n signal\n })));\n const maConn = {\n ...protectedConn,\n ...encryptedConn\n };\n await this.shouldBlockConnection(direction === 'inbound' ? 'denyInboundEncryptedConnection' : 'denyOutboundEncryptedConnection', remotePeer, maConn);\n }\n else {\n const idStr = maConn.remoteAddr.getPeerId();\n if (idStr == null) {\n throw new InvalidMultiaddrError(`${direction} connection that skipped encryption must have a peer id`);\n }\n const remotePeerId = peerIdFromString(idStr);\n cryptoProtocol = 'native';\n remotePeer = remotePeerId;\n }\n // this can happen if we dial a multiaddr without a peer id, we only find\n // out the identity of the remote after the connection is encrypted\n if (remotePeer.equals(this.components.peerId)) {\n const err = new InvalidPeerIdError('Can not dial self');\n maConn.abort(err);\n throw err;\n }\n upgradedConn = encryptedConn;\n if (opts?.muxerFactory != null) {\n muxerFactory = opts.muxerFactory;\n }\n else if (this.streamMuxers.size > 0) {\n opts?.onProgress?.(new CustomProgressEvent(`upgrader:multiplex-${direction}-connection`));\n // Multiplex the connection\n const multiplexed = await (direction === 'inbound'\n ? this._multiplexInbound({\n ...protectedConn,\n ...encryptedConn\n }, this.streamMuxers, opts)\n : this._multiplexOutbound({\n ...protectedConn,\n ...encryptedConn\n }, this.streamMuxers, opts));\n muxerFactory = multiplexed.muxerFactory;\n upgradedConn = multiplexed.stream;\n }\n }\n catch (err) {\n maConn.log.error('failed to upgrade inbound connection %s %a - %e', direction === 'inbound' ? 'from' : 'to', maConn.remoteAddr, err);\n throw err;\n }\n finally {\n signal.clear();\n }\n await this.shouldBlockConnection(direction === 'inbound' ? 'denyInboundUpgradedConnection' : 'denyOutboundUpgradedConnection', remotePeer, maConn);\n maConn.log('successfully upgraded %s connection', direction);\n return this._createConnection({\n cryptoProtocol,\n direction,\n maConn,\n upgradedConn,\n muxerFactory,\n remotePeer,\n limits: opts?.limits\n });\n }\n /**\n * A convenience method for generating a new `Connection`\n */\n _createConnection(opts) {\n const { cryptoProtocol, direction, maConn, upgradedConn, remotePeer, muxerFactory, limits } = 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 signal = AbortSignal.timeout(this.inboundStreamProtocolNegotiationTimeout);\n setMaxListeners(Infinity, signal);\n const { stream, protocol } = await mss.handle(muxedStream, protocols, {\n signal,\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 TooManyInboundProtocolStreamsError(`Too many inbound protocol streams for protocol \"${protocol}\" - limit ${incomingLimit}`);\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 - %e', muxedStream.id, err);\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 MuxerUnavailableError('Connection is not multiplexed');\n }\n connection.log.trace('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(this.outboundStreamProtocolNegotiationTimeout);\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.trace('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 TooManyOutboundProtocolStreamsError(`Too many outbound protocol streams for protocol \"${protocol}\" - ${streamCount}/${outgoingLimit}`);\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 outbound stream on connection %s %a for protocols %s - %e', direction === 'inbound' ? 'from' : 'to', opts.maConn.remoteAddr, protocols, err);\n if (muxedStream.timeline.close == null) {\n muxedStream.abort(err);\n }\n throw err;\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 - %e', err);\n });\n }\n const _timeline = maConn.timeline;\n maConn.timeline = new Proxy(_timeline, {\n set: (...args) => {\n if (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 %e', 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 %e', err);\n });\n }\n return Reflect.set(...args);\n }\n });\n maConn.timeline.upgraded = Date.now();\n const errConnectionNotMultiplexed = () => {\n throw new MuxerUnavailableError('Connection is 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 limits,\n logger: this.components.logger,\n newStream: newStream ?? errConnectionNotMultiplexed,\n getStreams: () => {\n return muxer?.streams ?? [];\n },\n close: async (options) => {\n // ensure remaining streams are closed gracefully\n await muxer?.close(options);\n // close the underlying transport\n await maConn.close(options);\n },\n abort: (err) => {\n maConn.abort(err);\n // ensure remaining streams are aborted\n muxer?.abort(err);\n }\n });\n this.events.safeDispatchEvent('connection:open', {\n detail: connection\n });\n // @ts-expect-error nah\n connection.__maConnTimeline = _timeline;\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.limits != null && options.runOnLimitedConnection !== true) {\n throw new LimitedConnectionError('Cannot open protocol stream on limited connection');\n }\n handler({ connection, stream });\n }\n /**\n * Attempts to encrypt the incoming `connection` with the provided `cryptos`\n */\n async _encryptInbound(connection, options) {\n const protocols = Array.from(this.connectionEncrypters.keys());\n try {\n const { stream, protocol } = await mss.handle(connection, protocols, {\n ...options,\n log: connection.log\n });\n const encrypter = this.connectionEncrypters.get(protocol);\n if (encrypter == null) {\n throw new EncryptionFailedError(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting inbound connection to %a using %s', connection.remoteAddr, protocol);\n return {\n ...await encrypter.secureInbound(stream, options),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting inbound connection from %a failed', connection.remoteAddr, err);\n throw new EncryptionFailedError(err.message);\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, options) {\n const protocols = Array.from(this.connectionEncrypters.keys());\n try {\n connection.log.trace('selecting encrypter from %s', protocols);\n const { stream, protocol } = await mss.select(connection, protocols, {\n ...options,\n log: connection.log,\n yieldBytes: true\n });\n const encrypter = this.connectionEncrypters.get(protocol);\n if (encrypter == null) {\n throw new EncryptionFailedError(`no crypto module found for ${protocol}`);\n }\n connection.log('encrypting outbound connection to %a using %s', connection.remoteAddr, protocol);\n return {\n ...await encrypter.secureOutbound(stream, options),\n protocol\n };\n }\n catch (err) {\n connection.log.error('encrypting outbound connection to %a failed', connection.remoteAddr, err);\n throw new EncryptionFailedError(err.message);\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, options) {\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 ...options,\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 MuxerUnavailableError(String(err));\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, options) {\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 ...options,\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 MuxerUnavailableError(String(err));\n }\n }\n}\n//# sourceMappingURL=upgrader.js.map","import { publicKeyFromProtobuf } from '@libp2p/crypto/keys';\nimport { contentRoutingSymbol, TypedEventEmitter, setMaxListeners, peerDiscoverySymbol, peerRoutingSymbol, InvalidParametersError } from '@libp2p/interface';\nimport { defaultLogger } from '@libp2p/logger';\nimport { PeerSet } from '@libp2p/peer-collections';\nimport { peerIdFromString } from '@libp2p/peer-id';\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 { DefaultConnectionManager } from './connection-manager/index.js';\nimport { ConnectionMonitor } from './connection-monitor.js';\nimport { CompoundContentRouting } from './content-routing.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 Libp2p 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', 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 connectionEncrypters: (init.connectionEncrypters ?? []).map((fn, index) => this.configureComponent(`connection-encryption-${index}`, fn(this.components))),\n streamMuxers: (init.streamMuxers ?? []).map((fn, index) => this.configureComponent(`stream-muxers-${index}`, fn(this.components))),\n inboundUpgradeTimeout: init.connectionManager?.inboundUpgradeTimeout,\n outboundUpgradeTimeout: init.connectionManager?.outboundUpgradeTimeout\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 InvalidParametersError('no protocols were provided to open a stream');\n }\n protocols = Array.isArray(protocols) ? protocols : [protocols];\n if (protocols.length === 0) {\n throw new InvalidParametersError('no protocols were provided to open a 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 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.name !== 'NotFoundError') {\n throw err;\n }\n }\n const peerKey = uint8ArrayConcat([\n uint8ArrayFromString('/pk/'),\n peer.toMultihash().bytes\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 const publicKey = publicKeyFromProtobuf(bytes);\n await this.peerStore.patch(peer, {\n publicKey\n });\n return publicKey;\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('peer discovery mechanism 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//# sourceMappingURL=libp2p.js.map","export const version = '2.1.8';\nexport const name = 'libp2p';\n//# sourceMappingURL=version.js.map","export function isTestEnvironment() {\n try {\n return process?.env?.NODE_ENV === \"test\";\n }\n catch (_e) {\n // process variable is not defined in PROD environment\n return false;\n }\n}\n//# sourceMappingURL=env.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 = isBytes(hex);\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 = isBytes(hex);\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 isBytes(a) {\n return a instanceof Uint8Array || (ArrayBuffer.isView(a) && a.constructor.name === 'Uint8Array');\n}\nfunction abytes(item) {\n if (!isBytes(item))\n throw new Error('Uint8Array expected');\n}\nfunction concatBytes(...arrays) {\n arrays.every(abytes);\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 }, (_, i) => i.toString(16).padStart(2, '0'));\nexport function bytesToHex(bytes) {\n abytes(bytes);\n let hex = '';\n for (let i = 0; i < bytes.length; i++) {\n hex += hexes[bytes[i]];\n }\n return hex;\n}\nconst asciis = { _0: 48, _9: 57, A: 65, F: 70, a: 97, f: 102 };\nfunction asciiToBase16(ch) {\n if (ch >= asciis._0 && ch <= asciis._9)\n return ch - asciis._0;\n if (ch >= asciis.A && ch <= asciis.F)\n return ch - (asciis.A - 10);\n if (ch >= asciis.a && ch <= asciis.f)\n return ch - (asciis.a - 10);\n return;\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('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}\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 bytesToNumber(bytes) {\n return hexToNumber(bytesToHex(bytes));\n}\nfunction ensureBytes(hex) {\n return isBytes(hex) ? 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 (isBytes(key)) {\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 = 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 === 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 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 = 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 { publicKeyFromRaw } from \"@libp2p/crypto/keys\";\nimport { peerIdFromPublicKey } from \"@libp2p/peer-id\";\nexport const ERR_TYPE_NOT_IMPLEMENTED = \"Keypair type not implemented\";\nexport function createPeerIdFromPublicKey(publicKey) {\n const pubKey = publicKeyFromRaw(publicKey);\n if (pubKey.type !== \"secp256k1\") {\n throw new Error(ERR_TYPE_NOT_IMPLEMENTED);\n }\n return peerIdFromPublicKey(pubKey);\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.8.0\";\n//# sourceMappingURL=_version.js.map","export const version = \"bytes/5.8.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.8.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 = 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","export default class QuickLRU extends Map {\n\t#size = 0;\n\t#cache = new Map();\n\t#oldCache = new Map();\n\t#maxSize;\n\t#maxAge;\n\t#onEviction;\n\n\tconstructor(options = {}) {\n\t\tsuper();\n\n\t\tif (!(options.maxSize && options.maxSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tif (typeof options.maxAge === 'number' && options.maxAge === 0) {\n\t\t\tthrow new TypeError('`maxAge` must be a number greater than 0');\n\t\t}\n\n\t\tthis.#maxSize = options.maxSize;\n\t\tthis.#maxAge = options.maxAge || Number.POSITIVE_INFINITY;\n\t\tthis.#onEviction = options.onEviction;\n\t}\n\n\t// For tests.\n\tget __oldCache() {\n\t\treturn this.#oldCache;\n\t}\n\n\t#emitEvictions(cache) {\n\t\tif (typeof this.#onEviction !== 'function') {\n\t\t\treturn;\n\t\t}\n\n\t\tfor (const [key, item] of cache) {\n\t\t\tthis.#onEviction(key, item.value);\n\t\t}\n\t}\n\n\t#deleteIfExpired(key, item) {\n\t\tif (typeof item.expiry === 'number' && item.expiry <= Date.now()) {\n\t\t\tif (typeof this.#onEviction === 'function') {\n\t\t\t\tthis.#onEviction(key, item.value);\n\t\t\t}\n\n\t\t\treturn this.delete(key);\n\t\t}\n\n\t\treturn false;\n\t}\n\n\t#getOrDeleteIfExpired(key, item) {\n\t\tconst deleted = this.#deleteIfExpired(key, item);\n\t\tif (deleted === false) {\n\t\t\treturn item.value;\n\t\t}\n\t}\n\n\t#getItemValue(key, item) {\n\t\treturn item.expiry ? this.#getOrDeleteIfExpired(key, item) : item.value;\n\t}\n\n\t#peek(key, cache) {\n\t\tconst item = cache.get(key);\n\n\t\treturn this.#getItemValue(key, item);\n\t}\n\n\t#set(key, value) {\n\t\tthis.#cache.set(key, value);\n\t\tthis.#size++;\n\n\t\tif (this.#size >= this.#maxSize) {\n\t\t\tthis.#size = 0;\n\t\t\tthis.#emitEvictions(this.#oldCache);\n\t\t\tthis.#oldCache = this.#cache;\n\t\t\tthis.#cache = new Map();\n\t\t}\n\t}\n\n\t#moveToRecent(key, item) {\n\t\tthis.#oldCache.delete(key);\n\t\tthis.#set(key, item);\n\t}\n\n\t* #entriesAscending() {\n\t\tfor (const item of this.#oldCache) {\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield item;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tfor (const item of this.#cache) {\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield item;\n\t\t\t}\n\t\t}\n\t}\n\n\tget(key) {\n\t\tif (this.#cache.has(key)) {\n\t\t\tconst item = this.#cache.get(key);\n\t\t\treturn this.#getItemValue(key, item);\n\t\t}\n\n\t\tif (this.#oldCache.has(key)) {\n\t\t\tconst item = this.#oldCache.get(key);\n\t\t\tif (this.#deleteIfExpired(key, item) === false) {\n\t\t\t\tthis.#moveToRecent(key, item);\n\t\t\t\treturn item.value;\n\t\t\t}\n\t\t}\n\t}\n\n\tset(key, value, {maxAge = this.#maxAge} = {}) {\n\t\tconst expiry = typeof maxAge === 'number' && maxAge !== Number.POSITIVE_INFINITY\n\t\t\t? (Date.now() + maxAge)\n\t\t\t: undefined;\n\n\t\tif (this.#cache.has(key)) {\n\t\t\tthis.#cache.set(key, {\n\t\t\t\tvalue,\n\t\t\t\texpiry,\n\t\t\t});\n\t\t} else {\n\t\t\tthis.#set(key, {value, expiry});\n\t\t}\n\n\t\treturn this;\n\t}\n\n\thas(key) {\n\t\tif (this.#cache.has(key)) {\n\t\t\treturn !this.#deleteIfExpired(key, this.#cache.get(key));\n\t\t}\n\n\t\tif (this.#oldCache.has(key)) {\n\t\t\treturn !this.#deleteIfExpired(key, this.#oldCache.get(key));\n\t\t}\n\n\t\treturn false;\n\t}\n\n\tpeek(key) {\n\t\tif (this.#cache.has(key)) {\n\t\t\treturn this.#peek(key, this.#cache);\n\t\t}\n\n\t\tif (this.#oldCache.has(key)) {\n\t\t\treturn this.#peek(key, this.#oldCache);\n\t\t}\n\t}\n\n\tdelete(key) {\n\t\tconst deleted = this.#cache.delete(key);\n\t\tif (deleted) {\n\t\t\tthis.#size--;\n\t\t}\n\n\t\treturn this.#oldCache.delete(key) || deleted;\n\t}\n\n\tclear() {\n\t\tthis.#cache.clear();\n\t\tthis.#oldCache.clear();\n\t\tthis.#size = 0;\n\t}\n\n\tresize(newSize) {\n\t\tif (!(newSize && newSize > 0)) {\n\t\t\tthrow new TypeError('`maxSize` must be a number greater than 0');\n\t\t}\n\n\t\tconst items = [...this.#entriesAscending()];\n\t\tconst removeCount = items.length - newSize;\n\t\tif (removeCount < 0) {\n\t\t\tthis.#cache = new Map(items);\n\t\t\tthis.#oldCache = new Map();\n\t\t\tthis.#size = items.length;\n\t\t} else {\n\t\t\tif (removeCount > 0) {\n\t\t\t\tthis.#emitEvictions(items.slice(0, removeCount));\n\t\t\t}\n\n\t\t\tthis.#oldCache = new Map(items.slice(removeCount));\n\t\t\tthis.#cache = new Map();\n\t\t\tthis.#size = 0;\n\t\t}\n\n\t\tthis.#maxSize = newSize;\n\t}\n\n\t* keys() {\n\t\tfor (const [key] of this) {\n\t\t\tyield key;\n\t\t}\n\t}\n\n\t* values() {\n\t\tfor (const [, value] of this) {\n\t\t\tyield value;\n\t\t}\n\t}\n\n\t* [Symbol.iterator]() {\n\t\tfor (const item of this.#cache) {\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield [key, value.value];\n\t\t\t}\n\t\t}\n\n\t\tfor (const item of this.#oldCache) {\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield [key, value.value];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t* entriesDescending() {\n\t\tlet items = [...this.#cache];\n\t\tfor (let i = items.length - 1; i >= 0; --i) {\n\t\t\tconst item = items[i];\n\t\t\tconst [key, value] = item;\n\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\tif (deleted === false) {\n\t\t\t\tyield [key, value.value];\n\t\t\t}\n\t\t}\n\n\t\titems = [...this.#oldCache];\n\t\tfor (let i = items.length - 1; i >= 0; --i) {\n\t\t\tconst item = items[i];\n\t\t\tconst [key, value] = item;\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\tconst deleted = this.#deleteIfExpired(key, value);\n\t\t\t\tif (deleted === false) {\n\t\t\t\t\tyield [key, value.value];\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t}\n\n\t* entriesAscending() {\n\t\tfor (const [key, value] of this.#entriesAscending()) {\n\t\t\tyield [key, value.value];\n\t\t}\n\t}\n\n\tget size() {\n\t\tif (!this.#size) {\n\t\t\treturn this.#oldCache.size;\n\t\t}\n\n\t\tlet oldCacheSize = 0;\n\t\tfor (const key of this.#oldCache.keys()) {\n\t\t\tif (!this.#cache.has(key)) {\n\t\t\t\toldCacheSize++;\n\t\t\t}\n\t\t}\n\n\t\treturn Math.min(this.#size + oldCacheSize, this.#maxSize);\n\t}\n\n\tget maxSize() {\n\t\treturn this.#maxSize;\n\t}\n\n\tentries() {\n\t\treturn this.entriesAscending();\n\t}\n\n\tforEach(callbackFunction, thisArgument = this) {\n\t\tfor (const [key, value] of this.entriesAscending()) {\n\t\t\tcallbackFunction.call(thisArgument, value, key, this);\n\t\t}\n\t}\n\n\tget [Symbol.toStringTag]() {\n\t\treturn 'QuickLRU';\n\t}\n\n\ttoString() {\n\t\treturn `QuickLRU(${this.size}/${this.maxSize})`;\n\t}\n\n\t[Symbol.for('nodejs.util.inspect.custom')]() {\n\t\treturn this.toString();\n\t}\n}\n","/**\n * Build fetch resource for request\n */\nexport function buildResource(serverResolver, hostname, recordType) {\n return `${serverResolver}?name=${hostname}&type=${recordType}`;\n}\n/**\n * Use fetch to find the record\n */\nexport async function request(resource, signal) {\n const req = await fetch(resource, {\n headers: new Headers({\n accept: 'application/dns-json'\n }),\n signal\n });\n const res = await req.json();\n return res;\n}\n/**\n * Creates cache key composed by recordType and hostname\n *\n * @param {string} hostname\n * @param {string} recordType\n */\nexport function getCacheKey(hostname, recordType) {\n return `${recordType}_${hostname}`;\n}\n//# sourceMappingURL=utils.js.map","import QuickLRU from 'quick-lru';\nimport debug from 'weald';\nimport * as utils from './utils.js';\nconst log = Object.assign(debug('dns-over-http-resolver'), {\n error: debug('dns-over-http-resolver:error')\n});\n/**\n * DNS over HTTP resolver.\n * Uses a list of servers to resolve DNS records with HTTP requests.\n */\nclass Resolver {\n _cache;\n _TXTcache;\n _servers;\n _request;\n _abortControllers;\n /**\n * @class\n * @param {object} [options]\n * @param {number} [options.maxCache = 100] - maximum number of cached dns records\n * @param {Request} [options.request] - function to return DNSJSON\n */\n constructor(options = {}) {\n this._cache = new QuickLRU({ maxSize: options?.maxCache ?? 100 });\n this._TXTcache = new QuickLRU({ maxSize: options?.maxCache ?? 100 });\n this._servers = [\n 'https://cloudflare-dns.com/dns-query',\n 'https://dns.google/resolve'\n ];\n this._request = options.request ?? utils.request;\n this._abortControllers = [];\n }\n /**\n * Cancel all outstanding DNS queries made by this resolver. Any outstanding\n * requests will be aborted and promises rejected.\n */\n cancel() {\n this._abortControllers.forEach(controller => { controller.abort(); });\n }\n /**\n * Get an array of the IP addresses currently configured for DNS resolution.\n * These addresses are formatted according to RFC 5952. It can include a custom port.\n */\n getServers() {\n return this._servers;\n }\n /**\n * Get a shuffled array of the IP addresses currently configured for DNS resolution.\n * These addresses are formatted according to RFC 5952. It can include a custom port.\n */\n _getShuffledServers() {\n const newServers = [...this._servers];\n for (let i = newServers.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * i);\n const temp = newServers[i];\n newServers[i] = newServers[j];\n newServers[j] = temp;\n }\n return newServers;\n }\n /**\n * Sets the IP address and port of servers to be used when performing DNS resolution.\n *\n * @param {string[]} servers - array of RFC 5952 formatted addresses.\n */\n setServers(servers) {\n this._servers = servers;\n }\n async resolve(hostname, rrType = 'A') {\n switch (rrType) {\n case 'A':\n return this.resolve4(hostname);\n case 'AAAA':\n return this.resolve6(hostname);\n case 'TXT':\n return this.resolveTxt(hostname);\n default:\n throw new Error(`${rrType} is not supported`);\n }\n }\n /**\n * Uses the DNS protocol to resolve the given host name into IPv4 addresses\n *\n * @param {string} hostname - host name to resolve\n */\n async resolve4(hostname) {\n const recordType = 'A';\n const cached = this._cache.get(utils.getCacheKey(hostname, recordType));\n if (cached != null) {\n return cached;\n }\n let aborted = false;\n for (const server of this._getShuffledServers()) {\n const controller = new AbortController();\n this._abortControllers.push(controller);\n try {\n const response = await this._request(utils.buildResource(server, hostname, recordType), controller.signal);\n const data = response.Answer.map(a => a.data);\n const ttl = Math.min(...response.Answer.map(a => a.TTL));\n this._cache.set(utils.getCacheKey(hostname, recordType), data, { maxAge: ttl });\n return data;\n }\n catch (err) {\n if (controller.signal.aborted) {\n aborted = true;\n }\n log.error(`${server} could not resolve ${hostname} record ${recordType}`);\n }\n finally {\n this._abortControllers = this._abortControllers.filter(c => c !== controller);\n }\n }\n if (aborted) {\n throw Object.assign(new Error('queryA ECANCELLED'), {\n code: 'ECANCELLED'\n });\n }\n throw new Error(`Could not resolve ${hostname} record ${recordType}`);\n }\n /**\n * Uses the DNS protocol to resolve the given host name into IPv6 addresses\n *\n * @param {string} hostname - host name to resolve\n */\n async resolve6(hostname) {\n const recordType = 'AAAA';\n const cached = this._cache.get(utils.getCacheKey(hostname, recordType));\n if (cached != null) {\n return cached;\n }\n let aborted = false;\n for (const server of this._getShuffledServers()) {\n const controller = new AbortController();\n this._abortControllers.push(controller);\n try {\n const response = await this._request(utils.buildResource(server, hostname, recordType), controller.signal);\n const data = response.Answer.map(a => a.data);\n const ttl = Math.min(...response.Answer.map(a => a.TTL));\n this._cache.set(utils.getCacheKey(hostname, recordType), data, { maxAge: ttl });\n return data;\n }\n catch (err) {\n if (controller.signal.aborted) {\n aborted = true;\n }\n log.error(`${server} could not resolve ${hostname} record ${recordType}`);\n }\n finally {\n this._abortControllers = this._abortControllers.filter(c => c !== controller);\n }\n }\n if (aborted) {\n throw Object.assign(new Error('queryAaaa ECANCELLED'), {\n code: 'ECANCELLED'\n });\n }\n throw new Error(`Could not resolve ${hostname} record ${recordType}`);\n }\n /**\n * Uses the DNS protocol to resolve the given host name into a Text record\n *\n * @param {string} hostname - host name to resolve\n */\n async resolveTxt(hostname) {\n const recordType = 'TXT';\n const cached = this._TXTcache.get(utils.getCacheKey(hostname, recordType));\n if (cached != null) {\n return cached;\n }\n let aborted = false;\n for (const server of this._getShuffledServers()) {\n const controller = new AbortController();\n this._abortControllers.push(controller);\n try {\n const response = await this._request(utils.buildResource(server, hostname, recordType), controller.signal);\n const data = response.Answer.map(a => [a.data.replace(/['\"]+/g, '')]);\n const ttl = Math.min(...response.Answer.map(a => a.TTL));\n this._TXTcache.set(utils.getCacheKey(hostname, recordType), data, { maxAge: ttl });\n return data;\n }\n catch (err) {\n if (controller.signal.aborted) {\n aborted = true;\n }\n log.error(`${server} could not resolve ${hostname} record ${recordType}`);\n }\n finally {\n this._abortControllers = this._abortControllers.filter(c => c !== controller);\n }\n }\n if (aborted) {\n throw Object.assign(new Error('queryTxt ECANCELLED'), {\n code: 'ECANCELLED'\n });\n }\n throw new Error(`Could not resolve ${hostname} record ${recordType}`);\n }\n clearCache() {\n this._cache.clear();\n this._TXTcache.clear();\n }\n}\nexport default Resolver;\n//# sourceMappingURL=index.js.map","import { Logger } from \"@waku/utils\";\nimport { bytesToUtf8 } from \"@waku/utils/bytes\";\nimport DnsOverHttpResolver from \"dns-over-http-resolver\";\nconst log = new Logger(\"dns-over-https\");\nexport class DnsOverHttps {\n resolver;\n /**\n * Create new Dns-Over-Http DNS client.\n *\n * @throws {code: string} If DNS query fails.\n */\n static async create() {\n return new DnsOverHttps();\n }\n constructor(resolver = new DnsOverHttpResolver()) {\n this.resolver = resolver;\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 answers = await this.resolver.resolveTxt(domain);\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 result = [];\n answers.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 { 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","export function selectOpenConnection(connections) {\n return connections\n .filter((c) => c.status === \"open\")\n .sort((left, right) => right.timeline.open - left.timeline.open)\n .at(0);\n}\n//# sourceMappingURL=utils.js.map","import { Logger } from \"@waku/utils\";\nimport { selectOpenConnection } from \"./utils.js\";\nconst STREAM_LOCK_KEY = \"consumed\";\nexport class StreamManager {\n multicodec;\n getConnections;\n addEventListener;\n log;\n ongoingCreation = new Set();\n streamPool = new Map();\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.addEventListener(\"peer:update\", this.handlePeerUpdateStreamPool);\n }\n async getStream(peerId) {\n const peerIdStr = peerId.toString();\n const scheduledStream = this.streamPool.get(peerIdStr);\n if (scheduledStream) {\n this.streamPool.delete(peerIdStr);\n await scheduledStream;\n }\n let stream = this.getOpenStreamForCodec(peerId);\n if (stream) {\n this.log.info(`Found existing stream peerId=${peerIdStr} multicodec=${this.multicodec}`);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n stream = await this.createStream(peerId);\n this.lockStream(peerIdStr, stream);\n return stream;\n }\n async createStream(peerId, retries = 0) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n throw new Error(`Failed to get a connection to the peer peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n }\n let lastError;\n let stream;\n for (let i = 0; i < retries + 1; i++) {\n try {\n this.log.info(`Attempting to create a stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n stream = await connection.newStream(this.multicodec);\n this.log.info(`Created stream for peerId=${peerId.toString()} multicodec=${this.multicodec}`);\n break;\n }\n catch (error) {\n lastError = error;\n }\n }\n if (!stream) {\n throw new Error(`Failed to create a new stream for ${peerId.toString()} -- ` + lastError);\n }\n return stream;\n }\n async createStreamWithLock(peer) {\n const peerId = peer.id.toString();\n if (this.ongoingCreation.has(peerId)) {\n this.log.info(`Skipping creation of a stream due to lock for peerId=${peerId} multicodec=${this.multicodec}`);\n return;\n }\n try {\n this.ongoingCreation.add(peerId);\n await this.createStream(peer.id);\n }\n catch (error) {\n this.log.error(`Failed to createStreamWithLock:`, error);\n }\n finally {\n this.ongoingCreation.delete(peerId);\n }\n return;\n }\n handlePeerUpdateStreamPool = (evt) => {\n const { peer } = evt.detail;\n if (!peer.protocols.includes(this.multicodec)) {\n return;\n }\n const stream = this.getOpenStreamForCodec(peer.id);\n if (stream) {\n return;\n }\n this.scheduleNewStream(peer);\n };\n scheduleNewStream(peer) {\n this.log.info(`Scheduling creation of a stream for peerId=${peer.id.toString()} multicodec=${this.multicodec}`);\n // abandon previous attempt\n if (this.streamPool.has(peer.id.toString())) {\n this.streamPool.delete(peer.id.toString());\n }\n this.streamPool.set(peer.id.toString(), this.createStreamWithLock(peer));\n }\n getOpenStreamForCodec(peerId) {\n const connections = this.getConnections(peerId);\n const connection = selectOpenConnection(connections);\n if (!connection) {\n return;\n }\n const stream = connection.streams.find((s) => s.protocol === this.multicodec);\n if (!stream) {\n return;\n }\n const isStreamUnusable = [\"done\", \"closed\", \"closing\"].includes(stream.writeStatus || \"\");\n if (isStreamUnusable || this.isStreamLocked(stream)) {\n return;\n }\n return stream;\n }\n lockStream(peerId, stream) {\n this.log.info(`Locking stream for peerId:${peerId}\\tstreamId:${stream.id}`);\n stream.metadata[STREAM_LOCK_KEY] = true;\n }\n isStreamLocked(stream) {\n return !!stream.metadata[STREAM_LOCK_KEY];\n }\n}\n//# sourceMappingURL=stream_manager.js.map","import { 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 pubsubTopics;\n addLibp2pEventListener;\n removeLibp2pEventListener;\n streamManager;\n constructor(multicodec, components, pubsubTopics) {\n this.multicodec = multicodec;\n this.components = components;\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(peerId) {\n return this.streamManager.getStream(peerId);\n }\n}\n//# sourceMappingURL=base_protocol.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, 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.components.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(peerId);\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 { 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 { peerIdFromString } from \"@libp2p/peer-id\";\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 = peerIdFromString(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 { enrTree, wakuDnsDiscovery, wakuLocalPeerCacheDiscovery, wakuPeerExchangeDiscovery } from \"@waku/discovery\";\nexport function getPeerDiscoveries(pubsubTopics, enabled) {\n const dnsEnrTrees = [enrTree[\"SANDBOX\"]];\n const discoveries = [];\n if (enabled?.dns) {\n discoveries.push(wakuDnsDiscovery(dnsEnrTrees));\n }\n if (enabled?.localPeerCache) {\n discoveries.push(wakuLocalPeerCacheDiscovery());\n }\n if (enabled?.peerExchange) {\n discoveries.push(wakuPeerExchangeDiscovery(pubsubTopics));\n }\n return discoveries;\n}\n//# sourceMappingURL=discovery.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 { isTestEnvironment } from \"../env.js\";\nimport { getPeerDiscoveries } from \"./discovery.js\";\nconst log = new Logger(\"sdk:create\");\nconst DefaultUserAgent = \"js-waku\";\nconst DefaultPingMaxInboundStreams = 10;\nexport async function defaultLibp2p(pubsubTopics, options, userAgent) {\n if (!options?.hideWebSocketInfo && !isTestEnvironment()) {\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 || isTestEnvironment()\n ? filterAll\n : wss;\n return createLibp2p({\n transports: [webSockets({ filter: filter })],\n streamMuxers: [mplex()],\n connectionEncrypters: [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}\nconst DEFAULT_DISCOVERIES_ENABLED = {\n dns: true,\n peerExchange: true,\n localPeerCache: true\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(...getPeerDiscoveries(pubsubTopics, {\n ...DEFAULT_DISCOVERIES_ENABLED,\n ...options.discovery\n }));\n }\n else {\n peerDiscovery.push(...getPeerDiscoveries(pubsubTopics, options.discovery));\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 { generateKeyPair } from '@libp2p/crypto/keys';\nimport { peerIdFromPrivateKey } from '@libp2p/peer-id';\nimport { validateConfig } from './config.js';\nimport { Libp2p as Libp2pClass } 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 * connectionEncrypters: [noise()]\n * }\n *\n * // create libp2p\n * const libp2p = await createLibp2p(options)\n * ```\n */\nexport async function createLibp2p(options = {}) {\n options.privateKey ??= await generateKeyPair('Ed25519');\n const node = new Libp2pClass({\n ...await validateConfig(options),\n peerId: peerIdFromPrivateKey(options.privateKey)\n });\n if (options.start !== false) {\n await node.start();\n }\n return node;\n}\n//# sourceMappingURL=index.js.map","import { WakuNode } from \"../waku/index.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 const node = new WakuNode(pubsubTopics, options, libp2p, {\n store: true,\n lightpush: true,\n filter: true\n });\n // only if `false` is passed explicitly\n if (options?.autoStart !== false) {\n await node.start();\n }\n return node;\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","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 = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"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 function sha256(text) {\n return __awaiter(this, void 0, void 0, function () {\n var encoder, data, hashBuffer, hashArray, hashHex;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n encoder = new TextEncoder();\n data = encoder.encode(text);\n return [4 /*yield*/, crypto.subtle.digest(\"SHA-256\", data)];\n case 1:\n hashBuffer = _a.sent();\n hashArray = Array.from(new Uint8Array(hashBuffer));\n hashHex = hashArray.map(function (b) { return b.toString(16).padStart(2, \"0\"); }).join(\"\");\n return [2 /*return*/, hashHex];\n }\n });\n });\n}\nexport function generateRandomNumber() {\n return Math.random().toString();\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 = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"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};\nimport { createLightNode, createEncoder, createDecoder } from \"@waku/sdk\";\nimport { generateKeyPairFromSeed } from \"@libp2p/crypto/keys\";\nimport { fromString } from \"uint8arrays\";\nimport { sha256, generateRandomNumber } from \"./utils\";\nexport var DEFAULT_CONTENT_TOPIC = \"/js-waku-examples/1/message-ratio/utf8\";\nvar wakuNodeInstance = null;\nexport function getWakuNode() {\n return __awaiter(this, void 0, void 0, function () {\n var seed, privateKey, node;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n if (wakuNodeInstance) {\n return [2 /*return*/, wakuNodeInstance];\n }\n seed = localStorage.getItem(\"seed\");\n if (!!seed) return [3 /*break*/, 2];\n return [4 /*yield*/, sha256(generateRandomNumber())];\n case 1:\n seed = (_a.sent()).slice(0, 32);\n localStorage.setItem(\"seed\", seed);\n _a.label = 2;\n case 2: return [4 /*yield*/, generateKeyPairFromSeed(\"Ed25519\", fromString(seed))];\n case 3:\n privateKey = _a.sent();\n return [4 /*yield*/, createLightNode({\n defaultBootstrap: false,\n networkConfig: {\n clusterId: 42,\n shards: [0]\n },\n numPeersToUse: 2,\n libp2p: {\n privateKey: privateKey,\n },\n })];\n case 4:\n node = _a.sent();\n return [4 /*yield*/, Promise.allSettled([\n node.dial(\"/dns4/waku-test.bloxy.one/tcp/8095/wss/p2p/16Uiu2HAmSZbDB7CusdRhgkD81VssRjQV5ZH13FbzCGcdnbbh6VwZ\"),\n node.dial(\"/dns4/vps-aaa00d52.vps.ovh.ca/tcp/8000/wss/p2p/16Uiu2HAm9PftGgHZwWE3wzdMde4m3kT2eYJFXLZfGoSED3gysofk\")\n ])];\n case 5:\n _a.sent();\n return [4 /*yield*/, node.start()];\n case 6:\n _a.sent();\n return [4 /*yield*/, node.waitForPeers()];\n case 7:\n _a.sent();\n wakuNodeInstance = node;\n window.waku = node;\n return [2 /*return*/, node];\n }\n });\n });\n}\nexport function getPeerId() {\n return wakuNodeInstance === null || wakuNodeInstance === void 0 ? void 0 : wakuNodeInstance.libp2p.peerId.toString();\n}\nexport function createWakuEncoder() {\n return createEncoder({\n contentTopic: DEFAULT_CONTENT_TOPIC,\n pubsubTopicShardInfo: {\n clusterId: 42,\n shard: 0,\n }\n });\n}\nexport function createWakuDecoder() {\n return createDecoder(DEFAULT_CONTENT_TOPIC, { clusterId: 42, shard: 0 });\n}\n","var sentByMeCountEl = document.getElementById(\"sentByMeCount\");\nvar receivedMineCountEl = document.getElementById(\"receivedMineCount\");\nvar receivedOthersCountEl = document.getElementById(\"receivedOthersCount\");\nvar peerIdDisplayEl = document.getElementById(\"peerIdDisplay\");\nvar messageListEl = document.getElementById(\"messageList\");\nvar searchInputEl = document.getElementById(\"searchInput\");\nvar sentByMe = 0;\nvar receivedMine = 0;\nvar receivedOthers = 0;\nvar currentMessages = [];\nvar currentPeerId;\nexport function updatePeerIdDisplay(peerId) {\n currentPeerId = peerId;\n if (peerIdDisplayEl) {\n peerIdDisplayEl.textContent = peerId;\n }\n}\nexport function incrementSentByMe() {\n sentByMe++;\n if (sentByMeCountEl)\n sentByMeCountEl.textContent = sentByMe.toString();\n}\nexport function incrementReceivedMine() {\n receivedMine++;\n if (receivedMineCountEl)\n receivedMineCountEl.textContent = receivedMine.toString();\n}\nexport function incrementReceivedOthers() {\n receivedOthers++;\n if (receivedOthersCountEl)\n receivedOthersCountEl.textContent = receivedOthers.toString();\n}\nexport function addMessageToLog(message, type) {\n currentMessages.push(message);\n renderMessages();\n}\nexport function renderMessages(filterText) {\n if (!messageListEl)\n return;\n messageListEl.innerHTML = \"\";\n var messagesToRender = filterText\n ? currentMessages.filter(function (msg) {\n var searchTerm = filterText.toLowerCase();\n return (msg.content.toLowerCase().includes(searchTerm) ||\n msg.id.toLowerCase().includes(searchTerm) ||\n msg.senderPeerId.toLowerCase().includes(searchTerm));\n })\n : currentMessages;\n messagesToRender.sort(function (a, b) { return a.timestamp - b.timestamp; });\n messagesToRender.forEach(function (message) {\n var item = document.createElement(\"div\");\n item.classList.add(\"message-item\");\n var typeClass = '';\n var senderPrefix = '';\n if (message.senderPeerId === currentPeerId) {\n typeClass = 'sent';\n senderPrefix = 'Me';\n }\n else {\n typeClass = 'received-other';\n senderPrefix = \"Other (\".concat(message.senderPeerId.substring(0, 6), \"...)\");\n }\n item.classList.add(typeClass);\n var idText = document.createElement(\"p\");\n idText.classList.add(\"message-id\");\n idText.textContent = \"ID: \".concat(message.id);\n var contentP = document.createElement(\"p\");\n contentP.classList.add(\"content\");\n contentP.textContent = message.content;\n var senderInfoP = document.createElement(\"p\");\n senderInfoP.classList.add(\"sender-info\");\n senderInfoP.textContent = \"From: \".concat(senderPrefix);\n var timestampP = document.createElement(\"p\");\n timestampP.classList.add(\"timestamp\");\n timestampP.textContent = new Date(message.timestamp).toLocaleTimeString();\n item.appendChild(idText);\n item.appendChild(senderInfoP);\n item.appendChild(contentP);\n item.appendChild(timestampP);\n messageListEl.appendChild(item);\n });\n}\nexport function getSearchTerm() {\n return searchInputEl ? searchInputEl.value : \"\";\n}\n","import { Type, Field } from \"protobufjs\";\nimport { getPeerId } from \"./waku-service\";\n// New message structure with a unique ID and content for searchability\nexport var ProtoChatMessage = new Type(\"ChatMessage\")\n .add(new Field(\"id\", 1, \"string\")) // Unique message ID (e.g., UUID or timestamp-based)\n .add(new Field(\"timestamp\", 2, \"uint64\"))\n .add(new Field(\"senderPeerId\", 3, \"string\"))\n .add(new Field(\"content\", 4, \"string\")); // Actual message content\nexport function encodeMessage(content) {\n var id = \"\".concat(Date.now(), \"-\").concat(Math.random().toString(36).substring(2, 9));\n var message = ProtoChatMessage.create({\n id: id,\n timestamp: Date.now(),\n senderPeerId: getPeerId() || \"unknown\",\n content: content,\n });\n return ProtoChatMessage.encode(message).finish();\n}\nexport function decodeMessage(payload) {\n try {\n var decoded = ProtoChatMessage.decode(payload);\n return {\n id: decoded.id,\n timestamp: Number(decoded.timestamp),\n senderPeerId: decoded.senderPeerId,\n content: decoded.content,\n };\n }\n catch (error) {\n console.error(\"Failed to decode message:\", error);\n return null;\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 = Object.create((typeof Iterator === \"function\" ? Iterator : Object).prototype);\n return g.next = verb(0), g[\"throw\"] = verb(1), g[\"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};\nimport { getWakuNode, createWakuEncoder, createWakuDecoder, getPeerId } from \"./waku-service\";\nimport { encodeMessage, decodeMessage, ProtoChatMessage, } from \"./message-service\";\nimport { updatePeerIdDisplay, incrementSentByMe, incrementReceivedMine, incrementReceivedOthers, addMessageToLog, renderMessages, getSearchTerm, } from \"./ui-manager\";\nvar NUM_MESSAGES_PER_BATCH = 5;\nvar batchCounter = 0;\nfunction initializeApp() {\n return __awaiter(this, void 0, void 0, function () {\n var node_1, currentPeerId_1, sendMessageBatch_1, subscribeToMessages, sendMessageButton, searchButton, searchInput, error_1, peerIdDisplayEl;\n var _this = this;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n _a.trys.push([0, 3, , 4]);\n console.log(\"Initializing Waku node...\");\n return [4 /*yield*/, getWakuNode()];\n case 1:\n node_1 = _a.sent();\n currentPeerId_1 = getPeerId();\n console.log(\"Waku node initialized. Peer ID:\", currentPeerId_1);\n if (currentPeerId_1) {\n updatePeerIdDisplay(currentPeerId_1);\n }\n sendMessageBatch_1 = function () { return __awaiter(_this, void 0, void 0, function () {\n var encoder, i, messageContent, payload, tempDecodedMessage, messageId, chatMessage, result, error_2;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n encoder = createWakuEncoder();\n batchCounter++;\n console.log(\"Sending batch C\".concat(batchCounter, \" of \").concat(NUM_MESSAGES_PER_BATCH, \" messages...\"));\n i = 0;\n _a.label = 1;\n case 1:\n if (!(i < NUM_MESSAGES_PER_BATCH)) return [3 /*break*/, 8];\n messageContent = \"Batch \".concat(batchCounter, \" - Msg \").concat(i + 1, \" @ \").concat(new Date().toLocaleTimeString());\n payload = encodeMessage(messageContent);\n tempDecodedMessage = ProtoChatMessage.decode(payload);\n messageId = tempDecodedMessage.id || \"temp-id-\".concat(Date.now());\n chatMessage = {\n id: messageId,\n timestamp: Date.now(),\n senderPeerId: currentPeerId_1 || \"unknown\",\n content: messageContent\n };\n _a.label = 2;\n case 2:\n _a.trys.push([2, 4, , 5]);\n return [4 /*yield*/, node_1.lightPush.send(encoder, {\n payload: payload,\n timestamp: new Date(chatMessage.timestamp),\n }, { autoRetry: true })];\n case 3:\n result = _a.sent();\n if (result.successes.length > 0) {\n console.log(\"Message \".concat(i + 1, \" (ID: \").concat(chatMessage.id, \") sent successfully.\"));\n incrementSentByMe();\n addMessageToLog(chatMessage, 'sent');\n }\n else {\n console.warn(\"Failed to send message \".concat(i + 1, \" (ID: \").concat(chatMessage.id, \"):\"), result.failures);\n }\n return [3 /*break*/, 5];\n case 4:\n error_2 = _a.sent();\n console.error(\"Error sending message \".concat(i + 1, \" (ID: \").concat(chatMessage.id, \"):\"), error_2);\n return [3 /*break*/, 5];\n case 5: return [4 /*yield*/, new Promise(function (resolve) { return setTimeout(resolve, 100); })];\n case 6:\n _a.sent();\n _a.label = 7;\n case 7:\n i++;\n return [3 /*break*/, 1];\n case 8:\n console.log(\"Message batch sending complete.\");\n return [2 /*return*/];\n }\n });\n }); };\n subscribeToMessages = function () { return __awaiter(_this, void 0, void 0, function () {\n var decoder;\n return __generator(this, function (_a) {\n switch (_a.label) {\n case 0:\n decoder = createWakuDecoder();\n console.log(\"Subscribing to messages...\");\n return [4 /*yield*/, node_1.filter.subscribe(decoder, function (wakuMessage) {\n console.log(\"Raw Waku message received, payload length:\", wakuMessage.payload.length);\n var chatMessage = decodeMessage(wakuMessage.payload);\n if (chatMessage) {\n console.log(\"Decoded chat message:\", chatMessage);\n if (chatMessage.senderPeerId === currentPeerId_1) {\n incrementReceivedMine();\n console.log(\"Received own message (loopback):\", chatMessage.id);\n }\n else {\n incrementReceivedOthers();\n addMessageToLog(chatMessage, 'received-other');\n console.log(\"Received message from other peer:\", chatMessage.id);\n }\n }\n else {\n console.warn(\"Could not decode received Waku message. Payload might be malformed or not a ChatMessage.\");\n }\n })];\n case 1:\n _a.sent();\n console.log(\"Subscription active.\");\n return [2 /*return*/];\n }\n });\n }); };\n sendMessageButton = document.getElementById(\"sendMessageButton\");\n if (sendMessageButton) {\n sendMessageButton.addEventListener(\"click\", function () {\n console.log(\"Send Message Button clicked\");\n sendMessageBatch_1();\n });\n }\n searchButton = document.getElementById(\"searchButton\");\n if (searchButton) {\n searchButton.addEventListener(\"click\", function () {\n console.log(\"Search button clicked\");\n renderMessages(getSearchTerm());\n });\n }\n searchInput = document.getElementById(\"searchInput\");\n if (searchInput) {\n searchInput.addEventListener(\"input\", function () {\n console.log(\"Search input changed\");\n renderMessages(getSearchTerm());\n });\n }\n return [4 /*yield*/, subscribeToMessages()];\n case 2:\n _a.sent();\n console.log(\"Application setup complete. Click 'Send New Message Batch' to send messages.\");\n return [3 /*break*/, 4];\n case 3:\n error_1 = _a.sent();\n console.error(\"Critical error during app initialization:\", error_1);\n peerIdDisplayEl = document.getElementById(\"peerIdDisplay\");\n if (peerIdDisplayEl)\n peerIdDisplayEl.textContent = \"Error connecting to Waku Network.\";\n return [3 /*break*/, 4];\n case 4: return [2 /*return*/];\n }\n });\n });\n}\ndocument.addEventListener(\"DOMContentLoaded\", function () {\n console.log(\"DOM fully loaded and parsed. Starting app initialization.\");\n initializeApp();\n});\n"],"names":["module","exports","max","Error","size","cache","Object","create","_cache","update","key","value","has","undefined","remove","get","v","set","clear","prototype","hasOwnProperty","prefix","Events","EE","fn","context","once","this","addListener","emitter","event","TypeError","listener","evt","_events","push","_eventsCount","clearEvent","EventEmitter","__proto__","eventNames","events","name","names","call","slice","getOwnPropertySymbols","concat","listeners","handlers","i","l","length","ee","Array","listenerCount","emit","a1","a2","a3","a4","a5","args","len","arguments","removeListener","apply","j","on","removeAllListeners","off","prefixed","types","util","s","bake","values","offset","o","basic","defaults","emptyArray","long","mapKey","packed","mtype","gen","codegen","seenFirstField","oneofsArray","fieldsArray","field","_fieldsArray","resolve","ref","safeProp","optional","map","invalid","genVerifyKey","genVerifyValue","repeated","partOf","oneofProp","Enum","expected","keyType","fieldIndex","resolvedType","keys","type","tokenize","delimRe","stringDoubleRe","stringSingleRe","setCommentRe","setCommentAltRe","setCommentSplitRe","whitespaceRe","unescapeRe","unescapeMap","unescape","str","replace","$0","$1","source","alternateCommentMode","toString","line","lastCommentLine","comments","stack","stringDelim","illegal","subject","charAt","pos","setComment","start","end","isLeading","c","comment","lineEmpty","leading","commentOffset","lines","substring","split","trim","text","join","isDoubleSlashCommentLine","startOffset","endOffset","findEndOfLine","lineText","test","cursor","next","shift","re","lastIndex","match","exec","readString","repeat","prev","curr","isDoc","isLeadingComment","Math","min","token","peek","defineProperty","skip","actual","cmnt","trailingLine","ret","event_iterator_1","EventIterator","env","createDebug","namespace","prevTime","namespacesCache","enabledCache","enableOverride","debug","enabled","self","Number","Date","ms","diff","coerce","unshift","index","format","formatter","formatters","val","splice","formatArgs","log","useColors","color","selectColor","extend","destroy","enumerable","configurable","namespaces","init","delimiter","newDebug","matchesTemplate","search","template","searchIndex","templateIndex","starIndex","matchIndex","default","message","disable","skips","enable","save","filter","Boolean","ns","humanize","console","warn","forEach","hash","charCodeAt","colors","abs","load","converter","genValuePartial_fromObject","prop","defaultAlreadyEmitted","typeDefault","fullName","isUnsigned","genValuePartial_toObject","fromObject","fields","toObject","sort","compareFieldsById","repeatedFields","mapFields","normalFields","valuesById","low","high","unsigned","toNumber","bytes","arrayDefault","String","fromCharCode","hasKs2","indexOf","BufferWriter","Writer","constructor","writeStringBuffer","buf","utf8","write","utf8Write","_configure","alloc","_Buffer_allocUnsafe","writeBytesBuffer","Buffer","Uint8Array","copy","isString","_Buffer_from","uint32","_push","string","byteLength","wireType","id","genTypePartial","delimited","INPUT_ERROR","WINDOW","window","root","JS_SHA3_NO_WINDOW","WEB_WORKER","JS_SHA3_NO_NODE_JS","process","versions","node","global","COMMON_JS","JS_SHA3_NO_COMMON_JS","AMD","ARRAY_BUFFER","JS_SHA3_NO_ARRAY_BUFFER","ArrayBuffer","HEX_CHARS","CSHAKE_PADDING","SHIFT","RC","BITS","SHAKE_BITS","OUTPUT_TYPES","CSHAKE_BYTEPAD","isArray","obj","isView","JS_SHA3_NO_ARRAY_BUFFER_IS_VIEW","buffer","formatMessage","empty","cloneArray","array","newArray","createOutputMethod","bits","padding","outputType","Keccak","createShakeOutputMethod","outputBits","createCshakeOutputMethod","n","methods","createKmacOutputMethod","createOutputMethods","method","createMethod","algorithms","w","bytepad","Kmac","methodNames","algorithm","methodName","newMethodName","blocks","reset","finalized","block","blockCount","byteCount","outputBlocks","extraBytes","result","code","lastByteIndex","f","encode","x","right","encodeString","strs","paddingBytes","zeros","finalize","hex","arrayBuffer","Uint32Array","digest","h","c0","c1","c2","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","Field","ReflectionObject","className","Type","ruleRe","rule","options","isObject","isInteger","toLowerCase","defaultValue","Long","extensionField","declaringField","fromJSON","json","edition","_edition","_defaultEdition","_features","field_presence","required","message_encoding","repeated_field_encoding","setOption","ifNotSet","toJSON","toJSONOptions","keepComments","_editionToJSON","resolved","parent","lookupTypeOrEnum","proto3_optional","fromNumber","freeze","base64","decode","newBuffer","emptyObject","ctor","_inferLegacyProtoFeatures","features","group","getOption","_resolveFeatures","d","fieldId","fieldType","fieldRule","decorateType","decorateEnum","fieldName","add","Type_","read","t","parts","chunk","OneOf","fieldNames","oneof","addFieldsToParent","onAdd","onRemove","oneofName","oneOfGetter","oneOfSetter","LongBits","lo","hi","zero","zzEncode","zzDecode","zeroHash","sign","from","parseInt","fromString","toLong","fromHash","toHash","mask","part0","part1","part2","Message","properties","$type","writer","encodeDelimited","reader","decodeDelimited","verify","object","BufferReader","Reader","_slice","utf8Slice","roots","fetch","path","fs","inquire","toArray","safePropBackslashRe","safePropQuoteRe","isReserved","ucFirst","toUpperCase","camelCaseRe","camelCase","a","b","typeName","decorateRoot","decorateEnumIndex","enm","setProperty","dst","setProp","part","prevValue","Op","noop","State","head","tail","states","writeByte","VarintOp","writeVarint64","writeFixed32","pool","subarray","int32","sint32","uint64","int64","sint64","bool","fixed32","sfixed32","fixed64","sfixed64","float","writeFloatLE","double","writeDoubleLE","writeBytes","fork","ldelim","finish","BufferWriter_","merge","src","newError","CustomError","captureStackTrace","writable","asPromise","isNode","isFinite","floor","isset","isSet","e","sizeOrArray","dcodeIO","key2Re","key32Re","key64Re","longToHash","longFromHash","fromBits","lcFirst","ProtocolError","fieldMap","longs","enums","encoding","allocUnsafe","RetryOperation","timeouts","forever","_originalTimeouts","JSON","parse","stringify","_timeouts","_options","_maxRetryTime","maxRetryTime","Infinity","_fn","_errors","_attempts","_operationTimeout","_operationTimeoutCb","_timeout","_operationStart","_timer","_cachedTimeouts","stop","clearTimeout","retry","err","currentTime","getTime","timeout","setTimeout","unref","attempt","timeoutOps","cb","try","errors","attempts","mainError","counts","mainErrorCount","error","count","moduleName","mod","eval","_listeners","ctx","protobuf","configure","build","rpc","filename","keepCase","Root","MapField","Service","Method","base10Re","base10NegRe","base16Re","base16NegRe","base8Re","base8NegRe","numberRe","nameRe","typeRefRe","pkg","imports","weakImports","preferTrailingComment","tn","ptr","topLevelObjects","topLevelOptions","applyCase","insideTryCatch","readValue","acceptTypeRef","NaN","parseFloat","parseNumber","readRanges","target","acceptStrings","parseId","dummy","ifBlock","parseOption","parseInlineOptions","acceptNegative","parsePackage","define","parseImport","whichImports","parseSyntax","parseEdition","includes","parseCommon","parseType","parseEnum","service","commentText","requestType","requestStream","responseType","responseStream","parseMethod","parseService","reference","parseField","parseExtension","fnIf","fnElse","valueType","parseMapField","parseOneOf","extensions","reserved","endsWith","startsWith","parseGroup","parsedOptions","parseEnumValue","option","propName","isOption","parensValue","tokens","optionValue","parseOptionValue","setParsedOption","objectResult","lastValue","simpleValue","opt","common","timeType","commonRe","nested","google","Any","type_url","Duration","seconds","nanos","Timestamp","Empty","Struct","Value","oneofs","kind","nullValue","numberValue","stringValue","boolValue","structValue","listValue","NullValue","NULL_VALUE","ListValue","DoubleValue","FloatValue","Int64Value","UInt64Value","Int32Value","UInt32Value","BoolValue","StringValue","BytesValue","FieldMask","paths","file","callback","xhr","readFile","contents","XMLHttpRequest","binary","onreadystatechange","readyState","status","response","responseText","overrideMimeType","open","send","loadSync","encoder","decoder","verifier","Namespace","wrappers","deferred","files","SYNC","setOptions","addJSON","resolveAll","resolvePath","sync","getBundledFileName","idx","lastIndexOf","altname","parsed","queued","weak","readFileSync","exposeRe","tryHandleExtension","extendedType","lookup","sisterField","_handleAdd","nestedArray","_nestedArray","_handleRemove","parse_","common_","Netmask","atob","chr","chr0","chrA","chra","ip2long","long2ip","ip","base","dmax","net","maskLong","error1","bitmask","netLong","pow","hostmask","first","last","broadcast","contains","lastLong","valuesOptions","_valuesFeatures","parentFeaturesCopy","assign","isReservedId","isReservedName","allow_alias","HI_BASE32_NO_NODE_JS","HI_BASE32_NO_COMMON_JS","BASE32_ENCODE_CHAR","BASE32_DECODE_CHAR","throwInvalidUtf8","position","partial","substr","decodeAsBytes","base32Str","v1","v2","v3","v4","v5","v6","v7","v8","remain","asciiOnly","followingChars","toUtf8String","input","notString","encodeBytes","encodeAscii","encodeUtf8","asBytes","base32","indexOutOfRange","writeLength","RangeError","create_array","isBuffer","readLongVarint","readFixed32_end","readFixed64","readFloatLE","readDoubleLE","nativeBuffer","skipType","BufferReader_","getPrototypeOf","m","plural","msAbs","isPlural","round","fmtShort","isOptionObject","propertyIsEnumerable","globalThis","defaultMergeOptions","concatArrays","ignoreUndefined","getEnumerableOwnPropertyKeys","symbols","symbol","clone","cloneOptionObject","mergeKeys","merged","config","resultIndex","indices","k","_","editions2023Defaults","enum_type","json_format","utf8_validation","proto2Defaults","proto3Defaults","defineProperties","_resolveFeaturesRecursive","protoFeatures","lexicalParentFeaturesCopy","find","newValue","newOpt","Root_","rpcImpl","requestDelimited","responseDelimited","rpcCall","requestCtor","responseCtor","request","endedByRPC","rfield","missing","lastC","storage","setItem","removeItem","r","getItem","DEBUG","__nwjs","navigator","userAgent","document","documentElement","style","WebkitAppearance","firebug","exception","table","localStorage","localstorage","warned","_fieldsById","_oneofsArray","_ctor","clearCache","fieldsById","generateConstructor","ctorProperties","inherited","arrayToJSON","setup","wrapper","originalThis","bind","params","pending","Promise","reject","resolvedKeyType","fieldKeyType","fieldValueType","operation","retries","opts","factor","minTimeout","maxTimeout","randomize","createTimeout","random","wrap","original","op","pop","functionParams","functionName","body","Codegen","formatStringOrScope","verbose","scopeKeys","scopeParams","scopeValues","scopeOffset","Function","formatParams","formatOffset","functionNameOverride","resolvedRequestType","resolvedResponseType","lookupType","p","ceil","b64","s64","invalidEncoding","nestedJson","getEnum","filterTypes","parentAlreadyChecked","found","lookupEnum","lookupService","Service_","Enum_","isAbsolute","normalize","absolute","originPath","includePath","alreadyNormalized","SIZE","MAX","slab","factory","Float32Array","f32","f8b","le","writeFloat_f32_cpy","writeFloat_f32_rev","readFloat_f32_cpy","readFloat_f32_rev","writeFloatBE","readFloatBE","writeFloat_ieee754","writeUint","isNaN","exponent","LN2","readFloat_ieee754","readUint","uint","mantissa","writeUintLE","writeUintBE","readUintLE","readUintBE","Float64Array","f64","writeDouble_f64_cpy","writeDouble_f64_rev","readDouble_f64_cpy","readDouble_f64_rev","writeDoubleBE","readDoubleBE","writeDouble_ieee754","off0","off1","readDouble_ieee754","_methodsArray","methodsArray","rpcService","q","EventQueue","pullQueue","pushQueue","eventHandlers","isPaused","isStopped","resolution","done","placeholder","highWaterMark","highWater","fail","rejection","catch","then","removeCallback","Symbol","asyncIterator","lowWaterMark","lowWater","return","listen","queue","__webpack_module_cache__","leafPrototypes","getProto","__webpack_require__","moduleId","cachedModule","__webpack_modules__","amdO","mode","__esModule","def","current","getOwnPropertyNames","definition","toStringTag","N1","N2","N3","N4","N5","N6","N7","MSB","REST","encodingLength","MAX_SAFE_INTEGER","encodeUint8Array","decodeUint8Array","res","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","createReader","byteOffset","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","data","pad","out","codes","written","SyntaxError","base10","base16","base16upper","base2","alphabetBytesToChars","reduce","alphabetCharsToBytes","codePoint","base256emoji","byts","char","byt","base32upper","base32pad","base32padupper","base32hex","base32hexupper","base32hexpad","base32hexpadupper","base32z","base36","base36upper","base58btc","base58flickr","base64pad","base64url","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","remainder","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","HistoryEntry","SdsMessage","enumeration","findValue","VARINT","enumValue","LENGTH_DELIMITED","MaxLengthError","MaxSizeError","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","messageId","retrievalHint","channelId","lamportTimestamp","causalHistory","bloomFilter","content","causalHistory$","anumber","isSafeInteger","lengths","ahash","outputLen","blockLen","aexists","instance","checkFinished","destroyed","finished","createView","arr","DataView","rotr","word","toBytes","toHex","fromHex","Hash","_cloneInto","hashCons","hashC","msg","tmp","bytesLength","getRandomValues","randomBytes","Maj","HashMD","padOffset","isLE","view","take","dataView","roundClean","digestInto","aoutput","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","DefaultNetworkConfig","HealthStatusChangeEvents","HealthStatus","bytesToUtf8","byteArrays","totalLength","acc","shardInfoToPubsubTopics","shardInfo","Set","contentTopicToPubsubTopic","application","pubsubTopicToSingleShardInfo","pubsubTopics","shard","pubsubTopicsToShardInfo","shardInfoSet","clusterIds","ensurePubsubTopicIsConfigured","configuredTopics","contentTopicToShardIndex","networkShards","generation","topicName","ensureValidContentTopic","dataview","getBigUint64","determinePubsubTopic","pubsubTopicShardInfo","singleShardInfoToPubsubTopic","decodeRelayShard","getUint16","byteIndex","bitIndex","getUint8","numIndices","encodeRelayShard","setUint16","setUint8","APP_NAME","Logger","_info","_warn","_error","createDebugNamespace","level","logger","OneMillion","DecodedMessage","proto","_rawTimestamp","metaSetter","toWire","toProtoObj","protoMessage","valueOf","createEncoder","fromWireToProtoObj","fromProtoObj","createDecoder","entry","arrays","output","findBufAndOffset","bufs","bufEnd","isUint8ArrayList","Uint8ArrayList","appendAll","iterator","append","prepend","prependAll","reverse","consume","trunc","beginInclusive","endExclusive","_subList","sublist","list","bufStart","sliceStartInBuf","sliceEndsInBuf","needle","M","rightmostPositions","Int32Array","lastPatIndex","getInt8","setInt8","getInt16","littleEndian","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","raceSignal","aborted","errorMessage","errorCode","errorName","QueuelessPushable","readNext","haveNext","nextResult","sources","syncSources","mergeSyncSources","all","item","addAllToPushable","mergeSources","pipe","rest","isDuplex","duplex","isIterable","fns","sink","duplexPipelineFn","rawPipe","stream","sourceWrap","selectOpenConnection","connections","timeline","at","STREAM_LOCK_KEY","StreamManager","multicodec","getConnections","ongoingCreation","streamPool","handlePeerUpdateStreamPool","getStream","peerId","peerIdStr","scheduledStream","delete","getOpenStreamForCodec","lockStream","createStream","connection","lastError","newStream","createStreamWithLock","peer","detail","protocols","scheduleNewStream","streams","protocol","writeStatus","isStreamLocked","metadata","BaseProtocol","components","addLibp2pEventListener","removeLibp2pEventListener","streamManager","connectionManager","randomUUID","rnds8","rng","byteToHex","rnds","unsafeStringify","FilterPushRpc","FilterSubscribeRpc","createSubscribeRequest","SUBSCRIBE","createUnsubscribeRequest","UNSUBSCRIBE","createUnsubscribeAllRequest","UNSUBSCRIBE_ALL","createSubscriberPingRequest","FilterCodecs","FilterCore","static","handleIncomingMessage","libp2p","prevHandler","handle","onRequest","maxInboundStreams","success","failure","GENERIC_FAIL","REMOTE_PEER_REJECTED","unsubscribe","NO_STREAM_AVAILABLE","unsubscribeRequest","unsubscribeAll","NO_RESPONSE","ping","streamData","remotePeer","createRequest","LightPushCodec","LightPushCore","preparePushMessage","EMPTY_PAYLOAD","isWireSizeUnderCap","isMessageSizeUnderCap","SIZE_TOO_BIG","ENCODE_FAILED","preparationError","STREAM_ABORTED","DECODE_FAILED","RLN_PROOF_GENERATION","EmptyMessage","ONE_MILLION","StoreCodec","StoreCore","queryPerPage","queryOpts","currentCursor","storeQueryRequest","storeQueryResponse","decodedMessages","protoMsg","wire","TypedEventEmitter","EventTarget","dispatchEvent","safeDispatchEvent","CustomEvent","peerIdSymbol","isPeerId","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","parseIPv4","new","parseIPv6","parseIP","mapIPv4ToIPv6","addr","ipv4Prefix","maskIp","allFF","cidrMask","ones","ipOrCidr","network","address","maskString","ipLength","parseCidr","ipResult","maskResult","containsIp","byte","entries","simpleMaskLength","maskToHex","padStart","ipToString","isIPv4","isIPv6","isIP","isV4","isV6","sections","v4Buffer","argv","V","convertToString","ipBuff","ipString","bytes2ip","bytes2str","bytes2port","bytes2mh","addrBytes","portBytes","bytes2onion","bytes2mb","encodeURIComponent","ip2bytes","str2bytes","port2bytes","mh","mh2bytes","port","portBuf","onion2bytes","onion32bytes","mbstr","mb","anybaseDecoder","mb2bytes","decodeURIComponent","row","resolvable","createProtocol","bytesToMultiaddrParts","tuples","stringTuples","sizeForAddr","stringAddr","stringTuplesToString","tup","cleanPath","inspect","DNS_CODES","NoAvailableResolverError","Multiaddr","stringToMultiaddrParts","isMultiaddr","toOptions","family","transport","host","zone","tcp","udp","ip4","ip6","dns6","ip6zone","protos","protoCodes","protoNames","encapsulate","decapsulate","addrString","decapsulateCode","getPeerId","p2p","tuple","getPath","resolvableProto","resolver","resolvers","nodeAddress","isThinWaistAddress","KeepAliveManager","relay","pingKeepAliveTimers","relayKeepAliveTimers","pingKeepAlive","pingPeriodSecs","relayKeepAlive","relayPeriodSecs","interval","setInterval","services","peerStore","intervals","scheduleRelayPings","clearInterval","stopAll","timer","connectionsExist","getMeshPeers","getPeerPing","ConnectionManager","keepAliveManager","dialAttemptsForPeer","dialErrorsForPeer","currentActiveParallelDialCount","pendingPeerDialQueue","isP2PNetworkConnected","isConnected","onLine","onEventHandlers","stopNetworkStatusListener","dropConnection","hangUp","getPeersByDiscovery","peersDiscovered","peersConnected","conn","peersDiscoveredByBootstrap","peersDiscoveredByPeerExchange","peersDiscoveredByLocal","peersConnectedByBootstrap","peersConnectedByPeerExchange","peersConnectedByLocal","tags","getTagNamesForPeer","BOOTSTRAP","PEER_EXCHANGE","LOCAL","DISCOVERED","CONNECTED","maxDialAttemptsForPeer","maxBootstrapPeersAllowed","maxParallelDials","startEventListeners","dialPeerStorePeers","getConnectedPeers","peerIDs","getPeers","dialPromises","peerInfo","attemptDial","startPeerDiscoveryListener","startPeerConnectionListener","startPeerDisconnectionListener","startNetworkStatusListener","dialPeer","peerDialInfo","getDialablePeerInfo","dialAttempt","dial","AggregateError","processDialQueue","attemptDnsDiscovery","rawDialPeerWithProtocols","protocolCodecs","dialProtocol","ma","dnsDiscovery","findPeers","shouldDialPeer","dispatchDiscoveryEvent","PEER_CONNECT_BOOTSTRAP","PEER_CONNECT_PEER_EXCHANGE","setP2PNetworkConnected","setP2PNetworkDisconnected","dispatchWakuConnectionEvent","isPeerTopicConfigured","getPeerShardInfo","isPeerDialableBasedOnBootstrapStatus","some","tagName","isBootstrap","PEER_DISCOVERY_BOOTSTRAP","PEER_DISCOVERY_PEER_EXCHANGE","shardInfoBytes","CONNECTION_STATUS","MetadataCodec","Metadata","libp2pComponents","handshakesConfirmed","registrar","NO_PEER_AVAILABLE","encodedResponse","decodeMetadataResponse","savePeerShardInfo","confirmOrAttemptHandshake","encodedShardInfo","wakuMetadata","pubsubTopicBytes","contentTopicBytes","timestampBytes","bigIntTimestamp","numberToBytes","tryConvertTimestampToBytes","messageHashStr","SubscriptionMonitor","peerIds","isStarted","peerManager","activeSubscriptions","keepAliveIntervalId","pingFailedAttempts","receivedMessagesFormPeer","receivedMessages","verifiedPeers","onConnectionChange","onPeerConnected","onPeerDisconnected","reservedContentTopic","startKeepAlive","startConnectionListener","stopKeepAlive","stopConnectionListener","stopPeerConnectionListener","notifyMessageReceived","buildMessageHash","keepAliveIntervalMs","_event","_peerId","requestRenew","renewOnFirstFail","newPeer","pingsBeforePeerRenewed","Subscription","monitor","subscriptionCallbacks","lightPush","decodersArray","failures","TOPIC_DECODER_MISMATCH","successes","enableLightPushFilterCheck","decodersGroupedByCT","promises","results","allSettled","finalResult","handleResult","subscriptionCallback","processIncomingMessage","decodePromises","dec","decoded","decodedMessage","any","pushMessage","promiseResult","reason","coreResult","Filter","subscription","getActiveSubscription","uniquePubsubTopics","getUniquePubsubTopics","INVALID_DECODER_TOPICS","createSubscription","setActiveSubscription","subscribeWithUnsubscribe","toSubscriptionIterator","receiver","iteratorOptions","isWithTimeout","timeoutMs","startTime","now","toAsyncIterator","TTLSet","ttlMs","cleanupIntervalId","entryTimestamps","cleanupIntervalMs","startCleanupInterval","dispose","intervalMs","removeExpiredEntries","inProgress","peers","peerFailures","callbacks","messageEmitter","toSubscribeContentTopics","toUnsubscribeContentTopics","subscribeIntervalId","allTopics","uniqueTopics","attemptSubscribe","useNewContentTopics","setupSubscriptionInterval","setupKeepAliveInterval","setupEventListeners","disposeEventListeners","disposeIntervals","disposePeers","disposeHandlers","addSingle","removeSingle","attemptUnsubscribe","invoke","isMessageReceived","isNewContentTopic","eventHandler","isCompletelyRemoved","run","peersToReplace","requestUnsubscribe","useOnlyNewPeers","handler","prevPeers","peersToAdd","numPeersToUse","peersToUse","requestSubscribe","successCount","subscriptions","onIncomingMessage","isSamePubsubTopic","topics","HealthIndicator","Unhealthy","onPeerIdentify","toValue","dispatchHealthEvent","filterPeers","lightPushPeers","SufficientlyHealthy","MinimallyHealthy","StatusChange","RetryManager","intervalID","retryIntervalMs","processQueue","maxAttempts","task","scheduleTask","taskExecutor","_err","DEFAULT_SEND_OPTIONS","autoRetry","LightPush","retryManager","TOPIC_NOT_CONFIGURED","coreResults","_e","sendCallback","CONNECTION_LOCK_TAG","PeerManager","onConnected","onDisconnected","getLockedConnections","lockedConnections","neededPeers","newPeerId","getUnlockedConnections","lockConnection","lockPeerIfNeeded","isConnectionLocked","Store","queryGenerator","decodersAsMap","validateDecodersAndPubsubTopic","getPeerToUse","responseGenerator","queryWithOrderedCallback","processMessages","queryWithPromiseCallback","abort","page","_promises","msgPromise","processedMessages","createCursor","uniquePubsubTopicsInQuery","pubsubTopicForQuery","decoderParamsToShardInfo","networkConfig","shardsUnderCluster","isShardCompatible","waitForProtocols","waku","Relay","waitForPeers","store","waitForConnectedPeer","metadataService","awaitTimeout","rejectReason","_resolve","WakuNode","nextFilter","health","_nodeStateLock","_nodeStarted","protocolsEnabled","lightpush","getProtocols","_protocols","codecs","gossipSub","multicodecs","mapToPeerIdOrMultiaddr","getEnabledProtocols","connectedPeers","enabledCodes","protocolToCodec","mapProtocolsToCodecs","every","waitForMetadata","rejectOnTimeout","waitForRemotePeer","singleShardInfo","UnexpectedPeerError","InvalidPublicKeyError","InvalidPrivateKeyError","ConnectionClosingError","ConnectionClosedError","ConnectionFailedError","MuxerClosedError","StreamResetError","StreamStateError","NotFoundError","InvalidPeerIdError","InvalidMultiaddrError","InvalidCIDError","InvalidMultihashError","UnsupportedProtocolError","InvalidMessageError","TimeoutError","NotStartedError","DialError","LimitedConnectionError","TooManyInboundProtocolStreamsError","TooManyOutboundProtocolStreamsError","TAG_MASK","LONG_LENGTH_MASK","LONG_LENGTH_BYTES_MASK","readSequence","readLength","vals","unusedBits","finalOffset","val1","val2","oid","number","encodeNumber","encodeInteger","encodeBitString","encodeSequence","ECDSAPublicKey","jwk","_raw","raw","publicKey","getOID","crv","y","toMultihash","publicKeyToProtobuf","toCID","sig","importKey","namedCurve","hashAndVerify","ECDSAPrivateKey","ext","key_ops","kty","privateKey","signature","hashAndSign","OID_256","OID_384","OID_521","P_256_KEY_JWK","P_384_KEY_JWK","P_521_KEY_JWK","unmarshalECDSAPublicKey","pkiMessageToECDSAPublicKey","coordinates","curve","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","abool","title","numberToHexUnpadded","hexToNumber","ch","hl","al","ai","n1","n2","expectedLength","sum","isPosBig","u8n","u8fr","validatorFns","bigint","function","boolean","stringOrUint8Array","Fp","isValid","validateObject","validators","optValidators","checkField","isOptional","checkVal","memoized","arg","computed","_2n","_3n","_4n","_5n","_8n","power","modulo","pow2","invert","u","FIELD_FIELDS","nLength","nBitLength","_nBitLength","nByteLength","ORDER","bitLen","redef","BYTES","sqrtP","MASK","ZERO","ONE","is0","isOdd","neg","eql","lhs","rhs","sqr","sub","mul","FpPow","div","sqrN","addN","subN","mulN","inv","sqrt","P","p1div4","nv","legendreC","Q","S","Z","Q1div2","g","t2","ge","tonelliShanks","FpSqrt","invertBatch","nums","lastMultiplied","inverted","reduceRight","FpInvertBatch","cmov","fromBytes","getFieldBytesLength","fieldOrder","bitLength","getMinHashLength","constTimeNegate","condition","negate","validateW","W","calcWOpts","scalarBits","maxNumber","windows","windowSize","shiftBy","calcOffsets","wOpts","wbits","nextN","offsetStart","isZero","isNeg","isNegF","offsetF","pointPrecomputes","pointWindowSizes","getW","wNAF","hasPrecomputes","elm","unsafeLadder","precomputeWindow","points","precomputes","wo","wNAFUnsafe","getPrecomputes","transform","comp","wNAFCached","wNAFCachedUnsafe","setWindowSize","fieldN","scalars","validateMSMPoints","validateMSMScalars","buckets","scalar","resI","sumI","validateBasic","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","ed25519","curveDef","CURVE","domain","mapToCurve","validateOpts","prehash","cHash","cofactor","modP","Fn","phflag","aCoordinate","banZero","aextpoint","Point","toAffineMemo","iz","ex","ey","ez","z","ax","ay","zz","assertValidMemo","X","Y","et","T","X2","Y2","Z2","Z4","aX2","toAffine","fromAffine","normalizeZ","toInv","msm","_setWindowSize","wnaf","assertValidity","X1","Y1","Z1","X1Z2","X2Z1","Y1Z2","Y2Z1","x1y1","X3","Y3","T3","Z3","subtract","multiply","CURVE_ORDER","multiplyUnsafe","I","isSmallOrder","isTorsionFree","clearCofactor","normed","lastByte","y2","isXOdd","isLastByteOdd","fromPrivateKey","privKey","getPrivateScalar","toRawBytes","modN","modN_LE","hashed","getExtendedPublicKey","point","pointBytes","hashDomainToScalar","msgs","verifyOpts","getPublicKey","R","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","montgomery","concatKeys","privateKeyRaw","Ed25519PublicKey","ensureEd25519Key","Ed25519PrivateKey","unmarshalEd25519PublicKey","KeyType","__KeyTypeValues","PublicKey","PrivateKey","Data","SigningError","VerificationError","WebCryptoMissingError","win","nativeCrypto","RSAPublicKey","_multihash","webcrypto","RSAPrivateKey","dp","dq","qi","RSA_ALGORITHM_IDENTIFIER","jwkToPkix","pkixMessageToRSAPublicKey","pkixMessageToJwk","RSA","HMAC","_key","iHash","oHash","hmac","validateSigVerOpts","lowS","DERErr","DER","Err","_tlv","dataLen","lenLen","lengthBytes","_int","toSig","tlv","seqBytes","seqLeftBytes","rBytes","rLeftBytes","sBytes","sLeftBytes","hexFromSig","seq","weierstrass","bits2int","bits2int_modN","compressedLen","uncompressedLen","invN","ProjectivePoint","normPrivateKeyToScalar","weierstrassEquation","isWithinCurveOrder","allowedPrivateKeyLengths","wrapPrivateKey","allowInfinityPoint","endo","beta","splitScalar","validatePointOpts","_c","_isCompressed","x2","x3","N","aprjpoint","px","py","pz","hasEvenY","U1","U2","t0","t1","t3","t4","t5","sc","k1neg","k1","k2neg","k2","k1p","k2p","fake","f1p","f2p","multiplyAndAddUnsafe","isCompressed","_bits","weierstrassPoints","cat","sqrtError","suffix","numToNByteHex","isBiggerThanHalfOrder","slcNum","Signature","recovery","fromCompact","fromDER","addRecoveryBit","recoverPublicKey","msgHash","rec","radj","ir","u1","u2","hasHighS","normalizeS","toDERRawBytes","toDERHex","toCompactRawBytes","toCompactHex","isValidPrivateKey","minLen","reduced","mapHashToField","isProbPub","delta","ORDER_MASK","int2octets","defaultSigOpts","defaultVerOpts","privateA","publicB","seed","k2sig","extraEntropy","ent","h1int","seedArgs","kBytes","ik","normS","prepSig","drbg","hashLen","qByteLen","hmacFn","reseed","sl","pred","createHmacDrbg","sg","isHex","isObj","_sig","derError","is","getHash","secp256k1P","secp256k1N","divNearest","Fpk1","_6n","_11n","_22n","_23n","_44n","_88n","b88","b176","b220","b223","secp256k1","defHash","createCurve","POW_2_128","isPromise","finally","Secp256k1PublicKey","validateSecp256k1PublicKey","compressSecp256k1PublicKey","Secp256k1PrivateKey","validateSecp256k1PrivateKey","computeSecp256k1PublicKey","unmarshalSecp256k1PublicKey","generateKeyPair","generateEd25519KeyPair","privateKeyBytes","generateSecp256k1KeyPair","pair","generateKey","modulusLength","publicExponent","exportKey","generateRSAKey","generateRSAKeyPair","toBits","keyPair","generateECDSAKey","generateECDSAKeyPair","toCurve","generateKeyPairFromSeed","generateEd25519KeyPairFromSeed","publicKeyFromProtobuf","pkixToRSAPublicKey","Ed25519","ECDSA","serviceCapabilities","serviceDependencies","PeerIdImpl","RSAPeerId","Ed25519PeerId","Secp256k1PeerId","URLPeerId","url","peerIdFromString","peerIdFromCID","peerIdFromMultihash","peerIdFromPublicKey","isSha256Multihash","isIdentityMultihash","publicKeyFromMultihash","URL","byteStream","readBuffer","abortPromise","unwrap","originalStream","yieldBytes","lpStream","decodeLength","lengthBuffer","writeV","flatMap","piped","NOISE_MSG_MAX_LENGTH_BYTES","DUMP_SESSION_KEYS","exists","copyBytes","wrapCipher","clean","_utf8ToBytes","sigma16","sigma32","sigma16_32","sigma32_32","MAX_COUNTER","U32_EMPTY","createCipher","core","allowShortKeys","extendNonceFn","counterLength","counterRight","rounds","nonce","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","h1","h2","h3","h4","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","encrypt","plaintext","plength","clength","decrypt","ciphertext","passedTag","chacha20poly1305","blockSize","nonceLength","tagLength","HKDF_COUNTER","EMPTY_BUFFER","defaultCrypto","hashSHA256","getHKDF","ck","ikm","prk","salt","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","signaturePayload","webtransportCerthashes","Noise","staticKey","metrics","staticNoiseKey","prologueBytes","_crypto","keypair","wrapCrypto","xxHandshakeSuccesses","registerCounter","help","xxHandshakeErrors","encryptedPackets","decryptedPackets","decryptErrors","registerMetrics","secureOutbound","wrappedConnection","handshake","performHandshakeInitiator","createSecureConnection","remoteExtensions","secureInbound","performHandshakeResponder","xx","trace","receivedPayload","forComponent","secure","user","duplexPair","encryptStream","encrypted","decryptStream","noise","peerDiscoverySymbol","DNS4","DNS6","DNSADDR","IP","TCP","and","UDP","UTP","QUIC","QUICV1","_WebSockets","_WebSocketsSecure","HTTP","HTTPS","_WebRTCDirect","WebRTCDirect","_WebTransport","WebTransport","P2PWebRTCStar","P2PWebRTCDirect","Reliable","_P2P","_Circuit","CircuitRecursive","Circuit","P2P","makeMatchesFunction","partialMatch","matches","pnames","Bootstrap","_init","candidate","peerData","multiaddrs","_discoverBootstrapPeers","tagValue","ttl","tagTTL","openConnection","ENVELOPE_PAYLOAD_TYPE_PEER_RECORD","Envelope","PeerRecord","AddressInfo","multiaddr","addresses","addresses$","peerRecord","seqNumber","DOMAIN","CODEC","marshaled","marshal","localeCompare","arrayEquals","payloadType","InvalidSignatureError","RecordEnvelope","envelopeData","record","signData","formatSignaturePayload","envelope","createFromProtobuf","validate","domainUint8Array","domainLength","payloadTypeLength","payloadLength","NETMASK_RANGES","ipRange","ipv4Check","ipAddr","isPrivateIp","octet34","octet12","ipv4MappedIpv6Check","ipv4EmbeddedIpv6Check","ipv6Check","isPrivate","isIpBased","func","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","defaultValues","AbstractIdentify","started","addressManager","maxOutboundStreams","maxMessageSize","maxObservedAddresses","runOnLimitedConnection","nodeInfo","protocolPrefix","AgentVersion","ProtocolVersion","handleProtocol","unhandle","runOnConnectionOpen","identify","_identify","AbortSignal","close","maybeAddObservedAddress","isCertified","peerRecordEnvelope","openAndCertify","envelopePeer","existingPeer","storedEnvelope","storedRecord","patch","consumeIdentifyMessage","cleanObservedAddr","getCleanMultiaddr","isGlobalUnicast","addObservedAddr","getAddresses","seal","remoteAddr","closeSource","getIterator","createAbortError","clearMethods","defaultClear","defaultSet","milliseconds","timeoutId","settle","rejectFunction","signalListener","delayPromise","createDelay","RateLimitError","remainingPoints","msBeforeNext","consumedPoints","isFirstInDuration","props","QueueFullError","RateLimiter","memoryStorage","duration","blockDuration","execEvenly","execEvenlyMinDelayMs","keyPrefix","MemoryStorage","pointsToConsume","rlKey","getKey","secDuration","_getKeySecDuration","incrby","delayMs","penalty","reward","msDuration","initPoints","customDuration","parseKey","durationSec","existing","msBeforeExpires","expiresAt","durationMs","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","StreamInputBufferError","AbstractStream","direction","readStatus","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","registry","_newStream","_newReceiverStream","maxMsgSize","onStreamEnd","_handleIncoming","onIncomingStream","maxBufferSize","maxStreamBufferSize","Mplex","createStreamMuxer","mplex","PingService","handleMessage","received","transportSymbol","FaultTolerance","ASSUME_HTTP_CODES","extractSNI","extractTuple","extractPort","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","isArrayBuffer","connect","location","wsUrl","httpProto","wsProto","connectedSource","binaryType","connected","connError","cleanUp","cont","onOpen","onError","onMessage","remoteAddress","remotePort","hostname","CONNECTING","OPEN","terminate","websocket","CustomProgressEvent","Event","dialerEvents","registerCounterGroup","label","maConn","metricPrefix","socketToMaConn","_connect","upgrader","upgradeOutbound","cOpts","errorPromise","rawSocket","uri","onProgress","createListener","listenFilter","dialFilter","webSockets","getDOMException","DOMException","getAbortedReason","pTimeout","fallback","customTimers","abortHandler","cancelablePromise","POSITIVE_INFINITY","timeoutError","PriorityQueue","enqueue","element","priority","step","it","lowerBound","setPriority","findIndex","ReferenceError","dequeue","PQueue","carryoverConcurrencyCount","intervalCap","concurrency","autoStart","queueClass","throwOnTimeout","delay","canInitializeInterval","job","newConcurrency","function_","addAll","functions","pause","onSizeLessThan","onIdle","sizeBy","getTypes","DEFAULT_TYPES","RecordType","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","cached","getAnswers","cachedAnswers","expires","cacheSize","tld","dnsaddrCode","RecursionLimitError","dnsaddrResolver","recursionLimit","maxRecursiveDepth","TXT","DefaultConfig","announce","noAnnounce","announceFilter","transportManager","faultTolerance","FATAL_ALL","validateConfig","resultingOptions","connectionProtector","LIBP2P_FORCE_PNET","contentRoutingSymbol","peerRoutingSymbol","fmtLong","isError","toNamespace","regexp","RegExp","setupFormatters","defaultLogger","createDisabledLogger","notEmpty","mapIterable","iter","PeerSet","predicate","intersection","difference","union","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","postMessage","releaseEventListener","releaseEvent","makeWorkerLockRequest","responseEvent","defaultOptions","singleProcess","mutexes","implementation","createReleaseable","Peer","Address","Tag","populatePublicKey","bytesToPeer","maxAddressAge","pbToPeer","expiry","observed","compareOptionalUint8Arrays","arrA","arrB","compareArrays","compare","compareMaps","mapA","mapB","valueB","Peer$metadataEntry","Peer$tagsEntry","updated","tags$value","pathSepS","pathSepB","pathSep","Key","_buf","uint8Array","withNamespaces","asKey","less","list1","list2","baseNamespace","namespaceType","namespaceValue","child","isAncestorOf","isDecendantOf","isTopLevel","NAMESPACE_COMMON","peerIdToDatastoreKey","b32key","dedupeFilterAndSortAddresses","existingAddresses","addressMap","maStr","existingAddr","toPeerPB","strategy","createSortedMap","validateMetadata","validateTag","mapTag","metadataEntries","tagsEntries","mergedTags","addressFilter","peerPB","keyToPeerId","decodePeer","PersistentStore","datastore","lock","maxPeerAge","isWorker","readLock","writeLock","release","masterQueue","readQueue","localReadQueue","readPromise","createMutex","peerPb","filters","orders","mapQuery","put","previous","peerA","peerB","metadataA","metadataB","expired","minAddressObserved","addrs","PersistentPeerStore","consumePeerRecord","expectedPeer","peekable","iterable","sorter","items","BaseDatastore","putMany","getMany","deleteMany","batch","puts","dels","commit","_all","_allKeys","queryKeys","MemoryDatastore","defaultAddressFilter","stripPeerId","observedPeerIdStr","DefaultAddressManager","_updatePeerStoreAddresses","debounce","getAnnounceAddrs","getAddrs","confident","getListenAddrs","getObservedAddrs","confirmObservedAddr","startingConfidence","removeObservedAddr","addrSet","isStartable","MissingServiceError","UnmetServiceDependenciesError","NoContentRoutersError","NoPeerRoutersError","QueriedForSelfError","UnhandledProtocolError","DuplicateProtocolHandlerError","DialDeniedError","NoValidAddressesError","ConnectionInterceptedError","ConnectionDeniedError","MuxerUnavailableError","EncryptionFailedError","TransportUnavailableError","DefaultComponents","_started","_invokeStartableMethod","startable","beforeStart","afterStart","beforeStop","afterStop","OPTIONAL_SERVICES","NON_SERVICE_PROPERTIES","getServiceCapabilities","getServiceDependencies","getServiceName","connectionGater","gater","denyDialPeer","denyDialMultiaddr","denyInboundConnection","denyOutboundConnection","denyInboundEncryptedConnection","denyOutboundEncryptedConnection","denyInboundUpgradedConnection","denyOutboundUpgradedConnection","filterMultiaddrForPeer","PeerMap","getPeerAddress","maPeerIdStr","maPeerId","DEFAULT_CLOSABLE_PROTOCOLS","maxConnections","allow","ConnectionPruner","maybePruneConnections","_maybePruneConnections","numConnections","peerValues","sortedConnections","sortConnections","toPrune","toClose","streamProtocols","closableProtocols","safelyCloseConnectionIfUnused","connectionALifespan","connectionBLifespan","peerAValue","peerBValue","LAST_DIAL_FAILURE_KEY","LAST_DIAL_SUCCESS_KEY","raceEvent","eventName","removeListeners","eventListener","errorEvent","errorEventListener","JobRecipient","Job","recipients","controller","created","recipient","Queue","metricName","registerMetricGroup","calculate","running","tryToStartAnother","toGenerator","onQueueJobComplete","onQueueError","onQueueIdle","onSignalAbort","anySignal","signals","reliableTransportsFirst","isATCP","isBTCP","isAWebSocketSecure","isBWebSocketSecure","isAWebSocket","isBWebSocket","isAWebRTC","isBWebRTC","isAWebRTCDirect","isBWebRTCDirect","isAWebTransport","isBWebTransport","publicAddressesFirst","isAPrivate","isBPrivate","certifiedAddressesFirst","circuitRelayAddressesLast","isACircuit","isBCircuit","DialQueue","addressSorter","maxPeerAddrsToDial","maxDialQueueLength","dialTimeout","shutDownController","peerIdOrMultiaddr","existingConnection","flat","force","existingDial","createDialAbortController","addrsToDial","calculateMultiaddrs","dialed","DEFAULT_DIAL_PRIORITY","userSignal","peerRouting","findPeer","resolvedAddresses","resolveMultiaddrs","peerIdMultiaddr","lastProto","filteredAddrs","dialTransportForMultiaddr","addrPeerId","dedupedAddrs","dedupedMultiaddrs","gatedAdrs","sortedGatedAddrs","isDialable","KEEP_ALIVE","PeerQueue","objectToString","errorMessages","originalError","decorateErrorWithCounts","attemptNumber","retriesLeft","ReconnectQueue","retryInterval","backoffFactor","maxParallelReconnects","maybeReconnect","hasKeepAliveTag","onFailedAttempt","shouldRetry","isNetworkError","finalError","pRetry","keepAlivePeers","DefaultConnectionManager","deny","maxIncomingPendingConnections","incomingPendingConnections","outboundPendingConnections","dialQueue","reconnectQueue","connectionPruner","inboundConnectionRateLimiter","onConnect","onDisconnect","inboundConnectionThreshold","reconnectRetries","reconnectRetryInterval","reconnectBackoffFactor","metric","inbound","outbound","conns","allStreams","objs","startables","tasks","connectionList","_onConnect","isNewPeer","storedConns","filteredPeerConns","getConnectionsMap","peerConnections","trackedConnection","closeConnections","acceptIncomingConnection","afterUpgradeInbound","getDialQueue","statusMap","errored","complete","MovingAverage","movingAverage","variance","deviation","forecast","timeSpan","previousTime","alpha","pt","exp","time","incr","AdaptiveTimeout","timeoutMultiplier","failureMultiplier","getTimeoutSignal","timeoutFactor","sendTimeout","timeoutSignal","failureMovingAverage","failureDeviation","failureForecast","failureVariance","successMovingAverage","successDeviation","successForecast","successVariance","ConnectionMonitor","heartbeatInterval","pingIntervalMs","abortController","abortConnectionOnPingFailure","pingInterval","pingTimeout","bs","rtt","CompoundContentRouting","routers","findProviders","seen","router","provide","Fingerprint","fp","fingerprintSize","fnv","hashV","getRandomInt","Bucket","fingerprint","FNV_PRIMES","FNV_OFFSETS","cachedEncoder","utf8Buffer","fnvPrime","remaining","encodeInto","asUintN","fnv1aEncodeInto","fnv1aUint8Array","fnv1a","numberToBuffer","CuckooFilter","bucketSize","filterSize","rand","swapped","inJ","inK","reliable","MAX_LOAD","optimize","maxItems","errorRate","calculateBucketSize","log2","ScalableCuckooFilter","scale","filterSeries","cuckoo","curSize","DefaultPeerRouting","getClosestPeers","createScalableCuckooFilter","ordered","ops","sourceErr","slotAvailable","resultAvailable","sourceFinished","opErred","valuesAvailable","yieldOrderedValues","ok","yieldUnOrderedValues","parallel","useCache","RandomWalk","walking","walkers","shutdownController","walkController","needNext","walk","startWalk","DefaultRegistrar","topologies","_onDisconnect","_onPeerUpdate","_onPeerIdentify","getHandler","getTopologies","register","topology","unregister","removed","notifyOnLimitedConnection","TrackedMap","registerMetric","updateComponentMetric","deleted","DefaultTransportManager","transports","trackedMap","getTransports","of","getListeners","listenTransportForMultiaddr","couldNotListen","supportedAddrs","NO_FATAL","removeAll","validateMaxDataLength","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","buffers","connectionSymbol","ConnectionImpl","multiplexer","encryption","_close","_abort","_getStreams","getStreams","countStreams","streamCount","DefaultUpgrader","connectionEncrypters","streamMuxers","inboundUpgradeTimeout","outboundUpgradeTimeout","inboundStreamProtocolNegotiationTimeout","outboundStreamProtocolNegotiationTimeout","encrypter","muxer","dials","shouldBlockConnection","denyOperation","upgradeInbound","_performUpgrade","idStr","remotePeerId","encryptedConn","upgradedConn","muxerFactory","cryptoProtocol","trackMultiaddrConnection","protectedConn","skipProtection","protector","protect","skipEncryption","_encryptInbound","_encryptOutbound","multiplexed","_multiplexInbound","_multiplexOutbound","_createConnection","muxedStream","incomingLimit","findIncomingStreamLimit","trackProtocolStream","_onStream","outgoingLimit","findOutgoingStreamLimit","_timeline","Proxy","Reflect","upgraded","__maConnTimeline","muxers","Libp2p","contentRouting","originalDispatch","internalResult","externalResult","defaultComponents","configureComponent","persistentPeerStore","connectionMonitor","peerRouters","contentRouters","peerDiscovery","createService","capability","checkServiceDependencies","component","peerSet","getMultiaddrs","peerKey","isTestEnvironment","DEFAULT_NODE_REQUIREMENTS","USE_ENDOMORPHISM","ShaError","assertJacPoint","JacobianPoint","toAffineBatch","scratch","Z1Z1","Z2Z2","S1","S2","x1b","HH","HHH","P0","normalizeScalar","affinePoint","_WINDOW_SIZE","offset1","offset2","cond1","cond2","invZ","iz1","iz2","iz3","fromCompressedHex","isShort","bytesToNumber","isValidFieldElement","rt","isYOdd","fromUncompressedHex","normalizePrivateKey","fromSignature","normalizeSignature","truncateHash","rinv","numTo32bStr","toHexX","toRawX","aP","bQ","sliceDER","parseDERInt","rBytesLeft","parseDERSignature","HALF","sHex","rHex","sHexL","rHexL","sLen","rLen","_0","_9","POW_2_256","truncateOnly","groupLen","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","multiaddrBytes","decodeMultiaddrs","deleteUndefined","waku2","decodeWaku2","initSigArgs","canonical","recSig","der","recovered","finalizeSig","TransportProtocol","TransportProtocolPerIpVersion","pubKey","ecdsaOid","publicKeyFromRaw","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","QuickLRU","maxAge","onEviction","__oldCache","resize","newSize","removeCount","entriesDescending","entriesAscending","oldCacheSize","callbackFunction","thisArgument","buildResource","serverResolver","recordType","resource","req","Headers","getCacheKey","_TXTcache","_servers","_request","_abortControllers","maxCache","getServers","_getShuffledServers","newServers","setServers","servers","rrType","resolve4","resolve6","resolveTxt","server","DnsOverHttps","resolveTXT","sd","ENRTree","parseAndVerifyRoot","ROOT_PREFIX","rootValues","parseRootValues","decodedPublicKey","signedComponent","signedComponentBuffer","eRoot","txt","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","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","DEFAULT_LOCAL_TAG_NAME","LocalPeerCacheDiscovery","getPeersFromLocalStorage","handleNewPeers","savePeersToLocalStorage","websocketMultiaddr","wsMultiaddr","getWsMultiaddrFromMultiaddrs","localStoragePeers","existingPeerIndex","_peer","storedPeersData","isValidStoredPeer","getPeerDiscoveries","dnsEnrTrees","discoveries","wakuDnsDiscovery","localPeerCache","wakuPeerExchangeDiscovery","defaultLibp2p","hideWebSocketInfo","createLibp2p","filterMultiaddrs","pingMaxInboundStreams","DEFAULT_DISCOVERIES_ENABLED","createLightNode","isAutoSharding","derivePubsubTopicsFromNetworkConfig","libp2pOptions","defaultBootstrap","discovery","bootstrapPeers","createLibp2pAndUpdateOptions","thisArg","_arguments","generator","hashBuffer","sent","trys","Iterator","verb","__generator","_a","fulfilled","rejected","DEFAULT_CONTENT_TOPIC","wakuNodeInstance","getWakuNode","currentPeerId","ProtoChatMessage","sentByMeCountEl","getElementById","receivedMineCountEl","receivedOthersCountEl","peerIdDisplayEl","messageListEl","searchInputEl","sentByMe","receivedMine","receivedOthers","currentMessages","updatePeerIdDisplay","textContent","addMessageToLog","renderMessages","filterText","innerHTML","messagesToRender","searchTerm","senderPeerId","createElement","classList","typeClass","senderPrefix","idText","contentP","senderInfoP","timestampP","toLocaleTimeString","appendChild","getSearchTerm","batchCounter","node_1","currentPeerId_1","sendMessageBatch_1","subscribeToMessages","sendMessageButton","searchButton","searchInput","error_1","_this","messageContent","tempDecodedMessage","chatMessage","error_2","initializeApp"],"sourceRoot":""} \ No newline at end of file diff --git a/dogfooding/style.css b/dogfooding/style.css new file mode 100644 index 0000000..d10d7e8 --- /dev/null +++ b/dogfooding/style.css @@ -0,0 +1,187 @@ +/* General Styles */ +body { + font-family: -apple-system, BlinkMacSystemFont, "Segoe UI", Roboto, Helvetica, Arial, sans-serif; + margin: 0; + background-color: #f4f7f9; + color: #333; + line-height: 1.6; +} + +.app-container { + max-width: 1200px; + margin: 0 auto; + padding: 20px; +} + +header { + background-color: #2c3e50; + color: #ecf0f1; + padding: 20px; + border-radius: 8px; + margin-bottom: 20px; + display: flex; + justify-content: space-between; + align-items: center; +} + +header h1 { + margin: 0; + font-size: 1.8em; +} + +.connection-status span { + font-size: 0.9em; +} + +main { + display: grid; + grid-template-columns: 1fr; + gap: 20px; +} + +section { + background-color: #fff; + padding: 20px; + border-radius: 8px; + box-shadow: 0 2px 4px rgba(0, 0, 0, 0.1); +} + +h2 { + margin-top: 0; + color: #3498db; + border-bottom: 2px solid #ecf0f1; + padding-bottom: 10px; + margin-bottom: 15px; +} + +/* Message Statistics */ +.stats-counters { + display: flex; + justify-content: space-around; + text-align: center; +} + +.counter-value { + display: block; + font-size: 2em; + font-weight: bold; + color: #2980b9; +} + +.counter-label { + font-size: 0.9em; + color: #555; +} + +/* Message Controls */ +.btn { + padding: 10px 15px; + border: none; + border-radius: 5px; + cursor: pointer; + font-size: 1em; + transition: background-color 0.3s ease; +} + +.btn-primary { + background-color: #3498db; + color: white; +} + +.btn-primary:hover { + background-color: #2980b9; +} + +.search-container { + margin-top: 15px; + display: flex; + gap: 10px; +} + +#searchInput { + flex-grow: 1; + padding: 10px; + border: 1px solid #ddd; + border-radius: 5px; + font-size: 0.9em; +} + +/* Message Display */ +.message-list { + max-height: 400px; + overflow-y: auto; + border: 1px solid #ecf0f1; + border-radius: 5px; + padding: 10px; +} + +.message-item { + padding: 10px; + margin-bottom: 8px; + border-radius: 4px; + background-color: #ecf0f1; + font-size: 0.9em; +} + +.message-item.sent { + background-color: #eafaf1; /* Light green for sent */ +} + +.message-item.received-mine { + background-color: #e8f6fd; /* Light blue for received (mine) */ +} + +.message-item.received-other { + background-color: #fdf3e8; /* Light orange for received (other) */ +} + +.message-item p { + margin: 5px 0; +} + +.message-item .timestamp { + font-size: 0.8em; + color: #7f8c8d; + text-align: right; +} + +.message-item .content { + font-weight: 500; +} + +.message-item .sender-info { + font-size: 0.8em; + color: #34495e; +} + +/* Added style for Message ID */ +.message-item .message-id { + font-size: 0.75em; + color: #888; + margin-bottom: 3px; + word-break: break-all; /* Ensure long IDs don't break layout */ +} + +footer { + text-align: center; + margin-top: 30px; + padding-top: 15px; + border-top: 1px solid #ecf0f1; + font-size: 0.9em; + color: #7f8c8d; +} + +/* Responsive Design */ +@media (min-width: 768px) { + main { + grid-template-columns: repeat(2, 1fr); + } + + .message-stats, .message-controls { + grid-column: span 1; + } + + .message-display { + grid-column: span 2; + } +} diff --git a/flush-notes/404.html b/flush-notes/404.html index e07e2d4..01bf26c 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/Yu-SXQVXaeOb1nwsbwY1G/_buildManifest.js b/flush-notes/_next/static/7_t7sEZ2ZJjj9-VhvqfYA/_buildManifest.js similarity index 100% rename from flush-notes/_next/static/Yu-SXQVXaeOb1nwsbwY1G/_buildManifest.js rename to flush-notes/_next/static/7_t7sEZ2ZJjj9-VhvqfYA/_buildManifest.js diff --git a/flush-notes/_next/static/Yu-SXQVXaeOb1nwsbwY1G/_ssgManifest.js b/flush-notes/_next/static/7_t7sEZ2ZJjj9-VhvqfYA/_ssgManifest.js similarity index 100% rename from flush-notes/_next/static/Yu-SXQVXaeOb1nwsbwY1G/_ssgManifest.js rename to flush-notes/_next/static/7_t7sEZ2ZJjj9-VhvqfYA/_ssgManifest.js diff --git a/flush-notes/_next/static/chunks/app/layout-6076b03a814c7003.js b/flush-notes/_next/static/chunks/app/layout-6076b03a814c7003.js deleted file mode 100644 index b04586d..0000000 --- a/flush-notes/_next/static/chunks/app/layout-6076b03a814c7003.js +++ /dev/null @@ -1 +0,0 @@ -(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[185],{5856:function(){},2678:function(){},5819:function(){},4112:function(){},8080:function(t,i,e){Promise.resolve().then(e.bind(e,5685))},5685:function(t,i,e){"use strict";e.r(i),e.d(i,{default:function(){return h}});var n=e(7437),s=e(1654),r=e.n(s),a=e(2265),u=e(7441),l=e(1177),o=e(6309);let c=a.createContext({status:l.c.Initializing,waku:void 0}),d=t=>{let i=a.useRef(),[e,s]=a.useState(l.c.Initializing);return(a.useEffect(()=>{if(i.current)return;let t=t=>{s(t.detail)};return u.H5.addEventListener(u.J9.Status,t),u.H5.init().then(()=>{i.current=u.H5}),()=>{u.H5.removeEventListener(u.J9.Status,t)}},[i,s]),e===l.c.Failed)?(0,n.jsx)(n.Fragment,{children:e}):e!==l.c.Connected?(0,n.jsx)(o.g,{}):(0,n.jsx)(c.Provider,{value:{status:e,waku:i.current},children:t.children})};function h(t){let{children:i}=t;return(0,n.jsxs)("html",{lang:"en",children:[(0,n.jsx)("title",{children:"Share notes"}),(0,n.jsx)("body",{className:r().className,children:(0,n.jsx)(d,{children:i})})]})}e(2489)},6309:function(t,i,e){"use strict";e.d(i,{g:function(){return s}});var n=e(7437);let s=()=>(0,n.jsx)("div",{className:"loading-block",children:(0,n.jsx)("p",{children:"Loading..."})})},1177:function(t,i,e){"use strict";var n,s;e.d(i,{c:function(){return n},m:function(){return r}});let r="/flush-notes/1/note/proto";(s=n||(n={})).Initializing="Initializing...",s.WaitingForPeers="Waiting for peers...",s.Connected="Connected",s.Failed="Failed to initialize(see logs)"},7441:function(t,i,e){"use strict";e.d(i,{H5:function(){return l},J9:function(){return n}});var n,s=e(1177),r=e(8089),a=e(9527);(n||(n={})).Status="status";class u{async init(){if(!this.initialized&&!this.initializing){this.initializing=!0;try{this.emitStatusEvent(s.c.Initializing),this.pubsubTopic=(0,a.L3)(s.m);let t=await (0,r.pq)({defaultBootstrap:!0,contentTopics:[s.m]});await t.start(),this.emitStatusEvent(s.c.WaitingForPeers),await (0,r.gT)(t,[r.Uw.Filter,r.Uw.LightPush,r.Uw.Store]),this.node=t,this.initialized=!0,this.emitStatusEvent(s.c.Connected)}catch(t){console.error("Failed to initialize Waku node:",t),this.emitStatusEvent(s.c.Failed)}this.initializing=!1}}addEventListener(t,i){return this.emitter.addEventListener(t,i)}removeEventListener(t,i){return this.emitter.removeEventListener(t,i)}send(t,i){var e;return this.ensureWakuInitialized(),null===(e=this.node)||void 0===e?void 0:e.lightPush.send(t,i)}async getHistory(t){this.ensureWakuInitialized();let i=[];for await(let e of this.node.store.queryGenerator([t])){let t=await Promise.all(e),n=t.filter(t=>!!t);i=[...i,...n]}return i}async subscribe(t,i){return this.ensureWakuInitialized(),this.node.filter.subscribe(t,i)}emitStatusEvent(t){this.emitter.dispatchEvent(new CustomEvent("status",{detail:t}))}ensureWakuInitialized(){if(!this.initialized){let t="Waku is not initialized.";throw console.log(t),Error(t)}}constructor(){this.emitter=new EventTarget,this.initialized=!1,this.initializing=!1}}let l=new u},2489:function(){},1654:function(t){t.exports={style:{fontFamily:"'__Inter_d65c78', '__Inter_Fallback_d65c78'",fontStyle:"normal"},className:"__className_d65c78"}}},function(t){t.O(0,[948,971,472,744],function(){return t(t.s=8080)}),_N_E=t.O()}]); \ No newline at end of file diff --git a/flush-notes/_next/static/chunks/app/layout-a97ac6a332aeb9a8.js b/flush-notes/_next/static/chunks/app/layout-a97ac6a332aeb9a8.js new file mode 100644 index 0000000..73381af --- /dev/null +++ b/flush-notes/_next/static/chunks/app/layout-a97ac6a332aeb9a8.js @@ -0,0 +1 @@ +(self.webpackChunk_N_E=self.webpackChunk_N_E||[]).push([[185],{5856:function(){},2678:function(){},5819:function(){},4112:function(){},8080:function(t,e,i){Promise.resolve().then(i.bind(i,5685))},5685:function(t,e,i){"use strict";i.r(e),i.d(e,{default:function(){return h}});var n=i(7437),s=i(1654),r=i.n(s),a=i(2265),u=i(7441),l=i(1177),c=i(6309);let o=a.createContext({status:l.c.Initializing,waku:void 0}),d=t=>{let e=a.useRef(),[i,s]=a.useState(l.c.Initializing);return(a.useEffect(()=>{if(e.current)return;let t=t=>{s(t.detail)};return u.H5.addEventListener(u.J9.Status,t),u.H5.init().then(()=>{e.current=u.H5}),()=>{u.H5.removeEventListener(u.J9.Status,t)}},[e,s]),i===l.c.Failed)?(0,n.jsx)(n.Fragment,{children:i}):i!==l.c.Connected?(0,n.jsx)(c.g,{}):(0,n.jsx)(o.Provider,{value:{status:i,waku:e.current},children:t.children})};function h(t){let{children:e}=t;return(0,n.jsxs)("html",{lang:"en",children:[(0,n.jsx)("title",{children:"Share notes"}),(0,n.jsx)("body",{className:r().className,children:(0,n.jsx)(d,{children:e})})]})}i(2489)},6309:function(t,e,i){"use strict";i.d(e,{g:function(){return s}});var n=i(7437);let s=()=>(0,n.jsx)("div",{className:"loading-block",children:(0,n.jsx)("p",{children:"Loading..."})})},1177:function(t,e,i){"use strict";var n,s;i.d(e,{c:function(){return n},m:function(){return r}});let r="/flush-notes/1/note/proto";(s=n||(n={})).Initializing="Initializing...",s.WaitingForPeers="Waiting for peers...",s.Connected="Connected",s.Failed="Failed to initialize(see logs)"},7441:function(t,e,i){"use strict";i.d(e,{H5:function(){return l},J9:function(){return n}});var n,s=i(1177),r=i(8089),a=i(9527);(n||(n={})).Status="status";class u{async init(){if(!this.initialized&&!this.initializing){this.initializing=!0;try{this.emitStatusEvent(s.c.Initializing),this.pubsubTopic=(0,a.L3)(s.m);let t=await (0,r.pq)({defaultBootstrap:!0,contentTopics:[s.m]});await t.start(),this.emitStatusEvent(s.c.WaitingForPeers),await (0,r.gT)(t,[r.Uw.Filter,r.Uw.LightPush,r.Uw.Store]),this.node=t,this.initialized=!0,this.emitStatusEvent(s.c.Connected)}catch(t){console.error("Failed to initialize Waku node:",t),this.emitStatusEvent(s.c.Failed)}this.initializing=!1}}addEventListener(t,e){return this.emitter.addEventListener(t,e)}removeEventListener(t,e){return this.emitter.removeEventListener(t,e)}send(t,e){var i;return this.ensureWakuInitialized(),null===(i=this.node)||void 0===i?void 0:i.lightPush.send(t,e)}async getHistory(t){this.ensureWakuInitialized();let e=[];for await(let i of this.node.store.queryGenerator([t])){let t=await Promise.all(i),n=t.filter(t=>!!t);e=[...e,...n]}return e}async subscribe(t,e){return this.ensureWakuInitialized(),this.node.filter.subscribe(t,e)}emitStatusEvent(t){this.emitter.dispatchEvent(new CustomEvent("status",{detail:t}))}ensureWakuInitialized(){if(!this.initialized){let t="Waku is not initialized.";throw console.log(t),Error(t)}}constructor(){this.emitter=new EventTarget,this.initialized=!1,this.initializing=!1}}let l=new u},2489:function(){},1654:function(t){t.exports={style:{fontFamily:"'__Inter_e8ce0c', '__Inter_Fallback_e8ce0c'",fontStyle:"normal"},className:"__className_e8ce0c"}}},function(t){t.O(0,[948,971,472,744],function(){return t(t.s=8080)}),_N_E=t.O()}]); \ No newline at end of file diff --git a/flush-notes/_next/static/chunks/webpack-72dc84fc1128660e.js b/flush-notes/_next/static/chunks/webpack-efca54bdf6c0c9ab.js similarity index 98% rename from flush-notes/_next/static/chunks/webpack-72dc84fc1128660e.js rename to flush-notes/_next/static/chunks/webpack-efca54bdf6c0c9ab.js index 2236b18..a775f57 100644 --- a/flush-notes/_next/static/chunks/webpack-72dc84fc1128660e.js +++ b/flush-notes/_next/static/chunks/webpack-efca54bdf6c0c9ab.js @@ -1 +1 @@ -!function(){"use strict";var e,t,n,r,o,u,i,c,f,a={},l={};function s(e){var t=l[e];if(void 0!==t)return t.exports;var n=l[e]={exports:{}},r=!0;try{a[e].call(n.exports,n,n.exports,s),r=!1}finally{r&&delete l[e]}return n.exports}s.m=a,s.amdO={},e=[],s.O=function(t,n,r,o){if(n){o=o||0;for(var u=e.length;u>0&&e[u-1][2]>o;u--)e[u]=e[u-1];e[u]=[n,r,o];return}for(var i=1/0,u=0;u=o&&Object.keys(s.O).every(function(e){return s.O[e](n[f])})?n.splice(f--,1):(c=!1,o0&&e[u-1][2]>o;u--)e[u]=e[u-1];e[u]=[n,r,o];return}for(var i=1/0,u=0;u=o&&Object.keys(s.O).every(function(e){return s.O[e](n[f])})?n.splice(f--,1):(c=!1,oShare 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 4a2568b..63592a4 100644 --- a/flush-notes/index.txt +++ b/flush-notes/index.txt @@ -1,7 +1,7 @@ -1:HL["/_next/static/media/a34f9d1faa5f3315-s.p.woff2","font",{"crossOrigin":"","type":"font/woff2"}] -2:HL["/_next/static/css/93e318bfbcd18d37.css","style",{"crossOrigin":""}] -0:["Yu-SXQVXaeOb1nwsbwY1G",[[["",{"children":["__PAGE__",{}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/93e318bfbcd18d37.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] -5:I[5685,["948","static/chunks/948-50bbf5866eb892b4.js","185","static/chunks/app/layout-6076b03a814c7003.js"],""] +1:HL["/_next/static/media/e4af272ccee01ff0-s.p.woff2","font",{"crossOrigin":"","type":"font/woff2"}] +2:HL["/_next/static/css/a61c8a9f0f85bca4.css","style",{"crossOrigin":""}] +0:["7_t7sEZ2ZJjj9-VhvqfYA",[[["",{"children":["__PAGE__",{}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/a61c8a9f0f85bca4.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] +5:I[5685,["948","static/chunks/948-50bbf5866eb892b4.js","185","static/chunks/app/layout-a97ac6a332aeb9a8.js"],""] 6:I[6954,[],""] 7:I[7264,[],""] 9:I[8297,[],""] diff --git a/flush-notes/view.html b/flush-notes/view.html index be0d480..98b9791 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 ed12127..8d9c0a6 100644 --- a/flush-notes/view.txt +++ b/flush-notes/view.txt @@ -1,7 +1,7 @@ -1:HL["/_next/static/media/a34f9d1faa5f3315-s.p.woff2","font",{"crossOrigin":"","type":"font/woff2"}] -2:HL["/_next/static/css/93e318bfbcd18d37.css","style",{"crossOrigin":""}] -0:["Yu-SXQVXaeOb1nwsbwY1G",[[["",{"children":["view",{"children":["__PAGE__",{}]}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/93e318bfbcd18d37.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] -5:I[5685,["948","static/chunks/948-50bbf5866eb892b4.js","185","static/chunks/app/layout-6076b03a814c7003.js"],""] +1:HL["/_next/static/media/e4af272ccee01ff0-s.p.woff2","font",{"crossOrigin":"","type":"font/woff2"}] +2:HL["/_next/static/css/a61c8a9f0f85bca4.css","style",{"crossOrigin":""}] +0:["7_t7sEZ2ZJjj9-VhvqfYA",[[["",{"children":["view",{"children":["__PAGE__",{}]}]},"$undefined","$undefined",true],"$L3",[[["$","link","0",{"rel":"stylesheet","href":"/_next/static/css/a61c8a9f0f85bca4.css","precedence":"next","crossOrigin":""}]],"$L4"]]]] +5:I[5685,["948","static/chunks/948-50bbf5866eb892b4.js","185","static/chunks/app/layout-a97ac6a332aeb9a8.js"],""] 6:I[6954,[],""] 7:I[7264,[],""] 9:I[8297,[],""]