@mx-space/cli 0.15.0 → 0.15.1

package/dist/{esm-DLzrv7gD.mjs → esm-ZXjJmLEC.mjs}

@@ -1,4 +1,4 @@
-import { n as __exportAll } from "./rolldown-runtime-JspESFgx.mjs";
+import { n as __exportAll } from "./rolldown-runtime-B4iAMlE-.mjs";
 //#region ../../node_modules/.pnpm/effect@3.22.1/node_modules/effect/dist/esm/Function.js
 /**
 * Tests if a value is a `function`.
@@ -1218,9 +1218,10 @@ function compareBoth(self, that) {
 	if (selfType !== typeof that) return false;
 	if (selfType === "object" || selfType === "function") {
 		if (self !== null && that !== null) {
-			if (isEqual(self) && isEqual(that)) if (hash(self) === hash(that) && self[symbol](that)) return true;
-			else return structuralRegionState.enabled && structuralRegionState.tester ? structuralRegionState.tester(self, that) : false;
-			else if (self instanceof Date && that instanceof Date) {
+			if (isEqual(self) && isEqual(that)) {
+				if (hash(self) === hash(that) && self[symbol](that)) return true;
+				else return structuralRegionState.enabled && structuralRegionState.tester ? structuralRegionState.tester(self, that) : false;
+			} else if (self instanceof Date && that instanceof Date) {
 				const t1 = self.getTime();
 				const t2 = that.getTime();
 				return t1 === t2 || Number.isNaN(t1) && Number.isNaN(t2);
@@ -4051,9 +4052,7 @@ const reduceWithContext$2 = /*#__PURE__*/ dual(3, (self, context, reducer) => {
 			case OP_SOURCE_UNAVAILABLE:
 				output.push(right(reducer.sourceUnavailableCase(context, error.path, error.message, error.cause)));
 				break;
-			case OP_UNSUPPORTED:
-				output.push(right(reducer.unsupportedCase(context, error.path, error.message)));
-				break;
+			case OP_UNSUPPORTED: output.push(right(reducer.unsupportedCase(context, error.path, error.message)));
 		}
 	}
 	const accumulator = [];
@@ -4078,9 +4077,7 @@ const reduceWithContext$2 = /*#__PURE__*/ dual(3, (self, context, reducer) => {
 					}
 				}
 				break;
-			case "Right":
-				accumulator.push(either.right);
-				break;
+			case "Right": accumulator.push(either.right);
 		}
 	}
 	if (accumulator.length === 0) throw new Error("BUG: ConfigError.reduceWithContext - please report an issue at https://github.com/Effect-TS/effect/issues");
@@ -4696,7 +4693,6 @@ const makeChunk = (backing) => {
 			chunk.depth = backing.chunk.depth + 1;
 			chunk.left = _empty$5;
 			chunk.right = _empty$5;
-			break;
 	}
 	return chunk;
 };
@@ -4978,40 +4974,41 @@ const appendAll$1 = /*#__PURE__*/ dual(2, (self, that) => {
 		left: self,
 		right: that
 	});
-	else if (diff < -1) if (self.left.depth >= self.right.depth) {
-		const nr = appendAll$1(self.right, that);
-		return makeChunk({
-			_tag: "IConcat",
-			left: self.left,
-			right: nr
-		});
-	} else {
-		const nrr = appendAll$1(self.right.right, that);
-		if (nrr.depth === self.depth - 3) {
-			const nr = makeChunk({
-				_tag: "IConcat",
-				left: self.right.left,
-				right: nrr
-			});
+	else if (diff < -1) {
+		if (self.left.depth >= self.right.depth) {
+			const nr = appendAll$1(self.right, that);
 			return makeChunk({
 				_tag: "IConcat",
 				left: self.left,
 				right: nr
 			});
 		} else {
-			const nl = makeChunk({
-				_tag: "IConcat",
-				left: self.left,
-				right: self.right.left
-			});
-			return makeChunk({
-				_tag: "IConcat",
-				left: nl,
-				right: nrr
-			});
+			const nrr = appendAll$1(self.right.right, that);
+			if (nrr.depth === self.depth - 3) {
+				const nr = makeChunk({
+					_tag: "IConcat",
+					left: self.right.left,
+					right: nrr
+				});
+				return makeChunk({
+					_tag: "IConcat",
+					left: self.left,
+					right: nr
+				});
+			} else {
+				const nl = makeChunk({
+					_tag: "IConcat",
+					left: self.left,
+					right: self.right.left
+				});
+				return makeChunk({
+					_tag: "IConcat",
+					left: nl,
+					right: nrr
+				});
+			}
 		}
-	}
-	else if (that.right.depth >= that.left.depth) {
+	} else if (that.right.depth >= that.left.depth) {
 		const nl = appendAll$1(self, that.left);
 		return makeChunk({
 			_tag: "IConcat",
@@ -5221,17 +5218,18 @@ const DurationProto = {
 };
 const make$32 = (input) => {
 	const duration = Object.create(DurationProto);
-	if (isNumber(input)) if (isNaN(input) || input <= 0) duration.value = zeroValue;
-	else if (!Number.isFinite(input)) duration.value = infinityValue;
-	else if (!Number.isInteger(input)) duration.value = {
-		_tag: "Nanos",
-		nanos: BigInt(Math.round(input * 1e6))
-	};
-	else duration.value = {
-		_tag: "Millis",
-		millis: input
-	};
-	else if (input <= bigint0$3) duration.value = zeroValue;
+	if (isNumber(input)) {
+		if (isNaN(input) || input <= 0) duration.value = zeroValue;
+		else if (!Number.isFinite(input)) duration.value = infinityValue;
+		else if (!Number.isInteger(input)) duration.value = {
+			_tag: "Nanos",
+			nanos: BigInt(Math.round(input * 1e6))
+		};
+		else duration.value = {
+			_tag: "Millis",
+			millis: input
+		};
+	} else if (input <= bigint0$3) duration.value = zeroValue;
 	else duration.value = {
 		_tag: "Nanos",
 		nanos: input
@@ -6053,9 +6051,11 @@ const reduce$5 = /*#__PURE__*/ dual(3, (self, zero, f) => {
 	let children;
 	while (children = toVisit.pop()) for (let i = 0, len = children.length; i < len;) {
 		const child = children[i++];
-		if (child && !isEmptyNode(child)) if (child._tag === "LeafNode") {
-			if (isSome(child.value)) zero = f(zero, child.value.value, child.key);
-		} else toVisit.push(child.children);
+		if (child && !isEmptyNode(child)) {
+			if (child._tag === "LeafNode") {
+				if (isSome(child.value)) zero = f(zero, child.value.value, child.key);
+			} else toVisit.push(child.children);
+		}
 	}
 	return zero;
 });
@@ -7608,7 +7608,6 @@ const patch$7 = /*#__PURE__*/ dual(2, (self, context) => {
 				updatedContext.set(head.key, head.update(updatedContext.get(head.key)));
 				wasServiceUpdated = true;
 				patches = tail;
-				break;
 		}
 	}
 	if (!wasServiceUpdated) return makeContext(updatedContext);
@@ -7787,7 +7786,6 @@ const patch$5 = /*#__PURE__*/ dual(3, (self, oldValue, differ) => {
 			case "Update":
 				readonlyArray[head.index] = differ.patch(head.patch, readonlyArray[head.index]);
 				patches = tail;
-				break;
 		}
 	}
 	return readonlyArray;
@@ -8017,7 +8015,6 @@ const step$1 = (requests) => {
 				case "Single":
 					current = left;
 					sequential = cons(right, sequential);
-					break;
 			}
 			break;
 		}
@@ -8026,7 +8023,6 @@ const step$1 = (requests) => {
 			if (isNil(stack)) return [parallel, sequential];
 			current = stack.head;
 			stack = stack.tail;
-			break;
 	}
 	throw new Error("BUG: BlockedRequests.step - please report an issue at https://github.com/Effect-TS/effect/issues");
 };
@@ -8351,7 +8347,6 @@ const find = /*#__PURE__*/ dual(2, (self, pf) => {
 					case OP_PARALLEL$1:
 						stack.push(item.right);
 						stack.push(item.left);
-						break;
 				}
 				break;
 			case "Some": return option;
@@ -8404,13 +8399,11 @@ const evaluateCause = (self) => {
 				default:
 					_sequential = prepend$1(_sequential, cause.right);
 					cause = cause.left;
-					break;
 			}
 			break;
 		case OP_PARALLEL$1:
 			stack.push(cause.right);
 			cause = cause.left;
-			break;
 	}
 	throw new Error(getBugErrorMessage("Cause.evaluateCauseLoop"));
 };
@@ -8453,9 +8446,7 @@ const reduce = /*#__PURE__*/ dual(3, (self, zero, pf) => {
 				causes.push(cause.right);
 				cause = cause.left;
 				break;
-			default:
-				cause = void 0;
-				break;
+			default: cause = void 0;
 		}
 		if (cause === void 0 && causes.length > 0) cause = causes.pop();
 	}
@@ -8489,7 +8480,6 @@ const reduceWithContext$1 = /*#__PURE__*/ dual(3, (self, context, reducer) => {
 				input.push(cause.right);
 				input.push(cause.left);
 				output.push(left({ _tag: OP_PARALLEL_CASE }));
-				break;
 		}
 	}
 	const accumulator = [];
@@ -8514,9 +8504,7 @@ const reduceWithContext$1 = /*#__PURE__*/ dual(3, (self, context, reducer) => {
 					}
 				}
 				break;
-			case "Right":
-				accumulator.push(either.right);
-				break;
+			case "Right": accumulator.push(either.right);
 		}
 	}
 	if (accumulator.length === 0) throw new Error("BUG: Cause.reduceWithContext - please report an issue at https://github.com/Effect-TS/effect/issues");
@@ -9868,12 +9856,10 @@ const patch$3 = /*#__PURE__*/ dual(2, (path, patch) => {
 				output = prepend$2(output, patch.name);
 				input = input.tail;
 				break;
-			case "Unnested":
-				if (pipe(head$2(output), contains$1(patch.name))) {
-					output = tailNonEmpty$1(output);
-					input = input.tail;
-				} else return left(MissingData(output, `Expected ${patch.name} to be in path in ConfigProvider#unnested`));
-				break;
+			case "Unnested": if (pipe(head$2(output), contains$1(patch.name))) {
+				output = tailNonEmpty$1(output);
+				input = input.tail;
+			} else return left(MissingData(output, `Expected ${patch.name} to be in path in ConfigProvider#unnested`));
 		}
 	}
 	return right(output);
@@ -10540,9 +10526,10 @@ const unsafeUpdateAs = (locals, fiberId, fiberRef, value) => {
 	let newStack;
 	if (isNonEmptyReadonlyArray(oldStack)) {
 		const [currentId, currentValue] = headNonEmpty$2(oldStack);
-		if (currentId[symbol](fiberId)) if (equals$3(currentValue, value)) return;
-		else newStack = [[fiberId, value], ...oldStack.slice(1)];
-		else newStack = [[fiberId, value], ...oldStack];
+		if (currentId[symbol](fiberId)) {
+			if (equals$3(currentValue, value)) return;
+			else newStack = [[fiberId, value], ...oldStack.slice(1)];
+		} else newStack = [[fiberId, value], ...oldStack];
 	} else newStack = [[fiberId, value]];
 	locals.set(fiberRef, newStack);
 };
@@ -10676,9 +10663,7 @@ const patch$2 = /*#__PURE__*/ dual(3, (self, fiberId, oldValue) => {
 				patches = tail;
 				break;
 			}
-			case OP_AND_THEN$1:
-				patches = prepend$2(head.first)(prepend$2(head.second)(tail));
-				break;
+			case OP_AND_THEN$1: patches = prepend$2(head.first)(prepend$2(head.second)(tail));
 		}
 	}
 	return fiberRefs;
@@ -11479,11 +11464,13 @@ const uninterruptibleMask$1 = (f) => withMicroFiber((fiber) => {
 const runFork$1 = (effect, options) => {
 	const fiber = new MicroFiberImpl(CurrentScheduler.context(options?.scheduler ?? new MicroSchedulerDefault()));
 	fiber.evaluate(effect);
-	if (options?.signal) if (options.signal.aborted) fiber.unsafeInterrupt();
-	else {
-		const abort = () => fiber.unsafeInterrupt();
-		options.signal.addEventListener("abort", abort, { once: true });
-		fiber.addObserver(() => options.signal.removeEventListener("abort", abort));
+	if (options?.signal) {
+		if (options.signal.aborted) fiber.unsafeInterrupt();
+		else {
+			const abort = () => fiber.unsafeInterrupt();
+			options.signal.addEventListener("abort", abort, { once: true });
+			fiber.addObserver(() => options.signal.removeEventListener("abort", abort));
+		}
 	}
 	return fiber;
 };
@@ -12991,8 +12978,10 @@ const histogram$1 = (key) => {
 			const mid = Math.floor(from + (to - from) / 2);
 			if (value <= boundaries[mid]) to = mid;
 			else from = mid;
-			if (to === from + 1) if (value <= boundaries[from]) to = from;
-			else from = to;
+			if (to === from + 1) {
+				if (value <= boundaries[from]) to = from;
+				else from = to;
+			}
 		}
 		values[from] = values[from] + 1;
 		count = count + 1;
@@ -13657,57 +13646,58 @@ const insert = /*#__PURE__*/ dual(3, (self, key, value) => {
 		const n3 = n_stack[s];
 		if (p.color === Color.Black || n3.color === Color.Black) break;
 		const pp = n_stack[s - 2];
-		if (pp.left === p) if (p.left === n3) {
-			const y = pp.right;
-			if (y && y.color === Color.Red) {
-				p.color = Color.Black;
-				pp.right = repaint(y, Color.Black);
-				pp.color = Color.Red;
-				s -= 1;
-			} else {
-				pp.color = Color.Red;
-				pp.left = p.right;
-				p.color = Color.Black;
-				p.right = pp;
-				n_stack[s - 2] = p;
-				n_stack[s - 1] = n3;
-				recount(pp);
-				recount(p);
-				if (s >= 3) {
-					const ppp = n_stack[s - 3];
-					if (ppp.left === pp) ppp.left = p;
-					else ppp.right = p;
+		if (pp.left === p) {
+			if (p.left === n3) {
+				const y = pp.right;
+				if (y && y.color === Color.Red) {
+					p.color = Color.Black;
+					pp.right = repaint(y, Color.Black);
+					pp.color = Color.Red;
+					s -= 1;
+				} else {
+					pp.color = Color.Red;
+					pp.left = p.right;
+					p.color = Color.Black;
+					p.right = pp;
+					n_stack[s - 2] = p;
+					n_stack[s - 1] = n3;
+					recount(pp);
+					recount(p);
+					if (s >= 3) {
+						const ppp = n_stack[s - 3];
+						if (ppp.left === pp) ppp.left = p;
+						else ppp.right = p;
+					}
+					break;
 				}
-				break;
-			}
-		} else {
-			const y = pp.right;
-			if (y && y.color === Color.Red) {
-				p.color = Color.Black;
-				pp.right = repaint(y, Color.Black);
-				pp.color = Color.Red;
-				s -= 1;
 			} else {
-				p.right = n3.left;
-				pp.color = Color.Red;
-				pp.left = n3.right;
-				n3.color = Color.Black;
-				n3.left = p;
-				n3.right = pp;
-				n_stack[s - 2] = n3;
-				n_stack[s - 1] = p;
-				recount(pp);
-				recount(p);
-				recount(n3);
-				if (s >= 3) {
-					const ppp = n_stack[s - 3];
-					if (ppp.left === pp) ppp.left = n3;
-					else ppp.right = n3;
+				const y = pp.right;
+				if (y && y.color === Color.Red) {
+					p.color = Color.Black;
+					pp.right = repaint(y, Color.Black);
+					pp.color = Color.Red;
+					s -= 1;
+				} else {
+					p.right = n3.left;
+					pp.color = Color.Red;
+					pp.left = n3.right;
+					n3.color = Color.Black;
+					n3.left = p;
+					n3.right = pp;
+					n_stack[s - 2] = n3;
+					n_stack[s - 1] = p;
+					recount(pp);
+					recount(p);
+					recount(n3);
+					if (s >= 3) {
+						const ppp = n_stack[s - 3];
+						if (ppp.left === pp) ppp.left = n3;
+						else ppp.right = n3;
+					}
+					break;
 				}
-				break;
 			}
-		}
-		else if (p.right === n3) {
+		} else if (p.right === n3) {
 			const y = pp.left;
 			if (y && y.color === Color.Red) {
 				p.color = Color.Black;
@@ -14066,9 +14056,7 @@ const patchLoop = (_supervisor, _patches) => {
 				supervisor = removeSupervisor(supervisor, head.supervisor);
 				patches = tailNonEmpty(patches);
 				break;
-			case OP_AND_THEN:
-				patches = prepend$1(head.first)(prepend$1(head.second)(tailNonEmpty(patches)));
-				break;
+			case OP_AND_THEN: patches = prepend$1(head.first)(prepend$1(head.second)(tailNonEmpty(patches)));
 		}
 	}
 	return supervisor;
@@ -14638,9 +14626,7 @@ var FiberRuntime = class extends Class$4 {
 				case OP_SUCCESS:
 					fiberSuccesses.unsafeUpdate(1, tags);
 					break;
-				case OP_FAILURE:
-					fiberFailures.unsafeUpdate(1, tags);
-					break;
+				case OP_FAILURE: fiberFailures.unsafeUpdate(1, tags);
 			}
 		}
 		if (exit._tag === "Failure") {
@@ -14725,12 +14711,13 @@ var FiberRuntime = class extends Class$4 {
 				if (exit === YieldedOp) {
 					const op = yieldedOpChannel.currentOp;
 					yieldedOpChannel.currentOp = null;
-					if (op._op === "Yield") if (cooperativeYielding(this.currentRuntimeFlags)) {
-						this.tell(yieldNow());
-						this.tell(resume(exitVoid$1));
-						effect = null;
-					} else effect = exitVoid$1;
-					else if (op._op === "Async") effect = null;
+					if (op._op === "Yield") {
+						if (cooperativeYielding(this.currentRuntimeFlags)) {
+							this.tell(yieldNow());
+							this.tell(resume(exitVoid$1));
+							effect = null;
+						} else effect = exitVoid$1;
+					} else if (op._op === "Async") effect = null;
 				} else {
 					this.currentRuntimeFlags = pipe(this.currentRuntimeFlags, enable$1(16));
 					const interruption = this.interruptAllChildren();
@@ -16493,10 +16480,12 @@ const unsafeRunPromiseExit = /*#__PURE__*/ makeDual((runtime, effect, options) =
 	fiber.addObserver((exit) => {
 		resolve(exit);
 	});
-	if (options?.signal !== void 0) if (options.signal.aborted) fiber.unsafeInterruptAsFork(fiber.id());
-	else options.signal.addEventListener("abort", () => {
-		fiber.unsafeInterruptAsFork(fiber.id());
-	}, { once: true });
+	if (options?.signal !== void 0) {
+		if (options.signal.aborted) fiber.unsafeInterruptAsFork(fiber.id());
+		else options.signal.addEventListener("abort", () => {
+			fiber.unsafeInterruptAsFork(fiber.id());
+		}, { once: true });
+	}
 }));
 /** @internal */
 var RuntimeImpl = class {
@@ -17104,8 +17093,8 @@ const unsafeMake$1 = (input) => {
 	return unsafeFromDate$1(new Date(input));
 };
 const hasZone = (input) => /Z|[+-]\d{2}$|[+-]\d{2}:?\d{2}$|\]$/.test(input);
-const minEpochMillis = -86399999568e5;
-const maxEpochMillis = 864e13 - 840 * 60 * 1e3;
+const minEpochMillis = -864e13 + 432e5;
+const maxEpochMillis = 864e13 - 504e5;
 /** @internal */
 const unsafeMakeZoned$1 = (input, options) => {
 	if (options?.timeZone === void 0 && isDateTime$1(input) && isZoned$1(input)) return input;
@@ -17213,8 +17202,8 @@ const zonedOffset = (self) => {
 };
 const offsetToString = (offset) => {
 	const abs = Math.abs(offset);
-	let hours = Math.floor(abs / (3600 * 1e3));
-	let minutes = Math.round(abs % (3600 * 1e3) / (60 * 1e3));
+	let hours = Math.floor(abs / 36e5);
+	let minutes = Math.round(abs % 36e5 / 6e4);
 	if (minutes === 60) {
 		hours += 1;
 		minutes = 0;
@@ -17238,7 +17227,7 @@ const setPartsDate = (date, parts) => {
 	if (parts.seconds !== void 0) date.setUTCSeconds(parts.seconds);
 	if (parts.millis !== void 0) date.setUTCMilliseconds(parts.millis);
 };
-const constDayMillis = 1440 * 60 * 1e3;
+const constDayMillis = 864e5;
 const makeZonedFromAdjusted = (adjustedMillis, zone, disambiguation) => {
 	if (zone._tag === "Offset") return makeZonedProto(adjustedMillis - zone.offset, zone);
 	const beforeOffset = calculateNamedOffset(adjustedMillis - constDayMillis, adjustedMillis, zone);
@@ -23375,12 +23364,10 @@ const unify = (candidates) => {
 						out.push(ast);
 					}
 					break;
-				case "object":
-					if (!literals.includes(ast.literal)) {
-						literals.push(ast.literal);
-						out.push(ast);
-					}
-					break;
+				case "object": if (!literals.includes(ast.literal)) {
+					literals.push(ast.literal);
+					out.push(ast);
+				}
 			}
 			break;
 		}
@@ -24818,14 +24805,15 @@ const go$1 = (ast, isDecoding) => {
 					const [head, ...tail] = rest;
 					for (; i < len - tail.length; i++) {
 						const te = head(input[i], options);
-						if (isEither(te)) if (isLeft(te)) {
-							const e = new Pointer(i, input, te.left);
-							if (allErrors) {
-								es.push([stepKey++, e]);
-								continue;
-							} else return left(new Composite(ast, input, e, sortByIndex(output)));
-						} else output.push([stepKey++, te.right]);
-						else {
+						if (isEither(te)) {
+							if (isLeft(te)) {
+								const e = new Pointer(i, input, te.left);
+								if (allErrors) {
+									es.push([stepKey++, e]);
+									continue;
+								} else return left(new Composite(ast, input, e, sortByIndex(output)));
+							} else output.push([stepKey++, te.right]);
+						} else {
 							const nk = stepKey++;
 							const index = i;
 							if (!queue) queue = [];
@@ -24928,13 +24916,15 @@ const go$1 = (ast, isDecoding) => {
 					inputKeys = Reflect.ownKeys(input);
 					for (const key of inputKeys) {
 						const te = expected(key, options);
-						if (isEither(te) && isLeft(te)) if (onExcessPropertyError) {
-							const e = new Pointer(key, input, new Unexpected(input[key], `is unexpected, expected: ${String(expectedAST)}`));
-							if (allErrors) {
-								es.push([stepKey++, e]);
-								continue;
-							} else return left(new Composite(ast, input, e, output));
-						} else output[key] = input[key];
+						if (isEither(te) && isLeft(te)) {
+							if (onExcessPropertyError) {
+								const e = new Pointer(key, input, new Unexpected(input[key], `is unexpected, expected: ${String(expectedAST)}`));
+								if (allErrors) {
+									es.push([stepKey++, e]);
+									continue;
+								} else return left(new Composite(ast, input, e, output));
+							} else output[key] = input[key];
+						}
 					}
 				}
 				let queue = void 0;
@@ -25062,37 +25052,40 @@ const go$1 = (ast, isDecoding) => {
 				const es = [];
 				let stepKey = 0;
 				let candidates = [];
-				if (ownKeysLen > 0) if (isRecordOrArray(input)) for (let i = 0; i < ownKeysLen; i++) {
-					const name = ownKeys[i];
-					const buckets = searchTree.keys[name].buckets;
-					if (Object.prototype.hasOwnProperty.call(input, name)) {
-						const literal = String(input[name]);
-						if (Object.prototype.hasOwnProperty.call(buckets, literal)) candidates = candidates.concat(buckets[literal]);
-						else {
+				if (ownKeysLen > 0) {
+					if (isRecordOrArray(input)) for (let i = 0; i < ownKeysLen; i++) {
+						const name = ownKeys[i];
+						const buckets = searchTree.keys[name].buckets;
+						if (Object.prototype.hasOwnProperty.call(input, name)) {
+							const literal = String(input[name]);
+							if (Object.prototype.hasOwnProperty.call(buckets, literal)) candidates = candidates.concat(buckets[literal]);
+							else {
+								const { candidates, literals } = searchTree.keys[name];
+								const literalsUnion = Union$1.make(literals);
+								const errorAst = candidates.length === astTypesLen ? new TypeLiteral([new PropertySignature(name, literalsUnion, false, true)], []) : Union$1.make(candidates);
+								es.push([stepKey++, new Composite(errorAst, input, new Pointer(name, input, new Type(literalsUnion, input[name])))]);
+							}
+						} else {
 							const { candidates, literals } = searchTree.keys[name];
-							const literalsUnion = Union$1.make(literals);
-							const errorAst = candidates.length === astTypesLen ? new TypeLiteral([new PropertySignature(name, literalsUnion, false, true)], []) : Union$1.make(candidates);
-							es.push([stepKey++, new Composite(errorAst, input, new Pointer(name, input, new Type(literalsUnion, input[name])))]);
+							const fakePropertySignature = new PropertySignature(name, Union$1.make(literals), false, true);
+							const errorAst = candidates.length === astTypesLen ? new TypeLiteral([fakePropertySignature], []) : Union$1.make(candidates);
+							es.push([stepKey++, new Composite(errorAst, input, new Pointer(name, input, new Missing(fakePropertySignature)))]);
 						}
-					} else {
-						const { candidates, literals } = searchTree.keys[name];
-						const fakePropertySignature = new PropertySignature(name, Union$1.make(literals), false, true);
-						const errorAst = candidates.length === astTypesLen ? new TypeLiteral([fakePropertySignature], []) : Union$1.make(candidates);
-						es.push([stepKey++, new Composite(errorAst, input, new Pointer(name, input, new Missing(fakePropertySignature)))]);
 					}
-				}
-				else {
-					const errorAst = searchTree.candidates.length === astTypesLen ? ast : Union$1.make(searchTree.candidates);
-					es.push([stepKey++, new Type(errorAst, input)]);
+					else {
+						const errorAst = searchTree.candidates.length === astTypesLen ? ast : Union$1.make(searchTree.candidates);
+						es.push([stepKey++, new Type(errorAst, input)]);
+					}
 				}
 				if (searchTree.otherwise.length > 0) candidates = candidates.concat(searchTree.otherwise);
 				let queue = void 0;
 				for (let i = 0; i < candidates.length; i++) {
 					const candidate = candidates[i];
 					const pr = map.get(candidate)(input, options);
-					if (isEither(pr) && (!queue || queue.length === 0)) if (isRight(pr)) return pr;
-					else es.push([stepKey++, pr.left]);
-					else {
+					if (isEither(pr) && (!queue || queue.length === 0)) {
+						if (isRight(pr)) return pr;
+						else es.push([stepKey++, pr.left]);
+					} else {
 						const nk = stepKey++;
 						if (!queue) queue = [];
 						queue.push((state) => suspend$1(() => {
@@ -25525,16 +25518,18 @@ const zero = /*#__PURE__*/ unsafeMakeNormalized(bigint0, 0);
 * @category scaling
 */
 const normalize = (self) => {
-	if (self.normalized === void 0) if (self.value === bigint0) self.normalized = zero;
-	else {
-		const digits = `${self.value}`;
-		let trail = 0;
-		for (let i = digits.length - 1; i >= 0; i--) if (digits[i] === "0") trail++;
-		else break;
-		if (trail === 0) self.normalized = self;
-		const value = BigInt(digits.substring(0, digits.length - trail));
-		const scale = self.scale - trail;
-		self.normalized = unsafeMakeNormalized(value, scale);
+	if (self.normalized === void 0) {
+		if (self.value === bigint0) self.normalized = zero;
+		else {
+			const digits = `${self.value}`;
+			let trail = 0;
+			for (let i = digits.length - 1; i >= 0; i--) if (digits[i] === "0") trail++;
+			else break;
+			if (trail === 0) self.normalized = self;
+			const value = BigInt(digits.substring(0, digits.length - trail));
+			const scale = self.scale - trail;
+			self.normalized = unsafeMakeNormalized(value, scale);
+		}
 	}
 	return self.normalized;
 };
@@ -28818,9 +28813,10 @@ const TemplateLiteral = (...[head, ...tail]) => {
 	const spans = [];
 	let h = "";
 	let ts = tail;
-	if (isSchema(head)) if (isLiteral(head.ast)) h = String(head.ast.literal);
-	else ts = [head, ...ts];
-	else h = String(head);
+	if (isSchema(head)) {
+		if (isLiteral(head.ast)) h = String(head.ast.literal);
+		else ts = [head, ...ts];
+	} else h = String(head);
 	for (let i = 0; i < ts.length; i++) {
 		const item = ts[i];
 		if (isSchema(item)) {
@@ -29388,50 +29384,53 @@ const optionalPropertySignatureAST = (self, options) => {
 	const isNullable = options?.nullable;
 	const asOption = options?.as == "Option";
 	const asOptionEncode = options?.onNoneEncoding ? orElse$3(options.onNoneEncoding) : identity;
-	if (isExact) if (defaultValue) if (isNullable) return withConstructorDefault(optionalToRequired(NullOr(self), typeSchema(self), {
-		decode: match$7({
-			onNone: defaultValue,
-			onSome: (a) => a === null ? defaultValue() : a
-		}),
-		encode: some$1
-	}), defaultValue).ast;
-	else return withConstructorDefault(optionalToRequired(self, typeSchema(self), {
-		decode: match$7({
-			onNone: defaultValue,
-			onSome: identity
-		}),
-		encode: some$1
-	}), defaultValue).ast;
-	else if (asOption) {
-		const to = OptionFromSelf_(typeSchema(self));
-		if (isNullable) return optionalToRequired(NullOr(self), to, {
+	if (isExact) {
+		if (defaultValue) {
+			if (isNullable) return withConstructorDefault(optionalToRequired(NullOr(self), typeSchema(self), {
+				decode: match$7({
+					onNone: defaultValue,
+					onSome: (a) => a === null ? defaultValue() : a
+				}),
+				encode: some$1
+			}), defaultValue).ast;
+			else return withConstructorDefault(optionalToRequired(self, typeSchema(self), {
+				decode: match$7({
+					onNone: defaultValue,
+					onSome: identity
+				}),
+				encode: some$1
+			}), defaultValue).ast;
+		} else if (asOption) {
+			const to = OptionFromSelf_(typeSchema(self));
+			if (isNullable) return optionalToRequired(NullOr(self), to, {
+				decode: filter$5(isNotNull),
+				encode: asOptionEncode
+			}).ast;
+			else return optionalToRequired(self, to, {
+				decode: identity,
+				encode: identity
+			}).ast;
+		} else if (isNullable) return optionalToOptional(NullOr(self), typeSchema(self), {
 			decode: filter$5(isNotNull),
-			encode: asOptionEncode
-		}).ast;
-		else return optionalToRequired(self, to, {
-			decode: identity,
 			encode: identity
 		}).ast;
-	} else if (isNullable) return optionalToOptional(NullOr(self), typeSchema(self), {
-		decode: filter$5(isNotNull),
-		encode: identity
-	}).ast;
-	else return new PropertySignatureDeclaration(self.ast, true, true, {}, void 0);
-	else if (defaultValue) if (isNullable) return withConstructorDefault(optionalToRequired(NullishOr(self), typeSchema(self), {
-		decode: match$7({
-			onNone: defaultValue,
-			onSome: (a) => a == null ? defaultValue() : a
-		}),
-		encode: some$1
-	}), defaultValue).ast;
-	else return withConstructorDefault(optionalToRequired(UndefinedOr(self), typeSchema(self), {
-		decode: match$7({
-			onNone: defaultValue,
-			onSome: (a) => a === void 0 ? defaultValue() : a
-		}),
-		encode: some$1
-	}), defaultValue).ast;
-	else if (asOption) {
+		else return new PropertySignatureDeclaration(self.ast, true, true, {}, void 0);
+	} else if (defaultValue) {
+		if (isNullable) return withConstructorDefault(optionalToRequired(NullishOr(self), typeSchema(self), {
+			decode: match$7({
+				onNone: defaultValue,
+				onSome: (a) => a == null ? defaultValue() : a
+			}),
+			encode: some$1
+		}), defaultValue).ast;
+		else return withConstructorDefault(optionalToRequired(UndefinedOr(self), typeSchema(self), {
+			decode: match$7({
+				onNone: defaultValue,
+				onSome: (a) => a === void 0 ? defaultValue() : a
+			}),
+			encode: some$1
+		}), defaultValue).ast;
+	} else if (asOption) {
 		const to = OptionFromSelf_(typeSchema(self));
 		if (isNullable) return optionalToRequired(NullishOr(self), to, {
 			decode: filter$5((a) => a != null),
@@ -29803,11 +29802,9 @@ const intersectUnionMembers = (xs, ys, path) => flatMap$5(xs, (x) => flatMap$5(y
 				}
 			}
 			break;
-		case "Transformation":
-			if (isTransformation$1(x)) {
-				if (isTypeLiteralTransformation(y.transformation) && isTypeLiteralTransformation(x.transformation)) return [new Transformation$1(intersectTypeLiterals(x.from, y.from, path), intersectTypeLiterals(x.to, y.to, path), new TypeLiteralTransformation(y.transformation.propertySignatureTransformations.concat(x.transformation.propertySignatureTransformations)))];
-			} else return intersectUnionMembers([y], [x], path);
-			break;
+		case "Transformation": if (isTransformation$1(x)) {
+			if (isTypeLiteralTransformation(y.transformation) && isTypeLiteralTransformation(x.transformation)) return [new Transformation$1(intersectTypeLiterals(x.from, y.from, path), intersectTypeLiterals(x.to, y.to, path), new TypeLiteralTransformation(y.transformation.propertySignatureTransformations.concat(x.transformation.propertySignatureTransformations)))];
+		} else return intersectUnionMembers([y], [x], path);
 	}
 	throw new Error(getSchemaExtendErrorMessage(x, y, path));
 }));
@@ -31670,8 +31667,8 @@ var DateTimeUtc = class extends transformOrFail(String$.annotations({ descriptio
 	encode: (a) => succeed(formatIso(a))
 }).annotations({ identifier: "DateTimeUtc" }) {};
 const timeZoneOffsetArbitrary = () => (fc) => fc.integer({
-	min: -720 * 60 * 1e3,
-	max: 840 * 60 * 1e3
+	min: -432e5,
+	max: 504e5
 }).map(zoneMakeOffset);
 /**
 * Describes a schema that represents a `TimeZone.Offset` instance.
@@ -31907,7 +31904,7 @@ const eitherPretty = (right, left) => match$8({
 	onRight: (a) => `right(${right(a)})`
 });
 const eitherParse = (parseRight, decodeUnknownLeft) => (u, options, ast) => isEither$1(u) ? match$8(u, {
-	onLeft: (left$2) => toComposite(decodeUnknownLeft(left$2, options), left, ast, u),
+	onLeft: (left$3) => toComposite(decodeUnknownLeft(left$3, options), left, ast, u),
 	onRight: (right$3) => toComposite(parseRight(right$3, options), right, ast, u)
 }) : fail(new Type(ast, u));
 /**
@@ -31968,9 +31965,9 @@ const Either = ({ left, right }) => {
 * @category Either transformations
 * @since 3.10.0
 */
-const EitherFromUnion = ({ left: left$3, right: right$2 }) => {
+const EitherFromUnion = ({ left: left$2, right: right$2 }) => {
 	const right_ = asSchema(right$2);
-	const left_ = asSchema(left$3);
+	const left_ = asSchema(left$2);
 	const toright = typeSchema(right_);
 	const toleft = typeSchema(left_);
 	const fromRight = transform(right_, rightEncoded(toright), {