effect 2.0.0-next.41 → 2.0.0-next.43

package/dist/HashMap-12668911.cjs.prod.js

@@ -1,361 +0,0 @@
-'use strict';
-
-var HashSet = require('./HashSet-6fe62df2.cjs.prod.js');
-
-/** @internal */
-function keySet$1(self) {
-  return HashSet.makeImpl(self);
-}
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category refinements
- */
-const isHashMap = HashSet.isHashMap;
-
-/**
- * Creates a new `HashMap`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const empty = HashSet.empty$1;
-
-/**
- * Constructs a new `HashMap` from an array of key/value pairs.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make = HashSet.make$1;
-
-/**
- * Constructs a new `HashMap` from an iterable of key/value pairs.
- *
- * @since 2.0.0
- * @category constructors
- */
-const fromIterable = HashSet.fromIterable$1;
-
-/**
- * Checks if the `HashMap` contains any entries.
- *
- * @since 2.0.0
- * @category elements
- */
-const isEmpty = HashSet.isEmpty;
-
-/**
- * Safely lookup the value for the specified key in the `HashMap` using the
- * internal hashing function.
- *
- * @since 2.0.0
- * @category elements
- */
-const get = HashSet.get;
-
-/**
- * Lookup the value for the specified key in the `HashMap` using a custom hash.
- *
- * @since 2.0.0
- * @category elements
- */
-const getHash = HashSet.getHash;
-
-/**
- * Unsafely lookup the value for the specified key in the `HashMap` using the
- * internal hashing function.
- *
- * @since 2.0.0
- * @category unsafe
- */
-const unsafeGet = HashSet.unsafeGet;
-
-/**
- * Checks if the specified key has an entry in the `HashMap`.
- *
- * @since 2.0.0
- * @category elements
- */
-const has = HashSet.has$1;
-
-/**
- * Checks if the specified key has an entry in the `HashMap` using a custom
- * hash.
- *
- * @since 2.0.0
- * @category elements
- */
-const hasHash = HashSet.hasHash;
-
-/**
- * Sets the specified key to the specified value using the internal hashing
- * function.
- *
- * @since 2.0.0
- */
-const set = HashSet.set;
-
-/**
- * Returns an `IterableIterator` of the keys within the `HashMap`.
- *
- * @since 2.0.0
- * @category getters
- */
-const keys = HashSet.keys;
-
-/**
- * Returns a `HashSet` of keys within the `HashMap`.
- *
- * @since 2.0.0
- * @category getter
- */
-const keySet = keySet$1;
-
-/**
- * Returns an `IterableIterator` of the values within the `HashMap`.
- *
- * @since 2.0.0
- * @category getters
- */
-const values = HashSet.values$1;
-
-/**
- * Returns the number of entries within the `HashMap`.
- *
- * @since 2.0.0
- * @category getters
- */
-const size = HashSet.size$1;
-
-/**
- * Marks the `HashMap` as mutable.
- *
- * @since 2.0.0
- */
-const beginMutation = HashSet.beginMutation$1;
-
-/**
- * Marks the `HashMap` as immutable.
- *
- * @since 2.0.0
- */
-const endMutation = HashSet.endMutation$1;
-
-/**
- * Mutates the `HashMap` within the context of the provided function.
- *
- * @since 2.0.0
- */
-const mutate = HashSet.mutate$1;
-
-/**
- * Set or remove the specified key in the `HashMap` using the specified
- * update function. The value of the specified key will be computed using the
- * provided hash.
- *
- * The update function will be invoked with the current value of the key if it
- * exists, or `None` if no such value exists.
- *
- * @since 2.0.0
- */
-const modifyAt = HashSet.modifyAt;
-
-/**
- * Alter the value of the specified key in the `HashMap` using the specified
- * update function. The value of the specified key will be computed using the
- * provided hash.
- *
- * The update function will be invoked with the current value of the key if it
- * exists, or `None` if no such value exists.
- *
- * This function will always either update or insert a value into the `HashMap`.
- *
- * @since 2.0.0
- */
-const modifyHash = HashSet.modifyHash;
-
-/**
- * Updates the value of the specified key within the `HashMap` if it exists.
- *
- * @since 2.0.0
- */
-const modify = HashSet.modify;
-
-/**
- * Performs a union of this `HashMap` and that `HashMap`.
- *
- * @since 2.0.0
- */
-const union = HashSet.union$1;
-
-/**
- * Remove the entry for the specified key in the `HashMap` using the internal
- * hashing function.
- *
- * @since 2.0.0
- */
-const remove = HashSet.remove$1;
-
-/**
- * Removes all entries in the `HashMap` which have the specified keys.
- *
- * @since 2.0.0
- */
-const removeMany = HashSet.removeMany;
-
-/**
- * Maps over the entries of the `HashMap` using the specified function.
- *
- * @since 2.0.0
- * @category mapping
- */
-const map = HashSet.map$1;
-
-/**
- * Chains over the entries of the `HashMap` using the specified function.
- *
- * **NOTE**: the hash and equal of both maps have to be the same.
- *
- * @since 2.0.0
- * @category sequencing
- */
-const flatMap = HashSet.flatMap$1;
-
-/**
- * Applies the specified function to the entries of the `HashMap`.
- *
- * @since 2.0.0
- * @category traversing
- */
-const forEach = HashSet.forEach$1;
-
-/**
- * Reduces the specified state over the entries of the `HashMap`.
- *
- * @since 2.0.0
- * @category folding
- */
-const reduce = HashSet.reduce$1;
-
-/**
- * Filters entries out of a `HashMap` using the specified predicate.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filter = HashSet.filter$1;
-
-/**
- * Filters out `None` values from a `HashMap` of `Options`s.
- *
- * @since 2.0.0
- * @category filtering
- */
-const compact = HashSet.compact;
-
-/**
- * Maps over the entries of the `HashMap` using the specified partial function
- * and filters out `None` values.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filterMap = HashSet.filterMap;
-
-/**
- * Returns the first element that satisfies the specified
- * predicate, or `None` if no such element exists.
- *
- * @category elements
- * @since 2.0.0
- */
-const findFirst = HashSet.findFirst;
-
-var HashMap = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  isHashMap: isHashMap,
-  empty: empty,
-  make: make,
-  fromIterable: fromIterable,
-  isEmpty: isEmpty,
-  get: get,
-  getHash: getHash,
-  unsafeGet: unsafeGet,
-  has: has,
-  hasHash: hasHash,
-  set: set,
-  keys: keys,
-  keySet: keySet,
-  values: values,
-  size: size,
-  beginMutation: beginMutation,
-  endMutation: endMutation,
-  mutate: mutate,
-  modifyAt: modifyAt,
-  modifyHash: modifyHash,
-  modify: modify,
-  union: union,
-  remove: remove,
-  removeMany: removeMany,
-  map: map,
-  flatMap: flatMap,
-  forEach: forEach,
-  reduce: reduce,
-  filter: filter,
-  compact: compact,
-  filterMap: filterMap,
-  findFirst: findFirst
-});
-
-exports.HashMap = HashMap;
-exports.beginMutation = beginMutation;
-exports.compact = compact;
-exports.empty = empty;
-exports.endMutation = endMutation;
-exports.filter = filter;
-exports.filterMap = filterMap;
-exports.findFirst = findFirst;
-exports.flatMap = flatMap;
-exports.forEach = forEach;
-exports.fromIterable = fromIterable;
-exports.get = get;
-exports.getHash = getHash;
-exports.has = has;
-exports.hasHash = hasHash;
-exports.isEmpty = isEmpty;
-exports.isHashMap = isHashMap;
-exports.keySet = keySet;
-exports.keys = keys;
-exports.make = make;
-exports.map = map;
-exports.modify = modify;
-exports.modifyAt = modifyAt;
-exports.modifyHash = modifyHash;
-exports.mutate = mutate;
-exports.reduce = reduce;
-exports.remove = remove;
-exports.removeMany = removeMany;
-exports.set = set;
-exports.size = size;
-exports.union = union;
-exports.unsafeGet = unsafeGet;
-exports.values = values;

package/dist/HashMap-68e290b6.cjs.dev.js

@@ -1,361 +0,0 @@
-'use strict';
-
-var HashSet = require('./HashSet-ece2cfe8.cjs.dev.js');
-
-/** @internal */
-function keySet$1(self) {
-  return HashSet.makeImpl(self);
-}
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category symbol
- */
-
-/**
- * @since 2.0.0
- * @category models
- */
-
-/**
- * @since 2.0.0
- */
-
-/**
- * @since 2.0.0
- * @category refinements
- */
-const isHashMap = HashSet.isHashMap;
-
-/**
- * Creates a new `HashMap`.
- *
- * @since 2.0.0
- * @category constructors
- */
-const empty = HashSet.empty$1;
-
-/**
- * Constructs a new `HashMap` from an array of key/value pairs.
- *
- * @since 2.0.0
- * @category constructors
- */
-const make = HashSet.make$1;
-
-/**
- * Constructs a new `HashMap` from an iterable of key/value pairs.
- *
- * @since 2.0.0
- * @category constructors
- */
-const fromIterable = HashSet.fromIterable$1;
-
-/**
- * Checks if the `HashMap` contains any entries.
- *
- * @since 2.0.0
- * @category elements
- */
-const isEmpty = HashSet.isEmpty;
-
-/**
- * Safely lookup the value for the specified key in the `HashMap` using the
- * internal hashing function.
- *
- * @since 2.0.0
- * @category elements
- */
-const get = HashSet.get;
-
-/**
- * Lookup the value for the specified key in the `HashMap` using a custom hash.
- *
- * @since 2.0.0
- * @category elements
- */
-const getHash = HashSet.getHash;
-
-/**
- * Unsafely lookup the value for the specified key in the `HashMap` using the
- * internal hashing function.
- *
- * @since 2.0.0
- * @category unsafe
- */
-const unsafeGet = HashSet.unsafeGet;
-
-/**
- * Checks if the specified key has an entry in the `HashMap`.
- *
- * @since 2.0.0
- * @category elements
- */
-const has = HashSet.has$1;
-
-/**
- * Checks if the specified key has an entry in the `HashMap` using a custom
- * hash.
- *
- * @since 2.0.0
- * @category elements
- */
-const hasHash = HashSet.hasHash;
-
-/**
- * Sets the specified key to the specified value using the internal hashing
- * function.
- *
- * @since 2.0.0
- */
-const set = HashSet.set;
-
-/**
- * Returns an `IterableIterator` of the keys within the `HashMap`.
- *
- * @since 2.0.0
- * @category getters
- */
-const keys = HashSet.keys;
-
-/**
- * Returns a `HashSet` of keys within the `HashMap`.
- *
- * @since 2.0.0
- * @category getter
- */
-const keySet = keySet$1;
-
-/**
- * Returns an `IterableIterator` of the values within the `HashMap`.
- *
- * @since 2.0.0
- * @category getters
- */
-const values = HashSet.values$1;
-
-/**
- * Returns the number of entries within the `HashMap`.
- *
- * @since 2.0.0
- * @category getters
- */
-const size = HashSet.size$1;
-
-/**
- * Marks the `HashMap` as mutable.
- *
- * @since 2.0.0
- */
-const beginMutation = HashSet.beginMutation$1;
-
-/**
- * Marks the `HashMap` as immutable.
- *
- * @since 2.0.0
- */
-const endMutation = HashSet.endMutation$1;
-
-/**
- * Mutates the `HashMap` within the context of the provided function.
- *
- * @since 2.0.0
- */
-const mutate = HashSet.mutate$1;
-
-/**
- * Set or remove the specified key in the `HashMap` using the specified
- * update function. The value of the specified key will be computed using the
- * provided hash.
- *
- * The update function will be invoked with the current value of the key if it
- * exists, or `None` if no such value exists.
- *
- * @since 2.0.0
- */
-const modifyAt = HashSet.modifyAt;
-
-/**
- * Alter the value of the specified key in the `HashMap` using the specified
- * update function. The value of the specified key will be computed using the
- * provided hash.
- *
- * The update function will be invoked with the current value of the key if it
- * exists, or `None` if no such value exists.
- *
- * This function will always either update or insert a value into the `HashMap`.
- *
- * @since 2.0.0
- */
-const modifyHash = HashSet.modifyHash;
-
-/**
- * Updates the value of the specified key within the `HashMap` if it exists.
- *
- * @since 2.0.0
- */
-const modify = HashSet.modify;
-
-/**
- * Performs a union of this `HashMap` and that `HashMap`.
- *
- * @since 2.0.0
- */
-const union = HashSet.union$1;
-
-/**
- * Remove the entry for the specified key in the `HashMap` using the internal
- * hashing function.
- *
- * @since 2.0.0
- */
-const remove = HashSet.remove$1;
-
-/**
- * Removes all entries in the `HashMap` which have the specified keys.
- *
- * @since 2.0.0
- */
-const removeMany = HashSet.removeMany;
-
-/**
- * Maps over the entries of the `HashMap` using the specified function.
- *
- * @since 2.0.0
- * @category mapping
- */
-const map = HashSet.map$1;
-
-/**
- * Chains over the entries of the `HashMap` using the specified function.
- *
- * **NOTE**: the hash and equal of both maps have to be the same.
- *
- * @since 2.0.0
- * @category sequencing
- */
-const flatMap = HashSet.flatMap$1;
-
-/**
- * Applies the specified function to the entries of the `HashMap`.
- *
- * @since 2.0.0
- * @category traversing
- */
-const forEach = HashSet.forEach$1;
-
-/**
- * Reduces the specified state over the entries of the `HashMap`.
- *
- * @since 2.0.0
- * @category folding
- */
-const reduce = HashSet.reduce$1;
-
-/**
- * Filters entries out of a `HashMap` using the specified predicate.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filter = HashSet.filter$1;
-
-/**
- * Filters out `None` values from a `HashMap` of `Options`s.
- *
- * @since 2.0.0
- * @category filtering
- */
-const compact = HashSet.compact;
-
-/**
- * Maps over the entries of the `HashMap` using the specified partial function
- * and filters out `None` values.
- *
- * @since 2.0.0
- * @category filtering
- */
-const filterMap = HashSet.filterMap;
-
-/**
- * Returns the first element that satisfies the specified
- * predicate, or `None` if no such element exists.
- *
- * @category elements
- * @since 2.0.0
- */
-const findFirst = HashSet.findFirst;
-
-var HashMap = /*#__PURE__*/Object.freeze({
-  __proto__: null,
-  isHashMap: isHashMap,
-  empty: empty,
-  make: make,
-  fromIterable: fromIterable,
-  isEmpty: isEmpty,
-  get: get,
-  getHash: getHash,
-  unsafeGet: unsafeGet,
-  has: has,
-  hasHash: hasHash,
-  set: set,
-  keys: keys,
-  keySet: keySet,
-  values: values,
-  size: size,
-  beginMutation: beginMutation,
-  endMutation: endMutation,
-  mutate: mutate,
-  modifyAt: modifyAt,
-  modifyHash: modifyHash,
-  modify: modify,
-  union: union,
-  remove: remove,
-  removeMany: removeMany,
-  map: map,
-  flatMap: flatMap,
-  forEach: forEach,
-  reduce: reduce,
-  filter: filter,
-  compact: compact,
-  filterMap: filterMap,
-  findFirst: findFirst
-});
-
-exports.HashMap = HashMap;
-exports.beginMutation = beginMutation;
-exports.compact = compact;
-exports.empty = empty;
-exports.endMutation = endMutation;
-exports.filter = filter;
-exports.filterMap = filterMap;
-exports.findFirst = findFirst;
-exports.flatMap = flatMap;
-exports.forEach = forEach;
-exports.fromIterable = fromIterable;
-exports.get = get;
-exports.getHash = getHash;
-exports.has = has;
-exports.hasHash = hasHash;
-exports.isEmpty = isEmpty;
-exports.isHashMap = isHashMap;
-exports.keySet = keySet;
-exports.keys = keys;
-exports.make = make;
-exports.map = map;
-exports.modify = modify;
-exports.modifyAt = modifyAt;
-exports.modifyHash = modifyHash;
-exports.mutate = mutate;
-exports.reduce = reduce;
-exports.remove = remove;
-exports.removeMany = removeMany;
-exports.set = set;
-exports.size = size;
-exports.union = union;
-exports.unsafeGet = unsafeGet;
-exports.values = values;