@deslop/coding-standards 0.1.1068 → 0.1.1069

package/dist/{MutableRef-WrqsqeER.mjs → MutableRef-KfyWrSvW.mjs}

@@ -1,4 +1,4 @@
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Pipeable.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/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(...)`.
@@ -104,7 +104,7 @@ const Class$1 = /*#__PURE__*/ function() {
 	return PipeableBase;
 }();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Function.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Function.js
 /**
 * Creates a function that can be called in data-first style or data-last
 * (`pipe`-friendly) style.
@@ -399,7 +399,7 @@ function memoizeIdempotent(f) {
 	};
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/equal.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/internal/equal.js
 /** @internal */
 const getAllObjectKeys = (obj) => {
 	const keys = new Set(Reflect.ownKeys(obj));
@@ -420,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.2/node_modules/effect/dist/internal/hash.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/internal/hash.js
 /**
 * Back-edge count used to avoid caching entry-point-dependent hashes.
 *
@@ -432,7 +432,7 @@ const addBackEdge = () => {
 	backEdges++;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Predicate.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Predicate.js
 /**
 * Defines runtime checks for values.
 *
@@ -546,6 +546,38 @@ function isBoolean(input) {
 	return typeof input === "boolean";
 }
 /**
+* Checks whether a value is a `bigint`.
+*
+* **When to use**
+*
+* Use when you need a `Predicate` guard to narrow an `unknown` value to a
+* bigint.
+*
+* **Details**
+*
+* Uses `typeof input === "bigint"`.
+*
+* **Example** (Guarding bigints)
+*
+* ```ts import.meta.vitest
+* import { Predicate } from "effect"
+*
+* const data: unknown = 1n
+*
+* if (Predicate.isBigInt(data)) {
+*   data + 2n // => 3n
+* }
+* ```
+*
+* @see {@link isNumber}
+* @stability stable
+* @category guards
+* @since 2.0.0
+*/
+function isBigInt(input) {
+	return typeof input === "bigint";
+}
+/**
 * Checks whether a value is a `symbol`.
 *
 * **When to use**
@@ -1035,7 +1067,7 @@ function isIterable(input) {
 	return hasProperty(input, Symbol.iterator) || isString(input);
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Hash.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/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
@@ -1431,7 +1463,7 @@ const randomHashCache = /*#__PURE__*/ new WeakMap();
 const hashCache = /*#__PURE__*/ new WeakMap();
 const visitedObjects = /*#__PURE__*/ new WeakSet();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Equal.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Equal.js
 /**
 * Defines the unique string identifier for the `Equal` interface.
 *
@@ -1696,7 +1728,7 @@ const byReferenceUnsafe = (obj) => {
 	return obj;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Redactable.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Redactable.js
 /**
 * Defines the symbol used to identify objects that implement the {@link Redactable}
 * protocol.
@@ -1819,7 +1851,7 @@ const emptyContext = {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Formatter.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Formatter.js
 /**
 * Formats JavaScript values into readable strings.
 *
@@ -2095,7 +2127,7 @@ function isJsonPrimitiveWrapper(object) {
 	return false;
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Inspectable.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Inspectable.js
 /**
 * Controls how values appear in logs and debugging output.
 *
@@ -2249,7 +2281,7 @@ const BaseProto = {
 	}
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/stackTraceLimit.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/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.
@@ -2281,7 +2313,7 @@ const setStackTraceLimit = (value) => {
 	if (canWriteStackTraceLimit) Error.stackTraceLimit = value;
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Utils.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Utils.js
 /**
 * Yields its wrapped value exactly once, then completes with the value sent
 * back in.
@@ -2354,12 +2386,17 @@ const pickInternalCall = () => {
 			return body();
 		} finally {}
 	} };
-	return getStackTraceLimit() !== 0 && standard[InternalTypeId](() => (/* @__PURE__ */ new Error()).stack)?.includes(InternalTypeId) === true ? standard[InternalTypeId] : forced[InternalTypeId];
+	const limit = getStackTraceLimit();
+	if (limit === 0) return forced[InternalTypeId];
+	setStackTraceLimit(2);
+	const error = standard[InternalTypeId](() => /* @__PURE__ */ new Error());
+	setStackTraceLimit(limit);
+	return error.stack?.includes(InternalTypeId) === true ? standard[InternalTypeId] : forced[InternalTypeId];
 };
 /** @internal */
 const internalCall = /*#__PURE__*/ pickInternalCall();
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/record.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/internal/record.js
 /** @internal */
 function assignProperty(self, key, value) {
 	if (key === "__proto__") Object.defineProperty(self, key, {
@@ -2375,7 +2412,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.2/node_modules/effect/dist/internal/core.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/internal/core.js
 /** @internal */
 const EffectTypeId = `~effect/Effect`;
 /** @internal */
@@ -2767,7 +2804,7 @@ const done = (value) => {
 	return exitFail(Done(value));
 };
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Equivalence.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Equivalence.js
 /**
 * Creates a custom equivalence relation with an optimized reference equality check.
 *
@@ -2944,7 +2981,7 @@ function Array_(item) {
 	});
 }
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/option.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/internal/option.js
 /**
 * @since 2.0.0
 */
@@ -3015,7 +3052,7 @@ SomeImpl.prototype = SomeProto;
 /** @internal */
 const some$2 = (value) => new SomeImpl(value);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/result.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/internal/result.js
 const TypeId$1 = "~effect/Result";
 const CommonProto = {
 	[TypeId$1]: {
@@ -3091,7 +3128,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.2/node_modules/effect/dist/Order.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Order.js
 /**
 * Defines comparison functions for ordered values.
 *
@@ -3432,7 +3469,7 @@ const isLessThanOrEqualTo = (O) => dual(2, (self, that) => O(self, that) !== 1);
 */
 const isGreaterThanOrEqualTo = (O) => dual(2, (self, that) => O(self, that) !== -1);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Option.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Option.js
 /**
 * Creates an `Option` representing the absence of a value.
 *
@@ -3870,7 +3907,7 @@ const liftThrowable = (f) => (...a) => {
 * @category mapping
 * @since 2.0.0
 */
-const map$2 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : some$1(f(self.value)));
+const map$3 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : some$1(f(self.value)));
 /**
 * Applies a function that returns an `Option` to the value of a `Some`,
 * flattening the result. Returns `None` if the input is `None`.
@@ -3914,7 +3951,7 @@ const map$2 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : some$1(
 * @category sequencing
 * @since 2.0.0
 */
-const flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : f(self.value));
+const flatMap$2 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : f(self.value));
 /**
 * Flattens a nested `Option<Option<A>>` into `Option<A>`.
 *
@@ -3943,7 +3980,7 @@ const flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => isNone(self) ? none() : f(s
 * @category sequencing
 * @since 2.0.0
 */
-const flatten$1 = /*#__PURE__*/ flatMap$1(identity);
+const flatten$1 = /*#__PURE__*/ flatMap$2(identity);
 /**
 * Combines two `Option`s into a `Some` containing a tuple `[A, B]` if both
 * are `Some`.
@@ -4064,7 +4101,7 @@ const all = (input) => {
 * @category zipping
 * @since 2.0.0
 */
-const zipWith = /*#__PURE__*/ dual(3, (self, that, f) => map$2(product(self, that), ([a, b]) => f(a, b)));
+const zipWith = /*#__PURE__*/ dual(3, (self, that, f) => map$3(product(self, that), ([a, b]) => f(a, b)));
 /**
 * Filters an `Option` using a predicate. Returns `None` if the predicate is
 * not satisfied or the input is `None`.
@@ -4202,14 +4239,14 @@ const contains$1 = /*#__PURE__*/ containsWith$1(/*#__PURE__*/ asEquivalence());
 */
 const exists = /*#__PURE__*/ dual(2, (self, refinement) => isNone(self) ? false : refinement(self.value));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/internal/array.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/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.2/node_modules/effect/dist/internal/count.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/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.
@@ -4218,7 +4255,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.2/node_modules/effect/dist/Result.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Result.js
 /**
 * Creates a `Result` holding a `Success` value.
 *
@@ -4368,6 +4405,40 @@ const isFailure = isFailure$1;
 */
 const isSuccess = isSuccess$1;
 /**
+* Transforms the success channel of a `Result`, leaving the failure channel unchanged.
+*
+* **When to use**
+*
+* Use to apply a transformation to the success value of a `Result` while
+* preserving any existing failure.
+*
+* **Details**
+*
+* - If the result is a `Success`, applies `f` to the value and returns a new `Success`
+* - If the result is a `Failure`, returns it as-is
+* - Use {@link flatMap} if `f` returns a `Result` (to avoid nested Results)
+*
+* **Example** (Doubling the success value)
+*
+* ```ts import.meta.vitest
+* import { pipe, Result } from "effect"
+*
+* pipe(
+*   Result.succeed(3),
+*   Result.map((n) => n * 2)
+* ) // => Result.succeed(6)
+* ```
+*
+* @see {@link mapError} to transform only the error value
+* @see {@link mapBoth} to transform both channels
+* @see {@link flatMap} when `f` returns a `Result`
+*
+* @stability stable
+* @category mapping
+* @since 2.0.0
+*/
+const map$2 = /*#__PURE__*/ dual(2, (self, f) => isSuccess(self) ? succeed(f(self.success)) : self);
+/**
 * Folds a `Result` into a single value by applying one of two functions.
 *
 * **When to use**
@@ -4439,8 +4510,44 @@ const getOrThrow = /*#__PURE__*/ (/* @__PURE__ */ dual(2, (self, onFailure) => {
 	if (isSuccess(self)) return self.success;
 	throw onFailure(self.failure);
 }))(identity);
+/**
+* Chains a function that returns a `Result` onto a successful value.
+*
+* **When to use**
+*
+* Use to sequence `Result`-returning computations that should short-circuit on
+* failure.
+*
+* **Details**
+*
+* - If `self` is a `Success`, applies `f` to the value and returns the resulting `Result`
+* - If `self` is a `Failure`, short-circuits and returns it unchanged
+* - The error types are merged into a union (`E | E2`)
+* - This is the monadic `bind` / `>>=` for `Result`
+*
+* **Example** (Validating sequentially)
+*
+* ```ts import.meta.vitest
+* import { pipe, Result } from "effect"
+*
+* pipe(
+*   Result.succeed(5),
+*   Result.flatMap((n) =>
+*     n > 0 ? Result.succeed(n * 2) : Result.fail("not positive")
+*   )
+* ) // => Result.succeed(10)
+* ```
+*
+* @see {@link andThen} for a more flexible variant that also accepts plain values
+* @see {@link map} when `f` does not return a `Result`
+*
+* @stability stable
+* @category sequencing
+* @since 2.0.0
+*/
+const flatMap$1 = /*#__PURE__*/ dual(2, (self, f) => isFailure(self) ? fail(self.failure) : f(self.success));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Iterable.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Iterable.js
 /**
 * Returns the first element that satisfies the specified
 * predicate, or `None` if no such element exists.
@@ -4494,7 +4601,7 @@ const findFirst$1 = /*#__PURE__*/ dual(2, (self, f) => {
 	return none();
 });
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Record.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Record.js
 /**
 * Builds a record from an iterable of key-value pairs.
 *
@@ -4662,7 +4769,7 @@ const keys = (self) => Object.keys(self);
 */
 const values = (self) => collect(self, (_, a) => a);
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/Array.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/Array.js
 /**
 * Works with JavaScript arrays, readonly arrays, and non-empty arrays.
 *
@@ -6050,7 +6157,7 @@ const startsWith = (searchString, position) => (self) => self.startsWith(searchS
 */
 const match = (regExp) => (self) => fromNullOr(self.match(regExp));
 //#endregion
-//#region ../../node_modules/.pnpm/effect@4.0.2/node_modules/effect/dist/MutableRef.js
+//#region ../../node_modules/.pnpm/effect@4.0.4/node_modules/effect/dist/MutableRef.js
 const TypeId = "~effect/MutableRef";
 const MutableRefProto = {
 	[TypeId]: TypeId,
@@ -6251,4 +6358,4 @@ const set = /*#__PURE__*/ dual(2, (self, value) => {
 */
 const update = /*#__PURE__*/ dual(2, (self, f) => set(self, f(get(self))));
 //#endregion
-export { values as $, isFunction as $n, causeAnnotate as $t, fromIterable as A, NodeInspectSymbol as An, String$2 as At, makeEquivalence as B, symbol as Bn, CauseImpl as Bt, filterMap as C, makePrimitiveProto as Cn, pipe as Cr, none as Ct, flatMap as D, getStackTraceLimit as Dn, BigInt as Dt, findLast as E, internalCall as En, pipeArguments as Er, zipWith as Et, isArrayNonEmpty as F, formatPath as Fn, make$1 as Ft, reduce as G, optimize as Gn, Fail as Gt, match$1 as H, combine as Hn, Done as Ht, isCanonicalArrayIndex as I, formatPropertyKey as In, mapInput as It, take as J, structure as Jn, ReasonBase as Jt, some as K, random as Kn, InterruptorStackTrace as Kt, isReadonlyArrayNonEmpty as L, currentFiberTypeId as Ln, Tuple as Lt, getSomes as M, format as Mn, isGreaterThanOrEqualTo as Mt, head as N, formatDate as Nn, isLessThan as Nt, flatten as O, setStackTraceLimit as On, Date$1 as Ot, isArrayEmpty as P, formatJson as Pn, isLessThanOrEqualTo as Pt, remove as Q, isError as Qn, args as Qt, join as R, byReferenceUnsafe as Rn, make$2 as Rt, filter as S, makePrimitive as Sn, memoizeIdempotent as Sr, match$3 as St, findFirstIndex as T, assignProperty as Tn, Prototype as Tr, some$1 as Tt, of as U, hash as Un, Error$2 as Ut, map as V, array as Vn, Die as Vt, prepend as W, number as Wn, ExitTypeId as Wt, get$2 as X, hasProperty as Xn, TaggedError$1 as Xt, fromEntries as Y, symbol$1 as Yn, StackTraceKey as Yt, map$1 as Z, isBoolean as Zn, Yield as Zt, dedupe as _, isDone as _n, constVoid as _r, getOrUndefined as _t, includes as a, constEmptyAnnotations as an, isNumber as ar, succeed as at, ensure as b, isFailReason as bn, identity as br, liftThrowable as bt, startsWith as c, contE as cn, isPropertyKey as cr, contains$1 as ct, Error$1 as d, exitDie as dn, isTagged as dr, firstSomeOf as dt, causeCombine as en, isIterable as er, fail as et, TaggedError as f, exitFail as fn, isUndefined as fr, flatMap$1 as ft, contains as g, isDieReason as gn, constUndefined as gr, getOrElse as gt, appendAll as h, isCause as hn, constTrue as hr, fromUndefinedOr as ht, Order as i, causeFromReasons as in, isNullish as ir, match$2 as it, get$1 as j, toStringUnknown as jn, isGreaterThan as jt, forEach as k, BaseProto as kn, Number$1 as kt, trim as l, done as ln, isReadonlyObject as lr, exists as lt, append as m, exitSucceed as mn, constFalse as mr, fromNullishOr as mt, make as n, causeEmpty as nn, isNotNullish as nr, getOrThrow as nt, match as o, contA as on, isObject as or, normalize as ot, taggedEnum as p, exitFailCause as pn, isUnknown as pr, flatten$1 as pt, sort as q, string as qn, PipeInspectableProto as qt, update as r, causeFail as rn, isNotUndefined as rr, isFailure as rt, split as s, contAll as sn, isObjectKeyword as sr, all as st, get as t, causeDie as tn, isNotNull as tr, fromOption as tt, trimEnd as u, evaluate as un, isString as ur, filter$1 as ut, dropRight as v, isEffect as vn, constant as vr, isNone as vt, findFirst as w, withFiber as wn, Class$1 as wr, orElse as wt, every as x, isInterruptReason as xn, memoize as xr, map$2 as xt, empty as y, isExit as yn, dual as yr, isSome as yt, last as z, equals as zn, strictEqual as zt };
+export { values as $, symbol$1 as $n, TaggedError$1 as $t, fromIterable as A, getStackTraceLimit as An, Prototype as Ar, BigInt as At, makeEquivalence as B, currentFiberTypeId as Bn, Tuple as Bt, filterMap as C, isFailReason as Cn, constant as Cr, liftThrowable as Ct, flatMap as D, withFiber as Dn, memoizeIdempotent as Dr, orElse as Dt, findLast as E, makePrimitiveProto as En, memoize as Er, none as Et, isArrayNonEmpty as F, format as Fn, isGreaterThanOrEqualTo as Ft, reduce as G, combine as Gn, Done as Gt, match$1 as H, equals as Hn, strictEqual as Ht, isCanonicalArrayIndex as I, formatDate as In, isLessThan as It, take as J, optimize as Jn, Fail as Jt, some as K, hash as Kn, Error$2 as Kt, isReadonlyArrayNonEmpty as L, formatJson as Ln, isLessThanOrEqualTo as Lt, getSomes as M, BaseProto as Mn, Number$1 as Mt, head as N, NodeInspectSymbol as Nn, String$2 as Nt, flatten as O, assignProperty as On, pipe as Or, some$1 as Ot, isArrayEmpty as P, toStringUnknown as Pn, isGreaterThan as Pt, remove as Q, structureKeys as Qn, StackTraceKey as Qt, join as R, formatPath as Rn, make$1 as Rt, filter as S, isExit as Sn, constVoid as Sr, isSome as St, findFirstIndex as T, makePrimitive as Tn, identity as Tr, match$3 as Tt, of as U, symbol as Un, CauseImpl as Ut, map as V, byReferenceUnsafe as Vn, make$2 as Vt, prepend as W, array as Wn, Die as Wt, get$2 as X, string as Xn, PipeInspectableProto as Xt, fromEntries as Y, random as Yn, InterruptorStackTrace as Yt, map$1 as Z, structure as Zn, ReasonBase as Zt, dedupe as _, exitSucceed as _n, isUndefined as _r, fromNullishOr as _t, includes as a, causeEmpty as an, isIterable as ar, isSuccess as at, ensure as b, isDone as bn, constTrue as br, getOrUndefined as bt, startsWith as c, constEmptyAnnotations as cn, isNotUndefined as cr, succeed as ct, Error$1 as d, contE as dn, isObject as dr, contains$1 as dt, Yield as en, hasProperty as er, fail as et, TaggedError as f, done as fn, isObjectKeyword as fr, exists as ft, contains as g, exitFailCause as gn, isTagged as gr, flatten$1 as gt, appendAll as h, exitFail as hn, isString as hr, flatMap$2 as ht, Order as i, causeDie as in, isFunction as ir, isFailure as it, get$1 as j, setStackTraceLimit as jn, pipeArguments as jr, Date$1 as jt, forEach as k, internalCall as kn, Class$1 as kr, zipWith as kt, trim as l, contA as ln, isNullish as lr, normalize as lt, append as m, exitDie as mn, isReadonlyObject as mr, firstSomeOf as mt, make as n, causeAnnotate as nn, isBoolean as nr, fromOption as nt, match as o, causeFail as on, isNotNull as or, map$2 as ot, taggedEnum as p, evaluate as pn, isPropertyKey as pr, filter$1 as pt, sort as q, number as qn, ExitTypeId as qt, update as r, causeCombine as rn, isError as rr, getOrThrow as rt, split as s, causeFromReasons as sn, isNotNullish as sr, match$2 as st, get as t, args as tn, isBigInt as tr, flatMap$1 as tt, trimEnd as u, contAll as un, isNumber as ur, all as ut, dropRight as v, isCause as vn, isUnknown as vr, fromUndefinedOr as vt, findFirst as w, isInterruptReason as wn, dual as wr, map$3 as wt, every as x, isEffect as xn, constUndefined as xr, isNone as xt, empty as y, isDieReason as yn, constFalse as yr, getOrElse as yt, last as z, formatPropertyKey as zn, mapInput as zt };