@oomol-lab/open-flow 0.1.0-beta.3 → 0.1.0-beta.5

package/dist/browser/{dist-DWADUsVB.js → dist-By46o5UV.js}

@@ -1,4 +1,4 @@
-import { c as e, d as t, f as n, h as r, l as i, m as a, u as o } from "./dist-BpopSHwP.js";
+import { B as e, L as t, R as n, U as r, V as i, W as a, z as o } from "./dist-DxahK_I8.js";
 //#region ../../node_modules/.bun/@lezer+lr@1.4.10/node_modules/@lezer/lr/dist/index.js
 var s = class e {
 	constructor(e, t, n, r, i, a, o, s, c, l = 0, u) {
@@ -435,12 +435,12 @@ function b(e, t, n, r) {
 	return i < 0 || y(n, r, e) < i;
 }
 var x = typeof process < "u" && /\bparse\b/.test({}.LOG), S = null;
-function C(e, t, n) {
-	let r = e.cursor(i.IncludeAnonymous);
-	for (r.moveTo(t);;) if (!(n < 0 ? r.childBefore(t) : r.childAfter(t))) for (;;) {
-		if ((n < 0 ? r.to < t : r.from > t) && !r.type.isError) return n < 0 ? Math.max(0, Math.min(r.to - 1, t - 25)) : Math.min(e.length, Math.max(r.from + 1, t + 25));
-		if (n < 0 ? r.prevSibling() : r.nextSibling()) break;
-		if (!r.parent()) return n < 0 ? 0 : e.length;
+function C(e, t, r) {
+	let i = e.cursor(n.IncludeAnonymous);
+	for (i.moveTo(t);;) if (!(r < 0 ? i.childBefore(t) : i.childAfter(t))) for (;;) {
+		if ((r < 0 ? i.to < t : i.from > t) && !i.type.isError) return r < 0 ? Math.max(0, Math.min(i.to - 1, t - 25)) : Math.min(e.length, Math.max(i.from + 1, t + 25));
+		if (r < 0 ? i.prevSibling() : i.nextSibling()) break;
+		if (!i.parent()) return r < 0 ? 0 : e.length;
 	}
 }
 var w = class {
@@ -461,24 +461,24 @@ var w = class {
 		for (;;) {
 			let t = this.trees.length - 1;
 			if (t < 0) return this.nextFragment(), null;
-			let n = this.trees[t], i = this.index[t];
-			if (i == n.children.length) {
+			let n = this.trees[t], r = this.index[t];
+			if (r == n.children.length) {
 				this.trees.pop(), this.start.pop(), this.index.pop();
 				continue;
 			}
-			let a = n.children[i], s = this.start[t] + n.positions[i];
+			let i = n.children[r], s = this.start[t] + n.positions[r];
 			if (s > e) return this.nextStart = s, null;
-			if (a instanceof r) {
+			if (i instanceof a) {
 				if (s == e) {
 					if (s < this.safeFrom) return null;
-					let e = s + a.length;
+					let e = s + i.length;
 					if (e <= this.safeTo) {
-						let t = a.prop(o.lookAhead);
-						if (!t || e + t < this.fragment.to) return a;
+						let t = i.prop(o.lookAhead);
+						if (!t || e + t < this.fragment.to) return i;
 					}
 				}
-				this.index[t]++, s + a.length >= Math.max(this.safeFrom, e) && (this.trees.push(a), this.start.push(s), this.index.push(0));
-			} else this.index[t]++, this.nextStart = s + a.length;
+				this.index[t]++, s + i.length >= Math.max(this.safeFrom, e) && (this.trees.push(i), this.start.push(s), this.index.push(0));
+			} else this.index[t]++, this.nextStart = s + i.length;
 		}
 	}
 }, T = class {
@@ -602,27 +602,27 @@ var w = class {
 		this.stoppedAt = e;
 	}
 	advanceStack(e, t, n) {
-		let i = e.pos, { parser: a } = this, s = x ? this.stackID(e) + " -> " : "";
-		if (this.stoppedAt != null && i > this.stoppedAt) return e.forceReduce() ? e : null;
+		let r = e.pos, { parser: i } = this, s = x ? this.stackID(e) + " -> " : "";
+		if (this.stoppedAt != null && r > this.stoppedAt) return e.forceReduce() ? e : null;
 		if (this.fragments) {
 			let t = e.curContext && e.curContext.tracker.strict, n = t ? e.curContext.hash : 0;
-			for (let c = this.fragments.nodeAt(i); c;) {
-				let i = this.parser.nodeSet.types[c.type.id] == c.type ? a.getGoto(e.state, c.type.id) : -1;
-				if (i > -1 && c.length && (!t || (c.prop(o.contextHash) || 0) == n)) return e.useNode(c, i), x && console.log(s + this.stackID(e) + ` (via reuse of ${a.getName(c.type.id)})`), !0;
-				if (!(c instanceof r) || c.children.length == 0 || c.positions[0] > 0) break;
+			for (let c = this.fragments.nodeAt(r); c;) {
+				let r = this.parser.nodeSet.types[c.type.id] == c.type ? i.getGoto(e.state, c.type.id) : -1;
+				if (r > -1 && c.length && (!t || (c.prop(o.contextHash) || 0) == n)) return e.useNode(c, r), x && console.log(s + this.stackID(e) + ` (via reuse of ${i.getName(c.type.id)})`), !0;
+				if (!(c instanceof a) || c.children.length == 0 || c.positions[0] > 0) break;
 				let l = c.children[0];
-				if (l instanceof r && c.positions[0] == 0) c = l;
+				if (l instanceof a && c.positions[0] == 0) c = l;
 				else break;
 			}
 		}
-		let c = a.stateSlot(e.state, 4);
-		if (c > 0) return e.reduce(c), x && console.log(s + this.stackID(e) + ` (via always-reduce ${a.getName(c & 65535)})`), !0;
+		let c = i.stateSlot(e.state, 4);
+		if (c > 0) return e.reduce(c), x && console.log(s + this.stackID(e) + ` (via always-reduce ${i.getName(c & 65535)})`), !0;
 		if (e.stack.length >= 8400) for (; e.stack.length > 6e3 && e.forceReduce(););
 		let l = this.tokens.getActions(e);
-		for (let r = 0; r < l.length;) {
-			let o = l[r++], c = l[r++], u = l[r++], d = r == l.length || !n, f = d ? e : e.split(), p = this.tokens.mainToken;
-			if (f.apply(o, c, p ? p.start : f.pos, u), x && console.log(s + this.stackID(f) + ` (via ${o & 65536 ? `reduce of ${a.getName(o & 65535)}` : "shift"} for ${a.getName(c)} @ ${i}${f == e ? "" : ", split"})`), d) return !0;
-			f.pos > i ? t.push(f) : n.push(f);
+		for (let a = 0; a < l.length;) {
+			let o = l[a++], c = l[a++], u = l[a++], d = a == l.length || !n, f = d ? e : e.split(), p = this.tokens.mainToken;
+			if (f.apply(o, c, p ? p.start : f.pos, u), x && console.log(s + this.stackID(f) + ` (via ${o & 65536 ? `reduce of ${i.getName(o & 65535)}` : "shift"} for ${i.getName(c)} @ ${r}${f == e ? "" : ", split"})`), d) return !0;
+			f.pos > r ? t.push(f) : n.push(f);
 		}
 		return !1;
 	}
@@ -646,7 +646,7 @@ var w = class {
 		return r;
 	}
 	stackToTree(e) {
-		return e.close(), r.build({
+		return e.close(), a.build({
 			buffer: u.create(e),
 			nodeSet: this.parser.nodeSet,
 			topID: this.topTerm,
@@ -683,18 +683,18 @@ var O = class {
 	constructor(e) {
 		this.start = e.start, this.shift = e.shift || k, this.reduce = e.reduce || k, this.reuse = e.reuse || k, this.hash = e.hash || (() => 0), this.strict = e.strict !== !1;
 	}
-}, j = class r extends a {
-	constructor(r) {
-		if (super(), this.wrappers = [], r.version != 14) throw RangeError(`Parser version (${r.version}) doesn't match runtime version (14)`);
-		let i = r.nodeNames.split(" ");
-		this.minRepeatTerm = i.length;
-		for (let e = 0; e < r.repeatNodeCount; e++) i.push("");
-		let a = Object.keys(r.topRules).map((e) => r.topRules[e][1]), s = [];
-		for (let e = 0; e < i.length; e++) s.push([]);
+}, j = class n extends r {
+	constructor(n) {
+		if (super(), this.wrappers = [], n.version != 14) throw RangeError(`Parser version (${n.version}) doesn't match runtime version (14)`);
+		let r = n.nodeNames.split(" ");
+		this.minRepeatTerm = r.length;
+		for (let e = 0; e < n.repeatNodeCount; e++) r.push("");
+		let a = Object.keys(n.topRules).map((e) => n.topRules[e][1]), s = [];
+		for (let e = 0; e < r.length; e++) s.push([]);
 		function c(e, t, n) {
 			s[e].push([t, t.deserialize(String(n))]);
 		}
-		if (r.nodeProps) for (let e of r.nodeProps) {
+		if (n.nodeProps) for (let e of n.nodeProps) {
 			let t = e[0];
 			typeof t == "string" && (t = o[t]);
 			for (let n = 1; n < e.length;) {
@@ -707,18 +707,18 @@ var O = class {
 				}
 			}
 		}
-		this.nodeSet = new t(i.map((e, t) => n.define({
+		this.nodeSet = new e(r.map((e, t) => i.define({
 			name: t >= this.minRepeatTerm ? void 0 : e,
 			id: t,
 			props: s[t],
 			top: a.indexOf(t) > -1,
 			error: t == 0,
-			skipped: r.skippedNodes && r.skippedNodes.indexOf(t) > -1
-		}))), r.propSources && (this.nodeSet = this.nodeSet.extend(...r.propSources)), this.strict = !1, this.bufferLength = e;
-		let l = d(r.tokenData);
-		this.context = r.context, this.specializerSpecs = r.specialized || [], this.specialized = new Uint16Array(this.specializerSpecs.length);
+			skipped: n.skippedNodes && n.skippedNodes.indexOf(t) > -1
+		}))), n.propSources && (this.nodeSet = this.nodeSet.extend(...n.propSources)), this.strict = !1, this.bufferLength = t;
+		let l = d(n.tokenData);
+		this.context = n.context, this.specializerSpecs = n.specialized || [], this.specialized = new Uint16Array(this.specializerSpecs.length);
 		for (let e = 0; e < this.specializerSpecs.length; e++) this.specialized[e] = this.specializerSpecs[e].term;
-		this.specializers = this.specializerSpecs.map(P), this.states = d(r.states, Uint32Array), this.data = d(r.stateData), this.goto = d(r.goto), this.maxTerm = r.maxTerm, this.tokenizers = r.tokenizers.map((e) => typeof e == "number" ? new h(l, e) : e), this.topRules = r.topRules, this.dialects = r.dialects || {}, this.dynamicPrecedences = r.dynamicPrecedences || null, this.tokenPrecTable = r.tokenPrec, this.termNames = r.termNames || null, this.maxNode = this.nodeSet.types.length - 1, this.dialect = this.parseDialect(), this.top = this.topRules[Object.keys(this.topRules)[0]];
+		this.specializers = this.specializerSpecs.map(P), this.states = d(n.states, Uint32Array), this.data = d(n.stateData), this.goto = d(n.goto), this.maxTerm = n.maxTerm, this.tokenizers = n.tokenizers.map((e) => typeof e == "number" ? new h(l, e) : e), this.topRules = n.topRules, this.dialects = n.dialects || {}, this.dynamicPrecedences = n.dynamicPrecedences || null, this.tokenPrecTable = n.tokenPrec, this.termNames = n.termNames || null, this.maxNode = this.nodeSet.types.length - 1, this.dialect = this.parseDialect(), this.top = this.topRules[Object.keys(this.topRules)[0]];
 	}
 	createParse(e, t, n) {
 		let r = new E(this, e, t, n);
@@ -782,7 +782,7 @@ var O = class {
 		return t;
 	}
 	configure(e) {
-		let t = Object.assign(Object.create(r.prototype), this);
+		let t = Object.assign(Object.create(n.prototype), this);
 		if (e.props && (t.nodeSet = this.nodeSet.extend(...e.props)), e.top) {
 			let n = this.topRules[e.top];
 			if (!n) throw RangeError(`Invalid top rule name ${e.top}`);
@@ -825,7 +825,7 @@ var O = class {
 		return new O(e, n, r);
 	}
 	static deserialize(e) {
-		return new r(e);
+		return new n(e);
 	}
 };
 function M(e, t) {