@automerge/automerge-repo-react-hooks 2.0.0-alpha.6 → 2.0.0-alpha.7

package/dist/index.js

@@ -8,19 +8,19 @@ function bt() {
 function jn(e) {
   const t = bt(), r = e ? t.find(e) : null, n = Nt(r);
   r !== n.current && (n.current = r);
-  const [, s] = $t(0), o = () => s((c) => c + 1);
+  const [, i] = $t(0), o = () => i((f) => f + 1);
   _e(() => !e || !r ? void 0 : (n.current = r, r.doc().then(() => {
     o();
-  }).catch((f) => console.error(f)), r.on("change", o), r.on("delete", o), () => {
+  }).catch((a) => console.error(a)), r.on("change", o), r.on("delete", o), () => {
     r.removeListener("change", o), r.removeListener("delete", o);
   }), [e, r]);
-  const i = pr(
-    (c, f) => {
-      r && r.change(c, f);
+  const s = pr(
+    (f, a) => {
+      r && r.change(f, a);
     },
     [r]
   );
-  return [r?.docSync(), i];
+  return [r?.docSync(), s];
 }
 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 {
@@ -215,8 +215,8 @@ class vr {
   }
 }
 class Ar extends vr {
-  constructor(t, r, n, s, o) {
-    super(t), this.context = r, this.path = n, this.objectId = s, this.key = o;
+  constructor(t, r, n, i, o) {
+    super(t), this.context = r, this.path = n, this.objectId = i, this.key = o;
   }
   /**
    * Increases the value of the counter by `delta`. If `delta` is not given,
@@ -233,8 +233,8 @@ class Ar extends vr {
     return this.increment(typeof t == "number" ? -t : -1);
   }
 }
-function Cr(e, t, r, n, s) {
-  return new Ar(e, t, r, n, s);
+function Cr(e, t, r, n, i) {
+  return new Ar(e, t, r, n, i);
 }
 class Er {
   constructor(t) {
@@ -258,47 +258,47 @@ function ae(e) {
   return e;
 }
 function re(e, t) {
-  const { context: r, objectId: n, path: s, textV2: o } = e, i = r.getWithType(n, t);
-  if (i === null)
+  const { context: r, objectId: n, path: i, textV2: o } = e, s = r.getWithType(n, t);
+  if (s === null)
     return;
-  const c = i[0], f = i[1];
-  switch (c) {
+  const f = s[0], a = s[1];
+  switch (f) {
     case void 0:
       return;
     case "map":
-      return He(r, f, o, [...s, t]);
+      return He(r, a, o, [...i, t]);
     case "list":
-      return Ke(r, f, o, [...s, t]);
+      return Ke(r, a, o, [...i, t]);
     case "text":
-      return o ? r.text(f) : Ue(r, f, [
-        ...s,
+      return o ? r.text(a) : Ue(r, a, [
+        ...i,
         t
       ]);
     case "str":
-      return f;
+      return a;
     case "uint":
-      return f;
+      return a;
     case "int":
-      return f;
+      return a;
     case "f64":
-      return f;
+      return a;
     case "boolean":
-      return f;
+      return a;
     case "null":
       return null;
     case "bytes":
-      return f;
+      return a;
     case "timestamp":
-      return f;
+      return a;
     case "counter":
-      return Cr(f, r, s, n, t);
+      return Cr(a, r, i, n, t);
     default:
-      throw RangeError(`datatype ${c} unimplemented`);
+      throw RangeError(`datatype ${f} unimplemented`);
   }
 }
 function Pe(e, t, r, n) {
-  const s = typeof e;
-  switch (s) {
+  const i = typeof e;
+  switch (i) {
     case "object":
       if (e == null)
         return [null, "null"];
@@ -338,9 +338,9 @@ function Pe(e, t, r, n) {
       ].join(""));
     default:
       throw new RangeError([
-        `Cannot assign ${s} value at ${Ot(r)}. `,
+        `Cannot assign ${i} value at ${Ot(r)}. `,
         "All JSON primitive datatypes (object, array, string, number, boolean, null) ",
-        `are supported in an Automerge document; ${s} values are not. `
+        `are supported in an Automerge document; ${i} values are not. `
       ].join(""));
   }
 }
@@ -350,43 +350,43 @@ function ze(e, t) {
 }
 const _r = {
   get(e, t) {
-    const { context: r, objectId: n, cache: s } = e;
-    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]);
+    const { context: r, objectId: n, cache: i } = e;
+    return t === Symbol.toStringTag ? e[Symbol.toStringTag] : t === Ie ? n : t === gt ? !0 : t === Oe ? e.trace : t === pe ? { handle: r, textV2: e.textV2 } : (i[t] || (i[t] = re(e, t)), i[t]);
   },
   set(e, t, r) {
-    const { context: n, objectId: s, path: o, textV2: i } = e;
+    const { context: n, objectId: i, path: o, textV2: s } = e;
     if (e.cache = {}, ze(r, n))
       throw new RangeError("Cannot create a reference to an existing document object");
     if (t === Oe)
       return e.trace = r, !0;
     if (t === zt)
       return !0;
-    const [c, f] = Pe(r, i, [...o, t], n);
-    switch (f) {
+    const [f, a] = Pe(r, s, [...o, t], n);
+    switch (a) {
       case "list": {
-        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];
+        const p = n.putObject(i, t, []), d = Ke(n, p, s, [...o, t]);
+        for (let h = 0; h < f.length; h++)
+          d[h] = f[h];
         break;
       }
       case "text": {
-        if (i)
-          Le(c), n.putObject(s, t, c);
+        if (s)
+          Le(f), n.putObject(i, t, f);
         else {
-          wt(c);
-          const p = n.putObject(s, t, "");
-          Ue(n, p, [...o, t]).splice(0, 0, ...c);
+          wt(f);
+          const p = n.putObject(i, t, "");
+          Ue(n, p, [...o, t]).splice(0, 0, ...f);
         }
         break;
       }
       case "map": {
-        const p = n.putObject(s, t, {}), d = He(n, p, i, [...o, t]);
-        for (const h in c)
-          d[h] = c[h];
+        const p = n.putObject(i, t, {}), d = He(n, p, s, [...o, t]);
+        for (const h in f)
+          d[h] = f[h];
         break;
       }
       default:
-        n.put(s, t, c, f);
+        n.put(i, t, f, a);
     }
     return !0;
   },
@@ -413,10 +413,10 @@ const _r = {
 }, 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 === 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];
+    return t = ae(t), t === Symbol.hasInstance ? (i) => Array.isArray(i) : 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;
+    const { context: n, objectId: i, path: o, textV2: s } = e;
     if (t = ae(t), ze(r, n))
       throw new RangeError("Cannot create a reference to an existing document object");
     if (t === zt)
@@ -425,40 +425,40 @@ const _r = {
       return e.trace = r, !0;
     if (typeof t == "string")
       throw new RangeError("list index must be a number");
-    const [c, f] = Pe(r, i, [...o, t], n);
-    switch (f) {
+    const [f, a] = Pe(r, s, [...o, t], n);
+    switch (a) {
       case "list": {
         let p;
-        t >= n.length(s) ? p = n.insertObject(s, t, []) : p = n.putObject(s, t, []), Ke(n, p, i, [...o, t]).splice(0, 0, ...c);
+        t >= n.length(i) ? p = n.insertObject(i, t, []) : p = n.putObject(i, t, []), Ke(n, p, s, [...o, t]).splice(0, 0, ...f);
         break;
       }
       case "text": {
-        if (i)
-          Le(c), t >= n.length(s) ? n.insertObject(s, t, c) : n.putObject(s, t, c);
+        if (s)
+          Le(f), t >= n.length(i) ? n.insertObject(i, t, f) : n.putObject(i, t, f);
         else {
           let p;
-          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);
+          wt(f), t >= n.length(i) ? p = n.insertObject(i, t, "") : p = n.putObject(i, t, ""), Ue(n, p, [...o, t]).splice(0, 0, ...f);
         }
         break;
       }
       case "map": {
         let p;
-        t >= n.length(s) ? p = n.insertObject(s, t, {}) : p = n.putObject(s, t, {});
-        const d = He(n, p, i, [...o, t]);
-        for (const h in c)
-          d[h] = c[h];
+        t >= n.length(i) ? p = n.insertObject(i, t, {}) : p = n.putObject(i, t, {});
+        const d = He(n, p, s, [...o, t]);
+        for (const h in f)
+          d[h] = f[h];
         break;
       }
       default:
-        t >= n.length(s) ? n.insert(s, t, c, f) : n.put(s, t, c, f);
+        t >= n.length(i) ? n.insert(i, t, f, a) : n.put(i, t, f, a);
     }
     return !0;
   },
   deleteProperty(e, t) {
     const { context: r, objectId: n } = e;
     t = ae(t);
-    const s = r.get(n, t);
-    if (s != null && s[0] == "counter")
+    const i = r.get(n, t);
+    if (i != null && i[0] == "counter")
       throw new TypeError("Unsupported operation: deleting a counter from a list");
     return r.delete(n, t), !0;
   },
@@ -480,31 +480,31 @@ const _r = {
 }, 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 === 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];
+    return t = ae(t), t === Symbol.hasInstance ? (i) => Array.isArray(i) : 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 be());
   }
 });
 function He(e, t, r, n) {
-  const s = {
+  const i = {
     context: e,
     objectId: t,
     path: n || [],
     cache: {},
     textV2: r
   }, o = {};
-  return Object.assign(o, s), new Proxy(o, _r);
+  return Object.assign(o, i), new Proxy(o, _r);
 }
 function Ke(e, t, r, n) {
-  const s = {
+  const i = {
     context: e,
     objectId: t,
     path: n || [],
     cache: {},
     textV2: r
   }, o = [];
-  return Object.assign(o, s), new Proxy(o, Kt);
+  return Object.assign(o, i), new Proxy(o, Kt);
 }
 function Ue(e, t, r) {
   const n = {
@@ -513,23 +513,23 @@ function Ue(e, t, r) {
     path: r || [],
     cache: {},
     textV2: !1
-  }, s = {};
-  return Object.assign(s, n), new Proxy(s, Or);
+  }, i = {};
+  return Object.assign(i, n), new Proxy(i, Or);
 }
 function xt(e) {
-  const { context: t, objectId: r, path: n, textV2: s } = e;
+  const { context: t, objectId: r, path: n, textV2: i } = e;
   return {
-    deleteAt(i, c) {
-      return typeof c == "number" ? t.splice(r, i, c) : t.delete(r, i), this;
+    deleteAt(s, f) {
+      return typeof f == "number" ? t.splice(r, s, f) : t.delete(r, s), this;
     },
-    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++)
+    fill(s, f, a) {
+      const [p, d] = Pe(s, i, [...n, f], t), h = t.length(r);
+      f = ae(f || 0), a = ae(a || h);
+      for (let g = f; g < Math.min(a, h); g++)
         if (d === "list" || d === "map")
           t.putObject(r, g, p);
         else if (d === "text")
-          if (s)
+          if (i)
             Le(p), t.putObject(r, g, p);
           else {
             wt(p);
@@ -541,48 +541,48 @@ function xt(e) {
           t.put(r, g, p, d);
       return this;
     },
-    indexOf(i, c = 0) {
-      const f = t.length(r);
-      for (let p = c; p < f; p++) {
+    indexOf(s, f = 0) {
+      const a = t.length(r);
+      for (let p = f; p < a; p++) {
         const d = t.getWithType(r, p);
-        if (d && (d[1] === i[Ie] || d[1] === i))
+        if (d && (d[1] === s[Ie] || d[1] === s))
           return p;
       }
       return -1;
     },
-    insertAt(i, ...c) {
-      return this.splice(i, 0, ...c), this;
+    insertAt(s, ...f) {
+      return this.splice(s, 0, ...f), this;
     },
     pop() {
-      const i = t.length(r);
-      if (i == 0)
+      const s = t.length(r);
+      if (s == 0)
         return;
-      const c = re(e, i - 1);
-      return t.delete(r, i - 1), c;
+      const f = re(e, s - 1);
+      return t.delete(r, s - 1), f;
     },
-    push(...i) {
-      const c = t.length(r);
-      return this.splice(c, 0, ...i), t.length(r);
+    push(...s) {
+      const f = t.length(r);
+      return this.splice(f, 0, ...s), t.length(r);
     },
     shift() {
       if (t.length(r) == 0)
         return;
-      const i = re(e, 0);
-      return t.delete(r, 0), i;
+      const s = re(e, 0);
+      return t.delete(r, 0), s;
     },
-    splice(i, c, ...f) {
-      i = ae(i), typeof c != "number" && (c = t.length(r) - i), c = ae(c);
-      for (const h of f)
+    splice(s, f, ...a) {
+      s = ae(s), typeof f != "number" && (f = t.length(r) - s), f = ae(f);
+      for (const h of a)
         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);
+      for (let h = 0; h < f; h++) {
+        const g = re(e, s);
+        g !== void 0 && p.push(g), t.delete(r, s);
       }
-      const d = f.map((h, g) => {
+      const d = a.map((h, g) => {
         try {
-          return Pe(h, s, [...n], t);
+          return Pe(h, i, [...n], t);
         } catch (u) {
           throw u instanceof RangeError ? new RangeError(`${u.message} (at index ${g} in the input)`) : u;
         }
@@ -590,41 +590,41 @@ function xt(e) {
       for (const [h, g] of d) {
         switch (g) {
           case "list": {
-            const u = t.insertObject(r, i, []);
-            Ke(t, u, s, [...n, i]).splice(0, 0, ...h);
+            const u = t.insertObject(r, s, []);
+            Ke(t, u, i, [...n, s]).splice(0, 0, ...h);
             break;
           }
           case "text": {
-            if (s)
-              Le(h), t.insertObject(r, i, h);
+            if (i)
+              Le(h), t.insertObject(r, s, h);
             else {
-              const u = t.insertObject(r, i, "");
-              Ue(t, u, [...n, i]).splice(0, 0, ...h);
+              const u = t.insertObject(r, s, "");
+              Ue(t, u, [...n, s]).splice(0, 0, ...h);
             }
             break;
           }
           case "map": {
-            const u = t.insertObject(r, i, {}), b = He(t, u, s, [...n, i]);
+            const u = t.insertObject(r, s, {}), b = He(t, u, i, [...n, s]);
             for (const x in h)
               b[x] = h[x];
             break;
           }
           default:
-            t.insert(r, i, h, g);
+            t.insert(r, s, h, g);
         }
-        i += 1;
+        s += 1;
       }
       return p;
     },
-    unshift(...i) {
-      return this.splice(0, 0, ...i), t.length(r);
+    unshift(...s) {
+      return this.splice(0, 0, ...s), t.length(r);
     },
     entries() {
-      let i = 0;
+      let s = 0;
       return {
         next: () => {
-          const f = re(e, i);
-          return f === void 0 ? { value: void 0, done: !0 } : { value: [i++, f], done: !1 };
+          const a = re(e, s);
+          return a === void 0 ? { value: void 0, done: !0 } : { value: [s++, a], done: !1 };
         },
         [Symbol.iterator]() {
           return this;
@@ -632,21 +632,21 @@ function xt(e) {
       };
     },
     keys() {
-      let i = 0;
-      const c = t.length(r);
+      let s = 0;
+      const f = t.length(r);
       return {
-        next: () => i < c ? { value: i++, done: !1 } : { value: void 0, done: !0 },
+        next: () => s < f ? { value: s++, done: !1 } : { value: void 0, done: !0 },
         [Symbol.iterator]() {
           return this;
         }
       };
     },
     values() {
-      let i = 0;
+      let s = 0;
       return {
         next: () => {
-          const f = re(e, i++);
-          return f === void 0 ? { value: void 0, done: !0 } : { value: f, done: !1 };
+          const a = re(e, s++);
+          return a === void 0 ? { value: void 0, done: !0 } : { value: a, done: !1 };
         },
         [Symbol.iterator]() {
           return this;
@@ -654,15 +654,15 @@ function xt(e) {
       };
     },
     toArray() {
-      const i = [];
-      let c;
+      const s = [];
+      let f;
       do
-        c = re(e, i.length), c !== void 0 && i.push(c);
-      while (c !== void 0);
-      return i;
+        f = re(e, s.length), f !== void 0 && s.push(f);
+      while (f !== void 0);
+      return s;
     },
-    map(i) {
-      return this.toArray().map(i);
+    map(s) {
+      return this.toArray().map(s);
     },
     toString() {
       return this.toArray().toString();
@@ -670,100 +670,100 @@ function xt(e) {
     toLocaleString() {
       return this.toArray().toLocaleString();
     },
-    forEach(i) {
-      return this.toArray().forEach(i);
+    forEach(s) {
+      return this.toArray().forEach(s);
     },
     // todo: real concat function is different
-    concat(i) {
-      return this.toArray().concat(i);
+    concat(s) {
+      return this.toArray().concat(s);
     },
-    every(i) {
-      return this.toArray().every(i);
+    every(s) {
+      return this.toArray().every(s);
     },
-    filter(i) {
-      return this.toArray().filter(i);
+    filter(s) {
+      return this.toArray().filter(s);
     },
-    find(i) {
-      let c = 0;
-      for (const f of this) {
-        if (i(f, c))
-          return f;
-        c += 1;
+    find(s) {
+      let f = 0;
+      for (const a of this) {
+        if (s(a, f))
+          return a;
+        f += 1;
       }
     },
-    findIndex(i) {
-      let c = 0;
-      for (const f of this) {
-        if (i(f, c))
-          return c;
-        c += 1;
+    findIndex(s) {
+      let f = 0;
+      for (const a of this) {
+        if (s(a, f))
+          return f;
+        f += 1;
       }
       return -1;
     },
-    includes(i) {
-      return this.find((c) => c === i) !== void 0;
+    includes(s) {
+      return this.find((f) => f === s) !== void 0;
     },
-    join(i) {
-      return this.toArray().join(i);
+    join(s) {
+      return this.toArray().join(s);
     },
-    reduce(i, c) {
-      return this.toArray().reduce(i, c);
+    reduce(s, f) {
+      return this.toArray().reduce(s, f);
     },
-    reduceRight(i, c) {
-      return this.toArray().reduceRight(i, c);
+    reduceRight(s, f) {
+      return this.toArray().reduceRight(s, f);
     },
-    lastIndexOf(i, c = 1 / 0) {
-      return this.toArray().lastIndexOf(i, c);
+    lastIndexOf(s, f = 1 / 0) {
+      return this.toArray().lastIndexOf(s, f);
     },
-    slice(i, c) {
-      return this.toArray().slice(i, c);
+    slice(s, f) {
+      return this.toArray().slice(s, f);
     },
-    some(i) {
-      let c = 0;
-      for (const f of this) {
-        if (i(f, c))
+    some(s) {
+      let f = 0;
+      for (const a of this) {
+        if (s(a, f))
           return !0;
-        c += 1;
+        f += 1;
       }
       return !1;
     },
     [Symbol.iterator]: function* () {
-      let i = 0, c = re(e, i);
-      for (; c !== void 0; )
-        yield c, i += 1, c = re(e, i);
+      let s = 0, f = re(e, s);
+      for (; f !== void 0; )
+        yield f, s += 1, f = re(e, s);
     }
   };
 }
 function Ir(e) {
   const { context: t, objectId: r } = e;
   return {
-    set(s, o) {
-      return this[s] = o;
+    set(i, o) {
+      return this[i] = o;
     },
-    get(s) {
-      return this[s];
+    get(i) {
+      return this[i];
     },
     toString() {
       return t.text(r).replace(//g, "");
     },
     toSpans() {
-      const s = [];
+      const i = [];
       let o = "";
-      const i = t.length(r);
-      for (let c = 0; c < i; c++) {
-        const f = this[c];
-        typeof f == "string" ? o += f : (o.length > 0 && (s.push(o), o = ""), s.push(f));
+      const s = t.length(r);
+      for (let f = 0; f < s; f++) {
+        const a = this[f];
+        typeof a == "string" ? o += a : (o.length > 0 && (i.push(o), o = ""), i.push(a));
       }
-      return o.length > 0 && s.push(o), s;
+      return o.length > 0 && i.push(o), i;
     },
     toJSON() {
       return this.toString();
     },
-    indexOf(s, o = 0) {
-      return t.text(r).indexOf(s, o);
+    indexOf(i, o = 0) {
+      return t.text(r).indexOf(i, o);
     },
-    insertAt(s, ...o) {
-      o.every((i) => typeof i == "string") ? t.splice(r, s, 0, o.join("")) : xt(e).insertAt(s, ...o);
+    insertAt(i, ...o) {
+      o.every((s) => typeof s == "string") ? t.splice(r, i, 0, o.join("")) : xt(e).insertAt(i, ...o);
     }
   };
 }
@@ -822,19 +822,19 @@ 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;
+  var e = 1e3, t = e * 60, r = t * 60, n = r * 24, i = n * 7, o = n * 365.25;
   qe = function(d, h) {
     h = h || {};
     var g = typeof d;
     if (g === "string" && d.length > 0)
-      return i(d);
+      return s(d);
     if (g === "number" && isFinite(d))
-      return h.long ? f(d) : c(d);
+      return h.long ? a(d) : f(d);
     throw new Error(
       "val is not a non-empty string or a valid number. val=" + JSON.stringify(d)
     );
   };
-  function i(d) {
+  function s(d) {
     if (d = String(d), !(d.length > 100)) {
       var h = /^(-?(?:\d+)?\.?\d+) *(milliseconds?|msecs?|ms|seconds?|secs?|s|minutes?|mins?|m|hours?|hrs?|h|days?|d|weeks?|w|years?|yrs?|y)?$/i.exec(
         d
@@ -851,7 +851,7 @@ function Rr() {
           case "weeks":
           case "week":
           case "w":
-            return g * s;
+            return g * i;
           case "days":
           case "day":
           case "d":
@@ -886,11 +886,11 @@ function Rr() {
       }
     }
   }
-  function c(d) {
+  function f(d) {
     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 f(d) {
+  function a(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";
   }
@@ -901,7 +901,7 @@ function Rr() {
   return qe;
 }
 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.debug = r, r.default = r, r.coerce = a, r.disable = o, r.enable = i, r.enabled = s, r.humanize = Rr(), r.destroy = p, Object.keys(e).forEach((d) => {
     r[d] = e[d];
   }), r.names = [], r.skips = [], r.formatters = {};
   function t(d) {
@@ -944,7 +944,7 @@ function Br(e) {
     const g = r(this.namespace + (typeof h > "u" ? ":" : h) + d);
     return g.log = this.log, g;
   }
-  function s(d) {
+  function i(d) {
     r.save(d), r.namespaces = d, r.names = [], r.skips = [];
     let h;
     const g = (typeof d == "string" ? d : "").split(/[\s,]+/), u = g.length;
@@ -953,12 +953,12 @@ function Br(e) {
   }
   function o() {
     const d = [
-      ...r.names.map(c),
-      ...r.skips.map(c).map((h) => "-" + h)
+      ...r.names.map(f),
+      ...r.skips.map(f).map((h) => "-" + h)
     ].join(",");
     return r.enable(""), d;
   }
-  function i(d) {
+  function s(d) {
     if (d[d.length - 1] === "*")
       return !0;
     let h, g;
@@ -970,10 +970,10 @@ function Br(e) {
         return !0;
     return !1;
   }
-  function c(d) {
+  function f(d) {
     return d.toString().substring(2, d.toString().length - 2).replace(/\.\*\?$/, "*");
   }
-  function f(d) {
+  function a(d) {
     return d instanceof Error ? d.stack || d.message : d;
   }
   function p() {
@@ -983,10 +983,10 @@ function Br(e) {
 }
 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 f = !1;
+  t.formatArgs = n, t.save = i, t.load = o, t.useColors = r, t.storage = s(), t.destroy = /* @__PURE__ */ (() => {
+    let a = !1;
     return () => {
-      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`."));
+      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`."));
     };
   })(), t.colors = [
     "#0000CC",
@@ -1071,50 +1071,50 @@ var Tr = Br;
       return !0;
     if (typeof navigator < "u" && navigator.userAgent && navigator.userAgent.toLowerCase().match(/(edge|trident)\/(\d+)/))
       return !1;
-    let f;
+    let a;
     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 && (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 && (a = navigator.userAgent.toLowerCase().match(/firefox\/(\d+)/)) && parseInt(a[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(f) {
-    if (f[0] = (this.useColors ? "%c" : "") + this.namespace + (this.useColors ? " %c" : " ") + f[0] + (this.useColors ? "%c " : " ") + "+" + e.exports.humanize(this.diff), !this.useColors)
+  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)
       return;
     const p = "color: " + this.color;
-    f.splice(1, 0, p, "color: inherit");
+    a.splice(1, 0, p, "color: inherit");
     let d = 0, h = 0;
-    f[0].replace(/%[a-zA-Z%]/g, (g) => {
+    a[0].replace(/%[a-zA-Z%]/g, (g) => {
       g !== "%%" && (d++, g === "%c" && (h = d));
-    }), f.splice(h, 0, p);
+    }), a.splice(h, 0, p);
   }
   t.log = console.debug || console.log || (() => {
   });
-  function s(f) {
+  function i(a) {
     try {
-      f ? t.storage.setItem("debug", f) : t.storage.removeItem("debug");
+      a ? t.storage.setItem("debug", a) : t.storage.removeItem("debug");
     } catch {
     }
   }
   function o() {
-    let f;
+    let a;
     try {
-      f = t.storage.getItem("debug");
+      a = t.storage.getItem("debug");
     } catch {
     }
-    return !f && typeof process < "u" && "env" in process && (f = process.env.DEBUG), f;
+    return !a && typeof process < "u" && "env" in process && (a = process.env.DEBUG), a;
   }
-  function i() {
+  function s() {
     try {
       return localStorage;
     } catch {
     }
   }
   e.exports = Tr(t);
-  const { formatters: c } = e.exports;
-  c.j = function(f) {
+  const { formatters: f } = e.exports;
+  f.j = function(a) {
     try {
-      return JSON.stringify(f);
+      return JSON.stringify(a);
     } catch (p) {
       return "[UnexpectedJSONParseError]: " + p.message;
     }
@@ -1128,38 +1128,38 @@ var Xt = { exports: {} };
   function n() {
   }
   Object.create && (n.prototype = /* @__PURE__ */ Object.create(null), new n().__proto__ || (r = !1));
-  function s(f, p, d) {
-    this.fn = f, this.context = p, this.once = d || !1;
+  function i(a, p, d) {
+    this.fn = a, this.context = p, this.once = d || !1;
   }
-  function o(f, p, d, h, g) {
+  function o(a, p, d, h, g) {
     if (typeof d != "function")
       throw new TypeError("The listener must be a function");
-    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;
+    var u = new i(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;
   }
-  function i(f, p) {
-    --f._eventsCount === 0 ? f._events = new n() : delete f._events[p];
+  function s(a, p) {
+    --a._eventsCount === 0 ? a._events = new n() : delete a._events[p];
   }
-  function c() {
+  function f() {
     this._events = new n(), this._eventsCount = 0;
   }
-  c.prototype.eventNames = function() {
+  f.prototype.eventNames = function() {
     var p = [], d, h;
     if (this._eventsCount === 0) return p;
     for (h in d = this._events)
       t.call(d, h) && p.push(r ? h.slice(1) : h);
     return Object.getOwnPropertySymbols ? p.concat(Object.getOwnPropertySymbols(d)) : p;
-  }, c.prototype.listeners = function(p) {
+  }, f.prototype.listeners = function(p) {
     var d = r ? r + p : p, h = this._events[d];
     if (!h) return [];
     if (h.fn) return [h.fn];
     for (var g = 0, u = h.length, b = new Array(u); g < u; g++)
       b[g] = h[g].fn;
     return b;
-  }, c.prototype.listenerCount = function(p) {
+  }, f.prototype.listenerCount = function(p) {
     var d = r ? r + p : p, h = this._events[d];
     return h ? h.fn ? 1 : h.length : 0;
-  }, c.prototype.emit = function(p, d, h, g, u, b) {
+  }, f.prototype.emit = function(p, d, h, g, u, b) {
     var x = r ? r + p : p;
     if (!this._events[x]) return !1;
     var C = this._events[x], I = arguments.length, U, v;
@@ -1204,28 +1204,28 @@ var Xt = { exports: {} };
         }
     }
     return !0;
-  }, c.prototype.on = function(p, d, h) {
+  }, f.prototype.on = function(p, d, h) {
     return o(this, p, d, h, !1);
-  }, c.prototype.once = function(p, d, h) {
+  }, f.prototype.once = function(p, d, h) {
     return o(this, p, d, h, !0);
-  }, c.prototype.removeListener = function(p, d, h, g) {
+  }, f.prototype.removeListener = function(p, d, h, g) {
     var u = r ? r + p : p;
     if (!this._events[u]) return this;
     if (!d)
-      return i(this, u), this;
+      return s(this, u), this;
     var b = this._events[u];
     if (b.fn)
-      b.fn === d && (!g || b.once) && (!h || b.context === h) && i(this, u);
+      b.fn === d && (!g || b.once) && (!h || b.context === h) && s(this, u);
     else {
       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);
+      C.length ? this._events[u] = C.length === 1 ? C[0] : C : s(this, u);
     }
     return this;
-  }, c.prototype.removeAllListeners = function(p) {
+  }, f.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;
+    return p ? (d = r ? r + p : p, this._events[d] && s(this, d)) : (this._events = new n(), this._eventsCount = 0), this;
+  }, f.prototype.off = f.prototype.removeListener, f.prototype.addListener = f.prototype.on, f.prefixed = r, f.EventEmitter = f, e.exports = f;
 })(Xt);
 var Lr = Xt.exports;
 const Vr = /* @__PURE__ */ We(Lr);
@@ -1287,16 +1287,16 @@ Je.crypto = typeof globalThis == "object" && "crypto" in globalThis ? globalThis
     return E instanceof Uint8Array || E != null && typeof E == "object" && E.constructor.name === "Uint8Array";
   }
   e.isBytes = n;
-  const s = (E) => new Uint8Array(E.buffer, E.byteOffset, E.byteLength);
-  e.u8 = s;
+  const i = (E) => new Uint8Array(E.buffer, E.byteOffset, E.byteLength);
+  e.u8 = i;
   const o = (E) => new Uint32Array(E.buffer, E.byteOffset, Math.floor(E.byteLength / 4));
   e.u32 = o;
-  const i = (E) => new DataView(E.buffer, E.byteOffset, E.byteLength);
-  e.createView = i;
-  const c = (E, l) => E << 32 - l | E >>> l;
-  e.rotr = c;
-  const f = (E, l) => E << l | E >>> 32 - l >>> 0;
-  e.rotl = f, e.isLE = new Uint8Array(new Uint32Array([287454020]).buffer)[0] === 68;
+  const s = (E) => new DataView(E.buffer, E.byteOffset, E.byteLength);
+  e.createView = s;
+  const f = (E, l) => E << 32 - l | E >>> l;
+  e.rotr = f;
+  const a = (E, l) => E << l | E >>> 32 - l >>> 0;
+  e.rotl = a, 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) {
@@ -1418,50 +1418,50 @@ 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), f = n ? 4 : 0, p = n ? 0 : 4;
-  e.setUint32(t + f, i, n), e.setUint32(t + p, c, n);
+  const i = BigInt(32), o = BigInt(4294967295), s = Number(r >> i & o), f = Number(r & o), a = n ? 4 : 0, p = n ? 0 : 4;
+  e.setUint32(t + a, s, n), e.setUint32(t + p, f, n);
 }
 const zr = (e, t, r) => e & t ^ ~e & r;
 de.Chi = zr;
 const Hr = (e, t, r) => e & t ^ e & r ^ t & r;
 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, Ae.createView)(this.buffer);
+  constructor(t, r, n, i) {
+    super(), this.blockLen = t, this.outputLen = r, this.padOffset = n, this.isLE = i, 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, Ze.exists)(this);
-    const { view: r, buffer: n, blockLen: s } = this;
+    const { view: r, buffer: n, blockLen: i } = this;
     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 f = (0, Ae.createView)(t);
-        for (; s <= o - i; i += s)
-          this.process(f, i);
+    for (let s = 0; s < o; ) {
+      const f = Math.min(i - this.pos, o - s);
+      if (f === i) {
+        const a = (0, Ae.createView)(t);
+        for (; i <= o - s; s += i)
+          this.process(a, s);
         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);
+      n.set(t.subarray(s, s + f), this.pos), this.pos += f, s += f, this.pos === i && (this.process(r, 0), this.pos = 0);
     }
     return this.length += t.length, this.roundClean(), this;
   }
   digestInto(t) {
     (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++)
+    const { buffer: r, view: n, blockLen: i, isLE: o } = this;
+    let { pos: s } = this;
+    r[s++] = 128, this.buffer.subarray(s).fill(0), this.padOffset > i - s && (this.process(n, 0), s = 0);
+    for (let h = s; h < i; h++)
       r[h] = 0;
-    $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)
+    $r(n, i - 8, BigInt(this.length * 8), o), this.process(n, 0);
+    const f = (0, Ae.createView)(t), a = this.outputLen;
+    if (a % 4)
       throw new Error("_sha2: outputLen should be aligned to 32bit");
-    const p = f / 4, d = this.get();
+    const p = a / 4, d = this.get();
     if (p > d.length)
       throw new Error("_sha2: outputLen bigger than state");
     for (let h = 0; h < p; h++)
-      c.setUint32(4 * h, d[h], o);
+      f.setUint32(4 * h, d[h], o);
   }
   digest() {
     const { buffer: t, outputLen: r } = this;
@@ -1471,8 +1471,8 @@ class Kr extends Ae.Hash {
   }
   _cloneInto(t) {
     t || (t = new this.constructor()), t.set(...this.get());
-    const { blockLen: r, buffer: n, length: s, finished: o, destroyed: i, pos: c } = this;
-    return t.length = s, t.pos = c, t.finished = o, t.destroyed = i, s % r && t.buffer.set(n), t;
+    const { blockLen: r, buffer: n, length: i, finished: o, destroyed: s, pos: f } = this;
+    return t.length = i, t.pos = f, t.finished = o, t.destroyed = s, i % r && t.buffer.set(n), t;
   }
 }
 de.HashMD = Kr;
@@ -1558,12 +1558,12 @@ class tr extends Ye.HashMD {
     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: f } = this;
-    return [t, r, n, s, o, i, c, f];
+    const { A: t, B: r, C: n, D: i, E: o, F: s, G: f, H: a } = this;
+    return [t, r, n, i, o, s, f, a];
   }
   // prettier-ignore
-  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;
+  set(t, r, n, i, o, s, f, a) {
+    this.A = t | 0, this.B = r | 0, this.C = n | 0, this.D = i | 0, this.E = o | 0, this.F = s | 0, this.G = f | 0, this.H = a | 0;
   }
   process(t, r) {
     for (let h = 0; h < 16; h++, r += 4)
@@ -1572,12 +1572,12 @@ class tr extends Ye.HashMD {
       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: f, G: p, H: d } = this;
+    let { A: n, B: i, C: o, D: s, E: f, F: a, 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, 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;
+      const g = (0, te.rotr)(f, 6) ^ (0, te.rotr)(f, 11) ^ (0, te.rotr)(f, 25), u = d + g + (0, Ye.Chi)(f, a, 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, i, o) | 0;
+      d = p, p = a, a = f, f = s + u | 0, s = o, o = i, i = 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, 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);
+    n = n + this.A | 0, i = i + this.B | 0, o = o + this.C | 0, s = s + this.D | 0, f = f + this.E | 0, a = a + this.F | 0, p = p + this.G | 0, d = d + this.H | 0, this.set(n, i, o, s, f, a, p, d);
   }
   roundClean() {
     ue.fill(0);
@@ -1599,12 +1599,12 @@ function Gr(e) {
   for (var t = new Uint8Array(256), r = 0; r < t.length; r++)
     t[r] = 255;
   for (var n = 0; n < e.length; n++) {
-    var s = e.charAt(n), o = s.charCodeAt(0);
+    var i = e.charAt(n), o = i.charCodeAt(0);
     if (t[o] !== 255)
-      throw new TypeError(s + " is ambiguous");
+      throw new TypeError(i + " is ambiguous");
     t[o] = n;
   }
-  var i = e.length, c = e.charAt(0), f = Math.log(i) / Math.log(256), p = Math.log(256) / Math.log(i);
+  var s = e.length, f = e.charAt(0), a = Math.log(s) / Math.log(256), p = Math.log(256) / Math.log(s);
   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");
@@ -1614,14 +1614,14 @@ function Gr(e) {
       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;
+        B += 256 * v[F] >>> 0, v[F] = B % s >>> 0, B = B / s >>> 0;
       if (B !== 0)
         throw new Error("Non-zero carry");
       x = M, C++;
     }
     for (var N = U - x; N !== U && v[N] === 0; )
       N++;
-    for (var P = c.repeat(b); N < U; ++N)
+    for (var P = f.repeat(b); N < U; ++N)
       P += e.charAt(v[N]);
     return P;
   }
@@ -1630,14 +1630,14 @@ function Gr(e) {
       throw new TypeError("Expected String");
     if (u.length === 0)
       return new Uint8Array();
-    for (var b = 0, x = 0, C = 0; u[b] === c; )
+    for (var b = 0, x = 0, C = 0; u[b] === f; )
       x++, b++;
-    for (var I = (u.length - b) * f + 1 >>> 0, U = new Uint8Array(I); u[b]; ) {
+    for (var I = (u.length - b) * a + 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; (v !== 0 || B < C) && M !== -1; M--, B++)
-        v += i * U[M] >>> 0, U[M] = v % 256 >>> 0, v = v / 256 >>> 0;
+        v += s * U[M] >>> 0, U[M] = v % 256 >>> 0, v = v / 256 >>> 0;
       if (v !== 0)
         throw new Error("Non-zero carry");
       C = B, b++;
@@ -1652,7 +1652,7 @@ function Gr(e) {
     var b = h(u);
     if (b)
       return b;
-    throw new Error("Non-base" + i + " character");
+    throw new Error("Non-base" + s + " character");
   }
   return {
     encode: d,
@@ -1664,27 +1664,27 @@ 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), 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);
+    var s = Uint8Array.from(o), f = e(s), a = s.length + 4, p = new Uint8Array(a);
+    return p.set(s, 0), p.set(f.subarray(0, 4), s.length), Qe.encode(p, a);
   }
   function r(o) {
-    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;
+    var s = o.slice(0, -4), f = o.slice(-4), a = e(s);
+    if (!(f[0] ^ a[0] | f[1] ^ a[1] | f[2] ^ a[2] | f[3] ^ a[3]))
+      return s;
   }
   function n(o) {
-    var i = Qe.decodeUnsafe(o);
-    if (i)
-      return r(i);
+    var s = Qe.decodeUnsafe(o);
+    if (s)
+      return r(s);
   }
-  function s(o) {
-    var i = Qe.decode(o), c = r(i);
-    if (!c) throw new Error("Invalid checksum");
-    return c;
+  function i(o) {
+    var s = Qe.decode(o), f = r(s);
+    if (!f) throw new Error("Invalid checksum");
+    return f;
   }
   return {
     encode: t,
-    decode: s,
+    decode: i,
     decodeUnsafe: n
   };
 }, { sha256: Ut } = ve, en = Qr;
@@ -1693,12 +1693,12 @@ function tn(e) {
 }
 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)
+  const t = new RegExp(`^${rr}(\\w+)$`), [, r] = e.match(t) || [], n = r, i = sr(n);
+  if (!i)
     throw new Error("Invalid document URL: " + e);
   return {
     /** unencoded DocumentId */
-    binaryDocumentId: s,
+    binaryDocumentId: i,
     /** encoded DocumentId */
     documentId: n
   };
@@ -1761,24 +1761,24 @@ class je {
   encodeKeys(t) {
     if (!this._keyMap) return t;
     let r = /* @__PURE__ */ new Map();
-    for (let [n, s] of Object.entries(t)) r.set(this._keyMap.hasOwnProperty(n) ? this._keyMap[n] : n, s);
+    for (let [n, i] of Object.entries(t)) r.set(this._keyMap.hasOwnProperty(n) ? this._keyMap[n] : n, i);
     return r;
   }
   decodeKeys(t) {
     if (!this._keyMap || t.constructor.name != "Map") return t;
     if (!this._mapKey) {
       this._mapKey = /* @__PURE__ */ new Map();
-      for (let [n, s] of Object.entries(this._keyMap)) this._mapKey.set(s, n);
+      for (let [n, i] of Object.entries(this._keyMap)) this._mapKey.set(i, n);
     }
     let r = {};
-    return t.forEach((n, s) => r[se(this._mapKey.has(s) ? this._mapKey.get(s) : s)] = n), r;
+    return t.forEach((n, i) => r[se(this._mapKey.has(i) ? this._mapKey.get(i) : i)] = n), r;
   }
   mapDecode(t, r) {
     let n = this.decode(t);
     if (this._keyMap)
       switch (n.constructor.name) {
         case "Array":
-          return n.map((s) => this.decodeKeys(s));
+          return n.map((i) => this.decodeKeys(i));
       }
     return n;
   }
@@ -1800,24 +1800,24 @@ class je {
     return Re();
   }
   decodeMultiple(t, r) {
-    let n, s = 0;
+    let n, i = 0;
     try {
       let o = t.length;
       ke = !0;
-      let i = this ? this.decode(t, o) : Ct.decode(t, o);
+      let s = this ? this.decode(t, o) : Ct.decode(t, o);
       if (r) {
-        if (r(i) === !1)
+        if (r(s) === !1)
           return;
         for (; w < o; )
-          if (s = w, r(Re()) === !1)
+          if (i = w, r(Re()) === !1)
             return;
       } else {
-        for (n = [i]; w < o; )
-          s = w, n.push(Re());
+        for (n = [s]; w < o; )
+          i = w, n.push(Re());
         return n;
       }
     } catch (o) {
-      throw o.lastPosition = s, o.values = n, o;
+      throw o.lastPosition = i, o.values = n, o;
     } finally {
       ke = !1, ut();
     }
@@ -1886,46 +1886,46 @@ function L() {
           case 3:
             throw new Error("Indefinite length not supported for byte or text strings");
           case 4:
-            let r = [], n, s = 0;
+            let r = [], n, i = 0;
             for (; (n = L()) != we; ) {
-              if (s >= Ce) throw new Error(`Array length exceeds ${Ce}`);
-              r[s++] = n;
+              if (i >= Ce) throw new Error(`Array length exceeds ${Ce}`);
+              r[i++] = n;
             }
             return t == 4 ? r : t == 3 ? r.join("") : Buffer.concat(r);
           case 5:
             let o;
             if (D.mapsAsObjects) {
-              let i = {}, c = 0;
+              let s = {}, f = 0;
               if (D.keyMap)
                 for (; (o = L()) != we; ) {
-                  if (c++ >= ce) throw new Error(`Property count exceeds ${ce}`);
-                  i[se(D.decodeKey(o))] = L();
+                  if (f++ >= ce) throw new Error(`Property count exceeds ${ce}`);
+                  s[se(D.decodeKey(o))] = L();
                 }
               else
                 for (; (o = L()) != we; ) {
-                  if (c++ >= ce) throw new Error(`Property count exceeds ${ce}`);
-                  i[se(o)] = L();
+                  if (f++ >= ce) throw new Error(`Property count exceeds ${ce}`);
+                  s[se(o)] = L();
                 }
-              return i;
+              return s;
             } else {
               Ee && (D.mapsAsObjects = !0, Ee = !1);
-              let i = /* @__PURE__ */ new Map();
+              let s = /* @__PURE__ */ new Map();
               if (D.keyMap) {
-                let c = 0;
+                let f = 0;
                 for (; (o = L()) != we; ) {
-                  if (c++ >= ce)
+                  if (f++ >= ce)
                     throw new Error(`Map size exceeds ${ce}`);
-                  i.set(D.decodeKey(o), L());
+                  s.set(D.decodeKey(o), L());
                 }
               } else {
-                let c = 0;
+                let f = 0;
                 for (; (o = L()) != we; ) {
-                  if (c++ >= ce)
+                  if (f++ >= ce)
                     throw new Error(`Map size exceeds ${ce}`);
-                  i.set(o, L());
+                  s.set(o, L());
                 }
               }
-              return i;
+              return s;
             }
           case 7:
             return we;
@@ -1946,71 +1946,71 @@ function L() {
       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;
+        let i = e < 16 ? or(e) : un(e);
+        if (i != null)
+          return i;
       }
       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] = L();
+      for (let i = 0; i < e; i++) r[i] = 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(L()))] = L();
-        else for (let o = 0; o < e; o++) s[se(L())] = L();
-        return s;
+        let i = {};
+        if (D.keyMap) for (let o = 0; o < e; o++) i[se(D.decodeKey(L()))] = L();
+        else for (let o = 0; o < e; o++) i[se(L())] = L();
+        return i;
       } else {
         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(L()), L());
-        else for (let o = 0; o < e; o++) s.set(L(), L());
-        return s;
+        let i = /* @__PURE__ */ new Map();
+        if (D.keyMap) for (let o = 0; o < e; o++) i.set(D.decodeKey(L()), L());
+        else for (let o = 0; o < e; o++) i.set(L(), L());
+        return i;
       }
     case 6:
       if (e >= Ft) {
-        let s = K[e & 8191];
-        if (s)
-          return s.read || (s.read = at(s)), s.read();
+        let i = K[e & 8191];
+        if (i)
+          return i.read || (i.read = at(i)), i.read();
         if (e < 65536) {
           if (e == cn) {
-            let o = Se(), i = L(), c = L();
-            lt(i, c);
-            let f = {};
+            let o = Se(), s = L(), f = L();
+            lt(s, f);
+            let a = {};
             if (D.keyMap) for (let p = 2; p < o; p++) {
-              let d = D.decodeKey(c[p - 2]);
-              f[se(d)] = L();
+              let d = D.decodeKey(f[p - 2]);
+              a[se(d)] = L();
             }
             else for (let p = 2; p < o; p++) {
-              let d = c[p - 2];
-              f[se(d)] = L();
+              let d = f[p - 2];
+              a[se(d)] = L();
             }
-            return f;
+            return a;
           } else if (e == an) {
-            let o = Se(), i = L();
-            for (let c = 2; c < o; c++)
-              lt(i++, L());
+            let o = Se(), s = L();
+            for (let f = 2; f < o; f++)
+              lt(s++, 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();
+          if (D.getShared && (vt(), i = K[e & 8191], i))
+            return i.read || (i.read = at(i)), i.read();
         }
       }
       let n = W[e];
       if (n)
         return n.handlesRead ? n(L) : n(L());
       {
-        let s = L();
+        let i = L();
         for (let o = 0; o < ft.length; o++) {
-          let i = ft[o](e, s);
-          if (i !== void 0)
-            return i;
+          let s = ft[o](e, i);
+          if (s !== void 0)
+            return s;
         }
-        return new xe(s, e);
+        return new xe(i, e);
       }
     case 7:
       switch (e) {
@@ -2024,15 +2024,15 @@ function L() {
           return;
         case 31:
         default:
-          let s = (Q || ye())[e];
-          if (s !== void 0)
-            return s;
+          let i = (Q || ye())[e];
+          if (i !== void 0)
+            return i;
           throw new Error("Unknown token " + e);
       }
     default:
       if (isNaN(e)) {
-        let s = new Error("Unexpected end of CBOR data");
-        throw s.incomplete = !0, s;
+        let i = new Error("Unexpected end of CBOR data");
+        throw i.incomplete = !0, i;
       }
       throw new Error("Unknown CBOR token " + e);
   }
@@ -2064,13 +2064,13 @@ function at(e) {
     }
     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) => 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);
+      return n = D.keyMap ? new Function("r", "return {" + o.map((s) => D.decodeKey(s)).map((s) => Mt.test(s) ? se(s) + ":r()" : "[" + JSON.stringify(s) + "]:r()").join(",") + "}") : new Function("r", "return {" + o.map((s) => Mt.test(s) ? se(s) + ":r()" : "[" + JSON.stringify(s) + "]: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]))] = L();
+    let i = {};
+    if (D.keyMap) for (let o = 0; o < r; o++) i[se(D.decodeKey(this[o]))] = L();
     else for (let o = 0; o < r; o++)
-      s[se(this[o])] = L();
-    return s;
+      i[se(this[o])] = L();
+    return i;
   }
   return e.slowReads = 0, t;
 }
@@ -2089,21 +2089,21 @@ function ct(e) {
     return ot.decode(O.subarray(w, w += e));
   const r = w + e, n = [];
   for (t = ""; w < r; ) {
-    const s = O[w++];
-    if (!(s & 128))
-      n.push(s);
-    else if ((s & 224) === 192) {
+    const i = O[w++];
+    if (!(i & 128))
+      n.push(i);
+    else if ((i & 224) === 192) {
       const o = O[w++] & 63;
-      n.push((s & 31) << 6 | o);
-    } else if ((s & 240) === 224) {
-      const o = O[w++] & 63, i = O[w++] & 63;
-      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 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);
+      n.push((i & 31) << 6 | o);
+    } else if ((i & 240) === 224) {
+      const o = O[w++] & 63, s = O[w++] & 63;
+      n.push((i & 31) << 12 | o << 6 | s);
+    } else if ((i & 248) === 240) {
+      const o = O[w++] & 63, s = O[w++] & 63, f = O[w++] & 63;
+      let a = (i & 7) << 18 | o << 12 | s << 6 | f;
+      a > 65535 && (a -= 65536, n.push(a >>> 10 & 1023 | 55296), a = 56320 | a & 1023), n.push(a);
     } else
-      n.push(s);
+      n.push(i);
     n.length >= 4096 && (t += X.apply(String, n), n.length = 0);
   }
   return n.length > 0 && (t += X.apply(String, n)), t;
@@ -2112,12 +2112,12 @@ let X = String.fromCharCode;
 function un(e) {
   let t = w, r = new Array(e);
   for (let n = 0; n < e; n++) {
-    const s = O[w++];
-    if ((s & 128) > 0) {
+    const i = O[w++];
+    if ((i & 128) > 0) {
       w = t;
       return;
     }
-    r[n] = s;
+    r[n] = i;
   }
   return X.apply(String, r);
 }
@@ -2150,52 +2150,52 @@ function or(e) {
       return X(t, r, n);
     }
   else {
-    let t = O[w++], r = O[w++], n = O[w++], s = O[w++];
-    if ((t & 128) > 0 || (r & 128) > 0 || (n & 128) > 0 || (s & 128) > 0) {
+    let t = O[w++], r = O[w++], n = O[w++], i = O[w++];
+    if ((t & 128) > 0 || (r & 128) > 0 || (n & 128) > 0 || (i & 128) > 0) {
       w -= 4;
       return;
     }
     if (e < 6) {
       if (e === 4)
-        return X(t, r, n, s);
+        return X(t, r, n, i);
       {
         let o = O[w++];
         if ((o & 128) > 0) {
           w -= 5;
           return;
         }
-        return X(t, r, n, s, o);
+        return X(t, r, n, i, o);
       }
     } else if (e < 8) {
-      let o = O[w++], i = O[w++];
-      if ((o & 128) > 0 || (i & 128) > 0) {
+      let o = O[w++], s = O[w++];
+      if ((o & 128) > 0 || (s & 128) > 0) {
         w -= 6;
         return;
       }
       if (e < 7)
-        return X(t, r, n, s, o, i);
-      let c = O[w++];
-      if ((c & 128) > 0) {
+        return X(t, r, n, i, o, s);
+      let f = O[w++];
+      if ((f & 128) > 0) {
         w -= 7;
         return;
       }
-      return X(t, r, n, s, o, i, c);
+      return X(t, r, n, i, o, s, f);
     } else {
-      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) {
+      let o = O[w++], s = O[w++], f = O[w++], a = O[w++];
+      if ((o & 128) > 0 || (s & 128) > 0 || (f & 128) > 0 || (a & 128) > 0) {
         w -= 8;
         return;
       }
       if (e < 10) {
         if (e === 8)
-          return X(t, r, n, s, o, i, c, f);
+          return X(t, r, n, i, o, s, f, a);
         {
           let p = O[w++];
           if ((p & 128) > 0) {
             w -= 9;
             return;
           }
-          return X(t, r, n, s, o, i, c, f, p);
+          return X(t, r, n, i, o, s, f, a, p);
         }
       } else if (e < 12) {
         let p = O[w++], d = O[w++];
@@ -2204,13 +2204,13 @@ function or(e) {
           return;
         }
         if (e < 11)
-          return X(t, r, n, s, o, i, c, f, p, d);
+          return X(t, r, n, i, o, s, f, a, p, d);
         let h = O[w++];
         if ((h & 128) > 0) {
           w -= 11;
           return;
         }
-        return X(t, r, n, s, o, i, c, f, p, d, h);
+        return X(t, r, n, i, o, s, f, a, 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) {
@@ -2219,14 +2219,14 @@ function or(e) {
         }
         if (e < 14) {
           if (e === 12)
-            return X(t, r, n, s, o, i, c, f, p, d, h, g);
+            return X(t, r, n, i, o, s, f, a, p, d, h, g);
           {
             let u = O[w++];
             if ((u & 128) > 0) {
               w -= 13;
               return;
             }
-            return X(t, r, n, s, o, i, c, f, p, d, h, g, u);
+            return X(t, r, n, i, o, s, f, a, p, d, h, g, u);
           }
         } else {
           let u = O[w++], b = O[w++];
@@ -2235,13 +2235,13 @@ function or(e) {
             return;
           }
           if (e < 15)
-            return X(t, r, n, s, o, i, c, f, p, d, h, g, u, b);
+            return X(t, r, n, i, o, s, f, a, 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, f, p, d, h, g, u, b, x);
+          return X(t, r, n, i, o, s, f, a, p, d, h, g, u, b, x);
         }
       }
     }
@@ -2292,9 +2292,9 @@ W[fn] = (e) => {
   let t = e.length, r = e[1];
   lt(e[0], r);
   let n = {};
-  for (let s = 2; s < t; s++) {
-    let o = r[s - 2];
-    n[se(o)] = e[s];
+  for (let i = 2; i < t; i++) {
+    let o = r[i - 2];
+    n[se(o)] = e[i];
   }
   return n;
 };
@@ -2329,12 +2329,12 @@ W[kt] = (e) => {
 };
 W[28] = (e) => {
   ne || (ne = /* @__PURE__ */ new Map(), ne.id = 0);
-  let t = ne.id++, r = w, n = O[w], s;
-  n >> 5 == 4 ? s = [] : s = {};
-  let o = { target: s };
+  let t = ne.id++, r = w, n = O[w], i;
+  n >> 5 == 4 ? i = [] : i = {};
+  let o = { target: i };
   ne.set(t, o);
-  let i = e();
-  return o.used ? (Object.getPrototypeOf(s) !== Object.getPrototypeOf(i) && (w = r, s = i, ne.set(t, { target: s }), i = e()), Object.assign(s, i)) : (o.target = i, i);
+  let s = e();
+  return o.used ? (Object.getPrototypeOf(i) !== Object.getPrototypeOf(s) && (w = r, i = s, ne.set(t, { target: i }), s = e()), Object.assign(i, s)) : (o.target = s, s);
 };
 W[28].handlesRead = !0;
 W[29] = (e) => {
@@ -2395,20 +2395,20 @@ for (let e = 0; e < Rt.length; 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)
+  for (let i = 0; i < 2; i++) {
+    if (!i && n == 1)
       continue;
     let o = n == 2 ? 1 : n == 4 ? 2 : n == 8 ? 3 : 0;
-    W[s ? t : t - 4] = n == 1 || s == bn ? (i) => {
+    W[i ? t : t - 4] = n == 1 || i == bn ? (s) => {
       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) => {
+      return !D.copyBuffers && (n === 1 || n === 2 && !(s.byteOffset & 1) || n === 4 && !(s.byteOffset & 3) || n === 8 && !(s.byteOffset & 7)) ? new e(s.buffer, s.byteOffset, s.byteLength >> o) : new e(Uint8Array.prototype.slice.call(s, 0).buffer);
+    } : (s) => {
       if (!e)
         throw new Error("Could not find typed array for code " + t);
-      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);
+      let f = new DataView(s.buffer, s.byteOffset, s.byteLength), a = s.length >> o, p = new e(a), d = f[r];
+      for (let h = 0; h < a; h++)
+        p[h] = d.call(f, h << o, i);
       return p;
     };
   }
@@ -2416,8 +2416,8 @@ function xn(e, t) {
 function wn() {
   let e = Se(), t = w + L();
   for (let n = 2; n < e; n++) {
-    let s = Se();
-    w += s;
+    let i = Se();
+    w += i;
   }
   let r = w;
   return w = t, G = [ct(Se()), ct(Se())], G.position0 = 0, G.position1 = 0, G.postBundlePosition = w, w = r, L();
@@ -2445,8 +2445,8 @@ function vt() {
   }
 }
 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;
+  let t = ge, r = w, n = $e, i = Fe, o = Ne, s = ne, f = G, a = new Uint8Array(O.slice(0, ge)), p = K, d = D, h = ke, g = e();
+  return ge = t, w = r, $e = n, Fe = i, Ne = o, ne = s, G = f, O = a, ke = h, K = p, D = d, Y = new DataView(O.buffer, O.byteOffset, O.byteLength), g;
 }
 function ut() {
   O = null, ne = null, K = null;
@@ -2464,18 +2464,18 @@ try {
 }
 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;
+let tt, y, H, c = 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;
+    let r, n, i, o, s;
     t = t || {};
-    let c = Bt.prototype.utf8Write ? function(l, _, m) {
+    let f = Bt.prototype.utf8Write ? function(l, _, m) {
       return y.utf8Write(l, _, m);
     } : Te && Te.encodeInto ? function(l, _) {
       return Te.encodeInto(l, y.subarray(_)).written;
-    } : !1, f = this, p = t.structures || t.saveStructures, d = t.maxSharedStructures;
+    } : !1, a = 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;
@@ -2496,11 +2496,11 @@ class vn extends je {
         }
       return this.encode(l, _);
     }, this.encode = function(l, _) {
-      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 (y || (y = new et(8192), H = new DataView(y.buffer, 0, 8192), c = 0), he = y.length - 10, he - c < 2048 ? (y = new et(y.length), H = new DataView(y.buffer, 0, y.length), he = y.length - 10, c = 0) : _ === Vt && (c = c + 7 & 2147483640), r = c, a.useSelfDescribedHeader && (H.setUint32(c, 3654940416), c += 3), s = a.structuredClone ? /* @__PURE__ */ new Map() : null, a.bundleStrings && typeof l != "string" ? (J = [], J.size = 1 / 0) : J = null, n = a.structures, n) {
         if (n.uninitialized) {
-          let A = f.getShared() || {};
-          f.structures = n = A.structures || [], f.sharedVersion = A.version;
-          let S = f.sharedValues = A.packedValues;
+          let A = a.getShared() || {};
+          a.structures = n = A.structures || [], a.sharedVersion = A.version;
+          let S = a.sharedValues = A.packedValues;
           if (S) {
             x = {};
             for (let k = 0, j = S.length; k < j; k++)
@@ -2525,10 +2525,10 @@ class vn extends je {
         }
         h || (n.nextId = m);
       }
-      if (s && (s = !1), o = n || [], u = x, t.pack) {
+      if (i && (i = !1), o = n || [], u = x, t.pack) {
         let m = /* @__PURE__ */ new Map();
-        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);
+        if (m.values = [], m.encoder = a, m.maxValues = t.maxPrivatePackedValues || (x ? 16 : 1 / 0), m.objectMap = x || !1, m.samplingPackedValues = g, De(l, m), m.values.length > 0) {
+          y[c++] = 216, y[c++] = 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++)
@@ -2539,12 +2539,12 @@ class vn extends je {
       try {
         if (tt)
           return;
-        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;
+        if (v(l), J && Lt(r, v), a.offset = c, s && s.idsToInsert) {
+          c += s.idsToInsert.length * 2, c > he && M(c), a.offset = c;
+          let m = En(y.subarray(r, c), s.idsToInsert);
+          return s = null, m;
         }
-        return _ & Vt ? (y.start = r, y.end = a, y) : y.subarray(r, a);
+        return _ & Vt ? (y.start = r, y.end = c, y) : y.subarray(r, c);
       } finally {
         if (n) {
           if (U < 10 && U++, n.length > d && (n.length = d), I > 1e4)
@@ -2555,30 +2555,30 @@ class vn extends je {
             C = [];
           }
         }
-        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;
+        if (i && a.saveShared) {
+          a.structures.length > d && (a.structures = a.structures.slice(0, d));
+          let m = y.subarray(r, c);
+          return a.updateSharedData() === !1 ? a.encode(l) : m;
         }
-        _ & _n && (a = r);
+        _ & _n && (c = 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 [A, S] of g)
-        S.count > _ && (x[A] = m++, b.push(A), s = !0);
+        S.count > _ && (x[A] = m++, b.push(A), i = !0);
       for (; this.saveShared && this.updateSharedData() === !1; )
         ;
       g = null;
     });
     const v = (l) => {
-      a > he && (y = M(a));
+      c > he && (y = M(c));
       var _ = typeof l, m;
       if (_ === "string") {
         if (u) {
           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));
+            j < 16 ? y[c++] = j + 224 : (y[c++] = 198, j & 1 ? v(15 - j >> 1) : v(j - 16 >> 1));
             return;
           } else if (g && !t.pack) {
             let R = g.get(l);
@@ -2591,69 +2591,69 @@ class vn extends je {
         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;
-            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;
+            c + T > he && (y = M(c + T)), y[c++] = 217, y[c++] = 223, y[c++] = 249, y[c++] = J.position ? 132 : 130, y[c++] = 26, R = c - r, c += 4, J.position && Lt(r, v), J = ["", ""], J.size = 0, J.position = R;
           }
           let j = Sn.test(l);
-          J[j ? 0 : 1] += l, y[a++] = j ? 206 : 207, v(A);
+          J[j ? 0 : 1] += l, y[c++] = j ? 206 : 207, v(A);
           return;
         }
         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;
+        if (c + k > he && (y = M(c + k)), A < 64 || !f) {
+          let j, R, T, V = c + 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;
+          m = V - c - S;
         } else
-          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;
+          m = f(l, c + S, k);
+        m < 24 ? y[c++] = 96 | m : m < 256 ? (S < 2 && y.copyWithin(c + 2, c + 1, c + 1 + m), y[c++] = 120, y[c++] = m) : m < 65536 ? (S < 3 && y.copyWithin(c + 3, c + 2, c + 2 + m), y[c++] = 121, y[c++] = m >> 8, y[c++] = m & 255) : (S < 5 && y.copyWithin(c + 5, c + 3, c + 3 + m), y[c++] = 122, H.setUint32(c, m), c += 4), c += m;
       } else if (_ === "number")
         if (!this.alwaysUseFloat && l >>> 0 === l)
-          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);
+          l < 24 ? y[c++] = l : l < 256 ? (y[c++] = 24, y[c++] = l) : l < 65536 ? (y[c++] = 25, y[c++] = l >> 8, y[c++] = l & 255) : (y[c++] = 26, H.setUint32(c, l), c += 4);
         else if (!this.alwaysUseFloat && l >> 0 === l)
-          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);
+          l >= -24 ? y[c++] = 31 - l : l >= -256 ? (y[c++] = 56, y[c++] = ~l) : l >= -65536 ? (y[c++] = 57, H.setUint16(c, ~l), c += 2) : (y[c++] = 58, H.setUint32(c, ~l), c += 4);
         else {
           let A;
           if ((A = this.useFloat32) > 0 && l < 4294967296 && l >= -2147483648) {
-            y[a++] = 250, H.setFloat32(a, l);
+            y[c++] = 250, H.setFloat32(c, 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;
+            (S = l * At[(y[c] & 127) << 1 | y[c + 1] >> 7]) >> 0 === S) {
+              c += 4;
               return;
             } else
-              a--;
+              c--;
           }
-          y[a++] = 251, H.setFloat64(a, l), a += 8;
+          y[c++] = 251, H.setFloat64(c, l), c += 8;
         }
       else if (_ === "object")
         if (!l)
-          y[a++] = 246;
+          y[c++] = 246;
         else {
-          if (i) {
-            let S = i.get(l);
+          if (s) {
+            let S = s.get(l);
             if (S) {
-              if (y[a++] = 216, y[a++] = 29, y[a++] = 25, !S.references) {
-                let k = i.idsToInsert || (i.idsToInsert = []);
+              if (y[c++] = 216, y[c++] = 29, y[c++] = 25, !S.references) {
+                let k = s.idsToInsert || (s.idsToInsert = []);
                 S.references = [], k.push(S);
               }
-              S.references.push(a - r), a += 2;
+              S.references.push(c - r), c += 2;
               return;
             } else
-              i.set(l, { offset: a - r });
+              s.set(l, { offset: c - r });
           }
           let A = l.constructor;
           if (A === Object)
             B(l);
           else if (A === Array) {
-            m = l.length, m < 24 ? y[a++] = 128 | m : fe(m);
+            m = l.length, m < 24 ? y[c++] = 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)
+            if ((this.mapsAsObjects ? this.useTag259ForMaps !== !1 : this.useTag259ForMaps) && (y[c++] = 217, y[c++] = 1, y[c++] = 3), m = l.size, m < 24 ? y[c++] = 160 | m : m < 256 ? (y[c++] = 184, y[c++] = m) : m < 65536 ? (y[c++] = 185, y[c++] = m >> 8, y[c++] = m & 255) : (y[c++] = 186, H.setUint32(c, m), c += 4), a.keyMap)
               for (let [S, k] of l)
-                v(f.encodeKey(S)), v(k);
+                v(a.encodeKey(S)), v(k);
             else
               for (let [S, k] of l)
                 v(S), v(k);
@@ -2662,7 +2662,7 @@ class vn extends je {
               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);
+                T == null && (T = R.getTag && R.getTag.call(this, l)), T < 24 ? y[c++] = 192 | T : T < 256 ? (y[c++] = 216, y[c++] = T) : T < 65536 ? (y[c++] = 217, y[c++] = T >> 8, y[c++] = T & 255) : T > -1 && (y[c++] = 218, H.setUint32(c, T), c += 4), R.encode.call(this, l, v, M);
                 return;
               }
             }
@@ -2671,10 +2671,10 @@ class vn extends je {
                 let S = new Error("Iterable should be serialized as iterator");
                 throw S.iteratorNotHandled = !0, S;
               }
-              y[a++] = 159;
+              y[c++] = 159;
               for (let S of l)
                 v(S);
-              y[a++] = 255;
+              y[c++] = 255;
               return;
             }
             if (l[Symbol.asyncIterator] || rt(l)) {
@@ -2690,42 +2690,42 @@ class vn extends je {
           }
         }
       else if (_ === "boolean")
-        y[a++] = l ? 245 : 244;
+        y[c++] = l ? 245 : 244;
       else if (_ === "bigint") {
         if (l < BigInt(1) << BigInt(64) && l >= 0)
-          y[a++] = 27, H.setBigUint64(a, l);
+          y[c++] = 27, H.setBigUint64(c, l);
         else if (l > -(BigInt(1) << BigInt(64)) && l < 0)
-          y[a++] = 59, H.setBigUint64(a, -l - BigInt(1));
+          y[c++] = 59, H.setBigUint64(c, -l - BigInt(1));
         else if (this.largeBigIntToFloat)
-          y[a++] = 251, H.setFloat64(a, Number(l));
+          y[c++] = 251, H.setFloat64(c, Number(l));
         else {
-          l >= BigInt(0) ? y[a++] = 194 : (y[a++] = 195, l = BigInt(-1) - l);
+          l >= BigInt(0) ? y[c++] = 194 : (y[c++] = 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;
+        c += 8;
       } else if (_ === "undefined")
-        y[a++] = 247;
+        y[c++] = 247;
       else
         throw new Error("Unknown type: " + _);
     }, B = this.useRecords === !1 ? this.variableMapSize ? (l) => {
       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)
+      if (A < 24 ? y[c++] = 160 | A : A < 256 ? (y[c++] = 184, y[c++] = A) : A < 65536 ? (y[c++] = 185, y[c++] = A >> 8, y[c++] = A & 255) : (y[c++] = 186, H.setUint32(c, A), c += 4), a.keyMap)
         for (let S = 0; S < A; S++)
-          v(f.encodeKey(_[S])), v(m[S]);
+          v(a.encodeKey(_[S])), v(m[S]);
       else
         for (let S = 0; S < A; S++)
           v(_[S]), v(m[S]);
     } : (l) => {
-      y[a++] = 185;
-      let _ = a - r;
-      a += 2;
+      y[c++] = 185;
+      let _ = c - r;
+      c += 2;
       let m = 0;
-      if (f.keyMap)
-        for (let A in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(A)) && (v(f.encodeKey(A)), v(l[A]), m++);
+      if (a.keyMap)
+        for (let A in l) (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(A)) && (v(a.encodeKey(A)), v(l[A]), m++);
       else
         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;
@@ -2741,19 +2741,19 @@ class vn extends je {
         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[a++] = 217, y[a++] = T >> 8 | 224, y[a++] = T & 255;
+        T &= 65535, y[c++] = 217, y[c++] = T >> 8 | 224, y[c++] = 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;
+        y[c++] = 217, y[c++] = T >> 8 | 224, y[c++] = 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;
+        A[ee] = T | 1048576, i = !0;
       } else {
-        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;
+        if (A[ee] = T, H.setUint32(c, 3655335680), c += 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)) && v(l[V]);
         return;
       }
-      if (k < 24 ? y[a++] = 128 | k : fe(k), !_)
+      if (k < 24 ? y[c++] = 128 | k : fe(k), !_)
         for (let V in l)
           (typeof l.hasOwnProperty != "function" || l.hasOwnProperty(V)) && v(l[V]);
     }, M = (l) => {
@@ -2768,7 +2768,7 @@ class vn extends je {
       } else
         _ = (Math.max(l - r << 2, y.length - 1) >> 12) + 1 << 12;
       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;
+      return H = new DataView(m.buffer, 0, _), y.copy ? y.copy(m, 0, r, l) : m.set(y.slice(r, l)), c -= r, r = 0, he = m.length - 10, y = m;
     };
     let F = 100, N = 1e3;
     this.encodeAsIterable = function(l, _) {
@@ -2779,7 +2779,7 @@ class vn extends je {
     function* P(l, _, m) {
       let A = l.constructor;
       if (A === Object) {
-        let S = f.useRecords !== !1;
+        let S = a.useRecords !== !1;
         S ? B(l, !0) : Pt(Object.keys(l).length, 160);
         for (let k in l) {
           let j = l[k];
@@ -2790,31 +2790,31 @@ class vn extends je {
         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);
+          j && (typeof j == "object" || c - r > F) ? _.element ? yield* P(j, _.element) : yield* z(j, _, "element") : v(j);
         }
       } else if (l[Symbol.iterator] && !l.buffer) {
-        y[a++] = 159;
+        y[c++] = 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), $());
+          S && (typeof S == "object" || c - r > F) ? _.element ? yield* P(S, _.element) : yield* z(S, _, "element") : v(S);
+        y[c++] = 255;
+      } else rt(l) ? (Pt(l.size, 64), yield y.subarray(r, c), yield l, $()) : l[Symbol.asyncIterator] ? (y[c++] = 159, yield y.subarray(r, c), yield l, $(), y[c++] = 255) : v(l);
+      m && c > r ? yield y.subarray(r, c) : c - r > F && (yield y.subarray(r, c), $());
     }
     function* z(l, _, m) {
-      let A = a - r;
+      let A = c - r;
       try {
-        v(l), a - r > F && (yield y.subarray(r, a), $());
+        v(l), c - r > F && (yield y.subarray(r, c), $());
       } catch (S) {
         if (S.iteratorNotHandled)
-          _[m] = {}, a = r + A, yield* P.call(this, l, _[m]);
+          _[m] = {}, c = r + A, yield* P.call(this, l, _[m]);
         else throw S;
       }
     }
     function $() {
-      F = N, f.encode(null, nt);
+      F = N, a.encode(null, nt);
     }
     function ie(l, _, m) {
-      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)];
+      return _ && _.chunkThreshold ? F = N = _.chunkThreshold : F = 100, l && typeof l == "object" ? (a.encode(null, nt), m(l, a.iterateProperties || (a.iterateProperties = {}), !0)) : [a.encode(l)];
     }
     async function* E(l, _) {
       for (let m of P(l, _, !0)) {
@@ -2827,14 +2827,14 @@ class vn extends je {
             yield k.value;
         } else if (m[Symbol.asyncIterator])
           for await (let S of m)
-            $(), S ? yield* E(S, _.async || (_.async = {})) : yield f.encode(S);
+            $(), S ? yield* E(S, _.async || (_.async = {})) : yield a.encode(S);
         else
           yield m;
       }
     }
   }
   useBuffer(t) {
-    y = t, H = new DataView(y.buffer, y.byteOffset, y.byteLength), a = 0;
+    y = t, H = new DataView(y.buffer, y.byteOffset, y.byteLength), c = 0;
   }
   clearSharedData() {
     this.structures && (this.structures = []), this.sharedValues && (this.sharedValues = void 0);
@@ -2842,15 +2842,15 @@ class vn extends je {
   updateSharedData() {
     let t = this.sharedVersion || 0;
     this.sharedVersion = t + 1;
-    let r = this.structures.slice(0), n = new ur(r, this.sharedValues, this.sharedVersion), s = this.saveShared(
+    let r = this.structures.slice(0), n = new ur(r, this.sharedValues, this.sharedVersion), i = 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;
+    return i === !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, s) => this.structures[s] = o), i;
   }
 }
 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);
+  e < 24 ? y[c++] = t | e : e < 256 ? (y[c++] = t | 24, y[c++] = e) : e < 65536 ? (y[c++] = t | 25, y[c++] = e >> 8, y[c++] = e & 255) : (y[c++] = t | 26, H.setUint32(c, e), c += 4);
 }
 class ur {
   constructor(t, r, n) {
@@ -2858,7 +2858,7 @@ class ur {
   }
 }
 function fe(e) {
-  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);
+  e < 24 ? y[c++] = 128 | e : e < 256 ? (y[c++] = 152, y[c++] = e) : e < 65536 ? (y[c++] = 153, y[c++] = e >> 8, y[c++] = e & 255) : (y[c++] = 154, H.setUint32(c, e), c += 4);
 }
 const An = typeof Blob > "u" ? function() {
 } : Blob;
@@ -2880,8 +2880,8 @@ function De(e, t) {
         else if (t.set(e, {
           count: 1
         }), t.samplingPackedValues) {
-          let s = t.samplingPackedValues.get(e);
-          s ? s.count++ : t.samplingPackedValues.set(e, {
+          let i = t.samplingPackedValues.get(e);
+          i ? i.count++ : t.samplingPackedValues.set(e, {
             count: 1
           });
         }
@@ -2890,7 +2890,7 @@ function De(e, t) {
     case "object":
       if (e)
         if (e instanceof Array)
-          for (let n = 0, s = e.length; n < s; n++)
+          for (let n = 0, i = e.length; n < i; n++)
             De(e[n], t);
         else {
           let n = !t.encoder.useRecords;
@@ -2931,7 +2931,7 @@ ht = [
     tag: 1,
     encode(e, t) {
       let r = e.getTime() / 1e3;
-      (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);
+      (this.useTimestamp32 || e.getMilliseconds() === 0) && r >= 0 && r < 4294967296 ? (y[c++] = 26, H.setUint32(c, r), c += 4) : (y[c++] = 251, H.setFloat64(c, r), c += 8);
     }
   },
   {
@@ -2998,16 +2998,16 @@ ht = [
     encode(e, t) {
       let r = e.packedValues || [], n = e.structures || [];
       if (r.values.length > 0) {
-        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;
+        y[c++] = 216, y[c++] = 51, fe(4);
+        let i = r.values;
+        t(i), fe(0), fe(0), packedObjectMap = Object.create(sharedPackedObjectMap || null);
+        for (let o = 0, s = i.length; o < s; o++)
+          packedObjectMap[i[o]] = o;
       }
       if (n) {
-        H.setUint32(a, 3655335424), a += 3;
-        let s = n.slice(0);
-        s.unshift(57344), s.push(new xe(e.version, 1399353956)), t(s);
+        H.setUint32(c, 3655335424), c += 3;
+        let i = n.slice(0);
+        i.unshift(57344), i.push(new xe(e.version, 1399353956)), t(i);
       } else
         t(new xe(e.version, 1399353956));
     }
@@ -3016,35 +3016,35 @@ ht = [
 function oe(e, t) {
   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(Me ? Ge.from(c, i, o) : new Uint8Array(c, i, o));
+    encode: function(n, i) {
+      let o = n.byteLength, s = n.byteOffset || 0, f = n.buffer || n;
+      i(Me ? Ge.from(f, s, o) : new Uint8Array(f, s, o));
     }
   };
 }
 function dt(e, t) {
   let r = e.byteLength;
-  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;
+  r < 24 ? y[c++] = 64 + r : r < 256 ? (y[c++] = 88, y[c++] = r) : r < 65536 ? (y[c++] = 89, y[c++] = r >> 8, y[c++] = r & 255) : (y[c++] = 90, H.setUint32(c, r), c += 4), c + r >= y.length && t(c + r), y.set(e.buffer ? e : new Uint8Array(e), c), c += r;
 }
 function En(e, t) {
-  let r, n = t.length * 2, s = e.length - n;
-  t.sort((o, i) => o.offset > i.offset ? 1 : -1);
+  let r, n = t.length * 2, i = e.length - n;
+  t.sort((o, s) => o.offset > s.offset ? 1 : -1);
   for (let o = 0; o < t.length; o++) {
-    let i = t[o];
-    i.id = o;
-    for (let c of i.references)
-      e[c++] = o >> 8, e[c] = o & 255;
+    let s = t[o];
+    s.id = o;
+    for (let f of s.references)
+      e[f++] = o >> 8, e[f] = o & 255;
   }
   for (; r = t.pop(); ) {
     let o = r.offset;
-    e.copyWithin(o + n, o, s), n -= 2;
-    let i = o + n;
-    e[i++] = 216, e[i++] = 28, s = o;
+    e.copyWithin(o + n, o, i), n -= 2;
+    let s = o + n;
+    e[s++] = 216, e[s++] = 28, i = o;
   }
   return e;
 }
 function Lt(e, t) {
-  H.setUint32(J.position + e, a - J.position - e + 1);
+  H.setUint32(J.position + e, c - J.position - e + 1);
   let r = J;
   J = null, t(r[0]), t(r[1]);
 }
@@ -3058,10 +3058,10 @@ var On = { exports: {} };
   (function(t, r) {
     var n = {};
     r(n);
-    var s = n.default;
+    var i = n.default;
     for (var o in n)
-      s[o] = n[o];
-    e.exports = s;
+      i[o] = n[o];
+    e.exports = i;
   })(Mr, function(t) {
     t.__esModule = !0, t.digestLength = 32, t.blockSize = 64;
     var r = new Uint32Array([
@@ -3142,7 +3142,7 @@ var On = { exports: {} };
       }
       return x;
     }
-    var s = (
+    var i = (
       /** @class */
       function() {
         function g() {
@@ -3192,15 +3192,15 @@ var On = { exports: {} };
         }, g;
       }()
     );
-    t.Hash = s;
+    t.Hash = i;
     var o = (
       /** @class */
       function() {
         function g(u) {
-          this.inner = new s(), this.outer = new s(), this.blockSize = this.inner.blockSize, this.digestLength = this.inner.digestLength;
+          this.inner = new i(), this.outer = new i(), this.blockSize = this.inner.blockSize, this.digestLength = this.inner.digestLength;
           var b = new Uint8Array(this.blockSize);
           if (u.length > this.blockSize)
-            new s().update(u).finish(b).clean();
+            new i().update(u).finish(b).clean();
           else
             for (var x = 0; x < u.length; x++)
               b[x] = u[x];
@@ -3230,17 +3230,17 @@ var On = { exports: {} };
       }()
     );
     t.HMAC = o;
-    function i(g) {
-      var u = new s().update(g), b = u.digest();
+    function s(g) {
+      var u = new i().update(g), b = u.digest();
       return u.clean(), b;
     }
-    t.hash = i, t.default = i;
-    function c(g, u) {
+    t.hash = s, t.default = s;
+    function f(g, u) {
       var b = new o(g).update(u), x = b.digest();
       return b.clean(), x;
     }
-    t.hmac = c;
-    function f(g, u, b, x) {
+    t.hmac = f;
+    function a(g, u, b, x) {
       var C = x[0];
       if (C === 0)
         throw new Error("hkdf: cannot expand more");
@@ -3249,8 +3249,8 @@ var On = { exports: {} };
     var p = new Uint8Array(t.digestLength);
     function d(g, u, b, x) {
       u === void 0 && (u = p), x === void 0 && (x = 32);
-      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++];
+      for (var C = new Uint8Array([1]), I = f(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 && (a(v, U, b, C), B = 0), M[F] = v[B++];
       return U.clean(), v.fill(0), C.fill(0), M;
     }
     t.hkdf = d;
@@ -3279,51 +3279,54 @@ var On = { exports: {} };
 })(On);
 Pr("automerge-repo:collectionsync");
 const Mn = (e) => {
-  const [t, r] = $t({}), n = bt(), s = br(
-    () => e?.map((i) => {
-      if (sn(i)) {
-        const { documentId: c } = nr(i);
-        return c;
+  const t = bt(), r = br(
+    () => e?.map((s) => {
+      if (sn(s)) {
+        const { documentId: f } = nr(s);
+        return f;
       } else
-        return i;
+        return s;
     }) ?? [],
     [e]
-  ), o = Nt([]);
+  ), n = Nt([]), [i, o] = $t(() => r.reduce((s, f) => {
+    const p = t.find(f).docSync();
+    return p && (s[f] = p), s;
+  }, {}));
   return _e(() => {
-    const i = {}, c = (u, b) => {
-      b && r((x) => ({ ...x, [u]: b }));
-    }, f = (u) => {
+    const s = {}, f = (u, b) => {
+      b && o((x) => ({ ...x, [u]: b }));
+    }, a = (u) => {
       const b = u.documentId, x = {
-        change: ({ doc: C }) => c(b, C),
+        change: ({ doc: C }) => f(b, C),
         delete: () => p(b)
       };
-      u.on("change", x.change), u.on("delete", x.delete), i[b] = x;
+      u.on("change", x.change), u.on("delete", x.delete), s[b] = x;
     }, p = (u) => {
-      r((b) => {
+      o((b) => {
         const { [u]: x, ...C } = b;
         return C;
       });
     }, d = (u) => {
-      const b = n.find(u);
-      b.docSync() ? (c(u, b.docSync()), f(b)) : b.doc().then((x) => {
-        c(u, x), f(b);
+      const b = t.find(u);
+      b.docSync() ? (f(u, b.docSync()), a(b)) : b.doc().then((x) => {
+        f(u, x), a(b);
       }).catch((x) => {
         console.error(`Error loading document ${u} in useDocuments: `, x);
       });
     }, h = () => {
-      Object.entries(i).forEach(([u, b]) => {
-        const x = n.find(u);
+      Object.entries(s).forEach(([u, b]) => {
+        const x = t.find(u);
         x.off("change", b.change), x.off("delete", b.delete);
       });
     };
-    if (!s)
+    if (!r)
       return h;
-    for (const u of s) {
-      const b = n.find(u);
-      o.current.includes(u) ? f(b) : d(u);
+    for (const u of r) {
+      const b = t.find(u);
+      n.current.includes(u) ? a(b) : d(u);
     }
-    return o.current.filter((u) => !s.includes(u)).forEach(p), o.current = s, h;
-  }, [s, n]), t;
+    return n.current.filter((u) => !r.includes(u)).forEach(p), n.current = r, h;
+  }, [r, t]), i;
 };
 function Rn(e) {
   const t = bt();
@@ -3332,10 +3335,10 @@ function Rn(e) {
 var st = hr, In = function(e) {
   return typeof e == "function";
 }, 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);
+  var t = st.useState(e), r = t[0], n = t[1], i = st.useRef(r), o = st.useCallback(function(s) {
+    i.current = In(s) ? s(i.current) : s, n(i.current);
   }, []);
-  return [r, o, s];
+  return [r, o, i];
 }, Fn = Un;
 const yt = /* @__PURE__ */ We(Fn), pt = new Vr(), Bn = ({
   handle: e,
@@ -3343,22 +3346,22 @@ const yt = /* @__PURE__ */ We(Fn), pt = new Vr(), Bn = ({
   offlineTimeout: r = 3e4,
   getTime: n = () => (/* @__PURE__ */ new Date()).getTime()
 }) => {
-  const [s, o, i] = yt({}), [c, f, p] = yt({});
+  const [i, o, s] = yt({}), [f, a, p] = yt({});
   return _e(() => {
     const d = (u) => {
       const [b, x] = u.message;
       b !== t && (p.current[b] || pt.emit("new_peer", u), o({
-        ...i.current,
+        ...s.current,
         [b]: x
-      }), f({
+      }), a({
         ...p.current,
         [b]: n()
       }));
     }, h = () => {
-      const u = i.current, b = p.current, x = n();
+      const u = s.current, b = p.current, x = n();
       for (const C in b)
         x - b[C] > r && (delete u[C], delete b[C]);
-      o(u), f(b);
+      o(u), a(b);
     };
     e.on("ephemeral-message", d);
     const g = setInterval(
@@ -3368,37 +3371,37 @@ const yt = /* @__PURE__ */ We(Fn), pt = new Vr(), Bn = ({
     return () => {
       e.removeListener("ephemeral-message", d), clearInterval(g);
     };
-  }, [e, t, r, n]), [s, c];
+  }, [e, t, r, n]), [i, f];
 }, Tn = ({
   handle: e,
   userId: t,
   initialState: r,
   heartbeatTime: n = 15e3
 }) => {
-  const [s, o, i] = yt(r), c = (f) => {
-    const p = typeof f == "function" ? f(i.current) : f;
+  const [i, o, s] = yt(r), f = (a) => {
+    const p = typeof a == "function" ? a(s.current) : a;
     o(p), e.broadcast([t, p]);
   };
   return _e(() => {
     if (!t)
       return;
-    const f = () => void e.broadcast([t, i.current]);
-    f();
-    const p = setInterval(f, n);
+    const a = () => void e.broadcast([t, s.current]);
+    a();
+    const p = setInterval(a, n);
     return () => void clearInterval(p);
   }, [e, t, n]), _e(() => {
-    let f;
+    let a;
     const p = pt.on("new_peer", () => {
-      f = setTimeout(
-        () => e.broadcast([t, i.current]),
+      a = setTimeout(
+        () => e.broadcast([t, s.current]),
         500
         // Wait for the peer to be ready
       );
     });
     return () => {
-      p.off("new_peer"), f && clearTimeout(f);
+      p.off("new_peer"), a && clearTimeout(a);
     };
-  }, [e, t, pt]), [s, c];
+  }, [e, t, pt]), [i, f];
 };
 export {
   gr as RepoContext,