effect 2.0.0-next.42 → 2.0.0-next.43

package/HashSet/dist/effect-HashSet.cjs.dev.js

@@ -2,49 +2,270 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-require('../../dist/HashSet-ece2cfe8.cjs.dev.js');
-var HashSet_dist_effectHashSet = require('../../dist/HashSet-6978c08e.cjs.dev.js');
-require('../../dist/Equal-281b6ca8.cjs.dev.js');
-require('../../dist/Hash-bd154268.cjs.dev.js');
-require('../../dist/Function-41ce433d.cjs.dev.js');
-require('../../dist/GlobalValue-81ab6908.cjs.dev.js');
-require('../../dist/Utils-b0c14d1b.cjs.dev.js');
-require('../../dist/Predicate-9e859c9c.cjs.dev.js');
-require('../../dist/Inspectable-ac929af4.cjs.dev.js');
+var HashSet = require('../../dist/HashSet-0b4ff1e4.cjs.dev.js');
+require('../../Equal/dist/effect-Equal.cjs.dev.js');
+require('../../Hash/dist/effect-Hash.cjs.dev.js');
+require('../../Function/dist/effect-Function.cjs.dev.js');
+require('../../GlobalValue/dist/effect-GlobalValue.cjs.dev.js');
+require('../../Utils/dist/effect-Utils.cjs.dev.js');
+require('../../Predicate/dist/effect-Predicate.cjs.dev.js');
+require('../../Inspectable/dist/effect-Inspectable.cjs.dev.js');
 require('../../dist/Stack-ada2d201.cjs.dev.js');
-require('../../dist/Option-03997d77.cjs.dev.js');
-require('../../dist/Equivalence-de7a0d51.cjs.dev.js');
-require('../../dist/Either-9c349424.cjs.dev.js');
-require('../../dist/Effectable-a6403e5f.cjs.dev.js');
-require('../../dist/Data-85559fb3.cjs.dev.js');
-require('../../dist/Pipeable-4698db72.cjs.dev.js');
-require('../../dist/Number-588f6483.cjs.dev.js');
-require('../../dist/Order-28bdebd2.cjs.dev.js');
-
-
-
-exports.add = HashSet_dist_effectHashSet.add;
-exports.beginMutation = HashSet_dist_effectHashSet.beginMutation;
-exports.difference = HashSet_dist_effectHashSet.difference;
-exports.empty = HashSet_dist_effectHashSet.empty;
-exports.endMutation = HashSet_dist_effectHashSet.endMutation;
-exports.every = HashSet_dist_effectHashSet.every;
-exports.filter = HashSet_dist_effectHashSet.filter;
-exports.flatMap = HashSet_dist_effectHashSet.flatMap;
-exports.forEach = HashSet_dist_effectHashSet.forEach;
-exports.fromIterable = HashSet_dist_effectHashSet.fromIterable;
-exports.has = HashSet_dist_effectHashSet.has;
-exports.intersection = HashSet_dist_effectHashSet.intersection;
-exports.isHashSet = HashSet_dist_effectHashSet.isHashSet;
-exports.isSubset = HashSet_dist_effectHashSet.isSubset;
-exports.make = HashSet_dist_effectHashSet.make;
-exports.map = HashSet_dist_effectHashSet.map;
-exports.mutate = HashSet_dist_effectHashSet.mutate;
-exports.partition = HashSet_dist_effectHashSet.partition;
-exports.reduce = HashSet_dist_effectHashSet.reduce;
-exports.remove = HashSet_dist_effectHashSet.remove;
-exports.size = HashSet_dist_effectHashSet.size;
-exports.some = HashSet_dist_effectHashSet.some;
-exports.toggle = HashSet_dist_effectHashSet.toggle;
-exports.union = HashSet_dist_effectHashSet.union;
-exports.values = HashSet_dist_effectHashSet.values;
+require('../../Option/dist/effect-Option.cjs.dev.js');
+require('../../Equivalence/dist/effect-Equivalence.cjs.dev.js');
+require('../../dist/Either-12bbe00c.cjs.dev.js');
+require('../../dist/Effectable-2f022879.cjs.dev.js');
+require('../../Data/dist/effect-Data.cjs.dev.js');
+require('../../Pipeable/dist/effect-Pipeable.cjs.dev.js');
+require('../../Number/dist/effect-Number.cjs.dev.js');
+require('../../Order/dist/effect-Order.cjs.dev.js');
+
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
+
+/**
+ * @since 2.0.0
+ * @category models
+ */
+
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isHashSet = HashSet.isHashSet;
+
+/**
+ * Creates an empty `HashSet`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = HashSet.empty;
+
+/**
+ * Construct a new `HashSet` from a `Collection` of values
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = HashSet.fromIterable;
+
+/**
+ * Construct a new `HashSet` from a variable number of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = HashSet.make;
+
+/**
+ * Checks if the specified value exists in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const has = HashSet.has;
+
+/**
+ * Check if a predicate holds true for some `HashSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const some = HashSet.some;
+
+/**
+ * Check if a predicate holds true for every `HashSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const every = HashSet.every;
+
+/**
+ * Returns `true` if and only if every element in the this `HashSet` is an
+ * element of the second set,
+ *
+ * **NOTE**: the hash and equal of both sets must be the same.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const isSubset = HashSet.isSubset;
+
+/**
+ * Returns an `IterableIterator` of the values in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const values = HashSet.values;
+
+/**
+ * Calculates the number of values in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const size = HashSet.size;
+
+/**
+ * Marks the `HashSet` as mutable.
+ *
+ * @since 2.0.0
+ */
+const beginMutation = HashSet.beginMutation;
+
+/**
+ * Marks the `HashSet` as immutable.
+ *
+ * @since 2.0.0
+ */
+const endMutation = HashSet.endMutation;
+
+/**
+ * Mutates the `HashSet` within the context of the provided function.
+ *
+ * @since 2.0.0
+ */
+const mutate = HashSet.mutate;
+
+/**
+ * Adds a value to the `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const add = HashSet.add;
+
+/**
+ * Removes a value from the `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const remove = HashSet.remove;
+
+/**
+ * Computes the set difference between this `HashSet` and the specified
+ * `Iterable<A>`.
+ *
+ * **NOTE**: the hash and equal of the values in both the set and the iterable
+ * must be the same.
+ *
+ * @since 2.0.0
+ */
+const difference = HashSet.difference;
+
+/**
+ * Returns a `HashSet` of values which are present in both this set and that
+ * `Iterable<A>`.
+ *
+ * **NOTE**: the hash and equal of the values in both the set and the iterable
+ * must be the same.
+ *
+ * @since 2.0.0
+ */
+const intersection = HashSet.intersection;
+
+/**
+ * Computes the set union `(`self` + `that`)` between this `HashSet` and the
+ * specified `Iterable<A>`.
+ *
+ * **NOTE**: the hash and equal of the values in both the set and the iterable
+ * must be the same.
+ *
+ * @since 2.0.0
+ */
+const union = HashSet.union;
+
+/**
+ * Checks if a value is present in the `HashSet`. If it is present, the value
+ * will be removed from the `HashSet`, otherwise the value will be added to the
+ * `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const toggle = HashSet.toggle;
+
+/**
+ * Maps over the values of the `HashSet` using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = HashSet.map;
+
+/**
+ * Chains over the values of the `HashSet` using the specified function.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = HashSet.flatMap;
+
+/**
+ * Applies the specified function to the values of the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = HashSet.forEach;
+
+/**
+ * Reduces the specified state over the values of the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const reduce = HashSet.reduce;
+
+/**
+ * Filters values out of a `HashSet` using the specified predicate.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = HashSet.filter;
+
+/**
+ * Partition the values of a `HashSet` using the specified predicate.
+ *
+ * If a value matches the predicate, it will be placed into the `HashSet` on the
+ * right side of the resulting `Tuple`, otherwise the value will be placed into
+ * the left side.
+ *
+ * @since 2.0.0
+ * @category partitioning
+ */
+const partition = HashSet.partition;
+
+exports.add = add;
+exports.beginMutation = beginMutation;
+exports.difference = difference;
+exports.empty = empty;
+exports.endMutation = endMutation;
+exports.every = every;
+exports.filter = filter;
+exports.flatMap = flatMap;
+exports.forEach = forEach;
+exports.fromIterable = fromIterable;
+exports.has = has;
+exports.intersection = intersection;
+exports.isHashSet = isHashSet;
+exports.isSubset = isSubset;
+exports.make = make;
+exports.map = map;
+exports.mutate = mutate;
+exports.partition = partition;
+exports.reduce = reduce;
+exports.remove = remove;
+exports.size = size;
+exports.some = some;
+exports.toggle = toggle;
+exports.union = union;
+exports.values = values;

package/HashSet/dist/effect-HashSet.cjs.prod.js

@@ -2,49 +2,270 @@
 
 Object.defineProperty(exports, '__esModule', { value: true });
 
-require('../../dist/HashSet-6fe62df2.cjs.prod.js');
-var HashSet_dist_effectHashSet = require('../../dist/HashSet-c40a52b1.cjs.prod.js');
-require('../../dist/Equal-ce9977a8.cjs.prod.js');
-require('../../dist/Hash-1bd73210.cjs.prod.js');
-require('../../dist/Function-2e6b0cda.cjs.prod.js');
-require('../../dist/GlobalValue-cb645c99.cjs.prod.js');
-require('../../dist/Utils-864e1d48.cjs.prod.js');
-require('../../dist/Predicate-daa86e61.cjs.prod.js');
-require('../../dist/Inspectable-3c4a0f5d.cjs.prod.js');
+var HashSet = require('../../dist/HashSet-6257b66d.cjs.prod.js');
+require('../../Equal/dist/effect-Equal.cjs.prod.js');
+require('../../Hash/dist/effect-Hash.cjs.prod.js');
+require('../../Function/dist/effect-Function.cjs.prod.js');
+require('../../GlobalValue/dist/effect-GlobalValue.cjs.prod.js');
+require('../../Utils/dist/effect-Utils.cjs.prod.js');
+require('../../Predicate/dist/effect-Predicate.cjs.prod.js');
+require('../../Inspectable/dist/effect-Inspectable.cjs.prod.js');
 require('../../dist/Stack-fc8f9fe5.cjs.prod.js');
-require('../../dist/Option-02025c86.cjs.prod.js');
-require('../../dist/Equivalence-0bc84518.cjs.prod.js');
-require('../../dist/Either-d03d5f05.cjs.prod.js');
-require('../../dist/Effectable-f867d1cb.cjs.prod.js');
-require('../../dist/Data-07dc27f1.cjs.prod.js');
-require('../../dist/Pipeable-d3ec6711.cjs.prod.js');
-require('../../dist/Number-cb2ba2e8.cjs.prod.js');
-require('../../dist/Order-8a112bfb.cjs.prod.js');
-
-
-
-exports.add = HashSet_dist_effectHashSet.add;
-exports.beginMutation = HashSet_dist_effectHashSet.beginMutation;
-exports.difference = HashSet_dist_effectHashSet.difference;
-exports.empty = HashSet_dist_effectHashSet.empty;
-exports.endMutation = HashSet_dist_effectHashSet.endMutation;
-exports.every = HashSet_dist_effectHashSet.every;
-exports.filter = HashSet_dist_effectHashSet.filter;
-exports.flatMap = HashSet_dist_effectHashSet.flatMap;
-exports.forEach = HashSet_dist_effectHashSet.forEach;
-exports.fromIterable = HashSet_dist_effectHashSet.fromIterable;
-exports.has = HashSet_dist_effectHashSet.has;
-exports.intersection = HashSet_dist_effectHashSet.intersection;
-exports.isHashSet = HashSet_dist_effectHashSet.isHashSet;
-exports.isSubset = HashSet_dist_effectHashSet.isSubset;
-exports.make = HashSet_dist_effectHashSet.make;
-exports.map = HashSet_dist_effectHashSet.map;
-exports.mutate = HashSet_dist_effectHashSet.mutate;
-exports.partition = HashSet_dist_effectHashSet.partition;
-exports.reduce = HashSet_dist_effectHashSet.reduce;
-exports.remove = HashSet_dist_effectHashSet.remove;
-exports.size = HashSet_dist_effectHashSet.size;
-exports.some = HashSet_dist_effectHashSet.some;
-exports.toggle = HashSet_dist_effectHashSet.toggle;
-exports.union = HashSet_dist_effectHashSet.union;
-exports.values = HashSet_dist_effectHashSet.values;
+require('../../Option/dist/effect-Option.cjs.prod.js');
+require('../../Equivalence/dist/effect-Equivalence.cjs.prod.js');
+require('../../dist/Either-7a881c7a.cjs.prod.js');
+require('../../dist/Effectable-cd8f3a96.cjs.prod.js');
+require('../../Data/dist/effect-Data.cjs.prod.js');
+require('../../Pipeable/dist/effect-Pipeable.cjs.prod.js');
+require('../../Number/dist/effect-Number.cjs.prod.js');
+require('../../Order/dist/effect-Order.cjs.prod.js');
+
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category symbol
+ */
+
+/**
+ * @since 2.0.0
+ * @category models
+ */
+
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isHashSet = HashSet.isHashSet;
+
+/**
+ * Creates an empty `HashSet`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = HashSet.empty;
+
+/**
+ * Construct a new `HashSet` from a `Collection` of values
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = HashSet.fromIterable;
+
+/**
+ * Construct a new `HashSet` from a variable number of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = HashSet.make;
+
+/**
+ * Checks if the specified value exists in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const has = HashSet.has;
+
+/**
+ * Check if a predicate holds true for some `HashSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const some = HashSet.some;
+
+/**
+ * Check if a predicate holds true for every `HashSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const every = HashSet.every;
+
+/**
+ * Returns `true` if and only if every element in the this `HashSet` is an
+ * element of the second set,
+ *
+ * **NOTE**: the hash and equal of both sets must be the same.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const isSubset = HashSet.isSubset;
+
+/**
+ * Returns an `IterableIterator` of the values in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const values = HashSet.values;
+
+/**
+ * Calculates the number of values in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const size = HashSet.size;
+
+/**
+ * Marks the `HashSet` as mutable.
+ *
+ * @since 2.0.0
+ */
+const beginMutation = HashSet.beginMutation;
+
+/**
+ * Marks the `HashSet` as immutable.
+ *
+ * @since 2.0.0
+ */
+const endMutation = HashSet.endMutation;
+
+/**
+ * Mutates the `HashSet` within the context of the provided function.
+ *
+ * @since 2.0.0
+ */
+const mutate = HashSet.mutate;
+
+/**
+ * Adds a value to the `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const add = HashSet.add;
+
+/**
+ * Removes a value from the `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const remove = HashSet.remove;
+
+/**
+ * Computes the set difference between this `HashSet` and the specified
+ * `Iterable<A>`.
+ *
+ * **NOTE**: the hash and equal of the values in both the set and the iterable
+ * must be the same.
+ *
+ * @since 2.0.0
+ */
+const difference = HashSet.difference;
+
+/**
+ * Returns a `HashSet` of values which are present in both this set and that
+ * `Iterable<A>`.
+ *
+ * **NOTE**: the hash and equal of the values in both the set and the iterable
+ * must be the same.
+ *
+ * @since 2.0.0
+ */
+const intersection = HashSet.intersection;
+
+/**
+ * Computes the set union `(`self` + `that`)` between this `HashSet` and the
+ * specified `Iterable<A>`.
+ *
+ * **NOTE**: the hash and equal of the values in both the set and the iterable
+ * must be the same.
+ *
+ * @since 2.0.0
+ */
+const union = HashSet.union;
+
+/**
+ * Checks if a value is present in the `HashSet`. If it is present, the value
+ * will be removed from the `HashSet`, otherwise the value will be added to the
+ * `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const toggle = HashSet.toggle;
+
+/**
+ * Maps over the values of the `HashSet` using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = HashSet.map;
+
+/**
+ * Chains over the values of the `HashSet` using the specified function.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = HashSet.flatMap;
+
+/**
+ * Applies the specified function to the values of the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = HashSet.forEach;
+
+/**
+ * Reduces the specified state over the values of the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const reduce = HashSet.reduce;
+
+/**
+ * Filters values out of a `HashSet` using the specified predicate.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = HashSet.filter;
+
+/**
+ * Partition the values of a `HashSet` using the specified predicate.
+ *
+ * If a value matches the predicate, it will be placed into the `HashSet` on the
+ * right side of the resulting `Tuple`, otherwise the value will be placed into
+ * the left side.
+ *
+ * @since 2.0.0
+ * @category partitioning
+ */
+const partition = HashSet.partition;
+
+exports.add = add;
+exports.beginMutation = beginMutation;
+exports.difference = difference;
+exports.empty = empty;
+exports.endMutation = endMutation;
+exports.every = every;
+exports.filter = filter;
+exports.flatMap = flatMap;
+exports.forEach = forEach;
+exports.fromIterable = fromIterable;
+exports.has = has;
+exports.intersection = intersection;
+exports.isHashSet = isHashSet;
+exports.isSubset = isSubset;
+exports.make = make;
+exports.map = map;
+exports.mutate = mutate;
+exports.partition = partition;
+exports.reduce = reduce;
+exports.remove = remove;
+exports.size = size;
+exports.some = some;
+exports.toggle = toggle;
+exports.union = union;
+exports.values = values;