@oomol-lab/open-flow 0.1.0-beta.39 → 0.1.0-beta.40

package/dist/common/provider-triggers.js

@@ -4535,28 +4535,28 @@ var O = /*@__PURE__*/ x("ZodType", (e, t) => (ac(), C.init(e, t), e.def = t, e.t
 		return e.add(this, t), this;
 	},
 	refine(e, t) {
-		return this.check(Cl(e, t));
+		return this.check(wl(e, t));
 	},
 	superRefine(e, t) {
-		return this.check(wl(e, t));
+		return this.check(Tl(e, t));
 	},
 	overwrite(e) {
 		return this.check(/* @__PURE__ */ jo(e));
 	},
 	optional() {
-		return rl(this);
+		return il(this);
 	},
 	exactOptional() {
-		return al(this);
+		return ol(this);
 	},
 	nullable() {
-		return sl(this);
+		return cl(this);
 	},
 	nullish() {
-		return rl(sl(this));
+		return il(cl(this));
 	},
 	nonoptional(e) {
-		return pl(this, e);
+		return ml(this, e);
 	},
 	array() {
 		return A(this);
@@ -4568,22 +4568,22 @@ var O = /*@__PURE__*/ x("ZodType", (e, t) => (ac(), C.init(e, t), e.def = t, e.t
 		return Xc(this, e);
 	},
 	transform(e) {
-		return _l(this, tl(e));
+		return vl(this, nl(e));
 	},
 	default(e) {
-		return ll(this, e);
+		return ul(this, e);
 	},
 	prefault(e) {
-		return dl(this, e);
+		return fl(this, e);
 	},
 	catch(e) {
-		return hl(this, e);
+		return gl(this, e);
 	},
 	pipe(e) {
-		return _l(this, e);
+		return vl(this, e);
 	},
 	readonly() {
-		return yl(this);
+		return bl(this);
 	},
 	describe(e) {
 		let t = this.clone();
@@ -4979,7 +4979,7 @@ var Kc = /*@__PURE__*/ x("ZodObject", (e, t) => {
 	oc(), zi.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ds(e, t, n, r), Qt(e, "shape", (e) => e._zod.def.shape, !1);
 }, {
 	keyof() {
-		return P(Object.keys(this._zod.def.shape));
+		return $c(Object.keys(this._zod.def.shape));
 	},
 	catchall(e) {
 		return this.clone(v(this._zod.def, { catchall: e }));
@@ -5012,13 +5012,13 @@ var Kc = /*@__PURE__*/ x("ZodObject", (e, t) => {
 		return Tt(this, e);
 	},
 	partial(...e) {
-		return At(nl, this, e[0]);
+		return At(rl, this, e[0]);
 	},
 	exactPartial(...e) {
-		return At(il, this, e[0], "exactPartial");
+		return At(al, this, e[0], "exactPartial");
 	},
 	required(...e) {
-		return jt(fl, this, e[0]);
+		return jt(pl, this, e[0]);
 	}
 });
 function j(e, t) {
@@ -5097,27 +5097,27 @@ var Qc = /*@__PURE__*/ x("ZodEnum", (e, t) => {
 		});
 	};
 });
-function P(e, t) {
+function $c(e, t) {
 	return new Qc({
 		type: "enum",
 		entries: Array.isArray(e) ? Object.fromEntries(e.map((e) => [e, e])) : e,
 		...y(t)
 	});
 }
-var $c = /*@__PURE__*/ x("ZodLiteral", (e, t) => {
+var el = /*@__PURE__*/ x("ZodLiteral", (e, t) => {
 	qi.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ss(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 F(e, t) {
-	return new $c({
+function P(e, t) {
+	return new el({
 		type: "literal",
 		values: Array.isArray(e) ? e : [e],
 		...y(t)
 	});
 }
-var el = /*@__PURE__*/ x("ZodTransform", (e, t) => {
+var tl = /*@__PURE__*/ x("ZodTransform", (e, t) => {
 	oc(), Ji.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => ws(e, t, n, r), e._zod.parse = (n, r) => {
 		if (r.direction === "backward") throw new sn(e.constructor.name);
 		n.addIssue = (r) => {
@@ -5131,44 +5131,44 @@ var el = /*@__PURE__*/ x("ZodTransform", (e, t) => {
 		return i instanceof Promise ? i.then((e) => (n.value = e, n)) : (n.value = i, n);
 	};
 });
-function tl(e) {
-	return new el({
+function nl(e) {
+	return new tl({
 		type: "transform",
 		transform: e
 	});
 }
-var nl = /*@__PURE__*/ x("ZodOptional", (e, t) => {
+var rl = /*@__PURE__*/ x("ZodOptional", (e, t) => {
 	Xi.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Us(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function rl(e) {
-	return new nl({
+function il(e) {
+	return new rl({
 		type: "optional",
 		innerType: e
 	});
 }
-var il = /*@__PURE__*/ x("ZodExactOptional", (e, t) => {
+var al = /*@__PURE__*/ x("ZodExactOptional", (e, t) => {
 	Zi.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Us(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function al(e) {
-	return new il({
+function ol(e) {
+	return new al({
 		type: "optional",
 		innerType: e
 	});
 }
-var ol = /*@__PURE__*/ x("ZodNullable", (e, t) => {
+var sl = /*@__PURE__*/ x("ZodNullable", (e, t) => {
 	Qi.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ps(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function sl(e) {
-	return new ol({
+function cl(e) {
+	return new sl({
 		type: "nullable",
 		innerType: e
 	});
 }
-var cl = /*@__PURE__*/ x("ZodDefault", (e, t) => {
+var ll = /*@__PURE__*/ x("ZodDefault", (e, t) => {
 	$i.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Rs(e, t, n, r), e.unwrap = () => e._zod.def.innerType, e.removeDefault = e.unwrap;
 });
-function ll(e, t) {
-	return new cl({
+function ul(e, t) {
+	return new ll({
 		type: "default",
 		innerType: e,
 		get defaultValue() {
@@ -5176,11 +5176,11 @@ function ll(e, t) {
 		}
 	});
 }
-var ul = /*@__PURE__*/ x("ZodPrefault", (e, t) => {
+var dl = /*@__PURE__*/ x("ZodPrefault", (e, t) => {
 	ta.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => zs(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function dl(e, t) {
-	return new ul({
+function fl(e, t) {
+	return new dl({
 		type: "prefault",
 		innerType: e,
 		get defaultValue() {
@@ -5188,65 +5188,65 @@ function dl(e, t) {
 		}
 	});
 }
-var fl = /*@__PURE__*/ x("ZodNonOptional", (e, t) => {
+var pl = /*@__PURE__*/ x("ZodNonOptional", (e, t) => {
 	na.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Fs(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function pl(e, t) {
-	return new fl({
+function ml(e, t) {
+	return new pl({
 		type: "nonoptional",
 		innerType: e,
 		...y(t)
 	});
 }
-var ml = /*@__PURE__*/ x("ZodCatch", (e, t) => {
+var hl = /*@__PURE__*/ x("ZodCatch", (e, t) => {
 	aa.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Bs(e, t, n, r), e.unwrap = () => e._zod.def.innerType, e.removeCatch = e.unwrap;
 });
-function hl(e, t) {
-	return new ml({
+function gl(e, t) {
+	return new hl({
 		type: "catch",
 		innerType: e,
 		catchValue: typeof t == "function" ? t : en(t)
 	});
 }
-var gl = /*@__PURE__*/ x("ZodPipe", (e, t) => {
+var _l = /*@__PURE__*/ x("ZodPipe", (e, t) => {
 	oa.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Vs(e, t, n, r), e.in = t.in, e.out = t.out;
 });
-function _l(e, t) {
-	return new gl({
+function vl(e, t) {
+	return new _l({
 		type: "pipe",
 		in: e,
 		out: t
 	});
 }
-var vl = /*@__PURE__*/ x("ZodReadonly", (e, t) => {
+var yl = /*@__PURE__*/ x("ZodReadonly", (e, t) => {
 	ca.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Hs(e, t, n, r), e.unwrap = () => e._zod.def.innerType;
 });
-function yl(e) {
-	return new vl({
+function bl(e) {
+	return new yl({
 		type: "readonly",
 		innerType: e
 	});
 }
-var bl = /*@__PURE__*/ x("ZodLazy", (e, t) => {
+var xl = /*@__PURE__*/ x("ZodLazy", (e, t) => {
 	ua.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Ws(e, t, n, r), e.unwrap = () => e._zod.def.getter();
 });
-function xl(e) {
-	return new bl({
+function Sl(e) {
+	return new xl({
 		type: "lazy",
 		getter: e
 	});
 }
-var Sl = /*@__PURE__*/ x("ZodCustom", (e, t) => {
+var Cl = /*@__PURE__*/ x("ZodCustom", (e, t) => {
 	da.init(e, t), O.init(e, t), e._zod.processJSONSchema = (t, n, r) => Cs(e, t, n, r);
 });
-function Cl(e, t = {}) {
-	return /* @__PURE__ */ Ro(Sl, e, t);
+function wl(e, t = {}) {
+	return /* @__PURE__ */ Ro(Cl, e, t);
 }
-function wl(e, t) {
+function Tl(e, t) {
 	return /* @__PURE__ */ zo(e, t);
 }
-function Tl(e) {
-	let t = xl(() => M([
+function El(e) {
+	let t = Sl(() => M([
 		lc(e),
 		Pc(),
 		Rc(),
@@ -5258,13 +5258,13 @@ function Tl(e) {
 }
 //#endregion
 //#region src/flow/common/triggerScheduleSchema.ts
-var El = A(M([j({
-	type: F("cron"),
+var Dl = A(M([j({
+	type: P("cron"),
 	expression: lc(),
 	timezone: lc()
 }), j({
-	type: F("every"),
-	unit: P([
+	type: P("every"),
+	unit: $c([
 		"day",
 		"hour",
 		"minute",
@@ -5272,122 +5272,137 @@ var El = A(M([j({
 		"week"
 	]),
 	value: Pc()
-})])), Dl = [
+})])), Ol = [
 	"GET",
 	"POST",
 	"PUT",
 	"PATCH",
 	"DELETE"
-], I = lc(), Ol = Tl(), kl = A(I), Al = j({
-	description: I.optional(),
-	jsonSchema: Ol,
+], F = lc(), kl = El(), Al = A(F), jl = j({
+	description: F.optional(),
+	jsonSchema: kl,
 	nullable: Rc(),
-	handle: I
-}), L = Al.extend({ value: Ol.optional() }), jl = j({
+	handle: F
+}), I = jl.extend({ value: kl.optional() }), Ml = j({
 	collapsed: Rc().optional(),
-	group: I
-}), Ml = j({
-	kind: F("node"),
-	nodeId: I,
-	output: I,
-	field: I.optional()
+	group: F
 }), Nl = j({
-	kind: F("flow"),
-	input: I
-}), Pl = M([
-	Ml,
+	kind: P("node"),
+	nodeId: F,
+	output: F,
+	field: F.optional()
+}), Pl = j({
+	kind: P("flow"),
+	input: F
+}), Fl = M([
 	Nl,
+	Pl,
 	j({
-		kind: F("binding"),
-		bindingId: I
+		kind: P("binding"),
+		bindingId: F
 	})
-]), Fl = M([j({ kind: F("unset") }), j({
-	kind: F("value"),
-	value: Ol
-})]), Il = M([Fl, j({
-	kind: F("sources"),
-	sources: A(Pl)
-})]), Ll = N(I, Il), Rl = {
-	inputs: A(M([L, jl])),
-	outputs: A(M([Al, jl]))
-}, zl = M([qc({
-	kind: F("connector"),
-	action: I,
-	connectionId: I.optional(),
-	connections: A(qc({
-		connectionId: I,
-		alias: I.optional()
-	}))
-}), qc({
-	kind: F("connector"),
-	actionHints: A(I).optional(),
-	connectionHints: A(qc({
-		action: I,
-		connectionId: I,
-		alias: I.optional()
-	})).optional()
-})]), Bl = j({
-	...Rl,
-	name: I,
-	moduleId: I,
-	capabilities: A(zl).optional()
-}), Vl = M([j({
-	kind: F("value"),
-	value: Ol
+]), Il = M([j({ kind: P("unset") }), j({
+	kind: P("value"),
+	value: kl
+})]), Ll = M([Il, j({
+	kind: P("sources"),
+	sources: A(Fl)
+})]), Rl = N(F, Ll), zl = {
+	inputs: A(M([I, Ml])),
+	outputs: A(M([jl, Ml]))
+}, Bl = M([
+	qc({
+		kind: P("connector"),
+		action: F,
+		connectionId: F.optional(),
+		connections: A(qc({
+			connectionId: F,
+			alias: F.optional()
+		}))
+	}),
+	qc({
+		kind: P("connector"),
+		mode: P("shared")
+	}),
+	qc({
+		kind: P("connector"),
+		mode: P("independent"),
+		actions: A(qc({
+			action: F,
+			connectionId: F.optional()
+		}))
+	}),
+	qc({
+		kind: P("connector"),
+		actionHints: A(F).optional(),
+		connectionHints: A(qc({
+			action: F,
+			connectionId: F,
+			alias: F.optional()
+		})).optional()
+	})
+]), Vl = j({
+	...zl,
+	name: F,
+	moduleId: F,
+	capabilities: A(Bl).optional()
+}), Hl = M([j({
+	kind: P("value"),
+	value: kl
 }), j({
-	kind: F("input"),
-	input: I
-})]), Hl = M([Vl, j({ kind: F("model") })]), Ul = j({
-	...Rl,
-	name: I,
+	kind: P("input"),
+	input: F
+})]), Ul = M([Hl, j({ kind: P("model") })]), Wl = j({
+	...zl,
+	name: F,
 	executor: M([
 		j({
-			kind: F("connector"),
-			action: I,
-			connectionId: I.optional()
+			kind: P("connector"),
+			action: F,
+			connectionId: F.optional()
 		}),
 		j({
-			kind: F("llm"),
-			mode: P(["chat", "json"])
+			kind: P("llm"),
+			mode: $c(["chat", "json"])
 		}),
 		j({
-			kind: F("agent"),
+			kind: P("agent"),
 			code: Rc().optional(),
-			model: I,
-			prompt: Vl,
-			system: I,
+			model: F,
+			prompt: Hl,
+			system: F,
 			maxRounds: Pc(),
 			tools: A(j({
-				id: I,
-				name: I,
-				description: I,
-				action: I,
-				connectionId: I.optional(),
+				id: F,
+				name: F,
+				description: F,
+				action: F,
+				connectionId: F.optional(),
 				approval: Rc(),
-				inputs: A(L.extend({ source: Hl }))
+				inputs: A(I.extend({ source: Ul }))
 			})),
 			notification: j({
-				taskId: I,
-				messageHandle: I,
-				inputs: N(I, Vl)
+				taskId: F,
+				messageHandle: F,
+				inputs: N(F, Hl)
 			}).optional()
 		})
 	])
-}), Wl = M([j({
-	kind: F("value"),
-	value: Ol.optional(),
-	jsonSchema: Ol.optional()
+}), Gl = M([j({
+	kind: P("value"),
+	value: kl.optional(),
+	jsonSchema: kl.optional()
 }), j({
-	kind: F("source"),
-	source: Pl
-})]), Gl = {
-	matchMode: P(["first", "all"]),
+	kind: P("source"),
+	source: Fl
+})]), Kl = {
+	matchMode: $c(["first", "all"]),
 	cases: A(j({
-		description: I.optional(),
-		output: I,
+		description: F.optional(),
+		output: F,
 		groups: A(j({ expressions: A(j({
-			left: Wl,
-			operator: P([
+			left: Gl,
+			operator: $c([
 				"!=",
 				"<",
 				"<=",
@@ -5409,44 +5424,44 @@ var El = A(M([j({
 				"notHasValue",
 				"startsWith"
 			]),
-			right: Wl.optional()
+			right: Gl.optional()
 		})) }))
 	}))
-}, Kl = {
-	inputDefinitions: A(L),
-	prompt: I
-}, ql = j({
+}, ql = {
+	inputDefinitions: A(I),
+	prompt: F
+}, Jl = j({
 	allowedMethods: Wc().optional(),
-	allowedOrigins: kl.optional(),
+	allowedOrigins: Al.optional(),
 	noResponseBody: Wc().optional(),
-	responseData: I.optional(),
-	responseHeaders: N(I, I).optional(),
+	responseData: F.optional(),
+	responseHeaders: N(F, F).optional(),
 	responseStatusCode: Pc().int().min(200).max(599).optional()
-}), Jl = {
-	bodyFields: A(L),
-	method: P(Dl),
-	options: ql.optional()
-}, Yl = {
-	configInputs: Rl.inputs,
-	definitionVersion: F(2),
-	description: I,
-	displayName: I,
-	key: I,
-	name: I,
-	outputs: A(Al).refine((e) => new Set(e.map((e) => e.handle)).size === e.length, "Duplicate Trigger output handle."),
-	provider: I
-}, Xl = j({
+}), Yl = {
+	bodyFields: A(I),
+	method: $c(Ol),
+	options: Jl.optional()
+}, Xl = {
+	configInputs: zl.inputs,
+	definitionVersion: P(2),
+	description: F,
+	displayName: F,
+	key: F,
+	name: F,
+	outputs: A(jl).refine((e) => new Set(e.map((e) => e.handle)).size === e.length, "Duplicate Trigger output handle."),
+	provider: F
+}, Zl = j({
 	body: j({
 		allowArray: Rc(),
 		allowEmpty: Rc(),
-		formats: A(P([
+		formats: A($c([
 			"form",
 			"json",
 			"multipart",
 			"text"
 		]))
 	}),
-	methods: A(P([
+	methods: A($c([
 		"DELETE",
 		"GET",
 		"HEAD",
@@ -5455,317 +5470,324 @@ var El = A(M([j({
 		"PUT"
 	])),
 	successStatus: Pc()
-}), Zl = {
-	name: I,
-	description: I.optional(),
-	icon: I.optional()
-}, Ql = {
+}), Ql = {
+	name: F,
+	description: F.optional(),
+	icon: F.optional()
+}, $l = {
 	maxExecutions: Pc().int().positive().max(2 ** 53 - 1).optional(),
-	inputs: Ll,
-	name: I.optional(),
-	description: I.optional(),
-	icon: I.optional(),
+	inputs: Rl,
+	name: F.optional(),
+	description: F.optional(),
+	icon: F.optional(),
 	timeoutMs: Pc().optional()
-}, $l = M([
+}, eu = M([
 	j({
-		...Ql,
-		inputs: N(I, Wc()),
-		kind: F("condition"),
-		...Gl
+		...$l,
+		inputs: N(F, Wc()),
+		kind: P("condition"),
+		...Kl
 	}),
 	j({
-		...Ql,
+		...$l,
 		inputs: Hc().transform(() => ({})).default({}),
-		kind: F("value"),
-		values: A(L)
+		kind: P("value"),
+		values: A(I)
 	}),
 	j({
-		...Ql,
-		kind: F("subflow"),
-		subflowId: I
+		...$l,
+		kind: P("subflow"),
+		subflowId: F
 	}),
 	j({
-		...Ql,
-		kind: F("task"),
-		task: Bl,
-		additionalInputs: A(L).optional()
+		...$l,
+		kind: P("task"),
+		task: Vl,
+		additionalInputs: A(I).optional()
 	}),
 	j({
-		...Ql,
-		kind: F("task"),
-		taskId: I,
-		additionalInputs: A(L).optional()
+		...$l,
+		kind: P("task"),
+		taskId: F,
+		additionalInputs: A(I).optional()
 	}),
 	qc({
-		...Ql,
-		kind: F("approval"),
-		...Kl
+		...$l,
+		kind: P("approval"),
+		...ql
 	}).omit({ timeoutMs: !0 }),
 	qc({
-		...Ql,
-		kind: F("wait"),
-		...Kl
+		...$l,
+		kind: P("wait"),
+		...ql
 	}).omit({ timeoutMs: !0 }),
 	j({
-		...Zl,
-		kind: F("manual")
+		...Ql,
+		kind: P("manual")
 	}),
 	j({
-		...Zl,
-		kind: F("webhook"),
-		...Jl
+		...Ql,
+		kind: P("webhook"),
+		...Yl
 	}),
 	j({
-		...Zl,
-		kind: F("cron"),
-		cronTimes: El
+		...Ql,
+		kind: P("cron"),
+		cronTimes: Dl
 	}),
 	j({
-		...Zl,
-		kind: F("poll"),
-		bindingId: I,
-		config: N(I, Fl),
+		...Ql,
+		kind: P("poll"),
+		connectionId: F.min(1).optional(),
+		config: N(F, Il),
 		definition: j({
-			...Yl,
-			type: F("poll")
+			...Xl,
+			type: P("poll")
 		}),
-		pollTimes: El
+		pollTimes: Dl
 	}),
 	j({
-		...Zl,
-		kind: F("integration"),
-		bindingId: I,
-		config: N(I, Fl),
+		...Ql,
+		kind: P("integration"),
+		connectionId: F.min(1).optional(),
+		config: N(F, Il),
 		definition: j({
-			...Yl,
-			type: F("integration"),
-			endpoint: Xl
+			...Xl,
+			type: P("integration"),
+			endpoint: Zl
 		})
 	})
-]), eu = M([j({ kind: F("flow") }), j({
-	kind: F("subflow"),
-	id: I
-})]), tu = j({
-	source: I,
-	target: I,
-	sourceHandle: I.optional()
-}), R = {
-	nodeId: I,
-	target: eu
-}, nu = j({
-	name: I,
-	inputs: A(L),
-	outputs: A(Al.extend({ sources: A(M([Ml, Nl])) }))
-}), ru = j({
-	nodes: N(I, $l),
-	edges: A(tu).default([])
+]), tu = M([j({ kind: P("flow") }), j({
+	kind: P("subflow"),
+	id: F
+})]), nu = j({
+	source: F,
+	target: F,
+	sourceHandle: F.optional()
+}), L = {
+	nodeId: F,
+	target: tu
+}, ru = j({
+	name: F,
+	inputs: A(I),
+	outputs: A(jl.extend({ sources: A(M([Nl, Pl])) }))
 }), iu = j({
-	kind: P(["connection", "variable"]),
-	target: I
+	nodes: N(F, eu),
+	edges: A(nu).default([])
 }), au = j({
-	name: I,
-	imports: kl,
-	source: I
+	kind: P("variable"),
+	target: F
 }), ou = j({
-	bindings: N(I, iu),
-	graph: ru,
-	subflows: N(I, nu.extend({ graph: ru })),
-	tasks: N(I, Ul)
+	name: F,
+	imports: Al,
+	source: F
+}), su = j({
+	bindings: N(F, au),
+	graph: iu,
+	subflows: N(F, ru.extend({ graph: iu })),
+	tasks: N(F, Wl)
 });
 j({
-	modelVersion: M([F(2), F(3)]),
-	document: ou,
-	modules: N(I, au)
+	modelVersion: M([P(2), P(4)]),
+	document: su,
+	modules: N(F, ou)
 }).extend({
-	kind: F("open-flow-flow-revision"),
-	version: F(1)
+	kind: P("open-flow-flow-revision"),
+	version: P(1)
 });
-var su = {
+var cu = {
 	"binding.create": {
-		bindingId: I,
-		binding: iu
+		bindingId: F,
+		binding: au
 	},
-	"binding.delete": { bindingId: I },
+	"binding.delete": { bindingId: F },
 	"binding.target.set": {
-		bindingId: I,
-		before: I,
-		value: I
+		bindingId: F,
+		before: F,
+		value: F
 	},
 	"graph.edge.connect": {
-		target: eu,
-		edge: tu
+		target: tu,
+		edge: nu
 	},
 	"graph.edge.disconnect": {
-		target: eu,
-		edge: tu
+		target: tu,
+		edge: nu
 	},
 	"graph.node.create": {
-		...R,
-		node: $l
+		...L,
+		node: eu
 	},
-	"graph.node.delete": R,
+	"graph.node.delete": L,
 	"graph.node.field.set": M([
 		j({
-			...R,
-			kind: F("graph.node.field.set"),
-			field: P([
+			...L,
+			kind: P("graph.node.field.set"),
+			field: P("connectionId"),
+			before: F.min(1).optional(),
+			value: F.min(1).optional()
+		}),
+		j({
+			...L,
+			kind: P("graph.node.field.set"),
+			field: $c([
 				"description",
 				"icon",
 				"name"
 			]),
-			before: I.optional(),
-			value: I.optional()
+			before: F.optional(),
+			value: F.optional()
 		}),
 		j({
-			...R,
-			kind: F("graph.node.field.set"),
-			field: F("maxExecutions"),
+			...L,
+			kind: P("graph.node.field.set"),
+			field: P("maxExecutions"),
 			before: Pc().int().positive().max(2 ** 53 - 1).optional(),
 			value: Pc().int().positive().max(2 ** 53 - 1).optional()
 		}),
 		j({
-			...R,
-			kind: F("graph.node.field.set"),
-			field: F("timeoutMs"),
+			...L,
+			kind: P("graph.node.field.set"),
+			field: P("timeoutMs"),
 			before: Pc().optional(),
 			value: Pc().optional()
 		})
 	]),
 	"graph.node.input.set": {
-		...R,
-		handle: I,
-		before: Il.optional(),
-		value: Il.optional()
+		...L,
+		handle: F,
+		before: Ll.optional(),
+		value: Ll.optional()
 	},
 	"graph.node.additional-inputs.set": {
-		...R,
-		before: A(L).optional(),
-		value: A(L).optional()
+		...L,
+		before: A(I).optional(),
+		value: A(I).optional()
 	},
 	"graph.node.condition.set": {
-		...R,
-		before: j(Gl),
-		value: j(Gl)
+		...L,
+		before: j(Kl),
+		value: j(Kl)
 	},
 	"graph.node.values.set": {
-		...R,
-		before: A(L),
-		value: A(L)
+		...L,
+		before: A(I),
+		value: A(I)
 	},
 	"graph.node.resolution.set": {
-		...R,
-		target: j({ kind: F("flow") }),
-		before: j(Kl),
-		value: j(Kl)
+		...L,
+		target: j({ kind: P("flow") }),
+		before: j(ql),
+		value: j(ql)
 	},
 	"graph.node.webhook.set": {
-		...R,
-		target: j({ kind: F("flow") }),
-		before: j(Jl),
-		value: j(Jl)
+		...L,
+		target: j({ kind: P("flow") }),
+		before: j(Yl),
+		value: j(Yl)
 	},
 	"graph.node.task.ports.set": {
-		...R,
-		before: j(Rl),
-		value: j(Rl)
+		...L,
+		before: j(zl),
+		value: j(zl)
 	},
 	"graph.node.task.name.set": {
-		...R,
-		before: I,
-		value: I
+		...L,
+		before: F,
+		value: F
 	},
 	"graph.node.task.capabilities.set": {
-		...R,
-		before: A(zl).optional(),
-		value: A(zl).optional()
+		...L,
+		before: A(Bl).optional(),
+		value: A(Bl).optional()
 	},
 	"graph.trigger.config.set": {
-		nodeId: I,
-		name: I,
-		before: Fl.optional(),
-		value: Fl.optional()
+		nodeId: F,
+		name: F,
+		before: Il.optional(),
+		value: Il.optional()
 	},
 	"graph.trigger.schedule.set": {
-		nodeId: I,
-		before: El,
-		value: El
+		nodeId: F,
+		before: Dl,
+		value: Dl
 	},
 	"module.create": {
-		moduleId: I,
-		module: au
+		moduleId: F,
+		module: ou
 	},
-	"module.delete": { moduleId: I },
+	"module.delete": { moduleId: F },
 	"module.rename": {
-		moduleId: I,
-		before: I,
-		name: I
+		moduleId: F,
+		before: F,
+		name: F
 	},
 	"module.source.replace": {
-		moduleId: I,
-		beforeImports: kl,
-		beforeSource: I,
-		imports: kl,
-		source: I
+		moduleId: F,
+		beforeImports: Al,
+		beforeSource: F,
+		imports: Al,
+		source: F
 	},
 	"subflow.create": {
-		subflowId: I,
-		subflow: nu.extend({ graph: ru })
+		subflowId: F,
+		subflow: ru.extend({ graph: iu })
 	},
 	"subflow.definition.set": {
-		subflowId: I,
-		before: nu,
-		definition: nu
+		subflowId: F,
+		before: ru,
+		definition: ru
 	},
-	"subflow.delete": { subflowId: I },
+	"subflow.delete": { subflowId: F },
 	"task.create": {
-		taskId: I,
-		task: Ul
+		taskId: F,
+		task: Wl
 	},
-	"task.delete": { taskId: I },
+	"task.delete": { taskId: F },
 	"task.connector.connection.set": {
-		taskId: I,
-		before: I.optional(),
-		value: I.optional()
+		taskId: F,
+		before: F.optional(),
+		value: F.optional()
 	},
 	"task.agent.set": {
-		taskId: I,
-		before: Ul,
-		value: Ul
+		taskId: F,
+		before: Wl,
+		value: Wl
 	},
 	"task.llm.mode.set": {
-		taskId: I,
-		before: P(["chat", "json"]),
-		value: P(["chat", "json"])
+		taskId: F,
+		before: $c(["chat", "json"]),
+		value: $c(["chat", "json"])
 	},
 	"task.name.set": {
-		taskId: I,
-		before: I,
-		value: I
+		taskId: F,
+		before: F,
+		value: F
 	}
 };
-A(M([...new Map(Object.entries(su).map(([e, t]) => [e, t instanceof O ? t : j({
-	kind: F(e),
+A(M([...new Map(Object.entries(cu).map(([e, t]) => [e, t instanceof O ? t : j({
+	kind: P(e),
 	...t
 })])).values()])).min(1);
 //#endregion
 //#region src/flow/common/encoding.ts
-var cu = new TextEncoder();
-function lu(e) {
+var lu = new TextEncoder();
+function uu(e) {
 	if (e == null || typeof e == "boolean" || typeof e == "string" || typeof e == "number") return JSON.stringify(e);
-	if (Array.isArray(e)) return `[${e.map(lu).join(",")}]`;
+	if (Array.isArray(e)) return `[${e.map(uu).join(",")}]`;
 	let t = e;
-	return `{${Object.keys(t).toSorted().map((e) => `${JSON.stringify(e)}:${lu(t[e])}`).join(",")}}`;
+	return `{${Object.keys(t).toSorted().map((e) => `${JSON.stringify(e)}:${uu(t[e])}`).join(",")}}`;
 }
-function uu(e) {
-	return cu.encode(lu(e));
+function du(e) {
+	return lu.encode(uu(e));
 }
-async function du(e) {
+async function fu(e) {
 	let t = new Uint8Array(e.byteLength);
 	return t.set(e), `sha256:${[...new Uint8Array(await crypto.subtle.digest("SHA-256", t))].map((e) => e.toString(16).padStart(2, "0")).join("")}`;
 }
 //#endregion
 //#region src/trigger/providers/github/watch-pull-request.ts
-var fu = {
+var pu = {
 	configInputs: [
 		{
 			handle: "owner",
@@ -5841,7 +5863,7 @@ var fu = {
 		nullable: !1
 	}]
 };
-function pu(e) {
+function mu(e) {
 	return {
 		owner: e.owner,
 		repo: e.repo,
@@ -5849,8 +5871,8 @@ function pu(e) {
 		insecureSsl: !1
 	};
 }
-var mu = {
-	snapshot: fu,
+var hu = {
+	snapshot: pu,
 	initialState: {
 		checkpoint: null,
 		subscription: {}
@@ -5858,7 +5880,7 @@ var mu = {
 	async reconcile(e) {
 		if (e.state == null) throw new t("GitHub listener state is missing.");
 		if (e.active && e.state.checkpoint == null) {
-			let t = await hu(e);
+			let t = await gu(e);
 			await e.state.saveCheckpoint({
 				version: t.version,
 				sequence: 0
@@ -5866,13 +5888,13 @@ var mu = {
 		}
 		return await Ne.reconcile({
 			...e,
-			config: pu(e.config)
+			config: mu(e.config)
 		});
 	},
 	async receive(e) {
 		let t = await Ne.receive({
 			...e,
-			config: pu(e.config)
+			config: mu(e.config)
 		});
 		return t.outcome == "event" ? !c(e.payload) || e.payload.number !== e.config.number ? {
 			outcome: "ignored",
@@ -5884,7 +5906,7 @@ var mu = {
 		async read(e) {
 			let n = e.checkpoint;
 			if (!c(n) || typeof n.version != "string" || !Number.isSafeInteger(n.sequence) || Number(n.sequence) < 0 || Number(n.sequence) >= 2 ** 53 - 1) throw new t("GitHub listener checkpoint is invalid.");
-			let r = await hu(e);
+			let r = await gu(e);
 			if (r.version == n.version) return {
 				checkpoint: n,
 				dedupeKey: r.version,
@@ -5904,7 +5926,7 @@ var mu = {
 		}
 	}
 };
-async function hu(r) {
+async function gu(r) {
 	let { owner: i, repo: a, number: o } = r.config;
 	if (typeof i != "string" || typeof a != "string" || !Number.isSafeInteger(o) || Number(o) < 1) throw new t("GitHub pull request configuration is invalid.");
 	let s = await r.connector.execute({
@@ -5932,12 +5954,12 @@ async function hu(r) {
 	};
 	return {
 		pullRequest: u,
-		version: await du(uu(u))
+		version: await fu(du(u))
 	};
 }
 //#endregion
 //#region src/trigger/providers/gitlab/on-project-event.ts
-var gu = [
+var _u = [
 	"push",
 	"tag_push",
 	"issues",
@@ -5955,7 +5977,7 @@ var gu = [
 	"emoji",
 	"resource_access_token",
 	"resource_deploy_token"
-], _u = /* @__PURE__ */ new Map([
+], vu = /* @__PURE__ */ new Map([
 	["Push Hook", "push"],
 	["Tag Push Hook", "tag_push"],
 	["Issue Hook", "issues"],
@@ -5973,7 +5995,7 @@ var gu = [
 	["Emoji Hook", "emoji"],
 	["Resource Access Token Hook", "resource_access_token"],
 	["Resource Deploy Token Hook", "resource_deploy_token"]
-]), vu = {
+]), yu = {
 	initialState: {
 		checkpoint: null,
 		subscription: {}
@@ -5984,7 +6006,7 @@ var gu = [
 				handle: "events",
 				jsonSchema: {
 					items: {
-						enum: gu,
+						enum: _u,
 						type: "string"
 					},
 					minItems: 1,
@@ -6070,12 +6092,12 @@ var gu = [
 			outcome: "ignored",
 			reason: "GitLab event header is missing."
 		};
-		let n = _u.get(t);
+		let n = vu.get(t);
 		if (n == null) return {
 			outcome: "ignored",
 			reason: "GitLab event header is unknown."
 		};
-		if (!yu(e.config).events.includes(n)) return {
+		if (!bu(e.config).events.includes(n)) return {
 			outcome: "ignored",
 			reason: "GitLab event is not subscribed."
 		};
@@ -6092,36 +6114,36 @@ var gu = [
 		};
 	},
 	async reconcile(e) {
-		let n = Du(e.state), r = yu(e.config), i = Ou(n);
+		let n = Ou(e.state), r = bu(e.config), i = ku(n);
 		if (!e.active) {
-			let t = i == null ? await Su(e, r) : [i];
-			for (let n of t ?? []) await Cu(e, r, n);
-			return await n.saveSubscription({}, ku(e.now)), { outcome: "ready" };
+			let t = i == null ? await Cu(e, r) : [i];
+			for (let n of t ?? []) await wu(e, r, n);
+			return await n.saveSubscription({}, Au(e.now)), { outcome: "ready" };
 		}
-		let a = await Su(e, r);
+		let a = await Cu(e, r);
 		if (a == null) throw new t("The GitLab project does not exist or is not visible.");
 		let o = i ?? a[0];
 		if (o == null) {
-			let t = await wu(e, "hook create", {
-				body: xu(e.endpointUrl, e.callbackSecret, r),
-				endpoint: bu(r),
+			let t = await Tu(e, "hook create", {
+				body: Su(e.endpointUrl, e.callbackSecret, r),
+				endpoint: xu(r),
 				method: "POST"
 			});
-			Tu(t, "hook create"), o = Eu(t.data);
+			Eu(t, "hook create"), o = Du(t.data);
 		} else {
-			let t = await wu(e, "hook update", {
-				body: xu(e.endpointUrl, e.callbackSecret, r),
-				endpoint: `${bu(r)}/${o}`,
+			let t = await Tu(e, "hook update", {
+				body: Su(e.endpointUrl, e.callbackSecret, r),
+				endpoint: `${xu(r)}/${o}`,
 				method: "PUT"
 			});
 			if (t.status == 404) return await n.saveSubscription({}, e.now), { outcome: "pending" };
-			Tu(t, "hook update");
+			Eu(t, "hook update");
 		}
-		for (let t of a.filter((e) => e != o)) await Cu(e, r, t);
-		return await n.saveSubscription({ hookId: o }, ku(e.now)), { outcome: "ready" };
+		for (let t of a.filter((e) => e != o)) await wu(e, r, t);
+		return await n.saveSubscription({ hookId: o }, Au(e.now)), { outcome: "ready" };
 	}
 };
-function yu(e) {
+function bu(e) {
 	return {
 		events: e.events,
 		insecureSsl: e.insecureSsl,
@@ -6129,10 +6151,10 @@ function yu(e) {
 		pushBranchFilter: e.pushBranchFilter
 	};
 }
-function bu(e) {
+function xu(e) {
 	return `/projects/${encodeURIComponent(e.project)}/hooks`;
 }
-function xu(e, t, n) {
+function Su(e, t, n) {
 	return {
 		branch_filter_strategy: "wildcard",
 		description: "Managed by Open Flow.",
@@ -6141,14 +6163,14 @@ function xu(e, t, n) {
 		push_events_branch_filter: n.pushBranchFilter,
 		url: e,
 		token: t,
-		...Object.fromEntries(gu.map((e) => [`${e}_events`, n.events.includes(e)]))
+		...Object.fromEntries(_u.map((e) => [`${e}_events`, n.events.includes(e)]))
 	};
 }
-async function Su(e, t) {
+async function Cu(e, t) {
 	let n = [];
 	for (let r = 1; r <= 10; r += 1) {
-		let i = await wu(e, "hook list", {
-			endpoint: bu(t),
+		let i = await Tu(e, "hook list", {
+			endpoint: xu(t),
 			method: "GET",
 			query: {
 				page: r,
@@ -6156,59 +6178,59 @@ async function Su(e, t) {
 			}
 		});
 		if (i.status == 404) return null;
-		Tu(i, "hook list");
+		Eu(i, "hook list");
 		let a = Array.isArray(i.data) ? i.data : [];
 		for (let t of a) {
-			let r = Au(t);
+			let r = ju(t);
 			r?.url === e.endpointUrl && (typeof r.id == "number" || typeof r.id == "string") && n.push(String(r.id));
 		}
 		if (a.length < 100) break;
 	}
 	return n;
 }
-async function Cu(e, t, n) {
-	let r = await wu(e, "hook delete", {
-		endpoint: `${bu(t)}/${n}`,
+async function wu(e, t, n) {
+	let r = await Tu(e, "hook delete", {
+		endpoint: `${xu(t)}/${n}`,
 		method: "DELETE"
 	});
-	r.status != 404 && Tu(r, "hook delete");
+	r.status != 404 && Eu(r, "hook delete");
 }
-async function wu(t, r, i) {
+async function Tu(t, r, i) {
 	try {
 		return await t.connector.execute(i, t.signal);
 	} catch (t) {
 		throw t instanceof e ? t : new n(`GitLab ${r} request failed.`, { cause: t });
 	}
 }
-function Tu(r, i) {
+function Eu(r, i) {
 	if (!(r.status >= 200 && r.status < 300)) throw r.status == 401 || r.status == 403 ? new e(`GitLab ${i} rejected the Connection.`) : [
 		400,
 		404,
 		422
 	].includes(r.status) ? new t(`GitLab ${i} rejected the subscription.`) : new n(`GitLab ${i} failed with status ${r.status}.`);
 }
-function Eu(e) {
-	let t = Au(e)?.id;
+function Du(e) {
+	let t = ju(e)?.id;
 	if (typeof t != "number" && typeof t != "string") throw new n("GitLab hook response is missing its ID.");
 	return String(t);
 }
-function Du(e) {
+function Ou(e) {
 	if (e == null) throw new t("GitLab Integration state is missing.");
 	return e;
 }
-function Ou(e) {
+function ku(e) {
 	let t = e.subscription.hookId;
 	return typeof t == "string" && t.length > 0 ? t : null;
 }
-function ku(e) {
+function Au(e) {
 	return new Date(e.getTime() + 2592e6);
 }
-function Au(e) {
+function ju(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
 //#endregion
 //#region src/trigger/providers/gmail/on-message-received.ts
-var ju = 25, Mu = 5, Nu = {
+var Mu = 25, Nu = 5, Pu = {
 	buildOutputs: o,
 	snapshot: {
 		configInputs: [
@@ -6247,7 +6269,7 @@ var ju = 25, Mu = 5, Nu = {
 					type: "integer"
 				},
 				nullable: !1,
-				value: ju
+				value: Mu
 			},
 			{
 				handle: "readStatus",
@@ -6320,20 +6342,20 @@ var ju = 25, Mu = 5, Nu = {
 		type: "poll"
 	},
 	async poll(e) {
-		let t = Pu(e.config);
+		let t = Fu(e.config);
 		if (e.checkpoint === null) return {
-			checkpoint: { historyId: await Fu(e) },
+			checkpoint: { historyId: await Iu(e) },
 			events: []
 		};
-		let n = Iu(e.checkpoint), r = await Lu(e, t.labelNamesOrIds), { candidates: i, lastPage: a } = await Ru(e, n, r, t.maxMessagesPerPoll), o = zu(n.historyId, a), s = [], c = 0;
+		let n = Lu(e.checkpoint), r = await Ru(e, t.labelNamesOrIds), { candidates: i, lastPage: a } = await zu(e, n, r, t.maxMessagesPerPoll), o = Bu(n.historyId, a), s = [], c = 0;
 		for (let n of i) {
-			let i = await Bu(e, n.id);
+			let i = await Vu(e, n.id);
 			if (i != null) {
-				if (!await Vu(e, i, t, r)) {
+				if (!await Hu(e, i, t, r)) {
 					c += 1;
 					continue;
 				}
-				s.push(Wu(i));
+				s.push(Gu(i));
 			}
 		}
 		return {
@@ -6344,7 +6366,7 @@ var ju = 25, Mu = 5, Nu = {
 		};
 	}
 };
-function Pu(e) {
+function Fu(e) {
 	return {
 		includeDrafts: e.includeDrafts,
 		includeSpamAndTrash: e.includeSpamAndTrash,
@@ -6355,28 +6377,28 @@ function Pu(e) {
 		sender: e.sender.trim()
 	};
 }
-async function Fu(e) {
-	let t = await Gu(e, "/users/me/profile");
-	Ku(t, "profile fetch");
-	let n = Yu(t.data)?.historyId;
+async function Iu(e) {
+	let t = await Ku(e, "/users/me/profile");
+	qu(t, "profile fetch");
+	let n = Xu(t.data)?.historyId;
 	if (typeof n != "string" || n.length == 0) throw new a("Gmail profile historyId is missing.");
 	return n;
 }
-function Iu(e) {
-	let t = Yu(e);
+function Lu(e) {
+	let t = Xu(e);
 	if (typeof t?.historyId != "string" || t.historyId.length == 0) throw new r("Gmail checkpoint historyId is missing; recreate the Trigger.");
 	return {
 		historyId: t.historyId,
 		...typeof t.pageToken == "string" ? { pageToken: t.pageToken } : {}
 	};
 }
-async function Lu(e, t) {
+async function Ru(e, t) {
 	if (t.length == 0) return [];
-	let n = await Gu(e, "/users/me/labels");
-	Ku(n, "labels list");
-	let i = Yu(n.data)?.labels, a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Map();
+	let n = await Ku(e, "/users/me/labels");
+	qu(n, "labels list");
+	let i = Xu(n.data)?.labels, a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Map();
 	if (Array.isArray(i)) for (let e of i) {
-		let t = Yu(e);
+		let t = Xu(e);
 		typeof t?.id == "string" && t.id.length != 0 && (a.add(t.id), typeof t.name == "string" && t.name.length > 0 && o.set(t.name.toLowerCase(), t.id));
 	}
 	return [...new Set(t.map((e) => {
@@ -6385,10 +6407,10 @@ async function Lu(e, t) {
 		return t;
 	}))];
 }
-async function Ru(e, t, n, i) {
+async function zu(e, t, n, i) {
 	let a = /* @__PURE__ */ new Map(), o = t.pageToken, s = {};
-	for (let c = 0; c < Mu; c += 1) {
-		let c = await Gu(e, "/users/me/history", {
+	for (let c = 0; c < Nu; c += 1) {
+		let c = await Ku(e, "/users/me/history", {
 			historyTypes: "messageAdded",
 			labelId: n[0],
 			maxResults: i,
@@ -6396,7 +6418,7 @@ async function Ru(e, t, n, i) {
 			startHistoryId: t.historyId
 		});
 		if (c.status == 404) throw new r("Gmail history checkpoint expired; recreate the Trigger.");
-		Ku(c, "history list"), s = Yu(c.data) ?? {};
+		qu(c, "history list"), s = Xu(c.data) ?? {};
 		for (let e of s.history ?? []) for (let t of e.messagesAdded ?? []) {
 			let e = t.message?.id;
 			e != null && e.length > 0 && !a.has(e) && a.set(e, { id: e });
@@ -6408,7 +6430,7 @@ async function Ru(e, t, n, i) {
 		lastPage: s
 	};
 }
-function zu(e, t) {
+function Bu(e, t) {
 	if (t.nextPageToken) return {
 		checkpoint: {
 			historyId: e,
@@ -6422,32 +6444,32 @@ function zu(e, t) {
 		hasMore: !1
 	};
 }
-async function Bu(e, t) {
-	let n = await Gu(e, `/users/me/messages/${encodeURIComponent(t)}`, { format: "metadata" });
-	return n.status == 404 ? null : (Ku(n, "message metadata fetch"), Yu(n.data) ?? null);
+async function Vu(e, t) {
+	let n = await Ku(e, `/users/me/messages/${encodeURIComponent(t)}`, { format: "metadata" });
+	return n.status == 404 ? null : (qu(n, "message metadata fetch"), Xu(n.data) ?? null);
 }
-async function Vu(e, t, n, r) {
+async function Hu(e, t, n, r) {
 	let i = t.labelIds ?? [];
 	if (!n.includeSpamAndTrash && (i.includes("SPAM") || i.includes("TRASH")) || !n.includeDrafts && i.includes("DRAFT") || n.readStatus == "Unread" && !i.includes("UNREAD") || n.readStatus == "Read" && i.includes("UNREAD") || !r.every((e) => i.includes(e))) return !1;
-	let a = Hu(n);
-	return a.length == 0 || await Uu(e, t, a, n.includeSpamAndTrash);
+	let a = Uu(n);
+	return a.length == 0 || await Wu(e, t, a, n.includeSpamAndTrash);
 }
-function Hu(e) {
+function Uu(e) {
 	let t = e.search.length == 0 ? [] : [e.search], n = e.sender.replaceAll("\"", "").trim();
 	return n.length > 0 && t.push(`from:${/\s/.test(n) ? `"${n}"` : n}`), t.join(" ");
 }
-async function Uu(e, t, n, r) {
-	let i = qu(t.payload?.headers ?? [], "Message-ID").replace(/^</, "").replace(/>$/, "");
+async function Wu(e, t, n, r) {
+	let i = Ju(t.payload?.headers ?? [], "Message-ID").replace(/^</, "").replace(/>$/, "");
 	if (i.length == 0) return !1;
-	let a = await Gu(e, "/users/me/messages", {
+	let a = await Ku(e, "/users/me/messages", {
 		includeSpamTrash: r ? "true" : void 0,
 		q: `${n} rfc822msgid:${i}`
 	});
-	Ku(a, "query match");
-	let o = Yu(a.data)?.messages;
-	return Array.isArray(o) && o.some((e) => Yu(e)?.id === t.id);
+	qu(a, "query match");
+	let o = Xu(a.data)?.messages;
+	return Array.isArray(o) && o.some((e) => Xu(e)?.id === t.id);
 }
-function Wu(e) {
+function Gu(e) {
 	let t = e.payload?.headers ?? [];
 	return {
 		dedupeKey: e.id,
@@ -6455,15 +6477,15 @@ function Wu(e) {
 			historyId: e.historyId ?? null,
 			labelIds: e.labelIds ?? [],
 			messageId: e.id,
-			messageTimestamp: Ju(e.internalDate, qu(t, "Date")),
-			sender: qu(t, "From"),
-			subject: qu(t, "Subject"),
+			messageTimestamp: Yu(e.internalDate, Ju(t, "Date")),
+			sender: Ju(t, "From"),
+			subject: Ju(t, "Subject"),
 			threadId: e.threadId ?? "",
-			to: qu(t, "To")
+			to: Ju(t, "To")
 		}
 	};
 }
-async function Gu(e, t, n = {}) {
+async function Ku(e, t, n = {}) {
 	try {
 		return await e.connector.execute({
 			endpoint: t,
@@ -6474,13 +6496,13 @@ async function Gu(e, t, n = {}) {
 		throw new a(`Gmail proxy request to ${t} failed.`, { cause: e });
 	}
 }
-function Ku(e, t) {
+function qu(e, t) {
 	if (!(e.status >= 200 && e.status < 300)) throw e.status == 401 || e.status == 403 ? new i(`Gmail ${t} rejected the Connection.`) : new a(`Gmail ${t} failed with status ${e.status}.`);
 }
-function qu(e, t) {
+function Ju(e, t) {
 	return e.find((e) => e.name.toLowerCase() == t.toLowerCase())?.value ?? "";
 }
-function Ju(e, t) {
+function Yu(e, t) {
 	let n = e == null ? NaN : Number(e);
 	if (Number.isFinite(n)) {
 		let e = new Date(n);
@@ -6489,21 +6511,21 @@ function Ju(e, t) {
 	let r = Date.parse(t);
 	return Number.isNaN(r) ? "" : new Date(r).toISOString();
 }
-function Yu(e) {
+function Xu(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
 //#endregion
 //#region src/trigger/providers/google-calendar/on-event-changed.ts
-var Xu = [
+var Zu = [
 	"created",
 	"updated",
 	"cancelled"
-], Zu = /* @__PURE__ */ new Set([
+], Qu = /* @__PURE__ */ new Set([
 	"rateLimitExceeded",
 	"userRateLimitExceeded",
 	"quotaExceeded",
 	"usageLimits"
-]), Qu = {
+]), $u = {
 	buildOutputs: o,
 	snapshot: {
 		configInputs: [
@@ -6520,7 +6542,7 @@ var Xu = [
 				handle: "changes",
 				jsonSchema: {
 					items: {
-						enum: Xu,
+						enum: Zu,
 						type: "string"
 					},
 					minItems: 1,
@@ -6528,7 +6550,7 @@ var Xu = [
 					uniqueItems: !0
 				},
 				nullable: !1,
-				value: Xu
+				value: Zu
 			},
 			{
 				handle: "matchTerm",
@@ -6564,7 +6586,7 @@ var Xu = [
 						},
 						calendarId: { type: "string" },
 						changeType: {
-							enum: Xu,
+							enum: Zu,
 							type: "string"
 						},
 						created: { type: ["string", "null"] },
@@ -6613,13 +6635,13 @@ var Xu = [
 		type: "poll"
 	},
 	async poll(e) {
-		let t = $u(e.config);
-		if (e.checkpoint === null) return td(e, t, e.now.toISOString());
-		let n = ed(e.checkpoint);
-		return n.calendarId === t.calendarId ? "seedTimeMin" in n ? td(e, t, n.seedTimeMin, n.pageToken) : nd(e, t, n) : td(e, t, e.now.toISOString());
+		let t = ed(e.config);
+		if (e.checkpoint === null) return nd(e, t, e.now.toISOString());
+		let n = td(e.checkpoint);
+		return n.calendarId === t.calendarId ? "seedTimeMin" in n ? nd(e, t, n.seedTimeMin, n.pageToken) : rd(e, t, n) : nd(e, t, e.now.toISOString());
 	}
 };
-function $u(e) {
+function ed(e) {
 	return {
 		calendarId: e.calendarId,
 		changes: new Set(e.changes),
@@ -6627,8 +6649,8 @@ function $u(e) {
 		maxEventsPerPoll: e.maxEventsPerPoll
 	};
 }
-function ed(e) {
-	let t = pd(e), n = typeof t?.pageToken == "string" ? t.pageToken : void 0, i = typeof t?.calendarId == "string" ? t.calendarId : void 0;
+function td(e) {
+	let t = md(e), n = typeof t?.pageToken == "string" ? t.pageToken : void 0, i = typeof t?.calendarId == "string" ? t.calendarId : void 0;
 	if (typeof t?.syncToken == "string" && t.syncToken.length > 0) return {
 		calendarId: i,
 		...n == null ? {} : { pageToken: n },
@@ -6641,25 +6663,25 @@ function ed(e) {
 	};
 	throw new r("Google Calendar checkpoint is invalid; recreate the Trigger.");
 }
-async function td(e, t, n, r) {
+async function nd(e, t, n, r) {
 	let i = r;
 	for (let r = 0; r < 2; r += 1) {
-		let r = await od(e, t.calendarId, {
+		let r = await sd(e, t.calendarId, {
 			maxResults: 2500,
 			pageToken: i,
 			showDeleted: "true",
 			singleEvents: "false",
 			timeMin: n
 		});
-		if (i != null && cd(r)) return {
+		if (i != null && ld(r)) return {
 			checkpoint: {
 				calendarId: t.calendarId,
 				seedTimeMin: n
 			},
 			events: []
 		};
-		sd(e, r, "seed full sync");
-		let o = pd(r.data) ?? {};
+		cd(e, r, "seed full sync");
+		let o = md(r.data) ?? {};
 		if (o.nextSyncToken) return {
 			checkpoint: {
 				calendarId: t.calendarId,
@@ -6680,17 +6702,17 @@ async function td(e, t, n, r) {
 		hasMore: !0
 	};
 }
-async function nd(e, t, n) {
+async function rd(e, t, n) {
 	let r = [], i = 0, o = n.pageToken;
 	for (let s = 0; s < 5; s += 1) {
-		let s = await od(e, t.calendarId, {
+		let s = await sd(e, t.calendarId, {
 			maxResults: t.maxEventsPerPoll,
 			pageToken: o,
 			showDeleted: "true",
 			singleEvents: "false",
 			syncToken: n.syncToken
 		});
-		if (o != null && cd(s)) return {
+		if (o != null && ld(s)) return {
 			checkpoint: {
 				calendarId: t.calendarId,
 				syncToken: n.syncToken
@@ -6698,16 +6720,16 @@ async function nd(e, t, n) {
 			events: r,
 			filtered: i
 		};
-		sd(e, s, "incremental sync");
-		let c = pd(s.data) ?? {};
+		cd(e, s, "incremental sync");
+		let c = md(s.data) ?? {};
 		for (let e of c.items ?? []) {
 			if (e.id == null || e.id.length == 0) continue;
-			let n = rd(e);
-			if (!t.changes.has(n) || !id(e, t.matchTerm)) {
+			let n = id(e);
+			if (!t.changes.has(n) || !ad(e, t.matchTerm)) {
 				i += 1;
 				continue;
 			}
-			r.push(ad(e, e.id, n, t.calendarId));
+			r.push(od(e, e.id, n, t.calendarId));
 		}
 		if (c.nextSyncToken) return {
 			checkpoint: {
@@ -6731,12 +6753,12 @@ async function nd(e, t, n) {
 		hasMore: !0
 	};
 }
-function rd(e) {
+function id(e) {
 	if (e.status == "cancelled") return "cancelled";
-	let t = fd(e.created), n = fd(e.updated);
+	let t = pd(e.created), n = pd(e.updated);
 	return t != null && t == n ? "created" : "updated";
 }
-function id(e, t) {
+function ad(e, t) {
 	if (t.length == 0) return !0;
 	let n = t.toLowerCase();
 	return [
@@ -6746,14 +6768,14 @@ function id(e, t) {
 		...(e.attendees ?? []).map(({ email: e }) => e)
 	].some((e) => typeof e == "string" && e.toLowerCase().includes(n));
 }
-function ad(e, t, n, r) {
+function od(e, t, n, r) {
 	return {
 		dedupeKey: `${t}:${e.updated ?? e.etag ?? ""}`,
 		payload: {
 			attendeeEmails: (e.attendees ?? []).flatMap(({ email: e }) => e == null || e.length == 0 ? [] : [e]),
 			calendarId: r,
 			changeType: n,
-			created: dd(e.created),
+			created: fd(e.created),
 			creatorEmail: e.creator?.email ?? null,
 			description: e.description ?? null,
 			end: e.end ?? null,
@@ -6767,11 +6789,11 @@ function ad(e, t, n, r) {
 			start: e.start ?? null,
 			status: e.status ?? "",
 			summary: e.summary ?? null,
-			updated: dd(e.updated)
+			updated: fd(e.updated)
 		}
 	};
 }
-async function od(e, t, n) {
+async function sd(e, t, n) {
 	let r = `/calendars/${encodeURIComponent(t)}/events`;
 	try {
 		return await e.connector.execute({
@@ -6783,81 +6805,81 @@ async function od(e, t, n) {
 		throw new a(`Google Calendar proxy request to ${r} failed.`, { cause: e });
 	}
 }
-function sd(e, t, n) {
-	if (!(t.status >= 200 && t.status < 300)) throw t.status == 410 || t.status == 400 && ud(t.data) ? new r("Google Calendar sync token expired; recreate the Trigger.") : t.status == 400 || t.status == 404 && e.checkpoint === null ? new r(`Google Calendar ${n} rejected the configuration.`) : t.status == 401 ? new i(`Google Calendar ${n} rejected the Connection.`) : t.status == 403 ? ld(t.data).some((e) => Zu.has(e)) ? new a(`Google Calendar ${n} was rate limited.`) : new i(`Google Calendar ${n} rejected the Connection.`) : new a(`Google Calendar ${n} failed with status ${t.status}.`);
-}
-function cd(e) {
-	return e.status == 400 && !ud(e.data);
+function cd(e, t, n) {
+	if (!(t.status >= 200 && t.status < 300)) throw t.status == 410 || t.status == 400 && dd(t.data) ? new r("Google Calendar sync token expired; recreate the Trigger.") : t.status == 400 || t.status == 404 && e.checkpoint === null ? new r(`Google Calendar ${n} rejected the configuration.`) : t.status == 401 ? new i(`Google Calendar ${n} rejected the Connection.`) : t.status == 403 ? ud(t.data).some((e) => Qu.has(e)) ? new a(`Google Calendar ${n} was rate limited.`) : new i(`Google Calendar ${n} rejected the Connection.`) : new a(`Google Calendar ${n} failed with status ${t.status}.`);
 }
 function ld(e) {
-	let t = pd(pd(e)?.error)?.errors;
+	return e.status == 400 && !dd(e.data);
+}
+function ud(e) {
+	let t = md(md(e)?.error)?.errors;
 	return Array.isArray(t) ? t.flatMap((e) => {
-		let t = pd(e)?.reason;
+		let t = md(e)?.reason;
 		return typeof t == "string" ? [t] : [];
 	}) : [];
 }
-function ud(e) {
-	if (ld(e).includes("fullSyncRequired")) return !0;
-	let t = pd(pd(e)?.error)?.message;
+function dd(e) {
+	if (ud(e).includes("fullSyncRequired")) return !0;
+	let t = md(md(e)?.error)?.message;
 	return typeof t == "string" && t.includes("fullSyncRequired");
 }
-function dd(e) {
+function fd(e) {
 	if (e == null || e.length == 0) return null;
 	let t = Date.parse(e);
 	return Number.isNaN(t) ? null : new Date(t).toISOString();
 }
-function fd(e) {
+function pd(e) {
 	if (e == null || e.length == 0) return null;
 	let t = Date.parse(e);
 	return Number.isNaN(t) ? null : Math.floor(t / 1e3);
 }
-function pd(e) {
+function md(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/deep-compare-strict.js
-function md(e, t) {
+function hd(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 (!md(e[r], t[r])) return !1;
+		for (let r = 0; r < n; r++) if (!hd(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 (!md(e[r], t[r])) return !1;
+		for (let r of n) if (!hd(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 hd(e) {
-	return encodeURI(gd(e));
-}
 function gd(e) {
+	return encodeURI(_d(e));
+}
+function _d(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 _d = {
+var vd = {
 	prefixItems: !0,
 	items: !0,
 	allOf: !0,
 	anyOf: !0,
 	oneOf: !0
-}, vd = {
+}, yd = {
 	$defs: !0,
 	definitions: !0,
 	properties: !0,
 	patternProperties: !0,
 	dependentSchemas: !0
-}, yd = {
+}, bd = {
 	id: !0,
 	$id: !0,
 	$ref: !0,
@@ -6884,13 +6906,13 @@ var _d = {
 	uniqueItems: !0,
 	maxProperties: !0,
 	minProperties: !0
-}, bd = 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 xd(e, t = Object.create(null), n = bd, r = "") {
+}, xd = 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 Sd(e, t = Object.create(null), n = xd, 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 : xd(e, t, n));
+			a.hash.length > 1 ? t[a.href] = e : (a.hash = "", r === "" ? n = a : Sd(e, t, n));
 		}
 	} else if (e !== !0 && e !== !1) return t;
 	let i = n.href + (r ? "#" + r : "");
@@ -6918,21 +6940,21 @@ function xd(e, t = Object.create(null), n = bd, r = "") {
 		t[r.href] = e;
 	}
 	for (let i in e) {
-		if (yd[i]) continue;
-		let a = `${r}/${hd(i)}`, o = e[i];
+		if (bd[i]) continue;
+		let a = `${r}/${gd(i)}`, o = e[i];
 		if (Array.isArray(o)) {
-			if (_d[i]) {
+			if (vd[i]) {
 				let e = o.length;
-				for (let r = 0; r < e; r++) xd(o[r], t, n, `${a}/${r}`);
+				for (let r = 0; r < e; r++) Sd(o[r], t, n, `${a}/${r}`);
 			}
-		} else if (vd[i]) for (let e in o) xd(o[e], t, n, `${a}/${hd(e)}`);
-		else xd(o, t, n, a);
+		} else if (yd[i]) for (let e in o) Sd(o[e], t, n, `${a}/${gd(e)}`);
+		else Sd(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 Sd = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, Cd = [
+var Cd = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, wd = [
 	0,
 	31,
 	28,
@@ -6946,60 +6968,60 @@ var Sd = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, Cd = [
 	31,
 	30,
 	31
-], wd = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i, Td = /^(?=.{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, Ed = /^(?:[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, Dd = /^(?:(?:[^\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, Od = /^(?:(?: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, kd = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i, Ad = /^(?:\/(?:[^~/]|~0|~1)*)*$/, jd = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i, Md = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/, Nd = (e) => {
+], Td = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i, Ed = /^(?=.{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, Dd = /^(?:[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, Od = /^(?:(?:[^\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, kd = /^(?:(?: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, Ad = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i, jd = /^(?:\/(?:[^~/]|~0|~1)*)*$/, Md = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i, Nd = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/, Pd = (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));
-}, Pd = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, Fd = /^((([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, Id = (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 Ld(e) {
+}, Fd = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, Id = /^((([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, Ld = (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 Rd(e) {
 	return e.test.bind(e);
 }
-var Rd = {
-	date: Bd,
-	time: Vd.bind(void 0, !1),
-	"date-time": Ud,
-	duration: Id,
-	uri: Kd,
-	"uri-reference": Ld(Ed),
-	"uri-template": Ld(Dd),
-	url: Ld(Od),
-	email: Nd,
-	hostname: Ld(Td),
-	ipv4: Ld(Pd),
-	ipv6: Ld(Fd),
-	regex: Jd,
-	uuid: Ld(kd),
-	"json-pointer": Ld(Ad),
-	"json-pointer-uri-fragment": Ld(jd),
-	"relative-json-pointer": Ld(Md)
+var zd = {
+	date: Vd,
+	time: Hd.bind(void 0, !1),
+	"date-time": Wd,
+	duration: Ld,
+	uri: qd,
+	"uri-reference": Rd(Dd),
+	"uri-template": Rd(Od),
+	url: Rd(kd),
+	email: Pd,
+	hostname: Rd(Ed),
+	ipv4: Rd(Fd),
+	ipv6: Rd(Id),
+	regex: Yd,
+	uuid: Rd(Ad),
+	"json-pointer": Rd(jd),
+	"json-pointer-uri-fragment": Rd(Md),
+	"relative-json-pointer": Rd(Nd)
 };
-function zd(e) {
+function Bd(e) {
 	return e % 4 == 0 && (e % 100 != 0 || e % 400 == 0);
 }
-function Bd(e) {
-	let t = e.match(Sd);
+function Vd(e) {
+	let t = e.match(Cd);
 	if (!t) return !1;
 	let n = +t[1], r = +t[2], i = +t[3];
-	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && zd(n) ? 29 : Cd[r]);
+	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && Bd(n) ? 29 : wd[r]);
 }
-function Vd(e, t) {
-	let n = t.match(wd);
+function Hd(e, t) {
+	let n = t.match(Td);
 	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 Hd = /t|\s/i;
-function Ud(e) {
-	let t = e.split(Hd);
-	return t.length == 2 && Bd(t[0]) && Vd(!0, t[1]);
+var Ud = /t|\s/i;
+function Wd(e) {
+	let t = e.split(Ud);
+	return t.length == 2 && Vd(t[0]) && Hd(!0, t[1]);
 }
-var Wd = /\/|:/, Gd = /^(?:[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 Kd(e) {
-	return Wd.test(e) && Gd.test(e);
+var Gd = /\/|:/, Kd = /^(?:[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 qd(e) {
+	return Gd.test(e) && Kd.test(e);
 }
-var qd = /[^\\]\\Z/;
-function Jd(e) {
-	if (qd.test(e)) return !1;
+var Jd = /[^\\]\\Z/;
+function Yd(e) {
+	if (Jd.test(e)) return !1;
 	try {
 		return new RegExp(e, "u"), !0;
 	} catch {
@@ -7008,14 +7030,14 @@ function Jd(e) {
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/ucs2-length.js
-function Yd(e) {
+function Xd(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 z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c = Object.create(null)) {
+function R(e, t, n = "2019-09", r = Sd(t), i = !0, a = null, o = "#", s = "#", c = Object.create(null)) {
 	if (t === !0) return {
 		valid: !0,
 		errors: []
@@ -7043,7 +7065,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 	}
 	let { $ref: d, $recursiveRef: f, $recursiveAnchor: p, type: m, const: h, enum: ee, required: te, not: ne, anyOf: re, allOf: ie, oneOf: ae, if: oe, then: se, else: ce, format: le, properties: ue, patternProperties: de, additionalProperties: fe, unevaluatedProperties: pe, minProperties: me, maxProperties: he, propertyNames: ge, dependentRequired: _e, dependentSchemas: ve, dependencies: ye, prefixItems: be, items: xe, additionalItems: Se, unevaluatedItems: Ce, contains: we, minContains: g, maxContains: Te, minItems: Ee, maxItems: De, uniqueItems: Oe, minimum: ke, maximum: Ae, exclusiveMinimum: je, exclusiveMaximum: Me, multipleOf: Ne, minLength: Pe, maxLength: Fe, pattern: Ie, __absolute_ref__: Le, __absolute_recursive_ref__: Re } = t, _ = [];
 	if (p === !0 && a === null && (a = t), f === "#") {
-		let l = a === null ? r[Re] : a, u = `${s}/$recursiveRef`, d = z(e, a === null ? t : a, n, r, i, l, o, u, c);
+		let l = a === null ? r[Re] : a, u = `${s}/$recursiveRef`, d = R(e, a === null ? t : a, n, r, i, l, o, u, c);
 		d.valid || _.push({
 			instanceLocation: o,
 			keyword: "$recursiveRef",
@@ -7057,7 +7079,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			let e = `Unresolved $ref "${d}".`;
 			throw Le && Le !== d && (e += `  Absolute URI "${Le}".`), e += `\nKnown schemas:\n- ${Object.keys(r).join("\n- ")}`, Error(e);
 		}
-		let l = `${s}/$ref`, u = z(e, t, n, r, i, a, o, l, c);
+		let l = `${s}/$ref`, u = R(e, t, n, r, i, a, o, l, c);
 		if (u.valid || _.push({
 			instanceLocation: o,
 			keyword: "$ref",
@@ -7091,7 +7113,7 @@ function z(e, t, n = "2019-09", r = xd(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" ? md(e, h) || _.push({
+	if (h !== void 0 && (u === "object" || u === "array" ? hd(e, h) || _.push({
 		instanceLocation: o,
 		keyword: "const",
 		keywordLocation: `${s}/const`,
@@ -7101,7 +7123,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 		keyword: "const",
 		keywordLocation: `${s}/const`,
 		error: `Instance does not match ${JSON.stringify(h)}.`
-	})), ee !== void 0 && (u === "object" || u === "array" ? ee.some((t) => md(e, t)) || _.push({
+	})), ee !== void 0 && (u === "object" || u === "array" ? ee.some((t) => hd(e, t)) || _.push({
 		instanceLocation: o,
 		keyword: "enum",
 		keywordLocation: `${s}/enum`,
@@ -7113,7 +7135,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 		error: `Instance does not match any of ${JSON.stringify(ee)}.`
 	})), ne !== void 0) {
 		let t = `${s}/not`;
-		z(e, ne, n, r, i, a, o, t).valid && _.push({
+		R(e, ne, n, r, i, a, o, t).valid && _.push({
 			instanceLocation: o,
 			keyword: "not",
 			keywordLocation: t,
@@ -7124,7 +7146,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 	if (re !== void 0) {
 		let t = `${s}/anyOf`, l = _.length, u = !1;
 		for (let s = 0; s < re.length; s++) {
-			let l = re[s], d = Object.create(c), f = z(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
+			let l = re[s], d = Object.create(c), f = R(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
 			_.push(...f.errors), u ||= f.valid, f.valid && ze.push(d);
 		}
 		u ? _.length = l : _.splice(l, 0, {
@@ -7137,7 +7159,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 	if (ie !== void 0) {
 		let t = `${s}/allOf`, l = _.length, u = !0;
 		for (let s = 0; s < ie.length; s++) {
-			let l = ie[s], d = Object.create(c), f = z(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
+			let l = ie[s], d = Object.create(c), f = R(e, l, n, r, i, p === !0 ? a : null, o, `${t}/${s}`, d);
 			_.push(...f.errors), u &&= f.valid, f.valid && ze.push(d);
 		}
 		u ? _.length = l : _.splice(l, 0, {
@@ -7149,7 +7171,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 	}
 	if (ae !== void 0) {
 		let t = `${s}/oneOf`, l = _.length, u = ae.filter((s, l) => {
-			let u = Object.create(c), d = z(e, s, n, r, i, p === !0 ? a : null, o, `${t}/${l}`, u);
+			let u = Object.create(c), d = R(e, s, n, r, i, p === !0 ? a : null, o, `${t}/${l}`, u);
 			return _.push(...d.errors), d.valid && ze.push(u), d.valid;
 		}).length;
 		u === 1 ? _.length = l : _.splice(l, 0, {
@@ -7161,9 +7183,9 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 	}
 	if ((u === "object" || u === "array") && Object.assign(c, ...ze), oe !== void 0) {
 		let t = `${s}/if`;
-		if (z(e, oe, n, r, i, a, o, t, c).valid) {
+		if (R(e, oe, n, r, i, a, o, t, c).valid) {
 			if (se !== void 0) {
-				let l = z(e, se, n, r, i, a, o, `${s}/then`, c);
+				let l = R(e, se, n, r, i, a, o, `${s}/then`, c);
 				l.valid || _.push({
 					instanceLocation: o,
 					keyword: "if",
@@ -7172,7 +7194,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 				}, ...l.errors);
 			}
 		} else if (ce !== void 0) {
-			let l = z(e, ce, n, r, i, a, o, `${s}/else`, c);
+			let l = R(e, ce, n, r, i, a, o, `${s}/else`, c);
 			l.valid || _.push({
 				instanceLocation: o,
 				keyword: "if",
@@ -7202,7 +7224,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 		}), ge !== void 0) {
 			let t = `${s}/propertyNames`;
 			for (let s in e) {
-				let e = `${o}/${hd(s)}`, c = z(s, ge, n, r, i, a, e, t);
+				let e = `${o}/${gd(s)}`, c = R(s, ge, n, r, i, a, e, t);
 				c.valid || _.push({
 					instanceLocation: o,
 					keyword: "propertyNames",
@@ -7226,7 +7248,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 		if (ve !== void 0) for (let t in ve) {
 			let l = `${s}/dependentSchemas`;
 			if (t in e) {
-				let s = z(e, ve[t], n, r, i, a, o, `${l}/${hd(t)}`, c);
+				let s = R(e, ve[t], n, r, i, a, o, `${l}/${gd(t)}`, c);
 				s.valid || _.push({
 					instanceLocation: o,
 					keyword: "dependentSchemas",
@@ -7246,7 +7268,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 					error: `Instance has "${s}" but does not have "${n}".`
 				});
 				else {
-					let l = z(e, c, n, r, i, a, o, `${t}/${hd(s)}`);
+					let l = R(e, c, n, r, i, a, o, `${t}/${gd(s)}`);
 					l.valid || _.push({
 						instanceLocation: o,
 						keyword: "dependencies",
@@ -7261,7 +7283,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			let t = `${s}/properties`;
 			for (let s in ue) {
 				if (!(s in e)) continue;
-				let d = `${o}/${hd(s)}`, f = z(e[s], ue[s], n, r, i, a, d, `${t}/${hd(s)}`);
+				let d = `${o}/${gd(s)}`, f = R(e[s], ue[s], n, r, i, a, d, `${t}/${gd(s)}`);
 				if (f.valid) c[s] = l[s] = !0;
 				else if (u = i, _.push({
 					instanceLocation: o,
@@ -7277,7 +7299,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 				let d = new RegExp(s, "u"), f = de[s];
 				for (let p in e) {
 					if (!d.test(p)) continue;
-					let m = `${o}/${hd(p)}`, h = z(e[p], f, n, r, i, a, m, `${t}/${hd(s)}`);
+					let m = `${o}/${gd(p)}`, h = R(e[p], f, n, r, i, a, m, `${t}/${gd(s)}`);
 					h.valid ? c[p] = l[p] = !0 : (u = i, _.push({
 						instanceLocation: o,
 						keyword: "patternProperties",
@@ -7291,7 +7313,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			let t = `${s}/additionalProperties`;
 			for (let s in e) {
 				if (l[s]) continue;
-				let d = `${o}/${hd(s)}`, f = z(e[s], fe, n, r, i, a, d, t);
+				let d = `${o}/${gd(s)}`, f = R(e[s], fe, n, r, i, a, d, t);
 				f.valid ? c[s] = !0 : (u = i, _.push({
 					instanceLocation: o,
 					keyword: "additionalProperties",
@@ -7302,7 +7324,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 		} else if (!u && pe !== void 0) {
 			let t = `${s}/unevaluatedProperties`;
 			for (let s in e) if (!c[s]) {
-				let l = `${o}/${hd(s)}`, u = z(e[s], pe, n, r, i, a, l, t);
+				let l = `${o}/${gd(s)}`, u = R(e[s], pe, n, r, i, a, l, t);
 				u.valid ? c[s] = !0 : _.push({
 					instanceLocation: o,
 					keyword: "unevaluatedProperties",
@@ -7327,7 +7349,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 		if (be !== void 0) {
 			let d = `${s}/prefixItems`, f = Math.min(be.length, t);
 			for (; l < f; l++) {
-				let t = z(e[l], be[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
+				let t = R(e[l], be[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
 				if (c[l] = !0, !t.valid && (u = i, _.push({
 					instanceLocation: o,
 					keyword: "prefixItems",
@@ -7341,7 +7363,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			if (Array.isArray(xe)) {
 				let s = Math.min(xe.length, t);
 				for (; l < s; l++) {
-					let t = z(e[l], xe[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
+					let t = R(e[l], xe[l], n, r, i, a, `${o}/${l}`, `${d}/${l}`);
 					if (c[l] = !0, !t.valid && (u = i, _.push({
 						instanceLocation: o,
 						keyword: "items",
@@ -7350,7 +7372,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 					}, ...t.errors), u)) break;
 				}
 			} else for (; l < t; l++) {
-				let t = z(e[l], xe, n, r, i, a, `${o}/${l}`, d);
+				let t = R(e[l], xe, n, r, i, a, `${o}/${l}`, d);
 				if (c[l] = !0, !t.valid && (u = i, _.push({
 					instanceLocation: o,
 					keyword: "items",
@@ -7361,7 +7383,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			if (!u && Se !== void 0) {
 				let d = `${s}/additionalItems`;
 				for (; l < t; l++) {
-					let t = z(e[l], Se, n, r, i, a, `${o}/${l}`, d);
+					let t = R(e[l], Se, n, r, i, a, `${o}/${l}`, d);
 					c[l] = !0, t.valid || (u = i, _.push({
 						instanceLocation: o,
 						keyword: "additionalItems",
@@ -7387,7 +7409,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			else {
 				let l = `${s}/contains`, u = _.length, d = 0;
 				for (let s = 0; s < t; s++) {
-					let t = z(e[s], we, n, r, i, a, `${o}/${s}`, l);
+					let t = R(e[s], we, n, r, i, a, `${o}/${s}`, l);
 					t.valid ? (c[s] = !0, d++) : _.push(...t.errors);
 				}
 				d >= (g || 0) && (_.length = u), g === void 0 && Te === void 0 && d === 0 ? _.splice(u, 0, {
@@ -7412,7 +7434,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			let u = `${s}/unevaluatedItems`;
 			for (; l < t; l++) {
 				if (c[l]) continue;
-				let t = z(e[l], Ce, n, r, i, a, `${o}/${l}`, u);
+				let t = R(e[l], Ce, n, r, i, a, `${o}/${l}`, u);
 				c[l] = !0, t.valid || _.push({
 					instanceLocation: o,
 					keyword: "unevaluatedItems",
@@ -7426,7 +7448,7 @@ function z(e, t, n = "2019-09", r = xd(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 && md(r, t)) && (_.push({
+				(r === t || i && typeof t == "object" && t && hd(r, t)) && (_.push({
 					instanceLocation: o,
 					keyword: "uniqueItems",
 					keywordLocation: `${s}/uniqueItems`,
@@ -7475,7 +7497,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			});
 		}
 	} else if (u === "string") {
-		let t = Pe === void 0 && Fe === void 0 ? 0 : Yd(e);
+		let t = Pe === void 0 && Fe === void 0 ? 0 : Xd(e);
 		Pe !== void 0 && t < Pe && _.push({
 			instanceLocation: o,
 			keyword: "minLength",
@@ -7491,7 +7513,7 @@ function z(e, t, n = "2019-09", r = xd(t), i = !0, a = null, o = "#", s = "#", c
 			keyword: "pattern",
 			keywordLocation: `${s}/pattern`,
 			error: "String does not match pattern."
-		}), le !== void 0 && Rd[le] && !Rd[le](e) && _.push({
+		}), le !== void 0 && zd[le] && !zd[le](e) && _.push({
 			instanceLocation: o,
 			keyword: "format",
 			keywordLocation: `${s}/format`,
@@ -7505,122 +7527,122 @@ function z(e, t, n = "2019-09", r = xd(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 Xd = class {
+var Zd = class {
 	schema;
 	draft;
 	shortCircuit;
 	lookup;
 	constructor(e, t = "2019-09", n = !0) {
-		this.schema = e, this.draft = t, this.shortCircuit = n, this.lookup = xd(e);
+		this.schema = e, this.draft = t, this.shortCircuit = n, this.lookup = Sd(e);
 	}
 	validate(e) {
-		return z(e, this.schema, this.draft, this.lookup, this.shortCircuit);
+		return R(e, this.schema, this.draft, this.lookup, this.shortCircuit);
 	}
 	addSchema(e, t) {
 		t && (e = {
 			...e,
 			$id: t
-		}), xd(e, this.lookup);
+		}), Sd(e, this.lookup);
 	}
-}, Zd = 0;
-function Qd() {
-	let e = Zd;
-	return Zd += 1, e;
+}, Qd = 0;
+function $d() {
+	let e = Qd;
+	return Qd += 1, e;
 }
-function $d(e) {
+function ef(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) $d(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) ef(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function ef(e, t) {
+function tf(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function tf(e) {
+function nf(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = tf(r);
+		for (let [n, r] of e.entries()) t[n] = nf(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = tf(e[n]);
+		for (let n in e) t[n] = nf(e[n]);
 		return t;
 	}
 }
-function nf(e, t) {
+function rf(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 (!nf(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!rf(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !nf(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !rf(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 B = Object.freeze({
+var z = Object.freeze({
 	Equals: 0,
 	Containing: 1,
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), V = df(B.Equals), H = df(B.Containing), U = df(B.ContainedBy), W = df(B.Rejection), G = df(B.Intersection), rf = $d([
-	[B.Equals, V],
-	[B.Containing, H],
-	[B.ContainedBy, U],
-	[B.Rejection, W],
-	[B.Intersection, G]
-]), af = (() => {
+}), B = ff(z.Equals), V = ff(z.Containing), H = ff(z.ContainedBy), U = ff(z.Rejection), W = ff(z.Intersection), af = ef([
+	[z.Equals, B],
+	[z.Containing, V],
+	[z.ContainedBy, H],
+	[z.Rejection, U],
+	[z.Intersection, W]
+]), of = (() => {
 	let e = 0;
-	for (let [t, n] of rf) e |= n;
+	for (let [t, n] of af) e |= n;
 	return e;
 })();
-function of(e) {
-	return !!(e & V);
-}
 function sf(e) {
-	return !!(e & H);
+	return !!(e & B);
 }
 function cf(e) {
-	return !!(e & U);
+	return !!(e & V);
 }
 function lf(e) {
-	return !!(e & W);
+	return !!(e & H);
 }
 function uf(e) {
-	return !!(e & G);
+	return !!(e & U);
 }
 function df(e) {
+	return !!(e & W);
+}
+function ff(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function ff(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : pf(t, r, e), n += 1, t) };
+function pf(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : mf(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function pf(e, t, n) {
+function mf(e, t, n) {
 	let r = 0;
-	for (let [i, a] of rf) if (a & e) {
-		for (let [e, a] of rf) if (a & t && (r |= n(i, e), r === af)) return r;
+	for (let [i, a] of af) if (a & e) {
+		for (let [e, a] of af) if (a & t && (r |= n(i, e), r === of)) return r;
 	}
 	return r;
 }
 //#endregion
 //#region src/json-schema-subset/expression/calculator.ts
-var K = Object.freeze({
+var G = Object.freeze({
 	Save: 0,
 	OneOf: 1,
 	AllOf: 2,
@@ -7628,289 +7650,289 @@ var K = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function mf(e, t) {
+function hf(e, t) {
 	switch (e) {
-		case K.Save: return t[0];
-		case K.OneOf: return gf(t);
-		case K.AllOf:
-		case K.AnyOf: return _f(e, t);
-		case K.Not:
-		case K.Swap: return vf(e, t[0]);
+		case G.Save: return t[0];
+		case G.OneOf: return _f(t);
+		case G.AllOf:
+		case G.AnyOf: return vf(e, t);
+		case G.Not:
+		case G.Swap: return yf(e, t[0]);
 	}
 }
-function hf(e) {
-	return vf(K.Swap, e);
-}
 function gf(e) {
+	return yf(G.Swap, e);
+}
+function _f(e) {
 	if (e.length === 1) return e[0];
-	let t = _f(K.AnyOf, e), n = [];
+	let t = vf(G.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 = _f(K.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = vf(G.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = _f(K.AnyOf, n), i = vf(K.Not, r);
-	return _f(K.AllOf, [t, i]);
+	let r = vf(G.AnyOf, n), i = yf(G.Not, r);
+	return vf(G.AllOf, [t, i]);
 }
-function _f(e, t) {
+function vf(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
-		case K.AllOf:
-			n = ff(yf);
+		case G.AllOf:
+			n = pf(bf);
 			break;
-		case K.AnyOf:
-			n = ff(bf);
+		case G.AnyOf:
+			n = pf(xf);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function vf(e, t) {
+function yf(e, t) {
 	let n, r = 0;
 	switch (e) {
-		case K.Not:
-			n = xf;
-			break;
-		case K.Swap:
+		case G.Not:
 			n = Sf;
 			break;
+		case G.Swap:
+			n = Cf;
+			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of rf) i & t && (r |= n(e));
+	for (let [e, i] of af) i & t && (r |= n(e));
 	return r;
 }
-function yf(e, t) {
+function bf(e, t) {
 	let n = 0;
 	switch (e) {
-		case B.Equals:
+		case z.Equals:
 			switch (t) {
-				case B.Equals:
-					n = V;
+				case z.Equals:
+					n = B;
 					break;
-				case B.Containing:
-					n = V;
+				case z.Containing:
+					n = B;
 					break;
-				case B.ContainedBy:
-					n = U;
+				case z.ContainedBy:
+					n = H;
 					break;
-				case B.Rejection:
+				case z.Rejection:
 					n = 0;
 					break;
-				case B.Intersection: n = U;
+				case z.Intersection: n = H;
 			}
 			break;
-		case B.Containing:
+		case z.Containing:
 			switch (t) {
-				case B.Equals:
-					n = V;
+				case z.Equals:
+					n = B;
 					break;
-				case B.Containing:
-					n = V | H;
+				case z.Containing:
+					n = B | V;
 					break;
-				case B.ContainedBy:
-					n = U;
+				case z.ContainedBy:
+					n = H;
 					break;
-				case B.Rejection:
-					n = W;
+				case z.Rejection:
+					n = U;
 					break;
-				case B.Intersection: n = G | U;
+				case z.Intersection: n = W | H;
 			}
 			break;
-		case B.ContainedBy:
+		case z.ContainedBy:
 			switch (t) {
-				case B.Equals:
-					n = U;
+				case z.Equals:
+					n = H;
 					break;
-				case B.Containing:
-					n = U;
+				case z.Containing:
+					n = H;
 					break;
-				case B.ContainedBy:
-					n = U;
+				case z.ContainedBy:
+					n = H;
 					break;
-				case B.Rejection:
+				case z.Rejection:
 					n = 0;
 					break;
-				case B.Intersection: n = U;
+				case z.Intersection: n = H;
 			}
 			break;
-		case B.Rejection:
+		case z.Rejection:
 			switch (t) {
-				case B.Equals:
+				case z.Equals:
 					n = 0;
 					break;
-				case B.Containing:
-					n = W;
+				case z.Containing:
+					n = U;
 					break;
-				case B.ContainedBy:
+				case z.ContainedBy:
 					n = 0;
 					break;
-				case B.Rejection:
-					n = W;
+				case z.Rejection:
+					n = U;
 					break;
-				case B.Intersection: n = W;
+				case z.Intersection: n = U;
 			}
 			break;
-		case B.Intersection: switch (t) {
-			case B.Equals:
-				n = U;
+		case z.Intersection: switch (t) {
+			case z.Equals:
+				n = H;
 				break;
-			case B.Containing:
-				n = G | U;
+			case z.Containing:
+				n = W | H;
 				break;
-			case B.ContainedBy:
-				n = U;
+			case z.ContainedBy:
+				n = H;
 				break;
-			case B.Rejection:
-				n = W;
+			case z.Rejection:
+				n = U;
 				break;
-			case B.Intersection: n = U | W | G;
+			case z.Intersection: n = H | U | W;
 		}
 	}
 	return n;
 }
-function bf(e, t) {
+function xf(e, t) {
 	let n = 0;
 	switch (e) {
-		case B.Equals:
+		case z.Equals:
 			switch (t) {
-				case B.Equals:
+				case z.Equals:
+					n = B;
+					break;
+				case z.Containing:
 					n = V;
 					break;
-				case B.Containing:
-					n = H;
+				case z.ContainedBy:
+					n = B;
 					break;
-				case B.ContainedBy:
+				case z.Rejection:
 					n = V;
 					break;
-				case B.Rejection:
-					n = H;
-					break;
-				case B.Intersection: n = H;
+				case z.Intersection: n = V;
 			}
 			break;
-		case B.Containing:
+		case z.Containing:
 			switch (t) {
-				case B.Equals:
-					n = H;
+				case z.Equals:
+					n = V;
 					break;
-				case B.Containing:
-					n = H;
+				case z.Containing:
+					n = V;
 					break;
-				case B.ContainedBy:
-					n = H;
+				case z.ContainedBy:
+					n = V;
 					break;
-				case B.Rejection:
-					n = H;
+				case z.Rejection:
+					n = V;
 					break;
-				case B.Intersection: n = H;
+				case z.Intersection: n = V;
 			}
 			break;
-		case B.ContainedBy:
+		case z.ContainedBy:
 			switch (t) {
-				case B.Equals:
-					n = V;
+				case z.Equals:
+					n = B;
 					break;
-				case B.Containing:
-					n = H;
+				case z.Containing:
+					n = V;
 					break;
-				case B.ContainedBy:
-					n = V | U;
+				case z.ContainedBy:
+					n = B | H;
 					break;
-				case B.Rejection:
-					n = G;
+				case z.Rejection:
+					n = W;
 					break;
-				case B.Intersection: n = H | G;
+				case z.Intersection: n = V | W;
 			}
 			break;
-		case B.Rejection:
+		case z.Rejection:
 			switch (t) {
-				case B.Equals:
-					n = H;
-					break;
-				case B.Containing:
-					n = H;
+				case z.Equals:
+					n = V;
 					break;
-				case B.ContainedBy:
-					n = G;
+				case z.Containing:
+					n = V;
 					break;
-				case B.Rejection:
+				case z.ContainedBy:
 					n = W;
 					break;
-				case B.Intersection: n = G;
+				case z.Rejection:
+					n = U;
+					break;
+				case z.Intersection: n = W;
 			}
 			break;
-		case B.Intersection: switch (t) {
-			case B.Equals:
-				n = H;
+		case z.Intersection: switch (t) {
+			case z.Equals:
+				n = V;
 				break;
-			case B.Containing:
-				n = H;
+			case z.Containing:
+				n = V;
 				break;
-			case B.ContainedBy:
-				n = H | G;
+			case z.ContainedBy:
+				n = V | W;
 				break;
-			case B.Rejection:
-				n = G;
+			case z.Rejection:
+				n = W;
 				break;
-			case B.Intersection: n = H | G;
+			case z.Intersection: n = V | W;
 		}
 	}
 	return n;
 }
-function xf(e) {
+function Sf(e) {
 	let t = 0;
 	switch (e) {
-		case B.Equals:
-			t = W;
+		case z.Equals:
+			t = U;
 			break;
-		case B.Containing:
-			t = W;
+		case z.Containing:
+			t = U;
 			break;
-		case B.ContainedBy:
-			t = G;
+		case z.ContainedBy:
+			t = W;
 			break;
-		case B.Rejection:
-			t = V | H;
+		case z.Rejection:
+			t = B | V;
 			break;
-		case B.Intersection: t = U | G;
+		case z.Intersection: t = H | W;
 	}
 	return t;
 }
-function Sf(e) {
+function Cf(e) {
 	let t = 0;
 	switch (e) {
-		case B.Equals:
-			t = V;
-			break;
-		case B.Containing:
-			t = U;
+		case z.Equals:
+			t = B;
 			break;
-		case B.ContainedBy:
+		case z.Containing:
 			t = H;
 			break;
-		case B.Rejection:
-			t = W;
+		case z.ContainedBy:
+			t = V;
+			break;
+		case z.Rejection:
+			t = U;
 			break;
-		case B.Intersection: t = G;
+		case z.Intersection: t = W;
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var Cf = Object.freeze({
+var wf = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), wf = (e) => (t, n) => {
+}), Tf = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
 		expressions: null,
 		calculation: {
-			operator: K.Save,
+			operator: G.Save,
 			results: [0],
 			willSwap: !1,
 			count: 0
@@ -7929,10 +7951,10 @@ var Cf = Object.freeze({
 		for (; a.length > 0;) c(a.pop());
 	}
 	function o(t) {
-		let n = V, [r, o] = t.expressions;
+		let n = B, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== Cf.Leaf) {
+			if (a.kind !== wf.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -7947,7 +7969,7 @@ var Cf = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== Cf.Leaf) {
+			if (c.kind !== wf.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -7964,26 +7986,26 @@ var Cf = 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: K.Save,
+			operator: G.Save,
 			results: [n],
 			willSwap: !1,
 			count: 0
 		}, a.push(t);
 	}
 	function s(e, t) {
-		let n = K.Save, r;
+		let n = G.Save, r;
 		switch (e.kind) {
-			case Cf.Not:
-				n = K.Not, r = [e.expression];
+			case wf.Not:
+				n = G.Not, r = [e.expression];
 				break;
-			case Cf.AllOf:
-				n = K.AllOf, r = [...e.expressions];
+			case wf.AllOf:
+				n = G.AllOf, r = [...e.expressions];
 				break;
-			case Cf.AnyOf:
-				n = K.AnyOf, r = [...e.expressions];
+			case wf.AnyOf:
+				n = G.AnyOf, r = [...e.expressions];
 				break;
-			case Cf.OneOf:
-				n = K.OneOf, r = [...e.expressions];
+			case wf.OneOf:
+				n = G.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
 		}
@@ -7995,8 +8017,8 @@ var Cf = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = mf(t.operator, t.results);
-		if (r === 0 && (r = U), t.willSwap && (r = hf(r)), n) {
+		let t = e.calculation, n = e.parent, r = hf(t.operator, t.results);
+		if (r === 0 && (r = H), t.willSwap && (r = gf(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);
 		}
@@ -8004,79 +8026,79 @@ var Cf = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, Tf = class extends Error {
+}, Ef = class extends Error {
 	constructor(e = []) {
-		super(Of(e)), this.name = "SchemaError", this.items = e;
+		super(kf(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Ef = Object.freeze({
+}, Df = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Df(e) {
+function Of(e) {
 	switch (e.kind) {
-		case Ef.Compiled: {
+		case Df.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Ef.External: return String(e.error);
+		case Df.External: return String(e.error);
 	}
 }
-function Of(e) {
+function kf(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Df(e[0]);
-		default: return `${Df(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Of(e[0]);
+		default: return `${Of(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var kf = /* @__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 Af(e) {
-	return kf.has(e);
-}
+var Af = /* @__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 jf(e) {
-	for (let t in e) if (Af(t)) return !1;
+	return Af.has(e);
+}
+function Mf(e) {
+	for (let t in e) if (jf(t)) return !1;
 	return !0;
 }
-function Mf(e, ...t) {
+function Nf(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function Nf(e) {
+function Pf(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function Pf({ path: e, errors: t }, n, ...r) {
-	t.push(Ff(e, r, n));
+function Ff({ path: e, errors: t }, n, ...r) {
+	t.push(If(e, r, n));
 }
-function q({ path: e, warns: t }, n, ...r) {
-	t.push(Ff(e, r, n));
+function K({ path: e, warns: t }, n, ...r) {
+	t.push(If(e, r, n));
 }
-function Ff(e, t, n) {
+function If(e, t, n) {
 	return {
-		kind: Ef.Compiled,
+		kind: Df.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function If(e) {
+function Lf(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] : Lf(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : Rf(n) && delete e[t]);
 	}
 	return e;
 }
-function Lf(e) {
+function Rf(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var Rf = Symbol("compiledId"), zf = Symbol("compiledKind"), Bf = Symbol("compiledPath"), Vf = Symbol("validatorLoader"), J = Object.freeze({
+var zf = Symbol("compiledId"), Bf = Symbol("compiledKind"), Vf = Symbol("compiledPath"), Hf = Symbol("validatorLoader"), q = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -8089,62 +8111,62 @@ var Rf = Symbol("compiledId"), zf = Symbol("compiledKind"), Bf = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), Hf = $d(Xf(J.Any, Qd(), {}, () => () => !0)), Uf = $d(Xf(J.Never, Qd(), {
+}), Uf = ef(Zf(q.Any, $d(), {}, () => () => !0)), Wf = ef(Zf(q.Never, $d(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function Wf(e) {
-	return typeof e != "object" || !e ? !1 : Rf in e;
-}
 function Gf(e) {
-	return typeof e != "object" || !e ? !1 : Rf in e && zf in e;
-}
-function Y(e) {
-	return Gf(e) ? e[zf] : J.Extends;
+	return typeof e != "object" || !e ? !1 : zf in e;
 }
 function Kf(e) {
-	return Gf(e) || Wf(e) ? e[Rf] : e.id;
+	return typeof e != "object" || !e ? !1 : zf in e && Bf in e;
+}
+function J(e) {
+	return Kf(e) ? e[Bf] : q.Extends;
 }
 function qf(e) {
-	return Gf(e) ? e[Bf] : void 0;
+	return Kf(e) || Gf(e) ? e[zf] : e.id;
 }
 function Jf(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, Rf, {
-		value: Qd(),
+	return Kf(e) ? e[Vf] : void 0;
+}
+function Yf(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, zf, {
+		value: $d(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
-function X(e, t, n, r = []) {
-	return Xf(e, Qd(), t, n && (() => n.compile(t)), r);
+function Y(e, t, n, r = []) {
+	return Zf(e, $d(), t, n && (() => n.compile(t)), r);
 }
-function Yf(e) {
-	return Xf(J.Never, Qd(), { ...e }, e[Vf], e[Bf]);
+function Xf(e) {
+	return Zf(q.Never, $d(), { ...e }, e[Hf], e[Vf]);
 }
-function Xf(e, t, n, r, i = []) {
+function Zf(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[zf]: {
+		[Bf]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Rf]: {
+		[zf]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Bf]: {
+		[Vf]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Vf]: {
+		[Hf]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -8161,16 +8183,16 @@ function Xf(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function Zf(e, t) {
-	let n = Qf(e, t), r = $f(e, "maxItems", t), i = $f(e, "minItems", t), a = ep(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = tp(e, t) : t.additionalItems && q(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function Qf(e, t) {
+	let n = $f(e, t), r = ep(e, "maxItems", t), i = ep(e, "minItems", t), a = tp(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = np(e, t) : t.additionalItems && K(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
 	let c = !1, l = !1;
 	if (Array.isArray(n)) {
-		r !== void 0 && r <= n.length && (n = n.splice(r), s = np(s, e.delegate));
-		let t = n.findIndex((e) => Y(e) === J.Never);
-		t !== -1 && (n = n.splice(t), s = np(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (q(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && Y(s) === J.Never && (c = !0);
-	} else Y(n) === J.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || q(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), X(c ? J.Never : J.Array, If({
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = rp(s, e.delegate));
+		let t = n.findIndex((e) => J(e) === q.Never);
+		t !== -1 && (n = n.splice(t), s = rp(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (K(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && J(s) === q.Never && (c = !0);
+	} else J(n) === q.Never && (c = !0);
+	return r !== void 0 && i !== void 0 && r < i && (l || K(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Y(c ? q.Never : q.Array, Lf({
 		type: "array",
 		items: n,
 		contains: a,
@@ -8180,12 +8202,12 @@ function Zf(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function Qf(e, { items: t }) {
-	if (!t) return X(J.Any, {}, e.delegate, e.path);
+function $f(e, { items: t }) {
+	if (!t) return Y(q.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = Q(Mf(e, "items", i), Nf(a));
+			let t = Z(Nf(e, "items", i), Pf(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -8194,80 +8216,80 @@ function Qf(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return Q(Mf(e, "items"), Nf(t));
+	return Z(Nf(e, "items"), Pf(t));
 }
-function $f(e, t, n) {
+function ep(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			q(e, "find NaN", t);
+			K(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			q(e, `find invalid number ${r}`, t);
+			K(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function ep(e, { contains: t }) {
-	return t ? Q(Mf(e, "contains"), Nf(t)) : X(J.Any, {}, e.delegate, e.path);
+function tp(e, { contains: t }) {
+	return t ? Z(Nf(e, "contains"), Pf(t)) : Y(q.Any, {}, e.delegate, e.path);
 }
-function tp(e, { additionalItems: t }) {
+function np(e, { additionalItems: t }) {
 	switch (typeof t) {
-		case "boolean": return t ? X(J.Any, {}, e.delegate, e.path) : !1;
-		case "object": return Q(Mf(e, "additionalItems"), t);
-		default: return X(J.Any, {}, e.delegate, e.path);
+		case "boolean": return t ? Y(q.Any, {}, e.delegate, e.path) : !1;
+		case "object": return Z(Nf(e, "additionalItems"), t);
+		default: return Y(q.Any, {}, e.delegate, e.path);
 	}
 }
-function np(e, t) {
-	return e === void 0 ? X(J.Never, {
+function rp(e, t) {
+	return e === void 0 ? Y(q.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : Gf(e) ? Y(e) === J.Never ? e : Yf(e) : e;
+	}, t) : Kf(e) ? J(e) === q.Never ? e : Xf(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var rp = Object.freeze([
+var ip = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function ip(e, t, n, r) {
-	if (n.length === 0) return Pf(e, "disable empty list", t), null;
+function ap(e, t, n, r) {
+	if (n.length === 0) return Ff(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = Q(Mf(e, t, r), Nf(a));
+		let n = Z(Nf(e, t, r), Pf(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
 	let a = 0, o = 0;
-	for (let e of i) switch (Y(e)) {
-		case J.Any:
+	for (let e of i) switch (J(e)) {
+		case q.Any:
 			a += 1;
 			break;
-		case J.Never: o += 1;
+		case q.Never: o += 1;
 	}
-	let s = J.Combination;
+	let s = q.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = J.Never : a === i.length ? s = J.Any : ap(i) || (s = J.Never);
+			o > 0 ? s = q.Never : a === i.length ? s = q.Any : op(i) || (s = q.Never);
 			break;
 		case "anyOf":
-			a > 0 ? s = J.Any : o === i.length && (s = J.Never);
+			a > 0 ? s = q.Any : o === i.length && (s = q.Never);
 			break;
-		case "oneOf": a > 1 || o === i.length ? s = J.Never : a === 1 && o === i.length - 1 && (s = J.Any);
+		case "oneOf": a > 1 || o === i.length ? s = q.Never : a === 1 && o === i.length - 1 && (s = q.Any);
 	}
-	return X(s, { [t]: i }, r, e.path);
+	return Y(s, { [t]: i }, r, e.path);
 }
-function ap(e) {
+function op(e) {
 	let t = null;
 	for (let n of e) {
-		let e = Y(n);
+		let e = J(n);
 		switch (e) {
-			case J.Any:
-			case J.Never: break;
+			case q.Any:
+			case q.Never: break;
 			default: if (t === null) t = e;
 			else if (t !== e) return !1;
 		}
@@ -8276,47 +8298,47 @@ function ap(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var Z = Object.freeze({
+var X = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
-function op(e, t) {
+function sp(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? Z.Valid : Z.Invalid : Z.Unknown;
+	return n ? n(t) === !0 ? X.Valid : X.Invalid : X.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function sp(e, t, n, r) {
+function cp(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return Pf(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return Ff(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (op(r, a)) {
-			case Z.Valid:
-				i.push(Jf(a));
+		for (let [n, a] of t.entries()) switch (sp(r, a)) {
+			case X.Valid:
+				i.push(Yf(a));
 				break;
-			case Z.Invalid: q(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case X.Invalid: K(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
-		i.length === 0 && q(e, "all of elements from list is rejected by currently schema object", "enum");
+		i.length === 0 && K(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && op(r, n) === Z.Invalid && (a = !0), i) {
+	if (n && sp(r, n) === X.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (nf(t, n)) {
+			for (let t of i) if (rf(t, n)) {
 				e = !0;
 				break;
 			}
 			e || (a = !0);
 		}
 	}
-	let o = a ? J.Never : J.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = Jf(tf(n))), X(o, s, e.delegate, e.path);
+	let o = a ? q.Never : q.EnumOrConst, s = {};
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = Yf(nf(n))), Y(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var cp = /* @__PURE__ */ new Set([
+var lp = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -8327,56 +8349,56 @@ var cp = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function lp(e, t) {
-	let n = Object.keys(t).filter((e) => !cp.has(e) && Af(e));
-	n.length > 0 && q(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = up(e, "maxProperties", t), i = up(e, "minProperties", t), a = dp(e, t), o = fp(e, t), s = pp(e, t), c = hp(e, t);
+function up(e, t) {
+	let n = Object.keys(t).filter((e) => !lp.has(e) && jf(e));
+	n.length > 0 && K(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = dp(e, "maxProperties", t), i = dp(e, "minProperties", t), a = fp(e, t), o = pp(e, t), s = mp(e, t), c = gp(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = mp(e, o, s, t);
+	let l = hp(e, o, s, t);
 	if (!l) return null;
-	let u = _p(e, gp(a, o, s, l), c, t);
-	return X(vp(e, a, l, u, r, i) ? J.Never : J.Object, If({
+	let u = vp(e, _p(a, o, s, l), c, t);
+	return Y(yp(e, a, l, u, r, i) ? q.Never : q.Object, Lf({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: Cp(o),
-		dependencies: wp(c, t),
+		patternProperties: wp(o),
+		dependencies: Tp(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function up(e, t, n) {
+function dp(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			q(e, "find NaN", t);
+			K(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			q(e, `find invalid number ${r}`, t);
+			K(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function dp(e, { additionalProperties: t }) {
-	return t === !1 ? X(J.Never, {
+function fp(e, { additionalProperties: t }) {
+	return t === !1 ? Y(q.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? Q(Mf(e, "additionalProperties"), Nf(t)) : X(J.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? Z(Nf(e, "additionalProperties"), Pf(t)) : Y(q.Any, {}, e.delegate, e.path);
 }
-function fp(e, { patternProperties: t }) {
+function pp(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = Sp(i);
+		let a = Cp(i);
 		if (a instanceof Error) {
-			q(e, `property name invalid. ${i}`, "patternProperties", i);
+			K(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = Nf(t[i]), s = Q(Mf(e, "patternProperties", i), o);
+		let o = Pf(t[i]), s = Z(Nf(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -8385,29 +8407,29 @@ function fp(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function pp(e, { propertyNames: t }) {
-	if (!t) return X(J.Any, {}, e.delegate, e.path);
-	t = Nf(t);
-	let n = Q(Mf(e, "propertyNames"), t);
+function mp(e, { propertyNames: t }) {
+	if (!t) return Y(q.Any, {}, e.delegate, e.path);
+	t = Pf(t);
+	let n = Z(Nf(e, "propertyNames"), t);
 	if (!n) return null;
-	let r = Y(n);
-	return r !== J.String && r !== J.Any ? Yf(n) : n;
+	let r = J(n);
+	return r !== q.String && r !== q.Any ? Xf(n) : n;
 }
-function mp(e, t, n, { properties: r }) {
+function hp(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (op(n, o) === Z.Invalid) {
-			q(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
+		if (sp(n, o) === X.Invalid) {
+			K(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = xp(t, o);
-		if (s && Y(s) === J.Never) {
-			q(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
+		let s = Sp(t, o);
+		if (s && J(s) === q.Never) {
+			K(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = Nf(r[o]), l = Q(Mf(e, "properties", o), c);
+		let c = Pf(r[o]), l = Z(Nf(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -8416,62 +8438,62 @@ function mp(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function hp(e, { dependencies: t }) {
+function gp(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = Nf(t[i]);
+		let a = Pf(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = bp(a);
-			r && q(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
+			let { keys: t, duplicated: r } = xp(a);
+			r && K(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = Q(Mf(e, "dependencies", i), a);
+			let t = Z(Nf(e, "dependencies", i), a);
 			if (t) {
-				let e = Y(t);
-				r[i] = e === J.Object || e === J.Any ? t : e === J.Extends ? Uf : Yf(t);
+				let e = J(t);
+				r[i] = e === q.Object || e === q.Any ? t : e === q.Extends ? Wf : Xf(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function gp(e, t, n, r) {
+function _p(e, t, n, r) {
 	return (i) => {
-		if (op(n, i) === Z.Invalid) return !0;
-		let a = xp(t, i);
-		return !!(a && Y(a) === J.Never || Y(r[i] ?? e) === J.Never);
+		if (sp(n, i) === X.Invalid) return !0;
+		let a = Sp(t, i);
+		return !!(a && J(a) === q.Never || J(r[i] ?? e) === q.Never);
 	};
 }
-function _p(e, t, n, { required: r }) {
+function vp(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = bp(r);
-	i.duplicated && q(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
+	let i = xp(r);
+	i.duplicated && K(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) yp(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
-	return o.length > 0 && q(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
-}
-function vp(e, t, n, r, i, a) {
-	if (i !== void 0 && a !== void 0 && i < a) return q(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
-	if (i !== void 0 && r.length > i) return q(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
-	if (a !== void 0 && r.length < a) return q(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
-	if (Y(t) !== J.Never) return !1;
+	for (let e of i.keys) bp(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	return o.length > 0 && K(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
+}
+function yp(e, t, n, r, i, a) {
+	if (i !== void 0 && a !== void 0 && i < a) return K(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
+	if (i !== void 0 && r.length > i) return K(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
+	if (a !== void 0 && r.length < a) return K(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
+	if (J(t) !== q.Never) return !1;
 	for (let e in n) {
 		let t = n[e];
-		if (Y(t) !== J.Never) return !1;
+		if (J(t) !== q.Never) return !1;
 	}
 	return !0;
 }
-function yp([e, t], n) {
+function bp([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 && Y(i) === J.Object && a(i.required), o && a(o);
+		i && J(i) === q.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 bp(e) {
+function xp(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 ? {
@@ -8482,14 +8504,14 @@ function bp(e) {
 		duplicated: [...n]
 	};
 }
-function xp(e, t) {
+function Sp(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function Sp(e) {
+function Cp(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -8497,12 +8519,12 @@ function Sp(e) {
 		throw e;
 	}
 }
-function Cp(e) {
+function wp(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function wp([e, t], { dependencies: n }) {
+function Tp([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -8512,79 +8534,79 @@ function wp([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var Tp = /* @__PURE__ */ new Set([
+var Ep = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Ep = /* @__PURE__ */ new Set([
+]), Dp = /* @__PURE__ */ new Set([
 	"type",
 	"format",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function Dp(e, t) {
+function Op(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return Op(e, t);
-		case "string": return Ap(e, t);
+		case "integer": return kp(e, t);
+		case "string": return jp(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => Af(e) && e !== "type");
-			return r.length > 0 && q(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), X(n === "null" ? J.Null : J.Boolean, { type: n }, e.delegate, e.path);
+			let r = Object.keys(t).filter((e) => jf(e) && e !== "type");
+			return r.length > 0 && K(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Y(n === "null" ? q.Null : q.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return Pf(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return Ff(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function Op(e, t) {
-	let n = Object.keys(t).filter((e) => !Tp.has(e) && Af(e));
-	n.length > 0 && q(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = ef(t, Tp);
-	for (let t of Tp) {
+function kp(e, t) {
+	let n = Object.keys(t).filter((e) => !Ep.has(e) && jf(e));
+	n.length > 0 && K(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = tf(t, Ep);
+	for (let t of Ep) {
 		let n = r[t];
-		t !== "type" && n !== void 0 && Number.isNaN(n) && (q(e, "found NaN", t), delete r[t]);
+		t !== "type" && n !== void 0 && Number.isNaN(n) && (K(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", q(e, "cannot be 0", "multipleOf"));
-	let l = J.Numeric;
-	return kp(r) || (l = J.Never), X(l, r, e.delegate, e.path);
+	c === 0 && (delete r.multipleOf, r.type = "number", K(e, "cannot be 0", "multipleOf"));
+	let l = q.Numeric;
+	return Ap(r) || (l = q.Never), Y(l, r, e.delegate, e.path);
 }
-function kp(e) {
+function Ap(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 Ap(e, t) {
-	let n = Object.keys(t).filter((e) => !Ep.has(e) && Af(e));
-	n.length > 0 && q(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = ef(t, Ep);
-	jp(e, r, "maxLength"), jp(e, r, "minLength");
-	let i = r.maxLength, a = r.minLength, o = J.String;
-	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = J.Never), X(o, r, e.delegate, e.path);
+function jp(e, t) {
+	let n = Object.keys(t).filter((e) => !Dp.has(e) && jf(e));
+	n.length > 0 && K(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = tf(t, Dp);
+	Mp(e, r, "maxLength"), Mp(e, r, "minLength");
+	let i = r.maxLength, a = r.minLength, o = q.String;
+	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = q.Never), Y(o, r, e.delegate, e.path);
 }
-function jp(e, t, n) {
+function Mp(e, t, n) {
 	let r = t[n];
-	r !== void 0 && Number.isNaN(r) && (q(e, "found NaN", n), delete t[n]);
+	r !== void 0 && Number.isNaN(r) && (K(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Mp = Object.freeze([]);
-function Np(e, t, n, r) {
-	if (Gf(e) || t.isExtendsSchema(e)) return {
+var Np = Object.freeze([]);
+function Pp(e, t, n, r) {
+	if (Kf(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Mp
+		warns: Np
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Ef.External,
+				kind: Df.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -8597,19 +8619,19 @@ function Np(e, t, n, r) {
 		path: [],
 		errors: [],
 		warns: []
-	}, a = Q(i, e);
-	if (a) Pp(i.errors.length === 0, "found errors (it should be empty)");
-	else return Pp(i.errors.length > 0, "cannot found any errors"), i.errors;
+	}, a = Z(i, e);
+	if (a) Fp(i.errors.length === 0, "found errors (it should be empty)");
+	else return Fp(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function Pp(e, t) {
+function Fp(e, t) {
 	if (!e) throw Error(t);
 }
-function Q(e, t) {
-	if (e.extends.isExtendsSchema(t) || Gf(t)) return t;
+function Z(e, t) {
+	if (e.extends.isExtendsSchema(t) || Kf(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;
@@ -8617,58 +8639,58 @@ function Q(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = Fp(e, r);
-	return s && i && (s = sp(e, a, o, s)), s || null;
+	let s = Ip(e, r);
+	return s && i && (s = cp(e, a, o, s)), s || null;
 }
-function Fp(e, t) {
-	for (let n of rp) {
+function Ip(e, t) {
+	for (let n of ip) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => Af(e) && e !== n);
-			return i.length > 0 && q(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), ip(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => jf(e) && e !== n);
+			return i.length > 0 && K(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), ap(e, n, r) || null;
 		}
 	}
 	{
-		let n = Nf(t.not);
+		let n = Pf(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => Af(e) && e !== "not");
-			r.length > 0 && q(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = Q(Mf(e, "not"), n);
+			let r = Object.keys(t).filter((e) => jf(e) && e !== "not");
+			r.length > 0 && K(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
+			let i = Z(Nf(e, "not"), n);
 			if (!i) return null;
-			let a = J.Not;
-			switch (Y(i)) {
-				case J.Never:
-					a = J.Any;
+			let a = q.Not;
+			switch (J(i)) {
+				case q.Never:
+					a = q.Any;
 					break;
-				case J.Any: a = J.Never;
+				case q.Any: a = q.Never;
 			}
-			return X(a, { not: i }, e.delegate, e.path);
+			return Y(a, { not: i }, e.delegate, e.path);
 		}
 	}
 	if (t.type) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return ip(e, "anyOf", n.map((e) => ({
+			return ap(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return lp(e, t);
-			case "array": return Zf(e, t);
-			default: return Dp(e, t);
+			case "object": return up(e, t);
+			case "array": return Qf(e, t);
+			default: return Op(e, t);
 		}
 	}
-	return jf(t) ? X(J.Any, {}, e.delegate, e.path) : (Pf(e, "unrecognized"), null);
+	return Mf(t) ? Y(q.Any, {}, e.delegate, e.path) : (Ff(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var Ip = class {
+var Lp = 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 Lp {
+		this.keys = t, this.clazz = class extends Rp {
 			constructor(e) {
 				super(t, e);
 			}
@@ -8692,7 +8714,7 @@ var Ip = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Lp = class {
+}, Rp = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -8707,21 +8729,21 @@ var Ip = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function Rp(e) {
-	return new zp(e);
+function zp(e) {
+	return new Bp(e);
 }
-var zp = class {
+var Bp = class {
 	constructor(e) {
-		this.description = new Ip(e);
+		this.description = new Lp(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Bp(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new Vp(this.description, t);
 	}
-}, Bp = class {
+}, Vp = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -8742,7 +8764,7 @@ var zp = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of rf) if (e & a) {
+		for (let r of this.values) for (let [i, a] of af) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -8759,11 +8781,11 @@ var zp = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function Vp(e, t) {
+function Hp(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? Hp(e, t) : n.num > r.num ? Up(e, t) : Wp(e, t);
+	return n.num < r.num ? Up(e, t) : n.num > r.num ? Wp(e, t) : Gp(e, t);
 }
-function Hp(e, t) {
+function Up(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -8788,11 +8810,11 @@ function Hp(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [Gp(r), a]
+				range: [Q(r), a]
 			}), {
 				left: {
 					fromLeft: !0,
-					range: [n, Gp(i)]
+					range: [n, Q(i)]
 				},
 				center: [i, r],
 				right: t
@@ -8802,16 +8824,16 @@ function Hp(e, t) {
 	return {
 		left: {
 			fromLeft: !0,
-			range: [n, Gp(i)]
+			range: [n, Q(i)]
 		},
 		center: [i, a],
 		right: {
 			fromLeft: !0,
-			range: [Gp(a), r]
+			range: [Q(a), r]
 		}
 	};
 }
-function Up(e, t) {
+function Wp(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -8836,11 +8858,11 @@ function Up(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !0,
-				range: [Gp(a), r]
+				range: [Q(a), r]
 			}), {
 				left: {
 					fromLeft: !1,
-					range: [i, Gp(n)]
+					range: [i, Q(n)]
 				},
 				center: [n, a],
 				right: t
@@ -8850,23 +8872,23 @@ function Up(e, t) {
 	return {
 		left: {
 			fromLeft: !1,
-			range: [i, Gp(n)]
+			range: [i, Q(n)]
 		},
 		center: [n, r],
 		right: {
 			fromLeft: !1,
-			range: [Gp(r), a]
+			range: [Q(r), a]
 		}
 	};
 }
-function Wp(e, t) {
+function Gp(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, Gp(i)]
+		range: [n, Q(i)]
 	}) : o && !s && (c = {
 		fromLeft: !1,
-		range: [i, Gp(n)]
+		range: [i, Q(n)]
 	}), r.num <= a.num) {
 		let e = !0, t = !1;
 		if (r.num === a.num) {
@@ -8877,7 +8899,7 @@ function Wp(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [Gp(r), a]
+				range: [Q(r), a]
 			}), {
 				left: c,
 				center: [l, r],
@@ -8890,11 +8912,11 @@ function Wp(e, t) {
 		center: [l, a],
 		right: {
 			fromLeft: !0,
-			range: [Gp(a), r]
+			range: [Q(a), r]
 		}
 	};
 }
-function Gp(e) {
+function Q(e) {
 	return {
 		num: e.num,
 		exclusive: !e.exclusive
@@ -8903,7 +8925,7 @@ function Gp(e) {
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
 var Kp = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = Vp([{
+	let { left: a, center: o, right: s } = Hp([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -8934,13 +8956,13 @@ var Kp = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 	};
 };
 function qp({ left: e, right: t, intersection: n }) {
-	if (!n) return B.Rejection;
+	if (!n) return z.Rejection;
 	let r = !1, i = !1;
-	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? B.Intersection : r ? B.Containing : i ? B.ContainedBy : B.Equals;
+	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? z.Intersection : r ? z.Containing : i ? z.ContainedBy : z.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var Jp = Kp(0), Yp = Rp([
+var Jp = Kp(0), Yp = zp([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
@@ -8949,57 +8971,57 @@ var Jp = Kp(0), Yp = Rp([
 ]);
 function Xp({ calculate: e }, t, n) {
 	let r = Jp(t.minItems, t.maxItems, n.minItems, n.maxItems), i = qp(r);
-	if (i === B.Rejection) return W;
+	if (i === z.Rejection) return U;
 	let [a, o] = Zp(t), [s, c] = Zp(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = Yp.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 B.Equals:
+				case z.Equals:
 					n.hasRejection || (n.hasCommon = !0);
 					break;
-				case B.Containing:
+				case z.Containing:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0;
 					break;
-				case B.ContainedBy:
+				case z.ContainedBy:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra2 = !0;
 					break;
-				case B.Intersection:
+				case z.Intersection:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0, n.hasExtra2 = !0;
 					break;
-				case B.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
+				case z.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
 			}
 		});
 	}
 	d.update((e) => {
 		switch (i) {
-			case B.Containing:
+			case z.Containing:
 				e.hasExtra1 = !0;
 				break;
-			case B.ContainedBy:
+			case z.ContainedBy:
 				e.hasExtra2 = !0;
 				break;
-			case B.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
+			case z.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
 		}
 		t.uniqueItems && !n.uniqueItems && (n.maxItems ?? Infinity) > 1 ? e.hasExtra2 = !0 : !t.uniqueItems && n.uniqueItems && (t.maxItems ?? Infinity) > 1 && (e.hasExtra1 = !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 ? G : e ? H : t ? U : V : W;
+		r && (i = !1), p |= i ? e && t ? W : e ? V : t ? H : B : U;
 	}
 	return p;
 }
 function Zp({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? Hf] : [[], e ?? Hf];
+	return Array.isArray(e) ? [e, t ?? Uf] : [[], e ?? Uf];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
 function Qp(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = Wf(n);
-		return i === Wf(r) ? i ? em(t, n, r, e) : n === r : !1;
+		let i = Gf(n);
+		return i === Gf(r) ? i ? em(t, n, r, e) : n === r : !1;
 	};
 }
 function $p(e) {
@@ -9007,7 +9029,7 @@ function $p(e) {
 	return (n, r) => em(t, n, r, e);
 }
 function em(e, t, n, r) {
-	let i = `${Kf(t)}/${Kf(n)}`, a = e.get(i);
+	let i = `${qf(t)}/${qf(n)}`, a = e.get(i);
 	return a === void 0 && e.set(i, a = r(t, n)), a;
 }
 //#endregion
@@ -9016,23 +9038,23 @@ function tm(e, t, n) {
 	let r = rm(t), i = rm(n), a = !1, o = !1, s = !1;
 	for (let t of r) if (im(e, i, t) ? s = !0 : a = !0, a && s) break;
 	for (let t of i) if (im(e, r, t) ? s = !0 : o = !0, o && s) break;
-	return s ? a && o ? G : a ? H : o ? U : V : W;
+	return s ? a && o ? W : a ? V : o ? H : B : U;
 }
 function nm(e, t) {
 	let n = !1, r = !1;
 	for (let i of rm(e)) {
-		switch (op(t, i)) {
-			case Z.Valid:
+		switch (sp(t, i)) {
+			case X.Valid:
 				n = !0;
 				break;
-			case Z.Invalid:
+			case X.Invalid:
 				r = !0;
 				break;
-			case Z.Unknown: return af;
+			case X.Unknown: return of;
 		}
 		if (n && r) break;
 	}
-	return n && r ? G : n ? V | U : r ? W : Y(t) === J.Never ? V : U;
+	return n && r ? W : n ? B | H : r ? U : J(t) === q.Never ? B : H;
 }
 function rm({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
@@ -9052,7 +9074,7 @@ function am(e) {
 	}
 	let n = /* @__PURE__ */ new Map();
 	function r(e, t) {
-		let r = Kf(e), a = Kf(t);
+		let r = qf(e), a = qf(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;
@@ -9069,7 +9091,7 @@ function am(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : Gf(e) && Gf(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : Kf(e) && Kf(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
@@ -9105,18 +9127,18 @@ function um(e, t) {
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
 function dm(e, t) {
-	let { left: n, right: r, center: i } = Vp(pm(e), pm(t));
-	if (!i) return W;
+	let { left: n, right: r, center: i } = Hp(pm(e), pm(t));
+	if (!i) return U;
 	let a = !1, o = !1;
-	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? G : a ? H : o ? U : V;
+	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? W : a ? V : o ? H : B;
 }
 function fm(e, t) {
 	let n = pm(e), r = om(t);
-	if (!r) return H;
-	let i = Vp(n, r.range), a = cm(i.center, r.multipleOf), o = mm(i.left, r.multipleOf), s = mm(i.right, r.multipleOf);
-	if (!i.center) return W;
+	if (!r) return V;
+	let i = Hp(n, r.range), a = cm(i.center, r.multipleOf), o = mm(i.left, r.multipleOf), s = mm(i.right, r.multipleOf);
+	if (!i.center) return U;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !sm(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? G : c ? H : l ? U : V;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !sm(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? W : c ? V : l ? H : B;
 }
 function pm(e) {
 	let t, n;
@@ -9147,16 +9169,16 @@ function mm(e, t) {
 //#region src/json-schema-subset/checker/numeric/integer.ts
 function hm(e, t) {
 	let n = om(e), r = om(t);
-	if (!n && !r) return V;
-	if (!n) return U;
-	if (!r) return H;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Vp(i, o), l, u = 0;
-	if (c.center && (u = _m(a, s), l = cm(c.center, u)), !l) return W;
+	if (!n && !r) return B;
+	if (!n) return H;
+	if (!r) return V;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Hp(i, o), l, u = 0;
+	if (c.center && (u = _m(a, s), l = cm(c.center, u)), !l) return U;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && cm(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && cm(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= gm(n, l, u), f ||= gm(r, l, u), d && f ? G : d ? H : f ? U : V;
+	return p && cm(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && cm(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= gm(n, l, u), f ||= gm(r, l, u), d && f ? W : d ? V : f ? H : B;
 }
 function gm({ range: e, multipleOf: t }, n, r) {
-	let i = Vp(e, n);
+	let i = Hp(e, n);
 	if (cm(i.left?.range, t) || cm(i.right?.range, t)) return !0;
 	let a = cm(i.center, t);
 	if (!a) return !1;
@@ -9177,9 +9199,9 @@ function ym(e) {
 //#endregion
 //#region src/json-schema-subset/checker/numeric/checker.ts
 function bm(e, t) {
-	if (xm(e) || xm(t)) return af;
+	if (xm(e) || xm(t)) return of;
 	let n = Sm(e), r = Sm(t);
-	return n && r ? dm(e, t) : n ? fm(e, t) : r ? hf(fm(t, e)) : hm(e, t);
+	return n && r ? dm(e, t) : n ? fm(e, t) : r ? gf(fm(t, e)) : hm(e, t);
 }
 function xm(e) {
 	let { multipleOf: t } = e;
@@ -9191,7 +9213,7 @@ function Sm(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/object.ts
-var Cm = Kp(0), wm = Rp([
+var Cm = Kp(0), wm = zp([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
@@ -9199,9 +9221,9 @@ var Cm = Kp(0), wm = Rp([
 	"hasRejection"
 ]);
 function Tm(e, t, n) {
-	if (Em(t, n)) return W;
+	if (Em(t, n)) return U;
 	let r = Dm(t, n);
-	if (!r) return W;
+	if (!r) return U;
 	let i = Nm(t), a = Nm(n), o = (t) => {
 		let n = i(t), r = a(t);
 		return Pm(n, r) ? e.calculate(n, r) : 0;
@@ -9216,7 +9238,7 @@ function Tm(e, t, n) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? Hf, a = n.additionalProperties ?? Hf;
+		let i = t.additionalProperties ?? Uf, a = n.additionalProperties ?? Uf;
 		if (Pm(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
@@ -9226,11 +9248,11 @@ function Tm(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 ? W : e && t ? G : e ? H : t ? U : V;
+	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? U : e && t ? W : e ? V : t ? H : B;
 	return m;
 }
 function Em(e, t) {
-	return qp(Cm(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === B.Rejection;
+	return qp(Cm(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === z.Rejection;
 }
 function Dm(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;
@@ -9258,61 +9280,61 @@ function Om(e, t) {
 }
 var km = (e, t) => {
 	switch (e) {
-		case B.Equals:
+		case z.Equals:
 			t.hasCommonInRequired = !0;
 			break;
-		case B.Containing:
+		case z.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case B.ContainedBy:
+		case z.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case B.Intersection:
+		case z.Intersection:
 			t.hasExtra1 = !0, t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case B.Rejection: t.hasRejection = !0;
+		case z.Rejection: t.hasRejection = !0;
 	}
 }, Am = (e, t) => {
 	switch (e) {
-		case B.Equals:
-		case B.ContainedBy:
+		case z.Equals:
+		case z.ContainedBy:
 			t.hasCommonInRequired = !0;
 			break;
-		case B.Intersection:
-		case B.Containing:
+		case z.Intersection:
+		case z.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case B.Rejection: t.hasRejection = !0;
+		case z.Rejection: t.hasRejection = !0;
 	}
 }, jm = (e, t) => {
 	switch (e) {
-		case B.Equals:
-		case B.Containing:
+		case z.Equals:
+		case z.Containing:
 			t.hasCommonInRequired = !0;
 			break;
-		case B.Intersection:
-		case B.ContainedBy:
+		case z.Intersection:
+		case z.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case B.Rejection: t.hasRejection = !0;
+		case z.Rejection: t.hasRejection = !0;
 	}
 }, Mm = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
-		case B.Equals:
+		case z.Equals:
 			o = !0;
 			break;
-		case B.Containing:
+		case z.Containing:
 			i = !0, o = !0;
 			break;
-		case B.ContainedBy:
+		case z.ContainedBy:
 			a = !0, o = !0;
 			break;
-		case B.Intersection:
+		case z.Intersection:
 			i = !0, a = !0, o = !0;
 			break;
-		case B.Rejection: i = !0, a = !0;
+		case z.Rejection: i = !0, a = !0;
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
@@ -9326,40 +9348,40 @@ function Nm(e) {
 		});
 	}
 	return (e) => {
-		if (n && op(n, e) === Z.Invalid) return Uf;
+		if (n && sp(n, e) === X.Invalid) return Wf;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || Hf;
+		return ((t && t[e]) ?? r) || Uf;
 	};
 }
 function Pm(e, t) {
-	let n = Y(e), r = Y(t);
-	return n !== J.Never || r !== J.Never;
+	let n = J(e), r = J(t);
+	return n !== q.Never || r !== q.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
 var Fm = Kp(0);
 function Im(e, t) {
-	if (t.format && !e.format) return H;
-	if (e.format && t.format && e.format !== t.format) return af;
+	if (t.format && !e.format) return V;
+	if (e.format && t.format && e.format !== t.format) return of;
 	let n = qp(Fm(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
-		case B.Rejection: return W;
-		case B.Containing: return r ? af : H;
-		case B.ContainedBy: return i ? af : U;
-		case B.Equals: return r && i ? e.pattern === t.pattern ? V : af : r ? V | U : i ? V | H : V;
-		case B.Intersection: return r && i ? af : r ? G | W | U : i ? G | W | H : G;
+		case z.Rejection: return U;
+		case z.Containing: return r ? of : V;
+		case z.ContainedBy: return i ? of : H;
+		case z.Equals: return r && i ? e.pattern === t.pattern ? B : of : r ? B | H : i ? B | V : B;
+		case z.Intersection: return r && i ? of : r ? W | U | H : i ? W | U | V : W;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
 function Lm(e, t, n) {
 	let r = {}, i = [], a = $p(zm(e, r)), o = Rm(), s = am(e);
-	r.isEquals = Qp(nf), r.calculate = wf({
+	r.isEquals = Qp(rf), r.calculate = Tf({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!Vm(r ? hf(n) : n)) return;
+			if (!Vm(r ? gf(n) : n)) return;
 			let a = r ? Hm(t, e) : Hm(e, t);
 			a && i.push(a);
 		}
@@ -9372,93 +9394,93 @@ function Lm(e, t, n) {
 }
 var Rm = () => (e) => {
 	let t;
-	switch (Y(e)) {
-		case J.Not:
+	switch (J(e)) {
+		case q.Not:
 			t = {
-				kind: Cf.Not,
+				kind: wf.Not,
 				expression: e.not
 			};
 			break;
-		case J.Combination:
+		case q.Combination:
 			if ("allOf" in e) t = {
-				kind: Cf.AllOf,
-				expressions: Bm(e.allOf, J.Any)
+				kind: wf.AllOf,
+				expressions: Bm(e.allOf, q.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: Cf.AnyOf,
-				expressions: Bm(e.anyOf, J.Never)
+				kind: wf.AnyOf,
+				expressions: Bm(e.anyOf, q.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: Cf.OneOf,
-				expressions: Bm(e.oneOf, J.Never)
+				kind: wf.OneOf,
+				expressions: Bm(e.oneOf, q.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: Cf.Leaf };
+		default: t = { kind: wf.Leaf };
 	}
 	return t;
 }, zm = (e, t) => (n, r) => {
-	let i = Y(n), a = Y(r);
-	if (i === J.Extends || a === J.Extends) return e.calculate(n, r);
+	let i = J(n), a = J(r);
+	if (i === q.Extends || a === q.Extends) return e.calculate(n, r);
 	switch (i) {
-		case J.Any: return a === J.Any ? V : H;
-		case J.Never: return a === J.Never ? V : U;
+		case q.Any: return a === q.Any ? B : V;
+		case q.Never: return a === q.Never ? B : H;
 	}
 	switch (a) {
-		case J.Any: return U;
-		case J.Never: return H;
+		case q.Any: return H;
+		case q.Never: return V;
 	}
-	if (i === J.EnumOrConst && a === J.EnumOrConst) return tm(t, n, r);
-	if (i === J.EnumOrConst) return nm(n, r);
-	if (a === J.EnumOrConst) return hf(nm(r, n));
-	if (i !== a) return W;
+	if (i === q.EnumOrConst && a === q.EnumOrConst) return tm(t, n, r);
+	if (i === q.EnumOrConst) return nm(n, r);
+	if (a === q.EnumOrConst) return gf(nm(r, n));
+	if (i !== a) return U;
 	switch (i) {
-		case J.Null: return V;
-		case J.Numeric: return bm(n, r);
-		case J.String: return Im(n, r);
-		case J.Boolean: return V;
-		case J.Object: return Tm(t, n, r);
-		case J.Array: return Xp(t, n, r);
+		case q.Null: return B;
+		case q.Numeric: return bm(n, r);
+		case q.String: return Im(n, r);
+		case q.Boolean: return B;
+		case q.Object: return Tm(t, n, r);
+		case q.Array: return Xp(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
 function Bm(e, t) {
-	return e.filter((e) => Y(e) !== t);
+	return e.filter((e) => J(e) !== t);
 }
 function Vm(e) {
-	return !of(e) && !cf(e) && (sf(e) || uf(e) || lf(e));
+	return !sf(e) && !lf(e) && (cf(e) || df(e) || uf(e));
 }
 function Hm(e, t) {
-	let n = qf(t);
+	let n = Jf(t);
 	if (!n) return;
-	let r = Y(e), i = Y(t);
+	let r = J(e), i = J(t);
 	if (r !== i) return [...n, "type"];
 	let a = e, o = t;
 	switch (i) {
-		case J.String:
+		case q.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"];
 			if (a.format !== o.format && o.format) return [...n, "format"];
 			break;
-		case J.Numeric:
+		case q.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 J.Array:
+		case q.Array:
 			if ((a.minItems ?? 0) < (o.minItems ?? 0)) return [...n, "minItems"];
 			if ((a.maxItems ?? Infinity) > (o.maxItems ?? Infinity)) return [...n, "maxItems"];
 			if (!a.uniqueItems && o.uniqueItems) return [...n, "uniqueItems"];
 			break;
-		case J.Object: {
+		case q.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 J.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
+		case q.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
 	}
 	return n;
 }
@@ -9469,7 +9491,7 @@ var Um = class e {
 		this.extendsSchemaClasses = Object.freeze([...e]);
 	}
 	tryCompiledExtendsSchema(e, t) {
-		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(Qd(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n($d(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -9479,7 +9501,7 @@ var Um = 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 |= df(t);
+		for (let t of a) r && (t = e.swap(t)), i |= ff(t);
 		return i;
 	}
 	equals(e, t) {
@@ -9491,8 +9513,8 @@ var Um = class e {
 	}
 	static swap(e) {
 		switch (e) {
-			case B.Containing: return B.ContainedBy;
-			case B.ContainedBy: return B.Containing;
+			case z.Containing: return z.ContainedBy;
+			case z.ContainedBy: return z.Containing;
 			default: return e;
 		}
 	}
@@ -9503,12 +9525,12 @@ function Wm(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw Km(e, r, "$"), new Tf(e);
+		throw Km(e, r, "$"), new Ef(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(Df(e));
+		for (let e of a) console.warn(Of(e));
 	}
 	return i;
 }
@@ -9516,14 +9538,14 @@ function Gm(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) && Km(e, i, "$1"), Array.isArray(a) && Km(e, a, "$2"), new Tf(e);
+		throw Array.isArray(i) && Km(e, i, "$1"), Array.isArray(a) && Km(e, a, "$2"), new Ef(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(Df(e));
+		for (let e of s) console.warn(Of(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Df(e));
+		for (let e of l) console.warn(Of(e));
 	}
 	return [o, c];
 }
@@ -9546,9 +9568,9 @@ var qm = Object.freeze({
 function Jm({ extendsSchemaClasses: e, delegate: t } = {}) {
 	let n = new Um(e);
 	return Object.freeze({
-		compile: (e, r, i) => Wm(e, (e) => Np(e, n, r, t), i),
+		compile: (e, r, i) => Wm(e, (e) => Pp(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = Gm(e, r, (e) => Np(e, n, void 0, t), i), { errorPath: s, expression: c } = Lm(n, a, o), l = of(c) || cf(c), u = sf(c) || uf(c) || lf(c);
+			let [a, o] = Gm(e, r, (e) => Pp(e, n, void 0, t), i), { errorPath: s, expression: c } = Lm(n, a, o), l = sf(c) || lf(c), u = cf(c) || df(c) || uf(c);
 			return l && !u ? { result: qm.True } : !l && u ? {
 				errorPath: s,
 				result: qm.False
@@ -9579,7 +9601,7 @@ var rh = class e {
 		this.id = e, this.value = t, this.context = nh(n);
 	}
 	compare(e) {
-		return Gf(e) && Y(e) === J.Any ? [B.ContainedBy] : this.compareImpl(e);
+		return Kf(e) && J(e) === q.Any ? [z.ContainedBy] : this.compareImpl(e);
 	}
 }, ih = class e extends rh {
 	static isMatch(e) {
@@ -9591,13 +9613,13 @@ var rh = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (eh(t)) return [B.ContainedBy];
+		if (eh(t)) return [z.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.enum), n = B.Equals;
-			for (let r of t.value.enum) e.has(r) || (n = B.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [B.Rejection] : [B.Intersection];
+			let e = new Set(this.value.enum), n = z.Equals;
+			for (let r of t.value.enum) e.has(r) || (n = z.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [z.Rejection] : [z.Intersection];
 		}
-		return [B.Rejection];
+		return [z.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -9619,7 +9641,7 @@ var rh = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [B.Equals] : (rh.setError(this, t, "edgeError.binDiffType"), [B.Rejection]);
+		return t instanceof e ? [z.Equals] : (rh.setError(this, t, "edgeError.binDiffType"), [z.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
@@ -9633,7 +9655,7 @@ var rh = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [B.Equals] : (rh.setError(this, t, "edgeError.artifactDiffType"), [B.Rejection]);
+		return t instanceof e ? [z.Equals] : (rh.setError(this, t, "edgeError.artifactDiffType"), [z.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
@@ -9661,7 +9683,7 @@ function uh(e, t) {
 		let t = lh.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 Xd(structuredClone(n), r), lh.set(n, t);
+			t = new Zd(structuredClone(n), r), lh.set(n, t);
 		}
 		return t.validate(e).valid;
 	} catch {
@@ -11574,7 +11596,7 @@ function x_(e) {
 }
 async function S_(e, t, n, r, i) {
 	return {
-		dedupeKey: t.deleted == null ? `${e}:${t.eTag ?? t.lastModifiedDateTime}` : await du(uu([
+		dedupeKey: t.deleted == null ? `${e}:${t.eTag ?? t.lastModifiedDateTime}` : await fu(du([
 			"one-drive-deleted",
 			i,
 			e
@@ -13626,32 +13648,328 @@ var Iy = {
 		}
 	}
 }, Ry = {
-	"zh-CN": () => import("./zh-CN-D2od3TNw.js"),
+	en: {
+		"feishu_app_bot.on_event": {
+			sourceId: "Event source",
+			eventTypes: "Events to receive"
+		},
+		"airtable.on_record_changed": {
+			baseId: "Base",
+			tableIdOrName: "Table",
+			triggerField: "Trigger field"
+		},
+		"github.on_repo_event": {
+			events: "Events",
+			owner: "Repository owner",
+			repo: "Repository"
+		},
+		"github.watch_pull_request": {
+			owner: "Repository owner",
+			repo: "Repository",
+			number: "Pull request number"
+		},
+		"gitlab.on_project_event": {
+			events: "Events",
+			project: "Project"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "Calendar" },
+		"googledrive.on_file_change": {
+			changeType: "Change type",
+			folderId: "Folder"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "Worksheet",
+			spreadsheetId: "Spreadsheet"
+		},
+		"linear.on_issue_changed": { teamId: "Team" },
+		"notion.on_database_page_event": { databaseId: "Database" },
+		"shopify.on_shop_event": { topics: "Topics" },
+		"slack.on_message_posted": { channelId: "Channel" },
+		"stripe.on_event": { events: "Events" },
+		"telegram.on_update": { updates: "Updates" },
+		"woocommerce.on_store_event": { events: "Events" },
+		"zendesk.on_event": { events: "Events" }
+	},
+	"zh-CN": {
+		"feishu_app_bot.on_event": {
+			sourceId: "事件源",
+			eventTypes: "接收的事件"
+		},
+		"airtable.on_record_changed": {
+			baseId: "Base",
+			tableIdOrName: "数据表",
+			triggerField: "触发字段"
+		},
+		"github.on_repo_event": {
+			events: "事件",
+			owner: "仓库所有者",
+			repo: "仓库"
+		},
+		"github.watch_pull_request": {
+			owner: "仓库所有者",
+			repo: "仓库",
+			number: "拉取请求编号"
+		},
+		"gitlab.on_project_event": {
+			events: "事件",
+			project: "项目"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "日历" },
+		"googledrive.on_file_change": {
+			changeType: "变更类型",
+			folderId: "文件夹"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "工作表",
+			spreadsheetId: "电子表格"
+		},
+		"linear.on_issue_changed": { teamId: "团队" },
+		"notion.on_database_page_event": { databaseId: "数据库" },
+		"shopify.on_shop_event": { topics: "主题" },
+		"slack.on_message_posted": { channelId: "频道" },
+		"stripe.on_event": { events: "事件" },
+		"telegram.on_update": { updates: "更新类型" },
+		"woocommerce.on_store_event": { events: "事件" },
+		"zendesk.on_event": { events: "事件" }
+	},
+	"zh-TW": {
+		"feishu_app_bot.on_event": {
+			sourceId: "事件來源",
+			eventTypes: "接收的事件"
+		},
+		"airtable.on_record_changed": {
+			baseId: "Base",
+			tableIdOrName: "資料表",
+			triggerField: "觸發欄位"
+		},
+		"github.on_repo_event": {
+			events: "事件",
+			owner: "儲存庫擁有者",
+			repo: "儲存庫"
+		},
+		"github.watch_pull_request": {
+			owner: "儲存庫擁有者",
+			repo: "儲存庫",
+			number: "提取要求編號"
+		},
+		"gitlab.on_project_event": {
+			events: "事件",
+			project: "專案"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "日曆" },
+		"googledrive.on_file_change": {
+			changeType: "變更類型",
+			folderId: "資料夾"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "工作表",
+			spreadsheetId: "試算表"
+		},
+		"linear.on_issue_changed": { teamId: "團隊" },
+		"notion.on_database_page_event": { databaseId: "資料庫" },
+		"shopify.on_shop_event": { topics: "主題" },
+		"slack.on_message_posted": { channelId: "頻道" },
+		"stripe.on_event": { events: "事件" },
+		"telegram.on_update": { updates: "更新類型" },
+		"woocommerce.on_store_event": { events: "事件" },
+		"zendesk.on_event": { events: "事件" }
+	},
+	ja: {
+		"feishu_app_bot.on_event": {
+			sourceId: "イベントソース",
+			eventTypes: "受信するイベント"
+		},
+		"airtable.on_record_changed": {
+			baseId: "ベース",
+			tableIdOrName: "テーブル",
+			triggerField: "トリガーフィールド"
+		},
+		"github.on_repo_event": {
+			events: "イベント",
+			owner: "リポジトリの所有者",
+			repo: "リポジトリ"
+		},
+		"github.watch_pull_request": {
+			owner: "リポジトリの所有者",
+			repo: "リポジトリ",
+			number: "プルリクエスト番号"
+		},
+		"gitlab.on_project_event": {
+			events: "イベント",
+			project: "プロジェクト"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "カレンダー" },
+		"googledrive.on_file_change": {
+			changeType: "変更の種類",
+			folderId: "フォルダー"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "シート",
+			spreadsheetId: "スプレッドシート"
+		},
+		"linear.on_issue_changed": { teamId: "チーム" },
+		"notion.on_database_page_event": { databaseId: "データベース" },
+		"shopify.on_shop_event": { topics: "トピック" },
+		"slack.on_message_posted": { channelId: "チャンネル" },
+		"stripe.on_event": { events: "イベント" },
+		"telegram.on_update": { updates: "更新の種類" },
+		"woocommerce.on_store_event": { events: "イベント" },
+		"zendesk.on_event": { events: "イベント" }
+	},
+	ko: {
+		"feishu_app_bot.on_event": {
+			sourceId: "이벤트 소스",
+			eventTypes: "수신할 이벤트"
+		},
+		"airtable.on_record_changed": {
+			baseId: "베이스",
+			tableIdOrName: "테이블",
+			triggerField: "트리거 필드"
+		},
+		"github.on_repo_event": {
+			events: "이벤트",
+			owner: "저장소 소유자",
+			repo: "저장소"
+		},
+		"github.watch_pull_request": {
+			owner: "저장소 소유자",
+			repo: "저장소",
+			number: "풀 리퀘스트 번호"
+		},
+		"gitlab.on_project_event": {
+			events: "이벤트",
+			project: "프로젝트"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "캘린더" },
+		"googledrive.on_file_change": {
+			changeType: "변경 유형",
+			folderId: "폴더"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "시트",
+			spreadsheetId: "스프레드시트"
+		},
+		"linear.on_issue_changed": { teamId: "팀" },
+		"notion.on_database_page_event": { databaseId: "데이터베이스" },
+		"shopify.on_shop_event": { topics: "주제" },
+		"slack.on_message_posted": { channelId: "채널" },
+		"stripe.on_event": { events: "이벤트" },
+		"telegram.on_update": { updates: "업데이트 유형" },
+		"woocommerce.on_store_event": { events: "이벤트" },
+		"zendesk.on_event": { events: "이벤트" }
+	},
+	ru: {
+		"feishu_app_bot.on_event": {
+			sourceId: "Источник событий",
+			eventTypes: "Принимаемые события"
+		},
+		"airtable.on_record_changed": {
+			baseId: "База",
+			tableIdOrName: "Таблица",
+			triggerField: "Поле триггера"
+		},
+		"github.on_repo_event": {
+			events: "События",
+			owner: "Владелец репозитория",
+			repo: "Репозиторий"
+		},
+		"github.watch_pull_request": {
+			owner: "Владелец репозитория",
+			repo: "Репозиторий",
+			number: "Номер запроса на слияние"
+		},
+		"gitlab.on_project_event": {
+			events: "События",
+			project: "Проект"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "Календарь" },
+		"googledrive.on_file_change": {
+			changeType: "Тип изменения",
+			folderId: "Папка"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "Лист",
+			spreadsheetId: "Таблица"
+		},
+		"linear.on_issue_changed": { teamId: "Команда" },
+		"notion.on_database_page_event": { databaseId: "База данных" },
+		"shopify.on_shop_event": { topics: "Темы" },
+		"slack.on_message_posted": { channelId: "Канал" },
+		"stripe.on_event": { events: "События" },
+		"telegram.on_update": { updates: "Типы обновлений" },
+		"woocommerce.on_store_event": { events: "События" },
+		"zendesk.on_event": { events: "События" }
+	},
+	fr: {
+		"feishu_app_bot.on_event": {
+			sourceId: "Source d’événements",
+			eventTypes: "Événements à recevoir"
+		},
+		"airtable.on_record_changed": {
+			baseId: "Base",
+			tableIdOrName: "Table",
+			triggerField: "Champ déclencheur"
+		},
+		"github.on_repo_event": {
+			events: "Événements",
+			owner: "Propriétaire du dépôt",
+			repo: "Dépôt"
+		},
+		"github.watch_pull_request": {
+			owner: "Propriétaire du dépôt",
+			repo: "Dépôt",
+			number: "Numéro de la demande de tirage"
+		},
+		"gitlab.on_project_event": {
+			events: "Événements",
+			project: "Projet"
+		},
+		"googlecalendar.on_event_changed": { calendarId: "Agenda" },
+		"googledrive.on_file_change": {
+			changeType: "Type de modification",
+			folderId: "Dossier"
+		},
+		"googlesheets.on_row_added": {
+			sheet: "Feuille",
+			spreadsheetId: "Feuille de calcul"
+		},
+		"linear.on_issue_changed": { teamId: "Équipe" },
+		"notion.on_database_page_event": { databaseId: "Base de données" },
+		"shopify.on_shop_event": { topics: "Sujets" },
+		"slack.on_message_posted": { channelId: "Canal" },
+		"stripe.on_event": { events: "Événements" },
+		"telegram.on_update": { updates: "Types de mise à jour" },
+		"woocommerce.on_store_event": { events: "Événements" },
+		"zendesk.on_event": { events: "Événements" }
+	}
+}, zy = {
+	"zh-CN": () => import("./zh-CN-CxZ3yYfR.js"),
 	"zh-TW": () => import("./zh-TW-CRmc3FMz.js"),
 	ja: () => import("./ja-BJF-VrP2.js"),
 	ko: () => import("./ko-Bght_VaB.js"),
 	ru: () => import("./ru-DrP4BRM5.js"),
 	fr: () => import("./fr-ClB96SQY.js")
-}, zy = /* @__PURE__ */ new Map(), By = Promise.resolve({});
-function Vy(e) {
-	if (e == "en") return By;
-	let t = zy.get(e);
+}, By = /* @__PURE__ */ new Map(), Vy = Promise.resolve({});
+function Hy(e) {
+	if (e == "en") return Vy;
+	let t = By.get(e);
 	if (t != null) return t;
-	let n = Ry[e]().then((e) => e.default);
-	return zy.set(e, n), n.catch(() => {
-		zy.get(e) == n && zy.delete(e);
+	let n = zy[e]().then((e) => e.default);
+	return By.set(e, n), n.catch(() => {
+		By.get(e) == n && By.delete(e);
 	}), n;
 }
-async function Hy(e, t) {
-	let n = (await Vy(t))[e.key], r = Ly[e.key];
+async function Uy(e, t) {
+	let n = (await Hy(t))[e.key], r = Ly[e.key];
 	return {
-		configInputs: Uy(e.configInputs, n?.configInputs, r?.configInputs),
+		configInputs: Wy(e.configInputs, n?.configInputs, r?.configInputs),
+		configInputLabels: Ry[t][e.key] ?? {},
 		displayName: n?.displayName ?? e.displayName,
 		description: n?.description ?? e.description,
-		outputs: Uy(e.outputs, n?.outputs, r?.outputs)
+		outputs: Wy(e.outputs, n?.outputs, r?.outputs)
 	};
 }
-function Uy(e, t, n) {
+function Wy(e, t, n) {
 	return Object.fromEntries(e.flatMap((e) => {
 		if (!("handle" in e)) return [];
 		let r = t?.[e.handle] ?? n?.[e.handle] ?? e.description;
@@ -13660,14 +13978,14 @@ function Uy(e, t, n) {
 }
 //#endregion
 //#region src/trigger/providers/definitions.ts
-var Wy = [
+var Gy = [
 	...f,
 	re,
-	Nu,
+	Pu,
 	Ne,
-	mu,
-	vu,
-	Qu,
+	hu,
+	yu,
+	$u,
 	Sh,
 	Gh,
 	Xh,
@@ -13682,6 +14000,6 @@ var Wy = [
 	Kv,
 	iy,
 	Sy
-], Gy = Wy.filter((e) => e.snapshot.type == "poll"), Ky = Wy.filter((e) => e.snapshot.type == "integration");
+], Ky = Gy.filter((e) => e.snapshot.type == "poll"), qy = Gy.filter((e) => e.snapshot.type == "integration");
 //#endregion
-export { d as feishuResponse, u as feishuSubscriptions, Ky as integrationDefinitions, Hy as localizeTrigger, te as matchesFeishuEvent, Gy as pollDefinitions, h as receiveFeishuEvent, Wy as triggerDefinitions };
+export { d as feishuResponse, u as feishuSubscriptions, qy as integrationDefinitions, Uy as localizeTrigger, te as matchesFeishuEvent, Ky as pollDefinitions, h as receiveFeishuEvent, Gy as triggerDefinitions };