@oomol-lab/open-flow 0.1.0-beta.11 → 0.1.0-beta.12

package/dist/browser/{flowChanges-BINNGoug.js → flowChanges-CHPdBmZb.js}

@@ -1,17 +1,17 @@
 import { a as e, f as t, t as n } from "./dist-C46JByB-.js";
 import { Kn as r, Ot as i, Un as a, Vn as o, Wn as s, jt as c, nr as l } from "./getPseudoElementBounds-Dfqo78k7.js";
-import { c as u, d, m as f, p, u as m } from "./select-CbQHq-GM.js";
-import { R as ee, _ as te, c as h, d as ne, f as re, n as ie, p as ae, u as oe } from "./DesignerIcon-ckcKnxxJ.js";
+import { c as u, d, g as f, m as p, p as m, u as h } from "./select-Dn3vpjGC.js";
+import { R as ee, _ as g, c as te, d as ne, f as re, n as ie, p as ae, u as oe } from "./DesignerIcon-ckcKnxxJ.js";
 import { i as se, n as ce } from "./languages-i3Xmpt6S.js";
-import { a as g, c as _, r as le } from "./dist-CP0883sY.js";
+import { a as le, c as _, r as ue } from "./dist-CP0883sY.js";
 import "./lib-C5Ipyfps.js";
-import * as ue from "react";
-import { useState as de } from "react";
-import { jsx as v, jsxs as fe } from "react/jsx-runtime";
+import * as de from "react";
+import { useState as fe } from "react";
+import { jsx as v, jsxs as pe } from "react/jsx-runtime";
 import * as y from "effect/Effect";
-import * as pe from "effect/Deferred";
+import * as me from "effect/Deferred";
 //#region src/control/common/random.ts
-function me() {
+function he() {
 	let e = globalThis.crypto;
 	if (e != null) {
 		try {
@@ -26,6 +26,7 @@ function me() {
 	}
 	return `${Date.now().toString(36)}-${Math.random().toString(36).slice(2)}`;
 }
+new TextEncoder();
 //#endregion
 //#region src/control/common/errors.ts
 var b = {
@@ -66,7 +67,7 @@ var b = {
 	variableNotFound: "variable.not-found"
 };
 b.authenticationRequired, b.authorizationDenied, b.bindingUnresolved, b.connectorActionNotFound, b.connectorUnconfigured, b.connectorUnavailable, b.engineUnavailable, b.engineUnsupported, b.flowInvalid, b.flowNotFound, b.flowBusy, b.flowConflict, b.flowPresentationConflict, b.flowRevisionConflict, b.liveConflict, b.liveNotFound, b.pageInvalidCursor, b.publicationConflict, b.publicationNotFound, b.publicationUnsupported, b.publishOperationNotFound, b.routeNotFound, b.runConflict, b.runEventsExpired, b.runInvalid, b.runNotFound, b.runNotTerminal, b.runOverloaded, b.runWaitNotFound, b.triggerKeyInvalid, b.triggerKeyNotFound, b.triggerNotFound, b.variableInvalid, b.variableLimitReached, b.variableNotFound;
-var he = [
+var ge = [
 	"canceled",
 	"completed",
 	"failed",
@@ -76,18 +77,18 @@ var he = [
 	"starting",
 	"waiting"
 ];
-function ge(e) {
+function _e(e) {
 	return e == "canceled" || e == "completed" || e == "failed" || e == "indeterminate";
 }
 //#endregion
 //#region src/control/common/api.ts
-var _e = class extends Error {
+var ve = class extends Error {
 	constructor(e, t, n) {
 		super(n), this.code = t, this.name = "ApiError", this.status = e;
 	}
 };
 function x() {
-	throw new _e(502, "response.invalid", "The Control API returned an invalid response.");
+	throw new ve(502, "response.invalid", "The Control API returned an invalid response.");
 }
 function S(e) {
 	return typeof e != "object" || !e || Array.isArray(e) ? x() : e;
@@ -108,7 +109,7 @@ function E(e) {
 	let t = S(e);
 	return Object.fromEntries(Object.entries(t).map(([e, t]) => [e, E(t)]));
 }
-function ve(e) {
+function ye(e) {
 	let t = S(e);
 	w(t, [
 		...Object.hasOwn(t, "alias") ? ["alias"] : [],
@@ -128,7 +129,7 @@ function ve(e) {
 		status: n
 	};
 }
-function ye(e, t = !1) {
+function be(e, t = !1) {
 	let n = S(e), r = n.description, i = t && Object.hasOwn(n, "value");
 	return w(n, [
 		"jsonSchema",
@@ -142,13 +143,13 @@ function ye(e, t = !1) {
 		...i ? { value: E(n.value) } : {}
 	};
 }
-function be(e) {
-	return ye(e, !0);
+function xe(e) {
+	return be(e, !0);
 }
-function xe(e, t) {
+function Se(e, t) {
 	return Object.fromEntries(Object.entries(S(e)).map(([e, n]) => [e, t(n)]));
 }
-function Se(e) {
+function Ce(e) {
 	let t = S(e), n = t.homepageUrl, r = t.icon, i = t.defaultConnection != null;
 	if (w(t, [
 		"actionId",
@@ -170,19 +171,19 @@ function Se(e) {
 		...t.outputSchema === void 0 ? {} : { outputSchema: E(t.outputSchema) },
 		actionId: C(t.actionId),
 		authenticated: typeof t.authenticated == "boolean" ? t.authenticated : x(),
-		...i ? { defaultConnection: ve(t.defaultConnection) } : {},
+		...i ? { defaultConnection: ye(t.defaultConnection) } : {},
 		description: typeof t.description == "string" ? t.description : x(),
 		...n == null ? {} : { homepageUrl: n },
 		...r == null ? {} : { icon: r },
-		inputs: xe(t.inputs, be),
+		inputs: Se(t.inputs, xe),
 		name: C(t.name),
-		outputs: xe(t.outputs, ye),
+		outputs: Se(t.outputs, be),
 		serviceId: C(t.serviceId),
 		serviceName: C(t.serviceName)
 	};
 	return a.defaultConnection != null && (a.defaultConnection.serviceId != a.serviceId || a.defaultConnection.status != "active") ? x() : a;
 }
-function Ce(e) {
+function we(e) {
 	let t = S(e), n = t.homepageUrl, r = t.icon;
 	return w(t, [
 		"serviceId",
@@ -196,7 +197,7 @@ function Ce(e) {
 		serviceName: C(t.serviceName)
 	};
 }
-function we(e) {
+function Te(e) {
 	let t = S(e), n = t.type;
 	return n != "integration" && n != "poll" ? x() : {
 		description: typeof t.description == "string" ? t.description : x(),
@@ -207,8 +208,8 @@ function we(e) {
 		type: n
 	};
 }
-function Te(e) {
-	let t = S(e), n = we(t), r = {
+function Ee(e) {
+	let t = S(e), n = Te(t), r = {
 		configSchema: E(t.configSchema),
 		definitionVersion: T(t.definitionVersion),
 		description: n.description,
@@ -251,18 +252,18 @@ function Te(e) {
 		type: "integration"
 	};
 }
-var Ee = /* @__PURE__ */ new Set([
+var De = /* @__PURE__ */ new Set([
 	"cron",
 	"integration",
 	"poll",
 	"webhook"
-]), De = /* @__PURE__ */ new Set([
+]), Oe = /* @__PURE__ */ new Set([
 	"failed",
 	"healthy",
 	"initializing",
 	"needs_reauth",
 	"suspended"
-]), Oe = /* @__PURE__ */ new Set([
+]), ke = /* @__PURE__ */ new Set([
 	"delivery.failed",
 	"health.failed",
 	"health.needs_reauth",
@@ -271,12 +272,12 @@ var Ee = /* @__PURE__ */ new Set([
 	"operator.paused",
 	"operator.resumed"
 ]);
-function ke(e) {
+function Ae(e) {
 	if (e != null) return C(e);
 }
-function Ae(e) {
+function je(e) {
 	let t = S(e), n = t.health, r = t.kind, i = t.operatorState, a = T(t.runtimeVersion);
-	return t.version != 1 || typeof n != "string" || !De.has(n) || typeof r != "string" || !Ee.has(r) || i != "active" && i != "paused" || a <= 0 ? x() : {
+	return t.version != 1 || typeof n != "string" || !Oe.has(n) || typeof r != "string" || !De.has(r) || i != "active" && i != "paused" || a <= 0 ? x() : {
 		...t.currentPublicationId == null ? {} : { currentPublicationId: C(t.currentPublicationId) },
 		...t.currentRevisionId == null ? {} : { currentRevisionId: C(t.currentRevisionId) },
 		...t.endpointUrl == null ? {} : { endpointUrl: C(t.endpointUrl) },
@@ -291,17 +292,17 @@ function Ae(e) {
 		version: 1
 	};
 }
-function je(e) {
+function Me(e) {
 	let t = S(e);
 	return t.version == 1 ? {
-		binding: Ae(t.binding),
+		binding: je(t.binding),
 		version: 1
 	} : x();
 }
-function Me(e) {
+function Ne(e) {
 	let t = S(e), n = t.kind;
-	if (typeof n != "string" || !Oe.has(n)) return x();
-	let r = ke(t.errorCode), i = ke(t.errorMessage);
+	if (typeof n != "string" || !ke.has(n)) return x();
+	let r = Ae(t.errorCode), i = Ae(t.errorMessage);
 	return i != null && i.length > 512 ? x() : {
 		activityId: C(t.activityId),
 		createdAt: C(t.createdAt),
@@ -310,15 +311,15 @@ function Me(e) {
 		kind: n
 	};
 }
-function Ne(e) {
-	let t = S(e), n = ke(t.nextCursor);
+function Pe(e) {
+	let t = S(e), n = Ae(t.nextCursor);
 	return t.version != 1 || !Array.isArray(t.activities) ? x() : {
-		activities: t.activities.map(Me),
+		activities: t.activities.map(Ne),
 		...n == null ? {} : { nextCursor: n },
 		version: 1
 	};
 }
-function Pe(e) {
+function Fe(e) {
 	let t = S(e), n = T(t.filtered);
 	return t.version != 1 || !Array.isArray(t.events) || typeof t.hasMore != "boolean" || n < 0 ? x() : {
 		events: t.events.map((e) => {
@@ -330,7 +331,7 @@ function Pe(e) {
 		version: 1
 	};
 }
-function Fe(e) {
+function D(e) {
 	let t = S(e), n = t.status;
 	if (t.version != 1 || n != "active" && n != "retiring") return x();
 	let r = t.live == null ? void 0 : S(t.live);
@@ -355,7 +356,7 @@ function Ie(e) {
 	let n = t.nextCursor, r = t.total;
 	return n != null && typeof n != "string" || r != null && !Number.isSafeInteger(r) ? x() : {
 		...n == null ? {} : { nextCursor: n },
-		flows: t.flows.map(Fe),
+		flows: t.flows.map(D),
 		...r == null ? {} : { total: r },
 		version: 1
 	};
@@ -395,11 +396,15 @@ function Re(e) {
 	};
 }
 function ze(e) {
-	let t = S(e), n = S(t.content);
-	return n.modelVersion == 1 ? (S(n.document), S(n.modules), {
-		...Re(t),
-		content: t.content
-	}) : x();
+	let t = S(e);
+	try {
+		return {
+			...Re(t),
+			content: f(t.content)
+		};
+	} catch {
+		return x();
+	}
 }
 function Be(e) {
 	let t = S(e);
@@ -558,7 +563,7 @@ function Je(e) {
 		version: 1
 	};
 }
-var Ye = new Set(he);
+var Ye = new Set(ge);
 function Xe(e) {
 	return typeof e == "string" && Ye.has(e) ? e : x();
 }
@@ -749,9 +754,9 @@ function ot(e) {
 	}
 	return x();
 }
-var D = encodeURIComponent;
+var O = encodeURIComponent;
 function st(e) {
-	return `${e}-${me()}`;
+	return `${e}-${he()}`;
 }
 var ct = class {
 	constructor(e) {
@@ -771,20 +776,20 @@ var ct = class {
 		};
 	}
 	async getVariable(e) {
-		return Le(await this.request(`/v1/variables/${D(e)}`));
+		return Le(await this.request(`/v1/variables/${O(e)}`));
 	}
 	async putVariable(e, t) {
-		return Le(await this.request(`/v1/variables/${D(e)}`, {
+		return Le(await this.request(`/v1/variables/${O(e)}`, {
 			body: JSON.stringify({ value: t }),
 			method: "PUT"
 		}));
 	}
 	async deleteVariable(e) {
-		let t = S(await this.request(`/v1/variables/${D(e)}`, { method: "DELETE" }));
+		let t = S(await this.request(`/v1/variables/${O(e)}`, { method: "DELETE" }));
 		if (w(t, ["version"]), t.version != 1) return x();
 	}
-	async createFlow(e, t = `flow-${me()}`) {
-		return Fe(await this.request("/v1/flows", {
+	async createFlow(e, t = `flow-${he()}`) {
+		return D(await this.request("/v1/flows", {
 			body: JSON.stringify({
 				name: e,
 				version: 1
@@ -794,10 +799,10 @@ var ct = class {
 		}));
 	}
 	async getFlow(e) {
-		return Fe(await this.request(`/v1/flows/${D(e)}`));
+		return D(await this.request(`/v1/flows/${O(e)}`));
 	}
 	async renameFlow(e, t) {
-		return Fe(await this.request(`/v1/flows/${D(e)}`, {
+		return D(await this.request(`/v1/flows/${O(e)}`, {
 			body: JSON.stringify({
 				name: t,
 				version: 1
@@ -806,53 +811,53 @@ var ct = class {
 		}));
 	}
 	async deleteFlow(e) {
-		return Fe(await this.request(`/v1/flows/${D(e)}`, { method: "DELETE" }));
+		return D(await this.request(`/v1/flows/${O(e)}`, { method: "DELETE" }));
 	}
 	async listTriggerKeys(e) {
 		let t = S(await this.request("/v1/trigger-keys", { signal: e }));
-		return t.version != 1 || !Array.isArray(t.keys) ? x() : t.keys.map(we);
+		return t.version != 1 || !Array.isArray(t.keys) ? x() : t.keys.map(Te);
 	}
 	async listTriggerDefinitions(e) {
 		let t = S(await this.request("/v1/trigger-keys/catalog", { signal: e }));
-		return t.version != 1 || !Array.isArray(t.definitions) ? x() : t.definitions.map(Te);
+		return t.version != 1 || !Array.isArray(t.definitions) ? x() : t.definitions.map(Ee);
 	}
 	async getTriggerKey(e, t) {
-		let n = S(await this.request(`/v1/trigger-keys/${D(e)}`, { signal: t }));
-		return n.version == 1 ? Te(n.definition) : x();
+		let n = S(await this.request(`/v1/trigger-keys/${O(e)}`, { signal: t }));
+		return n.version == 1 ? Ee(n.definition) : x();
 	}
 	async listFlowTriggerBindings(e, t) {
-		let n = S(await this.request(`/v1/flows/${D(e)}/triggers`, { signal: t }));
-		return n.version != 1 || C(n.flowId) != e || !Array.isArray(n.bindings) ? x() : n.bindings.map(Ae);
+		let n = S(await this.request(`/v1/flows/${O(e)}/triggers`, { signal: t }));
+		return n.version != 1 || C(n.flowId) != e || !Array.isArray(n.bindings) ? x() : n.bindings.map(je);
 	}
 	async getFlowTriggerBinding(e, t) {
-		return je(await this.request(`/v1/flows/${D(e)}/triggers/${D(t)}`));
+		return Me(await this.request(`/v1/flows/${O(e)}/triggers/${O(t)}`));
 	}
 	async listFlowTriggerActivities(e, t, n = {}) {
 		let r = new URLSearchParams();
 		n.cursor != null && r.set("cursor", n.cursor), n.limit != null && r.set("limit", String(n.limit));
 		let i = r.size == 0 ? "" : `?${r}`;
-		return Ne(await this.request(`/v1/flows/${D(e)}/triggers/${D(t)}/activities${i}`));
+		return Pe(await this.request(`/v1/flows/${O(e)}/triggers/${O(t)}/activities${i}`));
 	}
 	async pauseFlowTrigger(e, t) {
-		return Ae(await this.request(`/v1/flows/${D(e)}/triggers/${D(t)}/pause`, {
+		return je(await this.request(`/v1/flows/${O(e)}/triggers/${O(t)}/pause`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async resumeFlowTrigger(e, t) {
-		return Ae(await this.request(`/v1/flows/${D(e)}/triggers/${D(t)}/resume`, {
+		return je(await this.request(`/v1/flows/${O(e)}/triggers/${O(t)}/resume`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async testFlowPollTrigger(e, t) {
-		return Pe(await this.request(`/v1/flows/${D(e)}/triggers/${D(t)}/test`, {
+		return Fe(await this.request(`/v1/flows/${O(e)}/triggers/${O(t)}/test`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async getEditor(e) {
-		let t = S(await this.request(`/v1/flows/${D(e)}/editor`));
+		let t = S(await this.request(`/v1/flows/${O(e)}/editor`));
 		if (w(t, [
 			"flow",
 			"draft",
@@ -861,7 +866,7 @@ var ct = class {
 			"version"
 		]), t.version != 1) return x();
 		let n = {
-			flow: Fe(t.flow),
+			flow: D(t.flow),
 			draft: ze(t.draft),
 			live: qe(t.live),
 			presentation: Be(t.presentation),
@@ -870,20 +875,20 @@ var ct = class {
 		return n.flow.flowId != e || n.draft.flowId != e || n.live.flowId != e || n.flow.draftRevisionId != n.draft.revisionId ? x() : n;
 	}
 	async getPresentation(e) {
-		return Be(await this.request(`/v1/flows/${D(e)}/presentation`));
+		return Be(await this.request(`/v1/flows/${O(e)}/presentation`));
 	}
 	async getDraft(e) {
-		return ze(await this.request(`/v1/flows/${D(e)}/draft`));
+		return ze(await this.request(`/v1/flows/${O(e)}/draft`));
 	}
 	async syncDraft(e) {
-		return He(await this.request(`/v1/flows/${D(e)}/draft/sync`));
+		return He(await this.request(`/v1/flows/${O(e)}/draft/sync`));
 	}
 	async getRevision(e, t) {
-		return ze(await this.request(`/v1/flows/${D(e)}/revisions/${D(t)}`));
+		return ze(await this.request(`/v1/flows/${O(e)}/revisions/${O(t)}`));
 	}
 	async listConnectorProviders(e, t) {
-		let n = S(await this.request(`/v1/connector/providers${t == null ? "" : `?flowId=${D(t)}`}`, { signal: e }));
-		return w(n, ["providers", "version"]), n.version != 1 || !Array.isArray(n.providers) ? x() : n.providers.map(Ce);
+		let n = S(await this.request(`/v1/connector/providers${t == null ? "" : `?flowId=${O(t)}`}`, { signal: e }));
+		return w(n, ["providers", "version"]), n.version != 1 || !Array.isArray(n.providers) ? x() : n.providers.map(we);
 	}
 	async listConnectorActions(e, t, n) {
 		return await this.connectorActions({
@@ -898,19 +903,19 @@ var ct = class {
 		}, t);
 	}
 	async getConnectorAction(e, t, n) {
-		let r = S(await this.request(`/v1/connector/actions/${D(e)}${n == null ? "" : `?flowId=${D(n)}`}`, { signal: t }));
-		return w(r, ["action", "version"]), r.version == 1 ? Se(r.action) : x();
+		let r = S(await this.request(`/v1/connector/actions/${O(e)}${n == null ? "" : `?flowId=${O(n)}`}`, { signal: t }));
+		return w(r, ["action", "version"]), r.version == 1 ? Ce(r.action) : x();
 	}
 	async listConnectorConnections(e, t, n) {
-		let r = S(await this.request(`/v1/connector/connections/${D(e)}${n == null ? "" : `?flowId=${D(n)}`}`, { signal: t }));
+		let r = S(await this.request(`/v1/connector/connections/${O(e)}${n == null ? "" : `?flowId=${O(n)}`}`, { signal: t }));
 		return w(r, [
 			"connections",
 			"serviceId",
 			"version"
-		]), r.version != 1 || C(r.serviceId) != e || !Array.isArray(r.connections) ? x() : r.connections.map(ve);
+		]), r.version != 1 || C(r.serviceId) != e || !Array.isArray(r.connections) ? x() : r.connections.map(ye);
 	}
 	async createConnectorConnectionPage(e, t) {
-		let n = S(await this.request(`/v1/connector/connections/${D(e)}/page${t == null ? "" : `?flowId=${D(t)}`}`, {
+		let n = S(await this.request(`/v1/connector/connections/${O(e)}/page${t == null ? "" : `?flowId=${O(t)}`}`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
@@ -923,7 +928,7 @@ var ct = class {
 		}
 	}
 	async changeDraft(e, t, n, r = st("change")) {
-		return Ve(await this.request(`/v1/flows/${D(e)}/draft/changes`, {
+		return Ve(await this.request(`/v1/flows/${O(e)}/draft/changes`, {
 			body: JSON.stringify({
 				expectedRevisionId: t,
 				operations: n,
@@ -934,7 +939,7 @@ var ct = class {
 		}));
 	}
 	async checkFlow(e, t) {
-		return Ke(await this.request(`/v1/flows/${D(e)}/revisions/${D(t)}/check`, {
+		return Ke(await this.request(`/v1/flows/${O(e)}/revisions/${O(t)}/check`, {
 			body: JSON.stringify({
 				engineContract: "open-flow-engine/v2",
 				version: 1
@@ -943,16 +948,16 @@ var ct = class {
 		}));
 	}
 	async getLive(e, t) {
-		return qe(await this.request(`/v1/flows/${D(e)}/live`, { signal: t }));
+		return qe(await this.request(`/v1/flows/${O(e)}/live`, { signal: t }));
 	}
 	async listPublications(e, t = {}, n) {
 		let r = new URLSearchParams();
 		t.cursor != null && r.set("cursor", t.cursor), t.limit != null && r.set("limit", String(t.limit)), t.includeTotal != null && r.set("includeTotal", String(t.includeTotal));
 		let i = r.size == 0 ? "" : `?${r}`;
-		return Je(await this.request(`/v1/flows/${D(e)}/publications${i}`, { signal: n }));
+		return Je(await this.request(`/v1/flows/${O(e)}/publications${i}`, { signal: n }));
 	}
 	async createDraftRun(e, t, n) {
-		let r = $e(await this.request(`/v1/flows/${D(e)}/revisions/${D(t)}/runs`, {
+		let r = $e(await this.request(`/v1/flows/${O(e)}/revisions/${O(t)}/runs`, {
 			body: JSON.stringify({
 				engineContract: "open-flow-engine/v2",
 				inputs: n.inputs ?? {},
@@ -978,7 +983,7 @@ var ct = class {
 		return n.source == "live" ? n : x();
 	}
 	async setFlowEnabled(e, t, n) {
-		return Fe(await this.request(`/v1/flows/${D(e)}/enabled`, {
+		return D(await this.request(`/v1/flows/${O(e)}/enabled`, {
 			method: "PUT",
 			body: JSON.stringify({
 				enabled: n,
@@ -988,7 +993,7 @@ var ct = class {
 		}));
 	}
 	async publishFlow(e, t, n, r = {}) {
-		return We(await this.request(`/v1/flows/${D(e)}/revisions/${D(t)}/publications`, {
+		return We(await this.request(`/v1/flows/${O(e)}/revisions/${O(t)}/publications`, {
 			body: JSON.stringify({
 				engineContract: "open-flow-engine/v2",
 				expectedLivePublicationId: n,
@@ -999,10 +1004,10 @@ var ct = class {
 		}));
 	}
 	async getPublishOperation(e, t, n) {
-		return We(await this.request(`/v1/flows/${D(e)}/publish-operations/${D(t)}`, { signal: n }));
+		return We(await this.request(`/v1/flows/${O(e)}/publish-operations/${O(t)}`, { signal: n }));
 	}
 	async rollbackFlow(e, t, n, r = {}) {
-		return Ue(await this.request(`/v1/flows/${D(e)}/publications/${D(t)}/rollback`, {
+		return Ue(await this.request(`/v1/flows/${O(e)}/publications/${O(t)}/rollback`, {
 			body: JSON.stringify({
 				expectedLivePublicationId: n,
 				version: 1
@@ -1012,31 +1017,31 @@ var ct = class {
 		}));
 	}
 	async getRun(e, t) {
-		return $e(await this.request(`/v1/runs/${D(e)}`, { signal: t }));
+		return $e(await this.request(`/v1/runs/${O(e)}`, { signal: t }));
 	}
 	async listRuns(e, t = {}) {
 		let n = new URLSearchParams();
 		t.cursor != null && n.set("cursor", t.cursor), t.limit != null && n.set("limit", String(t.limit)), t.status != null && n.set("status", t.status);
 		let r = n.size == 0 ? "" : `?${n}`;
-		return et(await this.request(`/v1/flows/${D(e)}/runs${r}`));
+		return et(await this.request(`/v1/flows/${O(e)}/runs${r}`));
 	}
 	async getRunEvents(e, t = {}, n) {
 		let r = new URLSearchParams();
 		t.after != null && r.set("after", String(t.after)), t.limit != null && r.set("limit", String(t.limit));
 		let i = r.size == 0 ? "" : `?${r}`;
-		return rt(await this.request(`/v1/runs/${D(e)}/events${i}`, { signal: n }));
+		return rt(await this.request(`/v1/runs/${O(e)}/events${i}`, { signal: n }));
 	}
 	async getRunResult(e, t) {
-		return ot(await this.request(`/v1/runs/${D(e)}/result`, { signal: t }));
+		return ot(await this.request(`/v1/runs/${O(e)}/result`, { signal: t }));
 	}
 	async cancelRun(e) {
-		return it(await this.request(`/v1/runs/${D(e)}/cancel`, {
+		return it(await this.request(`/v1/runs/${O(e)}/cancel`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async resolveRunWait(e, t, n) {
-		return at(await this.request(`/v1/runs/${D(e)}/waits/${D(t)}/resolve`, {
+		return at(await this.request(`/v1/runs/${O(e)}/waits/${O(t)}/resolve`, {
 			body: JSON.stringify({
 				action: n,
 				version: 1
@@ -1045,8 +1050,8 @@ var ct = class {
 		}));
 	}
 	async connectorActions(e, t) {
-		let n = Object.entries(e).map(([e, t]) => `${D(e)}=${D(t)}`).join("&"), r = n == "" ? "" : `?${n}`, i = S(await this.request(`/v1/connector/actions${r}`, { signal: t }));
-		return w(i, ["actions", "version"]), i.version != 1 || !Array.isArray(i.actions) ? x() : i.actions.map(Se);
+		let n = Object.entries(e).map(([e, t]) => `${O(e)}=${O(t)}`).join("&"), r = n == "" ? "" : `?${n}`, i = S(await this.request(`/v1/connector/actions${r}`, { signal: t }));
+		return w(i, ["actions", "version"]), i.version != 1 || !Array.isArray(i.actions) ? x() : i.actions.map(Ce);
 	}
 	async request(e, t = {}) {
 		let n = new Headers(t.headers);
@@ -1062,7 +1067,7 @@ var ct = class {
 		}
 		if (!r.ok) {
 			let e = S(i).error, t = e == null ? void 0 : S(e);
-			throw new _e(r.status, typeof t?.code == "string" ? t.code : "request.failed", typeof t?.message == "string" ? t.message : `Request failed with status ${r.status}.`);
+			throw new ve(r.status, typeof t?.code == "string" ? t.code : "request.failed", typeof t?.message == "string" ? t.message : `Request failed with status ${r.status}.`);
 		}
 		return i;
 	}
@@ -5877,7 +5882,7 @@ function Et({ className: e, align: t = "inline-start", ...n }) {
 		...n
 	});
 }
-var Dt = ue.forwardRef(function({ className: e, ...t }, n) {
+var Dt = de.forwardRef(function({ className: e, ...t }, n) {
 	return /* @__PURE__ */ v(c, {
 		ref: n,
 		"data-slot": "input-group-control",
@@ -5902,10 +5907,10 @@ function kt(e, t) {
 //#endregion
 //#region src/workbench/browser/runtime/shell/hostMenu.tsx
 function At({ action: e, onAction: t, title: n }) {
-	let [r, i] = de(null);
+	let [r, i] = fe(null);
 	return /* @__PURE__ */ v("div", {
 		ref: i,
-		children: /* @__PURE__ */ fe(h, { children: [/* @__PURE__ */ v(te, {
+		children: /* @__PURE__ */ pe(te, { children: [/* @__PURE__ */ v(g, {
 			"aria-label": e,
 			render: /* @__PURE__ */ v(o, {
 				size: "icon",
@@ -5918,7 +5923,7 @@ function At({ action: e, onAction: t, title: n }) {
 			className: "min-w-40",
 			container: r,
 			side: "bottom",
-			children: /* @__PURE__ */ fe(ne, { children: [/* @__PURE__ */ v(ae, { children: n }), /* @__PURE__ */ v(re, {
+			children: /* @__PURE__ */ pe(ne, { children: [/* @__PURE__ */ v(ae, { children: n }), /* @__PURE__ */ v(re, {
 				onClick: t,
 				variant: "destructive",
 				children: e
@@ -5934,19 +5939,19 @@ function Mt(e, t) {
 		case "condition": return "Condition";
 		case "value": return "Value";
 		case "wait": return "Wait";
-		case "subflow": return p(e.document.subflows[t.subflowId]?.name ?? "") || "Subflow";
-		case "task": return p(t.task == null ? e.document.tasks[t.taskId]?.name ?? "" : t.task.name) || "Task";
+		case "subflow": return m(e.document.subflows[t.subflowId]?.name ?? "") || "Subflow";
+		case "task": return m(t.task == null ? e.document.tasks[t.taskId]?.name ?? "" : t.task.name) || "Task";
 		case "manual": return "Manual Trigger";
 		case "webhook": return "Webhook";
 		case "cron": return "Scheduled Trigger";
 		case "integration":
-		case "poll": return p(t.definition.displayName) || "Trigger";
+		case "poll": return m(t.definition.displayName) || "Trigger";
 	}
 }
 function Nt(e, t, n) {
 	let r = /* @__PURE__ */ new Set(), i = [];
 	for (let [n, a] of Object.entries(t.nodes)) {
-		let t = p(a.name ?? "") || Mt(e, a), o = d(t, r);
+		let t = m(a.name ?? "") || Mt(e, a), o = d(t, r);
 		r.add(o), a.name != o && i.push({
 			name: o,
 			node: a,
@@ -6205,7 +6210,7 @@ function Ut(e, t, n) {
 			moduleId: n.task.moduleId
 		}] : []];
 	});
-	if (t.kind == "subflow") return O(e, a);
+	if (t.kind == "subflow") return k(e, a);
 	let o = new Set(n.flatMap((e) => {
 		let t = r[e];
 		return t?.kind == "poll" || t?.kind == "integration" ? [t.bindingId] : [];
@@ -6214,7 +6219,7 @@ function Ut(e, t, n) {
 		bindingId: t,
 		kind: "binding.delete"
 	});
-	return O(e, a);
+	return k(e, a);
 }
 function Wt(e, t, n, r) {
 	let i = en(e, t)?.nodes[n];
@@ -6257,11 +6262,11 @@ function Kt(e, t, n, r) {
 			value: c
 		});
 	}
-	return O(e, o);
+	return k(e, o);
 }
 function qt(e, t, n, r, i) {
 	let a = (t.kind == "flow" ? e.document.graph : e.document.subflows[t.id]?.graph)?.nodes[n];
-	return a == null || !("inputs" in a) ? [] : O(e, [{
+	return a == null || !("inputs" in a) ? [] : k(e, [{
 		kind: "graph.node.input.set",
 		nodeId: n,
 		handle: r,
@@ -6289,7 +6294,7 @@ function Jt(e, t, n, r, i, a) {
 		},
 		bindingId: a,
 		kind: "binding.create"
-	}, ...O(e, [{
+	}, ...k(e, [{
 		before: s,
 		handle: r,
 		kind: "graph.node.input.set",
@@ -6304,8 +6309,8 @@ function Jt(e, t, n, r, i, a) {
 		}
 	}])];
 }
-function O(e, t) {
-	let n = Yt(e.document), r = m(e, t), i = Yt(r.document);
+function k(e, t) {
+	let n = Yt(e.document), r = h(e, t), i = Yt(r.document);
 	return [...t, ...[...n.keys()].flatMap((e) => i.has(e) || r.document.bindings[e]?.kind != "variable" ? [] : [{
 		bindingId: e,
 		kind: "binding.delete"
@@ -6522,8 +6527,8 @@ var pn = class {
 	"request.failed": "notice.requestFailed",
 	"response.invalid": "notice.error.responseInvalid"
 };
-function k(e, t) {
-	if (e instanceof _e) {
+function A(e, t) {
+	if (e instanceof ve) {
 		let n = mn[e.code];
 		return n == null ? {
 			kind: "error",
@@ -6591,26 +6596,23 @@ function bn(e, t) {
 }
 //#endregion
 //#region src/json-schema-subset/expression/result.ts
-var A = Object.freeze({
+var j = Object.freeze({
 	Equals: 0,
 	Containing: 1,
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), j = Dn(A.Equals), M = Dn(A.Containing), N = Dn(A.ContainedBy), P = Dn(A.Rejection), F = Dn(A.Intersection), xn = _n([
-	[A.Equals, j],
-	[A.Containing, M],
-	[A.ContainedBy, N],
-	[A.Rejection, P],
-	[A.Intersection, F]
-]), I = (() => {
+}), M = On(j.Equals), N = On(j.Containing), P = On(j.ContainedBy), F = On(j.Rejection), I = On(j.Intersection), xn = _n([
+	[j.Equals, M],
+	[j.Containing, N],
+	[j.ContainedBy, P],
+	[j.Rejection, F],
+	[j.Intersection, I]
+]), Sn = (() => {
 	let e = 0;
 	for (let [t, n] of xn) e |= n;
 	return e;
 })();
-function Sn(e) {
-	return !!(e & j);
-}
 function Cn(e) {
 	return !!(e & M);
 }
@@ -6624,21 +6626,24 @@ function En(e) {
 	return !!(e & F);
 }
 function Dn(e) {
+	return !!(e & I);
+}
+function On(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function On(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : kn(t, r, e), n += 1, t) };
+function kn(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : An(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function kn(e, t, n) {
+function An(e, t, n) {
 	let r = 0;
 	for (let [i, a] of xn) if (a & e) {
-		for (let [e, a] of xn) if (a & t && (r |= n(i, e), r === I)) return r;
+		for (let [e, a] of xn) if (a & t && (r |= n(i, e), r === Sn)) return r;
 	}
 	return r;
 }
@@ -6652,271 +6657,271 @@ var L = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function An(e, t) {
+function jn(e, t) {
 	switch (e) {
 		case L.Save: return t[0];
-		case L.OneOf: return Mn(t);
+		case L.OneOf: return Nn(t);
 		case L.AllOf:
-		case L.AnyOf: return Nn(e, t);
+		case L.AnyOf: return Pn(e, t);
 		case L.Not:
-		case L.Swap: return Pn(e, t[0]);
+		case L.Swap: return Fn(e, t[0]);
 	}
 }
-function jn(e) {
-	return Pn(L.Swap, e);
-}
 function Mn(e) {
+	return Fn(L.Swap, e);
+}
+function Nn(e) {
 	if (e.length === 1) return e[0];
-	let t = Nn(L.AnyOf, e), n = [];
+	let t = Pn(L.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 = Nn(L.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = Pn(L.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = Nn(L.AnyOf, n), i = Pn(L.Not, r);
-	return Nn(L.AllOf, [t, i]);
+	let r = Pn(L.AnyOf, n), i = Fn(L.Not, r);
+	return Pn(L.AllOf, [t, i]);
 }
-function Nn(e, t) {
+function Pn(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
 		case L.AllOf:
-			n = On(Fn);
+			n = kn(In);
 			break;
 		case L.AnyOf:
-			n = On(In);
+			n = kn(Ln);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function Pn(e, t) {
+function Fn(e, t) {
 	let n, r = 0;
 	switch (e) {
 		case L.Not:
-			n = Ln;
+			n = Rn;
 			break;
 		case L.Swap:
-			n = Rn;
+			n = zn;
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let [e, i] of xn) i & t && (r |= n(e));
 	return r;
 }
-function Fn(e, t) {
+function In(e, t) {
 	let n = 0;
 	switch (e) {
-		case A.Equals:
+		case j.Equals:
 			switch (t) {
-				case A.Equals:
-					n = j;
+				case j.Equals:
+					n = M;
 					break;
-				case A.Containing:
-					n = j;
+				case j.Containing:
+					n = M;
 					break;
-				case A.ContainedBy:
-					n = N;
+				case j.ContainedBy:
+					n = P;
 					break;
-				case A.Rejection:
+				case j.Rejection:
 					n = 0;
 					break;
-				case A.Intersection: n = N;
+				case j.Intersection: n = P;
 			}
 			break;
-		case A.Containing:
+		case j.Containing:
 			switch (t) {
-				case A.Equals:
-					n = j;
-					break;
-				case A.Containing:
-					n = j | M;
+				case j.Equals:
+					n = M;
 					break;
-				case A.ContainedBy:
-					n = N;
+				case j.Containing:
+					n = M | N;
 					break;
-				case A.Rejection:
+				case j.ContainedBy:
 					n = P;
 					break;
-				case A.Intersection: n = F | N;
+				case j.Rejection:
+					n = F;
+					break;
+				case j.Intersection: n = I | P;
 			}
 			break;
-		case A.ContainedBy:
+		case j.ContainedBy:
 			switch (t) {
-				case A.Equals:
-					n = N;
+				case j.Equals:
+					n = P;
 					break;
-				case A.Containing:
-					n = N;
+				case j.Containing:
+					n = P;
 					break;
-				case A.ContainedBy:
-					n = N;
+				case j.ContainedBy:
+					n = P;
 					break;
-				case A.Rejection:
+				case j.Rejection:
 					n = 0;
 					break;
-				case A.Intersection: n = N;
+				case j.Intersection: n = P;
 			}
 			break;
-		case A.Rejection:
+		case j.Rejection:
 			switch (t) {
-				case A.Equals:
+				case j.Equals:
 					n = 0;
 					break;
-				case A.Containing:
-					n = P;
+				case j.Containing:
+					n = F;
 					break;
-				case A.ContainedBy:
+				case j.ContainedBy:
 					n = 0;
 					break;
-				case A.Rejection:
-					n = P;
+				case j.Rejection:
+					n = F;
 					break;
-				case A.Intersection: n = P;
+				case j.Intersection: n = F;
 			}
 			break;
-		case A.Intersection: switch (t) {
-			case A.Equals:
-				n = N;
-				break;
-			case A.Containing:
-				n = F | N;
+		case j.Intersection: switch (t) {
+			case j.Equals:
+				n = P;
 				break;
-			case A.ContainedBy:
-				n = N;
+			case j.Containing:
+				n = I | P;
 				break;
-			case A.Rejection:
+			case j.ContainedBy:
 				n = P;
 				break;
-			case A.Intersection: n = N | P | F;
+			case j.Rejection:
+				n = F;
+				break;
+			case j.Intersection: n = P | F | I;
 		}
 	}
 	return n;
 }
-function In(e, t) {
+function Ln(e, t) {
 	let n = 0;
 	switch (e) {
-		case A.Equals:
+		case j.Equals:
 			switch (t) {
-				case A.Equals:
-					n = j;
-					break;
-				case A.Containing:
+				case j.Equals:
 					n = M;
 					break;
-				case A.ContainedBy:
-					n = j;
+				case j.Containing:
+					n = N;
 					break;
-				case A.Rejection:
+				case j.ContainedBy:
 					n = M;
 					break;
-				case A.Intersection: n = M;
+				case j.Rejection:
+					n = N;
+					break;
+				case j.Intersection: n = N;
 			}
 			break;
-		case A.Containing:
+		case j.Containing:
 			switch (t) {
-				case A.Equals:
-					n = M;
+				case j.Equals:
+					n = N;
 					break;
-				case A.Containing:
-					n = M;
+				case j.Containing:
+					n = N;
 					break;
-				case A.ContainedBy:
-					n = M;
+				case j.ContainedBy:
+					n = N;
 					break;
-				case A.Rejection:
-					n = M;
+				case j.Rejection:
+					n = N;
 					break;
-				case A.Intersection: n = M;
+				case j.Intersection: n = N;
 			}
 			break;
-		case A.ContainedBy:
+		case j.ContainedBy:
 			switch (t) {
-				case A.Equals:
-					n = j;
-					break;
-				case A.Containing:
+				case j.Equals:
 					n = M;
 					break;
-				case A.ContainedBy:
-					n = j | N;
+				case j.Containing:
+					n = N;
 					break;
-				case A.Rejection:
-					n = F;
+				case j.ContainedBy:
+					n = M | P;
+					break;
+				case j.Rejection:
+					n = I;
 					break;
-				case A.Intersection: n = M | F;
+				case j.Intersection: n = N | I;
 			}
 			break;
-		case A.Rejection:
+		case j.Rejection:
 			switch (t) {
-				case A.Equals:
-					n = M;
+				case j.Equals:
+					n = N;
 					break;
-				case A.Containing:
-					n = M;
+				case j.Containing:
+					n = N;
 					break;
-				case A.ContainedBy:
-					n = F;
+				case j.ContainedBy:
+					n = I;
 					break;
-				case A.Rejection:
-					n = P;
+				case j.Rejection:
+					n = F;
 					break;
-				case A.Intersection: n = F;
+				case j.Intersection: n = I;
 			}
 			break;
-		case A.Intersection: switch (t) {
-			case A.Equals:
-				n = M;
+		case j.Intersection: switch (t) {
+			case j.Equals:
+				n = N;
 				break;
-			case A.Containing:
-				n = M;
+			case j.Containing:
+				n = N;
 				break;
-			case A.ContainedBy:
-				n = M | F;
+			case j.ContainedBy:
+				n = N | I;
 				break;
-			case A.Rejection:
-				n = F;
+			case j.Rejection:
+				n = I;
 				break;
-			case A.Intersection: n = M | F;
+			case j.Intersection: n = N | I;
 		}
 	}
 	return n;
 }
-function Ln(e) {
+function Rn(e) {
 	let t = 0;
 	switch (e) {
-		case A.Equals:
-			t = P;
-			break;
-		case A.Containing:
-			t = P;
+		case j.Equals:
+			t = F;
 			break;
-		case A.ContainedBy:
+		case j.Containing:
 			t = F;
 			break;
-		case A.Rejection:
-			t = j | M;
+		case j.ContainedBy:
+			t = I;
+			break;
+		case j.Rejection:
+			t = M | N;
 			break;
-		case A.Intersection: t = N | F;
+		case j.Intersection: t = P | I;
 	}
 	return t;
 }
-function Rn(e) {
+function zn(e) {
 	let t = 0;
 	switch (e) {
-		case A.Equals:
-			t = j;
-			break;
-		case A.Containing:
-			t = N;
-			break;
-		case A.ContainedBy:
+		case j.Equals:
 			t = M;
 			break;
-		case A.Rejection:
+		case j.Containing:
 			t = P;
 			break;
-		case A.Intersection: t = F;
+		case j.ContainedBy:
+			t = N;
+			break;
+		case j.Rejection:
+			t = F;
+			break;
+		case j.Intersection: t = I;
 	}
 	return t;
 }
@@ -6928,7 +6933,7 @@ var R = Object.freeze({
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), zn = (e) => (t, n) => {
+}), Bn = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
@@ -6953,7 +6958,7 @@ var R = Object.freeze({
 		for (; a.length > 0;) c(a.pop());
 	}
 	function o(t) {
-		let n = j, [r, o] = t.expressions;
+		let n = M, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
 			if (a.kind !== R.Leaf) {
@@ -7019,8 +7024,8 @@ var R = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = An(t.operator, t.results);
-		if (r === 0 && (r = N), t.willSwap && (r = jn(r)), n) {
+		let t = e.calculation, n = e.parent, r = jn(t.operator, t.results);
+		if (r === 0 && (r = P), t.willSwap && (r = Mn(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);
 		}
@@ -7028,37 +7033,37 @@ var R = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, Bn = class extends Error {
+}, Vn = class extends Error {
 	constructor(e = []) {
-		super(Un(e)), this.name = "SchemaError", this.items = e;
+		super(Wn(e)), this.name = "SchemaError", this.items = e;
 	}
-}, Vn = Object.freeze({
+}, Hn = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Hn(e) {
+function Un(e) {
 	switch (e.kind) {
-		case Vn.Compiled: {
+		case Hn.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case Vn.External: return String(e.error);
+		case Hn.External: return String(e.error);
 	}
 }
-function Un(e) {
+function Wn(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Hn(e[0]);
-		default: return `${Hn(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Un(e[0]);
+		default: return `${Un(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Wn = /* @__PURE__ */ new Set(/* @__PURE__ */ "type.enum.const.multipleOf.maximum.exclusiveMaximum.minimum.exclusiveMinimum.maxLength.minLength.pattern.items.additionalItems.maxItems.minItems.uniqueItems.contains.maxProperties.minProperties.required.properties.patternProperties.additionalProperties.dependencies.propertyNames.if.then.else.allOf.anyOf.oneOf.not.format.contentMediaType.contentEncoding.definitions".split("."));
+var Gn = /* @__PURE__ */ new Set(/* @__PURE__ */ "type.enum.const.multipleOf.maximum.exclusiveMaximum.minimum.exclusiveMinimum.maxLength.minLength.pattern.items.additionalItems.maxItems.minItems.uniqueItems.contains.maxProperties.minProperties.required.properties.patternProperties.additionalProperties.dependencies.propertyNames.if.then.else.allOf.anyOf.oneOf.not.format.contentMediaType.contentEncoding.definitions".split("."));
 function z(e) {
-	return Wn.has(e);
+	return Gn.has(e);
 }
-function Gn(e) {
+function Kn(e) {
 	for (let t in e) if (z(t)) return !1;
 	return !0;
 }
@@ -7072,35 +7077,35 @@ function V(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function Kn({ path: e, errors: t }, n, ...r) {
-	t.push(qn(e, r, n));
+function qn({ path: e, errors: t }, n, ...r) {
+	t.push(Jn(e, r, n));
 }
 function H({ path: e, warns: t }, n, ...r) {
-	t.push(qn(e, r, n));
+	t.push(Jn(e, r, n));
 }
-function qn(e, t, n) {
+function Jn(e, t, n) {
 	return {
-		kind: Vn.Compiled,
+		kind: Hn.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function Jn(e) {
+function Yn(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] : Yn(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : Xn(n) && delete e[t]);
 	}
 	return e;
 }
-function Yn(e) {
+function Xn(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var Xn = Symbol("compiledId"), Zn = Symbol("compiledKind"), Qn = Symbol("compiledPath"), $n = Symbol("validatorLoader"), U = Object.freeze({
+var Zn = Symbol("compiledId"), Qn = Symbol("compiledKind"), $n = Symbol("compiledPath"), er = Symbol("validatorLoader"), U = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -7113,28 +7118,28 @@ var Xn = Symbol("compiledId"), Zn = Symbol("compiledKind"), Qn = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), er = _n(sr(U.Any, gn(), {}, () => () => !0)), tr = _n(sr(U.Never, gn(), {
+}), tr = _n(cr(U.Any, gn(), {}, () => () => !0)), nr = _n(cr(U.Never, gn(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function nr(e) {
-	return typeof e != "object" || !e ? !1 : Xn in e;
+function rr(e) {
+	return typeof e != "object" || !e ? !1 : Zn in e;
 }
 function W(e) {
-	return typeof e != "object" || !e ? !1 : Xn in e && Zn in e;
+	return typeof e != "object" || !e ? !1 : Zn in e && Qn in e;
 }
 function G(e) {
-	return W(e) ? e[Zn] : U.Extends;
-}
-function rr(e) {
-	return W(e) || nr(e) ? e[Xn] : e.id;
+	return W(e) ? e[Qn] : U.Extends;
 }
 function ir(e) {
-	return W(e) ? e[Qn] : void 0;
+	return W(e) || rr(e) ? e[Zn] : e.id;
 }
 function ar(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, Xn, {
+	return W(e) ? e[$n] : void 0;
+}
+function or(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, Zn, {
 		value: gn(),
 		configurable: !1,
 		writable: !1,
@@ -7142,33 +7147,33 @@ function ar(e) {
 	}), e;
 }
 function K(e, t, n, r = []) {
-	return sr(e, gn(), t, n && (() => n.compile(t)), r);
+	return cr(e, gn(), t, n && (() => n.compile(t)), r);
 }
-function or(e) {
-	return sr(U.Never, gn(), { ...e }, e[$n], e[Qn]);
+function sr(e) {
+	return cr(U.Never, gn(), { ...e }, e[er], e[$n]);
 }
-function sr(e, t, n, r, i = []) {
+function cr(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[Zn]: {
+		[Qn]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Xn]: {
+		[Zn]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Qn]: {
+		[$n]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[$n]: {
+		[er]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -7185,16 +7190,16 @@ function sr(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function cr(e, t) {
-	let n = lr(e, t), r = ur(e, "maxItems", t), i = ur(e, "minItems", t), a = dr(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = fr(e, t) : t.additionalItems && H(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function lr(e, t) {
+	let n = ur(e, t), r = dr(e, "maxItems", t), i = dr(e, "minItems", t), a = fr(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = pr(e, t) : t.additionalItems && H(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 = pr(s, e.delegate));
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = mr(s, e.delegate));
 		let t = n.findIndex((e) => G(e) === U.Never);
-		t !== -1 && (n = n.splice(t), s = pr(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (H(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && G(s) === U.Never && (c = !0);
+		t !== -1 && (n = n.splice(t), s = mr(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (H(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && G(s) === U.Never && (c = !0);
 	} else G(n) === U.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || H(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), K(c ? U.Never : U.Array, Jn({
+	return r !== void 0 && i !== void 0 && r < i && (l || H(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), K(c ? U.Never : U.Array, Yn({
 		type: "array",
 		items: n,
 		contains: a,
@@ -7204,7 +7209,7 @@ function cr(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function lr(e, { items: t }) {
+function ur(e, { items: t }) {
 	if (!t) return K(U.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
@@ -7220,7 +7225,7 @@ function lr(e, { items: t }) {
 	}
 	return J(B(e, "items"), V(t));
 }
-function ur(e, t, n) {
+function dr(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -7234,32 +7239,32 @@ function ur(e, t, n) {
 		return r;
 	}
 }
-function dr(e, { contains: t }) {
+function fr(e, { contains: t }) {
 	return t ? J(B(e, "contains"), V(t)) : K(U.Any, {}, e.delegate, e.path);
 }
-function fr(e, { additionalItems: t }) {
+function pr(e, { additionalItems: t }) {
 	switch (typeof t) {
 		case "boolean": return t ? K(U.Any, {}, e.delegate, e.path) : !1;
 		case "object": return J(B(e, "additionalItems"), t);
 		default: return K(U.Any, {}, e.delegate, e.path);
 	}
 }
-function pr(e, t) {
+function mr(e, t) {
 	return e === void 0 ? K(U.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : W(e) ? G(e) === U.Never ? e : or(e) : e;
+	}, t) : W(e) ? G(e) === U.Never ? e : sr(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var mr = Object.freeze([
+var hr = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function hr(e, t, n, r) {
-	if (n.length === 0) return Kn(e, "disable empty list", t), null;
+function gr(e, t, n, r) {
+	if (n.length === 0) return qn(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
 		let n = J(B(e, t, r), V(a));
@@ -7276,7 +7281,7 @@ function hr(e, t, n, r) {
 	let s = U.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = U.Never : a === i.length ? s = U.Any : gr(i) || (s = U.Never);
+			o > 0 ? s = U.Never : a === i.length ? s = U.Any : _r(i) || (s = U.Never);
 			break;
 		case "anyOf":
 			a > 0 ? s = U.Any : o === i.length && (s = U.Never);
@@ -7285,7 +7290,7 @@ function hr(e, t, n, r) {
 	}
 	return K(s, { [t]: i }, r, e.path);
 }
-function gr(e) {
+function _r(e) {
 	let t = null;
 	for (let n of e) {
 		let e = G(n);
@@ -7305,26 +7310,26 @@ var q = Object.freeze({
 	Invalid: 1,
 	Unknown: 2
 });
-function _r(e, t) {
+function vr(e, t) {
 	let n = e.isValid;
 	return n ? n(t) === !0 ? q.Valid : q.Invalid : q.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function vr(e, t, n, r) {
+function yr(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return Kn(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return qn(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (_r(r, a)) {
+		for (let [n, a] of t.entries()) switch (vr(r, a)) {
 			case q.Valid:
-				i.push(ar(a));
+				i.push(or(a));
 				break;
 			case q.Invalid: H(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
 		i.length === 0 && H(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && _r(r, n) === q.Invalid && (a = !0), i) {
+	if (n && vr(r, n) === q.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
@@ -7336,11 +7341,11 @@ function vr(e, t, n, r) {
 		}
 	}
 	let o = a ? U.Never : U.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = ar(yn(n))), K(o, s, e.delegate, e.path);
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = or(yn(n))), K(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var yr = /* @__PURE__ */ new Set([
+var br = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -7351,27 +7356,27 @@ var yr = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function br(e, t) {
-	let n = Object.keys(t).filter((e) => !yr.has(e) && z(e));
+function xr(e, t) {
+	let n = Object.keys(t).filter((e) => !br.has(e) && z(e));
 	n.length > 0 && H(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = xr(e, "maxProperties", t), i = xr(e, "minProperties", t), a = Sr(e, t), o = Cr(e, t), s = wr(e, t), c = Er(e, t);
+	let r = Sr(e, "maxProperties", t), i = Sr(e, "minProperties", t), a = Cr(e, t), o = wr(e, t), s = Tr(e, t), c = Dr(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = Tr(e, o, s, t);
+	let l = Er(e, o, s, t);
 	if (!l) return null;
-	let u = Or(e, Dr(a, o, s, l), c, t);
-	return K(kr(e, a, l, u, r, i) ? U.Never : U.Object, Jn({
+	let u = kr(e, Or(a, o, s, l), c, t);
+	return K(Ar(e, a, l, u, r, i) ? U.Never : U.Object, Yn({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: Pr(o),
-		dependencies: Fr(c, t),
+		patternProperties: Fr(o),
+		dependencies: Ir(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function xr(e, t, n) {
+function Sr(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -7385,17 +7390,17 @@ function xr(e, t, n) {
 		return r;
 	}
 }
-function Sr(e, { additionalProperties: t }) {
+function Cr(e, { additionalProperties: t }) {
 	return t === !1 ? K(U.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
 	}, e.delegate, e.path) : typeof t == "object" ? J(B(e, "additionalProperties"), V(t)) : K(U.Any, {}, e.delegate, e.path);
 }
-function Cr(e, { patternProperties: t }) {
+function wr(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = Nr(i);
+		let a = Pr(i);
 		if (a instanceof Error) {
 			H(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
@@ -7409,24 +7414,24 @@ function Cr(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function wr(e, { propertyNames: t }) {
+function Tr(e, { propertyNames: t }) {
 	if (!t) return K(U.Any, {}, e.delegate, e.path);
 	t = V(t);
 	let n = J(B(e, "propertyNames"), t);
 	if (!n) return null;
 	let r = G(n);
-	return r !== U.String && r !== U.Any ? or(n) : n;
+	return r !== U.String && r !== U.Any ? sr(n) : n;
 }
-function Tr(e, t, n, { properties: r }) {
+function Er(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (_r(n, o) === q.Invalid) {
+		if (vr(n, o) === q.Invalid) {
 			H(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = Mr(t, o);
+		let s = Nr(t, o);
 		if (s && G(s) === U.Never) {
 			H(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
@@ -7440,40 +7445,40 @@ function Tr(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function Er(e, { dependencies: t }) {
+function Dr(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
 		let a = V(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = jr(a);
+			let { keys: t, duplicated: r } = Mr(a);
 			r && H(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
 			let t = J(B(e, "dependencies", i), a);
 			if (t) {
 				let e = G(t);
-				r[i] = e === U.Object || e === U.Any ? t : e === U.Extends ? tr : or(t);
+				r[i] = e === U.Object || e === U.Any ? t : e === U.Extends ? nr : sr(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function Dr(e, t, n, r) {
+function Or(e, t, n, r) {
 	return (i) => {
-		if (_r(n, i) === q.Invalid) return !0;
-		let a = Mr(t, i);
+		if (vr(n, i) === q.Invalid) return !0;
+		let a = Nr(t, i);
 		return !!(a && G(a) === U.Never || G(r[i] ?? e) === U.Never);
 	};
 }
-function Or(e, t, n, { required: r }) {
+function kr(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = jr(r);
+	let i = Mr(r);
 	i.duplicated && H(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) Ar(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	for (let e of i.keys) jr(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
 	return o.length > 0 && H(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
 }
-function kr(e, t, n, r, i, a) {
+function Ar(e, t, n, r, i, a) {
 	if (i !== void 0 && a !== void 0 && i < a) return H(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
 	if (i !== void 0 && r.length > i) return H(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
 	if (a !== void 0 && r.length < a) return H(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
@@ -7484,7 +7489,7 @@ function kr(e, t, n, r, i, a) {
 	}
 	return !0;
 }
-function Ar([e, t], n) {
+function jr([e, t], n) {
 	let r = [n], i = new Set(r);
 	for (; r.length > 0;) {
 		let n = r.pop(), i = t[n], o = e[n];
@@ -7495,7 +7500,7 @@ function Ar([e, t], n) {
 	}
 	return [...i];
 }
-function jr(e) {
+function Mr(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 ? {
@@ -7506,14 +7511,14 @@ function jr(e) {
 		duplicated: [...n]
 	};
 }
-function Mr(e, t) {
+function Nr(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function Nr(e) {
+function Pr(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -7521,12 +7526,12 @@ function Nr(e) {
 		throw e;
 	}
 }
-function Pr(e) {
+function Fr(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function Fr([e, t], { dependencies: n }) {
+function Ir([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -7536,38 +7541,38 @@ function Fr([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var Ir = /* @__PURE__ */ new Set([
+var Lr = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Lr = /* @__PURE__ */ new Set([
+]), Rr = /* @__PURE__ */ new Set([
 	"type",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function Rr(e, t) {
+function zr(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return zr(e, t);
-		case "string": return Vr(e, t);
+		case "integer": return Br(e, t);
+		case "string": return Hr(e, t);
 		case "boolean":
 		case "null": {
 			let r = Object.keys(t).filter((e) => z(e) && e !== "type");
 			return r.length > 0 && H(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), K(n === "null" ? U.Null : U.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return Kn(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return qn(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function zr(e, t) {
-	let n = Object.keys(t).filter((e) => !Ir.has(e) && z(e));
+function Br(e, t) {
+	let n = Object.keys(t).filter((e) => !Lr.has(e) && z(e));
 	n.length > 0 && H(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = vn(t, Ir);
-	for (let t of Ir) {
+	let r = vn(t, Lr);
+	for (let t of Lr) {
 		let n = r[t];
 		t !== "type" && n !== void 0 && Number.isNaN(n) && (H(e, "found NaN", t), delete r[t]);
 	}
@@ -7576,38 +7581,38 @@ function zr(e, t) {
 	let { multipleOf: c } = r;
 	c === 0 && (delete r.multipleOf, r.type = "number", H(e, "cannot be 0", "multipleOf"));
 	let l = U.Numeric;
-	return Br(r) || (l = U.Never), K(l, r, e.delegate, e.path);
+	return Vr(r) || (l = U.Never), K(l, r, e.delegate, e.path);
 }
-function Br(e) {
+function Vr(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 Vr(e, t) {
-	let n = Object.keys(t).filter((e) => !Lr.has(e) && z(e));
+function Hr(e, t) {
+	let n = Object.keys(t).filter((e) => !Rr.has(e) && z(e));
 	n.length > 0 && H(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = vn(t, Lr);
-	Hr(e, r, "maxLength"), Hr(e, r, "minLength");
+	let r = vn(t, Rr);
+	Ur(e, r, "maxLength"), Ur(e, r, "minLength");
 	let i = r.maxLength, a = r.minLength, o = U.String;
 	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = U.Never), K(o, r, e.delegate, e.path);
 }
-function Hr(e, t, n) {
+function Ur(e, t, n) {
 	let r = t[n];
 	r !== void 0 && Number.isNaN(r) && (H(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Ur = Object.freeze([]);
-function Wr(e, t, n, r) {
+var Wr = Object.freeze([]);
+function Gr(e, t, n, r) {
 	if (W(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Ur
+		warns: Wr
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: Vn.External,
+				kind: Hn.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -7621,14 +7626,14 @@ function Wr(e, t, n, r) {
 		errors: [],
 		warns: []
 	}, a = J(i, e);
-	if (a) Gr(i.errors.length === 0, "found errors (it should be empty)");
-	else return Gr(i.errors.length > 0, "cannot found any errors"), i.errors;
+	if (a) Kr(i.errors.length === 0, "found errors (it should be empty)");
+	else return Kr(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function Gr(e, t) {
+function Kr(e, t) {
 	if (!e) throw Error(t);
 }
 function J(e, t) {
@@ -7640,15 +7645,15 @@ function J(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = Kr(e, r);
-	return s && i && (s = vr(e, a, o, s)), s || null;
+	let s = qr(e, r);
+	return s && i && (s = yr(e, a, o, s)), s || null;
 }
-function Kr(e, t) {
-	for (let n of mr) {
+function qr(e, t) {
+	for (let n of hr) {
 		let r = t[n];
 		if (r) {
 			let i = Object.keys(t).filter((e) => z(e) && e !== n);
-			return i.length > 0 && H(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), hr(e, n, r) || null;
+			return i.length > 0 && H(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), gr(e, n, r) || null;
 		}
 	}
 	{
@@ -7672,26 +7677,26 @@ function Kr(e, t) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return hr(e, "anyOf", n.map((e) => ({
+			return gr(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return br(e, t);
-			case "array": return cr(e, t);
-			default: return Rr(e, t);
+			case "object": return xr(e, t);
+			case "array": return lr(e, t);
+			default: return zr(e, t);
 		}
 	}
-	return Gn(t) ? K(U.Any, {}, e.delegate, e.path) : (Kn(e, "unrecognized"), null);
+	return Kn(t) ? K(U.Any, {}, e.delegate, e.path) : (qn(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var qr = class {
+var Jr = 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 Jr {
+		this.keys = t, this.clazz = class extends Yr {
 			constructor(e) {
 				super(t, e);
 			}
@@ -7715,7 +7720,7 @@ var qr = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Jr = class {
+}, Yr = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -7730,21 +7735,21 @@ var qr = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function Yr(e) {
-	return new Xr(e);
+function Xr(e) {
+	return new Zr(e);
 }
-var Xr = class {
+var Zr = class {
 	constructor(e) {
-		this.description = new qr(e);
+		this.description = new Jr(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Zr(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new Qr(this.description, t);
 	}
-}, Zr = class {
+}, Qr = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -7782,11 +7787,11 @@ var Xr = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function Qr(e, t) {
+function $r(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? $r(e, t) : n.num > r.num ? ei(e, t) : ti(e, t);
+	return n.num < r.num ? ei(e, t) : n.num > r.num ? ti(e, t) : ni(e, t);
 }
-function $r(e, t) {
+function ei(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -7834,7 +7839,7 @@ function $r(e, t) {
 		}
 	};
 }
-function ei(e, t) {
+function ti(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -7882,7 +7887,7 @@ function ei(e, t) {
 		}
 	};
 }
-function ti(e, t) {
+function ni(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,
@@ -7925,8 +7930,8 @@ function Y(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var ni = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = Qr([{
+var ri = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = $r([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -7956,126 +7961,126 @@ var ni = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function ri({ left: e, right: t, intersection: n }) {
-	if (!n) return A.Rejection;
+function ii({ left: e, right: t, intersection: n }) {
+	if (!n) return j.Rejection;
 	let r = !1, i = !1;
-	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? A.Intersection : r ? A.Containing : i ? A.ContainedBy : A.Equals;
+	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? j.Intersection : r ? j.Containing : i ? j.ContainedBy : j.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var ii = ni(0), ai = Yr([
+var ai = ri(0), oi = Xr([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function oi({ calculate: e }, t, n) {
-	let r = ii(t.minItems, t.maxItems, n.minItems, n.maxItems), i = ri(r);
-	if (i === A.Rejection) return P;
-	let [a, o] = si(t), [s, c] = si(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = ai.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+function si({ calculate: e }, t, n) {
+	let r = ai(t.minItems, t.maxItems, n.minItems, n.maxItems), i = ii(r);
+	if (i === j.Rejection) return F;
+	let [a, o] = ci(t), [s, c] = ci(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = oi.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
 	for (let t = 0; t < u; t++) {
 		let n = e(a[t] ?? o, s[t] ?? c);
 		d.push(n, (e, n) => {
 			switch (e) {
-				case A.Equals:
+				case j.Equals:
 					n.hasRejection || (n.hasCommon = !0);
 					break;
-				case A.Containing:
+				case j.Containing:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0;
 					break;
-				case A.ContainedBy:
+				case j.ContainedBy:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra2 = !0;
 					break;
-				case A.Intersection:
+				case j.Intersection:
 					n.hasRejection || (n.hasCommon = !0), n.hasExtra1 = !0, n.hasExtra2 = !0;
 					break;
-				case A.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
+				case j.Rejection: t < f && (n.hasCommonBroken = !0), n.hasRejection = !0, n.hasExtra1 = !0, n.hasExtra2 = !0;
 			}
 		});
 	}
 	d.update((e) => {
 		switch (i) {
-			case A.Containing:
+			case j.Containing:
 				e.hasExtra1 = !0;
 				break;
-			case A.ContainedBy:
+			case j.ContainedBy:
 				e.hasExtra2 = !0;
 				break;
-			case A.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
+			case j.Intersection: e.hasExtra1 = !0, e.hasExtra2 = !0;
 		}
 		(t.maxItems === 0 || n.maxItems === 0) && (e.hasCommon = !0, t.maxItems !== 0 && (e.hasExtra1 = !0), n.maxItems !== 0 && (e.hasExtra2 = !0));
 	});
 	let p = 0;
 	for (let { hasExtra1: e, hasExtra2: t, hasCommon: n, hasCommonBroken: r } of d) {
 		let i = n;
-		r && (i = !1), p |= i ? e && t ? F : e ? M : t ? N : j : P;
+		r && (i = !1), p |= i ? e && t ? I : e ? N : t ? P : M : F;
 	}
 	return p;
 }
-function si({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? er] : [[], e ?? er];
+function ci({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? tr] : [[], e ?? tr];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function ci(e) {
+function li(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = nr(n);
-		return i === nr(r) ? i ? ui(t, n, r, e) : n === r : !1;
+		let i = rr(n);
+		return i === rr(r) ? i ? di(t, n, r, e) : n === r : !1;
 	};
 }
-function li(e) {
+function ui(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => ui(t, n, r, e);
+	return (n, r) => di(t, n, r, e);
 }
-function ui(e, t, n, r) {
-	let i = `${rr(t)}/${rr(n)}`, a = e.get(i);
+function di(e, t, n, r) {
+	let i = `${ir(t)}/${ir(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 di(e, t, n) {
-	let r = pi(t), i = pi(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (mi(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (mi(e, r, t) ? s = !0 : o = !0, o && s) break;
-	return s ? a && o ? F : a ? M : o ? N : j : P;
+function fi(e, t, n) {
+	let r = mi(t), i = mi(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (hi(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (hi(e, r, t) ? s = !0 : o = !0, o && s) break;
+	return s ? a && o ? I : a ? N : o ? P : M : F;
 }
-function fi(e, t) {
+function pi(e, t) {
 	let n = !1, r = !1;
-	for (let i of pi(e)) {
-		switch (_r(t, i)) {
+	for (let i of mi(e)) {
+		switch (vr(t, i)) {
 			case q.Valid:
 				n = !0;
 				break;
 			case q.Invalid:
 				r = !0;
 				break;
-			case q.Unknown: return I;
+			case q.Unknown: return Sn;
 		}
 		if (n && r) break;
 	}
-	return n && r ? F : n ? j | N : r ? P : G(t) === U.Never ? j : N;
+	return n && r ? I : n ? M | P : r ? F : G(t) === U.Never ? M : P;
 }
-function pi({ const: e, enum: t }) {
+function mi({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function mi({ isEquals: e }, t, n) {
+function hi({ 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 hi(e) {
+function gi(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 = rr(e), a = rr(t);
+		let r = ir(e), a = ir(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;
@@ -8098,19 +8103,19 @@ function hi(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function gi(e) {
-	let t = Si(e), n = e.multipleOf ?? 1, r = X(t, n);
+function _i(e) {
+	let t = Ci(e), n = e.multipleOf ?? 1, r = X(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function _i([e, t]) {
+function vi([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
 function X(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = vi(n.num, t), a = yi(r.num, t);
+	let [n, r] = e, i = yi(n.num, t), a = bi(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
@@ -8119,29 +8124,29 @@ function X(e, t) {
 		exclusive: !1
 	}];
 }
-function vi(e, t) {
+function yi(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function yi(e, t) {
+function bi(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function bi(e, t) {
-	let { left: n, right: r, center: i } = Qr(Si(e), Si(t));
-	if (!i) return P;
+function xi(e, t) {
+	let { left: n, right: r, center: i } = $r(Ci(e), Ci(t));
+	if (!i) return F;
 	let a = !1, o = !1;
-	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? F : a ? M : o ? N : j;
+	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? I : a ? N : o ? P : M;
 }
-function xi(e, t) {
-	let n = Si(e), r = gi(t);
-	if (!r) return M;
-	let i = Qr(n, r.range), a = X(i.center, r.multipleOf), o = Ci(i.left, r.multipleOf), s = Ci(i.right, r.multipleOf);
-	if (!i.center) return P;
+function Si(e, t) {
+	let n = Ci(e), r = _i(t);
+	if (!r) return N;
+	let i = $r(n, r.range), a = X(i.center, r.multipleOf), o = wi(i.left, r.multipleOf), s = wi(i.right, r.multipleOf);
+	if (!i.center) return F;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !_i(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? F : c ? M : l ? N : j;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !vi(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? I : c ? N : l ? P : M;
 }
-function Si(e) {
+function Ci(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -8163,84 +8168,84 @@ function Si(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function Ci(e, t) {
+function wi(e, t) {
 	if (e && !e.fromLeft) return X(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function wi(e, t) {
-	let n = gi(e), r = gi(t);
-	if (!n && !r) return j;
-	if (!n) return N;
-	if (!r) return M;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Qr(i, o), l, u = 0;
-	if (c.center && (u = Ei(a, s), l = X(c.center, u)), !l) return P;
+function Ti(e, t) {
+	let n = _i(e), r = _i(t);
+	if (!n && !r) return M;
+	if (!n) return P;
+	if (!r) return N;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = $r(i, o), l, u = 0;
+	if (c.center && (u = Di(a, s), l = X(c.center, u)), !l) return F;
 	let d = !1, f = !1, { left: p, right: m } = c;
-	return p && X(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && X(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Ti(n, l, u), f ||= Ti(r, l, u), d && f ? F : d ? M : f ? N : j;
+	return p && X(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), m && X(m.range, m.fromLeft ? a : s) && (m.fromLeft ? d = !0 : f = !0), d ||= Ei(n, l, u), f ||= Ei(r, l, u), d && f ? I : d ? N : f ? P : M;
 }
-function Ti({ range: e, multipleOf: t }, n, r) {
-	let i = Qr(e, n);
+function Ei({ range: e, multipleOf: t }, n, r) {
+	let i = $r(e, n);
 	if (X(i.left?.range, t) || X(i.right?.range, t)) return !0;
 	let a = X(i.center, t);
 	if (!a) return !1;
-	let o = Oi(n);
-	return Oi(a) > o || o !== 1 && t < r;
-}
-function Ei(e, t) {
-	return e * t / Di(e, t);
+	let o = ki(n);
+	return ki(a) > o || o !== 1 && t < r;
 }
 function Di(e, t) {
-	return e === 0 ? t : Di(t % e, e);
+	return e * t / Oi(e, t);
 }
-function Oi(e) {
+function Oi(e, t) {
+	return e === 0 ? t : Oi(t % e, e);
+}
+function ki(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 ki(e, t) {
-	if (Ai(e) || Ai(t)) return I;
-	let n = ji(e), r = ji(t);
-	return n && r ? bi(e, t) : n ? xi(e, t) : r ? jn(xi(t, e)) : wi(e, t);
+function Ai(e, t) {
+	if (ji(e) || ji(t)) return Sn;
+	let n = Mi(e), r = Mi(t);
+	return n && r ? xi(e, t) : n ? Si(e, t) : r ? Mn(Si(t, e)) : Ti(e, t);
 }
-function Ai(e) {
+function ji(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function ji(e) {
+function Mi(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 Mi = ni(0), Ni = Yr([
+var Ni = ri(0), Pi = Xr([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function Pi(e, t, n) {
-	if (Fi(t, n)) return P;
-	let r = Ii(t, n);
-	if (!r) return P;
-	let i = Hi(t), a = Hi(n), o = (t) => {
+function Fi(e, t, n) {
+	if (Ii(t, n)) return F;
+	let r = Li(t, n);
+	if (!r) return F;
+	let i = Ui(t), a = Ui(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return Ui(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Ni.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), Ri);
-	for (let e of [...c].toSorted()) u.push(o(e), zi);
-	for (let e of [...l].toSorted()) u.push(o(e), Bi);
+		return Wi(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Pi.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), zi);
+	for (let e of [...c].toSorted()) u.push(o(e), Bi);
+	for (let e of [...l].toSorted()) u.push(o(e), Vi);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = Vi(d, f);
-		for (let e of [...Li(t, n)].toSorted()) {
+		let r = Hi(d, f);
+		for (let e of [...Ri(t, n)].toSorted()) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? er, a = n.additionalProperties ?? er;
-		if (Ui(i, a)) {
+		let i = t.additionalProperties ?? tr, a = n.additionalProperties ?? tr;
+		if (Wi(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -8249,13 +8254,13 @@ function Pi(e, t, n) {
 		e.hasRejection || (c.size > 0 && (e.hasExtra2 = !0), l.size > 0 && (e.hasExtra1 = !0));
 	});
 	let { requiredKeysCount: p } = r, m = 0;
-	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? P : e && t ? F : e ? M : t ? N : j;
+	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) m |= !n && p > 0 || !r && p === 0 || i ? F : e && t ? I : e ? N : t ? P : M;
 	return m;
 }
-function Fi(e, t) {
-	return ri(Mi(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === A.Rejection;
-}
 function Ii(e, t) {
+	return ii(Ni(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === j.Rejection;
+}
+function Li(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);
@@ -8271,7 +8276,7 @@ function Ii(e, t) {
 		hasOptional2: u > s
 	};
 }
-function Li(e, t) {
+function Ri(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);
@@ -8279,67 +8284,67 @@ function Li(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var Ri = (e, t) => {
+var zi = (e, t) => {
 	switch (e) {
-		case A.Equals:
+		case j.Equals:
 			t.hasCommonInRequired = !0;
 			break;
-		case A.Containing:
+		case j.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case A.ContainedBy:
+		case j.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case A.Intersection:
+		case j.Intersection:
 			t.hasExtra1 = !0, t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case A.Rejection: t.hasRejection = !0;
+		case j.Rejection: t.hasRejection = !0;
 	}
-}, zi = (e, t) => {
+}, Bi = (e, t) => {
 	switch (e) {
-		case A.Equals:
-		case A.ContainedBy:
+		case j.Equals:
+		case j.ContainedBy:
 			t.hasCommonInRequired = !0;
 			break;
-		case A.Intersection:
-		case A.Containing:
+		case j.Intersection:
+		case j.Containing:
 			t.hasExtra1 = !0, t.hasCommonInRequired = !0;
 			break;
-		case A.Rejection: t.hasRejection = !0;
+		case j.Rejection: t.hasRejection = !0;
 	}
-}, Bi = (e, t) => {
+}, Vi = (e, t) => {
 	switch (e) {
-		case A.Equals:
-		case A.Containing:
+		case j.Equals:
+		case j.Containing:
 			t.hasCommonInRequired = !0;
 			break;
-		case A.Intersection:
-		case A.ContainedBy:
+		case j.Intersection:
+		case j.ContainedBy:
 			t.hasExtra2 = !0, t.hasCommonInRequired = !0;
 			break;
-		case A.Rejection: t.hasRejection = !0;
+		case j.Rejection: t.hasRejection = !0;
 	}
-}, Vi = (e, t) => (n, r) => {
+}, Hi = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
-		case A.Equals:
+		case j.Equals:
 			o = !0;
 			break;
-		case A.Containing:
+		case j.Containing:
 			i = !0, o = !0;
 			break;
-		case A.ContainedBy:
+		case j.ContainedBy:
 			a = !0, o = !0;
 			break;
-		case A.Intersection:
+		case j.Intersection:
 			i = !0, a = !0, o = !0;
 			break;
-		case A.Rejection: i = !0, a = !0;
+		case j.Rejection: i = !0, a = !0;
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function Hi(e) {
+function Ui(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");
@@ -8349,39 +8354,39 @@ function Hi(e) {
 		});
 	}
 	return (e) => {
-		if (n && _r(n, e) === q.Invalid) return tr;
+		if (n && vr(n, e) === q.Invalid) return nr;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || er;
+		return ((t && t[e]) ?? r) || tr;
 	};
 }
-function Ui(e, t) {
+function Wi(e, t) {
 	let n = G(e), r = G(t);
 	return n !== U.Never || r !== U.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var Wi = ni(0);
-function Gi(e, t) {
-	let n = ri(Wi(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+var Gi = ri(0);
+function Ki(e, t) {
+	let n = ii(Gi(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
-		case A.Rejection: return P;
-		case A.Containing: return r ? I : M;
-		case A.ContainedBy: return i ? I : N;
-		case A.Equals: return r && i ? e.pattern === t.pattern ? j : I : r ? j | N : i ? j | M : j;
-		case A.Intersection: return r && i ? I : r ? F | P | N : i ? F | P | M : F;
+		case j.Rejection: return F;
+		case j.Containing: return r ? Sn : N;
+		case j.ContainedBy: return i ? Sn : P;
+		case j.Equals: return r && i ? e.pattern === t.pattern ? M : Sn : r ? M | P : i ? M | N : M;
+		case j.Intersection: return r && i ? Sn : r ? I | F | P : i ? I | F | N : I;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function Ki(e, t, n) {
-	let r = {}, i = [], a = li(Ji(e, r)), o = qi(), s = hi(e);
-	r.isEquals = ci(bn), r.calculate = zn({
+function qi(e, t, n) {
+	let r = {}, i = [], a = ui(Yi(e, r)), o = Ji(), s = gi(e);
+	r.isEquals = li(bn), r.calculate = Bn({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!Xi(r ? jn(n) : n)) return;
-			let a = r ? Zi(t, e) : Zi(e, t);
+			if (!Zi(r ? Mn(n) : n)) return;
+			let a = r ? Qi(t, e) : Qi(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -8391,7 +8396,7 @@ function Ki(e, t, n) {
 		expression: c
 	};
 }
-var qi = () => (e) => {
+var Ji = () => (e) => {
 	let t;
 	switch (G(e)) {
 		case U.Not:
@@ -8403,54 +8408,54 @@ var qi = () => (e) => {
 		case U.Combination:
 			if ("allOf" in e) t = {
 				kind: R.AllOf,
-				expressions: Yi(e.allOf, U.Any)
+				expressions: Xi(e.allOf, U.Any)
 			};
 			else if ("anyOf" in e) t = {
 				kind: R.AnyOf,
-				expressions: Yi(e.anyOf, U.Never)
+				expressions: Xi(e.anyOf, U.Never)
 			};
 			else if ("oneOf" in e) t = {
 				kind: R.OneOf,
-				expressions: Yi(e.oneOf, U.Never)
+				expressions: Xi(e.oneOf, U.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
 		default: t = { kind: R.Leaf };
 	}
 	return t;
-}, Ji = (e, t) => (n, r) => {
+}, Yi = (e, t) => (n, r) => {
 	let i = G(n), a = G(r);
 	if (i === U.Extends || a === U.Extends) return e.calculate(n, r);
 	switch (i) {
-		case U.Any: return a === U.Any ? j : M;
-		case U.Never: return a === U.Never ? j : N;
+		case U.Any: return a === U.Any ? M : N;
+		case U.Never: return a === U.Never ? M : P;
 	}
 	switch (a) {
-		case U.Any: return N;
-		case U.Never: return M;
+		case U.Any: return P;
+		case U.Never: return N;
 	}
-	if (i === U.EnumOrConst && a === U.EnumOrConst) return di(t, n, r);
-	if (i === U.EnumOrConst) return fi(n, r);
-	if (a === U.EnumOrConst) return jn(fi(r, n));
-	if (i !== a) return P;
+	if (i === U.EnumOrConst && a === U.EnumOrConst) return fi(t, n, r);
+	if (i === U.EnumOrConst) return pi(n, r);
+	if (a === U.EnumOrConst) return Mn(pi(r, n));
+	if (i !== a) return F;
 	switch (i) {
-		case U.Null: return j;
-		case U.Numeric: return ki(n, r);
-		case U.String: return Gi(n, r);
-		case U.Boolean: return j;
-		case U.Object: return Pi(t, n, r);
-		case U.Array: return oi(t, n, r);
+		case U.Null: return M;
+		case U.Numeric: return Ai(n, r);
+		case U.String: return Ki(n, r);
+		case U.Boolean: return M;
+		case U.Object: return Fi(t, n, r);
+		case U.Array: return si(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function Yi(e, t) {
+function Xi(e, t) {
 	return e.filter((e) => G(e) !== t);
 }
-function Xi(e) {
-	return !Sn(e) && !wn(e) && (Cn(e) || En(e) || Tn(e));
+function Zi(e) {
+	return !Cn(e) && !Tn(e) && (wn(e) || Dn(e) || En(e));
 }
-function Zi(e, t) {
-	let n = ir(t);
+function Qi(e, t) {
+	let n = ar(t);
 	if (!n) return;
 	let r = G(e), i = G(t);
 	if (r !== i) return [...n, "type"];
@@ -8483,7 +8488,7 @@ function Zi(e, t) {
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var Qi = class e {
+var $i = class e {
 	constructor(e = []) {
 		this.extendsSchemaClasses = Object.freeze([...e]);
 	}
@@ -8498,7 +8503,7 @@ var Qi = 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 |= Dn(t);
+		for (let t of a) r && (t = e.swap(t)), i |= On(t);
 		return i;
 	}
 	equals(e, t) {
@@ -8510,43 +8515,43 @@ var Qi = class e {
 	}
 	static swap(e) {
 		switch (e) {
-			case A.Containing: return A.ContainedBy;
-			case A.ContainedBy: return A.Containing;
+			case j.Containing: return j.ContainedBy;
+			case j.ContainedBy: return j.Containing;
 			default: return e;
 		}
 	}
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function $i(e, t, n = !1) {
+function ea(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw ta(e, r, "$"), new Bn(e);
+		throw na(e, r, "$"), new Vn(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(Hn(e));
+		for (let e of a) console.warn(Un(e));
 	}
 	return i;
 }
-function ea(e, t, n, r = !1) {
+function ta(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) && ta(e, i, "$1"), Array.isArray(a) && ta(e, a, "$2"), new Bn(e);
+		throw Array.isArray(i) && na(e, i, "$1"), Array.isArray(a) && na(e, a, "$2"), new Vn(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(Hn(e));
+		for (let e of s) console.warn(Un(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Hn(e));
+		for (let e of l) console.warn(Un(e));
 	}
 	return [o, c];
 }
-function ta(e, t, n) {
+function na(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -8557,77 +8562,77 @@ function ta(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var na = Object.freeze({
+var ra = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function ra({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new Qi(e);
+function ia({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new $i(e);
 	return Object.freeze({
-		compile: (e, r, i) => $i(e, (e) => Wr(e, n, r, t), i),
+		compile: (e, r, i) => ea(e, (e) => Gr(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = ea(e, r, (e) => Wr(e, n, void 0, t), i), { errorPath: s, expression: c } = Ki(n, a, o), l = Sn(c) || wn(c), u = Cn(c) || En(c) || Tn(c);
-			return l && !u ? { result: na.True } : !l && u ? {
+			let [a, o] = ta(e, r, (e) => Gr(e, n, void 0, t), i), { errorPath: s, expression: c } = qi(n, a, o), l = Cn(c) || Tn(c), u = wn(c) || Dn(c) || En(c);
+			return l && !u ? { result: ra.True } : !l && u ? {
 				errorPath: s,
-				result: na.False
-			} : { result: na.Unknown };
+				result: ra.False
+			} : { result: ra.Unknown };
 		}
 	});
 }
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
-function ia(e) {
-	return _(e)?.type === "string";
-}
 function aa(e) {
-	return e instanceof da || _(e)?.type === "array";
+	return _(e)?.type === "string";
 }
 function oa(e) {
+	return e instanceof fa || _(e)?.type === "array";
+}
+function sa(e) {
 	let t = _(e);
 	return t?.type === "array" && _(t.items)?.type === "string";
 }
-function sa(e) {
+function ca(e) {
 	let t = _(e);
 	return t != null && Object.keys(t).length === 0;
 }
-function ca(e) {
+function la(e) {
 	let t = _(e), n = _(t?.error);
-	if (t == null || n == null || t.packageId != null && !g(t.packageId) || n.message != null && !g(n.message)) throw TypeError("Invalid schema comparison context.");
+	if (t == null || n == null || t.packageId != null && !le(t.packageId) || n.message != null && !le(n.message)) throw TypeError("Invalid schema comparison context.");
 }
-function la(e) {
-	return e == null ? { error: {} } : (ca(e), e);
+function ua(e) {
+	return e == null ? { error: {} } : (la(e), e);
 }
 var Z = 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 = la(n);
+		this.id = e, this.value = t, this.context = ua(n);
 	}
 	compare(e) {
 		return this.passThrough(e) || this.compareImpl(e);
 	}
 	passThrough(e) {
-		if (e instanceof pa) return [A.Equals];
+		if (e instanceof ma) return [j.Equals];
 	}
-}, ua = class e extends Z {
+}, da = class e extends Z {
 	static isMatch(e) {
 		let t = _(e)?.enum;
-		return Array.isArray(t) && t.every((e) => g(e));
+		return Array.isArray(t) && t.every((e) => le(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid single-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (ia(t)) return [A.ContainedBy];
+		if (aa(t)) return [j.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.enum), n = A.Equals;
-			for (let r of t.value.enum) e.has(r) || (n = A.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [A.Rejection] : [A.Intersection];
+			let e = new Set(this.value.enum), n = j.Equals;
+			for (let r of t.value.enum) e.has(r) || (n = j.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.enum.length ? [j.Rejection] : [j.Intersection];
 		}
-		return [A.Rejection];
+		return [j.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -8640,23 +8645,23 @@ var Z = class e {
 		}
 		return !1;
 	}
-}, da = class e extends Z {
+}, fa = class e extends Z {
 	static isMatch(e) {
 		let t = _(e), n = _(t?.items)?.enum;
-		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => g(e));
+		return t?.type === "array" && t.uniqueItems === !0 && Array.isArray(n) && n.every((e) => le(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid multi-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (t instanceof fa || oa(t)) return [A.ContainedBy];
+		if (t instanceof pa || sa(t)) return [j.ContainedBy];
 		if (t instanceof e) {
-			let e = new Set(this.value.items.enum), n = A.Equals;
-			for (let r of t.value.items.enum) e.has(r) || (n = A.ContainedBy), e.delete(r);
-			return e.size === 0 ? [n] : e.size === this.value.items.enum.length ? [A.Rejection] : [A.Intersection];
+			let e = new Set(this.value.items.enum), n = j.Equals;
+			for (let r of t.value.items.enum) e.has(r) || (n = j.ContainedBy), e.delete(r);
+			return e.size === 0 ? [n] : e.size === this.value.items.enum.length ? [j.Rejection] : [j.Intersection];
 		}
-		return [A.Rejection];
+		return [j.Rejection];
 	}
 	equals(t) {
 		if (t instanceof e) {
@@ -8669,36 +8674,36 @@ var Z = class e {
 		}
 		return !1;
 	}
-}, fa = class e extends Z {
+}, pa = class e extends Z {
 	static isMatch(e) {
 		let t = _(e);
-		return t?.type === "array" && !t.uniqueItems && (!le(t.items) || sa(t.items));
+		return t?.type === "array" && !t.uniqueItems && (!ue(t.items) || ca(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 || aa(t) ? [A.Equals] : [A.Rejection];
+		return t instanceof e || oa(t) ? [j.Equals] : [j.Rejection];
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, pa = class e extends Z {
+}, ma = class e extends Z {
 	static isMatch(e) {
-		return sa(e);
+		return ca(e);
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid empty schema.");
 		super(t, n, r);
 	}
 	compareImpl(e) {
-		return [A.Equals];
+		return [j.Equals];
 	}
 	equals(e) {
 		return !0;
 	}
-}, ma = class e extends Z {
+}, ha = class e extends Z {
 	static isMatch(e) {
 		return _(e)?.contentMediaType === "oomol/bin";
 	}
@@ -8707,12 +8712,12 @@ var Z = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [A.Equals] : (Z.setError(this, t, "edgeError.binDiffType"), [A.Rejection]);
+		return t instanceof e ? [j.Equals] : (Z.setError(this, t, "edgeError.binDiffType"), [j.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, ha = class e extends Z {
+}, ga = class e extends Z {
 	static isMatch(e) {
 		return _(e)?.contentMediaType === "oomol/artifact";
 	}
@@ -8721,38 +8726,38 @@ var Z = class e {
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [A.Equals] : (Z.setError(this, t, "edgeError.artifactDiffType"), [A.Rejection]);
+		return t instanceof e ? [j.Equals] : (Z.setError(this, t, "edgeError.artifactDiffType"), [j.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
-function ga() {
-	return ra({ extendsSchemaClasses: [
-		fa,
+function _a() {
+	return ia({ extendsSchemaClasses: [
 		pa,
-		ua,
-		da,
 		ma,
-		ha
+		da,
+		fa,
+		ha,
+		ga
 	] });
 }
 //#endregion
 //#region src/manifest/common/schemaCompare.ts
-var _a = ga();
-function va(e, t) {
+var va = _a();
+function ya(e, t) {
 	return t ? { anyOf: [e, { type: "null" }] } : e;
 }
-function ya(e, t) {
+function ba(e, t) {
 	try {
-		let n = {}, r = _a.compile(va(ba(e.schema), e.nullable), {
+		let n = {}, r = va.compile(ya(xa(e.schema), e.nullable), {
 			...e,
 			error: n
-		}), i = _a.compile(va(ba(t.schema), t.nullable), {
+		}), i = va.compile(ya(xa(t.schema), t.nullable), {
 			...t,
 			error: n
-		}), { result: a, errorPath: o } = _a.isSubset(r, i);
-		return a == na.True ? { kind: "compatible" } : {
+		}), { result: a, errorPath: o } = va.isSubset(r, i);
+		return a == ra.True ? { kind: "compatible" } : {
 			kind: "incompatible",
 			error: n.message,
 			errorPath: o
@@ -8764,7 +8769,7 @@ function ya(e, t) {
 		};
 	}
 }
-function ba(e) {
+function xa(e) {
 	function t(t) {
 		if (!t.startsWith("#")) return;
 		let n = decodeURIComponent(t.slice(1));
@@ -8817,7 +8822,7 @@ function ba(e) {
 }
 //#endregion
 //#region src/flow/common/schema.ts
-function xa(e) {
+function Sa(e) {
 	return e.kind == "poll" || e.kind == "integration" ? e.definition.payloadSchema : e.kind == "cron" || e.kind == "manual" ? {
 		additionalProperties: !1,
 		type: "object"
@@ -8828,24 +8833,24 @@ function xa(e) {
 		type: "object"
 	};
 }
-function Sa(e, t) {
+function Ca(e, t) {
 	if (e === t) return !0;
 	if (e == null || t == null || typeof e != "object" || typeof t != "object") return !1;
-	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => Sa(e, t[n]));
+	if (Array.isArray(e) || Array.isArray(t)) return Array.isArray(e) && Array.isArray(t) && e.length == t.length && e.every((e, n) => Ca(e, t[n]));
 	let n = Object.entries(e), r = t;
-	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && Sa(t, r[e]));
+	return n.length == Object.keys(r).length && n.every(([e, t]) => Object.hasOwn(r, e) && Ca(t, r[e]));
 }
-function Ca(e) {
+function wa(e) {
 	return typeof e == "object" && e && !Array.isArray(e) ? e : void 0;
 }
-function wa(e) {
+function Ta(e) {
 	return Array.isArray(e) ? e : void 0;
 }
-function Ta(e, t, n = !1, r = !1) {
-	if (t === !0 || Sa(t, {})) return !0;
-	if (e === !0 || Sa(e, {}) || e === !1 || t === !1) return !1;
-	let i = Ca(e), a = Ca(t);
-	return i == null || a == null ? !1 : ya({
+function Ea(e, t, n = !1, r = !1) {
+	if (t === !0 || Ca(t, {})) return !0;
+	if (e === !0 || Ca(e, {}) || e === !1 || t === !1) return !1;
+	let i = wa(e), a = wa(t);
+	return i == null || a == null ? !1 : ba({
 		nullable: n,
 		packageId: void 0,
 		schema: i
@@ -8855,24 +8860,24 @@ function Ta(e, t, n = !1, r = !1) {
 		schema: a
 	}).kind == "compatible";
 }
-function Ea(e, t) {
-	return Ta(e.jsonSchema, t.jsonSchema, e.nullable, t.nullable);
+function Da(e, t) {
+	return Ea(e.jsonSchema, t.jsonSchema, e.nullable, t.nullable);
 }
-function Da(e) {
-	let t = Ca(e), n = wa(t?.type);
-	return t != null && n?.includes("string") ? Ta({ type: "string" }, {
+function Oa(e) {
+	let t = wa(e), n = Ta(t?.type);
+	return t != null && n?.includes("string") ? Ea({ type: "string" }, {
 		...t,
 		type: "string"
-	}) : Ta({ type: "string" }, e);
+	}) : Ea({ type: "string" }, e);
 }
 //#endregion
 //#region src/flow/common/graph.ts
-function Oa(e, t) {
+function ka(e, t) {
 	switch (t.kind) {
 		case "condition": return { [t.input.handle]: t.input };
 		case "value": return {};
-		case "subflow": return f(e.subflows[t.subflowId]?.inputs ?? []);
-		case "task": return f([...t.task == null ? e.tasks[t.taskId]?.inputs ?? [] : t.task.inputs, ...t.additionalInputs ?? []]);
+		case "subflow": return p(e.subflows[t.subflowId]?.inputs ?? []);
+		case "task": return p([...t.task == null ? e.tasks[t.taskId]?.inputs ?? [] : t.task.inputs, ...t.additionalInputs ?? []]);
 		case "wait": return { [t.input.handle]: t.input };
 		case "cron":
 		case "integration":
@@ -8881,27 +8886,27 @@ function Oa(e, t) {
 		case "webhook": return {};
 	}
 }
-function ka(e, t) {
+function Aa(e, t) {
 	switch (t.kind) {
 		case "condition": {
 			let e = [...t.cases.map((e) => e.output), ...t.defaultOutput == null ? [] : [t.defaultOutput]];
 			return Object.fromEntries(e.map((e) => [e, t.input]));
 		}
-		case "value": return f(t.values);
-		case "subflow": return f(e.subflows[t.subflowId]?.outputs ?? []);
-		case "task": return f(t.task == null ? e.tasks[t.taskId]?.outputs ?? [] : t.task.outputs);
+		case "value": return p(t.values);
+		case "subflow": return p(e.subflows[t.subflowId]?.outputs ?? []);
+		case "task": return p(t.task == null ? e.tasks[t.taskId]?.outputs ?? [] : t.task.outputs);
 		case "wait": return Object.fromEntries(t.actions.map((e) => [e, t.input]));
 		case "cron":
 		case "integration":
 		case "poll":
 		case "manual":
 		case "webhook": return { payload: {
-			jsonSchema: xa(t),
+			jsonSchema: Sa(t),
 			nullable: !1
 		} };
 	}
 }
-function Aa(e) {
+function ja(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;
@@ -8920,16 +8925,16 @@ function Aa(e) {
 	}
 	return r;
 }
-var ja = /* @__PURE__ */ new WeakMap();
-function Ma(e) {
-	let t = ja.get(e);
+var Ma = /* @__PURE__ */ new WeakMap();
+function Na(e) {
+	let t = Ma.get(e);
 	if (t != null) return t;
 	let n = /* @__PURE__ */ new Map(), r = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map();
 	for (let t of e.edges) {
 		let e = i.get(t.target) ?? [];
 		e.push(t), i.set(t.target, e);
 	}
-	for (let t of Aa(e)) {
+	for (let t of ja(e)) {
 		let a = e.nodes[t], o = i.get(t) ?? [], s = /* @__PURE__ */ new Set(), c = [];
 		for (let e of o) {
 			s.add(e.source);
@@ -8951,9 +8956,9 @@ function Ma(e) {
 		ancestors: r,
 		paths: n
 	};
-	return ja.set(e, a), a;
+	return Ma.set(e, a), a;
 }
-function Na(e, t, n) {
+function Pa(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" ? i.map((e) => ({
@@ -8961,23 +8966,23 @@ function Na(e, t, n) {
 		[n.nodeId]: n.output
 	})) : i;
 }
-function Pa(e, t, n) {
+function Fa(e, t, n) {
 	let r = e.filter((e) => Object.entries(e).every(([e, n]) => t[e] == null || t[e] == n));
 	if (r.some((e) => Object.entries(e).every(([e, n]) => t[e] == n))) return !0;
 	let i = r.flatMap((e) => Object.keys(e)).find((e) => t[e] == null);
 	if (i == null) return !1;
 	let a = n.nodes[i];
-	return (a?.kind == "condition" ? [...a.cases.map((e) => e.output), a.defaultOutput ?? ""] : a?.kind == "wait" ? a.actions : ["", ...Object.keys(n.nodes).filter((e) => !("inputs" in n.nodes[e]))]).every((e) => Pa(r, {
+	return (a?.kind == "condition" ? [...a.cases.map((e) => e.output), a.defaultOutput ?? ""] : a?.kind == "wait" ? a.actions : ["", ...Object.keys(n.nodes).filter((e) => !("inputs" in n.nodes[e]))]).every((e) => Fa(r, {
 		...t,
 		[i]: e
 	}, n));
 }
-function Fa(e, t, n, r) {
+function Ia(e, t, n, r) {
 	if (n.kind == "value") return !0;
 	let { ancestors: i, paths: a } = r;
 	if (n.sources.length == 0 || t != null && n.sources.some((e) => e.kind == "node" && !i.get(t)?.has(e.nodeId))) return !1;
-	let o = n.sources.map((t) => Na(e, a, t)), s = t == null ? [{}] : a.get(t) ?? [];
-	return s.every((t) => Pa(o.flat(), t, e)) ? o.every((e, t) => o.slice(t + 1).every((t) => e.every((e) => t.every((t) => s.every((n) => {
+	let o = n.sources.map((t) => Pa(e, a, t)), s = t == null ? [{}] : a.get(t) ?? [];
+	return s.every((t) => Fa(o.flat(), t, e)) ? o.every((e, t) => o.slice(t + 1).every((t) => e.every((e) => t.every((t) => s.every((n) => {
 		let r = {
 			...n,
 			...e
@@ -8985,29 +8990,29 @@ function Fa(e, t, n, r) {
 		return Object.entries(e).some(([e, t]) => n[e] != null && n[e] != t) || Object.entries(t).some(([e, t]) => r[e] != null && r[e] != t);
 	}))))) : !1;
 }
-function Ia(e, t, n, r) {
-	let i = Ma(t);
+function La(e, t, n, r) {
+	let i = Na(t);
 	return Object.fromEntries([...i.ancestors.get(n) ?? []].flatMap((a) => {
 		let o = t.nodes[a];
 		if (o == null) return [];
-		let s = Object.keys(ka(e, o)).filter((s) => Fa(t, n, {
+		let s = Object.keys(Aa(e, o)).filter((s) => Ia(t, n, {
 			kind: "sources",
 			sources: [{
 				kind: "node",
 				nodeId: a,
 				output: s
 			}]
-		}, i) && (r == null || Ea(ka(e, o)[s], Oa(e, t.nodes[n])[r])));
+		}, i) && (r == null || Da(Aa(e, o)[s], ka(e, t.nodes[n])[r])));
 		return s.length == 0 ? [] : [[a, s]];
 	}));
 }
-`${JSON.stringify("open-flow-engine/v2")}`, new TextEncoder();
+`${JSON.stringify("open-flow-engine/v2")}`;
 //#endregion
 //#region src/flow/common/semantics.ts
-function La(e) {
+function Ra(e) {
 	return Object.keys(e).toSorted().map((t) => [t, e[t]]);
 }
-function Ra(e) {
+function za(e) {
 	let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set(), i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set();
 	function o(e) {
 		t.add(e);
@@ -9022,7 +9027,7 @@ function Ra(e) {
 		for (let t of Object.values(e)) if (t.kind == "sources") for (let e of t.sources) e.kind == "binding" && (n.add(e.bindingId), o(e.bindingId));
 	}
 	function l(e) {
-		for (let [, t] of La(e.nodes)) switch ("inputs" in t && c(t.inputs), t.kind) {
+		for (let [, t] of Ra(e.nodes)) switch ("inputs" in t && c(t.inputs), t.kind) {
 			case "condition": break;
 			case "subflow":
 				u(t.subflowId);
@@ -9052,12 +9057,12 @@ function Ra(e) {
 		tasks: a
 	};
 }
-function za(e) {
+function Ba(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 Ba = /* @__PURE__ */ new WeakMap(), Va = class {
+var Va = /* @__PURE__ */ new WeakMap(), Ha = class {
 	#e;
 	#t;
 	#n = /* @__PURE__ */ new WeakMap();
@@ -9066,7 +9071,7 @@ var Ba = /* @__PURE__ */ new WeakMap(), Va = 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 za(this.#e)) t.add(e.action);
+		for (let e of Ba(this.#e)) t.add(e.action);
 		this.connectorActionIds = t;
 	}
 	subflow(e) {
@@ -9080,9 +9085,9 @@ var Ba = /* @__PURE__ */ new WeakMap(), Va = class {
 	}
 	inputSources(e, t) {
 		let n = this.graph(e);
-		return Object.keys(Oa(this.#e, n.nodes[t])).map((e) => ({
+		return Object.keys(ka(this.#e, n.nodes[t])).map((e) => ({
 			handle: e,
-			outputs: Ia(this.#e, n, t, e)
+			outputs: La(this.#e, n, t, e)
 		}));
 	}
 	designerInputs(e) {
@@ -9203,13 +9208,13 @@ var Ba = /* @__PURE__ */ new WeakMap(), Va = class {
 		return !1;
 	}
 };
-function Ha(e) {
-	let t = Ba.get(e);
-	return t ?? (t = new Va(e), Ba.set(e, t)), t;
+function Ua(e) {
+	let t = Va.get(e);
+	return t ?? (t = new Ha(e), Va.set(e, t)), t;
 }
 //#endregion
 //#region src/workbench/browser/runtime/runs/runStore.ts
-var Ua = {
+var Wa = {
 	eventCursor: 0,
 	eventFilter: "all",
 	events: [],
@@ -9223,31 +9228,31 @@ var Ua = {
 	refreshing: !1,
 	runById: /* @__PURE__ */ new Map(),
 	runIds: []
-}, Wa = 100, Ga = 500, Ka = 1200, qa = 6e4;
-function Ja(e) {
+}, Ga = 100, Ka = 500, qa = 1200, Ja = 6e4;
+function Ya(e) {
 	return e?.status == "queued" || e?.status == "starting" || e?.status == "running" || e?.status == "waiting";
 }
-function Ya(e) {
+function Xa(e) {
 	return e.selectedRunId == null ? void 0 : e.runById.get(e.selectedRunId);
 }
-function Xa(e, t) {
-	let n = new Map(t.map((e) => [e.runId, e])), r = t.map((e) => e.runId), i = Ya(e);
+function Za(e, t) {
+	let n = new Map(t.map((e) => [e.runId, e])), r = t.map((e) => e.runId), i = Xa(e);
 	return i != null && (n.has(i.runId) || r.unshift(i.runId), n.set(i.runId, i)), {
 		runById: n,
 		runIds: r
 	};
 }
-function Za(e, t) {
+function Qa(e, t) {
 	return new Map(e.runById).set(t.runId, t);
 }
-var Qa = class {
+var $a = class {
 	#e = new pn();
 	#t;
 	#n;
 	#r = new pn();
 	#i = new pn();
 	#a;
-	#o = t(Ua);
+	#o = t(Wa);
 	#s;
 	constructor(t, r, i = pt()) {
 		this.#t = t, this.#n = i, this.#a = r, this.$ = {
@@ -9266,7 +9271,7 @@ var Qa = class {
 			refreshing: e(this.#o, (e) => e.refreshing),
 			result: e(this.#o, (e) => e.result),
 			resolvingAction: e(this.#o, (e) => e.resolvingAction),
-			run: e(this.#o, Ya),
+			run: e(this.#o, Xa),
 			runs: e(this.#o, (e) => e.runIds.flatMap((t) => {
 				let n = e.runById.get(t);
 				return n == null ? [] : [n];
@@ -9279,7 +9284,7 @@ var Qa = class {
 		this.#o.dispose();
 	}
 	reset() {
-		this.#e.invalidate(), this.#r.invalidate(), this.#i.invalidate(), this.#f(), this.#o.set(Ua);
+		this.#e.invalidate(), this.#r.invalidate(), this.#i.invalidate(), this.#f(), this.#o.set(Wa);
 	}
 	async load(e) {
 		let t = this.#o.value, n = t.loaded && t.target?.flowId == e, r = this.#r.begin();
@@ -9294,20 +9299,20 @@ var Qa = class {
 				let t = await this.#t.listRuns(e, { limit: 50 });
 				if (!r() || this.#o.value.target?.flowId != e) return;
 				this.#p({
-					...Xa(this.#o.value, t.runs),
+					...Za(this.#o.value, t.runs),
 					nextCursor: t.nextCursor,
 					refreshing: !1
 				});
 			} catch (e) {
 				if (!r()) return;
-				this.#p({ refreshing: !1 }), this.#a(k(e, this.#n.t));
+				this.#p({ refreshing: !1 }), this.#a(A(e, this.#n.t));
 			}
 			return;
 		}
 		this.#i.invalidate(), this.#f(), this.#a(void 0);
-		let i = Ya(t)?.flowId == e ? t.cancelingRunId : void 0;
+		let i = Xa(t)?.flowId == e ? t.cancelingRunId : void 0;
 		t.cancelingRunId != null && i == null && this.#e.invalidate(), this.#o.set({
-			...Ua,
+			...Wa,
 			...i == null ? {} : { cancelingRunId: i },
 			eventFilter: t.eventFilter,
 			loading: !0,
@@ -9317,7 +9322,7 @@ var Qa = class {
 			let t = await this.#t.listRuns(e, { limit: 50 });
 			if (!r()) return;
 			this.#p({
-				...Xa(this.#o.value, t.runs),
+				...Za(this.#o.value, t.runs),
 				loaded: !0,
 				loadFailed: !1,
 				loading: !1,
@@ -9330,7 +9335,7 @@ var Qa = class {
 			this.#p({
 				loadFailed: !0,
 				loading: !1
-			}), this.#a(k(e, this.#n.t));
+			}), this.#a(A(e, this.#n.t));
 		}
 	}
 	async loadMore() {
@@ -9361,7 +9366,7 @@ var Qa = class {
 			this.#p({
 				loadMoreFailed: !0,
 				loadingMore: !1
-			}), this.#a(k(e, this.#n.t));
+			}), this.#a(A(e, this.#n.t));
 		}
 	}
 	changed(e) {
@@ -9377,7 +9382,7 @@ var Qa = class {
 		e != null && await this.load(e.flowId);
 	}
 	retryObservation() {
-		let e = Ya(this.#o.value);
+		let e = Xa(this.#o.value);
 		if (e == null) return;
 		let t = this.#i.begin();
 		this.#f(), this.#p({ observationFailed: !1 }), this.#l(e, t);
@@ -9386,8 +9391,8 @@ var Qa = class {
 		this.#p({ eventFilter: e });
 	}
 	async cancel() {
-		let e = Ya(this.#o.value);
-		if (!Ja(e) || this.#o.value.cancelingRunId != null || this.#o.value.resolvingAction != null) return;
+		let e = Xa(this.#o.value);
+		if (!Ya(e) || this.#o.value.cancelingRunId != null || this.#o.value.resolvingAction != null) return;
 		let t = this.#e.begin();
 		this.#a(void 0), this.#p({ cancelingRunId: e.runId });
 		try {
@@ -9399,31 +9404,31 @@ var Qa = class {
 				...i,
 				status: n.status
 			};
-			if (this.#p({ runById: Za(r, a) }), r.selectedRunId != e.runId) return;
+			if (this.#p({ runById: Qa(r, a) }), r.selectedRunId != e.runId) return;
 			let o = this.#i.begin();
 			this.#f(), await this.#l(a, o);
 		} catch (e) {
-			t() && this.#a(k(e, this.#n.t));
+			t() && this.#a(A(e, this.#n.t));
 		} finally {
 			t() && this.#o.value.cancelingRunId == e.runId && this.#p({ cancelingRunId: void 0 });
 		}
 	}
 	async resolve(e) {
-		let t = Ya(this.#o.value), n = t?.status == "waiting" && "waiting" in t ? t.waiting : void 0;
+		let t = Xa(this.#o.value), n = t?.status == "waiting" && "waiting" in t ? t.waiting : void 0;
 		if (!(t == null || n == null || this.#o.value.cancelingRunId != null || this.#o.value.resolvingAction != null || !n.actions.some((t) => t == e))) {
 			this.#a(void 0), this.#p({ resolvingAction: e });
 			try {
-				let r = await this.#t.resolveRunWait(t.runId, n.waitId, e), i = this.#o.value, a = Ya(i);
+				let r = await this.#t.resolveRunWait(t.runId, n.waitId, e), i = this.#o.value, a = Xa(i);
 				if (a?.runId != t.runId || !("waiting" in a) || a.waiting?.waitId != n.waitId) return;
 				let { waiting: o, ...s } = a, c = {
 					...s,
 					status: r.status
 				};
-				this.#p({ runById: Za(i, c) }), this.retryObservation();
+				this.#p({ runById: Qa(i, c) }), this.retryObservation();
 				let l = this.#o.value.target;
 				l != null && this.#u(l.flowId);
 			} catch (e) {
-				this.#o.value.selectedRunId == t.runId && this.#a(k(e, this.#n.t));
+				this.#o.value.selectedRunId == t.runId && this.#a(A(e, this.#n.t));
 			} finally {
 				this.#o.value.resolvingAction == e && this.#p({ resolvingAction: void 0 });
 			}
@@ -9452,7 +9457,7 @@ var Qa = class {
 			externalRunId: void 0,
 			loaded: !0,
 			result: void 0,
-			runById: Za(n, e),
+			runById: Qa(n, e),
 			runIds: [e.runId, ...n.runIds.filter((t) => t != e.runId)],
 			selectedRunId: e.runId,
 			target: { flowId: e.flowId }
@@ -9475,19 +9480,19 @@ var Qa = class {
 			observationFailed: !1,
 			resolvingAction: void 0,
 			result: void 0,
-			runById: Za(n, e),
+			runById: Qa(n, e),
 			selectedRunId: e.runId
 		}), this.#l(e, t);
 	}
 	async #l(e, t) {
-		let n = pe.makeUnsafe();
+		let n = me.makeUnsafe();
 		this.#s = y.runFork(y.gen({ self: this }, function* () {
 			let r = e, i = 0;
 			for (; t();) {
 				let a = this.#o.value.eventCursor, [o, s] = yield* y.tryPromise({
 					try: (t) => Promise.allSettled([this.#t.getRun(e.runId, t), this.#t.getRunEvents(e.runId, {
 						after: a,
-						limit: Wa
+						limit: Ga
 					}, t)]),
 					catch: (e) => e
 				});
@@ -9495,11 +9500,11 @@ var Qa = class {
 				if (!t() || this.#o.value.selectedRunId != e.runId) return;
 				let c = o.value;
 				if (this.#p({ observationFailed: !1 }), s.status == "rejected") {
-					if (!(s.reason instanceof _e) || s.reason.code != "run.events-expired") return yield* y.fail(s.reason);
+					if (!(s.reason instanceof ve) || s.reason.code != "run.events-expired") return yield* y.fail(s.reason);
 					this.#p({
 						eventsExpiresAt: void 0,
 						historyComplete: !1,
-						runById: Za(this.#o.value, c)
+						runById: Qa(this.#o.value, c)
 					}), yield* y.tryPromise({
 						try: (e) => this.#d(c, t, e),
 						catch: (e) => e
@@ -9512,19 +9517,19 @@ var Qa = class {
 					events: [...this.#o.value.events, ...l.events],
 					eventsExpiresAt: l.eventsExpiresAt,
 					historyComplete: l.historyComplete,
-					runById: Za(this.#o.value, c)
+					runById: Qa(this.#o.value, c)
 				}), yield* y.tryPromise({
 					try: (e) => this.#d(c, t, e),
 					catch: (e) => e
-				}), yield* pe.succeed(n, void 0), ge(c.status) && l.done) return;
+				}), yield* me.succeed(n, void 0), _e(c.status) && l.done) return;
 				let u = c.status == "queued" || c.status == "starting";
 				i = u && c.status == r.status ? i + 1 : 0;
-				let d = ge(c.status) || l.events.length == Wa ? 0 : c.status == "waiting" ? qa : u ? Math.min(Ka, Ga * 2 ** Math.max(0, i - 1)) : Ka;
+				let d = _e(c.status) || l.events.length == Ga ? 0 : c.status == "waiting" ? Ja : u ? Math.min(qa, Ka * 2 ** Math.max(0, i - 1)) : qa;
 				r = c, yield* y.sleep(d);
 			}
 		}).pipe(y.catch((n) => y.sync(() => {
-			t() && this.#o.value.selectedRunId == e.runId && (this.#p({ observationFailed: !0 }), this.#a(k(n, this.#n.t)));
-		})), y.ensuring(pe.succeed(n, void 0)))), await y.runPromise(pe.await(n));
+			t() && this.#o.value.selectedRunId == e.runId && (this.#p({ observationFailed: !0 }), this.#a(A(n, this.#n.t)));
+		})), y.ensuring(me.succeed(n, void 0)))), await y.runPromise(me.await(n));
 	}
 	async #u(e) {
 		let t = this.#r.begin();
@@ -9536,7 +9541,7 @@ var Qa = class {
 			let n = await this.#t.listRuns(e, { limit: 50 });
 			if (!t() || this.#o.value.target?.flowId != e) return;
 			this.#p({
-				...Xa(this.#o.value, n.runs),
+				...Za(this.#o.value, n.runs),
 				loaded: !0,
 				loadingMore: !1,
 				nextCursor: n.nextCursor,
@@ -9547,7 +9552,7 @@ var Qa = class {
 		}
 	}
 	async #d(e, t, n) {
-		if (!ge(e.status) || this.#o.value.result?.runId == e.runId) return;
+		if (!_e(e.status) || this.#o.value.result?.runId == e.runId) return;
 		let r = await this.#t.getRunResult(e.runId, n);
 		t() && this.#o.value.selectedRunId == e.runId && this.#p({ result: r });
 	}
@@ -9560,7 +9565,7 @@ var Qa = class {
 			...e
 		});
 	}
-}, $a = {
+}, eo = {
 	"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",
@@ -11038,35 +11043,35 @@ var Qa = class {
 };
 //#endregion
 //#region src/workbench/browser/runtime/providerIcon.ts
-function eo(e, t = $a) {
-	let n = io(no(e.serviceName)), r = to(e, t);
+function to(e, t = eo) {
+	let n = ao(ro(e.serviceName)), r = no(e, t);
 	return r == null ? n : ie(r, n);
 }
-function to(e, t = $a) {
+function no(e, t = eo) {
 	let n = e.icon?.trim();
 	if (n) return n;
 	let r = t[e.serviceId]?.trim();
 	if (r) return r;
-	let i = ro(e.homepageUrl);
+	let i = io(e.homepageUrl);
 	return i == null ? void 0 : `https://www.google.com/s2/favicons?sz=64&domain=${encodeURIComponent(i)}`;
 }
-function no(e) {
+function ro(e) {
 	return e.split(/\s+/).map((e) => e[0]).join("").slice(0, 2).toUpperCase() || "?";
 }
-function ro(e) {
+function io(e) {
 	if (e) try {
 		return new URL(e).hostname || void 0;
 	} catch {
 		return;
 	}
 }
-function io(e) {
+function ao(e) {
 	let t = `<svg xmlns="http://www.w3.org/2000/svg" viewBox="0 0 64 64"><rect width="64" height="64" rx="12" fill="#e4e4e7"/><text x="32" y="33" fill="#3f3f46" font-family="Arial,sans-serif" font-size="25" font-weight="600" text-anchor="middle" dominant-baseline="central">${[...e].map((e) => `&#${e.codePointAt(0)};`).join("")}</text></svg>`;
 	return `data:image/svg+xml,${encodeURIComponent(t)}`;
 }
 //#endregion
 //#region src/workbench/browser/runtime/workspace.ts
-function ao(e) {
+function oo(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 {
@@ -11076,7 +11081,7 @@ function ao(e) {
 		preferred: r ?? (t.length == 1 ? t[0] : void 0)
 	};
 }
-function oo(e, t) {
+function so(e, t) {
 	if (e.node.name != null) return e.node.name;
 	switch (e.kind) {
 		case "condition": return t?.("addNode.condition") ?? "Condition";
@@ -11086,7 +11091,7 @@ function oo(e, t) {
 		case "task": return e.definition?.name ?? (e.node.task == null ? e.node.taskId : e.node.task.moduleId);
 	}
 }
-function so(e) {
+function co(e) {
 	if (e.kind == "value") return ":oomol:value:";
 	if (e.kind != "task") return;
 	let t = e.definition;
@@ -11095,39 +11100,43 @@ function so(e) {
 function Q(e) {
 	if (!(typeof e != "object" || !e || Array.isArray(e))) return e;
 }
-function co(e) {
+function lo(e) {
 	return typeof e == "number" && Number.isFinite(e) ? e : void 0;
 }
-function lo(e, t) {
+function uo(e, t) {
 	let n = Q(e.designer);
-	if (n?.version == 1) return Fo(n, t);
+	if (n?.version == 1) return Lo(n, t);
 }
-function uo(e, t) {
+function fo(e, t) {
 	return ((e) => Object.fromEntries(Object.entries(Q(e) ?? {}).flatMap(([e, t]) => {
-		let n = Q(t), r = co(n?.x), i = co(n?.y);
+		let n = Q(t), r = lo(n?.x), i = lo(n?.y);
 		return r == null || i == null ? [] : [[e, {
 			x: r,
 			y: i
 		}]];
-	})))(lo(e, t)?.nodes);
+	})))(uo(e, t)?.nodes);
 }
-function fo(e, t) {
-	let n = Q(lo(e, t)?.viewport), r = co(n?.x), i = co(n?.y), a = co(n?.zoom);
+function po(e, t) {
+	let n = fo(e, t), r = uo(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 mo(e, t) {
+	let n = Q(uo(e, t)?.viewport), r = lo(n?.x), i = lo(n?.y), a = lo(n?.zoom);
 	return r == null || i == null || a == null || a <= 0 ? void 0 : {
 		x: r,
 		y: i,
 		zoom: a
 	};
 }
-function po(e, t) {
-	return fo(e, t) ?? {
+function ho(e, t) {
+	return mo(e, t) ?? {
 		x: 0,
 		y: 0,
 		zoom: 1
 	};
 }
-function mo(e, t, n) {
-	let r = Q(lo(e, t)?.comments) ?? {};
+function go(e, t, n) {
+	let r = Q(uo(e, t)?.comments) ?? {};
 	return Object.fromEntries(Object.entries(r).flatMap(([e, t]) => {
 		let r = Q(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, {
@@ -11140,7 +11149,7 @@ function mo(e, t, n) {
 		}]];
 	}));
 }
-function ho(e, t, n, r) {
+function _o(e, t, n, r) {
 	return JSON.stringify([
 		e,
 		t,
@@ -11148,11 +11157,11 @@ function ho(e, t, n, r) {
 		r
 	]);
 }
-function go(e) {
+function vo(e) {
 	if (e.kind == "trigger") return {
 		inputs: /* @__PURE__ */ new Map(),
 		outputs: /* @__PURE__ */ new Map([["payload", {
-			jsonSchema: xa(e.trigger),
+			jsonSchema: Sa(e.trigger),
 			nullable: !1
 		}]])
 	};
@@ -11241,7 +11250,7 @@ function go(e) {
 		outputs: n
 	};
 }
-function _o(e) {
+function yo(e) {
 	switch (e) {
 		case "endsWith": return "ends with";
 		case "hasKey": return "has key";
@@ -11265,7 +11274,7 @@ function _o(e) {
 		case "contains": return e;
 	}
 }
-function vo(e, t, n) {
+function bo(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`);
@@ -11274,7 +11283,7 @@ function vo(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 yo(e, t, n, r) {
+function xo(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();
 	n.status == "waiting" && "waiting" in n && n.waiting != null && a.set(n.waiting.nodeId, {
@@ -11358,10 +11367,10 @@ function yo(e, t, n, r) {
 		status: i ? "running" : "idle"
 	};
 }
-function bo(e, t, n) {
+function So(e, t, n) {
 	if (e != null) return "moduleId" in e ? n?.("designer.executorJavaScript") ?? "javascript" : t ? n?.("designer.executorConnectionRequired") ?? "connection required" : e.executor.kind == "llm" ? n?.("designer.executorLlm") ?? "llm" : n?.("designer.executorConnector") ?? "connector";
 }
-function xo(e) {
+function Co(e) {
 	switch (e.kind) {
 		case "manual": return ":carbon:play:";
 		case "cron": return ":carbon:time:";
@@ -11370,16 +11379,16 @@ function xo(e) {
 		case "webhook": return ":carbon:webhook:";
 	}
 }
-function So(e, t) {
+function wo(e, t) {
 	return t.filter((t) => t.code != "trigger.config-incomplete" && t.path.startsWith(`/document/graph/nodes/${e}`)).length;
 }
-function Co(e, t) {
+function To(e, t) {
 	let n = [], r = new Map([...t].map((e) => [e, /* @__PURE__ */ new Set()])), i = new Map([...t].map((e) => [e, /* @__PURE__ */ new Set()]));
 	for (let a of e.edges) {
 		if (!t.has(a.source) || !t.has(a.target)) continue;
 		let e = a.sourceHandle == null ? "$out" : `$branch:${a.sourceHandle}`;
 		n.push({
-			id: ho(a.source, e, a.target, "$in"),
+			id: _o(a.source, e, a.target, "$in"),
 			source: a.source,
 			sourceHandle: e,
 			target: a.target,
@@ -11392,7 +11401,7 @@ function Co(e, t) {
 		edges: n
 	};
 }
-function wo(e, t, n) {
+function Eo(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];
@@ -11411,14 +11420,14 @@ function wo(e, t, n) {
 		ordered: a
 	};
 }
-function To(e, t, n, r, i) {
+function Do(e, t, n, r, i) {
 	if (!("inputs" in t)) return [];
 	let a = [];
 	for (let [o, s] of n.inputs) {
 		let n = t.inputs[o], c = [], l = /* @__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, i = ho(n, r, e, o);
+			let n = t.nodeId, r = t.output, i = _o(n, r, e, o);
 			l.has(i) || (l.add(i), c.push({
 				nodeId: n,
 				output: r
@@ -11431,16 +11440,16 @@ function To(e, t, n, r, i) {
 			...n?.kind == "value" ? { value: n.value } : {},
 			...c.length > 0 ? { sources: c } : {},
 			...d?.kind == "variable" ? { variable: d.target } : {},
-			variableCompatible: Da(s.jsonSchema),
+			variableCompatible: Oa(s.jsonSchema),
 			variableEnabled: i
 		});
 	}
 	return a;
 }
-function Eo(e) {
+function Oo(e) {
 	return [...e.outputs].map(([e, t]) => Object.assign({ handle: e }, t));
 }
-function Do(e, t) {
+function ko(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) {
@@ -11453,7 +11462,7 @@ function Do(e, t) {
 	}
 	return r.push(...n.values()), r;
 }
-function Oo(e, t) {
+function Ao(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) {
@@ -11466,10 +11475,10 @@ function Oo(e, t) {
 	}
 	return r.push(...n.values()), r;
 }
-function ko(e) {
+function jo(e) {
 	return e === void 0 ? "" : typeof e == "string" ? e : JSON.stringify(e);
 }
-function Ao(e) {
+function Mo(e) {
 	if (e.kind != "integration" && e.kind != "poll") return [];
 	let t = Q(e.definition.configSchema), n = Q(t?.properties), r = new Set(Array.isArray(t?.required) ? t.required.filter((e) => typeof e == "string") : []), i = [];
 	for (let [t, a] of Object.entries(n ?? {})) {
@@ -11481,14 +11490,14 @@ function Ao(e) {
 			label: typeof n.title == "string" ? n.title : t,
 			name: t,
 			required: r.has(t),
-			source: ko(o)
+			source: jo(o)
 		};
 		if (Array.isArray(n.enum)) {
 			i.push({
 				...s,
 				kind: "select",
 				options: n.enum.map((e) => {
-					let t = ko(e);
+					let t = jo(e);
 					return {
 						label: t,
 						source: t,
@@ -11504,14 +11513,14 @@ function Ao(e) {
 				...s,
 				kind: "multi-select",
 				options: c.enum.map((e) => {
-					let t = ko(e);
+					let t = jo(e);
 					return {
 						label: t,
 						source: t,
 						value: e
 					};
 				}),
-				selected: Array.isArray(o) ? o.map(ko) : []
+				selected: Array.isArray(o) ? o.map(jo) : []
 			});
 			continue;
 		}
@@ -11533,7 +11542,7 @@ function Ao(e) {
 	}
 	return i.toSorted((e, t) => Number(!e.required) - Number(!t.required) || Number(e.kind == "json" || e.kind == "multi-select") - Number(t.kind == "json" || t.kind == "multi-select"));
 }
-function jo(e, t, n, r) {
+function No(e, t, n, r) {
 	let i;
 	switch (t.kind) {
 		case "manual":
@@ -11550,7 +11559,7 @@ function jo(e, t, n, r) {
 			break;
 		case "integration":
 			i = {
-				config: Ao(t),
+				config: Mo(t),
 				kind: t.kind,
 				schedules: [],
 				source: t.definition.provider
@@ -11558,7 +11567,7 @@ function jo(e, t, n, r) {
 			break;
 		case "poll":
 			i = {
-				config: Ao(t),
+				config: Mo(t),
 				kind: t.kind,
 				schedules: t.pollTimes,
 				source: t.definition.provider
@@ -11581,17 +11590,17 @@ function jo(e, t, n, r) {
 	}
 	return {
 		description: t.description,
-		diagnostics: So(e, r),
-		icon: t.icon ?? (t.kind == "integration" || t.kind == "poll" ? eo({
+		diagnostics: wo(e, r),
+		icon: t.icon ?? (t.kind == "integration" || t.kind == "poll" ? to({
 			serviceId: t.definition.provider,
 			serviceName: t.definition.provider
-		}) : xo(t)),
+		}) : Co(t)),
 		id: e,
 		inputs: [],
 		kind: "trigger",
 		outputs: [{
 			handle: "payload",
-			jsonSchema: xa(t),
+			jsonSchema: Sa(t),
 			nullable: !1
 		}],
 		presentation: i,
@@ -11601,31 +11610,31 @@ function jo(e, t, n, r) {
 		title: t.name
 	};
 }
-function Mo(e, t, n, r, i) {
-	let a = t.node, o = Do(t, To(e, a, n, i.revision, i.variables)), s = Oo(t, Eo(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 = u?.defaultConnection, p = l?.connectionId, m = p == null ? void 0 : d?.byId.get(p);
+function Po(e, t, n, r, i) {
+	let a = t.node, o = ko(t, Do(e, a, n, i.revision, i.variables)), s = Ao(t, Oo(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 = u?.defaultConnection, p = l?.connectionId, m = p == null ? void 0 : d?.byId.get(p);
 	m == null && f != null && f.connectionId == p && (m = f);
-	let ee = u?.authenticated == 1 && (l?.connectionId == null || d != null && m?.status != "active"), te = i.runNodes.get(e), h = {
+	let h = u?.authenticated == 1 && (l?.connectionId == null || d != null && m?.status != "active"), ee = i.runNodes.get(e), g = {
 		description: a.description,
-		diagnostics: vo(i.target, t, i.diagnostics),
-		icon: a.icon ?? (u == null ? so(t) : eo(u)),
+		diagnostics: bo(i.target, t, i.diagnostics),
+		icon: a.icon ?? (u == null ? co(t) : to(u)),
 		id: e,
 		inputs: o,
 		outputs: s,
 		position: r,
 		rawIcon: a.icon,
 		rawTitle: a.name,
-		...te == null ? {} : { run: te },
+		...ee == null ? {} : { run: ee },
 		timeoutSeconds: a.timeoutMs == null ? void 0 : a.timeoutMs / 1e3,
-		title: oo(t, i.t)
+		title: so(t, i.t)
 	};
 	switch (a.kind) {
 		case "condition": return {
-			...h,
+			...g,
 			kind: a.kind,
 			cases: a.cases.map((e) => ({
 				expressions: e.expressions.map((e) => ({
 					input: e.input,
-					operator: _o(e.operator),
+					operator: yo(e.operator),
 					value: e.value
 				})),
 				output: e.output,
@@ -11634,12 +11643,12 @@ function Mo(e, t, n, r, i) {
 			defaultOutput: a.defaultOutput
 		};
 		case "subflow": return {
-			...h,
+			...g,
 			kind: a.kind,
 			reference: a.subflowId
 		};
 		case "task": return {
-			...h,
+			...g,
 			additionalInputs: a.additionalInputs?.flatMap((e) => {
 				let t = o.find((t) => "handle" in t && t.handle == e.handle);
 				return t == null || "group" in t ? [] : [t];
@@ -11647,29 +11656,29 @@ function Mo(e, t, n, r, i) {
 			editableAdditionalInputs: a.task == null,
 			editablePorts: a.task != null,
 			kind: a.kind,
-			executorName: bo(c, ee, i.t),
+			executorName: So(c, h, i.t),
 			reference: a.task == null ? a.taskId : a.task.moduleId
 		};
 		case "value": return {
-			...h,
+			...g,
 			kind: a.kind,
 			values: a.values.map((e) => Object.assign({}, e))
 		};
 		case "wait": {
 			let e = a.notification == null ? void 0 : i.revision.task(a.notification.taskId), t = e?.executor.kind == "connector" ? i.connectorActions[e.executor.action] : void 0, n = (t?.name ?? e?.name)?.replaceAll("_", " "), r = n == null ? void 0 : t == null ? n : `${t.serviceName} · ${n}`;
 			return {
-				...h,
+				...g,
 				kind: a.kind,
 				...r == null ? {} : { notice: {
-					...t == null ? {} : { icon: eo(t) },
+					...t == null ? {} : { icon: to(t) },
 					text: `${i.t?.("inspector.wait.notificationTask") ?? "Notification"} · ${r}`
 				} }
 			};
 		}
 	}
 }
-function No(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1, d = !1, f = !0) {
-	let p = e == null ? void 0 : Ha(e), m = p == null || t == null ? void 0 : p.graph(t);
+function Fo(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1, d = !1, f = !0) {
+	let p = e == null ? void 0 : Ua(e), m = p == null || t == null ? void 0 : p.graph(t);
 	if (p == null || t == null || m == null) return {
 		edges: [],
 		nodes: [],
@@ -11679,52 +11688,53 @@ function No(e, t, n = {}, r = [], i = {}, a = {}, o, s, c = [], l = [], u = !1,
 			zoom: 1
 		}
 	};
-	let ee = yo(p, t, s, c), te = Object.entries(m.nodes), h = new Map(te.map(([e, t]) => [e, p.resolveNode(e, t)])), ne = new Set(te.map(([e]) => e)), re = new Map([...h].map(([e, t]) => [e, go(t)])), ie = Co(m, ne), ae = wo(ne, ie.dependencies, ie.dependents), oe = uo(n, t), se = {
+	let h = xo(p, t, s, c), ee = Object.entries(m.nodes), g = new Map(ee.map(([e, t]) => [e, p.resolveNode(e, t)])), te = new Set(ee.map(([e]) => e)), ne = new Map([...g].map(([e, t]) => [e, vo(t)])), re = To(m, te), ie = Eo(te, re.dependencies, re.dependents), ae = fo(n, t), oe = {
 		connectionCatalogs: a,
 		connectorActions: i,
 		diagnostics: r,
 		revision: p,
-		runNodes: ee.nodes,
+		runNodes: h.nodes,
 		t: o,
 		target: t,
 		variables: f
-	}, ce = /* @__PURE__ */ new Map(), g = [];
-	for (let e of ae.ordered) {
-		let t = ae.depth.get(e) ?? 0, n = ce.get(t) ?? 0;
-		ce.set(t, n + 1);
-		let i = oe[e] ?? {
+	}, se = /* @__PURE__ */ new Map(), ce = [];
+	for (let e of ie.ordered) {
+		let t = ie.depth.get(e) ?? 0, n = se.get(t) ?? 0;
+		se.set(t, n + 1);
+		let i = ae[e] ?? {
 			x: 80 + t * 500,
 			y: 80 + n * 240
-		}, a = h.get(e);
+		}, a = g.get(e);
 		if (a.kind == "trigger") {
-			g.push(jo(e, a.trigger, i, r));
+			ce.push(No(e, a.trigger, i, r));
 			continue;
 		}
-		g.push(Mo(e, a, re.get(e), i, se));
+		ce.push(Po(e, a, ne.get(e), i, oe));
 	}
-	for (let [e, r] of Object.entries(mo(n, t, oe)).toSorted(([e], [t]) => e.localeCompare(t))) g.push({
+	for (let [e, r] of Object.entries(go(n, t, ae)).toSorted(([e], [t]) => e.localeCompare(t))) ce.push({
 		...r,
 		id: e,
 		kind: "comment"
 	});
-	return {
-		edges: ie.edges,
-		nodes: g,
-		...ee.status == null ? {} : { runStatus: ee.status },
-		viewport: po(n, t),
+	let le = new Map(po(n, t).map((e, t) => [e, t]));
+	return ce.sort((e, t) => (le.get(e.id) ?? -1) - (le.get(t.id) ?? -1)), {
+		edges: re.edges,
+		nodes: ce,
+		...h.status == null ? {} : { runStatus: h.status },
+		viewport: ho(n, t),
 		variableNames: l,
 		variableNamesLoaded: u,
 		variableNamesLoading: d
 	};
 }
-function Po(e) {
+function Io(e) {
 	let t = Q(e.designer);
 	return t?.version == 1 ? t : { version: 1 };
 }
-function Fo(e, t) {
+function Lo(e, t) {
 	return t.kind == "flow" ? Q(e.flow) : Q(Q(e.subflows)?.[t.id]);
 }
-function Io(e, t, n) {
+function Ro(e, t, n) {
 	if (t.kind == "flow") return {
 		...e,
 		flow: n,
@@ -11740,17 +11750,20 @@ function Io(e, t, n) {
 		version: 1
 	};
 }
-function Lo(e, t) {
+function zo(e, t) {
 	let n = {
-		...lo(e, t),
-		viewport: { ...po(e, t) },
-		nodes: uo(e, t)
+		...uo(e, t),
+		viewport: { ...ho(e, t) },
+		nodes: fo(e, t),
+		order: po(e, t)
 	};
 	return delete n.layouts, n;
 }
-function Ro(e, t, n) {
-	let r = Po(e), i = Lo(e, t), a = {
-		...Q(i.nodes) ?? {},
+function Bo(e, t, n) {
+	let r = Io(e), i = zo(e, t), a = Q(i.nodes) ?? {}, o = [...po(e, t)];
+	for (let e of Object.keys(n)) o.includes(e) || o.push(e);
+	let s = {
+		...a,
 		...Object.fromEntries(Object.entries(n).map(([e, t]) => [e, {
 			x: t.x,
 			y: t.y
@@ -11758,17 +11771,18 @@ function Ro(e, t, n) {
 	};
 	return {
 		...e,
-		designer: Io(r, t, {
+		designer: Ro(r, t, {
 			...i,
-			nodes: a
+			nodes: s,
+			order: o
 		})
 	};
 }
-function zo(e, t, n, r) {
-	let i = Ro(e, t, { [n]: r.position }), a = Po(i), o = Fo(a, t) ?? {}, s = Q(o.comments) ?? {};
+function Vo(e, t, n, r) {
+	let i = Bo(e, t, { [n]: r.position }), a = Io(i), o = Lo(a, t) ?? {}, s = Q(o.comments) ?? {};
 	return {
 		...i,
-		designer: Io(a, t, {
+		designer: Ro(a, t, {
 			...o,
 			comments: {
 				...s,
@@ -11780,28 +11794,30 @@ function zo(e, t, n, r) {
 		})
 	};
 }
-function Bo(e, t, n) {
-	let r = Po(e), i = Lo(e, t), a = { ...Q(i.comments) }, o = { ...Q(i.nodes) };
+function Ho(e, t, n) {
+	let r = Io(e), i = zo(e, t), a = { ...Q(i.comments) }, o = { ...Q(i.nodes) };
 	for (let e of n) delete a[e], delete o[e];
+	let s = po(e, t).filter((e) => !n.has(e));
 	return {
 		...e,
-		designer: Io(r, t, {
+		designer: Ro(r, t, {
 			...i,
 			comments: a,
-			nodes: o
+			nodes: o,
+			order: s
 		})
 	};
 }
-function Vo(e, t) {
-	return new Set(Object.keys(Q(lo(e, t)?.comments) ?? {}));
+function Uo(e, t) {
+	return new Set(Object.keys(Q(uo(e, t)?.comments) ?? {}));
 }
-function Ho(e, t, n) {
-	let r = fo(e, t);
+function Wo(e, t, n) {
+	let r = mo(e, t);
 	if (r?.x == n.x && r.y == n.y && r.zoom == n.zoom) return e;
-	let i = Po(e), a = Lo(e, t);
+	let i = Io(e), a = zo(e, t);
 	return {
 		...e,
-		designer: Io(i, t, {
+		designer: Ro(i, t, {
 			...a,
 			viewport: {
 				x: n.x,
@@ -11811,7 +11827,7 @@ function Ho(e, t, n) {
 		})
 	};
 }
-function Uo(e, t, n) {
+function Go(e, t, n) {
 	let r = e.payload.nodeTitle;
 	if (typeof r == "string") return r;
 	let i = e.payload.executionId;
@@ -11824,7 +11840,7 @@ function Uo(e, t, n) {
 }
 //#endregion
 //#region src/workbench/browser/runtime/designer/addNodeOptions.ts
-function Wo(e) {
+function Ko(e) {
 	let t = /* @__PURE__ */ new Map(), n = (e) => {
 		t.set(e.id, e);
 		for (let t of e.choices ?? []) n(t.option);
@@ -11832,7 +11848,7 @@ function Wo(e) {
 	for (let t of e) n(t);
 	return t;
 }
-function Go(e) {
+function qo(e) {
 	let t = e("addNode.blocks");
 	return [
 		{
@@ -11955,9 +11971,9 @@ function Go(e) {
 		}
 	];
 }
-function Ko(e, t, n) {
+function Jo(e, t, n) {
 	if (e == null || t == null) return [];
-	let r = Go(n);
+	let r = qo(n);
 	if (t.kind != "flow") return r;
 	let i = n("addNode.triggers"), a = [
 		{
@@ -12026,9 +12042,9 @@ function Ko(e, t, n) {
 		},
 		...r
 	];
-	return Object.values(Ha(e).graph(t)?.nodes ?? {}).some((e) => e.kind == "manual") ? a.filter((e) => e.id != "trigger:manual") : a;
+	return Object.values(Ua(e).graph(t)?.nodes ?? {}).some((e) => e.kind == "manual") ? a.filter((e) => e.id != "trigger:manual") : a;
 }
-function qo(e, t, n, r) {
+function Yo(e, t, n, r) {
 	switch (e.kind) {
 		case "new-task": return {
 			kind: "code",
@@ -12090,29 +12106,29 @@ function qo(e, t, n, r) {
 }
 //#endregion
 //#region src/manifest/common/meta/block/generateTyping.ts
-function Jo(e, t, n) {
-	return e === "typescript" ? $o(t, n) + "\n" : es(t, n) + "\n";
+function Xo(e, t, n) {
+	return e === "typescript" ? ts(t, n) + "\n" : ns(t, n) + "\n";
 }
-var Yo = /* @__PURE__ */ new Set(["color", "text"]), Xo = (e) => e.includes(" | ") ? `(${e})` : e;
-function Zo(e) {
-	return !e || typeof e != "object" ? !1 : e.contentMediaType === "oomol/artifact" ? !0 : Array.isArray(e.anyOf) ? e.anyOf.some(Zo) : e.type === "object" ? Object.values(e.properties || {}).some(Zo) : e.type === "array" && Zo(e.items);
+var Zo = /* @__PURE__ */ new Set(["color", "text"]), Qo = (e) => e.includes(" | ") ? `(${e})` : e;
+function $o(e) {
+	return !e || typeof e != "object" ? !1 : e.contentMediaType === "oomol/artifact" ? !0 : Array.isArray(e.anyOf) ? e.anyOf.some($o) : e.type === "object" ? Object.values(e.properties || {}).some($o) : e.type === "array" && $o(e.items);
 }
-function Qo(e, t) {
-	return [...e, ...t].some((e) => Zo(e.json_schema));
+function es(e, t) {
+	return [...e, ...t].some((e) => $o(e.json_schema));
 }
-function $o(e = [], t = []) {
+function ts(e = [], t = []) {
 	let n = ["type Inputs = {"];
 	for (let t of e) n.push(`  ${t.handle}: ${$(t.json_schema, t.nullable)};`);
 	n.push("};"), n.push("type Outputs = {");
 	for (let e of t) n.push(`  ${e.handle}: ${$(e.json_schema, e.nullable)};`);
-	return n.push("};"), Qo(e, t) && n.unshift("import type { ArtifactRef } from '@oomol-lab/open-flow'", ""), n.join("\n");
+	return n.push("};"), es(e, t) && n.unshift("import type { ArtifactRef } from '@oomol-lab/open-flow'", ""), n.join("\n");
 }
-function es(e = [], t = []) {
+function ns(e = [], t = []) {
 	let n = ["@typedef {{"];
 	for (let t of e) n.push(`  ${t.handle}: ${$(t.json_schema, t.nullable)};`);
 	n.push("}} Inputs;"), n.push("@typedef {{");
 	for (let e of t) n.push(`  ${e.handle}: ${$(e.json_schema, e.nullable)};`);
-	n.push("}} Outputs;"), Qo(e, t) && n.unshift("@import { ArtifactRef } from \"@oomol-lab/open-flow\"");
+	n.push("}} Outputs;"), es(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");
 }
@@ -12122,9 +12138,9 @@ function $(e, t) {
 		case "oomol/bin": return t ? "Uint8Array | null" : "Uint8Array";
 		case "oomol/artifact": return t ? "ArtifactRef | null" : "ArtifactRef";
 	}
-	if (Yo.has(e["ui:widget"])) return t ? "string | null" : "string";
-	if (Array.isArray(e.anyOf)) return ts((t ? e.anyOf.concat({ type: "null" }) : e.anyOf).map((e) => Xo($(e, !1)))) || "unknown";
-	if (Array.isArray(e.enum)) return ts((t ? e.enum.concat(null) : e.enum).map((e) => JSON.stringify(e))) || "unknown";
+	if (Zo.has(e["ui:widget"])) return t ? "string | null" : "string";
+	if (Array.isArray(e.anyOf)) return rs((t ? e.anyOf.concat({ type: "null" }) : e.anyOf).map((e) => Qo($(e, !1)))) || "unknown";
+	if (Array.isArray(e.enum)) return rs((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";
@@ -12139,30 +12155,30 @@ function $(e, t) {
 		}
 		case "array":
 			if (e.uniqueItems && Array.isArray(e.items?.enum)) {
-				let n = `${Xo($(e.items, !1))}[]`;
+				let n = `${Qo($(e.items, !1))}[]`;
 				return t ? `${n} | null` : n;
 			}
 			{
-				let n = `${Xo($(e.items, !1))}[]`;
+				let n = `${Qo($(e.items, !1))}[]`;
 				return t ? `${n} | null` : n;
 			}
 		default: return "unknown";
 	}
 }
-function ts(e) {
+function rs(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/designer/flowChanges.ts
-function ns(e, t) {
+function is(e, t) {
 	return {
 		...e,
-		content: m(e.content, t)
+		content: h(e.content, t)
 	};
 }
-function rs(e, t = [], n = {}) {
-	let r = Jo("javascript", e.inputs.flatMap((e) => "handle" in e ? [{
+function as(e, t = [], n = {}) {
+	let r = Xo("javascript", e.inputs.flatMap((e) => "handle" in e ? [{
 		handle: e.handle,
 		json_schema: e.jsonSchema,
 		nullable: e.nullable
@@ -12180,7 +12196,7 @@ function rs(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 is(e) {
+function os(e) {
 	return {
 		executor: {
 			action: e.actionId,
@@ -12192,20 +12208,20 @@ function is(e) {
 		outputs: Object.entries(e.outputs).map(([e, t]) => Object.assign({ handle: e }, t))
 	};
 }
-function as(e) {
+function ss(e) {
 	let t = Object.entries(e.inputs);
 	return t.find(([, e]) => {
 		let t = e.jsonSchema;
 		return typeof t == "object" && !!t && !Array.isArray(t) && "type" in t && t.type == "string";
 	})?.[0] ?? t[0]?.[0];
 }
-function os(e, t, n) {
-	return n == null || Ra(m(e.revision.content, t)).tasks.has(n) ? t : [...t, {
+function cs(e, t, n) {
+	return n == null || za(h(e.revision.content, t)).tasks.has(n) ? t : [...t, {
 		kind: "task.delete",
 		taskId: n
 	}];
 }
-function ss(e, t) {
+function ls(e, t) {
 	return [{
 		kind: "subflow.create",
 		subflow: {
@@ -12233,13 +12249,13 @@ function ss(e, t) {
 		subflowId: e
 	}];
 }
-function cs(e, t, n) {
+function us(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]));
 	return n.map((n) => {
 		if (n.kind != "graph.node.create" || n.target.kind != t.kind || t.kind == "subflow" && (n.target.kind != "subflow" || n.target.id != t.id)) return n;
-		let r = p(n.node.name ?? "") || Mt(e.revision.content, n.node), a = d(r, i);
+		let r = m(n.node.name ?? "") || Mt(e.revision.content, n.node), a = d(r, i);
 		return i.add(a), {
 			...n,
 			node: {
@@ -12249,7 +12265,7 @@ function cs(e, t, n) {
 		};
 	});
 }
-function ls(e, t, n, r, i) {
+function ds(e, t, n, r, i) {
 	let a;
 	switch (r.kind) {
 		case "code":
@@ -12268,7 +12284,7 @@ function ls(e, t, n, r, i) {
 			a = It(t, {
 				nodeId: n,
 				taskId: i()
-			}, is(r.action));
+			}, os(r.action));
 			break;
 		case "condition":
 			a = Rt(t, n, r.name);
@@ -12282,7 +12298,7 @@ function ls(e, t, n, r, i) {
 		case "subflow": {
 			let i = e.subflow(r.subflowId);
 			if (i == null) return;
-			a = Os(t, n, r.subflowId, i.inputs);
+			a = As(t, n, r.subflowId, i.inputs);
 			break;
 		}
 		case "manual":
@@ -12319,12 +12335,12 @@ function ls(e, t, n, r, i) {
 				...r.connectionId == null ? {} : { connectionId: r.connectionId }
 			});
 	}
-	return a == null ? void 0 : cs(e, t, a);
+	return a == null ? void 0 : us(e, t, a);
 }
-function us(e, t, n) {
+function fs(e, t, n) {
 	return Ut(e.revision.content, t, n);
 }
-function ds(e, t, n) {
+function ps(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),
@@ -12341,7 +12357,7 @@ function ds(e, t, n) {
 		nodes: i
 	};
 }
-function fs(e, t, n, r) {
+function ms(e, t, n, r) {
 	if (e.graph(t) == null) return {
 		changes: [],
 		nodeIds: [],
@@ -12468,15 +12484,15 @@ function fs(e, t, n, r) {
 		});
 	}
 	return {
-		changes: cs(e, t, s),
+		changes: us(e, t, s),
 		nodeIds: [...o.values()],
 		sourceIds: a
 	};
 }
-function ps(e, t, n, r) {
+function hs(e, t, n, r) {
 	return Wt(e.revision.content, t, n, r);
 }
-function ms(e, t, n, r) {
+function gs(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i != null) return i.description == r ? [] : [{
 		before: i.description,
@@ -12487,7 +12503,7 @@ function ms(e, t, n, r) {
 		value: r
 	}];
 }
-function hs(e, t, n, r) {
+function _s(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i != null) return i.icon == r ? [] : [{
 		before: i.icon,
@@ -12498,7 +12514,7 @@ function hs(e, t, n, r) {
 		value: r
 	}];
 }
-function gs(e, t, n, r) {
+function vs(e, t, n, r) {
 	let i = e.node(t, n)?.node;
 	if (i == null) return;
 	let a = "inputs" in i ? r : r ?? i.name;
@@ -12511,17 +12527,17 @@ function gs(e, t, n, r) {
 		value: a
 	}];
 }
-function _s(e, t, n, r, i) {
+function ys(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 Gt(e.revision.content, t, n, r, i);
 }
-function vs(e, t, n, r, i, a) {
+function bs(e, t, n, r, i, a) {
 	return Jt(e.revision.content, t, n, r, i, a);
 }
-function ys(e, t, n, r) {
+function xs(e, t, n, r) {
 	let a = e.graph(t), o = a?.nodes[n];
 	if (a == null || o?.kind != "condition") return;
-	let s = Object.fromEntries([...o.cases.map((e) => [e.output, !0]), ...o.defaultOutput == null ? [] : [[o.defaultOutput, !0]]]), c = Object.fromEntries([...r.cases.map((e) => [e.output, !0]), ...r.defaultOutput == null ? [] : [[r.defaultOutput, !0]]]), l = o.input.handle == r.input.handle ? void 0 : [o.input.handle, r.input.handle], u = As(Object.keys(s).map((e) => ({ handle: e })), Object.keys(c).map((e) => ({ handle: e }))), d = new Set(Object.keys(c)), f = [];
+	let s = Object.fromEntries([...o.cases.map((e) => [e.output, !0]), ...o.defaultOutput == null ? [] : [[o.defaultOutput, !0]]]), c = Object.fromEntries([...r.cases.map((e) => [e.output, !0]), ...r.defaultOutput == null ? [] : [[r.defaultOutput, !0]]]), l = o.input.handle == r.input.handle ? void 0 : [o.input.handle, r.input.handle], u = Ms(Object.keys(s).map((e) => ({ handle: e })), Object.keys(c).map((e) => ({ handle: e }))), d = new Set(Object.keys(c)), f = [];
 	for (let e of a.edges) {
 		if (e.source != n || e.sourceHandle == null) continue;
 		let r = u != null && e.sourceHandle == u[0] ? u[1] : e.sourceHandle;
@@ -12570,11 +12586,11 @@ function ys(e, t, n, r) {
 				value: r
 			});
 		}
-		f.push(...js(s.inputs, a, t, e));
+		f.push(...Ns(s.inputs, a, t, e));
 	}
-	return O(e.revision.content, f);
+	return k(e.revision.content, f);
 }
-function bs(e, t, n, r) {
+function Ss(e, t, n, r) {
 	let a = e.node(t, n)?.node;
 	if (a?.kind != "value") return;
 	let o = r.map((e) => ({
@@ -12592,7 +12608,7 @@ function bs(e, t, n, r) {
 		value: o
 	}];
 }
-function xs(e, t, n, r) {
+function Cs(e, t, n, r) {
 	if (t.kind != "flow") return;
 	let a = e.graph(t), o = a?.nodes[n];
 	if (a == null || o?.kind != "wait") return;
@@ -12670,13 +12686,13 @@ function xs(e, t, n, r) {
 			}
 		});
 	}
-	return u.length == 0 ? [] : os(e, O(e.revision.content, u), o.notification?.taskId == r.notification?.taskId ? void 0 : o.notification?.taskId);
+	return u.length == 0 ? [] : cs(e, k(e.revision.content, u), o.notification?.taskId == r.notification?.taskId ? void 0 : o.notification?.taskId);
 }
-function Ss(e, t, n, r) {
-	let i = e.graph({ kind: "flow" })?.nodes[t], a = as(n);
-	if (i?.kind == "wait" && a != null) return os(e, [{
+function ws(e, t, n, r) {
+	let i = e.graph({ kind: "flow" })?.nodes[t], a = ss(n);
+	if (i?.kind == "wait" && a != null) return cs(e, [{
 		kind: "task.create",
-		task: is(n),
+		task: os(n),
 		taskId: r
 	}, {
 		before: {
@@ -12698,10 +12714,10 @@ function Ss(e, t, n, r) {
 		}
 	}], i.notification?.taskId);
 }
-function Cs(e, t, n, r) {
+function Ts(e, t, n, r) {
 	let i = e.graph(t)?.nodes[n];
 	if (i?.kind == "task") switch (r.kind) {
-		case "code": return i.task == null ? void 0 : Ms(e, t, n, {
+		case "code": return i.task == null ? void 0 : Ps(e, t, n, {
 			...i.task,
 			name: r.name
 		});
@@ -12734,33 +12750,33 @@ function Cs(e, t, n, r) {
 		}
 	}
 }
-function ws(e, t, n, r) {
+function Es(e, t, n, r) {
 	let a = e.node(t, n);
 	if (a?.kind != "task" || a.node.task == null || a.module == null || i(a.node.task.inputs, r.inputs) && i(a.node.task.outputs, r.outputs)) return;
-	let o = Ms(e, t, n, {
+	let o = Ps(e, t, n, {
 		...a.node.task,
 		...r
 	});
-	if (o != null) return O(e.revision.content, o);
+	if (o != null) return k(e.revision.content, o);
 }
-function Ts(e, t, n, r) {
+function Ds(e, t, n, r) {
 	let a = e.node(t, n);
 	if (a?.kind != "task" || a.node.task != null || a.definition == null) return;
 	let o = a.node;
 	if (i(o.additionalInputs ?? [], r)) return;
-	let s = As(o.additionalInputs ?? [], r), c = new Set(a.definition.inputs.flatMap((e) => "handle" in e ? [e.handle] : []).concat(r.map((e) => e.handle))), l = Object.assign({}, o.inputs);
+	let s = Ms(o.additionalInputs ?? [], r), c = new Set(a.definition.inputs.flatMap((e) => "handle" in e ? [e.handle] : []).concat(r.map((e) => e.handle))), l = Object.assign({}, o.inputs);
 	s != null && Object.hasOwn(l, s[0]) && (l[s[1]] = l[s[0]], delete l[s[0]]);
 	for (let e of Object.keys(l)) c.has(e) || delete l[e];
 	let u = r.length == 0 ? void 0 : r;
-	return O(e.revision.content, [{
+	return k(e.revision.content, [{
 		before: o.additionalInputs,
 		kind: "graph.node.additional-inputs.set",
 		nodeId: n,
 		target: t,
 		value: u
-	}, ...js(o.inputs, l, t, n)]);
+	}, ...Ns(o.inputs, l, t, n)]);
 }
-function Es(e, t, n, r) {
+function Os(e, t, n, r) {
 	let a = e.trigger(n);
 	if (a == null || a.kind != "webhook") return;
 	let o = {
@@ -12778,7 +12794,7 @@ function Es(e, t, n, r) {
 		value: s
 	}];
 }
-function Ds(e, t, n) {
+function ks(e, t, n) {
 	let r = e.subflow(t);
 	if (r == null) return;
 	let a = {
@@ -12793,11 +12809,11 @@ function Ds(e, t, n) {
 		subflowId: t
 	}];
 }
-function Os(e, t, n, r) {
+function As(e, t, n, r) {
 	return [{
 		kind: "graph.node.create",
 		node: {
-			inputs: ks(r),
+			inputs: js(r),
 			kind: "subflow",
 			subflowId: n
 		},
@@ -12805,17 +12821,17 @@ function Os(e, t, n, r) {
 		target: e
 	}];
 }
-function ks(e) {
+function js(e) {
 	return Object.fromEntries(e.flatMap((e) => "handle" in e && Object.hasOwn(e, "value") ? [[e.handle, {
 		kind: "value",
 		value: e.value
 	}]] : []));
 }
-function As(e, t) {
+function Ms(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 js(e, t, n, r) {
+function Ns(e, t, n, r) {
 	let a = /* @__PURE__ */ new Set([...Object.keys(e), ...Object.keys(t)]), o = [];
 	for (let s of a) i(e[s], t[s]) || o.push({
 		before: e[s],
@@ -12827,10 +12843,10 @@ function js(e, t, n, r) {
 	});
 	return o;
 }
-function Ms(e, t, n, r) {
+function Ps(e, t, n, r) {
 	let a = e.graph(t), o = a?.nodes[n];
 	if (a == null || o?.kind != "task" || o.task == null) return;
-	let s = As(o.task.inputs, r.inputs), c = As(o.task.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 = Ms(o.task.inputs, r.inputs), c = Ms(o.task.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 a.edges) {
 		if (e.source != n || e.sourceHandle == null) continue;
 		let r = c != null && e.sourceHandle == c[0] ? c[1] : e.sourceHandle;
@@ -12888,9 +12904,9 @@ function Ms(e, t, n, r) {
 				value: a
 			});
 		}
-		d.push(...js(f.inputs, a, t, e));
+		d.push(...Ns(f.inputs, a, t, e));
 	}
 	return d;
 }
 //#endregion
-export { At as $, Bo as A, xa as B, qo as C, ao as D, Vo as E, eo as F, an as G, pn as H, Qa as I, Xt as J, Pt as K, Ja as L, Ho as M, Ro as N, No as O, lo as P, Qt as Q, Ha as R, Es as S, Wo as T, sn as U, k as V, dn as W, $t as X, qt as Y, Zt as Z, Ds as _, ss as a, _t as at, bs as b, _s as c, vt as ct, ws as d, gt as dt, kt as et, ys as f, pt as ft, ps as g, me as gt, gs as h, b as ht, ds as i, Dt as it, zo as j, Uo as k, vs as l, bt as lt, hs as m, _e as mt, ns as n, wt as nt, us as o, Ct as ot, ms as p, ut as pt, rn as q, rs as r, Et as rt, fs as s, St as st, ls as t, Ot as tt, Ss as u, xt as ut, Cs as v, Ko as w, xs as x, Ts as y, Ra as z };
+export { At as $, Ho as A, Sa as B, Yo as C, oo as D, Uo as E, to as F, an as G, pn as H, $a as I, Xt as J, Pt as K, Ya as L, Wo as M, Bo as N, Fo as O, uo as P, Qt as Q, Ua as R, Os as S, Ko as T, sn as U, A as V, dn as W, $t as X, qt as Y, Zt as Z, ks as _, ls as a, _t as at, Ss as b, ys as c, vt as ct, Es as d, gt as dt, kt as et, xs as f, pt as ft, hs as g, he as gt, vs as h, b as ht, ps as i, Dt as it, Vo as j, Go as k, bs as l, bt as lt, _s as m, ve as mt, is as n, wt as nt, fs as o, Ct as ot, gs as p, ut as pt, rn as q, as as r, Et as rt, ms as s, St as st, ds as t, Ot as tt, ws as u, xt as ut, Ts as v, Jo as w, Cs as x, Ds as y, za as z };