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

package/dist/common/mcp.js

@@ -4561,23 +4561,38 @@ var qc = E(k([D({
 })]), al = A(M, il), ol = {
 	inputs: E(k([Qc, $c])),
 	outputs: E(k([Zc, $c]))
-}, sl = k([O({
-	kind: j("connector"),
-	action: M,
-	connectionId: M.optional(),
-	connections: E(O({
-		connectionId: M,
-		alias: M.optional()
-	}))
-}), O({
-	kind: j("connector"),
-	actionHints: E(M).optional(),
-	connectionHints: E(O({
+}, sl = k([
+	O({
+		kind: j("connector"),
 		action: M,
-		connectionId: M,
-		alias: M.optional()
-	})).optional()
-})]), cl = D({
+		connectionId: M.optional(),
+		connections: E(O({
+			connectionId: M,
+			alias: M.optional()
+		}))
+	}),
+	O({
+		kind: j("connector"),
+		mode: j("shared")
+	}),
+	O({
+		kind: j("connector"),
+		mode: j("independent"),
+		actions: E(O({
+			action: M,
+			connectionId: M.optional()
+		}))
+	}),
+	O({
+		kind: j("connector"),
+		actionHints: E(M).optional(),
+		connectionHints: E(O({
+			action: M,
+			connectionId: M,
+			alias: M.optional()
+		})).optional()
+	})
+]), cl = D({
 	...ol,
 	name: M,
 	moduleId: M,
@@ -4774,7 +4789,7 @@ var qc = E(k([D({
 	D({
 		...yl,
 		kind: j("poll"),
-		bindingId: M,
+		connectionId: M.min(1).optional(),
 		config: A(M, rl),
 		definition: D({
 			..._l,
@@ -4785,7 +4800,7 @@ var qc = E(k([D({
 	D({
 		...yl,
 		kind: j("integration"),
-		bindingId: M,
+		connectionId: M.min(1).optional(),
 		config: A(M, rl),
 		definition: D({
 			..._l,
@@ -4811,7 +4826,7 @@ var qc = E(k([D({
 	nodes: A(M, xl),
 	edges: E(Cl).default([])
 }), Dl = D({
-	kind: mc(["connection", "variable"]),
+	kind: j("variable"),
 	target: M
 }), Ol = D({
 	name: M,
@@ -4823,7 +4838,7 @@ var qc = E(k([D({
 	subflows: A(M, Tl.extend({ graph: El })),
 	tasks: A(M, dl)
 }), Al = D({
-	modelVersion: k([j(2), j(3)]),
+	modelVersion: k([j(2), j(4)]),
 	document: kl,
 	modules: A(M, Ol)
 });
@@ -4859,6 +4874,13 @@ var Ml = {
 	},
 	"graph.node.delete": wl,
 	"graph.node.field.set": k([
+		D({
+			...wl,
+			kind: j("graph.node.field.set"),
+			field: j("connectionId"),
+			before: M.min(1).optional(),
+			value: M.min(1).optional()
+		}),
 		D({
 			...wl,
 			kind: j("graph.node.field.set"),
@@ -5188,30 +5210,27 @@ function Wl(e) {
 }
 function Gl(e) {
 	let t = F(e);
-	if (L(t, [
+	L(t, [
 		"accessRevision",
 		"bindings",
-		..."nodeBindings" in t ? ["nodeBindings"] : [],
 		"mode",
-		"providerAccessDigest",
+		"sharedAccessDigest",
 		..."providerIds" in t ? ["providerIds"] : [],
 		..."discardedBindingCount" in t ? ["discardedBindingCount"] : [],
 		"version"
-	]), "nodeBindings" in t && !Array.isArray(t.nodeBindings)) return P();
-	let n = t.nodeBindings == null ? void 0 : t.nodeBindings.map((e) => Ul(e, !1));
-	if (n != null && new Set(n.map((e) => e.accessBindingId)).size != n.length) return P();
-	let r = R(t.accessRevision);
-	if (t.version != 1 || r < 0 || !Array.isArray(t.bindings) || "providerIds" in t && !Array.isArray(t.providerIds)) return P();
-	let i = t.providerIds == null ? void 0 : t.providerIds.map((e) => I(e));
-	if (i != null && new Set(i).size != i.length) return P();
-	let a = t.discardedBindingCount == null ? 0 : R(t.discardedBindingCount);
-	if (a < 0) return P();
-	let o = [];
+	]);
+	let n = R(t.accessRevision);
+	if (t.version != 1 || n < 0 || !Array.isArray(t.bindings) || "providerIds" in t && !Array.isArray(t.providerIds)) return P();
+	let r = t.providerIds == null ? void 0 : t.providerIds.map((e) => I(e));
+	if (r != null && new Set(r).size != r.length) return P();
+	let i = t.discardedBindingCount == null ? 0 : R(t.discardedBindingCount);
+	if (i < 0) return P();
+	let a = [];
 	for (let e of t.bindings) try {
-		o.push(Ul(e, !1));
+		a.push(Ul(e, !1));
 	} catch (t) {
 		if (!(t instanceof Ll) || t.code != "response.invalid") throw t;
-		typeof e == "object" && e && !Array.isArray(e) && typeof e.accessBindingId == "string" && e.accessBindingId.length > 0 && typeof e.providerId == "string" && e.providerId.length > 0 ? o.push({
+		typeof e == "object" && e && !Array.isArray(e) && typeof e.accessBindingId == "string" && e.accessBindingId.length > 0 && typeof e.providerId == "string" && e.providerId.length > 0 ? a.push({
 			accessBindingId: e.accessBindingId,
 			providerId: e.providerId,
 			connectionId: null,
@@ -5219,20 +5238,66 @@ function Gl(e) {
 			status: "invalid",
 			connectionDisplayName: typeof e.connectionDisplayName == "string" && e.connectionDisplayName.length > 0 ? e.connectionDisplayName : typeof e.displayName == "string" && e.displayName.length > 0 ? e.displayName : e.providerId,
 			permissionGroupName: typeof e.permissionGroupName == "string" ? e.permissionGroupName : null
-		}) : a++;
-	}
-	return new Set(o.map((e) => e.accessBindingId)).size == o.length ? {
-		accessRevision: r,
-		...n == null ? {} : { nodeBindings: n },
-		...a == 0 ? {} : { discardedBindingCount: a },
-		...i == null ? {} : { providerIds: i },
-		bindings: o,
+		}) : i++;
+	}
+	return new Set(a.map((e) => e.accessBindingId)).size == a.length ? {
+		accessRevision: n,
+		...i == 0 ? {} : { discardedBindingCount: i },
+		...r == null ? {} : { providerIds: r },
+		bindings: a,
 		mode: Wl(t.mode),
-		providerAccessDigest: I(t.providerAccessDigest),
+		sharedAccessDigest: I(t.sharedAccessDigest),
 		version: 1
 	} : P();
 }
-function Kl(e, t) {
+function Kl(e) {
+	if (!Array.isArray(e)) return P();
+	let t = e.map((e) => {
+		let t = F(e);
+		L(t, [
+			"accessBindingId",
+			"connectionId",
+			"providerId",
+			"source",
+			"connectionDisplayName",
+			..."permissionGroupName" in t ? ["permissionGroupName"] : []
+		]);
+		let n;
+		try {
+			n = Vl(t.source);
+		} catch {
+			return P();
+		}
+		return t.permissionGroupName != null && typeof t.permissionGroupName != "string" ? P() : {
+			accessBindingId: I(t.accessBindingId),
+			connectionId: I(t.connectionId),
+			providerId: I(t.providerId),
+			source: n,
+			connectionDisplayName: I(t.connectionDisplayName),
+			..."permissionGroupName" in t ? { permissionGroupName: t.permissionGroupName } : {}
+		};
+	});
+	return new Set(t.map((e) => e.accessBindingId)).size == t.length ? t : P();
+}
+function ql(e) {
+	let t = F(e);
+	if (L(t, [
+		"mode",
+		"sharedAccessDigest",
+		"sharedBindings",
+		"selectedBindings",
+		"version"
+	]), t.version != 2) return P();
+	let n = Wl(t.mode), r = Kl(t.sharedBindings), i = Kl(t.selectedBindings);
+	return n == "implicit" && (r.length > 0 || i.length > 0) ? P() : {
+		mode: n,
+		sharedAccessDigest: I(t.sharedAccessDigest),
+		sharedBindings: r,
+		selectedBindings: i,
+		version: 2
+	};
+}
+function Jl(e, t) {
 	let n = F(e);
 	if (L(n, [
 		"candidates",
@@ -5248,13 +5313,13 @@ function Kl(e, t) {
 		version: 1
 	};
 }
-function ql(e, t) {
+function Yl(e, t) {
 	let n = F(e);
 	if (L(n, ["results", "version"]), n.version != 1 || !Array.isArray(n.results)) return P();
 	let r = new Set(t), i = n.results.map((e) => {
 		let t = F(e), n = I(t.providerId);
 		if (!r.delete(n)) return P();
-		if (!Object.hasOwn(t, "error")) return Kl(t, n);
+		if (!Object.hasOwn(t, "error")) return Jl(t, n);
 		L(t, ["providerId", "error"]);
 		let i = F(t.error);
 		return L(i, ["code", "message"]), {
@@ -5270,7 +5335,7 @@ function ql(e, t) {
 		version: 1
 	} : P();
 }
-function Jl(e) {
+function Xl(e) {
 	let t = F(e);
 	if (L(t, [
 		...Object.hasOwn(t, "providerAccountId") ? ["providerAccountId"] : [],
@@ -5294,7 +5359,7 @@ function Jl(e) {
 		status: n
 	};
 }
-function Yl(e, t = !1) {
+function Zl(e, t = !1) {
 	let n = F(e), r = n.description, i = t && Object.hasOwn(n, "value");
 	return L(n, [
 		"jsonSchema",
@@ -5308,13 +5373,13 @@ function Yl(e, t = !1) {
 		...i ? { value: Rl(n.value) } : {}
 	};
 }
-function Xl(e) {
-	return Yl(e, !0);
+function Ql(e) {
+	return Zl(e, !0);
 }
-function Zl(e, t) {
+function $l(e, t) {
 	return Object.fromEntries(Object.entries(F(e)).map(([e, n]) => [e, t(n)]));
 }
-function Ql(e) {
+function eu(e) {
 	let t = F(e), n = t.homepageUrl, r = t.icon;
 	return L(t, [
 		"actionId",
@@ -5339,23 +5404,23 @@ function Ql(e) {
 		description: typeof t.description == "string" ? t.description : P(),
 		...n == null ? {} : { homepageUrl: n },
 		...r == null ? {} : { icon: r },
-		inputs: Zl(t.inputs, Xl),
+		inputs: $l(t.inputs, Ql),
 		name: I(t.name),
-		outputs: Zl(t.outputs, Yl),
+		outputs: $l(t.outputs, Zl),
 		serviceId: I(t.serviceId),
 		serviceName: I(t.serviceName)
 	};
 }
-function $l(e) {
-	let { defaultConnection: t, ...n } = F(e), r = Ql(n);
+function tu(e) {
+	let { defaultConnection: t, ...n } = F(e), r = eu(n);
 	if (t == null) return r;
-	let i = Jl(t);
+	let i = Xl(t);
 	return i.serviceId != r.serviceId || i.status != "active" ? P() : {
 		...r,
 		defaultConnection: i
 	};
 }
-function eu(e) {
+function nu(e) {
 	let t = F(e), n = t.homepageUrl, r = t.icon;
 	return t.noSetup !== void 0 && typeof t.noSetup != "boolean" || (L(t, [
 		...Object.hasOwn(t, "noSetup") ? ["noSetup"] : [],
@@ -5373,45 +5438,45 @@ function eu(e) {
 }
 //#endregion
 //#region src/json-schema-subset/utils.ts
-var tu = 0;
-function nu() {
-	let e = tu;
-	return tu += 1, e;
+var ru = 0;
+function iu() {
+	let e = ru;
+	return ru += 1, e;
 }
-function ru(e) {
+function au(e) {
 	if (typeof e == "object" && e && !Object.isFrozen(e)) {
-		for (let t of Object.getOwnPropertyNames(e)) ru(Reflect.get(e, t));
+		for (let t of Object.getOwnPropertyNames(e)) au(Reflect.get(e, t));
 		Object.freeze(e);
 	}
 	return e;
 }
-function iu(e, t) {
+function ou(e, t) {
 	let n = {};
 	for (let r of t) r in e && (n[r] = e[r]);
 	return n;
 }
-function au(e) {
+function su(e) {
 	if (typeof e != "object" || !e) return e;
 	if (Array.isArray(e)) {
 		let t = [];
-		for (let [n, r] of e.entries()) t[n] = au(r);
+		for (let [n, r] of e.entries()) t[n] = su(r);
 		return t;
 	}
 	{
 		let t = {};
-		for (let n in e) t[n] = au(e[n]);
+		for (let n in e) t[n] = su(e[n]);
 		return t;
 	}
 }
-function ou(e, t) {
+function cu(e, t) {
 	if (e === t) return !0;
 	if (typeof e != "object" || !e || typeof e != typeof t) return !1;
 	if (Array.isArray(e)) {
 		if (!Array.isArray(t) || e.length !== t.length) return !1;
-		for (let [n, r] of e.entries()) if (!ou(r, t[n])) return !1;
+		for (let [n, r] of e.entries()) if (!cu(r, t[n])) return !1;
 	} else {
 		if (Array.isArray(t)) return !1;
-		for (let n in e) if (!(n in t) || !ou(e[n], t[n])) return !1;
+		for (let n in e) if (!(n in t) || !cu(e[n], t[n])) return !1;
 		for (let n in t) if (!(n in e)) return !1;
 	}
 	return !0;
@@ -5424,48 +5489,48 @@ var z = Object.freeze({
 	ContainedBy: 2,
 	Rejection: 3,
 	Intersection: 4
-}), B = mu(z.Equals), V = mu(z.Containing), H = mu(z.ContainedBy), U = mu(z.Rejection), W = mu(z.Intersection), su = ru([
+}), B = gu(z.Equals), V = gu(z.Containing), H = gu(z.ContainedBy), U = gu(z.Rejection), W = gu(z.Intersection), lu = au([
 	[z.Equals, B],
 	[z.Containing, V],
 	[z.ContainedBy, H],
 	[z.Rejection, U],
 	[z.Intersection, W]
-]), cu = (() => {
+]), uu = (() => {
 	let e = 0;
-	for (let [t, n] of su) e |= n;
+	for (let [t, n] of lu) e |= n;
 	return e;
 })();
-function lu(e) {
+function du(e) {
 	return !!(e & B);
 }
-function uu(e) {
+function fu(e) {
 	return !!(e & V);
 }
-function du(e) {
+function pu(e) {
 	return !!(e & H);
 }
-function fu(e) {
+function mu(e) {
 	return !!(e & U);
 }
-function pu(e) {
+function hu(e) {
 	return !!(e & W);
 }
-function mu(e) {
+function gu(e) {
 	return 1 << e;
 }
 //#endregion
 //#region src/json-schema-subset/expression/combination.ts
-function hu(e) {
-	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : gu(t, r, e), n += 1, t) };
+function _u(e) {
+	let t = 0, n = 0, r = { push: (r) => (t = n === 0 ? r : vu(t, r, e), n += 1, t) };
 	return Object.defineProperties(r, {
 		result: { get: () => t },
 		count: { get: () => n }
 	}), r;
 }
-function gu(e, t, n) {
+function vu(e, t, n) {
 	let r = 0;
-	for (let [i, a] of su) if (a & e) {
-		for (let [e, a] of su) if (a & t && (r |= n(i, e), r === cu)) return r;
+	for (let [i, a] of lu) if (a & e) {
+		for (let [e, a] of lu) if (a & t && (r |= n(i, e), r === uu)) return r;
 	}
 	return r;
 }
@@ -5479,59 +5544,59 @@ var G = Object.freeze({
 	Not: 4,
 	Swap: 5
 });
-function _u(e, t) {
+function yu(e, t) {
 	switch (e) {
 		case G.Save: return t[0];
-		case G.OneOf: return yu(t);
+		case G.OneOf: return xu(t);
 		case G.AllOf:
-		case G.AnyOf: return bu(e, t);
+		case G.AnyOf: return Su(e, t);
 		case G.Not:
-		case G.Swap: return xu(e, t[0]);
+		case G.Swap: return Cu(e, t[0]);
 	}
 }
-function vu(e) {
-	return xu(G.Swap, e);
+function bu(e) {
+	return Cu(G.Swap, e);
 }
-function yu(e) {
+function xu(e) {
 	if (e.length === 1) return e[0];
-	let t = bu(G.AnyOf, e), n = [];
+	let t = Su(G.AnyOf, e), n = [];
 	for (let t = 0; t < e.length; ++t) for (let r = t + 1; r < e.length; ++r) {
-		let i = e[t], a = e[r], o = bu(G.AllOf, [i, a]);
+		let i = e[t], a = e[r], o = Su(G.AllOf, [i, a]);
 		n.push(o);
 	}
-	let r = bu(G.AnyOf, n), i = xu(G.Not, r);
-	return bu(G.AllOf, [t, i]);
+	let r = Su(G.AnyOf, n), i = Cu(G.Not, r);
+	return Su(G.AllOf, [t, i]);
 }
-function bu(e, t) {
+function Su(e, t) {
 	if (t.length < 0) throw Error("invalid expressions: empty array");
 	let n;
 	switch (e) {
 		case G.AllOf:
-			n = hu(Su);
+			n = _u(wu);
 			break;
 		case G.AnyOf:
-			n = hu(Cu);
+			n = _u(Tu);
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
 	for (let e of t) n.push(e);
 	return n.result;
 }
-function xu(e, t) {
+function Cu(e, t) {
 	let n, r = 0;
 	switch (e) {
 		case G.Not:
-			n = wu;
+			n = Eu;
 			break;
 		case G.Swap:
-			n = Tu;
+			n = Du;
 			break;
 		default: throw Error(`invalid operator ${e}`);
 	}
-	for (let [e, i] of su) i & t && (r |= n(e));
+	for (let [e, i] of lu) i & t && (r |= n(e));
 	return r;
 }
-function Su(e, t) {
+function wu(e, t) {
 	let n = 0;
 	switch (e) {
 		case z.Equals:
@@ -5620,7 +5685,7 @@ function Su(e, t) {
 	}
 	return n;
 }
-function Cu(e, t) {
+function Tu(e, t) {
 	let n = 0;
 	switch (e) {
 		case z.Equals:
@@ -5709,7 +5774,7 @@ function Cu(e, t) {
 	}
 	return n;
 }
-function wu(e) {
+function Eu(e) {
 	let t = 0;
 	switch (e) {
 		case z.Equals:
@@ -5728,7 +5793,7 @@ function wu(e) {
 	}
 	return t;
 }
-function Tu(e) {
+function Du(e) {
 	let t = 0;
 	switch (e) {
 		case z.Equals:
@@ -5749,13 +5814,13 @@ function Tu(e) {
 }
 //#endregion
 //#region src/json-schema-subset/expression/types.ts
-var Eu = Object.freeze({
+var Ou = Object.freeze({
 	Leaf: 0,
 	Not: 1,
 	AllOf: 2,
 	AnyOf: 3,
 	OneOf: 4
-}), Du = (e) => (t, n) => {
+}), ku = (e) => (t, n) => {
 	let r = {
 		parent: null,
 		swapped: !1,
@@ -5783,7 +5848,7 @@ var Eu = Object.freeze({
 		let n = B, [r, o] = t.expressions;
 		if (!e.equals(r, o)) {
 			let a = e.describe(r);
-			if (a.kind !== Eu.Leaf) {
+			if (a.kind !== Ou.Leaf) {
 				let [e, n] = s(a, !1);
 				t.expressions = null, t.calculation = e;
 				for (let [e, r] of n.entries()) i.push({
@@ -5798,7 +5863,7 @@ var Eu = Object.freeze({
 				return;
 			}
 			let c = e.describe(o);
-			if (c.kind !== Eu.Leaf) {
+			if (c.kind !== Ou.Leaf) {
 				let [e, n] = s(c, !0);
 				t.expressions = null, t.calculation = e;
 				for (let [e, a] of n.entries()) i.push({
@@ -5824,16 +5889,16 @@ var Eu = Object.freeze({
 	function s(e, t) {
 		let n = G.Save, r;
 		switch (e.kind) {
-			case Eu.Not:
+			case Ou.Not:
 				n = G.Not, r = [e.expression];
 				break;
-			case Eu.AllOf:
+			case Ou.AllOf:
 				n = G.AllOf, r = [...e.expressions];
 				break;
-			case Eu.AnyOf:
+			case Ou.AnyOf:
 				n = G.AnyOf, r = [...e.expressions];
 				break;
-			case Eu.OneOf:
+			case Ou.OneOf:
 				n = G.OneOf, r = [...e.expressions];
 				break;
 			default: throw Error(`invalid kind ${e.kind}`);
@@ -5846,8 +5911,8 @@ var Eu = Object.freeze({
 		}, r];
 	}
 	function c(e) {
-		let t = e.calculation, n = e.parent, r = _u(t.operator, t.results);
-		if (r === 0 && (r = H), t.willSwap && (r = vu(r)), n) {
+		let t = e.calculation, n = e.parent, r = yu(t.operator, t.results);
+		if (r === 0 && (r = H), t.willSwap && (r = bu(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);
 		}
@@ -5855,79 +5920,79 @@ var Eu = Object.freeze({
 	let l = r.calculation.results[0];
 	if (l === 0) throw Error("cannot find result of root");
 	return l;
-}, Ou = class extends Error {
+}, Au = class extends Error {
 	constructor(e = []) {
-		super(ju(e)), this.name = "SchemaError", this.items = e;
+		super(Nu(e)), this.name = "SchemaError", this.items = e;
 	}
-}, ku = Object.freeze({
+}, ju = Object.freeze({
 	Compiled: 0,
 	External: 1
 });
-function Au(e) {
+function Mu(e) {
 	switch (e.kind) {
-		case ku.Compiled: {
+		case ju.Compiled: {
 			let { message: t, path: n } = e;
 			return `${t} (at ${n.length > 0 ? n.join(".") : "$root"})`;
 		}
-		case ku.External: return String(e.error);
+		case ju.External: return String(e.error);
 	}
 }
-function ju(e) {
+function Nu(e) {
 	switch (e.length) {
 		case 0: return "without any items";
-		case 1: return Au(e[0]);
-		default: return `${Au(e[0])} ... omit the rest ${e.length - 1} items`;
+		case 1: return Mu(e[0]);
+		default: return `${Mu(e[0])} ... omit the rest ${e.length - 1} items`;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/compiler/common.ts
-var Mu = /* @__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 Nu(e) {
-	return Mu.has(e);
+var Pu = /* @__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 Fu(e) {
+	return Pu.has(e);
 }
-function Pu(e) {
-	for (let t in e) if (Nu(t)) return !1;
+function Iu(e) {
+	for (let t in e) if (Fu(t)) return !1;
 	return !0;
 }
-function Fu(e, ...t) {
+function Lu(e, ...t) {
 	return {
 		...e,
 		path: [...e.path, ...t]
 	};
 }
-function Iu(e) {
+function Ru(e) {
 	if (typeof e == "boolean") throw Error("JSONSchema7Definition cannot be boolean");
 	return e;
 }
-function Lu({ path: e, errors: t }, n, ...r) {
-	t.push(Ru(e, r, n));
+function zu({ path: e, errors: t }, n, ...r) {
+	t.push(Bu(e, r, n));
 }
 function K({ path: e, warns: t }, n, ...r) {
-	t.push(Ru(e, r, n));
+	t.push(Bu(e, r, n));
 }
-function Ru(e, t, n) {
+function Bu(e, t, n) {
 	return {
-		kind: ku.Compiled,
+		kind: ju.Compiled,
 		message: n,
 		path: [...e, ...t]
 	};
 }
 //#endregion
 //#region src/json-schema-subset/compiler/utils.ts
-function zu(e) {
+function Vu(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] : Bu(n) && delete e[t]);
+		n === void 0 ? delete e[t] : n && typeof n == "object" && (Array.isArray(n) ? n.length === 0 && delete e[t] : Hu(n) && delete e[t]);
 	}
 	return e;
 }
-function Bu(e) {
+function Hu(e) {
 	for (let t in e) return !1;
 	return !0;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/wrapper.ts
-var Vu = Symbol("compiledId"), Hu = Symbol("compiledKind"), Uu = Symbol("compiledPath"), Wu = Symbol("validatorLoader"), q = Object.freeze({
+var Uu = Symbol("compiledId"), Wu = Symbol("compiledKind"), Gu = Symbol("compiledPath"), Ku = Symbol("validatorLoader"), q = Object.freeze({
 	Extends: 0,
 	Never: 1,
 	Any: 2,
@@ -5940,62 +6005,62 @@ var Vu = Symbol("compiledId"), Hu = Symbol("compiledKind"), Uu = Symbol("compile
 	Not: 9,
 	Combination: 10,
 	EnumOrConst: 11
-}), Gu = ru($u(q.Any, nu(), {}, () => () => !0)), Ku = ru($u(q.Never, nu(), {
+}), qu = au(td(q.Any, iu(), {}, () => () => !0)), Ju = au(td(q.Never, iu(), {
 	type: "string",
 	maxLength: 0,
 	minLength: 1
 }, () => () => !1));
-function qu(e) {
-	return typeof e != "object" || !e ? !1 : Vu in e;
+function Yu(e) {
+	return typeof e != "object" || !e ? !1 : Uu in e;
 }
-function Ju(e) {
-	return typeof e != "object" || !e ? !1 : Vu in e && Hu in e;
+function Xu(e) {
+	return typeof e != "object" || !e ? !1 : Uu in e && Wu in e;
 }
 function J(e) {
-	return Ju(e) ? e[Hu] : q.Extends;
+	return Xu(e) ? e[Wu] : q.Extends;
 }
-function Yu(e) {
-	return Ju(e) || qu(e) ? e[Vu] : e.id;
+function Zu(e) {
+	return Xu(e) || Yu(e) ? e[Uu] : e.id;
 }
-function Xu(e) {
-	return Ju(e) ? e[Uu] : void 0;
+function Qu(e) {
+	return Xu(e) ? e[Gu] : void 0;
 }
-function Zu(e) {
-	return typeof e != "object" || !e || Object.defineProperty(e, Vu, {
-		value: nu(),
+function $u(e) {
+	return typeof e != "object" || !e || Object.defineProperty(e, Uu, {
+		value: iu(),
 		configurable: !1,
 		writable: !1,
 		enumerable: !1
 	}), e;
 }
 function Y(e, t, n, r = []) {
-	return $u(e, nu(), t, n && (() => n.compile(t)), r);
+	return td(e, iu(), t, n && (() => n.compile(t)), r);
 }
-function Qu(e) {
-	return $u(q.Never, nu(), { ...e }, e[Wu], e[Uu]);
+function ed(e) {
+	return td(q.Never, iu(), { ...e }, e[Ku], e[Gu]);
 }
-function $u(e, t, n, r, i = []) {
+function td(e, t, n, r, i = []) {
 	let a = null;
 	return Object.defineProperties(n, {
-		[Hu]: {
+		[Wu]: {
 			value: e,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Vu]: {
+		[Uu]: {
 			value: t,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Uu]: {
+		[Gu]: {
 			value: i,
 			configurable: !1,
 			writable: !1,
 			enumerable: !1
 		},
-		[Wu]: {
+		[Ku]: {
 			value: r,
 			configurable: !1,
 			writable: !1,
@@ -6012,16 +6077,16 @@ function $u(e, t, n, r, i = []) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/array.ts
-function ed(e, t) {
-	let n = td(e, t), r = nd(e, "maxItems", t), i = nd(e, "minItems", t), a = rd(e, t), o = t.uniqueItems, s;
-	if (Array.isArray(n) ? s = id(e, t) : t.additionalItems && K(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
+function nd(e, t) {
+	let n = rd(e, t), r = id(e, "maxItems", t), i = id(e, "minItems", t), a = ad(e, t), o = t.uniqueItems, s;
+	if (Array.isArray(n) ? s = od(e, t) : t.additionalItems && K(e, "it is needless when items is not array", "additionalItems"), !n || !a || s === null) return null;
 	let c = !1, l = !1;
 	if (Array.isArray(n)) {
-		r !== void 0 && r <= n.length && (n = n.splice(r), s = ad(s, e.delegate));
+		r !== void 0 && r <= n.length && (n = n.splice(r), s = sd(s, e.delegate));
 		let t = n.findIndex((e) => J(e) === q.Never);
-		t !== -1 && (n = n.splice(t), s = ad(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (K(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && J(s) === q.Never && (c = !0);
+		t !== -1 && (n = n.splice(t), s = sd(s, e.delegate), r === void 0 && (r = n.length, l = !0)), i !== void 0 && n.length < i && (K(e, `length(${n.length}) of items if less than minItems(${i})`), c = !0), n.length === 0 && s && J(s) === q.Never && (c = !0);
 	} else J(n) === q.Never && (c = !0);
-	return r !== void 0 && i !== void 0 && r < i && (l || K(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Y(c ? q.Never : q.Array, zu({
+	return r !== void 0 && i !== void 0 && r < i && (l || K(e, `maxItems(${r}) is less than minItems(${i})`), c = !0), Y(c ? q.Never : q.Array, Vu({
 		type: "array",
 		items: n,
 		contains: a,
@@ -6031,12 +6096,12 @@ function ed(e, t) {
 		additionalItems: s
 	}), e.delegate, e.path);
 }
-function td(e, { items: t }) {
+function rd(e, { items: t }) {
 	if (!t) return Y(q.Any, {}, e.delegate, e.path);
 	if (Array.isArray(t)) {
 		let n = [], r = !1;
 		for (let [i, a] of t.entries()) {
-			let t = zd(Fu(e, "items", i), Iu(a));
+			let t = Vd(Lu(e, "items", i), Ru(a));
 			if (!t) {
 				r = !0;
 				continue;
@@ -6045,9 +6110,9 @@ function td(e, { items: t }) {
 		}
 		return r ? null : n;
 	}
-	return zd(Fu(e, "items"), Iu(t));
+	return Vd(Lu(e, "items"), Ru(t));
 }
-function nd(e, t, n) {
+function id(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -6061,35 +6126,35 @@ function nd(e, t, n) {
 		return r;
 	}
 }
-function rd(e, { contains: t }) {
-	return t ? zd(Fu(e, "contains"), Iu(t)) : Y(q.Any, {}, e.delegate, e.path);
+function ad(e, { contains: t }) {
+	return t ? Vd(Lu(e, "contains"), Ru(t)) : Y(q.Any, {}, e.delegate, e.path);
 }
-function id(e, { additionalItems: t }) {
+function od(e, { additionalItems: t }) {
 	switch (typeof t) {
 		case "boolean": return t ? Y(q.Any, {}, e.delegate, e.path) : !1;
-		case "object": return zd(Fu(e, "additionalItems"), t);
+		case "object": return Vd(Lu(e, "additionalItems"), t);
 		default: return Y(q.Any, {}, e.delegate, e.path);
 	}
 }
-function ad(e, t) {
+function sd(e, t) {
 	return e === void 0 ? Y(q.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, t) : Ju(e) ? J(e) === q.Never ? e : Qu(e) : e;
+	}, t) : Xu(e) ? J(e) === q.Never ? e : ed(e) : e;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/combination.ts
-var od = Object.freeze([
+var cd = Object.freeze([
 	"allOf",
 	"anyOf",
 	"oneOf"
 ]);
-function sd(e, t, n, r) {
-	if (n.length === 0) return Lu(e, "disable empty list", t), null;
+function ld(e, t, n, r) {
+	if (n.length === 0) return zu(e, "disable empty list", t), null;
 	let i = [];
 	for (let [r, a] of n.entries()) {
-		let n = zd(Fu(e, t, r), Iu(a));
+		let n = Vd(Lu(e, t, r), Ru(a));
 		n && i.push(n);
 	}
 	if (i.length < n.length) return null;
@@ -6103,7 +6168,7 @@ function sd(e, t, n, r) {
 	let s = q.Combination;
 	switch (t) {
 		case "allOf":
-			o > 0 ? s = q.Never : a === i.length ? s = q.Any : cd(i) || (s = q.Never);
+			o > 0 ? s = q.Never : a === i.length ? s = q.Any : ud(i) || (s = q.Never);
 			break;
 		case "anyOf":
 			a > 0 ? s = q.Any : o === i.length && (s = q.Never);
@@ -6112,7 +6177,7 @@ function sd(e, t, n, r) {
 	}
 	return Y(s, { [t]: i }, r, e.path);
 }
-function cd(e) {
+function ud(e) {
 	let t = null;
 	for (let n of e) {
 		let e = J(n);
@@ -6127,35 +6192,35 @@ function cd(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/validator.ts
-var ld = Object.freeze({
+var dd = Object.freeze({
 	Valid: 0,
 	Invalid: 1,
 	Unknown: 2
 });
-function ud(e, t) {
+function fd(e, t) {
 	let n = e.isValid;
-	return n ? n(t) === !0 ? ld.Valid : ld.Invalid : ld.Unknown;
+	return n ? n(t) === !0 ? dd.Valid : dd.Invalid : dd.Unknown;
 }
 //#endregion
 //#region src/json-schema-subset/compiler/enumAndConst.ts
-function dd(e, t, n, r) {
+function pd(e, t, n, r) {
 	let i, a = !1;
 	if (t) {
-		if (t.length === 0) return Lu(e, "disable empty list", "enum"), null;
+		if (t.length === 0) return zu(e, "disable empty list", "enum"), null;
 		i = [];
-		for (let [n, a] of t.entries()) switch (ud(r, a)) {
-			case ld.Valid:
-				i.push(Zu(a));
+		for (let [n, a] of t.entries()) switch (fd(r, a)) {
+			case dd.Valid:
+				i.push($u(a));
 				break;
-			case ld.Invalid: K(e, "cannot pass JSON schema of currently schema object", "enum", n);
+			case dd.Invalid: K(e, "cannot pass JSON schema of currently schema object", "enum", n);
 		}
 		i.length === 0 && K(e, "all of elements from list is rejected by currently schema object", "enum");
 	}
-	if (n && ud(r, n) === ld.Invalid && (a = !0), i) {
+	if (n && fd(r, n) === dd.Invalid && (a = !0), i) {
 		if (i.length === 0) a = !0;
 		else if (n) {
 			let e = !1;
-			for (let t of i) if (ou(t, n)) {
+			for (let t of i) if (cu(t, n)) {
 				e = !0;
 				break;
 			}
@@ -6163,11 +6228,11 @@ function dd(e, t, n, r) {
 		}
 	}
 	let o = a ? q.Never : q.EnumOrConst, s = {};
-	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = Zu(au(n))), Y(o, s, e.delegate, e.path);
+	return r.type && (s.type = r.type), i && (s.enum = i), n && (s.const = $u(su(n))), Y(o, s, e.delegate, e.path);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/object.ts
-var fd = /* @__PURE__ */ new Set([
+var md = /* @__PURE__ */ new Set([
 	"type",
 	"maxProperties",
 	"minProperties",
@@ -6178,27 +6243,27 @@ var fd = /* @__PURE__ */ new Set([
 	"dependencies",
 	"propertyNames"
 ]);
-function pd(e, t) {
-	let n = Object.keys(t).filter((e) => !fd.has(e) && Nu(e));
+function hd(e, t) {
+	let n = Object.keys(t).filter((e) => !md.has(e) && Fu(e));
 	n.length > 0 && K(e, `type="object" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = md(e, "maxProperties", t), i = md(e, "minProperties", t), a = hd(e, t), o = gd(e, t), s = _d(e, t), c = yd(e, t);
+	let r = gd(e, "maxProperties", t), i = gd(e, "minProperties", t), a = _d(e, t), o = vd(e, t), s = yd(e, t), c = xd(e, t);
 	if (!a || !o || !s || !c) return null;
-	let l = vd(e, o, s, t);
+	let l = bd(e, o, s, t);
 	if (!l) return null;
-	let u = xd(e, bd(a, o, s, l), c, t);
-	return Y(Sd(e, a, l, u, r, i) ? q.Never : q.Object, zu({
+	let u = Cd(e, Sd(a, o, s, l), c, t);
+	return Y(wd(e, a, l, u, r, i) ? q.Never : q.Object, Vu({
 		type: "object",
 		required: u,
 		properties: l,
 		minProperties: i,
 		maxProperties: r,
 		additionalProperties: a,
-		patternProperties: Dd(o),
-		dependencies: Od(c, t),
+		patternProperties: kd(o),
+		dependencies: Ad(c, t),
 		propertyNames: s
 	}), e.delegate, e.path);
 }
-function md(e, t, n) {
+function gd(e, t, n) {
 	let r = n[t];
 	if (r !== void 0) {
 		if (Number.isNaN(r)) {
@@ -6212,22 +6277,22 @@ function md(e, t, n) {
 		return r;
 	}
 }
-function hd(e, { additionalProperties: t }) {
+function _d(e, { additionalProperties: t }) {
 	return t === !1 ? Y(q.Never, {
 		type: "string",
 		maxLength: 0,
 		minLength: 1
-	}, e.delegate, e.path) : typeof t == "object" ? zd(Fu(e, "additionalProperties"), Iu(t)) : Y(q.Any, {}, e.delegate, e.path);
+	}, e.delegate, e.path) : typeof t == "object" ? Vd(Lu(e, "additionalProperties"), Ru(t)) : Y(q.Any, {}, e.delegate, e.path);
 }
-function gd(e, { patternProperties: t }) {
+function vd(e, { patternProperties: t }) {
 	let n = !1, r = {};
 	for (let i in t) {
-		let a = Ed(i);
+		let a = Od(i);
 		if (a instanceof Error) {
 			K(e, `property name invalid. ${i}`, "patternProperties", i);
 			continue;
 		}
-		let o = Iu(t[i]), s = zd(Fu(e, "patternProperties", i), o);
+		let o = Ru(t[i]), s = Vd(Lu(e, "patternProperties", i), o);
 		if (!s) {
 			n = !0;
 			continue;
@@ -6236,29 +6301,29 @@ function gd(e, { patternProperties: t }) {
 	}
 	return n ? null : r;
 }
-function _d(e, { propertyNames: t }) {
+function yd(e, { propertyNames: t }) {
 	if (!t) return Y(q.Any, {}, e.delegate, e.path);
-	t = Iu(t);
-	let n = zd(Fu(e, "propertyNames"), t);
+	t = Ru(t);
+	let n = Vd(Lu(e, "propertyNames"), t);
 	if (!n) return null;
 	let r = J(n);
-	return r !== q.String && r !== q.Any ? Qu(n) : n;
+	return r !== q.String && r !== q.Any ? ed(n) : n;
 }
-function vd(e, t, n, { properties: r }) {
+function bd(e, t, n, { properties: r }) {
 	let i = !1;
 	if (!r) return {};
 	let a = {};
 	for (let o in r) {
-		if (ud(n, o) === ld.Invalid) {
+		if (fd(n, o) === dd.Invalid) {
 			K(e, `key ${JSON.stringify(o)} cannot pass JSON schema from propertyNames`, "properties");
 			continue;
 		}
-		let s = Td(t, o);
+		let s = Dd(t, o);
 		if (s && J(s) === q.Never) {
 			K(e, `key ${JSON.stringify(o)} matches a pattern that has a impossible(never) schema`, "properties");
 			continue;
 		}
-		let c = Iu(r[o]), l = zd(Fu(e, "properties", o), c);
+		let c = Ru(r[o]), l = Vd(Lu(e, "properties", o), c);
 		if (!l) {
 			i = !0;
 			continue;
@@ -6267,40 +6332,40 @@ function vd(e, t, n, { properties: r }) {
 	}
 	return i ? null : a;
 }
-function yd(e, { dependencies: t }) {
+function xd(e, { dependencies: t }) {
 	if (!t) return [{}, {}];
 	let n = {}, r = {};
 	for (let i in t) {
-		let a = Iu(t[i]);
+		let a = Ru(t[i]);
 		if (Array.isArray(a)) {
-			let { keys: t, duplicated: r } = wd(a);
+			let { keys: t, duplicated: r } = Ed(a);
 			r && K(e, `found duplicated property names: ${r.join(", ")}`, "dependencies", i), n[i] = t;
 		} else {
-			let t = zd(Fu(e, "dependencies", i), a);
+			let t = Vd(Lu(e, "dependencies", i), a);
 			if (t) {
 				let e = J(t);
-				r[i] = e === q.Object || e === q.Any ? t : e === q.Extends ? Ku : Qu(t);
+				r[i] = e === q.Object || e === q.Any ? t : e === q.Extends ? Ju : ed(t);
 			}
 		}
 	}
 	return [n, r];
 }
-function bd(e, t, n, r) {
+function Sd(e, t, n, r) {
 	return (i) => {
-		if (ud(n, i) === ld.Invalid) return !0;
-		let a = Td(t, i);
+		if (fd(n, i) === dd.Invalid) return !0;
+		let a = Dd(t, i);
 		return !!(a && J(a) === q.Never || J(r[i] ?? e) === q.Never);
 	};
 }
-function xd(e, t, n, { required: r }) {
+function Cd(e, t, n, { required: r }) {
 	if (!r) return [];
-	let i = wd(r);
+	let i = Ed(r);
 	i.duplicated && K(e, `found duplicated required keys: ${i.duplicated.join(", ")}`, "required");
 	let a = [], o = [];
-	for (let e of i.keys) Cd(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
+	for (let e of i.keys) Td(n, e).some((e) => t(e)) ? o.push(e) : a.push(e);
 	return o.length > 0 && K(e, `key ${o.map((e) => JSON.stringify(e)).join(", ")} will ban by another condition`, "required"), a;
 }
-function Sd(e, t, n, r, i, a) {
+function wd(e, t, n, r, i, a) {
 	if (i !== void 0 && a !== void 0 && i < a) return K(e, `maxProperties(${i}) is less than minProperties(${a})`), !0;
 	if (i !== void 0 && r.length > i) return K(e, `length(${r.length}) of required is greater than maxProperties(${i})`), !0;
 	if (a !== void 0 && r.length < a) return K(e, `length(${r.length}) of required is less than minProperties(${a})`), !0;
@@ -6311,7 +6376,7 @@ function Sd(e, t, n, r, i, a) {
 	}
 	return !0;
 }
-function Cd([e, t], n) {
+function Td([e, t], n) {
 	let r = [n], i = new Set(r);
 	for (; r.length > 0;) {
 		let n = r.pop(), i = t[n], o = e[n];
@@ -6322,7 +6387,7 @@ function Cd([e, t], n) {
 	}
 	return [...i];
 }
-function wd(e) {
+function Ed(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 ? {
@@ -6333,14 +6398,14 @@ function wd(e) {
 		duplicated: [...n]
 	};
 }
-function Td(e, t) {
+function Dd(e, t) {
 	for (let n in e) {
 		let [r, i] = e[n];
 		if (i.test(t)) return r;
 	}
 	return null;
 }
-function Ed(e) {
+function Od(e) {
 	try {
 		return new RegExp(e, "i");
 	} catch (e) {
@@ -6348,12 +6413,12 @@ function Ed(e) {
 		throw e;
 	}
 }
-function Dd(e) {
+function kd(e) {
 	let t = {};
 	for (let n in e) t[n] = e[n][0];
 	return t;
 }
-function Od([e, t], { dependencies: n }) {
+function Ad([e, t], { dependencies: n }) {
 	let r = {};
 	for (let i in n) {
 		let n = e[i], a = t[i];
@@ -6363,39 +6428,39 @@ function Od([e, t], { dependencies: n }) {
 }
 //#endregion
 //#region src/json-schema-subset/compiler/primitive.ts
-var kd = /* @__PURE__ */ new Set([
+var jd = /* @__PURE__ */ new Set([
 	"type",
 	"multipleOf",
 	"maximum",
 	"exclusiveMaximum",
 	"minimum",
 	"exclusiveMinimum"
-]), Ad = /* @__PURE__ */ new Set([
+]), Md = /* @__PURE__ */ new Set([
 	"type",
 	"format",
 	"maxLength",
 	"minLength",
 	"pattern"
 ]);
-function jd(e, t) {
+function Nd(e, t) {
 	let { type: n } = t;
 	switch (n) {
 		case "number":
-		case "integer": return Md(e, t);
-		case "string": return Pd(e, t);
+		case "integer": return Pd(e, t);
+		case "string": return Id(e, t);
 		case "boolean":
 		case "null": {
-			let r = Object.keys(t).filter((e) => Nu(e) && e !== "type");
+			let r = Object.keys(t).filter((e) => Fu(e) && e !== "type");
 			return r.length > 0 && K(e, `key "type" will exclude other keys: ${r.toSorted().join(", ")}`), Y(n === "null" ? q.Null : q.Boolean, { type: n }, e.delegate, e.path);
 		}
-		default: return Lu(e, `invalid type ${JSON.stringify(n)}`), null;
+		default: return zu(e, `invalid type ${JSON.stringify(n)}`), null;
 	}
 }
-function Md(e, t) {
-	let n = Object.keys(t).filter((e) => !kd.has(e) && Nu(e));
+function Pd(e, t) {
+	let n = Object.keys(t).filter((e) => !jd.has(e) && Fu(e));
 	n.length > 0 && K(e, `type=${JSON.stringify(t.type)} will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = iu(t, kd);
-	for (let t of kd) {
+	let r = ou(t, jd);
+	for (let t of jd) {
 		let n = r[t];
 		t !== "type" && n !== void 0 && Number.isNaN(n) && (K(e, "found NaN", t), delete r[t]);
 	}
@@ -6404,38 +6469,38 @@ function Md(e, t) {
 	let { multipleOf: c } = r;
 	c === 0 && (delete r.multipleOf, r.type = "number", K(e, "cannot be 0", "multipleOf"));
 	let l = q.Numeric;
-	return Nd(r) || (l = q.Never), Y(l, r, e.delegate, e.path);
+	return Fd(r) || (l = q.Never), Y(l, r, e.delegate, e.path);
 }
-function Nd(e) {
+function Fd(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 Pd(e, t) {
-	let n = Object.keys(t).filter((e) => !Ad.has(e) && Nu(e));
+function Id(e, t) {
+	let n = Object.keys(t).filter((e) => !Md.has(e) && Fu(e));
 	n.length > 0 && K(e, `type="string" will exclude other keys: ${n.toSorted().join(", ")}`);
-	let r = iu(t, Ad);
-	Fd(e, r, "maxLength"), Fd(e, r, "minLength");
+	let r = ou(t, Md);
+	Ld(e, r, "maxLength"), Ld(e, r, "minLength");
 	let i = r.maxLength, a = r.minLength, o = q.String;
 	return i !== void 0 && (i < 0 || i !== void 0 && a !== void 0 && i < a) && (o = q.Never), Y(o, r, e.delegate, e.path);
 }
-function Fd(e, t, n) {
+function Ld(e, t, n) {
 	let r = t[n];
 	r !== void 0 && Number.isNaN(r) && (K(e, "found NaN", n), delete t[n]);
 }
 //#endregion
 //#region src/json-schema-subset/compiler/compiler.ts
-var Id = Object.freeze([]);
-function Ld(e, t, n, r) {
-	if (Ju(e) || t.isExtendsSchema(e)) return {
+var Rd = Object.freeze([]);
+function zd(e, t, n, r) {
+	if (Xu(e) || t.isExtendsSchema(e)) return {
 		schema: e,
-		warns: Id
+		warns: Rd
 	};
 	if (r) {
 		let t = r.isSchema(e);
 		if (typeof t == "object") {
 			let e = [];
 			for (let n of t) e.push({
-				kind: ku.External,
+				kind: ju.External,
 				error: n
 			});
 			if (e.length > 0) return e;
@@ -6448,19 +6513,19 @@ function Ld(e, t, n, r) {
 		path: [],
 		errors: [],
 		warns: []
-	}, a = zd(i, e);
-	if (a) Rd(i.errors.length === 0, "found errors (it should be empty)");
-	else return Rd(i.errors.length > 0, "cannot found any errors"), i.errors;
+	}, a = Vd(i, e);
+	if (a) Bd(i.errors.length === 0, "found errors (it should be empty)");
+	else return Bd(i.errors.length > 0, "cannot found any errors"), i.errors;
 	return {
 		schema: a,
 		warns: i.warns
 	};
 }
-function Rd(e, t) {
+function Bd(e, t) {
 	if (!e) throw Error(t);
 }
-function zd(e, t) {
-	if (e.extends.isExtendsSchema(t) || Ju(t)) return t;
+function Vd(e, t) {
+	if (e.extends.isExtendsSchema(t) || Xu(t)) return t;
 	let n = e.extends.tryCompiledExtendsSchema(t, e.payload);
 	if (n) return n;
 	let r = t, i = !1, { enum: a, const: o } = t;
@@ -6468,23 +6533,23 @@ function zd(e, t) {
 		let { enum: e, const: n, ...a } = t;
 		r = a, i = !0;
 	}
-	let s = Bd(e, r);
-	return s && i && (s = dd(e, a, o, s)), s || null;
+	let s = Hd(e, r);
+	return s && i && (s = pd(e, a, o, s)), s || null;
 }
-function Bd(e, t) {
-	for (let n of od) {
+function Hd(e, t) {
+	for (let n of cd) {
 		let r = t[n];
 		if (r) {
-			let i = Object.keys(t).filter((e) => Nu(e) && e !== n);
-			return i.length > 0 && K(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), sd(e, n, r) || null;
+			let i = Object.keys(t).filter((e) => Fu(e) && e !== n);
+			return i.length > 0 && K(e, `composition key ${JSON.stringify(n)} will exclude other keys: ${i.toSorted().join(", ")}`), ld(e, n, r) || null;
 		}
 	}
 	{
-		let n = Iu(t.not);
+		let n = Ru(t.not);
 		if (n) {
-			let r = Object.keys(t).filter((e) => Nu(e) && e !== "not");
+			let r = Object.keys(t).filter((e) => Fu(e) && e !== "not");
 			r.length > 0 && K(e, `key "not" will exclude other keys: ${r.toSorted().join(", ")}`);
-			let i = zd(Fu(e, "not"), n);
+			let i = Vd(Lu(e, "not"), n);
 			if (!i) return null;
 			let a = q.Not;
 			switch (J(i)) {
@@ -6500,26 +6565,26 @@ function Bd(e, t) {
 		let { type: n } = t;
 		if (Array.isArray(n)) {
 			let { type: r, ...i } = t;
-			return sd(e, "anyOf", n.map((e) => ({
+			return ld(e, "anyOf", n.map((e) => ({
 				...i,
 				type: e
 			})));
 		}
 		switch (n) {
-			case "object": return pd(e, t);
-			case "array": return ed(e, t);
-			default: return jd(e, t);
+			case "object": return hd(e, t);
+			case "array": return nd(e, t);
+			default: return Nd(e, t);
 		}
 	}
-	return Pu(t) ? Y(q.Any, {}, e.delegate, e.path) : (Lu(e, "unrecognized"), null);
+	return Iu(t) ? Y(q.Any, {}, e.delegate, e.path) : (zu(e, "unrecognized"), null);
 }
 //#endregion
 //#region src/json-schema-subset/checker/tools/mark.ts
-var Vd = class {
+var Ud = 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 Hd {
+		this.keys = t, this.clazz = class extends Wd {
 			constructor(e) {
 				super(t, e);
 			}
@@ -6543,7 +6608,7 @@ var Vd = class {
 		else if (e) for (let [n, r] of this.keys.entries()) e[r] && (t |= 1 << n);
 		return new this.clazz(t);
 	}
-}, Hd = class {
+}, Wd = class {
 	constructor(e, t) {
 		this.keys = e, this.int32 = t;
 	}
@@ -6558,21 +6623,21 @@ var Vd = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/quantum.ts
-function Ud(e) {
-	return new Wd(e);
+function Gd(e) {
+	return new Kd(e);
 }
-var Wd = class {
+var Kd = class {
 	constructor(e) {
-		this.description = new Vd(e);
+		this.description = new Ud(e);
 	}
 	get keys() {
 		return this.description.keys;
 	}
 	variable(e) {
 		let t;
-		return e && (t = this.description.toBundle(e).toInt32()), new Gd(this.description, t);
+		return e && (t = this.description.toBundle(e).toInt32()), new qd(this.description, t);
 	}
-}, Gd = class {
+}, qd = class {
 	constructor(e, t) {
 		this.values = /* @__PURE__ */ new Set(), this.description = e, t !== void 0 && this.values.add(t);
 	}
@@ -6593,7 +6658,7 @@ var Wd = class {
 	}
 	push(e, t) {
 		let n = /* @__PURE__ */ new Set();
-		for (let r of this.values) for (let [i, a] of su) if (e & a) {
+		for (let r of this.values) for (let [i, a] of lu) if (e & a) {
 			let e = this.description.toBundle(r);
 			t(i, e), n.add(e.toInt32());
 		}
@@ -6610,11 +6675,11 @@ var Wd = class {
 };
 //#endregion
 //#region src/json-schema-subset/checker/tools/range.ts
-function Kd(e, t) {
+function Jd(e, t) {
 	let [n] = e, [r] = t;
-	return n.num < r.num ? qd(e, t) : n.num > r.num ? Jd(e, t) : Yd(e, t);
+	return n.num < r.num ? Yd(e, t) : n.num > r.num ? Xd(e, t) : Zd(e, t);
 }
-function qd(e, t) {
+function Yd(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (r.num <= i.num) {
 		let n = r.exclusive, a = i.exclusive;
@@ -6639,11 +6704,11 @@ function qd(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [Xd(r), a]
+				range: [Qd(r), a]
 			}), {
 				left: {
 					fromLeft: !0,
-					range: [n, Xd(i)]
+					range: [n, Qd(i)]
 				},
 				center: [i, r],
 				right: t
@@ -6653,16 +6718,16 @@ function qd(e, t) {
 	return {
 		left: {
 			fromLeft: !0,
-			range: [n, Xd(i)]
+			range: [n, Qd(i)]
 		},
 		center: [i, a],
 		right: {
 			fromLeft: !0,
-			range: [Xd(a), r]
+			range: [Qd(a), r]
 		}
 	};
 }
-function Jd(e, t) {
+function Xd(e, t) {
 	let [n, r] = e, [i, a] = t;
 	if (n.num >= a.num) {
 		let r = a.exclusive, i = n.exclusive;
@@ -6687,11 +6752,11 @@ function Jd(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !0,
-				range: [Xd(a), r]
+				range: [Qd(a), r]
 			}), {
 				left: {
 					fromLeft: !1,
-					range: [i, Xd(n)]
+					range: [i, Qd(n)]
 				},
 				center: [n, a],
 				right: t
@@ -6701,23 +6766,23 @@ function Jd(e, t) {
 	return {
 		left: {
 			fromLeft: !1,
-			range: [i, Xd(n)]
+			range: [i, Qd(n)]
 		},
 		center: [n, r],
 		right: {
 			fromLeft: !1,
-			range: [Xd(r), a]
+			range: [Qd(r), a]
 		}
 	};
 }
-function Yd(e, t) {
+function Zd(e, t) {
 	let [n, r] = e, [i, a] = t, o = n.exclusive, s = i.exclusive, c, l = n;
 	if (!o && s ? (l = i, c = {
 		fromLeft: !0,
-		range: [n, Xd(i)]
+		range: [n, Qd(i)]
 	}) : o && !s && (c = {
 		fromLeft: !1,
-		range: [i, Xd(n)]
+		range: [i, Qd(n)]
 	}), r.num <= a.num) {
 		let e = !0, t = !1;
 		if (r.num === a.num) {
@@ -6728,7 +6793,7 @@ function Yd(e, t) {
 			let t;
 			return e && (t = {
 				fromLeft: !1,
-				range: [Xd(r), a]
+				range: [Qd(r), a]
 			}), {
 				left: c,
 				center: [l, r],
@@ -6741,11 +6806,11 @@ function Yd(e, t) {
 		center: [l, a],
 		right: {
 			fromLeft: !0,
-			range: [Xd(a), r]
+			range: [Qd(a), r]
 		}
 	};
 }
-function Xd(e) {
+function Qd(e) {
 	return {
 		num: e.num,
 		exclusive: !e.exclusive
@@ -6753,8 +6818,8 @@ function Xd(e) {
 }
 //#endregion
 //#region src/json-schema-subset/checker/range.ts
-var Zd = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
-	let { left: a, center: o, right: s } = Kd([{
+var $d = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
+	let { left: a, center: o, right: s } = Jd([{
 		num: t,
 		exclusive: !1
 	}, {
@@ -6784,24 +6849,24 @@ var Zd = (e) => (t = e, n = Infinity, r = e, i = Infinity) => {
 		intersection: u
 	};
 };
-function Qd({ left: e, right: t, intersection: n }) {
+function ef({ left: e, right: t, intersection: n }) {
 	if (!n) return z.Rejection;
 	let r = !1, i = !1;
 	return e && (e.isFrom1 ? r = !0 : i = !0), t && (t.isFrom1 ? r = !0 : i = !0), r && i ? z.Intersection : r ? z.Containing : i ? z.ContainedBy : z.Equals;
 }
 //#endregion
 //#region src/json-schema-subset/checker/array.ts
-var $d = Zd(0), ef = Ud([
+var tf = $d(0), nf = Gd([
 	"hasCommon",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection",
 	"hasCommonBroken"
 ]);
-function tf({ calculate: e }, t, n) {
-	let r = $d(t.minItems, t.maxItems, n.minItems, n.maxItems), i = Qd(r);
+function rf({ calculate: e }, t, n) {
+	let r = tf(t.minItems, t.maxItems, n.minItems, n.maxItems), i = ef(r);
 	if (i === z.Rejection) return U;
-	let [a, o] = nf(t), [s, c] = nf(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = ef.variable({}), f = Math.min(t.minItems ?? 0, n.minItems ?? 0);
+	let [a, o] = af(t), [s, c] = af(n), l = Math.max(a.length, s.length) + 1, u = Math.min(l, r.intersection.max), d = nf.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) => {
@@ -6841,69 +6906,69 @@ function tf({ calculate: e }, t, n) {
 	}
 	return p;
 }
-function nf({ items: e, additionalItems: t }) {
-	return Array.isArray(e) ? [e, t ?? Gu] : [[], e ?? Gu];
+function af({ items: e, additionalItems: t }) {
+	return Array.isArray(e) ? [e, t ?? qu] : [[], e ?? qu];
 }
 //#endregion
 //#region src/json-schema-subset/checker/cache.ts
-function rf(e) {
+function of(e) {
 	let t = /* @__PURE__ */ new Map();
 	return (n, r) => {
-		let i = qu(n);
-		return i === qu(r) ? i ? of(t, n, r, e) : n === r : !1;
+		let i = Yu(n);
+		return i === Yu(r) ? i ? cf(t, n, r, e) : n === r : !1;
 	};
 }
-function af(e) {
+function sf(e) {
 	let t = /* @__PURE__ */ new Map();
-	return (n, r) => of(t, n, r, e);
+	return (n, r) => cf(t, n, r, e);
 }
-function of(e, t, n, r) {
-	let i = `${Yu(t)}/${Yu(n)}`, a = e.get(i);
+function cf(e, t, n, r) {
+	let i = `${Zu(t)}/${Zu(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 sf(e, t, n) {
-	let r = lf(t), i = lf(n), a = !1, o = !1, s = !1;
-	for (let t of r) if (uf(e, i, t) ? s = !0 : a = !0, a && s) break;
-	for (let t of i) if (uf(e, r, t) ? s = !0 : o = !0, o && s) break;
+function lf(e, t, n) {
+	let r = df(t), i = df(n), a = !1, o = !1, s = !1;
+	for (let t of r) if (ff(e, i, t) ? s = !0 : a = !0, a && s) break;
+	for (let t of i) if (ff(e, r, t) ? s = !0 : o = !0, o && s) break;
 	return s ? a && o ? W : a ? V : o ? H : B : U;
 }
-function cf(e, t) {
+function uf(e, t) {
 	let n = !1, r = !1;
-	for (let i of lf(e)) {
-		switch (ud(t, i)) {
-			case ld.Valid:
+	for (let i of df(e)) {
+		switch (fd(t, i)) {
+			case dd.Valid:
 				n = !0;
 				break;
-			case ld.Invalid:
+			case dd.Invalid:
 				r = !0;
 				break;
-			case ld.Unknown: return cu;
+			case dd.Unknown: return uu;
 		}
 		if (n && r) break;
 	}
 	return n && r ? W : n ? B | H : r ? U : J(t) === q.Never ? B : H;
 }
-function lf({ const: e, enum: t }) {
+function df({ const: e, enum: t }) {
 	if (e !== void 0) return [e];
 	if (t) return t;
 	throw Error("invalid branch");
 }
-function uf({ isEquals: e }, t, n) {
+function ff({ 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 df(e) {
+function pf(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 = Yu(e), a = Yu(t);
+		let r = Zu(e), a = Zu(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;
@@ -6920,25 +6985,25 @@ function df(e) {
 		return !0;
 	}
 	function a(e, t) {
-		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : Ju(e) && Ju(t) ? r(e, t) : i(e, t);
+		return e === t ? !0 : typeof e != "object" || !e || typeof e != typeof t ? !1 : Xu(e) && Xu(t) ? r(e, t) : i(e, t);
 	}
 	return t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function ff(e) {
-	let t = yf(e), n = e.multipleOf ?? 1, r = mf(t, n);
+function mf(e) {
+	let t = xf(e), n = e.multipleOf ?? 1, r = gf(t, n);
 	return r ? {
 		multipleOf: n,
 		range: r
 	} : null;
 }
-function pf([e, t]) {
+function hf([e, t]) {
 	return !(e.num !== t.num || e.exclusive || t.exclusive);
 }
-function mf(e, t) {
+function gf(e, t) {
 	if (!e) return;
-	let [n, r] = e, i = hf(n.num, t), a = gf(r.num, t);
+	let [n, r] = e, i = _f(n.num, t), a = vf(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
@@ -6947,29 +7012,29 @@ function mf(e, t) {
 		exclusive: !1
 	}];
 }
-function hf(e, t) {
+function _f(e, t) {
 	return Math.ceil(e / t) * t;
 }
-function gf(e, t) {
+function vf(e, t) {
 	return Math.floor(e / t) * t;
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/float.ts
-function _f(e, t) {
-	let { left: n, right: r, center: i } = Kd(yf(e), yf(t));
+function yf(e, t) {
+	let { left: n, right: r, center: i } = Jd(xf(e), xf(t));
 	if (!i) return U;
 	let a = !1, o = !1;
 	return n && (n.fromLeft ? a = !0 : o = !0), r && (r.fromLeft ? a = !0 : o = !0), a && o ? W : a ? V : o ? H : B;
 }
-function vf(e, t) {
-	let n = yf(e), r = ff(t);
+function bf(e, t) {
+	let n = xf(e), r = mf(t);
 	if (!r) return V;
-	let i = Kd(n, r.range), a = mf(i.center, r.multipleOf), o = bf(i.left, r.multipleOf), s = bf(i.right, r.multipleOf);
+	let i = Jd(n, r.range), a = gf(i.center, r.multipleOf), o = Sf(i.left, r.multipleOf), s = Sf(i.right, r.multipleOf);
 	if (!i.center) return U;
 	let c = !1, l = !1;
-	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !pf(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? W : c ? V : l ? H : B;
+	return i.left?.fromLeft && (c = !0), i.right?.fromLeft && (c = !0), (!a || !hf(i.center)) && (c = !0), o && (l = !0), s && (l = !0), c && l ? W : c ? V : l ? H : B;
 }
-function yf(e) {
+function xf(e) {
 	let t, n;
 	return t = e.exclusiveMinimum === void 0 ? e.minimum === void 0 ? {
 		num: -Infinity,
@@ -6991,84 +7056,84 @@ function yf(e) {
 		exclusive: !0
 	}, [t, n];
 }
-function bf(e, t) {
-	if (e && !e.fromLeft) return mf(e.range, t);
+function Sf(e, t) {
+	if (e && !e.fromLeft) return gf(e.range, t);
 }
 //#endregion
 //#region src/json-schema-subset/checker/numeric/integer.ts
-function xf(e, t) {
-	let n = ff(e), r = ff(t);
+function Cf(e, t) {
+	let n = mf(e), r = mf(t);
 	if (!n && !r) return B;
 	if (!n) return H;
 	if (!r) return V;
-	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Kd(i, o), l, u = 0;
-	if (c.center && (u = Cf(a, s), l = mf(c.center, u)), !l) return U;
+	let { range: i, multipleOf: a } = n, { range: o, multipleOf: s } = r, c = Jd(i, o), l, u = 0;
+	if (c.center && (u = Tf(a, s), l = gf(c.center, u)), !l) return U;
 	let d = !1, f = !1, { left: p, right: ee } = c;
-	return p && mf(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), ee && mf(ee.range, ee.fromLeft ? a : s) && (ee.fromLeft ? d = !0 : f = !0), d ||= Sf(n, l, u), f ||= Sf(r, l, u), d && f ? W : d ? V : f ? H : B;
+	return p && gf(p.range, p.fromLeft ? a : s) && (p.fromLeft ? d = !0 : f = !0), ee && gf(ee.range, ee.fromLeft ? a : s) && (ee.fromLeft ? d = !0 : f = !0), d ||= wf(n, l, u), f ||= wf(r, l, u), d && f ? W : d ? V : f ? H : B;
 }
-function Sf({ range: e, multipleOf: t }, n, r) {
-	let i = Kd(e, n);
-	if (mf(i.left?.range, t) || mf(i.right?.range, t)) return !0;
-	let a = mf(i.center, t);
+function wf({ range: e, multipleOf: t }, n, r) {
+	let i = Jd(e, n);
+	if (gf(i.left?.range, t) || gf(i.right?.range, t)) return !0;
+	let a = gf(i.center, t);
 	if (!a) return !1;
-	let o = Tf(n);
-	return Tf(a) > o || o !== 1 && t < r;
+	let o = Df(n);
+	return Df(a) > o || o !== 1 && t < r;
 }
-function Cf(e, t) {
-	return e * t / wf(e, t);
+function Tf(e, t) {
+	return e * t / Ef(e, t);
 }
-function wf(e, t) {
-	return e === 0 ? t : wf(t % e, e);
+function Ef(e, t) {
+	return e === 0 ? t : Ef(t % e, e);
 }
-function Tf(e) {
+function Df(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 Ef(e, t) {
-	if (Df(e) || Df(t)) return cu;
-	let n = Of(e), r = Of(t);
-	return n && r ? _f(e, t) : n ? vf(e, t) : r ? vu(vf(t, e)) : xf(e, t);
+function Of(e, t) {
+	if (kf(e) || kf(t)) return uu;
+	let n = Af(e), r = Af(t);
+	return n && r ? yf(e, t) : n ? bf(e, t) : r ? bu(bf(t, e)) : Cf(e, t);
 }
-function Df(e) {
+function kf(e) {
 	let { multipleOf: t } = e;
 	return t === void 0 ? !1 : !Number.isInteger(t) || t < 0;
 }
-function Of(e) {
+function Af(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 kf = Zd(0), Af = Ud([
+var jf = $d(0), Mf = Gd([
 	"hasCommonInRequired",
 	"hasCommonOutRequired",
 	"hasExtra1",
 	"hasExtra2",
 	"hasRejection"
 ]);
-function jf(e, t, n) {
-	if (Mf(t, n)) return U;
-	let r = Nf(t, n);
+function Nf(e, t, n) {
+	if (Pf(t, n)) return U;
+	let r = Ff(t, n);
 	if (!r) return U;
-	let i = zf(t), a = zf(n), o = (t) => {
+	let i = Vf(t), a = Vf(n), o = (t) => {
 		let n = i(t), r = a(t);
-		return Bf(n, r) ? e.calculate(n, r) : 0;
-	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Af.variable({});
-	for (let e of [...s].toSorted()) u.push(o(e), Ff);
-	for (let e of [...c].toSorted()) u.push(o(e), If);
-	for (let e of [...l].toSorted()) u.push(o(e), Lf);
+		return Hf(n, r) ? e.calculate(n, r) : 0;
+	}, { commonRequired: s, extraRequired1: c, extraRequired2: l } = r, u = Mf.variable({});
+	for (let e of [...s].toSorted()) u.push(o(e), Lf);
+	for (let e of [...c].toSorted()) u.push(o(e), Rf);
+	for (let e of [...l].toSorted()) u.push(o(e), zf);
 	let { hasOptional1: d, hasOptional2: f } = r;
 	if (d || f) {
-		let r = Rf(d, f);
-		for (let e of [...Pf(t, n)].toSorted()) {
+		let r = Bf(d, f);
+		for (let e of [...If(t, n)].toSorted()) {
 			let t = o(e);
 			t !== 0 && u.push(t, r);
 		}
-		let i = t.additionalProperties ?? Gu, a = n.additionalProperties ?? Gu;
-		if (Bf(i, a)) {
+		let i = t.additionalProperties ?? qu, a = n.additionalProperties ?? qu;
+		if (Hf(i, a)) {
 			let t = e.calculate(i, a);
 			u.push(t, r);
 		}
@@ -7080,10 +7145,10 @@ function jf(e, t, n) {
 	for (let { hasExtra1: e, hasExtra2: t, hasCommonInRequired: n, hasCommonOutRequired: r, hasRejection: i } of u) ee |= !n && p > 0 || !r && p === 0 || i ? U : e && t ? W : e ? V : t ? H : B;
 	return ee;
 }
-function Mf(e, t) {
-	return Qd(kf(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === z.Rejection;
+function Pf(e, t) {
+	return ef(jf(e.minProperties, e.maxProperties, t.minProperties, t.maxProperties)) === z.Rejection;
 }
-function Nf(e, t) {
+function Ff(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);
@@ -7099,7 +7164,7 @@ function Nf(e, t) {
 		hasOptional2: u > s
 	};
 }
-function Pf(e, t) {
+function If(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);
@@ -7107,7 +7172,7 @@ function Pf(e, t) {
 	if (o) for (let e of o) n.delete(e);
 	return n;
 }
-var Ff = (e, t) => {
+var Lf = (e, t) => {
 	switch (e) {
 		case z.Equals:
 			t.hasCommonInRequired = !0;
@@ -7123,7 +7188,7 @@ var Ff = (e, t) => {
 			break;
 		case z.Rejection: t.hasRejection = !0;
 	}
-}, If = (e, t) => {
+}, Rf = (e, t) => {
 	switch (e) {
 		case z.Equals:
 		case z.ContainedBy:
@@ -7135,7 +7200,7 @@ var Ff = (e, t) => {
 			break;
 		case z.Rejection: t.hasRejection = !0;
 	}
-}, Lf = (e, t) => {
+}, zf = (e, t) => {
 	switch (e) {
 		case z.Equals:
 		case z.Containing:
@@ -7147,7 +7212,7 @@ var Ff = (e, t) => {
 			break;
 		case z.Rejection: t.hasRejection = !0;
 	}
-}, Rf = (e, t) => (n, r) => {
+}, Bf = (e, t) => (n, r) => {
 	if (r.hasRejection) return;
 	let i = !1, a = !1, o = !1;
 	switch (n) {
@@ -7167,7 +7232,7 @@ var Ff = (e, t) => {
 	}
 	e && i && (r.hasExtra1 = !0), t && a && (r.hasExtra2 = !0), e && t && o && (r.hasCommonOutRequired = !0);
 };
-function zf(e) {
+function Vf(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");
@@ -7177,41 +7242,41 @@ function zf(e) {
 		});
 	}
 	return (e) => {
-		if (n && ud(n, e) === ld.Invalid) return Ku;
+		if (n && fd(n, e) === dd.Invalid) return Ju;
 		for (let { pattern: t, schema: n } of i) if (t.test(e)) return n;
-		return ((t && t[e]) ?? r) || Gu;
+		return ((t && t[e]) ?? r) || qu;
 	};
 }
-function Bf(e, t) {
+function Hf(e, t) {
 	let n = J(e), r = J(t);
 	return n !== q.Never || r !== q.Never;
 }
 //#endregion
 //#region src/json-schema-subset/checker/string.ts
-var Vf = Zd(0);
-function Hf(e, t) {
+var Uf = $d(0);
+function Wf(e, t) {
 	if (t.format && !e.format) return V;
-	if (e.format && t.format && e.format !== t.format) return cu;
-	let n = Qd(Vf(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
+	if (e.format && t.format && e.format !== t.format) return uu;
+	let n = ef(Uf(e.minLength, e.maxLength, t.minLength, t.maxLength)), r = !!e.pattern, i = !!t.pattern;
 	switch (n) {
 		case z.Rejection: return U;
-		case z.Containing: return r ? cu : V;
-		case z.ContainedBy: return i ? cu : H;
-		case z.Equals: return r && i ? e.pattern === t.pattern ? B : cu : r ? B | H : i ? B | V : B;
-		case z.Intersection: return r && i ? cu : r ? W | U | H : i ? W | U | V : W;
+		case z.Containing: return r ? uu : V;
+		case z.ContainedBy: return i ? uu : H;
+		case z.Equals: return r && i ? e.pattern === t.pattern ? B : uu : r ? B | H : i ? B | V : B;
+		case z.Intersection: return r && i ? uu : r ? W | U | H : i ? W | U | V : W;
 	}
 }
 //#endregion
 //#region src/json-schema-subset/checker/checker.ts
-function Uf(e, t, n) {
-	let r = {}, i = [], a = af(Gf(e, r)), o = Wf(), s = df(e);
-	r.isEquals = rf(ou), r.calculate = Du({
+function Gf(e, t, n) {
+	let r = {}, i = [], a = sf(qf(e, r)), o = Kf(), s = pf(e);
+	r.isEquals = of(cu), r.calculate = ku({
 		describe: o,
 		equals: s,
 		calculate: a,
 		observeCalculation: (e, t, n, r) => {
-			if (!qf(r ? vu(n) : n)) return;
-			let a = r ? Jf(t, e) : Jf(e, t);
+			if (!Yf(r ? bu(n) : n)) return;
+			let a = r ? Xf(t, e) : Xf(e, t);
 			a && i.push(a);
 		}
 	}), Object.freeze(r);
@@ -7221,34 +7286,34 @@ function Uf(e, t, n) {
 		expression: c
 	};
 }
-var Wf = () => (e) => {
+var Kf = () => (e) => {
 	let t;
 	switch (J(e)) {
 		case q.Not:
 			t = {
-				kind: Eu.Not,
+				kind: Ou.Not,
 				expression: e.not
 			};
 			break;
 		case q.Combination:
 			if ("allOf" in e) t = {
-				kind: Eu.AllOf,
-				expressions: Kf(e.allOf, q.Any)
+				kind: Ou.AllOf,
+				expressions: Jf(e.allOf, q.Any)
 			};
 			else if ("anyOf" in e) t = {
-				kind: Eu.AnyOf,
-				expressions: Kf(e.anyOf, q.Never)
+				kind: Ou.AnyOf,
+				expressions: Jf(e.anyOf, q.Never)
 			};
 			else if ("oneOf" in e) t = {
-				kind: Eu.OneOf,
-				expressions: Kf(e.oneOf, q.Never)
+				kind: Ou.OneOf,
+				expressions: Jf(e.oneOf, q.Never)
 			};
 			else throw Error(`invalid combination JSON Schema: ${JSON.stringify(e)}`);
 			break;
-		default: t = { kind: Eu.Leaf };
+		default: t = { kind: Ou.Leaf };
 	}
 	return t;
-}, Gf = (e, t) => (n, r) => {
+}, qf = (e, t) => (n, r) => {
 	let i = J(n), a = J(r);
 	if (i === q.Extends || a === q.Extends) return e.calculate(n, r);
 	switch (i) {
@@ -7259,28 +7324,28 @@ var Wf = () => (e) => {
 		case q.Any: return H;
 		case q.Never: return V;
 	}
-	if (i === q.EnumOrConst && a === q.EnumOrConst) return sf(t, n, r);
-	if (i === q.EnumOrConst) return cf(n, r);
-	if (a === q.EnumOrConst) return vu(cf(r, n));
+	if (i === q.EnumOrConst && a === q.EnumOrConst) return lf(t, n, r);
+	if (i === q.EnumOrConst) return uf(n, r);
+	if (a === q.EnumOrConst) return bu(uf(r, n));
 	if (i !== a) return U;
 	switch (i) {
 		case q.Null: return B;
-		case q.Numeric: return Ef(n, r);
-		case q.String: return Hf(n, r);
+		case q.Numeric: return Of(n, r);
+		case q.String: return Wf(n, r);
 		case q.Boolean: return B;
-		case q.Object: return jf(t, n, r);
-		case q.Array: return tf(t, n, r);
+		case q.Object: return Nf(t, n, r);
+		case q.Array: return rf(t, n, r);
 		default: throw Error(`invalid kind ${i}`);
 	}
 };
-function Kf(e, t) {
+function Jf(e, t) {
 	return e.filter((e) => J(e) !== t);
 }
-function qf(e) {
-	return !lu(e) && !du(e) && (uu(e) || pu(e) || fu(e));
+function Yf(e) {
+	return !du(e) && !pu(e) && (fu(e) || hu(e) || mu(e));
 }
-function Jf(e, t) {
-	let n = Xu(t);
+function Xf(e, t) {
+	let n = Qu(t);
 	if (!n) return;
 	let r = J(e), i = J(t);
 	if (r !== i) return [...n, "type"];
@@ -7315,12 +7380,12 @@ function Jf(e, t) {
 }
 //#endregion
 //#region src/json-schema-subset/extends/extendsContext.ts
-var Yf = class e {
+var Zf = class e {
 	constructor(e = []) {
 		this.extendsSchemaClasses = Object.freeze([...e]);
 	}
 	tryCompiledExtendsSchema(e, t) {
-		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(nu(), e, t);
+		for (let n of this.extendsSchemaClasses) if (n.isMatch(e)) return new n(iu(), e, t);
 		return null;
 	}
 	isExtendsSchema(e) {
@@ -7330,7 +7395,7 @@ var Yf = 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 |= mu(t);
+		for (let t of a) r && (t = e.swap(t)), i |= gu(t);
 		return i;
 	}
 	equals(e, t) {
@@ -7350,35 +7415,35 @@ var Yf = class e {
 };
 //#endregion
 //#region src/json-schema-subset/preprocessing.ts
-function Xf(e, t, n = !1) {
+function Qf(e, t, n = !1) {
 	let r = t(e);
 	if (Array.isArray(r)) {
 		let e = [];
-		throw Qf(e, r, "$"), new Ou(e);
+		throw ep(e, r, "$"), new Au(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(Au(e));
+		for (let e of a) console.warn(Mu(e));
 	}
 	return i;
 }
-function Zf(e, t, n, r = !1) {
+function $f(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) && Qf(e, i, "$1"), Array.isArray(a) && Qf(e, a, "$2"), new Ou(e);
+		throw Array.isArray(i) && ep(e, i, "$1"), Array.isArray(a) && ep(e, a, "$2"), new Au(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(Au(e));
+		for (let e of s) console.warn(Mu(e));
 		l.length > 0 && console.warn(`found ${l.length} warns after compile subSchema`);
-		for (let e of l) console.warn(Au(e));
+		for (let e of l) console.warn(Mu(e));
 	}
 	return [o, c];
 }
-function Qf(e, t, n) {
+function ep(e, t, n) {
 	for (let r of t) {
 		let t = {
 			...r,
@@ -7389,60 +7454,60 @@ function Qf(e, t, n) {
 }
 //#endregion
 //#region src/json-schema-subset/global.ts
-var $f = Object.freeze({
+var tp = Object.freeze({
 	True: 0,
 	False: 1,
 	Unknown: 2
 });
-function ep({ extendsSchemaClasses: e, delegate: t } = {}) {
-	let n = new Yf(e);
+function np({ extendsSchemaClasses: e, delegate: t } = {}) {
+	let n = new Zf(e);
 	return Object.freeze({
-		compile: (e, r, i) => Xf(e, (e) => Ld(e, n, r, t), i),
+		compile: (e, r, i) => Qf(e, (e) => zd(e, n, r, t), i),
 		isSubset: (e, r, i = !1) => {
-			let [a, o] = Zf(e, r, (e) => Ld(e, n, void 0, t), i), { errorPath: s, expression: c } = Uf(n, a, o), l = lu(c) || du(c), u = uu(c) || pu(c) || fu(c);
-			return l && !u ? { result: $f.True } : !l && u ? {
+			let [a, o] = $f(e, r, (e) => zd(e, n, void 0, t), i), { errorPath: s, expression: c } = Gf(n, a, o), l = du(c) || pu(c), u = fu(c) || hu(c) || mu(c);
+			return l && !u ? { result: tp.True } : !l && u ? {
 				errorPath: s,
-				result: $f.False
-			} : { result: $f.Unknown };
+				result: tp.False
+			} : { result: tp.Unknown };
 		}
 	});
 }
 //#endregion
 //#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
-var tp = (e) => typeof e == "string", np = Array.isArray, rp = (e) => typeof e == "object" && !!e, ip = (e) => rp(e) && !np(e), ap = (e) => ip(e) ? e : void 0;
+var rp = (e) => typeof e == "string", ip = Array.isArray, ap = (e) => typeof e == "object" && !!e, op = (e) => ap(e) && !ip(e), sp = (e) => op(e) ? e : void 0;
 //#endregion
 //#region src/manifest/common/schemaComparer.ts
-function op(e) {
-	return ap(e)?.type === "string";
+function cp(e) {
+	return sp(e)?.type === "string";
 }
-function sp(e) {
-	let t = ap(e), n = ap(t?.error);
-	if (t == null || n == null || t.packageId != null && !tp(t.packageId) || n.message != null && !tp(n.message)) throw TypeError("Invalid schema comparison context.");
+function lp(e) {
+	let t = sp(e), n = sp(t?.error);
+	if (t == null || n == null || t.packageId != null && !rp(t.packageId) || n.message != null && !rp(n.message)) throw TypeError("Invalid schema comparison context.");
 }
-function cp(e) {
-	return e == null ? { error: {} } : (sp(e), e);
+function up(e) {
+	return e == null ? { error: {} } : (lp(e), e);
 }
-var lp = class e {
+var dp = 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 = cp(n);
+		this.id = e, this.value = t, this.context = up(n);
 	}
 	compare(e) {
-		return Ju(e) && J(e) === q.Any ? [z.ContainedBy] : this.compareImpl(e);
+		return Xu(e) && J(e) === q.Any ? [z.ContainedBy] : this.compareImpl(e);
 	}
-}, up = class e extends lp {
+}, fp = class e extends dp {
 	static isMatch(e) {
-		let t = ap(e)?.enum;
-		return Array.isArray(t) && t.every((e) => tp(e));
+		let t = sp(e)?.enum;
+		return Array.isArray(t) && t.every((e) => rp(e));
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid single-select schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		if (op(t)) return [z.ContainedBy];
+		if (cp(t)) return [z.ContainedBy];
 		if (t instanceof e) {
 			let e = new Set(this.value.enum), n = z.Equals;
 			for (let r of t.value.enum) e.has(r) || (n = z.ContainedBy), e.delete(r);
@@ -7461,56 +7526,56 @@ var lp = class e {
 		}
 		return !1;
 	}
-}, dp = class e extends lp {
+}, pp = class e extends dp {
 	static isMatch(e) {
-		return ap(e)?.contentMediaType === "oomol/bin";
+		return sp(e)?.contentMediaType === "oomol/bin";
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid binary schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [z.Equals] : (lp.setError(this, t, "edgeError.binDiffType"), [z.Rejection]);
+		return t instanceof e ? [z.Equals] : (dp.setError(this, t, "edgeError.binDiffType"), [z.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
-}, fp = class e extends lp {
+}, mp = class e extends dp {
 	static isMatch(e) {
-		return ap(e)?.contentMediaType === "oomol/artifact";
+		return sp(e)?.contentMediaType === "oomol/artifact";
 	}
 	constructor(t, n, r) {
 		if (!e.isMatch(n)) throw TypeError("Invalid Artifact schema.");
 		super(t, n, r);
 	}
 	compareImpl(t) {
-		return t instanceof e ? [z.Equals] : (lp.setError(this, t, "edgeError.artifactDiffType"), [z.Rejection]);
+		return t instanceof e ? [z.Equals] : (dp.setError(this, t, "edgeError.artifactDiffType"), [z.Rejection]);
 	}
 	equals(t) {
 		return t instanceof e;
 	}
 };
-function pp() {
-	return ep({ extendsSchemaClasses: [
-		up,
-		dp,
-		fp
+function hp() {
+	return np({ extendsSchemaClasses: [
+		fp,
+		pp,
+		mp
 	] });
 }
-pp();
+hp();
 //#endregion
 //#region src/control/common/eventSources.ts
-var mp = S().min(1).max(256), hp = S().regex(/^[a-z][a-z0-9_.]{0,127}$/), gp = S().trim().min(1).max(128), _p = O({
+var gp = S().min(1).max(256), _p = S().regex(/^[a-z][a-z0-9_.]{0,127}$/), vp = S().trim().min(1).max(128), yp = O({
 	version: j(1),
-	sourceId: mp,
+	sourceId: gp,
 	revision: Zs().positive(),
-	name: gp,
+	name: vp,
 	provider: mc(["feishu", "feishu_app_bot"]),
-	appId: mp,
-	connectionId: mp,
-	teamId: mp.nullable(),
+	appId: gp,
+	connectionId: gp,
+	teamId: gp.nullable(),
 	enabled: T(),
-	eventTypes: E(hp),
+	eventTypes: E(_p),
 	manageSubscriptions: T(),
 	verificationTokenConfigured: T(),
 	encryptKeyConfigured: T(),
@@ -7519,22 +7584,22 @@ var mp = S().min(1).max(256), hp = S().regex(/^[a-z][a-z0-9_.]{0,127}$/), gp = S
 	lastReceivedAt: S().nullable(),
 	updatedAt: S(),
 	consumers: E(O({
-		flowId: mp,
+		flowId: gp,
 		flowName: S(),
-		triggerNodeId: mp
+		triggerNodeId: gp
 	}))
 });
-function vp(e) {
-	return _p.parse(e);
+function bp(e) {
+	return yp.parse(e);
 }
-function yp(e) {
+function xp(e) {
 	return O({
 		version: j(1),
-		sources: E(_p),
-		teamId: mp.nullable().optional()
+		sources: E(yp),
+		teamId: gp.nullable().optional()
 	}).parse(e);
 }
-var bp = new Map([
+var Sp = new Map([
 	"en",
 	"zh-CN",
 	"zh-TW",
@@ -7543,12 +7608,12 @@ var bp = new Map([
 	"ru",
 	"fr"
 ].map((e) => [e.toLowerCase(), e]));
-function xp(e) {
-	return typeof e == "string" && bp.get(e.toLowerCase()) == e;
+function Cp(e) {
+	return typeof e == "string" && Sp.get(e.toLowerCase()) == e;
 }
 //#endregion
 //#region src/trigger/common/configSchema.ts
-var Sp = E(k([O({
+var wp = E(k([O({
 	handle: S().min(1),
 	description: S().optional(),
 	jsonSchema: Vc(),
@@ -7560,7 +7625,7 @@ var Sp = E(k([O({
 })]));
 //#endregion
 //#region src/control/common/triggerDecoders.ts
-function Cp(e) {
+function Tp(e) {
 	let t = F(e), n = t.type;
 	return n != "integration" && n != "poll" ? P() : {
 		description: typeof t.description == "string" ? t.description : P(),
@@ -7571,9 +7636,9 @@ function Cp(e) {
 		type: n
 	};
 }
-function wp(e) {
-	let t = F(e), n = Cp(t), r = {
-		configInputs: Sp.parse(t.configInputs),
+function Ep(e) {
+	let t = F(e), n = Tp(t), r = {
+		configInputs: wp.parse(t.configInputs),
 		definitionVersion: t.definitionVersion === 2 ? 2 : P(),
 		description: n.description,
 		displayName: n.displayName,
@@ -7622,18 +7687,18 @@ function wp(e) {
 		type: "integration"
 	};
 }
-var Tp = /* @__PURE__ */ new Set([
+var Dp = /* @__PURE__ */ new Set([
 	"cron",
 	"integration",
 	"poll",
 	"webhook"
-]), Ep = /* @__PURE__ */ new Set([
+]), Op = /* @__PURE__ */ new Set([
 	"failed",
 	"healthy",
 	"initializing",
 	"needs_reauth",
 	"suspended"
-]), Dp = /* @__PURE__ */ new Set([
+]), kp = /* @__PURE__ */ new Set([
 	"delivery.failed",
 	"health.failed",
 	"health.needs_reauth",
@@ -7642,11 +7707,11 @@ var Tp = /* @__PURE__ */ new Set([
 	"operator.paused",
 	"operator.resumed"
 ]);
-function Op(e) {
+function Ap(e) {
 	let t = F(e), n = t.health, r = t.listener == null ? void 0 : F(t.listener);
 	if (r != null && r.health != "healthy" && r.health != "failed" && r.health != "needs_reauth") return P();
 	let i = t.kind, a = t.operatorState, o = R(t.runtimeVersion);
-	return t.version != 1 || typeof n != "string" || !Ep.has(n) || typeof i != "string" || !Tp.has(i) || a != "active" && a != "paused" || o <= 0 ? P() : {
+	return t.version != 1 || typeof n != "string" || !Op.has(n) || typeof i != "string" || !Dp.has(i) || a != "active" && a != "paused" || o <= 0 ? P() : {
 		...t.currentPublicationId == null ? {} : { currentPublicationId: I(t.currentPublicationId) },
 		...t.currentRevisionId == null ? {} : { currentRevisionId: I(t.currentRevisionId) },
 		...t.endpointUrl == null ? {} : { endpointUrl: I(t.endpointUrl) },
@@ -7665,16 +7730,16 @@ function Op(e) {
 		version: 1
 	};
 }
-function kp(e) {
+function jp(e) {
 	let t = F(e);
 	return t.version == 1 ? {
-		binding: Op(t.binding),
+		binding: Ap(t.binding),
 		version: 1
 	} : P();
 }
-function Ap(e) {
+function Mp(e) {
 	let t = F(e), n = t.kind;
-	if (typeof n != "string" || !Dp.has(n)) return P();
+	if (typeof n != "string" || !kp.has(n)) return P();
 	let r = zl(t.errorCode), i = zl(t.errorMessage);
 	return i != null && i.length > 512 ? P() : {
 		activityId: I(t.activityId),
@@ -7684,15 +7749,15 @@ function Ap(e) {
 		kind: n
 	};
 }
-function jp(e) {
+function Np(e) {
 	let t = F(e), n = zl(t.nextCursor);
 	return t.version != 1 || !Array.isArray(t.activities) ? P() : {
-		activities: t.activities.map(Ap),
+		activities: t.activities.map(Mp),
 		...n == null ? {} : { nextCursor: n },
 		version: 1
 	};
 }
-function Mp(e) {
+function Pp(e) {
 	let t = F(e), n = R(t.filtered);
 	return t.version != 1 || !Array.isArray(t.events) || typeof t.hasMore != "boolean" || n < 0 ? P() : {
 		events: t.events.map((e) => {
@@ -7706,44 +7771,53 @@ function Mp(e) {
 }
 //#endregion
 //#region src/control/common/triggerCatalog.ts
-function Np(e) {
+function Fp(e) {
 	let t = F(e);
 	if (L(t, [
 		"version",
 		"locale",
 		"definitions",
 		"display"
-	]), t.version != 2 || !xp(t.locale) || !Array.isArray(t.definitions)) return P();
-	let n = t.definitions.map(wp), r = F(t.display), i = new Set(n.map((e) => e.key));
+	]), t.version != 3 || !Cp(t.locale) || !Array.isArray(t.definitions)) return P();
+	let n = t.definitions.map(Ep), r = F(t.display), i = new Set(n.map((e) => e.key));
 	if (i.size != n.length || Object.keys(r).length != i.size) return P();
 	let a = Object.fromEntries(n.map((e) => {
 		let { key: t } = e, n = F(r[t]);
 		return L(n, [
 			"configInputs",
+			"configInputLabels",
 			"displayName",
 			"description",
 			"outputs"
 		]), [t, {
-			configInputs: Pp(n.configInputs, e.configInputs.flatMap((e) => "handle" in e ? [e.handle] : [])),
+			configInputs: Ip(n.configInputs, e.configInputs.flatMap((e) => "handle" in e ? [e.handle] : [])),
+			configInputLabels: Lp(n.configInputLabels, e.configInputs.flatMap((e) => "handle" in e ? [e.handle] : [])),
 			displayName: I(n.displayName),
 			description: I(n.description),
-			outputs: Pp(n.outputs, e.outputs.map((e) => e.handle))
+			outputs: Ip(n.outputs, e.outputs.map((e) => e.handle))
 		}];
 	}));
 	return {
-		version: 2,
+		version: 3,
 		locale: t.locale,
 		definitions: n,
 		display: a
 	};
 }
-function Pp(e, t) {
+function Ip(e, t) {
 	let n = F(e);
 	return L(n, t), Object.fromEntries(Object.entries(n).map(([e, t]) => [e, I(t)]));
 }
+function Lp(e, t) {
+	let n = F(e);
+	return Object.keys(n).some((e) => !t.includes(e)) ? P() : Object.fromEntries(Object.entries(n).map(([e, t]) => {
+		let n = I(t);
+		return n.trim().length == 0 ? P() : [e, n];
+	}));
+}
 //#endregion
 //#region src/control/common/results.ts
-var Fp = Vc(), Ip = O({
+var Rp = Vc(), zp = O({
 	pointer: S(),
 	type: mc([
 		"object",
@@ -7755,12 +7829,12 @@ var Fp = Vc(), Ip = O({
 	]),
 	length: w().int().nonnegative().optional(),
 	complete: T(),
-	value: Fp.optional()
-}), Lp = Ip.extend({
+	value: Rp.optional()
+}), Bp = zp.extend({
 	offset: w().int().nonnegative(),
 	nextOffset: w().int().positive().optional(),
-	entries: E(Ip).optional()
-}), Rp = O({
+	entries: E(zp).optional()
+}), Vp = O({
 	resultId: S().min(1),
 	callId: S().min(1),
 	toolId: S().min(1),
@@ -7771,59 +7845,60 @@ var Fp = Vc(), Ip = O({
 	bytes: w().int().nonnegative(),
 	digest: S().regex(/^[a-f0-9]{64}$/),
 	createdAt: S().datetime()
-}), zp = O({
+}), Hp = O({
 	version: j(1),
 	runId: S(),
-	results: E(Rp),
+	results: E(Vp),
 	nextAfter: S().optional()
-}), Bp = O({
+}), Up = O({
 	version: j(1),
 	runId: S(),
-	result: Rp,
-	page: Lp
+	result: Vp,
+	page: Bp
 });
-function Vp(e) {
-	return zp.parse(e);
+function Wp(e) {
+	return Hp.parse(e);
 }
-function Hp(e) {
-	return Bp.parse(e);
+function Gp(e) {
+	return Up.parse(e);
 }
 new TextEncoder();
 //#endregion
 //#region src/control/common/checkDecoders.ts
-function Up(e) {
+function Kp(e) {
 	return Array.isArray(e) ? e.map((e) => typeof e == "string" || Number.isSafeInteger(e) ? e : P()) : P();
 }
-function Wp(e) {
+function qp(e) {
 	let t = F(e), n = I(t.kind);
 	return n == "artifact" || n == "binary" || n == "nullable" ? { kind: n } : n == "schema" ? {
 		kind: n,
-		path: t.path == null ? void 0 : Up(t.path)
+		path: t.path == null ? void 0 : Kp(t.path)
 	} : n != "keyword" || typeof t.keyword != "string" || !Pl(t.keyword) ? P() : {
 		kind: n,
 		keyword: t.keyword,
-		path: Up(t.path),
+		path: Kp(t.path),
 		source: t.source === void 0 ? void 0 : Rl(t.source),
 		target: t.target === void 0 ? void 0 : Rl(t.target)
 	};
 }
-function Gp(e) {
+function Jp(e) {
 	let t = F(e), n = t.values == null ? void 0 : F(t.values);
 	return {
 		code: I(t.code),
 		column: R(t.column),
+		...t.fields === void 0 ? {} : { fields: Array.isArray(t.fields) ? t.fields.map(I) : P() },
 		line: R(t.line),
 		message: I(t.message),
-		mismatch: t.mismatch == null ? void 0 : Wp(t.mismatch),
+		mismatch: t.mismatch == null ? void 0 : qp(t.mismatch),
 		path: typeof t.path == "string" ? t.path : P(),
 		...n == null ? {} : { values: Object.fromEntries(Object.entries(n).map(([e, t]) => [e, typeof t == "string" || typeof t == "number" ? t : P()])) }
 	};
 }
-function Kp(e) {
+function Yp(e) {
 	let t = F(e);
 	return t.version != 1 || typeof t.valid != "boolean" || !Array.isArray(t.diagnostics) ? P() : {
 		closureDigest: I(t.closureDigest),
-		diagnostics: t.diagnostics.map(Gp),
+		diagnostics: t.diagnostics.map(Jp),
 		engineContract: I(t.engineContract),
 		flowId: I(t.flowId),
 		modelVersion: R(t.modelVersion),
@@ -7835,8 +7910,8 @@ function Kp(e) {
 }
 //#endregion
 //#region src/control/common/connectorQueries.ts
-var qp = (e) => e == null ? "" : `?flowId=${encodeURIComponent(e)}`;
-function Jp(e, t) {
+var Xp = (e) => e == null ? "" : `?flowId=${encodeURIComponent(e)}`;
+function Zp(e, t) {
 	let n = new URLSearchParams({
 		...e == null ? {} : { flowId: e },
 		...t == null ? {} : { locale: t }
@@ -7845,11 +7920,11 @@ function Jp(e, t) {
 		path: `/v1/connector/providers${n ? `?${n}` : ""}`,
 		decode: (e) => {
 			let t = F(e);
-			return L(t, ["providers", "version"]), t.version != 1 || !Array.isArray(t.providers) ? P() : t.providers.map(eu);
+			return L(t, ["providers", "version"]), t.version != 1 || !Array.isArray(t.providers) ? P() : t.providers.map(nu);
 		}
 	};
 }
-function Yp(e, t, n) {
+function Qp(e, t, n) {
 	let r = new URLSearchParams({
 		...t == null ? {} : { flowId: t },
 		...n == null ? {} : { locale: n }
@@ -7858,35 +7933,35 @@ function Yp(e, t, n) {
 		path: `/v1/connector/actions/${encodeURIComponent(e)}${r ? `?${r}` : ""}`,
 		decode: (e) => {
 			let t = F(e);
-			return L(t, ["action", "version"]), t.version == 1 ? $l(t.action) : P();
+			return L(t, ["action", "version"]), t.version == 1 ? tu(t.action) : P();
 		}
 	};
 }
-function Xp(e) {
+function $p(e) {
 	return {
-		path: `/v1/connector/connections${qp(e)}`,
+		path: `/v1/connector/connections${Xp(e)}`,
 		decode: (e) => {
 			let t = F(e);
-			return L(t, ["connections", "version"]), t.version != 1 || !Array.isArray(t.connections) ? P() : t.connections.map(Jl);
+			return L(t, ["connections", "version"]), t.version != 1 || !Array.isArray(t.connections) ? P() : t.connections.map(Xl);
 		}
 	};
 }
-function Zp(e, t) {
+function em(e, t) {
 	return {
-		path: `/v1/connector/connections/${encodeURIComponent(e)}${qp(t)}`,
+		path: `/v1/connector/connections/${encodeURIComponent(e)}${Xp(t)}`,
 		decode: (t) => {
 			let n = F(t);
 			return L(n, [
 				"connections",
 				"serviceId",
 				"version"
-			]), n.version != 1 || I(n.serviceId) != e || !Array.isArray(n.connections) ? P() : n.connections.map(Jl);
+			]), n.version != 1 || I(n.serviceId) != e || !Array.isArray(n.connections) ? P() : n.connections.map(Xl);
 		}
 	};
 }
 //#endregion
 //#region src/control/common/flowDecoders.ts
-function Qp(e) {
+function tm(e) {
 	let t = F(e), n = t.status;
 	if (t.version != 1 || n != "active" && n != "retiring") return P();
 	let r = t.live == null ? void 0 : F(t.live);
@@ -7905,18 +7980,18 @@ function Qp(e) {
 		version: 1
 	};
 }
-function $p(e) {
+function nm(e) {
 	let t = F(e);
 	if (t.version != 1 || !Array.isArray(t.flows)) return P();
 	let n = t.nextCursor, r = t.total;
 	return n != null && typeof n != "string" || r != null && !Number.isSafeInteger(r) ? P() : {
 		...n == null ? {} : { nextCursor: n },
-		flows: t.flows.map(Qp),
+		flows: t.flows.map(tm),
 		...r == null ? {} : { total: r },
 		version: 1
 	};
 }
-function em(e) {
+function rm(e) {
 	let t = F(e);
 	if (L(t, [
 		"name",
@@ -7939,7 +8014,7 @@ function em(e) {
 }
 //#endregion
 //#region src/control/common/publicationDecoders.ts
-function tm(e) {
+function im(e) {
 	let t = F(e), n = t.operation, r = t.sourcePublicationId;
 	return t.version != 1 || n != "publish" && n != "rollback" || r != null && typeof r != "string" ? P() : {
 		actorId: I(t.actorId),
@@ -7950,14 +8025,14 @@ function tm(e) {
 		modelVersion: R(t.modelVersion),
 		operation: n,
 		publicationId: I(t.publicationId),
-		providerAccessDigest: I(t.providerAccessDigest),
+		sharedAccessDigest: I(t.sharedAccessDigest),
 		revisionDigest: I(t.revisionDigest),
 		revisionId: I(t.revisionId),
 		...r == null ? {} : { sourcePublicationId: r },
 		version: 1
 	};
 }
-function nm(e) {
+function am(e) {
 	let t = F(e), n = t.status, r = {
 		createdAt: I(t.createdAt),
 		flowId: I(t.flowId),
@@ -8023,29 +8098,29 @@ function nm(e) {
 		default: return P();
 	}
 }
-function rm(e) {
+function om(e) {
 	let t = F(e), n = t.status, r = t.publication;
 	return t.version != 1 || typeof t.hasUnpublishedChanges != "boolean" || n != "not-published" && n != "runnable" && n != "suspended" || n == "not-published" && r !== null || n != "not-published" && r === null ? P() : {
 		flowId: I(t.flowId),
 		hasUnpublishedChanges: t.hasUnpublishedChanges,
-		publication: r === null ? null : tm(r),
+		publication: r === null ? null : im(r),
 		revision: R(t.revision),
 		status: n,
 		version: 1
 	};
 }
-function im(e) {
+function sm(e) {
 	let t = F(e), n = t.nextCursor, r = t.total;
 	return t.version != 1 || !Array.isArray(t.publications) || n != null && typeof n != "string" || r != null && !Number.isSafeInteger(r) ? P() : {
 		...n == null ? {} : { nextCursor: n },
-		publications: t.publications.map(tm),
+		publications: t.publications.map(im),
 		...r == null ? {} : { total: r },
 		version: 1
 	};
 }
 //#endregion
 //#region src/control/common/revisionDecoders.ts
-function am(e) {
+function cm(e) {
 	let t = F(e), n = t.parentRevisionId;
 	return t.version != 1 || n !== null && typeof n != "string" ? P() : {
 		actorId: I(t.actorId),
@@ -8058,18 +8133,18 @@ function am(e) {
 		version: 1
 	};
 }
-function om(e) {
+function lm(e) {
 	let t = F(e);
 	try {
 		return {
-			...am(t),
+			...cm(t),
 			content: jl(t.content)
 		};
 	} catch {
 		return P();
 	}
 }
-function sm(e) {
+function um(e) {
 	let t = F(e);
 	return t.version != 1 || R(t.revision) < 1 ? P() : {
 		revision: R(t.revision),
@@ -8078,28 +8153,28 @@ function sm(e) {
 		version: 1
 	};
 }
-function cm(e) {
+function dm(e) {
 	let t = F(e);
 	return t.version == 1 ? {
-		revision: am(t.revision),
+		revision: cm(t.revision),
 		version: 1
 	} : P();
 }
-function lm(e) {
+function fm(e) {
 	let t = F(e);
 	return t.version != 1 || t.kind != "snapshot" ? P() : {
-		draft: om(t.draft),
+		draft: lm(t.draft),
 		kind: "snapshot",
 		version: 1
 	};
 }
 //#endregion
 //#region src/control/common/runDecoders.ts
-var um = new Set(Wc);
-function dm(e) {
-	return typeof e == "string" && um.has(e) ? e : P();
+var pm = new Set(Wc);
+function mm(e) {
+	return typeof e == "string" && pm.has(e) ? e : P();
 }
-function fm(e) {
+function hm(e) {
 	let t = F(e), n = t.source, r = t.startedAt, i = t.finishedAt;
 	return t.version != 1 || n != "draft" && n != "live" && n != "trigger" || r != null && typeof r != "string" || i != null && typeof i != "string" ? P() : {
 		createdAt: I(t.createdAt),
@@ -8109,11 +8184,11 @@ function fm(e) {
 		runId: I(t.runId),
 		source: n,
 		...r == null ? {} : { startedAt: r },
-		status: dm(t.status),
+		status: mm(t.status),
 		version: 1
 	};
 }
-function pm(e) {
+function gm(e) {
 	let t = F(e);
 	L(t, [
 		"actions",
@@ -8133,10 +8208,10 @@ function pm(e) {
 		waitingSince: I(t.waitingSince)
 	};
 }
-function mm(e) {
-	let t = F(e), n = fm(t), r = t.eventsExpiresAt;
+function _m(e) {
+	let t = F(e), n = hm(t), r = t.eventsExpiresAt;
 	if (r != null && typeof r != "string" || t.waiting !== void 0 || !Array.isArray(t.waits)) return P();
-	let i = t.waits.map(pm);
+	let i = t.waits.map(gm);
 	if (new Set(i.map((e) => e.waitId)).size != i.length || n.status == "waiting" && i.length == 0 || [
 		"completed",
 		"failed",
@@ -8153,7 +8228,7 @@ function mm(e) {
 		engineDigest: I(t.engineDigest),
 		...r == null ? {} : { eventsExpiresAt: r },
 		modelVersion: R(t.modelVersion),
-		providerAccessDigest: I(t.providerAccessDigest),
+		sharedAccessDigest: I(t.sharedAccessDigest),
 		revisionDigest: I(t.revisionDigest),
 		...a
 	};
@@ -8176,17 +8251,17 @@ function mm(e) {
 		};
 	}
 }
-function hm(e) {
+function vm(e) {
 	let t = F(e), n = t.nextCursor;
 	return t.version != 1 || !Array.isArray(t.runs) || n != null && typeof n != "string" ? P() : {
 		flowId: I(t.flowId),
 		...n == null ? {} : { nextCursor: n },
-		runs: t.runs.map(fm),
+		runs: t.runs.map(hm),
 		version: 1
 	};
 }
-function gm(e) {
-	let t = F(e), n = dm(t.status);
+function ym(e) {
+	let t = F(e), n = mm(t.status);
 	return t.version != 1 || typeof t.cancelAccepted != "boolean" || n == "queued" || n == "starting" || n == "running" || n == "waiting" ? P() : {
 		cancelAccepted: t.cancelAccepted,
 		runId: I(t.runId),
@@ -8194,7 +8269,7 @@ function gm(e) {
 		version: 1
 	};
 }
-function _m(e) {
+function bm(e) {
 	let t = F(e);
 	L(t, [
 		"action",
@@ -8213,12 +8288,12 @@ function _m(e) {
 		resolutionAccepted: t.resolutionAccepted,
 		resolvedAt: r,
 		runId: I(t.runId),
-		status: dm(t.status),
+		status: mm(t.status),
 		version: 1,
 		waitId: I(t.waitId)
 	};
 }
-function vm(e) {
+function xm(e) {
 	let t = F(e), n = t.status;
 	if (t.version != 1) return P();
 	let r = {
@@ -8261,7 +8336,7 @@ function vm(e) {
 }
 //#endregion
 //#region src/control/common/random.ts
-function ym() {
+function Sm() {
 	let e = globalThis.crypto;
 	if (e != null) {
 		try {
@@ -8278,7 +8353,7 @@ function ym() {
 }
 //#endregion
 //#region src/control/common/api.ts
-function bm(e) {
+function Cm(e) {
 	let t = F(e), n = R(t.sequence);
 	if (n < 0) return P();
 	let r = {
@@ -8306,7 +8381,7 @@ function bm(e) {
 			payload: {
 				flowId: I(i.flowId),
 				scopeId: I(i.scopeId),
-				progress: xm(i.progress)
+				progress: wm(i.progress)
 			}
 		};
 		case "run.waiting": return Array.isArray(i.waitIds) ? {
@@ -8415,7 +8490,7 @@ function bm(e) {
 					kind: a,
 					payload: {
 						...e,
-						progress: xm(i.progress)
+						progress: wm(i.progress)
 					}
 				};
 				case "node.artifact": {
@@ -8441,14 +8516,14 @@ function bm(e) {
 		default: return P();
 	}
 }
-function xm(e) {
+function wm(e) {
 	return typeof e == "number" && Number.isFinite(e) && e >= 0 && e <= 100 ? e : P();
 }
-function Sm(e) {
+function Tm(e) {
 	let t = F(e), n = t.eventsExpiresAt, r = R(t.nextAfter);
 	return t.version != 1 || !Array.isArray(t.events) || typeof t.done != "boolean" || typeof t.historyComplete != "boolean" || n != null && typeof n != "string" || r < 0 ? P() : {
 		done: t.done,
-		events: t.events.map(bm),
+		events: t.events.map(Cm),
 		...n == null ? {} : { eventsExpiresAt: n },
 		historyComplete: t.historyComplete,
 		nextAfter: r,
@@ -8457,10 +8532,10 @@ function Sm(e) {
 	};
 }
 var X = encodeURIComponent;
-function Cm(e) {
-	return `${e}-${ym()}`;
+function Em(e) {
+	return `${e}-${Sm()}`;
 }
-var wm = class {
+var Dm = class {
 	constructor(e) {
 		this.requestControl = e;
 	}
@@ -8468,23 +8543,23 @@ var wm = class {
 		let t = new URLSearchParams();
 		e.cursor != null && t.set("cursor", e.cursor), e.limit != null && t.set("limit", String(e.limit)), e.includeTotal != null && t.set("includeTotal", String(e.includeTotal));
 		let n = t.size == 0 ? "" : `?${t}`;
-		return $p(await this.request(`/v1/flows${n}`));
+		return nm(await this.request(`/v1/flows${n}`));
 	}
 	async listEventSources(e, t) {
-		return yp(await this.request("/v1/event-sources" + (e == null ? "" : `?flowId=${X(e)}`), { signal: t }));
+		return xp(await this.request("/v1/event-sources" + (e == null ? "" : `?flowId=${X(e)}`), { signal: t }));
 	}
 	async listEventSourceConnections(e, t) {
 		let n = F(await this.request(`/v1/event-sources/connections${e == null ? "" : `?teamId=${X(e)}`}`, { signal: t }));
-		return L(n, ["version", "connections"]), n.version != 1 || !Array.isArray(n.connections) ? P() : n.connections.map(Jl);
+		return L(n, ["version", "connections"]), n.version != 1 || !Array.isArray(n.connections) ? P() : n.connections.map(Xl);
 	}
 	async createEventSource(e) {
-		return vp(await this.request("/v1/event-sources", {
+		return bp(await this.request("/v1/event-sources", {
 			method: "POST",
 			body: JSON.stringify(e)
 		}));
 	}
 	async updateEventSource(e, t) {
-		return vp(await this.request(`/v1/event-sources/${X(e)}`, {
+		return bp(await this.request(`/v1/event-sources/${X(e)}`, {
 			method: "PUT",
 			body: JSON.stringify(t)
 		}));
@@ -8501,15 +8576,15 @@ var wm = class {
 	async listVariables() {
 		let e = F(await this.request("/v1/variables"));
 		return L(e, ["variables", "version"]), e.version != 1 || !Array.isArray(e.variables) ? P() : {
-			variables: e.variables.map(em),
+			variables: e.variables.map(rm),
 			version: 1
 		};
 	}
 	async getVariable(e) {
-		return em(await this.request(`/v1/variables/${X(e)}`));
+		return rm(await this.request(`/v1/variables/${X(e)}`));
 	}
 	async putVariable(e, t) {
-		return em(await this.request(`/v1/variables/${X(e)}`, {
+		return rm(await this.request(`/v1/variables/${X(e)}`, {
 			body: JSON.stringify({ value: t }),
 			method: "PUT"
 		}));
@@ -8518,8 +8593,8 @@ var wm = class {
 		let t = F(await this.request(`/v1/variables/${X(e)}`, { method: "DELETE" }));
 		if (L(t, ["version"]), t.version != 1) return P();
 	}
-	async createFlow(e, t = `flow-${ym()}`, n) {
-		return Qp(await this.request("/v1/flows", {
+	async createFlow(e, t = `flow-${Sm()}`, n) {
+		return tm(await this.request("/v1/flows", {
 			body: JSON.stringify({
 				name: e,
 				...n == null ? {} : { teamId: n },
@@ -8530,10 +8605,10 @@ var wm = class {
 		}));
 	}
 	async getFlow(e) {
-		return Qp(await this.request(`/v1/flows/${X(e)}`));
+		return tm(await this.request(`/v1/flows/${X(e)}`));
 	}
 	async renameFlow(e, t) {
-		return Qp(await this.request(`/v1/flows/${X(e)}`, {
+		return tm(await this.request(`/v1/flows/${X(e)}`, {
 			body: JSON.stringify({
 				name: t,
 				version: 1
@@ -8542,15 +8617,15 @@ var wm = class {
 		}));
 	}
 	async deleteFlow(e) {
-		return Qp(await this.request(`/v1/flows/${X(e)}`, { method: "DELETE" }));
+		return tm(await this.request(`/v1/flows/${X(e)}`, { method: "DELETE" }));
 	}
 	async listTriggerKeys(e, t) {
 		let n = F(await this.request(`/v1/trigger-keys${t == null ? "" : `?locale=${encodeURIComponent(t)}`}`, { signal: e }));
-		return n.version != 1 || !Array.isArray(n.keys) ? P() : n.keys.map(Cp);
+		return n.version != 1 || !Array.isArray(n.keys) ? P() : n.keys.map(Tp);
 	}
 	async listTriggerDefinitions(e) {
 		let t = F(await this.request("/v1/trigger-keys/catalog", { signal: e }));
-		return t.version != 2 || !Array.isArray(t.definitions) ? P() : t.definitions.map(wp);
+		return t.version != 2 || !Array.isArray(t.definitions) ? P() : t.definitions.map(Ep);
 	}
 	async readCatalog(e, t, n) {
 		let r = new Headers();
@@ -8579,41 +8654,41 @@ var wm = class {
 			...t,
 			etag: i.headers.get("etag")?.trim() || t.etag
 		} : {
-			data: Np(await i.json()),
+			data: Fp(await i.json()),
 			etag: i.headers.get("etag")?.trim() || null
 		};
 	}
 	async getTriggerKey(e, t) {
 		let n = F(await this.request(`/v1/trigger-keys/${X(e)}`, { signal: t }));
-		return n.version == 1 ? wp(n.definition) : P();
+		return n.version == 1 ? Ep(n.definition) : P();
 	}
 	async listFlowTriggerBindings(e, t) {
 		let n = F(await this.request(`/v1/flows/${X(e)}/triggers`, { signal: t }));
-		return n.version != 1 || I(n.flowId) != e || !Array.isArray(n.bindings) ? P() : n.bindings.map(Op);
+		return n.version != 1 || I(n.flowId) != e || !Array.isArray(n.bindings) ? P() : n.bindings.map(Ap);
 	}
 	async getFlowTriggerBinding(e, t) {
-		return kp(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}`));
+		return jp(await this.request(`/v1/flows/${X(e)}/triggers/${X(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 jp(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/activities${i}`));
+		return Np(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/activities${i}`));
 	}
 	async pauseFlowTrigger(e, t) {
-		return Op(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/pause`, {
+		return Ap(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/pause`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async resumeFlowTrigger(e, t) {
-		return Op(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/resume`, {
+		return Ap(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/resume`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async testFlowPollTrigger(e, t) {
-		return Mp(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/test`, {
+		return Pp(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/test`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
@@ -8622,25 +8697,25 @@ var wm = class {
 		let t = F(await this.request(`/v1/flows/${X(e)}/editor`));
 		if (t.version != 1) return P();
 		let n = {
-			flow: Qp(t.flow),
-			draft: om(t.draft),
-			live: rm(t.live),
-			presentation: sm(t.presentation),
+			flow: tm(t.flow),
+			draft: lm(t.draft),
+			live: om(t.live),
+			presentation: um(t.presentation),
 			version: 1
 		};
 		return n.flow.flowId != e || n.draft.flowId != e || n.live.flowId != e || n.flow.draftRevisionId != n.draft.revisionId ? P() : n;
 	}
 	async getPresentation(e) {
-		return sm(await this.request(`/v1/flows/${X(e)}/presentation`));
+		return um(await this.request(`/v1/flows/${X(e)}/presentation`));
 	}
 	async getDraft(e) {
-		return om(await this.request(`/v1/flows/${X(e)}/draft`));
+		return lm(await this.request(`/v1/flows/${X(e)}/draft`));
 	}
 	async syncDraft(e) {
-		return lm(await this.request(`/v1/flows/${X(e)}/draft/sync`));
+		return fm(await this.request(`/v1/flows/${X(e)}/draft/sync`));
 	}
 	async getRevision(e, t, n) {
-		return om(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}`, { signal: n }));
+		return lm(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}`, { signal: n }));
 	}
 	async listTriggerConfigOptions(e, t, n, r) {
 		let i = F(await this.request(`/v1/flows/${X(e)}/triggers/${X(t)}/options/${X(n)}`, { signal: r }));
@@ -8686,11 +8761,11 @@ var wm = class {
 		};
 	}
 	async listConnectorProviders(e, t, n) {
-		let r = Jp(t, n);
+		let r = Zp(t, n);
 		return this.connectorRequest(r.path, "providers", e, r.decode);
 	}
 	async removeConnectionUsage(e, t, n, r, i) {
-		return cm(await this.request(`/v1/flows/${X(e)}/connection-usage/remove`, {
+		return dm(await this.request(`/v1/flows/${X(e)}/connection-usage/remove`, {
 			method: "POST",
 			headers: { "idempotency-key": i },
 			body: JSON.stringify({
@@ -8701,11 +8776,14 @@ var wm = class {
 			})
 		}));
 	}
-	async getConnectorAccess(e, t, n) {
-		return Gl(await this.request(`/v1/flows/${X(e)}/connector-access${n == null ? "" : `?publicationId=${X(n)}`}`, { signal: t }));
+	async getConnectorAccess(e, t) {
+		return Gl(await this.request(`/v1/flows/${X(e)}/connector-access`, { signal: t }));
+	}
+	async getPublishedConnectorAccess(e, t, n) {
+		return ql(await this.request(`/v1/flows/${X(e)}/connector-access?publicationId=${X(t)}`, { signal: n }));
 	}
 	async listProviderAccessBindingCandidates(e, t, n) {
-		return ql(await this.request(`/v1/flows/${X(e)}/connector-access/candidates/query`, {
+		return Yl(await this.request(`/v1/flows/${X(e)}/connector-access/candidates/query`, {
 			method: "POST",
 			body: JSON.stringify({
 				providerIds: t,
@@ -8758,15 +8836,15 @@ var wm = class {
 		}, t);
 	}
 	async getConnectorAction(e, t, n, r, i = !1) {
-		let a = Yp(e, n, r);
+		let a = Qp(e, n, r);
 		return this.connectorRequest(a.path, "actions", t, a.decode, i);
 	}
 	async listAllConnectorConnections(e, t, n = !1) {
-		let r = Xp(t);
+		let r = $p(t);
 		return this.connectorRequest(r.path, "connections", e, r.decode, n);
 	}
 	async listConnectorConnections(e, t, n, r = !1) {
-		let i = Zp(e, n);
+		let i = em(e, n);
 		return this.connectorRequest(i.path, "connections", t, i.decode, r);
 	}
 	async createConnectorConnectionPage(e, t, n) {
@@ -8784,8 +8862,8 @@ var wm = class {
 			return P();
 		}
 	}
-	async changeDraft(e, t, n, r = Cm("change")) {
-		return cm(await this.request(`/v1/flows/${X(e)}/draft/changes`, {
+	async changeDraft(e, t, n, r = Em("change")) {
+		return dm(await this.request(`/v1/flows/${X(e)}/draft/changes`, {
 			body: JSON.stringify({
 				expectedRevisionId: t,
 				operations: n,
@@ -8795,8 +8873,8 @@ var wm = class {
 			method: "POST"
 		}));
 	}
-	async repairDraft(e, t, n = Cm("repair")) {
-		return cm(await this.request(`/v1/flows/${X(e)}/draft/repair`, {
+	async repairDraft(e, t, n = Em("repair")) {
+		return dm(await this.request(`/v1/flows/${X(e)}/draft/repair`, {
 			body: JSON.stringify({
 				expectedRevisionId: t,
 				version: 1
@@ -8806,7 +8884,7 @@ var wm = class {
 		}));
 	}
 	async checkFlow(e, t) {
-		return Kp(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}/check`, {
+		return Yp(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}/check`, {
 			body: JSON.stringify({
 				engineContract: "open-flow-engine/v5",
 				version: 1
@@ -8815,42 +8893,42 @@ var wm = class {
 		}));
 	}
 	async getLive(e, t) {
-		return rm(await this.request(`/v1/flows/${X(e)}/live`, { signal: t }));
+		return om(await this.request(`/v1/flows/${X(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 im(await this.request(`/v1/flows/${X(e)}/publications${i}`, { signal: n }));
+		return sm(await this.request(`/v1/flows/${X(e)}/publications${i}`, { signal: n }));
 	}
 	async createDraftRun(e, t, n) {
-		let r = mm(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}/runs`, {
+		let r = _m(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}/runs`, {
 			body: JSON.stringify({
 				engineContract: "open-flow-engine/v5",
 				inputs: n.inputs ?? {},
 				trigger: n.trigger,
 				version: 2
 			}),
-			headers: { "idempotency-key": n.idempotencyKey ?? Cm("run") },
+			headers: { "idempotency-key": n.idempotencyKey ?? Em("run") },
 			method: "POST"
 		}));
 		return r.source == "draft" ? r : P();
 	}
 	async createLiveRun(e, t) {
-		let n = mm(await this.request("/v1/runs", {
+		let n = _m(await this.request("/v1/runs", {
 			body: JSON.stringify({
 				inputs: t.inputs ?? {},
 				trigger: t.trigger,
 				publicationId: e,
 				version: 2
 			}),
-			headers: { "idempotency-key": t.idempotencyKey ?? Cm("run") },
+			headers: { "idempotency-key": t.idempotencyKey ?? Em("run") },
 			method: "POST"
 		}));
 		return n.source == "live" ? n : P();
 	}
 	async setFlowEnabled(e, t, n) {
-		return Qp(await this.request(`/v1/flows/${X(e)}/enabled`, {
+		return tm(await this.request(`/v1/flows/${X(e)}/enabled`, {
 			method: "PUT",
 			body: JSON.stringify({
 				enabled: n,
@@ -8860,65 +8938,65 @@ var wm = class {
 		}));
 	}
 	async publishFlow(e, t, n, r = {}) {
-		return nm(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}/publications`, {
+		return am(await this.request(`/v1/flows/${X(e)}/revisions/${X(t)}/publications`, {
 			body: JSON.stringify({
 				engineContract: "open-flow-engine/v5",
 				expectedLivePublicationId: n,
 				version: 1
 			}),
-			headers: { "idempotency-key": r.idempotencyKey ?? Cm("publication") },
+			headers: { "idempotency-key": r.idempotencyKey ?? Em("publication") },
 			method: "POST"
 		}));
 	}
 	async getPublishOperation(e, t, n) {
-		return nm(await this.request(`/v1/flows/${X(e)}/publish-operations/${X(t)}`, { signal: n }));
+		return am(await this.request(`/v1/flows/${X(e)}/publish-operations/${X(t)}`, { signal: n }));
 	}
 	async rollbackFlow(e, t, n, r = {}) {
-		return tm(await this.request(`/v1/flows/${X(e)}/publications/${X(t)}/rollback`, {
+		return im(await this.request(`/v1/flows/${X(e)}/publications/${X(t)}/rollback`, {
 			body: JSON.stringify({
 				expectedLivePublicationId: n,
 				version: 1
 			}),
-			headers: { "idempotency-key": r.idempotencyKey ?? Cm("publication") },
+			headers: { "idempotency-key": r.idempotencyKey ?? Em("publication") },
 			method: "POST"
 		}));
 	}
 	async getRun(e, t) {
-		return mm(await this.request(`/v1/runs/${X(e)}`, { signal: t }));
+		return _m(await this.request(`/v1/runs/${X(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), t.pendingWait != null && n.set("pendingWait", String(t.pendingWait)), t.source != null && n.set("source", t.source), t.createdFrom != null && n.set("createdFrom", t.createdFrom), t.createdBefore != null && n.set("createdBefore", t.createdBefore), t.runId != null && n.set("runId", t.runId);
 		let r = n.size == 0 ? "" : `?${n}`;
-		return hm(await this.request(`/v1/flows/${X(e)}/runs${r}`));
+		return vm(await this.request(`/v1/flows/${X(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 Sm(await this.request(`/v1/runs/${X(e)}/events${i}`, { signal: n }));
+		return Tm(await this.request(`/v1/runs/${X(e)}/events${i}`, { signal: n }));
 	}
 	async listRunResults(e, t, n) {
-		return Vp(await this.request(`/v1/runs/${X(e)}/results${t == null ? "" : `?after=${encodeURIComponent(t)}`}`, { signal: n }));
+		return Wp(await this.request(`/v1/runs/${X(e)}/results${t == null ? "" : `?after=${encodeURIComponent(t)}`}`, { signal: n }));
 	}
 	async readRunResult(e, t, n = {}, r) {
 		let i = new URLSearchParams(Object.entries(n).map(([e, t]) => [e, String(t)]));
-		return Hp(await this.request(`/v1/runs/${X(e)}/results/${X(t)}?${i}`, { signal: r }));
+		return Gp(await this.request(`/v1/runs/${X(e)}/results/${X(t)}?${i}`, { signal: r }));
 	}
 	async downloadRunResult(e, t, n) {
 		return (await this.response(`/v1/runs/${X(e)}/results/${X(t)}/content`, { signal: n })).blob();
 	}
 	async getRunResult(e, t) {
-		return vm(await this.request(`/v1/runs/${X(e)}/result`, { signal: t }));
+		return xm(await this.request(`/v1/runs/${X(e)}/result`, { signal: t }));
 	}
 	async cancelRun(e) {
-		return gm(await this.request(`/v1/runs/${X(e)}/cancel`, {
+		return ym(await this.request(`/v1/runs/${X(e)}/cancel`, {
 			body: JSON.stringify({ version: 1 }),
 			method: "POST"
 		}));
 	}
 	async resolveRunWait(e, t, n, r) {
-		return _m(await this.request(`/v1/runs/${X(e)}/waits/${X(t)}/resolve`, {
+		return bm(await this.request(`/v1/runs/${X(e)}/waits/${X(t)}/resolve`, {
 			body: JSON.stringify({
 				action: n,
 				comment: r,
@@ -8931,7 +9009,7 @@ var wm = class {
 		let n = Object.entries(e).map(([e, t]) => `${X(e)}=${X(t)}`).join("&"), r = n == "" ? "" : `?${n}`;
 		return this.connectorRequest(`/v1/connector/actions${r}`, "actions", t, (e) => {
 			let t = F(e);
-			return L(t, ["actions", "version"]), t.version != 1 || !Array.isArray(t.actions) ? P() : t.actions.map($l);
+			return L(t, ["actions", "version"]), t.version != 1 || !Array.isArray(t.actions) ? P() : t.actions.map(tu);
 		});
 	}
 	async connectorRequest(e, t, n, r, i = !1) {
@@ -8970,13 +9048,13 @@ var wm = class {
 function Z(e, t) {
 	if (!e) throw Error(t);
 }
-async function Tm(e, t, n) {
+async function Om(e, t, n) {
 	let r = await e.request(new Request(new URL("/v1/mcp", e.origin), {
 		method: "POST",
 		headers: {
 			"content-type": "application/json",
 			accept: "application/json, text/event-stream",
-			"mcp-protocol-version": Dm,
+			"mcp-protocol-version": Am,
 			"mcp-method": t,
 			...t == "tools/call" ? { "mcp-name": String(n?.name) } : {}
 		},
@@ -8987,7 +9065,7 @@ async function Tm(e, t, n) {
 			params: {
 				...n,
 				_meta: {
-					"io.modelcontextprotocol/protocolVersion": Dm,
+					"io.modelcontextprotocol/protocolVersion": Am,
 					"io.modelcontextprotocol/clientCapabilities": {}
 				}
 			}
@@ -8997,13 +9075,13 @@ async function Tm(e, t, n) {
 	let i = await r.text(), a = r.headers.get("content-type")?.includes("text/event-stream") ? JSON.parse(i.split("\n").findLast((e) => e.startsWith("data:"))?.slice(5) ?? "null") : JSON.parse(i);
 	return Z(a != null && a.error == null, `MCP ${t} failed: ${JSON.stringify(a)}.`), a.result;
 }
-var Em = [
+var km = [
 	{
 		name: "publishes the public MCP catalog, input schemas and annotations",
 		async verify(e) {
-			let t = await Tm(e, "tools/list");
-			Z(Array.isArray(t.tools), "MCP tools must be an array."), Z(t.tools.length == Object.keys(Pm).length, "MCP tool count differs from the public contract.");
-			for (let [e, n] of Object.entries(Pm)) {
+			let t = await Om(e, "tools/list");
+			Z(Array.isArray(t.tools), "MCP tools must be an array."), Z(t.tools.length == Object.keys(Lm).length, "MCP tool count differs from the public contract.");
+			for (let [e, n] of Object.entries(Lm)) {
 				let r = t.tools.find((t) => t.name == e);
 				Z(r != null, `Missing MCP tool ${e}.`), Z(r.description == n.description, `${e} description differs.`), Z(Uc(r.annotations, n.annotations), `${e} annotations differ.`);
 				let { $schema: i, ...a } = n.inputSchema["~standard"].jsonSchema.input(), { $schema: o, ...s } = r.inputSchema;
@@ -9014,7 +9092,7 @@ var Em = [
 	{
 		name: "shares Run pagination, status filters and cancellation between MCP and REST",
 		async verify(e) {
-			let t = new wm((t, n) => e.request(new Request(new URL(t, e.origin), n))), n = await t.createFlow("MCP Run listing"), r = await t.changeDraft(n.flowId, n.draftRevisionId, [{
+			let t = new Dm((t, n) => e.request(new Request(new URL(t, e.origin), n))), n = await t.createFlow("MCP Run listing"), r = await t.changeDraft(n.flowId, n.draftRevisionId, [{
 				kind: "graph.node.create",
 				target: { kind: "flow" },
 				nodeId: "start",
@@ -9032,7 +9110,7 @@ var Em = [
 				}
 			}, a = [];
 			for (let t = 0; t < 2; t++) {
-				let t = (await Tm(e, "tools/call", {
+				let t = (await Om(e, "tools/call", {
 					name: "flow_run",
 					arguments: {
 						...i,
@@ -9041,7 +9119,7 @@ var Em = [
 				})).structuredContent;
 				Z(typeof t.runId == "string", "MCP must return an accepted Run ID."), a.push(t.runId);
 			}
-			let o = (await Tm(e, "tools/call", {
+			let o = (await Om(e, "tools/call", {
 				name: "run_list",
 				arguments: {
 					flowId: n.flowId,
@@ -9055,24 +9133,24 @@ var Em = [
 			});
 			Z(s.runs.length == 1 && s.runs[0]?.runId != o.runs[0]?.runId, "REST must continue the MCP Run cursor without duplicates.");
 			let c = await t.listRuns(n.flowId, { limit: 1 });
-			Z(Uc((await Tm(e, "tools/call", {
+			Z(Uc((await Om(e, "tools/call", {
 				name: "run_list",
 				arguments: {
 					flowId: n.flowId,
 					cursor: c.nextCursor,
 					limit: 1
 				}
-			})).structuredContent, s), "MCP must continue the REST Run cursor."), await Tm(e, "tools/call", {
+			})).structuredContent, s), "MCP must continue the REST Run cursor."), await Om(e, "tools/call", {
 				name: "run_cancel",
 				arguments: { runId: a[0] }
-			}), Z(Uc((await Tm(e, "tools/call", {
+			}), Z(Uc((await Om(e, "tools/call", {
 				name: "run_list",
 				arguments: {
 					flowId: n.flowId,
 					status: "canceled"
 				}
 			})).structuredContent, await t.listRuns(n.flowId, { status: "canceled" })), "MCP and REST status filters differ.");
-			let l = await Tm(e, "tools/call", {
+			let l = await Om(e, "tools/call", {
 				name: "run_list",
 				arguments: {
 					flowId: (await t.createFlow("Other Run scope")).flowId,
@@ -9088,7 +9166,7 @@ var Em = [
 			let t = {
 				name: "MCP conformance",
 				idempotencyKey: crypto.randomUUID()
-			}, n = () => Tm(e, "tools/call", {
+			}, n = () => Om(e, "tools/call", {
 				name: "flow_create",
 				arguments: t
 			}), r = await n();
@@ -9097,7 +9175,7 @@ var Em = [
 			Z(typeof i.flowId == "string", "MCP did not return a Flow ID."), Z(Uc((await n()).structuredContent, i), "MCP mutation replay changed identity.");
 			let a = await e.request(new Request(new URL(`/v1/flows/${encodeURIComponent(i.flowId)}/draft`, e.origin)));
 			Z(a.ok, "REST cannot read the Flow created through MCP."), Z((await a.json()).revisionId == i.draftRevisionId, "MCP and REST disagree on the Draft head.");
-			let o = await Tm(e, "tools/call", {
+			let o = await Om(e, "tools/call", {
 				name: "flow_create",
 				arguments: {
 					...t,
@@ -9107,7 +9185,7 @@ var Em = [
 			Z(o.isError == 1, "MCP must reject a changed idempotent replay."), Z(o.structuredContent.error.code == "flow.conflict", "MCP must preserve the Control error code.");
 		}
 	}
-], Dm = "2026-07-28", Om = Vc(), Q = S().min(1), km = Q.max(256).describe("Stable identity for this mutation. Retry with the same key and identical arguments, even after a lost response."), Am = Zs().min(1).max(100).default(50), jm = Q.describe("Exact Flow ID returned by flow_list or flow_create."), Mm = Q.describe("Exact Run ID returned by flow_run or run_list."), Nm = "Use flow_list and flow_get to inspect a Flow. Use flow_node_get with the observed revisionId for individual node schemas or code. Use flow_schema to learn atomic edit operations, then flow_apply with the observed expectedRevisionId and a stable idempotencyKey. Use flow_check before flow_run. Select an explicit Trigger node ID and fixed revision or publication. A new Flow has no Trigger until you add one. Use flow_publish to publish a fixed Revision, then poll flow_publish_status until succeeded or failed. Use flow_set_enabled to enable or disable the observed Live publication. flow_run returns an accepted Run, not its final result. Find Runs with run_list, poll run_get and use run_result after terminal. Resolve a waiting Run only with an explicit run_resolve_wait action allowed by run_get. Use run_results and run_result_read to inspect stored Agent tool results; these are separate from the terminal Run result. Retry flow_create, flow_apply, flow_publish and flow_run only with identical arguments and the same idempotencyKey; a new key can execute the Flow again. Other mutations use the same resource identity and arguments when retrying. Cancel a Run explicitly with run_cancel. Use nextCursor and nextAfter to read subsequent pages. Connector-backed deployments may require a Team; inspect connector_teams before creating a Flow.";
+], Am = "2026-07-28", jm = Vc(), Q = S().min(1), Mm = Q.max(256).describe("Stable identity for this mutation. Retry with the same key and identical arguments, even after a lost response."), Nm = Zs().min(1).max(100).default(50), Pm = Q.describe("Exact Flow ID returned by flow_list or flow_create."), Fm = Q.describe("Exact Run ID returned by flow_run or run_list."), Im = "Use flow_list and flow_get to inspect a Flow. Use flow_node_get with the observed revisionId for individual node schemas or code. Use flow_schema to learn atomic edit operations, then flow_apply with the observed expectedRevisionId and a stable idempotencyKey. Use flow_check before flow_run. Select an explicit Trigger node ID and fixed revision or publication. A new Flow has no Trigger until you add one. Before adding a Feishu Trigger, use event_source_list and compare its Connection IDs with connector_connections in the Flow scope. If no source is available, create and verify one in Workbench. Use flow_publish to publish a fixed Revision, then poll flow_publish_status until succeeded or failed. Use flow_set_enabled to enable or disable the observed Live publication. flow_run returns an accepted Run, not its final result. Find Runs with run_list, poll run_get and use run_result after terminal. Resolve a waiting Run only with an explicit run_resolve_wait action allowed by run_get. Use run_results and run_result_read to inspect stored Agent tool results; these are separate from the terminal Run result. Retry flow_create, flow_apply, flow_publish and flow_run only with identical arguments and the same idempotencyKey; a new key can execute the Flow again. Other mutations use the same resource identity and arguments when retrying. Cancel a Run explicitly with run_cancel. Use nextCursor and nextAfter to read subsequent pages. Connector-backed deployments may require a Team; inspect connector_teams before creating a Flow.";
 function $(e, t, n) {
 	return {
 		description: e,
@@ -9134,17 +9212,17 @@ function $(e, t, n) {
 		} }
 	};
 }
-var Pm = {
+var Lm = {
 	flow_list: $("List Flows in this deployment. Continue with nextCursor; cursors are compatible with the Control API.", O({
 		cursor: Q.optional(),
-		limit: Am
+		limit: Nm
 	}), !0),
 	flow_get: $("Read a compact Draft graph with input bindings, port handles, subflows and Live status. Use full=true for complete Revision content, schemas, source code and exact before values required by complex edits. Unreadable Drafts return draft=null and draftIssue; flow.live still identifies the published version. Use draft.revisionId as the base of an edit.", O({
-		flowId: jm,
+		flowId: Pm,
 		full: T().optional()
 	}), !0),
 	flow_node_get: $("Read one node and its Task definition or code module from a fixed Revision. Omit subflowId for the root graph. Use revisionId from flow_get; the returned node contains exact before values for edits.", O({
-		flowId: jm,
+		flowId: Pm,
 		revisionId: Q,
 		nodeId: Q,
 		subflowId: Q.optional()
@@ -9155,78 +9233,78 @@ var Pm = {
 	}).refine((e) => e.kind == null || e.example == null, "Choose kind or example, not both."), !0),
 	flow_create: $("Create an empty Flow. If this deployment uses OOMOL Connector, choose a teamId from connector_teams. Keep the key and arguments stable when retrying.", O({
 		name: Q.refine((e) => e == e.trim() && Fl(e) == null, "Flow name is invalid."),
-		idempotencyKey: km,
+		idempotencyKey: Mm,
 		teamId: Q.optional()
 	}), !1),
 	flow_apply: $("Apply ordered atomic changes. Read flow_schema first. A stale expectedRevisionId is a conflict; reread the Draft before deciding on a new edit.", O({
-		flowId: jm,
+		flowId: Pm,
 		expectedRevisionId: Q,
-		idempotencyKey: km,
-		operations: E(Om).min(1).describe("Change operations defined by flow_schema. Explicit IDs and before values refer to the base Revision.")
+		idempotencyKey: Mm,
+		operations: E(jm).min(1).describe("Change operations defined by flow_schema. Explicit IDs and before values refer to the base Revision.")
 	}), !1),
 	flow_check: $("Validate a fixed Revision and return diagnostics. Get its revisionId from flow_get or flow_apply.", O({
-		flowId: jm,
+		flowId: Pm,
 		revisionId: Q
 	}), !0),
 	flow_publish: $("Publish a fixed Revision. Supply the observed Live publication ID, or null for the first publication, and a stable idempotencyKey. Returns an operation; poll flow_publish_status for success or failure.", O({
-		flowId: jm,
+		flowId: Pm,
 		revisionId: Q,
 		expectedLivePublicationId: Q.nullable(),
-		idempotencyKey: km
+		idempotencyKey: Mm
 	}), !1),
 	flow_publish_status: $("Read a publish operation. Only succeeded confirms publication; failed includes the failure details. Keep polling while pending.", O({
-		flowId: jm,
+		flowId: Pm,
 		operationId: Q
 	}), !0),
 	flow_set_enabled: $("Enable or disable a published Flow. Supply expectedPublicationId from flow_get; a changed Live publication is a conflict. This does not cancel accepted Runs; use run_cancel for those.", O({
-		flowId: jm,
+		flowId: Pm,
 		expectedPublicationId: Q,
 		enabled: T()
 	}), !1),
 	flow_run: $("Start a Run and return its runId. For draft supply flowId and revisionId; for live supply publicationId. Always fix the source, Trigger and idempotencyKey. Poll run_get for completion.", lc("source", [O({
 		source: j("draft"),
-		flowId: jm,
+		flowId: Pm,
 		revisionId: Q,
 		trigger: O({
 			nodeId: Q,
-			outputs: A(S(), Om)
+			outputs: A(S(), jm)
 		}),
-		inputs: A(S(), A(S(), Om)).default({}),
-		idempotencyKey: km
+		inputs: A(S(), A(S(), jm)).default({}),
+		idempotencyKey: Mm
 	}), O({
 		source: j("live"),
 		publicationId: Q,
 		trigger: O({
 			nodeId: Q,
-			outputs: A(S(), Om)
+			outputs: A(S(), jm)
 		}),
-		inputs: A(S(), A(S(), Om)).default({}),
-		idempotencyKey: km
+		inputs: A(S(), A(S(), jm)).default({}),
+		idempotencyKey: Mm
 	})]).meta({ type: "object" }), !1),
 	run_list: $("List Runs for a Flow, optionally filtered by status. Continue with nextCursor; cursors are compatible with the Control API.", O({
-		flowId: jm,
+		flowId: Pm,
 		pendingWait: T().optional(),
 		status: mc(Wc).optional(),
 		cursor: Q.optional(),
-		limit: Am
+		limit: Nm
 	}), !0),
-	run_get: $("Read Run status, including waiting details and allowed actions. Completed, failed, canceled and indeterminate are terminal.", O({ runId: Mm }), !0),
+	run_get: $("Read Run status, including waiting details and allowed actions. Completed, failed, canceled and indeterminate are terminal.", O({ runId: Fm }), !0),
 	run_events: $("Read one page of Run events. Continue with nextAfter. Events can expire independently of the terminal result.", O({
-		runId: Mm,
+		runId: Fm,
 		after: Zs().min(0).default(0),
-		limit: Am
+		limit: Nm
 	}), !0),
-	run_result: $("Read the terminal result. A queued, running or waiting Run returns run.not-terminal; inspect run_get first.", O({ runId: Mm }), !0),
+	run_result: $("Read the terminal result. A queued, running or waiting Run returns run.not-terminal; inspect run_get first.", O({ runId: Fm }), !0),
 	run_results: $("List stored Agent tool result metadata for a Run, including Connector and code results. Continue with nextAfter as after. Use run_result_read to inspect content.", O({
-		runId: Mm,
+		runId: Fm,
 		after: Q.optional()
 	}), !0),
 	run_result_read: $("Read a bounded page of a stored Agent tool result. Select a JSON Pointer with pointer and continue with nextOffset as offset at the same pointer. A complete value contains all data at that pointer.", Il.extend({
-		runId: Mm,
+		runId: Fm,
 		resultId: Q
 	}), !0),
 	run_resolve_wait: $("Explicitly resolve the waitId observed in run_get with one of its allowed actions. Optional comment records the reason (up to 2,000 Unicode code points). The first decision and comment win; inspect resolutionAccepted and action. Resume the same Run and poll run_get; do not create a replacement Run.", O({
-		runId: Mm,
+		runId: Fm,
 		waitId: Q,
 		action: mc([
 			"approve",
@@ -9235,45 +9313,46 @@ var Pm = {
 		]),
 		comment: Gc
 	}), !1),
-	run_cancel: $("Explicitly cancel a Run. Inspect cancelAccepted and the authoritative status; completion can win the race.", O({ runId: Mm }), !1),
+	run_cancel: $("Explicitly cancel a Run. Inspect cancelAccepted and the authoritative status; completion can win the race.", O({ runId: Fm }), !1),
 	flow_code_connections: $("Read the connections shared by all Code nodes in this Flow. With publicationId, read the fixed published snapshot; it cannot be edited.", O({
-		flowId: jm,
+		flowId: Pm,
 		publicationId: Q.optional()
 	}), !0),
 	flow_connection_candidates: $("List connections and permissions available to select. Node selections do not add shared Code usage.", O({
-		flowId: jm,
+		flowId: Pm,
 		providerIds: E(Q).min(1)
 	}), !0),
 	flow_code_connection_set: $("Add or remove shared Code usage in the Draft only. Does not change node selections or published versions. Use the observed accessRevision.", O({
-		flowId: jm,
+		flowId: Pm,
 		providerId: Q,
 		accessBindingId: Q,
 		selected: T(),
 		expectedAccessRevision: Zs().nonnegative()
 	}), !1),
 	flow_connection_usage_remove: $("Remove a connection from all node selections and shared Code usage in this Draft atomically. Keeps the account, published versions and accepted Runs. Use the observed revisionId and accessRevision.", O({
-		flowId: jm,
+		flowId: Pm,
 		connectionId: Q,
 		expectedRevisionId: Q,
 		expectedAccessRevision: Zs().nonnegative(),
-		idempotencyKey: km
+		idempotencyKey: Mm
 	}), !1),
 	connector_teams: $("List OOMOL Teams available for Flow creation. An unconfigured or custom Connector may not provide Teams.", O({}), !0),
-	connector_providers: $("List Connector providers available in the Flow scope.", O({ flowId: jm.optional() }), !0),
+	connector_providers: $("List Connector providers available in the Flow scope.", O({ flowId: Pm.optional() }), !0),
 	connector_search: $("Search Connector action summaries in the Flow scope. Read complete schemas with connector_get after selecting an action.", O({
 		query: S().trim().min(1).max(256),
-		flowId: jm.optional()
+		flowId: Pm.optional()
 	}), !0),
 	connector_get: $("Read a Connector action, input/output definitions and connection requirements before authoring a node.", O({
 		actionId: Q,
-		flowId: jm.optional()
+		flowId: Pm.optional()
 	}), !0),
 	connector_connections: $("List Connector connections in the Flow scope. Use active connection IDs in bindings.", O({
 		serviceId: Q.max(256),
-		flowId: jm.optional()
+		flowId: Pm.optional()
 	}), !0),
+	event_source_list: $("List independent Feishu event sources, including Team, Connection, event types, enabled and verification status. Inspect consumers for Flows actually using each source.", O({}), !0),
 	trigger_search: $("Search provider Trigger summaries; omit query to list all. Flow trigger instances are in flow_get. Manual, Webhook and Cron are built-in node kinds described by flow_schema.", O({ query: S().trim().min(1).max(256).optional() }), !0),
 	trigger_get: $("Read a provider Trigger definition before creating its node.", O({ key: Q }), !0)
 };
 //#endregion
-export { Em as mcpConformanceCases, Nm as mcpInstructions, Dm as mcpProtocolVersion, Pm as mcpTools };
+export { km as mcpConformanceCases, Im as mcpInstructions, Am as mcpProtocolVersion, Lm as mcpTools };