@m3ui-vue/m3ui-vue 0.1.1 → 0.1.2

package/dist/dist-Dsrzt6J5.js

@@ -0,0 +1,1192 @@
+//#region node_modules/.pnpm/@lezer+common@1.5.2/node_modules/@lezer/common/dist/index.js
+var e = 1024, t = 0, n = class {
+	constructor(e = {}) {
+		this.id = t++, 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 = a.match(e)), (t) => {
+			let n = e(t);
+			return n === void 0 ? null : [this, n];
+		};
+	}
+};
+n.closedBy = new n({ deserialize: (e) => e.split(" ") }), n.openedBy = new n({ deserialize: (e) => e.split(" ") }), n.group = new n({ deserialize: (e) => e.split(" ") }), n.isolate = new n({ deserialize: (e) => {
+	if (e && e != "rtl" && e != "ltr" && e != "auto") throw RangeError("Invalid value for isolate: " + e);
+	return e || "auto";
+} }), n.contextHash = new n({ perNode: !0 }), n.lookAhead = new n({ perNode: !0 }), n.mounted = new n({ perNode: !0 });
+var r = 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[n.mounted.id];
+	}
+}, i = Object.create(null), a = 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) : i, r = !!t.top | (t.skipped ? 2 : 0) | (t.error ? 4 : 0) | (t.name == null ? 8 : 0), a = new e(t.name || "", n, t.id, r);
+		if (t.props) {
+			for (let e of t.props) if (Array.isArray(e) || (e = e(a)), 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 a;
+	}
+	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(n.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 r = e.prop(n.group), i = -1; i < (r ? r.length : 0); i++) {
+				let n = t[i < 0 ? e.name : r[i]];
+				if (n) return n;
+			}
+		};
+	}
+};
+a.none = new a("", Object.create(null), 0, 8);
+var o = /* @__PURE__ */ new WeakMap(), s = /* @__PURE__ */ new WeakMap(), c;
+(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";
+})(c ||= {});
+var l = 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 = r.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 C(this.topNode, e);
+	}
+	cursorAt(e, t = 0, n = 0) {
+		let r = new C(o.get(this) || this.topNode);
+		return r.moveTo(e, t), o.set(this, r._tree), r;
+	}
+	get topNode() {
+		return new h(this, 0, 0, null);
+	}
+	resolve(e, t = 0) {
+		let n = p(o.get(this) || this.topNode, e, t, !1);
+		return o.set(this, n), n;
+	}
+	resolveInner(e, t = 0) {
+		let n = p(s.get(this) || this.topNode, e, t, !0);
+		return s.set(this, n), n;
+	}
+	resolveStack(e, t = 0) {
+		return S(this, e, t);
+	}
+	iterate(e) {
+		let { enter: t, leave: n, from: r = 0, to: i = this.length } = e, a = e.mode || 0, o = (a & c.IncludeAnonymous) > 0;
+		for (let e = this.cursor(a | c.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 : O(a.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(a.none, t, n, r)));
+	}
+	static build(e) {
+		return T(e);
+	}
+};
+l.empty = new l(a.none, [], [], 0);
+var u = 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);
+	}
+}, d = class e {
+	constructor(e, t, n) {
+		this.buffer = e, this.length = t, this.set = n;
+	}
+	get type() {
+		return a.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 && !(f(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 f(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 p(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 h && e.index < 0 ? null : e.parent;
+		if (!t) return e;
+		e = t;
+	}
+	let i = r ? 0 : c.IgnoreOverlays;
+	if (r) for (let r = e, a = r.parent; a; r = a, a = r.parent) r instanceof h && 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 m = class {
+	cursor(e = 0) {
+		return new C(this, e);
+	}
+	getChild(e, t = null, n = null) {
+		let r = g(this, e, t, n);
+		return r.length ? r[0] : null;
+	}
+	getChildren(e, t = null, n = null) {
+		return g(this, e, t, n);
+	}
+	resolve(e, t = 0) {
+		return p(this, e, t, !1);
+	}
+	resolveInner(e, t = 0) {
+		return p(this, e, t, !0);
+	}
+	matchContext(e) {
+		return _(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;
+	}
+}, h = class e extends m {
+	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, i, a, o = 0) {
+		for (let s = this;;) {
+			for (let { children: u, positions: p } = s._tree, m = n > 0 ? u.length : -1; t != m; t += n) {
+				let m = u[t], h = p[t] + s.from, g;
+				if (!(!(o & c.EnterBracketed && m instanceof l && (g = r.get(m)) && !g.overlay && g.bracketed && i >= h && i <= h + m.length) && !f(a, i, h, h + m.length))) {
+					if (m instanceof d) {
+						if (o & c.ExcludeBuffers) continue;
+						let e = m.findChild(0, m.buffer.length, n, i - h, a);
+						if (e > -1) return new y(new v(s, m, t, h), null, e);
+					} else if (o & c.IncludeAnonymous || !m.type.isAnonymous || w(m)) {
+						let l;
+						if (!(o & c.IgnoreMounts) && (l = r.get(m)) && !l.overlay) return new e(l.tree, h, t, s);
+						let u = new e(m, h, t, s);
+						return o & c.IncludeAnonymous || !u.type.isAnonymous ? u : u.nextChild(n < 0 ? m.children.length - 1 : 0, n, i, a, o);
+					}
+				}
+			}
+			if (o & c.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, i = 0) {
+		let a;
+		if (!(i & c.IgnoreOverlays) && (a = r.get(this._tree)) && a.overlay) {
+			let r = t - this.from, o = i & c.EnterBracketed && a.bracketed;
+			for (let { from: t, to: i } of a.overlay) if ((n > 0 || o ? t <= r : t < r) && (n < 0 || o ? i >= r : i > r)) return new e(a.tree, a.overlay[0].from + this.from, -1, this);
+		}
+		return this.nextChild(0, 1, t, n, i);
+	}
+	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 g(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 _(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 v = class {
+	constructor(e, t, n, r) {
+		this.parent = e, this.buffer = t, this.index = n, this.start = r;
+	}
+}, y = class e extends m {
+	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 & c.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 l(this.type, e, t, this.to - this.from);
+	}
+	toString() {
+		return this.context.buffer.childString(this.index);
+	}
+};
+function b(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 h && n.index < 0 ? null : n.parent, i = e.slice();
+	return r ? i[t] = r : i.splice(t, 1), new x(i, n);
+}
+var x = class {
+	constructor(e, t) {
+		this.heads = e, this.node = t;
+	}
+	get next() {
+		return b(this.heads);
+	}
+};
+function S(e, t, n) {
+	let i = e.resolveInner(t, n), a = null;
+	for (let e = i instanceof h ? i : i.context.parent; e; e = e.parent) if (e.index < 0) {
+		let r = e.parent;
+		(a ||= [i]).push(r.resolve(t, n)), e = r;
+	} else {
+		let o = r.get(e.tree);
+		if (o && o.overlay && o.overlay[0].from <= t && o.overlay[o.overlay.length - 1].to >= t) {
+			let r = new h(o.tree, o.overlay[0].from + e.from, -1, e);
+			(a ||= [i]).push(p(r, t, n, !1));
+		}
+	}
+	return a ? b(a) : i;
+}
+var C = 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 & ~c.EnterBracketed, e instanceof h) 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 h ? (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 & c.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+	}
+	parent() {
+		if (!this.buffer) return this.yieldNode(this.mode & c.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+		if (this.stack.length) return this.yieldBuf(this.stack.pop());
+		let e = this.mode & c.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 & c.IncludeAnonymous || e instanceof d || !e.type.isAnonymous || w(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 y(this.buffer, t, this.stack[e]);
+		return this.bufferNode = new y(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 _(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 _(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 w(e) {
+	return e.children.some((e) => e instanceof d || !e.type.isAnonymous || w(e));
+}
+function T(t) {
+	let { buffer: r, nodeSet: i, maxBufferLength: a = e, reused: o = [], minRepeatType: s = i.types.length } = t, c = Array.isArray(r) ? new u(r, r.length) : r, f = i.types, p = 0, m = 0;
+	function h(e, t, n, r, l, u) {
+		let { id: S, start: C, end: w, size: T } = c, E = m, D = p;
+		if (T < 0) if (c.next(), T == -1) {
+			let t = o[S];
+			n.push(t), r.push(C - e);
+			return;
+		} else if (T == -3) {
+			p = S;
+			return;
+		} else if (T == -4) {
+			m = S;
+			return;
+		} else throw RangeError(`Unrecognized record size: ${T}`);
+		let k = f[S], A, j, M = C - e;
+		if (w - C <= a && (j = b(c.pos - t, l))) {
+			let t = new Uint16Array(j.size - j.skip), n = c.pos - j.size, r = t.length;
+			for (; c.pos > n;) r = x(j.start, t, r);
+			A = new d(t, w - j.start, i), M = j.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()) : u > 2500 ? g(C, e, t, n) : h(C, e, t, n, r, u + 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 = _(k, D);
+				A = O(k, t, n, 0, t.length, 0, w - C, e, e);
+			} else A = y(k, t, n, w - C, E - w, D);
+		}
+		n.push(A), r.push(M);
+	}
+	function g(e, t, n, r) {
+		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 d(t, o[2] - a, i)), r.push(a - e);
+		}
+	}
+	function _(e, t) {
+		return (r, i, a) => {
+			let o = 0, s = r.length - 1, c, u;
+			if (s >= 0 && (c = r[s]) instanceof l) {
+				if (!s && c.type == e && c.length == a) return c;
+				(u = c.prop(n.lookAhead)) && (o = i[s] + c.length + u);
+			}
+			return y(e, r, i, a, o, t);
+		};
+	}
+	function v(e, t, n, r, a, o, s, c, l) {
+		let u = [], d = [];
+		for (; e.length > r;) u.push(e.pop()), d.push(t.pop() + n - a);
+		e.push(y(i.types[s], u, d, o - a, c - o, l)), t.push(a - n);
+	}
+	function y(e, t, r, i, a, o, s) {
+		if (o) {
+			let e = [n.contextHash, o];
+			s = s ? [e].concat(s) : [e];
+		}
+		if (a > 25) {
+			let e = [n.lookAhead, a];
+			s = s ? [e].concat(s) : [e];
+		}
+		return new l(e, t, r, i, 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 ? p = r : o == -4 && (m = r);
+		return n;
+	}
+	let S = [], C = [];
+	for (; c.pos > 0;) h(t.start || 0, t.bufferStart || 0, S, C, -1, 0);
+	let w = t.length ?? (S.length ? C[0] + S[0].length : 0);
+	return new l(f[t.topID], S.reverse(), C.reverse(), w);
+}
+var E = /* @__PURE__ */ new WeakMap();
+function D(e, t) {
+	if (!e.isAnonymous || t instanceof d || t.type != e) return 1;
+	let n = E.get(t);
+	if (n == null) {
+		n = 1;
+		for (let r of t.children) {
+			if (r.type != e || !(r instanceof l)) {
+				n = 1;
+				break;
+			}
+			n += D(e, r);
+		}
+		E.set(t, n);
+	}
+	return n;
+}
+function O(e, t, n, r, i, a, o, s, c) {
+	let l = 0;
+	for (let n = r; n < i; n++) l += D(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 = D(e, t[s]);
+			for (s++; s < i; s++) {
+				let n = D(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(O(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 n({ perNode: !0 });
+//#endregion
+//#region node_modules/.pnpm/@lezer+highlight@1.2.3/node_modules/@lezer/highlight/dist/index.js
+var k = 0, A = class e {
+	constructor(e, t, n, r) {
+		this.name = e, this.set = t, this.base = n, this.modified = r, this.id = k++;
+	}
+	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 M(e);
+		return (e) => e.modified.indexOf(t) > -1 ? e : M.get(e.base || e, e.modified.concat(t).sort((e, t) => e.id - t.id));
+	}
+}, j = 0, M = class e {
+	constructor(e) {
+		this.name = e, this.instances = [], this.id = j++;
+	}
+	static get(t, n) {
+		if (!n.length) return t;
+		let r = n[0].instances.find((e) => e.base == t && ee(n, e.modified));
+		if (r) return r;
+		let i = [], a = new A(t.name, i, t, n);
+		for (let e of n) e.instances.push(a);
+		let o = te(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 ee(e, t) {
+	return e.length == t.length && e.every((e, n) => e == t[n]);
+}
+function te(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 ne(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 P(r, i, o > 0 ? n.slice(0, o) : null).sort(t[s]);
+		}
+	}
+	return N.add(t);
+}
+var N = new n({ 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 P(i.tags, i.mode, i.context);
+		n ? n.next = a : r = a, n = a;
+	}
+	return r;
+} }), P = 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;
+	}
+};
+P.empty = new P([], 2, null);
+function F(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 re(e, t) {
+	let n = null;
+	for (let r of e) {
+		let e = r.style(t);
+		e && (n = n ? n + " " + e : e);
+	}
+	return n;
+}
+function I(e, t, n, r = 0, i = e.length) {
+	let a = new ae(r, Array.isArray(t) ? t : [t], n);
+	a.highlightRange(e.cursor(), r, i, "", a.highlighters), a.flush(i);
+}
+function ie(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;
+		}
+	}
+	I(t, n, (e, t, n) => {
+		c(e, ""), c(t, n);
+	}, a, o), c(o, "");
+}
+var ae = 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, r, i, a) {
+		let { type: o, from: s, to: c } = e;
+		if (s >= r || c <= t) return;
+		o.isTop && (a = this.highlighters.filter((e) => !e.scope || e.scope(o)));
+		let l = i, u = L(e) || P.empty, d = re(a, u.tags);
+		if (d && (l && (l += " "), l += d, u.mode == 1 && (i += (i ? " " : "") + d)), this.startSpan(Math.max(t, s), l), u.opaque) return;
+		let f = e.tree && e.tree.prop(n.mounted);
+		if (f && f.overlay) {
+			let n = 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(r, h);
+				if (g < _ && u) for (; e.from < _ && (this.highlightRange(e, g, _, i, a), this.startSpan(Math.min(_, e.to), l), !(e.to >= h || !e.nextSibling())););
+				if (!m || h > r) break;
+				p = m.to + s, p > t && (this.highlightRange(n.cursor(), Math.max(t, m.from + s), Math.min(r, p), "", o), this.startSpan(Math.min(r, p), l));
+			}
+			u && e.parent();
+		} else if (e.firstChild()) {
+			f && (i = "");
+			do {
+				if (e.to <= t) continue;
+				if (e.from >= r) break;
+				this.highlightRange(e, t, r, i, a), this.startSpan(Math.min(r, e.to), l);
+			} while (e.nextSibling());
+			e.parent();
+		}
+	}
+};
+function L(e) {
+	let t = e.type.prop(N);
+	for (; t && t.context && !e.matchContext(t.context);) t = t.next;
+	return t || null;
+}
+var R = A.define, z = R(), B = R(), V = R(B), H = R(B), U = R(), W = R(U), G = R(U), K = R(), q = R(K), J = R(), Y = R(), X = R(), Z = R(X), Q = R(), $ = {
+	comment: z,
+	lineComment: R(z),
+	blockComment: R(z),
+	docComment: R(z),
+	name: B,
+	variableName: R(B),
+	typeName: V,
+	tagName: R(V),
+	propertyName: H,
+	attributeName: R(H),
+	className: R(B),
+	labelName: R(B),
+	namespace: R(B),
+	macroName: R(B),
+	literal: U,
+	string: W,
+	docString: R(W),
+	character: R(W),
+	attributeValue: R(W),
+	number: G,
+	integer: R(G),
+	float: R(G),
+	bool: R(U),
+	regexp: R(U),
+	escape: R(U),
+	color: R(U),
+	url: R(U),
+	keyword: J,
+	self: R(J),
+	null: R(J),
+	atom: R(J),
+	unit: R(J),
+	modifier: R(J),
+	operatorKeyword: R(J),
+	controlKeyword: R(J),
+	definitionKeyword: R(J),
+	moduleKeyword: R(J),
+	operator: Y,
+	derefOperator: R(Y),
+	arithmeticOperator: R(Y),
+	logicOperator: R(Y),
+	bitwiseOperator: R(Y),
+	compareOperator: R(Y),
+	updateOperator: R(Y),
+	definitionOperator: R(Y),
+	typeOperator: R(Y),
+	controlOperator: R(Y),
+	punctuation: X,
+	separator: R(X),
+	bracket: Z,
+	angleBracket: R(Z),
+	squareBracket: R(Z),
+	paren: R(Z),
+	brace: R(Z),
+	content: K,
+	heading: q,
+	heading1: R(q),
+	heading2: R(q),
+	heading3: R(q),
+	heading4: R(q),
+	heading5: R(q),
+	heading6: R(q),
+	contentSeparator: R(K),
+	list: R(K),
+	quote: R(K),
+	emphasis: R(K),
+	strong: R(K),
+	link: R(K),
+	monospace: R(K),
+	strikethrough: R(K),
+	inserted: R(),
+	deleted: R(),
+	changed: R(),
+	invalid: R(),
+	meta: Q,
+	documentMeta: R(Q),
+	annotation: R(Q),
+	processingInstruction: R(Q),
+	definition: A.defineModifier("definition"),
+	constant: A.defineModifier("constant"),
+	function: A.defineModifier("function"),
+	standard: A.defineModifier("standard"),
+	local: A.defineModifier("local"),
+	special: A.defineModifier("special")
+};
+for (let e in $) {
+	let t = $[e];
+	t instanceof A && (t.name = e);
+}
+var oe = F([
+	{
+		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 { A as Tag, oe as classHighlighter, L as getStyleTags, ie as highlightCode, I as highlightTree, ne as styleTags, F as tagHighlighter, $ as tags };
+
+//# sourceMappingURL=dist-Dsrzt6J5.js.map