npm - genosdb - Versions diffs - 0.7.2 → 0.8.0 - Mend

genosdb 0.7.2 → 0.8.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (8) hide show

package/dist/gdb.min.js CHANGED Viewed

	@@ -1 +1 @@
1	- function c6(W){const Q=W.length;let J=0,V=0;while(V<Q){let G=W.charCodeAt(V++);if((G&4294967168)===0){J++;continue}else if((G&4294965248)===0)J+=2;else{if(G>=55296&&G<=56319){if(V<Q){const X=W.charCodeAt(V);if((X&64512)===56320)++V,G=((G&1023)<<10)+(X&1023)+65536}}if((G&4294901760)===0)J+=3;else J+=4}}return J}function SW(W,Q,J){const V=W.length;let G=J,X=0;while(X<V){let q=W.charCodeAt(X++);if((q&4294967168)===0){Q[G++]=q;continue}else if((q&4294965248)===0)Q[G++]=q>>6&31\|192;else{if(q>=55296&&q<=56319){if(X<V){const Y=W.charCodeAt(X);if((Y&64512)===56320)++X,q=((q&1023)<<10)+(Y&1023)+65536}}if((q&4294901760)===0)Q[G++]=q>>12&15\|224,Q[G++]=q>>6&63\|128;else Q[G++]=q>>18&7\|240,Q[G++]=q>>12&63\|128,Q[G++]=q>>6&63\|128}Q[G++]=q&63\|128}}function TW(W,Q,J){vW.encodeInto(W,Q.subarray(J))}function l6(W,Q,J){if(W.length>AW)TW(W,Q,J);else SW(W,Q,J)}function v8(W,Q,J){let V=Q;const G=V+J,X=[];let q="";while(V<G){const Y=W[V++];if((Y&128)===0)X.push(Y);else if((Y&224)===192){const F=W[V++]&63;X.push((Y&31)<<6\|F)}else if((Y&240)===224){const F=W[V++]&63,U=W[V++]&63;X.push((Y&31)<<12\|F<<6\|U)}else if((Y&248)===240){const F=W[V++]&63,U=W[V++]&63,P=W[V++]&63;let H=(Y&7)<<18\|F<<12\|U<<6\|P;if(H>65535)H-=65536,X.push(H>>>10&1023\|55296),H=56320\|H&1023;X.push(H)}else X.push(Y);if(X.length>=gW)q+=String.fromCharCode(...X),X.length=0}if(X.length>0)q+=String.fromCharCode(...X);return q}function pW(W,Q,J){const V=W.subarray(Q,Q+J);return EW.decode(V)}function i6(W,Q,J){if(J>yW)return pW(W,Q,J);else return v8(W,Q,J)}var vW=new TextEncoder,AW=50,gW=4096,EW=new TextDecoder,yW=200;class t0{constructor(W,Q){this.type=W,this.data=Q}}class V0 extends Error{constructor(W){super(W);const Q=Object.create(V0.prototype);Object.setPrototypeOf(this,Q),Object.defineProperty(this,"name",{configurable:!0,enumerable:!1,value:V0.name})}}function r6(W,Q,J){const V=J/4294967296,G=J;W.setUint32(Q,V),W.setUint32(Q+4,G)}function n1(W,Q,J){const V=Math.floor(J/4294967296),G=J;W.setUint32(Q,V),W.setUint32(Q+4,G)}function o1(W,Q){const J=W.getInt32(Q),V=W.getUint32(Q+4);return J4294967296+V}function n6(W,Q){const J=W.getUint32(Q),V=W.getUint32(Q+4);return J4294967296+V}var W1=4294967295;function uW({sec:W,nsec:Q}){if(W>=0&&Q>=0&&W<=hW)if(Q===0&&W<=bW){const J=new Uint8Array(4);return new DataView(J.buffer).setUint32(0,W),J}else{const J=W/4294967296,V=W&4294967295,G=new Uint8Array(8),X=new DataView(G.buffer);return X.setUint32(0,Q<<2\|J&3),X.setUint32(4,V),G}else{const J=new Uint8Array(12),V=new DataView(J.buffer);return V.setUint32(0,Q),n1(V,4,W),J}}function mW(W){const Q=W.getTime(),J=Math.floor(Q/1000),V=(Q-J1000)1e6,G=Math.floor(V/1e9);return{sec:J+G,nsec:V-G1e9}}function _W(W){if(W instanceof Date){const Q=mW(W);return uW(Q)}else return null}function dW(W){const Q=new DataView(W.buffer,W.byteOffset,W.byteLength);switch(W.byteLength){case 4:return{sec:Q.getUint32(0),nsec:0};case 8:{const J=Q.getUint32(0),V=Q.getUint32(4),G=(J&3)4294967296+V,X=J>>>2;return{sec:G,nsec:X}}case 12:{const J=o1(Q,4),V=Q.getUint32(0);return{sec:J,nsec:V}}default:throw new V0(`Unrecognized data size for timestamp (expected 4, 8, or 12): ${W.length}`)}}function cW(W){const Q=dW(W);return new Date(Q.sec1000+Q.nsec/1e6)}var fW=-1,bW=4294967295,hW=17179869183,o6={type:fW,encode:_W,decode:cW};class b0{constructor(){this.builtInEncoders=[],this.builtInDecoders=[],this.encoders=[],this.decoders=[],this.register(o6)}register({type:W,encode:Q,decode:J}){if(W>=0)this.encoders[W]=Q,this.decoders[W]=J;else{const V=-1-W;this.builtInEncoders[V]=Q,this.builtInDecoders[V]=J}}tryToEncode(W,Q){for(let J=0;J<this.builtInEncoders.length;J++){const V=this.builtInEncoders[J];if(V!=null){const G=V(W,Q);if(G!=null){const X=-1-J;return new t0(X,G)}}}for(let J=0;J<this.encoders.length;J++){const V=this.encoders[J];if(V!=null){const G=V(W,Q);if(G!=null)return new t0(J,G)}}if(W instanceof t0)return W;return null}decode(W,Q,J){const V=Q<0?this.builtInDecoders[-1-Q]:this.decoders[Q];if(V)return V(W,Q,J);else return new t0(Q,W)}}b0.defaultCodec=new b0;var lW=function(W){return W instanceof ArrayBuffer\|\|typeof SharedArrayBuffer!=="undefined"&&W instanceof SharedArrayBuffer};function M1(W){if(W instanceof Uint8Array)return W;else if(ArrayBuffer.isView(W))return new Uint8Array(W.buffer,W.byteOffset,W.byteLength);else if(lW(W))return new Uint8Array(W);else return Uint8Array.from(W)}var iW=100,rW=2048;class a1{constructor(W){this.entered=!1,this.extensionCodec=W?.extensionCodec??b0.defaultCodec,this.context=W?.context,this.useBigInt64=W?.useBigInt64??!1,this.maxDepth=W?.maxDepth??iW,this.initialBufferSize=W?.initialBufferSize??rW,this.sortKeys=W?.sortKeys??!1,this.forceFloat32=W?.forceFloat32??!1,this.ignoreUndefined=W?.ignoreUndefined??!1,this.forceIntegerToFloat=W?.forceIntegerToFloat??!1,this.pos=0,this.view=new DataView(new ArrayBuffer(this.initialBufferSize)),this.bytes=new Uint8Array(this.view.buffer)}clone(){return new a1({extensionCodec:this.extensionCodec,context:this.context,useBigInt64:this.useBigInt64,maxDepth:this.maxDepth,initialBufferSize:this.initialBufferSize,sortKeys:this.sortKeys,forceFloat32:this.forceFloat32,ignoreUndefined:this.ignoreUndefined,forceIntegerToFloat:this.forceIntegerToFloat})}reinitializeState(){this.pos=0}encodeSharedRef(W){if(this.entered)return this.clone().encodeSharedRef(W);try{return this.entered=!0,this.reinitializeState(),this.doEncode(W,1),this.bytes.subarray(0,this.pos)}finally{this.entered=!1}}encode(W){if(this.entered)return this.clone().encode(W);try{return this.entered=!0,this.reinitializeState(),this.doEncode(W,1),this.bytes.slice(0,this.pos)}finally{this.entered=!1}}doEncode(W,Q){if(Q>this.maxDepth)throw new Error(`Too deep objects in depth ${Q}`);if(W==null)this.encodeNil();else if(typeof W==="boolean")this.encodeBoolean(W);else if(typeof W==="number")if(!this.forceIntegerToFloat)this.encodeNumber(W);else this.encodeNumberAsFloat(W);else if(typeof W==="string")this.encodeString(W);else if(this.useBigInt64&&typeof W==="bigint")this.encodeBigInt64(W);else this.encodeObject(W,Q)}ensureBufferSizeToWrite(W){const Q=this.pos+W;if(this.view.byteLength<Q)this.resizeBuffer(Q2)}resizeBuffer(W){const Q=new ArrayBuffer(W),J=new Uint8Array(Q),V=new DataView(Q);J.set(this.bytes),this.view=V,this.bytes=J}encodeNil(){this.writeU8(192)}encodeBoolean(W){if(W===!1)this.writeU8(194);else this.writeU8(195)}encodeNumber(W){if(!this.forceIntegerToFloat&&Number.isSafeInteger(W))if(W>=0)if(W<128)this.writeU8(W);else if(W<256)this.writeU8(204),this.writeU8(W);else if(W<65536)this.writeU8(205),this.writeU16(W);else if(W<4294967296)this.writeU8(206),this.writeU32(W);else if(!this.useBigInt64)this.writeU8(207),this.writeU64(W);else this.encodeNumberAsFloat(W);else if(W>=-32)this.writeU8(224\|W+32);else if(W>=-128)this.writeU8(208),this.writeI8(W);else if(W>=-32768)this.writeU8(209),this.writeI16(W);else if(W>=-2147483648)this.writeU8(210),this.writeI32(W);else if(!this.useBigInt64)this.writeU8(211),this.writeI64(W);else this.encodeNumberAsFloat(W);else this.encodeNumberAsFloat(W)}encodeNumberAsFloat(W){if(this.forceFloat32)this.writeU8(202),this.writeF32(W);else this.writeU8(203),this.writeF64(W)}encodeBigInt64(W){if(W>=BigInt(0))this.writeU8(207),this.writeBigUint64(W);else this.writeU8(211),this.writeBigInt64(W)}writeStringHeader(W){if(W<32)this.writeU8(160+W);else if(W<256)this.writeU8(217),this.writeU8(W);else if(W<65536)this.writeU8(218),this.writeU16(W);else if(W<4294967296)this.writeU8(219),this.writeU32(W);else throw new Error(`Too long string: ${W} bytes in UTF-8`)}encodeString(W){const J=c6(W);this.ensureBufferSizeToWrite(5+J),this.writeStringHeader(J),l6(W,this.bytes,this.pos),this.pos+=J}encodeObject(W,Q){const J=this.extensionCodec.tryToEncode(W,this.context);if(J!=null)this.encodeExtension(J);else if(Array.isArray(W))this.encodeArray(W,Q);else if(ArrayBuffer.isView(W))this.encodeBinary(W);else if(typeof W==="object")this.encodeMap(W,Q);else throw new Error(`Unrecognized object: ${Object.prototype.toString.apply(W)}`)}encodeBinary(W){const Q=W.byteLength;if(Q<256)this.writeU8(196),this.writeU8(Q);else if(Q<65536)this.writeU8(197),this.writeU16(Q);else if(Q<4294967296)this.writeU8(198),this.writeU32(Q);else throw new Error(`Too large binary: ${Q}`);const J=M1(W);this.writeU8a(J)}encodeArray(W,Q){const J=W.length;if(J<16)this.writeU8(144+J);else if(J<65536)this.writeU8(220),this.writeU16(J);else if(J<4294967296)this.writeU8(221),this.writeU32(J);else throw new Error(`Too large array: ${J}`);for(let V of W)this.doEncode(V,Q+1)}countWithoutUndefined(W,Q){let J=0;for(let V of Q)if(W[V]!==void 0)J++;return J}encodeMap(W,Q){const J=Object.keys(W);if(this.sortKeys)J.sort();const V=this.ignoreUndefined?this.countWithoutUndefined(W,J):J.length;if(V<16)this.writeU8(128+V);else if(V<65536)this.writeU8(222),this.writeU16(V);else if(V<4294967296)this.writeU8(223),this.writeU32(V);else throw new Error(`Too large map object: ${V}`);for(let G of J){const X=W[G];if(!(this.ignoreUndefined&&X===void 0))this.encodeString(G),this.doEncode(X,Q+1)}}encodeExtension(W){if(typeof W.data==="function"){const J=W.data(this.pos+6),V=J.length;if(V>=4294967296)throw new Error(`Too large extension object: ${V}`);this.writeU8(201),this.writeU32(V),this.writeI8(W.type),this.writeU8a(J);return}const Q=W.data.length;if(Q===1)this.writeU8(212);else if(Q===2)this.writeU8(213);else if(Q===4)this.writeU8(214);else if(Q===8)this.writeU8(215);else if(Q===16)this.writeU8(216);else if(Q<256)this.writeU8(199),this.writeU8(Q);else if(Q<65536)this.writeU8(200),this.writeU16(Q);else if(Q<4294967296)this.writeU8(201),this.writeU32(Q);else throw new Error(`Too large extension object: ${Q}`);this.writeI8(W.type),this.writeU8a(W.data)}writeU8(W){this.ensureBufferSizeToWrite(1),this.view.setUint8(this.pos,W),this.pos++}writeU8a(W){const Q=W.length;this.ensureBufferSizeToWrite(Q),this.bytes.set(W,this.pos),this.pos+=Q}writeI8(W){this.ensureBufferSizeToWrite(1),this.view.setInt8(this.pos,W),this.pos++}writeU16(W){this.ensureBufferSizeToWrite(2),this.view.setUint16(this.pos,W),this.pos+=2}writeI16(W){this.ensureBufferSizeToWrite(2),this.view.setInt16(this.pos,W),this.pos+=2}writeU32(W){this.ensureBufferSizeToWrite(4),this.view.setUint32(this.pos,W),this.pos+=4}writeI32(W){this.ensureBufferSizeToWrite(4),this.view.setInt32(this.pos,W),this.pos+=4}writeF32(W){this.ensureBufferSizeToWrite(4),this.view.setFloat32(this.pos,W),this.pos+=4}writeF64(W){this.ensureBufferSizeToWrite(8),this.view.setFloat64(this.pos,W),this.pos+=8}writeU64(W){this.ensureBufferSizeToWrite(8),r6(this.view,this.pos,W),this.pos+=8}writeI64(W){this.ensureBufferSizeToWrite(8),n1(this.view,this.pos,W),this.pos+=8}writeBigUint64(W){this.ensureBufferSizeToWrite(8),this.view.setBigUint64(this.pos,W),this.pos+=8}writeBigInt64(W){this.ensureBufferSizeToWrite(8),this.view.setBigInt64(this.pos,W),this.pos+=8}}function v0(W,Q){return new a1(Q).encodeSharedRef(W)}function s1(W){return`${W<0?"-":""}0x${Math.abs(W).toString(16).padStart(2,"0")}`}var nW=16,oW=16;class A8{constructor(W=nW,Q=oW){this.hit=0,this.miss=0,this.maxKeyLength=W,this.maxLengthPerKey=Q,this.caches=[];for(let J=0;J<this.maxKeyLength;J++)this.caches.push([])}canBeCached(W){return W>0&&W<=this.maxKeyLength}find(W,Q,J){const V=this.caches[J-1];W:for(let G of V){const X=G.bytes;for(let q=0;q<J;q++)if(X[q]!==W[Q+q])continue W;return G.str}return null}store(W,Q){const J=this.caches[W.length-1],V={bytes:W,str:Q};if(J.length>=this.maxLengthPerKey)J[Math.random()J.length\|0]=V;else J.push(V)}decode(W,Q,J){const V=this.find(W,Q,J);if(V!=null)return this.hit++,V;this.miss++;const G=v8(W,Q,J),X=Uint8Array.prototype.slice.call(W,Q,Q+J);return this.store(X,G),G}}var T8="array",L1="map_key",s6="map_value",aW=(W)=>{if(typeof W==="string"\|\|typeof W==="number")return W;throw new V0("The type of key must be string or number but "+typeof W)};class e6{constructor(){this.stack=[],this.stackHeadPosition=-1}get length(){return this.stackHeadPosition+1}top(){return this.stack[this.stackHeadPosition]}pushArrayState(W){const Q=this.getUninitializedStateFromPool();Q.type=T8,Q.position=0,Q.size=W,Q.array=new Array(W)}pushMapState(W){const Q=this.getUninitializedStateFromPool();Q.type=L1,Q.readCount=0,Q.size=W,Q.map={}}getUninitializedStateFromPool(){if(this.stackHeadPosition++,this.stackHeadPosition===this.stack.length){const W={type:void 0,size:0,array:void 0,position:0,readCount:0,map:void 0,key:null};this.stack.push(W)}return this.stack[this.stackHeadPosition]}release(W){if(this.stack[this.stackHeadPosition]!==W)throw new Error("Invalid stack state. Released state is not on top of the stack.");if(W.type===T8){const J=W;J.size=0,J.array=void 0,J.position=0,J.type=void 0}if(W.type===L1\|\|W.type===s6){const J=W;J.size=0,J.map=void 0,J.readCount=0,J.type=void 0}this.stackHeadPosition--}reset(){this.stack.length=0,this.stackHeadPosition=-1}}var R1=-1,g8=new DataView(new ArrayBuffer(0)),sW=new Uint8Array(g8.buffer);try{g8.getInt8(0)}catch(W){if(!(W instanceof RangeError))throw new Error("This module is not supported in the current JavaScript engine because DataView does not throw RangeError on out-of-bounds access")}var a6=new RangeError("Insufficient data"),eW=new A8;class e1{constructor(W){this.totalPos=0,this.pos=0,this.view=g8,this.bytes=sW,this.headByte=R1,this.stack=new e6,this.entered=!1,this.extensionCodec=W?.extensionCodec??b0.defaultCodec,this.context=W?.context,this.useBigInt64=W?.useBigInt64??!1,this.rawStrings=W?.rawStrings??!1,this.maxStrLength=W?.maxStrLength??W1,this.maxBinLength=W?.maxBinLength??W1,this.maxArrayLength=W?.maxArrayLength??W1,this.maxMapLength=W?.maxMapLength??W1,this.maxExtLength=W?.maxExtLength??W1,this.keyDecoder=W?.keyDecoder!==void 0?W.keyDecoder:eW,this.mapKeyConverter=W?.mapKeyConverter??aW}clone(){return new e1({extensionCodec:this.extensionCodec,context:this.context,useBigInt64:this.useBigInt64,rawStrings:this.rawStrings,maxStrLength:this.maxStrLength,maxBinLength:this.maxBinLength,maxArrayLength:this.maxArrayLength,maxMapLength:this.maxMapLength,maxExtLength:this.maxExtLength,keyDecoder:this.keyDecoder})}reinitializeState(){this.totalPos=0,this.headByte=R1,this.stack.reset()}setBuffer(W){const Q=M1(W);this.bytes=Q,this.view=new DataView(Q.buffer,Q.byteOffset,Q.byteLength),this.pos=0}appendBuffer(W){if(this.headByte===R1&&!this.hasRemaining(1))this.setBuffer(W);else{const Q=this.bytes.subarray(this.pos),J=M1(W),V=new Uint8Array(Q.length+J.length);V.set(Q),V.set(J,Q.length),this.setBuffer(V)}}hasRemaining(W){return this.view.byteLength-this.pos>=W}createExtraByteError(W){const{view:Q,pos:J}=this;return new RangeError(`Extra ${Q.byteLength-J} of ${Q.byteLength} byte(s) found at buffer[${W}]`)}decode(W){if(this.entered)return this.clone().decode(W);try{this.entered=!0,this.reinitializeState(),this.setBuffer(W);const Q=this.doDecodeSync();if(this.hasRemaining(1))throw this.createExtraByteError(this.pos);return Q}finally{this.entered=!1}}decodeMulti(W){if(this.entered){yieldthis.clone().decodeMulti(W);return}try{this.entered=!0,this.reinitializeState(),this.setBuffer(W);while(this.hasRemaining(1))yield this.doDecodeSync()}finally{this.entered=!1}}async decodeAsync(W){if(this.entered)return this.clone().decodeAsync(W);try{this.entered=!0;let Q=!1,J;for await(let q of W){if(Q)throw this.entered=!1,this.createExtraByteError(this.totalPos);this.appendBuffer(q);try{J=this.doDecodeSync(),Q=!0}catch(Y){if(!(Y instanceof RangeError))throw Y}this.totalPos+=this.pos}if(Q){if(this.hasRemaining(1))throw this.createExtraByteError(this.totalPos);return J}const{headByte:V,pos:G,totalPos:X}=this;throw new RangeError(`Insufficient data in parsing ${s1(V)} at ${X} (${G} in the current buffer)`)}finally{this.entered=!1}}decodeArrayStream(W){return this.decodeMultiAsync(W,!0)}decodeStream(W){return this.decodeMultiAsync(W,!1)}asyncdecodeMultiAsync(W,Q){if(this.entered){yieldthis.clone().decodeMultiAsync(W,Q);return}try{this.entered=!0;let J=Q,V=-1;for await(let G of W){if(Q&&V===0)throw this.createExtraByteError(this.totalPos);if(this.appendBuffer(G),J)V=this.readArraySize(),J=!1,this.complete();try{while(!0)if(yield this.doDecodeSync(),--V===0)break}catch(X){if(!(X instanceof RangeError))throw X}this.totalPos+=this.pos}}finally{this.entered=!1}}doDecodeSync(){W:while(!0){const W=this.readHeadByte();let Q;if(W>=224)Q=W-256;else if(W<192)if(W<128)Q=W;else if(W<144){const V=W-128;if(V!==0){this.pushMapState(V),this.complete();continue W}else Q={}}else if(W<160){const V=W-144;if(V!==0){this.pushArrayState(V),this.complete();continue W}else Q=[]}else{const V=W-160;Q=this.decodeString(V,0)}else if(W===192)Q=null;else if(W===194)Q=!1;else if(W===195)Q=!0;else if(W===202)Q=this.readF32();else if(W===203)Q=this.readF64();else if(W===204)Q=this.readU8();else if(W===205)Q=this.readU16();else if(W===206)Q=this.readU32();else if(W===207)if(this.useBigInt64)Q=this.readU64AsBigInt();else Q=this.readU64();else if(W===208)Q=this.readI8();else if(W===209)Q=this.readI16();else if(W===210)Q=this.readI32();else if(W===211)if(this.useBigInt64)Q=this.readI64AsBigInt();else Q=this.readI64();else if(W===217){const V=this.lookU8();Q=this.decodeString(V,1)}else if(W===218){const V=this.lookU16();Q=this.decodeString(V,2)}else if(W===219){const V=this.lookU32();Q=this.decodeString(V,4)}else if(W===220){const V=this.readU16();if(V!==0){this.pushArrayState(V),this.complete();continue W}else Q=[]}else if(W===221){const V=this.readU32();if(V!==0){this.pushArrayState(V),this.complete();continue W}else Q=[]}else if(W===222){const V=this.readU16();if(V!==0){this.pushMapState(V),this.complete();continue W}else Q={}}else if(W===223){const V=this.readU32();if(V!==0){this.pushMapState(V),this.complete();continue W}else Q={}}else if(W===196){const V=this.lookU8();Q=this.decodeBinary(V,1)}else if(W===197){const V=this.lookU16();Q=this.decodeBinary(V,2)}else if(W===198){const V=this.lookU32();Q=this.decodeBinary(V,4)}else if(W===212)Q=this.decodeExtension(1,0);else if(W===213)Q=this.decodeExtension(2,0);else if(W===214)Q=this.decodeExtension(4,0);else if(W===215)Q=this.decodeExtension(8,0);else if(W===216)Q=this.decodeExtension(16,0);else if(W===199){const V=this.lookU8();Q=this.decodeExtension(V,1)}else if(W===200){const V=this.lookU16();Q=this.decodeExtension(V,2)}else if(W===201){const V=this.lookU32();Q=this.decodeExtension(V,4)}else throw new V0(`Unrecognized type byte: ${s1(W)}`);this.complete();const J=this.stack;while(J.length>0){const V=J.top();if(V.type===T8)if(V.array[V.position]=Q,V.position++,V.position===V.size)Q=V.array,J.release(V);else continue W;else if(V.type===L1){if(Q==="__proto__")throw new V0("The key __proto__ is not allowed");V.key=this.mapKeyConverter(Q),V.type=s6;continue W}else if(V.map[V.key]=Q,V.readCount++,V.readCount===V.size)Q=V.map,J.release(V);else{V.key=null,V.type=L1;continue W}}return Q}}readHeadByte(){if(this.headByte===R1)this.headByte=this.readU8();return this.headByte}complete(){this.headByte=R1}readArraySize(){const W=this.readHeadByte();switch(W){case 220:return this.readU16();case 221:return this.readU32();default:if(W<160)return W-144;else throw new V0(`Unrecognized array type byte: ${s1(W)}`)}}pushMapState(W){if(W>this.maxMapLength)throw new V0(`Max length exceeded: map length (${W}) > maxMapLengthLength (${this.maxMapLength})`);this.stack.pushMapState(W)}pushArrayState(W){if(W>this.maxArrayLength)throw new V0(`Max length exceeded: array length (${W}) > maxArrayLength (${this.maxArrayLength})`);this.stack.pushArrayState(W)}decodeString(W,Q){if(!this.rawStrings\|\|this.stateIsMapKey())return this.decodeUtf8String(W,Q);return this.decodeBinary(W,Q)}decodeUtf8String(W,Q){if(W>this.maxStrLength)throw new V0(`Max length exceeded: UTF-8 byte length (${W}) > maxStrLength (${this.maxStrLength})`);if(this.bytes.byteLength<this.pos+Q+W)throw a6;const J=this.pos+Q;let V;if(this.stateIsMapKey()&&this.keyDecoder?.canBeCached(W))V=this.keyDecoder.decode(this.bytes,J,W);else V=i6(this.bytes,J,W);return this.pos+=Q+W,V}stateIsMapKey(){if(this.stack.length>0)return this.stack.top().type===L1;return!1}decodeBinary(W,Q){if(W>this.maxBinLength)throw new V0(`Max length exceeded: bin length (${W}) > maxBinLength (${this.maxBinLength})`);if(!this.hasRemaining(W+Q))throw a6;const J=this.pos+Q,V=this.bytes.subarray(J,J+W);return this.pos+=Q+W,V}decodeExtension(W,Q){if(W>this.maxExtLength)throw new V0(`Max length exceeded: ext length (${W}) > maxExtLength (${this.maxExtLength})`);const J=this.view.getInt8(this.pos+Q),V=this.decodeBinary(W,Q+1);return this.extensionCodec.decode(V,J,this.context)}lookU8(){return this.view.getUint8(this.pos)}lookU16(){return this.view.getUint16(this.pos)}lookU32(){return this.view.getUint32(this.pos)}readU8(){const W=this.view.getUint8(this.pos);return this.pos++,W}readI8(){const W=this.view.getInt8(this.pos);return this.pos++,W}readU16(){const W=this.view.getUint16(this.pos);return this.pos+=2,W}readI16(){const W=this.view.getInt16(this.pos);return this.pos+=2,W}readU32(){const W=this.view.getUint32(this.pos);return this.pos+=4,W}readI32(){const W=this.view.getInt32(this.pos);return this.pos+=4,W}readU64(){const W=n6(this.view,this.pos);return this.pos+=8,W}readI64(){const W=o1(this.view,this.pos);return this.pos+=8,W}readU64AsBigInt(){const W=this.view.getBigUint64(this.pos);return this.pos+=8,W}readI64AsBigInt(){const W=this.view.getBigInt64(this.pos);return this.pos+=8,W}readF32(){const W=this.view.getFloat32(this.pos);return this.pos+=4,W}readF64(){const W=this.view.getFloat64(this.pos);return this.pos+=8,W}}function t1(W,Q){return new e1(Q).decode(W)}var Y1=function(W){let Q=W.length;while(--Q>=0)W[Q]=0},y8=function(W,Q,J,V,G){this.static_tree=W,this.extra_bits=Q,this.extra_base=J,this.elems=V,this.max_length=G,this.has_stree=W&&W.length},p8=function(W,Q){this.dyn_tree=W,this.max_code=0,this.stat_desc=Q},$0=function(W,Q,J,V,G){this.good_length=W,this.max_lazy=Q,this.nice_length=J,this.max_chain=V,this.func=G},W9=function(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=P8,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(lJ2),this.dyn_dtree=new Uint16Array((2dJ+1)2),this.bl_tree=new Uint16Array((2cJ+1)2),A0(this.dyn_ltree),A0(this.dyn_dtree),A0(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(iJ+1),this.heap=new Uint16Array(2s8+1),A0(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(2s8+1),A0(this.depth),this.sym_buf=0,this.lit_bufsize=0,this.sym_next=0,this.sym_end=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0},L9=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0},h1=function(W){this.options=K8.assign({level:N9,method:v9,chunkSize:16384,windowBits:15,memLevel:8,strategy:S9},W\|\|{});let Q=this.options;if(Q.raw&&Q.windowBits>0)Q.windowBits=-Q.windowBits;else if(Q.gzip&&Q.windowBits>0&&Q.windowBits<16)Q.windowBits+=16;this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new G7,this.strm.avail_out=0;let J=w1.deflateInit2(this.strm,Q.level,Q.method,Q.windowBits,Q.memLevel,Q.strategy);if(J!==q8)throw new Error(_0[J]);if(Q.header)w1.deflateSetHeader(this.strm,Q.header);if(Q.dictionary){let V;if(typeof Q.dictionary==="string")V=y1.string2buf(Q.dictionary);else if(X7.call(Q.dictionary)==="[object ArrayBuffer]")V=new Uint8Array(Q.dictionary);else V=Q.dictionary;if(J=w1.deflateSetDictionary(this.strm,V),J!==q8)throw new Error(_0[J]);this._dict_set=!0}},U6=function(W,Q){const J=new h1(Q);if(J.push(W,!0),J.err)throw J.msg\|\|_0[J.err];return J.result},A9=function(W,Q){return Q=Q\|\|{},Q.raw=!0,U6(W,Q)},T9=function(W,Q){return Q=Q\|\|{},Q.gzip=!0,U6(W,Q)},JQ=function(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0},CQ=function(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name="",this.comment="",this.hcrc=0,this.done=!1},u1=function(W){this.options=K8.assign({chunkSize:65536,windowBits:15,to:""},W\|\|{});const Q=this.options;if(Q.raw&&Q.windowBits>=0&&Q.windowBits<16){if(Q.windowBits=-Q.windowBits,Q.windowBits===0)Q.windowBits=-15}if(Q.windowBits>=0&&Q.windowBits<16&&!(W&&W.windowBits))Q.windowBits+=32;if(Q.windowBits>15&&Q.windowBits<48){if((Q.windowBits&15)===0)Q.windowBits\|=15}this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new G7,this.strm.avail_out=0;let J=O0.inflateInit2(this.strm,Q.windowBits);if(J!==p1)throw new Error(_0[J]);if(this.header=new BQ,O0.inflateGetHeader(this.strm,this.header),Q.dictionary){if(typeof Q.dictionary==="string")Q.dictionary=y1.string2buf(Q.dictionary);else if(j7.call(Q.dictionary)==="[object ArrayBuffer]")Q.dictionary=new Uint8Array(Q.dictionary);if(Q.raw){if(J=O0.inflateSetDictionary(this.strm,Q.dictionary),J!==p1)throw new Error(_0[J])}}},P6=function(W,Q){const J=new u1(Q);if(J.push(W),J.err)throw J.msg\|\|_0[J.err];return J.result},OQ=function(W,Q){return Q=Q\|\|{},Q.raw=!0,P6(W,Q)};/! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) /var tW=0,f5=1,WJ=2,JJ=3,QJ=258,V6=29,f1=256,S1=f1+1+V6,V1=30,G6=19,b5=2S1+1,h0=15,E8=16,VJ=7,X6=256,h5=16,u5=17,m5=18,n8=new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]),X8=new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]),GJ=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),_5=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),XJ=512,I0=new Array((S1+2)2);Y1(I0);var x1=new Array(V12);Y1(x1);var v1=new Array(XJ);Y1(v1);var A1=new Array(QJ-JJ+1);Y1(A1);var Y6=new Array(V6);Y1(Y6);var Y8=new Array(V1);Y1(Y8);var d5,c5,l5,i5=(W)=>{return W<256?v1[W]:v1[256+(W>>>7)]},T1=(W,Q)=>{W.pending_buf[W.pending++]=Q&255,W.pending_buf[W.pending++]=Q>>>8&255},Y0=(W,Q,J)=>{if(W.bi_valid>E8-J)W.bi_buf\|=Q<<W.bi_valid&65535,T1(W,W.bi_buf),W.bi_buf=Q>>E8-W.bi_valid,W.bi_valid+=J-E8;else W.bi_buf\|=Q<<W.bi_valid&65535,W.bi_valid+=J},j0=(W,Q,J)=>{Y0(W,J[Q2],J[Q2+1])},r5=(W,Q)=>{let J=0;do J\|=W&1,W>>>=1,J<<=1;while(--Q>0);return J>>>1},YJ=(W)=>{if(W.bi_valid===16)T1(W,W.bi_buf),W.bi_buf=0,W.bi_valid=0;else if(W.bi_valid>=8)W.pending_buf[W.pending++]=W.bi_buf&255,W.bi_buf>>=8,W.bi_valid-=8},qJ=(W,Q)=>{const{dyn_tree:J,max_code:V}=Q,G=Q.stat_desc.static_tree,X=Q.stat_desc.has_stree,q=Q.stat_desc.extra_bits,Y=Q.stat_desc.extra_base,F=Q.stat_desc.max_length;let U,P,H,K,z,C,g=0;for(K=0;K<=h0;K++)W.bl_count[K]=0;J[W.heap[W.heap_max]2+1]=0;for(U=W.heap_max+1;U<b5;U++){if(P=W.heap[U],K=J[J[P2+1]2+1]+1,K>F)K=F,g++;if(J[P2+1]=K,P>V)continue;if(W.bl_count[K]++,z=0,P>=Y)z=q[P-Y];if(C=J[P2],W.opt_len+=C(K+z),X)W.static_len+=C(G[P2+1]+z)}if(g===0)return;do{K=F-1;while(W.bl_count[K]===0)K--;W.bl_count[K]--,W.bl_count[K+1]+=2,W.bl_count[F]--,g-=2}while(g>0);for(K=F;K!==0;K--){P=W.bl_count[K];while(P!==0){if(H=W.heap[--U],H>V)continue;if(J[H2+1]!==K)W.opt_len+=(K-J[H2+1])J[H2],J[H2+1]=K;P--}}},n5=(W,Q,J)=>{const V=new Array(h0+1);let G=0,X,q;for(X=1;X<=h0;X++)G=G+J[X-1]<<1,V[X]=G;for(q=0;q<=Q;q++){let Y=W[q2+1];if(Y===0)continue;W[q2]=r5(V[Y]++,Y)}},UJ=()=>{let W,Q,J,V,G;const X=new Array(h0+1);J=0;for(V=0;V<V6-1;V++){Y6[V]=J;for(W=0;W<1<<n8[V];W++)A1[J++]=V}A1[J-1]=V,G=0;for(V=0;V<16;V++){Y8[V]=G;for(W=0;W<1<<X8[V];W++)v1[G++]=V}G>>=7;for(;V<V1;V++){Y8[V]=G<<7;for(W=0;W<1<<X8[V]-7;W++)v1[256+G++]=V}for(Q=0;Q<=h0;Q++)X[Q]=0;W=0;while(W<=143)I0[W2+1]=8,W++,X[8]++;while(W<=255)I0[W2+1]=9,W++,X[9]++;while(W<=279)I0[W2+1]=7,W++,X[7]++;while(W<=287)I0[W2+1]=8,W++,X[8]++;n5(I0,S1+1,X);for(W=0;W<V1;W++)x1[W2+1]=5,x1[W2]=r5(W,5);d5=new y8(I0,n8,f1+1,S1,h0),c5=new y8(x1,X8,0,V1,h0),l5=new y8(new Array(0),GJ,0,G6,VJ)},o5=(W)=>{let Q;for(Q=0;Q<S1;Q++)W.dyn_ltree[Q2]=0;for(Q=0;Q<V1;Q++)W.dyn_dtree[Q2]=0;for(Q=0;Q<G6;Q++)W.bl_tree[Q2]=0;W.dyn_ltree[X62]=1,W.opt_len=W.static_len=0,W.sym_next=W.matches=0},a5=(W)=>{if(W.bi_valid>8)T1(W,W.bi_buf);else if(W.bi_valid>0)W.pending_buf[W.pending++]=W.bi_buf;W.bi_buf=0,W.bi_valid=0},t6=(W,Q,J,V)=>{const G=Q2,X=J2;return W[G]<W[X]\|\|W[G]===W[X]&&V[Q]<=V[J]},f8=(W,Q,J)=>{const V=W.heap[J];let G=J<<1;while(G<=W.heap_len){if(G<W.heap_len&&t6(Q,W.heap[G+1],W.heap[G],W.depth))G++;if(t6(Q,V,W.heap[G],W.depth))break;W.heap[J]=W.heap[G],J=G,G<<=1}W.heap[J]=V},W5=(W,Q,J)=>{let V,G,X=0,q,Y;if(W.sym_next!==0)do if(V=W.pending_buf[W.sym_buf+X++]&255,V+=(W.pending_buf[W.sym_buf+X++]&255)<<8,G=W.pending_buf[W.sym_buf+X++],V===0)j0(W,G,Q);else{if(q=A1[G],j0(W,q+f1+1,Q),Y=n8[q],Y!==0)G-=Y6[q],Y0(W,G,Y);if(V--,q=i5(V),j0(W,q,J),Y=X8[q],Y!==0)V-=Y8[q],Y0(W,V,Y)}while(X<W.sym_next);j0(W,X6,Q)},o8=(W,Q)=>{const J=Q.dyn_tree,V=Q.stat_desc.static_tree,G=Q.stat_desc.has_stree,X=Q.stat_desc.elems;let q,Y,F=-1,U;W.heap_len=0,W.heap_max=b5;for(q=0;q<X;q++)if(J[q2]!==0)W.heap[++W.heap_len]=F=q,W.depth[q]=0;else J[q2+1]=0;while(W.heap_len<2)if(U=W.heap[++W.heap_len]=F<2?++F:0,J[U2]=1,W.depth[U]=0,W.opt_len--,G)W.static_len-=V[U2+1];Q.max_code=F;for(q=W.heap_len>>1;q>=1;q--)f8(W,J,q);U=X;do q=W.heap[1],W.heap[1]=W.heap[W.heap_len--],f8(W,J,1),Y=W.heap[1],W.heap[--W.heap_max]=q,W.heap[--W.heap_max]=Y,J[U2]=J[q2]+J[Y2],W.depth[U]=(W.depth[q]>=W.depth[Y]?W.depth[q]:W.depth[Y])+1,J[q2+1]=J[Y2+1]=U,W.heap[1]=U++,f8(W,J,1);while(W.heap_len>=2);W.heap[--W.heap_max]=W.heap[1],qJ(W,Q),n5(J,F,W.bl_count)},J5=(W,Q,J)=>{let V,G=-1,X,q=Q[1],Y=0,F=7,U=4;if(q===0)F=138,U=3;Q[(J+1)2+1]=65535;for(V=0;V<=J;V++){if(X=q,q=Q[(V+1)2+1],++Y<F&&X===q)continue;else if(Y<U)W.bl_tree[X2]+=Y;else if(X!==0){if(X!==G)W.bl_tree[X2]++;W.bl_tree[h52]++}else if(Y<=10)W.bl_tree[u52]++;else W.bl_tree[m52]++;if(Y=0,G=X,q===0)F=138,U=3;else if(X===q)F=6,U=3;else F=7,U=4}},Q5=(W,Q,J)=>{let V,G=-1,X,q=Q[1],Y=0,F=7,U=4;if(q===0)F=138,U=3;for(V=0;V<=J;V++){if(X=q,q=Q[(V+1)2+1],++Y<F&&X===q)continue;else if(Y<U)do j0(W,X,W.bl_tree);while(--Y!==0);else if(X!==0){if(X!==G)j0(W,X,W.bl_tree),Y--;j0(W,h5,W.bl_tree),Y0(W,Y-3,2)}else if(Y<=10)j0(W,u5,W.bl_tree),Y0(W,Y-3,3);else j0(W,m5,W.bl_tree),Y0(W,Y-11,7);if(Y=0,G=X,q===0)F=138,U=3;else if(X===q)F=6,U=3;else F=7,U=4}},PJ=(W)=>{let Q;J5(W,W.dyn_ltree,W.l_desc.max_code),J5(W,W.dyn_dtree,W.d_desc.max_code),o8(W,W.bl_desc);for(Q=G6-1;Q>=3;Q--)if(W.bl_tree[_5[Q]2+1]!==0)break;return W.opt_len+=3(Q+1)+5+5+4,Q},KJ=(W,Q,J,V)=>{let G;Y0(W,Q-257,5),Y0(W,J-1,5),Y0(W,V-4,4);for(G=0;G<V;G++)Y0(W,W.bl_tree[_5[G]2+1],3);Q5(W,W.dyn_ltree,Q-1),Q5(W,W.dyn_dtree,J-1)},FJ=(W)=>{let Q=4093624447,J;for(J=0;J<=31;J++,Q>>>=1)if(Q&1&&W.dyn_ltree[J2]!==0)return 0;if(W.dyn_ltree[18]!==0\|\|W.dyn_ltree[20]!==0\|\|W.dyn_ltree[26]!==0)return 1;for(J=32;J<f1;J++)if(W.dyn_ltree[J2]!==0)return 1;return 0},V5=!1,zJ=(W)=>{if(!V5)UJ(),V5=!0;W.l_desc=new p8(W.dyn_ltree,d5),W.d_desc=new p8(W.dyn_dtree,c5),W.bl_desc=new p8(W.bl_tree,l5),W.bi_buf=0,W.bi_valid=0,o5(W)},s5=(W,Q,J,V)=>{if(Y0(W,(tW<<1)+(V?1:0),3),a5(W),T1(W,J),T1(W,~J),J)W.pending_buf.set(W.window.subarray(Q,Q+J),W.pending);W.pending+=J},ZJ=(W)=>{Y0(W,f5<<1,3),j0(W,X6,I0),YJ(W)},HJ=(W,Q,J,V)=>{let G,X,q=0;if(W.level>0){if(W.strm.data_type===2)W.strm.data_type=FJ(W);if(o8(W,W.l_desc),o8(W,W.d_desc),q=PJ(W),G=W.opt_len+3+7>>>3,X=W.static_len+3+7>>>3,X<=G)G=X}else G=X=J+5;if(J+4<=G&&Q!==-1)s5(W,Q,J,V);else if(W.strategy===4\|\|X===G)Y0(W,(f5<<1)+(V?1:0),3),W5(W,I0,x1);else Y0(W,(WJ<<1)+(V?1:0),3),KJ(W,W.l_desc.max_code+1,W.d_desc.max_code+1,q+1),W5(W,W.dyn_ltree,W.dyn_dtree);if(o5(W),V)a5(W)},kJ=(W,Q,J)=>{if(W.pending_buf[W.sym_buf+W.sym_next++]=Q,W.pending_buf[W.sym_buf+W.sym_next++]=Q>>8,W.pending_buf[W.sym_buf+W.sym_next++]=J,Q===0)W.dyn_ltree[J2]++;else W.matches++,Q--,W.dyn_ltree[(A1[J]+f1+1)2]++,W.dyn_dtree[i5(Q)2]++;return W.sym_next===W.sym_end},$J=zJ,jJ=s5,CJ=HJ,BJ=kJ,MJ=ZJ,RJ={_tr_init:$J,_tr_stored_block:jJ,_tr_flush_block:CJ,_tr_tally:BJ,_tr_align:MJ},LJ=(W,Q,J,V)=>{let G=W&65535\|0,X=W>>>16&65535\|0,q=0;while(J!==0){q=J>2000?2000:J,J-=q;do G=G+Q[V++]\|0,X=X+G\|0;while(--q);G%=65521,X%=65521}return G\|X<<16\|0},g1=LJ,IJ=()=>{let W,Q=[];for(var J=0;J<256;J++){W=J;for(var V=0;V<8;V++)W=W&1?3988292384^W>>>1:W>>>1;Q[J]=W}return Q},OJ=new Uint32Array(IJ()),DJ=(W,Q,J,V)=>{const G=OJ,X=V+J;W^=-1;for(let q=V;q<X;q++)W=W>>>8^G[(W^Q[q])&255];return W^-1},t=DJ,_0={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},l0={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8},{_tr_init:xJ,_tr_stored_block:a8,_tr_flush_block:wJ,_tr_tally:g0,_tr_align:NJ}=RJ,{Z_NO_FLUSH:E0,Z_PARTIAL_FLUSH:SJ,Z_FULL_FLUSH:vJ,Z_FINISH:F0,Z_BLOCK:G5,Z_OK:J0,Z_STREAM_END:X5,Z_STREAM_ERROR:C0,Z_DATA_ERROR:AJ,Z_BUF_ERROR:b8,Z_DEFAULT_COMPRESSION:TJ,Z_FILTERED:gJ,Z_HUFFMAN_ONLY:W8,Z_RLE:EJ,Z_FIXED:yJ,Z_DEFAULT_STRATEGY:pJ,Z_UNKNOWN:fJ,Z_DEFLATED:P8}=l0,bJ=9,hJ=15,uJ=8,mJ=29,_J=256,s8=_J+1+mJ,dJ=30,cJ=19,lJ=2s8+1,iJ=15,c=3,T0=258,B0=T0+c+1,rJ=32,G1=42,q6=57,e8=69,t8=73,W6=91,J6=103,u0=113,O1=666,G0=1,q1=2,d0=3,U1=4,nJ=3,m0=(W,Q)=>{return W.msg=_0[Q],Q},Y5=(W)=>{return W2-(W>4?9:0)},A0=(W)=>{let Q=W.length;while(--Q>=0)W[Q]=0},oJ=(W)=>{let Q,J,V,G=W.w_size;Q=W.hash_size,V=Q;do J=W.head[--V],W.head[V]=J>=G?J-G:0;while(--Q);Q=G,V=Q;do J=W.prev[--V],W.prev[V]=J>=G?J-G:0;while(--Q)},aJ=(W,Q,J)=>(Q<<W.hash_shift^J)&W.hash_mask,y0=aJ,U0=(W)=>{const Q=W.state;let J=Q.pending;if(J>W.avail_out)J=W.avail_out;if(J===0)return;if(W.output.set(Q.pending_buf.subarray(Q.pending_out,Q.pending_out+J),W.next_out),W.next_out+=J,Q.pending_out+=J,W.total_out+=J,W.avail_out-=J,Q.pending-=J,Q.pending===0)Q.pending_out=0},P0=(W,Q)=>{wJ(W,W.block_start>=0?W.block_start:-1,W.strstart-W.block_start,Q),W.block_start=W.strstart,U0(W.strm)},i=(W,Q)=>{W.pending_buf[W.pending++]=Q},I1=(W,Q)=>{W.pending_buf[W.pending++]=Q>>>8&255,W.pending_buf[W.pending++]=Q&255},Q6=(W,Q,J,V)=>{let G=W.avail_in;if(G>V)G=V;if(G===0)return 0;if(W.avail_in-=G,Q.set(W.input.subarray(W.next_in,W.next_in+G),J),W.state.wrap===1)W.adler=g1(W.adler,Q,G,J);else if(W.state.wrap===2)W.adler=t(W.adler,Q,G,J);return W.next_in+=G,W.total_in+=G,G},e5=(W,Q)=>{let{max_chain_length:J,strstart:V}=W,G,X,q=W.prev_length,Y=W.nice_match;const F=W.strstart>W.w_size-B0?W.strstart-(W.w_size-B0):0,U=W.window,P=W.w_mask,H=W.prev,K=W.strstart+T0;let z=U[V+q-1],C=U[V+q];if(W.prev_length>=W.good_match)J>>=2;if(Y>W.lookahead)Y=W.lookahead;do{if(G=Q,U[G+q]!==C\|\|U[G+q-1]!==z\|\|U[G]!==U[V]\|\|U[++G]!==U[V+1])continue;V+=2,G++;do;while(U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&V<K);if(X=T0-(K-V),V=K-T0,X>q){if(W.match_start=Q,q=X,X>=Y)break;z=U[V+q-1],C=U[V+q]}}while((Q=H[Q&P])>F&&--J!==0);if(q<=W.lookahead)return q;return W.lookahead},X1=(W)=>{const Q=W.w_size;let J,V,G;do{if(V=W.window_size-W.lookahead-W.strstart,W.strstart>=Q+(Q-B0)){if(W.window.set(W.window.subarray(Q,Q+Q-V),0),W.match_start-=Q,W.strstart-=Q,W.block_start-=Q,W.insert>W.strstart)W.insert=W.strstart;oJ(W),V+=Q}if(W.strm.avail_in===0)break;if(J=Q6(W.strm,W.window,W.strstart+W.lookahead,V),W.lookahead+=J,W.lookahead+W.insert>=c){G=W.strstart-W.insert,W.ins_h=W.window[G],W.ins_h=y0(W,W.ins_h,W.window[G+1]);while(W.insert)if(W.ins_h=y0(W,W.ins_h,W.window[G+c-1]),W.prev[G&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=G,G++,W.insert--,W.lookahead+W.insert<c)break}}while(W.lookahead<B0&&W.strm.avail_in!==0)},t5=(W,Q)=>{let J=W.pending_buf_size-5>W.w_size?W.w_size:W.pending_buf_size-5,V,G,X,q=0,Y=W.strm.avail_in;do{if(V=65535,X=W.bi_valid+42>>3,W.strm.avail_out<X)break;if(X=W.strm.avail_out-X,G=W.strstart-W.block_start,V>G+W.strm.avail_in)V=G+W.strm.avail_in;if(V>X)V=X;if(V<J&&(V===0&&Q!==F0\|\|Q===E0\|\|V!==G+W.strm.avail_in))break;if(q=Q===F0&&V===G+W.strm.avail_in?1:0,a8(W,0,0,q),W.pending_buf[W.pending-4]=V,W.pending_buf[W.pending-3]=V>>8,W.pending_buf[W.pending-2]=~V,W.pending_buf[W.pending-1]=~V>>8,U0(W.strm),G){if(G>V)G=V;W.strm.output.set(W.window.subarray(W.block_start,W.block_start+G),W.strm.next_out),W.strm.next_out+=G,W.strm.avail_out-=G,W.strm.total_out+=G,W.block_start+=G,V-=G}if(V)Q6(W.strm,W.strm.output,W.strm.next_out,V),W.strm.next_out+=V,W.strm.avail_out-=V,W.strm.total_out+=V}while(q===0);if(Y-=W.strm.avail_in,Y){if(Y>=W.w_size)W.matches=2,W.window.set(W.strm.input.subarray(W.strm.next_in-W.w_size,W.strm.next_in),0),W.strstart=W.w_size,W.insert=W.strstart;else{if(W.window_size-W.strstart<=Y){if(W.strstart-=W.w_size,W.window.set(W.window.subarray(W.w_size,W.w_size+W.strstart),0),W.matches<2)W.matches++;if(W.insert>W.strstart)W.insert=W.strstart}W.window.set(W.strm.input.subarray(W.strm.next_in-Y,W.strm.next_in),W.strstart),W.strstart+=Y,W.insert+=Y>W.w_size-W.insert?W.w_size-W.insert:Y}W.block_start=W.strstart}if(W.high_water<W.strstart)W.high_water=W.strstart;if(q)return U1;if(Q!==E0&&Q!==F0&&W.strm.avail_in===0&&W.strstart===W.block_start)return q1;if(X=W.window_size-W.strstart,W.strm.avail_in>X&&W.block_start>=W.w_size){if(W.block_start-=W.w_size,W.strstart-=W.w_size,W.window.set(W.window.subarray(W.w_size,W.w_size+W.strstart),0),W.matches<2)W.matches++;if(X+=W.w_size,W.insert>W.strstart)W.insert=W.strstart}if(X>W.strm.avail_in)X=W.strm.avail_in;if(X)Q6(W.strm,W.window,W.strstart,X),W.strstart+=X,W.insert+=X>W.w_size-W.insert?W.w_size-W.insert:X;if(W.high_water<W.strstart)W.high_water=W.strstart;if(X=W.bi_valid+42>>3,X=W.pending_buf_size-X>65535?65535:W.pending_buf_size-X,J=X>W.w_size?W.w_size:X,G=W.strstart-W.block_start,G>=J\|\|(G\|\|Q===F0)&&Q!==E0&&W.strm.avail_in===0&&G<=X)V=G>X?X:G,q=Q===F0&&W.strm.avail_in===0&&V===G?1:0,a8(W,W.block_start,V,q),W.block_start+=V,U0(W.strm);return q?d0:G0},h8=(W,Q)=>{let J,V;for(;;){if(W.lookahead<B0){if(X1(W),W.lookahead<B0&&Q===E0)return G0;if(W.lookahead===0)break}if(J=0,W.lookahead>=c)W.ins_h=y0(W,W.ins_h,W.window[W.strstart+c-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;if(J!==0&&W.strstart-J<=W.w_size-B0)W.match_length=e5(W,J);if(W.match_length>=c)if(V=g0(W,W.strstart-W.match_start,W.match_length-c),W.lookahead-=W.match_length,W.match_length<=W.max_lazy_match&&W.lookahead>=c){W.match_length--;do W.strstart++,W.ins_h=y0(W,W.ins_h,W.window[W.strstart+c-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;while(--W.match_length!==0);W.strstart++}else W.strstart+=W.match_length,W.match_length=0,W.ins_h=W.window[W.strstart],W.ins_h=y0(W,W.ins_h,W.window[W.strstart+1]);else V=g0(W,0,W.window[W.strstart]),W.lookahead--,W.strstart++;if(V){if(P0(W,!1),W.strm.avail_out===0)return G0}}if(W.insert=W.strstart<c-1?W.strstart:c-1,Q===F0){if(P0(W,!0),W.strm.avail_out===0)return d0;return U1}if(W.sym_next){if(P0(W,!1),W.strm.avail_out===0)return G0}return q1},J1=(W,Q)=>{let J,V,G;for(;;){if(W.lookahead<B0){if(X1(W),W.lookahead<B0&&Q===E0)return G0;if(W.lookahead===0)break}if(J=0,W.lookahead>=c)W.ins_h=y0(W,W.ins_h,W.window[W.strstart+c-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;if(W.prev_length=W.match_length,W.prev_match=W.match_start,W.match_length=c-1,J!==0&&W.prev_length<W.max_lazy_match&&W.strstart-J<=W.w_size-B0){if(W.match_length=e5(W,J),W.match_length<=5&&(W.strategy===gJ\|\|W.match_length===c&&W.strstart-W.match_start>4096))W.match_length=c-1}if(W.prev_length>=c&&W.match_length<=W.prev_length){G=W.strstart+W.lookahead-c,V=g0(W,W.strstart-1-W.prev_match,W.prev_length-c),W.lookahead-=W.prev_length-1,W.prev_length-=2;do if(++W.strstart<=G)W.ins_h=y0(W,W.ins_h,W.window[W.strstart+c-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;while(--W.prev_length!==0);if(W.match_available=0,W.match_length=c-1,W.strstart++,V){if(P0(W,!1),W.strm.avail_out===0)return G0}}else if(W.match_available){if(V=g0(W,0,W.window[W.strstart-1]),V)P0(W,!1);if(W.strstart++,W.lookahead--,W.strm.avail_out===0)return G0}else W.match_available=1,W.strstart++,W.lookahead--}if(W.match_available)V=g0(W,0,W.window[W.strstart-1]),W.match_available=0;if(W.insert=W.strstart<c-1?W.strstart:c-1,Q===F0){if(P0(W,!0),W.strm.avail_out===0)return d0;return U1}if(W.sym_next){if(P0(W,!1),W.strm.avail_out===0)return G0}return q1},sJ=(W,Q)=>{let J,V,G,X;const q=W.window;for(;;){if(W.lookahead<=T0){if(X1(W),W.lookahead<=T0&&Q===E0)return G0;if(W.lookahead===0)break}if(W.match_length=0,W.lookahead>=c&&W.strstart>0){if(G=W.strstart-1,V=q[G],V===q[++G]&&V===q[++G]&&V===q[++G]){X=W.strstart+T0;do;while(V===q[++G]&&V===q[++G]&&V===q[++G]&&V===q[++G]&&V===q[++G]&&V===q[++G]&&V===q[++G]&&V===q[++G]&&G<X);if(W.match_length=T0-(X-G),W.match_length>W.lookahead)W.match_length=W.lookahead}}if(W.match_length>=c)J=g0(W,1,W.match_length-c),W.lookahead-=W.match_length,W.strstart+=W.match_length,W.match_length=0;else J=g0(W,0,W.window[W.strstart]),W.lookahead--,W.strstart++;if(J){if(P0(W,!1),W.strm.avail_out===0)return G0}}if(W.insert=0,Q===F0){if(P0(W,!0),W.strm.avail_out===0)return d0;return U1}if(W.sym_next){if(P0(W,!1),W.strm.avail_out===0)return G0}return q1},eJ=(W,Q)=>{let J;for(;;){if(W.lookahead===0){if(X1(W),W.lookahead===0){if(Q===E0)return G0;break}}if(W.match_length=0,J=g0(W,0,W.window[W.strstart]),W.lookahead--,W.strstart++,J){if(P0(W,!1),W.strm.avail_out===0)return G0}}if(W.insert=0,Q===F0){if(P0(W,!0),W.strm.avail_out===0)return d0;return U1}if(W.sym_next){if(P0(W,!1),W.strm.avail_out===0)return G0}return q1},D1=[new $0(0,0,0,0,t5),new $0(4,4,8,4,h8),new $0(4,5,16,8,h8),new $0(4,6,32,32,h8),new $0(4,4,16,16,J1),new $0(8,16,32,32,J1),new $0(8,16,128,128,J1),new $0(8,32,128,256,J1),new $0(32,128,258,1024,J1),new $0(32,258,258,4096,J1)],tJ=(W)=>{W.window_size=2W.w_size,A0(W.head),W.max_lazy_match=D1[W.level].max_lazy,W.good_match=D1[W.level].good_length,W.nice_match=D1[W.level].nice_length,W.max_chain_length=D1[W.level].max_chain,W.strstart=0,W.block_start=0,W.lookahead=0,W.insert=0,W.match_length=W.prev_length=c-1,W.match_available=0,W.ins_h=0},b1=(W)=>{if(!W)return 1;const Q=W.state;if(!Q\|\|Q.strm!==W\|\|Q.status!==G1&&Q.status!==q6&&Q.status!==e8&&Q.status!==t8&&Q.status!==W6&&Q.status!==J6&&Q.status!==u0&&Q.status!==O1)return 1;return 0},W7=(W)=>{if(b1(W))return m0(W,C0);W.total_in=W.total_out=0,W.data_type=fJ;const Q=W.state;if(Q.pending=0,Q.pending_out=0,Q.wrap<0)Q.wrap=-Q.wrap;return Q.status=Q.wrap===2?q6:Q.wrap?G1:u0,W.adler=Q.wrap===2?0:1,Q.last_flush=-2,xJ(Q),J0},J7=(W)=>{const Q=W7(W);if(Q===J0)tJ(W.state);return Q},J9=(W,Q)=>{if(b1(W)\|\|W.state.wrap!==2)return C0;return W.state.gzhead=Q,J0},Q7=(W,Q,J,V,G,X)=>{if(!W)return C0;let q=1;if(Q===TJ)Q=6;if(V<0)q=0,V=-V;else if(V>15)q=2,V-=16;if(G<1\|\|G>bJ\|\|J!==P8\|\|V<8\|\|V>15\|\|Q<0\|\|Q>9\|\|X<0\|\|X>yJ\|\|V===8&&q!==1)return m0(W,C0);if(V===8)V=9;const Y=new W9;return W.state=Y,Y.strm=W,Y.status=G1,Y.wrap=q,Y.gzhead=null,Y.w_bits=V,Y.w_size=1<<Y.w_bits,Y.w_mask=Y.w_size-1,Y.hash_bits=G+7,Y.hash_size=1<<Y.hash_bits,Y.hash_mask=Y.hash_size-1,Y.hash_shift=~~((Y.hash_bits+c-1)/c),Y.window=new Uint8Array(Y.w_size2),Y.head=new Uint16Array(Y.hash_size),Y.prev=new Uint16Array(Y.w_size),Y.lit_bufsize=1<<G+6,Y.pending_buf_size=Y.lit_bufsize4,Y.pending_buf=new Uint8Array(Y.pending_buf_size),Y.sym_buf=Y.lit_bufsize,Y.sym_end=(Y.lit_bufsize-1)3,Y.level=Q,Y.strategy=X,Y.method=J,J7(W)},Q9=(W,Q)=>{return Q7(W,Q,P8,hJ,uJ,pJ)},V9=(W,Q)=>{if(b1(W)\|\|Q>G5\|\|Q<0)return W?m0(W,C0):C0;const J=W.state;if(!W.output\|\|W.avail_in!==0&&!W.input\|\|J.status===O1&&Q!==F0)return m0(W,W.avail_out===0?b8:C0);const V=J.last_flush;if(J.last_flush=Q,J.pending!==0){if(U0(W),W.avail_out===0)return J.last_flush=-1,J0}else if(W.avail_in===0&&Y5(Q)<=Y5(V)&&Q!==F0)return m0(W,b8);if(J.status===O1&&W.avail_in!==0)return m0(W,b8);if(J.status===G1&&J.wrap===0)J.status=u0;if(J.status===G1){let G=P8+(J.w_bits-8<<4)<<8,X=-1;if(J.strategy>=W8\|\|J.level<2)X=0;else if(J.level<6)X=1;else if(J.level===6)X=2;else X=3;if(G\|=X<<6,J.strstart!==0)G\|=rJ;if(G+=31-G%31,I1(J,G),J.strstart!==0)I1(J,W.adler>>>16),I1(J,W.adler&65535);if(W.adler=1,J.status=u0,U0(W),J.pending!==0)return J.last_flush=-1,J0}if(J.status===q6)if(W.adler=0,i(J,31),i(J,139),i(J,8),!J.gzhead){if(i(J,0),i(J,0),i(J,0),i(J,0),i(J,0),i(J,J.level===9?2:J.strategy>=W8\|\|J.level<2?4:0),i(J,nJ),J.status=u0,U0(W),J.pending!==0)return J.last_flush=-1,J0}else{if(i(J,(J.gzhead.text?1:0)+(J.gzhead.hcrc?2:0)+(!J.gzhead.extra?0:4)+(!J.gzhead.name?0:8)+(!J.gzhead.comment?0:16)),i(J,J.gzhead.time&255),i(J,J.gzhead.time>>8&255),i(J,J.gzhead.time>>16&255),i(J,J.gzhead.time>>24&255),i(J,J.level===9?2:J.strategy>=W8\|\|J.level<2?4:0),i(J,J.gzhead.os&255),J.gzhead.extra&&J.gzhead.extra.length)i(J,J.gzhead.extra.length&255),i(J,J.gzhead.extra.length>>8&255);if(J.gzhead.hcrc)W.adler=t(W.adler,J.pending_buf,J.pending,0);J.gzindex=0,J.status=e8}if(J.status===e8){if(J.gzhead.extra){let G=J.pending,X=(J.gzhead.extra.length&65535)-J.gzindex;while(J.pending+X>J.pending_buf_size){let Y=J.pending_buf_size-J.pending;if(J.pending_buf.set(J.gzhead.extra.subarray(J.gzindex,J.gzindex+Y),J.pending),J.pending=J.pending_buf_size,J.gzhead.hcrc&&J.pending>G)W.adler=t(W.adler,J.pending_buf,J.pending-G,G);if(J.gzindex+=Y,U0(W),J.pending!==0)return J.last_flush=-1,J0;G=0,X-=Y}let q=new Uint8Array(J.gzhead.extra);if(J.pending_buf.set(q.subarray(J.gzindex,J.gzindex+X),J.pending),J.pending+=X,J.gzhead.hcrc&&J.pending>G)W.adler=t(W.adler,J.pending_buf,J.pending-G,G);J.gzindex=0}J.status=t8}if(J.status===t8){if(J.gzhead.name){let G=J.pending,X;do{if(J.pending===J.pending_buf_size){if(J.gzhead.hcrc&&J.pending>G)W.adler=t(W.adler,J.pending_buf,J.pending-G,G);if(U0(W),J.pending!==0)return J.last_flush=-1,J0;G=0}if(J.gzindex<J.gzhead.name.length)X=J.gzhead.name.charCodeAt(J.gzindex++)&255;else X=0;i(J,X)}while(X!==0);if(J.gzhead.hcrc&&J.pending>G)W.adler=t(W.adler,J.pending_buf,J.pending-G,G);J.gzindex=0}J.status=W6}if(J.status===W6){if(J.gzhead.comment){let G=J.pending,X;do{if(J.pending===J.pending_buf_size){if(J.gzhead.hcrc&&J.pending>G)W.adler=t(W.adler,J.pending_buf,J.pending-G,G);if(U0(W),J.pending!==0)return J.last_flush=-1,J0;G=0}if(J.gzindex<J.gzhead.comment.length)X=J.gzhead.comment.charCodeAt(J.gzindex++)&255;else X=0;i(J,X)}while(X!==0);if(J.gzhead.hcrc&&J.pending>G)W.adler=t(W.adler,J.pending_buf,J.pending-G,G)}J.status=J6}if(J.status===J6){if(J.gzhead.hcrc){if(J.pending+2>J.pending_buf_size){if(U0(W),J.pending!==0)return J.last_flush=-1,J0}i(J,W.adler&255),i(J,W.adler>>8&255),W.adler=0}if(J.status=u0,U0(W),J.pending!==0)return J.last_flush=-1,J0}if(W.avail_in!==0\|\|J.lookahead!==0\|\|Q!==E0&&J.status!==O1){let G=J.level===0?t5(J,Q):J.strategy===W8?eJ(J,Q):J.strategy===EJ?sJ(J,Q):D1[J.level].func(J,Q);if(G===d0\|\|G===U1)J.status=O1;if(G===G0\|\|G===d0){if(W.avail_out===0)J.last_flush=-1;return J0}if(G===q1){if(Q===SJ)NJ(J);else if(Q!==G5){if(a8(J,0,0,!1),Q===vJ){if(A0(J.head),J.lookahead===0)J.strstart=0,J.block_start=0,J.insert=0}}if(U0(W),W.avail_out===0)return J.last_flush=-1,J0}}if(Q!==F0)return J0;if(J.wrap<=0)return X5;if(J.wrap===2)i(J,W.adler&255),i(J,W.adler>>8&255),i(J,W.adler>>16&255),i(J,W.adler>>24&255),i(J,W.total_in&255),i(J,W.total_in>>8&255),i(J,W.total_in>>16&255),i(J,W.total_in>>24&255);else I1(J,W.adler>>>16),I1(J,W.adler&65535);if(U0(W),J.wrap>0)J.wrap=-J.wrap;return J.pending!==0?J0:X5},G9=(W)=>{if(b1(W))return C0;const Q=W.state.status;return W.state=null,Q===u0?m0(W,AJ):J0},X9=(W,Q)=>{let J=Q.length;if(b1(W))return C0;const V=W.state,G=V.wrap;if(G===2\|\|G===1&&V.status!==G1\|\|V.lookahead)return C0;if(G===1)W.adler=g1(W.adler,Q,J,0);if(V.wrap=0,J>=V.w_size){if(G===0)A0(V.head),V.strstart=0,V.block_start=0,V.insert=0;let F=new Uint8Array(V.w_size);F.set(Q.subarray(J-V.w_size,J),0),Q=F,J=V.w_size}const{avail_in:X,next_in:q,input:Y}=W;W.avail_in=J,W.next_in=0,W.input=Q,X1(V);while(V.lookahead>=c){let F=V.strstart,U=V.lookahead-(c-1);do V.ins_h=y0(V,V.ins_h,V.window[F+c-1]),V.prev[F&V.w_mask]=V.head[V.ins_h],V.head[V.ins_h]=F,F++;while(--U);V.strstart=F,V.lookahead=c-1,X1(V)}return V.strstart+=V.lookahead,V.block_start=V.strstart,V.insert=V.lookahead,V.lookahead=0,V.match_length=V.prev_length=c-1,V.match_available=0,W.next_in=q,W.input=Y,W.avail_in=X,V.wrap=G,J0},Y9=Q9,q9=Q7,U9=J7,P9=W7,K9=J9,F9=V9,z9=G9,Z9=X9,H9="pako deflate (from Nodeca project)",w1={deflateInit:Y9,deflateInit2:q9,deflateReset:U9,deflateResetKeep:P9,deflateSetHeader:K9,deflate:F9,deflateEnd:z9,deflateSetDictionary:Z9,deflateInfo:H9},k9=(W,Q)=>{return Object.prototype.hasOwnProperty.call(W,Q)},$9=function(W){const Q=Array.prototype.slice.call(arguments,1);while(Q.length){const J=Q.shift();if(!J)continue;if(typeof J!=="object")throw new TypeError(J+"must be non-object");for(let V in J)if(k9(J,V))W[V]=J[V]}return W},j9=(W)=>{let Q=0;for(let V=0,G=W.length;V<G;V++)Q+=W[V].length;const J=new Uint8Array(Q);for(let V=0,G=0,X=W.length;V<X;V++){let q=W[V];J.set(q,G),G+=q.length}return J},K8={assign:$9,flattenChunks:j9},V7=!0;try{String.fromCharCode.apply(null,new Uint8Array(1))}catch(W){V7=!1}var E1=new Uint8Array(256);for(let W=0;W<256;W++)E1[W]=W>=252?6:W>=248?5:W>=240?4:W>=224?3:W>=192?2:1;E1[254]=E1[254]=1;var C9=(W)=>{if(typeof TextEncoder==="function"&&TextEncoder.prototype.encode)return(new TextEncoder()).encode(W);let Q,J,V,G,X,q=W.length,Y=0;for(G=0;G<q;G++){if(J=W.charCodeAt(G),(J&64512)===55296&&G+1<q){if(V=W.charCodeAt(G+1),(V&64512)===56320)J=65536+(J-55296<<10)+(V-56320),G++}Y+=J<128?1:J<2048?2:J<65536?3:4}Q=new Uint8Array(Y);for(X=0,G=0;X<Y;G++){if(J=W.charCodeAt(G),(J&64512)===55296&&G+1<q){if(V=W.charCodeAt(G+1),(V&64512)===56320)J=65536+(J-55296<<10)+(V-56320),G++}if(J<128)Q[X++]=J;else if(J<2048)Q[X++]=192\|J>>>6,Q[X++]=128\|J&63;else if(J<65536)Q[X++]=224\|J>>>12,Q[X++]=128\|J>>>6&63,Q[X++]=128\|J&63;else Q[X++]=240\|J>>>18,Q[X++]=128\|J>>>12&63,Q[X++]=128\|J>>>6&63,Q[X++]=128\|J&63}return Q},B9=(W,Q)=>{if(Q<65534){if(W.subarray&&V7)return String.fromCharCode.apply(null,W.length===Q?W:W.subarray(0,Q))}let J="";for(let V=0;V<Q;V++)J+=String.fromCharCode(W[V]);return J},M9=(W,Q)=>{const J=Q\|\|W.length;if(typeof TextDecoder==="function"&&TextDecoder.prototype.decode)return(new TextDecoder()).decode(W.subarray(0,Q));let V,G;const X=new Array(J2);for(G=0,V=0;V<J;){let q=W[V++];if(q<128){X[G++]=q;continue}let Y=E1[q];if(Y>4){X[G++]=65533,V+=Y-1;continue}q&=Y===2?31:Y===3?15:7;while(Y>1&&V<J)q=q<<6\|W[V++]&63,Y--;if(Y>1){X[G++]=65533;continue}if(q<65536)X[G++]=q;else q-=65536,X[G++]=55296\|q>>10&1023,X[G++]=56320\|q&1023}return B9(X,G)},R9=(W,Q)=>{if(Q=Q\|\|W.length,Q>W.length)Q=W.length;let J=Q-1;while(J>=0&&(W[J]&192)===128)J--;if(J<0)return Q;if(J===0)return Q;return J+E1[W[J]]>Q?J:Q},y1={string2buf:C9,buf2string:M9,utf8border:R9},G7=L9,X7=Object.prototype.toString,{Z_NO_FLUSH:I9,Z_SYNC_FLUSH:O9,Z_FULL_FLUSH:D9,Z_FINISH:x9,Z_OK:q8,Z_STREAM_END:w9,Z_DEFAULT_COMPRESSION:N9,Z_DEFAULT_STRATEGY:S9,Z_DEFLATED:v9}=l0;h1.prototype.push=function(W,Q){const J=this.strm,V=this.options.chunkSize;let G,X;if(this.ended)return!1;if(Q===~~Q)X=Q;else X=Q===!0?x9:I9;if(typeof W==="string")J.input=y1.string2buf(W);else if(X7.call(W)==="[object ArrayBuffer]")J.input=new Uint8Array(W);else J.input=W;J.next_in=0,J.avail_in=J.input.length;for(;;){if(J.avail_out===0)J.output=new Uint8Array(V),J.next_out=0,J.avail_out=V;if((X===O9\|\|X===D9)&&J.avail_out<=6){this.onData(J.output.subarray(0,J.next_out)),J.avail_out=0;continue}if(G=w1.deflate(J,X),G===w9){if(J.next_out>0)this.onData(J.output.subarray(0,J.next_out));return G=w1.deflateEnd(this.strm),this.onEnd(G),this.ended=!0,G===q8}if(J.avail_out===0){this.onData(J.output);continue}if(X>0&&J.next_out>0){this.onData(J.output.subarray(0,J.next_out)),J.avail_out=0;continue}if(J.avail_in===0)break}return!0};h1.prototype.onData=function(W){this.chunks.push(W)};h1.prototype.onEnd=function(W){if(W===q8)this.result=K8.flattenChunks(this.chunks);this.chunks=[],this.err=W,this.msg=this.strm.msg};var g9=h1,E9=U6,y9=A9,p9=T9,f9=l0,b9={Deflate:g9,deflate:E9,deflateRaw:y9,gzip:p9,constants:f9},J8=16209,h9=16191,u9=function W(Q,J){let V,G,X,q,Y,F,U,P,H,K,z,C,g,E,f,b,h,v,m,d,S,x,A,Z;const k=Q.state;V=Q.next_in,A=Q.input,G=V+(Q.avail_in-5),X=Q.next_out,Z=Q.output,q=X-(J-Q.avail_out),Y=X+(Q.avail_out-257),F=k.dmax,U=k.wsize,P=k.whave,H=k.wnext,K=k.window,z=k.hold,C=k.bits,g=k.lencode,E=k.distcode,f=(1<<k.lenbits)-1,b=(1<<k.distbits)-1;W:do{if(C<15)z+=A[V++]<<C,C+=8,z+=A[V++]<<C,C+=8;h=g[z&f];J:for(;;){if(v=h>>>24,z>>>=v,C-=v,v=h>>>16&255,v===0)Z[X++]=h&65535;else if(v&16){if(m=h&65535,v&=15,v){if(C<v)z+=A[V++]<<C,C+=8;m+=z&(1<<v)-1,z>>>=v,C-=v}if(C<15)z+=A[V++]<<C,C+=8,z+=A[V++]<<C,C+=8;h=E[z&b];Q:for(;;){if(v=h>>>24,z>>>=v,C-=v,v=h>>>16&255,v&16){if(d=h&65535,v&=15,C<v){if(z+=A[V++]<<C,C+=8,C<v)z+=A[V++]<<C,C+=8}if(d+=z&(1<<v)-1,d>F){Q.msg="invalid distance too far back",k.mode=J8;break W}if(z>>>=v,C-=v,v=X-q,d>v){if(v=d-v,v>P){if(k.sane){Q.msg="invalid distance too far back",k.mode=J8;break W}}if(S=0,x=K,H===0){if(S+=U-v,v<m){m-=v;do Z[X++]=K[S++];while(--v);S=X-d,x=Z}}else if(H<v){if(S+=U+H-v,v-=H,v<m){m-=v;do Z[X++]=K[S++];while(--v);if(S=0,H<m){v=H,m-=v;do Z[X++]=K[S++];while(--v);S=X-d,x=Z}}}else if(S+=H-v,v<m){m-=v;do Z[X++]=K[S++];while(--v);S=X-d,x=Z}while(m>2)Z[X++]=x[S++],Z[X++]=x[S++],Z[X++]=x[S++],m-=3;if(m){if(Z[X++]=x[S++],m>1)Z[X++]=x[S++]}}else{S=X-d;do Z[X++]=Z[S++],Z[X++]=Z[S++],Z[X++]=Z[S++],m-=3;while(m>2);if(m){if(Z[X++]=Z[S++],m>1)Z[X++]=Z[S++]}}}else if((v&64)===0){h=E[(h&65535)+(z&(1<<v)-1)];continue Q}else{Q.msg="invalid distance code",k.mode=J8;break W}break}}else if((v&64)===0){h=g[(h&65535)+(z&(1<<v)-1)];continue J}else if(v&32){k.mode=h9;break W}else{Q.msg="invalid literal/length code",k.mode=J8;break W}break}}while(V<G&&X<Y);m=C>>3,V-=m,C-=m<<3,z&=(1<<C)-1,Q.next_in=V,Q.next_out=X,Q.avail_in=V<G?5+(G-V):5-(V-G),Q.avail_out=X<Y?257+(Y-X):257-(X-Y),k.hold=z,k.bits=C;return},Q1=15,q5=852,U5=592,P5=0,u8=1,K5=2,m9=new Uint16Array([3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0]),_9=new Uint8Array([16,16,16,16,16,16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21,21,16,72,78]),d9=new Uint16Array([1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0]),c9=new Uint8Array([16,16,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,27,27,28,28,29,29,64,64]),l9=(W,Q,J,V,G,X,q,Y)=>{const F=Y.bits;let U=0,P=0,H=0,K=0,z=0,C=0,g=0,E=0,f=0,b=0,h,v,m,d,S,x=null,A;const Z=new Uint16Array(Q1+1),k=new Uint16Array(Q1+1);let I=null,$,M,w;for(U=0;U<=Q1;U++)Z[U]=0;for(P=0;P<V;P++)Z[Q[J+P]]++;z=F;for(K=Q1;K>=1;K--)if(Z[K]!==0)break;if(z>K)z=K;if(K===0)return G[X++]=1<<24\|64<<16\|0,G[X++]=1<<24\|64<<16\|0,Y.bits=1,0;for(H=1;H<K;H++)if(Z[H]!==0)break;if(z<H)z=H;E=1;for(U=1;U<=Q1;U++)if(E<<=1,E-=Z[U],E<0)return-1;if(E>0&&(W===P5\|\|K!==1))return-1;k[1]=0;for(U=1;U<Q1;U++)k[U+1]=k[U]+Z[U];for(P=0;P<V;P++)if(Q[J+P]!==0)q[k[Q[J+P]]++]=P;if(W===P5)x=I=q,A=20;else if(W===u8)x=m9,I=_9,A=257;else x=d9,I=c9,A=0;if(b=0,P=0,U=H,S=X,C=z,g=0,m=-1,f=1<<z,d=f-1,W===u8&&f>q5\|\|W===K5&&f>U5)return 1;for(;;){if($=U-g,q[P]+1<A)M=0,w=q[P];else if(q[P]>=A)M=I[q[P]-A],w=x[q[P]-A];else M=96,w=0;h=1<<U-g,v=1<<C,H=v;do v-=h,G[S+(b>>g)+v]=$<<24\|M<<16\|w\|0;while(v!==0);h=1<<U-1;while(b&h)h>>=1;if(h!==0)b&=h-1,b+=h;else b=0;if(P++,--Z[U]===0){if(U===K)break;U=Q[J+q[P]]}if(U>z&&(b&d)!==m){if(g===0)g=z;S+=H,C=U-g,E=1<<C;while(C+g<K){if(E-=Z[C+g],E<=0)break;C++,E<<=1}if(f+=1<<C,W===u8&&f>q5\|\|W===K5&&f>U5)return 1;m=b&d,G[m]=z<<24\|C<<16\|S-X\|0}}if(b!==0)G[S+b]=U-g<<24\|64<<16\|0;return Y.bits=z,0},N1=l9,i9=0,Y7=1,q7=2,{Z_FINISH:F5,Z_BLOCK:r9,Z_TREES:Q8,Z_OK:c0,Z_STREAM_END:n9,Z_NEED_DICT:o9,Z_STREAM_ERROR:z0,Z_DATA_ERROR:U7,Z_MEM_ERROR:P7,Z_BUF_ERROR:a9,Z_DEFLATED:z5}=l0,F8=16180,Z5=16181,H5=16182,k5=16183,$5=16184,j5=16185,C5=16186,B5=16187,M5=16188,R5=16189,U8=16190,L0=16191,m8=16192,L5=16193,_8=16194,I5=16195,O5=16196,D5=16197,x5=16198,V8=16199,G8=16200,w5=16201,N5=16202,S5=16203,v5=16204,A5=16205,d8=16206,T5=16207,g5=16208,n=16209,K7=16210,F7=16211,s9=852,e9=592,t9=15,WQ=t9,E5=(W)=>{return(W>>>24&255)+(W>>>8&65280)+((W&65280)<<8)+((W&255)<<24)},i0=(W)=>{if(!W)return 1;const Q=W.state;if(!Q\|\|Q.strm!==W\|\|Q.mode<F8\|\|Q.mode>F7)return 1;return 0},z7=(W)=>{if(i0(W))return z0;const Q=W.state;if(W.total_in=W.total_out=Q.total=0,W.msg="",Q.wrap)W.adler=Q.wrap&1;return Q.mode=F8,Q.last=0,Q.havedict=0,Q.flags=-1,Q.dmax=32768,Q.head=null,Q.hold=0,Q.bits=0,Q.lencode=Q.lendyn=new Int32Array(s9),Q.distcode=Q.distdyn=new Int32Array(e9),Q.sane=1,Q.back=-1,c0},Z7=(W)=>{if(i0(W))return z0;const Q=W.state;return Q.wsize=0,Q.whave=0,Q.wnext=0,z7(W)},H7=(W,Q)=>{let J;if(i0(W))return z0;const V=W.state;if(Q<0)J=0,Q=-Q;else if(J=(Q>>4)+5,Q<48)Q&=15;if(Q&&(Q<8\|\|Q>15))return z0;if(V.window!==null&&V.wbits!==Q)V.window=null;return V.wrap=J,V.wbits=Q,Z7(W)},k7=(W,Q)=>{if(!W)return z0;const J=new JQ;W.state=J,J.strm=W,J.window=null,J.mode=F8;const V=H7(W,Q);if(V!==c0)W.state=null;return V},QQ=(W)=>{return k7(W,WQ)},y5=!0,c8,l8,VQ=(W)=>{if(y5){c8=new Int32Array(512),l8=new Int32Array(32);let Q=0;while(Q<144)W.lens[Q++]=8;while(Q<256)W.lens[Q++]=9;while(Q<280)W.lens[Q++]=7;while(Q<288)W.lens[Q++]=8;N1(Y7,W.lens,0,288,c8,0,W.work,{bits:9}),Q=0;while(Q<32)W.lens[Q++]=5;N1(q7,W.lens,0,32,l8,0,W.work,{bits:5}),y5=!1}W.lencode=c8,W.lenbits=9,W.distcode=l8,W.distbits=5},$7=(W,Q,J,V)=>{let G;const X=W.state;if(X.window===null)X.wsize=1<<X.wbits,X.wnext=0,X.whave=0,X.window=new Uint8Array(X.wsize);if(V>=X.wsize)X.window.set(Q.subarray(J-X.wsize,J),0),X.wnext=0,X.whave=X.wsize;else{if(G=X.wsize-X.wnext,G>V)G=V;if(X.window.set(Q.subarray(J-V,J-V+G),X.wnext),V-=G,V)X.window.set(Q.subarray(J-V,J),0),X.wnext=V,X.whave=X.wsize;else{if(X.wnext+=G,X.wnext===X.wsize)X.wnext=0;if(X.whave<X.wsize)X.whave+=G}}return 0},GQ=(W,Q)=>{let J,V,G,X,q,Y,F,U,P,H,K,z,C,g,E=0,f,b,h,v,m,d,S,x;const A=new Uint8Array(4);let Z,k;const I=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);if(i0(W)\|\|!W.output\|\|!W.input&&W.avail_in!==0)return z0;if(J=W.state,J.mode===L0)J.mode=m8;q=W.next_out,G=W.output,F=W.avail_out,X=W.next_in,V=W.input,Y=W.avail_in,U=J.hold,P=J.bits,H=Y,K=F,x=c0;W:for(;;)switch(J.mode){case F8:if(J.wrap===0){J.mode=m8;break}while(P<16){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.wrap&2&&U===35615){if(J.wbits===0)J.wbits=15;J.check=0,A[0]=U&255,A[1]=U>>>8&255,J.check=t(J.check,A,2,0),U=0,P=0,J.mode=Z5;break}if(J.head)J.head.done=!1;if(!(J.wrap&1)\|\|(((U&255)<<8)+(U>>8))%31){W.msg="incorrect header check",J.mode=n;break}if((U&15)!==z5){W.msg="unknown compression method",J.mode=n;break}if(U>>>=4,P-=4,S=(U&15)+8,J.wbits===0)J.wbits=S;if(S>15\|\|S>J.wbits){W.msg="invalid window size",J.mode=n;break}J.dmax=1<<J.wbits,J.flags=0,W.adler=J.check=1,J.mode=U&512?R5:L0,U=0,P=0;break;case Z5:while(P<16){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.flags=U,(J.flags&255)!==z5){W.msg="unknown compression method",J.mode=n;break}if(J.flags&57344){W.msg="unknown header flags set",J.mode=n;break}if(J.head)J.head.text=U>>8&1;if(J.flags&512&&J.wrap&4)A[0]=U&255,A[1]=U>>>8&255,J.check=t(J.check,A,2,0);U=0,P=0,J.mode=H5;case H5:while(P<32){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.head)J.head.time=U;if(J.flags&512&&J.wrap&4)A[0]=U&255,A[1]=U>>>8&255,A[2]=U>>>16&255,A[3]=U>>>24&255,J.check=t(J.check,A,4,0);U=0,P=0,J.mode=k5;case k5:while(P<16){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.head)J.head.xflags=U&255,J.head.os=U>>8;if(J.flags&512&&J.wrap&4)A[0]=U&255,A[1]=U>>>8&255,J.check=t(J.check,A,2,0);U=0,P=0,J.mode=$5;case $5:if(J.flags&1024){while(P<16){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.length=U,J.head)J.head.extra_len=U;if(J.flags&512&&J.wrap&4)A[0]=U&255,A[1]=U>>>8&255,J.check=t(J.check,A,2,0);U=0,P=0}else if(J.head)J.head.extra=null;J.mode=j5;case j5:if(J.flags&1024){if(z=J.length,z>Y)z=Y;if(z){if(J.head){if(S=J.head.extra_len-J.length,!J.head.extra)J.head.extra=new Uint8Array(J.head.extra_len);J.head.extra.set(V.subarray(X,X+z),S)}if(J.flags&512&&J.wrap&4)J.check=t(J.check,V,z,X);Y-=z,X+=z,J.length-=z}if(J.length)break W}J.length=0,J.mode=C5;case C5:if(J.flags&2048){if(Y===0)break W;z=0;do if(S=V[X+z++],J.head&&S&&J.length<65536)J.head.name+=String.fromCharCode(S);while(S&&z<Y);if(J.flags&512&&J.wrap&4)J.check=t(J.check,V,z,X);if(Y-=z,X+=z,S)break W}else if(J.head)J.head.name=null;J.length=0,J.mode=B5;case B5:if(J.flags&4096){if(Y===0)break W;z=0;do if(S=V[X+z++],J.head&&S&&J.length<65536)J.head.comment+=String.fromCharCode(S);while(S&&z<Y);if(J.flags&512&&J.wrap&4)J.check=t(J.check,V,z,X);if(Y-=z,X+=z,S)break W}else if(J.head)J.head.comment=null;J.mode=M5;case M5:if(J.flags&512){while(P<16){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.wrap&4&&U!==(J.check&65535)){W.msg="header crc mismatch",J.mode=n;break}U=0,P=0}if(J.head)J.head.hcrc=J.flags>>9&1,J.head.done=!0;W.adler=J.check=0,J.mode=L0;break;case R5:while(P<32){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}W.adler=J.check=E5(U),U=0,P=0,J.mode=U8;case U8:if(J.havedict===0)return W.next_out=q,W.avail_out=F,W.next_in=X,W.avail_in=Y,J.hold=U,J.bits=P,o9;W.adler=J.check=1,J.mode=L0;case L0:if(Q===r9\|\|Q===Q8)break W;case m8:if(J.last){U>>>=P&7,P-=P&7,J.mode=d8;break}while(P<3){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}switch(J.last=U&1,U>>>=1,P-=1,U&3){case 0:J.mode=L5;break;case 1:if(VQ(J),J.mode=V8,Q===Q8){U>>>=2,P-=2;break W}break;case 2:J.mode=O5;break;case 3:W.msg="invalid block type",J.mode=n}U>>>=2,P-=2;break;case L5:U>>>=P&7,P-=P&7;while(P<32){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if((U&65535)!==(U>>>16^65535)){W.msg="invalid stored block lengths",J.mode=n;break}if(J.length=U&65535,U=0,P=0,J.mode=_8,Q===Q8)break W;case _8:J.mode=I5;case I5:if(z=J.length,z){if(z>Y)z=Y;if(z>F)z=F;if(z===0)break W;G.set(V.subarray(X,X+z),q),Y-=z,X+=z,F-=z,q+=z,J.length-=z;break}J.mode=L0;break;case O5:while(P<14){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.nlen=(U&31)+257,U>>>=5,P-=5,J.ndist=(U&31)+1,U>>>=5,P-=5,J.ncode=(U&15)+4,U>>>=4,P-=4,J.nlen>286\|\|J.ndist>30){W.msg="too many length or distance symbols",J.mode=n;break}J.have=0,J.mode=D5;case D5:while(J.have<J.ncode){while(P<3){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}J.lens[I[J.have++]]=U&7,U>>>=3,P-=3}while(J.have<19)J.lens[I[J.have++]]=0;if(J.lencode=J.lendyn,J.lenbits=7,Z={bits:J.lenbits},x=N1(i9,J.lens,0,19,J.lencode,0,J.work,Z),J.lenbits=Z.bits,x){W.msg="invalid code lengths set",J.mode=n;break}J.have=0,J.mode=x5;case x5:while(J.have<J.nlen+J.ndist){for(;;){if(E=J.lencode[U&(1<<J.lenbits)-1],f=E>>>24,b=E>>>16&255,h=E&65535,f<=P)break;if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(h<16)U>>>=f,P-=f,J.lens[J.have++]=h;else{if(h===16){k=f+2;while(P<k){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(U>>>=f,P-=f,J.have===0){W.msg="invalid bit length repeat",J.mode=n;break}S=J.lens[J.have-1],z=3+(U&3),U>>>=2,P-=2}else if(h===17){k=f+3;while(P<k){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}U>>>=f,P-=f,S=0,z=3+(U&7),U>>>=3,P-=3}else{k=f+7;while(P<k){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}U>>>=f,P-=f,S=0,z=11+(U&127),U>>>=7,P-=7}if(J.have+z>J.nlen+J.ndist){W.msg="invalid bit length repeat",J.mode=n;break}while(z--)J.lens[J.have++]=S}}if(J.mode===n)break;if(J.lens[256]===0){W.msg="invalid code -- missing end-of-block",J.mode=n;break}if(J.lenbits=9,Z={bits:J.lenbits},x=N1(Y7,J.lens,0,J.nlen,J.lencode,0,J.work,Z),J.lenbits=Z.bits,x){W.msg="invalid literal/lengths set",J.mode=n;break}if(J.distbits=6,J.distcode=J.distdyn,Z={bits:J.distbits},x=N1(q7,J.lens,J.nlen,J.ndist,J.distcode,0,J.work,Z),J.distbits=Z.bits,x){W.msg="invalid distances set",J.mode=n;break}if(J.mode=V8,Q===Q8)break W;case V8:J.mode=G8;case G8:if(Y>=6&&F>=258){if(W.next_out=q,W.avail_out=F,W.next_in=X,W.avail_in=Y,J.hold=U,J.bits=P,u9(W,K),q=W.next_out,G=W.output,F=W.avail_out,X=W.next_in,V=W.input,Y=W.avail_in,U=J.hold,P=J.bits,J.mode===L0)J.back=-1;break}J.back=0;for(;;){if(E=J.lencode[U&(1<<J.lenbits)-1],f=E>>>24,b=E>>>16&255,h=E&65535,f<=P)break;if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(b&&(b&240)===0){v=f,m=b,d=h;for(;;){if(E=J.lencode[d+((U&(1<<v+m)-1)>>v)],f=E>>>24,b=E>>>16&255,h=E&65535,v+f<=P)break;if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}U>>>=v,P-=v,J.back+=v}if(U>>>=f,P-=f,J.back+=f,J.length=h,b===0){J.mode=A5;break}if(b&32){J.back=-1,J.mode=L0;break}if(b&64){W.msg="invalid literal/length code",J.mode=n;break}J.extra=b&15,J.mode=w5;case w5:if(J.extra){k=J.extra;while(P<k){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}J.length+=U&(1<<J.extra)-1,U>>>=J.extra,P-=J.extra,J.back+=J.extra}J.was=J.length,J.mode=N5;case N5:for(;;){if(E=J.distcode[U&(1<<J.distbits)-1],f=E>>>24,b=E>>>16&255,h=E&65535,f<=P)break;if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if((b&240)===0){v=f,m=b,d=h;for(;;){if(E=J.distcode[d+((U&(1<<v+m)-1)>>v)],f=E>>>24,b=E>>>16&255,h=E&65535,v+f<=P)break;if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}U>>>=v,P-=v,J.back+=v}if(U>>>=f,P-=f,J.back+=f,b&64){W.msg="invalid distance code",J.mode=n;break}J.offset=h,J.extra=b&15,J.mode=S5;case S5:if(J.extra){k=J.extra;while(P<k){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}J.offset+=U&(1<<J.extra)-1,U>>>=J.extra,P-=J.extra,J.back+=J.extra}if(J.offset>J.dmax){W.msg="invalid distance too far back",J.mode=n;break}J.mode=v5;case v5:if(F===0)break W;if(z=K-F,J.offset>z){if(z=J.offset-z,z>J.whave){if(J.sane){W.msg="invalid distance too far back",J.mode=n;break}}if(z>J.wnext)z-=J.wnext,C=J.wsize-z;else C=J.wnext-z;if(z>J.length)z=J.length;g=J.window}else g=G,C=q-J.offset,z=J.length;if(z>F)z=F;F-=z,J.length-=z;do G[q++]=g[C++];while(--z);if(J.length===0)J.mode=G8;break;case A5:if(F===0)break W;G[q++]=J.length,F--,J.mode=G8;break;case d8:if(J.wrap){while(P<32){if(Y===0)break W;Y--,U\|=V[X++]<<P,P+=8}if(K-=F,W.total_out+=K,J.total+=K,J.wrap&4&&K)W.adler=J.check=J.flags?t(J.check,G,K,q-K):g1(J.check,G,K,q-K);if(K=F,J.wrap&4&&(J.flags?U:E5(U))!==J.check){W.msg="incorrect data check",J.mode=n;break}U=0,P=0}J.mode=T5;case T5:if(J.wrap&&J.flags){while(P<32){if(Y===0)break W;Y--,U+=V[X++]<<P,P+=8}if(J.wrap&4&&U!==(J.total&4294967295)){W.msg="incorrect length check",J.mode=n;break}U=0,P=0}J.mode=g5;case g5:x=n9;break W;case n:x=U7;break W;case K7:return P7;case F7:default:return z0}if(W.next_out=q,W.avail_out=F,W.next_in=X,W.avail_in=Y,J.hold=U,J.bits=P,J.wsize\|\|K!==W.avail_out&&J.mode<n&&(J.mode<d8\|\|Q!==F5)){if($7(W,W.output,W.next_out,K-W.avail_out));}if(H-=W.avail_in,K-=W.avail_out,W.total_in+=H,W.total_out+=K,J.total+=K,J.wrap&4&&K)W.adler=J.check=J.flags?t(J.check,G,K,W.next_out-K):g1(J.check,G,K,W.next_out-K);if(W.data_type=J.bits+(J.last?64:0)+(J.mode===L0?128:0)+(J.mode===V8\|\|J.mode===_8?256:0),(H===0&&K===0\|\|Q===F5)&&x===c0)x=a9;return x},XQ=(W)=>{if(i0(W))return z0;let Q=W.state;if(Q.window)Q.window=null;return W.state=null,c0},YQ=(W,Q)=>{if(i0(W))return z0;const J=W.state;if((J.wrap&2)===0)return z0;return J.head=Q,Q.done=!1,c0},qQ=(W,Q)=>{const J=Q.length;let V,G,X;if(i0(W))return z0;if(V=W.state,V.wrap!==0&&V.mode!==U8)return z0;if(V.mode===U8){if(G=1,G=g1(G,Q,J,0),G!==V.check)return U7}if(X=$7(W,Q,J,J),X)return V.mode=K7,P7;return V.havedict=1,c0},UQ=Z7,PQ=H7,KQ=z7,FQ=QQ,zQ=k7,ZQ=GQ,HQ=XQ,kQ=YQ,$Q=qQ,jQ="pako inflate (from Nodeca project)",O0={inflateReset:UQ,inflateReset2:PQ,inflateResetKeep:KQ,inflateInit:FQ,inflateInit2:zQ,inflate:ZQ,inflateEnd:HQ,inflateGetHeader:kQ,inflateSetDictionary:$Q,inflateInfo:jQ},BQ=CQ,j7=Object.prototype.toString,{Z_NO_FLUSH:MQ,Z_FINISH:RQ,Z_OK:p1,Z_STREAM_END:i8,Z_NEED_DICT:r8,Z_STREAM_ERROR:LQ,Z_DATA_ERROR:p5,Z_MEM_ERROR:IQ}=l0;u1.prototype.push=function(W,Q){const J=this.strm,V=this.options.chunkSize,G=this.options.dictionary;let X,q,Y;if(this.ended)return!1;if(Q===~~Q)q=Q;else q=Q===!0?RQ:MQ;if(j7.call(W)==="[object ArrayBuffer]")J.input=new Uint8Array(W);else J.input=W;J.next_in=0,J.avail_in=J.input.length;for(;;){if(J.avail_out===0)J.output=new Uint8Array(V),J.next_out=0,J.avail_out=V;if(X=O0.inflate(J,q),X===r8&&G){if(X=O0.inflateSetDictionary(J,G),X===p1)X=O0.inflate(J,q);else if(X===p5)X=r8}while(J.avail_in>0&&X===i8&&J.state.wrap>0&&W[J.next_in]!==0)O0.inflateReset(J),X=O0.inflate(J,q);switch(X){case LQ:case p5:case r8:case IQ:return this.onEnd(X),this.ended=!0,!1}if(Y=J.avail_out,J.next_out){if(J.avail_out===0\|\|X===i8)if(this.options.to==="string"){let F=y1.utf8border(J.output,J.next_out),U=J.next_out-F,P=y1.buf2string(J.output,F);if(J.next_out=U,J.avail_out=V-U,U)J.output.set(J.output.subarray(F,F+U),0);this.onData(P)}else this.onData(J.output.length===J.next_out?J.output:J.output.subarray(0,J.next_out))}if(X===p1&&Y===0)continue;if(X===i8)return X=O0.inflateEnd(this.strm),this.onEnd(X),this.ended=!0,!0;if(J.avail_in===0)break}return!0};u1.prototype.onData=function(W){this.chunks.push(W)};u1.prototype.onEnd=function(W){if(W===p1)if(this.options.to==="string")this.result=this.chunks.join("");else this.result=K8.flattenChunks(this.chunks);this.chunks=[],this.err=W,this.msg=this.strm.msg};var DQ=u1,xQ=P6,wQ=OQ,NQ=P6,SQ=l0,vQ={Inflate:DQ,inflate:xQ,inflateRaw:wQ,ungzip:NQ,constants:SQ},{Deflate:AQ,deflate:TQ,deflateRaw:gQ,gzip:EQ}=b9,{Inflate:yQ,inflate:pQ,inflateRaw:fQ,ungzip:bQ}=vQ,hQ=AQ,uQ=TQ,mQ=gQ,_Q=EQ,dQ=yQ,cQ=pQ,lQ=fQ,iQ=bQ,rQ=l0,m1={Deflate:hQ,deflate:uQ,deflateRaw:mQ,gzip:_Q,Inflate:dQ,inflate:cQ,inflateRaw:lQ,ungzip:iQ,constants:rQ};var w8=function(W){return W instanceof Uint8Array\|\|ArrayBuffer.isView(W)&&W.constructor.name==="Uint8Array"},B6=function(W){if(!Number.isSafeInteger(W)\|\|W<0)throw Error("positive integer expected, got "+W)},e0=function(W,...Q){if(!w8(W))throw Error("Uint8Array expected");if(Q.length>0&&!Q.includes(W.length))throw Error("Uint8Array expected of length "+Q+", got length="+W.length)},u7=function(W){if(typeof W!="function"\|\|typeof W.create!="function")throw Error("Hash should be wrapped by utils.createHasher");B6(W.outputLen),B6(W.blockLen)},C8=function(W,Q=!0){if(W.destroyed)throw Error("Hash instance has been destroyed");if(Q&&W.finished)throw Error("Hash#digest() has already been called")},B8=function(...W){for(let Q=0;Q<W.length;Q++)W[Q].fill(0)},K6=function(W){return new DataView(W.buffer,W.byteOffset,W.byteLength)},M0=function(W,Q){return W<<32-Q\|W>>>Q},H1=function(W){if(e0(W),m7)return W.toHex();let Q="";for(let J=0;J<W.length;J++)Q+=nQ[W[J]];return Q},R7=function(W){return W>=C7&&W<=oQ?W-C7:W>=B7&&W<=aQ?W-(B7-10):W>=M7&&W<=sQ?W-(M7-10):void 0},M8=function(W){if(typeof W!="string")throw Error("hex string expected, got "+typeof W);if(m7)return Uint8Array.fromHex(W);const Q=W.length,J=Q/2;if(Q%2)throw Error("hex string expected, got unpadded hex of length "+Q);const V=new Uint8Array(J);for(let G=0,X=0;G<J;G++,X+=2){const q=R7(W.charCodeAt(X)),Y=R7(W.charCodeAt(X+1));if(q===void 0\|\|Y===void 0){const F=W[X]+W[X+1];throw Error('hex string expected, got non-hex character "'+F+'" at index '+X)}V[G]=16q+Y}return V},_7=function(W){if(typeof W!="string")throw Error("string expected");return new Uint8Array((new TextEncoder()).encode(W))},N6=function(W){return typeof W=="string"&&(W=_7(W)),e0(W),W},R0=function(...W){let Q=0;for(let V=0;V<W.length;V++){const G=W[V];e0(G),Q+=G.length}const J=new Uint8Array(Q);for(let V=0,G=0;V<W.length;V++){const X=W[V];J.set(X,G),G+=X.length}return J},eQ=function(W){const Q=(V)=>W().update(N6(V)).digest(),J=W();return Q.outputLen=J.outputLen,Q.blockLen=J.blockLen,Q.create=()=>W(),Q},R8=function(W=32){if(P1&&typeof P1.getRandomValues=="function")return P1.getRandomValues(new Uint8Array(W));if(P1&&typeof P1.randomBytes=="function")return Uint8Array.from(P1.randomBytes(W));throw Error("crypto.getRandomValues must be defined")},tQ=function(W,Q,J){return W&Q^W&J^Q&J},L8=function(W,Q=""){if(typeof W!="boolean")throw Error((Q&&`"${Q}"`)+"expected boolean, got type="+typeof W);return W},r0=function(W,Q,J=""){const V=w8(W),G=W?.length,X=Q!==void 0;if(!V\|\|X&&G!==Q)throw Error((J&&`"${J}" `)+"expected Uint8Array"+(X?" of length "+Q:"")+", got "+(V?"length="+G:"type="+typeof W));return W},z8=function(W){const Q=W.toString(16);return 1&Q.length?"0"+Q:Q},i7=function(W){if(typeof W!="string")throw Error("hex string expected, got "+typeof W);return W===""?A6:BigInt("0x"+W)},j1=function(W){return i7(H1(W))},r7=function(W){return e0(W),i7(H1(Uint8Array.from(W).reverse()))},N8=function(W,Q){return M8(W.toString(16).padStart(2Q,"0"))},n7=function(W,Q){return N8(W,Q).reverse()},e=function(W,Q,J){let V;if(typeof Q=="string")try{V=M8(Q)}catch(X){throw Error(W+" must be hex string or Uint8Array, cause: "+X)}else{if(!w8(Q))throw Error(W+" must be hex string or Uint8Array");V=Uint8Array.from(Q)}const G=V.length;if(typeof J=="number"&&G!==J)throw Error(W+" of length "+J+" expected, got "+G);return V},L6=function(W,Q,J){return F6(W)&&F6(Q)&&F6(J)&&Q<=W&&W<J},o7=function(W){let Q;for(Q=0;W>A6;W>>=R6,Q+=1);return Q},T6=function(W,Q,J={}){if(!W\|\|typeof W!="object")throw Error("expected valid options object");function V(G,X,q){const Y=W[G];if(q&&Y===void 0)return;const F=typeof Y;if(F!==X\|\|Y===null)throw Error(`param "${G}" is invalid: expected ${X}, got ${F}`)}Object.entries(Q).forEach(([G,X])=>V(G,X,!1)),Object.entries(J).forEach(([G,X])=>V(G,X,!0))},L7=function(W){const Q=new WeakMap;return(J,...V)=>{const G=Q.get(J);if(G!==void 0)return G;const X=W(J,...V);return Q.set(J,X),X}},H0=function(W,Q){const J=W%Q;return J>=q0?J:Q+J},Z0=function(W,Q,J){let V=W;for(;Q-- >q0;)V=V,V%=J;return V},O7=function(W,Q){if(W===q0)throw Error("invert: expected non-zero number");if(Q<=q0)throw Error("invert: expected positive modulus, got "+Q);let J=H0(W,Q),V=Q,G=q0,X=X0;for(;J!==q0;){const q=V%J,Y=G-X(V/J);V=J,J=q,G=X,X=Y}if(V!==X0)throw Error("invert: does not exist");return H0(G,Q)},g6=function(W,Q,J){if(!W.eql(W.sqr(Q),J))throw Error("Cannot find square root")},WW=function(W,Q){const J=(W.ORDER+X0)/s7,V=W.pow(Q,J);return g6(W,V,Q),V},VV=function(W,Q){const J=(W.ORDER-e7)/t7,V=W.mul(Q,o0),G=W.pow(V,J),X=W.mul(Q,G),q=W.mul(W.mul(X,o0),G),Y=W.mul(X,W.sub(q,W.ONE));return g6(W,Y,Q),Y},D7=function(W){if(W<a7)throw Error("sqrt is not defined for small field");let Q=W-X0,J=0;for(;Q%o0===q0;)Q/=o0,J++;let V=o0;const G=r1(W);for(;x7(G,V)===1;)if(V++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return WW;let X=G.pow(V,Q);const q=(Q+X0)/o0;return function(Y,F){if(Y.is0(F))return F;if(x7(Y,F)!==1)throw Error("Cannot find square root");let U=J,P=Y.mul(Y.ONE,X),H=Y.pow(F,Q),K=Y.pow(F,q);for(;!Y.eql(H,Y.ONE);){if(Y.is0(H))return Y.ZERO;let z=1,C=Y.sqr(H);for(;!Y.eql(C,Y.ONE);)if(z++,C=Y.sqr(C),z===U)throw Error("Cannot find square root");const g=X0<<BigInt(U-z-1),E=Y.pow(P,g);U=z,P=Y.sqr(E),H=Y.mul(H,P),K=Y.mul(K,E)}return K}},GV=function(W){return W%s7===a7?WW:W%t7===e7?VV:W%I7===QV?function(Q){const J=r1(Q),V=D7(Q),G=V(J,J.neg(J.ONE)),X=V(J,G),q=V(J,J.neg(G)),Y=(Q+JV)/I7;return(F,U)=>{let P=F.pow(U,Y),H=F.mul(P,G);const K=F.mul(P,X),z=F.mul(P,q),C=F.eql(F.sqr(H),U),g=F.eql(F.sqr(K),U);P=F.cmov(P,H,C),H=F.cmov(z,K,g);const E=F.eql(F.sqr(H),U),f=F.cmov(P,H,E);return g6(F,f,U),f}}(W):D7(W)},JW=function(W,Q,J=!1){const V=Array(Q.length).fill(J?W.ZERO:void 0),G=Q.reduce((q,Y,F)=>W.is0(Y)?q:(V[F]=q,W.mul(q,Y)),W.ONE),X=W.inv(G);return Q.reduceRight((q,Y,F)=>W.is0(Y)?q:(V[F]=W.mul(q,V[F]),W.mul(q,Y)),X),V},x7=function(W,Q){const J=(W.ORDER-X0)/o0,V=W.pow(Q,J),G=W.eql(V,W.ONE),X=W.eql(V,W.ZERO),q=W.eql(V,W.neg(W.ONE));if(!G&&!X&&!q)throw Error("invalid Legendre symbol result");return G?1:X?0:-1},QW=function(W,Q){Q!==void 0&&B6(Q);const J=Q!==void 0?Q:W.toString(2).length;return{nBitLength:J,nByteLength:Math.ceil(J/8)}},r1=function(W,Q,J=!1,V={}){if(W<=q0)throw Error("invalid field: expected ORDER > 0, got "+W);let G,X,q,Y=!1;if(typeof Q=="object"&&Q!=null){if(V.sqrt\|\|J)throw Error("cannot specify opts in two arguments");const K=Q;K.BITS&&(G=K.BITS),K.sqrt&&(X=K.sqrt),typeof K.isLE=="boolean"&&(J=K.isLE),typeof K.modFromBytes=="boolean"&&(Y=K.modFromBytes),q=K.allowedLengths}else typeof Q=="number"&&(G=Q),V.sqrt&&(X=V.sqrt);const{nBitLength:F,nByteLength:U}=QW(W,G);if(U>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let P;const H=Object.freeze({ORDER:W,isLE:J,BITS:F,BYTES:U,MASK:i1(F),ZERO:q0,ONE:X0,allowedLengths:q,create(K){return H0(K,W)},isValid(K){if(typeof K!="bigint")throw Error("invalid field element: expected bigint, got "+typeof K);return q0<=K&&K<W},is0(K){return K===q0},isValidNot0(K){return!H.is0(K)&&H.isValid(K)},isOdd(K){return(K&X0)===X0},neg(K){return H0(-K,W)},eql(K,z){return K===z},sqr(K){return H0(KK,W)},add(K,z){return H0(K+z,W)},sub(K,z){return H0(K-z,W)},mul(K,z){return H0(Kz,W)},pow(K,z){return function(C,g,E){if(E<q0)throw Error("invalid exponent, negatives unsupported");if(E===q0)return C.ONE;if(E===X0)return g;let f=C.ONE,b=g;for(;E>q0;)E&X0&&(f=C.mul(f,b)),b=C.sqr(b),E>>=X0;return f}(H,K,z)},div(K,z){return H0(KO7(z,W),W)},sqrN(K){return KK},addN(K,z){return K+z},subN(K,z){return K-z},mulN(K,z){return Kz},inv(K){return O7(K,W)},sqrt:X\|\|((K)=>(P\|\|(P=GV(W)),P(H,K))),toBytes(K){return J?n7(K,U):N8(K,U)},fromBytes(K,z=!0){if(q){if(!q.includes(K.length)\|\|K.length>U)throw Error("Field.fromBytes: expected "+q+" bytes, got "+K.length);const g=new Uint8Array(U);g.set(K,J?0:g.length-K.length),K=g}if(K.length!==U)throw Error("Field.fromBytes: expected "+U+" bytes, got "+K.length);let C=J?r7(K):j1(K);if(Y&&(C=H0(C,W)),!z&&!H.isValid(C))throw Error("invalid field element: outside of range 0..ORDER");return C},invertBatch(K){return JW(H,K)},cmov(K,z,C){return C?z:K}});return Object.freeze(H)},VW=function(W){if(typeof W!="bigint")throw Error("field order must be bigint");const Q=W.toString(2).length;return Math.ceil(Q/8)},GW=function(W){const Q=VW(W);return Q+Math.ceil(Q/2)},XW=function(W,Q,J=!1){const V=W.length,G=VW(Q),X=GW(Q);if(V<16\|\|V<X\|\|V>1024)throw Error("expected "+X+"-1024 bytes of input, got "+V);const q=H0(J?r7(W):j1(W),Q-X0)+X0;return J?n7(q,G):N8(q,G)},I8=function(W,Q){const J=Q.negate();return W?J:Q},z6=function(W,Q){const J=JW(W.Fp,Q.map((V)=>V.Z));return Q.map((V,G)=>W.fromAffine(V.toAffine(J[G])))},YW=function(W,Q){if(!Number.isSafeInteger(W)\|\|W<=0\|\|W>Q)throw Error("invalid window size, expected [1.."+Q+"], got W="+W)},Z6=function(W,Q){YW(W,Q);const J=2W;return{windows:Math.ceil(Q/W)+1,windowSize:2(W-1),mask:i1(W),maxNumber:J,shiftBy:BigInt(W)}},w7=function(W,Q,J){const{windowSize:V,mask:G,maxNumber:X,shiftBy:q}=J;let Y=Number(W&G),F=W>>q;Y>V&&(Y-=X,F+=a0);const U=QV;return{nextN:F,offset:U+Math.abs(Y)-1,isZero:Y===0,isNeg:Y<0,isNegF:Q%2!=0,offsetF:U}},k6=function(W){return qW.get(W)\|\|1},N7=function(W){if(W!==k1)throw Error("invalid wNAF")},YV=function(W,Q,J,V){(function(K,z){if(!Array.isArray(K))throw Error("array expected");K.forEach((C,g)=>{if(!(C instanceof z))throw Error("invalid point at index "+g)})})(J,W),function(K,z){if(!Array.isArray(K))throw Error("array of scalars expected");K.forEach((C,g)=>{if(!z.isValid(C))throw Error("invalid scalar at index "+g)})}(V,Q);const G=J.length,X=V.length;if(G!==X)throw Error("arrays of points and scalars must have equal length");const q=W.ZERO,Y=o7(BigInt(G));let F=1;Y>12?F=Y-3:Y>4?F=Y-2:Y>0&&(F=2);const U=i1(F),P=Array(Number(U)+1).fill(q);let H=q;for(let K=Math.floor((Q.BITS-1)/F)F;K>=0;K-=F){P.fill(q);for(let C=0;C<X;C++){const g=V[C],E=Number(g>>BigInt(K)&U);P[E]=P[E].add(J[C])}let z=q;for(let C=P.length-1,g=q;C>0;C--)g=g.add(P[C]),z=z.add(g);if(H=H.add(z),K!==0)for(let C=0;C<F;C++)H=H.double()}return H},S7=function(W,Q,J){if(Q){if(Q.ORDER!==W)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return function(V){T6(V,XV.reduce((G,X)=>(G[X]="function",G),{ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"}))}(Q),Q}return r1(W,{isLE:J})},I6=function(W){if(!["compact","recovered","der"].includes(W))throw Error('Signature format must be "compact", "recovered", or "der"');return W},$6=function(W,Q){const J={};for(let V of Object.keys(Q))J[V]=W[V]===void 0?Q[V]:W[V];return L8(J.lowS,"lowS"),L8(J.prehash,"prehash"),J.format!==void 0&&I6(J.format),J},n0=function(W,Q){const{BYTES:J}=W;let V;if(typeof Q=="bigint")V=Q;else{let G=e("private key",Q);try{V=W.fromBytes(G)}catch(X){throw Error(`invalid private key: expected ui8a of size ${J}, got ${typeof Q}`)}}if(!W.isValidNot0(V))throw Error("invalid private key: out of range [1..N-1]");return V},UV=function(W,Q={}){const J=function(Z,k,I={},$){if($===void 0&&($=Z==="edwards"),!k\|\|typeof k!="object")throw Error(`expected valid ${Z} CURVE object`);for(let T of["p","n","h"]){const B=k[T];if(!(typeof B=="bigint"&&B>k1))throw Error(`CURVE.${T} must be positive bigint`)}const M=S7(k.p,I.Fp,$),w=S7(k.n,I.Fn,$),O=["Gx","Gy","a","b"];for(let T of O)if(!M.isValid(k[T]))throw Error(`CURVE.${T} must be valid field element of CURVE.Fp`);return{CURVE:k=Object.freeze(Object.assign({},k)),Fp:M,Fn:w}}("weierstrass",W,Q),{Fp:V,Fn:G}=J;let X=J.CURVE;const{h:q,n:Y}=X;T6(Q,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:F}=Q;if(F&&(!V.is0(X.a)\|\|typeof F.beta!="bigint"\|\|!Array.isArray(F.basises)))throw Error('invalid endo: expected "beta": bigint and "basises": array');const U=FW(V,G);function P(){if(!V.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}const H=Q.toBytes\|\|function(Z,k,I){const{x:$,y:M}=k.toAffine(),w=V.toBytes($);if(L8(I,"isCompressed"),I)return P(),R0(KW(!V.isOdd(M)),w);return R0(Uint8Array.of(4),w,V.toBytes(M))},K=Q.fromBytes\|\|function(Z){r0(Z,void 0,"Point");const{publicKey:k,publicKeyUncompressed:I}=U,$=Z.length,M=Z[0],w=Z.subarray(1);if($!==k\|\|M!==2&&M!==3){if($===I&&M===4){const O=V.BYTES,T=V.fromBytes(w.subarray(0,O)),B=V.fromBytes(w.subarray(O,2O));if(!C(T,B))throw Error("bad point: is not on curve");return{x:T,y:B}}throw Error(`bad point: got length ${$}, expected compressed=${k} or uncompressed=${I}`)}{const O=V.fromBytes(w);if(!V.isValid(O))throw Error("bad point: is not on curve, wrong x");const T=z(O);let B;try{B=V.sqrt(T)}catch(j){const L=j instanceof Error?": "+j.message:"";throw Error("bad point: is not on curve, sqrt error"+L)}return P(),!(1&~M)!==V.isOdd(B)&&(B=V.neg(B)),{x:O,y:B}}};function z(Z){const k=V.sqr(Z),I=V.mul(k,Z);return V.add(V.add(I,V.mul(Z,X.a)),X.b)}function C(Z,k){const I=V.sqr(k),$=z(Z);return V.eql(I,$)}if(!C(X.Gx,X.Gy))throw Error("bad curve params: generator point");const g=V.mul(V.pow(X.a,Z8),qV),E=V.mul(V.sqr(X.b),BigInt(27));if(V.is0(V.add(g,E)))throw Error("bad curve params: a or b");function f(Z,k,I=!1){if(!V.isValid(k)\|\|I&&V.is0(k))throw Error("bad point coordinate "+Z);return k}function b(Z){if(!(Z instanceof S))throw Error("ProjectivePoint expected")}function h(Z){if(!F\|\|!F.basises)throw Error("no endo");return function(k,I,$){const[[M,w],[O,T]]=I,B=v7(Tk,$),j=v7(-wk,$);let L=k-BM-jO,R=-Bw-jT;const D=L<w0,N=R<w0;D&&(L=-L),N&&(R=-R);const p=i1(Math.ceil(o7($)/2))+z1;if(L<w0\|\|L>=p\|\|R<w0\|\|R>=p)throw Error("splitScalar (endomorphism): failed, k="+k);return{k1neg:D,k1:L,k2neg:N,k2:R}}(Z,F.basises,G.ORDER)}const v=L7((Z,k)=>{const{X:I,Y:$,Z:M}=Z;if(V.eql(M,V.ONE))return{x:I,y:$};const w=Z.is0();k==null&&(k=w?V.ONE:V.inv(M));const O=V.mul(I,k),T=V.mul($,k),B=V.mul(M,k);if(w)return{x:V.ZERO,y:V.ZERO};if(!V.eql(B,V.ONE))throw Error("invZ was invalid");return{x:O,y:T}}),m=L7((Z)=>{if(Z.is0()){if(Q.allowInfinityPoint&&!V.is0(Z.Y))return;throw Error("bad point: ZERO")}const{x:k,y:I}=Z.toAffine();if(!V.isValid(k)\|\|!V.isValid(I))throw Error("bad point: x or y not field elements");if(!C(k,I))throw Error("bad point: equation left != right");if(!Z.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function d(Z,k,I,$,M){return I=new S(V.mul(I.X,Z),I.Y,I.Z),k=I8($,k),I=I8(M,I),k.add(I)}class S{constructor(Z,k,I){this.X=f("x",Z),this.Y=f("y",k,!0),this.Z=f("z",I),Object.freeze(this)}static CURVE(){return X}static fromAffine(Z){const{x:k,y:I}=Z\|\|{};if(!Z\|\|!V.isValid(k)\|\|!V.isValid(I))throw Error("invalid affine point");if(Z instanceof S)throw Error("projective point not allowed");return V.is0(k)&&V.is0(I)?S.ZERO:new S(k,I,V.ONE)}static fromBytes(Z){const k=S.fromAffine(K(r0(Z,void 0,"point")));return k.assertValidity(),k}static fromHex(Z){return S.fromBytes(e("pointHex",Z))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(Z=8,k=!0){return A.createCache(this,Z),k\|\|this.multiply(Z8),this}assertValidity(){m(this)}hasEvenY(){const{y:Z}=this.toAffine();if(!V.isOdd)throw Error("Field doesn't support isOdd");return!V.isOdd(Z)}equals(Z){b(Z);const{X:k,Y:I,Z:$}=this,{X:M,Y:w,Z:O}=Z,T=V.eql(V.mul(k,O),V.mul(M,$)),B=V.eql(V.mul(I,O),V.mul(w,$));return T&&B}negate(){return new S(this.X,V.neg(this.Y),this.Z)}double(){const{a:Z,b:k}=X,I=V.mul(k,Z8),{X:$,Y:M,Z:w}=this;let{ZERO:O,ZERO:T,ZERO:B}=V,j=V.mul($,$),L=V.mul(M,M),R=V.mul(w,w),D=V.mul($,M);return D=V.add(D,D),B=V.mul($,w),B=V.add(B,B),O=V.mul(Z,B),T=V.mul(I,R),T=V.add(O,T),O=V.sub(L,T),T=V.add(L,T),T=V.mul(O,T),O=V.mul(D,O),B=V.mul(I,B),R=V.mul(Z,R),D=V.sub(j,R),D=V.mul(Z,D),D=V.add(D,B),B=V.add(j,j),j=V.add(B,j),j=V.add(j,R),j=V.mul(j,D),T=V.add(T,j),R=V.mul(M,w),R=V.add(R,R),j=V.mul(R,D),O=V.sub(O,j),B=V.mul(R,L),B=V.add(B,B),B=V.add(B,B),new S(O,T,B)}add(Z){b(Z);const{X:k,Y:I,Z:$}=this,{X:M,Y:w,Z:O}=Z;let{ZERO:T,ZERO:B,ZERO:j}=V;const L=X.a,R=V.mul(X.b,Z8);let D=V.mul(k,M),N=V.mul(I,w),p=V.mul($,O),y=V.add(k,I),u=V.add(M,w);y=V.mul(y,u),u=V.add(D,N),y=V.sub(y,u),u=V.add(k,$);let _=V.add(M,O);return u=V.mul(u,_),_=V.add(D,p),u=V.sub(u,_),_=V.add(I,$),T=V.add(w,O),_=V.mul(_,T),T=V.add(N,p),_=V.sub(_,T),j=V.mul(L,u),T=V.mul(R,p),j=V.add(T,j),T=V.sub(N,j),j=V.add(N,j),B=V.mul(T,j),N=V.add(D,D),N=V.add(N,D),p=V.mul(L,p),u=V.mul(R,u),N=V.add(N,p),p=V.sub(D,p),p=V.mul(L,p),u=V.add(u,p),D=V.mul(N,u),B=V.add(B,D),D=V.mul(_,u),T=V.mul(y,T),T=V.sub(T,D),D=V.mul(y,N),j=V.mul(_,j),j=V.add(j,D),new S(T,B,j)}subtract(Z){return this.add(Z.negate())}is0(){return this.equals(S.ZERO)}multiply(Z){const{endo:k}=Q;if(!G.isValidNot0(Z))throw Error("invalid scalar: out of range");let I,$;const M=(w)=>A.cached(this,w,(O)=>z6(S,O));if(k){const{k1neg:w,k1:O,k2neg:T,k2:B}=h(Z),{p:j,f:L}=M(O),{p:R,f:D}=M(B);$=L.add(D),I=d(k.beta,j,R,w,T)}else{const{p:w,f:O}=M(Z);I=w,$=O}return z6(S,[I,$])[0]}multiplyUnsafe(Z){const{endo:k}=Q,I=this;if(!G.isValid(Z))throw Error("invalid scalar: out of range");if(Z===w0\|\|I.is0())return S.ZERO;if(Z===z1)return I;if(A.hasCache(this))return this.multiply(Z);if(k){const{k1neg:$,k1:M,k2neg:w,k2:O}=h(Z),{p1:T,p2:B}=function(j,L,R,D){let N=L,p=j.ZERO,y=j.ZERO;for(;R>k1\|\|D>k1;)R&a0&&(p=p.add(N)),D&a0&&(y=y.add(N)),N=N.double(),R>>=a0,D>>=a0;return{p1:p,p2:y}}(S,I,M,O);return d(k.beta,T,B,$,w)}return A.unsafe(I,Z)}multiplyAndAddUnsafe(Z,k,I){const $=this.multiplyUnsafe(k).add(Z.multiplyUnsafe(I));return $.is0()?void 0:$}toAffine(Z){return v(this,Z)}isTorsionFree(){const{isTorsionFree:Z}=Q;return q===z1\|\|(Z?Z(S,this):A.unsafe(this,Y).is0())}clearCofactor(){const{clearCofactor:Z}=Q;return q===z1?this:Z?Z(S,this):this.multiplyUnsafe(q)}isSmallOrder(){return this.multiplyUnsafe(q).is0()}toBytes(Z=!0){return L8(Z,"isCompressed"),this.assertValidity(),H(S,this,Z)}toHex(Z=!0){return H1(this.toBytes(Z))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(Z=!0){return this.toBytes(Z)}_setWindowSize(Z){this.precompute(Z)}static normalizeZ(Z){return z6(S,Z)}static msm(Z,k){return YV(S,G,Z,k)}static fromPrivateKey(Z){return S.BASE.multiply(n0(G,Z))}}S.BASE=new S(X.Gx,X.Gy,V.ONE),S.ZERO=new S(V.ZERO,V.ONE,V.ZERO),S.Fp=V,S.Fn=G;const x=G.BITS,A=new UW(S,Q.endo?Math.ceil(x/2):x);return S.BASE.precompute(8),S},KW=function(W){return Uint8Array.of(W?2:3)},FW=function(W,Q){return{secretKey:Q.BYTES,publicKey:1+W.BYTES,publicKeyUncompressed:1+2W.BYTES,publicKeyHasPrefix:!0,signature:2Q.BYTES}},PV=function(W,Q,J={}){u7(Q),T6(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const V=J.randomBytes\|\|R8,G=J.hmac\|\|((x,...A)=>l7(Q,x,R0(...A))),{Fp:X,Fn:q}=W,{ORDER:Y,BITS:F}=q,{keygen:U,getPublicKey:P,getSharedSecret:H,utils:K,lengths:z}=function(x,A={}){const{Fn:Z}=x,k=A.randomBytes\|\|R8,I=Object.assign(FW(x.Fp,Z),{seed:GW(Z.ORDER)});function $(B){try{return!!n0(Z,B)}catch(j){return!1}}function M(B=k(I.seed)){return XW(r0(B,I.seed,"seed"),Z.ORDER)}function w(B,j=!0){return x.BASE.multiply(n0(Z,B)).toBytes(j)}function O(B){if(typeof B=="bigint")return!1;if(B instanceof x)return!0;const{secretKey:j,publicKey:L,publicKeyUncompressed:R}=I;if(Z.allowedLengths\|\|j===L)return;const D=e("key",B).length;return D===L\|\|D===R}return Object.freeze({getPublicKey:w,getSharedSecret(B,j,L=!0){if(O(B)===!0)throw Error("first arg must be private key");if(O(j)===!1)throw Error("second arg must be public key");const R=n0(Z,B);return x.fromHex(j).multiply(R).toBytes(L)},keygen(B){const j=M(B);return{secretKey:j,publicKey:w(j)}},Point:x,utils:{isValidSecretKey:$,isValidPublicKey(B,j){const{publicKey:L,publicKeyUncompressed:R}=I;try{const D=B.length;return!(j===!0&&D!==L\|\|j===!1&&D!==R\|\|!x.fromBytes(B))}catch(D){return!1}},randomSecretKey:M,isValidPrivateKey:$,randomPrivateKey:M,normPrivateKeyToScalar:(B)=>n0(Z,B),precompute(B=8,j=x.BASE){return j.precompute(B,!1)}},lengths:I})}(W,J),C={prehash:!1,lowS:typeof J.lowS=="boolean"&&J.lowS,format:void 0,extraEntropy:!1},g="compact";function E(x){return x>Y>>z1}function f(x,A){if(!q.isValidNot0(A))throw Error(`invalid signature ${x}: out of range 1..Point.Fn.ORDER`);return A}class b{constructor(x,A,Z){this.r=f("r",x),this.s=f("s",A),Z!=null&&(this.recovery=Z),Object.freeze(this)}static fromBytes(x,A=g){let Z;if(function(M,w){I6(w);const O=z.signature;r0(M,w==="compact"?O:w==="recovered"?O+1:void 0,w+" signature")}(x,A),A==="der"){const{r:M,s:w}=x0.toSig(r0(x));return new b(M,w)}A==="recovered"&&(Z=x[0],A="compact",x=x.subarray(1));const k=q.BYTES,I=x.subarray(0,k),$=x.subarray(k,2k);return new b(q.fromBytes(I),q.fromBytes($),Z)}static fromHex(x,A){return this.fromBytes(M8(x),A)}addRecoveryBit(x){return new b(this.r,this.s,x)}recoverPublicKey(x){const A=X.ORDER,{r:Z,s:k,recovery:I}=this;if(I==null\|\|![0,1,2,3].includes(I))throw Error("recovery id invalid");if(YPW<A&&I>1)throw Error("recovery id is ambiguous for h>1 curve");const $=I===2\|\|I===3?Z+Y:Z;if(!X.isValid($))throw Error("recovery id 2 or 3 invalid");const M=X.toBytes($),w=W.fromBytes(R0(KW(!(1&I)),M)),O=q.inv($),T=v(e("msgHash",x)),B=q.create(-TO),j=q.create(kO),L=W.BASE.multiplyUnsafe(B).add(w.multiplyUnsafe(j));if(L.is0())throw Error("point at infinify");return L.assertValidity(),L}hasHighS(){return E(this.s)}toBytes(x=g){if(I6(x),x==="der")return M8(x0.hexFromSig(this));const A=q.toBytes(this.r),Z=q.toBytes(this.s);if(x==="recovered"){if(this.recovery==null)throw Error("recovery bit must be present");return R0(Uint8Array.of(this.recovery),A,Z)}return R0(A,Z)}toHex(x){return H1(this.toBytes(x))}assertValidity(){}static fromCompact(x){return b.fromBytes(e("sig",x),"compact")}static fromDER(x){return b.fromBytes(e("sig",x),"der")}normalizeS(){return this.hasHighS()?new b(this.r,q.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return H1(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return H1(this.toBytes("compact"))}}const h=J.bits2int\|\|function(x){if(x.length>8192)throw Error("input is too large");const A=j1(x),Z=8x.length-F;return Z>0?A>>BigInt(Z):A},v=J.bits2int_modN\|\|function(x){return q.create(h(x))},m=i1(F);function d(x){return function(A,Z,k,I){if(!L6(Z,k,I))throw Error("expected valid "+A+": "+k+" <= n < "+I+", got "+Z)}("num < 2^"+F,x,w0,m),q.toBytes(x)}function S(x,A){return r0(x,void 0,"message"),A?r0(Q(x),void 0,"prehashed message"):x}return Object.freeze({keygen:U,getPublicKey:P,getSharedSecret:H,utils:K,lengths:z,Point:W,sign(x,A,Z={}){x=e("message",x);const{seed:k,k2sig:I}=function($,M,w){if(["recovered","canonical"].some((p)=>(p in w)))throw Error("sign() legacy options not supported");const{lowS:O,prehash:T,extraEntropy:B}=$6(w,C);$=S($,T);const j=v($),L=n0(q,M),R=[d(L),d(j)];if(B!=null&&B!==!1){const p=B===!0?V(z.secretKey):B;R.push(e("extraEntropy",p))}const D=R0(...R),N=j;return{seed:D,k2sig(p){const y=h(p);if(!q.isValidNot0(y))return;const u=q.inv(y),_=W.BASE.multiply(y).toAffine(),a=q.create(_.x);if(a===w0)return;const o=q.create(uq.create(N+aL));if(o===w0)return;let W0=(_.x===a?0:2)\|Number(_.y&z1),Q0=o;return O&&E(o)&&(Q0=q.neg(o),W0^=1),new b(a,Q0,W0)}}}(x,A,Z);return function($,M,w){if(typeof $!="number"\|\|$<2)throw Error("hashLen must be a number");if(typeof M!="number"\|\|M<2)throw Error("qByteLen must be a number");if(typeof w!="function")throw Error("hmacFn must be a function");const O=(y)=>new Uint8Array(y),T=(y)=>Uint8Array.of(y);let B=O($),j=O($),L=0;const R=()=>{B.fill(1),j.fill(0),L=0},D=(...y)=>w(j,B,...y),N=(y=O(0))=>{j=D(T(0),y),B=D(),y.length!==0&&(j=D(T(1),y),B=D())},p=()=>{if(L++>=1000)throw Error("drbg: tried 1000 values");let y=0;const u=[];for(;y<M;){B=D();const _=B.slice();u.push(_),y+=B.length}return R0(...u)};return(y,u)=>{let _;for(R(),N(y);!(_=u(p()));)N();return R(),_}}(Q.outputLen,q.BYTES,G)(k,I)},verify(x,A,Z,k={}){const{lowS:I,prehash:$,format:M}=$6(k,C);if(Z=e("publicKey",Z),A=S(e("message",A),$),("strict"in k))throw Error("options.strict was renamed to lowS");const w=M===void 0?function(O){let T;const B=typeof O=="string"\|\|w8(O),j=!B&&O!==null&&typeof O=="object"&&typeof O.r=="bigint"&&typeof O.s=="bigint";if(!B&&!j)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(j)T=new b(O.r,O.s);else if(B){try{T=b.fromBytes(e("sig",O),"der")}catch(L){if(!(L instanceof x0.Err))throw L}if(!T)try{T=b.fromBytes(e("sig",O),"compact")}catch(L){return!1}}return T\|\|!1}(x):b.fromBytes(e("sig",x),M);if(w===!1)return!1;try{const O=W.fromBytes(Z);if(I&&w.hasHighS())return!1;const{r:T,s:B}=w,j=v(A),L=q.inv(B),R=q.create(jL),D=q.create(TL),N=W.BASE.multiplyUnsafe(R).add(O.multiplyUnsafe(D));if(N.is0())return!1;return q.create(N.x)===T}catch(O){return!1}},recoverPublicKey(x,A,Z={}){const{prehash:k}=$6(Z,C);return A=S(A,k),b.fromBytes(x,"recovered").recoverPublicKey(A).toBytes()},Signature:b,hash:Q})},KV=function(W){const{CURVE:Q,curveOpts:J}=function(G){const X={a:G.a,b:G.b,p:G.Fp.ORDER,n:G.n,h:G.h,Gx:G.Gx,Gy:G.Gy},q=G.Fp;let Y=G.allowedPrivateKeyLengths?Array.from(new Set(G.allowedPrivateKeyLengths.map((F)=>Math.ceil(F/2)))):void 0;return{CURVE:X,curveOpts:{Fp:q,Fn:r1(X.n,{BITS:G.nBitLength,allowedLengths:Y,modFromBytes:G.wrapPrivateKey}),allowInfinityPoint:G.allowInfinityPoint,endo:G.endo,isTorsionFree:G.isTorsionFree,clearCofactor:G.clearCofactor,fromBytes:G.fromBytes,toBytes:G.toBytes}}}(W),V={hmac:W.hmac,randomBytes:W.randomBytes,lowS:W.lowS,bits2int:W.bits2int,bits2int_modN:W.bits2int_modN};return{CURVE:Q,curveOpts:J,hash:W.hash,ecdsaOpts:V}},FV=function(W){const{CURVE:Q,curveOpts:J,hash:V,ecdsaOpts:G}=KV(W);return function(X,q){const Y=q.Point;return Object.assign({},q,{ProjectivePoint:Y,CURVE:Object.assign({},X,QW(Y.Fn.ORDER,Y.Fn.BITS))})}(W,PV(UV(Q,J),V,G))},D8=function(W,...Q){let J=T7[W];if(J===void 0){const V=M6(_7(W));J=R0(V,V),T7[W]=J}return M6(R0(J,...Q))},D6=function(W){const{Fn:Q,BASE:J}=C1,V=n0(Q,W),G=J.multiply(V);return{scalar:y6(G.y)?V:Q.neg(V),bytes:E6(G)}},ZW=function(W){const Q=O8;if(!Q.isValidNot0(W))throw Error("invalid x: Fail if x \u2265 p");const J=Q.create(WW),V=Q.create(JW+BigInt(7));let G=Q.sqrt(V);y6(G)\|\|(G=Q.neg(G));const X=C1.fromAffine({x:W,y:G});return X.assertValidity(),X},HW=function(...W){return C1.Fn.create(l1(D8("BIP0340/challenge",...W)))},g7=function(W){return D6(W).bytes},HV=function(W,Q,J=R8(32)){const{Fn:V}=C1,G=e("message",W),{bytes:X,scalar:q}=D6(Q),Y=e("auxRand",J,32),F=V.toBytes(q^l1(D8("BIP0340/aux",Y))),U=D8("BIP0340/nonce",F,X,G),{bytes:P,scalar:H}=D6(U),K=HW(P,X,G),z=new Uint8Array(64);if(z.set(P,0),z.set(V.toBytes(V.create(H+Kq)),32),!kW(z,G,X))throw Error("sign: Invalid signature produced");return z},kW=function(W,Q,J){const{Fn:V,BASE:G}=C1,X=e("signature",W,64),q=e("message",Q),Y=e("publicKey",J,32);try{const F=ZW(l1(Y)),U=l1(X.subarray(0,32));if(!L6(U,A7,$1.p))return!1;const P=l1(X.subarray(32,64));if(!L6(P,A7,$1.n))return!1;const H=HW(V.toBytes(U),E6(F),q),K=G.multiplyUnsafe(P).add(F.multiplyUnsafe(V.neg(H))),{x:z,y:C}=K.toAffine();return!(K.is0()\|\|!y6(C)\|\|z!==U)}catch(F){return!1}},P1=typeof globalThis=="object"&&("crypto"in globalThis)?globalThis.crypto:void 0,m7=(()=>typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function")(),nQ=Array.from({length:256},(W,Q)=>Q.toString(16).padStart(2,"0")),C7=48,oQ=57,B7=65,aQ=70,M7=97,sQ=102;class S6{}class d7 extends S6{constructor(W,Q,J,V){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=W,this.outputLen=Q,this.padOffset=J,this.isLE=V,this.buffer=new Uint8Array(W),this.view=K6(this.buffer)}update(W){C8(this),e0(W=N6(W));const{view:Q,buffer:J,blockLen:V}=this,G=W.length;for(let X=0;X<G;){const q=Math.min(V-this.pos,G-X);if(q!==V)J.set(W.subarray(X,X+q),this.pos),this.pos+=q,X+=q,this.pos===V&&(this.process(Q,0),this.pos=0);else{const Y=K6(W);for(;V<=G-X;X+=V)this.process(Y,X)}}return this.length+=W.length,this.roundClean(),this}digestInto(W){C8(this),function(P,H){e0(P);const K=H.outputLen;if(P.length<K)throw Error("digestInto() expects output buffer of length at least "+K)}(W,this),this.finished=!0;const{buffer:Q,view:J,blockLen:V,isLE:G}=this;let{pos:X}=this;Q[X++]=128,B8(this.buffer.subarray(X)),this.padOffset>V-X&&(this.process(J,0),X=0);for(let P=X;P<V;P++)Q[P]=0;(function(P,H,K,z){if(typeof P.setBigUint64=="function")return P.setBigUint64(H,K,z);const C=BigInt(32),g=BigInt(4294967295),E=Number(K>>C&g),f=Number(K&g),b=z?4:0,h=z?0:4;P.setUint32(H+b,E,z),P.setUint32(H+h,f,z)})(J,V-8,BigInt(8this.length),G),this.process(J,0);const q=K6(W),Y=this.outputLen;if(Y%4)throw Error("_sha2: outputLen should be aligned to 32bit");const F=Y/4,U=this.get();if(F>U.length)throw Error("_sha2: outputLen bigger than state");for(let P=0;P<F;P++)q.setUint32(4P,U[P],G)}digest(){const{buffer:W,outputLen:Q}=this;this.digestInto(W);const J=W.slice(0,Q);return this.destroy(),J}_cloneInto(W){W\|\|(W=new this.constructor),W.set(...this.get());const{blockLen:Q,buffer:J,length:V,finished:G,destroyed:X,pos:q}=this;return W.destroyed=X,W.finished=G,W.length=V,W.pos=q,V%Q&&W.buffer.set(J),W}clone(){return this._cloneInto()}}var p0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),WV=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),f0=new Uint32Array(64);class c7 extends d7{constructor(W=32){super(64,W,8,!1),this.A=0\|p0[0],this.B=0\|p0[1],this.C=0\|p0[2],this.D=0\|p0[3],this.E=0\|p0[4],this.F=0\|p0[5],this.G=0\|p0[6],this.H=0\|p0[7]}get(){const{A:W,B:Q,C:J,D:V,E:G,F:X,G:q,H:Y}=this;return[W,Q,J,V,G,X,q,Y]}set(W,Q,J,V,G,X,q,Y){this.A=0\|W,this.B=0\|Q,this.C=0\|J,this.D=0\|V,this.E=0\|G,this.F=0\|X,this.G=0\|q,this.H=0\|Y}process(W,Q){for(let H=0;H<16;H++,Q+=4)f0[H]=W.getUint32(Q,!1);for(let H=16;H<64;H++){const K=f0[H-15],z=f0[H-2],C=M0(K,7)^M0(K,18)^K>>>3,g=M0(z,17)^M0(z,19)^z>>>10;f0[H]=g+f0[H-7]+C+f0[H-16]\|0}let{A:J,B:V,C:G,D:X,E:q,F:Y,G:F,H:U}=this;for(let H=0;H<64;H++){const K=U+(M0(q,6)^M0(q,11)^M0(q,25))+((P=q)&Y^~P&F)+WV[H]+f0[H]\|0,z=(M0(J,2)^M0(J,13)^M0(J,22))+tQ(J,V,G)\|0;U=F,F=Y,Y=q,q=X+K\|0,X=G,G=V,V=J,J=K+z\|0}var P;J=J+this.A\|0,V=V+this.B\|0,G=G+this.C\|0,X=X+this.D\|0,q=q+this.E\|0,Y=Y+this.F\|0,F=F+this.G\|0,U=U+this.H\|0,this.set(J,V,G,X,q,Y,F,U)}roundClean(){B8(f0)}destroy(){this.set(0,0,0,0,0,0,0,0),B8(this.buffer)}}var M6=eQ(()=>new c7);class v6 extends S6{constructor(W,Q){super(),this.finished=!1,this.destroyed=!1,u7(W);const J=N6(Q);if(this.iHash=W.create(),typeof this.iHash.update!="function")throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const V=this.blockLen,G=new Uint8Array(V);G.set(J.length>V?W.create().update(J).digest():J);for(let X=0;X<G.length;X++)G[X]^=54;this.iHash.update(G),this.oHash=W.create();for(let X=0;X<G.length;X++)G[X]^=106;this.oHash.update(G),B8(G)}update(W){return C8(this),this.iHash.update(W),this}digestInto(W){C8(this),e0(W,this.outputLen),this.finished=!0,this.iHash.digestInto(W),this.oHash.update(W),this.oHash.digestInto(W),this.destroy()}digest(){const W=new Uint8Array(this.oHash.outputLen);return this.digestInto(W),W}_cloneInto(W){W\|\|(W=Object.create(Object.getPrototypeOf(this),{}));const{oHash:Q,iHash:J,finished:V,destroyed:G,blockLen:X,outputLen:q}=this;return W.finished=V,W.destroyed=G,W.blockLen=X,W.outputLen=q,W.oHash=Q._cloneInto(W.oHash),W.iHash=J._cloneInto(W.iHash),W}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var l7=(W,Q,J)=>new v6(W,Q).update(J).digest();l7.create=(W,Q)=>new v6(W,Q);var A6=BigInt(0),R6=BigInt(1),F6=(W)=>typeof W=="bigint"&&A6<=W,i1=(W)=>(R6<<BigInt(W))-R6,q0=BigInt(0),X0=BigInt(1),o0=BigInt(2),a7=BigInt(3),s7=BigInt(4),e7=BigInt(5),JV=BigInt(7),t7=BigInt(8),QV=BigInt(9),I7=BigInt(16),XV=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"],k1=BigInt(0),a0=BigInt(1),H6=new WeakMap,qW=new WeakMap;class UW{constructor(W,Q){this.BASE=W.BASE,this.ZERO=W.ZERO,this.Fn=W.Fn,this.bits=Q}_unsafeLadder(W,Q,J=this.ZERO){let V=W;for(;Q>k1;)Q&a0&&(J=J.add(V)),V=V.double(),Q>>=a0;return J}precomputeWindow(W,Q){const{windows:J,windowSize:V}=Z6(Q,this.bits),G=[];let X=W,q=X;for(let Y=0;Y<J;Y++){q=X,G.push(q);for(let F=1;F<V;F++)q=q.add(X),G.push(q);X=q.double()}return G}wNAF(W,Q,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let V=this.ZERO,G=this.BASE;const X=Z6(W,this.bits);for(let q=0;q<X.windows;q++){const{nextN:Y,offset:F,isZero:U,isNeg:P,isNegF:H,offsetF:K}=w7(J,q,X);J=Y,U?G=G.add(I8(H,Q[K])):V=V.add(I8(P,Q[F]))}return N7(J),{p:V,f:G}}wNAFUnsafe(W,Q,J,V=this.ZERO){const G=Z6(W,this.bits);for(let X=0;X<G.windows&&J!==k1;X++){const{nextN:q,offset:Y,isZero:F,isNeg:U}=w7(J,X,G);if(J=q,!F){const P=Q[Y];V=V.add(U?P.negate():P)}}return N7(J),V}getPrecomputes(W,Q,J){let V=H6.get(Q);return V\|\|(V=this.precomputeWindow(Q,W),W!==1&&(typeof J=="function"&&(V=J(V)),H6.set(Q,V))),V}cached(W,Q,J){const V=k6(W);return this.wNAF(V,this.getPrecomputes(V,W,J),Q)}unsafe(W,Q,J,V){const G=k6(W);return G===1?this._unsafeLadder(W,Q,V):this.wNAFUnsafe(G,this.getPrecomputes(G,W,J),Q,V)}createCache(W,Q){YW(Q,this.bits),qW.set(W,Q),H6.delete(W)}hasCache(W){return k6(W)!==1}}var v7=(W,Q)=>(W+(W>=0?Q:-Q)/PW)/Q,x0={Err:class extends Error{constructor(W=""){super(W)}},_tlv:{encode(W,Q){const{Err:J}=x0;if(W<0\|\|W>256)throw new J("tlv.encode: wrong tag");if(1&Q.length)throw new J("tlv.encode: unpadded data");const V=Q.length/2,G=z8(V);if(G.length/2&128)throw new J("tlv.encode: long form length too big");const X=V>127?z8(G.length/2\|128):"";return z8(W)+X+G+Q},decode(W,Q){const{Err:J}=x0;let V=0;if(W<0\|\|W>256)throw new J("tlv.encode: wrong tag");if(Q.length<2\|\|Q[V++]!==W)throw new J("tlv.decode: wrong tlv");const G=Q[V++];let X=0;if(128&G){const Y=127&G;if(!Y)throw new J("tlv.decode(long): indefinite length not supported");if(Y>4)throw new J("tlv.decode(long): byte length is too big");const F=Q.subarray(V,V+Y);if(F.length!==Y)throw new J("tlv.decode: length bytes not complete");if(F[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let U of F)X=X<<8\|U;if(V+=Y,X<128)throw new J("tlv.decode(long): not minimal encoding")}else X=G;const q=Q.subarray(V,V+X);if(q.length!==X)throw new J("tlv.decode: wrong value length");return{v:q,l:Q.subarray(V+X)}}},_int:{encode(W){const{Err:Q}=x0;if(W<w0)throw new Q("integer: negative integers are not allowed");let J=z8(W);if(8&Number.parseInt(J[0],16)&&(J="00"+J),1&J.length)throw new Q("unexpected DER parsing assertion: unpadded hex");return J},decode(W){const{Err:Q}=x0;if(128&W[0])throw new Q("invalid signature integer: negative");if(W[0]===0&&!(128&W[1]))throw new Q("invalid signature integer: unnecessary leading zero");return j1(W)}},toSig(W){const{Err:Q,_int:J,_tlv:V}=x0,G=e("signature",W),{v:X,l:q}=V.decode(48,G);if(q.length)throw new Q("invalid signature: left bytes after parsing");const{v:Y,l:F}=V.decode(2,X),{v:U,l:P}=V.decode(2,F);if(P.length)throw new Q("invalid signature: left bytes after parsing");return{r:J.decode(Y),s:J.decode(U)}},hexFromSig(W){const{_tlv:Q,_int:J}=x0,V=Q.encode(2,J.encode(W.r))+Q.encode(2,J.encode(W.s));return Q.encode(48,V)}},w0=BigInt(0),z1=BigInt(1),PW=BigInt(2),Z8=BigInt(3),qV=BigInt(4),$1={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},zV={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},ZV=BigInt(0),A7=BigInt(1),O6=BigInt(2),O8=r1($1.p,{sqrt(W){const Q=$1.p,J=BigInt(3),V=BigInt(6),G=BigInt(11),X=BigInt(22),q=BigInt(23),Y=BigInt(44),F=BigInt(88),U=WWW%Q,P=UUW%Q,H=Z0(P,J,Q)P%Q,K=Z0(H,J,Q)P%Q,z=Z0(K,O6,Q)U%Q,C=Z0(z,G,Q)z%Q,g=Z0(C,X,Q)C%Q,E=Z0(g,Y,Q)g%Q,f=Z0(E,F,Q)E%Q,b=Z0(f,Y,Q)g%Q,h=Z0(b,J,Q)P%Q,v=Z0(h,q,Q)C%Q,m=Z0(v,V,Q)U%Q,d=Z0(m,O6,Q);if(!O8.eql(O8.sqr(d),W))throw Error("Cannot find square root");return d}}),zW=function(W,Q){const J=(V)=>FV({...W,hash:V});return{...J(Q),create:J}}({...$1,Fp:O8,lowS:!0,endo:zV},M6),T7={},E6=(W)=>W.toBytes(!0).slice(1),C1=(()=>zW.Point)(),y6=(W)=>W%O6===ZV,l1=j1,p6=(()=>{const W=(Q=R8(48))=>XW(Q,$1.n);return zW.utils.randomSecretKey,{keygen(Q){const J=W(Q);return{secretKey:J,publicKey:g7(J)}},getPublicKey:g7,sign:HV,verify:kW,Point:C1,utils:{randomSecretKey:W,randomPrivateKey:W,taggedHash:D8,lift_x:ZW,pointToBytes:E6,numberToBytesBE:N8,bytesToNumberBE:j1,mod:H0},lengths:{secretKey:32,publicKey:32,publicKeyHasPrefix:!1,signature:64,seed:48}}})(),kV=new TextEncoder,$V=new TextDecoder,s0=(W)=>kV.encode(W),c1=(W)=>$V.decode(W),x6=(W)=>Array.from(W,(Q)=>Q.toString(16).padStart(2,"0")).join(""),N0=JSON.stringify,x8=JSON.parse,$W=(W,Q=Number.MAX_SAFE_INTEGER)=>W.split("").reduce((J,V)=>J+V.charCodeAt(0),0)%Q,f6="AES-GCM",jV={},H8=(W)=>jV[W]??=crypto.subtle.digest("SHA-1",s0(W)).then((Q)=>{const J=new Uint8Array(Q);let V="";for(let G of J)V+=G.toString(36);return V}),CV=async(W,Q)=>{const J=crypto.getRandomValues(new Uint8Array(12)),V=await W,G=await crypto.subtle.encrypt({name:f6,iv:J},V,s0(Q));return`${J.join(",")}\$${((X)=>{const q=new Uint8Array(X);let Y="";for(let F=0;F<q.length;F+=32768)Y+=String.fromCharCode(...q.subarray(F,F+32768));return btoa(Y)})(G)}`},BV=async(W,Q)=>{const[J,V]=Q.split("$");if(!J\|\|!V)throw Error("Invalid encrypted payload format");const G=Uint8Array.from(J.split(","),Number),X=await W,q=await crypto.subtle.decrypt({name:f6,iv:G},X,(Y=V,Uint8Array.from(atob(Y),(F)=>F.charCodeAt(0)).buffer));var Y;return c1(q)},K0="GenosRTC",b6=(W,Q)=>Array.from({length:W},Q),MV="0123456789AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz",w6=(W)=>Array.from(crypto.getRandomValues(new Uint8Array(W)),(Q)=>MV[Q%62]).join(""),K1=w6(20),Z1=Promise.all.bind(Promise),RV=typeof window!="undefined",{entries:LV,fromEntries:jW}=Object,IV=()=>{},D0=(W)=>Error(`${K0}: ${W}`),k8=(...W)=>W.join("@"),E7="icegatheringstatechange",y7="offer",OV=[...b6(3,(W,Q)=>`stun:stun${Q\|\|""}.l.google.com:19302`),"stun:stun.cloudflare.com:3478"].map((W)=>({urls:W})),j6=(W,{rtcConfig:Q,rtcPolyfill:J,turnConfig:V})=>{const G=new(J\|\|RTCPeerConnection)({iceServers:[...OV,...V\|\|[]],...Q}),X={};let q,Y=!1,F=!1;const U=(K)=>Object.assign(K,{binaryType:"arraybuffer",bufferedAmountLowThreshold:65535,onmessage(z){return X.data?.(z.data)},onopen(){return X.connect?.()},onclose(){return X.close?.()},onerror(z){return!z?.error?.message?.includes("User-Initiated Abort")&&X.error?.(z)}}),P=()=>Promise.race([new Promise((K)=>{const z=()=>{G.iceGatheringState==="complete"&&(G.removeEventListener(E7,z),K())};G.addEventListener(E7,z),z()}),new Promise((K)=>setTimeout(K,5000))]).then(()=>({type:G.localDescription.type,sdp:G.localDescription.sdp.replace(/a=ice-options:trickle\s\n/g,"")}));W?U(q=G.createDataChannel("data")):G.ondatachannel=({channel:K})=>U(q=K),G.onnegotiationneeded=async()=>{try{Y=!0,await G.setLocalDescription(),X.signal?.(await P())}catch(K){X.error?.(K)}finally{Y=!1}},G.onconnectionstatechange=()=>{["disconnected","failed","closed"].includes(G.connectionState)&&X.close?.()},G.ontrack=(K)=>{X.track?.(K.track,K.streams[0]),X.stream?.(K.streams[0])},G.onremovestream=(K)=>X.stream?.(K.stream),W&&!G.canTrickleIceCandidates&&G.onnegotiationneeded();const H=()=>G.getSenders();return{created:Date.now(),connection:G,get channel(){return q},get isDead(){return G.connectionState==="closed"},async signal(K){if(q?.readyState!=="open"\|\|K.sdp?.includes("a=rtpmap"))try{if(K.type===y7){if(Y\|\|G.signalingState!=="stable"&&!F){if(W)return;await Z1([G.setLocalDescription({type:"rollback"}),G.setRemoteDescription(K)])}else await G.setRemoteDescription(K);await G.setLocalDescription();const z=await P();return X.signal?.(z),z}if(K.type==="answer"){F=!0;try{await G.setRemoteDescription(K)}finally{F=!1}}}catch(z){X.error?.(z)}},sendData(K){return q.send(K)},destroy(){q?.close(),G.close(),Y=F=!1},setHandlers(K){return Object.assign(X,K)},offerPromise:W?new Promise((K)=>X.signal=(z)=>z.type===y7&&K(z)):Promise.resolve(),addStream(K){return K.getTracks().forEach((z)=>G.addTrack(z,K))},removeStream(K){return H().filter((z)=>K.getTracks().includes(z.track)).forEach((z)=>G.removeTrack(z))},addTrack(K,z){return G.addTrack(K,z)},removeTrack(K){const z=H().find((C)=>C.track===K);z&&G.removeTrack(z)},replaceTrack(K,z){return H().find((C)=>C.track===K)?.replaceTrack(z)}}},DV=Object.getPrototypeOf(Uint8Array),_1=16369,$8=255,C6="bufferedamountlow",F1=(W)=>"@_"+W,xV=(W,Q,J)=>{const V=new Map,G=new Map,X=new Map,q={},Y={},F={},U={},P=new Map,H=($,...M)=>P.get($)?.forEach((w)=>w(...M)),K=($,M)=>{const w=$?Array.isArray($)?$:[$]:V.keys();return Array.from(w,(O)=>{const T=V.get(O);return T?M(O,T):(console.warn(`${K0}: no peer with id ${O}`),null)}).filter(Boolean)},z=($)=>{V.has($)&&(V.delete($),delete q[$],delete Y[$],delete F[$],delete U[$],H("peer:leave",$),Q($))},C=($)=>new Promise((M,w)=>{let O=setTimeout(()=>{$.removeEventListener(C6,T),w(Error(K0+": bufferLow timeout"))},5000);function T(){clearTimeout(O),$.removeEventListener(C6,T),M()}$.addEventListener(C6,T)}),g=($)=>{if(X.has($))return X.get($);if(!$)throw D0("action type is required");const M=s0($);if(M.byteLength>12)throw D0(`"${$}" exceeds 12 bytes`);const w=new Uint8Array(12).map((L,R)=>M[R]\|\|0);let O=0;const T=new Map([["message",new Set],["progress",new Set]]),B=async(L,R,D,N)=>{if(D&&typeof D!="object")throw D0("meta must be object");if(L===void 0)throw D0("data cannot be undefined");const p=L instanceof Blob,y=p\|\|L instanceof ArrayBuffer\|\|L instanceof DV,u=typeof L!="string";if(D&&!y)throw D0("meta only allowed with binary");const _=y?new Uint8Array(p?await L.arrayBuffer():L):s0(u?N0(L):L),a=D?s0(N0(D)):null,o=Math.ceil(_.byteLength/_1)+(D?1:0)\|\|1;if(o>100)throw D0("Message too large, exceeds max chunks 100");const W0=b6(o,(Q0,l)=>{const r=l===o-1,s=D&&l===0,S0=s?a:_.subarray(D?(l-1)_1:l_1,D?l_1:(l+1)_1),k0=new Uint8Array(15+S0.byteLength);return k0.set(w),k0.set([O],12),k0.set([r\|s<<1\|y<<2\|u<<3],13),k0.set([Math.round((l+1)/o$8)],14),k0.set(S0,15),k0});return O=O+1&$8,Z1(K(R,async(Q0,l)=>{const{channel:r}=l;for(let s=0;s<o;s++){let S0=0;for(;r.bufferedAmount>r.bufferedAmountLowThreshold;){if(S0++>3)throw D0(`${K0}: send buffer full, max retries reached for peer ${Q0}`);try{await C(r)}catch(k0){console.warn(k0.message),await new Promise((NW)=>setTimeout(NW,200))}}if(!V.has(Q0))break;l.sendData(W0[s]),N?.(W0[s][14]/$8,Q0,D)}}))};G.set($,{listeners:T,send:B});const j={send:B,on(L,R){return T.get(L)?.add(R)},off(L,R){return T.get(L)?.delete(R)}};return X.set($,j),j},E=async()=>{try{await k(""),await new Promise(($)=>setTimeout($,99))}catch($){console.warn(K0+": error sending leave",$)}for(let[$,M]of V){try{M.destroy()}catch{}V.delete($)}J()},{send:f,on:b}=g(F1("ping")),{send:h,on:v}=g(F1("pong")),{send:m,on:d}=g(F1("signal")),{send:S,on:x}=g(F1("stream")),{send:A,on:Z}=g(F1("track")),{send:k,on:I}=g(F1("leave"));return W(($,M)=>{V.has(M)\|\|(V.set(M,$),$.setHandlers({data(w){return((O,T)=>{try{const B=new Uint8Array(T),j=c1(B.subarray(0,12)).replace(/\0/g,"");if(!G.has(j))return console.warn(`${K0}: unregistered type (${j})`);const[L]=B.subarray(12,13),[R]=B.subarray(13,14),[D]=B.subarray(14,15),N=B.subarray(15),p=!!(1&R),y=!!(2&R),u=!!(4&R),_=!!(8&R),a=G.get(j),o=(q[O]\|\|={})[j]\|\|={};if(o[L]?.chunks?.length>100)return void console.warn(`${K0}: peer ${O} sent too many chunks for nonce ${L}, ignoring.`);const W0=o[L]\|\|={chunks:[]};if(y)try{W0.meta=x8(c1(N))}catch{return void console.warn(`${K0}: failed to parse meta from peer ${O} for type ${j}`)}else W0.chunks.push(N);if(a.listeners.get("progress").forEach((r)=>{try{r(D/$8,O,W0.meta)}catch(s){console.error(s)}}),!p)return;const Q0=new Uint8Array(W0.chunks.reduce((r,s)=>r+s.byteLength,0));let l;if(W0.chunks.reduce((r,s)=>(Q0.set(s,r),r+s.byteLength),0),delete o[L],u)l=Q0;else if(_)try{l=x8(c1(Q0))}catch{return void console.warn(`${K0}: failed to parse JSON message data from peer ${O} for type ${j}`)}else l=c1(Q0);a.listeners.get("message").forEach((r)=>{try{r(l,O,W0.meta)}catch(s){console.error(s)}})}catch(B){console.error(`${K0}: error handling data from peer ${O}:`,B)}})(M,w)},stream(w){H("stream:add",w,M,F[M]),delete F[M]},track(w,O){H("track:add",w,O,M,U[M]),delete U[M]},signal(w){return m(w,M)},close(){return z(M)},error(w){console.error(`${K0}: peer error for ${M}`,w),z(M)}}),H("peer:join",M))}),b("message",($,M)=>h("",M)),v("message",($,M)=>{Y[M]?.(),delete Y[M]}),d("message",($,M)=>V.get(M)?.signal($)),x("message",($,M)=>F[M]=$),Z("message",($,M)=>U[M]=$),I("message",($,M)=>z(M)),RV&&addEventListener("beforeunload",E),{on($,M){P.has($)\|\|P.set($,new Set),P.get($).add(M)},off($,M){return P.get($)?.delete(M)},channel:g,leave:E,async ping($){if(!$)throw D0("ping() requires target peer ID");const M=Date.now();return f("",$),await new Promise((w)=>Y[$]=w),Date.now()-M},getPeers(){return jW(Array.from(V,([$,M])=>[$,M.connection]))},addStream($,M,w){return K(M,async(O,T)=>{w&&await S(w,O),T.addStream($)})},removeStream($,M){return K(M,(w,O)=>O.removeStream($))},addTrack($,M,w,O){return K(w,async(T,B)=>{O&&await A(O,T),B.addTrack($,M)})},removeTrack($,M){return K(M,(w,O)=>O.removeTrack($))},replaceTrack($,M,w,O){return K(w,async(T,B)=>{O&&await A(O,T),B.replaceTrack($,M)})}}},j8={},CW={};if(typeof window!="undefined"){const W=()=>{console.info("\u26A1 [GenosRTC] Network event detected. Forcing reconnection\u2026"),Object.values(CW).forEach((Q)=>{Q.socket&&Q.socket.readyState!==WebSocket.OPEN&&Q.socket.readyState!==WebSocket.CONNECTING&&Q.forceReconnect()})};window.addEventListener("online",()=>{console.info("\u2705 Reconnected to the network."),W()}),window.addEventListener("offline",async()=>{console.info("\u274C Disconnected from the network.")}),document.addEventListener("visibilitychange",()=>{document.visibilityState==="visible"&&W()})}var wV=(W,Q,J,V)=>(W.relayUrls??(V?((G,X)=>{const q=[...G];let Y=q.length;const F=()=>{const U=1e4Math.sin(X++);return U-Math.floor(U)};for(;Y;){const U=Math.floor(F()Y--);[q[Y],q[U]]=[q[U],q[Y]]}return q})(Q,$W(W.appId)):Q)).slice(0,W.relayUrls?.length??W.relayRedundancy??J),BW={},MW="EVENT",RW=p6.utils.randomSecretKey(),NV=x6(p6.getPublicKey(RW)),h6={},d1={},SV={},LW=()=>Math.floor(Date.now()/1000),IW=(W)=>SV[W]??=$W(W,1e4)+20000,p7=async(W,Q)=>{const J={kind:IW(W),content:Q,pubkey:NV,created_at:LW(),tags:[["x",W]]},V=new Uint8Array(await crypto.subtle.digest("SHA-256",s0(N0([0,J.pubkey,J.created_at,J.kind,J.tags,J.content])))),G=p6.sign(V,RW);return N0([MW,{...J,id:x6(V),sig:x6(G)}])},f7=(W,Q)=>(h6[W]=Q,N0(["REQ",W,{kinds:[IW(Q)],since:LW(),"#x":[Q]}])),b7=(W)=>(delete h6[W],N0(["CLOSE",W])),u6=(({init:W,subscribe:Q,announce:J})=>{const V={};let G,X,q=!1;return(Y,F,U)=>{const{appId:P}=Y;if(V[P]?.[F])return V[P][F];if(!Y\|\|!F\|\|!P&&!Y.firebaseApp)throw D0(Y?F?"appId missing":"roomId required":"config required");let H=IV;if(!q){const Z=W(Y);X=b6(20,()=>j6(!0,Y)),G=Array.isArray(Z)?Z:[Z];const k=setInterval(()=>{X=X.filter((I)=>{const $=Date.now()-I.created<57333;return $\|\|I.destroy(),$})},57333);V.offerCleanupTimer\|\|=k,q=!0}const K={},z={},C=k8(K0,P,F),g=H8(C),E=H8(k8(C,K1)),f=(async(Z,k,I)=>{const $=await crypto.subtle.digest("SHA-256",s0(`${Z}:${k}:${I}`));return crypto.subtle.importKey("raw",$,{name:f6},!1,["encrypt","decrypt"])})(Y.password\|\|"",P,F),b=(Z)=>async(k)=>({type:k.type,sdp:await Z(f,k.sdp)}),h=b(BV),v=b(CV),m=(Z,k)=>{z[k]!==Z&&(z[k]?.destroy(),z[k]=Z,H(Z,k),K[k]?.forEach((I)=>I!==Z&&I.destroy()),delete K[k])},d=(Z,k)=>{z[k]===Z&&delete z[k]},S=Z1(G.map(async(Z,k)=>{return Q(await Z,await g,await E,(I=k,async($,M,w)=>{const[O,T]=await Z1([g,E]);if($!==O&&$!==T)return;const{peerId:B,offer:j,answer:L}=typeof M=="string"?x8(M):M;if(B!==K1&&!z[B])if(j){if(K[B]?.[I]&&K1>B)return;const R=j6(!1,Y);R.setHandlers({connect(){return m(R,B)},close(){return d(R,B)}});try{const D=await h(j);if(R.isDead)return;const[N,p]=await Z1([H8(k8(C,B)),R.signal(D).then(v)]);w(N,N0({peerId:K1,answer:p}))}catch{U?.({error:"decryption failed (offer)",appId:P,peerId:B,roomId:F})}}else if(L){const R=K[B]?.[I];if(!R\|\|R.isDead)return;R.setHandlers({connect(){return m(R,B)},close(){return d(R,B)}});try{R.signal(await h(L))}catch{U?.({error:"decryption failed (answer)",appId:P,peerId:B,roomId:F})}}else{if(K[B]?.[I])return;const R=X.pop()\|\|j6(!0,Y),[D,{offer:N}]=await Z1([H8(k8(C,B)),R.offerPromise.then(v).then((p)=>({offer:p}))]);K[B]\|\|=[],K[B][I]=R,R.setHandlers({connect(){return m(R,B)},close(){return d(R,B)}}),w(D,N0({peerId:K1,offer:N,peer:R}))}}));var I})),x=[];S.then((Z)=>{G.forEach((k,I)=>{const $=async()=>{const M=await J(await k,await g,await E);x[I]=setTimeout($,typeof M=="number"?M:5333)};$()}),V[P][F].onCleanup=()=>{delete V[P][F],x.forEach(clearTimeout),Z.forEach((k)=>k()),Object.keys(V).length===0&&(clearInterval(V.offerCleanupTimer),delete V.offerCleanupTimer)}}),V[P]\|\|={};const A=xV((Z)=>H=Z,(Z)=>delete z[Z],()=>A.onCleanup?.());return V[P][F]=A}})({init(W){return wV(W,vV,5,!0).map((Q)=>{const J=((V,G)=>{const X={};let q=null;const Y=()=>{q&&(clearTimeout(q),q=null);const F=new WebSocket(V);F.onclose=()=>{j8[V]??=3333,q=setTimeout(Y,j8[V]),j8[V]=2},F.onmessage=(U)=>G(U.data),X.socket=F,X.url=F.url,X.ready=new Promise((U)=>{F.onopen=()=>{j8[V]=3333,U(X)}}),X.send=(U)=>{F.readyState===1&&F.send(U)}};return X.forceReconnect=Y,Y(),CW[V]=X,X})(Q,(V)=>{const[G,X,q,Y]=x8(V);if(G===MW)d1[X]?.(h6[X],q.content);else{const F=`${K0}: relay failure from ${J.url} - `;G==="NOTICE"?console.warn(F+X):G!=="OK"\|\|q\|\|console.warn(F+Y)}});return BW[Q]=J,J.ready})},subscribe(W,Q,J,V){const G=w6(64),X=w6(64);return d1[G]=d1[X]=(q,Y)=>V(q,Y,async(F,U)=>W.send(await p7(F,U))),W.send(f7(G,Q)),W.send(f7(X,J)),()=>{W.send(b7(G)),W.send(b7(X)),delete d1[G],delete d1[X]}},async announce(W,Q){return W.send(await p7(Q,N0({peerId:K1})))}}),$G=(h7=BW,()=>jW(LV(h7).map(([W,Q])=>[W,Q.socket]))),h7,vV=["black.nostrcity.club","eu.purplerelay.com","ftp.halifax.rwth-aachen.de/nostr","nostr.cool110.xyz","nostr.data.haus","nostr.mom","nostr.oxtr.dev","nostr.sathoarder.com","nostr.vulpem.com","playground.nostrcheck.me/relay","relay.agorist.space","relay.binaryrobot.com","relay.fountain.fm","relay.mostro.network","relay.nostraddress.com","relay.nostrdice.com","relay.nostromo.social","relay.oldenburg.cool","relay.snort.social","relay.verified-nostr.com","sendit.nosflare.com","yabu.me/v2","relay.damus.io"].map((W)=>"wss://"+W);function OW(W,Q,J){let V=Q.timestamp;if(V?.physical>Date.now()+7200000)V={physical:Date.now()+7200000,logical:V.logical};if(!W?.timestamp)return{resolved:!0,value:Q.value,timestamp:V};if(J.compare(V,W.timestamp)<=0)return{resolved:!1};return{resolved:!0,value:Q.value,timestamp:V}}function DW(W,Q=50){const J=`gdb_oplog_${W}`;let V=[];function G(){try{const q=localStorage.getItem(J);V=q?JSON.parse(q):[]}catch(q){console.error("\u274C GDB: Failed to load oplog from localStorage:",q),V=[]}}function X(){try{localStorage.setItem(J,JSON.stringify(V))}catch(q){console.error("\u274C GDB: Failed to save oplog to localStorage:",q)}}return G(),{add(q){if(V.push(q),V.length>Q)V.shift();X()},getDelta(q,Y){if(!q)return[...V];return V.filter((F)=>Y(F.timestamp,q)>0)},getOldest(){return V[0]},clear(){V=[],localStorage.removeItem(J)}}}var AV=()=>{const W=new Map,Q=async()=>{try{const F=await navigator.storage.getDirectory(),P=await(await F.getFileHandle("~opfs-sync-test",{create:!0})).createSyncAccessHandle?.();return await P?.close(),await F.removeEntry("~opfs-sync-test"),!!P}catch{return!1}};let J="idb";const V=(async()=>{if(await Q())J="sync";else try{const F=await navigator.storage.getDirectory(),P=await(await F.getFileHandle("~opfs-async-test",{create:!0})).createWritable?.();if(await P?.close(),await F.removeEntry("~opfs-async-test"),P)J="async";else J="idb"}catch{J="idb"}})(),G=async(F,U)=>{if(!W.has(F))W.set(F,[]);const P=W.get(F),H=P[P.length-1]\|\|Promise.resolve();let K;const z=new Promise((C)=>K=C);P.push(z);try{return await H,await U()}finally{if(P.shift(),K(),P.length===0)W.delete(F)}},X=(()=>{let F;const U=async()=>{if(!F)F=new Promise((P,H)=>{const K=indexedDB.open("opfs-fallback-db",1);K.onupgradeneeded=()=>K.result.createObjectStore("files"),K.onsuccess=()=>P(K.result),K.onerror=()=>H(K.error)});return F};return{getDB:U,get:async(P)=>{const H=await U();return new Promise((K,z)=>{const g=H.transaction("files","readonly").objectStore("files").get(P);g.onsuccess=()=>K(g.result\|\|new Uint8Array),g.onerror=()=>z(g.error)})},set:async(P,H)=>{const K=await U();return new Promise((z,C)=>{const E=K.transaction("files","readwrite").objectStore("files").put(H,P);E.onsuccess=()=>z(),E.onerror=()=>C(E.error)})}}})(),q=async(F)=>{await V;try{if(J==="idb"){const z=await X.get(F);return{type:"loaded",name:F,data:z}}const P=await(await navigator.storage.getDirectory()).getFileHandle(F);if(J==="sync"){let z;try{z=await P.createSyncAccessHandle();const C=z.getSize(),g=new Uint8Array(C),E=z.read(g,{at:0});return{type:"loaded",name:F,data:g.slice(0,E)}}finally{z?.close()}}const H=await P.getFile(),K=new Uint8Array(await H.arrayBuffer());return{type:"loaded",name:F,data:K}}catch(U){const P=U.name==="NotFoundError"?"File not found":U.message\|\|"Error reading file";return{type:"error",name:F,message:P}}},Y=async(F,U)=>{if(await V,!(U instanceof Uint8Array))return{type:"error",name:F,message:"Content must be a Uint8Array"};return G(F,async()=>{try{if(J==="idb")return await X.set(F,U),{type:"saved",name:F};const H=await(await navigator.storage.getDirectory()).getFileHandle(F,{create:!0});if(J==="sync"){let K;try{K=await H.createSyncAccessHandle(),K.truncate(0),K.write(U,{at:0}),K.flush()}finally{K?.close()}}else{let K;try{K=await H.createWritable(),await K.write(U)}finally{await K?.close()}}return{type:"saved",name:F}}catch(P){return{type:"error",name:F,message:P.message\|\|"Error saving file"}}})};self.onmessage=async({data:F})=>{const{type:U,name:P,content:H}=F;await V;const K={load:()=>q(P),save:()=>Y(P,H)};try{const z=K[U],C=z?await z():{type:"error",message:`Unrecognized action type: ${U}`};self.postMessage(C)}catch(z){console.error("\u274C Worker unexpected error:",z),self.postMessage({type:"error",name:P,message:z.message\|\|"Unexpected worker error"})}}},xW=AV;var B1={$eq:(W,Q)=>W===Q,$ne:(W,Q)=>W!==Q,$gt:(W,Q)=>W>Q,$gte:(W,Q)=>W>=Q,$lt:(W,Q)=>W<Q,$lte:(W,Q)=>W<=Q,$in:(W,Q)=>Array.isArray(Q)&&(Array.isArray(W)?W.some((J)=>Q.includes(J)):Q.includes(W)),$between:(W,[Q,J])=>W>=Q&&W<=J,$exists:(W,Q)=>Q?W!==void 0:W===void 0,$text:{global:(W,Q)=>{const J=(G)=>String(G).normalize("NFD").replace(/[\u0300-\u036f]/g,"").toLowerCase().replace(/[^\w\s]/g,""),V=J(Q);return Object.values(W).some((G)=>typeof G==="object"?null.fieldSearch(G,V):J(G).includes(V))},field:(W,Q)=>{const J=(G)=>String(G).normalize("NFD").replace(/[\u0300-\u036f]/g,"").toLowerCase().replace(/[^\w\s]/g,""),V=J(Q);return Array.isArray(W)?W.some((G)=>J(G).includes(V)):J(W).includes(V)}},$like:(W,Q)=>typeof W==="string"&&typeof Q==="string"&&new RegExp(`^${Q.replace(/%/g,".").replace(/_/g,".")}\$`,"i").test(W),$regex:(W,Q)=>typeof W==="string"&&new RegExp(Q.$regex\|\|Q,"i").test(W),$and:(W,Q,J)=>Q.every((V)=>J.createFilter(V,J.allNodes)(W)),$or:(W,Q,J)=>Q.some((V)=>J.createFilter(V,J.allNodes)(W)),$not:(W,Q,J)=>!J.createFilter(Q,J.allNodes)(W),$edge:(W,Q,J)=>{if(!W.edges?.length\|\|typeof Q!=="object"\|\|Q===null)return!1;const V=J.createFilter(Q,J.allNodes),G=[...W.edges],X=new Set(G).add(W.id),q=[];while(G.length){const Y=G.shift(),F=J.allNodes[Y];if(!F)continue;if(V(F))q.push(F);F.edges?.forEach((U)=>!X.has(U)&&X.add(U)&&G.push(U))}if(q.length)W._edgeResult=q;return q.length>0}},m6=(W,Q)=>Q.split(".").reduce((J,V)=>J&&typeof J==="object"&&(V in J)?J[V]:void 0,W),S8=(W,Q)=>{if(Object.keys(W).length===0)return()=>!0;return(J)=>Object.entries(W).every(([V,G])=>{if(V.startsWith("$"))return B1[V](J,G,{createFilter:S8,allNodes:Q});const X=m6(J.value,V);if(typeof G!=="object"\|\|G===null)return B1.$eq(X,G);return Object.entries(G).every(([q,Y])=>{if(q==="$text")return B1.$text.field(X,Y);if(q==="$between"&&Y.every((F)=>F instanceof Date))return B1.$between(new Date(X),Y);return B1[q]?.(X,Y,{createFilter:S8,allNodes:Q})??!1})})},_6=(W,Q)=>{const{$edge:J,...V}=Q.query\|\|{},G=S8(V,W),X=Object.values(W).filter(G);let Y=[...J?(()=>{const F=S8({$edge:J},W);X.forEach((P)=>F(P));const U=new Map;return X.forEach((P)=>{if(P._edgeResult)P._edgeResult.forEach((H)=>U.set(H.id,H)),delete P._edgeResult}),Array.from(U.values())})():X];if(Y=Y.map((F)=>({...F,edges:[...F.edges\|\|[]],value:F.value&&typeof F.value==="object"?JSON.parse(JSON.stringify(F.value)):F.value})),Q.field){const F=Q.order==="asc"?1:-1;Y.sort((U,P)=>{const H=m6(U.value,Q.field),K=m6(P.value,Q.field);if(typeof H==="string"&&typeof K==="string")return H.localeCompare(K)F;return((H??0)-(K??0))F})}if(Q.$after){const F=Y.findIndex((U)=>U.id===Q.$after);Y=F>=0?Y.slice(F+1):[]}if(Q.$before){const F=Y.findIndex((U)=>U.id===Q.$before);Y=F>=0?Y.slice(0,F):[]}if(Q.$limit)Y=Y.slice(0,Q.$limit);return Y};function wW(){let W=Date.now(),Q=0;return{now(){const J=Date.now();return W=Math.max(W,J),Q++,{physical:W,logical:Q}},update(J){if(!J\|\|typeof J.physical!=="number"\|\|typeof J.logical!=="number"){console.warn("\u26A0\uFE0F HybridClock.update received an invalid remote timestamp.",J);return}W=Math.max(W,J.physical),Q=Math.max(Q,J.logical)+1},compare(J,V){if(!J&&!V)return 0;if(!J)return-1;if(!V)return 1;if(J.physical>V.physical)return 1;if(J.physical<V.physical)return-1;if(J.logical>V.logical)return 1;if(J.logical<V.logical)return-1;return 0}}}var d6=function(W,Q){return W.length===Q.length&&W.every((J,V)=>J===Q[V])};async function TV(){if(console.info(navigator?.storage?.getDirectory?"\u2705 OPFS is enabled.":"\uD83D\uDEAB OPFS is not available."),navigator?.storage?.getDirectory)await navigator.storage.getDirectory()}var gV=function(){const W={nodes:{}};return{get nodes(){return W.nodes},set nodes(J){W.nodes=J\|\|{}},upsert(J,V,G){const X=W.nodes[J];W.nodes[J]={id:J,value:V&&typeof V==="object"?JSON.parse(JSON.stringify(V)):V,edges:X?.edges?[...X.edges]:[],timestamp:G}},get(J){return W.nodes[J]\|\|null},link(J,V,G){const X=W.nodes[J],q=W.nodes[V];if(X&&q&&!X.edges.includes(V))W.nodes[J]={...X,edges:[...X.edges,V],timestamp:G}},getAllNodes(){return Object.values(W.nodes)},serialize(){return m1.deflate(v0(W.nodes))},deserialize(J){W.nodes=t1(m1.inflate(new Uint8Array(J)))}}};async function TG(W,Q={}){const{password:J,sm:V=!1,ii:G=!1,rx:X=!1,ai:q=!1,geo:Y=!1,relayUrls:F=null,turnConfig:U=null}=Q,P=gV(),H=wW(),K=DW(W,20),z=[];let C=null,g=[],E=null,f=null,b=null,h=null;const v={};Object.defineProperties(v,{hybridClock:{get:()=>H},graph:{get:()=>P},syncChannel:{get:()=>f},ready:{get:()=>Promise.resolve(!0)}});async function m(j,L){const R=new URL(`./${j}.min.js`,import.meta.url).href,D=`https://cdn.jsdelivr.net/npm/genosdb@latest/dist/${j}.min.js`;try{const N=await import(R).catch(()=>{return console.warn(`\u26A0\uFE0F ${j} not found locally, loading from CDN...`),import(D)}),p=L&&typeof L==="object"?L:{},y=typeof N.init==="function"?N.init(v,N,p):null;if(y)Object.assign(v,y);return N}catch(N){throw console.error(`\u274C Initialization of ${j} failed:`,N),N}}function d(){const j=localStorage.getItem(`${W}_time`);C=j?JSON.parse(j):null}function S(j){C=j,localStorage.setItem(`${W}_time`,JSON.stringify(j))}function x(){try{const j=URL.createObjectURL(new Blob([`(${xW.toString()})()`],{type:"application/javascript"}));E=new Worker(j),URL.revokeObjectURL(j),E.addEventListener("message",({data:L})=>{console.info(`\uD83D\uDCBE ${L.name} ${L.type}`)}),console.info("\u2699\uFE0F Worker initialized successfully.")}catch({message:j}){console.error("\u274C Failed to initialize worker:",j)}}function A(){const j={...P.nodes};g.forEach((L)=>L(j))}async function Z(){return crypto.randomUUID()}async function k(){try{const L=await((R)=>new Promise((D,N)=>{const p=async({data:y})=>{if(y.type==="loaded"&&y.name===R)E.removeEventListener("message",p),D(new Uint8Array(y.data));else if(y.type==="error")E.removeEventListener("message",p),N(new Error(y.message\|\|"Unknown error"))};E.addEventListener("message",p),E.postMessage({type:"load",name:R})}))(`${W}_graph.msgpack`).catch(()=>new Uint8Array);L.byteLength>0?P.deserialize(L):console.warn("\u26A0\uFE0F The file '_graph.msgpack' is empty or could not be loaded."),console.info(`\u2705 Graph loaded: [ ${P.getAllNodes().length} nodes ]`)}catch({message:j}){console.error("\u274C Error loading the graph:",j)}}async function I(){try{const j=P.serialize();return await((R,D)=>new Promise((N,p)=>{const y=({data:u})=>{if(u.type==="saved"&&u.name===R)E.removeEventListener("message",y),N();else if(u.type==="error")E.removeEventListener("message",y),p(new Error(u.message\|\|"Save error"))};E.addEventListener("message",y),E.postMessage({type:"save",name:R,content:D})}))(`${W}_graph.msgpack`,j),b.postMessage("update"),!0}catch({message:j}){throw console.error("\u274C Save error:",j),new Error("Save failed")}}async function $(j){try{console.info("\uD83D\uDD04 Applying full graph from remote..."),P.nodes={...j.nodes},await I()}catch({message:L}){console.error(`\u274C Error applying the full graph: ${L}`)}}async function M(j){let L=!1,R=null;const D={upsert:(N)=>{const p=P.get(N.id),y=OW(p,N,H);if(y.resolved){if(P.upsert(N.id,y.value,y.timestamp),H.update(y.timestamp),K.add({type:"upsert",id:N.id,timestamp:y.timestamp}),L=!0,!R\|\|H.compare(y.timestamp,R)>0)R=y.timestamp}},remove:(N)=>{const p=P.get(N.id);if(p&&H.compare(p.timestamp,N.timestamp)<0){if(delete P.nodes[N.id],H.update(N.timestamp),K.add({type:"remove",id:N.id,timestamp:N.timestamp}),L=!0,!R\|\|H.compare(N.timestamp,R)>0)R=N.timestamp}},link:(N)=>{const p=P.get(N.sourceId),y=P.get(N.targetId);if(p&&y&&H.compare(p.timestamp,N.timestamp)<0){if(P.link(N.sourceId,N.targetId,N.timestamp),H.update(N.timestamp),K.add({type:"link",sourceId:N.sourceId,targetId:N.targetId,timestamp:N.timestamp}),L=!0,!R\|\|H.compare(N.timestamp,R)>0)R=N.timestamp}},sync:async(N)=>{const p=N.timestamp;if(p===null){console.info("\uD83D\uDCEC [SYNC REQUEST] from new peer (no timestamp). Sending full graph."),await f.send([{type:"syncReceive",graph:P}]);return}console.info("\uD83D\uDCEC [SYNC REQUEST] since:",new Date(p.physical).toLocaleString());const y=K.getOldest();if(y&&H.compare(p,y.timestamp)<0){console.info("\uD83D\uDCA5 [FALLBACK TRIGGERED] Peer is too far behind. Sending FULL graph state."),await f.send([{type:"syncReceive",graph:P}]);return}const u=K.getDelta(p,H.compare);if(u.length>0){const _=u.map((o)=>{if(o.type==="upsert"){const W0=P.get(o.id);return{...o,value:W0?W0.value:null}}return o}),a=m1.deflate(v0(_));console.info(`\uD83D\uDE80 [DELTA SYNC SENDING] Found ${u.length} new operations to send.`),await f.send([{type:"deltaSync",operations:a}])}else console.info("\u2705 [ALREADY SYNCED] Peer is up-to-date. Nothing to send.")},deltaSync:(N)=>{console.info("\uD83D\uDEF0\uFE0F [DELTA SYNC RECEIVED] Applying delta from a peer.");let p=t1(m1.inflate(N.operations));for(let y of p)D[y.type]?.(y)},syncReceive:async(N)=>{if(console.info("\uD83D\uDCE6 [FULL SYNC RECEIVED] Overwriting local state with full graph from a peer."),N.graph&&N.graph.nodes){await $(N.graph),K.clear(),console.info("\uD83D\uDD12 Oplog has been cleared due to full sync."),L=!0;let p=null;for(let y in N.graph.nodes){const u=N.graph.nodes[y];if(u.timestamp&&(!p\|\|H.compare(u.timestamp,p)>0))p=u.timestamp}if(p)console.info("\uD83D\uDCC8 [GLOBAL TIMESTAMP] Updated from full sync."),R=p,H.update(p)}else console.error("\u274C Full sync failed: received graph data is invalid.",N.graph)}};for(let N of j)if(D[N.type])await D[N.type](N);else console.warn(`\uD83E\uDD37\u200D\u2640\uFE0F [UNKNOWN MESSAGE TYPE] Received unhandled message type: "${N.type}"`);if(R){if(!C\|\|H.compare(R,C)>0)console.info(`\uD83D\uDCC8 [GLOBAL TIMESTAMP] Advanced from ${C?.logical} to ${R.logical}.`),S(R)}if(L)console.info("\uD83D\uDCBE [STATE CHANGED] Saving state and emitting update."),await I(),A()}Object.assign(v,{use(j){if(typeof j==="function")z.push(j)},async put(j,L){const R=H.now();S(R),L??=await Z(),P.upsert(L,j,R),K.add({type:"upsert",id:L,timestamp:R}),await I();try{await f.send([{type:"upsert",id:L,value:j,timestamp:R}])}catch(D){console.warn("\u26A0\uFE0F P2P send (upsert) failed or delayed:",D?.message\|\|D)}finally{A()}return L},async get(j,L=null){if(typeof j!=="string")return{result:null};const R=P.get(j);if(!R){if(L)L(null);return{result:null}}const D=(y)=>{if(!y)return null;const u=y.value!==null&&typeof y.value==="object"?{...y.value}:y.value;return{...y,value:u}};if(!L)return{result:D(R)};let N=R.timestamp;L(D(R));const p=(y)=>{const u=y[j];if(u){if(H.compare(u.timestamp,N)>0)N=u.timestamp,L(D(u))}else L(null),g.splice(g.indexOf(p),1)};return g.push(p),{result:D(R),unsubscribe:()=>{const y=g.indexOf(p);if(y>-1)g.splice(y,1)}}},async map(...j){let R={...{realtime:!1,query:{},field:null,order:"asc",$limit:null,$after:null,$before:null}},D=null,N=!1;j.forEach((_)=>typeof _==="function"?D=_:_&&typeof _==="object"&&(N\|\|=("realtime"in _),Object.assign(R,_))),D&&!N&&(R.realtime=!0);let p=_6(P.nodes,R),y=null;const u=(_)=>{const a=_.filter((l)=>!p.some((r)=>r.id===l.id)),o=p.filter((l)=>!_.some((r)=>r.id===l.id)),W0=_.filter((l)=>{const r=p.find((k0)=>k0.id===l.id),s=[...l.edges\|\|[]],S0=[...r?.edges\|\|[]];return r&&(!d6(v0(l.value),v0(r.value))\|\|!d6(s,S0))}),Q0=(l,r)=>{const s=r==="removed"?null:l.value,S0={id:l.id,value:s,edges:l.edges\|\|[],timestamp:l.timestamp\|\|null,action:r};D(S0)};a.forEach((l)=>Q0(l,"added")),o.forEach((l)=>Q0(l,"removed")),W0.forEach((l)=>Q0(l,"updated"))};if(D){if(p.forEach((_)=>{D({id:_.id,value:_.value,edges:_.edges,timestamp:_.timestamp,action:"initial"})}),R.realtime)y=(_)=>{const a=_6(_,R);if(a.length!==p.length)u(a),p=a;else if(!d6(v0(a),v0(p)))u(a),p=a},g.push(y)}return{results:p,...R.realtime&&D&&y&&{unsubscribe:()=>{const _=g.indexOf(y);_>-1&&g.splice(_,1)}}}},async remove(j){const L=H.now(),R=P.get(j);if(!R)return console.warn(`\u26A0\uFE0F Node with ID '${j}' not found.`);delete P.nodes[j],K.add({type:"remove",id:j,timestamp:L}),Object.values(P.nodes).forEach((D)=>D.edges=D.edges.filter((N)=>N!==j)),await I(),S(L);try{await f.send([{type:"remove",id:j,value:R.value,timestamp:L}])}catch(D){console.warn("\u26A0\uFE0F P2P send (remove) failed or delayed:",D?.message\|\|D)}finally{A()}},async link(j,L){const R=H.now();if(!P.nodes[j]\|\|!P.nodes[L]){console.warn(`\u26A0\uFE0F One or both nodes (${j}, ${L}) do not exist.`);return}P.link(j,L,R),K.add({type:"link",sourceId:j,targetId:L,timestamp:R}),await I(),S(R);try{await f.send([{type:"link",sourceId:j,targetId:L,timestamp:R}])}catch(D){console.warn("\u26A0\uFE0F P2P send (link) failed or delayed:",D?.message\|\|D)}finally{A()}},async clear(){P.nodes={};try{await(await navigator.storage.getDirectory()).removeEntry(`${W}_graph.msgpack`)}catch({message:j}){console.warn(`\u26A0\uFE0F Error deleting _graph.msgpack: ${j}`)}A(),console.info("\u2705 All data has been deleted.")}}),x(),d(),await TV(),await k();const w=[];if(V)w.push(m("sm",V));if(q)w.push(m("AIQuery",q));if(X)w.push(m("radixindex",X));if(G)w.push(m("invertedindex",G));if(Y)w.push(m("geo",Y));await Promise.all(w);const O=`graph-sync-room-${W}`,T={appId:"1234",...J&&{password:J}};if(F)T.relayUrls=F;if(U)T.turnConfig=U;const B=u6(T,O);return f=B.channel("syncGraph"),h=u6(T,`app-sync-${W}`),v.room=h,B.on("peer:join",async(j)=>{console.info("\u26A1 New peer connected:",j),f.send([{type:"sync",timestamp:C}])}),B.on("peer:leave",(j)=>{console.info("\u26A1 Peer disconnected:",j)}),f.on("message",async(j)=>{let L=j;for(let R of z)try{if(L=await R(L),!L\|\|L.length===0)return}catch(D){console.error("\u274C GDB: Middleware error, discarding message.",D);return}await M(L)}),b=new BroadcastChannel(`graphdb_sync_${W}`),b.onmessage=async(j)=>{if(j.data==="update")console.info("\uD83D\uDD04 Update received from another tab..."),await k(),d(),A()},console.info(`\u2705 GenosDB [ ${W} ] instance is ready.`),v}export{TG as gdb};
1	+ function n6(W){const Q=W.length;let J=0,V=0;while(V<Q){let G=W.charCodeAt(V++);if((G&4294967168)===0){J++;continue}else if((G&4294965248)===0)J+=2;else{if(G>=55296&&G<=56319){if(V<Q){const X=W.charCodeAt(V);if((X&64512)===56320)++V,G=((G&1023)<<10)+(X&1023)+65536}}if((G&4294901760)===0)J+=3;else J+=4}}return J}function pW(W,Q,J){const V=W.length;let G=J,X=0;while(X<V){let Y=W.charCodeAt(X++);if((Y&4294967168)===0){Q[G++]=Y;continue}else if((Y&4294965248)===0)Q[G++]=Y>>6&31\|192;else{if(Y>=55296&&Y<=56319){if(X<V){const q=W.charCodeAt(X);if((q&64512)===56320)++X,Y=((Y&1023)<<10)+(q&1023)+65536}}if((Y&4294901760)===0)Q[G++]=Y>>12&15\|224,Q[G++]=Y>>6&63\|128;else Q[G++]=Y>>18&7\|240,Q[G++]=Y>>12&63\|128,Q[G++]=Y>>6&63\|128}Q[G++]=Y&63\|128}}function hW(W,Q,J){fW.encodeInto(W,Q.subarray(J))}function o6(W,Q,J){if(W.length>bW)hW(W,Q,J);else pW(W,Q,J)}function y8(W,Q,J){let V=Q;const G=V+J,X=[];let Y="";while(V<G){const q=W[V++];if((q&128)===0)X.push(q);else if((q&224)===192){const F=W[V++]&63;X.push((q&31)<<6\|F)}else if((q&240)===224){const F=W[V++]&63,U=W[V++]&63;X.push((q&31)<<12\|F<<6\|U)}else if((q&248)===240){const F=W[V++]&63,U=W[V++]&63,K=W[V++]&63;let $=(q&7)<<18\|F<<12\|U<<6\|K;if($>65535)$-=65536,X.push($>>>10&1023\|55296),$=56320\|$&1023;X.push($)}else X.push(q);if(X.length>=uW)Y+=String.fromCharCode(...X),X.length=0}if(X.length>0)Y+=String.fromCharCode(...X);return Y}function cW(W,Q,J){const V=W.subarray(Q,Q+J);return mW.decode(V)}function a6(W,Q,J){if(J>_W)return cW(W,Q,J);else return y8(W,Q,J)}var fW=new TextEncoder,bW=50,uW=4096,mW=new TextDecoder,_W=200;class J1{constructor(W,Q){this.type=W,this.data=Q}}class Y0 extends Error{constructor(W){super(W);const Q=Object.create(Y0.prototype);Object.setPrototypeOf(this,Q),Object.defineProperty(this,"name",{configurable:!0,enumerable:!1,value:Y0.name})}}function s6(W,Q,J){const V=J/4294967296,G=J;W.setUint32(Q,V),W.setUint32(Q+4,G)}function a1(W,Q,J){const V=Math.floor(J/4294967296),G=J;W.setUint32(Q,V),W.setUint32(Q+4,G)}function s1(W,Q){const J=W.getInt32(Q),V=W.getUint32(Q+4);return J4294967296+V}function e6(W,Q){const J=W.getUint32(Q),V=W.getUint32(Q+4);return J4294967296+V}var Q1=4294967295;function rW({sec:W,nsec:Q}){if(W>=0&&Q>=0&&W<=lW)if(Q===0&&W<=iW){const J=new Uint8Array(4);return new DataView(J.buffer).setUint32(0,W),J}else{const J=W/4294967296,V=W&4294967295,G=new Uint8Array(8),X=new DataView(G.buffer);return X.setUint32(0,Q<<2\|J&3),X.setUint32(4,V),G}else{const J=new Uint8Array(12),V=new DataView(J.buffer);return V.setUint32(0,Q),a1(V,4,W),J}}function nW(W){const Q=W.getTime(),J=Math.floor(Q/1000),V=(Q-J1000)1e6,G=Math.floor(V/1e9);return{sec:J+G,nsec:V-G1e9}}function oW(W){if(W instanceof Date){const Q=nW(W);return rW(Q)}else return null}function aW(W){const Q=new DataView(W.buffer,W.byteOffset,W.byteLength);switch(W.byteLength){case 4:return{sec:Q.getUint32(0),nsec:0};case 8:{const J=Q.getUint32(0),V=Q.getUint32(4),G=(J&3)4294967296+V,X=J>>>2;return{sec:G,nsec:X}}case 12:{const J=s1(Q,4),V=Q.getUint32(0);return{sec:J,nsec:V}}default:throw new Y0(`Unrecognized data size for timestamp (expected 4, 8, or 12): ${W.length}`)}}function sW(W){const Q=aW(W);return new Date(Q.sec1000+Q.nsec/1e6)}var dW=-1,iW=4294967295,lW=17179869183,t6={type:dW,encode:oW,decode:sW};class u0{constructor(){this.builtInEncoders=[],this.builtInDecoders=[],this.encoders=[],this.decoders=[],this.register(t6)}register({type:W,encode:Q,decode:J}){if(W>=0)this.encoders[W]=Q,this.decoders[W]=J;else{const V=-1-W;this.builtInEncoders[V]=Q,this.builtInDecoders[V]=J}}tryToEncode(W,Q){for(let J=0;J<this.builtInEncoders.length;J++){const V=this.builtInEncoders[J];if(V!=null){const G=V(W,Q);if(G!=null){const X=-1-J;return new J1(X,G)}}}for(let J=0;J<this.encoders.length;J++){const V=this.encoders[J];if(V!=null){const G=V(W,Q);if(G!=null)return new J1(J,G)}}if(W instanceof J1)return W;return null}decode(W,Q,J){const V=Q<0?this.builtInDecoders[-1-Q]:this.decoders[Q];if(V)return V(W,Q,J);else return new J1(Q,W)}}u0.defaultCodec=new u0;var eW=function(W){return W instanceof ArrayBuffer\|\|typeof SharedArrayBuffer!=="undefined"&&W instanceof SharedArrayBuffer};function L1(W){if(W instanceof Uint8Array)return W;else if(ArrayBuffer.isView(W))return new Uint8Array(W.buffer,W.byteOffset,W.byteLength);else if(eW(W))return new Uint8Array(W);else return Uint8Array.from(W)}var tW=100,WJ=2048;class e1{constructor(W){this.entered=!1,this.extensionCodec=W?.extensionCodec??u0.defaultCodec,this.context=W?.context,this.useBigInt64=W?.useBigInt64??!1,this.maxDepth=W?.maxDepth??tW,this.initialBufferSize=W?.initialBufferSize??WJ,this.sortKeys=W?.sortKeys??!1,this.forceFloat32=W?.forceFloat32??!1,this.ignoreUndefined=W?.ignoreUndefined??!1,this.forceIntegerToFloat=W?.forceIntegerToFloat??!1,this.pos=0,this.view=new DataView(new ArrayBuffer(this.initialBufferSize)),this.bytes=new Uint8Array(this.view.buffer)}clone(){return new e1({extensionCodec:this.extensionCodec,context:this.context,useBigInt64:this.useBigInt64,maxDepth:this.maxDepth,initialBufferSize:this.initialBufferSize,sortKeys:this.sortKeys,forceFloat32:this.forceFloat32,ignoreUndefined:this.ignoreUndefined,forceIntegerToFloat:this.forceIntegerToFloat})}reinitializeState(){this.pos=0}encodeSharedRef(W){if(this.entered)return this.clone().encodeSharedRef(W);try{return this.entered=!0,this.reinitializeState(),this.doEncode(W,1),this.bytes.subarray(0,this.pos)}finally{this.entered=!1}}encode(W){if(this.entered)return this.clone().encode(W);try{return this.entered=!0,this.reinitializeState(),this.doEncode(W,1),this.bytes.slice(0,this.pos)}finally{this.entered=!1}}doEncode(W,Q){if(Q>this.maxDepth)throw new Error(`Too deep objects in depth ${Q}`);if(W==null)this.encodeNil();else if(typeof W==="boolean")this.encodeBoolean(W);else if(typeof W==="number")if(!this.forceIntegerToFloat)this.encodeNumber(W);else this.encodeNumberAsFloat(W);else if(typeof W==="string")this.encodeString(W);else if(this.useBigInt64&&typeof W==="bigint")this.encodeBigInt64(W);else this.encodeObject(W,Q)}ensureBufferSizeToWrite(W){const Q=this.pos+W;if(this.view.byteLength<Q)this.resizeBuffer(Q2)}resizeBuffer(W){const Q=new ArrayBuffer(W),J=new Uint8Array(Q),V=new DataView(Q);J.set(this.bytes),this.view=V,this.bytes=J}encodeNil(){this.writeU8(192)}encodeBoolean(W){if(W===!1)this.writeU8(194);else this.writeU8(195)}encodeNumber(W){if(!this.forceIntegerToFloat&&Number.isSafeInteger(W))if(W>=0)if(W<128)this.writeU8(W);else if(W<256)this.writeU8(204),this.writeU8(W);else if(W<65536)this.writeU8(205),this.writeU16(W);else if(W<4294967296)this.writeU8(206),this.writeU32(W);else if(!this.useBigInt64)this.writeU8(207),this.writeU64(W);else this.encodeNumberAsFloat(W);else if(W>=-32)this.writeU8(224\|W+32);else if(W>=-128)this.writeU8(208),this.writeI8(W);else if(W>=-32768)this.writeU8(209),this.writeI16(W);else if(W>=-2147483648)this.writeU8(210),this.writeI32(W);else if(!this.useBigInt64)this.writeU8(211),this.writeI64(W);else this.encodeNumberAsFloat(W);else this.encodeNumberAsFloat(W)}encodeNumberAsFloat(W){if(this.forceFloat32)this.writeU8(202),this.writeF32(W);else this.writeU8(203),this.writeF64(W)}encodeBigInt64(W){if(W>=BigInt(0))this.writeU8(207),this.writeBigUint64(W);else this.writeU8(211),this.writeBigInt64(W)}writeStringHeader(W){if(W<32)this.writeU8(160+W);else if(W<256)this.writeU8(217),this.writeU8(W);else if(W<65536)this.writeU8(218),this.writeU16(W);else if(W<4294967296)this.writeU8(219),this.writeU32(W);else throw new Error(`Too long string: ${W} bytes in UTF-8`)}encodeString(W){const J=n6(W);this.ensureBufferSizeToWrite(5+J),this.writeStringHeader(J),o6(W,this.bytes,this.pos),this.pos+=J}encodeObject(W,Q){const J=this.extensionCodec.tryToEncode(W,this.context);if(J!=null)this.encodeExtension(J);else if(Array.isArray(W))this.encodeArray(W,Q);else if(ArrayBuffer.isView(W))this.encodeBinary(W);else if(typeof W==="object")this.encodeMap(W,Q);else throw new Error(`Unrecognized object: ${Object.prototype.toString.apply(W)}`)}encodeBinary(W){const Q=W.byteLength;if(Q<256)this.writeU8(196),this.writeU8(Q);else if(Q<65536)this.writeU8(197),this.writeU16(Q);else if(Q<4294967296)this.writeU8(198),this.writeU32(Q);else throw new Error(`Too large binary: ${Q}`);const J=L1(W);this.writeU8a(J)}encodeArray(W,Q){const J=W.length;if(J<16)this.writeU8(144+J);else if(J<65536)this.writeU8(220),this.writeU16(J);else if(J<4294967296)this.writeU8(221),this.writeU32(J);else throw new Error(`Too large array: ${J}`);for(let V of W)this.doEncode(V,Q+1)}countWithoutUndefined(W,Q){let J=0;for(let V of Q)if(W[V]!==void 0)J++;return J}encodeMap(W,Q){const J=Object.keys(W);if(this.sortKeys)J.sort();const V=this.ignoreUndefined?this.countWithoutUndefined(W,J):J.length;if(V<16)this.writeU8(128+V);else if(V<65536)this.writeU8(222),this.writeU16(V);else if(V<4294967296)this.writeU8(223),this.writeU32(V);else throw new Error(`Too large map object: ${V}`);for(let G of J){const X=W[G];if(!(this.ignoreUndefined&&X===void 0))this.encodeString(G),this.doEncode(X,Q+1)}}encodeExtension(W){if(typeof W.data==="function"){const J=W.data(this.pos+6),V=J.length;if(V>=4294967296)throw new Error(`Too large extension object: ${V}`);this.writeU8(201),this.writeU32(V),this.writeI8(W.type),this.writeU8a(J);return}const Q=W.data.length;if(Q===1)this.writeU8(212);else if(Q===2)this.writeU8(213);else if(Q===4)this.writeU8(214);else if(Q===8)this.writeU8(215);else if(Q===16)this.writeU8(216);else if(Q<256)this.writeU8(199),this.writeU8(Q);else if(Q<65536)this.writeU8(200),this.writeU16(Q);else if(Q<4294967296)this.writeU8(201),this.writeU32(Q);else throw new Error(`Too large extension object: ${Q}`);this.writeI8(W.type),this.writeU8a(W.data)}writeU8(W){this.ensureBufferSizeToWrite(1),this.view.setUint8(this.pos,W),this.pos++}writeU8a(W){const Q=W.length;this.ensureBufferSizeToWrite(Q),this.bytes.set(W,this.pos),this.pos+=Q}writeI8(W){this.ensureBufferSizeToWrite(1),this.view.setInt8(this.pos,W),this.pos++}writeU16(W){this.ensureBufferSizeToWrite(2),this.view.setUint16(this.pos,W),this.pos+=2}writeI16(W){this.ensureBufferSizeToWrite(2),this.view.setInt16(this.pos,W),this.pos+=2}writeU32(W){this.ensureBufferSizeToWrite(4),this.view.setUint32(this.pos,W),this.pos+=4}writeI32(W){this.ensureBufferSizeToWrite(4),this.view.setInt32(this.pos,W),this.pos+=4}writeF32(W){this.ensureBufferSizeToWrite(4),this.view.setFloat32(this.pos,W),this.pos+=4}writeF64(W){this.ensureBufferSizeToWrite(8),this.view.setFloat64(this.pos,W),this.pos+=8}writeU64(W){this.ensureBufferSizeToWrite(8),s6(this.view,this.pos,W),this.pos+=8}writeI64(W){this.ensureBufferSizeToWrite(8),a1(this.view,this.pos,W),this.pos+=8}writeBigUint64(W){this.ensureBufferSizeToWrite(8),this.view.setBigUint64(this.pos,W),this.pos+=8}writeBigInt64(W){this.ensureBufferSizeToWrite(8),this.view.setBigInt64(this.pos,W),this.pos+=8}}function t1(W,Q){return new e1(Q).encodeSharedRef(W)}function W8(W){return`${W<0?"-":""}0x${Math.abs(W).toString(16).padStart(2,"0")}`}var JJ=16,QJ=16;class p8{constructor(W=JJ,Q=QJ){this.hit=0,this.miss=0,this.maxKeyLength=W,this.maxLengthPerKey=Q,this.caches=[];for(let J=0;J<this.maxKeyLength;J++)this.caches.push([])}canBeCached(W){return W>0&&W<=this.maxKeyLength}find(W,Q,J){const V=this.caches[J-1];W:for(let G of V){const X=G.bytes;for(let Y=0;Y<J;Y++)if(X[Y]!==W[Q+Y])continue W;return G.str}return null}store(W,Q){const J=this.caches[W.length-1],V={bytes:W,str:Q};if(J.length>=this.maxLengthPerKey)J[Math.random()J.length\|0]=V;else J.push(V)}decode(W,Q,J){const V=this.find(W,Q,J);if(V!=null)return this.hit++,V;this.miss++;const G=y8(W,Q,J),X=Uint8Array.prototype.slice.call(W,Q,Q+J);return this.store(X,G),G}}var f8="array",D1="map_key",J5="map_value",VJ=(W)=>{if(typeof W==="string"\|\|typeof W==="number")return W;throw new Y0("The type of key must be string or number but "+typeof W)};class Q5{constructor(){this.stack=[],this.stackHeadPosition=-1}get length(){return this.stackHeadPosition+1}top(){return this.stack[this.stackHeadPosition]}pushArrayState(W){const Q=this.getUninitializedStateFromPool();Q.type=f8,Q.position=0,Q.size=W,Q.array=new Array(W)}pushMapState(W){const Q=this.getUninitializedStateFromPool();Q.type=D1,Q.readCount=0,Q.size=W,Q.map={}}getUninitializedStateFromPool(){if(this.stackHeadPosition++,this.stackHeadPosition===this.stack.length){const W={type:void 0,size:0,array:void 0,position:0,readCount:0,map:void 0,key:null};this.stack.push(W)}return this.stack[this.stackHeadPosition]}release(W){if(this.stack[this.stackHeadPosition]!==W)throw new Error("Invalid stack state. Released state is not on top of the stack.");if(W.type===f8){const J=W;J.size=0,J.array=void 0,J.position=0,J.type=void 0}if(W.type===D1\|\|W.type===J5){const J=W;J.size=0,J.map=void 0,J.readCount=0,J.type=void 0}this.stackHeadPosition--}reset(){this.stack.length=0,this.stackHeadPosition=-1}}var I1=-1,b8=new DataView(new ArrayBuffer(0)),GJ=new Uint8Array(b8.buffer);try{b8.getInt8(0)}catch(W){if(!(W instanceof RangeError))throw new Error("This module is not supported in the current JavaScript engine because DataView does not throw RangeError on out-of-bounds access")}var W5=new RangeError("Insufficient data"),XJ=new p8;class J8{constructor(W){this.totalPos=0,this.pos=0,this.view=b8,this.bytes=GJ,this.headByte=I1,this.stack=new Q5,this.entered=!1,this.extensionCodec=W?.extensionCodec??u0.defaultCodec,this.context=W?.context,this.useBigInt64=W?.useBigInt64??!1,this.rawStrings=W?.rawStrings??!1,this.maxStrLength=W?.maxStrLength??Q1,this.maxBinLength=W?.maxBinLength??Q1,this.maxArrayLength=W?.maxArrayLength??Q1,this.maxMapLength=W?.maxMapLength??Q1,this.maxExtLength=W?.maxExtLength??Q1,this.keyDecoder=W?.keyDecoder!==void 0?W.keyDecoder:XJ,this.mapKeyConverter=W?.mapKeyConverter??VJ}clone(){return new J8({extensionCodec:this.extensionCodec,context:this.context,useBigInt64:this.useBigInt64,rawStrings:this.rawStrings,maxStrLength:this.maxStrLength,maxBinLength:this.maxBinLength,maxArrayLength:this.maxArrayLength,maxMapLength:this.maxMapLength,maxExtLength:this.maxExtLength,keyDecoder:this.keyDecoder})}reinitializeState(){this.totalPos=0,this.headByte=I1,this.stack.reset()}setBuffer(W){const Q=L1(W);this.bytes=Q,this.view=new DataView(Q.buffer,Q.byteOffset,Q.byteLength),this.pos=0}appendBuffer(W){if(this.headByte===I1&&!this.hasRemaining(1))this.setBuffer(W);else{const Q=this.bytes.subarray(this.pos),J=L1(W),V=new Uint8Array(Q.length+J.length);V.set(Q),V.set(J,Q.length),this.setBuffer(V)}}hasRemaining(W){return this.view.byteLength-this.pos>=W}createExtraByteError(W){const{view:Q,pos:J}=this;return new RangeError(`Extra ${Q.byteLength-J} of ${Q.byteLength} byte(s) found at buffer[${W}]`)}decode(W){if(this.entered)return this.clone().decode(W);try{this.entered=!0,this.reinitializeState(),this.setBuffer(W);const Q=this.doDecodeSync();if(this.hasRemaining(1))throw this.createExtraByteError(this.pos);return Q}finally{this.entered=!1}}decodeMulti(W){if(this.entered){yieldthis.clone().decodeMulti(W);return}try{this.entered=!0,this.reinitializeState(),this.setBuffer(W);while(this.hasRemaining(1))yield this.doDecodeSync()}finally{this.entered=!1}}async decodeAsync(W){if(this.entered)return this.clone().decodeAsync(W);try{this.entered=!0;let Q=!1,J;for await(let Y of W){if(Q)throw this.entered=!1,this.createExtraByteError(this.totalPos);this.appendBuffer(Y);try{J=this.doDecodeSync(),Q=!0}catch(q){if(!(q instanceof RangeError))throw q}this.totalPos+=this.pos}if(Q){if(this.hasRemaining(1))throw this.createExtraByteError(this.totalPos);return J}const{headByte:V,pos:G,totalPos:X}=this;throw new RangeError(`Insufficient data in parsing ${W8(V)} at ${X} (${G} in the current buffer)`)}finally{this.entered=!1}}decodeArrayStream(W){return this.decodeMultiAsync(W,!0)}decodeStream(W){return this.decodeMultiAsync(W,!1)}asyncdecodeMultiAsync(W,Q){if(this.entered){yieldthis.clone().decodeMultiAsync(W,Q);return}try{this.entered=!0;let J=Q,V=-1;for await(let G of W){if(Q&&V===0)throw this.createExtraByteError(this.totalPos);if(this.appendBuffer(G),J)V=this.readArraySize(),J=!1,this.complete();try{while(!0)if(yield this.doDecodeSync(),--V===0)break}catch(X){if(!(X instanceof RangeError))throw X}this.totalPos+=this.pos}}finally{this.entered=!1}}doDecodeSync(){W:while(!0){const W=this.readHeadByte();let Q;if(W>=224)Q=W-256;else if(W<192)if(W<128)Q=W;else if(W<144){const V=W-128;if(V!==0){this.pushMapState(V),this.complete();continue W}else Q={}}else if(W<160){const V=W-144;if(V!==0){this.pushArrayState(V),this.complete();continue W}else Q=[]}else{const V=W-160;Q=this.decodeString(V,0)}else if(W===192)Q=null;else if(W===194)Q=!1;else if(W===195)Q=!0;else if(W===202)Q=this.readF32();else if(W===203)Q=this.readF64();else if(W===204)Q=this.readU8();else if(W===205)Q=this.readU16();else if(W===206)Q=this.readU32();else if(W===207)if(this.useBigInt64)Q=this.readU64AsBigInt();else Q=this.readU64();else if(W===208)Q=this.readI8();else if(W===209)Q=this.readI16();else if(W===210)Q=this.readI32();else if(W===211)if(this.useBigInt64)Q=this.readI64AsBigInt();else Q=this.readI64();else if(W===217){const V=this.lookU8();Q=this.decodeString(V,1)}else if(W===218){const V=this.lookU16();Q=this.decodeString(V,2)}else if(W===219){const V=this.lookU32();Q=this.decodeString(V,4)}else if(W===220){const V=this.readU16();if(V!==0){this.pushArrayState(V),this.complete();continue W}else Q=[]}else if(W===221){const V=this.readU32();if(V!==0){this.pushArrayState(V),this.complete();continue W}else Q=[]}else if(W===222){const V=this.readU16();if(V!==0){this.pushMapState(V),this.complete();continue W}else Q={}}else if(W===223){const V=this.readU32();if(V!==0){this.pushMapState(V),this.complete();continue W}else Q={}}else if(W===196){const V=this.lookU8();Q=this.decodeBinary(V,1)}else if(W===197){const V=this.lookU16();Q=this.decodeBinary(V,2)}else if(W===198){const V=this.lookU32();Q=this.decodeBinary(V,4)}else if(W===212)Q=this.decodeExtension(1,0);else if(W===213)Q=this.decodeExtension(2,0);else if(W===214)Q=this.decodeExtension(4,0);else if(W===215)Q=this.decodeExtension(8,0);else if(W===216)Q=this.decodeExtension(16,0);else if(W===199){const V=this.lookU8();Q=this.decodeExtension(V,1)}else if(W===200){const V=this.lookU16();Q=this.decodeExtension(V,2)}else if(W===201){const V=this.lookU32();Q=this.decodeExtension(V,4)}else throw new Y0(`Unrecognized type byte: ${W8(W)}`);this.complete();const J=this.stack;while(J.length>0){const V=J.top();if(V.type===f8)if(V.array[V.position]=Q,V.position++,V.position===V.size)Q=V.array,J.release(V);else continue W;else if(V.type===D1){if(Q==="__proto__")throw new Y0("The key __proto__ is not allowed");V.key=this.mapKeyConverter(Q),V.type=J5;continue W}else if(V.map[V.key]=Q,V.readCount++,V.readCount===V.size)Q=V.map,J.release(V);else{V.key=null,V.type=D1;continue W}}return Q}}readHeadByte(){if(this.headByte===I1)this.headByte=this.readU8();return this.headByte}complete(){this.headByte=I1}readArraySize(){const W=this.readHeadByte();switch(W){case 220:return this.readU16();case 221:return this.readU32();default:if(W<160)return W-144;else throw new Y0(`Unrecognized array type byte: ${W8(W)}`)}}pushMapState(W){if(W>this.maxMapLength)throw new Y0(`Max length exceeded: map length (${W}) > maxMapLengthLength (${this.maxMapLength})`);this.stack.pushMapState(W)}pushArrayState(W){if(W>this.maxArrayLength)throw new Y0(`Max length exceeded: array length (${W}) > maxArrayLength (${this.maxArrayLength})`);this.stack.pushArrayState(W)}decodeString(W,Q){if(!this.rawStrings\|\|this.stateIsMapKey())return this.decodeUtf8String(W,Q);return this.decodeBinary(W,Q)}decodeUtf8String(W,Q){if(W>this.maxStrLength)throw new Y0(`Max length exceeded: UTF-8 byte length (${W}) > maxStrLength (${this.maxStrLength})`);if(this.bytes.byteLength<this.pos+Q+W)throw W5;const J=this.pos+Q;let V;if(this.stateIsMapKey()&&this.keyDecoder?.canBeCached(W))V=this.keyDecoder.decode(this.bytes,J,W);else V=a6(this.bytes,J,W);return this.pos+=Q+W,V}stateIsMapKey(){if(this.stack.length>0)return this.stack.top().type===D1;return!1}decodeBinary(W,Q){if(W>this.maxBinLength)throw new Y0(`Max length exceeded: bin length (${W}) > maxBinLength (${this.maxBinLength})`);if(!this.hasRemaining(W+Q))throw W5;const J=this.pos+Q,V=this.bytes.subarray(J,J+W);return this.pos+=Q+W,V}decodeExtension(W,Q){if(W>this.maxExtLength)throw new Y0(`Max length exceeded: ext length (${W}) > maxExtLength (${this.maxExtLength})`);const J=this.view.getInt8(this.pos+Q),V=this.decodeBinary(W,Q+1);return this.extensionCodec.decode(V,J,this.context)}lookU8(){return this.view.getUint8(this.pos)}lookU16(){return this.view.getUint16(this.pos)}lookU32(){return this.view.getUint32(this.pos)}readU8(){const W=this.view.getUint8(this.pos);return this.pos++,W}readI8(){const W=this.view.getInt8(this.pos);return this.pos++,W}readU16(){const W=this.view.getUint16(this.pos);return this.pos+=2,W}readI16(){const W=this.view.getInt16(this.pos);return this.pos+=2,W}readU32(){const W=this.view.getUint32(this.pos);return this.pos+=4,W}readI32(){const W=this.view.getInt32(this.pos);return this.pos+=4,W}readU64(){const W=e6(this.view,this.pos);return this.pos+=8,W}readI64(){const W=s1(this.view,this.pos);return this.pos+=8,W}readU64AsBigInt(){const W=this.view.getBigUint64(this.pos);return this.pos+=8,W}readI64AsBigInt(){const W=this.view.getBigInt64(this.pos);return this.pos+=8,W}readF32(){const W=this.view.getFloat32(this.pos);return this.pos+=4,W}readF64(){const W=this.view.getFloat64(this.pos);return this.pos+=8,W}}function Q8(W,Q){return new J8(Q).decode(W)}var U1=function(W){let Q=W.length;while(--Q>=0)W[Q]=0},u8=function(W,Q,J,V,G){this.static_tree=W,this.extra_bits=Q,this.extra_base=J,this.elems=V,this.max_length=G,this.has_stree=W&&W.length},m8=function(W,Q){this.dyn_tree=W,this.max_code=0,this.stat_desc=Q},B0=function(W,Q,J,V,G){this.good_length=W,this.max_lazy=Q,this.nice_length=J,this.max_chain=V,this.func=G},q9=function(){this.strm=null,this.status=0,this.pending_buf=null,this.pending_buf_size=0,this.pending_out=0,this.pending=0,this.wrap=0,this.gzhead=null,this.gzindex=0,this.method=z8,this.last_flush=-1,this.w_size=0,this.w_bits=0,this.w_mask=0,this.window=null,this.window_size=0,this.prev=null,this.head=null,this.ins_h=0,this.hash_size=0,this.hash_bits=0,this.hash_mask=0,this.hash_shift=0,this.block_start=0,this.match_length=0,this.prev_match=0,this.match_available=0,this.strstart=0,this.match_start=0,this.lookahead=0,this.prev_length=0,this.max_chain_length=0,this.max_lazy_match=0,this.level=0,this.strategy=0,this.good_match=0,this.nice_match=0,this.dyn_ltree=new Uint16Array(eJ2),this.dyn_dtree=new Uint16Array((2aJ+1)2),this.bl_tree=new Uint16Array((2sJ+1)2),g0(this.dyn_ltree),g0(this.dyn_dtree),g0(this.bl_tree),this.l_desc=null,this.d_desc=null,this.bl_desc=null,this.bl_count=new Uint16Array(tJ+1),this.heap=new Uint16Array(2Q6+1),g0(this.heap),this.heap_len=0,this.heap_max=0,this.depth=new Uint16Array(2Q6+1),g0(this.depth),this.sym_buf=0,this.lit_bufsize=0,this.sym_next=0,this.sym_end=0,this.opt_len=0,this.static_len=0,this.matches=0,this.insert=0,this.bi_buf=0,this.bi_valid=0},S9=function(){this.input=null,this.next_in=0,this.avail_in=0,this.total_in=0,this.output=null,this.next_out=0,this.avail_out=0,this.total_out=0,this.msg="",this.state=null,this.data_type=2,this.adler=0},m1=function(W){this.options=Z8.assign({level:y9,method:f9,chunkSize:16384,windowBits:15,memLevel:8,strategy:p9},W\|\|{});let Q=this.options;if(Q.raw&&Q.windowBits>0)Q.windowBits=-Q.windowBits;else if(Q.gzip&&Q.windowBits>0&&Q.windowBits<16)Q.windowBits+=16;this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new U7,this.strm.avail_out=0;let J=S1.deflateInit2(this.strm,Q.level,Q.method,Q.windowBits,Q.memLevel,Q.strategy);if(J!==K8)throw new Error(d0[J]);if(Q.header)S1.deflateSetHeader(this.strm,Q.header);if(Q.dictionary){let V;if(typeof Q.dictionary==="string")V=f1.string2buf(Q.dictionary);else if(P7.call(Q.dictionary)==="[object ArrayBuffer]")V=new Uint8Array(Q.dictionary);else V=Q.dictionary;if(J=S1.deflateSetDictionary(this.strm,V),J!==K8)throw new Error(d0[J]);this._dict_set=!0}},Z6=function(W,Q){const J=new m1(Q);if(J.push(W,!0),J.err)throw J.msg\|\|d0[J.err];return J.result},b9=function(W,Q){return Q=Q\|\|{},Q.raw=!0,Z6(W,Q)},h9=function(W,Q){return Q=Q\|\|{},Q.gzip=!0,Z6(W,Q)},UQ=function(){this.strm=null,this.mode=0,this.last=!1,this.wrap=0,this.havedict=!1,this.flags=0,this.dmax=0,this.check=0,this.total=0,this.head=null,this.wbits=0,this.wsize=0,this.whave=0,this.wnext=0,this.window=null,this.hold=0,this.bits=0,this.length=0,this.offset=0,this.extra=0,this.lencode=null,this.distcode=null,this.lenbits=0,this.distbits=0,this.ncode=0,this.nlen=0,this.ndist=0,this.have=0,this.next=null,this.lens=new Uint16Array(320),this.work=new Uint16Array(288),this.lendyn=null,this.distdyn=null,this.sane=0,this.back=0,this.was=0},OQ=function(){this.text=0,this.time=0,this.xflags=0,this.os=0,this.extra=null,this.extra_len=0,this.name="",this.comment="",this.hcrc=0,this.done=!1},_1=function(W){this.options=Z8.assign({chunkSize:65536,windowBits:15,to:""},W\|\|{});const Q=this.options;if(Q.raw&&Q.windowBits>=0&&Q.windowBits<16){if(Q.windowBits=-Q.windowBits,Q.windowBits===0)Q.windowBits=-15}if(Q.windowBits>=0&&Q.windowBits<16&&!(W&&W.windowBits))Q.windowBits+=32;if(Q.windowBits>15&&Q.windowBits<48){if((Q.windowBits&15)===0)Q.windowBits\|=15}this.err=0,this.msg="",this.ended=!1,this.chunks=[],this.strm=new U7,this.strm.avail_out=0;let J=N0.inflateInit2(this.strm,Q.windowBits);if(J!==b1)throw new Error(d0[J]);if(this.header=new xQ,N0.inflateGetHeader(this.strm,this.header),Q.dictionary){if(typeof Q.dictionary==="string")Q.dictionary=f1.string2buf(Q.dictionary);else if(R7.call(Q.dictionary)==="[object ArrayBuffer]")Q.dictionary=new Uint8Array(Q.dictionary);if(Q.raw){if(J=N0.inflateSetDictionary(this.strm,Q.dictionary),J!==b1)throw new Error(d0[J])}}},H6=function(W,Q){const J=new _1(Q);if(J.push(W),J.err)throw J.msg\|\|d0[J.err];return J.result},AQ=function(W,Q){return Q=Q\|\|{},Q.raw=!0,H6(W,Q)};/! pako 2.1.0 https://github.com/nodeca/pako @license (MIT AND Zlib) /var YJ=0,m5=1,qJ=2,UJ=3,PJ=258,U6=29,h1=256,A1=h1+1+U6,X1=30,P6=19,_5=2A1+1,m0=15,h8=16,KJ=7,K6=256,c5=16,d5=17,i5=18,t8=new Uint8Array([0,0,0,0,0,0,0,0,1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4,5,5,5,5,0]),U8=new Uint8Array([0,0,0,0,1,1,2,2,3,3,4,4,5,5,6,6,7,7,8,8,9,9,10,10,11,11,12,12,13,13]),FJ=new Uint8Array([0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,3,7]),l5=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]),zJ=512,w0=new Array((A1+2)2);U1(w0);var N1=new Array(X12);U1(N1);var T1=new Array(zJ);U1(T1);var g1=new Array(PJ-UJ+1);U1(g1);var F6=new Array(U6);U1(F6);var P8=new Array(X1);U1(P8);var r5,n5,o5,a5=(W)=>{return W<256?T1[W]:T1[256+(W>>>7)]},E1=(W,Q)=>{W.pending_buf[W.pending++]=Q&255,W.pending_buf[W.pending++]=Q>>>8&255},P0=(W,Q,J)=>{if(W.bi_valid>h8-J)W.bi_buf\|=Q<<W.bi_valid&65535,E1(W,W.bi_buf),W.bi_buf=Q>>h8-W.bi_valid,W.bi_valid+=J-h8;else W.bi_buf\|=Q<<W.bi_valid&65535,W.bi_valid+=J},M0=(W,Q,J)=>{P0(W,J[Q2],J[Q2+1])},s5=(W,Q)=>{let J=0;do J\|=W&1,W>>>=1,J<<=1;while(--Q>0);return J>>>1},ZJ=(W)=>{if(W.bi_valid===16)E1(W,W.bi_buf),W.bi_buf=0,W.bi_valid=0;else if(W.bi_valid>=8)W.pending_buf[W.pending++]=W.bi_buf&255,W.bi_buf>>=8,W.bi_valid-=8},HJ=(W,Q)=>{const{dyn_tree:J,max_code:V}=Q,G=Q.stat_desc.static_tree,X=Q.stat_desc.has_stree,Y=Q.stat_desc.extra_bits,q=Q.stat_desc.extra_base,F=Q.stat_desc.max_length;let U,K,$,P,z,C,S=0;for(P=0;P<=m0;P++)W.bl_count[P]=0;J[W.heap[W.heap_max]2+1]=0;for(U=W.heap_max+1;U<_5;U++){if(K=W.heap[U],P=J[J[K2+1]2+1]+1,P>F)P=F,S++;if(J[K2+1]=P,K>V)continue;if(W.bl_count[P]++,z=0,K>=q)z=Y[K-q];if(C=J[K2],W.opt_len+=C(P+z),X)W.static_len+=C(G[K2+1]+z)}if(S===0)return;do{P=F-1;while(W.bl_count[P]===0)P--;W.bl_count[P]--,W.bl_count[P+1]+=2,W.bl_count[F]--,S-=2}while(S>0);for(P=F;P!==0;P--){K=W.bl_count[P];while(K!==0){if($=W.heap[--U],$>V)continue;if(J[$2+1]!==P)W.opt_len+=(P-J[$2+1])J[$2],J[$2+1]=P;K--}}},e5=(W,Q,J)=>{const V=new Array(m0+1);let G=0,X,Y;for(X=1;X<=m0;X++)G=G+J[X-1]<<1,V[X]=G;for(Y=0;Y<=Q;Y++){let q=W[Y2+1];if(q===0)continue;W[Y2]=s5(V[q]++,q)}},kJ=()=>{let W,Q,J,V,G;const X=new Array(m0+1);J=0;for(V=0;V<U6-1;V++){F6[V]=J;for(W=0;W<1<<t8[V];W++)g1[J++]=V}g1[J-1]=V,G=0;for(V=0;V<16;V++){P8[V]=G;for(W=0;W<1<<U8[V];W++)T1[G++]=V}G>>=7;for(;V<X1;V++){P8[V]=G<<7;for(W=0;W<1<<U8[V]-7;W++)T1[256+G++]=V}for(Q=0;Q<=m0;Q++)X[Q]=0;W=0;while(W<=143)w0[W2+1]=8,W++,X[8]++;while(W<=255)w0[W2+1]=9,W++,X[9]++;while(W<=279)w0[W2+1]=7,W++,X[7]++;while(W<=287)w0[W2+1]=8,W++,X[8]++;e5(w0,A1+1,X);for(W=0;W<X1;W++)N1[W2+1]=5,N1[W2]=s5(W,5);r5=new u8(w0,t8,h1+1,A1,m0),n5=new u8(N1,U8,0,X1,m0),o5=new u8(new Array(0),FJ,0,P6,KJ)},t5=(W)=>{let Q;for(Q=0;Q<A1;Q++)W.dyn_ltree[Q2]=0;for(Q=0;Q<X1;Q++)W.dyn_dtree[Q2]=0;for(Q=0;Q<P6;Q++)W.bl_tree[Q2]=0;W.dyn_ltree[K62]=1,W.opt_len=W.static_len=0,W.sym_next=W.matches=0},W7=(W)=>{if(W.bi_valid>8)E1(W,W.bi_buf);else if(W.bi_valid>0)W.pending_buf[W.pending++]=W.bi_buf;W.bi_buf=0,W.bi_valid=0},V5=(W,Q,J,V)=>{const G=Q2,X=J2;return W[G]<W[X]\|\|W[G]===W[X]&&V[Q]<=V[J]},_8=(W,Q,J)=>{const V=W.heap[J];let G=J<<1;while(G<=W.heap_len){if(G<W.heap_len&&V5(Q,W.heap[G+1],W.heap[G],W.depth))G++;if(V5(Q,V,W.heap[G],W.depth))break;W.heap[J]=W.heap[G],J=G,G<<=1}W.heap[J]=V},G5=(W,Q,J)=>{let V,G,X=0,Y,q;if(W.sym_next!==0)do if(V=W.pending_buf[W.sym_buf+X++]&255,V+=(W.pending_buf[W.sym_buf+X++]&255)<<8,G=W.pending_buf[W.sym_buf+X++],V===0)M0(W,G,Q);else{if(Y=g1[G],M0(W,Y+h1+1,Q),q=t8[Y],q!==0)G-=F6[Y],P0(W,G,q);if(V--,Y=a5(V),M0(W,Y,J),q=U8[Y],q!==0)V-=P8[Y],P0(W,V,q)}while(X<W.sym_next);M0(W,K6,Q)},W6=(W,Q)=>{const J=Q.dyn_tree,V=Q.stat_desc.static_tree,G=Q.stat_desc.has_stree,X=Q.stat_desc.elems;let Y,q,F=-1,U;W.heap_len=0,W.heap_max=_5;for(Y=0;Y<X;Y++)if(J[Y2]!==0)W.heap[++W.heap_len]=F=Y,W.depth[Y]=0;else J[Y2+1]=0;while(W.heap_len<2)if(U=W.heap[++W.heap_len]=F<2?++F:0,J[U2]=1,W.depth[U]=0,W.opt_len--,G)W.static_len-=V[U2+1];Q.max_code=F;for(Y=W.heap_len>>1;Y>=1;Y--)_8(W,J,Y);U=X;do Y=W.heap[1],W.heap[1]=W.heap[W.heap_len--],_8(W,J,1),q=W.heap[1],W.heap[--W.heap_max]=Y,W.heap[--W.heap_max]=q,J[U2]=J[Y2]+J[q2],W.depth[U]=(W.depth[Y]>=W.depth[q]?W.depth[Y]:W.depth[q])+1,J[Y2+1]=J[q2+1]=U,W.heap[1]=U++,_8(W,J,1);while(W.heap_len>=2);W.heap[--W.heap_max]=W.heap[1],HJ(W,Q),e5(J,F,W.bl_count)},X5=(W,Q,J)=>{let V,G=-1,X,Y=Q[1],q=0,F=7,U=4;if(Y===0)F=138,U=3;Q[(J+1)2+1]=65535;for(V=0;V<=J;V++){if(X=Y,Y=Q[(V+1)2+1],++q<F&&X===Y)continue;else if(q<U)W.bl_tree[X2]+=q;else if(X!==0){if(X!==G)W.bl_tree[X2]++;W.bl_tree[c52]++}else if(q<=10)W.bl_tree[d52]++;else W.bl_tree[i52]++;if(q=0,G=X,Y===0)F=138,U=3;else if(X===Y)F=6,U=3;else F=7,U=4}},Y5=(W,Q,J)=>{let V,G=-1,X,Y=Q[1],q=0,F=7,U=4;if(Y===0)F=138,U=3;for(V=0;V<=J;V++){if(X=Y,Y=Q[(V+1)2+1],++q<F&&X===Y)continue;else if(q<U)do M0(W,X,W.bl_tree);while(--q!==0);else if(X!==0){if(X!==G)M0(W,X,W.bl_tree),q--;M0(W,c5,W.bl_tree),P0(W,q-3,2)}else if(q<=10)M0(W,d5,W.bl_tree),P0(W,q-3,3);else M0(W,i5,W.bl_tree),P0(W,q-11,7);if(q=0,G=X,Y===0)F=138,U=3;else if(X===Y)F=6,U=3;else F=7,U=4}},$J=(W)=>{let Q;X5(W,W.dyn_ltree,W.l_desc.max_code),X5(W,W.dyn_dtree,W.d_desc.max_code),W6(W,W.bl_desc);for(Q=P6-1;Q>=3;Q--)if(W.bl_tree[l5[Q]2+1]!==0)break;return W.opt_len+=3(Q+1)+5+5+4,Q},CJ=(W,Q,J,V)=>{let G;P0(W,Q-257,5),P0(W,J-1,5),P0(W,V-4,4);for(G=0;G<V;G++)P0(W,W.bl_tree[l5[G]2+1],3);Y5(W,W.dyn_ltree,Q-1),Y5(W,W.dyn_dtree,J-1)},jJ=(W)=>{let Q=4093624447,J;for(J=0;J<=31;J++,Q>>>=1)if(Q&1&&W.dyn_ltree[J2]!==0)return 0;if(W.dyn_ltree[18]!==0\|\|W.dyn_ltree[20]!==0\|\|W.dyn_ltree[26]!==0)return 1;for(J=32;J<h1;J++)if(W.dyn_ltree[J2]!==0)return 1;return 0},q5=!1,BJ=(W)=>{if(!q5)kJ(),q5=!0;W.l_desc=new m8(W.dyn_ltree,r5),W.d_desc=new m8(W.dyn_dtree,n5),W.bl_desc=new m8(W.bl_tree,o5),W.bi_buf=0,W.bi_valid=0,t5(W)},J7=(W,Q,J,V)=>{if(P0(W,(YJ<<1)+(V?1:0),3),W7(W),E1(W,J),E1(W,~J),J)W.pending_buf.set(W.window.subarray(Q,Q+J),W.pending);W.pending+=J},MJ=(W)=>{P0(W,m5<<1,3),M0(W,K6,w0),ZJ(W)},RJ=(W,Q,J,V)=>{let G,X,Y=0;if(W.level>0){if(W.strm.data_type===2)W.strm.data_type=jJ(W);if(W6(W,W.l_desc),W6(W,W.d_desc),Y=$J(W),G=W.opt_len+3+7>>>3,X=W.static_len+3+7>>>3,X<=G)G=X}else G=X=J+5;if(J+4<=G&&Q!==-1)J7(W,Q,J,V);else if(W.strategy===4\|\|X===G)P0(W,(m5<<1)+(V?1:0),3),G5(W,w0,N1);else P0(W,(qJ<<1)+(V?1:0),3),CJ(W,W.l_desc.max_code+1,W.d_desc.max_code+1,Y+1),G5(W,W.dyn_ltree,W.dyn_dtree);if(t5(W),V)W7(W)},LJ=(W,Q,J)=>{if(W.pending_buf[W.sym_buf+W.sym_next++]=Q,W.pending_buf[W.sym_buf+W.sym_next++]=Q>>8,W.pending_buf[W.sym_buf+W.sym_next++]=J,Q===0)W.dyn_ltree[J2]++;else W.matches++,Q--,W.dyn_ltree[(g1[J]+h1+1)2]++,W.dyn_dtree[a5(Q)2]++;return W.sym_next===W.sym_end},IJ=BJ,DJ=J7,OJ=RJ,xJ=LJ,wJ=MJ,NJ={_tr_init:IJ,_tr_stored_block:DJ,_tr_flush_block:OJ,_tr_tally:xJ,_tr_align:wJ},SJ=(W,Q,J,V)=>{let G=W&65535\|0,X=W>>>16&65535\|0,Y=0;while(J!==0){Y=J>2000?2000:J,J-=Y;do G=G+Q[V++]\|0,X=X+G\|0;while(--Y);G%=65521,X%=65521}return G\|X<<16\|0},y1=SJ,vJ=()=>{let W,Q=[];for(var J=0;J<256;J++){W=J;for(var V=0;V<8;V++)W=W&1?3988292384^W>>>1:W>>>1;Q[J]=W}return Q},AJ=new Uint32Array(vJ()),TJ=(W,Q,J,V)=>{const G=AJ,X=V+J;W^=-1;for(let Y=V;Y<X;Y++)W=W>>>8^G[(W^Q[Y])&255];return W^-1},V0=TJ,d0={2:"need dictionary",1:"stream end",0:"","-1":"file error","-2":"stream error","-3":"data error","-4":"insufficient memory","-5":"buffer error","-6":"incompatible version"},r0={Z_NO_FLUSH:0,Z_PARTIAL_FLUSH:1,Z_SYNC_FLUSH:2,Z_FULL_FLUSH:3,Z_FINISH:4,Z_BLOCK:5,Z_TREES:6,Z_OK:0,Z_STREAM_END:1,Z_NEED_DICT:2,Z_ERRNO:-1,Z_STREAM_ERROR:-2,Z_DATA_ERROR:-3,Z_MEM_ERROR:-4,Z_BUF_ERROR:-5,Z_NO_COMPRESSION:0,Z_BEST_SPEED:1,Z_BEST_COMPRESSION:9,Z_DEFAULT_COMPRESSION:-1,Z_FILTERED:1,Z_HUFFMAN_ONLY:2,Z_RLE:3,Z_FIXED:4,Z_DEFAULT_STRATEGY:0,Z_BINARY:0,Z_TEXT:1,Z_UNKNOWN:2,Z_DEFLATED:8},{_tr_init:gJ,_tr_stored_block:J6,_tr_flush_block:EJ,_tr_tally:y0,_tr_align:yJ}=NJ,{Z_NO_FLUSH:p0,Z_PARTIAL_FLUSH:pJ,Z_FULL_FLUSH:fJ,Z_FINISH:k0,Z_BLOCK:U5,Z_OK:X0,Z_STREAM_END:P5,Z_STREAM_ERROR:R0,Z_DATA_ERROR:bJ,Z_BUF_ERROR:c8,Z_DEFAULT_COMPRESSION:hJ,Z_FILTERED:uJ,Z_HUFFMAN_ONLY:V8,Z_RLE:mJ,Z_FIXED:_J,Z_DEFAULT_STRATEGY:cJ,Z_UNKNOWN:dJ,Z_DEFLATED:z8}=r0,iJ=9,lJ=15,rJ=8,nJ=29,oJ=256,Q6=oJ+1+nJ,aJ=30,sJ=19,eJ=2Q6+1,tJ=15,a=3,E0=258,L0=E0+a+1,W9=32,Y1=42,z6=57,V6=69,G6=73,X6=91,Y6=103,_0=113,x1=666,q0=1,P1=2,i0=3,K1=4,J9=3,c0=(W,Q)=>{return W.msg=d0[Q],Q},K5=(W)=>{return W2-(W>4?9:0)},g0=(W)=>{let Q=W.length;while(--Q>=0)W[Q]=0},Q9=(W)=>{let Q,J,V,G=W.w_size;Q=W.hash_size,V=Q;do J=W.head[--V],W.head[V]=J>=G?J-G:0;while(--Q);Q=G,V=Q;do J=W.prev[--V],W.prev[V]=J>=G?J-G:0;while(--Q)},V9=(W,Q,J)=>(Q<<W.hash_shift^J)&W.hash_mask,f0=V9,F0=(W)=>{const Q=W.state;let J=Q.pending;if(J>W.avail_out)J=W.avail_out;if(J===0)return;if(W.output.set(Q.pending_buf.subarray(Q.pending_out,Q.pending_out+J),W.next_out),W.next_out+=J,Q.pending_out+=J,W.total_out+=J,W.avail_out-=J,Q.pending-=J,Q.pending===0)Q.pending_out=0},z0=(W,Q)=>{EJ(W,W.block_start>=0?W.block_start:-1,W.strstart-W.block_start,Q),W.block_start=W.strstart,F0(W.strm)},s=(W,Q)=>{W.pending_buf[W.pending++]=Q},O1=(W,Q)=>{W.pending_buf[W.pending++]=Q>>>8&255,W.pending_buf[W.pending++]=Q&255},q6=(W,Q,J,V)=>{let G=W.avail_in;if(G>V)G=V;if(G===0)return 0;if(W.avail_in-=G,Q.set(W.input.subarray(W.next_in,W.next_in+G),J),W.state.wrap===1)W.adler=y1(W.adler,Q,G,J);else if(W.state.wrap===2)W.adler=V0(W.adler,Q,G,J);return W.next_in+=G,W.total_in+=G,G},Q7=(W,Q)=>{let{max_chain_length:J,strstart:V}=W,G,X,Y=W.prev_length,q=W.nice_match;const F=W.strstart>W.w_size-L0?W.strstart-(W.w_size-L0):0,U=W.window,K=W.w_mask,$=W.prev,P=W.strstart+E0;let z=U[V+Y-1],C=U[V+Y];if(W.prev_length>=W.good_match)J>>=2;if(q>W.lookahead)q=W.lookahead;do{if(G=Q,U[G+Y]!==C\|\|U[G+Y-1]!==z\|\|U[G]!==U[V]\|\|U[++G]!==U[V+1])continue;V+=2,G++;do;while(U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&U[++V]===U[++G]&&V<P);if(X=E0-(P-V),V=P-E0,X>Y){if(W.match_start=Q,Y=X,X>=q)break;z=U[V+Y-1],C=U[V+Y]}}while((Q=$[Q&K])>F&&--J!==0);if(Y<=W.lookahead)return Y;return W.lookahead},q1=(W)=>{const Q=W.w_size;let J,V,G;do{if(V=W.window_size-W.lookahead-W.strstart,W.strstart>=Q+(Q-L0)){if(W.window.set(W.window.subarray(Q,Q+Q-V),0),W.match_start-=Q,W.strstart-=Q,W.block_start-=Q,W.insert>W.strstart)W.insert=W.strstart;Q9(W),V+=Q}if(W.strm.avail_in===0)break;if(J=q6(W.strm,W.window,W.strstart+W.lookahead,V),W.lookahead+=J,W.lookahead+W.insert>=a){G=W.strstart-W.insert,W.ins_h=W.window[G],W.ins_h=f0(W,W.ins_h,W.window[G+1]);while(W.insert)if(W.ins_h=f0(W,W.ins_h,W.window[G+a-1]),W.prev[G&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=G,G++,W.insert--,W.lookahead+W.insert<a)break}}while(W.lookahead<L0&&W.strm.avail_in!==0)},V7=(W,Q)=>{let J=W.pending_buf_size-5>W.w_size?W.w_size:W.pending_buf_size-5,V,G,X,Y=0,q=W.strm.avail_in;do{if(V=65535,X=W.bi_valid+42>>3,W.strm.avail_out<X)break;if(X=W.strm.avail_out-X,G=W.strstart-W.block_start,V>G+W.strm.avail_in)V=G+W.strm.avail_in;if(V>X)V=X;if(V<J&&(V===0&&Q!==k0\|\|Q===p0\|\|V!==G+W.strm.avail_in))break;if(Y=Q===k0&&V===G+W.strm.avail_in?1:0,J6(W,0,0,Y),W.pending_buf[W.pending-4]=V,W.pending_buf[W.pending-3]=V>>8,W.pending_buf[W.pending-2]=~V,W.pending_buf[W.pending-1]=~V>>8,F0(W.strm),G){if(G>V)G=V;W.strm.output.set(W.window.subarray(W.block_start,W.block_start+G),W.strm.next_out),W.strm.next_out+=G,W.strm.avail_out-=G,W.strm.total_out+=G,W.block_start+=G,V-=G}if(V)q6(W.strm,W.strm.output,W.strm.next_out,V),W.strm.next_out+=V,W.strm.avail_out-=V,W.strm.total_out+=V}while(Y===0);if(q-=W.strm.avail_in,q){if(q>=W.w_size)W.matches=2,W.window.set(W.strm.input.subarray(W.strm.next_in-W.w_size,W.strm.next_in),0),W.strstart=W.w_size,W.insert=W.strstart;else{if(W.window_size-W.strstart<=q){if(W.strstart-=W.w_size,W.window.set(W.window.subarray(W.w_size,W.w_size+W.strstart),0),W.matches<2)W.matches++;if(W.insert>W.strstart)W.insert=W.strstart}W.window.set(W.strm.input.subarray(W.strm.next_in-q,W.strm.next_in),W.strstart),W.strstart+=q,W.insert+=q>W.w_size-W.insert?W.w_size-W.insert:q}W.block_start=W.strstart}if(W.high_water<W.strstart)W.high_water=W.strstart;if(Y)return K1;if(Q!==p0&&Q!==k0&&W.strm.avail_in===0&&W.strstart===W.block_start)return P1;if(X=W.window_size-W.strstart,W.strm.avail_in>X&&W.block_start>=W.w_size){if(W.block_start-=W.w_size,W.strstart-=W.w_size,W.window.set(W.window.subarray(W.w_size,W.w_size+W.strstart),0),W.matches<2)W.matches++;if(X+=W.w_size,W.insert>W.strstart)W.insert=W.strstart}if(X>W.strm.avail_in)X=W.strm.avail_in;if(X)q6(W.strm,W.window,W.strstart,X),W.strstart+=X,W.insert+=X>W.w_size-W.insert?W.w_size-W.insert:X;if(W.high_water<W.strstart)W.high_water=W.strstart;if(X=W.bi_valid+42>>3,X=W.pending_buf_size-X>65535?65535:W.pending_buf_size-X,J=X>W.w_size?W.w_size:X,G=W.strstart-W.block_start,G>=J\|\|(G\|\|Q===k0)&&Q!==p0&&W.strm.avail_in===0&&G<=X)V=G>X?X:G,Y=Q===k0&&W.strm.avail_in===0&&V===G?1:0,J6(W,W.block_start,V,Y),W.block_start+=V,F0(W.strm);return Y?i0:q0},d8=(W,Q)=>{let J,V;for(;;){if(W.lookahead<L0){if(q1(W),W.lookahead<L0&&Q===p0)return q0;if(W.lookahead===0)break}if(J=0,W.lookahead>=a)W.ins_h=f0(W,W.ins_h,W.window[W.strstart+a-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;if(J!==0&&W.strstart-J<=W.w_size-L0)W.match_length=Q7(W,J);if(W.match_length>=a)if(V=y0(W,W.strstart-W.match_start,W.match_length-a),W.lookahead-=W.match_length,W.match_length<=W.max_lazy_match&&W.lookahead>=a){W.match_length--;do W.strstart++,W.ins_h=f0(W,W.ins_h,W.window[W.strstart+a-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;while(--W.match_length!==0);W.strstart++}else W.strstart+=W.match_length,W.match_length=0,W.ins_h=W.window[W.strstart],W.ins_h=f0(W,W.ins_h,W.window[W.strstart+1]);else V=y0(W,0,W.window[W.strstart]),W.lookahead--,W.strstart++;if(V){if(z0(W,!1),W.strm.avail_out===0)return q0}}if(W.insert=W.strstart<a-1?W.strstart:a-1,Q===k0){if(z0(W,!0),W.strm.avail_out===0)return i0;return K1}if(W.sym_next){if(z0(W,!1),W.strm.avail_out===0)return q0}return P1},V1=(W,Q)=>{let J,V,G;for(;;){if(W.lookahead<L0){if(q1(W),W.lookahead<L0&&Q===p0)return q0;if(W.lookahead===0)break}if(J=0,W.lookahead>=a)W.ins_h=f0(W,W.ins_h,W.window[W.strstart+a-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;if(W.prev_length=W.match_length,W.prev_match=W.match_start,W.match_length=a-1,J!==0&&W.prev_length<W.max_lazy_match&&W.strstart-J<=W.w_size-L0){if(W.match_length=Q7(W,J),W.match_length<=5&&(W.strategy===uJ\|\|W.match_length===a&&W.strstart-W.match_start>4096))W.match_length=a-1}if(W.prev_length>=a&&W.match_length<=W.prev_length){G=W.strstart+W.lookahead-a,V=y0(W,W.strstart-1-W.prev_match,W.prev_length-a),W.lookahead-=W.prev_length-1,W.prev_length-=2;do if(++W.strstart<=G)W.ins_h=f0(W,W.ins_h,W.window[W.strstart+a-1]),J=W.prev[W.strstart&W.w_mask]=W.head[W.ins_h],W.head[W.ins_h]=W.strstart;while(--W.prev_length!==0);if(W.match_available=0,W.match_length=a-1,W.strstart++,V){if(z0(W,!1),W.strm.avail_out===0)return q0}}else if(W.match_available){if(V=y0(W,0,W.window[W.strstart-1]),V)z0(W,!1);if(W.strstart++,W.lookahead--,W.strm.avail_out===0)return q0}else W.match_available=1,W.strstart++,W.lookahead--}if(W.match_available)V=y0(W,0,W.window[W.strstart-1]),W.match_available=0;if(W.insert=W.strstart<a-1?W.strstart:a-1,Q===k0){if(z0(W,!0),W.strm.avail_out===0)return i0;return K1}if(W.sym_next){if(z0(W,!1),W.strm.avail_out===0)return q0}return P1},G9=(W,Q)=>{let J,V,G,X;const Y=W.window;for(;;){if(W.lookahead<=E0){if(q1(W),W.lookahead<=E0&&Q===p0)return q0;if(W.lookahead===0)break}if(W.match_length=0,W.lookahead>=a&&W.strstart>0){if(G=W.strstart-1,V=Y[G],V===Y[++G]&&V===Y[++G]&&V===Y[++G]){X=W.strstart+E0;do;while(V===Y[++G]&&V===Y[++G]&&V===Y[++G]&&V===Y[++G]&&V===Y[++G]&&V===Y[++G]&&V===Y[++G]&&V===Y[++G]&&G<X);if(W.match_length=E0-(X-G),W.match_length>W.lookahead)W.match_length=W.lookahead}}if(W.match_length>=a)J=y0(W,1,W.match_length-a),W.lookahead-=W.match_length,W.strstart+=W.match_length,W.match_length=0;else J=y0(W,0,W.window[W.strstart]),W.lookahead--,W.strstart++;if(J){if(z0(W,!1),W.strm.avail_out===0)return q0}}if(W.insert=0,Q===k0){if(z0(W,!0),W.strm.avail_out===0)return i0;return K1}if(W.sym_next){if(z0(W,!1),W.strm.avail_out===0)return q0}return P1},X9=(W,Q)=>{let J;for(;;){if(W.lookahead===0){if(q1(W),W.lookahead===0){if(Q===p0)return q0;break}}if(W.match_length=0,J=y0(W,0,W.window[W.strstart]),W.lookahead--,W.strstart++,J){if(z0(W,!1),W.strm.avail_out===0)return q0}}if(W.insert=0,Q===k0){if(z0(W,!0),W.strm.avail_out===0)return i0;return K1}if(W.sym_next){if(z0(W,!1),W.strm.avail_out===0)return q0}return P1},w1=[new B0(0,0,0,0,V7),new B0(4,4,8,4,d8),new B0(4,5,16,8,d8),new B0(4,6,32,32,d8),new B0(4,4,16,16,V1),new B0(8,16,32,32,V1),new B0(8,16,128,128,V1),new B0(8,32,128,256,V1),new B0(32,128,258,1024,V1),new B0(32,258,258,4096,V1)],Y9=(W)=>{W.window_size=2W.w_size,g0(W.head),W.max_lazy_match=w1[W.level].max_lazy,W.good_match=w1[W.level].good_length,W.nice_match=w1[W.level].nice_length,W.max_chain_length=w1[W.level].max_chain,W.strstart=0,W.block_start=0,W.lookahead=0,W.insert=0,W.match_length=W.prev_length=a-1,W.match_available=0,W.ins_h=0},u1=(W)=>{if(!W)return 1;const Q=W.state;if(!Q\|\|Q.strm!==W\|\|Q.status!==Y1&&Q.status!==z6&&Q.status!==V6&&Q.status!==G6&&Q.status!==X6&&Q.status!==Y6&&Q.status!==_0&&Q.status!==x1)return 1;return 0},G7=(W)=>{if(u1(W))return c0(W,R0);W.total_in=W.total_out=0,W.data_type=dJ;const Q=W.state;if(Q.pending=0,Q.pending_out=0,Q.wrap<0)Q.wrap=-Q.wrap;return Q.status=Q.wrap===2?z6:Q.wrap?Y1:_0,W.adler=Q.wrap===2?0:1,Q.last_flush=-2,gJ(Q),X0},X7=(W)=>{const Q=G7(W);if(Q===X0)Y9(W.state);return Q},U9=(W,Q)=>{if(u1(W)\|\|W.state.wrap!==2)return R0;return W.state.gzhead=Q,X0},Y7=(W,Q,J,V,G,X)=>{if(!W)return R0;let Y=1;if(Q===hJ)Q=6;if(V<0)Y=0,V=-V;else if(V>15)Y=2,V-=16;if(G<1\|\|G>iJ\|\|J!==z8\|\|V<8\|\|V>15\|\|Q<0\|\|Q>9\|\|X<0\|\|X>_J\|\|V===8&&Y!==1)return c0(W,R0);if(V===8)V=9;const q=new q9;return W.state=q,q.strm=W,q.status=Y1,q.wrap=Y,q.gzhead=null,q.w_bits=V,q.w_size=1<<q.w_bits,q.w_mask=q.w_size-1,q.hash_bits=G+7,q.hash_size=1<<q.hash_bits,q.hash_mask=q.hash_size-1,q.hash_shift=~~((q.hash_bits+a-1)/a),q.window=new Uint8Array(q.w_size2),q.head=new Uint16Array(q.hash_size),q.prev=new Uint16Array(q.w_size),q.lit_bufsize=1<<G+6,q.pending_buf_size=q.lit_bufsize4,q.pending_buf=new Uint8Array(q.pending_buf_size),q.sym_buf=q.lit_bufsize,q.sym_end=(q.lit_bufsize-1)3,q.level=Q,q.strategy=X,q.method=J,X7(W)},P9=(W,Q)=>{return Y7(W,Q,z8,lJ,rJ,cJ)},K9=(W,Q)=>{if(u1(W)\|\|Q>U5\|\|Q<0)return W?c0(W,R0):R0;const J=W.state;if(!W.output\|\|W.avail_in!==0&&!W.input\|\|J.status===x1&&Q!==k0)return c0(W,W.avail_out===0?c8:R0);const V=J.last_flush;if(J.last_flush=Q,J.pending!==0){if(F0(W),W.avail_out===0)return J.last_flush=-1,X0}else if(W.avail_in===0&&K5(Q)<=K5(V)&&Q!==k0)return c0(W,c8);if(J.status===x1&&W.avail_in!==0)return c0(W,c8);if(J.status===Y1&&J.wrap===0)J.status=_0;if(J.status===Y1){let G=z8+(J.w_bits-8<<4)<<8,X=-1;if(J.strategy>=V8\|\|J.level<2)X=0;else if(J.level<6)X=1;else if(J.level===6)X=2;else X=3;if(G\|=X<<6,J.strstart!==0)G\|=W9;if(G+=31-G%31,O1(J,G),J.strstart!==0)O1(J,W.adler>>>16),O1(J,W.adler&65535);if(W.adler=1,J.status=_0,F0(W),J.pending!==0)return J.last_flush=-1,X0}if(J.status===z6)if(W.adler=0,s(J,31),s(J,139),s(J,8),!J.gzhead){if(s(J,0),s(J,0),s(J,0),s(J,0),s(J,0),s(J,J.level===9?2:J.strategy>=V8\|\|J.level<2?4:0),s(J,J9),J.status=_0,F0(W),J.pending!==0)return J.last_flush=-1,X0}else{if(s(J,(J.gzhead.text?1:0)+(J.gzhead.hcrc?2:0)+(!J.gzhead.extra?0:4)+(!J.gzhead.name?0:8)+(!J.gzhead.comment?0:16)),s(J,J.gzhead.time&255),s(J,J.gzhead.time>>8&255),s(J,J.gzhead.time>>16&255),s(J,J.gzhead.time>>24&255),s(J,J.level===9?2:J.strategy>=V8\|\|J.level<2?4:0),s(J,J.gzhead.os&255),J.gzhead.extra&&J.gzhead.extra.length)s(J,J.gzhead.extra.length&255),s(J,J.gzhead.extra.length>>8&255);if(J.gzhead.hcrc)W.adler=V0(W.adler,J.pending_buf,J.pending,0);J.gzindex=0,J.status=V6}if(J.status===V6){if(J.gzhead.extra){let G=J.pending,X=(J.gzhead.extra.length&65535)-J.gzindex;while(J.pending+X>J.pending_buf_size){let q=J.pending_buf_size-J.pending;if(J.pending_buf.set(J.gzhead.extra.subarray(J.gzindex,J.gzindex+q),J.pending),J.pending=J.pending_buf_size,J.gzhead.hcrc&&J.pending>G)W.adler=V0(W.adler,J.pending_buf,J.pending-G,G);if(J.gzindex+=q,F0(W),J.pending!==0)return J.last_flush=-1,X0;G=0,X-=q}let Y=new Uint8Array(J.gzhead.extra);if(J.pending_buf.set(Y.subarray(J.gzindex,J.gzindex+X),J.pending),J.pending+=X,J.gzhead.hcrc&&J.pending>G)W.adler=V0(W.adler,J.pending_buf,J.pending-G,G);J.gzindex=0}J.status=G6}if(J.status===G6){if(J.gzhead.name){let G=J.pending,X;do{if(J.pending===J.pending_buf_size){if(J.gzhead.hcrc&&J.pending>G)W.adler=V0(W.adler,J.pending_buf,J.pending-G,G);if(F0(W),J.pending!==0)return J.last_flush=-1,X0;G=0}if(J.gzindex<J.gzhead.name.length)X=J.gzhead.name.charCodeAt(J.gzindex++)&255;else X=0;s(J,X)}while(X!==0);if(J.gzhead.hcrc&&J.pending>G)W.adler=V0(W.adler,J.pending_buf,J.pending-G,G);J.gzindex=0}J.status=X6}if(J.status===X6){if(J.gzhead.comment){let G=J.pending,X;do{if(J.pending===J.pending_buf_size){if(J.gzhead.hcrc&&J.pending>G)W.adler=V0(W.adler,J.pending_buf,J.pending-G,G);if(F0(W),J.pending!==0)return J.last_flush=-1,X0;G=0}if(J.gzindex<J.gzhead.comment.length)X=J.gzhead.comment.charCodeAt(J.gzindex++)&255;else X=0;s(J,X)}while(X!==0);if(J.gzhead.hcrc&&J.pending>G)W.adler=V0(W.adler,J.pending_buf,J.pending-G,G)}J.status=Y6}if(J.status===Y6){if(J.gzhead.hcrc){if(J.pending+2>J.pending_buf_size){if(F0(W),J.pending!==0)return J.last_flush=-1,X0}s(J,W.adler&255),s(J,W.adler>>8&255),W.adler=0}if(J.status=_0,F0(W),J.pending!==0)return J.last_flush=-1,X0}if(W.avail_in!==0\|\|J.lookahead!==0\|\|Q!==p0&&J.status!==x1){let G=J.level===0?V7(J,Q):J.strategy===V8?X9(J,Q):J.strategy===mJ?G9(J,Q):w1[J.level].func(J,Q);if(G===i0\|\|G===K1)J.status=x1;if(G===q0\|\|G===i0){if(W.avail_out===0)J.last_flush=-1;return X0}if(G===P1){if(Q===pJ)yJ(J);else if(Q!==U5){if(J6(J,0,0,!1),Q===fJ){if(g0(J.head),J.lookahead===0)J.strstart=0,J.block_start=0,J.insert=0}}if(F0(W),W.avail_out===0)return J.last_flush=-1,X0}}if(Q!==k0)return X0;if(J.wrap<=0)return P5;if(J.wrap===2)s(J,W.adler&255),s(J,W.adler>>8&255),s(J,W.adler>>16&255),s(J,W.adler>>24&255),s(J,W.total_in&255),s(J,W.total_in>>8&255),s(J,W.total_in>>16&255),s(J,W.total_in>>24&255);else O1(J,W.adler>>>16),O1(J,W.adler&65535);if(F0(W),J.wrap>0)J.wrap=-J.wrap;return J.pending!==0?X0:P5},F9=(W)=>{if(u1(W))return R0;const Q=W.state.status;return W.state=null,Q===_0?c0(W,bJ):X0},z9=(W,Q)=>{let J=Q.length;if(u1(W))return R0;const V=W.state,G=V.wrap;if(G===2\|\|G===1&&V.status!==Y1\|\|V.lookahead)return R0;if(G===1)W.adler=y1(W.adler,Q,J,0);if(V.wrap=0,J>=V.w_size){if(G===0)g0(V.head),V.strstart=0,V.block_start=0,V.insert=0;let F=new Uint8Array(V.w_size);F.set(Q.subarray(J-V.w_size,J),0),Q=F,J=V.w_size}const{avail_in:X,next_in:Y,input:q}=W;W.avail_in=J,W.next_in=0,W.input=Q,q1(V);while(V.lookahead>=a){let F=V.strstart,U=V.lookahead-(a-1);do V.ins_h=f0(V,V.ins_h,V.window[F+a-1]),V.prev[F&V.w_mask]=V.head[V.ins_h],V.head[V.ins_h]=F,F++;while(--U);V.strstart=F,V.lookahead=a-1,q1(V)}return V.strstart+=V.lookahead,V.block_start=V.strstart,V.insert=V.lookahead,V.lookahead=0,V.match_length=V.prev_length=a-1,V.match_available=0,W.next_in=Y,W.input=q,W.avail_in=X,V.wrap=G,X0},Z9=P9,H9=Y7,k9=X7,$9=G7,C9=U9,j9=K9,B9=F9,M9=z9,R9="pako deflate (from Nodeca project)",S1={deflateInit:Z9,deflateInit2:H9,deflateReset:k9,deflateResetKeep:$9,deflateSetHeader:C9,deflate:j9,deflateEnd:B9,deflateSetDictionary:M9,deflateInfo:R9},L9=(W,Q)=>{return Object.prototype.hasOwnProperty.call(W,Q)},I9=function(W){const Q=Array.prototype.slice.call(arguments,1);while(Q.length){const J=Q.shift();if(!J)continue;if(typeof J!=="object")throw new TypeError(J+"must be non-object");for(let V in J)if(L9(J,V))W[V]=J[V]}return W},D9=(W)=>{let Q=0;for(let V=0,G=W.length;V<G;V++)Q+=W[V].length;const J=new Uint8Array(Q);for(let V=0,G=0,X=W.length;V<X;V++){let Y=W[V];J.set(Y,G),G+=Y.length}return J},Z8={assign:I9,flattenChunks:D9},q7=!0;try{String.fromCharCode.apply(null,new Uint8Array(1))}catch(W){q7=!1}var p1=new Uint8Array(256);for(let W=0;W<256;W++)p1[W]=W>=252?6:W>=248?5:W>=240?4:W>=224?3:W>=192?2:1;p1[254]=p1[254]=1;var O9=(W)=>{if(typeof TextEncoder==="function"&&TextEncoder.prototype.encode)return(new TextEncoder()).encode(W);let Q,J,V,G,X,Y=W.length,q=0;for(G=0;G<Y;G++){if(J=W.charCodeAt(G),(J&64512)===55296&&G+1<Y){if(V=W.charCodeAt(G+1),(V&64512)===56320)J=65536+(J-55296<<10)+(V-56320),G++}q+=J<128?1:J<2048?2:J<65536?3:4}Q=new Uint8Array(q);for(X=0,G=0;X<q;G++){if(J=W.charCodeAt(G),(J&64512)===55296&&G+1<Y){if(V=W.charCodeAt(G+1),(V&64512)===56320)J=65536+(J-55296<<10)+(V-56320),G++}if(J<128)Q[X++]=J;else if(J<2048)Q[X++]=192\|J>>>6,Q[X++]=128\|J&63;else if(J<65536)Q[X++]=224\|J>>>12,Q[X++]=128\|J>>>6&63,Q[X++]=128\|J&63;else Q[X++]=240\|J>>>18,Q[X++]=128\|J>>>12&63,Q[X++]=128\|J>>>6&63,Q[X++]=128\|J&63}return Q},x9=(W,Q)=>{if(Q<65534){if(W.subarray&&q7)return String.fromCharCode.apply(null,W.length===Q?W:W.subarray(0,Q))}let J="";for(let V=0;V<Q;V++)J+=String.fromCharCode(W[V]);return J},w9=(W,Q)=>{const J=Q\|\|W.length;if(typeof TextDecoder==="function"&&TextDecoder.prototype.decode)return(new TextDecoder()).decode(W.subarray(0,Q));let V,G;const X=new Array(J2);for(G=0,V=0;V<J;){let Y=W[V++];if(Y<128){X[G++]=Y;continue}let q=p1[Y];if(q>4){X[G++]=65533,V+=q-1;continue}Y&=q===2?31:q===3?15:7;while(q>1&&V<J)Y=Y<<6\|W[V++]&63,q--;if(q>1){X[G++]=65533;continue}if(Y<65536)X[G++]=Y;else Y-=65536,X[G++]=55296\|Y>>10&1023,X[G++]=56320\|Y&1023}return x9(X,G)},N9=(W,Q)=>{if(Q=Q\|\|W.length,Q>W.length)Q=W.length;let J=Q-1;while(J>=0&&(W[J]&192)===128)J--;if(J<0)return Q;if(J===0)return Q;return J+p1[W[J]]>Q?J:Q},f1={string2buf:O9,buf2string:w9,utf8border:N9},U7=S9,P7=Object.prototype.toString,{Z_NO_FLUSH:v9,Z_SYNC_FLUSH:A9,Z_FULL_FLUSH:T9,Z_FINISH:g9,Z_OK:K8,Z_STREAM_END:E9,Z_DEFAULT_COMPRESSION:y9,Z_DEFAULT_STRATEGY:p9,Z_DEFLATED:f9}=r0;m1.prototype.push=function(W,Q){const J=this.strm,V=this.options.chunkSize;let G,X;if(this.ended)return!1;if(Q===~~Q)X=Q;else X=Q===!0?g9:v9;if(typeof W==="string")J.input=f1.string2buf(W);else if(P7.call(W)==="[object ArrayBuffer]")J.input=new Uint8Array(W);else J.input=W;J.next_in=0,J.avail_in=J.input.length;for(;;){if(J.avail_out===0)J.output=new Uint8Array(V),J.next_out=0,J.avail_out=V;if((X===A9\|\|X===T9)&&J.avail_out<=6){this.onData(J.output.subarray(0,J.next_out)),J.avail_out=0;continue}if(G=S1.deflate(J,X),G===E9){if(J.next_out>0)this.onData(J.output.subarray(0,J.next_out));return G=S1.deflateEnd(this.strm),this.onEnd(G),this.ended=!0,G===K8}if(J.avail_out===0){this.onData(J.output);continue}if(X>0&&J.next_out>0){this.onData(J.output.subarray(0,J.next_out)),J.avail_out=0;continue}if(J.avail_in===0)break}return!0};m1.prototype.onData=function(W){this.chunks.push(W)};m1.prototype.onEnd=function(W){if(W===K8)this.result=Z8.flattenChunks(this.chunks);this.chunks=[],this.err=W,this.msg=this.strm.msg};var u9=m1,m9=Z6,_9=b9,c9=h9,d9=r0,i9={Deflate:u9,deflate:m9,deflateRaw:_9,gzip:c9,constants:d9},G8=16209,l9=16191,r9=function W(Q,J){let V,G,X,Y,q,F,U,K,$,P,z,C,S,T,p,f,u,w,c,i,D,R,N,Z;const H=Q.state;V=Q.next_in,N=Q.input,G=V+(Q.avail_in-5),X=Q.next_out,Z=Q.output,Y=X-(J-Q.avail_out),q=X+(Q.avail_out-257),F=H.dmax,U=H.wsize,K=H.whave,$=H.wnext,P=H.window,z=H.hold,C=H.bits,S=H.lencode,T=H.distcode,p=(1<<H.lenbits)-1,f=(1<<H.distbits)-1;W:do{if(C<15)z+=N[V++]<<C,C+=8,z+=N[V++]<<C,C+=8;u=S[z&p];J:for(;;){if(w=u>>>24,z>>>=w,C-=w,w=u>>>16&255,w===0)Z[X++]=u&65535;else if(w&16){if(c=u&65535,w&=15,w){if(C<w)z+=N[V++]<<C,C+=8;c+=z&(1<<w)-1,z>>>=w,C-=w}if(C<15)z+=N[V++]<<C,C+=8,z+=N[V++]<<C,C+=8;u=T[z&f];Q:for(;;){if(w=u>>>24,z>>>=w,C-=w,w=u>>>16&255,w&16){if(i=u&65535,w&=15,C<w){if(z+=N[V++]<<C,C+=8,C<w)z+=N[V++]<<C,C+=8}if(i+=z&(1<<w)-1,i>F){Q.msg="invalid distance too far back",H.mode=G8;break W}if(z>>>=w,C-=w,w=X-Y,i>w){if(w=i-w,w>K){if(H.sane){Q.msg="invalid distance too far back",H.mode=G8;break W}}if(D=0,R=P,$===0){if(D+=U-w,w<c){c-=w;do Z[X++]=P[D++];while(--w);D=X-i,R=Z}}else if($<w){if(D+=U+$-w,w-=$,w<c){c-=w;do Z[X++]=P[D++];while(--w);if(D=0,$<c){w=$,c-=w;do Z[X++]=P[D++];while(--w);D=X-i,R=Z}}}else if(D+=$-w,w<c){c-=w;do Z[X++]=P[D++];while(--w);D=X-i,R=Z}while(c>2)Z[X++]=R[D++],Z[X++]=R[D++],Z[X++]=R[D++],c-=3;if(c){if(Z[X++]=R[D++],c>1)Z[X++]=R[D++]}}else{D=X-i;do Z[X++]=Z[D++],Z[X++]=Z[D++],Z[X++]=Z[D++],c-=3;while(c>2);if(c){if(Z[X++]=Z[D++],c>1)Z[X++]=Z[D++]}}}else if((w&64)===0){u=T[(u&65535)+(z&(1<<w)-1)];continue Q}else{Q.msg="invalid distance code",H.mode=G8;break W}break}}else if((w&64)===0){u=S[(u&65535)+(z&(1<<w)-1)];continue J}else if(w&32){H.mode=l9;break W}else{Q.msg="invalid literal/length code",H.mode=G8;break W}break}}while(V<G&&X<q);c=C>>3,V-=c,C-=c<<3,z&=(1<<C)-1,Q.next_in=V,Q.next_out=X,Q.avail_in=V<G?5+(G-V):5-(V-G),Q.avail_out=X<q?257+(q-X):257-(X-q),H.hold=z,H.bits=C;return},G1=15,F5=852,z5=592,Z5=0,i8=1,H5=2,n9=new Uint16Array([3,4,5,6,7,8,9,10,11,13,15,17,19,23,27,31,35,43,51,59,67,83,99,115,131,163,195,227,258,0,0]),o9=new Uint8Array([16,16,16,16,16,16,16,16,17,17,17,17,18,18,18,18,19,19,19,19,20,20,20,20,21,21,21,21,16,72,78]),a9=new Uint16Array([1,2,3,4,5,7,9,13,17,25,33,49,65,97,129,193,257,385,513,769,1025,1537,2049,3073,4097,6145,8193,12289,16385,24577,0,0]),s9=new Uint8Array([16,16,16,16,17,17,18,18,19,19,20,20,21,21,22,22,23,23,24,24,25,25,26,26,27,27,28,28,29,29,64,64]),e9=(W,Q,J,V,G,X,Y,q)=>{const F=q.bits;let U=0,K=0,$=0,P=0,z=0,C=0,S=0,T=0,p=0,f=0,u,w,c,i,D,R=null,N;const Z=new Uint16Array(G1+1),H=new Uint16Array(G1+1);let M=null,k,j,O;for(U=0;U<=G1;U++)Z[U]=0;for(K=0;K<V;K++)Z[Q[J+K]]++;z=F;for(P=G1;P>=1;P--)if(Z[P]!==0)break;if(z>P)z=P;if(P===0)return G[X++]=1<<24\|64<<16\|0,G[X++]=1<<24\|64<<16\|0,q.bits=1,0;for($=1;$<P;$++)if(Z[$]!==0)break;if(z<$)z=$;T=1;for(U=1;U<=G1;U++)if(T<<=1,T-=Z[U],T<0)return-1;if(T>0&&(W===Z5\|\|P!==1))return-1;H[1]=0;for(U=1;U<G1;U++)H[U+1]=H[U]+Z[U];for(K=0;K<V;K++)if(Q[J+K]!==0)Y[H[Q[J+K]]++]=K;if(W===Z5)R=M=Y,N=20;else if(W===i8)R=n9,M=o9,N=257;else R=a9,M=s9,N=0;if(f=0,K=0,U=$,D=X,C=z,S=0,c=-1,p=1<<z,i=p-1,W===i8&&p>F5\|\|W===H5&&p>z5)return 1;for(;;){if(k=U-S,Y[K]+1<N)j=0,O=Y[K];else if(Y[K]>=N)j=M[Y[K]-N],O=R[Y[K]-N];else j=96,O=0;u=1<<U-S,w=1<<C,$=w;do w-=u,G[D+(f>>S)+w]=k<<24\|j<<16\|O\|0;while(w!==0);u=1<<U-1;while(f&u)u>>=1;if(u!==0)f&=u-1,f+=u;else f=0;if(K++,--Z[U]===0){if(U===P)break;U=Q[J+Y[K]]}if(U>z&&(f&i)!==c){if(S===0)S=z;D+=$,C=U-S,T=1<<C;while(C+S<P){if(T-=Z[C+S],T<=0)break;C++,T<<=1}if(p+=1<<C,W===i8&&p>F5\|\|W===H5&&p>z5)return 1;c=f&i,G[c]=z<<24\|C<<16\|D-X\|0}}if(f!==0)G[D+f]=U-S<<24\|64<<16\|0;return q.bits=z,0},v1=e9,t9=0,K7=1,F7=2,{Z_FINISH:k5,Z_BLOCK:WQ,Z_TREES:X8,Z_OK:l0,Z_STREAM_END:JQ,Z_NEED_DICT:QQ,Z_STREAM_ERROR:$0,Z_DATA_ERROR:z7,Z_MEM_ERROR:Z7,Z_BUF_ERROR:VQ,Z_DEFLATED:$5}=r0,H8=16180,C5=16181,j5=16182,B5=16183,M5=16184,R5=16185,L5=16186,I5=16187,D5=16188,O5=16189,F8=16190,x0=16191,l8=16192,x5=16193,r8=16194,w5=16195,N5=16196,S5=16197,v5=16198,Y8=16199,q8=16200,A5=16201,T5=16202,g5=16203,E5=16204,y5=16205,n8=16206,p5=16207,f5=16208,t=16209,H7=16210,k7=16211,GQ=852,XQ=592,YQ=15,qQ=YQ,b5=(W)=>{return(W>>>24&255)+(W>>>8&65280)+((W&65280)<<8)+((W&255)<<24)},n0=(W)=>{if(!W)return 1;const Q=W.state;if(!Q\|\|Q.strm!==W\|\|Q.mode<H8\|\|Q.mode>k7)return 1;return 0},$7=(W)=>{if(n0(W))return $0;const Q=W.state;if(W.total_in=W.total_out=Q.total=0,W.msg="",Q.wrap)W.adler=Q.wrap&1;return Q.mode=H8,Q.last=0,Q.havedict=0,Q.flags=-1,Q.dmax=32768,Q.head=null,Q.hold=0,Q.bits=0,Q.lencode=Q.lendyn=new Int32Array(GQ),Q.distcode=Q.distdyn=new Int32Array(XQ),Q.sane=1,Q.back=-1,l0},C7=(W)=>{if(n0(W))return $0;const Q=W.state;return Q.wsize=0,Q.whave=0,Q.wnext=0,$7(W)},j7=(W,Q)=>{let J;if(n0(W))return $0;const V=W.state;if(Q<0)J=0,Q=-Q;else if(J=(Q>>4)+5,Q<48)Q&=15;if(Q&&(Q<8\|\|Q>15))return $0;if(V.window!==null&&V.wbits!==Q)V.window=null;return V.wrap=J,V.wbits=Q,C7(W)},B7=(W,Q)=>{if(!W)return $0;const J=new UQ;W.state=J,J.strm=W,J.window=null,J.mode=H8;const V=j7(W,Q);if(V!==l0)W.state=null;return V},PQ=(W)=>{return B7(W,qQ)},h5=!0,o8,a8,KQ=(W)=>{if(h5){o8=new Int32Array(512),a8=new Int32Array(32);let Q=0;while(Q<144)W.lens[Q++]=8;while(Q<256)W.lens[Q++]=9;while(Q<280)W.lens[Q++]=7;while(Q<288)W.lens[Q++]=8;v1(K7,W.lens,0,288,o8,0,W.work,{bits:9}),Q=0;while(Q<32)W.lens[Q++]=5;v1(F7,W.lens,0,32,a8,0,W.work,{bits:5}),h5=!1}W.lencode=o8,W.lenbits=9,W.distcode=a8,W.distbits=5},M7=(W,Q,J,V)=>{let G;const X=W.state;if(X.window===null)X.wsize=1<<X.wbits,X.wnext=0,X.whave=0,X.window=new Uint8Array(X.wsize);if(V>=X.wsize)X.window.set(Q.subarray(J-X.wsize,J),0),X.wnext=0,X.whave=X.wsize;else{if(G=X.wsize-X.wnext,G>V)G=V;if(X.window.set(Q.subarray(J-V,J-V+G),X.wnext),V-=G,V)X.window.set(Q.subarray(J-V,J),0),X.wnext=V,X.whave=X.wsize;else{if(X.wnext+=G,X.wnext===X.wsize)X.wnext=0;if(X.whave<X.wsize)X.whave+=G}}return 0},FQ=(W,Q)=>{let J,V,G,X,Y,q,F,U,K,$,P,z,C,S,T=0,p,f,u,w,c,i,D,R;const N=new Uint8Array(4);let Z,H;const M=new Uint8Array([16,17,18,0,8,7,9,6,10,5,11,4,12,3,13,2,14,1,15]);if(n0(W)\|\|!W.output\|\|!W.input&&W.avail_in!==0)return $0;if(J=W.state,J.mode===x0)J.mode=l8;Y=W.next_out,G=W.output,F=W.avail_out,X=W.next_in,V=W.input,q=W.avail_in,U=J.hold,K=J.bits,$=q,P=F,R=l0;W:for(;;)switch(J.mode){case H8:if(J.wrap===0){J.mode=l8;break}while(K<16){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.wrap&2&&U===35615){if(J.wbits===0)J.wbits=15;J.check=0,N[0]=U&255,N[1]=U>>>8&255,J.check=V0(J.check,N,2,0),U=0,K=0,J.mode=C5;break}if(J.head)J.head.done=!1;if(!(J.wrap&1)\|\|(((U&255)<<8)+(U>>8))%31){W.msg="incorrect header check",J.mode=t;break}if((U&15)!==$5){W.msg="unknown compression method",J.mode=t;break}if(U>>>=4,K-=4,D=(U&15)+8,J.wbits===0)J.wbits=D;if(D>15\|\|D>J.wbits){W.msg="invalid window size",J.mode=t;break}J.dmax=1<<J.wbits,J.flags=0,W.adler=J.check=1,J.mode=U&512?O5:x0,U=0,K=0;break;case C5:while(K<16){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.flags=U,(J.flags&255)!==$5){W.msg="unknown compression method",J.mode=t;break}if(J.flags&57344){W.msg="unknown header flags set",J.mode=t;break}if(J.head)J.head.text=U>>8&1;if(J.flags&512&&J.wrap&4)N[0]=U&255,N[1]=U>>>8&255,J.check=V0(J.check,N,2,0);U=0,K=0,J.mode=j5;case j5:while(K<32){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.head)J.head.time=U;if(J.flags&512&&J.wrap&4)N[0]=U&255,N[1]=U>>>8&255,N[2]=U>>>16&255,N[3]=U>>>24&255,J.check=V0(J.check,N,4,0);U=0,K=0,J.mode=B5;case B5:while(K<16){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.head)J.head.xflags=U&255,J.head.os=U>>8;if(J.flags&512&&J.wrap&4)N[0]=U&255,N[1]=U>>>8&255,J.check=V0(J.check,N,2,0);U=0,K=0,J.mode=M5;case M5:if(J.flags&1024){while(K<16){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.length=U,J.head)J.head.extra_len=U;if(J.flags&512&&J.wrap&4)N[0]=U&255,N[1]=U>>>8&255,J.check=V0(J.check,N,2,0);U=0,K=0}else if(J.head)J.head.extra=null;J.mode=R5;case R5:if(J.flags&1024){if(z=J.length,z>q)z=q;if(z){if(J.head){if(D=J.head.extra_len-J.length,!J.head.extra)J.head.extra=new Uint8Array(J.head.extra_len);J.head.extra.set(V.subarray(X,X+z),D)}if(J.flags&512&&J.wrap&4)J.check=V0(J.check,V,z,X);q-=z,X+=z,J.length-=z}if(J.length)break W}J.length=0,J.mode=L5;case L5:if(J.flags&2048){if(q===0)break W;z=0;do if(D=V[X+z++],J.head&&D&&J.length<65536)J.head.name+=String.fromCharCode(D);while(D&&z<q);if(J.flags&512&&J.wrap&4)J.check=V0(J.check,V,z,X);if(q-=z,X+=z,D)break W}else if(J.head)J.head.name=null;J.length=0,J.mode=I5;case I5:if(J.flags&4096){if(q===0)break W;z=0;do if(D=V[X+z++],J.head&&D&&J.length<65536)J.head.comment+=String.fromCharCode(D);while(D&&z<q);if(J.flags&512&&J.wrap&4)J.check=V0(J.check,V,z,X);if(q-=z,X+=z,D)break W}else if(J.head)J.head.comment=null;J.mode=D5;case D5:if(J.flags&512){while(K<16){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.wrap&4&&U!==(J.check&65535)){W.msg="header crc mismatch",J.mode=t;break}U=0,K=0}if(J.head)J.head.hcrc=J.flags>>9&1,J.head.done=!0;W.adler=J.check=0,J.mode=x0;break;case O5:while(K<32){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}W.adler=J.check=b5(U),U=0,K=0,J.mode=F8;case F8:if(J.havedict===0)return W.next_out=Y,W.avail_out=F,W.next_in=X,W.avail_in=q,J.hold=U,J.bits=K,QQ;W.adler=J.check=1,J.mode=x0;case x0:if(Q===WQ\|\|Q===X8)break W;case l8:if(J.last){U>>>=K&7,K-=K&7,J.mode=n8;break}while(K<3){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}switch(J.last=U&1,U>>>=1,K-=1,U&3){case 0:J.mode=x5;break;case 1:if(KQ(J),J.mode=Y8,Q===X8){U>>>=2,K-=2;break W}break;case 2:J.mode=N5;break;case 3:W.msg="invalid block type",J.mode=t}U>>>=2,K-=2;break;case x5:U>>>=K&7,K-=K&7;while(K<32){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if((U&65535)!==(U>>>16^65535)){W.msg="invalid stored block lengths",J.mode=t;break}if(J.length=U&65535,U=0,K=0,J.mode=r8,Q===X8)break W;case r8:J.mode=w5;case w5:if(z=J.length,z){if(z>q)z=q;if(z>F)z=F;if(z===0)break W;G.set(V.subarray(X,X+z),Y),q-=z,X+=z,F-=z,Y+=z,J.length-=z;break}J.mode=x0;break;case N5:while(K<14){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.nlen=(U&31)+257,U>>>=5,K-=5,J.ndist=(U&31)+1,U>>>=5,K-=5,J.ncode=(U&15)+4,U>>>=4,K-=4,J.nlen>286\|\|J.ndist>30){W.msg="too many length or distance symbols",J.mode=t;break}J.have=0,J.mode=S5;case S5:while(J.have<J.ncode){while(K<3){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}J.lens[M[J.have++]]=U&7,U>>>=3,K-=3}while(J.have<19)J.lens[M[J.have++]]=0;if(J.lencode=J.lendyn,J.lenbits=7,Z={bits:J.lenbits},R=v1(t9,J.lens,0,19,J.lencode,0,J.work,Z),J.lenbits=Z.bits,R){W.msg="invalid code lengths set",J.mode=t;break}J.have=0,J.mode=v5;case v5:while(J.have<J.nlen+J.ndist){for(;;){if(T=J.lencode[U&(1<<J.lenbits)-1],p=T>>>24,f=T>>>16&255,u=T&65535,p<=K)break;if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(u<16)U>>>=p,K-=p,J.lens[J.have++]=u;else{if(u===16){H=p+2;while(K<H){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(U>>>=p,K-=p,J.have===0){W.msg="invalid bit length repeat",J.mode=t;break}D=J.lens[J.have-1],z=3+(U&3),U>>>=2,K-=2}else if(u===17){H=p+3;while(K<H){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}U>>>=p,K-=p,D=0,z=3+(U&7),U>>>=3,K-=3}else{H=p+7;while(K<H){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}U>>>=p,K-=p,D=0,z=11+(U&127),U>>>=7,K-=7}if(J.have+z>J.nlen+J.ndist){W.msg="invalid bit length repeat",J.mode=t;break}while(z--)J.lens[J.have++]=D}}if(J.mode===t)break;if(J.lens[256]===0){W.msg="invalid code -- missing end-of-block",J.mode=t;break}if(J.lenbits=9,Z={bits:J.lenbits},R=v1(K7,J.lens,0,J.nlen,J.lencode,0,J.work,Z),J.lenbits=Z.bits,R){W.msg="invalid literal/lengths set",J.mode=t;break}if(J.distbits=6,J.distcode=J.distdyn,Z={bits:J.distbits},R=v1(F7,J.lens,J.nlen,J.ndist,J.distcode,0,J.work,Z),J.distbits=Z.bits,R){W.msg="invalid distances set",J.mode=t;break}if(J.mode=Y8,Q===X8)break W;case Y8:J.mode=q8;case q8:if(q>=6&&F>=258){if(W.next_out=Y,W.avail_out=F,W.next_in=X,W.avail_in=q,J.hold=U,J.bits=K,r9(W,P),Y=W.next_out,G=W.output,F=W.avail_out,X=W.next_in,V=W.input,q=W.avail_in,U=J.hold,K=J.bits,J.mode===x0)J.back=-1;break}J.back=0;for(;;){if(T=J.lencode[U&(1<<J.lenbits)-1],p=T>>>24,f=T>>>16&255,u=T&65535,p<=K)break;if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(f&&(f&240)===0){w=p,c=f,i=u;for(;;){if(T=J.lencode[i+((U&(1<<w+c)-1)>>w)],p=T>>>24,f=T>>>16&255,u=T&65535,w+p<=K)break;if(q===0)break W;q--,U+=V[X++]<<K,K+=8}U>>>=w,K-=w,J.back+=w}if(U>>>=p,K-=p,J.back+=p,J.length=u,f===0){J.mode=y5;break}if(f&32){J.back=-1,J.mode=x0;break}if(f&64){W.msg="invalid literal/length code",J.mode=t;break}J.extra=f&15,J.mode=A5;case A5:if(J.extra){H=J.extra;while(K<H){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}J.length+=U&(1<<J.extra)-1,U>>>=J.extra,K-=J.extra,J.back+=J.extra}J.was=J.length,J.mode=T5;case T5:for(;;){if(T=J.distcode[U&(1<<J.distbits)-1],p=T>>>24,f=T>>>16&255,u=T&65535,p<=K)break;if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if((f&240)===0){w=p,c=f,i=u;for(;;){if(T=J.distcode[i+((U&(1<<w+c)-1)>>w)],p=T>>>24,f=T>>>16&255,u=T&65535,w+p<=K)break;if(q===0)break W;q--,U+=V[X++]<<K,K+=8}U>>>=w,K-=w,J.back+=w}if(U>>>=p,K-=p,J.back+=p,f&64){W.msg="invalid distance code",J.mode=t;break}J.offset=u,J.extra=f&15,J.mode=g5;case g5:if(J.extra){H=J.extra;while(K<H){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}J.offset+=U&(1<<J.extra)-1,U>>>=J.extra,K-=J.extra,J.back+=J.extra}if(J.offset>J.dmax){W.msg="invalid distance too far back",J.mode=t;break}J.mode=E5;case E5:if(F===0)break W;if(z=P-F,J.offset>z){if(z=J.offset-z,z>J.whave){if(J.sane){W.msg="invalid distance too far back",J.mode=t;break}}if(z>J.wnext)z-=J.wnext,C=J.wsize-z;else C=J.wnext-z;if(z>J.length)z=J.length;S=J.window}else S=G,C=Y-J.offset,z=J.length;if(z>F)z=F;F-=z,J.length-=z;do G[Y++]=S[C++];while(--z);if(J.length===0)J.mode=q8;break;case y5:if(F===0)break W;G[Y++]=J.length,F--,J.mode=q8;break;case n8:if(J.wrap){while(K<32){if(q===0)break W;q--,U\|=V[X++]<<K,K+=8}if(P-=F,W.total_out+=P,J.total+=P,J.wrap&4&&P)W.adler=J.check=J.flags?V0(J.check,G,P,Y-P):y1(J.check,G,P,Y-P);if(P=F,J.wrap&4&&(J.flags?U:b5(U))!==J.check){W.msg="incorrect data check",J.mode=t;break}U=0,K=0}J.mode=p5;case p5:if(J.wrap&&J.flags){while(K<32){if(q===0)break W;q--,U+=V[X++]<<K,K+=8}if(J.wrap&4&&U!==(J.total&4294967295)){W.msg="incorrect length check",J.mode=t;break}U=0,K=0}J.mode=f5;case f5:R=JQ;break W;case t:R=z7;break W;case H7:return Z7;case k7:default:return $0}if(W.next_out=Y,W.avail_out=F,W.next_in=X,W.avail_in=q,J.hold=U,J.bits=K,J.wsize\|\|P!==W.avail_out&&J.mode<t&&(J.mode<n8\|\|Q!==k5)){if(M7(W,W.output,W.next_out,P-W.avail_out));}if($-=W.avail_in,P-=W.avail_out,W.total_in+=$,W.total_out+=P,J.total+=P,J.wrap&4&&P)W.adler=J.check=J.flags?V0(J.check,G,P,W.next_out-P):y1(J.check,G,P,W.next_out-P);if(W.data_type=J.bits+(J.last?64:0)+(J.mode===x0?128:0)+(J.mode===Y8\|\|J.mode===r8?256:0),($===0&&P===0\|\|Q===k5)&&R===l0)R=VQ;return R},zQ=(W)=>{if(n0(W))return $0;let Q=W.state;if(Q.window)Q.window=null;return W.state=null,l0},ZQ=(W,Q)=>{if(n0(W))return $0;const J=W.state;if((J.wrap&2)===0)return $0;return J.head=Q,Q.done=!1,l0},HQ=(W,Q)=>{const J=Q.length;let V,G,X;if(n0(W))return $0;if(V=W.state,V.wrap!==0&&V.mode!==F8)return $0;if(V.mode===F8){if(G=1,G=y1(G,Q,J,0),G!==V.check)return z7}if(X=M7(W,Q,J,J),X)return V.mode=H7,Z7;return V.havedict=1,l0},kQ=C7,$Q=j7,CQ=$7,jQ=PQ,BQ=B7,MQ=FQ,RQ=zQ,LQ=ZQ,IQ=HQ,DQ="pako inflate (from Nodeca project)",N0={inflateReset:kQ,inflateReset2:$Q,inflateResetKeep:CQ,inflateInit:jQ,inflateInit2:BQ,inflate:MQ,inflateEnd:RQ,inflateGetHeader:LQ,inflateSetDictionary:IQ,inflateInfo:DQ},xQ=OQ,R7=Object.prototype.toString,{Z_NO_FLUSH:wQ,Z_FINISH:NQ,Z_OK:b1,Z_STREAM_END:s8,Z_NEED_DICT:e8,Z_STREAM_ERROR:SQ,Z_DATA_ERROR:u5,Z_MEM_ERROR:vQ}=r0;_1.prototype.push=function(W,Q){const J=this.strm,V=this.options.chunkSize,G=this.options.dictionary;let X,Y,q;if(this.ended)return!1;if(Q===~~Q)Y=Q;else Y=Q===!0?NQ:wQ;if(R7.call(W)==="[object ArrayBuffer]")J.input=new Uint8Array(W);else J.input=W;J.next_in=0,J.avail_in=J.input.length;for(;;){if(J.avail_out===0)J.output=new Uint8Array(V),J.next_out=0,J.avail_out=V;if(X=N0.inflate(J,Y),X===e8&&G){if(X=N0.inflateSetDictionary(J,G),X===b1)X=N0.inflate(J,Y);else if(X===u5)X=e8}while(J.avail_in>0&&X===s8&&J.state.wrap>0&&W[J.next_in]!==0)N0.inflateReset(J),X=N0.inflate(J,Y);switch(X){case SQ:case u5:case e8:case vQ:return this.onEnd(X),this.ended=!0,!1}if(q=J.avail_out,J.next_out){if(J.avail_out===0\|\|X===s8)if(this.options.to==="string"){let F=f1.utf8border(J.output,J.next_out),U=J.next_out-F,K=f1.buf2string(J.output,F);if(J.next_out=U,J.avail_out=V-U,U)J.output.set(J.output.subarray(F,F+U),0);this.onData(K)}else this.onData(J.output.length===J.next_out?J.output:J.output.subarray(0,J.next_out))}if(X===b1&&q===0)continue;if(X===s8)return X=N0.inflateEnd(this.strm),this.onEnd(X),this.ended=!0,!0;if(J.avail_in===0)break}return!0};_1.prototype.onData=function(W){this.chunks.push(W)};_1.prototype.onEnd=function(W){if(W===b1)if(this.options.to==="string")this.result=this.chunks.join("");else this.result=Z8.flattenChunks(this.chunks);this.chunks=[],this.err=W,this.msg=this.strm.msg};var TQ=_1,gQ=H6,EQ=AQ,yQ=H6,pQ=r0,fQ={Inflate:TQ,inflate:gQ,inflateRaw:EQ,ungzip:yQ,constants:pQ},{Deflate:bQ,deflate:hQ,deflateRaw:uQ,gzip:mQ}=i9,{Inflate:_Q,inflate:cQ,inflateRaw:dQ,ungzip:iQ}=fQ,lQ=bQ,rQ=hQ,nQ=uQ,oQ=mQ,aQ=_Q,sQ=cQ,eQ=dQ,tQ=iQ,WV=r0,c1={Deflate:lQ,deflate:rQ,deflateRaw:nQ,gzip:oQ,Inflate:aQ,inflate:sQ,inflateRaw:eQ,ungzip:tQ,constants:WV};var v8=function(W){return W instanceof Uint8Array\|\|ArrayBuffer.isView(W)&&W.constructor.name==="Uint8Array"},D6=function(W){if(!Number.isSafeInteger(W)\|\|W<0)throw Error("positive integer expected, got "+W)},W1=function(W,...Q){if(!v8(W))throw Error("Uint8Array expected");if(Q.length>0&&!Q.includes(W.length))throw Error("Uint8Array expected of length "+Q+", got length="+W.length)},d7=function(W){if(typeof W!="function"\|\|typeof W.create!="function")throw Error("Hash should be wrapped by utils.createHasher");D6(W.outputLen),D6(W.blockLen)},R8=function(W,Q=!0){if(W.destroyed)throw Error("Hash instance has been destroyed");if(Q&&W.finished)throw Error("Hash#digest() has already been called")},L8=function(...W){for(let Q=0;Q<W.length;Q++)W[Q].fill(0)},k6=function(W){return new DataView(W.buffer,W.byteOffset,W.byteLength)},I0=function(W,Q){return W<<32-Q\|W>>>Q},$1=function(W){if(W1(W),i7)return W.toHex();let Q="";for(let J=0;J<W.length;J++)Q+=JV[W[J]];return Q},O7=function(W){return W>=L7&&W<=QV?W-L7:W>=I7&&W<=VV?W-(I7-10):W>=D7&&W<=GV?W-(D7-10):void 0},I8=function(W){if(typeof W!="string")throw Error("hex string expected, got "+typeof W);if(i7)return Uint8Array.fromHex(W);const Q=W.length,J=Q/2;if(Q%2)throw Error("hex string expected, got unpadded hex of length "+Q);const V=new Uint8Array(J);for(let G=0,X=0;G<J;G++,X+=2){const Y=O7(W.charCodeAt(X)),q=O7(W.charCodeAt(X+1));if(Y===void 0\|\|q===void 0){const F=W[X]+W[X+1];throw Error('hex string expected, got non-hex character "'+F+'" at index '+X)}V[G]=16Y+q}return V},l7=function(W){if(typeof W!="string")throw Error("string expected");return new Uint8Array((new TextEncoder()).encode(W))},g6=function(W){return typeof W=="string"&&(W=l7(W)),W1(W),W},D0=function(...W){let Q=0;for(let V=0;V<W.length;V++){const G=W[V];W1(G),Q+=G.length}const J=new Uint8Array(Q);for(let V=0,G=0;V<W.length;V++){const X=W[V];J.set(X,G),G+=X.length}return J},XV=function(W){const Q=(V)=>W().update(g6(V)).digest(),J=W();return Q.outputLen=J.outputLen,Q.blockLen=J.blockLen,Q.create=()=>W(),Q},D8=function(W=32){if(F1&&typeof F1.getRandomValues=="function")return F1.getRandomValues(new Uint8Array(W));if(F1&&typeof F1.randomBytes=="function")return Uint8Array.from(F1.randomBytes(W));throw Error("crypto.getRandomValues must be defined")},YV=function(W,Q,J){return W&Q^W&J^Q&J},O8=function(W,Q=""){if(typeof W!="boolean")throw Error((Q&&`"${Q}"`)+"expected boolean, got type="+typeof W);return W},o0=function(W,Q,J=""){const V=v8(W),G=W?.length,X=Q!==void 0;if(!V\|\|X&&G!==Q)throw Error((J&&`"${J}" `)+"expected Uint8Array"+(X?" of length "+Q:"")+", got "+(V?"length="+G:"type="+typeof W));return W},k8=function(W){const Q=W.toString(16);return 1&Q.length?"0"+Q:Q},a7=function(W){if(typeof W!="string")throw Error("hex string expected, got "+typeof W);return W===""?p6:BigInt("0x"+W)},B1=function(W){return a7($1(W))},s7=function(W){return W1(W),a7($1(Uint8Array.from(W).reverse()))},A8=function(W,Q){return I8(W.toString(16).padStart(2Q,"0"))},e7=function(W,Q){return A8(W,Q).reverse()},Q0=function(W,Q,J){let V;if(typeof Q=="string")try{V=I8(Q)}catch(X){throw Error(W+" must be hex string or Uint8Array, cause: "+X)}else{if(!v8(Q))throw Error(W+" must be hex string or Uint8Array");V=Uint8Array.from(Q)}const G=V.length;if(typeof J=="number"&&G!==J)throw Error(W+" of length "+J+" expected, got "+G);return V},w6=function(W,Q,J){return $6(W)&&$6(Q)&&$6(J)&&Q<=W&&W<J},t7=function(W){let Q;for(Q=0;W>p6;W>>=x6,Q+=1);return Q},f6=function(W,Q,J={}){if(!W\|\|typeof W!="object")throw Error("expected valid options object");function V(G,X,Y){const q=W[G];if(Y&&q===void 0)return;const F=typeof q;if(F!==X\|\|q===null)throw Error(`param "${G}" is invalid: expected ${X}, got ${F}`)}Object.entries(Q).forEach(([G,X])=>V(G,X,!1)),Object.entries(J).forEach(([G,X])=>V(G,X,!0))},x7=function(W){const Q=new WeakMap;return(J,...V)=>{const G=Q.get(J);if(G!==void 0)return G;const X=W(J,...V);return Q.set(J,X),X}},j0=function(W,Q){const J=W%Q;return J>=K0?J:Q+J},C0=function(W,Q,J){let V=W;for(;Q-- >K0;)V=V,V%=J;return V},N7=function(W,Q){if(W===K0)throw Error("invert: expected non-zero number");if(Q<=K0)throw Error("invert: expected positive modulus, got "+Q);let J=j0(W,Q),V=Q,G=K0,X=U0;for(;J!==K0;){const Y=V%J,q=G-X(V/J);V=J,J=Y,G=X,X=q}if(V!==U0)throw Error("invert: does not exist");return j0(G,Q)},b6=function(W,Q,J){if(!W.eql(W.sqr(Q),J))throw Error("Cannot find square root")},GW=function(W,Q){const J=(W.ORDER+U0)/JW,V=W.pow(Q,J);return b6(W,V,Q),V},KV=function(W,Q){const J=(W.ORDER-QW)/VW,V=W.mul(Q,s0),G=W.pow(V,J),X=W.mul(Q,G),Y=W.mul(W.mul(X,s0),G),q=W.mul(X,W.sub(Y,W.ONE));return b6(W,q,Q),q},S7=function(W){if(W<WW)throw Error("sqrt is not defined for small field");let Q=W-U0,J=0;for(;Q%s0===K0;)Q/=s0,J++;let V=s0;const G=o1(W);for(;v7(G,V)===1;)if(V++>1000)throw Error("Cannot find square root: probably non-prime P");if(J===1)return GW;let X=G.pow(V,Q);const Y=(Q+U0)/s0;return function(q,F){if(q.is0(F))return F;if(v7(q,F)!==1)throw Error("Cannot find square root");let U=J,K=q.mul(q.ONE,X),$=q.pow(F,Q),P=q.pow(F,Y);for(;!q.eql($,q.ONE);){if(q.is0($))return q.ZERO;let z=1,C=q.sqr($);for(;!q.eql(C,q.ONE);)if(z++,C=q.sqr(C),z===U)throw Error("Cannot find square root");const S=U0<<BigInt(U-z-1),T=q.pow(K,S);U=z,K=q.sqr(T),$=q.mul($,K),P=q.mul(P,T)}return P}},FV=function(W){return W%JW===WW?GW:W%VW===QW?KV:W%w7===PV?function(Q){const J=o1(Q),V=S7(Q),G=V(J,J.neg(J.ONE)),X=V(J,G),Y=V(J,J.neg(G)),q=(Q+UV)/w7;return(F,U)=>{let K=F.pow(U,q),$=F.mul(K,G);const P=F.mul(K,X),z=F.mul(K,Y),C=F.eql(F.sqr($),U),S=F.eql(F.sqr(P),U);K=F.cmov(K,$,C),$=F.cmov(z,P,S);const T=F.eql(F.sqr($),U),p=F.cmov(K,$,T);return b6(F,p,U),p}}(W):S7(W)},XW=function(W,Q,J=!1){const V=Array(Q.length).fill(J?W.ZERO:void 0),G=Q.reduce((Y,q,F)=>W.is0(q)?Y:(V[F]=Y,W.mul(Y,q)),W.ONE),X=W.inv(G);return Q.reduceRight((Y,q,F)=>W.is0(q)?Y:(V[F]=W.mul(Y,V[F]),W.mul(Y,q)),X),V},v7=function(W,Q){const J=(W.ORDER-U0)/s0,V=W.pow(Q,J),G=W.eql(V,W.ONE),X=W.eql(V,W.ZERO),Y=W.eql(V,W.neg(W.ONE));if(!G&&!X&&!Y)throw Error("invalid Legendre symbol result");return G?1:X?0:-1},YW=function(W,Q){Q!==void 0&&D6(Q);const J=Q!==void 0?Q:W.toString(2).length;return{nBitLength:J,nByteLength:Math.ceil(J/8)}},o1=function(W,Q,J=!1,V={}){if(W<=K0)throw Error("invalid field: expected ORDER > 0, got "+W);let G,X,Y,q=!1;if(typeof Q=="object"&&Q!=null){if(V.sqrt\|\|J)throw Error("cannot specify opts in two arguments");const P=Q;P.BITS&&(G=P.BITS),P.sqrt&&(X=P.sqrt),typeof P.isLE=="boolean"&&(J=P.isLE),typeof P.modFromBytes=="boolean"&&(q=P.modFromBytes),Y=P.allowedLengths}else typeof Q=="number"&&(G=Q),V.sqrt&&(X=V.sqrt);const{nBitLength:F,nByteLength:U}=YW(W,G);if(U>2048)throw Error("invalid field: expected ORDER of <= 2048 bytes");let K;const $=Object.freeze({ORDER:W,isLE:J,BITS:F,BYTES:U,MASK:n1(F),ZERO:K0,ONE:U0,allowedLengths:Y,create(P){return j0(P,W)},isValid(P){if(typeof P!="bigint")throw Error("invalid field element: expected bigint, got "+typeof P);return K0<=P&&P<W},is0(P){return P===K0},isValidNot0(P){return!$.is0(P)&&$.isValid(P)},isOdd(P){return(P&U0)===U0},neg(P){return j0(-P,W)},eql(P,z){return P===z},sqr(P){return j0(PP,W)},add(P,z){return j0(P+z,W)},sub(P,z){return j0(P-z,W)},mul(P,z){return j0(Pz,W)},pow(P,z){return function(C,S,T){if(T<K0)throw Error("invalid exponent, negatives unsupported");if(T===K0)return C.ONE;if(T===U0)return S;let p=C.ONE,f=S;for(;T>K0;)T&U0&&(p=C.mul(p,f)),f=C.sqr(f),T>>=U0;return p}($,P,z)},div(P,z){return j0(PN7(z,W),W)},sqrN(P){return PP},addN(P,z){return P+z},subN(P,z){return P-z},mulN(P,z){return Pz},inv(P){return N7(P,W)},sqrt:X\|\|((P)=>(K\|\|(K=FV(W)),K($,P))),toBytes(P){return J?e7(P,U):A8(P,U)},fromBytes(P,z=!0){if(Y){if(!Y.includes(P.length)\|\|P.length>U)throw Error("Field.fromBytes: expected "+Y+" bytes, got "+P.length);const S=new Uint8Array(U);S.set(P,J?0:S.length-P.length),P=S}if(P.length!==U)throw Error("Field.fromBytes: expected "+U+" bytes, got "+P.length);let C=J?s7(P):B1(P);if(q&&(C=j0(C,W)),!z&&!$.isValid(C))throw Error("invalid field element: outside of range 0..ORDER");return C},invertBatch(P){return XW($,P)},cmov(P,z,C){return C?z:P}});return Object.freeze($)},qW=function(W){if(typeof W!="bigint")throw Error("field order must be bigint");const Q=W.toString(2).length;return Math.ceil(Q/8)},UW=function(W){const Q=qW(W);return Q+Math.ceil(Q/2)},PW=function(W,Q,J=!1){const V=W.length,G=qW(Q),X=UW(Q);if(V<16\|\|V<X\|\|V>1024)throw Error("expected "+X+"-1024 bytes of input, got "+V);const Y=j0(J?s7(W):B1(W),Q-U0)+U0;return J?e7(Y,G):A8(Y,G)},x8=function(W,Q){const J=Q.negate();return W?J:Q},C6=function(W,Q){const J=XW(W.Fp,Q.map((V)=>V.Z));return Q.map((V,G)=>W.fromAffine(V.toAffine(J[G])))},KW=function(W,Q){if(!Number.isSafeInteger(W)\|\|W<=0\|\|W>Q)throw Error("invalid window size, expected [1.."+Q+"], got W="+W)},j6=function(W,Q){KW(W,Q);const J=2W;return{windows:Math.ceil(Q/W)+1,windowSize:2(W-1),mask:n1(W),maxNumber:J,shiftBy:BigInt(W)}},A7=function(W,Q,J){const{windowSize:V,mask:G,maxNumber:X,shiftBy:Y}=J;let q=Number(W&G),F=W>>Y;q>V&&(q-=X,F+=e0);const U=QV;return{nextN:F,offset:U+Math.abs(q)-1,isZero:q===0,isNeg:q<0,isNegF:Q%2!=0,offsetF:U}},M6=function(W){return FW.get(W)\|\|1},T7=function(W){if(W!==C1)throw Error("invalid wNAF")},ZV=function(W,Q,J,V){(function(P,z){if(!Array.isArray(P))throw Error("array expected");P.forEach((C,S)=>{if(!(C instanceof z))throw Error("invalid point at index "+S)})})(J,W),function(P,z){if(!Array.isArray(P))throw Error("array of scalars expected");P.forEach((C,S)=>{if(!z.isValid(C))throw Error("invalid scalar at index "+S)})}(V,Q);const G=J.length,X=V.length;if(G!==X)throw Error("arrays of points and scalars must have equal length");const Y=W.ZERO,q=t7(BigInt(G));let F=1;q>12?F=q-3:q>4?F=q-2:q>0&&(F=2);const U=n1(F),K=Array(Number(U)+1).fill(Y);let $=Y;for(let P=Math.floor((Q.BITS-1)/F)F;P>=0;P-=F){K.fill(Y);for(let C=0;C<X;C++){const S=V[C],T=Number(S>>BigInt(P)&U);K[T]=K[T].add(J[C])}let z=Y;for(let C=K.length-1,S=Y;C>0;C--)S=S.add(K[C]),z=z.add(S);if($=$.add(z),P!==0)for(let C=0;C<F;C++)$=$.double()}return $},g7=function(W,Q,J){if(Q){if(Q.ORDER!==W)throw Error("Field.ORDER must match order: Fp == p, Fn == n");return function(V){f6(V,zV.reduce((G,X)=>(G[X]="function",G),{ORDER:"bigint",MASK:"bigint",BYTES:"number",BITS:"number"}))}(Q),Q}return o1(W,{isLE:J})},N6=function(W){if(!["compact","recovered","der"].includes(W))throw Error('Signature format must be "compact", "recovered", or "der"');return W},R6=function(W,Q){const J={};for(let V of Object.keys(Q))J[V]=W[V]===void 0?Q[V]:W[V];return O8(J.lowS,"lowS"),O8(J.prehash,"prehash"),J.format!==void 0&&N6(J.format),J},a0=function(W,Q){const{BYTES:J}=W;let V;if(typeof Q=="bigint")V=Q;else{let G=Q0("private key",Q);try{V=W.fromBytes(G)}catch(X){throw Error(`invalid private key: expected ui8a of size ${J}, got ${typeof Q}`)}}if(!W.isValidNot0(V))throw Error("invalid private key: out of range [1..N-1]");return V},kV=function(W,Q={}){const J=function(Z,H,M={},k){if(k===void 0&&(k=Z==="edwards"),!H\|\|typeof H!="object")throw Error(`expected valid ${Z} CURVE object`);for(let x of["p","n","h"]){const B=H[x];if(!(typeof B=="bigint"&&B>C1))throw Error(`CURVE.${x} must be positive bigint`)}const j=g7(H.p,M.Fp,k),O=g7(H.n,M.Fn,k),L=["Gx","Gy","a","b"];for(let x of L)if(!j.isValid(H[x]))throw Error(`CURVE.${x} must be valid field element of CURVE.Fp`);return{CURVE:H=Object.freeze(Object.assign({},H)),Fp:j,Fn:O}}("weierstrass",W,Q),{Fp:V,Fn:G}=J;let X=J.CURVE;const{h:Y,n:q}=X;f6(Q,{},{allowInfinityPoint:"boolean",clearCofactor:"function",isTorsionFree:"function",fromBytes:"function",toBytes:"function",endo:"object",wrapPrivateKey:"boolean"});const{endo:F}=Q;if(F&&(!V.is0(X.a)\|\|typeof F.beta!="bigint"\|\|!Array.isArray(F.basises)))throw Error('invalid endo: expected "beta": bigint and "basises": array');const U=kW(V,G);function K(){if(!V.isOdd)throw Error("compression is not supported: Field does not have .isOdd()")}const $=Q.toBytes\|\|function(Z,H,M){const{x:k,y:j}=H.toAffine(),O=V.toBytes(k);if(O8(M,"isCompressed"),M)return K(),D0(HW(!V.isOdd(j)),O);return D0(Uint8Array.of(4),O,V.toBytes(j))},P=Q.fromBytes\|\|function(Z){o0(Z,void 0,"Point");const{publicKey:H,publicKeyUncompressed:M}=U,k=Z.length,j=Z[0],O=Z.subarray(1);if(k!==H\|\|j!==2&&j!==3){if(k===M&&j===4){const L=V.BYTES,x=V.fromBytes(O.subarray(0,L)),B=V.fromBytes(O.subarray(L,2L));if(!C(x,B))throw Error("bad point: is not on curve");return{x,y:B}}throw Error(`bad point: got length ${k}, expected compressed=${H} or uncompressed=${M}`)}{const L=V.fromBytes(O);if(!V.isValid(L))throw Error("bad point: is not on curve, wrong x");const x=z(L);let B;try{B=V.sqrt(x)}catch(v){const b=v instanceof Error?": "+v.message:"";throw Error("bad point: is not on curve, sqrt error"+b)}return K(),!(1&~j)!==V.isOdd(B)&&(B=V.neg(B)),{x:L,y:B}}};function z(Z){const H=V.sqr(Z),M=V.mul(H,Z);return V.add(V.add(M,V.mul(Z,X.a)),X.b)}function C(Z,H){const M=V.sqr(H),k=z(Z);return V.eql(M,k)}if(!C(X.Gx,X.Gy))throw Error("bad curve params: generator point");const S=V.mul(V.pow(X.a,$8),HV),T=V.mul(V.sqr(X.b),BigInt(27));if(V.is0(V.add(S,T)))throw Error("bad curve params: a or b");function p(Z,H,M=!1){if(!V.isValid(H)\|\|M&&V.is0(H))throw Error("bad point coordinate "+Z);return H}function f(Z){if(!(Z instanceof D))throw Error("ProjectivePoint expected")}function u(Z){if(!F\|\|!F.basises)throw Error("no endo");return function(H,M,k){const[[j,O],[L,x]]=M,B=E7(xH,k),v=E7(-OH,k);let b=H-Bj-vL,A=-BO-vx;const h=b<A0,d=A<A0;h&&(b=-b),d&&(A=-A);const l=n1(Math.ceil(t7(k)/2))+H1;if(b<A0\|\|b>=l\|\|A<A0\|\|A>=l)throw Error("splitScalar (endomorphism): failed, k="+H);return{k1neg:h,k1:b,k2neg:d,k2:A}}(Z,F.basises,G.ORDER)}const w=x7((Z,H)=>{const{X:M,Y:k,Z:j}=Z;if(V.eql(j,V.ONE))return{x:M,y:k};const O=Z.is0();H==null&&(H=O?V.ONE:V.inv(j));const L=V.mul(M,H),x=V.mul(k,H),B=V.mul(j,H);if(O)return{x:V.ZERO,y:V.ZERO};if(!V.eql(B,V.ONE))throw Error("invZ was invalid");return{x:L,y:x}}),c=x7((Z)=>{if(Z.is0()){if(Q.allowInfinityPoint&&!V.is0(Z.Y))return;throw Error("bad point: ZERO")}const{x:H,y:M}=Z.toAffine();if(!V.isValid(H)\|\|!V.isValid(M))throw Error("bad point: x or y not field elements");if(!C(H,M))throw Error("bad point: equation left != right");if(!Z.isTorsionFree())throw Error("bad point: not in prime-order subgroup");return!0});function i(Z,H,M,k,j){return M=new D(V.mul(M.X,Z),M.Y,M.Z),H=x8(k,H),M=x8(j,M),H.add(M)}class D{constructor(Z,H,M){this.X=p("x",Z),this.Y=p("y",H,!0),this.Z=p("z",M),Object.freeze(this)}static CURVE(){return X}static fromAffine(Z){const{x:H,y:M}=Z\|\|{};if(!Z\|\|!V.isValid(H)\|\|!V.isValid(M))throw Error("invalid affine point");if(Z instanceof D)throw Error("projective point not allowed");return V.is0(H)&&V.is0(M)?D.ZERO:new D(H,M,V.ONE)}static fromBytes(Z){const H=D.fromAffine(P(o0(Z,void 0,"point")));return H.assertValidity(),H}static fromHex(Z){return D.fromBytes(Q0("pointHex",Z))}get x(){return this.toAffine().x}get y(){return this.toAffine().y}precompute(Z=8,H=!0){return N.createCache(this,Z),H\|\|this.multiply($8),this}assertValidity(){c(this)}hasEvenY(){const{y:Z}=this.toAffine();if(!V.isOdd)throw Error("Field doesn't support isOdd");return!V.isOdd(Z)}equals(Z){f(Z);const{X:H,Y:M,Z:k}=this,{X:j,Y:O,Z:L}=Z,x=V.eql(V.mul(H,L),V.mul(j,k)),B=V.eql(V.mul(M,L),V.mul(O,k));return x&&B}negate(){return new D(this.X,V.neg(this.Y),this.Z)}double(){const{a:Z,b:H}=X,M=V.mul(H,$8),{X:k,Y:j,Z:O}=this;let{ZERO:L,ZERO:x,ZERO:B}=V,v=V.mul(k,k),b=V.mul(j,j),A=V.mul(O,O),h=V.mul(k,j);return h=V.add(h,h),B=V.mul(k,O),B=V.add(B,B),L=V.mul(Z,B),x=V.mul(M,A),x=V.add(L,x),L=V.sub(b,x),x=V.add(b,x),x=V.mul(L,x),L=V.mul(h,L),B=V.mul(M,B),A=V.mul(Z,A),h=V.sub(v,A),h=V.mul(Z,h),h=V.add(h,B),B=V.add(v,v),v=V.add(B,v),v=V.add(v,A),v=V.mul(v,h),x=V.add(x,v),A=V.mul(j,O),A=V.add(A,A),v=V.mul(A,h),L=V.sub(L,v),B=V.mul(A,b),B=V.add(B,B),B=V.add(B,B),new D(L,x,B)}add(Z){f(Z);const{X:H,Y:M,Z:k}=this,{X:j,Y:O,Z:L}=Z;let{ZERO:x,ZERO:B,ZERO:v}=V;const b=X.a,A=V.mul(X.b,$8);let h=V.mul(H,j),d=V.mul(M,O),l=V.mul(k,L),I=V.add(H,M),g=V.add(j,O);I=V.mul(I,g),g=V.add(h,d),I=V.sub(I,g),g=V.add(H,k);let y=V.add(j,L);return g=V.mul(g,y),y=V.add(h,l),g=V.sub(g,y),y=V.add(M,k),x=V.add(O,L),y=V.mul(y,x),x=V.add(d,l),y=V.sub(y,x),v=V.mul(b,g),x=V.mul(A,l),v=V.add(x,v),x=V.sub(d,v),v=V.add(d,v),B=V.mul(x,v),d=V.add(h,h),d=V.add(d,h),l=V.mul(b,l),g=V.mul(A,g),d=V.add(d,l),l=V.sub(h,l),l=V.mul(b,l),g=V.add(g,l),h=V.mul(d,g),B=V.add(B,h),h=V.mul(y,g),x=V.mul(I,x),x=V.sub(x,h),h=V.mul(I,d),v=V.mul(y,v),v=V.add(v,h),new D(x,B,v)}subtract(Z){return this.add(Z.negate())}is0(){return this.equals(D.ZERO)}multiply(Z){const{endo:H}=Q;if(!G.isValidNot0(Z))throw Error("invalid scalar: out of range");let M,k;const j=(O)=>N.cached(this,O,(L)=>C6(D,L));if(H){const{k1neg:O,k1:L,k2neg:x,k2:B}=u(Z),{p:v,f:b}=j(L),{p:A,f:h}=j(B);k=b.add(h),M=i(H.beta,v,A,O,x)}else{const{p:O,f:L}=j(Z);M=O,k=L}return C6(D,[M,k])[0]}multiplyUnsafe(Z){const{endo:H}=Q,M=this;if(!G.isValid(Z))throw Error("invalid scalar: out of range");if(Z===A0\|\|M.is0())return D.ZERO;if(Z===H1)return M;if(N.hasCache(this))return this.multiply(Z);if(H){const{k1neg:k,k1:j,k2neg:O,k2:L}=u(Z),{p1:x,p2:B}=function(v,b,A,h){let d=b,l=v.ZERO,I=v.ZERO;for(;A>C1\|\|h>C1;)A&e0&&(l=l.add(d)),h&e0&&(I=I.add(d)),d=d.double(),A>>=e0,h>>=e0;return{p1:l,p2:I}}(D,M,j,L);return i(H.beta,x,B,k,O)}return N.unsafe(M,Z)}multiplyAndAddUnsafe(Z,H,M){const k=this.multiplyUnsafe(H).add(Z.multiplyUnsafe(M));return k.is0()?void 0:k}toAffine(Z){return w(this,Z)}isTorsionFree(){const{isTorsionFree:Z}=Q;return Y===H1\|\|(Z?Z(D,this):N.unsafe(this,q).is0())}clearCofactor(){const{clearCofactor:Z}=Q;return Y===H1?this:Z?Z(D,this):this.multiplyUnsafe(Y)}isSmallOrder(){return this.multiplyUnsafe(Y).is0()}toBytes(Z=!0){return O8(Z,"isCompressed"),this.assertValidity(),$(D,this,Z)}toHex(Z=!0){return $1(this.toBytes(Z))}toString(){return`<Point ${this.is0()?"ZERO":this.toHex()}>`}get px(){return this.X}get py(){return this.X}get pz(){return this.Z}toRawBytes(Z=!0){return this.toBytes(Z)}_setWindowSize(Z){this.precompute(Z)}static normalizeZ(Z){return C6(D,Z)}static msm(Z,H){return ZV(D,G,Z,H)}static fromPrivateKey(Z){return D.BASE.multiply(a0(G,Z))}}D.BASE=new D(X.Gx,X.Gy,V.ONE),D.ZERO=new D(V.ZERO,V.ONE,V.ZERO),D.Fp=V,D.Fn=G;const R=G.BITS,N=new zW(D,Q.endo?Math.ceil(R/2):R);return D.BASE.precompute(8),D},HW=function(W){return Uint8Array.of(W?2:3)},kW=function(W,Q){return{secretKey:Q.BYTES,publicKey:1+W.BYTES,publicKeyUncompressed:1+2W.BYTES,publicKeyHasPrefix:!0,signature:2Q.BYTES}},$V=function(W,Q,J={}){d7(Q),f6(J,{},{hmac:"function",lowS:"boolean",randomBytes:"function",bits2int:"function",bits2int_modN:"function"});const V=J.randomBytes\|\|D8,G=J.hmac\|\|((R,...N)=>o7(Q,R,D0(...N))),{Fp:X,Fn:Y}=W,{ORDER:q,BITS:F}=Y,{keygen:U,getPublicKey:K,getSharedSecret:$,utils:P,lengths:z}=function(R,N={}){const{Fn:Z}=R,H=N.randomBytes\|\|D8,M=Object.assign(kW(R.Fp,Z),{seed:UW(Z.ORDER)});function k(B){try{return!!a0(Z,B)}catch(v){return!1}}function j(B=H(M.seed)){return PW(o0(B,M.seed,"seed"),Z.ORDER)}function O(B,v=!0){return R.BASE.multiply(a0(Z,B)).toBytes(v)}function L(B){if(typeof B=="bigint")return!1;if(B instanceof R)return!0;const{secretKey:v,publicKey:b,publicKeyUncompressed:A}=M;if(Z.allowedLengths\|\|v===b)return;const h=Q0("key",B).length;return h===b\|\|h===A}return Object.freeze({getPublicKey:O,getSharedSecret(B,v,b=!0){if(L(B)===!0)throw Error("first arg must be private key");if(L(v)===!1)throw Error("second arg must be public key");const A=a0(Z,B);return R.fromHex(v).multiply(A).toBytes(b)},keygen(B){const v=j(B);return{secretKey:v,publicKey:O(v)}},Point:R,utils:{isValidSecretKey:k,isValidPublicKey(B,v){const{publicKey:b,publicKeyUncompressed:A}=M;try{const h=B.length;return!(v===!0&&h!==b\|\|v===!1&&h!==A\|\|!R.fromBytes(B))}catch(h){return!1}},randomSecretKey:j,isValidPrivateKey:k,randomPrivateKey:j,normPrivateKeyToScalar:(B)=>a0(Z,B),precompute(B=8,v=R.BASE){return v.precompute(B,!1)}},lengths:M})}(W,J),C={prehash:!1,lowS:typeof J.lowS=="boolean"&&J.lowS,format:void 0,extraEntropy:!1},S="compact";function T(R){return R>q>>H1}function p(R,N){if(!Y.isValidNot0(N))throw Error(`invalid signature ${R}: out of range 1..Point.Fn.ORDER`);return N}class f{constructor(R,N,Z){this.r=p("r",R),this.s=p("s",N),Z!=null&&(this.recovery=Z),Object.freeze(this)}static fromBytes(R,N=S){let Z;if(function(j,O){N6(O);const L=z.signature;o0(j,O==="compact"?L:O==="recovered"?L+1:void 0,O+" signature")}(R,N),N==="der"){const{r:j,s:O}=v0.toSig(o0(R));return new f(j,O)}N==="recovered"&&(Z=R[0],N="compact",R=R.subarray(1));const H=Y.BYTES,M=R.subarray(0,H),k=R.subarray(H,2H);return new f(Y.fromBytes(M),Y.fromBytes(k),Z)}static fromHex(R,N){return this.fromBytes(I8(R),N)}addRecoveryBit(R){return new f(this.r,this.s,R)}recoverPublicKey(R){const N=X.ORDER,{r:Z,s:H,recovery:M}=this;if(M==null\|\|![0,1,2,3].includes(M))throw Error("recovery id invalid");if(qZW<N&&M>1)throw Error("recovery id is ambiguous for h>1 curve");const k=M===2\|\|M===3?Z+q:Z;if(!X.isValid(k))throw Error("recovery id 2 or 3 invalid");const j=X.toBytes(k),O=W.fromBytes(D0(HW(!(1&M)),j)),L=Y.inv(k),x=w(Q0("msgHash",R)),B=Y.create(-xL),v=Y.create(HL),b=W.BASE.multiplyUnsafe(B).add(O.multiplyUnsafe(v));if(b.is0())throw Error("point at infinify");return b.assertValidity(),b}hasHighS(){return T(this.s)}toBytes(R=S){if(N6(R),R==="der")return I8(v0.hexFromSig(this));const N=Y.toBytes(this.r),Z=Y.toBytes(this.s);if(R==="recovered"){if(this.recovery==null)throw Error("recovery bit must be present");return D0(Uint8Array.of(this.recovery),N,Z)}return D0(N,Z)}toHex(R){return $1(this.toBytes(R))}assertValidity(){}static fromCompact(R){return f.fromBytes(Q0("sig",R),"compact")}static fromDER(R){return f.fromBytes(Q0("sig",R),"der")}normalizeS(){return this.hasHighS()?new f(this.r,Y.neg(this.s),this.recovery):this}toDERRawBytes(){return this.toBytes("der")}toDERHex(){return $1(this.toBytes("der"))}toCompactRawBytes(){return this.toBytes("compact")}toCompactHex(){return $1(this.toBytes("compact"))}}const u=J.bits2int\|\|function(R){if(R.length>8192)throw Error("input is too large");const N=B1(R),Z=8R.length-F;return Z>0?N>>BigInt(Z):N},w=J.bits2int_modN\|\|function(R){return Y.create(u(R))},c=n1(F);function i(R){return function(N,Z,H,M){if(!w6(Z,H,M))throw Error("expected valid "+N+": "+H+" <= n < "+M+", got "+Z)}("num < 2^"+F,R,A0,c),Y.toBytes(R)}function D(R,N){return o0(R,void 0,"message"),N?o0(Q(R),void 0,"prehashed message"):R}return Object.freeze({keygen:U,getPublicKey:K,getSharedSecret:$,utils:P,lengths:z,Point:W,sign(R,N,Z={}){R=Q0("message",R);const{seed:H,k2sig:M}=function(k,j,O){if(["recovered","canonical"].some((l)=>(l in O)))throw Error("sign() legacy options not supported");const{lowS:L,prehash:x,extraEntropy:B}=R6(O,C);k=D(k,x);const v=w(k),b=a0(Y,j),A=[i(b),i(v)];if(B!=null&&B!==!1){const l=B===!0?V(z.secretKey):B;A.push(Q0("extraEntropy",l))}const h=D0(...A),d=v;return{seed:h,k2sig(l){const I=u(l);if(!Y.isValidNot0(I))return;const g=Y.inv(I),y=W.BASE.multiply(I).toAffine(),o=Y.create(y.x);if(o===A0)return;const E=Y.create(gY.create(d+ob));if(E===A0)return;let _=(y.x===o?0:2)\|Number(y.y&H1),m=E;return L&&T(E)&&(m=Y.neg(E),_^=1),new f(o,m,_)}}}(R,N,Z);return function(k,j,O){if(typeof k!="number"\|\|k<2)throw Error("hashLen must be a number");if(typeof j!="number"\|\|j<2)throw Error("qByteLen must be a number");if(typeof O!="function")throw Error("hmacFn must be a function");const L=(I)=>new Uint8Array(I),x=(I)=>Uint8Array.of(I);let B=L(k),v=L(k),b=0;const A=()=>{B.fill(1),v.fill(0),b=0},h=(...I)=>O(v,B,...I),d=(I=L(0))=>{v=h(x(0),I),B=h(),I.length!==0&&(v=h(x(1),I),B=h())},l=()=>{if(b++>=1000)throw Error("drbg: tried 1000 values");let I=0;const g=[];for(;I<j;){B=h();const y=B.slice();g.push(y),I+=B.length}return D0(...g)};return(I,g)=>{let y;for(A(),d(I);!(y=g(l()));)d();return A(),y}}(Q.outputLen,Y.BYTES,G)(H,M)},verify(R,N,Z,H={}){const{lowS:M,prehash:k,format:j}=R6(H,C);if(Z=Q0("publicKey",Z),N=D(Q0("message",N),k),("strict"in H))throw Error("options.strict was renamed to lowS");const O=j===void 0?function(L){let x;const B=typeof L=="string"\|\|v8(L),v=!B&&L!==null&&typeof L=="object"&&typeof L.r=="bigint"&&typeof L.s=="bigint";if(!B&&!v)throw Error("invalid signature, expected Uint8Array, hex string or Signature instance");if(v)x=new f(L.r,L.s);else if(B){try{x=f.fromBytes(Q0("sig",L),"der")}catch(b){if(!(b instanceof v0.Err))throw b}if(!x)try{x=f.fromBytes(Q0("sig",L),"compact")}catch(b){return!1}}return x\|\|!1}(R):f.fromBytes(Q0("sig",R),j);if(O===!1)return!1;try{const L=W.fromBytes(Z);if(M&&O.hasHighS())return!1;const{r:x,s:B}=O,v=w(N),b=Y.inv(B),A=Y.create(vb),h=Y.create(xb),d=W.BASE.multiplyUnsafe(A).add(L.multiplyUnsafe(h));if(d.is0())return!1;return Y.create(d.x)===x}catch(L){return!1}},recoverPublicKey(R,N,Z={}){const{prehash:H}=R6(Z,C);return N=D(N,H),f.fromBytes(R,"recovered").recoverPublicKey(N).toBytes()},Signature:f,hash:Q})},CV=function(W){const{CURVE:Q,curveOpts:J}=function(G){const X={a:G.a,b:G.b,p:G.Fp.ORDER,n:G.n,h:G.h,Gx:G.Gx,Gy:G.Gy},Y=G.Fp;let q=G.allowedPrivateKeyLengths?Array.from(new Set(G.allowedPrivateKeyLengths.map((F)=>Math.ceil(F/2)))):void 0;return{CURVE:X,curveOpts:{Fp:Y,Fn:o1(X.n,{BITS:G.nBitLength,allowedLengths:q,modFromBytes:G.wrapPrivateKey}),allowInfinityPoint:G.allowInfinityPoint,endo:G.endo,isTorsionFree:G.isTorsionFree,clearCofactor:G.clearCofactor,fromBytes:G.fromBytes,toBytes:G.toBytes}}}(W),V={hmac:W.hmac,randomBytes:W.randomBytes,lowS:W.lowS,bits2int:W.bits2int,bits2int_modN:W.bits2int_modN};return{CURVE:Q,curveOpts:J,hash:W.hash,ecdsaOpts:V}},jV=function(W){const{CURVE:Q,curveOpts:J,hash:V,ecdsaOpts:G}=CV(W);return function(X,Y){const q=Y.Point;return Object.assign({},Y,{ProjectivePoint:q,CURVE:Object.assign({},X,YW(q.Fn.ORDER,q.Fn.BITS))})}(W,$V(kV(Q,J),V,G))},N8=function(W,...Q){let J=p7[W];if(J===void 0){const V=O6(l7(W));J=D0(V,V),p7[W]=J}return O6(D0(J,...Q))},v6=function(W){const{Fn:Q,BASE:J}=M1,V=a0(Q,W),G=J.multiply(V);return{scalar:u6(G.y)?V:Q.neg(V),bytes:h6(G)}},CW=function(W){const Q=w8;if(!Q.isValidNot0(W))throw Error("invalid x: Fail if x \u2265 p");const J=Q.create(WW),V=Q.create(JW+BigInt(7));let G=Q.sqrt(V);u6(G)\|\|(G=Q.neg(G));const X=M1.fromAffine({x:W,y:G});return X.assertValidity(),X},jW=function(...W){return M1.Fn.create(r1(N8("BIP0340/challenge",...W)))},f7=function(W){return v6(W).bytes},RV=function(W,Q,J=D8(32)){const{Fn:V}=M1,G=Q0("message",W),{bytes:X,scalar:Y}=v6(Q),q=Q0("auxRand",J,32),F=V.toBytes(Y^r1(N8("BIP0340/aux",q))),U=N8("BIP0340/nonce",F,X,G),{bytes:K,scalar:$}=v6(U),P=jW(K,X,G),z=new Uint8Array(64);if(z.set(K,0),z.set(V.toBytes(V.create($+PY)),32),!BW(z,G,X))throw Error("sign: Invalid signature produced");return z},BW=function(W,Q,J){const{Fn:V,BASE:G}=M1,X=Q0("signature",W,64),Y=Q0("message",Q),q=Q0("publicKey",J,32);try{const F=CW(r1(q)),U=r1(X.subarray(0,32));if(!w6(U,y7,j1.p))return!1;const K=r1(X.subarray(32,64));if(!w6(K,y7,j1.n))return!1;const $=jW(V.toBytes(U),h6(F),Y),P=G.multiplyUnsafe(K).add(F.multiplyUnsafe(V.neg($))),{x:z,y:C}=P.toAffine();return!(P.is0()\|\|!u6(C)\|\|z!==U)}catch(F){return!1}},F1=typeof globalThis=="object"&&("crypto"in globalThis)?globalThis.crypto:void 0,i7=(()=>typeof Uint8Array.from([]).toHex=="function"&&typeof Uint8Array.fromHex=="function")(),JV=Array.from({length:256},(W,Q)=>Q.toString(16).padStart(2,"0")),L7=48,QV=57,I7=65,VV=70,D7=97,GV=102;class E6{}class r7 extends E6{constructor(W,Q,J,V){super(),this.finished=!1,this.length=0,this.pos=0,this.destroyed=!1,this.blockLen=W,this.outputLen=Q,this.padOffset=J,this.isLE=V,this.buffer=new Uint8Array(W),this.view=k6(this.buffer)}update(W){R8(this),W1(W=g6(W));const{view:Q,buffer:J,blockLen:V}=this,G=W.length;for(let X=0;X<G;){const Y=Math.min(V-this.pos,G-X);if(Y!==V)J.set(W.subarray(X,X+Y),this.pos),this.pos+=Y,X+=Y,this.pos===V&&(this.process(Q,0),this.pos=0);else{const q=k6(W);for(;V<=G-X;X+=V)this.process(q,X)}}return this.length+=W.length,this.roundClean(),this}digestInto(W){R8(this),function(K,$){W1(K);const P=$.outputLen;if(K.length<P)throw Error("digestInto() expects output buffer of length at least "+P)}(W,this),this.finished=!0;const{buffer:Q,view:J,blockLen:V,isLE:G}=this;let{pos:X}=this;Q[X++]=128,L8(this.buffer.subarray(X)),this.padOffset>V-X&&(this.process(J,0),X=0);for(let K=X;K<V;K++)Q[K]=0;(function(K,$,P,z){if(typeof K.setBigUint64=="function")return K.setBigUint64($,P,z);const C=BigInt(32),S=BigInt(4294967295),T=Number(P>>C&S),p=Number(P&S),f=z?4:0,u=z?0:4;K.setUint32($+f,T,z),K.setUint32($+u,p,z)})(J,V-8,BigInt(8this.length),G),this.process(J,0);const Y=k6(W),q=this.outputLen;if(q%4)throw Error("_sha2: outputLen should be aligned to 32bit");const F=q/4,U=this.get();if(F>U.length)throw Error("_sha2: outputLen bigger than state");for(let K=0;K<F;K++)Y.setUint32(4K,U[K],G)}digest(){const{buffer:W,outputLen:Q}=this;this.digestInto(W);const J=W.slice(0,Q);return this.destroy(),J}_cloneInto(W){W\|\|(W=new this.constructor),W.set(...this.get());const{blockLen:Q,buffer:J,length:V,finished:G,destroyed:X,pos:Y}=this;return W.destroyed=X,W.finished=G,W.length=V,W.pos=Y,V%Q&&W.buffer.set(J),W}clone(){return this._cloneInto()}}var b0=Uint32Array.from([1779033703,3144134277,1013904242,2773480762,1359893119,2600822924,528734635,1541459225]),qV=Uint32Array.from([1116352408,1899447441,3049323471,3921009573,961987163,1508970993,2453635748,2870763221,3624381080,310598401,607225278,1426881987,1925078388,2162078206,2614888103,3248222580,3835390401,4022224774,264347078,604807628,770255983,1249150122,1555081692,1996064986,2554220882,2821834349,2952996808,3210313671,3336571891,3584528711,113926993,338241895,666307205,773529912,1294757372,1396182291,1695183700,1986661051,2177026350,2456956037,2730485921,2820302411,3259730800,3345764771,3516065817,3600352804,4094571909,275423344,430227734,506948616,659060556,883997877,958139571,1322822218,1537002063,1747873779,1955562222,2024104815,2227730452,2361852424,2428436474,2756734187,3204031479,3329325298]),h0=new Uint32Array(64);class n7 extends r7{constructor(W=32){super(64,W,8,!1),this.A=0\|b0[0],this.B=0\|b0[1],this.C=0\|b0[2],this.D=0\|b0[3],this.E=0\|b0[4],this.F=0\|b0[5],this.G=0\|b0[6],this.H=0\|b0[7]}get(){const{A:W,B:Q,C:J,D:V,E:G,F:X,G:Y,H:q}=this;return[W,Q,J,V,G,X,Y,q]}set(W,Q,J,V,G,X,Y,q){this.A=0\|W,this.B=0\|Q,this.C=0\|J,this.D=0\|V,this.E=0\|G,this.F=0\|X,this.G=0\|Y,this.H=0\|q}process(W,Q){for(let $=0;$<16;$++,Q+=4)h0[$]=W.getUint32(Q,!1);for(let $=16;$<64;$++){const P=h0[$-15],z=h0[$-2],C=I0(P,7)^I0(P,18)^P>>>3,S=I0(z,17)^I0(z,19)^z>>>10;h0[$]=S+h0[$-7]+C+h0[$-16]\|0}let{A:J,B:V,C:G,D:X,E:Y,F:q,G:F,H:U}=this;for(let $=0;$<64;$++){const P=U+(I0(Y,6)^I0(Y,11)^I0(Y,25))+((K=Y)&q^~K&F)+qV[$]+h0[$]\|0,z=(I0(J,2)^I0(J,13)^I0(J,22))+YV(J,V,G)\|0;U=F,F=q,q=Y,Y=X+P\|0,X=G,G=V,V=J,J=P+z\|0}var K;J=J+this.A\|0,V=V+this.B\|0,G=G+this.C\|0,X=X+this.D\|0,Y=Y+this.E\|0,q=q+this.F\|0,F=F+this.G\|0,U=U+this.H\|0,this.set(J,V,G,X,Y,q,F,U)}roundClean(){L8(h0)}destroy(){this.set(0,0,0,0,0,0,0,0),L8(this.buffer)}}var O6=XV(()=>new n7);class y6 extends E6{constructor(W,Q){super(),this.finished=!1,this.destroyed=!1,d7(W);const J=g6(Q);if(this.iHash=W.create(),typeof this.iHash.update!="function")throw Error("Expected instance of class which extends utils.Hash");this.blockLen=this.iHash.blockLen,this.outputLen=this.iHash.outputLen;const V=this.blockLen,G=new Uint8Array(V);G.set(J.length>V?W.create().update(J).digest():J);for(let X=0;X<G.length;X++)G[X]^=54;this.iHash.update(G),this.oHash=W.create();for(let X=0;X<G.length;X++)G[X]^=106;this.oHash.update(G),L8(G)}update(W){return R8(this),this.iHash.update(W),this}digestInto(W){R8(this),W1(W,this.outputLen),this.finished=!0,this.iHash.digestInto(W),this.oHash.update(W),this.oHash.digestInto(W),this.destroy()}digest(){const W=new Uint8Array(this.oHash.outputLen);return this.digestInto(W),W}_cloneInto(W){W\|\|(W=Object.create(Object.getPrototypeOf(this),{}));const{oHash:Q,iHash:J,finished:V,destroyed:G,blockLen:X,outputLen:Y}=this;return W.finished=V,W.destroyed=G,W.blockLen=X,W.outputLen=Y,W.oHash=Q._cloneInto(W.oHash),W.iHash=J._cloneInto(W.iHash),W}clone(){return this._cloneInto()}destroy(){this.destroyed=!0,this.oHash.destroy(),this.iHash.destroy()}}var o7=(W,Q,J)=>new y6(W,Q).update(J).digest();o7.create=(W,Q)=>new y6(W,Q);var p6=BigInt(0),x6=BigInt(1),$6=(W)=>typeof W=="bigint"&&p6<=W,n1=(W)=>(x6<<BigInt(W))-x6,K0=BigInt(0),U0=BigInt(1),s0=BigInt(2),WW=BigInt(3),JW=BigInt(4),QW=BigInt(5),UV=BigInt(7),VW=BigInt(8),PV=BigInt(9),w7=BigInt(16),zV=["create","isValid","is0","neg","inv","sqrt","sqr","eql","add","sub","mul","pow","div","addN","subN","mulN","sqrN"],C1=BigInt(0),e0=BigInt(1),B6=new WeakMap,FW=new WeakMap;class zW{constructor(W,Q){this.BASE=W.BASE,this.ZERO=W.ZERO,this.Fn=W.Fn,this.bits=Q}_unsafeLadder(W,Q,J=this.ZERO){let V=W;for(;Q>C1;)Q&e0&&(J=J.add(V)),V=V.double(),Q>>=e0;return J}precomputeWindow(W,Q){const{windows:J,windowSize:V}=j6(Q,this.bits),G=[];let X=W,Y=X;for(let q=0;q<J;q++){Y=X,G.push(Y);for(let F=1;F<V;F++)Y=Y.add(X),G.push(Y);X=Y.double()}return G}wNAF(W,Q,J){if(!this.Fn.isValid(J))throw Error("invalid scalar");let V=this.ZERO,G=this.BASE;const X=j6(W,this.bits);for(let Y=0;Y<X.windows;Y++){const{nextN:q,offset:F,isZero:U,isNeg:K,isNegF:$,offsetF:P}=A7(J,Y,X);J=q,U?G=G.add(x8($,Q[P])):V=V.add(x8(K,Q[F]))}return T7(J),{p:V,f:G}}wNAFUnsafe(W,Q,J,V=this.ZERO){const G=j6(W,this.bits);for(let X=0;X<G.windows&&J!==C1;X++){const{nextN:Y,offset:q,isZero:F,isNeg:U}=A7(J,X,G);if(J=Y,!F){const K=Q[q];V=V.add(U?K.negate():K)}}return T7(J),V}getPrecomputes(W,Q,J){let V=B6.get(Q);return V\|\|(V=this.precomputeWindow(Q,W),W!==1&&(typeof J=="function"&&(V=J(V)),B6.set(Q,V))),V}cached(W,Q,J){const V=M6(W);return this.wNAF(V,this.getPrecomputes(V,W,J),Q)}unsafe(W,Q,J,V){const G=M6(W);return G===1?this._unsafeLadder(W,Q,V):this.wNAFUnsafe(G,this.getPrecomputes(G,W,J),Q,V)}createCache(W,Q){KW(Q,this.bits),FW.set(W,Q),B6.delete(W)}hasCache(W){return M6(W)!==1}}var E7=(W,Q)=>(W+(W>=0?Q:-Q)/ZW)/Q,v0={Err:class extends Error{constructor(W=""){super(W)}},_tlv:{encode(W,Q){const{Err:J}=v0;if(W<0\|\|W>256)throw new J("tlv.encode: wrong tag");if(1&Q.length)throw new J("tlv.encode: unpadded data");const V=Q.length/2,G=k8(V);if(G.length/2&128)throw new J("tlv.encode: long form length too big");const X=V>127?k8(G.length/2\|128):"";return k8(W)+X+G+Q},decode(W,Q){const{Err:J}=v0;let V=0;if(W<0\|\|W>256)throw new J("tlv.encode: wrong tag");if(Q.length<2\|\|Q[V++]!==W)throw new J("tlv.decode: wrong tlv");const G=Q[V++];let X=0;if(128&G){const q=127&G;if(!q)throw new J("tlv.decode(long): indefinite length not supported");if(q>4)throw new J("tlv.decode(long): byte length is too big");const F=Q.subarray(V,V+q);if(F.length!==q)throw new J("tlv.decode: length bytes not complete");if(F[0]===0)throw new J("tlv.decode(long): zero leftmost byte");for(let U of F)X=X<<8\|U;if(V+=q,X<128)throw new J("tlv.decode(long): not minimal encoding")}else X=G;const Y=Q.subarray(V,V+X);if(Y.length!==X)throw new J("tlv.decode: wrong value length");return{v:Y,l:Q.subarray(V+X)}}},_int:{encode(W){const{Err:Q}=v0;if(W<A0)throw new Q("integer: negative integers are not allowed");let J=k8(W);if(8&Number.parseInt(J[0],16)&&(J="00"+J),1&J.length)throw new Q("unexpected DER parsing assertion: unpadded hex");return J},decode(W){const{Err:Q}=v0;if(128&W[0])throw new Q("invalid signature integer: negative");if(W[0]===0&&!(128&W[1]))throw new Q("invalid signature integer: unnecessary leading zero");return B1(W)}},toSig(W){const{Err:Q,_int:J,_tlv:V}=v0,G=Q0("signature",W),{v:X,l:Y}=V.decode(48,G);if(Y.length)throw new Q("invalid signature: left bytes after parsing");const{v:q,l:F}=V.decode(2,X),{v:U,l:K}=V.decode(2,F);if(K.length)throw new Q("invalid signature: left bytes after parsing");return{r:J.decode(q),s:J.decode(U)}},hexFromSig(W){const{_tlv:Q,_int:J}=v0,V=Q.encode(2,J.encode(W.r))+Q.encode(2,J.encode(W.s));return Q.encode(48,V)}},A0=BigInt(0),H1=BigInt(1),ZW=BigInt(2),$8=BigInt(3),HV=BigInt(4),j1={p:BigInt("0xfffffffffffffffffffffffffffffffffffffffffffffffffffffffefffffc2f"),n:BigInt("0xfffffffffffffffffffffffffffffffebaaedce6af48a03bbfd25e8cd0364141"),h:BigInt(1),a:BigInt(0),b:BigInt(7),Gx:BigInt("0x79be667ef9dcbbac55a06295ce870b07029bfcdb2dce28d959f2815b16f81798"),Gy:BigInt("0x483ada7726a3c4655da4fbfc0e1108a8fd17b448a68554199c47d08ffb10d4b8")},BV={beta:BigInt("0x7ae96a2b657c07106e64479eac3434e99cf0497512f58995c1396c28719501ee"),basises:[[BigInt("0x3086d221a7d46bcde86c90e49284eb15"),-BigInt("0xe4437ed6010e88286f547fa90abfe4c3")],[BigInt("0x114ca50f7a8e2f3f657c1108d9d44cfd8"),BigInt("0x3086d221a7d46bcde86c90e49284eb15")]]},MV=BigInt(0),y7=BigInt(1),S6=BigInt(2),w8=o1(j1.p,{sqrt(W){const Q=j1.p,J=BigInt(3),V=BigInt(6),G=BigInt(11),X=BigInt(22),Y=BigInt(23),q=BigInt(44),F=BigInt(88),U=WWW%Q,K=UUW%Q,$=C0(K,J,Q)K%Q,P=C0($,J,Q)K%Q,z=C0(P,S6,Q)U%Q,C=C0(z,G,Q)z%Q,S=C0(C,X,Q)C%Q,T=C0(S,q,Q)S%Q,p=C0(T,F,Q)T%Q,f=C0(p,q,Q)S%Q,u=C0(f,J,Q)K%Q,w=C0(u,Y,Q)C%Q,c=C0(w,V,Q)U%Q,i=C0(c,S6,Q);if(!w8.eql(w8.sqr(i),W))throw Error("Cannot find square root");return i}}),$W=function(W,Q){const J=(V)=>jV({...W,hash:V});return{...J(Q),create:J}}({...j1,Fp:w8,lowS:!0,endo:BV},O6),p7={},h6=(W)=>W.toBytes(!0).slice(1),M1=(()=>$W.Point)(),u6=(W)=>W%S6===MV,r1=B1,m6=(()=>{const W=(Q=D8(48))=>PW(Q,j1.n);return $W.utils.randomSecretKey,{keygen(Q){const J=W(Q);return{secretKey:J,publicKey:f7(J)}},getPublicKey:f7,sign:RV,verify:BW,Point:M1,utils:{randomSecretKey:W,randomPrivateKey:W,taggedHash:N8,lift_x:CW,pointToBytes:h6,numberToBytesBE:A8,bytesToNumberBE:B1,mod:j0},lengths:{secretKey:32,publicKey:32,publicKeyHasPrefix:!1,signature:64,seed:48}}})(),LV=new TextEncoder,IV=new TextDecoder,t0=(W)=>LV.encode(W),l1=(W)=>IV.decode(W),A6=(W)=>Array.from(W,(Q)=>Q.toString(16).padStart(2,"0")).join(""),T0=JSON.stringify,S8=JSON.parse,MW=(W,Q=Number.MAX_SAFE_INTEGER)=>W.split("").reduce((J,V)=>J+V.charCodeAt(0),0)%Q,_6="AES-GCM",DV={},C8=(W)=>DV[W]??=crypto.subtle.digest("SHA-1",t0(W)).then((Q)=>{const J=new Uint8Array(Q);let V="";for(let G of J)V+=G.toString(36);return V}),OV=async(W,Q)=>{const J=crypto.getRandomValues(new Uint8Array(12)),V=await W,G=await crypto.subtle.encrypt({name:_6,iv:J},V,t0(Q));return`${J.join(",")}\$${((X)=>{const Y=new Uint8Array(X);let q="";for(let F=0;F<Y.length;F+=32768)q+=String.fromCharCode(...Y.subarray(F,F+32768));return btoa(q)})(G)}`},xV=async(W,Q)=>{const[J,V]=Q.split("$");if(!J\|\|!V)throw Error("Invalid encrypted payload format");const G=Uint8Array.from(J.split(","),Number),X=await W,Y=await crypto.subtle.decrypt({name:_6,iv:G},X,(q=V,Uint8Array.from(atob(q),(F)=>F.charCodeAt(0)).buffer));var q;return l1(Y)},Z0="GenosRTC",c6=(W,Q)=>Array.from({length:W},Q),wV="0123456789AaBbCcDdEeFfGgHhIiJjKkLlMmNnOoPpQqRrSsTtUuVvWwXxYyZz",T6=(W)=>Array.from(crypto.getRandomValues(new Uint8Array(W)),(Q)=>wV[Q%62]).join(""),z1=T6(20),k1=Promise.all.bind(Promise),NV=typeof window!="undefined",{entries:SV,fromEntries:RW}=Object,vV=()=>{},S0=(W)=>Error(`${Z0}: ${W}`),j8=(...W)=>W.join("@"),b7="icegatheringstatechange",h7="offer",AV=[...c6(3,(W,Q)=>`stun:stun${Q\|\|""}.l.google.com:19302`),"stun:stun.cloudflare.com:3478"].map((W)=>({urls:W})),L6=(W,{rtcConfig:Q,rtcPolyfill:J,turnConfig:V})=>{const G=new(J\|\|RTCPeerConnection)({iceServers:[...AV,...V\|\|[]],...Q}),X={};let Y,q=!1,F=!1;const U=(P)=>Object.assign(P,{binaryType:"arraybuffer",bufferedAmountLowThreshold:65535,onmessage(z){return X.data?.(z.data)},onopen(){return X.connect?.()},onclose(){return X.close?.()},onerror(z){return!z?.error?.message?.includes("User-Initiated Abort")&&X.error?.(z)}}),K=()=>Promise.race([new Promise((P)=>{const z=()=>{G.iceGatheringState==="complete"&&(G.removeEventListener(b7,z),P())};G.addEventListener(b7,z),z()}),new Promise((P)=>setTimeout(P,5000))]).then(()=>({type:G.localDescription.type,sdp:G.localDescription.sdp.replace(/a=ice-options:trickle\s\n/g,"")}));W?U(Y=G.createDataChannel("data")):G.ondatachannel=({channel:P})=>U(Y=P),G.onnegotiationneeded=async()=>{try{q=!0,await G.setLocalDescription(),X.signal?.(await K())}catch(P){X.error?.(P)}finally{q=!1}},G.onconnectionstatechange=()=>{["disconnected","failed","closed"].includes(G.connectionState)&&X.close?.()},G.ontrack=(P)=>{X.track?.(P.track,P.streams[0]),X.stream?.(P.streams[0])},G.onremovestream=(P)=>X.stream?.(P.stream),W&&!G.canTrickleIceCandidates&&G.onnegotiationneeded();const $=()=>G.getSenders();return{created:Date.now(),connection:G,get channel(){return Y},get isDead(){return G.connectionState==="closed"},async signal(P){if(Y?.readyState!=="open"\|\|P.sdp?.includes("a=rtpmap"))try{if(P.type===h7){if(q\|\|G.signalingState!=="stable"&&!F){if(W)return;await k1([G.setLocalDescription({type:"rollback"}),G.setRemoteDescription(P)])}else await G.setRemoteDescription(P);await G.setLocalDescription();const z=await K();return X.signal?.(z),z}if(P.type==="answer"){F=!0;try{await G.setRemoteDescription(P)}finally{F=!1}}}catch(z){X.error?.(z)}},sendData(P){return Y.send(P)},destroy(){Y?.close(),G.close(),q=F=!1},setHandlers(P){return Object.assign(X,P)},offerPromise:W?new Promise((P)=>X.signal=(z)=>z.type===h7&&P(z)):Promise.resolve(),addStream(P){return P.getTracks().forEach((z)=>G.addTrack(z,P))},removeStream(P){return $().filter((z)=>P.getTracks().includes(z.track)).forEach((z)=>G.removeTrack(z))},addTrack(P,z){return G.addTrack(P,z)},removeTrack(P){const z=$().find((C)=>C.track===P);z&&G.removeTrack(z)},replaceTrack(P,z){return $().find((C)=>C.track===P)?.replaceTrack(z)}}},TV=Object.getPrototypeOf(Uint8Array),d1=16369,B8=255,I6="bufferedamountlow",Z1=(W)=>"@_"+W,gV=(W,Q,J)=>{const V=new Map,G=new Map,X=new Map,Y={},q={},F={},U={},K=new Map,$=(k,...j)=>K.get(k)?.forEach((O)=>O(...j)),P=(k,j)=>{const O=k?Array.isArray(k)?k:[k]:V.keys();return Array.from(O,(L)=>{const x=V.get(L);return x?j(L,x):(console.warn(`${Z0}: no peer with id ${L}`),null)}).filter(Boolean)},z=(k)=>{V.has(k)&&(V.delete(k),delete Y[k],delete q[k],delete F[k],delete U[k],$("peer:leave",k),Q(k))},C=(k)=>new Promise((j,O)=>{let L=setTimeout(()=>{k.removeEventListener(I6,x),O(Error(Z0+": bufferLow timeout"))},5000);function x(){clearTimeout(L),k.removeEventListener(I6,x),j()}k.addEventListener(I6,x)}),S=(k)=>{if(X.has(k))return X.get(k);if(!k)throw S0("action type is required");const j=t0(k);if(j.byteLength>12)throw S0(`"${k}" exceeds 12 bytes`);const O=new Uint8Array(12).map((b,A)=>j[A]\|\|0);let L=0;const x=new Map([["message",new Set],["progress",new Set]]),B=async(b,A,h,d)=>{if(h&&typeof h!="object")throw S0("meta must be object");if(b===void 0)throw S0("data cannot be undefined");const l=b instanceof Blob,I=l\|\|b instanceof ArrayBuffer\|\|b instanceof TV,g=typeof b!="string";if(h&&!I)throw S0("meta only allowed with binary");const y=I?new Uint8Array(l?await b.arrayBuffer():b):t0(g?T0(b):b),o=h?t0(T0(h)):null,E=Math.ceil(y.byteLength/d1)+(h?1:0)\|\|1;if(E>100)throw S0("Message too large, exceeds max chunks 100");const _=c6(E,(m,r)=>{const n=r===E-1,e=h&&r===0,W0=e?o:y.subarray(h?(r-1)d1:rd1,h?rd1:(r+1)d1),G0=new Uint8Array(15+W0.byteLength);return G0.set(O),G0.set([L],12),G0.set([n\|e<<1\|I<<2\|g<<3],13),G0.set([Math.round((r+1)/EB8)],14),G0.set(W0,15),G0});return L=L+1&B8,k1(P(A,async(m,r)=>{const{channel:n}=r;for(let e=0;e<E;e++){let W0=0;for(;n.bufferedAmount>n.bufferedAmountLowThreshold;){if(W0++>3)throw S0(`${Z0}: send buffer full, max retries reached for peer ${m}`);try{await C(n)}catch(G0){console.warn(G0.message),await new Promise((O0)=>setTimeout(O0,200))}}if(!V.has(m))break;r.sendData(_[e]),d?.(_[e][14]/B8,m,h)}}))};G.set(k,{listeners:x,send:B});const v={send:B,on(b,A){return x.get(b)?.add(A)},off(b,A){return x.get(b)?.delete(A)}};return X.set(k,v),v},T=async()=>{try{await H(""),await new Promise((k)=>setTimeout(k,99))}catch(k){console.warn(Z0+": error sending leave",k)}for(let[k,j]of V){try{j.destroy()}catch{}V.delete(k)}J()},{send:p,on:f}=S(Z1("ping")),{send:u,on:w}=S(Z1("pong")),{send:c,on:i}=S(Z1("signal")),{send:D,on:R}=S(Z1("stream")),{send:N,on:Z}=S(Z1("track")),{send:H,on:M}=S(Z1("leave"));return W((k,j)=>{V.has(j)\|\|(V.set(j,k),k.setHandlers({data(O){return((L,x)=>{try{const B=new Uint8Array(x),v=l1(B.subarray(0,12)).replace(/\0/g,"");if(!G.has(v))return console.warn(`${Z0}: unregistered type (${v})`);const[b]=B.subarray(12,13),[A]=B.subarray(13,14),[h]=B.subarray(14,15),d=B.subarray(15),l=!!(1&A),I=!!(2&A),g=!!(4&A),y=!!(8&A),o=G.get(v),E=(Y[L]\|\|={})[v]\|\|={};if(E[b]?.chunks?.length>100)return void console.warn(`${Z0}: peer ${L} sent too many chunks for nonce ${b}, ignoring.`);const _=E[b]\|\|={chunks:[]};if(I)try{_.meta=S8(l1(d))}catch{return void console.warn(`${Z0}: failed to parse meta from peer ${L} for type ${v}`)}else _.chunks.push(d);if(o.listeners.get("progress").forEach((n)=>{try{n(h/B8,L,_.meta)}catch(e){console.error(e)}}),!l)return;const m=new Uint8Array(_.chunks.reduce((n,e)=>n+e.byteLength,0));let r;if(_.chunks.reduce((n,e)=>(m.set(e,n),n+e.byteLength),0),delete E[b],g)r=m;else if(y)try{r=S8(l1(m))}catch{return void console.warn(`${Z0}: failed to parse JSON message data from peer ${L} for type ${v}`)}else r=l1(m);o.listeners.get("message").forEach((n)=>{try{n(r,L,_.meta)}catch(e){console.error(e)}})}catch(B){console.error(`${Z0}: error handling data from peer ${L}:`,B)}})(j,O)},stream(O){$("stream:add",O,j,F[j]),delete F[j]},track(O,L){$("track:add",O,L,j,U[j]),delete U[j]},signal(O){return c(O,j)},close(){return z(j)},error(O){console.error(`${Z0}: peer error for ${j}`,O),z(j)}}),$("peer:join",j))}),f("message",(k,j)=>u("",j)),w("message",(k,j)=>{q[j]?.(),delete q[j]}),i("message",(k,j)=>V.get(j)?.signal(k)),R("message",(k,j)=>F[j]=k),Z("message",(k,j)=>U[j]=k),M("message",(k,j)=>z(j)),NV&&addEventListener("beforeunload",T),{on(k,j){K.has(k)\|\|K.set(k,new Set),K.get(k).add(j)},off(k,j){return K.get(k)?.delete(j)},channel:S,leave:T,async ping(k){if(!k)throw S0("ping() requires target peer ID");const j=Date.now();return p("",k),await new Promise((O)=>q[k]=O),Date.now()-j},getPeers(){return RW(Array.from(V,([k,j])=>[k,j.connection]))},addStream(k,j,O){return P(j,async(L,x)=>{O&&await D(O,L),x.addStream(k)})},removeStream(k,j){return P(j,(O,L)=>L.removeStream(k))},addTrack(k,j,O,L){return P(O,async(x,B)=>{L&&await N(L,x),B.addTrack(k,j)})},removeTrack(k,j){return P(j,(O,L)=>L.removeTrack(k))},replaceTrack(k,j,O,L){return P(O,async(x,B)=>{L&&await N(L,x),B.replaceTrack(k,j)})}}},M8={},LW={};if(typeof window!="undefined"){const W=()=>{console.info("\u26A1 [GenosRTC] Network event detected. Forcing reconnection\u2026"),Object.values(LW).forEach((Q)=>{Q.socket&&Q.socket.readyState!==WebSocket.OPEN&&Q.socket.readyState!==WebSocket.CONNECTING&&Q.forceReconnect()})};window.addEventListener("online",()=>{console.info("\u2705 Reconnected to the network."),W()}),window.addEventListener("offline",async()=>{console.info("\u274C Disconnected from the network.")}),document.addEventListener("visibilitychange",()=>{document.visibilityState==="visible"&&W()})}var EV=(W,Q,J,V)=>(W.relayUrls??(V?((G,X)=>{const Y=[...G];let q=Y.length;const F=()=>{const U=1e4Math.sin(X++);return U-Math.floor(U)};for(;q;){const U=Math.floor(F()q--);[Y[q],Y[U]]=[Y[U],Y[q]]}return Y})(Q,MW(W.appId)):Q)).slice(0,W.relayUrls?.length??W.relayRedundancy??J),IW={},DW="EVENT",OW=m6.utils.randomSecretKey(),yV=A6(m6.getPublicKey(OW)),d6={},i1={},pV={},xW=()=>Math.floor(Date.now()/1000),wW=(W)=>pV[W]??=MW(W,1e4)+20000,u7=async(W,Q)=>{const J={kind:wW(W),content:Q,pubkey:yV,created_at:xW(),tags:[["x",W]]},V=new Uint8Array(await crypto.subtle.digest("SHA-256",t0(T0([0,J.pubkey,J.created_at,J.kind,J.tags,J.content])))),G=m6.sign(V,OW);return T0([DW,{...J,id:A6(V),sig:A6(G)}])},m7=(W,Q)=>(d6[W]=Q,T0(["REQ",W,{kinds:[wW(Q)],since:xW(),"#x":[Q]}])),_7=(W)=>(delete d6[W],T0(["CLOSE",W])),i6=(({init:W,subscribe:Q,announce:J})=>{const V={};let G,X,Y=!1;return(q,F,U)=>{const{appId:K}=q;if(V[K]?.[F])return V[K][F];if(!q\|\|!F\|\|!K&&!q.firebaseApp)throw S0(q?F?"appId missing":"roomId required":"config required");let $=vV;if(!Y){const Z=W(q);X=c6(20,()=>L6(!0,q)),G=Array.isArray(Z)?Z:[Z];const H=setInterval(()=>{X=X.filter((M)=>{const k=Date.now()-M.created<57333;return k\|\|M.destroy(),k})},57333);V.offerCleanupTimer\|\|=H,Y=!0}const P={},z={},C=j8(Z0,K,F),S=C8(C),T=C8(j8(C,z1)),p=(async(Z,H,M)=>{const k=await crypto.subtle.digest("SHA-256",t0(`${Z}:${H}:${M}`));return crypto.subtle.importKey("raw",k,{name:_6},!1,["encrypt","decrypt"])})(q.password\|\|"",K,F),f=(Z)=>async(H)=>({type:H.type,sdp:await Z(p,H.sdp)}),u=f(xV),w=f(OV),c=(Z,H)=>{z[H]!==Z&&(z[H]?.destroy(),z[H]=Z,$(Z,H),P[H]?.forEach((M)=>M!==Z&&M.destroy()),delete P[H])},i=(Z,H)=>{z[H]===Z&&delete z[H]},D=k1(G.map(async(Z,H)=>{return Q(await Z,await S,await T,(M=H,async(k,j,O)=>{const[L,x]=await k1([S,T]);if(k!==L&&k!==x)return;const{peerId:B,offer:v,answer:b}=typeof j=="string"?S8(j):j;if(B!==z1&&!z[B])if(v){if(P[B]?.[M]&&z1>B)return;const A=L6(!1,q);A.setHandlers({connect(){return c(A,B)},close(){return i(A,B)}});try{const h=await u(v);if(A.isDead)return;const[d,l]=await k1([C8(j8(C,B)),A.signal(h).then(w)]);O(d,T0({peerId:z1,answer:l}))}catch{U?.({error:"decryption failed (offer)",appId:K,peerId:B,roomId:F})}}else if(b){const A=P[B]?.[M];if(!A\|\|A.isDead)return;A.setHandlers({connect(){return c(A,B)},close(){return i(A,B)}});try{A.signal(await u(b))}catch{U?.({error:"decryption failed (answer)",appId:K,peerId:B,roomId:F})}}else{if(P[B]?.[M])return;const A=X.pop()\|\|L6(!0,q),[h,{offer:d}]=await k1([C8(j8(C,B)),A.offerPromise.then(w).then((l)=>({offer:l}))]);P[B]\|\|=[],P[B][M]=A,A.setHandlers({connect(){return c(A,B)},close(){return i(A,B)}}),O(h,T0({peerId:z1,offer:d,peer:A}))}}));var M})),R=[];D.then((Z)=>{G.forEach((H,M)=>{const k=async()=>{const j=await J(await H,await S,await T);R[M]=setTimeout(k,typeof j=="number"?j:5333)};k()}),V[K][F].onCleanup=()=>{delete V[K][F],R.forEach(clearTimeout),Z.forEach((H)=>H()),Object.keys(V).length===0&&(clearInterval(V.offerCleanupTimer),delete V.offerCleanupTimer)}}),V[K]\|\|={};const N=gV((Z)=>$=Z,(Z)=>delete z[Z],()=>N.onCleanup?.());return V[K][F]=N}})({init(W){return EV(W,fV,5,!0).map((Q)=>{const J=((V,G)=>{const X={};let Y=null;const q=()=>{Y&&(clearTimeout(Y),Y=null);const F=new WebSocket(V);F.onclose=()=>{M8[V]??=3333,Y=setTimeout(q,M8[V]),M8[V]=2},F.onmessage=(U)=>G(U.data),X.socket=F,X.url=F.url,X.ready=new Promise((U)=>{F.onopen=()=>{M8[V]=3333,U(X)}}),X.send=(U)=>{F.readyState===1&&F.send(U)}};return X.forceReconnect=q,q(),LW[V]=X,X})(Q,(V)=>{const[G,X,Y,q]=S8(V);if(G===DW)i1[X]?.(d6[X],Y.content);else{const F=`${Z0}: relay failure from ${J.url} - `;G==="NOTICE"?console.warn(F+X):G!=="OK"\|\|Y\|\|console.warn(F+q)}});return IW[Q]=J,J.ready})},subscribe(W,Q,J,V){const G=T6(64),X=T6(64);return i1[G]=i1[X]=(Y,q)=>V(Y,q,async(F,U)=>W.send(await u7(F,U))),W.send(m7(G,Q)),W.send(m7(X,J)),()=>{W.send(_7(G)),W.send(_7(X)),delete i1[G],delete i1[X]}},async announce(W,Q){return W.send(await u7(Q,T0({peerId:z1})))}}),OG=(c7=IW,()=>RW(SV(c7).map(([W,Q])=>[W,Q.socket]))),c7,fV=["black.nostrcity.club","eu.purplerelay.com","ftp.halifax.rwth-aachen.de/nostr","nostr.cool110.xyz","nostr.data.haus","nostr.mom","nostr.oxtr.dev","nostr.sathoarder.com","nostr.vulpem.com","playground.nostrcheck.me/relay","relay.agorist.space","relay.binaryrobot.com","relay.fountain.fm","relay.mostro.network","relay.nostraddress.com","relay.nostrdice.com","relay.nostromo.social","relay.oldenburg.cool","relay.snort.social","relay.verified-nostr.com","sendit.nosflare.com","yabu.me/v2","relay.damus.io"].map((W)=>"wss://"+W);function NW(W,Q,J){let V=Q.timestamp;if(V?.physical>Date.now()+7200000)V={physical:Date.now()+7200000,logical:V.logical};if(!W?.timestamp)return{resolved:!0,value:Q.value,timestamp:V};if(J.compare(V,W.timestamp)<=0)return{resolved:!1};return{resolved:!0,value:Q.value,timestamp:V}}function SW(W,Q=50){const J=`gdb_oplog_${W}`;let V=[];function G(){try{const Y=localStorage.getItem(J);V=Y?JSON.parse(Y):[]}catch(Y){console.error("\u274C GDB: Failed to load oplog from localStorage:",Y),V=[]}}function X(){try{localStorage.setItem(J,JSON.stringify(V))}catch(Y){console.error("\u274C GDB: Failed to save oplog to localStorage:",Y)}}return G(),{add(Y){if(V.push(Y),V.length>Q)V.shift();X()},getDelta(Y,q){if(!Y)return[...V];return V.filter((F)=>q(F.timestamp,Y)>0)},getOldest(){return V[0]},clear(){V=[],localStorage.removeItem(J)}}}var bV=()=>{const W=new Map,Q=async()=>{try{const F=await navigator.storage.getDirectory(),K=await(await F.getFileHandle("~opfs-sync-test",{create:!0})).createSyncAccessHandle?.();return await K?.close(),await F.removeEntry("~opfs-sync-test"),!!K}catch{return!1}};let J="idb";const V=(async()=>{if(await Q())J="sync";else try{const F=await navigator.storage.getDirectory(),K=await(await F.getFileHandle("~opfs-async-test",{create:!0})).createWritable?.();if(await K?.close(),await F.removeEntry("~opfs-async-test"),K)J="async";else J="idb"}catch{J="idb"}})(),G=async(F,U)=>{if(!W.has(F))W.set(F,[]);const K=W.get(F),$=K[K.length-1]\|\|Promise.resolve();let P;const z=new Promise((C)=>P=C);K.push(z);try{return await $,await U()}finally{if(K.shift(),P(),K.length===0)W.delete(F)}},X=(()=>{let F;const U=async()=>{if(!F)F=new Promise((K,$)=>{const P=indexedDB.open("opfs-fallback-db",1);P.onupgradeneeded=()=>P.result.createObjectStore("files"),P.onsuccess=()=>K(P.result),P.onerror=()=>$(P.error)});return F};return{getDB:U,get:async(K)=>{const $=await U();return new Promise((P,z)=>{const S=$.transaction("files","readonly").objectStore("files").get(K);S.onsuccess=()=>P(S.result\|\|new Uint8Array),S.onerror=()=>z(S.error)})},set:async(K,$)=>{const P=await U();return new Promise((z,C)=>{const T=P.transaction("files","readwrite").objectStore("files").put($,K);T.onsuccess=()=>z(),T.onerror=()=>C(T.error)})}}})(),Y=async(F)=>{await V;try{if(J==="idb"){const z=await X.get(F);return{type:"loaded",name:F,data:z}}const K=await(await navigator.storage.getDirectory()).getFileHandle(F);if(J==="sync"){let z;try{z=await K.createSyncAccessHandle();const C=z.getSize(),S=new Uint8Array(C),T=z.read(S,{at:0});return{type:"loaded",name:F,data:S.slice(0,T)}}finally{z?.close()}}const $=await K.getFile(),P=new Uint8Array(await $.arrayBuffer());return{type:"loaded",name:F,data:P}}catch(U){const K=U.name==="NotFoundError"?"File not found":U.message\|\|"Error reading file";return{type:"error",name:F,message:K}}},q=async(F,U)=>{if(await V,!(U instanceof Uint8Array))return{type:"error",name:F,message:"Content must be a Uint8Array"};return G(F,async()=>{try{if(J==="idb")return await X.set(F,U),{type:"saved",name:F};const $=await(await navigator.storage.getDirectory()).getFileHandle(F,{create:!0});if(J==="sync"){let P;try{P=await $.createSyncAccessHandle(),P.truncate(0),P.write(U,{at:0}),P.flush()}finally{P?.close()}}else{let P;try{P=await $.createWritable(),await P.write(U)}finally{await P?.close()}}return{type:"saved",name:F}}catch(K){return{type:"error",name:F,message:K.message\|\|"Error saving file"}}})};self.onmessage=async({data:F})=>{const{type:U,name:K,content:$}=F;await V;const P={load:()=>Y(K),save:()=>q(K,$)};try{const z=P[U],C=z?await z():{type:"error",message:`Unrecognized action type: ${U}`};self.postMessage(C)}catch(z){console.error("\u274C Worker unexpected error:",z),self.postMessage({type:"error",name:K,message:z.message\|\|"Unexpected worker error"})}}},vW=bV;var R1={$eq:(W,Q)=>W===Q,$ne:(W,Q)=>W!==Q,$gt:(W,Q)=>W>Q,$gte:(W,Q)=>W>=Q,$lt:(W,Q)=>W<Q,$lte:(W,Q)=>W<=Q,$in:(W,Q)=>Array.isArray(Q)&&(Array.isArray(W)?W.some((J)=>Q.includes(J)):Q.includes(W)),$between:(W,[Q,J])=>W>=Q&&W<=J,$exists:(W,Q)=>Q?W!==void 0:W===void 0,$text:{global:(W,Q)=>{const J=(G)=>String(G).normalize("NFD").replace(/[\u0300-\u036f]/g,"").toLowerCase().replace(/[^\w\s]/g,""),V=J(Q);return Object.values(W).some((G)=>typeof G==="object"?null.fieldSearch(G,V):J(G).includes(V))},field:(W,Q)=>{const J=(G)=>String(G).normalize("NFD").replace(/[\u0300-\u036f]/g,"").toLowerCase().replace(/[^\w\s]/g,""),V=J(Q);return Array.isArray(W)?W.some((G)=>J(G).includes(V)):J(W).includes(V)}},$like:(W,Q)=>typeof W==="string"&&typeof Q==="string"&&new RegExp(`^${Q.replace(/%/g,".").replace(/_/g,".")}\$`,"i").test(W),$regex:(W,Q)=>typeof W==="string"&&new RegExp(Q.$regex\|\|Q,"i").test(W),$and:(W,Q,J)=>Q.every((V)=>J.createFilter(V,J.allNodes)(W)),$or:(W,Q,J)=>Q.some((V)=>J.createFilter(V,J.allNodes)(W)),$not:(W,Q,J)=>!J.createFilter(Q,J.allNodes)(W),$edge:(W,Q,J)=>{if(!W.edges?.length\|\|typeof Q!=="object"\|\|Q===null)return!1;const V=J.createFilter(Q,J.allNodes),G=[...W.edges],X=new Set(G).add(W.id),Y=[];while(G.length){const q=G.shift(),F=J.allNodes[q];if(!F)continue;if(V(F))Y.push(F);F.edges?.forEach((U)=>!X.has(U)&&X.add(U)&&G.push(U))}if(Y.length)W._edgeResult=Y;return Y.length>0}},l6=(W,Q)=>Q.split(".").reduce((J,V)=>J&&typeof J==="object"&&(V in J)?J[V]:void 0,W),T8=(W,Q)=>{if(Object.keys(W).length===0)return()=>!0;return(J)=>Object.entries(W).every(([V,G])=>{if(V.startsWith("$"))return R1[V](J,G,{createFilter:T8,allNodes:Q});const X=l6(J.value,V);if(typeof G!=="object"\|\|G===null)return R1.$eq(X,G);return Object.entries(G).every(([Y,q])=>{if(Y==="$text")return R1.$text.field(X,q);if(Y==="$between"&&q.every((F)=>F instanceof Date))return R1.$between(new Date(X),q);return R1[Y]?.(X,q,{createFilter:T8,allNodes:Q})??!1})})},r6=(W,Q)=>{const{$edge:J,...V}=Q.query\|\|{},G=T8(V,W),X=Object.values(W).filter(G);let q=[...J?(()=>{const F=T8({$edge:J},W);X.forEach((K)=>F(K));const U=new Map;return X.forEach((K)=>{if(K._edgeResult)K._edgeResult.forEach(($)=>U.set($.id,$)),delete K._edgeResult}),Array.from(U.values())})():X];if(Q.field){const F=Q.order==="asc"?1:-1;q.sort((U,K)=>{const $=l6(U.value,Q.field),P=l6(K.value,Q.field);if(typeof $==="string"&&typeof P==="string")return $.localeCompare(P)F;return(($??0)-(P??0))F})}if(Q.$after){const F=q.findIndex((U)=>U.id===Q.$after);q=F>=0?q.slice(F+1):[]}if(Q.$before){const F=q.findIndex((U)=>U.id===Q.$before);q=F>=0?q.slice(0,F):[]}if(Q.$limit)q=q.slice(0,Q.$limit);return q};function AW(){let W=Date.now(),Q=0;return{now(){const J=Date.now();return W=Math.max(W,J),Q++,{physical:W,logical:Q}},update(J){if(!J\|\|typeof J.physical!=="number"\|\|typeof J.logical!=="number"){console.warn("\u26A0\uFE0F HybridClock.update received an invalid remote timestamp.",J);return}W=Math.max(W,J.physical),Q=Math.max(Q,J.logical)+1},compare(J,V){if(!J&&!V)return 0;if(!J)return-1;if(!V)return 1;if(J.physical>V.physical)return 1;if(J.physical<V.physical)return-1;if(J.logical>V.logical)return 1;if(J.logical<V.logical)return-1;return 0}}}var TW=function(W,Q){return W.length===Q.length&&W.every((J,V)=>J===Q[V])};async function mV(){if(console.info(navigator?.storage?.getDirectory?"\u2705 OPFS is enabled.":"\uD83D\uDEAB OPFS is not available."),navigator?.storage?.getDirectory)await navigator.storage.getDirectory()}var _V=function(){const W={nodes:{}};return{get nodes(){return W.nodes},set nodes(J){W.nodes=J\|\|{}},upsert(J,V,G){const X=W.nodes[J];W.nodes[J]={id:J,value:V&&typeof V==="object"?hV(V):V,edges:X?.edges?[...X.edges]:[],timestamp:G}},get(J){return W.nodes[J]\|\|null},link(J,V,G){const X=W.nodes[J],Y=W.nodes[V];if(X&&Y&&!X.edges.includes(V))W.nodes[J]={...X,edges:[...X.edges,V],timestamp:G}},getAllNodes(){return Object.values(W.nodes)},serialize(){return c1.deflate(t1(W.nodes))},deserialize(J){W.nodes=Q8(c1.inflate(new Uint8Array(J)))}}};async function mG(W,Q={}){const{password:J,sm:V=!1,ii:G=!1,rx:X=!1,ai:Y=!1,geo:q=!1,relayUrls:F=null,turnConfig:U=null,saveDelay:K=200,oplogSize:$=20}=Q,P=_V(),z=AW(),C=SW(W,$),S=[];let T=null,p=[],f=null,u=null,w=null,c=null;const i=[],D={};Object.defineProperties(D,{hybridClock:{get:()=>z},graph:{get:()=>P},syncChannel:{get:()=>u},ready:{get:()=>Promise.resolve(!0)}});async function R(I,g){const y=new URL(`./${I}.min.js`,import.meta.url).href,o=`https://cdn.jsdelivr.net/npm/genosdb@latest/dist/${I}.min.js`;try{const E=await import(y).catch(()=>{return console.warn(`\u26A0\uFE0F ${I} not found locally, loading from CDN...`),import(o)}),_=g&&typeof g==="object"?g:{},m=typeof E.init==="function"?E.init(D,E,_):null;if(m)Object.assign(D,m);return E}catch(E){throw console.error(`\u274C Initialization of ${I} failed:`,E),E}}function N(){const I=localStorage.getItem(`${W}_time`);T=I?JSON.parse(I):null}function Z(I){T=I,localStorage.setItem(`${W}_time`,JSON.stringify(I))}function H(){try{const I=URL.createObjectURL(new Blob([`(${vW.toString()})()`],{type:"application/javascript"}));f=new Worker(I),URL.revokeObjectURL(I),f.addEventListener("message",({data:g})=>{console.info(`\uD83D\uDCBE ${g.name} ${g.type}`)}),console.info("\u2699\uFE0F Worker initialized successfully.")}catch({message:I}){console.error("\u274C Failed to initialize worker:",I)}}function M(){const I={...P.nodes};p.forEach((g)=>g(I))}const k=uV(()=>M()),j=gW(async()=>{const I=i.splice(0,i.length);if(!I.length)return!1;return await u.send(I),!0},16);async function O(){return crypto.randomUUID()}async function L(){try{const g=await((y)=>new Promise((o,E)=>{const _=async({data:m})=>{if(m.type==="loaded"&&m.name===y)f.removeEventListener("message",_),o(new Uint8Array(m.data));else if(m.type==="error")f.removeEventListener("message",_),E(new Error(m.message\|\|"Unknown error"))};f.addEventListener("message",_),f.postMessage({type:"load",name:y})}))(`${W}_graph.msgpack`).catch(()=>new Uint8Array);g.byteLength>0?P.deserialize(g):console.warn("\u26A0\uFE0F The file '_graph.msgpack' is empty or could not be loaded."),console.info(`\u2705 Graph loaded: [ ${P.getAllNodes().length} nodes ]`)}catch({message:I}){console.error("\u274C Error loading the graph:",I)}}async function x(){try{const I=P.serialize();return await((y,o)=>new Promise((E,_)=>{const m=({data:r})=>{if(r.type==="saved"&&r.name===y)f.removeEventListener("message",m),E();else if(r.type==="error")f.removeEventListener("message",m),_(new Error(r.message\|\|"Save error"))};f.addEventListener("message",m),f.postMessage({type:"save",name:y,content:o})}))(`${W}_graph.msgpack`,I),w.postMessage("update"),!0}catch({message:I}){throw console.error("\u274C Save error:",I),new Error("Save failed")}}const B=gW(()=>x(),K);async function v(I){try{console.info("\uD83D\uDD04 Applying full graph from remote..."),P.nodes={...I.nodes},await x()}catch({message:g}){console.error(`\u274C Error applying the full graph: ${g}`)}}async function b(I){let g=!1,y=null;const o={upsert:(E)=>{const _=P.get(E.id),m=NW(_,E,z);if(m.resolved){if(P.upsert(E.id,m.value,m.timestamp),z.update(m.timestamp),C.add({type:"upsert",id:E.id,timestamp:m.timestamp}),g=!0,!y\|\|z.compare(m.timestamp,y)>0)y=m.timestamp}},remove:(E)=>{const _=P.get(E.id);if(_&&z.compare(_.timestamp,E.timestamp)<0){if(delete P.nodes[E.id],z.update(E.timestamp),C.add({type:"remove",id:E.id,timestamp:E.timestamp}),g=!0,!y\|\|z.compare(E.timestamp,y)>0)y=E.timestamp}},link:(E)=>{const _=P.get(E.sourceId),m=P.get(E.targetId);if(_&&m&&z.compare(_.timestamp,E.timestamp)<0){if(P.link(E.sourceId,E.targetId,E.timestamp),z.update(E.timestamp),C.add({type:"link",sourceId:E.sourceId,targetId:E.targetId,timestamp:E.timestamp}),g=!0,!y\|\|z.compare(E.timestamp,y)>0)y=E.timestamp}},sync:async(E)=>{const _=E.timestamp;if(_===null){console.info("\uD83D\uDCEC [SYNC REQUEST] from new peer (no timestamp). Sending full graph."),await u.send([{type:"syncReceive",graph:P}]);return}console.info("\uD83D\uDCEC [SYNC REQUEST] since:",new Date(_.physical).toLocaleString());const m=C.getOldest();if(m&&z.compare(_,m.timestamp)<0){console.info("\uD83D\uDCA5 [FALLBACK TRIGGERED] Peer is too far behind. Sending FULL graph state."),await u.send([{type:"syncReceive",graph:P}]);return}const r=C.getDelta(_,z.compare);if(r.length>0){const n=r.map((W0)=>{if(W0.type==="upsert"){const G0=P.get(W0.id);return{...W0,value:G0?G0.value:null}}return W0}),e=c1.deflate(t1(n));console.info(`\uD83D\uDE80 [DELTA SYNC SENDING] Found ${r.length} new operations to send.`),await u.send([{type:"deltaSync",operations:e}])}else console.info("\u2705 [ALREADY SYNCED] Peer is up-to-date. Nothing to send.")},deltaSync:(E)=>{console.info("\uD83D\uDEF0\uFE0F [DELTA SYNC RECEIVED] Applying delta from a peer.");let _=Q8(c1.inflate(E.operations));for(let m of _)o[m.type]?.(m)},syncReceive:async(E)=>{if(console.info("\uD83D\uDCE6 [FULL SYNC RECEIVED] Overwriting local state with full graph from a peer."),E.graph&&E.graph.nodes){await v(E.graph),C.clear(),console.info("\uD83D\uDD12 Oplog has been cleared due to full sync."),g=!0;let _=null;for(let m in E.graph.nodes){const r=E.graph.nodes[m];if(r.timestamp&&(!_\|\|z.compare(r.timestamp,_)>0))_=r.timestamp}if(_)console.info("\uD83D\uDCC8 [GLOBAL TIMESTAMP] Updated from full sync."),y=_,z.update(_)}else console.error("\u274C Full sync failed: received graph data is invalid.",E.graph)}};for(let E of I)if(o[E.type])await o[E.type](E);else console.warn(`\uD83E\uDD37\u200D\u2640\uFE0F [UNKNOWN MESSAGE TYPE] Received unhandled message type: "${E.type}"`);if(y){if(!T\|\|z.compare(y,T)>0)console.info(`\uD83D\uDCC8 [GLOBAL TIMESTAMP] Advanced from ${T?.logical} to ${y.logical}.`),Z(y)}if(g)console.info("\uD83D\uDCBE [STATE CHANGED] Saving state and emitting update."),await x(),M()}Object.assign(D,{use(I){if(typeof I==="function")S.push(I)},async put(I,g){const y=z.now();Z(y),g??=await O(),P.upsert(g,I,y),C.add({type:"upsert",id:g,timestamp:y}),B();try{i.push({type:"upsert",id:g,value:I,timestamp:y}),j().catch(()=>{})}finally{k()}return g},async link(I,g){const y=z.now();if(!P.nodes[I]\|\|!P.nodes[g]){console.warn(`\u26A0\uFE0F One or both nodes (${I}, ${g}) do not exist.`);return}P.link(I,g,y),C.add({type:"link",sourceId:I,targetId:g,timestamp:y}),B(),Z(y);try{i.push({type:"link",sourceId:I,targetId:g,timestamp:y}),j().catch(()=>{})}finally{k()}},async remove(I){const g=z.now(),y=P.get(I);if(!y)return console.warn(`\u26A0\uFE0F Node with ID '${I}' not found.`);delete P.nodes[I],C.add({type:"remove",id:I,timestamp:g}),Object.values(P.nodes).forEach((o)=>o.edges=o.edges.filter((E)=>E!==I)),B(),Z(g);try{i.push({type:"remove",id:I,value:y.value,timestamp:g}),j().catch(()=>{})}finally{k()}},async get(I,g=null){if(typeof I!=="string")return{result:null};const y=P.get(I);if(!y){if(g)g(null);return{result:null}}const o=(m)=>{if(!m)return null;const r=m.value!==null&&typeof m.value==="object"?{...m.value}:m.value;return{...m,value:r}};if(!g)return{result:o(y)};let E=y.timestamp;g(o(y));const _=(m)=>{const r=m[I];if(r){if(z.compare(r.timestamp,E)>0)E=r.timestamp,g(o(r))}else g(null),p.splice(p.indexOf(_),1)};return p.push(_),{result:o(y),unsubscribe:()=>{const m=p.indexOf(_);if(m>-1)p.splice(m,1)}}},async map(...I){let y={...{realtime:!1,query:{},field:null,order:"asc",$limit:null,$after:null,$before:null}},o=null,E=!1;I.forEach((n)=>typeof n==="function"?o=n:n&&typeof n==="object"&&(E\|\|=("realtime"in n),Object.assign(y,n))),o&&!E&&(y.realtime=!0);let _=r6(P.nodes,y),m=null;const r=(n)=>{const e=n.filter((J0)=>!_.some((H0)=>H0.id===J0.id)),W0=_.filter((J0)=>!n.some((H0)=>H0.id===J0.id)),G0=n.filter((J0)=>{const H0=_.find((yW)=>yW.id===J0.id),g8=[...J0.edges\|\|[]],E8=[...H0?.edges\|\|[]],EW=!!H0&&((J0.timestamp?.physical\|\|0)!==(H0.timestamp?.physical\|\|0)\|\|(J0.timestamp?.logical\|\|0)!==(H0.timestamp?.logical\|\|0));return H0&&(EW\|\|!TW(g8,E8))}),O0=(J0,H0)=>{const g8=H0==="removed"?null:J0.value,E8={id:J0.id,value:g8,edges:J0.edges\|\|[],timestamp:J0.timestamp\|\|null,action:H0};o(E8)};e.forEach((J0)=>O0(J0,"added")),W0.forEach((J0)=>O0(J0,"removed")),G0.forEach((J0)=>O0(J0,"updated"))};if(o){if(_.forEach((n)=>{o({id:n.id,value:n.value,edges:n.edges,timestamp:n.timestamp,action:"initial"})}),y.realtime){const n=(e)=>{const W0=e.timestamp?.physical\|\|0,G0=e.timestamp?.logical\|\|0,O0=(e.edges\|\|[]).join(",");return`${e.id}:${W0}:${G0}:${O0}`};m=(e)=>{const W0=r6(e,y);if(W0.length!==_.length)r(W0),_=W0;else{const G0=W0.map(n),O0=_.map(n);if(!TW(G0,O0))r(W0),_=W0}},p.push(m)}}return{results:_,...y.realtime&&o&&m&&{unsubscribe:()=>{const n=p.indexOf(m);n>-1&&p.splice(n,1)}}}},async clear(){P.nodes={};try{await(await navigator.storage.getDirectory()).removeEntry(`${W}_graph.msgpack`)}catch({message:I}){console.warn(`\u26A0\uFE0F Error deleting _graph.msgpack: ${I}`)}M(),console.info("\u2705 All data has been deleted.")}}),H(),N(),await mV(),await L();const A=[];if(V)A.push(R("sm",V));if(Y)A.push(R("AIQuery",Y));if(X)A.push(R("radixindex",X));if(G)A.push(R("invertedindex",G));if(q)A.push(R("geo",q));await Promise.all(A);const h=`graph-sync-room-${W}`,d={appId:"1234",...J&&{password:J}};if(F)d.relayUrls=F;if(U)d.turnConfig=U;const l=i6(d,h);return u=l.channel("syncGraph"),c=i6(d,`app-sync-${W}`),D.room=c,l.on("peer:join",async(I)=>{console.info("\u26A1 New peer connected:",I),u.send([{type:"sync",timestamp:T}])}),l.on("peer:leave",(I)=>{console.info("\u26A1 Peer disconnected:",I)}),u.on("message",async(I)=>{let g=I;for(let y of S)try{if(g=await y(g),!g\|\|g.length===0)return}catch(o){console.error("\u274C GDB: Middleware error, discarding message.",o);return}await b(g)}),w=new BroadcastChannel(`graphdb_sync_${W}`),w.onmessage=async(I)=>{if(I.data==="update")console.info("\uD83D\uDD04 Update received from another tab..."),await L(),N(),k()},console.info(`\u2705 GenosDB [ ${W} ] instance is ready.`),D}var hV=(W)=>{if(W===null\|\|typeof W!=="object")return W;if(typeof structuredClone==="function")return structuredClone(W);return JSON.parse(JSON.stringify(W))},gW=(W,Q=16)=>{let J=null,V=null;return(...G)=>{if(!V)V={},V.promise=new Promise((Y,q)=>(V.resolve=Y,V.reject=q));if(J)("cancelIdleCallback"in window?cancelIdleCallback:clearTimeout)(J);const X=async()=>{J=null;try{V.resolve(await W(...G))}catch(Y){V.reject(Y)}finally{V=null}};return J=("requestIdleCallback"in window)?requestIdleCallback(X,{timeout:Q}):setTimeout(X,Q),V.promise}},uV=(W)=>{let Q=null;return()=>{if(Q!==null)return;Q=requestAnimationFrame(()=>{Q=null,W()})}};export{mG as gdb};