playhtml 2.0.14 → 2.0.16

package/dist/playhtml.es.js

@@ -45,7 +45,7 @@ var Gt = 1e6, wr = "y-pk-batch", Cn = !1, mr = (n, t) => {
 function An(n) {
   return `${wr}#${JSON.stringify(n)}`;
 }
-const R = () => /* @__PURE__ */ new Map(), Be = (n) => {
+const R = () => /* @__PURE__ */ new Map(), Ne = (n) => {
   const t = R();
   return n.forEach((e, s) => {
     t.set(s, e);
@@ -63,7 +63,7 @@ const R = () => /* @__PURE__ */ new Map(), Be = (n) => {
     if (t(s, e))
       return !0;
   return !1;
-}, lt = () => /* @__PURE__ */ new Set(), De = (n) => n[n.length - 1], kr = (n, t) => {
+}, lt = () => /* @__PURE__ */ new Set(), Ee = (n) => n[n.length - 1], kr = (n, t) => {
   for (let e = 0; e < t.length; e++)
     n.push(t[e]);
 }, tt = Array.from, _r = Array.isArray;
@@ -112,7 +112,7 @@ class fe {
     this._observers = R();
   }
 }
-const Y = Math.floor, te = Math.abs, Ge = (n, t) => n < t ? n : t, ft = (n, t) => n > t ? n : t, Sr = Math.pow, ts = (n) => n !== 0 ? n < 0 : 1 / n < 0, Dr = String.fromCharCode, Er = (n) => n.toLowerCase(), Cr = /^\s*/g, Ar = (n) => n.replace(Cr, ""), Lr = /([A-Z])/g, Ln = (n, t) => Ar(n.replace(Lr, (e) => `${t}${Er(e)}`)), Ir = (n) => {
+const Y = Math.floor, te = Math.abs, Pe = (n, t) => n < t ? n : t, ft = (n, t) => n > t ? n : t, Sr = Math.pow, ts = (n) => n !== 0 ? n < 0 : 1 / n < 0, Dr = String.fromCharCode, Er = (n) => n.toLowerCase(), Cr = /^\s*/g, Ar = (n) => n.replace(Cr, ""), Lr = /([A-Z])/g, Ln = (n, t) => Ar(n.replace(Lr, (e) => `${t}${Er(e)}`)), Ir = (n) => {
   const t = unescape(encodeURIComponent(n)), e = t.length, s = new Uint8Array(e);
   for (let r = 0; r < e; r++)
     s[r] = /** @type {number} */
@@ -143,16 +143,16 @@ class xr {
     return this.map.get(t);
   }
 }
-let es = new xr(), Pe = !0;
+let es = new xr(), qe = !0;
 try {
-  typeof localStorage < "u" && (es = localStorage, Pe = !1);
+  typeof localStorage < "u" && (es = localStorage, qe = !1);
 } catch {
 }
-const ns = es, Ur = (n) => Pe || addEventListener(
+const ns = es, Ur = (n) => qe || addEventListener(
   "storage",
   /** @type {any} */
   n
-), Tr = (n) => Pe || removeEventListener(
+), Tr = (n) => qe || removeEventListener(
   "storage",
   /** @type {any} */
   n
@@ -173,12 +173,12 @@ const ns = es, Ur = (n) => Pe || addEventListener(
     if (!t(n[e], e))
       return !1;
   return !0;
-}, ss = (n, t) => Object.prototype.hasOwnProperty.call(n, t), Hr = (n, t) => n === t || re(n) === re(t) && Vr(n, (e, s) => (e !== void 0 || ss(t, s)) && t[s] === e), qe = (n, t, e = 0) => {
+}, ss = (n, t) => Object.prototype.hasOwnProperty.call(n, t), Hr = (n, t) => n === t || re(n) === re(t) && Vr(n, (e, s) => (e !== void 0 || ss(t, s)) && t[s] === e), Ze = (n, t, e = 0) => {
   try {
     for (; e < n.length; e++)
       n[e](...t);
   } finally {
-    e < n.length && qe(n, t, e + 1);
+    e < n.length && Ze(n, t, e + 1);
   }
 }, $r = (n) => n, jr = (n, t) => n === t, xt = (n, t) => {
   if (n == null || t == null)
@@ -253,9 +253,9 @@ const zr = () => {
         }
       })) : B = R();
   return B;
-}, Ne = (n) => zr().has(n), Fe = (n) => In(_t ? process.env[n.toUpperCase()] : ns.getItem(n)), Yr = (n) => Ne("--" + n) || Fe(n) !== null;
+}, Fe = (n) => zr().has(n), Ve = (n) => In(_t ? process.env[n.toUpperCase()] : ns.getItem(n)), Yr = (n) => Fe("--" + n) || Ve(n) !== null;
 Yr("production");
-const Mn = _t && Kr(process.env.FORCE_COLOR, ["true", "1", "2"]), Xr = !Ne("no-colors") && (!_t || process.stdout.isTTY || Mn) && (!_t || Ne("color") || Mn || Fe("COLORTERM") !== null || (Fe("TERM") || "").includes("color")), vn = 1, xn = 2, Ee = 4, Ce = 8, Ot = 32, z = 64, x = 128, ge = 31, Ve = 63, it = 127, Jr = 2147483647, is = Number.MAX_SAFE_INTEGER, Wr = Number.isInteger || ((n) => typeof n == "number" && isFinite(n) && Y(n) === n), X = (n) => new Error(n), N = () => {
+const Mn = _t && Kr(process.env.FORCE_COLOR, ["true", "1", "2"]), Xr = !Fe("no-colors") && (!_t || process.stdout.isTTY || Mn) && (!_t || Fe("color") || Mn || Ve("COLORTERM") !== null || (Ve("TERM") || "").includes("color")), vn = 1, xn = 2, Ce = 4, Ae = 8, Ot = 32, z = 64, U = 128, ge = 31, He = 63, it = 127, Jr = 2147483647, is = Number.MAX_SAFE_INTEGER, Wr = Number.isInteger || ((n) => typeof n == "number" && isFinite(n) && Y(n) === n), X = (n) => new Error(n), N = () => {
   throw X("Method unimplemented");
 }, V = () => {
   throw X("Unexpected case");
@@ -269,27 +269,27 @@ class pe {
   }
 }
 const nt = (n) => new pe(n), Gr = (n) => n.pos !== n.arr.length, Pr = (n, t) => {
-  const e = tn(n.arr.buffer, n.pos + n.arr.byteOffset, t);
+  const e = en(n.arr.buffer, n.pos + n.arr.byteOffset, t);
   return n.pos += t, e;
 }, M = (n) => Pr(n, m(n)), St = (n) => n.arr[n.pos++], m = (n) => {
   let t = 0, e = 1;
   const s = n.arr.length;
   for (; n.pos < s; ) {
     const r = n.arr[n.pos++];
-    if (t = t + (r & it) * e, e *= 128, r < x)
+    if (t = t + (r & it) * e, e *= 128, r < U)
       return t;
     if (t > is)
       throw ls;
   }
   throw os;
-}, Ze = (n) => {
-  let t = n.arr[n.pos++], e = t & Ve, s = 64;
+}, Qe = (n) => {
+  let t = n.arr[n.pos++], e = t & He, s = 64;
   const r = (t & z) > 0 ? -1 : 1;
-  if (!(t & x))
+  if (!(t & U))
     return r * e;
   const i = n.arr.length;
   for (; n.pos < i; ) {
-    if (t = n.arr[n.pos++], e = e + (t & it) * s, s *= 128, t < x)
+    if (t = n.arr[n.pos++], e = e + (t & it) * s, s *= 128, t < U)
       return r * e;
     if (e > is)
       throw ls;
@@ -318,19 +318,19 @@ const nt = (n) => new pe(n), Gr = (n) => n.pos !== n.arr.length, Pr = (n, t) =>
 }, Zr = (n) => (
   /** @type any */
   vt.decode(M(n))
-), Z = vt ? Zr : qr, Qe = (n, t) => {
+), Z = vt ? Zr : qr, tn = (n, t) => {
   const e = new DataView(n.arr.buffer, n.arr.byteOffset + n.pos, t);
   return n.pos += t, e;
-}, Qr = (n) => Qe(n, 4).getFloat32(0, !1), ti = (n) => Qe(n, 8).getFloat64(0, !1), ei = (n) => (
+}, Qr = (n) => tn(n, 4).getFloat32(0, !1), ti = (n) => tn(n, 8).getFloat64(0, !1), ei = (n) => (
   /** @type {any} */
-  Qe(n, 8).getBigInt64(0, !1)
+  tn(n, 8).getBigInt64(0, !1)
 ), ni = [
   (n) => {
   },
   // CASE 127: undefined
   (n) => null,
   // CASE 126: null
-  Ze,
+  Qe,
   // CASE 125: integer
   Qr,
   // CASE 124: float32
@@ -383,7 +383,7 @@ class ee extends pe {
   }
   read() {
     if (this.count === 0) {
-      this.s = Ze(this);
+      this.s = Qe(this);
       const t = ts(this.s);
       this.count = 1, t && (this.s = -this.s, this.count = m(this) + 2);
     }
@@ -391,7 +391,7 @@ class ee extends pe {
     this.s;
   }
 }
-class Ae extends pe {
+class Le extends pe {
   /**
    * @param {Uint8Array} uint8Array
    */
@@ -403,7 +403,7 @@ class Ae extends pe {
    */
   read() {
     if (this.count === 0) {
-      const t = Ze(this), e = t & 1;
+      const t = Qe(this), e = t & 1;
       this.diff = Y(t / 2), this.count = 1, e && (this.count = m(this) + 2);
     }
     return this.s += this.diff, this.count--, this.s;
@@ -424,7 +424,7 @@ class si {
     return this.spos = t, e;
   }
 }
-const cs = (n) => new Uint8Array(n), tn = (n, t, e) => new Uint8Array(n, t, e), ri = (n) => new Uint8Array(n), ii = (n) => {
+const cs = (n) => new Uint8Array(n), en = (n, t, e) => new Uint8Array(n, t, e), ri = (n) => new Uint8Array(n), ii = (n) => {
   let t = "";
   for (let e = 0; e < n.byteLength; e++)
     t += Dr(n[e]);
@@ -446,39 +446,39 @@ class $t {
     this.cpos = 0, this.cbuf = new Uint8Array(100), this.bufs = [];
   }
 }
-const v = () => new $t(), en = (n) => {
+const v = () => new $t(), nn = (n) => {
   let t = n.cpos;
   for (let e = 0; e < n.bufs.length; e++)
     t += n.bufs[e].length;
   return t;
 }, _ = (n) => {
-  const t = new Uint8Array(en(n));
+  const t = new Uint8Array(nn(n));
   let e = 0;
   for (let s = 0; s < n.bufs.length; s++) {
     const r = n.bufs[s];
     t.set(r, e), e += r.length;
   }
-  return t.set(tn(n.cbuf.buffer, 0, n.cpos), e), t;
+  return t.set(en(n.cbuf.buffer, 0, n.cpos), e), t;
 }, di = (n, t) => {
   const e = n.cbuf.length;
-  e - n.cpos < t && (n.bufs.push(tn(n.cbuf.buffer, 0, n.cpos)), n.cbuf = new Uint8Array(ft(e, t) * 2), n.cpos = 0);
+  e - n.cpos < t && (n.bufs.push(en(n.cbuf.buffer, 0, n.cpos)), n.cbuf = new Uint8Array(ft(e, t) * 2), n.cpos = 0);
 }, A = (n, t) => {
   const e = n.cbuf.length;
   n.cpos === e && (n.bufs.push(n.cbuf), n.cbuf = new Uint8Array(e * 2), n.cpos = 0), n.cbuf[n.cpos++] = t;
-}, He = A, p = (n, t) => {
+}, $e = A, p = (n, t) => {
   for (; t > it; )
-    A(n, x | it & t), t = Y(t / 128);
+    A(n, U | it & t), t = Y(t / 128);
   A(n, it & t);
-}, nn = (n, t) => {
+}, sn = (n, t) => {
   const e = ts(t);
-  for (e && (t = -t), A(n, (t > Ve ? x : 0) | (e ? z : 0) | Ve & t), t = Y(t / 64); t > 0; )
-    A(n, (t > it ? x : 0) | it & t), t = Y(t / 128);
-}, $e = new Uint8Array(3e4), fi = $e.length / 3, gi = (n, t) => {
+  for (e && (t = -t), A(n, (t > He ? U : 0) | (e ? z : 0) | He & t), t = Y(t / 64); t > 0; )
+    A(n, (t > it ? U : 0) | it & t), t = Y(t / 128);
+}, je = new Uint8Array(3e4), fi = je.length / 3, gi = (n, t) => {
   if (t.length < fi) {
-    const e = Tt.encodeInto(t, $e).written || 0;
+    const e = Tt.encodeInto(t, je).written || 0;
     p(n, e);
     for (let s = 0; s < e; s++)
-      A(n, $e[s]);
+      A(n, je[s]);
   } else
     D(n, vr(t));
 }, pi = (n, t) => {
@@ -492,24 +492,24 @@ const v = () => new $t(), en = (n) => {
     );
 }, ot = Tt && /** @type {any} */
 Tt.encodeInto ? gi : pi, we = (n, t) => {
-  const e = n.cbuf.length, s = n.cpos, r = Ge(e - s, t.length), i = t.length - r;
+  const e = n.cbuf.length, s = n.cpos, r = Pe(e - s, t.length), i = t.length - r;
   n.cbuf.set(t.subarray(0, r), s), n.cpos += r, i > 0 && (n.bufs.push(n.cbuf), n.cbuf = new Uint8Array(ft(e * 2, i)), n.cbuf.set(t.subarray(r)), n.cpos = i);
 }, D = (n, t) => {
   p(n, t.byteLength), we(n, t);
-}, sn = (n, t) => {
+}, rn = (n, t) => {
   di(n, t);
   const e = new DataView(n.cbuf.buffer, n.cpos, t);
   return n.cpos += t, e;
-}, wi = (n, t) => sn(n, 4).setFloat32(0, t, !1), mi = (n, t) => sn(n, 8).setFloat64(0, t, !1), yi = (n, t) => (
+}, wi = (n, t) => rn(n, 4).setFloat32(0, t, !1), mi = (n, t) => rn(n, 8).setFloat64(0, t, !1), yi = (n, t) => (
   /** @type {any} */
-  sn(n, 8).setBigInt64(0, t, !1)
+  rn(n, 8).setBigInt64(0, t, !1)
 ), Tn = new DataView(new ArrayBuffer(4)), bi = (n) => (Tn.setFloat32(0, n), Tn.getFloat32(0) === n), Bt = (n, t) => {
   switch (typeof t) {
     case "string":
       A(n, 119), ot(n, t);
       break;
     case "number":
-      Wr(t) && te(t) <= Jr ? (A(n, 125), nn(n, t)) : bi(t) ? (A(n, 124), wi(n, t)) : (A(n, 123), mi(n, t));
+      Wr(t) && te(t) <= Jr ? (A(n, 125), sn(n, t)) : bi(t) ? (A(n, 124), wi(n, t)) : (A(n, 123), mi(n, t));
       break;
     case "bigint":
       A(n, 122), yi(n, t);
@@ -555,7 +555,7 @@ class On extends $t {
   }
 }
 const Rn = (n) => {
-  n.count > 0 && (nn(n.encoder, n.count === 1 ? n.s : -n.s), n.count > 1 && p(n.encoder, n.count - 2));
+  n.count > 0 && (sn(n.encoder, n.count === 1 ? n.s : -n.s), n.count > 1 && p(n.encoder, n.count - 2));
 };
 class ne {
   constructor() {
@@ -574,10 +574,10 @@ class ne {
 const Bn = (n) => {
   if (n.count > 0) {
     const t = n.diff * 2 + (n.count === 1 ? 0 : 1);
-    nn(n.encoder, t), n.count > 1 && p(n.encoder, n.count - 2);
+    sn(n.encoder, t), n.count > 1 && p(n.encoder, n.count - 2);
   }
 };
-class Le {
+class Ie {
   constructor() {
     this.encoder = new $t(), this.s = 0, this.count = 0, this.diff = 0;
   }
@@ -680,11 +680,11 @@ const Ci = (n) => yr(n, (t, e) => `${e}:${t};`).join(""), W = Symbol, hs = W(),
     e = n.next();
   while (!e.done && !t(e.value));
   return e;
-}), Ie = (n, t) => gs(() => {
+}), Me = (n, t) => gs(() => {
   const { done: e, value: s } = n.next();
   return { done: e, value: e ? void 0 : t(s) };
 });
-class rn {
+class on {
   /**
    * @param {number} clock
    * @param {number} len
@@ -722,7 +722,7 @@ const ps = (n, t, e) => t.clients.forEach((s, r) => {
 }, ws = (n, t) => {
   const e = n.clients.get(t.client);
   return e !== void 0 && Fi(e, t.clock) !== null;
-}, on = (n) => {
+}, ln = (n) => {
   n.clients.forEach((t) => {
     t.sort((r, i) => r.clock - i.clock);
     let e, s;
@@ -743,12 +743,12 @@ const ps = (n, t, e) => t.clients.forEach((s, r) => {
         t.clients.set(r, i);
       }
     });
-  return on(t), t;
+  return ln(t), t;
 }, ie = (n, t, e, s) => {
   J(n.clients, t, () => (
     /** @type {Array<DeleteItem>} */
     []
-  )).push(new rn(e, s));
+  )).push(new on(e, s));
 }, Hi = () => new jt(), $i = (n) => {
   const t = Hi();
   return n.clients.forEach((e, s) => {
@@ -761,7 +761,7 @@ const ps = (n, t, e) => t.clients.forEach((s, r) => {
         if (i + 1 < e.length)
           for (let a = e[i + 1]; i + 1 < e.length && a.deleted; a = e[++i + 1])
             c += a.length;
-        r.push(new rn(l, c));
+        r.push(new on(l, c));
       }
     }
     r.length > 0 && t.clients.set(s, r);
@@ -776,7 +776,7 @@ const ps = (n, t, e) => t.clients.forEach((s, r) => {
       n.writeDsClock(o.clock), n.writeDsLen(o.len);
     }
   });
-}, ln = (n) => {
+}, cn = (n) => {
   const t = new jt(), e = m(n.restDecoder);
   for (let s = 0; s < e; s++) {
     n.resetDsCurVal();
@@ -787,7 +787,7 @@ const ps = (n, t, e) => t.clients.forEach((s, r) => {
         []
       ));
       for (let l = 0; l < i; l++)
-        o.push(new rn(n.readDsClock(), n.readDsLen()));
+        o.push(new on(n.readDsClock(), n.readDsLen()));
     }
   }
   return t;
@@ -1144,7 +1144,7 @@ class Et extends ji {
    * @param {decoding.Decoder} decoder
    */
   constructor(t) {
-    super(t), this.keys = [], m(t), this.keyClockDecoder = new Ae(M(t)), this.clientDecoder = new ee(M(t)), this.leftClockDecoder = new Ae(M(t)), this.rightClockDecoder = new Ae(M(t)), this.infoDecoder = new Un(M(t), St), this.stringDecoder = new si(M(t)), this.parentInfoDecoder = new Un(M(t), St), this.typeRefDecoder = new ee(M(t)), this.lenDecoder = new ee(M(t));
+    super(t), this.keys = [], m(t), this.keyClockDecoder = new Le(M(t)), this.clientDecoder = new ee(M(t)), this.leftClockDecoder = new Le(M(t)), this.rightClockDecoder = new Le(M(t)), this.infoDecoder = new Un(M(t), St), this.stringDecoder = new si(M(t)), this.parentInfoDecoder = new Un(M(t), St), this.typeRefDecoder = new ee(M(t)), this.lenDecoder = new ee(M(t));
   }
   /**
    * @return {ID}
@@ -1281,7 +1281,7 @@ class Kt extends ks {
    * @param {number} info An unsigned 8-bit integer
    */
   writeInfo(t) {
-    He(this.restEncoder, t);
+    $e(this.restEncoder, t);
   }
   /**
    * @param {string} s
@@ -1360,7 +1360,7 @@ class _s {
 }
 class at extends _s {
   constructor() {
-    super(), this.keyMap = /* @__PURE__ */ new Map(), this.keyClock = 0, this.keyClockEncoder = new Le(), this.clientEncoder = new ne(), this.leftClockEncoder = new Le(), this.rightClockEncoder = new Le(), this.infoEncoder = new On(He), this.stringEncoder = new ki(), this.parentInfoEncoder = new On(He), this.typeRefEncoder = new ne(), this.lenEncoder = new ne();
+    super(), this.keyMap = /* @__PURE__ */ new Map(), this.keyClock = 0, this.keyClockEncoder = new Ie(), this.clientEncoder = new ne(), this.leftClockEncoder = new Ie(), this.rightClockEncoder = new Ie(), this.infoEncoder = new On($e), this.stringEncoder = new ki(), this.parentInfoEncoder = new On($e), this.typeRefEncoder = new ne(), this.lenEncoder = new ne();
   }
   toUint8Array() {
     const t = v();
@@ -1459,7 +1459,7 @@ const Ki = (n, t, e, s) => {
   i.write(n, s - i.id.clock);
   for (let o = r + 1; o < t.length; o++)
     t[o].write(n, 0);
-}, cn = (n, t, e) => {
+}, an = (n, t, e) => {
   const s = /* @__PURE__ */ new Map();
   e.forEach((r, i) => {
     L(t, i) > r && s.set(i, r);
@@ -1485,20 +1485,20 @@ const Ki = (n, t, e, s) => {
       switch (ge & h) {
         case 0: {
           const d = n.readLen();
-          o[a] = new U(b(l, c), d), c += d;
+          o[a] = new T(b(l, c), d), c += d;
           break;
         }
         case 10: {
           const d = m(n.restDecoder);
-          o[a] = new T(b(l, c), d), c += d;
+          o[a] = new O(b(l, c), d), c += d;
           break;
         }
         default: {
-          const d = (h & (z | x)) === 0, u = new E(
+          const d = (h & (z | U)) === 0, u = new E(
             b(l, c),
             null,
             // leftd
-            (h & x) === x ? n.readLeftID() : null,
+            (h & U) === U ? n.readLeftID() : null,
             // origin
             null,
             // right
@@ -1559,7 +1559,7 @@ const Ki = (n, t, e, s) => {
     s.length = 0;
   };
   for (; ; ) {
-    if (h.constructor !== T) {
+    if (h.constructor !== O) {
       const g = J(d, h.id.client, () => L(t, h.id.client)) - h.id.clock;
       if (g < 0)
         s.push(h), a(h.id.client, h.id.clock - 1), u();
@@ -1600,10 +1600,10 @@ const Ki = (n, t, e, s) => {
   }
   if (l.clients.size > 0) {
     const f = new at();
-    return cn(f, l, /* @__PURE__ */ new Map()), p(f.restEncoder, 0), { missing: c, update: f.toUint8Array() };
+    return an(f, l, /* @__PURE__ */ new Map()), p(f.restEncoder, 0), { missing: c, update: f.toUint8Array() };
   }
   return null;
-}, Xi = (n, t) => cn(n, t.doc.store, t.beforeState), Ji = (n, t, e, s = new Et(n)) => k(t, (r) => {
+}, Xi = (n, t) => an(n, t.doc.store, t.beforeState), Ji = (n, t, e, s = new Et(n)) => k(t, (r) => {
   r.local = !1;
   let i = !1;
   const o = r.doc, l = o.store, c = zi(s, o), a = Yi(r, l, c), h = l.pendingStructs;
@@ -1641,7 +1641,7 @@ const Ki = (n, t, e, s) => {
   const r = nt(t);
   Ji(r, n, e, new s(r));
 }, Ds = (n, t, e) => Ss(n, t, e, bs), Wi = (n, t, e = /* @__PURE__ */ new Map()) => {
-  cn(n, t.store, e), At(n, $i(t.store));
+  an(n, t.store, e), At(n, $i(t.store));
 }, Gi = (n, t = new Uint8Array([0]), e = new at()) => {
   const s = Es(t);
   Wi(e, n, s);
@@ -1653,7 +1653,7 @@ const Ki = (n, t, e, s) => {
       return oe(r);
   }
   return r[0];
-}, an = (n, t) => Gi(n, t, new Kt()), Pi = (n) => {
+}, hn = (n, t) => Gi(n, t, new Kt()), Pi = (n) => {
   const t = /* @__PURE__ */ new Map(), e = m(n.restDecoder);
   for (let s = 0; s < e; s++) {
     const r = m(n.restDecoder), i = m(n.restDecoder);
@@ -1671,7 +1671,7 @@ class to {
 const Fn = () => new to(), Vn = (n, t) => n.l.push(t), Hn = (n, t) => {
   const e = n.l, s = e.length;
   n.l = e.filter((r) => t !== r), s === n.l.length && console.error("[yjs] Tried to remove event handler that doesn't exist.");
-}, As = (n, t, e) => qe(n.l, [t, e]);
+}, As = (n, t, e) => Ze(n.l, [t, e]);
 class yt {
   /**
    * @param {number} client client id
@@ -1686,8 +1686,8 @@ const Pt = (n, t) => n === t || n !== null && t !== null && n.client === t.clien
     if (e === n)
       return t;
   throw V();
-}, It = (n, t) => t === void 0 ? !n.deleted : t.sv.has(n.id.client) && (t.sv.get(n.id.client) || 0) > n.id.clock && !ws(t.ds, n.id), je = (n, t) => {
-  const e = J(n.meta, je, lt), s = n.doc.store;
+}, It = (n, t) => t === void 0 ? !n.deleted : t.sv.has(n.id.client) && (t.sv.get(n.id.client) || 0) > n.id.clock && !ws(t.ds, n.id), Ke = (n, t) => {
+  const e = J(n.meta, Ke, lt), s = n.doc.store;
   e.has(t) || (t.sv.forEach((r, i) => {
     r < L(s, i) && et(n, b(i, r));
   }), ps(n, t.ds, (r) => {
@@ -1738,10 +1738,10 @@ const me = (n) => {
 }, no = (n, t) => {
   const e = n.clients.get(t.client);
   return e[H(e, t.clock)];
-}, Me = (
+}, ve = (
   /** @type {function(StructStore,ID):Item} */
   no
-), Ke = (n, t, e) => {
+), ze = (n, t, e) => {
   const s = H(t, e), r = t[s];
   return r.id.clock < e && r instanceof E ? (t.splice(s + 1, 0, de(n, r, e - r.id.clock)), s + 1) : s;
 }, et = (n, t) => {
@@ -1749,10 +1749,10 @@ const me = (n) => {
     /** @type {Array<Item>} */
     n.doc.store.clients.get(t.client)
   );
-  return e[Ke(n, e, t.clock)];
+  return e[ze(n, e, t.clock)];
 }, $n = (n, t, e) => {
   const s = t.clients.get(e.client), r = H(s, e.clock), i = s[r];
-  return e.clock !== i.id.clock + i.length - 1 && i.constructor !== U && s.splice(r + 1, 0, de(n, i, e.clock - i.id.clock + 1)), i;
+  return e.clock !== i.id.clock + i.length - 1 && i.constructor !== T && s.splice(r + 1, 0, de(n, i, e.clock - i.id.clock + 1)), i;
 }, so = (n, t, e) => {
   const s = (
     /** @type {Array<GC|Item>} */
@@ -1763,9 +1763,9 @@ const me = (n) => {
   if (s === 0)
     return;
   const i = e + s;
-  let o = Ke(n, t, e), l;
+  let o = ze(n, t, e), l;
   do
-    l = t[o++], i < l.id.clock + l.length && Ke(n, t, i), r(l);
+    l = t[o++], i < l.id.clock + l.length && ze(n, t, i), r(l);
   while (o < t.length && t[o].id.clock < i);
 };
 class ro {
@@ -1778,7 +1778,7 @@ class ro {
     this.doc = t, this.deleteSet = new jt(), this.beforeState = me(t.store), this.afterState = /* @__PURE__ */ new Map(), this.changed = /* @__PURE__ */ new Map(), this.changedParentTypes = /* @__PURE__ */ new Map(), this._mergeStructs = [], this.origin = e, this.meta = /* @__PURE__ */ new Map(), this.local = s, this.subdocsAdded = /* @__PURE__ */ new Set(), this.subdocsRemoved = /* @__PURE__ */ new Set(), this.subdocsLoaded = /* @__PURE__ */ new Set(), this._needFormattingCleanup = !1;
   }
 }
-const jn = (n, t) => t.deleteSet.clients.size === 0 && !br(t.afterState, (e, s) => t.beforeState.get(s) !== e) ? !1 : (on(t.deleteSet), Xi(n, t), At(n, t.deleteSet), !0), Kn = (n, t, e) => {
+const jn = (n, t) => t.deleteSet.clients.size === 0 && !br(t.afterState, (e, s) => t.beforeState.get(s) !== e) ? !1 : (ln(t.deleteSet), Xi(n, t), At(n, t.deleteSet), !0), Kn = (n, t, e) => {
   const s = t._item;
   (s === null || s.id.clock < (n.beforeState.get(s.id.client) || 0) && !s.deleted) && J(n.changed, t, lt).add(e);
 }, se = (n, t) => {
@@ -1820,7 +1820,7 @@ const jn = (n, t) => t.deleteSet.clients.size === 0 && !br(t.afterState, (e, s)
       t.clients.get(s)
     );
     for (let i = e.length - 1; i >= 0; i--) {
-      const o = e[i], l = Ge(r.length - 1, 1 + H(r, o.clock + o.len - 1));
+      const o = e[i], l = Pe(r.length - 1, 1 + H(r, o.clock + o.len - 1));
       for (let c = l, a = r[c]; c > 0 && a.id.clock >= o.clock; a = r[c])
         c -= 1 + se(r, c);
     }
@@ -1829,7 +1829,7 @@ const jn = (n, t) => t.deleteSet.clients.size === 0 && !br(t.afterState, (e, s)
   if (t < n.length) {
     const e = n[t], s = e.doc, r = s.store, i = e.deleteSet, o = e._mergeStructs;
     try {
-      on(i), e.afterState = me(e.doc.store), s.emit("beforeObserverCalls", [e, s]);
+      ln(i), e.afterState = me(e.doc.store), s.emit("beforeObserverCalls", [e, s]);
       const l = [];
       e.changed.forEach(
         (c, a) => l.push(() => {
@@ -1843,7 +1843,7 @@ const jn = (n, t) => t.deleteSet.clients.size === 0 && !br(t.afterState, (e, s)
             h.currentTarget = a, h._path = null;
           }), c.sort((h, d) => h.path.length - d.path.length), As(a._dEH, c, e));
         });
-      }), l.push(() => s.emit("afterTransaction", [e, s])), qe(l, []), e._needFormattingCleanup && Ao(e);
+      }), l.push(() => s.emit("afterTransaction", [e, s])), Ze(l, []), e._needFormattingCleanup && Ao(e);
     } finally {
       s.gc && io(i, r, s.gcFilter), oo(i, r), e.afterState.forEach((h, d) => {
         const u = e.beforeState.get(d) || 0;
@@ -1900,13 +1900,13 @@ function* lo(n) {
       const l = n.readInfo();
       if (l === 10) {
         const c = m(n.restDecoder);
-        yield new T(b(r, i), c), i += c;
+        yield new O(b(r, i), c), i += c;
       } else if (ge & l) {
-        const c = (l & (z | x)) === 0, a = new E(
+        const c = (l & (z | U)) === 0, a = new E(
           b(r, i),
           null,
           // left
-          (l & x) === x ? n.readLeftID() : null,
+          (l & U) === U ? n.readLeftID() : null,
           // origin
           null,
           // right
@@ -1923,12 +1923,12 @@ function* lo(n) {
         yield a, i += a.length;
       } else {
         const c = n.readLen();
-        yield new U(b(r, i), c), i += c;
+        yield new T(b(r, i), c), i += c;
       }
     }
   }
 }
-class hn {
+class un {
   /**
    * @param {UpdateDecoderV1 | UpdateDecoderV2} decoder
    * @param {boolean} filterSkips
@@ -1942,11 +1942,11 @@ class hn {
   next() {
     do
       this.curr = this.gen.next().value || null;
-    while (this.filterSkips && this.curr !== null && this.curr.constructor === T);
+    while (this.filterSkips && this.curr !== null && this.curr.constructor === O);
     return this.curr;
   }
 }
-class un {
+class dn {
   /**
    * @param {UpdateEncoderV1 | UpdateEncoderV2} encoder
    */
@@ -1955,12 +1955,12 @@ class un {
   }
 }
 const co = (n) => oe(n, bs, Kt), ao = (n, t) => {
-  if (n.constructor === U) {
-    const { client: e, clock: s } = n.id;
-    return new U(b(e, s + t), n.length - t);
-  } else if (n.constructor === T) {
+  if (n.constructor === T) {
     const { client: e, clock: s } = n.id;
     return new T(b(e, s + t), n.length - t);
+  } else if (n.constructor === O) {
+    const { client: e, clock: s } = n.id;
+    return new O(b(e, s + t), n.length - t);
   } else {
     const e = (
       /** @type {Item} */
@@ -1981,14 +1981,14 @@ const co = (n) => oe(n, bs, Kt), ao = (n, t) => {
   if (n.length === 1)
     return n[0];
   const s = n.map((h) => new t(nt(h)));
-  let r = s.map((h) => new hn(h, !0)), i = null;
-  const o = new e(), l = new un(o);
+  let r = s.map((h) => new un(h, !0)), i = null;
+  const o = new e(), l = new dn(o);
   for (; r = r.filter((u) => u.curr !== null), r.sort(
     /** @type {function(any,any):number} */
     (u, f) => {
       if (u.curr.id.client === f.curr.id.client) {
         const g = u.curr.id.clock - f.curr.id.clock;
-        return g === 0 ? u.curr.constructor === f.curr.constructor ? 0 : u.curr.constructor === T ? 1 : -1 : g;
+        return g === 0 ? u.curr.constructor === f.curr.constructor ? 0 : u.curr.constructor === O ? 1 : -1 : g;
       } else
         return f.curr.id.client - u.curr.id.client;
     }
@@ -2011,16 +2011,16 @@ const co = (n) => oe(n, bs, Kt), ao = (n, t) => {
       if (d !== i.struct.id.client)
         P(l, i.struct, i.offset), i = { struct: u, offset: 0 }, h.next();
       else if (i.struct.id.clock + i.struct.length < u.id.clock)
-        if (i.struct.constructor === T)
+        if (i.struct.constructor === O)
           i.struct.length = u.id.clock + u.length - i.struct.id.clock;
         else {
           P(l, i.struct, i.offset);
           const g = u.id.clock - i.struct.id.clock - i.struct.length;
-          i = { struct: new T(b(d, i.struct.id.clock + i.struct.length), g), offset: 0 };
+          i = { struct: new O(b(d, i.struct.id.clock + i.struct.length), g), offset: 0 };
         }
       else {
         const g = i.struct.id.clock + i.struct.length - u.id.clock;
-        g > 0 && (i.struct.constructor === T ? i.struct.length -= g : u = ao(u, g)), i.struct.mergeWith(
+        g > 0 && (i.struct.constructor === O ? i.struct.length -= g : u = ao(u, g)), i.struct.mergeWith(
           /** @type {any} */
           u
         ) || (P(l, i.struct, i.offset), i = { struct: u, offset: 0 }, h.next());
@@ -2030,17 +2030,17 @@ const co = (n) => oe(n, bs, Kt), ao = (n, t) => {
         /** @type {Item | GC} */
         h.curr
       ), offset: 0 }, h.next();
-    for (let u = h.curr; u !== null && u.id.client === d && u.id.clock === i.struct.id.clock + i.struct.length && u.constructor !== T; u = h.next())
+    for (let u = h.curr; u !== null && u.id.client === d && u.id.clock === i.struct.id.clock + i.struct.length && u.constructor !== O; u = h.next())
       P(l, i.struct, i.offset), i = { struct: u, offset: 0 };
   }
-  i !== null && (P(l, i.struct, i.offset), i = null), dn(l);
-  const c = s.map((h) => ln(h)), a = Vi(c);
+  i !== null && (P(l, i.struct, i.offset), i = null), fn(l);
+  const c = s.map((h) => cn(h)), a = Vi(c);
   return At(o, a), o.toUint8Array();
 }, ho = (n, t, e = Et, s = at) => {
-  const r = Es(t), i = new s(), o = new un(i), l = new e(nt(n)), c = new hn(l, !1);
+  const r = Es(t), i = new s(), o = new dn(i), l = new e(nt(n)), c = new un(l, !1);
   for (; c.curr; ) {
     const h = c.curr, d = h.id.client, u = r.get(d) || 0;
-    if (c.curr.constructor === T) {
+    if (c.curr.constructor === O) {
       c.next();
       continue;
     }
@@ -2051,14 +2051,14 @@ const co = (n) => oe(n, bs, Kt), ao = (n, t) => {
       for (; c.curr && c.curr.id.client === d && c.curr.id.clock + c.curr.length <= u; )
         c.next();
   }
-  dn(o);
-  const a = ln(l);
+  fn(o);
+  const a = cn(l);
   return At(i, a), i.toUint8Array();
 }, xs = (n) => {
   n.written > 0 && (n.clientStructs.push({ written: n.written, restEncoder: _(n.encoder.restEncoder) }), n.encoder.restEncoder = v(), n.written = 0);
 }, P = (n, t, e) => {
   n.written > 0 && n.currClient !== t.id.client && xs(n), n.written === 0 && (n.currClient = t.id.client, n.encoder.writeClient(t.id.client), p(n.encoder.restEncoder, t.id.clock + e)), t.write(n.encoder, e), n.written++;
-}, dn = (n) => {
+}, fn = (n) => {
   xs(n);
   const t = n.encoder.restEncoder;
   p(t, n.clientStructs.length);
@@ -2067,11 +2067,11 @@ const co = (n) => oe(n, bs, Kt), ao = (n, t) => {
     p(t, s.written), we(t, s.restEncoder);
   }
 }, uo = (n, t, e, s) => {
-  const r = new e(nt(n)), i = new hn(r, !1), o = new s(), l = new un(o);
+  const r = new e(nt(n)), i = new un(r, !1), o = new s(), l = new dn(o);
   for (let a = i.curr; a !== null; a = i.next())
     P(l, t(a), 0);
-  dn(l);
-  const c = ln(r);
+  fn(l);
+  const c = cn(r);
   return At(o, c), o.toUint8Array();
 }, fo = (n) => uo(n, $r, Et, Kt), zn = "You must not compute changes after the event-handler fired.";
 class ye {
@@ -2131,13 +2131,13 @@ class ye {
               c = c.left;
             if (this.deletes(i))
               if (c !== null && this.deletes(c))
-                o = "delete", l = De(c.content.getContent());
+                o = "delete", l = Ee(c.content.getContent());
               else
                 return;
             else
-              c !== null && this.deletes(c) ? (o = "update", l = De(c.content.getContent())) : (o = "add", l = void 0);
+              c !== null && this.deletes(c) ? (o = "update", l = Ee(c.content.getContent())) : (o = "add", l = void 0);
           } else if (this.deletes(i))
-            o = "delete", l = De(
+            o = "delete", l = Ee(
               /** @type {Item} */
               i.content.getContent()
             );
@@ -2227,20 +2227,20 @@ const go = (n, t) => {
   }
   return e;
 }, Us = 80;
-let fn = 0;
+let gn = 0;
 class po {
   /**
    * @param {Item} p
    * @param {number} index
    */
   constructor(t, e) {
-    t.marker = !0, this.p = t, this.index = e, this.timestamp = fn++;
+    t.marker = !0, this.p = t, this.index = e, this.timestamp = gn++;
   }
 }
 const wo = (n) => {
-  n.timestamp = fn++;
+  n.timestamp = gn++;
 }, Ts = (n, t, e) => {
-  n.p.marker = !1, n.p = t, t.marker = !0, n.index = e, n.timestamp = fn++;
+  n.p.marker = !1, n.p = t, t.marker = !0, n.index = e, n.timestamp = gn++;
 }, mo = (n, t, e) => {
   if (n.length >= Us) {
     const s = n.reduce((r, i) => r.timestamp < i.timestamp ? r : i);
@@ -2554,7 +2554,7 @@ const Os = (n, t, e) => {
 }, ce = (n, t, e) => {
   const s = t._map.get(e);
   s !== void 0 && s.delete(n);
-}, gn = (n, t, e, s) => {
+}, pn = (n, t, e, s) => {
   const r = t._map.get(e) || null, i = n.doc, o = i.clientID;
   let l;
   if (s == null)
@@ -2587,7 +2587,7 @@ const Os = (n, t, e) => {
           throw new Error("Unexpected content type");
     }
   new E(b(o, L(i.store, o)), r, r && r.lastId, null, null, t, e, l).integrate(n, 0);
-}, pn = (n, t) => {
+}, wn = (n, t) => {
   const e = n._map.get(t);
   return e !== void 0 && !e.deleted ? e.content.getContent()[e.length - 1] : void 0;
 }, $s = (n) => {
@@ -2897,7 +2897,7 @@ class ht extends I {
    * @return {IterableIterator<string>}
    */
   keys() {
-    return Ie(
+    return Me(
       qt(this._map),
       /** @param {any} v */
       (t) => t[0]
@@ -2909,7 +2909,7 @@ class ht extends I {
    * @return {IterableIterator<any>}
    */
   values() {
-    return Ie(
+    return Me(
       qt(this._map),
       /** @param {any} v */
       (t) => t[1].content.getContent()[t[1].length - 1]
@@ -2921,7 +2921,7 @@ class ht extends I {
    * @return {IterableIterator<any>}
    */
   entries() {
-    return Ie(
+    return Me(
       qt(this._map),
       /** @param {any} v */
       (t) => [t[0], t[1].content.getContent()[t[1].length - 1]]
@@ -2965,7 +2965,7 @@ class ht extends I {
    */
   set(t, e) {
     return this.doc !== null ? k(this.doc, (s) => {
-      gn(
+      pn(
         s,
         this,
         t,
@@ -2983,7 +2983,7 @@ class ht extends I {
   get(t) {
     return (
       /** @type {any} */
-      pn(this, t)
+      wn(this, t)
     );
   }
   /**
@@ -3013,7 +3013,7 @@ class ht extends I {
   }
 }
 const Do = (n) => new ht(), q = (n, t) => n === t || typeof n == "object" && typeof t == "object" && n && t && Hr(n, t);
-class ze {
+class Ye {
   /**
    * @param {Item|null} left
    * @param {Item|null} right
@@ -3062,10 +3062,10 @@ const Yn = (n, t, e) => {
 }, Zt = (n, t, e) => {
   const s = /* @__PURE__ */ new Map(), r = be(t, e);
   if (r) {
-    const i = new ze(r.p.left, r.p, r.index, s);
+    const i = new Ye(r.p.left, r.p, r.index, s);
     return Yn(n, i, e - r.index);
   } else {
-    const i = new ze(null, t._start, 0, s);
+    const i = new Ye(null, t._start, 0, s);
     return Yn(n, i, e);
   }
 }, Ks = (n, t, e, s) => {
@@ -3113,7 +3113,7 @@ const Yn = (n, t, e) => {
     }
   }
   return o;
-}, ve = (n, t, e, s, r) => {
+}, xe = (n, t, e, s, r) => {
   e.currentAttributes.forEach((u, f) => {
     r[f] === void 0 && (r[f] = null);
   });
@@ -3225,7 +3225,7 @@ const Yn = (n, t, e) => {
         /** @type {Item} */
         n._start
       ), r = n._start, i = R();
-      const o = Be(i);
+      const o = Ne(i);
       for (; r; ) {
         if (r.deleted === !1)
           switch (r.content.constructor) {
@@ -3237,7 +3237,7 @@ const Yn = (n, t, e) => {
               );
               break;
             default:
-              t += Xs(e, s, r, i, o), i = Be(o), s = r;
+              t += Xs(e, s, r, i, o), i = Ne(o), s = r;
               break;
           }
         r = r.right;
@@ -3256,7 +3256,7 @@ const Yn = (n, t, e) => {
       r,
       (o) => {
         !o.deleted && /** @type {Item} */
-        o.content.constructor === C && o.constructor !== U && t.add(
+        o.content.constructor === C && o.constructor !== T && t.add(
           /** @type {any} */
           o.parent
         );
@@ -3265,7 +3265,7 @@ const Yn = (n, t, e) => {
   }
   k(e, (s) => {
     ps(n, n.deleteSet, (r) => {
-      if (r instanceof U || !/** @type {YText} */
+      if (r instanceof T || !/** @type {YText} */
       r.parent._hasFormatting || t.has(
         /** @type {YText} */
         r.parent
@@ -3281,7 +3281,7 @@ const Yn = (n, t, e) => {
       Co(r);
   });
 }, Jn = (n, t, e) => {
-  const s = e, r = Be(t.currentAttributes), i = t.right;
+  const s = e, r = Ne(t.currentAttributes), i = t.right;
   for (; e > 0 && t.right !== null; ) {
     if (t.right.deleted === !1)
       switch (t.right.content.constructor) {
@@ -3504,13 +3504,13 @@ class Ct extends I {
    */
   applyDelta(t, { sanitize: e = !0 } = {}) {
     this.doc !== null ? k(this.doc, (s) => {
-      const r = new ze(null, this._start, 0, /* @__PURE__ */ new Map());
+      const r = new Ye(null, this._start, 0, /* @__PURE__ */ new Map());
       for (let i = 0; i < t.length; i++) {
         const o = t[i];
         if (o.insert !== void 0) {
           const l = !e && typeof o.insert == "string" && i === t.length - 1 && r.right === null && o.insert.slice(-1) === `
 ` ? o.insert.slice(0, -1) : o.insert;
-          (typeof l != "string" || l.length > 0) && ve(s, this, r, l, o.attributes || {});
+          (typeof l != "string" || l.length > 0) && xe(s, this, r, l, o.attributes || {});
         } else
           o.retain !== void 0 ? Xn(s, this, r, o.retain, o.attributes || {}) : o.delete !== void 0 && Jn(s, r, o.delete);
       }
@@ -3584,7 +3584,7 @@ class Ct extends I {
       a();
     };
     return t || e ? k(o, (d) => {
-      t && je(d, t), e && je(d, e), h();
+      t && Ke(d, t), e && Ke(d, e), h();
     }, "cleanup") : h(), r;
   }
   /**
@@ -3605,7 +3605,7 @@ class Ct extends I {
       const o = Zt(i, this, t);
       s || (s = {}, o.currentAttributes.forEach((l, c) => {
         s[c] = l;
-      })), ve(i, this, o, e, s);
+      })), xe(i, this, o, e, s);
     }) : this._pending.push(() => this.insert(t, e, s));
   }
   /**
@@ -3622,7 +3622,7 @@ class Ct extends I {
     const r = this.doc;
     r !== null ? k(r, (i) => {
       const o = Zt(i, this, t);
-      ve(i, this, o, e, s);
+      xe(i, this, o, e, s);
     }) : this._pending.push(() => this.insertEmbed(t, e, s));
   }
   /**
@@ -3686,7 +3686,7 @@ class Ct extends I {
    */
   setAttribute(t, e) {
     this.doc !== null ? k(this.doc, (s) => {
-      gn(s, this, t, e);
+      pn(s, this, t, e);
     }) : this._pending.push(() => this.setAttribute(t, e));
   }
   /**
@@ -3703,7 +3703,7 @@ class Ct extends I {
   getAttribute(t) {
     return (
       /** @type {any} */
-      pn(this, t)
+      wn(this, t)
     );
   }
   /**
@@ -3726,7 +3726,7 @@ class Ct extends I {
   }
 }
 const Io = (n) => new Ct();
-class xe {
+class Ue {
   /**
    * @param {YXmlFragment | YXmlElement} root
    * @param {function(AbstractType<any>):boolean} [f]
@@ -3830,7 +3830,7 @@ class ut extends I {
    * @public
    */
   createTreeWalker(t) {
-    return new xe(this, t);
+    return new Ue(this, t);
   }
   /**
    * Returns the first YXmlElement that matches the query.
@@ -3849,7 +3849,7 @@ class ut extends I {
    */
   querySelector(t) {
     t = t.toUpperCase();
-    const s = new xe(this, (r) => r.nodeName && r.nodeName.toUpperCase() === t).next();
+    const s = new Ue(this, (r) => r.nodeName && r.nodeName.toUpperCase() === t).next();
     return s.done ? null : s.value;
   }
   /**
@@ -3864,7 +3864,7 @@ class ut extends I {
    * @public
    */
   querySelectorAll(t) {
-    return t = t.toUpperCase(), tt(new xe(this, (e) => e.nodeName && e.nodeName.toUpperCase() === t));
+    return t = t.toUpperCase(), tt(new Ue(this, (e) => e.nodeName && e.nodeName.toUpperCase() === t));
   }
   /**
    * Creates YXmlEvent and calls observers.
@@ -4131,7 +4131,7 @@ class Vt extends ut {
    */
   setAttribute(t, e) {
     this.doc !== null ? k(this.doc, (s) => {
-      gn(s, this, t, e);
+      pn(s, this, t, e);
     }) : this._prelimAttrs.set(t, e);
   }
   /**
@@ -4148,7 +4148,7 @@ class Vt extends ut {
   getAttribute(t) {
     return (
       /** @type {any} */
-      pn(this, t)
+      wn(this, t)
     );
   }
   /**
@@ -4377,7 +4377,7 @@ class he extends Ct {
   }
 }
 const To = (n) => new he();
-class wn {
+class mn {
   /**
    * @param {ID} id
    * @param {number} length
@@ -4418,7 +4418,7 @@ class wn {
   }
 }
 const Oo = 0;
-class U extends wn {
+class T extends mn {
   get deleted() {
     return !0;
   }
@@ -5214,7 +5214,7 @@ const qo = (n) => new G(Ko[n.readTypeRef()](n)), de = (n, t, e) => {
   );
   return t.deleted && i.markDeleted(), t.keep && (i.keep = !0), t.redone !== null && (i.redone = b(t.redone.client, t.redone.clock + e)), t.right = i, i.right !== null && (i.right.left = i), n._mergeStructs.push(i), i.parentSub !== null && i.right === null && i.parent._map.set(i.parentSub, i), t.length = e, i;
 };
-class E extends wn {
+class E extends mn {
   /**
    * @param {ID} id
    * @param {Item | null} left
@@ -5234,10 +5234,10 @@ class E extends wn {
    * @type {boolean}
    */
   set marker(t) {
-    (this.info & Ce) > 0 !== t && (this.info ^= Ce);
+    (this.info & Ae) > 0 !== t && (this.info ^= Ae);
   }
   get marker() {
-    return (this.info & Ce) > 0;
+    return (this.info & Ae) > 0;
   }
   /**
    * If true, do not garbage collect this Item.
@@ -5256,13 +5256,13 @@ class E extends wn {
    * @type {Boolean}
    */
   get deleted() {
-    return (this.info & Ee) > 0;
+    return (this.info & Ce) > 0;
   }
   set deleted(t) {
-    this.deleted !== t && (this.info ^= Ee);
+    this.deleted !== t && (this.info ^= Ce);
   }
   markDeleted() {
-    this.info |= Ee;
+    this.info |= Ce;
   }
   /**
    * Return the creator clientID of the missing op or define missing items and return null.
@@ -5278,13 +5278,13 @@ class E extends wn {
       return this.rightOrigin.client;
     if (this.parent && this.parent.constructor === yt && this.id.client !== this.parent.client && this.parent.clock >= L(e, this.parent.client))
       return this.parent.client;
-    if (this.origin && (this.left = $n(t, e, this.origin), this.origin = this.left.lastId), this.rightOrigin && (this.right = et(t, this.rightOrigin), this.rightOrigin = this.right.id), this.left && this.left.constructor === U || this.right && this.right.constructor === U)
+    if (this.origin && (this.left = $n(t, e, this.origin), this.origin = this.left.lastId), this.rightOrigin && (this.right = et(t, this.rightOrigin), this.rightOrigin = this.right.id), this.left && this.left.constructor === T || this.right && this.right.constructor === T)
       this.parent = null;
     else if (!this.parent)
       this.left && this.left.constructor === E && (this.parent = this.left.parent, this.parentSub = this.left.parentSub), this.right && this.right.constructor === E && (this.parent = this.right.parent, this.parentSub = this.right.parentSub);
     else if (this.parent.constructor === yt) {
-      const s = Me(e, this.parent);
-      s.constructor === U ? this.parent = null : this.parent = /** @type {ContentType} */
+      const s = ve(e, this.parent);
+      s.constructor === T ? this.parent = null : this.parent = /** @type {ContentType} */
       s.content.type;
     }
     return null;
@@ -5313,8 +5313,8 @@ class E extends wn {
               s = r, i.clear();
             else if (Pt(this.rightOrigin, r.rightOrigin))
               break;
-          } else if (r.origin !== null && o.has(Me(t.doc.store, r.origin)))
-            i.has(Me(t.doc.store, r.origin)) || (s = r, i.clear());
+          } else if (r.origin !== null && o.has(ve(t.doc.store, r.origin)))
+            i.has(ve(t.doc.store, r.origin)) || (s = r, i.clear());
           else
             break;
           r = r.right;
@@ -5344,7 +5344,7 @@ class E extends wn {
       (this.parent._item !== null && /** @type {AbstractType<any>} */
       this.parent._item.deleted || this.parentSub !== null && this.right !== null) && this.delete(t);
     } else
-      new U(this.id, this.length).integrate(t, 0);
+      new T(this.id, this.length).integrate(t, 0);
   }
   /**
    * Returns the next non-deleted item
@@ -5409,7 +5409,7 @@ class E extends wn {
   gc(t, e) {
     if (!this.deleted)
       throw V();
-    this.content.gc(t), e ? so(t, this, new U(this.id, this.length)) : this.content = new Ht(this.length);
+    this.content.gc(t), e ? so(t, this, new T(this.id, this.length)) : this.content = new Ht(this.length);
   }
   /**
    * Transform the properties of this type to binary and write it to an
@@ -5421,7 +5421,7 @@ class E extends wn {
    * @param {number} offset
    */
   write(t, e) {
-    const s = e > 0 ? b(this.id.client, this.id.clock + e - 1) : this.origin, r = this.rightOrigin, i = this.parentSub, o = this.content.getRef() & ge | (s === null ? 0 : x) | // origin is defined
+    const s = e > 0 ? b(this.id.client, this.id.clock + e - 1) : this.origin, r = this.rightOrigin, i = this.parentSub, o = this.content.getRef() & ge | (s === null ? 0 : U) | // origin is defined
     (r === null ? 0 : z) | // right origin is defined
     (i === null ? 0 : Ot);
     if (t.writeInfo(o), s !== null && t.writeLeftID(s), r !== null && t.writeRightID(r), s === null && r === null) {
@@ -5471,7 +5471,7 @@ const Ws = (n, t) => Zo[t & ge](n), Zo = [
   }
   // 10 - Skip is not ItemContent
 ], Qo = 10;
-class T extends wn {
+class O extends mn {
   get deleted() {
     return !0;
   }
@@ -5531,24 +5531,24 @@ class tl {
     Tr(this._onChange);
   }
 }
-const el = typeof BroadcastChannel > "u" ? tl : BroadcastChannel, mn = (n) => J(qs, n, () => {
+const el = typeof BroadcastChannel > "u" ? tl : BroadcastChannel, yn = (n) => J(qs, n, () => {
   const t = lt(), e = new el(n);
   return e.onmessage = (s) => t.forEach((r) => r(s.data, "broadcastchannel")), {
     bc: e,
     subs: t
   };
-}), nl = (n, t) => (mn(n).subs.add(t), t), sl = (n, t) => {
-  const e = mn(n), s = e.subs.delete(t);
+}), nl = (n, t) => (yn(n).subs.add(t), t), sl = (n, t) => {
+  const e = yn(n), s = e.subs.delete(t);
   return s && e.subs.size === 0 && (e.bc.close(), qs.delete(n)), s;
 }, mt = (n, t, e = null) => {
-  const s = mn(n);
+  const s = yn(n);
   s.bc.postMessage(t), s.subs.forEach((r) => r(t, e));
-}, Zs = 0, yn = 1, Qs = 2, Ye = (n, t) => {
+}, Zs = 0, bn = 1, Qs = 2, Xe = (n, t) => {
   p(n, Zs);
   const e = Qi(t);
   D(n, e);
 }, tr = (n, t, e) => {
-  p(n, yn), D(n, an(t, e));
+  p(n, bn), D(n, hn(t, e));
 }, rl = (n, t, e) => tr(t, e, M(n)), er = (n, t, e) => {
   try {
     Ds(t, M(n), e);
@@ -5563,7 +5563,7 @@ const el = typeof BroadcastChannel > "u" ? tl : BroadcastChannel, mn = (n) => J(
     case Zs:
       rl(n, t, e);
       break;
-    case yn:
+    case bn:
       er(n, e, s);
       break;
     case Qs:
@@ -5578,7 +5578,7 @@ const el = typeof BroadcastChannel > "u" ? tl : BroadcastChannel, mn = (n) => J(
     case cl:
       e(t, Z(n));
   }
-}, Ue = 3e4;
+}, Te = 3e4;
 class hl extends fe {
   /**
    * @param {Y.Doc} doc
@@ -5587,13 +5587,13 @@ class hl extends fe {
     super(), this.doc = t, this.clientID = t.clientID, this.states = /* @__PURE__ */ new Map(), this.meta = /* @__PURE__ */ new Map(), this._checkInterval = /** @type {any} */
     setInterval(() => {
       const e = ct();
-      this.getLocalState() !== null && Ue / 2 <= e - /** @type {{lastUpdated:number}} */
+      this.getLocalState() !== null && Te / 2 <= e - /** @type {{lastUpdated:number}} */
       this.meta.get(this.clientID).lastUpdated && this.setLocalState(this.getLocalState());
       const s = [];
       this.meta.forEach((r, i) => {
-        i !== this.clientID && Ue <= e - r.lastUpdated && this.states.has(i) && s.push(i);
-      }), s.length > 0 && bn(this, s, "timeout");
-    }, Y(Ue / 10)), t.on("destroy", () => {
+        i !== this.clientID && Te <= e - r.lastUpdated && this.states.has(i) && s.push(i);
+      }), s.length > 0 && kn(this, s, "timeout");
+    }, Y(Te / 10)), t.on("destroy", () => {
       this.destroy();
     }), this.setLocalState({});
   }
@@ -5636,7 +5636,7 @@ class hl extends fe {
     return this.states;
   }
 }
-const bn = (n, t, e) => {
+const kn = (n, t, e) => {
   const s = [];
   for (let r = 0; r < t.length; r++) {
     const i = t[r];
@@ -5701,7 +5701,7 @@ Xt[st] = (n, t, e, s, r) => {
     e.doc,
     e
   );
-  s && i === yn && !e.synced && (e.synced = !0);
+  s && i === bn && !e.synced && (e.synced = !0);
 };
 Xt[nr] = (n, t, e, s, r) => {
   p(n, kt), D(
@@ -5743,11 +5743,11 @@ function rr(n) {
         return;
       n.wsLastMessageReceived = ct();
       const s = sr(n, new Uint8Array(e.data), !0);
-      en(s) > 1 && t.send(_(s));
+      nn(s) > 1 && t.send(_(s));
     }, t.onerror = (e) => {
       n.emit("connection-error", [e, n]);
     }, t.onclose = (e) => {
-      n.emit("connection-close", [e, n]), n.ws = null, n.wsconnecting = !1, n.wsconnected ? (n.wsconnected = !1, n.synced = !1, bn(
+      n.emit("connection-close", [e, n]), n.ws = null, n.wsconnecting = !1, n.wsconnected ? (n.wsconnected = !1, n.synced = !1, kn(
         n.awareness,
         Array.from(n.awareness.getStates().keys()).filter(
           (s) => s !== n.doc.clientID
@@ -5759,7 +5759,7 @@ function rr(n) {
         }
       ])) : n.wsUnsuccessfulReconnects++, setTimeout(
         rr,
-        Ge(
+        Pe(
           Sr(2, n.wsUnsuccessfulReconnects) * 100,
           n.maxBackoffTime
         ),
@@ -5772,7 +5772,7 @@ function rr(n) {
         }
       ]);
       const e = v();
-      if (p(e, st), Ye(e, n.doc), t.send(_(e)), n.awareness.getLocalState() !== null) {
+      if (p(e, st), Xe(e, n.doc), t.send(_(e)), n.awareness.getLocalState() !== null) {
         const s = v();
         p(s, kt), D(
           s,
@@ -5788,7 +5788,7 @@ function rr(n) {
     ]);
   }
 }
-function Te(n, t) {
+function Oe(n, t) {
   const e = n.ws;
   n.wsconnected && e && e.readyState === e.OPEN && e.send(t), n.bcconnected && mt(n.bcChannel, t, n);
 }
@@ -5838,26 +5838,26 @@ var ml = class extends fe {
     setInterval(() => {
       if (this.ws && this.ws.readyState === WebSocket.OPEN) {
         const u = v();
-        p(u, st), Ye(u, s), this.ws.send(_(u));
+        p(u, st), Xe(u, s), this.ws.send(_(u));
       }
     }, c)), this._bcSubscriber = (u, f) => {
       if (f !== this) {
         const g = sr(this, new Uint8Array(u), !1);
-        en(g) > 1 && mt(this.bcChannel, _(g), this);
+        nn(g) > 1 && mt(this.bcChannel, _(g), this);
       }
     }, this._updateHandler = (u, f) => {
       if (f !== this) {
         const g = v();
-        p(g, st), il(g, u), Te(this, _(g));
+        p(g, st), il(g, u), Oe(this, _(g));
       }
     }, this.doc.on("update", this._updateHandler), this._awarenessUpdateHandler = ({ added: u, updated: f, removed: g }, w) => {
       const S = u.concat(f).concat(g), j = v();
       p(j, kt), D(
         j,
         Ut(i, S)
-      ), Te(this, _(j));
+      ), Oe(this, _(j));
     }, this._unloadHandler = () => {
-      bn(
+      kn(
         this.awareness,
         [s.clientID],
         "window unload"
@@ -5884,7 +5884,7 @@ var ml = class extends fe {
       return;
     this.bcconnected || (nl(this.bcChannel, this._bcSubscriber), this.bcconnected = !0);
     const t = v();
-    p(t, st), Ye(t, this.doc), mt(this.bcChannel, _(t), this);
+    p(t, st), Xe(t, this.doc), mt(this.bcChannel, _(t), this);
     const e = v();
     p(e, st), tr(e, this.doc), mt(this.bcChannel, _(e), this);
     const s = v();
@@ -5914,7 +5914,7 @@ var ml = class extends fe {
         [this.doc.clientID],
         /* @__PURE__ */ new Map()
       )
-    ), Te(this, _(t)), this.bcconnected && (sl(this.bcChannel, this._bcSubscriber), this.bcconnected = !1);
+    ), Oe(this, _(t)), this.bcconnected && (sl(this.bcChannel, this._bcSubscriber), this.bcconnected = !1);
   }
   disconnect() {
     this.shouldConnect = !1, this.disconnectBc(), this.ws !== null && this.ws.close();
@@ -5988,7 +5988,7 @@ const wt = (n) => Dt((t, e) => {
 ), Mt = (n, t, e = "readwrite") => {
   const s = n.transaction(t, e);
   return t.map((r) => xl(s, r));
-}, ir = (n, t) => wt(n.count(t)), El = (n, t) => wt(n.get(t)), or = (n, t) => wt(n.delete(t)), Cl = (n, t, e) => wt(n.put(t, e)), Xe = (n, t) => wt(n.add(t)), Al = (n, t, e) => wt(n.getAll(t, e)), Ll = (n, t, e) => {
+}, ir = (n, t) => wt(n.count(t)), El = (n, t) => wt(n.get(t)), or = (n, t) => wt(n.delete(t)), Cl = (n, t, e) => wt(n.put(t, e)), Je = (n, t) => wt(n.add(t)), Al = (n, t, e) => wt(n.getAll(t, e)), Ll = (n, t, e) => {
   let s = null;
   return vl(n, t, (r) => (s = r, !1), e).then(() => s);
 }, Il = (n, t = null) => Ll(n, t, "prev"), Ml = (n, t) => Dt((e, s) => {
@@ -5998,7 +5998,7 @@ const wt = (n) => Dt((t, e) => {
       return e();
     i.continue();
   };
-}), vl = (n, t, e, s = "next") => Ml(n.openKeyCursor(t, s), (r) => e(r.key)), xl = (n, t) => n.objectStore(t), Ul = (n, t) => IDBKeyRange.upperBound(n, t), Tl = (n, t) => IDBKeyRange.lowerBound(n, t), Oe = "custom", lr = "updates", cr = 500, ar = (n, t = () => {
+}), vl = (n, t, e, s = "next") => Ml(n.openKeyCursor(t, s), (r) => e(r.key)), xl = (n, t) => n.objectStore(t), Ul = (n, t) => IDBKeyRange.upperBound(n, t), Tl = (n, t) => IDBKeyRange.lowerBound(n, t), Re = "custom", lr = "updates", cr = 500, ar = (n, t = () => {
 }, e = () => {
 }) => {
   const [s] = Mt(
@@ -6016,7 +6016,7 @@ const wt = (n) => Dt((t, e) => {
     n._dbsize = r;
   })).then(() => s);
 }, Ol = (n, t = !0) => ar(n).then((e) => {
-  (t || n._dbsize >= cr) && Xe(e, an(n.doc)).then(() => or(e, Ul(n._dbref, !0))).then(() => ir(e).then((s) => {
+  (t || n._dbsize >= cr) && Je(e, hn(n.doc)).then(() => or(e, Ul(n._dbref, !0))).then(() => ir(e).then((s) => {
     n._dbsize = s;
   }));
 });
@@ -6033,7 +6033,7 @@ class Rl extends fe {
         ["custom"]
       ])
     ), this.whenSynced = Dt((s) => this.on("synced", () => s(this))), this._db.then((s) => {
-      this.db = s, ar(this, (o) => Xe(o, an(e)), () => {
+      this.db = s, ar(this, (o) => Je(o, hn(e)), () => {
         if (this._destroyed)
           return this;
         this.synced = !0, this.emit("synced", [this]);
@@ -6045,7 +6045,7 @@ class Rl extends fe {
           this.db,
           [lr]
         );
-        Xe(i, s), ++this._dbsize >= cr && (this._storeTimeoutId !== null && clearTimeout(this._storeTimeoutId), this._storeTimeoutId = setTimeout(() => {
+        Je(i, s), ++this._dbsize >= cr && (this._storeTimeoutId !== null && clearTimeout(this._storeTimeoutId), this._storeTimeoutId = setTimeout(() => {
           Ol(this, !1), this._storeTimeoutId = null;
         }, this._storeTimeout));
       }
@@ -6072,7 +6072,7 @@ class Rl extends fe {
    */
   get(t) {
     return this._db.then((e) => {
-      const [s] = Mt(e, [Oe], "readonly");
+      const [s] = Mt(e, [Re], "readonly");
       return El(s, t);
     });
   }
@@ -6083,7 +6083,7 @@ class Rl extends fe {
    */
   set(t, e) {
     return this._db.then((s) => {
-      const [r] = Mt(s, [Oe]);
+      const [r] = Mt(s, [Re]);
       return Cl(r, e, t);
     });
   }
@@ -6093,7 +6093,7 @@ class Rl extends fe {
    */
   del(t) {
     return this._db.then((e) => {
-      const [s] = Mt(e, [Oe]);
+      const [s] = Mt(e, [Re]);
       return or(s, t);
     });
   }
@@ -6468,24 +6468,24 @@ class $l {
     this.setData(this.defaultData);
   }
 }
-const jl = "playhtml.spencerc99.partykit.dev", Re = new gt();
+const jl = "playhtml.spencerc99.partykit.dev", Be = new gt();
 function Kl() {
   return window.location.pathname + window.location.search;
 }
-let Q, F, O;
+let Q, F, x;
 const Zn = /* @__PURE__ */ new Map();
 let Jt = Hl;
 function ur() {
   return [_e.CanPlay, ...Object.keys(Jt)];
 }
-let kn = !1, Je = !0;
+let Se = !1, We = !0;
 function zl({
   // TODO: if it is a localhost url, need to make some deterministic way to connect to the same room.
   room: n = Kl(),
   host: t = jl,
   extraCapabilities: e
 } = {}) {
-  if (!Je) {
+  if (!We) {
     console.error("playhtml already set up!");
     return;
   }
@@ -6497,11 +6497,11 @@ function zl({
 ࿂࿂࿂࿂  https://playhtml.fun  ࿂࿂࿂࿂
 ࿂࿂࿂࿂   ࿂     ࿂     ࿂     ࿂   ࿂࿂࿂࿂
 ࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂࿂`
-  ), Q = new kl(r, s, Re), F = Re.getMap("playhtml-global"), O = /* @__PURE__ */ new Map(), new Rl(s, Re), We.globalData = F, We.elementHandlers = O, e)
+  ), Q = new kl(r, s, Be), F = Be.getMap("playhtml-global"), x = /* @__PURE__ */ new Map(), new Rl(s, Be), Ge.globalData = F, Ge.elementHandlers = x, e)
     for (const [i, o] of Object.entries(e))
       Jt[i] = o;
   return Q.on("sync", (i) => {
-    i || console.error("Issue connecting to yjs..."), kn = !0, console.log("[PLAYHTML]: Setting up elements... Time to have some fun 🛝"), fr();
+    i || console.error("Issue connecting to yjs..."), Se = !0, console.log("[PLAYHTML]: Setting up elements... Time to have some fun 🛝"), fr();
   }), Q;
 }
 function Yl(n, t) {
@@ -6564,7 +6564,7 @@ function dr() {
   Q.awareness.getStates().forEach((e, s) => {
     var r;
     for (const [i, o] of Object.entries(e)) {
-      const l = O.get(i);
+      const l = x.get(i);
       if (l)
         for (const [c, a] of l) {
           if (!(c in o))
@@ -6579,7 +6579,7 @@ function dr() {
         }
     }
     for (const [i, o] of n) {
-      const l = O.get(i);
+      const l = x.get(i);
       if (l)
         for (const [c, a] of l) {
           const h = (r = o.get(c)) == null ? void 0 : r.values();
@@ -6592,47 +6592,49 @@ function dr() {
   });
 }
 function fr() {
-  for (const n of ur()) {
-    const t = Array.from(
-      document.querySelectorAll(`[${n}]`)
-    ).filter(_n);
-    if (t.length)
-      for (let e = 0; e < t.length; e++) {
-        const s = t[e];
-        Se(s, n);
-      }
+  if (Se) {
+    for (const n of ur()) {
+      const t = Array.from(
+        document.querySelectorAll(`[${n}]`)
+      ).filter(_n);
+      if (t.length)
+        for (let e = 0; e < t.length; e++) {
+          const s = t[e];
+          De(s, n);
+        }
+    }
+    We && (F.observe((n) => {
+      n.changes.keys.forEach((t, e) => {
+        t.action === "add" && F.set(e, F.get(e));
+      });
+    }), Q.awareness.on("change", () => dr()), We = !1);
   }
-  Je && (F.observe((n) => {
-    n.changes.keys.forEach((t, e) => {
-      t.action === "add" && F.set(e, F.get(e));
-    });
-  }), Q.awareness.on("change", () => dr()), Je = !1);
 }
-const We = {
+const Ge = {
   init: zl,
   setupPlayElements: fr,
   setupPlayElement: ql,
   removePlayElement: Zl,
-  setupPlayElementForTag: Se,
+  setupPlayElementForTag: De,
   globalData: void 0,
   elementHandlers: void 0
 };
-window.playhtml = We;
+window.playhtml = Ge;
 function Gl(n) {
-  if (O.has(n) || !kn)
+  if (x.has(n) || !Se)
     return;
-  O.has(n) || O.set(n, /* @__PURE__ */ new Map()), n !== _e.CanPlay && Jt[n], F.get(n) || F.set(n, new ht());
+  x.has(n) || x.set(n, /* @__PURE__ */ new Map()), n !== _e.CanPlay && Jt[n], F.get(n) || F.set(n, new ht());
   const t = F.get(n);
   t.observe((e) => {
     e.changes.keys.forEach((s, r) => {
-      const i = O.get(n);
+      const i = x.get(n);
       if (s.action === "add") {
         const o = document.getElementById(r);
         if (!_n(o)) {
           console.log(`Element ${r} not an HTML element. Ignoring.`);
           return;
         }
-        Se(o, n);
+        De(o, n);
       } else if (s.action === "update") {
         const o = i.get(r);
         o.__data = t.get(r);
@@ -6645,9 +6647,9 @@ function Pl(n, t) {
   var e, s;
   return ((s = (e = Jt[t]) == null ? void 0 : e.isValidElementForTag) == null ? void 0 : s.call(e, n)) ?? !0;
 }
-function Se(n, t) {
+function De(n, t) {
   var l;
-  if (!Pl(n, t) || !kn)
+  if (!Pl(n, t) || !Se)
     return;
   if (!n.id) {
     const c = n.getAttribute("selector-id");
@@ -6665,7 +6667,7 @@ function Se(n, t) {
     return;
   }
   Gl(t);
-  const s = O.get(t), r = Wl(
+  const s = x.get(t), r = Wl(
     t,
     n
   );
@@ -6688,21 +6690,28 @@ function Se(n, t) {
     s.set(e, new $l(o));
   i.get(e) === void 0 && r.defaultData !== void 0 && i.set(e, r.defaultData), (l = o.triggerAwarenessUpdate) == null || l.call(o), n.classList.add("__playhtml-element"), n.classList.add(`__playhtml-${t}`), n.style.setProperty("--jiggle-delay", `${Math.random() * 1}s;}`);
 }
-function ql(n) {
-  if (!_n(n)) {
-    console.log(`Element ${n.id} not an HTML element. Ignoring.`);
-    return;
+function ql(n, { ignoreIfAlreadySetup: t } = {}) {
+  if (!(t && Object.keys(x || {}).some(
+    (e) => {
+      var s;
+      return (s = x.get(e)) == null ? void 0 : s.has(n.id);
+    }
+  ))) {
+    if (!_n(n)) {
+      console.log(`Element ${n.id} not an HTML element. Ignoring.`);
+      return;
+    }
+    for (const e of ur())
+      n.hasAttribute(e) && De(n, e);
   }
-  for (const t of ur())
-    n.hasAttribute(t) && Se(n, t);
 }
 function Zl(n) {
   if (!(!n || !n.id))
-    for (const t of Object.keys(O)) {
-      const e = O.get(t);
+    for (const t of Object.keys(x)) {
+      const e = x.get(t);
       e.has(n.id) && e.delete(n.id);
     }
 }
 export {
-  We as playhtml
+  Ge as playhtml
 };