clanka 0.8.3 → 0.8.5

package/dist/bin/{Schema-C9JQ5hI0.mjs → Schema-CjUGw2Xh.mjs}

@@ -1,8 +1,8 @@
-import { $a as map$4, $o as symbol, Ao as assignProperty$1, As as memoizeIdempotent, Bo as formatPath, Br as succeed$2, Co as args, Es as dual, Fo as NodeInspectSymbol, Fr as failCause, Ft as runSyncExit, Gn as isReason, Go as equals, Ha as fromNullOr, Hr as ClockRef, Ht as succeedNone, I as flatMap, J as fromResult, Jn as makeFailReason, Jo as combine, Ka as getOrNull, Ki as makeEquivalence$3, Ko as symbol$1, L as flatMapEager, Lo as format$1, Lr as isExit, M as fail$2, Mi as append, Mo as setStackTraceLimit, Ms as Class$2, No as BaseProto, Ns as Prototype, O as die, On as IllegalArgumentError, Os as identity, P as failCauseSync, Pi as empty$2, Pn as die$1, Pr as fail$3, Ps as pipeArguments, Qa as liftThrowable, Ra as filter, Ro as formatDate, Sa as toSeconds, So as TaggedError$2, Ui as isReadonlyArrayNonEmpty, Un as isCause, V as fnUntracedEager, Va as flatten, Vi as isArrayNonEmpty, Vo as formatPropertyKey, Vr as void_$1, Vt as succeed$3, Wn as isFailReason, Xa as isOption, Xn as map$5, Xo as number$1, Xr as effectIsExit, Xt as try_, Ya as isNone, Yn as makeInterruptReason, Yo as hash, Yr as currentTimeMillis$1, Yt as tryPromise, Za as isSome, Zo as string$1, _i as map$2, _o as strictEqual, _s as isTagged, ba as seconds, bi as resolveConcurrency, bo as Error$3, ca as succeed$1, co as Number$4, cs as isNotNullish, ct as mapEager, da as fromInputUnsafe, do as isGreaterThanOrEqualTo$1, ea as fail$1, eo as match, es as hasProperty, fa as infinity, fi as iterateConcurrent, fo as isLessThan$1, fs as isNumber, ga as millis, go as make$8, gs as isString, ho as Tuple$1, hs as isPropertyKey, io as some, is as isFunction, j as exit, jo as getStackTraceLimit, ko as assignProperties, ks as memoize, lo as String$4, ls as isNotUndefined, m as catchCause, ma as isFinite$2, mo as make$9, ms as isObjectKeyword, na as getOrThrow, ns as isBoolean, oo as BigInt$4, os as isNever$1, pa as isDuration, pi as iterateEager, po as isLessThanOrEqualTo$1, ps as isObject, qi as map$3, qn as makeDieReason, qo as array, rn as void_$2, rs as isError, sa as match$1, so as Date$3, st as mapBothEager, to as none, ts as isBigInt, uo as isGreaterThan$1, ut as mapErrorEager, va as nanos, xo as PipeInspectableProto, ya as negativeInfinity, ys as isUnknown, zi as fromIterable$1, zn as fromReasons, zo as formatJson, zr as isSuccess } from "./Effect-BCeySOy1.mjs";
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Tuple.js
+import { $a as liftThrowable, Ao as assignProperties, As as memoize, Bi as fromIterable$1, Bn as fromReasons, Bo as formatJson, Br as isSuccess, Ca as toSeconds, Co as TaggedError$2, Ds as dual, F as failCauseSync, Fi as empty$2, Fn as die$1, Fr as fail$3, Fs as pipeArguments, Gn as isFailReason, H as fnUntracedEager, Ha as flatten, Hi as isArrayNonEmpty, Ho as formatPropertyKey, Hr as void_$1, Ht as succeed$3, Io as NodeInspectSymbol, Ir as failCause, It as runSyncExit, Ji as map$3, Jn as makeDieReason, Jo as array, Kn as isReason, Ko as equals, L as flatMap, M as exit, Mo as getStackTraceLimit, N as fail$2, Ni as append, No as setStackTraceLimit, Ns as Class$2, Po as BaseProto, Ps as Prototype, Qa as isSome, Qo as string$1, R as flatMapEager, Ro as format$1, Rr as isExit, Si as resolveConcurrency, So as PipeInspectableProto, Ua as fromNullOr, Ur as ClockRef, Ut as succeedNone, Vo as formatPath, Vr as succeed$2, Wi as isReadonlyArrayNonEmpty, Wn as isCause, Wt as suspend, Xa as isNone, Xn as makeInterruptReason, Xo as hash, Xr as currentTimeMillis$1, Xt as tryPromise, Y as fromResult, Yn as makeFailReason, Yo as combine, Za as isOption, Zn as map$5, Zo as number$1, Zr as effectIsExit, Zt as try_, _a as millis, _o as make$8, _s as isString, ao as some, as as isFunction, ba as negativeInfinity, bs as isUnknown, ca as match$1, co as Date$3, ct as mapBothEager, do as isGreaterThan$1, dt as mapErrorEager, eo as map$4, es as symbol, fa as fromInputUnsafe, fo as isGreaterThanOrEqualTo$1, go as Tuple$1, gs as isPropertyKey, ha as isFinite$2, ho as make$9, hs as isObjectKeyword, in as void_$2, is as isError, jo as assignProperty$1, js as memoizeIdempotent, k as die, kn as IllegalArgumentError, ks as identity, la as succeed$1, lo as Number$4, ls as isNotNullish, lt as mapEager, m as catchCause, ma as isDuration, mi as iterateEager, mo as isLessThanOrEqualTo$1, ms as isObject, no as none, ns as isBigInt, pa as infinity, pi as iterateConcurrent, po as isLessThan$1, ps as isNumber, qa as getOrNull, qi as makeEquivalence$3, qo as symbol$1, ra as getOrThrow, rs as isBoolean, so as BigInt$4, ss as isNever$1, ta as fail$1, to as match, ts as hasProperty, uo as String$4, us as isNotUndefined, vi as map$2, vo as strictEqual, vs as isTagged, wo as args, xa as seconds, xo as Error$3, ya as nanos, yi as monotonicTimeNanos$1, za as filter, zo as formatDate } from "./Effect-BEUn4I5E.mjs";
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Tuple.js
 const makeEquivalence$2 = Tuple$1;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Record.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Record.js
 const has = dual(2, (self, key) => Object.hasOwn(self, key));
 const map$1 = dual(2, (self, f) => {
 	const out = { ...self };
@@ -20,7 +20,7 @@ const makeEquivalence$1 = (equivalence) => {
 	return (self, that) => is(self, that) && is(that, self);
 };
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Data.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Data.js
 const Class$1 = class extends Class$2 {
 	constructor(props) {
 		super();
@@ -51,17 +51,18 @@ function taggedMatch() {
 const Error$2 = Error$3;
 const TaggedError$1 = TaggedError$2;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/encoding/EncodingError.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/encoding/EncodingError.js
 const EncodingErrorTypeId = "~effect/encoding/EncodingError";
 var EncodingError = class extends TaggedError$1("EncodingError") {
 	[EncodingErrorTypeId] = EncodingErrorTypeId;
 };
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Clock.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Clock.js
 const Clock = ClockRef;
 const currentTimeMillis = currentTimeMillis$1;
+const monotonicTimeNanos = monotonicTimeNanos$1;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/dateTime.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/dateTime.js
 const TypeId$9 = "~effect/DateTime";
 const TimeZoneTypeId = "~effect/DateTime/TimeZone";
 const Proto$3 = {
@@ -189,7 +190,7 @@ const toDate = (self) => {
 	const parts = self.zone.format.formatToParts(self.epochMilliseconds).filter((_) => _.type !== "literal");
 	const date = new Date(0);
 	date.setUTCFullYear(Number(parts[2].value), Number(parts[0].value) - 1, Number(parts[1].value));
-	date.setUTCHours(Number(parts[3].value), Number(parts[4].value), Number(parts[5].value), Number(parts[6].value));
+	date.setUTCHours(Number(parts[3].value), Number(parts[4].value), Number(parts[5].value), parts[6]?.type === "fractionalSecond" ? Number(parts[6].value) : (self.epochMilliseconds % 1e3 + 1e3) % 1e3);
 	self.adjustedEpochMilliseconds = date.getTime();
 	return date;
 };
@@ -232,7 +233,7 @@ const formatIsoOffset = (self) => {
 };
 const formatIsoZoned = (self) => self.zone._tag === "Offset" ? formatIsoOffset(self) : `${formatIsoOffset(self)}[${self.zone.id}]`;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/redacted.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/redacted.js
 const redactedRegistry = new WeakMap();
 const value$1 = (self) => {
 	if (redactedRegistry.has(self)) return redactedRegistry.get(self);
@@ -240,7 +241,7 @@ const value$1 = (self) => {
 };
 const stringOrRedacted = (val) => typeof val === "string" ? val : value$1(val);
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Redacted.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Redacted.js
 const TypeId$8 = "~effect/Redacted";
 const isRedacted = (u) => hasProperty(u, TypeId$8);
 const make$6 = (value, options) => {
@@ -269,7 +270,7 @@ const Proto$2 = {
 const value = value$1;
 const makeEquivalence = (isEquivalent) => make$8((x, y) => isEquivalent(value(x), value(y)));
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/BigDecimal.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/BigDecimal.js
 const TypeId$7 = "~effect/BigDecimal";
 const BigDecimalProto = {
 	[TypeId$7]: TypeId$7,
@@ -373,7 +374,7 @@ const toExponential = (n) => {
 };
 const isZero = (n) => n.value === bigint0;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/DateTime.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/DateTime.js
 const isDateTime = isDateTime$1;
 const isUtc = isUtc$1;
 const fromDateUnsafe = fromDateUnsafe$1;
@@ -387,7 +388,7 @@ const removeTime = removeTime$1;
 const formatIso = formatIso$1;
 const formatIsoDate = formatIsoDate$1;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/encoding/Base64.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/encoding/Base64.js
 const encode = (input) => encodeBytes(typeof input === "string" ? encoder.encode(input) : input);
 const decode = (str) => {
 	const stripped = stripCrlf(str);
@@ -458,7 +459,7 @@ const getCode = (charCode) => {
 	return codes[charCode];
 };
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/http/Cookies.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/http/Cookies.js
 const TypeId$6 = "~effect/http/Cookies";
 const isCookies = (u) => hasProperty(u, TypeId$6);
 const CookieTypeId = "~effect/http/Cookies/Cookie";
@@ -683,7 +684,7 @@ const tryDecodeURIComponent = (str) => {
 	}
 };
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/http/UrlParams.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/http/UrlParams.js
 const TypeId$5 = "~effect/http/UrlParams";
 const isUrlParams = (u) => hasProperty(u, TypeId$5);
 const Proto = {
@@ -757,7 +758,7 @@ const toRecord = (self) => {
 };
 const toReadonlyRecord = toRecord;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/annotations.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/annotations.js
 function resolve$1(ast) {
 	return ast.checks ? ast.checks[ast.checks.length - 1].annotations : ast.annotations;
 }
@@ -783,7 +784,6 @@ const jsonSchemaAnnotationKeys = [
 const resolveIdentifier$1 = resolveAt$1("identifier");
 const resolveIdentifierFallback = resolveAt$1(IDENTIFIER_FALLBACK_KEY);
 const resolveDescription$1 = resolveAt$1("description");
-const resolveBrands = resolveAt$1("brands");
 const getExpected = memoize((ast) => {
 	const identifier = resolve$1(ast)?.identifier;
 	if (typeof identifier === "string") return identifier;
@@ -794,7 +794,6 @@ const annotationExcludedKeys = new Set([
 	STRUCTURAL_ANNOTATION_KEY,
 	"representation",
 	"arbitraryConstraint",
-	"brands",
 	"toJsonSchema",
 	"toCode",
 	"toEquivalence",
@@ -806,7 +805,7 @@ const annotationExcludedKeys = new Set([
 	"toCodecArbitrary"
 ]);
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/parser.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/parser.js
 const missing = Symbol();
 const succeed = succeed$2;
 const missingExit = succeed(missing);
@@ -814,7 +813,7 @@ const sameExit = succeed(missing);
 const toOption = (value) => value === missing ? none() : some(value);
 const fromOptionExit = (option) => option._tag === "None" ? missingExit : succeed(option.value);
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/SchemaIssue.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/SchemaIssue.js
 const TypeId$4 = "~effect/SchemaIssue/Issue";
 function isIssue(u) {
 	return hasProperty(u, TypeId$4) && u[TypeId$4] === TypeId$4;
@@ -1027,7 +1026,7 @@ function findMessage(issue) {
 	if (typeof message === "string") return message;
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/cause.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/cause.js
 function getSchemaIssue(cause) {
 	let issue;
 	for (const reason of cause.reasons) {
@@ -1042,7 +1041,7 @@ function getSchemaIssueOrThrow(cause, message) {
 	return issue;
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/SchemaGetter.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/SchemaGetter.js
 const runGetter = (self, input, options) => {
 	switch (self._tag) {
 		case "Passthrough": return succeed$3(input);
@@ -1170,7 +1169,7 @@ function dateTimeUtcFromInput$1() {
 	});
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/SchemaTransformation.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/SchemaTransformation.js
 const Middleware = class extends Class$2 {
 	_tag = "Middleware";
 	decode;
@@ -1286,7 +1285,7 @@ function fromJsonString$1(options) {
 	return new Transformation(parseJson(options ?? {}), stringifyJson(options));
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/SchemaAST.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/SchemaAST.js
 function makeGuard(tag) {
 	return (ast) => ast._tag === tag;
 }
@@ -1573,19 +1572,20 @@ const Arrays = class extends ASTNodeImpl {
 			else if (index >= tailThreshold) return rest[index - tailThreshold + 1];
 			return rest[0];
 		}
-		return fnUntracedEager(function* (input, options) {
-			if (input === missing) return missing;
-			if (!Array.isArray(input)) return yield* fail$2(new InvalidType(ast, input, options));
-			if (!elements) {
-				elements = ast.elements.map((ast) => ({
-					ast,
-					parser: compileField(ast)
-				}));
-				rest = ast.rest.map((ast) => ({
-					ast,
-					parser: compileField(ast)
-				}));
+		const finish = (state) => {
+			const { input, len, options } = state;
+			if (ast.rest.length === 0 && len > elementLen) for (let i = elementLen; i < len; i++) {
+				const unexpected = new UnexpectedKey(ast, input[i], options);
+				const issue = new Pointer([i], unexpected);
+				if (options.errors === "all") {
+					if (state.issues) state.issues.push(issue);
+					else state.issues = [issue];
+				} else return fail$2(new Composite(ast, [issue], input, options));
 			}
+			if (state.issues) return fail$2(new Composite(ast, state.issues, input, options));
+			return succeed(state.output);
+		};
+		const parse = (input, options) => {
 			const len = input.length;
 			const state = {
 				ast,
@@ -1603,18 +1603,34 @@ const Arrays = class extends ASTNodeImpl {
 				concurrency,
 				end
 			});
-			if (eff) yield* eff;
-			if (ast.rest.length === 0 && len > elementLen) for (let i = elementLen; i <= len - 1; i++) {
-				const unexpected = new UnexpectedKey(ast, input[i], options);
-				const issue = new Pointer([i], unexpected);
-				if (options.errors === "all") {
-					if (state.issues) state.issues.push(issue);
-					else state.issues = [issue];
-				} else return yield* fail$2(new Composite(ast, [issue], input, options));
+			if (!eff) return finish(state);
+			if (effectIsExit(eff)) return flatMapEager(eff, () => finish(state));
+			let first = true;
+			return suspend(() => {
+				if (!first) return parse(input, options);
+				first = false;
+				return flatMap(eff, () => finish(state));
+			});
+		};
+		return (input, options) => {
+			if (input === missing) return missingExit;
+			try {
+				if (!Array.isArray(input)) return fail$2(new InvalidType(ast, input, options));
+				if (!elements) {
+					elements = ast.elements.map((ast) => ({
+						ast,
+						parser: compileField(ast)
+					}));
+					rest = ast.rest.map((ast) => ({
+						ast,
+						parser: compileField(ast)
+					}));
+				}
+				return parse(input, options);
+			} catch (error) {
+				return die(error);
 			}
-			if (state.issues) return yield* fail$2(new Composite(ast, state.issues, input, options));
-			return state.output;
-		});
+		};
 	}
 	_rebuild(recur, checks, encodingChecks) {
 		const elements = mapOrSame(this.elements, recur);
@@ -1673,7 +1689,7 @@ function getIndexSignatureKeys(input, parameter, options = defaultParseOptions)
 			case "String":
 			case "TemplateLiteral": return (stringKeys ??= Object.keys(input)).filter((k) => parameter.matchPart(k, options) !== void 0);
 			case "Number": return (stringKeys ??= Object.keys(input)).filter((k) => parameter.matchKey(k, options) !== void 0);
-			case "Symbol": return (symbolKeys ??= Object.getOwnPropertySymbols(input)).filter((k) => parameter.matchKey(k, options) !== void 0);
+			case "Symbol": return (symbolKeys ??= Object.getOwnPropertySymbols(input)).filter((k) => Object.prototype.propertyIsEnumerable.call(input, k) && parameter.matchKey(k, options) !== void 0);
 			case "Union": return [...new Set(parameter.types.flatMap(go))];
 			default: return [];
 		}
@@ -1732,55 +1748,14 @@ const Objects = class extends ASTNodeImpl {
 		this.propertySignatures = propertySignatures;
 		this.indexSignatures = indexSignatures;
 		this.encodingChecks = encodingChecks;
-		const seen = new Set();
-		const duplicates = [];
-		for (const propertySignature of propertySignatures) {
-			const name = propertySignature.name;
-			if (seen.has(name)) duplicates.push(name);
-			else seen.add(name);
-		}
-		if (duplicates.length > 0) throw new Error(`Duplicate identifiers: ${JSON.stringify(duplicates)}. ts(2300)`);
 	}
 	getParser(compile, compileField = compile) {
 		const ast = this;
-		const expectedKeys = [];
-		for (const ps of ast.propertySignatures) expectedKeys.push(typeof ps.name === "number" ? globalThis.String(ps.name) : ps.name);
-		const hasProperties = expectedKeys.length;
+		const hasProperties = ast.propertySignatures.length;
 		const indexCount = ast.indexSignatures.length;
-		let expectedKeysSet = hasProperties && indexCount ? new Set(expectedKeys) : void 0;
 		if (!hasProperties && !indexCount) return fromRefinement(ast, isNotNullish);
 		let properties;
 		let indexes;
-		const finishIndex = (s, key, k2, inputValue, exitValue) => {
-			if (exitValue._tag === "Failure") return wrapPropertyKeyIssue(s, ast, key, exitValue) ?? void_$1;
-			const value = exitValue === sameExit ? inputValue : exitValue[args];
-			if (k2 !== missing && value !== missing) {
-				if (hasProperties && (expectedKeysSet.has(key) || expectedKeysSet.has(typeof k2 === "number" ? globalThis.String(k2) : k2))) return void_$1;
-				assignProperty$1(s.out, k2, value);
-			}
-			return void_$1;
-		};
-		const parseIndex = (s, key, index, exitKey) => {
-			if (!exitKey) {
-				const eff = index.parserKey(key, s.options);
-				if (!effectIsExit(eff)) return flatMap(exit(eff), (exit) => parseIndex(s, key, index, exit));
-				exitKey = eff;
-			}
-			if (exitKey._tag === "Failure") return wrapPropertyKeyIssue(s, ast, key, exitKey) ?? void_$1;
-			const k2 = exitKey === sameExit ? key : exitKey[args];
-			const inputValue = s.input[key];
-			const result = index.parserValue(inputValue, s.options);
-			return effectIsExit(result) ? finishIndex(s, key, k2, inputValue, result) : flatMap(exit(result), (exit) => finishIndex(s, key, k2, inputValue, exit));
-		};
-		const parseStringIndex = (s, key, index) => {
-			const inputValue = s.input[key];
-			const result = index.parserValue(inputValue, s.options);
-			return effectIsExit(result) ? finishIndex(s, key, key, inputValue, result) : flatMap(exit(result), (exit) => finishIndex(s, key, key, inputValue, exit));
-		};
-		const parseIndexes = indexCount ? iterateConcurrent()({
-			onItem: (s, [key, index]) => index.is.parameter === string ? parseStringIndex(s, key, index) : parseIndex(s, key, index),
-			step: (_s, _item, exit) => exit._tag === "Failure" ? exit : void 0
-		}) : void 0;
 		const compileMembers = () => {
 			if (!properties) {
 				properties = ast.propertySignatures.map((ps) => ({
@@ -1796,69 +1771,102 @@ const Objects = class extends ASTNodeImpl {
 			}
 			return properties;
 		};
-		const fallback = fnUntracedEager(function* (input, options) {
-			if (input === missing) return missing;
-			if (!(typeof input === "object" && input !== null && !Array.isArray(input))) return yield* fail$2(new InvalidType(ast, input, options));
-			compileMembers();
-			const record = input;
-			const out = {};
-			const state = {
-				ast,
-				input: record,
-				out,
-				issues: void 0,
-				options
+		const makeFallback = () => {
+			const expectedKeys = new Set(ast.propertySignatures.map((ps) => typeof ps.name === "number" ? globalThis.String(ps.name) : ps.name));
+			const finishIndex = (s, key, k2, inputValue, exitValue) => {
+				if (exitValue._tag === "Failure") return wrapPropertyKeyIssue(s, ast, key, exitValue) ?? void_$1;
+				const value = exitValue === sameExit ? inputValue : exitValue[args];
+				if (k2 !== missing && value !== missing) {
+					if (hasProperties && (expectedKeys.has(key) || expectedKeys.has(typeof k2 === "number" ? globalThis.String(k2) : k2))) return void_$1;
+					assignProperty$1(s.out, k2, value);
+				}
+				return void_$1;
 			};
-			const errorsAllOption = options.errors === "all";
-			const onExcessPropertyError = options.onExcessProperty === "error";
-			const concurrency = options.concurrency === void 0 ? 1 : resolveConcurrency(options.concurrency);
-			const indexKeys = indexCount && onExcessPropertyError ? ast.indexSignatures.map((index) => getIndexSignatureKeys(record, index.parameter, options)) : void 0;
-			if (onExcessPropertyError) {
-				expectedKeysSet ??= new Set(expectedKeys);
-				const coveredKeys = indexKeys ? new Set(expectedKeysSet) : expectedKeysSet;
-				if (indexKeys) for (const keys of indexKeys) for (const key of keys) coveredKeys.add(key);
-				const inputKeys = Reflect.ownKeys(record);
-				for (let i = 0; i < inputKeys.length; i++) {
-					const key = inputKeys[i];
-					if (!coveredKeys.has(key)) {
-						const unexpected = new UnexpectedKey(ast, record[key], options);
-						const issue = new Pointer([key], unexpected);
-						if (errorsAllOption) {
-							if (state.issues) state.issues.push(issue);
-							else state.issues = [issue];
-							continue;
-						} else return yield* fail$2(new Composite(ast, [issue], input, options));
+			const parseIndex = (s, key, index, exitKey) => {
+				if (!exitKey) {
+					const eff = index.parserKey(key, s.options);
+					if (!effectIsExit(eff)) return flatMap(exit(eff), (exit) => parseIndex(s, key, index, exit));
+					exitKey = eff;
+				}
+				if (exitKey._tag === "Failure") return wrapPropertyKeyIssue(s, ast, key, exitKey) ?? void_$1;
+				const k2 = exitKey === sameExit ? key : exitKey[args];
+				const inputValue = s.input[key];
+				const result = index.parserValue(inputValue, s.options);
+				return effectIsExit(result) ? finishIndex(s, key, k2, inputValue, result) : flatMap(exit(result), (exit) => finishIndex(s, key, k2, inputValue, exit));
+			};
+			const parseStringIndex = (s, key, index) => {
+				const inputValue = s.input[key];
+				const result = index.parserValue(inputValue, s.options);
+				return effectIsExit(result) ? finishIndex(s, key, key, inputValue, result) : flatMap(exit(result), (exit) => finishIndex(s, key, key, inputValue, exit));
+			};
+			const parseIndexes = indexCount ? iterateConcurrent()({
+				onItem: (s, [key, index]) => index.is.parameter === string ? parseStringIndex(s, key, index) : parseIndex(s, key, index),
+				step: (_s, _item, exit) => exit._tag === "Failure" ? exit : void 0
+			}) : void 0;
+			return fnUntracedEager(function* (input, options) {
+				if (input === missing) return missing;
+				if (!(typeof input === "object" && input !== null && !Array.isArray(input))) return yield* fail$2(new InvalidType(ast, input, options));
+				compileMembers();
+				const record = input;
+				const out = {};
+				const state = {
+					ast,
+					input: record,
+					out,
+					issues: void 0,
+					options
+				};
+				const errorsAllOption = options.errors === "all";
+				const onExcessPropertyError = options.onExcessProperty === "error";
+				const concurrency = options.concurrency === void 0 ? 1 : resolveConcurrency(options.concurrency);
+				const indexKeys = indexCount && onExcessPropertyError ? ast.indexSignatures.map((index) => getIndexSignatureKeys(record, index.parameter, options)) : void 0;
+				if (onExcessPropertyError) {
+					const coveredKeys = indexKeys ? new Set(expectedKeys) : expectedKeys;
+					if (indexKeys) for (const keys of indexKeys) for (const key of keys) coveredKeys.add(key);
+					const inputKeys = Reflect.ownKeys(record);
+					for (let i = 0; i < inputKeys.length; i++) {
+						const key = inputKeys[i];
+						if (!coveredKeys.has(key) && Object.prototype.propertyIsEnumerable.call(record, key)) {
+							const unexpected = new UnexpectedKey(ast, record[key], options);
+							const issue = new Pointer([key], unexpected);
+							if (errorsAllOption) {
+								if (state.issues) state.issues.push(issue);
+								else state.issues = [issue];
+								continue;
+							} else return yield* fail$2(new Composite(ast, [issue], input, options));
+						}
 					}
 				}
-			}
-			if (hasProperties) {
-				const eff = concurrency === 1 ? parseProperties(state, properties) : parsePropertiesConcurrent(state, properties, { concurrency });
-				if (eff) yield* eff;
-			}
-			if (indexCount && concurrency === 1) for (let i = 0; i < indexCount; i++) {
-				const index = indexes[i];
-				const parse = index.is.parameter === string ? parseStringIndex : parseIndex;
-				const keys = indexKeys?.[i] ?? (index.is.parameter === string ? Object.keys(record) : getIndexSignatureKeys(record, index.is.parameter, options));
-				for (let j = 0; j < keys.length; j++) {
-					const eff = parse(state, keys[j], index);
-					if (!effectIsExit(eff)) yield* eff;
-					else if (eff._tag === "Failure") return yield* eff;
+				if (hasProperties) {
+					const eff = concurrency === 1 ? parseProperties(state, properties) : parsePropertiesConcurrent(state, properties, { concurrency });
+					if (eff) yield* eff;
 				}
-			}
-			else if (parseIndexes) {
-				const keyPairs = empty$2();
-				for (let i = 0; i < indexCount; i++) {
+				if (indexCount && concurrency === 1) for (let i = 0; i < indexCount; i++) {
 					const index = indexes[i];
+					const parse = index.is.parameter === string ? parseStringIndex : parseIndex;
 					const keys = indexKeys?.[i] ?? (index.is.parameter === string ? Object.keys(record) : getIndexSignatureKeys(record, index.is.parameter, options));
-					for (let j = 0; j < keys.length; j++) keyPairs.push([keys[j], index]);
+					for (let j = 0; j < keys.length; j++) {
+						const eff = parse(state, keys[j], index);
+						if (!effectIsExit(eff)) yield* eff;
+						else if (eff._tag === "Failure") return yield* eff;
+					}
 				}
-				const eff = parseIndexes(state, keyPairs, { concurrency });
-				if (eff) yield* eff;
-			}
-			if (state.issues) return yield* fail$2(new Composite(ast, state.issues, input, options));
-			return out;
-		});
-		if (indexCount) return fallback;
+				else if (parseIndexes) {
+					const keyPairs = empty$2();
+					for (let i = 0; i < indexCount; i++) {
+						const index = indexes[i];
+						const keys = indexKeys?.[i] ?? (index.is.parameter === string ? Object.keys(record) : getIndexSignatureKeys(record, index.is.parameter, options));
+						for (let j = 0; j < keys.length; j++) keyPairs.push([keys[j], index]);
+					}
+					const eff = parseIndexes(state, keyPairs, { concurrency });
+					if (eff) yield* eff;
+				}
+				if (state.issues) return yield* fail$2(new Composite(ast, state.issues, input, options));
+				return out;
+			});
+		};
+		if (indexCount) return makeFallback();
+		let fallback;
 		const resume = (state, index, pending) => {
 			const property = properties[index];
 			return flatMap(exit(pending), (exit) => {
@@ -1871,7 +1879,7 @@ const Objects = class extends ASTNodeImpl {
 		};
 		return (input, options) => {
 			if (input === missing) return missingExit;
-			if (options.errors === "all" || options.onExcessProperty !== void 0 || options.concurrency !== void 0 && resolveConcurrency(options.concurrency) !== 1) return fallback(input, options);
+			if (options.errors === "all" || options.onExcessProperty !== void 0 || options.concurrency !== void 0 && resolveConcurrency(options.concurrency) !== 1) return (fallback ??= makeFallback())(input, options);
 			if (!(typeof input === "object" && input !== null && !Array.isArray(input))) return fail$2(new InvalidType(ast, input, options));
 			const props = compileMembers();
 			const record = input;
@@ -1981,6 +1989,7 @@ function structWithRest(ast, records) {
 	let indexSignatures = ast.indexSignatures;
 	let checks = ast.checks;
 	for (const record of records) {
+		for (const propertySignature of record.propertySignatures) if (propertySignatures.some((ps) => ps.name === propertySignature.name)) throw new Error(`Duplicate identifier: ${JSON.stringify(propertySignature.name)}. ts(2300)`);
 		propertySignatures = propertySignatures.concat(record.propertySignatures);
 		indexSignatures = indexSignatures.concat(record.indexSignatures);
 		checks = combineChecks(checks, record.checks);
@@ -2088,8 +2097,9 @@ function collectSentinels(ast) {
 }
 const candidateIndexCache = new WeakMap();
 const emptyCandidates = Object.freeze([]);
+const getRuntimeType = (input) => input === null ? "null" : Array.isArray(input) ? "array" : typeof input;
 const hasPropertySignature = (input, key) => key === "__proto__" ? Object.hasOwn(input, key) : key in input;
-function getIndex(types) {
+function getCandidateIndex(types) {
 	let index = candidateIndexCache.get(types);
 	if (index) return index;
 	let bySentinel;
@@ -2097,19 +2107,19 @@ function getIndex(types) {
 	let otherwise;
 	let literalCandidates;
 	let onlyLiterals = true;
+	const literalOf = [];
 	for (let i = 0; i < types.length; i++) {
 		const a = types[i];
 		const encoded = toCandidate(a);
 		if (isNever(encoded)) continue;
-		if (onlyLiterals) {
-			if (isLiteral(encoded) || isUniqueSymbol(encoded)) {
-				literalCandidates ??= new Map();
-				const literal = isLiteral(encoded) ? encoded.literal : encoded.symbol;
-				let arr = literalCandidates.get(literal);
-				if (!arr) literalCandidates.set(literal, arr = []);
-				arr.push(a);
-			} else onlyLiterals = false;
-		}
+		if (isLiteral(encoded) || isUniqueSymbol(encoded)) {
+			literalCandidates ??= new Map();
+			const literal = isLiteral(encoded) ? encoded.literal : encoded.symbol;
+			literalOf[i] = literal;
+			let arr = literalCandidates.get(literal);
+			if (!arr) literalCandidates.set(literal, arr = []);
+			arr.push(i);
+		} else onlyLiterals = false;
 		const sentinels = collectSentinels(encoded);
 		if (sentinels.length) {
 			bySentinel ??= new Map();
@@ -2128,18 +2138,21 @@ function getIndex(types) {
 			for (const t of candidateTypes) (otherwise[t] ??= []).push(i);
 		}
 	}
+	const fallbacks = {};
+	const getFallback = (type) => fallbacks[type] ??= Object.freeze(otherwise?.[type] ?? emptyCandidates);
 	if (onlyLiterals && literalCandidates) {
 		literalCandidates.forEach(Object.freeze);
 		index = (input) => literalCandidates.get(input) ?? emptyCandidates;
 	} else if (bySentinel?.size === 1 && !otherwise) {
 		const [key, [byValue]] = bySentinel.entries().next().value;
-		const candidates = byValue;
-		for (const [literal, indexes] of byValue) candidates.set(literal, Object.freeze(Array.from(indexes, (index) => types[index])));
+		const candidates = new Map();
+		for (const [literal, indexes] of byValue) candidates.set(literal, Object.freeze(Array.from(indexes)));
+		const all = Object.freeze(types.map((_, i) => i));
 		index = (input, isConstructor) => {
 			if (isObjectKeyword(input)) {
 				const value = hasPropertySignature(input, key) ? input[key] : void 0;
 				if (value !== void 0) return candidates.get(value) ?? emptyCandidates;
-				if (isConstructor) return types;
+				if (isConstructor) return all;
 			}
 			return emptyCandidates;
 		};
@@ -2147,9 +2160,9 @@ function getIndex(types) {
 		let commonSentinel;
 		for (const entry of bySentinel) if ((!commonSentinel || entry[1][0].size > commonSentinel[1][0].size) && entry[1][1].size === sentinelCandidateCount) commonSentinel = entry;
 		index = (input, isConstructor) => {
-			const base = otherwise?.[input === null ? "null" : Array.isArray(input) ? "array" : typeof input] ?? emptyCandidates;
-			if (!isObjectKeyword(input)) return base.map((i) => types[i]);
-			const selected = new Set(base);
+			const runtimeType = getRuntimeType(input);
+			if (!isObjectKeyword(input)) return getFallback(runtimeType);
+			const selected = new Set(otherwise?.[runtimeType]);
 			let directKey;
 			if (commonSentinel) {
 				const [key, [byValue]] = commonSentinel;
@@ -2157,7 +2170,7 @@ function getIndex(types) {
 				const value = hasKey ? input[key] : void 0;
 				if (hasKey && (!isConstructor || value !== void 0)) {
 					const match = byValue.get(value);
-					if (!match) return base.map((i) => types[i]);
+					if (!match) return getFallback(runtimeType);
 					for (const i of match) selected.add(i);
 					directKey = key;
 				}
@@ -2179,23 +2192,15 @@ function getIndex(types) {
 					for (const i of selected) if (all.has(i) && !match?.has(i)) selected.delete(i);
 				}
 			}
-			return Array.from(selected).sort((a, b) => a - b).map((i) => types[i]);
+			return Array.from(selected).sort((a, b) => a - b);
 		};
 	} else index = (input) => {
-		return (otherwise?.[input === null ? "null" : Array.isArray(input) ? "array" : typeof input] ?? emptyCandidates).map((i) => types[i]).filter(filterLiterals(input));
+		const fallback = getFallback(getRuntimeType(input));
+		return literalCandidates ? fallback.filter((i) => literalOf[i] === void 0 || literalOf[i] === input) : fallback;
 	};
 	candidateIndexCache.set(types, index);
 	return index;
 }
-function filterLiterals(input) {
-	return (ast) => {
-		const encoded = toCandidate(ast);
-		return encoded._tag === "Literal" ? encoded.literal === input : encoded._tag === "UniqueSymbol" ? encoded.symbol === input : true;
-	};
-}
-function getCandidates(input, types, isConstructor = false) {
-	return getIndex(types)(input, isConstructor);
-}
 const Union$1 = class extends ASTNodeImpl {
 	_tag = "Union";
 	types;
@@ -2209,34 +2214,20 @@ const Union$1 = class extends ASTNodeImpl {
 	}
 	getParser(compile, compileField) {
 		const ast = this;
+		const isConstructor = compileField !== void 0;
+		const parsers = [];
+		const parser = (i) => parsers[i] ??= compile(ast.types[i]);
+		let index;
 		return (input, options) => {
 			if (input === missing) return missingExit;
-			const candidates = getCandidates(input, ast.types, compileField !== void 0);
+			const candidates = (index ??= getCandidateIndex(ast.types))(input, isConstructor);
 			if (candidates.length === 0) return fail$2(new AnyOf(ast, [], input, options));
 			if (candidates.length === 1) {
-				const result = compile(candidates[0])(input, options);
+				const result = parser(candidates[0])(input, options);
 				if (result._tag === "Success") return result;
-				return effectIsExit(result) ? failSingleUnionCandidate(ast, result.cause, input, options) : catchCause(result, (cause) => failSingleUnionCandidate(ast, cause, input, options));
+				return effectIsExit(result) ? failSingleUnionCandidate(ast, result.cause, input, options) : catchSingleUnionCandidate(ast, result, input, options);
 			}
-			const state = {
-				ast,
-				compile,
-				input,
-				out: void 0,
-				successes: ast.options?.mode === "oneOf" ? [] : void 0,
-				issues: void 0,
-				options
-			};
-			const eff = parseUnion(state, candidates);
-			if (!eff) {
-				if (state.out) return state.out;
-				return fail$2(new AnyOf(ast, state.issues ?? [], input, options));
-			}
-			return flatMapEager(eff, (_) => {
-				if (state.out === sameExit) return succeed$3(input);
-				if (state.out) return state.out;
-				return fail$2(new AnyOf(ast, state.issues ?? [], input, options));
-			});
+			return parseUnionCandidates(ast, parser, candidates, input, options);
 		};
 	}
 	_rebuild(recur, checks, encodingChecks) {
@@ -2283,11 +2274,38 @@ function failSingleUnionCandidate(ast, cause, input, options) {
 	if (!issue) return failCause(cause);
 	return fail$3(new AnyOf(ast, [issue], input, options));
 }
+function catchSingleUnionCandidate(ast, result, input, options) {
+	return catchCause(result, (cause) => failSingleUnionCandidate(ast, cause, input, options));
+}
+function parseUnionCandidates(ast, parser, candidates, input, options) {
+	const state = {
+		ast,
+		parser,
+		input,
+		out: void 0,
+		successes: ast.options?.mode === "oneOf" ? [] : void 0,
+		issues: void 0,
+		options
+	};
+	const eff = parseUnion(state, candidates);
+	if (!eff) {
+		if (state.out) return state.out;
+		return fail$2(new AnyOf(ast, state.issues ?? [], input, options));
+	}
+	return resumeUnion(eff, state);
+}
+function resumeUnion(eff, state) {
+	return flatMapEager(eff, (_) => {
+		if (state.out === sameExit) return succeed$3(state.input);
+		if (state.out) return state.out;
+		return fail$2(new AnyOf(state.ast, state.issues ?? [], state.input, state.options));
+	});
+}
 const parseUnion = iterateEager()({
-	onItem(s, ast) {
-		return s.compile(ast)(s.input, s.options);
+	onItem(s, i) {
+		return s.parser(i)(s.input, s.options);
 	},
-	step(s, candidate, exit) {
+	step(s, i, exit) {
 		if (exit._tag === "Failure") {
 			const issue = getSchemaIssue(exit.cause);
 			if (issue === void 0) return exit;
@@ -2295,11 +2313,11 @@ const parseUnion = iterateEager()({
 			else s.issues = [issue];
 		} else {
 			if (s.out && s.successes) {
-				s.successes.push(candidate);
+				s.successes.push(s.ast.types[i]);
 				return fail$3(new OneOf(s.ast, s.successes, s.input, s.options));
 			}
 			s.out = exit;
-			if (s.successes) s.successes.push(candidate);
+			if (s.successes) s.successes.push(s.ast.types[i]);
 			else return void_$1;
 		}
 	}
@@ -2397,52 +2415,47 @@ function isFinite$1(annotations) {
 const finite = appendChecks(number, [isFinite$1()]);
 const numberToJson = new Link(new Union$1([finite, nonFiniteLiterals]), new Transformation(Number$3(), transform$1((n) => globalThis.Number.isFinite(n) ? n : globalThis.String(n))));
 function isPattern$1(regExp, annotations) {
-	const source = regExp.source;
-	const pattern = new globalThis.RegExp(source, regExp.flags);
+	const copy = new globalThis.RegExp(regExp);
+	const payload = {
+		source: copy.source,
+		flags: copy.flags
+	};
 	return makeFilter$1((s) => {
-		pattern.lastIndex = 0;
-		return pattern.test(s);
+		copy.lastIndex = 0;
+		return copy.test(s);
 	}, {
-		expected: `a string matching the RegExp ${source}`,
+		expected: `a string matching the RegExp ${payload.source}`,
 		representation: {
 			id: "effect/schema/isPattern",
-			payload: {
-				source,
-				flags: regExp.flags
-			}
+			payload
 		},
-		toJsonSchema: () => ({ pattern: source }),
-		arbitraryConstraint: { patterns: [{
-			source: regExp.source,
-			flags: regExp.flags
-		}] },
+		toJsonSchema: () => [{}, true],
+		arbitraryConstraint: { patterns: [payload] },
 		...annotations
 	});
 }
-function modifyOwnPropertyDescriptors(ast, f) {
-	const d = Object.getOwnPropertyDescriptors(ast);
-	f(d);
-	return Object.create(Object.getPrototypeOf(ast), d);
+const bodyOwners = new WeakMap();
+function copy(ast, changes) {
+	const out = Object.assign(Object.create(Object.getPrototypeOf(ast)), ast, changes);
+	if (Reflect.ownKeys(changes).every((key) => key === "context" || key === "encoding")) bodyOwners.set(out, getContextOwner(ast));
+	return out;
 }
-const contextOwners = new WeakMap();
 function getContextOwner(ast) {
-	return contextOwners.get(ast) ?? ast;
+	const existing = bodyOwners.get(ast);
+	if (existing !== void 0) return existing;
+	if (ast.encoding === void 0) return ast;
+	const owner = Object.assign(Object.create(Object.getPrototypeOf(ast)), ast, { encoding: void 0 });
+	bodyOwners.set(ast, owner);
+	return owner;
 }
 function replaceEncoding(ast, encoding) {
-	if (ast.encoding === encoding) return ast;
-	return modifyOwnPropertyDescriptors(ast, (d) => {
-		d.encoding.value = encoding;
-	});
+	return ast.encoding === encoding ? ast : copy(ast, { encoding });
 }
 function replaceContext(ast, context) {
 	if (ast.context === context) return ast;
 	const owner = getContextOwner(ast);
-	if (owner.context === context) return owner;
-	const out = modifyOwnPropertyDescriptors(ast, (d) => {
-		d.context.value = context;
-	});
-	contextOwners.set(out, owner);
-	return out;
+	if (owner.context === context && owner.encoding === ast.encoding) return owner;
+	return copy(ast, { context });
 }
 function getLastEncoding(ast) {
 	return ast.encoding ? getLastEncoding(ast.encoding[ast.encoding.length - 1].to) : ast;
@@ -2452,19 +2465,15 @@ function annotate(ast, annotations) {
 		const last = ast.checks[ast.checks.length - 1];
 		return replaceChecks(ast, append(ast.checks.slice(0, -1), last.annotate(annotations)));
 	}
-	return modifyOwnPropertyDescriptors(ast, (d) => {
-		d.annotations.value = {
-			...d.annotations.value,
-			...annotations
-		};
-	});
+	return copy(ast, { annotations: {
+		...ast.annotations,
+		...annotations
+	} });
 }
 function replaceChecks(ast, checks) {
 	if (ast._tag === "Suspend" && checks) throw new Error("Cannot add checks to Suspend");
 	if (ast.checks === checks) return ast;
-	return modifyOwnPropertyDescriptors(ast, (d) => {
-		d.checks.value = checks;
-	});
+	return copy(ast, { checks });
 }
 function appendChecks(ast, checks) {
 	return replaceChecks(ast, combineChecks(ast.checks, checks));
@@ -2505,20 +2514,19 @@ function appendTransformation(from, transformation, to) {
 	const link = new Link(from, transformation);
 	return replaceEncoding(to, to.encoding ? [...to.encoding, link] : [link]);
 }
-function brand$1(ast, brand) {
-	const existing = resolveBrands(ast);
-	return annotate(ast, { brands: existing ? [...existing, brand] : [brand] });
-}
 function mapOrSame(as, f) {
-	let changed = false;
-	const out = new Array(as.length);
+	let out;
 	for (let i = 0; i < as.length; i++) {
 		const a = as[i];
 		const fa = f(a);
-		if (fa !== a) changed = true;
-		out[i] = fa;
+		if (out) out[i] = fa;
+		else if (fa !== a) {
+			out = new Array(as.length);
+			for (let j = 0; j < i; j++) out[j] = as[j];
+			out[i] = fa;
+		}
 	}
-	return changed ? out : as;
+	return out ?? as;
 }
 function annotateKey(ast, annotations) {
 	return replaceContext(ast, ast.context ? new Context(ast.context.isOptional, ast.context.isMutable, ast.context.constructorDefault, {
@@ -2544,10 +2552,10 @@ function parseParameter(ast) {
 	function go(ast) {
 		switch (ast._tag) {
 			case "Literal":
-				if (isPropertyKey(ast.literal)) literals.push(ast.literal);
+				if (isPropertyKey(ast.literal) && !literals.includes(ast.literal)) literals.push(ast.literal);
 				return;
 			case "UniqueSymbol":
-				literals.push(ast.symbol);
+				if (!literals.includes(ast.symbol)) literals.push(ast.symbol);
 				return;
 			case "Never": return;
 			case "Union":
@@ -2583,16 +2591,28 @@ function extractStructuralChecks(checks) {
 	const out = checks.flatMap(extract);
 	return isArrayNonEmpty(out) ? out : void 0;
 }
+function canPreserveEncodingChecks(ast) {
+	let preserve = true;
+	function visit(child) {
+		preserve = preserve && !child.encoding && !isSuspend(child);
+		if (preserve && "recur" in child) child.recur(visit);
+		return child;
+	}
+	if ("recur" in ast) ast.recur(visit);
+	return preserve;
+}
 const toType$1 = memoizeIdempotent((ast) => {
-	if (ast.encoding) return toType$1(replaceEncoding(ast, void 0));
-	const out = ast;
-	const type = out.recur?.(toType$1) ?? out;
-	const encodingChecks = type.encodingChecks;
-	if (encodingChecks) {
-		const checks = type === ast ? encodingChecks : isArrays(type) || isObjects(type) || isDeclaration(type) && type.typeParameters.length > 0 ? extractStructuralChecks(encodingChecks) : void 0;
-		return modifyOwnPropertyDescriptors(type, (d) => {
-			d.encodingChecks.value = void 0;
-			d.checks.value = combineChecks(type.checks, checks);
+	const owner = getContextOwner(ast);
+	if (owner !== ast) {
+		const type = toType$1(owner);
+		return type === owner && ast.encoding === void 0 ? ast : replaceContext(type, ast.context);
+	}
+	const type = "recur" in ast ? ast.recur(toType$1) : ast;
+	if ("encodingChecks" in type && type.encodingChecks) {
+		const checks = canPreserveEncodingChecks(ast) ? type.encodingChecks : isArrays(type) || isObjects(type) || isDeclaration(type) && type.typeParameters.length > 0 ? extractStructuralChecks(type.encodingChecks) : void 0;
+		return copy(type, {
+			encodingChecks: void 0,
+			checks: combineChecks(type.checks, checks)
 		});
 	}
 	return type;
@@ -2612,8 +2632,12 @@ function flipEncoding(ast, encoding) {
 }
 const flip = memoize((ast) => {
 	if (ast.encoding) return flipEncoding(ast, ast.encoding);
-	const out = ast;
-	return out.flip?.(flip) ?? out.recur?.(flip) ?? out;
+	const owner = getContextOwner(ast);
+	if (owner !== ast) {
+		const flipped = flip(owner);
+		return flipped === owner ? ast : replaceContext(flipped, ast.context);
+	}
+	return "flip" in ast ? ast.flip(flip) : "recur" in ast ? ast.recur(flip) : ast;
 });
 function containsUndefined(ast) {
 	switch (ast._tag) {
@@ -2784,7 +2808,7 @@ const StringTree = new Declaration([], () => (input, ast, options) => isStringTr
 });
 const unknownToStringTree = new Link(StringTree, passthrough());
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/interpreter.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/interpreter.js
 const flatMapTransformation = (result, current, f) => result === sameExit ? f(current) : flatMapEager(result, f);
 function compileTransformation(transformation) {
 	if (transformation._tag === "Middleware") return (result, current, options) => {
@@ -2916,7 +2940,7 @@ function compile(ast, compile, compileField, base, specialize) {
 	};
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/compilerRegistry.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/compilerRegistry.js
 const invalid = Symbol();
 const cache = new WeakMap();
 let compiler;
@@ -3004,7 +3028,7 @@ function resolve(ast) {
 	return entry;
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/SchemaParser.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/SchemaParser.js
 function makeEffect(schema) {
 	const ast = schema.ast;
 	let parser;
@@ -3158,10 +3182,35 @@ function makeConstructorSync(ast) {
 const normalCompiler = (ast) => resolve(ast).parser;
 const constructorCompiler = (ast) => resolve(ast).makeEffect;
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/make.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/make.js
 const TypeId$1 = "~effect/Schema/Schema";
+const RebuildOptions = Symbol();
 const SchemaProto = {
 	[TypeId$1]: TypeId$1,
+	get make() {
+		const value = make$2(this);
+		Object.defineProperty(this, "make", {
+			value,
+			enumerable: true
+		});
+		return value;
+	},
+	get makeEffect() {
+		const value = makeEffect(this);
+		Object.defineProperty(this, "makeEffect", {
+			value,
+			enumerable: true
+		});
+		return value;
+	},
+	get makeOption() {
+		const value = makeOption(this);
+		Object.defineProperty(this, "makeOption", {
+			value,
+			enumerable: true
+		});
+		return value;
+	},
 	pipe() {
 		return pipeArguments(this, arguments);
 	},
@@ -3173,6 +3222,9 @@ const SchemaProto = {
 	},
 	check(...checks) {
 		return this.rebuild(appendChecks(this.ast, checks));
+	},
+	rebuild(ast) {
+		return make$1(ast, this[RebuildOptions]);
 	}
 };
 function make$1(ast, options) {
@@ -3180,15 +3232,12 @@ function make$1(ast, options) {
 	const self = Object.setPrototypeOf(Schema, SchemaProto);
 	if (options && (Object.hasOwn(options, "name") || Object.hasOwn(options, "length") || Object.hasOwn(options, "__proto__"))) Object.defineProperties(self, Object.getOwnPropertyDescriptors({ ...options }));
 	else Object.assign(self, options);
+	self[RebuildOptions] = options;
 	self.ast = ast;
-	self.rebuild = (ast) => make$1(ast, options);
-	self.makeEffect = makeEffect(self);
-	self.make = make$2(self);
-	self.makeOption = makeOption(self);
 	return self;
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/JsonPointer.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/JsonPointer.js
 function escapeToken(token) {
 	return token.replace(/~/g, "~0").replace(/\//g, "~1");
 }
@@ -3215,7 +3264,7 @@ function parseUriFragment(fragment) {
 	return pointer === void 0 ? void 0 : pointer.length === 0 ? [] : pointer.slice(1).split("/").map(unescapeToken);
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/JsonSchema.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/JsonSchema.js
 function getReferenceKey($ref) {
 	const path = $ref.startsWith("#") ? parseUriFragment($ref) : void 0;
 	return path !== void 0 && path.length === 2 && path[0] === "$defs" ? path[1] : void 0;
@@ -3311,7 +3360,7 @@ const OPEN_API_30_TO_2020_COLLISIONS = [
 	"then"
 ];
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/toCodec.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/toCodec.js
 function toCodecJson$1(schema) {
 	return make$1(toCodecJsonAST(schema.ast), { schema });
 }
@@ -3329,16 +3378,7 @@ function validateCanonicalObjectPropertyNames(ast) {
 }
 function makeReorder(getPriority) {
 	return (types) => {
-		const indexMap = new Map();
-		for (let i = 0; i < types.length; i++) indexMap.set(toEncoded$1(types[i]), i);
-		const sortedTypes = [...types].sort((a, b) => {
-			a = toEncoded$1(a);
-			b = toEncoded$1(b);
-			const pa = getPriority(a);
-			const pb = getPriority(b);
-			if (pa !== pb) return pa - pb;
-			return indexMap.get(a) - indexMap.get(b);
-		});
+		const sortedTypes = [...types].sort((a, b) => getPriority(toEncoded$1(a)) - getPriority(toEncoded$1(b)));
 		if (!sortedTypes.some((ast, index) => ast !== types[index])) return types;
 		return sortedTypes;
 	};
@@ -3446,17 +3486,17 @@ const toCodecStringTreeAST = applyToSelfOrLastLinkEncodingIdempotent((ast) => {
 	return out;
 }, { stopAt: isCodecArrayFromSingleLink });
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/RegExp.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/RegExp.js
 const RegExp$1 = globalThis.RegExp;
 const escape = (string) => string.replace(/[/\\^$*+?.()|[\]{}]/g, "\\$&");
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/errors.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/errors.js
 function errorWithPath(message, path) {
 	if (path.length > 0) message += `\n  at ${formatPath(path)}`;
 	return new Error(message);
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/toJsonSchemaDocument.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/toJsonSchemaDocument.js
 function formatDefinitionReference(key) {
 	return `#/$defs/${formatUriFragmentToken(key)}`;
 }
@@ -3579,44 +3619,62 @@ function appendJsonSchema(left, right, inlineCheck) {
 		allOf: members
 	};
 }
+function isExact(exactness, seen = new Set()) {
+	if (typeof exactness === "boolean") return exactness;
+	if (seen.has(exactness)) return true;
+	seen.add(exactness);
+	return exactness.every((dependency) => isExact(dependency, seen));
+}
+function isApproximateCheckOutput(output) {
+	return Array.isArray(output);
+}
 function compileJsonSchema(representations, rootPaths, references, options) {
-	const definitionStates = new Map();
+	const compiledDefinitions = new Map();
+	const definitionAliases = new Map();
 	const compiledRepresentations = new WeakMap();
+	const pendingOneOf = new Map();
 	const fallbackDefinitions = new Map();
 	const referenceKeys = Object.keys(references);
 	for (const key of referenceKeys) compileDefinition(key, ["references", key]);
-	const schemas = map$3(representations, (representation, index) => finalizeJsonSchema(recur(representation, rootPaths[index])));
-	const definitions = {};
-	for (const key of referenceKeys) {
-		const compiled = definitionStates.get(key);
-		if (typeof compiled !== "string") assignProperty$1(definitions, key, finalizeJsonSchema(compiled));
+	const compiledSchemas = map$3(representations, (representation, index) => recur(representation, rootPaths[index], []));
+	for (const [branches, schemas] of pendingOneOf.values()) if (!isExact(branches)) {
+		for (const schema of schemas) if (Array.isArray(schema.oneOf)) {
+			schema.anyOf = schema.oneOf;
+			delete schema.oneOf;
+		}
 	}
+	for (const key of referenceKeys) {
+		const representation = references[key];
+		const fallback = getIdentifierFallback(representation);
+		if (fallback === void 0) continue;
+		const schema = compiledDefinitions.get(key)[0];
+		const candidates = fallbackDefinitions.get(fallback);
+		const match = candidates?.find((candidate) => equals(compiledDefinitions.get(candidate)[0], schema));
+		if (match === void 0) {
+			if (candidates === void 0) fallbackDefinitions.set(fallback, [key]);
+			else candidates.push(key);
+		} else definitionAliases.set(key, match);
+	}
+	const schemas = map$3(compiledSchemas, finalizeJsonSchema);
+	const definitions = {};
+	for (const key of referenceKeys) if (!definitionAliases.has(key)) assignProperty$1(definitions, key, finalizeJsonSchema(compiledDefinitions.get(key)[0]));
 	return {
 		dialect: "draft-2020-12",
 		schemas,
 		definitions
 	};
+	function registerPendingOneOf(schema) {
+		if (Array.isArray(schema.oneOf)) pendingOneOf.get(schema.oneOf)?.[1].push(schema);
+		return schema;
+	}
 	function compileDefinition(key, path) {
-		const compiled = definitionStates.get(key);
-		if (compiled !== void 0) return typeof compiled === "string" ? compiled : key;
 		if (!Object.hasOwn(references, key)) throw errorWithPath(`Invalid reference ${key}`, [...path, "$ref"]);
-		definitionStates.set(key, null);
-		const representation = references[key];
-		const schema = recur(representation, ["references", key]);
-		const fallback = getIdentifierFallback(representation);
-		if (fallback !== void 0) {
-			const candidates = fallbackDefinitions.get(fallback);
-			const match = candidates?.find((candidate) => equals(definitionStates.get(candidate), schema));
-			if (match === void 0) {
-				if (candidates === void 0) fallbackDefinitions.set(fallback, [key]);
-				else candidates.push(key);
-			} else {
-				definitionStates.set(key, match);
-				return match;
-			}
-		}
-		definitionStates.set(key, schema);
-		return key;
+		const cached = compiledDefinitions.get(key);
+		if (cached !== void 0) return cached;
+		const result = [{}, []];
+		compiledDefinitions.set(key, result);
+		result[0] = recur(references[key], ["references", key], result[1]);
+		return result;
 	}
 	function finalizeJsonSchema(schema) {
 		return rewriteRefs(schema, ($ref) => {
@@ -3627,8 +3685,8 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 			}
 			if (!pointer.startsWith("/$defs/")) return $ref;
 			const separator = pointer.indexOf("/", 7);
-			const canonical = definitionStates.get(unescapeToken(pointer.slice(7, separator < 0 ? void 0 : separator)));
-			if (typeof canonical !== "string") return $ref;
+			const canonical = definitionAliases.get(unescapeToken(pointer.slice(7, separator < 0 ? void 0 : separator)));
+			if (canonical === void 0) return $ref;
 			return $ref.replace(/^#(?:\/|%2f).*?(?:\/|%2f).*?(?=\/|%2f|$)/i, formatDefinitionReference(canonical));
 		});
 	}
@@ -3637,48 +3695,63 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 		const annotations = representation.checks.length === 0 ? representation.annotations : representation.checks[representation.checks.length - 1].annotations;
 		return typeof annotations?.identifier !== "string" && typeof annotations?.["~identifier"] === "string" ? annotations[IDENTIFIER_FALLBACK_KEY] : void 0;
 	}
-	function annotationSchemas(representation, path) {
-		return representation?.schemas?.map((schema, index) => recur(schema, [
-			...path,
-			"schemas",
-			index
-		])) ?? [];
-	}
-	function compileCheck(check, type, path) {
+	function compileCheck(check, type, path, dependencies) {
 		const annotations = check.annotations;
 		const callback = annotations?.toJsonSchema;
 		if (callback !== void 0) {
-			const fragment = callback({
+			const result = callback({
 				type,
-				schemas: annotationSchemas(check.representation, [...path, "representation"])
+				schemas: check.representation?.schemas?.map((schema, index) => recur(schema, [
+					...path,
+					"representation",
+					"schemas",
+					index
+				], dependencies)) ?? []
 			});
+			const approximate = isApproximateCheckOutput(result);
+			if (approximate) dependencies.push(false);
+			const fragment = approximate ? result[0] : result;
 			const ordinary = collectJsonSchemaAnnotations(annotations, options);
 			const schema = ordinary === void 0 ? fragment : {
 				...fragment,
 				...ordinary
 			};
 			const allowed = ordinary === void 0 ? inlineableCheckKeywords : inlineableAnnotatedCheckKeywords;
-			return check._tag === "Filter" && hasOnlyKeywords(schema, allowed) && (ordinary === void 0 || hasOnlyKeywords(ordinary, promotableAnnotationKeywords)) ? [schema, true] : [schema];
+			return [schema, check._tag === "Filter" && hasOnlyKeywords(schema, allowed) && (ordinary === void 0 || hasOnlyKeywords(ordinary, promotableAnnotationKeywords)) ? true : void 0];
 		}
-		if (check._tag === "Filter") return void 0;
-		const children = check.checks.map((child, index) => compileCheck(child, type, [
-			...path,
-			"checks",
-			index
-		])).filter((child) => child !== void 0);
-		if (children.length === 0) return void 0;
+		if (check._tag === "Filter") {
+			dependencies.push(false);
+			return;
+		}
+		const schemas = check.checks.flatMap((child, index) => {
+			const result = compileCheck(child, type, [
+				...path,
+				"checks",
+				index
+			], dependencies);
+			return result === void 0 ? [] : [result[0]];
+		});
+		if (schemas.length === 0) return void 0;
 		const ordinary = collectJsonSchemaAnnotations(annotations, options);
-		const allOf = children.map(([schema]) => schema);
-		return [ordinary === void 0 ? { allOf } : {
-			allOf,
+		const schema = { allOf: schemas };
+		return [ordinary === void 0 ? schema : {
+			...schema,
 			...ordinary
 		}];
 	}
-	function recur(representation, path) {
-		if (representation._tag === "Reference") return { $ref: formatDefinitionReference(compileDefinition(representation.$ref, path)) };
+	function recur(representation, path, dependencies) {
+		if (representation._tag === "Reference") {
+			dependencies.push(compileDefinition(representation.$ref, path)[1]);
+			return { $ref: formatDefinitionReference(representation.$ref) };
+		}
 		const cached = compiledRepresentations.get(representation);
-		if (cached !== void 0) return cached;
-		let output = on(representation, path);
+		if (cached !== void 0) {
+			dependencies.push(cached[1]);
+			return cached[0];
+		}
+		const local = [];
+		dependencies.push(local);
+		let output = on(representation, path, local);
 		const ordinary = collectJsonSchemaAnnotations(representation.annotations, options);
 		if (ordinary !== void 0) output = {
 			...output,
@@ -3690,13 +3763,13 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 				...path,
 				"checks",
 				index
-			]);
+			], local);
 			if (check !== void 0) output = appendJsonSchema(output, ...check);
 		}
-		compiledRepresentations.set(representation, output);
-		return output;
+		compiledRepresentations.set(representation, [output, local]);
+		return registerPendingOneOf(output);
 	}
-	function on(representation, path) {
+	function on(representation, path, dependencies) {
 		switch (representation._tag) {
 			case "Any":
 			case "Unknown": return {};
@@ -3716,8 +3789,10 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 				type: "string",
 				enum: [globalThis.String(representation.symbol)]
 			};
-			case "Declaration": return {};
-			case "Suspend": return recur(representation.thunk, [...path, "thunk"]);
+			case "Declaration":
+				dependencies.push(false);
+				return {};
+			case "Suspend": return recur(representation.thunk, [...path, "thunk"], dependencies);
 			case "Never": return { not: {} };
 			case "String": return { type: "string" };
 			case "Number": return { anyOf: [{ type: "number" }, {
@@ -3765,14 +3840,14 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 				let minItems = representation.elements.length;
 				const prefixItems = representation.elements.map((element, index) => {
 					if (element.isOptional) minItems--;
-					const compiled = recur(element.type, [
+					const schema = recur(element.type, [
 						...path,
 						"elements",
 						index,
 						"type"
-					]);
+					], dependencies);
 					const annotations = collectJsonSchemaAnnotations(element.annotations, options);
-					return annotations === void 0 ? compiled : appendJsonSchema(compiled, annotations);
+					return annotations === void 0 ? schema : registerPendingOneOf(appendJsonSchema(schema, annotations));
 				});
 				if (prefixItems.length > 0) {
 					out.prefixItems = prefixItems;
@@ -3785,7 +3860,7 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 						...path,
 						"rest",
 						0
-					]);
+					], dependencies);
 					if (Object.keys(rest).length > 0) out.items = rest;
 					else delete out.items;
 				}
@@ -3805,14 +3880,14 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 						"name"
 					]);
 					const name = property.name;
-					const compiled = recur(property.type, [
+					const schema = recur(property.type, [
 						...path,
 						"propertySignatures",
 						index,
 						"type"
-					]);
+					], dependencies);
 					const annotations = collectJsonSchemaAnnotations(property.annotations, options);
-					assignProperty$1(properties, name, annotations === void 0 ? compiled : appendJsonSchema(compiled, annotations));
+					assignProperty$1(properties, name, annotations === void 0 ? schema : registerPendingOneOf(appendJsonSchema(schema, annotations)));
 					if (!property.isOptional) required.push(name);
 				}
 				if (representation.propertySignatures.length > 0) out.properties = properties;
@@ -3828,7 +3903,7 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 						"indexSignatures",
 						index,
 						"type"
-					]);
+					], dependencies);
 					if (equals(type, { not: {} })) type = false;
 					indexValueSchemas.push(type);
 					const patterns = getParameterPatterns(signature.parameter, [
@@ -3839,12 +3914,13 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 					], new Set());
 					if (patterns === void 0) {
 						hasUnrepresentableIndexPattern = true;
+						dependencies.push(false);
 						continue;
 					}
 					if (patterns.length === 0) additionalPropertySchemas.push(type);
 					else for (const pattern of patterns) {
 						const previous = patternProperties[pattern];
-						assignProperty$1(patternProperties, pattern, previous === void 0 ? type : previous === false || type === false ? false : appendJsonSchema(previous, type));
+						assignProperty$1(patternProperties, pattern, previous === void 0 ? type : previous === false || type === false ? false : registerPendingOneOf(appendJsonSchema(previous, type)));
 					}
 				}
 				const hasPatternProperties = Object.keys(patternProperties).length > 0;
@@ -3857,7 +3933,7 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 						"indexSignatures",
 						index,
 						"parameter"
-					]));
+					], dependencies));
 					out.propertyNames = propertyNames.length === 1 ? propertyNames[0] : { anyOf: propertyNames };
 					out.additionalProperties = indexValueSchemas.length === 1 ? indexValueSchemas[0] : { anyOf: indexValueSchemas };
 					if (additionalPropertySchemas.length > 0) out.allOf = additionalPropertySchemas.map((type) => ({
@@ -3874,18 +3950,21 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 				return out;
 			}
 			case "Union": {
+				const branches = [];
 				const types = representation.types.map((type, index) => recur(type, [
 					...path,
 					"types",
 					index
-				]));
+				], branches));
+				dependencies.push(branches);
 				if (types.length === 0) return { not: {} };
 				const mode = representation.options?.mode ?? "anyOf";
 				if (mode === "anyOf" && types.length > 1) {
 					const compacted = compactEnums(types);
 					if (compacted !== void 0) return compacted;
 				}
-				return mode === "anyOf" ? { anyOf: types } : { oneOf: types };
+				if (mode === "oneOf") pendingOneOf.set(types, [branches, []]);
+				return { [mode]: types };
 			}
 		}
 	}
@@ -3901,7 +3980,9 @@ function compileJsonSchema(representations, rootPaths, references, options) {
 			case "String": {
 				if (parameter.checks.length === 0) return [];
 				if (parameter.checks.length !== 1 || parameter.checks[0]._tag !== "Filter" || parameter.checks[0].annotations?.toJsonSchema === void 0) return;
-				const schema = recur(parameter, path);
+				const dependencies = [];
+				const schema = recur(parameter, path, dependencies);
+				if (!isExact(dependencies)) return void 0;
 				return schema.type === "string" && typeof schema.pattern === "string" && hasOnlyKeywords(schema, "|type|pattern|title|description|default|examples|readOnly|writeOnly|") ? [schema.pattern] : void 0;
 			}
 			case "TemplateLiteral": return parameter.checks.length === 0 ? [`^${parameter.parts.map(getPartPattern).join("")}$`] : void 0;
@@ -3963,7 +4044,7 @@ function toJsonSchemaDocument$1(document, options) {
 	};
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schema/toRepresentation.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schema/toRepresentation.js
 const defaultReferencePolicy = ({ identifier }) => identifier;
 function annotationsField(annotations) {
 	return annotations === void 0 ? void 0 : { annotations };
@@ -4227,7 +4308,7 @@ function toRepresentations(asts, options) {
 	}
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Struct.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Struct.js
 const omit = dual(2, (self, keys) => {
 	return buildStruct(self, (k, v) => !hasPropertyKey(keys, k) ? [k, v] : void 0);
 });
@@ -4251,13 +4332,13 @@ function buildStruct(source, f) {
 	return out;
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/internal/schemaError.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/internal/schemaError.js
 const SchemaErrorTypeId = "~effect/Schema/SchemaError";
 function isSchemaError$1(u) {
 	return hasProperty(u, "~effect/Schema/SchemaError") && u["~effect/Schema/SchemaError"] === "~effect/Schema/SchemaError";
 }
 //#endregion
-//#region node_modules/.pnpm/effect@https+++pkg.pr.new+Effect-TS+effect+effect@b3032f0_f95638f588f5b9b247401a051448b365/node_modules/effect/dist/Schema.js
+//#region node_modules/.pnpm/effect@4.0.1/node_modules/effect/dist/Schema.js
 const TypeId = TypeId$1;
 function declareConstructor() {
 	return (typeParameters, run, annotations) => {
@@ -4438,7 +4519,7 @@ function check(...checks) {
 	return (self) => self.check(...checks);
 }
 function brand(identifier) {
-	return (schema) => make(brand$1(schema.ast, identifier), {
+	return (schema) => make(schema.ast, {
 		schema,
 		identifier
 	});
@@ -4610,8 +4691,10 @@ function makeFilterGroup(checks, annotations = void 0) {
 function isPattern(regExp, annotations) {
 	const source = regExp.source;
 	const flags = regExp.flags;
+	const canExport = /^[dg]*uy?$/.test(flags);
 	const runtimeRegExp = flags === "" ? `new RegExp(${format$1(source)})` : `new RegExp(${format$1(source)}, ${format$1(flags)})`;
 	return isPattern$1(regExp, {
+		toJsonSchema: () => canExport ? { pattern: flags.endsWith("y") ? `^(?:${source})` : source } : [{}, true],
 		toCode: () => ({ runtime: `Schema.isPattern(${runtimeRegExp})` }),
 		...annotations
 	});
@@ -4794,7 +4877,7 @@ function isInt(annotations) {
 			id: "effect/schema/isInt",
 			payload: null
 		},
-		toJsonSchema: () => ({ type: "integer" }),
+		toJsonSchema: () => [{ type: "integer" }, true],
 		toCode: () => ({ runtime: "Schema.isInt()" }),
 		arbitraryConstraint: { number: "integer" },
 		...annotations
@@ -4817,7 +4900,7 @@ const isGreaterThanDate = makeIsGreaterThan({
 				id: "effect/schema/isGreaterThanDate",
 				payload: { exclusiveMinimum: encodeDatePayload(exclusiveMinimum) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isGreaterThanDate(${formatDateRuntime(exclusiveMinimum)})` })
 		};
 	}
@@ -4830,7 +4913,7 @@ const isGreaterThanOrEqualToDate = makeIsGreaterThanOrEqualTo({
 				id: "effect/schema/isGreaterThanOrEqualToDate",
 				payload: { minimum: encodeDatePayload(minimum) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isGreaterThanOrEqualToDate(${formatDateRuntime(minimum)})` })
 		};
 	}
@@ -4843,7 +4926,7 @@ const isLessThanDate = makeIsLessThan({
 				id: "effect/schema/isLessThanDate",
 				payload: { exclusiveMaximum: encodeDatePayload(exclusiveMaximum) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isLessThanDate(${formatDateRuntime(exclusiveMaximum)})` })
 		};
 	}
@@ -4856,7 +4939,7 @@ const isLessThanOrEqualToDate = makeIsLessThanOrEqualTo({
 				id: "effect/schema/isLessThanOrEqualToDate",
 				payload: { maximum: encodeDatePayload(maximum) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isLessThanOrEqualToDate(${formatDateRuntime(maximum)})` })
 		};
 	}
@@ -4876,7 +4959,7 @@ const isBetweenDate = makeIsBetween({
 					...exclusiveMaximum && { exclusiveMaximum }
 				}
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isBetweenDate({ minimum: ${formatDateRuntime(options.minimum)}, maximum: ${formatDateRuntime(options.maximum)}, exclusiveMinimum: ${format$1(exclusiveMinimum)}, exclusiveMaximum: ${format$1(exclusiveMaximum)} })` })
 		};
 	}
@@ -4889,7 +4972,7 @@ const isGreaterThanBigInt = makeIsGreaterThan({
 				id: "effect/schema/isGreaterThanBigInt",
 				payload: { exclusiveMinimum: exclusiveMinimum.toString(10) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isGreaterThanBigInt(${format$1(exclusiveMinimum)})` })
 		};
 	}
@@ -4902,7 +4985,7 @@ const isGreaterThanOrEqualToBigInt = makeIsGreaterThanOrEqualTo({
 				id: "effect/schema/isGreaterThanOrEqualToBigInt",
 				payload: { minimum: minimum.toString(10) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isGreaterThanOrEqualToBigInt(${format$1(minimum)})` })
 		};
 	}
@@ -4915,7 +4998,7 @@ const isLessThanBigInt = makeIsLessThan({
 				id: "effect/schema/isLessThanBigInt",
 				payload: { exclusiveMaximum: exclusiveMaximum.toString(10) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isLessThanBigInt(${format$1(exclusiveMaximum)})` })
 		};
 	}
@@ -4928,7 +5011,7 @@ const isLessThanOrEqualToBigInt = makeIsLessThanOrEqualTo({
 				id: "effect/schema/isLessThanOrEqualToBigInt",
 				payload: { maximum: maximum.toString(10) }
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isLessThanOrEqualToBigInt(${format$1(maximum)})` })
 		};
 	}
@@ -4948,20 +5031,26 @@ const isBetweenBigInt = makeIsBetween({
 					...exclusiveMaximum && { exclusiveMaximum }
 				}
 			},
-			toJsonSchema: () => ({}),
+			toJsonSchema: () => [{}, true],
 			toCode: () => ({ runtime: `Schema.isBetweenBigInt({ minimum: ${format$1(options.minimum)}, maximum: ${format$1(options.maximum)}, exclusiveMinimum: ${format$1(exclusiveMinimum)}, exclusiveMaximum: ${format$1(exclusiveMaximum)} })` })
 		};
 	}
 });
 function isMinLength(minLength, annotations) {
-	minLength = Math.max(0, Math.floor(minLength));
+	minLength = normalizeCardinality(minLength);
+	return makeIsMinLength(minLength, Math.ceil(minLength / 2), annotations);
+}
+function makeIsMinLength(minLength, minCodePoints, annotations) {
 	return makeFilter((input) => input.length >= minLength, {
 		expected: `a value with a length of at least ${minLength}`,
 		representation: {
 			id: "effect/schema/isMinLength",
 			payload: { minLength }
 		},
-		toJsonSchema: ({ type }) => type === "array" ? { minItems: minLength } : { minLength },
+		toJsonSchema: ({ type }) => type === "string" ? minLength <= 1 ? { minLength: minCodePoints } : [{ minLength: minCodePoints }, true] : type === "array" ? { minItems: minLength } : type === void 0 ? [{
+			minLength: minCodePoints,
+			minItems: minLength
+		}, true] : [{}, true],
 		toCode: () => ({ runtime: `Schema.isMinLength(${minLength})` }),
 		[STRUCTURAL_ANNOTATION_KEY]: true,
 		arbitraryConstraint: { minLength },
@@ -4969,32 +5058,39 @@ function isMinLength(minLength, annotations) {
 	});
 }
 function isNonEmpty(annotations) {
-	return isMinLength(1, annotations);
+	return makeIsMinLength(1, 1, annotations);
 }
 function isMaxLength(maxLength, annotations) {
-	maxLength = Math.max(0, Math.floor(maxLength));
+	maxLength = normalizeCardinality(maxLength);
 	return makeFilter((input) => input.length <= maxLength, {
 		expected: `a value with a length of at most ${maxLength}`,
 		representation: {
 			id: "effect/schema/isMaxLength",
 			payload: { maxLength }
 		},
-		toJsonSchema: ({ type }) => type === "array" ? { maxItems: maxLength } : { maxLength },
+		toJsonSchema: ({ type }) => type === "string" ? maxLength === 0 ? { maxLength } : [{ maxLength }, true] : type === "array" ? { maxItems: maxLength } : type === void 0 ? [{
+			maxLength,
+			maxItems: maxLength
+		}, true] : [{}, true],
 		toCode: () => ({ runtime: `Schema.isMaxLength(${maxLength})` }),
 		[STRUCTURAL_ANNOTATION_KEY]: true,
 		arbitraryConstraint: { maxLength },
 		...annotations
 	});
 }
+function normalizeCardinality(value) {
+	if (!globalThis.Number.isFinite(value)) throw new globalThis.RangeError(`Expected a finite number, got ${value}`);
+	return Math.max(0, Math.floor(value));
+}
 function isMaxProperties(maxProperties, annotations) {
-	maxProperties = Math.max(0, Math.floor(maxProperties));
+	maxProperties = normalizeCardinality(maxProperties);
 	return makeFilter((input) => Reflect.ownKeys(input).length <= maxProperties, {
 		expected: `a value with at most ${maxProperties === 1 ? "1 entry" : `${maxProperties} entries`}`,
 		representation: {
 			id: "effect/schema/isMaxProperties",
 			payload: { maxProperties }
 		},
-		toJsonSchema: () => ({ maxProperties }),
+		toJsonSchema: ({ type }) => type === "object" ? { maxProperties } : [{ maxProperties }, true],
 		toCode: () => ({ runtime: `Schema.isMaxProperties(${maxProperties})` }),
 		[STRUCTURAL_ANNOTATION_KEY]: true,
 		arbitraryConstraint: { maxProperties },
@@ -5023,7 +5119,7 @@ function isPropertyNames(keySchema, annotations) {
 			payload: null,
 			schemas: [propertyNames.ast]
 		},
-		toJsonSchema: ({ schemas }) => ({ propertyNames: schemas[0] }),
+		toJsonSchema: ({ schemas, type }) => type === "object" ? { propertyNames: schemas[0] } : [{ propertyNames: schemas[0] }, true],
 		toCode: ({ schemas }) => ({ runtime: `Schema.isPropertyNames(${schemas[0].runtime})` }),
 		[STRUCTURAL_ANNOTATION_KEY]: true,
 		...annotations
@@ -5783,6 +5879,6 @@ const MutableJson = make(annotate(MutableJson$1, { toCode: () => ({
 	Type: "Schema.MutableJson"
 }) }));
 //#endregion
-export { declare as $, Union$1 as $t, OptionFromNullOr as A, toString as An, tag as At, TaggedUnion as B, isRedacted as Bn, omit as Bt, Never as C, transform$1 as Cn, isSchemaError as Ct, NullOr as D, empty as Dn, mutable as Dt, Null as E, Pointer as En, makeFilterGroup as Et, String$1 as F, formatIso as Fn, toType as Ft, Uint8Array$1 as G, EncodingError as Gn, encodeEffect$1 as Gt, Tuple as H, value as Hn, _is as Ht, Struct as I, formatIsoDate as In, withConstructorDefault as It, Union as J, TaggedError$1 as Jn, FilterGroup as Jt, Uint8ArrayFromBase64 as K, Error$2 as Kn, Arrays as Kt, StructWithRest as L, fromDateUnsafe as Ln, withDecodingDefault as Lt, Record as M, fromSetCookie as Mn, toCodecStringTree as Mt, Redacted as N, decode as Nn, toEncoded as Nt, Number$1 as O, fromInput as On, optional as Ot, SchemaError as P, encode as Pn, toJsonSchemaDocument as Pt, check as Q, map$1 as Qn, Suspend as Qt, TaggedClass as R, now as Rn, withDecodingDefaultKey as Rt, Natural as S, passthrough$1 as Sn, isSchema as St, NonEmptyString as T, InvalidValue as Tn, makeFilter as Tt, URL$1 as U, stringOrRedacted as Un, decodeEffect$1 as Ut, TrueLiterals as V, make$6 as Vn, getReferenceKey as Vt, URLFromString as W, Clock as Wn, decodeUnknownEffect$1 as Wt, Void as X, assignProperty as Xn, Objects as Xt, Unknown as Y, taggedEnum as Yn, Literal$1 as Yt, brand as Z, makeEquivalence$1 as Zn, PropertySignature as Zt, Int as _, transform as _n, isMaxLength as _t, BooleanLiterals as a, null_ as an, decodeUnknownSync as at, Literals as b, dateTimeUtcFromInput$1 as bn, isPattern as bt, DateTimeUtcFromDate as c, resolveAt as cn, encodeUnknownEffect as ct, Defect as d, string as dn, is as dt, applyToSelfOrLastLinkEncoding as en, decodeEffect as et, Duration as f, toEncoded$1 as fn, isFinite as ft, Finite as g, passthrough as gn, isLessThanOrEqualTo as gt, FalseLiterals as h, Transformation as hn, isInt as ht, BooleanFromBit as i, mapOrSame as in, decodeUnknownOption as it, OptionFromOptional as j, empty$1 as jn, toCodecJson as jt, Option as k, setAll as kn, optionalKey as kt, DateTimeUtcFromMillis as l, resolveDescription as ln, fromJsonString as lt, Exit as m, unknown as mn, isGreaterThanOrEqualTo as mt, ArraySchema as n, isNever as nn, decodeTo as nt, Class as o, optionalKey$1 as on, encodeEffect as ot, Error$1 as p, toType$1 as pn, isGreaterThan as pt, UndefinedOr as q, TaggedClass$1 as qn, Filter as qt, Boolean as r, isOptional as rn, decodeUnknownEffect as rt, DateTimeUtc as s, replaceChecks as sn, encodeTo as st, Any as t, decodeTo$1 as tn, decodeSync as tt, DateTimeUtcFromString as u, resolveIdentifier as un, instanceOf as ut, Json as v, transformEffect as vn, isMaxProperties as vt, NonEmptyArray as w, transformEffect$1 as wn, make as wt, MutableJson as x, map as xn, isPropertyNames as xt, Literal as y, transformOptional as yn, isMinLength as yt, TaggedError as z, removeTime as zn, evolve as zt };
+export { declare as $, map$1 as $n, Union$1 as $t, OptionFromNullOr as A, toString as An, tag as At, TaggedUnion as B, isRedacted as Bn, omit as Bt, Never as C, transform$1 as Cn, isSchemaError as Ct, NullOr as D, empty as Dn, mutable as Dt, Null as E, Pointer as En, makeFilterGroup as Et, String$1 as F, formatIso as Fn, toType as Ft, Uint8Array$1 as G, monotonicTimeNanos as Gn, encodeEffect$1 as Gt, Tuple as H, value as Hn, _is as Ht, Struct as I, formatIsoDate as In, withConstructorDefault as It, Union as J, TaggedClass$1 as Jn, FilterGroup as Jt, Uint8ArrayFromBase64 as K, EncodingError as Kn, Arrays as Kt, StructWithRest as L, fromDateUnsafe as Ln, withDecodingDefault as Lt, Record as M, fromSetCookie as Mn, toCodecStringTree as Mt, Redacted as N, decode as Nn, toEncoded as Nt, Number$1 as O, fromInput as On, optional as Ot, SchemaError as P, encode as Pn, toJsonSchemaDocument as Pt, check as Q, makeEquivalence$1 as Qn, Suspend as Qt, TaggedClass as R, now as Rn, withDecodingDefaultKey as Rt, Natural as S, passthrough$1 as Sn, isSchema as St, NonEmptyString as T, InvalidValue as Tn, makeFilter as Tt, URL$1 as U, stringOrRedacted as Un, decodeEffect$1 as Ut, TrueLiterals as V, make$6 as Vn, getReferenceKey as Vt, URLFromString as W, Clock as Wn, decodeUnknownEffect$1 as Wt, Void as X, taggedEnum as Xn, Objects as Xt, Unknown as Y, TaggedError$1 as Yn, Literal$1 as Yt, brand as Z, assignProperty as Zn, PropertySignature as Zt, Int as _, transform as _n, isMaxLength as _t, BooleanLiterals as a, null_ as an, decodeUnknownSync as at, Literals as b, dateTimeUtcFromInput$1 as bn, isPattern as bt, DateTimeUtcFromDate as c, resolveAt as cn, encodeUnknownEffect as ct, Defect as d, string as dn, is as dt, applyToSelfOrLastLinkEncoding as en, decodeEffect as et, Duration as f, toEncoded$1 as fn, isFinite as ft, Finite as g, passthrough as gn, isLessThanOrEqualTo as gt, FalseLiterals as h, Transformation as hn, isInt as ht, BooleanFromBit as i, mapOrSame as in, decodeUnknownOption as it, OptionFromOptional as j, empty$1 as jn, toCodecJson as jt, Option as k, setAll as kn, optionalKey as kt, DateTimeUtcFromMillis as l, resolveDescription as ln, fromJsonString as lt, Exit as m, unknown as mn, isGreaterThanOrEqualTo as mt, ArraySchema as n, isNever as nn, decodeTo as nt, Class as o, optionalKey$1 as on, encodeEffect as ot, Error$1 as p, toType$1 as pn, isGreaterThan as pt, UndefinedOr as q, Error$2 as qn, Filter as qt, Boolean as r, isOptional as rn, decodeUnknownEffect as rt, DateTimeUtc as s, replaceChecks as sn, encodeTo as st, Any as t, decodeTo$1 as tn, decodeSync as tt, DateTimeUtcFromString as u, resolveIdentifier as un, instanceOf as ut, Json as v, transformEffect as vn, isMaxProperties as vt, NonEmptyArray as w, transformEffect$1 as wn, make as wt, MutableJson as x, map as xn, isPropertyNames as xt, Literal as y, transformOptional as yn, isMinLength as yt, TaggedError as z, removeTime as zn, evolve as zt };
 
-//# sourceMappingURL=Schema-C9JQ5hI0.mjs.map
+//# sourceMappingURL=Schema-CjUGw2Xh.mjs.map