document-model 1.0.35 → 1.0.36

package/dist/browser/internal/{object-B-Aw8ilC.js → object-Fq6PThAX.js}

@@ -15,9 +15,9 @@ function De() {
 function H() {
   return w.literal("global").or(w.literal("local"));
 }
-function Pt() {
+function $t() {
   return w.union([
-    qt(),
+    Pt(),
     Wt(),
     Jt(),
     Ht(),
@@ -33,7 +33,7 @@ function Me() {
     mimeType: w.string()
   });
 }
-function qt() {
+function Pt() {
   return w.object({
     input: w.lazy(() => ut()),
     type: Nt,
@@ -43,10 +43,10 @@ function qt() {
 function ut() {
   return w.object({
     operations: w.number(),
-    state: w.lazy(() => $t())
+    state: w.lazy(() => qt())
   });
 }
-function $t() {
+function qt() {
   return w.object({
     data: w.unknown().nullish(),
     name: w.string()
@@ -108,14 +108,14 @@ function Zt() {
     scope: H()
   });
 }
-const Li = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+const zi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   ActionSchema: De,
-  BaseActionSchema: Pt,
+  BaseActionSchema: $t,
   DocumentFileSchema: Me,
   LoadStateActionInputSchema: ut,
-  LoadStateActionSchema: qt,
-  LoadStateActionStateInputSchema: $t,
+  LoadStateActionSchema: Pt,
+  LoadStateActionStateInputSchema: qt,
   Load_StateSchema: Nt,
   OperationSchema: Ne,
   OperationScopeSchema: H,
@@ -142,14 +142,14 @@ function Le(n, r, p) {
   const c = {
     skip: p,
     document: n
-  }, { scope: u } = r;
-  return !u || r.skip === void 0 ? c : J(c, (f) => {
-    const [l] = f.document.operations[u].slice(-1);
-    r.skip && r.skip > 0 && (f.skip = r.skip), l.type === "NOOP" && r.index === l.index && f.skip > l.skip && f.document.operations[u].pop();
+  }, { scope: f } = r;
+  return !f || r.skip === void 0 ? c : J(c, (u) => {
+    const [l] = u.document.operations[f].slice(-1);
+    r.skip && r.skip > 0 && (u.skip = r.skip), l.type === "NOOP" && r.index === l.index && u.skip > l.skip && u.document.operations[f].pop();
   });
 }
 function ze(n, r, p) {
-  const { scope: c, input: u } = r;
+  const { scope: c, input: f } = r;
   return J({
     document: n,
     action: r,
@@ -159,7 +159,7 @@ function ze(n, r, p) {
       throw new Error(
         `Cannot undo: no operations in history for scope "${c}"`
       );
-    if (u < 1)
+    if (f < 1)
       throw new Error(
         "Invalid UNDO action: input value must be greater than 0"
       );
@@ -168,21 +168,30 @@ function ze(n, r, p) {
         "Cannot undo: skip value from reducer cannot be used with UNDO action"
       );
     const [a] = l.document.operations[c].slice(-1), x = a.type === "NOOP" && a.skip > 0;
-    if (l.skip += u, x && (l.skip += a.skip, l.document.operations[c].pop()), l.document.operations[c].length < l.skip)
+    if (l.skip += f, x) {
+      l.skip += a.skip;
+      const y = l.document.operations[c][l.document.operations[c].length - 2];
+      y && a.index - y.index === 1 && l.document.operations[c].pop();
+    }
+    if (l.document.operations[c].length < l.skip)
       throw new Error(
         "Cannot undo: you can't undo more operations than the ones in the scope history"
       );
     const d = l.document.operations[c].length - 1;
-    let v = u, g = x ? d - a.skip : d;
+    let v = f, g = x ? d - a.skip : d;
     for (; v > 0 && g >= 0; ) {
       const y = l.document.operations[c][g];
+      if (!y) {
+        v--, g--;
+        continue;
+      }
       y.type === "NOOP" && y.skip > 0 ? (g = g - (y.skip + 1), l.skip += y.skip + 1) : (l.document.clipboard.push({ ...y }), v--, g--);
     }
     l.action = yt(c);
   });
 }
-function Pe(n, r, p) {
-  const { scope: c, input: u } = r;
+function $e(n, r, p) {
+  const { scope: c, input: f } = r;
   return J({
     document: n,
     action: r,
@@ -192,11 +201,11 @@ function Pe(n, r, p) {
       throw new Error(
         "Cannot redo: skip value from reducer cannot be used with REDO action"
       );
-    if (u > 1)
+    if (f > 1)
       throw new Error(
         "Cannot redo: you can only redo one operation at a time"
       );
-    if (u < 1)
+    if (f < 1)
       throw new Error("Invalid REDO action: invalid redo input value");
     if (l.document.clipboard.length < 1)
       throw new Error("Cannot redo: no operations in the clipboard");
@@ -215,13 +224,13 @@ function Pe(n, r, p) {
     });
   });
 }
-function qe(n, r, p) {
-  const { scope: c } = r, u = n.operations[c];
+function Pe(n, r, p) {
+  const { scope: c } = r, f = n.operations[c];
   let {
-    input: { start: f, end: l }
+    input: { start: u, end: l }
   } = r;
-  f = f || 0, l = l || u.length;
-  const a = u.slice(f, l), x = u.slice(0, f), d = u.slice(l), v = lt(
+  u = u || 0, l = l || f.length;
+  const a = f.slice(u, l), x = f.slice(0, u), d = f.slice(l), v = lt(
     n.initialState,
     {
       ...n.operations,
@@ -253,17 +262,17 @@ function qe(n, r, p) {
     p
   );
 }
-function $e(n, r) {
+function qe(n, r) {
   return {
     ...n,
     name: r.name,
     state: r.state ?? { global: {}, local: {} }
   };
 }
-const Yt = "SET_NAME", z = "UNDO", P = "REDO", Z = "PRUNE", Gt = "LOAD_STATE", We = "NOOP";
+const Yt = "SET_NAME", z = "UNDO", $ = "REDO", Z = "PRUNE", Gt = "LOAD_STATE", We = "NOOP";
 function Je(n, r) {
   const p = n.revision[r.scope];
-  return [z, P, Z].includes(r.type) ? p : p + 1;
+  return [z, $, Z].includes(r.type) ? p : p + 1;
 }
 function He(n, r) {
   return {
@@ -276,22 +285,30 @@ function He(n, r) {
   };
 }
 function Ze(n, r, p = 0) {
-  if ([z, P, Z].includes(r.type))
+  if ([z, $, Z].includes(r.type))
     return n;
-  const { scope: c } = r, u = n.operations[c].slice(
+  const { scope: c } = r, f = n.operations[c].slice(
     0,
     n.revision[c]
-  );
-  return u.push({
+  ), u = [...f].pop();
+  let l = ((u == null ? void 0 : u.index) ?? -1) + 1;
+  if ("index" in r) {
+    if (r.index > l + p)
+      throw new Error(
+        `Missing operations: expected ${l} with skip 0 or equivalent, got index ${r.index} with skip ${p}`
+      );
+    l = r.index;
+  }
+  return f.push({
     ...r,
-    index: u.length,
+    index: l,
     timestamp: (/* @__PURE__ */ new Date()).toISOString(),
     hash: "",
     scope: c,
     skip: p
   }), {
     ...n,
-    operations: { ...n.operations, [c]: u }
+    operations: { ...n.operations, [c]: f }
   };
 }
 function Ye(n, r, p = 0) {
@@ -299,13 +316,13 @@ function Ye(n, r, p = 0) {
   return c = He(c, r), c;
 }
 function Ge(n, r, p) {
-  switch (Pt().parse(r), r.type) {
+  switch ($t().parse(r), r.type) {
     case Yt:
       return Ce(n, r.input);
     case Z:
-      return qe(n, r, p);
+      return Pe(n, r, p);
     case Gt:
-      return $e(n, r.input.state);
+      return qe(n, r.input.state);
     default:
       return n;
   }
@@ -314,15 +331,15 @@ function Ke(n, r, p) {
   switch (r.type) {
     case z:
       return ze(n, r, p);
-    case P:
-      return Pe(n, r, p);
+    case $:
+      return $e(n, r, p);
     default:
       return { document: n, action: r, skip: p };
   }
 }
-function Kt(n, r, p, c, u = {}) {
-  const { skip: f, ignoreSkipOperations: l = !1 } = u;
-  let a = { ...r }, x = f || 0, d = n, v = [...n.clipboard];
+function Kt(n, r, p, c, f = {}) {
+  const { skip: u, ignoreSkipOperations: l = !1 } = f;
+  let a = { ...r }, x = u || 0, d = n, v = [...n.clipboard];
   if (Ei(a)) {
     const { document: g, skip: y } = Le(d, a, x);
     x = y, d = g;
@@ -335,15 +352,23 @@ function Kt(n, r, p, c, u = {}) {
     } = Ke(n, a, x);
     a = y, x = g, d = b, v = [...d.clipboard];
   }
-  return Ut(a) && (d = Ge(d, a, p)), x > 0 && !l && (d = lt(
-    d.initialState,
-    d.operations,
-    p,
-    void 0,
-    void 0,
-    void 0,
-    { [a.scope]: x }
-  )), d = Ye(d, a, x), d = J(d, (g) => {
+  if (Ut(a) && (d = Ge(d, a, p)), x > 0 && !l) {
+    let g = x;
+    "index" in a && (g = Si(
+      d.operations[a.scope],
+      a.index,
+      x
+    )), d = lt(
+      d.initialState,
+      d.operations,
+      p,
+      void 0,
+      void 0,
+      void 0,
+      { [a.scope]: g }
+    );
+  }
+  return d = Ye(d, a, x), d = J(d, (g) => {
     const y = p(
       g.state,
       a,
@@ -357,7 +382,7 @@ function Kt(n, r, p, c, u = {}) {
       });
     g.clipboard = at([...b]);
   }), J(d, (g) => {
-    if ([z, P, Z].includes(a.type))
+    if ([z, $, Z].includes(a.type))
       return g;
     const y = a.scope || "global";
     g.operations[y][g.operations[y].length - 1].hash = re(g, y), !Ut(a) && a.attachments && a.attachments.forEach((b) => {
@@ -415,50 +440,50 @@ function ii(n, r, p) {
   return (r + p) * 3 / 4 - p;
 }
 function ri(n) {
-  var r, p = Xt(n), c = p[0], u = p[1], f = new Qe(ii(n, c, u)), l = 0, a = u > 0 ? c - 4 : c, x;
+  var r, p = Xt(n), c = p[0], f = p[1], u = new Qe(ii(n, c, f)), l = 0, a = f > 0 ? c - 4 : c, x;
   for (x = 0; x < a; x += 4)
-    r = O[n.charCodeAt(x)] << 18 | O[n.charCodeAt(x + 1)] << 12 | O[n.charCodeAt(x + 2)] << 6 | O[n.charCodeAt(x + 3)], f[l++] = r >> 16 & 255, f[l++] = r >> 8 & 255, f[l++] = r & 255;
-  return u === 2 && (r = O[n.charCodeAt(x)] << 2 | O[n.charCodeAt(x + 1)] >> 4, f[l++] = r & 255), u === 1 && (r = O[n.charCodeAt(x)] << 10 | O[n.charCodeAt(x + 1)] << 4 | O[n.charCodeAt(x + 2)] >> 2, f[l++] = r >> 8 & 255, f[l++] = r & 255), f;
+    r = O[n.charCodeAt(x)] << 18 | O[n.charCodeAt(x + 1)] << 12 | O[n.charCodeAt(x + 2)] << 6 | O[n.charCodeAt(x + 3)], u[l++] = r >> 16 & 255, u[l++] = r >> 8 & 255, u[l++] = r & 255;
+  return f === 2 && (r = O[n.charCodeAt(x)] << 2 | O[n.charCodeAt(x + 1)] >> 4, u[l++] = r & 255), f === 1 && (r = O[n.charCodeAt(x)] << 10 | O[n.charCodeAt(x + 1)] << 4 | O[n.charCodeAt(x + 2)] >> 2, u[l++] = r >> 8 & 255, u[l++] = r & 255), u;
 }
 function ni(n) {
   return D[n >> 18 & 63] + D[n >> 12 & 63] + D[n >> 6 & 63] + D[n & 63];
 }
 function oi(n, r, p) {
-  for (var c, u = [], f = r; f < p; f += 3)
-    c = (n[f] << 16 & 16711680) + (n[f + 1] << 8 & 65280) + (n[f + 2] & 255), u.push(ni(c));
-  return u.join("");
+  for (var c, f = [], u = r; u < p; u += 3)
+    c = (n[u] << 16 & 16711680) + (n[u + 1] << 8 & 65280) + (n[u + 2] & 255), f.push(ni(c));
+  return f.join("");
 }
 function ai(n) {
-  for (var r, p = n.length, c = p % 3, u = [], f = 16383, l = 0, a = p - c; l < a; l += f)
-    u.push(oi(n, l, l + f > a ? a : l + f));
-  return c === 1 ? (r = n[p - 1], u.push(
+  for (var r, p = n.length, c = p % 3, f = [], u = 16383, l = 0, a = p - c; l < a; l += u)
+    f.push(oi(n, l, l + u > a ? a : l + u));
+  return c === 1 ? (r = n[p - 1], f.push(
     D[r >> 2] + D[r << 4 & 63] + "=="
-  )) : c === 2 && (r = (n[p - 2] << 8) + n[p - 1], u.push(
+  )) : c === 2 && (r = (n[p - 2] << 8) + n[p - 1], f.push(
     D[r >> 10] + D[r >> 4 & 63] + D[r << 2 & 63] + "="
-  )), u.join("");
+  )), f.join("");
 }
 var dt = {};
 /*! ieee754. BSD-3-Clause License. Feross Aboukhadijeh <https://feross.org/opensource> */
-dt.read = function(n, r, p, c, u) {
-  var f, l, a = u * 8 - c - 1, x = (1 << a) - 1, d = x >> 1, v = -7, g = p ? u - 1 : 0, y = p ? -1 : 1, b = n[r + g];
-  for (g += y, f = b & (1 << -v) - 1, b >>= -v, v += a; v > 0; f = f * 256 + n[r + g], g += y, v -= 8)
+dt.read = function(n, r, p, c, f) {
+  var u, l, a = f * 8 - c - 1, x = (1 << a) - 1, d = x >> 1, v = -7, g = p ? f - 1 : 0, y = p ? -1 : 1, b = n[r + g];
+  for (g += y, u = b & (1 << -v) - 1, b >>= -v, v += a; v > 0; u = u * 256 + n[r + g], g += y, v -= 8)
     ;
-  for (l = f & (1 << -v) - 1, f >>= -v, v += c; v > 0; l = l * 256 + n[r + g], g += y, v -= 8)
+  for (l = u & (1 << -v) - 1, u >>= -v, v += c; v > 0; l = l * 256 + n[r + g], g += y, v -= 8)
     ;
-  if (f === 0)
-    f = 1 - d;
+  if (u === 0)
+    u = 1 - d;
   else {
-    if (f === x)
+    if (u === x)
       return l ? NaN : (b ? -1 : 1) * (1 / 0);
-    l = l + Math.pow(2, c), f = f - d;
+    l = l + Math.pow(2, c), u = u - d;
   }
-  return (b ? -1 : 1) * l * Math.pow(2, f - c);
+  return (b ? -1 : 1) * l * Math.pow(2, u - c);
 };
-dt.write = function(n, r, p, c, u, f) {
-  var l, a, x, d = f * 8 - u - 1, v = (1 << d) - 1, g = v >> 1, y = u === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, b = c ? 0 : f - 1, E = c ? 1 : -1, U = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
-  for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (a = isNaN(r) ? 1 : 0, l = v) : (l = Math.floor(Math.log(r) / Math.LN2), r * (x = Math.pow(2, -l)) < 1 && (l--, x *= 2), l + g >= 1 ? r += y / x : r += y * Math.pow(2, 1 - g), r * x >= 2 && (l++, x /= 2), l + g >= v ? (a = 0, l = v) : l + g >= 1 ? (a = (r * x - 1) * Math.pow(2, u), l = l + g) : (a = r * Math.pow(2, g - 1) * Math.pow(2, u), l = 0)); u >= 8; n[p + b] = a & 255, b += E, a /= 256, u -= 8)
+dt.write = function(n, r, p, c, f, u) {
+  var l, a, x, d = u * 8 - f - 1, v = (1 << d) - 1, g = v >> 1, y = f === 23 ? Math.pow(2, -24) - Math.pow(2, -77) : 0, b = c ? 0 : u - 1, E = c ? 1 : -1, U = r < 0 || r === 0 && 1 / r < 0 ? 1 : 0;
+  for (r = Math.abs(r), isNaN(r) || r === 1 / 0 ? (a = isNaN(r) ? 1 : 0, l = v) : (l = Math.floor(Math.log(r) / Math.LN2), r * (x = Math.pow(2, -l)) < 1 && (l--, x *= 2), l + g >= 1 ? r += y / x : r += y * Math.pow(2, 1 - g), r * x >= 2 && (l++, x /= 2), l + g >= v ? (a = 0, l = v) : l + g >= 1 ? (a = (r * x - 1) * Math.pow(2, f), l = l + g) : (a = r * Math.pow(2, g - 1) * Math.pow(2, f), l = 0)); f >= 8; n[p + b] = a & 255, b += E, a /= 256, f -= 8)
     ;
-  for (l = l << u | a, d += u; d > 0; n[p + b] = l & 255, b += E, l /= 256, d -= 8)
+  for (l = l << f | a, d += f; d > 0; n[p + b] = l & 255, b += E, l /= 256, d -= 8)
     ;
   n[p + b - E] |= U * 128;
 };
@@ -471,11 +496,11 @@ dt.write = function(n, r, p, c, u, f) {
 (function(n) {
   var r = tt, p = dt, c = typeof Symbol == "function" && typeof Symbol.for == "function" ? Symbol.for("nodejs.util.inspect.custom") : null;
   n.Buffer = a, n.SlowBuffer = G, n.INSPECT_MAX_BYTES = 50;
-  var u = 2147483647;
-  n.kMaxLength = u, a.TYPED_ARRAY_SUPPORT = f(), !a.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
+  var f = 2147483647;
+  n.kMaxLength = f, a.TYPED_ARRAY_SUPPORT = u(), !a.TYPED_ARRAY_SUPPORT && typeof console < "u" && typeof console.error == "function" && console.error(
     "This browser lacks typed array (Uint8Array) support which is required by `buffer` v5.x. Use `buffer` v4.x if you require old browser support."
   );
-  function f() {
+  function u() {
     try {
       var i = new Uint8Array(1), t = { foo: function() {
         return 42;
@@ -499,7 +524,7 @@ dt.write = function(n, r, p, c, u, f) {
     }
   });
   function l(i) {
-    if (i > u)
+    if (i > f)
       throw new RangeError('The value "' + i + '" is invalid for option "size"');
     var t = new Uint8Array(i);
     return Object.setPrototypeOf(t, a.prototype), t;
@@ -562,7 +587,7 @@ dt.write = function(n, r, p, c, u, f) {
     return v(i, t, e);
   };
   function g(i) {
-    return d(i), l(i < 0 ? 0 : $(i) | 0);
+    return d(i), l(i < 0 ? 0 : q(i) | 0);
   }
   a.allocUnsafe = function(i) {
     return g(i);
@@ -576,7 +601,7 @@ dt.write = function(n, r, p, c, u, f) {
     return s !== e && (o = o.slice(0, s)), o;
   }
   function b(i) {
-    for (var t = i.length < 0 ? 0 : $(i.length) | 0, e = l(t), o = 0; o < t; o += 1)
+    for (var t = i.length < 0 ? 0 : q(i.length) | 0, e = l(t), o = 0; o < t; o += 1)
       e[o] = i[o] & 255;
     return e;
   }
@@ -597,7 +622,7 @@ dt.write = function(n, r, p, c, u, f) {
   }
   function R(i) {
     if (a.isBuffer(i)) {
-      var t = $(i.length) | 0, e = l(t);
+      var t = q(i.length) | 0, e = l(t);
       return e.length === 0 || i.copy(e, 0, 0, t), e;
     }
     if (i.length !== void 0)
@@ -605,9 +630,9 @@ dt.write = function(n, r, p, c, u, f) {
     if (i.type === "Buffer" && Array.isArray(i.data))
       return b(i.data);
   }
-  function $(i) {
-    if (i >= u)
-      throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + u.toString(16) + " bytes");
+  function q(i) {
+    if (i >= f)
+      throw new RangeError("Attempt to allocate Buffer larger than maximum size: 0x" + f.toString(16) + " bytes");
     return i | 0;
   }
   function G(i) {
@@ -788,9 +813,9 @@ dt.write = function(n, r, p, c, u, f) {
       return 1;
     if (e >>>= 0, o >>>= 0, s >>>= 0, m >>>= 0, this === t)
       return 0;
-    for (var h = m - s, _ = o - e, F = Math.min(h, _), A = this.slice(s, m), B = t.slice(e, o), S = 0; S < F; ++S)
-      if (A[S] !== B[S]) {
-        h = A[S], _ = B[S];
+    for (var h = m - s, _ = o - e, F = Math.min(h, _), k = this.slice(s, m), B = t.slice(e, o), A = 0; A < F; ++A)
+      if (k[A] !== B[A]) {
+        h = k[A], _ = B[A];
         break;
       }
     return h < _ ? -1 : _ < h ? 1 : 0;
@@ -823,24 +848,24 @@ dt.write = function(n, r, p, c, u, f) {
     function F(jt, It) {
       return m === 1 ? jt[It] : jt.readUInt16BE(It * m);
     }
-    var A;
+    var k;
     if (s) {
       var B = -1;
-      for (A = e; A < h; A++)
-        if (F(i, A) === F(t, B === -1 ? 0 : A - B)) {
-          if (B === -1 && (B = A), A - B + 1 === _)
+      for (k = e; k < h; k++)
+        if (F(i, k) === F(t, B === -1 ? 0 : k - B)) {
+          if (B === -1 && (B = k), k - B + 1 === _)
             return B * m;
         } else
-          B !== -1 && (A -= A - B), B = -1;
+          B !== -1 && (k -= k - B), B = -1;
     } else
-      for (e + _ > h && (e = h - _), A = e; A >= 0; A--) {
-        for (var S = !0, V = 0; V < _; V++)
-          if (F(i, A + V) !== F(t, V)) {
-            S = !1;
+      for (e + _ > h && (e = h - _), k = e; k >= 0; k--) {
+        for (var A = !0, V = 0; V < _; V++)
+          if (F(i, k + V) !== F(t, V)) {
+            A = !1;
             break;
           }
-        if (S)
-          return A;
+        if (A)
+          return k;
       }
     return -1;
   }
@@ -869,13 +894,13 @@ dt.write = function(n, r, p, c, u, f) {
     return K(rt(t, i.length - e), i, e, o);
   }
   function xe(i, t, e, o) {
-    return K(Se(t), i, e, o);
+    return K(Ae(t), i, e, o);
   }
   function de(i, t, e, o) {
     return K(Bt(t), i, e, o);
   }
   function we(i, t, e, o) {
-    return K(ke(t, i.length - e), i, e, o);
+    return K(Se(t, i.length - e), i, e, o);
   }
   a.prototype.write = function(t, e, o, s) {
     if (e === void 0)
@@ -929,19 +954,19 @@ dt.write = function(n, r, p, c, u, f) {
     for (var o = [], s = t; s < e; ) {
       var m = i[s], h = null, _ = m > 239 ? 4 : m > 223 ? 3 : m > 191 ? 2 : 1;
       if (s + _ <= e) {
-        var F, A, B, S;
+        var F, k, B, A;
         switch (_) {
           case 1:
             m < 128 && (h = m);
             break;
           case 2:
-            F = i[s + 1], (F & 192) === 128 && (S = (m & 31) << 6 | F & 63, S > 127 && (h = S));
+            F = i[s + 1], (F & 192) === 128 && (A = (m & 31) << 6 | F & 63, A > 127 && (h = A));
             break;
           case 3:
-            F = i[s + 1], A = i[s + 2], (F & 192) === 128 && (A & 192) === 128 && (S = (m & 15) << 12 | (F & 63) << 6 | A & 63, S > 2047 && (S < 55296 || S > 57343) && (h = S));
+            F = i[s + 1], k = i[s + 2], (F & 192) === 128 && (k & 192) === 128 && (A = (m & 15) << 12 | (F & 63) << 6 | k & 63, A > 2047 && (A < 55296 || A > 57343) && (h = A));
             break;
           case 4:
-            F = i[s + 1], A = i[s + 2], B = i[s + 3], (F & 192) === 128 && (A & 192) === 128 && (B & 192) === 128 && (S = (m & 15) << 18 | (F & 63) << 12 | (A & 63) << 6 | B & 63, S > 65535 && S < 1114112 && (h = S));
+            F = i[s + 1], k = i[s + 2], B = i[s + 3], (F & 192) === 128 && (k & 192) === 128 && (B & 192) === 128 && (A = (m & 15) << 18 | (F & 63) << 12 | (k & 63) << 6 | B & 63, A > 65535 && A < 1114112 && (h = A));
         }
       }
       h === null ? (h = 65533, _ = 1) : h > 65535 && (h -= 65536, o.push(h >>> 10 & 1023 | 55296), h = 56320 | h & 1023), o.push(h), s += _;
@@ -992,64 +1017,64 @@ dt.write = function(n, r, p, c, u, f) {
     var s = this.subarray(t, e);
     return Object.setPrototypeOf(s, a.prototype), s;
   };
-  function k(i, t, e) {
+  function S(i, t, e) {
     if (i % 1 !== 0 || i < 0)
       throw new RangeError("offset is not uint");
     if (i + t > e)
       throw new RangeError("Trying to access beyond buffer length");
   }
   a.prototype.readUintLE = a.prototype.readUIntLE = function(t, e, o) {
-    t = t >>> 0, e = e >>> 0, o || k(t, e, this.length);
+    t = t >>> 0, e = e >>> 0, o || S(t, e, this.length);
     for (var s = this[t], m = 1, h = 0; ++h < e && (m *= 256); )
       s += this[t + h] * m;
     return s;
   }, a.prototype.readUintBE = a.prototype.readUIntBE = function(t, e, o) {
-    t = t >>> 0, e = e >>> 0, o || k(t, e, this.length);
+    t = t >>> 0, e = e >>> 0, o || S(t, e, this.length);
     for (var s = this[t + --e], m = 1; e > 0 && (m *= 256); )
       s += this[t + --e] * m;
     return s;
   }, a.prototype.readUint8 = a.prototype.readUInt8 = function(t, e) {
-    return t = t >>> 0, e || k(t, 1, this.length), this[t];
+    return t = t >>> 0, e || S(t, 1, this.length), this[t];
   }, a.prototype.readUint16LE = a.prototype.readUInt16LE = function(t, e) {
-    return t = t >>> 0, e || k(t, 2, this.length), this[t] | this[t + 1] << 8;
+    return t = t >>> 0, e || S(t, 2, this.length), this[t] | this[t + 1] << 8;
   }, a.prototype.readUint16BE = a.prototype.readUInt16BE = function(t, e) {
-    return t = t >>> 0, e || k(t, 2, this.length), this[t] << 8 | this[t + 1];
+    return t = t >>> 0, e || S(t, 2, this.length), this[t] << 8 | this[t + 1];
   }, a.prototype.readUint32LE = a.prototype.readUInt32LE = function(t, e) {
-    return t = t >>> 0, e || k(t, 4, this.length), (this[t] | this[t + 1] << 8 | this[t + 2] << 16) + this[t + 3] * 16777216;
+    return t = t >>> 0, e || S(t, 4, this.length), (this[t] | this[t + 1] << 8 | this[t + 2] << 16) + this[t + 3] * 16777216;
   }, a.prototype.readUint32BE = a.prototype.readUInt32BE = function(t, e) {
-    return t = t >>> 0, e || k(t, 4, this.length), this[t] * 16777216 + (this[t + 1] << 16 | this[t + 2] << 8 | this[t + 3]);
+    return t = t >>> 0, e || S(t, 4, this.length), this[t] * 16777216 + (this[t + 1] << 16 | this[t + 2] << 8 | this[t + 3]);
   }, a.prototype.readIntLE = function(t, e, o) {
-    t = t >>> 0, e = e >>> 0, o || k(t, e, this.length);
+    t = t >>> 0, e = e >>> 0, o || S(t, e, this.length);
     for (var s = this[t], m = 1, h = 0; ++h < e && (m *= 256); )
       s += this[t + h] * m;
     return m *= 128, s >= m && (s -= Math.pow(2, 8 * e)), s;
   }, a.prototype.readIntBE = function(t, e, o) {
-    t = t >>> 0, e = e >>> 0, o || k(t, e, this.length);
+    t = t >>> 0, e = e >>> 0, o || S(t, e, this.length);
     for (var s = e, m = 1, h = this[t + --s]; s > 0 && (m *= 256); )
       h += this[t + --s] * m;
     return m *= 128, h >= m && (h -= Math.pow(2, 8 * e)), h;
   }, a.prototype.readInt8 = function(t, e) {
-    return t = t >>> 0, e || k(t, 1, this.length), this[t] & 128 ? (255 - this[t] + 1) * -1 : this[t];
+    return t = t >>> 0, e || S(t, 1, this.length), this[t] & 128 ? (255 - this[t] + 1) * -1 : this[t];
   }, a.prototype.readInt16LE = function(t, e) {
-    t = t >>> 0, e || k(t, 2, this.length);
+    t = t >>> 0, e || S(t, 2, this.length);
     var o = this[t] | this[t + 1] << 8;
     return o & 32768 ? o | 4294901760 : o;
   }, a.prototype.readInt16BE = function(t, e) {
-    t = t >>> 0, e || k(t, 2, this.length);
+    t = t >>> 0, e || S(t, 2, this.length);
     var o = this[t + 1] | this[t] << 8;
     return o & 32768 ? o | 4294901760 : o;
   }, a.prototype.readInt32LE = function(t, e) {
-    return t = t >>> 0, e || k(t, 4, this.length), this[t] | this[t + 1] << 8 | this[t + 2] << 16 | this[t + 3] << 24;
+    return t = t >>> 0, e || S(t, 4, this.length), this[t] | this[t + 1] << 8 | this[t + 2] << 16 | this[t + 3] << 24;
   }, a.prototype.readInt32BE = function(t, e) {
-    return t = t >>> 0, e || k(t, 4, this.length), this[t] << 24 | this[t + 1] << 16 | this[t + 2] << 8 | this[t + 3];
+    return t = t >>> 0, e || S(t, 4, this.length), this[t] << 24 | this[t + 1] << 16 | this[t + 2] << 8 | this[t + 3];
   }, a.prototype.readFloatLE = function(t, e) {
-    return t = t >>> 0, e || k(t, 4, this.length), p.read(this, t, !0, 23, 4);
+    return t = t >>> 0, e || S(t, 4, this.length), p.read(this, t, !0, 23, 4);
   }, a.prototype.readFloatBE = function(t, e) {
-    return t = t >>> 0, e || k(t, 4, this.length), p.read(this, t, !1, 23, 4);
+    return t = t >>> 0, e || S(t, 4, this.length), p.read(this, t, !1, 23, 4);
   }, a.prototype.readDoubleLE = function(t, e) {
-    return t = t >>> 0, e || k(t, 8, this.length), p.read(this, t, !0, 52, 8);
+    return t = t >>> 0, e || S(t, 8, this.length), p.read(this, t, !0, 52, 8);
   }, a.prototype.readDoubleBE = function(t, e) {
-    return t = t >>> 0, e || k(t, 8, this.length), p.read(this, t, !1, 52, 8);
+    return t = t >>> 0, e || S(t, 8, this.length), p.read(this, t, !1, 52, 8);
   };
   function j(i, t, e, o, s, m) {
     if (!a.isBuffer(i))
@@ -1116,27 +1141,27 @@ dt.write = function(n, r, p, c, u, f) {
   }, a.prototype.writeInt32BE = function(t, e, o) {
     return t = +t, e = e >>> 0, o || j(this, t, e, 4, 2147483647, -2147483648), t < 0 && (t = 4294967295 + t + 1), this[e] = t >>> 24, this[e + 1] = t >>> 16, this[e + 2] = t >>> 8, this[e + 3] = t & 255, e + 4;
   };
-  function At(i, t, e, o, s, m) {
+  function kt(i, t, e, o, s, m) {
     if (e + o > i.length)
       throw new RangeError("Index out of range");
     if (e < 0)
       throw new RangeError("Index out of range");
   }
-  function St(i, t, e, o, s) {
-    return t = +t, e = e >>> 0, s || At(i, t, e, 4), p.write(i, t, e, o, 23, 4), e + 4;
+  function At(i, t, e, o, s) {
+    return t = +t, e = e >>> 0, s || kt(i, t, e, 4), p.write(i, t, e, o, 23, 4), e + 4;
   }
   a.prototype.writeFloatLE = function(t, e, o) {
-    return St(this, t, e, !0, o);
+    return At(this, t, e, !0, o);
   }, a.prototype.writeFloatBE = function(t, e, o) {
-    return St(this, t, e, !1, o);
+    return At(this, t, e, !1, o);
   };
-  function kt(i, t, e, o, s) {
-    return t = +t, e = e >>> 0, s || At(i, t, e, 8), p.write(i, t, e, o, 52, 8), e + 8;
+  function St(i, t, e, o, s) {
+    return t = +t, e = e >>> 0, s || kt(i, t, e, 8), p.write(i, t, e, o, 52, 8), e + 8;
   }
   a.prototype.writeDoubleLE = function(t, e, o) {
-    return kt(this, t, e, !0, o);
+    return St(this, t, e, !0, o);
   }, a.prototype.writeDoubleBE = function(t, e, o) {
-    return kt(this, t, e, !1, o);
+    return St(this, t, e, !1, o);
   }, a.prototype.copy = function(t, e, o, s) {
     if (!a.isBuffer(t))
       throw new TypeError("argument should be a Buffer");
@@ -1186,7 +1211,7 @@ dt.write = function(n, r, p, c, u, f) {
     return this;
   };
   var Fe = /[^+/0-9A-Za-z-_]/g;
-  function Ae(i) {
+  function ke(i) {
     if (i = i.split("=")[0], i = i.trim().replace(Fe, ""), i.length < 2)
       return "";
     for (; i.length % 4 !== 0; )
@@ -1248,18 +1273,18 @@ dt.write = function(n, r, p, c, u, f) {
     }
     return m;
   }
-  function Se(i) {
+  function Ae(i) {
     for (var t = [], e = 0; e < i.length; ++e)
       t.push(i.charCodeAt(e) & 255);
     return t;
   }
-  function ke(i, t) {
+  function Se(i, t) {
     for (var e, o, s, m = [], h = 0; h < i.length && !((t -= 2) < 0); ++h)
       e = i.charCodeAt(h), o = e >> 8, s = e % 256, m.push(s), m.push(o);
     return m;
   }
   function Bt(i) {
-    return r.toByteArray(Ae(i));
+    return r.toByteArray(ke(i));
   }
   function K(i, t, e, o) {
     for (var s = 0; s < o && !(s + e >= t.length || s >= i.length); ++s)
@@ -1282,28 +1307,28 @@ dt.write = function(n, r, p, c, u, f) {
 /*! safe-buffer. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
 (function(n, r) {
   var p = Vt, c = p.Buffer;
-  function u(l, a) {
+  function f(l, a) {
     for (var x in l)
       a[x] = l[x];
   }
-  c.from && c.alloc && c.allocUnsafe && c.allocUnsafeSlow ? n.exports = p : (u(p, r), r.Buffer = f);
-  function f(l, a, x) {
+  c.from && c.alloc && c.allocUnsafe && c.allocUnsafeSlow ? n.exports = p : (f(p, r), r.Buffer = u);
+  function u(l, a, x) {
     return c(l, a, x);
   }
-  f.prototype = Object.create(c.prototype), u(c, f), f.from = function(l, a, x) {
+  u.prototype = Object.create(c.prototype), f(c, u), u.from = function(l, a, x) {
     if (typeof l == "number")
       throw new TypeError("Argument must not be a number");
     return c(l, a, x);
-  }, f.alloc = function(l, a, x) {
+  }, u.alloc = function(l, a, x) {
     if (typeof l != "number")
       throw new TypeError("Argument must be a number");
     var d = c(l);
     return a !== void 0 ? typeof x == "string" ? d.fill(a, x) : d.fill(a) : d.fill(0), d;
-  }, f.allocUnsafe = function(l) {
+  }, u.allocUnsafe = function(l) {
     if (typeof l != "number")
       throw new TypeError("Argument must be a number");
     return c(l);
-  }, f.allocUnsafeSlow = function(l) {
+  }, u.allocUnsafeSlow = function(l) {
     if (typeof l != "number")
       throw new TypeError("Argument must be a number");
     return p.SlowBuffer(l);
@@ -1315,12 +1340,12 @@ function et(n, r) {
 }
 et.prototype.update = function(n, r) {
   typeof n == "string" && (r = r || "utf8", n = te.from(n, r));
-  for (var p = this._block, c = this._blockSize, u = n.length, f = this._len, l = 0; l < u; ) {
-    for (var a = f % c, x = Math.min(u - l, c - a), d = 0; d < x; d++)
+  for (var p = this._block, c = this._blockSize, f = n.length, u = this._len, l = 0; l < f; ) {
+    for (var a = u % c, x = Math.min(f - l, c - a), d = 0; d < x; d++)
       p[a + d] = n[l + d];
-    f += x, l += x, f % c === 0 && this._update(p);
+    u += x, l += x, u % c === 0 && this._update(p);
   }
-  return this._len += u, this;
+  return this._len += f, this;
 };
 et.prototype.digest = function(n) {
   var r = this._len % this._blockSize;
@@ -1329,12 +1354,12 @@ et.prototype.digest = function(n) {
   if (p <= 4294967295)
     this._block.writeUInt32BE(p, this._blockSize - 4);
   else {
-    var c = (p & 4294967295) >>> 0, u = (p - c) / 4294967296;
-    this._block.writeUInt32BE(u, this._blockSize - 8), this._block.writeUInt32BE(c, this._blockSize - 4);
+    var c = (p & 4294967295) >>> 0, f = (p - c) / 4294967296;
+    this._block.writeUInt32BE(f, this._blockSize - 8), this._block.writeUInt32BE(c, this._blockSize - 4);
   }
   this._update(this._block);
-  var f = this._hash();
-  return n ? f.toString(n) : f;
+  var u = this._hash();
+  return n ? u.toString(n) : u;
 };
 et.prototype._update = function() {
   throw new Error("_update must be implemented by subclass");
@@ -1365,15 +1390,15 @@ function xi(n, r, p, c) {
   return n === 0 ? r & p | ~r & c : n === 2 ? r & p | r & c | p & c : r ^ p ^ c;
 }
 Y.prototype._update = function(n) {
-  for (var r = this._w, p = this._a | 0, c = this._b | 0, u = this._c | 0, f = this._d | 0, l = this._e | 0, a = 0; a < 16; ++a)
+  for (var r = this._w, p = this._a | 0, c = this._b | 0, f = this._c | 0, u = this._d | 0, l = this._e | 0, a = 0; a < 16; ++a)
     r[a] = n.readInt32BE(a * 4);
   for (; a < 80; ++a)
     r[a] = fi(r[a - 3] ^ r[a - 8] ^ r[a - 14] ^ r[a - 16]);
   for (var x = 0; x < 80; ++x) {
-    var d = ~~(x / 20), v = mi(p) + xi(d, c, u, f) + l + r[x] + li[d] | 0;
-    l = f, f = u, u = hi(c), c = p, p = v;
+    var d = ~~(x / 20), v = mi(p) + xi(d, c, f, u) + l + r[x] + li[d] | 0;
+    l = u, u = f, f = hi(c), c = p, p = v;
   }
-  this._a = p + this._a | 0, this._b = c + this._b | 0, this._c = u + this._c | 0, this._d = f + this._d | 0, this._e = l + this._e | 0;
+  this._a = p + this._a | 0, this._b = c + this._b | 0, this._c = f + this._c | 0, this._d = u + this._d | 0, this._e = l + this._e | 0;
 };
 Y.prototype._hash = function() {
   var n = ci.allocUnsafe(20);
@@ -1407,27 +1432,27 @@ function Ei(n) {
   return n.type === We && n.skip !== void 0 && n.skip > 0 && n.hash !== void 0;
 }
 function Ot(n) {
-  return [z, P].includes(n.type);
+  return [z, $].includes(n.type);
 }
 function Ut(n) {
-  return [Yt, z, P, Z, Gt].includes(n.type);
+  return [Yt, z, $, Z, Gt].includes(n.type);
 }
-function q(n, r, p, c, u = "global") {
+function P(n, r, p, c, f = "global") {
   if (!n)
     throw new Error("Empty action type");
   if (typeof n != "string")
     throw new Error(`Invalid action type: ${n}`);
-  const f = { type: n, input: r, scope: u };
-  p && (f.attachments = p);
+  const u = { type: n, input: r, scope: f };
+  p && (u.attachments = p);
   try {
-    c == null || c().parse(f.input);
+    c == null || c().parse(u.input);
   } catch (l) {
     throw new Error(`Invalid action input: ${l}`);
   }
-  return f;
+  return u;
 }
 function _i(n, r = Kt) {
-  return (p, c, u, f) => r(p, c, n, u, f);
+  return (p, c, f, u) => r(p, c, n, f, u);
 }
 const Fi = (n, r) => ({
   name: "",
@@ -1441,7 +1466,7 @@ const Fi = (n, r) => ({
   attachments: {},
   ...n,
   state: (r == null ? void 0 : r(n == null ? void 0 : n.state)) ?? (n == null ? void 0 : n.state) ?? { global: {}, local: {} }
-}), Ai = (n, r) => {
+}), ki = (n, r) => {
   const p = Fi(
     n,
     r
@@ -1452,20 +1477,20 @@ const Fi = (n, r) => ({
     operations: { global: [], local: [] },
     clipboard: []
   };
-}, re = (n, r = "global") => it(pt(n.state[r])), zi = (n, r = 1e3) => {
+}, re = (n, r = "global") => it(pt(n.state[r])), $i = (n, r = 1e3) => {
   const p = Math.random() * r;
   return it(`${(n ?? /* @__PURE__ */ new Date()).toISOString()}${p}`);
 };
 function Q(n) {
   return Oe(Ue(n, !0));
 }
-function Si(n, r) {
+function Ai(n, r) {
   const p = [...n];
-  let c = r || 0, u = p.length > 0 ? p[p.length - 1].index : 0;
-  const f = [];
+  let c = r || 0, f = p.length > 0 ? p[p.length - 1].index : 0;
+  const u = [];
   for (const l of p.reverse()) {
     if (c > 0) {
-      const d = u - l.index;
+      const d = f - l.index;
       c -= d;
     }
     if (c < 0)
@@ -1478,51 +1503,63 @@ function Si(n, r) {
       const d = x - c;
       c = c + d;
     }
-    u = l.index, f.push(a);
+    f = l.index, u.push(a);
+  }
+  return u.reverse();
+}
+function Si(n, r, p) {
+  const c = n.slice().sort((a, x) => a.skip - x.skip).sort((a, x) => a.index - x.index);
+  let f = p, u = 0, l = r;
+  for (const a of c.reverse()) {
+    const x = l - a.index;
+    if (f = f - x, f > -1)
+      u++, l = a.index;
+    else
+      break;
   }
-  return f.reverse();
+  return u;
 }
 function Pi(n) {
   return Object.values(n).flatMap((r) => r).sort(
     (r, p) => new Date(r.timestamp).getTime() - new Date(p.timestamp).getTime()
   );
 }
-function ki(n) {
+function Bi(n) {
   return Object.values(n).flatMap((r) => r).sort(
     (r, p) => new Date(r.operation.timestamp).getTime() - new Date(p.operation.timestamp).getTime()
   );
 }
-function lt(n, r, p, c, u, f = Kt, l = {}) {
-  const a = _i(p, f);
+function lt(n, r, p, c, f, u = Kt, l = {}) {
+  const a = _i(p, u);
   return ne(
     n,
     r,
     a,
     c,
-    u,
+    f,
     l
   );
 }
-function ne(n, r, p, c, u, f = {}) {
-  const l = Ai(n), a = Object.keys(r).reduce((y, b) => {
+function ne(n, r, p, c, f, u = {}) {
+  const l = ki(n), a = Object.keys(r).reduce((y, b) => {
     const E = b;
     return {
       ...y,
-      [E]: r[E].slice(0, u == null ? void 0 : u.revision[E])
+      [E]: r[E].slice(0, f == null ? void 0 : f.revision[E])
     };
   }, {}), x = Object.keys(a).reduce(
     (y, b) => {
       const E = b;
       return {
         ...y,
-        [E]: Si(
+        [E]: Ai(
           a[E],
-          f[E]
+          u[E]
         )
       };
     },
     {}
-  ), d = ki(x).reduce(
+  ), d = Bi(x).reduce(
     (y, { ignore: b, operation: E }) => b ? p(y, yt(E.scope), c, {
       skip: E.skip,
       ignoreSkipOperations: !0
@@ -1535,15 +1572,15 @@ function ne(n, r, p, c, u, f = {}) {
     d.operations
   ).reduce(
     (y, b) => {
-      const E = b, U = u && u.revision[E] < r[E].length ? r[E].slice(u.revision[E]) : [];
+      const E = b, U = f && f.revision[E] < r[E].length ? r[E].slice(f.revision[E]) : [];
       return {
         ...y,
         [E]: [
-          ...d.operations[E].map((R, $) => {
+          ...d.operations[E].map((R, q) => {
             var G;
             return {
               ...R,
-              timestamp: ((G = r[E][$]) == null ? void 0 : G.timestamp) ?? R.timestamp
+              timestamp: ((G = r[E][q]) == null ? void 0 : G.timestamp) ?? R.timestamp
             };
           }),
           ...U
@@ -1561,36 +1598,36 @@ function ne(n, r, p, c, u, f = {}) {
 function qi(n, r) {
   return pt(n) === pt(r);
 }
-const oe = (n) => q(
+const oe = (n) => P(
   "SET_NAME",
   n,
   void 0,
   ht,
   void 0
-), ae = (n = 1, r = "global") => q(
+), ae = (n = 1, r = "global") => P(
   "UNDO",
   n,
   void 0,
   xt,
   r
-), pe = (n = 1, r = "global") => q(
+), pe = (n = 1, r = "global") => P(
   "REDO",
   n,
   void 0,
   mt,
   r
-), se = (n, r, p = "global") => q(
+), se = (n, r, p = "global") => P(
   "PRUNE",
   { start: n, end: r },
   void 0,
   ft,
   p
-), gt = (n, r) => q(
+), gt = (n, r) => P(
   "LOAD_STATE",
   { state: n, operations: r },
   void 0,
   ut
-), yt = (n = "global") => q("NOOP", {}, void 0, void 0, n), $i = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+), yt = (n = "global") => P("NOOP", {}, void 0, void 0, n), Wi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   loadState: gt,
   noop: yt,
@@ -1607,20 +1644,20 @@ var I = function(n, r, p, c) {
     throw new TypeError("Cannot read private member from an object whose class did not declare it");
   return p === "m" ? c : p === "a" ? c.call(n) : c ? c.value : r.get(n);
 }, L, W, N;
-class Bi {
+class ji {
   constructor(...r) {
     L.set(this, /* @__PURE__ */ new Map()), W.set(this, /* @__PURE__ */ new Map()), N.set(this, /* @__PURE__ */ new Map());
     for (const p of r)
       this.define(p);
   }
   define(r, p = !1) {
-    for (let [c, u] of Object.entries(r)) {
-      c = c.toLowerCase(), u = u.map((a) => a.toLowerCase()), I(this, N, "f").has(c) || I(this, N, "f").set(c, /* @__PURE__ */ new Set());
-      const f = I(this, N, "f").get(c);
+    for (let [c, f] of Object.entries(r)) {
+      c = c.toLowerCase(), f = f.map((a) => a.toLowerCase()), I(this, N, "f").has(c) || I(this, N, "f").set(c, /* @__PURE__ */ new Set());
+      const u = I(this, N, "f").get(c);
       let l = !0;
-      for (let a of u) {
+      for (let a of f) {
         const x = a.startsWith("*");
-        if (a = x ? a.slice(1) : a, f == null || f.add(a), l && I(this, W, "f").set(c, a), l = !1, x)
+        if (a = x ? a.slice(1) : a, u == null || u.add(a), l && I(this, W, "f").set(c, a), l = !1, x)
           continue;
         const d = I(this, L, "f").get(a);
         if (d && d != c && !p)
@@ -1633,8 +1670,8 @@ class Bi {
   getType(r) {
     if (typeof r != "string")
       return null;
-    const p = r.replace(/^.*[/\\]/, "").toLowerCase(), c = p.replace(/^.*\./, "").toLowerCase(), u = p.length < r.length;
-    return !(c.length < p.length - 1) && u ? null : I(this, L, "f").get(c) ?? null;
+    const p = r.replace(/^.*[/\\]/, "").toLowerCase(), c = p.replace(/^.*\./, "").toLowerCase(), f = p.length < r.length;
+    return !(c.length < p.length - 1) && f ? null : I(this, L, "f").get(c) ?? null;
   }
   getExtension(r) {
     var p;
@@ -1659,29 +1696,29 @@ class Bi {
   }
 }
 L = /* @__PURE__ */ new WeakMap(), W = /* @__PURE__ */ new WeakMap(), N = /* @__PURE__ */ new WeakMap();
-const ji = new Bi(ce)._freeze();
-function Ii(n) {
+const Ii = new ji(ce)._freeze();
+function Oi(n) {
   const r = [], p = Object.keys(n);
   for (const c of p) {
-    const u = n[c].sort((f, l) => f.index - l.index);
-    for (let f = 0; f < u.length; f++)
-      u[f].index !== f && r.push({
-        message: `Invalid operation index ${u[f].index} at position ${f}`,
+    const f = n[c].sort((u, l) => u.index - l.index);
+    for (let u = 0; u < f.length; u++)
+      f[u].index !== u && r.push({
+        message: `Invalid operation index ${f[u].index} at position ${u}`,
         details: {
-          position: f,
-          operation: u[f],
-          scope: u[f].scope
+          position: u,
+          operation: f[u],
+          scope: f[u].scope
         }
       });
   }
   return r;
 }
 const le = async (n) => {
-  const r = new Dt(), { name: p, revision: c, documentType: u, created: f, lastModified: l } = n, a = {
+  const r = new Dt(), { name: p, revision: c, documentType: f, created: u, lastModified: l } = n, a = {
     name: p,
     revision: c,
-    documentType: u,
-    created: f,
+    documentType: f,
+    created: u,
     lastModified: l
   };
   return r.file("header.json", JSON.stringify(a, null, 2)), r.file(
@@ -1695,46 +1732,46 @@ const le = async (n) => {
       comment: JSON.stringify(g)
     });
   }), r;
-}, Oi = async (n, r, p, c) => {
+}, Ui = async (n, r, p, c) => {
   await (await le(n)).generateAsync({
     type: "uint8array",
     streamFiles: !0
   });
-  const f = c ?? n.name, l = `.${p}.zip`;
+  const u = c ?? n.name, l = `.${p}.zip`;
   return gi(
     r,
-    f.endsWith(l) ? f : `${f}${l}`
+    u.endsWith(l) ? u : `${u}${l}`
   );
-}, Wi = async (n, r) => {
-  const c = await (await le(n)).generateAsync({ type: "blob" }), u = await r.createWritable();
-  await u.write(c), await u.close();
+}, Ji = async (n, r) => {
+  const c = await (await le(n)).generateAsync({ type: "blob" }), f = await r.createWritable();
+  await f.write(c), await f.close();
 }, Tt = async (n, r) => {
   const p = ie();
-  return Ui(p, r);
-}, Ui = async (n, r) => {
+  return Ti(p, r);
+}, Ti = async (n, r) => {
   const p = new Dt();
-  return await p.loadAsync(n), Ti(p, r);
+  return await p.loadAsync(n), Di(p, r);
 };
-async function Ti(n, r) {
+async function Di(n, r) {
   const p = n.file("state.json");
   if (!p)
     throw new Error("Initial state not found");
-  const c = await p.async("string"), u = JSON.parse(c), f = n.file("header.json");
+  const c = await p.async("string"), f = JSON.parse(c), u = n.file("header.json");
   let l;
-  f && (l = JSON.parse(await f.async("string")));
+  u && (l = JSON.parse(await u.async("string")));
   const a = n.file("operations.json");
   if (!a)
     throw new Error("Operations history not found");
   const x = JSON.parse(
     await a.async("string")
-  ), d = Ii(x);
+  ), d = Oi(x);
   if (d.length) {
     const g = d.map((y) => y.message);
     throw new Error(g.join(`
 `));
   }
   let v = ne(
-    u,
+    f,
     x,
     r,
     void 0,
@@ -1749,20 +1786,20 @@ function ue(n) {
   const r = n.replace(/^.*\./, "") || void 0, p = n.replace(/^.*[/\\]/, "") || void 0;
   return { extension: r, fileName: p };
 }
-async function Ji(n) {
-  const { buffer: r, mimeType: p = "application/octet-stream" } = await yi(), c = ue(n), u = r.toString("base64");
+async function Hi(n) {
+  const { buffer: r, mimeType: p = "application/octet-stream" } = await yi(), c = ue(n), f = r.toString("base64");
   return {
-    data: u,
-    hash: it(u),
+    data: f,
+    hash: it(f),
     mimeType: p,
     ...c
   };
 }
-async function Hi(n) {
-  const r = await vi(), p = ji.getType(n) || "application/octet-stream", c = ue(n), u = r.toString("base64");
-  return { data: u, hash: it(u), mimeType: p, ...c };
+async function Zi(n) {
+  const r = await vi(), p = Ii.getType(n) || "application/octet-stream", c = ue(n), f = r.toString("base64");
+  return { data: f, hash: it(f), mimeType: p, ...c };
 }
-class Zi {
+class Yi {
   /**
    * Constructs a BaseDocument instance with an initial state.
    * @param reducer - The reducer function that updates the state.
@@ -1794,7 +1831,7 @@ class Zi {
    * @returns The file path where the state was saved.
    */
   saveToFile(r, p, c) {
-    return Oi(this._document, r, p, c);
+    return Ui(this._document, r, p, c);
   }
   /**
    * Loads the state of the document from a file.
@@ -1914,7 +1951,7 @@ class Zi {
     return this.dispatch(gt(r, p)), this;
   }
 }
-function Yi(n, r) {
+function Gi(n, r) {
   r.forEach((p) => {
     Object.getOwnPropertyNames(p.prototype).forEach((c) => {
       Object.defineProperty(
@@ -1928,34 +1965,35 @@ function Yi(n, r) {
   });
 }
 export {
-  Kt as A,
-  Zi as B,
-  Ke as C,
-  Li as D,
+  Oi as A,
+  Yi as B,
+  Kt as C,
+  Ke as D,
+  zi as E,
   Fi as a,
-  Ai as b,
+  ki as b,
   _i as c,
-  Wi as d,
-  Ui as e,
-  q as f,
-  Yi as g,
-  $i as h,
+  Ji as d,
+  Ti as e,
+  P as f,
+  Gi as g,
+  Wi as h,
   Ut as i,
-  le as j,
-  Hi as k,
+  Si as j,
+  le as k,
   Tt as l,
-  Ji as m,
-  re as n,
-  zi as o,
-  Ei as p,
-  qi as q,
-  Ot as r,
-  Oi as s,
-  Si as t,
-  Q as u,
-  ne as v,
-  lt as w,
-  ki as x,
-  Pi as y,
-  Ii as z
+  Zi as m,
+  Hi as n,
+  re as o,
+  $i as p,
+  Ei as q,
+  qi as r,
+  Ui as s,
+  Ot as t,
+  Ai as u,
+  Q as v,
+  ne as w,
+  lt as x,
+  Bi as y,
+  Pi as z
 };