@lmvz-ds/components 0.13.0 → 0.13.1

package/dist/cjs/{assets-CB5ikzmP.js → icons-FIfJEo6G.js}

@@ -1,8 +1,7 @@
 'use strict';
 
-var index = require('./index-D3BMpL5w.js');
+var assets = require('./assets-CJzJZPzV.js');
 
-var _documentCurrentScript = typeof document !== 'undefined' ? document.currentScript : null;
 /**
  * Tests if a value is a `function`.
  *
@@ -278,19 +277,19 @@ function pipe(a, ab, bc, cd, de, ef, fg, gh, hi) {
  * @category constructors
  * @since 2.0.0
  */
-const make$n = isEquivalent => (self, that) => self === that || isEquivalent(self, that);
+const make$q = isEquivalent => (self, that) => self === that || isEquivalent(self, that);
 /**
  * @category mapping
  * @since 2.0.0
  */
-const mapInput$1 = /*#__PURE__*/dual(2, (self, f) => make$n((x, y) => self(f(x), f(y))));
+const mapInput$1 = /*#__PURE__*/dual(2, (self, f) => make$q((x, y) => self(f(x), f(y))));
 /**
  * Creates a new `Equivalence` for an array of values based on a given `Equivalence` for the elements of the array.
  *
  * @category combinators
  * @since 2.0.0
  */
-const array$1 = item => make$n((self, that) => {
+const array$1 = item => make$q((self, that) => {
   if (self.length !== that.length) {
     return false;
   }
@@ -1328,10 +1327,10 @@ const Base$1 = /*#__PURE__*/function () {
 /**
  * @since 2.0.0
  */
-const TypeId$9 = /*#__PURE__*/Symbol.for("effect/Option");
+const TypeId$b = /*#__PURE__*/Symbol.for("effect/Option");
 const CommonProto$1 = {
   ...EffectPrototype$1,
-  [TypeId$9]: {
+  [TypeId$b]: {
     _A: _ => _
   },
   [NodeInspectSymbol]() {
@@ -1376,7 +1375,7 @@ const NoneProto = /*#__PURE__*/Object.assign(/*#__PURE__*/Object.create(CommonPr
   }
 });
 /** @internal */
-const isOption = input => hasProperty(input, TypeId$9);
+const isOption = input => hasProperty(input, TypeId$b);
 /** @internal */
 const isNone$1 = fa => fa._tag === "None";
 /** @internal */
@@ -1396,10 +1395,10 @@ const some$1 = value => {
 /**
  * @internal
  */
-const TypeId$8 = /*#__PURE__*/Symbol.for("effect/Either");
+const TypeId$a = /*#__PURE__*/Symbol.for("effect/Either");
 const CommonProto = {
   ...EffectPrototype$1,
-  [TypeId$8]: {
+  [TypeId$a]: {
     _R: _ => _
   },
   [NodeInspectSymbol]() {
@@ -1444,7 +1443,7 @@ const LeftProto = /*#__PURE__*/Object.assign(/*#__PURE__*/Object.create(CommonPr
   }
 });
 /** @internal */
-const isEither = input => hasProperty(input, TypeId$8);
+const isEither = input => hasProperty(input, TypeId$a);
 /** @internal */
 const isLeft$1 = ma => ma._tag === "Left";
 /** @internal */
@@ -1570,7 +1569,7 @@ const merge$3 = /*#__PURE__*/match$4({
  * @category getters
  * @since 2.0.0
  */
-const getOrThrowWith$1 = /*#__PURE__*/dual(2, (self, onLeft) => {
+const getOrThrowWith = /*#__PURE__*/dual(2, (self, onLeft) => {
   if (isRight(self)) {
     return self.right;
   }
@@ -1605,17 +1604,17 @@ const isNonEmptyArray$1 = self => self.length > 0;
  * @category constructors
  * @since 2.0.0
  */
-const make$m = compare => (self, that) => self === that ? 0 : compare(self, that);
+const make$p = compare => (self, that) => self === that ? 0 : compare(self, that);
 /**
  * @category instances
  * @since 2.0.0
  */
-const number = /*#__PURE__*/make$m((self, that) => self < that ? -1 : 1);
+const number = /*#__PURE__*/make$p((self, that) => self < that ? -1 : 1);
 /**
  * @category mapping
  * @since 2.0.0
  */
-const mapInput = /*#__PURE__*/dual(2, (self, f) => make$m((b1, b2) => self(f(b1), f(b2))));
+const mapInput = /*#__PURE__*/dual(2, (self, f) => make$p((b1, b2) => self(f(b1), f(b2))));
 /**
  * Test whether one value is _strictly greater than_ another.
  *
@@ -1907,67 +1906,6 @@ const fromNullable = nullableValue => nullableValue == null ? none$4() : some(nu
  * @since 2.0.0
  */
 const getOrUndefined = /*#__PURE__*/getOrElse(constUndefined);
-/**
- * Extracts the value of an `Option` or throws an error if the `Option` is
- * `None`, using a custom error factory.
- *
- * **Details**
- *
- * This function allows you to extract the value of an `Option` when it is
- * `Some`. If the `Option` is `None`, it throws an error generated by the
- * provided `onNone` function. This utility is particularly useful when you need
- * a fail-fast behavior for empty `Option` values and want to provide a custom
- * error message or object.
- *
- * @example
- * ```ts
- * import * as assert from "node:assert"
- * import { Option } from "effect"
- *
- * assert.deepStrictEqual(
- *   Option.getOrThrowWith(Option.some(1), () => new Error('Unexpected None')),
- *   1
- * )
- * assert.throws(() => Option.getOrThrowWith(Option.none(), () => new Error('Unexpected None')))
- * ```
- *
- * @see {@link getOrThrow} for a version that throws a default error.
- *
- * @category Conversions
- * @since 2.0.0
- */
-const getOrThrowWith = /*#__PURE__*/dual(2, (self, onNone) => {
-  if (isSome(self)) {
-    return self.value;
-  }
-  throw onNone();
-});
-/**
- * Extracts the value of an `Option` or throws a default error if the `Option`
- * is `None`.
- *
- * **Details**
- *
- * This function extracts the value from an `Option` if it is `Some`. If the
- * `Option` is `None`, it throws a default error. It is useful for fail-fast
- * scenarios where the absence of a value is treated as an exceptional case and
- * a default error is sufficient.
- *
- * @example
- * ```ts
- * import * as assert from "node:assert"
- * import { Option } from "effect"
- *
- * assert.deepStrictEqual(Option.getOrThrow(Option.some(1)), 1)
- * assert.throws(() => Option.getOrThrow(Option.none()))
- * ```
- *
- * @see {@link getOrThrowWith} for a version that allows you to provide a custom error.
- *
- * @category Conversions
- * @since 2.0.0
- */
-const getOrThrow = /*#__PURE__*/getOrThrowWith(() => new Error("getOrThrow called on a None"));
 /**
  * Transforms the value inside a `Some` to a new value using the provided
  * function, while leaving `None` unchanged.
@@ -2124,20 +2062,6 @@ const _equivalence$3 = /*#__PURE__*/equivalence();
  * @since 2.0.0
  */
 const contains = /*#__PURE__*/containsWith(_equivalence$3);
-/**
- * Merges two optional values, applying a function if both exist.
- * Unlike {@link zipWith}, this function returns `None` only if both inputs are `None`.
- *
- * @internal
- */
-const mergeWith = f => (o1, o2) => {
-  if (isNone(o1)) {
-    return o2;
-  } else if (isNone(o2)) {
-    return o1;
-  }
-  return some(f(o1.value, o2.value));
-};
 
 /**
  * This module provides utility functions for working with tuples in TypeScript.
@@ -2158,7 +2082,7 @@ const mergeWith = f => (o1, o2) => {
  * @category constructors
  * @since 2.0.0
  */
-const make$l = (...elements) => elements;
+const make$o = (...elements) => elements;
 
 /**
  * This module provides utility functions for working with arrays in TypeScript.
@@ -2272,7 +2196,7 @@ const prepend$2 = /*#__PURE__*/dual(2, (self, head) => [head, ...self]);
  * @category concatenating
  * @since 2.0.0
  */
-const append$1 = /*#__PURE__*/dual(2, (self, last) => [...self, last]);
+const append$2 = /*#__PURE__*/dual(2, (self, last) => [...self, last]);
 /**
  * Concatenates two arrays (or iterables), combining their elements.
  * If either array is non-empty, the result is also a non-empty array.
@@ -2522,7 +2446,7 @@ const sort = /*#__PURE__*/dual(2, (self, O) => {
  * @category zipping
  * @since 2.0.0
  */
-const zip$1 = /*#__PURE__*/dual(2, (self, that) => zipWith(self, that, make$l));
+const zip$1 = /*#__PURE__*/dual(2, (self, that) => zipWith(self, that, make$o));
 /**
  * Apply a function to pairs of elements at the same index in two `Iterable`s, collecting the results in a new `Array`. If one
  * input `Iterable` is short, excess elements of the longer `Iterable` are discarded.
@@ -2660,7 +2584,7 @@ const union$2 = /*#__PURE__*/dual(2, (self, that) => unionWith(self, that, _equi
  * @category constructors
  * @since 2.0.0
  */
-const empty$j = () => [];
+const empty$k = () => [];
 /**
  * Constructs a new `NonEmptyArray<A>` from the specified value.
  *
@@ -2934,6 +2858,54 @@ const Order$1 = number;
  */
 const escape = string => string.replace(/[/\\^$*+?.()|[\]{}]/g, "\\$&");
 
+/**
+ * This module provides types and utility functions to create and work with branded types,
+ * which are TypeScript types with an added type tag to prevent accidental usage of a value in the wrong context.
+ *
+ * The `refined` and `nominal` functions are both used to create branded types in TypeScript.
+ * The main difference between them is that `refined` allows for validation of the data, while `nominal` does not.
+ *
+ * The `nominal` function is used to create a new branded type that has the same underlying type as the input, but with a different name.
+ * This is useful when you want to distinguish between two values of the same type that have different meanings.
+ * The `nominal` function does not perform any validation of the input data.
+ *
+ * On the other hand, the `refined` function is used to create a new branded type that has the same underlying type as the input,
+ * but with a different name, and it also allows for validation of the input data.
+ * The `refined` function takes a predicate that is used to validate the input data.
+ * If the input data fails the validation, a `BrandErrors` is returned, which provides information about the specific validation failure.
+ *
+ * @since 2.0.0
+ */
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const RefinedConstructorsTypeId = /*#__PURE__*/Symbol.for("effect/Brand/Refined");
+/**
+ * Returns a `BrandErrors` that contains a single `RefinementError`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const error = (message, meta) => [{
+  message,
+  meta
+}];
+function refined(...args) {
+  const either = args.length === 2 ? unbranded => args[0](unbranded) ? right(unbranded) : left(args[1](unbranded)) : unbranded => {
+    return match$3(args[0](unbranded), {
+      onNone: () => right(unbranded),
+      onSome: left
+    });
+  };
+  return Object.assign(unbranded => getOrThrowWith(either(unbranded), identity), {
+    [RefinedConstructorsTypeId]: RefinedConstructorsTypeId,
+    option: args => getRight(either(args)),
+    either,
+    is: args => isRight(either(args))
+  });
+}
+
 /** @internal */
 const TagTypeId = /*#__PURE__*/Symbol.for("effect/Context/Tag");
 /** @internal */
@@ -2968,7 +2940,7 @@ const TagProto = {
     return self;
   },
   context(self) {
-    return make$k(this, self);
+    return make$n(this, self);
   }
 };
 const ReferenceProto = {
@@ -3008,10 +2980,10 @@ const Reference$1 = () => (id, options) => {
   return ReferenceClass;
 };
 /** @internal */
-const TypeId$7 = /*#__PURE__*/Symbol.for("effect/Context");
+const TypeId$9 = /*#__PURE__*/Symbol.for("effect/Context");
 /** @internal */
 const ContextProto = {
-  [TypeId$7]: {
+  [TypeId$9]: {
     _Services: _ => _
   },
   [symbol](that) {
@@ -3071,14 +3043,14 @@ const serviceNotFoundError = tag => {
   return error;
 };
 /** @internal */
-const isContext = u => hasProperty(u, TypeId$7);
+const isContext = u => hasProperty(u, TypeId$9);
 /** @internal */
 const isReference = u => hasProperty(u, ReferenceTypeId);
 const _empty$6 = /*#__PURE__*/makeContext(/*#__PURE__*/new Map());
 /** @internal */
-const empty$i = () => _empty$6;
+const empty$j = () => _empty$6;
 /** @internal */
-const make$k = (tag, service) => makeContext(new Map([[tag.key, service]]));
+const make$n = (tag, service) => makeContext(new Map([[tag.key, service]]));
 /** @internal */
 const add$3 = /*#__PURE__*/dual(3, (self, tag, service) => {
   const map = new Map(self.unsafeMap);
@@ -3153,7 +3125,7 @@ const GenericTag = makeGenericTag;
  * @since 2.0.0
  * @category constructors
  */
-const empty$h = empty$i;
+const empty$i = empty$j;
 /**
  * Creates a new `Context` with a single service associated to the tag.
  *
@@ -3172,7 +3144,7 @@ const empty$h = empty$i;
  * @since 2.0.0
  * @category constructors
  */
-const make$j = make$k;
+const make$m = make$n;
 /**
  * Adds a service to a given `Context`.
  *
@@ -3351,7 +3323,7 @@ const Reference = Reference$1;
 /**
  * @since 2.0.0
  */
-const TypeId$6 = /*#__PURE__*/Symbol.for("effect/Chunk");
+const TypeId$8 = /*#__PURE__*/Symbol.for("effect/Chunk");
 function copy(src, srcPos, dest, destPos, len) {
   for (let i = srcPos; i < Math.min(src.length, srcPos + len); i++) {
     dest[destPos + i - srcPos] = src[i];
@@ -3365,10 +3337,10 @@ const emptyArray = [];
  * @category equivalence
  * @since 2.0.0
  */
-const getEquivalence$1 = isEquivalent => make$n((self, that) => self.length === that.length && toReadonlyArray(self).every((value, i) => isEquivalent(value, unsafeGet(that, i))));
+const getEquivalence$1 = isEquivalent => make$q((self, that) => self.length === that.length && toReadonlyArray(self).every((value, i) => isEquivalent(value, unsafeGet(that, i))));
 const _equivalence$1 = /*#__PURE__*/getEquivalence$1(equals$1);
 const ChunkProto = {
-  [TypeId$6]: {
+  [TypeId$8]: {
     _A: _ => _
   },
   toString() {
@@ -3462,7 +3434,7 @@ const makeChunk = backing => {
  * @category constructors
  * @since 2.0.0
  */
-const isChunk = u => hasProperty(u, TypeId$6);
+const isChunk = u => hasProperty(u, TypeId$8);
 const _empty$5 = /*#__PURE__*/makeChunk({
   _tag: "IEmpty"
 });
@@ -3470,14 +3442,14 @@ const _empty$5 = /*#__PURE__*/makeChunk({
  * @category constructors
  * @since 2.0.0
  */
-const empty$g = () => _empty$5;
+const empty$h = () => _empty$5;
 /**
  * Builds a `NonEmptyChunk` from an non-empty collection of elements.
  *
  * @category constructors
  * @since 2.0.0
  */
-const make$i = (...as) => unsafeFromNonEmptyArray(as);
+const make$l = (...as) => unsafeFromNonEmptyArray(as);
 /**
  * Builds a `NonEmptyChunk` from a single element.
  *
@@ -3610,7 +3582,7 @@ const reverse$1 = reverseChunk;
  * @since 2.0.0
  * @category unsafe
  */
-const unsafeFromArray = self => self.length === 0 ? empty$g() : self.length === 1 ? of$1(self[0]) : makeChunk({
+const unsafeFromArray = self => self.length === 0 ? empty$h() : self.length === 1 ? of$1(self[0]) : makeChunk({
   _tag: "IArray",
   array: self
 });
@@ -3663,7 +3635,7 @@ const unsafeGet = /*#__PURE__*/dual(2, (self, index) => {
  * @category concatenating
  * @since 2.0.0
  */
-const append = /*#__PURE__*/dual(2, (self, a) => appendAll$1(self, of$1(a)));
+const append$1 = /*#__PURE__*/dual(2, (self, a) => appendAll$1(self, of$1(a)));
 /**
  * Prepend an element to the front of a `Chunk`, creating a new `NonEmptyChunk`.
  *
@@ -3823,7 +3795,7 @@ const appendAll$1 = /*#__PURE__*/dual(2, (self, that) => {
  * @since 2.0.0
  * @category elements
  */
-const isEmpty$3 = self => self.length === 0;
+const isEmpty$4 = self => self.length === 0;
 /**
  * Determines if the chunk is not empty.
  *
@@ -3858,7 +3830,7 @@ const tailNonEmpty = self => drop(self, 1);
 /**
  * @since 2.0.0
  */
-const TypeId$5 = /*#__PURE__*/Symbol.for("effect/Duration");
+const TypeId$7 = /*#__PURE__*/Symbol.for("effect/Duration");
 const bigint0$1 = /*#__PURE__*/BigInt(0);
 const bigint24 = /*#__PURE__*/BigInt(24);
 const bigint60 = /*#__PURE__*/BigInt(60);
@@ -3927,7 +3899,7 @@ const infinityValue = {
   _tag: "Infinity"
 };
 const DurationProto = {
-  [TypeId$5]: TypeId$5,
+  [TypeId$7]: TypeId$7,
   [symbol$1]() {
     return cached(this, structure(this.value));
   },
@@ -3965,7 +3937,7 @@ const DurationProto = {
     return pipeArguments(this, arguments);
   }
 };
-const make$h = input => {
+const make$k = input => {
   const duration = Object.create(DurationProto);
   if (isNumber(input)) {
     if (isNaN(input) || input <= 0) {
@@ -3997,7 +3969,7 @@ const make$h = input => {
  * @since 2.0.0
  * @category guards
  */
-const isDuration = u => hasProperty(u, TypeId$5);
+const isDuration = u => hasProperty(u, TypeId$7);
 /**
  * @since 3.5.0
  * @category guards
@@ -4022,52 +3994,52 @@ const isZero = self => {
  * @since 2.0.0
  * @category constructors
  */
-const zero = /*#__PURE__*/make$h(0);
+const zero = /*#__PURE__*/make$k(0);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const infinity = /*#__PURE__*/make$h(Infinity);
+const infinity = /*#__PURE__*/make$k(Infinity);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const nanos = nanos => make$h(nanos);
+const nanos = nanos => make$k(nanos);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const micros = micros => make$h(micros * bigint1e3);
+const micros = micros => make$k(micros * bigint1e3);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const millis = millis => make$h(millis);
+const millis = millis => make$k(millis);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const seconds = seconds => make$h(seconds * 1000);
+const seconds = seconds => make$k(seconds * 1000);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const minutes = minutes => make$h(minutes * 60_000);
+const minutes = minutes => make$k(minutes * 60_000);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const hours = hours => make$h(hours * 3_600_000);
+const hours = hours => make$k(hours * 3_600_000);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const days = days => make$h(days * 86_400_000);
+const days = days => make$k(days * 86_400_000);
 /**
  * @since 2.0.0
  * @category constructors
  */
-const weeks = weeks => make$h(weeks * 604_800_000);
+const weeks = weeks => make$k(weeks * 604_800_000);
 /**
  * @since 2.0.0
  * @category getters
@@ -4286,7 +4258,7 @@ function fromBitmap(bitmap, bit) {
   return popcount(bitmap & bit - 1);
 }
 
-const make$g = (value, previous) => ({
+const make$j = (value, previous) => ({
   value,
   previous
 });
@@ -4572,7 +4544,7 @@ function mergeLeaves(edit, shift, h1, n1, h2, n2) {
   while (true) {
     const res = mergeLeavesInner(edit, currentShift, h1, n1, h2, n2);
     if (typeof res === "function") {
-      stack = make$g(res, stack);
+      stack = make$j(res, stack);
       currentShift = currentShift + SIZE;
     } else {
       let final = res;
@@ -4707,10 +4679,10 @@ const visitLazyChildren = (len, children, i, f, cont) => {
 };
 const _empty$4 = /*#__PURE__*/makeImpl$1(false, 0, /*#__PURE__*/new EmptyNode(), 0);
 /** @internal */
-const empty$f = () => _empty$4;
+const empty$g = () => _empty$4;
 /** @internal */
 const fromIterable$4 = entries => {
-  const map = beginMutation$1(empty$f());
+  const map = beginMutation$1(empty$g());
   for (const entry of entries) {
     set$3(map, entry[0], entry[1]);
   }
@@ -4719,7 +4691,7 @@ const fromIterable$4 = entries => {
 /** @internal */
 const isHashMap = u => hasProperty(u, HashMapTypeId);
 /** @internal */
-const isEmpty$2 = self => self && isEmptyNode(self._root);
+const isEmpty$3 = self => self && isEmptyNode(self._root);
 /** @internal */
 const get$4 = /*#__PURE__*/dual(2, (self, key) => getHash(self, key, hash(key)));
 /** @internal */
@@ -4805,14 +4777,14 @@ const modifyHash = /*#__PURE__*/dual(4, (self, key, hash, f) => {
   return pipe(self, setTree(newRoot, size.value));
 });
 /** @internal */
-const remove$3 = /*#__PURE__*/dual(2, (self, key) => modifyAt$1(self, key, none$4));
+const remove$4 = /*#__PURE__*/dual(2, (self, key) => modifyAt$1(self, key, none$4));
 /**
  * Maps over the entries of the `HashMap` using the specified function.
  *
  * @since 2.0.0
  * @category mapping
  */
-const map$2 = /*#__PURE__*/dual(2, (self, f) => reduce$5(self, empty$f(), (map, value, key) => set$3(map, key, f(value, key))));
+const map$2 = /*#__PURE__*/dual(2, (self, f) => reduce$5(self, empty$g(), (map, value, key) => set$3(map, key, f(value, key))));
 /** @internal */
 const forEach$2 = /*#__PURE__*/dual(2, (self, f) => reduce$5(self, void 0, (_, value, key) => f(value, key)));
 /** @internal */
@@ -4884,20 +4856,20 @@ const makeImpl = keyMap => {
 };
 /** @internal */
 const isHashSet = u => hasProperty(u, HashSetTypeId);
-const _empty$3 = /*#__PURE__*/makeImpl(/*#__PURE__*/empty$f());
+const _empty$3 = /*#__PURE__*/makeImpl(/*#__PURE__*/empty$g());
 /** @internal */
-const empty$e = () => _empty$3;
+const empty$f = () => _empty$3;
 /** @internal */
 const fromIterable$3 = elements => {
-  const set = beginMutation(empty$e());
+  const set = beginMutation(empty$f());
   for (const value of elements) {
     add$1(set, value);
   }
   return endMutation(set);
 };
 /** @internal */
-const make$f = (...elements) => {
-  const set = beginMutation(empty$e());
+const make$i = (...elements) => {
+  const set = beginMutation(empty$f());
   for (const value of elements) {
     add$1(set, value);
   }
@@ -4923,15 +4895,15 @@ const mutate = /*#__PURE__*/dual(2, (self, f) => {
 /** @internal */
 const add$1 = /*#__PURE__*/dual(2, (self, value) => self._keyMap._editable ? (set$3(value, true)(self._keyMap), self) : makeImpl(set$3(value, true)(self._keyMap)));
 /** @internal */
-const remove$2 = /*#__PURE__*/dual(2, (self, value) => self._keyMap._editable ? (remove$3(value)(self._keyMap), self) : makeImpl(remove$3(value)(self._keyMap)));
+const remove$3 = /*#__PURE__*/dual(2, (self, value) => self._keyMap._editable ? (remove$4(value)(self._keyMap), self) : makeImpl(remove$4(value)(self._keyMap)));
 /** @internal */
 const difference$1 = /*#__PURE__*/dual(2, (self, that) => mutate(self, set => {
   for (const value of that) {
-    remove$2(set, value);
+    remove$3(set, value);
   }
 }));
 /** @internal */
-const union$1 = /*#__PURE__*/dual(2, (self, that) => mutate(empty$e(), set => {
+const union$1 = /*#__PURE__*/dual(2, (self, that) => mutate(empty$f(), set => {
   forEach$1(self, value => add$1(set, value));
   for (const value of that) {
     add$1(set, value);
@@ -5222,7 +5194,7 @@ const reduce$4 = /*#__PURE__*/dual(3, (self, zero, f) => reduce$5(self._keyMap,
  *
  * @see Other `HashSet` constructors are {@link module:HashSet.make} {@link module:HashSet.fromIterable}
  */
-const empty$d = empty$e;
+const empty$e = empty$f;
 /**
  * Creates a new `HashSet` from an iterable collection of values.
  *
@@ -5404,7 +5376,7 @@ const fromIterable$2 = fromIterable$3;
  *
  * @see Other `HashSet` constructors are {@link module:HashSet.fromIterable} {@link module:HashSet.empty}
  */
-const make$e = make$f;
+const make$h = make$i;
 /**
  * Checks if the specified value exists in the `HashSet`.
  *
@@ -5516,7 +5488,7 @@ const add = add$1;
  *
  * @see Other `HashSet` mutations are {@link module:HashSet.add} {@link module:HashSet.toggle} {@link module:HashSet.beginMutation} {@link module:HashSet.endMutation} {@link module:HashSet.mutate}
  */
-const remove$1 = remove$2;
+const remove$2 = remove$3;
 /**
  * Computes the set difference `(A - B)` between this `HashSet` and the
  * specified `Iterable<A>`.
@@ -5610,9 +5582,9 @@ const reduce$3 = reduce$4;
 /**
  * @since 2.0.0
  */
-const TypeId$4 = /*#__PURE__*/Symbol.for("effect/MutableRef");
+const TypeId$6 = /*#__PURE__*/Symbol.for("effect/MutableRef");
 const MutableRefProto = {
-  [TypeId$4]: TypeId$4,
+  [TypeId$6]: TypeId$6,
   toString() {
     return format$2(this.toJSON());
   },
@@ -5633,7 +5605,7 @@ const MutableRefProto = {
  * @since 2.0.0
  * @category constructors
  */
-const make$d = value => {
+const make$g = value => {
   const ref = Object.create(MutableRefProto);
   ref.current = value;
   return ref;
@@ -5739,11 +5711,11 @@ const ids = self => {
   switch (self._tag) {
     case OP_NONE:
       {
-        return empty$d();
+        return empty$e();
       }
     case OP_RUNTIME:
       {
-        return make$e(self.id);
+        return make$h(self.id);
       }
     case OP_COMPOSITE:
       {
@@ -5751,14 +5723,14 @@ const ids = self => {
       }
   }
 };
-const _fiberCounter = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/Fiber/Id/_fiberCounter"), () => make$d(0));
+const _fiberCounter = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/Fiber/Id/_fiberCounter"), () => make$g(0));
 /** @internal */
 const threadName$1 = self => {
   const identifiers = Array.from(ids(self)).map(n => `#${n}`).join(",");
   return identifiers;
 };
 /** @internal */
-const unsafeMake$4 = () => {
+const unsafeMake$5 = () => {
   const id = get$3(_fiberCounter);
   pipe(_fiberCounter, set$2(id + 1));
   return new Runtime(id, Date.now());
@@ -5783,7 +5755,7 @@ const threadName = threadName$1;
  * @since 2.0.0
  * @category unsafe
  */
-const unsafeMake$3 = unsafeMake$4;
+const unsafeMake$4 = unsafeMake$5;
 
 /**
  * @since 2.0.0
@@ -5794,7 +5766,7 @@ const unsafeMake$3 = unsafeMake$4;
  * @since 2.0.0
  * @category constructors
  */
-const empty$c = empty$f;
+const empty$d = empty$g;
 /**
  * Creates a new `HashMap` from an iterable collection of key/value pairs.
  *
@@ -5808,7 +5780,7 @@ const fromIterable$1 = fromIterable$4;
  * @since 2.0.0
  * @category elements
  */
-const isEmpty$1 = isEmpty$2;
+const isEmpty$2 = isEmpty$3;
 /**
  * Safely lookup the value for the specified key in the `HashMap` using the
  * internal hashing function.
@@ -5883,7 +5855,7 @@ const reduce$2 = reduce$5;
  * @since 2.0.0
  * @category symbol
  */
-const TypeId$3 = /*#__PURE__*/Symbol.for("effect/List");
+const TypeId$5 = /*#__PURE__*/Symbol.for("effect/List");
 /**
  * Converts the specified `List` to an `Array`.
  *
@@ -5898,7 +5870,7 @@ const toArray = self => fromIterable$6(self);
 const getEquivalence = isEquivalent => mapInput$1(getEquivalence$2(isEquivalent), toArray);
 const _equivalence = /*#__PURE__*/getEquivalence(equals$1);
 const ConsProto = {
-  [TypeId$3]: TypeId$3,
+  [TypeId$5]: TypeId$5,
   _tag: "Cons",
   toString() {
     return format$2(this.toJSON());
@@ -5962,7 +5934,7 @@ const makeCons = (head, tail) => {
 };
 const NilHash = /*#__PURE__*/string("Nil");
 const NilProto = {
-  [TypeId$3]: TypeId$3,
+  [TypeId$5]: TypeId$5,
   _tag: "Nil",
   toString() {
     return format$2(this.toJSON());
@@ -6003,7 +5975,7 @@ const _Nil = /*#__PURE__*/Object.create(NilProto);
  * @since 2.0.0
  * @category refinements
  */
-const isList = u => hasProperty(u, TypeId$3);
+const isList = u => hasProperty(u, TypeId$5);
 /**
  * Returns `true` if the specified value is a `List.Nil<A>`, `false` otherwise.
  *
@@ -6040,7 +6012,7 @@ const cons = (head, tail) => makeCons(head, tail);
  * @since 2.0.0
  * @category constructors
  */
-const empty$b = nil;
+const empty$c = nil;
 /**
  * Constructs a new `List<A>` from the specified value.
  *
@@ -6133,7 +6105,7 @@ const reduce$1 = /*#__PURE__*/dual(3, (self, zero, f) => {
  * @category elements
  */
 const reverse = self => {
-  let result = empty$b();
+  let result = empty$c();
   let these = self;
   while (!isNil(these)) {
     result = prepend(result, these.head);
@@ -6175,7 +6147,7 @@ const _empty$2 = /*#__PURE__*/Object.create(EmptyProto$2);
 /**
  * @internal
  */
-const empty$a = () => _empty$2;
+const empty$b = () => _empty$2;
 const AndThenProto$2 = /*#__PURE__*/Object.assign(/*#__PURE__*/Object.create(PatchProto$2), {
   _tag: "AndThen"
 });
@@ -6214,7 +6186,7 @@ const makeUpdateService = (key, update) => {
 /** @internal */
 const diff$6 = (oldValue, newValue) => {
   const missingServices = new Map(oldValue.unsafeMap);
-  let patch = empty$a();
+  let patch = empty$b();
   for (const [tag, newService] of newValue.unsafeMap.entries()) {
     if (missingServices.has(tag)) {
       const old = missingServices.get(tag);
@@ -6312,7 +6284,7 @@ const EmptyProto$1 = /*#__PURE__*/Object.assign(/*#__PURE__*/Object.create(Patch
 });
 const _empty$1 = /*#__PURE__*/Object.create(EmptyProto$1);
 /** @internal */
-const empty$9 = () => _empty$1;
+const empty$a = () => _empty$1;
 const AndThenProto$1 = /*#__PURE__*/Object.assign(/*#__PURE__*/Object.create(PatchProto$1), {
   _tag: "AndThen"
 });
@@ -6343,9 +6315,9 @@ const makeRemove = value => {
 };
 /** @internal */
 const diff$5 = (oldValue, newValue) => {
-  const [removed, patch] = reduce$3([oldValue, empty$9()], ([set, patch], value) => {
+  const [removed, patch] = reduce$3([oldValue, empty$a()], ([set, patch], value) => {
     if (has$1(value)(set)) {
-      return [remove$1(value)(set), patch];
+      return [remove$2(value)(set), patch];
     }
     return [set, combine$3(makeAdd(value))(patch)];
   })(newValue);
@@ -6382,7 +6354,7 @@ const patch$6 = /*#__PURE__*/dual(2, (self, oldValue) => {
         }
       case "Remove":
         {
-          set = remove$1(head.value)(set);
+          set = remove$2(head.value)(set);
           patches = tail;
         }
     }
@@ -6409,7 +6381,7 @@ const _empty = /*#__PURE__*/Object.create(EmptyProto);
 /**
  * @internal
  */
-const empty$8 = () => _empty;
+const empty$9 = () => _empty;
 const AndThenProto = /*#__PURE__*/Object.assign(/*#__PURE__*/Object.create(PatchProto), {
   _tag: "AndThen"
 });
@@ -6448,7 +6420,7 @@ const makeUpdate = (index, patch) => {
 /** @internal */
 const diff$4 = options => {
   let i = 0;
-  let patch = empty$8();
+  let patch = empty$9();
   while (i < options.oldValue.length && i < options.newValue.length) {
     const oldElement = options.oldValue[i];
     const newElement = options.newValue[i];
@@ -6528,7 +6500,7 @@ const DifferProto = {
   }
 };
 /** @internal */
-const make$c = params => {
+const make$f = params => {
   const differ = Object.create(DifferProto);
   differ.empty = params.empty;
   differ.diff = params.diff;
@@ -6537,22 +6509,22 @@ const make$c = params => {
   return differ;
 };
 /** @internal */
-const environment = () => make$c({
-  empty: empty$a(),
+const environment = () => make$f({
+  empty: empty$b(),
   combine: (first, second) => combine$4(second)(first),
   diff: (oldValue, newValue) => diff$6(oldValue, newValue),
   patch: (patch, oldValue) => patch$7(oldValue)(patch)
 });
 /** @internal */
-const hashSet = () => make$c({
-  empty: empty$9(),
+const hashSet = () => make$f({
+  empty: empty$a(),
   combine: (first, second) => combine$3(second)(first),
   diff: (oldValue, newValue) => diff$5(oldValue, newValue),
   patch: (patch, oldValue) => patch$6(oldValue)(patch)
 });
 /** @internal */
-const readonlyArray = differ => make$c({
-  empty: empty$8(),
+const readonlyArray = differ => make$f({
+  empty: empty$9(),
   combine: (first, second) => combine$2(first, second),
   diff: (oldValue, newValue) => diff$4({
     oldValue,
@@ -6564,7 +6536,7 @@ const readonlyArray = differ => make$c({
 /** @internal */
 const update$1 = () => updateWith((_, a) => a);
 /** @internal */
-const updateWith = f => make$c({
+const updateWith = f => make$f({
   empty: identity,
   combine: (first, second) => {
     if (first === identity) {
@@ -6593,15 +6565,15 @@ const active = patch => patch & BIT_MASK;
 /** @internal */
 const enabled = patch => patch >> BIT_SHIFT & BIT_MASK;
 /** @internal */
-const make$b = (active, enabled) => (active & BIT_MASK) + ((enabled & active & BIT_MASK) << BIT_SHIFT);
+const make$e = (active, enabled) => (active & BIT_MASK) + ((enabled & active & BIT_MASK) << BIT_SHIFT);
 /** @internal */
-const empty$7 = /*#__PURE__*/make$b(0, 0);
+const empty$8 = /*#__PURE__*/make$e(0, 0);
 /** @internal */
-const enable$2 = flag => make$b(flag, flag);
+const enable$2 = flag => make$e(flag, flag);
 /** @internal */
-const disable$1 = flag => make$b(flag, 0);
+const disable$1 = flag => make$e(flag, 0);
 /** @internal */
-const exclude$1 = /*#__PURE__*/dual(2, (self, flag) => make$b(active(self) & ~flag, enabled(self)));
+const exclude$1 = /*#__PURE__*/dual(2, (self, flag) => make$e(active(self) & ~flag, enabled(self)));
 /** @internal */
 const andThen = /*#__PURE__*/dual(2, (self, that) => self | that);
 /** @internal */
@@ -6630,19 +6602,19 @@ const interruption = self => isEnabled(self, Interruption);
 /** @internal */
 const isEnabled = /*#__PURE__*/dual(2, (self, flag) => (self & flag) !== 0);
 /** @internal */
-const make$a = (...flags) => flags.reduce((a, b) => a | b, 0);
+const make$d = (...flags) => flags.reduce((a, b) => a | b, 0);
 /** @internal */
-const none$1 = /*#__PURE__*/make$a(None$1);
+const none$1 = /*#__PURE__*/make$d(None$1);
 /** @internal */
 const runtimeMetrics = self => isEnabled(self, RuntimeMetrics);
 const windDown = self => isEnabled(self, WindDown);
 /** @internal */
-const diff$3 = /*#__PURE__*/dual(2, (self, that) => make$b(self ^ that, that));
+const diff$3 = /*#__PURE__*/dual(2, (self, that) => make$e(self ^ that, that));
 /** @internal */
 const patch$4 = /*#__PURE__*/dual(2, (self, patch) => self & (invert(active(patch)) | enabled(patch)) | active(patch) & enabled(patch));
 /** @internal */
-const differ$1 = /*#__PURE__*/make$c({
-  empty: empty$7,
+const differ$1 = /*#__PURE__*/make$f({
+  empty: empty$8,
   diff: (oldValue, newValue) => diff$3(oldValue, newValue),
   combine: (first, second) => andThen(second)(first),
   patch: (_patch, oldValue) => patch$4(oldValue, _patch)
@@ -6704,10 +6676,10 @@ const seq = (self, that) => ({
  */
 const flatten$1 = self => {
   let current = of(self);
-  let updated = empty$b();
+  let updated = empty$c();
   // eslint-disable-next-line no-constant-condition
   while (1) {
-    const [parallel, sequential] = reduce$1(current, [parallelCollectionEmpty(), empty$b()], ([parallel, sequential], blockedRequest) => {
+    const [parallel, sequential] = reduce$1(current, [parallelCollectionEmpty(), empty$c()], ([parallel, sequential], blockedRequest) => {
       const [par, seq] = step$1(blockedRequest);
       return [parallelCollectionCombine(parallel, par), appendAll(sequential, seq)];
     });
@@ -6728,8 +6700,8 @@ const flatten$1 = self => {
 const step$1 = requests => {
   let current = requests;
   let parallel = parallelCollectionEmpty();
-  let stack = empty$b();
-  let sequential = empty$b();
+  let stack = empty$c();
+  let sequential = empty$c();
   // eslint-disable-next-line no-constant-condition
   while (1) {
     switch (current._tag) {
@@ -6829,16 +6801,16 @@ class ParallelImpl {
   }
 }
 /** @internal */
-const parallelCollectionEmpty = () => new ParallelImpl(empty$c());
+const parallelCollectionEmpty = () => new ParallelImpl(empty$d());
 /** @internal */
-const parallelCollectionAdd = (self, blockedRequest) => new ParallelImpl(modifyAt(self.map, blockedRequest.dataSource, _ => orElseSome(map$4(_, append(blockedRequest.blockedRequest)), () => of$1(blockedRequest.blockedRequest))));
+const parallelCollectionAdd = (self, blockedRequest) => new ParallelImpl(modifyAt(self.map, blockedRequest.dataSource, _ => orElseSome(map$4(_, append$1(blockedRequest.blockedRequest)), () => of$1(blockedRequest.blockedRequest))));
 /** @internal */
 const parallelCollectionCombine = (self, that) => new ParallelImpl(reduce$2(self.map, that.map, (map, value, key) => set$1(map, key, match$3(get$2(map, key), {
   onNone: () => value,
   onSome: other => appendAll$1(value, other)
 }))));
 /** @internal */
-const parallelCollectionIsEmpty = self => isEmpty$1(self.map);
+const parallelCollectionIsEmpty = self => isEmpty$2(self.map);
 /** @internal */
 const parallelCollectionKeys = self => Array.from(keys(self.map));
 /** @internal */
@@ -6865,7 +6837,7 @@ class SequentialImpl {
 const sequentialCollectionMake = map => new SequentialImpl(map);
 /** @internal */
 const sequentialCollectionCombine = (self, that) => new SequentialImpl(reduce$2(that.map, self.map, (map, value, key) => set$1(map, key, match$3(get$2(map, key), {
-  onNone: () => empty$g(),
+  onNone: () => empty$h(),
   onSome: a => appendAll$1(a, value)
 }))));
 /** @internal */
@@ -6955,13 +6927,13 @@ const proto$1 = {
 // Constructors
 // -----------------------------------------------------------------------------
 /** @internal */
-const empty$6 = /*#__PURE__*/(() => {
+const empty$7 = /*#__PURE__*/(() => {
   const o = /*#__PURE__*/Object.create(proto$1);
   o._tag = OP_EMPTY$2;
   return o;
 })();
 /** @internal */
-const fail$1 = error => {
+const fail$2 = error => {
   const o = Object.create(proto$1);
   o._tag = OP_FAIL$1;
   o.error = error;
@@ -6975,7 +6947,7 @@ const die$1 = defect => {
   return o;
 };
 /** @internal */
-const interrupt = fiberId => {
+const interrupt$1 = fiberId => {
   const o = Object.create(proto$1);
   o._tag = OP_INTERRUPT;
   o.fiberId = fiberId;
@@ -7005,7 +6977,7 @@ const isCause = u => hasProperty(u, CauseTypeId);
 /** @internal */
 const isEmptyType = self => self._tag === OP_EMPTY$2;
 /** @internal */
-const isEmpty = self => {
+const isEmpty$1 = self => {
   if (self._tag === OP_EMPTY$2) {
     return true;
   }
@@ -7033,11 +7005,11 @@ const isInterrupted = self => isSome(interruptOption(self));
 /** @internal */
 const isInterruptedOnly = self => reduceWithContext(undefined, IsInterruptedOnlyCauseReducer)(self);
 /** @internal */
-const failures = self => reverse$1(reduce(self, empty$g(), (list, cause) => cause._tag === OP_FAIL$1 ? some(pipe(list, prepend$1(cause.error))) : none$4()));
+const failures = self => reverse$1(reduce(self, empty$h(), (list, cause) => cause._tag === OP_FAIL$1 ? some(pipe(list, prepend$1(cause.error))) : none$4()));
 /** @internal */
-const defects = self => reverse$1(reduce(self, empty$g(), (list, cause) => cause._tag === OP_DIE ? some(pipe(list, prepend$1(cause.defect))) : none$4()));
+const defects = self => reverse$1(reduce(self, empty$h(), (list, cause) => cause._tag === OP_DIE ? some(pipe(list, prepend$1(cause.defect))) : none$4()));
 /** @internal */
-const interruptors = self => reduce(self, empty$d(), (set, cause) => cause._tag === OP_INTERRUPT ? some(pipe(set, add(cause.fiberId))) : none$4());
+const interruptors = self => reduce(self, empty$e(), (set, cause) => cause._tag === OP_INTERRUPT ? some(pipe(set, add(cause.fiberId))) : none$4());
 /** @internal */
 const failureOption = self => find(self, cause => cause._tag === OP_FAIL$1 ? some(cause.error) : none$4());
 /** @internal */
@@ -7058,29 +7030,20 @@ const failureOrCause = self => {
 /** @internal */
 const interruptOption = self => find(self, cause => cause._tag === OP_INTERRUPT ? some(cause.fiberId) : none$4());
 /** @internal */
-const keepDefectsAndElectFailures = self => match$1(self, {
-  onEmpty: none$4(),
-  onFail: failure => some(die$1(failure)),
-  onDie: defect => some(die$1(defect)),
-  onInterrupt: () => none$4(),
-  onSequential: mergeWith(sequential$2),
-  onParallel: mergeWith(parallel$2)
-});
-/** @internal */
 const stripFailures = self => match$1(self, {
-  onEmpty: empty$6,
-  onFail: () => empty$6,
+  onEmpty: empty$7,
+  onFail: () => empty$7,
   onDie: die$1,
-  onInterrupt: interrupt,
+  onInterrupt: interrupt$1,
   onSequential: sequential$2,
   onParallel: parallel$2
 });
 /** @internal */
 const electFailures = self => match$1(self, {
-  onEmpty: empty$6,
+  onEmpty: empty$7,
   onFail: die$1,
   onDie: die$1,
-  onInterrupt: interrupt,
+  onInterrupt: interrupt$1,
   onSequential: sequential$2,
   onParallel: parallel$2
 });
@@ -7089,11 +7052,11 @@ const causeEquals = (left, right) => {
   let leftStack = of$1(left);
   let rightStack = of$1(right);
   while (isNonEmpty(leftStack) && isNonEmpty(rightStack)) {
-    const [leftParallel, leftSequential] = pipe(headNonEmpty(leftStack), reduce([empty$d(), empty$g()], ([parallel, sequential], cause) => {
+    const [leftParallel, leftSequential] = pipe(headNonEmpty(leftStack), reduce([empty$e(), empty$h()], ([parallel, sequential], cause) => {
       const [par, seq] = evaluateCause(cause);
       return some([pipe(parallel, union(par)), pipe(sequential, appendAll$1(seq))]);
     }));
-    const [rightParallel, rightSequential] = pipe(headNonEmpty(rightStack), reduce([empty$d(), empty$g()], ([parallel, sequential], cause) => {
+    const [rightParallel, rightSequential] = pipe(headNonEmpty(rightStack), reduce([empty$e(), empty$h()], ([parallel, sequential], cause) => {
       const [par, seq] = evaluateCause(cause);
       return some([pipe(parallel, union(par)), pipe(sequential, appendAll$1(seq))]);
     }));
@@ -7116,18 +7079,18 @@ const causeEquals = (left, right) => {
  * @internal
  */
 const flattenCause = cause => {
-  return flattenCauseLoop(of$1(cause), empty$g());
+  return flattenCauseLoop(of$1(cause), empty$h());
 };
 /** @internal */
 const flattenCauseLoop = (causes, flattened) => {
   // eslint-disable-next-line no-constant-condition
   while (1) {
-    const [parallel, sequential] = pipe(causes, reduce$6([empty$d(), empty$g()], ([parallel, sequential], cause) => {
+    const [parallel, sequential] = pipe(causes, reduce$6([empty$e(), empty$h()], ([parallel, sequential], cause) => {
       const [par, seq] = evaluateCause(cause);
       return [pipe(parallel, union(par)), pipe(sequential, appendAll$1(seq))];
     }));
     const updated = size$1(parallel) > 0 ? pipe(flattened, prepend$1(parallel)) : flattened;
-    if (isEmpty$3(sequential)) {
+    if (isEmpty$4(sequential)) {
       return reverse$1(updated);
     }
     causes = sequential;
@@ -7178,8 +7141,8 @@ const find = /*#__PURE__*/dual(2, (self, pf) => {
 const evaluateCause = self => {
   let cause = self;
   const stack = [];
-  let _parallel = empty$d();
-  let _sequential = empty$g();
+  let _parallel = empty$e();
+  let _sequential = empty$h();
   while (cause !== undefined) {
     switch (cause._tag) {
       case OP_EMPTY$2:
@@ -7192,7 +7155,7 @@ const evaluateCause = self => {
         }
       case OP_FAIL$1:
         {
-          _parallel = add(_parallel, make$i(cause._tag, cause.error));
+          _parallel = add(_parallel, make$l(cause._tag, cause.error));
           if (stack.length === 0) {
             return [_parallel, _sequential];
           }
@@ -7201,7 +7164,7 @@ const evaluateCause = self => {
         }
       case OP_DIE:
         {
-          _parallel = add(_parallel, make$i(cause._tag, cause.defect));
+          _parallel = add(_parallel, make$l(cause._tag, cause.defect));
           if (stack.length === 0) {
             return [_parallel, _sequential];
           }
@@ -7210,7 +7173,7 @@ const evaluateCause = self => {
         }
       case OP_INTERRUPT:
         {
-          _parallel = add(_parallel, make$i(cause._tag, cause.fiberId));
+          _parallel = add(_parallel, make$l(cause._tag, cause.fiberId));
           if (stack.length === 0) {
             return [_parallel, _sequential];
           }
@@ -7570,14 +7533,14 @@ const deferredVariance = {
   _A: _ => _
 };
 /** @internal */
-const pending = joiners => {
+const pending$1 = joiners => {
   return {
     _tag: OP_STATE_PENDING,
     joiners
   };
 };
 /** @internal */
-const done$2 = effect => {
+const done$3 = effect => {
   return {
     _tag: OP_STATE_DONE,
     effect
@@ -7789,8 +7752,8 @@ const withFiberRuntime = withRuntime => {
   return effect;
 };
 /* @internal */
-const acquireUseRelease = /*#__PURE__*/dual(3, (acquire, use, release) => uninterruptibleMask$1(restore => flatMap$1(acquire, a => flatMap$1(exit(suspend(() => restore(use(a)))), exit => {
-  return suspend(() => release(a, exit)).pipe(matchCauseEffect$1({
+const acquireUseRelease = /*#__PURE__*/dual(3, (acquire, use, release) => uninterruptibleMask$1(restore => flatMap$1(acquire, a => flatMap$1(exit(suspend$1(() => restore(use(a)))), exit => {
+  return suspend$1(() => release(a, exit)).pipe(matchCauseEffect$1({
     onFailure: cause => {
       switch (exit._tag) {
         case OP_FAILURE:
@@ -7803,7 +7766,7 @@ const acquireUseRelease = /*#__PURE__*/dual(3, (acquire, use, release) => uninte
   }));
 }))));
 /* @internal */
-const as = /*#__PURE__*/dual(2, (self, value) => flatMap$1(self, () => succeed$2(value)));
+const as = /*#__PURE__*/dual(2, (self, value) => flatMap$1(self, () => succeed$3(value)));
 /* @internal */
 const asVoid = self => as(self, void 0);
 /* @internal */
@@ -7849,7 +7812,7 @@ const unsafeAsync = (register, blockingOn = none$2) => {
   return onInterrupt(effect, _ => isEffect(cancelerRef) ? cancelerRef : void_$1);
 };
 /* @internal */
-const asyncInterrupt = (register, blockingOn = none$2) => suspend(() => unsafeAsync(register, blockingOn));
+const asyncInterrupt = (register, blockingOn = none$2) => suspend$1(() => unsafeAsync(register, blockingOn));
 const async_ = (resume, blockingOn = none$2) => {
   return custom(resume, function () {
     let backingResume = undefined;
@@ -7888,7 +7851,7 @@ const async_ = (resume, blockingOn = none$2) => {
 /* @internal */
 const catchAll$1 = /*#__PURE__*/dual(2, (self, f) => matchEffect(self, {
   onFailure: f,
-  onSuccess: succeed$2
+  onSuccess: succeed$3
 }));
 const originalSymbol = /*#__PURE__*/Symbol.for("effect/OriginalAnnotation");
 /* @internal */
@@ -7918,8 +7881,8 @@ const die = defect => isObject(defect) && !(spanSymbol in defect) ? withFiberRun
 const dieMessage = message => failCauseSync(() => die$1(new RuntimeException(message)));
 /* @internal */
 const either = self => matchEffect(self, {
-  onFailure: e => succeed$2(left(e)),
-  onSuccess: a => succeed$2(right(a))
+  onFailure: e => succeed$3(left(e)),
+  onSuccess: a => succeed$3(right(a))
 });
 /* @internal */
 const exit = self => matchCause(self, {
@@ -7927,9 +7890,9 @@ const exit = self => matchCause(self, {
   onSuccess: exitSucceed$1
 });
 /* @internal */
-const fail = error => isObject(error) && !(spanSymbol in error) ? withFiberRuntime(fiber => failCause$1(fail$1(capture(error, currentSpanFromFiber(fiber))))) : failCause$1(fail$1(error));
+const fail$1 = error => isObject(error) && !(spanSymbol in error) ? withFiberRuntime(fiber => failCause$1(fail$2(capture(error, currentSpanFromFiber(fiber))))) : failCause$1(fail$2(error));
 /* @internal */
-const failSync = evaluate => flatMap$1(sync(evaluate), fail);
+const failSync = evaluate => flatMap$1(sync(evaluate), fail$1);
 /* @internal */
 const failCause$1 = cause => {
   const effect = new EffectPrimitiveFailure(OP_FAILURE);
@@ -7939,7 +7902,7 @@ const failCause$1 = cause => {
 /* @internal */
 const failCauseSync = evaluate => flatMap$1(sync(evaluate), failCause$1);
 /* @internal */
-const fiberId = /*#__PURE__*/withFiberRuntime(state => succeed$2(state.id()));
+const fiberId = /*#__PURE__*/withFiberRuntime(state => succeed$3(state.id()));
 /* @internal */
 const fiberIdWith = f => withFiberRuntime(state => f(state.id()));
 /* @internal */
@@ -7959,8 +7922,8 @@ const step = self => {
 const flatten = self => flatMap$1(self, identity);
 /* @internal */
 const matchCause = /*#__PURE__*/dual(2, (self, options) => matchCauseEffect$1(self, {
-  onFailure: cause => succeed$2(options.onFailure(cause)),
-  onSuccess: a => succeed$2(options.onSuccess(a))
+  onFailure: cause => succeed$3(options.onFailure(cause)),
+  onSuccess: a => succeed$3(options.onSuccess(a))
 }));
 /* @internal */
 const matchCauseEffect$1 = /*#__PURE__*/dual(2, (self, options) => {
@@ -7986,7 +7949,7 @@ const matchEffect = /*#__PURE__*/dual(2, (self, options) => matchCauseEffect$1(s
   onSuccess: options.onSuccess
 }));
 /* @internal */
-const forEachSequential = /*#__PURE__*/dual(2, (self, f) => suspend(() => {
+const forEachSequential = /*#__PURE__*/dual(2, (self, f) => suspend$1(() => {
   const arr = fromIterable$6(self);
   const ret = allocate(arr.length);
   let i = 0;
@@ -7999,7 +7962,7 @@ const forEachSequential = /*#__PURE__*/dual(2, (self, f) => suspend(() => {
   }), ret);
 }));
 /* @internal */
-const forEachSequentialDiscard = /*#__PURE__*/dual(2, (self, f) => suspend(() => {
+const forEachSequentialDiscard = /*#__PURE__*/dual(2, (self, f) => suspend$1(() => {
   const arr = fromIterable$6(self);
   let i = 0;
   return whileLoop({
@@ -8011,7 +7974,7 @@ const forEachSequentialDiscard = /*#__PURE__*/dual(2, (self, f) => suspend(() =>
   });
 }));
 /* @internal */
-const interruptWith = fiberId => failCause$1(interrupt(fiberId));
+const interruptWith = fiberId => failCause$1(interrupt$1(fiberId));
 /* @internal */
 const interruptible$1 = self => {
   const effect = new EffectPrimitive(OP_UPDATE_RUNTIME_FLAGS);
@@ -8041,7 +8004,7 @@ const mapError = /*#__PURE__*/dual(2, (self, f) => matchCauseEffect$1(self, {
         }
     }
   },
-  onSuccess: succeed$2
+  onSuccess: succeed$3
 }));
 /* @internal */
 const onExit$1 = /*#__PURE__*/dual(2, (self, cleanup) => uninterruptibleMask$1(restore => matchCauseEffect$1(restore(self), {
@@ -8063,15 +8026,13 @@ const onInterrupt = /*#__PURE__*/dual(2, (self, cleanup) => onExit$1(self, exitM
   onSuccess: () => void_$1
 })));
 /* @internal */
-const orElse = /*#__PURE__*/dual(2, (self, that) => attemptOrElse(self, that, succeed$2));
-/* @internal */
-const succeed$2 = value => {
+const succeed$3 = value => {
   const effect = new EffectPrimitiveSuccess(OP_SUCCESS);
   effect.effect_instruction_i0 = value;
   return effect;
 };
 /* @internal */
-const suspend = evaluate => {
+const suspend$1 = evaluate => {
   const effect = new EffectPrimitive(OP_COMMIT);
   effect.commit = evaluate;
   return effect;
@@ -8089,10 +8050,10 @@ const tap = /*#__PURE__*/dual(args => args.length === 3 || args.length === 2 &&
     return as(b, a);
   } else if (isPromiseLike(b)) {
     return unsafeAsync(resume => {
-      b.then(_ => resume(succeed$2(a)), e => resume(fail(new UnknownException(e, "An unknown error occurred in Effect.tap"))));
+      b.then(_ => resume(succeed$3(a)), e => resume(fail$1(new UnknownException(e, "An unknown error occurred in Effect.tap"))));
     });
   }
-  return succeed$2(a);
+  return succeed$3(a);
 }));
 /* @internal */
 const transplant = f => withFiberRuntime(state => {
@@ -8101,17 +8062,6 @@ const transplant = f => withFiberRuntime(state => {
   return f(fiberRefLocally(currentForkScopeOverride, some(scope)));
 });
 /* @internal */
-const attemptOrElse = /*#__PURE__*/dual(3, (self, that, onSuccess) => matchCauseEffect$1(self, {
-  onFailure: cause => {
-    const defects$1 = defects(cause);
-    if (defects$1.length > 0) {
-      return failCause$1(getOrThrow(keepDefectsAndElectFailures(cause)));
-    }
-    return that();
-  },
-  onSuccess
-}));
-/* @internal */
 const uninterruptible = self => {
   const effect = new EffectPrimitive(OP_UPDATE_RUNTIME_FLAGS);
   effect.effect_instruction_i0 = disable(Interruption);
@@ -8125,7 +8075,7 @@ const uninterruptibleMask$1 = f => custom(f, function () {
   effect.effect_instruction_i1 = oldFlags => interruption(oldFlags) ? internalCall(() => this.effect_instruction_i0(interruptible$1)) : internalCall(() => this.effect_instruction_i0(uninterruptible));
   return effect;
 });
-const void_$1 = /*#__PURE__*/succeed$2(void 0);
+const void_$1 = /*#__PURE__*/succeed$3(void 0);
 /* @internal */
 const updateRuntimeFlags = patch => {
   const effect = new EffectPrimitive(OP_UPDATE_RUNTIME_FLAGS);
@@ -8142,15 +8092,15 @@ const whileLoop = options => {
   return effect;
 };
 /* @internal */
-const fromIterator = iterator => suspend(() => {
+const fromIterator$1 = iterator => suspend$1(() => {
   const effect = new EffectPrimitive(OP_ITERATOR);
   effect.effect_instruction_i0 = iterator();
   return effect;
 });
 /* @internal */
-const gen$1 = function () {
+const gen$2 = function () {
   const f = arguments.length === 1 ? arguments[0] : arguments[1].bind(arguments[0]);
-  return fromIterator(() => f(pipe));
+  return fromIterator$1(() => f(pipe));
 };
 /* @internal */
 const yieldNow$2 = options => {
@@ -8274,7 +8224,7 @@ const fiberRefSet = /*#__PURE__*/dual(2, (self, value) => fiberRefModify(self, (
 const fiberRefModify = /*#__PURE__*/dual(2, (self, f) => withFiberRuntime(state => {
   const [b, a] = f(state.getFiberRef(self));
   state.setFiberRef(self, a);
-  return succeed$2(b);
+  return succeed$3(b);
 }));
 /* @internal */
 const fiberRefLocally = /*#__PURE__*/dual(3, (use, self, value) => acquireUseRelease(zipLeft(fiberRefGet(self), fiberRefSet(self, value)), () => use, oldValue => fiberRefSet(self, oldValue)));
@@ -8331,17 +8281,17 @@ const fiberRefUnsafeMakeRuntimeFlags = initial => fiberRefUnsafeMakePatch(initia
   fork: differ$1.empty
 });
 /** @internal */
-const currentContext = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentContext"), () => fiberRefUnsafeMakeContext(empty$h()));
+const currentContext = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentContext"), () => fiberRefUnsafeMakeContext(empty$i()));
 /** @internal */
 const currentSchedulingPriority = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentSchedulingPriority"), () => fiberRefUnsafeMake(0));
 /** @internal */
 const currentMaxOpsBeforeYield = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentMaxOpsBeforeYield"), () => fiberRefUnsafeMake(2048));
 /** @internal */
-const currentLogAnnotations = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLogAnnotation"), () => fiberRefUnsafeMake(empty$c()));
+const currentLogAnnotations = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLogAnnotation"), () => fiberRefUnsafeMake(empty$d()));
 /** @internal */
 const currentLogLevel = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLogLevel"), () => fiberRefUnsafeMake(logLevelInfo));
 /** @internal */
-const currentLogSpan = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLogSpan"), () => fiberRefUnsafeMake(empty$b()));
+const currentLogSpan = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLogSpan"), () => fiberRefUnsafeMake(empty$c()));
 /** @internal */
 const withSchedulingPriority = /*#__PURE__*/dual(2, (self, scheduler) => fiberRefLocally(self, currentSchedulingPriority, scheduler));
 /** @internal */
@@ -8355,15 +8305,15 @@ const currentUnhandledErrorLogLevel = /*#__PURE__*/globalValue(/*#__PURE__*/Symb
 /** @internal */
 const currentVersionMismatchErrorLogLevel = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/versionMismatchErrorLogLevel"), () => fiberRefUnsafeMake(some(logLevelWarning)));
 /** @internal */
-const currentMetricLabels = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentMetricLabels"), () => fiberRefUnsafeMakeReadonlyArray(empty$j()));
+const currentMetricLabels = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentMetricLabels"), () => fiberRefUnsafeMakeReadonlyArray(empty$k()));
 /** @internal */
 const currentForkScopeOverride = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentForkScopeOverride"), () => fiberRefUnsafeMake(none$4(), {
   fork: () => none$4(),
   join: (parent, _) => parent
 }));
 /** @internal */
-const currentInterruptedCause = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentInterruptedCause"), () => fiberRefUnsafeMake(empty$6, {
-  fork: () => empty$6,
+const currentInterruptedCause = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentInterruptedCause"), () => fiberRefUnsafeMake(empty$7, {
+  fork: () => empty$7,
   join: (parent, _) => parent
 }));
 /* @internal */
@@ -8379,7 +8329,7 @@ const scopeFork = (self, strategy) => self.fork(strategy);
 const YieldableError = /*#__PURE__*/function () {
   class YieldableError extends globalThis.Error {
     commit() {
-      return fail(this);
+      return fail$1(this);
     }
     toJSON() {
       const obj = {
@@ -8393,7 +8343,7 @@ const YieldableError = /*#__PURE__*/function () {
       if (this.toString !== globalThis.Error.prototype.toString) {
         return this.stack ? `${this.toString()}\n${this.stack.split("\n").slice(1).join("\n")}` : this.toString();
       } else if ("Bun" in globalThis) {
-        return pretty(fail$1(this), {
+        return pretty(fail$2(this), {
           renderErrorCause: true
         });
       }
@@ -8456,9 +8406,7 @@ const exitIsExit = u => isEffect(u) && "_tag" in u && (u._tag === "Success" || u
 /** @internal */
 const exitCollectAll = (exits, options) => exitCollectAllInternal(exits, options?.parallel ? parallel$2 : sequential$2);
 /** @internal */
-const exitDie$1 = defect => exitFailCause$1(die$1(defect));
-/** @internal */
-const exitFail = error => exitFailCause$1(fail$1(error));
+const exitFail = error => exitFailCause$1(fail$2(error));
 /** @internal */
 const exitFailCause$1 = cause => {
   const effect = new EffectPrimitiveFailure(OP_FAILURE);
@@ -8466,7 +8414,7 @@ const exitFailCause$1 = cause => {
   return effect;
 };
 /** @internal */
-const exitInterrupt$1 = fiberId => exitFailCause$1(interrupt(fiberId));
+const exitInterrupt$1 = fiberId => exitFailCause$1(interrupt$1(fiberId));
 /** @internal */
 const exitMap = /*#__PURE__*/dual(2, (self, f) => {
   switch (self._tag) {
@@ -8542,7 +8490,7 @@ const deferredUnsafeMake = fiberId => {
   const _deferred = {
     ...CommitPrototype,
     [DeferredTypeId]: deferredVariance,
-    state: make$d(pending([])),
+    state: make$g(pending$1([])),
     commit() {
       return deferredAwait(this);
     },
@@ -8576,7 +8524,7 @@ const deferredCompleteWith = /*#__PURE__*/dual(2, (self, effect) => sync(() => {
       }
     case OP_STATE_PENDING:
       {
-        set$2(self.state, done$2(effect));
+        set$2(self.state, done$3(effect));
         for (let i = 0, len = state.joiners.length; i < len; i++) {
           state.joiners[i](effect);
         }
@@ -8592,7 +8540,7 @@ const deferredInterrupt = self => flatMap$1(fiberId, fiberId => deferredComplete
 const deferredUnsafeDone = (self, effect) => {
   const state = get$3(self.state);
   if (state._tag === OP_STATE_PENDING) {
-    set$2(self.state, done$2(effect));
+    set$2(self.state, done$3(effect));
     for (let i = 0, len = state.joiners.length; i < len; i++) {
       state.joiners[i](effect);
     }
@@ -8629,9 +8577,43 @@ const currentSpanFromFiber = fiber => {
   return span !== undefined && span._tag === "Span" ? some(span) : none$4();
 };
 
-const TypeId$2 = /*#__PURE__*/Symbol.for("effect/MutableHashMap");
+const _await = deferredAwait;
+/**
+ * Exits the `Deferred` with the specified `Exit` value, which will be
+ * propagated to all fibers waiting on the value of the `Deferred`.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const done$2 = deferredDone;
+/**
+ * Completes the `Deferred` with interruption. This will interrupt all fibers
+ * waiting on the value of the `Deferred` with the `FiberId` of the fiber
+ * calling this method.
+ *
+ * @since 2.0.0
+ * @category utils
+ */
+const interrupt = deferredInterrupt;
+/**
+ * Unsafely creates a new `Deferred` from the specified `FiberId`.
+ *
+ * @since 2.0.0
+ * @category unsafe
+ */
+const unsafeMake$3 = deferredUnsafeMake;
+
+/**
+ * Constructs a new `Exit.Success` containing the specified value of type `A`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const succeed$2 = exitSucceed$1;
+
+const TypeId$4 = /*#__PURE__*/Symbol.for("effect/MutableHashMap");
 const MutableHashMapProto = {
-  [TypeId$2]: TypeId$2,
+  [TypeId$4]: TypeId$4,
   [Symbol.iterator]() {
     return new MutableHashMapIterator(this);
   },
@@ -8700,7 +8682,7 @@ class BucketIterator {
  * @since 2.0.0
  * @category constructors
  */
-const empty$5 = () => {
+const empty$6 = () => {
   const self = Object.create(MutableHashMapProto);
   self.referential = new Map();
   self.buckets = new Map();
@@ -8772,7 +8754,7 @@ const removeFromBucket = (self, bucket, key) => {
 /**
  * @since 2.0.0
  */
-const remove = /*#__PURE__*/dual(2, (self, key) => {
+const remove$1 = /*#__PURE__*/dual(2, (self, key) => {
   if (isEqual(key) === false) {
     self.referential.delete(key);
     return self;
@@ -8796,6 +8778,224 @@ const size = self => {
   return self.referential.size + self.bucketsSize;
 };
 
+/**
+ * @since 2.0.0
+ */
+const TypeId$3 = /*#__PURE__*/Symbol.for("effect/MutableList");
+const MutableListProto = {
+  [TypeId$3]: TypeId$3,
+  [Symbol.iterator]() {
+    let done = false;
+    let head = this.head;
+    return {
+      next() {
+        if (done) {
+          return this.return();
+        }
+        if (head == null) {
+          done = true;
+          return this.return();
+        }
+        const value = head.value;
+        head = head.next;
+        return {
+          done,
+          value
+        };
+      },
+      return(value) {
+        if (!done) {
+          done = true;
+        }
+        return {
+          done: true,
+          value
+        };
+      }
+    };
+  },
+  toString() {
+    return format$2(this.toJSON());
+  },
+  toJSON() {
+    return {
+      _id: "MutableList",
+      values: Array.from(this).map(toJSON)
+    };
+  },
+  [NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return pipeArguments(this, arguments);
+  }
+};
+/** @internal */
+const makeNode = value => ({
+  value,
+  removed: false,
+  prev: undefined,
+  next: undefined
+});
+/**
+ * Creates an empty `MutableList`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty$5 = () => {
+  const list = Object.create(MutableListProto);
+  list.head = undefined;
+  list.tail = undefined;
+  list._length = 0;
+  return list;
+};
+/**
+ * Returns `true` if the list contains zero elements, `false`, otherwise.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const isEmpty = self => length(self) === 0;
+/**
+ * Returns the length of the list.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const length = self => self._length;
+/**
+ * Appends the specified element to the end of the `MutableList`.
+ *
+ * @category concatenating
+ * @since 2.0.0
+ */
+const append = /*#__PURE__*/dual(2, (self, value) => {
+  const node = makeNode(value);
+  if (self.head === undefined) {
+    self.head = node;
+  }
+  if (self.tail === undefined) {
+    self.tail = node;
+  } else {
+    self.tail.next = node;
+    node.prev = self.tail;
+    self.tail = node;
+  }
+  self._length += 1;
+  return self;
+});
+/**
+ * Removes the first value from the list and returns it, if it exists.
+ *
+ * @since 0.0.1
+ */
+const shift = self => {
+  const head = self.head;
+  if (head !== undefined) {
+    remove(self, head);
+    return head.value;
+  }
+  return undefined;
+};
+const remove = (self, node) => {
+  if (node.removed) {
+    return;
+  }
+  node.removed = true;
+  if (node.prev !== undefined && node.next !== undefined) {
+    node.prev.next = node.next;
+    node.next.prev = node.prev;
+  } else if (node.prev !== undefined) {
+    self.tail = node.prev;
+    node.prev.next = undefined;
+  } else if (node.next !== undefined) {
+    self.head = node.next;
+    node.next.prev = undefined;
+  } else {
+    self.tail = undefined;
+    self.head = undefined;
+  }
+  if (self._length > 0) {
+    self._length -= 1;
+  }
+};
+
+/**
+ * @since 2.0.0
+ */
+const TypeId$2 = /*#__PURE__*/Symbol.for("effect/MutableQueue");
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
+const EmptyMutableQueue = /*#__PURE__*/Symbol.for("effect/mutable/MutableQueue/Empty");
+const MutableQueueProto = {
+  [TypeId$2]: TypeId$2,
+  [Symbol.iterator]() {
+    return Array.from(this.queue)[Symbol.iterator]();
+  },
+  toString() {
+    return format$2(this.toJSON());
+  },
+  toJSON() {
+    return {
+      _id: "MutableQueue",
+      values: Array.from(this).map(toJSON)
+    };
+  },
+  [NodeInspectSymbol]() {
+    return this.toJSON();
+  },
+  pipe() {
+    return pipeArguments(this, arguments);
+  }
+};
+const make$c = capacity => {
+  const queue = Object.create(MutableQueueProto);
+  queue.queue = empty$5();
+  queue.capacity = capacity;
+  return queue;
+};
+/**
+ * Creates a new unbounded `MutableQueue`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const unbounded = () => make$c(undefined);
+/**
+ * Offers an element to the queue.
+ *
+ * Returns whether the enqueue was successful or not.
+ *
+ * @since 2.0.0
+ */
+const offer = /*#__PURE__*/dual(2, (self, value) => {
+  const queueLength = length(self.queue);
+  if (self.capacity !== undefined && queueLength === self.capacity) {
+    return false;
+  }
+  append(value)(self.queue);
+  return true;
+});
+/**
+ * Dequeues an element from the queue.
+ *
+ * Returns either an element from the queue, or the `def` param.
+ *
+ * **Note**: if there is no meaningful default for your type, you can always
+ * use `poll(MutableQueue.EmptyMutableQueue)`.
+ *
+ * @since 2.0.0
+ */
+const poll = /*#__PURE__*/dual(2, (self, def) => {
+  if (isEmpty(self.queue)) {
+    return def;
+  }
+  return shift(self.queue);
+});
+
 /** @internal */
 const ClockSymbolKey = "effect/Clock";
 /** @internal */
@@ -8857,7 +9057,7 @@ class ClockImpl {
   currentTimeMillis = /*#__PURE__*/sync(() => this.unsafeCurrentTimeMillis());
   currentTimeNanos = /*#__PURE__*/sync(() => this.unsafeCurrentTimeNanos());
   scheduler() {
-    return succeed$2(globalClockScheduler);
+    return succeed$3(globalClockScheduler);
   }
   sleep(duration) {
     return async_(resume => {
@@ -8867,7 +9067,7 @@ class ClockImpl {
   }
 }
 /** @internal */
-const make$9 = () => new ClockImpl();
+const make$b = () => new ClockImpl();
 
 /** @internal */
 const OP_AND = "And";
@@ -9114,7 +9314,7 @@ const FlatConfigProviderSymbolKey = "effect/ConfigProviderFlat";
 /** @internal */
 const FlatConfigProviderTypeId = /*#__PURE__*/Symbol.for(FlatConfigProviderSymbolKey);
 /** @internal */
-const make$8 = options => ({
+const make$a = options => ({
   [ConfigProviderTypeId]: ConfigProviderTypeId,
   pipe() {
     return pipeArguments(this, arguments);
@@ -9129,10 +9329,10 @@ const makeFlat = options => ({
   enumerateChildren: options.enumerateChildren
 });
 /** @internal */
-const fromFlat = flat => make$8({
-  load: config => flatMap$1(fromFlatLoop(flat, empty$j(), config, false), chunk => match$3(head(chunk), {
-    onNone: () => fail(MissingData(empty$j(), `Expected a single value having structure: ${config}`)),
-    onSome: succeed$2
+const fromFlat = flat => make$a({
+  load: config => flatMap$1(fromFlatLoop(flat, empty$k(), config, false), chunk => match$3(head(chunk), {
+    onNone: () => fail$1(MissingData(empty$k(), `Expected a single value having structure: ${config}`)),
+    onSome: succeed$3
   })),
   flattened: flat
 });
@@ -9200,57 +9400,57 @@ const fromFlatLoop = (flat, prefix, config, split) => {
   switch (op._tag) {
     case OP_CONSTANT:
       {
-        return succeed$2(of$2(op.value));
+        return succeed$3(of$2(op.value));
       }
     case OP_DESCRIBED:
       {
-        return suspend(() => fromFlatLoop(flat, prefix, op.config, split));
+        return suspend$1(() => fromFlatLoop(flat, prefix, op.config, split));
       }
     case OP_FAIL:
       {
-        return fail(MissingData(prefix, op.message));
+        return fail$1(MissingData(prefix, op.message));
       }
     case OP_FALLBACK:
       {
-        return pipe(suspend(() => fromFlatLoop(flat, prefix, op.first, split)), catchAll$1(error1 => {
+        return pipe(suspend$1(() => fromFlatLoop(flat, prefix, op.first, split)), catchAll$1(error1 => {
           if (op.condition(error1)) {
-            return pipe(fromFlatLoop(flat, prefix, op.second, split), catchAll$1(error2 => fail(Or(error1, error2))));
+            return pipe(fromFlatLoop(flat, prefix, op.second, split), catchAll$1(error2 => fail$1(Or(error1, error2))));
           }
-          return fail(error1);
+          return fail$1(error1);
         }));
       }
     case OP_LAZY:
       {
-        return suspend(() => fromFlatLoop(flat, prefix, op.config(), split));
+        return suspend$1(() => fromFlatLoop(flat, prefix, op.config(), split));
       }
     case OP_MAP_OR_FAIL:
       {
-        return suspend(() => pipe(fromFlatLoop(flat, prefix, op.original, split), flatMap$1(forEachSequential(a => pipe(op.mapOrFail(a), mapError(prefixed(appendConfigPath(prefix, op.original))))))));
+        return suspend$1(() => pipe(fromFlatLoop(flat, prefix, op.original, split), flatMap$1(forEachSequential(a => pipe(op.mapOrFail(a), mapError(prefixed(appendConfigPath(prefix, op.original))))))));
       }
     case OP_NESTED:
       {
-        return suspend(() => fromFlatLoop(flat, concat(prefix, of$2(op.name)), op.config, split));
+        return suspend$1(() => fromFlatLoop(flat, concat(prefix, of$2(op.name)), op.config, split));
       }
     case OP_PRIMITIVE:
       {
         return pipe(patch$3(prefix, flat.patch), flatMap$1(prefix => pipe(flat.load(prefix, op, split), flatMap$1(values => {
           if (values.length === 0) {
             const name = pipe(last(prefix), getOrElse(() => "<n/a>"));
-            return fail(MissingData([], `Expected ${op.description} with name ${name}`));
+            return fail$1(MissingData([], `Expected ${op.description} with name ${name}`));
           }
-          return succeed$2(values);
+          return succeed$3(values);
         }))));
       }
     case OP_SEQUENCE:
       {
         return pipe(patch$3(prefix, flat.patch), flatMap$1(patchedPrefix => pipe(flat.enumerateChildren(patchedPrefix), flatMap$1(indicesFrom), flatMap$1(indices => {
           if (indices.length === 0) {
-            return suspend(() => map(fromFlatLoop(flat, prefix, op.config, true), of$2));
+            return suspend$1(() => map(fromFlatLoop(flat, prefix, op.config, true), of$2));
           }
-          return pipe(forEachSequential(indices, index => fromFlatLoop(flat, append$1(prefix, `[${index}]`), op.config, true)), map(chunkChunk => {
+          return pipe(forEachSequential(indices, index => fromFlatLoop(flat, append$2(prefix, `[${index}]`), op.config, true)), map(chunkChunk => {
             const flattened = flatten$2(chunkChunk);
             if (flattened.length === 0) {
-              return of$2(empty$j());
+              return of$2(empty$k());
             }
             return of$2(flattened);
           }));
@@ -9258,10 +9458,10 @@ const fromFlatLoop = (flat, prefix, config, split) => {
       }
     case OP_HASHMAP:
       {
-        return suspend(() => pipe(patch$3(prefix, flat.patch), flatMap$1(prefix => pipe(flat.enumerateChildren(prefix), flatMap$1(keys => {
+        return suspend$1(() => pipe(patch$3(prefix, flat.patch), flatMap$1(prefix => pipe(flat.enumerateChildren(prefix), flatMap$1(keys => {
           return pipe(keys, forEachSequential(key => fromFlatLoop(flat, concat(prefix, of$2(key)), op.valueConfig, split)), map(matrix => {
             if (matrix.length === 0) {
-              return of$2(empty$c());
+              return of$2(empty$d());
             }
             return pipe(transpose(matrix), map$3(values => fromIterable$1(zip$1(fromIterable$6(keys), values))));
           }));
@@ -9269,15 +9469,15 @@ const fromFlatLoop = (flat, prefix, config, split) => {
       }
     case OP_ZIP_WITH:
       {
-        return suspend(() => pipe(fromFlatLoop(flat, prefix, op.left, split), either, flatMap$1(left => pipe(fromFlatLoop(flat, prefix, op.right, split), either, flatMap$1(right$1 => {
+        return suspend$1(() => pipe(fromFlatLoop(flat, prefix, op.left, split), either, flatMap$1(left => pipe(fromFlatLoop(flat, prefix, op.right, split), either, flatMap$1(right$1 => {
           if (isLeft(left) && isLeft(right$1)) {
-            return fail(And(left.left, right$1.left));
+            return fail$1(And(left.left, right$1.left));
           }
           if (isLeft(left) && isRight(right$1)) {
-            return fail(left.left);
+            return fail$1(left.left);
           }
           if (isRight(left) && isLeft(right$1)) {
-            return fail(right$1.left);
+            return fail$1(right$1.left);
           }
           if (isRight(left) && isRight(right$1)) {
             const path = pipe(prefix, join$1("."));
@@ -9308,7 +9508,7 @@ const transpose = array => {
   return Object.keys(array[0]).map(column => array.map(row => row[column]));
 };
 const indicesFrom = quotedIndices => pipe(forEachSequential(quotedIndices, parseQuotedIndex), mapBoth({
-  onFailure: () => empty$j(),
+  onFailure: () => empty$k(),
   onSuccess: sort(Order$1)
 }), either, map(merge$3));
 const QUOTED_INDEX_REGEX = /^(\[(\d+)\])$/;
@@ -9450,7 +9650,7 @@ class RandomImpl {
   }
 }
 const shuffleWith = (elements, nextIntBounded) => {
-  return suspend(() => pipe(sync(() => Array.from(elements)), flatMap$1(buffer => {
+  return suspend$1(() => pipe(sync(() => Array.from(elements)), flatMap$1(buffer => {
     const numbers = [];
     for (let i = buffer.length; i >= 2; i = i - 1) {
       numbers.push(i);
@@ -9464,7 +9664,7 @@ const swap = (buffer, index1, index2) => {
   buffer[index2] = tmp;
   return buffer;
 };
-const make$7 = seed => new RandomImpl(hash(seed));
+const make$9 = seed => new RandomImpl(hash(seed));
 
 /**
  * @since 2.0.0
@@ -9472,7 +9672,7 @@ const make$7 = seed => new RandomImpl(hash(seed));
 /** @internal */
 const TracerTypeId = /*#__PURE__*/Symbol.for("effect/Tracer");
 /** @internal */
-const make$6 = options => ({
+const make$8 = options => ({
   [TracerTypeId]: TracerTypeId,
   ...options
 });
@@ -9541,13 +9741,13 @@ class NativeSpan {
   }
 }
 /** @internal */
-const nativeTracer = /*#__PURE__*/make$6({
+const nativeTracer = /*#__PURE__*/make$8({
   span: (name, parent, context, links, startTime, kind) => new NativeSpan(name, parent, context, links, startTime, kind),
   context: f => f()
 });
 
 /** @internal */
-const liveServices = /*#__PURE__*/pipe(/*#__PURE__*/empty$h(), /*#__PURE__*/add$2(clockTag, /*#__PURE__*/make$9()), /*#__PURE__*/add$2(consoleTag, defaultConsole), /*#__PURE__*/add$2(randomTag, /*#__PURE__*/make$7(/*#__PURE__*/Math.random())), /*#__PURE__*/add$2(configProviderTag, /*#__PURE__*/fromEnv()), /*#__PURE__*/add$2(tracerTag, nativeTracer));
+const liveServices = /*#__PURE__*/pipe(/*#__PURE__*/empty$i(), /*#__PURE__*/add$2(clockTag, /*#__PURE__*/make$b()), /*#__PURE__*/add$2(consoleTag, defaultConsole), /*#__PURE__*/add$2(randomTag, /*#__PURE__*/make$9(/*#__PURE__*/Math.random())), /*#__PURE__*/add$2(configProviderTag, /*#__PURE__*/fromEnv()), /*#__PURE__*/add$2(tracerTag, nativeTracer));
 /**
  * The `FiberRef` holding the default `Effect` services.
  *
@@ -9996,30 +10196,12 @@ class MetricLabelImpl {
   }
 }
 /** @internal */
-const make$5 = (key, value) => {
+const make$7 = (key, value) => {
   return new MetricLabelImpl(key, value);
 };
 /** @internal */
 const isMetricLabel = u => hasProperty(u, MetricLabelTypeId);
 
-/* @internal */
-const try_$1 = arg => {
-  let evaluate;
-  let onFailure = undefined;
-  if (typeof arg === "function") {
-    evaluate = arg;
-  } else {
-    evaluate = arg.try;
-    onFailure = arg.catch;
-  }
-  return suspend(() => {
-    try {
-      return succeed$2(internalCall(evaluate));
-    } catch (error) {
-      return fail(onFailure ? internalCall(() => onFailure(error)) : new UnknownException(error, "An unknown error occurred in Effect.try"));
-    }
-  });
-};
 /* @internal */
 const clockWith = clockWith$1;
 /** @internal */
@@ -10039,7 +10221,7 @@ const logWithLevel = level => (...message) => {
     }
   }
   if (cause === undefined) {
-    cause = empty$6;
+    cause = empty$7;
   }
   return withFiberRuntime(fiberState => {
     fiberState.log(message, cause, levelOption);
@@ -10051,8 +10233,6 @@ const logWarning$1 = /*#__PURE__*/logWithLevel(Warning);
 /** @internal */
 const logError$1 = /*#__PURE__*/logWithLevel(Error$2);
 /* @internal */
-const orElseSucceed$1 = /*#__PURE__*/dual(2, (self, evaluate) => orElse(self, () => sync(evaluate)));
-/* @internal */
 const tapError$1 = /*#__PURE__*/dual(2, (self, f) => matchCauseEffect$1(self, {
   onFailure: cause => {
     const either = failureOrCause(cause);
@@ -10063,38 +10243,10 @@ const tapError$1 = /*#__PURE__*/dual(2, (self, f) => matchCauseEffect$1(self, {
         return failCause$1(cause);
     }
   },
-  onSuccess: succeed$2
+  onSuccess: succeed$3
 }));
 /* @internal */
-const tryPromise$1 = arg => {
-  let evaluate;
-  let catcher = undefined;
-  if (typeof arg === "function") {
-    evaluate = arg;
-  } else {
-    evaluate = arg.try;
-    catcher = arg.catch;
-  }
-  const fail$1 = e => catcher ? failSync(() => catcher(e)) : fail(new UnknownException(e, "An unknown error occurred in Effect.tryPromise"));
-  if (evaluate.length >= 1) {
-    return async_((resolve, signal) => {
-      try {
-        evaluate(signal).then(a => resolve(succeed$2(a)), e => resolve(fail$1(e)));
-      } catch (e) {
-        resolve(fail$1(e));
-      }
-    });
-  }
-  return async_(resolve => {
-    try {
-      evaluate().then(a => resolve(succeed$2(a)), e => resolve(fail$1(e)));
-    } catch (e) {
-      resolve(fail$1(e));
-    }
-  });
-};
-/* @internal */
-const when = /*#__PURE__*/dual(2, (self, condition) => suspend(() => condition() ? map(self, some) : succeed$2(none$4())));
+const when = /*#__PURE__*/dual(2, (self, condition) => suspend$1(() => condition() ? map(self, some) : succeed$3(none$4())));
 
 /** @internal */
 const OP_SEQUENTIAL = "Sequential";
@@ -10311,6 +10463,19 @@ class MicroCauseImpl extends globalThis.Error {
     return this.stack;
   }
 }
+class Fail extends MicroCauseImpl {
+  error;
+  constructor(error, traces = []) {
+    super("Fail", error, traces);
+    this.error = error;
+  }
+}
+/**
+ * @since 3.4.6
+ * @experimental
+ * @category MicroCause
+ */
+const causeFail = (error, traces = []) => new Fail(error, traces);
 class Die extends MicroCauseImpl {
   defect;
   constructor(defect, traces = []) {
@@ -10595,6 +10760,30 @@ const failCause = /*#__PURE__*/makeExit({
     return cont ? cont[failureCont](this[args], fiber) : fiber.yieldWith(this);
   }
 });
+/**
+ * Creates a `Micro` effect that fails with the given error.
+ *
+ * This results in a `Fail` variant of the `MicroCause` type, where the error is
+ * tracked at the type level.
+ *
+ * @since 3.4.0
+ * @experimental
+ * @category constructors
+ */
+const fail = error => failCause(causeFail(error));
+/**
+ * Lazily creates a `Micro` effect from the given side-effect.
+ *
+ * @since 3.4.0
+ * @experimental
+ * @category constructors
+ */
+const suspend = /*#__PURE__*/makePrimitive({
+  op: "Suspend",
+  eval(_fiber) {
+    return this[args]();
+  }
+});
 /**
  * Pause the execution of the current `Micro` effect, and resume it on the next
  * scheduler tick.
@@ -10626,6 +10815,38 @@ const yieldNowWith = /*#__PURE__*/makePrimitive({
  */
 const yieldNow$1 = /*#__PURE__*/yieldNowWith(0);
 const void_ = /*#__PURE__*/succeed$1(void 0);
+const try_ = options => suspend(() => {
+  try {
+    return succeed$1(options.try());
+  } catch (err) {
+    return fail(options.catch(err));
+  }
+});
+/**
+ * Wrap a `Promise` into a `Micro` effect. Any errors will be caught and
+ * converted into a specific error type.
+ *
+ * @example
+ * ```ts
+ * import { Micro } from "effect"
+ *
+ * Micro.tryPromise({
+ *   try: () => Promise.resolve("success"),
+ *   catch: (cause) => new Error("caught", { cause })
+ * })
+ * ```
+ *
+ * @since 3.4.0
+ * @experimental
+ * @category constructors
+ */
+const tryPromise = options => asyncOptions(function (resume, signal) {
+  try {
+    options.try(signal).then(a => resume(succeed$1(a)), e => resume(fail(options.catch(e))));
+  } catch (err) {
+    resume(fail(options.catch(err)));
+  }
+}, options.try.length !== 0);
 /**
  * Create a `Micro` effect using the current `MicroFiber`.
  *
@@ -10639,6 +10860,69 @@ const withMicroFiber = /*#__PURE__*/makePrimitive({
     return this[args](fiber);
   }
 });
+const asyncOptions = /*#__PURE__*/makePrimitive({
+  op: "Async",
+  single: false,
+  eval(fiber) {
+    const register = this[args][0];
+    let resumed = false;
+    let yielded = false;
+    const controller = this[args][1] ? new AbortController() : undefined;
+    const onCancel = register(effect => {
+      if (resumed) return;
+      resumed = true;
+      if (yielded) {
+        fiber.evaluate(effect);
+      } else {
+        yielded = effect;
+      }
+    }, controller?.signal);
+    if (yielded !== false) return yielded;
+    yielded = true;
+    fiber._yielded = () => {
+      resumed = true;
+    };
+    if (controller === undefined && onCancel === undefined) {
+      return Yield;
+    }
+    fiber._stack.push(asyncFinalizer(() => {
+      resumed = true;
+      controller?.abort();
+      return onCancel ?? exitVoid;
+    }));
+    return Yield;
+  }
+});
+const asyncFinalizer = /*#__PURE__*/makePrimitive({
+  op: "AsyncFinalizer",
+  ensure(fiber) {
+    if (fiber.interruptible) {
+      fiber.interruptible = false;
+      fiber._stack.push(setInterruptible(true));
+    }
+  },
+  contE(cause, _fiber) {
+    return causeIsInterrupt(cause) ? flatMap(this[args](), () => failCause(cause)) : failCause(cause);
+  }
+});
+/**
+ * @since 3.4.0
+ * @experimental
+ * @category constructors
+ */
+const gen$1 = (...args) => suspend(() => fromIterator(args.length === 1 ? args[0]() : args[1].call(args[0])));
+const fromIterator = /*#__PURE__*/makePrimitive({
+  op: "Iterator",
+  contA(value, fiber) {
+    const state = this[args].next(value);
+    if (state.done) return succeed$1(state.value);
+    fiber._stack.push(this);
+    return yieldWrapGet(state.value);
+  },
+  eval(fiber) {
+    return this[successCont](undefined, fiber);
+  }
+});
 /**
  * Map the success value of this `Micro` effect to another `Micro` effect, then
  * flatten the result.
@@ -11014,51 +11298,6 @@ class MixedScheduler {
  * @category schedulers
  */
 const defaultScheduler = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/Scheduler/defaultScheduler"), () => new MixedScheduler(2048));
-/**
- * @since 2.0.0
- * @category constructors
- */
-class SyncScheduler {
-  /**
-   * @since 2.0.0
-   */
-  tasks = /*#__PURE__*/new PriorityBuckets();
-  /**
-   * @since 2.0.0
-   */
-  deferred = false;
-  /**
-   * @since 2.0.0
-   */
-  scheduleTask(task, priority) {
-    if (this.deferred) {
-      defaultScheduler.scheduleTask(task, priority);
-    } else {
-      this.tasks.scheduleTask(task, priority);
-    }
-  }
-  /**
-   * @since 2.0.0
-   */
-  shouldYield(fiber) {
-    return fiber.currentOpCount > fiber.getFiberRef(currentMaxOpsBeforeYield) ? fiber.getFiberRef(currentSchedulingPriority) : false;
-  }
-  /**
-   * @since 2.0.0
-   */
-  flush() {
-    while (this.tasks.buckets.length > 0) {
-      const tasks = this.tasks.buckets;
-      this.tasks.buckets = [];
-      for (const [_, toRun] of tasks) {
-        for (let i = 0; i < toRun.length; i++) {
-          toRun[i]();
-        }
-      }
-    }
-    this.deferred = true;
-  }
-}
 /** @internal */
 const currentScheduler = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentScheduler"), () => fiberRefUnsafeMake(defaultScheduler));
 
@@ -11587,7 +11826,7 @@ const metricHookVariance = {
   _Out: _ => _
 };
 /** @internal */
-const make$4 = options => ({
+const make$6 = options => ({
   [MetricHookTypeId]: metricHookVariance,
   pipe() {
     return pipeArguments(this, arguments);
@@ -11604,7 +11843,7 @@ const counter$1 = key => {
       sum = sum + value;
     }
   };
-  return make$4({
+  return make$6({
     get: () => counter$2(sum),
     update,
     modify: update
@@ -11620,7 +11859,7 @@ const frequency = key => {
     const slotCount = values.get(word) ?? 0;
     values.set(word, slotCount + 1);
   };
-  return make$4({
+  return make$6({
     get: () => frequency$1(values),
     update,
     modify: update
@@ -11629,7 +11868,7 @@ const frequency = key => {
 /** @internal */
 const gauge = (_key, startAt) => {
   let value = startAt;
-  return make$4({
+  return make$6({
     get: () => gauge$1(value),
     update: v => {
       value = v;
@@ -11699,7 +11938,7 @@ const histogram$1 = key => {
     }
     return builder;
   };
-  return make$4({
+  return make$6({
     get: () => histogram$2({
       buckets: getBuckets(),
       count,
@@ -11766,7 +12005,7 @@ const summary = key => {
     count = count + 1;
     sum = sum + value;
   };
-  return make$4({
+  return make$6({
     get: () => summary$1({
       error,
       quantiles: snapshot(Date.now()),
@@ -11784,7 +12023,7 @@ const calculateQuantiles = (error, sortedQuantiles, sortedSamples) => {
   // The number of samples examined
   const sampleCount = sortedSamples.length;
   if (!isNonEmptyReadonlyArray(sortedQuantiles)) {
-    return empty$j();
+    return empty$k();
   }
   const head = sortedQuantiles[0];
   const tail = sortedQuantiles.slice(1);
@@ -11945,7 +12184,7 @@ const MetricRegistryTypeId = /*#__PURE__*/Symbol.for(MetricRegistrySymbolKey);
 /** @internal */
 class MetricRegistryImpl {
   [MetricRegistryTypeId] = MetricRegistryTypeId;
-  map = /*#__PURE__*/empty$5();
+  map = /*#__PURE__*/empty$6();
   snapshot() {
     const result = [];
     for (const [key, hook] of this.map) {
@@ -12033,7 +12272,7 @@ class MetricRegistryImpl {
   }
 }
 /** @internal */
-const make$3 = () => {
+const make$5 = () => {
   return new MetricRegistryImpl();
 };
 
@@ -12050,9 +12289,9 @@ const metricVariance = {
   _Out: _ => _
 };
 /** @internal */
-const globalMetricRegistry = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/Metric/globalMetricRegistry"), () => make$3());
+const globalMetricRegistry = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/Metric/globalMetricRegistry"), () => make$5());
 /** @internal */
-const make$2 = function (keyType, unsafeUpdate, unsafeValue, unsafeModify) {
+const make$4 = function (keyType, unsafeUpdate, unsafeValue, unsafeModify) {
   const metric = Object.assign(effect => tap(effect, a => update(metric, a)), {
     [MetricTypeId]: metricVariance,
     keyType,
@@ -12091,21 +12330,21 @@ const fromMetricKey = key => {
     hookCache.set(extraTags, hook);
     return hook;
   };
-  return make$2(key.keyType, (input, extraTags) => hook(extraTags).update(input), extraTags => hook(extraTags).get(), (input, extraTags) => hook(extraTags).modify(input));
+  return make$4(key.keyType, (input, extraTags) => hook(extraTags).update(input), extraTags => hook(extraTags).get(), (input, extraTags) => hook(extraTags).modify(input));
 };
 /** @internal */
 const histogram = (name, boundaries, description) => fromMetricKey(histogram$3(name, boundaries, description));
 /** @internal */
-const tagged = /*#__PURE__*/dual(3, (self, key, value) => taggedWithLabels(self, [make$5(key, value)]));
+const tagged = /*#__PURE__*/dual(3, (self, key, value) => taggedWithLabels(self, [make$7(key, value)]));
 /** @internal */
 const taggedWithLabels = /*#__PURE__*/dual(2, (self, extraTags) => {
-  return make$2(self.keyType, (input, extraTags1) => self.unsafeUpdate(input, union$2(extraTags, extraTags1)), extraTags1 => self.unsafeValue(union$2(extraTags, extraTags1)), (input, extraTags1) => self.unsafeModify(input, union$2(extraTags, extraTags1)));
+  return make$4(self.keyType, (input, extraTags1) => self.unsafeUpdate(input, union$2(extraTags, extraTags1)), extraTags1 => self.unsafeValue(union$2(extraTags, extraTags1)), (input, extraTags1) => self.unsafeModify(input, union$2(extraTags, extraTags1)));
 });
 /* @internal */
 const update = /*#__PURE__*/dual(2, (self, input) => fiberRefGetWith(currentMetricLabels, tags => sync(() => self.unsafeUpdate(input, tags))));
 
 /** @internal */
-const complete = /*#__PURE__*/dual(2, (self, result) => fiberRefGetWith(currentRequestMap, map => sync(() => {
+const complete$1 = /*#__PURE__*/dual(2, (self, result) => fiberRefGetWith(currentRequestMap, map => sync(() => {
   if (map.has(self)) {
     const entry = map.get(self);
     if (!entry.state.completed) {
@@ -12248,7 +12487,7 @@ const none = /*#__PURE__*/globalValue("effect/Supervisor/none", () => fromEffect
  * @since 2.0.0
  * @category constructors
  */
-const make$1 = make$c;
+const make$3 = make$f;
 
 /** @internal */
 const OP_EMPTY = "Empty";
@@ -12335,12 +12574,12 @@ const removeSupervisor = (self, that) => {
 /** @internal */
 const toSet = self => {
   if (equals$1(self, none)) {
-    return empty$d();
+    return empty$e();
   } else {
     if (isZip(self)) {
       return pipe(toSet(self.left), union(toSet(self.right)));
     } else {
-      return make$e(self);
+      return make$h(self);
     }
   }
 };
@@ -12362,7 +12601,7 @@ const diff = (oldValue, newValue) => {
   return combine(added, removed);
 };
 /** @internal */
-const differ = /*#__PURE__*/make$1({
+const differ = /*#__PURE__*/make$3({
   empty,
   patch,
   combine,
@@ -12602,7 +12841,7 @@ class FiberRuntime extends Class {
    * without locks or immutable data.
    */
   ask(f) {
-    return suspend(() => {
+    return suspend$1(() => {
       const deferred = deferredUnsafeMake(this._fiberId);
       this.tell(stateful((fiber, status) => {
         deferredUnsafeDone(deferred, sync(() => f(fiber, status)));
@@ -12622,7 +12861,7 @@ class FiberRuntime extends Class {
   }
   get await() {
     return async_(resume => {
-      const cb = exit => resume(succeed$2(exit));
+      const cb = exit => resume(succeed$3(exit));
       this.tell(stateful((fiber, _) => {
         if (fiber._exitValue !== null) {
           cb(this._exitValue);
@@ -12668,13 +12907,13 @@ class FiberRuntime extends Class {
    * In the background, interrupts the fiber as if interrupted from the specified fiber.
    */
   interruptAsFork(fiberId) {
-    return sync(() => this.tell(interruptSignal(interrupt(fiberId))));
+    return sync(() => this.tell(interruptSignal(interrupt$1(fiberId))));
   }
   /**
    * In the background, interrupts the fiber as if interrupted from the specified fiber.
    */
   unsafeInterruptAsFork(fiberId) {
-    this.tell(interruptSignal(interrupt(fiberId)));
+    this.tell(interruptSignal(interrupt$1(fiberId)));
   }
   /**
    * Adds an observer to the list of observers.
@@ -12868,7 +13107,7 @@ class FiberRuntime extends Class {
    * log annotations and log level) may not be up-to-date.
    */
   isInterrupted() {
-    return !isEmpty(this.getFiberRef(currentInterruptedCause));
+    return !isEmpty$1(this.getFiberRef(currentInterruptedCause));
   }
   /**
    * Adds an interruptor to the set of interruptors that are interrupting this
@@ -12902,7 +13141,7 @@ class FiberRuntime extends Class {
     }
     let told = false;
     for (const child of this._children) {
-      child.tell(interruptSignal(interrupt(this.id())));
+      child.tell(interruptSignal(interrupt$1(this.id())));
       told = true;
     }
     return told;
@@ -13213,10 +13452,10 @@ class FiberRuntime extends Class {
     return sync(() => unsafeGet$1(this.currentContext, op));
   }
   ["Left"](op) {
-    return fail(op.left);
+    return fail$1(op.left);
   }
   ["None"](_) {
-    return fail(new NoSuchElementException());
+    return fail$1(new NoSuchElementException());
   }
   ["Right"](op) {
     return exitSucceed$1(op.right);
@@ -13235,11 +13474,11 @@ class FiberRuntime extends Class {
         switch (exit.cause._tag) {
           case "Interrupt":
             {
-              return resume(exitFailCause$1(interrupt(none$2)));
+              return resume(exitFailCause$1(interrupt$1(none$2)));
             }
           case "Fail":
             {
-              return resume(fail(exit.cause.error));
+              return resume(fail$1(exit.cause.error));
             }
           case "Die":
             {
@@ -13458,7 +13697,7 @@ class FiberRuntime extends Class {
             const level = this.getFiberRef(currentVersionMismatchErrorLogLevel);
             if (level._tag === "Some") {
               const effectVersion = cur[EffectTypeId]._V;
-              this.log(`Executing an Effect versioned ${effectVersion} with a Runtime of version ${getCurrentVersion()}, you may want to dedupe the effect dependencies, you can use the language service plugin to detect this at compile time: https://github.com/Effect-TS/language-service`, empty$6, level);
+              this.log(`Executing an Effect versioned ${effectVersion} with a Runtime of version ${getCurrentVersion()}, you may want to dedupe the effect dependencies, you can use the language service plugin to detect this at compile time: https://github.com/Effect-TS/language-service`, empty$7, level);
             }
           }
           // @ts-expect-error
@@ -13476,7 +13715,7 @@ class FiberRuntime extends Class {
         if (cur !== YieldedOp && !hasProperty(cur, "_op") || !(cur._op in this)) {
           cur = dieMessage(`Not a valid effect: ${toStringUnknown(cur)}`);
         } else if (isInterruptedException(e)) {
-          cur = exitFailCause$1(sequential$2(die$1(e), interrupt(none$2)));
+          cur = exitFailCause$1(sequential$2(die$1(e), interrupt$1(none$2)));
         } else {
           cur = die(e);
         }
@@ -13525,7 +13764,7 @@ const tracerLogger = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/Lo
   span.value.event(toStringUnknown(Array.isArray(message) && message.length === 1 ? message[0] : message), clockService.unsafeCurrentTimeNanos(), attributes);
 }));
 /** @internal */
-const currentLoggers = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLoggers"), () => fiberRefUnsafeMakeHashSet(make$e(defaultLogger, tracerLogger)));
+const currentLoggers = /*#__PURE__*/globalValue(/*#__PURE__*/Symbol.for("effect/FiberRef/currentLoggers"), () => fiberRefUnsafeMakeHashSet(make$h(defaultLogger, tracerLogger)));
 // === all
 const allResolveInput = input => {
   if (Array.isArray(input) || isIterable(input)) {
@@ -13567,11 +13806,11 @@ const allValidate = (effects, reconcile, options) => {
       }
     }
     if (errored) {
-      return reconcile._tag === "Some" ? fail(reconcile.value(errors)) : fail(errors);
+      return reconcile._tag === "Some" ? fail$1(reconcile.value(errors)) : fail$1(errors);
     } else if (options?.discard) {
       return void_$1;
     }
-    return reconcile._tag === "Some" ? succeed$2(reconcile.value(successes)) : succeed$2(successes);
+    return reconcile._tag === "Some" ? succeed$3(reconcile.value(successes)) : succeed$3(successes);
   });
 };
 const allEither = (effects, reconcile, options) => {
@@ -13612,11 +13851,11 @@ const forEach = /*#__PURE__*/dual(args => isIterable(args[0]), (self, f, options
   return match(options?.concurrency, () => finalizersMaskInternal(sequential, options?.concurrentFinalizers)(restore => isRequestBatchingEnabled ? forEachParN(self, 1, (a, i) => restore(f(a, i)), true) : forEachSequential(self, (a, i) => restore(f(a, i)))), () => finalizersMaskInternal(parallel, options?.concurrentFinalizers)(restore => forEachParUnbounded(self, (a, i) => restore(f(a, i)), isRequestBatchingEnabled)), n => finalizersMaskInternal(parallelN(n), options?.concurrentFinalizers)(restore => forEachParN(self, n, (a, i) => restore(f(a, i)), isRequestBatchingEnabled)));
 }));
 /* @internal */
-const forEachParUnbounded = (self, f, batching) => suspend(() => {
+const forEachParUnbounded = (self, f, batching) => suspend$1(() => {
   const as = fromIterable$6(self);
   const array = new Array(as.length);
   const fn = (a, i) => flatMap$1(f(a, i), b => sync(() => array[i] = b));
-  return zipRight(forEachConcurrentDiscard(as, fn, batching, false), succeed$2(array));
+  return zipRight(forEachConcurrentDiscard(as, fn, batching, false), succeed$3(array));
 });
 /** @internal */
 const forEachConcurrentDiscard = (self, f, batching, processAll, n) => uninterruptibleMask$1(restore => transplant(graft => withFiberRuntime(parent => {
@@ -13699,7 +13938,7 @@ const forEachConcurrentDiscard = (self, f, batching, processAll, n) => uninterru
               return returnNextElement();
             }
           }
-          return succeed$2(res);
+          return succeed$3(res);
         };
         const todo = flatMap$1(stepOrExit(restore(f(a, index))), onRes);
         const fiber = runFiber(todo);
@@ -13721,13 +13960,13 @@ const forEachConcurrentDiscard = (self, f, batching, processAll, n) => uninterru
           fibers.delete(fiber);
           pushResult(exit, index);
           if (results.length === target) {
-            resume(succeed$2(getOrElse(exitCollectAll(collectExits(), {
+            resume(succeed$3(getOrElse(exitCollectAll(collectExits(), {
               parallel: true
             }), () => exitVoid$1)));
           } else if (residual.length + results.length === target) {
             const exits = collectExits();
             const requests = residual.map(blocked => blocked.effect_instruction_i0).reduce(par);
-            resume(succeed$2(blocked(requests, forEachConcurrentDiscard([getOrElse(exitCollectAll(exits, {
+            resume(succeed$3(blocked(requests, forEachConcurrentDiscard([getOrElse(exitCollectAll(exits, {
               parallel: true
             }), () => exitVoid$1), ...residual.map(blocked => blocked.effect_instruction_i1)], i => i, batching, true, n))));
           } else {
@@ -13773,11 +14012,11 @@ const forEachConcurrentDiscard = (self, f, batching, processAll, n) => uninterru
   })));
 })));
 /* @internal */
-const forEachParN = (self, n, f, batching) => suspend(() => {
+const forEachParN = (self, n, f, batching) => suspend$1(() => {
   const as = fromIterable$6(self);
   const array = new Array(as.length);
   const fn = (a, i) => map(f(a, i), b => array[i] = b);
-  return zipRight(forEachConcurrentDiscard(as, fn, batching, false, n), succeed$2(array));
+  return zipRight(forEachConcurrentDiscard(as, fn, batching, false, n), succeed$3(array));
 });
 /* @internal */
 const forkDaemon = self => forkWithScopeOverride(self, globalScope);
@@ -13794,7 +14033,7 @@ const unsafeForkUnstarted = (effect, parentFiber, parentRuntimeFlags, overrideSc
 };
 /** @internal */
 const unsafeMakeChildFiber = (effect, parentFiber, parentRuntimeFlags, overrideScope = null) => {
-  const childId = unsafeMake$3();
+  const childId = unsafeMake$4();
   const parentFiberRefs = parentFiber.getFiberRefs();
   const childFiberRefs = forkAs(parentFiberRefs, childId);
   const childFiber = new FiberRuntime(childId, childFiberRefs, parentRuntimeFlags);
@@ -13807,7 +14046,7 @@ const unsafeMakeChildFiber = (effect, parentFiber, parentRuntimeFlags, overrideS
   return childFiber;
 };
 /* @internal */
-const forkWithScopeOverride = (self, scopeOverride) => withFiberRuntime((parentFiber, parentStatus) => succeed$2(unsafeFork$1(self, parentFiber, parentStatus.runtimeFlags, scopeOverride)));
+const forkWithScopeOverride = (self, scopeOverride) => withFiberRuntime((parentFiber, parentStatus) => succeed$3(unsafeFork$1(self, parentFiber, parentStatus.runtimeFlags, scopeOverride)));
 /* @internal */
 const parallelFinalizers = self => contextWithEffect(context => match$3(getOption(context, scopeTag), {
   onNone: () => self,
@@ -13869,7 +14108,7 @@ const scopeTag = /*#__PURE__*/GenericTag("effect/Scope");
 /* @internal */
 const scopeExtend = /*#__PURE__*/dual(2, (effect, scope) => mapInputContext(effect,
 // @ts-expect-error
-merge$1(make$j(scopeTag, scope))));
+merge$1(make$m(scopeTag, scope))));
 // circular with Supervisor
 /** @internal */
 const fiberRefUnsafeMakeSupervisor = initial => fiberRefUnsafeMakePatch(initial, {
@@ -13916,16 +14155,485 @@ const invokeWithInterrupt = (self, entries, onInterrupt) => fiberIdWith(id => fl
   return sync(() => {
     cleanup.forEach(f => f());
   });
-})), () => suspend(() => {
+})), () => suspend$1(() => {
   const residual = entries.flatMap(entry => {
     if (!entry.state.completed) {
       return [entry];
     }
     return [];
   });
-  return forEachSequentialDiscard(residual, entry => complete(entry.request, exitInterrupt$1(id)));
+  return forEachSequentialDiscard(residual, entry => complete$1(entry.request, exitInterrupt$1(id)));
 })));
 
+/** @internal */
+const complete = (key, exit, entryStats, timeToLiveMillis) => struct({
+  _tag: "Complete",
+  key,
+  exit,
+  entryStats,
+  timeToLiveMillis
+});
+/** @internal */
+const pending = (key, deferred) => struct({
+  _tag: "Pending",
+  key,
+  deferred
+});
+/** @internal */
+const refreshing = (deferred, complete) => struct({
+  _tag: "Refreshing",
+  deferred,
+  complete
+});
+/** @internal */
+const MapKeyTypeId = /*#__PURE__*/Symbol.for("effect/Cache/MapKey");
+class MapKeyImpl {
+  current;
+  [MapKeyTypeId] = MapKeyTypeId;
+  previous = undefined;
+  next = undefined;
+  constructor(current) {
+    this.current = current;
+  }
+  [symbol$1]() {
+    return pipe(hash(this.current), combine$5(hash(this.previous)), combine$5(hash(this.next)), cached(this));
+  }
+  [symbol](that) {
+    if (this === that) {
+      return true;
+    }
+    return isMapKey(that) && equals$1(this.current, that.current) && equals$1(this.previous, that.previous) && equals$1(this.next, that.next);
+  }
+}
+/** @internal */
+const makeMapKey = current => new MapKeyImpl(current);
+/** @internal */
+const isMapKey = u => hasProperty(u, MapKeyTypeId);
+class KeySetImpl {
+  head = undefined;
+  tail = undefined;
+  add(key) {
+    if (key !== this.tail) {
+      if (this.tail === undefined) {
+        this.head = key;
+        this.tail = key;
+      } else {
+        const previous = key.previous;
+        const next = key.next;
+        if (next !== undefined) {
+          key.next = undefined;
+          if (previous !== undefined) {
+            previous.next = next;
+            next.previous = previous;
+          } else {
+            this.head = next;
+            this.head.previous = undefined;
+          }
+        }
+        this.tail.next = key;
+        key.previous = this.tail;
+        this.tail = key;
+      }
+    }
+  }
+  remove() {
+    const key = this.head;
+    if (key !== undefined) {
+      const next = key.next;
+      if (next !== undefined) {
+        key.next = undefined;
+        this.head = next;
+        this.head.previous = undefined;
+      } else {
+        this.head = undefined;
+        this.tail = undefined;
+      }
+    }
+    return key;
+  }
+}
+/** @internal */
+const makeKeySet = () => new KeySetImpl();
+/**
+ * Constructs a new `CacheState` from the specified values.
+ *
+ * @internal
+ */
+const makeCacheState = (map, keys, accesses, updating, hits, misses) => ({
+  map,
+  keys,
+  accesses,
+  updating,
+  hits,
+  misses
+});
+/**
+ * Constructs an initial cache state.
+ *
+ * @internal
+ */
+const initialCacheState = () => makeCacheState(empty$6(), makeKeySet(), unbounded(), make$g(false), 0, 0);
+/** @internal */
+const CacheSymbolKey = "effect/Cache";
+/** @internal */
+const CacheTypeId = /*#__PURE__*/Symbol.for(CacheSymbolKey);
+const cacheVariance = {
+  /* c8 ignore next */
+  _Key: _ => _,
+  /* c8 ignore next */
+  _Error: _ => _,
+  /* c8 ignore next */
+  _Value: _ => _
+};
+/** @internal */
+const ConsumerCacheSymbolKey = "effect/ConsumerCache";
+/** @internal */
+const ConsumerCacheTypeId = /*#__PURE__*/Symbol.for(ConsumerCacheSymbolKey);
+const consumerCacheVariance = {
+  /* c8 ignore next */
+  _Key: _ => _,
+  /* c8 ignore next */
+  _Error: _ => _,
+  /* c8 ignore next */
+  _Value: _ => _
+};
+/** @internal */
+const makeCacheStats = options => options;
+/** @internal */
+const makeEntryStats = loadedMillis => ({
+  loadedMillis
+});
+class CacheImpl {
+  capacity;
+  context;
+  fiberId;
+  lookup;
+  timeToLive;
+  [CacheTypeId] = cacheVariance;
+  [ConsumerCacheTypeId] = consumerCacheVariance;
+  cacheState;
+  constructor(capacity, context, fiberId, lookup, timeToLive) {
+    this.capacity = capacity;
+    this.context = context;
+    this.fiberId = fiberId;
+    this.lookup = lookup;
+    this.timeToLive = timeToLive;
+    this.cacheState = initialCacheState();
+  }
+  get(key) {
+    return map(this.getEither(key), merge$3);
+  }
+  get cacheStats() {
+    return sync(() => makeCacheStats({
+      hits: this.cacheState.hits,
+      misses: this.cacheState.misses,
+      size: size(this.cacheState.map)
+    }));
+  }
+  getOption(key) {
+    return suspend$1(() => match$3(get$1(this.cacheState.map, key), {
+      onNone: () => {
+        const mapKey = makeMapKey(key);
+        this.trackAccess(mapKey);
+        this.trackMiss();
+        return succeed$3(none$4());
+      },
+      onSome: value => this.resolveMapValue(value)
+    }));
+  }
+  getOptionComplete(key) {
+    return suspend$1(() => match$3(get$1(this.cacheState.map, key), {
+      onNone: () => {
+        const mapKey = makeMapKey(key);
+        this.trackAccess(mapKey);
+        this.trackMiss();
+        return succeed$3(none$4());
+      },
+      onSome: value => this.resolveMapValue(value, true)
+    }));
+  }
+  contains(key) {
+    return sync(() => has(this.cacheState.map, key));
+  }
+  entryStats(key) {
+    return sync(() => {
+      const option = get$1(this.cacheState.map, key);
+      if (isSome(option)) {
+        switch (option.value._tag) {
+          case "Complete":
+            {
+              const loaded = option.value.entryStats.loadedMillis;
+              return some(makeEntryStats(loaded));
+            }
+          case "Pending":
+            {
+              return none$4();
+            }
+          case "Refreshing":
+            {
+              const loaded = option.value.complete.entryStats.loadedMillis;
+              return some(makeEntryStats(loaded));
+            }
+        }
+      }
+      return none$4();
+    });
+  }
+  getEither(key) {
+    return suspend$1(() => {
+      const k = key;
+      let mapKey = undefined;
+      let deferred = undefined;
+      let value = getOrUndefined(get$1(this.cacheState.map, k));
+      if (value === undefined) {
+        deferred = unsafeMake$3(this.fiberId);
+        mapKey = makeMapKey(k);
+        if (has(this.cacheState.map, k)) {
+          value = getOrUndefined(get$1(this.cacheState.map, k));
+        } else {
+          set(this.cacheState.map, k, pending(mapKey, deferred));
+        }
+      }
+      if (value === undefined) {
+        this.trackAccess(mapKey);
+        this.trackMiss();
+        return map(this.lookupValueOf(key, deferred), right);
+      } else {
+        return flatMap$1(this.resolveMapValue(value), match$3({
+          onNone: () => this.getEither(key),
+          onSome: value => succeed$3(left(value))
+        }));
+      }
+    });
+  }
+  invalidate(key) {
+    return sync(() => {
+      remove$1(this.cacheState.map, key);
+    });
+  }
+  invalidateWhen(key, when) {
+    return sync(() => {
+      const value = get$1(this.cacheState.map, key);
+      if (isSome(value) && value.value._tag === "Complete") {
+        if (value.value.exit._tag === "Success") {
+          if (when(value.value.exit.value)) {
+            remove$1(this.cacheState.map, key);
+          }
+        }
+      }
+    });
+  }
+  get invalidateAll() {
+    return sync(() => {
+      this.cacheState.map = empty$6();
+    });
+  }
+  refresh(key) {
+    return clockWith(clock => suspend$1(() => {
+      const k = key;
+      const deferred = unsafeMake$3(this.fiberId);
+      let value = getOrUndefined(get$1(this.cacheState.map, k));
+      if (value === undefined) {
+        if (has(this.cacheState.map, k)) {
+          value = getOrUndefined(get$1(this.cacheState.map, k));
+        } else {
+          set(this.cacheState.map, k, pending(makeMapKey(k), deferred));
+        }
+      }
+      if (value === undefined) {
+        return asVoid(this.lookupValueOf(key, deferred));
+      } else {
+        switch (value._tag) {
+          case "Complete":
+            {
+              if (this.hasExpired(clock, value.timeToLiveMillis)) {
+                const found = getOrUndefined(get$1(this.cacheState.map, k));
+                if (equals$1(found, value)) {
+                  remove$1(this.cacheState.map, k);
+                }
+                return asVoid(this.get(key));
+              }
+              // Only trigger the lookup if we're still the current value, `completedResult`
+              return pipe(this.lookupValueOf(key, deferred), when(() => {
+                const current = getOrUndefined(get$1(this.cacheState.map, k));
+                if (equals$1(current, value)) {
+                  const mapValue = refreshing(deferred, value);
+                  set(this.cacheState.map, k, mapValue);
+                  return true;
+                }
+                return false;
+              }), asVoid);
+            }
+          case "Pending":
+            {
+              return _await(value.deferred);
+            }
+          case "Refreshing":
+            {
+              return _await(value.deferred);
+            }
+        }
+      }
+    }));
+  }
+  set(key, value) {
+    return clockWith(clock => sync(() => {
+      const now = clock.unsafeCurrentTimeMillis();
+      const k = key;
+      const lookupResult = succeed$2(value);
+      const mapValue = complete(makeMapKey(k), lookupResult, makeEntryStats(now), now + toMillis(decode(this.timeToLive(lookupResult))));
+      set(this.cacheState.map, k, mapValue);
+    }));
+  }
+  get size() {
+    return sync(() => {
+      return size(this.cacheState.map);
+    });
+  }
+  get values() {
+    return sync(() => {
+      const values = [];
+      for (const entry of this.cacheState.map) {
+        if (entry[1]._tag === "Complete" && entry[1].exit._tag === "Success") {
+          values.push(entry[1].exit.value);
+        }
+      }
+      return values;
+    });
+  }
+  get entries() {
+    return sync(() => {
+      const values = [];
+      for (const entry of this.cacheState.map) {
+        if (entry[1]._tag === "Complete" && entry[1].exit._tag === "Success") {
+          values.push([entry[0], entry[1].exit.value]);
+        }
+      }
+      return values;
+    });
+  }
+  get keys() {
+    return sync(() => {
+      const keys = [];
+      for (const entry of this.cacheState.map) {
+        if (entry[1]._tag === "Complete" && entry[1].exit._tag === "Success") {
+          keys.push(entry[0]);
+        }
+      }
+      return keys;
+    });
+  }
+  resolveMapValue(value, ignorePending = false) {
+    return clockWith(clock => {
+      switch (value._tag) {
+        case "Complete":
+          {
+            this.trackAccess(value.key);
+            if (this.hasExpired(clock, value.timeToLiveMillis)) {
+              remove$1(this.cacheState.map, value.key.current);
+              return succeed$3(none$4());
+            }
+            this.trackHit();
+            return map(value.exit, some);
+          }
+        case "Pending":
+          {
+            this.trackAccess(value.key);
+            this.trackHit();
+            if (ignorePending) {
+              return succeed$3(none$4());
+            }
+            return map(_await(value.deferred), some);
+          }
+        case "Refreshing":
+          {
+            this.trackAccess(value.complete.key);
+            this.trackHit();
+            if (this.hasExpired(clock, value.complete.timeToLiveMillis)) {
+              if (ignorePending) {
+                return succeed$3(none$4());
+              }
+              return map(_await(value.deferred), some);
+            }
+            return map(value.complete.exit, some);
+          }
+      }
+    });
+  }
+  trackHit() {
+    this.cacheState.hits = this.cacheState.hits + 1;
+  }
+  trackMiss() {
+    this.cacheState.misses = this.cacheState.misses + 1;
+  }
+  trackAccess(key) {
+    offer(this.cacheState.accesses, key);
+    if (compareAndSet(this.cacheState.updating, false, true)) {
+      let loop = true;
+      while (loop) {
+        const key = poll(this.cacheState.accesses, EmptyMutableQueue);
+        if (key === EmptyMutableQueue) {
+          loop = false;
+        } else {
+          this.cacheState.keys.add(key);
+        }
+      }
+      let size$1 = size(this.cacheState.map);
+      loop = size$1 > this.capacity;
+      while (loop) {
+        const key = this.cacheState.keys.remove();
+        if (key !== undefined) {
+          if (has(this.cacheState.map, key.current)) {
+            remove$1(this.cacheState.map, key.current);
+            size$1 = size$1 - 1;
+            loop = size$1 > this.capacity;
+          }
+        } else {
+          loop = false;
+        }
+      }
+      set$2(this.cacheState.updating, false);
+    }
+  }
+  hasExpired(clock, timeToLiveMillis) {
+    return clock.unsafeCurrentTimeMillis() > timeToLiveMillis;
+  }
+  lookupValueOf(input, deferred) {
+    return clockWith(clock => suspend$1(() => {
+      const key = input;
+      return pipe(this.lookup(input), provideContext$1(this.context), exit, flatMap$1(exit => {
+        const now = clock.unsafeCurrentTimeMillis();
+        const stats = makeEntryStats(now);
+        const value = complete(makeMapKey(key), exit, stats, now + toMillis(decode(this.timeToLive(exit))));
+        set(this.cacheState.map, key, value);
+        return zipRight(done$2(deferred, exit), exit);
+      }), onInterrupt(() => zipRight(interrupt(deferred), sync(() => {
+        remove$1(this.cacheState.map, key);
+      }))));
+    }));
+  }
+}
+/** @internal */
+const make$2 = options => {
+  const timeToLive = decode(options.timeToLive);
+  return makeWith({
+    capacity: options.capacity,
+    lookup: options.lookup,
+    timeToLive: () => timeToLive
+  });
+};
+/** @internal */
+const makeWith = options => map(all([context(), fiberId]), ([context, fiberId]) => new CacheImpl(options.capacity, context, fiberId, options.lookup, exit => decode(options.timeToLive(exit))));
+
+/**
+ * Constructs a new cache with the specified capacity, time to live, and
+ * lookup function.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make$1 = make$2;
+
 /**
  * @since 2.0.0
  */
@@ -13955,7 +14663,7 @@ const makeDual = f => function () {
 };
 /** @internal */
 const unsafeFork = /*#__PURE__*/makeDual((runtime, self, options) => {
-  const fiberId = unsafeMake$3();
+  const fiberId = unsafeMake$4();
   const fiberRefUpdates = [[currentContext, [[fiberId, runtime.context]]]];
   if (options?.scheduler) {
     fiberRefUpdates.push([currentScheduler, [[fiberId, options.scheduler]]]);
@@ -13988,31 +14696,6 @@ const unsafeFork = /*#__PURE__*/makeDual((runtime, self, options) => {
   return fiberRuntime;
 });
 /** @internal */
-const unsafeRunSync = /*#__PURE__*/makeDual((runtime, effect) => {
-  const result = unsafeRunSyncExit(runtime)(effect);
-  if (result._tag === "Failure") {
-    throw fiberFailure(result.effect_instruction_i0);
-  }
-  return result.effect_instruction_i0;
-});
-class AsyncFiberExceptionImpl extends Error {
-  fiber;
-  _tag = "AsyncFiberException";
-  constructor(fiber) {
-    super(`Fiber #${fiber.id().id} cannot be resolved synchronously. This is caused by using runSync on an effect that performs async work`);
-    this.fiber = fiber;
-    this.name = this._tag;
-    this.stack = this.message;
-  }
-}
-const asyncFiberException = fiber => {
-  const limit = Error.stackTraceLimit;
-  Error.stackTraceLimit = 0;
-  const error = new AsyncFiberExceptionImpl(fiber);
-  Error.stackTraceLimit = limit;
-  return error;
-};
-/** @internal */
 const FiberFailureId = /*#__PURE__*/Symbol.for("effect/Runtime/FiberFailure");
 /** @internal */
 const FiberFailureCauseId = /*#__PURE__*/Symbol.for("effect/Runtime/FiberFailure/Cause");
@@ -14081,23 +14764,6 @@ const fastPath = effect => {
   }
 };
 /** @internal */
-const unsafeRunSyncExit = /*#__PURE__*/makeDual((runtime, effect) => {
-  const op = fastPath(effect);
-  if (op) {
-    return op;
-  }
-  const scheduler = new SyncScheduler();
-  const fiberRuntime = unsafeFork(runtime)(effect, {
-    scheduler
-  });
-  scheduler.flush();
-  const result = fiberRuntime.unsafePoll();
-  if (result) {
-    return result;
-  }
-  return exitDie$1(capture(asyncFiberException(fiberRuntime), currentSpanFromFiber(fiberRuntime)));
-});
-/** @internal */
 const unsafeRunPromise = /*#__PURE__*/makeDual((runtime, effect, options) => unsafeRunPromiseExit(runtime, effect, options).then(result => {
   switch (result._tag) {
     case OP_SUCCESS:
@@ -14149,17 +14815,15 @@ class RuntimeImpl {
 /** @internal */
 const make = options => new RuntimeImpl(options.context, options.runtimeFlags, options.fiberRefs);
 /** @internal */
-const defaultRuntimeFlags = /*#__PURE__*/make$a(Interruption, CooperativeYielding, RuntimeMetrics);
+const defaultRuntimeFlags = /*#__PURE__*/make$d(Interruption, CooperativeYielding, RuntimeMetrics);
 /** @internal */
 const defaultRuntime = /*#__PURE__*/make({
-  context: /*#__PURE__*/empty$h(),
+  context: /*#__PURE__*/empty$i(),
   runtimeFlags: defaultRuntimeFlags,
   fiberRefs: /*#__PURE__*/empty$2()
 });
 /** @internal */
 const unsafeRunPromiseEffect = /*#__PURE__*/unsafeRunPromise(defaultRuntime);
-/** @internal */
-const unsafeRunSyncEffect = /*#__PURE__*/unsafeRunSync(defaultRuntime);
 
 /**
  * Provides a constructor for a Case Class.
@@ -14257,7 +14921,7 @@ const TaggedError = tag => {
  * @since 2.0.0
  * @category Creating Effects
  */
-const gen = gen$1;
+const gen = gen$2;
 /**
  * Creates an `Effect` that always succeeds with a given value.
  *
@@ -14283,7 +14947,7 @@ const gen = gen$1;
  * @since 2.0.0
  * @category Creating Effects
  */
-const succeed = succeed$2;
+const succeed = succeed$3;
 /**
  * Handles all errors in an effect by providing a fallback effect.
  *
@@ -14340,72 +15004,6 @@ const succeed = succeed$2;
  * @category Error handling
  */
 const catchAll = catchAll$1;
-const try_ = try_$1;
-/**
- * Creates an `Effect` that represents an asynchronous computation that might
- * fail.
- *
- * **When to Use**
- *
- * In situations where you need to perform asynchronous operations that might
- * fail, such as fetching data from an API, you can use the `tryPromise`
- * constructor. This constructor is designed to handle operations that could
- * throw exceptions by capturing those exceptions and transforming them into
- * manageable errors.
- *
- * **Error Handling**
- *
- * There are two ways to handle errors with `tryPromise`:
- *
- * 1. If you don't provide a `catch` function, the error is caught and the
- *    effect fails with an `UnknownException`.
- * 2. If you provide a `catch` function, the error is caught and the `catch`
- *    function maps it to an error of type `E`.
- *
- * **Interruptions**
- *
- * An optional `AbortSignal` can be provided to allow for interruption of the
- * wrapped `Promise` API.
- *
- * **Example** (Fetching a TODO Item)
- *
- * ```ts
- * import { Effect } from "effect"
- *
- * const getTodo = (id: number) =>
- *   // Will catch any errors and propagate them as UnknownException
- *   Effect.tryPromise(() =>
- *     fetch(`https://jsonplaceholder.typicode.com/todos/${id}`)
- *   )
- *
- * //      ┌─── Effect<Response, UnknownException, never>
- * //      ▼
- * const program = getTodo(1)
- * ```
- *
- * **Example** (Custom Error Handling)
- *
- * ```ts
- * import { Effect } from "effect"
- *
- * const getTodo = (id: number) =>
- *   Effect.tryPromise({
- *     try: () => fetch(`https://jsonplaceholder.typicode.com/todos/${id}`),
- *     // remap the error
- *     catch: (unknown) => new Error(`something went wrong ${unknown}`)
- *   })
- *
- * //      ┌─── Effect<Response, Error, never>
- * //      ▼
- * const program = getTodo(1)
- * ```
- *
- * @see {@link promise} if the effectful computation is asynchronous and does not throw errors.
- *
- * @since 2.0.0
- * @category Creating Effects
- */
-const tryPromise = tryPromise$1;
 /**
  * Execute a side effect on failure without modifying the original effect.
  *
@@ -14470,51 +15068,6 @@ const logWarning = logWarning$1;
  * @category Logging
  */
 const logError = logError$1;
-/**
- * Ensures the effect always succeeds by replacing failures with a default
- * success value.
- *
- * **Details**
- *
- * This function transforms an effect that may fail into one that cannot fail by
- * replacing any failure with a provided success value. If the original effect
- * fails, the failure is "swallowed," and the specified success value is
- * returned instead. If the original effect succeeds, its value remains
- * unchanged.
- *
- * **When to Use**
- *
- * This is especially useful for providing default values in case of failure,
- * ensuring that an effect always completes successfully. By using this
- * function, you can avoid the need for complex error handling and guarantee a
- * fallback result.
- *
- * **Example**
- *
- * ```ts
- * import { Effect } from "effect"
- *
- * const validate = (age: number): Effect.Effect<number, string> => {
- *   if (age < 0) {
- *     return Effect.fail("NegativeAgeError")
- *   } else if (age < 18) {
- *     return Effect.fail("IllegalAgeError")
- *   } else {
- *     return Effect.succeed(age)
- *   }
- * }
- *
- * const program = Effect.orElseSucceed(validate(-1), () => 18)
- *
- * console.log(Effect.runSyncExit(program))
- * // Output:
- * // { _id: 'Exit', _tag: 'Success', value: 18 }
- * ```
- *
- * @since 2.0.0
- * @category Fallback
- */
-const orElseSucceed = orElseSucceed$1;
 /**
  * Executes an effect and returns the result as a `Promise`.
  *
@@ -14560,168 +15113,93 @@ const orElseSucceed = orElseSucceed$1;
  * @category Running Effects
  */
 const runPromise = unsafeRunPromiseEffect;
-/**
- * Executes an effect synchronously, running it immediately and returning the
- * result.
- *
- * **Details**
- *
- * This function evaluates the provided effect synchronously, returning its
- * result directly. It is ideal for effects that do not fail or include
- * asynchronous operations. If the effect does fail or involves async tasks, it
- * will throw an error. Execution stops at the point of failure or asynchronous
- * operation, making it unsuitable for effects that require asynchronous
- * handling.
- *
- * **Important**: Attempting to run effects that involve asynchronous operations
- * or failures will result in exceptions being thrown, so use this function with
- * care for purely synchronous and error-free effects.
- *
- * **When to Use**
- *
- * Use this function when:
- * - You are sure that the effect will not fail or involve asynchronous
- *   operations.
- * - You need a direct, synchronous result from the effect.
- * - You are working within a context where asynchronous effects are not
- *   allowed.
- *
- * Avoid using this function for effects that can fail or require asynchronous
- * handling. For such cases, consider using {@link runPromise} or
- * {@link runSyncExit}.
- *
- * **Example** (Synchronous Logging)
- *
- * ```ts
- * import { Effect } from "effect"
- *
- * const program = Effect.sync(() => {
- *   console.log("Hello, World!")
- *   return 1
- * })
- *
- * const result = Effect.runSync(program)
- * // Output: Hello, World!
- *
- * console.log(result)
- * // Output: 1
- * ```
- *
- * **Example** (Incorrect Usage with Failing or Async Effects)
- *
- * ```ts
- * import { Effect } from "effect"
- *
- * try {
- *   // Attempt to run an effect that fails
- *   Effect.runSync(Effect.fail("my error"))
- * } catch (e) {
- *   console.error(e)
- * }
- * // Output:
- * // (FiberFailure) Error: my error
- *
- * try {
- *   // Attempt to run an effect that involves async work
- *   Effect.runSync(Effect.promise(() => Promise.resolve(1)))
- * } catch (e) {
- *   console.error(e)
- * }
- * // Output:
- * // (FiberFailure) AsyncFiberException: Fiber #0 cannot be resolved synchronously. This is caused by using runSync on an effect that performs async work
- * ```
- *
- * @see {@link runSyncExit} for a version that returns an `Exit` type instead of
- * throwing an error.
- *
- * @since 2.0.0
- * @category Running Effects
- */
-const runSync = unsafeRunSyncEffect;
 
-function getLocationBase() {
-    return (typeof document === 'undefined' ? require('u' + 'rl').pathToFileURL(__filename).href : (_documentCurrentScript && _documentCurrentScript.tagName.toUpperCase() === 'SCRIPT' && _documentCurrentScript.src || new URL('assets-CB5ikzmP.js', document.baseURI).href)) ?? window?.location?.origin ?? '';
+class FetchError extends TaggedError('FetchError') {
+}
+class NotFoundError extends TaggedError('NotFoundError') {
+}
+const httpClient = (input, init) => gen$1(function* () {
+    const response = yield* tryPromise({
+        try: () => fetch(input, init),
+        catch: error => new FetchError({ cause: error }),
+    });
+    if (response.status === 404) {
+        return yield* fail(new NotFoundError({ url: response.url }));
+    }
+    return response;
+});
+class ResponseTextError extends TaggedError('ResponseTextError') {
+    constructor(error) {
+        super(new Error(`Failed to read response text`, { cause: error }));
+    }
 }
+const responseAsText = (res) => tryPromise({
+    try: () => res.text(),
+    catch: error => new ResponseTextError(error),
+});
 
-class URLCreationError extends TaggedError('URLCreationError') {
+const SVGString = refined(isValidSVG, () => error('SVG data is malformed'));
+class BrandValidationError extends TaggedError('BrandValidationError') {
+    constructor(error, type) {
+        super(new Error(`Brand validation failed for type ${type}.`, { cause: error }));
+    }
 }
-const relativeAssetsPath = '../../assets';
-const syncCreateAssetUrlSafely = (file, pathFromAssetRoot) => {
-    const relativeAssetPath = joinPath(relativeAssetsPath, pathFromAssetRoot, file);
-    return try_(() => index.getAssetPath(relativeAssetPath)).pipe(tapError(() => logWarning(`Failed to create URL for asset "${file}" in path "${pathFromAssetRoot}".
-           Please provide an absolute URL in your app's 'setAssetPath(...)' configuration! Falling back to a relative URL, which may work in some environments but is not guaranteed to be correct.`)), orElseSucceed(() => new URL(relativeAssetPath, getLocationBase())));
-};
-function joinPath(...parts) {
-    return parts.filter(Boolean).join('/').replace('//', '/').replace('/./', '/');
+const createValidSVGString = (svg) => try_({
+    try: () => SVGString(svg),
+    catch: error => new BrandValidationError(error, 'SVGString'),
+});
+function isValidSVG(svg) {
+    if (typeof svg !== 'string') {
+        return false;
+    }
+    try {
+        const parser = new DOMParser();
+        const doc = parser.parseFromString(svg, 'image/svg+xml');
+        return doc.documentElement.nodeName === 'svg';
+    }
+    catch {
+        return false;
+    }
+}
+
+const emptyDefaultSvg = () => SVGString(`<svg width="24" height="24" viewBox="0 0 24 24" fill="none" xmlns="http://www.w3.org/2000/svg"></svg>`);
+const createIconCache = () => make$1({
+    capacity: 200,
+    timeToLive: infinity,
+    lookup: (key) => gen(function* () {
+        const name = key;
+        const assetPath = assets.createAssetUrlSafely(`${name}.svg`, 'icons');
+        const res = yield* httpClient(assetPath);
+        const responseString = yield* responseAsText(res);
+        return yield* createValidSVGString(responseString);
+    }),
+});
+let cacheInstance = null;
+function fetchIconSvg(name) {
+    const key = name;
+    return gen(function* () {
+        if (!cacheInstance) {
+            cacheInstance = yield* createIconCache();
+        }
+        return yield* cacheInstance.get(key);
+    });
+}
+function clearIconCache() {
+    return gen(function* () {
+        if (cacheInstance) {
+            yield* cacheInstance.invalidateAll;
+        }
+        else {
+            logWarning('Attempted to clear icon cache before it was initialized');
+        }
+    });
 }
 
-exports.NodeInspectSymbol = NodeInspectSymbol;
-exports.TaggedError = TaggedError;
-exports.all = all;
-exports.asVoid = asVoid;
-exports.cached = cached;
 exports.catchAll = catchAll;
-exports.clockWith = clockWith;
-exports.combine = combine$5;
-exports.compareAndSet = compareAndSet;
-exports.context = context;
-exports.decode = decode;
-exports.deferredAwait = deferredAwait;
-exports.deferredDone = deferredDone;
-exports.deferredInterrupt = deferredInterrupt;
-exports.deferredUnsafeMake = deferredUnsafeMake;
-exports.dual = dual;
-exports.empty = empty$5;
-exports.equals = equals$1;
-exports.exit = exit;
-exports.exitSucceed = exitSucceed$1;
-exports.fiberId = fiberId;
-exports.flatMap = flatMap$1;
-exports.format = format$2;
-exports.gen = gen;
-exports.get = get$1;
-exports.getOrThrowWith = getOrThrowWith$1;
-exports.getOrUndefined = getOrUndefined;
-exports.getRight = getRight;
-exports.has = has;
-exports.hasProperty = hasProperty;
-exports.hash = hash;
-exports.identity = identity;
-exports.infinity = infinity;
-exports.isRight = isRight;
-exports.isSome = isSome;
-exports.left = left;
+exports.clearIconCache = clearIconCache;
+exports.emptyDefaultSvg = emptyDefaultSvg;
+exports.fetchIconSvg = fetchIconSvg;
 exports.logError = logError;
-exports.logWarning = logWarning;
-exports.make = make$d;
-exports.map = map;
-exports.match = match$3;
-exports.merge = merge$3;
-exports.none = none$4;
-exports.onInterrupt = onInterrupt;
-exports.pipe = pipe;
-exports.pipeArguments = pipeArguments;
-exports.provideContext = provideContext$1;
-exports.remove = remove;
-exports.right = right;
 exports.runPromise = runPromise;
-exports.runSync = runSync;
-exports.set = set;
-exports.set$1 = set$2;
-exports.size = size;
-exports.some = some;
-exports.struct = struct;
 exports.succeed = succeed;
-exports.succeed$1 = succeed$2;
-exports.suspend = suspend;
-exports.symbol = symbol$1;
-exports.symbol$1 = symbol;
-exports.sync = sync;
-exports.syncCreateAssetUrlSafely = syncCreateAssetUrlSafely;
 exports.tapError = tapError;
-exports.toJSON = toJSON;
-exports.toMillis = toMillis;
-exports.tryPromise = tryPromise;
-exports.try_ = try_;
-exports.when = when;
-exports.zipRight = zipRight;