@deslop/coding-standards 0.1.912 → 0.1.1014

package/dist/{MutableRef-NhSl8G9M.mjs → MutableRef-CzOzKHjT.mjs}

@@ -1,4 +1,4 @@
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Pipeable.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/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(...)`.
@@ -9,6 +9,7 @@
 * to compose transformations, validations, and effectful operations while
 * keeping the original value as the starting point of the pipeline.
 *
+* @stability stable
 * @since 2.0.0
 */
 /**
@@ -46,6 +47,7 @@
 * result // => 21
 * ```
 *
+* @stability stable
 * @category combinators
 * @since 2.0.0
 */
@@ -76,6 +78,7 @@ const pipeArguments = (self, args) => {
 * Use when classes or object prototypes can reuse this value when they need the
 * standard pipe implementation backed by `pipeArguments`.
 *
+* @stability stable
 * @category prototypes
 * @since 3.15.0
 */
@@ -91,6 +94,7 @@ const Prototype = { pipe() {
 * Use when you need to define a class that supports Effect-style method
 * chaining through `.pipe(...)`.
 *
+* @stability stable
 * @category constructors
 * @since 3.15.0
 */
@@ -100,7 +104,7 @@ const Class$1 = /*#__PURE__*/ function() {
 	return PipeableBase;
 }();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Function.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Function.js
 /**
 * Creates a function that can be called in data-first style or data-last
 * (`pipe`-friendly) style.
@@ -161,6 +165,7 @@ const Class$1 = /*#__PURE__*/ function() {
 * pipe(2, sum(3)) // => 5
 * ```
 *
+* @stability stable
 * @category combinators
 * @since 2.0.0
 */
@@ -207,6 +212,7 @@ const dual = function(arity, body) {
 * identity(5) // => 5
 * ```
 *
+* @stability stable
 * @category combinators
 * @since 2.0.0
 */
@@ -230,6 +236,7 @@ const identity = (a) => a;
 * constNull() // => null
 * ```
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -249,6 +256,7 @@ const constant = (value) => () => value;
 * Function.constTrue() // => true
 * ```
 *
+* @stability stable
 * @category constants
 * @since 2.0.0
 */
@@ -268,6 +276,7 @@ const constTrue = /*#__PURE__*/ constant(true);
 * Function.constFalse() // => false
 * ```
 *
+* @stability stable
 * @category constants
 * @since 2.0.0
 */
@@ -287,6 +296,7 @@ const constFalse = /*#__PURE__*/ constant(false);
 * Function.constUndefined() // => undefined
 * ```
 *
+* @stability stable
 * @category constants
 * @since 2.0.0
 */
@@ -307,6 +317,7 @@ const constUndefined = /*#__PURE__*/ constant(void 0);
 * Function.constVoid() // => undefined
 * ```
 *
+* @stability stable
 * @category constants
 * @since 2.0.0
 */
@@ -336,6 +347,7 @@ function pipe(a, ...args) {
 * mutated after its first call, later calls still return the cached result for
 * that reference.
 *
+* @stability stable
 * @category caching
 * @since 4.0.0
 */
@@ -371,6 +383,7 @@ function memoize(f) {
 * different value, this memoization changes that behavior.
 *
 * @see {@link memoize} for memoizing functions without an idempotence requirement
+* @stability stable
 * @category caching
 * @since 4.0.0
 */
@@ -386,7 +399,7 @@ function memoizeIdempotent(f) {
 	};
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/equal.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/equal.js
 /** @internal */
 const getAllObjectKeys = (obj) => {
 	const keys = new Set(Reflect.ownKeys(obj));
@@ -407,7 +420,7 @@ 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
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/hash.js
 /**
 * Back-edge count used to avoid caching entry-point-dependent hashes.
 *
@@ -419,7 +432,7 @@ const addBackEdge = () => {
 	backEdges++;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Predicate.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Predicate.js
 /**
 * Defines runtime checks for values.
 *
@@ -429,6 +442,7 @@ const addBackEdge = () => {
 * property and tag checks, tuple and struct checks, boolean combinators, and
 * helpers for composing predicates and refinements.
 *
+* @stability stable
 * @since 2.0.0
 */
 /**
@@ -458,6 +472,7 @@ const addBackEdge = () => {
 * @see {@link isNumber}
 * @see {@link isBoolean}
 * @see {@link Refinement}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -490,6 +505,7 @@ function isString(input) {
 *
 * @see {@link isBigInt}
 * @see {@link isString}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -522,6 +538,7 @@ function isNumber(input) {
 *
 * @see {@link isString}
 * @see {@link isNumber}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -553,6 +570,7 @@ function isBoolean(input) {
 * ```
 *
 * @see {@link isPropertyKey}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -587,6 +605,7 @@ function isSymbol(input) {
 * @see {@link isString}
 * @see {@link isNumber}
 * @see {@link isSymbol}
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -618,6 +637,7 @@ function isPropertyKey(u) {
 * ```
 *
 * @see {@link isObjectKeyword}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -648,6 +668,7 @@ function isFunction(input) {
 *
 * @see {@link isNotUndefined}
 * @see {@link isNullish}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -677,6 +698,7 @@ function isUndefined(input) {
 *
 * @see {@link isUndefined}
 * @see {@link isNotNullish}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -706,6 +728,7 @@ function isNotUndefined(input) {
 *
 * @see {@link isNull}
 * @see {@link isNotNullish}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -735,6 +758,7 @@ function isNotNull(input) {
 * @see {@link isNotNullish}
 * @see {@link isUndefined}
 * @see {@link isNull}
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -765,6 +789,7 @@ function isNullish(input) {
 * @see {@link isNullish}
 * @see {@link isNotNull}
 * @see {@link isNotUndefined}
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -787,6 +812,7 @@ function isNotNullish(input) {
 * ```
 *
 * @see {@link isNever}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -818,6 +844,7 @@ function isUnknown(_) {
 *
 * @see {@link isObjectOrArray}
 * @see {@link isReadonlyObject}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -850,6 +877,7 @@ function isObject(input) {
 * ```
 *
 * @see {@link isObject}
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -879,6 +907,7 @@ function isReadonlyObject(input) {
 *
 * @see {@link isObject}
 * @see {@link isObjectOrArray}
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -913,6 +942,7 @@ function isObjectKeyword(input) {
 *
 * @see {@link isTagged}
 * @see {@link isObjectKeyword}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -940,6 +970,7 @@ const hasProperty = /*#__PURE__*/ dual(2, (self, property) => isObjectKeyword(se
 * ```
 *
 * @see {@link hasProperty}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -966,6 +997,7 @@ const isTagged = /*#__PURE__*/ dual(2, (self, tag) => hasProperty(self, "_tag")
 * ```
 *
 * @see {@link isUnknown}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -995,6 +1027,7 @@ function isError(input) {
 *
 * @see {@link isSet}
 * @see {@link isMap}
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -1002,7 +1035,7 @@ function isIterable(input) {
 	return hasProperty(input, Symbol.iterator) || isString(input);
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Hash.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/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
@@ -1012,6 +1045,7 @@ function isIterable(input) {
 * reference-based hashes, plus functions for combining and optimizing numeric
 * hash values.
 *
+* @stability stable
 * @since 2.0.0
 */
 /**
@@ -1026,6 +1060,7 @@ function isIterable(input) {
 * @see {@link isHash} for checking whether a value implements `Hash`
 * @see {@link hash} for computing hash values
 *
+* @stability stable
 * @category symbols
 * @since 2.0.0
 */
@@ -1062,6 +1097,7 @@ const symbol$1 = "~effect/Hash";
 * Hash.hash([1, 2, 3]) === Hash.hash([1, 2, 3]) // => true
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1130,6 +1166,7 @@ const hash = (self) => {
 * typeof Hash.random(obj2) // => "number"
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1171,6 +1208,7 @@ const mix = (h) => {
 * @see {@link hash} for computing hash values from arbitrary inputs
 * @see {@link structureKeys} for hashing selected object fields without manual combination
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1195,6 +1233,7 @@ const combine = /*#__PURE__*/ dual(2, (self, b) => mix(Math.imul(self, 265443576
 * Hash.optimize(1234567890) // => 160826066
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1224,6 +1263,7 @@ const float64 = /*#__PURE__*/ new DataView(/*#__PURE__*/ new ArrayBuffer(8));
 * Hash.number(100) === Hash.number(100) // => true
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1258,6 +1298,7 @@ const number = (n) => {
 * Hash.string("test") === Hash.string("test") // => true
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1297,6 +1338,7 @@ const string = (str) => {
 * hash1 === hash3 // => true
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1332,6 +1374,7 @@ const structureKeys = (o, keys) => {
 * Hash.structure(obj1) === Hash.structure(obj3) // => true
 * ```
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1372,6 +1415,7 @@ const unordered = (seed, f) => (iter) => {
 *
 * @see {@link hash} for the general-purpose hash dispatcher
 *
+* @stability stable
 * @category hashing
 * @since 2.0.0
 */
@@ -1387,7 +1431,7 @@ const randomHashCache = /*#__PURE__*/ new WeakMap();
 const hashCache = /*#__PURE__*/ new WeakMap();
 const visitedObjects = /*#__PURE__*/ new WeakSet();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Equal.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Equal.js
 /**
 * Defines the unique string identifier for the `Equal` interface.
 *
@@ -1423,6 +1467,7 @@ const visitedObjects = /*#__PURE__*/ new WeakSet();
 *
 * @see {@link Equal} — the interface that uses this symbol
 * @see {@link isEqual} — type guard for `Equal` implementors
+* @stability stable
 * @category symbols
 * @since 2.0.0
 */
@@ -1510,11 +1555,13 @@ function compareRecords(self, that) {
 }
 function compareHashed(self, that, hashOf, equivalent) {
 	const groups = /* @__PURE__ */ new Map();
+	let remaining = 0;
 	for (const item of that) {
 		const h = hashOf(item);
 		const group = groups.get(h);
 		if (group) group.push(item);
 		else groups.set(h, [item]);
+		remaining++;
 	}
 	outer: for (const item of self) {
 		const group = groups.get(hashOf(item));
@@ -1522,12 +1569,13 @@ function compareHashed(self, that, hashOf, equivalent) {
 			for (let i = 0; i < group.length; i++) if (equivalent(item, group[i])) {
 				group[i] = group[group.length - 1];
 				group.pop();
+				remaining--;
 				continue outer;
 			}
 		}
 		return false;
 	}
-	return true;
+	return remaining === 0;
 }
 const entryHash = (entry) => hash(entry[0]);
 const equalEntries = (self, that) => compareBoth(self[0], that[0]) && compareBoth(self[1], that[1]);
@@ -1568,6 +1616,7 @@ const equalEntries = (self, that) => compareBoth(self[0], that[0]) && compareBot
 *
 * @see {@link Equal} — the interface being checked
 * @see {@link symbol} — the property key that signals `Equal` support
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -1595,6 +1644,7 @@ const isEqual = (u) => hasProperty(u, symbol);
 * ```
 *
 * @see {@link equals} — the underlying comparison function
+* @stability stable
 * @category instances
 * @since 4.0.0
 */
@@ -1637,6 +1687,7 @@ const asEquivalence = () => equals;
 *
 * @see {@link byReference} — safer alternative that creates a proxy
 * @see {@link equals} — the comparison function affected by this opt-out
+* @stability stable
 * @category unsafe
 * @since 4.0.0
 */
@@ -1645,7 +1696,7 @@ const byReferenceUnsafe = (obj) => {
 	return obj;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Redactable.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Redactable.js
 /**
 * Defines the symbol used to identify objects that implement the {@link Redactable}
 * protocol.
@@ -1679,6 +1730,7 @@ const byReferenceUnsafe = (obj) => {
 *
 * @see {@link Redactable} for the interface this symbol belongs to
 * @see {@link isRedactable} to check whether a value has this symbol
+* @stability stable
 * @category symbols
 * @since 3.10.0
 */
@@ -1693,6 +1745,7 @@ const symbolRedactable = /*#__PURE__*/ Symbol.for("~effect/Redactable");
 *
 * @see {@link Redactable} for the interface being checked
 * @see {@link redact} to apply redaction if the value is redactable
+* @stability stable
 * @category guards
 * @since 3.10.0
 */
@@ -1718,6 +1771,7 @@ const isRedactable = (u) => hasProperty(u, symbolRedactable);
 *
 * @see {@link isRedactable} to check before redacting
 * @see {@link getRedacted} for the lower-level variant for known redactables
+* @stability stable
 * @category destructors
 * @since 3.10.0
 */
@@ -1745,6 +1799,7 @@ function redact(u) {
 *
 * @see {@link redact} for the higher-level variant that handles non-redactable values
 * @see {@link isRedactable} for the type guard to verify before calling this
+* @stability stable
 * @category destructors
 * @since 4.0.0
 */
@@ -1764,7 +1819,7 @@ const emptyContext = {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Formatter.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Formatter.js
 /**
 * Formats JavaScript values into readable strings.
 *
@@ -1774,6 +1829,7 @@ const emptyContext = {
 * wraps JSON formatting with redaction and circular-reference handling, and the
 * module also includes helpers for property keys, paths, and dates.
 *
+* @stability stable
 * @since 4.0.0
 */
 /**
@@ -1836,6 +1892,7 @@ const emptyContext = {
 *
 * @see {@link formatJson}
 * @see {@link Formatter}
+* @stability stable
 * @category formatting
 * @since 2.0.0
 */
@@ -1993,6 +2050,7 @@ function safeGet(input, key) {
 *
 * @see {@link format}
 * @see {@link Formatter}
+* @stability stable
 * @category serialization
 * @since 4.0.0
 */
@@ -2012,11 +2070,32 @@ function formatJson(input, options) {
 		if (ancestors.includes(redacted)) return;
 		ancestors.push(redacted);
 		if (current !== redacted) ancestors.push(current);
-		return current;
+		if (!hasGetter(current) || isJsonPrimitiveWrapper(current)) return current;
+		const serialized = new Proxy(current, { get(target, key) {
+			const value = Reflect.get(target, key, target);
+			return Object.getOwnPropertyDescriptor(target, key)?.get !== void 0 ? redact(value) : value;
+		} });
+		ancestors.push(serialized);
+		return serialized;
 	}, options?.space) ?? "null";
 }
+function hasGetter(object) {
+	for (const key of Object.getOwnPropertyNames(object)) if (Object.getOwnPropertyDescriptor(object, key)?.get !== void 0) return true;
+	return false;
+}
+function isJsonPrimitiveWrapper(object) {
+	for (const valueOf of [
+		Number.prototype.valueOf,
+		Boolean.prototype.valueOf,
+		String.prototype.valueOf
+	]) try {
+		Reflect.apply(valueOf, object, []);
+		return true;
+	} catch {}
+	return false;
+}
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Inspectable.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Inspectable.js
 /**
 * Controls how values appear in logs and debugging output.
 *
@@ -2026,6 +2105,7 @@ function formatJson(input, options) {
 * the `Inspectable` interface, safe conversion helpers, and shared prototype or
 * class implementations for custom values.
 *
+* @stability stable
 * @since 2.0.0
 */
 /**
@@ -2058,6 +2138,7 @@ function formatJson(input, options) {
 * obj[Inspectable.NodeInspectSymbol]() // => "CustomObject(hello)"
 * ```
 *
+* @stability stable
 * @category symbols
 * @since 2.0.0
 */
@@ -2080,6 +2161,7 @@ const NodeInspectSymbol = /*#__PURE__*/ Symbol.for("nodejs.util.inspect.custom")
 *
 * @see {@link toStringUnknown} for converting unknown values to strings
 *
+* @stability stable
 * @category converting
 * @since 4.0.0
 */
@@ -2106,6 +2188,7 @@ const toJson = (input) => {
 * provided whitespace setting when possible, and values that cannot be
 * formatted are converted with `String`.
 *
+* @stability stable
 * @category converting
 * @since 2.0.0
 */
@@ -2150,6 +2233,7 @@ const toStringUnknown = (u, whitespace = 2) => {
 * MyClass.prototype.constructor = MyClass
 * ```
 *
+* @stability stable
 * @category prototypes
 * @since 2.0.0
 */
@@ -2165,7 +2249,7 @@ const BaseProto = {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/stackTraceLimit.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/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.
@@ -2197,7 +2281,7 @@ const setStackTraceLimit = (value) => {
 	if (canWriteStackTraceLimit) Error.stackTraceLimit = value;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Utils.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Utils.js
 /**
 * Yields its wrapped value exactly once, then completes with the value sent
 * back in.
@@ -2229,6 +2313,7 @@ const setStackTraceLimit = (value) => {
 * ```
 *
 * @see {@link Gen} for the type-level signature that relies on `SingleShotGen`
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -2274,7 +2359,7 @@ const pickInternalCall = () => {
 /** @internal */
 const internalCall = /*#__PURE__*/ pickInternalCall();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/record.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/record.js
 /** @internal */
 function assignProperty(self, key, value) {
 	if (key === "__proto__") Object.defineProperty(self, key, {
@@ -2290,7 +2375,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/node_modules/effect/dist/internal/core.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/core.js
 /** @internal */
 const EffectTypeId = `~effect/Effect`;
 /** @internal */
@@ -2448,6 +2533,26 @@ var Fail = class extends ReasonBase {
 };
 /** @internal */
 const causeFromReasons = (reasons) => new CauseImpl(reasons);
+const dedupeReasons = (self, that) => {
+	const buckets = /* @__PURE__ */ new Map();
+	const out = [];
+	for (const reason of self.concat(that)) {
+		const hash$2 = hash(reason);
+		const bucket = buckets.get(hash$2);
+		if (bucket === void 0) buckets.set(hash$2, [reason]);
+		else if (bucket.some((previous) => equals(previous, reason))) continue;
+		else bucket.push(reason);
+		out.push(reason);
+	}
+	return out;
+};
+/** @internal */
+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(self, newCause) ? self : newCause;
+});
 /** @internal */
 const causeEmpty = /*#__PURE__*/ new CauseImpl([]);
 /** @internal */
@@ -2569,7 +2674,17 @@ const exitFailCause = /*#__PURE__*/ makeExit({
 			annotated = true;
 		}
 		let cont = fiber.getCont(contE);
-		while (fiber.interruptible && fiber._interruptedCause && cont) cont = fiber.getCont(contE);
+		const interruptedCause = fiber._interruptedCause;
+		if (interruptedCause && fiber.interruptible) {
+			let skippedHandler = false;
+			while (cont && fiber.interruptible) {
+				skippedHandler ||= identifier in cont;
+				cont = fiber.getCont(contE);
+			}
+			if (skippedHandler) cause = causeFromReasons(cause.reasons.filter((reason) => reason._tag !== "Fail"));
+			cause = causeCombine(cause, interruptedCause);
+			annotated = true;
+		}
 		return cont ? cont[contE](cause, fiber, annotated ? void 0 : this) : fiber.yieldWith(annotated ? exitFailCause(cause) : this);
 	}
 });
@@ -2652,7 +2767,7 @@ const done = (value) => {
 	return exitFail(Done(value));
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Equivalence.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Equivalence.js
 /**
 * Creates a custom equivalence relation with an optimized reference equality check.
 *
@@ -2698,6 +2813,7 @@ const done = (value) => {
 *
 * @see {@link strictEqual}
 * @see {@link mapInput}
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -2747,6 +2863,7 @@ const isStrictEquivalent = (x, y) => x === y;
 *
 * @see {@link make}
 * @see `Equal` for structural equality
+* @stability stable
 * @category constructors
 * @since 4.0.0
 */
@@ -2805,6 +2922,7 @@ const strictEqual = () => isStrictEquivalent;
 * customTupleEq(["Hello", "World", "Test"], ["HELLO", "WORLD", "TEST"]) // => true
 * ```
 *
+* @stability stable
 * @category combinators
 * @since 4.0.0
 */
@@ -2826,7 +2944,7 @@ function Array_(item) {
 	});
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/option.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/option.js
 /**
 * @since 2.0.0
 */
@@ -2897,7 +3015,7 @@ SomeImpl.prototype = SomeProto;
 /** @internal */
 const some$2 = (value) => new SomeImpl(value);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/result.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/result.js
 const TypeId$1 = "~effect/Result";
 const CommonProto = {
 	[TypeId$1]: {
@@ -2973,7 +3091,7 @@ const succeed$1 = (success) => new SuccessImpl(success);
 /** @internal */
 const fromOption$1 = /*#__PURE__*/ dual(2, (self, onNone) => isNone$1(self) ? fail$1(onNone()) : succeed$1(self.value));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Order.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Order.js
 /**
 * Defines comparison functions for ordered values.
 *
@@ -2984,6 +3102,7 @@ const fromOption$1 = /*#__PURE__*/ dual(2, (self, onNone) => isNone$1(self) ? fa
 * orders, tools for reversing and combining comparisons, tuple and struct
 * helpers, comparison predicates, clamping, and reducer support.
 *
+* @stability stable
 * @since 2.0.0
 */
 /**
@@ -3018,6 +3137,7 @@ const fromOption$1 = /*#__PURE__*/ dual(2, (self, onNone) => isNone$1(self) ? fa
 *
 * @see {@link mapInput} to transform an order by mapping the input type
 * @see {@link combine} to combine multiple orders
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -3048,6 +3168,7 @@ function make$1(compare) {
 *
 * @see {@link mapInput} to compare objects by a string property
 * @see {@link Struct} to combine with other orders for struct comparison
+* @stability stable
 * @category instances
 * @since 4.0.0
 */
@@ -3080,6 +3201,7 @@ const String$2 = /*#__PURE__*/ make$1((self, that) => self < that ? -1 : 1);
 *
 * @see {@link mapInput} to compare objects by a number property
 * @see {@link BigInt} for bigint comparisons
+* @stability stable
 * @category instances
 * @since 4.0.0
 */
@@ -3113,6 +3235,7 @@ const Number$1 = /*#__PURE__*/ make$1((self, that) => {
 *
 * @see {@link Number} for regular number comparisons
 * @see {@link mapInput} to compare objects by a bigint property
+* @stability stable
 * @category instances
 * @since 4.0.0
 */
@@ -3146,6 +3269,7 @@ const BigInt = /*#__PURE__*/ make$1((self, that) => self < that ? -1 : 1);
 *
 * @see {@link combine} to combine mapped orders for multi-criteria comparison
 * @see {@link Struct} to create orders for structs with multiple fields
+* @stability stable
 * @category mapping
 * @since 2.0.0
 */
@@ -3177,6 +3301,7 @@ const mapInput = /*#__PURE__*/ dual(2, (self, f) => make$1((b1, b2) => self(f(b1
 * ```
 *
 * @see {@link mapInput} to compare objects by a date property
+* @stability stable
 * @category instances
 * @since 2.0.0
 */
@@ -3207,6 +3332,7 @@ const Date$1 = /*#__PURE__*/ mapInput(Number$1, (date) => date.getTime());
 *
 * @see {@link isLessThanOrEqualTo} for non-strict less than or equal
 * @see {@link isGreaterThan} for strict greater than
+* @stability stable
 * @category predicates
 * @since 4.0.0
 */
@@ -3237,6 +3363,7 @@ const isLessThan = (O) => dual(2, (self, that) => O(self, that) === -1);
 *
 * @see {@link isGreaterThanOrEqualTo} for non-strict greater than or equal
 * @see {@link isLessThan} for strict less than
+* @stability stable
 * @category predicates
 * @since 4.0.0
 */
@@ -3267,6 +3394,7 @@ const isGreaterThan = (O) => dual(2, (self, that) => O(self, that) === 1);
 *
 * @see {@link isLessThan} for strict less than
 * @see {@link isGreaterThan} for strict greater than
+* @stability stable
 * @category predicates
 * @since 4.0.0
 */
@@ -3298,12 +3426,13 @@ const isLessThanOrEqualTo = (O) => dual(2, (self, that) => O(self, that) !== 1);
 *
 * @see {@link isGreaterThan} for strict greater than
 * @see {@link isLessThanOrEqualTo} for less than or equal
+* @stability stable
 * @category predicates
 * @since 4.0.0
 */
 const isGreaterThanOrEqualTo = (O) => dual(2, (self, that) => O(self, that) !== -1);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Option.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Option.js
 /**
 * Creates an `Option` representing the absence of a value.
 *
@@ -3329,6 +3458,7 @@ const isGreaterThanOrEqualTo = (O) => dual(2, (self, that) => O(self, that) !==
 *
 * @see {@link some} for the opposite operation.
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -3358,6 +3488,7 @@ const none = () => none$1;
 *
 * @see {@link none} for the opposite operation.
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -3384,6 +3515,7 @@ const some$1 = some$2;
 *
 * @see {@link isSome} for the opposite check.
 *
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -3410,6 +3542,7 @@ const isNone = isNone$1;
 *
 * @see {@link isNone} for the opposite check.
 *
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -3441,6 +3574,7 @@ const isSome = isSome$1;
 *
 * @see {@link getOrElse} for unwrapping with a default
 *
+* @stability stable
 * @category pattern matching
 * @since 2.0.0
 */
@@ -3472,6 +3606,7 @@ const match$3 = /*#__PURE__*/ dual(2, (self, { onNone, onSome }) => isNone(self)
 * @see {@link getOrUndefined} to fall back to `undefined`
 * @see {@link getOrThrow} to throw on `None`
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -3502,6 +3637,7 @@ const getOrElse = /*#__PURE__*/ dual(2, (self, onNone) => isNone(self) ? onNone(
 * @see {@link orElseSome} to wrap the fallback value in `Some` automatically
 * @see {@link firstSomeOf} to pick the first `Some` from a collection
 *
+* @stability stable
 * @category error handling
 * @since 2.0.0
 */
@@ -3533,6 +3669,7 @@ const orElse = /*#__PURE__*/ dual(2, (self, that) => isNone(self) ? that() : sel
 *
 * @see {@link orElse} for a two-option fallback
 *
+* @stability stable
 * @category error handling
 * @since 2.0.0
 */
@@ -3568,6 +3705,7 @@ const firstSomeOf = (collection) => {
 * @see {@link fromUndefinedOr} to only treat `undefined` as absent
 * @see {@link liftNullishOr} to lift a nullable-returning function
 *
+* @stability stable
 * @category converting
 * @since 4.0.0
 */
@@ -3599,6 +3737,7 @@ const fromNullishOr = (a) => a == null ? none() : some$1(a);
 * @see {@link fromNullishOr} to treat both `null` and `undefined` as absent
 * @see {@link fromNullOr} to only treat `null` as absent
 *
+* @stability stable
 * @category converting
 * @since 4.0.0
 */
@@ -3630,6 +3769,7 @@ const fromUndefinedOr = (a) => a === void 0 ? none() : some$1(a);
 * @see {@link fromNullishOr} to treat both `null` and `undefined` as absent
 * @see {@link fromUndefinedOr} to only treat `undefined` as absent
 *
+* @stability stable
 * @category converting
 * @since 4.0.0
 */
@@ -3659,6 +3799,7 @@ const fromNullOr = (a) => a === null ? none() : some$1(a);
 * @see {@link getOrNull} to return `null` instead
 * @see {@link getOrElse} for a custom fallback
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -3688,6 +3829,7 @@ const getOrUndefined = /*#__PURE__*/ getOrElse(constUndefined);
 *
 * @see {@link liftNullishOr} for nullable-returning functions
 *
+* @stability stable
 * @category converting
 * @since 2.0.0
 */
@@ -3724,6 +3866,7 @@ const liftThrowable = (f) => (...a) => {
 * @see {@link flatMap} when `f` returns an `Option`
 * @see {@link as} to replace the value with a constant
 *
+* @stability stable
 * @category mapping
 * @since 2.0.0
 */
@@ -3767,6 +3910,7 @@ const map$2 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : some$1(
 * @see {@link andThen} for a more flexible variant
 * @see {@link flatten} to unwrap a nested `Option<Option<A>>`
 *
+* @stability stable
 * @category sequencing
 * @since 2.0.0
 */
@@ -3795,6 +3939,7 @@ const flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : f(s
 *
 * @see {@link flatMap} which is `map` + `flatten`
 *
+* @stability stable
 * @category sequencing
 * @since 2.0.0
 */
@@ -3825,6 +3970,7 @@ const flatten$1 = /*#__PURE__*/ flatMap$1(identity);
 * @see {@link zipWith} to combine with a function instead of a tuple
 * @see {@link all} to combine many `Option`s
 *
+* @stability stable
 * @category combining
 * @since 2.0.0
 */
@@ -3865,6 +4011,7 @@ const product = /*#__PURE__*/ dual(2, (self, that) => isSome(self) && isSome(tha
 * @see {@link product} for combining exactly two
 * @see {@link productMany} for a homogeneous collection
 *
+* @stability stable
 * @category combining
 * @since 2.0.0
 */
@@ -3913,6 +4060,7 @@ const all = (input) => {
 * @see {@link product} to combine into a tuple instead
 * @see {@link lift2} to lift a binary function
 *
+* @stability stable
 * @category zipping
 * @since 2.0.0
 */
@@ -3949,6 +4097,7 @@ const zipWith = /*#__PURE__*/ dual(3, (self, that, f) => map$2(product(self, tha
 * @see {@link filterMap} to transform and filter simultaneously
 * @see {@link exists} to test without filtering
 *
+* @stability stable
 * @category filtering
 * @since 2.0.0
 */
@@ -3981,6 +4130,7 @@ const filter$1 = /*#__PURE__*/ dual(2, (self, predicate) => isNone(self) ? none(
 *
 * @see {@link contains} for a version using default equality
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -4012,6 +4162,7 @@ const containsWith$1 = (isEquivalent) => dual(2, (self, a) => isNone(self) ? fal
 * @see {@link containsWith} for custom equality
 * @see {@link exists} to test with a predicate
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -4045,19 +4196,20 @@ const contains$1 = /*#__PURE__*/ containsWith$1(/*#__PURE__*/ asEquivalence());
 * @see {@link filter} to keep or discard based on a predicate
 * @see {@link contains} to test for a specific value
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
 const exists = /*#__PURE__*/ dual(2, (self, refinement) => isNone(self) ? false : refinement(self.value));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/internal/array.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/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/node_modules/effect/dist/internal/count.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/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.
@@ -4066,7 +4218,7 @@ const isArrayNonEmpty$1 = (self) => self.length > 0;
 */
 const normalize = (n) => n > 0 ? Math.floor(n) : 0;
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Result.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Result.js
 /**
 * Creates a `Result` holding a `Success` value.
 *
@@ -4086,6 +4238,7 @@ const normalize = (n) => n > 0 ? Math.floor(n) : 0;
 * @see {@link fail} to create a Failure
 * @see {@link void_ void} for a pre-built `Success<void>`
 *
+* @stability stable
 * @category constructors
 * @since 4.0.0
 */
@@ -4112,6 +4265,7 @@ const succeed = succeed$1;
 * @see {@link succeed} to create a Success
 * @see {@link mapError} to transform the error
 *
+* @stability stable
 * @category constructors
 * @since 4.0.0
 */
@@ -4144,6 +4298,7 @@ const fail = fail$1;
 * @see {@link getFailure} to extract the failure value as an Option
 * @see {@link fromNullishOr} to build a Result from nullable values
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -4175,6 +4330,7 @@ const fromOption = fromOption$1;
 * @see {@link isSuccess} for the opposite check
 * @see {@link isResult} to check if a value is any Result
 *
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -4206,6 +4362,7 @@ const isFailure = isFailure$1;
 * @see {@link isFailure} for the opposite check
 * @see {@link isResult} to check if a value is any Result
 *
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -4242,6 +4399,7 @@ const isSuccess = isSuccess$1;
 * @see {@link merge} to extract `A | E` without mapping
 * @see {@link getOrElse} to unwrap only the success with a fallback
 *
+* @stability stable
 * @category pattern matching
 * @since 2.0.0
 */
@@ -4273,6 +4431,7 @@ const match$2 = /*#__PURE__*/ dual(2, (self, { onFailure, onSuccess }) => isFail
 * @see {@link getOrThrowWith} for custom error mapping
 * @see {@link getOrElse} for a non-throwing alternative
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4281,7 +4440,7 @@ const getOrThrow = /*#__PURE__*/ (/* @__PURE__ */ dual(2, (self, onFailure) => {
 	throw onFailure(self.failure);
 }))(identity);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Iterable.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Iterable.js
 /**
 * Returns the first element that satisfies the specified
 * predicate, or `None` if no such element exists.
@@ -4319,6 +4478,7 @@ const getOrThrow = /*#__PURE__*/ (/* @__PURE__ */ dual(2, (self, onFailure) => {
 * findSquareRoot // => Option.some(1)
 * ```
 *
+* @stability stable
 * @category searching
 * @since 2.0.0
 */
@@ -4334,7 +4494,7 @@ const findFirst$1 = /*#__PURE__*/ dual(2, (self, f) => {
 	return none();
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Record.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Record.js
 /**
 * Builds a record from an iterable of key-value pairs.
 *
@@ -4351,6 +4511,7 @@ const findFirst$1 = /*#__PURE__*/ dual(2, (self, f) => {
 * Record.fromEntries([["a", 1], ["b", 2]]) // => { a: 1, b: 2 }
 * ```
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -4367,6 +4528,7 @@ const fromEntries = Object.fromEntries;
 * Record.collect(x, (key, n) => [key, n]) // => [["a", 1], ["b", 2], ["c", 3]]
 * ```
 *
+* @stability stable
 * @category converting
 * @since 2.0.0
 */
@@ -4387,6 +4549,7 @@ const collect = /*#__PURE__*/ dual(2, (self, f) => {
 * Record.has(Record.empty<string>(), "c") // => false
 * ```
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -4405,6 +4568,7 @@ const has = /*#__PURE__*/ dual(2, (self, key) => Object.hasOwn(self, key));
 * R.get(person, "email") // => Option.none()
 * ```
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4429,6 +4593,7 @@ const get$2 = /*#__PURE__*/ dual(2, (self, key) => Object.hasOwn(self, key) ? so
 * Record.remove({ a: 1, b: 2 }, "a") // => { b: 2 }
 * ```
 *
+* @stability stable
 * @category mutations
 * @since 2.0.0
 */
@@ -4455,6 +4620,7 @@ const remove = /*#__PURE__*/ dual(2, (self, key) => {
 * Record.map({ a: 3, b: 5 }, g) // => { a: "A-3", b: "B-5" }
 * ```
 *
+* @stability stable
 * @category mapping
 * @since 2.0.0
 */
@@ -4474,6 +4640,7 @@ const map$1 = /*#__PURE__*/ dual(2, (self, f) => {
 * Record.keys({ a: 1, b: 2, c: 3 }) // => ["a", "b", "c"]
 * ```
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4489,12 +4656,13 @@ const keys = (self) => Object.keys(self);
 * Record.values({ a: 1, b: 2, c: 3 }) // => [1, 2, 3]
 * ```
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
 const values = (self) => collect(self, (_, a) => a);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/Array.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Array.js
 /**
 * Works with JavaScript arrays, readonly arrays, and non-empty arrays.
 *
@@ -4504,6 +4672,7 @@ const values = (self) => collect(self, (_, a) => a);
 * arrays and preserve non-empty array types when the result is guaranteed to
 * contain values.
 *
+* @stability stable
 * @since 2.0.0
 */
 /**
@@ -4522,6 +4691,7 @@ const values = (self) => collect(self, (_, a) => a);
 * Array.Array === globalThis.Array // => true
 * ```
 *
+* @stability stable
 * @category constructors
 * @since 4.0.0
 */
@@ -4550,6 +4720,7 @@ const Array$1 = globalThis.Array;
 * @see {@link ensure} — wrap a single value or return an existing array
 * @see {@link copy} — create a shallow copy of an array
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -4580,6 +4751,7 @@ const fromIterable = (collection) => Array$1.isArray(collection) ? collection :
 * @see {@link of} — always wrap in a single-element array
 * @see {@link fromIterable} — convert any iterable
 *
+* @stability stable
 * @category constructors
 * @since 3.3.0
 */
@@ -4613,6 +4785,7 @@ const ensure = (self) => Array$1.isArray(self) ? self : [self];
 * @see {@link matchLeft} — destructures into head + tail
 * @see {@link matchRight} — destructures into init + last
 *
+* @stability stable
 * @category pattern matching
 * @since 2.0.0
 */
@@ -4636,6 +4809,7 @@ const match$1 = /*#__PURE__*/ dual(2, (self, { onEmpty, onNonEmpty }) => isReado
 * @see {@link append} — add to the end
 * @see {@link prependAll} — prepend multiple elements
 *
+* @stability stable
 * @category combining
 * @since 2.0.0
 */
@@ -4659,6 +4833,7 @@ const prepend = /*#__PURE__*/ dual(2, (self, head) => [head, ...self]);
 * @see {@link prepend} — add to the front
 * @see {@link appendAll} — append multiple elements
 *
+* @stability stable
 * @category combining
 * @since 2.0.0
 */
@@ -4686,6 +4861,7 @@ const append = /*#__PURE__*/ dual(2, (self, last) => [...self, last]);
 * @see {@link append} — add a single element to the end
 * @see {@link prependAll} — add elements to the front
 *
+* @stability stable
 * @category combining
 * @since 2.0.0
 */
@@ -4706,6 +4882,7 @@ Array$1.isArray;
 * @see {@link isReadonlyArrayEmpty} — readonly variant
 * @see {@link isArrayNonEmpty} — opposite check
 *
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -4725,6 +4902,7 @@ const isArrayEmpty = (self) => self.length === 0;
 * @see {@link isArrayEmpty} — mutable variant
 * @see {@link isReadonlyArrayNonEmpty} — opposite check
 *
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -4750,6 +4928,7 @@ const isReadonlyArrayEmpty = isArrayEmpty;
 * @see {@link isReadonlyArrayNonEmpty} — readonly variant
 * @see {@link isArrayEmpty} — opposite check
 *
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -4775,6 +4954,7 @@ const isArrayNonEmpty = isArrayNonEmpty$1;
 * @see {@link isArrayNonEmpty} — mutable variant
 * @see {@link isReadonlyArrayEmpty} — opposite check
 *
+* @stability stable
 * @category guards
 * @since 4.0.0
 */
@@ -4820,6 +5000,7 @@ function isOutOfBounds(i, as) {
 * @see {@link head} for reading the first element as an `Option`
 * @see {@link last} for reading the last element as an `Option`
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4847,6 +5028,7 @@ const get$1 = /*#__PURE__*/ dual(2, (self, index) => {
 * @see {@link headNonEmpty} — direct access when array is known non-empty
 * @see {@link last} — get the last element
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4871,6 +5053,7 @@ const head = /*#__PURE__*/ get$1(0);
 * @see {@link lastNonEmpty} — direct access when array is known non-empty
 * @see {@link head} — get the first element
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4894,6 +5077,7 @@ const last = (self) => isReadonlyArrayNonEmpty(self) ? some$1(lastNonEmpty(self)
 *
 * @see {@link last} — safe version for possibly-empty arrays
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4923,6 +5107,7 @@ const clampCount = (n, length) => Math.min(normalize(n), length);
 * @see {@link takeWhile} for keeping an initial prefix while a predicate holds
 * @see {@link drop} for removing elements from the start
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4952,6 +5137,7 @@ const take = /*#__PURE__*/ dual(2, (self, n) => {
 * @see {@link drop} — remove from the start
 * @see {@link takeRight} — keep from the end
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -4979,6 +5165,7 @@ const dropRight = /*#__PURE__*/ dual(2, (self, n) => {
 * @see {@link findLastIndex} — search from the end
 * @see {@link findFirst} — get the element itself
 *
+* @stability stable
 * @category searching
 * @since 2.0.0
 */
@@ -5017,6 +5204,7 @@ const findFirstIndex = /*#__PURE__*/ dual(2, (self, predicate) => {
 * @see {@link findFirstIndex} — get the index instead
 * @see {@link findFirstWithIndex} — get both element and index
 *
+* @stability stable
 * @category searching
 * @since 2.0.0
 */
@@ -5045,6 +5233,7 @@ const findFirst = findFirst$1;
 * @see {@link findFirst} — search from the start
 * @see {@link findLastIndex} — get the index instead
 *
+* @stability stable
 * @category searching
 * @since 2.0.0
 */
@@ -5082,6 +5271,7 @@ const findLast = /*#__PURE__*/ dual(2, (self, f) => {
 * @see {@link sortWith} — sort by a mapping function
 * @see {@link sortBy} — sort by multiple orders
 *
+* @stability stable
 * @category sorting
 * @since 2.0.0
 */
@@ -5110,6 +5300,7 @@ const sort = /*#__PURE__*/ dual(2, (self, O) => {
 *
 * @see {@link contains} for the `Equal.equivalence()` variant
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -5136,6 +5327,7 @@ const containsWith = (isEquivalent) => dual(2, (self, a) => {
 *
 * @see {@link containsWith} — use custom equality
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -5169,6 +5361,7 @@ const hashBucketsAdd = (buckets, value) => {
 * @see {@link of} — create a single-element array
 * @see {@link make} — create from multiple values
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -5187,6 +5380,7 @@ const empty = () => [];
 * @see {@link make} — create from multiple values
 * @see {@link empty} — create an empty array
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -5213,6 +5407,7 @@ const of = (a) => [a];
 *
 * @see {@link flatMap} — map and flatten
 *
+* @stability stable
 * @category mapping
 * @since 2.0.0
 */
@@ -5241,6 +5436,7 @@ const map = /*#__PURE__*/ dual(2, (self, f) => self.map(f));
 * @see {@link map} — transform without flattening
 * @see {@link flatten} — flatten without mapping
 *
+* @stability stable
 * @category sequencing
 * @since 2.0.0
 */
@@ -5271,6 +5467,7 @@ const flatMap = /*#__PURE__*/ dual(2, (self, f) => {
 *
 * @see {@link flatMap} — map then flatten in one step
 *
+* @stability stable
 * @category sequencing
 * @since 2.0.0
 */
@@ -5294,6 +5491,7 @@ const flatten = /*#__PURE__*/ flatMap(identity);
 * @see {@link fromOption} — convert a single Option
 * @see {@link getSuccesses} — extract successes from Results
 *
+* @stability stable
 * @category filtering
 * @since 2.0.0
 */
@@ -5325,6 +5523,7 @@ const getSomes = (self) => {
 * @see {@link filter} — keep original elements matching a predicate
 * @see {@link partition} for keeping both successes and failures
 *
+* @stability stable
 * @category filtering
 * @since 2.0.0
 */
@@ -5361,6 +5560,7 @@ const filterMap = /*#__PURE__*/ dual(2, (self, f) => {
 * @see {@link partition} — split into matching and non-matching
 * @see {@link filterMap} for transforming while filtering
 *
+* @stability stable
 * @category filtering
 * @since 2.0.0
 */
@@ -5392,6 +5592,7 @@ const filter = /*#__PURE__*/ dual(2, (self, predicate) => {
 * @see {@link reduceRight} — fold from right to left
 * @see {@link scan} — fold keeping intermediate values
 *
+* @stability stable
 * @category folding
 * @since 2.0.0
 */
@@ -5416,6 +5617,7 @@ const reduce = /*#__PURE__*/ dual(3, (self, b, f) => fromIterable(self).reduce((
 *
 * @see {@link some} — test if any element matches
 *
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -5436,6 +5638,7 @@ const every = /*#__PURE__*/ dual(2, (self, refinement) => self.every(refinement)
 * @see {@link every} — test if all elements match
 * @see {@link contains} — test for a specific value
 *
+* @stability stable
 * @category guards
 * @since 2.0.0
 */
@@ -5457,6 +5660,7 @@ const some = /*#__PURE__*/ dual(2, (self, predicate) => self.some(predicate));
 *
 * @see {@link makeOrder} — create an ordering for arrays
 *
+* @stability stable
 * @category instances
 * @since 4.0.0
 */
@@ -5481,6 +5685,7 @@ const makeEquivalence = Array_;
 * @see {@link dedupeWith} — use custom equality
 * @see {@link dedupeAdjacent} — only dedupes consecutive elements
 *
+* @stability stable
 * @category deduplication
 * @since 2.0.0
 */
@@ -5505,6 +5710,7 @@ const dedupe = (self) => {
 *
 * @see {@link intersperse} — insert separator elements without joining
 *
+* @stability stable
 * @category folding
 * @since 2.0.0
 */
@@ -5576,6 +5782,7 @@ const join = /*#__PURE__*/ dual(2, (self, sep) => fromIterable(self).join(sep));
 * @see {@link TaggedEnum.Constructor} — the returned object type
 * @see {@link TaggedEnum.WithGenerics} — generic enum support
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -5632,6 +5839,7 @@ function taggedMatch() {
 * @see {@link TaggedError} — adds a `_tag` for `Effect.catchTag`
 * @see {@link Class} — non-error data class
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -5678,6 +5886,7 @@ const Error$1 = Error$2;
 * @see {@link Error} — without a `_tag`
 * @see {@link TaggedClass} — tagged class that is not an error
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -5697,6 +5906,7 @@ globalThis.String;
 * String.Order("apple", "apple") // => 0
 * ```
 *
+* @stability stable
 * @category instances
 * @since 2.0.0
 */
@@ -5713,6 +5923,7 @@ const Order = String$2;
 * String.trimEnd("hello world  ") // => "hello world"
 * ```
 *
+* @stability stable
 * @category transforming
 * @since 2.0.0
 */
@@ -5730,6 +5941,7 @@ const trimEnd = (self) => self.trimEnd();
 * String.split("hello,world", ",") // => ["hello", "world"]
 * ```
 *
+* @stability stable
 * @category transforming
 * @since 2.0.0
 */
@@ -5750,6 +5962,7 @@ const split = /*#__PURE__*/ dual(2, (self, separator) => {
 * pipe("hello world", String.includes("foo")) // => false
 * ```
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -5766,6 +5979,7 @@ const includes = (searchString, position) => (self) => self.includes(searchStrin
 * pipe("hello world", String.startsWith("world")) // => false
 * ```
 *
+* @stability stable
 * @category predicates
 * @since 2.0.0
 */
@@ -5787,12 +6001,13 @@ const startsWith = (searchString, position) => (self) => self.startsWith(searchS
 * pipe("hello", String.match(/x/)) // => Option.none()
 * ```
 *
+* @stability stable
 * @category searching
 * @since 2.0.0
 */
 const match = (regExp) => (self) => fromNullOr(self.match(regExp));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.0/node_modules/effect/dist/MutableRef.js
+//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/MutableRef.js
 const TypeId = "~effect/MutableRef";
 const MutableRefProto = {
 	[TypeId]: TypeId,
@@ -5833,6 +6048,7 @@ const MutableRefProto = {
 * MutableRef.get(status) // => "running"
 * ```
 *
+* @stability stable
 * @category constructors
 * @since 2.0.0
 */
@@ -5874,6 +6090,7 @@ const make = (value) => {
 * value1 === value2 // => true
 * ```
 *
+* @stability stable
 * @category getters
 * @since 2.0.0
 */
@@ -5925,6 +6142,7 @@ const get = (self) => self.current;
 * MutableRef.get(state) // => "success"
 * ```
 *
+* @stability stable
 * @category mutations
 * @since 2.0.0
 */
@@ -5984,9 +6202,10 @@ const set = /*#__PURE__*/ dual(2, (self, value) => {
 * MutableRef.get(list) // => [1, 2, 3, 4]
 * ```
 *
+* @stability stable
 * @category mutations
 * @since 2.0.0
 */
 const update = /*#__PURE__*/ dual(2, (self, f) => set(self, f(get(self))));
 //#endregion
-export { fromOption as $, isNullish as $n, causeFail as $t, getSomes as A, formatPath as An, isGreaterThanOrEqualTo as At, match$1 as B, optimize as Bn, Error$2 as Bt, findFirst as C, setStackTraceLimit as Cn, some$1 as Ct, flatten as D, format as Dn, Number$1 as Dt, flatMap as E, toStringUnknown as En, Date$1 as Et, isReadonlyArrayNonEmpty as F, symbol as Fn, Tuple as Ft, sort as G, hasProperty as Gn, ReasonBase as Gt, prepend as H, string as Hn, Fail as Ht, join as I, array as In, make$2 as It, get$2 as J, isFunction as Jn, Yield as Jt, take as K, isBoolean as Kn, StackTraceKey as Kt, last as L, combine as Ln, strictEqual as Lt, isArrayEmpty as M, currentFiberTypeId as Mn, isLessThanOrEqualTo as Mt, isArrayNonEmpty as N, byReferenceUnsafe as Nn, make$1 as Nt, fromIterable as O, formatDate as On, String$2 as Ot, isCanonicalArrayIndex as P, equals as Pn, mapInput as Pt, fail as Q, isNotUndefined as Qn, causeEmpty as Qt, makeEquivalence as R, hash as Rn, CauseImpl as Rt, filterMap as S, getStackTraceLimit as Sn, orElse as St, findLast as T, NodeInspectSymbol as Tn, BigInt as Tt, reduce as U, structure as Un, InterruptorStackTrace as Ut, of as V, random as Vn, ExitTypeId as Vt, some as W, symbol$1 as Wn, PipeInspectableProto as Wt, remove as X, isNotNull as Xn, causeAnnotate as Xt, map$1 as Y, isIterable as Yn, args as Yt, values as Z, isNotNullish as Zn, causeDie as Zt, dropRight as _, makePrimitive as _n, memoizeIdempotent as _r, isSome as _t, includes as a, done as an, isString as ar, all as at, every as b, assignProperty as bn, Prototype as br, match$3 as bt, startsWith as c, exitFail as cn, isUnknown as cr, filter$1 as ct, TaggedError as d, isCause as dn, constUndefined as dr, flatten$1 as dt, causeFromReasons as en, isNumber as er, getOrThrow as et, taggedEnum as f, isDieReason as fn, constVoid as fr, fromNullishOr as ft, dedupe as g, isInterruptReason as gn, memoize as gr, isNone as gt, contains as h, isFailReason as hn, identity as hr, getOrUndefined as ht, Order as i, contE as in, isReadonlyObject as ir, normalize as it, head as j, formatPropertyKey as jn, isLessThan as jt, get$1 as k, formatJson as kn, isGreaterThan as kt, trimEnd as l, exitFailCause as ln, constFalse as lr, firstSomeOf as lt, appendAll as m, isEffect as mn, dual as mr, getOrElse as mt, make as n, contA as nn, isObjectKeyword as nr, match$2 as nt, match as o, evaluate as on, isTagged as or, contains$1 as ot, append as p, isDone as pn, constant as pr, fromUndefinedOr as pt, fromEntries as q, isError as qn, TaggedError$1 as qt, update as r, contAll as rn, isPropertyKey as rr, succeed as rt, split as s, exitDie as sn, isUndefined as sr, exists as st, get as t, constEmptyAnnotations as tn, isObject as tr, isFailure as tt, Error$1 as u, exitSucceed as un, constTrue as ur, flatMap$1 as ut, empty as v, makePrimitiveProto as vn, pipe as vr, liftThrowable as vt, findFirstIndex as w, BaseProto as wn, zipWith as wt, filter as x, internalCall as xn, pipeArguments as xr, none as xt, ensure as y, withFiber as yn, Class$1 as yr, map$2 as yt, map as z, number as zn, Done as zt };
+export { fromOption as $, isNotNull as $n, causeDie as $t, getSomes as A, format as An, isGreaterThanOrEqualTo as At, match$1 as B, combine as Bn, Done as Bt, findFirst as C, assignProperty as Cn, Prototype as Cr, some$1 as Ct, flatten as D, BaseProto as Dn, Number$1 as Dt, flatMap as E, setStackTraceLimit as En, Date$1 as Et, isReadonlyArrayNonEmpty as F, currentFiberTypeId as Fn, Tuple as Ft, sort as G, string as Gn, PipeInspectableProto as Gt, prepend as H, number as Hn, ExitTypeId as Ht, join as I, byReferenceUnsafe as In, make$2 as It, get$2 as J, hasProperty as Jn, TaggedError$1 as Jt, take as K, structure as Kn, ReasonBase as Kt, last as L, equals as Ln, strictEqual as Lt, isArrayEmpty as M, formatJson as Mn, isLessThanOrEqualTo as Mt, isArrayNonEmpty as N, formatPath as Nn, make$1 as Nt, fromIterable as O, NodeInspectSymbol as On, String$2 as Ot, isCanonicalArrayIndex as P, formatPropertyKey as Pn, mapInput as Pt, fail as Q, isIterable as Qn, causeCombine as Qt, makeEquivalence as R, symbol as Rn, CauseImpl as Rt, filterMap as S, withFiber as Sn, Class$1 as Sr, orElse as St, findLast as T, getStackTraceLimit as Tn, BigInt as Tt, reduce as U, optimize as Un, Fail as Ut, of as V, hash as Vn, Error$2 as Vt, some as W, random as Wn, InterruptorStackTrace as Wt, remove as X, isError as Xn, args as Xt, map$1 as Y, isBoolean as Yn, Yield as Yt, values as Z, isFunction as Zn, causeAnnotate as Zt, dropRight as _, isExit as _n, dual as _r, isSome as _t, includes as a, contAll as an, isObjectKeyword as ar, all as at, every as b, makePrimitive as bn, memoizeIdempotent as br, match$3 as bt, startsWith as c, evaluate as cn, isString as cr, filter$1 as ct, TaggedError as d, exitFailCause as dn, isUnknown as dr, flatten$1 as dt, causeEmpty as en, isNotNullish as er, getOrThrow as et, taggedEnum as f, exitSucceed as fn, constFalse as fr, fromNullishOr as ft, dedupe as g, isEffect as gn, constant as gr, isNone as gt, contains as h, isDone as hn, constVoid as hr, getOrUndefined as ht, Order as i, contA as in, isObject as ir, normalize as it, head as j, formatDate as jn, isLessThan as jt, get$1 as k, toStringUnknown as kn, isGreaterThan as kt, trimEnd as l, exitDie as ln, isTagged as lr, firstSomeOf as lt, appendAll as m, isDieReason as mn, constUndefined as mr, getOrElse as mt, make as n, causeFromReasons as nn, isNullish as nr, match$2 as nt, match as o, contE as on, isPropertyKey as or, contains$1 as ot, append as p, isCause as pn, constTrue as pr, fromUndefinedOr as pt, fromEntries as q, symbol$1 as qn, StackTraceKey as qt, update as r, constEmptyAnnotations as rn, isNumber as rr, succeed as rt, split as s, done as sn, isReadonlyObject as sr, exists as st, get as t, causeFail as tn, isNotUndefined as tr, isFailure as tt, Error$1 as u, exitFail as un, isUndefined as ur, flatMap$1 as ut, empty as v, isFailReason as vn, identity as vr, liftThrowable as vt, findFirstIndex as w, internalCall as wn, pipeArguments as wr, zipWith as wt, filter as x, makePrimitiveProto as xn, pipe as xr, none as xt, ensure as y, isInterruptReason as yn, memoize as yr, map$2 as yt, map as z, array as zn, Die as zt };