@oomol-lab/open-flow 0.1.0-beta.26 → 0.1.0-beta.28

package/dist/browser/{flowChanges-BqPtWEI9.js → flowChanges-Z49mslMz.js}

@@ -1,8 +1,8 @@
 import { a as e, i as t, l as n, t as r } from "./dist-Dz6Nglsd.js";
 import { i, t as a } from "./main-BDnNHhkU.js";
 import { $ as o, $n as s, $t as c, A as l, Bn as u, Ct as d, D as f, En as p, Et as m, F as h, Fn as g, G as _, Gn as v, H as y, Hn as b, I as x, J as ee, K as S, Kn as C, L as te, M as w, N as ne, O as T, Ot as re, P as ie, Pn as E, Q as ae, R as D, Sn as oe, St as se, U as O, Un as ce, V as le, Vn as k, W as ue, Wn as A, X as de, Xn as fe, Y as pe, Yn as me, Z as he, Zn as ge, a as _e, ar as ve, at as ye, c as be, cn as xe, ct as Se, d as Ce, dr as we, dt as Te, er as Ee, et as De, fn as Oe, ft as ke, gn as Ae, gt as je, hn as Me, ht as Ne, i as Pe, it as Fe, j as Ie, jt as Le, kt as Re, l as ze, ln as Be, lt as Ve, n as He, nr as Ue, nt as We, o as Ge, on as Ke, or as qe, ot as Je, q as Ye, qn as Xe, rn as Ze, rr as Qe, rt as $e, sn as et, sr as tt, st as nt, t as rt, tn as it, tr as at, tt as ot, u as st, un as ct, ur as lt, ut, v as dt, vt as ft, xn as pt, xt as mt, zn as ht } from "./lite-BuKZ8joP.js";
-import { a as gt, d as _t, f as vt, l as yt, m as bt, o as xt, u as St } from "./switch-CyZ96-UF.js";
-import { A as Ct, B as wt, C as Tt, D as Et, E as Dt, F as Ot, I as kt, L as At, M as jt, N as Mt, O as Nt, P as Pt, R as j, S as Ft, T as It, V as Lt, b as Rt, j as zt, k as Bt, n as Vt, v as Ht, y as Ut, z as Wt } from "./workbenchSelect-BUu7CjUA.js";
+import { _ as gt, a as _t, g as vt, o as yt, v as bt, x as xt, y as St } from "./switch-DuB8aovT.js";
+import { A as Ct, B as wt, C as Tt, D as Et, E as Dt, F as Ot, I as kt, L as At, M as jt, N as Mt, O as Nt, P as Pt, R as j, S as Ft, T as It, V as Lt, b as Rt, j as zt, k as Bt, n as Vt, v as Ht, y as Ut, z as Wt } from "./workbenchSelect-DX9IFmX-.js";
 import { t as Gt } from "./languages-C0zQ4GSo.js";
 import { a as Kt, o as qt, r as Jt } from "./dist-B_T-OpQp.js";
 import "./lib-C5Ipyfps.js";
@@ -30,6 +30,8 @@ var sn = et("ChevronRight", [["path", {
 	eventSourceNotFound: "event-source.not-found",
 	eventSourceConflict: "event-source.conflict",
 	flowInvalid: "flow.invalid",
+	flowRepairRequired: "flow.repair-required",
+	flowUpgradeRequired: "flow.upgrade-required",
 	flowNotFound: "flow.not-found",
 	flowBusy: "flow.busy",
 	flowConflict: "flow.conflict",
@@ -57,7 +59,7 @@ var sn = et("ChevronRight", [["path", {
 	variableLimitReached: "variable.limit-reached",
 	variableNotFound: "variable.not-found"
 };
-I.eventSourceInvalid, I.eventSourceIdentityUnavailable, I.eventSourceNotFound, I.eventSourceConflict, I.authenticationRequired, I.authorizationDenied, I.bindingUnresolved, I.connectorActionNotFound, I.connectorUnconfigured, I.connectorUnavailable, I.connectorConsoleUnconfigured, I.engineUnavailable, I.engineUnsupported, I.flowInvalid, I.flowNotFound, I.flowBusy, I.flowConflict, I.flowPresentationConflict, I.flowRevisionConflict, I.liveConflict, I.liveNotFound, I.pageInvalidCursor, I.publicationConflict, I.publicationNotFound, I.publicationUnsupported, I.publishOperationNotFound, I.routeNotFound, I.runConflict, I.runEventsExpired, I.runInvalid, I.runNotFound, I.runNotTerminal, I.runOverloaded, I.runWaitNotFound, I.triggerKeyInvalid, I.triggerKeyNotFound, I.triggerNotFound, I.variableInvalid, I.variableLimitReached, I.variableNotFound;
+I.eventSourceInvalid, I.eventSourceIdentityUnavailable, I.eventSourceNotFound, I.eventSourceConflict, I.authenticationRequired, I.authorizationDenied, I.bindingUnresolved, I.connectorActionNotFound, I.connectorUnconfigured, I.connectorUnavailable, I.connectorConsoleUnconfigured, I.engineUnavailable, I.engineUnsupported, I.flowInvalid, I.flowRepairRequired, I.flowUpgradeRequired, I.flowNotFound, I.flowBusy, I.flowConflict, I.flowPresentationConflict, I.flowRevisionConflict, I.liveConflict, I.liveNotFound, I.pageInvalidCursor, I.publicationConflict, I.publicationNotFound, I.publicationUnsupported, I.publishOperationNotFound, I.routeNotFound, I.runConflict, I.runEventsExpired, I.runInvalid, I.runNotFound, I.runNotTerminal, I.runOverloaded, I.runWaitNotFound, I.triggerKeyInvalid, I.triggerKeyNotFound, I.triggerNotFound, I.variableInvalid, I.variableLimitReached, I.variableNotFound;
 var cn = class extends Error {
 	constructor(e, t, n) {
 		super(n), this.code = t, this.name = "ApiError", this.status = e;
@@ -140,12 +142,19 @@ function vn(e) {
 function yn(e) {
 	let t = R(e), n = vn(t), r = {
 		configSchema: gn(t.configSchema),
-		definitionVersion: hn(t.definitionVersion),
+		definitionVersion: t.definitionVersion === 2 ? 2 : L(),
 		description: n.description,
 		displayName: n.displayName,
 		key: n.key,
 		name: n.name,
-		payloadSchema: gn(t.payloadSchema),
+		outputs: (Array.isArray(t.outputs) ? t.outputs : L()).map((e) => {
+			let t = R(e);
+			return Object.assign({
+				handle: z(t.handle),
+				jsonSchema: gn(t.jsonSchema),
+				nullable: typeof t.nullable == "boolean" ? t.nullable : L()
+			}, t.description == null ? {} : { description: z(t.description) });
+		}),
 		provider: n.provider
 	};
 	if (n.type == "poll") return {
@@ -748,7 +757,7 @@ Ot({
 }).strict(), Ot({
 	kind: Mt("open-flow-project-revision"),
 	version: Mt(1),
-	modelVersion: Mt(1),
+	modelVersion: Wt([Mt(1), Mt(2)]),
 	modules: kt(j(), Ot({
 		name: j(),
 		source: j(),
@@ -789,12 +798,7 @@ function pr(e) {
 }
 function mr(e) {
 	let t = R(e);
-	return B(t, [
-		"revision",
-		"updatedAt",
-		"value",
-		"version"
-	]), t.version != 1 || hn(t.revision) < 1 ? L() : {
+	return t.version != 1 || hn(t.revision) < 1 ? L() : {
 		revision: hn(t.revision),
 		updatedAt: z(t.updatedAt),
 		value: Object.fromEntries(Object.entries(R(t.value)).map(([e, t]) => [e, gn(t)])),
@@ -1351,13 +1355,7 @@ var Nr = class {
 	}
 	async getEditor(e) {
 		let t = R(await this.request(`/v1/flows/${V(e)}/editor`));
-		if (B(t, [
-			"flow",
-			"draft",
-			"live",
-			"presentation",
-			"version"
-		]), t.version != 1) return L();
+		if (t.version != 1) return L();
 		let n = {
 			flow: $n(t.flow),
 			draft: pr(t.draft),
@@ -1455,10 +1453,20 @@ var Nr = class {
 			method: "POST"
 		}));
 	}
+	async repairDraft(e, t, n = Mr("repair")) {
+		return hr(await this.request(`/v1/flows/${V(e)}/draft/repair`, {
+			body: JSON.stringify({
+				expectedRevisionId: t,
+				version: 1
+			}),
+			headers: { "idempotency-key": n },
+			method: "POST"
+		}));
+	}
 	async checkFlow(e, t) {
 		return Bn(await this.request(`/v1/flows/${V(e)}/revisions/${V(t)}/check`, {
 			body: JSON.stringify({
-				engineContract: "open-flow-engine/v4",
+				engineContract: "open-flow-engine/v5",
 				version: 1
 			}),
 			method: "POST"
@@ -1476,10 +1484,10 @@ var Nr = class {
 	async createDraftRun(e, t, n) {
 		let r = Cr(await this.request(`/v1/flows/${V(e)}/revisions/${V(t)}/runs`, {
 			body: JSON.stringify({
-				engineContract: "open-flow-engine/v4",
+				engineContract: "open-flow-engine/v5",
 				inputs: n.inputs ?? {},
 				trigger: n.trigger,
-				version: 1
+				version: 2
 			}),
 			headers: { "idempotency-key": n.idempotencyKey ?? Mr("run") },
 			method: "POST"
@@ -1492,7 +1500,7 @@ var Nr = class {
 				inputs: t.inputs ?? {},
 				trigger: t.trigger,
 				publicationId: e,
-				version: 1
+				version: 2
 			}),
 			headers: { "idempotency-key": t.idempotencyKey ?? Mr("run") },
 			method: "POST"
@@ -1512,7 +1520,7 @@ var Nr = class {
 	async publishFlow(e, t, n, r = {}) {
 		return rr(await this.request(`/v1/flows/${V(e)}/revisions/${V(t)}/publications`, {
 			body: JSON.stringify({
-				engineContract: "open-flow-engine/v4",
+				engineContract: "open-flow-engine/v5",
 				expectedLivePublicationId: n,
 				version: 1
 			}),
@@ -1679,6 +1687,8 @@ var Nr = class {
 	[I.engineUnavailable]: "notice.error.engineUnavailable",
 	[I.engineUnsupported]: "notice.error.engineUnsupported",
 	[I.flowInvalid]: "notice.error.flowInvalid",
+	[I.flowRepairRequired]: "notice.error.flowInvalid",
+	[I.flowUpgradeRequired]: "notice.error.flowInvalid",
 	[I.flowNotFound]: "notice.error.flowNotFound",
 	[I.flowBusy]: "notice.error.flowBusy",
 	[I.flowConflict]: "notice.error.flowConflict",
@@ -2003,7 +2013,7 @@ function Br({ value: e, onChange: t, disabled: n = !1, allowedEvents: r }) {
 						children: a(`eventSources.eventGroups.${r}`)
 					}), g.filter((e) => e.group == r).map((r) => /* @__PURE__ */ N(Lt, {
 						className: "flex cursor-pointer items-start gap-2 rounded-md px-2 py-2 font-normal hover:bg-muted",
-						children: [/* @__PURE__ */ M(bt, {
+						children: [/* @__PURE__ */ M(xt, {
 							className: "mt-0.5",
 							checked: e.includes(r.id),
 							disabled: n || !e.includes(r.id) && e.length >= 200,
@@ -2077,7 +2087,7 @@ function Br({ value: e, onChange: t, disabled: n = !1, allowedEvents: r }) {
 //#endregion
 //#region src/workbench/browser/runtime/eventSources.tsx
 function Vr(e) {
-	let t = nn(() => xt(e.language), [e.language]);
+	let t = nn(() => yt(e.language), [e.language]);
 	return /* @__PURE__ */ M(a, {
 		i18n: t,
 		children: /* @__PURE__ */ M(Hr, { ...e })
@@ -2556,7 +2566,7 @@ function Ur({ source: e, existingNames: t = [], fixedTeamId: n, onPendingChange:
 					children: l("eventSources.resourceManagement")
 				}), /* @__PURE__ */ N(Lt, {
 					className: "mt-3 flex items-start gap-2 font-normal",
-					children: [/* @__PURE__ */ M(bt, {
+					children: [/* @__PURE__ */ M(xt, {
 						checked: le,
 						onCheckedChange: (e) => ue(e === !0),
 						disabled: A
@@ -2949,7 +2959,7 @@ var mi = {
 		};
 	}, [S.events, s]);
 	let ne = s.useState("hoverEnabled"), T = s.useState("disabled");
-	_t(ee, {
+	bt(ee, {
 		enabled: ne && !T && !w && y.type !== "menubar",
 		closeDelay: C
 	});
@@ -3724,9 +3734,9 @@ var Bi = 2, Vi = d(function(e, t) {
 		fe,
 		_
 	]);
-	let pe = O && w.context.hasSubmenuOpen, me = St(S, {
+	let pe = O && w.context.hasSubmenuOpen, me = gt(S, {
 		enabled: (l ?? pe) && !le && w.type !== "context-menu" && (!O || pe && !se),
-		handleClose: yt({ blockPointerEvents: !O }),
+		handleClose: vt({ blockPointerEvents: !O }),
 		mouseOnly: !0,
 		move: !1,
 		restMs: w.type === void 0 ? u : void 0,
@@ -3741,7 +3751,7 @@ var Bi = 2, Vi = d(function(e, t) {
 		toggle: !0,
 		ignoreMouse: !1,
 		stickIfOpen: w.type === void 0 && he
-	}), ye = vt(S, { enabled: !le && pe }), be = zi({
+	}), ye = St(S, { enabled: !le && pe }), be = zi({
 		open: C,
 		enabled: O,
 		mouseDownAction: "open"
@@ -3771,7 +3781,7 @@ var Bi = 2, Vi = d(function(e, t) {
 		be,
 		h,
 		k
-	], { preFocusGuardRef: ke, handlePreFocusGuardFocus: je, handleFocusTargetFocus: Me } = gt(_, te), Ne = v("button", e, {
+	], { preFocusGuardRef: ke, handlePreFocusGuardFocus: je, handleFocusTargetFocus: Me } = _t(_, te), Ne = v("button", e, {
 		enabled: !O,
 		stateAttributesMapping: y,
 		state: Ce,
@@ -3874,9 +3884,9 @@ var Gi = /*#__PURE__*/ P.forwardRef(function(e, t) {
 		nativeButton: o,
 		itemMetadata: ie,
 		nodeId: m?.context.nodeId
-	}), ce = h.useState("hoverEnabled"), le = ne.useState("allowMouseEnter"), k = St(y, {
+	}), ce = h.useState("hoverEnabled"), le = ne.useState("allowMouseEnter"), k = gt(y, {
 		enabled: ce && s && !D,
-		handleClose: yt({ blockPointerEvents: !0 }),
+		handleClose: vt({ blockPointerEvents: !0 }),
 		mouseOnly: !0,
 		move: !0,
 		restMs: c,
@@ -4515,6 +4525,13 @@ function Ma(e, t, n, r) {
 		nodeId: n,
 		target: t,
 		value: r.name
+	}), i.maxExecutions != r.maxExecutions && a.push({
+		before: i.maxExecutions,
+		field: "maxExecutions",
+		kind: "graph.node.field.set",
+		nodeId: n,
+		target: t,
+		value: r.maxExecutions
 	}), i.timeoutMs != r.timeoutMs && a.push({
 		before: i.timeoutMs,
 		field: "timeoutMs",
@@ -4852,7 +4869,70 @@ var oo = class {
 	invalidate() {
 		this.#e = Symbol();
 	}
-}, so = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, co = [
+};
+//#endregion
+//#region src/base/common/json.ts
+function so(e) {
+	if (e === null || typeof e == "boolean" || typeof e == "string") return !0;
+	if (typeof e == "number") return Number.isFinite(e);
+	if (typeof e != "object") return !1;
+	let t = /* @__PURE__ */ new Set(), n = [], r = e;
+	traversal: for (;;) {
+		let e, i;
+		if (Array.isArray(r)) {
+			if (i = r.length, e = Reflect.ownKeys(r), e.length != i + 1) return !1;
+		} else {
+			let t = Reflect.getPrototypeOf(r);
+			if (t != Object.prototype && t != null) return !1;
+			e = Reflect.ownKeys(r), i = void 0;
+		}
+		t.add(r);
+		let a = 0;
+		for (;;) {
+			if (a >= e.length) {
+				t.delete(r);
+				let o = n.pop();
+				if (o === void 0) return !0;
+				r = o.value, e = o.keys, i = o.arrayLength, a = o.index;
+				continue;
+			}
+			let o = e[a++];
+			if (i !== void 0) {
+				if (o == "length") continue;
+				if (typeof o != "string") return !1;
+				let e = Number(o);
+				if (!Number.isSafeInteger(e) || e < 0 || e >= i || String(e) != o) return !1;
+			} else if (typeof o != "string") return !1;
+			let s = Reflect.getOwnPropertyDescriptor(r, o);
+			if (s?.enumerable != 1 || !Object.hasOwn(s, "value")) return !1;
+			let c = s.value;
+			if (c !== null && typeof c != "boolean" && typeof c != "string") {
+				if (typeof c == "number") {
+					if (!Number.isFinite(c)) return !1;
+					continue;
+				}
+				if (typeof c != "object" || t.has(c)) return !1;
+				n.push({
+					value: r,
+					keys: e,
+					arrayLength: i,
+					index: a
+				}), r = c;
+				continue traversal;
+			}
+		}
+	}
+}
+function co(e) {
+	try {
+		return typeof e == "object" && !!e && !Array.isArray(e) && so(e);
+	} catch {
+		return !1;
+	}
+}
+//#endregion
+//#region ../../node_modules/.bun/@cfworker+json-schema@4.1.1/node_modules/@cfworker/json-schema/dist/esm/format.js
+var lo = /^(\d\d\d\d)-(\d\d)-(\d\d)$/, uo = [
 	0,
 	31,
 	28,
@@ -4866,60 +4946,60 @@ var oo = class {
 	31,
 	30,
 	31
-], lo = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i, uo = /^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i, fo = /^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i, po = /^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i, mo = /^(?:(?:https?|ftp):\/\/)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)(?:\.(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)*(?:\.(?:[a-z\u{00a1}-\u{ffff}]{2,})))(?::\d{2,5})?(?:\/[^\s]*)?$/iu, ho = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i, go = /^(?:\/(?:[^~/]|~0|~1)*)*$/, _o = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i, vo = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/, yo = (e) => {
+], fo = /^(\d\d):(\d\d):(\d\d)(\.\d+)?(z|[+-]\d\d(?::?\d\d)?)?$/i, po = /^(?=.{1,253}\.?$)[a-z0-9](?:[a-z0-9-]{0,61}[a-z0-9])?(?:\.[a-z0-9](?:[-0-9a-z]{0,61}[0-9a-z])?)*\.?$/i, mo = /^(?:[a-z][a-z0-9+\-.]*:)?(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'"()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'"()*+,;=:@]|%[0-9a-f]{2})*)*)?(?:\?(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'"()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i, ho = /^(?:(?:[^\x00-\x20"'<>%\\^`{|}]|%[0-9a-f]{2})|\{[+#./;?&=,!@|]?(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?(?:,(?:[a-z0-9_]|%[0-9a-f]{2})+(?::[1-9][0-9]{0,3}|\*)?)*\})*$/i, go = /^(?:(?:https?|ftp):\/\/)(?:\S+(?::\S*)?@)?(?:(?!10(?:\.\d{1,3}){3})(?!127(?:\.\d{1,3}){3})(?!169\.254(?:\.\d{1,3}){2})(?!192\.168(?:\.\d{1,3}){2})(?!172\.(?:1[6-9]|2\d|3[0-1])(?:\.\d{1,3}){2})(?:[1-9]\d?|1\d\d|2[01]\d|22[0-3])(?:\.(?:1?\d{1,2}|2[0-4]\d|25[0-5])){2}(?:\.(?:[1-9]\d?|1\d\d|2[0-4]\d|25[0-4]))|(?:(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)(?:\.(?:[a-z\u{00a1}-\u{ffff}0-9]+-?)*[a-z\u{00a1}-\u{ffff}0-9]+)*(?:\.(?:[a-z\u{00a1}-\u{ffff}]{2,})))(?::\d{2,5})?(?:\/[^\s]*)?$/iu, _o = /^(?:urn:uuid:)?[0-9a-f]{8}-(?:[0-9a-f]{4}-){3}[0-9a-f]{12}$/i, vo = /^(?:\/(?:[^~/]|~0|~1)*)*$/, yo = /^#(?:\/(?:[a-z0-9_\-.!$&'()*+,;:=@]|%[0-9a-f]{2}|~0|~1)*)*$/i, bo = /^(?:0|[1-9][0-9]*)(?:#|(?:\/(?:[^~/]|~0|~1)*)*)$/, xo = (e) => {
 	if (e[0] === "\"") return !1;
 	let [t, n, ...r] = e.split("@");
 	return !t || !n || r.length !== 0 || t.length > 64 || n.length > 253 || t[0] === "." || t.endsWith(".") || t.includes("..") || !/^[a-z0-9.-]+$/i.test(n) || !/^[a-z0-9.!#$%&'*+/=?^_`{|}~-]+$/i.test(t) ? !1 : n.split(".").every((e) => /^[a-z0-9]([a-z0-9-]{0,61}[a-z0-9])?$/i.test(e));
-}, bo = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, xo = /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))$/i, So = (e) => e.length > 1 && e.length < 80 && (/^P\d+([.,]\d+)?W$/.test(e) || /^P[\dYMDTHS]*(\d[.,]\d+)?[YMDHS]$/.test(e) && /^P([.,\d]+Y)?([.,\d]+M)?([.,\d]+D)?(T([.,\d]+H)?([.,\d]+M)?([.,\d]+S)?)?$/.test(e));
-function Co(e) {
+}, So = /^(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)$/, Co = /^((([0-9a-f]{1,4}:){7}([0-9a-f]{1,4}|:))|(([0-9a-f]{1,4}:){6}(:[0-9a-f]{1,4}|((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){5}(((:[0-9a-f]{1,4}){1,2})|:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3})|:))|(([0-9a-f]{1,4}:){4}(((:[0-9a-f]{1,4}){1,3})|((:[0-9a-f]{1,4})?:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){3}(((:[0-9a-f]{1,4}){1,4})|((:[0-9a-f]{1,4}){0,2}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){2}(((:[0-9a-f]{1,4}){1,5})|((:[0-9a-f]{1,4}){0,3}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(([0-9a-f]{1,4}:){1}(((:[0-9a-f]{1,4}){1,6})|((:[0-9a-f]{1,4}){0,4}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:))|(:(((:[0-9a-f]{1,4}){1,7})|((:[0-9a-f]{1,4}){0,5}:((25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)(\.(25[0-5]|2[0-4]\d|1\d\d|[1-9]?\d)){3}))|:)))$/i, wo = (e) => e.length > 1 && e.length < 80 && (/^P\d+([.,]\d+)?W$/.test(e) || /^P[\dYMDTHS]*(\d[.,]\d+)?[YMDHS]$/.test(e) && /^P([.,\d]+Y)?([.,\d]+M)?([.,\d]+D)?(T([.,\d]+H)?([.,\d]+M)?([.,\d]+S)?)?$/.test(e));
+function To(e) {
 	return e.test.bind(e);
 }
-var wo = {
-	date: Eo,
-	time: Do.bind(void 0, !1),
-	"date-time": ko,
-	duration: So,
-	uri: Mo,
-	"uri-reference": Co(fo),
-	"uri-template": Co(po),
-	url: Co(mo),
-	email: yo,
-	hostname: Co(uo),
-	ipv4: Co(bo),
-	ipv6: Co(xo),
-	regex: Po,
-	uuid: Co(ho),
-	"json-pointer": Co(go),
-	"json-pointer-uri-fragment": Co(_o),
-	"relative-json-pointer": Co(vo)
+var Eo = {
+	date: Oo,
+	time: ko.bind(void 0, !1),
+	"date-time": jo,
+	duration: wo,
+	uri: Po,
+	"uri-reference": To(mo),
+	"uri-template": To(ho),
+	url: To(go),
+	email: xo,
+	hostname: To(po),
+	ipv4: To(So),
+	ipv6: To(Co),
+	regex: Io,
+	uuid: To(_o),
+	"json-pointer": To(vo),
+	"json-pointer-uri-fragment": To(yo),
+	"relative-json-pointer": To(bo)
 };
-function To(e) {
+function Do(e) {
 	return e % 4 == 0 && (e % 100 != 0 || e % 400 == 0);
 }
-function Eo(e) {
-	let t = e.match(so);
+function Oo(e) {
+	let t = e.match(lo);
 	if (!t) return !1;
 	let n = +t[1], r = +t[2], i = +t[3];
-	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && To(n) ? 29 : co[r]);
+	return r >= 1 && r <= 12 && i >= 1 && i <= (r == 2 && Do(n) ? 29 : uo[r]);
 }
-function Do(e, t) {
-	let n = t.match(lo);
+function ko(e, t) {
+	let n = t.match(fo);
 	if (!n) return !1;
 	let r = +n[1], i = +n[2], a = +n[3], o = !!n[5];
 	return (r <= 23 && i <= 59 && a <= 59 || r == 23 && i == 59 && a == 60) && (!e || o);
 }
-var Oo = /t|\s/i;
-function ko(e) {
-	let t = e.split(Oo);
-	return t.length == 2 && Eo(t[0]) && Do(!0, t[1]);
-}
-var Ao = /\/|:/, jo = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
-function Mo(e) {
-	return Ao.test(e) && jo.test(e);
+var Ao = /t|\s/i;
+function jo(e) {
+	let t = e.split(Ao);
+	return t.length == 2 && Oo(t[0]) && ko(!0, t[1]);
 }
-var No = /[^\\]\\Z/;
+var Mo = /\/|:/, No = /^(?:[a-z][a-z0-9+\-.]*:)(?:\/?\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:]|%[0-9a-f]{2})*@)?(?:\[(?:(?:(?:(?:[0-9a-f]{1,4}:){6}|::(?:[0-9a-f]{1,4}:){5}|(?:[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){4}|(?:(?:[0-9a-f]{1,4}:){0,1}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){3}|(?:(?:[0-9a-f]{1,4}:){0,2}[0-9a-f]{1,4})?::(?:[0-9a-f]{1,4}:){2}|(?:(?:[0-9a-f]{1,4}:){0,3}[0-9a-f]{1,4})?::[0-9a-f]{1,4}:|(?:(?:[0-9a-f]{1,4}:){0,4}[0-9a-f]{1,4})?::)(?:[0-9a-f]{1,4}:[0-9a-f]{1,4}|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?))|(?:(?:[0-9a-f]{1,4}:){0,5}[0-9a-f]{1,4})?::[0-9a-f]{1,4}|(?:(?:[0-9a-f]{1,4}:){0,6}[0-9a-f]{1,4})?::)|[Vv][0-9a-f]+\.[a-z0-9\-._~!$&'()*+,;=:]+)\]|(?:(?:25[0-5]|2[0-4]\d|[01]?\d\d?)\.){3}(?:25[0-5]|2[0-4]\d|[01]?\d\d?)|(?:[a-z0-9\-._~!$&'()*+,;=]|%[0-9a-f]{2})*)(?::\d*)?(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*|\/(?:(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)?|(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})+(?:\/(?:[a-z0-9\-._~!$&'()*+,;=:@]|%[0-9a-f]{2})*)*)(?:\?(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?(?:#(?:[a-z0-9\-._~!$&'()*+,;=:@/?]|%[0-9a-f]{2})*)?$/i;
 function Po(e) {
-	if (No.test(e)) return !1;
+	return Mo.test(e) && No.test(e);
+}
+var Fo = /[^\\]\\Z/;
+function Io(e) {
+	if (Fo.test(e)) return !1;
 	try {
 		return new RegExp(e, "u"), !0;
 	} catch {
@@ -4928,45 +5008,45 @@ function Po(e) {
 }
 //#endregion
 //#region src/json-schema-subset/utils.ts
-var Fo = 0;
-function Io() {
-	let e = Fo;
-	return Fo += 1, e;
+var Lo = 0;
+function Ro() {
+	let e = Lo;
+	return Lo += 1, e;
 }
-function Lo(e) {
+function zo(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) Lo(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) zo(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function Ro(e, t) {
+function Bo(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function zo(e) {
+function Vo(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = zo(r);
+		for (let [n, r] of e.entries()) t[n] = Vo(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = zo(e[n]);
+		for (let n in e) t[n] = Vo(e[n]);
 		return t;
 	}
 }
-function Bo(e, t) {
+function Ho(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 (!Bo(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!Ho(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !Bo(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !Ho(e[n], t[n])) return !1;
 		for (let n in t) if (!(n in e)) return !1;
 	}
 	return !0;
@@ -4979,48 +5059,48 @@ var H = Object.freeze({
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), U = Jo(H.Equals), W = Jo(H.Containing), G = Jo(H.ContainedBy), K = Jo(H.Rejection), q = Jo(H.Intersection), Vo = Lo([
+}), U = Xo(H.Equals), W = Xo(H.Containing), G = Xo(H.ContainedBy), K = Xo(H.Rejection), q = Xo(H.Intersection), Uo = zo([
 	[H.Equals, U],
 	[H.Containing, W],
 	[H.ContainedBy, G],
 	[H.Rejection, K],
 	[H.Intersection, q]
-]), Ho = (() => {
+]), Wo = (() => {
 	let e = 0;
-	for (let [t, n] of Vo) e |= n;
+	for (let [t, n] of Uo) e |= n;
 	return e;
 })();
-function Uo(e) {
+function Go(e) {
 	return !!(e & U);
 }
-function Wo(e) {
+function Ko(e) {
 	return !!(e & W);
 }
-function Go(e) {
+function qo(e) {
 	return !!(e & G);
 }
-function Ko(e) {
+function Jo(e) {
 	return !!(e & K);
 }
-function qo(e) {
+function Yo(e) {
 	return !!(e & q);
 }
-function Jo(e) {
+function Xo(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function Yo(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : Xo(t, r, e), n += 1, t) };
+function Zo(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : Qo(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function Xo(e, t, n) {
+function Qo(e, t, n) {
 	let r = 0;
-	for (let [i, a] of Vo) if (a & e) {
-		for (let [e, a] of Vo) if (a & t && (r |= n(i, e), r === Ho)) return r;
+	for (let [i, a] of Uo) if (a & e) {
+		for (let [e, a] of Uo) if (a & t && (r |= n(i, e), r === Wo)) return r;
 	}
 	return r;
 }
@@ -5034,59 +5114,59 @@ var J = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function Zo(e, t) {
+function $o(e, t) {
 	switch (e) {
 		case J.Save: return t[0];
-		case J.OneOf: return $o(t);
+		case J.OneOf: return ts(t);
 		case J.AllOf:
-		case J.AnyOf: return es(e, t);
+		case J.AnyOf: return ns(e, t);
 		case J.Not:
-		case J.Swap: return ts(e, t[0]);
+		case J.Swap: return rs(e, t[0]);
 	}
 }
-function Qo(e) {
-	return ts(J.Swap, e);
+function es(e) {
+	return rs(J.Swap, e);
 }
-function $o(e) {
+function ts(e) {
 	if (e.length === 1) return e[0];
-	let t = es(J.AnyOf, e), n = [];
+	let t = ns(J.AnyOf, e), n = [];
 	for (let t = 0; t < e.length; ++t) for (let r = t + 1; r < e.length; ++r) {
-		let i = e[t], a = e[r], o = es(J.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = ns(J.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = es(J.AnyOf, n), i = ts(J.Not, r);
-	return es(J.AllOf, [t, i]);
+	let r = ns(J.AnyOf, n), i = rs(J.Not, r);
+	return ns(J.AllOf, [t, i]);
 }
-function es(e, t) {
+function ns(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
 		case J.AllOf:
-			n = Yo(ns);
+			n = Zo(is);
 			break;
 		case J.AnyOf:
-			n = Yo(rs);
+			n = Zo(as);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function ts(e, t) {
+function rs(e, t) {
 	let n, r = 0;
 	switch (e) {
 		case J.Not:
-			n = is;
+			n = os;
 			break;
 		case J.Swap:
-			n = as;
+			n = ss;
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of Vo) i & t && (r |= n(e));
+	for (let [e, i] of Uo) i & t && (r |= n(e));
 	return r;
 }
-function ns(e, t) {
+function is(e, t) {
 	let n = 0;
 	switch (e) {
 		case H.Equals:
@@ -5175,7 +5255,7 @@ function ns(e, t) {
 	}
 	return n;
 }
-function rs(e, t) {
+function as(e, t) {
 	let n = 0;
 	switch (e) {
 		case H.Equals:
@@ -5264,7 +5344,7 @@ function rs(e, t) {
 	}
 	return n;
 }
-function is(e) {
+function os(e) {
 	let t = 0;
 	switch (e) {
 		case H.Equals:
@@ -5283,7 +5363,7 @@ function is(e) {
 	}
 	return t;
 }
-function as(e) {
+function ss(e) {
 	let t = 0;
 	switch (e) {
 		case H.Equals:
@@ -5304,13 +5384,13 @@ function as(e) {
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var os = Object.freeze({
+var cs = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), ss = (e) => (t, n) => {
+}), ls = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
@@ -5338,7 +5418,7 @@ var os = Object.freeze({
 		let n = U, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== os.Leaf) {
+			if (a.kind !== cs.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -5353,7 +5433,7 @@ var os = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== os.Leaf) {
+			if (c.kind !== cs.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -5379,16 +5459,16 @@ var os = Object.freeze({
 	function s(e, t) {
 		let n = J.Save, r;
 		switch (e.kind) {
-			case os.Not:
+			case cs.Not:
 				n = J.Not, r = [e.expression];
 				break;
-			case os.AllOf:
+			case cs.AllOf:
 				n = J.AllOf, r = [...e.expressions];
 				break;
-			case os.AnyOf:
+			case cs.AnyOf:
 				n = J.AnyOf, r = [...e.expressions];
 				break;
-			case os.OneOf:
+			case cs.OneOf:
 				n = J.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
@@ -5401,8 +5481,8 @@ var os = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = Zo(t.operator, t.results);
-		if (r === 0 && (r = G), t.willSwap && (r = Qo(r)), n) {
+		let t = e.calculation, n = e.parent, r = $o(t.operator, t.results);
+		if (r === 0 && (r = G), t.willSwap && (r = es(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);
 		}
@@ -5410,79 +5490,79 @@ var os = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, cs = class extends Error {
+}, us = class extends Error {
 	constructor(e = []) {
-		super(ds(e)), this.name = "SchemaError", this.items = e;
+		super(ps(e)), this.name = "SchemaError", this.items = e;
 	}
-}, ls = Object.freeze({
+}, ds = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function us(e) {
+function fs(e) {
 	switch (e.kind) {
-		case ls.Compiled: {
+		case ds.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case ls.External: return String(e.error);
+		case ds.External: return String(e.error);
 	}
 }
-function ds(e) {
+function ps(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return us(e[0]);
-		default: return `${us(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return fs(e[0]);
+		default: return `${fs(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var fs = /* @__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 ps(e) {
-	return fs.has(e);
+var ms = /* @__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 hs(e) {
+	return ms.has(e);
 }
-function ms(e) {
-	for (let t in e) if (ps(t)) return !1;
+function gs(e) {
+	for (let t in e) if (hs(t)) return !1;
 	return !0;
 }
-function hs(e, ...t) {
+function _s(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function gs(e) {
+function vs(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function _s({ path: e, errors: t }, n, ...r) {
-	t.push(vs(e, r, n));
+function ys({ path: e, errors: t }, n, ...r) {
+	t.push(bs(e, r, n));
 }
 function Y({ path: e, warns: t }, n, ...r) {
-	t.push(vs(e, r, n));
+	t.push(bs(e, r, n));
 }
-function vs(e, t, n) {
+function bs(e, t, n) {
 	return {
-		kind: ls.Compiled,
+		kind: ds.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function ys(e) {
+function xs(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] : bs(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : Ss(n) && delete e[t]);
 	}
 	return e;
 }
-function bs(e) {
+function Ss(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var xs = Symbol("compiledId"), Ss = Symbol("compiledKind"), Cs = Symbol("compiledPath"), ws = Symbol("validatorLoader"), X = Object.freeze({
+var Cs = Symbol("compiledId"), ws = Symbol("compiledKind"), Ts = Symbol("compiledPath"), Es = Symbol("validatorLoader"), X = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -5495,62 +5575,62 @@ var xs = Symbol("compiledId"), Ss = Symbol("compiledKind"), Cs = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), Ts = Lo(Ps(X.Any, Io(), {}, () => () => !0)), Es = Lo(Ps(X.Never, Io(), {
+}), Ds = zo(Is(X.Any, Ro(), {}, () => () => !0)), Os = zo(Is(X.Never, Ro(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function Ds(e) {
-	return typeof e != "object" || !e ? !1 : xs in e;
+function ks(e) {
+	return typeof e != "object" || !e ? !1 : Cs in e;
 }
-function Os(e) {
-	return typeof e != "object" || !e ? !1 : xs in e && Ss in e;
+function As(e) {
+	return typeof e != "object" || !e ? !1 : Cs in e && ws in e;
 }
 function Z(e) {
-	return Os(e) ? e[Ss] : X.Extends;
+	return As(e) ? e[ws] : X.Extends;
 }
-function ks(e) {
-	return Os(e) || Ds(e) ? e[xs] : e.id;
+function js(e) {
+	return As(e) || ks(e) ? e[Cs] : e.id;
 }
-function As(e) {
-	return Os(e) ? e[Cs] : void 0;
+function Ms(e) {
+	return As(e) ? e[Ts] : void 0;
 }
-function js(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, xs, {
-		value: Io(),
+function Ns(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, Cs, {
+		value: Ro(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
-function Ms(e, t, n, r = []) {
-	return Ps(e, Io(), t, n && (() => n.compile(t)), r);
+function Ps(e, t, n, r = []) {
+	return Is(e, Ro(), t, n && (() => n.compile(t)), r);
 }
-function Ns(e) {
-	return Ps(X.Never, Io(), { ...e }, e[ws], e[Cs]);
+function Fs(e) {
+	return Is(X.Never, Ro(), { ...e }, e[Es], e[Ts]);
 }
-function Ps(e, t, n, r, i = []) {
+function Is(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[Ss]: {
+		[ws]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[xs]: {
+		[Cs]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Cs]: {
+		[Ts]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[ws]: {
+		[Es]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -5567,16 +5647,16 @@ function Ps(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function Fs(e, t) {
-	let n = Is(e, t), r = Ls(e, "maxItems", t), i = Ls(e, "minItems", t), a = Rs(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = zs(e, t) : t.additionalItems && Y(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function Ls(e, t) {
+	let n = Rs(e, t), r = zs(e, "maxItems", t), i = zs(e, "minItems", t), a = Bs(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = Vs(e, t) : t.additionalItems && Y(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
 	let c = !1, l = !1;
 	if (Array.isArray(n)) {
-		r !== void 0 && r <= n.length && (n = n.splice(r), s = Bs(s, e.delegate));
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = Hs(s, e.delegate));
 		let t = n.findIndex((e) => Z(e) === X.Never);
-		t !== -1 && (n = n.splice(t), s = Bs(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (Y(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && Z(s) === X.Never && (c = !0);
+		t !== -1 && (n = n.splice(t), s = Hs(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (Y(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && Z(s) === X.Never && (c = !0);
 	} else Z(n) === X.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || Y(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Ms(c ? X.Never : X.Array, ys({
+	return r !== void 0 && i !== void 0 && r < i && (l || Y(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Ps(c ? X.Never : X.Array, xs({
 		type: "array",
 		items: n,
 		contains: a,
@@ -5586,12 +5666,12 @@ function Fs(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function Is(e, { items: t }) {
-	if (!t) return Ms(X.Any, {}, e.delegate, e.path);
+function Rs(e, { items: t }) {
+	if (!t) return Ps(X.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = bc(hs(e, "items", i), gs(a));
+			let t = Sc(_s(e, "items", i), vs(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -5600,9 +5680,9 @@ function Is(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return bc(hs(e, "items"), gs(t));
+	return Sc(_s(e, "items"), vs(t));
 }
-function Ls(e, t, n) {
+function zs(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -5616,35 +5696,35 @@ function Ls(e, t, n) {
 		return r;
 	}
 }
-function Rs(e, { contains: t }) {
-	return t ? bc(hs(e, "contains"), gs(t)) : Ms(X.Any, {}, e.delegate, e.path);
+function Bs(e, { contains: t }) {
+	return t ? Sc(_s(e, "contains"), vs(t)) : Ps(X.Any, {}, e.delegate, e.path);
 }
-function zs(e, { additionalItems: t }) {
+function Vs(e, { additionalItems: t }) {
 	switch (typeof t) {
-		case "boolean": return t ? Ms(X.Any, {}, e.delegate, e.path) : !1;
-		case "object": return bc(hs(e, "additionalItems"), t);
-		default: return Ms(X.Any, {}, e.delegate, e.path);
+		case "boolean": return t ? Ps(X.Any, {}, e.delegate, e.path) : !1;
+		case "object": return Sc(_s(e, "additionalItems"), t);
+		default: return Ps(X.Any, {}, e.delegate, e.path);
 	}
 }
-function Bs(e, t) {
-	return e === void 0 ? Ms(X.Never, {
+function Hs(e, t) {
+	return e === void 0 ? Ps(X.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : Os(e) ? Z(e) === X.Never ? e : Ns(e) : e;
+	}, t) : As(e) ? Z(e) === X.Never ? e : Fs(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var Vs = Object.freeze([
+var Us = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function Hs(e, t, n, r) {
-	if (n.length === 0) return _s(e, "disable empty list", t), null;
+function Ws(e, t, n, r) {
+	if (n.length === 0) return ys(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = bc(hs(e, t, r), gs(a));
+		let n = Sc(_s(e, t, r), vs(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
@@ -5658,16 +5738,16 @@ function Hs(e, t, n, r) {
 	let s = X.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = X.Never : a === i.length ? s = X.Any : Us(i) || (s = X.Never);
+			o > 0 ? s = X.Never : a === i.length ? s = X.Any : Gs(i) || (s = X.Never);
 			break;
 		case "anyOf":
 			a > 0 ? s = X.Any : o === i.length && (s = X.Never);
 			break;
 		case "oneOf": a > 1 || o === i.length ? s = X.Never : a === 1 && o === i.length - 1 && (s = X.Any);
 	}
-	return Ms(s, { [t]: i }, r, e.path);
+	return Ps(s, { [t]: i }, r, e.path);
 }
-function Us(e) {
+function Gs(e) {
 	let t = null;
 	for (let n of e) {
 		let e = Z(n);
@@ -5682,35 +5762,35 @@ function Us(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var Ws = Object.freeze({
+var Ks = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
-function Gs(e, t) {
+function qs(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? Ws.Valid : Ws.Invalid : Ws.Unknown;
+	return n ? n(t) === !0 ? Ks.Valid : Ks.Invalid : Ks.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function Ks(e, t, n, r) {
+function Js(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return _s(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return ys(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (Gs(r, a)) {
-			case Ws.Valid:
-				i.push(js(a));
+		for (let [n, a] of t.entries()) switch (qs(r, a)) {
+			case Ks.Valid:
+				i.push(Ns(a));
 				break;
-			case Ws.Invalid: Y(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case Ks.Invalid: Y(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
 		i.length === 0 && Y(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && Gs(r, n) === Ws.Invalid && (a = !0), i) {
+	if (n && qs(r, n) === Ks.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (Bo(t, n)) {
+			for (let t of i) if (Ho(t, n)) {
 				e = !0;
 				break;
 			}
@@ -5718,11 +5798,11 @@ function Ks(e, t, n, r) {
 		}
 	}
 	let o = a ? X.Never : X.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = js(zo(n))), Ms(o, s, e.delegate, e.path);
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = Ns(Vo(n))), Ps(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var qs = /* @__PURE__ */ new Set([
+var Ys = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -5733,27 +5813,27 @@ var qs = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function Js(e, t) {
-	let n = Object.keys(t).filter((e) => !qs.has(e) && ps(e));
+function Xs(e, t) {
+	let n = Object.keys(t).filter((e) => !Ys.has(e) && hs(e));
 	n.length > 0 && Y(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Ys(e, "maxProperties", t), i = Ys(e, "minProperties", t), a = Xs(e, t), o = Zs(e, t), s = Qs(e, t), c = ec(e, t);
+	let r = Zs(e, "maxProperties", t), i = Zs(e, "minProperties", t), a = Qs(e, t), o = $s(e, t), s = ec(e, t), c = nc(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = $s(e, o, s, t);
+	let l = tc(e, o, s, t);
 	if (!l) return null;
-	let u = nc(e, tc(a, o, s, l), c, t);
-	return Ms(rc(e, a, l, u, r, i) ? X.Never : X.Object, ys({
+	let u = ic(e, rc(a, o, s, l), c, t);
+	return Ps(ac(e, a, l, u, r, i) ? X.Never : X.Object, xs({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: cc(o),
-		dependencies: lc(c, t),
+		patternProperties: uc(o),
+		dependencies: dc(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function Ys(e, t, n) {
+function Zs(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -5767,22 +5847,22 @@ function Ys(e, t, n) {
 		return r;
 	}
 }
-function Xs(e, { additionalProperties: t }) {
-	return t === !1 ? Ms(X.Never, {
+function Qs(e, { additionalProperties: t }) {
+	return t === !1 ? Ps(X.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? bc(hs(e, "additionalProperties"), gs(t)) : Ms(X.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? Sc(_s(e, "additionalProperties"), vs(t)) : Ps(X.Any, {}, e.delegate, e.path);
 }
-function Zs(e, { patternProperties: t }) {
+function $s(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = sc(i);
+		let a = lc(i);
 		if (a instanceof Error) {
 			Y(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = gs(t[i]), s = bc(hs(e, "patternProperties", i), o);
+		let o = vs(t[i]), s = Sc(_s(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -5791,29 +5871,29 @@ function Zs(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function Qs(e, { propertyNames: t }) {
-	if (!t) return Ms(X.Any, {}, e.delegate, e.path);
-	t = gs(t);
-	let n = bc(hs(e, "propertyNames"), t);
+function ec(e, { propertyNames: t }) {
+	if (!t) return Ps(X.Any, {}, e.delegate, e.path);
+	t = vs(t);
+	let n = Sc(_s(e, "propertyNames"), t);
 	if (!n) return null;
 	let r = Z(n);
-	return r !== X.String && r !== X.Any ? Ns(n) : n;
+	return r !== X.String && r !== X.Any ? Fs(n) : n;
 }
-function $s(e, t, n, { properties: r }) {
+function tc(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (Gs(n, o) === Ws.Invalid) {
+		if (qs(n, o) === Ks.Invalid) {
 			Y(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = oc(t, o);
+		let s = cc(t, o);
 		if (s && Z(s) === X.Never) {
 			Y(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = gs(r[o]), l = bc(hs(e, "properties", o), c);
+		let c = vs(r[o]), l = Sc(_s(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -5822,40 +5902,40 @@ function $s(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function ec(e, { dependencies: t }) {
+function nc(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = gs(t[i]);
+		let a = vs(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = ac(a);
+			let { keys: t, duplicated: r } = sc(a);
 			r && Y(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = bc(hs(e, "dependencies", i), a);
+			let t = Sc(_s(e, "dependencies", i), a);
 			if (t) {
 				let e = Z(t);
-				r[i] = e === X.Object || e === X.Any ? t : e === X.Extends ? Es : Ns(t);
+				r[i] = e === X.Object || e === X.Any ? t : e === X.Extends ? Os : Fs(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function tc(e, t, n, r) {
+function rc(e, t, n, r) {
 	return (i) => {
-		if (Gs(n, i) === Ws.Invalid) return !0;
-		let a = oc(t, i);
+		if (qs(n, i) === Ks.Invalid) return !0;
+		let a = cc(t, i);
 		return !!(a && Z(a) === X.Never || Z(r[i] ?? e) === X.Never);
 	};
 }
-function nc(e, t, n, { required: r }) {
+function ic(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = ac(r);
+	let i = sc(r);
 	i.duplicated && Y(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) ic(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	for (let e of i.keys) oc(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
 	return o.length > 0 && Y(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
 }
-function rc(e, t, n, r, i, a) {
+function ac(e, t, n, r, i, a) {
 	if (i !== void 0 && a !== void 0 && i < a) return Y(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
 	if (i !== void 0 && r.length > i) return Y(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
 	if (a !== void 0 && r.length < a) return Y(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
@@ -5866,7 +5946,7 @@ function rc(e, t, n, r, i, a) {
 	}
 	return !0;
 }
-function ic([e, t], n) {
+function oc([e, t], n) {
 	let r = [n], i = new Set(r);
 	for (; r.length > 0;) {
 		let n = r.pop(), i = t[n], o = e[n];
@@ -5877,7 +5957,7 @@ function ic([e, t], n) {
 	}
 	return [...i];
 }
-function ac(e) {
+function sc(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 ? {
@@ -5888,14 +5968,14 @@ function ac(e) {
 		duplicated: [...n]
 	};
 }
-function oc(e, t) {
+function cc(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function sc(e) {
+function lc(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -5903,12 +5983,12 @@ function sc(e) {
 		throw e;
 	}
 }
-function cc(e) {
+function uc(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function lc([e, t], { dependencies: n }) {
+function dc([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -5918,38 +5998,38 @@ function lc([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var uc = /* @__PURE__ */ new Set([
+var fc = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), dc = /* @__PURE__ */ new Set([
+]), pc = /* @__PURE__ */ new Set([
 	"type",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function fc(e, t) {
+function mc(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return pc(e, t);
-		case "string": return hc(e, t);
+		case "integer": return hc(e, t);
+		case "string": return _c(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => ps(e) && e !== "type");
-			return r.length > 0 && Y(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Ms(n === "null" ? X.Null : X.Boolean, { type: n }, e.delegate, e.path);
+			let r = Object.keys(t).filter((e) => hs(e) && e !== "type");
+			return r.length > 0 && Y(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Ps(n === "null" ? X.Null : X.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return _s(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return ys(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function pc(e, t) {
-	let n = Object.keys(t).filter((e) => !uc.has(e) && ps(e));
+function hc(e, t) {
+	let n = Object.keys(t).filter((e) => !fc.has(e) && hs(e));
 	n.length > 0 && Y(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Ro(t, uc);
-	for (let t of uc) {
+	let r = Bo(t, fc);
+	for (let t of fc) {
 		let n = r[t];
 		t !== "type" && n !== void 0 && Number.isNaN(n) && (Y(e, "found NaN", t), delete r[t]);
 	}
@@ -5958,38 +6038,38 @@ function pc(e, t) {
 	let { multipleOf: c } = r;
 	c === 0 && (delete r.multipleOf, r.type = "number", Y(e, "cannot be 0", "multipleOf"));
 	let l = X.Numeric;
-	return mc(r) || (l = X.Never), Ms(l, r, e.delegate, e.path);
+	return gc(r) || (l = X.Never), Ps(l, r, e.delegate, e.path);
 }
-function mc(e) {
+function gc(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 hc(e, t) {
-	let n = Object.keys(t).filter((e) => !dc.has(e) && ps(e));
+function _c(e, t) {
+	let n = Object.keys(t).filter((e) => !pc.has(e) && hs(e));
 	n.length > 0 && Y(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = Ro(t, dc);
-	gc(e, r, "maxLength"), gc(e, r, "minLength");
+	let r = Bo(t, pc);
+	vc(e, r, "maxLength"), vc(e, r, "minLength");
 	let i = r.maxLength, a = r.minLength, o = X.String;
-	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = X.Never), Ms(o, r, e.delegate, e.path);
+	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = X.Never), Ps(o, r, e.delegate, e.path);
 }
-function gc(e, t, n) {
+function vc(e, t, n) {
 	let r = t[n];
 	r !== void 0 && Number.isNaN(r) && (Y(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var _c = Object.freeze([]);
-function vc(e, t, n, r) {
-	if (Os(e) || t.isExtendsSchema(e)) return {
+var yc = Object.freeze([]);
+function bc(e, t, n, r) {
+	if (As(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: _c
+		warns: yc
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: ls.External,
+				kind: ds.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -6002,19 +6082,19 @@ function vc(e, t, n, r) {
 		path: [],
 		errors: [],
 		warns: []
-	}, a = bc(i, e);
-	if (a) yc(i.errors.length === 0, "found errors (it should be empty)");
-	else return yc(i.errors.length > 0, "cannot found any errors"), i.errors;
+	}, a = Sc(i, e);
+	if (a) xc(i.errors.length === 0, "found errors (it should be empty)");
+	else return xc(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function yc(e, t) {
+function xc(e, t) {
 	if (!e) throw Error(t);
 }
-function bc(e, t) {
-	if (e.extends.isExtendsSchema(t) || Os(t)) return t;
+function Sc(e, t) {
+	if (e.extends.isExtendsSchema(t) || As(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;
@@ -6022,23 +6102,23 @@ function bc(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = xc(e, r);
-	return s && i && (s = Ks(e, a, o, s)), s || null;
+	let s = Cc(e, r);
+	return s && i && (s = Js(e, a, o, s)), s || null;
 }
-function xc(e, t) {
-	for (let n of Vs) {
+function Cc(e, t) {
+	for (let n of Us) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => ps(e) && e !== n);
-			return i.length > 0 && Y(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), Hs(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => hs(e) && e !== n);
+			return i.length > 0 && Y(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), Ws(e, n, r) || null;
 		}
 	}
 	{
-		let n = gs(t.not);
+		let n = vs(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => ps(e) && e !== "not");
+			let r = Object.keys(t).filter((e) => hs(e) && e !== "not");
 			r.length > 0 && Y(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = bc(hs(e, "not"), n);
+			let i = Sc(_s(e, "not"), n);
 			if (!i) return null;
 			let a = X.Not;
 			switch (Z(i)) {
@@ -6047,33 +6127,33 @@ function xc(e, t) {
 					break;
 				case X.Any: a = X.Never;
 			}
-			return Ms(a, { not: i }, e.delegate, e.path);
+			return Ps(a, { not: i }, e.delegate, e.path);
 		}
 	}
 	if (t.type) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return Hs(e, "anyOf", n.map((e) => ({
+			return Ws(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return Js(e, t);
-			case "array": return Fs(e, t);
-			default: return fc(e, t);
+			case "object": return Xs(e, t);
+			case "array": return Ls(e, t);
+			default: return mc(e, t);
 		}
 	}
-	return ms(t) ? Ms(X.Any, {}, e.delegate, e.path) : (_s(e, "unrecognized"), null);
+	return gs(t) ? Ps(X.Any, {}, e.delegate, e.path) : (ys(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var Sc = class {
+var wc = 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 Cc {
+		this.keys = t, this.clazz = class extends Tc {
 			constructor(e) {
 				super(t, e);
 			}
@@ -6097,7 +6177,7 @@ var Sc = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Cc = class {
+}, Tc = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -6112,21 +6192,21 @@ var Sc = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function wc(e) {
-	return new Tc(e);
+function Ec(e) {
+	return new Dc(e);
 }
-var Tc = class {
+var Dc = class {
 	constructor(e) {
-		this.description = new Sc(e);
+		this.description = new wc(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Ec(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new Oc(this.description, t);
 	}
-}, Ec = class {
+}, Oc = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -6147,7 +6227,7 @@ var Tc = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of Vo) if (e & a) {
+		for (let r of this.values) for (let [i, a] of Uo) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -6164,11 +6244,11 @@ var Tc = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function Dc(e, t) {
+function kc(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? Oc(e, t) : n.num > r.num ? kc(e, t) : Ac(e, t);
+	return n.num < r.num ? Ac(e, t) : n.num > r.num ? jc(e, t) : Mc(e, t);
 }
-function Oc(e, t) {
+function Ac(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -6193,11 +6273,11 @@ function Oc(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [jc(r), a]
+				range: [Nc(r), a]
 			}), {
 				left: {
 					fromLeft: !0,
-					range: [n, jc(i)]
+					range: [n, Nc(i)]
 				},
 				center: [i, r],
 				right: t
@@ -6207,16 +6287,16 @@ function Oc(e, t) {
 	return {
 		left: {
 			fromLeft: !0,
-			range: [n, jc(i)]
+			range: [n, Nc(i)]
 		},
 		center: [i, a],
 		right: {
 			fromLeft: !0,
-			range: [jc(a), r]
+			range: [Nc(a), r]
 		}
 	};
 }
-function kc(e, t) {
+function jc(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -6241,11 +6321,11 @@ function kc(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !0,
-				range: [jc(a), r]
+				range: [Nc(a), r]
 			}), {
 				left: {
 					fromLeft: !1,
-					range: [i, jc(n)]
+					range: [i, Nc(n)]
 				},
 				center: [n, a],
 				right: t
@@ -6255,23 +6335,23 @@ function kc(e, t) {
 	return {
 		left: {
 			fromLeft: !1,
-			range: [i, jc(n)]
+			range: [i, Nc(n)]
 		},
 		center: [n, r],
 		right: {
 			fromLeft: !1,
-			range: [jc(r), a]
+			range: [Nc(r), a]
 		}
 	};
 }
-function Ac(e, t) {
+function Mc(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, jc(i)]
+		range: [n, Nc(i)]
 	}) : o && !s && (c = {
 		fromLeft: !1,
-		range: [i, jc(n)]
+		range: [i, Nc(n)]
 	}), r.num <= a.num) {
 		let e = !0, t = !1;
 		if (r.num === a.num) {
@@ -6282,7 +6362,7 @@ function Ac(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [jc(r), a]
+				range: [Nc(r), a]
 			}), {
 				left: c,
 				center: [l, r],
@@ -6295,11 +6375,11 @@ function Ac(e, t) {
 		center: [l, a],
 		right: {
 			fromLeft: !0,
-			range: [jc(a), r]
+			range: [Nc(a), r]
 		}
 	};
 }
-function jc(e) {
+function Nc(e) {
 	return {
 		num: e.num,
 		exclusive: !e.exclusive
@@ -6307,8 +6387,8 @@ function jc(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var Mc = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = Dc([{
+var Pc = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = kc([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -6338,24 +6418,24 @@ var Mc = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function Nc({ left: e, right: t, intersection: n }) {
+function Fc({ left: e, right: t, intersection: n }) {
 	if (!n) return H.Rejection;
 	let r = !1, i = !1;
 	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? H.Intersection : r ? H.Containing : i ? H.ContainedBy : H.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var Pc = Mc(0), Fc = wc([
+var Ic = Pc(0), Lc = Ec([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function Ic({ calculate: e }, t, n) {
-	let r = Pc(t.minItems, t.maxItems, n.minItems, n.maxItems), i = Nc(r);
+function Rc({ calculate: e }, t, n) {
+	let r = Ic(t.minItems, t.maxItems, n.minItems, n.maxItems), i = Fc(r);
 	if (i === H.Rejection) return K;
-	let [a, o] = Lc(t), [s, c] = Lc(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = Fc.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+	let [a, o] = zc(t), [s, c] = zc(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = Lc.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) => {
@@ -6395,69 +6475,69 @@ function Ic({ calculate: e }, t, n) {
 	}
 	return p;
 }
-function Lc({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? Ts] : [[], e ?? Ts];
+function zc({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? Ds] : [[], e ?? Ds];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function Rc(e) {
+function Bc(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = Ds(n);
-		return i === Ds(r) ? i ? Bc(t, n, r, e) : n === r : !1;
+		let i = ks(n);
+		return i === ks(r) ? i ? Hc(t, n, r, e) : n === r : !1;
 	};
 }
-function zc(e) {
+function Vc(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => Bc(t, n, r, e);
+	return (n, r) => Hc(t, n, r, e);
 }
-function Bc(e, t, n, r) {
-	let i = `${ks(t)}/${ks(n)}`, a = e.get(i);
+function Hc(e, t, n, r) {
+	let i = `${js(t)}/${js(n)}`, a = e.get(i);
 	return a === void 0 && e.set(i, a = r(t, n)), a;
 }
 //#endregion
 //#region src/json-schema-subset/checker/enumAndConst.ts
-function Vc(e, t, n) {
-	let r = Uc(t), i = Uc(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (Wc(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (Wc(e, r, t) ? s = !0 : o = !0, o && s) break;
+function Uc(e, t, n) {
+	let r = Gc(t), i = Gc(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (Kc(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (Kc(e, r, t) ? s = !0 : o = !0, o && s) break;
 	return s ? a && o ? q : a ? W : o ? G : U : K;
 }
-function Hc(e, t) {
+function Wc(e, t) {
 	let n = !1, r = !1;
-	for (let i of Uc(e)) {
-		switch (Gs(t, i)) {
-			case Ws.Valid:
+	for (let i of Gc(e)) {
+		switch (qs(t, i)) {
+			case Ks.Valid:
 				n = !0;
 				break;
-			case Ws.Invalid:
+			case Ks.Invalid:
 				r = !0;
 				break;
-			case Ws.Unknown: return Ho;
+			case Ks.Unknown: return Wo;
 		}
 		if (n && r) break;
 	}
 	return n && r ? q : n ? U | G : r ? K : Z(t) === X.Never ? U : G;
 }
-function Uc({ const: e, enum: t }) {
+function Gc({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function Wc({ isEquals: e }, t, n) {
+function Kc({ 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 Gc(e) {
+function qc(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 = ks(e), a = ks(t);
+		let r = js(e), a = js(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;
@@ -6474,25 +6554,25 @@ function Gc(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : Os(e) && Os(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : As(e) && As(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function Kc(e) {
-	let t = $c(e), n = e.multipleOf ?? 1, r = Jc(t, n);
+function Jc(e) {
+	let t = tl(e), n = e.multipleOf ?? 1, r = Xc(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function qc([e, t]) {
+function Yc([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
-function Jc(e, t) {
+function Xc(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = Yc(n.num, t), a = Xc(r.num, t);
+	let [n, r] = e, i = Zc(n.num, t), a = Qc(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
@@ -6501,29 +6581,29 @@ function Jc(e, t) {
 		exclusive: !1
 	}];
 }
-function Yc(e, t) {
+function Zc(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function Xc(e, t) {
+function Qc(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function Zc(e, t) {
-	let { left: n, right: r, center: i } = Dc($c(e), $c(t));
+function $c(e, t) {
+	let { left: n, right: r, center: i } = kc(tl(e), tl(t));
 	if (!i) return K;
 	let a = !1, o = !1;
 	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? q : a ? W : o ? G : U;
 }
-function Qc(e, t) {
-	let n = $c(e), r = Kc(t);
+function el(e, t) {
+	let n = tl(e), r = Jc(t);
 	if (!r) return W;
-	let i = Dc(n, r.range), a = Jc(i.center, r.multipleOf), o = el(i.left, r.multipleOf), s = el(i.right, r.multipleOf);
+	let i = kc(n, r.range), a = Xc(i.center, r.multipleOf), o = nl(i.left, r.multipleOf), s = nl(i.right, r.multipleOf);
 	if (!i.center) return K;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !qc(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? q : c ? W : l ? G : U;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !Yc(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? q : c ? W : l ? G : U;
 }
-function $c(e) {
+function tl(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -6545,84 +6625,84 @@ function $c(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function el(e, t) {
-	if (e && !e.fromLeft) return Jc(e.range, t);
+function nl(e, t) {
+	if (e && !e.fromLeft) return Xc(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function tl(e, t) {
-	let n = Kc(e), r = Kc(t);
+function rl(e, t) {
+	let n = Jc(e), r = Jc(t);
 	if (!n && !r) return U;
 	if (!n) return G;
 	if (!r) return W;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Dc(i, o), l, u = 0;
-	if (c.center && (u = rl(a, s), l = Jc(c.center, u)), !l) return K;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = kc(i, o), l, u = 0;
+	if (c.center && (u = al(a, s), l = Xc(c.center, u)), !l) return K;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && Jc(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && Jc(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= nl(n, l, u), f ||= nl(r, l, u), d && f ? q : d ? W : f ? G : U;
+	return p && Xc(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && Xc(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= il(n, l, u), f ||= il(r, l, u), d && f ? q : d ? W : f ? G : U;
 }
-function nl({ range: e, multipleOf: t }, n, r) {
-	let i = Dc(e, n);
-	if (Jc(i.left?.range, t) || Jc(i.right?.range, t)) return !0;
-	let a = Jc(i.center, t);
+function il({ range: e, multipleOf: t }, n, r) {
+	let i = kc(e, n);
+	if (Xc(i.left?.range, t) || Xc(i.right?.range, t)) return !0;
+	let a = Xc(i.center, t);
 	if (!a) return !1;
-	let o = al(n);
-	return al(a) > o || o !== 1 && t < r;
+	let o = sl(n);
+	return sl(a) > o || o !== 1 && t < r;
 }
-function rl(e, t) {
-	return e * t / il(e, t);
+function al(e, t) {
+	return e * t / ol(e, t);
 }
-function il(e, t) {
-	return e === 0 ? t : il(t % e, e);
+function ol(e, t) {
+	return e === 0 ? t : ol(t % e, e);
 }
-function al(e) {
+function sl(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 ol(e, t) {
-	if (sl(e) || sl(t)) return Ho;
-	let n = cl(e), r = cl(t);
-	return n && r ? Zc(e, t) : n ? Qc(e, t) : r ? Qo(Qc(t, e)) : tl(e, t);
+function cl(e, t) {
+	if (ll(e) || ll(t)) return Wo;
+	let n = ul(e), r = ul(t);
+	return n && r ? $c(e, t) : n ? el(e, t) : r ? es(el(t, e)) : rl(e, t);
 }
-function sl(e) {
+function ll(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function cl(e) {
+function ul(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 ll = Mc(0), ul = wc([
+var dl = Pc(0), fl = Ec([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function dl(e, t, n) {
-	if (fl(t, n)) return K;
-	let r = pl(t, n);
+function pl(e, t, n) {
+	if (ml(t, n)) return K;
+	let r = hl(t, n);
 	if (!r) return K;
-	let i = yl(t), a = yl(n), o = (t) => {
+	let i = xl(t), a = xl(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return bl(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = ul.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), hl);
-	for (let e of [...c].toSorted()) u.push(o(e), gl);
-	for (let e of [...l].toSorted()) u.push(o(e), _l);
+		return Sl(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = fl.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), _l);
+	for (let e of [...c].toSorted()) u.push(o(e), vl);
+	for (let e of [...l].toSorted()) u.push(o(e), yl);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = vl(d, f);
-		for (let e of [...ml(t, n)].toSorted()) {
+		let r = bl(d, f);
+		for (let e of [...gl(t, n)].toSorted()) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? Ts, a = n.additionalProperties ?? Ts;
-		if (bl(i, a)) {
+		let i = t.additionalProperties ?? Ds, a = n.additionalProperties ?? Ds;
+		if (Sl(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -6634,10 +6714,10 @@ function dl(e, t, n) {
 	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? K : e && t ? q : e ? W : t ? G : U;
 	return m;
 }
-function fl(e, t) {
-	return Nc(ll(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === H.Rejection;
+function ml(e, t) {
+	return Fc(dl(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === H.Rejection;
 }
-function pl(e, t) {
+function hl(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);
@@ -6653,7 +6733,7 @@ function pl(e, t) {
 		hasOptional2: u > s
 	};
 }
-function ml(e, t) {
+function gl(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);
@@ -6661,7 +6741,7 @@ function ml(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var hl = (e, t) => {
+var _l = (e, t) => {
 	switch (e) {
 		case H.Equals:
 			t.hasCommonInRequired = !0;
@@ -6677,7 +6757,7 @@ var hl = (e, t) => {
 			break;
 		case H.Rejection: t.hasRejection = !0;
 	}
-}, gl = (e, t) => {
+}, vl = (e, t) => {
 	switch (e) {
 		case H.Equals:
 		case H.ContainedBy:
@@ -6689,7 +6769,7 @@ var hl = (e, t) => {
 			break;
 		case H.Rejection: t.hasRejection = !0;
 	}
-}, _l = (e, t) => {
+}, yl = (e, t) => {
 	switch (e) {
 		case H.Equals:
 		case H.Containing:
@@ -6701,7 +6781,7 @@ var hl = (e, t) => {
 			break;
 		case H.Rejection: t.hasRejection = !0;
 	}
-}, vl = (e, t) => (n, r) => {
+}, bl = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
@@ -6721,7 +6801,7 @@ var hl = (e, t) => {
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function yl(e) {
+function xl(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");
@@ -6731,39 +6811,39 @@ function yl(e) {
 		});
 	}
 	return (e) => {
-		if (n && Gs(n, e) === Ws.Invalid) return Es;
+		if (n && qs(n, e) === Ks.Invalid) return Os;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || Ts;
+		return ((t && t[e]) ?? r) || Ds;
 	};
 }
-function bl(e, t) {
+function Sl(e, t) {
 	let n = Z(e), r = Z(t);
 	return n !== X.Never || r !== X.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var xl = Mc(0);
-function Sl(e, t) {
-	let n = Nc(xl(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+var Cl = Pc(0);
+function wl(e, t) {
+	let n = Fc(Cl(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
 		case H.Rejection: return K;
-		case H.Containing: return r ? Ho : W;
-		case H.ContainedBy: return i ? Ho : G;
-		case H.Equals: return r && i ? e.pattern === t.pattern ? U : Ho : r ? U | G : i ? U | W : U;
-		case H.Intersection: return r && i ? Ho : r ? q | K | G : i ? q | K | W : q;
+		case H.Containing: return r ? Wo : W;
+		case H.ContainedBy: return i ? Wo : G;
+		case H.Equals: return r && i ? e.pattern === t.pattern ? U : Wo : r ? U | G : i ? U | W : U;
+		case H.Intersection: return r && i ? Wo : r ? q | K | G : i ? q | K | W : q;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function Cl(e, t, n) {
-	let r = {}, i = [], a = zc(Tl(e, r)), o = wl(), s = Gc(e);
-	r.isEquals = Rc(Bo), r.calculate = ss({
+function Tl(e, t, n) {
+	let r = {}, i = [], a = Vc(Dl(e, r)), o = El(), s = qc(e);
+	r.isEquals = Bc(Ho), r.calculate = ls({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!Dl(r ? Qo(n) : n)) return;
-			let a = r ? Ol(t, e) : Ol(e, t);
+			if (!kl(r ? es(n) : n)) return;
+			let a = r ? Al(t, e) : Al(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -6773,34 +6853,34 @@ function Cl(e, t, n) {
 		expression: c
 	};
 }
-var wl = () => (e) => {
+var El = () => (e) => {
 	let t;
 	switch (Z(e)) {
 		case X.Not:
 			t = {
-				kind: os.Not,
+				kind: cs.Not,
 				expression: e.not
 			};
 			break;
 		case X.Combination:
 			if ("allOf" in e) t = {
-				kind: os.AllOf,
-				expressions: El(e.allOf, X.Any)
+				kind: cs.AllOf,
+				expressions: Ol(e.allOf, X.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: os.AnyOf,
-				expressions: El(e.anyOf, X.Never)
+				kind: cs.AnyOf,
+				expressions: Ol(e.anyOf, X.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: os.OneOf,
-				expressions: El(e.oneOf, X.Never)
+				kind: cs.OneOf,
+				expressions: Ol(e.oneOf, X.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: os.Leaf };
+		default: t = { kind: cs.Leaf };
 	}
 	return t;
-}, Tl = (e, t) => (n, r) => {
+}, Dl = (e, t) => (n, r) => {
 	let i = Z(n), a = Z(r);
 	if (i === X.Extends || a === X.Extends) return e.calculate(n, r);
 	switch (i) {
@@ -6811,28 +6891,28 @@ var wl = () => (e) => {
 		case X.Any: return G;
 		case X.Never: return W;
 	}
-	if (i === X.EnumOrConst && a === X.EnumOrConst) return Vc(t, n, r);
-	if (i === X.EnumOrConst) return Hc(n, r);
-	if (a === X.EnumOrConst) return Qo(Hc(r, n));
+	if (i === X.EnumOrConst && a === X.EnumOrConst) return Uc(t, n, r);
+	if (i === X.EnumOrConst) return Wc(n, r);
+	if (a === X.EnumOrConst) return es(Wc(r, n));
 	if (i !== a) return K;
 	switch (i) {
 		case X.Null: return U;
-		case X.Numeric: return ol(n, r);
-		case X.String: return Sl(n, r);
+		case X.Numeric: return cl(n, r);
+		case X.String: return wl(n, r);
 		case X.Boolean: return U;
-		case X.Object: return dl(t, n, r);
-		case X.Array: return Ic(t, n, r);
+		case X.Object: return pl(t, n, r);
+		case X.Array: return Rc(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function El(e, t) {
+function Ol(e, t) {
 	return e.filter((e) => Z(e) !== t);
 }
-function Dl(e) {
-	return !Uo(e) && !Go(e) && (Wo(e) || qo(e) || Ko(e));
+function kl(e) {
+	return !Go(e) && !qo(e) && (Ko(e) || Yo(e) || Jo(e));
 }
-function Ol(e, t) {
-	let n = As(t);
+function Al(e, t) {
+	let n = Ms(t);
 	if (!n) return;
 	let r = Z(e), i = Z(t);
 	if (r !== i) return [...n, "type"];
@@ -6865,12 +6945,12 @@ function Ol(e, t) {
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var kl = class e {
+var jl = 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(Io(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(Ro(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -6880,7 +6960,7 @@ var kl = 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 |= Jo(t);
+		for (let t of a) r && (t = e.swap(t)), i |= Xo(t);
 		return i;
 	}
 	equals(e, t) {
@@ -6900,35 +6980,35 @@ var kl = class e {
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function Al(e, t, n = !1) {
+function Ml(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw Ml(e, r, "$"), new cs(e);
+		throw Pl(e, r, "$"), new us(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(us(e));
+		for (let e of a) console.warn(fs(e));
 	}
 	return i;
 }
-function jl(e, t, n, r = !1) {
+function Nl(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) && Ml(e, i, "$1"), Array.isArray(a) && Ml(e, a, "$2"), new cs(e);
+		throw Array.isArray(i) && Pl(e, i, "$1"), Array.isArray(a) && Pl(e, a, "$2"), new us(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(us(e));
+		for (let e of s) console.warn(fs(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(us(e));
+		for (let e of l) console.warn(fs(e));
 	}
 	return [o, c];
 }
-function Ml(e, t, n) {
+function Pl(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -6939,61 +7019,61 @@ function Ml(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var Nl = Object.freeze({
+var Fl = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function Pl({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new kl(e);
+function Il({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new jl(e);
 	return Object.freeze({
-		compile: (e, r, i) => Al(e, (e) => vc(e, n, r, t), i),
+		compile: (e, r, i) => Ml(e, (e) => bc(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = jl(e, r, (e) => vc(e, n, void 0, t), i), { errorPath: s, expression: c } = Cl(n, a, o), l = Uo(c) || Go(c), u = Wo(c) || qo(c) || Ko(c);
-			return l && !u ? { result: Nl.True } : !l && u ? {
+			let [a, o] = Nl(e, r, (e) => bc(e, n, void 0, t), i), { errorPath: s, expression: c } = Tl(n, a, o), l = Go(c) || qo(c), u = Ko(c) || Yo(c) || Jo(c);
+			return l && !u ? { result: Fl.True } : !l && u ? {
 				errorPath: s,
-				result: Nl.False
-			} : { result: Nl.Unknown };
+				result: Fl.False
+			} : { result: Fl.Unknown };
 		}
 	});
 }
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
-function Fl(e) {
+function Ll(e) {
 	return qt(e)?.type === "string";
 }
-function Il(e) {
-	return e instanceof Ul || qt(e)?.type === "array";
+function Rl(e) {
+	return e instanceof Gl || qt(e)?.type === "array";
 }
-function Ll(e) {
+function zl(e) {
 	let t = qt(e);
 	return t?.type === "array" && qt(t.items)?.type === "string";
 }
-function Rl(e) {
+function Bl(e) {
 	let t = qt(e);
 	return t != null && Object.keys(t).length === 0;
 }
-function zl(e) {
+function Vl(e) {
 	let t = qt(e), n = qt(t?.error);
 	if (t == null || n == null || t.packageId != null && !Kt(t.packageId) || n.message != null && !Kt(n.message)) throw TypeError("Invalid schema comparison context.");
 }
-function Bl(e) {
-	return e == null ? { error: {} } : (zl(e), e);
+function Hl(e) {
+	return e == null ? { error: {} } : (Vl(e), e);
 }
-var Vl = class e {
+var Ul = 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 = Bl(n);
+		this.id = e, this.value = t, this.context = Hl(n);
 	}
 	compare(e) {
 		return this.passThrough(e) || this.compareImpl(e);
 	}
 	passThrough(e) {
-		if (e instanceof Gl) return [H.Equals];
+		if (e instanceof ql) return [H.Equals];
 	}
-}, Hl = class e extends Vl {
+}, Wl = class e extends Ul {
 	static isMatch(e) {
 		let t = qt(e)?.enum;
 		return Array.isArray(t) && t.every((e) => Kt(e));
@@ -7003,7 +7083,7 @@ var Vl = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (Fl(t)) return [H.ContainedBy];
+		if (Ll(t)) return [H.ContainedBy];
 		if (t instanceof e) {
 			let e = new Set(this.value.enum), n = H.Equals;
 			for (let r of t.value.enum) e.has(r) || (n = H.ContainedBy), e.delete(r);
@@ -7022,7 +7102,7 @@ var Vl = class e {
 		}
 		return !1;
 	}
-}, Ul = class e extends Vl {
+}, Gl = class e extends Ul {
 	static isMatch(e) {
 		let t = qt(e), n = qt(t?.items)?.enum;
 		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => Kt(e));
@@ -7032,7 +7112,7 @@ var Vl = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (t instanceof Wl || Ll(t)) return [H.ContainedBy];
+		if (t instanceof Kl || zl(t)) return [H.ContainedBy];
 		if (t instanceof e) {
 			let e = new Set(this.value.items.enum), n = H.Equals;
 			for (let r of t.value.items.enum) e.has(r) || (n = H.ContainedBy), e.delete(r);
@@ -7051,24 +7131,24 @@ var Vl = class e {
 		}
 		return !1;
 	}
-}, Wl = class e extends Vl {
+}, Kl = class e extends Ul {
 	static isMatch(e) {
 		let t = qt(e);
-		return t?.type === "array" && !t.uniqueItems && (!Jt(t.items) || Rl(t.items));
+		return t?.type === "array" && !t.uniqueItems && (!Jt(t.items) || Bl(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 || Il(t) ? [H.Equals] : [H.Rejection];
+		return t instanceof e || Rl(t) ? [H.Equals] : [H.Rejection];
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, Gl = class e extends Vl {
+}, ql = class e extends Ul {
 	static isMatch(e) {
-		return Rl(e);
+		return Bl(e);
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid empty schema.");
@@ -7080,7 +7160,7 @@ var Vl = class e {
 	equals(e) {
 		return !0;
 	}
-}, Kl = class e extends Vl {
+}, Jl = class e extends Ul {
 	static isMatch(e) {
 		return qt(e)?.contentMediaType === "oomol/bin";
 	}
@@ -7089,12 +7169,12 @@ var Vl = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [H.Equals] : (Vl.setError(this, t, "edgeError.binDiffType"), [H.Rejection]);
+		return t instanceof e ? [H.Equals] : (Ul.setError(this, t, "edgeError.binDiffType"), [H.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, ql = class e extends Vl {
+}, Yl = class e extends Ul {
 	static isMatch(e) {
 		return qt(e)?.contentMediaType === "oomol/artifact";
 	}
@@ -7103,41 +7183,41 @@ var Vl = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [H.Equals] : (Vl.setError(this, t, "edgeError.artifactDiffType"), [H.Rejection]);
+		return t instanceof e ? [H.Equals] : (Ul.setError(this, t, "edgeError.artifactDiffType"), [H.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
-function Jl() {
-	return Pl({ extendsSchemaClasses: [
+function Xl() {
+	return Il({ extendsSchemaClasses: [
+		Kl,
+		ql,
 		Wl,
 		Gl,
-		Hl,
-		Ul,
-		Kl,
-		ql
+		Jl,
+		Yl
 	] });
 }
 //#endregion
 //#region src/manifest/common/schemaCompare.ts
-var Yl = Jl();
-function Xl(e, t) {
+var Zl = Xl();
+function Ql(e, t) {
 	return t ? { anyOf: [e, { type: "null" }] } : e;
 }
-function Zl(e, t) {
+function $l(e, t) {
 	return e == null || !t || e.length === 0 || e[0] !== "anyOf" ? e : e[1] === 0 ? e.slice(2) : void 0;
 }
-function Ql(e, t) {
+function eu(e, t) {
 	try {
-		let n = {}, r = Yl.compile(Xl($l(e.schema), e.nullable), {
+		let n = {}, r = Zl.compile(Ql(tu(e.schema), e.nullable), {
 			...e,
 			error: n
-		}), i = Yl.compile(Xl($l(t.schema), t.nullable), {
+		}), i = Zl.compile(Ql(tu(t.schema), t.nullable), {
 			...t,
 			error: n
-		}), { result: a, errorPath: o } = Yl.isSubset(r, i);
-		return a == Nl.True ? { kind: "compatible" } : {
+		}), { result: a, errorPath: o } = Zl.isSubset(r, i);
+		return a == Fl.True ? { kind: "compatible" } : {
 			kind: "incompatible",
 			error: n.message,
 			errorPath: o
@@ -7149,7 +7229,7 @@ function Ql(e, t) {
 		};
 	}
 }
-function $l(e) {
+function tu(e) {
 	function t(t) {
 		if (!t.startsWith("#")) return;
 		let n = decodeURIComponent(t.slice(1));
@@ -7202,46 +7282,28 @@ function $l(e) {
 }
 //#endregion
 //#region src/flow/common/schema.ts
-function eu(e) {
-	return e.kind == "poll" || e.kind == "integration" ? e.definition.payloadSchema : e.kind == "manual" ? {
-		additionalProperties: !1,
-		type: "object"
-	} : e.kind == "cron" ? {
-		additionalProperties: !1,
-		properties: { scheduledAt: {
-			format: "date-time",
-			type: "string"
-		} },
-		type: "object"
-	} : {
-		additionalProperties: !1,
-		properties: Object.fromEntries(e.inputsDef.map((e) => [e.handle, e.jsonSchema])),
-		required: e.inputsDef.filter((e) => !e.nullable && !Object.hasOwn(e, "value")).map((e) => e.handle),
-		type: "object"
-	};
-}
-function tu(e, t) {
+function nu(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) => tu(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) => nu(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) && tu(t, r[e]));
+	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && nu(t, r[e]));
 }
-function nu(e) {
+function ru(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
-function ru(e) {
+function iu(e) {
 	return Array.isArray(e) ? e : void 0;
 }
-function iu(e, t, n = !1, r = !1) {
-	if (t === !0 || tu(t, {})) return { kind: "compatible" };
-	if (e === !0 || tu(e, {}) || e === !1 || t === !1) return { kind: "incompatible" };
-	let i = nu(e), a = nu(t);
+function au(e, t, n = !1, r = !1) {
+	if (t === !0 || nu(t, {})) return { kind: "compatible" };
+	if (e === !0 || nu(e, {}) || e === !1 || t === !1) return { kind: "incompatible" };
+	let i = ru(e), a = ru(t);
 	if (i == null || a == null) return {
 		kind: "compare-error",
 		message: "Port schema must be an object or boolean."
 	};
-	let o = Ql({
+	let o = eu({
 		nullable: n,
 		packageId: void 0,
 		schema: i
@@ -7252,22 +7314,22 @@ function iu(e, t, n = !1, r = !1) {
 	});
 	return o.kind == "incompatible" ? {
 		...o,
-		errorPath: Zl(o.errorPath, r)
+		errorPath: $l(o.errorPath, r)
 	} : o;
 }
-function au(e, t) {
+function ou(e, t) {
 	let n = e;
 	for (let e of t) {
 		if (typeof n != "object" || !n) return;
-		n = Array.isArray(n) ? n[Number(e)] : nu(n)?.[String(e)];
+		n = Array.isArray(n) ? n[Number(e)] : ru(n)?.[String(e)];
 	}
 	return n;
 }
-function ou(e, t, n) {
+function su(e, t, n) {
 	if (e.nullable && !t.nullable) return { kind: "nullable" };
 	if (n.error == "edgeError.binDiffType") return { kind: "binary" };
 	if (n.error == "edgeError.artifactDiffType") return { kind: "artifact" };
-	let r = nu(e.jsonSchema), i = nu(t.jsonSchema), a = n.errorPath == null && r != null && i != null ? su(r, i) : void 0, o = a == null ? n.errorPath : [a], s = o?.at(-1);
+	let r = ru(e.jsonSchema), i = ru(t.jsonSchema), a = n.errorPath == null && r != null && i != null ? cu(r, i) : void 0, o = a == null ? n.errorPath : [a], s = o?.at(-1);
 	if (typeof s != "string" || !Ut(s)) return {
 		kind: "schema",
 		path: o
@@ -7277,19 +7339,19 @@ function ou(e, t, n) {
 		kind: "keyword",
 		keyword: s,
 		path: c,
-		source: au(e.jsonSchema, [...c, s]),
-		target: au(t.jsonSchema, [...c, s])
+		source: ou(e.jsonSchema, [...c, s]),
+		target: ou(t.jsonSchema, [...c, s])
 	};
 }
-function su(e, t) {
-	if (!tu(e.type, t.type)) return "type";
-	if (t.const !== void 0 && !tu(e.const, t.const)) return "const";
-	if (t.enum !== void 0 && !tu(e.enum, t.enum)) return "enum";
+function cu(e, t) {
+	if (!nu(e.type, t.type)) return "type";
+	if (t.const !== void 0 && !nu(e.const, t.const)) return "const";
+	if (t.enum !== void 0 && !nu(e.enum, t.enum)) return "enum";
 	let n = new Set(Array.isArray(e.required) ? e.required : []);
 	if (Array.isArray(t.required) && t.required.some((e) => typeof e == "string" && !n.has(e))) return "required";
-	for (let n of cu) if (t[n] !== void 0 && !tu(e[n], t[n])) return n;
+	for (let n of lu) if (t[n] !== void 0 && !nu(e[n], t[n])) return n;
 }
-var cu = [
+var lu = [
 	"minLength",
 	"maxLength",
 	"pattern",
@@ -7303,26 +7365,87 @@ var cu = [
 	"minProperties",
 	"maxProperties"
 ];
-function lu(e, t) {
-	let n = iu(e.jsonSchema, t.jsonSchema, e.nullable, t.nullable);
+function uu(e, t) {
+	let n = au(e.jsonSchema, t.jsonSchema, e.nullable, t.nullable);
 	return n.kind == "incompatible" ? {
 		kind: "incompatible",
-		mismatch: ou(e, t, n)
+		mismatch: su(e, t, n)
 	} : n;
 }
-function uu(e, t) {
-	return lu(e, t).kind == "compatible";
+function du(e, t) {
+	return uu(e, t).kind == "compatible";
 }
-function du(e) {
-	let t = nu(e), n = ru(t?.type);
-	return t != null && n?.includes("string") ? iu({ type: "string" }, {
+function fu(e) {
+	let t = ru(e), n = iu(t?.type);
+	return t != null && n?.includes("string") ? au({ type: "string" }, {
 		...t,
 		type: "string"
-	}).kind == "compatible" : iu({ type: "string" }, e).kind == "compatible";
+	}).kind == "compatible" : au({ type: "string" }, e).kind == "compatible";
+}
+//#endregion
+//#region src/trigger/common/contract.ts
+var pu = [
+	{
+		handle: "headers",
+		jsonSchema: {
+			type: "object",
+			additionalProperties: { type: "string" }
+		},
+		nullable: !1
+	},
+	{
+		handle: "query",
+		jsonSchema: {
+			type: "object",
+			additionalProperties: {
+				type: ["string", "array"],
+				items: { type: "string" }
+			}
+		},
+		nullable: !1
+	},
+	{
+		handle: "body",
+		jsonSchema: {
+			type: "object",
+			additionalProperties: !0
+		},
+		nullable: !1
+	},
+	{
+		handle: "webhookUrl",
+		jsonSchema: { type: "string" },
+		nullable: !1
+	}
+], mu = [{
+	description: "The scheduled time that triggered this run, in ISO 8601 format.",
+	handle: "scheduledAt",
+	jsonSchema: {
+		type: "string",
+		format: "date-time"
+	},
+	nullable: !1
+}];
+function hu(e) {
+	switch (e.kind) {
+		case "manual": return [];
+		case "cron": return mu;
+		case "poll":
+		case "integration": return e.definition.outputs;
+		case "webhook": return pu.map((t) => t.handle === "body" ? Object.assign({}, t, { jsonSchema: {
+			type: "object",
+			additionalProperties: !1,
+			properties: Object.fromEntries(e.bodyFields.map((e) => [e.handle, e.jsonSchema])),
+			required: e.bodyFields.filter((e) => !e.nullable && !Object.hasOwn(e, "value")).map((e) => e.handle)
+		} }) : t);
+	}
+}
+function gu(e) {
+	return Object.fromEntries(hu(e).map(({ handle: e, ...t }) => [e, t]));
 }
 //#endregion
 //#region src/flow/common/graph.ts
-function fu(e, t) {
+function _u(e, t) {
 	switch (t.kind) {
 		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
@@ -7336,7 +7459,7 @@ function fu(e, t) {
 		case "webhook": return {};
 	}
 }
-function pu(e) {
+function vu(e) {
 	return {
 		notification: {
 			nullable: !1,
@@ -7375,7 +7498,7 @@ function pu(e) {
 		}]))
 	};
 }
-function mu(e, t) {
+function yu(e, t) {
 	switch (t.kind) {
 		case "condition": {
 			let e = [...t.cases.map((e) => e.output), ...t.defaultOutput == null ? [] : [t.defaultOutput]];
@@ -7384,18 +7507,15 @@ function mu(e, t) {
 		case "value": return Tt(t.values);
 		case "subflow": return Tt(e.subflows[t.subflowId]?.outputs ?? []);
 		case "task": return Tt(t.task == null ? e.tasks[t.taskId]?.outputs ?? [] : t.task.outputs);
-		case "wait": return pu(t);
+		case "wait": return vu(t);
 		case "cron":
 		case "integration":
 		case "poll":
 		case "manual":
-		case "webhook": return { payload: {
-			jsonSchema: eu(t),
-			nullable: !1
-		} };
+		case "webhook": return gu(t);
 	}
 }
-function hu(e) {
+function bu(e) {
 	let t = new Map(Object.keys(e.nodes).map((e) => [e, /* @__PURE__ */ new Set()])), n = /* @__PURE__ */ new Map();
 	for (let r of e.edges) {
 		if (!t.has(r.source) || !t.has(r.target)) continue;
@@ -7412,51 +7532,56 @@ function hu(e) {
 			n?.delete(i), n?.size == 0 && r.push(e);
 		}
 	}
-	return r;
+	return [...r, ...[...t.keys()].toSorted()];
 }
-var gu = /* @__PURE__ */ new WeakMap();
-function _u(e, t) {
+var xu = /* @__PURE__ */ new WeakMap();
+function Su(e, t) {
 	return Object.entries(e).every(([e, n]) => t[e] == n);
 }
-function vu(e, t) {
+function Cu(e, t) {
 	return Object.entries(e).every(([e, n]) => t[e] == null || t[e] == n);
 }
-function yu(e) {
-	let t = gu.get(e);
+function wu(e) {
+	let t = xu.get(e);
 	if (t != null) return t;
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
 	for (let t of e.edges) {
 		let e = a.get(t.target) ?? [];
 		e.push(t), a.set(t.target, e);
 	}
-	for (let t of hu(e)) {
-		let o = e.nodes[t], s = a.get(t) ?? [], c = /* @__PURE__ */ new Set(), l = /* @__PURE__ */ new Set(), u = [];
-		for (let t of s) {
-			c.add(t.source);
-			for (let e of i.get(t.source) ?? []) l.add(e);
-			e.nodes[t.source]?.kind == "wait" && t.sourceHandle != "notification" && l.add(t.source);
-			for (let e of r.get(t.source) ?? []) c.add(e);
-			for (let r of n.get(t.source) ?? []) {
-				let n = t.sourceHandle == null || e.nodes[t.source]?.kind == "wait" && t.sourceHandle == "notification" ? r : {
-					...r,
-					[t.source]: t.sourceHandle
-				};
-				if (!u.some((e) => _u(e, n))) {
-					for (let e = u.length - 1; e >= 0; e--) _u(n, u[e]) && u.splice(e, 1);
-					u.push(n);
+	let o = bu(e), s = !0;
+	for (; s;) {
+		s = !1;
+		for (let t of o) {
+			let o = e.nodes[t], c = a.get(t) ?? [], l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Set(), d = [];
+			for (let t of c) {
+				l.add(t.source);
+				for (let e of i.get(t.source) ?? []) u.add(e);
+				e.nodes[t.source]?.kind == "wait" && t.sourceHandle != "notification" && u.add(t.source);
+				for (let e of r.get(t.source) ?? []) l.add(e);
+				for (let r of n.get(t.source) ?? []) {
+					let n = t.sourceHandle == null || e.nodes[t.source]?.kind == "wait" && t.sourceHandle == "notification" ? r : {
+						...r,
+						[t.source]: t.sourceHandle
+					};
+					if (!d.some((e) => Su(e, n))) {
+						for (let e = d.length - 1; e >= 0; e--) Su(n, d[e]) && d.splice(e, 1);
+						d.push(n);
+					}
 				}
 			}
+			let f = c.length == 0 ? "inputs" in o ? [{}] : [{ $trigger: t }] : d, p = n.get(t) ?? [];
+			(l.size != (r.get(t)?.size ?? 0) || u.size != (i.get(t)?.size ?? 0) || f.length != p.length || f.some((e) => !p.some((t) => Su(t, e) && Su(e, t)))) && (s = !0), r.set(t, l), i.set(t, u), n.set(t, f);
 		}
-		r.set(t, c), i.set(t, l), n.set(t, s.length == 0 ? "inputs" in o ? [{}] : [{ $trigger: t }] : u);
 	}
-	let o = {
+	let c = {
 		ancestors: r,
 		paths: n,
 		resolvedWaits: i
 	};
-	return gu.set(e, o), o;
+	return xu.set(e, c), c;
 }
-function bu(e, t, n) {
+function Tu(e, t, n) {
 	if (n.kind != "node") return [{}];
 	let r = e.nodes[n.nodeId], i = t.get(n.nodeId) ?? [];
 	return r?.kind == "condition" || r?.kind == "wait" && n.output != "notification" ? i.map((e) => ({
@@ -7464,66 +7589,69 @@ function bu(e, t, n) {
 		[n.nodeId]: n.output
 	})) : i;
 }
-function xu(e, t, n, r) {
+function Eu(e, t, n, r) {
 	if (n.kind == "value") return !0;
 	let { ancestors: i, paths: a } = r;
 	if (t != null && n.sources.some((e) => e.kind == "node" && !i.get(t)?.has(e.nodeId)) || t != null && n.sources.some((n) => n.kind == "node" && e.nodes[n.nodeId]?.kind == "wait" && n.output != "notification" && !r.resolvedWaits.get(t)?.has(n.nodeId))) return !1;
-	let o = n.sources.map((t) => bu(e, a, t)), s = t == null ? [{}] : a.get(t) ?? [];
-	for (let [e, t] of o.entries()) for (let n of o.slice(e + 1)) for (let e of t) for (let t of s) {
-		if (!vu(e, t)) continue;
-		let r = {
-			...t,
-			...e
-		};
-		if (n.some((e) => vu(e, r))) return !1;
+	let o = n.sources.map((t) => Tu(e, a, t)), s = t == null ? [{}] : a.get(t) ?? [];
+	for (let [e, r] of o.entries()) for (let [a, c] of o.slice(e + 1).entries()) {
+		let o = n.sources[e], l = n.sources[e + a + 1];
+		if (!(t != null && o.kind == "node" && l.kind == "node" && o.nodeId != l.nodeId && !i.get(o.nodeId)?.has(l.nodeId) && !i.get(l.nodeId)?.has(o.nodeId))) for (let e of r) for (let t of s) {
+			if (!Cu(e, t)) continue;
+			let n = {
+				...t,
+				...e
+			};
+			if (c.some((e) => Cu(e, n))) return !1;
+		}
 	}
 	return !0;
 }
-function Su(e, t, n, r, i) {
+function Du(e, t, n, r, i) {
 	let a = t.nodes[i.nodeId], o = t.nodes[n];
 	if (a == null) return { kind: "source-missing" };
 	if (o == null) return { kind: "not-ready" };
-	let s = mu(e, a)[i.output], c = fu(e, o)[r];
+	let s = yu(e, a)[i.output], c = _u(e, o)[r];
 	if (s == null) return { kind: "output-missing" };
 	if (c == null) return { kind: "not-ready" };
-	let l = yu(t);
+	let l = wu(t);
 	if (l.ancestors.get(n)?.has(i.nodeId) !== !0 || a.kind == "wait" && i.output != "notification" && !l.resolvedWaits.get(n)?.has(i.nodeId)) return { kind: "not-ready" };
-	let u = lu(s, c);
+	let u = uu(s, c);
 	return u.kind == "compatible" ? { kind: "available" } : u.kind == "incompatible" ? {
 		kind: "schema",
 		mismatch: u.mismatch
 	} : { kind: "schema-error" };
 }
-function Cu(e, t, n, r, i) {
-	let a = i.map((i) => Su(e, t, n, r, i));
+function Ou(e, t, n, r, i) {
+	let a = i.map((i) => Du(e, t, n, r, i));
 	return {
-		conflict: a.length > 1 && a.every((e) => e.kind == "available") && !xu(t, n, {
+		conflict: a.length > 1 && a.every((e) => e.kind == "available") && !Eu(t, n, {
 			kind: "sources",
 			sources: i.map((e) => ({
 				kind: "node",
 				...e
 			}))
-		}, yu(t)),
+		}, wu(t)),
 		sources: a
 	};
 }
-function wu(e, t, n, r) {
-	let i = yu(t);
+function ku(e, t, n, r) {
+	let i = wu(t);
 	return Object.fromEntries([...i.ancestors.get(n) ?? []].flatMap((a) => {
 		let o = t.nodes[a];
 		if (o == null) return [];
-		let s = Object.keys(mu(e, o)).filter((s) => xu(t, n, {
+		let s = Object.keys(yu(e, o)).filter((s) => Eu(t, n, {
 			kind: "sources",
 			sources: [{
 				kind: "node",
 				nodeId: a,
 				output: s
 			}]
-		}, i) && (r == null || uu(mu(e, o)[s], fu(e, t.nodes[n])[r])));
+		}, i) && (r == null || du(yu(e, o)[s], _u(e, t.nodes[n])[r])));
 		return s.length == 0 ? [] : [[a, s]];
 	}));
 }
-`${JSON.stringify("open-flow-engine/v4")}`, new Set([
+`${JSON.stringify("open-flow-engine/v5")}`, new Set([
 	"assert",
 	"assert/strict",
 	"buffer",
@@ -7548,7 +7676,7 @@ function wu(e, t, n, r) {
 	"url",
 	"util",
 	"zlib"
-].flatMap((e) => [e, `node:${e}`])), `${JSON.stringify("open-flow-engine/v4/nodejs-compat-v1")}`;
+].flatMap((e) => [e, `node:${e}`])), `${JSON.stringify("open-flow-engine/v5/nodejs-compat-v1")}`;
 //#endregion
 //#region src/flow/common/agent.ts
 var Q = jt(() => Wt([Nt(), At({
@@ -7593,7 +7721,7 @@ var Q = jt(() => Wt([Nt(), At({
 			return !1;
 		}
 	}, "Invalid regular expression.").optional(),
-	format: j().refine((e) => Object.hasOwn(wo, e), "Unsupported string format.").optional(),
+	format: j().refine((e) => Object.hasOwn(Eo, e), "Unsupported string format.").optional(),
 	multipleOf: Pt().positive().optional(),
 	uniqueItems: Nt().optional(),
 	contains: Q.optional(),
@@ -7640,11 +7768,11 @@ var Q = jt(() => Wt([Nt(), At({
 }).transform(({ title: e, default: t, examples: n, readOnly: r, writeOnly: i, deprecated: a, $comment: o, ...s }) => s)]));
 //#endregion
 //#region src/flow/common/semantics.ts
-function Tu(e) {
+function Au(e) {
 	return Object.keys(e).toSorted().map((t) => [t, e[t]]);
 }
-function Eu(e, t) {
-	if (t != null) return Eu(Du(e, t));
+function ju(e, t) {
+	if (t != null) return ju(Mu(e, t));
 	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set(), o = /* @__PURE__ */ new Set();
 	function s(e) {
 		n.add(e);
@@ -7659,7 +7787,7 @@ function Eu(e, t) {
 		for (let t of Object.values(e)) if (t.kind == "sources") for (let e of t.sources) e.kind == "binding" && (r.add(e.bindingId), s(e.bindingId));
 	}
 	function u(t) {
-		for (let [, n] of Tu(t.nodes)) switch ("inputs" in n && l(n.inputs), n.kind) {
+		for (let [, n] of Au(t.nodes)) switch ("inputs" in n && l(n.inputs), n.kind) {
 			case "condition": break;
 			case "subflow":
 				d(n.subflowId);
@@ -7692,7 +7820,7 @@ function Eu(e, t) {
 		tasks: o
 	};
 }
-function Du(e, t) {
+function Mu(e, t) {
 	let n = e.document.graph, r = /* @__PURE__ */ new Set([t]);
 	for (let e of r) for (let t of n.edges) t.source == e && r.add(t.target);
 	function i(e, t) {
@@ -7721,7 +7849,7 @@ function Du(e, t) {
 				edges: n.edges.filter((e) => r.has(e.source))
 			}
 		}
-	}, { bindings: s } = Eu(o);
+	}, { bindings: s } = ju(o);
 	return {
 		...o,
 		document: {
@@ -7730,7 +7858,7 @@ function Du(e, t) {
 		}
 	};
 }
-function Ou(e) {
+function Nu(e) {
 	return Object.values(e.tasks).flatMap((t) => {
 		if (t.executor.kind != "agent") return [];
 		let n = t.executor.notification == null ? void 0 : e.tasks[t.executor.notification.taskId]?.executor;
@@ -7741,12 +7869,12 @@ function Ou(e) {
 		}));
 	});
 }
-function ku(e) {
+function Pu(e) {
 	return [e.graph, ...Object.values(e.subflows).map((e) => e.graph)].flatMap((e) => Object.values(e.nodes).flatMap((e) => e.kind == "task" && e.task != null ? e.task.capabilities ?? [] : []));
 }
 //#endregion
 //#region src/workbench/browser/runtime/revisionView.ts
-var Au = /* @__PURE__ */ new WeakMap(), ju = class {
+var Fu = /* @__PURE__ */ new WeakMap(), Iu = class {
 	#e;
 	#t;
 	#n = /* @__PURE__ */ new WeakMap();
@@ -7756,7 +7884,7 @@ var Au = /* @__PURE__ */ new WeakMap(), ju = class {
 		this.revision = e, this.#e = e.content.document, this.#t = e.content.modules;
 		let t = /* @__PURE__ */ new Set();
 		for (let e of Object.values(this.#e.tasks)) e.executor.kind == "connector" && t.add(e.executor.action);
-		for (let e of [...ku(this.#e), ...Ou(this.#e)]) t.add(e.action);
+		for (let e of [...Pu(this.#e), ...Nu(this.#e)]) t.add(e.action);
 		this.connectorActionIds = t;
 	}
 	subflow(e) {
@@ -7775,8 +7903,8 @@ var Au = /* @__PURE__ */ new WeakMap(), ju = class {
 			conflict: !1,
 			sources: []
 		} : void 0, d, f = {
-			check: () => u ??= Cu(this.#e, r, t, n, l),
-			candidates: () => d ??= wu(this.#e, r, t, n)
+			check: () => u ??= Ou(this.#e, r, t, n, l),
+			candidates: () => d ??= ku(this.#e, r, t, n)
 		};
 		return i ?? this.#r.set(r, i = /* @__PURE__ */ new Map()), i.set(a, f), f;
 	}
@@ -7898,13 +8026,13 @@ var Au = /* @__PURE__ */ new WeakMap(), ju = class {
 		return !1;
 	}
 };
-function Mu(e) {
-	let t = Au.get(e);
-	return t ?? (t = new ju(e), Au.set(e, t)), t;
+function Lu(e) {
+	let t = Fu.get(e);
+	return t ?? (t = new Iu(e), Fu.set(e, t)), t;
 }
 //#endregion
 //#region src/workbench/browser/runtime/runs/runStore.ts
-var Nu = {
+var Ru = {
 	eventCursor: 0,
 	eventFilter: "all",
 	events: [],
@@ -7919,33 +8047,33 @@ var Nu = {
 	resolvingActions: /* @__PURE__ */ new Map(),
 	runById: /* @__PURE__ */ new Map(),
 	runIds: []
-}, Pu = 100, Fu = 500, Iu = 1200, Lu = 6e4;
-function Ru(e) {
+}, zu = 100, Bu = 500, Vu = 1200, Hu = 6e4;
+function Uu(e) {
 	return e?.status == "queued" || e?.status == "starting" || e?.status == "running" || e?.status == "waiting";
 }
-function zu(e) {
+function Wu(e) {
 	return e.selectedRunId == null ? void 0 : e.runById.get(e.selectedRunId);
 }
-function Bu(e, t) {
-	let n = new Map(t.map((e) => [e.runId, e])), r = t.map((e) => e.runId), i = zu(e);
+function Gu(e, t) {
+	let n = new Map(t.map((e) => [e.runId, e])), r = t.map((e) => e.runId), i = Wu(e);
 	return i != null && (n.has(i.runId) || r.unshift(i.runId), n.set(i.runId, i)), {
 		runById: n,
 		runIds: r
 	};
 }
-function Vu(e, t) {
+function Ku(e, t) {
 	return new Map(e.runById).set(t.runId, t);
 }
-var Hu = class {
+var qu = class {
 	#e = new oo();
 	#t;
 	#n;
 	#r = new oo();
 	#i = new oo();
 	#a;
-	#o = n(Nu);
+	#o = n(Ru);
 	#s;
-	constructor(t, n, i = xt()) {
+	constructor(t, n, i = yt()) {
 		this.#t = t, this.#n = i, this.#a = n, this.$ = {
 			cancelingRunId: e(this.#o, (e) => e.cancelingRunId),
 			eventFilter: e(this.#o, (e) => e.eventFilter),
@@ -7962,7 +8090,7 @@ var Hu = class {
 			refreshing: e(this.#o, (e) => e.refreshing),
 			result: e(this.#o, (e) => e.result),
 			resolvingActions: e(this.#o, (e) => e.resolvingActions),
-			run: e(this.#o, zu),
+			run: e(this.#o, Wu),
 			runs: e(this.#o, (e) => e.runIds.flatMap((t) => {
 				let n = e.runById.get(t);
 				return n == null ? [] : [n];
@@ -7975,7 +8103,7 @@ var Hu = class {
 		this.#o.dispose();
 	}
 	reset() {
-		this.#e.invalidate(), this.#r.invalidate(), this.#i.invalidate(), this.#f(), this.#o.set(Nu);
+		this.#e.invalidate(), this.#r.invalidate(), this.#i.invalidate(), this.#f(), this.#o.set(Ru);
 	}
 	async load(e) {
 		let t = this.#o.value, n = t.loaded && t.target?.flowId == e, r = this.#r.begin();
@@ -7990,7 +8118,7 @@ var Hu = class {
 				let t = await this.#t.listRuns(e, { limit: 50 });
 				if (!r() || this.#o.value.target?.flowId != e) return;
 				this.#p({
-					...Bu(this.#o.value, t.runs),
+					...Gu(this.#o.value, t.runs),
 					nextCursor: t.nextCursor,
 					refreshing: !1
 				});
@@ -8001,9 +8129,9 @@ var Hu = class {
 			return;
 		}
 		this.#i.invalidate(), this.#f();
-		let i = zu(t)?.flowId == e ? t.cancelingRunId : void 0;
+		let i = Wu(t)?.flowId == e ? t.cancelingRunId : void 0;
 		t.cancelingRunId != null && i == null && this.#e.invalidate(), this.#o.set({
-			...Nu,
+			...Ru,
 			...i == null ? {} : { cancelingRunId: i },
 			eventFilter: t.eventFilter,
 			loading: !0,
@@ -8013,7 +8141,7 @@ var Hu = class {
 			let t = await this.#t.listRuns(e, { limit: 50 });
 			if (!r()) return;
 			this.#p({
-				...Bu(this.#o.value, t.runs),
+				...Gu(this.#o.value, t.runs),
 				loaded: !0,
 				loadFailed: !1,
 				loading: !1,
@@ -8073,7 +8201,7 @@ var Hu = class {
 		e != null && await this.load(e.flowId);
 	}
 	retryObservation() {
-		let e = zu(this.#o.value);
+		let e = Wu(this.#o.value);
 		if (e == null) return;
 		let t = this.#i.begin();
 		this.#f(), this.#p({ observationFailed: !1 }), this.#l(e, t);
@@ -8082,8 +8210,8 @@ var Hu = class {
 		this.#p({ eventFilter: e });
 	}
 	async cancel() {
-		let e = zu(this.#o.value);
-		if (!Ru(e) || this.#o.value.cancelingRunId != null || this.#o.value.resolvingActions.size > 0) return;
+		let e = Wu(this.#o.value);
+		if (!Uu(e) || this.#o.value.cancelingRunId != null || this.#o.value.resolvingActions.size > 0) return;
 		let t = this.#e.begin();
 		this.#p({ cancelingRunId: e.runId });
 		try {
@@ -8095,7 +8223,7 @@ var Hu = class {
 				...i,
 				status: n.status
 			};
-			if (this.#p({ runById: Vu(r, a) }), r.selectedRunId != e.runId) return;
+			if (this.#p({ runById: Ku(r, a) }), r.selectedRunId != e.runId) return;
 			let o = this.#i.begin();
 			this.#f(), await this.#l(a, o);
 		} catch (e) {
@@ -8105,18 +8233,18 @@ var Hu = class {
 		}
 	}
 	async resolve(e, t) {
-		let n = zu(this.#o.value), r = n != null && "waits" in n ? n.waits.find((t) => t.waitId == e) : void 0;
+		let n = Wu(this.#o.value), r = n != null && "waits" in n ? n.waits.find((t) => t.waitId == e) : void 0;
 		if (!(n == null || r == null || this.#o.value.cancelingRunId != null || this.#o.value.resolvingActions.has(e) || !r.actions.some((e) => e == t))) {
 			this.#p({ resolvingActions: new Map(this.#o.value.resolvingActions).set(e, t) });
 			try {
-				let i = await this.#t.resolveRunWait(n.runId, r.waitId, t), a = this.#o.value, o = zu(a);
+				let i = await this.#t.resolveRunWait(n.runId, r.waitId, t), a = this.#o.value, o = Wu(a);
 				if (o?.runId != n.runId || !("waits" in o)) return;
 				let s = {
 					...o,
 					waits: o.waits.filter((t) => t.waitId != e),
 					status: i.status
 				};
-				this.#p({ runById: Vu(a, s) }), this.retryObservation();
+				this.#p({ runById: Ku(a, s) }), this.retryObservation();
 				let c = this.#o.value.target;
 				c != null && this.#u(c.flowId);
 			} catch (e) {
@@ -8150,7 +8278,7 @@ var Hu = class {
 			externalRunId: void 0,
 			loaded: !0,
 			result: void 0,
-			runById: Vu(n, e),
+			runById: Ku(n, e),
 			runIds: [e.runId, ...n.runIds.filter((t) => t != e.runId)],
 			selectedRunId: e.runId,
 			target: { flowId: e.flowId }
@@ -8173,7 +8301,7 @@ var Hu = class {
 			observationFailed: !1,
 			resolvingActions: /* @__PURE__ */ new Map(),
 			result: void 0,
-			runById: Vu(n, e),
+			runById: Ku(n, e),
 			selectedRunId: e.runId
 		}), this.#l(e, t);
 	}
@@ -8185,7 +8313,7 @@ var Hu = class {
 				let a = this.#o.value.eventCursor, [o, s] = yield* an.tryPromise({
 					try: (t) => Promise.allSettled([this.#t.getRun(e.runId, t), this.#t.getRunEvents(e.runId, {
 						after: a,
-						limit: Pu
+						limit: zu
 					}, t)]),
 					catch: (e) => e
 				});
@@ -8197,7 +8325,7 @@ var Hu = class {
 					this.#p({
 						eventsExpiresAt: void 0,
 						historyComplete: !1,
-						runById: Vu(this.#o.value, c)
+						runById: Ku(this.#o.value, c)
 					}), yield* an.tryPromise({
 						try: (e) => this.#d(c, t, e),
 						catch: (e) => e
@@ -8210,14 +8338,14 @@ var Hu = class {
 					events: [...this.#o.value.events, ...l.events],
 					eventsExpiresAt: l.eventsExpiresAt,
 					historyComplete: l.historyComplete,
-					runById: Vu(this.#o.value, c)
+					runById: Ku(this.#o.value, c)
 				}), yield* an.tryPromise({
 					try: (e) => this.#d(c, t, e),
 					catch: (e) => e
 				}), yield* on.succeed(n, void 0), vr(c.status) && l.done) return;
 				let u = c.status == "queued" || c.status == "starting";
 				i = u && c.status == r.status ? i + 1 : 0;
-				let d = vr(c.status) || l.events.length == Pu ? 0 : c.status == "waiting" ? Lu : u ? Math.min(Iu, Fu * 2 ** Math.max(0, i - 1)) : Iu;
+				let d = vr(c.status) || l.events.length == zu ? 0 : c.status == "waiting" ? Hu : u ? Math.min(Vu, Bu * 2 ** Math.max(0, i - 1)) : Vu;
 				r = c, yield* an.sleep(d);
 			}
 		}).pipe(an.catch((n) => an.sync(() => {
@@ -8234,7 +8362,7 @@ var Hu = class {
 			let n = await this.#t.listRuns(e, { limit: 50 });
 			if (!t() || this.#o.value.target?.flowId != e) return;
 			this.#p({
-				...Bu(this.#o.value, n.runs),
+				...Gu(this.#o.value, n.runs),
 				loaded: !0,
 				loadingMore: !1,
 				nextCursor: n.nextCursor,
@@ -8258,7 +8386,7 @@ var Hu = class {
 			...e
 		});
 	}
-}, Uu = {
+}, Ju = {
 	"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",
@@ -8549,6 +8677,7 @@ var Hu = class {
 	ipgeolocation_io: "https://static.oomol.com/logo/third-party/ipgeolocation_io.svg",
 	openalex: "https://static.oomol.com/logo/third-party/openalex.svg",
 	orcid: "https://static.oomol.com/logo/third-party/orcid.svg",
+	orimon: "https://static.oomol.com/logo/third-party/orimon.svg",
 	mendeley: "https://static.oomol.com/logo/third-party/mendeley.svg",
 	crossref: "https://static.oomol.com/logo/third-party/crossref.svg",
 	datacite: "https://static.oomol.com/logo/third-party/datacite.svg",
@@ -8861,6 +8990,7 @@ var Hu = class {
 	myotp_app: "https://static.oomol.com/logo/third-party/myotp_app.png",
 	"fusion-api": "https://static.oomol.com/logo/logo.png",
 	oomol_console: "https://static.oomol.com/logo/third-party/oomol_console.svg",
+	oomol_rag: "https://static.oomol.com/logo/third-party/oomol_rag.svg",
 	indeed: "https://static.oomol.com/logo/third-party/indeed.svg",
 	pi_hole: "https://static.oomol.com/logo/third-party/pi_hole.svg",
 	firecrawl: "https://static.oomol.com/logo/third-party/Firecrawl.svg",
@@ -9771,25 +9901,25 @@ var Hu = class {
 	speedtest_tracker: "https://static.oomol.com/logo/third-party/speedtest_tracker.png",
 	bloomerang: "https://static.oomol.com/logo/third-party/bloomerang.png",
 	coupontools: "https://static.oomol.com/logo/third-party/coupontools.png"
-}, Wu = {
+}, Yu = {
 	img: "ContentIcon_img_eb462",
 	initials: "ContentIcon_initials_eb462"
-}, Gu = {
+}, Xu = {
 	icon: "IconifyIcon_icon_e957a",
 	external: "IconifyIcon_external_e957a"
 };
 //#endregion
 //#region ../../node_modules/.bun/@iconify+utils@3.1.4/node_modules/@iconify/utils/lib/svg/url.js
-function Ku(e) {
+function Zu(e) {
 	return e.replace(/"/g, "'").replace(/%/g, "%25").replace(/#/g, "%23").replace(/</g, "%3C").replace(/>/g, "%3E").replace(/\s+/g, " ");
 }
 //#endregion
 //#region ../../node_modules/.bun/@iconify+utils@3.1.4/node_modules/@iconify/utils/lib/svg/encode-svg-for-css.js
-function qu(e) {
+function Qu(e) {
 	let t = e.startsWith("<svg>") ? e.replace("<svg>", "<svg >") : e;
-	return !t.includes(" xmlns:xlink=") && t.includes(" xlink:") && (t = t.replace("<svg ", "<svg xmlns:xlink=\"http://www.w3.org/1999/xlink\" ")), t.includes(" xmlns=") || (t = t.replace("<svg ", "<svg xmlns=\"http://www.w3.org/2000/svg\" ")), Ku(t);
+	return !t.includes(" xmlns:xlink=") && t.includes(" xlink:") && (t = t.replace("<svg ", "<svg xmlns:xlink=\"http://www.w3.org/1999/xlink\" ")), t.includes(" xmlns=") || (t = t.replace("<svg ", "<svg xmlns=\"http://www.w3.org/2000/svg\" ")), Zu(t);
 }
-var Ju = {
+var $u = {
 	"skill-icons": {
 		prefix: "skill-icons",
 		icons: {
@@ -9805,29 +9935,29 @@ var Ju = {
 		width: 36,
 		height: 36
 	}
-}, Yu = null, Xu = /* @__PURE__ */ new Map();
-function Zu(e) {
-	let t = Xu.get(e);
+}, ed = null, td = /* @__PURE__ */ new Map();
+function nd(e) {
+	let t = td.get(e);
 	return t || (t = (e == "carbon" ? import("./carbon-Cn-DTyjG.js").then(({ default: e }) => ({
 		icons: e,
 		chars: {},
 		info: e.info,
 		metadata: { categories: e.categories }
 	})) : import("./_virtual_open-flow-twemoji-CpHJOEsk.js").then((e) => e.default)).catch((t) => {
-		throw Xu.delete(e), t;
-	}), Xu.set(e, t)), t;
+		throw td.delete(e), t;
+	}), td.set(e, t)), t;
 }
-var Qu = Xt(null), $u = ({ children: e }) => {
-	let [t, n] = F(Yu), r = rn(!0), i = Zt(async (e) => {
-		if (Yu?.[e]) {
-			r.current && n(Yu);
+var rd = Xt(null), id = ({ children: e }) => {
+	let [t, n] = F(ed), r = rn(!0), i = Zt(async (e) => {
+		if (ed?.[e]) {
+			r.current && n(ed);
 			return;
 		}
-		let t = await Zu(e);
-		Yu = {
-			...Yu,
+		let t = await nd(e);
+		ed = {
+			...ed,
 			[e]: t
-		}, r.current && n(Yu);
+		}, r.current && n(ed);
 	}, []);
 	$t(() => (r.current = !0, () => {
 		r.current = !1;
@@ -9836,24 +9966,24 @@ var Qu = Xt(null), $u = ({ children: e }) => {
 		data: t,
 		loadCollection: i
 	}), [t, i]);
-	return /* @__PURE__ */ M(Qu.Provider, {
+	return /* @__PURE__ */ M(rd.Provider, {
 		value: a,
 		children: e
 	});
 };
-function ed() {
-	return Qt(Qu)?.data ?? null;
+function ad() {
+	return Qt(rd)?.data ?? null;
 }
-function td() {
-	return Qt(Qu)?.loadCollection;
+function od() {
+	return Qt(rd)?.loadCollection;
 }
 //#endregion
 //#region src/ui/browser/icons/IconifyIcon.tsx
-function nd(e) {
+function sd(e) {
 	return e == "carbon" || e == "twemoji";
 }
-var rd = ({ collection: e, icon: t, color: n, className: r, onError: i }) => {
-	let a = ed(!0), o = td(), s = nd(e) ? e : void 0, c = s != null && !a?.[s];
+var cd = ({ collection: e, icon: t, color: n, className: r, onError: i }) => {
+	let a = ad(!0), o = od(), s = sd(e) ? e : void 0, c = s != null && !a?.[s];
 	$t(() => {
 		c && s && o?.(s).catch((e) => i?.(e));
 	}, [
@@ -9862,52 +9992,52 @@ var rd = ({ collection: e, icon: t, color: n, className: r, onError: i }) => {
 		o,
 		i
 	]);
-	let l = nn(() => dd(e, t, void 0, a), [
+	let l = nn(() => gd(e, t, void 0, a), [
 		a,
 		e,
 		t
 	]);
-	return l ? /* @__PURE__ */ M(ud, {
+	return l ? /* @__PURE__ */ M(hd, {
 		url: l,
 		collection: e,
 		icon: t,
 		color: n,
 		className: r
-	}) : c ? /* @__PURE__ */ M("i", {}) : /* @__PURE__ */ M(id, {
+	}) : c ? /* @__PURE__ */ M("i", {}) : /* @__PURE__ */ M(ld, {
 		collection: e,
 		icon: t,
 		color: n,
 		className: r,
 		onError: i
 	});
-}, id = ({ collection: e, icon: t, color: n, className: r, onError: i }) => {
+}, ld = ({ collection: e, icon: t, color: n, className: r, onError: i }) => {
 	let [a, o] = F(void 0);
 	return tn(() => {
 		let n = !1;
-		return sd(e, t).then((e) => {
-			n || o(fd(e.width, e.height, e));
+		return fd(e, t).then((e) => {
+			n || o(_d(e.width, e.height, e));
 		}).catch((e) => {
 			n || (o(void 0), i?.(e));
 		}), () => {
 			n = !0;
 		};
 	}, [e, t]), a ? /* @__PURE__ */ M("i", {
-		className: A(r, Gu.icon, !a.includes("currentColor") && "is-colored"),
+		className: A(r, Xu.icon, !a.includes("currentColor") && "is-colored"),
 		style: {
 			color: n,
 			"--icon": `url("${a}")`
 		}
 	}) : /* @__PURE__ */ M("i", {});
-}, ad = /* @__PURE__ */ new Map(), od = /* @__PURE__ */ new Map(), sd = (e, t) => {
-	let n = `${e}:${t}`, r = ad.get(n);
+}, ud = /* @__PURE__ */ new Map(), dd = /* @__PURE__ */ new Map(), fd = (e, t) => {
+	let n = `${e}:${t}`, r = ud.get(n);
 	if (r) return Promise.resolve(r);
-	let i = od.get(n);
+	let i = dd.get(n);
 	if (i) return i;
-	let a = ld(e, t).then((e) => (ad.set(n, e), e)).finally(() => od.delete(n));
-	return od.set(n, a), a;
-}, cd = new URL("https://api.iconify.design/codicon.json?icons=close"), ld = async (e, t) => {
-	cd.pathname = `/${e}.json`, cd.searchParams.set("icons", t);
-	let n = await fetch(cd.href);
+	let a = md(e, t).then((e) => (ud.set(n, e), e)).finally(() => dd.delete(n));
+	return dd.set(n, a), a;
+}, pd = new URL("https://api.iconify.design/codicon.json?icons=close"), md = async (e, t) => {
+	pd.pathname = `/${e}.json`, pd.searchParams.set("icons", t);
+	let n = await fetch(pd.href);
 	if (!n.ok) throw Error(`Failed to fetch ${e}:${t}: ${n.statusText}. Status: ${n.status}`);
 	let r = await n.json();
 	if (typeof r == "number") throw Error(`Failed to fetch ${e}:${t}: ${n.statusText}. Status: ${r}`);
@@ -9918,53 +10048,53 @@ var rd = ({ collection: e, icon: t, color: n, className: r, onError: i }) => {
 		i.width ||= e, i.height ||= t;
 	}
 	return i;
-}, ud = ({ url: e, color: t, className: n }) => /* @__PURE__ */ M("i", {
-	className: A(n, Gu.icon, !e.includes("currentColor") && "is-colored"),
+}, hd = ({ url: e, color: t, className: n }) => /* @__PURE__ */ M("i", {
+	className: A(n, Xu.icon, !e.includes("currentColor") && "is-colored"),
 	style: {
 		color: t,
 		"--icon": `url("${e}")`
 	}
-}), dd = (e, t, n, r) => {
-	r ||= Yu;
+}), gd = (e, t, n, r) => {
+	r ||= ed;
 	let i, a;
 	if (r) {
 		let n = r[e];
 		n && (a = n.icons, i = a.icons[t]);
 	}
-	if (a || (a = Ju[e], i = a && a.icons[t]), !i) {
-		let r = ad.get(`${e}:${t}`);
-		if (r) return fd(r.width, r.height, r, n);
+	if (a || (a = $u[e], i = a && a.icons[t]), !i) {
+		let r = ud.get(`${e}:${t}`);
+		if (r) return _d(r.width, r.height, r, n);
 	}
-	if (i && a) return fd(i.width || a.width, i.height || a.height, i, n);
+	if (i && a) return _d(i.width || a.width, i.height || a.height, i, n);
 };
-function fd(e, t, n, r) {
+function _d(e, t, n, r) {
 	e ||= 16, t ||= 16;
 	let i = `<svg xmlns="http://www.w3.org/2000/svg" viewBox="${`0 0 ${e} ${t}`}" width="1em" height="1em">${n.body}</svg>`;
-	return r && (i = i.replace(/currentColor/g, r)), `data:image/svg+xml;utf8,${qu(i)}`;
+	return r && (i = i.replace(/currentColor/g, r)), `data:image/svg+xml;utf8,${Qu(i)}`;
 }
 //#endregion
 //#region src/ui/browser/icons/ContentIcon.tsx
-var pd = ({ src: e, className: t, fallback: n = null, loading: r = "lazy", decoding: i = "async" }) => {
-	let a = nn(() => vd(e), [e]), o = a?.source ?? e, s = nn(() => yd(o), [o]), [c, l] = F(), u = () => l(o);
-	return o?.startsWith(md) ? /* @__PURE__ */ M("span", {
+var vd = ({ src: e, className: t, fallback: n = null, loading: r = "lazy", decoding: i = "async" }) => {
+	let a = nn(() => Cd(e), [e]), o = a?.source ?? e, s = nn(() => wd(o), [o]), [c, l] = F(), u = () => l(o);
+	return o?.startsWith(yd) ? /* @__PURE__ */ M("span", {
 		"data-icon-kind": "initials",
 		"aria-hidden": "true",
-		className: A(Wu.initials, t),
-		children: /* @__PURE__ */ M("span", { children: o.slice(md.length) })
-	}) : o ? o === c ? a == null ? n : /* @__PURE__ */ M(pd, {
+		className: A(Yu.initials, t),
+		children: /* @__PURE__ */ M("span", { children: o.slice(yd.length) })
+	}) : o ? o === c ? a == null ? n : /* @__PURE__ */ M(vd, {
 		className: t,
 		fallback: n,
 		src: a.fallback,
 		loading: r,
 		decoding: i
-	}) : s ? /* @__PURE__ */ M(rd, {
+	}) : s ? /* @__PURE__ */ M(cd, {
 		collection: s.collection,
 		icon: s.icon,
 		color: s.color,
 		className: t,
 		onError: u
 	}) : /* @__PURE__ */ M("img", {
-		className: A(Wu.img, t),
+		className: A(Yu.img, t),
 		src: o,
 		alt: "",
 		decoding: i,
@@ -9972,19 +10102,19 @@ var pd = ({ src: e, className: t, fallback: n = null, loading: r = "lazy", decod
 		referrerPolicy: "no-referrer",
 		onError: u
 	}) : n;
-}, md = "data:application/vnd.open-flow.initials,";
-function hd(e) {
-	return `${md}${e}`;
+}, yd = "data:application/vnd.open-flow.initials,";
+function bd(e) {
+	return `${yd}${e}`;
 }
-var gd = "data:application/vnd.open-flow.image-icon+json,";
-function _d(e, t) {
-	return `${gd}${encodeURIComponent(JSON.stringify({
+var xd = "data:application/vnd.open-flow.image-icon+json,";
+function Sd(e, t) {
+	return `${xd}${encodeURIComponent(JSON.stringify({
 		fallback: t,
 		source: e
 	}))}`;
 }
-function vd(e) {
-	if (e?.startsWith(gd)) try {
+function Cd(e) {
+	if (e?.startsWith(xd)) try {
 		let t = JSON.parse(decodeURIComponent(e.slice(47)));
 		if (typeof t.fallback == "string" && typeof t.source == "string") return {
 			fallback: t.fallback,
@@ -9994,7 +10124,7 @@ function vd(e) {
 		return;
 	}
 }
-function yd(e) {
+function wd(e) {
 	if (e && e.length > 2 && e[0] === ":" && e.endsWith(":")) {
 		let [, t, n, r] = e.split(":");
 		if (t && n) return {
@@ -10007,22 +10137,22 @@ function yd(e) {
 }
 //#endregion
 //#region src/workbench/browser/runtime/providerIcon.ts
-function bd(e, t = Uu) {
-	let n = hd(Sd(e.serviceName)), r = xd(e, t);
-	return r == null ? n : _d(r, n);
+function Td(e, t = Ju) {
+	let n = bd(Dd(e.serviceName)), r = Ed(e, t);
+	return r == null ? n : Sd(r, n);
 }
-function xd(e, t = Uu) {
+function Ed(e, t = Ju) {
 	let n = e.icon?.trim();
 	if (n) return n;
 	let r = t[e.serviceId]?.trim();
 	if (r) return r;
-	let i = Cd(e.homepageUrl);
+	let i = Od(e.homepageUrl);
 	return i == null ? void 0 : `https://www.google.com/s2/favicons?sz=64&domain=${encodeURIComponent(i)}`;
 }
-function Sd(e) {
+function Dd(e) {
 	return e.split(/\s+/).map((e) => e[0]).join("").slice(0, 2).toUpperCase() || "?";
 }
-function Cd(e) {
+function Od(e) {
 	if (e) try {
 		return new URL(e).hostname || void 0;
 	} catch {
@@ -10031,14 +10161,14 @@ function Cd(e) {
 }
 //#endregion
 //#region src/workbench/browser/runtime/workspace.ts
-function wd(e, t) {
-	let n = e.authenticated && t != null ? Td(t).preferred : void 0;
+function kd(e, t) {
+	let n = e.authenticated && t != null ? Ad(t).preferred : void 0;
 	return {
 		...e,
 		...n == null ? {} : { defaultConnection: n }
 	};
 }
-function Td(e) {
+function Ad(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 {
@@ -10048,7 +10178,7 @@ function Td(e) {
 		preferred: r ?? (t.length == 1 ? t[0] : void 0)
 	};
 }
-function Ed(e, t) {
+function jd(e, t) {
 	if (e.node.name != null) return e.node.name;
 	switch (e.kind) {
 		case "condition": return t?.("addNode.condition") ?? "Condition";
@@ -10058,7 +10188,7 @@ function Ed(e, t) {
 		case "task": return e.definition?.name ?? (e.node.task == null ? e.node.taskId : e.node.task.moduleId);
 	}
 }
-function Dd(e) {
+function Md(e) {
 	switch (e.kind) {
 		case "condition": return ":carbon:child-node:";
 		case "subflow": return ":carbon:subflow:";
@@ -10073,43 +10203,43 @@ function Dd(e) {
 function $(e) {
 	if (!(typeof e != "object" || !e || Array.isArray(e))) return e;
 }
-function Od(e) {
+function Nd(e) {
 	return typeof e == "number" && Number.isFinite(e) ? e : void 0;
 }
-function kd(e, t) {
+function Pd(e, t) {
 	let n = $(e.designer);
-	if (n?.version == 1) return $d(n, t);
+	if (n?.version == 1) return af(n, t);
 }
-function Ad(e, t) {
+function Fd(e, t) {
 	return ((e) => Object.fromEntries(Object.entries($(e) ?? {}).flatMap(([e, t]) => {
-		let n = $(t), r = Od(n?.x), i = Od(n?.y);
+		let n = $(t), r = Nd(n?.x), i = Nd(n?.y);
 		return r == null || i == null ? [] : [[e, {
 			x: r,
 			y: i
 		}]];
-	})))(kd(e, t)?.nodes);
+	})))(Pd(e, t)?.nodes);
 }
-function jd(e, t) {
-	let n = Ad(e, t), r = kd(e, t)?.order, i = Array.isArray(r) ? r.flatMap((e) => typeof e == "string" && n[e] != null ? [e] : []) : [];
+function Id(e, t) {
+	let n = Fd(e, t), r = Pd(e, t)?.order, i = Array.isArray(r) ? r.flatMap((e) => typeof e == "string" && n[e] != null ? [e] : []) : [];
 	return [.../* @__PURE__ */ new Set([...i, ...Object.keys(n)])];
 }
-function Md(e, t) {
-	let n = $(kd(e, t)?.viewport), r = Od(n?.x), i = Od(n?.y), a = Od(n?.zoom);
+function Ld(e, t) {
+	let n = $(Pd(e, t)?.viewport), r = Nd(n?.x), i = Nd(n?.y), a = Nd(n?.zoom);
 	return r == null || i == null || a == null || a <= 0 ? void 0 : {
 		x: r,
 		y: i,
 		zoom: a
 	};
 }
-function Nd(e, t) {
-	return Md(e, t) ?? {
+function Rd(e, t) {
+	return Ld(e, t) ?? {
 		x: 0,
 		y: 0,
 		zoom: 1
 	};
 }
-function Pd(e, t, n) {
-	let r = $(kd(e, t)?.comments) ?? {};
+function zd(e, t, n) {
+	let r = $(Pd(e, t)?.comments) ?? {};
 	return Object.fromEntries(Object.entries(r).flatMap(([e, t]) => {
 		let r = $(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, {
@@ -10122,7 +10252,7 @@ function Pd(e, t, n) {
 		}]];
 	}));
 }
-function Fd(e, t, n, r) {
+function Bd(e, t, n, r) {
 	return JSON.stringify([
 		e,
 		t,
@@ -10130,13 +10260,10 @@ function Fd(e, t, n, r) {
 		r
 	]);
 }
-function Id(e) {
+function Vd(e) {
 	if (e.kind == "trigger") return {
 		inputs: /* @__PURE__ */ new Map(),
-		outputs: /* @__PURE__ */ new Map([["payload", {
-			jsonSchema: eu(e.trigger),
-			nullable: !1
-		}]])
+		outputs: new Map(Object.entries(gu(e.trigger)))
 	};
 	let t = new Map(Object.keys(e.node.inputs).map((e) => [e, {}])), n = /* @__PURE__ */ new Map();
 	switch (e.kind) {
@@ -10171,7 +10298,7 @@ function Id(e) {
 				jsonSchema: e.node.input.jsonSchema,
 				nullable: e.node.input.nullable
 			});
-			for (let [t, r] of Object.entries(pu(e.node))) n.set(t, r);
+			for (let [t, r] of Object.entries(vu(e.node))) n.set(t, r);
 			break;
 		case "subflow": {
 			let r = e.definition;
@@ -10217,7 +10344,7 @@ function Id(e) {
 		outputs: n
 	};
 }
-function Ld(e) {
+function Hd(e) {
 	switch (e) {
 		case "endsWith": return "ends with";
 		case "hasKey": return "has key";
@@ -10241,7 +10368,7 @@ function Ld(e) {
 		case "contains": return e;
 	}
 }
-function Rd(e, t, n) {
+function Ud(e, t, n) {
 	let r = e.kind == "flow" ? `/document/graph/nodes/${t.id}` : `/document/subflows/${e.id}/graph/nodes/${t.id}`, i = [r];
 	if (t.kind == "task") {
 		t.node.task == null ? i.push(`/document/tasks/${t.node.taskId}`) : i.push(`${r}/task`);
@@ -10250,7 +10377,7 @@ function Rd(e, t, n) {
 	} else t.kind == "subflow" && i.push(`/document/subflows/${t.node.subflowId}`);
 	return n.filter((e) => i.some((t) => e.path.startsWith(t))).length;
 }
-function zd(e, t, n, r) {
+function Wd(e, t, n, r) {
 	if (t.kind != "flow" || n?.flowId != e.revision.flowId || n.revisionId != e.revision.revisionId) return { nodes: /* @__PURE__ */ new Map() };
 	let i = n.status == "queued" || n.status == "starting" || n.status == "running" || n.status == "waiting", a = /* @__PURE__ */ new Map();
 	if ("waits" in n) for (let e of n.waits) a.set(e.nodeId, {
@@ -10262,6 +10389,7 @@ function zd(e, t, n, r) {
 		nodes: a,
 		status: i ? "running" : "idle"
 	};
+	let s = /* @__PURE__ */ new Map();
 	for (let t of r) {
 		if (t.payload.scopeId != o || t.payload.flowId != e.revision.flowId) continue;
 		let r = t.payload.nodeId;
@@ -10269,7 +10397,7 @@ function zd(e, t, n, r) {
 		let i = a.get(r);
 		switch (t.kind) {
 			case "node.started":
-				a.set(r, {
+				s.set(t.payload.executionId, r), a.set(r, {
 					...i,
 					runId: n.runId,
 					startedAt: t.createdAt,
@@ -10286,7 +10414,7 @@ function zd(e, t, n, r) {
 				break;
 			}
 			case "node.completed":
-				a.set(r, {
+				s.delete(t.payload.executionId), a.set(r, {
 					...i,
 					runId: n.runId,
 					finishedAt: t.createdAt,
@@ -10297,7 +10425,7 @@ function zd(e, t, n, r) {
 				});
 				break;
 			case "node.failed":
-				a.set(r, {
+				s.delete(t.payload.executionId), a.set(r, {
 					...i,
 					runId: n.runId,
 					finishedAt: t.createdAt,
@@ -10325,7 +10453,21 @@ function zd(e, t, n, r) {
 			});
 		}
 	}
-	if (!i) for (let [e, t] of a) (t.status == "running" || t.status == "waiting") && a.set(e, {
+	if (i) {
+		let e = /* @__PURE__ */ new Map();
+		for (let t of s.values()) e.set(t, (e.get(t) ?? 0) + 1), a.set(t, {
+			...a.get(t),
+			runId: n.runId,
+			status: "running"
+		});
+		let t = /* @__PURE__ */ new Map();
+		if ("waits" in n) for (let e of n.waits) t.set(e.nodeId, (t.get(e.nodeId) ?? 0) + 1);
+		for (let [r, i] of t) (e.get(r) ?? 0) <= i && a.set(r, {
+			...a.get(r),
+			runId: n.runId,
+			status: "waiting"
+		});
+	} else for (let [e, t] of a) (t.status == "running" || t.status == "waiting") && a.set(e, {
 		...t,
 		status: "idle"
 	});
@@ -10334,10 +10476,10 @@ function zd(e, t, n, r) {
 		status: i ? "running" : "idle"
 	};
 }
-function Bd(e, t, n) {
+function Gd(e, t, n) {
 	if (e != null) return "moduleId" in e ? n?.("designer.executorJavaScript") ?? "javascript" : e.executor.kind == "agent" ? "Agent" : e.executor.kind == "llm" ? n?.("designer.executorLlm") ?? "llm" : `${n?.("designer.executorConnector") ?? "connector"} · ${t ?? e.executor.action.split(".")[0]}`;
 }
-function Vd(e) {
+function Kd(e) {
 	switch (e.kind) {
 		case "manual": return ":carbon:play:";
 		case "cron": return ":carbon:time:";
@@ -10346,11 +10488,11 @@ function Vd(e) {
 		case "webhook": return ":carbon:webhook:";
 	}
 }
-function Hd(e, t) {
+function qd(e, t) {
 	let n = `/document/graph/nodes/${e}`;
 	return t.filter((e) => e.code != "trigger.config-incomplete" && (e.path == n || e.path.startsWith(`${n}/`)));
 }
-function Ud(e, t) {
+function Jd(e, t) {
 	let n = [], r = new Map([...t].map((e) => [e, /* @__PURE__ */ new Set()])), i = new Map([...t].map((e) => [e, /* @__PURE__ */ new Set()])), a = Array.isArray(e.edges) ? e.edges : [];
 	for (let e of a) {
 		if (typeof e != "object" || !e || Array.isArray(e)) continue;
@@ -10358,7 +10500,7 @@ function Ud(e, t) {
 		if (typeof a.source != "string" || typeof a.target != "string" || a.sourceHandle != null && typeof a.sourceHandle != "string" || !t.has(a.source) || !t.has(a.target)) continue;
 		let o = a.sourceHandle == null ? "$out" : `$branch:${a.sourceHandle}`;
 		n.push({
-			id: Fd(a.source, o, a.target, "$in"),
+			id: Bd(a.source, o, a.target, "$in"),
 			source: a.source,
 			sourceHandle: o,
 			target: a.target,
@@ -10371,7 +10513,7 @@ function Ud(e, t) {
 		edges: n
 	};
 }
-function Wd(e, t, n) {
+function Yd(e, t, n) {
 	let r = new Map([...t].map(([e, t]) => [e, t.size])), i = /* @__PURE__ */ new Map(), a = [], o = /* @__PURE__ */ new Set(), s = [...r].filter(([, e]) => e == 0).map(([e]) => e).toSorted();
 	for (let e = 0; e < s.length; e += 1) {
 		let t = s[e];
@@ -10390,14 +10532,14 @@ function Wd(e, t, n) {
 		ordered: a
 	};
 }
-function Gd(e, t, n) {
+function Xd(e, t, n) {
 	if (!("inputs" in t)) return [];
 	let r = [];
 	for (let [i, a] of n.inputs) {
 		let n = t.inputs[i], o = [], s = /* @__PURE__ */ new Set();
 		if (n?.kind == "sources") for (let t of n.sources) {
 			if (t.kind != "node") continue;
-			let n = t.nodeId, r = t.output, a = Fd(n, r, e, i);
+			let n = t.nodeId, r = t.output, a = Bd(n, r, e, i);
 			s.has(a) || (s.add(a), o.push({
 				nodeId: n,
 				output: r
@@ -10412,10 +10554,10 @@ function Gd(e, t, n) {
 	}
 	return r;
 }
-function Kd(e) {
+function Zd(e) {
 	return [...e.outputs].map(([e, t]) => Object.assign({ handle: e }, t));
 }
-function qd(e, t) {
+function Qd(e, t) {
 	if (e.kind != "task" || e.definition == null) return t;
 	let n = new Map(t.map((e) => [e.handle, e])), r = [];
 	for (let t of e.definition.inputs) {
@@ -10428,7 +10570,7 @@ function qd(e, t) {
 	}
 	return r.push(...n.values()), r;
 }
-function Jd(e, t) {
+function $d(e, t) {
 	if (e.kind != "task" || e.definition == null) return t;
 	let n = new Map(t.map((e) => [e.handle, e])), r = [];
 	for (let t of e.definition.outputs) {
@@ -10441,8 +10583,8 @@ function Jd(e, t) {
 	}
 	return r.push(...n.values()), r;
 }
-function Yd(e, t, n, r, i) {
-	let a = Hd(e, r), o = a.some((e) => e.code == "trigger.connection-missing" || e.code == "trigger.connection-invalid"), s = t.kind == "integration" || t.kind == "poll" ? i[t.definition.provider] : void 0, c;
+function ef(e, t, n, r, i) {
+	let a = qd(e, r), o = a.some((e) => e.code == "trigger.connection-missing" || e.code == "trigger.connection-invalid"), s = t.kind == "integration" || t.kind == "poll" ? i[t.definition.provider] : void 0, c;
 	switch (t.kind) {
 		case "manual":
 			c = {
@@ -10479,34 +10621,30 @@ function Yd(e, t, n, r, i) {
 		description: t.description,
 		diagnostics: a.length,
 		connectionRequired: o,
-		icon: t.icon ?? (t.kind == "integration" || t.kind == "poll" ? bd(s ?? {
+		icon: t.icon ?? (t.kind == "integration" || t.kind == "poll" ? Td(s ?? {
 			serviceId: t.definition.provider,
 			serviceName: t.definition.provider
-		}) : Vd(t)),
+		}) : Kd(t)),
 		id: e,
 		inputs: [],
 		kind: "trigger",
-		outputs: [{
-			handle: "payload",
-			jsonSchema: eu(t),
-			nullable: !1
-		}],
+		outputs: Object.entries(gu(t)).map(([e, t]) => Object.assign({ handle: e }, t)),
 		presentation: c,
 		position: n,
 		title: t.name
 	};
 }
-function Xd(e, t, n, r, i) {
-	let a = t.node, o = qd(t, Gd(e, a, n)), s = Jd(t, Kd(n)), c = t.kind == "task" ? t.definition : void 0, l = c != null && "executor" in c && c.executor.kind == "connector" ? c.executor : void 0, u = l == null ? void 0 : i.connectorActions[l.action], d = u == null ? void 0 : i.connectionCatalogs[u.serviceId], f = l?.connectionId, p = f == null ? void 0 : d?.byId.get(f), m = u?.authenticated == 1 && (l?.connectionId == null || d != null && p?.status != "active"), h = i.runNodes.get(e), g = {
+function tf(e, t, n, r, i) {
+	let a = t.node, o = Qd(t, Xd(e, a, n)), s = $d(t, Zd(n)), c = t.kind == "task" ? t.definition : void 0, l = c != null && "executor" in c && c.executor.kind == "connector" ? c.executor : void 0, u = l == null ? void 0 : i.connectorActions[l.action], d = u == null ? void 0 : i.connectionCatalogs[u.serviceId], f = l?.connectionId, p = f == null ? void 0 : d?.byId.get(f), m = u?.authenticated == 1 && (l?.connectionId == null || d != null && p?.status != "active"), h = i.runNodes.get(e), g = {
 		description: a.description,
-		diagnostics: Rd(i.target, t, i.diagnostics),
-		icon: a.icon ?? (u == null ? Dd(t) : bd(u)),
+		diagnostics: Ud(i.target, t, i.diagnostics),
+		icon: a.icon ?? (u == null ? Md(t) : Td(u)),
 		id: e,
 		inputs: o,
 		outputs: s,
 		position: r,
 		...h == null ? {} : { run: h },
-		title: Ed(t, i.t)
+		title: jd(t, i.t)
 	};
 	switch (a.kind) {
 		case "condition": return {
@@ -10515,7 +10653,7 @@ function Xd(e, t, n, r, i) {
 			cases: a.cases.map((e) => ({
 				expressions: e.expressions.map((e) => ({
 					input: e.input,
-					operator: Ld(e.operator),
+					operator: Hd(e.operator),
 					value: e.value
 				})),
 				output: e.output,
@@ -10535,13 +10673,13 @@ function Xd(e, t, n, r, i) {
 				return t == null || "group" in t ? [] : [t];
 			}),
 			kind: a.kind,
-			executorName: Bd(c, u?.serviceName, i.t),
+			executorName: Gd(c, u?.serviceName, i.t),
 			connectionRequired: m,
 			...c != null && "executor" in c && c.executor.kind == "agent" ? { tools: c.executor.tools.map((e) => {
 				let t = i.connectorActions[e.action], n = t?.serviceId ?? e.action.split(".")[0], r = t?.serviceName ?? n;
 				return {
 					id: e.id,
-					icon: bd(t ?? {
+					icon: Td(t ?? {
 						serviceId: n,
 						serviceName: r
 					}),
@@ -10561,8 +10699,8 @@ function Xd(e, t, n, r, i) {
 		};
 	}
 }
-function Zd(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = {}) {
-	let u = e == null ? void 0 : Mu(e), d = u == null || t == null ? void 0 : u.graph(t);
+function nf(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = {}) {
+	let u = e == null ? void 0 : Lu(e), d = u == null || t == null ? void 0 : u.graph(t);
 	if (u == null || t == null || d == null) return {
 		edges: [],
 		nodes: [],
@@ -10572,7 +10710,7 @@ function Zd(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = {}) {
 			zoom: 1
 		}
 	};
-	let f = zd(u, t, s, c), p = Object.entries(d.nodes), m = new Map(p.map(([e, t]) => [e, u.resolveNode(e, t)])), h = new Set(p.map(([e]) => e)), g = new Map([...m].map(([e, t]) => [e, Id(t)])), _ = Ud(d, h), v = Wd(h, _.dependencies, _.dependents), y = Ad(n, t), b = $(kd(n, t)?.hiddenNodeContent), x = {
+	let f = Wd(u, t, s, c), p = Object.entries(d.nodes), m = new Map(p.map(([e, t]) => [e, u.resolveNode(e, t)])), h = new Set(p.map(([e]) => e)), g = new Map([...m].map(([e, t]) => [e, Vd(t)])), _ = Jd(d, h), v = Yd(h, _.dependencies, _.dependents), y = Fd(n, t), b = $(Pd(n, t)?.hiddenNodeContent), x = {
 		connectionCatalogs: a,
 		connectorActions: i,
 		diagnostics: r,
@@ -10590,39 +10728,39 @@ function Zd(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = {}) {
 		}, a = m.get(e);
 		if (a.kind == "trigger") {
 			S.push({
-				...Yd(e, a.trigger, i, r, l),
+				...ef(e, a.trigger, i, r, l),
 				contentHidden: b?.[e] === !0
 			});
 			continue;
 		}
-		let o = Xd(e, a, g.get(e), i, x);
+		let o = tf(e, a, g.get(e), i, x);
 		S.push({
 			...o,
 			contentHidden: b?.[e] === !0
 		});
 	}
-	for (let [e, r] of Object.entries(Pd(n, t, y)).toSorted(([e], [t]) => e.localeCompare(t))) S.push({
+	for (let [e, r] of Object.entries(zd(n, t, y)).toSorted(([e], [t]) => e.localeCompare(t))) S.push({
 		...r,
 		id: e,
 		kind: "comment",
 		contentHidden: b?.[e] === !0
 	});
-	let C = new Map(jd(n, t).map((e, t) => [e, t]));
+	let C = new Map(Id(n, t).map((e, t) => [e, t]));
 	return S.sort((e, t) => (C.get(e.id) ?? -1) - (C.get(t.id) ?? -1)), {
 		edges: _.edges,
 		nodes: S,
 		...f.status == null ? {} : { runStatus: f.status },
-		viewport: Nd(n, t)
+		viewport: Rd(n, t)
 	};
 }
-function Qd(e) {
+function rf(e) {
 	let t = $(e.designer);
 	return t?.version == 1 ? t : { version: 1 };
 }
-function $d(e, t) {
+function af(e, t) {
 	return t.kind == "flow" ? $(e.flow) : $($(e.subflows)?.[t.id]);
 }
-function ef(e, t, n) {
+function of(e, t, n) {
 	if (t.kind == "flow") return {
 		...e,
 		flow: n,
@@ -10638,17 +10776,17 @@ function ef(e, t, n) {
 		version: 1
 	};
 }
-function tf(e, t) {
+function sf(e, t) {
 	let n = {
-		...kd(e, t),
-		viewport: { ...Nd(e, t) },
-		nodes: Ad(e, t),
-		order: jd(e, t)
+		...Pd(e, t),
+		viewport: { ...Rd(e, t) },
+		nodes: Fd(e, t),
+		order: Id(e, t)
 	};
 	return delete n.layouts, n;
 }
-function nf(e, t, n) {
-	let r = Qd(e), i = tf(e, t), a = $(i.nodes) ?? {}, o = [...jd(e, t)];
+function cf(e, t, n) {
+	let r = rf(e), i = sf(e, t), a = $(i.nodes) ?? {}, o = [...Id(e, t)];
 	for (let e of Object.keys(n)) o.includes(e) || o.push(e);
 	let s = {
 		...a,
@@ -10659,29 +10797,29 @@ function nf(e, t, n) {
 	};
 	return {
 		...e,
-		designer: ef(r, t, {
+		designer: of(r, t, {
 			...i,
 			nodes: s,
 			order: o
 		})
 	};
 }
-function rf(e, t, n, r) {
-	if ($(kd(e, t)?.hiddenNodeContent)?.[n] === !0 === r) return e;
-	let i = tf(e, t), a = { ...$(i.hiddenNodeContent) };
+function lf(e, t, n, r) {
+	if ($(Pd(e, t)?.hiddenNodeContent)?.[n] === !0 === r) return e;
+	let i = sf(e, t), a = { ...$(i.hiddenNodeContent) };
 	return r ? a[n] = !0 : delete a[n], {
 		...e,
-		designer: ef(Qd(e), t, {
+		designer: of(rf(e), t, {
 			...i,
 			hiddenNodeContent: a
 		})
 	};
 }
-function af(e, t, n, r) {
-	let i = nf(e, t, { [n]: r.position }), a = Qd(i), o = $d(a, t) ?? {}, s = $(o.comments) ?? {};
+function uf(e, t, n, r) {
+	let i = cf(e, t, { [n]: r.position }), a = rf(i), o = af(a, t) ?? {}, s = $(o.comments) ?? {};
 	return {
 		...i,
-		designer: ef(a, t, {
+		designer: of(a, t, {
 			...o,
 			comments: {
 				...s,
@@ -10693,13 +10831,13 @@ function af(e, t, n, r) {
 		})
 	};
 }
-function of(e, t, n) {
-	let r = Qd(e), i = tf(e, t), a = { ...$(i.comments) }, o = { ...$(i.nodes) };
+function df(e, t, n) {
+	let r = rf(e), i = sf(e, t), a = { ...$(i.comments) }, o = { ...$(i.nodes) };
 	for (let e of n) delete a[e], delete o[e];
-	let s = jd(e, t).filter((e) => !n.has(e));
+	let s = Id(e, t).filter((e) => !n.has(e));
 	return {
 		...e,
-		designer: ef(r, t, {
+		designer: of(r, t, {
 			...i,
 			comments: a,
 			nodes: o,
@@ -10707,16 +10845,16 @@ function of(e, t, n) {
 		})
 	};
 }
-function sf(e, t) {
-	return new Set(Object.keys($(kd(e, t)?.comments) ?? {}));
+function ff(e, t) {
+	return new Set(Object.keys($(Pd(e, t)?.comments) ?? {}));
 }
-function cf(e, t, n) {
-	let r = Md(e, t);
+function pf(e, t, n) {
+	let r = Ld(e, t);
 	if (r?.x == n.x && r.y == n.y && r.zoom == n.zoom) return e;
-	let i = Qd(e), a = tf(e, t);
+	let i = rf(e), a = sf(e, t);
 	return {
 		...e,
-		designer: ef(i, t, {
+		designer: of(i, t, {
 			...a,
 			viewport: {
 				x: n.x,
@@ -10726,7 +10864,7 @@ function cf(e, t, n) {
 		})
 	};
 }
-function lf(e, t, n) {
+function mf(e, t, n) {
 	let r = e.kind == "node.started" ? e.payload.nodeTitle : void 0;
 	if (typeof r == "string") return r;
 	let i = "executionId" in e.payload ? e.payload.executionId : void 0;
@@ -10737,8 +10875,8 @@ function lf(e, t, n) {
 	let a = e.payload.nodeId;
 	return typeof a == "string" ? n?.get(a) ?? a : e.kind.startsWith("run.") ? t?.("run.flowSubject") ?? "Flow run" : t?.("run.nodeSubject") ?? "Node";
 }
-function uf(e, t, n) {
-	let r = tf(e, n), i = tf(t, n), a = /* @__PURE__ */ new Set();
+function hf(e, t, n) {
+	let r = sf(e, n), i = sf(t, n), a = /* @__PURE__ */ new Set();
 	for (let e of [
 		"nodes",
 		"comments",
@@ -10756,13 +10894,13 @@ function uf(e, t, n) {
 		before: o(r),
 		after: o(i),
 		nodeIds: [...a],
-		beforeOrder: jd(e, n),
-		afterOrder: jd(t, n)
+		beforeOrder: Id(e, n),
+		afterOrder: Id(t, n)
 	};
 }
-function df(e, t, n, r) {
+function gf(e, t, n, r) {
 	if (n.nodeIds.length == 0) return e;
-	let i = tf(e, t), a = r ? n.after : n.before;
+	let i = sf(e, t), a = r ? n.after : n.before;
 	for (let e of [
 		"nodes",
 		"comments",
@@ -10774,17 +10912,17 @@ function df(e, t, n, r) {
 	}
 	return i.order = [...r ? n.afterOrder : n.beforeOrder], {
 		...e,
-		designer: ef(Qd(e), t, i)
+		designer: of(rf(e), t, i)
 	};
 }
 //#endregion
 //#region src/workbench/browser/runtime/stores/resource.ts
-var ff = /* @__PURE__ */ new WeakMap();
-function pf(t) {
-	let n = ff.get(t);
-	return n ?? (n = e(t, (e) => e.data), ff.set(t, n)), n;
+var _f = /* @__PURE__ */ new WeakMap();
+function vf(t) {
+	let n = _f.get(t);
+	return n ?? (n = e(t, (e) => e.data), _f.set(t, n)), n;
 }
-var mf = class {
+var yf = class {
 	#e;
 	#t;
 	#n;
@@ -10874,7 +11012,7 @@ var mf = class {
 		}), this.#e.dispose();
 	}
 };
-function hf(e, t, n = !1) {
+function bf(e, t, n = !1) {
 	return new Promise((r, i) => {
 		let a, o = () => {
 			a?.(), t?.removeEventListener("abort", s);
@@ -10887,7 +11025,7 @@ function hf(e, t, n = !1) {
 		c() || (a = e.subscribe(c), t?.addEventListener("abort", s, { once: !0 }), c());
 	});
 }
-function gf(e, t, n) {
+function xf(e, t, n) {
 	if (!t.aborted) {
 		if ("then" in e) n({
 			data: void 0,
@@ -10916,8 +11054,8 @@ function gf(e, t, n) {
 }
 //#endregion
 //#region src/workbench/browser/runtime/stores/optionSource.ts
-function _f(e, t, n) {
-	return "then" in e ? e.then((e) => e === void 0 ? void 0 : n(e)) : vf(t, (t) => {
+function Sf(e, t, n) {
+	return "then" in e ? e.then((e) => e === void 0 ? void 0 : n(e)) : Cf(t, (t) => {
 		let r = t(e);
 		return {
 			...r,
@@ -10925,12 +11063,12 @@ function _f(e, t, n) {
 		};
 	});
 }
-function vf(e, n) {
+function Cf(e, n) {
 	let r = t(n);
 	return e.addEventListener("abort", () => r.dispose(), { once: !0 }), r;
 }
-function yf(e, t) {
-	return vf(e, (e) => {
+function wf(e, t) {
+	return Cf(e, (e) => {
 		let n = t.map((t) => e(t));
 		return {
 			data: n.every((e) => e.data === void 0) ? void 0 : n.flatMap((e) => e.data ?? []),
@@ -10940,68 +11078,8 @@ function yf(e, t) {
 	});
 }
 //#endregion
-//#region src/base/common/json.ts
-function bf(e) {
-	if (e === null || typeof e == "boolean" || typeof e == "string") return !0;
-	if (typeof e == "number") return Number.isFinite(e);
-	if (typeof e != "object") return !1;
-	let t = /* @__PURE__ */ new Set(), n = [], r = e;
-	traversal: for (;;) {
-		let e, i;
-		if (Array.isArray(r)) {
-			if (i = r.length, e = Reflect.ownKeys(r), e.length != i + 1) return !1;
-		} else {
-			let t = Reflect.getPrototypeOf(r);
-			if (t != Object.prototype && t != null) return !1;
-			e = Reflect.ownKeys(r), i = void 0;
-		}
-		t.add(r);
-		let a = 0;
-		for (;;) {
-			if (a >= e.length) {
-				t.delete(r);
-				let o = n.pop();
-				if (o === void 0) return !0;
-				r = o.value, e = o.keys, i = o.arrayLength, a = o.index;
-				continue;
-			}
-			let o = e[a++];
-			if (i !== void 0) {
-				if (o == "length") continue;
-				if (typeof o != "string") return !1;
-				let e = Number(o);
-				if (!Number.isSafeInteger(e) || e < 0 || e >= i || String(e) != o) return !1;
-			} else if (typeof o != "string") return !1;
-			let s = Reflect.getOwnPropertyDescriptor(r, o);
-			if (s?.enumerable != 1 || !Object.hasOwn(s, "value")) return !1;
-			let c = s.value;
-			if (c !== null && typeof c != "boolean" && typeof c != "string") {
-				if (typeof c == "number") {
-					if (!Number.isFinite(c)) return !1;
-					continue;
-				}
-				if (typeof c != "object" || t.has(c)) return !1;
-				n.push({
-					value: r,
-					keys: e,
-					arrayLength: i,
-					index: a
-				}), r = c;
-				continue traversal;
-			}
-		}
-	}
-}
-function xf(e) {
-	try {
-		return typeof e == "object" && !!e && !Array.isArray(e) && bf(e);
-	} catch {
-		return !1;
-	}
-}
-//#endregion
 //#region src/trigger/providers/feishu/config.ts
-function Sf(e) {
+function Tf(e) {
 	if (e.length != 0) {
 		if (e.every((e) => e.startsWith("drive.file."))) return "document";
 		if (e.every((e) => e == "calendar.calendar.event.changed_v4")) return "calendar";
@@ -11013,12 +11091,12 @@ function Sf(e) {
 		].includes(e))) return "approval";
 	}
 }
-function Cf(e) {
+function Ef(e) {
 	return e.length > 0 && e.every((e) => ["im.message.receive_v1", "im.chat.member.bot.added_v1"].includes(e));
 }
 //#endregion
 //#region src/workbench/browser/runtime/editor/addNodeOptions.ts
-function wf(e) {
+function Df(e) {
 	let t = /* @__PURE__ */ new Map(), n = (e) => {
 		t.set(e.id, e);
 		for (let t of e.choices ?? []) n(t.option);
@@ -11026,7 +11104,7 @@ function wf(e) {
 	for (let t of e) n(t);
 	return t;
 }
-function Tf(e) {
+function Of(e) {
 	let t = e("addNode.blocks");
 	return [
 		{
@@ -11165,9 +11243,9 @@ function Tf(e) {
 		}
 	];
 }
-function Ef(e, t, n) {
+function kf(e, t, n) {
 	if (e == null || t == null) return [];
-	let r = Tf(n);
+	let r = Of(n);
 	if (t.kind != "flow") return r.filter((e) => e.kind != "agent");
 	let i = n("addNode.triggers"), a = [
 		{
@@ -11178,13 +11256,7 @@ function Ef(e, t, n) {
 			inputs: [],
 			kind: "trigger",
 			label: n("addNode.manual"),
-			outputs: [{
-				handle: "payload",
-				jsonSchema: {
-					additionalProperties: !1,
-					type: "object"
-				}
-			}],
+			outputs: [],
 			trigger: { kind: "manual" }
 		},
 		{
@@ -11195,10 +11267,11 @@ function Ef(e, t, n) {
 			inputs: [],
 			kind: "trigger",
 			label: n("addNode.webhook"),
-			outputs: [{
-				handle: "payload",
-				jsonSchema: {}
-			}],
+			outputs: hu({
+				kind: "webhook",
+				name: "Webhook",
+				bodyFields: []
+			}),
 			trigger: { kind: "webhook" }
 		},
 		{
@@ -11209,13 +11282,11 @@ function Ef(e, t, n) {
 			inputs: [],
 			kind: "trigger",
 			label: n("addNode.cron"),
-			outputs: [{
-				handle: "payload",
-				jsonSchema: {
-					additionalProperties: !1,
-					type: "object"
-				}
-			}],
+			outputs: hu({
+				kind: "cron",
+				name: "Cron",
+				cronTimes: []
+			}),
 			trigger: { kind: "cron" }
 		},
 		{
@@ -11236,9 +11307,9 @@ function Ef(e, t, n) {
 		},
 		...r
 	];
-	return Object.values(Mu(e).graph(t)?.nodes ?? {}).some((e) => e.kind == "manual") ? a.filter((e) => e.id != "trigger:manual") : a;
+	return Object.values(Lu(e).graph(t)?.nodes ?? {}).some((e) => e.kind == "manual") ? a.filter((e) => e.id != "trigger:manual") : a;
 }
-function Df(e, t, n, r) {
+function Af(e, t, n, r) {
 	switch (e.kind) {
 		case "new-task": return {
 			kind: "code",
@@ -11304,41 +11375,41 @@ function Df(e, t, n, r) {
 }
 //#endregion
 //#region src/manifest/common/meta/block/generateTyping.ts
-function Of(e, t, n) {
-	return e === "typescript" ? Nf(t, n) + "\n" : Pf(t, n) + "\n";
+function jf(e, t, n) {
+	return e === "typescript" ? If(t, n) + "\n" : Lf(t, n) + "\n";
 }
-var kf = /* @__PURE__ */ new Set(["color", "text"]), Af = (e) => e.includes(" | ") ? `(${e})` : e;
-function jf(e) {
-	return !e || typeof e != "object" ? !1 : e.contentMediaType === "oomol/artifact" ? !0 : Array.isArray(e.anyOf) ? e.anyOf.some(jf) : e.type === "object" ? Object.values(e.properties || {}).some(jf) : e.type === "array" && jf(e.items);
+var Mf = /* @__PURE__ */ new Set(["color", "text"]), Nf = (e) => e.includes(" | ") ? `(${e})` : e;
+function Pf(e) {
+	return !e || typeof e != "object" ? !1 : e.contentMediaType === "oomol/artifact" ? !0 : Array.isArray(e.anyOf) ? e.anyOf.some(Pf) : e.type === "object" ? Object.values(e.properties || {}).some(Pf) : e.type === "array" && Pf(e.items);
 }
-function Mf(e, t) {
-	return [...e, ...t].some((e) => jf(e.json_schema));
+function Ff(e, t) {
+	return [...e, ...t].some((e) => Pf(e.json_schema));
 }
-function Nf(e = [], t = []) {
+function If(e = [], t = []) {
 	let n = ["type Inputs = {"];
-	for (let t of e) n.push(`  ${t.handle}: ${Ff(t.json_schema, t.nullable)};`);
+	for (let t of e) n.push(`  ${t.handle}: ${Rf(t.json_schema, t.nullable)};`);
 	n.push("};"), n.push("type Outputs = {");
-	for (let e of t) n.push(`  ${e.handle}: ${Ff(e.json_schema, e.nullable)};`);
-	return n.push("};"), Mf(e, t) && n.unshift("import type { ArtifactRef } from '@oomol-lab/open-flow'", ""), n.join("\n");
+	for (let e of t) n.push(`  ${e.handle}: ${Rf(e.json_schema, e.nullable)};`);
+	return n.push("};"), Ff(e, t) && n.unshift("import type { ArtifactRef } from '@oomol-lab/open-flow'", ""), n.join("\n");
 }
-function Pf(e = [], t = []) {
+function Lf(e = [], t = []) {
 	let n = ["@typedef {{"];
-	for (let t of e) n.push(`  ${t.handle}: ${Ff(t.json_schema, t.nullable)};`);
+	for (let t of e) n.push(`  ${t.handle}: ${Rf(t.json_schema, t.nullable)};`);
 	n.push("}} Inputs;"), n.push("@typedef {{");
-	for (let e of t) n.push(`  ${e.handle}: ${Ff(e.json_schema, e.nullable)};`);
-	n.push("}} Outputs;"), Mf(e, t) && n.unshift("@import { ArtifactRef } from \"@oomol-lab/open-flow\"");
+	for (let e of t) n.push(`  ${e.handle}: ${Rf(e.json_schema, e.nullable)};`);
+	n.push("}} Outputs;"), Ff(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");
 }
-function Ff(e, t) {
+function Rf(e, t) {
 	if (!e) return "unknown";
 	switch (e.contentMediaType) {
 		case "oomol/bin": return t ? "Uint8Array | null" : "Uint8Array";
 		case "oomol/artifact": return t ? "ArtifactRef | null" : "ArtifactRef";
 	}
-	if (kf.has(e["ui:widget"])) return t ? "string | null" : "string";
-	if (Array.isArray(e.anyOf)) return If((t ? e.anyOf.concat({ type: "null" }) : e.anyOf).map((e) => Af(Ff(e, !1)))) || "unknown";
-	if (Array.isArray(e.enum)) return If((t ? e.enum.concat(null) : e.enum).map((e) => JSON.stringify(e))) || "unknown";
+	if (Mf.has(e["ui:widget"])) return t ? "string | null" : "string";
+	if (Array.isArray(e.anyOf)) return zf((t ? e.anyOf.concat({ type: "null" }) : e.anyOf).map((e) => Nf(Rf(e, !1)))) || "unknown";
+	if (Array.isArray(e.enum)) return zf((t ? e.enum.concat(null) : e.enum).map((e) => JSON.stringify(e))) || "unknown";
 	switch (e.type) {
 		case "null": return "null";
 		case "boolean": return t ? "boolean | null" : "boolean";
@@ -11348,35 +11419,35 @@ function Ff(e, t) {
 		case "object": {
 			let n = Object.keys(e.properties || {});
 			if (n.length === 0) return "Record<string, unknown>";
-			let r = Array.isArray(e?.required) ? new Set(e.required) : /* @__PURE__ */ new Set(), i = `{ ${n.map((t) => `${JSON.stringify(t)}${r.has(t) ? "" : "?"}: ${Ff(e.properties[t], !1)}`).join("; ")} }`;
+			let r = Array.isArray(e?.required) ? new Set(e.required) : /* @__PURE__ */ new Set(), i = `{ ${n.map((t) => `${JSON.stringify(t)}${r.has(t) ? "" : "?"}: ${Rf(e.properties[t], !1)}`).join("; ")} }`;
 			return t ? `${i} | null` : i;
 		}
 		case "array":
 			if (e.uniqueItems && Array.isArray(e.items?.enum)) {
-				let n = `${Af(Ff(e.items, !1))}[]`;
+				let n = `${Nf(Rf(e.items, !1))}[]`;
 				return t ? `${n} | null` : n;
 			}
 			{
-				let n = `${Af(Ff(e.items, !1))}[]`;
+				let n = `${Nf(Rf(e.items, !1))}[]`;
 				return t ? `${n} | null` : n;
 			}
 		default: return "unknown";
 	}
 }
-function If(e) {
+function zf(e) {
 	let t = Array.from(new Set(e.filter((e) => !!e)));
 	return t.length === 0 || t.includes("unknown") ? "unknown" : t.join(" | ");
 }
 //#endregion
 //#region src/workbench/browser/runtime/editor/flowChanges.ts
-function Lf(e, t) {
+function Bf(e, t) {
 	return {
 		...e,
 		content: Ht(e.content, t)
 	};
 }
-function Rf(e, t = [], n = {}) {
-	let r = Of("javascript", e.inputs.flatMap((e) => "handle" in e ? [{
+function Vf(e, t = [], n = {}) {
+	let r = jf("javascript", e.inputs.flatMap((e) => "handle" in e ? [{
 		handle: e.handle,
 		json_schema: e.jsonSchema,
 		nullable: e.nullable
@@ -11386,7 +11457,7 @@ function Rf(e, t = [], n = {}) {
 		nullable: e.nullable
 	}] : [])), i = [], a = /* @__PURE__ */ new Map();
 	for (let e of t) {
-		let t = n[e.action], r = t?.inputSchema == null ? "Record<string, unknown>" : Ff(t.inputSchema, !1), o = t?.outputSchema == null ? "unknown" : Ff(t.outputSchema, !1), s = `{ connectionId: ${e.connections.map((e) => JSON.stringify(e.connectionId)).join(" | ") || "never"}; connectionAlias?: never } | { connectionAlias: ${e.connections.flatMap((e) => e.alias == null ? [] : [JSON.stringify(e.alias)]).join(" | ") || "never"}; connectionId?: never }`, c = `(...args: ${e.connections.length > 0 && e.connectionId == null ? `[input: {} extends ${r} ? ${r} | undefined : ${r}, options: ${s}]` : `{} extends ${r} ? [input?: ${r}, options?: ${s}] : [input: ${r}, options?: ${s}]`}) => Promise<${o}>`;
+		let t = n[e.action], r = t?.inputSchema == null ? "Record<string, unknown>" : Rf(t.inputSchema, !1), o = t?.outputSchema == null ? "unknown" : Rf(t.outputSchema, !1), s = `{ connectionId: ${e.connections.map((e) => JSON.stringify(e.connectionId)).join(" | ") || "never"}; connectionAlias?: never } | { connectionAlias: ${e.connections.flatMap((e) => e.alias == null ? [] : [JSON.stringify(e.alias)]).join(" | ") || "never"}; connectionId?: never }`, c = `(...args: ${e.connections.length > 0 && e.connectionId == null ? `[input: {} extends ${r} ? ${r} | undefined : ${r}, options: ${s}]` : `{} extends ${r} ? [input?: ${r}, options?: ${s}] : [input: ${r}, options?: ${s}]`}) => Promise<${o}>`;
 		i.push(`${JSON.stringify(e.action)}: ${c}`);
 		let l = e.action.indexOf("."), u = e.action.slice(0, l), d = a.get(u) ?? [];
 		d.push(`${JSON.stringify(e.action.slice(l + 1))}: ${c}`), a.set(u, d);
@@ -11394,7 +11465,7 @@ function Rf(e, t = [], n = {}) {
 	for (let [e, t] of a) i.push(`${JSON.stringify(e)}: { ${t.join("; ")} }`);
 	return `${r}/** @typedef {import("@oomol-lab/open-flow").TaskContext<{ ${i.join("; ").replaceAll("*/", "*\\/")} }>} TaskContext */\n`;
 }
-function zf(e) {
+function Hf(e) {
 	return {
 		executor: {
 			action: e.actionId,
@@ -11406,7 +11477,7 @@ function zf(e) {
 		outputs: Object.entries(e.outputs).map(([e, t]) => Object.assign({ handle: e }, t))
 	};
 }
-function Bf(e, t, n) {
+function Uf(e, t, n) {
 	return {
 		id: n,
 		name: `${e.actionId.replace(/[^a-zA-Z0-9_]/g, "_").slice(0, 48)}_${n.slice(0, 8)}`,
@@ -11417,7 +11488,7 @@ function Bf(e, t, n) {
 		inputs: Object.entries(e.inputs).map(([e, { value: t, ...n }]) => Object.assign({ handle: e }, n, { source: { kind: "model" } }))
 	};
 }
-function Vf(e, t) {
+function Wf(e, t) {
 	return [{
 		kind: "subflow.create",
 		subflow: {
@@ -11445,7 +11516,7 @@ function Vf(e, t) {
 		subflowId: e
 	}];
 }
-function Hf(e, t, n) {
+function Gf(e, t, n) {
 	let r = e.graph(t);
 	if (r == null) return n;
 	let i = new Set(Object.values(r.nodes).flatMap((e) => e.name == null ? [] : [e.name]));
@@ -11461,7 +11532,7 @@ function Hf(e, t, n) {
 		};
 	});
 }
-function Uf(e, t, n, r, i) {
+function Kf(e, t, n, r, i) {
 	let a;
 	switch (r.kind) {
 		case "code":
@@ -11486,7 +11557,7 @@ function Uf(e, t, n, r, i) {
 			a = Ca(t, {
 				nodeId: n,
 				taskId: i()
-			}, zf(r.action));
+			}, Hf(r.action));
 			break;
 		case "condition":
 			a = Ea(t, n, r.name);
@@ -11500,7 +11571,7 @@ function Uf(e, t, n, r, i) {
 		case "subflow": {
 			let i = e.subflow(r.subflowId);
 			if (i == null) return;
-			a = sp(t, n, r.subflowId, i.inputs);
+			a = up(t, n, r.subflowId, i.inputs);
 			break;
 		}
 		case "manual":
@@ -11511,7 +11582,7 @@ function Uf(e, t, n, r, i) {
 			break;
 		case "webhook":
 			a = t.kind == "flow" ? ka(t, n, {
-				inputsDef: [],
+				bodyFields: [],
 				kind: "webhook",
 				name: r.name
 			}) : void 0;
@@ -11537,12 +11608,12 @@ function Uf(e, t, n, r, i) {
 				...r.connectionId == null ? {} : { connectionId: r.connectionId }
 			});
 	}
-	return a == null ? void 0 : Hf(e, t, a);
+	return a == null ? void 0 : Gf(e, t, a);
 }
-function Wf(e, t, n) {
+function qf(e, t, n) {
 	return ja(e.revision.content, t, n);
 }
-function Gf(e, t, n) {
+function Jf(e, t, n) {
 	let r = e.graph(t)?.nodes ?? {}, i = Object.fromEntries(n.flatMap((e) => r[e] == null ? [] : [[e, r[e]]]));
 	return {
 		edges: (e.graph(t)?.edges ?? []).filter((e) => i[e.source] != null && i[e.target] != null),
@@ -11559,7 +11630,7 @@ function Gf(e, t, n) {
 		nodes: i
 	};
 }
-function Kf(e, t, n, r) {
+function Yf(e, t, n, r) {
 	if (e.graph(t) == null) return {
 		changes: [],
 		nodeIds: [],
@@ -11682,15 +11753,15 @@ function Kf(e, t, n, r) {
 		});
 	}
 	return {
-		changes: Hf(e, t, c),
+		changes: Gf(e, t, c),
 		nodeIds: [...s.values()],
 		sourceIds: o
 	};
 }
-function qf(e, t, n, r) {
+function Xf(e, t, n, r) {
 	return Ma(e.revision.content, t, n, r);
 }
-function Jf(e, t, n, r) {
+function Zf(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i != null) return i.description == r ? [] : [{
 		before: i.description,
@@ -11701,7 +11772,7 @@ function Jf(e, t, n, r) {
 		value: r
 	}];
 }
-function Yf(e, t, n, r) {
+function Qf(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i != null) return i.icon == r ? [] : [{
 		before: i.icon,
@@ -11712,7 +11783,7 @@ function Yf(e, t, n, r) {
 		value: r
 	}];
 }
-function Xf(e, t, n, r) {
+function $f(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i == null || i.kind == "manual") return;
 	let a = "inputs" in i ? r : r ?? i.name;
@@ -11725,17 +11796,17 @@ function Xf(e, t, n, r) {
 		value: a
 	}];
 }
-function Zf(e, t, n, r, i) {
+function ep(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 Na(e.revision.content, t, n, r, i);
 }
-function Qf(e, t, n, r, i, a) {
+function tp(e, t, n, r, i, a) {
 	return Ia(e.revision.content, t, n, r, i, a);
 }
-function $f(e, t, n, r) {
+function np(e, t, n, r) {
 	let i = e.graph(t), a = i?.nodes[n];
 	if (i == null || a?.kind != "condition") return;
-	let o = Object.fromEntries([...a.cases.map((e) => [e.output, !0]), ...a.defaultOutput == null ? [] : [[a.defaultOutput, !0]]]), s = Object.fromEntries([...r.cases.map((e) => [e.output, !0]), ...r.defaultOutput == null ? [] : [[r.defaultOutput, !0]]]), c = a.input.handle == r.input.handle ? void 0 : [a.input.handle, r.input.handle], l = lp(Object.keys(o).map((e) => ({ handle: e })), Object.keys(s).map((e) => ({ handle: e }))), u = new Set(Object.keys(s)), d = [];
+	let o = Object.fromEntries([...a.cases.map((e) => [e.output, !0]), ...a.defaultOutput == null ? [] : [[a.defaultOutput, !0]]]), s = Object.fromEntries([...r.cases.map((e) => [e.output, !0]), ...r.defaultOutput == null ? [] : [[r.defaultOutput, !0]]]), c = a.input.handle == r.input.handle ? void 0 : [a.input.handle, r.input.handle], l = fp(Object.keys(o).map((e) => ({ handle: e })), Object.keys(s).map((e) => ({ handle: e }))), u = new Set(Object.keys(s)), d = [];
 	for (let e of i.edges) {
 		if (e.source != n || e.sourceHandle == null) continue;
 		let r = l != null && e.sourceHandle == l[0] ? l[1] : e.sourceHandle;
@@ -11784,11 +11855,11 @@ function $f(e, t, n, r) {
 				value: r
 			});
 		}
-		d.push(...up(o.inputs, i, t, e));
+		d.push(...pp(o.inputs, i, t, e));
 	}
 	return La(e.revision.content, d);
 }
-function ep(e, t, n, r) {
+function rp(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i?.kind != "value") return;
 	let a = r.map((e) => ({
@@ -11806,7 +11877,7 @@ function ep(e, t, n, r) {
 		value: a
 	}];
 }
-function tp(e, t, n, r) {
+function ip(e, t, n, r) {
 	if (t.kind != "flow") return;
 	let i = e.graph(t), a = i?.nodes[n];
 	if (i == null || a?.kind != "wait") return;
@@ -11853,7 +11924,7 @@ function tp(e, t, n, r) {
 	}
 	return l.length == 0 ? [] : La(e.revision.content, l);
 }
-function np(e, t, n, r) {
+function ap(e, t, n, r) {
 	let i = e.graph(t)?.nodes[n];
 	if (i?.kind == "task") switch (r.kind) {
 		case "agent": return i.taskId == null || !rt(e.task(i.taskId), r.before) ? void 0 : [{
@@ -11862,7 +11933,7 @@ function np(e, t, n, r) {
 			before: r.before,
 			value: r.task
 		}];
-		case "code": return i.task == null ? void 0 : dp(e, t, n, {
+		case "code": return i.task == null ? void 0 : mp(e, t, n, {
 			...i.task,
 			name: r.name
 		});
@@ -11895,28 +11966,28 @@ function np(e, t, n, r) {
 		}
 	}
 }
-function rp(e, t, n, r) {
+function op(e, t, n, r) {
 	let i = e.node(t, n);
 	if (i?.kind == "task" && i.node.taskId != null && i.definition != null && "executor" in i.definition && i.definition.executor.kind == "agent") {
-		let a = dp(e, t, n, {
+		let a = mp(e, t, n, {
 			...i.definition,
 			...r
 		});
 		return a == null ? void 0 : La(e.revision.content, a);
 	}
 	if (i?.kind != "task" || i.node.task == null || i.module == null || rt(i.node.task.inputs, r.inputs) && rt(i.node.task.outputs, r.outputs)) return;
-	let a = dp(e, t, n, {
+	let a = mp(e, t, n, {
 		...i.node.task,
 		...r
 	});
 	if (a != null) return La(e.revision.content, a);
 }
-function ip(e, t, n, r) {
+function sp(e, t, n, r) {
 	let i = e.node(t, n);
 	if (i?.kind != "task" || i.node.task != null || i.definition == null) return;
 	let a = i.node;
 	if (rt(a.additionalInputs ?? [], r)) return;
-	let o = lp(a.additionalInputs ?? [], r), s = new Set(i.definition.inputs.flatMap((e) => "handle" in e ? [e.handle] : []).concat(r.map((e) => e.handle))), c = Object.assign({}, a.inputs);
+	let o = fp(a.additionalInputs ?? [], r), s = new Set(i.definition.inputs.flatMap((e) => "handle" in e ? [e.handle] : []).concat(r.map((e) => e.handle))), c = Object.assign({}, a.inputs);
 	o != null && Object.hasOwn(c, o[0]) && (c[o[1]] = c[o[0]], delete c[o[0]]);
 	for (let e of Object.keys(c)) s.has(e) || delete c[e];
 	let l = r.length == 0 ? void 0 : r;
@@ -11926,19 +11997,19 @@ function ip(e, t, n, r) {
 		nodeId: n,
 		target: t,
 		value: l
-	}, ...up(a.inputs, c, t, n)]);
+	}, ...pp(a.inputs, c, t, n)]);
 }
-function ap(e, t, n, r) {
+function cp(e, t, n, r) {
 	let i = e.trigger(n);
 	if (i == null || i.kind != "webhook") return;
 	let a = {
-		inputsDef: i.inputsDef,
+		bodyFields: i.bodyFields,
 		options: i.options
 	}, o = {
-		inputsDef: r.inputs,
+		bodyFields: r.bodyFields,
 		options: Object.keys(r.options).length == 0 ? void 0 : r.options
 	};
-	return rt(a.inputsDef, o.inputsDef) && rt(a.options, o.options) ? [] : [{
+	return rt(a.bodyFields, o.bodyFields) && rt(a.options, o.options) ? [] : [{
 		before: a,
 		kind: "graph.node.webhook.set",
 		nodeId: n,
@@ -11946,7 +12017,7 @@ function ap(e, t, n, r) {
 		value: o
 	}];
 }
-function op(e, t, n) {
+function lp(e, t, n) {
 	let r = e.subflow(t);
 	if (r == null) return;
 	let i = {
@@ -11961,11 +12032,11 @@ function op(e, t, n) {
 		subflowId: t
 	}];
 }
-function sp(e, t, n, r) {
+function up(e, t, n, r) {
 	return [{
 		kind: "graph.node.create",
 		node: {
-			inputs: cp(r),
+			inputs: dp(r),
 			kind: "subflow",
 			subflowId: n
 		},
@@ -11973,17 +12044,17 @@ function sp(e, t, n, r) {
 		target: e
 	}];
 }
-function cp(e) {
+function dp(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e && Object.hasOwn(e, "value") ? [[e.handle, {
 		kind: "value",
 		value: e.value
 	}]] : []));
 }
-function lp(e, t) {
+function fp(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 up(e, t, n, r) {
+function pp(e, t, n, r) {
 	let i = /* @__PURE__ */ new Set([...Object.keys(e), ...Object.keys(t)]), a = [];
 	for (let o of i) rt(e[o], t[o]) || a.push({
 		before: e[o],
@@ -11995,12 +12066,12 @@ function up(e, t, n, r) {
 	});
 	return a;
 }
-function dp(e, t, n, r) {
+function mp(e, t, n, r) {
 	let i = e.graph(t), a = i?.nodes[n];
 	if (i == null || a?.kind != "task") return;
 	let o = a.task ?? e.task(a.taskId);
 	if (o == null) return;
-	let s = lp(o.inputs, r.inputs), c = lp(o.outputs, r.outputs), l = new Set(r.inputs.flatMap((e) => "handle" in e ? [e.handle] : [])), u = new Set(r.outputs.flatMap((e) => "handle" in e ? [e.handle] : [])), d = [];
+	let s = fp(o.inputs, r.inputs), c = fp(o.outputs, r.outputs), l = new Set(r.inputs.flatMap((e) => "handle" in e ? [e.handle] : [])), u = new Set(r.outputs.flatMap((e) => "handle" in e ? [e.handle] : [])), d = [];
 	for (let e of i.edges) {
 		if (e.source != n || e.sourceHandle == null) continue;
 		let r = c != null && e.sourceHandle == c[0] ? c[1] : e.sourceHandle;
@@ -12058,7 +12129,7 @@ function dp(e, t, n, r) {
 				value: i
 			});
 		}
-		d.push(...up(o.inputs, i, t, e));
+		d.push(...pp(o.inputs, i, t, e));
 	}
 	if (a.task == null && "executor" in r && r.executor.kind == "agent" && "executor" in o) {
 		let e = r.executor, t = (e) => e.kind == "input" ? s != null && e.input == s[0] ? {
@@ -12095,4 +12166,4 @@ function dp(e, t, n, r) {
 	return d;
 }
 //#endregion
-export { td as $, di as $t, _f as A, fa as At, Zd as B, ta as Bt, Df as C, ga as Ct, Cf as D, pa as Dt, Sf as E, ma as Et, hf as F, ea as Ft, cf as G, Ri as Gt, of as H, na as Ht, wd as I, $i as It, kd as J, Pi as Jt, rf as K, Li as Kt, uf as L, aa as Lt, mf as M, ia as Mt, gf as N, Zi as Nt, xf as O, la as Ot, pf as P, Qi as Pt, $u as Q, pi as Qt, sf as R, oa as Rt, ap as S, _a as St, wf as T, ca as Tt, df as U, Xi as Ut, lf as V, ra as Vt, af as W, Wi as Wt, pd as X, vi as Xt, bd as Y, yi as Yt, rd as Z, hi as Zt, np as _, R as _n, za as _t, Gf as a, Vr as an, pu as at, ep as b, I as bn, Ba as bt, Kf as c, Br as cn, du as ct, $f as d, Fr as dn, io as dt, Qr as en, ed as et, Jf as f, Or as fn, Qa as ft, op as g, gn, Ka as gt, qf as h, L as hn, xa as ht, Rf as i, qr as in, Eu as it, vf as j, Yi as jt, yf as k, da as kt, Zf as l, Rr as ln, oo as lt, Xf as m, On as mn, Xa as mt, Bf as n, Xr as nn, Ru as nt, Vf as o, Ur as on, nu as ot, Yf as p, Gn as pn, Za as pt, nf as q, Ii as qt, Lf as r, Zr as rn, Mu as rt, Wf as s, Wr as sn, eu as st, Uf as t, $r as tn, Hu as tt, Qf as u, Lr as un, eo as ut, ip as v, z as vn, Fa as vt, Ef as w, ha as wt, tp as x, sn as xn, Va as xt, rp as y, cn as yn, Ha as yt, Td as z, sa as zt };
+export { ad as $, di as $t, Cf as A, fa as At, mf as B, ta as Bt, Af as C, ga as Ct, Ef as D, pa as Dt, Tf as E, ma as Et, kd as F, ea as Ft, lf as G, Ri as Gt, gf as H, na as Ht, hf as I, $i as It, Td as J, Pi as Jt, cf as K, Li as Kt, ff as L, aa as Lt, xf as M, ia as Mt, vf as N, Zi as Nt, wf as O, la as Ot, bf as P, Qi as Pt, od as Q, pi as Qt, Ad as R, oa as Rt, cp as S, _a as St, Df as T, ca as Tt, uf as U, Xi as Ut, df as V, ra as Vt, pf as W, Wi as Wt, cd as X, vi as Xt, vd as Y, yi as Yt, id as Z, hi as Zt, ap as _, R as _n, za as _t, Jf as a, Vr as an, hu as at, rp as b, I as bn, Ba as bt, Yf as c, Br as cn, co as ct, np as d, Fr as dn, io as dt, Qr as en, qu as et, Zf as f, Or as fn, Qa as ft, lp as g, gn, Ka as gt, Xf as h, L as hn, xa as ht, Vf as i, qr as in, vu as it, yf as j, Yi as jt, Sf as k, da as kt, ep as l, Rr as ln, oo as lt, $f as m, On as mn, Xa as mt, Uf as n, Xr as nn, Lu as nt, Wf as o, Ur as on, ru as ot, Qf as p, Gn as pn, Za as pt, Pd as q, Ii as qt, Bf as r, Zr as rn, ju as rt, qf as s, Wr as sn, fu as st, Kf as t, $r as tn, Uu as tt, tp as u, Lr as un, eo as ut, sp as v, z as vn, Fa as vt, kf as w, ha as wt, ip as x, sn as xn, Va as xt, op as y, cn as yn, Ha as yt, nf as z, sa as zt };