@lstsystems/ckeditor5-source-editing-codemirror 47.5.1 → 48.1.0

package/dist/sourceediting-codemirror.js

@@ -1,261 +1,1025 @@
-import { Plugin as g } from "ckeditor5";
-import { lineNumbers as m, highlightActiveLine as w, highlightActiveLineGutter as y, EditorView as f } from "@codemirror/view";
-import { EditorSelection as E, EditorState as x } from "@codemirror/state";
-import { html as S } from "@codemirror/lang-html";
-import { IndentContext as b, getIndentation as v, indentString as C, syntaxHighlighting as N, defaultHighlightStyle as O, indentOnInput as A, indentUnit as k } from "@codemirror/language";
-import B from "prettier/standalone";
-import * as P from "prettier/plugins/html";
-import * as z from "prettier/plugins/postcss";
-import * as D from "prettier/plugins/typescript";
-import * as L from "prettier/plugins/markdown";
-import * as j from "prettier/plugins/yaml";
-let I = 0;
-class s {
-  /**
-  Create a new node prop type.
-  */
-  constructor(e = {}) {
-    this.id = I++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
-      throw new Error("This node type doesn't define a deserialize function");
-    }), this.combine = e.combine || null;
-  }
-  /**
-  This is meant to be used with
-  [`NodeSet.extend`](#common.NodeSet.extend) or
-  [`LRParser.configure`](#lr.ParserConfig.props) to compute
-  prop values for each node type in the set. Takes a [match
-  object](#common.NodeType^match) or function that returns undefined
-  if the node type doesn't get this prop, and the prop's value if
-  it does.
-  */
-  add(e) {
-    if (this.perNode)
-      throw new RangeError("Can't add per-node props to node types");
-    return typeof e != "function" && (e = p.match(e)), (o) => {
-      let i = e(o);
-      return i === void 0 ? null : [this, i];
-    };
-  }
+import { Plugin as e } from "ckeditor5";
+import { EditorView as t, highlightActiveLine as n, highlightActiveLineGutter as r, lineNumbers as i } from "@codemirror/view";
+import { Annotation as a, ChangeDesc as o, ChangeSet as s, EditorSelection as c, EditorState as l, Facet as u, StateEffect as d } from "@codemirror/state";
+import { html as f } from "@codemirror/lang-html";
+import { IndentContext as p, defaultHighlightStyle as m, getIndentation as h, indentOnInput as g, indentString as _, indentUnit as v, syntaxHighlighting as y } from "@codemirror/language";
+import b from "prettier/standalone";
+import * as x from "prettier/plugins/html";
+import * as S from "prettier/plugins/postcss";
+import * as C from "prettier/plugins/typescript";
+import * as w from "prettier/plugins/markdown";
+import * as T from "prettier/plugins/yaml";
+//#region node_modules/@lezer/common/dist/index.js
+var E = 1024, D = 0, O = class {
+	constructor(e = {}) {
+		this.id = D++, this.perNode = !!e.perNode, this.deserialize = e.deserialize || (() => {
+			throw Error("This node type doesn't define a deserialize function");
+		}), this.combine = e.combine || null;
+	}
+	add(e) {
+		if (this.perNode) throw RangeError("Can't add per-node props to node types");
+		return typeof e != "function" && (e = j.match(e)), (t) => {
+			let n = e(t);
+			return n === void 0 ? null : [this, n];
+		};
+	}
+};
+O.closedBy = new O({ deserialize: (e) => e.split(" ") }), O.openedBy = new O({ deserialize: (e) => e.split(" ") }), O.group = new O({ deserialize: (e) => e.split(" ") }), O.isolate = new O({ deserialize: (e) => {
+	if (e && e != "rtl" && e != "ltr" && e != "auto") throw RangeError("Invalid value for isolate: " + e);
+	return e || "auto";
+} }), O.contextHash = new O({ perNode: !0 }), O.lookAhead = new O({ perNode: !0 }), O.mounted = new O({ perNode: !0 });
+var k = class {
+	constructor(e, t, n, r = !1) {
+		this.tree = e, this.overlay = t, this.parser = n, this.bracketed = r;
+	}
+	static get(e) {
+		return e && e.props && e.props[O.mounted.id];
+	}
+}, A = Object.create(null), j = class e {
+	constructor(e, t, n, r = 0) {
+		this.name = e, this.props = t, this.id = n, this.flags = r;
+	}
+	static define(t) {
+		let n = t.props && t.props.length ? Object.create(null) : A, r = !!t.top | (t.skipped ? 2 : 0) | (t.error ? 4 : 0) | (t.name == null ? 8 : 0), i = new e(t.name || "", n, t.id, r);
+		if (t.props) {
+			for (let e of t.props) if (Array.isArray(e) || (e = e(i)), e) {
+				if (e[0].perNode) throw RangeError("Can't store a per-node prop on a node type");
+				n[e[0].id] = e[1];
+			}
+		}
+		return i;
+	}
+	prop(e) {
+		return this.props[e.id];
+	}
+	get isTop() {
+		return (this.flags & 1) > 0;
+	}
+	get isSkipped() {
+		return (this.flags & 2) > 0;
+	}
+	get isError() {
+		return (this.flags & 4) > 0;
+	}
+	get isAnonymous() {
+		return (this.flags & 8) > 0;
+	}
+	is(e) {
+		if (typeof e == "string") {
+			if (this.name == e) return !0;
+			let t = this.prop(O.group);
+			return t ? t.indexOf(e) > -1 : !1;
+		}
+		return this.id == e;
+	}
+	static match(e) {
+		let t = Object.create(null);
+		for (let n in e) for (let r of n.split(" ")) t[r] = e[n];
+		return (e) => {
+			for (let n = e.prop(O.group), r = -1; r < (n ? n.length : 0); r++) {
+				let i = t[r < 0 ? e.name : n[r]];
+				if (i) return i;
+			}
+		};
+	}
+};
+j.none = new j("", Object.create(null), 0, 8);
+var M = /* @__PURE__ */ new WeakMap(), N = /* @__PURE__ */ new WeakMap(), P;
+(function(e) {
+	e[e.ExcludeBuffers = 1] = "ExcludeBuffers", e[e.IncludeAnonymous = 2] = "IncludeAnonymous", e[e.IgnoreMounts = 4] = "IgnoreMounts", e[e.IgnoreOverlays = 8] = "IgnoreOverlays", e[e.EnterBracketed = 16] = "EnterBracketed";
+})(P ||= {});
+var F = class e {
+	constructor(e, t, n, r, i) {
+		if (this.type = e, this.children = t, this.positions = n, this.length = r, this.props = null, i && i.length) {
+			this.props = Object.create(null);
+			for (let [e, t] of i) this.props[typeof e == "number" ? e : e.id] = t;
+		}
+	}
+	toString() {
+		let e = k.get(this);
+		if (e && !e.overlay) return e.tree.toString();
+		let t = "";
+		for (let e of this.children) {
+			let n = e.toString();
+			n && (t && (t += ","), t += n);
+		}
+		return this.type.name ? (/\W/.test(this.type.name) && !this.type.isError ? JSON.stringify(this.type.name) : this.type.name) + (t.length ? "(" + t + ")" : "") : t;
+	}
+	cursor(e = 0) {
+		return new W(this.topNode, e);
+	}
+	cursorAt(e, t = 0, n = 0) {
+		let r = new W(M.get(this) || this.topNode);
+		return r.moveTo(e, t), M.set(this, r._tree), r;
+	}
+	get topNode() {
+		return new B(this, 0, 0, null);
+	}
+	resolve(e, t = 0) {
+		let n = R(M.get(this) || this.topNode, e, t, !1);
+		return M.set(this, n), n;
+	}
+	resolveInner(e, t = 0) {
+		let n = R(N.get(this) || this.topNode, e, t, !0);
+		return N.set(this, n), n;
+	}
+	resolveStack(e, t = 0) {
+		return ie(this, e, t);
+	}
+	iterate(e) {
+		let { enter: t, leave: n, from: r = 0, to: i = this.length } = e, a = e.mode || 0, o = (a & P.IncludeAnonymous) > 0;
+		for (let e = this.cursor(a | P.IncludeAnonymous);;) {
+			let a = !1;
+			if (e.from <= i && e.to >= r && (!o && e.type.isAnonymous || t(e) !== !1)) {
+				if (e.firstChild()) continue;
+				a = !0;
+			}
+			for (; a && n && (o || !e.type.isAnonymous) && n(e), !e.nextSibling();) {
+				if (!e.parent()) return;
+				a = !0;
+			}
+		}
+	}
+	prop(e) {
+		return e.perNode ? this.props ? this.props[e.id] : void 0 : this.type.prop(e);
+	}
+	get propValues() {
+		let e = [];
+		if (this.props) for (let t in this.props) e.push([+t, this.props[t]]);
+		return e;
+	}
+	balance(t = {}) {
+		return this.children.length <= 8 ? this : J(j.none, this.children, this.positions, 0, this.children.length, 0, this.length, (t, n, r) => new e(this.type, t, n, r, this.propValues), t.makeTree || ((t, n, r) => new e(j.none, t, n, r)));
+	}
+	static build(e) {
+		return ae(e);
+	}
+};
+F.empty = new F(j.none, [], [], 0);
+var ee = class e {
+	constructor(e, t) {
+		this.buffer = e, this.index = t;
+	}
+	get id() {
+		return this.buffer[this.index - 4];
+	}
+	get start() {
+		return this.buffer[this.index - 3];
+	}
+	get end() {
+		return this.buffer[this.index - 2];
+	}
+	get size() {
+		return this.buffer[this.index - 1];
+	}
+	get pos() {
+		return this.index;
+	}
+	next() {
+		this.index -= 4;
+	}
+	fork() {
+		return new e(this.buffer, this.index);
+	}
+}, I = class e {
+	constructor(e, t, n) {
+		this.buffer = e, this.length = t, this.set = n;
+	}
+	get type() {
+		return j.none;
+	}
+	toString() {
+		let e = [];
+		for (let t = 0; t < this.buffer.length;) e.push(this.childString(t)), t = this.buffer[t + 3];
+		return e.join(",");
+	}
+	childString(e) {
+		let t = this.buffer[e], n = this.buffer[e + 3], r = this.set.types[t], i = r.name;
+		if (/\W/.test(i) && !r.isError && (i = JSON.stringify(i)), e += 4, n == e) return i;
+		let a = [];
+		for (; e < n;) a.push(this.childString(e)), e = this.buffer[e + 3];
+		return i + "(" + a.join(",") + ")";
+	}
+	findChild(e, t, n, r, i) {
+		let { buffer: a } = this, o = -1;
+		for (let s = e; s != t && !(L(i, r, a[s + 1], a[s + 2]) && (o = s, n > 0)); s = a[s + 3]);
+		return o;
+	}
+	slice(t, n, r) {
+		let i = this.buffer, a = new Uint16Array(n - t), o = 0;
+		for (let e = t, s = 0; e < n;) {
+			a[s++] = i[e++], a[s++] = i[e++] - r;
+			let n = a[s++] = i[e++] - r;
+			a[s++] = i[e++] - t, o = Math.max(o, n);
+		}
+		return new e(a, o, this.set);
+	}
+};
+function L(e, t, n, r) {
+	switch (e) {
+		case -2: return n < t;
+		case -1: return r >= t && n < t;
+		case 0: return n < t && r > t;
+		case 1: return n <= t && r > t;
+		case 2: return r > t;
+		case 4: return !0;
+	}
+}
+function R(e, t, n, r) {
+	for (; e.from == e.to || (n < 1 ? e.from >= t : e.from > t) || (n > -1 ? e.to <= t : e.to < t);) {
+		let t = !r && e instanceof B && e.index < 0 ? null : e.parent;
+		if (!t) return e;
+		e = t;
+	}
+	let i = r ? 0 : P.IgnoreOverlays;
+	if (r) for (let r = e, a = r.parent; a; r = a, a = r.parent) r instanceof B && r.index < 0 && a.enter(t, n, i)?.from != r.from && (e = a);
+	for (;;) {
+		let r = e.enter(t, n, i);
+		if (!r) return e;
+		e = r;
+	}
+}
+var z = class {
+	cursor(e = 0) {
+		return new W(this, e);
+	}
+	getChild(e, t = null, n = null) {
+		let r = V(this, e, t, n);
+		return r.length ? r[0] : null;
+	}
+	getChildren(e, t = null, n = null) {
+		return V(this, e, t, n);
+	}
+	resolve(e, t = 0) {
+		return R(this, e, t, !1);
+	}
+	resolveInner(e, t = 0) {
+		return R(this, e, t, !0);
+	}
+	matchContext(e) {
+		return H(this.parent, e);
+	}
+	enterUnfinishedNodesBefore(e) {
+		let t = this.childBefore(e), n = this;
+		for (; t;) {
+			let e = t.lastChild;
+			if (!e || e.to != t.to) break;
+			e.type.isError && e.from == e.to ? (n = t, t = e.prevSibling) : t = e;
+		}
+		return n;
+	}
+	get node() {
+		return this;
+	}
+	get next() {
+		return this.parent;
+	}
+}, B = class e extends z {
+	constructor(e, t, n, r) {
+		super(), this._tree = e, this.from = t, this.index = n, this._parent = r;
+	}
+	get type() {
+		return this._tree.type;
+	}
+	get name() {
+		return this._tree.type.name;
+	}
+	get to() {
+		return this.from + this._tree.length;
+	}
+	nextChild(t, n, r, i, a = 0) {
+		for (let o = this;;) {
+			for (let { children: s, positions: c } = o._tree, l = n > 0 ? s.length : -1; t != l; t += n) {
+				let l = s[t], u = c[t] + o.from, d;
+				if (!(!(a & P.EnterBracketed && l instanceof F && (d = k.get(l)) && !d.overlay && d.bracketed && r >= u && r <= u + l.length) && !L(i, r, u, u + l.length))) {
+					if (l instanceof I) {
+						if (a & P.ExcludeBuffers) continue;
+						let e = l.findChild(0, l.buffer.length, n, r - u, i);
+						if (e > -1) return new U(new te(o, l, t, u), null, e);
+					} else if (a & P.IncludeAnonymous || !l.type.isAnonymous || G(l)) {
+						let s;
+						if (!(a & P.IgnoreMounts) && (s = k.get(l)) && !s.overlay) return new e(s.tree, u, t, o);
+						let c = new e(l, u, t, o);
+						return a & P.IncludeAnonymous || !c.type.isAnonymous ? c : c.nextChild(n < 0 ? l.children.length - 1 : 0, n, r, i, a);
+					}
+				}
+			}
+			if (a & P.IncludeAnonymous || !o.type.isAnonymous || (t = o.index >= 0 ? o.index + n : n < 0 ? -1 : o._parent._tree.children.length, o = o._parent, !o)) return null;
+		}
+	}
+	get firstChild() {
+		return this.nextChild(0, 1, 0, 4);
+	}
+	get lastChild() {
+		return this.nextChild(this._tree.children.length - 1, -1, 0, 4);
+	}
+	childAfter(e) {
+		return this.nextChild(0, 1, e, 2);
+	}
+	childBefore(e) {
+		return this.nextChild(this._tree.children.length - 1, -1, e, -2);
+	}
+	prop(e) {
+		return this._tree.prop(e);
+	}
+	enter(t, n, r = 0) {
+		let i;
+		if (!(r & P.IgnoreOverlays) && (i = k.get(this._tree)) && i.overlay) {
+			let a = t - this.from, o = r & P.EnterBracketed && i.bracketed;
+			for (let { from: t, to: r } of i.overlay) if ((n > 0 || o ? t <= a : t < a) && (n < 0 || o ? r >= a : r > a)) return new e(i.tree, i.overlay[0].from + this.from, -1, this);
+		}
+		return this.nextChild(0, 1, t, n, r);
+	}
+	nextSignificantParent() {
+		let e = this;
+		for (; e.type.isAnonymous && e._parent;) e = e._parent;
+		return e;
+	}
+	get parent() {
+		return this._parent ? this._parent.nextSignificantParent() : null;
+	}
+	get nextSibling() {
+		return this._parent && this.index >= 0 ? this._parent.nextChild(this.index + 1, 1, 0, 4) : null;
+	}
+	get prevSibling() {
+		return this._parent && this.index >= 0 ? this._parent.nextChild(this.index - 1, -1, 0, 4) : null;
+	}
+	get tree() {
+		return this._tree;
+	}
+	toTree() {
+		return this._tree;
+	}
+	toString() {
+		return this._tree.toString();
+	}
+};
+function V(e, t, n, r) {
+	let i = e.cursor(), a = [];
+	if (!i.firstChild()) return a;
+	if (n != null) {
+		for (let e = !1; !e;) if (e = i.type.is(n), !i.nextSibling()) return a;
+	}
+	for (;;) {
+		if (r != null && i.type.is(r)) return a;
+		if (i.type.is(t) && a.push(i.node), !i.nextSibling()) return r == null ? a : [];
+	}
+}
+function H(e, t, n = t.length - 1) {
+	for (let r = e; n >= 0; r = r.parent) {
+		if (!r) return !1;
+		if (!r.type.isAnonymous) {
+			if (t[n] && t[n] != r.name) return !1;
+			n--;
+		}
+	}
+	return !0;
+}
+var te = class {
+	constructor(e, t, n, r) {
+		this.parent = e, this.buffer = t, this.index = n, this.start = r;
+	}
+}, U = class e extends z {
+	get name() {
+		return this.type.name;
+	}
+	get from() {
+		return this.context.start + this.context.buffer.buffer[this.index + 1];
+	}
+	get to() {
+		return this.context.start + this.context.buffer.buffer[this.index + 2];
+	}
+	constructor(e, t, n) {
+		super(), this.context = e, this._parent = t, this.index = n, this.type = e.buffer.set.types[e.buffer.buffer[n]];
+	}
+	child(t, n, r) {
+		let { buffer: i } = this.context, a = i.findChild(this.index + 4, i.buffer[this.index + 3], t, n - this.context.start, r);
+		return a < 0 ? null : new e(this.context, this, a);
+	}
+	get firstChild() {
+		return this.child(1, 0, 4);
+	}
+	get lastChild() {
+		return this.child(-1, 0, 4);
+	}
+	childAfter(e) {
+		return this.child(1, e, 2);
+	}
+	childBefore(e) {
+		return this.child(-1, e, -2);
+	}
+	prop(e) {
+		return this.type.prop(e);
+	}
+	enter(t, n, r = 0) {
+		if (r & P.ExcludeBuffers) return null;
+		let { buffer: i } = this.context, a = i.findChild(this.index + 4, i.buffer[this.index + 3], n > 0 ? 1 : -1, t - this.context.start, n);
+		return a < 0 ? null : new e(this.context, this, a);
+	}
+	get parent() {
+		return this._parent || this.context.parent.nextSignificantParent();
+	}
+	externalSibling(e) {
+		return this._parent ? null : this.context.parent.nextChild(this.context.index + e, e, 0, 4);
+	}
+	get nextSibling() {
+		let { buffer: t } = this.context, n = t.buffer[this.index + 3];
+		return n < (this._parent ? t.buffer[this._parent.index + 3] : t.buffer.length) ? new e(this.context, this._parent, n) : this.externalSibling(1);
+	}
+	get prevSibling() {
+		let { buffer: t } = this.context, n = this._parent ? this._parent.index + 4 : 0;
+		return this.index == n ? this.externalSibling(-1) : new e(this.context, this._parent, t.findChild(n, this.index, -1, 0, 4));
+	}
+	get tree() {
+		return null;
+	}
+	toTree() {
+		let e = [], t = [], { buffer: n } = this.context, r = this.index + 4, i = n.buffer[this.index + 3];
+		if (i > r) {
+			let a = n.buffer[this.index + 1];
+			e.push(n.slice(r, i, a)), t.push(0);
+		}
+		return new F(this.type, e, t, this.to - this.from);
+	}
+	toString() {
+		return this.context.buffer.childString(this.index);
+	}
+};
+function ne(e) {
+	if (!e.length) return null;
+	let t = 0, n = e[0];
+	for (let r = 1; r < e.length; r++) {
+		let i = e[r];
+		(i.from > n.from || i.to < n.to) && (n = i, t = r);
+	}
+	let r = n instanceof B && n.index < 0 ? null : n.parent, i = e.slice();
+	return r ? i[t] = r : i.splice(t, 1), new re(i, n);
+}
+var re = class {
+	constructor(e, t) {
+		this.heads = e, this.node = t;
+	}
+	get next() {
+		return ne(this.heads);
+	}
+};
+function ie(e, t, n) {
+	let r = e.resolveInner(t, n), i = null;
+	for (let e = r instanceof B ? r : r.context.parent; e; e = e.parent) if (e.index < 0) {
+		let a = e.parent;
+		(i ||= [r]).push(a.resolve(t, n)), e = a;
+	} else {
+		let a = k.get(e.tree);
+		if (a && a.overlay && a.overlay[0].from <= t && a.overlay[a.overlay.length - 1].to >= t) {
+			let o = new B(a.tree, a.overlay[0].from + e.from, -1, e);
+			(i ||= [r]).push(R(o, t, n, !1));
+		}
+	}
+	return i ? ne(i) : r;
+}
+var W = class {
+	get name() {
+		return this.type.name;
+	}
+	constructor(e, t = 0) {
+		if (this.buffer = null, this.stack = [], this.index = 0, this.bufferNode = null, this.mode = t & ~P.EnterBracketed, e instanceof B) this.yieldNode(e);
+		else {
+			this._tree = e.context.parent, this.buffer = e.context;
+			for (let t = e._parent; t; t = t._parent) this.stack.unshift(t.index);
+			this.bufferNode = e, this.yieldBuf(e.index);
+		}
+	}
+	yieldNode(e) {
+		return e ? (this._tree = e, this.type = e.type, this.from = e.from, this.to = e.to, !0) : !1;
+	}
+	yieldBuf(e, t) {
+		this.index = e;
+		let { start: n, buffer: r } = this.buffer;
+		return this.type = t || r.set.types[r.buffer[e]], this.from = n + r.buffer[e + 1], this.to = n + r.buffer[e + 2], !0;
+	}
+	yield(e) {
+		return e ? e instanceof B ? (this.buffer = null, this.yieldNode(e)) : (this.buffer = e.context, this.yieldBuf(e.index, e.type)) : !1;
+	}
+	toString() {
+		return this.buffer ? this.buffer.buffer.childString(this.index) : this._tree.toString();
+	}
+	enterChild(e, t, n) {
+		if (!this.buffer) return this.yield(this._tree.nextChild(e < 0 ? this._tree._tree.children.length - 1 : 0, e, t, n, this.mode));
+		let { buffer: r } = this.buffer, i = r.findChild(this.index + 4, r.buffer[this.index + 3], e, t - this.buffer.start, n);
+		return i < 0 ? !1 : (this.stack.push(this.index), this.yieldBuf(i));
+	}
+	firstChild() {
+		return this.enterChild(1, 0, 4);
+	}
+	lastChild() {
+		return this.enterChild(-1, 0, 4);
+	}
+	childAfter(e) {
+		return this.enterChild(1, e, 2);
+	}
+	childBefore(e) {
+		return this.enterChild(-1, e, -2);
+	}
+	enter(e, t, n = this.mode) {
+		return this.buffer ? n & P.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+	}
+	parent() {
+		if (!this.buffer) return this.yieldNode(this.mode & P.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+		if (this.stack.length) return this.yieldBuf(this.stack.pop());
+		let e = this.mode & P.IncludeAnonymous ? this.buffer.parent : this.buffer.parent.nextSignificantParent();
+		return this.buffer = null, this.yieldNode(e);
+	}
+	sibling(e) {
+		if (!this.buffer) return this._tree._parent ? this.yield(this._tree.index < 0 ? null : this._tree._parent.nextChild(this._tree.index + e, e, 0, 4, this.mode)) : !1;
+		let { buffer: t } = this.buffer, n = this.stack.length - 1;
+		if (e < 0) {
+			let e = n < 0 ? 0 : this.stack[n] + 4;
+			if (this.index != e) return this.yieldBuf(t.findChild(e, this.index, -1, 0, 4));
+		} else {
+			let e = t.buffer[this.index + 3];
+			if (e < (n < 0 ? t.buffer.length : t.buffer[this.stack[n] + 3])) return this.yieldBuf(e);
+		}
+		return n < 0 ? this.yield(this.buffer.parent.nextChild(this.buffer.index + e, e, 0, 4, this.mode)) : !1;
+	}
+	nextSibling() {
+		return this.sibling(1);
+	}
+	prevSibling() {
+		return this.sibling(-1);
+	}
+	atLastNode(e) {
+		let t, n, { buffer: r } = this;
+		if (r) {
+			if (e > 0) {
+				if (this.index < r.buffer.buffer.length) return !1;
+			} else for (let e = 0; e < this.index; e++) if (r.buffer.buffer[e + 3] < this.index) return !1;
+			({index: t, parent: n} = r);
+		} else ({index: t, _parent: n} = this._tree);
+		for (; n; {index: t, _parent: n} = n) if (t > -1) for (let r = t + e, i = e < 0 ? -1 : n._tree.children.length; r != i; r += e) {
+			let e = n._tree.children[r];
+			if (this.mode & P.IncludeAnonymous || e instanceof I || !e.type.isAnonymous || G(e)) return !1;
+		}
+		return !0;
+	}
+	move(e, t) {
+		if (t && this.enterChild(e, 0, 4)) return !0;
+		for (;;) {
+			if (this.sibling(e)) return !0;
+			if (this.atLastNode(e) || !this.parent()) return !1;
+		}
+	}
+	next(e = !0) {
+		return this.move(1, e);
+	}
+	prev(e = !0) {
+		return this.move(-1, e);
+	}
+	moveTo(e, t = 0) {
+		for (; (this.from == this.to || (t < 1 ? this.from >= e : this.from > e) || (t > -1 ? this.to <= e : this.to < e)) && this.parent(););
+		for (; this.enterChild(1, e, t););
+		return this;
+	}
+	get node() {
+		if (!this.buffer) return this._tree;
+		let e = this.bufferNode, t = null, n = 0;
+		if (e && e.context == this.buffer) scan: for (let r = this.index, i = this.stack.length; i >= 0;) {
+			for (let a = e; a; a = a._parent) if (a.index == r) {
+				if (r == this.index) return a;
+				t = a, n = i + 1;
+				break scan;
+			}
+			r = this.stack[--i];
+		}
+		for (let e = n; e < this.stack.length; e++) t = new U(this.buffer, t, this.stack[e]);
+		return this.bufferNode = new U(this.buffer, t, this.index);
+	}
+	get tree() {
+		return this.buffer ? null : this._tree._tree;
+	}
+	iterate(e, t) {
+		for (let n = 0;;) {
+			let r = !1;
+			if (this.type.isAnonymous || e(this) !== !1) {
+				if (this.firstChild()) {
+					n++;
+					continue;
+				}
+				this.type.isAnonymous || (r = !0);
+			}
+			for (;;) {
+				if (r && t && t(this), r = this.type.isAnonymous, !n) return;
+				if (this.nextSibling()) break;
+				this.parent(), n--, r = !0;
+			}
+		}
+	}
+	matchContext(e) {
+		if (!this.buffer) return H(this.node.parent, e);
+		let { buffer: t } = this.buffer, { types: n } = t.set;
+		for (let r = e.length - 1, i = this.stack.length - 1; r >= 0; i--) {
+			if (i < 0) return H(this._tree, e, r);
+			let a = n[t.buffer[this.stack[i]]];
+			if (!a.isAnonymous) {
+				if (e[r] && e[r] != a.name) return !1;
+				r--;
+			}
+		}
+		return !0;
+	}
+};
+function G(e) {
+	return e.children.some((e) => e instanceof I || !e.type.isAnonymous || G(e));
+}
+function ae(e) {
+	let { buffer: t, nodeSet: n, maxBufferLength: r = E, reused: i = [], minRepeatType: a = n.types.length } = e, o = Array.isArray(t) ? new ee(t, t.length) : t, s = n.types, c = 0, l = 0;
+	function u(e, t, _, v, y, b) {
+		let { id: x, start: S, end: C, size: w } = o, T = l, E = c;
+		if (w < 0) if (o.next(), w == -1) {
+			let t = i[x];
+			_.push(t), v.push(S - e);
+			return;
+		} else if (w == -3) {
+			c = x;
+			return;
+		} else if (w == -4) {
+			l = x;
+			return;
+		} else throw RangeError(`Unrecognized record size: ${w}`);
+		let D = s[x], O, k, A = S - e;
+		if (C - S <= r && (k = h(o.pos - t, y))) {
+			let t = new Uint16Array(k.size - k.skip), r = o.pos - k.size, i = t.length;
+			for (; o.pos > r;) i = g(k.start, t, i);
+			O = new I(t, C - k.start, n), A = k.start - e;
+		} else {
+			let e = o.pos - w;
+			o.next();
+			let t = [], n = [], i = x >= a ? x : -1, s = 0, c = C;
+			for (; o.pos > e;) i >= 0 && o.id == i && o.size >= 0 ? (o.end <= c - r && (p(t, n, S, s, o.end, c, i, T, E), s = t.length, c = o.end), o.next()) : b > 2500 ? d(S, e, t, n) : u(S, e, t, n, i, b + 1);
+			if (i >= 0 && s > 0 && s < t.length && p(t, n, S, s, S, c, i, T, E), t.reverse(), n.reverse(), i > -1 && s > 0) {
+				let e = f(D, E);
+				O = J(D, t, n, 0, t.length, 0, C - S, e, e);
+			} else O = m(D, t, n, C - S, T - C, E);
+		}
+		_.push(O), v.push(A);
+	}
+	function d(e, t, i, a) {
+		let s = [], c = 0, l = -1;
+		for (; o.pos > t;) {
+			let { id: e, start: t, end: n, size: i } = o;
+			if (i > 4) o.next();
+			else if (l > -1 && t < l) break;
+			else l < 0 && (l = n - r), s.push(e, t, n), c++, o.next();
+		}
+		if (c) {
+			let t = new Uint16Array(c * 4), r = s[s.length - 2];
+			for (let e = s.length - 3, n = 0; e >= 0; e -= 3) t[n++] = s[e], t[n++] = s[e + 1] - r, t[n++] = s[e + 2] - r, t[n++] = n;
+			i.push(new I(t, s[2] - r, n)), a.push(r - e);
+		}
+	}
+	function f(e, t) {
+		return (n, r, i) => {
+			let a = 0, o = n.length - 1, s, c;
+			if (o >= 0 && (s = n[o]) instanceof F) {
+				if (!o && s.type == e && s.length == i) return s;
+				(c = s.prop(O.lookAhead)) && (a = r[o] + s.length + c);
+			}
+			return m(e, n, r, i, a, t);
+		};
+	}
+	function p(e, t, r, i, a, o, s, c, l) {
+		let u = [], d = [];
+		for (; e.length > i;) u.push(e.pop()), d.push(t.pop() + r - a);
+		e.push(m(n.types[s], u, d, o - a, c - o, l)), t.push(a - r);
+	}
+	function m(e, t, n, r, i, a, o) {
+		if (a) {
+			let e = [O.contextHash, a];
+			o = o ? [e].concat(o) : [e];
+		}
+		if (i > 25) {
+			let e = [O.lookAhead, i];
+			o = o ? [e].concat(o) : [e];
+		}
+		return new F(e, t, n, r, o);
+	}
+	function h(e, t) {
+		let n = o.fork(), i = 0, s = 0, c = 0, l = n.end - r, u = {
+			size: 0,
+			start: 0,
+			skip: 0
+		};
+		scan: for (let r = n.pos - e; n.pos > r;) {
+			let e = n.size;
+			if (n.id == t && e >= 0) {
+				u.size = i, u.start = s, u.skip = c, c += 4, i += 4, n.next();
+				continue;
+			}
+			let o = n.pos - e;
+			if (e < 0 || o < r || n.start < l) break;
+			let d = n.id >= a ? 4 : 0, f = n.start;
+			for (n.next(); n.pos > o;) {
+				if (n.size < 0) if (n.size == -3 || n.size == -4) d += 4;
+				else break scan;
+				else n.id >= a && (d += 4);
+				n.next();
+			}
+			s = f, i += e, c += d;
+		}
+		return (t < 0 || i == e) && (u.size = i, u.start = s, u.skip = c), u.size > 4 ? u : void 0;
+	}
+	function g(e, t, n) {
+		let { id: r, start: i, end: s, size: u } = o;
+		if (o.next(), u >= 0 && r < a) {
+			let a = n;
+			if (u > 4) {
+				let r = o.pos - (u - 4);
+				for (; o.pos > r;) n = g(e, t, n);
+			}
+			t[--n] = a, t[--n] = s - e, t[--n] = i - e, t[--n] = r;
+		} else u == -3 ? c = r : u == -4 && (l = r);
+		return n;
+	}
+	let _ = [], v = [];
+	for (; o.pos > 0;) u(e.start || 0, e.bufferStart || 0, _, v, -1, 0);
+	let y = e.length ?? (_.length ? v[0] + _[0].length : 0);
+	return new F(s[e.topID], _.reverse(), v.reverse(), y);
+}
+var K = /* @__PURE__ */ new WeakMap();
+function q(e, t) {
+	if (!e.isAnonymous || t instanceof I || t.type != e) return 1;
+	let n = K.get(t);
+	if (n == null) {
+		n = 1;
+		for (let r of t.children) {
+			if (r.type != e || !(r instanceof F)) {
+				n = 1;
+				break;
+			}
+			n += q(e, r);
+		}
+		K.set(t, n);
+	}
+	return n;
+}
+function J(e, t, n, r, i, a, o, s, c) {
+	let l = 0;
+	for (let n = r; n < i; n++) l += q(e, t[n]);
+	let u = Math.ceil(l * 1.5 / 8), d = [], f = [];
+	function p(t, n, r, i, o) {
+		for (let s = r; s < i;) {
+			let r = s, l = n[s], m = q(e, t[s]);
+			for (s++; s < i; s++) {
+				let n = q(e, t[s]);
+				if (m + n >= u) break;
+				m += n;
+			}
+			if (s == r + 1) {
+				if (m > u) {
+					let e = t[r];
+					p(e.children, e.positions, 0, e.children.length, n[r] + o);
+					continue;
+				}
+				d.push(t[r]);
+			} else {
+				let i = n[s - 1] + t[s - 1].length - l;
+				d.push(J(e, t, n, r, s, l, i, null, c));
+			}
+			f.push(l + o - a);
+		}
+	}
+	return p(t, n, r, i, 0), (s || c)(d, f, o);
+}
+new O({ perNode: !0 });
+//#endregion
+//#region node_modules/@codemirror/commands/dist/index.js
+var Y = /* @__PURE__ */ a.define(), oe = /* @__PURE__ */ u.define(), X = class e {
+	constructor(e, t, n, r, i) {
+		this.changes = e, this.effects = t, this.mapped = n, this.startSelection = r, this.selectionsAfter = i;
+	}
+	setSelAfter(t) {
+		return new e(this.changes, this.effects, this.mapped, this.startSelection, t);
+	}
+	toJSON() {
+		return {
+			changes: this.changes?.toJSON(),
+			mapped: this.mapped?.toJSON(),
+			startSelection: this.startSelection?.toJSON(),
+			selectionsAfter: this.selectionsAfter.map((e) => e.toJSON())
+		};
+	}
+	static fromJSON(t) {
+		return new e(t.changes && s.fromJSON(t.changes), [], t.mapped && o.fromJSON(t.mapped), t.startSelection && c.fromJSON(t.startSelection), t.selectionsAfter.map(c.fromJSON));
+	}
+	static fromTransaction(t, n) {
+		let r = Q;
+		for (let e of t.startState.facet(oe)) {
+			let n = e(t);
+			n.length && (r = r.concat(n));
+		}
+		return !r.length && t.changes.empty ? null : new e(t.changes.invert(t.startState.doc), r, void 0, n || t.startState.selection, Q);
+	}
+	static selection(t) {
+		return new e(void 0, Q, void 0, void 0, t);
+	}
+};
+function Z(e, t, n, r) {
+	let i = t + 1 > n + 20 ? t - n - 1 : 0, a = e.slice(i, t);
+	return a.push(r), a;
+}
+function se(e, t) {
+	let n = [], r = !1;
+	return e.iterChangedRanges((e, t) => n.push(e, t)), t.iterChangedRanges((e, t, i, a) => {
+		for (let e = 0; e < n.length;) {
+			let t = n[e++], o = n[e++];
+			a >= t && i <= o && (r = !0);
+		}
+	}), r;
+}
+function ce(e, t) {
+	return e.ranges.length == t.ranges.length && e.ranges.filter((e, n) => e.empty != t.ranges[n].empty).length === 0;
+}
+function le(e, t) {
+	return e.length ? t.length ? e.concat(t) : e : t;
+}
+var Q = [], ue = 200;
+function de(e, t) {
+	if (e.length) {
+		let n = e[e.length - 1], r = n.selectionsAfter.slice(Math.max(0, n.selectionsAfter.length - ue));
+		return r.length && r[r.length - 1].eq(t) ? e : (r.push(t), Z(e, e.length - 1, 1e9, n.setSelAfter(r)));
+	} else return [X.selection([t])];
+}
+function fe(e) {
+	let t = e[e.length - 1], n = e.slice();
+	return n[e.length - 1] = t.setSelAfter(t.selectionsAfter.slice(0, t.selectionsAfter.length - 1)), n;
 }
-s.closedBy = new s({ deserialize: (t) => t.split(" ") });
-s.openedBy = new s({ deserialize: (t) => t.split(" ") });
-s.group = new s({ deserialize: (t) => t.split(" ") });
-s.isolate = new s({ deserialize: (t) => {
-  if (t && t != "rtl" && t != "ltr" && t != "auto")
-    throw new RangeError("Invalid value for isolate: " + t);
-  return t || "auto";
-} });
-s.contextHash = new s({ perNode: !0 });
-s.lookAhead = new s({ perNode: !0 });
-s.mounted = new s({ perNode: !0 });
-const T = /* @__PURE__ */ Object.create(null);
-class p {
-  /**
-  @internal
-  */
-  constructor(e, o, i, n = 0) {
-    this.name = e, this.props = o, this.id = i, this.flags = n;
-  }
-  /**
-  Define a node type.
-  */
-  static define(e) {
-    let o = e.props && e.props.length ? /* @__PURE__ */ Object.create(null) : T, i = (e.top ? 1 : 0) | (e.skipped ? 2 : 0) | (e.error ? 4 : 0) | (e.name == null ? 8 : 0), n = new p(e.name || "", o, e.id, i);
-    if (e.props) {
-      for (let r of e.props)
-        if (Array.isArray(r) || (r = r(n)), r) {
-          if (r[0].perNode)
-            throw new RangeError("Can't store a per-node prop on a node type");
-          o[r[0].id] = r[1];
-        }
-    }
-    return n;
-  }
-  /**
-  Retrieves a node prop for this type. Will return `undefined` if
-  the prop isn't present on this node.
-  */
-  prop(e) {
-    return this.props[e.id];
-  }
-  /**
-  True when this is the top node of a grammar.
-  */
-  get isTop() {
-    return (this.flags & 1) > 0;
-  }
-  /**
-  True when this node is produced by a skip rule.
-  */
-  get isSkipped() {
-    return (this.flags & 2) > 0;
-  }
-  /**
-  Indicates whether this is an error node.
-  */
-  get isError() {
-    return (this.flags & 4) > 0;
-  }
-  /**
-  When true, this node type doesn't correspond to a user-declared
-  named node, for example because it is used to cache repetition.
-  */
-  get isAnonymous() {
-    return (this.flags & 8) > 0;
-  }
-  /**
-  Returns true when this node's name or one of its
-  [groups](#common.NodeProp^group) matches the given string.
-  */
-  is(e) {
-    if (typeof e == "string") {
-      if (this.name == e)
-        return !0;
-      let o = this.prop(s.group);
-      return o ? o.indexOf(e) > -1 : !1;
-    }
-    return this.id == e;
-  }
-  /**
-  Create a function from node types to arbitrary values by
-  specifying an object whose property names are node or
-  [group](#common.NodeProp^group) names. Often useful with
-  [`NodeProp.add`](#common.NodeProp.add). You can put multiple
-  names, separated by spaces, in a single property name to map
-  multiple node names to a single value.
-  */
-  static match(e) {
-    let o = /* @__PURE__ */ Object.create(null);
-    for (let i in e)
-      for (let n of i.split(" "))
-        o[n] = e[i];
-    return (i) => {
-      for (let n = i.prop(s.group), r = -1; r < (n ? n.length : 0); r++) {
-        let a = o[r < 0 ? i.name : n[r]];
-        if (a)
-          return a;
-      }
-    };
-  }
+function $(e, t) {
+	if (!e.length) return e;
+	let n = e.length, r = Q;
+	for (; n;) {
+		let i = pe(e[n - 1], t, r);
+		if (i.changes && !i.changes.empty || i.effects.length) {
+			let t = e.slice(0, n);
+			return t[n - 1] = i, t;
+		} else t = i.mapped, n--, r = i.selectionsAfter;
+	}
+	return r.length ? [X.selection(r)] : Q;
 }
-p.none = new p(
-  "",
-  /* @__PURE__ */ Object.create(null),
-  0,
-  8
-  /* NodeFlag.Anonymous */
-);
-var h;
-(function(t) {
-  t[t.ExcludeBuffers = 1] = "ExcludeBuffers", t[t.IncludeAnonymous = 2] = "IncludeAnonymous", t[t.IgnoreMounts = 4] = "IgnoreMounts", t[t.IgnoreOverlays = 8] = "IgnoreOverlays", t[t.EnterBracketed = 16] = "EnterBracketed";
-})(h || (h = {}));
-new s({ perNode: !0 });
-function q(t, e) {
-  let o = -1;
-  return t.changeByRange((i) => {
-    let n = [];
-    for (let a = i.from; a <= i.to; ) {
-      let l = t.doc.lineAt(a);
-      l.number > o && (i.empty || i.to > l.from) && (e(l, n, i), o = l.number), a = l.to + 1;
-    }
-    let r = t.changes(n);
-    return {
-      changes: n,
-      range: E.range(r.mapPos(i.anchor, 1), r.mapPos(i.head, 1))
-    };
-  });
+function pe(e, t, n) {
+	let r = le(e.selectionsAfter.length ? e.selectionsAfter.map((e) => e.map(t)) : Q, n);
+	if (!e.changes) return X.selection(r);
+	let i = e.changes.map(t), a = t.mapDesc(e.changes, !0), o = e.mapped ? e.mapped.composeDesc(a) : a;
+	return new X(i, d.mapEffects(e.effects, t), o, e.startSelection.map(a), r);
 }
-const H = ({ state: t, dispatch: e }) => {
-  if (t.readOnly)
-    return !1;
-  let o = /* @__PURE__ */ Object.create(null), i = new b(t, { overrideIndentation: (r) => {
-    let a = o[r];
-    return a ?? -1;
-  } }), n = q(t, (r, a, l) => {
-    let d = v(i, r.from);
-    if (d == null)
-      return;
-    /\S/.test(r.text) || (d = 0);
-    let u = /^\s*/.exec(r.text)[0], c = C(t, d);
-    (u != c || l.from < r.from + u.length) && (o[r.from] = d, a.push({ from: r.from, to: r.from + u.length, insert: c }));
-  });
-  return n.changes.empty || e(t.update(n, { userEvent: "indent" })), !0;
+var me = /^(input\.type|delete)($|\.)/, he = class e {
+	constructor(e, t, n = 0, r = void 0) {
+		this.done = e, this.undone = t, this.prevTime = n, this.prevUserEvent = r;
+	}
+	isolate() {
+		return this.prevTime ? new e(this.done, this.undone) : this;
+	}
+	addChanges(t, n, r, i, a) {
+		let o = this.done, s = o[o.length - 1];
+		return o = s && s.changes && !s.changes.empty && t.changes && (!r || me.test(r)) && (!s.selectionsAfter.length && n - this.prevTime < i.newGroupDelay && i.joinToEvent(a, se(s.changes, t.changes)) || r == "input.type.compose") ? Z(o, o.length - 1, i.minDepth, new X(t.changes.compose(s.changes), le(d.mapEffects(t.effects, s.changes), s.effects), s.mapped, s.startSelection, Q)) : Z(o, o.length, i.minDepth, t), new e(o, Q, n, r);
+	}
+	addSelection(t, n, r, i) {
+		let a = this.done.length ? this.done[this.done.length - 1].selectionsAfter : Q;
+		return a.length > 0 && n - this.prevTime < i && r == this.prevUserEvent && r && /^select($|\.)/.test(r) && ce(a[a.length - 1], t) ? this : new e(de(this.done, t), this.undone, n, r);
+	}
+	addMapping(t) {
+		return new e($(this.done, t), $(this.undone, t), this.prevTime, this.prevUserEvent);
+	}
+	pop(e, t, n) {
+		let r = e == 0 ? this.done : this.undone;
+		if (r.length == 0) return null;
+		let i = r[r.length - 1], a = i.selectionsAfter[0] || (i.startSelection ? i.startSelection.map(i.changes.invertedDesc, 1) : t.selection);
+		if (n && i.selectionsAfter.length) return t.update({
+			selection: i.selectionsAfter[i.selectionsAfter.length - 1],
+			annotations: Y.of({
+				side: e,
+				rest: fe(r),
+				selection: a
+			}),
+			userEvent: e == 0 ? "select.undo" : "select.redo",
+			scrollIntoView: !0
+		});
+		if (i.changes) {
+			let n = r.length == 1 ? Q : r.slice(0, r.length - 1);
+			return i.mapped && (n = $(n, i.mapped)), t.update({
+				changes: i.changes,
+				selection: i.startSelection,
+				effects: i.effects,
+				annotations: Y.of({
+					side: e,
+					rest: n,
+					selection: a
+				}),
+				filter: !1,
+				userEvent: e == 0 ? "undo" : "redo",
+				scrollIntoView: !0
+			});
+		} else return null;
+	}
 };
-class Y extends g {
-  constructor() {
-    super(...arguments), this.view = null;
-  }
-  static get pluginName() {
-    return "SourceEditingCodeMirror";
-  }
-  static get requires() {
-    return ["SourceEditing"];
-  }
-  // Prettier 3 formatter
-  async formatWithPrettier(e) {
-    return await B.format(e, {
-      parser: "html",
-      plugins: [
-        P,
-        z,
-        D,
-        L,
-        j
-      ],
-      tabWidth: 4,
-      useTabs: !1
-    });
-  }
-  // Listen to SourceEditing mode changes
-  afterInit() {
-    const o = this.editor.plugins.get("SourceEditing");
-    this.listenTo(o, "change:isSourceEditingMode", async (i, n, r) => {
-      r ? await this.enableCodeMirror() : this.disableCodeMirror();
-    });
-  }
-  // Enable CodeMirror with Prettier formatting
-  async enableCodeMirror() {
-    const e = this.editor;
-    e.plugins.get("SourceEditing").updateEditorData();
-    const i = await this.formatWithPrettier(e.getData()), n = document.querySelector(".ck-source-editing-area");
-    if (!n)
-      return;
-    const r = n.querySelector("textarea");
-    r && (r.style.display = "none");
-    const a = document.createElement("div");
-    a.classList.add("cm-wrapper"), n.appendChild(a);
-    const l = [
-      m(),
-      w(),
-      y(),
-      N(O),
-      A(),
-      k.of("    ")
-    ], u = e.config.get("sourceEditingCodeMirror")?.extensions ?? [];
-    this.view = new f({
-      state: x.create({
-        doc: i,
-        extensions: [
-          ...l,
-          S(),
-          ...u,
-          f.updateListener.of((c) => {
-            c.docChanged && e.setData(c.state.doc.toString());
-          })
-        ]
-      }),
-      parent: a
-    }), this.view.dispatch({
-      selection: { anchor: 0, head: this.view.state.doc.length }
-    }), H(this.view);
-  }
-  // Disable CodeMirror and show original textarea
-  disableCodeMirror() {
-    this.view && (this.view.destroy(), this.view = null);
-    const e = document.querySelector(".ck-source-editing-area textarea");
-    e && (e.style.display = "");
-  }
+he.empty = /* @__PURE__ */ new he(Q, Q), typeof Intl < "u" && Intl.Segmenter;
+function ge(e, t) {
+	let n = -1;
+	return e.changeByRange((r) => {
+		let i = [];
+		for (let a = r.from; a <= r.to;) {
+			let o = e.doc.lineAt(a);
+			o.number > n && (r.empty || r.to > o.from) && (t(o, i, r), n = o.number), a = o.to + 1;
+		}
+		let a = e.changes(i);
+		return {
+			changes: i,
+			range: c.range(a.mapPos(r.anchor, 1), a.mapPos(r.head, 1))
+		};
+	});
 }
-export {
-  Y as default
+var _e = ({ state: e, dispatch: t }) => {
+	if (e.readOnly) return !1;
+	let n = Object.create(null), r = new p(e, { overrideIndentation: (e) => n[e] ?? -1 }), i = ge(e, (t, i, a) => {
+		let o = h(r, t.from);
+		if (o == null) return;
+		/\S/.test(t.text) || (o = 0);
+		let s = /^\s*/.exec(t.text)[0], c = _(e, o);
+		(s != c || a.from < t.from + s.length) && (n[t.from] = o, i.push({
+			from: t.from,
+			to: t.from + s.length,
+			insert: c
+		}));
+	});
+	return i.changes.empty || t(e.update(i, { userEvent: "indent" })), !0;
+}, ve = class extends e {
+	constructor() {
+		super(...arguments), this.view = null;
+	}
+	static get pluginName() {
+		return "SourceEditingCodeMirror";
+	}
+	static get requires() {
+		return ["SourceEditing"];
+	}
+	async formatWithPrettier(e) {
+		return await b.format(e, {
+			parser: "html",
+			plugins: [
+				x,
+				S,
+				C,
+				w,
+				T
+			],
+			tabWidth: 4,
+			useTabs: !1
+		});
+	}
+	afterInit() {
+		let e = this.editor.plugins.get("SourceEditing");
+		this.listenTo(e, "change:isSourceEditingMode", async (e, t, n) => {
+			n ? await this.enableCodeMirror() : this.disableCodeMirror();
+		});
+	}
+	async enableCodeMirror() {
+		let e = this.editor;
+		e.plugins.get("SourceEditing").updateEditorData();
+		let a = await this.formatWithPrettier(e.getData()), o = document.querySelector(".ck-source-editing-area");
+		if (!o) return;
+		let s = o.querySelector("textarea");
+		s && (s.style.display = "none");
+		let c = document.createElement("div");
+		c.classList.add("cm-wrapper"), o.appendChild(c);
+		let u = [
+			i(),
+			n(),
+			r(),
+			y(m),
+			g(),
+			v.of("    ")
+		], d = e.config.get("sourceEditingCodeMirror")?.extensions ?? [];
+		this.view = new t({
+			state: l.create({
+				doc: a,
+				extensions: [
+					...u,
+					f(),
+					...d,
+					t.updateListener.of((t) => {
+						t.docChanged && e.setData(t.state.doc.toString());
+					})
+				]
+			}),
+			parent: c
+		}), this.view.dispatch({ selection: {
+			anchor: 0,
+			head: this.view.state.doc.length
+		} }), _e(this.view);
+	}
+	disableCodeMirror() {
+		this.view &&= (this.view.destroy(), null);
+		let e = document.querySelector(".ck-source-editing-area textarea");
+		e && (e.style.display = "");
+	}
 };
+//#endregion
+export { ve as default };