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

package/dist/common/integration-trigger.js

@@ -139,55 +139,55 @@ var l = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, u = [
 	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));
 }, oe = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, se = /^((([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, ce = (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 h(e) {
+function le(e) {
 	return e.test.bind(e);
 }
-var le = {
-	date: de,
-	time: fe.bind(void 0, !1),
-	"date-time": me,
+var ue = {
+	date: fe,
+	time: pe.bind(void 0, !1),
+	"date-time": he,
 	duration: ce,
-	uri: _e,
-	"uri-reference": h(p),
-	"uri-template": h(m),
-	url: h(ee),
+	uri: ve,
+	"uri-reference": le(p),
+	"uri-template": le(m),
+	url: le(ee),
 	email: ae,
-	hostname: h(f),
-	ipv4: h(oe),
-	ipv6: h(se),
-	regex: ye,
-	uuid: h(te),
-	"json-pointer": h(ne),
-	"json-pointer-uri-fragment": h(re),
-	"relative-json-pointer": h(ie)
+	hostname: le(f),
+	ipv4: le(oe),
+	ipv6: le(se),
+	regex: be,
+	uuid: le(te),
+	"json-pointer": le(ne),
+	"json-pointer-uri-fragment": le(re),
+	"relative-json-pointer": le(ie)
 };
-function ue(e) {
+function de(e) {
 	return e % 4 == 0 && (e % 100 != 0 || e % 400 == 0);
 }
-function de(e) {
+function fe(e) {
 	let t = e.match(l);
 	if (!t) return !1;
 	let n = +t[1], r = +t[2], i = +t[3];
-	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && ue(n) ? 29 : u[r]);
+	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && de(n) ? 29 : u[r]);
 }
-function fe(e, t) {
+function pe(e, t) {
 	let n = t.match(d);
 	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 pe = /t|\s/i;
-function me(e) {
-	let t = e.split(pe);
-	return t.length == 2 && de(t[0]) && fe(!0, t[1]);
+var me = /t|\s/i;
+function he(e) {
+	let t = e.split(me);
+	return t.length == 2 && fe(t[0]) && pe(!0, t[1]);
 }
-var he = /\/|:/, ge = /^(?:[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 _e(e) {
-	return he.test(e) && ge.test(e);
+var ge = /\/|:/, _e = /^(?:[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 ve(e) {
+	return ge.test(e) && _e.test(e);
 }
-var ve = /[^\\]\\Z/;
-function ye(e) {
-	if (ve.test(e)) return !1;
+var ye = /[^\\]\\Z/;
+function be(e) {
+	if (ye.test(e)) return !1;
 	try {
 		return new RegExp(e, "u"), !0;
 	} catch {
@@ -196,14 +196,14 @@ function ye(e) {
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/ucs2-length.js
-function be(e) {
+function xe(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 g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d = Object.create(null)) {
+function h(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d = Object.create(null)) {
 	if (r === !0) return {
 		valid: !0,
 		errors: []
@@ -229,10 +229,10 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 			break;
 		default: throw Error(`Instances of "${f}" type are not supported.`);
 	}
-	let { $ref: m, $recursiveRef: ee, $recursiveAnchor: te, type: ne, const: re, enum: ie, required: ae, not: oe, anyOf: se, allOf: ce, oneOf: h, if: ue, then: de, else: fe, format: pe, properties: me, patternProperties: he, additionalProperties: ge, unevaluatedProperties: _e, minProperties: ve, maxProperties: ye, propertyNames: xe, dependentRequired: Se, dependentSchemas: Ce, dependencies: we, prefixItems: Te, items: Ee, additionalItems: De, unevaluatedItems: _, contains: v, minContains: y, maxContains: b, minItems: x, maxItems: S, uniqueItems: Oe, minimum: C, maximum: ke, exclusiveMinimum: Ae, exclusiveMaximum: je, multipleOf: Me, minLength: Ne, maxLength: Pe, pattern: Fe, __absolute_ref__: Ie, __absolute_recursive_ref__: w } = r, T = [];
+	let { $ref: m, $recursiveRef: ee, $recursiveAnchor: te, type: ne, const: re, enum: ie, required: ae, not: oe, anyOf: se, allOf: ce, oneOf: le, if: de, then: fe, else: pe, format: me, properties: he, patternProperties: ge, additionalProperties: _e, unevaluatedProperties: ve, minProperties: ye, maxProperties: be, propertyNames: Se, dependentRequired: Ce, dependentSchemas: we, dependencies: Te, prefixItems: Ee, items: De, additionalItems: Oe, unevaluatedItems: g, contains: _, minContains: v, maxContains: y, minItems: b, maxItems: x, uniqueItems: ke, minimum: S, maximum: Ae, exclusiveMinimum: je, exclusiveMaximum: Me, multipleOf: Ne, minLength: Pe, maxLength: Fe, pattern: Ie, __absolute_ref__: Le, __absolute_recursive_ref__: C } = r, w = [];
 	if (te === !0 && s === null && (s = r), ee === "#") {
-		let t = s === null ? a[w] : s, n = `${u}/$recursiveRef`, c = g(e, s === null ? r : s, i, a, o, t, l, n, d);
-		c.valid || T.push({
+		let t = s === null ? a[C] : s, n = `${u}/$recursiveRef`, c = h(e, s === null ? r : s, i, a, o, t, l, n, d);
+		c.valid || w.push({
 			instanceLocation: l,
 			keyword: "$recursiveRef",
 			keywordLocation: n,
@@ -240,20 +240,20 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 		}, ...c.errors);
 	}
 	if (m !== void 0) {
-		let t = a[Ie || m];
+		let t = a[Le || m];
 		if (t === void 0) {
 			let e = `Unresolved $ref "${m}".`;
-			throw Ie && Ie !== m && (e += `  Absolute URI "${Ie}".`), e += `\nKnown schemas:\n- ${Object.keys(a).join("\n- ")}`, Error(e);
+			throw Le && Le !== m && (e += `  Absolute URI "${Le}".`), e += `\nKnown schemas:\n- ${Object.keys(a).join("\n- ")}`, Error(e);
 		}
-		let n = `${u}/$ref`, r = g(e, t, i, a, o, s, l, n, d);
-		if (r.valid || T.push({
+		let n = `${u}/$ref`, r = h(e, t, i, a, o, s, l, n, d);
+		if (r.valid || w.push({
 			instanceLocation: l,
 			keyword: "$ref",
 			keywordLocation: n,
 			error: "A subschema had errors."
 		}, ...r.errors), i === "4" || i === "7") return {
-			valid: T.length === 0,
-			errors: T
+			valid: w.length === 0,
+			errors: w
 		};
 	}
 	if (Array.isArray(ne)) {
@@ -262,60 +262,60 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 			n = !0;
 			break;
 		}
-		n || T.push({
+		n || w.push({
 			instanceLocation: l,
 			keyword: "type",
 			keywordLocation: `${u}/type`,
 			error: `Instance type "${p}" is invalid. Expected "${ne.join("\", \"")}".`
 		});
-	} else ne === "integer" ? (p !== "number" || e % 1 || e !== e) && T.push({
+	} else ne === "integer" ? (p !== "number" || e % 1 || e !== e) && w.push({
 		instanceLocation: l,
 		keyword: "type",
 		keywordLocation: `${u}/type`,
 		error: `Instance type "${p}" is invalid. Expected "${ne}".`
-	}) : ne !== void 0 && p !== ne && T.push({
+	}) : ne !== void 0 && p !== ne && w.push({
 		instanceLocation: l,
 		keyword: "type",
 		keywordLocation: `${u}/type`,
 		error: `Instance type "${p}" is invalid. Expected "${ne}".`
 	});
-	if (re !== void 0 && (p === "object" || p === "array" ? t(e, re) || T.push({
+	if (re !== void 0 && (p === "object" || p === "array" ? t(e, re) || w.push({
 		instanceLocation: l,
 		keyword: "const",
 		keywordLocation: `${u}/const`,
 		error: `Instance does not match ${JSON.stringify(re)}.`
-	}) : e !== re && T.push({
+	}) : e !== re && w.push({
 		instanceLocation: l,
 		keyword: "const",
 		keywordLocation: `${u}/const`,
 		error: `Instance does not match ${JSON.stringify(re)}.`
-	})), ie !== void 0 && (p === "object" || p === "array" ? ie.some((n) => t(e, n)) || T.push({
+	})), ie !== void 0 && (p === "object" || p === "array" ? ie.some((n) => t(e, n)) || w.push({
 		instanceLocation: l,
 		keyword: "enum",
 		keywordLocation: `${u}/enum`,
 		error: `Instance does not match any of ${JSON.stringify(ie)}.`
-	}) : ie.some((t) => e === t) || T.push({
+	}) : ie.some((t) => e === t) || w.push({
 		instanceLocation: l,
 		keyword: "enum",
 		keywordLocation: `${u}/enum`,
 		error: `Instance does not match any of ${JSON.stringify(ie)}.`
 	})), oe !== void 0) {
 		let t = `${u}/not`;
-		g(e, oe, i, a, o, s, l, t).valid && T.push({
+		h(e, oe, i, a, o, s, l, t).valid && w.push({
 			instanceLocation: l,
 			keyword: "not",
 			keywordLocation: t,
 			error: "Instance matched \"not\" schema."
 		});
 	}
-	let Le = [];
+	let Re = [];
 	if (se !== void 0) {
-		let t = `${u}/anyOf`, n = T.length, r = !1;
+		let t = `${u}/anyOf`, n = w.length, r = !1;
 		for (let n = 0; n < se.length; n++) {
-			let c = se[n], u = Object.create(d), f = g(e, c, i, a, o, te === !0 ? s : null, l, `${t}/${n}`, u);
-			T.push(...f.errors), r ||= f.valid, f.valid && Le.push(u);
+			let c = se[n], u = Object.create(d), f = h(e, c, i, a, o, te === !0 ? s : null, l, `${t}/${n}`, u);
+			w.push(...f.errors), r ||= f.valid, f.valid && Re.push(u);
 		}
-		r ? T.length = n : T.splice(n, 0, {
+		r ? w.length = n : w.splice(n, 0, {
 			instanceLocation: l,
 			keyword: "anyOf",
 			keywordLocation: t,
@@ -323,45 +323,45 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 		});
 	}
 	if (ce !== void 0) {
-		let t = `${u}/allOf`, n = T.length, r = !0;
+		let t = `${u}/allOf`, n = w.length, r = !0;
 		for (let n = 0; n < ce.length; n++) {
-			let c = ce[n], u = Object.create(d), f = g(e, c, i, a, o, te === !0 ? s : null, l, `${t}/${n}`, u);
-			T.push(...f.errors), r &&= f.valid, f.valid && Le.push(u);
+			let c = ce[n], u = Object.create(d), f = h(e, c, i, a, o, te === !0 ? s : null, l, `${t}/${n}`, u);
+			w.push(...f.errors), r &&= f.valid, f.valid && Re.push(u);
 		}
-		r ? T.length = n : T.splice(n, 0, {
+		r ? w.length = n : w.splice(n, 0, {
 			instanceLocation: l,
 			keyword: "allOf",
 			keywordLocation: t,
 			error: "Instance does not match every subschema."
 		});
 	}
-	if (h !== void 0) {
-		let t = `${u}/oneOf`, n = T.length, r = h.filter((n, r) => {
-			let c = Object.create(d), u = g(e, n, i, a, o, te === !0 ? s : null, l, `${t}/${r}`, c);
-			return T.push(...u.errors), u.valid && Le.push(c), u.valid;
+	if (le !== void 0) {
+		let t = `${u}/oneOf`, n = w.length, r = le.filter((n, r) => {
+			let c = Object.create(d), u = h(e, n, i, a, o, te === !0 ? s : null, l, `${t}/${r}`, c);
+			return w.push(...u.errors), u.valid && Re.push(c), u.valid;
 		}).length;
-		r === 1 ? T.length = n : T.splice(n, 0, {
+		r === 1 ? w.length = n : w.splice(n, 0, {
 			instanceLocation: l,
 			keyword: "oneOf",
 			keywordLocation: t,
 			error: `Instance does not match exactly one subschema (${r} matches).`
 		});
 	}
-	if ((p === "object" || p === "array") && Object.assign(d, ...Le), ue !== void 0) {
+	if ((p === "object" || p === "array") && Object.assign(d, ...Re), de !== void 0) {
 		let t = `${u}/if`;
-		if (g(e, ue, i, a, o, s, l, t, d).valid) {
-			if (de !== void 0) {
-				let n = g(e, de, i, a, o, s, l, `${u}/then`, d);
-				n.valid || T.push({
+		if (h(e, de, i, a, o, s, l, t, d).valid) {
+			if (fe !== void 0) {
+				let n = h(e, fe, i, a, o, s, l, `${u}/then`, d);
+				n.valid || w.push({
 					instanceLocation: l,
 					keyword: "if",
 					keywordLocation: t,
 					error: "Instance does not match \"then\" schema."
 				}, ...n.errors);
 			}
-		} else if (fe !== void 0) {
-			let n = g(e, fe, i, a, o, s, l, `${u}/else`, d);
-			n.valid || T.push({
+		} else if (pe !== void 0) {
+			let n = h(e, pe, i, a, o, s, l, `${u}/else`, d);
+			n.valid || w.push({
 				instanceLocation: l,
 				keyword: "if",
 				keywordLocation: t,
@@ -370,28 +370,28 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 		}
 	}
 	if (p === "object") {
-		if (ae !== void 0) for (let t of ae) t in e || T.push({
+		if (ae !== void 0) for (let t of ae) t in e || w.push({
 			instanceLocation: l,
 			keyword: "required",
 			keywordLocation: `${u}/required`,
 			error: `Instance does not have required property "${t}".`
 		});
 		let t = Object.keys(e);
-		if (ve !== void 0 && t.length < ve && T.push({
+		if (ye !== void 0 && t.length < ye && w.push({
 			instanceLocation: l,
 			keyword: "minProperties",
 			keywordLocation: `${u}/minProperties`,
-			error: `Instance does not have at least ${ve} properties.`
-		}), ye !== void 0 && t.length > ye && T.push({
+			error: `Instance does not have at least ${ye} properties.`
+		}), be !== void 0 && t.length > be && w.push({
 			instanceLocation: l,
 			keyword: "maxProperties",
 			keywordLocation: `${u}/maxProperties`,
-			error: `Instance does not have at least ${ye} properties.`
-		}), xe !== void 0) {
+			error: `Instance does not have at least ${be} properties.`
+		}), Se !== void 0) {
 			let t = `${u}/propertyNames`;
 			for (let r in e) {
-				let e = `${l}/${n(r)}`, c = g(r, xe, i, a, o, s, e, t);
-				c.valid || T.push({
+				let e = `${l}/${n(r)}`, c = h(r, Se, i, a, o, s, e, t);
+				c.valid || w.push({
 					instanceLocation: l,
 					keyword: "propertyNames",
 					keywordLocation: t,
@@ -399,11 +399,11 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}, ...c.errors);
 			}
 		}
-		if (Se !== void 0) {
+		if (Ce !== void 0) {
 			let t = `${u}/dependantRequired`;
-			for (let n in Se) if (n in e) {
-				let r = Se[n];
-				for (let i of r) i in e || T.push({
+			for (let n in Ce) if (n in e) {
+				let r = Ce[n];
+				for (let i of r) i in e || w.push({
 					instanceLocation: l,
 					keyword: "dependentRequired",
 					keywordLocation: t,
@@ -411,11 +411,11 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				});
 			}
 		}
-		if (Ce !== void 0) for (let t in Ce) {
+		if (we !== void 0) for (let t in we) {
 			let r = `${u}/dependentSchemas`;
 			if (t in e) {
-				let c = g(e, Ce[t], i, a, o, s, l, `${r}/${n(t)}`, d);
-				c.valid || T.push({
+				let c = h(e, we[t], i, a, o, s, l, `${r}/${n(t)}`, d);
+				c.valid || w.push({
 					instanceLocation: l,
 					keyword: "dependentSchemas",
 					keywordLocation: r,
@@ -423,19 +423,19 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}, ...c.errors);
 			}
 		}
-		if (we !== void 0) {
+		if (Te !== void 0) {
 			let t = `${u}/dependencies`;
-			for (let r in we) if (r in e) {
-				let c = we[r];
-				if (Array.isArray(c)) for (let n of c) n in e || T.push({
+			for (let r in Te) if (r in e) {
+				let c = Te[r];
+				if (Array.isArray(c)) for (let n of c) n in e || w.push({
 					instanceLocation: l,
 					keyword: "dependencies",
 					keywordLocation: t,
 					error: `Instance has "${r}" but does not have "${n}".`
 				});
 				else {
-					let u = g(e, c, i, a, o, s, l, `${t}/${n(r)}`);
-					u.valid || T.push({
+					let u = h(e, c, i, a, o, s, l, `${t}/${n(r)}`);
+					u.valid || w.push({
 						instanceLocation: l,
 						keyword: "dependencies",
 						keywordLocation: t,
@@ -445,13 +445,13 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 			}
 		}
 		let r = Object.create(null), c = !1;
-		if (me !== void 0) {
+		if (he !== void 0) {
 			let t = `${u}/properties`;
-			for (let u in me) {
+			for (let u in he) {
 				if (!(u in e)) continue;
-				let f = `${l}/${n(u)}`, p = g(e[u], me[u], i, a, o, s, f, `${t}/${n(u)}`);
+				let f = `${l}/${n(u)}`, p = h(e[u], he[u], i, a, o, s, f, `${t}/${n(u)}`);
 				if (p.valid) d[u] = r[u] = !0;
-				else if (c = o, T.push({
+				else if (c = o, w.push({
 					instanceLocation: l,
 					keyword: "properties",
 					keywordLocation: t,
@@ -459,14 +459,14 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}, ...p.errors), c) break;
 			}
 		}
-		if (!c && he !== void 0) {
+		if (!c && ge !== void 0) {
 			let t = `${u}/patternProperties`;
-			for (let u in he) {
-				let f = new RegExp(u, "u"), p = he[u];
+			for (let u in ge) {
+				let f = new RegExp(u, "u"), p = ge[u];
 				for (let m in e) {
 					if (!f.test(m)) continue;
-					let ee = `${l}/${n(m)}`, te = g(e[m], p, i, a, o, s, ee, `${t}/${n(u)}`);
-					te.valid ? d[m] = r[m] = !0 : (c = o, T.push({
+					let ee = `${l}/${n(m)}`, te = h(e[m], p, i, a, o, s, ee, `${t}/${n(u)}`);
+					te.valid ? d[m] = r[m] = !0 : (c = o, w.push({
 						instanceLocation: l,
 						keyword: "patternProperties",
 						keywordLocation: t,
@@ -475,23 +475,23 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}
 			}
 		}
-		if (!c && ge !== void 0) {
+		if (!c && _e !== void 0) {
 			let t = `${u}/additionalProperties`;
 			for (let u in e) {
 				if (r[u]) continue;
-				let f = `${l}/${n(u)}`, p = g(e[u], ge, i, a, o, s, f, t);
-				p.valid ? d[u] = !0 : (c = o, T.push({
+				let f = `${l}/${n(u)}`, p = h(e[u], _e, i, a, o, s, f, t);
+				p.valid ? d[u] = !0 : (c = o, w.push({
 					instanceLocation: l,
 					keyword: "additionalProperties",
 					keywordLocation: t,
 					error: `Property "${u}" does not match additional properties schema.`
 				}, ...p.errors));
 			}
-		} else if (!c && _e !== void 0) {
+		} else if (!c && ve !== void 0) {
 			let t = `${u}/unevaluatedProperties`;
 			for (let r in e) if (!d[r]) {
-				let c = `${l}/${n(r)}`, u = g(e[r], _e, i, a, o, s, c, t);
-				u.valid ? d[r] = !0 : T.push({
+				let c = `${l}/${n(r)}`, u = h(e[r], ve, i, a, o, s, c, t);
+				u.valid ? d[r] = !0 : w.push({
 					instanceLocation: l,
 					keyword: "unevaluatedProperties",
 					keywordLocation: t,
@@ -500,23 +500,23 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 			}
 		}
 	} else if (p === "array") {
-		S !== void 0 && e.length > S && T.push({
+		x !== void 0 && e.length > x && w.push({
 			instanceLocation: l,
 			keyword: "maxItems",
 			keywordLocation: `${u}/maxItems`,
-			error: `Array has too many items (${e.length} > ${S}).`
-		}), x !== void 0 && e.length < x && T.push({
+			error: `Array has too many items (${e.length} > ${x}).`
+		}), b !== void 0 && e.length < b && w.push({
 			instanceLocation: l,
 			keyword: "minItems",
 			keywordLocation: `${u}/minItems`,
-			error: `Array has too few items (${e.length} < ${x}).`
+			error: `Array has too few items (${e.length} < ${b}).`
 		});
 		let n = e.length, r = 0, c = !1;
-		if (Te !== void 0) {
-			let t = `${u}/prefixItems`, f = Math.min(Te.length, n);
+		if (Ee !== void 0) {
+			let t = `${u}/prefixItems`, f = Math.min(Ee.length, n);
 			for (; r < f; r++) {
-				let n = g(e[r], Te[r], i, a, o, s, `${l}/${r}`, `${t}/${r}`);
-				if (d[r] = !0, !n.valid && (c = o, T.push({
+				let n = h(e[r], Ee[r], i, a, o, s, `${l}/${r}`, `${t}/${r}`);
+				if (d[r] = !0, !n.valid && (c = o, w.push({
 					instanceLocation: l,
 					keyword: "prefixItems",
 					keywordLocation: t,
@@ -524,13 +524,13 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}, ...n.errors), c)) break;
 			}
 		}
-		if (Ee !== void 0) {
+		if (De !== void 0) {
 			let t = `${u}/items`;
-			if (Array.isArray(Ee)) {
-				let u = Math.min(Ee.length, n);
+			if (Array.isArray(De)) {
+				let u = Math.min(De.length, n);
 				for (; r < u; r++) {
-					let n = g(e[r], Ee[r], i, a, o, s, `${l}/${r}`, `${t}/${r}`);
-					if (d[r] = !0, !n.valid && (c = o, T.push({
+					let n = h(e[r], De[r], i, a, o, s, `${l}/${r}`, `${t}/${r}`);
+					if (d[r] = !0, !n.valid && (c = o, w.push({
 						instanceLocation: l,
 						keyword: "items",
 						keywordLocation: t,
@@ -538,19 +538,19 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 					}, ...n.errors), c)) break;
 				}
 			} else for (; r < n; r++) {
-				let n = g(e[r], Ee, i, a, o, s, `${l}/${r}`, t);
-				if (d[r] = !0, !n.valid && (c = o, T.push({
+				let n = h(e[r], De, i, a, o, s, `${l}/${r}`, t);
+				if (d[r] = !0, !n.valid && (c = o, w.push({
 					instanceLocation: l,
 					keyword: "items",
 					keywordLocation: t,
 					error: "Items did not match schema."
 				}, ...n.errors), c)) break;
 			}
-			if (!c && De !== void 0) {
+			if (!c && Oe !== void 0) {
 				let t = `${u}/additionalItems`;
 				for (; r < n; r++) {
-					let n = g(e[r], De, i, a, o, s, `${l}/${r}`, t);
-					d[r] = !0, n.valid || (c = o, T.push({
+					let n = h(e[r], Oe, i, a, o, s, `${l}/${r}`, t);
+					d[r] = !0, n.valid || (c = o, w.push({
 						instanceLocation: l,
 						keyword: "additionalItems",
 						keywordLocation: t,
@@ -559,49 +559,49 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}
 			}
 		}
-		if (v !== void 0) {
-			if (n === 0 && y === void 0) T.push({
+		if (_ !== void 0) {
+			if (n === 0 && v === void 0) w.push({
 				instanceLocation: l,
 				keyword: "contains",
 				keywordLocation: `${u}/contains`,
 				error: "Array is empty. It must contain at least one item matching the schema."
 			});
-			else if (y !== void 0 && n < y) T.push({
+			else if (v !== void 0 && n < v) w.push({
 				instanceLocation: l,
 				keyword: "minContains",
 				keywordLocation: `${u}/minContains`,
-				error: `Array has less items (${n}) than minContains (${y}).`
+				error: `Array has less items (${n}) than minContains (${v}).`
 			});
 			else {
-				let t = `${u}/contains`, r = T.length, c = 0;
+				let t = `${u}/contains`, r = w.length, c = 0;
 				for (let r = 0; r < n; r++) {
-					let n = g(e[r], v, i, a, o, s, `${l}/${r}`, t);
-					n.valid ? (d[r] = !0, c++) : T.push(...n.errors);
+					let n = h(e[r], _, i, a, o, s, `${l}/${r}`, t);
+					n.valid ? (d[r] = !0, c++) : w.push(...n.errors);
 				}
-				c >= (y || 0) && (T.length = r), y === void 0 && b === void 0 && c === 0 ? T.splice(r, 0, {
+				c >= (v || 0) && (w.length = r), v === void 0 && y === void 0 && c === 0 ? w.splice(r, 0, {
 					instanceLocation: l,
 					keyword: "contains",
 					keywordLocation: t,
 					error: "Array does not contain item matching schema."
-				}) : y !== void 0 && c < y ? T.push({
+				}) : v !== void 0 && c < v ? w.push({
 					instanceLocation: l,
 					keyword: "minContains",
 					keywordLocation: `${u}/minContains`,
-					error: `Array must contain at least ${y} items matching schema. Only ${c} items were found.`
-				}) : b !== void 0 && c > b && T.push({
+					error: `Array must contain at least ${v} items matching schema. Only ${c} items were found.`
+				}) : y !== void 0 && c > y && w.push({
 					instanceLocation: l,
 					keyword: "maxContains",
 					keywordLocation: `${u}/maxContains`,
-					error: `Array may contain at most ${b} items matching schema. ${c} items were found.`
+					error: `Array may contain at most ${y} items matching schema. ${c} items were found.`
 				});
 			}
 		}
-		if (!c && _ !== void 0) {
+		if (!c && g !== void 0) {
 			let t = `${u}/unevaluatedItems`;
 			for (; r < n; r++) {
 				if (d[r]) continue;
-				let n = g(e[r], _, i, a, o, s, `${l}/${r}`, t);
-				d[r] = !0, n.valid || T.push({
+				let n = h(e[r], g, i, a, o, s, `${l}/${r}`, t);
+				d[r] = !0, n.valid || w.push({
 					instanceLocation: l,
 					keyword: "unevaluatedItems",
 					keywordLocation: t,
@@ -609,12 +609,12 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 				}, ...n.errors);
 			}
 		}
-		if (Oe) for (let r = 0; r < n; r++) {
+		if (ke) for (let r = 0; r < n; r++) {
 			let i = e[r], a = typeof i == "object" && !!i;
 			for (let o = 0; o < n; o++) {
 				if (r === o) continue;
 				let n = e[o];
-				(i === n || a && typeof n == "object" && n && t(i, n)) && (T.push({
+				(i === n || a && typeof n == "object" && n && t(i, n)) && (w.push({
 					instanceLocation: l,
 					keyword: "uniqueItems",
 					keywordLocation: `${u}/uniqueItems`,
@@ -623,77 +623,77 @@ function g(e, r, i = "2019-09", a = c(r), o = !0, s = null, l = "#", u = "#", d
 			}
 		}
 	} else if (p === "number") {
-		if (i === "4" ? (C !== void 0 && (Ae === !0 && e <= C || e < C) && T.push({
+		if (i === "4" ? (S !== void 0 && (je === !0 && e <= S || e < S) && w.push({
 			instanceLocation: l,
 			keyword: "minimum",
 			keywordLocation: `${u}/minimum`,
-			error: `${e} is less than ${Ae ? "or equal to " : ""} ${C}.`
-		}), ke !== void 0 && (je === !0 && e >= ke || e > ke) && T.push({
+			error: `${e} is less than ${je ? "or equal to " : ""} ${S}.`
+		}), Ae !== void 0 && (Me === !0 && e >= Ae || e > Ae) && w.push({
 			instanceLocation: l,
 			keyword: "maximum",
 			keywordLocation: `${u}/maximum`,
-			error: `${e} is greater than ${je ? "or equal to " : ""} ${ke}.`
-		})) : (C !== void 0 && e < C && T.push({
+			error: `${e} is greater than ${Me ? "or equal to " : ""} ${Ae}.`
+		})) : (S !== void 0 && e < S && w.push({
 			instanceLocation: l,
 			keyword: "minimum",
 			keywordLocation: `${u}/minimum`,
-			error: `${e} is less than ${C}.`
-		}), ke !== void 0 && e > ke && T.push({
+			error: `${e} is less than ${S}.`
+		}), Ae !== void 0 && e > Ae && w.push({
 			instanceLocation: l,
 			keyword: "maximum",
 			keywordLocation: `${u}/maximum`,
-			error: `${e} is greater than ${ke}.`
-		}), Ae !== void 0 && e <= Ae && T.push({
+			error: `${e} is greater than ${Ae}.`
+		}), je !== void 0 && e <= je && w.push({
 			instanceLocation: l,
 			keyword: "exclusiveMinimum",
 			keywordLocation: `${u}/exclusiveMinimum`,
-			error: `${e} is less than ${Ae}.`
-		}), je !== void 0 && e >= je && T.push({
+			error: `${e} is less than ${je}.`
+		}), Me !== void 0 && e >= Me && w.push({
 			instanceLocation: l,
 			keyword: "exclusiveMaximum",
 			keywordLocation: `${u}/exclusiveMaximum`,
-			error: `${e} is greater than or equal to ${je}.`
-		})), Me !== void 0) {
-			let t = e % Me;
-			Math.abs(0 - t) >= 1.1920929e-7 && Math.abs(Me - t) >= 1.1920929e-7 && T.push({
+			error: `${e} is greater than or equal to ${Me}.`
+		})), Ne !== void 0) {
+			let t = e % Ne;
+			Math.abs(0 - t) >= 1.1920929e-7 && Math.abs(Ne - t) >= 1.1920929e-7 && w.push({
 				instanceLocation: l,
 				keyword: "multipleOf",
 				keywordLocation: `${u}/multipleOf`,
-				error: `${e} is not a multiple of ${Me}.`
+				error: `${e} is not a multiple of ${Ne}.`
 			});
 		}
 	} else if (p === "string") {
-		let t = Ne === void 0 && Pe === void 0 ? 0 : be(e);
-		Ne !== void 0 && t < Ne && T.push({
+		let t = Pe === void 0 && Fe === void 0 ? 0 : xe(e);
+		Pe !== void 0 && t < Pe && w.push({
 			instanceLocation: l,
 			keyword: "minLength",
 			keywordLocation: `${u}/minLength`,
-			error: `String is too short (${t} < ${Ne}).`
-		}), Pe !== void 0 && t > Pe && T.push({
+			error: `String is too short (${t} < ${Pe}).`
+		}), Fe !== void 0 && t > Fe && w.push({
 			instanceLocation: l,
 			keyword: "maxLength",
 			keywordLocation: `${u}/maxLength`,
-			error: `String is too long (${t} > ${Pe}).`
-		}), Fe !== void 0 && !new RegExp(Fe, "u").test(e) && T.push({
+			error: `String is too long (${t} > ${Fe}).`
+		}), Ie !== void 0 && !new RegExp(Ie, "u").test(e) && w.push({
 			instanceLocation: l,
 			keyword: "pattern",
 			keywordLocation: `${u}/pattern`,
 			error: "String does not match pattern."
-		}), pe !== void 0 && le[pe] && !le[pe](e) && T.push({
+		}), me !== void 0 && ue[me] && !ue[me](e) && w.push({
 			instanceLocation: l,
 			keyword: "format",
 			keywordLocation: `${u}/format`,
-			error: `String does not match format "${pe}".`
+			error: `String does not match format "${me}".`
 		});
 	}
 	return {
-		valid: T.length === 0,
-		errors: T
+		valid: w.length === 0,
+		errors: w
 	};
 }
 //#endregion
 //#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/validator.js
-var xe = class {
+var Se = class {
 	schema;
 	draft;
 	shortCircuit;
@@ -702,7 +702,7 @@ var xe = class {
 		this.schema = e, this.draft = t, this.shortCircuit = n, this.lookup = c(e);
 	}
 	validate(e) {
-		return g(e, this.schema, this.draft, this.lookup, this.shortCircuit);
+		return h(e, this.schema, this.draft, this.lookup, this.shortCircuit);
 	}
 	addSchema(e, t) {
 		t && (e = {
@@ -710,105 +710,105 @@ var xe = class {
 			$id: t
 		}), c(e, this.lookup);
 	}
-}, Se = 0;
-function Ce() {
-	let e = Se;
-	return Se += 1, e;
+}, Ce = 0;
+function we() {
+	let e = Ce;
+	return Ce += 1, e;
 }
-function we(e) {
+function Te(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) we(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) Te(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function Te(e, t) {
+function Ee(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function Ee(e) {
+function De(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = Ee(r);
+		for (let [n, r] of e.entries()) t[n] = De(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = Ee(e[n]);
+		for (let n in e) t[n] = De(e[n]);
 		return t;
 	}
 }
-function De(e, t) {
+function Oe(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 (!De(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!Oe(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !De(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !Oe(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 _ = Object.freeze({
+var g = Object.freeze({
 	Equals: 0,
 	Containing: 1,
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), v = Pe(_.Equals), y = Pe(_.Containing), b = Pe(_.ContainedBy), x = Pe(_.Rejection), S = Pe(_.Intersection), Oe = we([
-	[_.Equals, v],
-	[_.Containing, y],
-	[_.ContainedBy, b],
-	[_.Rejection, x],
-	[_.Intersection, S]
-]), C = (() => {
+}), _ = Fe(g.Equals), v = Fe(g.Containing), y = Fe(g.ContainedBy), b = Fe(g.Rejection), x = Fe(g.Intersection), ke = Te([
+	[g.Equals, _],
+	[g.Containing, v],
+	[g.ContainedBy, y],
+	[g.Rejection, b],
+	[g.Intersection, x]
+]), S = (() => {
 	let e = 0;
-	for (let [t, n] of Oe) e |= n;
+	for (let [t, n] of ke) e |= n;
 	return e;
 })();
-function ke(e) {
-	return !!(e & v);
-}
 function Ae(e) {
-	return !!(e & y);
+	return !!(e & _);
 }
 function je(e) {
-	return !!(e & b);
+	return !!(e & v);
 }
 function Me(e) {
-	return !!(e & x);
+	return !!(e & y);
 }
 function Ne(e) {
-	return !!(e & S);
+	return !!(e & b);
 }
 function Pe(e) {
+	return !!(e & x);
+}
+function Fe(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function Fe(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : Ie(t, r, e), n += 1, t) };
+function Ie(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : Le(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function Ie(e, t, n) {
+function Le(e, t, n) {
 	let r = 0;
-	for (let [i, a] of Oe) if (a & e) {
-		for (let [e, a] of Oe) if (a & t && (r |= n(i, e), r === C)) return r;
+	for (let [i, a] of ke) if (a & e) {
+		for (let [e, a] of ke) if (a & t && (r |= n(i, e), r === S)) return r;
 	}
 	return r;
 }
 //#endregion
 //#region src/json-schema-subset/expression/calculator.ts
-var w = Object.freeze({
+var C = Object.freeze({
 	Save: 0,
 	OneOf: 1,
 	AllOf: 2,
@@ -816,289 +816,289 @@ var w = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function T(e, t) {
+function w(e, t) {
 	switch (e) {
-		case w.Save: return t[0];
-		case w.OneOf: return Re(t);
-		case w.AllOf:
-		case w.AnyOf: return ze(e, t);
-		case w.Not:
-		case w.Swap: return Be(e, t[0]);
+		case C.Save: return t[0];
+		case C.OneOf: return ze(t);
+		case C.AllOf:
+		case C.AnyOf: return Be(e, t);
+		case C.Not:
+		case C.Swap: return Ve(e, t[0]);
 	}
 }
-function Le(e) {
-	return Be(w.Swap, e);
-}
 function Re(e) {
+	return Ve(C.Swap, e);
+}
+function ze(e) {
 	if (e.length === 1) return e[0];
-	let t = ze(w.AnyOf, e), n = [];
+	let t = Be(C.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 = ze(w.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = Be(C.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = ze(w.AnyOf, n), i = Be(w.Not, r);
-	return ze(w.AllOf, [t, i]);
+	let r = Be(C.AnyOf, n), i = Ve(C.Not, r);
+	return Be(C.AllOf, [t, i]);
 }
-function ze(e, t) {
+function Be(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
-		case w.AllOf:
-			n = Fe(Ve);
+		case C.AllOf:
+			n = Ie(He);
 			break;
-		case w.AnyOf:
-			n = Fe(He);
+		case C.AnyOf:
+			n = Ie(Ue);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function Be(e, t) {
+function Ve(e, t) {
 	let n, r = 0;
 	switch (e) {
-		case w.Not:
-			n = Ue;
-			break;
-		case w.Swap:
+		case C.Not:
 			n = We;
 			break;
+		case C.Swap:
+			n = Ge;
+			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of Oe) i & t && (r |= n(e));
+	for (let [e, i] of ke) i & t && (r |= n(e));
 	return r;
 }
-function Ve(e, t) {
+function He(e, t) {
 	let n = 0;
 	switch (e) {
-		case _.Equals:
+		case g.Equals:
 			switch (t) {
-				case _.Equals:
-					n = v;
+				case g.Equals:
+					n = _;
 					break;
-				case _.Containing:
-					n = v;
+				case g.Containing:
+					n = _;
 					break;
-				case _.ContainedBy:
-					n = b;
+				case g.ContainedBy:
+					n = y;
 					break;
-				case _.Rejection:
+				case g.Rejection:
 					n = 0;
 					break;
-				case _.Intersection: n = b;
+				case g.Intersection: n = y;
 			}
 			break;
-		case _.Containing:
+		case g.Containing:
 			switch (t) {
-				case _.Equals:
-					n = v;
+				case g.Equals:
+					n = _;
 					break;
-				case _.Containing:
-					n = v | y;
+				case g.Containing:
+					n = _ | v;
 					break;
-				case _.ContainedBy:
-					n = b;
+				case g.ContainedBy:
+					n = y;
 					break;
-				case _.Rejection:
-					n = x;
+				case g.Rejection:
+					n = b;
 					break;
-				case _.Intersection: n = S | b;
+				case g.Intersection: n = x | y;
 			}
 			break;
-		case _.ContainedBy:
+		case g.ContainedBy:
 			switch (t) {
-				case _.Equals:
-					n = b;
+				case g.Equals:
+					n = y;
 					break;
-				case _.Containing:
-					n = b;
+				case g.Containing:
+					n = y;
 					break;
-				case _.ContainedBy:
-					n = b;
+				case g.ContainedBy:
+					n = y;
 					break;
-				case _.Rejection:
+				case g.Rejection:
 					n = 0;
 					break;
-				case _.Intersection: n = b;
+				case g.Intersection: n = y;
 			}
 			break;
-		case _.Rejection:
+		case g.Rejection:
 			switch (t) {
-				case _.Equals:
+				case g.Equals:
 					n = 0;
 					break;
-				case _.Containing:
-					n = x;
+				case g.Containing:
+					n = b;
 					break;
-				case _.ContainedBy:
+				case g.ContainedBy:
 					n = 0;
 					break;
-				case _.Rejection:
-					n = x;
+				case g.Rejection:
+					n = b;
 					break;
-				case _.Intersection: n = x;
+				case g.Intersection: n = b;
 			}
 			break;
-		case _.Intersection: switch (t) {
-			case _.Equals:
-				n = b;
+		case g.Intersection: switch (t) {
+			case g.Equals:
+				n = y;
 				break;
-			case _.Containing:
-				n = S | b;
+			case g.Containing:
+				n = x | y;
 				break;
-			case _.ContainedBy:
-				n = b;
+			case g.ContainedBy:
+				n = y;
 				break;
-			case _.Rejection:
-				n = x;
+			case g.Rejection:
+				n = b;
 				break;
-			case _.Intersection: n = b | x | S;
+			case g.Intersection: n = y | b | x;
 		}
 	}
 	return n;
 }
-function He(e, t) {
+function Ue(e, t) {
 	let n = 0;
 	switch (e) {
-		case _.Equals:
+		case g.Equals:
 			switch (t) {
-				case _.Equals:
+				case g.Equals:
+					n = _;
+					break;
+				case g.Containing:
 					n = v;
 					break;
-				case _.Containing:
-					n = y;
+				case g.ContainedBy:
+					n = _;
 					break;
-				case _.ContainedBy:
+				case g.Rejection:
 					n = v;
 					break;
-				case _.Rejection:
-					n = y;
-					break;
-				case _.Intersection: n = y;
+				case g.Intersection: n = v;
 			}
 			break;
-		case _.Containing:
+		case g.Containing:
 			switch (t) {
-				case _.Equals:
-					n = y;
+				case g.Equals:
+					n = v;
 					break;
-				case _.Containing:
-					n = y;
+				case g.Containing:
+					n = v;
 					break;
-				case _.ContainedBy:
-					n = y;
+				case g.ContainedBy:
+					n = v;
 					break;
-				case _.Rejection:
-					n = y;
+				case g.Rejection:
+					n = v;
 					break;
-				case _.Intersection: n = y;
+				case g.Intersection: n = v;
 			}
 			break;
-		case _.ContainedBy:
+		case g.ContainedBy:
 			switch (t) {
-				case _.Equals:
-					n = v;
+				case g.Equals:
+					n = _;
 					break;
-				case _.Containing:
-					n = y;
+				case g.Containing:
+					n = v;
 					break;
-				case _.ContainedBy:
-					n = v | b;
+				case g.ContainedBy:
+					n = _ | y;
 					break;
-				case _.Rejection:
-					n = S;
+				case g.Rejection:
+					n = x;
 					break;
-				case _.Intersection: n = y | S;
+				case g.Intersection: n = v | x;
 			}
 			break;
-		case _.Rejection:
+		case g.Rejection:
 			switch (t) {
-				case _.Equals:
-					n = y;
-					break;
-				case _.Containing:
-					n = y;
+				case g.Equals:
+					n = v;
 					break;
-				case _.ContainedBy:
-					n = S;
+				case g.Containing:
+					n = v;
 					break;
-				case _.Rejection:
+				case g.ContainedBy:
 					n = x;
 					break;
-				case _.Intersection: n = S;
+				case g.Rejection:
+					n = b;
+					break;
+				case g.Intersection: n = x;
 			}
 			break;
-		case _.Intersection: switch (t) {
-			case _.Equals:
-				n = y;
+		case g.Intersection: switch (t) {
+			case g.Equals:
+				n = v;
 				break;
-			case _.Containing:
-				n = y;
+			case g.Containing:
+				n = v;
 				break;
-			case _.ContainedBy:
-				n = y | S;
+			case g.ContainedBy:
+				n = v | x;
 				break;
-			case _.Rejection:
-				n = S;
+			case g.Rejection:
+				n = x;
 				break;
-			case _.Intersection: n = y | S;
+			case g.Intersection: n = v | x;
 		}
 	}
 	return n;
 }
-function Ue(e) {
+function We(e) {
 	let t = 0;
 	switch (e) {
-		case _.Equals:
-			t = x;
+		case g.Equals:
+			t = b;
 			break;
-		case _.Containing:
-			t = x;
+		case g.Containing:
+			t = b;
 			break;
-		case _.ContainedBy:
-			t = S;
+		case g.ContainedBy:
+			t = x;
 			break;
-		case _.Rejection:
-			t = v | y;
+		case g.Rejection:
+			t = _ | v;
 			break;
-		case _.Intersection: t = b | S;
+		case g.Intersection: t = y | x;
 	}
 	return t;
 }
-function We(e) {
+function Ge(e) {
 	let t = 0;
 	switch (e) {
-		case _.Equals:
-			t = v;
-			break;
-		case _.Containing:
-			t = b;
+		case g.Equals:
+			t = _;
 			break;
-		case _.ContainedBy:
+		case g.Containing:
 			t = y;
 			break;
-		case _.Rejection:
-			t = x;
+		case g.ContainedBy:
+			t = v;
+			break;
+		case g.Rejection:
+			t = b;
 			break;
-		case _.Intersection: t = S;
+		case g.Intersection: t = x;
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var Ge = Object.freeze({
+var Ke = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), Ke = (e) => (t, n) => {
+}), qe = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
 		expressions: null,
 		calculation: {
-			operator: w.Save,
+			operator: C.Save,
 			results: [0],
 			willSwap: !1,
 			count: 0
@@ -1117,10 +1117,10 @@ var Ge = Object.freeze({
 		for (; a.length > 0;) c(a.pop());
 	}
 	function o(t) {
-		let n = v, [r, o] = t.expressions;
+		let n = _, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== Ge.Leaf) {
+			if (a.kind !== Ke.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -1135,7 +1135,7 @@ var Ge = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== Ge.Leaf) {
+			if (c.kind !== Ke.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -1152,26 +1152,26 @@ var Ge = 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: w.Save,
+			operator: C.Save,
 			results: [n],
 			willSwap: !1,
 			count: 0
 		}, a.push(t);
 	}
 	function s(e, t) {
-		let n = w.Save, r;
+		let n = C.Save, r;
 		switch (e.kind) {
-			case Ge.Not:
-				n = w.Not, r = [e.expression];
+			case Ke.Not:
+				n = C.Not, r = [e.expression];
 				break;
-			case Ge.AllOf:
-				n = w.AllOf, r = [...e.expressions];
+			case Ke.AllOf:
+				n = C.AllOf, r = [...e.expressions];
 				break;
-			case Ge.AnyOf:
-				n = w.AnyOf, r = [...e.expressions];
+			case Ke.AnyOf:
+				n = C.AnyOf, r = [...e.expressions];
 				break;
-			case Ge.OneOf:
-				n = w.OneOf, r = [...e.expressions];
+			case Ke.OneOf:
+				n = C.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
 		}
@@ -1183,8 +1183,8 @@ var Ge = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = T(t.operator, t.results);
-		if (r === 0 && (r = b), t.willSwap && (r = Le(r)), n) {
+		let t = e.calculation, n = e.parent, r = w(t.operator, t.results);
+		if (r === 0 && (r = y), t.willSwap && (r = Re(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);
 		}
@@ -1192,79 +1192,79 @@ var Ge = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, qe = class extends Error {
+}, Je = class extends Error {
 	constructor(e = []) {
-		super(Xe(e)), this.name = "SchemaError", this.items = e;
+		super(Ze(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Je = Object.freeze({
+}, Ye = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Ye(e) {
+function Xe(e) {
 	switch (e.kind) {
-		case Je.Compiled: {
+		case Ye.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Je.External: return String(e.error);
+		case Ye.External: return String(e.error);
 	}
 }
-function Xe(e) {
+function Ze(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Ye(e[0]);
-		default: return `${Ye(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Xe(e[0]);
+		default: return `${Xe(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Ze = /* @__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 Qe(e) {
-	return Ze.has(e);
-}
+var Qe = /* @__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 $e(e) {
-	for (let t in e) if (Qe(t)) return !1;
+	return Qe.has(e);
+}
+function et(e) {
+	for (let t in e) if ($e(t)) return !1;
 	return !0;
 }
-function et(e, ...t) {
+function tt(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function tt(e) {
+function nt(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function nt({ path: e, errors: t }, n, ...r) {
-	t.push(rt(e, r, n));
+function rt({ path: e, errors: t }, n, ...r) {
+	t.push(it(e, r, n));
 }
-function E({ path: e, warns: t }, n, ...r) {
-	t.push(rt(e, r, n));
+function T({ path: e, warns: t }, n, ...r) {
+	t.push(it(e, r, n));
 }
-function rt(e, t, n) {
+function it(e, t, n) {
 	return {
-		kind: Je.Compiled,
+		kind: Ye.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function it(e) {
+function at(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] : at(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : ot(n) && delete e[t]);
 	}
 	return e;
 }
-function at(e) {
+function ot(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var ot = Symbol("compiledId"), st = Symbol("compiledKind"), ct = Symbol("compiledPath"), lt = Symbol("validatorLoader"), D = Object.freeze({
+var st = Symbol("compiledId"), ct = Symbol("compiledKind"), lt = Symbol("compiledPath"), ut = Symbol("validatorLoader"), E = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -1277,62 +1277,62 @@ var ot = Symbol("compiledId"), st = Symbol("compiledKind"), ct = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), ut = we(vt(D.Any, Ce(), {}, () => () => !0)), dt = we(vt(D.Never, Ce(), {
+}), dt = Te(yt(E.Any, we(), {}, () => () => !0)), ft = Te(yt(E.Never, we(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function ft(e) {
-	return typeof e != "object" || !e ? !1 : ot in e;
-}
 function pt(e) {
-	return typeof e != "object" || !e ? !1 : ot in e && st in e;
-}
-function O(e) {
-	return pt(e) ? e[st] : D.Extends;
+	return typeof e != "object" || !e ? !1 : st in e;
 }
 function mt(e) {
-	return pt(e) || ft(e) ? e[ot] : e.id;
+	return typeof e != "object" || !e ? !1 : st in e && ct in e;
+}
+function D(e) {
+	return mt(e) ? e[ct] : E.Extends;
 }
 function ht(e) {
-	return pt(e) ? e[ct] : void 0;
+	return mt(e) || pt(e) ? e[st] : e.id;
 }
 function gt(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, ot, {
-		value: Ce(),
+	return mt(e) ? e[lt] : void 0;
+}
+function _t(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, st, {
+		value: we(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
-function k(e, t, n, r = []) {
-	return vt(e, Ce(), t, n && (() => n.compile(t)), r);
+function O(e, t, n, r = []) {
+	return yt(e, we(), t, n && (() => n.compile(t)), r);
 }
-function _t(e) {
-	return vt(D.Never, Ce(), { ...e }, e[lt], e[ct]);
+function vt(e) {
+	return yt(E.Never, we(), { ...e }, e[ut], e[lt]);
 }
-function vt(e, t, n, r, i = []) {
+function yt(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[st]: {
+		[ct]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[ot]: {
+		[st]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[ct]: {
+		[lt]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[lt]: {
+		[ut]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -1349,16 +1349,16 @@ function vt(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function yt(e, t) {
-	let n = bt(e, t), r = xt(e, "maxItems", t), i = xt(e, "minItems", t), a = St(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = Ct(e, t) : t.additionalItems && E(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function bt(e, t) {
+	let n = xt(e, t), r = St(e, "maxItems", t), i = St(e, "minItems", t), a = Ct(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = wt(e, t) : t.additionalItems && T(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 = wt(s, e.delegate));
-		let t = n.findIndex((e) => O(e) === D.Never);
-		t !== -1 && (n = n.splice(t), s = wt(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (E(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && O(s) === D.Never && (c = !0);
-	} else O(n) === D.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || E(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), k(c ? D.Never : D.Array, it({
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = Tt(s, e.delegate));
+		let t = n.findIndex((e) => D(e) === E.Never);
+		t !== -1 && (n = n.splice(t), s = Tt(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (T(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && D(s) === E.Never && (c = !0);
+	} else D(n) === E.Never && (c = !0);
+	return r !== void 0 && i !== void 0 && r < i && (l || T(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), O(c ? E.Never : E.Array, at({
 		type: "array",
 		items: n,
 		contains: a,
@@ -1368,12 +1368,12 @@ function yt(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function bt(e, { items: t }) {
-	if (!t) return k(D.Any, {}, e.delegate, e.path);
+function xt(e, { items: t }) {
+	if (!t) return O(E.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = A(et(e, "items", i), tt(a));
+			let t = A(tt(e, "items", i), nt(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -1382,80 +1382,80 @@ function bt(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return A(et(e, "items"), tt(t));
+	return A(tt(e, "items"), nt(t));
 }
-function xt(e, t, n) {
+function St(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			E(e, "find NaN", t);
+			T(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			E(e, `find invalid number ${r}`, t);
+			T(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function St(e, { contains: t }) {
-	return t ? A(et(e, "contains"), tt(t)) : k(D.Any, {}, e.delegate, e.path);
+function Ct(e, { contains: t }) {
+	return t ? A(tt(e, "contains"), nt(t)) : O(E.Any, {}, e.delegate, e.path);
 }
-function Ct(e, { additionalItems: t }) {
+function wt(e, { additionalItems: t }) {
 	switch (typeof t) {
-		case "boolean": return t ? k(D.Any, {}, e.delegate, e.path) : !1;
-		case "object": return A(et(e, "additionalItems"), t);
-		default: return k(D.Any, {}, e.delegate, e.path);
+		case "boolean": return t ? O(E.Any, {}, e.delegate, e.path) : !1;
+		case "object": return A(tt(e, "additionalItems"), t);
+		default: return O(E.Any, {}, e.delegate, e.path);
 	}
 }
-function wt(e, t) {
-	return e === void 0 ? k(D.Never, {
+function Tt(e, t) {
+	return e === void 0 ? O(E.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : pt(e) ? O(e) === D.Never ? e : _t(e) : e;
+	}, t) : mt(e) ? D(e) === E.Never ? e : vt(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var Tt = Object.freeze([
+var Et = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function Et(e, t, n, r) {
-	if (n.length === 0) return nt(e, "disable empty list", t), null;
+function Dt(e, t, n, r) {
+	if (n.length === 0) return rt(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = A(et(e, t, r), tt(a));
+		let n = A(tt(e, t, r), nt(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
 	let a = 0, o = 0;
-	for (let e of i) switch (O(e)) {
-		case D.Any:
+	for (let e of i) switch (D(e)) {
+		case E.Any:
 			a += 1;
 			break;
-		case D.Never: o += 1;
+		case E.Never: o += 1;
 	}
-	let s = D.Combination;
+	let s = E.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = D.Never : a === i.length ? s = D.Any : Dt(i) || (s = D.Never);
+			o > 0 ? s = E.Never : a === i.length ? s = E.Any : Ot(i) || (s = E.Never);
 			break;
 		case "anyOf":
-			a > 0 ? s = D.Any : o === i.length && (s = D.Never);
+			a > 0 ? s = E.Any : o === i.length && (s = E.Never);
 			break;
-		case "oneOf": a > 1 || o === i.length ? s = D.Never : a === 1 && o === i.length - 1 && (s = D.Any);
+		case "oneOf": a > 1 || o === i.length ? s = E.Never : a === 1 && o === i.length - 1 && (s = E.Any);
 	}
-	return k(s, { [t]: i }, r, e.path);
+	return O(s, { [t]: i }, r, e.path);
 }
-function Dt(e) {
+function Ot(e) {
 	let t = null;
 	for (let n of e) {
-		let e = O(n);
+		let e = D(n);
 		switch (e) {
-			case D.Any:
-			case D.Never: break;
+			case E.Any:
+			case E.Never: break;
 			default: if (t === null) t = e;
 			else if (t !== e) return !1;
 		}
@@ -1464,43 +1464,43 @@ function Dt(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var Ot = Object.freeze({
+var k = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
 function kt(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? Ot.Valid : Ot.Invalid : Ot.Unknown;
+	return n ? n(t) === !0 ? k.Valid : k.Invalid : k.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
 function At(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return nt(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return rt(e, "disable empty list", "enum"), null;
 		i = [];
 		for (let [n, a] of t.entries()) switch (kt(r, a)) {
-			case Ot.Valid:
-				i.push(gt(a));
+			case k.Valid:
+				i.push(_t(a));
 				break;
-			case Ot.Invalid: E(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case k.Invalid: T(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
-		i.length === 0 && E(e, "all of elements from list is rejected by currently schema object", "enum");
+		i.length === 0 && T(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && kt(r, n) === Ot.Invalid && (a = !0), i) {
+	if (n && kt(r, n) === k.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (De(t, n)) {
+			for (let t of i) if (Oe(t, n)) {
 				e = !0;
 				break;
 			}
 			e || (a = !0);
 		}
 	}
-	let o = a ? D.Never : D.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = gt(Ee(n))), k(o, s, e.delegate, e.path);
+	let o = a ? E.Never : E.EnumOrConst, s = {};
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = _t(De(n))), O(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
@@ -1516,14 +1516,14 @@ var jt = /* @__PURE__ */ new Set([
 	"propertyNames"
 ]);
 function Mt(e, t) {
-	let n = Object.keys(t).filter((e) => !jt.has(e) && Qe(e));
-	n.length > 0 && E(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let n = Object.keys(t).filter((e) => !jt.has(e) && $e(e));
+	n.length > 0 && T(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
 	let r = Nt(e, "maxProperties", t), i = Nt(e, "minProperties", t), a = Pt(e, t), o = Ft(e, t), s = It(e, t), c = Rt(e, t);
 	if (!a || !o || !s || !c) return null;
 	let l = Lt(e, o, s, t);
 	if (!l) return null;
 	let u = Bt(e, zt(a, o, s, l), c, t);
-	return k(Vt(e, a, l, u, r, i) ? D.Never : D.Object, it({
+	return O(Vt(e, a, l, u, r, i) ? E.Never : E.Object, at({
 		type: "object",
 		required: u,
 		properties: l,
@@ -1539,32 +1539,32 @@ function Nt(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			E(e, "find NaN", t);
+			T(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			E(e, `find invalid number ${r}`, t);
+			T(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
 function Pt(e, { additionalProperties: t }) {
-	return t === !1 ? k(D.Never, {
+	return t === !1 ? O(E.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? A(et(e, "additionalProperties"), tt(t)) : k(D.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? A(tt(e, "additionalProperties"), nt(t)) : O(E.Any, {}, e.delegate, e.path);
 }
 function Ft(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
 		let a = Gt(i);
 		if (a instanceof Error) {
-			E(e, `property name invalid. ${i}`, "patternProperties", i);
+			T(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = tt(t[i]), s = A(et(e, "patternProperties", i), o);
+		let o = nt(t[i]), s = A(tt(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -1574,28 +1574,28 @@ function Ft(e, { patternProperties: t }) {
 	return n ? null : r;
 }
 function It(e, { propertyNames: t }) {
-	if (!t) return k(D.Any, {}, e.delegate, e.path);
-	t = tt(t);
-	let n = A(et(e, "propertyNames"), t);
+	if (!t) return O(E.Any, {}, e.delegate, e.path);
+	t = nt(t);
+	let n = A(tt(e, "propertyNames"), t);
 	if (!n) return null;
-	let r = O(n);
-	return r !== D.String && r !== D.Any ? _t(n) : n;
+	let r = D(n);
+	return r !== E.String && r !== E.Any ? vt(n) : n;
 }
 function Lt(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (kt(n, o) === Ot.Invalid) {
-			E(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
+		if (kt(n, o) === k.Invalid) {
+			T(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
 		let s = Wt(t, o);
-		if (s && O(s) === D.Never) {
-			E(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
+		if (s && D(s) === E.Never) {
+			T(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = tt(r[o]), l = A(et(e, "properties", o), c);
+		let c = nt(r[o]), l = A(tt(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -1608,15 +1608,15 @@ function Rt(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = tt(t[i]);
+		let a = nt(t[i]);
 		if (Array.isArray(a)) {
 			let { keys: t, duplicated: r } = Ut(a);
-			r && E(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
+			r && T(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = A(et(e, "dependencies", i), a);
+			let t = A(tt(e, "dependencies", i), a);
 			if (t) {
-				let e = O(t);
-				r[i] = e === D.Object || e === D.Any ? t : e === D.Extends ? dt : _t(t);
+				let e = D(t);
+				r[i] = e === E.Object || e === E.Any ? t : e === E.Extends ? ft : vt(t);
 			}
 		}
 	}
@@ -1624,27 +1624,27 @@ function Rt(e, { dependencies: t }) {
 }
 function zt(e, t, n, r) {
 	return (i) => {
-		if (kt(n, i) === Ot.Invalid) return !0;
+		if (kt(n, i) === k.Invalid) return !0;
 		let a = Wt(t, i);
-		return !!(a && O(a) === D.Never || O(r[i] ?? e) === D.Never);
+		return !!(a && D(a) === E.Never || D(r[i] ?? e) === E.Never);
 	};
 }
 function Bt(e, t, n, { required: r }) {
 	if (!r) return [];
 	let i = Ut(r);
-	i.duplicated && E(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
+	i.duplicated && T(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
 	for (let e of i.keys) Ht(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
-	return o.length > 0 && E(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
+	return o.length > 0 && T(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
 }
 function Vt(e, t, n, r, i, a) {
-	if (i !== void 0 && a !== void 0 && i < a) return E(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
-	if (i !== void 0 && r.length > i) return E(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
-	if (a !== void 0 && r.length < a) return E(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
-	if (O(t) !== D.Never) return !1;
+	if (i !== void 0 && a !== void 0 && i < a) return T(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
+	if (i !== void 0 && r.length > i) return T(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
+	if (a !== void 0 && r.length < a) return T(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
+	if (D(t) !== E.Never) return !1;
 	for (let e in n) {
 		let t = n[e];
-		if (O(t) !== D.Never) return !1;
+		if (D(t) !== E.Never) return !1;
 	}
 	return !0;
 }
@@ -1652,7 +1652,7 @@ function Ht([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 && O(i) === D.Object && a(i.required), o && a(o);
+		i && D(i) === E.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));
@@ -1722,48 +1722,48 @@ function Xt(e, t) {
 		case "string": return $t(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => Qe(e) && e !== "type");
-			return r.length > 0 && E(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), k(n === "null" ? D.Null : D.Boolean, { type: n }, e.delegate, e.path);
+			let r = Object.keys(t).filter((e) => $e(e) && e !== "type");
+			return r.length > 0 && T(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), O(n === "null" ? E.Null : E.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return nt(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return rt(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
 function Zt(e, t) {
-	let n = Object.keys(t).filter((e) => !Jt.has(e) && Qe(e));
-	n.length > 0 && E(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Te(t, Jt);
+	let n = Object.keys(t).filter((e) => !Jt.has(e) && $e(e));
+	n.length > 0 && T(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = Ee(t, Jt);
 	for (let t of Jt) {
 		let n = r[t];
-		t !== "type" && n !== void 0 && Number.isNaN(n) && (E(e, "found NaN", t), delete r[t]);
+		t !== "type" && n !== void 0 && Number.isNaN(n) && (T(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", E(e, "cannot be 0", "multipleOf"));
-	let l = D.Numeric;
-	return Qt(r) || (l = D.Never), k(l, r, e.delegate, e.path);
+	c === 0 && (delete r.multipleOf, r.type = "number", T(e, "cannot be 0", "multipleOf"));
+	let l = E.Numeric;
+	return Qt(r) || (l = E.Never), O(l, r, e.delegate, e.path);
 }
 function Qt(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 $t(e, t) {
-	let n = Object.keys(t).filter((e) => !Yt.has(e) && Qe(e));
-	n.length > 0 && E(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Te(t, Yt);
+	let n = Object.keys(t).filter((e) => !Yt.has(e) && $e(e));
+	n.length > 0 && T(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = Ee(t, Yt);
 	en(e, r, "maxLength"), en(e, r, "minLength");
-	let i = r.maxLength, a = r.minLength, o = D.String;
-	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = D.Never), k(o, r, e.delegate, e.path);
+	let i = r.maxLength, a = r.minLength, o = E.String;
+	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = E.Never), O(o, r, e.delegate, e.path);
 }
 function en(e, t, n) {
 	let r = t[n];
-	r !== void 0 && Number.isNaN(r) && (E(e, "found NaN", n), delete t[n]);
+	r !== void 0 && Number.isNaN(r) && (T(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
 var tn = Object.freeze([]);
 function nn(e, t, n, r) {
-	if (pt(e) || t.isExtendsSchema(e)) return {
+	if (mt(e) || t.isExtendsSchema(e)) return {
 		schema: e,
 		warns: tn
 	};
@@ -1772,7 +1772,7 @@ function nn(e, t, n, r) {
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Je.External,
+				kind: Ye.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -1797,7 +1797,7 @@ function rn(e, t) {
 	if (!e) throw Error(t);
 }
 function A(e, t) {
-	if (e.extends.isExtendsSchema(t) || pt(t)) return t;
+	if (e.extends.isExtendsSchema(t) || mt(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;
@@ -1809,46 +1809,46 @@ function A(e, t) {
 	return s && i && (s = At(e, a, o, s)), s || null;
 }
 function an(e, t) {
-	for (let n of Tt) {
+	for (let n of Et) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => Qe(e) && e !== n);
-			return i.length > 0 && E(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), Et(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => $e(e) && e !== n);
+			return i.length > 0 && T(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), Dt(e, n, r) || null;
 		}
 	}
 	{
-		let n = tt(t.not);
+		let n = nt(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => Qe(e) && e !== "not");
-			r.length > 0 && E(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = A(et(e, "not"), n);
+			let r = Object.keys(t).filter((e) => $e(e) && e !== "not");
+			r.length > 0 && T(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
+			let i = A(tt(e, "not"), n);
 			if (!i) return null;
-			let a = D.Not;
-			switch (O(i)) {
-				case D.Never:
-					a = D.Any;
+			let a = E.Not;
+			switch (D(i)) {
+				case E.Never:
+					a = E.Any;
 					break;
-				case D.Any: a = D.Never;
+				case E.Any: a = E.Never;
 			}
-			return k(a, { not: i }, e.delegate, e.path);
+			return O(a, { not: i }, e.delegate, e.path);
 		}
 	}
 	if (t.type) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return Et(e, "anyOf", n.map((e) => ({
+			return Dt(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
 			case "object": return Mt(e, t);
-			case "array": return yt(e, t);
+			case "array": return bt(e, t);
 			default: return Xt(e, t);
 		}
 	}
-	return $e(t) ? k(D.Any, {}, e.delegate, e.path) : (nt(e, "unrecognized"), null);
+	return et(t) ? O(E.Any, {}, e.delegate, e.path) : (rt(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
@@ -1930,7 +1930,7 @@ var ln = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of Oe) if (e & a) {
+		for (let r of this.values) for (let [i, a] of ke) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -2122,9 +2122,9 @@ var hn = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 	};
 };
 function gn({ left: e, right: t, intersection: n }) {
-	if (!n) return _.Rejection;
+	if (!n) return g.Rejection;
 	let r = !1, i = !1;
-	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? _.Intersection : r ? _.Containing : i ? _.ContainedBy : _.Equals;
+	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? g.Intersection : r ? g.Containing : i ? g.ContainedBy : g.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
@@ -2137,57 +2137,57 @@ var _n = hn(0), vn = cn([
 ]);
 function yn({ calculate: e }, t, n) {
 	let r = _n(t.minItems, t.maxItems, n.minItems, n.maxItems), i = gn(r);
-	if (i === _.Rejection) return x;
+	if (i === g.Rejection) return b;
 	let [a, o] = bn(t), [s, c] = bn(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = vn.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 _.Equals:
+				case g.Equals:
 					n.hasRejection || (n.hasCommon = !0);
 					break;
-				case _.Containing:
+				case g.Containing:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0;
 					break;
-				case _.ContainedBy:
+				case g.ContainedBy:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra2 = !0;
 					break;
-				case _.Intersection:
+				case g.Intersection:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0, n.hasExtra2 = !0;
 					break;
-				case _.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
+				case g.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
 			}
 		});
 	}
 	d.update((e) => {
 		switch (i) {
-			case _.Containing:
+			case g.Containing:
 				e.hasExtra1 = !0;
 				break;
-			case _.ContainedBy:
+			case g.ContainedBy:
 				e.hasExtra2 = !0;
 				break;
-			case _.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
+			case g.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 ? S : e ? y : t ? b : v : x;
+		r && (i = !1), p |= i ? e && t ? x : e ? v : t ? y : _ : b;
 	}
 	return p;
 }
 function bn({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? ut] : [[], e ?? ut];
+	return Array.isArray(e) ? [e, t ?? dt] : [[], e ?? dt];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
 function xn(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = ft(n);
-		return i === ft(r) ? i ? Cn(t, n, r, e) : n === r : !1;
+		let i = pt(n);
+		return i === pt(r) ? i ? Cn(t, n, r, e) : n === r : !1;
 	};
 }
 function Sn(e) {
@@ -2195,7 +2195,7 @@ function Sn(e) {
 	return (n, r) => Cn(t, n, r, e);
 }
 function Cn(e, t, n, r) {
-	let i = `${mt(t)}/${mt(n)}`, a = e.get(i);
+	let i = `${ht(t)}/${ht(n)}`, a = e.get(i);
 	return a === void 0 && e.set(i, a = r(t, n)), a;
 }
 //#endregion
@@ -2204,23 +2204,23 @@ function wn(e, t, n) {
 	let r = En(t), i = En(n), a = !1, o = !1, s = !1;
 	for (let t of r) if (Dn(e, i, t) ? s = !0 : a = !0, a && s) break;
 	for (let t of i) if (Dn(e, r, t) ? s = !0 : o = !0, o && s) break;
-	return s ? a && o ? S : a ? y : o ? b : v : x;
+	return s ? a && o ? x : a ? v : o ? y : _ : b;
 }
 function Tn(e, t) {
 	let n = !1, r = !1;
 	for (let i of En(e)) {
 		switch (kt(t, i)) {
-			case Ot.Valid:
+			case k.Valid:
 				n = !0;
 				break;
-			case Ot.Invalid:
+			case k.Invalid:
 				r = !0;
 				break;
-			case Ot.Unknown: return C;
+			case k.Unknown: return S;
 		}
 		if (n && r) break;
 	}
-	return n && r ? S : n ? v | b : r ? x : O(t) === D.Never ? v : b;
+	return n && r ? x : n ? _ | y : r ? b : D(t) === E.Never ? _ : y;
 }
 function En({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
@@ -2240,7 +2240,7 @@ function On(e) {
 	}
 	let n = /* @__PURE__ */ new Map();
 	function r(e, t) {
-		let r = mt(e), a = mt(t);
+		let r = ht(e), a = ht(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;
@@ -2257,7 +2257,7 @@ function On(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : pt(e) && pt(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : mt(e) && mt(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
@@ -2294,17 +2294,17 @@ function Nn(e, t) {
 //#region src/json-schema-subset/checker/numeric/float.ts
 function Pn(e, t) {
 	let { left: n, right: r, center: i } = dn(In(e), In(t));
-	if (!i) return x;
+	if (!i) return b;
 	let a = !1, o = !1;
-	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? S : a ? y : o ? b : v;
+	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? x : a ? v : o ? y : _;
 }
 function Fn(e, t) {
 	let n = In(e), r = kn(t);
-	if (!r) return y;
+	if (!r) return v;
 	let i = dn(n, r.range), a = jn(i.center, r.multipleOf), o = Ln(i.left, r.multipleOf), s = Ln(i.right, r.multipleOf);
-	if (!i.center) return x;
+	if (!i.center) return b;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !An(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? S : c ? y : l ? b : v;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !An(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? x : c ? v : l ? y : _;
 }
 function In(e) {
 	let t, n;
@@ -2335,13 +2335,13 @@ function Ln(e, t) {
 //#region src/json-schema-subset/checker/numeric/integer.ts
 function Rn(e, t) {
 	let n = kn(e), r = kn(t);
-	if (!n && !r) return v;
-	if (!n) return b;
-	if (!r) return y;
+	if (!n && !r) return _;
+	if (!n) return y;
+	if (!r) return v;
 	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = dn(i, o), l, u = 0;
-	if (c.center && (u = Bn(a, s), l = jn(c.center, u)), !l) return x;
+	if (c.center && (u = Bn(a, s), l = jn(c.center, u)), !l) return b;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && jn(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && jn(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= zn(n, l, u), f ||= zn(r, l, u), d && f ? S : d ? y : f ? b : v;
+	return p && jn(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && jn(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= zn(n, l, u), f ||= zn(r, l, u), d && f ? x : d ? v : f ? y : _;
 }
 function zn({ range: e, multipleOf: t }, n, r) {
 	let i = dn(e, n);
@@ -2365,9 +2365,9 @@ function Hn(e) {
 //#endregion
 //#region src/json-schema-subset/checker/numeric/checker.ts
 function Un(e, t) {
-	if (Wn(e) || Wn(t)) return C;
+	if (Wn(e) || Wn(t)) return S;
 	let n = Gn(e), r = Gn(t);
-	return n && r ? Pn(e, t) : n ? Fn(e, t) : r ? Le(Fn(t, e)) : Rn(e, t);
+	return n && r ? Pn(e, t) : n ? Fn(e, t) : r ? Re(Fn(t, e)) : Rn(e, t);
 }
 function Wn(e) {
 	let { multipleOf: t } = e;
@@ -2387,9 +2387,9 @@ var Kn = hn(0), qn = cn([
 	"hasRejection"
 ]);
 function Jn(e, t, n) {
-	if (Yn(t, n)) return x;
+	if (Yn(t, n)) return b;
 	let r = Xn(t, n);
-	if (!r) return x;
+	if (!r) return b;
 	let i = nr(t), a = nr(n), o = (t) => {
 		let n = i(t), r = a(t);
 		return rr(n, r) ? e.calculate(n, r) : 0;
@@ -2404,7 +2404,7 @@ function Jn(e, t, n) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? ut, a = n.additionalProperties ?? ut;
+		let i = t.additionalProperties ?? dt, a = n.additionalProperties ?? dt;
 		if (rr(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
@@ -2414,11 +2414,11 @@ function Jn(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 ? x : e && t ? S : e ? y : t ? b : v;
+	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? b : e && t ? x : e ? v : t ? y : _;
 	return m;
 }
 function Yn(e, t) {
-	return gn(Kn(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === _.Rejection;
+	return gn(Kn(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === g.Rejection;
 }
 function Xn(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;
@@ -2446,61 +2446,61 @@ function Zn(e, t) {
 }
 var Qn = (e, t) => {
 	switch (e) {
-		case _.Equals:
+		case g.Equals:
 			t.hasCommonInRequired = !0;
 			break;
-		case _.Containing:
+		case g.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case _.ContainedBy:
+		case g.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case _.Intersection:
+		case g.Intersection:
 			t.hasExtra1 = !0, t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case _.Rejection: t.hasRejection = !0;
+		case g.Rejection: t.hasRejection = !0;
 	}
 }, $n = (e, t) => {
 	switch (e) {
-		case _.Equals:
-		case _.ContainedBy:
+		case g.Equals:
+		case g.ContainedBy:
 			t.hasCommonInRequired = !0;
 			break;
-		case _.Intersection:
-		case _.Containing:
+		case g.Intersection:
+		case g.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case _.Rejection: t.hasRejection = !0;
+		case g.Rejection: t.hasRejection = !0;
 	}
 }, er = (e, t) => {
 	switch (e) {
-		case _.Equals:
-		case _.Containing:
+		case g.Equals:
+		case g.Containing:
 			t.hasCommonInRequired = !0;
 			break;
-		case _.Intersection:
-		case _.ContainedBy:
+		case g.Intersection:
+		case g.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case _.Rejection: t.hasRejection = !0;
+		case g.Rejection: t.hasRejection = !0;
 	}
 }, tr = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
-		case _.Equals:
+		case g.Equals:
 			o = !0;
 			break;
-		case _.Containing:
+		case g.Containing:
 			i = !0, o = !0;
 			break;
-		case _.ContainedBy:
+		case g.ContainedBy:
 			a = !0, o = !0;
 			break;
-		case _.Intersection:
+		case g.Intersection:
 			i = !0, a = !0, o = !0;
 			break;
-		case _.Rejection: i = !0, a = !0;
+		case g.Rejection: i = !0, a = !0;
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
@@ -2514,40 +2514,40 @@ function nr(e) {
 		});
 	}
 	return (e) => {
-		if (n && kt(n, e) === Ot.Invalid) return dt;
+		if (n && kt(n, e) === k.Invalid) return ft;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || ut;
+		return ((t && t[e]) ?? r) || dt;
 	};
 }
 function rr(e, t) {
-	let n = O(e), r = O(t);
-	return n !== D.Never || r !== D.Never;
+	let n = D(e), r = D(t);
+	return n !== E.Never || r !== E.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
 var ir = hn(0);
 function ar(e, t) {
-	if (t.format && !e.format) return y;
-	if (e.format && t.format && e.format !== t.format) return C;
+	if (t.format && !e.format) return v;
+	if (e.format && t.format && e.format !== t.format) return S;
 	let n = gn(ir(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
-		case _.Rejection: return x;
-		case _.Containing: return r ? C : y;
-		case _.ContainedBy: return i ? C : b;
-		case _.Equals: return r && i ? e.pattern === t.pattern ? v : C : r ? v | b : i ? v | y : v;
-		case _.Intersection: return r && i ? C : r ? S | x | b : i ? S | x | y : S;
+		case g.Rejection: return b;
+		case g.Containing: return r ? S : v;
+		case g.ContainedBy: return i ? S : y;
+		case g.Equals: return r && i ? e.pattern === t.pattern ? _ : S : r ? _ | y : i ? _ | v : _;
+		case g.Intersection: return r && i ? S : r ? x | b | y : i ? x | b | v : x;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
 function or(e, t, n) {
 	let r = {}, i = [], a = Sn(cr(e, r)), o = sr(), s = On(e);
-	r.isEquals = xn(De), r.calculate = Ke({
+	r.isEquals = xn(Oe), r.calculate = qe({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!ur(r ? Le(n) : n)) return;
+			if (!ur(r ? Re(n) : n)) return;
 			let a = r ? dr(t, e) : dr(e, t);
 			a && i.push(a);
 		}
@@ -2560,93 +2560,93 @@ function or(e, t, n) {
 }
 var sr = () => (e) => {
 	let t;
-	switch (O(e)) {
-		case D.Not:
+	switch (D(e)) {
+		case E.Not:
 			t = {
-				kind: Ge.Not,
+				kind: Ke.Not,
 				expression: e.not
 			};
 			break;
-		case D.Combination:
+		case E.Combination:
 			if ("allOf" in e) t = {
-				kind: Ge.AllOf,
-				expressions: lr(e.allOf, D.Any)
+				kind: Ke.AllOf,
+				expressions: lr(e.allOf, E.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: Ge.AnyOf,
-				expressions: lr(e.anyOf, D.Never)
+				kind: Ke.AnyOf,
+				expressions: lr(e.anyOf, E.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: Ge.OneOf,
-				expressions: lr(e.oneOf, D.Never)
+				kind: Ke.OneOf,
+				expressions: lr(e.oneOf, E.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: Ge.Leaf };
+		default: t = { kind: Ke.Leaf };
 	}
 	return t;
 }, cr = (e, t) => (n, r) => {
-	let i = O(n), a = O(r);
-	if (i === D.Extends || a === D.Extends) return e.calculate(n, r);
+	let i = D(n), a = D(r);
+	if (i === E.Extends || a === E.Extends) return e.calculate(n, r);
 	switch (i) {
-		case D.Any: return a === D.Any ? v : y;
-		case D.Never: return a === D.Never ? v : b;
+		case E.Any: return a === E.Any ? _ : v;
+		case E.Never: return a === E.Never ? _ : y;
 	}
 	switch (a) {
-		case D.Any: return b;
-		case D.Never: return y;
+		case E.Any: return y;
+		case E.Never: return v;
 	}
-	if (i === D.EnumOrConst && a === D.EnumOrConst) return wn(t, n, r);
-	if (i === D.EnumOrConst) return Tn(n, r);
-	if (a === D.EnumOrConst) return Le(Tn(r, n));
-	if (i !== a) return x;
+	if (i === E.EnumOrConst && a === E.EnumOrConst) return wn(t, n, r);
+	if (i === E.EnumOrConst) return Tn(n, r);
+	if (a === E.EnumOrConst) return Re(Tn(r, n));
+	if (i !== a) return b;
 	switch (i) {
-		case D.Null: return v;
-		case D.Numeric: return Un(n, r);
-		case D.String: return ar(n, r);
-		case D.Boolean: return v;
-		case D.Object: return Jn(t, n, r);
-		case D.Array: return yn(t, n, r);
+		case E.Null: return _;
+		case E.Numeric: return Un(n, r);
+		case E.String: return ar(n, r);
+		case E.Boolean: return _;
+		case E.Object: return Jn(t, n, r);
+		case E.Array: return yn(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
 function lr(e, t) {
-	return e.filter((e) => O(e) !== t);
+	return e.filter((e) => D(e) !== t);
 }
 function ur(e) {
-	return !ke(e) && !je(e) && (Ae(e) || Ne(e) || Me(e));
+	return !Ae(e) && !Me(e) && (je(e) || Pe(e) || Ne(e));
 }
 function dr(e, t) {
-	let n = ht(t);
+	let n = gt(t);
 	if (!n) return;
-	let r = O(e), i = O(t);
+	let r = D(e), i = D(t);
 	if (r !== i) return [...n, "type"];
 	let a = e, o = t;
 	switch (i) {
-		case D.String:
+		case E.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 D.Numeric:
+		case E.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 D.Array:
+		case E.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 D.Object: {
+		case E.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 D.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
+		case E.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
 	}
 	return n;
 }
@@ -2657,7 +2657,7 @@ var fr = class e {
 		this.extendsSchemaClasses = Object.freeze([...e]);
 	}
 	tryCompiledExtendsSchema(e, t) {
-		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(Ce(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(we(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -2667,7 +2667,7 @@ var fr = 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 |= Pe(t);
+		for (let t of a) r && (t = e.swap(t)), i |= Fe(t);
 		return i;
 	}
 	equals(e, t) {
@@ -2679,8 +2679,8 @@ var fr = class e {
 	}
 	static swap(e) {
 		switch (e) {
-			case _.Containing: return _.ContainedBy;
-			case _.ContainedBy: return _.Containing;
+			case g.Containing: return g.ContainedBy;
+			case g.ContainedBy: return g.Containing;
 			default: return e;
 		}
 	}
@@ -2691,12 +2691,12 @@ function pr(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw hr(e, r, "$"), new qe(e);
+		throw hr(e, r, "$"), new Je(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(Ye(e));
+		for (let e of a) console.warn(Xe(e));
 	}
 	return i;
 }
@@ -2704,14 +2704,14 @@ function mr(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) && hr(e, i, "$1"), Array.isArray(a) && hr(e, a, "$2"), new qe(e);
+		throw Array.isArray(i) && hr(e, i, "$1"), Array.isArray(a) && hr(e, a, "$2"), new Je(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(Ye(e));
+		for (let e of s) console.warn(Xe(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Ye(e));
+		for (let e of l) console.warn(Xe(e));
 	}
 	return [o, c];
 }
@@ -2736,7 +2736,7 @@ function _r({ extendsSchemaClasses: e, delegate: t } = {}) {
 	return Object.freeze({
 		compile: (e, r, i) => pr(e, (e) => nn(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = mr(e, r, (e) => nn(e, n, void 0, t), i), { errorPath: s, expression: c } = or(n, a, o), l = ke(c) || je(c), u = Ae(c) || Ne(c) || Me(c);
+			let [a, o] = mr(e, r, (e) => nn(e, n, void 0, t), i), { errorPath: s, expression: c } = or(n, a, o), l = Ae(c) || Me(c), u = je(c) || Pe(c) || Ne(c);
 			return l && !u ? { result: gr.True } : !l && u ? {
 				errorPath: s,
 				result: gr.False
@@ -2767,7 +2767,7 @@ var Er = class e {
 		this.id = e, this.value = t, this.context = Tr(n);
 	}
 	compare(e) {
-		return pt(e) && O(e) === D.Any ? [_.ContainedBy] : this.compareImpl(e);
+		return mt(e) && D(e) === E.Any ? [g.ContainedBy] : this.compareImpl(e);
 	}
 }, Dr = class e extends Er {
 	static isMatch(e) {
@@ -2779,13 +2779,13 @@ var Er = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (Cr(t)) return [_.ContainedBy];
+		if (Cr(t)) return [g.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.enum), n = _.Equals;
-			for (let r of t.value.enum) e.has(r) || (n = _.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [_.Rejection] : [_.Intersection];
+			let e = new Set(this.value.enum), n = g.Equals;
+			for (let r of t.value.enum) e.has(r) || (n = g.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [g.Rejection] : [g.Intersection];
 		}
-		return [_.Rejection];
+		return [g.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -2807,7 +2807,7 @@ var Er = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [_.Equals] : (Er.setError(this, t, "edgeError.binDiffType"), [_.Rejection]);
+		return t instanceof e ? [g.Equals] : (Er.setError(this, t, "edgeError.binDiffType"), [g.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
@@ -2821,7 +2821,7 @@ var Er = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [_.Equals] : (Er.setError(this, t, "edgeError.artifactDiffType"), [_.Rejection]);
+		return t instanceof e ? [g.Equals] : (Er.setError(this, t, "edgeError.artifactDiffType"), [g.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
@@ -7248,8 +7248,7 @@ var hf = W(K([G({
 			kind: q("agent"),
 			code: wd().optional(),
 			model: J,
-			prompt: Af,
-			system: J,
+			prompt: J,
 			maxRounds: bd(),
 			tools: W(G({
 				id: J,
@@ -7655,35 +7654,39 @@ function Zf(e) {
 }
 var Qf = /* @__PURE__ */ new WeakMap();
 function $f(e, t) {
-	if (typeof t == "boolean") return t;
+	return ep(e, t).length == 0;
+}
+function ep(e, t) {
+	if (typeof t == "boolean") return t ? [] : ["The schema does not allow any value."];
 	let n = Zf(t);
-	if (n == null || n.properties != null && Zf(n.properties) == null) return !1;
+	if (n == null || n.properties != null && Zf(n.properties) == null) return ["Invalid output schema."];
 	try {
 		let t = Qf.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 xe(structuredClone(n), r), Qf.set(n, t);
+			t = new Se(structuredClone(n), r), Qf.set(n, t);
 		}
-		return t.validate(e).valid;
+		let r = t.validate(e);
+		return r.valid ? [] : r.errors.map((e) => `${e.instanceLocation || "/"}: ${e.error}`);
 	} catch {
-		return !1;
+		return ["Output schema validation failed."];
 	}
 }
 //#endregion
 //#region src/trigger/common/config.ts
-function ep(t, n) {
+function tp(t, n) {
 	return e(n[t.handle], t.value);
 }
-function tp(e, t) {
-	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, ep(e, t) ?? null]] : []));
-}
 function np(e, t) {
+	return Object.fromEntries(e.flatMap((e) => "handle" in e ? [[e.handle, tp(e, t) ?? null]] : []));
+}
+function rp(e, t) {
 	let n = e.filter((e) => "handle" in e), r = new Set(n.map((e) => e.handle));
 	if (r.size !== n.length) throw TypeError("Trigger config has duplicate input handles.");
 	let i = Object.keys(t).find((e) => !r.has(e));
 	if (i != null) throw TypeError(`Unknown Trigger config input "${i}".`);
 	let a = Object.fromEntries(n.map((e) => {
-		let n = ep(e, t) ?? null;
+		let n = tp(e, t) ?? null;
 		if (!(n === null && e.nullable) && !$f(n, e.jsonSchema)) throw TypeError(`Trigger config input "${e.handle}" does not match its declared schema.`);
 		return [e.handle, n];
 	}));
@@ -7692,7 +7695,7 @@ function np(e, t) {
 }
 //#endregion
 //#region src/base/common/json.ts
-function rp(e) {
+function ip(e) {
 	if (e === null || typeof e == "boolean" || typeof e == "string") return !0;
 	if (typeof e == "number") return Number.isFinite(e);
 	if (typeof e != "object") return !1;
@@ -7743,54 +7746,54 @@ function rp(e) {
 		}
 	}
 }
-function ip(e) {
+function ap(e) {
 	try {
-		return rp(e);
+		return ip(e);
 	} catch {
 		return !1;
 	}
 }
-function ap(e) {
+function op(e) {
 	try {
-		return typeof e == "object" && !!e && !Array.isArray(e) && rp(e);
+		return typeof e == "object" && !!e && !Array.isArray(e) && ip(e);
 	} catch {
 		return !1;
 	}
 }
 //#endregion
 //#region src/trigger/common/integration.ts
-var op = 65536, sp = 5, cp = /^\/v1\/integrations\/(endpoint_[0-9a-f]{32})$/, lp = new TextEncoder();
-function up(e) {
-	if (!ap(e) || e.checkpoint == null || !ip(e.checkpoint) || typeof e.hasMore != "boolean") throw TypeError("Listener page must contain a JSON checkpoint and a boolean hasMore.");
-	if (typeof e.dedupeKey != "string" || e.dedupeKey.length == 0 || lp.encode(e.dedupeKey).byteLength > 1024) throw TypeError("Listener page identity must contain between 1 and 1024 bytes.");
-	if (e.outputs !== null && !ap(e.outputs)) throw TypeError("Listener page outputs must be an object or null.");
-	if (lp.encode(JSON.stringify(e.checkpoint)).byteLength > 65536) throw TypeError("Listener checkpoint exceeds 64 KiB.");
-}
-var dp = class extends Error {
+var sp = 65536, cp = 5, lp = /^\/v1\/integrations\/(endpoint_[0-9a-f]{32})$/, up = new TextEncoder();
+function dp(e) {
+	if (!op(e) || e.checkpoint == null || !ap(e.checkpoint) || typeof e.hasMore != "boolean") throw TypeError("Listener page must contain a JSON checkpoint and a boolean hasMore.");
+	if (typeof e.dedupeKey != "string" || e.dedupeKey.length == 0 || up.encode(e.dedupeKey).byteLength > 1024) throw TypeError("Listener page identity must contain between 1 and 1024 bytes.");
+	if (e.outputs !== null && !op(e.outputs)) throw TypeError("Listener page outputs must be an object or null.");
+	if (up.encode(JSON.stringify(e.checkpoint)).byteLength > 65536) throw TypeError("Listener checkpoint exceeds 64 KiB.");
+}
+var fp = class extends Error {
 	constructor(...e) {
 		super(...e), this.name = "IntegrationConnectionError";
 	}
-}, fp = class extends Error {
+}, pp = class extends Error {
 	constructor(...e) {
 		super(...e), this.name = "PermanentIntegrationError";
 	}
-}, pp = class extends Error {
+}, mp = class extends Error {
 	constructor(...e) {
 		super(...e), this.name = "TransientIntegrationError";
 	}
 };
-function mp(e) {
-	return cp.exec(e.pathname)?.[1];
+function hp(e) {
+	return lp.exec(e.pathname)?.[1];
 }
-async function hp(e, t) {
+async function gp(e, t) {
 	if (e == null || e.length == 0) throw TypeError("Integration callback key is required.");
-	let n = await crypto.subtle.importKey("raw", lp.encode(e), {
+	let n = await crypto.subtle.importKey("raw", up.encode(e), {
 		hash: "SHA-256",
 		name: "HMAC"
-	}, !1, ["sign"]), r = new Uint8Array(await crypto.subtle.sign("HMAC", n, lp.encode(`open-flow-integration/v1/${t}`)));
+	}, !1, ["sign"]), r = new Uint8Array(await crypto.subtle.sign("HMAC", n, up.encode(`open-flow-integration/v1/${t}`)));
 	return btoa(String.fromCharCode(...r)).replaceAll("+", "-").replaceAll("/", "_").replaceAll("=", "");
 }
-async function gp(e, t, n, r) {
+async function _p(e, t, n, r) {
 	if (r == null) return `integration_${crypto.randomUUID().replaceAll("-", "")}`;
 	let i = JSON.stringify([
 		1,
@@ -7800,9 +7803,9 @@ async function gp(e, t, n, r) {
 		n,
 		r
 	]);
-	return [...new Uint8Array(await crypto.subtle.digest("SHA-256", lp.encode(i)))].map((e) => e.toString(16).padStart(2, "0")).join("");
+	return [...new Uint8Array(await crypto.subtle.digest("SHA-256", up.encode(i)))].map((e) => e.toString(16).padStart(2, "0")).join("");
 }
-var _p = {
+var vp = {
 	config: { source: "primary" },
 	connectionId: "connection-primary",
 	definition: {
@@ -7817,7 +7820,7 @@ var _p = {
 				outcome: "respond",
 				status: 404
 			};
-			let t = Sp(e.payload);
+			let t = Cp(e.payload);
 			if (t?.action == "handshake") return {
 				body: "accepted",
 				contentType: "text/plain",
@@ -7830,7 +7833,7 @@ var _p = {
 				reason: "Conformance delivery was ignored."
 			};
 			if (t?.action == "pages") {
-				let n = Sp(e.state?.checkpoint), r = typeof n?.page == "number" ? n.page + 1 : 1, i = typeof t.pages == "number" ? t.pages : 1, a = typeof t.deliveryId == "string" ? t.deliveryId : "pages";
+				let n = Cp(e.state?.checkpoint), r = typeof n?.page == "number" ? n.page + 1 : 1, i = typeof t.pages == "number" ? t.pages : 1, a = typeof t.deliveryId == "string" ? t.deliveryId : "pages";
 				return {
 					checkpoint: { page: r },
 					continue: r < i,
@@ -7843,7 +7846,7 @@ var _p = {
 					} }
 				};
 			}
-			let n = typeof t?.deliveryId == "string" ? t.deliveryId : "delivery", r = Sp(t?.body) ?? {};
+			let n = typeof t?.deliveryId == "string" ? t.deliveryId : "delivery", r = Cp(t?.body) ?? {};
 			return {
 				checkpoint: { deliveryId: n },
 				dedupeKey: n,
@@ -7856,24 +7859,24 @@ var _p = {
 			};
 		},
 		async reconcile(e) {
-			if (e.state == null) throw new fp("Conformance Integration state is missing.");
+			if (e.state == null) throw new pp("Conformance Integration state is missing.");
 			return await e.state.saveSubscription(e.active ? { endpointUrl: e.endpointUrl } : {}, new Date(e.now.getTime() + 6e4)), { outcome: "ready" };
 		}
 	},
 	publishedAt: "2026-08-21T00:00:30.000Z"
-}, vp = [
+}, yp = [
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "enforces callback routing, method, body, and handshake boundaries",
 		async verify(e) {
 			let t = new URL(e.endpointUrl);
-			await $(await xp(e, { url: new URL("/v1/integrations/not-an-endpoint", t).href }), { status: 404 }, "Malformed endpoint"), await $(await xp(e, { url: new URL("/v1/integrations/endpoint_00000000000000000000000000000000", t).href }), { status: 404 }, "Unknown endpoint"), await $(await xp(e, { method: "GET" }), {
+			await $(await Sp(e, { url: new URL("/v1/integrations/not-an-endpoint", t).href }), { status: 404 }, "Malformed endpoint"), await $(await Sp(e, { url: new URL("/v1/integrations/endpoint_00000000000000000000000000000000", t).href }), { status: 404 }, "Unknown endpoint"), await $(await Sp(e, { method: "GET" }), {
 				headers: { allow: "POST" },
 				status: 405
-			}, "Method"), await $(await xp(e, { body: "{" }), { status: 400 }, "Invalid JSON"), await $(await xp(e, {
+			}, "Method"), await $(await Sp(e, { body: "{" }), { status: 400 }, "Invalid JSON"), await $(await Sp(e, {
 				body: "a=1",
 				headers: { "content-type": "application/x-www-form-urlencoded" }
-			}), { status: 400 }, "Unsupported body format"), await $(await xp(e, { body: "x".repeat(65537) }), { status: 413 }, "Oversized body"), await $(await Z(e, { action: "handshake" }), {
+			}), { status: 400 }, "Unsupported body format"), await $(await Sp(e, { body: "x".repeat(65537) }), { status: 413 }, "Oversized body"), await $(await Z(e, { action: "handshake" }), {
 				body: "accepted",
 				headers: {
 					"content-type": "text/plain",
@@ -7884,7 +7887,7 @@ var _p = {
 		}
 	},
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "verifies initializing callbacks before activating the subscription",
 		async verify(e) {
 			await $(await Z(e, {
@@ -7915,7 +7918,7 @@ var _p = {
 		}
 	},
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "deduplicates keyed events and rejects conflicting payloads",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z");
@@ -7937,7 +7940,7 @@ var _p = {
 		}
 	},
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "bounds callback pages and resumes from the durable checkpoint",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z");
@@ -7952,7 +7955,7 @@ var _p = {
 		}
 	},
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "restores subscription state and callback admission after restart",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z"), await Z(e, {
@@ -7977,7 +7980,7 @@ var _p = {
 		}
 	},
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "retires the old runtime before activating a republished target",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z");
@@ -7994,7 +7997,7 @@ var _p = {
 		}
 	},
 	{
-		fixture: _p,
+		fixture: vp,
 		name: "retires the remote subscription and rejects later callbacks",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z"), await e.retire("2026-08-21T00:00:40.000Z"), await $(await Z(e, {
@@ -8006,8 +8009,8 @@ var _p = {
 			}), { status: 404 }, "Reconciled retirement"), Q((await e.state()).payloads, [], "Retired payloads");
 		}
 	}
-], yp = {
-	..._p,
+], bp = {
+	...vp,
 	definition: {
 		initialState: {
 			checkpoint: null,
@@ -8046,30 +8049,30 @@ var _p = {
 			}
 		}
 	}
-}, bp = [
+}, xp = [
 	{
-		fixture: yp,
+		fixture: bp,
 		name: "drains listener pages without a callback and resumes periodic scanning after restart",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z"), Q((await e.state()).checkpoint, 7, "Drained cursor"), Q((await e.state()).payloads.length, 7, "Drained pages"), await e.restart(), await e.reconcile("2026-08-21T00:01:31.000Z"), Q((await e.state()).checkpoint, 8, "Periodic cursor"), Q((await e.state()).payloads.length, 8, "Periodic pages");
 		}
 	},
 	{
-		fixture: yp,
+		fixture: bp,
 		name: "persists verified listener wakes across restart without duplicating accepted pages",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z"), await $(await Z(e, {}, !1), { status: 404 }, "Invalid wake"), await $(await Z(e, {}), { status: 202 }, "First wake"), await $(await Z(e, {}), { status: 202 }, "Duplicate wake"), await e.restart(), await e.reconcile("2026-08-21T00:00:32.000Z"), Q((await e.state()).checkpoint, 7, "Retained cursor"), Q((await e.state()).payloads.length, 7, "Deduplicated pages");
 		}
 	},
 	{
-		fixture: yp,
+		fixture: bp,
 		name: "preserves a listener cursor on unchanged publication and fences retirement",
 		async verify(e) {
 			await e.reconcile("2026-08-21T00:00:31.000Z"), await e.republish("2026-08-21T00:00:40.000Z"), Q((await e.state()).checkpoint, 7, "Republished cursor"), await e.reconcile("2026-08-21T00:01:31.000Z"), Q((await e.state()).payloads.length, 8, "Republished pages"), await e.retire("2026-08-21T00:01:40.000Z"), await $(await Z(e, {}), { status: 404 }, "Retired wake"), await e.reconcile("2026-08-21T00:02:40.000Z"), Q((await e.state()).payloads.length, 8, "Retired pages");
 		}
 	}
 ];
-function xp(e, t = {}) {
+function Sp(e, t = {}) {
 	return e.request(new Request(t.url ?? e.endpointUrl, {
 		...t.body == null ? {} : { body: t.body },
 		headers: {
@@ -8080,7 +8083,7 @@ function xp(e, t = {}) {
 	}));
 }
 function Z(e, t, n = !0) {
-	return xp(e, {
+	return Sp(e, {
 		body: JSON.stringify(t),
 		headers: n ? { "x-integration-secret": e.callbackSecret } : {}
 	});
@@ -8088,7 +8091,7 @@ function Z(e, t, n = !0) {
 function Q(e, t, n) {
 	if (!Mr(e, t)) throw Error(`${n}: expected ${JSON.stringify(t)}, received ${JSON.stringify(e)}.`);
 }
-function Sp(e) {
+function Cp(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
 async function $(e, t, n) {
@@ -8096,4 +8099,4 @@ async function $(e, t, n) {
 	for (let [r, i] of Object.entries(t.headers ?? {})) Q(e.headers.get(r), i, `${n} header ${r}`);
 }
 //#endregion
-export { dp as IntegrationConnectionError, fp as PermanentIntegrationError, pp as TransientIntegrationError, hp as integrationCallbackSecret, vp as integrationConformanceCases, mp as integrationEndpointId, gp as integrationOccurrenceId, bp as listenerConformanceCases, op as maximumIntegrationBodyBytes, sp as maximumIntegrationDeliveryPages, np as resolveTriggerConfig, tp as triggerConfigValues, up as validateListenerPage };
+export { fp as IntegrationConnectionError, pp as PermanentIntegrationError, mp as TransientIntegrationError, gp as integrationCallbackSecret, yp as integrationConformanceCases, hp as integrationEndpointId, _p as integrationOccurrenceId, xp as listenerConformanceCases, sp as maximumIntegrationBodyBytes, cp as maximumIntegrationDeliveryPages, rp as resolveTriggerConfig, np as triggerConfigValues, dp as validateListenerPage };