effect 2.0.0-next.37 → 2.0.0-next.39

package/dist/HashMap-2604a8b0.cjs.prod.js

@@ -1,361 +0,0 @@
-'use strict';
-
-var HashSet = require('./HashSet-286fb998.cjs.prod.js');
-
-/** @internal */
-function keySet$1(self) {
-  return HashSet.makeImpl(self);
-}
-
-/**
- * @since 1.0.0
- */
-
-/**
- * @since 1.0.0
- * @category symbol
- */
-
-/**
- * @since 1.0.0
- * @category models
- */
-
-/**
- * @since 1.0.0
- */
-
-/**
- * @since 1.0.0
- * @category refinements
- */
-const isHashMap = HashSet.isHashMap;
-
-/**
- * Creates a new `HashMap`.
- *
- * @since 1.0.0
- * @category constructors
- */
-const empty = HashSet.empty$1;
-
-/**
- * Constructs a new `HashMap` from an array of key/value pairs.
- *
- * @since 1.0.0
- * @category constructors
- */
-const make = HashSet.make$1;
-
-/**
- * Constructs a new `HashMap` from an iterable of key/value pairs.
- *
- * @since 1.0.0
- * @category constructors
- */
-const fromIterable = HashSet.fromIterable$1;
-
-/**
- * Checks if the `HashMap` contains any entries.
- *
- * @since 1.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 1.0.0
- * @category elements
- */
-const get = HashSet.get;
-
-/**
- * Lookup the value for the specified key in the `HashMap` using a custom hash.
- *
- * @since 1.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 1.0.0
- * @category unsafe
- */
-const unsafeGet = HashSet.unsafeGet;
-
-/**
- * Checks if the specified key has an entry in the `HashMap`.
- *
- * @since 1.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 1.0.0
- * @category elements
- */
-const hasHash = HashSet.hasHash;
-
-/**
- * Sets the specified key to the specified value using the internal hashing
- * function.
- *
- * @since 1.0.0
- */
-const set = HashSet.set;
-
-/**
- * Returns an `IterableIterator` of the keys within the `HashMap`.
- *
- * @since 1.0.0
- * @category getters
- */
-const keys = HashSet.keys;
-
-/**
- * Returns a `HashSet` of keys within the `HashMap`.
- *
- * @since 1.0.0
- * @category getter
- */
-const keySet = keySet$1;
-
-/**
- * Returns an `IterableIterator` of the values within the `HashMap`.
- *
- * @since 1.0.0
- * @category getters
- */
-const values = HashSet.values$1;
-
-/**
- * Returns the number of entries within the `HashMap`.
- *
- * @since 1.0.0
- * @category getters
- */
-const size = HashSet.size$1;
-
-/**
- * Marks the `HashMap` as mutable.
- *
- * @since 1.0.0
- */
-const beginMutation = HashSet.beginMutation$1;
-
-/**
- * Marks the `HashMap` as immutable.
- *
- * @since 1.0.0
- */
-const endMutation = HashSet.endMutation$1;
-
-/**
- * Mutates the `HashMap` within the context of the provided function.
- *
- * @since 1.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 1.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 1.0.0
- */
-const modifyHash = HashSet.modifyHash;
-
-/**
- * Updates the value of the specified key within the `HashMap` if it exists.
- *
- * @since 1.0.0
- */
-const modify = HashSet.modify;
-
-/**
- * Performs a union of this `HashMap` and that `HashMap`.
- *
- * @since 1.0.0
- */
-const union = HashSet.union$1;
-
-/**
- * Remove the entry for the specified key in the `HashMap` using the internal
- * hashing function.
- *
- * @since 1.0.0
- */
-const remove = HashSet.remove$1;
-
-/**
- * Removes all entries in the `HashMap` which have the specified keys.
- *
- * @since 1.0.0
- */
-const removeMany = HashSet.removeMany;
-
-/**
- * Maps over the entries of the `HashMap` using the specified function.
- *
- * @since 1.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 1.0.0
- * @category sequencing
- */
-const flatMap = HashSet.flatMap$1;
-
-/**
- * Applies the specified function to the entries of the `HashMap`.
- *
- * @since 1.0.0
- * @category traversing
- */
-const forEach = HashSet.forEach$1;
-
-/**
- * Reduces the specified state over the entries of the `HashMap`.
- *
- * @since 1.0.0
- * @category folding
- */
-const reduce = HashSet.reduce$1;
-
-/**
- * Filters entries out of a `HashMap` using the specified predicate.
- *
- * @since 1.0.0
- * @category filtering
- */
-const filter = HashSet.filter$1;
-
-/**
- * Filters out `None` values from a `HashMap` of `Options`s.
- *
- * @since 1.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 1.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 1.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-e644e23b.esm.js

@@ -1,327 +0,0 @@
-import { z as makeImpl, A as isHashMap$1, B as empty$1, C as make$1, D as fromIterable$1, E as isEmpty$1, F as get$1, G as getHash$1, H as unsafeGet$1, I as has$1, J as hasHash$1, K as set$1, L as keys$1, M as values$1, N as size$1, O as beginMutation$1, P as endMutation$1, Q as mutate$1, R as modifyAt$1, S as modifyHash$1, T as modify$1, U as union$1, V as remove$1, W as removeMany$1, X as map$1, Y as flatMap$1, Z as forEach$1, _ as reduce$1, $ as filter$1, a0 as compact$1, a1 as filterMap$1, a2 as findFirst$1 } from './HashSet-d051e0ea.esm.js';
-
-/** @internal */
-function keySet$1(self) {
-  return makeImpl(self);
-}
-
-/**
- * @since 1.0.0
- */
-
-/**
- * @since 1.0.0
- * @category symbol
- */
-
-/**
- * @since 1.0.0
- * @category models
- */
-
-/**
- * @since 1.0.0
- */
-
-/**
- * @since 1.0.0
- * @category refinements
- */
-const isHashMap = isHashMap$1;
-
-/**
- * Creates a new `HashMap`.
- *
- * @since 1.0.0
- * @category constructors
- */
-const empty = empty$1;
-
-/**
- * Constructs a new `HashMap` from an array of key/value pairs.
- *
- * @since 1.0.0
- * @category constructors
- */
-const make = make$1;
-
-/**
- * Constructs a new `HashMap` from an iterable of key/value pairs.
- *
- * @since 1.0.0
- * @category constructors
- */
-const fromIterable = fromIterable$1;
-
-/**
- * Checks if the `HashMap` contains any entries.
- *
- * @since 1.0.0
- * @category elements
- */
-const isEmpty = isEmpty$1;
-
-/**
- * Safely lookup the value for the specified key in the `HashMap` using the
- * internal hashing function.
- *
- * @since 1.0.0
- * @category elements
- */
-const get = get$1;
-
-/**
- * Lookup the value for the specified key in the `HashMap` using a custom hash.
- *
- * @since 1.0.0
- * @category elements
- */
-const getHash = getHash$1;
-
-/**
- * Unsafely lookup the value for the specified key in the `HashMap` using the
- * internal hashing function.
- *
- * @since 1.0.0
- * @category unsafe
- */
-const unsafeGet = unsafeGet$1;
-
-/**
- * Checks if the specified key has an entry in the `HashMap`.
- *
- * @since 1.0.0
- * @category elements
- */
-const has = has$1;
-
-/**
- * Checks if the specified key has an entry in the `HashMap` using a custom
- * hash.
- *
- * @since 1.0.0
- * @category elements
- */
-const hasHash = hasHash$1;
-
-/**
- * Sets the specified key to the specified value using the internal hashing
- * function.
- *
- * @since 1.0.0
- */
-const set = set$1;
-
-/**
- * Returns an `IterableIterator` of the keys within the `HashMap`.
- *
- * @since 1.0.0
- * @category getters
- */
-const keys = keys$1;
-
-/**
- * Returns a `HashSet` of keys within the `HashMap`.
- *
- * @since 1.0.0
- * @category getter
- */
-const keySet = keySet$1;
-
-/**
- * Returns an `IterableIterator` of the values within the `HashMap`.
- *
- * @since 1.0.0
- * @category getters
- */
-const values = values$1;
-
-/**
- * Returns the number of entries within the `HashMap`.
- *
- * @since 1.0.0
- * @category getters
- */
-const size = size$1;
-
-/**
- * Marks the `HashMap` as mutable.
- *
- * @since 1.0.0
- */
-const beginMutation = beginMutation$1;
-
-/**
- * Marks the `HashMap` as immutable.
- *
- * @since 1.0.0
- */
-const endMutation = endMutation$1;
-
-/**
- * Mutates the `HashMap` within the context of the provided function.
- *
- * @since 1.0.0
- */
-const mutate = 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 1.0.0
- */
-const modifyAt = modifyAt$1;
-
-/**
- * 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 1.0.0
- */
-const modifyHash = modifyHash$1;
-
-/**
- * Updates the value of the specified key within the `HashMap` if it exists.
- *
- * @since 1.0.0
- */
-const modify = modify$1;
-
-/**
- * Performs a union of this `HashMap` and that `HashMap`.
- *
- * @since 1.0.0
- */
-const union = union$1;
-
-/**
- * Remove the entry for the specified key in the `HashMap` using the internal
- * hashing function.
- *
- * @since 1.0.0
- */
-const remove = remove$1;
-
-/**
- * Removes all entries in the `HashMap` which have the specified keys.
- *
- * @since 1.0.0
- */
-const removeMany = removeMany$1;
-
-/**
- * Maps over the entries of the `HashMap` using the specified function.
- *
- * @since 1.0.0
- * @category mapping
- */
-const map = 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 1.0.0
- * @category sequencing
- */
-const flatMap = flatMap$1;
-
-/**
- * Applies the specified function to the entries of the `HashMap`.
- *
- * @since 1.0.0
- * @category traversing
- */
-const forEach = forEach$1;
-
-/**
- * Reduces the specified state over the entries of the `HashMap`.
- *
- * @since 1.0.0
- * @category folding
- */
-const reduce = reduce$1;
-
-/**
- * Filters entries out of a `HashMap` using the specified predicate.
- *
- * @since 1.0.0
- * @category filtering
- */
-const filter = filter$1;
-
-/**
- * Filters out `None` values from a `HashMap` of `Options`s.
- *
- * @since 1.0.0
- * @category filtering
- */
-const compact = compact$1;
-
-/**
- * Maps over the entries of the `HashMap` using the specified partial function
- * and filters out `None` values.
- *
- * @since 1.0.0
- * @category filtering
- */
-const filterMap = filterMap$1;
-
-/**
- * Returns the first element that satisfies the specified
- * predicate, or `None` if no such element exists.
- *
- * @category elements
- * @since 1.0.0
- */
-const findFirst = findFirst$1;
-
-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
-});
-
-export { removeMany as A, flatMap as B, filter as C, compact as D, filterMap as E, findFirst as F, HashMap as H, map as a, size as b, remove as c, forEach as d, empty as e, fromIterable as f, get as g, modify as h, isEmpty as i, has as j, keys as k, isHashMap as l, make as m, getHash as n, hasHash as o, keySet as p, beginMutation as q, reduce as r, set as s, endMutation as t, unsafeGet as u, values as v, mutate as w, modifyAt as x, modifyHash as y, union as z };