@oomol-lab/open-flow 0.1.0-beta.16 → 0.1.0-beta.18

package/dist/common/scheduler.js

@@ -3519,55 +3519,55 @@ var D = /*@__PURE__*/ x("ZodType", (e, t) => (Co(), C.init(e, t), e.def = t, e.t
 		return e.add(this, t), this;
 	},
 	refine(e, t) {
-		return this.check(Bs(e, t));
+		return this.check(Vs(e, t));
 	},
 	superRefine(e, t) {
-		return this.check(Vs(e, t));
+		return this.check(Hs(e, t));
 	},
 	overwrite(e) {
 		return this.check(/* @__PURE__ */ oa(e));
 	},
 	optional() {
-		return bs(this);
+		return xs(this);
 	},
 	exactOptional() {
-		return Ss(this);
+		return Cs(this);
 	},
 	nullable() {
-		return ws(this);
+		return Ts(this);
 	},
 	nullish() {
-		return bs(ws(this));
+		return xs(Ts(this));
 	},
 	nonoptional(e) {
-		return As(this, e);
+		return js(this, e);
 	},
 	array() {
-		return M(this);
+		return j(this);
 	},
 	or(e) {
-		return P([this, e]);
+		return N([this, e]);
 	},
 	and(e) {
-		return ds(this, e);
+		return fs(this, e);
 	},
 	transform(e) {
-		return Ps(this, vs(e));
+		return Fs(this, ys(e));
 	},
 	default(e) {
-		return Es(this, e);
+		return Ds(this, e);
 	},
 	prefault(e) {
-		return Os(this, e);
+		return ks(this, e);
 	},
 	catch(e) {
-		return Ms(this, e);
+		return Ns(this, e);
 	},
 	pipe(e) {
-		return Ps(this, e);
+		return Fs(this, e);
 	},
 	readonly() {
-		return Is(this);
+		return Ls(this);
 	},
 	describe(e) {
 		let t = this.clone();
@@ -3896,28 +3896,28 @@ function Qo(e) {
 var $o = /*@__PURE__*/ x("ZodBoolean", (e, t) => {
 	ar.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Na(e, t, n, r);
 });
-function j(e) {
+function es(e) {
 	return /* @__PURE__ */ Hi($o, e);
 }
-var es = /*@__PURE__*/ x("ZodNull", (e, t) => {
+var ts = /*@__PURE__*/ x("ZodNull", (e, t) => {
 	or.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Pa(e, t, n, r);
 });
-function ts(e) {
-	return /* @__PURE__ */ Ui(es, e);
+function ns(e) {
+	return /* @__PURE__ */ Ui(ts, e);
 }
-var ns = /*@__PURE__*/ x("ZodUnknown", (e, t) => {
+var rs = /*@__PURE__*/ x("ZodUnknown", (e, t) => {
 	sr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (e, t, n) => void 0;
 });
-function rs() {
-	return /* @__PURE__ */ Wi(ns);
+function is() {
+	return /* @__PURE__ */ Wi(rs);
 }
-var is = /*@__PURE__*/ x("ZodNever", (e, t) => {
+var as = /*@__PURE__*/ x("ZodNever", (e, t) => {
 	cr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Fa(e, t, n, r);
 });
-function as(e) {
-	return /* @__PURE__ */ Gi(is, e);
+function os(e) {
+	return /* @__PURE__ */ Gi(as, e);
 }
-var os = /*@__PURE__*/ x("ZodArray", (e, t) => {
+var ss = /*@__PURE__*/ x("ZodArray", (e, t) => {
 	wo(), ur.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ba(e, t, n, r), e.element = t.element;
 }, {
 	min(e, t) {
@@ -3936,14 +3936,14 @@ var os = /*@__PURE__*/ x("ZodArray", (e, t) => {
 		return this.element;
 	}
 });
-function M(e, t) {
-	return /* @__PURE__ */ fa(os, e, t);
+function j(e, t) {
+	return /* @__PURE__ */ fa(ss, e, t);
 }
-var ss = /*@__PURE__*/ x("ZodObject", (e, t) => {
+var cs = /*@__PURE__*/ x("ZodObject", (e, t) => {
 	wo(), _r.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ha(e, t, n, r), Ie(e, "shape", (e) => e._zod.def.shape, !1);
 }, {
 	keyof() {
-		return I(Object.keys(this._zod.def.shape));
+		return F(Object.keys(this._zod.def.shape));
 	},
 	catchall(e) {
 		return this.clone({
@@ -3954,19 +3954,19 @@ var ss = /*@__PURE__*/ x("ZodObject", (e, t) => {
 	passthrough() {
 		return this.clone({
 			...this._zod.def,
-			catchall: rs()
+			catchall: is()
 		});
 	},
 	loose() {
 		return this.clone({
 			...this._zod.def,
-			catchall: rs()
+			catchall: is()
 		});
 	},
 	strict() {
 		return this.clone({
 			...this._zod.def,
-			catchall: as()
+			catchall: os()
 		});
 	},
 	strip() {
@@ -3991,51 +3991,51 @@ var ss = /*@__PURE__*/ x("ZodObject", (e, t) => {
 		return fe(this, e);
 	},
 	partial(...e) {
-		return ge(ys, this, e[0]);
+		return ge(bs, this, e[0]);
 	},
 	exactPartial(...e) {
-		return ge(xs, this, e[0], "exactPartial");
+		return ge(Ss, this, e[0], "exactPartial");
 	},
 	required(...e) {
-		return _e(ks, this, e[0]);
+		return _e(As, this, e[0]);
 	}
 });
-function N(e, t) {
-	return new ss({
+function M(e, t) {
+	return new cs({
 		type: "object",
 		shape: e ?? {},
 		...v(t)
 	});
 }
-function cs(e, t) {
-	return new ss({
+function ls(e, t) {
+	return new cs({
 		type: "object",
 		shape: e,
-		catchall: as(),
+		catchall: os(),
 		...v(t)
 	});
 }
-var ls = /*@__PURE__*/ x("ZodUnion", (e, t) => {
+var us = /*@__PURE__*/ x("ZodUnion", (e, t) => {
 	yr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ua(e, t, n, r), e.options = t.options;
 });
-function P(e, t) {
-	return new ls({
+function N(e, t) {
+	return new us({
 		type: "union",
 		options: e,
 		...v(t)
 	});
 }
-var us = /*@__PURE__*/ x("ZodIntersection", (e, t) => {
+var ds = /*@__PURE__*/ x("ZodIntersection", (e, t) => {
 	br.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Wa(e, t, n, r);
 });
-function ds(e, t) {
-	return new us({
+function fs(e, t) {
+	return new ds({
 		type: "intersection",
 		left: e,
 		right: t
 	});
 }
-var fs = /*@__PURE__*/ x("ZodTuple", (e, t) => {
+var ps = /*@__PURE__*/ x("ZodTuple", (e, t) => {
 	wo(), Cr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ga(e, t, n, r);
 }, {
 	rest(e) {
@@ -4049,46 +4049,46 @@ var fs = /*@__PURE__*/ x("ZodTuple", (e, t) => {
 		if (e.checks?.length) throw Error(".partial() cannot be used on tuple schemas containing refinements");
 		return this.clone({
 			...e,
-			items: e.items.map((e) => new ys({
+			items: e.items.map((e) => new bs({
 				type: "optional",
 				innerType: e
 			}))
 		});
 	}
 });
-function ps(e, t, n) {
+function ms(e, t, n) {
 	let r = t instanceof C;
-	return new fs({
+	return new ps({
 		type: "tuple",
 		items: e,
 		rest: r ? t : null,
 		...v(r ? n : t)
 	});
 }
-var ms = /*@__PURE__*/ x("ZodRecord", (e, t) => {
+var hs = /*@__PURE__*/ x("ZodRecord", (e, t) => {
 	wo(), Dr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ya(e, t, n, r), e.keyType = t.keyType, e.valueType = t.valueType;
 });
-function F(e, t, n) {
-	return !t || !t._zod ? new ms({
+function P(e, t, n) {
+	return !t || !t._zod ? new hs({
 		type: "record",
 		keyType: O(),
 		valueType: e,
 		...v(t)
-	}) : new ms({
+	}) : new hs({
 		type: "record",
 		keyType: e,
 		valueType: t,
 		...v(n)
 	});
 }
-var hs = /*@__PURE__*/ x("ZodEnum", (e, t) => {
+var gs = /*@__PURE__*/ x("ZodEnum", (e, t) => {
 	Or.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ia(e, t, n, r), e.enum = t.entries, e.options = Object.values(t.entries);
 	let n = new Set(Object.keys(t.entries));
 	e.extract = (e, r) => {
 		let i = {};
 		for (let r of e) if (n.has(r)) i[r] = t.entries[r];
 		else throw Error(`Key ${r} not found in enum`);
-		return new hs({
+		return new gs({
 			...t,
 			checks: [],
 			...v(r),
@@ -4098,7 +4098,7 @@ var hs = /*@__PURE__*/ x("ZodEnum", (e, t) => {
 		let i = { ...t.entries };
 		for (let t of e) if (n.has(t)) delete i[t];
 		else throw Error(`Key ${t} not found in enum`);
-		return new hs({
+		return new gs({
 			...t,
 			checks: [],
 			...v(r),
@@ -4106,27 +4106,27 @@ var hs = /*@__PURE__*/ x("ZodEnum", (e, t) => {
 		});
 	};
 });
-function I(e, t) {
-	return new hs({
+function F(e, t) {
+	return new gs({
 		type: "enum",
 		entries: Array.isArray(e) ? Object.fromEntries(e.map((e) => [e, e])) : e,
 		...v(t)
 	});
 }
-var gs = /*@__PURE__*/ x("ZodLiteral", (e, t) => {
+var _s = /*@__PURE__*/ x("ZodLiteral", (e, t) => {
 	kr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => La(e, t, n, r), e.values = new Set(t.values), Object.defineProperty(e, "value", { get() {
 		if (t.values.length > 1) throw Error("This schema contains multiple valid literal values. Use `.values` instead.");
 		return t.values[0];
 	} });
 });
-function L(e, t) {
-	return new gs({
+function I(e, t) {
+	return new _s({
 		type: "literal",
 		values: Array.isArray(e) ? e : [e],
 		...v(t)
 	});
 }
-var _s = /*@__PURE__*/ x("ZodTransform", (e, t) => {
+var vs = /*@__PURE__*/ x("ZodTransform", (e, t) => {
 	wo(), Ar.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => za(e, t, n, r), e._zod.parse = (n, r) => {
 		if (r.direction === "backward") throw new We(e.constructor.name);
 		n.addIssue = (r) => {
@@ -4140,44 +4140,44 @@ var _s = /*@__PURE__*/ x("ZodTransform", (e, t) => {
 		return i instanceof Promise ? i.then((e) => (n.value = e, n)) : (n.value = i, n);
 	};
 });
-function vs(e) {
-	return new _s({
+function ys(e) {
+	return new vs({
 		type: "transform",
 		transform: e
 	});
 }
-var ys = /*@__PURE__*/ x("ZodOptional", (e, t) => {
+var bs = /*@__PURE__*/ x("ZodOptional", (e, t) => {
 	Mr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => ao(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function bs(e) {
-	return new ys({
+function xs(e) {
+	return new bs({
 		type: "optional",
 		innerType: e
 	});
 }
-var xs = /*@__PURE__*/ x("ZodExactOptional", (e, t) => {
+var Ss = /*@__PURE__*/ x("ZodExactOptional", (e, t) => {
 	Nr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => ao(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function Ss(e) {
-	return new xs({
+function Cs(e) {
+	return new Ss({
 		type: "optional",
 		innerType: e
 	});
 }
-var Cs = /*@__PURE__*/ x("ZodNullable", (e, t) => {
+var ws = /*@__PURE__*/ x("ZodNullable", (e, t) => {
 	Pr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Xa(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function ws(e) {
-	return new Cs({
+function Ts(e) {
+	return new ws({
 		type: "nullable",
 		innerType: e
 	});
 }
-var Ts = /*@__PURE__*/ x("ZodDefault", (e, t) => {
+var Es = /*@__PURE__*/ x("ZodDefault", (e, t) => {
 	Fr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => eo(e, t, n, r), e.unwrap = () => e._zod.def.innerType, e.removeDefault = e.unwrap;
 });
-function Es(e, t) {
-	return new Ts({
+function Ds(e, t) {
+	return new Es({
 		type: "default",
 		innerType: e,
 		get defaultValue() {
@@ -4185,11 +4185,11 @@ function Es(e, t) {
 		}
 	});
 }
-var Ds = /*@__PURE__*/ x("ZodPrefault", (e, t) => {
+var Os = /*@__PURE__*/ x("ZodPrefault", (e, t) => {
 	Lr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => to(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function Os(e, t) {
-	return new Ds({
+function ks(e, t) {
+	return new Os({
 		type: "prefault",
 		innerType: e,
 		get defaultValue() {
@@ -4197,118 +4197,118 @@ function Os(e, t) {
 		}
 	});
 }
-var ks = /*@__PURE__*/ x("ZodNonOptional", (e, t) => {
+var As = /*@__PURE__*/ x("ZodNonOptional", (e, t) => {
 	Rr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Za(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function As(e, t) {
-	return new ks({
+function js(e, t) {
+	return new As({
 		type: "nonoptional",
 		innerType: e,
 		...v(t)
 	});
 }
-var js = /*@__PURE__*/ x("ZodCatch", (e, t) => {
+var Ms = /*@__PURE__*/ x("ZodCatch", (e, t) => {
 	Vr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => no(e, t, n, r), e.unwrap = () => e._zod.def.innerType, e.removeCatch = e.unwrap;
 });
-function Ms(e, t) {
-	return new js({
+function Ns(e, t) {
+	return new Ms({
 		type: "catch",
 		innerType: e,
 		catchValue: typeof t == "function" ? t : Re(t)
 	});
 }
-var Ns = /*@__PURE__*/ x("ZodPipe", (e, t) => {
+var Ps = /*@__PURE__*/ x("ZodPipe", (e, t) => {
 	Hr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => ro(e, t, n, r), e.in = t.in, e.out = t.out;
 });
-function Ps(e, t) {
-	return new Ns({
+function Fs(e, t) {
+	return new Ps({
 		type: "pipe",
 		in: e,
 		out: t
 	});
 }
-var Fs = /*@__PURE__*/ x("ZodReadonly", (e, t) => {
+var Is = /*@__PURE__*/ x("ZodReadonly", (e, t) => {
 	Wr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => io(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function Is(e) {
-	return new Fs({
+function Ls(e) {
+	return new Is({
 		type: "readonly",
 		innerType: e
 	});
 }
-var Ls = /*@__PURE__*/ x("ZodLazy", (e, t) => {
+var Rs = /*@__PURE__*/ x("ZodLazy", (e, t) => {
 	Kr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => oo(e, t, n, r), e.unwrap = () => e._zod.def.getter();
 });
-function Rs(e) {
-	return new Ls({
+function zs(e) {
+	return new Rs({
 		type: "lazy",
 		getter: e
 	});
 }
-var zs = /*@__PURE__*/ x("ZodCustom", (e, t) => {
+var Bs = /*@__PURE__*/ x("ZodCustom", (e, t) => {
 	qr.init(e, t), D.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ra(e, t, n, r);
 });
-function Bs(e, t = {}) {
-	return /* @__PURE__ */ pa(zs, e, t);
+function Vs(e, t = {}) {
+	return /* @__PURE__ */ pa(Bs, e, t);
 }
-function Vs(e, t) {
+function Hs(e, t) {
 	return /* @__PURE__ */ ma(e, t);
 }
-function Hs(e) {
-	let t = Rs(() => P([
+function Us(e) {
+	let t = zs(() => N([
 		O(e),
 		A(),
-		j(),
-		ts(),
-		M(t),
-		F(O(), t)
+		es(),
+		ns(),
+		j(t),
+		P(O(), t)
 	]));
 	return t;
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/deep-compare-strict.js
-function Us(e, t) {
+function Ws(e, t) {
 	let n = typeof e;
 	if (n !== typeof t) return !1;
 	if (Array.isArray(e)) {
 		if (!Array.isArray(t)) return !1;
 		let n = e.length;
 		if (n !== t.length) return !1;
-		for (let r = 0; r < n; r++) if (!Us(e[r], t[r])) return !1;
+		for (let r = 0; r < n; r++) if (!Ws(e[r], t[r])) return !1;
 		return !0;
 	}
 	if (n === "object") {
 		if (!e || !t) return e === t;
 		let n = Object.keys(e), r = Object.keys(t);
 		if (n.length !== r.length) return !1;
-		for (let r of n) if (!Us(e[r], t[r])) return !1;
+		for (let r of n) if (!Ws(e[r], t[r])) return !1;
 		return !0;
 	}
 	return e === t;
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/pointer.js
-function Ws(e) {
-	return encodeURI(Gs(e));
-}
 function Gs(e) {
+	return encodeURI(Ks(e));
+}
+function Ks(e) {
 	return e.replace(/~/g, "~0").replace(/\//g, "~1");
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/dereference.js
-var Ks = {
+var qs = {
 	prefixItems: !0,
 	items: !0,
 	allOf: !0,
 	anyOf: !0,
 	oneOf: !0
-}, qs = {
+}, Js = {
 	$defs: !0,
 	definitions: !0,
 	properties: !0,
 	patternProperties: !0,
 	dependentSchemas: !0
-}, Js = {
+}, Ys = {
 	id: !0,
 	$id: !0,
 	$ref: !0,
@@ -4335,13 +4335,13 @@ var Ks = {
 	uniqueItems: !0,
 	maxProperties: !0,
 	minProperties: !0
-}, Ys = typeof self < "u" && self.location && self.location.origin !== "null" ? new URL(self.location.origin + self.location.pathname + location.search) : new URL("https://github.com/cfworker");
-function Xs(e, t = Object.create(null), n = Ys, r = "") {
+}, Xs = typeof self < "u" && self.location && self.location.origin !== "null" ? new URL(self.location.origin + self.location.pathname + location.search) : new URL("https://github.com/cfworker");
+function Zs(e, t = Object.create(null), n = Xs, r = "") {
 	if (e && typeof e == "object" && !Array.isArray(e)) {
 		let i = e.$id || e.id;
 		if (i) {
 			let a = new URL(i, n.href);
-			a.hash.length > 1 ? t[a.href] = e : (a.hash = "", r === "" ? n = a : Xs(e, t, n));
+			a.hash.length > 1 ? t[a.href] = e : (a.hash = "", r === "" ? n = a : Zs(e, t, n));
 		}
 	} else if (e !== !0 && e !== !1) return t;
 	let i = n.href + (r ? "#" + r : "");
@@ -4369,21 +4369,21 @@ function Xs(e, t = Object.create(null), n = Ys, r = "") {
 		t[r.href] = e;
 	}
 	for (let i in e) {
-		if (Js[i]) continue;
-		let a = `${r}/${Ws(i)}`, o = e[i];
+		if (Ys[i]) continue;
+		let a = `${r}/${Gs(i)}`, o = e[i];
 		if (Array.isArray(o)) {
-			if (Ks[i]) {
+			if (qs[i]) {
 				let e = o.length;
-				for (let r = 0; r < e; r++) Xs(o[r], t, n, `${a}/${r}`);
+				for (let r = 0; r < e; r++) Zs(o[r], t, n, `${a}/${r}`);
 			}
-		} else if (qs[i]) for (let e in o) Xs(o[e], t, n, `${a}/${Ws(e)}`);
-		else Xs(o, t, n, a);
+		} else if (Js[i]) for (let e in o) Zs(o[e], t, n, `${a}/${Gs(e)}`);
+		else Zs(o, t, n, a);
 	}
 	return t;
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/format.js
-var Zs = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, Qs = [
+var Qs = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, $s = [
 	0,
 	31,
 	28,
@@ -4397,60 +4397,60 @@ var Zs = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, Qs = [
 	31,
 	30,
 	31
-], $s = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i, ec = /^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i, tc = /^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i, nc = /^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i, rc = /^(?:(?:https?|ftp):\/\/)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)(?:\.(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)*(?:\.(?:[a-z\u{00a1}-\u{ffff}]{2,})))(?::\d{2,5})?(?:\/[^\s]*)?$/iu, ic = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i, ac = /^(?:\/(?:[^~/]|~0|~1)*)*$/, oc = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i, sc = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/, cc = (e) => {
+], ec = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i, tc = /^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i, nc = /^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i, rc = /^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i, ic = /^(?:(?:https?|ftp):\/\/)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)(?:\.(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)*(?:\.(?:[a-z\u{00a1}-\u{ffff}]{2,})))(?::\d{2,5})?(?:\/[^\s]*)?$/iu, ac = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i, oc = /^(?:\/(?:[^~/]|~0|~1)*)*$/, sc = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i, cc = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/, lc = (e) => {
 	if (e[0] === "\"") return !1;
 	let [t, n, ...r] = e.split("@");
 	return !t || !n || r.length !== 0 || t.length > 64 || n.length > 253 || t[0] === "." || t.endsWith(".") || t.includes("..") || !/^[a-z0-9.-]+$/i.test(n) || !/^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+$/i.test(t) ? !1 : n.split(".").every((e) => /^[a-z0-9]([a-z0-9-]{0,61}[a-z0-9])?$/i.test(e));
-}, lc = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, uc = /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))$/i, dc = (e) => e.length > 1 && e.length < 80 && (/^P\d+([.,]\d+)?W$/.test(e) || /^P[\dYMDTHS]*(\d[.,]\d+)?[YMDHS]$/.test(e) && /^P([.,\d]+Y)?([.,\d]+M)?([.,\d]+D)?(T([.,\d]+H)?([.,\d]+M)?([.,\d]+S)?)?$/.test(e));
-function fc(e) {
+}, uc = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, dc = /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))$/i, fc = (e) => e.length > 1 && e.length < 80 && (/^P\d+([.,]\d+)?W$/.test(e) || /^P[\dYMDTHS]*(\d[.,]\d+)?[YMDHS]$/.test(e) && /^P([.,\d]+Y)?([.,\d]+M)?([.,\d]+D)?(T([.,\d]+H)?([.,\d]+M)?([.,\d]+S)?)?$/.test(e));
+function pc(e) {
 	return e.test.bind(e);
 }
-var pc = {
-	date: hc,
-	time: gc.bind(void 0, !1),
-	"date-time": vc,
-	duration: dc,
-	uri: xc,
-	"uri-reference": fc(tc),
-	"uri-template": fc(nc),
-	url: fc(rc),
-	email: cc,
-	hostname: fc(ec),
-	ipv4: fc(lc),
-	ipv6: fc(uc),
-	regex: Cc,
-	uuid: fc(ic),
-	"json-pointer": fc(ac),
-	"json-pointer-uri-fragment": fc(oc),
-	"relative-json-pointer": fc(sc)
+var mc = {
+	date: gc,
+	time: _c.bind(void 0, !1),
+	"date-time": yc,
+	duration: fc,
+	uri: Sc,
+	"uri-reference": pc(nc),
+	"uri-template": pc(rc),
+	url: pc(ic),
+	email: lc,
+	hostname: pc(tc),
+	ipv4: pc(uc),
+	ipv6: pc(dc),
+	regex: wc,
+	uuid: pc(ac),
+	"json-pointer": pc(oc),
+	"json-pointer-uri-fragment": pc(sc),
+	"relative-json-pointer": pc(cc)
 };
-function mc(e) {
+function hc(e) {
 	return e % 4 == 0 && (e % 100 != 0 || e % 400 == 0);
 }
-function hc(e) {
-	let t = e.match(Zs);
+function gc(e) {
+	let t = e.match(Qs);
 	if (!t) return !1;
 	let n = +t[1], r = +t[2], i = +t[3];
-	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && mc(n) ? 29 : Qs[r]);
+	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && hc(n) ? 29 : $s[r]);
 }
-function gc(e, t) {
-	let n = t.match($s);
+function _c(e, t) {
+	let n = t.match(ec);
 	if (!n) return !1;
 	let r = +n[1], i = +n[2], a = +n[3], o = !!n[5];
 	return (r <= 23 && i <= 59 && a <= 59 || r == 23 && i == 59 && a == 60) && (!e || o);
 }
-var _c = /t|\s/i;
-function vc(e) {
-	let t = e.split(_c);
-	return t.length == 2 && hc(t[0]) && gc(!0, t[1]);
+var vc = /t|\s/i;
+function yc(e) {
+	let t = e.split(vc);
+	return t.length == 2 && gc(t[0]) && _c(!0, t[1]);
 }
-var yc = /\/|:/, bc = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
-function xc(e) {
-	return yc.test(e) && bc.test(e);
+var bc = /\/|:/, xc = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
+function Sc(e) {
+	return bc.test(e) && xc.test(e);
 }
-var Sc = /[^\\]\\Z/;
-function Cc(e) {
-	if (Sc.test(e)) return !1;
+var Cc = /[^\\]\\Z/;
+function wc(e) {
+	if (Cc.test(e)) return !1;
 	try {
 		return new RegExp(e, "u"), !0;
 	} catch {
@@ -4459,14 +4459,14 @@ function Cc(e) {
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/ucs2-length.js
-function wc(e) {
+function Tc(e) {
 	let t = 0, n = e.length, r = 0, i;
 	for (; r < n;) t++, i = e.charCodeAt(r++), i >= 55296 && i <= 56319 && r < n && (i = e.charCodeAt(r), (i & 64512) == 56320 && r++);
 	return t;
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validate.js
-function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c = Object.create(null)) {
+function L(e, t, n = "2019-09", r = Zs(t), i = !0, a = null, o = "#", s = "#", c = Object.create(null)) {
 	if (t === !0) return {
 		valid: !0,
 		errors: []
@@ -4494,7 +4494,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 	}
 	let { $ref: d, $recursiveRef: f, $recursiveAnchor: p, type: m, const: h, enum: g, required: ee, not: te, anyOf: ne, allOf: re, oneOf: ie, if: ae, then: oe, else: se, format: _, properties: v, patternProperties: ce, additionalProperties: le, unevaluatedProperties: ue, minProperties: de, maxProperties: fe, propertyNames: pe, dependentRequired: me, dependentSchemas: he, dependencies: ge, prefixItems: _e, items: y, additionalItems: ve, unevaluatedItems: ye, contains: be, minContains: xe, maxContains: Se, minItems: Ce, maxItems: we, uniqueItems: Te, minimum: Ee, maximum: De, exclusiveMinimum: Oe, exclusiveMaximum: ke, multipleOf: Ae, minLength: je, maxLength: Me, pattern: Ne, __absolute_ref__: Pe, __absolute_recursive_ref__: Fe } = t, b = [];
 	if (p === !0 && a === null && (a = t), f === "#") {
-		let l = a === null ? r[Fe] : a, u = `${s}/$recursiveRef`, d = R(e, a === null ? t : a, n, r, i, l, o, u, c);
+		let l = a === null ? r[Fe] : a, u = `${s}/$recursiveRef`, d = L(e, a === null ? t : a, n, r, i, l, o, u, c);
 		d.valid || b.push({
 			instanceLocation: o,
 			keyword: "$recursiveRef",
@@ -4508,7 +4508,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			let e = `Unresolved $ref "${d}".`;
 			throw Pe && Pe !== d && (e += `  Absolute URI "${Pe}".`), e += `\nKnown schemas:\n- ${Object.keys(r).join("\n- ")}`, Error(e);
 		}
-		let l = `${s}/$ref`, u = R(e, t, n, r, i, a, o, l, c);
+		let l = `${s}/$ref`, u = L(e, t, n, r, i, a, o, l, c);
 		if (u.valid || b.push({
 			instanceLocation: o,
 			keyword: "$ref",
@@ -4542,7 +4542,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		keywordLocation: `${s}/type`,
 		error: `Instance type "${u}" is invalid. Expected "${m}".`
 	});
-	if (h !== void 0 && (u === "object" || u === "array" ? Us(e, h) || b.push({
+	if (h !== void 0 && (u === "object" || u === "array" ? Ws(e, h) || b.push({
 		instanceLocation: o,
 		keyword: "const",
 		keywordLocation: `${s}/const`,
@@ -4552,7 +4552,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		keyword: "const",
 		keywordLocation: `${s}/const`,
 		error: `Instance does not match ${JSON.stringify(h)}.`
-	})), g !== void 0 && (u === "object" || u === "array" ? g.some((t) => Us(e, t)) || b.push({
+	})), g !== void 0 && (u === "object" || u === "array" ? g.some((t) => Ws(e, t)) || b.push({
 		instanceLocation: o,
 		keyword: "enum",
 		keywordLocation: `${s}/enum`,
@@ -4564,7 +4564,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		error: `Instance does not match any of ${JSON.stringify(g)}.`
 	})), te !== void 0) {
 		let t = `${s}/not`;
-		R(e, te, n, r, i, a, o, t).valid && b.push({
+		L(e, te, n, r, i, a, o, t).valid && b.push({
 			instanceLocation: o,
 			keyword: "not",
 			keywordLocation: t,
@@ -4575,7 +4575,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 	if (ne !== void 0) {
 		let t = `${s}/anyOf`, l = b.length, u = !1;
 		for (let s = 0; s < ne.length; s++) {
-			let l = ne[s], d = Object.create(c), f = R(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
+			let l = ne[s], d = Object.create(c), f = L(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
 			b.push(...f.errors), u ||= f.valid, f.valid && Ie.push(d);
 		}
 		u ? b.length = l : b.splice(l, 0, {
@@ -4588,7 +4588,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 	if (re !== void 0) {
 		let t = `${s}/allOf`, l = b.length, u = !0;
 		for (let s = 0; s < re.length; s++) {
-			let l = re[s], d = Object.create(c), f = R(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
+			let l = re[s], d = Object.create(c), f = L(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
 			b.push(...f.errors), u &&= f.valid, f.valid && Ie.push(d);
 		}
 		u ? b.length = l : b.splice(l, 0, {
@@ -4600,7 +4600,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 	}
 	if (ie !== void 0) {
 		let t = `${s}/oneOf`, l = b.length, u = ie.filter((s, l) => {
-			let u = Object.create(c), d = R(e, s, n, r, i, p === !0 ? a : null, o, `${t}/${l}`, u);
+			let u = Object.create(c), d = L(e, s, n, r, i, p === !0 ? a : null, o, `${t}/${l}`, u);
 			return b.push(...d.errors), d.valid && Ie.push(u), d.valid;
 		}).length;
 		u === 1 ? b.length = l : b.splice(l, 0, {
@@ -4612,9 +4612,9 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 	}
 	if ((u === "object" || u === "array") && Object.assign(c, ...Ie), ae !== void 0) {
 		let t = `${s}/if`;
-		if (R(e, ae, n, r, i, a, o, t, c).valid) {
+		if (L(e, ae, n, r, i, a, o, t, c).valid) {
 			if (oe !== void 0) {
-				let l = R(e, oe, n, r, i, a, o, `${s}/then`, c);
+				let l = L(e, oe, n, r, i, a, o, `${s}/then`, c);
 				l.valid || b.push({
 					instanceLocation: o,
 					keyword: "if",
@@ -4623,7 +4623,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 				}, ...l.errors);
 			}
 		} else if (se !== void 0) {
-			let l = R(e, se, n, r, i, a, o, `${s}/else`, c);
+			let l = L(e, se, n, r, i, a, o, `${s}/else`, c);
 			l.valid || b.push({
 				instanceLocation: o,
 				keyword: "if",
@@ -4653,7 +4653,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		}), pe !== void 0) {
 			let t = `${s}/propertyNames`;
 			for (let s in e) {
-				let e = `${o}/${Ws(s)}`, c = R(s, pe, n, r, i, a, e, t);
+				let e = `${o}/${Gs(s)}`, c = L(s, pe, n, r, i, a, e, t);
 				c.valid || b.push({
 					instanceLocation: o,
 					keyword: "propertyNames",
@@ -4677,7 +4677,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		if (he !== void 0) for (let t in he) {
 			let l = `${s}/dependentSchemas`;
 			if (t in e) {
-				let s = R(e, he[t], n, r, i, a, o, `${l}/${Ws(t)}`, c);
+				let s = L(e, he[t], n, r, i, a, o, `${l}/${Gs(t)}`, c);
 				s.valid || b.push({
 					instanceLocation: o,
 					keyword: "dependentSchemas",
@@ -4697,7 +4697,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 					error: `Instance has "${s}" but does not have "${n}".`
 				});
 				else {
-					let l = R(e, c, n, r, i, a, o, `${t}/${Ws(s)}`);
+					let l = L(e, c, n, r, i, a, o, `${t}/${Gs(s)}`);
 					l.valid || b.push({
 						instanceLocation: o,
 						keyword: "dependencies",
@@ -4712,7 +4712,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			let t = `${s}/properties`;
 			for (let s in v) {
 				if (!(s in e)) continue;
-				let d = `${o}/${Ws(s)}`, f = R(e[s], v[s], n, r, i, a, d, `${t}/${Ws(s)}`);
+				let d = `${o}/${Gs(s)}`, f = L(e[s], v[s], n, r, i, a, d, `${t}/${Gs(s)}`);
 				if (f.valid) c[s] = l[s] = !0;
 				else if (u = i, b.push({
 					instanceLocation: o,
@@ -4728,7 +4728,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 				let d = new RegExp(s, "u"), f = ce[s];
 				for (let p in e) {
 					if (!d.test(p)) continue;
-					let m = `${o}/${Ws(p)}`, h = R(e[p], f, n, r, i, a, m, `${t}/${Ws(s)}`);
+					let m = `${o}/${Gs(p)}`, h = L(e[p], f, n, r, i, a, m, `${t}/${Gs(s)}`);
 					h.valid ? c[p] = l[p] = !0 : (u = i, b.push({
 						instanceLocation: o,
 						keyword: "patternProperties",
@@ -4742,7 +4742,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			let t = `${s}/additionalProperties`;
 			for (let s in e) {
 				if (l[s]) continue;
-				let d = `${o}/${Ws(s)}`, f = R(e[s], le, n, r, i, a, d, t);
+				let d = `${o}/${Gs(s)}`, f = L(e[s], le, n, r, i, a, d, t);
 				f.valid ? c[s] = !0 : (u = i, b.push({
 					instanceLocation: o,
 					keyword: "additionalProperties",
@@ -4753,7 +4753,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		} else if (!u && ue !== void 0) {
 			let t = `${s}/unevaluatedProperties`;
 			for (let s in e) if (!c[s]) {
-				let l = `${o}/${Ws(s)}`, u = R(e[s], ue, n, r, i, a, l, t);
+				let l = `${o}/${Gs(s)}`, u = L(e[s], ue, n, r, i, a, l, t);
 				u.valid ? c[s] = !0 : b.push({
 					instanceLocation: o,
 					keyword: "unevaluatedProperties",
@@ -4778,7 +4778,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 		if (_e !== void 0) {
 			let d = `${s}/prefixItems`, f = Math.min(_e.length, t);
 			for (; l < f; l++) {
-				let t = R(e[l], _e[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
+				let t = L(e[l], _e[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
 				if (c[l] = !0, !t.valid && (u = i, b.push({
 					instanceLocation: o,
 					keyword: "prefixItems",
@@ -4792,7 +4792,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			if (Array.isArray(y)) {
 				let s = Math.min(y.length, t);
 				for (; l < s; l++) {
-					let t = R(e[l], y[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
+					let t = L(e[l], y[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
 					if (c[l] = !0, !t.valid && (u = i, b.push({
 						instanceLocation: o,
 						keyword: "items",
@@ -4801,7 +4801,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 					}, ...t.errors), u)) break;
 				}
 			} else for (; l < t; l++) {
-				let t = R(e[l], y, n, r, i, a, `${o}/${l}`, d);
+				let t = L(e[l], y, n, r, i, a, `${o}/${l}`, d);
 				if (c[l] = !0, !t.valid && (u = i, b.push({
 					instanceLocation: o,
 					keyword: "items",
@@ -4812,7 +4812,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			if (!u && ve !== void 0) {
 				let d = `${s}/additionalItems`;
 				for (; l < t; l++) {
-					let t = R(e[l], ve, n, r, i, a, `${o}/${l}`, d);
+					let t = L(e[l], ve, n, r, i, a, `${o}/${l}`, d);
 					c[l] = !0, t.valid || (u = i, b.push({
 						instanceLocation: o,
 						keyword: "additionalItems",
@@ -4838,7 +4838,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			else {
 				let l = `${s}/contains`, u = b.length, d = 0;
 				for (let s = 0; s < t; s++) {
-					let t = R(e[s], be, n, r, i, a, `${o}/${s}`, l);
+					let t = L(e[s], be, n, r, i, a, `${o}/${s}`, l);
 					t.valid ? (c[s] = !0, d++) : b.push(...t.errors);
 				}
 				d >= (xe || 0) && (b.length = u), xe === void 0 && Se === void 0 && d === 0 ? b.splice(u, 0, {
@@ -4863,7 +4863,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			let u = `${s}/unevaluatedItems`;
 			for (; l < t; l++) {
 				if (c[l]) continue;
-				let t = R(e[l], ye, n, r, i, a, `${o}/${l}`, u);
+				let t = L(e[l], ye, n, r, i, a, `${o}/${l}`, u);
 				c[l] = !0, t.valid || b.push({
 					instanceLocation: o,
 					keyword: "unevaluatedItems",
@@ -4877,7 +4877,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			for (let a = 0; a < t; a++) {
 				if (n === a) continue;
 				let t = e[a];
-				(r === t || i && typeof t == "object" && t && Us(r, t)) && (b.push({
+				(r === t || i && typeof t == "object" && t && Ws(r, t)) && (b.push({
 					instanceLocation: o,
 					keyword: "uniqueItems",
 					keywordLocation: `${s}/uniqueItems`,
@@ -4926,7 +4926,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			});
 		}
 	} else if (u === "string") {
-		let t = je === void 0 && Me === void 0 ? 0 : wc(e);
+		let t = je === void 0 && Me === void 0 ? 0 : Tc(e);
 		je !== void 0 && t < je && b.push({
 			instanceLocation: o,
 			keyword: "minLength",
@@ -4942,7 +4942,7 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 			keyword: "pattern",
 			keywordLocation: `${s}/pattern`,
 			error: "String does not match pattern."
-		}), _ !== void 0 && pc[_] && !pc[_](e) && b.push({
+		}), _ !== void 0 && mc[_] && !mc[_](e) && b.push({
 			instanceLocation: o,
 			keyword: "format",
 			keywordLocation: `${s}/format`,
@@ -4956,117 +4956,117 @@ function R(e, t, n = "2019-09", r = Xs(t), i = !0, a = null, o = "#", s = "#", c
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validator.js
-var Tc = class {
+var Ec = class {
 	schema;
 	draft;
 	shortCircuit;
 	lookup;
 	constructor(e, t = "2019-09", n = !0) {
-		this.schema = e, this.draft = t, this.shortCircuit = n, this.lookup = Xs(e);
+		this.schema = e, this.draft = t, this.shortCircuit = n, this.lookup = Zs(e);
 	}
 	validate(e) {
-		return R(e, this.schema, this.draft, this.lookup, this.shortCircuit);
+		return L(e, this.schema, this.draft, this.lookup, this.shortCircuit);
 	}
 	addSchema(e, t) {
 		t && (e = {
 			...e,
 			$id: t
-		}), Xs(e, this.lookup);
-	}
-}, z = O(), Ec = Hs(), Dc = M(z), Oc = N({
-	description: z.optional(),
-	jsonSchema: Ec,
-	nullable: j(),
-	handle: z
-}), B = Oc.extend({ value: Ec.optional() }), kc = N({
-	collapsed: j().optional(),
-	group: z
-}), Ac = N({
-	kind: L("node"),
-	nodeId: z,
-	output: z
-}), jc = N({
-	kind: L("flow"),
-	input: z
-}), Mc = P([
-	Ac,
+		}), Zs(e, this.lookup);
+	}
+}, R = O(), Dc = Us(), Oc = j(R), kc = M({
+	description: R.optional(),
+	jsonSchema: Dc,
+	nullable: es(),
+	handle: R
+}), z = kc.extend({ value: Dc.optional() }), Ac = M({
+	collapsed: es().optional(),
+	group: R
+}), jc = M({
+	kind: I("node"),
+	nodeId: R,
+	output: R
+}), Mc = M({
+	kind: I("flow"),
+	input: R
+}), Nc = N([
 	jc,
-	N({
-		kind: L("binding"),
-		bindingId: z
+	Mc,
+	M({
+		kind: I("binding"),
+		bindingId: R
 	})
-]), Nc = P([N({
-	kind: L("value"),
-	value: Ec
-}), N({
-	kind: L("sources"),
-	sources: M(Mc)
-})]), Pc = F(z, Nc), Fc = {
-	inputs: M(P([B, kc])),
-	outputs: M(P([Oc, kc]))
-}, Ic = N({
-	kind: L("connector"),
-	action: z,
-	connectionId: z.optional(),
-	connections: M(N({
-		connectionId: z,
-		alias: z.optional()
+]), Pc = N([M({
+	kind: I("value"),
+	value: Dc
+}), M({
+	kind: I("sources"),
+	sources: j(Nc)
+})]), Fc = P(R, Pc), Ic = {
+	inputs: j(N([z, Ac])),
+	outputs: j(N([kc, Ac]))
+}, Lc = M({
+	kind: I("connector"),
+	action: R,
+	connectionId: R.optional(),
+	connections: j(M({
+		connectionId: R,
+		alias: R.optional()
 	}))
-}), Lc = N({
-	...Fc,
-	name: z,
-	moduleId: z,
-	capabilities: M(Ic).optional()
-}), Rc = P([N({
-	kind: L("value"),
-	value: Ec
-}), N({
-	kind: L("input"),
-	input: z
-})]), zc = P([Rc, N({ kind: L("model") })]), Bc = N({
-	...Fc,
-	name: z,
-	executor: P([
-		N({
-			kind: L("connector"),
-			action: z,
-			connectionId: z.optional()
+}), Rc = M({
+	...Ic,
+	name: R,
+	moduleId: R,
+	capabilities: j(Lc).optional()
+}), zc = N([M({
+	kind: I("value"),
+	value: Dc
+}), M({
+	kind: I("input"),
+	input: R
+})]), Bc = N([zc, M({ kind: I("model") })]), Vc = M({
+	...Ic,
+	name: R,
+	executor: N([
+		M({
+			kind: I("connector"),
+			action: R,
+			connectionId: R.optional()
 		}),
-		N({
-			kind: L("llm"),
-			mode: I(["chat", "json"])
+		M({
+			kind: I("llm"),
+			mode: F(["chat", "json"])
 		}),
-		N({
-			kind: L("agent"),
-			code: j().optional(),
-			model: z,
-			prompt: Rc,
-			system: z,
+		M({
+			kind: I("agent"),
+			code: es().optional(),
+			model: R,
+			prompt: zc,
+			system: R,
 			maxRounds: A(),
-			tools: M(N({
-				id: z,
-				name: z,
-				description: z,
-				action: z,
-				connectionId: z.optional(),
-				approval: j(),
-				inputs: M(B.extend({ source: zc }))
+			tools: j(M({
+				id: R,
+				name: R,
+				description: R,
+				action: R,
+				connectionId: R.optional(),
+				approval: es(),
+				inputs: j(z.extend({ source: Bc }))
 			})),
-			notification: N({
-				taskId: z,
-				messageHandle: z,
-				inputs: F(z, Rc)
+			notification: M({
+				taskId: R,
+				messageHandle: R,
+				inputs: P(R, zc)
 			}).optional()
 		})
 	])
-}), Vc = {
-	input: B,
-	cases: M(N({
-		output: z,
-		relation: I(["all", "any"]),
-		expressions: M(N({
-			input: z,
-			operator: I([
+}), Hc = {
+	input: z,
+	cases: j(M({
+		output: R,
+		relation: F(["all", "any"]),
+		expressions: j(M({
+			input: R,
+			operator: F([
 				"!=",
 				"<",
 				"<=",
@@ -5088,35 +5088,35 @@ var Tc = class {
 				"notHasValue",
 				"startsWith"
 			]),
-			value: Ec.optional()
+			value: Dc.optional()
 		}))
 	})),
-	defaultOutput: z.optional()
-}, Hc = {
-	actions: P([ps([L("continue")]), ps([L("approve"), L("reject")])]),
-	prompt: z,
-	notification: N({
-		inputs: Pc,
-		messageHandle: z,
-		taskId: z
-	}).optional()
+	defaultOutput: R.optional()
 }, Uc = {
-	inputsDef: M(B),
-	options: N({
-		allowedMethods: Dc.optional(),
-		allowedOrigins: Dc.optional(),
-		noResponseBody: j().optional(),
-		responseData: z.optional(),
-		responseHeaders: F(z, z).optional(),
+	actions: N([ms([I("continue")]), ms([I("approve"), I("reject")])]),
+	prompt: R,
+	notification: M({
+		inputs: Fc,
+		messageHandle: R,
+		taskId: R
+	}).optional()
+}, Wc = {
+	inputsDef: j(z),
+	options: M({
+		allowedMethods: Oc.optional(),
+		allowedOrigins: Oc.optional(),
+		noResponseBody: es().optional(),
+		responseData: R.optional(),
+		responseHeaders: P(R, R).optional(),
 		responseStatusCode: A().optional()
 	}).optional()
-}, Wc = M(P([N({
-	type: L("cron"),
-	expression: z,
-	timezone: z
-}), N({
-	type: L("every"),
-	unit: I([
+}, Gc = j(N([M({
+	type: I("cron"),
+	expression: R,
+	timezone: R
+}), M({
+	type: I("every"),
+	unit: F([
 		"day",
 		"hour",
 		"minute",
@@ -5124,27 +5124,27 @@ var Tc = class {
 		"week"
 	]),
 	value: A()
-})])), Gc = {
-	configSchema: Ec,
+})])), Kc = {
+	configSchema: Dc,
 	definitionVersion: A(),
-	description: z,
-	displayName: z,
-	key: z,
-	name: z,
-	payloadSchema: Ec,
-	provider: z
-}, Kc = N({
-	body: N({
-		allowArray: j(),
-		allowEmpty: j(),
-		formats: M(I([
+	description: R,
+	displayName: R,
+	key: R,
+	name: R,
+	payloadSchema: Dc,
+	provider: R
+}, qc = M({
+	body: M({
+		allowArray: es(),
+		allowEmpty: es(),
+		formats: j(F([
 			"form",
 			"json",
 			"multipart",
 			"text"
 		]))
 	}),
-	methods: M(I([
+	methods: j(F([
 		"DELETE",
 		"GET",
 		"HEAD",
@@ -5153,387 +5153,388 @@ var Tc = class {
 		"PUT"
 	])),
 	successStatus: A()
-}), qc = {
-	name: z,
-	description: z.optional(),
-	icon: z.optional()
-}, Jc = {
-	inputs: Pc,
-	name: z.optional(),
-	description: z.optional(),
-	icon: z.optional(),
+}), Jc = {
+	name: R,
+	description: R.optional(),
+	icon: R.optional()
+}, Yc = {
+	inputs: Fc,
+	name: R.optional(),
+	description: R.optional(),
+	icon: R.optional(),
 	timeoutMs: A().optional()
-}, Yc = P([
-	N({
-		...Jc,
-		kind: L("condition"),
-		...Vc
+}, Xc = N([
+	M({
+		...Yc,
+		kind: I("condition"),
+		...Hc
 	}),
-	N({
-		...Jc,
-		kind: L("value"),
-		values: M(B)
+	M({
+		...Yc,
+		inputs: is().transform(() => ({})).default({}),
+		kind: I("value"),
+		values: j(z)
 	}),
-	N({
-		...Jc,
-		kind: L("subflow"),
-		subflowId: z
+	M({
+		...Yc,
+		kind: I("subflow"),
+		subflowId: R
 	}),
-	N({
-		...Jc,
-		kind: L("task"),
-		task: Lc,
-		additionalInputs: M(B).optional()
+	M({
+		...Yc,
+		kind: I("task"),
+		task: Rc,
+		additionalInputs: j(z).optional()
 	}),
-	N({
-		...Jc,
-		kind: L("task"),
-		taskId: z,
-		additionalInputs: M(B).optional()
+	M({
+		...Yc,
+		kind: I("task"),
+		taskId: R,
+		additionalInputs: j(z).optional()
 	}),
-	N({
-		...Jc,
-		kind: L("wait"),
-		input: B,
-		...Hc
+	M({
+		...Yc,
+		kind: I("wait"),
+		input: z,
+		...Uc
 	}).omit({ timeoutMs: !0 }),
-	N({
-		...qc,
-		kind: L("manual")
+	M({
+		...Jc,
+		kind: I("manual")
 	}),
-	N({
-		...qc,
-		kind: L("webhook"),
-		...Uc
+	M({
+		...Jc,
+		kind: I("webhook"),
+		...Wc
 	}),
-	N({
-		...qc,
-		kind: L("cron"),
-		cronTimes: Wc
+	M({
+		...Jc,
+		kind: I("cron"),
+		cronTimes: Gc
 	}),
-	N({
-		...qc,
-		kind: L("poll"),
-		bindingId: z,
-		config: F(z, Ec),
-		definition: N({
-			...Gc,
-			type: L("poll")
+	M({
+		...Jc,
+		kind: I("poll"),
+		bindingId: R,
+		config: P(R, Dc),
+		definition: M({
+			...Kc,
+			type: I("poll")
 		}),
-		pollTimes: Wc
+		pollTimes: Gc
 	}),
-	N({
-		...qc,
-		kind: L("integration"),
-		bindingId: z,
-		config: F(z, Ec),
-		definition: N({
-			...Gc,
-			type: L("integration"),
-			endpoint: Kc
+	M({
+		...Jc,
+		kind: I("integration"),
+		bindingId: R,
+		config: P(R, Dc),
+		definition: M({
+			...Kc,
+			type: I("integration"),
+			endpoint: qc
 		})
 	})
-]), Xc = P([N({ kind: L("flow") }), N({
-	kind: L("subflow"),
-	id: z
-})]), Zc = N({
-	source: z,
-	target: z,
-	sourceHandle: z.optional()
-}), V = {
-	nodeId: z,
-	target: Xc
-}, Qc = N({
-	name: z,
-	inputs: M(B),
-	outputs: M(Oc.extend({ sources: M(P([Ac, jc])) }))
-}), $c = N({
-	nodes: F(z, Yc),
-	edges: M(Zc).default([])
-}), el = N({
-	kind: I(["connection", "variable"]),
-	target: z
-}), tl = N({
-	name: z,
-	imports: Dc,
-	source: z
-}), nl = N({
-	bindings: F(z, el),
-	graph: $c,
-	subflows: F(z, Qc.extend({ graph: $c })),
-	tasks: F(z, Bc)
+]), Zc = N([M({ kind: I("flow") }), M({
+	kind: I("subflow"),
+	id: R
+})]), Qc = M({
+	source: R,
+	target: R,
+	sourceHandle: R.optional()
+}), B = {
+	nodeId: R,
+	target: Zc
+}, $c = M({
+	name: R,
+	inputs: j(z),
+	outputs: j(kc.extend({ sources: j(N([jc, Mc])) }))
+}), el = M({
+	nodes: P(R, Xc),
+	edges: j(Qc).default([])
+}), tl = M({
+	kind: F(["connection", "variable"]),
+	target: R
+}), nl = M({
+	name: R,
+	imports: Oc,
+	source: R
+}), rl = M({
+	bindings: P(R, tl),
+	graph: el,
+	subflows: P(R, $c.extend({ graph: el })),
+	tasks: P(R, Vc)
 });
-N({
-	modelVersion: L(1),
-	document: nl,
-	modules: F(z, tl)
+M({
+	modelVersion: I(1),
+	document: rl,
+	modules: P(R, nl)
 }).extend({
-	kind: L("open-flow-flow-revision"),
-	version: L(1)
+	kind: I("open-flow-flow-revision"),
+	version: I(1)
 });
-var rl = {
+var il = {
 	"binding.create": {
-		bindingId: z,
-		binding: el
+		bindingId: R,
+		binding: tl
 	},
-	"binding.delete": { bindingId: z },
+	"binding.delete": { bindingId: R },
 	"binding.target.set": {
-		bindingId: z,
-		before: z,
-		value: z
+		bindingId: R,
+		before: R,
+		value: R
 	},
 	"graph.edge.connect": {
-		target: Xc,
-		edge: Zc
+		target: Zc,
+		edge: Qc
 	},
 	"graph.edge.disconnect": {
-		target: Xc,
-		edge: Zc
+		target: Zc,
+		edge: Qc
 	},
 	"graph.node.create": {
-		...V,
-		node: Yc
-	},
-	"graph.node.delete": V,
-	"graph.node.field.set": P([N({
-		...V,
-		kind: L("graph.node.field.set"),
-		field: I([
+		...B,
+		node: Xc
+	},
+	"graph.node.delete": B,
+	"graph.node.field.set": N([M({
+		...B,
+		kind: I("graph.node.field.set"),
+		field: F([
 			"description",
 			"icon",
 			"name"
 		]),
-		before: z.optional(),
-		value: z.optional()
-	}), N({
-		...V,
-		kind: L("graph.node.field.set"),
-		field: L("timeoutMs"),
+		before: R.optional(),
+		value: R.optional()
+	}), M({
+		...B,
+		kind: I("graph.node.field.set"),
+		field: I("timeoutMs"),
 		before: A().optional(),
 		value: A().optional()
 	})]),
 	"graph.node.input.set": {
-		...V,
-		handle: z,
-		before: Nc.optional(),
-		value: Nc.optional()
+		...B,
+		handle: R,
+		before: Pc.optional(),
+		value: Pc.optional()
 	},
 	"graph.node.additional-inputs.set": {
-		...V,
-		before: M(B).optional(),
-		value: M(B).optional()
+		...B,
+		before: j(z).optional(),
+		value: j(z).optional()
 	},
 	"graph.node.condition.set": {
-		...V,
-		before: N(Vc),
-		value: N(Vc)
+		...B,
+		before: M(Hc),
+		value: M(Hc)
 	},
 	"graph.node.values.set": {
-		...V,
-		before: M(B),
-		value: M(B)
+		...B,
+		before: j(z),
+		value: j(z)
 	},
 	"graph.node.wait.set": {
-		...V,
-		target: N({ kind: L("flow") }),
-		before: N(Hc),
-		value: N(Hc)
+		...B,
+		target: M({ kind: I("flow") }),
+		before: M(Uc),
+		value: M(Uc)
 	},
 	"graph.node.webhook.set": {
-		...V,
-		target: N({ kind: L("flow") }),
-		before: N(Uc),
-		value: N(Uc)
+		...B,
+		target: M({ kind: I("flow") }),
+		before: M(Wc),
+		value: M(Wc)
 	},
 	"graph.node.task.ports.set": {
-		...V,
-		before: N(Fc),
-		value: N(Fc)
+		...B,
+		before: M(Ic),
+		value: M(Ic)
 	},
 	"graph.node.task.name.set": {
-		...V,
-		before: z,
-		value: z
+		...B,
+		before: R,
+		value: R
 	},
 	"graph.node.task.capabilities.set": {
-		...V,
-		before: M(Ic).optional(),
-		value: M(Ic).optional()
+		...B,
+		before: j(Lc).optional(),
+		value: j(Lc).optional()
 	},
 	"graph.trigger.config.set": {
-		nodeId: z,
-		name: z,
-		before: Ec.optional(),
-		value: Ec.optional()
+		nodeId: R,
+		name: R,
+		before: Dc.optional(),
+		value: Dc.optional()
 	},
 	"graph.trigger.schedule.set": {
-		nodeId: z,
-		before: Wc,
-		value: Wc
+		nodeId: R,
+		before: Gc,
+		value: Gc
 	},
 	"module.create": {
-		moduleId: z,
-		module: tl
+		moduleId: R,
+		module: nl
 	},
-	"module.delete": { moduleId: z },
+	"module.delete": { moduleId: R },
 	"module.rename": {
-		moduleId: z,
-		before: z,
-		name: z
+		moduleId: R,
+		before: R,
+		name: R
 	},
 	"module.source.replace": {
-		moduleId: z,
-		beforeImports: Dc,
-		beforeSource: z,
-		imports: Dc,
-		source: z
+		moduleId: R,
+		beforeImports: Oc,
+		beforeSource: R,
+		imports: Oc,
+		source: R
 	},
 	"subflow.create": {
-		subflowId: z,
-		subflow: Qc.extend({ graph: $c })
+		subflowId: R,
+		subflow: $c.extend({ graph: el })
 	},
 	"subflow.definition.set": {
-		subflowId: z,
-		before: Qc,
-		definition: Qc
+		subflowId: R,
+		before: $c,
+		definition: $c
 	},
-	"subflow.delete": { subflowId: z },
+	"subflow.delete": { subflowId: R },
 	"task.create": {
-		taskId: z,
-		task: Bc
+		taskId: R,
+		task: Vc
 	},
-	"task.delete": { taskId: z },
+	"task.delete": { taskId: R },
 	"task.connector.connection.set": {
-		taskId: z,
-		before: z.optional(),
-		value: z.optional()
+		taskId: R,
+		before: R.optional(),
+		value: R.optional()
 	},
 	"task.agent.set": {
-		taskId: z,
-		before: Bc,
-		value: Bc
+		taskId: R,
+		before: Vc,
+		value: Vc
 	},
 	"task.llm.mode.set": {
-		taskId: z,
-		before: I(["chat", "json"]),
-		value: I(["chat", "json"])
+		taskId: R,
+		before: F(["chat", "json"]),
+		value: F(["chat", "json"])
 	},
 	"task.name.set": {
-		taskId: z,
-		before: z,
-		value: z
+		taskId: R,
+		before: R,
+		value: R
 	}
 };
-M(P([...new Map(Object.entries(rl).map(([e, t]) => [e, t instanceof D ? t : N({
-	kind: L(e),
+j(N([...new Map(Object.entries(il).map(([e, t]) => [e, t instanceof D ? t : M({
+	kind: I(e),
 	...t
 })])).values()])).min(1);
 //#endregion
 //#region src/flow/common/change.ts
-function il(e) {
+function al(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, e]] : []));
 }
 //#endregion
 //#region src/json-schema-subset/utils.ts
-var al = 0;
-function ol() {
-	let e = al;
-	return al += 1, e;
+var ol = 0;
+function sl() {
+	let e = ol;
+	return ol += 1, e;
 }
-function sl(e) {
+function cl(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) sl(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) cl(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function cl(e, t) {
+function ll(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function ll(e) {
+function ul(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = ll(r);
+		for (let [n, r] of e.entries()) t[n] = ul(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = ll(e[n]);
+		for (let n in e) t[n] = ul(e[n]);
 		return t;
 	}
 }
-function ul(e, t) {
+function dl(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 (!ul(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!dl(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !ul(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !dl(e[n], t[n])) return !1;
 		for (let n in t) if (!(n in e)) return !1;
 	}
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/expression/result.ts
-var H = Object.freeze({
+var V = Object.freeze({
 	Equals: 0,
 	Containing: 1,
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), U = vl(H.Equals), W = vl(H.Containing), G = vl(H.ContainedBy), K = vl(H.Rejection), q = vl(H.Intersection), dl = sl([
-	[H.Equals, U],
-	[H.Containing, W],
-	[H.ContainedBy, G],
-	[H.Rejection, K],
-	[H.Intersection, q]
-]), fl = (() => {
+}), H = yl(V.Equals), U = yl(V.Containing), W = yl(V.ContainedBy), G = yl(V.Rejection), K = yl(V.Intersection), fl = cl([
+	[V.Equals, H],
+	[V.Containing, U],
+	[V.ContainedBy, W],
+	[V.Rejection, G],
+	[V.Intersection, K]
+]), pl = (() => {
 	let e = 0;
-	for (let [t, n] of dl) e |= n;
+	for (let [t, n] of fl) e |= n;
 	return e;
 })();
-function pl(e) {
-	return !!(e & U);
-}
 function ml(e) {
-	return !!(e & W);
+	return !!(e & H);
 }
 function hl(e) {
-	return !!(e & G);
+	return !!(e & U);
 }
 function gl(e) {
-	return !!(e & K);
+	return !!(e & W);
 }
 function _l(e) {
-	return !!(e & q);
+	return !!(e & G);
 }
 function vl(e) {
+	return !!(e & K);
+}
+function yl(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function yl(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : bl(t, r, e), n += 1, t) };
+function bl(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : xl(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function bl(e, t, n) {
+function xl(e, t, n) {
 	let r = 0;
-	for (let [i, a] of dl) if (a & e) {
-		for (let [e, a] of dl) if (a & t && (r |= n(i, e), r === fl)) return r;
+	for (let [i, a] of fl) if (a & e) {
+		for (let [e, a] of fl) if (a & t && (r |= n(i, e), r === pl)) return r;
 	}
 	return r;
 }
 //#endregion
 //#region src/json-schema-subset/expression/calculator.ts
-var J = Object.freeze({
+var q = Object.freeze({
 	Save: 0,
 	OneOf: 1,
 	AllOf: 2,
@@ -5541,289 +5542,289 @@ var J = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function xl(e, t) {
+function Sl(e, t) {
 	switch (e) {
-		case J.Save: return t[0];
-		case J.OneOf: return Cl(t);
-		case J.AllOf:
-		case J.AnyOf: return wl(e, t);
-		case J.Not:
-		case J.Swap: return Tl(e, t[0]);
+		case q.Save: return t[0];
+		case q.OneOf: return wl(t);
+		case q.AllOf:
+		case q.AnyOf: return Tl(e, t);
+		case q.Not:
+		case q.Swap: return El(e, t[0]);
 	}
 }
-function Sl(e) {
-	return Tl(J.Swap, e);
-}
 function Cl(e) {
+	return El(q.Swap, e);
+}
+function wl(e) {
 	if (e.length === 1) return e[0];
-	let t = wl(J.AnyOf, e), n = [];
+	let t = Tl(q.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 = wl(J.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = Tl(q.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = wl(J.AnyOf, n), i = Tl(J.Not, r);
-	return wl(J.AllOf, [t, i]);
+	let r = Tl(q.AnyOf, n), i = El(q.Not, r);
+	return Tl(q.AllOf, [t, i]);
 }
-function wl(e, t) {
+function Tl(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
-		case J.AllOf:
-			n = yl(El);
+		case q.AllOf:
+			n = bl(Dl);
 			break;
-		case J.AnyOf:
-			n = yl(Dl);
+		case q.AnyOf:
+			n = bl(Ol);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function Tl(e, t) {
+function El(e, t) {
 	let n, r = 0;
 	switch (e) {
-		case J.Not:
-			n = Ol;
-			break;
-		case J.Swap:
+		case q.Not:
 			n = kl;
 			break;
+		case q.Swap:
+			n = Al;
+			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of dl) i & t && (r |= n(e));
+	for (let [e, i] of fl) i & t && (r |= n(e));
 	return r;
 }
-function El(e, t) {
+function Dl(e, t) {
 	let n = 0;
 	switch (e) {
-		case H.Equals:
+		case V.Equals:
 			switch (t) {
-				case H.Equals:
-					n = U;
+				case V.Equals:
+					n = H;
 					break;
-				case H.Containing:
-					n = U;
+				case V.Containing:
+					n = H;
 					break;
-				case H.ContainedBy:
-					n = G;
+				case V.ContainedBy:
+					n = W;
 					break;
-				case H.Rejection:
+				case V.Rejection:
 					n = 0;
 					break;
-				case H.Intersection: n = G;
+				case V.Intersection: n = W;
 			}
 			break;
-		case H.Containing:
+		case V.Containing:
 			switch (t) {
-				case H.Equals:
-					n = U;
+				case V.Equals:
+					n = H;
 					break;
-				case H.Containing:
-					n = U | W;
+				case V.Containing:
+					n = H | U;
 					break;
-				case H.ContainedBy:
-					n = G;
+				case V.ContainedBy:
+					n = W;
 					break;
-				case H.Rejection:
-					n = K;
+				case V.Rejection:
+					n = G;
 					break;
-				case H.Intersection: n = q | G;
+				case V.Intersection: n = K | W;
 			}
 			break;
-		case H.ContainedBy:
+		case V.ContainedBy:
 			switch (t) {
-				case H.Equals:
-					n = G;
+				case V.Equals:
+					n = W;
 					break;
-				case H.Containing:
-					n = G;
+				case V.Containing:
+					n = W;
 					break;
-				case H.ContainedBy:
-					n = G;
+				case V.ContainedBy:
+					n = W;
 					break;
-				case H.Rejection:
+				case V.Rejection:
 					n = 0;
 					break;
-				case H.Intersection: n = G;
+				case V.Intersection: n = W;
 			}
 			break;
-		case H.Rejection:
+		case V.Rejection:
 			switch (t) {
-				case H.Equals:
+				case V.Equals:
 					n = 0;
 					break;
-				case H.Containing:
-					n = K;
+				case V.Containing:
+					n = G;
 					break;
-				case H.ContainedBy:
+				case V.ContainedBy:
 					n = 0;
 					break;
-				case H.Rejection:
-					n = K;
+				case V.Rejection:
+					n = G;
 					break;
-				case H.Intersection: n = K;
+				case V.Intersection: n = G;
 			}
 			break;
-		case H.Intersection: switch (t) {
-			case H.Equals:
-				n = G;
+		case V.Intersection: switch (t) {
+			case V.Equals:
+				n = W;
 				break;
-			case H.Containing:
-				n = q | G;
+			case V.Containing:
+				n = K | W;
 				break;
-			case H.ContainedBy:
-				n = G;
+			case V.ContainedBy:
+				n = W;
 				break;
-			case H.Rejection:
-				n = K;
+			case V.Rejection:
+				n = G;
 				break;
-			case H.Intersection: n = G | K | q;
+			case V.Intersection: n = W | G | K;
 		}
 	}
 	return n;
 }
-function Dl(e, t) {
+function Ol(e, t) {
 	let n = 0;
 	switch (e) {
-		case H.Equals:
+		case V.Equals:
 			switch (t) {
-				case H.Equals:
+				case V.Equals:
+					n = H;
+					break;
+				case V.Containing:
 					n = U;
 					break;
-				case H.Containing:
-					n = W;
+				case V.ContainedBy:
+					n = H;
 					break;
-				case H.ContainedBy:
+				case V.Rejection:
 					n = U;
 					break;
-				case H.Rejection:
-					n = W;
-					break;
-				case H.Intersection: n = W;
+				case V.Intersection: n = U;
 			}
 			break;
-		case H.Containing:
+		case V.Containing:
 			switch (t) {
-				case H.Equals:
-					n = W;
+				case V.Equals:
+					n = U;
 					break;
-				case H.Containing:
-					n = W;
+				case V.Containing:
+					n = U;
 					break;
-				case H.ContainedBy:
-					n = W;
+				case V.ContainedBy:
+					n = U;
 					break;
-				case H.Rejection:
-					n = W;
+				case V.Rejection:
+					n = U;
 					break;
-				case H.Intersection: n = W;
+				case V.Intersection: n = U;
 			}
 			break;
-		case H.ContainedBy:
+		case V.ContainedBy:
 			switch (t) {
-				case H.Equals:
-					n = U;
+				case V.Equals:
+					n = H;
 					break;
-				case H.Containing:
-					n = W;
+				case V.Containing:
+					n = U;
 					break;
-				case H.ContainedBy:
-					n = U | G;
+				case V.ContainedBy:
+					n = H | W;
 					break;
-				case H.Rejection:
-					n = q;
+				case V.Rejection:
+					n = K;
 					break;
-				case H.Intersection: n = W | q;
+				case V.Intersection: n = U | K;
 			}
 			break;
-		case H.Rejection:
+		case V.Rejection:
 			switch (t) {
-				case H.Equals:
-					n = W;
-					break;
-				case H.Containing:
-					n = W;
+				case V.Equals:
+					n = U;
 					break;
-				case H.ContainedBy:
-					n = q;
+				case V.Containing:
+					n = U;
 					break;
-				case H.Rejection:
+				case V.ContainedBy:
 					n = K;
 					break;
-				case H.Intersection: n = q;
+				case V.Rejection:
+					n = G;
+					break;
+				case V.Intersection: n = K;
 			}
 			break;
-		case H.Intersection: switch (t) {
-			case H.Equals:
-				n = W;
+		case V.Intersection: switch (t) {
+			case V.Equals:
+				n = U;
 				break;
-			case H.Containing:
-				n = W;
+			case V.Containing:
+				n = U;
 				break;
-			case H.ContainedBy:
-				n = W | q;
+			case V.ContainedBy:
+				n = U | K;
 				break;
-			case H.Rejection:
-				n = q;
+			case V.Rejection:
+				n = K;
 				break;
-			case H.Intersection: n = W | q;
+			case V.Intersection: n = U | K;
 		}
 	}
 	return n;
 }
-function Ol(e) {
+function kl(e) {
 	let t = 0;
 	switch (e) {
-		case H.Equals:
-			t = K;
+		case V.Equals:
+			t = G;
 			break;
-		case H.Containing:
-			t = K;
+		case V.Containing:
+			t = G;
 			break;
-		case H.ContainedBy:
-			t = q;
+		case V.ContainedBy:
+			t = K;
 			break;
-		case H.Rejection:
-			t = U | W;
+		case V.Rejection:
+			t = H | U;
 			break;
-		case H.Intersection: t = G | q;
+		case V.Intersection: t = W | K;
 	}
 	return t;
 }
-function kl(e) {
+function Al(e) {
 	let t = 0;
 	switch (e) {
-		case H.Equals:
-			t = U;
+		case V.Equals:
+			t = H;
 			break;
-		case H.Containing:
-			t = G;
-			break;
-		case H.ContainedBy:
+		case V.Containing:
 			t = W;
 			break;
-		case H.Rejection:
-			t = K;
+		case V.ContainedBy:
+			t = U;
+			break;
+		case V.Rejection:
+			t = G;
 			break;
-		case H.Intersection: t = q;
+		case V.Intersection: t = K;
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var Al = Object.freeze({
+var jl = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), jl = (e) => (t, n) => {
+}), Ml = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
 		expressions: null,
 		calculation: {
-			operator: J.Save,
+			operator: q.Save,
 			results: [0],
 			willSwap: !1,
 			count: 0
@@ -5842,10 +5843,10 @@ var Al = Object.freeze({
 		for (; a.length > 0;) c(a.pop());
 	}
 	function o(t) {
-		let n = U, [r, o] = t.expressions;
+		let n = H, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== Al.Leaf) {
+			if (a.kind !== jl.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -5860,7 +5861,7 @@ var Al = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== Al.Leaf) {
+			if (c.kind !== jl.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -5877,26 +5878,26 @@ var Al = Object.freeze({
 			if (n = e.calculate(r, o), e.observeCalculation?.(r, o, n, t.swapped), n === 0) throw Error("cannot response expression as none");
 		}
 		t.expressions = null, t.calculation = {
-			operator: J.Save,
+			operator: q.Save,
 			results: [n],
 			willSwap: !1,
 			count: 0
 		}, a.push(t);
 	}
 	function s(e, t) {
-		let n = J.Save, r;
+		let n = q.Save, r;
 		switch (e.kind) {
-			case Al.Not:
-				n = J.Not, r = [e.expression];
+			case jl.Not:
+				n = q.Not, r = [e.expression];
 				break;
-			case Al.AllOf:
-				n = J.AllOf, r = [...e.expressions];
+			case jl.AllOf:
+				n = q.AllOf, r = [...e.expressions];
 				break;
-			case Al.AnyOf:
-				n = J.AnyOf, r = [...e.expressions];
+			case jl.AnyOf:
+				n = q.AnyOf, r = [...e.expressions];
 				break;
-			case Al.OneOf:
-				n = J.OneOf, r = [...e.expressions];
+			case jl.OneOf:
+				n = q.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
 		}
@@ -5908,8 +5909,8 @@ var Al = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = xl(t.operator, t.results);
-		if (r === 0 && (r = G), t.willSwap && (r = Sl(r)), n) {
+		let t = e.calculation, n = e.parent, r = Sl(t.operator, t.results);
+		if (r === 0 && (r = W), t.willSwap && (r = Cl(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);
 		}
@@ -5917,79 +5918,79 @@ var Al = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, Ml = class extends Error {
+}, Nl = class extends Error {
 	constructor(e = []) {
-		super(Fl(e)), this.name = "SchemaError", this.items = e;
+		super(Il(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Nl = Object.freeze({
+}, Pl = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Pl(e) {
+function Fl(e) {
 	switch (e.kind) {
-		case Nl.Compiled: {
+		case Pl.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Nl.External: return String(e.error);
+		case Pl.External: return String(e.error);
 	}
 }
-function Fl(e) {
+function Il(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Pl(e[0]);
-		default: return `${Pl(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Fl(e[0]);
+		default: return `${Fl(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Il = /* @__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 Ll(e) {
-	return Il.has(e);
-}
+var Ll = /* @__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 Rl(e) {
-	for (let t in e) if (Ll(t)) return !1;
+	return Ll.has(e);
+}
+function zl(e) {
+	for (let t in e) if (Rl(t)) return !1;
 	return !0;
 }
-function zl(e, ...t) {
+function Bl(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function Bl(e) {
+function Vl(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function Vl({ path: e, errors: t }, n, ...r) {
-	t.push(Hl(e, r, n));
+function Hl({ path: e, errors: t }, n, ...r) {
+	t.push(Ul(e, r, n));
 }
-function Y({ path: e, warns: t }, n, ...r) {
-	t.push(Hl(e, r, n));
+function J({ path: e, warns: t }, n, ...r) {
+	t.push(Ul(e, r, n));
 }
-function Hl(e, t, n) {
+function Ul(e, t, n) {
 	return {
-		kind: Nl.Compiled,
+		kind: Pl.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function Ul(e) {
+function Wl(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] : Wl(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : Gl(n) && delete e[t]);
 	}
 	return e;
 }
-function Wl(e) {
+function Gl(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var Gl = Symbol("compiledId"), Kl = Symbol("compiledKind"), ql = Symbol("compiledPath"), Jl = Symbol("validatorLoader"), X = Object.freeze({
+var Kl = Symbol("compiledId"), ql = Symbol("compiledKind"), Jl = Symbol("compiledPath"), Yl = Symbol("validatorLoader"), Y = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -6002,62 +6003,62 @@ var Gl = Symbol("compiledId"), Kl = Symbol("compiledKind"), ql = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), Yl = sl(ru(X.Any, ol(), {}, () => () => !0)), Xl = sl(ru(X.Never, ol(), {
+}), Xl = cl(iu(Y.Any, sl(), {}, () => () => !0)), Zl = cl(iu(Y.Never, sl(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function Zl(e) {
-	return typeof e != "object" || !e ? !1 : Gl in e;
-}
 function Ql(e) {
-	return typeof e != "object" || !e ? !1 : Gl in e && Kl in e;
-}
-function Z(e) {
-	return Ql(e) ? e[Kl] : X.Extends;
+	return typeof e != "object" || !e ? !1 : Kl in e;
 }
 function $l(e) {
-	return Ql(e) || Zl(e) ? e[Gl] : e.id;
+	return typeof e != "object" || !e ? !1 : Kl in e && ql in e;
+}
+function X(e) {
+	return $l(e) ? e[ql] : Y.Extends;
 }
 function eu(e) {
-	return Ql(e) ? e[ql] : void 0;
+	return $l(e) || Ql(e) ? e[Kl] : e.id;
 }
 function tu(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, Gl, {
-		value: ol(),
+	return $l(e) ? e[Jl] : void 0;
+}
+function nu(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, Kl, {
+		value: sl(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
-function Q(e, t, n, r = []) {
-	return ru(e, ol(), t, n && (() => n.compile(t)), r);
+function Z(e, t, n, r = []) {
+	return iu(e, sl(), t, n && (() => n.compile(t)), r);
 }
-function nu(e) {
-	return ru(X.Never, ol(), { ...e }, e[Jl], e[ql]);
+function ru(e) {
+	return iu(Y.Never, sl(), { ...e }, e[Yl], e[Jl]);
 }
-function ru(e, t, n, r, i = []) {
+function iu(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[Kl]: {
+		[ql]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Gl]: {
+		[Kl]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[ql]: {
+		[Jl]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Jl]: {
+		[Yl]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -6074,16 +6075,16 @@ function ru(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function iu(e, t) {
-	let n = au(e, t), r = ou(e, "maxItems", t), i = ou(e, "minItems", t), a = su(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = cu(e, t) : t.additionalItems && Y(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function au(e, t) {
+	let n = ou(e, t), r = su(e, "maxItems", t), i = su(e, "minItems", t), a = cu(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = lu(e, t) : t.additionalItems && J(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 = lu(s, e.delegate));
-		let t = n.findIndex((e) => Z(e) === X.Never);
-		t !== -1 && (n = n.splice(t), s = lu(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, Ul({
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = uu(s, e.delegate));
+		let t = n.findIndex((e) => X(e) === Y.Never);
+		t !== -1 && (n = n.splice(t), s = uu(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (J(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && X(s) === Y.Never && (c = !0);
+	} else X(n) === Y.Never && (c = !0);
+	return r !== void 0 && i !== void 0 && r < i && (l || J(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Z(c ? Y.Never : Y.Array, Wl({
 		type: "array",
 		items: n,
 		contains: a,
@@ -6093,12 +6094,12 @@ function iu(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function au(e, { items: t }) {
-	if (!t) return Q(X.Any, {}, e.delegate, e.path);
+function ou(e, { items: t }) {
+	if (!t) return Z(Y.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = Uu(zl(e, "items", i), Bl(a));
+			let t = Wu(Bl(e, "items", i), Vl(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -6107,80 +6108,80 @@ function au(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return Uu(zl(e, "items"), Bl(t));
+	return Wu(Bl(e, "items"), Vl(t));
 }
-function ou(e, t, n) {
+function su(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			Y(e, "find NaN", t);
+			J(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			Y(e, `find invalid number ${r}`, t);
+			J(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function su(e, { contains: t }) {
-	return t ? Uu(zl(e, "contains"), Bl(t)) : Q(X.Any, {}, e.delegate, e.path);
+function cu(e, { contains: t }) {
+	return t ? Wu(Bl(e, "contains"), Vl(t)) : Z(Y.Any, {}, e.delegate, e.path);
 }
-function cu(e, { additionalItems: t }) {
+function lu(e, { additionalItems: t }) {
 	switch (typeof t) {
-		case "boolean": return t ? Q(X.Any, {}, e.delegate, e.path) : !1;
-		case "object": return Uu(zl(e, "additionalItems"), t);
-		default: return Q(X.Any, {}, e.delegate, e.path);
+		case "boolean": return t ? Z(Y.Any, {}, e.delegate, e.path) : !1;
+		case "object": return Wu(Bl(e, "additionalItems"), t);
+		default: return Z(Y.Any, {}, e.delegate, e.path);
 	}
 }
-function lu(e, t) {
-	return e === void 0 ? Q(X.Never, {
+function uu(e, t) {
+	return e === void 0 ? Z(Y.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : Ql(e) ? Z(e) === X.Never ? e : nu(e) : e;
+	}, t) : $l(e) ? X(e) === Y.Never ? e : ru(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var uu = Object.freeze([
+var du = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function du(e, t, n, r) {
-	if (n.length === 0) return Vl(e, "disable empty list", t), null;
+function fu(e, t, n, r) {
+	if (n.length === 0) return Hl(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = Uu(zl(e, t, r), Bl(a));
+		let n = Wu(Bl(e, t, r), Vl(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
 	let a = 0, o = 0;
-	for (let e of i) switch (Z(e)) {
-		case X.Any:
+	for (let e of i) switch (X(e)) {
+		case Y.Any:
 			a += 1;
 			break;
-		case X.Never: o += 1;
+		case Y.Never: o += 1;
 	}
-	let s = X.Combination;
+	let s = Y.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = X.Never : a === i.length ? s = X.Any : fu(i) || (s = X.Never);
+			o > 0 ? s = Y.Never : a === i.length ? s = Y.Any : pu(i) || (s = Y.Never);
 			break;
 		case "anyOf":
-			a > 0 ? s = X.Any : o === i.length && (s = X.Never);
+			a > 0 ? s = Y.Any : o === i.length && (s = Y.Never);
 			break;
-		case "oneOf": a > 1 || o === i.length ? s = X.Never : a === 1 && o === i.length - 1 && (s = X.Any);
+		case "oneOf": a > 1 || o === i.length ? s = Y.Never : a === 1 && o === i.length - 1 && (s = Y.Any);
 	}
-	return Q(s, { [t]: i }, r, e.path);
+	return Z(s, { [t]: i }, r, e.path);
 }
-function fu(e) {
+function pu(e) {
 	let t = null;
 	for (let n of e) {
-		let e = Z(n);
+		let e = X(n);
 		switch (e) {
-			case X.Any:
-			case X.Never: break;
+			case Y.Any:
+			case Y.Never: break;
 			default: if (t === null) t = e;
 			else if (t !== e) return !1;
 		}
@@ -6189,47 +6190,47 @@ function fu(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var pu = Object.freeze({
+var mu = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
-function mu(e, t) {
+function hu(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? pu.Valid : pu.Invalid : pu.Unknown;
+	return n ? n(t) === !0 ? mu.Valid : mu.Invalid : mu.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function hu(e, t, n, r) {
+function gu(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return Vl(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return Hl(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (mu(r, a)) {
-			case pu.Valid:
-				i.push(tu(a));
+		for (let [n, a] of t.entries()) switch (hu(r, a)) {
+			case mu.Valid:
+				i.push(nu(a));
 				break;
-			case pu.Invalid: Y(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case mu.Invalid: J(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");
+		i.length === 0 && J(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && mu(r, n) === pu.Invalid && (a = !0), i) {
+	if (n && hu(r, n) === mu.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (ul(t, n)) {
+			for (let t of i) if (dl(t, n)) {
 				e = !0;
 				break;
 			}
 			e || (a = !0);
 		}
 	}
-	let o = a ? X.Never : X.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = tu(ll(n))), Q(o, s, e.delegate, e.path);
+	let o = a ? Y.Never : Y.EnumOrConst, s = {};
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = nu(ul(n))), Z(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var gu = /* @__PURE__ */ new Set([
+var _u = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -6240,56 +6241,56 @@ var gu = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function _u(e, t) {
-	let n = Object.keys(t).filter((e) => !gu.has(e) && Ll(e));
-	n.length > 0 && Y(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = vu(e, "maxProperties", t), i = vu(e, "minProperties", t), a = yu(e, t), o = bu(e, t), s = xu(e, t), c = Cu(e, t);
+function vu(e, t) {
+	let n = Object.keys(t).filter((e) => !_u.has(e) && Rl(e));
+	n.length > 0 && J(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = yu(e, "maxProperties", t), i = yu(e, "minProperties", t), a = bu(e, t), o = xu(e, t), s = Su(e, t), c = wu(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = Su(e, o, s, t);
+	let l = Cu(e, o, s, t);
 	if (!l) return null;
-	let u = Tu(e, wu(a, o, s, l), c, t);
-	return Q(Eu(e, a, l, u, r, i) ? X.Never : X.Object, Ul({
+	let u = Eu(e, Tu(a, o, s, l), c, t);
+	return Z(Du(e, a, l, u, r, i) ? Y.Never : Y.Object, Wl({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: ju(o),
-		dependencies: Mu(c, t),
+		patternProperties: Mu(o),
+		dependencies: Nu(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function vu(e, t, n) {
+function yu(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			Y(e, "find NaN", t);
+			J(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			Y(e, `find invalid number ${r}`, t);
+			J(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function yu(e, { additionalProperties: t }) {
-	return t === !1 ? Q(X.Never, {
+function bu(e, { additionalProperties: t }) {
+	return t === !1 ? Z(Y.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? Uu(zl(e, "additionalProperties"), Bl(t)) : Q(X.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? Wu(Bl(e, "additionalProperties"), Vl(t)) : Z(Y.Any, {}, e.delegate, e.path);
 }
-function bu(e, { patternProperties: t }) {
+function xu(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = Au(i);
+		let a = ju(i);
 		if (a instanceof Error) {
-			Y(e, `property name invalid. ${i}`, "patternProperties", i);
+			J(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = Bl(t[i]), s = Uu(zl(e, "patternProperties", i), o);
+		let o = Vl(t[i]), s = Wu(Bl(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -6298,29 +6299,29 @@ function bu(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function xu(e, { propertyNames: t }) {
-	if (!t) return Q(X.Any, {}, e.delegate, e.path);
-	t = Bl(t);
-	let n = Uu(zl(e, "propertyNames"), t);
+function Su(e, { propertyNames: t }) {
+	if (!t) return Z(Y.Any, {}, e.delegate, e.path);
+	t = Vl(t);
+	let n = Wu(Bl(e, "propertyNames"), t);
 	if (!n) return null;
-	let r = Z(n);
-	return r !== X.String && r !== X.Any ? nu(n) : n;
+	let r = X(n);
+	return r !== Y.String && r !== Y.Any ? ru(n) : n;
 }
-function Su(e, t, n, { properties: r }) {
+function Cu(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (mu(n, o) === pu.Invalid) {
-			Y(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
+		if (hu(n, o) === mu.Invalid) {
+			J(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = ku(t, o);
-		if (s && Z(s) === X.Never) {
-			Y(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
+		let s = Au(t, o);
+		if (s && X(s) === Y.Never) {
+			J(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = Bl(r[o]), l = Uu(zl(e, "properties", o), c);
+		let c = Vl(r[o]), l = Wu(Bl(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -6329,62 +6330,62 @@ function Su(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function Cu(e, { dependencies: t }) {
+function wu(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = Bl(t[i]);
+		let a = Vl(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = Ou(a);
-			r && Y(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
+			let { keys: t, duplicated: r } = ku(a);
+			r && J(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = Uu(zl(e, "dependencies", i), a);
+			let t = Wu(Bl(e, "dependencies", i), a);
 			if (t) {
-				let e = Z(t);
-				r[i] = e === X.Object || e === X.Any ? t : e === X.Extends ? Xl : nu(t);
+				let e = X(t);
+				r[i] = e === Y.Object || e === Y.Any ? t : e === Y.Extends ? Zl : ru(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function wu(e, t, n, r) {
+function Tu(e, t, n, r) {
 	return (i) => {
-		if (mu(n, i) === pu.Invalid) return !0;
-		let a = ku(t, i);
-		return !!(a && Z(a) === X.Never || Z(r[i] ?? e) === X.Never);
+		if (hu(n, i) === mu.Invalid) return !0;
+		let a = Au(t, i);
+		return !!(a && X(a) === Y.Never || X(r[i] ?? e) === Y.Never);
 	};
 }
-function Tu(e, t, n, { required: r }) {
+function Eu(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = Ou(r);
-	i.duplicated && Y(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
+	let i = ku(r);
+	i.duplicated && J(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) Du(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 Eu(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;
-	if (Z(t) !== X.Never) return !1;
+	for (let e of i.keys) Ou(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	return o.length > 0 && J(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
+}
+function Du(e, t, n, r, i, a) {
+	if (i !== void 0 && a !== void 0 && i < a) return J(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
+	if (i !== void 0 && r.length > i) return J(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
+	if (a !== void 0 && r.length < a) return J(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
+	if (X(t) !== Y.Never) return !1;
 	for (let e in n) {
 		let t = n[e];
-		if (Z(t) !== X.Never) return !1;
+		if (X(t) !== Y.Never) return !1;
 	}
 	return !0;
 }
-function Du([e, t], n) {
+function Ou([e, t], n) {
 	let r = [n], i = new Set(r);
 	for (; r.length > 0;) {
 		let n = r.pop(), i = t[n], o = e[n];
-		i && Z(i) === X.Object && a(i.required), o && a(o);
+		i && X(i) === Y.Object && a(i.required), o && a(o);
 	}
 	function a(e) {
 		if (e) for (let t of e) i.has(t) || (i.add(t), r.push(t));
 	}
 	return [...i];
 }
-function Ou(e) {
+function ku(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 ? {
@@ -6395,14 +6396,14 @@ function Ou(e) {
 		duplicated: [...n]
 	};
 }
-function ku(e, t) {
+function Au(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function Au(e) {
+function ju(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -6410,12 +6411,12 @@ function Au(e) {
 		throw e;
 	}
 }
-function ju(e) {
+function Mu(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function Mu([e, t], { dependencies: n }) {
+function Nu([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -6425,78 +6426,78 @@ function Mu([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var Nu = /* @__PURE__ */ new Set([
+var Pu = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Pu = /* @__PURE__ */ new Set([
+]), Fu = /* @__PURE__ */ new Set([
 	"type",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function Fu(e, t) {
+function Iu(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return Iu(e, t);
-		case "string": return Ru(e, t);
+		case "integer": return Lu(e, t);
+		case "string": return zu(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => Ll(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);
+			let r = Object.keys(t).filter((e) => Rl(e) && e !== "type");
+			return r.length > 0 && J(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Z(n === "null" ? Y.Null : Y.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return Vl(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return Hl(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function Iu(e, t) {
-	let n = Object.keys(t).filter((e) => !Nu.has(e) && Ll(e));
-	n.length > 0 && Y(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = cl(t, Nu);
-	for (let t of Nu) {
+function Lu(e, t) {
+	let n = Object.keys(t).filter((e) => !Pu.has(e) && Rl(e));
+	n.length > 0 && J(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = ll(t, Pu);
+	for (let t of Pu) {
 		let n = r[t];
-		t !== "type" && n !== void 0 && Number.isNaN(n) && (Y(e, "found NaN", t), delete r[t]);
+		t !== "type" && n !== void 0 && Number.isNaN(n) && (J(e, "found NaN", t), delete r[t]);
 	}
 	let { maximum: i, exclusiveMaximum: a, minimum: o, exclusiveMinimum: s } = r;
 	i !== void 0 && a !== void 0 && (i === a ? delete r.maximum : i < a ? delete r.exclusiveMaximum : i > a && delete r.maximum), o !== void 0 && s !== void 0 && (o === s ? delete r.minimum : o < s ? delete r.exclusiveMinimum : o > s && delete r.minimum);
 	let { multipleOf: c } = r;
-	c === 0 && (delete r.multipleOf, r.type = "number", Y(e, "cannot be 0", "multipleOf"));
-	let l = X.Numeric;
-	return Lu(r) || (l = X.Never), Q(l, r, e.delegate, e.path);
+	c === 0 && (delete r.multipleOf, r.type = "number", J(e, "cannot be 0", "multipleOf"));
+	let l = Y.Numeric;
+	return Ru(r) || (l = Y.Never), Z(l, r, e.delegate, e.path);
 }
-function Lu(e) {
+function Ru(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 Ru(e, t) {
-	let n = Object.keys(t).filter((e) => !Pu.has(e) && Ll(e));
-	n.length > 0 && Y(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = cl(t, Pu);
-	zu(e, r, "maxLength"), zu(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 zu(e, t) {
+	let n = Object.keys(t).filter((e) => !Fu.has(e) && Rl(e));
+	n.length > 0 && J(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = ll(t, Fu);
+	Bu(e, r, "maxLength"), Bu(e, r, "minLength");
+	let i = r.maxLength, a = r.minLength, o = Y.String;
+	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = Y.Never), Z(o, r, e.delegate, e.path);
 }
-function zu(e, t, n) {
+function Bu(e, t, n) {
 	let r = t[n];
-	r !== void 0 && Number.isNaN(r) && (Y(e, "found NaN", n), delete t[n]);
+	r !== void 0 && Number.isNaN(r) && (J(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Bu = Object.freeze([]);
-function Vu(e, t, n, r) {
-	if (Ql(e) || t.isExtendsSchema(e)) return {
+var Vu = Object.freeze([]);
+function Hu(e, t, n, r) {
+	if ($l(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Bu
+		warns: Vu
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Nl.External,
+				kind: Pl.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -6509,19 +6510,19 @@ function Vu(e, t, n, r) {
 		path: [],
 		errors: [],
 		warns: []
-	}, a = Uu(i, e);
-	if (a) Hu(i.errors.length === 0, "found errors (it should be empty)");
-	else return Hu(i.errors.length > 0, "cannot found any errors"), i.errors;
+	}, a = Wu(i, e);
+	if (a) Uu(i.errors.length === 0, "found errors (it should be empty)");
+	else return Uu(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function Hu(e, t) {
+function Uu(e, t) {
 	if (!e) throw Error(t);
 }
-function Uu(e, t) {
-	if (e.extends.isExtendsSchema(t) || Ql(t)) return t;
+function Wu(e, t) {
+	if (e.extends.isExtendsSchema(t) || $l(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;
@@ -6529,58 +6530,58 @@ function Uu(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = Wu(e, r);
-	return s && i && (s = hu(e, a, o, s)), s || null;
+	let s = Gu(e, r);
+	return s && i && (s = gu(e, a, o, s)), s || null;
 }
-function Wu(e, t) {
-	for (let n of uu) {
+function Gu(e, t) {
+	for (let n of du) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => Ll(e) && e !== n);
-			return i.length > 0 && Y(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), du(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => Rl(e) && e !== n);
+			return i.length > 0 && J(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), fu(e, n, r) || null;
 		}
 	}
 	{
-		let n = Bl(t.not);
+		let n = Vl(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => Ll(e) && e !== "not");
-			r.length > 0 && Y(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = Uu(zl(e, "not"), n);
+			let r = Object.keys(t).filter((e) => Rl(e) && e !== "not");
+			r.length > 0 && J(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
+			let i = Wu(Bl(e, "not"), n);
 			if (!i) return null;
-			let a = X.Not;
-			switch (Z(i)) {
-				case X.Never:
-					a = X.Any;
+			let a = Y.Not;
+			switch (X(i)) {
+				case Y.Never:
+					a = Y.Any;
 					break;
-				case X.Any: a = X.Never;
+				case Y.Any: a = Y.Never;
 			}
-			return Q(a, { not: i }, e.delegate, e.path);
+			return Z(a, { not: i }, e.delegate, e.path);
 		}
 	}
 	if (t.type) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return du(e, "anyOf", n.map((e) => ({
+			return fu(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return _u(e, t);
-			case "array": return iu(e, t);
-			default: return Fu(e, t);
+			case "object": return vu(e, t);
+			case "array": return au(e, t);
+			default: return Iu(e, t);
 		}
 	}
-	return Rl(t) ? Q(X.Any, {}, e.delegate, e.path) : (Vl(e, "unrecognized"), null);
+	return zl(t) ? Z(Y.Any, {}, e.delegate, e.path) : (Hl(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var Gu = class {
+var Ku = 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 Ku {
+		this.keys = t, this.clazz = class extends qu {
 			constructor(e) {
 				super(t, e);
 			}
@@ -6604,7 +6605,7 @@ var Gu = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Ku = class {
+}, qu = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -6619,21 +6620,21 @@ var Gu = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function qu(e) {
-	return new Ju(e);
+function Ju(e) {
+	return new Yu(e);
 }
-var Ju = class {
+var Yu = class {
 	constructor(e) {
-		this.description = new Gu(e);
+		this.description = new Ku(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Yu(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new Xu(this.description, t);
 	}
-}, Yu = class {
+}, Xu = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -6654,7 +6655,7 @@ var Ju = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of dl) if (e & a) {
+		for (let r of this.values) for (let [i, a] of fl) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -6671,11 +6672,11 @@ var Ju = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function Xu(e, t) {
+function Zu(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? Zu(e, t) : n.num > r.num ? Qu(e, t) : $u(e, t);
+	return n.num < r.num ? Qu(e, t) : n.num > r.num ? $u(e, t) : ed(e, t);
 }
-function Zu(e, t) {
+function Qu(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -6700,11 +6701,11 @@ function Zu(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [ed(r), a]
+				range: [td(r), a]
 			}), {
 				left: {
 					fromLeft: !0,
-					range: [n, ed(i)]
+					range: [n, td(i)]
 				},
 				center: [i, r],
 				right: t
@@ -6714,16 +6715,16 @@ function Zu(e, t) {
 	return {
 		left: {
 			fromLeft: !0,
-			range: [n, ed(i)]
+			range: [n, td(i)]
 		},
 		center: [i, a],
 		right: {
 			fromLeft: !0,
-			range: [ed(a), r]
+			range: [td(a), r]
 		}
 	};
 }
-function Qu(e, t) {
+function $u(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -6748,11 +6749,11 @@ function Qu(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !0,
-				range: [ed(a), r]
+				range: [td(a), r]
 			}), {
 				left: {
 					fromLeft: !1,
-					range: [i, ed(n)]
+					range: [i, td(n)]
 				},
 				center: [n, a],
 				right: t
@@ -6762,23 +6763,23 @@ function Qu(e, t) {
 	return {
 		left: {
 			fromLeft: !1,
-			range: [i, ed(n)]
+			range: [i, td(n)]
 		},
 		center: [n, r],
 		right: {
 			fromLeft: !1,
-			range: [ed(r), a]
+			range: [td(r), a]
 		}
 	};
 }
-function $u(e, t) {
+function ed(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, ed(i)]
+		range: [n, td(i)]
 	}) : o && !s && (c = {
 		fromLeft: !1,
-		range: [i, ed(n)]
+		range: [i, td(n)]
 	}), r.num <= a.num) {
 		let e = !0, t = !1;
 		if (r.num === a.num) {
@@ -6789,7 +6790,7 @@ function $u(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [ed(r), a]
+				range: [td(r), a]
 			}), {
 				left: c,
 				center: [l, r],
@@ -6802,11 +6803,11 @@ function $u(e, t) {
 		center: [l, a],
 		right: {
 			fromLeft: !0,
-			range: [ed(a), r]
+			range: [td(a), r]
 		}
 	};
 }
-function ed(e) {
+function td(e) {
 	return {
 		num: e.num,
 		exclusive: !e.exclusive
@@ -6814,8 +6815,8 @@ function ed(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var td = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = Xu([{
+var nd = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = Zu([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -6845,126 +6846,126 @@ var td = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function nd({ left: e, right: t, intersection: n }) {
-	if (!n) return H.Rejection;
+function rd({ left: e, right: t, intersection: n }) {
+	if (!n) return V.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;
+	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? V.Intersection : r ? V.Containing : i ? V.ContainedBy : V.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var rd = td(0), id = qu([
+var id = nd(0), ad = Ju([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function ad({ calculate: e }, t, n) {
-	let r = rd(t.minItems, t.maxItems, n.minItems, n.maxItems), i = nd(r);
-	if (i === H.Rejection) return K;
-	let [a, o] = od(t), [s, c] = od(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = id.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+function od({ calculate: e }, t, n) {
+	let r = id(t.minItems, t.maxItems, n.minItems, n.maxItems), i = rd(r);
+	if (i === V.Rejection) return G;
+	let [a, o] = sd(t), [s, c] = sd(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = ad.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) => {
 			switch (e) {
-				case H.Equals:
+				case V.Equals:
 					n.hasRejection || (n.hasCommon = !0);
 					break;
-				case H.Containing:
+				case V.Containing:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0;
 					break;
-				case H.ContainedBy:
+				case V.ContainedBy:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra2 = !0;
 					break;
-				case H.Intersection:
+				case V.Intersection:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0, n.hasExtra2 = !0;
 					break;
-				case H.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
+				case V.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
 			}
 		});
 	}
 	d.update((e) => {
 		switch (i) {
-			case H.Containing:
+			case V.Containing:
 				e.hasExtra1 = !0;
 				break;
-			case H.ContainedBy:
+			case V.ContainedBy:
 				e.hasExtra2 = !0;
 				break;
-			case H.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
+			case V.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
 		}
 		(t.maxItems === 0 || n.maxItems === 0) && (e.hasCommon = !0, t.maxItems !== 0 && (e.hasExtra1 = !0), n.maxItems !== 0 && (e.hasExtra2 = !0));
 	});
 	let p = 0;
 	for (let { hasExtra1: e, hasExtra2: t, hasCommon: n, hasCommonBroken: r } of d) {
 		let i = n;
-		r && (i = !1), p |= i ? e && t ? q : e ? W : t ? G : U : K;
+		r && (i = !1), p |= i ? e && t ? K : e ? U : t ? W : H : G;
 	}
 	return p;
 }
-function od({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? Yl] : [[], e ?? Yl];
+function sd({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? Xl] : [[], e ?? Xl];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function sd(e) {
+function cd(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = Zl(n);
-		return i === Zl(r) ? i ? ld(t, n, r, e) : n === r : !1;
+		let i = Ql(n);
+		return i === Ql(r) ? i ? ud(t, n, r, e) : n === r : !1;
 	};
 }
-function cd(e) {
+function ld(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => ld(t, n, r, e);
+	return (n, r) => ud(t, n, r, e);
 }
-function ld(e, t, n, r) {
-	let i = `${$l(t)}/${$l(n)}`, a = e.get(i);
+function ud(e, t, n, r) {
+	let i = `${eu(t)}/${eu(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 ud(e, t, n) {
-	let r = fd(t), i = fd(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (pd(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (pd(e, r, t) ? s = !0 : o = !0, o && s) break;
-	return s ? a && o ? q : a ? W : o ? G : U : K;
+function dd(e, t, n) {
+	let r = pd(t), i = pd(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (md(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (md(e, r, t) ? s = !0 : o = !0, o && s) break;
+	return s ? a && o ? K : a ? U : o ? W : H : G;
 }
-function dd(e, t) {
+function fd(e, t) {
 	let n = !1, r = !1;
-	for (let i of fd(e)) {
-		switch (mu(t, i)) {
-			case pu.Valid:
+	for (let i of pd(e)) {
+		switch (hu(t, i)) {
+			case mu.Valid:
 				n = !0;
 				break;
-			case pu.Invalid:
+			case mu.Invalid:
 				r = !0;
 				break;
-			case pu.Unknown: return fl;
+			case mu.Unknown: return pl;
 		}
 		if (n && r) break;
 	}
-	return n && r ? q : n ? U | G : r ? K : Z(t) === X.Never ? U : G;
+	return n && r ? K : n ? H | W : r ? G : X(t) === Y.Never ? H : W;
 }
-function fd({ const: e, enum: t }) {
+function pd({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function pd({ isEquals: e }, t, n) {
+function md({ 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 md(e) {
+function hd(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 = $l(e), a = $l(t);
+		let r = eu(e), a = eu(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;
@@ -6981,25 +6982,25 @@ function md(e) {
 		return !0;
 	}
 	function a(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 e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : $l(e) && $l(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function hd(e) {
-	let t = Sd(e), n = e.multipleOf ?? 1, r = _d(t, n);
+function gd(e) {
+	let t = Cd(e), n = e.multipleOf ?? 1, r = vd(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function gd([e, t]) {
+function _d([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
-function _d(e, t) {
+function vd(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = vd(n.num, t), a = yd(r.num, t);
+	let [n, r] = e, i = yd(n.num, t), a = bd(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
@@ -7008,29 +7009,29 @@ function _d(e, t) {
 		exclusive: !1
 	}];
 }
-function vd(e, t) {
+function yd(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function yd(e, t) {
+function bd(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function bd(e, t) {
-	let { left: n, right: r, center: i } = Xu(Sd(e), Sd(t));
-	if (!i) return K;
+function xd(e, t) {
+	let { left: n, right: r, center: i } = Zu(Cd(e), Cd(t));
+	if (!i) return G;
 	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;
+	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? K : a ? U : o ? W : H;
 }
-function xd(e, t) {
-	let n = Sd(e), r = hd(t);
-	if (!r) return W;
-	let i = Xu(n, r.range), a = _d(i.center, r.multipleOf), o = Cd(i.left, r.multipleOf), s = Cd(i.right, r.multipleOf);
-	if (!i.center) return K;
+function Sd(e, t) {
+	let n = Cd(e), r = gd(t);
+	if (!r) return U;
+	let i = Zu(n, r.range), a = vd(i.center, r.multipleOf), o = wd(i.left, r.multipleOf), s = wd(i.right, r.multipleOf);
+	if (!i.center) return G;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !gd(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 || !_d(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? K : c ? U : l ? W : H;
 }
-function Sd(e) {
+function Cd(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -7052,84 +7053,84 @@ function Sd(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function Cd(e, t) {
-	if (e && !e.fromLeft) return _d(e.range, t);
+function wd(e, t) {
+	if (e && !e.fromLeft) return vd(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function wd(e, t) {
-	let n = hd(e), r = hd(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 = Xu(i, o), l, u = 0;
-	if (c.center && (u = Ed(a, s), l = _d(c.center, u)), !l) return K;
+function Td(e, t) {
+	let n = gd(e), r = gd(t);
+	if (!n && !r) return H;
+	if (!n) return W;
+	if (!r) return U;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Zu(i, o), l, u = 0;
+	if (c.center && (u = Dd(a, s), l = vd(c.center, u)), !l) return G;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && _d(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && _d(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Td(n, l, u), f ||= Td(r, l, u), d && f ? q : d ? W : f ? G : U;
+	return p && vd(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && vd(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Ed(n, l, u), f ||= Ed(r, l, u), d && f ? K : d ? U : f ? W : H;
 }
-function Td({ range: e, multipleOf: t }, n, r) {
-	let i = Xu(e, n);
-	if (_d(i.left?.range, t) || _d(i.right?.range, t)) return !0;
-	let a = _d(i.center, t);
+function Ed({ range: e, multipleOf: t }, n, r) {
+	let i = Zu(e, n);
+	if (vd(i.left?.range, t) || vd(i.right?.range, t)) return !0;
+	let a = vd(i.center, t);
 	if (!a) return !1;
-	let o = Od(n);
-	return Od(a) > o || o !== 1 && t < r;
-}
-function Ed(e, t) {
-	return e * t / Dd(e, t);
+	let o = kd(n);
+	return kd(a) > o || o !== 1 && t < r;
 }
 function Dd(e, t) {
-	return e === 0 ? t : Dd(t % e, e);
+	return e * t / Od(e, t);
+}
+function Od(e, t) {
+	return e === 0 ? t : Od(t % e, e);
 }
-function Od(e) {
+function kd(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 kd(e, t) {
-	if (Ad(e) || Ad(t)) return fl;
-	let n = jd(e), r = jd(t);
-	return n && r ? bd(e, t) : n ? xd(e, t) : r ? Sl(xd(t, e)) : wd(e, t);
+function Ad(e, t) {
+	if (jd(e) || jd(t)) return pl;
+	let n = Md(e), r = Md(t);
+	return n && r ? xd(e, t) : n ? Sd(e, t) : r ? Cl(Sd(t, e)) : Td(e, t);
 }
-function Ad(e) {
+function jd(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function jd(e) {
+function Md(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 Md = td(0), Nd = qu([
+var Nd = nd(0), Pd = Ju([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function Pd(e, t, n) {
-	if (Fd(t, n)) return K;
-	let r = Id(t, n);
-	if (!r) return K;
-	let i = Hd(t), a = Hd(n), o = (t) => {
+function Fd(e, t, n) {
+	if (Id(t, n)) return G;
+	let r = Ld(t, n);
+	if (!r) return G;
+	let i = Ud(t), a = Ud(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return Ud(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Nd.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), Rd);
-	for (let e of [...c].toSorted()) u.push(o(e), zd);
-	for (let e of [...l].toSorted()) u.push(o(e), Bd);
+		return Wd(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Pd.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), zd);
+	for (let e of [...c].toSorted()) u.push(o(e), Bd);
+	for (let e of [...l].toSorted()) u.push(o(e), Vd);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = Vd(d, f);
-		for (let e of [...Ld(t, n)].toSorted()) {
+		let r = Hd(d, f);
+		for (let e of [...Rd(t, n)].toSorted()) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? Yl, a = n.additionalProperties ?? Yl;
-		if (Ud(i, a)) {
+		let i = t.additionalProperties ?? Xl, a = n.additionalProperties ?? Xl;
+		if (Wd(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -7138,13 +7139,13 @@ function Pd(e, t, n) {
 		e.hasRejection || (c.size > 0 && (e.hasExtra2 = !0), l.size > 0 && (e.hasExtra1 = !0));
 	});
 	let { requiredKeysCount: p } = r, m = 0;
-	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;
+	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? G : e && t ? K : e ? U : t ? W : H;
 	return m;
 }
-function Fd(e, t) {
-	return nd(Md(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === H.Rejection;
-}
 function Id(e, t) {
+	return rd(Nd(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === V.Rejection;
+}
+function Ld(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);
@@ -7160,7 +7161,7 @@ function Id(e, t) {
 		hasOptional2: u > s
 	};
 }
-function Ld(e, t) {
+function Rd(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);
@@ -7168,67 +7169,67 @@ function Ld(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var Rd = (e, t) => {
+var zd = (e, t) => {
 	switch (e) {
-		case H.Equals:
+		case V.Equals:
 			t.hasCommonInRequired = !0;
 			break;
-		case H.Containing:
+		case V.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case H.ContainedBy:
+		case V.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case H.Intersection:
+		case V.Intersection:
 			t.hasExtra1 = !0, t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case H.Rejection: t.hasRejection = !0;
+		case V.Rejection: t.hasRejection = !0;
 	}
-}, zd = (e, t) => {
+}, Bd = (e, t) => {
 	switch (e) {
-		case H.Equals:
-		case H.ContainedBy:
+		case V.Equals:
+		case V.ContainedBy:
 			t.hasCommonInRequired = !0;
 			break;
-		case H.Intersection:
-		case H.Containing:
+		case V.Intersection:
+		case V.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case H.Rejection: t.hasRejection = !0;
+		case V.Rejection: t.hasRejection = !0;
 	}
-}, Bd = (e, t) => {
+}, Vd = (e, t) => {
 	switch (e) {
-		case H.Equals:
-		case H.Containing:
+		case V.Equals:
+		case V.Containing:
 			t.hasCommonInRequired = !0;
 			break;
-		case H.Intersection:
-		case H.ContainedBy:
+		case V.Intersection:
+		case V.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case H.Rejection: t.hasRejection = !0;
+		case V.Rejection: t.hasRejection = !0;
 	}
-}, Vd = (e, t) => (n, r) => {
+}, Hd = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
-		case H.Equals:
+		case V.Equals:
 			o = !0;
 			break;
-		case H.Containing:
+		case V.Containing:
 			i = !0, o = !0;
 			break;
-		case H.ContainedBy:
+		case V.ContainedBy:
 			a = !0, o = !0;
 			break;
-		case H.Intersection:
+		case V.Intersection:
 			i = !0, a = !0, o = !0;
 			break;
-		case H.Rejection: i = !0, a = !0;
+		case V.Rejection: i = !0, a = !0;
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function Hd(e) {
+function Ud(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");
@@ -7238,39 +7239,39 @@ function Hd(e) {
 		});
 	}
 	return (e) => {
-		if (n && mu(n, e) === pu.Invalid) return Xl;
+		if (n && hu(n, e) === mu.Invalid) return Zl;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || Yl;
+		return ((t && t[e]) ?? r) || Xl;
 	};
 }
-function Ud(e, t) {
-	let n = Z(e), r = Z(t);
-	return n !== X.Never || r !== X.Never;
+function Wd(e, t) {
+	let n = X(e), r = X(t);
+	return n !== Y.Never || r !== Y.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var Wd = td(0);
-function Gd(e, t) {
-	let n = nd(Wd(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+var Gd = nd(0);
+function Kd(e, t) {
+	let n = rd(Gd(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 ? fl : W;
-		case H.ContainedBy: return i ? fl : G;
-		case H.Equals: return r && i ? e.pattern === t.pattern ? U : fl : r ? U | G : i ? U | W : U;
-		case H.Intersection: return r && i ? fl : r ? q | K | G : i ? q | K | W : q;
+		case V.Rejection: return G;
+		case V.Containing: return r ? pl : U;
+		case V.ContainedBy: return i ? pl : W;
+		case V.Equals: return r && i ? e.pattern === t.pattern ? H : pl : r ? H | W : i ? H | U : H;
+		case V.Intersection: return r && i ? pl : r ? K | G | W : i ? K | G | U : K;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function Kd(e, t, n) {
-	let r = {}, i = [], a = cd(Jd(e, r)), o = qd(), s = md(e);
-	r.isEquals = sd(ul), r.calculate = jl({
+function qd(e, t, n) {
+	let r = {}, i = [], a = ld(Yd(e, r)), o = Jd(), s = hd(e);
+	r.isEquals = cd(dl), r.calculate = Ml({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!Xd(r ? Sl(n) : n)) return;
-			let a = r ? Zd(t, e) : Zd(e, t);
+			if (!Zd(r ? Cl(n) : n)) return;
+			let a = r ? Qd(t, e) : Qd(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -7280,104 +7281,104 @@ function Kd(e, t, n) {
 		expression: c
 	};
 }
-var qd = () => (e) => {
+var Jd = () => (e) => {
 	let t;
-	switch (Z(e)) {
-		case X.Not:
+	switch (X(e)) {
+		case Y.Not:
 			t = {
-				kind: Al.Not,
+				kind: jl.Not,
 				expression: e.not
 			};
 			break;
-		case X.Combination:
+		case Y.Combination:
 			if ("allOf" in e) t = {
-				kind: Al.AllOf,
-				expressions: Yd(e.allOf, X.Any)
+				kind: jl.AllOf,
+				expressions: Xd(e.allOf, Y.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: Al.AnyOf,
-				expressions: Yd(e.anyOf, X.Never)
+				kind: jl.AnyOf,
+				expressions: Xd(e.anyOf, Y.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: Al.OneOf,
-				expressions: Yd(e.oneOf, X.Never)
+				kind: jl.OneOf,
+				expressions: Xd(e.oneOf, Y.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: Al.Leaf };
+		default: t = { kind: jl.Leaf };
 	}
 	return t;
-}, Jd = (e, t) => (n, r) => {
-	let i = Z(n), a = Z(r);
-	if (i === X.Extends || a === X.Extends) return e.calculate(n, r);
+}, Yd = (e, t) => (n, r) => {
+	let i = X(n), a = X(r);
+	if (i === Y.Extends || a === Y.Extends) return e.calculate(n, r);
 	switch (i) {
-		case X.Any: return a === X.Any ? U : W;
-		case X.Never: return a === X.Never ? U : G;
+		case Y.Any: return a === Y.Any ? H : U;
+		case Y.Never: return a === Y.Never ? H : W;
 	}
 	switch (a) {
-		case X.Any: return G;
-		case X.Never: return W;
+		case Y.Any: return W;
+		case Y.Never: return U;
 	}
-	if (i === X.EnumOrConst && a === X.EnumOrConst) return ud(t, n, r);
-	if (i === X.EnumOrConst) return dd(n, r);
-	if (a === X.EnumOrConst) return Sl(dd(r, n));
-	if (i !== a) return K;
+	if (i === Y.EnumOrConst && a === Y.EnumOrConst) return dd(t, n, r);
+	if (i === Y.EnumOrConst) return fd(n, r);
+	if (a === Y.EnumOrConst) return Cl(fd(r, n));
+	if (i !== a) return G;
 	switch (i) {
-		case X.Null: return U;
-		case X.Numeric: return kd(n, r);
-		case X.String: return Gd(n, r);
-		case X.Boolean: return U;
-		case X.Object: return Pd(t, n, r);
-		case X.Array: return ad(t, n, r);
+		case Y.Null: return H;
+		case Y.Numeric: return Ad(n, r);
+		case Y.String: return Kd(n, r);
+		case Y.Boolean: return H;
+		case Y.Object: return Fd(t, n, r);
+		case Y.Array: return od(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function Yd(e, t) {
-	return e.filter((e) => Z(e) !== t);
+function Xd(e, t) {
+	return e.filter((e) => X(e) !== t);
 }
-function Xd(e) {
-	return !pl(e) && !hl(e) && (ml(e) || _l(e) || gl(e));
+function Zd(e) {
+	return !ml(e) && !gl(e) && (hl(e) || vl(e) || _l(e));
 }
-function Zd(e, t) {
-	let n = eu(t);
+function Qd(e, t) {
+	let n = tu(t);
 	if (!n) return;
-	let r = Z(e), i = Z(t);
+	let r = X(e), i = X(t);
 	if (r !== i) return [...n, "type"];
 	let a = e, o = t;
 	switch (i) {
-		case X.String:
+		case Y.String:
 			if ((a.minLength ?? 0) < (o.minLength ?? 0)) return [...n, "minLength"];
 			if ((a.maxLength ?? Infinity) > (o.maxLength ?? Infinity)) return [...n, "maxLength"];
 			if (a.pattern !== o.pattern && o.pattern) return [...n, "pattern"];
 			break;
-		case X.Numeric:
+		case Y.Numeric:
 			if ((a.minimum ?? a.exclusiveMinimum ?? -Infinity) < (o.minimum ?? o.exclusiveMinimum ?? -Infinity)) return [...n, o.exclusiveMinimum == null ? "minimum" : "exclusiveMinimum"];
 			if ((a.maximum ?? a.exclusiveMaximum ?? Infinity) > (o.maximum ?? o.exclusiveMaximum ?? Infinity)) return [...n, o.exclusiveMaximum == null ? "maximum" : "exclusiveMaximum"];
 			if (a.multipleOf !== o.multipleOf && o.multipleOf != null) return [...n, "multipleOf"];
 			break;
-		case X.Array:
+		case Y.Array:
 			if ((a.minItems ?? 0) < (o.minItems ?? 0)) return [...n, "minItems"];
 			if ((a.maxItems ?? Infinity) > (o.maxItems ?? Infinity)) return [...n, "maxItems"];
 			break;
-		case X.Object: {
+		case Y.Object: {
 			let e = new Set(a.required ?? []);
 			if ((o.required ?? []).some((t) => !e.has(t))) return [...n, "required"];
 			if ((a.minProperties ?? 0) < (o.minProperties ?? 0)) return [...n, "minProperties"];
 			if ((a.maxProperties ?? Infinity) > (o.maxProperties ?? Infinity)) return [...n, "maxProperties"];
 			break;
 		}
-		case X.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
+		case Y.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
 	}
 	return n;
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var Qd = class e {
+var $d = 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(ol(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(sl(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -7387,7 +7388,7 @@ var Qd = 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 |= vl(t);
+		for (let t of a) r && (t = e.swap(t)), i |= yl(t);
 		return i;
 	}
 	equals(e, t) {
@@ -7399,43 +7400,43 @@ var Qd = class e {
 	}
 	static swap(e) {
 		switch (e) {
-			case H.Containing: return H.ContainedBy;
-			case H.ContainedBy: return H.Containing;
+			case V.Containing: return V.ContainedBy;
+			case V.ContainedBy: return V.Containing;
 			default: return e;
 		}
 	}
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function $d(e, t, n = !1) {
+function ef(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw tf(e, r, "$"), new Ml(e);
+		throw nf(e, r, "$"), new Nl(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(Pl(e));
+		for (let e of a) console.warn(Fl(e));
 	}
 	return i;
 }
-function ef(e, t, n, r = !1) {
+function tf(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) && tf(e, i, "$1"), Array.isArray(a) && tf(e, a, "$2"), new Ml(e);
+		throw Array.isArray(i) && nf(e, i, "$1"), Array.isArray(a) && nf(e, a, "$2"), new Nl(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(Pl(e));
+		for (let e of s) console.warn(Fl(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Pl(e));
+		for (let e of l) console.warn(Fl(e));
 	}
 	return [o, c];
 }
-function tf(e, t, n) {
+function nf(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -7446,46 +7447,46 @@ function tf(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var nf = Object.freeze({
+var rf = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function rf({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new Qd(e);
+function af({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new $d(e);
 	return Object.freeze({
-		compile: (e, r, i) => $d(e, (e) => Vu(e, n, r, t), i),
+		compile: (e, r, i) => ef(e, (e) => Hu(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = ef(e, r, (e) => Vu(e, n, void 0, t), i), { errorPath: s, expression: c } = Kd(n, a, o), l = pl(c) || hl(c), u = ml(c) || _l(c) || gl(c);
-			return l && !u ? { result: nf.True } : !l && u ? {
+			let [a, o] = tf(e, r, (e) => Hu(e, n, void 0, t), i), { errorPath: s, expression: c } = qd(n, a, o), l = ml(c) || gl(c), u = hl(c) || vl(c) || _l(c);
+			return l && !u ? { result: rf.True } : !l && u ? {
 				errorPath: s,
-				result: nf.False
-			} : { result: nf.Unknown };
+				result: rf.False
+			} : { result: rf.Unknown };
 		}
 	});
 }
 //#endregion
 //#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
-var af = (e) => e !== void 0, of = (e) => typeof e == "string", sf = Array.isArray, cf = (e) => typeof e == "object" && !!e, lf = (e) => cf(e) && !sf(e), uf = (e) => lf(e) ? e : void 0;
+var of = (e) => e !== void 0, sf = (e) => typeof e == "string", cf = Array.isArray, lf = (e) => typeof e == "object" && !!e, uf = (e) => lf(e) && !cf(e), Q = (e) => uf(e) ? e : void 0;
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
 function df(e) {
-	return uf(e)?.type === "string";
+	return Q(e)?.type === "string";
 }
 function ff(e) {
-	return e instanceof yf || uf(e)?.type === "array";
+	return e instanceof yf || Q(e)?.type === "array";
 }
 function pf(e) {
-	let t = uf(e);
-	return t?.type === "array" && uf(t.items)?.type === "string";
+	let t = Q(e);
+	return t?.type === "array" && Q(t.items)?.type === "string";
 }
 function mf(e) {
-	let t = uf(e);
+	let t = Q(e);
 	return t != null && Object.keys(t).length === 0;
 }
 function hf(e) {
-	let t = uf(e), n = uf(t?.error);
-	if (t == null || n == null || t.packageId != null && !of(t.packageId) || n.message != null && !of(n.message)) throw TypeError("Invalid schema comparison context.");
+	let t = Q(e), n = Q(t?.error);
+	if (t == null || n == null || t.packageId != null && !sf(t.packageId) || n.message != null && !sf(n.message)) throw TypeError("Invalid schema comparison context.");
 }
 function gf(e) {
 	return e == null ? { error: {} } : (hf(e), e);
@@ -7501,25 +7502,25 @@ var _f = class e {
 		return this.passThrough(e) || this.compareImpl(e);
 	}
 	passThrough(e) {
-		if (e instanceof xf) return [H.Equals];
+		if (e instanceof xf) return [V.Equals];
 	}
 }, vf = class e extends _f {
 	static isMatch(e) {
-		let t = uf(e)?.enum;
-		return Array.isArray(t) && t.every((e) => of(e));
+		let t = Q(e)?.enum;
+		return Array.isArray(t) && t.every((e) => sf(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid single-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (df(t)) return [H.ContainedBy];
+		if (df(t)) return [V.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);
-			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [H.Rejection] : [H.Intersection];
+			let e = new Set(this.value.enum), n = V.Equals;
+			for (let r of t.value.enum) e.has(r) || (n = V.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [V.Rejection] : [V.Intersection];
 		}
-		return [H.Rejection];
+		return [V.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -7534,21 +7535,21 @@ var _f = class e {
 	}
 }, yf = class e extends _f {
 	static isMatch(e) {
-		let t = uf(e), n = uf(t?.items)?.enum;
-		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => of(e));
+		let t = Q(e), n = Q(t?.items)?.enum;
+		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => sf(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid multi-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (t instanceof bf || pf(t)) return [H.ContainedBy];
+		if (t instanceof bf || pf(t)) return [V.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.items.enum), n = H.Equals;
-			for (let r of t.value.items.enum) e.has(r) || (n = H.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.items.enum.length ? [H.Rejection] : [H.Intersection];
+			let e = new Set(this.value.items.enum), n = V.Equals;
+			for (let r of t.value.items.enum) e.has(r) || (n = V.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.items.enum.length ? [V.Rejection] : [V.Intersection];
 		}
-		return [H.Rejection];
+		return [V.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -7563,15 +7564,15 @@ var _f = class e {
 	}
 }, bf = class e extends _f {
 	static isMatch(e) {
-		let t = uf(e);
-		return t?.type === "array" && !t.uniqueItems && (!af(t.items) || mf(t.items));
+		let t = Q(e);
+		return t?.type === "array" && !t.uniqueItems && (!of(t.items) || mf(t.items));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid array schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e || ff(t) ? [H.Equals] : [H.Rejection];
+		return t instanceof e || ff(t) ? [V.Equals] : [V.Rejection];
 	}
 	equals(t) {
 		return t instanceof e;
@@ -7585,42 +7586,42 @@ var _f = class e {
 		super(t, n, r);
 	}
 	compareImpl(e) {
-		return [H.Equals];
+		return [V.Equals];
 	}
 	equals(e) {
 		return !0;
 	}
 }, Sf = class e extends _f {
 	static isMatch(e) {
-		return uf(e)?.contentMediaType === "oomol/bin";
+		return Q(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] : (_f.setError(this, t, "edgeError.binDiffType"), [H.Rejection]);
+		return t instanceof e ? [V.Equals] : (_f.setError(this, t, "edgeError.binDiffType"), [V.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 }, Cf = class e extends _f {
 	static isMatch(e) {
-		return uf(e)?.contentMediaType === "oomol/artifact";
+		return Q(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] : (_f.setError(this, t, "edgeError.artifactDiffType"), [H.Rejection]);
+		return t instanceof e ? [V.Equals] : (_f.setError(this, t, "edgeError.artifactDiffType"), [V.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
 function wf() {
-	return rf({ extendsSchemaClasses: [
+	return af({ extendsSchemaClasses: [
 		bf,
 		xf,
 		vf,
@@ -7644,7 +7645,7 @@ function Df(e, t) {
 		let t = Ef.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 Tc(structuredClone(n), r), Ef.set(n, t);
+			t = new Ec(structuredClone(n), r), Ef.set(n, t);
 		}
 		return t.validate(e).valid;
 	} catch {
@@ -7653,8 +7654,8 @@ function Df(e, t) {
 }
 //#endregion
 //#region src/flow/common/agent.ts
-var $ = Rs(() => P([j(), cs({
-	type: P([I([
+var $ = zs(() => N([es(), ls({
+	type: N([F([
 		"array",
 		"boolean",
 		"integer",
@@ -7662,7 +7663,7 @@ var $ = Rs(() => P([j(), cs({
 		"number",
 		"object",
 		"string"
-	]), M(I([
+	]), j(F([
 		"array",
 		"boolean",
 		"integer",
@@ -7671,23 +7672,23 @@ var $ = Rs(() => P([j(), cs({
 		"object",
 		"string"
 	])).min(1)]).optional(),
-	const: Hs().optional(),
-	allOf: M($).min(1).optional(),
-	anyOf: M($).min(1).optional(),
-	oneOf: M($).min(1).optional(),
+	const: Us().optional(),
+	allOf: j($).min(1).optional(),
+	anyOf: j($).min(1).optional(),
+	oneOf: j($).min(1).optional(),
 	not: $.optional(),
 	if: $.optional(),
 	then: $.optional(),
 	else: $.optional(),
 	$ref: O().optional(),
-	$schema: I([
+	$schema: F([
 		"http://json-schema.org/draft-07/schema#",
 		"https://json-schema.org/draft-07/schema",
 		"https://json-schema.org/draft/2019-09/schema",
 		"https://json-schema.org/draft/2020-12/schema"
 	]).optional(),
-	$defs: F(O(), $).optional(),
-	definitions: F(O(), $).optional(),
+	$defs: P(O(), $).optional(),
+	definitions: P(O(), $).optional(),
 	pattern: O().refine((e) => {
 		try {
 			return new RegExp(e, "u").source.length > 0;
@@ -7695,42 +7696,42 @@ var $ = Rs(() => P([j(), cs({
 			return !1;
 		}
 	}, "Invalid regular expression.").optional(),
-	format: O().refine((e) => Object.hasOwn(pc, e), "Unsupported string format.").optional(),
+	format: O().refine((e) => Object.hasOwn(mc, e), "Unsupported string format.").optional(),
 	multipleOf: A().positive().optional(),
-	uniqueItems: j().optional(),
+	uniqueItems: es().optional(),
 	contains: $.optional(),
 	minContains: A().int().nonnegative().optional(),
 	maxContains: A().int().nonnegative().optional(),
 	minProperties: A().int().nonnegative().optional(),
 	maxProperties: A().int().nonnegative().optional(),
 	propertyNames: $.optional(),
-	patternProperties: F(O().refine((e) => {
+	patternProperties: P(O().refine((e) => {
 		try {
 			return new RegExp(e, "u").source.length > 0;
 		} catch {
 			return !1;
 		}
 	}, "Invalid regular expression."), $).optional(),
-	dependentRequired: F(O(), M(O())).optional(),
-	dependentSchemas: F(O(), $).optional(),
-	dependencies: F(O(), P([$, M(O())])).optional(),
-	prefixItems: M($).optional(),
+	dependentRequired: P(O(), j(O())).optional(),
+	dependentSchemas: P(O(), $).optional(),
+	dependencies: P(O(), N([$, j(O())])).optional(),
+	prefixItems: j($).optional(),
 	additionalItems: $.optional(),
 	unevaluatedItems: $.optional(),
 	unevaluatedProperties: $.optional(),
 	description: O().optional(),
 	title: O().optional(),
-	default: Hs().optional(),
-	examples: M(Hs()).optional(),
-	readOnly: j().optional(),
-	writeOnly: j().optional(),
-	deprecated: j().optional(),
+	default: Us().optional(),
+	examples: j(Us()).optional(),
+	readOnly: es().optional(),
+	writeOnly: es().optional(),
+	deprecated: es().optional(),
 	$comment: O().optional(),
-	enum: M(Hs()).min(1).optional(),
-	properties: F(O(), $).optional(),
-	required: M(O()).optional(),
+	enum: j(Us()).min(1).optional(),
+	properties: P(O(), $).optional(),
+	required: j(O()).optional(),
 	additionalProperties: $.optional(),
-	items: P([$, M($)]).optional(),
+	items: N([$, j($)]).optional(),
 	minItems: A().int().nonnegative().optional(),
 	maxItems: A().int().nonnegative().optional(),
 	minLength: A().int().nonnegative().optional(),
@@ -7788,8 +7789,8 @@ function Pf(e, t) {
 	switch (t.kind) {
 		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
-		case "subflow": return il(e.subflows[t.subflowId].inputs);
-		case "task": return il([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
+		case "subflow": return al(e.subflows[t.subflowId].inputs);
+		case "task": return al([...t.task == null ? e.tasks[t.taskId].inputs : t.task.inputs, ...t.additionalInputs ?? []]);
 		case "wait": {
 			let n = t.notification, r = n == null ? void 0 : e.tasks[n.taskId];
 			return {
@@ -7803,7 +7804,7 @@ function Ff(e, t) {
 	if (t.name != null) return t.name;
 	switch (t.kind) {
 		case "condition": return;
-		case "value": return "Value";
+		case "value": return "Fixed Values";
 		case "subflow": return e.subflows[t.subflowId].name;
 		case "task": return t.task == null ? e.tasks[t.taskId].name : t.task.name;
 		case "wait": return "Wait";
@@ -7831,18 +7832,18 @@ function Bf(e, t, n = 0) {
 	let r = Lf(e, t);
 	return Object.fromEntries(Object.entries(r).map(([e, r]) => [e, Bf(r, t, n + 1)]));
 }
-var Vf = cs({
-	state: Hs(),
+var Vf = ls({
+	state: Us(),
 	callId: O().min(1),
 	toolId: O().min(1),
-	input: F(O(), Hs()),
+	input: P(O(), Us()),
 	rounds: A().int().nonnegative(),
-	version: L(1)
-}), Hf = P([cs({
-	kind: L("completed"),
-	output: Hs()
-}), cs({
-	kind: L("suspended"),
+	version: I(1)
+}), Hf = N([ls({
+	kind: I("completed"),
+	output: Us()
+}), ls({
+	kind: I("suspended"),
 	checkpoint: Vf
 })]);
 function Uf(e) {
@@ -7870,14 +7871,14 @@ function Uf(e) {
 	if (!Array.isArray(t.skipped)) throw Error("Checkpoint skipped nodes must be an array.");
 	let a = t.skipped.map((e) => zf(e, "Checkpoint skipped node"));
 	if (new Set(a).size != a.length || a.some((e) => i[e] != null)) throw Error("Checkpoint node states conflict.");
-	let o = cs({
+	let o = ls({
 		jobId: O().min(1),
 		nodeId: O().min(1),
-		value: Hs(),
+		value: Us(),
 		waitId: O().min(1)
-	}), s = o.parse(t.wait), c = M(o).parse(t.queue), l = F(O(), cs({
+	}), s = o.parse(t.wait), c = j(o).parse(t.queue), l = P(O(), ls({
 		invocationId: O().min(1),
-		input: F(O(), Hs()),
+		input: P(O(), Us()),
 		remainingMs: A().positive().optional(),
 		checkpoint: Vf
 	})).parse(t.agents), u = /* @__PURE__ */ new Set(), d = /* @__PURE__ */ new Set();
@@ -7984,7 +7985,7 @@ function Yf(e, t, n) {
 	};
 }
 function Xf(e, t, n, r) {
-	let i = Kf(Bf(r === void 0 ? {} : r, `Node "${t}" outputs`), t), a = n.kind == "task" ? il(n.task == null ? e.tasks[n.taskId].outputs : n.task.outputs) : n.kind == "subflow" ? il(e.subflows[n.subflowId].outputs) : n.kind == "value" ? il(n.values) : Object.fromEntries((n.kind == "wait" ? n.actions : [...n.cases.map((e) => e.output), ...n.defaultOutput == null ? [] : [n.defaultOutput]]).map((e) => [e, n.input]));
+	let i = Kf(Bf(r === void 0 ? {} : r, `Node "${t}" outputs`), t), a = n.kind == "task" ? al(n.task == null ? e.tasks[n.taskId].outputs : n.task.outputs) : n.kind == "subflow" ? al(e.subflows[n.subflowId].outputs) : n.kind == "value" ? al(n.values) : Object.fromEntries((n.kind == "wait" ? n.actions : [...n.cases.map((e) => e.output), ...n.defaultOutput == null ? [] : [n.defaultOutput]]).map((e) => [e, n.input]));
 	for (let [e, n] of Object.entries(i)) {
 		let r = a[e];
 		if (r == null || !(n === null && r.nullable) && !Df(n, r.jsonSchema)) throw Error(`Node "${t}" output "${e}" does not match its declaration.`);