@oomol-lab/open-flow 0.1.0-beta.11 → 0.1.0-beta.12

package/dist/common/scheduler.js

@@ -4503,13 +4503,34 @@ var P = Do(), Ks = Gs(), qs = k(P), Js = A({
 	name: P,
 	inputs: k(F),
 	outputs: k(Js.extend({ sources: k(j([Xs, Zs])) }))
-}), _c = {
+}), _c = A({
+	nodes: _s(P, pc),
+	edges: k(hc)
+}), vc = A({
+	kind: M(["connection", "variable"]),
+	target: P
+}), yc = A({
+	name: P,
+	imports: qs,
+	source: P
+}), bc = A({
+	bindings: _s(P, vc),
+	graph: _c,
+	subflows: _s(P, gc.extend({ graph: _c })),
+	tasks: _s(P, ic)
+});
+A({
+	modelVersion: N(1),
+	document: bc,
+	modules: _s(P, yc)
+}).extend({
+	kind: N("open-flow-flow-revision"),
+	version: N(1)
+});
+var xc = {
 	"binding.create": {
 		bindingId: P,
-		binding: A({
-			kind: M(["connection", "variable"]),
-			target: P
-		})
+		binding: vc
 	},
 	"binding.delete": { bindingId: P },
 	"binding.target.set": {
@@ -4608,11 +4629,7 @@ var P = Do(), Ks = Gs(), qs = k(P), Js = A({
 	},
 	"module.create": {
 		moduleId: P,
-		module: A({
-			name: P,
-			imports: qs,
-			source: P
-		})
+		module: yc
 	},
 	"module.delete": { moduleId: P },
 	"module.rename": {
@@ -4629,10 +4646,7 @@ var P = Do(), Ks = Gs(), qs = k(P), Js = A({
 	},
 	"subflow.create": {
 		subflowId: P,
-		subflow: gc.extend({ graph: A({
-			nodes: _s(P, pc),
-			edges: k(hc)
-		}) })
+		subflow: gc.extend({ graph: _c })
 	},
 	"subflow.definition.set": {
 		subflowId: P,
@@ -4661,56 +4675,56 @@ var P = Do(), Ks = Gs(), qs = k(P), Js = A({
 		value: P
 	}
 };
-k(j([...new Map(Object.entries(_c).map(([e, t]) => [e, t instanceof D ? t : A({
+k(j([...new Map(Object.entries(xc).map(([e, t]) => [e, t instanceof D ? t : A({
 	kind: N(e),
 	...t
 })])).values()])).min(1);
 //#endregion
 //#region src/flow/common/change.ts
-function vc(e) {
+function Sc(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
 //#endregion
 //#region src/json-schema-subset/utils.ts
-var yc = 0;
-function bc() {
-	let e = yc;
-	return yc += 1, e;
+var Cc = 0;
+function wc() {
+	let e = Cc;
+	return Cc += 1, e;
 }
-function xc(e) {
+function Tc(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) xc(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) Tc(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function Sc(e, t) {
+function Ec(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function Cc(e) {
+function Dc(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = Cc(r);
+		for (let [n, r] of e.entries()) t[n] = Dc(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = Cc(e[n]);
+		for (let n in e) t[n] = Dc(e[n]);
 		return t;
 	}
 }
-function wc(e, t) {
+function Oc(e, t) {
 	if (e === t) return !0;
 	if (typeof e != "object" || !e || typeof e != typeof t) return !1;
 	if (Array.isArray(e)) {
 		if (!Array.isArray(t) || e.length !== t.length) return !1;
-		for (let [n, r] of e.entries()) if (!wc(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!Oc(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !wc(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !Oc(e[n], t[n])) return !1;
 		for (let n in t) if (!(n in e)) return !1;
 	}
 	return !0;
@@ -4723,48 +4737,48 @@ var L = Object.freeze({
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), R = Mc(L.Equals), z = Mc(L.Containing), B = Mc(L.ContainedBy), V = Mc(L.Rejection), H = Mc(L.Intersection), Tc = xc([
+}), R = Ic(L.Equals), z = Ic(L.Containing), B = Ic(L.ContainedBy), V = Ic(L.Rejection), H = Ic(L.Intersection), kc = Tc([
 	[L.Equals, R],
 	[L.Containing, z],
 	[L.ContainedBy, B],
 	[L.Rejection, V],
 	[L.Intersection, H]
-]), Ec = (() => {
+]), Ac = (() => {
 	let e = 0;
-	for (let [t, n] of Tc) e |= n;
+	for (let [t, n] of kc) e |= n;
 	return e;
 })();
-function Dc(e) {
+function jc(e) {
 	return !!(e & R);
 }
-function Oc(e) {
+function Mc(e) {
 	return !!(e & z);
 }
-function kc(e) {
+function Nc(e) {
 	return !!(e & B);
 }
-function Ac(e) {
+function Pc(e) {
 	return !!(e & V);
 }
-function jc(e) {
+function Fc(e) {
 	return !!(e & H);
 }
-function Mc(e) {
+function Ic(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function Nc(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : Pc(t, r, e), n += 1, t) };
+function Lc(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : Rc(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function Pc(e, t, n) {
+function Rc(e, t, n) {
 	let r = 0;
-	for (let [i, a] of Tc) if (a & e) {
-		for (let [e, a] of Tc) if (a & t && (r |= n(i, e), r === Ec)) return r;
+	for (let [i, a] of kc) if (a & e) {
+		for (let [e, a] of kc) if (a & t && (r |= n(i, e), r === Ac)) return r;
 	}
 	return r;
 }
@@ -4778,59 +4792,59 @@ var U = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function Fc(e, t) {
+function zc(e, t) {
 	switch (e) {
 		case U.Save: return t[0];
-		case U.OneOf: return Lc(t);
+		case U.OneOf: return Vc(t);
 		case U.AllOf:
-		case U.AnyOf: return Rc(e, t);
+		case U.AnyOf: return Hc(e, t);
 		case U.Not:
-		case U.Swap: return zc(e, t[0]);
+		case U.Swap: return Uc(e, t[0]);
 	}
 }
-function Ic(e) {
-	return zc(U.Swap, e);
+function Bc(e) {
+	return Uc(U.Swap, e);
 }
-function Lc(e) {
+function Vc(e) {
 	if (e.length === 1) return e[0];
-	let t = Rc(U.AnyOf, e), n = [];
+	let t = Hc(U.AnyOf, e), n = [];
 	for (let t = 0; t < e.length; ++t) for (let r = t + 1; r < e.length; ++r) {
-		let i = e[t], a = e[r], o = Rc(U.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = Hc(U.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = Rc(U.AnyOf, n), i = zc(U.Not, r);
-	return Rc(U.AllOf, [t, i]);
+	let r = Hc(U.AnyOf, n), i = Uc(U.Not, r);
+	return Hc(U.AllOf, [t, i]);
 }
-function Rc(e, t) {
+function Hc(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
 		case U.AllOf:
-			n = Nc(Bc);
+			n = Lc(Wc);
 			break;
 		case U.AnyOf:
-			n = Nc(Vc);
+			n = Lc(Gc);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function zc(e, t) {
+function Uc(e, t) {
 	let n, r = 0;
 	switch (e) {
 		case U.Not:
-			n = Hc;
+			n = Kc;
 			break;
 		case U.Swap:
-			n = Uc;
+			n = qc;
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of Tc) i & t && (r |= n(e));
+	for (let [e, i] of kc) i & t && (r |= n(e));
 	return r;
 }
-function Bc(e, t) {
+function Wc(e, t) {
 	let n = 0;
 	switch (e) {
 		case L.Equals:
@@ -4919,7 +4933,7 @@ function Bc(e, t) {
 	}
 	return n;
 }
-function Vc(e, t) {
+function Gc(e, t) {
 	let n = 0;
 	switch (e) {
 		case L.Equals:
@@ -5008,7 +5022,7 @@ function Vc(e, t) {
 	}
 	return n;
 }
-function Hc(e) {
+function Kc(e) {
 	let t = 0;
 	switch (e) {
 		case L.Equals:
@@ -5027,7 +5041,7 @@ function Hc(e) {
 	}
 	return t;
 }
-function Uc(e) {
+function qc(e) {
 	let t = 0;
 	switch (e) {
 		case L.Equals:
@@ -5054,7 +5068,7 @@ var W = Object.freeze({
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), Wc = (e) => (t, n) => {
+}), Jc = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
@@ -5145,8 +5159,8 @@ var W = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = Fc(t.operator, t.results);
-		if (r === 0 && (r = B), t.willSwap && (r = Ic(r)), n) {
+		let t = e.calculation, n = e.parent, r = zc(t.operator, t.results);
+		if (r === 0 && (r = B), t.willSwap && (r = Bc(r)), n) {
 			let e = n.node.calculation, t = e.results;
 			t[n.index] = r, e.count += 1, e.count >= t.length && a.push(n.node);
 		}
@@ -5154,38 +5168,38 @@ var W = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, Gc = class extends Error {
+}, Yc = class extends Error {
 	constructor(e = []) {
-		super(Jc(e)), this.name = "SchemaError", this.items = e;
+		super(Qc(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Kc = Object.freeze({
+}, Xc = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function qc(e) {
+function Zc(e) {
 	switch (e.kind) {
-		case Kc.Compiled: {
+		case Xc.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Kc.External: return String(e.error);
+		case Xc.External: return String(e.error);
 	}
 }
-function Jc(e) {
+function Qc(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return qc(e[0]);
-		default: return `${qc(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Zc(e[0]);
+		default: return `${Zc(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Yc = /* @__PURE__ */ new Set(/* @__PURE__ */ "type.enum.const.multipleOf.maximum.exclusiveMaximum.minimum.exclusiveMinimum.maxLength.minLength.pattern.items.additionalItems.maxItems.minItems.uniqueItems.contains.maxProperties.minProperties.required.properties.patternProperties.additionalProperties.dependencies.propertyNames.if.then.else.allOf.anyOf.oneOf.not.format.contentMediaType.contentEncoding.definitions".split("."));
-function Xc(e) {
-	return Yc.has(e);
+var $c = /* @__PURE__ */ new Set(/* @__PURE__ */ "type.enum.const.multipleOf.maximum.exclusiveMaximum.minimum.exclusiveMinimum.maxLength.minLength.pattern.items.additionalItems.maxItems.minItems.uniqueItems.contains.maxProperties.minProperties.required.properties.patternProperties.additionalProperties.dependencies.propertyNames.if.then.else.allOf.anyOf.oneOf.not.format.contentMediaType.contentEncoding.definitions".split("."));
+function el(e) {
+	return $c.has(e);
 }
-function Zc(e) {
-	for (let t in e) if (Xc(t)) return !1;
+function tl(e) {
+	for (let t in e) if (el(t)) return !1;
 	return !0;
 }
 function G(e, ...t) {
@@ -5194,39 +5208,39 @@ function G(e, ...t) {
 		path: [...e.path, ...t]
 	};
 }
-function Qc(e) {
+function nl(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function $c({ path: e, errors: t }, n, ...r) {
-	t.push(el(e, r, n));
+function rl({ path: e, errors: t }, n, ...r) {
+	t.push(il(e, r, n));
 }
 function K({ path: e, warns: t }, n, ...r) {
-	t.push(el(e, r, n));
+	t.push(il(e, r, n));
 }
-function el(e, t, n) {
+function il(e, t, n) {
 	return {
-		kind: Kc.Compiled,
+		kind: Xc.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function tl(e) {
+function al(e) {
 	for (let t in e) {
 		let n = e[t];
-		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : nl(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : ol(n) && delete e[t]);
 	}
 	return e;
 }
-function nl(e) {
+function ol(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var rl = Symbol("compiledId"), il = Symbol("compiledKind"), al = Symbol("compiledPath"), ol = Symbol("validatorLoader"), q = Object.freeze({
+var sl = Symbol("compiledId"), cl = Symbol("compiledKind"), ll = Symbol("compiledPath"), ul = Symbol("validatorLoader"), q = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -5239,62 +5253,62 @@ var rl = Symbol("compiledId"), il = Symbol("compiledKind"), al = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), sl = xc(hl(q.Any, bc(), {}, () => () => !0)), cl = xc(hl(q.Never, bc(), {
+}), dl = Tc(yl(q.Any, wc(), {}, () => () => !0)), fl = Tc(yl(q.Never, wc(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function ll(e) {
-	return typeof e != "object" || !e ? !1 : rl in e;
+function pl(e) {
+	return typeof e != "object" || !e ? !1 : sl in e;
 }
-function ul(e) {
-	return typeof e != "object" || !e ? !1 : rl in e && il in e;
+function ml(e) {
+	return typeof e != "object" || !e ? !1 : sl in e && cl in e;
 }
 function J(e) {
-	return ul(e) ? e[il] : q.Extends;
+	return ml(e) ? e[cl] : q.Extends;
 }
-function dl(e) {
-	return ul(e) || ll(e) ? e[rl] : e.id;
+function hl(e) {
+	return ml(e) || pl(e) ? e[sl] : e.id;
 }
-function fl(e) {
-	return ul(e) ? e[al] : void 0;
+function gl(e) {
+	return ml(e) ? e[ll] : void 0;
 }
-function pl(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, rl, {
-		value: bc(),
+function _l(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, sl, {
+		value: wc(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
 function Y(e, t, n, r = []) {
-	return hl(e, bc(), t, n && (() => n.compile(t)), r);
+	return yl(e, wc(), t, n && (() => n.compile(t)), r);
 }
-function ml(e) {
-	return hl(q.Never, bc(), { ...e }, e[ol], e[al]);
+function vl(e) {
+	return yl(q.Never, wc(), { ...e }, e[ul], e[ll]);
 }
-function hl(e, t, n, r, i = []) {
+function yl(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[il]: {
+		[cl]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[rl]: {
+		[sl]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[al]: {
+		[ll]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[ol]: {
+		[ul]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -5311,16 +5325,16 @@ function hl(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function gl(e, t) {
-	let n = _l(e, t), r = vl(e, "maxItems", t), i = vl(e, "minItems", t), a = yl(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = bl(e, t) : t.additionalItems && K(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function bl(e, t) {
+	let n = xl(e, t), r = Sl(e, "maxItems", t), i = Sl(e, "minItems", t), a = Cl(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = wl(e, t) : t.additionalItems && K(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
 	let c = !1, l = !1;
 	if (Array.isArray(n)) {
-		r !== void 0 && r <= n.length && (n = n.splice(r), s = xl(s, e.delegate));
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = Tl(s, e.delegate));
 		let t = n.findIndex((e) => J(e) === q.Never);
-		t !== -1 && (n = n.splice(t), s = xl(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (K(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && J(s) === q.Never && (c = !0);
+		t !== -1 && (n = n.splice(t), s = Tl(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (K(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && J(s) === q.Never && (c = !0);
 	} else J(n) === q.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || K(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Y(c ? q.Never : q.Array, tl({
+	return r !== void 0 && i !== void 0 && r < i && (l || K(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Y(c ? q.Never : q.Array, al({
 		type: "array",
 		items: n,
 		contains: a,
@@ -5330,12 +5344,12 @@ function gl(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function _l(e, { items: t }) {
+function xl(e, { items: t }) {
 	if (!t) return Y(q.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = Z(G(e, "items", i), Qc(a));
+			let t = Z(G(e, "items", i), nl(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -5344,9 +5358,9 @@ function _l(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return Z(G(e, "items"), Qc(t));
+	return Z(G(e, "items"), nl(t));
 }
-function vl(e, t, n) {
+function Sl(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -5360,35 +5374,35 @@ function vl(e, t, n) {
 		return r;
 	}
 }
-function yl(e, { contains: t }) {
-	return t ? Z(G(e, "contains"), Qc(t)) : Y(q.Any, {}, e.delegate, e.path);
+function Cl(e, { contains: t }) {
+	return t ? Z(G(e, "contains"), nl(t)) : Y(q.Any, {}, e.delegate, e.path);
 }
-function bl(e, { additionalItems: t }) {
+function wl(e, { additionalItems: t }) {
 	switch (typeof t) {
 		case "boolean": return t ? Y(q.Any, {}, e.delegate, e.path) : !1;
 		case "object": return Z(G(e, "additionalItems"), t);
 		default: return Y(q.Any, {}, e.delegate, e.path);
 	}
 }
-function xl(e, t) {
+function Tl(e, t) {
 	return e === void 0 ? Y(q.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : ul(e) ? J(e) === q.Never ? e : ml(e) : e;
+	}, t) : ml(e) ? J(e) === q.Never ? e : vl(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var Sl = Object.freeze([
+var El = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function Cl(e, t, n, r) {
-	if (n.length === 0) return $c(e, "disable empty list", t), null;
+function Dl(e, t, n, r) {
+	if (n.length === 0) return rl(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = Z(G(e, t, r), Qc(a));
+		let n = Z(G(e, t, r), nl(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
@@ -5402,7 +5416,7 @@ function Cl(e, t, n, r) {
 	let s = q.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = q.Never : a === i.length ? s = q.Any : wl(i) || (s = q.Never);
+			o > 0 ? s = q.Never : a === i.length ? s = q.Any : Ol(i) || (s = q.Never);
 			break;
 		case "anyOf":
 			a > 0 ? s = q.Any : o === i.length && (s = q.Never);
@@ -5411,7 +5425,7 @@ function Cl(e, t, n, r) {
 	}
 	return Y(s, { [t]: i }, r, e.path);
 }
-function wl(e) {
+function Ol(e) {
 	let t = null;
 	for (let n of e) {
 		let e = J(n);
@@ -5431,30 +5445,30 @@ var X = Object.freeze({
 	Invalid: 1,
 	Unknown: 2
 });
-function Tl(e, t) {
+function kl(e, t) {
 	let n = e.isValid;
 	return n ? n(t) === !0 ? X.Valid : X.Invalid : X.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function El(e, t, n, r) {
+function Al(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return $c(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return rl(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (Tl(r, a)) {
+		for (let [n, a] of t.entries()) switch (kl(r, a)) {
 			case X.Valid:
-				i.push(pl(a));
+				i.push(_l(a));
 				break;
 			case X.Invalid: K(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
 		i.length === 0 && K(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && Tl(r, n) === X.Invalid && (a = !0), i) {
+	if (n && kl(r, n) === X.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (wc(t, n)) {
+			for (let t of i) if (Oc(t, n)) {
 				e = !0;
 				break;
 			}
@@ -5462,11 +5476,11 @@ function El(e, t, n, r) {
 		}
 	}
 	let o = a ? q.Never : q.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = pl(Cc(n))), Y(o, s, e.delegate, e.path);
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = _l(Dc(n))), Y(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var Dl = /* @__PURE__ */ new Set([
+var jl = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -5477,27 +5491,27 @@ var Dl = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function Ol(e, t) {
-	let n = Object.keys(t).filter((e) => !Dl.has(e) && Xc(e));
+function Ml(e, t) {
+	let n = Object.keys(t).filter((e) => !jl.has(e) && el(e));
 	n.length > 0 && K(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = kl(e, "maxProperties", t), i = kl(e, "minProperties", t), a = Al(e, t), o = jl(e, t), s = Ml(e, t), c = Pl(e, t);
+	let r = Nl(e, "maxProperties", t), i = Nl(e, "minProperties", t), a = Pl(e, t), o = Fl(e, t), s = Il(e, t), c = Rl(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = Nl(e, o, s, t);
+	let l = Ll(e, o, s, t);
 	if (!l) return null;
-	let u = Il(e, Fl(a, o, s, l), c, t);
-	return Y(Ll(e, a, l, u, r, i) ? q.Never : q.Object, tl({
+	let u = Bl(e, zl(a, o, s, l), c, t);
+	return Y(Vl(e, a, l, u, r, i) ? q.Never : q.Object, al({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: Hl(o),
-		dependencies: Ul(c, t),
+		patternProperties: Kl(o),
+		dependencies: ql(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function kl(e, t, n) {
+function Nl(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -5511,22 +5525,22 @@ function kl(e, t, n) {
 		return r;
 	}
 }
-function Al(e, { additionalProperties: t }) {
+function Pl(e, { additionalProperties: t }) {
 	return t === !1 ? Y(q.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? Z(G(e, "additionalProperties"), Qc(t)) : Y(q.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? Z(G(e, "additionalProperties"), nl(t)) : Y(q.Any, {}, e.delegate, e.path);
 }
-function jl(e, { patternProperties: t }) {
+function Fl(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = Vl(i);
+		let a = Gl(i);
 		if (a instanceof Error) {
 			K(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = Qc(t[i]), s = Z(G(e, "patternProperties", i), o);
+		let o = nl(t[i]), s = Z(G(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -5535,29 +5549,29 @@ function jl(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function Ml(e, { propertyNames: t }) {
+function Il(e, { propertyNames: t }) {
 	if (!t) return Y(q.Any, {}, e.delegate, e.path);
-	t = Qc(t);
+	t = nl(t);
 	let n = Z(G(e, "propertyNames"), t);
 	if (!n) return null;
 	let r = J(n);
-	return r !== q.String && r !== q.Any ? ml(n) : n;
+	return r !== q.String && r !== q.Any ? vl(n) : n;
 }
-function Nl(e, t, n, { properties: r }) {
+function Ll(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (Tl(n, o) === X.Invalid) {
+		if (kl(n, o) === X.Invalid) {
 			K(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = Bl(t, o);
+		let s = Wl(t, o);
 		if (s && J(s) === q.Never) {
 			K(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = Qc(r[o]), l = Z(G(e, "properties", o), c);
+		let c = nl(r[o]), l = Z(G(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -5566,40 +5580,40 @@ function Nl(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function Pl(e, { dependencies: t }) {
+function Rl(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = Qc(t[i]);
+		let a = nl(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = zl(a);
+			let { keys: t, duplicated: r } = Ul(a);
 			r && K(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
 			let t = Z(G(e, "dependencies", i), a);
 			if (t) {
 				let e = J(t);
-				r[i] = e === q.Object || e === q.Any ? t : e === q.Extends ? cl : ml(t);
+				r[i] = e === q.Object || e === q.Any ? t : e === q.Extends ? fl : vl(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function Fl(e, t, n, r) {
+function zl(e, t, n, r) {
 	return (i) => {
-		if (Tl(n, i) === X.Invalid) return !0;
-		let a = Bl(t, i);
+		if (kl(n, i) === X.Invalid) return !0;
+		let a = Wl(t, i);
 		return !!(a && J(a) === q.Never || J(r[i] ?? e) === q.Never);
 	};
 }
-function Il(e, t, n, { required: r }) {
+function Bl(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = zl(r);
+	let i = Ul(r);
 	i.duplicated && K(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) Rl(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	for (let e of i.keys) Hl(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
 	return o.length > 0 && K(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
 }
-function Ll(e, t, n, r, i, a) {
+function Vl(e, t, n, r, i, a) {
 	if (i !== void 0 && a !== void 0 && i < a) return K(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
 	if (i !== void 0 && r.length > i) return K(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
 	if (a !== void 0 && r.length < a) return K(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
@@ -5610,7 +5624,7 @@ function Ll(e, t, n, r, i, a) {
 	}
 	return !0;
 }
-function Rl([e, t], n) {
+function Hl([e, t], n) {
 	let r = [n], i = new Set(r);
 	for (; r.length > 0;) {
 		let n = r.pop(), i = t[n], o = e[n];
@@ -5621,7 +5635,7 @@ function Rl([e, t], n) {
 	}
 	return [...i];
 }
-function zl(e) {
+function Ul(e) {
 	let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
 	for (let r of e) t.has(r) ? n.add(r) : t.add(r);
 	return n.size === 0 ? {
@@ -5632,14 +5646,14 @@ function zl(e) {
 		duplicated: [...n]
 	};
 }
-function Bl(e, t) {
+function Wl(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function Vl(e) {
+function Gl(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -5647,12 +5661,12 @@ function Vl(e) {
 		throw e;
 	}
 }
-function Hl(e) {
+function Kl(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function Ul([e, t], { dependencies: n }) {
+function ql([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -5662,38 +5676,38 @@ function Ul([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var Wl = /* @__PURE__ */ new Set([
+var Jl = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Gl = /* @__PURE__ */ new Set([
+]), Yl = /* @__PURE__ */ new Set([
 	"type",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function Kl(e, t) {
+function Xl(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return ql(e, t);
-		case "string": return Yl(e, t);
+		case "integer": return Zl(e, t);
+		case "string": return $l(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => Xc(e) && e !== "type");
+			let r = Object.keys(t).filter((e) => el(e) && e !== "type");
 			return r.length > 0 && K(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Y(n === "null" ? q.Null : q.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return $c(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return rl(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function ql(e, t) {
-	let n = Object.keys(t).filter((e) => !Wl.has(e) && Xc(e));
+function Zl(e, t) {
+	let n = Object.keys(t).filter((e) => !Jl.has(e) && el(e));
 	n.length > 0 && K(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Sc(t, Wl);
-	for (let t of Wl) {
+	let r = Ec(t, Jl);
+	for (let t of Jl) {
 		let n = r[t];
 		t !== "type" && n !== void 0 && Number.isNaN(n) && (K(e, "found NaN", t), delete r[t]);
 	}
@@ -5702,38 +5716,38 @@ function ql(e, t) {
 	let { multipleOf: c } = r;
 	c === 0 && (delete r.multipleOf, r.type = "number", K(e, "cannot be 0", "multipleOf"));
 	let l = q.Numeric;
-	return Jl(r) || (l = q.Never), Y(l, r, e.delegate, e.path);
+	return Ql(r) || (l = q.Never), Y(l, r, e.delegate, e.path);
 }
-function Jl(e) {
+function Ql(e) {
 	let { maximum: t, exclusiveMaximum: n, minimum: r, exclusiveMinimum: i } = e;
 	return t !== void 0 && r !== void 0 ? t >= r : n !== void 0 && r !== void 0 ? n > r : t !== void 0 && i !== void 0 ? t > i : n !== void 0 && i !== void 0 ? n > i : !0;
 }
-function Yl(e, t) {
-	let n = Object.keys(t).filter((e) => !Gl.has(e) && Xc(e));
+function $l(e, t) {
+	let n = Object.keys(t).filter((e) => !Yl.has(e) && el(e));
 	n.length > 0 && K(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Sc(t, Gl);
-	Xl(e, r, "maxLength"), Xl(e, r, "minLength");
+	let r = Ec(t, Yl);
+	eu(e, r, "maxLength"), eu(e, r, "minLength");
 	let i = r.maxLength, a = r.minLength, o = q.String;
 	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = q.Never), Y(o, r, e.delegate, e.path);
 }
-function Xl(e, t, n) {
+function eu(e, t, n) {
 	let r = t[n];
 	r !== void 0 && Number.isNaN(r) && (K(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Zl = Object.freeze([]);
-function Ql(e, t, n, r) {
-	if (ul(e) || t.isExtendsSchema(e)) return {
+var tu = Object.freeze([]);
+function nu(e, t, n, r) {
+	if (ml(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Zl
+		warns: tu
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Kc.External,
+				kind: Xc.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -5747,18 +5761,18 @@ function Ql(e, t, n, r) {
 		errors: [],
 		warns: []
 	}, a = Z(i, e);
-	if (a) $l(i.errors.length === 0, "found errors (it should be empty)");
-	else return $l(i.errors.length > 0, "cannot found any errors"), i.errors;
+	if (a) ru(i.errors.length === 0, "found errors (it should be empty)");
+	else return ru(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function $l(e, t) {
+function ru(e, t) {
 	if (!e) throw Error(t);
 }
 function Z(e, t) {
-	if (e.extends.isExtendsSchema(t) || ul(t)) return t;
+	if (e.extends.isExtendsSchema(t) || ml(t)) return t;
 	let n = e.extends.tryCompiledExtendsSchema(t, e.payload);
 	if (n) return n;
 	let r = t, i = !1, { enum: a, const: o } = t;
@@ -5766,21 +5780,21 @@ function Z(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = eu(e, r);
-	return s && i && (s = El(e, a, o, s)), s || null;
+	let s = iu(e, r);
+	return s && i && (s = Al(e, a, o, s)), s || null;
 }
-function eu(e, t) {
-	for (let n of Sl) {
+function iu(e, t) {
+	for (let n of El) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => Xc(e) && e !== n);
-			return i.length > 0 && K(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), Cl(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => el(e) && e !== n);
+			return i.length > 0 && K(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), Dl(e, n, r) || null;
 		}
 	}
 	{
-		let n = Qc(t.not);
+		let n = nl(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => Xc(e) && e !== "not");
+			let r = Object.keys(t).filter((e) => el(e) && e !== "not");
 			r.length > 0 && K(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
 			let i = Z(G(e, "not"), n);
 			if (!i) return null;
@@ -5798,26 +5812,26 @@ function eu(e, t) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return Cl(e, "anyOf", n.map((e) => ({
+			return Dl(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return Ol(e, t);
-			case "array": return gl(e, t);
-			default: return Kl(e, t);
+			case "object": return Ml(e, t);
+			case "array": return bl(e, t);
+			default: return Xl(e, t);
 		}
 	}
-	return Zc(t) ? Y(q.Any, {}, e.delegate, e.path) : ($c(e, "unrecognized"), null);
+	return tl(t) ? Y(q.Any, {}, e.delegate, e.path) : (rl(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var tu = class {
+var au = class {
 	constructor(e) {
 		let t = Object.freeze(e.toSorted());
 		if (t.length > 32) throw Error(`cannot define ${t.length} keys which is greater than 32`);
-		this.keys = t, this.clazz = class extends nu {
+		this.keys = t, this.clazz = class extends ou {
 			constructor(e) {
 				super(t, e);
 			}
@@ -5841,7 +5855,7 @@ var tu = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, nu = class {
+}, ou = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -5856,21 +5870,21 @@ var tu = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function ru(e) {
-	return new iu(e);
+function su(e) {
+	return new cu(e);
 }
-var iu = class {
+var cu = class {
 	constructor(e) {
-		this.description = new tu(e);
+		this.description = new au(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new au(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new lu(this.description, t);
 	}
-}, au = class {
+}, lu = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -5891,7 +5905,7 @@ var iu = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of Tc) if (e & a) {
+		for (let r of this.values) for (let [i, a] of kc) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -5908,11 +5922,11 @@ var iu = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function ou(e, t) {
+function uu(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? su(e, t) : n.num > r.num ? cu(e, t) : lu(e, t);
+	return n.num < r.num ? du(e, t) : n.num > r.num ? fu(e, t) : pu(e, t);
 }
-function su(e, t) {
+function du(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -5960,7 +5974,7 @@ function su(e, t) {
 		}
 	};
 }
-function cu(e, t) {
+function fu(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -6008,7 +6022,7 @@ function cu(e, t) {
 		}
 	};
 }
-function lu(e, t) {
+function pu(e, t) {
 	let [n, r] = e, [i, a] = t, o = n.exclusive, s = i.exclusive, c, l = n;
 	if (!o && s ? (l = i, c = {
 		fromLeft: !0,
@@ -6051,8 +6065,8 @@ function Q(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var uu = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = ou([{
+var mu = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = uu([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -6082,24 +6096,24 @@ var uu = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function du({ left: e, right: t, intersection: n }) {
+function hu({ left: e, right: t, intersection: n }) {
 	if (!n) return L.Rejection;
 	let r = !1, i = !1;
 	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? L.Intersection : r ? L.Containing : i ? L.ContainedBy : L.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var fu = uu(0), pu = ru([
+var gu = mu(0), _u = su([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function mu({ calculate: e }, t, n) {
-	let r = fu(t.minItems, t.maxItems, n.minItems, n.maxItems), i = du(r);
+function vu({ calculate: e }, t, n) {
+	let r = gu(t.minItems, t.maxItems, n.minItems, n.maxItems), i = hu(r);
 	if (i === L.Rejection) return V;
-	let [a, o] = hu(t), [s, c] = hu(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = pu.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+	let [a, o] = yu(t), [s, c] = yu(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = _u.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
 	for (let t = 0; t < u; t++) {
 		let n = e(a[t] ?? o, s[t] ?? c);
 		d.push(n, (e, n) => {
@@ -6139,69 +6153,69 @@ function mu({ calculate: e }, t, n) {
 	}
 	return p;
 }
-function hu({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? sl] : [[], e ?? sl];
+function yu({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? dl] : [[], e ?? dl];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function gu(e) {
+function bu(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = ll(n);
-		return i === ll(r) ? i ? vu(t, n, r, e) : n === r : !1;
+		let i = pl(n);
+		return i === pl(r) ? i ? Su(t, n, r, e) : n === r : !1;
 	};
 }
-function _u(e) {
+function xu(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => vu(t, n, r, e);
+	return (n, r) => Su(t, n, r, e);
 }
-function vu(e, t, n, r) {
-	let i = `${dl(t)}/${dl(n)}`, a = e.get(i);
+function Su(e, t, n, r) {
+	let i = `${hl(t)}/${hl(n)}`, a = e.get(i);
 	return a === void 0 && e.set(i, a = r(t, n)), a;
 }
 //#endregion
 //#region src/json-schema-subset/checker/enumAndConst.ts
-function yu(e, t, n) {
-	let r = xu(t), i = xu(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (Su(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (Su(e, r, t) ? s = !0 : o = !0, o && s) break;
+function Cu(e, t, n) {
+	let r = Tu(t), i = Tu(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (Eu(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (Eu(e, r, t) ? s = !0 : o = !0, o && s) break;
 	return s ? a && o ? H : a ? z : o ? B : R : V;
 }
-function bu(e, t) {
+function wu(e, t) {
 	let n = !1, r = !1;
-	for (let i of xu(e)) {
-		switch (Tl(t, i)) {
+	for (let i of Tu(e)) {
+		switch (kl(t, i)) {
 			case X.Valid:
 				n = !0;
 				break;
 			case X.Invalid:
 				r = !0;
 				break;
-			case X.Unknown: return Ec;
+			case X.Unknown: return Ac;
 		}
 		if (n && r) break;
 	}
 	return n && r ? H : n ? R | B : r ? V : J(t) === q.Never ? R : B;
 }
-function xu({ const: e, enum: t }) {
+function Tu({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function Su({ isEquals: e }, t, n) {
+function Eu({ isEquals: e }, t, n) {
 	for (let r of t) if (e(r, n)) return !0;
 	return !1;
 }
 //#endregion
 //#region src/json-schema-subset/checker/equals.ts
-function Cu(e) {
+function Du(e) {
 	function t(t, n) {
 		let i = e.isExtendsSchema(t), a = e.isExtendsSchema(n);
 		return i || a ? e.equals(t, n) : r(t, n);
 	}
 	let n = /* @__PURE__ */ new Map();
 	function r(e, t) {
-		let r = dl(e), a = dl(t);
+		let r = hl(e), a = hl(t);
 		if (r === a) return !0;
 		let o = `${r}/${a}`, s = n.get(o);
 		return s === void 0 && (s = i(e, t), n.set(o, s)), s;
@@ -6218,25 +6232,25 @@ function Cu(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : ul(e) && ul(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : ml(e) && ml(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function wu(e) {
-	let t = ju(e), n = e.multipleOf ?? 1, r = Eu(t, n);
+function Ou(e) {
+	let t = Fu(e), n = e.multipleOf ?? 1, r = Au(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function Tu([e, t]) {
+function ku([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
-function Eu(e, t) {
+function Au(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = Du(n.num, t), a = Ou(r.num, t);
+	let [n, r] = e, i = ju(n.num, t), a = Mu(r.num, t);
 	if (i === n.num && n.exclusive && (i += t), a === r.num && r.exclusive && (a -= t), !(i > a) && (i !== a || i !== Infinity && i !== -Infinity)) return [{
 		num: i,
 		exclusive: !1
@@ -6245,29 +6259,29 @@ function Eu(e, t) {
 		exclusive: !1
 	}];
 }
-function Du(e, t) {
+function ju(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function Ou(e, t) {
+function Mu(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function ku(e, t) {
-	let { left: n, right: r, center: i } = ou(ju(e), ju(t));
+function Nu(e, t) {
+	let { left: n, right: r, center: i } = uu(Fu(e), Fu(t));
 	if (!i) return V;
 	let a = !1, o = !1;
 	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? H : a ? z : o ? B : R;
 }
-function Au(e, t) {
-	let n = ju(e), r = wu(t);
+function Pu(e, t) {
+	let n = Fu(e), r = Ou(t);
 	if (!r) return z;
-	let i = ou(n, r.range), a = Eu(i.center, r.multipleOf), o = Mu(i.left, r.multipleOf), s = Mu(i.right, r.multipleOf);
+	let i = uu(n, r.range), a = Au(i.center, r.multipleOf), o = Iu(i.left, r.multipleOf), s = Iu(i.right, r.multipleOf);
 	if (!i.center) return V;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !Tu(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? H : c ? z : l ? B : R;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !ku(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? H : c ? z : l ? B : R;
 }
-function ju(e) {
+function Fu(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -6289,84 +6303,84 @@ function ju(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function Mu(e, t) {
-	if (e && !e.fromLeft) return Eu(e.range, t);
+function Iu(e, t) {
+	if (e && !e.fromLeft) return Au(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function Nu(e, t) {
-	let n = wu(e), r = wu(t);
+function Lu(e, t) {
+	let n = Ou(e), r = Ou(t);
 	if (!n && !r) return R;
 	if (!n) return B;
 	if (!r) return z;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = ou(i, o), l, u = 0;
-	if (c.center && (u = Fu(a, s), l = Eu(c.center, u)), !l) return V;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = uu(i, o), l, u = 0;
+	if (c.center && (u = zu(a, s), l = Au(c.center, u)), !l) return V;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && Eu(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && Eu(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Pu(n, l, u), f ||= Pu(r, l, u), d && f ? H : d ? z : f ? B : R;
+	return p && Au(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && Au(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Ru(n, l, u), f ||= Ru(r, l, u), d && f ? H : d ? z : f ? B : R;
 }
-function Pu({ range: e, multipleOf: t }, n, r) {
-	let i = ou(e, n);
-	if (Eu(i.left?.range, t) || Eu(i.right?.range, t)) return !0;
-	let a = Eu(i.center, t);
+function Ru({ range: e, multipleOf: t }, n, r) {
+	let i = uu(e, n);
+	if (Au(i.left?.range, t) || Au(i.right?.range, t)) return !0;
+	let a = Au(i.center, t);
 	if (!a) return !1;
-	let o = Lu(n);
-	return Lu(a) > o || o !== 1 && t < r;
+	let o = Vu(n);
+	return Vu(a) > o || o !== 1 && t < r;
 }
-function Fu(e, t) {
-	return e * t / Iu(e, t);
+function zu(e, t) {
+	return e * t / Bu(e, t);
 }
-function Iu(e, t) {
-	return e === 0 ? t : Iu(t % e, e);
+function Bu(e, t) {
+	return e === 0 ? t : Bu(t % e, e);
 }
-function Lu(e) {
+function Vu(e) {
 	if (!e) return 0;
 	let [t, n] = e;
 	return n.num - t.num + 1;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/checker.ts
-function Ru(e, t) {
-	if (zu(e) || zu(t)) return Ec;
-	let n = Bu(e), r = Bu(t);
-	return n && r ? ku(e, t) : n ? Au(e, t) : r ? Ic(Au(t, e)) : Nu(e, t);
+function Hu(e, t) {
+	if (Uu(e) || Uu(t)) return Ac;
+	let n = Wu(e), r = Wu(t);
+	return n && r ? Nu(e, t) : n ? Pu(e, t) : r ? Bc(Pu(t, e)) : Lu(e, t);
 }
-function zu(e) {
+function Uu(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function Bu(e) {
+function Wu(e) {
 	let { multipleOf: t } = e;
 	return !(t !== void 0 && Number.isInteger(t) || e.type === "integer");
 }
 //#endregion
 //#region src/json-schema-subset/checker/object.ts
-var Vu = uu(0), Hu = ru([
+var Gu = mu(0), Ku = su([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function Uu(e, t, n) {
-	if (Wu(t, n)) return V;
-	let r = Gu(t, n);
+function qu(e, t, n) {
+	if (Ju(t, n)) return V;
+	let r = Yu(t, n);
 	if (!r) return V;
-	let i = Zu(t), a = Zu(n), o = (t) => {
+	let i = td(t), a = td(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return Qu(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Hu.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), qu);
-	for (let e of [...c].toSorted()) u.push(o(e), Ju);
-	for (let e of [...l].toSorted()) u.push(o(e), Yu);
+		return nd(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Ku.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), Zu);
+	for (let e of [...c].toSorted()) u.push(o(e), Qu);
+	for (let e of [...l].toSorted()) u.push(o(e), $u);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = Xu(d, f);
-		for (let e of [...Ku(t, n)].toSorted()) {
+		let r = ed(d, f);
+		for (let e of [...Xu(t, n)].toSorted()) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? sl, a = n.additionalProperties ?? sl;
-		if (Qu(i, a)) {
+		let i = t.additionalProperties ?? dl, a = n.additionalProperties ?? dl;
+		if (nd(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -6378,10 +6392,10 @@ function Uu(e, t, n) {
 	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? V : e && t ? H : e ? z : t ? B : R;
 	return m;
 }
-function Wu(e, t) {
-	return du(Vu(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === L.Rejection;
+function Ju(e, t) {
+	return hu(Gu(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === L.Rejection;
 }
-function Gu(e, t) {
+function Yu(e, t) {
 	let n = new Set(e.required), r = new Set(t.required), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = n.size, s = r.size;
 	for (let e of n) r.has(e) && i.add(e), a.add(e);
 	for (let e of r) n.has(e) && i.add(e), a.add(e);
@@ -6397,7 +6411,7 @@ function Gu(e, t) {
 		hasOptional2: u > s
 	};
 }
-function Ku(e, t) {
+function Xu(e, t) {
 	let n = new Set(e.required), r = e.properties, i = t.properties, a = e.required, o = t.required;
 	if (r) for (let e in r) n.add(e);
 	if (i) for (let e in i) n.add(e);
@@ -6405,7 +6419,7 @@ function Ku(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var qu = (e, t) => {
+var Zu = (e, t) => {
 	switch (e) {
 		case L.Equals:
 			t.hasCommonInRequired = !0;
@@ -6421,7 +6435,7 @@ var qu = (e, t) => {
 			break;
 		case L.Rejection: t.hasRejection = !0;
 	}
-}, Ju = (e, t) => {
+}, Qu = (e, t) => {
 	switch (e) {
 		case L.Equals:
 		case L.ContainedBy:
@@ -6433,7 +6447,7 @@ var qu = (e, t) => {
 			break;
 		case L.Rejection: t.hasRejection = !0;
 	}
-}, Yu = (e, t) => {
+}, $u = (e, t) => {
 	switch (e) {
 		case L.Equals:
 		case L.Containing:
@@ -6445,7 +6459,7 @@ var qu = (e, t) => {
 			break;
 		case L.Rejection: t.hasRejection = !0;
 	}
-}, Xu = (e, t) => (n, r) => {
+}, ed = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
@@ -6465,7 +6479,7 @@ var qu = (e, t) => {
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function Zu(e) {
+function td(e) {
 	let t = e.properties, n = e.propertyNames, r = e.additionalProperties, i = [];
 	if (e.patternProperties) for (let t in e.patternProperties) {
 		let n = e.patternProperties[t], r = new RegExp(t, "i");
@@ -6475,39 +6489,39 @@ function Zu(e) {
 		});
 	}
 	return (e) => {
-		if (n && Tl(n, e) === X.Invalid) return cl;
+		if (n && kl(n, e) === X.Invalid) return fl;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || sl;
+		return ((t && t[e]) ?? r) || dl;
 	};
 }
-function Qu(e, t) {
+function nd(e, t) {
 	let n = J(e), r = J(t);
 	return n !== q.Never || r !== q.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var $u = uu(0);
-function ed(e, t) {
-	let n = du($u(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+var rd = mu(0);
+function id(e, t) {
+	let n = hu(rd(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
 		case L.Rejection: return V;
-		case L.Containing: return r ? Ec : z;
-		case L.ContainedBy: return i ? Ec : B;
-		case L.Equals: return r && i ? e.pattern === t.pattern ? R : Ec : r ? R | B : i ? R | z : R;
-		case L.Intersection: return r && i ? Ec : r ? H | V | B : i ? H | V | z : H;
+		case L.Containing: return r ? Ac : z;
+		case L.ContainedBy: return i ? Ac : B;
+		case L.Equals: return r && i ? e.pattern === t.pattern ? R : Ac : r ? R | B : i ? R | z : R;
+		case L.Intersection: return r && i ? Ac : r ? H | V | B : i ? H | V | z : H;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function td(e, t, n) {
-	let r = {}, i = [], a = _u(rd(e, r)), o = nd(), s = Cu(e);
-	r.isEquals = gu(wc), r.calculate = Wc({
+function ad(e, t, n) {
+	let r = {}, i = [], a = xu(sd(e, r)), o = od(), s = Du(e);
+	r.isEquals = bu(Oc), r.calculate = Jc({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!ad(r ? Ic(n) : n)) return;
-			let a = r ? od(t, e) : od(e, t);
+			if (!ld(r ? Bc(n) : n)) return;
+			let a = r ? ud(t, e) : ud(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -6517,7 +6531,7 @@ function td(e, t, n) {
 		expression: c
 	};
 }
-var nd = () => (e) => {
+var od = () => (e) => {
 	let t;
 	switch (J(e)) {
 		case q.Not:
@@ -6529,22 +6543,22 @@ var nd = () => (e) => {
 		case q.Combination:
 			if ("allOf" in e) t = {
 				kind: W.AllOf,
-				expressions: id(e.allOf, q.Any)
+				expressions: cd(e.allOf, q.Any)
 			};
 			else if ("anyOf" in e) t = {
 				kind: W.AnyOf,
-				expressions: id(e.anyOf, q.Never)
+				expressions: cd(e.anyOf, q.Never)
 			};
 			else if ("oneOf" in e) t = {
 				kind: W.OneOf,
-				expressions: id(e.oneOf, q.Never)
+				expressions: cd(e.oneOf, q.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
 		default: t = { kind: W.Leaf };
 	}
 	return t;
-}, rd = (e, t) => (n, r) => {
+}, sd = (e, t) => (n, r) => {
 	let i = J(n), a = J(r);
 	if (i === q.Extends || a === q.Extends) return e.calculate(n, r);
 	switch (i) {
@@ -6555,28 +6569,28 @@ var nd = () => (e) => {
 		case q.Any: return B;
 		case q.Never: return z;
 	}
-	if (i === q.EnumOrConst && a === q.EnumOrConst) return yu(t, n, r);
-	if (i === q.EnumOrConst) return bu(n, r);
-	if (a === q.EnumOrConst) return Ic(bu(r, n));
+	if (i === q.EnumOrConst && a === q.EnumOrConst) return Cu(t, n, r);
+	if (i === q.EnumOrConst) return wu(n, r);
+	if (a === q.EnumOrConst) return Bc(wu(r, n));
 	if (i !== a) return V;
 	switch (i) {
 		case q.Null: return R;
-		case q.Numeric: return Ru(n, r);
-		case q.String: return ed(n, r);
+		case q.Numeric: return Hu(n, r);
+		case q.String: return id(n, r);
 		case q.Boolean: return R;
-		case q.Object: return Uu(t, n, r);
-		case q.Array: return mu(t, n, r);
+		case q.Object: return qu(t, n, r);
+		case q.Array: return vu(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function id(e, t) {
+function cd(e, t) {
 	return e.filter((e) => J(e) !== t);
 }
-function ad(e) {
-	return !Dc(e) && !kc(e) && (Oc(e) || jc(e) || Ac(e));
+function ld(e) {
+	return !jc(e) && !Nc(e) && (Mc(e) || Fc(e) || Pc(e));
 }
-function od(e, t) {
-	let n = fl(t);
+function ud(e, t) {
+	let n = gl(t);
 	if (!n) return;
 	let r = J(e), i = J(t);
 	if (r !== i) return [...n, "type"];
@@ -6609,12 +6623,12 @@ function od(e, t) {
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var sd = class e {
+var dd = class e {
 	constructor(e = []) {
 		this.extendsSchemaClasses = Object.freeze([...e]);
 	}
 	tryCompiledExtendsSchema(e, t) {
-		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(bc(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(wc(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -6624,7 +6638,7 @@ var sd = class e {
 	calculate(t, n) {
 		let r = !(t instanceof this.findMatchedClass(t, n)), i = 0, a;
 		a = r ? n.compare(t) : t.compare(n);
-		for (let t of a) r && (t = e.swap(t)), i |= Mc(t);
+		for (let t of a) r && (t = e.swap(t)), i |= Ic(t);
 		return i;
 	}
 	equals(e, t) {
@@ -6644,35 +6658,35 @@ var sd = class e {
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function cd(e, t, n = !1) {
+function fd(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw ud(e, r, "$"), new Gc(e);
+		throw md(e, r, "$"), new Yc(e);
 	}
 	let { schema: i, warns: a } = r;
 	if (n && a.length > 0) {
 		console.warn(`found ${a.length} warns after compile schema`);
-		for (let e of a) console.warn(qc(e));
+		for (let e of a) console.warn(Zc(e));
 	}
 	return i;
 }
-function ld(e, t, n, r = !1) {
+function pd(e, t, n, r = !1) {
 	let i = n(e), a = n(t);
 	if (Array.isArray(i) || Array.isArray(a)) {
 		let e = [];
-		throw Array.isArray(i) && ud(e, i, "$1"), Array.isArray(a) && ud(e, a, "$2"), new Gc(e);
+		throw Array.isArray(i) && md(e, i, "$1"), Array.isArray(a) && md(e, a, "$2"), new Yc(e);
 	}
 	let { schema: o, warns: s } = i, { schema: c, warns: l } = a;
 	if (r) {
 		s.length > 0 && console.warn(`found ${s.length} warns after compile superSchema`);
-		for (let e of s) console.warn(qc(e));
+		for (let e of s) console.warn(Zc(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(qc(e));
+		for (let e of l) console.warn(Zc(e));
 	}
 	return [o, c];
 }
-function ud(e, t, n) {
+function md(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -6683,74 +6697,74 @@ function ud(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var dd = Object.freeze({
+var hd = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function fd({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new sd(e);
+function gd({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new dd(e);
 	return Object.freeze({
-		compile: (e, r, i) => cd(e, (e) => Ql(e, n, r, t), i),
+		compile: (e, r, i) => fd(e, (e) => nu(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = ld(e, r, (e) => Ql(e, n, void 0, t), i), { errorPath: s, expression: c } = td(n, a, o), l = Dc(c) || kc(c), u = Oc(c) || jc(c) || Ac(c);
-			return l && !u ? { result: dd.True } : !l && u ? {
+			let [a, o] = pd(e, r, (e) => nu(e, n, void 0, t), i), { errorPath: s, expression: c } = ad(n, a, o), l = jc(c) || Nc(c), u = Mc(c) || Fc(c) || Pc(c);
+			return l && !u ? { result: hd.True } : !l && u ? {
 				errorPath: s,
-				result: dd.False
-			} : { result: dd.Unknown };
+				result: hd.False
+			} : { result: hd.Unknown };
 		}
 	});
 }
 //#endregion
 //#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
-var pd = (e) => e !== void 0, md = (e) => typeof e == "string", hd = Array.isArray, gd = (e) => typeof e == "object" && !!e, _d = (e) => gd(e) && !hd(e), $ = (e) => _d(e) ? e : void 0;
+var _d = (e) => e !== void 0, vd = (e) => typeof e == "string", yd = Array.isArray, bd = (e) => typeof e == "object" && !!e, xd = (e) => bd(e) && !yd(e), $ = (e) => xd(e) ? e : void 0;
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
-function vd(e) {
+function Sd(e) {
 	return $(e)?.type === "string";
 }
-function yd(e) {
-	return e instanceof Ed || $(e)?.type === "array";
+function Cd(e) {
+	return e instanceof Ad || $(e)?.type === "array";
 }
-function bd(e) {
+function wd(e) {
 	let t = $(e);
 	return t?.type === "array" && $(t.items)?.type === "string";
 }
-function xd(e) {
+function Td(e) {
 	let t = $(e);
 	return t != null && Object.keys(t).length === 0;
 }
-function Sd(e) {
+function Ed(e) {
 	let t = $(e), n = $(t?.error);
-	if (t == null || n == null || t.packageId != null && !md(t.packageId) || n.message != null && !md(n.message)) throw TypeError("Invalid schema comparison context.");
+	if (t == null || n == null || t.packageId != null && !vd(t.packageId) || n.message != null && !vd(n.message)) throw TypeError("Invalid schema comparison context.");
 }
-function Cd(e) {
-	return e == null ? { error: {} } : (Sd(e), e);
+function Dd(e) {
+	return e == null ? { error: {} } : (Ed(e), e);
 }
-var wd = class e {
+var Od = class e {
 	static setError(t, n, r) {
 		t instanceof e ? t.context.error.message = r : n instanceof e && (n.context.error.message = r);
 	}
 	constructor(e, t, n) {
-		this.id = e, this.value = t, this.context = Cd(n);
+		this.id = e, this.value = t, this.context = Dd(n);
 	}
 	compare(e) {
 		return this.passThrough(e) || this.compareImpl(e);
 	}
 	passThrough(e) {
-		if (e instanceof Od) return [L.Equals];
+		if (e instanceof Md) return [L.Equals];
 	}
-}, Td = class e extends wd {
+}, kd = class e extends Od {
 	static isMatch(e) {
 		let t = $(e)?.enum;
-		return Array.isArray(t) && t.every((e) => md(e));
+		return Array.isArray(t) && t.every((e) => vd(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid single-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (vd(t)) return [L.ContainedBy];
+		if (Sd(t)) return [L.ContainedBy];
 		if (t instanceof e) {
 			let e = new Set(this.value.enum), n = L.Equals;
 			for (let r of t.value.enum) e.has(r) || (n = L.ContainedBy), e.delete(r);
@@ -6769,17 +6783,17 @@ var wd = class e {
 		}
 		return !1;
 	}
-}, Ed = class e extends wd {
+}, Ad = class e extends Od {
 	static isMatch(e) {
 		let t = $(e), n = $(t?.items)?.enum;
-		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => md(e));
+		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => vd(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid multi-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (t instanceof Dd || bd(t)) return [L.ContainedBy];
+		if (t instanceof jd || wd(t)) return [L.ContainedBy];
 		if (t instanceof e) {
 			let e = new Set(this.value.items.enum), n = L.Equals;
 			for (let r of t.value.items.enum) e.has(r) || (n = L.ContainedBy), e.delete(r);
@@ -6798,24 +6812,24 @@ var wd = class e {
 		}
 		return !1;
 	}
-}, Dd = class e extends wd {
+}, jd = class e extends Od {
 	static isMatch(e) {
 		let t = $(e);
-		return t?.type === "array" && !t.uniqueItems && (!pd(t.items) || xd(t.items));
+		return t?.type === "array" && !t.uniqueItems && (!_d(t.items) || Td(t.items));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid array schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e || yd(t) ? [L.Equals] : [L.Rejection];
+		return t instanceof e || Cd(t) ? [L.Equals] : [L.Rejection];
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, Od = class e extends wd {
+}, Md = class e extends Od {
 	static isMatch(e) {
-		return xd(e);
+		return Td(e);
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid empty schema.");
@@ -6827,7 +6841,7 @@ var wd = class e {
 	equals(e) {
 		return !0;
 	}
-}, kd = class e extends wd {
+}, Nd = class e extends Od {
 	static isMatch(e) {
 		return $(e)?.contentMediaType === "oomol/bin";
 	}
@@ -6836,12 +6850,12 @@ var wd = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [L.Equals] : (wd.setError(this, t, "edgeError.binDiffType"), [L.Rejection]);
+		return t instanceof e ? [L.Equals] : (Od.setError(this, t, "edgeError.binDiffType"), [L.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, Ad = class e extends wd {
+}, Pd = class e extends Od {
 	static isMatch(e) {
 		return $(e)?.contentMediaType === "oomol/artifact";
 	}
@@ -6850,40 +6864,40 @@ var wd = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [L.Equals] : (wd.setError(this, t, "edgeError.artifactDiffType"), [L.Rejection]);
+		return t instanceof e ? [L.Equals] : (Od.setError(this, t, "edgeError.artifactDiffType"), [L.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
-function jd() {
-	return fd({ extendsSchemaClasses: [
-		Dd,
-		Od,
-		Td,
-		Ed,
+function Fd() {
+	return gd({ extendsSchemaClasses: [
+		jd,
+		Md,
 		kd,
-		Ad
+		Ad,
+		Nd,
+		Pd
 	] });
 }
-jd();
+Fd();
 //#endregion
 //#region src/flow/common/schema.ts
-function Md(e, t) {
+function Id(e, t) {
 	if (e === t) return !0;
 	if (e == null || t == null || typeof e != "object" || typeof t != "object") return !1;
-	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => Md(e, t[n]));
+	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => Id(e, t[n]));
 	let n = Object.entries(e), r = t;
-	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && Md(t, r[e]));
+	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && Id(t, r[e]));
 }
-function Nd(e) {
+function Ld(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
-function Pd(e) {
+function Rd(e) {
 	return Array.isArray(e) ? e : void 0;
 }
-function Fd(e, t) {
-	if (Array.isArray(e)) return e.some((e) => Fd(e, t));
+function zd(e, t) {
+	if (Array.isArray(e)) return e.some((e) => zd(e, t));
 	switch (e) {
 		case void 0: return !0;
 		case "null": return t == null;
@@ -6896,18 +6910,18 @@ function Fd(e, t) {
 		default: return !1;
 	}
 }
-function Id(e, t) {
+function Bd(e, t) {
 	if (typeof t == "boolean") return t;
-	let n = Nd(t);
+	let n = Ld(t);
 	if (n == null) return !1;
-	let r = Pd(n.allOf);
-	if (r != null && !r.every((t) => Id(e, t))) return !1;
-	let i = Pd(n.anyOf);
-	if (i != null && !i.some((t) => Id(e, t))) return !1;
-	let a = Pd(n.oneOf);
-	if (a != null && a.filter((t) => Id(e, t)).length != 1 || n.not != null && Id(e, n.not) || n.const != null && !Md(e, n.const)) return !1;
-	let o = Pd(n.enum);
-	if (o != null && !o.some((t) => Md(e, t)) || !Fd(n.type, e)) return !1;
+	let r = Rd(n.allOf);
+	if (r != null && !r.every((t) => Bd(e, t))) return !1;
+	let i = Rd(n.anyOf);
+	if (i != null && !i.some((t) => Bd(e, t))) return !1;
+	let a = Rd(n.oneOf);
+	if (a != null && a.filter((t) => Bd(e, t)).length != 1 || n.not != null && Bd(e, n.not) || n.const != null && !Id(e, n.const)) return !1;
+	let o = Rd(n.enum);
+	if (o != null && !o.some((t) => Id(e, t)) || !zd(n.type, e)) return !1;
 	if (typeof e == "string") {
 		if (typeof n.minLength == "number" && e.length < n.minLength || typeof n.maxLength == "number" && e.length > n.maxLength) return !1;
 		if (typeof n.pattern == "string") try {
@@ -6916,25 +6930,25 @@ function Id(e, t) {
 			return !1;
 		}
 	}
-	if (typeof e == "number" && (typeof n.minimum == "number" && e < n.minimum || typeof n.maximum == "number" && e > n.maximum || typeof n.exclusiveMinimum == "number" && e <= n.exclusiveMinimum || typeof n.exclusiveMaximum == "number" && e >= n.exclusiveMaximum) || Array.isArray(e) && (typeof n.minItems == "number" && e.length < n.minItems || typeof n.maxItems == "number" && e.length > n.maxItems || n.items != null && !e.every((e) => Id(e, n.items)))) return !1;
+	if (typeof e == "number" && (typeof n.minimum == "number" && e < n.minimum || typeof n.maximum == "number" && e > n.maximum || typeof n.exclusiveMinimum == "number" && e <= n.exclusiveMinimum || typeof n.exclusiveMaximum == "number" && e >= n.exclusiveMaximum) || Array.isArray(e) && (typeof n.minItems == "number" && e.length < n.minItems || typeof n.maxItems == "number" && e.length > n.maxItems || n.items != null && !e.every((e) => Bd(e, n.items)))) return !1;
 	if (typeof e == "object" && e && !Array.isArray(e)) {
-		let t = e, r = Pd(n.required);
+		let t = e, r = Rd(n.required);
 		if (r != null && r.some((e) => typeof e != "string" || !Object.hasOwn(t, e))) return !1;
-		let i = Nd(n.properties ?? {});
+		let i = Ld(n.properties ?? {});
 		if (i == null) return !1;
 		for (let [e, r] of Object.entries(t)) {
 			let t = i[e];
 			if (t != null) {
-				if (!Id(r, t)) return !1;
+				if (!Bd(r, t)) return !1;
 			} else if (n.additionalProperties === !1) return !1;
-			else if (n.additionalProperties != null && n.additionalProperties !== !0 && !Id(r, n.additionalProperties)) return !1;
+			else if (n.additionalProperties != null && n.additionalProperties !== !0 && !Bd(r, n.additionalProperties)) return !1;
 		}
 	}
 	return !0;
 }
 //#endregion
 //#region src/flow/common/graph.ts
-function Ld(e) {
+function Vd(e) {
 	let t = new Map(Object.keys(e.nodes).map((e) => [e, /* @__PURE__ */ new Set()])), n = /* @__PURE__ */ new Map();
 	for (let r of e.edges) {
 		if (!t.has(r.source) || !t.has(r.target)) continue;
@@ -6955,38 +6969,38 @@ function Ld(e) {
 }
 //#endregion
 //#region src/execution/common/scheduler.ts
-function Rd(e, t) {
+function Hd(e, t) {
 	return t?.(e) ?? {
 		code: "node.failed",
 		message: e instanceof Error ? e.message : String(e)
 	};
 }
-var zd = "notification:";
-function Bd(e) {
-	return `${zd}${e}`;
+var Ud = "notification:";
+function Wd(e) {
+	return `${Ud}${e}`;
 }
-function Vd(e) {
+function Gd(e) {
 	return e.kind != "wait" || e.notification == null ? e.inputs : {
 		...e.inputs,
-		...Object.fromEntries(Object.entries(e.notification.inputs).map(([e, t]) => [Bd(e), t]))
+		...Object.fromEntries(Object.entries(e.notification.inputs).map(([e, t]) => [Wd(e), t]))
 	};
 }
-function Hd(e, t) {
+function Kd(e, t) {
 	switch (t.kind) {
 		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
-		case "subflow": return vc(e.subflows[t.subflowId].inputs);
-		case "task": return vc([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
+		case "subflow": return Sc(e.subflows[t.subflowId].inputs);
+		case "task": return Sc([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
 		case "wait": {
 			let n = t.notification, r = n == null ? void 0 : e.tasks[n.taskId];
 			return {
 				[t.input.handle]: t.input,
-				...n == null || r == null ? {} : Object.fromEntries(r.inputs.flatMap((e) => "handle" in e && e.handle != n.messageHandle ? [[Bd(e.handle), e]] : []))
+				...n == null || r == null ? {} : Object.fromEntries(r.inputs.flatMap((e) => "handle" in e && e.handle != n.messageHandle ? [[Wd(e.handle), e]] : []))
 			};
 		}
 	}
 }
-function Ud(e, t) {
+function qd(e, t) {
 	if (t.name != null) return t.name;
 	switch (t.kind) {
 		case "condition": return;
@@ -6996,31 +7010,31 @@ function Ud(e, t) {
 		case "wait": return "Wait";
 	}
 }
-function Wd(e, t) {
+function Jd(e, t) {
 	return t.kind == "task" ? t.task == null ? e.tasks[t.taskId].executor.kind : "javascript" : t.kind;
 }
-function Gd(e, t) {
+function Yd(e, t) {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw Error(`${t} must be an object.`);
 	return e;
 }
-function Kd(e, t, n) {
+function Xd(e, t, n) {
 	let r = Object.keys(e);
 	if (r.length != t.length || r.some((e) => !t.includes(e))) throw Error(`${n} contains unsupported fields.`);
 }
-function qd(e, t) {
+function Zd(e, t) {
 	if (typeof e != "string" || e.length == 0) throw Error(`${t} must be a non-empty string.`);
 	return e;
 }
-function Jd(e, t, n = 0) {
+function Qd(e, t, n = 0) {
 	if (n > 64) throw Error(`${t} exceeds the maximum JSON depth.`);
 	if (e === null || typeof e == "boolean" || typeof e == "string" || typeof e == "number" && Number.isFinite(e)) return e;
-	if (Array.isArray(e)) return e.map((e) => Jd(e, t, n + 1));
-	let r = Gd(e, t);
-	return Object.fromEntries(Object.entries(r).map(([e, r]) => [e, Jd(r, t, n + 1)]));
+	if (Array.isArray(e)) return e.map((e) => Qd(e, t, n + 1));
+	let r = Yd(e, t);
+	return Object.fromEntries(Object.entries(r).map(([e, r]) => [e, Qd(r, t, n + 1)]));
 }
-function Yd(e) {
-	let t = Gd(e, "Flow Run checkpoint");
-	if (Kd(t, [
+function $d(e) {
+	let t = Yd(e, "Flow Run checkpoint");
+	if (Xd(t, [
 		"bindingValues",
 		"inputs",
 		"results",
@@ -7028,27 +7042,27 @@ function Yd(e) {
 		"version",
 		"wait"
 	], "Flow Run checkpoint"), t.version != 1) throw Error("Flow Run checkpoint version is unsupported.");
-	let n = Object.fromEntries(Object.entries(Gd(t.bindingValues, "Checkpoint bindings")).map(([e, t]) => {
+	let n = Object.fromEntries(Object.entries(Yd(t.bindingValues, "Checkpoint bindings")).map(([e, t]) => {
 		if (typeof t != "string") throw Error("Checkpoint binding must be a string.");
 		return [e, t];
-	})), r = Object.fromEntries(Object.entries(Gd(t.inputs, "Checkpoint inputs")).map(([e, t]) => [e, Object.fromEntries(Object.entries(Gd(t, "Checkpoint node inputs")).map(([e, t]) => [e, Jd(t, "Checkpoint input")]))])), i = Object.fromEntries(Object.entries(Gd(t.results, "Checkpoint results")).map(([e, t]) => {
-		let n = Gd(t, "Checkpoint result");
-		return Kd(n, ["jobId", "outputs"], "Checkpoint result"), [e, {
-			jobId: qd(n.jobId, "Checkpoint job ID"),
-			outputs: Object.fromEntries(Object.entries(Gd(n.outputs, "Checkpoint outputs")).map(([e, t]) => [e, Jd(t, "Checkpoint output")]))
+	})), r = Object.fromEntries(Object.entries(Yd(t.inputs, "Checkpoint inputs")).map(([e, t]) => [e, Object.fromEntries(Object.entries(Yd(t, "Checkpoint node inputs")).map(([e, t]) => [e, Qd(t, "Checkpoint input")]))])), i = Object.fromEntries(Object.entries(Yd(t.results, "Checkpoint results")).map(([e, t]) => {
+		let n = Yd(t, "Checkpoint result");
+		return Xd(n, ["jobId", "outputs"], "Checkpoint result"), [e, {
+			jobId: Zd(n.jobId, "Checkpoint job ID"),
+			outputs: Object.fromEntries(Object.entries(Yd(n.outputs, "Checkpoint outputs")).map(([e, t]) => [e, Qd(t, "Checkpoint output")]))
 		}];
 	}));
 	if (!Array.isArray(t.skipped)) throw Error("Checkpoint skipped nodes must be an array.");
-	let a = t.skipped.map((e) => qd(e, "Checkpoint skipped node"));
+	let a = t.skipped.map((e) => Zd(e, "Checkpoint skipped node"));
 	if (new Set(a).size != a.length || a.some((e) => i[e] != null)) throw Error("Checkpoint node states conflict.");
-	let o = Gd(t.wait, "Checkpoint wait");
-	Kd(o, [
+	let o = Yd(t.wait, "Checkpoint wait");
+	Xd(o, [
 		"jobId",
 		"nodeId",
 		"value",
 		"waitId"
 	], "Checkpoint wait");
-	let s = qd(o.nodeId, "Checkpoint wait node");
+	let s = Zd(o.nodeId, "Checkpoint wait node");
 	if (i[s] != null || a.includes(s)) throw Error("Checkpoint Wait is already settled.");
 	return {
 		bindingValues: n,
@@ -7058,24 +7072,24 @@ function Yd(e) {
 		version: 1,
 		wait: {
 			nodeId: s,
-			jobId: qd(o.jobId, "Checkpoint Wait job"),
-			value: Jd(o.value, "Checkpoint Wait value"),
-			waitId: qd(o.waitId, "Checkpoint Wait ID")
+			jobId: Zd(o.jobId, "Checkpoint Wait job"),
+			value: Qd(o.value, "Checkpoint Wait value"),
+			waitId: Zd(o.waitId, "Checkpoint Wait ID")
 		}
 	};
 }
-function Xd(e, t) {
+function ef(e, t) {
 	if (e === t) return !0;
 	if (e == null || t == null || typeof e != "object" || typeof t != "object") return !1;
-	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => Xd(e, t[n]));
+	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => ef(e, t[n]));
 	let n = Object.entries(e), r = Object.entries(t), i = t;
-	return n.length == r.length && n.every(([e, t]) => Object.hasOwn(i, e) && Xd(t, i[e]));
+	return n.length == r.length && n.every(([e, t]) => Object.hasOwn(i, e) && ef(t, i[e]));
 }
-function Zd(e, t, n) {
+function tf(e, t, n) {
 	let r = Object.hasOwn(n, t.input) ? n[t.input] : null, i = t.value;
 	switch (t.operator) {
-		case "==": return i !== void 0 && Xd(r, i);
-		case "!=": return i !== void 0 && !Xd(r, i);
+		case "==": return i !== void 0 && ef(r, i);
+		case "!=": return i !== void 0 && !ef(r, i);
 		case ">": return typeof r == "number" && typeof i == "number" && r > i;
 		case ">=": return typeof r == "number" && typeof i == "number" && r >= i;
 		case "<": return typeof r == "number" && typeof i == "number" && r < i;
@@ -7083,7 +7097,7 @@ function Zd(e, t, n) {
 		case "contains":
 		case "notContains": {
 			let e;
-			return typeof r == "string" && typeof i == "string" ? e = r.includes(i) : Array.isArray(r) && i !== void 0 && (e = r.some((e) => Xd(e, i))), e == null ? !1 : t.operator == "contains" ? e : !e;
+			return typeof r == "string" && typeof i == "string" ? e = r.includes(i) : Array.isArray(r) && i !== void 0 && (e = r.some((e) => ef(e, i))), e == null ? !1 : t.operator == "contains" ? e : !e;
 		}
 		case "startsWith": return typeof r == "string" && typeof i == "string" && r.startsWith(i);
 		case "endsWith": return typeof r == "string" && typeof i == "string" && r.endsWith(i);
@@ -7096,7 +7110,7 @@ function Zd(e, t, n) {
 		case "hasValue":
 		case "notHasValue": {
 			if (r == null || Array.isArray(r) || typeof r != "object" || i === void 0) return !1;
-			let e = Object.values(r).some((e) => Xd(e, i));
+			let e = Object.values(r).some((e) => ef(e, i));
 			return t.operator == "hasValue" ? e : !e;
 		}
 		case "isEmpty":
@@ -7110,12 +7124,12 @@ function Zd(e, t, n) {
 		case "isFalse": return r === !1;
 	}
 }
-function Qd(e, t) {
+function nf(e, t) {
 	if (e === void 0) return {};
 	if (typeof e != "object" || !e || Array.isArray(e)) throw Error(`Node "${t}" must return an object.`);
 	return e;
 }
-function $d(r, a, o, s, c, l = {}, u, d) {
+function rf(r, a, o, s, c, l = {}, u, d) {
 	return e.scoped(e.gen(function* () {
 		d ?? (yield* r.emit({
 			flowId: a.flowId,
@@ -7126,7 +7140,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 			runId: o,
 			type: "run.started"
 		}));
-		let f = Ld(a.graph).filter((e) => "inputs" in a.graph.nodes[e]), p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map();
+		let f = Vd(a.graph).filter((e) => "inputs" in a.graph.nodes[e]), p = /* @__PURE__ */ new Map(), m = /* @__PURE__ */ new Map();
 		for (let e of a.graph.edges) {
 			let t = p.get(e.target) ?? [];
 			t.push(e), p.set(e.target, t);
@@ -7158,13 +7172,13 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 				if (t.length != 1) throw Error(`${i} requires exactly one available source.`);
 				a = t[0];
 			}
-			if (a === void 0 && t.nullable && (a = null), a === void 0 || !(a === null && t.nullable) && !Id(a, t.jsonSchema)) throw Error(`${i} does not match its declared schema.`);
+			if (a === void 0 && t.nullable && (a = null), a === void 0 || !(a === null && t.nullable) && !Bd(a, t.jsonSchema)) throw Error(`${i} does not match its declared schema.`);
 			return a;
 		}, de = (e, t, n) => {
-			let i = Qd(Jd(n === void 0 ? {} : n, `Node "${e}" outputs`), e), a = t.kind == "task" ? vc(t.task == null ? r.prepared.tasks[t.taskId].outputs : t.task.outputs) : t.kind == "subflow" ? vc(r.prepared.subflows[t.subflowId].outputs) : t.kind == "value" ? vc(t.values) : Object.fromEntries((t.kind == "wait" ? t.actions : [...t.cases.map((e) => e.output), ...t.defaultOutput == null ? [] : [t.defaultOutput]]).map((e) => [e, t.input]));
+			let i = nf(Qd(n === void 0 ? {} : n, `Node "${e}" outputs`), e), a = t.kind == "task" ? Sc(t.task == null ? r.prepared.tasks[t.taskId].outputs : t.task.outputs) : t.kind == "subflow" ? Sc(r.prepared.subflows[t.subflowId].outputs) : t.kind == "value" ? Sc(t.values) : Object.fromEntries((t.kind == "wait" ? t.actions : [...t.cases.map((e) => e.output), ...t.defaultOutput == null ? [] : [t.defaultOutput]]).map((e) => [e, t.input]));
 			for (let [t, n] of Object.entries(i)) {
 				let r = a[t];
-				if (r == null || !(n === null && r.nullable) && !Id(n, r.jsonSchema)) throw Error(`Node "${e}" output "${t}" does not match its declaration.`);
+				if (r == null || !(n === null && r.nullable) && !Bd(n, r.jsonSchema)) throw Error(`Node "${e}" output "${t}" does not match its declaration.`);
 			}
 			if (t.kind != "condition" && t.kind != "wait") {
 				for (let t of Object.keys(a)) if (!Object.hasOwn(i, t)) throw Error(`Node "${e}" did not return output "${t}".`);
@@ -7187,7 +7201,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 			});
 		})), pe, me = (t, n, i, s) => {
 			let c = e.gen(function* () {
-				let c = Wd(r.prepared, n), l = Ud(r.prepared, n), u = Object.fromEntries(Object.entries(s).filter(([e]) => {
+				let c = Jd(r.prepared, n), l = qd(r.prepared, n), u = Object.fromEntries(Object.entries(s).filter(([e]) => {
 					if (n.kind == "wait") return e == n.input.handle;
 					let t = n.inputs[e];
 					return t?.kind != "sources" || t.sources.every((e) => e.kind != "binding");
@@ -7206,7 +7220,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 					case "condition": {
 						let e = n.cases.find((e) => {
 							if (e.expressions.length == 0) return !1;
-							let t = e.expressions.map((e) => Zd(n, e, s));
+							let t = e.expressions.map((e) => tf(n, e, s));
 							return e.relation == "all" ? t.every(Boolean) : t.some(Boolean);
 						})?.output ?? n.defaultOutput;
 						d = e == null ? {} : { [e]: s[n.input.handle] ?? null };
@@ -7217,7 +7231,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 						break;
 					case "subflow": {
 						let e = r.prepared.subflows[n.subflowId];
-						d = yield* $d(r, {
+						d = yield* rf(r, {
 							flowId: n.subflowId,
 							graph: e.graph,
 							kind: "subflow"
@@ -7229,7 +7243,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 					}
 					case "task": {
 						let e = new Set((n.additionalInputs ?? []).map((e) => e.handle));
-						d = Qd(yield* r.invokeTask({
+						d = nf(yield* r.invokeTask({
 							additionalInputs: Object.fromEntries(Object.entries(s).filter(([t]) => e.has(t))),
 							blockId: n.task == null ? n.taskId : n.task.moduleId,
 							flowId: a.flowId,
@@ -7274,8 +7288,8 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 			n.kind == "wait" && (ce = !0), ae(e.gen(function* () {
 				let a = yield* e.try({
 					try: () => {
-						let e = Vd(n);
-						return Object.fromEntries(Object.entries(Hd(r.prepared, n)).map(([n, r]) => [n, ue(e[n], r, re[t]?.[n], `Node "${t}" input "${n}"`)]));
+						let e = Gd(n);
+						return Object.fromEntries(Object.entries(Kd(r.prepared, n)).map(([n, r]) => [n, ue(e[n], r, re[t]?.[n], `Node "${t}" input "${n}"`)]));
 					},
 					catch: (e) => e instanceof Error ? e : Error(String(e))
 				});
@@ -7301,7 +7315,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 							waitId: s
 						},
 						...n.notification == null ? {} : { notification: {
-							input: Object.fromEntries(Object.entries(a).filter(([e]) => e.startsWith(zd)).map(([e, t]) => [e.slice(13), t])),
+							input: Object.fromEntries(Object.entries(a).filter(([e]) => e.startsWith(Ud)).map(([e, t]) => [e.slice(13), t])),
 							messageHandle: n.notification.messageHandle,
 							taskId: n.notification.taskId
 						} }
@@ -7313,7 +7327,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 				for (let e of m.get(t) ?? []) pe(e);
 			}).pipe(e.tapError((n) => e.gen(function* () {
 				oe ?? (se ??= n), yield* r.emit({
-					...Rd(n, r.projectFailure),
+					...Hd(n, r.projectFailure),
 					jobId: c,
 					nodeId: t,
 					runId: o,
@@ -7348,7 +7362,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 					if (a.kind == "flow" && e != 1) throw Error("Checkpoint must contain exactly one selected Trigger.");
 					for (let [e, t] of Object.entries(re)) {
 						let n = a.graph.nodes[e];
-						if (!("inputs" in n) || Object.keys(t).some((e) => Hd(r.prepared, n)[e] == null)) throw Error("Checkpoint launch inputs do not match the prepared graph.");
+						if (!("inputs" in n) || Object.keys(t).some((e) => Kd(r.prepared, n)[e] == null)) throw Error("Checkpoint launch inputs do not match the prepared graph.");
 					}
 				},
 				catch: (e) => e instanceof Error ? e : Error(String(e))
@@ -7398,7 +7412,7 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 					type: "run.failed"
 				}), yield* e.fail(/* @__PURE__ */ Error(`run.checkpoint-too-large: ${t}`));
 			}
-			let d = Yd(JSON.parse(u));
+			let d = $d(JSON.parse(u));
 			return {
 				...n,
 				checkpoint: d
@@ -7442,15 +7456,15 @@ function $d(r, a, o, s, c, l = {}, u, d) {
 		}), ge;
 	}));
 }
-function ef(t, n) {
+function af(t, n) {
 	let r = n.emit ?? (() => e.void);
 	return e.gen(function* () {
 		if (n.resume != null && (n.inputs != null || n.trigger != null)) return yield* e.fail(/* @__PURE__ */ Error("A resumed Flow Run cannot accept launch inputs or a Trigger seed."));
-		let i = n.resume == null ? void 0 : Yd(n.resume.checkpoint);
+		let i = n.resume == null ? void 0 : $d(n.resume.checkpoint);
 		if (i != null && new TextEncoder().encode(JSON.stringify(i)).byteLength > 16777216) return yield* e.fail(/* @__PURE__ */ Error("Flow Run checkpoint exceeds 16 MiB."));
 		if (i == null && n.trigger == null) return yield* e.fail(/* @__PURE__ */ Error("A Flow Run requires a Trigger seed."));
 		let a = n.trigger == null ? void 0 : t.graph.nodes[n.trigger.nodeId];
-		return n.trigger != null && (a == null || "inputs" in a) ? yield* e.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* $d({
+		return n.trigger != null && (a == null || "inputs" in a) ? yield* e.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* rf({
 			bindingValues: i?.bindingValues ?? n.bindingValues ?? {},
 			createId: n.createId,
 			emit: r,
@@ -7468,4 +7482,4 @@ function ef(t, n) {
 	});
 }
 //#endregion
-export { Yd as decodeFlowRunCheckpoint, ef as runFlow };
+export { $d as decodeFlowRunCheckpoint, af as runFlow };