@oomol-lab/open-flow 0.1.0-beta.6 → 0.1.0-beta.7

package/dist/browser/{flowChanges-BDqD_Q4G.js → flowChanges-CixKyW54.js}

@@ -1,6 +1,6 @@
 import { a as e, f as t } from "./dist-C46JByB-.js";
 import { Kn as n, Ot as r, Un as i, Vn as a, Wn as o, jt as s, nr as c } from "./getPseudoElementBounds-5LArT6Xc.js";
-import { r as l, t as u } from "./icons-CRxvozBE.js";
+import { r as l, t as u } from "./icons-KIOgjHpD.js";
 import { L as d, d as f, f as p, g as m, l as ee, n as h, s as g, u as te } from "./DesignerIcon-XKBRy_0Q.js";
 import { a as ne, r as re } from "./languages-DgJehE1g.js";
 import "./lib-C5Ipyfps.js";
@@ -6056,7 +6056,7 @@ var tn = class {
 	"request.failed": "notice.requestFailed",
 	"response.invalid": "notice.error.responseInvalid"
 };
-function rn(e, t) {
+function O(e, t) {
 	if (e instanceof de) {
 		let n = nn[e.code];
 		return n == null ? {
@@ -6080,7 +6080,7 @@ function rn(e, t) {
 }
 //#endregion
 //#region src/workbench/browser/runtime/revisionView.ts
-var an = /* @__PURE__ */ new WeakMap(), on = class {
+var rn = /* @__PURE__ */ new WeakMap(), an = class {
 	#e;
 	#t;
 	#n = /* @__PURE__ */ new WeakMap();
@@ -6217,13 +6217,13 @@ var an = /* @__PURE__ */ new WeakMap(), on = class {
 		return !1;
 	}
 };
-function sn(e) {
-	let t = an.get(e);
-	return t ?? (t = new on(e), an.set(e, t)), t;
+function on(e) {
+	let t = rn.get(e);
+	return t ?? (t = new an(e), rn.set(e, t)), t;
 }
 //#endregion
 //#region src/workbench/browser/runtime/runs/runStore.ts
-var cn = {
+var sn = {
 	eventCursor: 0,
 	eventFilter: "all",
 	events: [],
@@ -6234,18 +6234,18 @@ var cn = {
 	loadingMore: !1,
 	observationFailed: !1,
 	runs: []
-}, ln = 100, un = 500, dn = 1200, fn = 6e4;
-function pn(e) {
+}, cn = 100, ln = 500, un = 1200, dn = 6e4;
+function fn(e) {
 	return e?.status == "queued" || e?.status == "starting" || e?.status == "running" || e?.status == "waiting";
 }
-var mn = class {
+var pn = class {
 	#e = new tn();
 	#t;
 	#n;
 	#r = new tn();
 	#i = new tn();
 	#a;
-	#o = t(cn);
+	#o = t(sn);
 	#s;
 	constructor(t, n, r = ot()) {
 		this.#t = t, this.#n = r, this.#a = n, this.$ = {
@@ -6273,14 +6273,14 @@ var mn = class {
 		this.#o.dispose();
 	}
 	reset() {
-		this.#e.invalidate(), this.#r.invalidate(), this.#i.invalidate(), this.#f(), this.#o.set(cn);
+		this.#e.invalidate(), this.#r.invalidate(), this.#i.invalidate(), this.#f(), this.#o.set(sn);
 	}
 	async load(e) {
 		let t = this.#r.begin();
 		this.#i.invalidate(), this.#f(), this.#a(void 0);
 		let n = this.#o.value, r = n.run?.flowId == e ? n.cancelingRunId : void 0;
 		n.cancelingRunId != null && r == null && this.#e.invalidate(), this.#o.set({
-			...cn,
+			...sn,
 			...r == null ? {} : { cancelingRunId: r },
 			eventFilter: n.eventFilter,
 			loading: !0,
@@ -6302,7 +6302,7 @@ var mn = class {
 			this.#p({
 				loadFailed: !0,
 				loading: !1
-			}), this.#a(rn(e, this.#n.t));
+			}), this.#a(O(e, this.#n.t));
 		}
 	}
 	async loadMore() {
@@ -6331,7 +6331,7 @@ var mn = class {
 			this.#p({
 				loadMoreFailed: !0,
 				loadingMore: !1
-			}), this.#a(rn(e, this.#n.t));
+			}), this.#a(O(e, this.#n.t));
 		}
 	}
 	changed(e) {
@@ -6357,7 +6357,7 @@ var mn = class {
 	}
 	async cancel() {
 		let e = this.#o.value.run;
-		if (!pn(e) || this.#o.value.cancelingRunId != null || this.#o.value.resolvingAction != null) return;
+		if (!fn(e) || this.#o.value.cancelingRunId != null || this.#o.value.resolvingAction != null) return;
 		let t = this.#e.begin();
 		this.#a(void 0), this.#p({ cancelingRunId: e.runId });
 		try {
@@ -6374,7 +6374,7 @@ var mn = class {
 			let a = this.#i.begin();
 			this.#f(), await this.#l(i, a);
 		} catch (e) {
-			t() && this.#a(rn(e, this.#n.t));
+			t() && this.#a(O(e, this.#n.t));
 		} finally {
 			t() && this.#o.value.cancelingRunId == e.runId && this.#p({ cancelingRunId: void 0 });
 		}
@@ -6400,7 +6400,7 @@ var mn = class {
 				let c = this.#o.value.target;
 				c != null && this.#u(c.flowId);
 			} catch (e) {
-				this.#o.value.run?.runId == t.runId && this.#a(rn(e, this.#n.t));
+				this.#o.value.run?.runId == t.runId && this.#a(O(e, this.#n.t));
 			} finally {
 				this.#o.value.resolvingAction == e && this.#p({ resolvingAction: void 0 });
 			}
@@ -6449,7 +6449,7 @@ var mn = class {
 		try {
 			let r = this.#o.value.eventCursor, [i, a] = await Promise.allSettled([this.#t.getRun(e.runId), this.#t.getRunEvents(e.runId, {
 				after: r,
-				limit: ln
+				limit: cn
 			})]);
 			if (i.status == "rejected") throw i.reason;
 			if (!t() || this.#o.value.run?.runId != e.runId) return;
@@ -6473,10 +6473,10 @@ var mn = class {
 				run: o,
 				runs: this.#o.value.runs.map((e) => e.runId == o.runId ? o : e)
 			}), await this.#d(o, t), ue(o.status) && s.done) return;
-			let c = o.status == "queued" || o.status == "starting", l = c && o.status == e.status ? n + 1 : 0, u = ue(o.status) || s.events.length == ln ? 0 : o.status == "waiting" ? fn : c ? Math.min(dn, un * 2 ** Math.max(0, l - 1)) : dn;
+			let c = o.status == "queued" || o.status == "starting", l = c && o.status == e.status ? n + 1 : 0, u = ue(o.status) || s.events.length == cn ? 0 : o.status == "waiting" ? dn : c ? Math.min(un, ln * 2 ** Math.max(0, l - 1)) : un;
 			this.#s = globalThis.setTimeout(() => void this.#l(o, t, l), u);
 		} catch (n) {
-			t() && this.#o.value.run?.runId == e.runId && (this.#p({ observationFailed: !0 }), this.#a(rn(n, this.#n.t)));
+			t() && this.#o.value.run?.runId == e.runId && (this.#p({ observationFailed: !0 }), this.#a(O(n, this.#n.t)));
 		}
 	}
 	async #u(e) {
@@ -6506,109 +6506,109 @@ var mn = class {
 			...e
 		});
 	}
-}, hn = ["overview", "detail"];
+}, mn = ["overview", "detail"];
 `${JSON.stringify("open-flow-engine/v1")}`;
 //#endregion
 //#region src/json-schema-subset/utils.ts
-var gn = 0;
-function _n() {
-	let e = gn;
-	return gn += 1, e;
+var hn = 0;
+function gn() {
+	let e = hn;
+	return hn += 1, e;
 }
-function vn(e) {
+function _n(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) vn(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) _n(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function yn(e, t) {
+function vn(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function bn(e) {
+function yn(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = bn(r);
+		for (let [n, r] of e.entries()) t[n] = yn(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = bn(e[n]);
+		for (let n in e) t[n] = yn(e[n]);
 		return t;
 	}
 }
-function xn(e, t) {
+function bn(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 (!xn(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!bn(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !xn(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !bn(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 O = Object.freeze({
+var k = Object.freeze({
 	Equals: 0,
 	Containing: 1,
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), k = On(O.Equals), A = On(O.Containing), j = On(O.ContainedBy), M = On(O.Rejection), N = On(O.Intersection), Sn = vn([
-	[O.Equals, k],
-	[O.Containing, A],
-	[O.ContainedBy, j],
-	[O.Rejection, M],
-	[O.Intersection, N]
-]), P = (() => {
+}), A = Dn(k.Equals), j = Dn(k.Containing), M = Dn(k.ContainedBy), N = Dn(k.Rejection), P = Dn(k.Intersection), xn = _n([
+	[k.Equals, A],
+	[k.Containing, j],
+	[k.ContainedBy, M],
+	[k.Rejection, N],
+	[k.Intersection, P]
+]), F = (() => {
 	let e = 0;
-	for (let [t, n] of Sn) e |= n;
+	for (let [t, n] of xn) e |= n;
 	return e;
 })();
+function Sn(e) {
+	return !!(e & A);
+}
 function Cn(e) {
-	return !!(e & k);
+	return !!(e & j);
 }
 function wn(e) {
-	return !!(e & A);
+	return !!(e & M);
 }
 function Tn(e) {
-	return !!(e & j);
+	return !!(e & N);
 }
 function En(e) {
-	return !!(e & M);
+	return !!(e & P);
 }
 function Dn(e) {
-	return !!(e & N);
-}
-function On(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function kn(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : An(t, r, e), n += 1, t) };
+function On(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : kn(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function An(e, t, n) {
+function kn(e, t, n) {
 	let r = 0;
-	for (let [i, a] of Sn) if (a & e) {
-		for (let [e, a] of Sn) if (a & t && (r |= n(i, e), r === P)) return r;
+	for (let [i, a] of xn) if (a & e) {
+		for (let [e, a] of xn) if (a & t && (r |= n(i, e), r === F)) return r;
 	}
 	return r;
 }
 //#endregion
 //#region src/json-schema-subset/expression/calculator.ts
-var F = Object.freeze({
+var I = Object.freeze({
 	Save: 0,
 	OneOf: 1,
 	AllOf: 2,
@@ -6616,288 +6616,288 @@ var F = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function jn(e, t) {
+function An(e, t) {
 	switch (e) {
-		case F.Save: return t[0];
-		case F.OneOf: return Nn(t);
-		case F.AllOf:
-		case F.AnyOf: return Pn(e, t);
-		case F.Not:
-		case F.Swap: return Fn(e, t[0]);
+		case I.Save: return t[0];
+		case I.OneOf: return Mn(t);
+		case I.AllOf:
+		case I.AnyOf: return Nn(e, t);
+		case I.Not:
+		case I.Swap: return Pn(e, t[0]);
 	}
 }
-function Mn(e) {
-	return Fn(F.Swap, e);
+function jn(e) {
+	return Pn(I.Swap, e);
 }
-function Nn(e) {
-	let t = Pn(F.AnyOf, e), n = [];
+function Mn(e) {
+	let t = Nn(I.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 = Pn(F.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = Nn(I.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = Pn(F.AnyOf, n), i = Fn(F.Not, r);
-	return Pn(F.AllOf, [t, i]);
+	let r = Nn(I.AnyOf, n), i = Pn(I.Not, r);
+	return Nn(I.AllOf, [t, i]);
 }
-function Pn(e, t) {
+function Nn(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
-		case F.AllOf:
-			n = kn(In);
+		case I.AllOf:
+			n = On(Fn);
 			break;
-		case F.AnyOf:
-			n = kn(Ln);
+		case I.AnyOf:
+			n = On(In);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function Fn(e, t) {
+function Pn(e, t) {
 	let n, r = 0;
 	switch (e) {
-		case F.Not:
-			n = Rn;
+		case I.Not:
+			n = Ln;
 			break;
-		case F.Swap:
-			n = zn;
+		case I.Swap:
+			n = Rn;
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of Sn) i & t && (r |= n(e));
+	for (let [e, i] of xn) i & t && (r |= n(e));
 	return r;
 }
-function In(e, t) {
+function Fn(e, t) {
 	let n = 0;
 	switch (e) {
-		case O.Equals:
+		case k.Equals:
 			switch (t) {
-				case O.Equals:
-					n = k;
+				case k.Equals:
+					n = A;
 					break;
-				case O.Containing:
-					n = k;
+				case k.Containing:
+					n = A;
 					break;
-				case O.ContainedBy:
-					n = j;
+				case k.ContainedBy:
+					n = M;
 					break;
-				case O.Rejection:
+				case k.Rejection:
 					n = 0;
 					break;
-				case O.Intersection: n = j;
+				case k.Intersection: n = M;
 			}
 			break;
-		case O.Containing:
+		case k.Containing:
 			switch (t) {
-				case O.Equals:
-					n = k;
-					break;
-				case O.Containing:
-					n = k | A;
+				case k.Equals:
+					n = A;
 					break;
-				case O.ContainedBy:
-					n = j;
+				case k.Containing:
+					n = A | j;
 					break;
-				case O.Rejection:
+				case k.ContainedBy:
 					n = M;
 					break;
-				case O.Intersection: n = N | j;
+				case k.Rejection:
+					n = N;
+					break;
+				case k.Intersection: n = P | M;
 			}
 			break;
-		case O.ContainedBy:
+		case k.ContainedBy:
 			switch (t) {
-				case O.Equals:
-					n = j;
+				case k.Equals:
+					n = M;
 					break;
-				case O.Containing:
-					n = j;
+				case k.Containing:
+					n = M;
 					break;
-				case O.ContainedBy:
-					n = j;
+				case k.ContainedBy:
+					n = M;
 					break;
-				case O.Rejection:
+				case k.Rejection:
 					n = 0;
 					break;
-				case O.Intersection: n = j;
+				case k.Intersection: n = M;
 			}
 			break;
-		case O.Rejection:
+		case k.Rejection:
 			switch (t) {
-				case O.Equals:
+				case k.Equals:
 					n = 0;
 					break;
-				case O.Containing:
-					n = M;
+				case k.Containing:
+					n = N;
 					break;
-				case O.ContainedBy:
+				case k.ContainedBy:
 					n = 0;
 					break;
-				case O.Rejection:
-					n = M;
+				case k.Rejection:
+					n = N;
 					break;
-				case O.Intersection: n = M;
+				case k.Intersection: n = N;
 			}
 			break;
-		case O.Intersection: switch (t) {
-			case O.Equals:
-				n = j;
-				break;
-			case O.Containing:
-				n = N | j;
+		case k.Intersection: switch (t) {
+			case k.Equals:
+				n = M;
 				break;
-			case O.ContainedBy:
-				n = j;
+			case k.Containing:
+				n = P | M;
 				break;
-			case O.Rejection:
+			case k.ContainedBy:
 				n = M;
 				break;
-			case O.Intersection: n = j | M | N;
+			case k.Rejection:
+				n = N;
+				break;
+			case k.Intersection: n = M | N | P;
 		}
 	}
 	return n;
 }
-function Ln(e, t) {
+function In(e, t) {
 	let n = 0;
 	switch (e) {
-		case O.Equals:
+		case k.Equals:
 			switch (t) {
-				case O.Equals:
-					n = k;
-					break;
-				case O.Containing:
+				case k.Equals:
 					n = A;
 					break;
-				case O.ContainedBy:
-					n = k;
+				case k.Containing:
+					n = j;
 					break;
-				case O.Rejection:
+				case k.ContainedBy:
 					n = A;
 					break;
-				case O.Intersection: n = A;
+				case k.Rejection:
+					n = j;
+					break;
+				case k.Intersection: n = j;
 			}
 			break;
-		case O.Containing:
+		case k.Containing:
 			switch (t) {
-				case O.Equals:
-					n = A;
+				case k.Equals:
+					n = j;
 					break;
-				case O.Containing:
-					n = A;
+				case k.Containing:
+					n = j;
 					break;
-				case O.ContainedBy:
-					n = A;
+				case k.ContainedBy:
+					n = j;
 					break;
-				case O.Rejection:
-					n = A;
+				case k.Rejection:
+					n = j;
 					break;
-				case O.Intersection: n = A;
+				case k.Intersection: n = j;
 			}
 			break;
-		case O.ContainedBy:
+		case k.ContainedBy:
 			switch (t) {
-				case O.Equals:
-					n = k;
-					break;
-				case O.Containing:
+				case k.Equals:
 					n = A;
 					break;
-				case O.ContainedBy:
-					n = k | j;
+				case k.Containing:
+					n = j;
 					break;
-				case O.Rejection:
-					n = N;
+				case k.ContainedBy:
+					n = A | M;
 					break;
-				case O.Intersection: n = A | N;
+				case k.Rejection:
+					n = P;
+					break;
+				case k.Intersection: n = j | P;
 			}
 			break;
-		case O.Rejection:
+		case k.Rejection:
 			switch (t) {
-				case O.Equals:
-					n = A;
+				case k.Equals:
+					n = j;
 					break;
-				case O.Containing:
-					n = A;
+				case k.Containing:
+					n = j;
 					break;
-				case O.ContainedBy:
-					n = N;
+				case k.ContainedBy:
+					n = P;
 					break;
-				case O.Rejection:
-					n = M;
+				case k.Rejection:
+					n = N;
 					break;
-				case O.Intersection: n = N;
+				case k.Intersection: n = P;
 			}
 			break;
-		case O.Intersection: switch (t) {
-			case O.Equals:
-				n = A;
+		case k.Intersection: switch (t) {
+			case k.Equals:
+				n = j;
 				break;
-			case O.Containing:
-				n = A;
+			case k.Containing:
+				n = j;
 				break;
-			case O.ContainedBy:
-				n = A | N;
+			case k.ContainedBy:
+				n = j | P;
 				break;
-			case O.Rejection:
-				n = N;
+			case k.Rejection:
+				n = P;
 				break;
-			case O.Intersection: n = A | N;
+			case k.Intersection: n = j | P;
 		}
 	}
 	return n;
 }
-function Rn(e) {
+function Ln(e) {
 	let t = 0;
 	switch (e) {
-		case O.Equals:
-			t = M;
-			break;
-		case O.Containing:
-			t = M;
+		case k.Equals:
+			t = N;
 			break;
-		case O.ContainedBy:
+		case k.Containing:
 			t = N;
 			break;
-		case O.Rejection:
-			t = k | A;
+		case k.ContainedBy:
+			t = P;
 			break;
-		case O.Intersection: t = j | N;
+		case k.Rejection:
+			t = A | j;
+			break;
+		case k.Intersection: t = M | P;
 	}
 	return t;
 }
-function zn(e) {
+function Rn(e) {
 	let t = 0;
 	switch (e) {
-		case O.Equals:
-			t = k;
-			break;
-		case O.Containing:
-			t = j;
-			break;
-		case O.ContainedBy:
+		case k.Equals:
 			t = A;
 			break;
-		case O.Rejection:
+		case k.Containing:
 			t = M;
 			break;
-		case O.Intersection: t = N;
+		case k.ContainedBy:
+			t = j;
+			break;
+		case k.Rejection:
+			t = N;
+			break;
+		case k.Intersection: t = P;
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var I = Object.freeze({
+var L = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), Bn = (e) => (t, n) => {
+}), zn = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
 		expressions: null,
 		calculation: {
-			operator: F.Save,
+			operator: I.Save,
 			results: [0],
 			willSwap: !1,
 			count: 0
@@ -6916,10 +6916,10 @@ var I = Object.freeze({
 		for (; a.length > 0;) c(a.pop());
 	}
 	function o(t) {
-		let n = k, [r, o] = t.expressions;
+		let n = A, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== I.Leaf) {
+			if (a.kind !== L.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -6934,7 +6934,7 @@ var I = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== I.Leaf) {
+			if (c.kind !== L.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -6951,26 +6951,26 @@ var I = 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: F.Save,
+			operator: I.Save,
 			results: [n],
 			willSwap: !1,
 			count: 0
 		}, a.push(t);
 	}
 	function s(e, t) {
-		let n = F.Save, r;
+		let n = I.Save, r;
 		switch (e.kind) {
-			case I.Not:
-				n = F.Not, r = [e.expression];
+			case L.Not:
+				n = I.Not, r = [e.expression];
 				break;
-			case I.AllOf:
-				n = F.AllOf, r = [...e.expressions];
+			case L.AllOf:
+				n = I.AllOf, r = [...e.expressions];
 				break;
-			case I.AnyOf:
-				n = F.AnyOf, r = [...e.expressions];
+			case L.AnyOf:
+				n = I.AnyOf, r = [...e.expressions];
 				break;
-			case I.OneOf:
-				n = F.OneOf, r = [...e.expressions];
+			case L.OneOf:
+				n = I.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
 		}
@@ -6982,8 +6982,8 @@ var I = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = jn(t.operator, t.results);
-		if (r === 0 && (r = j), t.willSwap && (r = Mn(r)), n) {
+		let t = e.calculation, n = e.parent, r = An(t.operator, t.results);
+		if (r === 0 && (r = M), t.willSwap && (r = jn(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);
 		}
@@ -6991,79 +6991,79 @@ var I = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, Vn = class extends Error {
+}, Bn = class extends Error {
 	constructor(e = []) {
-		super(Wn(e)), this.name = "SchemaError", this.items = e;
+		super(Un(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Hn = Object.freeze({
+}, Vn = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Un(e) {
+function Hn(e) {
 	switch (e.kind) {
-		case Hn.Compiled: {
+		case Vn.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Hn.External: return String(e.error);
+		case Vn.External: return String(e.error);
 	}
 }
-function Wn(e) {
+function Un(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Un(e[0]);
-		default: return `${Un(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Hn(e[0]);
+		default: return `${Hn(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Gn = /* @__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 L(e) {
-	return Gn.has(e);
+var Wn = /* @__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 R(e) {
+	return Wn.has(e);
 }
-function Kn(e) {
-	for (let t in e) if (L(t)) return !1;
+function Gn(e) {
+	for (let t in e) if (R(t)) return !1;
 	return !0;
 }
-function R(e, ...t) {
+function z(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function z(e) {
+function B(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function qn({ path: e, errors: t }, n, ...r) {
-	t.push(Jn(e, r, n));
+function Kn({ path: e, errors: t }, n, ...r) {
+	t.push(qn(e, r, n));
 }
-function B({ path: e, warns: t }, n, ...r) {
-	t.push(Jn(e, r, n));
+function V({ path: e, warns: t }, n, ...r) {
+	t.push(qn(e, r, n));
 }
-function Jn(e, t, n) {
+function qn(e, t, n) {
 	return {
-		kind: Hn.Compiled,
+		kind: Vn.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function Yn(e) {
+function Jn(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] : Xn(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : Yn(n) && delete e[t]);
 	}
 	return e;
 }
-function Xn(e) {
+function Yn(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var Zn = Symbol("compiledId"), Qn = Symbol("compiledKind"), $n = Symbol("compiledPath"), er = Symbol("validatorLoader"), V = Object.freeze({
+var Xn = Symbol("compiledId"), Zn = Symbol("compiledKind"), Qn = Symbol("compiledPath"), $n = Symbol("validatorLoader"), H = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -7076,62 +7076,62 @@ var Zn = Symbol("compiledId"), Qn = Symbol("compiledKind"), $n = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), tr = vn(cr(V.Any, _n(), {}, () => () => !0)), nr = vn(cr(V.Never, _n(), {
+}), er = _n(sr(H.Any, gn(), {}, () => () => !0)), tr = _n(sr(H.Never, gn(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function rr(e) {
-	return typeof e != "object" || !e ? !1 : Zn in e;
-}
-function H(e) {
-	return typeof e != "object" || !e ? !1 : Zn in e && Qn in e;
+function nr(e) {
+	return typeof e != "object" || !e ? !1 : Xn in e;
 }
 function U(e) {
-	return H(e) ? e[Qn] : V.Extends;
+	return typeof e != "object" || !e ? !1 : Xn in e && Zn in e;
+}
+function W(e) {
+	return U(e) ? e[Zn] : H.Extends;
+}
+function rr(e) {
+	return U(e) || nr(e) ? e[Xn] : e.id;
 }
 function ir(e) {
-	return H(e) || rr(e) ? e[Zn] : e.id;
+	return U(e) ? e[Qn] : void 0;
 }
 function ar(e) {
-	return H(e) ? e[$n] : void 0;
-}
-function or(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, Zn, {
-		value: _n(),
+	return typeof e != "object" || !e || Object.defineProperty(e, Xn, {
+		value: gn(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
-function W(e, t, n, r = []) {
-	return cr(e, _n(), t, n && (() => n.compile(t)), r);
+function G(e, t, n, r = []) {
+	return sr(e, gn(), t, n && (() => n.compile(t)), r);
 }
-function sr(e) {
-	return cr(V.Never, _n(), { ...e }, e[er], e[$n]);
+function or(e) {
+	return sr(H.Never, gn(), { ...e }, e[$n], e[Qn]);
 }
-function cr(e, t, n, r, i = []) {
+function sr(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[Qn]: {
+		[Zn]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Zn]: {
+		[Xn]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[$n]: {
+		[Qn]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[er]: {
+		[$n]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -7148,16 +7148,16 @@ function cr(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function lr(e, t) {
-	let n = ur(e, t), r = dr(e, "maxItems", t), i = dr(e, "minItems", t), a = fr(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = pr(e, t) : t.additionalItems && B(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function cr(e, t) {
+	let n = lr(e, t), r = ur(e, "maxItems", t), i = ur(e, "minItems", t), a = dr(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = fr(e, t) : t.additionalItems && V(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 = mr(s, e.delegate));
-		let t = n.findIndex((e) => U(e) === V.Never);
-		t !== -1 && (n = n.splice(t), s = mr(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (B(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && U(s) === V.Never && (c = !0);
-	} else U(n) === V.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || B(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), W(c ? V.Never : V.Array, Yn({
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = pr(s, e.delegate));
+		let t = n.findIndex((e) => W(e) === H.Never);
+		t !== -1 && (n = n.splice(t), s = pr(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (V(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && W(s) === H.Never && (c = !0);
+	} else W(n) === H.Never && (c = !0);
+	return r !== void 0 && i !== void 0 && r < i && (l || V(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), G(c ? H.Never : H.Array, Jn({
 		type: "array",
 		items: n,
 		contains: a,
@@ -7167,12 +7167,12 @@ function lr(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function ur(e, { items: t }) {
-	if (!t) return W(V.Any, {}, e.delegate, e.path);
+function lr(e, { items: t }) {
+	if (!t) return G(H.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = K(R(e, "items", i), z(a));
+			let t = q(z(e, "items", i), B(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -7181,80 +7181,80 @@ function ur(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return K(R(e, "items"), z(t));
+	return q(z(e, "items"), B(t));
 }
-function dr(e, t, n) {
+function ur(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			B(e, "find NaN", t);
+			V(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			B(e, `find invalid number ${r}`, t);
+			V(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function fr(e, { contains: t }) {
-	return t ? K(R(e, "contains"), z(t)) : W(V.Any, {}, e.delegate, e.path);
+function dr(e, { contains: t }) {
+	return t ? q(z(e, "contains"), B(t)) : G(H.Any, {}, e.delegate, e.path);
 }
-function pr(e, { additionalItems: t }) {
+function fr(e, { additionalItems: t }) {
 	switch (typeof t) {
-		case "boolean": return t ? W(V.Any, {}, e.delegate, e.path) : !1;
-		case "object": return K(R(e, "additionalItems"), t);
-		default: return W(V.Any, {}, e.delegate, e.path);
+		case "boolean": return t ? G(H.Any, {}, e.delegate, e.path) : !1;
+		case "object": return q(z(e, "additionalItems"), t);
+		default: return G(H.Any, {}, e.delegate, e.path);
 	}
 }
-function mr(e, t) {
-	return e === void 0 ? W(V.Never, {
+function pr(e, t) {
+	return e === void 0 ? G(H.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : H(e) ? U(e) === V.Never ? e : sr(e) : e;
+	}, t) : U(e) ? W(e) === H.Never ? e : or(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var hr = Object.freeze([
+var mr = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function gr(e, t, n, r) {
-	if (n.length === 0) return qn(e, "disable empty list", t), null;
+function hr(e, t, n, r) {
+	if (n.length === 0) return Kn(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = K(R(e, t, r), z(a));
+		let n = q(z(e, t, r), B(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
 	let a = 0, o = 0;
-	for (let e of i) switch (U(e)) {
-		case V.Any:
+	for (let e of i) switch (W(e)) {
+		case H.Any:
 			a += 1;
 			break;
-		case V.Never: o += 1;
+		case H.Never: o += 1;
 	}
-	let s = V.Combination;
+	let s = H.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = V.Never : a === i.length ? s = V.Any : _r(i) || (s = V.Never);
+			o > 0 ? s = H.Never : a === i.length ? s = H.Any : gr(i) || (s = H.Never);
 			break;
 		case "anyOf":
-			a > 0 ? s = V.Any : o === i.length && (s = V.Never);
+			a > 0 ? s = H.Any : o === i.length && (s = H.Never);
 			break;
-		case "oneOf": a > 1 || o === i.length ? s = V.Never : a === 1 && o === i.length - 1 && (s = V.Any);
+		case "oneOf": a > 1 || o === i.length ? s = H.Never : a === 1 && o === i.length - 1 && (s = H.Any);
 	}
-	return W(s, { [t]: i }, r, e.path);
+	return G(s, { [t]: i }, r, e.path);
 }
-function _r(e) {
+function gr(e) {
 	let t = null;
 	for (let n of e) {
-		let e = U(n);
+		let e = W(n);
 		switch (e) {
-			case V.Any:
-			case V.Never: break;
+			case H.Any:
+			case H.Never: break;
 			default: if (t === null) t = e;
 			else if (t !== e) return !1;
 		}
@@ -7263,47 +7263,47 @@ function _r(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var G = Object.freeze({
+var K = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
-function vr(e, t) {
+function _r(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? G.Valid : G.Invalid : G.Unknown;
+	return n ? n(t) === !0 ? K.Valid : K.Invalid : K.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function yr(e, t, n, r) {
+function vr(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return qn(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return Kn(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (vr(r, a)) {
-			case G.Valid:
-				i.push(or(a));
+		for (let [n, a] of t.entries()) switch (_r(r, a)) {
+			case K.Valid:
+				i.push(ar(a));
 				break;
-			case G.Invalid: B(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case K.Invalid: V(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
-		i.length === 0 && B(e, "all of elements from list is rejected by currently schema object", "enum");
+		i.length === 0 && V(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && vr(r, n) === G.Invalid && (a = !0), i) {
+	if (n && _r(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 (xn(t, n)) {
+			for (let t of i) if (bn(t, n)) {
 				e = !0;
 				break;
 			}
 			e || (a = !0);
 		}
 	}
-	let o = a ? V.Never : V.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = or(bn(n))), W(o, s, e.delegate, e.path);
+	let o = a ? H.Never : H.EnumOrConst, s = {};
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = ar(yn(n))), G(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var br = /* @__PURE__ */ new Set([
+var yr = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -7314,56 +7314,56 @@ var br = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function xr(e, t) {
-	let n = Object.keys(t).filter((e) => !br.has(e) && L(e));
-	n.length > 0 && B(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Sr(e, "maxProperties", t), i = Sr(e, "minProperties", t), a = Cr(e, t), o = wr(e, t), s = Tr(e, t), c = Dr(e, t);
+function br(e, t) {
+	let n = Object.keys(t).filter((e) => !yr.has(e) && R(e));
+	n.length > 0 && V(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = xr(e, "maxProperties", t), i = xr(e, "minProperties", t), a = Sr(e, t), o = Cr(e, t), s = wr(e, t), c = Er(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = Er(e, o, s, t);
+	let l = Tr(e, o, s, t);
 	if (!l) return null;
-	let u = kr(e, Or(a, o, s, l), c, t);
-	return W(Ar(e, a, l, u, r, i) ? V.Never : V.Object, Yn({
+	let u = Or(e, Dr(a, o, s, l), c, t);
+	return G(kr(e, a, l, u, r, i) ? H.Never : H.Object, Jn({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: Fr(o),
-		dependencies: Ir(c, t),
+		patternProperties: Pr(o),
+		dependencies: Fr(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function Sr(e, t, n) {
+function xr(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
-			B(e, "find NaN", t);
+			V(e, "find NaN", t);
 			return;
 		}
 		if (r < 0) {
-			B(e, `find invalid number ${r}`, t);
+			V(e, `find invalid number ${r}`, t);
 			return;
 		}
 		return r;
 	}
 }
-function Cr(e, { additionalProperties: t }) {
-	return t === !1 ? W(V.Never, {
+function Sr(e, { additionalProperties: t }) {
+	return t === !1 ? G(H.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? K(R(e, "additionalProperties"), z(t)) : W(V.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? q(z(e, "additionalProperties"), B(t)) : G(H.Any, {}, e.delegate, e.path);
 }
-function wr(e, { patternProperties: t }) {
+function Cr(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = Pr(i);
+		let a = Nr(i);
 		if (a instanceof Error) {
-			B(e, `property name invalid. ${i}`, "patternProperties", i);
+			V(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = z(t[i]), s = K(R(e, "patternProperties", i), o);
+		let o = B(t[i]), s = q(z(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -7372,29 +7372,29 @@ function wr(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function Tr(e, { propertyNames: t }) {
-	if (!t) return W(V.Any, {}, e.delegate, e.path);
-	t = z(t);
-	let n = K(R(e, "propertyNames"), t);
+function wr(e, { propertyNames: t }) {
+	if (!t) return G(H.Any, {}, e.delegate, e.path);
+	t = B(t);
+	let n = q(z(e, "propertyNames"), t);
 	if (!n) return null;
-	let r = U(n);
-	return r !== V.String && r !== V.Any ? sr(n) : n;
+	let r = W(n);
+	return r !== H.String && r !== H.Any ? or(n) : n;
 }
-function Er(e, t, n, { properties: r }) {
+function Tr(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (vr(n, o) === G.Invalid) {
-			B(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
+		if (_r(n, o) === K.Invalid) {
+			V(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = Nr(t, o);
-		if (s && U(s) === V.Never) {
-			B(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
+		let s = Mr(t, o);
+		if (s && W(s) === H.Never) {
+			V(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = z(r[o]), l = K(R(e, "properties", o), c);
+		let c = B(r[o]), l = q(z(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -7403,62 +7403,62 @@ function Er(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function Dr(e, { dependencies: t }) {
+function Er(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = z(t[i]);
+		let a = B(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = Mr(a);
-			r && B(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
+			let { keys: t, duplicated: r } = jr(a);
+			r && V(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = K(R(e, "dependencies", i), a);
+			let t = q(z(e, "dependencies", i), a);
 			if (t) {
-				let e = U(t);
-				r[i] = e === V.Object || e === V.Any ? t : e === V.Extends ? nr : sr(t);
+				let e = W(t);
+				r[i] = e === H.Object || e === H.Any ? t : e === H.Extends ? tr : or(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function Or(e, t, n, r) {
+function Dr(e, t, n, r) {
 	return (i) => {
-		if (vr(n, i) === G.Invalid) return !0;
-		let a = Nr(t, i);
-		return !!(a && U(a) === V.Never || U(r[i] ?? e) === V.Never);
+		if (_r(n, i) === K.Invalid) return !0;
+		let a = Mr(t, i);
+		return !!(a && W(a) === H.Never || W(r[i] ?? e) === H.Never);
 	};
 }
-function kr(e, t, n, { required: r }) {
+function Or(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = Mr(r);
-	i.duplicated && B(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
+	let i = jr(r);
+	i.duplicated && V(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) jr(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
-	return o.length > 0 && B(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
-}
-function Ar(e, t, n, r, i, a) {
-	if (i !== void 0 && a !== void 0 && i < a) return B(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
-	if (i !== void 0 && r.length > i) return B(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
-	if (a !== void 0 && r.length < a) return B(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
-	if (U(t) !== V.Never) return !1;
+	for (let e of i.keys) Ar(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	return o.length > 0 && V(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
+}
+function kr(e, t, n, r, i, a) {
+	if (i !== void 0 && a !== void 0 && i < a) return V(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
+	if (i !== void 0 && r.length > i) return V(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
+	if (a !== void 0 && r.length < a) return V(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
+	if (W(t) !== H.Never) return !1;
 	for (let e in n) {
 		let t = n[e];
-		if (U(t) !== V.Never) return !1;
+		if (W(t) !== H.Never) return !1;
 	}
 	return !0;
 }
-function jr([e, t], n) {
+function Ar([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 && U(i) === V.Object && a(i.required), o && a(o);
+		i && W(i) === H.Object && a(i.required), o && a(o);
 	}
 	function a(e) {
 		if (e) for (let t of e) i.has(t) || (i.add(t), r.push(t));
 	}
 	return [...i];
 }
-function Mr(e) {
+function jr(e) {
 	let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
 	for (let r of e) t.has(r) ? n.add(r) : t.add(r);
 	return n.size === 0 ? {
@@ -7469,14 +7469,14 @@ function Mr(e) {
 		duplicated: [...n]
 	};
 }
-function Nr(e, t) {
+function Mr(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function Pr(e) {
+function Nr(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -7484,12 +7484,12 @@ function Pr(e) {
 		throw e;
 	}
 }
-function Fr(e) {
+function Pr(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function Ir([e, t], { dependencies: n }) {
+function Fr([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -7499,78 +7499,78 @@ function Ir([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var Lr = /* @__PURE__ */ new Set([
+var Ir = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Rr = /* @__PURE__ */ new Set([
+]), Lr = /* @__PURE__ */ new Set([
 	"type",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function zr(e, t) {
+function Rr(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return Br(e, t);
-		case "string": return Hr(e, t);
+		case "integer": return zr(e, t);
+		case "string": return Vr(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => L(e) && e !== "type");
-			return r.length > 0 && B(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), W(n === "null" ? V.Null : V.Boolean, { type: n }, e.delegate, e.path);
+			let r = Object.keys(t).filter((e) => R(e) && e !== "type");
+			return r.length > 0 && V(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), G(n === "null" ? H.Null : H.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return qn(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return Kn(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function Br(e, t) {
-	let n = Object.keys(t).filter((e) => !Lr.has(e) && L(e));
-	n.length > 0 && B(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = yn(t, Lr);
-	for (let t of Lr) {
+function zr(e, t) {
+	let n = Object.keys(t).filter((e) => !Ir.has(e) && R(e));
+	n.length > 0 && V(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = vn(t, Ir);
+	for (let t of Ir) {
 		let n = r[t];
-		t !== "type" && n !== void 0 && Number.isNaN(n) && (B(e, "found NaN", t), delete r[t]);
+		t !== "type" && n !== void 0 && Number.isNaN(n) && (V(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", B(e, "cannot be 0", "multipleOf"));
-	let l = V.Numeric;
-	return Vr(r) || (l = V.Never), W(l, r, e.delegate, e.path);
+	c === 0 && (delete r.multipleOf, r.type = "number", V(e, "cannot be 0", "multipleOf"));
+	let l = H.Numeric;
+	return Br(r) || (l = H.Never), G(l, r, e.delegate, e.path);
 }
-function Vr(e) {
+function Br(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 Hr(e, t) {
-	let n = Object.keys(t).filter((e) => !Rr.has(e) && L(e));
-	n.length > 0 && B(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = yn(t, Rr);
-	Ur(e, r, "maxLength"), Ur(e, r, "minLength");
-	let i = r.maxLength, a = r.minLength, o = V.String;
-	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = V.Never), W(o, r, e.delegate, e.path);
+function Vr(e, t) {
+	let n = Object.keys(t).filter((e) => !Lr.has(e) && R(e));
+	n.length > 0 && V(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
+	let r = vn(t, Lr);
+	Hr(e, r, "maxLength"), Hr(e, r, "minLength");
+	let i = r.maxLength, a = r.minLength, o = H.String;
+	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = H.Never), G(o, r, e.delegate, e.path);
 }
-function Ur(e, t, n) {
+function Hr(e, t, n) {
 	let r = t[n];
-	r !== void 0 && Number.isNaN(r) && (B(e, "found NaN", n), delete t[n]);
+	r !== void 0 && Number.isNaN(r) && (V(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Wr = Object.freeze([]);
-function Gr(e, t, n, r) {
-	if (H(e) || t.isExtendsSchema(e)) return {
+var Ur = Object.freeze([]);
+function Wr(e, t, n, r) {
+	if (U(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Wr
+		warns: Ur
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Hn.External,
+				kind: Vn.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -7583,19 +7583,19 @@ function Gr(e, t, n, r) {
 		path: [],
 		errors: [],
 		warns: []
-	}, a = K(i, e);
-	if (a) Kr(i.errors.length === 0, "found errors (it should be empty)");
-	else return Kr(i.errors.length > 0, "cannot found any errors"), i.errors;
+	}, a = q(i, e);
+	if (a) Gr(i.errors.length === 0, "found errors (it should be empty)");
+	else return Gr(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function Kr(e, t) {
+function Gr(e, t) {
 	if (!e) throw Error(t);
 }
-function K(e, t) {
-	if (e.extends.isExtendsSchema(t) || H(t)) return t;
+function q(e, t) {
+	if (e.extends.isExtendsSchema(t) || U(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;
@@ -7603,58 +7603,58 @@ function K(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = qr(e, r);
-	return s && i && (s = yr(e, a, o, s)), s || null;
+	let s = Kr(e, r);
+	return s && i && (s = vr(e, a, o, s)), s || null;
 }
-function qr(e, t) {
-	for (let n of hr) {
+function Kr(e, t) {
+	for (let n of mr) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => L(e) && e !== n);
-			return i.length > 0 && B(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), gr(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => R(e) && e !== n);
+			return i.length > 0 && V(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), hr(e, n, r) || null;
 		}
 	}
 	{
-		let n = z(t.not);
+		let n = B(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => L(e) && e !== "not");
-			r.length > 0 && B(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = K(R(e, "not"), n);
+			let r = Object.keys(t).filter((e) => R(e) && e !== "not");
+			r.length > 0 && V(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
+			let i = q(z(e, "not"), n);
 			if (!i) return null;
-			let a = V.Not;
-			switch (U(i)) {
-				case V.Never:
-					a = V.Any;
+			let a = H.Not;
+			switch (W(i)) {
+				case H.Never:
+					a = H.Any;
 					break;
-				case V.Any: a = V.Never;
+				case H.Any: a = H.Never;
 			}
-			return W(a, { not: i }, e.delegate, e.path);
+			return G(a, { not: i }, e.delegate, e.path);
 		}
 	}
 	if (t.type) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return gr(e, "anyOf", n.map((e) => ({
+			return hr(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return xr(e, t);
-			case "array": return lr(e, t);
-			default: return zr(e, t);
+			case "object": return br(e, t);
+			case "array": return cr(e, t);
+			default: return Rr(e, t);
 		}
 	}
-	return Kn(t) ? W(V.Any, {}, e.delegate, e.path) : (qn(e, "unrecognized"), null);
+	return Gn(t) ? G(H.Any, {}, e.delegate, e.path) : (Kn(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var Jr = class {
+var qr = class {
 	constructor(e) {
 		let t = Object.freeze(e.toSorted());
 		if (t.length > 32) throw Error(`cannot define ${t.length} keys which is greater than 32`);
-		this.keys = t, this.clazz = class extends Yr {
+		this.keys = t, this.clazz = class extends Jr {
 			constructor(e) {
 				super(t, e);
 			}
@@ -7678,7 +7678,7 @@ var Jr = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Yr = class {
+}, Jr = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -7693,21 +7693,21 @@ var Jr = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function Xr(e) {
-	return new Zr(e);
+function Yr(e) {
+	return new Xr(e);
 }
-var Zr = class {
+var Xr = class {
 	constructor(e) {
-		this.description = new Jr(e);
+		this.description = new qr(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Qr(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new Zr(this.description, t);
 	}
-}, Qr = class {
+}, Zr = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -7728,7 +7728,7 @@ var Zr = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of Sn) if (e & a) {
+		for (let r of this.values) for (let [i, a] of xn) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -7745,11 +7745,11 @@ var Zr = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function $r(e, t) {
+function Qr(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? ei(e, t) : n.num > r.num ? ti(e, t) : ni(e, t);
+	return n.num < r.num ? $r(e, t) : n.num > r.num ? ei(e, t) : ti(e, t);
 }
-function ei(e, t) {
+function $r(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -7774,11 +7774,11 @@ function ei(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [q(r), a]
+				range: [J(r), a]
 			}), {
 				left: {
 					fromLeft: !0,
-					range: [n, q(i)]
+					range: [n, J(i)]
 				},
 				center: [i, r],
 				right: t
@@ -7788,16 +7788,16 @@ function ei(e, t) {
 	return {
 		left: {
 			fromLeft: !0,
-			range: [n, q(i)]
+			range: [n, J(i)]
 		},
 		center: [i, a],
 		right: {
 			fromLeft: !0,
-			range: [q(a), r]
+			range: [J(a), r]
 		}
 	};
 }
-function ti(e, t) {
+function ei(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -7822,11 +7822,11 @@ function ti(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !0,
-				range: [q(a), r]
+				range: [J(a), r]
 			}), {
 				left: {
 					fromLeft: !1,
-					range: [i, q(n)]
+					range: [i, J(n)]
 				},
 				center: [n, a],
 				right: t
@@ -7836,23 +7836,23 @@ function ti(e, t) {
 	return {
 		left: {
 			fromLeft: !1,
-			range: [i, q(n)]
+			range: [i, J(n)]
 		},
 		center: [n, r],
 		right: {
 			fromLeft: !1,
-			range: [q(r), a]
+			range: [J(r), a]
 		}
 	};
 }
-function ni(e, t) {
+function ti(e, t) {
 	let [n, r] = e, [i, a] = t, o = n.exclusive, s = i.exclusive, c, l = n;
 	if (!o && s ? (l = i, c = {
 		fromLeft: !0,
-		range: [n, q(i)]
+		range: [n, J(i)]
 	}) : o && !s && (c = {
 		fromLeft: !1,
-		range: [i, q(n)]
+		range: [i, J(n)]
 	}), r.num <= a.num) {
 		let e = !0, t = !1;
 		if (r.num === a.num) {
@@ -7863,7 +7863,7 @@ function ni(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [q(r), a]
+				range: [J(r), a]
 			}), {
 				left: c,
 				center: [l, r],
@@ -7876,11 +7876,11 @@ function ni(e, t) {
 		center: [l, a],
 		right: {
 			fromLeft: !0,
-			range: [q(a), r]
+			range: [J(a), r]
 		}
 	};
 }
-function q(e) {
+function J(e) {
 	return {
 		num: e.num,
 		exclusive: !e.exclusive
@@ -7888,8 +7888,8 @@ function q(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var ri = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = $r([{
+var ni = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = Qr([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -7919,126 +7919,126 @@ var ri = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function ii({ left: e, right: t, intersection: n }) {
-	if (!n) return O.Rejection;
+function ri({ left: e, right: t, intersection: n }) {
+	if (!n) return k.Rejection;
 	let r = !1, i = !1;
-	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? O.Intersection : r ? O.Containing : i ? O.ContainedBy : O.Equals;
+	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? k.Intersection : r ? k.Containing : i ? k.ContainedBy : k.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var ai = ri(0), oi = Xr([
+var ii = ni(0), ai = Yr([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function si({ calculate: e }, t, n) {
-	let r = ai(t.minItems, t.maxItems, n.minItems, n.maxItems), i = ii(r);
-	if (i === O.Rejection) return M;
-	let [a, o] = ci(t), [s, c] = ci(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = oi.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+function oi({ calculate: e }, t, n) {
+	let r = ii(t.minItems, t.maxItems, n.minItems, n.maxItems), i = ri(r);
+	if (i === k.Rejection) return N;
+	let [a, o] = si(t), [s, c] = si(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = ai.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 O.Equals:
+				case k.Equals:
 					n.hasRejection || (n.hasCommon = !0);
 					break;
-				case O.Containing:
+				case k.Containing:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0;
 					break;
-				case O.ContainedBy:
+				case k.ContainedBy:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra2 = !0;
 					break;
-				case O.Intersection:
+				case k.Intersection:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0, n.hasExtra2 = !0;
 					break;
-				case O.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
+				case k.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
 			}
 		});
 	}
 	d.update((e) => {
 		switch (i) {
-			case O.Containing:
+			case k.Containing:
 				e.hasExtra1 = !0;
 				break;
-			case O.ContainedBy:
+			case k.ContainedBy:
 				e.hasExtra2 = !0;
 				break;
-			case O.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
+			case k.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
 		}
 		(t.maxItems === 0 || n.maxItems === 0) && (e.hasCommon = !0, t.maxItems !== 0 && (e.hasExtra1 = !0), n.maxItems !== 0 && (e.hasExtra2 = !0));
 	});
 	let p = 0;
 	for (let { hasExtra1: e, hasExtra2: t, hasCommon: n, hasCommonBroken: r } of d) {
 		let i = n;
-		r && (i = !1), p |= i ? e && t ? N : e ? A : t ? j : k : M;
+		r && (i = !1), p |= i ? e && t ? P : e ? j : t ? M : A : N;
 	}
 	return p;
 }
-function ci({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? tr] : [[], e ?? tr];
+function si({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? er] : [[], e ?? er];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function li(e) {
+function ci(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = rr(n);
-		return i === rr(r) ? i ? di(t, n, r, e) : n === r : !1;
+		let i = nr(n);
+		return i === nr(r) ? i ? ui(t, n, r, e) : n === r : !1;
 	};
 }
-function ui(e) {
+function li(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => di(t, n, r, e);
+	return (n, r) => ui(t, n, r, e);
 }
-function di(e, t, n, r) {
-	let i = `${ir(t)}/${ir(n)}`, a = e.get(i);
+function ui(e, t, n, r) {
+	let i = `${rr(t)}/${rr(n)}`, a = e.get(i);
 	return a || e.set(i, a = r(t, n)), a;
 }
 //#endregion
 //#region src/json-schema-subset/checker/enumAndConst.ts
-function fi(e, t, n) {
-	let r = mi(t), i = mi(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (hi(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (hi(e, r, t) ? s = !0 : o = !0, o && s) break;
-	return s ? a && o ? N : a ? A : o ? j : k : M;
+function di(e, t, n) {
+	let r = pi(t), i = pi(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (mi(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (mi(e, r, t) ? s = !0 : o = !0, o && s) break;
+	return s ? a && o ? P : a ? j : o ? M : A : N;
 }
-function pi(e, t) {
+function fi(e, t) {
 	let n = !1, r = !1;
-	for (let i of mi(e)) {
-		switch (vr(t, i)) {
-			case G.Valid:
+	for (let i of pi(e)) {
+		switch (_r(t, i)) {
+			case K.Valid:
 				n = !0;
 				break;
-			case G.Invalid:
+			case K.Invalid:
 				r = !0;
 				break;
-			case G.Unknown: return P;
+			case K.Unknown: return F;
 		}
 		if (n && r) break;
 	}
-	return n && r ? N : n ? k | j : r ? M : U(t) === V.Never ? k : j;
+	return n && r ? P : n ? A | M : r ? N : W(t) === H.Never ? A : M;
 }
-function mi({ const: e, enum: t }) {
+function pi({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function hi({ isEquals: e }, t, n) {
+function mi({ isEquals: e }, t, n) {
 	for (let r of t) if (e(r, n)) return !0;
 	return !1;
 }
 //#endregion
 //#region src/json-schema-subset/checker/equals.ts
-function gi(e) {
+function hi(e) {
 	function t(t, n) {
 		let i = e.isExtendsSchema(t), a = e.isExtendsSchema(n);
 		return i || a ? e.equals(t, n) : r(t, n);
 	}
 	let n = /* @__PURE__ */ new Map();
 	function r(e, t) {
-		let r = ir(e), a = ir(t);
+		let r = rr(e), a = rr(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;
@@ -8055,25 +8055,25 @@ function gi(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : H(e) && H(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : U(e) && U(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function _i(e) {
-	let t = Ci(e), n = e.multipleOf ?? 1, r = J(t, n);
+function gi(e) {
+	let t = Si(e), n = e.multipleOf ?? 1, r = Y(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function vi([e, t]) {
+function _i([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
-function J(e, t) {
+function Y(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = yi(n.num, t), a = bi(r.num, t);
+	let [n, r] = e, i = vi(n.num, t), a = yi(r.num, t);
 	if (i === n.num && n.exclusive && (i += t), a === r.num && r.exclusive && (a -= t), !(i > a) && (i !== a || i !== Infinity && i !== -Infinity)) return [{
 		num: i,
 		exclusive: !1
@@ -8082,29 +8082,29 @@ function J(e, t) {
 		exclusive: !1
 	}];
 }
-function yi(e, t) {
+function vi(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function bi(e, t) {
+function yi(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function xi(e, t) {
-	let { left: n, right: r, center: i } = $r(Ci(e), Ci(t));
-	if (!i) return M;
+function bi(e, t) {
+	let { left: n, right: r, center: i } = Qr(Si(e), Si(t));
+	if (!i) return N;
 	let a = !1, o = !1;
-	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? N : a ? A : o ? j : k;
+	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? P : a ? j : o ? M : A;
 }
-function Si(e, t) {
-	let n = Ci(e), r = _i(t);
-	if (!r) return A;
-	let i = $r(n, r.range), a = J(i.center, r.multipleOf), o = wi(i.left, r.multipleOf), s = wi(i.right, r.multipleOf);
-	if (!i.center) return M;
+function xi(e, t) {
+	let n = Si(e), r = gi(t);
+	if (!r) return j;
+	let i = Qr(n, r.range), a = Y(i.center, r.multipleOf), o = Ci(i.left, r.multipleOf), s = Ci(i.right, r.multipleOf);
+	if (!i.center) return N;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !vi(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? N : c ? A : l ? j : k;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !_i(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? P : c ? j : l ? M : A;
 }
-function Ci(e) {
+function Si(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -8126,81 +8126,81 @@ function Ci(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function wi(e, t) {
-	if (e && !e.fromLeft) return J(e.range, t);
+function Ci(e, t) {
+	if (e && !e.fromLeft) return Y(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function Ti(e, t) {
-	let n = _i(e), r = _i(t);
-	if (!n && !r) return k;
-	if (!n) return j;
-	if (!r) return A;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = $r(i, o), l, u = 0;
-	if (c.center && (u = Di(a, s), l = J(c.center, u)), !l) return M;
+function wi(e, t) {
+	let n = gi(e), r = gi(t);
+	if (!n && !r) return A;
+	if (!n) return M;
+	if (!r) return j;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Qr(i, o), l, u = 0;
+	if (c.center && (u = Ei(a, s), l = Y(c.center, u)), !l) return N;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && J(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && J(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Ei(n, l, u), f ||= Ei(r, l, u), d && f ? N : d ? A : f ? j : k;
+	return p && Y(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && Y(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Ti(n, l, u), f ||= Ti(r, l, u), d && f ? P : d ? j : f ? M : A;
 }
-function Ei({ range: e, multipleOf: t }, n, r) {
-	let i = $r(e, n);
-	if (J(i.left?.range, t) || J(i.right?.range, t)) return !0;
-	let a = J(i.center, t);
+function Ti({ range: e, multipleOf: t }, n, r) {
+	let i = Qr(e, n);
+	if (Y(i.left?.range, t) || Y(i.right?.range, t)) return !0;
+	let a = Y(i.center, t);
 	if (!a) return !1;
-	let o = ki(n);
-	return ki(a) > o || o !== 1 && t < r;
+	let o = Oi(n);
+	return Oi(a) > o || o !== 1 && t < r;
 }
-function Di(e, t) {
-	return e * t / Oi(e, t);
+function Ei(e, t) {
+	return e * t / Di(e, t);
 }
-function Oi(e, t) {
-	return e === 0 ? t : Oi(t % e, e);
+function Di(e, t) {
+	return e === 0 ? t : Di(t % e, e);
 }
-function ki(e) {
+function Oi(e) {
 	if (!e) return 0;
 	let [t, n] = e;
 	return n.num - t.num + 1;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/checker.ts
-function Ai(e, t) {
-	if (ji(e) || ji(t)) return P;
-	let n = Mi(e), r = Mi(t);
-	return n && r ? xi(e, t) : n ? Si(e, t) : r ? Mn(Si(t, e)) : Ti(e, t);
+function ki(e, t) {
+	if (Ai(e) || Ai(t)) return F;
+	let n = ji(e), r = ji(t);
+	return n && r ? bi(e, t) : n ? xi(e, t) : r ? jn(xi(t, e)) : wi(e, t);
 }
-function ji(e) {
+function Ai(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function Mi(e) {
+function ji(e) {
 	let { multipleOf: t } = e;
 	return !(t !== void 0 && Number.isInteger(t) || e.type === "integer");
 }
 //#endregion
 //#region src/json-schema-subset/checker/object.ts
-var Ni = ri(0), Pi = Xr([
+var Mi = ni(0), Ni = Yr([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function Fi(e, t, n) {
-	if (Ii(t, n)) return M;
-	let r = Li(t, n);
-	if (!r) return M;
-	let i = Ui(t), a = Ui(n), o = (t) => {
+function Pi(e, t, n) {
+	if (Fi(t, n)) return N;
+	let r = Ii(t, n);
+	if (!r) return N;
+	let i = Hi(t), a = Hi(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return Wi(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Pi.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), zi);
-	for (let e of [...c].toSorted()) u.push(o(e), Bi);
-	for (let e of [...l].toSorted()) u.push(o(e), Vi);
+		return Ui(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Ni.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), Ri);
+	for (let e of [...c].toSorted()) u.push(o(e), zi);
+	for (let e of [...l].toSorted()) u.push(o(e), Bi);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = Hi(d, f);
-		for (let e of [...Ri(t, n)].toSorted()) o(e) !== 0 && u.push(o(e), r);
-		let i = t.additionalProperties ?? tr, a = n.additionalProperties ?? tr;
-		if (Wi(i, a)) {
+		let r = Vi(d, f);
+		for (let e of [...Li(t, n)].toSorted()) o(e) !== 0 && u.push(o(e), r);
+		let i = t.additionalProperties ?? er, a = n.additionalProperties ?? er;
+		if (Ui(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -8209,13 +8209,13 @@ function Fi(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 ? M : e && t ? N : e ? A : t ? j : k;
+	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? N : e && t ? P : e ? j : t ? M : A;
 	return m;
 }
-function Ii(e, t) {
-	return ii(Ni(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === O.Rejection;
+function Fi(e, t) {
+	return ri(Mi(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === k.Rejection;
 }
-function Li(e, t) {
+function Ii(e, t) {
 	let n = new Set(e.required), r = new Set(t.required), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = n.size, s = r.size;
 	for (let e of n) r.has(e) && i.add(e), a.add(e);
 	for (let e of r) n.has(e) && i.add(e), a.add(e);
@@ -8231,7 +8231,7 @@ function Li(e, t) {
 		hasOptional2: u > s
 	};
 }
-function Ri(e, t) {
+function Li(e, t) {
 	let n = new Set(e.required), r = e.properties, i = t.properties, a = e.required, o = t.required;
 	if (r) for (let e in r) n.add(e);
 	if (i) for (let e in i) n.add(e);
@@ -8239,67 +8239,67 @@ function Ri(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var zi = (e, t) => {
+var Ri = (e, t) => {
 	switch (e) {
-		case O.Equals:
+		case k.Equals:
 			t.hasCommonInRequired = !0;
 			break;
-		case O.Containing:
+		case k.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case O.ContainedBy:
+		case k.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case O.Intersection:
+		case k.Intersection:
 			t.hasExtra1 = !0, t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case O.Rejection: t.hasRejection = !0;
+		case k.Rejection: t.hasRejection = !0;
 	}
-}, Bi = (e, t) => {
+}, zi = (e, t) => {
 	switch (e) {
-		case O.Equals:
-		case O.ContainedBy:
+		case k.Equals:
+		case k.ContainedBy:
 			t.hasCommonInRequired = !0;
 			break;
-		case O.Intersection:
-		case O.Containing:
+		case k.Intersection:
+		case k.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case O.Rejection: t.hasRejection = !0;
+		case k.Rejection: t.hasRejection = !0;
 	}
-}, Vi = (e, t) => {
+}, Bi = (e, t) => {
 	switch (e) {
-		case O.Equals:
-		case O.Containing:
+		case k.Equals:
+		case k.Containing:
 			t.hasCommonInRequired = !0;
 			break;
-		case O.Intersection:
-		case O.ContainedBy:
+		case k.Intersection:
+		case k.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case O.Rejection: t.hasRejection = !0;
+		case k.Rejection: t.hasRejection = !0;
 	}
-}, Hi = (e, t) => (n, r) => {
+}, Vi = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
-		case O.Equals:
+		case k.Equals:
 			o = !0;
 			break;
-		case O.Containing:
+		case k.Containing:
 			i = !0, o = !0;
 			break;
-		case O.ContainedBy:
+		case k.ContainedBy:
 			a = !0, o = !0;
 			break;
-		case O.Intersection:
+		case k.Intersection:
 			i = !0, a = !0, o = !0;
 			break;
-		case O.Rejection: i = !0, a = !0;
+		case k.Rejection: i = !0, a = !0;
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function Ui(e) {
+function Hi(e) {
 	let t = e.properties, n = e.propertyNames, r = e.additionalProperties, i = [];
 	if (e.patternProperties) for (let t in e.patternProperties) {
 		let n = e.patternProperties[t], r = new RegExp(t, "i");
@@ -8309,39 +8309,39 @@ function Ui(e) {
 		});
 	}
 	return (e) => {
-		if (n && vr(n, e) === G.Invalid) return nr;
+		if (n && _r(n, e) === K.Invalid) return tr;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || tr;
+		return ((t && t[e]) ?? r) || er;
 	};
 }
-function Wi(e, t) {
-	let n = U(e), r = U(t);
-	return n !== V.Never || r !== V.Never;
+function Ui(e, t) {
+	let n = W(e), r = W(t);
+	return n !== H.Never || r !== H.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var Gi = ri(0);
-function Ki(e, t) {
-	let n = ii(Gi(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+var Wi = ni(0);
+function Gi(e, t) {
+	let n = ri(Wi(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
-		case O.Rejection: return M;
-		case O.Containing: return r ? P : A;
-		case O.ContainedBy: return i ? P : j;
-		case O.Equals: return r && i ? e.pattern === t.pattern ? k : P : r ? k | j : i ? k | A : k;
-		case O.Intersection: return r && i ? P : r ? N | M | j : i ? N | M | A : N;
+		case k.Rejection: return N;
+		case k.Containing: return r ? F : j;
+		case k.ContainedBy: return i ? F : M;
+		case k.Equals: return r && i ? e.pattern === t.pattern ? A : F : r ? A | M : i ? A | j : A;
+		case k.Intersection: return r && i ? F : r ? P | N | M : i ? P | N | j : P;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function qi(e, t, n) {
-	let r = {}, i = [], a = ui(Yi(e, r)), o = Ji(), s = gi(e);
-	r.isEquals = li(xn), r.calculate = Bn({
+function Ki(e, t, n) {
+	let r = {}, i = [], a = li(Ji(e, r)), o = qi(), s = hi(e);
+	r.isEquals = ci(bn), r.calculate = zn({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!Zi(r ? Mn(n) : n)) return;
-			let a = r ? Qi(t, e) : Qi(e, t);
+			if (!Xi(r ? jn(n) : n)) return;
+			let a = r ? Zi(t, e) : Zi(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -8351,104 +8351,104 @@ function qi(e, t, n) {
 		expression: c
 	};
 }
-var Ji = () => (e) => {
+var qi = () => (e) => {
 	let t;
-	switch (U(e)) {
-		case V.Not:
+	switch (W(e)) {
+		case H.Not:
 			t = {
-				kind: I.Not,
+				kind: L.Not,
 				expression: e.not
 			};
 			break;
-		case V.Combination:
+		case H.Combination:
 			if ("allOf" in e) t = {
-				kind: I.AllOf,
-				expressions: Xi(e.allOf, V.Any)
+				kind: L.AllOf,
+				expressions: Yi(e.allOf, H.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: I.AnyOf,
-				expressions: Xi(e.anyOf, V.Never)
+				kind: L.AnyOf,
+				expressions: Yi(e.anyOf, H.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: I.OneOf,
-				expressions: Xi(e.oneOf, V.Never)
+				kind: L.OneOf,
+				expressions: Yi(e.oneOf, H.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: I.Leaf };
+		default: t = { kind: L.Leaf };
 	}
 	return t;
-}, Yi = (e, t) => (n, r) => {
-	let i = U(n), a = U(r);
-	if (i === V.Extends || a === V.Extends) return e.calculate(n, r);
+}, Ji = (e, t) => (n, r) => {
+	let i = W(n), a = W(r);
+	if (i === H.Extends || a === H.Extends) return e.calculate(n, r);
 	switch (i) {
-		case V.Any: return a === V.Any ? k : A;
-		case V.Never: return a === V.Never ? k : j;
+		case H.Any: return a === H.Any ? A : j;
+		case H.Never: return a === H.Never ? A : M;
 	}
 	switch (a) {
-		case V.Any: return j;
-		case V.Never: return A;
+		case H.Any: return M;
+		case H.Never: return j;
 	}
-	if (i === V.EnumOrConst && a === V.EnumOrConst) return fi(t, n, r);
-	if (i === V.EnumOrConst) return pi(n, r);
-	if (a === V.EnumOrConst) return Mn(pi(r, n));
-	if (i !== a) return M;
+	if (i === H.EnumOrConst && a === H.EnumOrConst) return di(t, n, r);
+	if (i === H.EnumOrConst) return fi(n, r);
+	if (a === H.EnumOrConst) return jn(fi(r, n));
+	if (i !== a) return N;
 	switch (i) {
-		case V.Null: return k;
-		case V.Numeric: return Ai(n, r);
-		case V.String: return Ki(n, r);
-		case V.Boolean: return k;
-		case V.Object: return Fi(t, n, r);
-		case V.Array: return si(t, n, r);
+		case H.Null: return A;
+		case H.Numeric: return ki(n, r);
+		case H.String: return Gi(n, r);
+		case H.Boolean: return A;
+		case H.Object: return Pi(t, n, r);
+		case H.Array: return oi(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function Xi(e, t) {
-	return e.filter((e) => U(e) !== t);
+function Yi(e, t) {
+	return e.filter((e) => W(e) !== t);
 }
-function Zi(e) {
-	return !Cn(e) && !Tn(e) && (wn(e) || Dn(e) || En(e));
+function Xi(e) {
+	return !Sn(e) && !wn(e) && (Cn(e) || En(e) || Tn(e));
 }
-function Qi(e, t) {
-	let n = ar(t);
+function Zi(e, t) {
+	let n = ir(t);
 	if (!n) return;
-	let r = U(e), i = U(t);
+	let r = W(e), i = W(t);
 	if (r !== i) return [...n, "type"];
 	let a = e, o = t;
 	switch (i) {
-		case V.String:
+		case H.String:
 			if ((a.minLength ?? 0) < (o.minLength ?? 0)) return [...n, "minLength"];
 			if ((a.maxLength ?? Infinity) > (o.maxLength ?? Infinity)) return [...n, "maxLength"];
 			if (a.pattern !== o.pattern && o.pattern) return [...n, "pattern"];
 			break;
-		case V.Numeric:
+		case H.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 V.Array:
+		case H.Array:
 			if ((a.minItems ?? 0) < (o.minItems ?? 0)) return [...n, "minItems"];
 			if ((a.maxItems ?? Infinity) > (o.maxItems ?? Infinity)) return [...n, "maxItems"];
 			break;
-		case V.Object: {
+		case H.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 V.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
+		case H.EnumOrConst: return [...n, o.const == null ? "enum" : "const"];
 	}
 	return n;
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var $i = class e {
+var Qi = class e {
 	constructor(e = []) {
 		this.extendsSchemaClasses = Object.freeze([...e]);
 	}
 	tryCompiledExtendsSchema(e, t) {
-		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(_n(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(gn(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -8458,7 +8458,7 @@ var $i = 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 |= On(t);
+		for (let t of a) r && (t = e.swap(t)), i |= Dn(t);
 		return i;
 	}
 	equals(e, t) {
@@ -8470,43 +8470,43 @@ var $i = class e {
 	}
 	static swap(e) {
 		switch (e) {
-			case O.Containing: return O.ContainedBy;
-			case O.ContainedBy: return O.Containing;
+			case k.Containing: return k.ContainedBy;
+			case k.ContainedBy: return k.Containing;
 			default: return e;
 		}
 	}
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function ea(e, t, n = !1) {
+function $i(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw na(e, r, "$"), new Vn(e);
+		throw ta(e, r, "$"), new Bn(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(Un(e));
+		for (let e of a) console.warn(Hn(e));
 	}
 	return i;
 }
-function ta(e, t, n, r = !1) {
+function ea(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) && na(e, i, "$1"), Array.isArray(a) && na(e, a, "$2"), new Vn(e);
+		throw Array.isArray(i) && ta(e, i, "$1"), Array.isArray(a) && ta(e, a, "$2"), new Bn(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(Un(e));
+		for (let e of s) console.warn(Hn(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Un(e));
+		for (let e of l) console.warn(Hn(e));
 	}
 	return [o, c];
 }
-function na(e, t, n) {
+function ta(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -8517,61 +8517,61 @@ function na(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var ra = Object.freeze({
+var na = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function ia({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new $i(e);
+function ra({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new Qi(e);
 	return Object.freeze({
-		compile: (e, r, i) => ea(e, (e) => Gr(e, n, r, t), i),
+		compile: (e, r, i) => $i(e, (e) => Wr(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = ta(e, r, (e) => Gr(e, n, void 0, t), i), { errorPath: s, expression: c } = qi(n, a, o), l = Cn(c) || Tn(c), u = wn(c) || Dn(c) || En(c);
-			return l && !u ? { result: ra.True } : !l && u ? {
+			let [a, o] = ea(e, r, (e) => Wr(e, n, void 0, t), i), { errorPath: s, expression: c } = Ki(n, a, o), l = Sn(c) || wn(c), u = Cn(c) || En(c) || Tn(c);
+			return l && !u ? { result: na.True } : !l && u ? {
 				errorPath: s,
-				result: ra.False
-			} : { result: ra.Unknown };
+				result: na.False
+			} : { result: na.Unknown };
 		}
 	});
 }
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
-function aa(e) {
+function ia(e) {
 	return _(e)?.type === "string";
 }
-function oa(e) {
-	return e instanceof fa || _(e)?.type === "array";
+function aa(e) {
+	return e instanceof da || _(e)?.type === "array";
 }
-function sa(e) {
+function oa(e) {
 	let t = _(e);
 	return t?.type === "array" && _(t.items)?.type === "string";
 }
-function ca(e) {
+function sa(e) {
 	let t = _(e);
 	return t != null && Object.keys(t).length === 0;
 }
-function la(e) {
+function ca(e) {
 	let t = _(e), n = _(t?.error);
 	if (t == null || n == null || t.packageId != null && !ie(t.packageId) || n.message != null && !ie(n.message)) throw TypeError("Invalid schema comparison context.");
 }
-function ua(e) {
-	return e == null ? { error: {} } : (la(e), e);
+function la(e) {
+	return e == null ? { error: {} } : (ca(e), e);
 }
-var Y = class e {
+var X = class e {
 	static setError(t, n, r) {
 		t instanceof e ? t.context.error.message = r : n instanceof e && (n.context.error.message = r);
 	}
 	constructor(e, t, n) {
-		this.id = e, this.value = t, this.context = ua(n);
+		this.id = e, this.value = t, this.context = la(n);
 	}
 	compare(e) {
 		return this.passThrough(e) || this.compareImpl(e);
 	}
 	passThrough(e) {
-		if (e instanceof ma) return [O.Equals];
+		if (e instanceof pa) return [k.Equals];
 	}
-}, da = class e extends Y {
+}, ua = class e extends X {
 	static isMatch(e) {
 		let t = _(e)?.enum;
 		return Array.isArray(t) && t.every((e) => ie(e));
@@ -8581,13 +8581,13 @@ var Y = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (aa(t)) return [O.ContainedBy];
+		if (ia(t)) return [k.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.enum), n = O.Equals;
-			for (let r of t.value.enum) e.has(r) || (n = O.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [O.Rejection] : [O.Intersection];
+			let e = new Set(this.value.enum), n = k.Equals;
+			for (let r of t.value.enum) e.has(r) || (n = k.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [k.Rejection] : [k.Intersection];
 		}
-		return [O.Rejection];
+		return [k.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -8600,7 +8600,7 @@ var Y = class e {
 		}
 		return !1;
 	}
-}, fa = class e extends Y {
+}, da = class e extends X {
 	static isMatch(e) {
 		let t = _(e), n = _(t?.items)?.enum;
 		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => ie(e));
@@ -8610,13 +8610,13 @@ var Y = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (t instanceof pa || sa(t)) return [O.ContainedBy];
+		if (t instanceof fa || oa(t)) return [k.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.items.enum), n = O.Equals;
-			for (let r of t.value.items.enum) e.has(r) || (n = O.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.items.enum.length ? [O.Rejection] : [O.Intersection];
+			let e = new Set(this.value.items.enum), n = k.Equals;
+			for (let r of t.value.items.enum) e.has(r) || (n = k.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.items.enum.length ? [k.Rejection] : [k.Intersection];
 		}
-		return [O.Rejection];
+		return [k.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -8629,36 +8629,36 @@ var Y = class e {
 		}
 		return !1;
 	}
-}, pa = class e extends Y {
+}, fa = class e extends X {
 	static isMatch(e) {
 		let t = _(e);
-		return t?.type === "array" && !t.uniqueItems && (!ae(t.items) || ca(t.items));
+		return t?.type === "array" && !t.uniqueItems && (!ae(t.items) || sa(t.items));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid array schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e || oa(t) ? [O.Equals] : [O.Rejection];
+		return t instanceof e || aa(t) ? [k.Equals] : [k.Rejection];
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, ma = class e extends Y {
+}, pa = class e extends X {
 	static isMatch(e) {
-		return ca(e);
+		return sa(e);
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid empty schema.");
 		super(t, n, r);
 	}
 	compareImpl(e) {
-		return [O.Equals];
+		return [k.Equals];
 	}
 	equals(e) {
 		return !0;
 	}
-}, ha = class e extends Y {
+}, ma = class e extends X {
 	static isMatch(e) {
 		return _(e)?.contentMediaType === "oomol/bin";
 	}
@@ -8667,12 +8667,12 @@ var Y = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [O.Equals] : (Y.setError(this, t, "edgeError.binDiffType"), [O.Rejection]);
+		return t instanceof e ? [k.Equals] : (X.setError(this, t, "edgeError.binDiffType"), [k.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, ga = class e extends Y {
+}, ha = class e extends X {
 	static isMatch(e) {
 		return _(e)?.contentMediaType === "oomol/artifact";
 	}
@@ -8681,38 +8681,38 @@ var Y = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [O.Equals] : (Y.setError(this, t, "edgeError.artifactDiffType"), [O.Rejection]);
+		return t instanceof e ? [k.Equals] : (X.setError(this, t, "edgeError.artifactDiffType"), [k.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
-function _a() {
-	return ia({ extendsSchemaClasses: [
+function ga() {
+	return ra({ extendsSchemaClasses: [
+		fa,
 		pa,
-		ma,
+		ua,
 		da,
-		fa,
-		ha,
-		ga
+		ma,
+		ha
 	] });
 }
 //#endregion
 //#region src/manifest/common/schemaCompare.ts
-var va = _a();
-function ya(e, t) {
+var _a = ga();
+function va(e, t) {
 	return t ? { anyOf: [e, { type: "null" }] } : e;
 }
-function ba(e, t) {
+function ya(e, t) {
 	try {
-		let n = {}, r = va.compile(ya(xa(e.schema), e.nullable), {
+		let n = {}, r = _a.compile(va(ba(e.schema), e.nullable), {
 			...e,
 			error: n
-		}), i = va.compile(ya(xa(t.schema), t.nullable), {
+		}), i = _a.compile(va(ba(t.schema), t.nullable), {
 			...t,
 			error: n
-		}), { result: a, errorPath: o } = va.isSubset(r, i);
-		return a == ra.True ? { kind: "compatible" } : {
+		}), { result: a, errorPath: o } = _a.isSubset(r, i);
+		return a == na.True ? { kind: "compatible" } : {
 			kind: "incompatible",
 			error: n.message,
 			errorPath: o
@@ -8724,7 +8724,7 @@ function ba(e, t) {
 		};
 	}
 }
-function xa(e) {
+function ba(e) {
 	function t(t) {
 		if (!t.startsWith("#")) return;
 		let n = decodeURIComponent(t.slice(1));
@@ -8778,10 +8778,10 @@ function xa(e) {
 new TextEncoder();
 //#endregion
 //#region src/flow/common/semantics.ts
-function Sa(e) {
+function xa(e) {
 	return Object.keys(e).toSorted().map((t) => [t, e[t]]);
 }
-function Ca(e) {
+function Sa(e) {
 	let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set();
 	function o(e) {
 		t.add(e);
@@ -8796,7 +8796,7 @@ function Ca(e) {
 		for (let t of Object.values(e)) if (t.kind == "sources") for (let e of t.sources) e.kind == "binding" && (n.add(e.bindingId), o(e.bindingId));
 	}
 	function l(e) {
-		for (let [, t] of Sa(e.nodes)) switch ("inputs" in t && c(t.inputs), t.kind) {
+		for (let [, t] of xa(e.nodes)) switch ("inputs" in t && c(t.inputs), t.kind) {
 			case "condition": break;
 			case "subflow":
 				u(t.subflowId);
@@ -8826,24 +8826,24 @@ function Ca(e) {
 		tasks: a
 	};
 }
-function wa(e, t) {
+function Ca(e, t) {
 	if (e === t) return !0;
 	if (e == null || t == null || typeof e != "object" || typeof t != "object") return !1;
-	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => wa(e, t[n]));
+	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => Ca(e, t[n]));
 	let n = Object.entries(e), r = t;
-	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && wa(t, r[e]));
+	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && Ca(t, r[e]));
 }
-function Ta(e) {
+function wa(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
-function Ea(e) {
+function Ta(e) {
 	return Array.isArray(e) ? e : void 0;
 }
-function Da(e, t, n = !1, r = !1) {
-	if (t === !0 || wa(t, {})) return !0;
-	if (e === !0 || wa(e, {}) || e === !1 || t === !1) return !1;
-	let i = Ta(e), a = Ta(t);
-	return i == null || a == null ? !1 : ba({
+function Ea(e, t, n = !1, r = !1) {
+	if (t === !0 || Ca(t, {})) return !0;
+	if (e === !0 || Ca(e, {}) || e === !1 || t === !1) return !1;
+	let i = wa(e), a = wa(t);
+	return i == null || a == null ? !1 : ya({
 		nullable: n,
 		packageId: void 0,
 		schema: i
@@ -8853,16 +8853,16 @@ function Da(e, t, n = !1, r = !1) {
 		schema: a
 	}).kind == "compatible";
 }
-function Oa(e) {
-	let t = Ta(e), n = Ea(t?.type);
-	return t != null && n?.includes("string") ? Da({ type: "string" }, {
+function Da(e) {
+	let t = wa(e), n = Ta(t?.type);
+	return t != null && n?.includes("string") ? Ea({ type: "string" }, {
 		...t,
 		type: "string"
-	}) : Da({ type: "string" }, e);
+	}) : Ea({ type: "string" }, e);
 }
 //#endregion
 //#region \0virtual:oomol-provider-icons
-var ka = {
+var Oa = {
 	"17track": "https://static.oomol.com/logo/third-party/17track.svg",
 	"7_shifts": "https://static.oomol.com/logo/third-party/7_shifts.png",
 	ably: "https://static.oomol.com/logo/third-party/ably.svg",
@@ -8870,6 +8870,7 @@ var ka = {
 	abyssale: "https://static.oomol.com/logo/third-party/abyssale.svg",
 	abuseipdb: "https://static.oomol.com/logo/third-party/abuseipdb.svg",
 	api_void: "https://static.oomol.com/logo/third-party/api_void.png",
+	appledb: "https://static.oomol.com/logo/third-party/appledb.png",
 	abstract: "https://static.oomol.com/logo/third-party/abstract.svg",
 	aroflo: "https://static.oomol.com/logo/third-party/aroflo.svg",
 	a_leads: "https://static.oomol.com/logo/third-party/a_leads.svg",
@@ -9115,6 +9116,7 @@ var ka = {
 	diffy: "https://static.oomol.com/logo/third-party/diffy.svg",
 	infolobby: "https://static.oomol.com/logo/third-party/infolobby.png",
 	invoice_ninja: "https://static.oomol.com/logo/third-party/invoice_ninja.png",
+	karakeep: "https://static.oomol.com/logo/third-party/karakeep.svg",
 	niftyimages: "https://static.oomol.com/logo/third-party/niftyimages.png",
 	commpeak: "https://static.oomol.com/logo/third-party/commpeak.svg",
 	configcat: "https://static.oomol.com/logo/third-party/configcat.svg",
@@ -9596,6 +9598,7 @@ var ka = {
 	jumpcloud: "https://static.oomol.com/logo/third-party/jumpcloud.png",
 	jumpseller: "https://static.oomol.com/logo/third-party/jumpseller.svg",
 	jumpserver: "https://static.oomol.com/logo/third-party/jumpserver.svg",
+	jushuitan: "https://static.oomol.com/logo/third-party/jushuitan.svg",
 	luckin_coffee: "https://static.oomol.com/logo/third-party/luckin_coffee.svg",
 	juniper_mist: "https://static.oomol.com/logo/third-party/juniper_mist.png",
 	ip2location: "https://static.oomol.com/logo/third-party/ip2location.png",
@@ -9797,6 +9800,7 @@ var ka = {
 	neon: "https://static.oomol.com/logo/third-party/Neon.svg",
 	netsuite: "https://static.oomol.com/logo/third-party/netsuite.svg",
 	netease_mail: "https://static.oomol.com/logo/third-party/netease_mail.png",
+	netease_enterprise_mail: "https://static.oomol.com/logo/third-party/netease_enterprise_mail.png",
 	neutrino: "https://static.oomol.com/logo/third-party/neutrino.svg",
 	nethunt: "https://static.oomol.com/logo/third-party/nethunt.png",
 	next_dns: "https://static.oomol.com/logo/third-party/next_dns.svg",
@@ -10326,35 +10330,35 @@ var ka = {
 };
 //#endregion
 //#region src/workbench/browser/runtime/providerIcon.ts
-function Aa(e, t = ka) {
-	let n = Pa(Ma(e.serviceName)), r = ja(e, t);
+function ka(e, t = Oa) {
+	let n = Na(ja(e.serviceName)), r = Aa(e, t);
 	return r == null ? n : h(r, n);
 }
-function ja(e, t = ka) {
+function Aa(e, t = Oa) {
 	let n = e.icon?.trim();
 	if (n) return n;
 	let r = t[e.serviceId]?.trim();
 	if (r) return r;
-	let i = Na(e.homepageUrl);
+	let i = Ma(e.homepageUrl);
 	return i == null ? void 0 : `https://www.google.com/s2/favicons?sz=64&domain=${encodeURIComponent(i)}`;
 }
-function Ma(e) {
+function ja(e) {
 	return e.split(/\s+/).map((e) => e[0]).join("").slice(0, 2).toUpperCase() || "?";
 }
-function Na(e) {
+function Ma(e) {
 	if (e) try {
 		return new URL(e).hostname || void 0;
 	} catch {
 		return;
 	}
 }
-function Pa(e) {
+function Na(e) {
 	let t = `<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"><rect width="64" height="64" rx="12" fill="#e4e4e7"/><text x="32" y="33" fill="#3f3f46" font-family="Arial,sans-serif" font-size="25" font-weight="600" text-anchor="middle" dominant-baseline="central">${[...e].map((e) => `&#${e.codePointAt(0)};`).join("")}</text></svg>`;
 	return `data:image/svg+xml,${encodeURIComponent(t)}`;
 }
 //#endregion
 //#region src/workbench/browser/runtime/workspace.ts
-function Fa(e) {
+function Pa(e) {
 	let t = [], n = /* @__PURE__ */ new Map(), r;
 	for (let i of e) n.set(i.connectionId, i), i.status == "active" && (t.push(i), i.isDefault && (r = i));
 	return {
@@ -10364,7 +10368,7 @@ function Fa(e) {
 		preferred: r ?? (t.length == 1 ? t[0] : void 0)
 	};
 }
-function Ia(e, t) {
+function Fa(e, t) {
 	if (e.node.name != null) return e.node.name;
 	switch (e.kind) {
 		case "condition": return t?.("addNode.condition") ?? "Condition";
@@ -10374,34 +10378,41 @@ function Ia(e, t) {
 		case "task": return e.definition?.name ?? (e.node.task == null ? e.node.taskId : e.node.task.moduleId);
 	}
 }
-function La(e) {
+function Ia(e) {
 	if (e.kind == "value") return ":oomol:value:";
 	if (e.kind != "task") return;
 	let t = e.definition;
 	if (!(t == null || "moduleId" in t)) return t.executor.kind == "llm" ? ":carbon:machine-learning-model:" : ":carbon:connection-signal:";
 }
-function X(e) {
+function Z(e) {
 	if (!(typeof e != "object" || !e || Array.isArray(e))) return e;
 }
-function Z(e) {
+function La(e) {
 	return typeof e == "number" && Number.isFinite(e) ? e : void 0;
 }
 function Q(e, t) {
-	let n = X(e.designer);
+	let n = Z(e.designer);
 	if (n?.version == 1) return fo(n, t);
 }
 function Ra(e, t, n) {
-	return X(X(Q(e, t)?.layouts)?.[n]);
-}
-function za(e, t, n, r = "detail") {
-	let i = X(Ra(e, t, r)?.nodes), a = r == "detail" ? X(Q(e, t)?.nodes) : void 0, o = X(i?.[n] ?? a?.[n]), s = Z(o?.x), c = Z(o?.y);
-	return s == null || c == null ? void 0 : {
-		x: s,
-		y: c
+	return Z(Z(Q(e, t)?.layouts)?.[n]);
+}
+function za(e, t) {
+	let n = Q(e, t), r = Z(n?.layouts), i = (e) => Object.fromEntries(Object.entries(Z(e) ?? {}).flatMap(([e, t]) => {
+		let n = Z(t), r = La(n?.x), i = La(n?.y);
+		return r == null || i == null ? [] : [[e, {
+			x: r,
+			y: i
+		}]];
+	}));
+	return {
+		...i(Z(r?.overview)?.nodes),
+		...i(n?.nodes),
+		...i(Z(r?.detail)?.nodes)
 	};
 }
 function Ba(e, t, n) {
-	let r = n == "detail" ? Q(e, t)?.viewport : void 0, i = X(Ra(e, t, n)?.viewport ?? r), a = Z(i?.x), o = Z(i?.y), s = Z(i?.zoom);
+	let r = n == "detail" ? Q(e, t)?.viewport : void 0, i = Z(Ra(e, t, n)?.viewport ?? r), a = La(i?.x), o = La(i?.y), s = La(i?.zoom);
 	return a == null || o == null || s == null || s <= 0 ? void 0 : {
 		x: a,
 		y: o,
@@ -10416,49 +10427,26 @@ function Va(e, t, n = "detail") {
 	};
 }
 function Ha(e, t) {
-	let n = Object.fromEntries(hn.flatMap((n) => {
-		let r = Ra(e, t, n), i = X(r?.nodes), a = Object.fromEntries(Object.entries(i ?? {}).flatMap(([e, t]) => {
-			let n = X(t), r = Z(n?.x), i = Z(n?.y);
-			return r == null || i == null ? [] : [[e, {
-				x: r,
-				y: i
-			}]];
-		})), o = X(r?.viewport), s = Z(o?.x), c = Z(o?.y), l = Z(o?.zoom);
-		return Object.keys(a).length == 0 && (s == null || c == null || l == null || l <= 0) ? [] : [[n, {
-			nodes: Object.keys(a).length == 0 ? void 0 : a,
-			viewport: s == null || c == null || l == null || l <= 0 ? void 0 : {
-				x: s,
-				y: c,
-				zoom: l
-			}
-		}]];
+	return Object.fromEntries(mn.flatMap((n) => {
+		let r = Ba(e, t, n);
+		return r == null ? [] : [[n, { viewport: {
+			x: r.x,
+			y: r.y,
+			zoom: r.zoom
+		} }]];
 	}));
-	if (n.detail == null) {
-		let r = X(Q(e, t)?.nodes), i = Object.fromEntries(Object.entries(r ?? {}).flatMap(([e, t]) => {
-			let n = X(t), r = Z(n?.x), i = Z(n?.y);
-			return r == null || i == null ? [] : [[e, {
-				x: r,
-				y: i
-			}]];
-		})), a = Ba(e, t, "detail");
-		(Object.keys(i).length > 0 || a != null) && (n.detail = {
-			nodes: Object.keys(i).length == 0 ? void 0 : i,
-			viewport: a
-		});
-	}
-	return n;
 }
-function Ua(e, t) {
-	let n = X(Q(e, t)?.comments) ?? {};
-	return Object.fromEntries(Object.entries(n).flatMap(([n, r]) => {
-		let i = X(r), a = typeof i?.title == "string" ? i.title : void 0, o = typeof i?.content == "string" ? i.content : void 0;
-		return a == null || o == null ? [] : [[n, {
-			content: o,
-			position: za(e, t, n) ?? {
+function Ua(e, t, n) {
+	let r = Z(Q(e, t)?.comments) ?? {};
+	return Object.fromEntries(Object.entries(r).flatMap(([e, t]) => {
+		let r = Z(t), i = typeof r?.title == "string" ? r.title : void 0, a = typeof r?.content == "string" ? r.content : void 0;
+		return i == null || a == null ? [] : [[e, {
+			content: a,
+			position: n[e] ?? {
 				x: 80,
 				y: 80
 			},
-			title: a
+			title: i
 		}]];
 	}));
 }
@@ -10734,7 +10722,7 @@ function to(e, t, n, r, i) {
 			...n?.kind == "value" ? { value: n.value } : {},
 			...c.length > 0 ? { sources: c } : {},
 			...d?.kind == "variable" ? { variable: d.target } : {},
-			variableCompatible: Oa(s.jsonSchema),
+			variableCompatible: Da(s.jsonSchema),
 			variableEnabled: i
 		});
 	}
@@ -10774,9 +10762,9 @@ function ao(e) {
 }
 function oo(e, t, n) {
 	if (t.kind != "integration" && t.kind != "poll") return [];
-	let r = X(t.definition.configSchema), i = X(r?.properties), a = new Set(Array.isArray(r?.required) ? r.required.filter((e) => typeof e == "string") : []), o = n.some((t) => t.code == "trigger.config-incomplete" && t.path == `/document/graph/nodes/${e}/config`), s = [];
+	let r = Z(t.definition.configSchema), i = Z(r?.properties), a = new Set(Array.isArray(r?.required) ? r.required.filter((e) => typeof e == "string") : []), o = n.some((t) => t.code == "trigger.config-incomplete" && t.path == `/document/graph/nodes/${e}/config`), s = [];
 	for (let [e, n] of Object.entries(i ?? {})) {
-		let r = X(n);
+		let r = Z(n);
 		if (r == null) continue;
 		let i = Object.hasOwn(t.config, e) ? t.config[e] : r.default, c = {
 			...typeof r.description == "string" ? { description: r.description } : {},
@@ -10801,7 +10789,7 @@ function oo(e, t, n) {
 			});
 			continue;
 		}
-		let l = X(r.items);
+		let l = Z(r.items);
 		if (r.type == "array" && Array.isArray(l?.enum)) {
 			s.push({
 				...c,
@@ -10879,7 +10867,7 @@ function so(e, t, n, r) {
 	return {
 		description: t.description,
 		diagnostics: Qa(e, r),
-		icon: t.icon ?? (t.kind == "integration" || t.kind == "poll" ? Aa({
+		icon: t.icon ?? (t.kind == "integration" || t.kind == "poll" ? ka({
 			serviceId: t.definition.provider,
 			serviceName: t.definition.provider
 		}) : Za(t)),
@@ -10905,7 +10893,7 @@ function co(e, t, n, r, i) {
 		concurrency: a.concurrency,
 		description: a.description,
 		diagnostics: qa(i.target, t, i.diagnostics),
-		icon: a.icon ?? (u == null ? La(t) : Aa(u)),
+		icon: a.icon ?? (u == null ? Ia(t) : ka(u)),
 		id: e,
 		inputs: o,
 		outputs: s,
@@ -10914,7 +10902,7 @@ function co(e, t, n, r, i) {
 		rawTitle: a.name,
 		...h == null ? {} : { run: h },
 		timeoutSeconds: a.timeoutMs == null ? void 0 : a.timeoutMs / 1e3,
-		title: Ia(t, i.t)
+		title: Fa(t, i.t)
 	};
 	switch (a.kind) {
 		case "condition": return {
@@ -10959,7 +10947,7 @@ function co(e, t, n, r, i) {
 				...g,
 				kind: a.kind,
 				...r == null ? {} : { notice: {
-					...t == null ? {} : { icon: Aa(t) },
+					...t == null ? {} : { icon: ka(t) },
 					text: `${i.t?.("inspector.wait.notificationTask") ?? "Notification"} · ${r}`
 				} }
 			};
@@ -10967,7 +10955,7 @@ function co(e, t, n, r, i) {
 	}
 }
 function lo(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1, d = !1, f = !0) {
-	let p = e == null ? void 0 : sn(e), m = p == null || t == null ? void 0 : p.graph(t);
+	let p = e == null ? void 0 : on(e), m = p == null || t == null ? void 0 : p.graph(t);
 	if (p == null || t == null || m == null) return {
 		edges: [],
 		nodes: [],
@@ -10977,7 +10965,7 @@ function lo(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1,
 			zoom: 1
 		}
 	};
-	let ee = Ja(p, t, s, c), h = Object.entries(m.nodes), g = new Map(h.map(([e, t]) => [e, p.resolveNode(e, t)])), te = new Set(h.map(([e]) => e)), ne = new Map([...g].map(([e, t]) => [e, Ga(t)])), re = $a(h, te, ne), ie = eo(te, re.dependencies, re.dependents), _ = {
+	let ee = Ja(p, t, s, c), h = Object.entries(m.nodes), g = new Map(h.map(([e, t]) => [e, p.resolveNode(e, t)])), te = new Set(h.map(([e]) => e)), ne = new Map([...g].map(([e, t]) => [e, Ga(t)])), re = $a(h, te, ne), ie = eo(te, re.dependencies, re.dependents), _ = za(n, t), ae = {
 		connectionCatalogs: a,
 		connectorActions: i,
 		diagnostics: r,
@@ -10986,21 +10974,21 @@ function lo(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1,
 		t: o,
 		target: t,
 		variables: f
-	}, ae = /* @__PURE__ */ new Map(), oe = [];
+	}, oe = /* @__PURE__ */ new Map(), se = [];
 	for (let e of ie.ordered) {
-		let i = ie.depth.get(e) ?? 0, a = ae.get(i) ?? 0;
-		ae.set(i, a + 1);
-		let o = za(n, t, e) ?? {
-			x: 80 + i * 500,
-			y: 80 + a * 240
-		}, s = g.get(e);
-		if (s.kind == "trigger") {
-			oe.push(so(e, s.trigger, o, r));
+		let t = ie.depth.get(e) ?? 0, n = oe.get(t) ?? 0;
+		oe.set(t, n + 1);
+		let i = _[e] ?? {
+			x: 80 + t * 500,
+			y: 80 + n * 240
+		}, a = g.get(e);
+		if (a.kind == "trigger") {
+			se.push(so(e, a.trigger, i, r));
 			continue;
 		}
-		oe.push(co(e, s, ne.get(e), o, _));
+		se.push(co(e, a, ne.get(e), i, ae));
 	}
-	for (let [e, r] of Object.entries(Ua(n, t)).toSorted(([e], [t]) => e.localeCompare(t))) oe.push({
+	for (let [e, r] of Object.entries(Ua(n, t, _)).toSorted(([e], [t]) => e.localeCompare(t))) se.push({
 		...r,
 		id: e,
 		kind: "comment"
@@ -11008,7 +10996,7 @@ function lo(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1,
 	return {
 		edges: re.edges,
 		layouts: Ha(n, t),
-		nodes: oe,
+		nodes: se,
 		...ee.status == null ? {} : { runStatus: ee.status },
 		viewport: Va(n, t),
 		variableNames: l,
@@ -11017,11 +11005,11 @@ function lo(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1,
 	};
 }
 function uo(e) {
-	let t = X(e.designer);
+	let t = Z(e.designer);
 	return t?.version == 1 ? t : { version: 1 };
 }
 function fo(e, t) {
-	return t.kind == "flow" ? X(e.flow) : X(X(e.subflows)?.[t.id]);
+	return t.kind == "flow" ? Z(e.flow) : Z(Z(e.subflows)?.[t.id]);
 }
 function po(e, t, n) {
 	if (t.kind == "flow") return {
@@ -11029,7 +11017,7 @@ function po(e, t, n) {
 		flow: n,
 		version: 1
 	};
-	let r = X(e.subflows) ?? {};
+	let r = Z(e.subflows) ?? {};
 	return {
 		...e,
 		subflows: {
@@ -11039,9 +11027,17 @@ function po(e, t, n) {
 		version: 1
 	};
 }
-function mo(e, t, n, r = "detail") {
-	let i = uo(e), a = fo(i, t) ?? {}, o = X(a.layouts) ?? {}, s = X(o[r]) ?? {}, c = {
-		...X(s.nodes) ?? {},
+function mo(e, t) {
+	let n = {
+		...Q(e, t),
+		layouts: Ha(e, t),
+		nodes: za(e, t)
+	};
+	return delete n.viewport, n;
+}
+function ho(e, t, n) {
+	let r = uo(e), i = mo(e, t), a = {
+		...Z(i.nodes) ?? {},
 		...Object.fromEntries(Object.entries(n).map(([e, t]) => [e, {
 			x: t.x,
 			y: t.y
@@ -11049,20 +11045,14 @@ function mo(e, t, n, r = "detail") {
 	};
 	return {
 		...e,
-		designer: po(i, t, {
-			...a,
-			layouts: {
-				...o,
-				[r]: {
-					...s,
-					nodes: c
-				}
-			}
+		designer: po(r, t, {
+			...i,
+			nodes: a
 		})
 	};
 }
-function ho(e, t, n, r) {
-	let i = mo(e, t, { [n]: r.position }), a = uo(i), o = fo(a, t) ?? {}, s = X(o.comments) ?? {};
+function go(e, t, n, r) {
+	let i = ho(e, t, { [n]: r.position }), a = uo(i), o = fo(a, t) ?? {}, s = Z(o.comments) ?? {};
 	return {
 		...i,
 		designer: po(a, t, {
@@ -11077,8 +11067,8 @@ function ho(e, t, n, r) {
 		})
 	};
 }
-function go(e, t, n) {
-	let r = uo(e), i = fo(r, t) ?? {}, a = { ...X(i.comments) }, o = { ...X(i.nodes) };
+function _o(e, t, n) {
+	let r = uo(e), i = mo(e, t), a = { ...Z(i.comments) }, o = { ...Z(i.nodes) };
 	for (let e of n) delete a[e], delete o[e];
 	return {
 		...e,
@@ -11089,13 +11079,13 @@ function go(e, t, n) {
 		})
 	};
 }
-function _o(e, t) {
-	return new Set(Object.keys(X(Q(e, t)?.comments) ?? {}));
+function vo(e, t) {
+	return new Set(Object.keys(Z(Q(e, t)?.comments) ?? {}));
 }
-function vo(e, t, n, r = "detail") {
+function yo(e, t, n, r = "detail") {
 	let i = Ba(e, t, r);
 	if (i?.x == n.x && i.y == n.y && i.zoom == n.zoom) return e;
-	let a = uo(e), o = fo(a, t) ?? {}, s = X(o.layouts) ?? {}, c = X(s[r]) ?? {};
+	let a = uo(e), o = mo(e, t), s = Z(o.layouts) ?? {}, c = Z(s[r]) ?? {};
 	return {
 		...e,
 		designer: po(a, t, {
@@ -11114,7 +11104,7 @@ function vo(e, t, n, r = "detail") {
 		})
 	};
 }
-function yo(e, t, n) {
+function bo(e, t, n) {
 	let r = e.payload.nodeTitle;
 	if (typeof r == "string") return r;
 	let i = e.payload.executionId;
@@ -11127,7 +11117,7 @@ function yo(e, t, n) {
 }
 //#endregion
 //#region src/workbench/browser/runtime/designer/addNodeOptions.ts
-function bo(e) {
+function xo(e) {
 	let t = /* @__PURE__ */ new Map(), n = (e) => {
 		t.set(e.id, e);
 		for (let t of e.choices ?? []) n(t.option);
@@ -11135,7 +11125,7 @@ function bo(e) {
 	for (let t of e) n(t);
 	return t;
 }
-function xo(e) {
+function So(e) {
 	let t = e("addNode.blocks");
 	return [
 		{
@@ -11258,9 +11248,9 @@ function xo(e) {
 		}
 	];
 }
-function So(e, t, n) {
+function Co(e, t, n) {
 	if (e == null || t == null) return [];
-	let r = xo(n);
+	let r = So(n);
 	if (t.kind != "flow") return r;
 	let i = n("addNode.triggers");
 	return [
@@ -11314,7 +11304,7 @@ function So(e, t, n) {
 		...r
 	];
 }
-function Co(e, t, n, r) {
+function wo(e, t, n, r) {
 	switch (e.kind) {
 		case "new-task": return {
 			kind: "code",
@@ -11372,29 +11362,29 @@ function Co(e, t, n, r) {
 }
 //#endregion
 //#region src/manifest/common/meta/block/generateTyping.ts
-function wo(e, t, n) {
-	return e === "typescript" ? ko(t, n) + "\n" : Ao(t, n) + "\n";
+function To(e, t, n) {
+	return e === "typescript" ? Ao(t, n) + "\n" : jo(t, n) + "\n";
 }
-var To = /* @__PURE__ */ new Set(["color", "text"]), Eo = (e) => e.includes(" | ") ? `(${e})` : e;
-function Do(e) {
-	return !e || typeof e != "object" ? !1 : e.contentMediaType === "oomol/artifact" ? !0 : Array.isArray(e.anyOf) ? e.anyOf.some(Do) : e.type === "object" ? Object.values(e.properties || {}).some(Do) : e.type === "array" && Do(e.items);
+var Eo = /* @__PURE__ */ new Set(["color", "text"]), Do = (e) => e.includes(" | ") ? `(${e})` : e;
+function Oo(e) {
+	return !e || typeof e != "object" ? !1 : e.contentMediaType === "oomol/artifact" ? !0 : Array.isArray(e.anyOf) ? e.anyOf.some(Oo) : e.type === "object" ? Object.values(e.properties || {}).some(Oo) : e.type === "array" && Oo(e.items);
 }
-function Oo(e, t) {
-	return [...e, ...t].some((e) => Do(e.json_schema));
+function ko(e, t) {
+	return [...e, ...t].some((e) => Oo(e.json_schema));
 }
-function ko(e = [], t = []) {
+function Ao(e = [], t = []) {
 	let n = ["type Inputs = {"];
 	for (let t of e) n.push(`  ${t.handle}: ${$(t.json_schema, t.nullable)};`);
 	n.push("};"), n.push("type Outputs = {");
 	for (let e of t) n.push(`  ${e.handle}: ${$(e.json_schema, e.nullable)};`);
-	return n.push("};"), Oo(e, t) && n.unshift("import type { ArtifactRef } from '@oomol-lab/open-flow'", ""), n.join("\n");
+	return n.push("};"), ko(e, t) && n.unshift("import type { ArtifactRef } from '@oomol-lab/open-flow'", ""), n.join("\n");
 }
-function Ao(e = [], t = []) {
+function jo(e = [], t = []) {
 	let n = ["@typedef {{"];
 	for (let t of e) n.push(`  ${t.handle}: ${$(t.json_schema, t.nullable)};`);
 	n.push("}} Inputs;"), n.push("@typedef {{");
 	for (let e of t) n.push(`  ${e.handle}: ${$(e.json_schema, e.nullable)};`);
-	n.push("}} Outputs;"), Oo(e, t) && n.unshift("@import { ArtifactRef } from \"@oomol-lab/open-flow\"");
+	n.push("}} Outputs;"), ko(e, t) && n.unshift("@import { ArtifactRef } from \"@oomol-lab/open-flow\"");
 	let r = n.map((e) => ` * ${e}`);
 	return r.unshift("/**"), r.push(" */"), r.join("\n");
 }
@@ -11404,9 +11394,9 @@ function $(e, t) {
 		case "oomol/bin": return t ? "Uint8Array | null" : "Uint8Array";
 		case "oomol/artifact": return t ? "ArtifactRef | null" : "ArtifactRef";
 	}
-	if (To.has(e["ui:widget"])) return t ? "string | null" : "string";
-	if (Array.isArray(e.anyOf)) return jo((t ? e.anyOf.concat({ type: "null" }) : e.anyOf).map((e) => Eo($(e, !1)))) || "any";
-	if (Array.isArray(e.enum)) return jo((t ? e.enum.concat(null) : e.enum).map((e) => JSON.stringify(e))) || "any";
+	if (Eo.has(e["ui:widget"])) return t ? "string | null" : "string";
+	if (Array.isArray(e.anyOf)) return Mo((t ? e.anyOf.concat({ type: "null" }) : e.anyOf).map((e) => Do($(e, !1)))) || "any";
+	if (Array.isArray(e.enum)) return Mo((t ? e.enum.concat(null) : e.enum).map((e) => JSON.stringify(e))) || "any";
 	switch (e.type) {
 		case "null": return "null";
 		case "boolean": return t ? "boolean | null" : "boolean";
@@ -11421,30 +11411,30 @@ function $(e, t) {
 		}
 		case "array":
 			if (e.uniqueItems && Array.isArray(e.items?.enum)) {
-				let n = `${Eo($(e.items, !1))}[]`;
+				let n = `${Do($(e.items, !1))}[]`;
 				return t ? `${n} | null` : n;
 			}
 			{
-				let n = `${Eo($(e.items, !1))}[]`;
+				let n = `${Do($(e.items, !1))}[]`;
 				return t ? `${n} | null` : n;
 			}
 		default: return "any";
 	}
 }
-function jo(e) {
+function Mo(e) {
 	let t = Array.from(new Set(e.filter((e) => !!e)));
 	return t.length === 0 || t.includes("any") ? "any" : t.join(" | ");
 }
 //#endregion
 //#region src/workbench/browser/runtime/designer/flowChanges.ts
-function Mo(e, t) {
+function No(e, t) {
 	return {
 		...e,
 		content: l(e.content, t)
 	};
 }
-function No(e) {
-	return wo("javascript", e.inputs.flatMap((e) => "handle" in e ? [{
+function Po(e) {
+	return To("javascript", e.inputs.flatMap((e) => "handle" in e ? [{
 		handle: e.handle,
 		json_schema: e.jsonSchema,
 		nullable: e.nullable
@@ -11454,7 +11444,7 @@ function No(e) {
 		nullable: e.nullable
 	}] : []));
 }
-function Po(e) {
+function Fo(e) {
 	return {
 		executor: {
 			action: e.actionId,
@@ -11466,20 +11456,20 @@ function Po(e) {
 		outputs: Object.entries(e.outputs).map(([e, t]) => Object.assign({ handle: e }, t))
 	};
 }
-function Fo(e) {
+function Io(e) {
 	let t = Object.entries(e.inputs);
 	return t.find(([, e]) => {
 		let t = e.jsonSchema;
 		return typeof t == "object" && !!t && !Array.isArray(t) && "type" in t && t.type == "string";
 	})?.[0] ?? t[0]?.[0];
 }
-function Io(e, t, n) {
-	return n == null || Ca(l(e.revision.content, t)).tasks.has(n) ? t : [...t, {
+function Lo(e, t, n) {
+	return n == null || Sa(l(e.revision.content, t)).tasks.has(n) ? t : [...t, {
 		kind: "task.delete",
 		taskId: n
 	}];
 }
-function Lo(e, t) {
+function Ro(e, t) {
 	return [{
 		kind: "subflow.create",
 		subflow: {
@@ -11504,7 +11494,7 @@ function Lo(e, t) {
 		subflowId: e
 	}];
 }
-function Ro(e, t, n, r, i) {
+function zo(e, t, n, r, i) {
 	switch (r.kind) {
 		case "code": return Tt(t, {
 			moduleId: n,
@@ -11517,13 +11507,13 @@ function Ro(e, t, n, r, i) {
 		case "connector": return Et(t, {
 			nodeId: n,
 			taskId: i()
-		}, Po(r.action));
+		}, Fo(r.action));
 		case "condition": return Ot(t, n, r.name);
 		case "value": return kt(t, n, r.name);
 		case "wait": return t.kind == "flow" ? At(t, n, r.name) : void 0;
 		case "subflow": {
 			let i = e.subflow(r.subflowId);
-			return i == null ? void 0 : rs(t, n, r.subflowId, i.inputs);
+			return i == null ? void 0 : is(t, n, r.subflowId, i.inputs);
 		}
 		case "webhook": return t.kind == "flow" ? jt(t, n, {
 			inputsDef: [],
@@ -11548,10 +11538,10 @@ function Ro(e, t, n, r, i) {
 		}) : void 0;
 	}
 }
-function zo(e, t, n) {
+function Bo(e, t, n) {
 	return Nt(e.revision.content, t, n);
 }
-function Bo(e, t, n) {
+function Vo(e, t, n) {
 	let r = e.graph(t)?.nodes ?? {}, i = Object.fromEntries(n.flatMap((e) => r[e] == null ? [] : [[e, r[e]]]));
 	return {
 		bindings: Object.fromEntries(Object.values(i).flatMap((t) => "inputs" in t ? [...Object.values(t.inputs), ...t.kind == "wait" && t.notification != null ? Object.values(t.notification.inputs) : []].flatMap((t) => t.kind == "sources" ? t.sources.flatMap((t) => {
@@ -11567,7 +11557,7 @@ function Bo(e, t, n) {
 		nodes: i
 	};
 }
-function Vo(e, t, n, r) {
+function Ho(e, t, n, r) {
 	if (e.graph(t) == null) return {
 		changes: [],
 		nodeIds: [],
@@ -11692,10 +11682,10 @@ function Vo(e, t, n, r) {
 		sourceIds: a
 	};
 }
-function Ho(e, t, n, r) {
+function Uo(e, t, n, r) {
 	return Pt(e.revision.content, t, n, r);
 }
-function Uo(e, t, n, r) {
+function Wo(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i != null) return i.description == r ? [] : [{
 		before: i.description,
@@ -11706,7 +11696,7 @@ function Uo(e, t, n, r) {
 		value: r
 	}];
 }
-function Wo(e, t, n, r) {
+function Go(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i != null) return i.icon == r ? [] : [{
 		before: i.icon,
@@ -11717,7 +11707,7 @@ function Wo(e, t, n, r) {
 		value: r
 	}];
 }
-function Go(e, t, n, r) {
+function Ko(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i == null) return;
 	let a = "inputs" in i ? r : r ?? i.name;
@@ -11730,17 +11720,17 @@ function Go(e, t, n, r) {
 		value: a
 	}];
 }
-function Ko(e, t, n, r, i) {
+function qo(e, t, n, r, i) {
 	let a = e.graph(t)?.nodes[n];
 	if (!(i === void 0 && a != null && "inputs" in a && a.inputs[r] == null)) return Ft(e.revision.content, t, n, r, i);
 }
-function qo(e, t, n, r, i, a) {
+function Jo(e, t, n, r, i, a) {
 	return Lt(e.revision.content, t, n, r, i, a);
 }
-function Jo(e, t, n, i) {
+function Yo(e, t, n, i) {
 	let a = e.graph(t), o = a?.nodes[n];
 	if (a == null || o?.kind != "condition") return;
-	let s = Object.fromEntries([...o.cases.map((e) => [e.output, !0]), ...o.defaultOutput == null ? [] : [[o.defaultOutput, !0]]]), c = Object.fromEntries([...i.cases.map((e) => [e.output, !0]), ...i.defaultOutput == null ? [] : [[i.defaultOutput, !0]]]), l = o.input.handle == i.input.handle ? void 0 : [o.input.handle, i.input.handle], u = as(Object.keys(s).map((e) => ({ handle: e })), Object.keys(c).map((e) => ({ handle: e }))), d = new Set(Object.keys(c)), f = [];
+	let s = Object.fromEntries([...o.cases.map((e) => [e.output, !0]), ...o.defaultOutput == null ? [] : [[o.defaultOutput, !0]]]), c = Object.fromEntries([...i.cases.map((e) => [e.output, !0]), ...i.defaultOutput == null ? [] : [[i.defaultOutput, !0]]]), l = o.input.handle == i.input.handle ? void 0 : [o.input.handle, i.input.handle], u = os(Object.keys(s).map((e) => ({ handle: e })), Object.keys(c).map((e) => ({ handle: e }))), d = new Set(Object.keys(c)), f = [];
 	for (let [e, s] of Object.entries(a.nodes)) {
 		if (!("inputs" in s)) continue;
 		let a = { ...s.inputs };
@@ -11773,11 +11763,11 @@ function Jo(e, t, n, i) {
 				value: i
 			});
 		}
-		f.push(...os(s.inputs, a, t, e));
+		f.push(...ss(s.inputs, a, t, e));
 	}
 	return D(e.revision.content, f);
 }
-function Yo(e, t, n, i) {
+function Xo(e, t, n, i) {
 	let a = e.node(t, n)?.node;
 	if (a?.kind != "value") return;
 	let o = i.map((e) => ({
@@ -11795,7 +11785,7 @@ function Yo(e, t, n, i) {
 		value: o
 	}];
 }
-function Xo(e, t, n, i) {
+function Zo(e, t, n, i) {
 	if (t.kind != "flow") return;
 	let a = e.graph(t), o = a?.nodes[n];
 	if (a == null || o?.kind != "wait") return;
@@ -11868,13 +11858,13 @@ function Xo(e, t, n, i) {
 			}
 		});
 	}
-	return u.length == 0 ? [] : Io(e, D(e.revision.content, u), o.notification?.taskId == i.notification?.taskId ? void 0 : o.notification?.taskId);
+	return u.length == 0 ? [] : Lo(e, D(e.revision.content, u), o.notification?.taskId == i.notification?.taskId ? void 0 : o.notification?.taskId);
 }
-function Zo(e, t, n, r) {
-	let i = e.graph({ kind: "flow" })?.nodes[t], a = Fo(n);
-	if (i?.kind == "wait" && a != null) return Io(e, [{
+function Qo(e, t, n, r) {
+	let i = e.graph({ kind: "flow" })?.nodes[t], a = Io(n);
+	if (i?.kind == "wait" && a != null) return Lo(e, [{
 		kind: "task.create",
-		task: Po(n),
+		task: Fo(n),
 		taskId: r
 	}, {
 		before: {
@@ -11896,10 +11886,10 @@ function Zo(e, t, n, r) {
 		}
 	}], i.notification?.taskId);
 }
-function Qo(e, t, n, r) {
+function $o(e, t, n, r) {
 	let i = e.graph(t)?.nodes[n];
 	if (i?.kind == "task") switch (r.kind) {
-		case "code": return i.task == null ? void 0 : ss(e, t, n, {
+		case "code": return i.task == null ? void 0 : cs(e, t, n, {
 			...i.task,
 			name: r.name
 		});
@@ -11932,21 +11922,21 @@ function Qo(e, t, n, r) {
 		}
 	}
 }
-function $o(e, t, n, i) {
+function es(e, t, n, i) {
 	let a = e.node(t, n);
 	if (a?.kind != "task" || a.node.task == null || a.module == null || r(a.node.task.inputs, i.inputs) && r(a.node.task.outputs, i.outputs)) return;
-	let o = ss(e, t, n, {
+	let o = cs(e, t, n, {
 		...a.node.task,
 		...i
 	});
 	if (o != null) return D(e.revision.content, o);
 }
-function es(e, t, n, i) {
+function ts(e, t, n, i) {
 	let a = e.node(t, n);
 	if (a?.kind != "task" || a.node.task != null || a.definition == null) return;
 	let o = a.node;
 	if (r(o.additionalInputs ?? [], i)) return;
-	let s = as(o.additionalInputs ?? [], i), c = new Set(a.definition.inputs.flatMap((e) => "handle" in e ? [e.handle] : []).concat(i.map((e) => e.handle))), l = Object.assign({}, o.inputs);
+	let s = os(o.additionalInputs ?? [], i), c = new Set(a.definition.inputs.flatMap((e) => "handle" in e ? [e.handle] : []).concat(i.map((e) => e.handle))), l = Object.assign({}, o.inputs);
 	s != null && Object.hasOwn(l, s[0]) && (l[s[1]] = l[s[0]], delete l[s[0]]);
 	for (let e of Object.keys(l)) c.has(e) || delete l[e];
 	let u = i.length == 0 ? void 0 : i;
@@ -11956,9 +11946,9 @@ function es(e, t, n, i) {
 		nodeId: n,
 		target: t,
 		value: u
-	}, ...os(o.inputs, l, t, n)]);
+	}, ...ss(o.inputs, l, t, n)]);
 }
-function ts(e, t, n, i) {
+function ns(e, t, n, i) {
 	let a = e.trigger(n);
 	if (a == null || a.kind != "webhook") return;
 	let o = {
@@ -11976,7 +11966,7 @@ function ts(e, t, n, i) {
 		value: s
 	}];
 }
-function ns(e, t, n) {
+function rs(e, t, n) {
 	let i = e.subflow(t);
 	if (i == null) return;
 	let a = {
@@ -11991,12 +11981,12 @@ function ns(e, t, n) {
 		subflowId: t
 	}];
 }
-function rs(e, t, n, r) {
+function is(e, t, n, r) {
 	return [{
 		kind: "graph.node.create",
 		node: {
 			concurrency: 1,
-			inputs: is(r),
+			inputs: as(r),
 			kind: "subflow",
 			subflowId: n
 		},
@@ -12004,17 +11994,17 @@ function rs(e, t, n, r) {
 		target: e
 	}];
 }
-function is(e) {
+function as(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e && Object.hasOwn(e, "value") ? [[e.handle, {
 		kind: "value",
 		value: e.value
 	}]] : []));
 }
-function as(e, t) {
+function os(e, t) {
 	let n = new Set(e.flatMap((e) => "handle" in e ? [e.handle] : [])), r = new Set(t.flatMap((e) => "handle" in e ? [e.handle] : [])), i = [...n].filter((e) => !r.has(e)), a = [...r].filter((e) => !n.has(e));
 	return i.length == 1 && a.length == 1 ? [i[0], a[0]] : void 0;
 }
-function os(e, t, n, i) {
+function ss(e, t, n, i) {
 	let a = /* @__PURE__ */ new Set([...Object.keys(e), ...Object.keys(t)]), o = [];
 	for (let s of a) r(e[s], t[s]) || o.push({
 		before: e[s],
@@ -12026,10 +12016,10 @@ function os(e, t, n, i) {
 	});
 	return o;
 }
-function ss(e, t, n, i) {
+function cs(e, t, n, i) {
 	let a = e.graph(t), o = a?.nodes[n];
 	if (a == null || o?.kind != "task" || o.task == null) return;
-	let s = as(o.task.inputs, i.inputs), c = as(o.task.outputs, i.outputs), l = new Set(i.inputs.flatMap((e) => "handle" in e ? [e.handle] : [])), u = new Set(i.outputs.flatMap((e) => "handle" in e ? [e.handle] : [])), d = [];
+	let s = os(o.task.inputs, i.inputs), c = os(o.task.outputs, i.outputs), l = new Set(i.inputs.flatMap((e) => "handle" in e ? [e.handle] : [])), u = new Set(i.outputs.flatMap((e) => "handle" in e ? [e.handle] : [])), d = [];
 	for (let [e, f] of Object.entries(a.nodes)) {
 		if (!("inputs" in f)) continue;
 		let a = { ...f.inputs };
@@ -12071,9 +12061,9 @@ function ss(e, t, n, i) {
 				value: a
 			});
 		}
-		d.push(...os(f.inputs, a, t, e));
+		d.push(...ss(f.inputs, a, t, e));
 	}
 	return d;
 }
 //#endregion
-export { Ct as $, go as A, pn as B, Co as C, Fa as D, _o as E, Aa as F, $t as G, rn as H, Ca as I, zt as J, qt as K, ba as L, vo as M, mo as N, lo as O, Q as P, Ht as Q, hn as R, ts as S, bo as T, tn as U, sn as V, Yt as W, Bt as X, Ut as Y, Vt as Z, ns as _, Lo as a, ut as at, Yo as b, Ko as c, dt as ct, $o as d, lt as dt, St as et, Jo as f, ot as ft, Ho as g, Go as h, y as ht, Bo as i, bt as it, ho as j, yo as k, qo as l, pt as lt, Wo as m, de as mt, Mo as n, _t as nt, zo as o, gt as ot, Uo as p, rt as pt, D as q, No as r, yt as rt, Vo as s, ht as st, Ro as t, xt as tt, Zo as u, mt as ut, Qo as v, So as w, Xo as x, es as y, mn as z };
+export { Ct as $, _o as A, fn as B, wo as C, Pa as D, vo as E, ka as F, $t as G, O as H, Sa as I, zt as J, qt as K, ya as L, yo as M, ho as N, lo as O, Q as P, Ht as Q, mn as R, ns as S, xo as T, tn as U, on as V, Yt as W, Bt as X, Ut as Y, Vt as Z, rs as _, Ro as a, ut as at, Xo as b, qo as c, dt as ct, es as d, lt as dt, St as et, Yo as f, ot as ft, Uo as g, Ko as h, y as ht, Vo as i, bt as it, go as j, bo as k, Jo as l, pt as lt, Go as m, de as mt, No as n, _t as nt, Bo as o, gt as ot, Wo as p, rt as pt, D as q, Po as r, yt as rt, Ho as s, ht as st, zo as t, xt as tt, Qo as u, mt as ut, $o as v, Co as w, Zo as x, ts as y, pn as z };