@burdenoff/microfe-technospam 2026.1102.1 → 2026.1102.2

package/dist/node_modules/@lezer/common/dist/index.js

@@ -0,0 +1,896 @@
+//#region node_modules/@lezer/common/dist/index.js
+var e = 1024, t = 0, n = class {
+	constructor(e, t) {
+		this.from = e, this.to = t;
+	}
+}, r = 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 = o.match(e)), (t) => {
+			let n = e(t);
+			return n === void 0 ? null : [this, n];
+		};
+	}
+};
+r.closedBy = new r({ deserialize: (e) => e.split(" ") }), r.openedBy = new r({ deserialize: (e) => e.split(" ") }), r.group = new r({ deserialize: (e) => e.split(" ") }), r.isolate = new r({ deserialize: (e) => {
+	if (e && e != "rtl" && e != "ltr" && e != "auto") throw RangeError("Invalid value for isolate: " + e);
+	return e || "auto";
+} }), r.contextHash = new r({ perNode: !0 }), r.lookAhead = new r({ perNode: !0 }), r.mounted = new r({ perNode: !0 });
+var i = 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[r.mounted.id];
+	}
+}, a = Object.create(null), o = 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(r.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(r.group), i = -1; i < (n ? n.length : 0); i++) {
+				let r = t[i < 0 ? e.name : n[i]];
+				if (r) return r;
+			}
+		};
+	}
+};
+o.none = new o("", Object.create(null), 0, 8);
+var s = 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 o(e.name, r, e.id, e.flags) : e);
+		}
+		return new e(n);
+	}
+}, c = /* @__PURE__ */ new WeakMap(), l = /* @__PURE__ */ new WeakMap(), u;
+(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";
+})(u ||= {});
+var d = 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 = i.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 T(this.topNode, e);
+	}
+	cursorAt(e, t = 0, n = 0) {
+		let r = new T(c.get(this) || this.topNode);
+		return r.moveTo(e, t), c.set(this, r._tree), r;
+	}
+	get topNode() {
+		return new _(this, 0, 0, null);
+	}
+	resolve(e, t = 0) {
+		let n = h(c.get(this) || this.topNode, e, t, !1);
+		return c.set(this, n), n;
+	}
+	resolveInner(e, t = 0) {
+		let n = h(l.get(this) || this.topNode, e, t, !0);
+		return l.set(this, n), n;
+	}
+	resolveStack(e, t = 0) {
+		return w(this, e, t);
+	}
+	iterate(e) {
+		let { enter: t, leave: n, from: r = 0, to: i = this.length } = e, a = e.mode || 0, o = (a & u.IncludeAnonymous) > 0;
+		for (let e = this.cursor(a | u.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 : A(o.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(o.none, t, n, r)));
+	}
+	static build(e) {
+		return D(e);
+	}
+};
+d.empty = new d(o.none, [], [], 0);
+var f = 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);
+	}
+}, p = class e {
+	constructor(e, t, n) {
+		this.buffer = e, this.length = t, this.set = n;
+	}
+	get type() {
+		return o.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 && !(m(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 m(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 h(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 _ && e.index < 0 ? null : e.parent;
+		if (!t) return e;
+		e = t;
+	}
+	let i = r ? 0 : u.IgnoreOverlays;
+	if (r) for (let r = e, a = r.parent; a; r = a, a = r.parent) r instanceof _ && 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 g = class {
+	cursor(e = 0) {
+		return new T(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 h(this, e, t, !1);
+	}
+	resolveInner(e, t = 0) {
+		return h(this, e, t, !0);
+	}
+	matchContext(e) {
+		return y(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;
+	}
+}, _ = class e extends g {
+	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, a, o = 0) {
+		for (let s = this;;) {
+			for (let { children: c, positions: l } = s._tree, f = n > 0 ? c.length : -1; t != f; t += n) {
+				let f = c[t], h = l[t] + s.from, g;
+				if (!(!(o & u.EnterBracketed && f instanceof d && (g = i.get(f)) && !g.overlay && g.bracketed && r >= h && r <= h + f.length) && !m(a, r, h, h + f.length))) {
+					if (f instanceof p) {
+						if (o & u.ExcludeBuffers) continue;
+						let e = f.findChild(0, f.buffer.length, n, r - h, a);
+						if (e > -1) return new x(new b(s, f, t, h), null, e);
+					} else if (o & u.IncludeAnonymous || !f.type.isAnonymous || E(f)) {
+						let c;
+						if (!(o & u.IgnoreMounts) && (c = i.get(f)) && !c.overlay) return new e(c.tree, h, t, s);
+						let l = new e(f, h, t, s);
+						return o & u.IncludeAnonymous || !l.type.isAnonymous ? l : l.nextChild(n < 0 ? f.children.length - 1 : 0, n, r, a, o);
+					}
+				}
+			}
+			if (o & u.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 a;
+		if (!(r & u.IgnoreOverlays) && (a = i.get(this._tree)) && a.overlay) {
+			let i = t - this.from, o = r & u.EnterBracketed && a.bracketed;
+			for (let { from: t, to: r } of a.overlay) if ((n > 0 || o ? t <= i : t < i) && (n < 0 || o ? r >= i : r > i)) return new e(a.tree, a.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 y(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 b = class {
+	constructor(e, t, n, r) {
+		this.parent = e, this.buffer = t, this.index = n, this.start = r;
+	}
+}, x = class e extends g {
+	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 & u.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 d(this.type, e, t, this.to - this.from);
+	}
+	toString() {
+		return this.context.buffer.childString(this.index);
+	}
+};
+function S(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 _ && n.index < 0 ? null : n.parent, i = e.slice();
+	return r ? i[t] = r : i.splice(t, 1), new C(i, n);
+}
+var C = class {
+	constructor(e, t) {
+		this.heads = e, this.node = t;
+	}
+	get next() {
+		return S(this.heads);
+	}
+};
+function w(e, t, n) {
+	let r = e.resolveInner(t, n), a = null;
+	for (let e = r instanceof _ ? r : r.context.parent; e; e = e.parent) if (e.index < 0) {
+		let i = e.parent;
+		(a ||= [r]).push(i.resolve(t, n)), e = i;
+	} else {
+		let o = i.get(e.tree);
+		if (o && o.overlay && o.overlay[0].from <= t && o.overlay[o.overlay.length - 1].to >= t) {
+			let i = new _(o.tree, o.overlay[0].from + e.from, -1, e);
+			(a ||= [r]).push(h(i, t, n, !1));
+		}
+	}
+	return a ? S(a) : r;
+}
+var T = 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 & ~u.EnterBracketed, e instanceof _) 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 _ ? (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 & u.ExcludeBuffers ? !1 : this.enterChild(1, e, t) : this.yield(this._tree.enter(e, t, n));
+	}
+	parent() {
+		if (!this.buffer) return this.yieldNode(this.mode & u.IncludeAnonymous ? this._tree._parent : this._tree.parent);
+		if (this.stack.length) return this.yieldBuf(this.stack.pop());
+		let e = this.mode & u.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 & u.IncludeAnonymous || e instanceof p || !e.type.isAnonymous || E(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 x(this.buffer, t, this.stack[e]);
+		return this.bufferNode = new x(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 y(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 y(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 E(e) {
+	return e.children.some((e) => e instanceof p || !e.type.isAnonymous || E(e));
+}
+function D(t) {
+	let { buffer: n, nodeSet: i, maxBufferLength: a = e, reused: o = [], minRepeatType: s = i.types.length } = t, c = Array.isArray(n) ? new f(n, n.length) : n, l = i.types, u = 0, m = 0;
+	function h(e, t, n, r, d, f) {
+		let { id: S, start: C, end: w, size: T } = c, E = m, D = u;
+		if (T < 0) if (c.next(), T == -1) {
+			let t = o[S];
+			n.push(t), r.push(C - e);
+			return;
+		} else if (T == -3) {
+			u = S;
+			return;
+		} else if (T == -4) {
+			m = S;
+			return;
+		} else throw RangeError(`Unrecognized record size: ${T}`);
+		let O = l[S], k, j, M = C - e;
+		if (w - C <= a && (j = b(c.pos - t, d))) {
+			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);
+			k = new p(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, l = 0, u = w, d = E;
+			for (; c.pos > e;) r >= 0 && c.id == r && c.size >= 0 ? (c.end <= u - a && (v(t, n, C, l, c.end, u, r, d, D), l = t.length, u = c.end, d = m), c.next()) : f > 2500 ? g(C, e, t, n) : (r >= 0 && c.size == -1 && o[c.id].type == i.types[r] && (l < t.length && v(t, n, C, l, c.end, u, r, d, D), l = t.length + 1, u = c.start, d = m), h(C, e, t, n, r, f + 1));
+			if (r >= 0 && l > 0 && l < t.length && v(t, n, C, l, C, u, r, d, D), t.reverse(), n.reverse(), r > -1 && l > 0) {
+				let e = _(O, D);
+				k = A(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), 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 p(t, o[2] - a, i)), r.push(a - e);
+		}
+	}
+	function _(e, t) {
+		return (n, i, a) => {
+			let o = 0, s = n.length - 1, c, l;
+			if (s >= 0 && (c = n[s]) instanceof d) {
+				if (!s && c.type == e && c.length == a) return c;
+				(l = c.prop(r.lookAhead)) && (o = i[s] + c.length + l - a);
+			}
+			return y(e, n, 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, n, i, a, o, s) {
+		if (o) {
+			let e = [r.contextHash, o];
+			s = s ? [e].concat(s) : [e];
+		}
+		if (a > 25) {
+			let e = [r.lookAhead, a];
+			s = s ? [e].concat(s) : [e];
+		}
+		return new d(e, t, n, 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 ? u = 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 d(l[t.topID], S.reverse(), C.reverse(), w);
+}
+var O = /* @__PURE__ */ new WeakMap();
+function k(e, t) {
+	if (!e.isAnonymous || t instanceof p || t.type != e) return 1;
+	let n = O.get(t);
+	if (n == null) {
+		n = 1;
+		for (let r of t.children) {
+			if (r.type != e || !(r instanceof d)) {
+				n = 1;
+				break;
+			}
+			n += k(e, r);
+		}
+		O.set(t, n);
+	}
+	return n;
+}
+function A(e, t, n, r, i, a, o, s, c) {
+	let l = 0;
+	for (let n = r; n < i; n++) l += k(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 = k(e, t[s]);
+			for (s++; s < i; s++) {
+				let n = k(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(A(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 j = 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 x ? this.setBuffer(e.context.buffer, e.index, t) : e instanceof _ && this.map.set(e.tree, t);
+	}
+	get(e) {
+		return e instanceof x ? this.getBuffer(e.context.buffer, e.index) : e instanceof _ ? 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);
+	}
+}, M = 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;
+	}
+}, N = class {
+	startParse(e, t, r) {
+		return typeof e == "string" && (e = new P(e)), r = r ? r.length ? r.map((e) => new n(e.from, e.to)) : [new n(0, 0)] : [new n(0, e.length)], this.createParse(e, t || [], r);
+	}
+	parse(e, t, n) {
+		let r = this.startParse(e, t, n);
+		for (;;) {
+			let e = r.advance();
+			if (e) return e;
+		}
+	}
+}, P = 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);
+	}
+};
+new r({ perNode: !0 });
+//#endregion
+export { e as DefaultBufferLength, u as IterMode, r as NodeProp, s as NodeSet, o as NodeType, j as NodeWeakMap, N as Parser, d as Tree, M as TreeFragment };
+
+//# sourceMappingURL=index.js.map