effect 2.0.0-next.57 → 2.0.0-next.59

package/HashMap.js

@@ -0,0 +1,287 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.values = exports.unsafeGet = exports.union = exports.toEntries = exports.size = exports.set = exports.removeMany = exports.remove = exports.reduce = exports.mutate = exports.modifyHash = exports.modifyAt = exports.modify = exports.map = exports.make = exports.keys = exports.keySet = exports.isHashMap = exports.isEmpty = exports.hasHash = exports.has = exports.getHash = exports.get = exports.fromIterable = exports.forEach = exports.flatMap = exports.findFirst = exports.filterMap = exports.filter = exports.entries = exports.endMutation = exports.empty = exports.compact = exports.beginMutation = void 0;
+var HM = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./internal/hashMap.js"));
+var _keySet = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./internal/hashMap/keySet.js"));
+function _getRequireWildcardCache(e) {
+  if ("function" != typeof WeakMap) return null;
+  var r = new WeakMap(),
+    t = new WeakMap();
+  return (_getRequireWildcardCache = function (e) {
+    return e ? t : r;
+  })(e);
+}
+function _interopRequireWildcard(e, r) {
+  if (!r && e && e.__esModule) return e;
+  if (null === e || "object" != typeof e && "function" != typeof e) return {
+    default: e
+  };
+  var t = _getRequireWildcardCache(r);
+  if (t && t.has(e)) return t.get(e);
+  var n = {
+      __proto__: null
+    },
+    a = Object.defineProperty && Object.getOwnPropertyDescriptor;
+  for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) {
+    var i = a ? Object.getOwnPropertyDescriptor(e, u) : null;
+    i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
+  }
+  return n.default = e, t && t.set(e, n), n;
+}
+/**
+ * @since 2.0.0
+ */
+
+const TypeId = HM.HashMapTypeId;
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isHashMap = exports.isHashMap = HM.isHashMap;
+/**
+ * Creates a new `HashMap`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = exports.empty = HM.empty;
+/**
+ * Constructs a new `HashMap` from an array of key/value pairs.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = exports.make = HM.make;
+/**
+ * Creates a new `HashMap` from an iterable collection of key/value pairs.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = exports.fromIterable = HM.fromIterable;
+/**
+ * Checks if the `HashMap` contains any entries.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const isEmpty = exports.isEmpty = HM.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 = exports.get = HM.get;
+/**
+ * Lookup the value for the specified key in the `HashMap` using a custom hash.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const getHash = exports.getHash = HM.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 = exports.unsafeGet = HM.unsafeGet;
+/**
+ * Checks if the specified key has an entry in the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const has = exports.has = HM.has;
+/**
+ * Checks if the specified key has an entry in the `HashMap` using a custom
+ * hash.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const hasHash = exports.hasHash = HM.hasHash;
+/**
+ * Sets the specified key to the specified value using the internal hashing
+ * function.
+ *
+ * @since 2.0.0
+ */
+const set = exports.set = HM.set;
+/**
+ * Returns an `IterableIterator` of the keys within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const keys = exports.keys = HM.keys;
+/**
+ * Returns a `HashSet` of keys within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getter
+ */
+const keySet = exports.keySet = _keySet.keySet;
+/**
+ * Returns an `IterableIterator` of the values within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const values = exports.values = HM.values;
+/**
+ * Returns an `IterableIterator` of the entries within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const entries = exports.entries = HM.entries;
+/**
+ * Returns an `Array<[K, V]>` of the entries within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const toEntries = self => Array.from(entries(self));
+/**
+ * Returns the number of entries within the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+exports.toEntries = toEntries;
+const size = exports.size = HM.size;
+/**
+ * Marks the `HashMap` as mutable.
+ *
+ * @since 2.0.0
+ */
+const beginMutation = exports.beginMutation = HM.beginMutation;
+/**
+ * Marks the `HashMap` as immutable.
+ *
+ * @since 2.0.0
+ */
+const endMutation = exports.endMutation = HM.endMutation;
+/**
+ * Mutates the `HashMap` within the context of the provided function.
+ *
+ * @since 2.0.0
+ */
+const mutate = exports.mutate = HM.mutate;
+/**
+ * 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 = exports.modifyAt = HM.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 = exports.modifyHash = HM.modifyHash;
+/**
+ * Updates the value of the specified key within the `HashMap` if it exists.
+ *
+ * @since 2.0.0
+ */
+const modify = exports.modify = HM.modify;
+/**
+ * Performs a union of this `HashMap` and that `HashMap`.
+ *
+ * @since 2.0.0
+ */
+const union = exports.union = HM.union;
+/**
+ * Remove the entry for the specified key in the `HashMap` using the internal
+ * hashing function.
+ *
+ * @since 2.0.0
+ */
+const remove = exports.remove = HM.remove;
+/**
+ * Removes all entries in the `HashMap` which have the specified keys.
+ *
+ * @since 2.0.0
+ */
+const removeMany = exports.removeMany = HM.removeMany;
+/**
+ * Maps over the entries of the `HashMap` using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = exports.map = HM.map;
+/**
+ * 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 = exports.flatMap = HM.flatMap;
+/**
+ * Applies the specified function to the entries of the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = exports.forEach = HM.forEach;
+/**
+ * Reduces the specified state over the entries of the `HashMap`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const reduce = exports.reduce = HM.reduce;
+/**
+ * Filters entries out of a `HashMap` using the specified predicate.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = exports.filter = HM.filter;
+/**
+ * Filters out `None` values from a `HashMap` of `Options`s.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const compact = exports.compact = HM.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 = exports.filterMap = HM.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 = exports.findFirst = HM.findFirst;
+//# sourceMappingURL=HashMap.js.map

package/HashMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HashMap.js","names":["HM","_interopRequireWildcard","require","_keySet","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","TypeId","HashMapTypeId","isHashMap","exports","empty","make","fromIterable","isEmpty","getHash","unsafeGet","hasHash","keys","keySet","values","entries","toEntries","self","Array","from","size","beginMutation","endMutation","mutate","modifyAt","modifyHash","modify","union","remove","removeMany","map","flatMap","forEach","reduce","filter","compact","filterMap","findFirst"],"sources":["./src/HashMap.ts"],"sourcesContent":[null],"mappings":";;;;;;AAOA,IAAAA,EAAA,gBAAAC,uBAAA,eAAAC,OAAA;AACA,IAAAC,OAAA,gBAAAF,uBAAA,eAAAC,OAAA;AAAuD,SAAAE,yBAAAC,CAAA;EAAA,yBAAAC,OAAA;EAAA,IAAAC,CAAA,OAAAD,OAAA;IAAAE,CAAA,OAAAF,OAAA;EAAA,QAAAF,wBAAA,YAAAA,CAAAC,CAAA;IAAA,OAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA;EAAA,GAAAF,CAAA;AAAA;AAAA,SAAAJ,wBAAAI,CAAA,EAAAE,CAAA;EAAA,KAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA;EAAA,aAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA;IAAAK,OAAA,EAAAL;EAAA;EAAA,IAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA;EAAA,IAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA;EAAA,IAAAQ,CAAA;MAAAC,SAAA;IAAA;IAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA;EAAA,SAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA;IAAA,IAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA;IAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA;EAAA;EAAA,OAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA;AARvD;;;;AAYA,MAAMY,MAAM,GAAkBzB,EAAE,CAAC0B,aAAuB;AAyDxD;;;;AAIO,MAAMC,SAAS,GAAAC,OAAA,CAAAD,SAAA,GAGlB3B,EAAE,CAAC2B,SAAS;AAEhB;;;;;;AAMO,MAAME,KAAK,GAAAD,OAAA,CAAAC,KAAA,GAA8C7B,EAAE,CAAC6B,KAAK;AAExE;;;;;;AAMO,MAAMC,IAAI,GAAAF,OAAA,CAAAE,IAAA,GAKb9B,EAAE,CAAC8B,IAAI;AAEX;;;;;;AAMO,MAAMC,YAAY,GAAAH,OAAA,CAAAG,YAAA,GAAgE/B,EAAE,CAAC+B,YAAY;AAExG;;;;;;AAMO,MAAMC,OAAO,GAAAJ,OAAA,CAAAI,OAAA,GAA2ChC,EAAE,CAACgC,OAAO;AAEzE;;;;;;;AAOO,MAAMpB,GAAG,GAAAgB,OAAA,CAAAhB,GAAA,GAGZZ,EAAE,CAACY,GAAG;AAEV;;;;;;AAMO,MAAMqB,OAAO,GAAAL,OAAA,CAAAK,OAAA,GAGhBjC,EAAE,CAACiC,OAAO;AAEd;;;;;;;AAOO,MAAMC,SAAS,GAAAN,OAAA,CAAAM,SAAA,GAGlBlC,EAAE,CAACkC,SAAS;AAEhB;;;;;;AAMO,MAAMvB,GAAG,GAAAiB,OAAA,CAAAjB,GAAA,GAGZX,EAAE,CAACW,GAAG;AAEV;;;;;;;AAOO,MAAMwB,OAAO,GAAAP,OAAA,CAAAO,OAAA,GAGhBnC,EAAE,CAACmC,OAAO;AAEd;;;;;;AAMO,MAAMX,GAAG,GAAAI,OAAA,CAAAJ,GAAA,GAGZxB,EAAE,CAACwB,GAAG;AAEV;;;;;;AAMO,MAAMY,IAAI,GAAAR,OAAA,CAAAQ,IAAA,GAAuDpC,EAAE,CAACoC,IAAI;AAE/E;;;;;;AAMO,MAAMC,MAAM,GAAAT,OAAA,CAAAS,MAAA,GAA8ClC,OAAO,CAACkC,MAAM;AAE/E;;;;;;AAMO,MAAMC,MAAM,GAAAV,OAAA,CAAAU,MAAA,GAAuDtC,EAAE,CAACsC,MAAM;AAEnF;;;;;;AAMO,MAAMC,OAAO,GAAAX,OAAA,CAAAW,OAAA,GAA4DvC,EAAE,CAACuC,OAAO;AAE1F;;;;;;AAMO,MAAMC,SAAS,GAAUC,IAAmB,IAAoBC,KAAK,CAACC,IAAI,CAACJ,OAAO,CAACE,IAAI,CAAC,CAAC;AAEhG;;;;;;AAAAb,OAAA,CAAAY,SAAA,GAAAA,SAAA;AAMO,MAAMI,IAAI,GAAAhB,OAAA,CAAAgB,IAAA,GAA0C5C,EAAE,CAAC4C,IAAI;AAElE;;;;;AAKO,MAAMC,aAAa,GAAAjB,OAAA,CAAAiB,aAAA,GAAiD7C,EAAE,CAAC6C,aAAa;AAE3F;;;;;AAKO,MAAMC,WAAW,GAAAlB,OAAA,CAAAkB,WAAA,GAAiD9C,EAAE,CAAC8C,WAAW;AAEvF;;;;;AAKO,MAAMC,MAAM,GAAAnB,OAAA,CAAAmB,MAAA,GAGf/C,EAAE,CAAC+C,MAAM;AAEb;;;;;;;;;;AAUO,MAAMC,QAAQ,GAAApB,OAAA,CAAAoB,QAAA,GAGjBhD,EAAE,CAACgD,QAAQ;AAEf;;;;;;;;;;;;AAYO,MAAMC,UAAU,GAAArB,OAAA,CAAAqB,UAAA,GAGnBjD,EAAE,CAACiD,UAAU;AAEjB;;;;;AAKO,MAAMC,MAAM,GAAAtB,OAAA,CAAAsB,MAAA,GAGflD,EAAE,CAACkD,MAAM;AAEb;;;;;AAKO,MAAMC,KAAK,GAAAvB,OAAA,CAAAuB,KAAA,GAGdnD,EAAE,CAACmD,KAAK;AAEZ;;;;;;AAMO,MAAMC,MAAM,GAAAxB,OAAA,CAAAwB,MAAA,GAGfpD,EAAE,CAACoD,MAAM;AAEb;;;;;AAKO,MAAMC,UAAU,GAAAzB,OAAA,CAAAyB,UAAA,GAGnBrD,EAAE,CAACqD,UAAU;AAEjB;;;;;;AAMO,MAAMC,GAAG,GAAA1B,OAAA,CAAA0B,GAAA,GAGZtD,EAAE,CAACsD,GAAG;AAEV;;;;;;;;AAQO,MAAMC,OAAO,GAAA3B,OAAA,CAAA2B,OAAA,GAGhBvD,EAAE,CAACuD,OAAO;AAEd;;;;;;AAMO,MAAMC,OAAO,GAAA5B,OAAA,CAAA4B,OAAA,GAGhBxD,EAAE,CAACwD,OAAO;AAEd;;;;;;AAMO,MAAMC,MAAM,GAAA7B,OAAA,CAAA6B,MAAA,GAGfzD,EAAE,CAACyD,MAAM;AAEb;;;;;;AAMO,MAAMC,MAAM,GAAA9B,OAAA,CAAA8B,MAAA,GAKf1D,EAAE,CAAC0D,MAAM;AAEb;;;;;;AAMO,MAAMC,OAAO,GAAA/B,OAAA,CAAA+B,OAAA,GAAyD3D,EAAE,CAAC2D,OAAO;AAEvF;;;;;;;AAOO,MAAMC,SAAS,GAAAhC,OAAA,CAAAgC,SAAA,GAGlB5D,EAAE,CAAC4D,SAAS;AAEhB;;;;;;;AAOO,MAAMC,SAAS,GAAAjC,OAAA,CAAAiC,SAAA,GAKlB7D,EAAE,CAAC6D,SAAS"}

package/HashSet.js

@@ -0,0 +1,223 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.values = exports.union = exports.toggle = exports.some = exports.size = exports.remove = exports.reduce = exports.partition = exports.mutate = exports.map = exports.make = exports.isSubset = exports.isHashSet = exports.intersection = exports.has = exports.fromIterable = exports.forEach = exports.flatMap = exports.filter = exports.every = exports.endMutation = exports.empty = exports.difference = exports.beginMutation = exports.add = void 0;
+var HS = /*#__PURE__*/_interopRequireWildcard( /*#__PURE__*/require("./internal/hashSet.js"));
+function _getRequireWildcardCache(e) {
+  if ("function" != typeof WeakMap) return null;
+  var r = new WeakMap(),
+    t = new WeakMap();
+  return (_getRequireWildcardCache = function (e) {
+    return e ? t : r;
+  })(e);
+}
+function _interopRequireWildcard(e, r) {
+  if (!r && e && e.__esModule) return e;
+  if (null === e || "object" != typeof e && "function" != typeof e) return {
+    default: e
+  };
+  var t = _getRequireWildcardCache(r);
+  if (t && t.has(e)) return t.get(e);
+  var n = {
+      __proto__: null
+    },
+    a = Object.defineProperty && Object.getOwnPropertyDescriptor;
+  for (var u in e) if ("default" !== u && Object.prototype.hasOwnProperty.call(e, u)) {
+    var i = a ? Object.getOwnPropertyDescriptor(e, u) : null;
+    i && (i.get || i.set) ? Object.defineProperty(n, u, i) : n[u] = e[u];
+  }
+  return n.default = e, t && t.set(e, n), n;
+}
+/**
+ * @since 2.0.0
+ */
+
+const TypeId = HS.HashSetTypeId;
+/**
+ * @since 2.0.0
+ * @category refinements
+ */
+const isHashSet = exports.isHashSet = HS.isHashSet;
+/**
+ * Creates an empty `HashSet`.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const empty = exports.empty = HS.empty;
+/**
+ * Creates a new `HashSet` from an iterable collection of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const fromIterable = exports.fromIterable = HS.fromIterable;
+/**
+ * Construct a new `HashSet` from a variable number of values.
+ *
+ * @since 2.0.0
+ * @category constructors
+ */
+const make = exports.make = HS.make;
+/**
+ * Checks if the specified value exists in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const has = exports.has = HS.has;
+/**
+ * Check if a predicate holds true for some `HashSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const some = exports.some = HS.some;
+/**
+ * Check if a predicate holds true for every `HashSet` element.
+ *
+ * @since 2.0.0
+ * @category elements
+ */
+const every = exports.every = HS.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 = exports.isSubset = HS.isSubset;
+/**
+ * Returns an `IterableIterator` of the values in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const values = exports.values = HS.values;
+/**
+ * Calculates the number of values in the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category getters
+ */
+const size = exports.size = HS.size;
+/**
+ * Marks the `HashSet` as mutable.
+ *
+ * @since 2.0.0
+ */
+const beginMutation = exports.beginMutation = HS.beginMutation;
+/**
+ * Marks the `HashSet` as immutable.
+ *
+ * @since 2.0.0
+ */
+const endMutation = exports.endMutation = HS.endMutation;
+/**
+ * Mutates the `HashSet` within the context of the provided function.
+ *
+ * @since 2.0.0
+ */
+const mutate = exports.mutate = HS.mutate;
+/**
+ * Adds a value to the `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const add = exports.add = HS.add;
+/**
+ * Removes a value from the `HashSet`.
+ *
+ * @since 2.0.0
+ */
+const remove = exports.remove = HS.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 = exports.difference = HS.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 = exports.intersection = HS.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 = exports.union = HS.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 = exports.toggle = HS.toggle;
+/**
+ * Maps over the values of the `HashSet` using the specified function.
+ *
+ * @since 2.0.0
+ * @category mapping
+ */
+const map = exports.map = HS.map;
+/**
+ * Chains over the values of the `HashSet` using the specified function.
+ *
+ * @since 2.0.0
+ * @category sequencing
+ */
+const flatMap = exports.flatMap = HS.flatMap;
+/**
+ * Applies the specified function to the values of the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category traversing
+ */
+const forEach = exports.forEach = HS.forEach;
+/**
+ * Reduces the specified state over the values of the `HashSet`.
+ *
+ * @since 2.0.0
+ * @category folding
+ */
+const reduce = exports.reduce = HS.reduce;
+/**
+ * Filters values out of a `HashSet` using the specified predicate.
+ *
+ * @since 2.0.0
+ * @category filtering
+ */
+const filter = exports.filter = HS.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 = exports.partition = HS.partition;
+//# sourceMappingURL=HashSet.js.map

package/HashSet.js.map

@@ -0,0 +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","prototype","hasOwnProperty","call","i","set","TypeId","HashSetTypeId","isHashSet","exports","empty","fromIterable","make","some","every","isSubset","values","size","beginMutation","endMutation","mutate","add","remove","difference","intersection","union","toggle","map","flatMap","forEach","reduce","filter","partition"],"sources":["./src/HashSet.ts"],"sourcesContent":[null],"mappings":";;;;;;AAMA,IAAAA,EAAA,gBAAAC,uBAAA,eAAAC,OAAA;AAA2C,SAAAC,yBAAAC,CAAA;EAAA,yBAAAC,OAAA;EAAA,IAAAC,CAAA,OAAAD,OAAA;IAAAE,CAAA,OAAAF,OAAA;EAAA,QAAAF,wBAAA,YAAAA,CAAAC,CAAA;IAAA,OAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA;EAAA,GAAAF,CAAA;AAAA;AAAA,SAAAH,wBAAAG,CAAA,EAAAE,CAAA;EAAA,KAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA;EAAA,aAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA;IAAAK,OAAA,EAAAL;EAAA;EAAA,IAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA;EAAA,IAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA;EAAA,IAAAQ,CAAA;MAAAC,SAAA;IAAA;IAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA;EAAA,SAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA;IAAA,IAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA;IAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA;EAAA;EAAA,OAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA;AAN3C;;;;AAUA,MAAMY,MAAM,GAAkBxB,EAAE,CAACyB,aAAuB;AAgBxD;;;;AAIO,MAAMC,SAAS,GAAAC,OAAA,CAAAD,SAAA,GAGlB1B,EAAE,CAAC0B,SAAS;AAEhB;;;;;;AAMO,MAAME,KAAK,GAAAD,OAAA,CAAAC,KAAA,GAAgC5B,EAAE,CAAC4B,KAAK;AAE1D;;;;;;AAMO,MAAMC,YAAY,GAAAF,OAAA,CAAAE,YAAA,GAA6C7B,EAAE,CAAC6B,YAAY;AAErF;;;;;;AAMO,MAAMC,IAAI,GAAAH,OAAA,CAAAG,IAAA,GAA4E9B,EAAE,CAAC8B,IAAI;AAEpG;;;;;;AAMO,MAAMpB,GAAG,GAAAiB,OAAA,CAAAjB,GAAA,GAGZV,EAAE,CAACU,GAAG;AAEV;;;;;;AAMO,MAAMqB,IAAI,GAAAJ,OAAA,CAAAI,IAAA,GAGb/B,EAAE,CAAC+B,IAAI;AAEX;;;;;;AAMO,MAAMC,KAAK,GAAAL,OAAA,CAAAK,KAAA,GAKdhC,EAAE,CAACgC,KAAK;AAEZ;;;;;;;;;AASO,MAAMC,QAAQ,GAAAN,OAAA,CAAAM,QAAA,GAGjBjC,EAAE,CAACiC,QAAQ;AAEf;;;;;;AAMO,MAAMC,MAAM,GAAAP,OAAA,CAAAO,MAAA,GAAiDlC,EAAE,CAACkC,MAAM;AAE7E;;;;;;AAMO,MAAMC,IAAI,GAAAR,OAAA,CAAAQ,IAAA,GAAoCnC,EAAE,CAACmC,IAAI;AAE5D;;;;;AAKO,MAAMC,aAAa,GAAAT,OAAA,CAAAS,aAAA,GAAwCpC,EAAE,CAACoC,aAAa;AAElF;;;;;AAKO,MAAMC,WAAW,GAAAV,OAAA,CAAAU,WAAA,GAAwCrC,EAAE,CAACqC,WAAW;AAE9E;;;;;AAKO,MAAMC,MAAM,GAAAX,OAAA,CAAAW,MAAA,GAGftC,EAAE,CAACsC,MAAM;AAEb;;;;;AAKO,MAAMC,GAAG,GAAAZ,OAAA,CAAAY,GAAA,GAGZvC,EAAE,CAACuC,GAAG;AAEV;;;;;AAKO,MAAMC,MAAM,GAAAb,OAAA,CAAAa,MAAA,GAGfxC,EAAE,CAACwC,MAAM;AAEb;;;;;;;;;AASO,MAAMC,UAAU,GAAAd,OAAA,CAAAc,UAAA,GAGnBzC,EAAE,CAACyC,UAAU;AAEjB;;;;;;;;;AASO,MAAMC,YAAY,GAAAf,OAAA,CAAAe,YAAA,GAGrB1C,EAAE,CAAC0C,YAAY;AAEnB;;;;;;;;;AASO,MAAMC,KAAK,GAAAhB,OAAA,CAAAgB,KAAA,GAGd3C,EAAE,CAAC2C,KAAK;AAEZ;;;;;;;AAOO,MAAMC,MAAM,GAAAjB,OAAA,CAAAiB,MAAA,GAGf5C,EAAE,CAAC4C,MAAM;AAEb;;;;;;AAMO,MAAMC,GAAG,GAAAlB,OAAA,CAAAkB,GAAA,GAGZ7C,EAAE,CAAC6C,GAAG;AAEV;;;;;;AAMO,MAAMC,OAAO,GAAAnB,OAAA,CAAAmB,OAAA,GAGhB9C,EAAE,CAAC8C,OAAO;AAEd;;;;;;AAMO,MAAMC,OAAO,GAAApB,OAAA,CAAAoB,OAAA,GAGhB/C,EAAE,CAAC+C,OAAO;AAEd;;;;;;AAMO,MAAMC,MAAM,GAAArB,OAAA,CAAAqB,MAAA,GAGfhD,EAAE,CAACgD,MAAM;AAEb;;;;;;AAMO,MAAMC,MAAM,GAAAtB,OAAA,CAAAsB,MAAA,GAKfjD,EAAE,CAACiD,MAAM;AAEb;;;;;;;;;;AAUO,MAAMC,SAAS,GAAAvB,OAAA,CAAAuB,SAAA,GAUlBlD,EAAE,CAACkD,SAAS"}

package/Inspectable.js

@@ -0,0 +1,34 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.toJSON = exports.format = exports.NodeInspectSymbol = void 0;
+var _Predicate = /*#__PURE__*/require("./Predicate.js");
+/**
+ * @since 2.0.0
+ */
+
+/**
+ * @since 2.0.0
+ * @category symbols
+ */
+const NodeInspectSymbol = exports.NodeInspectSymbol = /*#__PURE__*/Symbol.for("nodejs.util.inspect.custom");
+/**
+ * @since 2.0.0
+ */
+const toJSON = x => {
+  if ((0, _Predicate.hasProperty)(x, "toJSON") && (0, _Predicate.isFunction)(x["toJSON"]) && x["toJSON"].length === 0) {
+    return x.toJSON();
+  } else if (Array.isArray(x)) {
+    return x.map(toJSON);
+  }
+  return x;
+};
+/**
+ * @since 2.0.0
+ */
+exports.toJSON = toJSON;
+const format = x => JSON.stringify(x, null, 2);
+exports.format = format;
+//# sourceMappingURL=Inspectable.js.map

package/Inspectable.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Inspectable.js","names":["_Predicate","require","NodeInspectSymbol","exports","Symbol","for","toJSON","x","hasProperty","isFunction","length","Array","isArray","map","format","JSON","stringify"],"sources":["./src/Inspectable.ts"],"sourcesContent":[null],"mappings":";;;;;;AAIA,IAAAA,UAAA,gBAAAC,OAAA;AAJA;;;;AAMA;;;;AAIO,MAAMC,iBAAiB,GAAAC,OAAA,CAAAD,iBAAA,gBAAGE,MAAM,CAACC,GAAG,CAAC,4BAA4B,CAAC;AAkBzE;;;AAGO,MAAMC,MAAM,GAAIC,CAAU,IAAa;EAC5C,IACE,IAAAP,UAAA,CAAAQ,WAAW,EAACD,CAAC,EAAE,QAAQ,CAAC,IAAI,IAAAP,UAAA,CAAAS,UAAU,EAACF,CAAC,CAAC,QAAQ,CAAC,CAAC,IACnDA,CAAC,CAAC,QAAQ,CAAC,CAACG,MAAM,KAAK,CAAC,EACxB;IACA,OAAOH,CAAC,CAACD,MAAM,EAAE;EACnB,CAAC,MAAM,IAAIK,KAAK,CAACC,OAAO,CAACL,CAAC,CAAC,EAAE;IAC3B,OAAOA,CAAC,CAACM,GAAG,CAACP,MAAM,CAAC;EACtB;EACA,OAAOC,CAAC;AACV,CAAC;AAED;;;AAAAJ,OAAA,CAAAG,MAAA,GAAAA,MAAA;AAGO,MAAMQ,MAAM,GAAIP,CAAU,IAAaQ,IAAI,CAACC,SAAS,CAACT,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;AAAAJ,OAAA,CAAAW,MAAA,GAAAA,MAAA"}

package/KeyedPool.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"KeyedPool.js","names":["internal","_interopRequireWildcard","require","_getRequireWildcardCache","e","WeakMap","r","t","__esModule","default","has","get","n","__proto__","a","Object","defineProperty","getOwnPropertyDescriptor","u","prototype","hasOwnProperty","call","i","set","KeyedPoolTypeId","exports","make","makeWith","makeWithTTL","makeWithTTLBy","invalidate"],"sources":["./src/KeyedPool.ts"],"sourcesContent":[null],"mappings":";;;;;;AAKA,IAAAA,QAAA,gBAAAC,uBAAA,eAAAC,OAAA;AAAmD,SAAAC,yBAAAC,CAAA;EAAA,yBAAAC,OAAA;EAAA,IAAAC,CAAA,OAAAD,OAAA;IAAAE,CAAA,OAAAF,OAAA;EAAA,QAAAF,wBAAA,YAAAA,CAAAC,CAAA;IAAA,OAAAA,CAAA,GAAAG,CAAA,GAAAD,CAAA;EAAA,GAAAF,CAAA;AAAA;AAAA,SAAAH,wBAAAG,CAAA,EAAAE,CAAA;EAAA,KAAAA,CAAA,IAAAF,CAAA,IAAAA,CAAA,CAAAI,UAAA,SAAAJ,CAAA;EAAA,aAAAA,CAAA,uBAAAA,CAAA,yBAAAA,CAAA;IAAAK,OAAA,EAAAL;EAAA;EAAA,IAAAG,CAAA,GAAAJ,wBAAA,CAAAG,CAAA;EAAA,IAAAC,CAAA,IAAAA,CAAA,CAAAG,GAAA,CAAAN,CAAA,UAAAG,CAAA,CAAAI,GAAA,CAAAP,CAAA;EAAA,IAAAQ,CAAA;MAAAC,SAAA;IAAA;IAAAC,CAAA,GAAAC,MAAA,CAAAC,cAAA,IAAAD,MAAA,CAAAE,wBAAA;EAAA,SAAAC,CAAA,IAAAd,CAAA,oBAAAc,CAAA,IAAAH,MAAA,CAAAI,SAAA,CAAAC,cAAA,CAAAC,IAAA,CAAAjB,CAAA,EAAAc,CAAA;IAAA,IAAAI,CAAA,GAAAR,CAAA,GAAAC,MAAA,CAAAE,wBAAA,CAAAb,CAAA,EAAAc,CAAA;IAAAI,CAAA,KAAAA,CAAA,CAAAX,GAAA,IAAAW,CAAA,CAAAC,GAAA,IAAAR,MAAA,CAAAC,cAAA,CAAAJ,CAAA,EAAAM,CAAA,EAAAI,CAAA,IAAAV,CAAA,CAAAM,CAAA,IAAAd,CAAA,CAAAc,CAAA;EAAA;EAAA,OAAAN,CAAA,CAAAH,OAAA,GAAAL,CAAA,EAAAG,CAAA,IAAAA,CAAA,CAAAgB,GAAA,CAAAnB,CAAA,EAAAQ,CAAA,GAAAA,CAAA;AAAA;AAKnD;;;;AAIO,MAAMY,eAAe,GAAAC,OAAA,CAAAD,eAAA,GAAkBxB,QAAQ,CAACwB,eAAe;AAiDtE;;;;;;;;;AASO,MAAME,IAAI,GAAAD,OAAA,CAAAC,IAAA,GAKgD1B,QAAQ,CAAC0B,IAAI;AAE9E;;;;;;;;;;;AAWO,MAAMC,QAAQ,GAAAF,OAAA,CAAAE,QAAA,GAK4C3B,QAAQ,CAAC2B,QAAQ;AAElF;;;;;;;;;;;;;AAaO,MAAMC,WAAW,GAAAH,OAAA,CAAAG,WAAA,GAOyC5B,QAAQ,CAAC4B,WAAW;AAErF;;;;;;;;;;;;;AAaO,MAAMC,aAAa,GAAAJ,OAAA,CAAAI,aAAA,GAOuC7B,QAAQ,CAAC6B,aAAa;AAEvF;;;;;;;;;AASO,MAAMlB,GAAG,GAAAc,OAAA,CAAAd,GAAA,GAGZX,QAAQ,CAACW,GAAG;AAEhB;;;;;;;;AAQO,MAAMmB,UAAU,GAAAL,OAAA,CAAAK,UAAA,GAGnB9B,QAAQ,CAAC8B,UAAU"}