@automerge/automerge-repo-react-hooks 2.0.0-alpha.2 → 2.0.0-alpha.4

package/dist/index.js

@@ -1,29 +1,29 @@
-import lr, { createContext as ur, useContext as hr, useRef as Pt, useState as Vt, useEffect as Ce, useCallback as dr, useMemo as yr } from "react";
-const pr = ur(null);
-function dt() {
-  const e = hr(pr);
+import hr, { createContext as dr, useContext as yr, useRef as Nt, useState as $t, useEffect as _e, useCallback as pr, useMemo as br } from "react";
+const gr = dr(null);
+function bt() {
+  const e = yr(gr);
   if (!e) throw new Error("Repo was not found on RepoContext.");
   return e;
 }
-function Fn(e) {
-  const t = dt(), r = e ? t.find(e) : null, n = Pt(r);
+function jn(e) {
+  const t = bt(), r = e ? t.find(e) : null, n = Nt(r);
   r !== n.current && (n.current = r);
-  const [, s] = Vt(0), o = () => s((c) => c + 1);
-  Ce(() => !e || !r ? void 0 : (n.current = r, r.doc().then(() => {
+  const [, s] = $t(0), o = () => s((c) => c + 1);
+  _e(() => !e || !r ? void 0 : (n.current = r, r.doc().then(() => {
     o();
-  }).catch((a) => console.error(a)), r.on("change", o), r.on("delete", o), () => {
+  }).catch((f) => console.error(f)), r.on("change", o), r.on("delete", o), () => {
     r.removeListener("change", o), r.removeListener("delete", o);
   }), [e, r]);
-  const i = dr(
-    (c, a) => {
-      r && r.change(c, a);
+  const i = pr(
+    (c, f) => {
+      r && r.change(c, f);
     },
     [r]
   );
   return [r?.docSync(), i];
 }
-const ye = Symbol.for("_am_meta"), Ee = Symbol.for("_am_trace"), _e = Symbol.for("_am_objectId"), yt = Symbol.for("_am_isProxy"), Nt = Symbol.for("_am_clearCache"), br = Symbol.for("_am_uint"), gr = Symbol.for("_am_int"), xr = Symbol.for("_am_f64"), Ht = Symbol.for("_am_counter"), wr = Symbol.for("_am_text");
-class pe {
+const pe = Symbol.for("_am_meta"), Oe = Symbol.for("_am_trace"), Ie = Symbol.for("_am_objectId"), gt = Symbol.for("_am_isProxy"), zt = Symbol.for("_am_clearCache"), xr = Symbol.for("_am_uint"), wr = Symbol.for("_am_int"), mr = Symbol.for("_am_f64"), Ht = Symbol.for("_am_counter"), Sr = Symbol.for("_am_text");
+class be {
   constructor(t) {
     if (typeof t == "string")
       this.elems = [...t];
@@ -33,7 +33,7 @@ class pe {
       this.elems = [];
     else
       throw new TypeError(`Unsupported initial value for Text: ${t}`);
-    Reflect.defineProperty(this, wr, { value: !0 });
+    Reflect.defineProperty(this, Sr, { value: !0 });
   }
   get length() {
     return this.elems.length;
@@ -95,7 +95,7 @@ class pe {
    * Updates the list item at position `index` to a new value `value`.
    */
   set(t, r) {
-    if (this[ye])
+    if (this[pe])
       throw new RangeError("object cannot be modified outside of a change block");
     this.elems[t] = r;
   }
@@ -103,7 +103,7 @@ class pe {
    * Inserts new list items `values` starting at position `index`.
    */
   insertAt(t, ...r) {
-    if (this[ye])
+    if (this[pe])
       throw new RangeError("object cannot be modified outside of a change block");
     r.every((n) => typeof n == "string") ? this.elems.splice(t, 0, ...r.join("")) : this.elems.splice(t, 0, ...r);
   }
@@ -112,7 +112,7 @@ class pe {
    * if `numDelete` is not given, one item is deleted.
    */
   deleteAt(t, r = 1) {
-    if (this[ye])
+    if (this[pe])
       throw new RangeError("object cannot be modified outside of a change block");
     this.elems.splice(t, r);
   }
@@ -123,13 +123,13 @@ class pe {
     this.elems.lastIndexOf(t, r);
   }
   concat(t) {
-    return new pe(this.elems.concat(t.elems));
+    return new be(this.elems.concat(t.elems));
   }
   every(t) {
     return this.elems.every(t);
   }
   filter(t) {
-    return new pe(this.elems.filter(t));
+    return new be(this.elems.filter(t));
   }
   find(t) {
     return this.elems.find(t);
@@ -156,7 +156,7 @@ class pe {
     this.elems.reduceRight(t);
   }
   slice(t, r) {
-    return new pe(this.elems.slice(t, r));
+    return new be(this.elems.slice(t, r));
   }
   some(t) {
     return this.elems.some(t);
@@ -165,7 +165,7 @@ class pe {
     this.toString();
   }
 }
-class mr {
+class vr {
   constructor(t) {
     this.value = t || 0, Reflect.defineProperty(this, Ht, { value: !0 });
   }
@@ -214,7 +214,7 @@ class mr {
     throw new Error("Counters should not be decremented outside of a change callback");
   }
 }
-class vr extends mr {
+class Ar extends vr {
   constructor(t, r, n, s, o) {
     super(t), this.context = r, this.path = n, this.objectId = s, this.key = o;
   }
@@ -233,10 +233,10 @@ class vr extends mr {
     return this.increment(typeof t == "number" ? -t : -1);
   }
 }
-function Sr(e, t, r, n, s) {
-  return new vr(e, t, r, n, s);
+function Cr(e, t, r, n, s) {
+  return new Ar(e, t, r, n, s);
 }
-class Ar {
+class Er {
   constructor(t) {
     this.val = t;
   }
@@ -261,60 +261,60 @@ function re(e, t) {
   const { context: r, objectId: n, path: s, textV2: o } = e, i = r.getWithType(n, t);
   if (i === null)
     return;
-  const c = i[0], a = i[1];
+  const c = i[0], f = i[1];
   switch (c) {
     case void 0:
       return;
     case "map":
-      return He(r, a, o, [...s, t]);
+      return He(r, f, o, [...s, t]);
     case "list":
-      return $e(r, a, o, [...s, t]);
+      return Ke(r, f, o, [...s, t]);
     case "text":
-      return o ? r.text(a) : Oe(r, a, [
+      return o ? r.text(f) : Ue(r, f, [
         ...s,
         t
       ]);
     case "str":
-      return a;
+      return f;
     case "uint":
-      return a;
+      return f;
     case "int":
-      return a;
+      return f;
     case "f64":
-      return a;
+      return f;
     case "boolean":
-      return a;
+      return f;
     case "null":
       return null;
     case "bytes":
-      return a;
+      return f;
     case "timestamp":
-      return a;
+      return f;
     case "counter":
-      return Sr(a, r, s, n, t);
+      return Cr(f, r, s, n, t);
     default:
       throw RangeError(`datatype ${c} unimplemented`);
   }
 }
-function Te(e, t, r, n) {
+function Pe(e, t, r, n) {
   const s = typeof e;
   switch (s) {
     case "object":
       if (e == null)
         return [null, "null"];
-      if (e[br])
+      if (e[xr])
         return [e.value, "uint"];
-      if (e[gr])
+      if (e[wr])
         return [e.value, "int"];
-      if (e[xr])
+      if (e[mr])
         return [e.value, "f64"];
       if (e[Ht])
         return [e.value, "counter"];
       if (e instanceof Date)
         return [e.getTime(), "timestamp"];
-      if (e instanceof Ar)
+      if (e instanceof Er)
         return [e.toString(), "str"];
-      if (e instanceof pe)
+      if (e instanceof be)
         return [e, "text"];
       if (e instanceof Uint8Array)
         return [e, "bytes"];
@@ -322,7 +322,7 @@ function Te(e, t, r, n) {
         return [e, "list"];
       if (Object.prototype.toString.call(e) === "[object Object]")
         return [e, "map"];
-      throw Ne(e, n) ? new RangeError("Cannot create a reference to an existing document object") : new RangeError(`Cannot assign unknown object: ${e}`);
+      throw ze(e, n) ? new RangeError("Cannot create a reference to an existing document object") : new RangeError(`Cannot assign unknown object: ${e}`);
     case "boolean":
       return [e, "boolean"];
     case "number":
@@ -331,51 +331,51 @@ function Te(e, t, r, n) {
       return t ? [e, "text"] : [e, "str"];
     case "undefined":
       throw new RangeError([
-        `Cannot assign undefined value at ${Ct(r)}, `,
+        `Cannot assign undefined value at ${Ot(r)}, `,
         "because `undefined` is not a valid JSON data type. ",
         "You might consider setting the property's value to `null`, ",
         "or using `delete` to remove it altogether."
       ].join(""));
     default:
       throw new RangeError([
-        `Cannot assign ${s} value at ${Ct(r)}. `,
+        `Cannot assign ${s} value at ${Ot(r)}. `,
         "All JSON primitive datatypes (object, array, string, number, boolean, null) ",
         `are supported in an Automerge document; ${s} values are not. `
       ].join(""));
   }
 }
-function Ne(e, t) {
+function ze(e, t) {
   var r, n;
-  return e instanceof Date ? !1 : !!(e && ((n = (r = e[ye]) === null || r === void 0 ? void 0 : r.handle) === null || n === void 0 ? void 0 : n.__wbg_ptr) === t.__wbg_ptr);
+  return e instanceof Date ? !1 : !!(e && ((n = (r = e[pe]) === null || r === void 0 ? void 0 : r.handle) === null || n === void 0 ? void 0 : n.__wbg_ptr) === t.__wbg_ptr);
 }
-const Cr = {
+const _r = {
   get(e, t) {
     const { context: r, objectId: n, cache: s } = e;
-    return t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === _e ? n : t === yt ? !0 : t === Ee ? e.trace : t === ye ? { handle: r, textV2: e.textV2 } : (s[t] || (s[t] = re(e, t)), s[t]);
+    return t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === Ie ? n : t === gt ? !0 : t === Oe ? e.trace : t === pe ? { handle: r, textV2: e.textV2 } : (s[t] || (s[t] = re(e, t)), s[t]);
   },
   set(e, t, r) {
     const { context: n, objectId: s, path: o, textV2: i } = e;
-    if (e.cache = {}, Ne(r, n))
+    if (e.cache = {}, ze(r, n))
       throw new RangeError("Cannot create a reference to an existing document object");
-    if (t === Ee)
+    if (t === Oe)
       return e.trace = r, !0;
-    if (t === Nt)
+    if (t === zt)
       return !0;
-    const [c, a] = Te(r, i, [...o, t], n);
-    switch (a) {
+    const [c, f] = Pe(r, i, [...o, t], n);
+    switch (f) {
       case "list": {
-        const p = n.putObject(s, t, []), d = $e(n, p, i, [...o, t]);
+        const p = n.putObject(s, t, []), d = Ke(n, p, i, [...o, t]);
         for (let h = 0; h < c.length; h++)
           d[h] = c[h];
         break;
       }
       case "text": {
         if (i)
-          De(c), n.putObject(s, t, c);
+          Le(c), n.putObject(s, t, c);
         else {
-          bt(c);
+          wt(c);
           const p = n.putObject(s, t, "");
-          Oe(n, p, [...o, t]).splice(0, 0, ...c);
+          Ue(n, p, [...o, t]).splice(0, 0, ...c);
         }
         break;
       }
@@ -386,7 +386,7 @@ const Cr = {
         break;
       }
       default:
-        n.put(s, t, c, a);
+        n.put(s, t, c, f);
     }
     return !0;
   },
@@ -410,34 +410,34 @@ const Cr = {
     const { context: t, objectId: r } = e, n = t.keys(r);
     return [...new Set(n)];
   }
-}, $t = {
+}, Kt = {
   get(e, t) {
     const { context: r, objectId: n } = e;
-    return t = ae(t), t === Symbol.hasInstance ? (s) => Array.isArray(s) : t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === _e ? n : t === yt ? !0 : t === Ee ? e.trace : t === ye ? { handle: r } : t === "length" ? r.length(n) : typeof t == "number" ? re(e, t) : pt(e)[t];
+    return t = ae(t), t === Symbol.hasInstance ? (s) => Array.isArray(s) : t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === Ie ? n : t === gt ? !0 : t === Oe ? e.trace : t === pe ? { handle: r } : t === "length" ? r.length(n) : typeof t == "number" ? re(e, t) : xt(e)[t];
   },
   set(e, t, r) {
     const { context: n, objectId: s, path: o, textV2: i } = e;
-    if (t = ae(t), Ne(r, n))
+    if (t = ae(t), ze(r, n))
       throw new RangeError("Cannot create a reference to an existing document object");
-    if (t === Nt)
+    if (t === zt)
       return !0;
-    if (t === Ee)
+    if (t === Oe)
       return e.trace = r, !0;
     if (typeof t == "string")
       throw new RangeError("list index must be a number");
-    const [c, a] = Te(r, i, [...o, t], n);
-    switch (a) {
+    const [c, f] = Pe(r, i, [...o, t], n);
+    switch (f) {
       case "list": {
         let p;
-        t >= n.length(s) ? p = n.insertObject(s, t, []) : p = n.putObject(s, t, []), $e(n, p, i, [...o, t]).splice(0, 0, ...c);
+        t >= n.length(s) ? p = n.insertObject(s, t, []) : p = n.putObject(s, t, []), Ke(n, p, i, [...o, t]).splice(0, 0, ...c);
         break;
       }
       case "text": {
         if (i)
-          De(c), t >= n.length(s) ? n.insertObject(s, t, c) : n.putObject(s, t, c);
+          Le(c), t >= n.length(s) ? n.insertObject(s, t, c) : n.putObject(s, t, c);
         else {
           let p;
-          bt(c), t >= n.length(s) ? p = n.insertObject(s, t, "") : p = n.putObject(s, t, ""), Oe(n, p, [...o, t]).splice(0, 0, ...c);
+          wt(c), t >= n.length(s) ? p = n.insertObject(s, t, "") : p = n.putObject(s, t, ""), Ue(n, p, [...o, t]).splice(0, 0, ...c);
         }
         break;
       }
@@ -450,7 +450,7 @@ const Cr = {
         break;
       }
       default:
-        t >= n.length(s) ? n.insert(s, t, c, a) : n.put(s, t, c, a);
+        t >= n.length(s) ? n.insert(s, t, c, f) : n.put(s, t, c, f);
     }
     return !0;
   },
@@ -468,7 +468,7 @@ const Cr = {
   },
   getOwnPropertyDescriptor(e, t) {
     const { context: r, objectId: n } = e;
-    return t === "length" ? { writable: !0, value: r.length(n) } : t === _e ? { configurable: !1, enumerable: !1, value: n } : (t = ae(t), { configurable: !0, enumerable: !0, value: re(e, t) });
+    return t === "length" ? { writable: !0, value: r.length(n) } : t === Ie ? { configurable: !1, enumerable: !1, value: n } : (t = ae(t), { configurable: !0, enumerable: !0, value: re(e, t) });
   },
   getPrototypeOf(e) {
     return Object.getPrototypeOf(e);
@@ -477,13 +477,13 @@ const Cr = {
     const e = [];
     return e.push("length"), e;
   }
-}, Er = Object.assign({}, $t, {
+}, Or = Object.assign({}, Kt, {
   get(e, t) {
     const { context: r, objectId: n } = e;
-    return t = ae(t), t === Symbol.hasInstance ? (s) => Array.isArray(s) : t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === _e ? n : t === yt ? !0 : t === Ee ? e.trace : t === ye ? { handle: r } : t === "length" ? r.length(n) : typeof t == "number" ? re(e, t) : _r(e)[t] || pt(e)[t];
+    return t = ae(t), t === Symbol.hasInstance ? (s) => Array.isArray(s) : t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === Ie ? n : t === gt ? !0 : t === Oe ? e.trace : t === pe ? { handle: r } : t === "length" ? r.length(n) : typeof t == "number" ? re(e, t) : Ir(e)[t] || xt(e)[t];
   },
   getPrototypeOf() {
-    return Object.getPrototypeOf(new pe());
+    return Object.getPrototypeOf(new be());
   }
 });
 function He(e, t, r, n) {
@@ -494,9 +494,9 @@ function He(e, t, r, n) {
     cache: {},
     textV2: r
   }, o = {};
-  return Object.assign(o, s), new Proxy(o, Cr);
+  return Object.assign(o, s), new Proxy(o, _r);
 }
-function $e(e, t, r, n) {
+function Ke(e, t, r, n) {
   const s = {
     context: e,
     objectId: t,
@@ -504,9 +504,9 @@ function $e(e, t, r, n) {
     cache: {},
     textV2: r
   }, o = [];
-  return Object.assign(o, s), new Proxy(o, $t);
+  return Object.assign(o, s), new Proxy(o, Kt);
 }
-function Oe(e, t, r) {
+function Ue(e, t, r) {
   const n = {
     context: e,
     objectId: t,
@@ -514,26 +514,26 @@ function Oe(e, t, r) {
     cache: {},
     textV2: !1
   }, s = {};
-  return Object.assign(s, n), new Proxy(s, Er);
+  return Object.assign(s, n), new Proxy(s, Or);
 }
-function pt(e) {
+function xt(e) {
   const { context: t, objectId: r, path: n, textV2: s } = e;
   return {
     deleteAt(i, c) {
       return typeof c == "number" ? t.splice(r, i, c) : t.delete(r, i), this;
     },
-    fill(i, c, a) {
-      const [p, d] = Te(i, s, [...n, c], t), h = t.length(r);
-      c = ae(c || 0), a = ae(a || h);
-      for (let g = c; g < Math.min(a, h); g++)
+    fill(i, c, f) {
+      const [p, d] = Pe(i, s, [...n, c], t), h = t.length(r);
+      c = ae(c || 0), f = ae(f || h);
+      for (let g = c; g < Math.min(f, h); g++)
         if (d === "list" || d === "map")
           t.putObject(r, g, p);
         else if (d === "text")
           if (s)
-            De(p), t.putObject(r, g, p);
+            Le(p), t.putObject(r, g, p);
           else {
-            bt(p);
-            const u = t.putObject(r, g, ""), b = Oe(t, u, [...n, g]);
+            wt(p);
+            const u = t.putObject(r, g, ""), b = Ue(t, u, [...n, g]);
             for (let x = 0; x < p.length; x++)
               b[x] = p.get(x);
           }
@@ -542,10 +542,10 @@ function pt(e) {
       return this;
     },
     indexOf(i, c = 0) {
-      const a = t.length(r);
-      for (let p = c; p < a; p++) {
+      const f = t.length(r);
+      for (let p = c; p < f; p++) {
         const d = t.getWithType(r, p);
-        if (d && (d[1] === i[_e] || d[1] === i))
+        if (d && (d[1] === i[Ie] || d[1] === i))
           return p;
       }
       return -1;
@@ -570,19 +570,19 @@ function pt(e) {
       const i = re(e, 0);
       return t.delete(r, 0), i;
     },
-    splice(i, c, ...a) {
+    splice(i, c, ...f) {
       i = ae(i), typeof c != "number" && (c = t.length(r) - i), c = ae(c);
-      for (const h of a)
-        if (Ne(h, t))
+      for (const h of f)
+        if (ze(h, t))
           throw new RangeError("Cannot create a reference to an existing document object");
       const p = [];
       for (let h = 0; h < c; h++) {
         const g = re(e, i);
         g !== void 0 && p.push(g), t.delete(r, i);
       }
-      const d = a.map((h, g) => {
+      const d = f.map((h, g) => {
         try {
-          return Te(h, s, [...n], t);
+          return Pe(h, s, [...n], t);
         } catch (u) {
           throw u instanceof RangeError ? new RangeError(`${u.message} (at index ${g} in the input)`) : u;
         }
@@ -591,15 +591,15 @@ function pt(e) {
         switch (g) {
           case "list": {
             const u = t.insertObject(r, i, []);
-            $e(t, u, s, [...n, i]).splice(0, 0, ...h);
+            Ke(t, u, s, [...n, i]).splice(0, 0, ...h);
             break;
           }
           case "text": {
             if (s)
-              De(h), t.insertObject(r, i, h);
+              Le(h), t.insertObject(r, i, h);
             else {
               const u = t.insertObject(r, i, "");
-              Oe(t, u, [...n, i]).splice(0, 0, ...h);
+              Ue(t, u, [...n, i]).splice(0, 0, ...h);
             }
             break;
           }
@@ -623,8 +623,8 @@ function pt(e) {
       let i = 0;
       return {
         next: () => {
-          const a = re(e, i);
-          return a === void 0 ? { value: void 0, done: !0 } : { value: [i++, a], done: !1 };
+          const f = re(e, i);
+          return f === void 0 ? { value: void 0, done: !0 } : { value: [i++, f], done: !1 };
         },
         [Symbol.iterator]() {
           return this;
@@ -645,8 +645,8 @@ function pt(e) {
       let i = 0;
       return {
         next: () => {
-          const a = re(e, i++);
-          return a === void 0 ? { value: void 0, done: !0 } : { value: a, done: !1 };
+          const f = re(e, i++);
+          return f === void 0 ? { value: void 0, done: !0 } : { value: f, done: !1 };
         },
         [Symbol.iterator]() {
           return this;
@@ -685,16 +685,16 @@ function pt(e) {
     },
     find(i) {
       let c = 0;
-      for (const a of this) {
-        if (i(a, c))
-          return a;
+      for (const f of this) {
+        if (i(f, c))
+          return f;
         c += 1;
       }
     },
     findIndex(i) {
       let c = 0;
-      for (const a of this) {
-        if (i(a, c))
+      for (const f of this) {
+        if (i(f, c))
           return c;
         c += 1;
       }
@@ -720,8 +720,8 @@ function pt(e) {
     },
     some(i) {
       let c = 0;
-      for (const a of this) {
-        if (i(a, c))
+      for (const f of this) {
+        if (i(f, c))
           return !0;
         c += 1;
       }
@@ -734,7 +734,7 @@ function pt(e) {
     }
   };
 }
-function _r(e) {
+function Ir(e) {
   const { context: t, objectId: r } = e;
   return {
     set(s, o) {
@@ -751,8 +751,8 @@ function _r(e) {
       let o = "";
       const i = t.length(r);
       for (let c = 0; c < i; c++) {
-        const a = this[c];
-        typeof a == "string" ? o += a : (o.length > 0 && (s.push(o), o = ""), s.push(a));
+        const f = this[c];
+        typeof f == "string" ? o += f : (o.length > 0 && (s.push(o), o = ""), s.push(f));
       }
       return o.length > 0 && s.push(o), s;
     },
@@ -763,19 +763,19 @@ function _r(e) {
       return t.text(r).indexOf(s, o);
     },
     insertAt(s, ...o) {
-      o.every((i) => typeof i == "string") ? t.splice(r, s, 0, o.join("")) : pt(e).insertAt(s, ...o);
+      o.every((i) => typeof i == "string") ? t.splice(r, s, 0, o.join("")) : xt(e).insertAt(s, ...o);
     }
   };
 }
-function bt(e) {
-  if (!(e instanceof pe))
+function wt(e) {
+  if (!(e instanceof be))
     throw new Error("value was not a Text instance");
 }
-function De(e) {
+function Le(e) {
   if (typeof e != "string")
     throw new Error("value was not a string");
 }
-function Ct(e) {
+function Ot(e) {
   const t = e.map((r) => {
     if (typeof r == "number")
       return r.toString();
@@ -784,52 +784,52 @@ function Ct(e) {
   });
   return e.length === 0 ? "" : "/" + t.join("/");
 }
-const Or = /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i;
-function zt(e) {
-  return typeof e == "string" && Or.test(e);
+const Ur = /^(?:[0-9a-f]{8}-[0-9a-f]{4}-[1-5][0-9a-f]{3}-[89ab][0-9a-f]{3}-[0-9a-f]{12}|00000000-0000-0000-0000-000000000000)$/i;
+function Wt(e) {
+  return typeof e == "string" && Ur.test(e);
 }
 const Z = [];
 for (let e = 0; e < 256; ++e)
   Z.push((e + 256).toString(16).slice(1));
-function Ir(e, t = 0) {
+function Fr(e, t = 0) {
   return Z[e[t + 0]] + Z[e[t + 1]] + Z[e[t + 2]] + Z[e[t + 3]] + "-" + Z[e[t + 4]] + Z[e[t + 5]] + "-" + Z[e[t + 6]] + Z[e[t + 7]] + "-" + Z[e[t + 8]] + Z[e[t + 9]] + "-" + Z[e[t + 10]] + Z[e[t + 11]] + Z[e[t + 12]] + Z[e[t + 13]] + Z[e[t + 14]] + Z[e[t + 15]];
 }
-function Ur(e, t = 0) {
-  const r = Ir(e, t);
-  if (!zt(r))
+function kr(e, t = 0) {
+  const r = Fr(e, t);
+  if (!Wt(r))
     throw TypeError("Stringified UUID is invalid");
   return r;
 }
-let Kt;
-const Wt = new Array(128).fill(void 0);
-Wt.push(void 0, null, !0, !1);
-Wt.length;
-const Je = typeof TextEncoder < "u" ? new TextEncoder("utf-8") : { encode: () => {
+let Jt;
+const Gt = new Array(128).fill(void 0);
+Gt.push(void 0, null, !0, !1);
+Gt.length;
+const Xe = typeof TextEncoder < "u" ? new TextEncoder("utf-8") : { encode: () => {
   throw Error("TextEncoder not available");
 } };
-Je.encodeInto;
-const Fr = typeof TextDecoder < "u" ? new TextDecoder("utf-8", { ignoreBOM: !0, fatal: !0 }) : { decode: () => {
+Xe.encodeInto;
+const jr = typeof TextDecoder < "u" ? new TextDecoder("utf-8", { ignoreBOM: !0, fatal: !0 }) : { decode: () => {
   throw Error("TextDecoder not available");
 } };
-typeof TextDecoder < "u" && Fr.decode();
-typeof FinalizationRegistry > "u" || new FinalizationRegistry((e) => Kt.__wbg_automerge_free(e >>> 0));
-typeof FinalizationRegistry > "u" || new FinalizationRegistry((e) => Kt.__wbg_syncstate_free(e >>> 0));
-var jr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
-function ze(e) {
+typeof TextDecoder < "u" && jr.decode();
+typeof FinalizationRegistry > "u" || new FinalizationRegistry((e) => Jt.__wbg_automerge_free(e >>> 0));
+typeof FinalizationRegistry > "u" || new FinalizationRegistry((e) => Jt.__wbg_syncstate_free(e >>> 0));
+var Mr = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : {};
+function We(e) {
   return e && e.__esModule && Object.prototype.hasOwnProperty.call(e, "default") ? e.default : e;
 }
-var nt = { exports: {} }, Ge, Et;
-function kr() {
-  if (Et) return Ge;
-  Et = 1;
+var it = { exports: {} }, qe, It;
+function Rr() {
+  if (It) return qe;
+  It = 1;
   var e = 1e3, t = e * 60, r = t * 60, n = r * 24, s = n * 7, o = n * 365.25;
-  Ge = function(d, h) {
+  qe = function(d, h) {
     h = h || {};
     var g = typeof d;
     if (g === "string" && d.length > 0)
       return i(d);
     if (g === "number" && isFinite(d))
-      return h.long ? a(d) : c(d);
+      return h.long ? f(d) : c(d);
     throw new Error(
       "val is not a non-empty string or a valid number. val=" + JSON.stringify(d)
     );
@@ -890,7 +890,7 @@ function kr() {
     var h = Math.abs(d);
     return h >= n ? Math.round(d / n) + "d" : h >= r ? Math.round(d / r) + "h" : h >= t ? Math.round(d / t) + "m" : h >= e ? Math.round(d / e) + "s" : d + "ms";
   }
-  function a(d) {
+  function f(d) {
     var h = Math.abs(d);
     return h >= n ? p(d, h, n, "day") : h >= r ? p(d, h, r, "hour") : h >= t ? p(d, h, t, "minute") : h >= e ? p(d, h, e, "second") : d + " ms";
   }
@@ -898,10 +898,10 @@ function kr() {
     var b = h >= g * 1.5;
     return Math.round(d / g) + " " + u + (b ? "s" : "");
   }
-  return Ge;
+  return qe;
 }
-function Mr(e) {
-  r.debug = r, r.default = r, r.coerce = a, r.disable = o, r.enable = s, r.enabled = i, r.humanize = kr(), r.destroy = p, Object.keys(e).forEach((d) => {
+function Br(e) {
+  r.debug = r, r.default = r, r.coerce = f, r.disable = o, r.enable = s, r.enabled = i, r.humanize = Rr(), r.destroy = p, Object.keys(e).forEach((d) => {
     r[d] = e[d];
   }), r.names = [], r.skips = [], r.formatters = {};
   function t(d) {
@@ -913,30 +913,30 @@ function Mr(e) {
   r.selectColor = t;
   function r(d) {
     let h, g = null, u, b;
-    function x(...A) {
+    function x(...C) {
       if (!x.enabled)
         return;
-      const I = x, U = Number(/* @__PURE__ */ new Date()), S = U - (h || U);
-      I.diff = S, I.prev = h, I.curr = U, h = U, A[0] = r.coerce(A[0]), typeof A[0] != "string" && A.unshift("%O");
+      const I = x, U = Number(/* @__PURE__ */ new Date()), v = U - (h || U);
+      I.diff = v, I.prev = h, I.curr = U, h = U, C[0] = r.coerce(C[0]), typeof C[0] != "string" && C.unshift("%O");
       let B = 0;
-      A[0] = A[0].replace(/%([a-zA-Z%])/g, (F, N) => {
+      C[0] = C[0].replace(/%([a-zA-Z%])/g, (F, N) => {
         if (F === "%%")
           return "%";
         B++;
-        const L = r.formatters[N];
-        if (typeof L == "function") {
-          const $ = A[B];
-          F = L.call(I, $), A.splice(B, 1), B--;
+        const P = r.formatters[N];
+        if (typeof P == "function") {
+          const z = C[B];
+          F = P.call(I, z), C.splice(B, 1), B--;
         }
         return F;
-      }), r.formatArgs.call(I, A), (I.log || r.log).apply(I, A);
+      }), r.formatArgs.call(I, C), (I.log || r.log).apply(I, C);
     }
     return x.namespace = d, x.useColors = r.useColors(), x.color = r.selectColor(d), x.extend = n, x.destroy = r.destroy, Object.defineProperty(x, "enabled", {
       enumerable: !0,
       configurable: !1,
       get: () => g !== null ? g : (u !== r.namespaces && (u = r.namespaces, b = r.enabled(d)), b),
-      set: (A) => {
-        g = A;
+      set: (C) => {
+        g = C;
       }
     }), typeof r.init == "function" && r.init(x), x;
   }
@@ -973,7 +973,7 @@ function Mr(e) {
   function c(d) {
     return d.toString().substring(2, d.toString().length - 2).replace(/\.\*\?$/, "*");
   }
-  function a(d) {
+  function f(d) {
     return d instanceof Error ? d.stack || d.message : d;
   }
   function p() {
@@ -981,12 +981,12 @@ function Mr(e) {
   }
   return r.enable(r.load()), r;
 }
-var Rr = Mr;
+var Tr = Br;
 (function(e, t) {
   t.formatArgs = n, t.save = s, t.load = o, t.useColors = r, t.storage = i(), t.destroy = /* @__PURE__ */ (() => {
-    let a = !1;
+    let f = !1;
     return () => {
-      a || (a = !0, console.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`."));
+      f || (f = !0, console.warn("Instance method `debug.destroy()` is deprecated and no longer does anything. It will be removed in the next major version of `debug`."));
     };
   })(), t.colors = [
     "#0000CC",
@@ -1067,37 +1067,42 @@ var Rr = Mr;
     "#FFCC33"
   ];
   function r() {
-    return typeof window < "u" && window.process && (window.process.type === "renderer" || window.process.__nwjs) ? !0 : typeof navigator < "u" && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/) ? !1 : typeof document < "u" && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance || // Is firebug? http://stackoverflow.com/a/398120/376773
+    if (typeof window < "u" && window.process && (window.process.type === "renderer" || window.process.__nwjs))
+      return !0;
+    if (typeof navigator < "u" && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))
+      return !1;
+    let f;
+    return typeof document < "u" && document.documentElement && document.documentElement.style && document.documentElement.style.WebkitAppearance || // Is firebug? http://stackoverflow.com/a/398120/376773
     typeof window < "u" && window.console && (window.console.firebug || window.console.exception && window.console.table) || // Is firefox >= v31?
     // https://developer.mozilla.org/en-US/docs/Tools/Web_Console#Styling_messages
-    typeof navigator < "u" && navigator.userAgent && navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/) && parseInt(RegExp.$1, 10) >= 31 || // Double check webkit in userAgent just in case we are in a worker
+    typeof navigator < "u" && navigator.userAgent && (f = navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)) && parseInt(f[1], 10) >= 31 || // Double check webkit in userAgent just in case we are in a worker
     typeof navigator < "u" && navigator.userAgent && navigator.userAgent.toLowerCase().match(/applewebkit\/(\d+)/);
   }
-  function n(a) {
-    if (a[0] = (this.useColors ? "%c" : "") + this.namespace + (this.useColors ? " %c" : " ") + a[0] + (this.useColors ? "%c " : " ") + "+" + e.exports.humanize(this.diff), !this.useColors)
+  function n(f) {
+    if (f[0] = (this.useColors ? "%c" : "") + this.namespace + (this.useColors ? " %c" : " ") + f[0] + (this.useColors ? "%c " : " ") + "+" + e.exports.humanize(this.diff), !this.useColors)
       return;
     const p = "color: " + this.color;
-    a.splice(1, 0, p, "color: inherit");
+    f.splice(1, 0, p, "color: inherit");
     let d = 0, h = 0;
-    a[0].replace(/%[a-zA-Z%]/g, (g) => {
+    f[0].replace(/%[a-zA-Z%]/g, (g) => {
       g !== "%%" && (d++, g === "%c" && (h = d));
-    }), a.splice(h, 0, p);
+    }), f.splice(h, 0, p);
   }
   t.log = console.debug || console.log || (() => {
   });
-  function s(a) {
+  function s(f) {
     try {
-      a ? t.storage.setItem("debug", a) : t.storage.removeItem("debug");
+      f ? t.storage.setItem("debug", f) : t.storage.removeItem("debug");
     } catch {
     }
   }
   function o() {
-    let a;
+    let f;
     try {
-      a = t.storage.getItem("debug");
+      f = t.storage.getItem("debug");
     } catch {
     }
-    return !a && typeof process < "u" && "env" in process && (a = process.env.DEBUG), a;
+    return !f && typeof process < "u" && "env" in process && (f = process.env.DEBUG), f;
   }
   function i() {
     try {
@@ -1105,35 +1110,35 @@ var Rr = Mr;
     } catch {
     }
   }
-  e.exports = Rr(t);
+  e.exports = Tr(t);
   const { formatters: c } = e.exports;
-  c.j = function(a) {
+  c.j = function(f) {
     try {
-      return JSON.stringify(a);
+      return JSON.stringify(f);
     } catch (p) {
       return "[UnexpectedJSONParseError]: " + p.message;
     }
   };
-})(nt, nt.exports);
-var Br = nt.exports;
-const Tr = /* @__PURE__ */ ze(Br);
-var Jt = { exports: {} };
+})(it, it.exports);
+var Dr = it.exports;
+const Pr = /* @__PURE__ */ We(Dr);
+var Xt = { exports: {} };
 (function(e) {
   var t = Object.prototype.hasOwnProperty, r = "~";
   function n() {
   }
   Object.create && (n.prototype = /* @__PURE__ */ Object.create(null), new n().__proto__ || (r = !1));
-  function s(a, p, d) {
-    this.fn = a, this.context = p, this.once = d || !1;
+  function s(f, p, d) {
+    this.fn = f, this.context = p, this.once = d || !1;
   }
-  function o(a, p, d, h, g) {
+  function o(f, p, d, h, g) {
     if (typeof d != "function")
       throw new TypeError("The listener must be a function");
-    var u = new s(d, h || a, g), b = r ? r + p : p;
-    return a._events[b] ? a._events[b].fn ? a._events[b] = [a._events[b], u] : a._events[b].push(u) : (a._events[b] = u, a._eventsCount++), a;
+    var u = new s(d, h || f, g), b = r ? r + p : p;
+    return f._events[b] ? f._events[b].fn ? f._events[b] = [f._events[b], u] : f._events[b].push(u) : (f._events[b] = u, f._eventsCount++), f;
   }
-  function i(a, p) {
-    --a._eventsCount === 0 ? a._events = new n() : delete a._events[p];
+  function i(f, p) {
+    --f._eventsCount === 0 ? f._events = new n() : delete f._events[p];
   }
   function c() {
     this._events = new n(), this._eventsCount = 0;
@@ -1157,45 +1162,45 @@ var Jt = { exports: {} };
   }, c.prototype.emit = function(p, d, h, g, u, b) {
     var x = r ? r + p : p;
     if (!this._events[x]) return !1;
-    var A = this._events[x], I = arguments.length, U, S;
-    if (A.fn) {
-      switch (A.once && this.removeListener(p, A.fn, void 0, !0), I) {
+    var C = this._events[x], I = arguments.length, U, v;
+    if (C.fn) {
+      switch (C.once && this.removeListener(p, C.fn, void 0, !0), I) {
         case 1:
-          return A.fn.call(A.context), !0;
+          return C.fn.call(C.context), !0;
         case 2:
-          return A.fn.call(A.context, d), !0;
+          return C.fn.call(C.context, d), !0;
         case 3:
-          return A.fn.call(A.context, d, h), !0;
+          return C.fn.call(C.context, d, h), !0;
         case 4:
-          return A.fn.call(A.context, d, h, g), !0;
+          return C.fn.call(C.context, d, h, g), !0;
         case 5:
-          return A.fn.call(A.context, d, h, g, u), !0;
+          return C.fn.call(C.context, d, h, g, u), !0;
         case 6:
-          return A.fn.call(A.context, d, h, g, u, b), !0;
+          return C.fn.call(C.context, d, h, g, u, b), !0;
       }
-      for (S = 1, U = new Array(I - 1); S < I; S++)
-        U[S - 1] = arguments[S];
-      A.fn.apply(A.context, U);
+      for (v = 1, U = new Array(I - 1); v < I; v++)
+        U[v - 1] = arguments[v];
+      C.fn.apply(C.context, U);
     } else {
-      var B = A.length, M;
-      for (S = 0; S < B; S++)
-        switch (A[S].once && this.removeListener(p, A[S].fn, void 0, !0), I) {
+      var B = C.length, M;
+      for (v = 0; v < B; v++)
+        switch (C[v].once && this.removeListener(p, C[v].fn, void 0, !0), I) {
           case 1:
-            A[S].fn.call(A[S].context);
+            C[v].fn.call(C[v].context);
             break;
           case 2:
-            A[S].fn.call(A[S].context, d);
+            C[v].fn.call(C[v].context, d);
             break;
           case 3:
-            A[S].fn.call(A[S].context, d, h);
+            C[v].fn.call(C[v].context, d, h);
             break;
           case 4:
-            A[S].fn.call(A[S].context, d, h, g);
+            C[v].fn.call(C[v].context, d, h, g);
             break;
           default:
             if (!U) for (M = 1, U = new Array(I - 1); M < I; M++)
               U[M - 1] = arguments[M];
-            A[S].fn.apply(A[S].context, U);
+            C[v].fn.apply(C[v].context, U);
         }
     }
     return !0;
@@ -1212,72 +1217,72 @@ var Jt = { exports: {} };
     if (b.fn)
       b.fn === d && (!g || b.once) && (!h || b.context === h) && i(this, u);
     else {
-      for (var x = 0, A = [], I = b.length; x < I; x++)
-        (b[x].fn !== d || g && !b[x].once || h && b[x].context !== h) && A.push(b[x]);
-      A.length ? this._events[u] = A.length === 1 ? A[0] : A : i(this, u);
+      for (var x = 0, C = [], I = b.length; x < I; x++)
+        (b[x].fn !== d || g && !b[x].once || h && b[x].context !== h) && C.push(b[x]);
+      C.length ? this._events[u] = C.length === 1 ? C[0] : C : i(this, u);
     }
     return this;
   }, c.prototype.removeAllListeners = function(p) {
     var d;
     return p ? (d = r ? r + p : p, this._events[d] && i(this, d)) : (this._events = new n(), this._eventsCount = 0), this;
   }, c.prototype.off = c.prototype.removeListener, c.prototype.addListener = c.prototype.on, c.prefixed = r, c.EventEmitter = c, e.exports = c;
-})(Jt);
-var Dr = Jt.exports;
-const Lr = /* @__PURE__ */ ze(Dr);
-var ve = {}, he = {}, q = {};
+})(Xt);
+var Lr = Xt.exports;
+const Vr = /* @__PURE__ */ We(Lr);
+var ve = {}, de = {}, q = {};
 Object.defineProperty(q, "__esModule", { value: !0 });
 q.output = q.exists = q.hash = q.bytes = q.bool = q.number = q.isBytes = void 0;
-function Le(e) {
+function Ve(e) {
   if (!Number.isSafeInteger(e) || e < 0)
     throw new Error(`positive integer expected, not ${e}`);
 }
-q.number = Le;
-function Gt(e) {
+q.number = Ve;
+function qt(e) {
   if (typeof e != "boolean")
     throw new Error(`boolean expected, not ${e}`);
 }
-q.bool = Gt;
-function Xt(e) {
+q.bool = qt;
+function Zt(e) {
   return e instanceof Uint8Array || e != null && typeof e == "object" && e.constructor.name === "Uint8Array";
 }
-q.isBytes = Xt;
-function gt(e, ...t) {
-  if (!Xt(e))
+q.isBytes = Zt;
+function mt(e, ...t) {
+  if (!Zt(e))
     throw new Error("Uint8Array expected");
   if (t.length > 0 && !t.includes(e.length))
     throw new Error(`Uint8Array expected of length ${t}, not of length=${e.length}`);
 }
-q.bytes = gt;
-function qt(e) {
+q.bytes = mt;
+function Yt(e) {
   if (typeof e != "function" || typeof e.create != "function")
     throw new Error("Hash should be wrapped by utils.wrapConstructor");
-  Le(e.outputLen), Le(e.blockLen);
+  Ve(e.outputLen), Ve(e.blockLen);
 }
-q.hash = qt;
-function Zt(e, t = !0) {
+q.hash = Yt;
+function Qt(e, t = !0) {
   if (e.destroyed)
     throw new Error("Hash instance has been destroyed");
   if (t && e.finished)
     throw new Error("Hash#digest() has already been called");
 }
-q.exists = Zt;
-function Yt(e, t) {
-  gt(e);
+q.exists = Qt;
+function er(e, t) {
+  mt(e);
   const r = t.outputLen;
   if (e.length < r)
     throw new Error(`digestInto() expects output buffer of length at least ${r}`);
 }
-q.output = Yt;
-const Pr = { number: Le, bool: Gt, bytes: gt, hash: qt, exists: Zt, output: Yt };
-q.default = Pr;
-var xt = {}, Ke = {};
-Object.defineProperty(Ke, "__esModule", { value: !0 });
-Ke.crypto = void 0;
-Ke.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
+q.output = er;
+const Nr = { number: Ve, bool: qt, bytes: mt, hash: Yt, exists: Qt, output: er };
+q.default = Nr;
+var St = {}, Je = {};
+Object.defineProperty(Je, "__esModule", { value: !0 });
+Je.crypto = void 0;
+Je.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis.crypto : void 0;
 (function(e) {
   /*! noble-hashes - MIT License (c) 2022 Paul Miller (paulmillr.com) */
   Object.defineProperty(e, "__esModule", { value: !0 }), e.randomBytes = e.wrapXOFConstructorWithOpts = e.wrapConstructorWithOpts = e.wrapConstructor = e.checkOpts = e.Hash = e.concatBytes = e.toBytes = e.utf8ToBytes = e.asyncLoop = e.nextTick = e.hexToBytes = e.bytesToHex = e.byteSwap32 = e.byteSwapIfBE = e.byteSwap = e.isLE = e.rotl = e.rotr = e.createView = e.u32 = e.u8 = e.isBytes = void 0;
-  const t = Ke, r = q;
+  const t = Je, r = q;
   function n(E) {
     return E instanceof Uint8Array || E != null && typeof E == "object" && E.constructor.name === "Uint8Array";
   }
@@ -1290,8 +1295,8 @@ Ke.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
   e.createView = i;
   const c = (E, l) => E << 32 - l | E >>> l;
   e.rotr = c;
-  const a = (E, l) => E << l | E >>> 32 - l >>> 0;
-  e.rotl = a, e.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+  const f = (E, l) => E << l | E >>> 32 - l >>> 0;
+  e.rotl = f, e.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
   const p = (E) => E << 24 & 4278190080 | E << 8 & 16711680 | E >>> 8 & 65280 | E >>> 24 & 255;
   e.byteSwap = p, e.byteSwapIfBE = e.isLE ? (E) => E : (E) => (0, e.byteSwap)(E);
   function d(E) {
@@ -1324,26 +1329,26 @@ Ke.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
     if (l % 2)
       throw new Error("padded hex string expected, got unpadded hex of length " + l);
     const m = new Uint8Array(_);
-    for (let C = 0, v = 0; C < _; C++, v += 2) {
-      const j = b(E.charCodeAt(v)), k = b(E.charCodeAt(v + 1));
-      if (j === void 0 || k === void 0) {
-        const R = E[v] + E[v + 1];
-        throw new Error('hex string expected, got non-hex character "' + R + '" at index ' + v);
+    for (let A = 0, S = 0; A < _; A++, S += 2) {
+      const k = b(E.charCodeAt(S)), j = b(E.charCodeAt(S + 1));
+      if (k === void 0 || j === void 0) {
+        const R = E[S] + E[S + 1];
+        throw new Error('hex string expected, got non-hex character "' + R + '" at index ' + S);
       }
-      m[C] = j * 16 + k;
+      m[A] = k * 16 + j;
     }
     return m;
   }
   e.hexToBytes = x;
-  const A = async () => {
+  const C = async () => {
   };
-  e.nextTick = A;
+  e.nextTick = C;
   async function I(E, l, _) {
     let m = Date.now();
-    for (let C = 0; C < E; C++) {
-      _(C);
-      const v = Date.now() - m;
-      v >= 0 && v < l || (await (0, e.nextTick)(), m += v);
+    for (let A = 0; A < E; A++) {
+      _(A);
+      const S = Date.now() - m;
+      S >= 0 && S < l || (await (0, e.nextTick)(), m += S);
     }
   }
   e.asyncLoop = I;
@@ -1353,20 +1358,20 @@ Ke.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
     return new Uint8Array(new TextEncoder().encode(E));
   }
   e.utf8ToBytes = U;
-  function S(E) {
+  function v(E) {
     return typeof E == "string" && (E = U(E)), (0, r.bytes)(E), E;
   }
-  e.toBytes = S;
+  e.toBytes = v;
   function B(...E) {
     let l = 0;
     for (let m = 0; m < E.length; m++) {
-      const C = E[m];
-      (0, r.bytes)(C), l += C.length;
+      const A = E[m];
+      (0, r.bytes)(A), l += A.length;
     }
     const _ = new Uint8Array(l);
-    for (let m = 0, C = 0; m < E.length; m++) {
-      const v = E[m];
-      _.set(v, C), C += v.length;
+    for (let m = 0, A = 0; m < E.length; m++) {
+      const S = E[m];
+      _.set(S, A), A += S.length;
     }
     return _;
   }
@@ -1385,56 +1390,56 @@ Ke.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
     return Object.assign(E, l);
   }
   e.checkOpts = N;
-  function L(E) {
-    const l = (m) => E().update(S(m)).digest(), _ = E();
+  function P(E) {
+    const l = (m) => E().update(v(m)).digest(), _ = E();
     return l.outputLen = _.outputLen, l.blockLen = _.blockLen, l.create = () => E(), l;
   }
-  e.wrapConstructor = L;
-  function $(E) {
-    const l = (m, C) => E(C).update(S(m)).digest(), _ = E({});
+  e.wrapConstructor = P;
+  function z(E) {
+    const l = (m, A) => E(A).update(v(m)).digest(), _ = E({});
     return l.outputLen = _.outputLen, l.blockLen = _.blockLen, l.create = (m) => E(m), l;
   }
-  e.wrapConstructorWithOpts = $;
-  function H(E) {
-    const l = (m, C) => E(C).update(S(m)).digest(), _ = E({});
+  e.wrapConstructorWithOpts = z;
+  function $(E) {
+    const l = (m, A) => E(A).update(v(m)).digest(), _ = E({});
     return l.outputLen = _.outputLen, l.blockLen = _.blockLen, l.create = (m) => E(m), l;
   }
-  e.wrapXOFConstructorWithOpts = H;
+  e.wrapXOFConstructorWithOpts = $;
   function ie(E = 32) {
     if (t.crypto && typeof t.crypto.getRandomValues == "function")
       return t.crypto.getRandomValues(new Uint8Array(E));
     throw new Error("crypto.getRandomValues must be defined");
   }
   e.randomBytes = ie;
-})(xt);
-Object.defineProperty(he, "__esModule", { value: !0 });
-he.HashMD = he.Maj = he.Chi = void 0;
-const Xe = q, Se = xt;
-function Vr(e, t, r, n) {
+})(St);
+Object.defineProperty(de, "__esModule", { value: !0 });
+de.HashMD = de.Maj = de.Chi = void 0;
+const Ze = q, Ae = St;
+function $r(e, t, r, n) {
   if (typeof e.setBigUint64 == "function")
     return e.setBigUint64(t, r, n);
-  const s = BigInt(32), o = BigInt(4294967295), i = Number(r >> s & o), c = Number(r & o), a = n ? 4 : 0, p = n ? 0 : 4;
-  e.setUint32(t + a, i, n), e.setUint32(t + p, c, n);
+  const s = BigInt(32), o = BigInt(4294967295), i = Number(r >> s & o), c = Number(r & o), f = n ? 4 : 0, p = n ? 0 : 4;
+  e.setUint32(t + f, i, n), e.setUint32(t + p, c, n);
 }
-const Nr = (e, t, r) => e & t ^ ~e & r;
-he.Chi = Nr;
+const zr = (e, t, r) => e & t ^ ~e & r;
+de.Chi = zr;
 const Hr = (e, t, r) => e & t ^ e & r ^ t & r;
-he.Maj = Hr;
-class $r extends Se.Hash {
+de.Maj = Hr;
+class Kr extends Ae.Hash {
   constructor(t, r, n, s) {
-    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = s, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = (0, Se.createView)(this.buffer);
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = s, this.finished = !1, this.length = 0, this.pos = 0, this.destroyed = !1, this.buffer = new Uint8Array(t), this.view = (0, Ae.createView)(this.buffer);
   }
   update(t) {
-    (0, Xe.exists)(this);
+    (0, Ze.exists)(this);
     const { view: r, buffer: n, blockLen: s } = this;
-    t = (0, Se.toBytes)(t);
+    t = (0, Ae.toBytes)(t);
     const o = t.length;
     for (let i = 0; i < o; ) {
       const c = Math.min(s - this.pos, o - i);
       if (c === s) {
-        const a = (0, Se.createView)(t);
+        const f = (0, Ae.createView)(t);
         for (; s <= o - i; i += s)
-          this.process(a, i);
+          this.process(f, i);
         continue;
       }
       n.set(t.subarray(i, i + c), this.pos), this.pos += c, i += c, this.pos === s && (this.process(r, 0), this.pos = 0);
@@ -1442,17 +1447,17 @@ class $r extends Se.Hash {
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
-    (0, Xe.exists)(this), (0, Xe.output)(t, this), this.finished = !0;
+    (0, Ze.exists)(this), (0, Ze.output)(t, this), this.finished = !0;
     const { buffer: r, view: n, blockLen: s, isLE: o } = this;
     let { pos: i } = this;
     r[i++] = 128, this.buffer.subarray(i).fill(0), this.padOffset > s - i && (this.process(n, 0), i = 0);
     for (let h = i; h < s; h++)
       r[h] = 0;
-    Vr(n, s - 8, BigInt(this.length * 8), o), this.process(n, 0);
-    const c = (0, Se.createView)(t), a = this.outputLen;
-    if (a % 4)
+    $r(n, s - 8, BigInt(this.length * 8), o), this.process(n, 0);
+    const c = (0, Ae.createView)(t), f = this.outputLen;
+    if (f % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const p = a / 4, d = this.get();
+    const p = f / 4, d = this.get();
     if (p > d.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let h = 0; h < p; h++)
@@ -1470,10 +1475,10 @@ class $r extends Se.Hash {
     return t.length = s, t.pos = c, t.finished = o, t.destroyed = i, s % r && t.buffer.set(n), t;
   }
 }
-he.HashMD = $r;
+de.HashMD = Kr;
 Object.defineProperty(ve, "__esModule", { value: !0 });
 ve.sha224 = ve.sha256 = void 0;
-const qe = he, te = xt, zr = /* @__PURE__ */ new Uint32Array([
+const Ye = de, te = St, Wr = /* @__PURE__ */ new Uint32Array([
   1116352408,
   1899447441,
   3049323471,
@@ -1538,7 +1543,7 @@ const qe = he, te = xt, zr = /* @__PURE__ */ new Uint32Array([
   2756734187,
   3204031479,
   3329325298
-]), ce = /* @__PURE__ */ new Uint32Array([
+]), le = /* @__PURE__ */ new Uint32Array([
   1779033703,
   3144134277,
   1013904242,
@@ -1547,48 +1552,48 @@ const qe = he, te = xt, zr = /* @__PURE__ */ new Uint32Array([
   2600822924,
   528734635,
   1541459225
-]), le = /* @__PURE__ */ new Uint32Array(64);
-class Qt extends qe.HashMD {
+]), ue = /* @__PURE__ */ new Uint32Array(64);
+class tr extends Ye.HashMD {
   constructor() {
-    super(64, 32, 8, !1), this.A = ce[0] | 0, this.B = ce[1] | 0, this.C = ce[2] | 0, this.D = ce[3] | 0, this.E = ce[4] | 0, this.F = ce[5] | 0, this.G = ce[6] | 0, this.H = ce[7] | 0;
+    super(64, 32, 8, !1), this.A = le[0] | 0, this.B = le[1] | 0, this.C = le[2] | 0, this.D = le[3] | 0, this.E = le[4] | 0, this.F = le[5] | 0, this.G = le[6] | 0, this.H = le[7] | 0;
   }
   get() {
-    const { A: t, B: r, C: n, D: s, E: o, F: i, G: c, H: a } = this;
-    return [t, r, n, s, o, i, c, a];
+    const { A: t, B: r, C: n, D: s, E: o, F: i, G: c, H: f } = this;
+    return [t, r, n, s, o, i, c, f];
   }
   // prettier-ignore
-  set(t, r, n, s, o, i, c, a) {
-    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = a | 0;
+  set(t, r, n, s, o, i, c, f) {
+    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = s | 0, this.E = o | 0, this.F = i | 0, this.G = c | 0, this.H = f | 0;
   }
   process(t, r) {
     for (let h = 0; h < 16; h++, r += 4)
-      le[h] = t.getUint32(r, !1);
+      ue[h] = t.getUint32(r, !1);
     for (let h = 16; h < 64; h++) {
-      const g = le[h - 15], u = le[h - 2], b = (0, te.rotr)(g, 7) ^ (0, te.rotr)(g, 18) ^ g >>> 3, x = (0, te.rotr)(u, 17) ^ (0, te.rotr)(u, 19) ^ u >>> 10;
-      le[h] = x + le[h - 7] + b + le[h - 16] | 0;
+      const g = ue[h - 15], u = ue[h - 2], b = (0, te.rotr)(g, 7) ^ (0, te.rotr)(g, 18) ^ g >>> 3, x = (0, te.rotr)(u, 17) ^ (0, te.rotr)(u, 19) ^ u >>> 10;
+      ue[h] = x + ue[h - 7] + b + ue[h - 16] | 0;
     }
-    let { A: n, B: s, C: o, D: i, E: c, F: a, G: p, H: d } = this;
+    let { A: n, B: s, C: o, D: i, E: c, F: f, G: p, H: d } = this;
     for (let h = 0; h < 64; h++) {
-      const g = (0, te.rotr)(c, 6) ^ (0, te.rotr)(c, 11) ^ (0, te.rotr)(c, 25), u = d + g + (0, qe.Chi)(c, a, p) + zr[h] + le[h] | 0, x = ((0, te.rotr)(n, 2) ^ (0, te.rotr)(n, 13) ^ (0, te.rotr)(n, 22)) + (0, qe.Maj)(n, s, o) | 0;
-      d = p, p = a, a = c, c = i + u | 0, i = o, o = s, s = n, n = u + x | 0;
+      const g = (0, te.rotr)(c, 6) ^ (0, te.rotr)(c, 11) ^ (0, te.rotr)(c, 25), u = d + g + (0, Ye.Chi)(c, f, p) + Wr[h] + ue[h] | 0, x = ((0, te.rotr)(n, 2) ^ (0, te.rotr)(n, 13) ^ (0, te.rotr)(n, 22)) + (0, Ye.Maj)(n, s, o) | 0;
+      d = p, p = f, f = c, c = i + u | 0, i = o, o = s, s = n, n = u + x | 0;
     }
-    n = n + this.A | 0, s = s + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, c = c + this.E | 0, a = a + this.F | 0, p = p + this.G | 0, d = d + this.H | 0, this.set(n, s, o, i, c, a, p, d);
+    n = n + this.A | 0, s = s + this.B | 0, o = o + this.C | 0, i = i + this.D | 0, c = c + this.E | 0, f = f + this.F | 0, p = p + this.G | 0, d = d + this.H | 0, this.set(n, s, o, i, c, f, p, d);
   }
   roundClean() {
-    le.fill(0);
+    ue.fill(0);
   }
   destroy() {
     this.set(0, 0, 0, 0, 0, 0, 0, 0), this.buffer.fill(0);
   }
 }
-class Kr extends Qt {
+class Jr extends tr {
   constructor() {
     super(), this.A = -1056596264, this.B = 914150663, this.C = 812702999, this.D = -150054599, this.E = -4191439, this.F = 1750603025, this.G = 1694076839, this.H = -1090891868, this.outputLen = 28;
   }
 }
-ve.sha256 = (0, te.wrapConstructor)(() => new Qt());
-ve.sha224 = (0, te.wrapConstructor)(() => new Kr());
-function Wr(e) {
+ve.sha256 = (0, te.wrapConstructor)(() => new tr());
+ve.sha224 = (0, te.wrapConstructor)(() => new Jr());
+function Gr(e) {
   if (e.length >= 255)
     throw new TypeError("Alphabet too long");
   for (var t = new Uint8Array(256), r = 0; r < t.length; r++)
@@ -1599,48 +1604,48 @@ function Wr(e) {
       throw new TypeError(s + " is ambiguous");
     t[o] = n;
   }
-  var i = e.length, c = e.charAt(0), a = Math.log(i) / Math.log(256), p = Math.log(256) / Math.log(i);
+  var i = e.length, c = e.charAt(0), f = Math.log(i) / Math.log(256), p = Math.log(256) / Math.log(i);
   function d(u) {
     if (u instanceof Uint8Array || (ArrayBuffer.isView(u) ? u = new Uint8Array(u.buffer, u.byteOffset, u.byteLength) : Array.isArray(u) && (u = Uint8Array.from(u))), !(u instanceof Uint8Array))
       throw new TypeError("Expected Uint8Array");
     if (u.length === 0)
       return "";
-    for (var b = 0, x = 0, A = 0, I = u.length; A !== I && u[A] === 0; )
-      A++, b++;
-    for (var U = (I - A) * p + 1 >>> 0, S = new Uint8Array(U); A !== I; ) {
-      for (var B = u[A], M = 0, F = U - 1; (B !== 0 || M < x) && F !== -1; F--, M++)
-        B += 256 * S[F] >>> 0, S[F] = B % i >>> 0, B = B / i >>> 0;
+    for (var b = 0, x = 0, C = 0, I = u.length; C !== I && u[C] === 0; )
+      C++, b++;
+    for (var U = (I - C) * p + 1 >>> 0, v = new Uint8Array(U); C !== I; ) {
+      for (var B = u[C], M = 0, F = U - 1; (B !== 0 || M < x) && F !== -1; F--, M++)
+        B += 256 * v[F] >>> 0, v[F] = B % i >>> 0, B = B / i >>> 0;
       if (B !== 0)
         throw new Error("Non-zero carry");
-      x = M, A++;
+      x = M, C++;
     }
-    for (var N = U - x; N !== U && S[N] === 0; )
+    for (var N = U - x; N !== U && v[N] === 0; )
       N++;
-    for (var L = c.repeat(b); N < U; ++N)
-      L += e.charAt(S[N]);
-    return L;
+    for (var P = c.repeat(b); N < U; ++N)
+      P += e.charAt(v[N]);
+    return P;
   }
   function h(u) {
     if (typeof u != "string")
       throw new TypeError("Expected String");
     if (u.length === 0)
       return new Uint8Array();
-    for (var b = 0, x = 0, A = 0; u[b] === c; )
+    for (var b = 0, x = 0, C = 0; u[b] === c; )
       x++, b++;
-    for (var I = (u.length - b) * a + 1 >>> 0, U = new Uint8Array(I); u[b]; ) {
-      var S = t[u.charCodeAt(b)];
-      if (S === 255)
+    for (var I = (u.length - b) * f + 1 >>> 0, U = new Uint8Array(I); u[b]; ) {
+      var v = t[u.charCodeAt(b)];
+      if (v === 255)
         return;
-      for (var B = 0, M = I - 1; (S !== 0 || B < A) && M !== -1; M--, B++)
-        S += i * U[M] >>> 0, U[M] = S % 256 >>> 0, S = S / 256 >>> 0;
-      if (S !== 0)
+      for (var B = 0, M = I - 1; (v !== 0 || B < C) && M !== -1; M--, B++)
+        v += i * U[M] >>> 0, U[M] = v % 256 >>> 0, v = v / 256 >>> 0;
+      if (v !== 0)
         throw new Error("Non-zero carry");
-      A = B, b++;
+      C = B, b++;
     }
-    for (var F = I - A; F !== I && U[F] === 0; )
+    for (var F = I - C; F !== I && U[F] === 0; )
       F++;
-    for (var N = new Uint8Array(x + (I - F)), L = x; F !== I; )
-      N[L++] = U[F++];
+    for (var N = new Uint8Array(x + (I - F)), P = x; F !== I; )
+      N[P++] = U[F++];
     return N;
   }
   function g(u) {
@@ -1655,25 +1660,25 @@ function Wr(e) {
     decode: g
   };
 }
-var Jr = Wr;
-const Gr = Jr, Xr = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
-var qr = Gr(Xr), Ze = qr, Zr = function(e) {
+var Xr = Gr;
+const qr = Xr, Zr = "123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz";
+var Yr = qr(Zr), Qe = Yr, Qr = function(e) {
   function t(o) {
-    var i = Uint8Array.from(o), c = e(i), a = i.length + 4, p = new Uint8Array(a);
-    return p.set(i, 0), p.set(c.subarray(0, 4), i.length), Ze.encode(p, a);
+    var i = Uint8Array.from(o), c = e(i), f = i.length + 4, p = new Uint8Array(f);
+    return p.set(i, 0), p.set(c.subarray(0, 4), i.length), Qe.encode(p, f);
   }
   function r(o) {
-    var i = o.slice(0, -4), c = o.slice(-4), a = e(i);
-    if (!(c[0] ^ a[0] | c[1] ^ a[1] | c[2] ^ a[2] | c[3] ^ a[3]))
+    var i = o.slice(0, -4), c = o.slice(-4), f = e(i);
+    if (!(c[0] ^ f[0] | c[1] ^ f[1] | c[2] ^ f[2] | c[3] ^ f[3]))
       return i;
   }
   function n(o) {
-    var i = Ze.decodeUnsafe(o);
+    var i = Qe.decodeUnsafe(o);
     if (i)
       return r(i);
   }
   function s(o) {
-    var i = Ze.decode(o), c = r(i);
+    var i = Qe.decode(o), c = r(i);
     if (!c) throw new Error("Invalid checksum");
     return c;
   }
@@ -1682,13 +1687,13 @@ var qr = Gr(Xr), Ze = qr, Zr = function(e) {
     decode: s,
     decodeUnsafe: n
   };
-}, { sha256: _t } = ve, Yr = Zr;
-function Qr(e) {
-  return _t(_t(e));
+}, { sha256: Ut } = ve, en = Qr;
+function tn(e) {
+  return Ut(Ut(e));
 }
-var en = Yr(Qr);
-const tn = /* @__PURE__ */ ze(en), er = "automerge:", tr = (e) => {
-  const t = new RegExp(`^${er}(\\w+)$`), [, r] = e.match(t) || [], n = r, s = rr(n);
+var rn = en(tn);
+const nn = /* @__PURE__ */ We(rn), rr = "automerge:", nr = (e) => {
+  const t = new RegExp(`^${rr}(\\w+)$`), [, r] = e.match(t) || [], n = r, s = sr(n);
   if (!s)
     throw new Error("Invalid document URL: " + e);
   return {
@@ -1697,42 +1702,42 @@ const tn = /* @__PURE__ */ ze(en), er = "automerge:", tr = (e) => {
     /** encoded DocumentId */
     documentId: n
   };
-}, rn = (e) => {
-  if (typeof e != "string" || !e || !e.startsWith(er))
+}, sn = (e) => {
+  if (typeof e != "string" || !e || !e.startsWith(rr))
     return !1;
   const t = e;
   try {
-    const { documentId: r } = tr(t);
-    return nn(r);
+    const { documentId: r } = nr(t);
+    return on(r);
   } catch {
     return !1;
   }
-}, nn = (e) => {
+}, on = (e) => {
   if (typeof e != "string")
     return !1;
-  const t = rr(e);
+  const t = sr(e);
   if (t === void 0)
     return !1;
-  const r = Ur(t);
-  return zt(r);
-}, rr = (e) => tn.decodeUnsafe(e);
-let st;
+  const r = kr(t);
+  return Wt(r);
+}, sr = (e) => nn.decodeUnsafe(e);
+let ot;
 try {
-  st = new TextDecoder();
+  ot = new TextDecoder();
 } catch {
 }
-let O, be, w = 0;
-const sn = 105, on = 57342, fn = 57343, Ot = 57337, It = 6, xe = {};
-let D = {}, K, Pe, Ve = 0, Ie = 0, G, ne, W = [], it = [], Q, Y, Ae, Ut = {
+let O, ge, w = 0;
+const fn = 105, an = 57342, cn = 57343, Ft = 57337, kt = 6, we = {};
+let Ce = 11281e4, ce = 1681e4, D = {}, K, Ne, $e = 0, Fe = 0, G, ne, W = [], ft = [], Q, Y, Ee, jt = {
   useRecords: !1,
   mapsAsObjects: !0
-}, Ue = !1, nr = 2;
+}, ke = !1, ir = 2;
 try {
   new Function("");
 } catch {
-  nr = 1 / 0;
+  ir = 1 / 0;
 }
-class Fe {
+class je {
   constructor(t) {
     if (t && ((t.keyMap || t._keyMap) && !t.useRecords && (t.useRecords = !1, t.mapsAsObjects = !0), t.useRecords === !1 && t.mapsAsObjects === void 0 && (t.mapsAsObjects = !0), t.getStructures && (t.getShared = t.getStructures), t.getShared && !t.structures && ((t.structures = []).uninitialized = !0), t.keyMap)) {
       this.mapKey = /* @__PURE__ */ new Map();
@@ -1779,48 +1784,48 @@ class Fe {
   }
   decode(t, r) {
     if (O)
-      return fr(() => (ct(), this ? this.decode(t, r) : Fe.prototype.decode.call(Ut, t, r)));
-    be = r > -1 ? r : t.length, w = 0, Ie = 0, Pe = null, G = null, O = t;
+      return cr(() => (ut(), this ? this.decode(t, r) : je.prototype.decode.call(jt, t, r)));
+    ge = r > -1 ? r : t.length, w = 0, Fe = 0, Ne = null, G = null, O = t;
     try {
       Y = t.dataView || (t.dataView = new DataView(t.buffer, t.byteOffset, t.byteLength));
     } catch (n) {
       throw O = null, t instanceof Uint8Array ? n : new Error("Source must be a Uint8Array or Buffer but was a " + (t && typeof t == "object" ? t.constructor.name : typeof t));
     }
-    if (this instanceof Fe) {
+    if (this instanceof je) {
       if (D = this, Q = this.sharedValues && (this.pack ? new Array(this.maxPrivatePackedValues || 16).concat(this.sharedValues) : this.sharedValues), this.structures)
-        return K = this.structures, ke();
+        return K = this.structures, Re();
       (!K || K.length > 0) && (K = []);
     } else
-      D = Ut, (!K || K.length > 0) && (K = []), Q = null;
-    return ke();
+      D = jt, (!K || K.length > 0) && (K = []), Q = null;
+    return Re();
   }
   decodeMultiple(t, r) {
     let n, s = 0;
     try {
       let o = t.length;
-      Ue = !0;
-      let i = this ? this.decode(t, o) : vt.decode(t, o);
+      ke = !0;
+      let i = this ? this.decode(t, o) : Ct.decode(t, o);
       if (r) {
         if (r(i) === !1)
           return;
         for (; w < o; )
-          if (s = w, r(ke()) === !1)
+          if (s = w, r(Re()) === !1)
             return;
       } else {
         for (n = [i]; w < o; )
-          s = w, n.push(ke());
+          s = w, n.push(Re());
         return n;
       }
     } catch (o) {
       throw o.lastPosition = s, o.values = n, o;
     } finally {
-      Ue = !1, ct();
+      ke = !1, ut();
     }
   }
 }
-function ke() {
+function Re() {
   try {
-    let e = P();
+    let e = L();
     if (G) {
       if (w >= G.postBundlePosition) {
         let t = new Error("Unexpected bundle position");
@@ -1828,19 +1833,19 @@ function ke() {
       }
       w = G.postBundlePosition, G = null;
     }
-    if (w == be)
+    if (w == ge)
       K = null, O = null, ne && (ne = null);
-    else if (w > be) {
+    else if (w > ge) {
       let t = new Error("Unexpected end of CBOR data");
       throw t.incomplete = !0, t;
-    } else if (!Ue)
+    } else if (!ke)
       throw new Error("Data read, but end of buffer not reached");
     return e;
   } catch (e) {
-    throw ct(), (e instanceof RangeError || e.message.startsWith("Unexpected end of buffer")) && (e.incomplete = !0), e;
+    throw ut(), (e instanceof RangeError || e.message.startsWith("Unexpected end of buffer")) && (e.incomplete = !0), e;
   }
 }
-function P() {
+function L() {
   let e = O[w++], t = e >> 5;
   if (e = e & 31, e > 23)
     switch (e) {
@@ -1849,14 +1854,14 @@ function P() {
         break;
       case 25:
         if (t == 7)
-          return un();
+          return dn();
         e = Y.getUint16(w), w += 2;
         break;
       case 26:
         if (t == 7) {
           let r = Y.getFloat32(w);
           if (D.useFloat32 > 2) {
-            let n = mt[(O[w] & 127) << 1 | O[w + 1] >> 7];
+            let n = At[(O[w] & 127) << 1 | O[w + 1] >> 7];
             return w += 4, (n * r + (r > 0 ? 0.5 : -0.5) >> 0) / n;
           }
           return w += 4, r;
@@ -1882,25 +1887,48 @@ function P() {
             throw new Error("Indefinite length not supported for byte or text strings");
           case 4:
             let r = [], n, s = 0;
-            for (; (n = P()) != xe; )
+            for (; (n = L()) != we; ) {
+              if (s >= Ce) throw new Error(`Array length exceeds ${Ce}`);
               r[s++] = n;
+            }
             return t == 4 ? r : t == 3 ? r.join("") : Buffer.concat(r);
           case 5:
             let o;
             if (D.mapsAsObjects) {
-              let i = {};
-              if (D.keyMap) for (; (o = P()) != xe; ) i[se(D.decodeKey(o))] = P();
-              else for (; (o = P()) != xe; ) i[se(o)] = P();
+              let i = {}, c = 0;
+              if (D.keyMap)
+                for (; (o = L()) != we; ) {
+                  if (c++ >= ce) throw new Error(`Property count exceeds ${ce}`);
+                  i[se(D.decodeKey(o))] = L();
+                }
+              else
+                for (; (o = L()) != we; ) {
+                  if (c++ >= ce) throw new Error(`Property count exceeds ${ce}`);
+                  i[se(o)] = L();
+                }
               return i;
             } else {
-              Ae && (D.mapsAsObjects = !0, Ae = !1);
+              Ee && (D.mapsAsObjects = !0, Ee = !1);
               let i = /* @__PURE__ */ new Map();
-              if (D.keyMap) for (; (o = P()) != xe; ) i.set(D.decodeKey(o), P());
-              else for (; (o = P()) != xe; ) i.set(o, P());
+              if (D.keyMap) {
+                let c = 0;
+                for (; (o = L()) != we; ) {
+                  if (c++ >= ce)
+                    throw new Error(`Map size exceeds ${ce}`);
+                  i.set(D.decodeKey(o), L());
+                }
+              } else {
+                let c = 0;
+                for (; (o = L()) != we; ) {
+                  if (c++ >= ce)
+                    throw new Error(`Map size exceeds ${ce}`);
+                  i.set(o, L());
+                }
+              }
               return i;
             }
           case 7:
-            return xe;
+            return we;
           default:
             throw new Error("Invalid major type for indefinite length " + t);
         }
@@ -1913,74 +1941,76 @@ function P() {
     case 1:
       return ~e;
     case 2:
-      return ln(e);
+      return hn(e);
     case 3:
-      if (Ie >= w)
-        return Pe.slice(w - Ve, (w += e) - Ve);
-      if (Ie == 0 && be < 140 && e < 32) {
-        let s = e < 16 ? sr(e) : cn(e);
+      if (Fe >= w)
+        return Ne.slice(w - $e, (w += e) - $e);
+      if (Fe == 0 && ge < 140 && e < 32) {
+        let s = e < 16 ? or(e) : un(e);
         if (s != null)
           return s;
       }
-      return an(e);
+      return ln(e);
     case 4:
+      if (e >= Ce) throw new Error(`Array length exceeds ${Ce}`);
       let r = new Array(e);
-      for (let s = 0; s < e; s++) r[s] = P();
+      for (let s = 0; s < e; s++) r[s] = L();
       return r;
     case 5:
+      if (e >= ce) throw new Error(`Map size exceeds ${Ce}`);
       if (D.mapsAsObjects) {
         let s = {};
-        if (D.keyMap) for (let o = 0; o < e; o++) s[se(D.decodeKey(P()))] = P();
-        else for (let o = 0; o < e; o++) s[se(P())] = P();
+        if (D.keyMap) for (let o = 0; o < e; o++) s[se(D.decodeKey(L()))] = L();
+        else for (let o = 0; o < e; o++) s[se(L())] = L();
         return s;
       } else {
-        Ae && (D.mapsAsObjects = !0, Ae = !1);
+        Ee && (D.mapsAsObjects = !0, Ee = !1);
         let s = /* @__PURE__ */ new Map();
-        if (D.keyMap) for (let o = 0; o < e; o++) s.set(D.decodeKey(P()), P());
-        else for (let o = 0; o < e; o++) s.set(P(), P());
+        if (D.keyMap) for (let o = 0; o < e; o++) s.set(D.decodeKey(L()), L());
+        else for (let o = 0; o < e; o++) s.set(L(), L());
         return s;
       }
     case 6:
-      if (e >= Ot) {
+      if (e >= Ft) {
         let s = K[e & 8191];
         if (s)
-          return s.read || (s.read = ot(s)), s.read();
+          return s.read || (s.read = at(s)), s.read();
         if (e < 65536) {
-          if (e == fn) {
-            let o = me(), i = P(), c = P();
-            at(i, c);
-            let a = {};
+          if (e == cn) {
+            let o = Se(), i = L(), c = L();
+            lt(i, c);
+            let f = {};
             if (D.keyMap) for (let p = 2; p < o; p++) {
               let d = D.decodeKey(c[p - 2]);
-              a[se(d)] = P();
+              f[se(d)] = L();
             }
             else for (let p = 2; p < o; p++) {
               let d = c[p - 2];
-              a[se(d)] = P();
+              f[se(d)] = L();
             }
-            return a;
-          } else if (e == on) {
-            let o = me(), i = P();
+            return f;
+          } else if (e == an) {
+            let o = Se(), i = L();
             for (let c = 2; c < o; c++)
-              at(i++, P());
-            return P();
-          } else if (e == Ot)
-            return gn();
-          if (D.getShared && (wt(), s = K[e & 8191], s))
-            return s.read || (s.read = ot(s)), s.read();
+              lt(i++, L());
+            return L();
+          } else if (e == Ft)
+            return wn();
+          if (D.getShared && (vt(), s = K[e & 8191], s))
+            return s.read || (s.read = at(s)), s.read();
         }
       }
       let n = W[e];
       if (n)
-        return n.handlesRead ? n(P) : n(P());
+        return n.handlesRead ? n(L) : n(L());
       {
-        let s = P();
-        for (let o = 0; o < it.length; o++) {
-          let i = it[o](e, s);
+        let s = L();
+        for (let o = 0; o < ft.length; o++) {
+          let i = ft[o](e, s);
           if (i !== void 0)
             return i;
         }
-        return new ge(s, e);
+        return new xe(s, e);
       }
     case 7:
       switch (e) {
@@ -1994,7 +2024,7 @@ function P() {
           return;
         case 31:
         default:
-          let s = (Q || de())[e];
+          let s = (Q || ye())[e];
           if (s !== void 0)
             return s;
           throw new Error("Unknown token " + e);
@@ -2007,8 +2037,9 @@ function P() {
       throw new Error("Unknown CBOR token " + e);
   }
 }
-const Ft = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
-function ot(e) {
+const Mt = /^[a-zA-Z_$][a-zA-Z\d_$]*$/;
+function at(e) {
+  if (!e) throw new Error("Structure is required in record definition");
   function t() {
     let r = O[w++];
     if (r = r & 31, r > 23)
@@ -2028,17 +2059,17 @@ function ot(e) {
     let n = this.compiledReader;
     for (; n; ) {
       if (n.propertyCount === r)
-        return n(P);
+        return n(L);
       n = n.next;
     }
-    if (this.slowReads++ >= nr) {
+    if (this.slowReads++ >= ir) {
       let o = this.length == r ? this : this.slice(0, r);
-      return n = D.keyMap ? new Function("r", "return {" + o.map((i) => D.decodeKey(i)).map((i) => Ft.test(i) ? se(i) + ":r()" : "[" + JSON.stringify(i) + "]:r()").join(",") + "}") : new Function("r", "return {" + o.map((i) => Ft.test(i) ? se(i) + ":r()" : "[" + JSON.stringify(i) + "]:r()").join(",") + "}"), this.compiledReader && (n.next = this.compiledReader), n.propertyCount = r, this.compiledReader = n, n(P);
+      return n = D.keyMap ? new Function("r", "return {" + o.map((i) => D.decodeKey(i)).map((i) => Mt.test(i) ? se(i) + ":r()" : "[" + JSON.stringify(i) + "]:r()").join(",") + "}") : new Function("r", "return {" + o.map((i) => Mt.test(i) ? se(i) + ":r()" : "[" + JSON.stringify(i) + "]:r()").join(",") + "}"), this.compiledReader && (n.next = this.compiledReader), n.propertyCount = r, this.compiledReader = n, n(L);
     }
     let s = {};
-    if (D.keyMap) for (let o = 0; o < r; o++) s[se(D.decodeKey(this[o]))] = P();
+    if (D.keyMap) for (let o = 0; o < r; o++) s[se(D.decodeKey(this[o]))] = L();
     else for (let o = 0; o < r; o++)
-      s[se(this[o])] = P();
+      s[se(this[o])] = L();
     return s;
   }
   return e.slowReads = 0, t;
@@ -2049,13 +2080,13 @@ function se(e) {
   if (e == null) return e + "";
   throw new Error("Invalid property name type " + typeof e);
 }
-let an = ft;
-function ft(e) {
+let ln = ct;
+function ct(e) {
   let t;
-  if (e < 16 && (t = sr(e)))
+  if (e < 16 && (t = or(e)))
     return t;
-  if (e > 64 && st)
-    return st.decode(O.subarray(w, w += e));
+  if (e > 64 && ot)
+    return ot.decode(O.subarray(w, w += e));
   const r = w + e, n = [];
   for (t = ""; w < r; ) {
     const s = O[w++];
@@ -2069,8 +2100,8 @@ function ft(e) {
       n.push((s & 31) << 12 | o << 6 | i);
     } else if ((s & 248) === 240) {
       const o = O[w++] & 63, i = O[w++] & 63, c = O[w++] & 63;
-      let a = (s & 7) << 18 | o << 12 | i << 6 | c;
-      a > 65535 && (a -= 65536, n.push(a >>> 10 & 1023 | 55296), a = 56320 | a & 1023), n.push(a);
+      let f = (s & 7) << 18 | o << 12 | i << 6 | c;
+      f > 65535 && (f -= 65536, n.push(f >>> 10 & 1023 | 55296), f = 56320 | f & 1023), n.push(f);
     } else
       n.push(s);
     n.length >= 4096 && (t += X.apply(String, n), n.length = 0);
@@ -2078,7 +2109,7 @@ function ft(e) {
   return n.length > 0 && (t += X.apply(String, n)), t;
 }
 let X = String.fromCharCode;
-function cn(e) {
+function un(e) {
   let t = w, r = new Array(e);
   for (let n = 0; n < e; n++) {
     const s = O[w++];
@@ -2090,7 +2121,7 @@ function cn(e) {
   }
   return X.apply(String, r);
 }
-function sr(e) {
+function or(e) {
   if (e < 4)
     if (e < 2) {
       if (e === 0)
@@ -2150,21 +2181,21 @@ function sr(e) {
       }
       return X(t, r, n, s, o, i, c);
     } else {
-      let o = O[w++], i = O[w++], c = O[w++], a = O[w++];
-      if ((o & 128) > 0 || (i & 128) > 0 || (c & 128) > 0 || (a & 128) > 0) {
+      let o = O[w++], i = O[w++], c = O[w++], f = O[w++];
+      if ((o & 128) > 0 || (i & 128) > 0 || (c & 128) > 0 || (f & 128) > 0) {
         w -= 8;
         return;
       }
       if (e < 10) {
         if (e === 8)
-          return X(t, r, n, s, o, i, c, a);
+          return X(t, r, n, s, o, i, c, f);
         {
           let p = O[w++];
           if ((p & 128) > 0) {
             w -= 9;
             return;
           }
-          return X(t, r, n, s, o, i, c, a, p);
+          return X(t, r, n, s, o, i, c, f, p);
         }
       } else if (e < 12) {
         let p = O[w++], d = O[w++];
@@ -2173,13 +2204,13 @@ function sr(e) {
           return;
         }
         if (e < 11)
-          return X(t, r, n, s, o, i, c, a, p, d);
+          return X(t, r, n, s, o, i, c, f, p, d);
         let h = O[w++];
         if ((h & 128) > 0) {
           w -= 11;
           return;
         }
-        return X(t, r, n, s, o, i, c, a, p, d, h);
+        return X(t, r, n, s, o, i, c, f, p, d, h);
       } else {
         let p = O[w++], d = O[w++], h = O[w++], g = O[w++];
         if ((p & 128) > 0 || (d & 128) > 0 || (h & 128) > 0 || (g & 128) > 0) {
@@ -2188,14 +2219,14 @@ function sr(e) {
         }
         if (e < 14) {
           if (e === 12)
-            return X(t, r, n, s, o, i, c, a, p, d, h, g);
+            return X(t, r, n, s, o, i, c, f, p, d, h, g);
           {
             let u = O[w++];
             if ((u & 128) > 0) {
               w -= 13;
               return;
             }
-            return X(t, r, n, s, o, i, c, a, p, d, h, g, u);
+            return X(t, r, n, s, o, i, c, f, p, d, h, g, u);
           }
         } else {
           let u = O[w++], b = O[w++];
@@ -2204,26 +2235,26 @@ function sr(e) {
             return;
           }
           if (e < 15)
-            return X(t, r, n, s, o, i, c, a, p, d, h, g, u, b);
+            return X(t, r, n, s, o, i, c, f, p, d, h, g, u, b);
           let x = O[w++];
           if ((x & 128) > 0) {
             w -= 15;
             return;
           }
-          return X(t, r, n, s, o, i, c, a, p, d, h, g, u, b, x);
+          return X(t, r, n, s, o, i, c, f, p, d, h, g, u, b, x);
         }
       }
     }
   }
 }
-function ln(e) {
+function hn(e) {
   return D.copyBuffers ? (
     // specifically use the copying slice (not the node one)
     Uint8Array.prototype.slice.call(O, w, w += e)
   ) : O.subarray(w, w += e);
 }
-let ir = new Float32Array(1), Me = new Uint8Array(ir.buffer, 0, 4);
-function un() {
+let fr = new Float32Array(1), Be = new Uint8Array(fr.buffer, 0, 4);
+function dn() {
   let e = O[w++], t = O[w++], r = (e & 127) >> 2;
   if (r === 31)
     return t || e & 3 ? NaN : e & 128 ? -1 / 0 : 1 / 0;
@@ -2231,12 +2262,12 @@ function un() {
     let n = ((e & 3) << 8 | t) / 16777216;
     return e & 128 ? -n : n;
   }
-  return Me[3] = e & 128 | // sign bit
-  (r >> 1) + 56, Me[2] = (e & 7) << 5 | // last exponent bit and first two mantissa bits
-  t >> 3, Me[1] = t << 5, Me[0] = 0, ir[0];
+  return Be[3] = e & 128 | // sign bit
+  (r >> 1) + 56, Be[2] = (e & 7) << 5 | // last exponent bit and first two mantissa bits
+  t >> 3, Be[1] = t << 5, Be[0] = 0, fr[0];
 }
 new Array(4096);
-class ge {
+class xe {
   constructor(t, r) {
     this.value = t, this.tag = r;
   }
@@ -2246,20 +2277,20 @@ W[1] = (e) => new Date(Math.round(e * 1e3));
 W[2] = (e) => {
   let t = BigInt(0);
   for (let r = 0, n = e.byteLength; r < n; r++)
-    t = BigInt(e[r]) + t << BigInt(8);
+    t = BigInt(e[r]) + (t << BigInt(8));
   return t;
 };
 W[3] = (e) => BigInt(-1) - W[2](e);
 W[4] = (e) => +(e[1] + "e" + e[0]);
 W[5] = (e) => e[1] * Math.exp(e[0] * Math.log(2));
-const at = (e, t) => {
+const lt = (e, t) => {
   e = e - 57344;
   let r = K[e];
-  r && r.isShared && ((K.restoreStructures || (K.restoreStructures = []))[e] = r), K[e] = t, t.read = ot(t);
+  r && r.isShared && ((K.restoreStructures || (K.restoreStructures = []))[e] = r), K[e] = t, t.read = at(t);
 };
-W[sn] = (e) => {
+W[fn] = (e) => {
   let t = e.length, r = e[1];
-  at(e[0], r);
+  lt(e[0], r);
   let n = {};
   for (let s = 2; s < t; s++) {
     let o = r[s - 2];
@@ -2267,11 +2298,11 @@ W[sn] = (e) => {
   }
   return n;
 };
-W[14] = (e) => G ? G[0].slice(G.position0, G.position0 += e) : new ge(e, 14);
-W[15] = (e) => G ? G[1].slice(G.position1, G.position1 += e) : new ge(e, 15);
-let hn = { Error, RegExp };
-W[27] = (e) => (hn[e[0]] || Error)(e[1], e[2]);
-const or = (e) => {
+W[14] = (e) => G ? G[0].slice(G.position0, G.position0 += e) : new xe(e, 14);
+W[15] = (e) => G ? G[1].slice(G.position1, G.position1 += e) : new xe(e, 15);
+let yn = { Error, RegExp };
+W[27] = (e) => (yn[e[0]] || Error)(e[1], e[2]);
+const ar = (e) => {
   if (O[w++] != 132) {
     let r = new Error("Packed values structure must be followed by a 4 element array");
     throw O.length < w && (r.incomplete = !0), r;
@@ -2283,14 +2314,14 @@ const or = (e) => {
   }
   return Q = Q ? t.concat(Q.slice(t.length)) : t, Q.prefixes = e(), Q.suffixes = e(), e();
 };
-or.handlesRead = !0;
-W[51] = or;
-W[It] = (e) => {
+ar.handlesRead = !0;
+W[51] = ar;
+W[kt] = (e) => {
   if (!Q)
     if (D.getShared)
-      wt();
+      vt();
     else
-      return new ge(e, It);
+      return new xe(e, kt);
   if (typeof e == "number")
     return Q[16 + (e >= 0 ? 2 * e : -2 * e - 1)];
   let t = new Error("No support for non-integer packed references yet");
@@ -2311,33 +2342,33 @@ W[29] = (e) => {
   return t.used = !0, t.target;
 };
 W[258] = (e) => new Set(e);
-(W[259] = (e) => (D.mapsAsObjects && (D.mapsAsObjects = !1, Ae = !0), e())).handlesRead = !0;
-function we(e, t) {
+(W[259] = (e) => (D.mapsAsObjects && (D.mapsAsObjects = !1, Ee = !0), e())).handlesRead = !0;
+function me(e, t) {
   return typeof e == "string" ? e + t : e instanceof Array ? e.concat(t) : Object.assign({}, e, t);
 }
-function de() {
+function ye() {
   if (!Q)
     if (D.getShared)
-      wt();
+      vt();
     else
       throw new Error("No packed values available");
   return Q;
 }
-const dn = 1399353956;
-it.push((e, t) => {
+const pn = 1399353956;
+ft.push((e, t) => {
   if (e >= 225 && e <= 255)
-    return we(de().prefixes[e - 224], t);
+    return me(ye().prefixes[e - 224], t);
   if (e >= 28704 && e <= 32767)
-    return we(de().prefixes[e - 28672], t);
+    return me(ye().prefixes[e - 28672], t);
   if (e >= 1879052288 && e <= 2147483647)
-    return we(de().prefixes[e - 1879048192], t);
+    return me(ye().prefixes[e - 1879048192], t);
   if (e >= 216 && e <= 223)
-    return we(t, de().suffixes[e - 216]);
+    return me(t, ye().suffixes[e - 216]);
   if (e >= 27647 && e <= 28671)
-    return we(t, de().suffixes[e - 27639]);
+    return me(t, ye().suffixes[e - 27639]);
   if (e >= 1811940352 && e <= 1879048191)
-    return we(t, de().suffixes[e - 1811939328]);
-  if (e == dn)
+    return me(t, ye().suffixes[e - 1811939328]);
+  if (e == pn)
     return {
       packedValues: Q,
       structures: K.slice(0),
@@ -2346,7 +2377,7 @@ it.push((e, t) => {
   if (e == 55799)
     return t;
 });
-const yn = new Uint8Array(new Uint16Array([1]).buffer)[0] == 1, jt = [
+const bn = new Uint8Array(new Uint16Array([1]).buffer)[0] == 1, Rt = [
   Uint8Array,
   Uint8ClampedArray,
   Uint16Array,
@@ -2358,40 +2389,40 @@ const yn = new Uint8Array(new Uint16Array([1]).buffer)[0] == 1, jt = [
   typeof BigInt64Array > "u" ? { name: "BigInt64Array" } : BigInt64Array,
   Float32Array,
   Float64Array
-], pn = [64, 68, 69, 70, 71, 72, 77, 78, 79, 85, 86];
-for (let e = 0; e < jt.length; e++)
-  bn(jt[e], pn[e]);
-function bn(e, t) {
+], gn = [64, 68, 69, 70, 71, 72, 77, 78, 79, 85, 86];
+for (let e = 0; e < Rt.length; e++)
+  xn(Rt[e], gn[e]);
+function xn(e, t) {
   let r = "get" + e.name.slice(0, -5), n;
   typeof e == "function" ? n = e.BYTES_PER_ELEMENT : e = null;
   for (let s = 0; s < 2; s++) {
     if (!s && n == 1)
       continue;
     let o = n == 2 ? 1 : n == 4 ? 2 : n == 8 ? 3 : 0;
-    W[s ? t : t - 4] = n == 1 || s == yn ? (i) => {
+    W[s ? t : t - 4] = n == 1 || s == bn ? (i) => {
       if (!e)
         throw new Error("Could not find typed array for code " + t);
       return !D.copyBuffers && (n === 1 || n === 2 && !(i.byteOffset & 1) || n === 4 && !(i.byteOffset & 3) || n === 8 && !(i.byteOffset & 7)) ? new e(i.buffer, i.byteOffset, i.byteLength >> o) : new e(Uint8Array.prototype.slice.call(i, 0).buffer);
     } : (i) => {
       if (!e)
         throw new Error("Could not find typed array for code " + t);
-      let c = new DataView(i.buffer, i.byteOffset, i.byteLength), a = i.length >> o, p = new e(a), d = c[r];
-      for (let h = 0; h < a; h++)
+      let c = new DataView(i.buffer, i.byteOffset, i.byteLength), f = i.length >> o, p = new e(f), d = c[r];
+      for (let h = 0; h < f; h++)
         p[h] = d.call(c, h << o, s);
       return p;
     };
   }
 }
-function gn() {
-  let e = me(), t = w + P();
+function wn() {
+  let e = Se(), t = w + L();
   for (let n = 2; n < e; n++) {
-    let s = me();
+    let s = Se();
     w += s;
   }
   let r = w;
-  return w = t, G = [ft(me()), ft(me())], G.position0 = 0, G.position1 = 0, G.postBundlePosition = w, w = r, P();
+  return w = t, G = [ct(Se()), ct(Se())], G.position0 = 0, G.position1 = 0, G.postBundlePosition = w, w = r, L();
 }
-function me() {
+function Se() {
   let e = O[w++] & 31;
   if (e > 23)
     switch (e) {
@@ -2407,44 +2438,44 @@ function me() {
     }
   return e;
 }
-function wt() {
+function vt() {
   if (D.getShared) {
-    let e = fr(() => (O = null, D.getShared())) || {}, t = e.structures || [];
+    let e = cr(() => (O = null, D.getShared())) || {}, t = e.structures || [];
     D.sharedVersion = e.version, Q = D.sharedValues = e.packedValues, K === !0 ? D.structures = K = t : K.splice.apply(K, [0, t.length].concat(t));
   }
 }
-function fr(e) {
-  let t = be, r = w, n = Ve, s = Ie, o = Pe, i = ne, c = G, a = new Uint8Array(O.slice(0, be)), p = K, d = D, h = Ue, g = e();
-  return be = t, w = r, Ve = n, Ie = s, Pe = o, ne = i, G = c, O = a, Ue = h, K = p, D = d, Y = new DataView(O.buffer, O.byteOffset, O.byteLength), g;
+function cr(e) {
+  let t = ge, r = w, n = $e, s = Fe, o = Ne, i = ne, c = G, f = new Uint8Array(O.slice(0, ge)), p = K, d = D, h = ke, g = e();
+  return ge = t, w = r, $e = n, Fe = s, Ne = o, ne = i, G = c, O = f, ke = h, K = p, D = d, Y = new DataView(O.buffer, O.byteOffset, O.byteLength), g;
 }
-function ct() {
+function ut() {
   O = null, ne = null, K = null;
 }
-const mt = new Array(147);
+const At = new Array(147);
 for (let e = 0; e < 256; e++)
-  mt[e] = +("1e" + Math.floor(45.15 - e * 0.30103));
-let vt = new Fe({ useRecords: !1 });
-vt.decode;
-vt.decodeMultiple;
-let Re;
+  At[e] = +("1e" + Math.floor(45.15 - e * 0.30103));
+let Ct = new je({ useRecords: !1 });
+Ct.decode;
+Ct.decodeMultiple;
+let Te;
 try {
-  Re = new TextEncoder();
+  Te = new TextEncoder();
 } catch {
 }
-let lt, ar;
-const We = typeof globalThis == "object" && globalThis.Buffer, je = typeof We < "u", Ye = je ? We.allocUnsafeSlow : Uint8Array, kt = je ? We : Uint8Array, Mt = 256, Rt = je ? 4294967296 : 2144337920;
-let Qe, y, z, f = 0, ue, J = null;
-const xn = 61440, wn = /[\u0080-\uFFFF]/, ee = Symbol("record-id");
-class mn extends Fe {
+let ht, lr;
+const Ge = typeof globalThis == "object" && globalThis.Buffer, Me = typeof Ge < "u", et = Me ? Ge.allocUnsafeSlow : Uint8Array, Bt = Me ? Ge : Uint8Array, Tt = 256, Dt = Me ? 4294967296 : 2144337920;
+let tt, y, H, a = 0, he, J = null;
+const mn = 61440, Sn = /[\u0080-\uFFFF]/, ee = Symbol("record-id");
+class vn extends je {
   constructor(t) {
     super(t), this.offset = 0;
     let r, n, s, o, i;
     t = t || {};
-    let c = kt.prototype.utf8Write ? function(l, _, m) {
+    let c = Bt.prototype.utf8Write ? function(l, _, m) {
       return y.utf8Write(l, _, m);
-    } : Re && Re.encodeInto ? function(l, _) {
-      return Re.encodeInto(l, y.subarray(_)).written;
-    } : !1, a = this, p = t.structures || t.saveStructures, d = t.maxSharedStructures;
+    } : Te && Te.encodeInto ? function(l, _) {
+      return Te.encodeInto(l, y.subarray(_)).written;
+    } : !1, f = this, p = t.structures || t.saveStructures, d = t.maxSharedStructures;
     if (d == null && (d = p ? 128 : 0), d > 8190)
       throw new Error("Maximum maxSharedStructure is 8190");
     let h = t.sequential;
@@ -2455,7 +2486,7 @@ class mn extends Fe {
       for (let l = 0, _ = b.length; l < _; l++)
         x[b[l]] = l;
     }
-    let A = [], I = 0, U = 0;
+    let C = [], I = 0, U = 0;
     this.mapEncode = function(l, _) {
       if (this._keyMap && !this._mapped)
         switch (l.constructor.name) {
@@ -2465,89 +2496,89 @@ class mn extends Fe {
         }
       return this.encode(l, _);
     }, this.encode = function(l, _) {
-      if (y || (y = new Ye(8192), z = new DataView(y.buffer, 0, 8192), f = 0), ue = y.length - 10, ue - f < 2048 ? (y = new Ye(y.length), z = new DataView(y.buffer, 0, y.length), ue = y.length - 10, f = 0) : _ === Lt && (f = f + 7 & 2147483640), r = f, a.useSelfDescribedHeader && (z.setUint32(f, 3654940416), f += 3), i = a.structuredClone ? /* @__PURE__ */ new Map() : null, a.bundleStrings && typeof l != "string" ? (J = [], J.size = 1 / 0) : J = null, n = a.structures, n) {
+      if (y || (y = new et(8192), H = new DataView(y.buffer, 0, 8192), a = 0), he = y.length - 10, he - a < 2048 ? (y = new et(y.length), H = new DataView(y.buffer, 0, y.length), he = y.length - 10, a = 0) : _ === Vt && (a = a + 7 & 2147483640), r = a, f.useSelfDescribedHeader && (H.setUint32(a, 3654940416), a += 3), i = f.structuredClone ? /* @__PURE__ */ new Map() : null, f.bundleStrings && typeof l != "string" ? (J = [], J.size = 1 / 0) : J = null, n = f.structures, n) {
         if (n.uninitialized) {
-          let C = a.getShared() || {};
-          a.structures = n = C.structures || [], a.sharedVersion = C.version;
-          let v = a.sharedValues = C.packedValues;
-          if (v) {
+          let A = f.getShared() || {};
+          f.structures = n = A.structures || [], f.sharedVersion = A.version;
+          let S = f.sharedValues = A.packedValues;
+          if (S) {
             x = {};
-            for (let j = 0, k = v.length; j < k; j++)
-              x[v[j]] = j;
+            for (let k = 0, j = S.length; k < j; k++)
+              x[S[k]] = k;
           }
         }
         let m = n.length;
         if (m > d && !h && (m = d), !n.transitions) {
           n.transitions = /* @__PURE__ */ Object.create(null);
-          for (let C = 0; C < m; C++) {
-            let v = n[C];
-            if (!v)
+          for (let A = 0; A < m; A++) {
+            let S = n[A];
+            if (!S)
               continue;
-            let j, k = n.transitions;
-            for (let R = 0, T = v.length; R < T; R++) {
-              k[ee] === void 0 && (k[ee] = C);
-              let V = v[R];
-              j = k[V], j || (j = k[V] = /* @__PURE__ */ Object.create(null)), k = j;
+            let k, j = n.transitions;
+            for (let R = 0, T = S.length; R < T; R++) {
+              j[ee] === void 0 && (j[ee] = A);
+              let V = S[R];
+              k = j[V], k || (k = j[V] = /* @__PURE__ */ Object.create(null)), j = k;
             }
-            k[ee] = C | 1048576;
+            j[ee] = A | 1048576;
           }
         }
         h || (n.nextId = m);
       }
       if (s && (s = !1), o = n || [], u = x, t.pack) {
         let m = /* @__PURE__ */ new Map();
-        if (m.values = [], m.encoder = a, m.maxValues = t.maxPrivatePackedValues || (x ? 16 : 1 / 0), m.objectMap = x || !1, m.samplingPackedValues = g, Be(l, m), m.values.length > 0) {
-          y[f++] = 216, y[f++] = 51, fe(4);
-          let C = m.values;
-          S(C), fe(0), fe(0), u = Object.create(x || null);
-          for (let v = 0, j = C.length; v < j; v++)
-            u[C[v]] = v;
+        if (m.values = [], m.encoder = f, m.maxValues = t.maxPrivatePackedValues || (x ? 16 : 1 / 0), m.objectMap = x || !1, m.samplingPackedValues = g, De(l, m), m.values.length > 0) {
+          y[a++] = 216, y[a++] = 51, fe(4);
+          let A = m.values;
+          v(A), fe(0), fe(0), u = Object.create(x || null);
+          for (let S = 0, k = A.length; S < k; S++)
+            u[A[S]] = S;
         }
       }
-      Qe = _ & tt;
+      tt = _ & nt;
       try {
-        if (Qe)
+        if (tt)
           return;
-        if (S(l), J && Dt(r, S), a.offset = f, i && i.idsToInsert) {
-          f += i.idsToInsert.length * 2, f > ue && M(f), a.offset = f;
-          let m = An(y.subarray(r, f), i.idsToInsert);
+        if (v(l), J && Lt(r, v), f.offset = a, i && i.idsToInsert) {
+          a += i.idsToInsert.length * 2, a > he && M(a), f.offset = a;
+          let m = En(y.subarray(r, a), i.idsToInsert);
           return i = null, m;
         }
-        return _ & Lt ? (y.start = r, y.end = f, y) : y.subarray(r, f);
+        return _ & Vt ? (y.start = r, y.end = a, y) : y.subarray(r, a);
       } finally {
         if (n) {
           if (U < 10 && U++, n.length > d && (n.length = d), I > 1e4)
-            n.transitions = null, U = 0, I = 0, A.length > 0 && (A = []);
-          else if (A.length > 0 && !h) {
-            for (let m = 0, C = A.length; m < C; m++)
-              A[m][ee] = void 0;
-            A = [];
+            n.transitions = null, U = 0, I = 0, C.length > 0 && (C = []);
+          else if (C.length > 0 && !h) {
+            for (let m = 0, A = C.length; m < A; m++)
+              C[m][ee] = void 0;
+            C = [];
           }
         }
-        if (s && a.saveShared) {
-          a.structures.length > d && (a.structures = a.structures.slice(0, d));
-          let m = y.subarray(r, f);
-          return a.updateSharedData() === !1 ? a.encode(l) : m;
+        if (s && f.saveShared) {
+          f.structures.length > d && (f.structures = f.structures.slice(0, d));
+          let m = y.subarray(r, a);
+          return f.updateSharedData() === !1 ? f.encode(l) : m;
         }
-        _ & Cn && (f = r);
+        _ & _n && (a = r);
       }
     }, this.findCommonStringsToPack = () => (g = /* @__PURE__ */ new Map(), x || (x = /* @__PURE__ */ Object.create(null)), (l) => {
       let _ = l && l.threshold || 4, m = this.pack ? l.maxPrivatePackedValues || 16 : 0;
       b || (b = this.sharedValues = []);
-      for (let [C, v] of g)
-        v.count > _ && (x[C] = m++, b.push(C), s = !0);
+      for (let [A, S] of g)
+        S.count > _ && (x[A] = m++, b.push(A), s = !0);
       for (; this.saveShared && this.updateSharedData() === !1; )
         ;
       g = null;
     });
-    const S = (l) => {
-      f > ue && (y = M(f));
+    const v = (l) => {
+      a > he && (y = M(a));
       var _ = typeof l, m;
       if (_ === "string") {
         if (u) {
-          let k = u[l];
-          if (k >= 0) {
-            k < 16 ? y[f++] = k + 224 : (y[f++] = 198, k & 1 ? S(15 - k >> 1) : S(k - 16 >> 1));
+          let j = u[l];
+          if (j >= 0) {
+            j < 16 ? y[a++] = j + 224 : (y[a++] = 198, j & 1 ? v(15 - j >> 1) : v(j - 16 >> 1));
             return;
           } else if (g && !t.pack) {
             let R = g.get(l);
@@ -2556,248 +2587,254 @@ class mn extends Fe {
             });
           }
         }
-        let C = l.length;
-        if (J && C >= 4 && C < 1024) {
-          if ((J.size += C) > xn) {
+        let A = l.length;
+        if (J && A >= 4 && A < 1024) {
+          if ((J.size += A) > mn) {
             let R, T = (J[0] ? J[0].length * 3 + J[1].length : 0) + 10;
-            f + T > ue && (y = M(f + T)), y[f++] = 217, y[f++] = 223, y[f++] = 249, y[f++] = J.position ? 132 : 130, y[f++] = 26, R = f - r, f += 4, J.position && Dt(r, S), J = ["", ""], J.size = 0, J.position = R;
+            a + T > he && (y = M(a + T)), y[a++] = 217, y[a++] = 223, y[a++] = 249, y[a++] = J.position ? 132 : 130, y[a++] = 26, R = a - r, a += 4, J.position && Lt(r, v), J = ["", ""], J.size = 0, J.position = R;
           }
-          let k = wn.test(l);
-          J[k ? 0 : 1] += l, y[f++] = k ? 206 : 207, S(C);
+          let j = Sn.test(l);
+          J[j ? 0 : 1] += l, y[a++] = j ? 206 : 207, v(A);
           return;
         }
-        let v;
-        C < 32 ? v = 1 : C < 256 ? v = 2 : C < 65536 ? v = 3 : v = 5;
-        let j = C * 3;
-        if (f + j > ue && (y = M(f + j)), C < 64 || !c) {
-          let k, R, T, V = f + v;
-          for (k = 0; k < C; k++)
-            R = l.charCodeAt(k), R < 128 ? y[V++] = R : R < 2048 ? (y[V++] = R >> 6 | 192, y[V++] = R & 63 | 128) : (R & 64512) === 55296 && ((T = l.charCodeAt(k + 1)) & 64512) === 56320 ? (R = 65536 + ((R & 1023) << 10) + (T & 1023), k++, y[V++] = R >> 18 | 240, y[V++] = R >> 12 & 63 | 128, y[V++] = R >> 6 & 63 | 128, y[V++] = R & 63 | 128) : (y[V++] = R >> 12 | 224, y[V++] = R >> 6 & 63 | 128, y[V++] = R & 63 | 128);
-          m = V - f - v;
+        let S;
+        A < 32 ? S = 1 : A < 256 ? S = 2 : A < 65536 ? S = 3 : S = 5;
+        let k = A * 3;
+        if (a + k > he && (y = M(a + k)), A < 64 || !c) {
+          let j, R, T, V = a + S;
+          for (j = 0; j < A; j++)
+            R = l.charCodeAt(j), R < 128 ? y[V++] = R : R < 2048 ? (y[V++] = R >> 6 | 192, y[V++] = R & 63 | 128) : (R & 64512) === 55296 && ((T = l.charCodeAt(j + 1)) & 64512) === 56320 ? (R = 65536 + ((R & 1023) << 10) + (T & 1023), j++, y[V++] = R >> 18 | 240, y[V++] = R >> 12 & 63 | 128, y[V++] = R >> 6 & 63 | 128, y[V++] = R & 63 | 128) : (y[V++] = R >> 12 | 224, y[V++] = R >> 6 & 63 | 128, y[V++] = R & 63 | 128);
+          m = V - a - S;
         } else
-          m = c(l, f + v, j);
-        m < 24 ? y[f++] = 96 | m : m < 256 ? (v < 2 && y.copyWithin(f + 2, f + 1, f + 1 + m), y[f++] = 120, y[f++] = m) : m < 65536 ? (v < 3 && y.copyWithin(f + 3, f + 2, f + 2 + m), y[f++] = 121, y[f++] = m >> 8, y[f++] = m & 255) : (v < 5 && y.copyWithin(f + 5, f + 3, f + 3 + m), y[f++] = 122, z.setUint32(f, m), f += 4), f += m;
+          m = c(l, a + S, k);
+        m < 24 ? y[a++] = 96 | m : m < 256 ? (S < 2 && y.copyWithin(a + 2, a + 1, a + 1 + m), y[a++] = 120, y[a++] = m) : m < 65536 ? (S < 3 && y.copyWithin(a + 3, a + 2, a + 2 + m), y[a++] = 121, y[a++] = m >> 8, y[a++] = m & 255) : (S < 5 && y.copyWithin(a + 5, a + 3, a + 3 + m), y[a++] = 122, H.setUint32(a, m), a += 4), a += m;
       } else if (_ === "number")
         if (!this.alwaysUseFloat && l >>> 0 === l)
-          l < 24 ? y[f++] = l : l < 256 ? (y[f++] = 24, y[f++] = l) : l < 65536 ? (y[f++] = 25, y[f++] = l >> 8, y[f++] = l & 255) : (y[f++] = 26, z.setUint32(f, l), f += 4);
+          l < 24 ? y[a++] = l : l < 256 ? (y[a++] = 24, y[a++] = l) : l < 65536 ? (y[a++] = 25, y[a++] = l >> 8, y[a++] = l & 255) : (y[a++] = 26, H.setUint32(a, l), a += 4);
         else if (!this.alwaysUseFloat && l >> 0 === l)
-          l >= -24 ? y[f++] = 31 - l : l >= -256 ? (y[f++] = 56, y[f++] = ~l) : l >= -65536 ? (y[f++] = 57, z.setUint16(f, ~l), f += 2) : (y[f++] = 58, z.setUint32(f, ~l), f += 4);
+          l >= -24 ? y[a++] = 31 - l : l >= -256 ? (y[a++] = 56, y[a++] = ~l) : l >= -65536 ? (y[a++] = 57, H.setUint16(a, ~l), a += 2) : (y[a++] = 58, H.setUint32(a, ~l), a += 4);
         else {
-          let C;
-          if ((C = this.useFloat32) > 0 && l < 4294967296 && l >= -2147483648) {
-            y[f++] = 250, z.setFloat32(f, l);
-            let v;
-            if (C < 4 || // this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
-            (v = l * mt[(y[f] & 127) << 1 | y[f + 1] >> 7]) >> 0 === v) {
-              f += 4;
+          let A;
+          if ((A = this.useFloat32) > 0 && l < 4294967296 && l >= -2147483648) {
+            y[a++] = 250, H.setFloat32(a, l);
+            let S;
+            if (A < 4 || // this checks for rounding of numbers that were encoded in 32-bit float to nearest significant decimal digit that could be preserved
+            (S = l * At[(y[a] & 127) << 1 | y[a + 1] >> 7]) >> 0 === S) {
+              a += 4;
               return;
             } else
-              f--;
+              a--;
           }
-          y[f++] = 251, z.setFloat64(f, l), f += 8;
+          y[a++] = 251, H.setFloat64(a, l), a += 8;
         }
       else if (_ === "object")
         if (!l)
-          y[f++] = 246;
+          y[a++] = 246;
         else {
           if (i) {
-            let v = i.get(l);
-            if (v) {
-              if (y[f++] = 216, y[f++] = 29, y[f++] = 25, !v.references) {
-                let j = i.idsToInsert || (i.idsToInsert = []);
-                v.references = [], j.push(v);
+            let S = i.get(l);
+            if (S) {
+              if (y[a++] = 216, y[a++] = 29, y[a++] = 25, !S.references) {
+                let k = i.idsToInsert || (i.idsToInsert = []);
+                S.references = [], k.push(S);
               }
-              v.references.push(f - r), f += 2;
+              S.references.push(a - r), a += 2;
               return;
             } else
-              i.set(l, { offset: f - r });
+              i.set(l, { offset: a - r });
           }
-          let C = l.constructor;
-          if (C === Object)
+          let A = l.constructor;
+          if (A === Object)
             B(l);
-          else if (C === Array) {
-            m = l.length, m < 24 ? y[f++] = 128 | m : fe(m);
-            for (let v = 0; v < m; v++)
-              S(l[v]);
-          } else if (C === Map)
-            if ((this.mapsAsObjects ? this.useTag259ForMaps !== !1 : this.useTag259ForMaps) && (y[f++] = 217, y[f++] = 1, y[f++] = 3), m = l.size, m < 24 ? y[f++] = 160 | m : m < 256 ? (y[f++] = 184, y[f++] = m) : m < 65536 ? (y[f++] = 185, y[f++] = m >> 8, y[f++] = m & 255) : (y[f++] = 186, z.setUint32(f, m), f += 4), a.keyMap)
-              for (let [v, j] of l)
-                S(a.encodeKey(v)), S(j);
+          else if (A === Array) {
+            m = l.length, m < 24 ? y[a++] = 128 | m : fe(m);
+            for (let S = 0; S < m; S++)
+              v(l[S]);
+          } else if (A === Map)
+            if ((this.mapsAsObjects ? this.useTag259ForMaps !== !1 : this.useTag259ForMaps) && (y[a++] = 217, y[a++] = 1, y[a++] = 3), m = l.size, m < 24 ? y[a++] = 160 | m : m < 256 ? (y[a++] = 184, y[a++] = m) : m < 65536 ? (y[a++] = 185, y[a++] = m >> 8, y[a++] = m & 255) : (y[a++] = 186, H.setUint32(a, m), a += 4), f.keyMap)
+              for (let [S, k] of l)
+                v(f.encodeKey(S)), v(k);
             else
-              for (let [v, j] of l)
-                S(v), S(j);
+              for (let [S, k] of l)
+                v(S), v(k);
           else {
-            for (let v = 0, j = lt.length; v < j; v++) {
-              let k = ar[v];
-              if (l instanceof k) {
-                let R = lt[v], T = R.tag;
-                T == null && (T = R.getTag && R.getTag.call(this, l)), T < 24 ? y[f++] = 192 | T : T < 256 ? (y[f++] = 216, y[f++] = T) : T < 65536 ? (y[f++] = 217, y[f++] = T >> 8, y[f++] = T & 255) : T > -1 && (y[f++] = 218, z.setUint32(f, T), f += 4), R.encode.call(this, l, S, M);
+            for (let S = 0, k = ht.length; S < k; S++) {
+              let j = lr[S];
+              if (l instanceof j) {
+                let R = ht[S], T = R.tag;
+                T == null && (T = R.getTag && R.getTag.call(this, l)), T < 24 ? y[a++] = 192 | T : T < 256 ? (y[a++] = 216, y[a++] = T) : T < 65536 ? (y[a++] = 217, y[a++] = T >> 8, y[a++] = T & 255) : T > -1 && (y[a++] = 218, H.setUint32(a, T), a += 4), R.encode.call(this, l, v, M);
                 return;
               }
             }
             if (l[Symbol.iterator]) {
-              if (Qe) {
-                let v = new Error("Iterable should be serialized as iterator");
-                throw v.iteratorNotHandled = !0, v;
+              if (tt) {
+                let S = new Error("Iterable should be serialized as iterator");
+                throw S.iteratorNotHandled = !0, S;
               }
-              y[f++] = 159;
-              for (let v of l)
-                S(v);
-              y[f++] = 255;
+              y[a++] = 159;
+              for (let S of l)
+                v(S);
+              y[a++] = 255;
               return;
             }
-            if (l[Symbol.asyncIterator] || et(l)) {
-              let v = new Error("Iterable/blob should be serialized as iterator");
-              throw v.iteratorNotHandled = !0, v;
+            if (l[Symbol.asyncIterator] || rt(l)) {
+              let S = new Error("Iterable/blob should be serialized as iterator");
+              throw S.iteratorNotHandled = !0, S;
             }
             if (this.useToJSON && l.toJSON) {
-              const v = l.toJSON();
-              if (v !== l)
-                return S(v);
+              const S = l.toJSON();
+              if (S !== l)
+                return v(S);
             }
             B(l);
           }
         }
       else if (_ === "boolean")
-        y[f++] = l ? 245 : 244;
+        y[a++] = l ? 245 : 244;
       else if (_ === "bigint") {
         if (l < BigInt(1) << BigInt(64) && l >= 0)
-          y[f++] = 27, z.setBigUint64(f, l);
+          y[a++] = 27, H.setBigUint64(a, l);
         else if (l > -(BigInt(1) << BigInt(64)) && l < 0)
-          y[f++] = 59, z.setBigUint64(f, -l - BigInt(1));
+          y[a++] = 59, H.setBigUint64(a, -l - BigInt(1));
         else if (this.largeBigIntToFloat)
-          y[f++] = 251, z.setFloat64(f, Number(l));
-        else
-          throw new RangeError(l + " was too large to fit in CBOR 64-bit integer format, set largeBigIntToFloat to convert to float-64");
-        f += 8;
+          y[a++] = 251, H.setFloat64(a, Number(l));
+        else {
+          l >= BigInt(0) ? y[a++] = 194 : (y[a++] = 195, l = BigInt(-1) - l);
+          let A = [];
+          for (; l; )
+            A.push(Number(l & BigInt(255))), l >>= BigInt(8);
+          dt(new Uint8Array(A.reverse()), M);
+          return;
+        }
+        a += 8;
       } else if (_ === "undefined")
-        y[f++] = 247;
+        y[a++] = 247;
       else
         throw new Error("Unknown type: " + _);
     }, B = this.useRecords === !1 ? this.variableMapSize ? (l) => {
-      let _ = Object.keys(l), m = Object.values(l), C = _.length;
-      if (C < 24 ? y[f++] = 160 | C : C < 256 ? (y[f++] = 184, y[f++] = C) : C < 65536 ? (y[f++] = 185, y[f++] = C >> 8, y[f++] = C & 255) : (y[f++] = 186, z.setUint32(f, C), f += 4), a.keyMap)
-        for (let v = 0; v < C; v++)
-          S(a.encodeKey(_[v])), S(m[v]);
+      let _ = Object.keys(l), m = Object.values(l), A = _.length;
+      if (A < 24 ? y[a++] = 160 | A : A < 256 ? (y[a++] = 184, y[a++] = A) : A < 65536 ? (y[a++] = 185, y[a++] = A >> 8, y[a++] = A & 255) : (y[a++] = 186, H.setUint32(a, A), a += 4), f.keyMap)
+        for (let S = 0; S < A; S++)
+          v(f.encodeKey(_[S])), v(m[S]);
       else
-        for (let v = 0; v < C; v++)
-          S(_[v]), S(m[v]);
+        for (let S = 0; S < A; S++)
+          v(_[S]), v(m[S]);
     } : (l) => {
-      y[f++] = 185;
-      let _ = f - r;
-      f += 2;
+      y[a++] = 185;
+      let _ = a - r;
+      a += 2;
       let m = 0;
-      if (a.keyMap)
-        for (let C in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(C)) && (S(a.encodeKey(C)), S(l[C]), m++);
+      if (f.keyMap)
+        for (let A in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(A)) && (v(f.encodeKey(A)), v(l[A]), m++);
       else
-        for (let C in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(C)) && (S(C), S(l[C]), m++);
+        for (let A in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(A)) && (v(A), v(l[A]), m++);
       y[_++ + r] = m >> 8, y[_ + r] = m & 255;
     } : (l, _) => {
-      let m, C = o.transitions || (o.transitions = /* @__PURE__ */ Object.create(null)), v = 0, j = 0, k, R;
+      let m, A = o.transitions || (o.transitions = /* @__PURE__ */ Object.create(null)), S = 0, k = 0, j, R;
       if (this.keyMap) {
-        R = Object.keys(l).map((V) => this.encodeKey(V)), j = R.length;
-        for (let V = 0; V < j; V++) {
-          let At = R[V];
-          m = C[At], m || (m = C[At] = /* @__PURE__ */ Object.create(null), v++), C = m;
+        R = Object.keys(l).map((V) => this.encodeKey(V)), k = R.length;
+        for (let V = 0; V < k; V++) {
+          let _t = R[V];
+          m = A[_t], m || (m = A[_t] = /* @__PURE__ */ Object.create(null), S++), A = m;
         }
       } else
-        for (let V in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && (m = C[V], m || (C[ee] & 1048576 && (k = C[ee] & 65535), m = C[V] = /* @__PURE__ */ Object.create(null), v++), C = m, j++);
-      let T = C[ee];
+        for (let V in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && (m = A[V], m || (A[ee] & 1048576 && (j = A[ee] & 65535), m = A[V] = /* @__PURE__ */ Object.create(null), S++), A = m, k++);
+      let T = A[ee];
       if (T !== void 0)
-        T &= 65535, y[f++] = 217, y[f++] = T >> 8 | 224, y[f++] = T & 255;
-      else if (R || (R = C.__keys__ || (C.__keys__ = Object.keys(l))), k === void 0 ? (T = o.nextId++, T || (T = 0, o.nextId = 1), T >= Mt && (o.nextId = (T = d) + 1)) : T = k, o[T] = R, T < d) {
-        y[f++] = 217, y[f++] = T >> 8 | 224, y[f++] = T & 255, C = o.transitions;
-        for (let V = 0; V < j; V++)
-          (C[ee] === void 0 || C[ee] & 1048576) && (C[ee] = T), C = C[R[V]];
-        C[ee] = T | 1048576, s = !0;
+        T &= 65535, y[a++] = 217, y[a++] = T >> 8 | 224, y[a++] = T & 255;
+      else if (R || (R = A.__keys__ || (A.__keys__ = Object.keys(l))), j === void 0 ? (T = o.nextId++, T || (T = 0, o.nextId = 1), T >= Tt && (o.nextId = (T = d) + 1)) : T = j, o[T] = R, T < d) {
+        y[a++] = 217, y[a++] = T >> 8 | 224, y[a++] = T & 255, A = o.transitions;
+        for (let V = 0; V < k; V++)
+          (A[ee] === void 0 || A[ee] & 1048576) && (A[ee] = T), A = A[R[V]];
+        A[ee] = T | 1048576, s = !0;
       } else {
-        if (C[ee] = T, z.setUint32(f, 3655335680), f += 3, v && (I += U * v), A.length >= Mt - d && (A.shift()[ee] = void 0), A.push(C), fe(j + 2), S(57344 + T), S(R), _) return;
+        if (A[ee] = T, H.setUint32(a, 3655335680), a += 3, S && (I += U * S), C.length >= Tt - d && (C.shift()[ee] = void 0), C.push(A), fe(k + 2), v(57344 + T), v(R), _) return;
         for (let V in l)
-          (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && S(l[V]);
+          (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && v(l[V]);
         return;
       }
-      if (j < 24 ? y[f++] = 128 | j : fe(j), !_)
+      if (k < 24 ? y[a++] = 128 | k : fe(k), !_)
         for (let V in l)
-          (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && S(l[V]);
+          (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && v(l[V]);
     }, M = (l) => {
       let _;
       if (l > 16777216) {
-        if (l - r > Rt)
+        if (l - r > Dt)
           throw new Error("Encoded buffer would be larger than maximum buffer size");
         _ = Math.min(
-          Rt,
+          Dt,
           Math.round(Math.max((l - r) * (l > 67108864 ? 1.25 : 2), 4194304) / 4096) * 4096
         );
       } else
         _ = (Math.max(l - r << 2, y.length - 1) >> 12) + 1 << 12;
-      let m = new Ye(_);
-      return z = new DataView(m.buffer, 0, _), y.copy ? y.copy(m, 0, r, l) : m.set(y.slice(r, l)), f -= r, r = 0, ue = m.length - 10, y = m;
+      let m = new et(_);
+      return H = new DataView(m.buffer, 0, _), y.copy ? y.copy(m, 0, r, l) : m.set(y.slice(r, l)), a -= r, r = 0, he = m.length - 10, y = m;
     };
     let F = 100, N = 1e3;
     this.encodeAsIterable = function(l, _) {
-      return ie(l, _, L);
+      return ie(l, _, P);
     }, this.encodeAsAsyncIterable = function(l, _) {
       return ie(l, _, E);
     };
-    function* L(l, _, m) {
-      let C = l.constructor;
-      if (C === Object) {
-        let v = a.useRecords !== !1;
-        v ? B(l, !0) : Bt(Object.keys(l).length, 160);
-        for (let j in l) {
-          let k = l[j];
-          v || S(j), k && typeof k == "object" ? _[j] ? yield* L(k, _[j]) : yield* $(k, _, j) : S(k);
+    function* P(l, _, m) {
+      let A = l.constructor;
+      if (A === Object) {
+        let S = f.useRecords !== !1;
+        S ? B(l, !0) : Pt(Object.keys(l).length, 160);
+        for (let k in l) {
+          let j = l[k];
+          S || v(k), j && typeof j == "object" ? _[k] ? yield* P(j, _[k]) : yield* z(j, _, k) : v(j);
         }
-      } else if (C === Array) {
-        let v = l.length;
-        fe(v);
-        for (let j = 0; j < v; j++) {
-          let k = l[j];
-          k && (typeof k == "object" || f - r > F) ? _.element ? yield* L(k, _.element) : yield* $(k, _, "element") : S(k);
+      } else if (A === Array) {
+        let S = l.length;
+        fe(S);
+        for (let k = 0; k < S; k++) {
+          let j = l[k];
+          j && (typeof j == "object" || a - r > F) ? _.element ? yield* P(j, _.element) : yield* z(j, _, "element") : v(j);
         }
-      } else if (l[Symbol.iterator]) {
-        y[f++] = 159;
-        for (let v of l)
-          v && (typeof v == "object" || f - r > F) ? _.element ? yield* L(v, _.element) : yield* $(v, _, "element") : S(v);
-        y[f++] = 255;
-      } else et(l) ? (Bt(l.size, 64), yield y.subarray(r, f), yield l, H()) : l[Symbol.asyncIterator] ? (y[f++] = 159, yield y.subarray(r, f), yield l, H(), y[f++] = 255) : S(l);
-      m && f > r ? yield y.subarray(r, f) : f - r > F && (yield y.subarray(r, f), H());
+      } else if (l[Symbol.iterator] && !l.buffer) {
+        y[a++] = 159;
+        for (let S of l)
+          S && (typeof S == "object" || a - r > F) ? _.element ? yield* P(S, _.element) : yield* z(S, _, "element") : v(S);
+        y[a++] = 255;
+      } else rt(l) ? (Pt(l.size, 64), yield y.subarray(r, a), yield l, $()) : l[Symbol.asyncIterator] ? (y[a++] = 159, yield y.subarray(r, a), yield l, $(), y[a++] = 255) : v(l);
+      m && a > r ? yield y.subarray(r, a) : a - r > F && (yield y.subarray(r, a), $());
     }
-    function* $(l, _, m) {
-      let C = f - r;
+    function* z(l, _, m) {
+      let A = a - r;
       try {
-        S(l), f - r > F && (yield y.subarray(r, f), H());
-      } catch (v) {
-        if (v.iteratorNotHandled)
-          _[m] = {}, f = r + C, yield* L.call(this, l, _[m]);
-        else throw v;
+        v(l), a - r > F && (yield y.subarray(r, a), $());
+      } catch (S) {
+        if (S.iteratorNotHandled)
+          _[m] = {}, a = r + A, yield* P.call(this, l, _[m]);
+        else throw S;
       }
     }
-    function H() {
-      F = N, a.encode(null, tt);
+    function $() {
+      F = N, f.encode(null, nt);
     }
     function ie(l, _, m) {
-      return _ && _.chunkThreshold ? F = N = _.chunkThreshold : F = 100, l && typeof l == "object" ? (a.encode(null, tt), m(l, a.iterateProperties || (a.iterateProperties = {}), !0)) : [a.encode(l)];
+      return _ && _.chunkThreshold ? F = N = _.chunkThreshold : F = 100, l && typeof l == "object" ? (f.encode(null, nt), m(l, f.iterateProperties || (f.iterateProperties = {}), !0)) : [f.encode(l)];
     }
     async function* E(l, _) {
-      for (let m of L(l, _, !0)) {
-        let C = m.constructor;
-        if (C === kt || C === Uint8Array)
+      for (let m of P(l, _, !0)) {
+        let A = m.constructor;
+        if (A === Bt || A === Uint8Array)
           yield m;
-        else if (et(m)) {
-          let v = m.stream().getReader(), j;
-          for (; !(j = await v.read()).done; )
-            yield j.value;
+        else if (rt(m)) {
+          let S = m.stream().getReader(), k;
+          for (; !(k = await S.read()).done; )
+            yield k.value;
         } else if (m[Symbol.asyncIterator])
-          for await (let v of m)
-            H(), v ? yield* E(v, _.async || (_.async = {})) : yield a.encode(v);
+          for await (let S of m)
+            $(), S ? yield* E(S, _.async || (_.async = {})) : yield f.encode(S);
         else
           yield m;
       }
     }
   }
   useBuffer(t) {
-    y = t, z = new DataView(y.buffer, y.byteOffset, y.byteLength), f = 0;
+    y = t, H = new DataView(y.buffer, y.byteOffset, y.byteLength), a = 0;
   }
   clearSharedData() {
     this.structures && (this.structures = []), this.sharedValues && (this.sharedValues = void 0);
@@ -2805,33 +2842,33 @@ class mn extends Fe {
   updateSharedData() {
     let t = this.sharedVersion || 0;
     this.sharedVersion = t + 1;
-    let r = this.structures.slice(0), n = new cr(r, this.sharedValues, this.sharedVersion), s = this.saveShared(
+    let r = this.structures.slice(0), n = new ur(r, this.sharedValues, this.sharedVersion), s = this.saveShared(
       n,
       (o) => (o && o.version || 0) == t
     );
     return s === !1 ? (n = this.getShared() || {}, this.structures = n.structures || [], this.sharedValues = n.packedValues, this.sharedVersion = n.version, this.structures.nextId = this.structures.length) : r.forEach((o, i) => this.structures[i] = o), s;
   }
 }
-function Bt(e, t) {
-  e < 24 ? y[f++] = t | e : e < 256 ? (y[f++] = t | 24, y[f++] = e) : e < 65536 ? (y[f++] = t | 25, y[f++] = e >> 8, y[f++] = e & 255) : (y[f++] = t | 26, z.setUint32(f, e), f += 4);
+function Pt(e, t) {
+  e < 24 ? y[a++] = t | e : e < 256 ? (y[a++] = t | 24, y[a++] = e) : e < 65536 ? (y[a++] = t | 25, y[a++] = e >> 8, y[a++] = e & 255) : (y[a++] = t | 26, H.setUint32(a, e), a += 4);
 }
-class cr {
+class ur {
   constructor(t, r, n) {
     this.structures = t, this.packedValues = r, this.version = n;
   }
 }
 function fe(e) {
-  e < 24 ? y[f++] = 128 | e : e < 256 ? (y[f++] = 152, y[f++] = e) : e < 65536 ? (y[f++] = 153, y[f++] = e >> 8, y[f++] = e & 255) : (y[f++] = 154, z.setUint32(f, e), f += 4);
+  e < 24 ? y[a++] = 128 | e : e < 256 ? (y[a++] = 152, y[a++] = e) : e < 65536 ? (y[a++] = 153, y[a++] = e >> 8, y[a++] = e & 255) : (y[a++] = 154, H.setUint32(a, e), a += 4);
 }
-const vn = typeof Blob > "u" ? function() {
+const An = typeof Blob > "u" ? function() {
 } : Blob;
-function et(e) {
-  if (e instanceof vn)
+function rt(e) {
+  if (e instanceof An)
     return !0;
   let t = e[Symbol.toStringTag];
   return t === "Blob" || t === "File";
 }
-function Be(e, t) {
+function De(e, t) {
   switch (typeof e) {
     case "string":
       if (e.length > 3) {
@@ -2854,24 +2891,24 @@ function Be(e, t) {
       if (e)
         if (e instanceof Array)
           for (let n = 0, s = e.length; n < s; n++)
-            Be(e[n], t);
+            De(e[n], t);
         else {
           let n = !t.encoder.useRecords;
           for (var r in e)
-            e.hasOwnProperty(r) && (n && Be(r, t), Be(e[r], t));
+            e.hasOwnProperty(r) && (n && De(r, t), De(e[r], t));
         }
       break;
     case "function":
       console.log(e);
   }
 }
-const Sn = new Uint8Array(new Uint16Array([1]).buffer)[0] == 1;
-ar = [
+const Cn = new Uint8Array(new Uint16Array([1]).buffer)[0] == 1;
+lr = [
   Date,
   Set,
   Error,
   RegExp,
-  ge,
+  xe,
   ArrayBuffer,
   Uint8Array,
   Uint8ClampedArray,
@@ -2886,15 +2923,15 @@ ar = [
   } : BigInt64Array,
   Float32Array,
   Float64Array,
-  cr
+  ur
 ];
-lt = [
+ht = [
   {
     // Date
     tag: 1,
     encode(e, t) {
       let r = e.getTime() / 1e3;
-      (this.useTimestamp32 || e.getMilliseconds() === 0) && r >= 0 && r < 4294967296 ? (y[f++] = 26, z.setUint32(f, r), f += 4) : (y[f++] = 251, z.setFloat64(f, r), f += 8);
+      (this.useTimestamp32 || e.getMilliseconds() === 0) && r >= 0 && r < 4294967296 ? (y[a++] = 26, H.setUint32(a, r), a += 4) : (y[a++] = 251, H.setFloat64(a, r), a += 8);
     }
   },
   {
@@ -2934,17 +2971,17 @@ lt = [
   {
     // ArrayBuffer
     encode(e, t, r) {
-      Tt(e, r);
+      dt(e, r);
     }
   },
   {
     // Uint8Array
     getTag(e) {
-      if (e.constructor === Uint8Array && (this.tagUint8Array || je && this.tagUint8Array !== !1))
+      if (e.constructor === Uint8Array && (this.tagUint8Array || Me && this.tagUint8Array !== !1))
         return 64;
     },
     encode(e, t, r) {
-      Tt(e, r);
+      dt(e, r);
     }
   },
   oe(68, 1),
@@ -2961,35 +2998,35 @@ lt = [
     encode(e, t) {
       let r = e.packedValues || [], n = e.structures || [];
       if (r.values.length > 0) {
-        y[f++] = 216, y[f++] = 51, fe(4);
+        y[a++] = 216, y[a++] = 51, fe(4);
         let s = r.values;
         t(s), fe(0), fe(0), packedObjectMap = Object.create(sharedPackedObjectMap || null);
         for (let o = 0, i = s.length; o < i; o++)
           packedObjectMap[s[o]] = o;
       }
       if (n) {
-        z.setUint32(f, 3655335424), f += 3;
+        H.setUint32(a, 3655335424), a += 3;
         let s = n.slice(0);
-        s.unshift(57344), s.push(new ge(e.version, 1399353956)), t(s);
+        s.unshift(57344), s.push(new xe(e.version, 1399353956)), t(s);
       } else
-        t(new ge(e.version, 1399353956));
+        t(new xe(e.version, 1399353956));
     }
   }
 ];
 function oe(e, t) {
-  return !Sn && t > 1 && (e -= 4), {
+  return !Cn && t > 1 && (e -= 4), {
     tag: e,
     encode: function(n, s) {
       let o = n.byteLength, i = n.byteOffset || 0, c = n.buffer || n;
-      s(je ? We.from(c, i, o) : new Uint8Array(c, i, o));
+      s(Me ? Ge.from(c, i, o) : new Uint8Array(c, i, o));
     }
   };
 }
-function Tt(e, t) {
+function dt(e, t) {
   let r = e.byteLength;
-  r < 24 ? y[f++] = 64 + r : r < 256 ? (y[f++] = 88, y[f++] = r) : r < 65536 ? (y[f++] = 89, y[f++] = r >> 8, y[f++] = r & 255) : (y[f++] = 90, z.setUint32(f, r), f += 4), f + r >= y.length && t(f + r), y.set(e.buffer ? e : new Uint8Array(e), f), f += r;
+  r < 24 ? y[a++] = 64 + r : r < 256 ? (y[a++] = 88, y[a++] = r) : r < 65536 ? (y[a++] = 89, y[a++] = r >> 8, y[a++] = r & 255) : (y[a++] = 90, H.setUint32(a, r), a += 4), a + r >= y.length && t(a + r), y.set(e.buffer ? e : new Uint8Array(e), a), a += r;
 }
-function An(e, t) {
+function En(e, t) {
   let r, n = t.length * 2, s = e.length - n;
   t.sort((o, i) => o.offset > i.offset ? 1 : -1);
   for (let o = 0; o < t.length; o++) {
@@ -3006,17 +3043,17 @@ function An(e, t) {
   }
   return e;
 }
-function Dt(e, t) {
-  z.setUint32(J.position + e, f - J.position - e + 1);
+function Lt(e, t) {
+  H.setUint32(J.position + e, a - J.position - e + 1);
   let r = J;
   J = null, t(r[0]), t(r[1]);
 }
-let St = new mn({ useRecords: !1 });
-St.encode;
-St.encodeAsIterable;
-St.encodeAsAsyncIterable;
-const Lt = 512, Cn = 1024, tt = 2048;
-var En = { exports: {} };
+let Et = new vn({ useRecords: !1 });
+Et.encode;
+Et.encodeAsIterable;
+Et.encodeAsAsyncIterable;
+const Vt = 512, _n = 1024, nt = 2048;
+var On = { exports: {} };
 (function(e) {
   (function(t, r) {
     var n = {};
@@ -3025,7 +3062,7 @@ var En = { exports: {} };
     for (var o in n)
       s[o] = n[o];
     e.exports = s;
-  })(jr, function(t) {
+  })(Mr, function(t) {
     t.__esModule = !0, t.digestLength = 32, t.blockSize = 64;
     var r = new Uint32Array([
       1116352408,
@@ -3093,15 +3130,15 @@ var En = { exports: {} };
       3204031479,
       3329325298
     ]);
-    function n(g, u, b, x, A) {
-      for (var I, U, S, B, M, F, N, L, $, H, ie, E, l; A >= 64; ) {
-        for (I = u[0], U = u[1], S = u[2], B = u[3], M = u[4], F = u[5], N = u[6], L = u[7], H = 0; H < 16; H++)
-          ie = x + H * 4, g[H] = (b[ie] & 255) << 24 | (b[ie + 1] & 255) << 16 | (b[ie + 2] & 255) << 8 | b[ie + 3] & 255;
-        for (H = 16; H < 64; H++)
-          $ = g[H - 2], E = ($ >>> 17 | $ << 15) ^ ($ >>> 19 | $ << 13) ^ $ >>> 10, $ = g[H - 15], l = ($ >>> 7 | $ << 25) ^ ($ >>> 18 | $ << 14) ^ $ >>> 3, g[H] = (E + g[H - 7] | 0) + (l + g[H - 16] | 0);
-        for (H = 0; H < 64; H++)
-          E = (((M >>> 6 | M << 26) ^ (M >>> 11 | M << 21) ^ (M >>> 25 | M << 7)) + (M & F ^ ~M & N) | 0) + (L + (r[H] + g[H] | 0) | 0) | 0, l = ((I >>> 2 | I << 30) ^ (I >>> 13 | I << 19) ^ (I >>> 22 | I << 10)) + (I & U ^ I & S ^ U & S) | 0, L = N, N = F, F = M, M = B + E | 0, B = S, S = U, U = I, I = E + l | 0;
-        u[0] += I, u[1] += U, u[2] += S, u[3] += B, u[4] += M, u[5] += F, u[6] += N, u[7] += L, x += 64, A -= 64;
+    function n(g, u, b, x, C) {
+      for (var I, U, v, B, M, F, N, P, z, $, ie, E, l; C >= 64; ) {
+        for (I = u[0], U = u[1], v = u[2], B = u[3], M = u[4], F = u[5], N = u[6], P = u[7], $ = 0; $ < 16; $++)
+          ie = x + $ * 4, g[$] = (b[ie] & 255) << 24 | (b[ie + 1] & 255) << 16 | (b[ie + 2] & 255) << 8 | b[ie + 3] & 255;
+        for ($ = 16; $ < 64; $++)
+          z = g[$ - 2], E = (z >>> 17 | z << 15) ^ (z >>> 19 | z << 13) ^ z >>> 10, z = g[$ - 15], l = (z >>> 7 | z << 25) ^ (z >>> 18 | z << 14) ^ z >>> 3, g[$] = (E + g[$ - 7] | 0) + (l + g[$ - 16] | 0);
+        for ($ = 0; $ < 64; $++)
+          E = (((M >>> 6 | M << 26) ^ (M >>> 11 | M << 21) ^ (M >>> 25 | M << 7)) + (M & F ^ ~M & N) | 0) + (P + (r[$] + g[$] | 0) | 0) | 0, l = ((I >>> 2 | I << 30) ^ (I >>> 13 | I << 19) ^ (I >>> 22 | I << 10)) + (I & U ^ I & v ^ U & v) | 0, P = N, N = F, F = M, M = B + E | 0, B = v, v = U, U = I, I = E + l | 0;
+        u[0] += I, u[1] += U, u[2] += v, u[3] += B, u[4] += M, u[5] += F, u[6] += N, u[7] += P, x += 64, C -= 64;
       }
       return x;
     }
@@ -3133,14 +3170,14 @@ var En = { exports: {} };
           return this;
         }, g.prototype.finish = function(u) {
           if (!this.finished) {
-            var b = this.bytesHashed, x = this.bufferLength, A = b / 536870912 | 0, I = b << 3, U = b % 64 < 56 ? 64 : 128;
+            var b = this.bytesHashed, x = this.bufferLength, C = b / 536870912 | 0, I = b << 3, U = b % 64 < 56 ? 64 : 128;
             this.buffer[x] = 128;
-            for (var S = x + 1; S < U - 8; S++)
-              this.buffer[S] = 0;
-            this.buffer[U - 8] = A >>> 24 & 255, this.buffer[U - 7] = A >>> 16 & 255, this.buffer[U - 6] = A >>> 8 & 255, this.buffer[U - 5] = A >>> 0 & 255, this.buffer[U - 4] = I >>> 24 & 255, this.buffer[U - 3] = I >>> 16 & 255, this.buffer[U - 2] = I >>> 8 & 255, this.buffer[U - 1] = I >>> 0 & 255, n(this.temp, this.state, this.buffer, 0, U), this.finished = !0;
+            for (var v = x + 1; v < U - 8; v++)
+              this.buffer[v] = 0;
+            this.buffer[U - 8] = C >>> 24 & 255, this.buffer[U - 7] = C >>> 16 & 255, this.buffer[U - 6] = C >>> 8 & 255, this.buffer[U - 5] = C >>> 0 & 255, this.buffer[U - 4] = I >>> 24 & 255, this.buffer[U - 3] = I >>> 16 & 255, this.buffer[U - 2] = I >>> 8 & 255, this.buffer[U - 1] = I >>> 0 & 255, n(this.temp, this.state, this.buffer, 0, U), this.finished = !0;
           }
-          for (var S = 0; S < 8; S++)
-            u[S * 4 + 0] = this.state[S] >>> 24 & 255, u[S * 4 + 1] = this.state[S] >>> 16 & 255, u[S * 4 + 2] = this.state[S] >>> 8 & 255, u[S * 4 + 3] = this.state[S] >>> 0 & 255;
+          for (var v = 0; v < 8; v++)
+            u[v * 4 + 0] = this.state[v] >>> 24 & 255, u[v * 4 + 1] = this.state[v] >>> 16 & 255, u[v * 4 + 2] = this.state[v] >>> 8 & 255, u[v * 4 + 3] = this.state[v] >>> 0 & 255;
           return this;
         }, g.prototype.digest = function() {
           var u = new Uint8Array(this.digestLength);
@@ -3203,73 +3240,73 @@ var En = { exports: {} };
       return b.clean(), x;
     }
     t.hmac = c;
-    function a(g, u, b, x) {
-      var A = x[0];
-      if (A === 0)
+    function f(g, u, b, x) {
+      var C = x[0];
+      if (C === 0)
         throw new Error("hkdf: cannot expand more");
-      u.reset(), A > 1 && u.update(g), b && u.update(b), u.update(x), u.finish(g), x[0]++;
+      u.reset(), C > 1 && u.update(g), b && u.update(b), u.update(x), u.finish(g), x[0]++;
     }
     var p = new Uint8Array(t.digestLength);
     function d(g, u, b, x) {
       u === void 0 && (u = p), x === void 0 && (x = 32);
-      for (var A = new Uint8Array([1]), I = c(u, g), U = new o(I), S = new Uint8Array(U.digestLength), B = S.length, M = new Uint8Array(x), F = 0; F < x; F++)
-        B === S.length && (a(S, U, b, A), B = 0), M[F] = S[B++];
-      return U.clean(), S.fill(0), A.fill(0), M;
+      for (var C = new Uint8Array([1]), I = c(u, g), U = new o(I), v = new Uint8Array(U.digestLength), B = v.length, M = new Uint8Array(x), F = 0; F < x; F++)
+        B === v.length && (f(v, U, b, C), B = 0), M[F] = v[B++];
+      return U.clean(), v.fill(0), C.fill(0), M;
     }
     t.hkdf = d;
     function h(g, u, b, x) {
-      for (var A = new o(g), I = A.digestLength, U = new Uint8Array(4), S = new Uint8Array(I), B = new Uint8Array(I), M = new Uint8Array(x), F = 0; F * I < x; F++) {
+      for (var C = new o(g), I = C.digestLength, U = new Uint8Array(4), v = new Uint8Array(I), B = new Uint8Array(I), M = new Uint8Array(x), F = 0; F * I < x; F++) {
         var N = F + 1;
-        U[0] = N >>> 24 & 255, U[1] = N >>> 16 & 255, U[2] = N >>> 8 & 255, U[3] = N >>> 0 & 255, A.reset(), A.update(u), A.update(U), A.finish(B);
-        for (var L = 0; L < I; L++)
-          S[L] = B[L];
-        for (var L = 2; L <= b; L++) {
-          A.reset(), A.update(B).finish(B);
-          for (var $ = 0; $ < I; $++)
-            S[$] ^= B[$];
+        U[0] = N >>> 24 & 255, U[1] = N >>> 16 & 255, U[2] = N >>> 8 & 255, U[3] = N >>> 0 & 255, C.reset(), C.update(u), C.update(U), C.finish(B);
+        for (var P = 0; P < I; P++)
+          v[P] = B[P];
+        for (var P = 2; P <= b; P++) {
+          C.reset(), C.update(B).finish(B);
+          for (var z = 0; z < I; z++)
+            v[z] ^= B[z];
         }
-        for (var L = 0; L < I && F * I + L < x; L++)
-          M[F * I + L] = S[L];
+        for (var P = 0; P < I && F * I + P < x; P++)
+          M[F * I + P] = v[P];
       }
       for (var F = 0; F < I; F++)
-        S[F] = B[F] = 0;
+        v[F] = B[F] = 0;
       for (var F = 0; F < 4; F++)
         U[F] = 0;
-      return A.clean(), M;
+      return C.clean(), M;
     }
     t.pbkdf2 = h;
   });
-})(En);
-Tr("automerge-repo:collectionsync");
-const jn = (e) => {
-  const [t, r] = Vt({}), n = dt(), s = yr(
+})(On);
+Pr("automerge-repo:collectionsync");
+const Mn = (e) => {
+  const [t, r] = $t({}), n = bt(), s = br(
     () => e?.map((i) => {
-      if (rn(i)) {
-        const { documentId: c } = tr(i);
+      if (sn(i)) {
+        const { documentId: c } = nr(i);
         return c;
       } else
         return i;
     }) ?? [],
     [e]
-  ), o = Pt([]);
-  return Ce(() => {
+  ), o = Nt([]);
+  return _e(() => {
     const i = {}, c = (u, b) => {
       b && r((x) => ({ ...x, [u]: b }));
-    }, a = (u) => {
+    }, f = (u) => {
       const b = u.documentId, x = {
-        change: ({ doc: A }) => c(b, A),
+        change: ({ doc: C }) => c(b, C),
         delete: () => p(b)
       };
       u.on("change", x.change), u.on("delete", x.delete), i[b] = x;
     }, p = (u) => {
       r((b) => {
-        const { [u]: x, ...A } = b;
-        return A;
+        const { [u]: x, ...C } = b;
+        return C;
       });
     }, d = (u) => {
       const b = n.find(u);
-      b.docSync() ? (c(u, b.docSync()), a(b)) : b.doc().then((x) => {
-        c(u, x), a(b);
+      b.docSync() ? (c(u, b.docSync()), f(b)) : b.doc().then((x) => {
+        c(u, x), f(b);
       }).catch((x) => {
         console.error(`Error loading document ${u} in useDocuments: `, x);
       });
@@ -3283,45 +3320,45 @@ const jn = (e) => {
       return h;
     for (const u of s) {
       const b = n.find(u);
-      o.current.includes(u) ? a(b) : d(u);
+      o.current.includes(u) ? f(b) : d(u);
     }
     return o.current.filter((u) => !s.includes(u)).forEach(p), o.current = s, h;
   }, [s, n]), t;
 };
-function kn(e) {
-  const t = dt();
+function Rn(e) {
+  const t = bt();
   return e ? t.find(e) : void 0;
 }
-var rt = lr, _n = function(e) {
+var st = hr, In = function(e) {
   return typeof e == "function";
-}, On = function(e) {
-  var t = rt.useState(e), r = t[0], n = t[1], s = rt.useRef(r), o = rt.useCallback(function(i) {
-    s.current = _n(i) ? i(s.current) : i, n(s.current);
+}, Un = function(e) {
+  var t = st.useState(e), r = t[0], n = t[1], s = st.useRef(r), o = st.useCallback(function(i) {
+    s.current = In(i) ? i(s.current) : i, n(s.current);
   }, []);
   return [r, o, s];
-}, In = On;
-const ut = /* @__PURE__ */ ze(In), ht = new Lr(), Mn = ({
+}, Fn = Un;
+const yt = /* @__PURE__ */ We(Fn), pt = new Vr(), Bn = ({
   handle: e,
   localUserId: t,
   offlineTimeout: r = 3e4,
   getTime: n = () => (/* @__PURE__ */ new Date()).getTime()
 }) => {
-  const [s, o, i] = ut({}), [c, a, p] = ut({});
-  return Ce(() => {
+  const [s, o, i] = yt({}), [c, f, p] = yt({});
+  return _e(() => {
     const d = (u) => {
       const [b, x] = u.message;
-      b !== t && (p.current[b] || ht.emit("new_peer", u), o({
+      b !== t && (p.current[b] || pt.emit("new_peer", u), o({
         ...i.current,
         [b]: x
-      }), a({
+      }), f({
         ...p.current,
         [b]: n()
       }));
     }, h = () => {
       const u = i.current, b = p.current, x = n();
-      for (const A in b)
-        x - b[A] > r && (delete u[A], delete b[A]);
-      o(u), a(b);
+      for (const C in b)
+        x - b[C] > r && (delete u[C], delete b[C]);
+      o(u), f(b);
     };
     e.on("ephemeral-message", d);
     const g = setInterval(
@@ -3332,43 +3369,43 @@ const ut = /* @__PURE__ */ ze(In), ht = new Lr(), Mn = ({
       e.removeListener("ephemeral-message", d), clearInterval(g);
     };
   }, [e, t, r, n]), [s, c];
-}, Rn = ({
+}, Tn = ({
   handle: e,
   userId: t,
   initialState: r,
   heartbeatTime: n = 15e3
 }) => {
-  const [s, o, i] = ut(r), c = (a) => {
-    const p = typeof a == "function" ? a(i.current) : a;
+  const [s, o, i] = yt(r), c = (f) => {
+    const p = typeof f == "function" ? f(i.current) : f;
     o(p), e.broadcast([t, p]);
   };
-  return Ce(() => {
+  return _e(() => {
     if (!t)
       return;
-    const a = () => void e.broadcast([t, i.current]);
-    a();
-    const p = setInterval(a, n);
+    const f = () => void e.broadcast([t, i.current]);
+    f();
+    const p = setInterval(f, n);
     return () => void clearInterval(p);
-  }, [e, t, n]), Ce(() => {
-    let a;
-    const p = ht.on("new_peer", () => {
-      a = setTimeout(
+  }, [e, t, n]), _e(() => {
+    let f;
+    const p = pt.on("new_peer", () => {
+      f = setTimeout(
         () => e.broadcast([t, i.current]),
         500
         // Wait for the peer to be ready
       );
     });
     return () => {
-      p.off("new_peer"), a && clearTimeout(a);
+      p.off("new_peer"), f && clearTimeout(f);
     };
-  }, [e, t, ht]), [s, c];
+  }, [e, t, pt]), [s, c];
 };
 export {
-  pr as RepoContext,
-  Fn as useDocument,
-  jn as useDocuments,
-  kn as useHandle,
-  Rn as useLocalAwareness,
-  Mn as useRemoteAwareness,
-  dt as useRepo
+  gr as RepoContext,
+  jn as useDocument,
+  Mn as useDocuments,
+  Rn as useHandle,
+  Tn as useLocalAwareness,
+  Bn as useRemoteAwareness,
+  bt as useRepo
 };