@oomol-lab/open-flow 0.1.0-alpha.9 → 0.1.0-beta.10

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

@@ -1,4 +1,4 @@
-import { c as e, d as t, l as n, m as r, p as i, s as a, u as o } from "./dist-CVtP-E2c.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(t, n, r) {
-	let i = t.cursor(e.IncludeAnonymous);
-	for (i.moveTo(n);;) if (!(r < 0 ? i.childBefore(n) : i.childAfter(n))) for (;;) {
-		if ((r < 0 ? i.to < n : i.from > n) && !i.type.isError) return r < 0 ? Math.max(0, Math.min(i.to - 1, n - 25)) : Math.min(t.length, Math.max(i.from + 1, n + 25));
+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 : t.length;
+		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 i = this.trees[t], a = this.index[t];
-			if (a == i.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 o = i.children[a], s = this.start[t] + i.positions[a];
+			let i = n.children[r], s = this.start[t] + n.positions[r];
 			if (s > e) return this.nextStart = s, null;
-			if (o instanceof r) {
+			if (i instanceof a) {
 				if (s == e) {
 					if (s < this.safeFrom) return null;
-					let e = s + o.length;
+					let e = s + i.length;
 					if (e <= this.safeTo) {
-						let t = o.prop(n.lookAhead);
-						if (!t || e + t < this.fragment.to) return o;
+						let t = i.prop(o.lookAhead);
+						if (!t || e + t < this.fragment.to) return i;
 					}
 				}
-				this.index[t]++, s + o.length >= Math.max(this.safeFrom, e) && (this.trees.push(o), this.start.push(s), this.index.push(0));
-			} else this.index[t]++, this.nextStart = s + o.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 {
@@ -601,28 +601,28 @@ var w = class {
 		if (this.stoppedAt != null && this.stoppedAt < e) throw RangeError("Can't move stoppedAt forward");
 		this.stoppedAt = e;
 	}
-	advanceStack(e, t, i) {
-		let a = e.pos, { parser: o } = this, s = x ? this.stackID(e) + " -> " : "";
-		if (this.stoppedAt != null && a > this.stoppedAt) return e.forceReduce() ? e : null;
+	advanceStack(e, t, n) {
+		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, i = t ? e.curContext.hash : 0;
-			for (let c = this.fragments.nodeAt(a); c;) {
-				let a = this.parser.nodeSet.types[c.type.id] == c.type ? o.getGoto(e.state, c.type.id) : -1;
-				if (a > -1 && c.length && (!t || (c.prop(n.contextHash) || 0) == i)) return e.useNode(c, a), x && console.log(s + this.stackID(e) + ` (via reuse of ${o.getName(c.type.id)})`), !0;
-				if (!(c instanceof r) || c.children.length == 0 || c.positions[0] > 0) break;
+			let t = e.curContext && e.curContext.tracker.strict, n = t ? e.curContext.hash : 0;
+			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 = o.stateSlot(e.state, 4);
-		if (c > 0) return e.reduce(c), x && console.log(s + this.stackID(e) + ` (via always-reduce ${o.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 n = 0; n < l.length;) {
-			let r = l[n++], c = l[n++], u = l[n++], d = n == l.length || !i, f = d ? e : e.split(), p = this.tokens.mainToken;
-			if (f.apply(r, c, p ? p.start : f.pos, u), x && console.log(s + this.stackID(f) + ` (via ${r & 65536 ? `reduce of ${o.getName(r & 65535)}` : "shift"} for ${o.getName(c)} @ ${a}${f == e ? "" : ", split"})`), d) return !0;
-			f.pos > a ? t.push(f) : i.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,42 +683,42 @@ 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 e extends i {
-	constructor(e) {
-		if (super(), this.wrappers = [], e.version != 14) throw RangeError(`Parser version (${e.version}) doesn't match runtime version (14)`);
-		let r = e.nodeNames.split(" ");
+}, 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 t = 0; t < e.repeatNodeCount; t++) r.push("");
-		let i = Object.keys(e.topRules).map((t) => e.topRules[t][1]), s = [];
+		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 (e.nodeProps) for (let t of e.nodeProps) {
-			let e = t[0];
-			typeof e == "string" && (e = n[e]);
-			for (let n = 1; n < t.length;) {
-				let r = t[n++];
-				if (r >= 0) c(r, e, t[n++]);
+		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;) {
+				let r = e[n++];
+				if (r >= 0) c(r, t, e[n++]);
 				else {
-					let i = t[n + -r];
-					for (let a = -r; a > 0; a--) c(t[n++], e, i);
+					let i = e[n + -r];
+					for (let a = -r; a > 0; a--) c(e[n++], t, i);
 					n++;
 				}
 			}
 		}
-		this.nodeSet = new o(r.map((n, r) => t.define({
-			name: r >= this.minRepeatTerm ? void 0 : n,
-			id: r,
-			props: s[r],
-			top: i.indexOf(r) > -1,
-			error: r == 0,
-			skipped: e.skippedNodes && e.skippedNodes.indexOf(r) > -1
-		}))), e.propSources && (this.nodeSet = this.nodeSet.extend(...e.propSources)), this.strict = !1, this.bufferLength = a;
-		let l = d(e.tokenData);
-		this.context = e.context, this.specializerSpecs = e.specialized || [], this.specialized = new Uint16Array(this.specializerSpecs.length);
+		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: 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(e.states, Uint32Array), this.data = d(e.stateData), this.goto = d(e.goto), this.maxTerm = e.maxTerm, this.tokenizers = e.tokenizers.map((e) => typeof e == "number" ? new h(l, e) : e), this.topRules = e.topRules, this.dialects = e.dialects || {}, this.dynamicPrecedences = e.dynamicPrecedences || null, this.tokenPrecTable = e.tokenPrec, this.termNames = e.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);
@@ -781,22 +781,22 @@ var O = class {
 		}
 		return t;
 	}
-	configure(t) {
-		let n = Object.assign(Object.create(e.prototype), this);
-		if (t.props && (n.nodeSet = this.nodeSet.extend(...t.props)), t.top) {
-			let e = this.topRules[t.top];
-			if (!e) throw RangeError(`Invalid top rule name ${t.top}`);
-			n.top = e;
-		}
-		return t.tokenizers && (n.tokenizers = this.tokenizers.map((e) => {
-			let n = t.tokenizers.find((t) => t.from == e);
-			return n ? n.to : e;
-		})), t.specializers && (n.specializers = this.specializers.slice(), n.specializerSpecs = this.specializerSpecs.map((e, r) => {
-			let i = t.specializers.find((t) => t.from == e.external);
-			if (!i) return e;
-			let a = Object.assign(Object.assign({}, e), { external: i.to });
-			return n.specializers[r] = P(a), a;
-		})), t.contextTracker && (n.context = t.contextTracker), t.dialect && (n.dialect = this.parseDialect(t.dialect)), t.strict != null && (n.strict = t.strict), t.wrap && (n.wrappers = n.wrappers.concat(t.wrap)), t.bufferLength != null && (n.bufferLength = t.bufferLength), n;
+	configure(e) {
+		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}`);
+			t.top = n;
+		}
+		return e.tokenizers && (t.tokenizers = this.tokenizers.map((t) => {
+			let n = e.tokenizers.find((e) => e.from == t);
+			return n ? n.to : t;
+		})), e.specializers && (t.specializers = this.specializers.slice(), t.specializerSpecs = this.specializerSpecs.map((n, r) => {
+			let i = e.specializers.find((e) => e.from == n.external);
+			if (!i) return n;
+			let a = Object.assign(Object.assign({}, n), { external: i.to });
+			return t.specializers[r] = P(a), a;
+		})), e.contextTracker && (t.context = e.contextTracker), e.dialect && (t.dialect = this.parseDialect(e.dialect)), e.strict != null && (t.strict = e.strict), e.wrap && (t.wrappers = t.wrappers.concat(e.wrap)), e.bufferLength != null && (t.bufferLength = e.bufferLength), t;
 	}
 	hasWrappers() {
 		return this.wrappers.length > 0;
@@ -824,8 +824,8 @@ var O = class {
 		for (let e = 0; e < t.length; e++) if (!n[e]) for (let n = this.dialects[t[e]], i; (i = this.data[n++]) != 65535;) (r ||= new Uint8Array(this.maxTerm + 1))[i] = 1;
 		return new O(e, n, r);
 	}
-	static deserialize(t) {
-		return new e(t);
+	static deserialize(e) {
+		return new n(e);
 	}
 };
 function M(e, t) {

package/dist/browser/dist-CP0883sY.js

@@ -0,0 +1,4 @@
+//#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
+var e = (e) => e !== void 0, t = (e) => !!e, n = (e) => e === !0 || e === !1, r = (e) => typeof e == "string", i = Array.isArray, a = (e) => typeof e == "object" && !!e, o = (e) => a(e) && !i(e), s = (e) => o(e) ? e : void 0, c = () => !0;
+//#endregion
+export { r as a, s as c, o as i, n, t as o, e as r, c as s, i as t };