@oomol-lab/open-flow 0.1.0-beta.29 → 0.1.0-beta.30

package/dist/common/scheduler.js

@@ -5125,16 +5125,16 @@ var vc = class {
 	graph: qc,
 	subflows: I(B, Kc.extend({ graph: qc })),
 	tasks: I(B, Pc)
-});
-P({
-	modelVersion: R(2),
+}), Zc = P({
+	modelVersion: F([R(2), R(3)]),
 	document: Xc,
 	modules: I(B, Yc)
-}).extend({
+});
+Zc.extend({ modelVersion: R(3) }), Zc.extend({
 	kind: R("open-flow-flow-revision"),
 	version: R(1)
 });
-var Zc = {
+var Qc = {
 	"binding.create": {
 		bindingId: B,
 		binding: Jc
@@ -5297,56 +5297,56 @@ var Zc = {
 		value: B
 	}
 };
-N(F([...new Map(Object.entries(Zc).map(([e, t]) => [e, t instanceof k ? t : P({
+N(F([...new Map(Object.entries(Qc).map(([e, t]) => [e, t instanceof k ? t : P({
 	kind: R(e),
 	...t
 })])).values()])).min(1);
 //#endregion
 //#region src/flow/common/change.ts
-function Qc(e) {
+function $c(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
 //#endregion
 //#region src/json-schema-subset/utils.ts
-var $c = 0;
-function el() {
-	let e = $c;
-	return $c += 1, e;
+var el = 0;
+function tl() {
+	let e = el;
+	return el += 1, e;
 }
-function tl(e) {
+function nl(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) tl(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) nl(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function nl(e, t) {
+function rl(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function rl(e) {
+function il(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = rl(r);
+		for (let [n, r] of e.entries()) t[n] = il(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = rl(e[n]);
+		for (let n in e) t[n] = il(e[n]);
 		return t;
 	}
 }
-function il(e, t) {
+function al(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 (!il(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!al(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !il(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !al(e[n], t[n])) return !1;
 		for (let n in t) if (!(n in e)) return !1;
 	}
 	return !0;
@@ -5359,48 +5359,48 @@ var H = Object.freeze({
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), U = fl(H.Equals), W = fl(H.Containing), G = fl(H.ContainedBy), K = fl(H.Rejection), q = fl(H.Intersection), al = tl([
+}), U = pl(H.Equals), W = pl(H.Containing), G = pl(H.ContainedBy), K = pl(H.Rejection), q = pl(H.Intersection), ol = nl([
 	[H.Equals, U],
 	[H.Containing, W],
 	[H.ContainedBy, G],
 	[H.Rejection, K],
 	[H.Intersection, q]
-]), ol = (() => {
+]), sl = (() => {
 	let e = 0;
-	for (let [t, n] of al) e |= n;
+	for (let [t, n] of ol) e |= n;
 	return e;
 })();
-function sl(e) {
+function cl(e) {
 	return !!(e & U);
 }
-function cl(e) {
+function ll(e) {
 	return !!(e & W);
 }
-function ll(e) {
+function ul(e) {
 	return !!(e & G);
 }
-function ul(e) {
+function dl(e) {
 	return !!(e & K);
 }
-function dl(e) {
+function fl(e) {
 	return !!(e & q);
 }
-function fl(e) {
+function pl(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function pl(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : ml(t, r, e), n += 1, t) };
+function ml(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : hl(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function ml(e, t, n) {
+function hl(e, t, n) {
 	let r = 0;
-	for (let [i, a] of al) if (a & e) {
-		for (let [e, a] of al) if (a & t && (r |= n(i, e), r === ol)) return r;
+	for (let [i, a] of ol) if (a & e) {
+		for (let [e, a] of ol) if (a & t && (r |= n(i, e), r === sl)) return r;
 	}
 	return r;
 }
@@ -5414,59 +5414,59 @@ var J = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function hl(e, t) {
+function gl(e, t) {
 	switch (e) {
 		case J.Save: return t[0];
-		case J.OneOf: return _l(t);
+		case J.OneOf: return vl(t);
 		case J.AllOf:
-		case J.AnyOf: return vl(e, t);
+		case J.AnyOf: return yl(e, t);
 		case J.Not:
-		case J.Swap: return yl(e, t[0]);
+		case J.Swap: return bl(e, t[0]);
 	}
 }
-function gl(e) {
-	return yl(J.Swap, e);
-}
 function _l(e) {
+	return bl(J.Swap, e);
+}
+function vl(e) {
 	if (e.length === 1) return e[0];
-	let t = vl(J.AnyOf, e), n = [];
+	let t = yl(J.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 = vl(J.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = yl(J.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = vl(J.AnyOf, n), i = yl(J.Not, r);
-	return vl(J.AllOf, [t, i]);
+	let r = yl(J.AnyOf, n), i = bl(J.Not, r);
+	return yl(J.AllOf, [t, i]);
 }
-function vl(e, t) {
+function yl(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
 		case J.AllOf:
-			n = pl(bl);
+			n = ml(xl);
 			break;
 		case J.AnyOf:
-			n = pl(xl);
+			n = ml(Sl);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function yl(e, t) {
+function bl(e, t) {
 	let n, r = 0;
 	switch (e) {
 		case J.Not:
-			n = Sl;
+			n = Cl;
 			break;
 		case J.Swap:
-			n = Cl;
+			n = wl;
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of al) i & t && (r |= n(e));
+	for (let [e, i] of ol) i & t && (r |= n(e));
 	return r;
 }
-function bl(e, t) {
+function xl(e, t) {
 	let n = 0;
 	switch (e) {
 		case H.Equals:
@@ -5555,7 +5555,7 @@ function bl(e, t) {
 	}
 	return n;
 }
-function xl(e, t) {
+function Sl(e, t) {
 	let n = 0;
 	switch (e) {
 		case H.Equals:
@@ -5644,7 +5644,7 @@ function xl(e, t) {
 	}
 	return n;
 }
-function Sl(e) {
+function Cl(e) {
 	let t = 0;
 	switch (e) {
 		case H.Equals:
@@ -5663,7 +5663,7 @@ function Sl(e) {
 	}
 	return t;
 }
-function Cl(e) {
+function wl(e) {
 	let t = 0;
 	switch (e) {
 		case H.Equals:
@@ -5684,13 +5684,13 @@ function Cl(e) {
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var wl = Object.freeze({
+var Tl = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), Tl = (e) => (t, n) => {
+}), El = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
@@ -5718,7 +5718,7 @@ var wl = Object.freeze({
 		let n = U, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== wl.Leaf) {
+			if (a.kind !== Tl.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -5733,7 +5733,7 @@ var wl = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== wl.Leaf) {
+			if (c.kind !== Tl.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -5759,16 +5759,16 @@ var wl = Object.freeze({
 	function s(e, t) {
 		let n = J.Save, r;
 		switch (e.kind) {
-			case wl.Not:
+			case Tl.Not:
 				n = J.Not, r = [e.expression];
 				break;
-			case wl.AllOf:
+			case Tl.AllOf:
 				n = J.AllOf, r = [...e.expressions];
 				break;
-			case wl.AnyOf:
+			case Tl.AnyOf:
 				n = J.AnyOf, r = [...e.expressions];
 				break;
-			case wl.OneOf:
+			case Tl.OneOf:
 				n = J.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
@@ -5781,8 +5781,8 @@ var wl = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = hl(t.operator, t.results);
-		if (r === 0 && (r = G), t.willSwap && (r = gl(r)), n) {
+		let t = e.calculation, n = e.parent, r = gl(t.operator, t.results);
+		if (r === 0 && (r = G), t.willSwap && (r = _l(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);
 		}
@@ -5790,79 +5790,79 @@ var wl = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, El = class extends Error {
+}, Dl = class extends Error {
 	constructor(e = []) {
-		super(kl(e)), this.name = "SchemaError", this.items = e;
+		super(Al(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Dl = Object.freeze({
+}, Ol = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Ol(e) {
+function kl(e) {
 	switch (e.kind) {
-		case Dl.Compiled: {
+		case Ol.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Dl.External: return String(e.error);
+		case Ol.External: return String(e.error);
 	}
 }
-function kl(e) {
+function Al(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Ol(e[0]);
-		default: return `${Ol(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return kl(e[0]);
+		default: return `${kl(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Al = /* @__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 jl(e) {
-	return Al.has(e);
-}
+var jl = /* @__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 Ml(e) {
-	for (let t in e) if (jl(t)) return !1;
+	return jl.has(e);
+}
+function Nl(e) {
+	for (let t in e) if (Ml(t)) return !1;
 	return !0;
 }
-function Nl(e, ...t) {
+function Pl(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function Pl(e) {
+function Fl(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function Fl({ path: e, errors: t }, n, ...r) {
-	t.push(Il(e, r, n));
+function Il({ path: e, errors: t }, n, ...r) {
+	t.push(Ll(e, r, n));
 }
 function Y({ path: e, warns: t }, n, ...r) {
-	t.push(Il(e, r, n));
+	t.push(Ll(e, r, n));
 }
-function Il(e, t, n) {
+function Ll(e, t, n) {
 	return {
-		kind: Dl.Compiled,
+		kind: Ol.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function Ll(e) {
+function Rl(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] : Rl(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : zl(n) && delete e[t]);
 	}
 	return e;
 }
-function Rl(e) {
+function zl(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var zl = Symbol("compiledId"), Bl = Symbol("compiledKind"), Vl = Symbol("compiledPath"), Hl = Symbol("validatorLoader"), X = Object.freeze({
+var Bl = Symbol("compiledId"), Vl = Symbol("compiledKind"), Hl = Symbol("compiledPath"), Ul = Symbol("validatorLoader"), X = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -5875,62 +5875,62 @@ var zl = Symbol("compiledId"), Bl = Symbol("compiledKind"), Vl = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), Ul = tl(Zl(X.Any, el(), {}, () => () => !0)), Wl = tl(Zl(X.Never, el(), {
+}), Wl = nl(Ql(X.Any, tl(), {}, () => () => !0)), Gl = nl(Ql(X.Never, tl(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function Gl(e) {
-	return typeof e != "object" || !e ? !1 : zl in e;
-}
 function Kl(e) {
-	return typeof e != "object" || !e ? !1 : zl in e && Bl in e;
-}
-function Z(e) {
-	return Kl(e) ? e[Bl] : X.Extends;
+	return typeof e != "object" || !e ? !1 : Bl in e;
 }
 function ql(e) {
-	return Kl(e) || Gl(e) ? e[zl] : e.id;
+	return typeof e != "object" || !e ? !1 : Bl in e && Vl in e;
+}
+function Z(e) {
+	return ql(e) ? e[Vl] : X.Extends;
 }
 function Jl(e) {
-	return Kl(e) ? e[Vl] : void 0;
+	return ql(e) || Kl(e) ? e[Bl] : e.id;
 }
 function Yl(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, zl, {
-		value: el(),
+	return ql(e) ? e[Hl] : void 0;
+}
+function Xl(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, Bl, {
+		value: tl(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
 function Q(e, t, n, r = []) {
-	return Zl(e, el(), t, n && (() => n.compile(t)), r);
+	return Ql(e, tl(), t, n && (() => n.compile(t)), r);
 }
-function Xl(e) {
-	return Zl(X.Never, el(), { ...e }, e[Hl], e[Vl]);
+function Zl(e) {
+	return Ql(X.Never, tl(), { ...e }, e[Ul], e[Hl]);
 }
-function Zl(e, t, n, r, i = []) {
+function Ql(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[Bl]: {
+		[Vl]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[zl]: {
+		[Bl]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Vl]: {
+		[Hl]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Hl]: {
+		[Ul]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -5947,16 +5947,16 @@ function Zl(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function Ql(e, t) {
-	let n = $l(e, t), r = eu(e, "maxItems", t), i = eu(e, "minItems", t), a = tu(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = nu(e, t) : t.additionalItems && Y(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function $l(e, t) {
+	let n = eu(e, t), r = tu(e, "maxItems", t), i = tu(e, "minItems", t), a = nu(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = ru(e, t) : t.additionalItems && Y(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 = ru(s, e.delegate));
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = iu(s, e.delegate));
 		let t = n.findIndex((e) => Z(e) === X.Never);
-		t !== -1 && (n = n.splice(t), s = ru(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (Y(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && Z(s) === X.Never && (c = !0);
+		t !== -1 && (n = n.splice(t), s = iu(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (Y(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && Z(s) === X.Never && (c = !0);
 	} else Z(n) === X.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || Y(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Q(c ? X.Never : X.Array, Ll({
+	return r !== void 0 && i !== void 0 && r < i && (l || Y(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Q(c ? X.Never : X.Array, Rl({
 		type: "array",
 		items: n,
 		contains: a,
@@ -5966,12 +5966,12 @@ function Ql(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function $l(e, { items: t }) {
+function eu(e, { items: t }) {
 	if (!t) return Q(X.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = Lu(Nl(e, "items", i), Pl(a));
+			let t = Ru(Pl(e, "items", i), Fl(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -5980,9 +5980,9 @@ function $l(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return Lu(Nl(e, "items"), Pl(t));
+	return Ru(Pl(e, "items"), Fl(t));
 }
-function eu(e, t, n) {
+function tu(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -5996,35 +5996,35 @@ function eu(e, t, n) {
 		return r;
 	}
 }
-function tu(e, { contains: t }) {
-	return t ? Lu(Nl(e, "contains"), Pl(t)) : Q(X.Any, {}, e.delegate, e.path);
+function nu(e, { contains: t }) {
+	return t ? Ru(Pl(e, "contains"), Fl(t)) : Q(X.Any, {}, e.delegate, e.path);
 }
-function nu(e, { additionalItems: t }) {
+function ru(e, { additionalItems: t }) {
 	switch (typeof t) {
 		case "boolean": return t ? Q(X.Any, {}, e.delegate, e.path) : !1;
-		case "object": return Lu(Nl(e, "additionalItems"), t);
+		case "object": return Ru(Pl(e, "additionalItems"), t);
 		default: return Q(X.Any, {}, e.delegate, e.path);
 	}
 }
-function ru(e, t) {
+function iu(e, t) {
 	return e === void 0 ? Q(X.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : Kl(e) ? Z(e) === X.Never ? e : Xl(e) : e;
+	}, t) : ql(e) ? Z(e) === X.Never ? e : Zl(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var iu = Object.freeze([
+var au = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function au(e, t, n, r) {
-	if (n.length === 0) return Fl(e, "disable empty list", t), null;
+function ou(e, t, n, r) {
+	if (n.length === 0) return Il(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = Lu(Nl(e, t, r), Pl(a));
+		let n = Ru(Pl(e, t, r), Fl(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
@@ -6038,7 +6038,7 @@ function au(e, t, n, r) {
 	let s = X.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = X.Never : a === i.length ? s = X.Any : ou(i) || (s = X.Never);
+			o > 0 ? s = X.Never : a === i.length ? s = X.Any : su(i) || (s = X.Never);
 			break;
 		case "anyOf":
 			a > 0 ? s = X.Any : o === i.length && (s = X.Never);
@@ -6047,7 +6047,7 @@ function au(e, t, n, r) {
 	}
 	return Q(s, { [t]: i }, r, e.path);
 }
-function ou(e) {
+function su(e) {
 	let t = null;
 	for (let n of e) {
 		let e = Z(n);
@@ -6062,35 +6062,35 @@ function ou(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var su = Object.freeze({
+var cu = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
-function cu(e, t) {
+function lu(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? su.Valid : su.Invalid : su.Unknown;
+	return n ? n(t) === !0 ? cu.Valid : cu.Invalid : cu.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function lu(e, t, n, r) {
+function uu(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return Fl(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return Il(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (cu(r, a)) {
-			case su.Valid:
-				i.push(Yl(a));
+		for (let [n, a] of t.entries()) switch (lu(r, a)) {
+			case cu.Valid:
+				i.push(Xl(a));
 				break;
-			case su.Invalid: Y(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case cu.Invalid: Y(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
 		i.length === 0 && Y(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && cu(r, n) === su.Invalid && (a = !0), i) {
+	if (n && lu(r, n) === cu.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (il(t, n)) {
+			for (let t of i) if (al(t, n)) {
 				e = !0;
 				break;
 			}
@@ -6098,11 +6098,11 @@ function lu(e, t, n, r) {
 		}
 	}
 	let o = a ? X.Never : X.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = Yl(rl(n))), Q(o, s, e.delegate, e.path);
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = Xl(il(n))), Q(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var uu = /* @__PURE__ */ new Set([
+var du = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -6113,27 +6113,27 @@ var uu = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function du(e, t) {
-	let n = Object.keys(t).filter((e) => !uu.has(e) && jl(e));
+function fu(e, t) {
+	let n = Object.keys(t).filter((e) => !du.has(e) && Ml(e));
 	n.length > 0 && Y(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = fu(e, "maxProperties", t), i = fu(e, "minProperties", t), a = pu(e, t), o = mu(e, t), s = hu(e, t), c = _u(e, t);
+	let r = pu(e, "maxProperties", t), i = pu(e, "minProperties", t), a = mu(e, t), o = hu(e, t), s = gu(e, t), c = vu(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = gu(e, o, s, t);
+	let l = _u(e, o, s, t);
 	if (!l) return null;
-	let u = yu(e, vu(a, o, s, l), c, t);
-	return Q(bu(e, a, l, u, r, i) ? X.Never : X.Object, Ll({
+	let u = bu(e, yu(a, o, s, l), c, t);
+	return Q(xu(e, a, l, u, r, i) ? X.Never : X.Object, Rl({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: Tu(o),
-		dependencies: Eu(c, t),
+		patternProperties: Eu(o),
+		dependencies: Du(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function fu(e, t, n) {
+function pu(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -6147,22 +6147,22 @@ function fu(e, t, n) {
 		return r;
 	}
 }
-function pu(e, { additionalProperties: t }) {
+function mu(e, { additionalProperties: t }) {
 	return t === !1 ? Q(X.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? Lu(Nl(e, "additionalProperties"), Pl(t)) : Q(X.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? Ru(Pl(e, "additionalProperties"), Fl(t)) : Q(X.Any, {}, e.delegate, e.path);
 }
-function mu(e, { patternProperties: t }) {
+function hu(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = wu(i);
+		let a = Tu(i);
 		if (a instanceof Error) {
 			Y(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = Pl(t[i]), s = Lu(Nl(e, "patternProperties", i), o);
+		let o = Fl(t[i]), s = Ru(Pl(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -6171,29 +6171,29 @@ function mu(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function hu(e, { propertyNames: t }) {
+function gu(e, { propertyNames: t }) {
 	if (!t) return Q(X.Any, {}, e.delegate, e.path);
-	t = Pl(t);
-	let n = Lu(Nl(e, "propertyNames"), t);
+	t = Fl(t);
+	let n = Ru(Pl(e, "propertyNames"), t);
 	if (!n) return null;
 	let r = Z(n);
-	return r !== X.String && r !== X.Any ? Xl(n) : n;
+	return r !== X.String && r !== X.Any ? Zl(n) : n;
 }
-function gu(e, t, n, { properties: r }) {
+function _u(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (cu(n, o) === su.Invalid) {
+		if (lu(n, o) === cu.Invalid) {
 			Y(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = Cu(t, o);
+		let s = wu(t, o);
 		if (s && Z(s) === X.Never) {
 			Y(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = Pl(r[o]), l = Lu(Nl(e, "properties", o), c);
+		let c = Fl(r[o]), l = Ru(Pl(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -6202,40 +6202,40 @@ function gu(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function _u(e, { dependencies: t }) {
+function vu(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = Pl(t[i]);
+		let a = Fl(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = Su(a);
+			let { keys: t, duplicated: r } = Cu(a);
 			r && Y(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = Lu(Nl(e, "dependencies", i), a);
+			let t = Ru(Pl(e, "dependencies", i), a);
 			if (t) {
 				let e = Z(t);
-				r[i] = e === X.Object || e === X.Any ? t : e === X.Extends ? Wl : Xl(t);
+				r[i] = e === X.Object || e === X.Any ? t : e === X.Extends ? Gl : Zl(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function vu(e, t, n, r) {
+function yu(e, t, n, r) {
 	return (i) => {
-		if (cu(n, i) === su.Invalid) return !0;
-		let a = Cu(t, i);
+		if (lu(n, i) === cu.Invalid) return !0;
+		let a = wu(t, i);
 		return !!(a && Z(a) === X.Never || Z(r[i] ?? e) === X.Never);
 	};
 }
-function yu(e, t, n, { required: r }) {
+function bu(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = Su(r);
+	let i = Cu(r);
 	i.duplicated && Y(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) xu(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	for (let e of i.keys) Su(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
 	return o.length > 0 && Y(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
 }
-function bu(e, t, n, r, i, a) {
+function xu(e, t, n, r, i, a) {
 	if (i !== void 0 && a !== void 0 && i < a) return Y(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
 	if (i !== void 0 && r.length > i) return Y(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
 	if (a !== void 0 && r.length < a) return Y(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
@@ -6246,7 +6246,7 @@ function bu(e, t, n, r, i, a) {
 	}
 	return !0;
 }
-function xu([e, t], n) {
+function Su([e, t], n) {
 	let r = [n], i = new Set(r);
 	for (; r.length > 0;) {
 		let n = r.pop(), i = t[n], o = e[n];
@@ -6257,7 +6257,7 @@ function xu([e, t], n) {
 	}
 	return [...i];
 }
-function Su(e) {
+function Cu(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 ? {
@@ -6268,14 +6268,14 @@ function Su(e) {
 		duplicated: [...n]
 	};
 }
-function Cu(e, t) {
+function wu(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function wu(e) {
+function Tu(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -6283,12 +6283,12 @@ function wu(e) {
 		throw e;
 	}
 }
-function Tu(e) {
+function Eu(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function Eu([e, t], { dependencies: n }) {
+function Du([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -6298,39 +6298,39 @@ function Eu([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var Du = /* @__PURE__ */ new Set([
+var Ou = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Ou = /* @__PURE__ */ new Set([
+]), ku = /* @__PURE__ */ new Set([
 	"type",
 	"format",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function ku(e, t) {
+function Au(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return Au(e, t);
-		case "string": return Mu(e, t);
+		case "integer": return ju(e, t);
+		case "string": return Nu(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => jl(e) && e !== "type");
+			let r = Object.keys(t).filter((e) => Ml(e) && e !== "type");
 			return r.length > 0 && Y(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Q(n === "null" ? X.Null : X.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return Fl(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return Il(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function Au(e, t) {
-	let n = Object.keys(t).filter((e) => !Du.has(e) && jl(e));
+function ju(e, t) {
+	let n = Object.keys(t).filter((e) => !Ou.has(e) && Ml(e));
 	n.length > 0 && Y(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = nl(t, Du);
-	for (let t of Du) {
+	let r = rl(t, Ou);
+	for (let t of Ou) {
 		let n = r[t];
 		t !== "type" && n !== void 0 && Number.isNaN(n) && (Y(e, "found NaN", t), delete r[t]);
 	}
@@ -6339,38 +6339,38 @@ function Au(e, t) {
 	let { multipleOf: c } = r;
 	c === 0 && (delete r.multipleOf, r.type = "number", Y(e, "cannot be 0", "multipleOf"));
 	let l = X.Numeric;
-	return ju(r) || (l = X.Never), Q(l, r, e.delegate, e.path);
+	return Mu(r) || (l = X.Never), Q(l, r, e.delegate, e.path);
 }
-function ju(e) {
+function Mu(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 Mu(e, t) {
-	let n = Object.keys(t).filter((e) => !Ou.has(e) && jl(e));
+function Nu(e, t) {
+	let n = Object.keys(t).filter((e) => !ku.has(e) && Ml(e));
 	n.length > 0 && Y(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = nl(t, Ou);
-	Nu(e, r, "maxLength"), Nu(e, r, "minLength");
+	let r = rl(t, ku);
+	Pu(e, r, "maxLength"), Pu(e, r, "minLength");
 	let i = r.maxLength, a = r.minLength, o = X.String;
 	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = X.Never), Q(o, r, e.delegate, e.path);
 }
-function Nu(e, t, n) {
+function Pu(e, t, n) {
 	let r = t[n];
 	r !== void 0 && Number.isNaN(r) && (Y(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Pu = Object.freeze([]);
-function Fu(e, t, n, r) {
-	if (Kl(e) || t.isExtendsSchema(e)) return {
+var Fu = Object.freeze([]);
+function Iu(e, t, n, r) {
+	if (ql(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Pu
+		warns: Fu
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Dl.External,
+				kind: Ol.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -6383,19 +6383,19 @@ function Fu(e, t, n, r) {
 		path: [],
 		errors: [],
 		warns: []
-	}, a = Lu(i, e);
-	if (a) Iu(i.errors.length === 0, "found errors (it should be empty)");
-	else return Iu(i.errors.length > 0, "cannot found any errors"), i.errors;
+	}, a = Ru(i, e);
+	if (a) Lu(i.errors.length === 0, "found errors (it should be empty)");
+	else return Lu(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function Iu(e, t) {
+function Lu(e, t) {
 	if (!e) throw Error(t);
 }
-function Lu(e, t) {
-	if (e.extends.isExtendsSchema(t) || Kl(t)) return t;
+function Ru(e, t) {
+	if (e.extends.isExtendsSchema(t) || ql(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;
@@ -6403,23 +6403,23 @@ function Lu(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = Ru(e, r);
-	return s && i && (s = lu(e, a, o, s)), s || null;
+	let s = zu(e, r);
+	return s && i && (s = uu(e, a, o, s)), s || null;
 }
-function Ru(e, t) {
-	for (let n of iu) {
+function zu(e, t) {
+	for (let n of au) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => jl(e) && e !== n);
-			return i.length > 0 && Y(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), au(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => Ml(e) && e !== n);
+			return i.length > 0 && Y(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), ou(e, n, r) || null;
 		}
 	}
 	{
-		let n = Pl(t.not);
+		let n = Fl(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => jl(e) && e !== "not");
+			let r = Object.keys(t).filter((e) => Ml(e) && e !== "not");
 			r.length > 0 && Y(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = Lu(Nl(e, "not"), n);
+			let i = Ru(Pl(e, "not"), n);
 			if (!i) return null;
 			let a = X.Not;
 			switch (Z(i)) {
@@ -6435,26 +6435,26 @@ function Ru(e, t) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return au(e, "anyOf", n.map((e) => ({
+			return ou(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return du(e, t);
-			case "array": return Ql(e, t);
-			default: return ku(e, t);
+			case "object": return fu(e, t);
+			case "array": return $l(e, t);
+			default: return Au(e, t);
 		}
 	}
-	return Ml(t) ? Q(X.Any, {}, e.delegate, e.path) : (Fl(e, "unrecognized"), null);
+	return Nl(t) ? Q(X.Any, {}, e.delegate, e.path) : (Il(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var zu = class {
+var Bu = 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 Bu {
+		this.keys = t, this.clazz = class extends Vu {
 			constructor(e) {
 				super(t, e);
 			}
@@ -6478,7 +6478,7 @@ var zu = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Bu = class {
+}, Vu = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -6493,21 +6493,21 @@ var zu = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function Vu(e) {
-	return new Hu(e);
+function Hu(e) {
+	return new Uu(e);
 }
-var Hu = class {
+var Uu = class {
 	constructor(e) {
-		this.description = new zu(e);
+		this.description = new Bu(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Uu(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new Wu(this.description, t);
 	}
-}, Uu = class {
+}, Wu = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -6528,7 +6528,7 @@ var Hu = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of al) if (e & a) {
+		for (let r of this.values) for (let [i, a] of ol) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -6545,11 +6545,11 @@ var Hu = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function Wu(e, t) {
+function Gu(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? Gu(e, t) : n.num > r.num ? Ku(e, t) : qu(e, t);
+	return n.num < r.num ? Ku(e, t) : n.num > r.num ? qu(e, t) : Ju(e, t);
 }
-function Gu(e, t) {
+function Ku(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -6574,11 +6574,11 @@ function Gu(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [Ju(r), a]
+				range: [Yu(r), a]
 			}), {
 				left: {
 					fromLeft: !0,
-					range: [n, Ju(i)]
+					range: [n, Yu(i)]
 				},
 				center: [i, r],
 				right: t
@@ -6588,16 +6588,16 @@ function Gu(e, t) {
 	return {
 		left: {
 			fromLeft: !0,
-			range: [n, Ju(i)]
+			range: [n, Yu(i)]
 		},
 		center: [i, a],
 		right: {
 			fromLeft: !0,
-			range: [Ju(a), r]
+			range: [Yu(a), r]
 		}
 	};
 }
-function Ku(e, t) {
+function qu(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -6622,11 +6622,11 @@ function Ku(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !0,
-				range: [Ju(a), r]
+				range: [Yu(a), r]
 			}), {
 				left: {
 					fromLeft: !1,
-					range: [i, Ju(n)]
+					range: [i, Yu(n)]
 				},
 				center: [n, a],
 				right: t
@@ -6636,23 +6636,23 @@ function Ku(e, t) {
 	return {
 		left: {
 			fromLeft: !1,
-			range: [i, Ju(n)]
+			range: [i, Yu(n)]
 		},
 		center: [n, r],
 		right: {
 			fromLeft: !1,
-			range: [Ju(r), a]
+			range: [Yu(r), a]
 		}
 	};
 }
-function qu(e, t) {
+function Ju(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,
-		range: [n, Ju(i)]
+		range: [n, Yu(i)]
 	}) : o && !s && (c = {
 		fromLeft: !1,
-		range: [i, Ju(n)]
+		range: [i, Yu(n)]
 	}), r.num <= a.num) {
 		let e = !0, t = !1;
 		if (r.num === a.num) {
@@ -6663,7 +6663,7 @@ function qu(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [Ju(r), a]
+				range: [Yu(r), a]
 			}), {
 				left: c,
 				center: [l, r],
@@ -6676,11 +6676,11 @@ function qu(e, t) {
 		center: [l, a],
 		right: {
 			fromLeft: !0,
-			range: [Ju(a), r]
+			range: [Yu(a), r]
 		}
 	};
 }
-function Ju(e) {
+function Yu(e) {
 	return {
 		num: e.num,
 		exclusive: !e.exclusive
@@ -6688,8 +6688,8 @@ function Ju(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var Yu = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = Wu([{
+var Xu = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = Gu([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -6719,24 +6719,24 @@ var Yu = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function Xu({ left: e, right: t, intersection: n }) {
+function Zu({ left: e, right: t, intersection: n }) {
 	if (!n) return H.Rejection;
 	let r = !1, i = !1;
 	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? H.Intersection : r ? H.Containing : i ? H.ContainedBy : H.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var Zu = Yu(0), Qu = Vu([
+var Qu = Xu(0), $u = Hu([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function $u({ calculate: e }, t, n) {
-	let r = Zu(t.minItems, t.maxItems, n.minItems, n.maxItems), i = Xu(r);
+function ed({ calculate: e }, t, n) {
+	let r = Qu(t.minItems, t.maxItems, n.minItems, n.maxItems), i = Zu(r);
 	if (i === H.Rejection) return K;
-	let [a, o] = ed(t), [s, c] = ed(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = Qu.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+	let [a, o] = td(t), [s, c] = td(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) => {
@@ -6776,69 +6776,69 @@ function $u({ calculate: e }, t, n) {
 	}
 	return p;
 }
-function ed({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? Ul] : [[], e ?? Ul];
+function td({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? Wl] : [[], e ?? Wl];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function td(e) {
+function nd(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = Gl(n);
-		return i === Gl(r) ? i ? rd(t, n, r, e) : n === r : !1;
+		let i = Kl(n);
+		return i === Kl(r) ? i ? id(t, n, r, e) : n === r : !1;
 	};
 }
-function nd(e) {
+function rd(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => rd(t, n, r, e);
+	return (n, r) => id(t, n, r, e);
 }
-function rd(e, t, n, r) {
-	let i = `${ql(t)}/${ql(n)}`, a = e.get(i);
+function id(e, t, n, r) {
+	let i = `${Jl(t)}/${Jl(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 id(e, t, n) {
-	let r = od(t), i = od(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (sd(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (sd(e, r, t) ? s = !0 : o = !0, o && s) break;
+function ad(e, t, n) {
+	let r = sd(t), i = sd(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (cd(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (cd(e, r, t) ? s = !0 : o = !0, o && s) break;
 	return s ? a && o ? q : a ? W : o ? G : U : K;
 }
-function ad(e, t) {
+function od(e, t) {
 	let n = !1, r = !1;
-	for (let i of od(e)) {
-		switch (cu(t, i)) {
-			case su.Valid:
+	for (let i of sd(e)) {
+		switch (lu(t, i)) {
+			case cu.Valid:
 				n = !0;
 				break;
-			case su.Invalid:
+			case cu.Invalid:
 				r = !0;
 				break;
-			case su.Unknown: return ol;
+			case cu.Unknown: return sl;
 		}
 		if (n && r) break;
 	}
 	return n && r ? q : n ? U | G : r ? K : Z(t) === X.Never ? U : G;
 }
-function od({ const: e, enum: t }) {
+function sd({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function sd({ isEquals: e }, t, n) {
+function cd({ 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 cd(e) {
+function ld(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 = ql(e), a = ql(t);
+		let r = Jl(e), a = Jl(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;
@@ -6855,25 +6855,25 @@ function cd(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : Kl(e) && Kl(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : ql(e) && ql(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function ld(e) {
-	let t = gd(e), n = e.multipleOf ?? 1, r = dd(t, n);
+function ud(e) {
+	let t = _d(e), n = e.multipleOf ?? 1, r = fd(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function ud([e, t]) {
+function dd([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
-function dd(e, t) {
+function fd(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = fd(n.num, t), a = pd(r.num, t);
+	let [n, r] = e, i = pd(n.num, t), a = md(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
@@ -6882,29 +6882,29 @@ function dd(e, t) {
 		exclusive: !1
 	}];
 }
-function fd(e, t) {
+function pd(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function pd(e, t) {
+function md(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function md(e, t) {
-	let { left: n, right: r, center: i } = Wu(gd(e), gd(t));
+function hd(e, t) {
+	let { left: n, right: r, center: i } = Gu(_d(e), _d(t));
 	if (!i) return K;
 	let a = !1, o = !1;
 	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? q : a ? W : o ? G : U;
 }
-function hd(e, t) {
-	let n = gd(e), r = ld(t);
+function gd(e, t) {
+	let n = _d(e), r = ud(t);
 	if (!r) return W;
-	let i = Wu(n, r.range), a = dd(i.center, r.multipleOf), o = _d(i.left, r.multipleOf), s = _d(i.right, r.multipleOf);
+	let i = Gu(n, r.range), a = fd(i.center, r.multipleOf), o = vd(i.left, r.multipleOf), s = vd(i.right, r.multipleOf);
 	if (!i.center) return K;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !ud(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? q : c ? W : l ? G : U;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !dd(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? q : c ? W : l ? G : U;
 }
-function gd(e) {
+function _d(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -6926,84 +6926,84 @@ function gd(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function _d(e, t) {
-	if (e && !e.fromLeft) return dd(e.range, t);
+function vd(e, t) {
+	if (e && !e.fromLeft) return fd(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function vd(e, t) {
-	let n = ld(e), r = ld(t);
+function yd(e, t) {
+	let n = ud(e), r = ud(t);
 	if (!n && !r) return U;
 	if (!n) return G;
 	if (!r) return W;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Wu(i, o), l, u = 0;
-	if (c.center && (u = bd(a, s), l = dd(c.center, u)), !l) return K;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Gu(i, o), l, u = 0;
+	if (c.center && (u = xd(a, s), l = fd(c.center, u)), !l) return K;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && dd(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && dd(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= yd(n, l, u), f ||= yd(r, l, u), d && f ? q : d ? W : f ? G : U;
+	return p && fd(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && fd(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= bd(n, l, u), f ||= bd(r, l, u), d && f ? q : d ? W : f ? G : U;
 }
-function yd({ range: e, multipleOf: t }, n, r) {
-	let i = Wu(e, n);
-	if (dd(i.left?.range, t) || dd(i.right?.range, t)) return !0;
-	let a = dd(i.center, t);
+function bd({ range: e, multipleOf: t }, n, r) {
+	let i = Gu(e, n);
+	if (fd(i.left?.range, t) || fd(i.right?.range, t)) return !0;
+	let a = fd(i.center, t);
 	if (!a) return !1;
-	let o = Sd(n);
-	return Sd(a) > o || o !== 1 && t < r;
-}
-function bd(e, t) {
-	return e * t / xd(e, t);
+	let o = Cd(n);
+	return Cd(a) > o || o !== 1 && t < r;
 }
 function xd(e, t) {
-	return e === 0 ? t : xd(t % e, e);
+	return e * t / Sd(e, t);
+}
+function Sd(e, t) {
+	return e === 0 ? t : Sd(t % e, e);
 }
-function Sd(e) {
+function Cd(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 Cd(e, t) {
-	if (wd(e) || wd(t)) return ol;
-	let n = Td(e), r = Td(t);
-	return n && r ? md(e, t) : n ? hd(e, t) : r ? gl(hd(t, e)) : vd(e, t);
+function wd(e, t) {
+	if (Td(e) || Td(t)) return sl;
+	let n = Ed(e), r = Ed(t);
+	return n && r ? hd(e, t) : n ? gd(e, t) : r ? _l(gd(t, e)) : yd(e, t);
 }
-function wd(e) {
+function Td(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function Td(e) {
+function Ed(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 Ed = Yu(0), Dd = Vu([
+var Dd = Xu(0), Od = Hu([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function Od(e, t, n) {
-	if (kd(t, n)) return K;
-	let r = Ad(t, n);
+function kd(e, t, n) {
+	if (Ad(t, n)) return K;
+	let r = jd(t, n);
 	if (!r) return K;
-	let i = Id(t), a = Id(n), o = (t) => {
+	let i = Ld(t), a = Ld(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return Ld(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Dd.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), Md);
-	for (let e of [...c].toSorted()) u.push(o(e), Nd);
-	for (let e of [...l].toSorted()) u.push(o(e), Pd);
+		return Rd(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Od.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), Nd);
+	for (let e of [...c].toSorted()) u.push(o(e), Pd);
+	for (let e of [...l].toSorted()) u.push(o(e), Fd);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = Fd(d, f);
-		for (let e of [...jd(t, n)].toSorted()) {
+		let r = Id(d, f);
+		for (let e of [...Md(t, n)].toSorted()) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? Ul, a = n.additionalProperties ?? Ul;
-		if (Ld(i, a)) {
+		let i = t.additionalProperties ?? Wl, a = n.additionalProperties ?? Wl;
+		if (Rd(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -7015,10 +7015,10 @@ function Od(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 ? K : e && t ? q : e ? W : t ? G : U;
 	return m;
 }
-function kd(e, t) {
-	return Xu(Ed(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === H.Rejection;
-}
 function Ad(e, t) {
+	return Zu(Dd(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === H.Rejection;
+}
+function jd(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);
@@ -7034,7 +7034,7 @@ function Ad(e, t) {
 		hasOptional2: u > s
 	};
 }
-function jd(e, t) {
+function Md(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);
@@ -7042,7 +7042,7 @@ function jd(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var Md = (e, t) => {
+var Nd = (e, t) => {
 	switch (e) {
 		case H.Equals:
 			t.hasCommonInRequired = !0;
@@ -7058,7 +7058,7 @@ var Md = (e, t) => {
 			break;
 		case H.Rejection: t.hasRejection = !0;
 	}
-}, Nd = (e, t) => {
+}, Pd = (e, t) => {
 	switch (e) {
 		case H.Equals:
 		case H.ContainedBy:
@@ -7070,7 +7070,7 @@ var Md = (e, t) => {
 			break;
 		case H.Rejection: t.hasRejection = !0;
 	}
-}, Pd = (e, t) => {
+}, Fd = (e, t) => {
 	switch (e) {
 		case H.Equals:
 		case H.Containing:
@@ -7082,7 +7082,7 @@ var Md = (e, t) => {
 			break;
 		case H.Rejection: t.hasRejection = !0;
 	}
-}, Fd = (e, t) => (n, r) => {
+}, Id = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
@@ -7102,7 +7102,7 @@ var Md = (e, t) => {
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function Id(e) {
+function Ld(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");
@@ -7112,41 +7112,41 @@ function Id(e) {
 		});
 	}
 	return (e) => {
-		if (n && cu(n, e) === su.Invalid) return Wl;
+		if (n && lu(n, e) === cu.Invalid) return Gl;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || Ul;
+		return ((t && t[e]) ?? r) || Wl;
 	};
 }
-function Ld(e, t) {
+function Rd(e, t) {
 	let n = Z(e), r = Z(t);
 	return n !== X.Never || r !== X.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var Rd = Yu(0);
-function zd(e, t) {
+var zd = Xu(0);
+function Bd(e, t) {
 	if (t.format && !e.format) return W;
-	if (e.format && t.format && e.format !== t.format) return ol;
-	let n = Xu(Rd(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+	if (e.format && t.format && e.format !== t.format) return sl;
+	let n = Zu(zd(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
 		case H.Rejection: return K;
-		case H.Containing: return r ? ol : W;
-		case H.ContainedBy: return i ? ol : G;
-		case H.Equals: return r && i ? e.pattern === t.pattern ? U : ol : r ? U | G : i ? U | W : U;
-		case H.Intersection: return r && i ? ol : r ? q | K | G : i ? q | K | W : q;
+		case H.Containing: return r ? sl : W;
+		case H.ContainedBy: return i ? sl : G;
+		case H.Equals: return r && i ? e.pattern === t.pattern ? U : sl : r ? U | G : i ? U | W : U;
+		case H.Intersection: return r && i ? sl : r ? q | K | G : i ? q | K | W : q;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function Bd(e, t, n) {
-	let r = {}, i = [], a = nd(Hd(e, r)), o = Vd(), s = cd(e);
-	r.isEquals = td(il), r.calculate = Tl({
+function Vd(e, t, n) {
+	let r = {}, i = [], a = rd(Ud(e, r)), o = Hd(), s = ld(e);
+	r.isEquals = nd(al), r.calculate = El({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!Wd(r ? gl(n) : n)) return;
-			let a = r ? Gd(t, e) : Gd(e, t);
+			if (!Gd(r ? _l(n) : n)) return;
+			let a = r ? Kd(t, e) : Kd(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -7156,34 +7156,34 @@ function Bd(e, t, n) {
 		expression: c
 	};
 }
-var Vd = () => (e) => {
+var Hd = () => (e) => {
 	let t;
 	switch (Z(e)) {
 		case X.Not:
 			t = {
-				kind: wl.Not,
+				kind: Tl.Not,
 				expression: e.not
 			};
 			break;
 		case X.Combination:
 			if ("allOf" in e) t = {
-				kind: wl.AllOf,
-				expressions: Ud(e.allOf, X.Any)
+				kind: Tl.AllOf,
+				expressions: Wd(e.allOf, X.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: wl.AnyOf,
-				expressions: Ud(e.anyOf, X.Never)
+				kind: Tl.AnyOf,
+				expressions: Wd(e.anyOf, X.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: wl.OneOf,
-				expressions: Ud(e.oneOf, X.Never)
+				kind: Tl.OneOf,
+				expressions: Wd(e.oneOf, X.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: wl.Leaf };
+		default: t = { kind: Tl.Leaf };
 	}
 	return t;
-}, Hd = (e, t) => (n, r) => {
+}, Ud = (e, t) => (n, r) => {
 	let i = Z(n), a = Z(r);
 	if (i === X.Extends || a === X.Extends) return e.calculate(n, r);
 	switch (i) {
@@ -7194,28 +7194,28 @@ var Vd = () => (e) => {
 		case X.Any: return G;
 		case X.Never: return W;
 	}
-	if (i === X.EnumOrConst && a === X.EnumOrConst) return id(t, n, r);
-	if (i === X.EnumOrConst) return ad(n, r);
-	if (a === X.EnumOrConst) return gl(ad(r, n));
+	if (i === X.EnumOrConst && a === X.EnumOrConst) return ad(t, n, r);
+	if (i === X.EnumOrConst) return od(n, r);
+	if (a === X.EnumOrConst) return _l(od(r, n));
 	if (i !== a) return K;
 	switch (i) {
 		case X.Null: return U;
-		case X.Numeric: return Cd(n, r);
-		case X.String: return zd(n, r);
+		case X.Numeric: return wd(n, r);
+		case X.String: return Bd(n, r);
 		case X.Boolean: return U;
-		case X.Object: return Od(t, n, r);
-		case X.Array: return $u(t, n, r);
+		case X.Object: return kd(t, n, r);
+		case X.Array: return ed(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function Ud(e, t) {
+function Wd(e, t) {
 	return e.filter((e) => Z(e) !== t);
 }
-function Wd(e) {
-	return !sl(e) && !ll(e) && (cl(e) || dl(e) || ul(e));
+function Gd(e) {
+	return !cl(e) && !ul(e) && (ll(e) || fl(e) || dl(e));
 }
-function Gd(e, t) {
-	let n = Jl(t);
+function Kd(e, t) {
+	let n = Yl(t);
 	if (!n) return;
 	let r = Z(e), i = Z(t);
 	if (r !== i) return [...n, "type"];
@@ -7250,12 +7250,12 @@ function Gd(e, t) {
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var Kd = class e {
+var qd = 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(el(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(tl(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -7265,7 +7265,7 @@ var Kd = 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 |= fl(t);
+		for (let t of a) r && (t = e.swap(t)), i |= pl(t);
 		return i;
 	}
 	equals(e, t) {
@@ -7285,35 +7285,35 @@ var Kd = class e {
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function qd(e, t, n = !1) {
+function Jd(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw Yd(e, r, "$"), new El(e);
+		throw Xd(e, r, "$"), new Dl(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(Ol(e));
+		for (let e of a) console.warn(kl(e));
 	}
 	return i;
 }
-function Jd(e, t, n, r = !1) {
+function Yd(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) && Yd(e, i, "$1"), Array.isArray(a) && Yd(e, a, "$2"), new El(e);
+		throw Array.isArray(i) && Xd(e, i, "$1"), Array.isArray(a) && Xd(e, a, "$2"), new Dl(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(Ol(e));
+		for (let e of s) console.warn(kl(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Ol(e));
+		for (let e of l) console.warn(kl(e));
 	}
 	return [o, c];
 }
-function Yd(e, t, n) {
+function Xd(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -7324,60 +7324,60 @@ function Yd(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var Xd = Object.freeze({
+var Zd = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function Zd({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new Kd(e);
+function Qd({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new qd(e);
 	return Object.freeze({
-		compile: (e, r, i) => qd(e, (e) => Fu(e, n, r, t), i),
+		compile: (e, r, i) => Jd(e, (e) => Iu(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = Jd(e, r, (e) => Fu(e, n, void 0, t), i), { errorPath: s, expression: c } = Bd(n, a, o), l = sl(c) || ll(c), u = cl(c) || dl(c) || ul(c);
-			return l && !u ? { result: Xd.True } : !l && u ? {
+			let [a, o] = Yd(e, r, (e) => Iu(e, n, void 0, t), i), { errorPath: s, expression: c } = Vd(n, a, o), l = cl(c) || ul(c), u = ll(c) || fl(c) || dl(c);
+			return l && !u ? { result: Zd.True } : !l && u ? {
 				errorPath: s,
-				result: Xd.False
-			} : { result: Xd.Unknown };
+				result: Zd.False
+			} : { result: Zd.Unknown };
 		}
 	});
 }
 //#endregion
 //#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
-var Qd = (e) => typeof e == "string", $d = Array.isArray, ef = (e) => typeof e == "object" && !!e, tf = (e) => ef(e) && !$d(e), nf = (e) => tf(e) ? e : void 0;
+var $d = (e) => typeof e == "string", ef = Array.isArray, tf = (e) => typeof e == "object" && !!e, nf = (e) => tf(e) && !ef(e), rf = (e) => nf(e) ? e : void 0;
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
-function rf(e) {
-	return nf(e)?.type === "string";
-}
 function af(e) {
-	let t = nf(e), n = nf(t?.error);
-	if (t == null || n == null || t.packageId != null && !Qd(t.packageId) || n.message != null && !Qd(n.message)) throw TypeError("Invalid schema comparison context.");
+	return rf(e)?.type === "string";
 }
 function of(e) {
-	return e == null ? { error: {} } : (af(e), e);
+	let t = rf(e), n = rf(t?.error);
+	if (t == null || n == null || t.packageId != null && !$d(t.packageId) || n.message != null && !$d(n.message)) throw TypeError("Invalid schema comparison context.");
+}
+function sf(e) {
+	return e == null ? { error: {} } : (of(e), e);
 }
-var sf = class e {
+var cf = 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 = of(n);
+		this.id = e, this.value = t, this.context = sf(n);
 	}
 	compare(e) {
-		return Kl(e) && Z(e) === X.Any ? [H.ContainedBy] : this.compareImpl(e);
+		return ql(e) && Z(e) === X.Any ? [H.ContainedBy] : this.compareImpl(e);
 	}
-}, cf = class e extends sf {
+}, lf = class e extends cf {
 	static isMatch(e) {
-		let t = nf(e)?.enum;
-		return Array.isArray(t) && t.every((e) => Qd(e));
+		let t = rf(e)?.enum;
+		return Array.isArray(t) && t.every((e) => $d(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid single-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (rf(t)) return [H.ContainedBy];
+		if (af(t)) return [H.ContainedBy];
 		if (t instanceof e) {
 			let e = new Set(this.value.enum), n = H.Equals;
 			for (let r of t.value.enum) e.has(r) || (n = H.ContainedBy), e.delete(r);
@@ -7396,58 +7396,58 @@ var sf = class e {
 		}
 		return !1;
 	}
-}, lf = class e extends sf {
+}, uf = class e extends cf {
 	static isMatch(e) {
-		return nf(e)?.contentMediaType === "oomol/bin";
+		return rf(e)?.contentMediaType === "oomol/bin";
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid binary schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [H.Equals] : (sf.setError(this, t, "edgeError.binDiffType"), [H.Rejection]);
+		return t instanceof e ? [H.Equals] : (cf.setError(this, t, "edgeError.binDiffType"), [H.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, uf = class e extends sf {
+}, df = class e extends cf {
 	static isMatch(e) {
-		return nf(e)?.contentMediaType === "oomol/artifact";
+		return rf(e)?.contentMediaType === "oomol/artifact";
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid Artifact schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [H.Equals] : (sf.setError(this, t, "edgeError.artifactDiffType"), [H.Rejection]);
+		return t instanceof e ? [H.Equals] : (cf.setError(this, t, "edgeError.artifactDiffType"), [H.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
-function df() {
-	return Zd({ extendsSchemaClasses: [
-		cf,
+function ff() {
+	return Qd({ extendsSchemaClasses: [
 		lf,
-		uf
+		uf,
+		df
 	] });
 }
-df();
+ff();
 //#endregion
 //#region src/flow/common/schema.ts
-function ff(e) {
+function pf(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
-var pf = /* @__PURE__ */ new WeakMap();
-function mf(e, t) {
+var mf = /* @__PURE__ */ new WeakMap();
+function hf(e, t) {
 	if (typeof t == "boolean") return t;
-	let n = ff(t);
-	if (n == null || n.properties != null && ff(n.properties) == null) return !1;
+	let n = pf(t);
+	if (n == null || n.properties != null && pf(n.properties) == null) return !1;
 	try {
-		let t = pf.get(n);
+		let t = mf.get(n);
 		if (t == null) {
 			let e = typeof n.$schema == "string" ? n.$schema : "", r = e.includes("draft-04") ? "4" : e.includes("draft-07") ? "7" : e.includes("2020-12") ? "2020-12" : "2019-09";
-			t = new vc(structuredClone(n), r), pf.set(n, t);
+			t = new vc(structuredClone(n), r), mf.set(n, t);
 		}
 		return t.validate(e).valid;
 	} catch {
@@ -7543,14 +7543,14 @@ var $ = js(() => F([Jo(), rs({
 	exclusiveMinimum: M().optional(),
 	exclusiveMaximum: M().optional()
 }).transform(({ title: e, default: t, examples: n, readOnly: r, writeOnly: i, deprecated: a, $comment: o, ...s }) => s)]));
-function hf(e, t) {
+function gf(e, t) {
 	if (e.kind == "value") return e.value;
 	if (!Object.hasOwn(t, e.input)) throw Error(`Agent input ${e.input} is missing.`);
 	return t[e.input];
 }
 //#endregion
 //#region src/base/common/json.ts
-function gf(e) {
+function _f(e) {
 	if (e === null || typeof e == "boolean" || typeof e == "string") return !0;
 	if (typeof e == "number") return Number.isFinite(e);
 	if (typeof e != "object") return !1;
@@ -7601,16 +7601,16 @@ function gf(e) {
 		}
 	}
 }
-function _f(e) {
+function vf(e) {
 	try {
-		return typeof e == "object" && !!e && !Array.isArray(e) && gf(e);
+		return typeof e == "object" && !!e && !Array.isArray(e) && _f(e);
 	} catch {
 		return !1;
 	}
 }
 //#endregion
 //#region src/trigger/common/contract.ts
-var vf = [
+var yf = [
 	{
 		handle: "headers",
 		jsonSchema: {
@@ -7643,7 +7643,7 @@ var vf = [
 		jsonSchema: { type: "string" },
 		nullable: !1
 	}
-], yf = [{
+], bf = [{
 	description: "The scheduled time that triggered this run, in ISO 8601 format.",
 	handle: "scheduledAt",
 	jsonSchema: {
@@ -7652,13 +7652,13 @@ var vf = [
 	},
 	nullable: !1
 }];
-function bf(e) {
+function xf(e) {
 	switch (e.kind) {
 		case "manual": return [];
-		case "cron": return yf;
+		case "cron": return bf;
 		case "poll":
 		case "integration": return e.definition.outputs;
-		case "webhook": return vf.map((t) => t.handle === "body" ? Object.assign({}, t, { jsonSchema: {
+		case "webhook": return yf.map((t) => t.handle === "body" ? Object.assign({}, t, { jsonSchema: {
 			type: "object",
 			additionalProperties: !1,
 			properties: Object.fromEntries(e.bodyFields.map((e) => [e.handle, e.jsonSchema])),
@@ -7666,21 +7666,21 @@ function bf(e) {
 		} }) : t);
 	}
 }
-function xf(e, t) {
-	if (!_f(t)) return !1;
-	let n = bf(e);
-	return new Set(n.map((e) => e.handle)).size === n.length && Object.keys(t).length === n.length && n.every((e) => Object.hasOwn(t, e.handle) && (t[e.handle] === null && e.nullable || mf(t[e.handle], e.jsonSchema)));
+function Sf(e, t) {
+	if (!vf(t)) return !1;
+	let n = xf(e);
+	return new Set(n.map((e) => e.handle)).size === n.length && Object.keys(t).length === n.length && n.every((e) => Object.hasOwn(t, e.handle) && (t[e.handle] === null && e.nullable || hf(t[e.handle], e.jsonSchema)));
 }
 //#endregion
 //#region src/flow/common/graph.ts
-function Sf(e) {
+function Cf(e) {
 	return e?.kind == "approval" || e?.kind == "wait";
 }
-function Cf(e) {
+function wf(e) {
 	return e.kind == "wait" ? ["continue"] : ["approve", "reject"];
 }
-function wf(e) {
-	let t = Cf(e);
+function Tf(e) {
+	let t = wf(e);
 	return {
 		pending: {
 			nullable: !1,
@@ -7721,27 +7721,27 @@ function wf(e) {
 }
 //#endregion
 //#region src/execution/common/scheduler.ts
-function Tf(e, t) {
+function Ef(e, t) {
 	return e.edges.some((e) => e.source == t && e.sourceHandle == "pending") || Object.values(e.nodes).some((e) => "inputs" in e && Object.values(e.inputs).some((e) => e.kind == "sources" && e.sources.some((e) => e.kind == "node" && e.nodeId == t && e.output == "pending")));
 }
-var Ef = 12e4;
-function Df(e, t) {
+var Df = 12e4;
+function Of(e, t) {
 	return t?.(e) ?? {
 		code: "node.failed",
 		message: e instanceof Error ? e.message : String(e)
 	};
 }
-function Of(e, t) {
+function kf(e, t) {
 	switch (t.kind) {
 		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
-		case "subflow": return Qc(e.subflows[t.subflowId].inputs);
-		case "task": return Qc([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
+		case "subflow": return $c(e.subflows[t.subflowId].inputs);
+		case "task": return $c([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
 		case "approval":
 		case "wait": return { [t.input.handle]: t.input };
 	}
 }
-function kf(e, t) {
+function Af(e, t) {
 	if (t.name != null) return t.name;
 	switch (t.kind) {
 		case "condition": return;
@@ -7752,45 +7752,45 @@ function kf(e, t) {
 		case "wait": return "Wait";
 	}
 }
-function Af(e, t) {
+function jf(e, t) {
 	return t.kind == "task" ? t.task == null ? e.tasks[t.taskId].executor.kind : "javascript" : t.kind;
 }
-function jf(e, t) {
+function Mf(e, t) {
 	if (typeof e != "object" || !e || Array.isArray(e)) throw Error(`${t} must be an object.`);
 	return e;
 }
-function Mf(e, t, n) {
+function Nf(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 Nf(e, t) {
+function Pf(e, t) {
 	if (typeof e != "string" || e.length == 0) throw Error(`${t} must be a non-empty string.`);
 	return e;
 }
-function Pf(e, t, n = 0) {
+function Ff(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) => Pf(e, t, n + 1));
-	let r = jf(e, t);
-	return Object.fromEntries(Object.entries(r).map(([e, r]) => [e, Pf(r, t, n + 1)]));
+	if (Array.isArray(e)) return e.map((e) => Ff(e, t, n + 1));
+	let r = Mf(e, t);
+	return Object.fromEntries(Object.entries(r).map(([e, r]) => [e, Ff(r, t, n + 1)]));
 }
-var Ff = rs({
+var If = rs({
 	state: Fs(),
 	callId: A().min(1),
 	toolId: A().min(1),
 	input: I(A(), Fs()),
 	rounds: M().int().nonnegative(),
 	version: R(1)
-}), If = F([rs({
+}), Lf = F([rs({
 	kind: R("completed"),
 	output: Fs()
 }), rs({
 	kind: R("suspended"),
-	checkpoint: Ff
+	checkpoint: If
 })]);
-function Lf(e) {
-	let t = jf(e, "Flow Run checkpoint");
-	if (Mf(t, [
+function Rf(e) {
+	let t = Mf(e, "Flow Run checkpoint");
+	if (Nf(t, [
 		"agents",
 		"bindingValues",
 		"counts",
@@ -7800,56 +7800,64 @@ function Lf(e) {
 		"version",
 		"waits"
 	], "Flow Run checkpoint"), t.version != 5) throw Error("Flow Run checkpoint version is unsupported.");
-	let n = Object.fromEntries(Object.entries(jf(t.bindingValues, "Checkpoint bindings")).map(([e, t]) => {
+	let n = Object.fromEntries(Object.entries(Mf(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(jf(t.inputs, "Checkpoint inputs")).map(([e, t]) => [e, Object.fromEntries(Object.entries(jf(t, "Checkpoint node inputs")).map(([e, t]) => [e, Pf(t, "Checkpoint input")]))])), i = Object.fromEntries(Object.entries(jf(t.results, "Checkpoint results")).map(([e, t]) => {
-		let n = jf(t, "Checkpoint result");
-		return Mf(n, ["jobId", "outputs"], "Checkpoint result"), [e, {
-			jobId: Nf(n.jobId, "Checkpoint job ID"),
-			outputs: Object.fromEntries(Object.entries(jf(n.outputs, "Checkpoint outputs")).map(([e, t]) => [e, Pf(t, "Checkpoint output")]))
+	})), r = Object.fromEntries(Object.entries(Mf(t.inputs, "Checkpoint inputs")).map(([e, t]) => [e, Object.fromEntries(Object.entries(Mf(t, "Checkpoint node inputs")).map(([e, t]) => [e, Ff(t, "Checkpoint input")]))])), i = Object.fromEntries(Object.entries(Mf(t.results, "Checkpoint results")).map(([e, t]) => {
+		let n = Mf(t, "Checkpoint result");
+		return Nf(n, ["jobId", "outputs"], "Checkpoint result"), [e, {
+			jobId: Pf(n.jobId, "Checkpoint job ID"),
+			outputs: Object.fromEntries(Object.entries(Mf(n.outputs, "Checkpoint outputs")).map(([e, t]) => [e, Ff(t, "Checkpoint output")]))
 		}];
-	})), a = I(A(), I(A(), M().int().positive().max(2 ** 53 - 1))).parse(t.counts), o = I(A(), I(A(), I(A(), Fs()))).parse(t.frames), s = N(rs({
+	})), a = I(A(), I(A(), M().int().positive().max(2 ** 53 - 1))).parse(t.counts), o = I(A(), I(A(), I(A(), Fs()))).parse(t.frames), s = {
 		jobId: A().min(1),
 		nodeId: A().min(1),
 		value: Fs(),
-		waitId: A().min(1),
+		waitId: A().min(1)
+	}, c = N(F([rs({
+		...s,
 		pending: Fs().optional()
-	})).min(1).parse(t.waits), c = I(A(), rs({
+	}), rs({
+		...s,
+		notification: Fs().optional()
+	}).transform(({ notification: e, ...t }) => ({
+		...t,
+		pending: e
+	}))])).min(1).parse(t.waits), l = I(A(), rs({
 		invocationId: A().min(1),
 		input: I(A(), Fs()),
 		remainingMs: M().positive().optional(),
-		checkpoint: Ff
-	})).parse(t.agents), l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Set();
-	for (let e of s) {
-		if (l.has(e.jobId) || u.has(e.waitId) || o[e.jobId] == null || Object.values(i).some((t) => t.jobId == e.jobId)) throw Error("Checkpoint waiting execution states conflict.");
-		l.add(e.jobId), u.add(e.waitId);
-	}
-	if (Object.keys(o).some((e) => !l.has(e))) throw Error("Checkpoint frame has no waiting execution.");
-	if (Object.keys(c).some((e) => !l.has(e))) throw Error("Checkpoint Agent has no waiting execution.");
+		checkpoint: If
+	})).parse(t.agents), u = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set();
+	for (let e of c) {
+		if (u.has(e.jobId) || d.has(e.waitId) || o[e.jobId] == null || Object.values(i).some((t) => t.jobId == e.jobId)) throw Error("Checkpoint waiting execution states conflict.");
+		u.add(e.jobId), d.add(e.waitId);
+	}
+	if (Object.keys(o).some((e) => !u.has(e))) throw Error("Checkpoint frame has no waiting execution.");
+	if (Object.keys(l).some((e) => !u.has(e))) throw Error("Checkpoint Agent has no waiting execution.");
 	return {
-		agents: c,
+		agents: l,
 		bindingValues: n,
 		counts: a,
 		frames: o,
 		inputs: r,
 		results: i,
 		version: 5,
-		waits: s
+		waits: c
 	};
 }
-function Rf(e, t) {
+function zf(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) => Rf(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) => zf(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) && Rf(t, i[e]));
+	return n.length == r.length && n.every(([e, t]) => Object.hasOwn(i, e) && zf(t, i[e]));
 }
-function zf(e, t, n) {
+function Bf(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 && Rf(r, i);
-		case "!=": return i !== void 0 && !Rf(r, i);
+		case "==": return i !== void 0 && zf(r, i);
+		case "!=": return i !== void 0 && !zf(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;
@@ -7857,7 +7865,7 @@ function zf(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) => Rf(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) => zf(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);
@@ -7870,7 +7878,7 @@ function zf(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) => Rf(e, i));
+			let e = Object.values(r).some((e) => zf(e, i));
 			return t.operator == "hasValue" ? e : !e;
 		}
 		case "isEmpty":
@@ -7884,17 +7892,17 @@ function zf(e, t, n) {
 		case "isFalse": return r === !1;
 	}
 }
-function Bf(e, t) {
+function Vf(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 Vf(e, t) {
+function Hf(e, t) {
 	let n = t.kind == "task" && t.taskId != null ? e.tasks[t.taskId] : void 0;
 	return n?.executor.kind == "agent" ? n.executor : void 0;
 }
-function Hf(e, t, n) {
-	let r = Vf(e, t)?.notification;
+function Uf(e, t, n) {
+	let r = Hf(e, t)?.notification;
 	if (r == null) return;
 	let i = e.tasks[r.taskId];
 	return {
@@ -7903,17 +7911,17 @@ function Hf(e, t, n) {
 		input: Object.fromEntries(i.inputs.flatMap((e) => {
 			if (!("handle" in e) || e.handle == r.messageHandle) return [];
 			let t = r.inputs[e.handle];
-			return [[e.handle, t == null ? e.value ?? null : hf(t, n)]];
+			return [[e.handle, t == null ? e.value ?? null : gf(t, n)]];
 		}))
 	};
 }
-function Uf(e, t, n) {
+function Wf(e, t, n) {
 	let r = e.tools.find((e) => e.id == t.toolId);
 	if (r == null || !r.approval || t.rounds > e.maxRounds) throw Error("Agent pause does not match its tool declaration.");
 	for (let e of r.inputs) {
 		let r = t.input[e.handle];
-		if (r === void 0 || !(r === null && e.nullable) && !mf(r, e.jsonSchema)) throw Error("Agent pause arguments are invalid.");
-		if (e.source.kind != "model" && !Rf(r, hf(e.source, n))) throw Error("Agent pause changed fixed arguments.");
+		if (r === void 0 || !(r === null && e.nullable) && !hf(r, e.jsonSchema)) throw Error("Agent pause arguments are invalid.");
+		if (e.source.kind != "model" && !zf(r, gf(e.source, n))) throw Error("Agent pause changed fixed arguments.");
 	}
 	if (Object.keys(t.input).length != r.inputs.length) throw Error("Agent pause contains undeclared arguments.");
 	return {
@@ -7924,8 +7932,8 @@ function Uf(e, t, n) {
 		input: t.input
 	};
 }
-function Wf(e, t, n, r) {
-	let i = Bf(r, t), a = n.kind == "task" && n.taskId != null && e.tasks[n.taskId].executor.kind == "connector", o = Sf(n) ? wf(n) : n.kind == "task" ? Qc(n.task == null ? e.tasks[n.taskId].outputs : n.task.outputs) : n.kind == "subflow" ? Qc(e.subflows[n.subflowId].outputs) : n.kind == "value" ? Qc(n.values) : Object.fromEntries([...n.cases.map((e) => e.output), ...n.defaultOutput == null ? [] : [n.defaultOutput]].map((e) => [e, n.input])), s = Bf(Pf(Object.fromEntries(Object.entries(i).map(([e, t]) => [e, Object.hasOwn(o, e) && t === void 0 ? null : t])), `Node "${t}" outputs`), t), c = n.kind == "condition" || Sf(n) ? s : {
+function Gf(e, t, n, r) {
+	let i = Vf(r, t), a = n.kind == "task" && n.taskId != null && e.tasks[n.taskId].executor.kind == "connector", o = Cf(n) ? Tf(n) : n.kind == "task" ? $c(n.task == null ? e.tasks[n.taskId].outputs : n.task.outputs) : n.kind == "subflow" ? $c(e.subflows[n.subflowId].outputs) : n.kind == "value" ? $c(n.values) : Object.fromEntries([...n.cases.map((e) => e.output), ...n.defaultOutput == null ? [] : [n.defaultOutput]].map((e) => [e, n.input])), s = Vf(Ff(Object.fromEntries(Object.entries(i).map(([e, t]) => [e, Object.hasOwn(o, e) && t === void 0 ? null : t])), `Node "${t}" outputs`), t), c = n.kind == "condition" || Cf(n) ? s : {
 		...Object.fromEntries(Object.keys(o).map((e) => [e, null])),
 		...s
 	}, l = {};
@@ -7935,12 +7943,12 @@ function Wf(e, t, n, r) {
 			if (a) continue;
 			throw Error(`Node "${t}" output "${e}" does not match its declaration.`);
 		}
-		if (!(n === null && r.nullable) && !mf(n, r.jsonSchema)) throw Error(`Node "${t}" output "${e}" does not match its declaration.`);
+		if (!(n === null && r.nullable) && !hf(n, r.jsonSchema)) throw Error(`Node "${t}" output "${e}" does not match its declaration.`);
 		l[e] = n;
 	}
 	return l;
 }
-function Gf(e, t, n, r) {
+function Kf(e, t, n, r) {
 	let i = n.inputs, a = n.agents;
 	if ([...Object.keys(n.results), ...Object.keys(i)].some((e) => t.graph.nodes[e] == null)) throw Error("Checkpoint nodes do not match the prepared graph.");
 	for (let [r, i] of Object.entries(n.counts)) {
@@ -7957,10 +7965,10 @@ function Gf(e, t, n, r) {
 			if (r == null) throw Error("Checkpoint result node is missing.");
 			if ("inputs" in r) {
 				if (n.counts[""]?.[a] == null) throw Error("Checkpoint execution count is missing.");
-				if (!Rf(Wf(e, a, r, o), o)) throw Error("Checkpoint node outputs are incomplete.");
+				if (!zf(Gf(e, a, r, o), o)) throw Error("Checkpoint node outputs are incomplete.");
 				let t = Object.keys(o).length;
-				if (r.kind == "condition" && (t > 1 || r.defaultOutput != null && t != 1) || Sf(r) && (Cf(r).filter((e) => Object.hasOwn(o, e)).length > 1 || !Cf(r).some((e) => Object.hasOwn(o, e)) && !(i && Object.hasOwn(o, "pending")))) throw Error("Checkpoint branch result is invalid.");
-			} else if (!xf(r, o)) throw Error("Checkpoint Trigger output is invalid.");
+				if (r.kind == "condition" && (t > 1 || r.defaultOutput != null && t != 1) || Cf(r) && (wf(r).filter((e) => Object.hasOwn(o, e)).length > 1 || !wf(r).some((e) => Object.hasOwn(o, e)) && !(i && Object.hasOwn(o, "pending")))) throw Error("Checkpoint branch result is invalid.");
+			} else if (!Sf(r, o)) throw Error("Checkpoint Trigger output is invalid.");
 		}
 	};
 	o(Object.fromEntries(Object.entries(n.results).map(([e, t]) => [e, t.outputs])));
@@ -7969,36 +7977,36 @@ function Gf(e, t, n, r) {
 	for (let e of Object.values(n.frames)) {
 		o(e, !0);
 		let r = Object.keys(e).filter((e) => !("inputs" in t.graph.nodes[e]));
-		if (r.length != 1 || r[0] != s[0] || !Rf(e[r[0]], n.results[r[0]].outputs)) throw Error("Checkpoint frame Trigger does not match the Run.");
+		if (r.length != 1 || r[0] != s[0] || !zf(e[r[0]], n.results[r[0]].outputs)) throw Error("Checkpoint frame Trigger does not match the Run.");
 	}
 	let c = /* @__PURE__ */ new Map();
 	for (let e of n.waits) c.set(e.nodeId, (c.get(e.nodeId) ?? 0) + 1);
 	for (let [e, t] of c) if ((n.counts[""]?.[e] ?? 0) < t + (n.results[e] == null ? 0 : 1)) throw Error("Checkpoint waiting execution count is incomplete.");
 	for (let [n, r] of Object.entries(i)) {
 		let i = t.graph.nodes[n];
-		if (!("inputs" in i) || Object.keys(r).some((t) => Of(e, i)[t] == null)) throw Error("Checkpoint launch inputs do not match the prepared graph.");
+		if (!("inputs" in i) || Object.keys(r).some((t) => kf(e, i)[t] == null)) throw Error("Checkpoint launch inputs do not match the prepared graph.");
 	}
 	for (let i of n.waits) {
 		let o = t.graph.nodes[i.nodeId];
 		if (o == null || !("inputs" in o)) throw Error("Checkpoint waiting node is missing.");
-		let s = Vf(e, o), c = a[i.jobId];
-		if (!Sf(o) && s == null) throw Error("Checkpoint waiting node cannot suspend.");
+		let s = Hf(e, o), c = a[i.jobId];
+		if (!Cf(o) && s == null) throw Error("Checkpoint waiting node cannot suspend.");
 		if (s != null) {
 			if (c != null && c.invocationId != i.jobId) throw Error("Checkpoint Agent invocation identity changed.");
 			if (c == null || o.timeoutMs == null != (c.remainingMs == null) || c.remainingMs != null && c.remainingMs > o.timeoutMs) throw Error("Checkpoint Agent budget is invalid.");
-			let e = Uf(s, c.checkpoint, c.input);
-			if (!Rf(i.value, e)) throw Error("Checkpoint Agent approval does not match its saved call.");
-			if (!Rf(r(i.nodeId, o, i.jobId), c.input)) throw Error("Checkpoint Agent inputs changed.");
+			let e = Wf(s, c.checkpoint, c.input);
+			if (!zf(i.value, e)) throw Error("Checkpoint Agent approval does not match its saved call.");
+			if (!zf(r(i.nodeId, o, i.jobId), c.input)) throw Error("Checkpoint Agent inputs changed.");
 		} else {
 			if (c != null) throw Error("Checkpoint Wait contains Agent state.");
-			if (!Sf(o) || !Rf(r(i.nodeId, o, i.jobId)[o.input.handle], i.value)) throw Error("Checkpoint resolution input changed.");
-			if (Tf(t.graph, i.nodeId) != (i.pending != null)) throw Error("Checkpoint Wait pending output is missing or unexpected.");
-			i.pending != null && Wf(e, i.nodeId, o, { pending: i.pending });
+			if (!Cf(o) || !zf(r(i.nodeId, o, i.jobId)[o.input.handle], i.value)) throw Error("Checkpoint resolution input changed.");
+			if (Ef(t.graph, i.nodeId) != (i.pending != null)) throw Error("Checkpoint Wait pending output is missing or unexpected.");
+			i.pending != null && Gf(e, i.nodeId, o, { pending: i.pending });
 		}
 		if (n.counts[""]?.[i.nodeId] == null) throw Error("Checkpoint waiting execution count is missing.");
 	}
 }
-function Kf(i, o, s, c, l, u = {}, d, f) {
+function qf(i, o, s, c, l, u = {}, d, f) {
 	return t.scoped(t.gen(function* () {
 		f ?? (yield* i.emit({
 			flowId: o.flowId,
@@ -8019,7 +8027,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 		if (f == null) {
 			if (d != null) {
 				let e = o.graph.nodes[d.nodeId];
-				if (e == null || "inputs" in e || !xf(e, d.outputs)) throw Error("Trigger outputs are invalid.");
+				if (e == null || "inputs" in e || !Sf(e, d.outputs)) throw Error("Trigger outputs are invalid.");
 			}
 			for (let [e, t] of Object.entries(o.graph.nodes)) "inputs" in t || d?.nodeId == e && ee.set(e, {
 				jobId: e,
@@ -8038,11 +8046,11 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 				if (t.length > 1) throw Error(`${r} has multiple available sources.`);
 				o = t[0] ?? null;
 			}
-			if (o === void 0 && (o = null), !(o === null && t.nullable) && !mf(o, t.jsonSchema)) throw Error(`${r} does not match its declared schema.`);
+			if (o === void 0 && (o = null), !(o === null && t.nullable) && !hf(o, t.jsonSchema)) throw Error(`${r} does not match its declared schema.`);
 			return o;
 		}, fe = (e, t, n) => {
 			let r = t.inputs;
-			return Object.fromEntries(Object.entries(Of(i.prepared, t)).map(([t, i]) => [t, de(r[t], i, re[e]?.[t], `Node "${e}" input "${t}"`, ne[n])]));
+			return Object.fromEntries(Object.entries(kf(i.prepared, t)).map(([t, i]) => [t, de(r[t], i, re[e]?.[t], `Node "${e}" input "${t}"`, ne[n])]));
 		}, pe = (e, n, r, a = Object.keys(r)) => t.uninterruptible(t.gen(function* () {
 			yield* i.emit({
 				jobId: n,
@@ -8067,9 +8075,9 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 		}, ge = (e, t, n) => {
 			for (let r of h.get(e) ?? []) (r.sourceHandle == null || t.includes(r.sourceHandle)) && he(r.target, n);
 		}, _e = (e, n, r, a, c) => {
-			let l = Vf(i.prepared, n), u = ue[r], d = u?.remainingMs ?? n.timeoutMs, f = performance.now(), p = t.gen(function* () {
-				let p = Af(i.prepared, n), m = kf(i.prepared, n), h = Object.fromEntries(Object.entries(a).filter(([e]) => {
-					if (Sf(n)) return e == n.input.handle;
+			let l = Hf(i.prepared, n), u = ue[r], d = u?.remainingMs ?? n.timeoutMs, f = performance.now(), p = t.gen(function* () {
+				let p = jf(i.prepared, n), m = Af(i.prepared, n), h = Object.fromEntries(Object.entries(a).filter(([e]) => {
+					if (Cf(n)) return e == n.input.handle;
 					let t = n.inputs[e];
 					return t?.kind != "sources" || t.sources.every((e) => e.kind != "binding");
 				}));
@@ -8087,7 +8095,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 					case "condition": {
 						let e = n.cases.find((e) => {
 							if (e.expressions.length == 0) return !1;
-							let t = e.expressions.map((e) => zf(n, e, a));
+							let t = e.expressions.map((e) => Bf(n, e, a));
 							return e.relation == "all" ? t.every(Boolean) : t.some(Boolean);
 						})?.output ?? n.defaultOutput;
 						g = e == null ? {} : { [e]: a[n.input.handle] ?? null };
@@ -8098,7 +8106,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 						break;
 					case "subflow": {
 						let e = i.prepared.subflows[n.subflowId];
-						g = yield* Kf(i, {
+						g = yield* qf(i, {
 							flowId: n.subflowId,
 							graph: e.graph,
 							kind: "subflow"
@@ -8128,10 +8136,10 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 							}
 						});
 						if (l != null) {
-							let n = If.parse(m);
+							let n = Lf.parse(m);
 							if (n.kind == "suspended") {
 								if (o.kind != "flow") return yield* t.fail(/* @__PURE__ */ Error("Subflow Agent is not supported."));
-								let i = n.checkpoint, s = Uf(l, i, a), c = d == null ? void 0 : d - (performance.now() - f);
+								let i = n.checkpoint, s = Wf(l, i, a), c = d == null ? void 0 : d - (performance.now() - f);
 								if (c != null && c <= 0) throw Error(`Node "${e}" timed out.`);
 								return {
 									kind: "suspended",
@@ -8145,7 +8153,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 								};
 							}
 							g = { output: n.output };
-						} else g = Bf(m, e);
+						} else g = Vf(m, e);
 						break;
 					}
 					case "approval":
@@ -8154,7 +8162,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 				return yield* t.try({
 					try: () => ({
 						kind: "completed",
-						outputs: Wf(i.prepared, e, n, g)
+						outputs: Gf(i.prepared, e, n, g)
 					}),
 					catch: (e) => e instanceof Error ? e : Error(String(e))
 				});
@@ -8165,18 +8173,18 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 			}));
 		}, ve = (e, n, s) => t.gen(function* () {
 			if (o.kind != "flow" || i.waits == null) return yield* t.fail(/* @__PURE__ */ Error("Wait host is unavailable."));
-			let c = o.graph.nodes[e], l = a(), u = Sf(c) && Tf(o.graph, e), d = yield* i.waits.create({
+			let c = o.graph.nodes[e], l = a(), u = Cf(c) && Ef(o.graph, e), d = yield* i.waits.create({
 				jobId: n,
 				nodeId: e,
 				value: s,
 				waitId: l,
 				notify: u,
-				actions: Sf(c) ? Cf(c) : ["approve", "reject"],
-				prompt: Sf(c) ? c.prompt : JSON.stringify(s, null, 2),
-				...Sf(c) ? {} : { notification: Hf(i.prepared, c, ue[n].input) }
+				actions: Cf(c) ? wf(c) : ["approve", "reject"],
+				prompt: Cf(c) ? c.prompt : JSON.stringify(s, null, 2),
+				...Cf(c) ? {} : { notification: Uf(i.prepared, c, ue[n].input) }
 			});
 			if (u) {
-				Wf(i.prepared, e, c, { pending: d });
+				Gf(i.prepared, e, c, { pending: d });
 				let t = {
 					...ne[n],
 					[e]: { pending: d }
@@ -8192,7 +8200,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 			}), yield* r.offer(v, void 0);
 		}), ye = (e, t, n) => n.kind == "completed" ? (delete ue[t], pe(e, t, n.outputs)) : (ue[t] = n.agent, ve(e, t, n.value)), be = (e, n, r) => r.pipe(t.catchDefect((e) => t.fail(e instanceof Error ? e : Error(String(e)))), t.tapError((r) => t.gen(function* () {
 			oe ?? (se ??= r), yield* i.emit({
-				...Df(r, i.projectFailure),
+				...Of(r, i.projectFailure),
 				jobId: n,
 				nodeId: e,
 				runId: s,
@@ -8214,7 +8222,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 					try: () => fe(e, a, c),
 					catch: (e) => e instanceof Error ? e : Error(String(e))
 				});
-				if (Sf(a)) {
+				if (Cf(a)) {
 					let t = a.inputs[a.input.handle];
 					yield* i.emit({
 						inputs: t?.kind == "sources" && t.sources.some((e) => e.kind == "binding") ? {} : { [a.input.handle]: n[a.input.handle] },
@@ -8232,7 +8240,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 			})).pipe(t.ensuring(r.offer(v, void 0))));
 		};
 		if (f != null && (yield* t.try({
-			try: () => Gf(i.prepared, o, f.checkpoint, fe),
+			try: () => Kf(i.prepared, o, f.checkpoint, fe),
 			catch: (e) => e instanceof Error ? e : Error(String(e))
 		})), f == null) {
 			if (d != null) ge(d.nodeId, Object.keys(d.outputs), { [d.nodeId]: d.outputs });
@@ -8245,9 +8253,9 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 				le != null && (le = void 0, ce = n), _.delete(a.jobId);
 				let c = o.graph.nodes[a.nodeId];
 				ae(be(a.nodeId, a.jobId, t.gen(function* () {
-					if (Sf(c)) {
-						if (!Cf(c).some((e) => e == s)) return yield* t.fail(/* @__PURE__ */ Error("Resolution does not match node actions."));
-						yield* pe(a.nodeId, a.jobId, Wf(i.prepared, a.nodeId, c, {
+					if (Cf(c)) {
+						if (!wf(c).some((e) => e == s)) return yield* t.fail(/* @__PURE__ */ Error("Resolution does not match node actions."));
+						yield* pe(a.nodeId, a.jobId, Gf(i.prepared, a.nodeId, c, {
 							...a.pending == null ? {} : { pending: a.pending },
 							[s]: a.value
 						}), [s]);
@@ -8272,7 +8280,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 			if (oe != null) continue;
 			if (o == 0 && _.size == 0 && me.length == 0) break;
 			o > 0 || me.length > 0 ? le = void 0 : le ??= a;
-			let c = le == null ? y : Ef - (a - le);
+			let c = le == null ? y : Df - (a - le);
 			if (le != null && c <= 0) {
 				let e = {
 					bindingValues: i.bindingValues,
@@ -8286,7 +8294,7 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 				}, n = JSON.stringify(e);
 				return new TextEncoder().encode(n).byteLength > 16777216 ? yield* t.fail(/* @__PURE__ */ Error("Flow Run checkpoint exceeds 16 MiB.")) : {
 					kind: "waiting",
-					checkpoint: Lf(JSON.parse(n)),
+					checkpoint: Rf(JSON.parse(n)),
 					...y == null ? {} : { remainingMs: y }
 				};
 			}
@@ -8334,15 +8342,15 @@ function Kf(i, o, s, c, l, u = {}, d, f) {
 		}), Se;
 	}));
 }
-function qf(e, n) {
+function Jf(e, n) {
 	let r = n.emit ?? (() => t.void);
 	return t.gen(function* () {
 		if (n.resume != null && (n.inputs != null || n.trigger != null || n.bindingValues != null)) return yield* t.fail(/* @__PURE__ */ Error("A resumed Flow Run cannot accept launch inputs, binding values, or a Trigger seed."));
-		let i = n.resume == null ? void 0 : Lf(n.resume.checkpoint);
+		let i = n.resume == null ? void 0 : Rf(n.resume.checkpoint);
 		if (i != null && new TextEncoder().encode(JSON.stringify(i)).byteLength > 16777216) return yield* t.fail(/* @__PURE__ */ Error("Flow Run checkpoint exceeds 16 MiB."));
 		if (i == null && n.trigger == null) return yield* t.fail(/* @__PURE__ */ Error("A Flow Run requires a Trigger seed."));
 		let a = n.trigger == null ? void 0 : e.graph.nodes[n.trigger.nodeId];
-		return n.trigger != null && (a == null || "inputs" in a) ? yield* t.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* Kf({
+		return n.trigger != null && (a == null || "inputs" in a) ? yield* t.fail(/* @__PURE__ */ Error(`Node "${n.trigger.nodeId}" is not a TriggerNode in Flow "${n.flowId}".`)) : yield* qf({
 			counts: Object.fromEntries(Object.entries(i?.counts ?? {}).map(([e, t]) => [e, { ...t }])),
 			bindingValues: i?.bindingValues ?? n.bindingValues ?? {},
 			createId: n.createId,
@@ -8360,4 +8368,4 @@ function qf(e, n) {
 	});
 }
 //#endregion
-export { Lf as decodeFlowRunCheckpoint, qf as runFlow, Ef as waitRetentionMs };
+export { Rf as decodeFlowRunCheckpoint, Jf as runFlow, Df as waitRetentionMs };