@foldkit/oxlint-plugin 0.15.1 → 0.15.2-canary.03baf1666c99

package/dist/index.js

@@ -1,4 +1,4 @@
-//#region ../../node_modules/.pnpm/effect-oxlint@0.3.4_effect@4.0.0-rc.117/node_modules/effect-oxlint/dist/rolldown-runtime.js
+//#region ../../node_modules/.pnpm/effect-oxlint@0.3.4_effect@4.0.0/node_modules/effect-oxlint/dist/rolldown-runtime.js
 var __defProp = Object.defineProperty;
 var __exportAll = (all, no_symbols) => {
 	let target = {};
@@ -10,7 +10,7 @@ var __exportAll = (all, no_symbols) => {
 	return target;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Pipeable.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Pipeable.js
 /**
 * The `Pipeable` module defines the shared interface and implementation helpers
 * for values that support Effect-style method chaining with `.pipe(...)`.
@@ -112,7 +112,7 @@ const Class$1 = /*#__PURE__*/ function() {
 	return PipeableBase;
 }();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Function.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Function.js
 /**
 * Creates a function that can be called in data-first style or data-last
 * (`pipe`-friendly) style.
@@ -374,12 +374,12 @@ function memoizeIdempotent(f) {
 		if (cached !== void 0) return cached;
 		const result = f(a);
 		cache.set(a, result);
-		cache.set(result, result);
+		if (result !== a) cache.set(result, result);
 		return result;
 	};
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/equal.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/equal.js
 /** @internal */
 const getAllObjectKeys = (obj) => {
 	const keys = new Set(Reflect.ownKeys(obj));
@@ -397,8 +397,22 @@ const getAllObjectKeys = (obj) => {
 };
 /** @internal */
 const byReferenceInstances = /*#__PURE__*/ new WeakSet();
+/** @internal */
+const viewBytes = (view) => new Uint8Array(view.buffer, view.byteOffset, view.byteLength);
+//#endregion
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/hash.js
+/**
+* Back-edge count used to avoid caching entry-point-dependent hashes.
+*
+* @internal
+*/
+let backEdges = 0;
+/** @internal */
+const addBackEdge = () => {
+	backEdges++;
+};
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Predicate.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Predicate.js
 /**
 * Defines runtime checks for values.
 *
@@ -712,7 +726,7 @@ function isIterable(input) {
 	return hasProperty(input, Symbol.iterator) || isString(input);
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Hash.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Hash.js
 /**
 * Computes Effect hash values and defines the interface for objects that want
 * to provide their own hash implementation. Hashes are small numeric
@@ -780,30 +794,39 @@ const hash = (self) => {
 		case "number": return number$1(self);
 		case "bigint": return string$1(self.toString(10));
 		case "string": return string$1(self);
-		case "undefined": return string$1("undefined");
 		case "function":
-		case "object": if (self === null) return string$1("null");
+		case "object": if (self === null) break;
 		else if (self instanceof Date) {
 			if (Number.isNaN(self.getTime())) return string$1("Invalid Date");
 			return string$1(self.toISOString());
 		} else if (self instanceof RegExp) return string$1(self.toString());
 		else {
 			if (byReferenceInstances.has(self)) return random(self);
-			if (hashCache.has(self)) return hashCache.get(self);
-			const h = withVisitedTracking$1(self, () => {
-				if (isHash(self)) return self[symbol$1]();
-				else if (typeof self === "function") return random(self);
-				else if (self instanceof DataView) return array(new Uint8Array(self.buffer, self.byteOffset, self.byteLength));
-				else if (Array.isArray(self) || ArrayBuffer.isView(self)) return array(self);
-				else if (self instanceof Map) return hashMap(self);
-				else if (self instanceof Set) return hashSet(self);
-				return structure(self);
-			});
-			hashCache.set(self, h);
+			const cached = hashCache.get(self);
+			if (cached !== void 0) return cached;
+			if (visitedObjects.has(self)) {
+				addBackEdge();
+				return string$1("[Circular]");
+			}
+			visitedObjects.add(self);
+			const seen = backEdges;
+			let h;
+			try {
+				if ("~effect/Hash" in self) h = self[symbol$1]();
+				else if (typeof self === "function") h = random(self);
+				else if (self instanceof DataView) h = array(viewBytes(self));
+				else if (Array.isArray(self) || ArrayBuffer.isView(self)) h = array(self);
+				else if (self instanceof Map) h = hashMap(self);
+				else if (self instanceof Set) h = hashSet(self);
+				else h = structure(self);
+			} finally {
+				visitedObjects.delete(self);
+			}
+			if (seen === backEdges) hashCache.set(self, h);
 			return h;
 		}
-		default: return string$1(String(self));
 	}
+	return optimize(mix(string$1(String(self))));
 };
 /**
 * Generates a random hash value for an object and caches it.
@@ -835,9 +858,16 @@ const hash = (self) => {
 * @since 2.0.0
 */
 const random = (self) => {
-	if (!randomHashCache.has(self)) randomHashCache.set(self, number$1(Math.floor(Math.random() * Number.MAX_SAFE_INTEGER)));
+	if (!randomHashCache.has(self)) randomHashCache.set(self, optimize(Math.random() * 4294967296 | 0));
 	return randomHashCache.get(self);
 };
+const mix = (h) => {
+	h ^= h >>> 16;
+	h = Math.imul(h, 2246822507);
+	h ^= h >>> 13;
+	h = Math.imul(h, 3266489909);
+	return h ^ h >>> 16;
+};
 /**
 * Combines two hash values into a single hash value.
 *
@@ -848,8 +878,7 @@ const random = (self) => {
 *
 * **Details**
 *
-* Supports both direct and pipeable usage. The implementation combines two
-* hash values with `(self * 53) ^ b`.
+* Supports direct and pipeable usage. Argument order affects the result.
 *
 * **Example** (Combining hash values)
 *
@@ -869,7 +898,7 @@ const random = (self) => {
 * @category hashing
 * @since 2.0.0
 */
-const combine = /*#__PURE__*/ dual(2, (self, b) => self * 53 ^ b);
+const combine = /*#__PURE__*/ dual(2, (self, b) => mix(Math.imul(self, 2654435761) + Math.imul(b, 2246822507)));
 /**
 * Applies bit manipulation techniques to optimize a hash value.
 *
@@ -894,38 +923,7 @@ const combine = /*#__PURE__*/ dual(2, (self, b) => self * 53 ^ b);
 * @since 2.0.0
 */
 const optimize = (n) => n & 3221225471 | n >>> 1 & 1073741824;
-/**
-* Checks whether a value implements the Hash interface.
-*
-* **When to use**
-*
-* Use to detect whether an unknown value provides a custom hash implementation.
-*
-* **Details**
-*
-* This function determines whether a given value has the Hash symbol property,
-* indicating that it can provide its own hash value implementation.
-*
-* **Example** (Checking for Hash support)
-*
-* ```ts import.meta.vitest
-* import { Hash } from "effect"
-*
-* class MyHashable implements Hash.Hash {
-*   [Hash.symbol]() {
-*     return 42
-*   }
-* }
-*
-* Hash.isHash(new MyHashable()) // => true
-* Hash.isHash({}) // => false
-* Hash.isHash("string") // => false
-* ```
-*
-* @category guards
-* @since 2.0.0
-*/
-const isHash = (u) => hasProperty(u, symbol$1);
+const float64 = /*#__PURE__*/ new DataView(/*#__PURE__*/ new ArrayBuffer(8));
 /**
 * Computes a hash value for a number.
 *
@@ -935,9 +933,8 @@ const isHash = (u) => hasProperty(u, symbol$1);
 *
 * **Details**
 *
-* This function creates a hash value for numeric inputs, handling special cases
-* like NaN, Infinity, and -Infinity with distinct hash values. It uses bitwise operations to ensure good distribution
-* of hash values across different numeric inputs.
+* Int32 values hash to themselves. Other numbers hash from their IEEE-754 bits,
+* with a canonical representation for `NaN`.
 *
 * **Example** (Hashing numbers)
 *
@@ -955,11 +952,10 @@ const isHash = (u) => hasProperty(u, symbol$1);
 * @since 2.0.0
 */
 const number$1 = (n) => {
-	if (n !== n || n === Infinity || n === -Infinity) return string$1(String(n));
-	let h = n | 0;
-	if (h !== n) h ^= n * 4294967295;
-	while (n > 4294967295) h ^= n /= 4294967295;
-	return optimize(h);
+	const h = n | 0;
+	if (h === n) return optimize(h);
+	float64.setFloat64(0, n !== n ? NaN : n);
+	return optimize(combine(float64.getInt32(0), float64.getInt32(4)));
 };
 /**
 * Computes a hash value for a string using the djb2 algorithm.
@@ -1017,8 +1013,8 @@ const string$1 = (str) => {
 * const hash1 = Hash.structureKeys(person, ["name", "age"])
 * const hash2 = Hash.structureKeys(person, ["name", "city"])
 *
-* hash1 // => -590673747
-* hash2 // => 284850673
+* hash1 // => -731887653
+* hash2 // => 148523102
 *
 * const person2 = { name: "John", age: 30, city: "Boston" }
 * const hash3 = Hash.structureKeys(person2, ["name", "age"])
@@ -1054,9 +1050,9 @@ const structureKeys = (o, keys) => {
 * const obj2 = { name: "Jane", age: 25 }
 * const obj3 = { name: "John", age: 30 }
 *
-* Hash.structure(obj1) // => -590673747
-* Hash.structure(obj2) // => -590160631
-* Hash.structure(obj3) // => -590673747
+* Hash.structure(obj1) // => -731887653
+* Hash.structure(obj2) // => -222100417
+* Hash.structure(obj3) // => -731887653
 * Hash.structure(obj1) === Hash.structure(obj3) // => true
 * ```
 *
@@ -1064,7 +1060,7 @@ const structureKeys = (o, keys) => {
 * @since 2.0.0
 */
 const structure = (o) => structureKeys(o, getAllObjectKeys(o));
-const iterableWith = (seed, f) => (iter) => {
+const unordered = (seed, f) => (iter) => {
 	let h = seed;
 	for (const element of iter) h ^= f(element);
 	return optimize(h);
@@ -1078,13 +1074,12 @@ const iterableWith = (seed, f) => (iter) => {
 *
 * **Details**
 *
-* The implementation folds element hashes from the seed `6151` with XOR and
-* then optimizes the final hash.
+* Folds element hashes with {@link combine}, so order and length affect the
+* result.
 *
 * **Gotchas**
 *
-* A hash is not an equality proof. Because this implementation uses XOR,
-* reordered inputs can produce the same hash.
+* A hash is not an equality proof. Distinct inputs can still share a hash.
 *
 * **Example** (Hashing arrays)
 *
@@ -1095,11 +1090,8 @@ const iterableWith = (seed, f) => (iter) => {
 * const arr2 = [1, 2, 3]
 * const arr3 = [3, 2, 1]
 *
-* Hash.array(arr1) // => 6151
-* Hash.array(arr2) // => 6151
-* Hash.array(arr3) // => 6151
 * Hash.array(arr1) === Hash.array(arr2) // => true
-* Hash.array(arr1) === Hash.array(arr3) // => true
+* Hash.array(arr1) === Hash.array(arr3) // => false
 * ```
 *
 * @see {@link hash} for the general-purpose hash dispatcher
@@ -1107,21 +1099,19 @@ const iterableWith = (seed, f) => (iter) => {
 * @category hashing
 * @since 2.0.0
 */
-const array = /*#__PURE__*/ iterableWith(6151, hash);
-const hashMap = /*#__PURE__*/ iterableWith(/*#__PURE__*/ string$1("Map"), ([k, v]) => combine(hash(k), hash(v)));
-const hashSet = /*#__PURE__*/ iterableWith(/*#__PURE__*/ string$1("Set"), hash);
+const array = (arr) => {
+	let h = 6151;
+	for (const element of arr) h = combine(h, hash(element));
+	return optimize(h);
+};
+const hashMap = /*#__PURE__*/ unordered(/*#__PURE__*/ string$1("Map"), ([k, v]) => combine(hash(k), hash(v)));
+const setSeed = /*#__PURE__*/ string$1("Set");
+const hashSet = /*#__PURE__*/ unordered(setSeed, (element) => combine(setSeed, hash(element)));
 const randomHashCache = /*#__PURE__*/ new WeakMap();
 const hashCache = /*#__PURE__*/ new WeakMap();
 const visitedObjects = /*#__PURE__*/ new WeakSet();
-function withVisitedTracking$1(obj, fn) {
-	if (visitedObjects.has(obj)) return string$1("[Circular]");
-	visitedObjects.add(obj);
-	const result = fn();
-	visitedObjects.delete(obj);
-	return result;
-}
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Equal.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Equal.js
 /**
 * Defines the unique string identifier for the `Equal` interface.
 *
@@ -1161,7 +1151,7 @@ function withVisitedTracking$1(obj, fn) {
 * @since 2.0.0
 */
 const symbol = "~effect/Equal";
-function equals$2() {
+function equals$1() {
 	if (arguments.length === 1) return (self) => compareBoth(self, arguments[0]);
 	return compareBoth(arguments[0], arguments[1]);
 }
@@ -1173,80 +1163,59 @@ function compareBoth(self, that) {
 	if (selfType === "number" && self !== self && that !== that) return true;
 	if (selfType !== "object" && selfType !== "function") return false;
 	if (byReferenceInstances.has(self) || byReferenceInstances.has(that)) return false;
-	return withCache(self, that, compareObjects);
+	return compareObjects(self, that);
 }
-/** Helper to run comparison with proper visited tracking */
-function withVisitedTracking(self, that, fn) {
-	const hasLeft = visitedLeft.has(self);
-	const hasRight = visitedRight.has(that);
-	if (hasLeft && hasRight) return true;
-	if (hasLeft || hasRight) return false;
-	visitedLeft.add(self);
-	visitedRight.add(that);
-	const result = fn();
-	visitedLeft.delete(self);
-	visitedRight.delete(that);
+function compareObjects(self, that) {
+	const depth = pathLeft.length;
+	for (let i = depth; i-- > 0;) if (pathLeft[i] === self && pathRight[i] === that) return true;
+	if (depth) return compareOnPath(self, that);
+	let known = results.get(self);
+	if (!known) results.set(self, known = /* @__PURE__ */ new WeakMap());
+	let result = known.get(that);
+	if (result === void 0) known.set(that, result = compareOnPath(self, that));
 	return result;
 }
-const visitedLeft = /*#__PURE__*/ new WeakSet();
-const visitedRight = /*#__PURE__*/ new WeakSet();
-/** Helper to perform cached object comparison */
-function compareObjects(self, that) {
+function compareOnPath(self, that) {
+	pathLeft.push(self);
+	pathRight.push(that);
+	try {
+		return compareStructure(self, that);
+	} finally {
+		pathLeft.pop();
+		pathRight.pop();
+	}
+}
+const pathLeft = [];
+const pathRight = [];
+const results = /*#__PURE__*/ new WeakMap();
+function compareStructure(self, that) {
 	if (hash(self) !== hash(that)) return false;
 	else if (self instanceof Date) {
 		if (!(that instanceof Date)) return false;
 		const selfTime = self.getTime();
 		const thatTime = that.getTime();
 		return selfTime === thatTime || Number.isNaN(selfTime) && Number.isNaN(thatTime);
-	} else if (self instanceof RegExp) {
-		if (!(that instanceof RegExp)) return false;
-		return self.toString() === that.toString();
-	}
-	const selfIsEqual = isEqual(self);
-	const thatIsEqual = isEqual(that);
-	if (selfIsEqual !== thatIsEqual) return false;
-	const bothEquals = selfIsEqual && thatIsEqual;
-	if (typeof self === "function" && !bothEquals) return false;
-	return withVisitedTracking(self, that, () => {
-		if (bothEquals) return self[symbol](that);
-		else if (Array.isArray(self)) {
-			if (!Array.isArray(that) || self.length !== that.length) return false;
-			return compareArrays(self, that);
-		} else if (ArrayBuffer.isView(self)) {
-			const selfIsDataView = self instanceof DataView;
-			if (!ArrayBuffer.isView(that) || self.byteLength !== that.byteLength || selfIsDataView !== that instanceof DataView) return false;
-			if (selfIsDataView) {
-				const thatDataView = that;
-				return compareTypedArrays(new Uint8Array(self.buffer, self.byteOffset, self.byteLength), new Uint8Array(thatDataView.buffer, thatDataView.byteOffset, thatDataView.byteLength));
-			}
-			return compareTypedArrays(self, that);
-		} else if (self instanceof Map) {
-			if (!(that instanceof Map) || self.size !== that.size) return false;
-			return compareMaps(self, that);
-		} else if (self instanceof Set) {
-			if (!(that instanceof Set) || self.size !== that.size) return false;
-			return compareSets(self, that);
-		}
-		return compareRecords(self, that);
-	});
-}
-function withCache(self, that, f) {
-	let selfMap = equalityCache.get(self);
-	if (!selfMap) {
-		selfMap = /* @__PURE__ */ new WeakMap();
-		equalityCache.set(self, selfMap);
-	} else if (selfMap.has(that)) return selfMap.get(that);
-	const result = f(self, that);
-	selfMap.set(that, result);
-	let thatMap = equalityCache.get(that);
-	if (!thatMap) {
-		thatMap = /* @__PURE__ */ new WeakMap();
-		equalityCache.set(that, thatMap);
-	}
-	thatMap.set(self, result);
-	return result;
+	} else if (self instanceof RegExp) return that instanceof RegExp && self.toString() === that.toString();
+	const bothEquals = isEqual(self);
+	if (bothEquals !== isEqual(that) || typeof self === "function" && !bothEquals) return false;
+	else if (bothEquals) return self[symbol](that);
+	else if (Array.isArray(self)) {
+		if (!Array.isArray(that) || self.length !== that.length) return false;
+		return compareArrays(self, that);
+	} else if (ArrayBuffer.isView(self)) {
+		const selfIsDataView = self instanceof DataView;
+		if (!ArrayBuffer.isView(that) || self.byteLength !== that.byteLength || selfIsDataView !== that instanceof DataView) return false;
+		if (selfIsDataView) return compareTypedArrays(viewBytes(self), viewBytes(that));
+		return compareTypedArrays(self, that);
+	} else if (self instanceof Map) {
+		if (!(that instanceof Map) || self.size !== that.size) return false;
+		return compareHashed(self, that, entryHash, equalEntries);
+	} else if (self instanceof Set) {
+		if (!(that instanceof Set) || self.size !== that.size) return false;
+		return compareHashed(self, that, hash, compareBoth);
+	}
+	return compareRecords(self, that);
 }
-const equalityCache = /*#__PURE__*/ new WeakMap();
 function compareArrays(self, that) {
 	for (let i = 0; i < self.length; i++) if (!compareBoth(self[i], that[i])) return false;
 	return true;
@@ -1263,48 +1232,29 @@ function compareRecords(self, that) {
 	for (const key of selfKeys) if (!thatKeys.has(key) || !compareBoth(self[key], that[key])) return false;
 	return true;
 }
-/** @internal */
-function makeCompareMap(keyEquivalence, valueEquivalence) {
-	return function compareMaps(self, that) {
-		const thatEntries = Array.from(that);
-		for (const [selfKey, selfValue] of self) {
-			let found = false;
-			for (let i = 0; i < thatEntries.length; i++) {
-				const [thatKey, thatValue] = thatEntries[i];
-				if (keyEquivalence(selfKey, thatKey) && valueEquivalence(selfValue, thatValue)) {
-					thatEntries[i] = thatEntries[thatEntries.length - 1];
-					thatEntries.pop();
-					found = true;
-					break;
-				}
+function compareHashed(self, that, hashOf, equivalent) {
+	const groups = /* @__PURE__ */ new Map();
+	for (const item of that) {
+		const h = hashOf(item);
+		const group = groups.get(h);
+		if (group) group.push(item);
+		else groups.set(h, [item]);
+	}
+	outer: for (const item of self) {
+		const group = groups.get(hashOf(item));
+		if (group) {
+			for (let i = 0; i < group.length; i++) if (equivalent(item, group[i])) {
+				group[i] = group[group.length - 1];
+				group.pop();
+				continue outer;
 			}
-			if (!found) return false;
 		}
-		return true;
-	};
-}
-const compareMaps = /*#__PURE__*/ makeCompareMap(compareBoth, compareBoth);
-/** @internal */
-function makeCompareSet(equivalence) {
-	return function compareSets(self, that) {
-		const thatValues = Array.from(that);
-		for (const selfValue of self) {
-			let found = false;
-			for (let i = 0; i < thatValues.length; i++) {
-				const thatValue = thatValues[i];
-				if (equivalence(selfValue, thatValue)) {
-					thatValues[i] = thatValues[thatValues.length - 1];
-					thatValues.pop();
-					found = true;
-					break;
-				}
-			}
-			if (!found) return false;
-		}
-		return true;
-	};
+		return false;
+	}
+	return true;
 }
-const compareSets = /*#__PURE__*/ makeCompareSet(compareBoth);
+const entryHash = (entry) => hash(entry[0]);
+const equalEntries = (self, that) => compareBoth(self[0], that[0]) && compareBoth(self[1], that[1]);
 /**
 * Checks whether a value implements the {@link Equal} interface.
 *
@@ -1372,9 +1322,9 @@ const isEqual = (u) => hasProperty(u, symbol);
 * @category instances
 * @since 4.0.0
 */
-const asEquivalence = () => equals$2;
+const asEquivalence = () => equals$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Redactable.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Redactable.js
 /**
 * Defines the symbol used to identify objects that implement the {@link Redactable}
 * protocol.
@@ -1493,7 +1443,7 @@ const emptyContext$1 = {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Formatter.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Formatter.js
 /**
 * Formats JavaScript values into readable strings.
 *
@@ -1668,7 +1618,7 @@ function safeGet(input, key) {
 	}
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Inspectable.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Inspectable.js
 /**
 * Controls how values appear in logs and debugging output.
 *
@@ -1793,7 +1743,7 @@ const BaseProto = {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/stackTraceLimit.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/stackTraceLimit.js
 /**
 * Check if `Error.stackTraceLimit` is writable.
 * Returns `false` if the property is frozen, non-writable, or `Error` is non-extensible.
@@ -1825,9 +1775,10 @@ const setStackTraceLimit = (value) => {
 	if (canWriteStackTraceLimit) Error.stackTraceLimit = value;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Utils.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Utils.js
 /**
-* Yields its wrapped value exactly once through an `IterableIterator`.
+* Yields its wrapped value exactly once, then completes with the value sent
+* back in.
 *
 * **When to use**
 *
@@ -1837,10 +1788,11 @@ const setStackTraceLimit = (value) => {
 *
 * **Details**
 *
-* The first call to `next()` returns `{ value: self, done: false }`. Every
-* subsequent call returns `{ value: a, done: true }` where `a` is the argument
-* passed to `next()`. `[Symbol.iterator]()` returns a **new** `SingleShotGen`
-* wrapping the same value, so the outer type can be iterated multiple times.
+* The first call to `next()` returns a fresh `{ value: self, done: false }`.
+* Every subsequent call returns `{ value: a, done: true }` where `a` is the
+* argument passed to `next()`. To keep `yield*` cheap, the completion result
+* is the iterator itself rather than a new object, so only the iterator and
+* the single yielded result are allocated per `yield*`.
 *
 * **Example** (Yielding a wrapped value in a generator)
 *
@@ -1849,20 +1801,19 @@ const setStackTraceLimit = (value) => {
 *
 * const gen = new Utils.SingleShotGen<string, number>("hello")
 *
-* gen.next(0) // => { value: "hello", done: false }
+* gen.next(0).value // => "hello"
 *
-* gen.next(42) // => { value: 42, done: true }
+* gen.next(42).value // => 42
 * ```
 *
 * @see {@link Gen} for the type-level signature that relies on `SingleShotGen`
 * @category constructors
 * @since 2.0.0
 */
-var SingleShotGen = class SingleShotGen {
-	called = false;
-	self;
+var SingleShotGen = class {
 	constructor(self) {
-		this.self = self;
+		this.value = self;
+		this.done = false;
 	}
 	/**
 	* Yields the stored value once, then completes with the value sent back in.
@@ -1875,26 +1826,15 @@ var SingleShotGen = class SingleShotGen {
 	* @since 2.0.0
 	*/
 	next(a) {
-		return this.called ? {
-			value: a,
-			done: true
-		} : (this.called = true, {
-			value: this.self,
+		if (this.done) {
+			this.value = a;
+			return this;
+		}
+		this.done = true;
+		return {
+			value: this.value,
 			done: false
-		});
-	}
-	/**
-	* Creates a fresh single-shot iterator over the stored value.
-	*
-	* **When to use**
-	*
-	* Use to iterate the wrapped value again without reusing the consumed
-	* iterator state.
-	*
-	* @since 2.0.0
-	*/
-	[Symbol.iterator]() {
-		return new SingleShotGen(this.self);
+		};
 	}
 };
 const pickInternalCall = () => {
@@ -1912,7 +1852,7 @@ const pickInternalCall = () => {
 /** @internal */
 const internalCall = /*#__PURE__*/ pickInternalCall();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/record.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/record.js
 /** @internal */
 function assignProperty(self, key, value) {
 	if (key === "__proto__") Object.defineProperty(self, key, {
@@ -1928,7 +1868,7 @@ function assignProperties(self, source) {
 	for (const key of Reflect.ownKeys(source)) if (Object.prototype.propertyIsEnumerable.call(source, key)) assignProperty(self, key, source[key]);
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/core.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/core.js
 /** @internal */
 const EffectTypeId = `~effect/Effect`;
 /** @internal */
@@ -2017,7 +1957,7 @@ var CauseImpl = class {
 		return this.toJSON();
 	}
 	[symbol](that) {
-		return isCause(that) && this.reasons.length === that.reasons.length && this.reasons.every((e, i) => equals$2(e, that.reasons[i]));
+		return isCause(that) && this.reasons.length === that.reasons.length && this.reasons.every((e, i) => equals$1(e, that.reasons[i]));
 	}
 	[symbol$1]() {
 		return array(this.reasons);
@@ -2078,7 +2018,7 @@ var Fail = class extends ReasonBase {
 		};
 	}
 	[symbol](that) {
-		return isFailReason$1(that) && equals$2(this.error, that.error) && equals$2(this.annotations, that.annotations);
+		return isFailReason$1(that) && equals$1(this.error, that.error) && equals$1(this.annotations, that.annotations);
 	}
 	[symbol$1]() {
 		return combine(string$1(this._tag))(combine(hash(this.error))(hash(this.annotations)));
@@ -2104,7 +2044,7 @@ var Die = class extends ReasonBase {
 		};
 	}
 	[symbol](that) {
-		return isDieReason(that) && equals$2(this.defect, that.defect) && equals$2(this.annotations, that.annotations);
+		return isDieReason(that) && equals$1(this.defect, that.defect) && equals$1(this.annotations, that.annotations);
 	}
 	[symbol$1]() {
 		return combine(string$1(this._tag))(combine(hash(this.defect))(hash(this.annotations)));
@@ -2166,7 +2106,7 @@ const makeExit = (options) => {
 			};
 		},
 		[symbol](that) {
-			return isExit(that) && that._tag === this._tag && equals$2(this[args], that[args]);
+			return isExit(that) && that._tag === this._tag && equals$1(this[args], that[args]);
 		},
 		[symbol$1]() {
 			return combine(string$1(options.op), hash(this[args]));
@@ -2264,7 +2204,7 @@ const TaggedError$1 = (tag) => {
 	return Base;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Effectable.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Effectable.js
 /**
 * Create a low-level `Effect` prototype.
 *
@@ -2289,58 +2229,7 @@ const Prototype = (options) => makePrimitiveProto({
 	[evaluate]: options.evaluate
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Equivalence.js
-/**
-* Creates a custom equivalence relation with an optimized reference equality check.
-*
-* **When to use**
-*
-* Use when you need an equality rule that the built-in instances and input
-* mapping helpers cannot express, and you can provide a law-abiding comparison.
-*
-* **Details**
-*
-* The returned equivalence first checks reference equality (`===`) for
-* performance. If the values are not the same reference, it falls back to the
-* provided equivalence function, which must satisfy reflexive, symmetric, and
-* transitive properties.
-*
-* **Example** (Case-insensitive string equivalence)
-*
-* ```ts import.meta.vitest
-* import { Equivalence } from "effect"
-*
-* const caseInsensitive = Equivalence.make<string>((a, b) =>
-*   a.toLowerCase() === b.toLowerCase()
-* )
-*
-* caseInsensitive("Hello", "HELLO") // => true
-* caseInsensitive("foo", "bar") // => false
-*
-* // Same reference optimization
-* const str = "test"
-* caseInsensitive(str, str) // => true
-* ```
-*
-* **Example** (Comparing numbers with tolerance)
-*
-* ```ts import.meta.vitest
-* import { Equivalence } from "effect"
-*
-* const tolerance = Equivalence.make<number>((a, b) => Math.abs(a - b) < 0.0001)
-*
-* tolerance(1.0, 1.001) // => false
-* tolerance(1.0, 1.00001) // => true
-* ```
-*
-* @see {@link strictEqual}
-* @see {@link mapInput}
-* @category constructors
-* @since 2.0.0
-*/
-const make$14 = (isEquivalent) => (self, that) => self === that || isEquivalent(self, that);
-//#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/option.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/option.js
 /**
 * @since 2.0.0
 */
@@ -2356,7 +2245,7 @@ const SomeProto = /*#__PURE__*/ Object.defineProperty(/*#__PURE__*/ Object.assig
 	_tag: "Some",
 	_op: "Some",
 	[symbol](that) {
-		return isOption(that) && isSome$1(that) && equals$2(this.value, that.value);
+		return isOption(that) && isSome$1(that) && equals$1(this.value, that.value);
 	},
 	[symbol$1]() {
 		return combine(hash(this._tag))(hash(this.value));
@@ -2411,7 +2300,7 @@ SomeImpl.prototype = SomeProto;
 /** @internal */
 const some$2 = (value) => new SomeImpl(value);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/result.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/result.js
 const TypeId$11 = "~effect/Result";
 const CommonProto = {
 	[TypeId$11]: {
@@ -2428,7 +2317,7 @@ const SuccessProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Com
 	_tag: "Success",
 	_op: "Success",
 	[symbol](that) {
-		return isResult(that) && isSuccess$2(that) && equals$2(this.success, that.success);
+		return isResult(that) && isSuccess$2(that) && equals$1(this.success, that.success);
 	},
 	[symbol$1]() {
 		return combine(hash(this._tag))(hash(this.success));
@@ -2448,7 +2337,7 @@ const FailureProto = /*#__PURE__*/ Object.assign(/*#__PURE__*/ Object.create(Com
 	_tag: "Failure",
 	_op: "Failure",
 	[symbol](that) {
-		return isResult(that) && isFailure$1(that) && equals$2(this.failure, that.failure);
+		return isResult(that) && isFailure$1(that) && equals$1(this.failure, that.failure);
 	},
 	[symbol$1]() {
 		return combine(hash(this._tag))(hash(this.failure));
@@ -2487,7 +2376,87 @@ const succeed$5 = (success) => new SuccessImpl(success);
 /** @internal */
 const fromOption$1 = /*#__PURE__*/ dual(2, (self, onNone) => isNone$1(self) ? fail$5(onNone()) : succeed$5(self.value));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Option.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Order.js
+/**
+* Defines comparison functions for ordered values.
+*
+* An `Order<A>` compares two `A` values and returns whether the first is less
+* than, equal to, or greater than the second. Orders are used for sorting,
+* choosing minimum or maximum values, checking ranges, and building ordered data
+* structures. This module includes built-in orders, constructors for custom
+* orders, tools for reversing and combining comparisons, tuple and struct
+* helpers, comparison predicates, clamping, and reducer support.
+*
+* @since 2.0.0
+*/
+/**
+* Creates a new `Order` instance from a comparison function.
+*
+* **When to use**
+*
+* Use when you need a sorting rule not covered by the built-in orders or input
+* mapping helpers, and you can provide a total comparison.
+*
+* **Details**
+*
+* Uses reference equality (`===`) as a shortcut: if `self === that`, it returns
+* `0` without calling the comparison function. The comparison function should
+* return `-1`, `0`, or `1`, and the returned order satisfies total ordering
+* laws when the comparison function does.
+*
+* **Example** (Creating an Order)
+*
+* ```ts import.meta.vitest
+* import { Order } from "effect"
+*
+* const byAge = Order.make<{ name: string; age: number }>((self, that) => {
+*   if (self.age < that.age) return -1
+*   if (self.age > that.age) return 1
+*   return 0
+* })
+*
+* byAge({ name: "Alice", age: 30 }, { name: "Bob", age: 25 }) // => 1
+* byAge({ name: "Alice", age: 25 }, { name: "Bob", age: 30 }) // => -1
+* ```
+*
+* @see {@link mapInput} to transform an order by mapping the input type
+* @see {@link combine} to combine multiple orders
+* @category constructors
+* @since 2.0.0
+*/
+function make$13(compare) {
+	return (self, that) => self === that ? 0 : compare(self, that);
+}
+/**
+* Order instance for strings that compares them lexicographically using JavaScript's `<` operator.
+*
+* **When to use**
+*
+* Use when you need lexicographic string ordering.
+*
+* **Details**
+*
+* Uses lexicographic dictionary ordering. The empty string is less than any
+* non-empty string, and comparisons are case-sensitive.
+*
+* **Example** (Ordering strings)
+*
+* ```ts import.meta.vitest
+* import { Order } from "effect"
+*
+* Order.String("apple", "banana") // => -1
+* Order.String("banana", "apple") // => 1
+* Order.String("apple", "apple") // => 0
+* ```
+*
+* @see {@link mapInput} to compare objects by a string property
+* @see {@link Struct} to combine with other orders for struct comparison
+* @category instances
+* @since 4.0.0
+*/
+const String$4 = /*#__PURE__*/ make$13((self, that) => self < that ? -1 : 1);
+//#endregion
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Option.js
 /**
 * Creates an `Option` representing the absence of a value.
 *
@@ -3057,7 +3026,7 @@ const gen$2 = (...args) => {
 	return some$1(state.value);
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Context.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Context.js
 /**
 * Runtime type identifier attached to `Context` service keys and used by
 * `isKey` to recognize them.
@@ -3192,7 +3161,7 @@ const lookup = (self, key) => {
 	for (let overlay = impl.overlay; overlay; overlay = overlay.parent) if (overlay.key === key) return overlay.value;
 	const value = impl.base.get(key);
 	if (value === void 0 && !impl.base.has(key)) return notFound;
-	if (impl.overlay && ++impl.baseHits >= FlattenAfterBaseHits) {
+	if (impl.overlay && ++impl.baseHits >= impl.base.size && impl.baseHits >= FlattenAfterBaseHits) {
 		impl.base = flatten(impl);
 		impl.overlay = void 0;
 		impl.depth = 0;
@@ -3251,7 +3220,7 @@ const Proto$3 = {
 		const self = this.mapUnsafe;
 		const other = that.mapUnsafe;
 		if (self.size !== other.size) return false;
-		for (const [key, value] of self) if (!other.has(key) || !equals$2(value, other.get(key))) return false;
+		for (const [key, value] of self) if (!other.has(key) || !equals$1(value, other.get(key))) return false;
 		return true;
 	},
 	[symbol$1]() {
@@ -3508,7 +3477,7 @@ const serviceNotFoundError = (service) => {
 */
 const Reference = Service;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Duration.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Duration.js
 const TypeId$9 = "~effect/Duration";
 const bigint0$1 = /*#__PURE__*/ BigInt(0);
 const bigint1$1 = /*#__PURE__*/ BigInt(1);
@@ -3629,7 +3598,7 @@ const DurationProto = {
 		}
 	},
 	[symbol](that) {
-		return isDuration(that) && equals$1(this, that);
+		return isDuration(that) && equals(this, that);
 	},
 	toString() {
 		switch (this.value._tag) {
@@ -3931,7 +3900,7 @@ const matchPair = /*#__PURE__*/ dual(3, (self, that, options) => {
 * @category instances
 * @since 2.0.0
 */
-const Equivalence$2 = (self, that) => matchPair(self, that, {
+const Equivalence$1 = (self, that) => matchPair(self, that, {
 	onMillis: (self, that) => self === that,
 	onNanos: (self, that) => self === that,
 	onInfinity: (self, that) => self.value._tag === that.value._tag
@@ -3950,16 +3919,16 @@ const Equivalence$2 = (self, that) => matchPair(self, that, {
 * @category predicates
 * @since 2.0.0
 */
-const equals$1 = /*#__PURE__*/ dual(2, (self, that) => Equivalence$2(self, that));
+const equals = /*#__PURE__*/ dual(2, (self, that) => Equivalence$1(self, that));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/array.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/array.js
 /**
 * @since 2.0.0
 */
 /** @internal */
 const isArrayNonEmpty$1 = (self) => self.length > 0;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/count.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/count.js
 /**
 * Normalizes a collection count to a non-negative integer. `NaN` and
 * non-positive values become `0`; positive infinity is preserved.
@@ -3968,7 +3937,7 @@ const isArrayNonEmpty$1 = (self) => self.length > 0;
 */
 const normalize$1 = (n) => n > 0 ? Math.floor(n) : 0;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Result.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Result.js
 /**
 * Creates a `Result` holding a `Success` value.
 *
@@ -4110,7 +4079,7 @@ const fromOption = fromOption$1;
 */
 const isSuccess$1 = isSuccess$2;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Tuple.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Tuple.js
 /**
 * Creates a tuple from the provided arguments.
 *
@@ -4139,7 +4108,7 @@ const isSuccess$1 = isSuccess$2;
 */
 const make$10 = (...elements) => elements;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Iterable.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Iterable.js
 /**
 * Returns the first element that satisfies the specified
 * predicate, or `None` if no such element exists.
@@ -4192,7 +4161,7 @@ const findFirst$1 = /*#__PURE__*/ dual(2, (self, f) => {
 	return none();
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Record.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Record.js
 /**
 * Creates a new, empty record.
 *
@@ -4330,7 +4299,7 @@ const union$1 = /*#__PURE__*/ dual(3, (self, that, combine) => {
 	return out;
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Array.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Array.js
 /**
 * Works with JavaScript arrays, readonly arrays, and non-empty arrays.
 *
@@ -5139,7 +5108,7 @@ const flatMap$2 = /*#__PURE__*/ dual(2, (self, f) => {
 * ```
 *
 * @see {@link filter} — keep original elements matching a predicate
-* @see {@link partition} for keeping both failures and successes
+* @see {@link partition} for keeping both successes and failures
 *
 * @category filtering
 * @since 2.0.0
@@ -5274,7 +5243,7 @@ const some = /*#__PURE__*/ dual(2, (self, predicate) => self.some(predicate));
 */
 const join = /*#__PURE__*/ dual(2, (self, sep) => fromIterable$1(self).join(sep));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Scheduler.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Scheduler.js
 /**
 * Controls how runnable Effect fiber tasks are dispatched.
 *
@@ -5543,7 +5512,7 @@ const PreventSchedulerYield = /*#__PURE__*/ Reference("effect/Scheduler/PreventS
 */
 const TaggedError = TaggedError$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Tracer.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Tracer.js
 /**
 * Defines the string key for the parent-span context service.
 *
@@ -5578,11 +5547,11 @@ const ParentSpanKey = "effect/Tracer/ParentSpan";
 */
 const TracerKey = "effect/Tracer";
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/metric.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/metric.js
 /** @internal */
 const FiberRuntimeMetricsKey = "effect/Metric/FiberRuntimeMetrics";
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/references.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/references.js
 /** @internal */
 const CurrentStackFrame = /*#__PURE__*/ Reference("effect/References/CurrentStackFrame", {
 	fiberCached: true,
@@ -5604,7 +5573,7 @@ const MinimumLogLevel = /*#__PURE__*/ Reference("effect/References/MinimumLogLev
 	defaultValue: () => "Info"
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/effect.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/effect.js
 /** @internal */
 var Interrupt = class extends ReasonBase {
 	constructor(fiberId, annotations = constEmptyAnnotations) {
@@ -5638,7 +5607,7 @@ const dedupeReasons = (self, that) => {
 		const hash$1 = hash(reason);
 		const bucket = buckets.get(hash$1);
 		if (bucket === void 0) buckets.set(hash$1, [reason]);
-		else if (bucket.some((previous) => equals$2(previous, reason))) continue;
+		else if (bucket.some((previous) => equals$1(previous, reason))) continue;
 		else bucket.push(reason);
 		out.push(reason);
 	}
@@ -5649,7 +5618,7 @@ const causeCombine = /*#__PURE__*/ dual(2, (self, that) => {
 	if (self.reasons.length === 0) return that;
 	else if (that.reasons.length === 0) return self;
 	const newCause = new CauseImpl(dedupeReasons(self.reasons, that.reasons));
-	return equals$2(self, newCause) ? self : newCause;
+	return equals$1(self, newCause) ? self : newCause;
 });
 /** @internal */
 const causeMap = /*#__PURE__*/ dual(2, (self, f) => {
@@ -5664,21 +5633,14 @@ const causeMap = /*#__PURE__*/ dual(2, (self, f) => {
 	return hasFail ? causeFromReasons(failures) : self;
 });
 /** @internal */
-const causePartition = (self) => {
-	const obj = {
-		Fail: [],
-		Die: [],
-		Interrupt: []
-	};
-	for (let i = 0; i < self.reasons.length; i++) obj[self.reasons[i]._tag].push(self.reasons[i]);
-	return obj;
-};
-/** @internal */
 const causeSquash = (self) => {
-	const partitioned = causePartition(self);
-	if (partitioned.Fail.length > 0) return partitioned.Fail[0].error;
-	else if (partitioned.Die.length > 0) return partitioned.Die[0].defect;
-	else if (partitioned.Interrupt.length > 0) return new globalThis.Error("All fibers interrupted without error");
+	let die;
+	for (const reason of self.reasons) {
+		if (reason._tag === "Fail") return reason.error;
+		if (reason._tag === "Die") die ??= reason;
+	}
+	if (die !== void 0) return die.defect;
+	if (self.reasons.length > 0) return new globalThis.Error("All fibers interrupted without error");
 	return new globalThis.Error("Empty cause");
 };
 /** @internal */
@@ -5693,7 +5655,6 @@ const getCurrentFiber = () => globalThis[currentFiberTypeId];
 /** @internal */
 var FiberImpl = class {
 	constructor(context, interruptible = true) {
-		this[FiberTypeId] = fiberVariance;
 		this.setContext(context);
 		this.id = ++fiberIdStore.id;
 		this.currentOpCount = 0;
@@ -5709,22 +5670,9 @@ var FiberImpl = class {
 		this._parent = void 0;
 		this.cache.runtimeMetrics?.recordFiberStart(this.context);
 	}
-	[FiberTypeId];
-	id;
-	interruptible;
-	currentOpCount;
-	_stack;
-	_observers;
-	_exit;
-	_children;
-	_interruptedCause;
-	_yielded;
-	_running;
-	_deferredInterrupt;
-	_parent;
-	context;
-	cache;
-	_dispatcher = void 0;
+	get [FiberTypeId]() {
+		return fiberVariance;
+	}
 	get currentDispatcher() {
 		return this._dispatcher ??= this.cache.scheduler.makeDispatcher();
 	}
@@ -5738,11 +5686,12 @@ var FiberImpl = class {
 		}
 		if (this._observers === void 0) this._observers = [cb];
 		else this._observers.push(cb);
-		return () => {
-			if (this._exit || this._observers === void 0) return;
-			const index = this._observers.indexOf(cb);
-			if (index >= 0) this._observers.splice(index, 1);
-		};
+		return () => this.removeObserver(cb);
+	}
+	removeObserver(cb) {
+		if (this._exit || this._observers === void 0) return;
+		const index = this._observers.indexOf(cb);
+		if (index >= 0) this._observers.splice(index, 1);
 	}
 	interruptUnsafe(fiberId, annotations) {
 		if (this._exit) return;
@@ -5847,6 +5796,11 @@ var FiberImpl = class {
 			if (op[symbol]) return op;
 		}
 	}
+	succeedWith(value) {
+		if ((++this.currentOpCount & maxInlineSteps - 1) === 0) return exitSucceed(value);
+		const cont = this.getCont(contA);
+		return cont ? cont[contA](value, this) : this.yieldWith(exitSucceed(value));
+	}
 	yieldWith(value) {
 		this._yielded = value;
 		return Yield;
@@ -5863,7 +5817,7 @@ var FiberImpl = class {
 		if (previous !== void 0 && hasSameCache(previous, context)) return;
 		const root = context.cacheRoot;
 		const cache = root._fiberCache ??= makeFiberContextCache(context);
-		if (this.cache !== void 0 && this.cache.scheduler !== cache.scheduler) this._dispatcher = void 0;
+		if (this.cache?.scheduler !== cache.scheduler) this._dispatcher = void 0;
 		this.cache = cache;
 	}
 	get currentSpanLocal() {
@@ -5895,6 +5849,7 @@ const deferredInterruptCont = {
 		return failCause$1(fiber._interruptedCause);
 	}
 };
+const maxInlineSteps = 32;
 const fiberMiddleware = { interruptChildren: void 0 };
 const fiberStackAnnotations = (fiber) => {
 	if (!fiber.cache.stackFrame) return void 0;
@@ -5952,7 +5907,7 @@ const sync$1 = /*#__PURE__*/ makePrimitive({
 	}
 });
 /** @internal */
-const suspend = /*#__PURE__*/ makePrimitive({
+const suspend$1 = /*#__PURE__*/ makePrimitive({
 	op: "Suspend",
 	[evaluate](_fiber) {
 		return this[args]();
@@ -5973,7 +5928,7 @@ const yieldNow = /*#__PURE__*/ (/* @__PURE__ */ makePrimitive({
 	}
 }))(0);
 /** @internal */
-const failCauseSync$1 = (evaluate) => suspend(() => failCause$1(internalCall(evaluate)));
+const failCauseSync$1 = (evaluate) => suspend$1(() => failCause$1(evaluate()));
 /** @internal */
 const die$2 = (defect) => exitDie(defect);
 /** @internal */
@@ -5982,11 +5937,10 @@ const callbackOptions = /*#__PURE__*/ function() {
 	const Proto = /*#__PURE__*/ makePrimitiveProto({
 		op: "Async",
 		[evaluate](fiber) {
-			const register = internalCall(() => this.register.bind(fiber.cache.scheduler));
 			let resumed = false;
 			let yielded = false;
 			const controller = this.withSignal ? new AbortController() : void 0;
-			const onCancel = register((effect) => {
+			const onCancel = this.register.call(fiber.cache.scheduler, (effect) => {
 				if (resumed) return;
 				resumed = true;
 				if (yielded) fiber.evaluate(effect);
@@ -6024,7 +5978,7 @@ const asyncFinalizer = /*#__PURE__*/ makePrimitive({
 		}
 	},
 	[contE](cause, _fiber) {
-		return hasInterrupts(cause) ? flatMap$1(this[args](), () => failCause$1(cause)) : failCause$1(cause);
+		return hasInterrupts(cause) ? flatMap$1(combineFinalizerCause(exitFailCause(cause), this[args]()), () => failCause$1(cause)) : failCause$1(cause);
 	}
 });
 /** @internal */
@@ -6033,10 +5987,10 @@ const callback = (register) => callbackOptions(register, register.length >= 2);
 const gen$1 = (...args) => {
 	if (args.length === 1) {
 		const body = args[0];
-		return suspend(() => fromIteratorUnsafe(body()));
+		return suspend$1(() => fromIteratorUnsafe(body()));
 	}
 	const [options, body] = args;
-	return suspend(() => fromIteratorUnsafe(body.call(options.self)));
+	return suspend$1(() => fromIteratorUnsafe(body.call(options.self)));
 };
 const defineFunctionLength = (length, fn) => Object.defineProperty(fn, "length", {
 	value: length,
@@ -6064,11 +6018,11 @@ const fromIteratorEagerUnsafe = (evaluate) => {
 			} else if (primitive && primitive._tag === "Failure") return state.value;
 			else {
 				let isFirstExecution = true;
-				return suspend(() => {
+				return suspend$1(() => {
 					if (isFirstExecution) {
 						isFirstExecution = false;
 						return flatMap$1(state.value, (value) => fromIteratorUnsafe(iterator, value));
-					} else return suspend(() => fromIteratorUnsafe(evaluate()));
+					} else return suspend$1(() => fromIteratorUnsafe(evaluate()));
 				});
 			}
 		}
@@ -6114,11 +6068,6 @@ const OnSuccessProto = /*#__PURE__*/ makePrimitiveProto({
 	op: "OnSuccess",
 	[evaluate]: evaluateCont
 });
-const OnSuccessImpl = function(self, f) {
-	this[args] = self;
-	this[contA] = f;
-};
-OnSuccessImpl.prototype = OnSuccessProto;
 const ContImpl = function(self, cont, payload) {
 	this[args] = self;
 	this[contA] = cont;
@@ -6128,20 +6077,26 @@ ContImpl.prototype = OnSuccessProto;
 const returnPayload = function() {
 	return this.payload;
 };
-const mapCont = function(value) {
+const continuationMarksStack = /*#__PURE__*/ (() => {
+	const marker = "~effect/Effect/stackProbe";
+	return { [marker]: function stackProbe() {
+		return (/* @__PURE__ */ new Error()).stack;
+	} }[marker]()?.includes("[as " + marker + "]") === true;
+})();
+const mapCont = function(value, fiber) {
 	const f = this.payload;
-	return succeed$3(internalCall(() => f(value)));
+	return fiber.succeedWith(continuationMarksStack ? f(value) : internalCall(() => f(value)));
 };
 const andThenCont = function(value) {
 	const f = this.payload;
-	return internalCall(() => f(value));
+	return f(value);
 };
 /** @internal */
 const andThen$1 = /*#__PURE__*/ dual(2, (self, f) => new ContImpl(self, isEffect(f) ? returnPayload : andThenCont, f));
 /** @internal */
 const asVoid = (self) => new ContImpl(self, returnPayload, exitVoid);
 /** @internal */
-const flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => new OnSuccessImpl(self, f.length !== 1 ? (a) => f(a) : f));
+const flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => new ContImpl(self, andThenCont, f));
 /** @internal */
 const effectIsExit = (effect) => effect[ExitTypeId] !== void 0;
 /** @internal */
@@ -6167,9 +6122,10 @@ const updateContext = /*#__PURE__*/ dual(2, (self, f) => withFiber((fiber) => {
 	const nextContext = f(prevContext);
 	if (prevContext === nextContext) return self;
 	fiber.setContext(nextContext);
-	return onExitPrimitive(self, () => {
+	onExitUnsafe(fiber, () => {
 		fiber.setContext(prevContext);
 	});
+	return self;
 }));
 /** @internal */
 const provideService$1 = function() {
@@ -6206,16 +6162,15 @@ const exitPrimitive = /*#__PURE__*/ makePrimitive({
 		fiber._stack.push(this);
 		return this[args];
 	},
-	[contA](value, _, exit) {
-		return succeed$3(exit ?? exitSucceed(value));
+	[contA](value, fiber, exit) {
+		return fiber.succeedWith(exit ?? exitSucceed(value));
 	},
-	[contE](cause, _, exit) {
-		return succeed$3(exit ?? exitFailCause(cause));
+	[contE](cause, fiber, exit) {
+		return fiber.succeedWith(exit ?? exitFailCause(cause));
 	}
 });
 const combineFinalizerCause = (exit_, finalizer) => exitIsSuccess(exit_) ? finalizer : catchCause$1(finalizer, (cause) => failCause$1(causeCombine(exit_.cause, cause)));
-/** @internal */
-const onExitPrimitive = /*#__PURE__*/ function() {
+const OnExitImpl = /*#__PURE__*/ function() {
 	const Proto = /*#__PURE__*/ makePrimitiveProto({
 		op: "OnExit",
 		[evaluate](fiber) {
@@ -6230,12 +6185,22 @@ const onExitPrimitive = /*#__PURE__*/ function() {
 		},
 		[contA](value, _, exit) {
 			exit ??= exitSucceed(value);
-			const eff = this.onExit(exit);
+			let eff;
+			try {
+				eff = this.onExit(exit);
+			} catch (defect) {
+				eff = exitDie(defect);
+			}
 			return eff ? flatMap$1(eff, (_) => exit) : exit;
 		},
 		[contE](cause, _, exit) {
 			exit ??= exitFailCause(cause);
-			const eff = this.onExit(exit);
+			let eff;
+			try {
+				eff = this.onExit(exit);
+			} catch (defect) {
+				eff = exitDie(defect);
+			}
 			return eff ? flatMap$1(combineFinalizerCause(exit, eff), (_) => exit) : exit;
 		}
 	});
@@ -6245,10 +6210,15 @@ const onExitPrimitive = /*#__PURE__*/ function() {
 		this.interruptible = interruptible;
 	};
 	OnExitImpl.prototype = Proto;
-	return function(effect, onExit, interruptible) {
-		return new OnExitImpl(effect, onExit, interruptible);
-	};
+	return OnExitImpl;
 }();
+/**
+* Pushes an exit finalizer for the current `withFiber` evaluation. Only call inside `withFiber`.
+* @internal
+*/
+const onExitUnsafe = (fiber, f) => {
+	fiber._stack.push(new OnExitImpl(void 0, f, void 0));
+};
 /** @internal */
 const uninterruptible = (self) => withFiber((fiber) => {
 	if (!fiber.interruptible) return self;
@@ -6283,7 +6253,7 @@ const whileLoop = /*#__PURE__*/ makePrimitive({
 	}
 });
 /** @internal */
-const forEach$1 = /*#__PURE__*/ dual((args) => typeof args[1] === "function", (iterable, f, options) => suspend(() => {
+const forEach$1 = /*#__PURE__*/ dual((args) => typeof args[1] === "function", (iterable, f, options) => suspend$1(() => {
 	const concurrency = resolveConcurrency(options?.concurrency);
 	if (concurrency === 1) return forEachSequential(iterable, f, options);
 	const items = fromIterable$1(iterable);
@@ -6296,7 +6266,7 @@ const forEach$1 = /*#__PURE__*/ dual((args) => typeof args[1] === "function", (i
 	}, items, { concurrency });
 	return eff ? as(eff, out) : succeed$3(out);
 }));
-const forEachSequential = (iterable, f, options) => suspend(() => {
+const forEachSequential = (iterable, f, options) => suspend$1(() => {
 	const out = options?.discard ? void 0 : [];
 	const iterator = iterable[Symbol.iterator]();
 	let state = iterator.next();
@@ -6316,11 +6286,12 @@ const resolveConcurrency = (concurrency) => concurrency === "unbounded" ? Number
 const iterateEager = () => (options) => {
 	const onItem = options.onItem;
 	const step = options.step;
+	const resumeSequential = (state, items, index, end, effect) => flatMap$1(exit$1(effect), (itemExit) => step(state, items[index], itemExit, index) ?? runSequential(state, items, index + 1, end) ?? void_$2);
 	const runSequential = (state, items, index = 0, end = items.length) => {
 		for (; index < end; index++) {
 			const item = items[index];
 			const effect = onItem(state, item, index);
-			if (!effectIsExit(effect)) return flatMap$1(exit$1(effect), (itemExit) => step(state, item, itemExit, index) ?? runSequential(state, items, index + 1, end) ?? void_$2);
+			if (!effectIsExit(effect)) return resumeSequential(state, items, index, end, effect);
 			const terminal = step(state, item, effect, index);
 			if (terminal) return terminal._tag === "Failure" ? terminal : void 0;
 		}
@@ -6338,15 +6309,13 @@ const iterateConcurrentImpl = (options) => {
 		let parentFiber;
 		let fibers;
 		let resume;
-		let interrupted = false;
 		let terminal;
 		let effect;
 		const failDefect = (error) => {
 			const defect = exitDie(error);
 			terminal = defect;
 			done = true;
-			interrupted = true;
-			return fibers && fibers.size > 0 ? flatMap$1(uninterruptible(fiberInterruptAll(Array.from(fibers))), () => defect) : defect;
+			return fibers && fibers.size > 0 ? flatMap$1(uninterruptible(fiberInterruptAll(Array.from(fibers))), () => terminal ?? defect) : defect;
 		};
 		const go = () => {
 			let paused = false;
@@ -6368,10 +6337,9 @@ const iterateConcurrentImpl = (options) => {
 						return cb(failDefect(error));
 					}
 					if (result) return cb(result);
-					return suspend(() => {
-						terminal = exitVoid;
-						interrupted = true;
-						return fibers ? fiberInterruptAll(fibers) : void_$2;
+					return suspend$1(() => {
+						terminal ??= exitVoid;
+						return flatMap$1(fibers ? fiberInterruptAll(fibers) : void_$2, () => terminal?._tag === "Failure" ? terminal : void_$2);
 					});
 				});
 				else {
@@ -6388,13 +6356,17 @@ const iterateConcurrentImpl = (options) => {
 						fibers.delete(fiber);
 						try {
 							if (terminal) {
-								if (!interrupted && exit._tag === "Failure") for (const reason of exit.cause.reasons) if (reason._tag === "Interrupt") continue;
-								else if (terminal._tag === "Failure") terminal.cause.reasons.push(reason);
-								else terminal = exitFailCause(causeFromReasons([reason]));
+								if (exit._tag === "Failure") {
+									const reasons = exit.cause.reasons.filter((reason) => reason._tag !== "Interrupt");
+									if (reasons.length > 0) {
+										const cause = causeFromReasons(reasons);
+										terminal = exitFailCause(terminal._tag === "Failure" ? causeCombine(terminal.cause, cause) : cause);
+									}
+								}
 							} else {
 								const result = step(state, item, exit, currentIndex);
 								if (result) {
-									terminal = result._tag === "Failure" ? exitFailCause(causeFromReasons(result.cause.reasons.slice())) : result;
+									terminal = result;
 									go();
 								}
 							}
@@ -6518,7 +6490,7 @@ const colors = {
 };
 colors.gray, colors.blue, colors.green, colors.yellow, colors.red, colors.bgBrightRed, colors.black;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Exit.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Exit.js
 /**
 * Creates a successful Exit containing the given value.
 *
@@ -6633,7 +6605,7 @@ const void_$1 = exitVoid;
 */
 const isSuccess = exitIsSuccess;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Cause.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Cause.js
 /**
 * Narrows a `Reason` to `Fail`.
 *
@@ -6660,6 +6632,29 @@ const isSuccess = exitIsSuccess;
 */
 const isFailReason = isFailReason$1;
 /**
+* Creates a `Cause` containing a single `Die` reason with the
+* given defect.
+*
+* **When to use**
+*
+* Use to construct a cause from an untyped defect or unexpected thrown value.
+*
+* **Example** (Creating a die cause)
+*
+* ```ts import.meta.vitest
+* import { Cause } from "effect"
+*
+* Cause.die("Unexpected") // => Cause.fromReasons([Cause.makeDieReason("Unexpected")])
+* ```
+*
+* @see {@link fail} — for typed errors
+* @see {@link interrupt} — for fiber interruptions
+*
+* @category constructors
+* @since 2.0.0
+*/
+const die$1 = causeDie;
+/**
 * Transforms the typed error values inside a `Cause` using the
 * provided function. Only `Fail` reasons are affected; `Die` and `Interrupt`
 * reasons pass through unchanged.
@@ -6693,7 +6688,7 @@ const isFailReason = isFailReason$1;
 */
 const map$1 = causeMap;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/dateTime.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/dateTime.js
 /** @internal */
 const TypeId$8 = "~effect/DateTime";
 /** @internal */
@@ -6723,7 +6718,7 @@ const ProtoTimeZone = {
 /** @internal */
 const toDateUtc$1 = (self) => new Date(self.epochMilliseconds);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Effect.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Effect.js
 /**
 * Executes an effectful operation for each element in an `Iterable`.
 *
@@ -6816,6 +6811,96 @@ const forEach = forEach$1;
 */
 const succeed$1 = succeed$3;
 /**
+* Creates an `Effect` lazily, delaying construction until it is needed.
+*
+* **When to use**
+*
+* Use when you need to defer the evaluation of an effect until it is required.
+*
+* **Details**
+*
+* `suspend` takes a thunk that represents an effect and delays creating it
+* until the suspended effect is evaluated. This is useful for optimizing
+* expensive computations, managing circular dependencies such as recursive
+* functions, and helping TypeScript unify return types when branches construct
+* different effects. Any side effects or scoped captures inside the thunk are
+* re-executed on each invocation.
+*
+* **Example** (Lazily evaluating side effects)
+*
+* ```ts import.meta.vitest
+* import { Effect } from "effect"
+*
+* let i = 0
+*
+* const bad = Effect.succeed(i++)
+*
+* const good = Effect.suspend(() => Effect.succeed(i++))
+*
+* Effect.runSync(bad) // => 0
+* Effect.runSync(bad) // => 0
+*
+* Effect.runSync(good) // => 1
+* Effect.runSync(good) // => 2
+* ```
+*
+* **Example** (Suspending recursive Fibonacci evaluation)
+*
+* ```ts import.meta.vitest
+* import { Effect } from "effect"
+*
+* const blowsUp = (n: number): Effect.Effect<number> =>
+*   n < 2
+*     ? Effect.succeed(1)
+*     : Effect.zipWith(blowsUp(n - 1), blowsUp(n - 2), (a, b) => a + b)
+*
+* // console.log(Effect.runSync(blowsUp(32)))
+* // crash: JavaScript heap out of memory
+*
+* const allGood = (n: number): Effect.Effect<number> =>
+*   n < 2
+*     ? Effect.succeed(1)
+*     : Effect.zipWith(
+*         Effect.suspend(() => allGood(n - 1)),
+*         Effect.suspend(() => allGood(n - 2)),
+*         (a, b) => a + b
+*       )
+*
+* Effect.runSync(allGood(16)) // => 1597
+* ```
+*
+* **Example** (Helping TypeScript infer recursive effect types)
+*
+* ```ts import.meta.vitest
+* import { Effect } from "effect"
+*
+* //   Without suspend, TypeScript may struggle with type inference.
+* //   Inferred type:
+* //     (a: number, b: number) =>
+* //       Effect<never, Error, never> | Effect<number, never, never>
+* const withoutSuspend = (a: number, b: number) =>
+*   b === 0
+*     ? Effect.fail(new Error("Cannot divide by zero"))
+*     : Effect.succeed(a / b)
+*
+* //   Using suspend to unify return types.
+* //   Inferred type:
+* //     (a: number, b: number) => Effect<number, Error, never>
+* const withSuspend = (a: number, b: number) =>
+*   Effect.suspend(() =>
+*     b === 0
+*       ? Effect.fail(new Error("Cannot divide by zero"))
+*       : Effect.succeed(a / b)
+*   )
+*
+* Effect.runSync(withSuspend(6, 2)) // => 3
+* ```
+*
+* @category constructors
+* @since 2.0.0
+*/
+const suspend = suspend$1;
+/**
 * Creates an `Effect` that represents a synchronous side-effectful computation.
 *
 * **When to use**
@@ -7592,7 +7677,7 @@ const flatMapEager = flatMapEager$1;
 */
 const fnUntracedEager = fnUntracedEager$1;
 //#endregion
-//#region ../../node_modules/.pnpm/effect-oxlint@0.3.4_effect@4.0.0-rc.117/node_modules/effect-oxlint/dist/RuleContext.js
+//#region ../../node_modules/.pnpm/effect-oxlint@0.3.4_effect@4.0.0/node_modules/effect-oxlint/dist/RuleContext.js
 const RuleContextBase = Service()("effect-oxlint/RuleContext");
 /**
 * The lint rule context, provided as an Effect service.
@@ -7625,7 +7710,7 @@ service(RuleContext).pipe(map((ctx) => ctx.sourceCode));
 service(RuleContext).pipe(map((ctx) => ctx.sourceCode.text));
 service(RuleContext).pipe(map((ctx) => ctx.sourceCode.ast));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/BigDecimal.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/BigDecimal.js
 /**
 * Decimal numbers and arithmetic for cases where JavaScript `number` rounding
 * is not precise enough. A `BigDecimal` stores digits as a `bigint` plus a
@@ -7640,10 +7725,10 @@ const BigDecimalProto = {
 	[TypeId$7]: TypeId$7,
 	[symbol$1]() {
 		const normalized = normalize(this);
-		return combine(hash(normalized.value), number$1(normalized.scale));
+		return combine(string$1(String(normalized.value)), number$1(normalized.scale));
 	},
 	[symbol](that) {
-		return isBigDecimal(that) && equals(this, that);
+		return isBigDecimal(that) && compare(this, that) === 0;
 	},
 	toString() {
 		return `BigDecimal(${format(this)})`;
@@ -7723,13 +7808,7 @@ const make$8 = (value, scale) => {
 	o.scale = scale;
 	return o;
 };
-/**
-* Internal function used to create pre-normalized `BigDecimal`s.
-*
-* @internal
-*/
-const makeNormalizedUnsafe = (value, scale) => {
-	if (value !== bigint0 && value % bigint10 === bigint0) throw new RangeError("Value must be normalized");
+const makeNormalized = (value, scale) => {
 	const o = make$8(value, scale);
 	o.normalized = o;
 	return o;
@@ -7737,7 +7816,7 @@ const makeNormalizedUnsafe = (value, scale) => {
 const bigint0 = /*#__PURE__*/ BigInt(0);
 const bigint1 = /*#__PURE__*/ BigInt(1);
 const bigint10 = /*#__PURE__*/ BigInt(10);
-const zero = /*#__PURE__*/ makeNormalizedUnsafe(bigint0, 0);
+const zero = /*#__PURE__*/ makeNormalized(bigint0, 0);
 /**
 * Normalizes a given `BigDecimal` by removing trailing zeros.
 *
@@ -7768,13 +7847,9 @@ const normalize = (self) => {
 		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 = makeNormalizedUnsafe(value, scale);
+			let end = digits.length;
+			while (digits[end - 1] === "0") end--;
+			self.normalized = makeNormalized(BigInt(digits.slice(0, end)), self.scale - (digits.length - end));
 		}
 	}
 	return self.normalized;
@@ -7788,12 +7863,7 @@ const compareMagnitude = (self, that) => {
 	const exponentDifference = BigInt(selfDigits.length - thatDigits.length) - BigInt(self.scale) + BigInt(that.scale);
 	if (exponentDifference !== bigint0) return exponentDifference < bigint0 ? -1 : 1;
 	const length = Math.max(selfDigits.length, thatDigits.length);
-	for (let i = 0; i < length; i++) {
-		const selfDigit = i < selfDigits.length ? selfDigits.charCodeAt(i) : 48;
-		const thatDigit = i < thatDigits.length ? thatDigits.charCodeAt(i) : 48;
-		if (selfDigit !== thatDigit) return selfDigit < thatDigit ? -1 : 1;
-	}
-	return 0;
+	return String$4(selfDigits.padEnd(length, "0"), thatDigits.padEnd(length, "0"));
 };
 const compare = (self, that) => {
 	if (self.scale === that.scale) return compareBigInt(self.value, that.value);
@@ -7829,78 +7899,6 @@ const compare = (self, that) => {
 */
 const sign = (n) => n.value === bigint0 ? 0 : n.value < bigint0 ? -1 : 1;
 /**
-* Determines the absolute value of a given `BigDecimal`.
-*
-* **When to use**
-*
-* Use to remove the sign from a `BigDecimal` while preserving its magnitude.
-*
-* **Example** (Calculating absolute values)
-*
-* ```ts import.meta.vitest
-* import { BigDecimal } from "effect"
-*
-* BigDecimal.abs(BigDecimal.fromStringUnsafe("-5")) // => BigDecimal.fromBigInt(5n)
-* BigDecimal.abs(BigDecimal.fromStringUnsafe("0")) // => BigDecimal.fromBigInt(0n)
-* BigDecimal.abs(BigDecimal.fromStringUnsafe("5")) // => BigDecimal.fromBigInt(5n)
-* ```
-*
-* @category math
-* @since 2.0.0
-*/
-const abs = (n) => n.value < bigint0 ? make$8(-n.value, n.scale) : n;
-/**
-* Provides an `Equivalence` instance for `BigDecimal` that determines equality between BigDecimal values.
-*
-* **When to use**
-*
-* Use when comparing decimal values through APIs that accept an equivalence
-* relation.
-*
-* **Example** (Checking decimal equivalence)
-*
-* ```ts import.meta.vitest
-* import { BigDecimal } from "effect"
-*
-* const a = BigDecimal.fromStringUnsafe("1.50")
-* const b = BigDecimal.fromStringUnsafe("1.5")
-* const c = BigDecimal.fromStringUnsafe("2.0")
-*
-* BigDecimal.Equivalence(a, b) // => true
-* BigDecimal.Equivalence(a, c) // => false
-* ```
-*
-* @category instances
-* @since 2.0.0
-*/
-const Equivalence$1 = /*#__PURE__*/ make$14((self, that) => compare(self, that) === 0);
-/**
-* Checks whether two `BigDecimal`s are equal.
-*
-* **When to use**
-*
-* Use to compare two `BigDecimal` values for numeric equality.
-*
-* **Example** (Checking decimal equality)
-*
-* ```ts import.meta.vitest
-* import { BigDecimal } from "effect"
-*
-* const a = BigDecimal.fromStringUnsafe("1.5")
-* const b = BigDecimal.fromStringUnsafe("1.50")
-* const c = BigDecimal.fromStringUnsafe("2.0")
-*
-* BigDecimal.equals(a, b) // => true
-* BigDecimal.equals(a, c) // => false
-* ```
-*
-* @see {@link Equivalence} for passing decimal equality to APIs that require an `Equivalence`
-*
-* @category predicates
-* @since 2.0.0
-*/
-const equals = /*#__PURE__*/ dual(2, (self, that) => Equivalence$1(self, that));
-/**
 * Formats a `BigDecimal` as a string.
 *
 * **When to use**
@@ -7932,24 +7930,10 @@ const format = (n) => {
 	const normalized = normalize(n);
 	if (Math.abs(normalized.scale) >= 16) return toExponential(normalized);
 	const negative = normalized.value < bigint0;
-	const absolute = negative ? `${normalized.value}`.substring(1) : `${normalized.value}`;
-	let before;
-	let after;
-	if (normalized.scale >= absolute.length) {
-		before = "0";
-		after = "0".repeat(normalized.scale - absolute.length) + absolute;
-	} else {
-		const location = absolute.length - normalized.scale;
-		if (location > absolute.length) {
-			const zeros = location - absolute.length;
-			before = `${absolute}${"0".repeat(zeros)}`;
-			after = "";
-		} else {
-			after = absolute.slice(location);
-			before = absolute.slice(0, location);
-		}
-	}
-	const complete = after === "" ? before : `${before}.${after}`;
+	const absolute = `${negative ? -normalized.value : normalized.value}`;
+	const digits = normalized.scale > 0 ? absolute.padStart(normalized.scale + 1, "0") : absolute.padEnd(absolute.length - normalized.scale, "0");
+	const point = digits.length - normalized.scale;
+	const complete = normalized.scale > 0 ? `${digits.slice(0, point)}.${digits.slice(point)}` : digits;
 	return negative ? `-${complete}` : complete;
 };
 /**
@@ -7975,13 +7959,12 @@ const format = (n) => {
 const toExponential = (n) => {
 	if (isZero(n)) return "0e+0";
 	const normalized = normalize(n);
-	const digits = `${abs(normalized).value}`;
-	const head = digits.slice(0, 1);
-	const tail = digits.slice(1);
-	let output = `${isNegative(normalized) ? "-" : ""}${head}`;
-	if (tail !== "") output += `.${tail}`;
+	const digits = `${normalized.value}`;
+	const point = normalized.value < bigint0 ? 2 : 1;
+	const head = digits.slice(0, point);
+	const tail = digits.slice(point);
 	const exp = tail.length - normalized.scale;
-	return `${output}e${exp >= 0 ? "+" : ""}${exp}`;
+	return `${head}${tail === "" ? "" : `.${tail}`}e${exp >= 0 ? "+" : ""}${exp}`;
 };
 /**
 * Checks whether a given `BigDecimal` is `0`.
@@ -8003,29 +7986,15 @@ const toExponential = (n) => {
 * @since 2.0.0
 */
 const isZero = (n) => n.value === bigint0;
-/**
-* Checks whether a given `BigDecimal` is negative.
-*
-* **When to use**
-*
-* Use to test whether a `BigDecimal` is less than zero.
-*
-* **Example** (Checking negative decimals)
-*
-* ```ts import.meta.vitest
-* import { BigDecimal } from "effect"
-*
-* BigDecimal.isNegative(BigDecimal.fromStringUnsafe("-1")) // => true
-* BigDecimal.isNegative(BigDecimal.fromStringUnsafe("0")) // => false
-* BigDecimal.isNegative(BigDecimal.fromStringUnsafe("1")) // => false
-* ```
-*
-* @category predicates
-* @since 2.0.0
-*/
-const isNegative = (n) => n.value < bigint0;
+const alphabet = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+const codes = /*#__PURE__*/ (/* @__PURE__ */ new Uint8Array(123)).fill(255);
+for (let i = 0; i < 64; i++) codes[/*#__PURE__*/ alphabet.charCodeAt(i)] = i;
+codes[/*#__PURE__*/ "=".charCodeAt(0)] = 0;
+({ ...BaseProto });
+({ ...BaseProto });
+({ ...PipeInspectableProto });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/schema/annotations.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/schema/annotations.js
 /** @internal */
 function resolve$1(ast) {
 	return ast.checks ? ast.checks[ast.checks.length - 1].annotations : ast.annotations;
@@ -8041,7 +8010,7 @@ const getExpected = /*#__PURE__*/ memoize((ast) => {
 	return ast.getExpected(getExpected);
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/schema/parser.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/schema/parser.js
 /** @internal */
 const missing = /*#__PURE__*/ Symbol();
 /** @internal */
@@ -8055,7 +8024,7 @@ const toOption = (value) => value === missing ? none() : some$1(value);
 /** @internal */
 const fromOptionExit = (option) => option._tag === "None" ? missingExit : succeed(option.value);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/SchemaIssue.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/SchemaIssue.js
 /**
 * Describes problems found while decoding, encoding, or checking data with
 * schemas.
@@ -8067,7 +8036,7 @@ const fromOptionExit = (option) => option._tag === "None" ? missingExit : succee
 *
 * @since 4.0.0
 */
-const TypeId$6 = "~effect/SchemaIssue/Issue";
+const TypeId$4 = "~effect/SchemaIssue/Issue";
 /**
 * Returns `true` if the given value is an {@link Issue}.
 *
@@ -8097,7 +8066,7 @@ const TypeId$6 = "~effect/SchemaIssue/Issue";
 * @since 4.0.0
 */
 function isIssue(u) {
-	return hasProperty(u, TypeId$6) && u[TypeId$6] === TypeId$6;
+	return hasProperty(u, TypeId$4) && u[TypeId$4] === TypeId$4;
 }
 /**
 * Returns `true` when an issue contains an input reported by the schema parser.
@@ -8132,7 +8101,7 @@ function hasInput(issue) {
 	return Object.hasOwn(issue, "input");
 }
 var IssueNodeImpl = class {
-	[TypeId$6] = TypeId$6;
+	[TypeId$4] = TypeId$4;
 	constructor(input, options) {
 		if (options?.reportInput === true && input !== missing) this.input = input;
 	}
@@ -8536,7 +8505,7 @@ function findMessage(issue) {
 	if (typeof message === "string") return message;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/schema/cause.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/schema/cause.js
 /** @internal */
 function getSchemaIssue(cause) {
 	let issue;
@@ -8546,8 +8515,14 @@ function getSchemaIssue(cause) {
 	}
 	return issue;
 }
+/** @internal */
+function getSchemaIssueOrThrow(cause, message) {
+	const issue = getSchemaIssue(cause);
+	if (issue === void 0) throw new Error(message, { cause });
+	return issue;
+}
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/SchemaGetter.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/SchemaGetter.js
 const makeGetter = (fields) => Object.assign(Object.create(Prototype$1), fields);
 /**
 * Creates a getter that applies a pure function to present values.
@@ -8652,7 +8627,7 @@ function Number$3() {
 	return transform$1(globalThis.Number);
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/SchemaTransformation.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/SchemaTransformation.js
 /**
 * Constructs schema middleware from its decode and encode functions.
 *
@@ -8672,7 +8647,7 @@ const Middleware = class extends Class$1 {
 		return new Middleware(this.encode, this.decode);
 	}
 };
-const TypeId$5 = "~effect/SchemaTransformation/Transformation";
+const TypeId$3 = "~effect/SchemaTransformation/Transformation";
 /**
 * Constructs a bidirectional schema transformation from its decode and encode getters.
 *
@@ -8680,7 +8655,7 @@ const TypeId$5 = "~effect/SchemaTransformation/Transformation";
 * @since 4.0.0
 */
 const Transformation = class extends Class$1 {
-	[TypeId$5] = TypeId$5;
+	[TypeId$3] = TypeId$3;
 	_tag = "Transformation";
 	decode;
 	encode;
@@ -8728,7 +8703,7 @@ const Transformation = class extends Class$1 {
 */
 const numberFromString = /*#__PURE__*/ new Transformation(/*#__PURE__*/ Number$3(), /*#__PURE__*/ String$3());
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/SchemaAST.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/SchemaAST.js
 /**
 * Represents Effect schemas as runtime trees.
 *
@@ -8838,9 +8813,28 @@ const Link = class {
 };
 /** @internal */
 const defaultParseOptions = {};
-const TypeId$4 = "~effect/Schema";
+/**
+* Constructs a {@link Context}.
+*
+* @category constructors
+* @since 4.0.0
+*/
+const Context = class {
+	isOptional;
+	isMutable;
+	/** Used for constructor default values (e.g. `withConstructorDefault` API) */
+	constructorDefault;
+	annotations;
+	constructor(isOptional, isMutable, constructorDefault = void 0, annotations = void 0) {
+		this.isOptional = isOptional;
+		this.isMutable = isMutable;
+		this.constructorDefault = constructorDefault;
+		this.annotations = annotations;
+	}
+};
+const TypeId$2 = "~effect/Schema";
 var ASTNodeImpl = class {
-	[TypeId$4] = TypeId$4;
+	[TypeId$2] = TypeId$2;
 	annotations;
 	checks;
 	encoding;
@@ -9106,19 +9100,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$1(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$1(new Composite(ast, [issue], input, options));
 			}
+			if (state.issues) return fail$1(new Composite(ast, state.issues, input, options));
+			return succeed(state.output);
+		};
+		const parse = (input, options) => {
 			const len = input.length;
 			const state = {
 				ast,
@@ -9136,18 +9131,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$1(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$1(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$1(new Composite(ast, state.issues, input, options));
-			return state.output;
-		});
+		};
 	}
 	_rebuild(recur, checks, encodingChecks) {
 		const elements = mapOrSame(this.elements, recur);
@@ -9219,7 +9230,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 [];
 		}
@@ -9296,56 +9307,15 @@ const Objects = class extends ASTNodeImpl {
 		this.propertySignatures = propertySignatures;
 		this.indexSignatures = indexSignatures;
 		this.encodingChecks = encodingChecks;
-		const seen = /* @__PURE__ */ 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)`);
 	}
 	/** @internal */
 	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(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) => ({
@@ -9361,69 +9331,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$1(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(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$1(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$1(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$1(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();
-				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$1(new Composite(ast, state.issues, input, options));
-			return out;
-		});
-		if (indexCount) return fallback;
+				else if (parseIndexes) {
+					const keyPairs = empty();
+					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$1(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) => {
@@ -9436,7 +9439,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$1(new InvalidType(ast, input, options));
 			const props = compileMembers();
 			const record = input;
@@ -9629,8 +9632,10 @@ function collectSentinels(ast) {
 }
 const candidateIndexCache = /*#__PURE__*/ new WeakMap();
 const emptyCandidates = /*#__PURE__*/ 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) {
+/** @internal */
+function getCandidateIndex(types) {
 	let index = candidateIndexCache.get(types);
 	if (index) return index;
 	let bySentinel;
@@ -9638,19 +9643,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 ??= /* @__PURE__ */ 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 ??= /* @__PURE__ */ 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 ??= /* @__PURE__ */ new Map();
@@ -9669,18 +9674,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 = /* @__PURE__ */ 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;
 		};
@@ -9688,9 +9696,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;
@@ -9698,7 +9706,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;
 				}
@@ -9720,29 +9728,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;
-	};
-}
-/**
-* The goal is to reduce the number of a union members that will be checked.
-* This is useful to reduce the number of issues that will be returned.
-*
-* @internal
-*/
-function getCandidates(input, types, isConstructor = false) {
-	return getIndex(types)(input, isConstructor);
-}
 /**
 * Constructs a {@link Union}.
 *
@@ -9763,34 +9757,20 @@ const Union$1 = class extends ASTNodeImpl {
 	/** @internal */
 	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$1(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$1(new AnyOf(ast, state.issues ?? [], input, options));
-			}
-			return flatMapEager(eff, (_) => {
-				if (state.out === sameExit) return succeed$1(input);
-				if (state.out) return state.out;
-				return fail$1(new AnyOf(ast, state.issues ?? [], input, options));
-			});
+			return parseUnionCandidates(ast, parser, candidates, input, options);
 		};
 	}
 	_rebuild(recur, checks, encodingChecks) {
@@ -9841,11 +9821,38 @@ function failSingleUnionCandidate(ast, cause, input, options) {
 	if (!issue) return failCause(cause);
 	return fail$2(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$1(new AnyOf(ast, state.issues ?? [], input, options));
+	}
+	return resumeUnion(eff, state);
+}
+function resumeUnion(eff, state) {
+	return flatMapEager(eff, (_) => {
+		if (state.out === sameExit) return succeed$1(state.input);
+		if (state.out) return state.out;
+		return fail$1(new AnyOf(state.ast, state.issues ?? [], state.input, state.options));
+	});
+}
 const parseUnion = /*#__PURE__*/ 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;
@@ -9853,11 +9860,11 @@ const parseUnion = /*#__PURE__*/ iterateEager()({
 			else s.issues = [issue];
 		} else {
 			if (s.out && s.successes) {
-				s.successes.push(candidate);
+				s.successes.push(s.ast.types[i]);
 				return fail$2(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;
 		}
 	}
@@ -9972,9 +9979,9 @@ const numberToJson = /*#__PURE__*/ new Link(/*#__PURE__*/ new Union$1([/* @__PUR
 * Arbitrary metadata preserves both `regExp.source` and `regExp.flags`.
 * Implementations that cannot consume all flags may still use the source as a
 * generation hint because the Schema filter validates every generated value.
-* JSON Schema has no way to carry JavaScript regular-expression flags. The
-* generated `pattern` contains the source only, so validation can differ when
-* the RegExp uses flags or relies on JavaScript's non-Unicode behavior.
+* JSON Schema has no way to carry JavaScript regular-expression flags. Unless
+* annotations provide `toJsonSchema`, the RegExp constraint is omitted from
+* JSON Schema export.
 *
 * **Example** (Validating an email pattern)
 *
@@ -9991,51 +9998,71 @@ const numberToJson = /*#__PURE__*/ new Link(/*#__PURE__*/ new Union$1([/* @__PUR
 * @since 4.0.0
 */
 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 = /*#__PURE__*/ 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;
+}
+/** @internal */
+function getContextOwner(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;
 }
 /** @internal */
 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 });
+}
+/** @internal */
+function replaceContext(ast, context) {
+	if (ast.context === context) return ast;
+	const owner = getContextOwner(ast);
+	if (owner.context === context && owner.encoding === ast.encoding) return owner;
+	return copy(ast, { context });
 }
 /** @internal */
 function getLastEncoding(ast) {
 	return ast.encoding ? getLastEncoding(ast.encoding[ast.encoding.length - 1].to) : ast;
 }
 /** @internal */
+function annotate(ast, annotations) {
+	if (ast.checks) {
+		const last = ast.checks[ast.checks.length - 1];
+		return replaceChecks(ast, append(ast.checks.slice(0, -1), last.annotate(annotations)));
+	}
+	return copy(ast, { annotations: {
+		...ast.annotations,
+		...annotations
+	} });
+}
+/** @internal */
 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 });
 }
 /** @internal */
 function appendChecks(ast, checks) {
@@ -10064,15 +10091,25 @@ function applyToSelfOrLastLinkEncodingIdempotent(f, options) {
 	return memoizeIdempotent(out);
 }
 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;
+}
+/** @internal */
+function annotateKey(ast, annotations) {
+	return replaceContext(ast, ast.context ? new Context(ast.context.isOptional, ast.context.isMutable, ast.context.constructorDefault, {
+		...ast.context.annotations,
+		...annotations
+	}) : new Context(false, false, void 0, annotations));
 }
 /**
 * Returns `true` if the AST node represents an optional property.
@@ -10101,6 +10138,16 @@ 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;
+}
 /**
 * Strips all encoding transformations from an AST, returning the decoded
 * (type-level) representation.
@@ -10127,15 +10174,17 @@ function extractStructuralChecks(checks) {
 * @since 4.0.0
 */
 const toType = /*#__PURE__*/ memoizeIdempotent((ast) => {
-	if (ast.encoding) return toType(replaceEncoding(ast, void 0));
-	const out = ast;
-	const type = out.recur?.(toType) ?? 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(owner);
+		return type === owner && ast.encoding === void 0 ? ast : replaceContext(type, ast.context);
+	}
+	const type = "recur" in ast ? ast.recur(toType) : 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;
@@ -10198,8 +10247,12 @@ function flipEncoding(ast, encoding) {
 */
 const flip = /*#__PURE__*/ 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;
 });
 /** @internal */
 function containsUndefined(ast) {
@@ -10275,7 +10328,7 @@ function getConstructorDescriptor(ast) {
 	return isFunction$3(getDescriptor) ? getDescriptor(ast.typeParameters) : void 0;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/schema/interpreter.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/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) => {
@@ -10409,6 +10462,10 @@ function compile(ast, compile, compileField, base, specialize) {
 		});
 	};
 }
+//#endregion
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/schema/compilerRegistry.js
+/** @internal */
+const invalid = /*#__PURE__*/ Symbol();
 const cache = /*#__PURE__*/ new WeakMap();
 const decodeChild = (ast) => resolve(ast).parser;
 const makeChild = (ast) => resolve(ast).makeEffect;
@@ -10436,6 +10493,102 @@ function resolve(ast) {
 	cache.set(ast, entry);
 	return entry;
 }
+//#endregion
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/SchemaParser.js
+/**
+* Runs schemas against real values.
+*
+* Schema parsers construct values from schema input, check whether a value
+* matches a schema, decode encoded input, and encode decoded values back to
+* their external form. This module exposes those operations through several
+* result styles, including `Effect`, `Promise`, `Exit`, `Option`, `Result`, and
+* synchronous functions that throw. It also contains the lower-level runner that
+* walks a schema AST and reports schema failures as `SchemaIssue.Issue` values.
+*
+* @since 4.0.0
+*/
+/**
+* Creates an effectful maker for the schema's decoded type side.
+*
+* **When to use**
+*
+* Use to construct decoded schema values in `Effect` while preserving
+* construction failures as `SchemaIssue.Issue` values in the error channel.
+*
+* **Details**
+*
+* The returned function accepts constructor input, applies constructor defaults,
+* runs type-side validation unless checks are disabled, and fails with a
+* `SchemaIssue.Issue` when construction fails.
+*
+* @category constructors
+* @since 4.0.0
+*/
+function makeEffect(schema) {
+	const ast = schema.ast;
+	let parser;
+	return (input, options) => {
+		return (parser ??= runWithCompiler(constructorCompiler, toType(ast)))(input, options?.disableChecks ? options?.parseOptions ? {
+			...options.parseOptions,
+			disableChecks: true
+		} : { disableChecks: true } : options?.parseOptions);
+	};
+}
+/**
+* Creates a synchronous maker that returns `Option.some` with the constructed
+* value on success, or `Option.none` when construction fails with schema issues.
+*
+* **When to use**
+*
+* Use when you need to validate schema constructor input and only care whether
+* construction succeeds, without exposing `SchemaIssue.Issue` details.
+*
+* **Gotchas**
+*
+* Only causes made entirely of schema issues are converted to `Option.none`.
+* Causes that contain defects, interruptions, or asynchronous work at this
+* synchronous boundary throw an `Error` whose cause is the underlying `Cause`.
+*
+* @category constructors
+* @since 4.0.0
+*/
+function makeOption(schema) {
+	const parser = makeEffect(schema);
+	return (input, options) => {
+		const exit = runSyncExit(parser(input, options));
+		if (isSuccess(exit)) return some$1(exit.value);
+		getSchemaIssueOrThrow(exit.cause, "Option adapter can only return none for schema issues");
+		return none();
+	};
+}
+/**
+* Creates a synchronous maker for the schema's decoded type side.
+*
+* **When to use**
+*
+* Use to construct decoded schema values synchronously when invalid input
+* should throw an `Error` whose cause is `SchemaIssue.Issue`.
+*
+* **Details**
+*
+* The returned function constructs a value from constructor input and throws an
+* `Error` with the `SchemaIssue.Issue` in its `cause` when construction fails.
+* Schema validation failures use the generic message `"Schema validation failed"`.
+* Format the `cause` explicitly with `SchemaIssue.makeFormatterDefault()` when
+* human-readable details are needed.
+*
+* **Gotchas**
+*
+* Causes that contain defects, interruptions, or asynchronous work at this
+* synchronous boundary throw an `Error` whose cause is the underlying `Cause`,
+* instead of being converted to a schema validation error.
+*
+* @category constructors
+* @since 4.0.0
+*/
+function make$5(schema) {
+	return makeConstructorSync(toType(schema.ast));
+}
 /**
 * Creates an effectful decoder for `unknown` input.
 *
@@ -10473,6 +10626,11 @@ const getValue = (value) => {
 function run(ast) {
 	return runWithCompiler(normalCompiler, ast);
 }
+function parserResult(result, input) {
+	if (result === sameExit) return succeed$1(input);
+	if (!effectIsExit(result)) return flatMapEager(result, getValue);
+	return result[args] === missing ? getValue(missing) : result;
+}
 function runWithCompiler(compiler, ast) {
 	let parser;
 	return (input, options) => {
@@ -10482,16 +10640,100 @@ function runWithCompiler(compiler, ast) {
 		return result[args] === missing ? getValue(missing) : result;
 	};
 }
+function runSync(effect, message) {
+	const exit = runSyncExit(effect);
+	if (isSuccess(exit)) return exit.value;
+	const issue = getSchemaIssueOrThrow(exit.cause, message);
+	throw new Error("Schema validation failed", { cause: issue });
+}
+function makeConstructorSync(ast) {
+	let entry;
+	let parser;
+	return (input, options) => {
+		entry ??= resolve(ast);
+		const parseOptions = options?.disableChecks ? options.parseOptions ? {
+			...options.parseOptions,
+			disableChecks: true
+		} : { disableChecks: true } : options?.parseOptions ?? defaultParseOptions;
+		const make = entry.make;
+		if (make !== void 0 && input !== missing) {
+			let output;
+			try {
+				output = make(input, parseOptions);
+			} catch (error) {
+				getSchemaIssueOrThrow(die$1(error), "Constructor adapter can only throw schema issues");
+				throw error;
+			}
+			if (output !== invalid && output !== missing) return output;
+		}
+		return runSync(parserResult((parser ??= entry.makeEffect)(input, parseOptions), input), "Constructor adapter can only throw schema issues");
+	};
+}
 const normalCompiler = (ast) => resolve(ast).parser;
+const constructorCompiler = (ast) => resolve(ast).makeEffect;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/internal/schemaError.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/schema/make.js
+/** @internal */
+const TypeId$1 = "~effect/Schema/Schema";
+const RebuildOptions = /*#__PURE__*/ Symbol();
+const SchemaProto = {
+	[TypeId$1]: TypeId$1,
+	get make() {
+		const value = make$5(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);
+	},
+	annotate(annotations) {
+		return this.rebuild(annotate(this.ast, annotations));
+	},
+	annotateKey(annotations) {
+		return this.rebuild(annotateKey(this.ast, annotations));
+	},
+	check(...checks) {
+		return this.rebuild(appendChecks(this.ast, checks));
+	},
+	rebuild(ast) {
+		return make$4(ast, this[RebuildOptions]);
+	}
+};
+/** @internal */
+function make$4(ast, options) {
+	function Schema() {}
+	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;
+	return self;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/effect@4.0.0/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";
 }
-({ ...BaseProto });
-({ ...BaseProto });
-({ ...PipeInspectableProto });
 /**
 * Error thrown or returned when schema decoding or encoding fails.
 *
@@ -10688,7 +10930,7 @@ globalThis.FormData;
 globalThis.URLSearchParams;
 globalThis.Uint8Array;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/MutableRef.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/MutableRef.js
 const TypeId = "~effect/MutableRef";
 const MutableRefProto = {
 	[TypeId]: TypeId,
@@ -10738,7 +10980,7 @@ const make$2 = (value) => {
 	return ref;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0-rc.117/node_modules/effect/dist/Ref.js
+//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Ref.js
 /**
 * Stores fiber-safe mutable state inside Effect programs.
 *
@@ -10881,7 +11123,7 @@ const update = /*#__PURE__*/ dual(2, (self, f) => sync(() => {
 	self.ref.current = f(self.ref.current);
 }));
 //#endregion
-//#region ../../node_modules/.pnpm/effect-oxlint@0.3.4_effect@4.0.0-rc.117/node_modules/effect-oxlint/dist/index.js
+//#region ../../node_modules/.pnpm/effect-oxlint@0.3.4_effect@4.0.0/node_modules/effect-oxlint/dist/index.js
 var AST_exports = /* @__PURE__ */ __exportAll({
 	calleeIdentifier: () => calleeIdentifier,
 	calleeName: () => calleeName,
@@ -11860,6 +12102,8 @@ const resolveImportedPath = (references, node) => gen$2(function* () {
 });
 const foldkitNamespaceBySource = {
 	"foldkit/command": "Command",
+	"foldkit/experimental": "Experimental",
+	"foldkit/experimental/query": "Query",
 	"foldkit/html": "Html",
 	"foldkit/managedResource": "ManagedResource",
 	"foldkit/message": "Message",
@@ -12119,20 +12363,32 @@ const messageCases = (node, bindings, references) => {
 	});
 };
 const hasMessagePayloadProperty = (fields) => fields.properties.some((property) => property.type === "Property" && (isIdentifier(property.key, "message") || isStringLiteral(property.key) && property.key.value === "message"));
-const containsImportedMessageReference = (node, references, visited) => {
+const isLocalQueryMessageReference = (node, references) => exists(staticMemberPath(node), (memberPath) => {
+	const [memberName, extraMember] = memberPath.members;
+	if (memberName !== "Message" || extraMember !== void 0) return false;
+	return exists(resolvedVariable(references, memberPath.root), (variable) => variable.defs.some((definition) => {
+		if (definition.type !== "Variable" || !isVariableDeclarator$1(definition.node) || !isCallExpression$1(definition.node.init)) return false;
+		return exists(resolveFoldkitApiPath(references, definition.node.init.callee), (apiPath) => {
+			const apiName = apiPath.join(".");
+			return apiName === "Query.define" || apiName === "Experimental.Query.define";
+		});
+	}));
+});
+const containsMessageReference = (node, references, visited) => {
 	if (typeof node !== "object" || node === null || visited.has(node)) return false;
 	visited.add(node);
+	if (isLocalQueryMessageReference(node, references)) return true;
 	if (exists(resolveImportedPath(references, node), (path) => {
 		const [messageName] = path.members.slice(-1);
 		return messageName === "Message";
 	})) return true;
-	return Object.entries(node).some(([key, value]) => key !== "parent" && (Array.isArray(value) ? value.some((element) => containsImportedMessageReference(element, references, visited)) : containsImportedMessageReference(value, references, visited)));
+	return Object.entries(node).some(([key, value]) => key !== "parent" && (Array.isArray(value) ? value.some((element) => containsMessageReference(element, references, visited)) : containsMessageReference(value, references, visited)));
 };
 const hasSubmodelMessagePayload = (fields, references) => {
 	if (references === void 0) return hasMessagePayloadProperty(fields);
 	return fields.properties.some((property) => {
 		if (property.type !== "Property" || !(isIdentifier(property.key, "message") || isStringLiteral(property.key) && property.key.value === "message")) return false;
-		return containsImportedMessageReference(property.value, references, /* @__PURE__ */ new WeakSet());
+		return containsMessageReference(property.value, references, /* @__PURE__ */ new WeakSet());
 	});
 };
 //#endregion