@oomol-lab/open-flow 0.1.0-beta.53 → 0.1.0-beta.55

package/dist/common/scheduler.js

@@ -2267,6 +2267,70 @@ var $ZodUnion = /*@__PURE__*/ $constructor("$ZodUnion", (inst, def) => {
 		});
 	};
 });
+function discriminatorMap(def) {
+	const map = /* @__PURE__ */ new Map();
+	for (const option of def.options) {
+		const values = option._zod.propValues?.[def.discriminator];
+		if (!values || values.size === 0) throw new Error(`Invalid discriminated union option at index "${def.options.indexOf(option)}"`);
+		for (const value of values) if (map.has(value)) {
+			if (value !== void 0) throw new Error(`Duplicate discriminator value "${String(value)}"`);
+			map.set(value, null);
+		} else map.set(value, option);
+	}
+	return map;
+}
+var $ZodDiscriminatedUnion = /*@__PURE__*/ $constructor("$ZodDiscriminatedUnion", (inst, def) => {
+	def.inclusive = false;
+	$ZodUnion.init(inst, def);
+	const _super = inst._zod.parse;
+	defineLazyInternal(inst, "propValues", (zod) => {
+		const propValues = {};
+		let undefinedCount = 0;
+		for (const option of zod.def.options) {
+			const pv = option._zod.propValues;
+			if (!pv || Object.keys(pv).length === 0) throw new Error(`Invalid discriminated union option at index "${zod.def.options.indexOf(option)}"`);
+			if (pv[zod.def.discriminator]?.has(void 0)) undefinedCount++;
+			for (const [k, v] of Object.entries(pv)) {
+				if (!Object.prototype.hasOwnProperty.call(propValues, k)) assignProp(propValues, k, /* @__PURE__ */ new Set());
+				for (const val of v) propValues[k].add(val);
+			}
+		}
+		if (!zod.def.unionFallback && undefinedCount > 1) propValues[zod.def.discriminator]?.delete(void 0);
+		return propValues;
+	});
+	def.options.forEach((option, i) => {
+		const propShape = rawShape(option._zod.def);
+		if (propShape && !Object.prototype.hasOwnProperty.call(propShape, def.discriminator)) throw new Error(`Invalid discriminated union option at index "${i}"`);
+	});
+	const disc = cached(() => discriminatorMap(def));
+	inst._zod.parse = (payload, ctx) => {
+		const input = payload.value;
+		if (!isObject$1(input)) {
+			payload.issues.push({
+				code: "invalid_type",
+				expected: "object",
+				input,
+				inst
+			});
+			return payload;
+		}
+		const value = input?.[def.discriminator];
+		const opt = disc.value.get(value);
+		if (opt && (value !== void 0 || ctx.direction !== "backward")) return opt._zod.run(payload, ctx);
+		if (def.unionFallback || ctx.direction === "backward") return _super(payload, ctx);
+		payload.issues.push({
+			code: "invalid_union",
+			errors: [],
+			note: "No matching discriminator",
+			discriminator: def.discriminator,
+			options: Array.from(disc.value.keys()).filter((value) => disc.value.get(value) !== null),
+			input,
+			path: [def.discriminator],
+			inst
+		});
+		return payload;
+	};
+});
 var $ZodIntersection = /*@__PURE__*/ $constructor("$ZodIntersection", (inst, def) => {
 	$ZodType.init(inst, def);
 	inst._zod.parse = (payload, ctx) => {
@@ -5315,6 +5379,18 @@ function union(options, params) {
 		...normalizeParams(params)
 	});
 }
+var ZodDiscriminatedUnion = /*@__PURE__*/ $constructor("ZodDiscriminatedUnion", (inst, def) => {
+	ZodUnion.init(inst, def);
+	$ZodDiscriminatedUnion.init(inst, def);
+});
+function discriminatedUnion(discriminator, options, params) {
+	return new ZodDiscriminatedUnion({
+		type: "union",
+		options,
+		discriminator,
+		...normalizeParams(params)
+	});
+}
 var ZodIntersection = /*@__PURE__*/ $constructor("ZodIntersection", (inst, def) => {
 	$ZodIntersection.init(inst, def);
 	ZodType.init(inst, def);
@@ -6504,865 +6580,76 @@ function dequal(foo, bar) {
 	return foo !== foo && bar !== bar;
 }
 //#endregion
-//#region src/flow/common/triggerScheduleSchema.ts
-var triggerScheduleSchema = array(union([object({
-	type: literal("cron"),
-	expression: string(),
-	timezone: string()
-}), object({
-	type: literal("every"),
-	unit: _enum([
-		"day",
-		"hour",
-		"minute",
-		"month",
-		"week"
-	]),
-	value: number()
-})]));
-//#endregion
-//#region src/flow/common/webhookMethod.ts
-var webhookMethods = [
-	"GET",
-	"POST",
-	"PUT",
-	"PATCH",
-	"DELETE"
-];
-function webhookSupportsBody(method) {
-	return method !== "GET";
+//#region src/json-schema-subset/utils.ts
+var nextId = 0;
+function createId() {
+	const id = nextId;
+	nextId += 1;
+	return id;
 }
-var text = string();
-var json = json$1();
-var strings = array(text);
-var port = object({
-	description: text.optional(),
-	jsonSchema: json,
-	nullable: boolean(),
-	handle: text
-});
-var input = port.extend({ value: json.optional() });
-var group = object({
-	collapsed: boolean().optional(),
-	group: text
-});
-var nodeSource = object({
-	kind: literal("node"),
-	nodeId: text,
-	output: text,
-	field: text.optional()
-});
-var flowSource = object({
-	kind: literal("flow"),
-	input: text
+function deepFreeze(target) {
+	if (typeof target === "object" && target !== null && !Object.isFrozen(target)) {
+		for (const key of Object.getOwnPropertyNames(target)) deepFreeze(Reflect.get(target, key));
+		Object.freeze(target);
+	}
+	return target;
+}
+function pick(target, keys) {
+	const newTarget = {};
+	for (const key of keys) if (key in target) newTarget[key] = target[key];
+	return newTarget;
+}
+function deepCopy(value) {
+	if (typeof value !== "object" || value === null) return value;
+	else if (Array.isArray(value)) {
+		const array = [];
+		for (const [i, element] of value.entries()) array[i] = deepCopy(element);
+		return array;
+	} else {
+		const newObject = {};
+		for (const key in value) newObject[key] = deepCopy(value[key]);
+		return newObject;
+	}
+}
+function isDeepEquals(value1, value2) {
+	if (value1 === value2) return true;
+	if (value1 === null) return false;
+	if (typeof value1 !== "object") return false;
+	if (typeof value1 !== typeof value2) return false;
+	if (Array.isArray(value1)) {
+		if (!Array.isArray(value2)) return false;
+		if (value1.length !== value2.length) return false;
+		for (const [i, value1Element] of value1.entries()) if (!isDeepEquals(value1Element, value2[i])) return false;
+	} else {
+		if (Array.isArray(value2)) return false;
+		for (const key in value1) {
+			if (!(key in value2)) return false;
+			if (!isDeepEquals(value1[key], value2[key])) return false;
+		}
+		for (const key in value2) if (!(key in value1)) return false;
+	}
+	return true;
+}
+//#endregion
+//#region src/json-schema-subset/expression/result.ts
+var ExpressionSingleResult = Object.freeze({
+	Equals: 0,
+	Containing: 1,
+	ContainedBy: 2,
+	Rejection: 3,
+	Intersection: 4
 });
-var source = union([
-	nodeSource,
-	flowSource,
-	object({
-		kind: literal("binding"),
-		bindingId: text
-	})
-]);
-var fixedInput = union([object({ kind: literal("unset") }), object({
-	kind: literal("value"),
-	value: json
-})]);
-var mapping = union([fixedInput, object({
-	kind: literal("sources"),
-	sources: array(source)
-})]);
-var inputs = record(text, mapping);
-var ports = {
-	inputs: array(union([input, group])),
-	outputs: array(union([port, group]))
-};
-var capability = union([
-	strictObject({
-		kind: literal("connector"),
-		action: text,
-		connectionId: text.optional(),
-		connections: array(strictObject({
-			connectionId: text,
-			alias: text.optional()
-		}))
-	}),
-	strictObject({
-		kind: literal("connector"),
-		mode: literal("shared")
-	}),
-	strictObject({
-		kind: literal("connector"),
-		mode: literal("independent"),
-		actions: array(strictObject({
-			action: text,
-			connectionId: text.optional()
-		}))
-	}),
-	strictObject({
-		kind: literal("connector"),
-		actionHints: array(text).optional(),
-		connectionHints: array(strictObject({
-			action: text,
-			connectionId: text,
-			alias: text.optional()
-		})).optional()
-	})
-]);
-var inline = object({
-	...ports,
-	name: text,
-	moduleId: text,
-	capabilities: array(capability).optional()
-});
-var agentValue = union([object({
-	kind: literal("value"),
-	value: json
-}), object({
-	kind: literal("input"),
-	input: text
-})]);
-var agentInput$1 = union([agentValue, object({ kind: literal("model") })]);
-var managed = object({
-	...ports,
-	name: text,
-	executor: union([
-		object({
-			kind: literal("connector"),
-			action: text,
-			connectionId: text.optional()
-		}),
-		object({
-			kind: literal("openapi"),
-			sourceUrl: text,
-			method: text,
-			path: text,
-			serverUrl: text,
-			document: json,
-			auth: array(object({
-				id: text,
-				type: _enum([
-					"bearer",
-					"basic",
-					"apiKey"
-				]),
-				name: text.optional(),
-				in: _enum(["header", "query"]).optional()
-			}))
-		}),
-		object({
-			kind: literal("llm"),
-			mode: _enum(["chat", "json"])
-		}),
-		object({
-			kind: literal("agent"),
-			code: boolean().optional(),
-			model: text,
-			prompt: text,
-			maxRounds: number(),
-			tools: array(object({
-				id: text,
-				name: text,
-				description: text,
-				action: text,
-				connectionId: text.optional(),
-				approval: boolean(),
-				inputs: array(input.extend({ source: agentInput$1 }))
-			})),
-			notification: object({
-				taskId: text,
-				messageHandle: text,
-				inputs: record(text, agentValue)
-			}).optional()
-		})
-	])
-});
-var operand = union([object({
-	kind: literal("value"),
-	value: json.optional(),
-	jsonSchema: json.optional()
-}), object({
-	kind: literal("source"),
-	source
-})]);
-var condition = {
-	matchMode: _enum(["first", "all"]),
-	cases: array(object({
-		description: text.optional(),
-		output: text,
-		groups: array(object({ expressions: array(object({
-			left: operand,
-			operator: _enum([
-				"!=",
-				"<",
-				"<=",
-				"==",
-				">",
-				">=",
-				"contains",
-				"endsWith",
-				"hasKey",
-				"hasValue",
-				"isEmpty",
-				"isFalse",
-				"isNotEmpty",
-				"isNotNull",
-				"isNull",
-				"isTrue",
-				"notContains",
-				"notHasKey",
-				"notHasValue",
-				"startsWith"
-			]),
-			right: operand.optional()
-		})) }))
-	}))
-};
-var wait = {
-	inputDefinitions: array(input),
-	prompt: text
-};
-var webhookOptions = object({
-	allowedMethods: never().optional(),
-	allowedOrigins: strings.optional(),
-	noResponseBody: never().optional(),
-	responseData: text.optional(),
-	responseHeaders: record(text, text).optional(),
-	responseStatusCode: number().int().min(200).max(599).optional()
-});
-var webhook = {
-	bodyFields: array(input),
-	method: _enum(webhookMethods),
-	options: webhookOptions.optional()
-};
-var definition = {
-	configInputs: ports.inputs,
-	definitionVersion: literal(2),
-	description: text,
-	displayName: text,
-	key: text,
-	name: text,
-	outputs: array(port).refine((definitions) => new Set(definitions.map((output) => output.handle)).size === definitions.length, "Duplicate Trigger output handle."),
-	provider: text
-};
-var endpoint = object({
-	body: object({
-		allowArray: boolean(),
-		allowEmpty: boolean(),
-		formats: array(_enum([
-			"form",
-			"json",
-			"multipart",
-			"text"
-		]))
-	}),
-	methods: array(_enum([
-		"DELETE",
-		"GET",
-		"HEAD",
-		"PATCH",
-		"POST",
-		"PUT"
-	])),
-	successStatus: number()
-});
-var sourceFlowIds = array(text.min(1)).refine((ids) => new Set(ids).size === ids.length, "Duplicate source Flow ID.");
-var trigger = {
-	name: text,
-	description: text.optional(),
-	icon: text.optional()
-};
-var base = {
-	maxExecutions: number().int().positive().max(Number.MAX_SAFE_INTEGER).optional(),
-	inputs,
-	name: text.optional(),
-	description: text.optional(),
-	icon: text.optional(),
-	timeoutMs: number().optional()
-};
-var node = union([
-	object({
-		...base,
-		inputs: record(text, never()),
-		kind: literal("condition"),
-		...condition
-	}),
-	object({
-		...base,
-		inputs: unknown().transform(() => ({})).default({}),
-		kind: literal("value"),
-		values: array(input)
-	}),
-	object({
-		...base,
-		kind: literal("subflow"),
-		subflowId: text
-	}),
-	object({
-		...base,
-		kind: literal("task"),
-		task: inline,
-		additionalInputs: array(input).optional()
-	}),
-	object({
-		...base,
-		kind: literal("task"),
-		taskId: text,
-		additionalInputs: array(input).optional()
-	}),
-	strictObject({
-		...base,
-		kind: literal("approval"),
-		...wait
-	}).omit({ timeoutMs: true }),
-	strictObject({
-		...base,
-		kind: literal("wait"),
-		...wait
-	}).omit({ timeoutMs: true }),
-	object({
-		...trigger,
-		kind: literal("manual")
-	}),
-	strictObject({
-		...trigger,
-		kind: literal("error"),
-		sourceFlowIds: sourceFlowIds.optional()
-	}),
-	object({
-		...trigger,
-		kind: literal("webhook"),
-		...webhook
-	}),
-	object({
-		...trigger,
-		kind: literal("cron"),
-		cronTimes: triggerScheduleSchema
-	}),
-	object({
-		...trigger,
-		kind: literal("poll"),
-		connectionId: text.min(1).optional(),
-		config: record(text, fixedInput),
-		definition: object({
-			...definition,
-			type: literal("poll")
-		}),
-		pollTimes: triggerScheduleSchema
-	}),
-	object({
-		...trigger,
-		kind: literal("integration"),
-		connectionId: text.min(1).optional(),
-		config: record(text, fixedInput),
-		definition: object({
-			...definition,
-			type: literal("integration"),
-			endpoint
-		})
-	})
-]);
-var target = union([object({ kind: literal("flow") }), object({
-	kind: literal("subflow"),
-	id: text
-})]);
-var edge = object({
-	source: text,
-	target: text,
-	sourceHandle: text.optional()
-});
-var at = {
-	nodeId: text,
-	target
-};
-var subflow = object({
-	name: text,
-	inputs: array(input),
-	outputs: array(port.extend({ sources: array(union([nodeSource, flowSource])) }))
-});
-var graph = object({
-	nodes: record(text, node),
-	edges: array(edge).default([])
-});
-var binding = object({
-	kind: literal("variable"),
-	target: text
-});
-var module = object({
-	name: text,
-	imports: strings,
-	source: text
-});
-var document = object({
-	bindings: record(text, binding),
-	graph,
-	subflows: record(text, subflow.extend({ graph })),
-	tasks: record(text, managed)
-});
-object({
-	modelVersion: union([
-		literal(2),
-		literal(4),
-		literal(5)
-	]),
-	document,
-	modules: record(text, module)
-}).extend({
-	kind: literal("open-flow-flow-revision"),
-	version: literal(1)
-});
-var shapes = {
-	"graph.trigger.sources.set": {
-		nodeId: text,
-		before: sourceFlowIds.optional(),
-		value: sourceFlowIds.optional()
-	},
-	"binding.create": {
-		bindingId: text,
-		binding
-	},
-	"binding.delete": { bindingId: text },
-	"binding.target.set": {
-		bindingId: text,
-		before: text,
-		value: text
-	},
-	"graph.edge.connect": {
-		target,
-		edge
-	},
-	"graph.edge.disconnect": {
-		target,
-		edge
-	},
-	"graph.node.create": {
-		...at,
-		node
-	},
-	"graph.node.delete": at,
-	"graph.node.field.set": union([
-		object({
-			...at,
-			kind: literal("graph.node.field.set"),
-			field: literal("connectionId"),
-			before: text.min(1).optional(),
-			value: text.min(1).optional()
-		}),
-		object({
-			...at,
-			kind: literal("graph.node.field.set"),
-			field: _enum([
-				"description",
-				"icon",
-				"name"
-			]),
-			before: text.optional(),
-			value: text.optional()
-		}),
-		object({
-			...at,
-			kind: literal("graph.node.field.set"),
-			field: literal("maxExecutions"),
-			before: number().int().positive().max(Number.MAX_SAFE_INTEGER).optional(),
-			value: number().int().positive().max(Number.MAX_SAFE_INTEGER).optional()
-		}),
-		object({
-			...at,
-			kind: literal("graph.node.field.set"),
-			field: literal("timeoutMs"),
-			before: number().optional(),
-			value: number().optional()
-		})
-	]),
-	"graph.node.input.set": {
-		...at,
-		handle: text,
-		before: mapping.optional(),
-		value: mapping.optional()
-	},
-	"graph.node.additional-inputs.set": {
-		...at,
-		before: array(input).optional(),
-		value: array(input).optional()
-	},
-	"graph.node.condition.set": {
-		...at,
-		before: object(condition),
-		value: object(condition)
-	},
-	"graph.node.values.set": {
-		...at,
-		before: array(input),
-		value: array(input)
-	},
-	"graph.node.resolution.set": {
-		...at,
-		target: object({ kind: literal("flow") }),
-		before: object(wait),
-		value: object(wait)
-	},
-	"graph.node.webhook.set": {
-		...at,
-		target: object({ kind: literal("flow") }),
-		before: object(webhook),
-		value: object(webhook)
-	},
-	"graph.node.task.ports.set": {
-		...at,
-		before: object(ports),
-		value: object(ports)
-	},
-	"graph.node.task.name.set": {
-		...at,
-		before: text,
-		value: text
-	},
-	"graph.node.task.capabilities.set": {
-		...at,
-		before: array(capability).optional(),
-		value: array(capability).optional()
-	},
-	"graph.trigger.config.set": {
-		nodeId: text,
-		name: text,
-		before: fixedInput.optional(),
-		value: fixedInput.optional()
-	},
-	"graph.trigger.schedule.set": {
-		nodeId: text,
-		before: triggerScheduleSchema,
-		value: triggerScheduleSchema
-	},
-	"module.create": {
-		moduleId: text,
-		module
-	},
-	"module.delete": { moduleId: text },
-	"module.rename": {
-		moduleId: text,
-		before: text,
-		name: text
-	},
-	"module.source.replace": {
-		moduleId: text,
-		beforeImports: strings,
-		beforeSource: text,
-		imports: strings,
-		source: text
-	},
-	"subflow.create": {
-		subflowId: text,
-		subflow: subflow.extend({ graph })
-	},
-	"subflow.definition.set": {
-		subflowId: text,
-		before: subflow,
-		definition: subflow
-	},
-	"subflow.delete": { subflowId: text },
-	"task.create": {
-		taskId: text,
-		task: managed
-	},
-	"task.delete": { taskId: text },
-	"task.connector.connection.set": {
-		taskId: text,
-		before: text.optional(),
-		value: text.optional()
-	},
-	"task.openapi.set": {
-		taskId: text,
-		before: managed,
-		value: managed
-	},
-	"task.agent.set": {
-		taskId: text,
-		before: managed,
-		value: managed
-	},
-	"task.llm.mode.set": {
-		taskId: text,
-		before: _enum(["chat", "json"]),
-		value: _enum(["chat", "json"])
-	},
-	"task.name.set": {
-		taskId: text,
-		before: text,
-		value: text
-	}
-};
-array(union([...new Map(Object.entries(shapes).map(([kind, shape]) => [kind, shape instanceof ZodType ? shape : object({
-	kind: literal(kind),
-	...shape
-})])).values()])).min(1);
-//#endregion
-//#region src/flow/common/condition.ts
-var otherwiseOutput = "otherwise";
-var conditionOperators = [
-	"==",
-	"!=",
-	"<",
-	"<=",
-	">",
-	">=",
-	"contains",
-	"notContains",
-	"startsWith",
-	"endsWith",
-	"hasKey",
-	"notHasKey",
-	"hasValue",
-	"notHasValue",
-	"isEmpty",
-	"isNotEmpty",
-	"isNull",
-	"isNotNull",
-	"isTrue",
-	"isFalse"
-];
-var unaryOperator = (operator) => operator.startsWith("is");
-var operandHandle = (caseIndex, groupIndex, expressionIndex, side) => `${caseIndex}/${groupIndex}/${expressionIndex}/${side}`;
-/** Derived addresses let operand bindings use the ordinary input analysis and editor. Never persisted as node inputs. */
-function conditionOperands(node) {
-	return node.cases.flatMap((item, c) => item.groups.flatMap((group, g) => group.expressions.flatMap((expression, e) => [{
-		handle: operandHandle(c, g, e, "left"),
-		operand: expression.left,
-		expression,
-		side: "left"
-	}, ...!unaryOperator(expression.operator) ? [{
-		handle: operandHandle(c, g, e, "right"),
-		operand: expression.right ?? { kind: "value" },
-		expression,
-		side: "right"
-	}] : []])));
-}
-function nodeInputMappings(node) {
-	if (node.kind != "condition") return "inputs" in node ? node.inputs : {};
-	return Object.fromEntries(conditionOperands(node).flatMap(({ handle, operand }) => operand.kind == "source" ? [[handle, {
-		kind: "sources",
-		sources: [operand.source]
-	}]] : operand.value === void 0 ? [] : [[handle, {
-		kind: "value",
-		value: operand.value
-	}]]));
-}
-function conditionInputPorts(node) {
-	return Object.fromEntries(conditionOperands(node).map(({ handle, operand }) => [handle, {
-		jsonSchema: operand.kind === "value" ? operand.jsonSchema ?? {} : {},
-		nullable: operand.kind === "value" ? operand.value === null : true
-	}]));
-}
-function valueType(value) {
-	return value === null ? "null" : Array.isArray(value) ? "array" : typeof value;
-}
-function operatorsForType(type) {
-	if (type == null) return conditionOperators;
-	return [
-		"==",
-		"!=",
-		...{
-			number: [
-				"<",
-				"<=",
-				">",
-				">="
-			],
-			integer: [
-				"<",
-				"<=",
-				">",
-				">="
-			],
-			string: [
-				"contains",
-				"notContains",
-				"startsWith",
-				"endsWith",
-				"isEmpty",
-				"isNotEmpty"
-			],
-			array: [
-				"contains",
-				"notContains",
-				"isEmpty",
-				"isNotEmpty"
-			],
-			object: [
-				"hasKey",
-				"notHasKey",
-				"hasValue",
-				"notHasValue",
-				"isEmpty",
-				"isNotEmpty"
-			],
-			boolean: ["isTrue", "isFalse"],
-			null: []
-		}[type] ?? [],
-		"isNull",
-		"isNotNull"
-	];
-}
-var normalized = (type) => type == "integer" ? "number" : type;
-function comparisonIssue(operator, leftType, rightType) {
-	if (leftType != null && !operatorsForType(leftType).includes(operator)) return {
-		target: "operator",
-		message: `Operator ${operator} is not compatible with ${leftType}.`
-	};
-	if (unaryOperator(operator) || rightType == null) return;
-	const required = [
-		"<",
-		"<=",
-		">",
-		">="
-	].includes(operator) ? "number" : [
-		"startsWith",
-		"endsWith",
-		"hasKey",
-		"notHasKey"
-	].includes(operator) || ["contains", "notContains"].includes(operator) && leftType == "string" ? "string" : ["==", "!="].includes(operator) ? normalized(leftType) : void 0;
-	if (required != null && required != normalized(rightType)) return {
-		target: "right",
-		message: `Operator ${operator} requires a ${required} right operand.`
-	};
-}
-function compareCondition(operator, left, right) {
-	if (!unaryOperator(operator) && right === void 0) throw new Error("Condition right operand is missing.");
-	const issue = comparisonIssue(operator, valueType(left), right === void 0 ? void 0 : valueType(right));
-	if (issue != null) throw new Error(issue.message);
-	switch (operator) {
-		case "==": return dequal(left, right);
-		case "!=": return !dequal(left, right);
-		case "<": return left < right;
-		case "<=": return left <= right;
-		case ">": return left > right;
-		case ">=": return left >= right;
-		case "contains":
-		case "notContains": {
-			const contains = typeof left == "string" ? left.includes(right) : left.some((item) => dequal(item, right));
-			return operator == "contains" ? contains : !contains;
-		}
-		case "startsWith": return left.startsWith(right);
-		case "endsWith": return left.endsWith(right);
-		case "hasKey":
-		case "notHasKey": {
-			const has = Object.hasOwn(left, right);
-			return operator == "hasKey" ? has : !has;
-		}
-		case "hasValue":
-		case "notHasValue": {
-			const has = Object.values(left).some((item) => dequal(item, right));
-			return operator == "hasValue" ? has : !has;
-		}
-		case "isEmpty":
-		case "isNotEmpty": {
-			const empty = typeof left == "string" || Array.isArray(left) ? left.length == 0 : Object.keys(left).length == 0;
-			return operator == "isEmpty" ? empty : !empty;
-		}
-		case "isNull": return left === null;
-		case "isNotNull": return left !== null;
-		case "isTrue": return left === true;
-		case "isFalse": return left === false;
-	}
-}
-function selectConditionBranches(node, values) {
-	for (const { handle } of conditionOperands(node)) if (!Object.hasOwn(values, handle)) throw new Error(`Condition operand ${handle} is missing.`);
-	const results = node.cases.map((item, c) => {
-		if (item.groups.length == 0) throw new Error("Condition Case requires a group.");
-		return item.groups.map((group, g) => {
-			if (group.expressions.length == 0) throw new Error("Condition group requires an expression.");
-			return group.expressions.map((expression, e) => {
-				const left = values[operandHandle(c, g, e, "left")];
-				const right = unaryOperator(expression.operator) ? void 0 : values[operandHandle(c, g, e, "right")];
-				const issue = comparisonIssue(expression.operator, valueType(left), right === void 0 ? void 0 : valueType(right));
-				if (issue != null || !unaryOperator(expression.operator) && right === void 0) throw new Error(issue?.message ?? "Condition right operand is missing.");
-				return () => compareCondition(expression.operator, left, right);
-			});
-		});
-	});
-	const selected = [];
-	for (const [index, groups] of results.entries()) {
-		if (!groups.some((expressions) => expressions.every((evaluate) => evaluate()))) continue;
-		selected.push(node.cases[index].output);
-		if (node.matchMode == "first") break;
-	}
-	return selected.length == 0 ? [otherwiseOutput] : selected;
-}
-//#endregion
-//#region src/flow/common/change.ts
-function portsByHandle(ports) {
-	return Object.fromEntries(ports.flatMap((port) => "handle" in port ? [[port.handle, port]] : []));
-}
-//#endregion
-//#region src/json-schema-subset/utils.ts
-var nextId = 0;
-function createId() {
-	const id = nextId;
-	nextId += 1;
-	return id;
-}
-function deepFreeze(target) {
-	if (typeof target === "object" && target !== null && !Object.isFrozen(target)) {
-		for (const key of Object.getOwnPropertyNames(target)) deepFreeze(Reflect.get(target, key));
-		Object.freeze(target);
-	}
-	return target;
-}
-function pick(target, keys) {
-	const newTarget = {};
-	for (const key of keys) if (key in target) newTarget[key] = target[key];
-	return newTarget;
-}
-function deepCopy(value) {
-	if (typeof value !== "object" || value === null) return value;
-	else if (Array.isArray(value)) {
-		const array = [];
-		for (const [i, element] of value.entries()) array[i] = deepCopy(element);
-		return array;
-	} else {
-		const newObject = {};
-		for (const key in value) newObject[key] = deepCopy(value[key]);
-		return newObject;
-	}
-}
-function isDeepEquals(value1, value2) {
-	if (value1 === value2) return true;
-	if (value1 === null) return false;
-	if (typeof value1 !== "object") return false;
-	if (typeof value1 !== typeof value2) return false;
-	if (Array.isArray(value1)) {
-		if (!Array.isArray(value2)) return false;
-		if (value1.length !== value2.length) return false;
-		for (const [i, value1Element] of value1.entries()) if (!isDeepEquals(value1Element, value2[i])) return false;
-	} else {
-		if (Array.isArray(value2)) return false;
-		for (const key in value1) {
-			if (!(key in value2)) return false;
-			if (!isDeepEquals(value1[key], value2[key])) return false;
-		}
-		for (const key in value2) if (!(key in value1)) return false;
-	}
-	return true;
-}
-//#endregion
-//#region src/json-schema-subset/expression/result.ts
-var ExpressionSingleResult = Object.freeze({
-	Equals: 0,
-	Containing: 1,
-	ContainedBy: 2,
-	Rejection: 3,
-	Intersection: 4
-});
-var ExpressionEquals = toExpression(ExpressionSingleResult.Equals);
-var ExpressionContaining = toExpression(ExpressionSingleResult.Containing);
-var ExpressionContainedBy = toExpression(ExpressionSingleResult.ContainedBy);
-var ExpressionRejection = toExpression(ExpressionSingleResult.Rejection);
-var ExpressionIntersection = toExpression(ExpressionSingleResult.Intersection);
-var ExpressionMaskList = deepFreeze([
-	[ExpressionSingleResult.Equals, ExpressionEquals],
-	[ExpressionSingleResult.Containing, ExpressionContaining],
-	[ExpressionSingleResult.ContainedBy, ExpressionContainedBy],
-	[ExpressionSingleResult.Rejection, ExpressionRejection],
-	[ExpressionSingleResult.Intersection, ExpressionIntersection]
+var ExpressionEquals = toExpression(ExpressionSingleResult.Equals);
+var ExpressionContaining = toExpression(ExpressionSingleResult.Containing);
+var ExpressionContainedBy = toExpression(ExpressionSingleResult.ContainedBy);
+var ExpressionRejection = toExpression(ExpressionSingleResult.Rejection);
+var ExpressionIntersection = toExpression(ExpressionSingleResult.Intersection);
+var ExpressionMaskList = deepFreeze([
+	[ExpressionSingleResult.Equals, ExpressionEquals],
+	[ExpressionSingleResult.Containing, ExpressionContaining],
+	[ExpressionSingleResult.ContainedBy, ExpressionContainedBy],
+	[ExpressionSingleResult.Rejection, ExpressionRejection],
+	[ExpressionSingleResult.Intersection, ExpressionIntersection]
 ]);
 var ExpressionAny = (() => {
 	let expression = 0;
@@ -8896,1184 +8183,2098 @@ function splitRangeGreaterBranch(range1, range2) {
 				fromLeft: true,
 				range: range1
 			}
-		};
+		};
+	}
+	if (max2.num <= max1.num) {
+		let hasRight = true;
+		let isRightRangeOverride = false;
+		if (max1.num === max2.num) {
+			const exclusive1 = max2.exclusive;
+			const exclusive2 = max1.exclusive;
+			hasRight = exclusive1 !== exclusive2;
+			isRightRangeOverride = !exclusive1 && exclusive2;
+		}
+		if (!isRightRangeOverride) {
+			let right;
+			if (hasRight) right = {
+				fromLeft: true,
+				range: [reversalExclusive(max2), max1]
+			};
+			return {
+				left: {
+					fromLeft: false,
+					range: [min2, reversalExclusive(min1)]
+				},
+				center: [min1, max2],
+				right
+			};
+		}
+	}
+	return {
+		left: {
+			fromLeft: false,
+			range: [min2, reversalExclusive(min1)]
+		},
+		center: [min1, max1],
+		right: {
+			fromLeft: false,
+			range: [reversalExclusive(max1), max2]
+		}
+	};
+}
+function splitRangeEqualsBranch(range1, range2) {
+	const [min1, max1] = range1;
+	const [min2, max2] = range2;
+	const exclusive1 = min1.exclusive;
+	const exclusive2 = min2.exclusive;
+	let left;
+	let centerBegin = min1;
+	if (!exclusive1 && exclusive2) {
+		centerBegin = min2;
+		left = {
+			fromLeft: true,
+			range: [min1, reversalExclusive(min2)]
+		};
+	} else if (exclusive1 && !exclusive2) left = {
+		fromLeft: false,
+		range: [min2, reversalExclusive(min1)]
+	};
+	if (max1.num <= max2.num) {
+		let hasRight = true;
+		let isLeftRangeOverride = false;
+		if (max1.num === max2.num) {
+			const maxExclusive1 = max1.exclusive;
+			const maxExclusive2 = max2.exclusive;
+			hasRight = maxExclusive1 !== maxExclusive2;
+			isLeftRangeOverride = !maxExclusive1 && maxExclusive2;
+		}
+		if (!isLeftRangeOverride) {
+			let right;
+			if (hasRight) right = {
+				fromLeft: false,
+				range: [reversalExclusive(max1), max2]
+			};
+			return {
+				left,
+				center: [centerBegin, max1],
+				right
+			};
+		}
+	}
+	return {
+		left,
+		center: [centerBegin, max2],
+		right: {
+			fromLeft: true,
+			range: [reversalExclusive(max2), max1]
+		}
+	};
+}
+function reversalExclusive(point) {
+	return {
+		num: point.num,
+		exclusive: !point.exclusive
+	};
+}
+//#endregion
+//#region src/json-schema-subset/checker/range.ts
+var createRangeSplitter = (undefinedMin) => (min1 = undefinedMin, max1 = Number.POSITIVE_INFINITY, min2 = undefinedMin, max2 = Number.POSITIVE_INFINITY) => {
+	const { left, center, right } = splitRange$3([{
+		num: min1,
+		exclusive: false
+	}, {
+		num: max1,
+		exclusive: false
+	}], [{
+		num: min2,
+		exclusive: false
+	}, {
+		num: max2,
+		exclusive: false
+	}]);
+	let leftItem;
+	let rightItem;
+	let intersectionItem;
+	if (left) leftItem = {
+		min: left.range[0].num,
+		max: left.range[1].num,
+		isFrom1: left.fromLeft
+	};
+	if (right) rightItem = {
+		min: right.range[0].num,
+		max: right.range[1].num,
+		isFrom1: right.fromLeft
+	};
+	if (center) intersectionItem = {
+		min: center[0].num,
+		max: center[1].num
+	};
+	return {
+		left: leftItem,
+		right: rightItem,
+		intersection: intersectionItem
+	};
+};
+function toExpressionSingleResult({ left, right, intersection }) {
+	if (!intersection) return ExpressionSingleResult.Rejection;
+	let extra1 = false;
+	let extra2 = false;
+	if (left) {
+		if (left.isFrom1) extra1 = true;
+		else extra2 = true;
+	}
+	if (right) {
+		if (right.isFrom1) extra1 = true;
+		else extra2 = true;
+	}
+	if (extra1 && extra2) return ExpressionSingleResult.Intersection;
+	if (extra1) return ExpressionSingleResult.Containing;
+	if (extra2) return ExpressionSingleResult.ContainedBy;
+	return ExpressionSingleResult.Equals;
+}
+//#endregion
+//#region src/json-schema-subset/checker/array.ts
+var splitRange$2 = createRangeSplitter(0);
+var quantum$1 = makeQuantum([
+	"hasCommon",
+	"hasExtra1",
+	"hasExtra2",
+	"hasRejection",
+	"hasCommonBroken"
+]);
+function calculateArray({ calculate }, schema1, schema2) {
+	const splitResult = splitRange$2(schema1.minItems, schema1.maxItems, schema2.minItems, schema2.maxItems);
+	const splitExpression = toExpressionSingleResult(splitResult);
+	if (splitExpression === ExpressionSingleResult.Rejection) return ExpressionRejection;
+	const [items1, additionalItems1] = normalizeArray(schema1);
+	const [items2, additionalItems2] = normalizeArray(schema2);
+	const itemsLength = Math.max(items1.length, items2.length) + 1;
+	const length = Math.min(itemsLength, splitResult.intersection.max);
+	const quantumVariable = quantum$1.variable({});
+	const minItems = Math.min(schema1.minItems ?? 0, schema2.minItems ?? 0);
+	for (let i = 0; i < length; i++) {
+		const expression = calculate(items1[i] ?? additionalItems1, items2[i] ?? additionalItems2);
+		quantumVariable.push(expression, (singleExpression, variable) => {
+			switch (singleExpression) {
+				case ExpressionSingleResult.Equals:
+					if (!variable.hasRejection) variable.hasCommon = true;
+					break;
+				case ExpressionSingleResult.Containing:
+					if (!variable.hasRejection) variable.hasCommon = true;
+					variable.hasExtra1 = true;
+					break;
+				case ExpressionSingleResult.ContainedBy:
+					if (!variable.hasRejection) variable.hasCommon = true;
+					variable.hasExtra2 = true;
+					break;
+				case ExpressionSingleResult.Intersection:
+					if (!variable.hasRejection) variable.hasCommon = true;
+					variable.hasExtra1 = true;
+					variable.hasExtra2 = true;
+					break;
+				case ExpressionSingleResult.Rejection:
+					if (i < minItems) variable.hasCommonBroken = true;
+					variable.hasRejection = true;
+					variable.hasExtra1 = true;
+					variable.hasExtra2 = true;
+			}
+		});
 	}
-	if (max2.num <= max1.num) {
-		let hasRight = true;
-		let isRightRangeOverride = false;
-		if (max1.num === max2.num) {
-			const exclusive1 = max2.exclusive;
-			const exclusive2 = max1.exclusive;
-			hasRight = exclusive1 !== exclusive2;
-			isRightRangeOverride = !exclusive1 && exclusive2;
+	quantumVariable.update((variable) => {
+		switch (splitExpression) {
+			case ExpressionSingleResult.Containing:
+				variable.hasExtra1 = true;
+				break;
+			case ExpressionSingleResult.ContainedBy:
+				variable.hasExtra2 = true;
+				break;
+			case ExpressionSingleResult.Intersection:
+				variable.hasExtra1 = true;
+				variable.hasExtra2 = true;
 		}
-		if (!isRightRangeOverride) {
-			let right;
-			if (hasRight) right = {
-				fromLeft: true,
-				range: [reversalExclusive(max2), max1]
-			};
-			return {
-				left: {
-					fromLeft: false,
-					range: [min2, reversalExclusive(min1)]
-				},
-				center: [min1, max2],
-				right
-			};
+		if (schema1.uniqueItems && !schema2.uniqueItems && (schema2.maxItems ?? Number.POSITIVE_INFINITY) > 1) variable.hasExtra2 = true;
+		else if (!schema1.uniqueItems && schema2.uniqueItems && (schema1.maxItems ?? Number.POSITIVE_INFINITY) > 1) variable.hasExtra1 = true;
+		if (schema1.maxItems === 0 || schema2.maxItems === 0) {
+			variable.hasCommon = true;
+			if (schema1.maxItems !== 0) variable.hasExtra1 = true;
+			if (schema2.maxItems !== 0) variable.hasExtra2 = true;
 		}
+	});
+	let expression = 0;
+	for (const { hasExtra1, hasExtra2, hasCommon, hasCommonBroken } of quantumVariable) {
+		let finalHasCommon = hasCommon;
+		if (hasCommonBroken) finalHasCommon = false;
+		if (!finalHasCommon) expression |= ExpressionRejection;
+		else if (hasExtra1 && hasExtra2) expression |= ExpressionIntersection;
+		else if (hasExtra1) expression |= ExpressionContaining;
+		else if (hasExtra2) expression |= ExpressionContainedBy;
+		else expression |= ExpressionEquals;
 	}
-	return {
-		left: {
-			fromLeft: false,
-			range: [min2, reversalExclusive(min1)]
-		},
-		center: [min1, max1],
-		right: {
-			fromLeft: false,
-			range: [reversalExclusive(max1), max2]
-		}
-	};
+	return expression;
 }
-function splitRangeEqualsBranch(range1, range2) {
-	const [min1, max1] = range1;
-	const [min2, max2] = range2;
-	const exclusive1 = min1.exclusive;
-	const exclusive2 = min2.exclusive;
-	let left;
-	let centerBegin = min1;
-	if (!exclusive1 && exclusive2) {
-		centerBegin = min2;
-		left = {
-			fromLeft: true,
-			range: [min1, reversalExclusive(min2)]
-		};
-	} else if (exclusive1 && !exclusive2) left = {
-		fromLeft: false,
-		range: [min2, reversalExclusive(min1)]
+function normalizeArray({ items, additionalItems }) {
+	if (Array.isArray(items)) return [items, additionalItems ?? ANY];
+	else return [[], items ?? ANY];
+}
+//#endregion
+//#region src/json-schema-subset/checker/cache.ts
+function wrapEqualsCheckerWithCache(check) {
+	const map = /* @__PURE__ */ new Map();
+	return (value1, value2) => {
+		const isObject1 = isCompiledObject(value1);
+		if (isObject1 !== isCompiledObject(value2)) return false;
+		if (!isObject1) return value1 === value2;
+		return getWithCache(map, value1, value2, check);
 	};
-	if (max1.num <= max2.num) {
-		let hasRight = true;
-		let isLeftRangeOverride = false;
-		if (max1.num === max2.num) {
-			const maxExclusive1 = max1.exclusive;
-			const maxExclusive2 = max2.exclusive;
-			hasRight = maxExclusive1 !== maxExclusive2;
-			isLeftRangeOverride = !maxExclusive1 && maxExclusive2;
+}
+function wrapSchemaCalculatorWithCache(check) {
+	const map = /* @__PURE__ */ new Map();
+	return (schema1, schema2) => getWithCache(map, schema1, schema2, check);
+}
+function getWithCache(map, node1, node2, check) {
+	const key = `${getId(node1)}/${getId(node2)}`;
+	let result = map.get(key);
+	if (result === void 0) map.set(key, result = check(node1, node2));
+	return result;
+}
+//#endregion
+//#region src/json-schema-subset/checker/enumAndConst.ts
+function calculateEnumAndEnum(context, schema1, schema2) {
+	const enumList1 = normalizeEnumList(schema1);
+	const enumList2 = normalizeEnumList(schema2);
+	let foundExtra1 = false;
+	let foundExtra2 = false;
+	let foundIntersection = false;
+	for (const enum1 of enumList1) {
+		if (hasEqualsEnum(context, enumList2, enum1)) foundIntersection = true;
+		else foundExtra1 = true;
+		if (foundExtra1 && foundIntersection) break;
+	}
+	for (const enum2 of enumList2) {
+		if (hasEqualsEnum(context, enumList1, enum2)) foundIntersection = true;
+		else foundExtra2 = true;
+		if (foundExtra2 && foundIntersection) break;
+	}
+	if (!foundIntersection) return ExpressionRejection;
+	if (foundExtra1 && foundExtra2) return ExpressionIntersection;
+	if (foundExtra1) return ExpressionContaining;
+	if (foundExtra2) return ExpressionContainedBy;
+	return ExpressionEquals;
+}
+function calculateEnumAndSchema(enumSchema, schema) {
+	let hasValid = false;
+	let hasInvalid = false;
+	for (const enumValue of normalizeEnumList(enumSchema)) {
+		switch (valid(schema, enumValue)) {
+			case ValidResult.Valid:
+				hasValid = true;
+				break;
+			case ValidResult.Invalid:
+				hasInvalid = true;
+				break;
+			case ValidResult.Unknown: return ExpressionAny;
 		}
-		if (!isLeftRangeOverride) {
-			let right;
-			if (hasRight) right = {
-				fromLeft: false,
-				range: [reversalExclusive(max1), max2]
-			};
-			return {
-				left,
-				center: [centerBegin, max1],
-				right
-			};
+		if (hasValid && hasInvalid) break;
+	}
+	if (hasValid && hasInvalid) return ExpressionIntersection;
+	if (hasValid) return ExpressionEquals | ExpressionContainedBy;
+	if (hasInvalid) return ExpressionRejection;
+	if (getKind(schema) === CompiledKind.Never) return ExpressionEquals;
+	return ExpressionContainedBy;
+}
+function normalizeEnumList({ const: constValue, enum: enumList }) {
+	if (constValue !== void 0) return [constValue];
+	if (enumList) return enumList;
+	throw new Error("invalid branch");
+}
+function hasEqualsEnum({ isEquals }, enumList, checkedEnum) {
+	for (const searchedEnum of enumList) if (isEquals(searchedEnum, checkedEnum)) return true;
+	return false;
+}
+//#endregion
+//#region src/json-schema-subset/checker/equals.ts
+function schemaEqualsChecker(extendsContext) {
+	function isSchemaEquals(schema1, schema2) {
+		const isExtends1 = extendsContext.isExtendsSchema(schema1);
+		const isExtends2 = extendsContext.isExtendsSchema(schema2);
+		if (isExtends1 || isExtends2) return extendsContext.equals(schema1, schema2);
+		else return isCompiledSchemaEquals(schema1, schema2);
+	}
+	const equalsMap = /* @__PURE__ */ new Map();
+	function isCompiledSchemaEquals(schema1, schema2) {
+		const id1 = getId(schema1);
+		const id2 = getId(schema2);
+		if (id1 === id2) return true;
+		const key = `${id1}/${id2}`;
+		let isEquals = equalsMap.get(key);
+		if (isEquals === void 0) {
+			isEquals = isObjectLikeEquals(schema1, schema2);
+			equalsMap.set(key, isEquals);
 		}
+		return isEquals;
 	}
-	return {
-		left,
-		center: [centerBegin, max2],
-		right: {
-			fromLeft: true,
-			range: [reversalExclusive(max2), max1]
+	function isObjectLikeEquals(object1, object2) {
+		if (Array.isArray(object1)) {
+			if (!Array.isArray(object2)) return false;
+			if (object1.length !== object2.length) return false;
+			for (const [i, value1Element] of object1.entries()) if (!isValueEquals(value1Element, object2[i])) return false;
+		} else {
+			if (Array.isArray(object2)) return false;
+			for (const key in object1) {
+				if (!(key in object2)) return false;
+				if (!isValueEquals(Reflect.get(object1, key), Reflect.get(object2, key))) return false;
+			}
+			for (const key in object2) if (!(key in object1)) return false;
 		}
-	};
+		return true;
+	}
+	function isValueEquals(value1, value2) {
+		if (value1 === value2) return true;
+		if (value1 === null) return false;
+		if (typeof value1 !== "object") return false;
+		if (typeof value1 !== typeof value2) return false;
+		if (isCompiledSchema(value1) && isCompiledSchema(value2)) return isCompiledSchemaEquals(value1, value2);
+		return isObjectLikeEquals(value1, value2);
+	}
+	return isSchemaEquals;
 }
-function reversalExclusive(point) {
+//#endregion
+//#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
+function normalizeInteger(schema) {
+	const floatRange = pickRange(schema);
+	const multipleOf = schema.multipleOf ?? 1;
+	const range = cutRange(floatRange, multipleOf);
+	if (!range) return null;
 	return {
-		num: point.num,
-		exclusive: !point.exclusive
+		multipleOf,
+		range
 	};
 }
-//#endregion
-//#region src/json-schema-subset/checker/range.ts
-var createRangeSplitter = (undefinedMin) => (min1 = undefinedMin, max1 = Number.POSITIVE_INFINITY, min2 = undefinedMin, max2 = Number.POSITIVE_INFINITY) => {
-	const { left, center, right } = splitRange$3([{
-		num: min1,
+function isPointRange([point1, point2]) {
+	if (point1.num !== point2.num) return false;
+	if (point1.exclusive) return false;
+	if (point2.exclusive) return false;
+	return true;
+}
+function cutRange(range, multipleOf) {
+	if (!range) return;
+	const [originMin, originMax] = range;
+	let min = nextInteger(originMin.num, multipleOf);
+	let max = previousInteger(originMax.num, multipleOf);
+	if (min === originMin.num && originMin.exclusive) min += multipleOf;
+	if (max === originMax.num && originMax.exclusive) max -= multipleOf;
+	if (min > max) return;
+	if (min === max) {
+		if (min === Number.POSITIVE_INFINITY) return;
+		if (min === Number.NEGATIVE_INFINITY) return;
+	}
+	return [{
+		num: min,
 		exclusive: false
 	}, {
-		num: max1,
-		exclusive: false
-	}], [{
-		num: min2,
+		num: max,
 		exclusive: false
-	}, {
-		num: max2,
+	}];
+}
+function nextInteger(float, multipleOf) {
+	return Math.ceil(float / multipleOf) * multipleOf;
+}
+function previousInteger(float, multipleOf) {
+	return Math.floor(float / multipleOf) * multipleOf;
+}
+//#endregion
+//#region src/json-schema-subset/checker/numeric/float.ts
+function calculateFloat(schema1, schema2) {
+	const { left, right, center } = splitRange$3(pickRange(schema1), pickRange(schema2));
+	if (!center) return ExpressionRejection;
+	let extraLeft = false;
+	let extraRight = false;
+	if (left) {
+		if (left.fromLeft) extraLeft = true;
+		else extraRight = true;
+	}
+	if (right) {
+		if (right.fromLeft) extraLeft = true;
+		else extraRight = true;
+	}
+	if (extraLeft && extraRight) return ExpressionIntersection;
+	if (extraLeft) return ExpressionContaining;
+	if (extraRight) return ExpressionContainedBy;
+	return ExpressionEquals;
+}
+function calculateFloatAndInteger(schema1, schema2) {
+	const floatRange = pickRange(schema1);
+	const integer = normalizeInteger(schema2);
+	if (!integer) return ExpressionContaining;
+	const result = splitRange$3(floatRange, integer.range);
+	const intCenter = cutRange(result.center, integer.multipleOf);
+	const leftIntRange = unwrapAndCutRange(result.left, integer.multipleOf);
+	const rightIntRange = unwrapAndCutRange(result.right, integer.multipleOf);
+	if (!result.center) return ExpressionRejection;
+	let extraFloat = false;
+	let extraInteger = false;
+	if (result.left?.fromLeft) extraFloat = true;
+	if (result.right?.fromLeft) extraFloat = true;
+	if (!intCenter || !isPointRange(result.center)) extraFloat = true;
+	if (leftIntRange) extraInteger = true;
+	if (rightIntRange) extraInteger = true;
+	if (extraFloat && extraInteger) return ExpressionIntersection;
+	if (extraFloat) return ExpressionContaining;
+	if (extraInteger) return ExpressionContainedBy;
+	return ExpressionEquals;
+}
+function pickRange(schema) {
+	let point1;
+	let point2;
+	if (schema.exclusiveMinimum !== void 0) point1 = {
+		num: schema.exclusiveMinimum,
+		exclusive: true
+	};
+	else if (schema.minimum !== void 0) point1 = {
+		num: schema.minimum,
 		exclusive: false
-	}]);
-	let leftItem;
-	let rightItem;
-	let intersectionItem;
-	if (left) leftItem = {
-		min: left.range[0].num,
-		max: left.range[1].num,
-		isFrom1: left.fromLeft
 	};
-	if (right) rightItem = {
-		min: right.range[0].num,
-		max: right.range[1].num,
-		isFrom1: right.fromLeft
+	else point1 = {
+		num: Number.NEGATIVE_INFINITY,
+		exclusive: true
 	};
-	if (center) intersectionItem = {
-		min: center[0].num,
-		max: center[1].num
+	if (schema.exclusiveMaximum !== void 0) point2 = {
+		num: schema.exclusiveMaximum,
+		exclusive: true
 	};
-	return {
-		left: leftItem,
-		right: rightItem,
-		intersection: intersectionItem
+	else if (schema.maximum !== void 0) point2 = {
+		num: schema.maximum,
+		exclusive: false
 	};
-};
-function toExpressionSingleResult({ left, right, intersection }) {
-	if (!intersection) return ExpressionSingleResult.Rejection;
-	let extra1 = false;
-	let extra2 = false;
-	if (left) {
-		if (left.isFrom1) extra1 = true;
-		else extra2 = true;
+	else point2 = {
+		num: Number.POSITIVE_INFINITY,
+		exclusive: true
+	};
+	return [point1, point2];
+}
+function unwrapAndCutRange(side, multipleOf) {
+	if (!side) return;
+	if (side.fromLeft) return;
+	return cutRange(side.range, multipleOf);
+}
+//#endregion
+//#region src/json-schema-subset/checker/numeric/integer.ts
+function calculateInteger(schema1, schema2) {
+	const integer1 = normalizeInteger(schema1);
+	const integer2 = normalizeInteger(schema2);
+	if (!integer1 && !integer2) return ExpressionEquals;
+	if (!integer1) return ExpressionContainedBy;
+	if (!integer2) return ExpressionContaining;
+	const { range: range1, multipleOf: multipleOf1 } = integer1;
+	const { range: range2, multipleOf: multipleOf2 } = integer2;
+	const result = splitRange$3(range1, range2);
+	let centerRange;
+	let lcm = 0;
+	if (result.center) {
+		lcm = getLCM(multipleOf1, multipleOf2);
+		centerRange = cutRange(result.center, lcm);
 	}
-	if (right) {
-		if (right.isFrom1) extra1 = true;
-		else extra2 = true;
+	if (!centerRange) return ExpressionRejection;
+	let extraLeft = false;
+	let extraRight = false;
+	const { left, right } = result;
+	if (left && cutRange(left.range, left.fromLeft ? multipleOf1 : multipleOf2)) {
+		if (left.fromLeft) extraLeft = true;
+		else extraRight = true;
 	}
-	if (extra1 && extra2) return ExpressionSingleResult.Intersection;
-	if (extra1) return ExpressionSingleResult.Containing;
-	if (extra2) return ExpressionSingleResult.ContainedBy;
-	return ExpressionSingleResult.Equals;
+	if (right && cutRange(right.range, right.fromLeft ? multipleOf1 : multipleOf2)) {
+		if (right.fromLeft) extraLeft = true;
+		else extraRight = true;
+	}
+	extraLeft = extraLeft || hasExtraIntegersOnCenter(integer1, centerRange, lcm);
+	extraRight = extraRight || hasExtraIntegersOnCenter(integer2, centerRange, lcm);
+	if (extraLeft && extraRight) return ExpressionIntersection;
+	if (extraLeft) return ExpressionContaining;
+	if (extraRight) return ExpressionContainedBy;
+	return ExpressionEquals;
+}
+function hasExtraIntegersOnCenter({ range, multipleOf }, lcmCenterRange, lcm) {
+	const result = splitRange$3(range, lcmCenterRange);
+	if (cutRange(result.left?.range, multipleOf)) return true;
+	if (cutRange(result.right?.range, multipleOf)) return true;
+	const center = cutRange(result.center, multipleOf);
+	if (!center) return false;
+	const lcmCenterLength = rangeLength(lcmCenterRange);
+	if (rangeLength(center) > lcmCenterLength) return true;
+	if (lcmCenterLength === 1) return false;
+	if (multipleOf < lcm) return true;
+	return false;
+}
+/** Returns the least common multiple. */
+function getLCM(a, b) {
+	return a * b / getGCD(a, b);
+}
+/** @returns The greatest common divisor. */
+function getGCD(a, b) {
+	if (a === 0) return b;
+	return getGCD(b % a, a);
+}
+function rangeLength(range) {
+	if (!range) return 0;
+	const [point1, point2] = range;
+	return point2.num - point1.num + 1;
 }
 //#endregion
-//#region src/json-schema-subset/checker/array.ts
-var splitRange$2 = createRangeSplitter(0);
-var quantum$1 = makeQuantum([
-	"hasCommon",
-	"hasExtra1",
-	"hasExtra2",
-	"hasRejection",
-	"hasCommonBroken"
-]);
-function calculateArray({ calculate }, schema1, schema2) {
-	const splitResult = splitRange$2(schema1.minItems, schema1.maxItems, schema2.minItems, schema2.maxItems);
-	const splitExpression = toExpressionSingleResult(splitResult);
-	if (splitExpression === ExpressionSingleResult.Rejection) return ExpressionRejection;
-	const [items1, additionalItems1] = normalizeArray(schema1);
-	const [items2, additionalItems2] = normalizeArray(schema2);
-	const itemsLength = Math.max(items1.length, items2.length) + 1;
-	const length = Math.min(itemsLength, splitResult.intersection.max);
-	const quantumVariable = quantum$1.variable({});
-	const minItems = Math.min(schema1.minItems ?? 0, schema2.minItems ?? 0);
-	for (let i = 0; i < length; i++) {
-		const expression = calculate(items1[i] ?? additionalItems1, items2[i] ?? additionalItems2);
-		quantumVariable.push(expression, (singleExpression, variable) => {
-			switch (singleExpression) {
-				case ExpressionSingleResult.Equals:
-					if (!variable.hasRejection) variable.hasCommon = true;
-					break;
-				case ExpressionSingleResult.Containing:
-					if (!variable.hasRejection) variable.hasCommon = true;
-					variable.hasExtra1 = true;
-					break;
-				case ExpressionSingleResult.ContainedBy:
-					if (!variable.hasRejection) variable.hasCommon = true;
-					variable.hasExtra2 = true;
-					break;
-				case ExpressionSingleResult.Intersection:
-					if (!variable.hasRejection) variable.hasCommon = true;
-					variable.hasExtra1 = true;
-					variable.hasExtra2 = true;
-					break;
-				case ExpressionSingleResult.Rejection:
-					if (i < minItems) variable.hasCommonBroken = true;
-					variable.hasRejection = true;
-					variable.hasExtra1 = true;
-					variable.hasExtra2 = true;
-			}
-		});
+//#region src/json-schema-subset/checker/numeric/checker.ts
+function calculateNumeric(schema1, schema2) {
+	if (isUndefinedNumber(schema1) || isUndefinedNumber(schema2)) return ExpressionAny;
+	const isFloat1 = isFloat(schema1);
+	const isFloat2 = isFloat(schema2);
+	if (isFloat1 && isFloat2) return calculateFloat(schema1, schema2);
+	else if (isFloat1) return calculateFloatAndInteger(schema1, schema2);
+	else if (isFloat2) return swap(calculateFloatAndInteger(schema2, schema1));
+	else return calculateInteger(schema1, schema2);
+}
+function isUndefinedNumber(schema) {
+	const { multipleOf } = schema;
+	if (multipleOf === void 0) return false;
+	if (!Number.isInteger(multipleOf)) return true;
+	if (multipleOf < 0) return true;
+	return false;
+}
+function isFloat(schema) {
+	const { multipleOf } = schema;
+	if (multipleOf !== void 0 && Number.isInteger(multipleOf)) return false;
+	if (schema.type === "integer") return false;
+	return true;
+}
+//#endregion
+//#region src/json-schema-subset/checker/object.ts
+var splitRange$1 = createRangeSplitter(0);
+var quantum = makeQuantum([
+	"hasCommonInRequired",
+	"hasCommonOutRequired",
+	"hasExtra1",
+	"hasExtra2",
+	"hasRejection"
+]);
+function calculateObject(context, schema1, schema2) {
+	if (isPropertiesCountCannotMatch(schema1, schema2)) return ExpressionRejection;
+	const splitRequiredResult = splitRequired(schema1, schema2);
+	if (!splitRequiredResult) return ExpressionRejection;
+	const getProperty1 = createPropertySchemaGetter(schema1);
+	const getProperty2 = createPropertySchemaGetter(schema2);
+	const calculateKey = (key) => {
+		const propertySchema1 = getProperty1(key);
+		const propertySchema2 = getProperty2(key);
+		if (areNotBothNever(propertySchema1, propertySchema2)) return context.calculate(propertySchema1, propertySchema2);
+		else return 0;
+	};
+	const { commonRequired, extraRequired1, extraRequired2 } = splitRequiredResult;
+	const quantumVariable = quantum.variable({});
+	for (const requiredKey of [...commonRequired].toSorted()) quantumVariable.push(calculateKey(requiredKey), calculateCommonRequiredExpression);
+	for (const requiredKey of [...extraRequired1].toSorted()) quantumVariable.push(calculateKey(requiredKey), calculateExtraRequiredExpression1);
+	for (const requiredKey of [...extraRequired2].toSorted()) quantumVariable.push(calculateKey(requiredKey), calculateExtraRequiredExpression2);
+	const { hasOptional1, hasOptional2 } = splitRequiredResult;
+	if (hasOptional1 || hasOptional2) {
+		const calculator = calculateOptionalExpression(hasOptional1, hasOptional2);
+		for (const optionalKey of [...getOptionalKeys(schema1, schema2)].toSorted()) {
+			const expression = calculateKey(optionalKey);
+			if (expression !== 0) quantumVariable.push(expression, calculator);
+		}
+		const additionalProperties1 = schema1.additionalProperties ?? ANY;
+		const additionalProperties2 = schema2.additionalProperties ?? ANY;
+		if (areNotBothNever(additionalProperties1, additionalProperties2)) {
+			const expression = context.calculate(additionalProperties1, additionalProperties2);
+			quantumVariable.push(expression, calculator);
+		}
 	}
 	quantumVariable.update((variable) => {
-		switch (splitExpression) {
-			case ExpressionSingleResult.Containing:
-				variable.hasExtra1 = true;
-				break;
-			case ExpressionSingleResult.ContainedBy:
-				variable.hasExtra2 = true;
-				break;
-			case ExpressionSingleResult.Intersection:
-				variable.hasExtra1 = true;
-				variable.hasExtra2 = true;
-		}
-		if (schema1.uniqueItems && !schema2.uniqueItems && (schema2.maxItems ?? Number.POSITIVE_INFINITY) > 1) variable.hasExtra2 = true;
-		else if (!schema1.uniqueItems && schema2.uniqueItems && (schema1.maxItems ?? Number.POSITIVE_INFINITY) > 1) variable.hasExtra1 = true;
-		if (schema1.maxItems === 0 || schema2.maxItems === 0) {
-			variable.hasCommon = true;
-			if (schema1.maxItems !== 0) variable.hasExtra1 = true;
-			if (schema2.maxItems !== 0) variable.hasExtra2 = true;
+		if (!variable.hasRejection) {
+			if (extraRequired1.size > 0) variable.hasExtra2 = true;
+			if (extraRequired2.size > 0) variable.hasExtra1 = true;
 		}
 	});
+	const { requiredKeysCount } = splitRequiredResult;
 	let expression = 0;
-	for (const { hasExtra1, hasExtra2, hasCommon, hasCommonBroken } of quantumVariable) {
-		let finalHasCommon = hasCommon;
-		if (hasCommonBroken) finalHasCommon = false;
-		if (!finalHasCommon) expression |= ExpressionRejection;
-		else if (hasExtra1 && hasExtra2) expression |= ExpressionIntersection;
-		else if (hasExtra1) expression |= ExpressionContaining;
-		else if (hasExtra2) expression |= ExpressionContainedBy;
-		else expression |= ExpressionEquals;
-	}
+	for (const { hasExtra1, hasExtra2, hasCommonInRequired, hasCommonOutRequired, hasRejection } of quantumVariable) if (!hasCommonInRequired && requiredKeysCount > 0) expression |= ExpressionRejection;
+	else if (!hasCommonOutRequired && requiredKeysCount === 0) expression |= ExpressionRejection;
+	else if (hasRejection) expression |= ExpressionRejection;
+	else if (hasExtra1 && hasExtra2) expression |= ExpressionIntersection;
+	else if (hasExtra1) expression |= ExpressionContaining;
+	else if (hasExtra2) expression |= ExpressionContainedBy;
+	else expression |= ExpressionEquals;
 	return expression;
 }
-function normalizeArray({ items, additionalItems }) {
-	if (Array.isArray(items)) return [items, additionalItems ?? ANY];
-	else return [[], items ?? ANY];
+function isPropertiesCountCannotMatch(schema1, schema2) {
+	return toExpressionSingleResult(splitRange$1(schema1.minProperties, schema1.maxProperties, schema2.minProperties, schema2.maxProperties)) === ExpressionSingleResult.Rejection;
 }
-//#endregion
-//#region src/json-schema-subset/checker/cache.ts
-function wrapEqualsCheckerWithCache(check) {
-	const map = /* @__PURE__ */ new Map();
-	return (value1, value2) => {
-		const isObject1 = isCompiledObject(value1);
-		if (isObject1 !== isCompiledObject(value2)) return false;
-		if (!isObject1) return value1 === value2;
-		return getWithCache(map, value1, value2, check);
+function splitRequired(schema1, schema2) {
+	const extraRequired1 = new Set(schema1.required);
+	const extraRequired2 = new Set(schema2.required);
+	const commonRequired = /* @__PURE__ */ new Set();
+	const wholeRequired = /* @__PURE__ */ new Set();
+	const requiredCount1 = extraRequired1.size;
+	const requiredCount2 = extraRequired2.size;
+	for (const key of extraRequired1) {
+		if (extraRequired2.has(key)) commonRequired.add(key);
+		wholeRequired.add(key);
+	}
+	for (const key of extraRequired2) {
+		if (extraRequired1.has(key)) commonRequired.add(key);
+		wholeRequired.add(key);
+	}
+	const requiredKeysCount = wholeRequired.size;
+	for (const key of commonRequired) {
+		extraRequired1.delete(key);
+		extraRequired2.delete(key);
+	}
+	const maxProperties1 = schema1.maxProperties ?? Number.MAX_SAFE_INTEGER;
+	const maxProperties2 = schema2.maxProperties ?? Number.MAX_SAFE_INTEGER;
+	if (requiredKeysCount > maxProperties1 || requiredKeysCount > maxProperties2) return null;
+	return {
+		requiredKeysCount,
+		extraRequired1,
+		extraRequired2,
+		commonRequired,
+		hasOptional1: maxProperties1 > requiredCount1,
+		hasOptional2: maxProperties2 > requiredCount2
 	};
 }
-function wrapSchemaCalculatorWithCache(check) {
-	const map = /* @__PURE__ */ new Map();
-	return (schema1, schema2) => getWithCache(map, schema1, schema2, check);
-}
-function getWithCache(map, node1, node2, check) {
-	const key = `${getId(node1)}/${getId(node2)}`;
-	let result = map.get(key);
-	if (result === void 0) map.set(key, result = check(node1, node2));
-	return result;
+function getOptionalKeys(schema1, schema2) {
+	const optionalKeys = new Set(schema1.required);
+	const properties1 = schema1.properties;
+	const properties2 = schema2.properties;
+	const required1 = schema1.required;
+	const required2 = schema2.required;
+	if (properties1) for (const key in properties1) optionalKeys.add(key);
+	if (properties2) for (const key in properties2) optionalKeys.add(key);
+	if (required1) for (const key of required1) optionalKeys.delete(key);
+	if (required2) for (const key of required2) optionalKeys.delete(key);
+	return optionalKeys;
 }
-//#endregion
-//#region src/json-schema-subset/checker/enumAndConst.ts
-function calculateEnumAndEnum(context, schema1, schema2) {
-	const enumList1 = normalizeEnumList(schema1);
-	const enumList2 = normalizeEnumList(schema2);
-	let foundExtra1 = false;
-	let foundExtra2 = false;
-	let foundIntersection = false;
-	for (const enum1 of enumList1) {
-		if (hasEqualsEnum(context, enumList2, enum1)) foundIntersection = true;
-		else foundExtra1 = true;
-		if (foundExtra1 && foundIntersection) break;
+var calculateCommonRequiredExpression = (singleExpression, variable) => {
+	switch (singleExpression) {
+		case ExpressionSingleResult.Equals:
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Containing:
+			variable.hasExtra1 = true;
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.ContainedBy:
+			variable.hasExtra2 = true;
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Intersection:
+			variable.hasExtra1 = true;
+			variable.hasExtra2 = true;
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Rejection: variable.hasRejection = true;
 	}
-	for (const enum2 of enumList2) {
-		if (hasEqualsEnum(context, enumList1, enum2)) foundIntersection = true;
-		else foundExtra2 = true;
-		if (foundExtra2 && foundIntersection) break;
+};
+var calculateExtraRequiredExpression1 = (singleExpression, variable) => {
+	switch (singleExpression) {
+		case ExpressionSingleResult.Equals:
+		case ExpressionSingleResult.ContainedBy:
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Intersection:
+		case ExpressionSingleResult.Containing:
+			variable.hasExtra1 = true;
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Rejection: variable.hasRejection = true;
 	}
-	if (!foundIntersection) return ExpressionRejection;
-	if (foundExtra1 && foundExtra2) return ExpressionIntersection;
-	if (foundExtra1) return ExpressionContaining;
-	if (foundExtra2) return ExpressionContainedBy;
-	return ExpressionEquals;
-}
-function calculateEnumAndSchema(enumSchema, schema) {
-	let hasValid = false;
-	let hasInvalid = false;
-	for (const enumValue of normalizeEnumList(enumSchema)) {
-		switch (valid(schema, enumValue)) {
-			case ValidResult.Valid:
-				hasValid = true;
-				break;
-			case ValidResult.Invalid:
-				hasInvalid = true;
-				break;
-			case ValidResult.Unknown: return ExpressionAny;
-		}
-		if (hasValid && hasInvalid) break;
+};
+var calculateExtraRequiredExpression2 = (singleExpression, variable) => {
+	switch (singleExpression) {
+		case ExpressionSingleResult.Equals:
+		case ExpressionSingleResult.Containing:
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Intersection:
+		case ExpressionSingleResult.ContainedBy:
+			variable.hasExtra2 = true;
+			variable.hasCommonInRequired = true;
+			break;
+		case ExpressionSingleResult.Rejection: variable.hasRejection = true;
+	}
+};
+var calculateOptionalExpression = (hasOptional1, hasOptional2) => (singleExpression, variable) => {
+	if (variable.hasRejection) return;
+	let foundExtraPossibility1 = false;
+	let foundExtraPossibility2 = false;
+	let foundCommonPossibility = false;
+	switch (singleExpression) {
+		case ExpressionSingleResult.Equals:
+			foundCommonPossibility = true;
+			break;
+		case ExpressionSingleResult.Containing:
+			foundExtraPossibility1 = true;
+			foundCommonPossibility = true;
+			break;
+		case ExpressionSingleResult.ContainedBy:
+			foundExtraPossibility2 = true;
+			foundCommonPossibility = true;
+			break;
+		case ExpressionSingleResult.Intersection:
+			foundExtraPossibility1 = true;
+			foundExtraPossibility2 = true;
+			foundCommonPossibility = true;
+			break;
+		case ExpressionSingleResult.Rejection:
+			foundExtraPossibility1 = true;
+			foundExtraPossibility2 = true;
 	}
-	if (hasValid && hasInvalid) return ExpressionIntersection;
-	if (hasValid) return ExpressionEquals | ExpressionContainedBy;
-	if (hasInvalid) return ExpressionRejection;
-	if (getKind(schema) === CompiledKind.Never) return ExpressionEquals;
-	return ExpressionContainedBy;
-}
-function normalizeEnumList({ const: constValue, enum: enumList }) {
-	if (constValue !== void 0) return [constValue];
-	if (enumList) return enumList;
-	throw new Error("invalid branch");
+	if (hasOptional1 && foundExtraPossibility1) variable.hasExtra1 = true;
+	if (hasOptional2 && foundExtraPossibility2) variable.hasExtra2 = true;
+	if (hasOptional1 && hasOptional2 && foundCommonPossibility) variable.hasCommonOutRequired = true;
+};
+function createPropertySchemaGetter(schema) {
+	const properties = schema.properties;
+	const propertyNames = schema.propertyNames;
+	const additionalProperties = schema.additionalProperties;
+	const patternProperties = [];
+	if (schema.patternProperties) for (const pattern in schema.patternProperties) {
+		const valueSchema = schema.patternProperties[pattern];
+		const regExp = new RegExp(pattern, "i");
+		patternProperties.push({
+			pattern: regExp,
+			schema: valueSchema
+		});
+	}
+	return (key) => {
+		if (propertyNames && valid(propertyNames, key) === ValidResult.Invalid) return NEVER;
+		for (const { pattern, schema: patternSchema } of patternProperties) if (pattern.test(key)) return patternSchema;
+		const propertySchema = (properties && properties[key]) ?? additionalProperties;
+		if (!propertySchema) return ANY;
+		return propertySchema;
+	};
 }
-function hasEqualsEnum({ isEquals }, enumList, checkedEnum) {
-	for (const searchedEnum of enumList) if (isEquals(searchedEnum, checkedEnum)) return true;
-	return false;
+function areNotBothNever(schema1, schema2) {
+	const kind1 = getKind(schema1);
+	const kind2 = getKind(schema2);
+	return kind1 !== CompiledKind.Never || kind2 !== CompiledKind.Never;
 }
 //#endregion
-//#region src/json-schema-subset/checker/equals.ts
-function schemaEqualsChecker(extendsContext) {
-	function isSchemaEquals(schema1, schema2) {
-		const isExtends1 = extendsContext.isExtendsSchema(schema1);
-		const isExtends2 = extendsContext.isExtendsSchema(schema2);
-		if (isExtends1 || isExtends2) return extendsContext.equals(schema1, schema2);
-		else return isCompiledSchemaEquals(schema1, schema2);
-	}
-	const equalsMap = /* @__PURE__ */ new Map();
-	function isCompiledSchemaEquals(schema1, schema2) {
-		const id1 = getId(schema1);
-		const id2 = getId(schema2);
-		if (id1 === id2) return true;
-		const key = `${id1}/${id2}`;
-		let isEquals = equalsMap.get(key);
-		if (isEquals === void 0) {
-			isEquals = isObjectLikeEquals(schema1, schema2);
-			equalsMap.set(key, isEquals);
-		}
-		return isEquals;
-	}
-	function isObjectLikeEquals(object1, object2) {
-		if (Array.isArray(object1)) {
-			if (!Array.isArray(object2)) return false;
-			if (object1.length !== object2.length) return false;
-			for (const [i, value1Element] of object1.entries()) if (!isValueEquals(value1Element, object2[i])) return false;
-		} else {
-			if (Array.isArray(object2)) return false;
-			for (const key in object1) {
-				if (!(key in object2)) return false;
-				if (!isValueEquals(Reflect.get(object1, key), Reflect.get(object2, key))) return false;
-			}
-			for (const key in object2) if (!(key in object1)) return false;
-		}
-		return true;
-	}
-	function isValueEquals(value1, value2) {
-		if (value1 === value2) return true;
-		if (value1 === null) return false;
-		if (typeof value1 !== "object") return false;
-		if (typeof value1 !== typeof value2) return false;
-		if (isCompiledSchema(value1) && isCompiledSchema(value2)) return isCompiledSchemaEquals(value1, value2);
-		return isObjectLikeEquals(value1, value2);
+//#region src/json-schema-subset/checker/string.ts
+var splitRange = createRangeSplitter(0);
+function calculateString(schema1, schema2) {
+	if (schema2.format && !schema1.format) return ExpressionContaining;
+	if (schema1.format && schema2.format && schema1.format !== schema2.format) return ExpressionAny;
+	const expression = toExpressionSingleResult(splitRange(schema1.minLength, schema1.maxLength, schema2.minLength, schema2.maxLength));
+	const hasPattern1 = !!schema1.pattern;
+	const hasPattern2 = !!schema2.pattern;
+	switch (expression) {
+		case ExpressionSingleResult.Rejection: return ExpressionRejection;
+		case ExpressionSingleResult.Containing: return hasPattern1 ? ExpressionAny : ExpressionContaining;
+		case ExpressionSingleResult.ContainedBy: return hasPattern2 ? ExpressionAny : ExpressionContainedBy;
+		case ExpressionSingleResult.Equals:
+			if (hasPattern1 && hasPattern2) return schema1.pattern === schema2.pattern ? ExpressionEquals : ExpressionAny;
+			if (hasPattern1) return ExpressionEquals | ExpressionContainedBy;
+			if (hasPattern2) return ExpressionEquals | ExpressionContaining;
+			return ExpressionEquals;
+		case ExpressionSingleResult.Intersection:
+			if (hasPattern1 && hasPattern2) return ExpressionAny;
+			if (hasPattern1) return ExpressionIntersection | ExpressionRejection | ExpressionContainedBy;
+			if (hasPattern2) return ExpressionIntersection | ExpressionRejection | ExpressionContaining;
+			return ExpressionIntersection;
 	}
-	return isSchemaEquals;
 }
 //#endregion
-//#region src/json-schema-subset/checker/numeric/integerNormalizer.ts
-function normalizeInteger(schema) {
-	const floatRange = pickRange(schema);
-	const multipleOf = schema.multipleOf ?? 1;
-	const range = cutRange(floatRange, multipleOf);
-	if (!range) return null;
+//#region src/json-schema-subset/checker/checker.ts
+function checkWithResult(extendsContext, schema1, schema2) {
+	const context = {};
+	const errorPaths = [];
+	const calculate = wrapSchemaCalculatorWithCache(calculator(extendsContext, context));
+	const describe = describer();
+	const equals = schemaEqualsChecker(extendsContext);
+	context.isEquals = wrapEqualsCheckerWithCache(isDeepEquals);
+	context.calculate = expression({
+		describe,
+		equals,
+		calculate,
+		observeCalculation: (left, right, result, swapped) => {
+			if (!isDecisiveMismatch(swapped ? swap(result) : result)) return;
+			const errorPath = swapped ? findMismatchPath(right, left) : findMismatchPath(left, right);
+			if (errorPath) errorPaths.push(errorPath);
+		}
+	});
+	Object.freeze(context);
+	const comparisonExpression = context.calculate(schema1, schema2);
 	return {
-		multipleOf,
-		range
+		errorPath: errorPaths[0],
+		expression: comparisonExpression
 	};
 }
-function isPointRange([point1, point2]) {
-	if (point1.num !== point2.num) return false;
-	if (point1.exclusive) return false;
-	if (point2.exclusive) return false;
-	return true;
-}
-function cutRange(range, multipleOf) {
-	if (!range) return;
-	const [originMin, originMax] = range;
-	let min = nextInteger(originMin.num, multipleOf);
-	let max = previousInteger(originMax.num, multipleOf);
-	if (min === originMin.num && originMin.exclusive) min += multipleOf;
-	if (max === originMax.num && originMax.exclusive) max -= multipleOf;
-	if (min > max) return;
-	if (min === max) {
-		if (min === Number.POSITIVE_INFINITY) return;
-		if (min === Number.NEGATIVE_INFINITY) return;
+var describer = () => (schema) => {
+	let description;
+	switch (getKind(schema)) {
+		case CompiledKind.Not:
+			description = {
+				kind: ExpressionKind.Not,
+				expression: schema.not
+			};
+			break;
+		case CompiledKind.Combination:
+			if ("allOf" in schema) description = {
+				kind: ExpressionKind.AllOf,
+				expressions: rejectInSchemaList(schema.allOf, CompiledKind.Any)
+			};
+			else if ("anyOf" in schema) description = {
+				kind: ExpressionKind.AnyOf,
+				expressions: rejectInSchemaList(schema.anyOf, CompiledKind.Never)
+			};
+			else if ("oneOf" in schema) description = {
+				kind: ExpressionKind.OneOf,
+				expressions: rejectInSchemaList(schema.oneOf, CompiledKind.Never)
+			};
+			else throw new Error(`invalid combination JSON Schema: ${JSON.stringify(schema)}`);
+			break;
+		default: description = { kind: ExpressionKind.Leaf };
 	}
-	return [{
-		num: min,
-		exclusive: false
-	}, {
-		num: max,
-		exclusive: false
-	}];
-}
-function nextInteger(float, multipleOf) {
-	return Math.ceil(float / multipleOf) * multipleOf;
-}
-function previousInteger(float, multipleOf) {
-	return Math.floor(float / multipleOf) * multipleOf;
-}
-//#endregion
-//#region src/json-schema-subset/checker/numeric/float.ts
-function calculateFloat(schema1, schema2) {
-	const { left, right, center } = splitRange$3(pickRange(schema1), pickRange(schema2));
-	if (!center) return ExpressionRejection;
-	let extraLeft = false;
-	let extraRight = false;
-	if (left) {
-		if (left.fromLeft) extraLeft = true;
-		else extraRight = true;
+	return description;
+};
+var calculator = (extendsContext, context) => (schema1, schema2) => {
+	const kind1 = getKind(schema1);
+	const kind2 = getKind(schema2);
+	if (kind1 === CompiledKind.Extends || kind2 === CompiledKind.Extends) return extendsContext.calculate(schema1, schema2);
+	switch (kind1) {
+		case CompiledKind.Any: return kind2 === CompiledKind.Any ? ExpressionEquals : ExpressionContaining;
+		case CompiledKind.Never: return kind2 === CompiledKind.Never ? ExpressionEquals : ExpressionContainedBy;
 	}
-	if (right) {
-		if (right.fromLeft) extraLeft = true;
-		else extraRight = true;
+	switch (kind2) {
+		case CompiledKind.Any: return ExpressionContainedBy;
+		case CompiledKind.Never: return ExpressionContaining;
 	}
-	if (extraLeft && extraRight) return ExpressionIntersection;
-	if (extraLeft) return ExpressionContaining;
-	if (extraRight) return ExpressionContainedBy;
-	return ExpressionEquals;
-}
-function calculateFloatAndInteger(schema1, schema2) {
-	const floatRange = pickRange(schema1);
-	const integer = normalizeInteger(schema2);
-	if (!integer) return ExpressionContaining;
-	const result = splitRange$3(floatRange, integer.range);
-	const intCenter = cutRange(result.center, integer.multipleOf);
-	const leftIntRange = unwrapAndCutRange(result.left, integer.multipleOf);
-	const rightIntRange = unwrapAndCutRange(result.right, integer.multipleOf);
-	if (!result.center) return ExpressionRejection;
-	let extraFloat = false;
-	let extraInteger = false;
-	if (result.left?.fromLeft) extraFloat = true;
-	if (result.right?.fromLeft) extraFloat = true;
-	if (!intCenter || !isPointRange(result.center)) extraFloat = true;
-	if (leftIntRange) extraInteger = true;
-	if (rightIntRange) extraInteger = true;
-	if (extraFloat && extraInteger) return ExpressionIntersection;
-	if (extraFloat) return ExpressionContaining;
-	if (extraInteger) return ExpressionContainedBy;
-	return ExpressionEquals;
+	if (kind1 === CompiledKind.EnumOrConst && kind2 === CompiledKind.EnumOrConst) return calculateEnumAndEnum(context, schema1, schema2);
+	if (kind1 === CompiledKind.EnumOrConst) return calculateEnumAndSchema(schema1, schema2);
+	if (kind2 === CompiledKind.EnumOrConst) return swap(calculateEnumAndSchema(schema2, schema1));
+	if (kind1 !== kind2) return ExpressionRejection;
+	switch (kind1) {
+		case CompiledKind.Null: return ExpressionEquals;
+		case CompiledKind.Numeric: return calculateNumeric(schema1, schema2);
+		case CompiledKind.String: return calculateString(schema1, schema2);
+		case CompiledKind.Boolean: return ExpressionEquals;
+		case CompiledKind.Object: return calculateObject(context, schema1, schema2);
+		case CompiledKind.Array: return calculateArray(context, schema1, schema2);
+		default: throw new Error(`invalid kind ${kind1}`);
+	}
+};
+function rejectInSchemaList(schemaList, kind) {
+	return schemaList.filter((e) => getKind(e) !== kind);
 }
-function pickRange(schema) {
-	let point1;
-	let point2;
-	if (schema.exclusiveMinimum !== void 0) point1 = {
-		num: schema.exclusiveMinimum,
-		exclusive: true
-	};
-	else if (schema.minimum !== void 0) point1 = {
-		num: schema.minimum,
-		exclusive: false
-	};
-	else point1 = {
-		num: Number.NEGATIVE_INFINITY,
-		exclusive: true
-	};
-	if (schema.exclusiveMaximum !== void 0) point2 = {
-		num: schema.exclusiveMaximum,
-		exclusive: true
-	};
-	else if (schema.maximum !== void 0) point2 = {
-		num: schema.maximum,
-		exclusive: false
-	};
-	else point2 = {
-		num: Number.POSITIVE_INFINITY,
-		exclusive: true
-	};
-	return [point1, point2];
+function isDecisiveMismatch(result) {
+	return !hasEquals(result) && !hasContainedBy(result) && (hasContaining(result) || hasIntersection(result) || hasRejection(result));
 }
-function unwrapAndCutRange(side, multipleOf) {
-	if (!side) return;
-	if (side.fromLeft) return;
-	return cutRange(side.range, multipleOf);
+function findMismatchPath(source, target) {
+	const targetPath = getPath(target);
+	if (!targetPath) return void 0;
+	const sourceKind = getKind(source);
+	const targetKind = getKind(target);
+	if (sourceKind !== targetKind) return [...targetPath, "type"];
+	const sourceSchema = source;
+	const targetSchema = target;
+	switch (targetKind) {
+		case CompiledKind.String:
+			if ((sourceSchema.minLength ?? 0) < (targetSchema.minLength ?? 0)) return [...targetPath, "minLength"];
+			if ((sourceSchema.maxLength ?? Number.POSITIVE_INFINITY) > (targetSchema.maxLength ?? Number.POSITIVE_INFINITY)) return [...targetPath, "maxLength"];
+			if (sourceSchema.pattern !== targetSchema.pattern && targetSchema.pattern) return [...targetPath, "pattern"];
+			if (sourceSchema.format !== targetSchema.format && targetSchema.format) return [...targetPath, "format"];
+			break;
+		case CompiledKind.Numeric:
+			if ((sourceSchema.minimum ?? sourceSchema.exclusiveMinimum ?? Number.NEGATIVE_INFINITY) < (targetSchema.minimum ?? targetSchema.exclusiveMinimum ?? Number.NEGATIVE_INFINITY)) return [...targetPath, targetSchema.exclusiveMinimum == null ? "minimum" : "exclusiveMinimum"];
+			if ((sourceSchema.maximum ?? sourceSchema.exclusiveMaximum ?? Number.POSITIVE_INFINITY) > (targetSchema.maximum ?? targetSchema.exclusiveMaximum ?? Number.POSITIVE_INFINITY)) return [...targetPath, targetSchema.exclusiveMaximum == null ? "maximum" : "exclusiveMaximum"];
+			if (sourceSchema.multipleOf !== targetSchema.multipleOf && targetSchema.multipleOf != null) return [...targetPath, "multipleOf"];
+			break;
+		case CompiledKind.Array:
+			if ((sourceSchema.minItems ?? 0) < (targetSchema.minItems ?? 0)) return [...targetPath, "minItems"];
+			if ((sourceSchema.maxItems ?? Number.POSITIVE_INFINITY) > (targetSchema.maxItems ?? Number.POSITIVE_INFINITY)) return [...targetPath, "maxItems"];
+			if (!sourceSchema.uniqueItems && targetSchema.uniqueItems) return [...targetPath, "uniqueItems"];
+			break;
+		case CompiledKind.Object: {
+			const sourceRequired = new Set(sourceSchema.required ?? []);
+			if ((targetSchema.required ?? []).some((key) => !sourceRequired.has(key))) return [...targetPath, "required"];
+			if ((sourceSchema.minProperties ?? 0) < (targetSchema.minProperties ?? 0)) return [...targetPath, "minProperties"];
+			if ((sourceSchema.maxProperties ?? Number.POSITIVE_INFINITY) > (targetSchema.maxProperties ?? Number.POSITIVE_INFINITY)) return [...targetPath, "maxProperties"];
+			break;
+		}
+		case CompiledKind.EnumOrConst: return [...targetPath, targetSchema.const == null ? "enum" : "const"];
+	}
+	return targetPath;
 }
 //#endregion
-//#region src/json-schema-subset/checker/numeric/integer.ts
-function calculateInteger(schema1, schema2) {
-	const integer1 = normalizeInteger(schema1);
-	const integer2 = normalizeInteger(schema2);
-	if (!integer1 && !integer2) return ExpressionEquals;
-	if (!integer1) return ExpressionContainedBy;
-	if (!integer2) return ExpressionContaining;
-	const { range: range1, multipleOf: multipleOf1 } = integer1;
-	const { range: range2, multipleOf: multipleOf2 } = integer2;
-	const result = splitRange$3(range1, range2);
-	let centerRange;
-	let lcm = 0;
-	if (result.center) {
-		lcm = getLCM(multipleOf1, multipleOf2);
-		centerRange = cutRange(result.center, lcm);
+//#region src/json-schema-subset/extends/extendsContext.ts
+var ExtendsContext = class ExtendsContext {
+	constructor(extendsSchemaClasses = []) {
+		this.extendsSchemaClasses = Object.freeze([...extendsSchemaClasses]);
 	}
-	if (!centerRange) return ExpressionRejection;
-	let extraLeft = false;
-	let extraRight = false;
-	const { left, right } = result;
-	if (left && cutRange(left.range, left.fromLeft ? multipleOf1 : multipleOf2)) {
-		if (left.fromLeft) extraLeft = true;
-		else extraRight = true;
+	tryCompiledExtendsSchema(target, payload) {
+		for (const extendsSchemaClass of this.extendsSchemaClasses) if (extendsSchemaClass.isMatch(target)) return new extendsSchemaClass(createId(), target, payload);
+		return null;
 	}
-	if (right && cutRange(right.range, right.fromLeft ? multipleOf1 : multipleOf2)) {
-		if (right.fromLeft) extraLeft = true;
-		else extraRight = true;
+	isExtendsSchema(target) {
+		for (const extendsSchemaClass of this.extendsSchemaClasses) if (target instanceof extendsSchemaClass) return true;
+		return false;
 	}
-	extraLeft = extraLeft || hasExtraIntegersOnCenter(integer1, centerRange, lcm);
-	extraRight = extraRight || hasExtraIntegersOnCenter(integer2, centerRange, lcm);
-	if (extraLeft && extraRight) return ExpressionIntersection;
-	if (extraLeft) return ExpressionContaining;
-	if (extraRight) return ExpressionContainedBy;
-	return ExpressionEquals;
-}
-function hasExtraIntegersOnCenter({ range, multipleOf }, lcmCenterRange, lcm) {
-	const result = splitRange$3(range, lcmCenterRange);
-	if (cutRange(result.left?.range, multipleOf)) return true;
-	if (cutRange(result.right?.range, multipleOf)) return true;
-	const center = cutRange(result.center, multipleOf);
-	if (!center) return false;
-	const lcmCenterLength = rangeLength(lcmCenterRange);
-	if (rangeLength(center) > lcmCenterLength) return true;
-	if (lcmCenterLength === 1) return false;
-	if (multipleOf < lcm) return true;
-	return false;
+	calculate(schema1, schema2) {
+		const shouldSwap = !(schema1 instanceof this.findMatchedClass(schema1, schema2));
+		let expressionResult = 0;
+		let result;
+		if (shouldSwap) result = schema2.compare(schema1);
+		else result = schema1.compare(schema2);
+		for (let expression of result) {
+			if (shouldSwap) expression = ExtendsContext.swap(expression);
+			expressionResult |= toExpression(expression);
+		}
+		return expressionResult;
+	}
+	equals(schema1, schema2) {
+		if (!(schema1 instanceof this.findMatchedClass(schema1, schema2))) return schema2.equals(schema1);
+		else return schema1.equals(schema2);
+	}
+	findMatchedClass(schema1, schema2) {
+		for (const schemaClass of this.extendsSchemaClasses) {
+			if (schema1 instanceof schemaClass) return schemaClass;
+			if (schema2 instanceof schemaClass) return schemaClass;
+		}
+		throw new Error("Invalid schema");
+	}
+	static swap(expression) {
+		switch (expression) {
+			case ExpressionSingleResult.Containing: return ExpressionSingleResult.ContainedBy;
+			case ExpressionSingleResult.ContainedBy: return ExpressionSingleResult.Containing;
+			default: return expression;
+		}
+	}
+};
+//#endregion
+//#region src/json-schema-subset/preprocessing.ts
+function preprocessSchema(schema, compile, printWarnLog = false) {
+	const schemaResult = compile(schema);
+	if (Array.isArray(schemaResult)) {
+		const errorItems = [];
+		collectWithPathPrefix(errorItems, schemaResult, "$");
+		throw new SchemaError(errorItems);
+	}
+	const { schema: compiledSchema, warns } = schemaResult;
+	if (printWarnLog && warns.length > 0) {
+		console.warn(`found ${warns.length} warns after compile schema`);
+		for (const warn of warns) console.warn(stringifySchemaError(warn));
+	}
+	return compiledSchema;
 }
-/** Returns the least common multiple. */
-function getLCM(a, b) {
-	return a * b / getGCD(a, b);
+function preprocessSchemasPair(schema1, schema2, compile, printWarnLog = false) {
+	const schemaResult1 = compile(schema1);
+	const schemaResult2 = compile(schema2);
+	if (Array.isArray(schemaResult1) || Array.isArray(schemaResult2)) {
+		const errorItems = [];
+		if (Array.isArray(schemaResult1)) collectWithPathPrefix(errorItems, schemaResult1, "$1");
+		if (Array.isArray(schemaResult2)) collectWithPathPrefix(errorItems, schemaResult2, "$2");
+		throw new SchemaError(errorItems);
+	}
+	const { schema: compiledSchema1, warns: superWarns } = schemaResult1;
+	const { schema: compiledSchema2, warns: subWarns } = schemaResult2;
+	if (printWarnLog) {
+		if (superWarns.length > 0) console.warn(`found ${superWarns.length} warns after compile superSchema`);
+		for (const warn of superWarns) console.warn(stringifySchemaError(warn));
+		if (subWarns.length > 0) console.warn(`found ${subWarns.length} warns after compile subSchema`);
+		for (const warn of subWarns) console.warn(stringifySchemaError(warn));
+	}
+	return [compiledSchema1, compiledSchema2];
 }
-/** @returns The greatest common divisor. */
-function getGCD(a, b) {
-	if (a === 0) return b;
-	return getGCD(b % a, a);
+function collectWithPathPrefix(errorItems, compiledItems, prefix) {
+	for (const compiledItem of compiledItems) {
+		const replacedItem = {
+			...compiledItem,
+			path: [prefix, ...compiledItem.path]
+		};
+		errorItems.push(replacedItem);
+	}
 }
-function rangeLength(range) {
-	if (!range) return 0;
-	const [point1, point2] = range;
-	return point2.num - point1.num + 1;
+//#endregion
+//#region src/json-schema-subset/global.ts
+var SubsetCompareResult = Object.freeze({
+	True: 0,
+	False: 1,
+	Unknown: 2
+});
+function makeSubsetCompare({ extendsSchemaClasses, delegate } = {}) {
+	const extendsContext = new ExtendsContext(extendsSchemaClasses);
+	return Object.freeze({
+		compile: (schema, payload, printWarnLog) => {
+			const compiler = (candidate) => compile(candidate, extendsContext, payload, delegate);
+			return preprocessSchema(schema, compiler, printWarnLog);
+		},
+		isSubset: (superSchema, subSchema, printWarnLog = false) => {
+			const compiler = (candidate) => compile(candidate, extendsContext, void 0, delegate);
+			const [schema1, schema2] = preprocessSchemasPair(superSchema, subSchema, compiler, printWarnLog);
+			const { errorPath, expression } = checkWithResult(extendsContext, schema1, schema2);
+			const foundTrueExpression = hasEquals(expression) || hasContainedBy(expression);
+			const foundFalseExpression = hasContaining(expression) || hasIntersection(expression) || hasRejection(expression);
+			if (foundTrueExpression && !foundFalseExpression) return { result: SubsetCompareResult.True };
+			if (!foundTrueExpression && foundFalseExpression) return {
+				errorPath,
+				result: SubsetCompareResult.False
+			};
+			return { result: SubsetCompareResult.Unknown };
+		}
+	});
 }
 //#endregion
-//#region src/json-schema-subset/checker/numeric/checker.ts
-function calculateNumeric(schema1, schema2) {
-	if (isUndefinedNumber(schema1) || isUndefinedNumber(schema2)) return ExpressionAny;
-	const isFloat1 = isFloat(schema1);
-	const isFloat2 = isFloat(schema2);
-	if (isFloat1 && isFloat2) return calculateFloat(schema1, schema2);
-	else if (isFloat1) return calculateFloatAndInteger(schema1, schema2);
-	else if (isFloat2) return swap(calculateFloatAndInteger(schema2, schema1));
-	else return calculateInteger(schema1, schema2);
+//#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
+var isString = (x) => typeof x === "string";
+var isArray = Array.isArray;
+var isObject = (x) => x !== null && typeof x === "object";
+var isPlainObject = (x) => isObject(x) && !isArray(x);
+var toPlainObject = (x) => isPlainObject(x) ? x : void 0;
+//#endregion
+//#region src/manifest/common/schemaComparer.ts
+function isStringLikeSchema(value) {
+	return toPlainObject(value)?.type === "string";
 }
-function isUndefinedNumber(schema) {
-	const { multipleOf } = schema;
-	if (multipleOf === void 0) return false;
-	if (!Number.isInteger(multipleOf)) return true;
-	if (multipleOf < 0) return true;
-	return false;
+function assertSchemaCompareContext(value) {
+	const context = toPlainObject(value);
+	const error = toPlainObject(context?.error);
+	if (context == null || error == null || context.packageId != null && !isString(context.packageId) || error.message != null && !isString(error.message)) throw new TypeError("Invalid schema comparison context.");
 }
-function isFloat(schema) {
-	const { multipleOf } = schema;
-	if (multipleOf !== void 0 && Number.isInteger(multipleOf)) return false;
-	if (schema.type === "integer") return false;
-	return true;
+function parseSchemaCompareContext(value) {
+	if (value == null) return { error: {} };
+	assertSchemaCompareContext(value);
+	return value;
 }
-//#endregion
-//#region src/json-schema-subset/checker/object.ts
-var splitRange$1 = createRangeSplitter(0);
-var quantum = makeQuantum([
-	"hasCommonInRequired",
-	"hasCommonOutRequired",
-	"hasExtra1",
-	"hasExtra2",
-	"hasRejection"
-]);
-function calculateObject(context, schema1, schema2) {
-	if (isPropertiesCountCannotMatch(schema1, schema2)) return ExpressionRejection;
-	const splitRequiredResult = splitRequired(schema1, schema2);
-	if (!splitRequiredResult) return ExpressionRejection;
-	const getProperty1 = createPropertySchemaGetter(schema1);
-	const getProperty2 = createPropertySchemaGetter(schema2);
-	const calculateKey = (key) => {
-		const propertySchema1 = getProperty1(key);
-		const propertySchema2 = getProperty2(key);
-		if (areNotBothNever(propertySchema1, propertySchema2)) return context.calculate(propertySchema1, propertySchema2);
-		else return 0;
-	};
-	const { commonRequired, extraRequired1, extraRequired2 } = splitRequiredResult;
-	const quantumVariable = quantum.variable({});
-	for (const requiredKey of [...commonRequired].toSorted()) quantumVariable.push(calculateKey(requiredKey), calculateCommonRequiredExpression);
-	for (const requiredKey of [...extraRequired1].toSorted()) quantumVariable.push(calculateKey(requiredKey), calculateExtraRequiredExpression1);
-	for (const requiredKey of [...extraRequired2].toSorted()) quantumVariable.push(calculateKey(requiredKey), calculateExtraRequiredExpression2);
-	const { hasOptional1, hasOptional2 } = splitRequiredResult;
-	if (hasOptional1 || hasOptional2) {
-		const calculator = calculateOptionalExpression(hasOptional1, hasOptional2);
-		for (const optionalKey of [...getOptionalKeys(schema1, schema2)].toSorted()) {
-			const expression = calculateKey(optionalKey);
-			if (expression !== 0) quantumVariable.push(expression, calculator);
+var SpecialSchema = class SpecialSchema {
+	static setError(fromSchema, toSchema, message) {
+		if (fromSchema instanceof SpecialSchema) fromSchema.context.error.message = message;
+		else if (toSchema instanceof SpecialSchema) toSchema.context.error.message = message;
+	}
+	constructor(id, value, context) {
+		this.id = id;
+		this.value = value;
+		this.context = parseSchemaCompareContext(context);
+	}
+	compare(other) {
+		if (isCompiledSchema(other) && getKind(other) === CompiledKind.Any) return [ExpressionSingleResult.ContainedBy];
+		return this.compareImpl(other);
+	}
+};
+var SingleSelectSchema = class SingleSelectSchema extends SpecialSchema {
+	static isMatch(value) {
+		const enumValues = toPlainObject(value)?.enum;
+		return Array.isArray(enumValues) && enumValues.every((v) => isString(v));
+	}
+	constructor(id, value, context) {
+		if (!SingleSelectSchema.isMatch(value)) throw new TypeError("Invalid single-select schema.");
+		super(id, value, context);
+	}
+	compareImpl(other) {
+		if (isStringLikeSchema(other)) return [ExpressionSingleResult.ContainedBy];
+		if (other instanceof SingleSelectSchema) {
+			const f = new Set(this.value.enum);
+			let result = ExpressionSingleResult.Equals;
+			for (const v of other.value.enum) {
+				if (!f.has(v)) result = ExpressionSingleResult.ContainedBy;
+				f.delete(v);
+			}
+			if (f.size === 0) return [result];
+			if (f.size === this.value.enum.length) return [ExpressionSingleResult.Rejection];
+			return [ExpressionSingleResult.Intersection];
 		}
-		const additionalProperties1 = schema1.additionalProperties ?? ANY;
-		const additionalProperties2 = schema2.additionalProperties ?? ANY;
-		if (areNotBothNever(additionalProperties1, additionalProperties2)) {
-			const expression = context.calculate(additionalProperties1, additionalProperties2);
-			quantumVariable.push(expression, calculator);
+		return [ExpressionSingleResult.Rejection];
+	}
+	equals(other) {
+		if (other instanceof SingleSelectSchema) {
+			const f = new Set(this.value.enum);
+			for (const v of other.value.enum) {
+				if (!f.has(v)) return false;
+				f.delete(v);
+			}
+			return f.size === 0;
 		}
+		return false;
 	}
-	quantumVariable.update((variable) => {
-		if (!variable.hasRejection) {
-			if (extraRequired1.size > 0) variable.hasExtra2 = true;
-			if (extraRequired2.size > 0) variable.hasExtra1 = true;
+};
+var BinarySchema = class BinarySchema extends SpecialSchema {
+	static isMatch(value) {
+		return toPlainObject(value)?.contentMediaType === "oomol/bin";
+	}
+	constructor(id, value, context) {
+		if (!BinarySchema.isMatch(value)) throw new TypeError("Invalid binary schema.");
+		super(id, value, context);
+	}
+	compareImpl(other) {
+		if (other instanceof BinarySchema) return [ExpressionSingleResult.Equals];
+		else {
+			SpecialSchema.setError(this, other, "edgeError.binDiffType");
+			return [ExpressionSingleResult.Rejection];
 		}
-	});
-	const { requiredKeysCount } = splitRequiredResult;
-	let expression = 0;
-	for (const { hasExtra1, hasExtra2, hasCommonInRequired, hasCommonOutRequired, hasRejection } of quantumVariable) if (!hasCommonInRequired && requiredKeysCount > 0) expression |= ExpressionRejection;
-	else if (!hasCommonOutRequired && requiredKeysCount === 0) expression |= ExpressionRejection;
-	else if (hasRejection) expression |= ExpressionRejection;
-	else if (hasExtra1 && hasExtra2) expression |= ExpressionIntersection;
-	else if (hasExtra1) expression |= ExpressionContaining;
-	else if (hasExtra2) expression |= ExpressionContainedBy;
-	else expression |= ExpressionEquals;
-	return expression;
-}
-function isPropertiesCountCannotMatch(schema1, schema2) {
-	return toExpressionSingleResult(splitRange$1(schema1.minProperties, schema1.maxProperties, schema2.minProperties, schema2.maxProperties)) === ExpressionSingleResult.Rejection;
-}
-function splitRequired(schema1, schema2) {
-	const extraRequired1 = new Set(schema1.required);
-	const extraRequired2 = new Set(schema2.required);
-	const commonRequired = /* @__PURE__ */ new Set();
-	const wholeRequired = /* @__PURE__ */ new Set();
-	const requiredCount1 = extraRequired1.size;
-	const requiredCount2 = extraRequired2.size;
-	for (const key of extraRequired1) {
-		if (extraRequired2.has(key)) commonRequired.add(key);
-		wholeRequired.add(key);
 	}
-	for (const key of extraRequired2) {
-		if (extraRequired1.has(key)) commonRequired.add(key);
-		wholeRequired.add(key);
+	equals(other) {
+		return other instanceof BinarySchema;
 	}
-	const requiredKeysCount = wholeRequired.size;
-	for (const key of commonRequired) {
-		extraRequired1.delete(key);
-		extraRequired2.delete(key);
+};
+var ArtifactSchema = class ArtifactSchema extends SpecialSchema {
+	static isMatch(value) {
+		return toPlainObject(value)?.contentMediaType === "oomol/artifact";
 	}
-	const maxProperties1 = schema1.maxProperties ?? Number.MAX_SAFE_INTEGER;
-	const maxProperties2 = schema2.maxProperties ?? Number.MAX_SAFE_INTEGER;
-	if (requiredKeysCount > maxProperties1 || requiredKeysCount > maxProperties2) return null;
-	return {
-		requiredKeysCount,
-		extraRequired1,
-		extraRequired2,
-		commonRequired,
-		hasOptional1: maxProperties1 > requiredCount1,
-		hasOptional2: maxProperties2 > requiredCount2
-	};
+	constructor(id, value, context) {
+		if (!ArtifactSchema.isMatch(value)) throw new TypeError("Invalid Artifact schema.");
+		super(id, value, context);
+	}
+	compareImpl(other) {
+		if (other instanceof ArtifactSchema) return [ExpressionSingleResult.Equals];
+		SpecialSchema.setError(this, other, "edgeError.artifactDiffType");
+		return [ExpressionSingleResult.Rejection];
+	}
+	equals(other) {
+		return other instanceof ArtifactSchema;
+	}
+};
+function createSchemaComparer() {
+	return makeSubsetCompare({ extendsSchemaClasses: [
+		SingleSelectSchema,
+		BinarySchema,
+		ArtifactSchema
+	] });
 }
-function getOptionalKeys(schema1, schema2) {
-	const optionalKeys = new Set(schema1.required);
-	const properties1 = schema1.properties;
-	const properties2 = schema2.properties;
-	const required1 = schema1.required;
-	const required2 = schema2.required;
-	if (properties1) for (const key in properties1) optionalKeys.add(key);
-	if (properties2) for (const key in properties2) optionalKeys.add(key);
-	if (required1) for (const key of required1) optionalKeys.delete(key);
-	if (required2) for (const key of required2) optionalKeys.delete(key);
-	return optionalKeys;
+createSchemaComparer();
+//#endregion
+//#region src/flow/common/schema.ts
+function schemaObject(schema) {
+	return schema != null && typeof schema == "object" && !Array.isArray(schema) ? schema : void 0;
 }
-var calculateCommonRequiredExpression = (singleExpression, variable) => {
-	switch (singleExpression) {
-		case ExpressionSingleResult.Equals:
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Containing:
-			variable.hasExtra1 = true;
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.ContainedBy:
-			variable.hasExtra2 = true;
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Intersection:
-			variable.hasExtra1 = true;
-			variable.hasExtra2 = true;
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Rejection: variable.hasRejection = true;
+var validators = /* @__PURE__ */ new WeakMap();
+function matchesSchema(value, schema) {
+	return schemaValidationErrors(value, schema).length == 0;
+}
+function schemaValidationErrors(value, schema) {
+	if (typeof schema == "boolean") return schema ? [] : ["The schema does not allow any value."];
+	const source = schemaObject(schema);
+	if (source == null || source.properties != null && schemaObject(source.properties) == null) return ["Invalid output schema."];
+	try {
+		let validator = validators.get(source);
+		if (validator == null) {
+			const declaration = typeof source.$schema == "string" ? source.$schema : "";
+			const draft = declaration.includes("draft-04") ? "4" : declaration.includes("draft-07") ? "7" : declaration.includes("2020-12") ? "2020-12" : "2019-09";
+			validator = new Validator(structuredClone(source), draft);
+			validators.set(source, validator);
+		}
+		const result = validator.validate(value);
+		return result.valid ? [] : result.errors.map((issue) => `${issue.instanceLocation || "/"}: ${issue.error}`);
+	} catch {
+		return ["Output schema validation failed."];
 	}
+}
+//#endregion
+//#region src/decision/common/decision.ts
+var decisionLimits = {
+	choice: 255,
+	score: 10
 };
-var calculateExtraRequiredExpression1 = (singleExpression, variable) => {
-	switch (singleExpression) {
-		case ExpressionSingleResult.Equals:
-		case ExpressionSingleResult.ContainedBy:
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Intersection:
-		case ExpressionSingleResult.Containing:
-			variable.hasExtra1 = true;
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Rejection: variable.hasRejection = true;
+/** Ordered prefixes are shared by authoring, schemas, validation, and execution. */
+function limitDecisionQuestion(question) {
+	if (question.type === "noul" || question.criteria.length <= decisionLimits[question.type]) return question;
+	if (question.type === "choice") return {
+		...question,
+		criteria: question.criteria.slice(0, decisionLimits.choice)
+	};
+	return {
+		...question,
+		criteria: question.criteria.slice(0, decisionLimits.score)
+	};
+}
+function limitDecisionQuestions(questions) {
+	const limited = questions.map(limitDecisionQuestion);
+	return limited.every((question, i) => question === questions[i]) ? questions : limited;
+}
+/** Loading an oversized task also updates its previously generated output schemas. */
+function limitDecisionTask(task) {
+	if (task.executor.kind !== "decision") return task;
+	const original = task.executor.questions;
+	const questions = limitDecisionQuestions(original);
+	if (questions === original) return task;
+	const outputs = task.outputs.map((port) => {
+		if (!("handle" in port)) return port;
+		const index = original.findIndex((question) => question.name === port.handle);
+		if (index < 0 || original[index] === questions[index] || !dequal(port.jsonSchema, answerSchema(original[index]))) return port;
+		return {
+			...port,
+			jsonSchema: decisionAnswerSchema(questions[index])
+		};
+	});
+	return {
+		...task,
+		executor: {
+			...task.executor,
+			questions
+		},
+		outputs
+	};
+}
+var probability = {
+	type: "number",
+	minimum: 0,
+	maximum: 1
+};
+function decisionAnswerSchema(question) {
+	return answerSchema(limitDecisionQuestion(question));
+}
+function answerSchema(question) {
+	const properties = { type: { const: question.type } };
+	if (question.type === "noul") properties.noul = probability;
+	else {
+		const keys = question.type === "choice" ? question.criteria.map((item) => item.name) : question.criteria.map((_, index) => String(index));
+		properties.confidence = probability;
+		properties.probabilities = {
+			type: "object",
+			properties: Object.fromEntries(keys.map((key) => [key, probability])),
+			required: keys,
+			additionalProperties: false
+		};
+		if (question.type === "choice") properties.choice = {
+			type: "string",
+			...keys.length ? { enum: keys } : {}
+		};
+		else {
+			properties.score = {
+				type: "number",
+				minimum: 0,
+				maximum: Math.max(0, keys.length - 1)
+			};
+			properties.legend = {
+				type: "object",
+				properties: Object.fromEntries(keys.map((key) => [key, { type: "string" }])),
+				required: keys,
+				additionalProperties: false
+			};
+		}
 	}
+	return {
+		type: "object",
+		properties,
+		required: Object.keys(properties)
+	};
+}
+//#endregion
+//#region src/flow/common/triggerScheduleSchema.ts
+var triggerScheduleSchema = array(union([object({
+	type: literal("cron"),
+	expression: string(),
+	timezone: string()
+}), object({
+	type: literal("every"),
+	unit: _enum([
+		"day",
+		"hour",
+		"minute",
+		"month",
+		"week"
+	]),
+	value: number()
+})]));
+//#endregion
+//#region src/flow/common/webhookMethod.ts
+var webhookMethods = [
+	"GET",
+	"POST",
+	"PUT",
+	"PATCH",
+	"DELETE"
+];
+function webhookSupportsBody(method) {
+	return method !== "GET";
+}
+var text = string();
+var json = json$1();
+var strings = array(text);
+var port = object({
+	description: text.optional(),
+	jsonSchema: json,
+	nullable: boolean(),
+	handle: text
+});
+var input = port.extend({ value: json.optional() });
+var group = object({
+	collapsed: boolean().optional(),
+	group: text
+});
+var nodeSource = object({
+	kind: literal("node"),
+	nodeId: text,
+	output: text,
+	field: text.optional()
+});
+var flowSource = object({
+	kind: literal("flow"),
+	input: text
+});
+var source = union([
+	nodeSource,
+	flowSource,
+	object({
+		kind: literal("binding"),
+		bindingId: text
+	})
+]);
+var fixedInput = union([object({ kind: literal("unset") }), object({
+	kind: literal("value"),
+	value: json
+})]);
+var mapping = union([fixedInput, object({
+	kind: literal("sources"),
+	sources: array(source)
+})]);
+var inputs = record(text, mapping);
+var ports = {
+	inputs: array(union([input, group])),
+	outputs: array(union([port, group]))
+};
+var capability = union([
+	strictObject({
+		kind: literal("connector"),
+		action: text,
+		connectionId: text.optional(),
+		connections: array(strictObject({
+			connectionId: text,
+			alias: text.optional()
+		}))
+	}),
+	strictObject({
+		kind: literal("connector"),
+		mode: literal("shared")
+	}),
+	strictObject({
+		kind: literal("connector"),
+		mode: literal("independent"),
+		actions: array(strictObject({
+			action: text,
+			connectionId: text.optional()
+		}))
+	}),
+	strictObject({
+		kind: literal("connector"),
+		actionHints: array(text).optional(),
+		connectionHints: array(strictObject({
+			action: text,
+			connectionId: text,
+			alias: text.optional()
+		})).optional()
+	})
+]);
+var inline = object({
+	...ports,
+	name: text,
+	moduleId: text,
+	capabilities: array(capability).optional()
+});
+var agentValue = union([object({
+	kind: literal("value"),
+	value: json
+}), object({
+	kind: literal("input"),
+	input: text
+})]);
+var agentInput$1 = union([agentValue, object({ kind: literal("model") })]);
+var decisionQuestion = discriminatedUnion("type", [
+	strictObject({
+		name: text,
+		instructions: text,
+		type: literal("noul"),
+		criteria: strictObject({
+			true: text.optional(),
+			false: text.optional()
+		}).optional()
+	}),
+	strictObject({
+		name: text,
+		instructions: text,
+		type: literal("choice"),
+		criteria: array(strictObject({
+			name: text,
+			description: text
+		}))
+	}),
+	strictObject({
+		name: text,
+		instructions: text,
+		type: literal("score"),
+		criteria: strings
+	})
+]);
+var managed = object({
+	...ports,
+	name: text,
+	executor: union([
+		object({
+			kind: literal("connector"),
+			action: text,
+			connectionId: text.optional()
+		}),
+		object({
+			kind: literal("openapi"),
+			sourceUrl: text,
+			method: text,
+			path: text,
+			serverUrl: text,
+			document: json,
+			auth: array(object({
+				id: text,
+				type: _enum([
+					"bearer",
+					"basic",
+					"apiKey"
+				]),
+				name: text.optional(),
+				in: _enum(["header", "query"]).optional()
+			}))
+		}),
+		strictObject({
+			kind: literal("decision"),
+			questions: array(decisionQuestion)
+		}),
+		object({
+			kind: literal("llm"),
+			mode: _enum(["chat", "json"])
+		}),
+		object({
+			kind: literal("agent"),
+			code: boolean().optional(),
+			model: text,
+			prompt: text,
+			maxRounds: number(),
+			tools: array(object({
+				id: text,
+				name: text,
+				description: text,
+				action: text,
+				connectionId: text.optional(),
+				approval: boolean(),
+				inputs: array(input.extend({ source: agentInput$1 }))
+			})),
+			notification: object({
+				taskId: text,
+				messageHandle: text,
+				inputs: record(text, agentValue)
+			}).optional()
+		})
+	])
+}).transform(limitDecisionTask);
+var operand = union([object({
+	kind: literal("value"),
+	value: json.optional(),
+	jsonSchema: json.optional()
+}), object({
+	kind: literal("source"),
+	source
+})]);
+var condition = {
+	matchMode: _enum(["first", "all"]),
+	cases: array(object({
+		description: text.optional(),
+		output: text,
+		groups: array(object({ expressions: array(object({
+			left: operand,
+			operator: _enum([
+				"!=",
+				"<",
+				"<=",
+				"==",
+				">",
+				">=",
+				"contains",
+				"endsWith",
+				"hasKey",
+				"hasValue",
+				"isEmpty",
+				"isFalse",
+				"isNotEmpty",
+				"isNotNull",
+				"isNull",
+				"isTrue",
+				"notContains",
+				"notHasKey",
+				"notHasValue",
+				"startsWith"
+			]),
+			right: operand.optional()
+		})) }))
+	}))
 };
-var calculateExtraRequiredExpression2 = (singleExpression, variable) => {
-	switch (singleExpression) {
-		case ExpressionSingleResult.Equals:
-		case ExpressionSingleResult.Containing:
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Intersection:
-		case ExpressionSingleResult.ContainedBy:
-			variable.hasExtra2 = true;
-			variable.hasCommonInRequired = true;
-			break;
-		case ExpressionSingleResult.Rejection: variable.hasRejection = true;
-	}
+var wait = {
+	inputDefinitions: array(input),
+	prompt: text
 };
-var calculateOptionalExpression = (hasOptional1, hasOptional2) => (singleExpression, variable) => {
-	if (variable.hasRejection) return;
-	let foundExtraPossibility1 = false;
-	let foundExtraPossibility2 = false;
-	let foundCommonPossibility = false;
-	switch (singleExpression) {
-		case ExpressionSingleResult.Equals:
-			foundCommonPossibility = true;
-			break;
-		case ExpressionSingleResult.Containing:
-			foundExtraPossibility1 = true;
-			foundCommonPossibility = true;
-			break;
-		case ExpressionSingleResult.ContainedBy:
-			foundExtraPossibility2 = true;
-			foundCommonPossibility = true;
-			break;
-		case ExpressionSingleResult.Intersection:
-			foundExtraPossibility1 = true;
-			foundExtraPossibility2 = true;
-			foundCommonPossibility = true;
-			break;
-		case ExpressionSingleResult.Rejection:
-			foundExtraPossibility1 = true;
-			foundExtraPossibility2 = true;
-	}
-	if (hasOptional1 && foundExtraPossibility1) variable.hasExtra1 = true;
-	if (hasOptional2 && foundExtraPossibility2) variable.hasExtra2 = true;
-	if (hasOptional1 && hasOptional2 && foundCommonPossibility) variable.hasCommonOutRequired = true;
+var webhookOptions = object({
+	allowedMethods: never().optional(),
+	allowedOrigins: strings.optional(),
+	noResponseBody: never().optional(),
+	responseData: text.optional(),
+	responseHeaders: record(text, text).optional(),
+	responseStatusCode: number().int().min(200).max(599).optional()
+});
+var webhook = {
+	bodyFields: array(input),
+	method: _enum(webhookMethods),
+	options: webhookOptions.optional()
 };
-function createPropertySchemaGetter(schema) {
-	const properties = schema.properties;
-	const propertyNames = schema.propertyNames;
-	const additionalProperties = schema.additionalProperties;
-	const patternProperties = [];
-	if (schema.patternProperties) for (const pattern in schema.patternProperties) {
-		const valueSchema = schema.patternProperties[pattern];
-		const regExp = new RegExp(pattern, "i");
-		patternProperties.push({
-			pattern: regExp,
-			schema: valueSchema
-		});
-	}
-	return (key) => {
-		if (propertyNames && valid(propertyNames, key) === ValidResult.Invalid) return NEVER;
-		for (const { pattern, schema: patternSchema } of patternProperties) if (pattern.test(key)) return patternSchema;
-		const propertySchema = (properties && properties[key]) ?? additionalProperties;
-		if (!propertySchema) return ANY;
-		return propertySchema;
-	};
-}
-function areNotBothNever(schema1, schema2) {
-	const kind1 = getKind(schema1);
-	const kind2 = getKind(schema2);
-	return kind1 !== CompiledKind.Never || kind2 !== CompiledKind.Never;
-}
-//#endregion
-//#region src/json-schema-subset/checker/string.ts
-var splitRange = createRangeSplitter(0);
-function calculateString(schema1, schema2) {
-	if (schema2.format && !schema1.format) return ExpressionContaining;
-	if (schema1.format && schema2.format && schema1.format !== schema2.format) return ExpressionAny;
-	const expression = toExpressionSingleResult(splitRange(schema1.minLength, schema1.maxLength, schema2.minLength, schema2.maxLength));
-	const hasPattern1 = !!schema1.pattern;
-	const hasPattern2 = !!schema2.pattern;
-	switch (expression) {
-		case ExpressionSingleResult.Rejection: return ExpressionRejection;
-		case ExpressionSingleResult.Containing: return hasPattern1 ? ExpressionAny : ExpressionContaining;
-		case ExpressionSingleResult.ContainedBy: return hasPattern2 ? ExpressionAny : ExpressionContainedBy;
-		case ExpressionSingleResult.Equals:
-			if (hasPattern1 && hasPattern2) return schema1.pattern === schema2.pattern ? ExpressionEquals : ExpressionAny;
-			if (hasPattern1) return ExpressionEquals | ExpressionContainedBy;
-			if (hasPattern2) return ExpressionEquals | ExpressionContaining;
-			return ExpressionEquals;
-		case ExpressionSingleResult.Intersection:
-			if (hasPattern1 && hasPattern2) return ExpressionAny;
-			if (hasPattern1) return ExpressionIntersection | ExpressionRejection | ExpressionContainedBy;
-			if (hasPattern2) return ExpressionIntersection | ExpressionRejection | ExpressionContaining;
-			return ExpressionIntersection;
-	}
-}
-//#endregion
-//#region src/json-schema-subset/checker/checker.ts
-function checkWithResult(extendsContext, schema1, schema2) {
-	const context = {};
-	const errorPaths = [];
-	const calculate = wrapSchemaCalculatorWithCache(calculator(extendsContext, context));
-	const describe = describer();
-	const equals = schemaEqualsChecker(extendsContext);
-	context.isEquals = wrapEqualsCheckerWithCache(isDeepEquals);
-	context.calculate = expression({
-		describe,
-		equals,
-		calculate,
-		observeCalculation: (left, right, result, swapped) => {
-			if (!isDecisiveMismatch(swapped ? swap(result) : result)) return;
-			const errorPath = swapped ? findMismatchPath(right, left) : findMismatchPath(left, right);
-			if (errorPath) errorPaths.push(errorPath);
-		}
-	});
-	Object.freeze(context);
-	const comparisonExpression = context.calculate(schema1, schema2);
-	return {
-		errorPath: errorPaths[0],
-		expression: comparisonExpression
-	};
-}
-var describer = () => (schema) => {
-	let description;
-	switch (getKind(schema)) {
-		case CompiledKind.Not:
-			description = {
-				kind: ExpressionKind.Not,
-				expression: schema.not
-			};
-			break;
-		case CompiledKind.Combination:
-			if ("allOf" in schema) description = {
-				kind: ExpressionKind.AllOf,
-				expressions: rejectInSchemaList(schema.allOf, CompiledKind.Any)
-			};
-			else if ("anyOf" in schema) description = {
-				kind: ExpressionKind.AnyOf,
-				expressions: rejectInSchemaList(schema.anyOf, CompiledKind.Never)
-			};
-			else if ("oneOf" in schema) description = {
-				kind: ExpressionKind.OneOf,
-				expressions: rejectInSchemaList(schema.oneOf, CompiledKind.Never)
-			};
-			else throw new Error(`invalid combination JSON Schema: ${JSON.stringify(schema)}`);
-			break;
-		default: description = { kind: ExpressionKind.Leaf };
-	}
-	return description;
+var definition = {
+	configInputs: ports.inputs,
+	definitionVersion: literal(2),
+	description: text,
+	displayName: text,
+	key: text,
+	name: text,
+	outputs: array(port).refine((definitions) => new Set(definitions.map((output) => output.handle)).size === definitions.length, "Duplicate Trigger output handle."),
+	provider: text
 };
-var calculator = (extendsContext, context) => (schema1, schema2) => {
-	const kind1 = getKind(schema1);
-	const kind2 = getKind(schema2);
-	if (kind1 === CompiledKind.Extends || kind2 === CompiledKind.Extends) return extendsContext.calculate(schema1, schema2);
-	switch (kind1) {
-		case CompiledKind.Any: return kind2 === CompiledKind.Any ? ExpressionEquals : ExpressionContaining;
-		case CompiledKind.Never: return kind2 === CompiledKind.Never ? ExpressionEquals : ExpressionContainedBy;
-	}
-	switch (kind2) {
-		case CompiledKind.Any: return ExpressionContainedBy;
-		case CompiledKind.Never: return ExpressionContaining;
-	}
-	if (kind1 === CompiledKind.EnumOrConst && kind2 === CompiledKind.EnumOrConst) return calculateEnumAndEnum(context, schema1, schema2);
-	if (kind1 === CompiledKind.EnumOrConst) return calculateEnumAndSchema(schema1, schema2);
-	if (kind2 === CompiledKind.EnumOrConst) return swap(calculateEnumAndSchema(schema2, schema1));
-	if (kind1 !== kind2) return ExpressionRejection;
-	switch (kind1) {
-		case CompiledKind.Null: return ExpressionEquals;
-		case CompiledKind.Numeric: return calculateNumeric(schema1, schema2);
-		case CompiledKind.String: return calculateString(schema1, schema2);
-		case CompiledKind.Boolean: return ExpressionEquals;
-		case CompiledKind.Object: return calculateObject(context, schema1, schema2);
-		case CompiledKind.Array: return calculateArray(context, schema1, schema2);
-		default: throw new Error(`invalid kind ${kind1}`);
-	}
+var endpoint = object({
+	body: object({
+		allowArray: boolean(),
+		allowEmpty: boolean(),
+		formats: array(_enum([
+			"form",
+			"json",
+			"multipart",
+			"text"
+		]))
+	}),
+	methods: array(_enum([
+		"DELETE",
+		"GET",
+		"HEAD",
+		"PATCH",
+		"POST",
+		"PUT"
+	])),
+	successStatus: number()
+});
+var sourceFlowIds = array(text.min(1)).refine((ids) => new Set(ids).size === ids.length, "Duplicate source Flow ID.");
+var trigger = {
+	name: text,
+	description: text.optional(),
+	icon: text.optional()
+};
+var base = {
+	maxExecutions: number().int().positive().max(Number.MAX_SAFE_INTEGER).optional(),
+	inputs,
+	name: text.optional(),
+	description: text.optional(),
+	icon: text.optional(),
+	timeoutMs: number().optional()
+};
+var node = union([
+	object({
+		...base,
+		inputs: record(text, never()),
+		kind: literal("condition"),
+		...condition
+	}),
+	object({
+		...base,
+		inputs: unknown().transform(() => ({})).default({}),
+		kind: literal("value"),
+		values: array(input)
+	}),
+	object({
+		...base,
+		kind: literal("subflow"),
+		subflowId: text
+	}),
+	object({
+		...base,
+		kind: literal("task"),
+		task: inline,
+		additionalInputs: array(input).optional()
+	}),
+	object({
+		...base,
+		kind: literal("task"),
+		taskId: text,
+		additionalInputs: array(input).optional()
+	}),
+	strictObject({
+		...base,
+		kind: literal("approval"),
+		...wait
+	}).omit({ timeoutMs: true }),
+	strictObject({
+		...base,
+		kind: literal("wait"),
+		...wait
+	}).omit({ timeoutMs: true }),
+	object({
+		...trigger,
+		kind: literal("manual")
+	}),
+	strictObject({
+		...trigger,
+		kind: literal("error"),
+		sourceFlowIds: sourceFlowIds.optional()
+	}),
+	object({
+		...trigger,
+		kind: literal("webhook"),
+		...webhook
+	}),
+	object({
+		...trigger,
+		kind: literal("cron"),
+		cronTimes: triggerScheduleSchema
+	}),
+	object({
+		...trigger,
+		kind: literal("poll"),
+		connectionId: text.min(1).optional(),
+		config: record(text, fixedInput),
+		definition: object({
+			...definition,
+			type: literal("poll")
+		}),
+		pollTimes: triggerScheduleSchema
+	}),
+	object({
+		...trigger,
+		kind: literal("integration"),
+		connectionId: text.min(1).optional(),
+		config: record(text, fixedInput),
+		definition: object({
+			...definition,
+			type: literal("integration"),
+			endpoint
+		})
+	})
+]);
+var target = union([object({ kind: literal("flow") }), object({
+	kind: literal("subflow"),
+	id: text
+})]);
+var edge = object({
+	source: text,
+	target: text,
+	sourceHandle: text.optional()
+});
+var at = {
+	nodeId: text,
+	target
 };
-function rejectInSchemaList(schemaList, kind) {
-	return schemaList.filter((e) => getKind(e) !== kind);
-}
-function isDecisiveMismatch(result) {
-	return !hasEquals(result) && !hasContainedBy(result) && (hasContaining(result) || hasIntersection(result) || hasRejection(result));
-}
-function findMismatchPath(source, target) {
-	const targetPath = getPath(target);
-	if (!targetPath) return void 0;
-	const sourceKind = getKind(source);
-	const targetKind = getKind(target);
-	if (sourceKind !== targetKind) return [...targetPath, "type"];
-	const sourceSchema = source;
-	const targetSchema = target;
-	switch (targetKind) {
-		case CompiledKind.String:
-			if ((sourceSchema.minLength ?? 0) < (targetSchema.minLength ?? 0)) return [...targetPath, "minLength"];
-			if ((sourceSchema.maxLength ?? Number.POSITIVE_INFINITY) > (targetSchema.maxLength ?? Number.POSITIVE_INFINITY)) return [...targetPath, "maxLength"];
-			if (sourceSchema.pattern !== targetSchema.pattern && targetSchema.pattern) return [...targetPath, "pattern"];
-			if (sourceSchema.format !== targetSchema.format && targetSchema.format) return [...targetPath, "format"];
-			break;
-		case CompiledKind.Numeric:
-			if ((sourceSchema.minimum ?? sourceSchema.exclusiveMinimum ?? Number.NEGATIVE_INFINITY) < (targetSchema.minimum ?? targetSchema.exclusiveMinimum ?? Number.NEGATIVE_INFINITY)) return [...targetPath, targetSchema.exclusiveMinimum == null ? "minimum" : "exclusiveMinimum"];
-			if ((sourceSchema.maximum ?? sourceSchema.exclusiveMaximum ?? Number.POSITIVE_INFINITY) > (targetSchema.maximum ?? targetSchema.exclusiveMaximum ?? Number.POSITIVE_INFINITY)) return [...targetPath, targetSchema.exclusiveMaximum == null ? "maximum" : "exclusiveMaximum"];
-			if (sourceSchema.multipleOf !== targetSchema.multipleOf && targetSchema.multipleOf != null) return [...targetPath, "multipleOf"];
-			break;
-		case CompiledKind.Array:
-			if ((sourceSchema.minItems ?? 0) < (targetSchema.minItems ?? 0)) return [...targetPath, "minItems"];
-			if ((sourceSchema.maxItems ?? Number.POSITIVE_INFINITY) > (targetSchema.maxItems ?? Number.POSITIVE_INFINITY)) return [...targetPath, "maxItems"];
-			if (!sourceSchema.uniqueItems && targetSchema.uniqueItems) return [...targetPath, "uniqueItems"];
-			break;
-		case CompiledKind.Object: {
-			const sourceRequired = new Set(sourceSchema.required ?? []);
-			if ((targetSchema.required ?? []).some((key) => !sourceRequired.has(key))) return [...targetPath, "required"];
-			if ((sourceSchema.minProperties ?? 0) < (targetSchema.minProperties ?? 0)) return [...targetPath, "minProperties"];
-			if ((sourceSchema.maxProperties ?? Number.POSITIVE_INFINITY) > (targetSchema.maxProperties ?? Number.POSITIVE_INFINITY)) return [...targetPath, "maxProperties"];
-			break;
-		}
-		case CompiledKind.EnumOrConst: return [...targetPath, targetSchema.const == null ? "enum" : "const"];
-	}
-	return targetPath;
-}
-//#endregion
-//#region src/json-schema-subset/extends/extendsContext.ts
-var ExtendsContext = class ExtendsContext {
-	constructor(extendsSchemaClasses = []) {
-		this.extendsSchemaClasses = Object.freeze([...extendsSchemaClasses]);
-	}
-	tryCompiledExtendsSchema(target, payload) {
-		for (const extendsSchemaClass of this.extendsSchemaClasses) if (extendsSchemaClass.isMatch(target)) return new extendsSchemaClass(createId(), target, payload);
-		return null;
-	}
-	isExtendsSchema(target) {
-		for (const extendsSchemaClass of this.extendsSchemaClasses) if (target instanceof extendsSchemaClass) return true;
-		return false;
-	}
-	calculate(schema1, schema2) {
-		const shouldSwap = !(schema1 instanceof this.findMatchedClass(schema1, schema2));
-		let expressionResult = 0;
-		let result;
-		if (shouldSwap) result = schema2.compare(schema1);
-		else result = schema1.compare(schema2);
-		for (let expression of result) {
-			if (shouldSwap) expression = ExtendsContext.swap(expression);
-			expressionResult |= toExpression(expression);
-		}
-		return expressionResult;
-	}
-	equals(schema1, schema2) {
-		if (!(schema1 instanceof this.findMatchedClass(schema1, schema2))) return schema2.equals(schema1);
-		else return schema1.equals(schema2);
-	}
-	findMatchedClass(schema1, schema2) {
-		for (const schemaClass of this.extendsSchemaClasses) {
-			if (schema1 instanceof schemaClass) return schemaClass;
-			if (schema2 instanceof schemaClass) return schemaClass;
-		}
-		throw new Error("Invalid schema");
-	}
-	static swap(expression) {
-		switch (expression) {
-			case ExpressionSingleResult.Containing: return ExpressionSingleResult.ContainedBy;
-			case ExpressionSingleResult.ContainedBy: return ExpressionSingleResult.Containing;
-			default: return expression;
-		}
+var subflow = object({
+	name: text,
+	inputs: array(input),
+	outputs: array(port.extend({ sources: array(union([nodeSource, flowSource])) }))
+});
+var graph = object({
+	nodes: record(text, node),
+	edges: array(edge).default([])
+});
+var binding = object({
+	kind: literal("variable"),
+	target: text
+});
+var module = object({
+	name: text,
+	imports: strings,
+	source: text
+});
+var document = object({
+	bindings: record(text, binding),
+	graph,
+	subflows: record(text, subflow.extend({ graph })),
+	tasks: record(text, managed)
+});
+object({
+	modelVersion: union([
+		literal(2),
+		literal(4),
+		literal(5)
+	]),
+	document,
+	modules: record(text, module)
+}).extend({
+	kind: literal("open-flow-flow-revision"),
+	version: literal(1)
+});
+var shapes = {
+	"graph.trigger.sources.set": {
+		nodeId: text,
+		before: sourceFlowIds.optional(),
+		value: sourceFlowIds.optional()
+	},
+	"binding.create": {
+		bindingId: text,
+		binding
+	},
+	"binding.delete": { bindingId: text },
+	"binding.target.set": {
+		bindingId: text,
+		before: text,
+		value: text
+	},
+	"graph.edge.connect": {
+		target,
+		edge
+	},
+	"graph.edge.disconnect": {
+		target,
+		edge
+	},
+	"graph.node.create": {
+		...at,
+		node
+	},
+	"graph.node.delete": at,
+	"graph.node.field.set": union([
+		object({
+			...at,
+			kind: literal("graph.node.field.set"),
+			field: literal("connectionId"),
+			before: text.min(1).optional(),
+			value: text.min(1).optional()
+		}),
+		object({
+			...at,
+			kind: literal("graph.node.field.set"),
+			field: _enum([
+				"description",
+				"icon",
+				"name"
+			]),
+			before: text.optional(),
+			value: text.optional()
+		}),
+		object({
+			...at,
+			kind: literal("graph.node.field.set"),
+			field: literal("maxExecutions"),
+			before: number().int().positive().max(Number.MAX_SAFE_INTEGER).optional(),
+			value: number().int().positive().max(Number.MAX_SAFE_INTEGER).optional()
+		}),
+		object({
+			...at,
+			kind: literal("graph.node.field.set"),
+			field: literal("timeoutMs"),
+			before: number().optional(),
+			value: number().optional()
+		})
+	]),
+	"graph.node.input.set": {
+		...at,
+		handle: text,
+		before: mapping.optional(),
+		value: mapping.optional()
+	},
+	"graph.node.additional-inputs.set": {
+		...at,
+		before: array(input).optional(),
+		value: array(input).optional()
+	},
+	"graph.node.condition.set": {
+		...at,
+		before: object(condition),
+		value: object(condition)
+	},
+	"graph.node.values.set": {
+		...at,
+		before: array(input),
+		value: array(input)
+	},
+	"graph.node.resolution.set": {
+		...at,
+		target: object({ kind: literal("flow") }),
+		before: object(wait),
+		value: object(wait)
+	},
+	"graph.node.webhook.set": {
+		...at,
+		target: object({ kind: literal("flow") }),
+		before: object(webhook),
+		value: object(webhook)
+	},
+	"graph.node.task.ports.set": {
+		...at,
+		before: object(ports),
+		value: object(ports)
+	},
+	"graph.node.task.name.set": {
+		...at,
+		before: text,
+		value: text
+	},
+	"graph.node.task.capabilities.set": {
+		...at,
+		before: array(capability).optional(),
+		value: array(capability).optional()
+	},
+	"graph.trigger.config.set": {
+		nodeId: text,
+		name: text,
+		before: fixedInput.optional(),
+		value: fixedInput.optional()
+	},
+	"graph.trigger.schedule.set": {
+		nodeId: text,
+		before: triggerScheduleSchema,
+		value: triggerScheduleSchema
+	},
+	"module.create": {
+		moduleId: text,
+		module
+	},
+	"module.delete": { moduleId: text },
+	"module.rename": {
+		moduleId: text,
+		before: text,
+		name: text
+	},
+	"module.source.replace": {
+		moduleId: text,
+		beforeImports: strings,
+		beforeSource: text,
+		imports: strings,
+		source: text
+	},
+	"subflow.create": {
+		subflowId: text,
+		subflow: subflow.extend({ graph })
+	},
+	"subflow.definition.set": {
+		subflowId: text,
+		before: subflow,
+		definition: subflow
+	},
+	"subflow.delete": { subflowId: text },
+	"task.create": {
+		taskId: text,
+		task: managed
+	},
+	"task.delete": { taskId: text },
+	"task.connector.connection.set": {
+		taskId: text,
+		before: text.optional(),
+		value: text.optional()
+	},
+	"task.decision.set": {
+		taskId: text,
+		before: managed,
+		value: managed
+	},
+	"task.openapi.set": {
+		taskId: text,
+		before: managed,
+		value: managed
+	},
+	"task.agent.set": {
+		taskId: text,
+		before: managed,
+		value: managed
+	},
+	"task.llm.mode.set": {
+		taskId: text,
+		before: _enum(["chat", "json"]),
+		value: _enum(["chat", "json"])
+	},
+	"task.name.set": {
+		taskId: text,
+		before: text,
+		value: text
 	}
 };
+array(union([...new Map(Object.entries(shapes).map(([kind, shape]) => [kind, shape instanceof ZodType ? shape : object({
+	kind: literal(kind),
+	...shape
+})])).values()])).min(1);
 //#endregion
-//#region src/json-schema-subset/preprocessing.ts
-function preprocessSchema(schema, compile, printWarnLog = false) {
-	const schemaResult = compile(schema);
-	if (Array.isArray(schemaResult)) {
-		const errorItems = [];
-		collectWithPathPrefix(errorItems, schemaResult, "$");
-		throw new SchemaError(errorItems);
-	}
-	const { schema: compiledSchema, warns } = schemaResult;
-	if (printWarnLog && warns.length > 0) {
-		console.warn(`found ${warns.length} warns after compile schema`);
-		for (const warn of warns) console.warn(stringifySchemaError(warn));
-	}
-	return compiledSchema;
-}
-function preprocessSchemasPair(schema1, schema2, compile, printWarnLog = false) {
-	const schemaResult1 = compile(schema1);
-	const schemaResult2 = compile(schema2);
-	if (Array.isArray(schemaResult1) || Array.isArray(schemaResult2)) {
-		const errorItems = [];
-		if (Array.isArray(schemaResult1)) collectWithPathPrefix(errorItems, schemaResult1, "$1");
-		if (Array.isArray(schemaResult2)) collectWithPathPrefix(errorItems, schemaResult2, "$2");
-		throw new SchemaError(errorItems);
-	}
-	const { schema: compiledSchema1, warns: superWarns } = schemaResult1;
-	const { schema: compiledSchema2, warns: subWarns } = schemaResult2;
-	if (printWarnLog) {
-		if (superWarns.length > 0) console.warn(`found ${superWarns.length} warns after compile superSchema`);
-		for (const warn of superWarns) console.warn(stringifySchemaError(warn));
-		if (subWarns.length > 0) console.warn(`found ${subWarns.length} warns after compile subSchema`);
-		for (const warn of subWarns) console.warn(stringifySchemaError(warn));
-	}
-	return [compiledSchema1, compiledSchema2];
-}
-function collectWithPathPrefix(errorItems, compiledItems, prefix) {
-	for (const compiledItem of compiledItems) {
-		const replacedItem = {
-			...compiledItem,
-			path: [prefix, ...compiledItem.path]
-		};
-		errorItems.push(replacedItem);
-	}
+//#region src/flow/common/condition.ts
+var otherwiseOutput = "otherwise";
+var conditionOperators = [
+	"==",
+	"!=",
+	"<",
+	"<=",
+	">",
+	">=",
+	"contains",
+	"notContains",
+	"startsWith",
+	"endsWith",
+	"hasKey",
+	"notHasKey",
+	"hasValue",
+	"notHasValue",
+	"isEmpty",
+	"isNotEmpty",
+	"isNull",
+	"isNotNull",
+	"isTrue",
+	"isFalse"
+];
+var unaryOperator = (operator) => operator.startsWith("is");
+var operandHandle = (caseIndex, groupIndex, expressionIndex, side) => `${caseIndex}/${groupIndex}/${expressionIndex}/${side}`;
+/** Derived addresses let operand bindings use the ordinary input analysis and editor. Never persisted as node inputs. */
+function conditionOperands(node) {
+	return node.cases.flatMap((item, c) => item.groups.flatMap((group, g) => group.expressions.flatMap((expression, e) => [{
+		handle: operandHandle(c, g, e, "left"),
+		operand: expression.left,
+		expression,
+		side: "left"
+	}, ...!unaryOperator(expression.operator) ? [{
+		handle: operandHandle(c, g, e, "right"),
+		operand: expression.right ?? { kind: "value" },
+		expression,
+		side: "right"
+	}] : []])));
 }
-//#endregion
-//#region src/json-schema-subset/global.ts
-var SubsetCompareResult = Object.freeze({
-	True: 0,
-	False: 1,
-	Unknown: 2
-});
-function makeSubsetCompare({ extendsSchemaClasses, delegate } = {}) {
-	const extendsContext = new ExtendsContext(extendsSchemaClasses);
-	return Object.freeze({
-		compile: (schema, payload, printWarnLog) => {
-			const compiler = (candidate) => compile(candidate, extendsContext, payload, delegate);
-			return preprocessSchema(schema, compiler, printWarnLog);
-		},
-		isSubset: (superSchema, subSchema, printWarnLog = false) => {
-			const compiler = (candidate) => compile(candidate, extendsContext, void 0, delegate);
-			const [schema1, schema2] = preprocessSchemasPair(superSchema, subSchema, compiler, printWarnLog);
-			const { errorPath, expression } = checkWithResult(extendsContext, schema1, schema2);
-			const foundTrueExpression = hasEquals(expression) || hasContainedBy(expression);
-			const foundFalseExpression = hasContaining(expression) || hasIntersection(expression) || hasRejection(expression);
-			if (foundTrueExpression && !foundFalseExpression) return { result: SubsetCompareResult.True };
-			if (!foundTrueExpression && foundFalseExpression) return {
-				errorPath,
-				result: SubsetCompareResult.False
-			};
-			return { result: SubsetCompareResult.Unknown };
-		}
-	});
+function nodeInputMappings(node) {
+	if (node.kind != "condition") return "inputs" in node ? node.inputs : {};
+	return Object.fromEntries(conditionOperands(node).flatMap(({ handle, operand }) => operand.kind == "source" ? [[handle, {
+		kind: "sources",
+		sources: [operand.source]
+	}]] : operand.value === void 0 ? [] : [[handle, {
+		kind: "value",
+		value: operand.value
+	}]]));
 }
-//#endregion
-//#region ../../node_modules/.bun/@wopjs+cast@0.1.16/node_modules/@wopjs/cast/dist/index.mjs
-var isString = (x) => typeof x === "string";
-var isArray = Array.isArray;
-var isObject = (x) => x !== null && typeof x === "object";
-var isPlainObject = (x) => isObject(x) && !isArray(x);
-var toPlainObject = (x) => isPlainObject(x) ? x : void 0;
-//#endregion
-//#region src/manifest/common/schemaComparer.ts
-function isStringLikeSchema(value) {
-	return toPlainObject(value)?.type === "string";
+function conditionInputPorts(node) {
+	return Object.fromEntries(conditionOperands(node).map(({ handle, operand }) => [handle, {
+		jsonSchema: operand.kind === "value" ? operand.jsonSchema ?? {} : {},
+		nullable: operand.kind === "value" ? operand.value === null : true
+	}]));
 }
-function assertSchemaCompareContext(value) {
-	const context = toPlainObject(value);
-	const error = toPlainObject(context?.error);
-	if (context == null || error == null || context.packageId != null && !isString(context.packageId) || error.message != null && !isString(error.message)) throw new TypeError("Invalid schema comparison context.");
+function valueType(value) {
+	return value === null ? "null" : Array.isArray(value) ? "array" : typeof value;
 }
-function parseSchemaCompareContext(value) {
-	if (value == null) return { error: {} };
-	assertSchemaCompareContext(value);
-	return value;
+function operatorsForType(type) {
+	if (type == null) return conditionOperators;
+	return [
+		"==",
+		"!=",
+		...{
+			number: [
+				"<",
+				"<=",
+				">",
+				">="
+			],
+			integer: [
+				"<",
+				"<=",
+				">",
+				">="
+			],
+			string: [
+				"contains",
+				"notContains",
+				"startsWith",
+				"endsWith",
+				"isEmpty",
+				"isNotEmpty"
+			],
+			array: [
+				"contains",
+				"notContains",
+				"isEmpty",
+				"isNotEmpty"
+			],
+			object: [
+				"hasKey",
+				"notHasKey",
+				"hasValue",
+				"notHasValue",
+				"isEmpty",
+				"isNotEmpty"
+			],
+			boolean: ["isTrue", "isFalse"],
+			null: []
+		}[type] ?? [],
+		"isNull",
+		"isNotNull"
+	];
 }
-var SpecialSchema = class SpecialSchema {
-	static setError(fromSchema, toSchema, message) {
-		if (fromSchema instanceof SpecialSchema) fromSchema.context.error.message = message;
-		else if (toSchema instanceof SpecialSchema) toSchema.context.error.message = message;
-	}
-	constructor(id, value, context) {
-		this.id = id;
-		this.value = value;
-		this.context = parseSchemaCompareContext(context);
-	}
-	compare(other) {
-		if (isCompiledSchema(other) && getKind(other) === CompiledKind.Any) return [ExpressionSingleResult.ContainedBy];
-		return this.compareImpl(other);
-	}
-};
-var SingleSelectSchema = class SingleSelectSchema extends SpecialSchema {
-	static isMatch(value) {
-		const enumValues = toPlainObject(value)?.enum;
-		return Array.isArray(enumValues) && enumValues.every((v) => isString(v));
-	}
-	constructor(id, value, context) {
-		if (!SingleSelectSchema.isMatch(value)) throw new TypeError("Invalid single-select schema.");
-		super(id, value, context);
-	}
-	compareImpl(other) {
-		if (isStringLikeSchema(other)) return [ExpressionSingleResult.ContainedBy];
-		if (other instanceof SingleSelectSchema) {
-			const f = new Set(this.value.enum);
-			let result = ExpressionSingleResult.Equals;
-			for (const v of other.value.enum) {
-				if (!f.has(v)) result = ExpressionSingleResult.ContainedBy;
-				f.delete(v);
-			}
-			if (f.size === 0) return [result];
-			if (f.size === this.value.enum.length) return [ExpressionSingleResult.Rejection];
-			return [ExpressionSingleResult.Intersection];
+var normalized = (type) => type == "integer" ? "number" : type;
+function comparisonIssue(operator, leftType, rightType) {
+	if (leftType != null && !operatorsForType(leftType).includes(operator)) return {
+		target: "operator",
+		message: `Operator ${operator} is not compatible with ${leftType}.`
+	};
+	if (unaryOperator(operator) || rightType == null) return;
+	const required = [
+		"<",
+		"<=",
+		">",
+		">="
+	].includes(operator) ? "number" : [
+		"startsWith",
+		"endsWith",
+		"hasKey",
+		"notHasKey"
+	].includes(operator) || ["contains", "notContains"].includes(operator) && leftType == "string" ? "string" : ["==", "!="].includes(operator) ? normalized(leftType) : void 0;
+	if (required != null && required != normalized(rightType)) return {
+		target: "right",
+		message: `Operator ${operator} requires a ${required} right operand.`
+	};
+}
+function compareCondition(operator, left, right) {
+	if (!unaryOperator(operator) && right === void 0) throw new Error("Condition right operand is missing.");
+	const issue = comparisonIssue(operator, valueType(left), right === void 0 ? void 0 : valueType(right));
+	if (issue != null) throw new Error(issue.message);
+	switch (operator) {
+		case "==": return dequal(left, right);
+		case "!=": return !dequal(left, right);
+		case "<": return left < right;
+		case "<=": return left <= right;
+		case ">": return left > right;
+		case ">=": return left >= right;
+		case "contains":
+		case "notContains": {
+			const contains = typeof left == "string" ? left.includes(right) : left.some((item) => dequal(item, right));
+			return operator == "contains" ? contains : !contains;
 		}
-		return [ExpressionSingleResult.Rejection];
-	}
-	equals(other) {
-		if (other instanceof SingleSelectSchema) {
-			const f = new Set(this.value.enum);
-			for (const v of other.value.enum) {
-				if (!f.has(v)) return false;
-				f.delete(v);
-			}
-			return f.size === 0;
+		case "startsWith": return left.startsWith(right);
+		case "endsWith": return left.endsWith(right);
+		case "hasKey":
+		case "notHasKey": {
+			const has = Object.hasOwn(left, right);
+			return operator == "hasKey" ? has : !has;
 		}
-		return false;
-	}
-};
-var BinarySchema = class BinarySchema extends SpecialSchema {
-	static isMatch(value) {
-		return toPlainObject(value)?.contentMediaType === "oomol/bin";
-	}
-	constructor(id, value, context) {
-		if (!BinarySchema.isMatch(value)) throw new TypeError("Invalid binary schema.");
-		super(id, value, context);
-	}
-	compareImpl(other) {
-		if (other instanceof BinarySchema) return [ExpressionSingleResult.Equals];
-		else {
-			SpecialSchema.setError(this, other, "edgeError.binDiffType");
-			return [ExpressionSingleResult.Rejection];
+		case "hasValue":
+		case "notHasValue": {
+			const has = Object.values(left).some((item) => dequal(item, right));
+			return operator == "hasValue" ? has : !has;
 		}
+		case "isEmpty":
+		case "isNotEmpty": {
+			const empty = typeof left == "string" || Array.isArray(left) ? left.length == 0 : Object.keys(left).length == 0;
+			return operator == "isEmpty" ? empty : !empty;
+		}
+		case "isNull": return left === null;
+		case "isNotNull": return left !== null;
+		case "isTrue": return left === true;
+		case "isFalse": return left === false;
 	}
-	equals(other) {
-		return other instanceof BinarySchema;
-	}
-};
-var ArtifactSchema = class ArtifactSchema extends SpecialSchema {
-	static isMatch(value) {
-		return toPlainObject(value)?.contentMediaType === "oomol/artifact";
-	}
-	constructor(id, value, context) {
-		if (!ArtifactSchema.isMatch(value)) throw new TypeError("Invalid Artifact schema.");
-		super(id, value, context);
-	}
-	compareImpl(other) {
-		if (other instanceof ArtifactSchema) return [ExpressionSingleResult.Equals];
-		SpecialSchema.setError(this, other, "edgeError.artifactDiffType");
-		return [ExpressionSingleResult.Rejection];
-	}
-	equals(other) {
-		return other instanceof ArtifactSchema;
+}
+function selectConditionBranches(node, values) {
+	for (const { handle } of conditionOperands(node)) if (!Object.hasOwn(values, handle)) throw new Error(`Condition operand ${handle} is missing.`);
+	const results = node.cases.map((item, c) => {
+		if (item.groups.length == 0) throw new Error("Condition Case requires a group.");
+		return item.groups.map((group, g) => {
+			if (group.expressions.length == 0) throw new Error("Condition group requires an expression.");
+			return group.expressions.map((expression, e) => {
+				const left = values[operandHandle(c, g, e, "left")];
+				const right = unaryOperator(expression.operator) ? void 0 : values[operandHandle(c, g, e, "right")];
+				const issue = comparisonIssue(expression.operator, valueType(left), right === void 0 ? void 0 : valueType(right));
+				if (issue != null || !unaryOperator(expression.operator) && right === void 0) throw new Error(issue?.message ?? "Condition right operand is missing.");
+				return () => compareCondition(expression.operator, left, right);
+			});
+		});
+	});
+	const selected = [];
+	for (const [index, groups] of results.entries()) {
+		if (!groups.some((expressions) => expressions.every((evaluate) => evaluate()))) continue;
+		selected.push(node.cases[index].output);
+		if (node.matchMode == "first") break;
 	}
-};
-function createSchemaComparer() {
-	return makeSubsetCompare({ extendsSchemaClasses: [
-		SingleSelectSchema,
-		BinarySchema,
-		ArtifactSchema
-	] });
+	return selected.length == 0 ? [otherwiseOutput] : selected;
 }
-createSchemaComparer();
 //#endregion
-//#region src/flow/common/schema.ts
-function schemaObject(schema) {
-	return schema != null && typeof schema == "object" && !Array.isArray(schema) ? schema : void 0;
-}
-var validators = /* @__PURE__ */ new WeakMap();
-function matchesSchema(value, schema) {
-	return schemaValidationErrors(value, schema).length == 0;
-}
-function schemaValidationErrors(value, schema) {
-	if (typeof schema == "boolean") return schema ? [] : ["The schema does not allow any value."];
-	const source = schemaObject(schema);
-	if (source == null || source.properties != null && schemaObject(source.properties) == null) return ["Invalid output schema."];
-	try {
-		let validator = validators.get(source);
-		if (validator == null) {
-			const declaration = typeof source.$schema == "string" ? source.$schema : "";
-			const draft = declaration.includes("draft-04") ? "4" : declaration.includes("draft-07") ? "7" : declaration.includes("2020-12") ? "2020-12" : "2019-09";
-			validator = new Validator(structuredClone(source), draft);
-			validators.set(source, validator);
-		}
-		const result = validator.validate(value);
-		return result.valid ? [] : result.errors.map((issue) => `${issue.instanceLocation || "/"}: ${issue.error}`);
-	} catch {
-		return ["Output schema validation failed."];
-	}
+//#region src/flow/common/change.ts
+function portsByHandle(ports) {
+	return Object.fromEntries(ports.flatMap((port) => "handle" in port ? [[port.handle, port]] : []));
 }
 //#endregion
 //#region src/flow/common/agent.ts