@hiai-gg/docsmint 0.3.6 → 0.3.7

package/dist/frontend/awareness-snQ3RD9f.js

@@ -0,0 +1,3714 @@
+//#region ../node_modules/.bun/lib0@0.2.117/node_modules/lib0/map.js
+var e = () => /* @__PURE__ */ new Map(), t = (t) => {
+	let n = e();
+	return t.forEach((e, t) => {
+		n.set(t, e);
+	}), n;
+}, n = (e, t, n) => {
+	let r = e.get(t);
+	return r === void 0 && e.set(t, r = n()), r;
+}, r = (e, t) => {
+	let n = [];
+	for (let [r, i] of e) n.push(t(i, r));
+	return n;
+}, i = (e, t) => {
+	for (let [n, r] of e) if (t(r, n)) return !0;
+	return !1;
+}, a = () => /* @__PURE__ */ new Set(), o = (e) => e[e.length - 1], s = (e, t) => {
+	for (let n = 0; n < t.length; n++) e.push(t[n]);
+}, c = Array.from, l = (e, t) => {
+	for (let n = 0; n < e.length; n++) if (!t(e[n], n, e)) return !1;
+	return !0;
+}, u = (e, t) => {
+	for (let n = 0; n < e.length; n++) if (t(e[n], n, e)) return !0;
+	return !1;
+}, d = (e, t) => {
+	let n = Array(e);
+	for (let r = 0; r < e; r++) n[r] = t(r, n);
+	return n;
+}, f = Array.isArray, p = class {
+	constructor() {
+		this._observers = e();
+	}
+	on(e, t) {
+		return n(this._observers, e, a).add(t), t;
+	}
+	once(e, t) {
+		let n = (...r) => {
+			this.off(e, n), t(...r);
+		};
+		this.on(e, n);
+	}
+	off(e, t) {
+		let n = this._observers.get(e);
+		n !== void 0 && (n.delete(t), n.size === 0 && this._observers.delete(e));
+	}
+	emit(t, n) {
+		return c((this._observers.get(t) || e()).values()).forEach((e) => e(...n));
+	}
+	destroy() {
+		this._observers = e();
+	}
+}, ee = class {
+	constructor() {
+		this._observers = e();
+	}
+	on(e, t) {
+		n(this._observers, e, a).add(t);
+	}
+	once(e, t) {
+		let n = (...r) => {
+			this.off(e, n), t(...r);
+		};
+		this.on(e, n);
+	}
+	off(e, t) {
+		let n = this._observers.get(e);
+		n !== void 0 && (n.delete(t), n.size === 0 && this._observers.delete(e));
+	}
+	emit(t, n) {
+		return c((this._observers.get(t) || e()).values()).forEach((e) => e(...n));
+	}
+	destroy() {
+		this._observers = e();
+	}
+}, m = Math.floor, te = Math.abs, ne = (e, t) => e < t ? e : t, h = (e, t) => e > t ? e : t;
+Number.isNaN;
+var re = Math.pow, ie = (e) => e === 0 ? 1 / e < 0 : e < 0, ae = 1 << 17, oe = 1 << 18, se = 1 << 19, ce = 1 << 20, le = 1 << 21, ue = 1 << 22, de = 1 << 23, fe = 1 << 24, pe = 1 << 25, me = 1 << 26, he = 1 << 27, ge = 1 << 28, _e = 1 << 29;
+ae - 1, oe - 1, se - 1, ce - 1, le - 1, ue - 1, de - 1, fe - 1, pe - 1, me - 1, he - 1, ge - 1, _e - 1;
+//#endregion
+//#region ../node_modules/.bun/lib0@0.2.117/node_modules/lib0/number.js
+var ve = 2 ** 53 - 1, ye = -(2 ** 53 - 1), be = Number.isInteger || ((e) => typeof e == "number" && isFinite(e) && m(e) === e);
+Number.isNaN, Number.parseInt;
+//#endregion
+//#region ../node_modules/.bun/lib0@0.2.117/node_modules/lib0/string.js
+var xe = String.fromCharCode;
+String.fromCodePoint, xe(65535);
+var Se = (e) => e.toLowerCase(), Ce = /^\s*/g, we = (e) => e.replace(Ce, ""), Te = /([A-Z])/g, Ee = (e, t) => we(e.replace(Te, (e) => `${t}${Se(e)}`)), De = (e) => {
+	let t = unescape(encodeURIComponent(e)), n = t.length, r = new Uint8Array(n);
+	for (let e = 0; e < n; e++) r[e] = t.codePointAt(e);
+	return r;
+}, Oe = typeof TextEncoder < "u" ? new TextEncoder() : null, ke = Oe ? (e) => Oe.encode(e) : De, Ae = typeof TextDecoder > "u" ? null : new TextDecoder("utf-8", {
+	fatal: !0,
+	ignoreBOM: !0
+});
+/* c8 ignore start */
+Ae && Ae.decode(/* @__PURE__ */ new Uint8Array()).length === 1 && (Ae = null);
+var je = (e, t) => d(t, () => e).join(""), Me = class {
+	constructor() {
+		this.cpos = 0, this.cbuf = /* @__PURE__ */ new Uint8Array(100), this.bufs = [];
+	}
+}, g = () => new Me(), Ne = (e) => {
+	let t = g();
+	return e(t), _(t);
+}, Pe = (e) => {
+	let t = e.cpos;
+	for (let n = 0; n < e.bufs.length; n++) t += e.bufs[n].length;
+	return t;
+}, _ = (e) => {
+	let t = new Uint8Array(Pe(e)), n = 0;
+	for (let r = 0; r < e.bufs.length; r++) {
+		let i = e.bufs[r];
+		t.set(i, n), n += i.length;
+	}
+	return t.set(new Uint8Array(e.cbuf.buffer, 0, e.cpos), n), t;
+}, Fe = (e, t) => {
+	let n = e.cbuf.length;
+	n - e.cpos < t && (e.bufs.push(new Uint8Array(e.cbuf.buffer, 0, e.cpos)), e.cbuf = new Uint8Array(h(n, t) * 2), e.cpos = 0);
+}, v = (e, t) => {
+	let n = e.cbuf.length;
+	e.cpos === n && (e.bufs.push(e.cbuf), e.cbuf = new Uint8Array(n * 2), e.cpos = 0), e.cbuf[e.cpos++] = t;
+}, Ie = v, y = (e, t) => {
+	for (; t > 127;) v(e, 128 | 127 & t), t = m(t / 128);
+	v(e, 127 & t);
+}, Le = (e, t) => {
+	let n = ie(t);
+	for (n && (t = -t), v(e, (t > 63 ? 128 : 0) | (n ? 64 : 0) | 63 & t), t = m(t / 64); t > 0;) v(e, (t > 127 ? 128 : 0) | 127 & t), t = m(t / 128);
+}, Re = /* @__PURE__ */ new Uint8Array(3e4), ze = Re.length / 3, b = Oe && Oe.encodeInto ? (e, t) => {
+	if (t.length < ze) {
+		/* c8 ignore next */
+		let n = Oe.encodeInto(t, Re).written || 0;
+		y(e, n);
+		for (let t = 0; t < n; t++) v(e, Re[t]);
+	} else x(e, ke(t));
+} : (e, t) => {
+	let n = unescape(encodeURIComponent(t)), r = n.length;
+	y(e, r);
+	for (let t = 0; t < r; t++) v(e, n.codePointAt(t));
+}, Be = (e, t) => {
+	let n = e.cbuf.length, r = e.cpos, i = ne(n - r, t.length), a = t.length - i;
+	e.cbuf.set(t.subarray(0, i), r), e.cpos += i, a > 0 && (e.bufs.push(e.cbuf), e.cbuf = new Uint8Array(h(n * 2, a)), e.cbuf.set(t.subarray(i)), e.cpos = a);
+}, x = (e, t) => {
+	y(e, t.byteLength), Be(e, t);
+}, Ve = (e, t) => {
+	Fe(e, t);
+	let n = new DataView(e.cbuf.buffer, e.cpos, t);
+	return e.cpos += t, n;
+}, He = (e, t) => Ve(e, 4).setFloat32(0, t, !1), Ue = (e, t) => Ve(e, 8).setFloat64(0, t, !1), We = (e, t) => Ve(e, 8).setBigInt64(0, t, !1), Ge = /* @__PURE__ */ new DataView(/* @__PURE__ */ new ArrayBuffer(4)), Ke = (e) => (Ge.setFloat32(0, e), Ge.getFloat32(0) === e), qe = (e, t) => {
+	switch (typeof t) {
+		case "string":
+			v(e, 119), b(e, t);
+			break;
+		case "number":
+			be(t) && te(t) <= 2147483647 ? (v(e, 125), Le(e, t)) : Ke(t) ? (v(e, 124), He(e, t)) : (v(e, 123), Ue(e, t));
+			break;
+		case "bigint":
+			v(e, 122), We(e, t);
+			break;
+		case "object":
+			if (t === null) v(e, 126);
+			else if (f(t)) {
+				v(e, 117), y(e, t.length);
+				for (let n = 0; n < t.length; n++) qe(e, t[n]);
+			} else if (t instanceof Uint8Array) v(e, 116), x(e, t);
+			else {
+				v(e, 118);
+				let n = Object.keys(t);
+				y(e, n.length);
+				for (let r = 0; r < n.length; r++) {
+					let i = n[r];
+					b(e, i), qe(e, t[i]);
+				}
+			}
+			break;
+		case "boolean":
+			v(e, t ? 120 : 121);
+			break;
+		default: v(e, 127);
+	}
+}, Je = class extends Me {
+	constructor(e) {
+		super(), this.w = e, this.s = null, this.count = 0;
+	}
+	write(e) {
+		this.s === e ? this.count++ : (this.count > 0 && y(this, this.count - 1), this.count = 1, this.w(this, e), this.s = e);
+	}
+}, Ye = (e) => {
+	e.count > 0 && (Le(e.encoder, e.count === 1 ? e.s : -e.s), e.count > 1 && y(e.encoder, e.count - 2));
+}, Xe = class {
+	constructor() {
+		this.encoder = new Me(), this.s = 0, this.count = 0;
+	}
+	write(e) {
+		this.s === e ? this.count++ : (Ye(this), this.count = 1, this.s = e);
+	}
+	toUint8Array() {
+		return Ye(this), _(this.encoder);
+	}
+}, Ze = (e) => {
+	if (e.count > 0) {
+		let t = e.diff * 2 + (e.count === 1 ? 0 : 1);
+		Le(e.encoder, t), e.count > 1 && y(e.encoder, e.count - 2);
+	}
+}, Qe = class {
+	constructor() {
+		this.encoder = new Me(), this.s = 0, this.count = 0, this.diff = 0;
+	}
+	write(e) {
+		this.diff === e - this.s ? (this.s = e, this.count++) : (Ze(this), this.count = 1, this.diff = e - this.s, this.s = e);
+	}
+	toUint8Array() {
+		return Ze(this), _(this.encoder);
+	}
+}, $e = class {
+	constructor() {
+		this.sarr = [], this.s = "", this.lensE = new Xe();
+	}
+	write(e) {
+		this.s += e, this.s.length > 19 && (this.sarr.push(this.s), this.s = ""), this.lensE.write(e.length);
+	}
+	toUint8Array() {
+		let e = new Me();
+		return this.sarr.push(this.s), this.s = "", b(e, this.sarr.join("")), Be(e, this.lensE.toUint8Array()), _(e);
+	}
+}, S = (e) => Error(e), C = () => {
+	throw S("Method unimplemented");
+}, w = () => {
+	throw S("Unexpected case");
+}, et = S("Unexpected end of array"), tt = S("Integer out of Range"), nt = class {
+	constructor(e) {
+		this.arr = e, this.pos = 0;
+	}
+}, T = (e) => new nt(e), rt = (e) => e.pos !== e.arr.length, it = (e, t) => {
+	let n = new Uint8Array(e.arr.buffer, e.pos + e.arr.byteOffset, t);
+	return e.pos += t, n;
+}, E = (e) => it(e, D(e)), at = (e) => e.arr[e.pos++], D = (e) => {
+	let t = 0, n = 1, r = e.arr.length;
+	for (; e.pos < r;) {
+		let r = e.arr[e.pos++];
+		if (t += (r & 127) * n, n *= 128, r < 128) return t;
+		/* c8 ignore start */
+		if (t > ve) throw tt;
+	}
+	throw et;
+}, ot = (e) => {
+	let t = e.arr[e.pos++], n = t & 63, r = 64, i = (t & 64) > 0 ? -1 : 1;
+	if (!(t & 128)) return i * n;
+	let a = e.arr.length;
+	for (; e.pos < a;) {
+		if (t = e.arr[e.pos++], n += (t & 127) * r, r *= 128, t < 128) return i * n;
+		/* c8 ignore start */
+		if (n > ve) throw tt;
+	}
+	throw et;
+}, O = Ae ? (e) => Ae.decode(E(e)) : (e) => {
+	let t = D(e);
+	if (t === 0) return "";
+	{
+		let n = String.fromCodePoint(at(e));
+		if (--t < 100) for (; t--;) n += String.fromCodePoint(at(e));
+		else for (; t > 0;) {
+			let r = t < 1e4 ? t : 1e4, i = e.arr.subarray(e.pos, e.pos + r);
+			e.pos += r, n += String.fromCodePoint.apply(null, i), t -= r;
+		}
+		return decodeURIComponent(escape(n));
+	}
+}, st = (e, t) => {
+	let n = new DataView(e.arr.buffer, e.arr.byteOffset + e.pos, t);
+	return e.pos += t, n;
+}, ct = [
+	(e) => void 0,
+	(e) => null,
+	ot,
+	(e) => st(e, 4).getFloat32(0, !1),
+	(e) => st(e, 8).getFloat64(0, !1),
+	(e) => st(e, 8).getBigInt64(0, !1),
+	(e) => !1,
+	(e) => !0,
+	O,
+	(e) => {
+		let t = D(e), n = {};
+		for (let r = 0; r < t; r++) {
+			let t = O(e);
+			n[t] = lt(e);
+		}
+		return n;
+	},
+	(e) => {
+		let t = D(e), n = [];
+		for (let r = 0; r < t; r++) n.push(lt(e));
+		return n;
+	},
+	E
+], lt = (e) => ct[127 - at(e)](e), ut = class extends nt {
+	constructor(e, t) {
+		super(e), this.reader = t, this.s = null, this.count = 0;
+	}
+	read() {
+		return this.count === 0 && (this.s = this.reader(this), rt(this) ? this.count = D(this) + 1 : this.count = -1), this.count--, this.s;
+	}
+}, dt = class extends nt {
+	constructor(e) {
+		super(e), this.s = 0, this.count = 0;
+	}
+	read() {
+		if (this.count === 0) {
+			this.s = ot(this);
+			let e = ie(this.s);
+			this.count = 1, e && (this.s = -this.s, this.count = D(this) + 2);
+		}
+		return this.count--, this.s;
+	}
+}, ft = class extends nt {
+	constructor(e) {
+		super(e), this.s = 0, this.count = 0, this.diff = 0;
+	}
+	read() {
+		if (this.count === 0) {
+			let e = ot(this), t = e & 1;
+			this.diff = m(e / 2), this.count = 1, t && (this.count = D(this) + 2);
+		}
+		return this.s += this.diff, this.count--, this.s;
+	}
+}, pt = class {
+	constructor(e) {
+		this.decoder = new dt(e), this.str = O(this.decoder), this.spos = 0;
+	}
+	read() {
+		let e = this.spos + this.decoder.read(), t = this.str.slice(this.spos, e);
+		return this.spos = e, t;
+	}
+};
+crypto.subtle;
+var mt = crypto.getRandomValues.bind(crypto), ht = Math.random, gt = () => mt(/* @__PURE__ */ new Uint32Array(1))[0], _t = (e) => e[m(ht() * e.length)], vt = "10000000-1000-4000-8000-100000000000", yt = () => vt.replace(/[018]/g, (e) => (e ^ gt() & 15 >> e / 4).toString(16)), bt = Date.now, xt = (e) => new Promise(e);
+Promise.all.bind(Promise);
+//#endregion
+//#region ../node_modules/.bun/lib0@0.2.117/node_modules/lib0/conditions.js
+/* c8 ignore next */
+var St = (e) => e === void 0 ? null : e, Ct = new class {
+	constructor() {
+		this.map = /* @__PURE__ */ new Map();
+	}
+	setItem(e, t) {
+		this.map.set(e, t);
+	}
+	getItem(e) {
+		return this.map.get(e);
+	}
+}(), wt = !0;
+/* c8 ignore start */
+try {
+	typeof localStorage < "u" && localStorage && (Ct = localStorage, wt = !1);
+} catch {}
+/* c8 ignore stop */
+/* c8 ignore next */
+var Tt = Ct, Et = (e) => wt || addEventListener("storage", e), Dt = (e) => wt || removeEventListener("storage", e), Ot = Symbol("Equality"), kt = (e, t) => e === t || !!e?.[Ot]?.(t) || !1, At = (e) => typeof e == "object", jt = Object.assign, Mt = Object.keys, Nt = (e, t) => {
+	for (let n in e) t(e[n], n);
+}, Pt = (e, t) => {
+	let n = [];
+	for (let r in e) n.push(t(e[r], r));
+	return n;
+}, Ft = (e) => Mt(e).length, It = (e) => {
+	for (let t in e) return !1;
+	return !0;
+}, Lt = (e, t) => {
+	for (let n in e) if (!t(e[n], n)) return !1;
+	return !0;
+}, Rt = (e, t) => Object.prototype.hasOwnProperty.call(e, t), zt = (e, t) => e === t || Ft(e) === Ft(t) && Lt(e, (e, n) => (e !== void 0 || Rt(t, n)) && kt(t[n], e)), Bt = Object.freeze, Vt = (e) => {
+	for (let t in e) {
+		let n = e[t];
+		(typeof n == "object" || typeof n == "function") && Vt(e[t]);
+	}
+	return Bt(e);
+}, Ht = (e, t, n = 0) => {
+	try {
+		for (; n < e.length; n++) e[n](...t);
+	} finally {
+		n < e.length && Ht(e, t, n + 1);
+	}
+}, Ut = (e) => e, Wt = (e, t) => {
+	if (e === t) return !0;
+	if (e == null || t == null || e.constructor !== t.constructor && (e.constructor || Object) !== (t.constructor || Object)) return !1;
+	if (e[Ot] != null) return e[Ot](t);
+	switch (e.constructor) {
+		case ArrayBuffer: e = new Uint8Array(e), t = new Uint8Array(t);
+		case Uint8Array:
+			if (e.byteLength !== t.byteLength) return !1;
+			for (let n = 0; n < e.length; n++) if (e[n] !== t[n]) return !1;
+			break;
+		case Set:
+			if (e.size !== t.size) return !1;
+			for (let n of e) if (!t.has(n)) return !1;
+			break;
+		case Map:
+			if (e.size !== t.size) return !1;
+			for (let n of e.keys()) if (!t.has(n) || !Wt(e.get(n), t.get(n))) return !1;
+			break;
+		case void 0:
+		case Object:
+			if (Ft(e) !== Ft(t)) return !1;
+			for (let n in e) if (!Rt(e, n) || !Wt(e[n], t[n])) return !1;
+			break;
+		case Array:
+			if (e.length !== t.length) return !1;
+			for (let n = 0; n < e.length; n++) if (!Wt(e[n], t[n])) return !1;
+			break;
+		default: return !1;
+	}
+	return !0;
+}, Gt = (e, t) => t.includes(e), Kt = typeof process < "u" && process.release && /node|io\.js/.test(process.release.name) && Object.prototype.toString.call(typeof process < "u" ? process : 0) === "[object process]", qt = typeof window < "u" && typeof document < "u" && !Kt;
+typeof navigator < "u" && /Mac/.test(navigator.platform);
+var k, Jt = [], Yt = () => {
+	if (k === void 0) if (Kt) {
+		k = e();
+		let t = process.argv, n = null;
+		for (let e = 0; e < t.length; e++) {
+			let r = t[e];
+			r[0] === "-" ? (n !== null && k.set(n, ""), n = r) : n === null ? Jt.push(r) : (k.set(n, r), n = null);
+		}
+		n !== null && k.set(n, "");
+	} else typeof location == "object" ? (k = e(), (location.search || "?").slice(1).split("&").forEach((e) => {
+		if (e.length !== 0) {
+			let [t, n] = e.split("=");
+			k.set(`--${Ee(t, "-")}`, n), k.set(`-${Ee(t, "-")}`, n);
+		}
+	})) : k = e();
+	return k;
+}, Xt = (e) => Yt().has(e), Zt = (e) => St(Kt ? process.env[e.toUpperCase().replaceAll("-", "_")] : Tt.getItem(e)), Qt = (e) => Xt("--" + e) || Zt(e) !== null, $t = Qt("production"), en = Kt && Gt(process.env.FORCE_COLOR, [
+	"true",
+	"1",
+	"2"
+]) || !Xt("--no-colors") && !Qt("no-color") && (!Kt || process.stdout.isTTY) && (!Kt || Xt("--color") || Zt("COLORTERM") !== null || (Zt("TERM") || "").includes("color")), tn = (e) => new Uint8Array(e), nn = (e, t, n) => new Uint8Array(e, t, n), rn = (e) => new Uint8Array(e), an = (e) => {
+	let t = "";
+	for (let n = 0; n < e.byteLength; n++) t += xe(e[n]);
+	return btoa(t);
+}, on = (e) => Buffer.from(e.buffer, e.byteOffset, e.byteLength).toString("base64"), sn = (e) => {
+	let t = atob(e), n = tn(t.length);
+	for (let e = 0; e < t.length; e++) n[e] = t.charCodeAt(e);
+	return n;
+}, cn = (e) => {
+	let t = Buffer.from(e, "base64");
+	return nn(t.buffer, t.byteOffset, t.byteLength);
+}, ln = qt ? an : on, un = qt ? sn : cn, dn = (e) => {
+	let t = tn(e.byteLength);
+	return t.set(e), t;
+}, fn = (e) => Ne((t) => qe(t, e)), pn = class {
+	constructor(e, t) {
+		this.left = e, this.right = t;
+	}
+}, A = (e, t) => new pn(e, t), mn = (e) => e.next() >= .5, hn = (e, t, n) => m(e.next() * (n + 1 - t) + t), gn = (e, t, n) => m(e.next() * (n + 1 - t) + t), _n = (e, t, n) => gn(e, t, n), vn = (e) => xe(_n(e, 97, 122)), yn = (e, t = 0, n = 20) => {
+	let r = _n(e, t, n), i = "";
+	for (let t = 0; t < r; t++) i += vn(e);
+	return i;
+}, bn = (e, t) => t[_n(e, 0, t.length - 1)], xn = Symbol("0schema"), Sn = class {
+	constructor() {
+		this._rerrs = [];
+	}
+	extend(e, t, n, r = null) {
+		this._rerrs.push({
+			path: e,
+			expected: t,
+			has: n,
+			message: r
+		});
+	}
+	toString() {
+		let e = [];
+		for (let t = this._rerrs.length - 1; t > 0; t--) {
+			let n = this._rerrs[t];
+			/* c8 ignore next */
+			e.push(je(" ", (this._rerrs.length - t) * 2) + `${n.path == null ? "" : `[${n.path}] `}${n.has} doesn't match ${n.expected}. ${n.message}`);
+		}
+		return e.join("\n");
+	}
+}, Cn = (e, t) => e === t ? !0 : e == null || t == null || e.constructor !== t.constructor ? !1 : e[Ot] ? kt(e, t) : f(e) ? l(e, (e) => u(t, (t) => Cn(e, t))) : At(e) ? Lt(e, (e, n) => Cn(e, t[n])) : !1, j = class {
+	static _dilutes = !1;
+	extends(e) {
+		let [t, n] = [this.shape, e.shape];
+		return this.constructor._dilutes && ([n, t] = [t, n]), Cn(t, n);
+	}
+	equals(e) {
+		return this.constructor === e.constructor && Wt(this.shape, e.shape);
+	}
+	[xn]() {
+		return !0;
+	}
+	[Ot](e) {
+		return this.equals(e);
+	}
+	validate(e) {
+		return this.check(e);
+	}
+	/* c8 ignore start */
+	check(e, t) {
+		C();
+	}
+	/* c8 ignore stop */
+	get nullable() {
+		return er(this, hr);
+	}
+	get optional() {
+		return new Mn(this);
+	}
+	cast(e) {
+		return yr(e, this), e;
+	}
+	expect(e) {
+		return yr(e, this), e;
+	}
+}, wn = class extends j {
+	constructor(e, t) {
+		super(), this.shape = e, this._c = t;
+	}
+	check(e, t = void 0) {
+		let n = e?.constructor === this.shape && (this._c == null || this._c(e));
+		return !n && t?.extend(null, this.shape.name, e?.constructor.name, e?.constructor === this.shape ? "Check failed" : "Constructor match failed"), n;
+	}
+}, M = (e, t = null) => new wn(e, t);
+M(wn);
+var Tn = class extends j {
+	constructor(e) {
+		super(), this.shape = e;
+	}
+	check(e, t) {
+		let n = this.shape(e);
+		return !n && t?.extend(null, "custom prop", e?.constructor.name, "failed to check custom prop"), n;
+	}
+}, N = (e) => new Tn(e);
+M(Tn);
+var En = class extends j {
+	constructor(e) {
+		super(), this.shape = e;
+	}
+	check(e, t) {
+		let n = this.shape.some((t) => t === e);
+		return !n && t?.extend(null, this.shape.join(" | "), e.toString()), n;
+	}
+}, Dn = (...e) => new En(e), On = M(En), kn = RegExp.escape || ((e) => e.replace(/[().|&,$^[\]]/g, (e) => "\\" + e)), An = (e) => {
+	if (ur.check(e)) return [kn(e)];
+	if (On.check(e)) return e.shape.map((e) => e + "");
+	if (lr.check(e)) return ["[+-]?\\d+.?\\d*"];
+	if (dr.check(e)) return [".*"];
+	if (tr.check(e)) return e.shape.map(An).flat(1);
+	/* c8 ignore next 2 */
+	w();
+};
+M(class extends j {
+	constructor(e) {
+		super(), this.shape = e, this._r = RegExp("^" + e.map(An).map((e) => `(${e.join("|")})`).join("") + "$");
+	}
+	check(e, t) {
+		let n = this._r.exec(e) != null;
+		return !n && t?.extend(null, this._r.toString(), e.toString(), "String doesn't match string template."), n;
+	}
+});
+var jn = Symbol("optional"), Mn = class extends j {
+	constructor(e) {
+		super(), this.shape = e;
+	}
+	check(e, t) {
+		let n = e === void 0 || this.shape.check(e);
+		return !n && t?.extend(null, "undefined (optional)", "()"), n;
+	}
+	get [jn]() {
+		return !0;
+	}
+}, Nn = M(Mn), Pn = class extends j {
+	check(e, t) {
+		return t?.extend(null, "never", typeof e), !1;
+	}
+};
+new Pn(), M(Pn);
+var Fn = class e extends j {
+	constructor(e, t = !1) {
+		super(), this.shape = e, this._isPartial = t;
+	}
+	static _dilutes = !0;
+	get partial() {
+		return new e(this.shape, !0);
+	}
+	check(e, t) {
+		return e == null ? (t?.extend(null, "object", "null"), !1) : Lt(this.shape, (n, r) => {
+			let i = this._isPartial && !Rt(e, r) || n.check(e[r], t);
+			return !i && t?.extend(r.toString(), n.toString(), typeof e[r], "Object property does not match"), i;
+		});
+	}
+}, In = (e) => new Fn(e), Ln = M(Fn), Rn = N((e) => e != null && (e.constructor === Object || e.constructor == null)), zn = class extends j {
+	constructor(e, t) {
+		super(), this.shape = {
+			keys: e,
+			values: t
+		};
+	}
+	check(e, t) {
+		return e != null && Lt(e, (n, r) => {
+			let i = this.shape.keys.check(r, t);
+			return !i && t?.extend(r + "", "Record", typeof e, i ? "Key doesn't match schema" : "Value doesn't match value"), i && this.shape.values.check(n, t);
+		});
+	}
+}, Bn = (e, t) => new zn(e, t), Vn = M(zn), Hn = class extends j {
+	constructor(e) {
+		super(), this.shape = e;
+	}
+	check(e, t) {
+		return e != null && Lt(this.shape, (n, r) => {
+			let i = n.check(e[r], t);
+			return !i && t?.extend(r.toString(), "Tuple", typeof n), i;
+		});
+	}
+}, Un = (...e) => new Hn(e);
+M(Hn);
+var Wn = class extends j {
+	constructor(e) {
+		super(), this.shape = e.length === 1 ? e[0] : new $n(e);
+	}
+	check(e, t) {
+		let n = f(e) && l(e, (e) => this.shape.check(e));
+		return !n && t?.extend(null, "Array", ""), n;
+	}
+}, Gn = (...e) => new Wn(e), Kn = M(Wn), qn = N((e) => f(e)), Jn = class extends j {
+	constructor(e, t) {
+		super(), this.shape = e, this._c = t;
+	}
+	check(e, t) {
+		let n = e instanceof this.shape && (this._c == null || this._c(e));
+		return !n && t?.extend(null, this.shape.name, e?.constructor.name), n;
+	}
+}, Yn = (e, t = null) => new Jn(e, t);
+M(Jn);
+var Xn = Yn(j), Zn = M(class extends j {
+	constructor(e) {
+		super(), this.len = e.length - 1, this.args = Un(...e.slice(-1)), this.res = e[this.len];
+	}
+	check(e, t) {
+		let n = e.constructor === Function && e.length <= this.len;
+		return !n && t?.extend(null, "function", typeof e), n;
+	}
+}), Qn = N((e) => typeof e == "function");
+M(class extends j {
+	constructor(e) {
+		super(), this.shape = e;
+	}
+	check(e, t) {
+		let n = l(this.shape, (n) => n.check(e, t));
+		return !n && t?.extend(null, "Intersectinon", typeof e), n;
+	}
+}, (e) => e.shape.length > 0);
+var $n = class extends j {
+	static _dilutes = !0;
+	constructor(e) {
+		super(), this.shape = e;
+	}
+	check(e, t) {
+		let n = u(this.shape, (n) => n.check(e, t));
+		return t?.extend(null, "Union", typeof e), n;
+	}
+}, er = (...e) => e.findIndex((e) => tr.check(e)) >= 0 ? er(...e.map((e) => vr(e)).map((e) => tr.check(e) ? e.shape : [e]).flat(1)) : e.length === 1 ? e[0] : new $n(e), tr = M($n), nr = () => !0, rr = N(nr), ir = M(Tn, (e) => e.shape === nr), ar = N((e) => typeof e == "bigint"), or = N((e) => e === ar), sr = N((e) => typeof e == "symbol");
+N((e) => e === sr);
+var cr = N((e) => typeof e == "number"), lr = N((e) => e === cr), ur = N((e) => typeof e == "string"), dr = N((e) => e === ur), fr = N((e) => typeof e == "boolean"), pr = N((e) => e === fr), mr = Dn(void 0);
+M(En, (e) => e.shape.length === 1 && e.shape[0] === void 0), Dn(void 0);
+var hr = Dn(null), gr = M(En, (e) => e.shape.length === 1 && e.shape[0] === null);
+M(Uint8Array), M(wn, (e) => e.shape === Uint8Array);
+var _r = er(cr, ur, hr, mr, ar, fr, sr);
+(() => {
+	let e = Gn(rr), t = Bn(ur, rr), n = er(cr, ur, hr, fr, e, t);
+	return e.shape = n, t.shape.values = n, n;
+})();
+var vr = (e) => {
+	if (Xn.check(e)) return e;
+	if (Rn.check(e)) {
+		let t = {};
+		for (let n in e) t[n] = vr(e[n]);
+		return In(t);
+	} else if (qn.check(e)) return er(...e.map(vr));
+	else if (_r.check(e)) return Dn(e);
+	else if (Qn.check(e)) return M(e);
+	/* c8 ignore next */
+	w();
+}, yr = $t ? () => {} : (e, t) => {
+	let n = new Sn();
+	if (!t.check(e, n)) throw S(`Expected value to be of type ${t.constructor.name}.\n${n.toString()}`);
+}, br = class {
+	constructor(e) {
+		this.patterns = [], this.$state = e;
+	}
+	if(e, t) {
+		return this.patterns.push({
+			if: vr(e),
+			h: t
+		}), this;
+	}
+	else(e) {
+		return this.if(rr, e);
+	}
+	done() {
+		return (e, t) => {
+			for (let n = 0; n < this.patterns.length; n++) {
+				let r = this.patterns[n];
+				if (r.if.check(e)) return r.h(e, t);
+			}
+			throw S("Unhandled pattern");
+		};
+	}
+}, xr = ((e) => new br(e))(rr).if(lr, (e, t) => hn(t, ye, ve)).if(dr, (e, t) => yn(t)).if(pr, (e, t) => mn(t)).if(or, (e, t) => BigInt(hn(t, ye, ve))).if(tr, (e, t) => Sr(t, bn(t, e.shape))).if(Ln, (e, t) => {
+	let n = {};
+	for (let r in e.shape) {
+		let i = e.shape[r];
+		if (Nn.check(i)) {
+			if (mn(t)) continue;
+			i = i.shape;
+		}
+		n[r] = xr(i, t);
+	}
+	return n;
+}).if(Kn, (e, t) => {
+	let n = [], r = gn(t, 0, 42);
+	for (let i = 0; i < r; i++) n.push(Sr(t, e.shape));
+	return n;
+}).if(On, (e, t) => bn(t, e.shape)).if(gr, (e, t) => null).if(Zn, (e, t) => {
+	let n = Sr(t, e.res);
+	return () => n;
+}).if(ir, (e, t) => Sr(t, bn(t, [
+	cr,
+	ur,
+	hr,
+	mr,
+	ar,
+	fr,
+	Gn(cr),
+	Bn(er("a", "b", "c"), cr)
+]))).if(Vn, (e, t) => {
+	let n = {}, r = hn(t, 0, 3);
+	for (let i = 0; i < r; i++) {
+		let r = Sr(t, e.shape.keys);
+		n[r] = Sr(t, e.shape.values);
+	}
+	return n;
+}).done(), Sr = (e, t) => xr(vr(t), e), P = typeof document < "u" ? document : {};
+N((e) => e.nodeType === Dr), typeof DOMParser < "u" && new DOMParser(), N((e) => e.nodeType === wr), N((e) => e.nodeType === Tr);
+var Cr = (e) => r(e, (e, t) => `${t}:${e};`).join(""), wr = P.ELEMENT_NODE, Tr = P.TEXT_NODE;
+P.CDATA_SECTION_NODE, P.COMMENT_NODE;
+var Er = P.DOCUMENT_NODE;
+P.DOCUMENT_TYPE_NODE;
+var Dr = P.DOCUMENT_FRAGMENT_NODE;
+N((e) => e.nodeType === Er);
+/* c8 ignore stop */
+//#endregion
+//#region ../node_modules/.bun/lib0@0.2.117/node_modules/lib0/eventloop.js
+var Or = ((e) => class {
+	constructor(e) {
+		this._ = e;
+	}
+	destroy() {
+		e(this._);
+	}
+})(clearTimeout), kr = (e, t) => new Or(setTimeout(t, e)), F = Symbol, Ar = F(), jr = F(), Mr = F(), Nr = F(), Pr = F(), Fr = F(), Ir = F(), Lr = F(), Rr = F(), zr = (e) => {
+	e.length === 1 && e[0]?.constructor === Function && (e = e[0]());
+	let t = [], n = [], r = 0;
+	for (; r < e.length; r++) {
+		let n = e[r];
+		if (n === void 0) break;
+		if (n.constructor === String || n.constructor === Number) t.push(n);
+		else if (n.constructor === Object) break;
+	}
+	for (r > 0 && n.push(t.join("")); r < e.length; r++) {
+		let t = e[r];
+		t instanceof Symbol || n.push(t);
+	}
+	return n;
+};
+bt();
+/* c8 ignore stop */
+//#endregion
+//#region ../node_modules/.bun/lib0@0.2.117/node_modules/lib0/logging.js
+var Br = {
+	[Ar]: A("font-weight", "bold"),
+	[jr]: A("font-weight", "normal"),
+	[Mr]: A("color", "blue"),
+	[Pr]: A("color", "green"),
+	[Nr]: A("color", "grey"),
+	[Fr]: A("color", "red"),
+	[Ir]: A("color", "purple"),
+	[Lr]: A("color", "orange"),
+	[Rr]: A("color", "black")
+}, Vr = en ? (t) => {
+	t.length === 1 && t[0]?.constructor === Function && (t = t[0]());
+	let n = [], r = [], i = e(), a = [], o = 0;
+	for (; o < t.length; o++) {
+		let e = t[o], a = Br[e];
+		if (a !== void 0) i.set(a.left, a.right);
+		else {
+			if (e === void 0) break;
+			if (e.constructor === String || e.constructor === Number) {
+				let t = Cr(i);
+				o > 0 || t.length > 0 ? (n.push("%c" + e), r.push(t)) : n.push(e);
+			} else break;
+		}
+	}
+	for (o > 0 && (a = r, a.unshift(n.join(""))); o < t.length; o++) {
+		let e = t[o];
+		e instanceof Symbol || a.push(e);
+	}
+	return a;
+} : zr, Hr = (...e) => {
+	/* c8 ignore next */
+	console.log(...Vr(e)), Wr.forEach((t) => t.print(e));
+}, Ur = (...e) => {
+	console.warn(...Vr(e)), e.unshift(Lr), Wr.forEach((t) => t.print(e));
+}, Wr = a(), Gr = (e) => ({
+	[Symbol.iterator]() {
+		return this;
+	},
+	next: e
+}), Kr = (e, t) => Gr(() => {
+	let n;
+	do
+		n = e.next();
+	while (!n.done && !t(n.value));
+	return n;
+}), qr = (e, t) => Gr(() => {
+	let { done: n, value: r } = e.next();
+	return {
+		done: n,
+		value: n ? void 0 : t(r)
+	};
+}), Jr = class {
+	constructor(e, t) {
+		this.clock = e, this.len = t;
+	}
+}, Yr = class {
+	constructor() {
+		this.clients = /* @__PURE__ */ new Map();
+	}
+}, I = (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]) sa(e, i, o.clock, o.len, n);
+	}
+}), Xr = (e, t) => {
+	let n = 0, r = e.length - 1;
+	for (; n <= r;) {
+		let i = m((n + r) / 2), a = e[i], o = a.clock;
+		if (o <= t) {
+			if (t < o + a.len) return i;
+			n = i + 1;
+		} else r = i - 1;
+	}
+	return null;
+}, Zr = (e, t) => {
+	let n = e.clients.get(t.client);
+	return n !== void 0 && Xr(n, t.clock) !== null;
+}, Qr = (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 Jr(r.clock, h(r.len, i.clock + i.len - r.clock)) : (n < t && (e[n] = i), n++);
+		}
+		e.length = n;
+	});
+}, $r = (e) => {
+	let t = new Yr();
+	for (let n = 0; n < e.length; n++) e[n].clients.forEach((r, i) => {
+		if (!t.clients.has(i)) {
+			let a = r.slice();
+			for (let t = n + 1; t < e.length; t++) s(a, e[t].clients.get(i) || []);
+			t.clients.set(i, a);
+		}
+	});
+	return Qr(t), t;
+}, ei = (e, t, r, i) => {
+	n(e.clients, t, () => []).push(new Jr(r, i));
+}, ti = () => new Yr(), ni = (e) => {
+	let t = ti();
+	return e.clients.forEach((e, n) => {
+		let r = [];
+		for (let t = 0; t < e.length; t++) {
+			let n = e[t];
+			if (n.deleted) {
+				let i = n.id.clock, a = n.length;
+				if (t + 1 < e.length) for (let n = e[t + 1]; t + 1 < e.length && n.deleted; n = e[++t + 1]) a += n.length;
+				r.push(new Jr(i, a));
+			}
+		}
+		r.length > 0 && t.clients.set(n, r);
+	}), t;
+}, ri = (e, t) => {
+	y(e.restEncoder, t.clients.size), c(t.clients.entries()).sort((e, t) => t[0] - e[0]).forEach(([t, n]) => {
+		e.resetDsCurVal(), y(e.restEncoder, t);
+		let r = n.length;
+		y(e.restEncoder, r);
+		for (let t = 0; t < r; t++) {
+			let r = n[t];
+			e.writeDsClock(r.clock), e.writeDsLen(r.len);
+		}
+	});
+}, ii = (e) => {
+	let t = new Yr(), r = D(e.restDecoder);
+	for (let i = 0; i < r; i++) {
+		e.resetDsCurVal();
+		let r = D(e.restDecoder), i = D(e.restDecoder);
+		if (i > 0) {
+			let a = n(t.clients, r, () => []);
+			for (let t = 0; t < i; t++) a.push(new Jr(e.readDsClock(), e.readDsLen()));
+		}
+	}
+	return t;
+}, ai = (e, t, n) => {
+	let r = new Yr(), i = D(e.restDecoder);
+	for (let a = 0; a < i; a++) {
+		e.resetDsCurVal();
+		let i = D(e.restDecoder), a = D(e.restDecoder), o = n.clients.get(i) || [], s = B(n, i);
+		for (let n = 0; n < a; n++) {
+			let n = e.readDsClock(), a = n + e.readDsLen();
+			if (n < s) {
+				s < a && ei(r, i, s, a - s);
+				let e = V(o, n), c = o[e];
+				for (!c.deleted && c.id.clock < n && (o.splice(e + 1, 0, gs(t, c, n - c.id.clock)), e++); e < o.length && (c = o[e++], c.id.clock < a);) c.deleted || (a < c.id.clock + c.length && o.splice(e, 0, gs(t, c, a - c.id.clock)), c.delete(t));
+			} else ei(r, i, n, a - n);
+		}
+	}
+	if (r.clients.size > 0) {
+		let e = new L();
+		return y(e.restEncoder, 0), ri(e, r), e.toUint8Array();
+	}
+	return null;
+}, oi = gt, si = class e extends p {
+	constructor({ guid: e = yt(), 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 = oi(), this.guid = e, this.collectionid = t, this.share = /* @__PURE__ */ new Map(), this.store = new ea(), 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 = xt((e) => {
+			this.on("load", () => {
+				this.isLoaded = !0, e(this);
+			});
+		});
+		let s = () => xt((e) => {
+			let t = (n) => {
+				(n === void 0 || n === !0) && (this.off("sync", t), e());
+			};
+			this.on("sync", t);
+		});
+		this.on("sync", (e) => {
+			e === !1 && this.isSynced && (this.whenSynced = s()), this.isSynced = e === void 0 || e === !0, this.isSynced && !this.isLoaded && this.emit("load", [this]);
+		}), this.whenSynced = s();
+	}
+	load() {
+		let e = this._item;
+		e !== null && !this.shouldLoad && U(e.parent.doc, (e) => {
+			e.subdocsLoaded.add(this);
+		}, null, !0), this.shouldLoad = !0;
+	}
+	getSubdocs() {
+		return this.subdocs;
+	}
+	getSubdocGuids() {
+		return new Set(c(this.subdocs).map((e) => e.guid));
+	}
+	transact(e, t = null) {
+		return U(this, e, t);
+	}
+	get(e, t = K) {
+		let r = n(this.share, e, () => {
+			let e = new t();
+			return e._integrate(this, null), e;
+		}), i = r.constructor;
+		if (t !== K && i !== t) if (i === K) {
+			let n = new t();
+			n._map = r._map, r._map.forEach((e) => {
+				for (; e !== null; e = e.left) e.parent = n;
+			}), n._start = r._start;
+			for (let e = n._start; e !== null; e = e.right) e.parent = n;
+			return n._length = r._length, this.share.set(e, n), n._integrate(this, null), n;
+		} else throw Error(`Type with the name ${e} has already been defined with a different constructor`);
+		return r;
+	}
+	getArray(e = "") {
+		return this.get(e, co);
+	}
+	getText(e = "") {
+		return this.get(e, ko);
+	}
+	getMap(e = "") {
+		return this.get(e, fo);
+	}
+	getXmlElement(e = "") {
+		return this.get(e, Po);
+	}
+	getXmlFragment(e = "") {
+		return this.get(e, Mo);
+	}
+	toJSON() {
+		let e = {};
+		return this.share.forEach((t, n) => {
+			e[n] = t.toJSON();
+		}), e;
+	}
+	destroy() {
+		this.isDestroyed = !0, c(this.subdocs).forEach((e) => e.destroy());
+		let t = this._item;
+		if (t !== null) {
+			this._item = null;
+			let n = t.content;
+			n.doc = new e({
+				guid: this.guid,
+				...n.opts,
+				shouldLoad: !1
+			}), n.doc._item = t, U(t.parent.doc, (e) => {
+				let r = n.doc;
+				t.deleted || e.subdocsAdded.add(r), e.subdocsRemoved.add(this);
+			}, null, !0);
+		}
+		this.emit("destroyed", [!0]), this.emit("destroy", [this]), super.destroy();
+	}
+}, ci = class {
+	constructor(e) {
+		this.restDecoder = e;
+	}
+	resetDsCurVal() {}
+	readDsClock() {
+		return D(this.restDecoder);
+	}
+	readDsLen() {
+		return D(this.restDecoder);
+	}
+}, li = class extends ci {
+	readLeftID() {
+		return R(D(this.restDecoder), D(this.restDecoder));
+	}
+	readRightID() {
+		return R(D(this.restDecoder), D(this.restDecoder));
+	}
+	readClient() {
+		return D(this.restDecoder);
+	}
+	readInfo() {
+		return at(this.restDecoder);
+	}
+	readString() {
+		return O(this.restDecoder);
+	}
+	readParentInfo() {
+		return D(this.restDecoder) === 1;
+	}
+	readTypeRef() {
+		return D(this.restDecoder);
+	}
+	readLen() {
+		return D(this.restDecoder);
+	}
+	readAny() {
+		return lt(this.restDecoder);
+	}
+	readBuf() {
+		return dn(E(this.restDecoder));
+	}
+	readJSON() {
+		return JSON.parse(O(this.restDecoder));
+	}
+	readKey() {
+		return O(this.restDecoder);
+	}
+}, ui = class {
+	constructor(e) {
+		this.dsCurrVal = 0, this.restDecoder = e;
+	}
+	resetDsCurVal() {
+		this.dsCurrVal = 0;
+	}
+	readDsClock() {
+		return this.dsCurrVal += D(this.restDecoder), this.dsCurrVal;
+	}
+	readDsLen() {
+		let e = D(this.restDecoder) + 1;
+		return this.dsCurrVal += e, e;
+	}
+}, di = class extends ui {
+	constructor(e) {
+		super(e), this.keys = [], D(e), this.keyClockDecoder = new ft(E(e)), this.clientDecoder = new dt(E(e)), this.leftClockDecoder = new ft(E(e)), this.rightClockDecoder = new ft(E(e)), this.infoDecoder = new ut(E(e), at), this.stringDecoder = new pt(E(e)), this.parentInfoDecoder = new ut(E(e), at), this.typeRefDecoder = new dt(E(e)), this.lenDecoder = new dt(E(e));
+	}
+	readLeftID() {
+		return new Li(this.clientDecoder.read(), this.leftClockDecoder.read());
+	}
+	readRightID() {
+		return new Li(this.clientDecoder.read(), this.rightClockDecoder.read());
+	}
+	readClient() {
+		return this.clientDecoder.read();
+	}
+	readInfo() {
+		return this.infoDecoder.read();
+	}
+	readString() {
+		return this.stringDecoder.read();
+	}
+	readParentInfo() {
+		return this.parentInfoDecoder.read() === 1;
+	}
+	readTypeRef() {
+		return this.typeRefDecoder.read();
+	}
+	readLen() {
+		return this.lenDecoder.read();
+	}
+	readAny() {
+		return lt(this.restDecoder);
+	}
+	readBuf() {
+		return E(this.restDecoder);
+	}
+	readJSON() {
+		return lt(this.restDecoder);
+	}
+	readKey() {
+		let e = this.keyClockDecoder.read();
+		if (e < this.keys.length) return this.keys[e];
+		{
+			let e = this.stringDecoder.read();
+			return this.keys.push(e), e;
+		}
+	}
+}, fi = class {
+	constructor() {
+		this.restEncoder = g();
+	}
+	toUint8Array() {
+		return _(this.restEncoder);
+	}
+	resetDsCurVal() {}
+	writeDsClock(e) {
+		y(this.restEncoder, e);
+	}
+	writeDsLen(e) {
+		y(this.restEncoder, e);
+	}
+}, pi = class extends fi {
+	writeLeftID(e) {
+		y(this.restEncoder, e.client), y(this.restEncoder, e.clock);
+	}
+	writeRightID(e) {
+		y(this.restEncoder, e.client), y(this.restEncoder, e.clock);
+	}
+	writeClient(e) {
+		y(this.restEncoder, e);
+	}
+	writeInfo(e) {
+		Ie(this.restEncoder, e);
+	}
+	writeString(e) {
+		b(this.restEncoder, e);
+	}
+	writeParentInfo(e) {
+		y(this.restEncoder, +!!e);
+	}
+	writeTypeRef(e) {
+		y(this.restEncoder, e);
+	}
+	writeLen(e) {
+		y(this.restEncoder, e);
+	}
+	writeAny(e) {
+		qe(this.restEncoder, e);
+	}
+	writeBuf(e) {
+		x(this.restEncoder, e);
+	}
+	writeJSON(e) {
+		b(this.restEncoder, JSON.stringify(e));
+	}
+	writeKey(e) {
+		b(this.restEncoder, e);
+	}
+}, mi = class {
+	constructor() {
+		this.restEncoder = g(), this.dsCurrVal = 0;
+	}
+	toUint8Array() {
+		return _(this.restEncoder);
+	}
+	resetDsCurVal() {
+		this.dsCurrVal = 0;
+	}
+	writeDsClock(e) {
+		let t = e - this.dsCurrVal;
+		this.dsCurrVal = e, y(this.restEncoder, t);
+	}
+	writeDsLen(e) {
+		e === 0 && w(), y(this.restEncoder, e - 1), this.dsCurrVal += e;
+	}
+}, L = class extends mi {
+	constructor() {
+		super(), this.keyMap = /* @__PURE__ */ new Map(), this.keyClock = 0, this.keyClockEncoder = new Qe(), this.clientEncoder = new Xe(), this.leftClockEncoder = new Qe(), this.rightClockEncoder = new Qe(), this.infoEncoder = new Je(Ie), this.stringEncoder = new $e(), this.parentInfoEncoder = new Je(Ie), this.typeRefEncoder = new Xe(), this.lenEncoder = new Xe();
+	}
+	toUint8Array() {
+		let e = g();
+		return y(e, 0), x(e, this.keyClockEncoder.toUint8Array()), x(e, this.clientEncoder.toUint8Array()), x(e, this.leftClockEncoder.toUint8Array()), x(e, this.rightClockEncoder.toUint8Array()), x(e, _(this.infoEncoder)), x(e, this.stringEncoder.toUint8Array()), x(e, _(this.parentInfoEncoder)), x(e, this.typeRefEncoder.toUint8Array()), x(e, this.lenEncoder.toUint8Array()), Be(e, _(this.restEncoder)), _(e);
+	}
+	writeLeftID(e) {
+		this.clientEncoder.write(e.client), this.leftClockEncoder.write(e.clock);
+	}
+	writeRightID(e) {
+		this.clientEncoder.write(e.client), this.rightClockEncoder.write(e.clock);
+	}
+	writeClient(e) {
+		this.clientEncoder.write(e);
+	}
+	writeInfo(e) {
+		this.infoEncoder.write(e);
+	}
+	writeString(e) {
+		this.stringEncoder.write(e);
+	}
+	writeParentInfo(e) {
+		this.parentInfoEncoder.write(+!!e);
+	}
+	writeTypeRef(e) {
+		this.typeRefEncoder.write(e);
+	}
+	writeLen(e) {
+		this.lenEncoder.write(e);
+	}
+	writeAny(e) {
+		qe(this.restEncoder, e);
+	}
+	writeBuf(e) {
+		x(this.restEncoder, e);
+	}
+	writeJSON(e) {
+		qe(this.restEncoder, e);
+	}
+	writeKey(e) {
+		let t = this.keyMap.get(e);
+		t === void 0 ? (this.keyClockEncoder.write(this.keyClock++), this.stringEncoder.write(e)) : this.keyClockEncoder.write(t);
+	}
+}, hi = (e, t, n, r) => {
+	r = h(r, t[0].id.clock);
+	let i = V(t, r);
+	y(e.restEncoder, t.length - i), e.writeClient(n), y(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);
+}, gi = (e, t, n) => {
+	let r = /* @__PURE__ */ new Map();
+	n.forEach((e, n) => {
+		B(t, n) > e && r.set(n, e);
+	}), ta(t).forEach((e, t) => {
+		n.has(t) || r.set(t, 0);
+	}), y(e.restEncoder, r.size), c(r.entries()).sort((e, t) => t[0] - e[0]).forEach(([n, r]) => {
+		hi(e, t.clients.get(n), n, r);
+	});
+}, _i = (t, n) => {
+	let r = e(), i = D(t.restDecoder);
+	for (let e = 0; e < i; e++) {
+		let e = D(t.restDecoder), i = Array(e), a = t.readClient(), o = D(t.restDecoder);
+		r.set(a, {
+			i: 0,
+			refs: i
+		});
+		for (let r = 0; r < e; r++) {
+			let e = t.readInfo();
+			switch (31 & e) {
+				case 0: {
+					let e = t.readLen();
+					i[r] = new J(R(a, o), e), o += e;
+					break;
+				}
+				case 10: {
+					let e = D(t.restDecoder);
+					i[r] = new $(R(a, o), e), o += e;
+					break;
+				}
+				default: {
+					let s = (e & 192) == 0, c = new Q(R(a, o), null, (e & 128) == 128 ? t.readLeftID() : null, null, (e & 64) == 64 ? t.readRightID() : null, s ? t.readParentInfo() ? n.get(t.readString()) : t.readLeftID() : null, s && (e & 32) == 32 ? t.readString() : null, ys(t, e));
+					i[r] = c, o += c.length;
+				}
+			}
+		}
+	}
+	return r;
+}, vi = (e, t, r) => {
+	let i = [], a = c(r.keys()).sort((e, t) => e - t);
+	if (a.length === 0) return null;
+	let o = () => {
+		if (a.length === 0) return null;
+		let e = r.get(a[a.length - 1]);
+		for (; e.refs.length === e.i;) if (a.pop(), a.length > 0) e = r.get(a[a.length - 1]);
+		else return null;
+		return e;
+	}, s = o();
+	if (s === null) return null;
+	let l = new ea(), u = /* @__PURE__ */ new Map(), d = (e, t) => {
+		let n = u.get(e);
+		(n == null || n > t) && u.set(e, t);
+	}, f = s.refs[s.i++], p = /* @__PURE__ */ new Map(), ee = () => {
+		for (let e of i) {
+			let t = e.id.client, n = r.get(t);
+			n ? (n.i--, l.clients.set(t, n.refs.slice(n.i)), r.delete(t), n.i = 0, n.refs = []) : l.clients.set(t, [e]), a = a.filter((e) => e !== t);
+		}
+		i.length = 0;
+	};
+	for (;;) {
+		if (f.constructor !== $) {
+			let a = n(p, f.id.client, () => B(t, f.id.client)) - f.id.clock;
+			if (a < 0) i.push(f), d(f.id.client, f.id.clock - 1), ee();
+			else {
+				let n = f.getMissing(e, t);
+				if (n !== null) {
+					i.push(f);
+					let e = r.get(n) || {
+						refs: [],
+						i: 0
+					};
+					if (e.refs.length === e.i) d(n, B(t, n)), ee();
+					else {
+						f = e.refs[e.i++];
+						continue;
+					}
+				} else (a === 0 || a < f.length) && (f.integrate(e, a), p.set(f.id.client, f.id.clock + f.length));
+			}
+		}
+		if (i.length > 0) f = i.pop();
+		else if (s !== null && s.i < s.refs.length) f = s.refs[s.i++];
+		else {
+			if (s = o(), s === null) break;
+			f = s.refs[s.i++];
+		}
+	}
+	if (l.clients.size > 0) {
+		let e = new L();
+		return gi(e, l, /* @__PURE__ */ new Map()), y(e.restEncoder, 0), {
+			missing: u,
+			update: e.toUint8Array()
+		};
+	}
+	return null;
+}, yi = (e, t) => gi(e, t.doc.store, t.beforeState), bi = (e, t, n, r = new di(e)) => U(t, (e) => {
+	e.local = !1;
+	let t = !1, n = e.doc, i = n.store, a = vi(e, i, _i(r, n)), o = i.pendingStructs;
+	if (o) {
+		for (let [e, n] of o.missing) if (n < B(i, e)) {
+			t = !0;
+			break;
+		}
+		if (a) {
+			for (let [e, t] of a.missing) {
+				let n = o.missing.get(e);
+				(n == null || n > t) && o.missing.set(e, t);
+			}
+			o.update = wa([o.update, a.update]);
+		}
+	} else i.pendingStructs = a;
+	let s = ai(r, e, i);
+	if (i.pendingDs) {
+		let t = new di(T(i.pendingDs));
+		D(t.restDecoder);
+		let n = ai(t, e, i);
+		s && n ? i.pendingDs = wa([s, n]) : i.pendingDs = s || n;
+	} else i.pendingDs = s;
+	if (t) {
+		let t = i.pendingStructs.update;
+		i.pendingStructs = null, xi(e.doc, t);
+	}
+}, n, !1), xi = (e, t, n, r = di) => {
+	let i = T(t);
+	bi(i, e, n, new r(i));
+}, Si = (e, t, n) => xi(e, t, n, li), Ci = (e, t, n = /* @__PURE__ */ new Map()) => {
+	gi(e, t.store, n), ri(e, ni(t.store));
+}, wi = (e, t = new Uint8Array([0]), n = new L()) => {
+	Ci(n, e, Di(t));
+	let r = [n.toUint8Array()];
+	if (e.store.pendingDs && r.push(e.store.pendingDs), e.store.pendingStructs && r.push(Ta(e.store.pendingStructs.update, t)), r.length > 1) {
+		if (n.constructor === pi) return Sa(r.map((e, t) => t === 0 ? e : ka(e)));
+		if (n.constructor === L) return wa(r);
+	}
+	return r[0];
+}, Ti = (e, t) => wi(e, t, new pi()), Ei = (e) => {
+	let t = /* @__PURE__ */ new Map(), n = D(e.restDecoder);
+	for (let r = 0; r < n; r++) {
+		let n = D(e.restDecoder), r = D(e.restDecoder);
+		t.set(n, r);
+	}
+	return t;
+}, Di = (e) => Ei(new ci(T(e))), Oi = (e, t) => (y(e.restEncoder, t.size), c(t.entries()).sort((e, t) => t[0] - e[0]).forEach(([t, n]) => {
+	y(e.restEncoder, t), y(e.restEncoder, n);
+}), e), ki = (e, t) => Oi(e, ta(t.store)), Ai = (e, t = new mi()) => (e instanceof Map ? Oi(t, e) : ki(t, e), t.toUint8Array()), ji = (e) => Ai(e, new fi()), Mi = class {
+	constructor() {
+		this.l = [];
+	}
+}, Ni = () => new Mi(), Pi = (e, t) => e.l.push(t), Fi = (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.");
+}, Ii = (e, t, n) => Ht(e.l, [t, n]), Li = class {
+	constructor(e, t) {
+		this.client = e, this.clock = t;
+	}
+}, Ri = (e, t) => e === t || e !== null && t !== null && e.client === t.client && e.clock === t.clock, R = (e, t) => new Li(e, t), zi = (e) => {
+	for (let [t, n] of e.doc.share.entries()) if (n === e) return t;
+	throw w();
+}, Bi = (e, t) => {
+	for (; t !== null;) {
+		if (t.parent === e) return !0;
+		t = t.parent._item;
+	}
+	return !1;
+}, Vi = class {
+	constructor(e, t, n, r = 0) {
+		this.type = e, this.tname = t, this.item = n, this.assoc = r;
+	}
+}, Hi = (e) => new Vi(e.type == null ? null : R(e.type.client, e.type.clock), e.tname ?? null, e.item == null ? null : R(e.item.client, e.item.clock), e.assoc == null ? 0 : e.assoc), Ui = class {
+	constructor(e, t, n = 0) {
+		this.type = e, this.index = t, this.assoc = n;
+	}
+}, Wi = (e, t, n = 0) => new Ui(e, t, n), Gi = (e, t, n) => {
+	let r = null, i = null;
+	return e._item === null ? i = zi(e) : r = R(e._item.id.client, e._item.id.clock), new Vi(r, i, t, n);
+}, Ki = (e, t, n = 0) => {
+	let r = e._start;
+	if (n < 0) {
+		if (t === 0) return Gi(e, null, n);
+		t--;
+	}
+	for (; r !== null;) {
+		if (!r.deleted && r.countable) {
+			if (r.length > t) return Gi(e, R(r.id.client, r.id.clock + t), n);
+			t -= r.length;
+		}
+		if (r.right === null && n < 0) return Gi(e, r.lastId, n);
+		r = r.right;
+	}
+	return Gi(e, null, n);
+}, qi = (e, t) => {
+	let n = ra(e, t);
+	return {
+		item: n,
+		diff: t.clock - n.id.clock
+	};
+}, Ji = (e, t, n = !0) => {
+	let r = t.store, i = e.item, a = e.type, o = e.tname, s = e.assoc, c = null, l = 0;
+	if (i !== null) {
+		if (B(r, i.client) <= i.clock) return null;
+		let e = n ? ms(r, i) : qi(r, i), t = e.item;
+		if (!(t instanceof Q)) return null;
+		if (c = t.parent, c._item === null || !c._item.deleted) {
+			l = t.deleted || !t.countable ? 0 : e.diff + (s >= 0 ? 0 : 1);
+			let n = t.left;
+			for (; n !== null;) !n.deleted && n.countable && (l += n.length), n = n.left;
+		}
+	} else {
+		if (o !== null) c = t.get(o);
+		else if (a !== null) {
+			if (B(r, a.client) <= a.clock) return null;
+			let { item: e } = n ? ms(r, a) : { item: ra(r, a) };
+			if (e instanceof Q && e.content instanceof Z) c = e.content.type;
+			else return null;
+		} else throw w();
+		l = s >= 0 ? c._length : 0;
+	}
+	return Wi(c, l, e.assoc);
+}, Yi = (e, t) => e === t || e !== null && t !== null && e.tname === t.tname && Ri(e.item, t.item) && Ri(e.type, t.type) && e.assoc === t.assoc, Xi = class {
+	constructor(e, t) {
+		this.ds = e, this.sv = t;
+	}
+}, Zi = (e, t) => new Xi(e, t);
+Zi(ti(), /* @__PURE__ */ new Map());
+var Qi = (e) => Zi(ni(e.store), ta(e.store)), z = (e, t) => t === void 0 ? !e.deleted : t.sv.has(e.id.client) && (t.sv.get(e.id.client) || 0) > e.id.clock && !Zr(t.ds, e.id), $i = (e, t) => {
+	let r = n(e.meta, $i, a), i = e.doc.store;
+	r.has(t) || (t.sv.forEach((t, n) => {
+		t < B(i, n) && H(e, R(n, t));
+	}), I(e, t.ds, (e) => {}), r.add(t));
+}, ea = class {
+	constructor() {
+		this.clients = /* @__PURE__ */ new Map(), this.pendingStructs = null, this.pendingDs = null;
+	}
+}, ta = (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;
+}, B = (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;
+}, na = (e, t) => {
+	let n = e.clients.get(t.id.client);
+	if (n === void 0) n = [], e.clients.set(t.id.client, n);
+	else {
+		let e = n[n.length - 1];
+		if (e.id.clock + e.length !== t.id.clock) throw w();
+	}
+	n.push(t);
+}, V = (e, t) => {
+	let n = 0, r = e.length - 1, i = e[r], a = i.id.clock;
+	if (a === t) return r;
+	let o = m(t / (a + i.length - 1) * r);
+	for (; n <= r;) {
+		if (i = e[o], a = i.id.clock, a <= t) {
+			if (t < a + i.length) return o;
+			n = o + 1;
+		} else r = o - 1;
+		o = m((n + r) / 2);
+	}
+	throw w();
+}, ra = (e, t) => {
+	let n = e.clients.get(t.client);
+	return n[V(n, t.clock)];
+}, ia = (e, t, n) => {
+	let r = V(t, n), i = t[r];
+	return i.id.clock < n && i instanceof Q ? (t.splice(r + 1, 0, gs(e, i, n - i.id.clock)), r + 1) : r;
+}, H = (e, t) => {
+	let n = e.doc.store.clients.get(t.client);
+	return n[ia(e, n, t.clock)];
+}, aa = (e, t, n) => {
+	let r = t.clients.get(n.client), i = V(r, n.clock), a = r[i];
+	return n.clock !== a.id.clock + a.length - 1 && a.constructor !== J && r.splice(i + 1, 0, gs(e, a, n.clock - a.id.clock + 1)), a;
+}, oa = (e, t, n) => {
+	let r = e.clients.get(t.id.client);
+	r[V(r, t.id.clock)] = n;
+}, sa = (e, t, n, r, i) => {
+	if (r === 0) return;
+	let a = n + r, o = ia(e, t, n), s;
+	do
+		s = t[o++], a < s.id.clock + s.length && ia(e, t, a), i(s);
+	while (o < t.length && t[o].id.clock < a);
+}, ca = class {
+	constructor(e, t, n) {
+		this.doc = e, this.deleteSet = new Yr(), this.beforeState = ta(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;
+	}
+}, la = (e, t) => t.deleteSet.clients.size === 0 && !i(t.afterState, (e, n) => t.beforeState.get(n) !== e) ? !1 : (Qr(t.deleteSet), yi(e, t), ri(e, t.deleteSet), !0), ua = (e, t, r) => {
+	let i = t._item;
+	(i === null || i.id.clock < (e.beforeState.get(i.id.client) || 0) && !i.deleted) && n(e.changed, t, a).add(r);
+}, da = (e, t) => {
+	let n = e[t], r = e[t - 1], i = t;
+	for (; i > 0; n = r, r = e[--i - 1]) {
+		if (r.deleted === n.deleted && r.constructor === n.constructor && r.mergeWith(n)) {
+			n instanceof Q && n.parentSub !== null && n.parent._map.get(n.parentSub) === n && n.parent._map.set(n.parentSub, r);
+			continue;
+		}
+		break;
+	}
+	let a = t - i;
+	return a && e.splice(t + 1 - a, a), a;
+}, fa = (e, t, n) => {
+	for (let [r, i] of e.clients.entries()) {
+		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 = V(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);
+			}
+		}
+	}
+}, pa = (e, t) => {
+	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 = ne(r.length - 1, 1 + V(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 + da(r, e);
+		}
+	});
+}, ma = (e, t) => {
+	if (t < e.length) {
+		let n = e[t], r = n.doc, i = r.store, a = n.deleteSet, o = n._mergeStructs;
+		try {
+			Qr(a), n.afterState = ta(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);
+			})), e.push(() => {
+				n.changedParentTypes.forEach((t, r) => {
+					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(() => {
+						Ii(r._dEH, t, n);
+					}));
+				}), e.push(() => r.emit("afterTransaction", [n, r])), e.push(() => {
+					n._needFormattingCleanup && Eo(n);
+				});
+			}), Ht(e, []);
+		} finally {
+			r.gc && fa(a, i, r.gcFilter), pa(a, i), n.afterState.forEach((e, t) => {
+				let r = n.beforeState.get(t) || 0;
+				if (r !== e) {
+					let e = i.clients.get(t), n = h(V(e, r), 1);
+					for (let t = e.length - 1; t >= n;) t -= 1 + da(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 = V(r, n);
+				a + 1 < r.length && da(r, a + 1) > 1 || a > 0 && da(r, a);
+			}
+			if (!n.local && n.afterState.get(r.clientID) !== n.beforeState.get(r.clientID) && (Hr(Lr, Ar, "[yjs] ", jr, Fr, "Changed the client-id because another client seems to be using it."), r.clientID = oi()), r.emit("afterTransactionCleanup", [n, r]), r._observers.has("update")) {
+				let e = new pi();
+				la(e, n) && r.emit("update", [
+					e.toUint8Array(),
+					n.origin,
+					r,
+					n
+				]);
+			}
+			if (r._observers.has("updateV2")) {
+				let e = new L();
+				la(e, n) && r.emit("updateV2", [
+					e.toUint8Array(),
+					n.origin,
+					r,
+					n
+				]);
+			}
+			let { subdocsAdded: s, subdocsLoaded: c, subdocsRemoved: l } = n;
+			(s.size > 0 || l.size > 0 || c.size > 0) && (s.forEach((e) => {
+				e.clientID = r.clientID, e.collectionid ??= r.collectionid, r.subdocs.add(e);
+			}), l.forEach((e) => r.subdocs.delete(e)), r.emit("subdocs", [
+				{
+					loaded: c,
+					added: s,
+					removed: l
+				},
+				r,
+				n
+			]), l.forEach((e) => e.destroy())), e.length <= t + 1 ? (r._transactionCleanups = [], r.emit("afterAllTransactions", [r, e])) : ma(e, t + 1);
+		}
+	}
+}, U = (e, t, n = null, r = !0) => {
+	let i = e._transactionCleanups, a = !1, o = null;
+	e._transaction === null && (a = !0, e._transaction = new ca(e, n, r), i.push(e._transaction), i.length === 1 && e.emit("beforeAllTransactions", [e]), e.emit("beforeTransaction", [e._transaction, e]));
+	try {
+		o = t(e._transaction);
+	} finally {
+		if (a) {
+			let t = e._transaction === i[0];
+			e._transaction = null, t && ma(i, 0);
+		}
+	}
+	return o;
+}, ha = class {
+	constructor(e, t) {
+		this.insertions = t, this.deletions = e, this.meta = /* @__PURE__ */ new Map();
+	}
+}, ga = (e, t, n) => {
+	I(e, n.deletions, (n) => {
+		n instanceof Q && t.scope.some((t) => t === e.doc || Bi(t, n)) && hs(n, !1);
+	});
+}, _a = (e, t, n) => {
+	let r = null, i = e.doc, a = e.scope;
+	U(i, (n) => {
+		for (; t.length > 0 && e.currStackItem === null;) {
+			let r = i.store, o = t.pop(), s = /* @__PURE__ */ new Set(), c = [], l = !1;
+			I(n, o.insertions, (e) => {
+				if (e instanceof Q) {
+					if (e.redone !== null) {
+						let { item: t, diff: i } = ms(r, e.id);
+						i > 0 && (t = H(n, R(t.id.client, t.id.clock + i))), e = t;
+					}
+					!e.deleted && a.some((t) => t === n.doc || Bi(t, e)) && c.push(e);
+				}
+			}), I(n, o.deletions, (e) => {
+				e instanceof Q && a.some((t) => t === n.doc || Bi(t, e)) && !Zr(o.insertions, e.id) && s.add(e);
+			}), s.forEach((t) => {
+				l = vs(n, t, s, o.insertions, e.ignoreRemoteMapChanges, e) !== null || l;
+			});
+			for (let t = c.length - 1; t >= 0; t--) {
+				let r = c[t];
+				e.deleteFilter(r) && (r.delete(n), l = !0);
+			}
+			e.currStackItem = l ? o : null;
+		}
+		n.changed.forEach((e, t) => {
+			e.has(null) && t._searchMarker && (t._searchMarker.length = 0);
+		}), r = n;
+	}, e);
+	let o = e.currStackItem;
+	if (o != null) {
+		let t = r.changedParentTypes;
+		e.emit("stack-item-popped", [{
+			stackItem: o,
+			type: n,
+			changedParentTypes: t,
+			origin: e
+		}, e]), e.currStackItem = null;
+	}
+	return o;
+}, va = class extends p {
+	constructor(e, { captureTimeout: t = 500, captureTransaction: n = (e) => !0, deleteFilter: r = () => !0, trackedOrigins: i = /* @__PURE__ */ new Set([null]), ignoreRemoteMapChanges: a = !1, doc: o = f(e) ? e[0].doc : e instanceof si ? 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 Yr();
+			e.afterState.forEach((t, n) => {
+				let r = e.beforeState.get(n) || 0, a = t - r;
+				a > 0 && ei(i, n, r, a);
+			});
+			let a = bt(), o = !1;
+			if (this.lastChange > 0 && a - this.lastChange < this.captureTimeout && r.length > 0 && !t && !n) {
+				let t = r[r.length - 1];
+				t.deletions = $r([t.deletions, e.deleteSet]), t.insertions = $r([t.insertions, i]);
+			} else r.push(new ha(e.deleteSet, i)), o = !0;
+			!t && !n && (this.lastChange = a), I(e, e.deleteSet, (t) => {
+				t instanceof Q && this.scope.some((n) => n === e.doc || Bi(n, t)) && hs(t, !0);
+			});
+			let s = [{
+				stackItem: r[r.length - 1],
+				origin: e.origin,
+				type: t ? "redo" : "undo",
+				changedParentTypes: e.changedParentTypes
+			}, this];
+			o ? this.emit("stack-item-added", s) : this.emit("stack-item-updated", s);
+		}, this.doc.on("afterTransaction", this.afterTransactionHandler), this.doc.on("destroy", () => {
+			this.destroy();
+		});
+	}
+	addToScope(e) {
+		let t = new Set(this.scope);
+		e = f(e) ? e : [e], e.forEach((e) => {
+			t.has(e) || (t.add(e), (e instanceof K ? e.doc !== this.doc : e !== this.doc) && Ur("[yjs#509] Not same Y.Doc"), this.scope.push(e));
+		});
+	}
+	addTrackedOrigin(e) {
+		this.trackedOrigins.add(e);
+	}
+	removeTrackedOrigin(e) {
+		this.trackedOrigins.delete(e);
+	}
+	clear(e = !0, t = !0) {
+		(e && this.canUndo() || t && this.canRedo()) && this.doc.transact((n) => {
+			e && (this.undoStack.forEach((e) => ga(n, this, e)), this.undoStack = []), t && (this.redoStack.forEach((e) => ga(n, this, e)), this.redoStack = []), this.emit("stack-cleared", [{
+				undoStackCleared: e,
+				redoStackCleared: t
+			}]);
+		});
+	}
+	stopCapturing() {
+		this.lastChange = 0;
+	}
+	undo() {
+		this.undoing = !0;
+		let e;
+		try {
+			e = _a(this, this.undoStack, "undo");
+		} finally {
+			this.undoing = !1;
+		}
+		return e;
+	}
+	redo() {
+		this.redoing = !0;
+		let e;
+		try {
+			e = _a(this, this.redoStack, "redo");
+		} finally {
+			this.redoing = !1;
+		}
+		return e;
+	}
+	canUndo() {
+		return this.undoStack.length > 0;
+	}
+	canRedo() {
+		return this.redoStack.length > 0;
+	}
+	destroy() {
+		this.trackedOrigins.delete(this), this.doc.off("afterTransaction", this.afterTransactionHandler), super.destroy();
+	}
+};
+function* ya(e) {
+	let t = D(e.restDecoder);
+	for (let n = 0; n < t; n++) {
+		let t = D(e.restDecoder), n = e.readClient(), r = D(e.restDecoder);
+		for (let i = 0; i < t; i++) {
+			let t = e.readInfo();
+			if (t === 10) {
+				let t = D(e.restDecoder);
+				yield new $(R(n, r), t), r += t;
+			} else if (31 & t) {
+				let i = (t & 192) == 0, a = new Q(R(n, r), null, (t & 128) == 128 ? e.readLeftID() : null, null, (t & 64) == 64 ? e.readRightID() : null, i ? e.readParentInfo() ? e.readString() : e.readLeftID() : null, i && (t & 32) == 32 ? e.readString() : null, ys(e, t));
+				yield a, r += a.length;
+			} else {
+				let t = e.readLen();
+				yield new J(R(n, r), t), r += t;
+			}
+		}
+	}
+}
+var ba = class {
+	constructor(e, t) {
+		this.gen = ya(e), this.curr = null, this.done = !1, this.filterSkips = t, this.next();
+	}
+	next() {
+		do
+			this.curr = this.gen.next().value || null;
+		while (this.filterSkips && this.curr !== null && this.curr.constructor === $);
+		return this.curr;
+	}
+}, xa = class {
+	constructor(e) {
+		this.currClient = 0, this.startClock = 0, this.written = 0, this.encoder = e, this.clientStructs = [];
+	}
+}, Sa = (e) => wa(e, li, pi), Ca = (e, t) => {
+	if (e.constructor === J) {
+		let { client: n, clock: r } = e.id;
+		return new J(R(n, r + t), e.length - t);
+	} else if (e.constructor === $) {
+		let { client: n, clock: r } = e.id;
+		return new $(R(n, r + t), e.length - t);
+	} else {
+		let n = e, { client: r, clock: i } = n.id;
+		return new Q(R(r, i + t), null, R(r, i + t - 1), null, n.rightOrigin, n.parent, n.parentSub, n.content.splice(t));
+	}
+}, wa = (e, t = di, n = L) => {
+	if (e.length === 1) return e[0];
+	let r = e.map((e) => new t(T(e))), i = r.map((e) => new ba(e, !0)), a = null, o = new n(), s = new xa(o);
+	for (; i = i.filter((e) => e.curr !== null), i.sort((e, t) => {
+		if (e.curr.id.client === t.curr.id.client) {
+			let n = e.curr.id.clock - t.curr.id.clock;
+			return n === 0 ? e.curr.constructor === t.curr.constructor ? 0 : e.curr.constructor === $ ? 1 : -1 : n;
+		} else return t.curr.id.client - e.curr.id.client;
+	}), i.length !== 0;) {
+		let e = i[0], t = e.curr.id.client;
+		if (a !== null) {
+			let n = e.curr, r = !1;
+			for (; n !== null && n.id.clock + n.length <= a.struct.id.clock + a.struct.length && n.id.client >= a.struct.id.client;) n = e.next(), r = !0;
+			if (n === null || n.id.client !== t || r && n.id.clock > a.struct.id.clock + a.struct.length) continue;
+			if (t !== a.struct.id.client) W(s, a.struct, a.offset), a = {
+				struct: n,
+				offset: 0
+			}, e.next();
+			else if (a.struct.id.clock + a.struct.length < n.id.clock) if (a.struct.constructor === $) a.struct.length = n.id.clock + n.length - a.struct.id.clock;
+			else {
+				W(s, a.struct, a.offset);
+				let e = n.id.clock - a.struct.id.clock - a.struct.length;
+				a = {
+					struct: new $(R(t, a.struct.id.clock + a.struct.length), e),
+					offset: 0
+				};
+			}
+			else {
+				let t = a.struct.id.clock + a.struct.length - n.id.clock;
+				t > 0 && (a.struct.constructor === $ ? a.struct.length -= t : n = Ca(n, t)), a.struct.mergeWith(n) || (W(s, a.struct, a.offset), a = {
+					struct: n,
+					offset: 0
+				}, e.next());
+			}
+		} else a = {
+			struct: e.curr,
+			offset: 0
+		}, e.next();
+		for (let n = e.curr; n !== null && n.id.client === t && n.id.clock === a.struct.id.clock + a.struct.length && n.constructor !== $; n = e.next()) W(s, a.struct, a.offset), a = {
+			struct: n,
+			offset: 0
+		};
+	}
+	return a !== null && (W(s, a.struct, a.offset), a = null), Da(s), ri(o, $r(r.map((e) => ii(e)))), o.toUint8Array();
+}, Ta = (e, t, n = di, r = L) => {
+	let i = Di(t), a = new r(), o = new xa(a), s = new n(T(e)), c = new ba(s, !1);
+	for (; c.curr;) {
+		let e = c.curr, t = e.id.client, n = i.get(t) || 0;
+		if (c.curr.constructor === $) {
+			c.next();
+			continue;
+		}
+		if (e.id.clock + e.length > n) for (W(o, e, h(n - e.id.clock, 0)), c.next(); c.curr && c.curr.id.client === t;) W(o, c.curr, 0), c.next();
+		else for (; c.curr && c.curr.id.client === t && c.curr.id.clock + c.curr.length <= n;) c.next();
+	}
+	return Da(o), ri(a, ii(s)), a.toUint8Array();
+}, Ea = (e) => {
+	e.written > 0 && (e.clientStructs.push({
+		written: e.written,
+		restEncoder: _(e.encoder.restEncoder)
+	}), e.encoder.restEncoder = g(), e.written = 0);
+}, W = (e, t, n) => {
+	e.written > 0 && e.currClient !== t.id.client && Ea(e), e.written === 0 && (e.currClient = t.id.client, e.encoder.writeClient(t.id.client), y(e.encoder.restEncoder, t.id.clock + n)), t.write(e.encoder, n), e.written++;
+}, Da = (e) => {
+	Ea(e);
+	let t = e.encoder.restEncoder;
+	y(t, e.clientStructs.length);
+	for (let n = 0; n < e.clientStructs.length; n++) {
+		let r = e.clientStructs[n];
+		y(t, r.written), Be(t, r.restEncoder);
+	}
+}, Oa = (e, t, n, r) => {
+	let i = new n(T(e)), a = new ba(i, !1), o = new r(), s = new xa(o);
+	for (let e = a.curr; e !== null; e = a.next()) W(s, t(e), 0);
+	return Da(s), ri(o, ii(i)), o.toUint8Array();
+}, ka = (e) => Oa(e, Ut, di, pi), Aa = "You must not compute changes after the event-handler fired.", ja = class {
+	constructor(e, t) {
+		this.target = e, this.currentTarget = e, this.transaction = t, this._changes = null, this._keys = null, this._delta = null, this._path = null;
+	}
+	get path() {
+		return this._path ||= Ma(this.currentTarget, this.target);
+	}
+	deletes(e) {
+		return Zr(this.transaction.deleteSet, e.id);
+	}
+	get keys() {
+		if (this._keys === null) {
+			if (this.transaction.doc._transactionCleanups.length === 0) throw S(Aa);
+			let e = /* @__PURE__ */ new Map(), t = this.target;
+			this.transaction.changed.get(t).forEach((n) => {
+				if (n !== null) {
+					let r = t._map.get(n), i, a;
+					if (this.adds(r)) {
+						let e = r.left;
+						for (; e !== null && this.adds(e);) e = e.left;
+						if (this.deletes(r)) if (e !== null && this.deletes(e)) i = "delete", a = o(e.content.getContent());
+						else return;
+						else e !== null && this.deletes(e) ? (i = "update", a = o(e.content.getContent())) : (i = "add", a = void 0);
+					} else if (this.deletes(r)) i = "delete", a = o(r.content.getContent());
+					else return;
+					e.set(n, {
+						action: i,
+						oldValue: a
+					});
+				}
+			}), this._keys = e;
+		}
+		return this._keys;
+	}
+	get delta() {
+		return this.changes.delta;
+	}
+	adds(e) {
+		return e.id.clock >= (this.transaction.beforeState.get(e.id.client) || 0);
+	}
+	get changes() {
+		let e = this._changes;
+		if (e === null) {
+			if (this.transaction.doc._transactionCleanups.length === 0) throw S(Aa);
+			let t = this.target, n = a(), r = a(), i = [];
+			if (e = {
+				added: n,
+				deleted: r,
+				delta: i,
+				keys: this.keys
+			}, this.transaction.changed.get(t).has(null)) {
+				let e = null, a = () => {
+					e && i.push(e);
+				};
+				for (let i = t._start; i !== null; i = i.right) i.deleted ? this.deletes(i) && !this.adds(i) && ((e === null || e.delete === void 0) && (a(), e = { delete: 0 }), e.delete += i.length, r.add(i)) : this.adds(i) ? ((e === null || e.insert === void 0) && (a(), e = { insert: [] }), e.insert = e.insert.concat(i.content.getContent()), n.add(i)) : ((e === null || e.retain === void 0) && (a(), e = { retain: 0 }), e.retain += i.length);
+				e !== null && e.retain === void 0 && a();
+			}
+			this._changes = e;
+		}
+		return e;
+	}
+}, Ma = (e, t) => {
+	let n = [];
+	for (; t._item !== null && t !== e;) {
+		if (t._item.parentSub !== null) n.unshift(t._item.parentSub);
+		else {
+			let e = 0, r = t._item.parent._start;
+			for (; r !== t._item && r !== null;) !r.deleted && r.countable && (e += r.length), r = r.right;
+			n.unshift(e);
+		}
+		t = t._item.parent;
+	}
+	return n;
+}, G = () => {
+	Ur("Invalid access: Add Yjs type to a document before reading data.");
+}, Na = 80, Pa = 0, Fa = class {
+	constructor(e, t) {
+		e.marker = !0, this.p = e, this.index = t, this.timestamp = Pa++;
+	}
+}, Ia = (e) => {
+	e.timestamp = Pa++;
+}, La = (e, t, n) => {
+	e.p.marker = !1, e.p = t, t.marker = !0, e.index = n, e.timestamp = Pa++;
+}, Ra = (e, t, n) => {
+	if (e.length >= Na) {
+		let r = e.reduce((e, t) => e.timestamp < t.timestamp ? e : t);
+		return La(r, t, n), r;
+	} else {
+		let r = new Fa(t, n);
+		return e.push(r), r;
+	}
+}, za = (e, t) => {
+	if (e._start === null || t === 0 || e._searchMarker === null) return null;
+	let n = e._searchMarker.length === 0 ? null : e._searchMarker.reduce((e, n) => te(t - e.index) < te(t - n.index) ? e : n), r = e._start, i = 0;
+	for (n !== null && (r = n.p, i = n.index, Ia(n)); r.right !== null && i < t;) {
+		if (!r.deleted && r.countable) {
+			if (t < i + r.length) break;
+			i += r.length;
+		}
+		r = r.right;
+	}
+	for (; r.left !== null && i > t;) r = r.left, !r.deleted && r.countable && (i -= r.length);
+	for (; r.left !== null && r.left.id.client === r.id.client && r.left.id.clock + r.left.length === r.id.clock;) r = r.left, !r.deleted && r.countable && (i -= r.length);
+	return n !== null && te(n.index - i) < r.parent.length / Na ? (La(n, r, i), n) : Ra(e._searchMarker, r, i);
+}, Ba = (e, t, n) => {
+	for (let r = e.length - 1; r >= 0; r--) {
+		let i = e[r];
+		if (n > 0) {
+			let t = i.p;
+			for (t.marker = !1; t && (t.deleted || !t.countable);) t = t.left, t && !t.deleted && t.countable && (i.index -= t.length);
+			if (t === null || t.marker === !0) {
+				e.splice(r, 1);
+				continue;
+			}
+			i.p = t, t.marker = !0;
+		}
+		(t < i.index || n > 0 && t === i.index) && (i.index = h(t, i.index + n));
+	}
+}, Va = (e, t, r) => {
+	let i = e, a = t.changedParentTypes;
+	for (; n(a, e, () => []).push(r), e._item !== null;) e = e._item.parent;
+	Ii(i._eH, r, t);
+}, K = class {
+	constructor() {
+		this._item = null, this._map = /* @__PURE__ */ new Map(), this._start = null, this.doc = null, this._length = 0, this._eH = Ni(), this._dEH = Ni(), this._searchMarker = null;
+	}
+	get parent() {
+		return this._item ? this._item.parent : null;
+	}
+	_integrate(e, t) {
+		this.doc = e, this._item = t;
+	}
+	_copy() {
+		throw C();
+	}
+	clone() {
+		throw C();
+	}
+	_write(e) {}
+	get _first() {
+		let e = this._start;
+		for (; e !== null && e.deleted;) e = e.right;
+		return e;
+	}
+	_callObserver(e, t) {
+		!e.local && this._searchMarker && (this._searchMarker.length = 0);
+	}
+	observe(e) {
+		Pi(this._eH, e);
+	}
+	observeDeep(e) {
+		Pi(this._dEH, e);
+	}
+	unobserve(e) {
+		Fi(this._eH, e);
+	}
+	unobserveDeep(e) {
+		Fi(this._dEH, e);
+	}
+	toJSON() {}
+}, Ha = (e, t, n) => {
+	e.doc ?? G(), t < 0 && (t = e._length + t), n < 0 && (n = e._length + n);
+	let r = n - t, i = [], a = e._start;
+	for (; a !== null && r > 0;) {
+		if (a.countable && !a.deleted) {
+			let e = a.content.getContent();
+			if (e.length <= t) t -= e.length;
+			else {
+				for (let n = t; n < e.length && r > 0; n++) i.push(e[n]), r--;
+				t = 0;
+			}
+		}
+		a = a.right;
+	}
+	return i;
+}, Ua = (e) => {
+	e.doc ?? G();
+	let t = [], n = e._start;
+	for (; n !== null;) {
+		if (n.countable && !n.deleted) {
+			let e = n.content.getContent();
+			for (let n = 0; n < e.length; n++) t.push(e[n]);
+		}
+		n = n.right;
+	}
+	return t;
+}, Wa = (e, t) => {
+	let n = [], r = e._start;
+	for (; r !== null;) {
+		if (r.countable && z(r, t)) {
+			let e = r.content.getContent();
+			for (let t = 0; t < e.length; t++) n.push(e[t]);
+		}
+		r = r.right;
+	}
+	return n;
+}, Ga = (e, t) => {
+	let n = 0, r = e._start;
+	for (e.doc ?? G(); r !== null;) {
+		if (r.countable && !r.deleted) {
+			let i = r.content.getContent();
+			for (let r = 0; r < i.length; r++) t(i[r], n++, e);
+		}
+		r = r.right;
+	}
+}, Ka = (e, t) => {
+	let n = [];
+	return Ga(e, (r, i) => {
+		n.push(t(r, i, e));
+	}), n;
+}, qa = (e) => {
+	let t = e._start, n = null, r = 0;
+	return {
+		[Symbol.iterator]() {
+			return this;
+		},
+		next: () => {
+			if (n === null) {
+				for (; t !== null && t.deleted;) t = t.right;
+				if (t === null) return {
+					done: !0,
+					value: void 0
+				};
+				n = t.content.getContent(), r = 0, t = t.right;
+			}
+			let e = n[r++];
+			return n.length <= r && (n = null), {
+				done: !1,
+				value: e
+			};
+		}
+	};
+}, Ja = (e, t) => {
+	e.doc ?? G();
+	let n = za(e, t), r = e._start;
+	for (n !== null && (r = n.p, t -= n.index); r !== null; r = r.right) if (!r.deleted && r.countable) {
+		if (t < r.length) return r.content.getContent()[t];
+		t -= r.length;
+	}
+}, Ya = (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(R(o, B(s, o)), i, i && i.lastId, c, c && c.id, t, null, new ns(l)), i.integrate(e, 0), l = []);
+	};
+	r.forEach((n) => {
+		if (n === null) l.push(n);
+		else switch (n.constructor) {
+			case Number:
+			case Object:
+			case Boolean:
+			case Array:
+			case String:
+				l.push(n);
+				break;
+			default: switch (u(), n.constructor) {
+				case Uint8Array:
+				case ArrayBuffer:
+					i = new Q(R(o, B(s, o)), i, i && i.lastId, c, c && c.id, t, null, new Uo(new Uint8Array(n))), i.integrate(e, 0);
+					break;
+				case si:
+					i = new Q(R(o, B(s, o)), i, i && i.lastId, c, c && c.id, t, null, new Jo(n)), i.integrate(e, 0);
+					break;
+				default: if (n instanceof K) i = new Q(R(o, B(s, o)), i, i && i.lastId, c, c && c.id, t, null, new Z(n)), i.integrate(e, 0);
+				else throw Error("Unexpected content type in insert operation");
+			}
+		}
+	}), u();
+}, Xa = () => S("Length exceeded!"), Za = (e, t, n, r) => {
+	if (n > t._length) throw Xa();
+	if (n === 0) return t._searchMarker && Ba(t._searchMarker, n, r.length), Ya(e, t, null, r);
+	let i = n, a = za(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 && H(e, R(o.id.client, o.id.clock + n));
+			break;
+		}
+		n -= o.length;
+	}
+	return t._searchMarker && Ba(t._searchMarker, i, r.length), Ya(e, t, o, r);
+}, Qa = (e, t, n) => {
+	let r = (t._searchMarker || []).reduce((e, t) => t.index > e.index ? t : e, {
+		index: 0,
+		p: t._start
+	}).p;
+	if (r) for (; r.right;) r = r.right;
+	return Ya(e, t, r, n);
+}, $a = (e, t, n, r) => {
+	if (r === 0) return;
+	let i = n, a = r, o = za(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 && H(e, R(s.id.client, s.id.clock + n)), n -= s.length);
+	for (; r > 0 && s !== null;) s.deleted || (r < s.length && H(e, R(s.id.client, s.id.clock + r)), s.delete(e), r -= s.length), s = s.right;
+	if (r > 0) throw Xa();
+	t._searchMarker && Ba(t._searchMarker, i, -a + r);
+}, eo = (e, t, n) => {
+	let r = t._map.get(n);
+	r !== void 0 && r.delete(e);
+}, to = (e, t, n, r) => {
+	let i = t._map.get(n) || null, a = e.doc, o = a.clientID, s;
+	if (r == null) s = new ns([r]);
+	else switch (r.constructor) {
+		case Number:
+		case Object:
+		case Boolean:
+		case Array:
+		case String:
+		case Date:
+		case BigInt:
+			s = new ns([r]);
+			break;
+		case Uint8Array:
+			s = new Uo(r);
+			break;
+		case si:
+			s = new Jo(r);
+			break;
+		default: if (r instanceof K) s = new Z(r);
+		else throw Error("Unexpected content type");
+	}
+	new Q(R(o, B(a.store, o)), i, i && i.lastId, null, null, t, n, s).integrate(e, 0);
+}, no = (e, t) => {
+	e.doc ?? G();
+	let n = e._map.get(t);
+	return n !== void 0 && !n.deleted ? n.content.getContent()[n.length - 1] : void 0;
+}, ro = (e) => {
+	let t = {};
+	return e.doc ?? G(), e._map.forEach((e, n) => {
+		e.deleted || (t[n] = e.content.getContent()[e.length - 1]);
+	}), t;
+}, io = (e, t) => {
+	e.doc ?? G();
+	let n = e._map.get(t);
+	return n !== void 0 && !n.deleted;
+}, ao = (e, t) => {
+	let n = {};
+	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 && z(i, t) && (n[r] = i.content.getContent()[i.length - 1]);
+	}), n;
+}, oo = (e) => (e.doc ?? G(), Kr(e._map.entries(), (e) => !e[1].deleted)), so = class extends ja {}, co = class e extends K {
+	constructor() {
+		super(), this._prelimContent = [], this._searchMarker = [];
+	}
+	static from(t) {
+		let n = new e();
+		return n.push(t), n;
+	}
+	_integrate(e, t) {
+		super._integrate(e, t), this.insert(0, this._prelimContent), this._prelimContent = null;
+	}
+	_copy() {
+		return new e();
+	}
+	clone() {
+		let t = new e();
+		return t.insert(0, this.toArray().map((e) => e instanceof K ? e.clone() : e)), t;
+	}
+	get length() {
+		return this.doc ?? G(), this._length;
+	}
+	_callObserver(e, t) {
+		super._callObserver(e, t), Va(this, e, new so(this, e));
+	}
+	insert(e, t) {
+		this.doc === null ? this._prelimContent.splice(e, 0, ...t) : U(this.doc, (n) => {
+			Za(n, this, e, t);
+		});
+	}
+	push(e) {
+		this.doc === null ? this._prelimContent.push(...e) : U(this.doc, (t) => {
+			Qa(t, this, e);
+		});
+	}
+	unshift(e) {
+		this.insert(0, e);
+	}
+	delete(e, t = 1) {
+		this.doc === null ? this._prelimContent.splice(e, t) : U(this.doc, (n) => {
+			$a(n, this, e, t);
+		});
+	}
+	get(e) {
+		return Ja(this, e);
+	}
+	toArray() {
+		return Ua(this);
+	}
+	slice(e = 0, t = this.length) {
+		return Ha(this, e, t);
+	}
+	toJSON() {
+		return this.map((e) => e instanceof K ? e.toJSON() : e);
+	}
+	map(e) {
+		return Ka(this, e);
+	}
+	forEach(e) {
+		Ga(this, e);
+	}
+	[Symbol.iterator]() {
+		return qa(this);
+	}
+	_write(e) {
+		e.writeTypeRef(os);
+	}
+}, lo = (e) => new co(), uo = class extends ja {
+	constructor(e, t, n) {
+		super(e, t), this.keysChanged = n;
+	}
+}, fo = class e extends K {
+	constructor(e) {
+		super(), this._prelimContent = null, e === void 0 ? this._prelimContent = /* @__PURE__ */ new Map() : this._prelimContent = new Map(e);
+	}
+	_integrate(e, t) {
+		super._integrate(e, t), this._prelimContent.forEach((e, t) => {
+			this.set(t, e);
+		}), this._prelimContent = null;
+	}
+	_copy() {
+		return new e();
+	}
+	clone() {
+		let t = new e();
+		return this.forEach((e, n) => {
+			t.set(n, e instanceof K ? e.clone() : e);
+		}), t;
+	}
+	_callObserver(e, t) {
+		Va(this, e, new uo(this, e, t));
+	}
+	toJSON() {
+		this.doc ?? G();
+		let e = {};
+		return this._map.forEach((t, n) => {
+			if (!t.deleted) {
+				let r = t.content.getContent()[t.length - 1];
+				e[n] = r instanceof K ? r.toJSON() : r;
+			}
+		}), e;
+	}
+	get size() {
+		return [...oo(this)].length;
+	}
+	keys() {
+		return qr(oo(this), (e) => e[0]);
+	}
+	values() {
+		return qr(oo(this), (e) => e[1].content.getContent()[e[1].length - 1]);
+	}
+	entries() {
+		return qr(oo(this), (e) => [e[0], e[1].content.getContent()[e[1].length - 1]]);
+	}
+	forEach(e) {
+		this.doc ?? G(), this._map.forEach((t, n) => {
+			t.deleted || e(t.content.getContent()[t.length - 1], n, this);
+		});
+	}
+	[Symbol.iterator]() {
+		return this.entries();
+	}
+	delete(e) {
+		this.doc === null ? this._prelimContent.delete(e) : U(this.doc, (t) => {
+			eo(t, this, e);
+		});
+	}
+	set(e, t) {
+		return this.doc === null ? this._prelimContent.set(e, t) : U(this.doc, (n) => {
+			to(n, this, e, t);
+		}), t;
+	}
+	get(e) {
+		return no(this, e);
+	}
+	has(e) {
+		return io(this, e);
+	}
+	clear() {
+		this.doc === null ? this._prelimContent.clear() : U(this.doc, (e) => {
+			this.forEach(function(t, n, r) {
+				eo(e, r, n);
+			});
+		});
+	}
+	_write(e) {
+		e.writeTypeRef(ss);
+	}
+}, po = (e) => new fo(), q = (e, t) => e === t || typeof e == "object" && typeof t == "object" && e && t && zt(e, t), mo = class {
+	constructor(e, t, n, r) {
+		this.left = e, this.right = t, this.index = n, this.currentAttributes = r;
+	}
+	forward() {
+		switch (this.right === null && w(), this.right.content.constructor) {
+			case Y:
+				this.right.deleted || vo(this.currentAttributes, this.right.content);
+				break;
+			default:
+				this.right.deleted || (this.index += this.right.length);
+				break;
+		}
+		this.left = this.right, this.right = this.right.right;
+	}
+}, ho = (e, t, n) => {
+	for (; t.right !== null && n > 0;) {
+		switch (t.right.content.constructor) {
+			case Y:
+				t.right.deleted || vo(t.currentAttributes, t.right.content);
+				break;
+			default:
+				t.right.deleted || (n < t.right.length && H(e, R(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;
+	}
+	return t;
+}, go = (e, t, n, r) => {
+	let i = /* @__PURE__ */ new Map(), a = r ? za(t, n) : null;
+	return a ? ho(e, new mo(a.p.left, a.p, a.index, i), n - a.index) : ho(e, new mo(null, t._start, 0, i), n);
+}, _o = (e, t, n, r) => {
+	for (; n.right !== null && (n.right.deleted === !0 || n.right.content.constructor === Y && q(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(R(a, B(i.store, a)), s, s && s.lastId, c, c && c.id, t, null, new Y(o, r));
+		l.integrate(e, 0), n.right = l, n.forward();
+	});
+}, vo = (e, t) => {
+	let { key: n, value: r } = t;
+	r === null ? e.delete(n) : e.set(n, r);
+}, yo = (e, t) => {
+	for (; e.right !== null && (e.right.deleted || e.right.content.constructor === Y && q(t[e.right.content.key] ?? null, e.right.content.value));) e.forward();
+}, bo = (e, t, n, r) => {
+	let i = e.doc, a = i.clientID, o = /* @__PURE__ */ new Map();
+	for (let s in r) {
+		let c = r[s], l = n.currentAttributes.get(s) ?? null;
+		if (!q(l, c)) {
+			o.set(s, l);
+			let { left: r, right: u } = n;
+			n.right = new Q(R(a, B(i.store, a)), r, r && r.lastId, u, u && u.id, t, null, new Y(s, c)), n.right.integrate(e, 0), n.forward();
+		}
+	}
+	return o;
+}, xo = (e, t, n, r, i) => {
+	n.currentAttributes.forEach((e, t) => {
+		i[t] === void 0 && (i[t] = null);
+	});
+	let a = e.doc, o = a.clientID;
+	yo(n, i);
+	let s = bo(e, t, n, i), c = r.constructor === String ? new X(r) : r instanceof K ? new Z(r) : new Xo(r), { left: l, right: u, index: d } = n;
+	t._searchMarker && Ba(t._searchMarker, n.index, c.getLength()), u = new Q(R(o, B(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(), _o(e, t, n, s);
+}, So = (e, t, n, r, i) => {
+	let a = e.doc, o = a.clientID;
+	yo(n, i);
+	let s = bo(e, t, n, i);
+	iterationLoop: for (; n.right !== null && (r > 0 || s.size > 0 && (n.right.deleted || n.right.content.constructor === Y));) {
+		if (!n.right.deleted) switch (n.right.content.constructor) {
+			case Y: {
+				let { key: t, value: a } = n.right.content, o = i[t];
+				if (o !== void 0) {
+					if (q(o, a)) s.delete(t);
+					else {
+						if (r === 0) break iterationLoop;
+						s.set(t, a);
+					}
+					n.right.delete(e);
+				} else n.currentAttributes.set(t, a);
+				break;
+			}
+			default:
+				r < n.right.length && H(e, R(n.right.id.client, n.right.id.clock + r)), r -= n.right.length;
+				break;
+		}
+		n.forward();
+	}
+	if (r > 0) {
+		let i = "";
+		for (; r > 0; r--) i += "\n";
+		n.right = new Q(R(o, B(a.store, o)), n.left, n.left && n.left.lastId, n.right, n.right && n.right.id, t, null, new X(i)), n.right.integrate(e, 0), n.forward();
+	}
+	_o(e, t, n, s);
+}, Co = (t, n, r, i, a) => {
+	let o = n, s = e();
+	for (; o && (!o.countable || o.deleted);) {
+		if (!o.deleted && o.content.constructor === Y) {
+			let e = o.content;
+			s.set(e.key, e);
+		}
+		o = o.right;
+	}
+	let c = 0, l = !1;
+	for (; n !== o;) {
+		if (r === n && (l = !0), !n.deleted) {
+			let e = n.content;
+			switch (e.constructor) {
+				case Y: {
+					let { key: r, value: o } = e, u = i.get(r) ?? null;
+					(s.get(r) !== e || u === o) && (n.delete(t), c++, !l && (a.get(r) ?? null) === o && u !== o && (u === null ? a.delete(r) : a.set(r, u))), !l && !n.deleted && vo(a, e);
+					break;
+				}
+			}
+		}
+		n = n.right;
+	}
+	return c;
+}, wo = (e, t) => {
+	for (; t && t.right && (t.right.deleted || !t.right.countable);) t = t.right;
+	let n = /* @__PURE__ */ new Set();
+	for (; t && (t.deleted || !t.countable);) {
+		if (!t.deleted && t.content.constructor === Y) {
+			let r = t.content.key;
+			n.has(r) ? t.delete(e) : n.add(r);
+		}
+		t = t.left;
+	}
+}, To = (n) => {
+	let r = 0;
+	return U(n.doc, (i) => {
+		let a = n._start, o = n._start, s = e(), c = t(s);
+		for (; o;) {
+			if (o.deleted === !1) switch (o.content.constructor) {
+				case Y:
+					vo(c, o.content);
+					break;
+				default:
+					r += Co(i, a, o, s, c), s = t(c), a = o;
+					break;
+			}
+			o = o.right;
+		}
+	}), r;
+}, Eo = (e) => {
+	let t = /* @__PURE__ */ new Set(), n = e.doc;
+	for (let [r, i] of e.afterState.entries()) {
+		let a = e.beforeState.get(r) || 0;
+		i !== a && sa(e, n.store.clients.get(r), a, i, (e) => {
+			!e.deleted && e.content.constructor === Y && e.constructor !== J && t.add(e.parent);
+		});
+	}
+	U(n, (n) => {
+		I(e, e.deleteSet, (e) => {
+			if (e instanceof J || !e.parent._hasFormatting || t.has(e.parent)) return;
+			let r = e.parent;
+			e.content.constructor === Y ? t.add(r) : wo(n, e);
+		});
+		for (let e of t) To(e);
+	});
+}, Do = (e, n, r) => {
+	let i = r, a = t(n.currentAttributes), o = n.right;
+	for (; r > 0 && n.right !== null;) {
+		if (n.right.deleted === !1) switch (n.right.content.constructor) {
+			case Z:
+			case Xo:
+			case X:
+				r < n.right.length && H(e, R(n.right.id.client, n.right.id.clock + r)), r -= n.right.length, n.right.delete(e);
+				break;
+		}
+		n.forward();
+	}
+	o && Co(e, o, n.right, a, n.currentAttributes);
+	let s = (n.left || n.right).parent;
+	return s._searchMarker && Ba(s._searchMarker, n.index, -i + r), n;
+}, Oo = class extends ja {
+	constructor(e, t, n) {
+		super(e, t), this.childListChanged = !1, this.keysChanged = /* @__PURE__ */ new Set(), n.forEach((e) => {
+			e === null ? this.childListChanged = !0 : this.keysChanged.add(e);
+		});
+	}
+	get changes() {
+		if (this._changes === null) {
+			let e = {
+				keys: this.keys,
+				delta: this.delta,
+				added: /* @__PURE__ */ new Set(),
+				deleted: /* @__PURE__ */ new Set()
+			};
+			this._changes = e;
+		}
+		return this._changes;
+	}
+	get delta() {
+		if (this._delta === null) {
+			let e = this.target.doc, t = [];
+			U(e, (e) => {
+				let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = this.target._start, a = null, o = {}, s = "", c = 0, l = 0, u = () => {
+					if (a !== null) {
+						let e = null;
+						switch (a) {
+							case "delete":
+								l > 0 && (e = { delete: l }), l = 0;
+								break;
+							case "insert":
+								(typeof s == "object" || s.length > 0) && (e = { insert: s }, n.size > 0 && (e.attributes = {}, n.forEach((t, n) => {
+									t !== null && (e.attributes[n] = t);
+								}))), s = "";
+								break;
+							case "retain":
+								c > 0 && (e = { retain: c }, It(o) || (e.attributes = jt({}, o))), c = 0;
+								break;
+						}
+						e && t.push(e), a = null;
+					}
+				};
+				for (; i !== null;) {
+					switch (i.content.constructor) {
+						case Z:
+						case Xo:
+							this.adds(i) ? this.deletes(i) || (u(), a = "insert", s = i.content.getContent()[0], u()) : this.deletes(i) ? (a !== "delete" && (u(), a = "delete"), l += 1) : i.deleted || (a !== "retain" && (u(), a = "retain"), c += 1);
+							break;
+						case X:
+							this.adds(i) ? this.deletes(i) || (a !== "insert" && (u(), a = "insert"), s += i.content.str) : this.deletes(i) ? (a !== "delete" && (u(), a = "delete"), l += i.length) : i.deleted || (a !== "retain" && (u(), a = "retain"), c += i.length);
+							break;
+						case Y: {
+							let { key: t, value: s } = i.content;
+							if (this.adds(i)) this.deletes(i) || (q(n.get(t) ?? null, s) ? s !== null && i.delete(e) : (a === "retain" && u(), q(s, r.get(t) ?? null) ? delete o[t] : o[t] = s));
+							else if (this.deletes(i)) {
+								r.set(t, s);
+								let e = n.get(t) ?? null;
+								q(e, s) || (a === "retain" && u(), o[t] = e);
+							} else if (!i.deleted) {
+								r.set(t, s);
+								let n = o[t];
+								n !== void 0 && (q(n, s) ? n !== null && i.delete(e) : (a === "retain" && u(), s === null ? delete o[t] : o[t] = s));
+							}
+							i.deleted || (a === "insert" && u(), vo(n, i.content));
+							break;
+						}
+					}
+					i = i.right;
+				}
+				for (u(); t.length > 0;) {
+					let e = t[t.length - 1];
+					if (e.retain !== void 0 && e.attributes === void 0) t.pop();
+					else break;
+				}
+			}), this._delta = t;
+		}
+		return this._delta;
+	}
+}, ko = class e extends K {
+	constructor(e) {
+		super(), this._pending = e === void 0 ? [] : [() => this.insert(0, e)], this._searchMarker = [], this._hasFormatting = !1;
+	}
+	get length() {
+		return this.doc ?? G(), this._length;
+	}
+	_integrate(e, t) {
+		super._integrate(e, t);
+		try {
+			this._pending.forEach((e) => e());
+		} catch (e) {
+			console.error(e);
+		}
+		this._pending = null;
+	}
+	_copy() {
+		return new e();
+	}
+	clone() {
+		let t = new e();
+		return t.applyDelta(this.toDelta()), t;
+	}
+	_callObserver(e, t) {
+		super._callObserver(e, t);
+		let n = new Oo(this, e, t);
+		Va(this, e, n), !e.local && this._hasFormatting && (e._needFormattingCleanup = !0);
+	}
+	toString() {
+		this.doc ?? G();
+		let e = "", t = this._start;
+		for (; t !== null;) !t.deleted && t.countable && t.content.constructor === X && (e += t.content.str), t = t.right;
+		return e;
+	}
+	toJSON() {
+		return this.toString();
+	}
+	applyDelta(e, { sanitize: t = !0 } = {}) {
+		this.doc === null ? this._pending.push(() => this.applyDelta(e)) : U(this.doc, (n) => {
+			let r = new mo(null, this._start, 0, /* @__PURE__ */ new Map());
+			for (let i = 0; i < e.length; i++) {
+				let a = e[i];
+				if (a.insert !== void 0) {
+					let o = !t && typeof a.insert == "string" && i === e.length - 1 && r.right === null && a.insert.slice(-1) === "\n" ? a.insert.slice(0, -1) : a.insert;
+					(typeof o != "string" || o.length > 0) && xo(n, this, r, o, a.attributes || {});
+				} else a.retain === void 0 ? a.delete !== void 0 && Do(n, r, a.delete) : So(n, this, r, a.retain, a.attributes || {});
+			}
+		});
+	}
+	toDelta(e, t, n) {
+		this.doc ?? G();
+		let r = [], i = /* @__PURE__ */ new Map(), a = this.doc, o = "", s = this._start;
+		function c() {
+			if (o.length > 0) {
+				let e = {}, t = !1;
+				i.forEach((n, r) => {
+					t = !0, e[r] = n;
+				});
+				let n = { insert: o };
+				t && (n.attributes = e), r.push(n), o = "";
+			}
+		}
+		let l = () => {
+			for (; s !== null;) {
+				if (z(s, e) || t !== void 0 && z(s, t)) switch (s.content.constructor) {
+					case X: {
+						let r = i.get("ychange");
+						e !== void 0 && !z(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 && !z(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 Z:
+					case Xo: {
+						c();
+						let e = { insert: s.content.getContent()[0] };
+						if (i.size > 0) {
+							let t = {};
+							e.attributes = t, i.forEach((e, n) => {
+								t[n] = e;
+							});
+						}
+						r.push(e);
+						break;
+					}
+					case Y:
+						z(s, e) && (c(), vo(i, s.content));
+						break;
+				}
+				s = s.right;
+			}
+			c();
+		};
+		return e || t ? U(a, (n) => {
+			e && $i(n, e), t && $i(n, t), l();
+		}, "cleanup") : l(), r;
+	}
+	insert(e, t, n) {
+		if (t.length <= 0) return;
+		let r = this.doc;
+		r === null ? this._pending.push(() => this.insert(e, t, n)) : U(r, (r) => {
+			let i = go(r, this, e, !n);
+			n || (n = {}, i.currentAttributes.forEach((e, t) => {
+				n[t] = e;
+			})), xo(r, this, i, t, n);
+		});
+	}
+	insertEmbed(e, t, n) {
+		let r = this.doc;
+		r === null ? this._pending.push(() => this.insertEmbed(e, t, n || {})) : U(r, (r) => {
+			let i = go(r, this, e, !n);
+			xo(r, this, i, t, n || {});
+		});
+	}
+	delete(e, t) {
+		if (t === 0) return;
+		let n = this.doc;
+		n === null ? this._pending.push(() => this.delete(e, t)) : U(n, (n) => {
+			Do(n, go(n, this, e, !0), t);
+		});
+	}
+	format(e, t, n) {
+		if (t === 0) return;
+		let r = this.doc;
+		r === null ? this._pending.push(() => this.format(e, t, n)) : U(r, (r) => {
+			let i = go(r, this, e, !1);
+			i.right !== null && So(r, this, i, t, n);
+		});
+	}
+	removeAttribute(e) {
+		this.doc === null ? this._pending.push(() => this.removeAttribute(e)) : U(this.doc, (t) => {
+			eo(t, this, e);
+		});
+	}
+	setAttribute(e, t) {
+		this.doc === null ? this._pending.push(() => this.setAttribute(e, t)) : U(this.doc, (n) => {
+			to(n, this, e, t);
+		});
+	}
+	getAttribute(e) {
+		return no(this, e);
+	}
+	getAttributes() {
+		return ro(this);
+	}
+	_write(e) {
+		e.writeTypeRef(cs);
+	}
+}, Ao = (e) => new ko(), jo = class {
+	constructor(e, t = () => !0) {
+		this._filter = t, this._root = e, this._currentNode = e._start, this._firstCall = !0, e.doc ?? G();
+	}
+	[Symbol.iterator]() {
+		return this;
+	}
+	next() {
+		let e = this._currentNode, t = e && e.content && e.content.type;
+		if (e !== null && (!this._firstCall || e.deleted || !this._filter(t))) do
+			if (t = e.content.type, !e.deleted && (t.constructor === Po || t.constructor === Mo) && t._start !== null) e = t._start;
+			else for (; e !== null;) {
+				let t = e.next;
+				if (t !== null) {
+					e = t;
+					break;
+				} else e = e.parent === this._root ? null : e.parent._item;
+			}
+		while (e !== null && (e.deleted || !this._filter(e.content.type)));
+		return this._firstCall = !1, e === null ? {
+			value: void 0,
+			done: !0
+		} : (this._currentNode = e, {
+			value: e.content.type,
+			done: !1
+		});
+	}
+}, Mo = class e extends K {
+	constructor() {
+		super(), this._prelimContent = [];
+	}
+	get firstChild() {
+		let e = this._first;
+		return e ? e.content.getContent()[0] : null;
+	}
+	_integrate(e, t) {
+		super._integrate(e, t), this.insert(0, this._prelimContent), this._prelimContent = null;
+	}
+	_copy() {
+		return new e();
+	}
+	clone() {
+		let t = new e();
+		return t.insert(0, this.toArray().map((e) => e instanceof K ? e.clone() : e)), t;
+	}
+	get length() {
+		return this.doc ?? G(), this._prelimContent === null ? this._length : this._prelimContent.length;
+	}
+	createTreeWalker(e) {
+		return new jo(this, e);
+	}
+	querySelector(e) {
+		e = e.toUpperCase();
+		let t = new jo(this, (t) => t.nodeName && t.nodeName.toUpperCase() === e).next();
+		return t.done ? null : t.value;
+	}
+	querySelectorAll(e) {
+		return e = e.toUpperCase(), c(new jo(this, (t) => t.nodeName && t.nodeName.toUpperCase() === e));
+	}
+	_callObserver(e, t) {
+		Va(this, e, new Io(this, t, e));
+	}
+	toString() {
+		return Ka(this, (e) => e.toString()).join("");
+	}
+	toJSON() {
+		return this.toString();
+	}
+	toDOM(e = document, t = {}, n) {
+		let r = e.createDocumentFragment();
+		return n !== void 0 && n._createAssociation(r, this), Ga(this, (i) => {
+			r.insertBefore(i.toDOM(e, t, n), null);
+		}), r;
+	}
+	insert(e, t) {
+		this.doc === null ? this._prelimContent.splice(e, 0, ...t) : U(this.doc, (n) => {
+			Za(n, this, e, t);
+		});
+	}
+	insertAfter(e, t) {
+		if (this.doc !== null) U(this.doc, (n) => {
+			let r = e && e instanceof K ? e._item : e;
+			Ya(n, this, r, t);
+		});
+		else {
+			let n = this._prelimContent, r = e === null ? 0 : n.findIndex((t) => t === e) + 1;
+			if (r === 0 && e !== null) throw S("Reference item not found");
+			n.splice(r, 0, ...t);
+		}
+	}
+	delete(e, t = 1) {
+		this.doc === null ? this._prelimContent.splice(e, t) : U(this.doc, (n) => {
+			$a(n, this, e, t);
+		});
+	}
+	toArray() {
+		return Ua(this);
+	}
+	push(e) {
+		this.insert(this.length, e);
+	}
+	unshift(e) {
+		this.insert(0, e);
+	}
+	get(e) {
+		return Ja(this, e);
+	}
+	slice(e = 0, t = this.length) {
+		return Ha(this, e, t);
+	}
+	forEach(e) {
+		Ga(this, e);
+	}
+	_write(e) {
+		e.writeTypeRef(us);
+	}
+}, No = (e) => new Mo(), Po = class e extends Mo {
+	constructor(e = "UNDEFINED") {
+		super(), this.nodeName = e, this._prelimAttrs = /* @__PURE__ */ new Map();
+	}
+	get nextSibling() {
+		let e = this._item ? this._item.next : null;
+		return e ? e.content.type : null;
+	}
+	get prevSibling() {
+		let e = this._item ? this._item.prev : null;
+		return e ? e.content.type : null;
+	}
+	_integrate(e, t) {
+		super._integrate(e, t), this._prelimAttrs.forEach((e, t) => {
+			this.setAttribute(t, e);
+		}), this._prelimAttrs = null;
+	}
+	_copy() {
+		return new e(this.nodeName);
+	}
+	clone() {
+		let t = new e(this.nodeName);
+		return Nt(this.getAttributes(), (e, n) => {
+			t.setAttribute(n, e);
+		}), t.insert(0, this.toArray().map((e) => e instanceof K ? e.clone() : e)), t;
+	}
+	toString() {
+		let e = this.getAttributes(), t = [], n = [];
+		for (let t in e) n.push(t);
+		n.sort();
+		let r = n.length;
+		for (let i = 0; i < r; i++) {
+			let r = n[i];
+			t.push(r + "=\"" + e[r] + "\"");
+		}
+		let i = this.nodeName.toLocaleLowerCase();
+		return `<${i}${t.length > 0 ? " " + t.join(" ") : ""}>${super.toString()}</${i}>`;
+	}
+	removeAttribute(e) {
+		this.doc === null ? this._prelimAttrs.delete(e) : U(this.doc, (t) => {
+			eo(t, this, e);
+		});
+	}
+	setAttribute(e, t) {
+		this.doc === null ? this._prelimAttrs.set(e, t) : U(this.doc, (n) => {
+			to(n, this, e, t);
+		});
+	}
+	getAttribute(e) {
+		return no(this, e);
+	}
+	hasAttribute(e) {
+		return io(this, e);
+	}
+	getAttributes(e) {
+		return e ? ao(this, e) : ro(this);
+	}
+	toDOM(e = document, t = {}, n) {
+		let r = e.createElement(this.nodeName), i = this.getAttributes();
+		for (let e in i) {
+			let t = i[e];
+			typeof t == "string" && r.setAttribute(e, t);
+		}
+		return Ga(this, (i) => {
+			r.appendChild(i.toDOM(e, t, n));
+		}), n !== void 0 && n._createAssociation(r, this), r;
+	}
+	_write(e) {
+		e.writeTypeRef(ls), e.writeKey(this.nodeName);
+	}
+}, Fo = (e) => new Po(e.readKey()), Io = class extends ja {
+	constructor(e, t, n) {
+		super(e, n), this.childListChanged = !1, this.attributesChanged = /* @__PURE__ */ new Set(), t.forEach((e) => {
+			e === null ? this.childListChanged = !0 : this.attributesChanged.add(e);
+		});
+	}
+}, Lo = class e extends fo {
+	constructor(e) {
+		super(), this.hookName = e;
+	}
+	_copy() {
+		return new e(this.hookName);
+	}
+	clone() {
+		let t = new e(this.hookName);
+		return this.forEach((e, n) => {
+			t.set(n, e);
+		}), t;
+	}
+	toDOM(e = document, t = {}, n) {
+		let r = t[this.hookName], i;
+		return i = r === void 0 ? document.createElement(this.hookName) : r.createDom(this), i.setAttribute("data-yjs-hook", this.hookName), n !== void 0 && n._createAssociation(i, this), i;
+	}
+	_write(e) {
+		e.writeTypeRef(ds), e.writeKey(this.hookName);
+	}
+}, Ro = (e) => new Lo(e.readKey()), zo = class e extends ko {
+	get nextSibling() {
+		let e = this._item ? this._item.next : null;
+		return e ? e.content.type : null;
+	}
+	get prevSibling() {
+		let e = this._item ? this._item.prev : null;
+		return e ? e.content.type : null;
+	}
+	_copy() {
+		return new e();
+	}
+	clone() {
+		let t = new e();
+		return t.applyDelta(this.toDelta()), t;
+	}
+	toDOM(e = document, t, n) {
+		let r = e.createTextNode(this.toString());
+		return n !== void 0 && n._createAssociation(r, this), r;
+	}
+	toString() {
+		return this.toDelta().map((e) => {
+			let t = [];
+			for (let n in e.attributes) {
+				let r = [];
+				for (let t in e.attributes[n]) r.push({
+					key: t,
+					value: e.attributes[n][t]
+				});
+				r.sort((e, t) => e.key < t.key ? -1 : 1), t.push({
+					nodeName: n,
+					attrs: r
+				});
+			}
+			t.sort((e, t) => e.nodeName < t.nodeName ? -1 : 1);
+			let n = "";
+			for (let e = 0; e < t.length; e++) {
+				let r = t[e];
+				n += `<${r.nodeName}`;
+				for (let e = 0; e < r.attrs.length; e++) {
+					let t = r.attrs[e];
+					n += ` ${t.key}="${t.value}"`;
+				}
+				n += ">";
+			}
+			n += e.insert;
+			for (let e = t.length - 1; e >= 0; e--) n += `</${t[e].nodeName}>`;
+			return n;
+		}).join("");
+	}
+	toJSON() {
+		return this.toString();
+	}
+	_write(e) {
+		e.writeTypeRef(fs);
+	}
+}, Bo = (e) => new zo(), Vo = class {
+	constructor(e, t) {
+		this.id = e, this.length = t;
+	}
+	get deleted() {
+		throw C();
+	}
+	mergeWith(e) {
+		return !1;
+	}
+	write(e, t, n) {
+		throw C();
+	}
+	integrate(e, t) {
+		throw C();
+	}
+}, Ho = 0, J = class extends Vo {
+	get deleted() {
+		return !0;
+	}
+	delete() {}
+	mergeWith(e) {
+		return this.constructor === e.constructor ? (this.length += e.length, !0) : !1;
+	}
+	integrate(e, t) {
+		t > 0 && (this.id.clock += t, this.length -= t), na(e.doc.store, this);
+	}
+	write(e, t) {
+		e.writeInfo(Ho), e.writeLen(this.length - t);
+	}
+	getMissing(e, t) {
+		return null;
+	}
+}, Uo = class e {
+	constructor(e) {
+		this.content = e;
+	}
+	getLength() {
+		return 1;
+	}
+	getContent() {
+		return [this.content];
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(this.content);
+	}
+	splice(e) {
+		throw C();
+	}
+	mergeWith(e) {
+		return !1;
+	}
+	integrate(e, t) {}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		e.writeBuf(this.content);
+	}
+	getRef() {
+		return 3;
+	}
+}, Wo = (e) => new Uo(e.readBuf()), Go = class e {
+	constructor(e) {
+		this.len = e;
+	}
+	getLength() {
+		return this.len;
+	}
+	getContent() {
+		return [];
+	}
+	isCountable() {
+		return !1;
+	}
+	copy() {
+		return new e(this.len);
+	}
+	splice(t) {
+		let n = new e(this.len - t);
+		return this.len = t, n;
+	}
+	mergeWith(e) {
+		return this.len += e.len, !0;
+	}
+	integrate(e, t) {
+		ei(e.deleteSet, t.id.client, t.id.clock, this.len), t.markDeleted();
+	}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		e.writeLen(this.len - t);
+	}
+	getRef() {
+		return 1;
+	}
+}, Ko = (e) => new Go(e.readLen()), qo = (e, t) => new si({
+	guid: e,
+	...t,
+	shouldLoad: t.shouldLoad || t.autoLoad || !1
+}), Jo = 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 = {};
+		this.opts = t, e.gc || (t.gc = !1), e.autoLoad && (t.autoLoad = !0), e.meta !== null && (t.meta = e.meta);
+	}
+	getLength() {
+		return 1;
+	}
+	getContent() {
+		return [this.doc];
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(qo(this.doc.guid, this.opts));
+	}
+	splice(e) {
+		throw C();
+	}
+	mergeWith(e) {
+		return !1;
+	}
+	integrate(e, t) {
+		this.doc._item = t, e.subdocsAdded.add(this.doc), this.doc.shouldLoad && e.subdocsLoaded.add(this.doc);
+	}
+	delete(e) {
+		e.subdocsAdded.has(this.doc) ? e.subdocsAdded.delete(this.doc) : e.subdocsRemoved.add(this.doc);
+	}
+	gc(e) {}
+	write(e, t) {
+		e.writeString(this.doc.guid), e.writeAny(this.opts);
+	}
+	getRef() {
+		return 9;
+	}
+}, Yo = (e) => new Jo(qo(e.readString(), e.readAny())), Xo = class e {
+	constructor(e) {
+		this.embed = e;
+	}
+	getLength() {
+		return 1;
+	}
+	getContent() {
+		return [this.embed];
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(this.embed);
+	}
+	splice(e) {
+		throw C();
+	}
+	mergeWith(e) {
+		return !1;
+	}
+	integrate(e, t) {}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		e.writeJSON(this.embed);
+	}
+	getRef() {
+		return 5;
+	}
+}, Zo = (e) => new Xo(e.readJSON()), Y = class e {
+	constructor(e, t) {
+		this.key = e, this.value = t;
+	}
+	getLength() {
+		return 1;
+	}
+	getContent() {
+		return [];
+	}
+	isCountable() {
+		return !1;
+	}
+	copy() {
+		return new e(this.key, this.value);
+	}
+	splice(e) {
+		throw C();
+	}
+	mergeWith(e) {
+		return !1;
+	}
+	integrate(e, t) {
+		let n = t.parent;
+		n._searchMarker = null, n._hasFormatting = !0;
+	}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		e.writeKey(this.key), e.writeJSON(this.value);
+	}
+	getRef() {
+		return 6;
+	}
+}, Qo = (e) => new Y(e.readKey(), e.readJSON()), $o = class e {
+	constructor(e) {
+		this.arr = e;
+	}
+	getLength() {
+		return this.arr.length;
+	}
+	getContent() {
+		return this.arr;
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(this.arr);
+	}
+	splice(t) {
+		let n = new e(this.arr.slice(t));
+		return this.arr = this.arr.slice(0, t), n;
+	}
+	mergeWith(e) {
+		return this.arr = this.arr.concat(e.arr), !0;
+	}
+	integrate(e, t) {}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		let n = this.arr.length;
+		e.writeLen(n - t);
+		for (let r = t; r < n; r++) {
+			let t = this.arr[r];
+			e.writeString(t === void 0 ? "undefined" : JSON.stringify(t));
+		}
+	}
+	getRef() {
+		return 2;
+	}
+}, es = (e) => {
+	let t = e.readLen(), n = [];
+	for (let r = 0; r < t; r++) {
+		let t = e.readString();
+		t === "undefined" ? n.push(void 0) : n.push(JSON.parse(t));
+	}
+	return new $o(n);
+}, ts = Zt("node_env") === "development", ns = class e {
+	constructor(e) {
+		this.arr = e, ts && Vt(e);
+	}
+	getLength() {
+		return this.arr.length;
+	}
+	getContent() {
+		return this.arr;
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(this.arr);
+	}
+	splice(t) {
+		let n = new e(this.arr.slice(t));
+		return this.arr = this.arr.slice(0, t), n;
+	}
+	mergeWith(e) {
+		return this.arr = this.arr.concat(e.arr), !0;
+	}
+	integrate(e, t) {}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		let n = this.arr.length;
+		e.writeLen(n - t);
+		for (let r = t; r < n; r++) {
+			let t = this.arr[r];
+			e.writeAny(t);
+		}
+	}
+	getRef() {
+		return 8;
+	}
+}, rs = (e) => {
+	let t = e.readLen(), n = [];
+	for (let r = 0; r < t; r++) n.push(e.readAny());
+	return new ns(n);
+}, X = class e {
+	constructor(e) {
+		this.str = e;
+	}
+	getLength() {
+		return this.str.length;
+	}
+	getContent() {
+		return this.str.split("");
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(this.str);
+	}
+	splice(t) {
+		let n = new e(this.str.slice(t));
+		this.str = this.str.slice(0, t);
+		let r = this.str.charCodeAt(t - 1);
+		return r >= 55296 && r <= 56319 && (this.str = this.str.slice(0, t - 1) + "�", n.str = "�" + n.str.slice(1)), n;
+	}
+	mergeWith(e) {
+		return this.str += e.str, !0;
+	}
+	integrate(e, t) {}
+	delete(e) {}
+	gc(e) {}
+	write(e, t) {
+		e.writeString(t === 0 ? this.str : this.str.slice(t));
+	}
+	getRef() {
+		return 4;
+	}
+}, is = (e) => new X(e.readString()), as = [
+	lo,
+	po,
+	Ao,
+	Fo,
+	No,
+	Ro,
+	Bo
+], os = 0, ss = 1, cs = 2, ls = 3, us = 4, ds = 5, fs = 6, Z = class e {
+	constructor(e) {
+		this.type = e;
+	}
+	getLength() {
+		return 1;
+	}
+	getContent() {
+		return [this.type];
+	}
+	isCountable() {
+		return !0;
+	}
+	copy() {
+		return new e(this.type._copy());
+	}
+	splice(e) {
+		throw C();
+	}
+	mergeWith(e) {
+		return !1;
+	}
+	integrate(e, t) {
+		this.type._integrate(e.doc, t);
+	}
+	delete(e) {
+		let t = this.type._start;
+		for (; t !== null;) t.deleted ? t.id.clock < (e.beforeState.get(t.id.client) || 0) && e._mergeStructs.push(t) : t.delete(e), t = t.right;
+		this.type._map.forEach((t) => {
+			t.deleted ? t.id.clock < (e.beforeState.get(t.id.client) || 0) && e._mergeStructs.push(t) : t.delete(e);
+		}), e.changed.delete(this.type);
+	}
+	gc(e) {
+		let t = this.type._start;
+		for (; t !== null;) t.gc(e, !0), t = t.right;
+		this.type._start = null, this.type._map.forEach((t) => {
+			for (; t !== null;) t.gc(e, !0), t = t.left;
+		}), this.type._map = /* @__PURE__ */ new Map();
+	}
+	write(e, t) {
+		this.type._write(e);
+	}
+	getRef() {
+		return 7;
+	}
+}, ps = (e) => new Z(as[e.readTypeRef()](e)), ms = (e, t) => {
+	let n = t, r = 0, i;
+	do
+		r > 0 && (n = R(n.client, n.clock + r)), i = ra(e, n), r = n.clock - i.id.clock, n = i.redone;
+	while (n !== null && i instanceof Q);
+	return {
+		item: i,
+		diff: r
+	};
+}, hs = (e, t) => {
+	for (; e !== null && e.keep !== t;) e.keep = t, e = e.parent._item;
+}, gs = (e, t, n) => {
+	let { client: r, clock: i } = t.id, a = new Q(R(r, i + n), t, R(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 = R(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;
+}, _s = (e, t) => u(e, (e) => Zr(e.deletions, t)), vs = (e, t, n, r, i, a) => {
+	let o = e.doc, s = o.store, c = o.clientID, l = t.redone;
+	if (l !== null) return H(e, l);
+	let u = t.parent._item, d = null, f;
+	if (u !== null && u.deleted === !0) {
+		if (u.redone === null && (!n.has(u) || vs(e, u, n, r, i, a) === null)) return null;
+		for (; u.redone !== null;) u = H(e, u.redone);
+	}
+	let p = u === null ? t.parent : u.content.type;
+	if (t.parentSub === null) {
+		for (d = t.left, f = t; d !== null;) {
+			let t = d;
+			for (; t !== null && t.parent._item !== u;) t = t.redone === null ? null : H(e, t.redone);
+			if (t !== null && t.parent._item === u) {
+				d = t;
+				break;
+			}
+			d = d.left;
+		}
+		for (; f !== null;) {
+			let t = f;
+			for (; t !== null && t.parent._item !== u;) t = t.redone === null ? null : H(e, t.redone);
+			if (t !== null && t.parent._item === u) {
+				f = t;
+				break;
+			}
+			f = f.right;
+		}
+	} else {
+		if (f = null, t.right && !i) {
+			for (d = t; d !== null && d.right !== null && (d.right.redone || Zr(r, d.right.id) || _s(a.undoStack, d.right.id) || _s(a.redoStack, d.right.id));) for (d = d.right; d.redone;) d = H(e, d.redone);
+			if (d && d.right !== null) return null;
+		} else d = p._map.get(t.parentSub) || null;
+		d !== null && d.parent._item !== u && (d = p._map.get(t.parentSub) || null);
+	}
+	let ee = R(c, B(s, c)), m = new Q(ee, d, d && d.lastId, f, f && f.id, p, t.parentSub, t.content.copy());
+	return t.redone = ee, hs(m, !0), m.integrate(e, 0), m;
+}, Q = class e extends Vo {
+	constructor(e, t, n, r, i, a, o, s) {
+		super(e, s.getLength()), this.origin = n, this.left = t, this.right = r, this.rightOrigin = i, this.parent = a, this.parentSub = o, this.redone = null, this.content = s, this.info = this.content.isCountable() ? 2 : 0;
+	}
+	set marker(e) {
+		(this.info & 8) > 0 !== e && (this.info ^= 8);
+	}
+	get marker() {
+		return (this.info & 8) > 0;
+	}
+	get keep() {
+		return (this.info & 1) > 0;
+	}
+	set keep(e) {
+		this.keep !== e && (this.info ^= 1);
+	}
+	get countable() {
+		return (this.info & 2) > 0;
+	}
+	get deleted() {
+		return (this.info & 4) > 0;
+	}
+	set deleted(e) {
+		this.deleted !== e && (this.info ^= 4);
+	}
+	markDeleted() {
+		this.info |= 4;
+	}
+	getMissing(t, n) {
+		if (this.origin && this.origin.client !== this.id.client && this.origin.clock >= B(n, this.origin.client)) return this.origin.client;
+		if (this.rightOrigin && this.rightOrigin.client !== this.id.client && this.rightOrigin.clock >= B(n, this.rightOrigin.client)) return this.rightOrigin.client;
+		if (this.parent && this.parent.constructor === Li && this.id.client !== this.parent.client && this.parent.clock >= B(n, this.parent.client)) return this.parent.client;
+		if (this.origin &&= (this.left = aa(t, n, this.origin), this.left.lastId), this.rightOrigin &&= (this.right = H(t, this.rightOrigin), this.right.id), this.left && this.left.constructor === J || this.right && this.right.constructor === J) 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 === Li) {
+			let e = ra(n, this.parent);
+			e.constructor === J ? this.parent = null : this.parent = e.content.type;
+		}
+		return null;
+	}
+	integrate(e, t) {
+		if (t > 0 && (this.id.clock += t, this.left = aa(e, e.doc.store, R(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;
+				else if (this.parentSub !== null) for (n = this.parent._map.get(this.parentSub) || null; n !== null && n.left !== null;) n = n.left;
+				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), Ri(this.origin, n.origin)) {
+						if (n.id.client < this.id.client) t = n, r.clear();
+						else if (Ri(this.rightOrigin, n.rightOrigin)) break;
+					} else if (n.origin !== null && i.has(ra(e.doc.store, n.origin))) r.has(ra(e.doc.store, n.origin)) || (t = n, r.clear());
+					else break;
+					n = n.right;
+				}
+				this.left = t;
+			}
+			if (this.left !== null) {
+				let e = this.left.right;
+				this.right = e, this.left.right = this;
+			} else {
+				let e;
+				if (this.parentSub !== null) for (e = this.parent._map.get(this.parentSub) || null; e !== null && e.left !== null;) e = e.left;
+				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), na(e.doc.store, this), this.content.integrate(e, this), ua(e, this.parent, this.parentSub), (this.parent._item !== null && this.parent._item.deleted || this.parentSub !== null && this.right !== null) && this.delete(e);
+		} else new J(this.id, this.length).integrate(e, 0);
+	}
+	get next() {
+		let e = this.right;
+		for (; e !== null && e.deleted;) e = e.right;
+		return e;
+	}
+	get prev() {
+		let e = this.left;
+		for (; e !== null && e.deleted;) e = e.left;
+		return e;
+	}
+	get lastId() {
+		return this.length === 1 ? this.id : R(this.id.client, this.id.clock + this.length - 1);
+	}
+	mergeWith(e) {
+		if (this.constructor === e.constructor && Ri(e.origin, this.lastId) && this.right === e && Ri(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));
+			}), e.keep && (this.keep = !0), this.right = e.right, this.right !== null && (this.right.left = this), this.length += e.length, !0;
+		}
+		return !1;
+	}
+	delete(e) {
+		if (!this.deleted) {
+			let t = this.parent;
+			this.countable && this.parentSub === null && (t._length -= this.length), this.markDeleted(), ei(e.deleteSet, this.id.client, this.id.clock, this.length), ua(e, t, this.parentSub), this.content.delete(e);
+		}
+	}
+	gc(e, t) {
+		if (!this.deleted) throw w();
+		this.content.gc(e), t ? oa(e, this, new J(this.id, this.length)) : this.content = new Go(this.length);
+	}
+	write(e, t) {
+		let n = t > 0 ? R(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 = zi(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 === Li ? (e.writeParentInfo(!1), e.writeLeftID(t)) : w();
+			i !== null && e.writeString(i);
+		}
+		this.content.write(e, t);
+	}
+}, ys = (e, t) => bs[t & 31](e), bs = [
+	() => {
+		w();
+	},
+	Ko,
+	es,
+	Wo,
+	is,
+	Zo,
+	Qo,
+	ps,
+	rs,
+	Yo,
+	() => {
+		w();
+	}
+], xs = 10, $ = class extends Vo {
+	get deleted() {
+		return !0;
+	}
+	delete() {}
+	mergeWith(e) {
+		return this.constructor === e.constructor ? (this.length += e.length, !0) : !1;
+	}
+	integrate(e, t) {
+		w();
+	}
+	write(e, t) {
+		e.writeInfo(xs), y(e.restEncoder, this.length - t);
+	}
+	getMissing(e, t) {
+		return null;
+	}
+}, Ss = typeof globalThis < "u" ? globalThis : typeof window < "u" ? window : typeof global < "u" ? global : {}, Cs = "__ $YJS$ __";
+Ss[Cs] === !0 && console.error("Yjs was already imported. This breaks constructor checks and will lead to issues! - https://github.com/yjs/yjs/issues/438"), Ss[Cs] = !0;
+//#endregion
+//#region ../node_modules/.bun/y-protocols@1.0.7+253afa400b9c0a30/node_modules/y-protocols/awareness.js
+var ws = 3e4, Ts = class extends ee {
+	constructor(e) {
+		super(), this.doc = e, this.clientID = e.clientID, this.states = /* @__PURE__ */ new Map(), this.meta = /* @__PURE__ */ new Map(), this._checkInterval = setInterval(() => {
+			let e = bt();
+			this.getLocalState() !== null && 3e4 / 2 <= e - this.meta.get(this.clientID).lastUpdated && this.setLocalState(this.getLocalState());
+			let t = [];
+			this.meta.forEach((n, r) => {
+				r !== this.clientID && 3e4 <= e - n.lastUpdated && this.states.has(r) && t.push(r);
+			}), t.length > 0 && Es(this, t, "timeout");
+		}, m(ws / 10)), e.on("destroy", () => {
+			this.destroy();
+		}), this.setLocalState({});
+	}
+	destroy() {
+		this.emit("destroy", [this]), this.setLocalState(null), super.destroy(), clearInterval(this._checkInterval);
+	}
+	getLocalState() {
+		return this.states.get(this.clientID) || null;
+	}
+	setLocalState(e) {
+		let t = this.clientID, n = this.meta.get(t), r = n === void 0 ? 0 : n.clock + 1, i = this.states.get(t);
+		e === null ? this.states.delete(t) : this.states.set(t, e), this.meta.set(t, {
+			clock: r,
+			lastUpdated: bt()
+		});
+		let a = [], o = [], s = [], c = [];
+		e === null ? c.push(t) : i == null ? e != null && a.push(t) : (o.push(t), Wt(i, e) || s.push(t)), (a.length > 0 || s.length > 0 || c.length > 0) && this.emit("change", [{
+			added: a,
+			updated: s,
+			removed: c
+		}, "local"]), this.emit("update", [{
+			added: a,
+			updated: o,
+			removed: c
+		}, "local"]);
+	}
+	setLocalStateField(e, t) {
+		let n = this.getLocalState();
+		n !== null && this.setLocalState({
+			...n,
+			[e]: t
+		});
+	}
+	getStates() {
+		return this.states;
+	}
+}, Es = (e, t, n) => {
+	let r = [];
+	for (let n = 0; n < t.length; n++) {
+		let i = t[n];
+		if (e.states.has(i)) {
+			if (e.states.delete(i), i === e.clientID) {
+				let t = e.meta.get(i);
+				e.meta.set(i, {
+					clock: t.clock + 1,
+					lastUpdated: bt()
+				});
+			}
+			r.push(i);
+		}
+	}
+	r.length > 0 && (e.emit("change", [{
+		added: [],
+		updated: [],
+		removed: r
+	}, n]), e.emit("update", [{
+		added: [],
+		updated: [],
+		removed: r
+	}, n]));
+}, Ds = (e, t, n = e.states) => {
+	let r = t.length, i = g();
+	y(i, r);
+	for (let a = 0; a < r; a++) {
+		let r = t[a], o = n.get(r) || null, s = e.meta.get(r).clock;
+		y(i, r), y(i, s), b(i, JSON.stringify(o));
+	}
+	return _(i);
+}, Os = (e, t, n) => {
+	let r = T(t), i = bt(), a = [], o = [], s = [], c = [], l = D(r);
+	for (let t = 0; t < l; t++) {
+		let t = D(r), n = D(r), l = JSON.parse(O(r)), u = e.meta.get(t), d = e.states.get(t), f = u === void 0 ? 0 : u.clock;
+		(f < n || f === n && l === null && e.states.has(t)) && (l === null ? t === e.clientID && e.getLocalState() != null ? n++ : e.states.delete(t) : e.states.set(t, l), e.meta.set(t, {
+			clock: n,
+			lastUpdated: i
+		}), u === void 0 && l !== null ? a.push(t) : u !== void 0 && l === null ? c.push(t) : l !== null && (Wt(l, d) || s.push(t), o.push(t)));
+	}
+	(a.length > 0 || s.length > 0 || c.length > 0) && e.emit("change", [{
+		added: a,
+		updated: s,
+		removed: c
+	}, n]), (a.length > 0 || o.length > 0 || c.length > 0) && e.emit("update", [{
+		added: a,
+		updated: o,
+		removed: c
+	}, n]);
+};
+//#endregion
+export { E as $, Bi as A, qt as B, Ki as C, V as D, ji as E, P as F, Dt as G, Lt as H, rn as I, bt as J, Et as K, fn as L, Qi as M, Wa as N, zi as O, kr as P, D as Q, un as R, Hi as S, Ti as T, Mt as U, Kt as V, Pt as W, T as X, _t as Y, O as Z, xi as _, Y as a, y as at, ti as b, si as c, h as ct, Xi as d, p as dt, C as et, va as f, a as ft, Si as g, zo as h, Es as i, _ as it, I as j, Zr as k, Q as l, ne as lt, Po as m, n as mt, Os as n, g as nt, X as o, x as ot, ko as p, e as pt, Tt as q, Ds as r, Pe as rt, Z as s, _e as st, Ts as t, w as tt, Vi as u, re as ut, Yi as v, Zi as w, R as x, Ji as y, ln as z };