effect 4.0.0-beta.2 → 4.0.0-beta.21

package/dist/TxHashMap.d.ts

@@ -2,6 +2,7 @@
  * @since 2.0.0
  */
 import * as Effect from "./Effect.ts";
+import type * as Filter from "./Filter.ts";
 import * as HashMap from "./HashMap.ts";
 import type { Inspectable } from "./Inspectable.ts";
 import * as Option from "./Option.ts";
@@ -27,7 +28,7 @@ declare const TypeId = "~effect/transactions/TxHashMap";
  *   console.log(user) // Option.some("Alice")
  *
  *   // Multi-step atomic operations
- *   yield* Effect.atomic(
+ *   yield* Effect.transaction(
  *     Effect.gen(function*() {
  *       const currentUser = yield* TxHashMap.get(txMap, "user1")
  *       if (Option.isSome(currentUser)) {
@@ -206,7 +207,7 @@ export declare namespace TxHashMap {
  * @since 2.0.0
  * @category constructors
  */
-export declare const empty: <K, V>() => Effect.Effect<TxHashMap<K, V>>;
+export declare const empty: <K, V>() => Effect.Effect<TxHashMap<K, V>, never, Effect.Transaction>;
 /**
  * Creates a TxHashMap from the provided key-value pairs.
  *
@@ -238,7 +239,7 @@ export declare const empty: <K, V>() => Effect.Effect<TxHashMap<K, V>>;
  * @since 2.0.0
  * @category constructors
  */
-export declare const make: <K, V>(...entries: Array<readonly [K, V]>) => Effect.Effect<TxHashMap<K, V>>;
+export declare const make: <K, V>(...entries: Array<readonly [K, V]>) => Effect.Effect<TxHashMap<K, V>, never, Effect.Transaction>;
 /**
  * Creates a TxHashMap from an iterable of key-value pairs.
  *
@@ -273,7 +274,7 @@ export declare const make: <K, V>(...entries: Array<readonly [K, V]>) => Effect.
  * @since 2.0.0
  * @category constructors
  */
-export declare const fromIterable: <K, V>(entries: Iterable<readonly [K, V]>) => Effect.Effect<TxHashMap<K, V>>;
+export declare const fromIterable: <K, V>(entries: Iterable<readonly [K, V]>) => Effect.Effect<TxHashMap<K, V>, never, Effect.Transaction>;
 /**
  * Safely lookup the value for the specified key in the TxHashMap.
  *
@@ -337,7 +338,7 @@ export declare const get: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K>(key: K1): <V>(self: TxHashMap<K, V>) => Effect.Effect<Option.Option<V>>;
+    <K1 extends K, K>(key: K1): <V>(self: TxHashMap<K, V>) => Effect.Effect<Option.Option<V>, never, Effect.Transaction>;
     /**
      * Safely lookup the value for the specified key in the TxHashMap.
      *
@@ -369,7 +370,7 @@ export declare const get: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1): Effect.Effect<Option.Option<V>>;
+    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1): Effect.Effect<Option.Option<V>, never, Effect.Transaction>;
 };
 /**
  * Sets the value for the specified key in the TxHashMap.
@@ -440,7 +441,7 @@ export declare const set: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(key: K, value: V): (self: TxHashMap<K, V>) => Effect.Effect<void>;
+    <K, V>(key: K, value: V): (self: TxHashMap<K, V>) => Effect.Effect<void, never, Effect.Transaction>;
     /**
      * Sets the value for the specified key in the TxHashMap.
      *
@@ -475,7 +476,7 @@ export declare const set: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, key: K, value: V): Effect.Effect<void>;
+    <K, V>(self: TxHashMap<K, V>, key: K, value: V): Effect.Effect<void, never, Effect.Transaction>;
 };
 /**
  * Checks if the specified key exists in the TxHashMap.
@@ -538,7 +539,7 @@ export declare const has: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K>(key: K1): <V>(self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+    <K1 extends K, K>(key: K1): <V>(self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
     /**
      * Checks if the specified key exists in the TxHashMap.
      *
@@ -569,7 +570,7 @@ export declare const has: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1): Effect.Effect<boolean>;
+    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1): Effect.Effect<boolean, never, Effect.Transaction>;
 };
 /**
  * Removes the specified key from the TxHashMap.
@@ -646,7 +647,7 @@ export declare const remove: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K>(key: K1): <V>(self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+    <K1 extends K, K>(key: K1): <V>(self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
     /**
      * Removes the specified key from the TxHashMap.
      *
@@ -684,7 +685,7 @@ export declare const remove: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1): Effect.Effect<boolean>;
+    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1): Effect.Effect<boolean, never, Effect.Transaction>;
 };
 /**
  * Removes all entries from the TxHashMap.
@@ -722,7 +723,7 @@ export declare const remove: {
  * @since 2.0.0
  * @category combinators
  */
-export declare const clear: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<void>;
+export declare const clear: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<void, never, Effect.Transaction>;
 /**
  * Returns the number of entries in the TxHashMap.
  *
@@ -755,7 +756,7 @@ export declare const clear: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<void>
  * @since 2.0.0
  * @category combinators
  */
-export declare const size: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<number>;
+export declare const size: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<number, never, Effect.Transaction>;
 /**
  * Checks if the TxHashMap is empty.
  *
@@ -784,7 +785,7 @@ export declare const size: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<number
  * @since 2.0.0
  * @category combinators
  */
-export declare const isEmpty: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+export declare const isEmpty: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
 /**
  * Checks if the TxHashMap is non-empty.
  *
@@ -808,7 +809,7 @@ export declare const isEmpty: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<boo
  * @since 2.0.0
  * @category combinators
  */
-export declare const isNonEmpty: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+export declare const isNonEmpty: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
 /**
  * Updates the value for the specified key if it exists.
  *
@@ -896,7 +897,7 @@ export declare const modify: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(key: K, f: (value: V) => V): (self: TxHashMap<K, V>) => Effect.Effect<Option.Option<V>>;
+    <K, V>(key: K, f: (value: V) => V): (self: TxHashMap<K, V>) => Effect.Effect<Option.Option<V>, never, Effect.Transaction>;
     /**
      * Updates the value for the specified key if it exists.
      *
@@ -940,7 +941,7 @@ export declare const modify: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, key: K, f: (value: V) => V): Effect.Effect<Option.Option<V>>;
+    <K, V>(self: TxHashMap<K, V>, key: K, f: (value: V) => V): Effect.Effect<Option.Option<V>, never, Effect.Transaction>;
 };
 /**
  * Updates the value for the specified key using an Option-based update function.
@@ -1029,7 +1030,7 @@ export declare const modifyAt: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(key: K, f: (value: Option.Option<V>) => Option.Option<V>): (self: TxHashMap<K, V>) => Effect.Effect<void>;
+    <K, V>(key: K, f: (value: Option.Option<V>) => Option.Option<V>): (self: TxHashMap<K, V>) => Effect.Effect<void, never, Effect.Transaction>;
     /**
      * Updates the value for the specified key using an Option-based update function.
      *
@@ -1073,7 +1074,7 @@ export declare const modifyAt: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, key: K, f: (value: Option.Option<V>) => Option.Option<V>): Effect.Effect<void>;
+    <K, V>(self: TxHashMap<K, V>, key: K, f: (value: Option.Option<V>) => Option.Option<V>): Effect.Effect<void, never, Effect.Transaction>;
 };
 /**
  * Returns an array of all keys in the TxHashMap.
@@ -1105,7 +1106,7 @@ export declare const modifyAt: {
  * @since 2.0.0
  * @category combinators
  */
-export declare const keys: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<K>>;
+export declare const keys: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<K>, never, Effect.Transaction>;
 /**
  * Returns an array of all values in the TxHashMap.
  *
@@ -1137,7 +1138,7 @@ export declare const keys: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<
  * @since 2.0.0
  * @category combinators
  */
-export declare const values: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<V>>;
+export declare const values: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<V>, never, Effect.Transaction>;
 /**
  * Returns an array of all key-value pairs in the TxHashMap.
  *
@@ -1169,7 +1170,7 @@ export declare const values: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Arra
  * @since 2.0.0
  * @category combinators
  */
-export declare const entries: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<readonly [K, V]>>;
+export declare const entries: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<readonly [K, V]>, never, Effect.Transaction>;
 /**
  * Returns an immutable snapshot of the current TxHashMap state.
  *
@@ -1204,7 +1205,7 @@ export declare const entries: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Arr
  * @since 2.0.0
  * @category combinators
  */
-export declare const snapshot: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<HashMap.HashMap<K, V>>;
+export declare const snapshot: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<HashMap.HashMap<K, V>, never, Effect.Transaction>;
 /**
  * Merges another HashMap into this TxHashMap. If both maps contain the same key,
  * the value from the other map will be used.
@@ -1300,7 +1301,7 @@ export declare const union: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V1 extends V, V>(other: HashMap.HashMap<K1, V1>): (self: TxHashMap<K, V>) => Effect.Effect<void>;
+    <K1 extends K, K, V1 extends V, V>(other: HashMap.HashMap<K1, V1>): (self: TxHashMap<K, V>) => Effect.Effect<void, never, Effect.Transaction>;
     /**
      * Merges another HashMap into this TxHashMap. If both maps contain the same key,
      * the value from the other map will be used.
@@ -1348,7 +1349,7 @@ export declare const union: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V1 extends V, V>(self: TxHashMap<K, V>, other: HashMap.HashMap<K1, V1>): Effect.Effect<void>;
+    <K1 extends K, K, V1 extends V, V>(self: TxHashMap<K, V>, other: HashMap.HashMap<K1, V1>): Effect.Effect<void, never, Effect.Transaction>;
 };
 /**
  * Removes multiple keys from the TxHashMap.
@@ -1435,7 +1436,7 @@ export declare const removeMany: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K>(keys: Iterable<K1>): <V>(self: TxHashMap<K, V>) => Effect.Effect<void>;
+    <K1 extends K, K>(keys: Iterable<K1>): <V>(self: TxHashMap<K, V>) => Effect.Effect<void, never, Effect.Transaction>;
     /**
      * Removes multiple keys from the TxHashMap.
      *
@@ -1478,7 +1479,7 @@ export declare const removeMany: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V>(self: TxHashMap<K, V>, keys: Iterable<K1>): Effect.Effect<void>;
+    <K1 extends K, K, V>(self: TxHashMap<K, V>, keys: Iterable<K1>): Effect.Effect<void, never, Effect.Transaction>;
 };
 /**
  * Sets multiple key-value pairs in the TxHashMap.
@@ -1595,7 +1596,7 @@ export declare const setMany: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V1 extends V, V>(entries: Iterable<readonly [K1, V1]>): (self: TxHashMap<K, V>) => Effect.Effect<void>;
+    <K1 extends K, K, V1 extends V, V>(entries: Iterable<readonly [K1, V1]>): (self: TxHashMap<K, V>) => Effect.Effect<void, never, Effect.Transaction>;
     /**
      * Sets multiple key-value pairs in the TxHashMap.
      *
@@ -1653,7 +1654,7 @@ export declare const setMany: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V1 extends V, V>(self: TxHashMap<K, V>, entries: Iterable<readonly [K1, V1]>): Effect.Effect<void>;
+    <K1 extends K, K, V1 extends V, V>(self: TxHashMap<K, V>, entries: Iterable<readonly [K1, V1]>): Effect.Effect<void, never, Effect.Transaction>;
 };
 /**
  * Returns `true` if the specified value is a `TxHashMap`, `false` otherwise.
@@ -1758,7 +1759,7 @@ export declare const getHash: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K>(key: K1, hash: number): <V>(self: TxHashMap<K, V>) => Effect.Effect<Option.Option<V>>;
+    <K1 extends K, K>(key: K1, hash: number): <V>(self: TxHashMap<K, V>) => Effect.Effect<Option.Option<V>, never, Effect.Transaction>;
     /**
      * Lookup the value for the specified key in the TxHashMap using a custom hash.
      * This can provide performance benefits when the hash is precomputed.
@@ -1795,7 +1796,7 @@ export declare const getHash: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1, hash: number): Effect.Effect<Option.Option<V>>;
+    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1, hash: number): Effect.Effect<Option.Option<V>, never, Effect.Transaction>;
 };
 /**
  * Checks if the specified key has an entry in the TxHashMap using a custom hash.
@@ -1888,7 +1889,7 @@ export declare const hasHash: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K>(key: K1, hash: number): <V>(self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+    <K1 extends K, K>(key: K1, hash: number): <V>(self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
     /**
      * Checks if the specified key has an entry in the TxHashMap using a custom hash.
      * This can provide performance benefits when the hash is precomputed.
@@ -1934,7 +1935,7 @@ export declare const hasHash: {
      * @since 2.0.0
      * @category combinators
      */
-    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1, hash: number): Effect.Effect<boolean>;
+    <K1 extends K, K, V>(self: TxHashMap<K, V>, key: K1, hash: number): Effect.Effect<boolean, never, Effect.Transaction>;
 };
 /**
  * Transforms all values in the TxHashMap using the provided function, preserving keys.
@@ -2027,7 +2028,7 @@ export declare const map: {
      * @since 2.0.0
      * @category combinators
      */
-    <A, V, K>(f: (value: V, key: K) => A): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, A>>;
+    <A, V, K>(f: (value: V, key: K) => A): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
     /**
      * Transforms all values in the TxHashMap using the provided function, preserving keys.
      *
@@ -2073,7 +2074,7 @@ export declare const map: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, A>(self: TxHashMap<K, V>, f: (value: V, key: K) => A): Effect.Effect<TxHashMap<K, A>>;
+    <K, V, A>(self: TxHashMap<K, V>, f: (value: V, key: K) => A): Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
 };
 /**
  * Filters the TxHashMap to keep only entries that satisfy the provided predicate.
@@ -2172,7 +2173,7 @@ export declare const filter: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, B extends V>(predicate: (value: V, key: K) => value is B): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, B>>;
+    <K, V, B extends V>(predicate: (value: V, key: K) => value is B): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, B>, never, Effect.Transaction>;
     /**
      * Filters the TxHashMap to keep only entries that satisfy the provided predicate.
      *
@@ -2221,7 +2222,7 @@ export declare const filter: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, V>>;
+    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, V>, never, Effect.Transaction>;
     /**
      * Filters the TxHashMap to keep only entries that satisfy the provided predicate.
      *
@@ -2270,7 +2271,7 @@ export declare const filter: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, B extends V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => value is B): Effect.Effect<TxHashMap<K, B>>;
+    <K, V, B extends V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => value is B): Effect.Effect<TxHashMap<K, B>, never, Effect.Transaction>;
     /**
      * Filters the TxHashMap to keep only entries that satisfy the provided predicate.
      *
@@ -2319,7 +2320,7 @@ export declare const filter: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<TxHashMap<K, V>>;
+    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<TxHashMap<K, V>, never, Effect.Transaction>;
 };
 /**
  * Reduces the TxHashMap entries to a single value by applying a reducer function.
@@ -2430,7 +2431,7 @@ export declare const reduce: {
      * @since 2.0.0
      * @category combinators
      */
-    <A, V, K>(zero: A, f: (accumulator: A, value: V, key: K) => A): (self: TxHashMap<K, V>) => Effect.Effect<A>;
+    <A, V, K>(zero: A, f: (accumulator: A, value: V, key: K) => A): (self: TxHashMap<K, V>) => Effect.Effect<A, never, Effect.Transaction>;
     /**
      * Reduces the TxHashMap entries to a single value by applying a reducer function.
      * Iterates over all key-value pairs and accumulates them into a final result.
@@ -2485,18 +2486,18 @@ export declare const reduce: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, A>(self: TxHashMap<K, V>, zero: A, f: (accumulator: A, value: V, key: K) => A): Effect.Effect<A>;
+    <K, V, A>(self: TxHashMap<K, V>, zero: A, f: (accumulator: A, value: V, key: K) => A): Effect.Effect<A, never, Effect.Transaction>;
 };
 /**
- * Combines filtering and mapping in a single operation. Applies a function that returns
- * an Option to each entry, keeping only the Some values and transforming them.
+ * Combines filtering and mapping in a single operation. Applies a filter to each
+ * entry, keeping only successful results and transforming them.
  *
  * **Return behavior**: This function returns a new TxHashMap reference containing
- * only the transformed entries that returned Some values. The original TxHashMap is not modified.
+ * only the transformed entries that succeeded. The original TxHashMap is not modified.
  *
  * @example
  * ```ts
- * import { Effect, Option, TxHashMap } from "effect"
+ * import { Effect, Option, Result, TxHashMap } from "effect"
  *
  * const program = Effect.gen(function*() {
  *   // Create a mixed data map
@@ -2511,10 +2512,10 @@ export declare const reduce: {
  *   const activeAdminAges = yield* TxHashMap.filterMap(
  *     userData,
  *     (user, username) => {
- *       if (!user.active || user.role !== "admin") return Option.none()
+ *       if (!user.active || user.role !== "admin") return Result.failVoid
  *       const age = parseInt(user.age)
- *       if (isNaN(age)) return Option.none()
- *       return Option.some({
+ *       if (isNaN(age)) return Result.failVoid
+ *       return Result.succeed({
  *         username,
  *         age,
  *         seniority: age > 27 ? "senior" : "junior"
@@ -2532,7 +2533,7 @@ export declare const reduce: {
  *   const validAges = yield* userData.pipe(
  *     TxHashMap.filterMap((user) => {
  *       const age = parseInt(user.age)
- *       return isNaN(age) ? Option.none() : Option.some(age)
+ *       return isNaN(age) ? Result.failVoid : Result.succeed(age)
  *     })
  *   )
  *
@@ -2546,15 +2547,15 @@ export declare const reduce: {
  */
 export declare const filterMap: {
     /**
-     * Combines filtering and mapping in a single operation. Applies a function that returns
-     * an Option to each entry, keeping only the Some values and transforming them.
+     * Combines filtering and mapping in a single operation. Applies a filter to each
+     * entry, keeping only successful results and transforming them.
      *
      * **Return behavior**: This function returns a new TxHashMap reference containing
-     * only the transformed entries that returned Some values. The original TxHashMap is not modified.
+     * only the transformed entries that succeeded. The original TxHashMap is not modified.
      *
      * @example
      * ```ts
-     * import { Effect, Option, TxHashMap } from "effect"
+     * import { Effect, Option, Result, TxHashMap } from "effect"
      *
      * const program = Effect.gen(function*() {
      *   // Create a mixed data map
@@ -2569,10 +2570,10 @@ export declare const filterMap: {
      *   const activeAdminAges = yield* TxHashMap.filterMap(
      *     userData,
      *     (user, username) => {
-     *       if (!user.active || user.role !== "admin") return Option.none()
+     *       if (!user.active || user.role !== "admin") return Result.failVoid
      *       const age = parseInt(user.age)
-     *       if (isNaN(age)) return Option.none()
-     *       return Option.some({
+     *       if (isNaN(age)) return Result.failVoid
+     *       return Result.succeed({
      *         username,
      *         age,
      *         seniority: age > 27 ? "senior" : "junior"
@@ -2590,7 +2591,7 @@ export declare const filterMap: {
      *   const validAges = yield* userData.pipe(
      *     TxHashMap.filterMap((user) => {
      *       const age = parseInt(user.age)
-     *       return isNaN(age) ? Option.none() : Option.some(age)
+     *       return isNaN(age) ? Result.failVoid : Result.succeed(age)
      *     })
      *   )
      *
@@ -2602,17 +2603,17 @@ export declare const filterMap: {
      * @since 2.0.0
      * @category combinators
      */
-    <A, V, K>(f: (value: V, key: K) => Option.Option<A>): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, A>>;
+    <V, K, A, X>(f: Filter.Filter<V, A, X, [key: K]>): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
     /**
-     * Combines filtering and mapping in a single operation. Applies a function that returns
-     * an Option to each entry, keeping only the Some values and transforming them.
+     * Combines filtering and mapping in a single operation. Applies a filter to each
+     * entry, keeping only successful results and transforming them.
      *
      * **Return behavior**: This function returns a new TxHashMap reference containing
-     * only the transformed entries that returned Some values. The original TxHashMap is not modified.
+     * only the transformed entries that succeeded. The original TxHashMap is not modified.
      *
      * @example
      * ```ts
-     * import { Effect, Option, TxHashMap } from "effect"
+     * import { Effect, Option, Result, TxHashMap } from "effect"
      *
      * const program = Effect.gen(function*() {
      *   // Create a mixed data map
@@ -2627,10 +2628,10 @@ export declare const filterMap: {
      *   const activeAdminAges = yield* TxHashMap.filterMap(
      *     userData,
      *     (user, username) => {
-     *       if (!user.active || user.role !== "admin") return Option.none()
+     *       if (!user.active || user.role !== "admin") return Result.failVoid
      *       const age = parseInt(user.age)
-     *       if (isNaN(age)) return Option.none()
-     *       return Option.some({
+     *       if (isNaN(age)) return Result.failVoid
+     *       return Result.succeed({
      *         username,
      *         age,
      *         seniority: age > 27 ? "senior" : "junior"
@@ -2648,7 +2649,7 @@ export declare const filterMap: {
      *   const validAges = yield* userData.pipe(
      *     TxHashMap.filterMap((user) => {
      *       const age = parseInt(user.age)
-     *       return isNaN(age) ? Option.none() : Option.some(age)
+     *       return isNaN(age) ? Result.failVoid : Result.succeed(age)
      *     })
      *   )
      *
@@ -2660,7 +2661,7 @@ export declare const filterMap: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, A>(self: TxHashMap<K, V>, f: (value: V, key: K) => Option.Option<A>): Effect.Effect<TxHashMap<K, A>>;
+    <K, V, A, X>(self: TxHashMap<K, V>, f: Filter.Filter<V, A, X, [key: K]>): Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
 };
 /**
  * Checks if any entry in the TxHashMap matches the given predicate.
@@ -2743,7 +2744,7 @@ export declare const hasBy: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
     /**
      * Checks if any entry in the TxHashMap matches the given predicate.
      *
@@ -2784,7 +2785,7 @@ export declare const hasBy: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<boolean>;
+    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<boolean, never, Effect.Transaction>;
 };
 /**
  * Finds the first entry in the TxHashMap that matches the given predicate.
@@ -2871,7 +2872,7 @@ export declare const findFirst: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<[K, V] | undefined>;
+    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<[K, V] | undefined, never, Effect.Transaction>;
     /**
      * Finds the first entry in the TxHashMap that matches the given predicate.
      * Returns the key-value pair as a tuple wrapped in an Option.
@@ -2914,7 +2915,7 @@ export declare const findFirst: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<[K, V] | undefined>;
+    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<[K, V] | undefined, never, Effect.Transaction>;
 };
 /**
  * Checks if at least one entry in the TxHashMap satisfies the given predicate.
@@ -2997,7 +2998,7 @@ export declare const some: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
     /**
      * Checks if at least one entry in the TxHashMap satisfies the given predicate.
      *
@@ -3038,7 +3039,7 @@ export declare const some: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<boolean>;
+    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<boolean, never, Effect.Transaction>;
 };
 /**
  * Checks if all entries in the TxHashMap satisfy the given predicate.
@@ -3121,7 +3122,7 @@ export declare const every: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<boolean>;
+    <K, V>(predicate: (value: V, key: K) => boolean): (self: TxHashMap<K, V>) => Effect.Effect<boolean, never, Effect.Transaction>;
     /**
      * Checks if all entries in the TxHashMap satisfy the given predicate.
      *
@@ -3162,7 +3163,7 @@ export declare const every: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<boolean>;
+    <K, V>(self: TxHashMap<K, V>, predicate: (value: V, key: K) => boolean): Effect.Effect<boolean, never, Effect.Transaction>;
 };
 /**
  * Executes a side-effect function for each entry in the TxHashMap.
@@ -3247,7 +3248,7 @@ export declare const forEach: {
      * @since 2.0.0
      * @category combinators
      */
-    <V, K, R, E>(f: (value: V, key: K) => Effect.Effect<void, E, R>): (self: TxHashMap<K, V>) => Effect.Effect<void, E, R>;
+    <V, K, R, E>(f: (value: V, key: K) => Effect.Effect<void, E, R>): (self: TxHashMap<K, V>) => Effect.Effect<void, E, R | Effect.Transaction>;
     /**
      * Executes a side-effect function for each entry in the TxHashMap.
      * The function receives the value and key as parameters and can perform effects.
@@ -3289,7 +3290,7 @@ export declare const forEach: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, R, E>(self: TxHashMap<K, V>, f: (value: V, key: K) => Effect.Effect<void, E, R>): Effect.Effect<void, E, R>;
+    <K, V, R, E>(self: TxHashMap<K, V>, f: (value: V, key: K) => Effect.Effect<void, E, R>): Effect.Effect<void, E, R | Effect.Transaction>;
 };
 /**
  * Transforms the TxHashMap by applying a function that returns a TxHashMap to each entry,
@@ -3394,7 +3395,7 @@ export declare const flatMap: {
      * @since 2.0.0
      * @category combinators
      */
-    <A, V, K>(f: (value: V, key: K) => Effect.Effect<TxHashMap<K, A>>): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, A>>;
+    <A, V, K>(f: (value: V, key: K) => Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>): (self: TxHashMap<K, V>) => Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
     /**
      * Transforms the TxHashMap by applying a function that returns a TxHashMap to each entry,
      * then flattening the results. Useful for complex transformations that require creating new maps.
@@ -3446,7 +3447,7 @@ export declare const flatMap: {
      * @since 2.0.0
      * @category combinators
      */
-    <K, V, A>(self: TxHashMap<K, V>, f: (value: V, key: K) => Effect.Effect<TxHashMap<K, A>>): Effect.Effect<TxHashMap<K, A>>;
+    <K, V, A>(self: TxHashMap<K, V>, f: (value: V, key: K) => Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>): Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
 };
 /**
  * Removes all None values from a TxHashMap containing Option values.
@@ -3493,7 +3494,7 @@ export declare const flatMap: {
  * @since 2.0.0
  * @category combinators
  */
-export declare const compact: <K, A>(self: TxHashMap<K, Option.Option<A>>) => Effect.Effect<TxHashMap<K, A>>;
+export declare const compact: <K, A>(self: TxHashMap<K, Option.Option<A>>) => Effect.Effect<TxHashMap<K, A>, never, Effect.Transaction>;
 /**
  * Returns an array of all key-value pairs in the TxHashMap.
  * This is an alias for the `entries` function, providing API consistency with HashMap.
@@ -3528,7 +3529,7 @@ export declare const compact: <K, A>(self: TxHashMap<K, Option.Option<A>>) => Ef
  * @since 2.0.0
  * @category combinators
  */
-export declare const toEntries: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<readonly [K, V]>>;
+export declare const toEntries: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<readonly [K, V]>, never, Effect.Transaction>;
 /**
  * Returns an array of all values in the TxHashMap.
  * This is an alias for the `values` function, providing API consistency with HashMap.
@@ -3565,6 +3566,6 @@ export declare const toEntries: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<A
  * @since 2.0.0
  * @category combinators
  */
-export declare const toValues: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<V>>;
+export declare const toValues: <K, V>(self: TxHashMap<K, V>) => Effect.Effect<Array<V>, never, Effect.Transaction>;
 export {};
 //# sourceMappingURL=TxHashMap.d.ts.map