@jackuait/blok 0.10.0-beta.13 → 0.10.0-beta.15

package/dist/chunks/{blok-uTkAJyAg.mjs → blok-1213fGsk.mjs}

@@ -1,5 +1,5 @@
 import { t as e } from "./chunk-D6kmoKXy.mjs";
-import { $n as t, $t as n, An as r, At as i, Bn as a, Bt as o, C as s, Dn as c, E as l, En as u, Fn as d, Gn as f, Gt as p, Hn as m, In as h, It as g, Jn as _, Jt as v, Kn as ee, Kt as y, Ln as te, Mn as ne, Nn as re, On as ie, Ot as ae, Pn as oe, Qn as se, Qt as ce, Rn as le, S as ue, Sn as de, T as fe, Tn as pe, Un as b, Vn as me, Wn as he, Wt as ge, Xn as _e, Xt as ve, Yn as ye, Yt as be, Zn as x, Zt as xe, _ as Se, _n as Ce, an as we, b as S, bn as Te, dn as Ee, en as De, er as C, fn as Oe, ft as ke, g as Ae, gn as je, gt as Me, h as Ne, hn as Pe, in as w, jn as Fe, k as Ie, kn as Le, ln as Re, m as ze, mn as Be, nn as Ve, p as He, pn as Ue, qn as T, qt as We, rn as E, sn as Ge, tn as Ke, u as qe, un as Je, v as Ye, vn as Xe, vt as Ze, w as Qe, wn as D, x as $e, xn as et, y as tt, yn as nt, zn as rt, zt as it } from "./constants-NpHRgdEj.mjs";
+import { $n as t, $t as n, An as r, At as i, Bn as a, Bt as o, C as s, Dn as c, E as l, En as u, Fn as d, Gn as f, Gt as p, Hn as m, In as h, It as g, Jn as _, Jt as v, Kn as ee, Kt as y, Ln as te, Mn as ne, Nn as re, On as ie, Ot as ae, Pn as oe, Qn as se, Qt as ce, Rn as le, S as ue, Sn as de, T as fe, Tn as pe, Un as b, Vn as me, Wn as he, Wt as ge, Xn as _e, Xt as ve, Yn as ye, Yt as be, Zn as x, Zt as xe, _ as Se, _n as Ce, an as we, b as S, bn as Te, dn as Ee, en as De, er as C, fn as Oe, ft as ke, g as Ae, gn as je, gt as Me, h as Ne, hn as Pe, in as w, jn as Fe, k as Ie, kn as Le, ln as Re, m as ze, mn as Be, nn as Ve, p as He, pn as Ue, qn as T, qt as We, rn as E, sn as Ge, tn as Ke, u as qe, un as Je, v as Ye, vn as Xe, vt as Ze, w as Qe, wn as D, x as $e, xn as et, y as tt, yn as nt, zn as rt, zt as it } from "./constants-Cr7GEExc.mjs";
 import { n as at, t as O } from "./objectSpread2-CWwMYL_U.mjs";
 import { n as k, t as ot } from "./tw-CqxBf-1Y.mjs";
 import { r as st, t as ct } from "./lightweight-i18n-Cvv8CWh4.mjs";
@@ -1520,11 +1520,11 @@ var z, Er = [], Dr = () => {
 	constructor(e, t) {
 		this.left = e, this.right = t;
 	}
-}, B = (e, t) => new Nr(e, t), Pr = (e) => e.next() >= .5, Fr = (e, t, n) => un(e.next() * (n + 1 - t) + t), Ir = (e, t, n) => un(e.next() * (n + 1 - t) + t), Lr = (e, t, n) => Ir(e, t, n), Rr = (e) => vn(Lr(e, 97, 122)), zr = (e, t = 0, n = 20) => {
-	let r = Lr(e, t, n), i = "";
-	for (let t = 0; t < r; t++) i += Rr(e);
+}, Pr = (e, t) => new Nr(e, t), Fr = (e) => e.next() >= .5, Ir = (e, t, n) => un(e.next() * (n + 1 - t) + t), Lr = (e, t, n) => un(e.next() * (n + 1 - t) + t), Rr = (e, t, n) => Lr(e, t, n), zr = (e) => vn(Rr(e, 97, 122)), Br = (e, t = 0, n = 20) => {
+	let r = Rr(e, t, n), i = "";
+	for (let t = 0; t < r; t++) i += zr(e);
 	return i;
-}, Br = (e, t) => t[Lr(e, 0, t.length - 1)], Vr, Hr = Symbol("0schema"), Ur = class {
+}, Vr = (e, t) => t[Rr(e, 0, t.length - 1)], Hr, Ur = Symbol("0schema"), Wr = class {
 	constructor() {
 		this._rerrs = [];
 	}
@@ -1545,20 +1545,20 @@ var z, Er = [], Dr = () => {
 		}
 		return e.join("\n");
 	}
-}, Wr = (e, t) => e === t ? !0 : e == null || t == null || e.constructor !== t.constructor ? !1 : e[lr] ? ur(e, t) : cn(e) ? an(e, (e) => on(t, (t) => Wr(e, t))) : dr(e) ? _r(e, (e, n) => Wr(e, t[n])) : !1;
-Vr = lr;
-var V = class {
+}, Gr = (e, t) => e === t ? !0 : e == null || t == null || e.constructor !== t.constructor ? !1 : e[lr] ? ur(e, t) : cn(e) ? an(e, (e) => on(t, (t) => Gr(e, t))) : dr(e) ? _r(e, (e, n) => Gr(e, t[n])) : !1;
+Hr = lr;
+var B = class {
 	extends(e) {
 		let [t, n] = [this.shape, e.shape];
-		return this.constructor._dilutes && ([n, t] = [t, n]), Wr(t, n);
+		return this.constructor._dilutes && ([n, t] = [t, n]), Gr(t, n);
 	}
 	equals(e) {
 		return this.constructor === e.constructor && Cr(this.shape, e.shape);
 	}
-	[Hr]() {
+	[Ur]() {
 		return !0;
 	}
-	[Vr](e) {
+	[Hr](e) {
 		return this.equals(e);
 	}
 	validate(e) {
@@ -1570,20 +1570,20 @@ var V = class {
 	}
 	/* c8 ignore stop */
 	get nullable() {
-		return xi(this, Ii);
+		return Si(this, Li);
 	}
 	get optional() {
-		return new $r(this);
+		return new ei(this);
 	}
 	cast(e) {
-		return Bi(e, this), e;
+		return Vi(e, this), e;
 	}
 	expect(e) {
-		return Bi(e, this), e;
+		return Vi(e, this), e;
 	}
 };
-at(V, "_dilutes", !1);
-var Gr = class extends V {
+at(B, "_dilutes", !1);
+var Kr = class extends B {
 	constructor(e, t) {
 		super(), this.shape = e, this._c = t;
 	}
@@ -1591,9 +1591,9 @@ var Gr = class extends V {
 		let n = (e == null ? void 0 : e.constructor) === this.shape && (this._c == null || this._c(e));
 		return !n && (t == null || t.extend(null, this.shape.name, e == null ? void 0 : e.constructor.name, (e == null ? void 0 : e.constructor) === this.shape ? "Check failed" : "Constructor match failed")), n;
 	}
-}, H = (e, t = null) => new Gr(e, t);
-H(Gr);
-var Kr = class extends V {
+}, V = (e, t = null) => new Kr(e, t);
+V(Kr);
+var qr = class extends B {
 	constructor(e) {
 		super(), this.shape = e;
 	}
@@ -1601,9 +1601,9 @@ var Kr = class extends V {
 		let n = this.shape(e);
 		return !n && (t == null || t.extend(null, "custom prop", e == null ? void 0 : e.constructor.name, "failed to check custom prop")), n;
 	}
-}, U = (e) => new Kr(e);
-H(Kr);
-var qr = class extends V {
+}, H = (e) => new qr(e);
+V(qr);
+var Jr = class extends B {
 	constructor(e) {
 		super(), this.shape = e;
 	}
@@ -1611,25 +1611,25 @@ var qr = class extends V {
 		let n = this.shape.some((t) => t === e);
 		return !n && (t == null || t.extend(null, this.shape.join(" | "), e.toString())), n;
 	}
-}, Jr = (...e) => new qr(e), Yr = H(qr), Xr = RegExp.escape || ((e) => e.replace(/[().|&,$^[\]]/g, (e) => "\\" + e)), Zr = (e) => {
-	if (ji.check(e)) return [Xr(e)];
-	if (Yr.check(e)) return e.shape.map((e) => e + "");
-	if (Ai.check(e)) return ["[+-]?\\d+.?\\d*"];
-	if (Mi.check(e)) return [".*"];
-	if (Si.check(e)) return e.shape.map(Zr).flat(1);
+}, Yr = (...e) => new Jr(e), Xr = V(Jr), Zr = RegExp.escape || ((e) => e.replace(/[().|&,$^[\]]/g, (e) => "\\" + e)), Qr = (e) => {
+	if (Mi.check(e)) return [Zr(e)];
+	if (Xr.check(e)) return e.shape.map((e) => e + "");
+	if (ji.check(e)) return ["[+-]?\\d+.?\\d*"];
+	if (Ni.check(e)) return [".*"];
+	if (Ci.check(e)) return e.shape.map(Qr).flat(1);
 	/* c8 ignore next 2 */
 	R();
 };
-H(class extends V {
+V(class extends B {
 	constructor(e) {
-		super(), this.shape = e, this._r = RegExp("^" + e.map(Zr).map((e) => `(${e.join("|")})`).join("") + "$");
+		super(), this.shape = e, this._r = RegExp("^" + e.map(Qr).map((e) => `(${e.join("|")})`).join("") + "$");
 	}
 	check(e, t) {
 		let n = this._r.exec(e) != null;
 		return !n && (t == null || t.extend(null, this._r.toString(), e.toString(), "String doesn't match string template.")), n;
 	}
 });
-var Qr = Symbol("optional"), $r = class extends V {
+var $r = Symbol("optional"), ei = class extends B {
 	constructor(e) {
 		super(), this.shape = e;
 	}
@@ -1637,16 +1637,16 @@ var Qr = Symbol("optional"), $r = class extends V {
 		let n = e === void 0 || this.shape.check(e);
 		return !n && (t == null || t.extend(null, "undefined (optional)", "()")), n;
 	}
-	get [Qr]() {
+	get [$r]() {
 		return !0;
 	}
-}, ei = H($r), ti = class extends V {
+}, ti = V(ei), ni = class extends B {
 	check(e, t) {
 		return t == null || t.extend(null, "never", typeof e), !1;
 	}
 };
-new ti(), H(ti);
-var ni = class e extends V {
+new ni(), V(ni);
+var ri = class e extends B {
 	constructor(e, t = !1) {
 		super(), this.shape = e, this._isPartial = t;
 	}
@@ -1660,8 +1660,8 @@ var ni = class e extends V {
 		});
 	}
 };
-at(ni, "_dilutes", !0);
-var ri = (e) => new ni(e), ii = H(ni), ai = U((e) => e != null && (e.constructor === Object || e.constructor == null)), oi = class extends V {
+at(ri, "_dilutes", !0);
+var ii = (e) => new ri(e), ai = V(ri), oi = H((e) => e != null && (e.constructor === Object || e.constructor == null)), si = class extends B {
 	constructor(e, t) {
 		super(), this.shape = {
 			keys: e,
@@ -1674,7 +1674,7 @@ var ri = (e) => new ni(e), ii = H(ni), ai = U((e) => e != null && (e.constructor
 			return !i && (t == null || t.extend(r + "", "Record", typeof e, i ? "Key doesn't match schema" : "Value doesn't match value")), i && this.shape.values.check(n, t);
 		});
 	}
-}, si = (e, t) => new oi(e, t), ci = H(oi), li = class extends V {
+}, ci = (e, t) => new si(e, t), li = V(si), ui = class extends B {
 	constructor(e) {
 		super(), this.shape = e;
 	}
@@ -1684,17 +1684,17 @@ var ri = (e) => new ni(e), ii = H(ni), ai = U((e) => e != null && (e.constructor
 			return !i && (t == null || t.extend(r.toString(), "Tuple", typeof n)), i;
 		});
 	}
-}, ui = (...e) => new li(e);
-H(li);
-var di = class extends V {
+}, di = (...e) => new ui(e);
+V(ui);
+var fi = class extends B {
 	constructor(e) {
-		super(), this.shape = e.length === 1 ? e[0] : new bi(e);
+		super(), this.shape = e.length === 1 ? e[0] : new xi(e);
 	}
 	check(e, t) {
 		let n = cn(e) && an(e, (e) => this.shape.check(e));
 		return !n && (t == null || t.extend(null, "Array", "")), n;
 	}
-}, fi = (...e) => new di(e), pi = H(di), mi = U((e) => cn(e)), hi = class extends V {
+}, pi = (...e) => new fi(e), mi = V(fi), hi = H((e) => cn(e)), gi = class extends B {
 	constructor(e, t) {
 		super(), this.shape = e, this._c = t;
 	}
@@ -1702,18 +1702,18 @@ var di = class extends V {
 		let n = e instanceof this.shape && (this._c == null || this._c(e));
 		return !n && (t == null || t.extend(null, this.shape.name, e == null ? void 0 : e.constructor.name)), n;
 	}
-}, gi = (e, t = null) => new hi(e, t);
-H(hi);
-var _i = gi(V), vi = H(class extends V {
+}, _i = (e, t = null) => new gi(e, t);
+V(gi);
+var vi = _i(B), yi = V(class extends B {
 	constructor(e) {
-		super(), this.len = e.length - 1, this.args = ui(...e.slice(-1)), this.res = e[this.len];
+		super(), this.len = e.length - 1, this.args = di(...e.slice(-1)), this.res = e[this.len];
 	}
 	check(e, t) {
 		let n = e.constructor === Function && e.length <= this.len;
 		return !n && (t == null || t.extend(null, "function", typeof e)), n;
 	}
-}), yi = U((e) => typeof e == "function");
-H(class extends V {
+}), bi = H((e) => typeof e == "function");
+V(class extends B {
 	constructor(e) {
 		super(), this.shape = e;
 	}
@@ -1722,7 +1722,7 @@ H(class extends V {
 		return !n && (t == null || t.extend(null, "Intersectinon", typeof e)), n;
 	}
 }, (e) => e.shape.length > 0);
-var bi = class extends V {
+var xi = class extends B {
 	constructor(e) {
 		super(), this.shape = e;
 	}
@@ -1731,44 +1731,44 @@ var bi = class extends V {
 		return t == null || t.extend(null, "Union", typeof e), n;
 	}
 };
-at(bi, "_dilutes", !0);
-var xi = (...e) => e.findIndex((e) => Si.check(e)) >= 0 ? xi(...e.map((e) => zi(e)).map((e) => Si.check(e) ? e.shape : [e]).flat(1)) : e.length === 1 ? e[0] : new bi(e), Si = H(bi), Ci = () => !0, wi = U(Ci), Ti = H(Kr, (e) => e.shape === Ci), Ei = U((e) => typeof e == "bigint"), Di = U((e) => e === Ei), Oi = U((e) => typeof e == "symbol");
-U((e) => e === Oi);
-var ki = U((e) => typeof e == "number"), Ai = U((e) => e === ki), ji = U((e) => typeof e == "string"), Mi = U((e) => e === ji), Ni = U((e) => typeof e == "boolean"), Pi = U((e) => e === Ni), Fi = Jr(void 0);
-H(qr, (e) => e.shape.length === 1 && e.shape[0] === void 0), Jr(void 0);
-var Ii = Jr(null), Li = H(qr, (e) => e.shape.length === 1 && e.shape[0] === null);
-H(Uint8Array), H(Gr, (e) => e.shape === Uint8Array);
-var Ri = xi(ki, ji, Ii, Fi, Ei, Ni, Oi);
+at(xi, "_dilutes", !0);
+var Si = (...e) => e.findIndex((e) => Ci.check(e)) >= 0 ? Si(...e.map((e) => Bi(e)).map((e) => Ci.check(e) ? e.shape : [e]).flat(1)) : e.length === 1 ? e[0] : new xi(e), Ci = V(xi), wi = () => !0, Ti = H(wi), Ei = V(qr, (e) => e.shape === wi), Di = H((e) => typeof e == "bigint"), Oi = H((e) => e === Di), ki = H((e) => typeof e == "symbol");
+H((e) => e === ki);
+var Ai = H((e) => typeof e == "number"), ji = H((e) => e === Ai), Mi = H((e) => typeof e == "string"), Ni = H((e) => e === Mi), Pi = H((e) => typeof e == "boolean"), Fi = H((e) => e === Pi), Ii = Yr(void 0);
+V(Jr, (e) => e.shape.length === 1 && e.shape[0] === void 0), Yr(void 0);
+var Li = Yr(null), Ri = V(Jr, (e) => e.shape.length === 1 && e.shape[0] === null);
+V(Uint8Array), V(Kr, (e) => e.shape === Uint8Array);
+var zi = Si(Ai, Mi, Li, Ii, Di, Pi, ki);
 (() => {
-	let e = fi(wi), t = si(ji, wi), n = xi(ki, ji, Ii, Ni, e, t);
+	let e = pi(Ti), t = ci(Mi, Ti), n = Si(Ai, Mi, Li, Pi, e, t);
 	return e.shape = n, t.shape.values = n, n;
 })();
-var zi = (e) => {
-	if (_i.check(e)) return e;
-	if (ai.check(e)) {
+var Bi = (e) => {
+	if (vi.check(e)) return e;
+	if (oi.check(e)) {
 		let t = {};
-		for (let n in e) t[n] = zi(e[n]);
-		return ri(t);
-	} else if (mi.check(e)) return xi(...e.map(zi));
-	else if (Ri.check(e)) return Jr(e);
-	else if (yi.check(e)) return H(e);
+		for (let n in e) t[n] = Bi(e[n]);
+		return ii(t);
+	} else if (hi.check(e)) return Si(...e.map(Bi));
+	else if (zi.check(e)) return Yr(e);
+	else if (bi.check(e)) return V(e);
 	/* c8 ignore next */
 	R();
-}, Bi = jr ? () => {} : (e, t) => {
-	let n = new Ur();
+}, Vi = jr ? () => {} : (e, t) => {
+	let n = new Wr();
 	if (!t.check(e, n)) throw $n(`Expected value to be of type ${t.constructor.name}.\n${n.toString()}`);
-}, Vi = class {
+}, Hi = class {
 	constructor(e) {
 		this.patterns = [], this.$state = e;
 	}
 	if(e, t) {
 		return this.patterns.push({
-			if: zi(e),
+			if: Bi(e),
 			h: t
 		}), this;
 	}
 	else(e) {
-		return this.if(wi, e);
+		return this.if(Ti, e);
 	}
 	done() {
 		return (e, t) => {
@@ -1779,52 +1779,52 @@ var zi = (e) => {
 			throw $n("Unhandled pattern");
 		};
 	}
-}, Hi = ((e) => new Vi(e))(wi).if(Ai, (e, t) => Fr(t, gn, hn)).if(Mi, (e, t) => zr(t)).if(Pi, (e, t) => Pr(t)).if(Di, (e, t) => BigInt(Fr(t, gn, hn))).if(Si, (e, t) => Ui(t, Br(t, e.shape))).if(ii, (e, t) => {
+}, Ui = ((e) => new Hi(e))(Ti).if(ji, (e, t) => Ir(t, gn, hn)).if(Ni, (e, t) => Br(t)).if(Fi, (e, t) => Fr(t)).if(Oi, (e, t) => BigInt(Ir(t, gn, hn))).if(Ci, (e, t) => Wi(t, Vr(t, e.shape))).if(ai, (e, t) => {
 	let n = {};
 	for (let r in e.shape) {
 		let i = e.shape[r];
-		if (ei.check(i)) {
-			if (Pr(t)) continue;
+		if (ti.check(i)) {
+			if (Fr(t)) continue;
 			i = i.shape;
 		}
-		n[r] = Hi(i, t);
+		n[r] = Ui(i, t);
 	}
 	return n;
-}).if(pi, (e, t) => {
-	let n = [], r = Ir(t, 0, 42);
-	for (let i = 0; i < r; i++) n.push(Ui(t, e.shape));
+}).if(mi, (e, t) => {
+	let n = [], r = Lr(t, 0, 42);
+	for (let i = 0; i < r; i++) n.push(Wi(t, e.shape));
 	return n;
-}).if(Yr, (e, t) => Br(t, e.shape)).if(Li, (e, t) => null).if(vi, (e, t) => {
-	let n = Ui(t, e.res);
+}).if(Xr, (e, t) => Vr(t, e.shape)).if(Ri, (e, t) => null).if(yi, (e, t) => {
+	let n = Wi(t, e.res);
 	return () => n;
-}).if(Ti, (e, t) => Ui(t, Br(t, [
-	ki,
-	ji,
+}).if(Ei, (e, t) => Wi(t, Vr(t, [
+	Ai,
+	Mi,
+	Li,
 	Ii,
-	Fi,
-	Ei,
-	Ni,
-	fi(ki),
-	si(xi("a", "b", "c"), ki)
-]))).if(ci, (e, t) => {
-	let n = {}, r = Fr(t, 0, 3);
+	Di,
+	Pi,
+	pi(Ai),
+	ci(Si("a", "b", "c"), Ai)
+]))).if(li, (e, t) => {
+	let n = {}, r = Ir(t, 0, 3);
 	for (let i = 0; i < r; i++) {
-		let r = Ui(t, e.shape.keys);
-		n[r] = Ui(t, e.shape.values);
+		let r = Wi(t, e.shape.keys);
+		n[r] = Wi(t, e.shape.values);
 	}
 	return n;
-}).done(), Ui = (e, t) => Hi(zi(t), e), Wi = typeof document < "u" ? document : {};
-U((e) => e.nodeType === Yi), typeof DOMParser < "u" && new DOMParser(), U((e) => e.nodeType === Ki), U((e) => e.nodeType === qi);
-var Gi = (e) => Qt(e, (e, t) => `${t}:${e};`).join(""), Ki = Wi.ELEMENT_NODE, qi = Wi.TEXT_NODE;
-Wi.CDATA_SECTION_NODE, Wi.COMMENT_NODE;
-var Ji = Wi.DOCUMENT_NODE;
-Wi.DOCUMENT_TYPE_NODE;
-var Yi = Wi.DOCUMENT_FRAGMENT_NODE;
-U((e) => e.nodeType === Ji);
+}).done(), Wi = (e, t) => Ui(Bi(t), e), Gi = typeof document < "u" ? document : {};
+H((e) => e.nodeType === Xi), typeof DOMParser < "u" && new DOMParser(), H((e) => e.nodeType === qi), H((e) => e.nodeType === Ji);
+var Ki = (e) => Qt(e, (e, t) => `${t}:${e};`).join(""), qi = Gi.ELEMENT_NODE, Ji = Gi.TEXT_NODE;
+Gi.CDATA_SECTION_NODE, Gi.COMMENT_NODE;
+var Yi = Gi.DOCUMENT_NODE;
+Gi.DOCUMENT_TYPE_NODE;
+var Xi = Gi.DOCUMENT_FRAGMENT_NODE;
+H((e) => e.nodeType === Yi);
 /* c8 ignore stop */
 //#endregion
 //#region node_modules/lib0/symbol.js
-var Xi = Symbol, Zi = Xi(), Qi = Xi(), $i = Xi(), ea = Xi(), ta = Xi(), na = Xi(), ra = Xi(), ia = Xi(), aa = Xi(), oa = (e) => {
+var Zi = Symbol, Qi = Zi(), $i = Zi(), ea = Zi(), ta = Zi(), na = Zi(), ra = Zi(), ia = Zi(), aa = Zi(), oa = Zi(), sa = (e) => {
 	var t;
 	e.length === 1 && ((t = e[0]) == null ? void 0 : t.constructor) === Function && (e = e[0]());
 	let n = [], r = [], i = 0;
@@ -1844,27 +1844,27 @@ ir();
 /* c8 ignore stop */
 //#endregion
 //#region node_modules/lib0/logging.js
-var sa = {
-	[Zi]: B("font-weight", "bold"),
-	[Qi]: B("font-weight", "normal"),
-	[$i]: B("color", "blue"),
-	[ta]: B("color", "green"),
-	[ea]: B("color", "grey"),
-	[na]: B("color", "red"),
-	[ra]: B("color", "purple"),
-	[ia]: B("color", "orange"),
-	[aa]: B("color", "black")
-}, ca = Mr ? (e) => {
+var ca = {
+	[Qi]: Pr("font-weight", "bold"),
+	[$i]: Pr("font-weight", "normal"),
+	[ea]: Pr("color", "blue"),
+	[na]: Pr("color", "green"),
+	[ta]: Pr("color", "grey"),
+	[ra]: Pr("color", "red"),
+	[ia]: Pr("color", "purple"),
+	[aa]: Pr("color", "orange"),
+	[oa]: Pr("color", "black")
+}, la = Mr ? (e) => {
 	var t;
 	e.length === 1 && ((t = e[0]) == null ? void 0 : t.constructor) === Function && (e = e[0]());
 	let n = [], r = [], i = N(), a = [], o = 0;
 	for (; o < e.length; o++) {
-		let t = e[o], a = sa[t];
+		let t = e[o], a = ca[t];
 		if (a !== void 0) i.set(a.left, a.right);
 		else {
 			if (t === void 0) break;
 			if (t.constructor === String || t.constructor === Number) {
-				let e = Gi(i);
+				let e = Ki(i);
 				o > 0 || e.length > 0 ? (n.push("%c" + t), r.push(e)) : n.push(t);
 			} else break;
 		}
@@ -1874,43 +1874,43 @@ var sa = {
 		t instanceof Symbol || a.push(t);
 	}
 	return a;
-} : oa, la = (...e) => {
+} : sa, ua = (...e) => {
 	/* c8 ignore next */
-	console.log(...ca(e)), da.forEach((t) => t.print(e));
-}, ua = (...e) => {
-	console.warn(...ca(e)), e.unshift(ia), da.forEach((t) => t.print(e));
-}, da = en(), fa = (e) => ({
+	console.log(...la(e)), fa.forEach((t) => t.print(e));
+}, da = (...e) => {
+	console.warn(...la(e)), e.unshift(aa), fa.forEach((t) => t.print(e));
+}, fa = en(), pa = (e) => ({
 	[Symbol.iterator]() {
 		return this;
 	},
 	next: e
-}), pa = (e, t) => fa(() => {
+}), ma = (e, t) => pa(() => {
 	let n;
 	do
 		n = e.next();
 	while (!n.done && !t(n.value));
 	return n;
-}), ma = (e, t) => fa(() => {
+}), ha = (e, t) => pa(() => {
 	let { done: n, value: r } = e.next();
 	return {
 		done: n,
 		value: n ? void 0 : t(r)
 	};
-}), ha = class {
+}), ga = class {
 	constructor(e, t) {
 		this.clock = e, this.len = t;
 	}
-}, ga = class {
+}, _a = class {
 	constructor() {
 		this.clients = /* @__PURE__ */ new Map();
 	}
-}, _a = (e, t, n) => t.clients.forEach((t, r) => {
+}, va = (e, t, n) => t.clients.forEach((t, r) => {
 	let i = e.doc.store.clients.get(r);
 	if (i != null) {
 		let r = i[i.length - 1], a = r.id.clock + r.length;
 		for (let r = 0, o = t[r]; r < t.length && o.clock < a; o = t[++r]) eo(e, i, o.clock, o.len, n);
 	}
-}), va = (e, t) => {
+}), ya = (e, t) => {
 	let n = 0, r = e.length - 1;
 	for (; n <= r;) {
 		let i = un((n + r) / 2), a = e[i], o = a.clock;
@@ -1920,21 +1920,21 @@ var sa = {
 		} else r = i - 1;
 	}
 	return null;
-}, ya = (e, t) => {
+}, ba = (e, t) => {
 	let n = e.clients.get(t.client);
-	return n !== void 0 && va(n, t.clock) !== null;
-}, ba = (e) => {
+	return n !== void 0 && ya(n, t.clock) !== null;
+}, xa = (e) => {
 	e.clients.forEach((e) => {
 		e.sort((e, t) => e.clock - t.clock);
 		let t, n;
 		for (t = 1, n = 1; t < e.length; t++) {
 			let r = e[n - 1], i = e[t];
-			r.clock + r.len >= i.clock ? e[n - 1] = new ha(r.clock, pn(r.len, i.clock + i.len - r.clock)) : (n < t && (e[n] = i), n++);
+			r.clock + r.len >= i.clock ? e[n - 1] = new ga(r.clock, pn(r.len, i.clock + i.len - r.clock)) : (n < t && (e[n] = i), n++);
 		}
 		e.length = n;
 	});
-}, xa = (e) => {
-	let t = new ga();
+}, Sa = (e) => {
+	let t = new _a();
 	for (let n = 0; n < e.length; n++) e[n].clients.forEach((r, i) => {
 		if (!t.clients.has(i)) {
 			let a = r.slice();
@@ -1942,10 +1942,10 @@ var sa = {
 			t.clients.set(i, a);
 		}
 	});
-	return ba(t), t;
-}, Sa = (e, t, n, r) => {
-	Zt(e.clients, t, () => []).push(new ha(n, r));
-}, Ca = () => new ga(), wa = (e, t) => {
+	return xa(t), t;
+}, Ca = (e, t, n, r) => {
+	Zt(e.clients, t, () => []).push(new ga(n, r));
+}, wa = () => new _a(), Ta = (e, t) => {
 	F(e.restEncoder, t.clients.size), rn(t.clients.entries()).sort((e, t) => t[0] - e[0]).forEach(([t, n]) => {
 		e.resetDsCurVal(), F(e.restEncoder, t);
 		let r = n.length;
@@ -1955,9 +1955,9 @@ var sa = {
 			e.writeDsClock(r.clock), e.writeDsLen(r.len);
 		}
 	});
-}, Ta = tr, Ea = class e extends ln {
+}, Ea = tr, Da = class e extends ln {
 	constructor({ guid: e = rr(), collectionid: t = null, gc: n = !0, gcFilter: r = () => !0, meta: i = null, autoLoad: a = !1, shouldLoad: o = !0 } = {}) {
-		super(), this.gc = n, this.gcFilter = r, this.clientID = Ta(), this.guid = e, this.collectionid = t, this.share = /* @__PURE__ */ new Map(), this.store = new Ka(), this._transaction = null, this._transactionCleanups = [], this.subdocs = /* @__PURE__ */ new Set(), this._item = null, this.shouldLoad = o, this.autoLoad = a, this.meta = i, this.isLoaded = !1, this.isSynced = !1, this.isDestroyed = !1, this.whenLoaded = ar((e) => {
+		super(), this.gc = n, this.gcFilter = r, this.clientID = Ea(), this.guid = e, this.collectionid = t, this.share = /* @__PURE__ */ new Map(), this.store = new qa(), this._transaction = null, this._transactionCleanups = [], this.subdocs = /* @__PURE__ */ new Set(), this._item = null, this.shouldLoad = o, this.autoLoad = a, this.meta = i, this.isLoaded = !1, this.isSynced = !1, this.isDestroyed = !1, this.whenLoaded = ar((e) => {
 			this.on("load", () => {
 				this.isLoaded = !0, e(this);
 			});
@@ -2036,7 +2036,7 @@ var sa = {
 		}
 		this.emit("destroyed", [!0]), this.emit("destroy", [this]), super.destroy();
 	}
-}, Da = class {
+}, Oa = class {
 	constructor() {
 		this.restEncoder = An();
 	}
@@ -2050,7 +2050,7 @@ var sa = {
 	writeDsLen(e) {
 		F(this.restEncoder, e);
 	}
-}, Oa = class extends Da {
+}, ka = class extends Oa {
 	writeLeftID(e) {
 		F(this.restEncoder, e.client), F(this.restEncoder, e.clock);
 	}
@@ -2087,7 +2087,7 @@ var sa = {
 	writeKey(e) {
 		Rn(this.restEncoder, e);
 	}
-}, ka = class {
+}, Aa = class {
 	constructor() {
 		this.restEncoder = An(), this.dsCurrVal = 0;
 	}
@@ -2104,7 +2104,7 @@ var sa = {
 	writeDsLen(e) {
 		e === 0 && R(), F(this.restEncoder, e - 1), this.dsCurrVal += e;
 	}
-}, Aa = class extends ka {
+}, ja = class extends Aa {
 	constructor() {
 		super(), this.keyMap = /* @__PURE__ */ new Map(), this.keyClock = 0, this.keyClockEncoder = new Zn(), this.clientEncoder = new Yn(), this.leftClockEncoder = new Zn(), this.rightClockEncoder = new Zn(), this.infoEncoder = new qn(Pn), this.stringEncoder = new Qn(), this.parentInfoEncoder = new qn(Pn), this.typeRefEncoder = new Yn(), this.lenEncoder = new Yn();
 	}
@@ -2149,69 +2149,69 @@ var sa = {
 		let t = this.keyMap.get(e);
 		t === void 0 ? (this.keyClockEncoder.write(this.keyClock++), this.stringEncoder.write(e)) : this.keyClockEncoder.write(t);
 	}
-}, ja = (e, t, n, r) => {
+}, Ma = (e, t, n, r) => {
 	r = pn(r, t[0].id.clock);
-	let i = Ya(t, r);
+	let i = G(t, r);
 	F(e.restEncoder, t.length - i), e.writeClient(n), F(e.restEncoder, r);
 	let a = t[i];
 	a.write(e, r - a.id.clock);
 	for (let n = i + 1; n < t.length; n++) t[n].write(e, 0);
-}, Ma = (e, t, n) => {
+}, Na = (e, t, n) => {
 	let r = /* @__PURE__ */ new Map();
 	n.forEach((e, n) => {
-		G(t, n) > e && r.set(n, e);
-	}), qa(t).forEach((e, t) => {
+		W(t, n) > e && r.set(n, e);
+	}), Ja(t).forEach((e, t) => {
 		n.has(t) || r.set(t, 0);
 	}), F(e.restEncoder, r.size), rn(r.entries()).sort((e, t) => t[0] - e[0]).forEach(([n, r]) => {
-		ja(e, t.clients.get(n), n, r);
+		Ma(e, t.clients.get(n), n, r);
 	});
-}, Na = (e, t) => Ma(e, t.doc.store, t.beforeState), Pa = class {
+}, Pa = (e, t) => Na(e, t.doc.store, t.beforeState), Fa = class {
 	constructor() {
 		this.l = [];
 	}
-}, Fa = () => new Pa(), Ia = (e, t) => e.l.push(t), La = (e, t) => {
+}, Ia = () => new Fa(), La = (e, t) => e.l.push(t), Ra = (e, t) => {
 	let n = e.l, r = n.length;
 	e.l = n.filter((e) => t !== e), r === e.l.length && console.error("[yjs] Tried to remove event handler that doesn't exist.");
-}, Ra = (e, t, n) => Sr(e.l, [t, n]), za = class {
+}, za = (e, t, n) => Sr(e.l, [t, n]), Ba = class {
 	constructor(e, t) {
 		this.client = e, this.clock = t;
 	}
-}, Ba = (e, t) => e === t || e !== null && t !== null && e.client === t.client && e.clock === t.clock, W = (e, t) => new za(e, t), Va = (e) => {
+}, Va = (e, t) => e === t || e !== null && t !== null && e.client === t.client && e.clock === t.clock, U = (e, t) => new Ba(e, t), Ha = (e) => {
 	for (let [t, n] of e.doc.share.entries()) if (n === e) return t;
 	throw R();
-}, Ha = (e, t) => {
+}, Ua = (e, t) => {
 	for (; t !== null;) {
 		if (t.parent === e) return !0;
 		t = t.parent._item;
 	}
 	return !1;
-}, Ua = class {
+}, Wa = class {
 	constructor(e, t) {
 		this.ds = e, this.sv = t;
 	}
 };
-((e, t) => new Ua(e, t))(Ca(), /* @__PURE__ */ new Map());
-var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.get(e.id.client) || 0) > e.id.clock && !ya(t.ds, e.id), Ga = (e, t) => {
-	let n = Zt(e.meta, Ga, en), r = e.doc.store;
+((e, t) => new Wa(e, t))(wa(), /* @__PURE__ */ new Map());
+var Ga = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.get(e.id.client) || 0) > e.id.clock && !ba(t.ds, e.id), Ka = (e, t) => {
+	let n = Zt(e.meta, Ka, en), r = e.doc.store;
 	n.has(t) || (t.sv.forEach((t, n) => {
-		t < G(r, n) && K(e, W(n, t));
-	}), _a(e, t.ds, (e) => {}), n.add(t));
-}, Ka = class {
+		t < W(r, n) && K(e, U(n, t));
+	}), va(e, t.ds, (e) => {}), n.add(t));
+}, qa = class {
 	constructor() {
 		this.clients = /* @__PURE__ */ new Map(), this.pendingStructs = null, this.pendingDs = null;
 	}
-}, qa = (e) => {
+}, Ja = (e) => {
 	let t = /* @__PURE__ */ new Map();
 	return e.clients.forEach((e, n) => {
 		let r = e[e.length - 1];
 		t.set(n, r.id.clock + r.length);
 	}), t;
-}, G = (e, t) => {
+}, W = (e, t) => {
 	let n = e.clients.get(t);
 	if (n === void 0) return 0;
 	let r = n[n.length - 1];
 	return r.id.clock + r.length;
-}, Ja = (e, t) => {
+}, Ya = (e, t) => {
 	let n = e.clients.get(t.id.client);
 	if (n === void 0) n = [], e.clients.set(t.id.client, n);
 	else {
@@ -2219,7 +2219,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		if (e.id.clock + e.length !== t.id.clock) throw R();
 	}
 	n.push(t);
-}, Ya = (e, t) => {
+}, G = (e, t) => {
 	let n = 0, r = e.length - 1, i = e[r], a = i.id.clock;
 	if (a === t) return r;
 	let o = un(t / (a + i.length - 1) * r);
@@ -2233,19 +2233,19 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	throw R();
 }, Xa = (e, t) => {
 	let n = e.clients.get(t.client);
-	return n[Ya(n, t.clock)];
+	return n[G(n, t.clock)];
 }, Za = (e, t, n) => {
-	let r = Ya(t, n), i = t[r];
+	let r = G(t, n), i = t[r];
 	return i.id.clock < n && i instanceof Q ? (t.splice(r + 1, 0, Ms(e, i, n - i.id.clock)), r + 1) : r;
 }, K = (e, t) => {
 	let n = e.doc.store.clients.get(t.client);
 	return n[Za(e, n, t.clock)];
 }, Qa = (e, t, n) => {
-	let r = t.clients.get(n.client), i = Ya(r, n.clock), a = r[i];
+	let r = t.clients.get(n.client), i = G(r, n.clock), a = r[i];
 	return n.clock !== a.id.clock + a.length - 1 && a.constructor !== hs && r.splice(i + 1, 0, Ms(e, a, n.clock - a.id.clock + 1)), a;
 }, $a = (e, t, n) => {
 	let r = e.clients.get(t.id.client);
-	r[Ya(r, t.id.clock)] = n;
+	r[G(r, t.id.clock)] = n;
 }, eo = (e, t, n, r, i) => {
 	if (r === 0) return;
 	let a = n + r, o = Za(e, t, n), s;
@@ -2254,9 +2254,9 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	while (o < t.length && t[o].id.clock < a);
 }, to = class {
 	constructor(e, t, n) {
-		this.doc = e, this.deleteSet = new ga(), this.beforeState = qa(e.store), this.afterState = /* @__PURE__ */ new Map(), this.changed = /* @__PURE__ */ new Map(), this.changedParentTypes = /* @__PURE__ */ new Map(), this._mergeStructs = [], this.origin = t, this.meta = /* @__PURE__ */ new Map(), this.local = n, this.subdocsAdded = /* @__PURE__ */ new Set(), this.subdocsRemoved = /* @__PURE__ */ new Set(), this.subdocsLoaded = /* @__PURE__ */ new Set(), this._needFormattingCleanup = !1;
+		this.doc = e, this.deleteSet = new _a(), this.beforeState = Ja(e.store), this.afterState = /* @__PURE__ */ new Map(), this.changed = /* @__PURE__ */ new Map(), this.changedParentTypes = /* @__PURE__ */ new Map(), this._mergeStructs = [], this.origin = t, this.meta = /* @__PURE__ */ new Map(), this.local = n, this.subdocsAdded = /* @__PURE__ */ new Set(), this.subdocsRemoved = /* @__PURE__ */ new Set(), this.subdocsLoaded = /* @__PURE__ */ new Set(), this._needFormattingCleanup = !1;
 	}
-}, no = (e, t) => t.deleteSet.clients.size === 0 && !$t(t.afterState, (e, n) => t.beforeState.get(n) !== e) ? !1 : (ba(t.deleteSet), Na(e, t), wa(e, t.deleteSet), !0), ro = (e, t, n) => {
+}, no = (e, t) => t.deleteSet.clients.size === 0 && !$t(t.afterState, (e, n) => t.beforeState.get(n) !== e) ? !1 : (xa(t.deleteSet), Pa(e, t), Ta(e, t.deleteSet), !0), ro = (e, t, n) => {
 	let r = t._item;
 	(r === null || r.id.clock < (e.beforeState.get(r.id.client) || 0) && !r.deleted) && Zt(e.changed, t, en).add(n);
 }, io = (e, t) => {
@@ -2275,7 +2275,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		let e = t.clients.get(r);
 		for (let r = i.length - 1; r >= 0; r--) {
 			let a = i[r], o = a.clock + a.len;
-			for (let r = Ya(e, a.clock), i = e[r]; r < e.length && i.id.clock < o; i = e[++r]) {
+			for (let r = G(e, a.clock), i = e[r]; r < e.length && i.id.clock < o; i = e[++r]) {
 				let i = e[r];
 				if (a.clock + a.len <= i.id.clock) break;
 				i instanceof Q && i.deleted && !i.keep && n(i) && i.gc(t, !1);
@@ -2286,7 +2286,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	e.clients.forEach((e, n) => {
 		let r = t.clients.get(n);
 		for (let t = e.length - 1; t >= 0; t--) {
-			let n = e[t], i = fn(r.length - 1, 1 + Ya(r, n.clock + n.len - 1));
+			let n = e[t], i = fn(r.length - 1, 1 + G(r, n.clock + n.len - 1));
 			for (let e = i, t = r[e]; e > 0 && t.id.clock >= n.clock; t = r[e]) e -= 1 + io(r, e);
 		}
 	});
@@ -2294,7 +2294,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	if (t < e.length) {
 		let n = e[t], r = n.doc, i = r.store, a = n.deleteSet, o = n._mergeStructs;
 		try {
-			ba(a), n.afterState = qa(n.doc.store), r.emit("beforeObserverCalls", [n, r]);
+			xa(a), n.afterState = Ja(n.doc.store), r.emit("beforeObserverCalls", [n, r]);
 			let e = [];
 			n.changed.forEach((t, r) => e.push(() => {
 				(r._item === null || !r._item.deleted) && r._callObserver(n, t);
@@ -2303,7 +2303,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 					r._dEH.l.length > 0 && (r._item === null || !r._item.deleted) && (t = t.filter((e) => e.target._item === null || !e.target._item.deleted), t.forEach((e) => {
 						e.currentTarget = r, e._path = null;
 					}), t.sort((e, t) => e.path.length - t.path.length), e.push(() => {
-						Ra(r._dEH, t, n);
+						za(r._dEH, t, n);
 					}));
 				}), e.push(() => r.emit("afterTransaction", [n, r])), e.push(() => {
 					n._needFormattingCleanup && as(n);
@@ -2313,16 +2313,16 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 			r.gc && ao(a, i, r.gcFilter), oo(a, i), n.afterState.forEach((e, t) => {
 				let r = n.beforeState.get(t) || 0;
 				if (r !== e) {
-					let e = i.clients.get(t), n = pn(Ya(e, r), 1);
+					let e = i.clients.get(t), n = pn(G(e, r), 1);
 					for (let t = e.length - 1; t >= n;) t -= 1 + io(e, t);
 				}
 			});
 			for (let e = o.length - 1; e >= 0; e--) {
-				let { client: t, clock: n } = o[e].id, r = i.clients.get(t), a = Ya(r, n);
+				let { client: t, clock: n } = o[e].id, r = i.clients.get(t), a = G(r, n);
 				a + 1 < r.length && io(r, a + 1) > 1 || a > 0 && io(r, a);
 			}
-			if (!n.local && n.afterState.get(r.clientID) !== n.beforeState.get(r.clientID) && (la(ia, Zi, "[yjs] ", Qi, na, "Changed the client-id because another client seems to be using it."), r.clientID = Ta()), r.emit("afterTransactionCleanup", [n, r]), r._observers.has("update")) {
-				let e = new Oa();
+			if (!n.local && n.afterState.get(r.clientID) !== n.beforeState.get(r.clientID) && (ua(aa, Qi, "[yjs] ", $i, ra, "Changed the client-id because another client seems to be using it."), r.clientID = Ea()), r.emit("afterTransactionCleanup", [n, r]), r._observers.has("update")) {
+				let e = new ka();
 				no(e, n) && r.emit("update", [
 					e.toUint8Array(),
 					n.origin,
@@ -2331,7 +2331,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 				]);
 			}
 			if (r._observers.has("updateV2")) {
-				let e = new Aa();
+				let e = new ja();
 				no(e, n) && r.emit("updateV2", [
 					e.toUint8Array(),
 					n.origin,
@@ -2370,24 +2370,24 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		this.insertions = t, this.deletions = e, this.meta = /* @__PURE__ */ new Map();
 	}
 }, lo = (e, t, n) => {
-	_a(e, n.deletions, (n) => {
-		n instanceof Q && t.scope.some((t) => t === e.doc || Ha(t, n)) && js(n, !1);
+	va(e, n.deletions, (n) => {
+		n instanceof Q && t.scope.some((t) => t === e.doc || Ua(t, n)) && js(n, !1);
 	});
 }, uo = (e, t, n) => {
 	let r = null, i = e.doc, a = e.scope;
 	q(i, (n) => {
 		for (; t.length > 0 && e.currStackItem === null;) {
 			let r = i.store, o = t.pop(), s = /* @__PURE__ */ new Set(), c = [], l = !1;
-			_a(n, o.insertions, (e) => {
+			va(n, o.insertions, (e) => {
 				if (e instanceof Q) {
 					if (e.redone !== null) {
 						let { item: t, diff: i } = As(r, e.id);
-						i > 0 && (t = K(n, W(t.id.client, t.id.clock + i))), e = t;
+						i > 0 && (t = K(n, U(t.id.client, t.id.clock + i))), e = t;
 					}
-					!e.deleted && a.some((t) => t === n.doc || Ha(t, e)) && c.push(e);
+					!e.deleted && a.some((t) => t === n.doc || Ua(t, e)) && c.push(e);
 				}
-			}), _a(n, o.deletions, (e) => {
-				e instanceof Q && a.some((t) => t === n.doc || Ha(t, e)) && !ya(o.insertions, e.id) && s.add(e);
+			}), va(n, o.deletions, (e) => {
+				e instanceof Q && a.some((t) => t === n.doc || Ua(t, e)) && !ba(o.insertions, e.id) && s.add(e);
 			}), s.forEach((t) => {
 				l = Ps(n, t, s, o.insertions, e.ignoreRemoteMapChanges, e) !== null || l;
 			});
@@ -2413,23 +2413,23 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	}
 	return o;
 }, fo = class extends ln {
-	constructor(e, { captureTimeout: t = 500, captureTransaction: n = (e) => !0, deleteFilter: r = () => !0, trackedOrigins: i = new Set([null]), ignoreRemoteMapChanges: a = !1, doc: o = cn(e) ? e[0].doc : e instanceof Ea ? e : e.doc } = {}) {
+	constructor(e, { captureTimeout: t = 500, captureTransaction: n = (e) => !0, deleteFilter: r = () => !0, trackedOrigins: i = new Set([null]), ignoreRemoteMapChanges: a = !1, doc: o = cn(e) ? e[0].doc : e instanceof Da ? e : e.doc } = {}) {
 		super(), this.scope = [], this.doc = o, this.addToScope(e), this.deleteFilter = r, i.add(this), this.trackedOrigins = i, this.captureTransaction = n, this.undoStack = [], this.redoStack = [], this.undoing = !1, this.redoing = !1, this.currStackItem = null, this.lastChange = 0, this.ignoreRemoteMapChanges = a, this.captureTimeout = t, this.afterTransactionHandler = (e) => {
 			if (!this.captureTransaction(e) || !this.scope.some((t) => e.changedParentTypes.has(t) || t === this.doc) || !this.trackedOrigins.has(e.origin) && (!e.origin || !this.trackedOrigins.has(e.origin.constructor))) return;
 			let t = this.undoing, n = this.redoing, r = t ? this.redoStack : this.undoStack;
 			t ? this.stopCapturing() : n || this.clear(!1, !0);
-			let i = new ga();
+			let i = new _a();
 			e.afterState.forEach((t, n) => {
 				let r = e.beforeState.get(n) || 0, a = t - r;
-				a > 0 && Sa(i, n, r, a);
+				a > 0 && Ca(i, n, r, a);
 			});
 			let a = ir(), o = !1;
 			if (this.lastChange > 0 && a - this.lastChange < this.captureTimeout && r.length > 0 && !t && !n) {
 				let t = r[r.length - 1];
-				t.deletions = xa([t.deletions, e.deleteSet]), t.insertions = xa([t.insertions, i]);
+				t.deletions = Sa([t.deletions, e.deleteSet]), t.insertions = Sa([t.insertions, i]);
 			} else r.push(new co(e.deleteSet, i)), o = !0;
-			!t && !n && (this.lastChange = a), _a(e, e.deleteSet, (t) => {
-				t instanceof Q && this.scope.some((n) => n === e.doc || Ha(n, t)) && js(t, !0);
+			!t && !n && (this.lastChange = a), va(e, e.deleteSet, (t) => {
+				t instanceof Q && this.scope.some((n) => n === e.doc || Ua(n, t)) && js(t, !0);
 			});
 			let s = [{
 				stackItem: r[r.length - 1],
@@ -2445,7 +2445,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	addToScope(e) {
 		let t = new Set(this.scope);
 		e = cn(e) ? e : [e], e.forEach((e) => {
-			t.has(e) || (t.add(e), (e instanceof Y ? e.doc !== this.doc : e !== this.doc) && ua("[yjs#509] Not same Y.Doc"), this.scope.push(e));
+			t.has(e) || (t.add(e), (e instanceof Y ? e.doc !== this.doc : e !== this.doc) && da("[yjs#509] Not same Y.Doc"), this.scope.push(e));
 		});
 	}
 	addTrackedOrigin(e) {
@@ -2502,7 +2502,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		return this._path || (this._path = ho(this.currentTarget, this.target));
 	}
 	deletes(e) {
-		return ya(this.transaction.deleteSet, e.id);
+		return ba(this.transaction.deleteSet, e.id);
 	}
 	get keys() {
 		if (this._keys === null) {
@@ -2568,7 +2568,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	}
 	return n;
 }, J = () => {
-	ua("Invalid access: Add Yjs type to a document before reading data.");
+	da("Invalid access: Add Yjs type to a document before reading data.");
 }, go = 80, _o = 0, vo = class {
 	constructor(e, t) {
 		e.marker = !0, this.p = e, this.index = t, this.timestamp = _o++;
@@ -2615,10 +2615,10 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 }, wo = (e, t, n) => {
 	let r = e, i = t.changedParentTypes;
 	for (; Zt(i, e, () => []).push(n), e._item !== null;) e = e._item.parent;
-	Ra(r._eH, n, t);
+	za(r._eH, n, t);
 }, Y = class {
 	constructor() {
-		this._item = null, this._map = /* @__PURE__ */ new Map(), this._start = null, this.doc = null, this._length = 0, this._eH = Fa(), this._dEH = Fa(), this._searchMarker = null;
+		this._item = null, this._map = /* @__PURE__ */ new Map(), this._start = null, this.doc = null, this._length = 0, this._eH = Ia(), this._dEH = Ia(), this._searchMarker = null;
 	}
 	get parent() {
 		return this._item ? this._item.parent : null;
@@ -2642,16 +2642,16 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		!e.local && this._searchMarker && (this._searchMarker.length = 0);
 	}
 	observe(e) {
-		Ia(this._eH, e);
+		La(this._eH, e);
 	}
 	observeDeep(e) {
-		Ia(this._dEH, e);
+		La(this._dEH, e);
 	}
 	unobserve(e) {
-		La(this._eH, e);
+		Ra(this._eH, e);
 	}
 	unobserveDeep(e) {
-		La(this._dEH, e);
+		Ra(this._dEH, e);
 	}
 	toJSON() {}
 }, To = (e, t, n) => {
@@ -2725,7 +2725,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	}
 }, jo = (e, t, n, r) => {
 	let i = n, a = e.doc, o = a.clientID, s = a.store, c = n === null ? t._start : n.right, l = [], u = () => {
-		l.length > 0 && (i = new Q(W(o, G(s, o)), i, i && i.lastId, c, c && c.id, t, null, new Ss(l)), i.integrate(e, 0), l = []);
+		l.length > 0 && (i = new Q(U(o, W(s, o)), i, i && i.lastId, c, c && c.id, t, null, new Ss(l)), i.integrate(e, 0), l = []);
 	};
 	r.forEach((n) => {
 		if (n === null) l.push(n);
@@ -2740,12 +2740,12 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 			default: switch (u(), n.constructor) {
 				case Uint8Array:
 				case ArrayBuffer:
-					i = new Q(W(o, G(s, o)), i, i && i.lastId, c, c && c.id, t, null, new gs(new Uint8Array(n))), i.integrate(e, 0);
+					i = new Q(U(o, W(s, o)), i, i && i.lastId, c, c && c.id, t, null, new gs(new Uint8Array(n))), i.integrate(e, 0);
 					break;
-				case Ea:
-					i = new Q(W(o, G(s, o)), i, i && i.lastId, c, c && c.id, t, null, new ys(n)), i.integrate(e, 0);
+				case Da:
+					i = new Q(U(o, W(s, o)), i, i && i.lastId, c, c && c.id, t, null, new ys(n)), i.integrate(e, 0);
 					break;
-				default: if (n instanceof Y) i = new Q(W(o, G(s, o)), i, i && i.lastId, c, c && c.id, t, null, new ks(n)), i.integrate(e, 0);
+				default: if (n instanceof Y) i = new Q(U(o, W(s, o)), i, i && i.lastId, c, c && c.id, t, null, new ks(n)), i.integrate(e, 0);
 				else throw Error("Unexpected content type in insert operation");
 			}
 		}
@@ -2756,7 +2756,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	let i = n, a = So(t, n), o = t._start;
 	for (a !== null && (o = a.p, n -= a.index, n === 0 && (o = o.prev, n += o && o.countable && !o.deleted ? o.length : 0)); o !== null; o = o.right) if (!o.deleted && o.countable) {
 		if (n <= o.length) {
-			n < o.length && K(e, W(o.id.client, o.id.clock + n));
+			n < o.length && K(e, U(o.id.client, o.id.clock + n));
 			break;
 		}
 		n -= o.length;
@@ -2772,8 +2772,8 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 }, Fo = (e, t, n, r) => {
 	if (r === 0) return;
 	let i = n, a = r, o = So(t, n), s = t._start;
-	for (o !== null && (s = o.p, n -= o.index); s !== null && n > 0; s = s.right) !s.deleted && s.countable && (n < s.length && K(e, W(s.id.client, s.id.clock + n)), n -= s.length);
-	for (; r > 0 && s !== null;) s.deleted || (r < s.length && K(e, W(s.id.client, s.id.clock + r)), s.delete(e), r -= s.length), s = s.right;
+	for (o !== null && (s = o.p, n -= o.index); s !== null && n > 0; s = s.right) !s.deleted && s.countable && (n < s.length && K(e, U(s.id.client, s.id.clock + n)), n -= s.length);
+	for (; r > 0 && s !== null;) s.deleted || (r < s.length && K(e, U(s.id.client, s.id.clock + r)), s.delete(e), r -= s.length), s = s.right;
 	if (r > 0) throw Mo();
 	t._searchMarker && Co(t._searchMarker, i, -a + r);
 }, Io = (e, t, n) => {
@@ -2795,13 +2795,13 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		case Uint8Array:
 			s = new gs(r);
 			break;
-		case Ea:
+		case Da:
 			s = new ys(r);
 			break;
 		default: if (r instanceof Y) s = new ks(r);
 		else throw Error("Unexpected content type");
 	}
-	new Q(W(o, G(a.store, o)), i, i && i.lastId, null, null, t, n, s).integrate(e, 0);
+	new Q(U(o, W(a.store, o)), i, i && i.lastId, null, null, t, n, s).integrate(e, 0);
 }, Ro = (e, t) => {
 	e.doc != null || J();
 	let n = e._map.get(t);
@@ -2820,9 +2820,9 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	return e._map.forEach((e, r) => {
 		let i = e;
 		for (; i !== null && (!t.sv.has(i.id.client) || i.id.clock >= (t.sv.get(i.id.client) || 0));) i = i.left;
-		i !== null && Wa(i, t) && (n[r] = i.content.getContent()[i.length - 1]);
+		i !== null && Ga(i, t) && (n[r] = i.content.getContent()[i.length - 1]);
 	}), n;
-}, Ho = (e) => (e.doc != null || J(), pa(e._map.entries(), (e) => !e[1].deleted)), Uo = class extends mo {}, Wo = class e extends Y {
+}, Ho = (e) => (e.doc != null || J(), ma(e._map.entries(), (e) => !e[1].deleted)), Uo = class extends mo {}, Wo = class e extends Y {
 	constructor() {
 		super(), this._prelimContent = [], this._searchMarker = [];
 	}
@@ -2927,13 +2927,13 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		return [...Ho(this)].length;
 	}
 	keys() {
-		return ma(Ho(this), (e) => e[0]);
+		return ha(Ho(this), (e) => e[0]);
 	}
 	values() {
-		return ma(Ho(this), (e) => e[1].content.getContent()[e[1].length - 1]);
+		return ha(Ho(this), (e) => e[1].content.getContent()[e[1].length - 1]);
 	}
 	entries() {
-		return ma(Ho(this), (e) => [e[0], e[1].content.getContent()[e[1].length - 1]]);
+		return ha(Ho(this), (e) => [e[0], e[1].content.getContent()[e[1].length - 1]]);
 	}
 	forEach(e) {
 		this.doc != null || J(), this._map.forEach((t, n) => {
@@ -2991,7 +2991,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 				t.right.deleted || Zo(t.currentAttributes, t.right.content);
 				break;
 			default:
-				t.right.deleted || (n < t.right.length && K(e, W(t.right.id.client, t.right.id.clock + n)), t.index += t.right.length, n -= t.right.length);
+				t.right.deleted || (n < t.right.length && K(e, U(t.right.id.client, t.right.id.clock + n)), t.index += t.right.length, n -= t.right.length);
 				break;
 		}
 		t.left = t.right, t.right = t.right.right;
@@ -3004,7 +3004,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	for (; n.right !== null && (n.right.deleted === !0 || n.right.content.constructor === Z && Ko(r.get(n.right.content.key), n.right.content.value));) n.right.deleted || r.delete(n.right.content.key), n.forward();
 	let i = e.doc, a = i.clientID;
 	r.forEach((r, o) => {
-		let s = n.left, c = n.right, l = new Q(W(a, G(i.store, a)), s, s && s.lastId, c, c && c.id, t, null, new Z(o, r));
+		let s = n.left, c = n.right, l = new Q(U(a, W(i.store, a)), s, s && s.lastId, c, c && c.id, t, null, new Z(o, r));
 		l.integrate(e, 0), n.right = l, n.forward();
 	});
 }, Zo = (e, t) => {
@@ -3024,7 +3024,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		if (!Ko(u, l)) {
 			o.set(c, u);
 			let { left: r, right: s } = n;
-			n.right = new Q(W(a, G(i.store, a)), r, r && r.lastId, s, s && s.id, t, null, new Z(c, l)), n.right.integrate(e, 0), n.forward();
+			n.right = new Q(U(a, W(i.store, a)), r, r && r.lastId, s, s && s.id, t, null, new Z(c, l)), n.right.integrate(e, 0), n.forward();
 		}
 	}
 	return o;
@@ -3035,7 +3035,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	let a = e.doc, o = a.clientID;
 	Qo(n, i);
 	let s = $o(e, t, n, i), c = r.constructor === String ? new Cs(r) : r instanceof Y ? new ks(r) : new bs(r), { left: l, right: u, index: d } = n;
-	t._searchMarker && Co(t._searchMarker, n.index, c.getLength()), u = new Q(W(o, G(a.store, o)), l, l && l.lastId, u, u && u.id, t, null, c), u.integrate(e, 0), n.right = u, n.index = d, n.forward(), Xo(e, t, n, s);
+	t._searchMarker && Co(t._searchMarker, n.index, c.getLength()), u = new Q(U(o, W(a.store, o)), l, l && l.lastId, u, u && u.id, t, null, c), u.integrate(e, 0), n.right = u, n.index = d, n.forward(), Xo(e, t, n, s);
 }, ts = (e, t, n, r, i) => {
 	let a = e.doc, o = a.clientID;
 	Qo(n, i);
@@ -3055,7 +3055,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 				break;
 			}
 			default:
-				r < n.right.length && K(e, W(n.right.id.client, n.right.id.clock + r)), r -= n.right.length;
+				r < n.right.length && K(e, U(n.right.id.client, n.right.id.clock + r)), r -= n.right.length;
 				break;
 		}
 		n.forward();
@@ -3063,7 +3063,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	if (r > 0) {
 		let i = "";
 		for (; r > 0; r--) i += "\n";
-		n.right = new Q(W(o, G(a.store, o)), n.left, n.left && n.left.lastId, n.right, n.right && n.right.id, t, null, new Cs(i)), n.right.integrate(e, 0), n.forward();
+		n.right = new Q(U(o, W(a.store, o)), n.left, n.left && n.left.lastId, n.right, n.right && n.right.id, t, null, new Cs(i)), n.right.integrate(e, 0), n.forward();
 	}
 	Xo(e, t, n, s);
 }, ns = (e, t, n, r, i) => {
@@ -3130,7 +3130,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		});
 	}
 	q(n, (n) => {
-		_a(e, e.deleteSet, (e) => {
+		va(e, e.deleteSet, (e) => {
 			if (e instanceof hs || !e.parent._hasFormatting || t.has(e.parent)) return;
 			let r = e.parent;
 			e.content.constructor === Z ? t.add(r) : rs(n, e);
@@ -3144,7 +3144,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 			case ks:
 			case bs:
 			case Cs:
-				n < t.right.length && K(e, W(t.right.id.client, t.right.id.clock + n)), n -= t.right.length, t.right.delete(e);
+				n < t.right.length && K(e, U(t.right.id.client, t.right.id.clock + n)), n -= t.right.length, t.right.delete(e);
 				break;
 		}
 		t.forward();
@@ -3298,10 +3298,10 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		}
 		let l = () => {
 			for (; s !== null;) {
-				if (Wa(s, e) || t !== void 0 && Wa(s, t)) switch (s.content.constructor) {
+				if (Ga(s, e) || t !== void 0 && Ga(s, t)) switch (s.content.constructor) {
 					case Cs: {
 						let r = i.get("ychange");
-						e !== void 0 && !Wa(s, e) ? (r === void 0 || r.user !== s.id.client || r.type !== "removed") && (c(), i.set("ychange", n ? n("removed", s.id) : { type: "removed" })) : t !== void 0 && !Wa(s, t) ? (r === void 0 || r.user !== s.id.client || r.type !== "added") && (c(), i.set("ychange", n ? n("added", s.id) : { type: "added" })) : r !== void 0 && (c(), i.delete("ychange")), o += s.content.str;
+						e !== void 0 && !Ga(s, e) ? (r === void 0 || r.user !== s.id.client || r.type !== "removed") && (c(), i.set("ychange", n ? n("removed", s.id) : { type: "removed" })) : t !== void 0 && !Ga(s, t) ? (r === void 0 || r.user !== s.id.client || r.type !== "added") && (c(), i.set("ychange", n ? n("added", s.id) : { type: "added" })) : r !== void 0 && (c(), i.delete("ychange")), o += s.content.str;
 						break;
 					}
 					case ks:
@@ -3318,7 +3318,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 						break;
 					}
 					case Z:
-						Wa(s, e) && (c(), Zo(i, s.content));
+						Ga(s, e) && (c(), Zo(i, s.content));
 						break;
 				}
 				s = s.right;
@@ -3326,7 +3326,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 			c();
 		};
 		return e || t ? q(a, (n) => {
-			e && Ga(n, e), t && Ga(n, t), l();
+			e && Ka(n, e), t && Ka(n, t), l();
 		}, "cleanup") : l(), r;
 	}
 	insert(e, t, n) {
@@ -3597,7 +3597,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		return this.constructor === e.constructor ? (this.length += e.length, !0) : !1;
 	}
 	integrate(e, t) {
-		t > 0 && (this.id.clock += t, this.length -= t), Ja(e.doc.store, this);
+		t > 0 && (this.id.clock += t, this.length -= t), Ya(e.doc.store, this);
 	}
 	write(e, t) {
 		e.writeInfo(ms), e.writeLen(this.length - t);
@@ -3660,7 +3660,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		return this.len += e.len, !0;
 	}
 	integrate(e, t) {
-		Sa(e.deleteSet, t.id.client, t.id.clock, this.len), t.markDeleted();
+		Ca(e.deleteSet, t.id.client, t.id.clock, this.len), t.markDeleted();
 	}
 	delete(e) {}
 	gc(e) {}
@@ -3670,7 +3670,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	getRef() {
 		return 1;
 	}
-}, vs = (e, t) => new Ea(O(O({ guid: e }, t), {}, { shouldLoad: t.shouldLoad || t.autoLoad || !1 })), ys = class e {
+}, vs = (e, t) => new Da(O(O({ guid: e }, t), {}, { shouldLoad: t.shouldLoad || t.autoLoad || !1 })), ys = class e {
 	constructor(e) {
 		e._item && console.error("This document was already integrated as a sub-document. You should create a second instance instead with the same guid."), this.doc = e;
 		let t = {};
@@ -3891,7 +3891,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 }, As = (e, t) => {
 	let n = t, r = 0, i;
 	do
-		r > 0 && (n = W(n.client, n.clock + r)), i = Xa(e, n), r = n.clock - i.id.clock, n = i.redone;
+		r > 0 && (n = U(n.client, n.clock + r)), i = Xa(e, n), r = n.clock - i.id.clock, n = i.redone;
 	while (n !== null && i instanceof Q);
 	return {
 		item: i,
@@ -3900,9 +3900,9 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 }, js = (e, t) => {
 	for (; e !== null && e.keep !== t;) e.keep = t, e = e.parent._item;
 }, Ms = (e, t, n) => {
-	let { client: r, clock: i } = t.id, a = new Q(W(r, i + n), t, W(r, i + n - 1), t.right, t.rightOrigin, t.parent, t.parentSub, t.content.splice(n));
-	return t.deleted && a.markDeleted(), t.keep && (a.keep = !0), t.redone !== null && (a.redone = W(t.redone.client, t.redone.clock + n)), t.right = a, a.right !== null && (a.right.left = a), e._mergeStructs.push(a), a.parentSub !== null && a.right === null && a.parent._map.set(a.parentSub, a), t.length = n, a;
-}, Ns = (e, t) => on(e, (e) => ya(e.deletions, t)), Ps = (e, t, n, r, i, a) => {
+	let { client: r, clock: i } = t.id, a = new Q(U(r, i + n), t, U(r, i + n - 1), t.right, t.rightOrigin, t.parent, t.parentSub, t.content.splice(n));
+	return t.deleted && a.markDeleted(), t.keep && (a.keep = !0), t.redone !== null && (a.redone = U(t.redone.client, t.redone.clock + n)), t.right = a, a.right !== null && (a.right.left = a), e._mergeStructs.push(a), a.parentSub !== null && a.right === null && a.parent._map.set(a.parentSub, a), t.length = n, a;
+}, Ns = (e, t) => on(e, (e) => ba(e.deletions, t)), Ps = (e, t, n, r, i, a) => {
 	let o = e.doc, s = o.store, c = o.clientID, l = t.redone;
 	if (l !== null) return K(e, l);
 	let u = t.parent._item, d = null, f;
@@ -3931,10 +3931,10 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 			f = f.right;
 		}
 	} else if (f = null, t.right && !i) {
-		for (d = t; d !== null && d.right !== null && (d.right.redone || ya(r, d.right.id) || Ns(a.undoStack, d.right.id) || Ns(a.redoStack, d.right.id));) for (d = d.right; d.redone;) d = K(e, d.redone);
+		for (d = t; d !== null && d.right !== null && (d.right.redone || ba(r, d.right.id) || Ns(a.undoStack, d.right.id) || Ns(a.redoStack, d.right.id));) for (d = d.right; d.redone;) d = K(e, d.redone);
 		if (d && d.right !== null) return null;
 	} else d = p._map.get(t.parentSub) || null;
-	let m = W(c, G(s, c)), h = new Q(m, d, d && d.lastId, f, f && f.id, p, t.parentSub, t.content.copy());
+	let m = U(c, W(s, c)), h = new Q(m, d, d && d.lastId, f, f && f.id, p, t.parentSub, t.content.copy());
 	return t.redone = m, js(h, !0), h.integrate(e, 0), h;
 }, Q = class e extends ps {
 	constructor(e, t, n, r, i, a, o, s) {
@@ -3965,19 +3965,19 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		this.info |= 4;
 	}
 	getMissing(t, n) {
-		if (this.origin && this.origin.client !== this.id.client && this.origin.clock >= G(n, this.origin.client)) return this.origin.client;
-		if (this.rightOrigin && this.rightOrigin.client !== this.id.client && this.rightOrigin.clock >= G(n, this.rightOrigin.client)) return this.rightOrigin.client;
-		if (this.parent && this.parent.constructor === za && this.id.client !== this.parent.client && this.parent.clock >= G(n, this.parent.client)) return this.parent.client;
+		if (this.origin && this.origin.client !== this.id.client && this.origin.clock >= W(n, this.origin.client)) return this.origin.client;
+		if (this.rightOrigin && this.rightOrigin.client !== this.id.client && this.rightOrigin.clock >= W(n, this.rightOrigin.client)) return this.rightOrigin.client;
+		if (this.parent && this.parent.constructor === Ba && this.id.client !== this.parent.client && this.parent.clock >= W(n, this.parent.client)) return this.parent.client;
 		if (this.origin && (this.left = Qa(t, n, this.origin), this.origin = this.left.lastId), this.rightOrigin && (this.right = K(t, this.rightOrigin), this.rightOrigin = this.right.id), this.left && this.left.constructor === hs || this.right && this.right.constructor === hs) 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 === za) {
+		else if (this.parent.constructor === Ba) {
 			let e = Xa(n, this.parent);
 			e.constructor === hs ? this.parent = null : this.parent = e.content.type;
 		}
 		return null;
 	}
 	integrate(e, t) {
-		if (t > 0 && (this.id.clock += t, this.left = Qa(e, e.doc.store, W(this.id.client, this.id.clock - 1)), this.origin = this.left.lastId, this.content = this.content.splice(t), this.length -= t), this.parent) {
+		if (t > 0 && (this.id.clock += t, this.left = Qa(e, e.doc.store, U(this.id.client, this.id.clock - 1)), this.origin = this.left.lastId, this.content = this.content.splice(t), this.length -= t), this.parent) {
 			if (!this.left && (!this.right || this.right.left !== null) || this.left && this.left.right !== this.right) {
 				let t = this.left, n;
 				if (t !== null) n = t.right;
@@ -3985,9 +3985,9 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 				else n = this.parent._start;
 				let r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set();
 				for (; n !== null && n !== this.right;) {
-					if (i.add(n), r.add(n), Ba(this.origin, n.origin)) {
+					if (i.add(n), r.add(n), Va(this.origin, n.origin)) {
 						if (n.id.client < this.id.client) t = n, r.clear();
-						else if (Ba(this.rightOrigin, n.rightOrigin)) break;
+						else if (Va(this.rightOrigin, n.rightOrigin)) break;
 					} else if (n.origin !== null && i.has(Xa(e.doc.store, n.origin))) r.has(Xa(e.doc.store, n.origin)) || (t = n, r.clear());
 					else break;
 					n = n.right;
@@ -4001,7 +4001,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 				else e = this.parent._start, this.parent._start = this;
 				this.right = e;
 			}
-			this.right === null ? this.parentSub !== null && (this.parent._map.set(this.parentSub, this), this.left !== null && this.left.delete(e)) : this.right.left = this, this.parentSub === null && this.countable && !this.deleted && (this.parent._length += this.length), Ja(e.doc.store, this), this.content.integrate(e, this), ro(e, this.parent, this.parentSub), (this.parent._item !== null && this.parent._item.deleted || this.parentSub !== null && this.right !== null) && this.delete(e);
+			this.right === null ? this.parentSub !== null && (this.parent._map.set(this.parentSub, this), this.left !== null && this.left.delete(e)) : this.right.left = this, this.parentSub === null && this.countable && !this.deleted && (this.parent._length += this.length), Ya(e.doc.store, this), this.content.integrate(e, this), ro(e, this.parent, this.parentSub), (this.parent._item !== null && this.parent._item.deleted || this.parentSub !== null && this.right !== null) && this.delete(e);
 		} else new hs(this.id, this.length).integrate(e, 0);
 	}
 	get next() {
@@ -4015,10 +4015,10 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		return e;
 	}
 	get lastId() {
-		return this.length === 1 ? this.id : W(this.id.client, this.id.clock + this.length - 1);
+		return this.length === 1 ? this.id : U(this.id.client, this.id.clock + this.length - 1);
 	}
 	mergeWith(e) {
-		if (this.constructor === e.constructor && Ba(e.origin, this.lastId) && this.right === e && Ba(this.rightOrigin, e.rightOrigin) && this.id.client === e.id.client && this.id.clock + this.length === e.id.clock && this.deleted === e.deleted && this.redone === null && e.redone === null && this.content.constructor === e.content.constructor && this.content.mergeWith(e.content)) {
+		if (this.constructor === e.constructor && Va(e.origin, this.lastId) && this.right === e && Va(this.rightOrigin, e.rightOrigin) && this.id.client === e.id.client && this.id.clock + this.length === e.id.clock && this.deleted === e.deleted && this.redone === null && e.redone === null && this.content.constructor === e.content.constructor && this.content.mergeWith(e.content)) {
 			let t = this.parent._searchMarker;
 			return t && t.forEach((t) => {
 				t.p === e && (t.p = this, !this.deleted && this.countable && (t.index -= this.length));
@@ -4029,7 +4029,7 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 	delete(e) {
 		if (!this.deleted) {
 			let t = this.parent;
-			this.countable && this.parentSub === null && (t._length -= this.length), this.markDeleted(), Sa(e.deleteSet, this.id.client, this.id.clock, this.length), ro(e, t, this.parentSub), this.content.delete(e);
+			this.countable && this.parentSub === null && (t._length -= this.length), this.markDeleted(), Ca(e.deleteSet, this.id.client, this.id.clock, this.length), ro(e, t, this.parentSub), this.content.delete(e);
 		}
 	}
 	gc(e, t) {
@@ -4037,16 +4037,16 @@ var Wa = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.ge
 		this.content.gc(e), t ? $a(e, this, new hs(this.id, this.length)) : this.content = new _s(this.length);
 	}
 	write(e, t) {
-		let n = t > 0 ? W(this.id.client, this.id.clock + t - 1) : this.origin, r = this.rightOrigin, i = this.parentSub, a = this.content.getRef() & 31 | (n === null ? 0 : 128) | (r === null ? 0 : 64) | (i === null ? 0 : 32);
+		let n = t > 0 ? U(this.id.client, this.id.clock + t - 1) : this.origin, r = this.rightOrigin, i = this.parentSub, a = this.content.getRef() & 31 | (n === null ? 0 : 128) | (r === null ? 0 : 64) | (i === null ? 0 : 32);
 		if (e.writeInfo(a), n !== null && e.writeLeftID(n), r !== null && e.writeRightID(r), n === null && r === null) {
 			let t = this.parent;
 			if (t._item !== void 0) {
 				let n = t._item;
 				if (n === null) {
-					let n = Va(t);
+					let n = Ha(t);
 					e.writeParentInfo(!0), e.writeString(n);
 				} else e.writeParentInfo(!1), e.writeLeftID(n.id);
-			} else t.constructor === String ? (e.writeParentInfo(!0), e.writeString(t)) : t.constructor === za ? (e.writeParentInfo(!1), e.writeLeftID(t)) : R();
+			} else t.constructor === String ? (e.writeParentInfo(!0), e.writeString(t)) : t.constructor === Ba ? (e.writeParentInfo(!1), e.writeLeftID(t)) : R();
 			i !== null && e.writeString(i);
 		}
 		this.content.write(e, t);
@@ -4149,7 +4149,7 @@ var Ls = class {
 	}
 }, Rs = class {
 	constructor(e) {
-		this.ydoc = new Ea(), this.yblocks = this.ydoc.getArray("blocks"), this.serializer = e;
+		this.ydoc = new Da(), this.yblocks = this.ydoc.getArray("blocks"), this.serializer = e;
 	}
 	fromJSON(e) {
 		this.ydoc.transact(() => {
@@ -10796,9 +10796,12 @@ var Dd = {
 		let g = p.querySelector(`[${t.elementContent}]`);
 		g && this.toolboxInstance.updateLeftAlignElement(g), this.positioner.applyContentOffset(this.nodes, o);
 		let _ = o.getTunes(), v = _.toolTunes.length > 0 || _.commonTunes.length > 0;
-		if (this.Blok.BlockManager.blocks.length === 1 && o.isEmpty && !v ? this.blockTunesToggler.hide() : this.blockTunesToggler.show(), this.open(), g && this.nodes.content) {
-			let e = parseFloat(getComputedStyle(g).marginLeft) || 0;
-			this.nodes.content.style.marginLeft = `${e}px`;
+		this.Blok.BlockManager.blocks.length === 1 && o.isEmpty && !v ? this.blockTunesToggler.hide() : this.blockTunesToggler.show(), this.open();
+		let ee = o.name === "header" && o.holder.querySelector("[data-blok-toggle-arrow]") !== null;
+		if ((o.name === "callout" || o.name === "toggle" || ee) && this.nodes.actions && (this.nodes.actions.style.pointerEvents = "none"), g && this.nodes.content) {
+			var y, te;
+			let e = parseFloat(getComputedStyle(g).marginLeft) || 0, t = (y = (te = this.nodes.actions) == null ? void 0 : te.offsetWidth) == null ? 0 : y;
+			this.nodes.content.style.marginLeft = `${Math.max(e, t)}px`;
 		}
 	}
 	moveAndOpenForMultipleBlocks(e) {
@@ -10824,8 +10827,9 @@ var Dd = {
 		this.positioner.moveToY(this.nodes, c), s.appendChild(i), o && !this.Blok.ReadOnly.isEnabled && r.setupDraggable(o, this.Blok.DragManager);
 		let l = s.querySelector(`[${t.elementContent}]`);
 		if (l && this.toolboxInstance.updateLeftAlignElement(l), this.positioner.applyContentOffset(this.nodes, r), this.blockTunesToggler.show(), this.open(), l && this.nodes.content) {
-			let e = parseFloat(getComputedStyle(l).marginLeft) || 0;
-			this.nodes.content.style.marginLeft = `${e}px`;
+			var u, d;
+			let e = parseFloat(getComputedStyle(l).marginLeft) || 0, t = (u = (d = this.nodes.actions) == null ? void 0 : d.offsetWidth) == null ? 0 : u;
+			this.nodes.content.style.marginLeft = `${Math.max(e, t)}px`;
 		}
 	}
 	close(e) {
@@ -11955,7 +11959,7 @@ var vf = "/*! tailwindcss v4.2.1 | MIT License | https://tailwindcss.com */\n@la
 			if (o && a && !o.contains(a)) return;
 			let s = a == null ? void 0 : a.closest("[data-blok-table-cell-blocks], [data-blok-toggle-children]:not([data-blok-child-toolbar])"), c = s || (r = a == null ? void 0 : a.closest("[data-blok-child-toolbar]")) == null ? null : r, l = c !== null && c.querySelector(":scope > [data-blok-testid=\"block-wrapper\"]") === a, u = s == null ? l ? c : null : s, d = u ? (i = u.closest("[data-blok-testid=\"block-wrapper\"]")) == null ? null : i : a;
 			if (!d) {
-				this.emitNearestBlockHovered(e.clientY);
+				this.emitNearestBlockHoveredInZone(e.clientX, e.clientY);
 				return;
 			}
 			let f = this.Blok.BlockManager.getBlockByChildNode(d);
@@ -11975,6 +11979,17 @@ var vf = "/*! tailwindcss v4.2.1 | MIT License | https://tailwindcss.com */\n@la
 			target: t.holder
 		}));
 	}
+	emitNearestBlockHoveredInZone(t, n) {
+		let r = this.Blok.BlockManager.blocks.filter((e) => e.holder.closest("[data-blok-table-cell-blocks], [data-blok-toggle-children]") === null);
+		if (r.length === 0) return;
+		let i = r[0].holder.querySelector("[data-blok-element-content]");
+		if (!i) {
+			this.emitNearestBlockHovered(n);
+			return;
+		}
+		let a = i.getBoundingClientRect(), o = Math.abs(t - a.left), s = Math.abs(t - a.right);
+		(o <= e.HOVER_ZONE_SIZE || s <= e.HOVER_ZONE_SIZE) && this.emitNearestBlockHovered(n);
+	}
 	findNearestBlock(e) {
 		let t = this.Blok.BlockManager.blocks;
 		if (t.length === 0) return null;
@@ -11997,7 +12012,7 @@ var vf = "/*! tailwindcss v4.2.1 | MIT License | https://tailwindcss.com */\n@la
 		this.hoverDisabledUntil = Date.now() + e.HOVER_COOLDOWN_MS;
 	}
 };
-bf = xf, bf.HOVER_COOLDOWN_MS = 50;
+bf = xf, bf.HOVER_COOLDOWN_MS = 50, bf.HOVER_ZONE_SIZE = 100;
 //#endregion
 //#region src/components/modules/uiControllers/constants.ts
 var Sf = new Set([