@haelp/teto/dist/classes/ribbon/codecs/utils/msgpackr-943ed70.mjs.map

A typescript-based controllable TETR.IO client.

{"version":3,"sources":["../../../../../src/classes/ribbon/codecs/utils/msgpackr-943ed70.ts"],"sourcesContent":["// @ts-nocheck\nimport { Buffer } from \"buffer/index.js\";\n\nexport default (function (t) {\n  \"use strict\";\n  var n, r, i;\n  try {\n    n = new TextDecoder();\n  } catch (t) {}\n  var a,\n    o,\n    s,\n    u,\n    c,\n    l = 0,\n    h = {},\n    p = 0,\n    f = 0,\n    d = [],\n    m = { useRecords: !1, mapsAsObjects: !0 };\n  class g {}\n  const v = new g();\n  v.name = \"MessagePack 0xC1\";\n  var y = !1,\n    b = 2;\n  try {\n    new Function(\"\");\n  } catch (t) {\n    b = 1 / 0;\n  }\n  class x {\n    constructor(t) {\n      (t &&\n        (!1 === t.useRecords &&\n          void 0 === t.mapsAsObjects &&\n          (t.mapsAsObjects = !0),\n        t.sequential &&\n          !1 !== t.trusted &&\n          ((t.trusted = !0),\n          t.structures ||\n            0 == t.useRecords ||\n            ((t.structures = []),\n            t.maxSharedStructures || (t.maxSharedStructures = 0))),\n        t.structures\n          ? (t.structures.sharedLength = t.structures.length)\n          : t.getStructures &&\n            (((t.structures = []).uninitialized = !0),\n            (t.structures.sharedLength = 0)),\n        t.int64AsNumber && (t.int64AsType = \"number\")),\n        Object.assign(this, t));\n    }\n    unpack(t, n) {\n      if (r)\n        return Y(\n          () => (\n            Z(),\n            this ? this.unpack(t, n) : x.prototype.unpack.call(m, t, n)\n          )\n        );\n      (t.buffer ||\n        t.constructor !== ArrayBuffer ||\n        (t = void 0 !== e ? e.from(t) : new Uint8Array(t)),\n        \"object\" == typeof n\n          ? ((i = n.end || t.length), (l = n.start || 0))\n          : ((l = 0), (i = n > -1 ? n : t.length)),\n        (f = 0),\n        (o = null),\n        (s = null),\n        (r = t));\n      try {\n        c =\n          t.dataView ||\n          (t.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength));\n      } catch (e) {\n        if (((r = null), t instanceof Uint8Array)) throw e;\n        throw new Error(\n          \"Source must be a Uint8Array or Buffer but was a \" +\n            (t && \"object\" == typeof t ? t.constructor.name : typeof t)\n        );\n      }\n      if (this instanceof x) {\n        if (((h = this), this.structures)) return ((a = this.structures), w(n));\n        (!a || a.length > 0) && (a = []);\n      } else ((h = m), (!a || a.length > 0) && (a = []));\n      return w(n);\n    }\n    unpackMultiple(t, e) {\n      let n,\n        r = 0;\n      try {\n        y = !0;\n        let i = t.length,\n          a = this ? this.unpack(t, i) : Q.unpack(t, i);\n        if (!e) {\n          for (n = [a]; l < i; ) ((r = l), n.push(w()));\n          return n;\n        }\n        if (!1 === e(a, r, l)) return;\n        for (; l < i; ) if (((r = l), !1 === e(w(), r, l))) return;\n      } catch (t) {\n        throw ((t.lastPosition = r), (t.values = n), t);\n      } finally {\n        ((y = !1), Z());\n      }\n    }\n    _mergeStructures(t, e) {\n      ((t = t || []), Object.isFrozen(t) && (t = t.map((t) => t.slice(0))));\n      for (let e = 0, n = t.length; e < n; e++) {\n        let n = t[e];\n        n && ((n.isShared = !0), e >= 32 && (n.highByte = (e - 32) >> 5));\n      }\n      t.sharedLength = t.length;\n      for (let n in e || [])\n        if (n >= 0) {\n          let r = t[n],\n            i = e[n];\n          i &&\n            (r && ((t.restoreStructures || (t.restoreStructures = []))[n] = r),\n            (t[n] = i));\n        }\n      return (this.structures = t);\n    }\n    decode(t, e) {\n      return this.unpack(t, e);\n    }\n  }\n  function w(t) {\n    try {\n      if (!h.trusted && !y) {\n        let t = a.sharedLength || 0;\n        t < a.length && (a.length = t);\n      }\n      let t;\n      if (\n        (h.randomAccessStructure && r[l] < 64 && r[l],\n        (t = S()),\n        s && ((l = s.postBundlePosition), (s = null)),\n        y && (a.restoreStructures = null),\n        l == i)\n      )\n        (a && a.restoreStructures && _(),\n          (a = null),\n          (r = null),\n          u && (u = null));\n      else {\n        if (l > i) throw new Error(\"Unexpected end of MessagePack data\");\n        if (!y) {\n          let e;\n          try {\n            e = JSON.stringify(t, (t, e) =>\n              \"bigint\" == typeof e ? `${e}n` : e\n            ).slice(0, 100);\n          } catch (t) {\n            e = \"(JSON view not available \" + t + \")\";\n          }\n          throw new Error(\"Data read, but end of buffer not reached \" + e);\n        }\n      }\n      return t;\n    } catch (t) {\n      throw (\n        a && a.restoreStructures && _(),\n        Z(),\n        (t instanceof RangeError ||\n          t.message.startsWith(\"Unexpected end of buffer\") ||\n          l > i) &&\n          (t.incomplete = !0),\n        t\n      );\n    }\n  }\n  function _() {\n    for (let t in a.restoreStructures) a[t] = a.restoreStructures[t];\n    a.restoreStructures = null;\n  }\n  function S() {\n    let t = r[l++];\n    if (t < 160) {\n      if (t < 128) {\n        if (t < 64) return t;\n        {\n          let e = a[63 & t] || (h.getStructures && I()[63 & t]);\n          return e ? (e.read || (e.read = E(e, 63 & t)), e.read()) : t;\n        }\n      }\n      if (t < 144) {\n        if (((t -= 128), h.mapsAsObjects)) {\n          let e = {};\n          for (let n = 0; n < t; n++) {\n            let t = W();\n            (\"__proto__\" === t && (t = \"__proto_\"), (e[t] = S()));\n          }\n          return e;\n        }\n        {\n          let e = new Map();\n          for (let n = 0; n < t; n++) e.set(S(), S());\n          return e;\n        }\n      }\n      {\n        t -= 144;\n        let e = new Array(t);\n        for (let n = 0; n < t; n++) e[n] = S();\n        return h.freezeData ? Object.freeze(e) : e;\n      }\n    }\n    if (t < 192) {\n      let e = t - 160;\n      if (f >= l) return o.slice(l - p, (l += e) - p);\n      if (0 == f && i < 140) {\n        let t = e < 16 ? L(e) : P(e);\n        if (null != t) return t;\n      }\n      return A(e);\n    }\n    {\n      let e;\n      switch (t) {\n        case 192:\n          return null;\n        case 193:\n          return s\n            ? ((e = S()),\n              e > 0\n                ? s[1].slice(s.position1, (s.position1 += e))\n                : s[0].slice(s.position0, (s.position0 -= e)))\n            : v;\n        case 194:\n          return !1;\n        case 195:\n          return !0;\n        case 196:\n          if (((e = r[l++]), void 0 === e))\n            throw new Error(\"Unexpected end of buffer\");\n          return z(e);\n        case 197:\n          return ((e = c.getUint16(l)), (l += 2), z(e));\n        case 198:\n          return ((e = c.getUint32(l)), (l += 4), z(e));\n        case 199:\n          return U(r[l++]);\n        case 200:\n          return ((e = c.getUint16(l)), (l += 2), U(e));\n        case 201:\n          return ((e = c.getUint32(l)), (l += 4), U(e));\n        case 202:\n          if (((e = c.getFloat32(l)), h.useFloat32 > 2)) {\n            let t = $[((127 & r[l]) << 1) | (r[l + 1] >> 7)];\n            return ((l += 4), ((t * e + (e > 0 ? 0.5 : -0.5)) | 0) / t);\n          }\n          return ((l += 4), e);\n        case 203:\n          return ((e = c.getFloat64(l)), (l += 8), e);\n        case 204:\n          return r[l++];\n        case 205:\n          return ((e = c.getUint16(l)), (l += 2), e);\n        case 206:\n          return ((e = c.getUint32(l)), (l += 4), e);\n        case 207:\n          return (\n            \"number\" === h.int64AsType\n              ? ((e = 4294967296 * c.getUint32(l)), (e += c.getUint32(l + 4)))\n              : \"string\" === h.int64AsType\n                ? (e = c.getBigUint64(l).toString())\n                : \"auto\" === h.int64AsType\n                  ? ((e = c.getBigUint64(l)),\n                    e <= BigInt(2) << BigInt(52) && (e = Number(e)))\n                  : (e = c.getBigUint64(l)),\n            (l += 8),\n            e\n          );\n        case 208:\n          return c.getInt8(l++);\n        case 209:\n          return ((e = c.getInt16(l)), (l += 2), e);\n        case 210:\n          return ((e = c.getInt32(l)), (l += 4), e);\n        case 211:\n          return (\n            \"number\" === h.int64AsType\n              ? ((e = 4294967296 * c.getInt32(l)), (e += c.getUint32(l + 4)))\n              : \"string\" === h.int64AsType\n                ? (e = c.getBigInt64(l).toString())\n                : \"auto\" === h.int64AsType\n                  ? ((e = c.getBigInt64(l)),\n                    e >= BigInt(-2) << BigInt(52) &&\n                      e <= BigInt(2) << BigInt(52) &&\n                      (e = Number(e)))\n                  : (e = c.getBigInt64(l)),\n            (l += 8),\n            e\n          );\n        case 212:\n          if (((e = r[l++]), 114 == e)) return j(63 & r[l++]);\n          {\n            let t = d[e];\n            if (t)\n              return t.read\n                ? (l++, t.read(S()))\n                : t.noBuffer\n                  ? (l++, t())\n                  : t(r.subarray(l, ++l));\n            throw new Error(\"Unknown extension \" + e);\n          }\n        case 213:\n          return ((e = r[l]), 114 == e ? (l++, j(63 & r[l++], r[l++])) : U(2));\n        case 214:\n          return U(4);\n        case 215:\n          return U(8);\n        case 216:\n          return U(16);\n        case 217:\n          return ((e = r[l++]), f >= l ? o.slice(l - p, (l += e) - p) : N(e));\n        case 218:\n          return (\n            (e = c.getUint16(l)),\n            f >= (l += 2) ? o.slice(l - p, (l += e) - p) : C(e)\n          );\n        case 219:\n          return (\n            (e = c.getUint32(l)),\n            f >= (l += 4) ? o.slice(l - p, (l += e) - p) : R(e)\n          );\n        case 220:\n          return ((e = c.getUint16(l)), (l += 2), D(e));\n        case 221:\n          return ((e = c.getUint32(l)), (l += 4), D(e));\n        case 222:\n          return ((e = c.getUint16(l)), (l += 2), M(e));\n        case 223:\n          return ((e = c.getUint32(l)), (l += 4), M(e));\n        default:\n          if (t >= 224) return t - 256;\n          if (void 0 === t) {\n            let t = new Error(\"Unexpected end of MessagePack data\");\n            throw ((t.incomplete = !0), t);\n          }\n          throw new Error(\"Unknown MessagePack token \" + t);\n      }\n    }\n  }\n  const T = /^[a-zA-Z_$][a-zA-Z\\d_$]*$/;\n  function E(t, e) {\n    function n() {\n      if (n.count++ > b) {\n        let n = (t.read = new Function(\n          \"r\",\n          \"return function(){return \" +\n            (h.freezeData ? \"Object.freeze\" : \"\") +\n            \"({\" +\n            t\n              .map((t) =>\n                \"__proto__\" === t\n                  ? \"__proto_:r()\"\n                  : T.test(t)\n                    ? t + \":r()\"\n                    : \"[\" + JSON.stringify(t) + \"]:r()\"\n              )\n              .join(\",\") +\n            \"})}\"\n        )(S));\n        return (0 === t.highByte && (t.read = k(e, t.read)), n());\n      }\n      let r = {};\n      for (let e = 0, n = t.length; e < n; e++) {\n        let n = t[e];\n        (\"__proto__\" === n && (n = \"__proto_\"), (r[n] = S()));\n      }\n      return h.freezeData ? Object.freeze(r) : r;\n    }\n    return ((n.count = 0), 0 === t.highByte ? k(e, n) : n);\n  }\n  const k = (t, e) =>\n    function () {\n      let n = r[l++];\n      if (0 === n) return e();\n      let i = t < 32 ? -(t + (n << 5)) : t + (n << 5),\n        o = a[i] || I()[i];\n      if (!o) throw new Error(\"Record id is not defined for \" + i);\n      return (o.read || (o.read = E(o, t)), o.read());\n    };\n  function I() {\n    let t = Y(() => ((r = null), h.getStructures()));\n    return (a = h._mergeStructures(t, a));\n  }\n  var A = O,\n    N = O,\n    C = O,\n    R = O;\n  function O(t) {\n    let e;\n    if (t < 16 && (e = L(t))) return e;\n    if (t > 64 && n) return n.decode(r.subarray(l, (l += t)));\n    const i = l + t,\n      a = [];\n    for (e = \"\"; l < i; ) {\n      const t = r[l++];\n      if (128 & t)\n        if (192 == (224 & t)) {\n          const e = 63 & r[l++];\n          a.push(((31 & t) << 6) | e);\n        } else if (224 == (240 & t)) {\n          const e = 63 & r[l++],\n            n = 63 & r[l++];\n          a.push(((31 & t) << 12) | (e << 6) | n);\n        } else if (240 == (248 & t)) {\n          let e =\n            ((7 & t) << 18) |\n            ((63 & r[l++]) << 12) |\n            ((63 & r[l++]) << 6) |\n            (63 & r[l++]);\n          (e > 65535 &&\n            ((e -= 65536),\n            a.push(((e >>> 10) & 1023) | 55296),\n            (e = 56320 | (1023 & e))),\n            a.push(e));\n        } else a.push(t);\n      else a.push(t);\n      a.length >= 4096 && ((e += F.apply(String, a)), (a.length = 0));\n    }\n    return (a.length > 0 && (e += F.apply(String, a)), e);\n  }\n  function D(t) {\n    let e = new Array(t);\n    for (let n = 0; n < t; n++) e[n] = S();\n    return h.freezeData ? Object.freeze(e) : e;\n  }\n  function M(t) {\n    if (h.mapsAsObjects) {\n      let e = {};\n      for (let n = 0; n < t; n++) {\n        let t = W();\n        (\"__proto__\" === t && (t = \"__proto_\"), (e[t] = S()));\n      }\n      return e;\n    }\n    {\n      let e = new Map();\n      for (let n = 0; n < t; n++) e.set(S(), S());\n      return e;\n    }\n  }\n  var F = String.fromCharCode;\n  function P(t) {\n    let e = l,\n      n = new Array(t);\n    for (let i = 0; i < t; i++) {\n      const t = r[l++];\n      if ((128 & t) > 0) return void (l = e);\n      n[i] = t;\n    }\n    return F.apply(String, n);\n  }\n  function L(t) {\n    if (t < 4) {\n      if (t < 2) {\n        if (0 === t) return \"\";\n        {\n          let t = r[l++];\n          return (128 & t) > 1 ? void (l -= 1) : F(t);\n        }\n      }\n      {\n        let e = r[l++],\n          n = r[l++];\n        if ((128 & e) > 0 || (128 & n) > 0) return void (l -= 2);\n        if (t < 3) return F(e, n);\n        let i = r[l++];\n        return (128 & i) > 0 ? void (l -= 3) : F(e, n, i);\n      }\n    }\n    {\n      let e = r[l++],\n        n = r[l++],\n        i = r[l++],\n        a = r[l++];\n      if ((128 & e) > 0 || (128 & n) > 0 || (128 & i) > 0 || (128 & a) > 0)\n        return void (l -= 4);\n      if (t < 6) {\n        if (4 === t) return F(e, n, i, a);\n        {\n          let t = r[l++];\n          return (128 & t) > 0 ? void (l -= 5) : F(e, n, i, a, t);\n        }\n      }\n      if (t < 8) {\n        let o = r[l++],\n          s = r[l++];\n        if ((128 & o) > 0 || (128 & s) > 0) return void (l -= 6);\n        if (t < 7) return F(e, n, i, a, o, s);\n        let u = r[l++];\n        return (128 & u) > 0 ? void (l -= 7) : F(e, n, i, a, o, s, u);\n      }\n      {\n        let o = r[l++],\n          s = r[l++],\n          u = r[l++],\n          c = r[l++];\n        if ((128 & o) > 0 || (128 & s) > 0 || (128 & u) > 0 || (128 & c) > 0)\n          return void (l -= 8);\n        if (t < 10) {\n          if (8 === t) return F(e, n, i, a, o, s, u, c);\n          {\n            let t = r[l++];\n            return (128 & t) > 0 ? void (l -= 9) : F(e, n, i, a, o, s, u, c, t);\n          }\n        }\n        if (t < 12) {\n          let h = r[l++],\n            p = r[l++];\n          if ((128 & h) > 0 || (128 & p) > 0) return void (l -= 10);\n          if (t < 11) return F(e, n, i, a, o, s, u, c, h, p);\n          let f = r[l++];\n          return (128 & f) > 0\n            ? void (l -= 11)\n            : F(e, n, i, a, o, s, u, c, h, p, f);\n        }\n        {\n          let h = r[l++],\n            p = r[l++],\n            f = r[l++],\n            d = r[l++];\n          if ((128 & h) > 0 || (128 & p) > 0 || (128 & f) > 0 || (128 & d) > 0)\n            return void (l -= 12);\n          if (t < 14) {\n            if (12 === t) return F(e, n, i, a, o, s, u, c, h, p, f, d);\n            {\n              let t = r[l++];\n              return (128 & t) > 0\n                ? void (l -= 13)\n                : F(e, n, i, a, o, s, u, c, h, p, f, d, t);\n            }\n          }\n          {\n            let m = r[l++],\n              g = r[l++];\n            if ((128 & m) > 0 || (128 & g) > 0) return void (l -= 14);\n            if (t < 15) return F(e, n, i, a, o, s, u, c, h, p, f, d, m, g);\n            let v = r[l++];\n            return (128 & v) > 0\n              ? void (l -= 15)\n              : F(e, n, i, a, o, s, u, c, h, p, f, d, m, g, v);\n          }\n        }\n      }\n    }\n  }\n  function B() {\n    let t,\n      e = r[l++];\n    if (e < 192) t = e - 160;\n    else\n      switch (e) {\n        case 217:\n          t = r[l++];\n          break;\n        case 218:\n          ((t = c.getUint16(l)), (l += 2));\n          break;\n        case 219:\n          ((t = c.getUint32(l)), (l += 4));\n          break;\n        default:\n          throw new Error(\"Expected string\");\n      }\n    return O(t);\n  }\n  function z(t) {\n    return h.copyBuffers\n      ? Uint8Array.prototype.slice.call(r, l, (l += t))\n      : r.subarray(l, (l += t));\n  }\n  function U(t) {\n    let e = r[l++];\n    if (d[e]) {\n      let n,\n        i = l;\n      return d[e](\n        r.subarray(l, (n = l += t)),\n        (t) => {\n          l = t;\n          try {\n            return S();\n          } finally {\n            l = n;\n          }\n        },\n        i\n      );\n    }\n    throw new Error(\"Unknown extension type \" + e);\n  }\n  var G = new Array(4096);\n  function W() {\n    let t = r[l++];\n    if (!(t >= 160 && t < 192)) return (l--, V(S()));\n    if (((t -= 160), f >= l)) return o.slice(l - p, (l += t) - p);\n    if (!(0 == f && i < 180)) return A(t);\n    let e,\n      n = 4095 & ((t << 5) ^ (t > 1 ? c.getUint16(l) : t > 0 ? r[l] : 0)),\n      a = G[n],\n      s = l,\n      u = l + t - 3,\n      h = 0;\n    if (a && a.bytes == t) {\n      for (; s < u; ) {\n        if (((e = c.getUint32(s)), e != a[h++])) {\n          s = 1879048192;\n          break;\n        }\n        s += 4;\n      }\n      for (u += 3; s < u; )\n        if (((e = r[s++]), e != a[h++])) {\n          s = 1879048192;\n          break;\n        }\n      if (s === u) return ((l = s), a.string);\n      ((u -= 3), (s = l));\n    }\n    for (a = [], G[n] = a, a.bytes = t; s < u; )\n      ((e = c.getUint32(s)), a.push(e), (s += 4));\n    for (u += 3; s < u; ) ((e = r[s++]), a.push(e));\n    let d = t < 16 ? L(t) : P(t);\n    return (a.string = null != d ? d : A(t));\n  }\n  function V(t) {\n    if (\"string\" == typeof t) return t;\n    if (\"number\" == typeof t || \"boolean\" == typeof t || \"bigint\" == typeof t)\n      return t.toString();\n    if (null == t) return t + \"\";\n    throw new Error(\"Invalid property type for record\", typeof t);\n  }\n  const j = (t, e) => {\n    let n = S().map(V),\n      r = t;\n    void 0 !== e &&\n      ((t = t < 32 ? -((e << 5) + t) : (e << 5) + t), (n.highByte = e));\n    let i = a[t];\n    return (\n      i &&\n        (i.isShared || y) &&\n        ((a.restoreStructures || (a.restoreStructures = []))[t] = i),\n      (a[t] = n),\n      (n.read = E(n, r)),\n      n.read()\n    );\n  };\n  ((d[0] = () => {}),\n    (d[0].noBuffer = !0),\n    (d[66] = (t) => {\n      let e = t.length,\n        n = BigInt(128 & t[0] ? t[0] - 256 : t[0]);\n      for (let r = 1; r < e; r++) ((n <<= 8n), (n += BigInt(t[r])));\n      return n;\n    }));\n  let H = { Error, TypeError, ReferenceError };\n  ((d[101] = () => {\n    let t = S();\n    return (H[t[0]] || Error)(t[1]);\n  }),\n    (d[105] = (t) => {\n      if (!1 === h.structuredClone)\n        throw new Error(\"Structured clone extension is disabled\");\n      let e = c.getUint32(l - 4);\n      u || (u = new Map());\n      let n,\n        i = r[l];\n      n = (i >= 144 && i < 160) || 220 == i || 221 == i ? [] : {};\n      let a = { target: n };\n      u.set(e, a);\n      let o = S();\n      return a.used ? Object.assign(n, o) : ((a.target = o), o);\n    }),\n    (d[112] = (t) => {\n      if (!1 === h.structuredClone)\n        throw new Error(\"Structured clone extension is disabled\");\n      let e = c.getUint32(l - 4),\n        n = u.get(e);\n      return ((n.used = !0), n.target);\n    }),\n    (d[115] = () => new Set(S())));\n  const X = [\n    \"Int8\",\n    \"Uint8\",\n    \"Uint8Clamped\",\n    \"Int16\",\n    \"Uint16\",\n    \"Int32\",\n    \"Uint32\",\n    \"Float32\",\n    \"Float64\",\n    \"BigInt64\",\n    \"BigUint64\"\n  ].map((t) => t + \"Array\");\n  let q = \"object\" == typeof globalThis ? globalThis : window;\n  ((d[116] = (t) => {\n    let e = t[0],\n      n = X[e];\n    if (!n) {\n      if (16 === e) {\n        let e = new ArrayBuffer(t.length - 1);\n        return (new Uint8Array(e).set(t.subarray(1)), e);\n      }\n      throw new Error(\"Could not find typed array for code \" + e);\n    }\n    return new q[n](Uint8Array.prototype.slice.call(t, 1).buffer);\n  }),\n    (d[120] = () => {\n      let t = S();\n      return new RegExp(t[0], t[1]);\n    }));\n  const K = [];\n  function Y(t) {\n    let e = i,\n      n = l,\n      d = p,\n      m = f,\n      g = o,\n      v = u,\n      b = s,\n      x = new Uint8Array(r.slice(0, i)),\n      w = a,\n      _ = a.slice(0, a.length),\n      S = h,\n      T = y,\n      E = t();\n    return (\n      (i = e),\n      (l = n),\n      (p = d),\n      (f = m),\n      (o = g),\n      (u = v),\n      (s = b),\n      (r = x),\n      (y = T),\n      (a = w).splice(0, a.length, ..._),\n      (h = S),\n      (c = new DataView(r.buffer, r.byteOffset, r.byteLength)),\n      E\n    );\n  }\n  function Z() {\n    ((r = null), (u = null), (a = null));\n  }\n  ((d[98] = (t) => {\n    let e = (t[0] << 24) + (t[1] << 16) + (t[2] << 8) + t[3],\n      n = l;\n    return (\n      (l += e - t.length),\n      (s = K),\n      ((s = [B(), B()]).position0 = 0),\n      (s.position1 = 0),\n      (s.postBundlePosition = l),\n      (l = n),\n      S()\n    );\n  }),\n    (d[255] = (t) =>\n      4 == t.length\n        ? new Date(1e3 * (16777216 * t[0] + (t[1] << 16) + (t[2] << 8) + t[3]))\n        : 8 == t.length\n          ? new Date(\n              ((t[0] << 22) + (t[1] << 14) + (t[2] << 6) + (t[3] >> 2)) / 1e6 +\n                1e3 *\n                  (4294967296 * (3 & t[3]) +\n                    16777216 * t[4] +\n                    (t[5] << 16) +\n                    (t[6] << 8) +\n                    t[7])\n            )\n          : 12 == t.length\n            ? new Date(\n                ((t[0] << 24) + (t[1] << 16) + (t[2] << 8) + t[3]) / 1e6 +\n                  1e3 *\n                    ((128 & t[4] ? -281474976710656 : 0) +\n                      1099511627776 * t[6] +\n                      4294967296 * t[7] +\n                      16777216 * t[8] +\n                      (t[9] << 16) +\n                      (t[10] << 8) +\n                      t[11])\n              )\n            : new Date(\"invalid\")));\n  const $ = new Array(147);\n  for (let t = 0; t < 256; t++)\n    $[t] = +(\"1e\" + Math.floor(45.15 - 0.30103 * t));\n  const J = x;\n  var Q = new x({ useRecords: !1 });\n  const tt = Q.unpack,\n    et = Q.unpackMultiple,\n    nt = Q.unpack,\n    rt = { NEVER: 0, ALWAYS: 1, DECIMAL_ROUND: 3, DECIMAL_FIT: 4 };\n  let it,\n    at,\n    ot,\n    st = new Float32Array(1),\n    ut = new Uint8Array(st.buffer, 0, 4);\n  try {\n    it = new TextEncoder();\n  } catch (t) {}\n  const ct = void 0 !== Buffer,\n    lt = ct\n      ? function (t) {\n          return Buffer.allocUnsafeSlow(t);\n        }\n      : Uint8Array,\n    ht = ct ? Buffer : Uint8Array,\n    pt = ct ? 4294967296 : 2144337920;\n  let ft,\n    dt,\n    mt,\n    gt,\n    vt = 0,\n    yt = null;\n  const bt = /[\\u0080-\\uFFFF]/,\n    xt = Symbol(\"record-id\");\n  class wt extends x {\n    constructor(t) {\n      let e, n, r, i;\n      (super(t), (this.offset = 0));\n      let a = ht.prototype.utf8Write\n          ? function (t, e) {\n              return ft.utf8Write(t, e, 4294967295);\n            }\n          : !(!it || !it.encodeInto) &&\n            function (t, e) {\n              return it.encodeInto(t, ft.subarray(e)).written;\n            },\n        o = this;\n      t || (t = {});\n      let s = t && t.sequential,\n        u = t.structures || t.saveStructures,\n        c = t.maxSharedStructures;\n      if ((null == c && (c = u ? 32 : 0), c > 8160))\n        throw new Error(\"Maximum maxSharedStructure is 8160\");\n      t.structuredClone && null == t.moreTypes && (this.moreTypes = !0);\n      let l = t.maxOwnStructures;\n      (null == l && (l = u ? 32 : 64),\n        this.structures || 0 == t.useRecords || (this.structures = []));\n      let h = c > 32 || l + c > 64,\n        p = c + 64,\n        f = c + l + 64;\n      if (f > 8256)\n        throw new Error(\"Maximum maxSharedStructure + maxOwnStructure is 8192\");\n      let d = [],\n        m = 0,\n        g = 0;\n      this.pack = this.encode = function (t, a) {\n        if (\n          (ft ||\n            ((ft = new lt(8192)),\n            (mt =\n              ft.dataView || (ft.dataView = new DataView(ft.buffer, 0, 8192))),\n            (vt = 0)),\n          (gt = ft.length - 10),\n          gt - vt < 2048\n            ? ((ft = new lt(ft.length)),\n              (mt =\n                ft.dataView ||\n                (ft.dataView = new DataView(ft.buffer, 0, ft.length))),\n              (gt = ft.length - 10),\n              (vt = 0))\n            : (vt = (vt + 7) & 2147483640),\n          (e = vt),\n          a & Pt && (vt += 255 & a),\n          (i = o.structuredClone ? new Map() : null),\n          o.bundleStrings && \"string\" != typeof t\n            ? ((yt = []), (yt.size = 1 / 0))\n            : (yt = null),\n          (r = o.structures),\n          r)\n        ) {\n          r.uninitialized && (r = o._mergeStructures(o.getStructures()));\n          let t = r.sharedLength || 0;\n          if (t > c)\n            throw new Error(\n              \"Shared structures is larger than maximum shared structures, try increasing maxSharedStructures to \" +\n                r.sharedLength\n            );\n          if (!r.transitions) {\n            r.transitions = Object.create(null);\n            for (let e = 0; e < t; e++) {\n              let t = r[e];\n              if (!t) continue;\n              let n,\n                i = r.transitions;\n              for (let e = 0, r = t.length; e < r; e++) {\n                let r = t[e];\n                ((n = i[r]), n || (n = i[r] = Object.create(null)), (i = n));\n              }\n              i[xt] = e + 64;\n            }\n            this.lastNamedStructuresLength = t;\n          }\n          s || (r.nextId = t + 64);\n        }\n        let u;\n        n && (n = !1);\n        try {\n          o.randomAccessStructure &&\n          t &&\n          t.constructor &&\n          t.constructor === Object\n            ? I(t)\n            : b(t);\n          let n = yt;\n          if ((yt && Et(e, b, 0), i && i.idsToInsert)) {\n            let t = i.idsToInsert.sort((t, e) =>\n                t.offset > e.offset ? 1 : -1\n              ),\n              r = t.length,\n              a = -1;\n            for (; n && r > 0; ) {\n              let i = t[--r].offset + e;\n              (i < n.stringsPosition + e && -1 === a && (a = 0),\n                i > n.position + e\n                  ? a >= 0 && (a += 6)\n                  : (a >= 0 &&\n                      (mt.setUint32(\n                        n.position + e,\n                        mt.getUint32(n.position + e) + a\n                      ),\n                      (a = -1)),\n                    (n = n.previous),\n                    r++));\n            }\n            (a >= 0 &&\n              n &&\n              mt.setUint32(n.position + e, mt.getUint32(n.position + e) + a),\n              (vt += 6 * t.length),\n              vt > gt && T(vt),\n              (o.offset = vt));\n            let s = (function (t, e) {\n              let n,\n                r = 6 * e.length,\n                i = t.length - r;\n              for (; (n = e.pop()); ) {\n                let e = n.offset,\n                  a = n.id;\n                (t.copyWithin(e + r, e, i), (r -= 6));\n                let o = e + r;\n                ((t[o++] = 214),\n                  (t[o++] = 105),\n                  (t[o++] = a >> 24),\n                  (t[o++] = (a >> 16) & 255),\n                  (t[o++] = (a >> 8) & 255),\n                  (t[o++] = 255 & a),\n                  (i = e));\n              }\n              return t;\n            })(ft.subarray(e, vt), t);\n            return ((i = null), s);\n          }\n          return (\n            (o.offset = vt),\n            a & Mt ? ((ft.start = e), (ft.end = vt), ft) : ft.subarray(e, vt)\n          );\n        } catch (t) {\n          throw ((u = t), t);\n        } finally {\n          if (r && (v(), n && o.saveStructures)) {\n            let n = r.sharedLength || 0,\n              i = ft.subarray(e, vt),\n              s = (function (t, e) {\n                return (\n                  (t.isCompatible = (t) => {\n                    let n =\n                      !t || (e.lastNamedStructuresLength || 0) === t.length;\n                    return (n || e._mergeStructures(t), n);\n                  }),\n                  t\n                );\n              })(r, o);\n            if (!u)\n              return !1 === o.saveStructures(s, s.isCompatible)\n                ? o.pack(t, a)\n                : ((o.lastNamedStructuresLength = n),\n                  ft.length > 1073741824 && (ft = null),\n                  i);\n          }\n          (ft.length > 1073741824 && (ft = null), a & Ft && (vt = e));\n        }\n      };\n      const v = () => {\n          g < 10 && g++;\n          let t = r.sharedLength || 0;\n          if ((r.length > t && !s && (r.length = t), m > 1e4))\n            ((r.transitions = null),\n              (g = 0),\n              (m = 0),\n              d.length > 0 && (d = []));\n          else if (d.length > 0 && !s) {\n            for (let t = 0, e = d.length; t < e; t++) d[t][xt] = 0;\n            d = [];\n          }\n        },\n        y = (t) => {\n          var e = t.length;\n          e < 16\n            ? (ft[vt++] = 144 | e)\n            : e < 65536\n              ? ((ft[vt++] = 220), (ft[vt++] = e >> 8), (ft[vt++] = 255 & e))\n              : ((ft[vt++] = 221), mt.setUint32(vt, e), (vt += 4));\n          for (let n = 0; n < e; n++) b(t[n]);\n        },\n        b = (t) => {\n          vt > gt && (ft = T(vt));\n          var n,\n            r = typeof t;\n          if (\"string\" === r) {\n            let r,\n              i = t.length;\n            if (yt && i >= 4 && i < 4096) {\n              if ((yt.size += i) > 21760) {\n                let t,\n                  n,\n                  r = (yt[0] ? 3 * yt[0].length + yt[1].length : 0) + 10;\n                (vt + r > gt && (ft = T(vt + r)),\n                  yt.position\n                    ? ((n = yt),\n                      (ft[vt] = 200),\n                      (vt += 3),\n                      (ft[vt++] = 98),\n                      (t = vt - e),\n                      (vt += 4),\n                      Et(e, b, 0),\n                      mt.setUint16(t + e - 3, vt - e - t))\n                    : ((ft[vt++] = 214),\n                      (ft[vt++] = 98),\n                      (t = vt - e),\n                      (vt += 4)),\n                  (yt = [\"\", \"\"]),\n                  (yt.previous = n),\n                  (yt.size = 0),\n                  (yt.position = t));\n              }\n              let n = bt.test(t);\n              return (\n                (yt[n ? 0 : 1] += t),\n                (ft[vt++] = 193),\n                void b(n ? -i : i)\n              );\n            }\n            r = i < 32 ? 1 : i < 256 ? 2 : i < 65536 ? 3 : 5;\n            let o = 3 * i;\n            if ((vt + o > gt && (ft = T(vt + o)), i < 64 || !a)) {\n              let e,\n                a,\n                o,\n                s = vt + r;\n              for (e = 0; e < i; e++)\n                ((a = t.charCodeAt(e)),\n                  a < 128\n                    ? (ft[s++] = a)\n                    : a < 2048\n                      ? ((ft[s++] = (a >> 6) | 192), (ft[s++] = (63 & a) | 128))\n                      : 55296 == (64512 & a) &&\n                          56320 == (64512 & (o = t.charCodeAt(e + 1)))\n                        ? ((a = 65536 + ((1023 & a) << 10) + (1023 & o)),\n                          e++,\n                          (ft[s++] = (a >> 18) | 240),\n                          (ft[s++] = ((a >> 12) & 63) | 128),\n                          (ft[s++] = ((a >> 6) & 63) | 128),\n                          (ft[s++] = (63 & a) | 128))\n                        : ((ft[s++] = (a >> 12) | 224),\n                          (ft[s++] = ((a >> 6) & 63) | 128),\n                          (ft[s++] = (63 & a) | 128)));\n              n = s - vt - r;\n            } else n = a(t, vt + r);\n            (n < 32\n              ? (ft[vt++] = 160 | n)\n              : n < 256\n                ? (r < 2 && ft.copyWithin(vt + 2, vt + 1, vt + 1 + n),\n                  (ft[vt++] = 217),\n                  (ft[vt++] = n))\n                : n < 65536\n                  ? (r < 3 && ft.copyWithin(vt + 3, vt + 2, vt + 2 + n),\n                    (ft[vt++] = 218),\n                    (ft[vt++] = n >> 8),\n                    (ft[vt++] = 255 & n))\n                  : (r < 5 && ft.copyWithin(vt + 5, vt + 3, vt + 3 + n),\n                    (ft[vt++] = 219),\n                    mt.setUint32(vt, n),\n                    (vt += 4)),\n              (vt += n));\n          } else if (\"number\" === r)\n            if (t >>> 0 === t)\n              t < 32 ||\n              (t < 128 && !1 === this.useRecords) ||\n              (t < 64 && !this.randomAccessStructure)\n                ? (ft[vt++] = t)\n                : t < 256\n                  ? ((ft[vt++] = 204), (ft[vt++] = t))\n                  : t < 65536\n                    ? ((ft[vt++] = 205),\n                      (ft[vt++] = t >> 8),\n                      (ft[vt++] = 255 & t))\n                    : ((ft[vt++] = 206), mt.setUint32(vt, t), (vt += 4));\n            else if ((t | 0) === t)\n              t >= -32\n                ? (ft[vt++] = 256 + t)\n                : t >= -128\n                  ? ((ft[vt++] = 208), (ft[vt++] = t + 256))\n                  : t >= -32768\n                    ? ((ft[vt++] = 209), mt.setInt16(vt, t), (vt += 2))\n                    : ((ft[vt++] = 210), mt.setInt32(vt, t), (vt += 4));\n            else {\n              let e;\n              if (\n                (e = this.useFloat32) > 0 &&\n                t < 4294967296 &&\n                t >= -2147483648\n              ) {\n                let n;\n                if (\n                  ((ft[vt++] = 202),\n                  mt.setFloat32(vt, t),\n                  e < 4 ||\n                    ((n = t * $[((127 & ft[vt]) << 1) | (ft[vt + 1] >> 7)]) |\n                      0) ===\n                      n)\n                )\n                  return void (vt += 4);\n                vt--;\n              }\n              ((ft[vt++] = 203), mt.setFloat64(vt, t), (vt += 8));\n            }\n          else if (\"object\" === r || \"function\" === r)\n            if (t) {\n              if (i) {\n                let n = i.get(t);\n                if (n) {\n                  if (!n.id) {\n                    let t = i.idsToInsert || (i.idsToInsert = []);\n                    n.id = t.push(n);\n                  }\n                  return (\n                    (ft[vt++] = 214),\n                    (ft[vt++] = 112),\n                    mt.setUint32(vt, n.id),\n                    void (vt += 4)\n                  );\n                }\n                i.set(t, { offset: vt - e });\n              }\n              let a = t.constructor;\n              if (a === Object) S(t);\n              else if (a === Array) y(t);\n              else if (a === Map)\n                if (this.mapAsEmptyObject) ft[vt++] = 128;\n                else {\n                  (n = t.size) < 16\n                    ? (ft[vt++] = 128 | n)\n                    : n < 65536\n                      ? ((ft[vt++] = 222),\n                        (ft[vt++] = n >> 8),\n                        (ft[vt++] = 255 & n))\n                      : ((ft[vt++] = 223), mt.setUint32(vt, n), (vt += 4));\n                  for (let [e, n] of t) (b(e), b(n));\n                }\n              else {\n                for (let n = 0, r = at.length; n < r; n++) {\n                  if (t instanceof ot[n]) {\n                    let r = at[n];\n                    if (r.write) {\n                      r.type &&\n                        ((ft[vt++] = 212), (ft[vt++] = r.type), (ft[vt++] = 0));\n                      let e = r.write.call(this, t);\n                      return void (e === t\n                        ? Array.isArray(t)\n                          ? y(t)\n                          : S(t)\n                        : b(e));\n                    }\n                    let i,\n                      a = ft,\n                      o = mt,\n                      s = vt,\n                      u = e;\n                    ft = null;\n                    try {\n                      i = r.pack.call(\n                        this,\n                        t,\n                        (t) => (\n                          (ft = a),\n                          (a = null),\n                          (vt += t),\n                          vt > gt && T(vt),\n                          { target: ft, targetView: mt, position: vt - t }\n                        ),\n                        b\n                      );\n                    } finally {\n                      a &&\n                        ((ft = a),\n                        (mt = o),\n                        (vt = s),\n                        (e = u),\n                        (gt = ft.length - 10));\n                    }\n                    return void (\n                      i &&\n                      (i.length + vt > gt && T(i.length + vt),\n                      (vt = Tt(i, ft, vt, r.type)))\n                    );\n                  }\n                }\n                if (Array.isArray(t)) y(t);\n                else {\n                  if (t.toJSON) {\n                    const e = t.toJSON();\n                    if (e !== t) return b(e);\n                  }\n                  if (\"function\" === r)\n                    return b(this.writeFunction && this.writeFunction(t));\n                  S(t);\n                }\n              }\n            } else ft[vt++] = 192;\n          else if (\"boolean\" === r) ft[vt++] = t ? 195 : 194;\n          else if (\"bigint\" === r) {\n            if (t < BigInt(1) << BigInt(63) && t >= -(BigInt(1) << BigInt(63)))\n              ((ft[vt++] = 211), mt.setBigInt64(vt, t));\n            else if (t < BigInt(1) << BigInt(64) && t > 0)\n              ((ft[vt++] = 207), mt.setBigUint64(vt, t));\n            else {\n              if (!this.largeBigIntToFloat) {\n                if (\n                  this.useBigIntExtension &&\n                  t < 2n ** 1023n &&\n                  t > -(2n ** 1023n)\n                ) {\n                  ((ft[vt++] = 199), vt++, (ft[vt++] = 66));\n                  let e,\n                    n = [];\n                  do {\n                    let r = 0xffn & t;\n                    ((e = (0x80n & r) === (t < 0n ? 0x80n : 0n)),\n                      n.push(r),\n                      (t >>= 8n));\n                  } while ((0n !== t && -1n !== t) || !e);\n                  ft[vt - 2] = n.length;\n                  for (let t = n.length; t > 0; ) ft[vt++] = Number(n[--t]);\n                  return;\n                }\n                throw new RangeError(\n                  t +\n                    \" was too large to fit in MessagePack 64-bit integer format, use useBigIntExtension or set largeBigIntToFloat to convert to float-64\"\n                );\n              }\n              ((ft[vt++] = 203), mt.setFloat64(vt, Number(t)));\n            }\n            vt += 8;\n          } else {\n            if (\"undefined\" !== r) throw new Error(\"Unknown type: \" + r);\n            this.encodeUndefinedAsNil\n              ? (ft[vt++] = 192)\n              : ((ft[vt++] = 212), (ft[vt++] = 0), (ft[vt++] = 0));\n          }\n        },\n        x =\n          this.variableMapSize || this.coercibleKeyAsNumber\n            ? (t) => {\n                let e,\n                  n = Object.keys(t),\n                  r = n.length;\n                if (\n                  (r < 16\n                    ? (ft[vt++] = 128 | r)\n                    : r < 65536\n                      ? ((ft[vt++] = 222),\n                        (ft[vt++] = r >> 8),\n                        (ft[vt++] = 255 & r))\n                      : ((ft[vt++] = 223), mt.setUint32(vt, r), (vt += 4)),\n                  this.coercibleKeyAsNumber)\n                )\n                  for (let i = 0; i < r; i++) {\n                    e = n[i];\n                    let r = Number(e);\n                    (b(isNaN(r) ? e : r), b(t[e]));\n                  }\n                else for (let i = 0; i < r; i++) (b((e = n[i])), b(t[e]));\n              }\n            : (t) => {\n                ft[vt++] = 222;\n                let n = vt - e;\n                vt += 2;\n                let r = 0;\n                for (let e in t)\n                  (\"function\" != typeof t.hasOwnProperty ||\n                    t.hasOwnProperty(e)) &&\n                    (b(e), b(t[e]), r++);\n                ((ft[n++ + e] = r >> 8), (ft[n + e] = 255 & r));\n              },\n        w =\n          !1 === this.useRecords\n            ? x\n            : t.progressiveRecords && !h\n              ? (t) => {\n                  let n,\n                    i,\n                    a = r.transitions || (r.transitions = Object.create(null)),\n                    o = vt++ - e;\n                  for (let s in t)\n                    if (\n                      \"function\" != typeof t.hasOwnProperty ||\n                      t.hasOwnProperty(s)\n                    ) {\n                      if (((n = a[s]), n)) a = n;\n                      else {\n                        let u = Object.keys(t),\n                          c = a;\n                        a = r.transitions;\n                        let l = 0;\n                        for (let t = 0, e = u.length; t < e; t++) {\n                          let e = u[t];\n                          ((n = a[e]),\n                            n || ((n = a[e] = Object.create(null)), l++),\n                            (a = n));\n                        }\n                        (o + e + 1 == vt ? (vt--, E(a, u, l)) : k(a, u, o, l),\n                          (i = !0),\n                          (a = c[s]));\n                      }\n                      b(t[s]);\n                    }\n                  if (!i) {\n                    let n = a[xt];\n                    n ? (ft[o + e] = n) : k(a, Object.keys(t), o, 0);\n                  }\n                }\n              : (t) => {\n                  let e,\n                    n = r.transitions || (r.transitions = Object.create(null)),\n                    i = 0;\n                  for (let r in t)\n                    (\"function\" != typeof t.hasOwnProperty ||\n                      t.hasOwnProperty(r)) &&\n                      ((e = n[r]),\n                      e || ((e = n[r] = Object.create(null)), i++),\n                      (n = e));\n                  let a = n[xt];\n                  a\n                    ? a >= 96 && h\n                      ? ((ft[vt++] = 96 + (31 & (a -= 96))),\n                        (ft[vt++] = a >> 5))\n                      : (ft[vt++] = a)\n                    : E(n, n.__keys__ || Object.keys(t), i);\n                  for (let e in t)\n                    (\"function\" != typeof t.hasOwnProperty ||\n                      t.hasOwnProperty(e)) &&\n                      b(t[e]);\n                },\n        _ = \"function\" == typeof this.useRecords && this.useRecords,\n        S = _\n          ? (t) => {\n              _(t) ? w(t) : x(t);\n            }\n          : w,\n        T = (t) => {\n          let n;\n          if (t > 16777216) {\n            if (t - e > pt)\n              throw new Error(\n                \"Packed buffer would be larger than maximum buffer size\"\n              );\n            n = Math.min(\n              pt,\n              4096 *\n                Math.round(\n                  Math.max((t - e) * (t > 67108864 ? 1.25 : 2), 4194304) / 4096\n                )\n            );\n          } else n = (1 + (Math.max((t - e) << 2, ft.length - 1) >> 12)) << 12;\n          let r = new lt(n);\n          return (\n            (mt = r.dataView || (r.dataView = new DataView(r.buffer, 0, n))),\n            (t = Math.min(t, ft.length)),\n            ft.copy ? ft.copy(r, 0, e, t) : r.set(ft.slice(e, t)),\n            (vt -= e),\n            (e = 0),\n            (gt = r.length - 10),\n            (ft = r)\n          );\n        },\n        E = (t, e, i) => {\n          let a = r.nextId;\n          (a || (a = 64),\n            a < p && this.shouldShareStructure && !this.shouldShareStructure(e)\n              ? ((a = r.nextOwnId), a < f || (a = p), (r.nextOwnId = a + 1))\n              : (a >= f && (a = p), (r.nextId = a + 1)));\n          let o = (e.highByte = a >= 96 && h ? (a - 96) >> 5 : -1);\n          ((t[xt] = a),\n            (t.__keys__ = e),\n            (r[a - 64] = e),\n            a < p\n              ? ((e.isShared = !0),\n                (r.sharedLength = a - 63),\n                (n = !0),\n                o >= 0\n                  ? ((ft[vt++] = 96 + (31 & a)), (ft[vt++] = o))\n                  : (ft[vt++] = a))\n              : (o >= 0\n                  ? ((ft[vt++] = 213),\n                    (ft[vt++] = 114),\n                    (ft[vt++] = 96 + (31 & a)),\n                    (ft[vt++] = o))\n                  : ((ft[vt++] = 212), (ft[vt++] = 114), (ft[vt++] = a)),\n                i && (m += g * i),\n                d.length >= l && (d.shift()[xt] = 0),\n                d.push(t),\n                b(e)));\n        },\n        k = (t, n, r, i) => {\n          let a = ft,\n            o = vt,\n            s = gt,\n            u = e;\n          ((ft = dt),\n            (vt = 0),\n            (e = 0),\n            ft || (dt = ft = new lt(8192)),\n            (gt = ft.length - 10),\n            E(t, n, i),\n            (dt = ft));\n          let c = vt;\n          if (((ft = a), (vt = o), (gt = s), (e = u), c > 1)) {\n            let t = vt + c - 1;\n            t > gt && T(t);\n            let n = r + e;\n            (ft.copyWithin(n + c, n + 1, vt),\n              ft.set(dt.slice(0, c), n),\n              (vt = t));\n          } else ft[r + e] = dt[0];\n        },\n        I = (t) => {\n          let i = undefined(\n            t,\n            ft,\n            e,\n            vt,\n            r,\n            T,\n            (t, e, r) => {\n              if (r) return (n = !0);\n              vt = e;\n              let i = ft;\n              return (\n                b(t),\n                v(),\n                i !== ft ? { position: vt, targetView: mt, target: ft } : vt\n              );\n            },\n            this\n          );\n          if (0 === i) return S(t);\n          vt = i;\n        };\n    }\n    useBuffer(t) {\n      ((ft = t),\n        (mt = new DataView(ft.buffer, ft.byteOffset, ft.byteLength)),\n        (vt = 0));\n    }\n    clearSharedData() {\n      (this.structures && (this.structures = []),\n        this.typedStructs && (this.typedStructs = []));\n    }\n  }\n  function _t(t, e, n, r) {\n    let i = t.byteLength;\n    if (i + 1 < 256) {\n      var { target: a, position: o } = n(4 + i);\n      ((a[o++] = 199), (a[o++] = i + 1));\n    } else if (i + 1 < 65536) {\n      var { target: a, position: o } = n(5 + i);\n      ((a[o++] = 200), (a[o++] = (i + 1) >> 8), (a[o++] = (i + 1) & 255));\n    } else {\n      var { target: a, position: o, targetView: s } = n(7 + i);\n      ((a[o++] = 201), s.setUint32(o, i + 1), (o += 4));\n    }\n    ((a[o++] = 116),\n      (a[o++] = e),\n      t.buffer || (t = new Uint8Array(t)),\n      a.set(new Uint8Array(t.buffer, t.byteOffset, t.byteLength), o));\n  }\n  function St(t, e) {\n    let n = t.byteLength;\n    var r, i;\n    if (n < 256) {\n      var { target: r, position: i } = e(n + 2);\n      ((r[i++] = 196), (r[i++] = n));\n    } else if (n < 65536) {\n      var { target: r, position: i } = e(n + 3);\n      ((r[i++] = 197), (r[i++] = n >> 8), (r[i++] = 255 & n));\n    } else {\n      var { target: r, position: i, targetView: a } = e(n + 5);\n      ((r[i++] = 198), a.setUint32(i, n), (i += 4));\n    }\n    r.set(t, i);\n  }\n  function Tt(t, e, n, r) {\n    let i = t.length;\n    switch (i) {\n      case 1:\n        e[n++] = 212;\n        break;\n      case 2:\n        e[n++] = 213;\n        break;\n      case 4:\n        e[n++] = 214;\n        break;\n      case 8:\n        e[n++] = 215;\n        break;\n      case 16:\n        e[n++] = 216;\n        break;\n      default:\n        i < 256\n          ? ((e[n++] = 199), (e[n++] = i))\n          : i < 65536\n            ? ((e[n++] = 200), (e[n++] = i >> 8), (e[n++] = 255 & i))\n            : ((e[n++] = 201),\n              (e[n++] = i >> 24),\n              (e[n++] = (i >> 16) & 255),\n              (e[n++] = (i >> 8) & 255),\n              (e[n++] = 255 & i))