effect 3.14.3 → 3.14.4

package/dist/cjs/HashSet.js

@@ -42,14 +42,14 @@ function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e;
  *
  * ## Performance Characteristics
  *
- * - **Lookup** operations ({@linkcode HashSet.has}): **`O(1)`** average time
+ * - **Lookup** operations ({@link module:HashSet.has}): **`O(1)`** average time
  *   complexity
- * - **Insertion** operations ({@linkcode HashSet.add}): **`O(1)`** average time
+ * - **Insertion** operations ({@link module:HashSet.add}): **`O(1)`** average time
  *   complexity
- * - **Removal** operations ({@linkcode HashSet.remove}): **`O(1)`** average time
- *   complexity
- * - **Set** operations ({@linkcode HashSet.union},
- *   {@linkcode HashSet.intersection}): **`O(n)`** where n is the size of the
+ * - **Removal** operations ({@link module:HashSet.remove}): **`O(1)`** average
+ *   time complexity
+ * - **Set** operations ({@link module:HashSet.union},
+ *   {@link module:HashSet.intersection}): **`O(n)`** where n is the size of the
  *   smaller set
  * - **Iteration**: **`O(n)`** where n is the size of the set
  *
@@ -62,40 +62,40 @@ function _interopRequireWildcard(e, r) { if (!r && e && e.__esModule) return e;
  *
  * ## Operations Reference
  *
- * | Category     | Operation                        | Description                                 | Complexity |
- * | ------------ | -------------------------------- | ------------------------------------------- | ---------- |
- * | constructors | {@linkcode HashSet.empty}        | Creates an empty HashSet                    | O(1)       |
- * | constructors | {@linkcode HashSet.fromIterable} | Creates a HashSet from an iterable          | O(n)       |
- * | constructors | {@linkcode HashSet.make}         | Creates a HashSet from multiple values      | O(n)       |
- * |              |                                  |                                             |            |
- * | elements     | {@linkcode HashSet.has}          | Checks if a value exists in the set         | O(1) avg   |
- * | elements     | {@linkcode HashSet.some}         | Checks if any element satisfies a predicate | O(n)       |
- * | elements     | {@linkcode HashSet.every}        | Checks if all elements satisfy a predicate  | O(n)       |
- * | elements     | {@linkcode HashSet.isSubset}     | Checks if a set is a subset of another      | O(n)       |
- * |              |                                  |                                             |            |
- * | getters      | {@linkcode HashSet.values}       | Gets an iterator of all values              | O(1)       |
- * | getters      | {@linkcode HashSet.toValues}     | Gets an array of all values                 | O(n)       |
- * | getters      | {@linkcode HashSet.size}         | Gets the number of elements                 | O(1)       |
- * |              |                                  |                                             |            |
- * | mutations    | {@linkcode HashSet.add}          | Adds a value to the set                     | O(1) avg   |
- * | mutations    | {@linkcode HashSet.remove}       | Removes a value from the set                | O(1) avg   |
- * | mutations    | {@linkcode HashSet.toggle}       | Toggles a value's presence                  | O(1) avg   |
- * |              |                                  |                                             |            |
- * | operations   | {@linkcode HashSet.difference}   | Computes set difference (A - B)             | O(n)       |
- * | operations   | {@linkcode HashSet.intersection} | Computes set intersection (A ∩ B)           | O(n)       |
- * | operations   | {@linkcode HashSet.union}        | Computes set union (A ∪ B)                  | O(n)       |
- * |              |                                  |                                             |            |
- * | mapping      | {@linkcode HashSet.map}          | Transforms each element                     | O(n)       |
- * |              |                                  |                                             |            |
- * | sequencing   | {@linkcode HashSet.flatMap}      | Transforms and flattens elements            | O(n)       |
- * |              |                                  |                                             |            |
- * | traversing   | {@linkcode HashSet.forEach}      | Applies a function to each element          | O(n)       |
- * |              |                                  |                                             |            |
- * | folding      | {@linkcode HashSet.reduce}       | Reduces the set to a single value           | O(n)       |
- * |              |                                  |                                             |            |
- * | filtering    | {@linkcode HashSet.filter}       | Keeps elements that satisfy a predicate     | O(n)       |
- * |              |                                  |                                             |            |
- * | partitioning | {@linkcode HashSet.partition}    | Splits into two sets by a predicate         | O(n)       |
+ * | Category     | Operation                           | Description                                 | Complexity |
+ * | ------------ | ----------------------------------- | ------------------------------------------- | ---------- |
+ * | constructors | {@link module:HashSet.empty}        | Creates an empty HashSet                    | O(1)       |
+ * | constructors | {@link module:HashSet.fromIterable} | Creates a HashSet from an iterable          | O(n)       |
+ * | constructors | {@link module:HashSet.make}         | Creates a HashSet from multiple values      | O(n)       |
+ * |              |                                     |                                             |            |
+ * | elements     | {@link module:HashSet.has}          | Checks if a value exists in the set         | O(1) avg   |
+ * | elements     | {@link module:HashSet.some}         | Checks if any element satisfies a predicate | O(n)       |
+ * | elements     | {@link module:HashSet.every}        | Checks if all elements satisfy a predicate  | O(n)       |
+ * | elements     | {@link module:HashSet.isSubset}     | Checks if a set is a subset of another      | O(n)       |
+ * |              |                                     |                                             |            |
+ * | getters      | {@link module:HashSet.values}       | Gets an iterator of all values              | O(1)       |
+ * | getters      | {@link module:HashSet.toValues}     | Gets an array of all values                 | O(n)       |
+ * | getters      | {@link module:HashSet.size}         | Gets the number of elements                 | O(1)       |
+ * |              |                                     |                                             |            |
+ * | mutations    | {@link module:HashSet.add}          | Adds a value to the set                     | O(1) avg   |
+ * | mutations    | {@link module:HashSet.remove}       | Removes a value from the set                | O(1) avg   |
+ * | mutations    | {@link module:HashSet.toggle}       | Toggles a value's presence                  | O(1) avg   |
+ * |              |                                     |                                             |            |
+ * | operations   | {@link module:HashSet.difference}   | Computes set difference (A - B)             | O(n)       |
+ * | operations   | {@link module:HashSet.intersection} | Computes set intersection (A ∩ B)           | O(n)       |
+ * | operations   | {@link module:HashSet.union}        | Computes set union (A ∪ B)                  | O(n)       |
+ * |              |                                     |                                             |            |
+ * | mapping      | {@link module:HashSet.map}          | Transforms each element                     | O(n)       |
+ * |              |                                     |                                             |            |
+ * | sequencing   | {@link module:HashSet.flatMap}      | Transforms and flattens elements            | O(n)       |
+ * |              |                                     |                                             |            |
+ * | traversing   | {@link module:HashSet.forEach}      | Applies a function to each element          | O(n)       |
+ * |              |                                     |                                             |            |
+ * | folding      | {@link module:HashSet.reduce}       | Reduces the set to a single value           | O(n)       |
+ * |              |                                     |                                             |            |
+ * | filtering    | {@link module:HashSet.filter}       | Keeps elements that satisfy a predicate     | O(n)       |
+ * |              |                                     |                                             |            |
+ * | partitioning | {@link module:HashSet.partition}    | Splits into two sets by a predicate         | O(n)       |
  *
  * ## Notes
  *
@@ -293,7 +293,7 @@ const isHashSet = exports.isHashSet = HS.isHashSet;
  * ) // Output: [1, 2]
  * ```
  *
- * @see Other `HashSet` constructors are {@link make} {@link fromIterable}
+ * @see Other `HashSet` constructors are {@link module:HashSet.make} {@link module:HashSet.fromIterable}
  */
 const empty = exports.empty = HS.empty;
 /**
@@ -304,9 +304,10 @@ const empty = exports.empty = HS.empty;
  * @memberof HashSet
  * @since 2.0.0
  * @category constructors
- * @example Creating a HashSet from an {@link Array}
+ * @example
  *
  * ```ts
+ * // Creating a HashSet from an Array
  * import { HashSet, pipe } from "effect"
  *
  * console.log(
@@ -318,9 +319,10 @@ const empty = exports.empty = HS.empty;
  * ) // Output: [1, 2, 3, 4, 5]
  * ```
  *
- * @example Creating a HashSet from a {@link Set}
+ * @example
  *
  * ```ts
+ * // Creating a HashSet from a Set
  * import { HashSet, pipe } from "effect"
  *
  * console.log(
@@ -332,9 +334,10 @@ const empty = exports.empty = HS.empty;
  * ) // Output: ["apple", "banana", "orange"]
  * ```
  *
- * @example Creating a HashSet from a {@link Generator}
+ * @example
  *
  * ```ts
+ * // Creating a HashSet from a Generator
  * import { HashSet } from "effect"
  *
  * // Generator functions return iterables
@@ -353,9 +356,10 @@ const empty = exports.empty = HS.empty;
  * // Outputs: [0, 1, 2, 3, 5, 8, 13, 21, 34] but in unsorted order
  * ```
  *
- * @example Creating a HashSet from another {@link HashSet}
+ * @example
  *
  * ```ts
+ * //  Creating a HashSet from another HashSet
  * import { HashSet, pipe } from "effect"
  *
  * console.log(
@@ -368,10 +372,10 @@ const empty = exports.empty = HS.empty;
  * ) // Output: [1, 2, 3, 4]
  * ```
  *
- * @example Creating a HashSet from other Effect's data structures like
- * {@link Chunk}
+ * @example
  *
  * ```ts
+ * // Creating a HashSet from other Effect's data structures like Chunk
  * import { Chunk, HashSet, pipe } from "effect"
  *
  * console.log(
@@ -383,7 +387,7 @@ const empty = exports.empty = HS.empty;
  * ) // Outputs: [1, 2, 3, 4]
  * ```
  *
- * @see Other `HashSet` constructors are {@link empty} {@link make}
+ * @see Other `HashSet` constructors are {@link module:HashSet.empty} {@link module:HashSet.make}
  */
 const fromIterable = exports.fromIterable = HS.fromIterable;
 /**
@@ -471,7 +475,7 @@ const fromIterable = exports.fromIterable = HS.fromIterable;
  * )
  * ```
  *
- * @see Other `HashSet` constructors are {@linkcode fromIterable} {@linkcode empty}
+ * @see Other `HashSet` constructors are {@link module:HashSet.fromIterable} {@link module:HashSet.empty}
  */
 const make = exports.make = HS.make;
 /**
@@ -482,9 +486,10 @@ const make = exports.make = HS.make;
  * @memberof HashSet
  * @since 2.0.0
  * @category elements
- * @example **syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -498,7 +503,7 @@ const make = exports.make = HS.make;
  * ```
  *
  * @returns A `boolean` signaling the presence of the value in the HashSet
- * @see Other `HashSet` elements are {@link some} {@link every} {@link isSubset}
+ * @see Other `HashSet` elements are {@link module:HashSet.some} {@link module:HashSet.every} {@link module:HashSet.isSubset}
  */
 const has = exports.has = HS.has;
 /**
@@ -509,9 +514,10 @@ const has = exports.has = HS.has;
  * @memberof HashSet
  * @since 2.0.0
  * @category elements
- * @example **syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * const set: HashSet.HashSet<number> = HashSet.make(0, 1, 2)
@@ -529,7 +535,7 @@ const has = exports.has = HS.has;
  * HashSet.some(set, (n) => n > 0) // true
  * ```
  *
- * @see Other `HashSet` elements are {@link has} {@link every} {@link isSubset}
+ * @see Other `HashSet` elements are {@link module:HashSet.has} {@link module:HashSet.every} {@link module:HashSet.isSubset}
  */
 const some = exports.some = HS.some;
 /**
@@ -541,9 +547,10 @@ const some = exports.some = HS.some;
  * @memberof HashSet
  * @since 2.0.0
  * @category elements
- * @example **syntax** with {@link Refinement}
+ * @example
  *
  * ```ts
+ * // Syntax with Refinement
  * import { HashSet, pipe, Predicate } from "effect"
  *
  * const numberOrString = HashSet.make(1, "1", "one", "uno")
@@ -565,9 +572,10 @@ const some = exports.some = HS.some;
  * ) // HashSet.HashSet<string>
  * ```
  *
- * @example **syntax** with {@link Predicate}
+ * @example
  *
  * ```ts
+ * // Syntax with Predicate
  * import { HashSet, pipe } from "effect"
  *
  * const set = HashSet.make(1, 2, 3)
@@ -587,7 +595,7 @@ const some = exports.some = HS.some;
  *
  * @returns A boolean once it has evaluated that whole collection fulfill the
  *   Predicate function
- * @see Other `HashSet` elements are {@link has} {@link some} {@link isSubset}
+ * @see Other `HashSet` elements are {@link module:HashSet.has} {@link module:HashSet.some} {@link module:HashSet.isSubset}
  */
 const every = exports.every = HS.every;
 /**
@@ -601,9 +609,10 @@ const every = exports.every = HS.every;
  * @memberof HashSet
  * @since 2.0.0
  * @category elements
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * const set1 = HashSet.make(0, 1)
@@ -623,7 +632,7 @@ const every = exports.every = HS.every;
  * HashSet.isSubset(set1, set3) // true)
  * ```
  *
- * @see Other `HashSet` elements are {@link has} {@link some} {@link every}
+ * @see Other `HashSet` elements are {@link module:HashSet.has} {@link module:HashSet.some} {@link module:HashSet.every}
  */
 const isSubset = exports.isSubset = HS.isSubset;
 /**
@@ -649,7 +658,7 @@ const isSubset = exports.isSubset = HS.isSubset;
  * }
  * ```
  *
- * @see Other `HashSet` getters are {@link toValues} {@link size}
+ * @see Other `HashSet` getters are {@link module:HashSet.toValues} {@link module:HashSet.size}
  */
 const values = exports.values = HS.values;
 /**
@@ -675,7 +684,7 @@ const values = exports.values = HS.values;
  * )
  * ```
  *
- * @see Other `HashSet` getters are {@link values} {@link size}
+ * @see Other `HashSet` getters are {@link module:HashSet.values} {@link module:HashSet.size}
  */
 const toValues = self => Array.from(values(self));
 /**
@@ -700,7 +709,7 @@ const toValues = self => Array.from(values(self));
  * )
  * ```
  *
- * @see Other `HashSet` getters are {@link values} {@link toValues}
+ * @see Other `HashSet` getters are {@link module:HashSet.values} {@link module:HashSet.toValues}
  */
 exports.toValues = toValues;
 const size = exports.size = HS.size;
@@ -748,7 +757,7 @@ const size = exports.size = HS.size;
  * console.log(HashSet.toValues(mutableSet).sort((a, b) => a - b)) // [0, 1, 2, 3, ...rest]
  * ```
  *
- * @see Other `HashSet` mutations are {@link add} {@link remove} {@link toggle} {@link endMutation} {@link mutate}
+ * @see Other `HashSet` mutations are {@link module:HashSet.add} {@link module:HashSet.remove} {@link module:HashSet.toggle} {@link module:HashSet.endMutation} {@link module:HashSet.mutate}
  */
 const beginMutation = exports.beginMutation = HS.beginMutation;
 /**
@@ -795,21 +804,22 @@ const beginMutation = exports.beginMutation = HS.beginMutation;
  * assert.deepStrictEqual(HashSet.toValues(newSet).sort(), [1, 2, 3, 4])
  * ```
  *
- * @see Other `HashSet` mutations are {@linkcode HashSet.add} {@linkcode HashSet.remove} {@linkcode HashSet.toggle} {@linkcode HashSet.beginMutation} {@linkcode HashSet.mutate}
+ * @see Other `HashSet` mutations are {@link module:HashSet.add} {@link module:HashSet.remove} {@link module:HashSet.toggle} {@link module:HashSet.beginMutation} {@link module:HashSet.mutate}
  */
 const endMutation = exports.endMutation = HS.endMutation;
 /**
  * Mutates the `HashSet` within the context of the provided function.
  *
  * You can consider it a functional abstraction on top of the lower-level
- * mutation primitives of {@linkcode HashSet.beginMutation} `->` `mutable
- * context` `->` {@linkcode HashSet.endMutation}.
+ * mutation primitives of {@link module:HashSet.beginMutation} `->` `mutable
+ * context` `->` {@link HashSet.endMutation}.
  *
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with data-last, a.k.a. pipeable API
@@ -836,7 +846,7 @@ const endMutation = exports.endMutation = HS.endMutation;
  * })
  * ```
  *
- * @see Other `HashSet` mutations are {@linkcode HashSet.add} {@linkcode HashSet.remove} {@linkcode HashSet.toggle} {@linkcode HashSet.beginMutation} {@linkcode HashSet.endMutation}
+ * @see Other `HashSet` mutations are {@link module:HashSet.add} {@link module:HashSet.remove} {@link module:HashSet.toggle} {@link module:HashSet.beginMutation} {@link module:HashSet.endMutation}
  */
 const mutate = exports.mutate = HS.mutate;
 /**
@@ -853,9 +863,10 @@ const mutate = exports.mutate = HS.mutate;
  * with the added value.
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with data-last, a.k.a. pipeable API
@@ -868,7 +879,7 @@ const mutate = exports.mutate = HS.mutate;
  * HashSet.add(HashSet.empty(), 0)
  * ```
  *
- * @see Other `HashSet` mutations are {@link remove} {@link toggle} {@link beginMutation} {@link endMutation} {@link mutate}
+ * @see Other `HashSet` mutations are {@link module:HashSet.remove} {@link module:HashSet.toggle} {@link module:HashSet.beginMutation} {@link module:HashSet.endMutation} {@link module:HashSet.mutate}
  */
 const add = exports.add = HS.add;
 /**
@@ -878,9 +889,10 @@ const add = exports.add = HS.add;
  *
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -893,7 +905,7 @@ const add = exports.add = HS.add;
  * HashSet.remove(HashSet.make(0, 1, 2), 0)
  * ```
  *
- * @see Other `HashSet` mutations are {@link add} {@link toggle} {@link beginMutation} {@link endMutation} {@link mutate}
+ * @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 = exports.remove = HS.remove;
 /**
@@ -909,9 +921,10 @@ const remove = exports.remove = HS.remove;
  *
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with data-last, a.k.a. pipeable API
@@ -924,7 +937,7 @@ const remove = exports.remove = HS.remove;
  * HashSet.difference(HashSet.make(1, 2, 3), HashSet.make(3, 4, 5))
  * ```
  *
- * @see Other `HashSet` operations are {@link intersection} {@link union}
+ * @see Other `HashSet` operations are {@link module:HashSet.intersection} {@link module:HashSet.union}
  */
 const difference = exports.difference = HS.difference;
 /**
@@ -939,9 +952,10 @@ const difference = exports.difference = HS.difference;
  *
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with data-last, a.k.a. pipeable API
@@ -954,7 +968,7 @@ const difference = exports.difference = HS.difference;
  * HashSet.intersection(HashSet.make(1, 2, 3), HashSet.make(2, 3, 4))
  * ```
  *
- * @see Other `HashSet` operations are {@link difference} {@link union}
+ * @see Other `HashSet` operations are {@link module:HashSet.difference} {@link module:HashSet.union}
  */
 const intersection = exports.intersection = HS.intersection;
 /**
@@ -968,9 +982,10 @@ const intersection = exports.intersection = HS.intersection;
  *
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with data-last, a.k.a. pipeable API
@@ -983,7 +998,7 @@ const intersection = exports.intersection = HS.intersection;
  * HashSet.union(HashSet.make(1, 2, 3), HashSet.make(3, 4, 5))
  * ```
  *
- * @see Other `HashSet` operations are {@link difference} {@link intersection}
+ * @see Other `HashSet` operations are {@link module:HashSet.difference} {@link module:HashSet.intersection}
  */
 const union = exports.union = HS.union;
 /**
@@ -995,9 +1010,10 @@ const union = exports.union = HS.union;
  *
  * @memberof HashSet
  * @since 2.0.0
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -1012,7 +1028,7 @@ const union = exports.union = HS.union;
  *
  * @returns A new `HashSet` where the toggled value is being either added or
  *   removed based on the initial `HashSet` state.
- * @see Other `HashSet` mutations are {@link add} {@link remove} {@link beginMutation} {@link endMutation} {@link mutate}
+ * @see Other `HashSet` mutations are {@link module:HashSet.add} {@link module:HashSet.remove} {@link module:HashSet.beginMutation} {@link module:HashSet.endMutation} {@link module:HashSet.mutate}
  */
 const toggle = exports.toggle = HS.toggle;
 /**
@@ -1023,9 +1039,10 @@ const toggle = exports.toggle = HS.toggle;
  * @memberof HashSet
  * @since 2.0.0
  * @category mapping
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -1050,9 +1067,10 @@ const map = exports.map = HS.map;
  * @memberof HashSet
  * @since 2.0.0
  * @category sequencing
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -1080,9 +1098,10 @@ const flatMap = exports.flatMap = HS.flatMap;
  * @memberof HashSet
  * @since 2.0.0
  * @category traversing
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -1104,9 +1123,10 @@ const forEach = exports.forEach = HS.forEach;
  * @memberof HashSet
  * @since 2.0.0
  * @category folding
- * @example **Syntax**
+ * @example
  *
  * ```ts
+ * // Syntax
  * import { HashSet, pipe } from "effect"
  *
  * const sum = (a: number, b: number): number => a + b
@@ -1130,9 +1150,10 @@ const reduce = exports.reduce = HS.reduce;
  * @memberof HashSet
  * @since 2.0.0
  * @category filtering
- * @example **Syntax** with {@link Predicate}
+ * @example
  *
  * ```ts
+ * // Syntax with  Predicate
  * import { HashSet, type Predicate, pipe } from "effect"
  *
  * const filterPositiveNumbers: Predicate.Predicate<number> = (n) => n > 0
@@ -1150,9 +1171,10 @@ const reduce = exports.reduce = HS.reduce;
  * HashSet.filter(HashSet.make(-2, -1, 0, 1, 2), filterPositiveNumbers)
  * ```
  *
- * @example **Syntax** with {@link Refinement}
+ * @example
  *
  * ```ts
+ * /// Syntax with Refinement
  * import { HashSet, pipe } from "effect"
  *
  * const stringRefinement = (value: unknown): value is string =>
@@ -1188,9 +1210,10 @@ const filter = exports.filter = HS.filter;
  * @memberof HashSet
  * @since 2.0.0
  * @category partitioning
- * @example **Syntax** with {@link Predicate}
+ * @example
  *
  * ```ts
+ * // Syntax with Predicate
  * import { HashSet, pipe, Predicate } from "effect"
  *
  * // with `data-last`, a.k.a. `pipeable` API
@@ -1208,9 +1231,10 @@ const filter = exports.filter = HS.filter;
  * HashSet.partition(HashSet.make(0, 1, 2, 3, 4, 5), (n) => n % 2 === 0)
  * ```
  *
- * @example **Syntax** with {@link Refinement}
+ * @example
  *
  * ```ts
+ * // Syntax with Refinement
  * import { HashSet, pipe, Predicate } from "effect"
  *
  * const stringRefinement: Predicate.Refinement<string | number, string> = (

package/dist/cjs/HashSet.js.map

@@ -1 +1 @@
-{"version":3,"file":"HashSet.js","names":["HS","_interopRequireWildcard","require","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","hasOwnProperty","call","i","set","TypeId","HashSetTypeId","isHashSet","exports","empty","fromIterable","make","some","every","isSubset","values","toValues","self","Array","from","size","beginMutation","endMutation","mutate","add","remove","difference","intersection","union","toggle","map","flatMap","forEach","reduce","filter","partition"],"sources":["../../src/HashSet.ts"],"sourcesContent":[null],"mappings":";;;;;;AAgQA,IAAAA,EAAA,GAAAC,uBAAA,CAAAC,OAAA;AAA2C,SAAAC,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAH,wBAAAG,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,OAAAC,cAAA,CAAAC,IAAA,CAAAhB,CAAA,EAAAc,CAAA,SAAAG,CAAA,GAAAP,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAG,CAAA,KAAAA,CAAA,CAAAV,GAAA,IAAAU,CAAA,CAAAC,GAAA,IAAAP,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAG,CAAA,IAAAT,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAe,GAAA,CAAAlB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAhQ3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqQA,MAAMW,MAAM,GAAkBvB,EAAE,CAACwB,aAAuB;AA0BxD;;;;;AAKO,MAAMC,SAAS,GAAAC,OAAA,CAAAD,SAAA,GAoDlBzB,EAAE,CAACyB,SAAS;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAME,KAAK,GAAAD,OAAA,CAAAC,KAAA,GAAgC3B,EAAE,CAAC2B,KAAK;AAE1D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyFO,MAAMC,YAAY,GAAAF,OAAA,CAAAE,YAAA,GAA6C5B,EAAE,CAAC4B,YAAY;AAErF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuFO,MAAMC,IAAI,GAAAH,OAAA,CAAAG,IAAA,GAA4E7B,EAAE,CAAC6B,IAAI;AAEpG;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BO,MAAMnB,GAAG,GAAAgB,OAAA,CAAAhB,GAAA,GAkCZV,EAAE,CAACU,GAAG;AAEV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMoB,IAAI,GAAAJ,OAAA,CAAAI,IAAA,GAkDb9B,EAAE,CAAC8B,IAAI;AAEX;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyDO,MAAMC,KAAK,GAAAL,OAAA,CAAAK,KAAA,GA4Fd/B,EAAE,CAAC+B,KAAK;AAEZ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCO,MAAMC,QAAQ,GAAAN,OAAA,CAAAM,QAAA,GAwCjBhC,EAAE,CAACgC,QAAQ;AAEf;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,MAAM,GAAAP,OAAA,CAAAO,MAAA,GAAiDjC,EAAE,CAACiC,MAAM;AAE7E;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,QAAQ,GAAOC,IAAgB,IAAeC,KAAK,CAACC,IAAI,CAACJ,MAAM,CAACE,IAAI,CAAC,CAAC;AAEnF;;;;;;;;;;;;;;;;;;;;;;;;AAAAT,OAAA,CAAAQ,QAAA,GAAAA,QAAA;AAwBO,MAAMI,IAAI,GAAAZ,OAAA,CAAAY,IAAA,GAAoCtC,EAAE,CAACsC,IAAI;AAE5D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,aAAa,GAAAb,OAAA,CAAAa,aAAA,GAAwCvC,EAAE,CAACuC,aAAa;AAElF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,WAAW,GAAAd,OAAA,CAAAc,WAAA,GAAwCxC,EAAE,CAACwC,WAAW;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAwCO,MAAMC,MAAM,GAAAf,OAAA,CAAAe,MAAA,GAkEfzC,EAAE,CAACyC,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BO,MAAMC,GAAG,GAAAhB,OAAA,CAAAgB,GAAA,GAwCZ1C,EAAE,CAAC0C,GAAG;AAEV;;;;;;;;;;;;;;;;;;;;;;;;AAwBO,MAAMC,MAAM,GAAAjB,OAAA,CAAAiB,MAAA,GAoCf3C,EAAE,CAAC2C,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,UAAU,GAAAlB,OAAA,CAAAkB,UAAA,GA8DnB5C,EAAE,CAAC4C,UAAU;AAEjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BO,MAAMC,YAAY,GAAAnB,OAAA,CAAAmB,YAAA,GA8DrB7C,EAAE,CAAC6C,YAAY;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BO,MAAMC,KAAK,GAAApB,OAAA,CAAAoB,KAAA,GA0Ed9C,EAAE,CAAC8C,KAAK;AAEZ;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BO,MAAMC,MAAM,GAAArB,OAAA,CAAAqB,MAAA,GAwDf/C,EAAE,CAAC+C,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BO,MAAMC,GAAG,GAAAtB,OAAA,CAAAsB,GAAA,GAoCZhD,EAAE,CAACgD,GAAG;AAEV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BO,MAAMC,OAAO,GAAAvB,OAAA,CAAAuB,OAAA,GAmChBjD,EAAE,CAACiD,OAAO;AAEd;;;;;;;;;;;;;;;;;;;;;;;AAuBO,MAAMC,OAAO,GAAAxB,OAAA,CAAAwB,OAAA,GAuChBlD,EAAE,CAACkD,OAAO;AAEd;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,MAAM,GAAAzB,OAAA,CAAAyB,MAAA,GAqCfnD,EAAE,CAACmD,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDO,MAAMC,MAAM,GAAA1B,OAAA,CAAA0B,MAAA,GA+FfpD,EAAE,CAACoD,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DO,MAAMC,SAAS,GAAA3B,OAAA,CAAA2B,SAAA,GAgHlBrD,EAAE,CAACqD,SAAS","ignoreList":[]}
+{"version":3,"file":"HashSet.js","names":["HS","_interopRequireWildcard","require","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","hasOwnProperty","call","i","set","TypeId","HashSetTypeId","isHashSet","exports","empty","fromIterable","make","some","every","isSubset","values","toValues","self","Array","from","size","beginMutation","endMutation","mutate","add","remove","difference","intersection","union","toggle","map","flatMap","forEach","reduce","filter","partition"],"sources":["../../src/HashSet.ts"],"sourcesContent":[null],"mappings":";;;;;;AAgQA,IAAAA,EAAA,GAAAC,uBAAA,CAAAC,OAAA;AAA2C,SAAAC,yBAAAC,CAAA,6BAAAC,OAAA,mBAAAC,CAAA,OAAAD,OAAA,IAAAE,CAAA,OAAAF,OAAA,YAAAF,wBAAA,YAAAA,CAAAC,CAAA,WAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA,KAAAF,CAAA;AAAA,SAAAH,wBAAAG,CAAA,EAAAE,CAAA,SAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA,eAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA,WAAAK,OAAA,EAAAL,CAAA,QAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA,OAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA,OAAAQ,CAAA,KAAAC,SAAA,UAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA,WAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,OAAAC,cAAA,CAAAC,IAAA,CAAAhB,CAAA,EAAAc,CAAA,SAAAG,CAAA,GAAAP,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA,UAAAG,CAAA,KAAAA,CAAA,CAAAV,GAAA,IAAAU,CAAA,CAAAC,GAAA,IAAAP,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAG,CAAA,IAAAT,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA,YAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAe,GAAA,CAAAlB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAhQ3C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqQA,MAAMW,MAAM,GAAkBvB,EAAE,CAACwB,aAAuB;AA2BxD;;;;;AAKO,MAAMC,SAAS,GAAAC,OAAA,CAAAD,SAAA,GAoDlBzB,EAAE,CAACyB,SAAS;AAEhB;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAME,KAAK,GAAAD,OAAA,CAAAC,KAAA,GAAgC3B,EAAE,CAAC2B,KAAK;AAE1D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6FO,MAAMC,YAAY,GAAAF,OAAA,CAAAE,YAAA,GAA6C5B,EAAE,CAAC4B,YAAY;AAErF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuFO,MAAMC,IAAI,GAAAH,OAAA,CAAAG,IAAA,GAA4E7B,EAAE,CAAC6B,IAAI;AAEpG;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAMnB,GAAG,GAAAgB,OAAA,CAAAhB,GAAA,GAoCZV,EAAE,CAACU,GAAG;AAEV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BO,MAAMoB,IAAI,GAAAJ,OAAA,CAAAI,IAAA,GAoDb9B,EAAE,CAAC8B,IAAI;AAEX;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2DO,MAAMC,KAAK,GAAAL,OAAA,CAAAK,KAAA,GA4Fd/B,EAAE,CAAC+B,KAAK;AAEZ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCO,MAAMC,QAAQ,GAAAN,OAAA,CAAAM,QAAA,GAwCjBhC,EAAE,CAACgC,QAAQ;AAEf;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,MAAM,GAAAP,OAAA,CAAAO,MAAA,GAAiDjC,EAAE,CAACiC,MAAM;AAE7E;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,QAAQ,GAAOC,IAAgB,IAAeC,KAAK,CAACC,IAAI,CAACJ,MAAM,CAACE,IAAI,CAAC,CAAC;AAEnF;;;;;;;;;;;;;;;;;;;;;;;;AAAAT,OAAA,CAAAQ,QAAA,GAAAA,QAAA;AAwBO,MAAMI,IAAI,GAAAZ,OAAA,CAAAY,IAAA,GAAoCtC,EAAE,CAACsC,IAAI;AAE5D;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,aAAa,GAAAb,OAAA,CAAAa,aAAA,GAAwCvC,EAAE,CAACuC,aAAa;AAElF;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CO,MAAMC,WAAW,GAAAd,OAAA,CAAAc,WAAA,GAAwCxC,EAAE,CAACwC,WAAW;AAE9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCO,MAAMC,MAAM,GAAAf,OAAA,CAAAe,MAAA,GAoEfzC,EAAE,CAACyC,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCO,MAAMC,GAAG,GAAAhB,OAAA,CAAAgB,GAAA,GA0CZ1C,EAAE,CAAC0C,GAAG;AAEV;;;;;;;;;;;;;;;;;;;;;;;;;AAyBO,MAAMC,MAAM,GAAAjB,OAAA,CAAAiB,MAAA,GAsCf3C,EAAE,CAAC2C,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BO,MAAMC,UAAU,GAAAlB,OAAA,CAAAkB,UAAA,GAgEnB5C,EAAE,CAAC4C,UAAU;AAEjB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,YAAY,GAAAnB,OAAA,CAAAmB,YAAA,GAgErB7C,EAAE,CAAC6C,YAAY;AAEnB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BO,MAAMC,KAAK,GAAApB,OAAA,CAAAoB,KAAA,GA4Ed9C,EAAE,CAAC8C,KAAK;AAEZ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BO,MAAMC,MAAM,GAAArB,OAAA,CAAAqB,MAAA,GA0Df/C,EAAE,CAAC+C,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BO,MAAMC,GAAG,GAAAtB,OAAA,CAAAsB,GAAA,GAoCZhD,EAAE,CAACgD,GAAG;AAEV;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BO,MAAMC,OAAO,GAAAvB,OAAA,CAAAuB,OAAA,GAmChBjD,EAAE,CAACiD,OAAO;AAEd;;;;;;;;;;;;;;;;;;;;;;;;AAwBO,MAAMC,OAAO,GAAAxB,OAAA,CAAAwB,OAAA,GAuChBlD,EAAE,CAACkD,OAAO;AAEd;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BO,MAAMC,MAAM,GAAAzB,OAAA,CAAAyB,MAAA,GAqCfnD,EAAE,CAACmD,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuDO,MAAMC,MAAM,GAAA1B,OAAA,CAAA0B,MAAA,GA+FfpD,EAAE,CAACoD,MAAM;AAEb;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6DO,MAAMC,SAAS,GAAA3B,OAAA,CAAA2B,SAAA,GAgHlBrD,EAAE,CAACqD,SAAS","ignoreList":[]}

package/dist/cjs/internal/version.js

@@ -4,7 +4,7 @@ Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.setCurrentVersion = exports.getCurrentVersion = void 0;
-let moduleVersion = "3.14.3";
+let moduleVersion = "3.14.4";
 const getCurrentVersion = () => moduleVersion;
 exports.getCurrentVersion = getCurrentVersion;
 const setCurrentVersion = version => {