msgpackr 1.7.1 → 1.8.0

package/dist/index.min.js

@@ -1,84 +1,2 @@
-(function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):(e=e||self,t(e.msgpackr={}))})(this,function(e){"use strict";var t=Math.floor;function n(e){try{if(!F.trusted&&!q){let e=M.sharedLength||0;e<M.length&&(M.length=e)}let t;if(F.randomAccessStructure&&64>R[z]&&32<=R[z]&&Y?(t=Y(R,z,E,F),R=null,!(e&&e.lazy)&&t&&(t=t.toJSON()),z=E):t=s(),C&&(// bundled strings to skip past
-z=C.postBundlePosition),z==E)M&&M.restoreStructures&&r(),M=null,R=null,D&&(D=null);else if(z>E)// over read
-throw new Error("Unexpected end of MessagePack data");else if(!q)throw new Error("Data read, but end of buffer not reached "+JSON.stringify(t).slice(0,100));// else more to read, but we are reading sequentially, so don't clear source yet
-return t}catch(e){throw M&&M.restoreStructures&&r(),m(),(e instanceof RangeError||e.message.startsWith("Unexpected end of buffer")||z>E)&&(e.incomplete=!0),e}}function r(){for(let e in M.restoreStructures)M[e]=M.restoreStructures[e];M.restoreStructures=null}function s(){let e=R[z++];if(160>e){if(!(128>e)){if(!(144>e)){e-=144;let t=Array(e);for(let n=0;n<e;n++)t[n]=s();return F.freezeData?Object.freeze(t):t}if(e-=128,F.mapsAsObjects){let t={};for(let n,r=0;r<e;r++)n=h(),"__proto__"===n&&(n="__proto_"),t[n]=s();return t}else{let t=new Map;for(let n=0;n<e;n++)t.set(s(),s());return t}}else if(64>e)return e;else{let t=M[63&e]||F.getStructures&&o()[63&e];return t?(t.read||(t.read=i(t,63&e)),t.read()):e}}else if(192>e){// fixstr
-let t=e-160;if(N>=z)return B.slice(z-P,(z+=t)-P);if(0==N&&140>E){// for small blocks, avoiding the overhead of the extract call is helpful
-let e=16>t?g(t):c(t);if(null!=e)return e}return K(t)}else{let t;switch(e){case 192:return null;case 193:return C?(t=s(),0<t?C[1].slice(C.position1,C.position1+=t):C[0].slice(C.position0,C.position0-=t)):W;// "never-used", return special object to denote that
-case 194:return!1;case 195:return!0;case 196:if(t=R[z++],void 0===t)throw new Error("Unexpected end of buffer");return l(t);case 197:return t=T.getUint16(z),z+=2,l(t);case 198:return t=T.getUint32(z),z+=4,l(t);case 199:// ext 8
-return f(R[z++]);case 200:return t=T.getUint16(z),z+=2,f(t);case 201:return t=T.getUint32(z),z+=4,f(t);case 202:if(t=T.getFloat32(z),2<F.useFloat32){// this does rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
-let e=ie[(127&R[z])<<1|R[z+1]>>7];return z+=4,(e*t+(0<t?.5:-.5)>>0)/e}return z+=4,t;case 203:return t=T.getFloat64(z),z+=8,t;// uint handlers
-case 204:return R[z++];case 205:return t=T.getUint16(z),z+=2,t;case 206:return t=T.getUint32(z),z+=4,t;case 207:return F.int64AsNumber?(t=4294967296*T.getUint32(z),t+=T.getUint32(z+4)):t=T.getBigUint64(z),z+=8,t;// int handlers
-case 208:return T.getInt8(z++);case 209:return t=T.getInt16(z),z+=2,t;case 210:return t=T.getInt32(z),z+=4,t;case 211:return F.int64AsNumber?(t=4294967296*T.getInt32(z),t+=T.getUint32(z+4)):t=T.getBigInt64(z),z+=8,t;case 212:if(t=R[z++],114==t)return ne(63&R[z++]);else{let e=j[t];if(e)return e.read?(z++,e.read(s())):e.noBuffer?(z++,e()):e(R.subarray(z,++z));throw new Error("Unknown extension "+t)}case 213:return t=R[z],114==t?(z++,ne(63&R[z++],R[z++])):f(2);case 214:// fixext 4
-return f(4);case 215:// fixext 8
-return f(8);case 216:// fixext 16
-return f(16);case 217:return t=R[z++],N>=z?B.slice(z-P,(z+=t)-P):Q(t);case 218:return t=T.getUint16(z),z+=2,N>=z?B.slice(z-P,(z+=t)-P):X(t);case 219:return t=T.getUint32(z),z+=4,N>=z?B.slice(z-P,(z+=t)-P):Z(t);case 220:return t=T.getUint16(z),z+=2,u(t);case 221:return t=T.getUint32(z),z+=4,u(t);case 222:return t=T.getUint16(z),z+=2,d(t);case 223:return t=T.getUint32(z),z+=4,d(t);default:// negative int
-if(224<=e)return e-256;if(void 0===e){let e=new Error("Unexpected end of MessagePack data");throw e.incomplete=!0,e}throw new Error("Unknown MessagePack token "+e);}}}function i(e,t){function n(){// This initial function is quick to instantiate, but runs slower. After several iterations pay the cost to build the faster function
-if(n.count++>$){let n=e.read=new Function("r","return function(){return "+(F.freezeData?"Object.freeze":"")+"({"+e.map(e=>"__proto__"===e?"__proto_:r()":G.test(e)?e+":r()":"["+JSON.stringify(e)+"]:r()").join(",")+"})}")(s);return 0===e.highByte&&(e.read=H(t,e.read)),n();// second byte is already read, if there is one so immediately read object
-}let r={};for(let t,n=0,i=e.length;n<i;n++)t=e[n],"__proto__"===t&&(t="__proto_"),r[t]=s();return F.freezeData?Object.freeze(r):r}return n.count=0,0===e.highByte?H(t,n):n}function o(){let e=y(()=>(R=null,F.getStructures()));return M=F._mergeStructures(e,M)}function a(e){let t;if(16>e&&(t=g(e)))return t;if(64<e&&x)return x.decode(R.subarray(z,z+=e));const n=z+e,r=[];for(t="";z<n;){const e=R[z++];if(0==(128&e))r.push(e);else if(192==(224&e)){// 2 bytes
-const t=63&R[z++];r.push((31&e)<<6|t)}else if(224==(240&e)){// 3 bytes
-const t=63&R[z++],n=63&R[z++];r.push((31&e)<<12|t<<6|n)}else if(240==(248&e)){// 4 bytes
-const t=63&R[z++],n=63&R[z++],s=63&R[z++];let i=(7&e)<<18|t<<12|n<<6|s;65535<i&&(i-=65536,r.push(55296|1023&i>>>10),i=56320|1023&i),r.push(i)}else r.push(e);4096<=r.length&&(t+=ee.apply(String,r),r.length=0)}return 0<r.length&&(t+=ee.apply(String,r)),t}function u(e){let t=Array(e);for(let n=0;n<e;n++)t[n]=s();return F.freezeData?Object.freeze(t):t}function d(e){if(F.mapsAsObjects){let t={};for(let n,r=0;r<e;r++)n=h(),"__proto__"===n&&(n="__proto_"),t[n]=s();return t}else{let t=new Map;for(let n=0;n<e;n++)t.set(s(),s());return t}}function c(e){let t=z,n=Array(e);for(let r=0;r<e;r++){const e=R[z++];if(0<(128&e))return void(z=t);n[r]=e}return ee.apply(String,n)}function g(t){if(4>t){if(!(2>t)){let e=R[z++],n=R[z++];if(0<(128&e)||0<(128&n))return void(z-=2);if(3>t)return ee(e,n);let r=R[z++];return 0<(128&r)?void(z-=3):ee(e,n,r)}if(0===t)return"";else{let e=R[z++];return 1<(128&e)?void(z-=1):ee(e)}}else{let r=R[z++],s=R[z++],a=R[z++],u=R[z++];if(0<(128&r)||0<(128&s)||0<(128&a)||0<(128&u))return void(z-=4);if(6>t){if(4===t)return ee(r,s,a,u);else{let t=R[z++];return 0<(128&t)?void(z-=5):ee(r,s,a,u,t)}}else if(8>t){let n=R[z++],e=R[z++];if(0<(128&n)||0<(128&e))return void(z-=6);if(7>t)return ee(r,s,a,u,n,e);let i=R[z++];return 0<(128&i)?void(z-=7):ee(r,s,a,u,n,e,i)}else{let d=R[z++],e=R[z++],c=R[z++],g=R[z++];if(0<(128&d)||0<(128&e)||0<(128&c)||0<(128&g))return void(z-=8);if(10>t){if(8===t)return ee(r,s,a,u,d,e,c,g);else{let t=R[z++];return 0<(128&t)?void(z-=9):ee(r,s,a,u,d,e,c,g,t)}}else if(12>t){let n=R[z++],i=R[z++];if(0<(128&n)||0<(128&i))return void(z-=10);if(11>t)return ee(r,s,a,u,d,e,c,g,n,i);let o=R[z++];return 0<(128&o)?void(z-=11):ee(r,s,a,u,d,e,c,g,n,i,o)}else{let p=R[z++],i=R[z++],f=R[z++],h=R[z++];if(0<(128&p)||0<(128&i)||0<(128&f)||0<(128&h))return void(z-=12);if(!(14>t)){let l=R[z++],y=R[z++];if(0<(128&l)||0<(128&y))return void(z-=14);if(15>t)return ee(r,s,a,u,d,e,c,g,p,i,f,h,l,y);let n=R[z++];return 0<(128&n)?void(z-=15):ee(r,s,a,u,d,e,c,g,p,i,f,h,l,y,n)}if(12===t)return ee(r,s,a,u,d,e,c,g,p,i,f,h);else{let t=R[z++];return 0<(128&t)?void(z-=13):ee(r,s,a,u,d,e,c,g,p,i,f,h,t)}}}}}function p(){let e,t=R[z++];if(192>t)// fixstr
-e=t-160;else switch(t){case 217:e=R[z++];break;case 218:e=T.getUint16(z),z+=2;break;case 219:e=T.getUint32(z),z+=4;break;default:throw new Error("Expected string");}return a(e)}function l(e){return F.copyBuffers?// specifically use the copying slice (not the node one)
-Uint8Array.prototype.slice.call(R,z,z+=e):R.subarray(z,z+=e)}function f(e){let t=R[z++];if(j[t]){let n;return j[t](R.subarray(z,n=z+=e),e=>{z=e;try{return s()}finally{z=n}})}throw new Error("Unknown extension type "+t)}function h(){let e=R[z++];if(160<=e&&192>e){if(e-=160,N>=z)// if it has been extracted, must use it (and faster anyway)
-return B.slice(z-P,(z+=e)-P);if(!(0==N&&180>E))return K(e)}else return z--,s();let t,n=4095&(e<<5^(1<e?T.getUint16(z):0<e?R[z]:0)),r=te[n],o=z,a=z+e-3,u=0;if(r&&r.bytes==e){for(;o<a;){if(t=T.getUint32(o),t!=r[u++]){o=1879048192;break}o+=4}for(a+=3;o<a;)if(t=R[o++],t!=r[u++]){o=1879048192;break}if(o===a)return z=o,r.string;a-=3,o=z}for(r=[],te[n]=r,r.bytes=e;o<a;)t=T.getUint32(o),r.push(t),o+=4;for(a+=3;o<a;)t=R[o++],r.push(t);// for small blocks, avoiding the overhead of the extract call is helpful
-let d=16>e?g(e):c(e);return null==d?r.string=K(e):r.string=d}// the registration of the record definition extension (as "r")
-// notepack defines extension 0 to mean undefined, so use that as the default here
-// registration of bulk record definition?
-// currentExtensions[0x52] = () =>
-function y(e){let t=E,n=z,r=P,s=N,i=B,o=D,a=C,u=new Uint8Array(R.slice(0,E)),d=M,c=M.slice(0,M.length),g=F,p=q,l=e();return E=t,z=n,P=r,N=s,B=i,D=o,C=a,R=u,q=p,M=d,M.splice(0,M.length,...c),F=g,T=new DataView(R.buffer,R.byteOffset,R.byteLength),l}function m(){R=null,D=null,M=null}function b(e){j[e.type]=e.unpack?e.unpack:e}function S(e,t,n){let r=e.byteLength;if(256>r+1){var{target:s,position:i}=n(4+r);s[i++]=199,s[i++]=r+1}else if(65536>r+1){var{target:s,position:i}=n(5+r);s[i++]=200,s[i++]=r+1>>8,s[i++]=255&r+1}else{var{target:s,position:i,targetView:o}=n(7+r);// plus one for the type byte
-s[i++]=201,o.setUint32(i,r+1),i+=4}// "t" for typed array
-s[i++]=116,s[i++]=t,s.set(new Uint8Array(e.buffer,e.byteOffset,e.byteLength),i)}function k(e,t){let n=e.byteLength;var r,s;if(256>n){var{target:r,position:s}=t(n+2);r[s++]=196,r[s++]=n}else if(65536>n){var{target:r,position:s}=t(n+3);r[s++]=197,r[s++]=n>>8,r[s++]=255&n}else{var{target:r,position:s,targetView:i}=t(n+5);r[s++]=198,i.setUint32(s,n),s+=4}r.set(e,s)}function U(e,t,n,r){let s=e.length;return 1===s?t[n++]=212:2===s?t[n++]=213:4===s?t[n++]=214:8===s?t[n++]=215:16===s?t[n++]=216:256>s?(t[n++]=199,t[n++]=s):65536>s?(t[n++]=200,t[n++]=s>>8,t[n++]=255&s):(t[n++]=201,t[n++]=s>>24,t[n++]=255&s>>16,t[n++]=255&s>>8,t[n++]=255&s),t[n++]=r,t.set(e,n),n+=s,n}function _(e,t){// insert the ids that need to be referenced for structured clones
-let n,r=6*t.length,s=e.length-r;for(t.sort((e,t)=>e.offset>t.offset?1:-1);n=t.pop();){let t=n.offset,i=n.id;e.copyWithin(t+r,t,s),r-=6;let o=t+r;// 'i'
-e[o++]=214,e[o++]=105,e[o++]=i>>24,e[o++]=255&i>>16,e[o++]=255&i>>8,e[o++]=255&i,s=t}return e}function I(e,t,n){if(0<we.length){_e.setUint32(we.position+e,Ae+n-we.position-e);let r=we;we=null,t(r[0]),t(r[1])}}function O(e){if(e.Class){if(!e.pack&&!e.write)throw new Error("Extension has no pack or write function");if(e.pack&&!e.type)throw new Error("Extension has no type (numeric code to identify the extension)");he.unshift(e.Class),fe.unshift(e)}b(e)}function A(e,t){return e.isCompatible=e=>{let n=!e||(t.lastNamedStructuresLength||0)===e.length;return n||// we want to merge these existing structures immediately since we already have it and we are in the right transaction
-t._mergeStructures(e),n},e}function*w(e,t){const n=new xe(t);for(const r of e)yield n.pack(r)}async function*L(e,t){const n=new xe(t);for await(const r of e)yield n.pack(r)}/**
-	 * Given an Iterable/Iterator input which yields buffers, returns an IterableIterator which yields sync decoded objects
-	 * Or, given an Async Iterable/Iterator which yields promises resolving in buffers, returns an AsyncIterableIterator.
-	 * @param {Iterable|Iterator|AsyncIterable|AsyncIterableIterator} bufferIterator
-	 * @param {object} [options] - unpackr options
-	 * @returns {IterableIterator|Promise.<AsyncIterableIterator}
-	 */var x;try{x=new TextDecoder}catch(e){}var R,E,M,B,C,D,T,z=0,F={},P=0,N=0,j=[],V={useRecords:!1,mapsAsObjects:!0};class v{}const W=new v;W.name="MessagePack 0xC1";var Y,q=!1,$=2;try{new Function("")}catch(e){// if eval variants are not supported, do not create inline object readers ever
-$=1/0}class J{constructor(e){e&&(!1===e.useRecords&&e.mapsAsObjects===void 0&&(e.mapsAsObjects=!0),e.sequential&&!1!==e.trusted&&(e.trusted=!0,!e.structures&&!1!=e.useRecords&&(e.structures=[],!e.maxSharedStructures&&(e.maxSharedStructures=0))),e.structures?e.structures.sharedLength=e.structures.length:e.getStructures&&((e.structures=[]).uninitialized=!0,e.structures.sharedLength=0)),Object.assign(this,e)}unpack(e,t){if(R)// re-entrant execution, save the state and restore it after we do this unpack
-return y(()=>(m(),this?this.unpack(e,t):J.prototype.unpack.call(V,e,t)));"object"==typeof t?(E=t.end||e.length,z=t.start||0):(z=0,E=-1<t?t:e.length),N=0,B=null,C=null,R=e;// this provides cached access to the data view for a buffer if it is getting reused, which is a recommend
-// technique for getting data from a database where it can be copied into an existing buffer instead of creating
-// new ones
-try{T=e.dataView||(e.dataView=new DataView(e.buffer,e.byteOffset,e.byteLength))}catch(t){if(R=null,e instanceof Uint8Array)throw t;throw new Error("Source must be a Uint8Array or Buffer but was a "+(e&&"object"==typeof e?e.constructor.name:typeof e))}if(this instanceof J){if(F=this,this.structures)return M=this.structures,n(t);(!M||0<M.length)&&(M=[])}else F=V,(!M||0<M.length)&&(M=[]);return n(t)}unpackMultiple(e,t){let r,s=0;try{q=!0;let i=e.length,o=this?this.unpack(e,i):oe.unpack(e,i);if(t){for(t(o);z<i;)if(s=z,!1===t(n()))return;}else{for(r=[o];z<i;)s=z,r.push(n());return r}}catch(e){throw e.lastPosition=s,e.values=r,e}finally{q=!1,m()}}_mergeStructures(e,t){e=e||[],Object.isFrozen(e)&&(e=e.map(e=>e.slice(0)));for(let n,r=0,s=e.length;r<s;r++)n=e[r],n&&(n.isShared=!0,32<=r&&(n.highByte=r-32>>5));for(let n in e.sharedLength=e.length,t||[])if(0<=n){let r=e[n],s=t[n];s&&(r&&((e.restoreStructures||(e.restoreStructures=[]))[n]=r),e[n]=s)}return this.structures=e}decode(e,t){return this.unpack(e,t)}}const G=/^[a-zA-Z_$][a-zA-Z\d_$]*$/,H=(e,t)=>function(){let n=R[z++];if(0===n)return t();let r=32>e?-(e+(n<<5)):e+(n<<5),s=M[r]||o()[r];if(!s)throw new Error("Record id is not defined for "+r);return s.read||(s.read=i(s,e)),s.read()};var K=a,Q=a,X=a,Z=a;var ee=String.fromCharCode,te=Array(4096);const ne=(e,t)=>{let n;if(F.freezeData){F.freezeData=!1;try{n=s()}finally{F.freezeData=!0}}else n=s();let r=e;void 0!==t&&(e=32>e?-((t<<5)+e):(t<<5)+e,n.highByte=t);let o=M[e];return o&&o.isShared&&((M.restoreStructures||(M.restoreStructures=[]))[e]=o),M[e]=n,n.read=i(n,r),n.read()};j[0]=()=>{},j[0].noBuffer=!0,j[101]=()=>{let e=s();return(globalThis[e[0]]||Error)(e[1])},j[105]=()=>{// id extension (for structured clones)
-let e=T.getUint32(z-4);D||(D=new Map);let t,n=R[z];t=144<=n&&160>n||220==n||221==n?[]:{};let r={target:t};// a placeholder object
-D.set(e,r);let i=s();// read the next value as the target object to id
-return r.used?Object.assign(t,i):(r.target=i,i);// no cycle, can just use the returned read object
-},j[112]=()=>{// pointer extension (for structured clones)
-let e=T.getUint32(z-4),t=D.get(e);return t.used=!0,t.target},j[115]=()=>new Set(s());const re=["Int8","Uint8","Uint8Clamped","Int16","Uint16","Int32","Uint32","Float32","Float64","BigInt64","BigUint64"].map(e=>e+"Array");j[116]=e=>{let t=e[0],n=re[t];if(!n)throw new Error("Could not find typed array for code "+t);// we have to always slice/copy here to get a new ArrayBuffer that is word/byte aligned
-return new globalThis[n](Uint8Array.prototype.slice.call(e,1).buffer)},j[120]=()=>{let e=s();return new RegExp(e[0],e[1])};const se=[];j[98]=e=>{let t=(e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3],n=z;return z+=t-e.length,C=se,C=[p(),p()],C.position0=0,C.position1=0,C.postBundlePosition=z,z=n,s()},j[255]=e=>4==e.length?new Date(1e3*(16777216*e[0]+(e[1]<<16)+(e[2]<<8)+e[3])):8==e.length?new Date(((e[0]<<22)+(e[1]<<14)+(e[2]<<6)+(e[3]>>2))/1e6+1e3*(4294967296*(3&e[3])+16777216*e[4]+(e[5]<<16)+(e[6]<<8)+e[7])):12==e.length?new Date(((e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3])/1e6+1e3*((128&e[4]?-281474976710656:0)+1099511627776*e[6]+4294967296*e[7]+16777216*e[8]+(e[9]<<16)+(e[10]<<8)+e[11])):new Date("invalid");const ie=Array(147);// this is a table matching binary exponents to the multiplier to determine significant digit rounding
-for(let n=0;256>n;n++)ie[n]=+("1e"+t(45.15-.30103*n));var oe=new J({useRecords:!1});const ae=oe.unpack,ue=oe.unpackMultiple,de=oe.unpack,ce={NEVER:0,ALWAYS:1,DECIMAL_ROUND:3,DECIMAL_FIT:4};let ge,pe=new Float32Array(1),le=new Uint8Array(pe.buffer,0,4);try{ge=new TextEncoder}catch(e){}let fe,he;const ye="undefined"!=typeof Buffer,me=ye?function(e){return Buffer.allocUnsafeSlow(e)}:Uint8Array,be=ye?Buffer:Uint8Array,Se=ye?4294967296:2144337920;let ke,Ue,_e,Ie,Oe,Ae=0,we=null;const Le=Symbol("record-id");class xe extends J{constructor(e){super(e),this.offset=0;let t,n,r,s,i=be.prototype.utf8Write?function(e,t){return ke.utf8Write(e,t,4294967295)}:!!(ge&&ge.encodeInto)&&function(e,t){return ge.encodeInto(e,ke.subarray(t)).written},o=this;e||(e={});let a=e&&e.sequential,u=e.structures||e.saveStructures,d=e.maxSharedStructures;if(null==d&&(d=u?32:0),8160<d)throw new Error("Maximum maxSharedStructure is 8160");e.structuredClone&&null==e.moreTypes&&(e.moreTypes=!0);let c=e.maxOwnStructures;null==c&&(c=u?32:64),this.structures||!1==e.useRecords||(this.structures=[]);// two byte record ids for shared structures
-let g=32<d||64<c+d,p=d+64,l=d+c+64;if(8256<l)throw new Error("Maximum maxSharedStructure + maxOwnStructure is 8192");let f=[],h=0,y=0;this.pack=this.encode=function(e,i){if(ke||(ke=new me(8192),_e=ke.dataView=new DataView(ke.buffer,0,8192),Ae=0),Ie=ke.length-10,2048>Ie-Ae?(ke=new me(ke.length),_e=ke.dataView=new DataView(ke.buffer,0,ke.length),Ie=ke.length-10,Ae=0):Ae=2147483640&Ae+7,t=Ae,s=o.structuredClone?new Map:null,o.bundleStrings&&"string"!=typeof e?(we=[],we.size=1/0):we=null,r=o.structures,r){r.uninitialized&&(r=o._mergeStructures(o.getStructures()));let e=r.sharedLength||0;if(e>d)//if (maxSharedStructures <= 32 && structures.sharedLength > 32) // TODO: could support this, but would need to update the limit ids
-throw new Error("Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to "+r.sharedLength);if(!r.transitions){r.transitions=Object.create(null);for(let t,n=0;n<e;n++){if(t=r[n],!t)continue;let e,s=r.transitions;for(let n,r=0,i=t.length;r<i;r++)n=t[r],e=s[n],e||(e=s[n]=Object.create(null)),s=e;s[Le]=n+64}this.lastNamedStructuresLength=e}a||(r.nextId=e+64)}n&&(n=!1);try{if(o.randomAccessStructure&&e.constructor&&e.constructor===Object?w(e):m(e),s&&s.idsToInsert){let e=6*s.idsToInsert.length;we&&I(t,m,e),Ae+=e,Ae>Ie&&S(Ae),o.offset=Ae;let n=_(ke.subarray(t,Ae),s.idsToInsert);return s=null,n}// update the offset so next serialization doesn't write over our buffer, but can continue writing to same buffer sequentially
-return we&&I(t,m,0),o.offset=Ae,i&ze?(ke.start=t,ke.end=Ae,ke):ke.subarray(t,Ae);// position can change if we call pack again in saveStructures, so we get the buffer now
-}finally{if(r){10>y&&y++;let s=r.sharedLength||0;if(r.length>s&&(r.length=s),1e4<h)r.transitions=null,y=0,h=0,0<f.length&&(f=[]);else if(0<f.length&&!a){for(let e=0,t=f.length;e<t;e++)f[e][Le]=0;f=[]}if(n&&o.saveStructures){// we can't rely on start/end with REUSE_BUFFER_MODE since they will (probably) change when we save
-let n=ke.subarray(t,Ae),i=A(r,o);return!1===o.saveStructures(i,i.isCompatible)?o.pack(e):(o.lastNamedStructuresLength=s,n)}}i&Fe&&(Ae=t)}};const m=e=>{Ae>Ie&&(ke=S(Ae));var n,r=typeof e;if("string"==r){let r=e.length;if(we&&4<=r&&4096>r){if((we.size+=r)>61440){let e,n=(we[0]?3*we[0].length+we[1].length:0)+10;Ae+n>Ie&&(ke=S(Ae+n)),we.position?(ke[Ae]=200,Ae+=3,ke[Ae++]=98,e=Ae-t,Ae+=4,I(t,m),_e.setUint16(e+t-3,Ae-t-e)):(ke[Ae++]=214,ke[Ae++]=98,e=Ae-t,Ae+=4),we=["",""],we.size=0,we.position=e}let n=/[\u0080-\uFFFF]/.test(e);return we[n?0:1]+=e,ke[Ae++]=193,void m(n?-r:r)}let s=32>r?1:256>r?2:65536>r?3:5;// first we estimate the header size, so we can write to the correct location
-let o=3*r;if(Ae+o>Ie&&(ke=S(Ae+o)),64>r||!i){let t,i,o,a=Ae+s;for(t=0;t<r;t++)i=e.charCodeAt(t),128>i?ke[a++]=i:2048>i?(ke[a++]=192|i>>6,ke[a++]=128|63&i):55296==(64512&i)&&56320==(64512&(o=e.charCodeAt(t+1)))?(i=65536+((1023&i)<<10)+(1023&o),t++,ke[a++]=240|i>>18,ke[a++]=128|63&i>>12,ke[a++]=128|63&i>>6,ke[a++]=128|63&i):(ke[a++]=224|i>>12,ke[a++]=128|63&i>>6,ke[a++]=128|63&i);n=a-Ae-s}else n=i(e,Ae+s);32>n?ke[Ae++]=160|n:256>n?(2>s&&ke.copyWithin(Ae+2,Ae+1,Ae+1+n),ke[Ae++]=217,ke[Ae++]=n):65536>n?(3>s&&ke.copyWithin(Ae+3,Ae+2,Ae+2+n),ke[Ae++]=218,ke[Ae++]=n>>8,ke[Ae++]=255&n):(5>s&&ke.copyWithin(Ae+5,Ae+3,Ae+3+n),ke[Ae++]=219,_e.setUint32(Ae,n),Ae+=4),Ae+=n}else if("number"===r){if(e>>>0===e)32>e||128>e&&!1===this.useRecords||64>e&&!this.randomAccessStructure?ke[Ae++]=e:256>e?(ke[Ae++]=204,ke[Ae++]=e):65536>e?(ke[Ae++]=205,ke[Ae++]=e>>8,ke[Ae++]=255&e):(ke[Ae++]=206,_e.setUint32(Ae,e),Ae+=4);else if(e>>0===e)-32<=e?ke[Ae++]=256+e:-128<=e?(ke[Ae++]=208,ke[Ae++]=e+256):-32768<=e?(ke[Ae++]=209,_e.setInt16(Ae,e),Ae+=2):(ke[Ae++]=210,_e.setInt32(Ae,e),Ae+=4);else{let t;if(0<(t=this.useFloat32)&&4294967296>e&&-2147483648<=e){ke[Ae++]=202,_e.setFloat32(Ae,e);let n;if(4>t||// this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
-(n=e*ie[(127&ke[Ae])<<1|ke[Ae+1]>>7])>>0===n)return void(Ae+=4);// move back into position for writing a double
-Ae--}ke[Ae++]=203,_e.setFloat64(Ae,e),Ae+=8}}else if("object"===r){if(!e)ke[Ae++]=192;else{if(s){let n=s.get(e);if(n){if(!n.id){let e=s.idsToInsert||(s.idsToInsert=[]);n.id=e.push(n)}return ke[Ae++]=214,ke[Ae++]=112,_e.setUint32(Ae,n.id),void(Ae+=4)}s.set(e,{offset:Ae-t})}let r=e.constructor;if(r===Object)b(e,!0);else if(r===Array){n=e.length,16>n?ke[Ae++]=144|n:65536>n?(ke[Ae++]=220,ke[Ae++]=n>>8,ke[Ae++]=255&n):(ke[Ae++]=221,_e.setUint32(Ae,n),Ae+=4);for(let t=0;t<n;t++)m(e[t])}else if(r===Map){n=e.size,16>n?ke[Ae++]=128|n:65536>n?(ke[Ae++]=222,ke[Ae++]=n>>8,ke[Ae++]=255&n):(ke[Ae++]=223,_e.setUint32(Ae,n),Ae+=4);for(let[t,n]of e)m(t),m(n)}else{for(let t,n=0,r=fe.length;n<r;n++)if(t=he[n],e instanceof t){let t=fe[n];if(t.write)return t.type&&(ke[Ae++]=212,ke[Ae++]=t.type,ke[Ae++]=0),void m(t.write.call(this,e));let r=ke,s=_e,i=Ae;ke=null;let o;try{o=t.pack.call(this,e,e=>(ke=r,r=null,Ae+=e,Ae>Ie&&S(Ae),{target:ke,targetView:_e,position:Ae-e}),m)}finally{r&&(ke=r,_e=s,Ae=i,Ie=ke.length-10)}return void(o&&(o.length+Ae>Ie&&S(o.length+Ae),Ae=U(o,ke,Ae,t.type)))}// no extension found, write as object
-b(e,!e.hasOwnProperty)}}}else if("boolean"===r)ke[Ae++]=e?195:194;else if("bigint"===r){if(e<BigInt(1)<<BigInt(63)&&e>=-(BigInt(1)<<BigInt(63)))ke[Ae++]=211,_e.setBigInt64(Ae,e);else if(e<BigInt(1)<<BigInt(64)&&0<e)ke[Ae++]=207,_e.setBigUint64(Ae,e);else// overflow
-if(this.largeBigIntToFloat)ke[Ae++]=203,_e.setFloat64(Ae,+e);else throw new RangeError(e+" was too large to fit in MessagePack 64-bit integer format, set largeBigIntToFloat to convert to float-64");Ae+=8}else if("undefined"===r)this.encodeUndefinedAsNil?ke[Ae++]=192:(ke[Ae++]=212,ke[Ae++]=0,ke[Ae++]=0);else if("function"===r)m(this.writeFunction&&this.writeFunction());else throw new Error("Unknown type: "+r)},b=!1===this.useRecords?this.variableMapSize?e=>{// this method is slightly slower, but generates "preferred serialization" (optimally small for smaller objects)
-let t=Object.keys(e),n=t.length;16>n?ke[Ae++]=128|n:65536>n?(ke[Ae++]=222,ke[Ae++]=n>>8,ke[Ae++]=255&n):(ke[Ae++]=223,_e.setUint32(Ae,n),Ae+=4);let r;for(let s=0;s<n;s++)m(r=t[s]),m(e[r])}:(e,n)=>{ke[Ae++]=222;// always using map 16, so we can preallocate and set the length afterwards
-let r=Ae-t;Ae+=2;let s=0;for(let t in e)(n||e.hasOwnProperty(t))&&(m(t),m(e[t]),s++);ke[r++ +t]=s>>8,ke[r+t]=255&s}:e.progressiveRecords&&!g?// this is about 2% faster for highly stable structures, since it only requires one for-in loop (but much more expensive when new structure needs to be written)
-(e,n)=>{let s,i,o=r.transitions||(r.transitions=Object.create(null)),a=Ae++-t;for(let u in e)if(n||e.hasOwnProperty(u)){if(s=o[u],s)o=s;else{// record doesn't exist, create full new record and insert it
-let n=Object.keys(e),d=o;o=r.transitions;let c=0;for(let e,t=0,r=n.length;t<r;t++)e=n[t],s=o[e],s||(s=o[e]=Object.create(null),c++),o=s;a+t+1==Ae?(Ae--,k(o,n,c)):// otherwise we need to insert the record, moving existing data after the record
-O(o,n,a,c),i=!0,o=d[u]}m(e[u])}if(!i){let n=o[Le];n?ke[a+t]=n:O(o,Object.keys(e),a,0)}}:(e,t)=>{let n,s=r.transitions||(r.transitions=Object.create(null)),i=0;for(let r in e)(t||e.hasOwnProperty(r))&&(n=s[r],n||(n=s[r]=Object.create(null),i++),s=n);let o=s[Le];// now write the values
-for(let n in o?96<=o&&g?(ke[Ae++]=(31&(o-=96))+96,ke[Ae++]=o>>5):ke[Ae++]=o:k(s,s.__keys__||Object.keys(e),i),e)(t||e.hasOwnProperty(n))&&m(e[n])},S=e=>{var n=Math.min,r=Math.round,s=Math.max;let i;if(16777216<e){// special handling for really large buffers
-if(e-t>Se)throw new Error("Packed buffer would be larger than maximum buffer size");i=n(Se,4096*r(s((e-t)*(67108864<e?1.25:2),4194304)/4096))}else// faster handling for smaller buffers
-i=(s(e-t<<2,ke.length-1)>>12)+1<<12;let o=new me(i);return _e=o.dataView=new DataView(o.buffer,0,i),e=n(e,ke.length),ke.copy?ke.copy(o,0,t,e):o.set(ke.slice(t,e)),Ae-=t,t=0,Ie=o.length-10,ke=o},k=(e,t,s)=>{let i=r.nextId;i||(i=64),i<p&&this.shouldShareStructure&&!this.shouldShareStructure(t)?(i=r.nextOwnId,!(i<l)&&(i=p),r.nextOwnId=i+1):(i>=l&&(// cycle back around
-i=p),r.nextId=i+1);let o=t.highByte=96<=i&&g?i-96>>5:-1;e[Le]=i,e.__keys__=t,r[i-64]=t,i<p?(t.isShared=!0,r.sharedLength=i-63,n=!0,0<=o?(ke[Ae++]=(31&i)+96,ke[Ae++]=o):ke[Ae++]=i):(0<=o?(ke[Ae++]=213,ke[Ae++]=114,ke[Ae++]=(31&i)+96,ke[Ae++]=o):(ke[Ae++]=212,ke[Ae++]=114,ke[Ae++]=i),s&&(h+=y*s),f.length>=c&&(f.shift()[Le]=0),f.push(e),m(t))},O=(e,n,r,s)=>{let i=ke,o=Ae,a=Ie,u=t;ke=Ue,Ae=0,t=0,ke||(Ue=ke=new me(8192)),Ie=ke.length-10,k(e,n,s),Ue=ke;let d=Ae;if(ke=i,Ae=o,Ie=a,t=u,1<d){let e=Ae+d-1;e>Ie&&S(e);let n=r+t;ke.copyWithin(n+d,n+1,Ae),ke.set(Ue.slice(0,d),n),Ae=e}else ke[r+t]=Ue[0]},w=e=>{let t=Oe();return 0===t?b(e,!0):void(Ae=t)}}useBuffer(e){// this means we are finished using our own buffer and we can write over it safely
-ke=e,_e=new DataView(ke.buffer,ke.byteOffset,ke.byteLength),Ae=0}clearSharedData(){this.structures&&(this.structures=[]),this.typedStructs&&(this.typedStructs=[])}}he=[Date,Set,Error,RegExp,ArrayBuffer,Object.getPrototypeOf(Uint8Array.prototype).constructor/*TypedArray*/,v],fe=[{pack(e,n,r){let s=e.getTime()/1e3;if((this.useTimestamp32||0===e.getMilliseconds())&&0<=s&&4294967296>s){// Timestamp 32
-let{target:e,targetView:t,position:r}=n(6);e[r++]=214,e[r++]=255,t.setUint32(r,s)}else if(0<s&&4294967296>s){// Timestamp 64
-let{target:t,targetView:r,position:i}=n(10);t[i++]=215,t[i++]=255,r.setUint32(i,4e6*e.getMilliseconds()+(s/1e3/4294967296>>0)),r.setUint32(i+4,s)}else if(isNaN(s)){if(this.onInvalidDate)return n(0),r(this.onInvalidDate());// Intentionally invalid timestamp
-let{target:e,targetView:t,position:s}=n(3);e[s++]=212,e[s++]=255,e[s++]=255}else{// Timestamp 96
-let{target:r,targetView:i,position:o}=n(15);r[o++]=199,r[o++]=12,r[o++]=255,i.setUint32(o,1e6*e.getMilliseconds()),i.setBigInt64(o+4,BigInt(t(s)))}}},{pack(e,t,n){let r=Array.from(e),{target:s,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(s[i++]=212,s[i++]=115,s[i++]=0),n(r)}},{pack(e,t,n){let{target:r,position:s}=t(this.moreTypes?3:0);this.moreTypes&&(r[s++]=212,r[s++]=101,r[s++]=0),n([e.name,e.message])}},{pack(e,t,n){let{target:r,position:s}=t(this.moreTypes?3:0);this.moreTypes&&(r[s++]=212,r[s++]=120,r[s++]=0),n([e.source,e.flags])}},{pack(e,t){this.moreTypes?S(e,16,t):k(ye?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let n=e.constructor;n!==be&&this.moreTypes?S(e,re.indexOf(n.name),t):k(e,t)}},{pack(e,t){// specific 0xC1 object
-let{target:n,position:r}=t(1);n[r]=193}}];let Re=new xe({useRecords:!1});const Ee=Re.pack,Me=Re.pack,{NEVER:Be,ALWAYS:Ce,DECIMAL_ROUND:De,DECIMAL_FIT:Te}=ce,ze=512,Fe=1024;e.ALWAYS=Ce,e.C1=W,e.DECIMAL_FIT=Te,e.DECIMAL_ROUND=De,e.Decoder=J,e.Encoder=xe,e.FLOAT32_OPTIONS=ce,e.NEVER=Be,e.Packr=xe,e.REUSE_BUFFER_MODE=ze,e.Unpackr=J,e.addExtension=O,e.clearSource=m,e.decode=de,e.decodeIter=function(e,t={}){if(!e||"object"!=typeof e)throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise");const n=new J(t);let r;const s=e=>{let t;// if there's incomplete data from previous chunk, concatinate and try again
-r&&(e=Buffer.concat([r,e]),r=void 0);try{t=n.unpackMultiple(e)}catch(n){if(n.incomplete)r=e.slice(n.lastPosition),t=n.values;else throw n}return t};if("function"==typeof e[Symbol.iterator])return function*(){for(const t of e)yield*s(t)}();return"function"==typeof e[Symbol.asyncIterator]?async function*(){for await(const t of e)yield*s(t)}():void 0},e.encode=Me,e.encodeIter=/**
-	 * Given an Iterable first argument, returns an Iterable where each value is packed as a Buffer
-	 * If the argument is only Async Iterable, the return value will be an Async Iterable.
-	 * @param {Iterable|Iterator|AsyncIterable|AsyncIterator} objectIterator - iterable source, like a Readable object stream, an array, Set, or custom object
-	 * @param {options} [options] - msgpackr pack options
-	 * @returns {IterableIterator|Promise.<AsyncIterableIterator>}
-	 */function(e,t={}){if(!e||"object"!=typeof e)throw new Error("first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable");else{if("function"==typeof e[Symbol.iterator])return w(e,t);if("function"==typeof e.then||"function"==typeof e[Symbol.asyncIterator])return L(e,t);throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise")}},e.isNativeAccelerationEnabled=!1,e.mapsAsObjects=!0,e.pack=Ee,e.roundFloat32=function(e){pe[0]=e;let t=ie[(127&le[3])<<1|le[2]>>7];return(t*e+(0<e?.5:-.5)>>0)/t},e.unpack=ae,e.unpackMultiple=ue,e.useRecords=!1,Object.defineProperty(e,"__esModule",{value:!0})});
+!function(e,t){"object"==typeof exports&&"undefined"!=typeof module?t(exports):"function"==typeof define&&define.amd?define(["exports"],t):t((e="undefined"!=typeof globalThis?globalThis:e||self).msgpackr={})}(this,(function(e){"use strict";var t,r,n;try{t=new TextDecoder}catch(e){}var i,s,o,a,u,l=0,c={},f=0,h=0,g=[],p={useRecords:!1,mapsAsObjects:!0};class d{}const y=new d;y.name="MessagePack 0xC1";var w=!1,b=2;try{new Function("")}catch(e){b=1/0}class m{constructor(e){e&&(!1===e.useRecords&&void 0===e.mapsAsObjects&&(e.mapsAsObjects=!0),e.sequential&&!1!==e.trusted&&(e.trusted=!0,e.structures||0==e.useRecords||(e.structures=[],e.maxSharedStructures||(e.maxSharedStructures=0))),e.structures?e.structures.sharedLength=e.structures.length:e.getStructures&&((e.structures=[]).uninitialized=!0,e.structures.sharedLength=0),e.int64AsNumber&&(e.int64AsType="number")),Object.assign(this,e)}unpack(e,t){if(r)return $((()=>(q(),this?this.unpack(e,t):m.prototype.unpack.call(p,e,t))));"object"==typeof t?(n=t.end||e.length,l=t.start||0):(l=0,n=t>-1?t:e.length),h=0,s=null,o=null,r=e;try{u=e.dataView||(e.dataView=new DataView(e.buffer,e.byteOffset,e.byteLength))}catch(t){if(r=null,e instanceof Uint8Array)throw t;throw new Error("Source must be a Uint8Array or Buffer but was a "+(e&&"object"==typeof e?e.constructor.name:typeof e))}if(this instanceof m){if(c=this,this.structures)return i=this.structures,S(t);(!i||i.length>0)&&(i=[])}else c=p,(!i||i.length>0)&&(i=[]);return S(t)}unpackMultiple(e,t){let r,n=0;try{w=!0;let i=e.length,s=this?this.unpack(e,i):G.unpack(e,i);if(!t){for(r=[s];l<i;)n=l,r.push(S());return r}for(t(s);l<i;)if(n=l,!1===t(S()))return}catch(e){throw e.lastPosition=n,e.values=r,e}finally{w=!1,q()}}_mergeStructures(e,t){e=e||[],Object.isFrozen(e)&&(e=e.map((e=>e.slice(0))));for(let t=0,r=e.length;t<r;t++){let r=e[t];r&&(r.isShared=!0,t>=32&&(r.highByte=t-32>>5))}e.sharedLength=e.length;for(let r in t||[])if(r>=0){let n=e[r],i=t[r];i&&(n&&((e.restoreStructures||(e.restoreStructures=[]))[r]=n),e[r]=i)}return this.structures=e}decode(e,t){return this.unpack(e,t)}}function S(e){try{if(!c.trusted&&!w){let e=i.sharedLength||0;e<i.length&&(i.length=e)}let e;if(c.randomAccessStructure&&r[l]<64&&r[l],e=k(),o&&(l=o.postBundlePosition,o=null),l==n)i&&i.restoreStructures&&U(),i=null,r=null,a&&(a=null);else{if(l>n)throw new Error("Unexpected end of MessagePack data");if(!w)throw new Error("Data read, but end of buffer not reached "+JSON.stringify(e).slice(0,100))}return e}catch(e){throw i&&i.restoreStructures&&U(),q(),(e instanceof RangeError||e.message.startsWith("Unexpected end of buffer")||l>n)&&(e.incomplete=!0),e}}function U(){for(let e in i.restoreStructures)i[e]=i.restoreStructures[e];i.restoreStructures=null}function k(){let e=r[l++];if(e<160){if(e<128){if(e<64)return e;{let t=i[63&e]||c.getStructures&&_()[63&e];return t?(t.read||(t.read=I(t,63&e)),t.read()):e}}if(e<144){if(e-=128,c.mapsAsObjects){let t={};for(let r=0;r<e;r++){let e=z();"__proto__"===e&&(e="__proto_"),t[e]=k()}return t}{let t=new Map;for(let r=0;r<e;r++)t.set(k(),k());return t}}{e-=144;let t=new Array(e);for(let r=0;r<e;r++)t[r]=k();return c.freezeData?Object.freeze(t):t}}if(e<192){let t=e-160;if(h>=l)return s.slice(l-f,(l+=t)-f);if(0==h&&n<140){let e=t<16?L(t):F(t);if(null!=e)return e}return E(t)}{let t;switch(e){case 192:return null;case 193:return o?(t=k(),t>0?o[1].slice(o.position1,o.position1+=t):o[0].slice(o.position0,o.position0-=t)):y;case 194:return!1;case 195:return!0;case 196:if(t=r[l++],void 0===t)throw new Error("Unexpected end of buffer");return R(t);case 197:return t=u.getUint16(l),l+=2,R(t);case 198:return t=u.getUint32(l),l+=4,R(t);case 199:return P(r[l++]);case 200:return t=u.getUint16(l),l+=2,P(t);case 201:return t=u.getUint32(l),l+=4,P(t);case 202:if(t=u.getFloat32(l),c.useFloat32>2){let e=J[(127&r[l])<<1|r[l+1]>>7];return l+=4,(e*t+(t>0?.5:-.5)>>0)/e}return l+=4,t;case 203:return t=u.getFloat64(l),l+=8,t;case 204:return r[l++];case 205:return t=u.getUint16(l),l+=2,t;case 206:return t=u.getUint32(l),l+=4,t;case 207:return"number"===c.int64AsType?(t=4294967296*u.getUint32(l),t+=u.getUint32(l+4)):t="string"===c.int64AsType?u.getBigUint64(l).toString():u.getBigUint64(l),l+=8,t;case 208:return u.getInt8(l++);case 209:return t=u.getInt16(l),l+=2,t;case 210:return t=u.getInt32(l),l+=4,t;case 211:return"number"===c.int64AsType?(t=4294967296*u.getInt32(l),t+=u.getUint32(l+4)):t="string"===c.int64AsType?u.getBigInt64(l).toString():u.getBigInt64(l),l+=8,t;case 212:if(t=r[l++],114==t)return N(63&r[l++]);{let e=g[t];if(e)return e.read?(l++,e.read(k())):e.noBuffer?(l++,e()):e(r.subarray(l,++l));throw new Error("Unknown extension "+t)}case 213:return t=r[l],114==t?(l++,N(63&r[l++],r[l++])):P(2);case 214:return P(4);case 215:return P(8);case 216:return P(16);case 217:return t=r[l++],h>=l?s.slice(l-f,(l+=t)-f):O(t);case 218:return t=u.getUint16(l),h>=(l+=2)?s.slice(l-f,(l+=t)-f):x(t);case 219:return t=u.getUint32(l),h>=(l+=4)?s.slice(l-f,(l+=t)-f):B(t);case 220:return t=u.getUint16(l),l+=2,T(t);case 221:return t=u.getUint32(l),l+=4,T(t);case 222:return t=u.getUint16(l),l+=2,j(t);case 223:return t=u.getUint32(l),l+=4,j(t);default:if(e>=224)return e-256;if(void 0===e){let e=new Error("Unexpected end of MessagePack data");throw e.incomplete=!0,e}throw new Error("Unknown MessagePack token "+e)}}}const A=/^[a-zA-Z_$][a-zA-Z\d_$]*$/;function I(e,t){function r(){if(r.count++>b){let r=e.read=new Function("r","return function(){return "+(c.freezeData?"Object.freeze":"")+"({"+e.map((e=>"__proto__"===e?"__proto_:r()":A.test(e)?e+":r()":"["+JSON.stringify(e)+"]:r()")).join(",")+"})}")(k);return 0===e.highByte&&(e.read=v(t,e.read)),r()}let n={};for(let t=0,r=e.length;t<r;t++){let r=e[t];"__proto__"===r&&(r="__proto_"),n[r]=k()}return c.freezeData?Object.freeze(n):n}return r.count=0,0===e.highByte?v(t,r):r}const v=(e,t)=>function(){let n=r[l++];if(0===n)return t();let s=e<32?-(e+(n<<5)):e+(n<<5),o=i[s]||_()[s];if(!o)throw new Error("Record id is not defined for "+s);return o.read||(o.read=I(o,e)),o.read()};function _(){let e=$((()=>(r=null,c.getStructures())));return i=c._mergeStructures(e,i)}var E=M,O=M,x=M,B=M;function M(e){let n;if(e<16&&(n=L(e)))return n;if(e>64&&t)return t.decode(r.subarray(l,l+=e));const i=l+e,s=[];for(n="";l<i;){const e=r[l++];if(0==(128&e))s.push(e);else if(192==(224&e)){const t=63&r[l++];s.push((31&e)<<6|t)}else if(224==(240&e)){const t=63&r[l++],n=63&r[l++];s.push((31&e)<<12|t<<6|n)}else if(240==(248&e)){let t=(7&e)<<18|(63&r[l++])<<12|(63&r[l++])<<6|63&r[l++];t>65535&&(t-=65536,s.push(t>>>10&1023|55296),t=56320|1023&t),s.push(t)}else s.push(e);s.length>=4096&&(n+=D.apply(String,s),s.length=0)}return s.length>0&&(n+=D.apply(String,s)),n}function T(e){let t=new Array(e);for(let r=0;r<e;r++)t[r]=k();return c.freezeData?Object.freeze(t):t}function j(e){if(c.mapsAsObjects){let t={};for(let r=0;r<e;r++){let e=z();"__proto__"===e&&(e="__proto_"),t[e]=k()}return t}{let t=new Map;for(let r=0;r<e;r++)t.set(k(),k());return t}}var D=String.fromCharCode;function F(e){let t=l,n=new Array(e);for(let i=0;i<e;i++){const e=r[l++];if((128&e)>0)return void(l=t);n[i]=e}return D.apply(String,n)}function L(e){if(e<4){if(e<2){if(0===e)return"";{let e=r[l++];return(128&e)>1?void(l-=1):D(e)}}{let t=r[l++],n=r[l++];if((128&t)>0||(128&n)>0)return void(l-=2);if(e<3)return D(t,n);let i=r[l++];return(128&i)>0?void(l-=3):D(t,n,i)}}{let t=r[l++],n=r[l++],i=r[l++],s=r[l++];if((128&t)>0||(128&n)>0||(128&i)>0||(128&s)>0)return void(l-=4);if(e<6){if(4===e)return D(t,n,i,s);{let e=r[l++];return(128&e)>0?void(l-=5):D(t,n,i,s,e)}}if(e<8){let o=r[l++],a=r[l++];if((128&o)>0||(128&a)>0)return void(l-=6);if(e<7)return D(t,n,i,s,o,a);let u=r[l++];return(128&u)>0?void(l-=7):D(t,n,i,s,o,a,u)}{let o=r[l++],a=r[l++],u=r[l++],c=r[l++];if((128&o)>0||(128&a)>0||(128&u)>0||(128&c)>0)return void(l-=8);if(e<10){if(8===e)return D(t,n,i,s,o,a,u,c);{let e=r[l++];return(128&e)>0?void(l-=9):D(t,n,i,s,o,a,u,c,e)}}if(e<12){let f=r[l++],h=r[l++];if((128&f)>0||(128&h)>0)return void(l-=10);if(e<11)return D(t,n,i,s,o,a,u,c,f,h);let g=r[l++];return(128&g)>0?void(l-=11):D(t,n,i,s,o,a,u,c,f,h,g)}{let f=r[l++],h=r[l++],g=r[l++],p=r[l++];if((128&f)>0||(128&h)>0||(128&g)>0||(128&p)>0)return void(l-=12);if(e<14){if(12===e)return D(t,n,i,s,o,a,u,c,f,h,g,p);{let e=r[l++];return(128&e)>0?void(l-=13):D(t,n,i,s,o,a,u,c,f,h,g,p,e)}}{let d=r[l++],y=r[l++];if((128&d)>0||(128&y)>0)return void(l-=14);if(e<15)return D(t,n,i,s,o,a,u,c,f,h,g,p,d,y);let w=r[l++];return(128&w)>0?void(l-=15):D(t,n,i,s,o,a,u,c,f,h,g,p,d,y,w)}}}}}function V(){let e,t=r[l++];if(t<192)e=t-160;else switch(t){case 217:e=r[l++];break;case 218:e=u.getUint16(l),l+=2;break;case 219:e=u.getUint32(l),l+=4;break;default:throw new Error("Expected string")}return M(e)}function R(e){return c.copyBuffers?Uint8Array.prototype.slice.call(r,l,l+=e):r.subarray(l,l+=e)}function P(e){let t=r[l++];if(g[t]){let n;return g[t](r.subarray(l,n=l+=e),(e=>{l=e;try{return k()}finally{l=n}}))}throw new Error("Unknown extension type "+t)}var C=new Array(4096);function z(){let e=r[l++];if(!(e>=160&&e<192))return l--,k().toString();if(e-=160,h>=l)return s.slice(l-f,(l+=e)-f);if(!(0==h&&n<180))return E(e);let t,i=4095&(e<<5^(e>1?u.getUint16(l):e>0?r[l]:0)),o=C[i],a=l,c=l+e-3,g=0;if(o&&o.bytes==e){for(;a<c;){if(t=u.getUint32(a),t!=o[g++]){a=1879048192;break}a+=4}for(c+=3;a<c;)if(t=r[a++],t!=o[g++]){a=1879048192;break}if(a===c)return l=a,o.string;c-=3,a=l}for(o=[],C[i]=o,o.bytes=e;a<c;)t=u.getUint32(a),o.push(t),a+=4;for(c+=3;a<c;)t=r[a++],o.push(t);let p=e<16?L(e):F(e);return o.string=null!=p?p:E(e)}const N=(e,t)=>{let r=k().map((e=>e.toString())),n=e;void 0!==t&&(e=e<32?-((t<<5)+e):(t<<5)+e,r.highByte=t);let s=i[e];return s&&s.isShared&&((i.restoreStructures||(i.restoreStructures=[]))[e]=s),i[e]=r,r.read=I(r,n),r.read()};g[0]=()=>{},g[0].noBuffer=!0,g[101]=()=>{let e=k();return(globalThis[e[0]]||Error)(e[1])},g[105]=e=>{let t=u.getUint32(l-4);a||(a=new Map);let n,i=r[l];n=i>=144&&i<160||220==i||221==i?[]:{};let s={target:n};a.set(t,s);let o=k();return s.used?Object.assign(n,o):(s.target=o,o)},g[112]=e=>{let t=u.getUint32(l-4),r=a.get(t);return r.used=!0,r.target},g[115]=()=>new Set(k());const W=["Int8","Uint8","Uint8Clamped","Int16","Uint16","Int32","Uint32","Float32","Float64","BigInt64","BigUint64"].map((e=>e+"Array"));g[116]=e=>{let t=e[0],r=W[t];if(!r)throw new Error("Could not find typed array for code "+t);return new globalThis[r](Uint8Array.prototype.slice.call(e,1).buffer)},g[120]=()=>{let e=k();return new RegExp(e[0],e[1])};const Y=[];function $(e){let t=n,g=l,p=f,d=h,y=s,b=a,m=o,S=new Uint8Array(r.slice(0,n)),U=i,k=i.slice(0,i.length),A=c,I=w,v=e();return n=t,l=g,f=p,h=d,s=y,a=b,o=m,r=S,w=I,(i=U).splice(0,i.length,...k),c=A,u=new DataView(r.buffer,r.byteOffset,r.byteLength),v}function q(){r=null,a=null,i=null}g[98]=e=>{let t=(e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3],r=l;return l+=t-e.length,o=Y,(o=[V(),V()]).position0=0,o.position1=0,o.postBundlePosition=l,l=r,k()},g[255]=e=>4==e.length?new Date(1e3*(16777216*e[0]+(e[1]<<16)+(e[2]<<8)+e[3])):8==e.length?new Date(((e[0]<<22)+(e[1]<<14)+(e[2]<<6)+(e[3]>>2))/1e6+1e3*(4294967296*(3&e[3])+16777216*e[4]+(e[5]<<16)+(e[6]<<8)+e[7])):12==e.length?new Date(((e[0]<<24)+(e[1]<<16)+(e[2]<<8)+e[3])/1e6+1e3*((128&e[4]?-281474976710656:0)+1099511627776*e[6]+4294967296*e[7]+16777216*e[8]+(e[9]<<16)+(e[10]<<8)+e[11])):new Date("invalid");const J=new Array(147);for(let e=0;e<256;e++)J[e]=+("1e"+Math.floor(45.15-.30103*e));const Z=m;var G=new m({useRecords:!1});const H=G.unpack,K=G.unpackMultiple,Q=G.unpack,X={NEVER:0,ALWAYS:1,DECIMAL_ROUND:3,DECIMAL_FIT:4};let ee,te,re,ne=new Float32Array(1),ie=new Uint8Array(ne.buffer,0,4);try{ee=new TextEncoder}catch(e){}const se="undefined"!=typeof Buffer,oe=se?function(e){return Buffer.allocUnsafeSlow(e)}:Uint8Array,ae=se?Buffer:Uint8Array,ue=se?4294967296:2144337920;let le,ce,fe,he,ge=0,pe=null;const de=/[\u0080-\uFFFF]/,ye=Symbol("record-id");class we extends m{constructor(e){let t,r,n,i;super(e),this.offset=0;let s=ae.prototype.utf8Write?function(e,t){return le.utf8Write(e,t,4294967295)}:!(!ee||!ee.encodeInto)&&function(e,t){return ee.encodeInto(e,le.subarray(t)).written},o=this;e||(e={});let a=e&&e.sequential,u=e.structures||e.saveStructures,l=e.maxSharedStructures;if(null==l&&(l=u?32:0),l>8160)throw new Error("Maximum maxSharedStructure is 8160");e.structuredClone&&null==e.moreTypes&&(e.moreTypes=!0);let c=e.maxOwnStructures;null==c&&(c=u?32:64),this.structures||0==e.useRecords||(this.structures=[]);let f=l>32||c+l>64,h=l+64,g=l+c+64;if(g>8256)throw new Error("Maximum maxSharedStructure + maxOwnStructure is 8192");let p=[],d=0,y=0;this.pack=this.encode=function(e,s){if(le||(le=new oe(8192),fe=le.dataView||(le.dataView=new DataView(le.buffer,0,8192)),ge=0),he=le.length-10,he-ge<2048?(le=new oe(le.length),fe=le.dataView||(le.dataView=new DataView(le.buffer,0,le.length)),he=le.length-10,ge=0):ge=ge+7&2147483640,t=ge,i=o.structuredClone?new Map:null,o.bundleStrings&&"string"!=typeof e?(pe=[],pe.size=1/0):pe=null,n=o.structures,n){n.uninitialized&&(n=o._mergeStructures(o.getStructures()));let e=n.sharedLength||0;if(e>l)throw new Error("Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to "+n.sharedLength);if(!n.transitions){n.transitions=Object.create(null);for(let t=0;t<e;t++){let e=n[t];if(!e)continue;let r,i=n.transitions;for(let t=0,n=e.length;t<n;t++){let n=e[t];r=i[n],r||(r=i[n]=Object.create(null)),i=r}i[ye]=t+64}this.lastNamedStructuresLength=e}a||(n.nextId=e+64)}r&&(r=!1);try{o.randomAccessStructure&&e.constructor&&e.constructor===Object?k(e):w(e);let u=pe;if(pe&&Ue(t,w,0),i&&i.idsToInsert){let e=i.idsToInsert.sort(((e,t)=>e.offset>t.offset?1:-1)),r=e.length,n=-1;for(;u&&r>0;){let i=e[--r].offset+t;i<u.stringsPosition+t&&-1===n&&(n=0),i>u.position+t?n>=0&&(n+=6):(n>=0&&(fe.setUint32(u.position+t,fe.getUint32(u.position+t)+n),n=-1),u=u.previous,r++)}n>=0&&u&&fe.setUint32(u.position+t,fe.getUint32(u.position+t)+n),ge+=6*e.length,ge>he&&m(ge),o.offset=ge;let s=function(e,t){let r,n=6*t.length,i=e.length-n;for(;r=t.pop();){let t=r.offset,s=r.id;e.copyWithin(t+n,t,i),n-=6;let o=t+n;e[o++]=214,e[o++]=105,e[o++]=s>>24,e[o++]=s>>16&255,e[o++]=s>>8&255,e[o++]=255&s,i=t}return e}(le.subarray(t,ge),e);return i=null,s}return o.offset=ge,s&Be?(le.start=t,le.end=ge,le):le.subarray(t,ge)}finally{if(n){y<10&&y++;let i=n.sharedLength||0;if(n.length>i&&(n.length=i),d>1e4)n.transitions=null,y=0,d=0,p.length>0&&(p=[]);else if(p.length>0&&!a){for(let e=0,t=p.length;e<t;e++)p[e][ye]=0;p=[]}if(r&&o.saveStructures){let r=le.subarray(t,ge),s=function(e,t){return e.isCompatible=e=>{let r=!e||(t.lastNamedStructuresLength||0)===e.length;return r||t._mergeStructures(e),r},e}(n,o);return!1===o.saveStructures(s,s.isCompatible)?o.pack(e):(o.lastNamedStructuresLength=i,r)}}s&Me&&(ge=t)}};const w=e=>{ge>he&&(le=m(ge));var r,n=typeof e;if("string"===n){let n,i=e.length;if(pe&&i>=4&&i<4096){if((pe.size+=i)>61440){let e,r,n=(pe[0]?3*pe[0].length+pe[1].length:0)+10;ge+n>he&&(le=m(ge+n)),pe.position?(r=pe,le[ge]=200,ge+=3,le[ge++]=98,e=ge-t,ge+=4,Ue(t,w,0),fe.setUint16(e+t-3,ge-t-e)):(le[ge++]=214,le[ge++]=98,e=ge-t,ge+=4),pe=["",""],pe.previous=r,pe.size=0,pe.position=e}let r=de.test(e);return pe[r?0:1]+=e,le[ge++]=193,void w(r?-i:i)}n=i<32?1:i<256?2:i<65536?3:5;let o=3*i;if(ge+o>he&&(le=m(ge+o)),i<64||!s){let t,s,o,a=ge+n;for(t=0;t<i;t++)s=e.charCodeAt(t),s<128?le[a++]=s:s<2048?(le[a++]=s>>6|192,le[a++]=63&s|128):55296==(64512&s)&&56320==(64512&(o=e.charCodeAt(t+1)))?(s=65536+((1023&s)<<10)+(1023&o),t++,le[a++]=s>>18|240,le[a++]=s>>12&63|128,le[a++]=s>>6&63|128,le[a++]=63&s|128):(le[a++]=s>>12|224,le[a++]=s>>6&63|128,le[a++]=63&s|128);r=a-ge-n}else r=s(e,ge+n);r<32?le[ge++]=160|r:r<256?(n<2&&le.copyWithin(ge+2,ge+1,ge+1+r),le[ge++]=217,le[ge++]=r):r<65536?(n<3&&le.copyWithin(ge+3,ge+2,ge+2+r),le[ge++]=218,le[ge++]=r>>8,le[ge++]=255&r):(n<5&&le.copyWithin(ge+5,ge+3,ge+3+r),le[ge++]=219,fe.setUint32(ge,r),ge+=4),ge+=r}else if("number"===n)if(e>>>0===e)e<32||e<128&&!1===this.useRecords||e<64&&!this.randomAccessStructure?le[ge++]=e:e<256?(le[ge++]=204,le[ge++]=e):e<65536?(le[ge++]=205,le[ge++]=e>>8,le[ge++]=255&e):(le[ge++]=206,fe.setUint32(ge,e),ge+=4);else if(e>>0===e)e>=-32?le[ge++]=256+e:e>=-128?(le[ge++]=208,le[ge++]=e+256):e>=-32768?(le[ge++]=209,fe.setInt16(ge,e),ge+=2):(le[ge++]=210,fe.setInt32(ge,e),ge+=4);else{let t;if((t=this.useFloat32)>0&&e<4294967296&&e>=-2147483648){let r;if(le[ge++]=202,fe.setFloat32(ge,e),t<4||(r=e*J[(127&le[ge])<<1|le[ge+1]>>7])>>0===r)return void(ge+=4);ge--}le[ge++]=203,fe.setFloat64(ge,e),ge+=8}else if("object"===n)if(e){if(i){let r=i.get(e);if(r){if(!r.id){let e=i.idsToInsert||(i.idsToInsert=[]);r.id=e.push(r)}return le[ge++]=214,le[ge++]=112,fe.setUint32(ge,r.id),void(ge+=4)}i.set(e,{offset:ge-t})}let n=e.constructor;if(n===Object)b(e,!0);else if(n===Array||Array.isArray(e)){(r=e.length)<16?le[ge++]=144|r:r<65536?(le[ge++]=220,le[ge++]=r>>8,le[ge++]=255&r):(le[ge++]=221,fe.setUint32(ge,r),ge+=4);for(let t=0;t<r;t++)w(e[t])}else if(n===Map){(r=e.size)<16?le[ge++]=128|r:r<65536?(le[ge++]=222,le[ge++]=r>>8,le[ge++]=255&r):(le[ge++]=223,fe.setUint32(ge,r),ge+=4);for(let[t,r]of e)w(t),w(r)}else{for(let t=0,r=te.length;t<r;t++){if(e instanceof re[t]){let r=te[t];if(r.write)return r.type&&(le[ge++]=212,le[ge++]=r.type,le[ge++]=0),void w(r.write.call(this,e));let n,i=le,s=fe,o=ge;le=null;try{n=r.pack.call(this,e,(e=>(le=i,i=null,ge+=e,ge>he&&m(ge),{target:le,targetView:fe,position:ge-e})),w)}finally{i&&(le=i,fe=s,ge=o,he=le.length-10)}return void(n&&(n.length+ge>he&&m(n.length+ge),ge=Se(n,le,ge,r.type)))}}b(e,!e.hasOwnProperty)}}else le[ge++]=192;else if("boolean"===n)le[ge++]=e?195:194;else if("bigint"===n){if(e<BigInt(1)<<BigInt(63)&&e>=-(BigInt(1)<<BigInt(63)))le[ge++]=211,fe.setBigInt64(ge,e);else if(e<BigInt(1)<<BigInt(64)&&e>0)le[ge++]=207,fe.setBigUint64(ge,e);else{if(!this.largeBigIntToFloat)throw new RangeError(e+" was too large to fit in MessagePack 64-bit integer format, set largeBigIntToFloat to convert to float-64");le[ge++]=203,fe.setFloat64(ge,Number(e))}ge+=8}else if("undefined"===n)this.encodeUndefinedAsNil?le[ge++]=192:(le[ge++]=212,le[ge++]=0,le[ge++]=0);else{if("function"!==n)throw new Error("Unknown type: "+n);w(this.writeFunction&&this.writeFunction())}},b=!1===this.useRecords?this.variableMapSize?e=>{let t,r=Object.keys(e),n=r.length;n<16?le[ge++]=128|n:n<65536?(le[ge++]=222,le[ge++]=n>>8,le[ge++]=255&n):(le[ge++]=223,fe.setUint32(ge,n),ge+=4);for(let i=0;i<n;i++)w(t=r[i]),w(e[t])}:(e,r)=>{le[ge++]=222;let n=ge-t;ge+=2;let i=0;for(let t in e)(r||e.hasOwnProperty(t))&&(w(t),w(e[t]),i++);le[n+++t]=i>>8,le[n+t]=255&i}:e.progressiveRecords&&!f?(e,r)=>{let i,s,o=n.transitions||(n.transitions=Object.create(null)),a=ge++-t;for(let u in e)if(r||e.hasOwnProperty(u)){if(i=o[u],i)o=i;else{let r=Object.keys(e),l=o;o=n.transitions;let c=0;for(let e=0,t=r.length;e<t;e++){let t=r[e];i=o[t],i||(i=o[t]=Object.create(null),c++),o=i}a+t+1==ge?(ge--,S(o,r,c)):U(o,r,a,c),s=!0,o=l[u]}w(e[u])}if(!s){let r=o[ye];r?le[a+t]=r:U(o,Object.keys(e),a,0)}}:(e,t)=>{let r,i=n.transitions||(n.transitions=Object.create(null)),s=0;for(let n in e)(t||e.hasOwnProperty(n))&&(r=i[n],r||(r=i[n]=Object.create(null),s++),i=r);let o=i[ye];o?o>=96&&f?(le[ge++]=96+(31&(o-=96)),le[ge++]=o>>5):le[ge++]=o:S(i,i.__keys__||Object.keys(e),s);for(let r in e)(t||e.hasOwnProperty(r))&&w(e[r])},m=e=>{let r;if(e>16777216){if(e-t>ue)throw new Error("Packed buffer would be larger than maximum buffer size");r=Math.min(ue,4096*Math.round(Math.max((e-t)*(e>67108864?1.25:2),4194304)/4096))}else r=1+(Math.max(e-t<<2,le.length-1)>>12)<<12;let n=new oe(r);return fe=n.dataView||(n.dataView=new DataView(n.buffer,0,r)),e=Math.min(e,le.length),le.copy?le.copy(n,0,t,e):n.set(le.slice(t,e)),ge-=t,t=0,he=n.length-10,le=n},S=(e,t,i)=>{let s=n.nextId;s||(s=64),s<h&&this.shouldShareStructure&&!this.shouldShareStructure(t)?(s=n.nextOwnId,s<g||(s=h),n.nextOwnId=s+1):(s>=g&&(s=h),n.nextId=s+1);let o=t.highByte=s>=96&&f?s-96>>5:-1;e[ye]=s,e.__keys__=t,n[s-64]=t,s<h?(t.isShared=!0,n.sharedLength=s-63,r=!0,o>=0?(le[ge++]=96+(31&s),le[ge++]=o):le[ge++]=s):(o>=0?(le[ge++]=213,le[ge++]=114,le[ge++]=96+(31&s),le[ge++]=o):(le[ge++]=212,le[ge++]=114,le[ge++]=s),i&&(d+=y*i),p.length>=c&&(p.shift()[ye]=0),p.push(e),w(t))},U=(e,r,n,i)=>{let s=le,o=ge,a=he,u=t;le=ce,ge=0,t=0,le||(ce=le=new oe(8192)),he=le.length-10,S(e,r,i),ce=le;let l=ge;if(le=s,ge=o,he=a,t=u,l>1){let e=ge+l-1;e>he&&m(e);let r=n+t;le.copyWithin(r+l,r+1,ge),le.set(ce.slice(0,l),r),ge=e}else le[n+t]=ce[0]},k=(e,i)=>{let s=undefined(e,le,ge,n,m,((e,n,i)=>{if(i)return r=!0;if(ge=n,t>0){if(w(e),0==t)return{position:ge,targetView:fe,target:le}}else w(e);return ge}),this);if(0===s)return b(e,!0);ge=s}}useBuffer(e){le=e,fe=new DataView(le.buffer,le.byteOffset,le.byteLength),ge=0}clearSharedData(){this.structures&&(this.structures=[]),this.typedStructs&&(this.typedStructs=[])}}function be(e,t,r,n){let i=e.byteLength;if(i+1<256){var{target:s,position:o}=r(4+i);s[o++]=199,s[o++]=i+1}else if(i+1<65536){var{target:s,position:o}=r(5+i);s[o++]=200,s[o++]=i+1>>8,s[o++]=i+1&255}else{var{target:s,position:o,targetView:a}=r(7+i);s[o++]=201,a.setUint32(o,i+1),o+=4}s[o++]=116,s[o++]=t,s.set(new Uint8Array(e.buffer,e.byteOffset,e.byteLength),o)}function me(e,t){let r=e.byteLength;var n,i;if(r<256){var{target:n,position:i}=t(r+2);n[i++]=196,n[i++]=r}else if(r<65536){var{target:n,position:i}=t(r+3);n[i++]=197,n[i++]=r>>8,n[i++]=255&r}else{var{target:n,position:i,targetView:s}=t(r+5);n[i++]=198,s.setUint32(i,r),i+=4}n.set(e,i)}function Se(e,t,r,n){let i=e.length;switch(i){case 1:t[r++]=212;break;case 2:t[r++]=213;break;case 4:t[r++]=214;break;case 8:t[r++]=215;break;case 16:t[r++]=216;break;default:i<256?(t[r++]=199,t[r++]=i):i<65536?(t[r++]=200,t[r++]=i>>8,t[r++]=255&i):(t[r++]=201,t[r++]=i>>24,t[r++]=i>>16&255,t[r++]=i>>8&255,t[r++]=255&i)}return t[r++]=n,t.set(e,r),r+=i}function Ue(e,t,r){if(pe.length>0){fe.setUint32(pe.position+e,ge+r-pe.position-e),pe.stringsPosition=ge-e;let n=pe;pe=null,t(n[0]),t(n[1])}}re=[Date,Set,Error,RegExp,ArrayBuffer,Object.getPrototypeOf(Uint8Array.prototype).constructor,d],te=[{pack(e,t,r){let n=e.getTime()/1e3;if((this.useTimestamp32||0===e.getMilliseconds())&&n>=0&&n<4294967296){let{target:e,targetView:r,position:i}=t(6);e[i++]=214,e[i++]=255,r.setUint32(i,n)}else if(n>0&&n<4294967296){let{target:r,targetView:i,position:s}=t(10);r[s++]=215,r[s++]=255,i.setUint32(s,4e6*e.getMilliseconds()+(n/1e3/4294967296>>0)),i.setUint32(s+4,n)}else if(isNaN(n)){if(this.onInvalidDate)return t(0),r(this.onInvalidDate());let{target:e,targetView:n,position:i}=t(3);e[i++]=212,e[i++]=255,e[i++]=255}else{let{target:r,targetView:i,position:s}=t(15);r[s++]=199,r[s++]=12,r[s++]=255,i.setUint32(s,1e6*e.getMilliseconds()),i.setBigInt64(s+4,BigInt(Math.floor(n)))}}},{pack(e,t,r){let n=Array.from(e),{target:i,position:s}=t(this.moreTypes?3:0);this.moreTypes&&(i[s++]=212,i[s++]=115,i[s++]=0),r(n)}},{pack(e,t,r){let{target:n,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(n[i++]=212,n[i++]=101,n[i++]=0),r([e.name,e.message])}},{pack(e,t,r){let{target:n,position:i}=t(this.moreTypes?3:0);this.moreTypes&&(n[i++]=212,n[i++]=120,n[i++]=0),r([e.source,e.flags])}},{pack(e,t){this.moreTypes?be(e,16,t):me(se?Buffer.from(e):new Uint8Array(e),t)}},{pack(e,t){let r=e.constructor;r!==ae&&this.moreTypes?be(e,W.indexOf(r.name),t):me(e,t)}},{pack(e,t){let{target:r,position:n}=t(1);r[n]=193}}];let ke=new we({useRecords:!1});const Ae=ke.pack,Ie=ke.pack,ve=we,{NEVER:_e,ALWAYS:Ee,DECIMAL_ROUND:Oe,DECIMAL_FIT:xe}=X,Be=512,Me=1024;const Te=function(e,t={}){if(!e||"object"!=typeof e)throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a promise");const r=new m(t);let n;const i=e=>{let t;n&&(e=Buffer.concat([n,e]),n=void 0);try{t=r.unpackMultiple(e)}catch(r){if(!r.incomplete)throw r;n=e.slice(r.lastPosition),t=r.values}return t};return"function"==typeof e[Symbol.iterator]?function*(){for(const t of e)yield*i(t)}():"function"==typeof e[Symbol.asyncIterator]?async function*(){for await(const t of e)yield*i(t)}():void 0},je=function(e,t={}){if(e&&"object"==typeof e){if("function"==typeof e[Symbol.iterator])return function*(e,t){const r=new we(t);for(const t of e)yield r.pack(t)}(e,t);if("function"==typeof e.then||"function"==typeof e[Symbol.asyncIterator])return async function*(e,t){const r=new we(t);for await(const t of e)yield r.pack(t)}(e,t);throw new Error("first argument must be an Iterable, Async Iterable, Iterator, Async Iterator, or a Promise")}throw new Error("first argument must be an Iterable, Async Iterable, or a Promise for an Async Iterable")};e.ALWAYS=Ee,e.C1=y,e.DECIMAL_FIT=xe,e.DECIMAL_ROUND=Oe,e.Decoder=Z,e.Encoder=ve,e.FLOAT32_OPTIONS=X,e.NEVER=_e,e.Packr=we,e.REUSE_BUFFER_MODE=Be,e.Unpackr=m,e.addExtension=function(e){if(e.Class){if(!e.pack&&!e.write)throw new Error("Extension has no pack or write function");if(e.pack&&!e.type)throw new Error("Extension has no type (numeric code to identify the extension)");re.unshift(e.Class),te.unshift(e)}!function(e){e.unpack?g[e.type]=e.unpack:g[e.type]=e}(e)},e.clearSource=q,e.decode=Q,e.decodeIter=Te,e.encode=Ie,e.encodeIter=je,e.isNativeAccelerationEnabled=!1,e.mapsAsObjects=!0,e.pack=Ae,e.roundFloat32=function(e){ne[0]=e;let t=J[(127&ie[3])<<1|ie[2]>>7];return(t*e+(e>0?.5:-.5)>>0)/t},e.unpack=H,e.unpackMultiple=K,e.useRecords=!1}));
 //# sourceMappingURL=index.min.js.map