@oomol-lab/open-flow 0.1.0-alpha.0

package/dist/browser/dist-zyY--HOV.js

@@ -0,0 +1,1543 @@
+import { r as e } from "./rolldown-runtime-CEFd7nDs.js";
+//#region ../../node_modules/@lezer/common/dist/index.js
+var t = 1024, n = 0, r = class {
+	constructor(e, t) {
+		this.from = e, this.to = t;
+	}
+}, i = class {
+	constructor(e = {}) {
+		this.id = n++, 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 = s.match(e)), (t) => {
+			let n = e(t);
+			return n === void 0 ? null : [this, n];
+		};
+	}
+};
+i.closedBy = new i({ deserialize: (e) => e.split(" ") }), i.openedBy = new i({ deserialize: (e) => e.split(" ") }), i.group = new i({ deserialize: (e) => e.split(" ") }), i.isolate = new i({ deserialize: (e) => {
+	if (e && e != "rtl" && e != "ltr" && e != "auto") throw RangeError("Invalid value for isolate: " + e);
+	return e || "auto";
+} }), i.contextHash = new i({ perNode: !0 }), i.lookAhead = new i({ perNode: !0 }), i.mounted = new i({ perNode: !0 });
+var a = 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[i.mounted.id];
+	}
+}, o = Object.create(null), s = 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) : o, 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(i.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(i.group), r = -1; r < (n ? n.length : 0); r++) {
+				let i = t[r < 0 ? e.name : n[r]];
+				if (i) return i;
+			}
+		};
+	}
+};
+s.none = new s("", Object.create(null), 0, 8);
+var c = class e {
+	constructor(e) {
+		this.types = e;
+		for (let t = 0; t < e.length; t++) if (e[t].id != t) throw RangeError("Node type ids should correspond to array positions when creating a node set");
+	}
+	extend(...t) {
+		let n = [];
+		for (let e of this.types) {
+			let r = null;
+			for (let n of t) {
+				let t = n(e);
+				if (t) {
+					r ||= Object.assign({}, e.props);
+					let n = t[1], i = t[0];
+					i.combine && i.id in r && (n = i.combine(r[i.id], n)), r[i.id] = n;
+				}
+			}
+			n.push(r ? new s(e.name, r, e.id, e.flags) : e);
+		}
+		return new e(n);
+	}
+}, l = /* @__PURE__ */ new WeakMap(), u = /* @__PURE__ */ new WeakMap(), d;
+(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";
+})(d ||= {});
+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 = a.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 E(this.topNode, e);
+	}
+	cursorAt(e, t = 0, n = 0) {
+		let r = new E(l.get(this) || this.topNode);
+		return r.moveTo(e, t), l.set(this, r._tree), r;
+	}
+	get topNode() {
+		return new v(this, 0, 0, null);
+	}
+	resolve(e, t = 0) {
+		let n = g(l.get(this) || this.topNode, e, t, !1);
+		return l.set(this, n), n;
+	}
+	resolveInner(e, t = 0) {
+		let n = g(u.get(this) || this.topNode, e, t, !0);
+		return u.set(this, n), n;
+	}
+	resolveStack(e, t = 0) {
+		return T(this, e, t);
+	}
+	iterate(e) {
+		let { enter: t, leave: n, from: r = 0, to: i = this.length } = e, a = e.mode || 0, o = (a & d.IncludeAnonymous) > 0;
+		for (let e = this.cursor(a | d.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(s.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(s.none, t, n, r)));
+	}
+	static build(e) {
+		return O(e);
+	}
+};
+f.empty = new f(s.none, [], [], 0);
+var p = 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);
+	}
+}, m = class e {
+	constructor(e, t, n) {
+		this.buffer = e, this.length = t, this.set = n;
+	}
+	get type() {
+		return s.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 && !(h(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 h(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 g(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 v && e.index < 0 ? null : e.parent;
+		if (!t) return e;
+		e = t;
+	}
+	let i = r ? 0 : d.IgnoreOverlays;
+	if (r) for (let r = e, a = r.parent; a; r = a, a = r.parent) r instanceof v && 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 _ = class {
+	cursor(e = 0) {
+		return new E(this, e);
+	}
+	getChild(e, t = null, n = null) {
+		let r = y(this, e, t, n);
+		return r.length ? r[0] : null;
+	}
+	getChildren(e, t = null, n = null) {
+		return y(this, e, t, n);
+	}
+	resolve(e, t = 0) {
+		return g(this, e, t, !1);
+	}
+	resolveInner(e, t = 0) {
+		return g(this, e, t, !0);
+	}
+	matchContext(e) {
+		return b(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;
+	}
+}, v = class e extends _ {
+	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, o = 0) {
+		for (let s = this;;) {
+			for (let { children: c, positions: l } = s._tree, u = n > 0 ? c.length : -1; t != u; t += n) {
+				let u = c[t], p = l[t] + s.from, g;
+				if (!(!(o & d.EnterBracketed && u instanceof f && (g = a.get(u)) && !g.overlay && g.bracketed && r >= p && r <= p + u.length) && !h(i, r, p, p + u.length))) {
+					if (u instanceof m) {
+						if (o & d.ExcludeBuffers) continue;
+						let e = u.findChild(0, u.buffer.length, n, r - p, i);
+						if (e > -1) return new S(new x(s, u, t, p), null, e);
+					} else if (o & d.IncludeAnonymous || !u.type.isAnonymous || D(u)) {
+						let c;
+						if (!(o & d.IgnoreMounts) && (c = a.get(u)) && !c.overlay) return new e(c.tree, p, t, s);
+						let l = new e(u, p, t, s);
+						return o & d.IncludeAnonymous || !l.type.isAnonymous ? l : l.nextChild(n < 0 ? u.children.length - 1 : 0, n, r, i, o);
+					}
+				}
+			}
+			if (o & d.IncludeAnonymous || !s.type.isAnonymous || (t = s.index >= 0 ? s.index + n : n < 0 ? -1 : s._parent._tree.children.length, s = s._parent, !s)) 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 & d.IgnoreOverlays) && (i = a.get(this._tree)) && i.overlay) {
+			let a = t - this.from, o = r & d.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 y(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 b(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 x = class {
+	constructor(e, t, n, r) {
+		this.parent = e, this.buffer = t, this.index = n, this.start = r;
+	}
+}, S = class e extends _ {
+	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 & d.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 C(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 v && n.index < 0 ? null : n.parent, i = e.slice();
+	return r ? i[t] = r : i.splice(t, 1), new w(i, n);
+}
+var w = class {
+	constructor(e, t) {
+		this.heads = e, this.node = t;
+	}
+	get next() {
+		return C(this.heads);
+	}
+};
+function T(e, t, n) {
+	let r = e.resolveInner(t, n), i = null;
+	for (let e = r instanceof v ? 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 o = a.get(e.tree);
+		if (o && o.overlay && o.overlay[0].from <= t && o.overlay[o.overlay.length - 1].to >= t) {
+			let a = new v(o.tree, o.overlay[0].from + e.from, -1, e);
+			(i ||= [r]).push(g(a, t, n, !1));
+		}
+	}
+	return i ? C(i) : r;
+}
+var E = 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 & ~d.EnterBracketed, e instanceof v) 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 v ? (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 & d.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+	}
+	parent() {
+		if (!this.buffer) return this.yieldNode(this.mode & d.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+		if (this.stack.length) return this.yieldBuf(this.stack.pop());
+		let e = this.mode & d.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));
+	}
+	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 & d.IncludeAnonymous || e instanceof m || !e.type.isAnonymous || D(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 S(this.buffer, t, this.stack[e]);
+		return this.bufferNode = new S(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 b(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 b(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 D(e) {
+	return e.children.some((e) => e instanceof m || !e.type.isAnonymous || D(e));
+}
+function O(e) {
+	let { buffer: n, nodeSet: r, maxBufferLength: a = t, reused: o = [], minRepeatType: s = r.types.length } = e, c = Array.isArray(n) ? new p(n, n.length) : n, l = r.types, u = 0, d = 0;
+	function h(e, t, n, i, f, p) {
+		let { id: S, start: C, end: w, size: T } = c, E = d, D = u;
+		if (T < 0) {
+			if (c.next(), T == -1) {
+				let t = o[S];
+				n.push(t), i.push(C - e);
+				return;
+			}
+			if (T == -3) {
+				u = S;
+				return;
+			}
+			if (T == -4) {
+				d = S;
+				return;
+			}
+			throw RangeError(`Unrecognized record size: ${T}`);
+		}
+		let O = l[S], k, A, M = C - e;
+		if (w - C <= a && (A = b(c.pos - t, f))) {
+			let t = new Uint16Array(A.size - A.skip), n = c.pos - A.size, i = t.length;
+			for (; c.pos > n;) i = x(A.start, t, i);
+			k = new m(t, w - A.start, r), M = A.start - e;
+		} else {
+			let e = c.pos - T;
+			c.next();
+			let t = [], n = [], r = S >= s ? S : -1, i = 0, o = w;
+			for (; c.pos > e;) r >= 0 && c.id == r && c.size >= 0 ? (c.end <= o - a && (v(t, n, C, i, c.end, o, r, E, D), i = t.length, o = c.end), c.next()) : p > 2500 ? g(C, e, t, n) : h(C, e, t, n, r, p + 1);
+			if (r >= 0 && i > 0 && i < t.length && v(t, n, C, i, C, o, r, E, D), t.reverse(), n.reverse(), r > -1 && i > 0) {
+				let e = _(O, D);
+				k = j(O, t, n, 0, t.length, 0, w - C, e, e);
+			} else k = y(O, t, n, w - C, E - w, D);
+		}
+		n.push(k), i.push(M);
+	}
+	function g(e, t, n, i) {
+		let o = [], s = 0, l = -1;
+		for (; c.pos > t;) {
+			let { id: e, start: t, end: n, size: r } = c;
+			if (r > 4) c.next();
+			else if (l > -1 && t < l) break;
+			else l < 0 && (l = n - a), o.push(e, t, n), s++, c.next();
+		}
+		if (s) {
+			let t = new Uint16Array(s * 4), a = o[o.length - 2];
+			for (let e = o.length - 3, n = 0; e >= 0; e -= 3) t[n++] = o[e], t[n++] = o[e + 1] - a, t[n++] = o[e + 2] - a, t[n++] = n;
+			n.push(new m(t, o[2] - a, r)), i.push(a - e);
+		}
+	}
+	function _(e, t) {
+		return (n, r, a) => {
+			let o = 0, s = n.length - 1, c, l;
+			if (s >= 0 && (c = n[s]) instanceof f) {
+				if (!s && c.type == e && c.length == a) return c;
+				(l = c.prop(i.lookAhead)) && (o = r[s] + c.length + l);
+			}
+			return y(e, n, r, a, o, t);
+		};
+	}
+	function v(e, t, n, i, a, o, s, c, l) {
+		let u = [], d = [];
+		for (; e.length > i;) u.push(e.pop()), d.push(t.pop() + n - a);
+		e.push(y(r.types[s], u, d, o - a, c - o, l)), t.push(a - n);
+	}
+	function y(e, t, n, r, a, o, s) {
+		if (o) {
+			let e = [i.contextHash, o];
+			s = s ? [e].concat(s) : [e];
+		}
+		if (a > 25) {
+			let e = [i.lookAhead, a];
+			s = s ? [e].concat(s) : [e];
+		}
+		return new f(e, t, n, r, s);
+	}
+	function b(e, t) {
+		let n = c.fork(), r = 0, i = 0, o = 0, l = n.end - a, u = {
+			size: 0,
+			start: 0,
+			skip: 0
+		};
+		scan: for (let a = n.pos - e; n.pos > a;) {
+			let e = n.size;
+			if (n.id == t && e >= 0) {
+				u.size = r, u.start = i, u.skip = o, o += 4, r += 4, n.next();
+				continue;
+			}
+			let c = n.pos - e;
+			if (e < 0 || c < a || n.start < l) break;
+			let d = n.id >= s ? 4 : 0, f = n.start;
+			for (n.next(); n.pos > c;) {
+				if (n.size < 0) {
+					if (n.size == -3 || n.size == -4) d += 4;
+					else break scan;
+				} else n.id >= s && (d += 4);
+				n.next();
+			}
+			i = f, r += e, o += d;
+		}
+		return (t < 0 || r == e) && (u.size = r, u.start = i, u.skip = o), u.size > 4 ? u : void 0;
+	}
+	function x(e, t, n) {
+		let { id: r, start: i, end: a, size: o } = c;
+		if (c.next(), o >= 0 && r < s) {
+			let s = n;
+			if (o > 4) {
+				let r = c.pos - (o - 4);
+				for (; c.pos > r;) n = x(e, t, n);
+			}
+			t[--n] = s, t[--n] = a - e, t[--n] = i - e, t[--n] = r;
+		} else o == -3 ? u = r : o == -4 && (d = r);
+		return n;
+	}
+	let S = [], C = [];
+	for (; c.pos > 0;) h(e.start || 0, e.bufferStart || 0, S, C, -1, 0);
+	let w = e.length ?? (S.length ? C[0] + S[0].length : 0);
+	return new f(l[e.topID], S.reverse(), C.reverse(), w);
+}
+var k = /* @__PURE__ */ new WeakMap();
+function A(e, t) {
+	if (!e.isAnonymous || t instanceof m || 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 += A(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 += A(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 = A(e, t[s]);
+			for (s++; s < i; s++) {
+				let n = A(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);
+}
+var M = class {
+	constructor() {
+		this.map = /* @__PURE__ */ new WeakMap();
+	}
+	setBuffer(e, t, n) {
+		let r = this.map.get(e);
+		r || this.map.set(e, r = /* @__PURE__ */ new Map()), r.set(t, n);
+	}
+	getBuffer(e, t) {
+		let n = this.map.get(e);
+		return n && n.get(t);
+	}
+	set(e, t) {
+		e instanceof S ? this.setBuffer(e.context.buffer, e.index, t) : e instanceof v && this.map.set(e.tree, t);
+	}
+	get(e) {
+		return e instanceof S ? this.getBuffer(e.context.buffer, e.index) : e instanceof v ? this.map.get(e.tree) : void 0;
+	}
+	cursorSet(e, t) {
+		e.buffer ? this.setBuffer(e.buffer.buffer, e.index, t) : this.map.set(e.tree, t);
+	}
+	cursorGet(e) {
+		return e.buffer ? this.getBuffer(e.buffer.buffer, e.index) : this.map.get(e.tree);
+	}
+}, N = class e {
+	constructor(e, t, n, r, i = !1, a = !1) {
+		this.from = e, this.to = t, this.tree = n, this.offset = r, this.open = !!i | (a ? 2 : 0);
+	}
+	get openStart() {
+		return (this.open & 1) > 0;
+	}
+	get openEnd() {
+		return (this.open & 2) > 0;
+	}
+	static addTree(t, n = [], r = !1) {
+		let i = [new e(0, t.length, t, 0, !1, r)];
+		for (let e of n) e.to > t.length && i.push(e);
+		return i;
+	}
+	static applyChanges(t, n, r = 128) {
+		if (!n.length) return t;
+		let i = [], a = 1, o = t.length ? t[0] : null;
+		for (let s = 0, c = 0, l = 0;; s++) {
+			let u = s < n.length ? n[s] : null, d = u ? u.fromA : 1e9;
+			if (d - c >= r) for (; o && o.from < d;) {
+				let n = o;
+				if (c >= n.from || d <= n.to || l) {
+					let t = Math.max(n.from, c) - l, r = Math.min(n.to, d) - l;
+					n = t >= r ? null : new e(t, r, n.tree, n.offset + l, s > 0, !!u);
+				}
+				if (n && i.push(n), o.to > d) break;
+				o = a < t.length ? t[a++] : null;
+			}
+			if (!u) break;
+			c = u.toA, l = u.toA - u.toB;
+		}
+		return i;
+	}
+}, ee = class {
+	startParse(e, t, n) {
+		return typeof e == "string" && (e = new te(e)), n = n ? n.length ? n.map((e) => new r(e.from, e.to)) : [new r(0, 0)] : [new r(0, e.length)], this.createParse(e, t || [], n);
+	}
+	parse(e, t, n) {
+		let r = this.startParse(e, t, n);
+		for (;;) {
+			let e = r.advance();
+			if (e) return e;
+		}
+	}
+}, te = class {
+	constructor(e) {
+		this.string = e;
+	}
+	get length() {
+		return this.string.length;
+	}
+	chunk(e) {
+		return this.string.slice(e);
+	}
+	get lineChunks() {
+		return !1;
+	}
+	read(e, t) {
+		return this.string.slice(e, t);
+	}
+};
+function ne(e) {
+	return (t, n, r, i) => new oe(t, e, n, r, i);
+}
+var re = class {
+	constructor(e, t, n, r, i, a) {
+		this.parser = e, this.parse = t, this.overlay = n, this.bracketed = r, this.target = i, this.from = a;
+	}
+};
+function ie(e) {
+	if (!e.length || e.some((e) => e.from >= e.to)) throw RangeError("Invalid inner parse ranges given: " + JSON.stringify(e));
+}
+var ae = class {
+	constructor(e, t, n, r, i, a, o, s) {
+		this.parser = e, this.predicate = t, this.mounts = n, this.index = r, this.start = i, this.bracketed = a, this.target = o, this.prev = s, this.depth = 0, this.ranges = [];
+	}
+}, P = new i({ perNode: !0 }), oe = class {
+	constructor(e, t, n, r, i) {
+		this.nest = t, this.input = n, this.fragments = r, this.ranges = i, this.inner = [], this.innerDone = 0, this.baseTree = null, this.stoppedAt = null, this.baseParse = e;
+	}
+	advance() {
+		if (this.baseParse) {
+			let e = this.baseParse.advance();
+			if (!e) return null;
+			if (this.baseParse = null, this.baseTree = e, this.startInner(), this.stoppedAt != null) for (let e of this.inner) e.parse.stopAt(this.stoppedAt);
+		}
+		if (this.innerDone == this.inner.length) {
+			let e = this.baseTree;
+			return this.stoppedAt != null && (e = new f(e.type, e.children, e.positions, e.length, e.propValues.concat([[P, this.stoppedAt]]))), e;
+		}
+		let e = this.inner[this.innerDone], t = e.parse.advance();
+		if (t) {
+			this.innerDone++;
+			let n = Object.assign(Object.create(null), e.target.props);
+			n[i.mounted.id] = new a(t, e.overlay, e.parser, e.bracketed), e.target.props = n;
+		}
+		return null;
+	}
+	get parsedPos() {
+		if (this.baseParse) return 0;
+		let e = this.input.length;
+		for (let t = this.innerDone; t < this.inner.length; t++) this.inner[t].from < e && (e = Math.min(e, this.inner[t].parse.parsedPos));
+		return e;
+	}
+	stopAt(e) {
+		if (this.stoppedAt = e, this.baseParse) this.baseParse.stopAt(e);
+		else for (let t = this.innerDone; t < this.inner.length; t++) this.inner[t].parse.stopAt(e);
+	}
+	startInner() {
+		let e = new de(this.fragments), t = null, n = null, i = new E(new v(this.baseTree, this.ranges[0].from, 0, null), d.IncludeAnonymous | d.IgnoreMounts);
+		scan: for (let a, o;;) {
+			let s = !0, c;
+			if (this.stoppedAt != null && i.from >= this.stoppedAt) s = !1;
+			else if (e.hasNode(i)) {
+				if (t) {
+					let e = t.mounts.find((e) => e.frag.from <= i.from && e.frag.to >= i.to && e.mount.overlay);
+					if (e) for (let n of e.mount.overlay) {
+						let r = n.from + e.pos, a = n.to + e.pos;
+						r >= i.from && a <= i.to && !t.ranges.some((e) => e.from < a && e.to > r) && t.ranges.push({
+							from: r,
+							to: a
+						});
+					}
+				}
+				s = !1;
+			} else if (n && (o = se(n.ranges, i.from, i.to))) s = o != 2;
+			else if (!i.type.isAnonymous && (a = this.nest(i, this.input)) && (i.from < i.to || !a.overlay)) {
+				i.tree || (le(i), t && t.depth++, n && n.depth++);
+				let o = e.findMounts(i.from, a.parser);
+				if (typeof a.overlay == "function") t = new ae(a.parser, a.overlay, o, this.inner.length, i.from, !!a.bracketed, i.tree, t);
+				else {
+					let e = fe(this.ranges, a.overlay || (i.from < i.to ? [new r(i.from, i.to)] : []));
+					e.length && ie(e), (e.length || !a.overlay) && this.inner.push(new re(a.parser, e.length ? a.parser.startParse(this.input, me(o, e), e) : a.parser.startParse(""), a.overlay ? a.overlay.map((e) => new r(e.from - i.from, e.to - i.from)) : null, !!a.bracketed, i.tree, e.length ? e[0].from : i.from)), a.overlay ? e.length && (n = {
+						ranges: e,
+						depth: 0,
+						prev: n
+					}) : s = !1;
+				}
+			} else if (t && (c = t.predicate(i)) && (c === !0 && (c = new r(i.from, i.to)), c.from < c.to)) {
+				let e = t.ranges.length - 1;
+				e >= 0 && t.ranges[e].to == c.from ? t.ranges[e] = {
+					from: t.ranges[e].from,
+					to: c.to
+				} : t.ranges.push(c);
+			}
+			if (s && i.firstChild()) t && t.depth++, n && n.depth++;
+			else for (; !i.nextSibling();) {
+				if (!i.parent()) break scan;
+				if (t && !--t.depth) {
+					let e = fe(this.ranges, t.ranges);
+					e.length && (ie(e), this.inner.splice(t.index, 0, new re(t.parser, t.parser.startParse(this.input, me(t.mounts, e), e), t.ranges.map((e) => new r(e.from - t.start, e.to - t.start)), t.bracketed, t.target, e[0].from))), t = t.prev;
+				}
+				n && !--n.depth && (n = n.prev);
+			}
+		}
+	}
+};
+function se(e, t, n) {
+	for (let r of e) {
+		if (r.from >= n) break;
+		if (r.to > t) return r.from <= t && r.to >= n ? 2 : 1;
+	}
+	return 0;
+}
+function ce(e, t, n, r, i, a) {
+	if (t < n) {
+		let o = e.buffer[t + 1];
+		r.push(e.slice(t, n, o)), i.push(o - a);
+	}
+}
+function le(e) {
+	let { node: t } = e, n = [], r = t.context.buffer;
+	do
+		n.push(e.index), e.parent();
+	while (!e.tree);
+	let i = e.tree, a = i.children.indexOf(r), o = i.children[a], c = o.buffer, l = [a];
+	function u(e, r, i, a, s, d) {
+		let p = n[d], m = [], h = [];
+		ce(o, e, p, m, h, a);
+		let g = c[p + 1], _ = c[p + 2];
+		l.push(m.length);
+		let v = d ? u(p + 4, c[p + 3], o.set.types[c[p]], g, _ - g, d - 1) : t.toTree();
+		return m.push(v), h.push(g - a), ce(o, c[p + 3], r, m, h, a), new f(i, m, h, s);
+	}
+	i.children[a] = u(0, c.length, s.none, 0, o.length, n.length - 1);
+	for (let t of l) {
+		let n = e.tree.children[t], r = e.tree.positions[t];
+		e.yield(new v(n, r + e.from, t, e._tree));
+	}
+}
+var ue = class {
+	constructor(e, t) {
+		this.offset = t, this.done = !1, this.cursor = e.cursor(d.IncludeAnonymous | d.IgnoreMounts);
+	}
+	moveTo(e) {
+		let { cursor: t } = this, n = e - this.offset;
+		for (; !this.done && t.from < n;) if (!(t.to >= e && t.enter(n, 1, d.IgnoreOverlays | d.ExcludeBuffers))) {
+			if (t.to <= e) t.next(!1) || (this.done = !0);
+			else break;
+		}
+	}
+	hasNode(e) {
+		if (this.moveTo(e.from), !this.done && this.cursor.from + this.offset == e.from && this.cursor.tree) for (let t = this.cursor.tree;;) {
+			if (t == e.tree) return !0;
+			if (t.children.length && t.positions[0] == 0 && t.children[0] instanceof f) t = t.children[0];
+			else break;
+		}
+		return !1;
+	}
+}, de = class {
+	constructor(e) {
+		if (this.fragments = e, this.curTo = 0, this.fragI = 0, e.length) {
+			let t = this.curFrag = e[0];
+			this.curTo = t.tree.prop(P) ?? t.to, this.inner = new ue(t.tree, -t.offset);
+		} else this.curFrag = this.inner = null;
+	}
+	hasNode(e) {
+		for (; this.curFrag && e.from >= this.curTo;) this.nextFrag();
+		return this.curFrag && this.curFrag.from <= e.from && this.curTo >= e.to && this.inner.hasNode(e);
+	}
+	nextFrag() {
+		if (this.fragI++, this.fragI == this.fragments.length) this.curFrag = this.inner = null;
+		else {
+			let e = this.curFrag = this.fragments[this.fragI];
+			this.curTo = e.tree.prop(P) ?? e.to, this.inner = new ue(e.tree, -e.offset);
+		}
+	}
+	findMounts(e, t) {
+		let n = [];
+		if (this.inner) {
+			this.inner.cursor.moveTo(e, 1);
+			for (let e = this.inner.cursor.node; e; e = e.parent) {
+				let r = e.tree?.prop(i.mounted);
+				if (r && r.parser == t) for (let t = this.fragI; t < this.fragments.length; t++) {
+					let i = this.fragments[t];
+					if (i.from >= e.to) break;
+					i.tree == this.curFrag.tree && n.push({
+						frag: i,
+						pos: e.from - i.offset,
+						mount: r
+					});
+				}
+			}
+		}
+		return n;
+	}
+};
+function fe(e, t) {
+	let n = null, i = t;
+	for (let a = 1, o = 0; a < e.length; a++) {
+		let s = e[a - 1].to, c = e[a].from;
+		for (; o < i.length; o++) {
+			let e = i[o];
+			if (e.from >= c) break;
+			e.to <= s || (n || (i = n = t.slice()), e.from < s ? (n[o] = new r(e.from, s), e.to > c && n.splice(o + 1, 0, new r(c, e.to))) : e.to > c ? n[o--] = new r(c, e.to) : n.splice(o--, 1));
+		}
+	}
+	return i;
+}
+function pe(e, t, n, i) {
+	let a = 0, o = 0, s = !1, c = !1, l = -1e9, u = [];
+	for (;;) {
+		let d = a == e.length ? 1e9 : s ? e[a].to : e[a].from, f = o == t.length ? 1e9 : c ? t[o].to : t[o].from;
+		if (s != c) {
+			let e = Math.max(l, n), t = Math.min(d, f, i);
+			e < t && u.push(new r(e, t));
+		}
+		if (l = Math.min(d, f), l == 1e9) break;
+		d == l && (s ? (s = !1, a++) : s = !0), f == l && (c ? (c = !1, o++) : c = !0);
+	}
+	return u;
+}
+function me(e, t) {
+	let n = [];
+	for (let { pos: i, mount: a, frag: o } of e) {
+		let e = i + (a.overlay ? a.overlay[0].from : 0), s = e + a.tree.length, c = Math.max(o.from, e), l = Math.min(o.to, s);
+		if (a.overlay) {
+			let s = pe(t, a.overlay.map((e) => new r(e.from + i, e.to + i)), c, l);
+			for (let t = 0, r = c;; t++) {
+				let i = t == s.length, c = i ? l : s[t].from;
+				if (c > r && n.push(new N(r, c, a.tree, -e, o.from >= r || o.openStart, o.to <= c || o.openEnd)), i) break;
+				r = s[t].to;
+			}
+		} else n.push(new N(c, l, a.tree, -e, o.from >= e || o.openStart, o.to <= s || o.openEnd));
+	}
+	return n;
+}
+//#endregion
+//#region ../../node_modules/@lezer/highlight/dist/index.js
+var he = /* @__PURE__ */ e({
+	Tag: () => F,
+	classHighlighter: () => Oe,
+	getStyleTags: () => Te,
+	highlightCode: () => Ce,
+	highlightTree: () => z,
+	styleTags: () => I,
+	tagHighlighter: () => R,
+	tags: () => $
+}), ge = 0, F = class e {
+	constructor(e, t, n, r) {
+		this.name = e, this.set = t, this.base = n, this.modified = r, this.id = ge++;
+	}
+	toString() {
+		let { name: e } = this;
+		for (let t of this.modified) t.name && (e = `${t.name}(${e})`);
+		return e;
+	}
+	static define(t, n) {
+		let r = typeof t == "string" ? t : "?";
+		if (t instanceof e && (n = t), n?.base) throw Error("Can not derive from a modified tag");
+		let i = new e(r, [], null, []);
+		if (i.set.push(i), n) for (let e of n.set) i.set.push(e);
+		return i;
+	}
+	static defineModifier(e) {
+		let t = new ve(e);
+		return (e) => e.modified.indexOf(t) > -1 ? e : ve.get(e.base || e, e.modified.concat(t).sort((e, t) => e.id - t.id));
+	}
+}, _e = 0, ve = class e {
+	constructor(e) {
+		this.name = e, this.instances = [], this.id = _e++;
+	}
+	static get(t, n) {
+		if (!n.length) return t;
+		let r = n[0].instances.find((e) => e.base == t && ye(n, e.modified));
+		if (r) return r;
+		let i = [], a = new F(t.name, i, t, n);
+		for (let e of n) e.instances.push(a);
+		let o = be(n);
+		for (let n of t.set) if (!n.modified.length) for (let t of o) i.push(e.get(n, t));
+		return a;
+	}
+};
+function ye(e, t) {
+	return e.length == t.length && e.every((e, n) => e == t[n]);
+}
+function be(e) {
+	let t = [[]];
+	for (let n = 0; n < e.length; n++) for (let r = 0, i = t.length; r < i; r++) t.push(t[r].concat(e[n]));
+	return t.sort((e, t) => t.length - e.length);
+}
+function I(e) {
+	let t = Object.create(null);
+	for (let n in e) {
+		let r = e[n];
+		Array.isArray(r) || (r = [r]);
+		for (let e of n.split(" ")) if (e) {
+			let n = [], i = 2, a = e;
+			for (let t = 0;;) {
+				if (a == "..." && t > 0 && t + 3 == e.length) {
+					i = 1;
+					break;
+				}
+				let r = /^"(?:[^"\\]|\\.)*?"|[^\/!]+/.exec(a);
+				if (!r) throw RangeError("Invalid path: " + e);
+				if (n.push(r[0] == "*" ? "" : r[0][0] == "\"" ? JSON.parse(r[0]) : r[0]), t += r[0].length, t == e.length) break;
+				let o = e[t++];
+				if (t == e.length && o == "!") {
+					i = 0;
+					break;
+				}
+				if (o != "/") throw RangeError("Invalid path: " + e);
+				a = e.slice(t);
+			}
+			let o = n.length - 1, s = n[o];
+			if (!s) throw RangeError("Invalid path: " + e);
+			t[s] = new L(r, i, o > 0 ? n.slice(0, o) : null).sort(t[s]);
+		}
+	}
+	return xe.add(t);
+}
+var xe = new i({ combine(e, t) {
+	let n, r, i;
+	for (; e || t;) {
+		if (!e || t && e.depth >= t.depth ? (i = t, t = t.next) : (i = e, e = e.next), n && n.mode == i.mode && !i.context && !n.context) continue;
+		let a = new L(i.tags, i.mode, i.context);
+		n ? n.next = a : r = a, n = a;
+	}
+	return r;
+} }), L = class {
+	constructor(e, t, n, r) {
+		this.tags = e, this.mode = t, this.context = n, this.next = r;
+	}
+	get opaque() {
+		return this.mode == 0;
+	}
+	get inherit() {
+		return this.mode == 1;
+	}
+	sort(e) {
+		return !e || e.depth < this.depth ? (this.next = e, this) : (e.next = this.sort(e.next), e);
+	}
+	get depth() {
+		return this.context ? this.context.length : 0;
+	}
+};
+L.empty = new L([], 2, null);
+function R(e, t) {
+	let n = Object.create(null);
+	for (let t of e) if (!Array.isArray(t.tag)) n[t.tag.id] = t.class;
+	else for (let e of t.tag) n[e.id] = t.class;
+	let { scope: r, all: i = null } = t || {};
+	return {
+		style: (e) => {
+			let t = i;
+			for (let r of e) for (let e of r.set) {
+				let r = n[e.id];
+				if (r) {
+					t = t ? t + " " + r : r;
+					break;
+				}
+			}
+			return t;
+		},
+		scope: r
+	};
+}
+function Se(e, t) {
+	let n = null;
+	for (let r of e) {
+		let e = r.style(t);
+		e && (n = n ? n + " " + e : e);
+	}
+	return n;
+}
+function z(e, t, n, r = 0, i = e.length) {
+	let a = new we(r, Array.isArray(t) ? t : [t], n);
+	a.highlightRange(e.cursor(), r, i, "", a.highlighters), a.flush(i);
+}
+function Ce(e, t, n, r, i, a = 0, o = e.length) {
+	let s = a;
+	function c(t, n) {
+		if (!(t <= s)) {
+			for (let a = e.slice(s, t), o = 0;;) {
+				let e = a.indexOf("\n", o), t = e < 0 ? a.length : e;
+				if (t > o && r(a.slice(o, t), n), e < 0) break;
+				i(), o = e + 1;
+			}
+			s = t;
+		}
+	}
+	z(t, n, (e, t, n) => {
+		c(e, ""), c(t, n);
+	}, a, o), c(o, "");
+}
+var we = class {
+	constructor(e, t, n) {
+		this.at = e, this.highlighters = t, this.span = n, this.class = "";
+	}
+	startSpan(e, t) {
+		t != this.class && (this.flush(e), e > this.at && (this.at = e), this.class = t);
+	}
+	flush(e) {
+		e > this.at && this.class && this.span(this.at, e, this.class);
+	}
+	highlightRange(e, t, n, r, a) {
+		let { type: o, from: s, to: c } = e;
+		if (s >= n || c <= t) return;
+		o.isTop && (a = this.highlighters.filter((e) => !e.scope || e.scope(o)));
+		let l = r, u = Te(e) || L.empty, d = Se(a, u.tags);
+		if (d && (l && (l += " "), l += d, u.mode == 1 && (r += (r ? " " : "") + d)), this.startSpan(Math.max(t, s), l), u.opaque) return;
+		let f = e.tree && e.tree.prop(i.mounted);
+		if (f && f.overlay) {
+			let i = e.node.enter(f.overlay[0].from + s, 1), o = this.highlighters.filter((e) => !e.scope || e.scope(f.tree.type)), u = e.firstChild();
+			for (let d = 0, p = s;; d++) {
+				let m = d < f.overlay.length ? f.overlay[d] : null, h = m ? m.from + s : c, g = Math.max(t, p), _ = Math.min(n, h);
+				if (g < _ && u) for (; e.from < _ && (this.highlightRange(e, g, _, r, a), this.startSpan(Math.min(_, e.to), l), !(e.to >= h || !e.nextSibling())););
+				if (!m || h > n) break;
+				p = m.to + s, p > t && (this.highlightRange(i.cursor(), Math.max(t, m.from + s), Math.min(n, p), "", o), this.startSpan(Math.min(n, p), l));
+			}
+			u && e.parent();
+		} else if (e.firstChild()) {
+			f && (r = "");
+			do
+				if (!(e.to <= t)) {
+					if (e.from >= n) break;
+					this.highlightRange(e, t, n, r, a), this.startSpan(Math.min(n, e.to), l);
+				}
+			while (e.nextSibling());
+			e.parent();
+		}
+	}
+};
+function Te(e) {
+	let t = e.type.prop(xe);
+	for (; t && t.context && !e.matchContext(t.context);) t = t.next;
+	return t || null;
+}
+var B = F.define, V = B(), H = B(), Ee = B(H), De = B(H), U = B(), W = B(U), G = B(U), K = B(), q = B(K), J = B(), Y = B(), X = B(), Z = B(X), Q = B(), $ = {
+	comment: V,
+	lineComment: B(V),
+	blockComment: B(V),
+	docComment: B(V),
+	name: H,
+	variableName: B(H),
+	typeName: Ee,
+	tagName: B(Ee),
+	propertyName: De,
+	attributeName: B(De),
+	className: B(H),
+	labelName: B(H),
+	namespace: B(H),
+	macroName: B(H),
+	literal: U,
+	string: W,
+	docString: B(W),
+	character: B(W),
+	attributeValue: B(W),
+	number: G,
+	integer: B(G),
+	float: B(G),
+	bool: B(U),
+	regexp: B(U),
+	escape: B(U),
+	color: B(U),
+	url: B(U),
+	keyword: J,
+	self: B(J),
+	null: B(J),
+	atom: B(J),
+	unit: B(J),
+	modifier: B(J),
+	operatorKeyword: B(J),
+	controlKeyword: B(J),
+	definitionKeyword: B(J),
+	moduleKeyword: B(J),
+	operator: Y,
+	derefOperator: B(Y),
+	arithmeticOperator: B(Y),
+	logicOperator: B(Y),
+	bitwiseOperator: B(Y),
+	compareOperator: B(Y),
+	updateOperator: B(Y),
+	definitionOperator: B(Y),
+	typeOperator: B(Y),
+	controlOperator: B(Y),
+	punctuation: X,
+	separator: B(X),
+	bracket: Z,
+	angleBracket: B(Z),
+	squareBracket: B(Z),
+	paren: B(Z),
+	brace: B(Z),
+	content: K,
+	heading: q,
+	heading1: B(q),
+	heading2: B(q),
+	heading3: B(q),
+	heading4: B(q),
+	heading5: B(q),
+	heading6: B(q),
+	contentSeparator: B(K),
+	list: B(K),
+	quote: B(K),
+	emphasis: B(K),
+	strong: B(K),
+	link: B(K),
+	monospace: B(K),
+	strikethrough: B(K),
+	inserted: B(),
+	deleted: B(),
+	changed: B(),
+	invalid: B(),
+	meta: Q,
+	documentMeta: B(Q),
+	annotation: B(Q),
+	processingInstruction: B(Q),
+	definition: F.defineModifier("definition"),
+	constant: F.defineModifier("constant"),
+	function: F.defineModifier("function"),
+	standard: F.defineModifier("standard"),
+	local: F.defineModifier("local"),
+	special: F.defineModifier("special")
+};
+for (let e in $) {
+	let t = $[e];
+	t instanceof F && (t.name = e);
+}
+var Oe = R([
+	{
+		tag: $.link,
+		class: "tok-link"
+	},
+	{
+		tag: $.heading,
+		class: "tok-heading"
+	},
+	{
+		tag: $.emphasis,
+		class: "tok-emphasis"
+	},
+	{
+		tag: $.strong,
+		class: "tok-strong"
+	},
+	{
+		tag: $.keyword,
+		class: "tok-keyword"
+	},
+	{
+		tag: $.atom,
+		class: "tok-atom"
+	},
+	{
+		tag: $.bool,
+		class: "tok-bool"
+	},
+	{
+		tag: $.url,
+		class: "tok-url"
+	},
+	{
+		tag: $.labelName,
+		class: "tok-labelName"
+	},
+	{
+		tag: $.inserted,
+		class: "tok-inserted"
+	},
+	{
+		tag: $.deleted,
+		class: "tok-deleted"
+	},
+	{
+		tag: $.literal,
+		class: "tok-literal"
+	},
+	{
+		tag: $.string,
+		class: "tok-string"
+	},
+	{
+		tag: $.number,
+		class: "tok-number"
+	},
+	{
+		tag: [
+			$.regexp,
+			$.escape,
+			$.special($.string)
+		],
+		class: "tok-string2"
+	},
+	{
+		tag: $.variableName,
+		class: "tok-variableName"
+	},
+	{
+		tag: $.local($.variableName),
+		class: "tok-variableName tok-local"
+	},
+	{
+		tag: $.definition($.variableName),
+		class: "tok-variableName tok-definition"
+	},
+	{
+		tag: $.special($.variableName),
+		class: "tok-variableName2"
+	},
+	{
+		tag: $.definition($.propertyName),
+		class: "tok-propertyName tok-definition"
+	},
+	{
+		tag: $.typeName,
+		class: "tok-typeName"
+	},
+	{
+		tag: $.namespace,
+		class: "tok-namespace"
+	},
+	{
+		tag: $.className,
+		class: "tok-className"
+	},
+	{
+		tag: $.macroName,
+		class: "tok-macroName"
+	},
+	{
+		tag: $.propertyName,
+		class: "tok-propertyName"
+	},
+	{
+		tag: $.operator,
+		class: "tok-operator"
+	},
+	{
+		tag: $.comment,
+		class: "tok-comment"
+	},
+	{
+		tag: $.meta,
+		class: "tok-meta"
+	},
+	{
+		tag: $.invalid,
+		class: "tok-invalid"
+	},
+	{
+		tag: $.punctuation,
+		class: "tok-punctuation"
+	}
+]);
+//#endregion
+export { R as a, d as c, s as d, M as f, ne as g, N as h, I as i, i as l, f as m, he as n, $ as o, ee as p, z as r, t as s, F as t, c as u };