effect 4.0.0-beta.70 → 4.0.0-beta.71

package/dist/Hash.d.ts

@@ -1,6 +1,15 @@
 /**
  * The unique identifier used to identify objects that implement the Hash interface.
  *
+ * **When to use**
+ *
+ * Use as the computed property key for the method that supplies a custom hash
+ * value on a `Hash` implementor.
+ *
+ * @see {@link Hash} for the interface implemented with this symbol
+ * @see {@link isHash} for checking whether a value implements `Hash`
+ * @see {@link hash} for computing hash values
+ *
  * @category symbols
  * @since 2.0.0
  */
@@ -8,6 +17,10 @@ export declare const symbol = "~effect/interfaces/Hash";
 /**
  * A type that represents an object that can be hashed.
  *
+ * **When to use**
+ *
+ * Use to let a custom type provide its own stable hash value.
+ *
  * **Details**
  *
  * Objects implementing this interface provide a method to compute their hash value,
@@ -39,6 +52,11 @@ export interface Hash {
 /**
  * Computes a hash value for any given value.
  *
+ * **When to use**
+ *
+ * Use to compute an Effect hash for primitives, collections, and hashable
+ * objects.
+ *
  * **Details**
  *
  * This function can hash primitives (numbers, strings, booleans, etc.) as well as
@@ -76,6 +94,10 @@ export declare const hash: <A>(self: A) => number;
 /**
  * Generates a random hash value for an object and caches it.
  *
+ * **When to use**
+ *
+ * Use to hash an object by reference identity instead of structural content.
+ *
  * **Details**
  *
  * This function creates a random hash value for objects that don't have their own
@@ -104,11 +126,15 @@ export declare const random: <A extends object>(self: A) => number;
 /**
  * Combines two hash values into a single hash value.
  *
+ * **When to use**
+ *
+ * Use to build a hash for a composite value by folding together hash values for
+ * its parts.
+ *
  * **Details**
  *
- * This function takes two hash values and combines them using a mathematical
- * operation to produce a new hash value. It's useful for creating hash values
- * of composite structures.
+ * Supports both direct and pipeable usage. The implementation combines two
+ * hash values with `(self * 53) ^ b`.
  *
  * **Example** (Combining hash values)
  *
@@ -126,6 +152,9 @@ export declare const random: <A extends object>(self: A) => number;
  * const result = pipe(hash1, Hash.combine(hash2))
  * ```
  *
+ * @see {@link hash} for computing hash values from arbitrary inputs
+ * @see {@link structureKeys} for hashing selected object fields without manual combination
+ *
  * @category hashing
  * @since 2.0.0
  */
@@ -133,11 +162,15 @@ export declare const combine: {
     /**
      * Combines two hash values into a single hash value.
      *
+     * **When to use**
+     *
+     * Use to build a hash for a composite value by folding together hash values for
+     * its parts.
+     *
      * **Details**
      *
-     * This function takes two hash values and combines them using a mathematical
-     * operation to produce a new hash value. It's useful for creating hash values
-     * of composite structures.
+     * Supports both direct and pipeable usage. The implementation combines two
+     * hash values with `(self * 53) ^ b`.
      *
      * **Example** (Combining hash values)
      *
@@ -155,6 +188,9 @@ export declare const combine: {
      * const result = pipe(hash1, Hash.combine(hash2))
      * ```
      *
+     * @see {@link hash} for computing hash values from arbitrary inputs
+     * @see {@link structureKeys} for hashing selected object fields without manual combination
+     *
      * @category hashing
      * @since 2.0.0
      */
@@ -162,11 +198,15 @@ export declare const combine: {
     /**
      * Combines two hash values into a single hash value.
      *
+     * **When to use**
+     *
+     * Use to build a hash for a composite value by folding together hash values for
+     * its parts.
+     *
      * **Details**
      *
-     * This function takes two hash values and combines them using a mathematical
-     * operation to produce a new hash value. It's useful for creating hash values
-     * of composite structures.
+     * Supports both direct and pipeable usage. The implementation combines two
+     * hash values with `(self * 53) ^ b`.
      *
      * **Example** (Combining hash values)
      *
@@ -184,6 +224,9 @@ export declare const combine: {
      * const result = pipe(hash1, Hash.combine(hash2))
      * ```
      *
+     * @see {@link hash} for computing hash values from arbitrary inputs
+     * @see {@link structureKeys} for hashing selected object fields without manual combination
+     *
      * @category hashing
      * @since 2.0.0
      */
@@ -192,6 +235,10 @@ export declare const combine: {
 /**
  * Optimizes a hash value by applying bit manipulation techniques.
  *
+ * **When to use**
+ *
+ * Use to improve the bit distribution of a raw numeric hash value.
+ *
  * **Details**
  *
  * This function takes a hash value and applies bitwise operations to improve
@@ -217,6 +264,10 @@ export declare const optimize: (n: number) => number;
 /**
  * Checks if a value implements the Hash interface.
  *
+ * **When to use**
+ *
+ * Use to detect whether an unknown value provides a custom hash implementation.
+ *
  * **Details**
  *
  * This function determines whether a given value has the Hash symbol property,
@@ -246,6 +297,10 @@ export declare const isHash: (u: unknown) => u is Hash;
 /**
  * Computes a hash value for a number.
  *
+ * **When to use**
+ *
+ * Use to hash a JavaScript number with Effect's numeric hash semantics.
+ *
  * **Details**
  *
  * This function creates a hash value for numeric inputs, handling special cases
@@ -273,6 +328,10 @@ export declare const number: (n: number) => number;
 /**
  * Computes a hash value for a string using the djb2 algorithm.
  *
+ * **When to use**
+ *
+ * Use to hash a string directly.
+ *
  * **Details**
  *
  * This function implements a variation of the djb2 hash algorithm, which is
@@ -299,6 +358,10 @@ export declare const string: (str: string) => number;
 /**
  * Computes a hash value for an object using only the specified keys.
  *
+ * **When to use**
+ *
+ * Use to hash an object by a selected set of property keys.
+ *
  * **Details**
  *
  * This function allows you to hash an object by considering only specific keys,
@@ -332,6 +395,10 @@ export declare const structureKeys: (o: object, keys: Iterable<PropertyKey>) =>
 /**
  * Computes a structural hash for an object using Effect's object key collection.
  *
+ * **When to use**
+ *
+ * Use to hash an object from all structural keys collected by Effect.
+ *
  * **Details**
  *
  * The hash is based on the object's structural keys and their values, including
@@ -359,13 +426,21 @@ export declare const structureKeys: (o: object, keys: Iterable<PropertyKey>) =>
  */
 export declare const structure: <A extends object>(o: A) => number;
 /**
- * Computes a hash value for an array by hashing all of its elements.
+ * Computes a hash value for an iterable by hashing all of its elements.
+ *
+ * **When to use**
+ *
+ * Use to hash the values yielded by an iterable with Effect hash semantics.
  *
  * **Details**
  *
- * This function creates a hash value based on all elements in the array.
- * The order of elements matters, so arrays with the same elements in different
- * orders will produce different hash values.
+ * The implementation folds element hashes from the seed `6151` with XOR and
+ * then optimizes the final hash.
+ *
+ * **Gotchas**
+ *
+ * A hash is not an equality proof. Because this implementation uses XOR,
+ * reordered inputs can produce the same hash.
  *
  * **Example** (Hashing arrays)
  *
@@ -378,13 +453,14 @@ export declare const structure: <A extends object>(o: A) => number;
  *
  * console.log(Hash.array(arr1)) // hash of [1, 2, 3]
  * console.log(Hash.array(arr2)) // same hash as arr1
- * console.log(Hash.array(arr3)) // different hash (different order)
+ * console.log(Hash.array(arr3)) // may match reordered inputs
  *
- * // Arrays with same elements in same order produce same hash
  * console.log(Hash.array(arr1) === Hash.array(arr2)) // true
- * console.log(Hash.array(arr1) === Hash.array(arr3)) // false
+ * console.log(Hash.array(arr1) === Hash.array(arr3)) // true
  * ```
  *
+ * @see {@link hash} for the general-purpose hash dispatcher
+ *
  * @category hashing
  * @since 2.0.0
  */

package/dist/Hash.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"Hash.d.ts","sourceRoot":"","sources":["../src/Hash.ts"],"names":[],"mappings":"AAaA;;;;;GAKG;AACH,eAAO,MAAM,MAAM,4BAA4B,CAAA;AAE/C;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,MAAM,WAAW,IAAI;IACnB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAA;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,eAAO,MAAM,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,MAoDlC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,eAAO,MAAM,MAAM,EAAE,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC,KAAK,MAKnD,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAAA;IACrC;;;;;;;;;;;;;;;;;;;;;;;;;;;OA2BG;IACH,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAA;CAC8B,CAAA;AAEjE;;;;;;;;;;;;;;;;;;;;;;;GAuBG;AACH,eAAO,MAAM,QAAQ,GAAI,GAAG,MAAM,KAAG,MAAqD,CAAA;AAE1F;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,eAAO,MAAM,MAAM,GAAI,GAAG,OAAO,KAAG,CAAC,IAAI,IAA8B,CAAA;AAEvE;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,eAAO,MAAM,MAAM,GAAI,GAAG,MAAM,WAkB/B,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,eAAO,MAAM,MAAM,GAAI,KAAK,MAAM,WAMjC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,eAAO,MAAM,aAAa,GAAI,GAAG,MAAM,EAAE,MAAM,QAAQ,CAAC,WAAW,CAAC,WAMnE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,SAAS,MAAM,EAAE,GAAG,CAAC,WAA0C,CAAA;AAU1F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,eAAO,MAAM,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,MAAiC,CAAA"}
+{"version":3,"file":"Hash.d.ts","sourceRoot":"","sources":["../src/Hash.ts"],"names":[],"mappings":"AAyDA;;;;;;;;;;;;;;GAcG;AACH,eAAO,MAAM,MAAM,4BAA4B,CAAA;AAE/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,WAAW,IAAI;IACnB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAA;CACnB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,eAAO,MAAM,IAAI,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,KAAK,MAoDlC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,eAAO,MAAM,MAAM,EAAE,CAAC,CAAC,SAAS,MAAM,EAAE,IAAI,EAAE,CAAC,KAAK,MAKnD,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkCG;AACH,eAAO,MAAM,OAAO,EAAE;IACpB;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACH,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,IAAI,EAAE,MAAM,KAAK,MAAM,CAAA;IACrC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAkCG;IACH,CAAC,IAAI,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM,CAAA;CAC8B,CAAA;AAEjE;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,eAAO,MAAM,QAAQ,GAAI,GAAG,MAAM,KAAG,MAAqD,CAAA;AAE1F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,eAAO,MAAM,MAAM,GAAI,GAAG,OAAO,KAAG,CAAC,IAAI,IAA8B,CAAA;AAEvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,eAAO,MAAM,MAAM,GAAI,GAAG,MAAM,WAkB/B,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,eAAO,MAAM,MAAM,GAAI,KAAK,MAAM,WAMjC,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAmCG;AACH,eAAO,MAAM,aAAa,GAAI,GAAG,MAAM,EAAE,MAAM,QAAQ,CAAC,WAAW,CAAC,WAMnE,CAAA;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,eAAO,MAAM,SAAS,GAAI,CAAC,SAAS,MAAM,EAAE,GAAG,CAAC,WAA0C,CAAA;AAU1F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAsCG;AACH,eAAO,MAAM,KAAK,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,KAAK,MAAiC,CAAA"}

package/dist/Hash.js

@@ -1,9 +1,53 @@
 /**
- * This module provides utilities for hashing values in TypeScript.
+ * The `Hash` module computes Effect hash values and defines the interface for
+ * objects that want to provide their own hash implementation. Hashes are small
+ * numeric fingerprints used by Effect data structures to bucket values quickly;
+ * they are not cryptographic digests and they are not proof that two values are
+ * equal.
+ *
+ * **Mental model**
+ *
+ * - {@link hash} dispatches by JavaScript type and handles primitives,
+ *   arrays, typed arrays, maps, sets, plain objects, dates, regular
+ *   expressions, and custom hashable objects
+ * - Objects can implement {@link Hash} by defining a method at {@link symbol}
+ * - Structural object hashes are cached, so repeated hashing of the same object
+ *   is cheap after the first computation
+ * - {@link random} gives reference-stable hash values for values that should
+ *   be hashed by identity
+ * - Lower-level helpers such as {@link combine}, {@link string},
+ *   {@link number}, {@link structure}, {@link structureKeys}, and
+ *   {@link array} are useful when implementing custom hashes
+ *
+ * **Quickstart**
+ *
+ * **Example** (Implementing a custom hash)
  *
- * Hashing is the process of converting data into a fixed-size numeric value,
- * typically used for data structures like hash tables, equality comparisons,
- * and efficient data storage.
+ * ```ts
+ * import { Hash } from "effect"
+ *
+ * class UserKey implements Hash.Hash {
+ *   constructor(
+ *     readonly id: string,
+ *     readonly region: string
+ *   ) {}
+ *
+ *   [Hash.symbol](): number {
+ *     return Hash.combine(Hash.string(this.region))(Hash.string(this.id))
+ *   }
+ * }
+ *
+ * const value = Hash.hash(new UserKey("user-1", "eu"))
+ * ```
+ *
+ * **Gotchas**
+ *
+ * - Hash collisions are possible; hash-based collections also need equality
+ *   semantics to decide whether two values are actually the same
+ * - Do not mutate an object after hashing it structurally, because the cached
+ *   hash can become stale
+ * - Use {@link random} or a custom {@link Hash} implementation for mutable
+ *   objects that should be compared by reference identity
  *
  * @since 2.0.0
  */
@@ -13,6 +57,15 @@ import { hasProperty } from "./Predicate.js";
 /**
  * The unique identifier used to identify objects that implement the Hash interface.
  *
+ * **When to use**
+ *
+ * Use as the computed property key for the method that supplies a custom hash
+ * value on a `Hash` implementor.
+ *
+ * @see {@link Hash} for the interface implemented with this symbol
+ * @see {@link isHash} for checking whether a value implements `Hash`
+ * @see {@link hash} for computing hash values
+ *
  * @category symbols
  * @since 2.0.0
  */
@@ -20,6 +73,11 @@ export const symbol = "~effect/interfaces/Hash";
 /**
  * Computes a hash value for any given value.
  *
+ * **When to use**
+ *
+ * Use to compute an Effect hash for primitives, collections, and hashable
+ * objects.
+ *
  * **Details**
  *
  * This function can hash primitives (numbers, strings, booleans, etc.) as well as
@@ -108,6 +166,10 @@ export const hash = self => {
 /**
  * Generates a random hash value for an object and caches it.
  *
+ * **When to use**
+ *
+ * Use to hash an object by reference identity instead of structural content.
+ *
  * **Details**
  *
  * This function creates a random hash value for objects that don't have their own
@@ -141,11 +203,15 @@ export const random = self => {
 /**
  * Combines two hash values into a single hash value.
  *
+ * **When to use**
+ *
+ * Use to build a hash for a composite value by folding together hash values for
+ * its parts.
+ *
  * **Details**
  *
- * This function takes two hash values and combines them using a mathematical
- * operation to produce a new hash value. It's useful for creating hash values
- * of composite structures.
+ * Supports both direct and pipeable usage. The implementation combines two
+ * hash values with `(self * 53) ^ b`.
  *
  * **Example** (Combining hash values)
  *
@@ -163,6 +229,9 @@ export const random = self => {
  * const result = pipe(hash1, Hash.combine(hash2))
  * ```
  *
+ * @see {@link hash} for computing hash values from arbitrary inputs
+ * @see {@link structureKeys} for hashing selected object fields without manual combination
+ *
  * @category hashing
  * @since 2.0.0
  */
@@ -170,6 +239,10 @@ export const combine = /*#__PURE__*/dual(2, (self, b) => self * 53 ^ b);
 /**
  * Optimizes a hash value by applying bit manipulation techniques.
  *
+ * **When to use**
+ *
+ * Use to improve the bit distribution of a raw numeric hash value.
+ *
  * **Details**
  *
  * This function takes a hash value and applies bitwise operations to improve
@@ -195,6 +268,10 @@ export const optimize = n => n & 0xbfffffff | n >>> 1 & 0x40000000;
 /**
  * Checks if a value implements the Hash interface.
  *
+ * **When to use**
+ *
+ * Use to detect whether an unknown value provides a custom hash implementation.
+ *
  * **Details**
  *
  * This function determines whether a given value has the Hash symbol property,
@@ -224,6 +301,10 @@ export const isHash = u => hasProperty(u, symbol);
 /**
  * Computes a hash value for a number.
  *
+ * **When to use**
+ *
+ * Use to hash a JavaScript number with Effect's numeric hash semantics.
+ *
  * **Details**
  *
  * This function creates a hash value for numeric inputs, handling special cases
@@ -269,6 +350,10 @@ export const number = n => {
 /**
  * Computes a hash value for a string using the djb2 algorithm.
  *
+ * **When to use**
+ *
+ * Use to hash a string directly.
+ *
  * **Details**
  *
  * This function implements a variation of the djb2 hash algorithm, which is
@@ -302,6 +387,10 @@ export const string = str => {
 /**
  * Computes a hash value for an object using only the specified keys.
  *
+ * **When to use**
+ *
+ * Use to hash an object by a selected set of property keys.
+ *
  * **Details**
  *
  * This function allows you to hash an object by considering only specific keys,
@@ -341,6 +430,10 @@ export const structureKeys = (o, keys) => {
 /**
  * Computes a structural hash for an object using Effect's object key collection.
  *
+ * **When to use**
+ *
+ * Use to hash an object from all structural keys collected by Effect.
+ *
  * **Details**
  *
  * The hash is based on the object's structural keys and their values, including
@@ -375,13 +468,21 @@ const iterableWith = (seed, f) => iter => {
   return optimize(h);
 };
 /**
- * Computes a hash value for an array by hashing all of its elements.
+ * Computes a hash value for an iterable by hashing all of its elements.
+ *
+ * **When to use**
+ *
+ * Use to hash the values yielded by an iterable with Effect hash semantics.
  *
  * **Details**
  *
- * This function creates a hash value based on all elements in the array.
- * The order of elements matters, so arrays with the same elements in different
- * orders will produce different hash values.
+ * The implementation folds element hashes from the seed `6151` with XOR and
+ * then optimizes the final hash.
+ *
+ * **Gotchas**
+ *
+ * A hash is not an equality proof. Because this implementation uses XOR,
+ * reordered inputs can produce the same hash.
  *
  * **Example** (Hashing arrays)
  *
@@ -394,13 +495,14 @@ const iterableWith = (seed, f) => iter => {
  *
  * console.log(Hash.array(arr1)) // hash of [1, 2, 3]
  * console.log(Hash.array(arr2)) // same hash as arr1
- * console.log(Hash.array(arr3)) // different hash (different order)
+ * console.log(Hash.array(arr3)) // may match reordered inputs
  *
- * // Arrays with same elements in same order produce same hash
  * console.log(Hash.array(arr1) === Hash.array(arr2)) // true
- * console.log(Hash.array(arr1) === Hash.array(arr3)) // false
+ * console.log(Hash.array(arr1) === Hash.array(arr3)) // true
  * ```
  *
+ * @see {@link hash} for the general-purpose hash dispatcher
+ *
  * @category hashing
  * @since 2.0.0
  */

package/dist/Hash.js.map

@@ -1 +1 @@
-{"version":3,"file":"Hash.js","names":["dual","byReferenceInstances","getAllObjectKeys","hasProperty","symbol","hash","self","number","string","toString","String","Date","toISOString","RegExp","has","random","hashCache","get","h","withVisitedTracking","isHash","Array","isArray","ArrayBuffer","isView","array","Map","hashMap","Set","hashSet","structure","set","Error","randomHashCache","Math","floor","Number","MAX_SAFE_INTEGER","combine","b","optimize","n","u","Infinity","str","i","length","charCodeAt","structureKeys","o","keys","key","iterableWith","seed","f","iter","element","k","v","WeakMap","visitedObjects","WeakSet","obj","fn","add","result","delete"],"sources":["../src/Hash.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;;;;AASA,SAASA,IAAI,QAAQ,eAAe;AACpC,SAASC,oBAAoB,EAAEC,gBAAgB,QAAQ,qBAAqB;AAC5E,SAASC,WAAW,QAAQ,gBAAgB;AAE5C;;;;;;AAMA,OAAO,MAAMC,MAAM,GAAG,yBAAyB;AAkC/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,OAAO,MAAMC,IAAI,GAA+BC,IAAO,IAAI;EACzD,QAAQ,OAAOA,IAAI;IACjB,KAAK,QAAQ;MACX,OAAOC,MAAM,CAACD,IAAI,CAAC;IACrB,KAAK,QAAQ;MACX,OAAOE,MAAM,CAACF,IAAI,CAACG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClC,KAAK,SAAS;MACZ,OAAOD,MAAM,CAACE,MAAM,CAACJ,IAAI,CAAC,CAAC;IAC7B,KAAK,QAAQ;MACX,OAAOE,MAAM,CAACE,MAAM,CAACJ,IAAI,CAAC,CAAC;IAC7B,KAAK,QAAQ;MACX,OAAOE,MAAM,CAACF,IAAI,CAAC;IACrB,KAAK,WAAW;MACd,OAAOE,MAAM,CAAC,WAAW,CAAC;IAC5B,KAAK,UAAU;IACf,KAAK,QAAQ;MAAE;QACb,IAAIF,IAAI,KAAK,IAAI,EAAE;UACjB,OAAOE,MAAM,CAAC,MAAM,CAAC;QACvB,CAAC,MAAM,IAAIF,IAAI,YAAYK,IAAI,EAAE;UAC/B,OAAOH,MAAM,CAACF,IAAI,CAACM,WAAW,EAAE,CAAC;QACnC,CAAC,MAAM,IAAIN,IAAI,YAAYO,MAAM,EAAE;UACjC,OAAOL,MAAM,CAACF,IAAI,CAACG,QAAQ,EAAE,CAAC;QAChC,CAAC,MAAM;UACL,IAAIR,oBAAoB,CAACa,GAAG,CAACR,IAAI,CAAC,EAAE;YAClC,OAAOS,MAAM,CAACT,IAAI,CAAC;UACrB;UACA,IAAIU,SAAS,CAACF,GAAG,CAACR,IAAI,CAAC,EAAE;YACvB,OAAOU,SAAS,CAACC,GAAG,CAACX,IAAI,CAAE;UAC7B;UACA,MAAMY,CAAC,GAAGC,mBAAmB,CAACb,IAAI,EAAE,MAAK;YACvC,IAAIc,MAAM,CAACd,IAAI,CAAC,EAAE;cAChB,OAAOA,IAAI,CAACF,MAAM,CAAC,EAAE;YACvB,CAAC,MAAM,IAAI,OAAOE,IAAI,KAAK,UAAU,EAAE;cACrC,OAAOS,MAAM,CAACT,IAAI,CAAC;YACrB,CAAC,MAAM,IAAIe,KAAK,CAACC,OAAO,CAAChB,IAAI,CAAC,IAAIiB,WAAW,CAACC,MAAM,CAAClB,IAAI,CAAC,EAAE;cAC1D,OAAOmB,KAAK,CAACnB,IAAW,CAAC;YAC3B,CAAC,MAAM,IAAIA,IAAI,YAAYoB,GAAG,EAAE;cAC9B,OAAOC,OAAO,CAACrB,IAAI,CAAC;YACtB,CAAC,MAAM,IAAIA,IAAI,YAAYsB,GAAG,EAAE;cAC9B,OAAOC,OAAO,CAACvB,IAAI,CAAC;YACtB;YACA,OAAOwB,SAAS,CAACxB,IAAI,CAAC;UACxB,CAAC,CAAC;UACFU,SAAS,CAACe,GAAG,CAACzB,IAAI,EAAEY,CAAC,CAAC;UACtB,OAAOA,CAAC;QACV;MACF;IACA;MACE,MAAM,IAAIc,KAAK,CACb,yBAAyB,OAAO1B,IAAI,yEAAyE,CAC9G;EACL;AACF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2BA,OAAO,MAAMS,MAAM,GAA2CT,IAAI,IAAI;EACpE,IAAI,CAAC2B,eAAe,CAACnB,GAAG,CAACR,IAAI,CAAC,EAAE;IAC9B2B,eAAe,CAACF,GAAG,CAACzB,IAAI,EAAEC,MAAM,CAAC2B,IAAI,CAACC,KAAK,CAACD,IAAI,CAACnB,MAAM,EAAE,GAAGqB,MAAM,CAACC,gBAAgB,CAAC,CAAC,CAAC;EACxF;EACA,OAAOJ,eAAe,CAAChB,GAAG,CAACX,IAAI,CAAE;AACnC,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,OAAO,MAAMgC,OAAO,gBA2DhBtC,IAAI,CAAC,CAAC,EAAE,CAACM,IAAY,EAAEiC,CAAS,KAAcjC,IAAI,GAAG,EAAE,GAAIiC,CAAC,CAAC;AAEjE;;;;;;;;;;;;;;;;;;;;;;;;AAwBA,OAAO,MAAMC,QAAQ,GAAIC,CAAS,IAAcA,CAAC,GAAG,UAAU,GAAMA,CAAC,KAAK,CAAC,GAAI,UAAW;AAE1F;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,OAAO,MAAMrB,MAAM,GAAIsB,CAAU,IAAgBvC,WAAW,CAACuC,CAAC,EAAEtC,MAAM,CAAC;AAEvE;;;;;;;;;;;;;;;;;;;;;;;;;;AA0BA,OAAO,MAAMG,MAAM,GAAIkC,CAAS,IAAI;EAClC,IAAIA,CAAC,KAAKA,CAAC,EAAE;IACX,OAAOjC,MAAM,CAAC,KAAK,CAAC;EACtB;EACA,IAAIiC,CAAC,KAAKE,QAAQ,EAAE;IAClB,OAAOnC,MAAM,CAAC,UAAU,CAAC;EAC3B;EACA,IAAIiC,CAAC,KAAK,CAACE,QAAQ,EAAE;IACnB,OAAOnC,MAAM,CAAC,WAAW,CAAC;EAC5B;EACA,IAAIU,CAAC,GAAGuB,CAAC,GAAG,CAAC;EACb,IAAIvB,CAAC,KAAKuB,CAAC,EAAE;IACXvB,CAAC,IAAIuB,CAAC,GAAG,UAAU;EACrB;EACA,OAAOA,CAAC,GAAG,UAAU,EAAE;IACrBvB,CAAC,IAAIuB,CAAC,IAAI,UAAU;EACtB;EACA,OAAOD,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;AAyBA,OAAO,MAAMV,MAAM,GAAIoC,GAAW,IAAI;EACpC,IAAI1B,CAAC,GAAG,IAAI;IAAE2B,CAAC,GAAGD,GAAG,CAACE,MAAM;EAC5B,OAAOD,CAAC,EAAE;IACR3B,CAAC,GAAIA,CAAC,GAAG,EAAE,GAAI0B,GAAG,CAACG,UAAU,CAAC,EAAEF,CAAC,CAAC;EACpC;EACA,OAAOL,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA,OAAO,MAAM8B,aAAa,GAAGA,CAACC,CAAS,EAAEC,IAA2B,KAAI;EACtE,IAAIhC,CAAC,GAAG,KAAK;EACb,KAAK,MAAMiC,GAAG,IAAID,IAAI,EAAE;IACtBhC,CAAC,IAAIoB,OAAO,CAACjC,IAAI,CAAC8C,GAAG,CAAC,EAAE9C,IAAI,CAAE4C,CAAS,CAACE,GAAG,CAAC,CAAC,CAAC;EAChD;EACA,OAAOX,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,OAAO,MAAMY,SAAS,GAAsBmB,CAAI,IAAKD,aAAa,CAACC,CAAC,EAAE/C,gBAAgB,CAAC+C,CAAC,CAAC,CAAC;AAE1F,MAAMG,YAAY,GAAGA,CAACC,IAAY,EAAEC,CAAsB,KAAMC,IAAmB,IAAI;EACrF,IAAIrC,CAAC,GAAGmC,IAAI;EACZ,KAAK,MAAMG,OAAO,IAAID,IAAI,EAAE;IAC1BrC,CAAC,IAAIoC,CAAC,CAACE,OAAO,CAAC;EACjB;EACA,OAAOhB,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,OAAO,MAAMO,KAAK,gBAAoC2B,YAAY,CAAC,IAAI,EAAE/C,IAAI,CAAC;AAE9E,MAAMsB,OAAO,gBAAqDyB,YAAY,cAC5E5C,MAAM,CAAC,KAAK,CAAC,EACb,CAAC,CAACiD,CAAC,EAAEC,CAAC,CAAC,KAAKpB,OAAO,CAACjC,IAAI,CAACoD,CAAC,CAAC,EAAEpD,IAAI,CAACqD,CAAC,CAAC,CAAC,CACtC;AACD,MAAM7B,OAAO,gBAAoCuB,YAAY,cAAC5C,MAAM,CAAC,KAAK,CAAC,EAAEH,IAAI,CAAC;AAElF,MAAM4B,eAAe,gBAAG,IAAI0B,OAAO,EAAe;AAClD,MAAM3C,SAAS,gBAAG,IAAI2C,OAAO,EAAe;AAC5C,MAAMC,cAAc,gBAAG,IAAIC,OAAO,EAAU;AAE5C,SAAS1C,mBAAmBA,CAAI2C,GAAW,EAAEC,EAAW;EACtD,IAAIH,cAAc,CAAC9C,GAAG,CAACgD,GAAG,CAAC,EAAE;IAC3B,OAAOtD,MAAM,CAAC,YAAY,CAAM;EAClC;EACAoD,cAAc,CAACI,GAAG,CAACF,GAAG,CAAC;EACvB,MAAMG,MAAM,GAAGF,EAAE,EAAE;EACnBH,cAAc,CAACM,MAAM,CAACJ,GAAG,CAAC;EAC1B,OAAOG,MAAM;AACf","ignoreList":[]}
+{"version":3,"file":"Hash.js","names":["dual","byReferenceInstances","getAllObjectKeys","hasProperty","symbol","hash","self","number","string","toString","String","Date","toISOString","RegExp","has","random","hashCache","get","h","withVisitedTracking","isHash","Array","isArray","ArrayBuffer","isView","array","Map","hashMap","Set","hashSet","structure","set","Error","randomHashCache","Math","floor","Number","MAX_SAFE_INTEGER","combine","b","optimize","n","u","Infinity","str","i","length","charCodeAt","structureKeys","o","keys","key","iterableWith","seed","f","iter","element","k","v","WeakMap","visitedObjects","WeakSet","obj","fn","add","result","delete"],"sources":["../src/Hash.ts"],"sourcesContent":[null],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAqDA,SAASA,IAAI,QAAQ,eAAe;AACpC,SAASC,oBAAoB,EAAEC,gBAAgB,QAAQ,qBAAqB;AAC5E,SAASC,WAAW,QAAQ,gBAAgB;AAE5C;;;;;;;;;;;;;;;AAeA,OAAO,MAAMC,MAAM,GAAG,yBAAyB;AAsC/C;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAyCA,OAAO,MAAMC,IAAI,GAA+BC,IAAO,IAAI;EACzD,QAAQ,OAAOA,IAAI;IACjB,KAAK,QAAQ;MACX,OAAOC,MAAM,CAACD,IAAI,CAAC;IACrB,KAAK,QAAQ;MACX,OAAOE,MAAM,CAACF,IAAI,CAACG,QAAQ,CAAC,EAAE,CAAC,CAAC;IAClC,KAAK,SAAS;MACZ,OAAOD,MAAM,CAACE,MAAM,CAACJ,IAAI,CAAC,CAAC;IAC7B,KAAK,QAAQ;MACX,OAAOE,MAAM,CAACE,MAAM,CAACJ,IAAI,CAAC,CAAC;IAC7B,KAAK,QAAQ;MACX,OAAOE,MAAM,CAACF,IAAI,CAAC;IACrB,KAAK,WAAW;MACd,OAAOE,MAAM,CAAC,WAAW,CAAC;IAC5B,KAAK,UAAU;IACf,KAAK,QAAQ;MAAE;QACb,IAAIF,IAAI,KAAK,IAAI,EAAE;UACjB,OAAOE,MAAM,CAAC,MAAM,CAAC;QACvB,CAAC,MAAM,IAAIF,IAAI,YAAYK,IAAI,EAAE;UAC/B,OAAOH,MAAM,CAACF,IAAI,CAACM,WAAW,EAAE,CAAC;QACnC,CAAC,MAAM,IAAIN,IAAI,YAAYO,MAAM,EAAE;UACjC,OAAOL,MAAM,CAACF,IAAI,CAACG,QAAQ,EAAE,CAAC;QAChC,CAAC,MAAM;UACL,IAAIR,oBAAoB,CAACa,GAAG,CAACR,IAAI,CAAC,EAAE;YAClC,OAAOS,MAAM,CAACT,IAAI,CAAC;UACrB;UACA,IAAIU,SAAS,CAACF,GAAG,CAACR,IAAI,CAAC,EAAE;YACvB,OAAOU,SAAS,CAACC,GAAG,CAACX,IAAI,CAAE;UAC7B;UACA,MAAMY,CAAC,GAAGC,mBAAmB,CAACb,IAAI,EAAE,MAAK;YACvC,IAAIc,MAAM,CAACd,IAAI,CAAC,EAAE;cAChB,OAAOA,IAAI,CAACF,MAAM,CAAC,EAAE;YACvB,CAAC,MAAM,IAAI,OAAOE,IAAI,KAAK,UAAU,EAAE;cACrC,OAAOS,MAAM,CAACT,IAAI,CAAC;YACrB,CAAC,MAAM,IAAIe,KAAK,CAACC,OAAO,CAAChB,IAAI,CAAC,IAAIiB,WAAW,CAACC,MAAM,CAAClB,IAAI,CAAC,EAAE;cAC1D,OAAOmB,KAAK,CAACnB,IAAW,CAAC;YAC3B,CAAC,MAAM,IAAIA,IAAI,YAAYoB,GAAG,EAAE;cAC9B,OAAOC,OAAO,CAACrB,IAAI,CAAC;YACtB,CAAC,MAAM,IAAIA,IAAI,YAAYsB,GAAG,EAAE;cAC9B,OAAOC,OAAO,CAACvB,IAAI,CAAC;YACtB;YACA,OAAOwB,SAAS,CAACxB,IAAI,CAAC;UACxB,CAAC,CAAC;UACFU,SAAS,CAACe,GAAG,CAACzB,IAAI,EAAEY,CAAC,CAAC;UACtB,OAAOA,CAAC;QACV;MACF;IACA;MACE,MAAM,IAAIc,KAAK,CACb,yBAAyB,OAAO1B,IAAI,yEAAyE,CAC9G;EACL;AACF,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA+BA,OAAO,MAAMS,MAAM,GAA2CT,IAAI,IAAI;EACpE,IAAI,CAAC2B,eAAe,CAACnB,GAAG,CAACR,IAAI,CAAC,EAAE;IAC9B2B,eAAe,CAACF,GAAG,CAACzB,IAAI,EAAEC,MAAM,CAAC2B,IAAI,CAACC,KAAK,CAACD,IAAI,CAACnB,MAAM,EAAE,GAAGqB,MAAM,CAACC,gBAAgB,CAAC,CAAC,CAAC;EACxF;EACA,OAAOJ,eAAe,CAAChB,GAAG,CAACX,IAAI,CAAE;AACnC,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmCA,OAAO,MAAMgC,OAAO,gBAyEhBtC,IAAI,CAAC,CAAC,EAAE,CAACM,IAAY,EAAEiC,CAAS,KAAcjC,IAAI,GAAG,EAAE,GAAIiC,CAAC,CAAC;AAEjE;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA4BA,OAAO,MAAMC,QAAQ,GAAIC,CAAS,IAAcA,CAAC,GAAG,UAAU,GAAMA,CAAC,KAAK,CAAC,GAAI,UAAW;AAE1F;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA,OAAO,MAAMrB,MAAM,GAAIsB,CAAU,IAAgBvC,WAAW,CAACuC,CAAC,EAAEtC,MAAM,CAAC;AAEvE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,OAAO,MAAMG,MAAM,GAAIkC,CAAS,IAAI;EAClC,IAAIA,CAAC,KAAKA,CAAC,EAAE;IACX,OAAOjC,MAAM,CAAC,KAAK,CAAC;EACtB;EACA,IAAIiC,CAAC,KAAKE,QAAQ,EAAE;IAClB,OAAOnC,MAAM,CAAC,UAAU,CAAC;EAC3B;EACA,IAAIiC,CAAC,KAAK,CAACE,QAAQ,EAAE;IACnB,OAAOnC,MAAM,CAAC,WAAW,CAAC;EAC5B;EACA,IAAIU,CAAC,GAAGuB,CAAC,GAAG,CAAC;EACb,IAAIvB,CAAC,KAAKuB,CAAC,EAAE;IACXvB,CAAC,IAAIuB,CAAC,GAAG,UAAU;EACrB;EACA,OAAOA,CAAC,GAAG,UAAU,EAAE;IACrBvB,CAAC,IAAIuB,CAAC,IAAI,UAAU;EACtB;EACA,OAAOD,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA6BA,OAAO,MAAMV,MAAM,GAAIoC,GAAW,IAAI;EACpC,IAAI1B,CAAC,GAAG,IAAI;IAAE2B,CAAC,GAAGD,GAAG,CAACE,MAAM;EAC5B,OAAOD,CAAC,EAAE;IACR3B,CAAC,GAAIA,CAAC,GAAG,EAAE,GAAI0B,GAAG,CAACG,UAAU,CAAC,EAAEF,CAAC,CAAC;EACpC;EACA,OAAOL,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAoCA,OAAO,MAAM8B,aAAa,GAAGA,CAACC,CAAS,EAAEC,IAA2B,KAAI;EACtE,IAAIhC,CAAC,GAAG,KAAK;EACb,KAAK,MAAMiC,GAAG,IAAID,IAAI,EAAE;IACtBhC,CAAC,IAAIoB,OAAO,CAACjC,IAAI,CAAC8C,GAAG,CAAC,EAAE9C,IAAI,CAAE4C,CAAS,CAACE,GAAG,CAAC,CAAC,CAAC;EAChD;EACA,OAAOX,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAgCA,OAAO,MAAMY,SAAS,GAAsBmB,CAAI,IAAKD,aAAa,CAACC,CAAC,EAAE/C,gBAAgB,CAAC+C,CAAC,CAAC,CAAC;AAE1F,MAAMG,YAAY,GAAGA,CAACC,IAAY,EAAEC,CAAsB,KAAMC,IAAmB,IAAI;EACrF,IAAIrC,CAAC,GAAGmC,IAAI;EACZ,KAAK,MAAMG,OAAO,IAAID,IAAI,EAAE;IAC1BrC,CAAC,IAAIoC,CAAC,CAACE,OAAO,CAAC;EACjB;EACA,OAAOhB,QAAQ,CAACtB,CAAC,CAAC;AACpB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAuCA,OAAO,MAAMO,KAAK,gBAAoC2B,YAAY,CAAC,IAAI,EAAE/C,IAAI,CAAC;AAE9E,MAAMsB,OAAO,gBAAqDyB,YAAY,cAC5E5C,MAAM,CAAC,KAAK,CAAC,EACb,CAAC,CAACiD,CAAC,EAAEC,CAAC,CAAC,KAAKpB,OAAO,CAACjC,IAAI,CAACoD,CAAC,CAAC,EAAEpD,IAAI,CAACqD,CAAC,CAAC,CAAC,CACtC;AACD,MAAM7B,OAAO,gBAAoCuB,YAAY,cAAC5C,MAAM,CAAC,KAAK,CAAC,EAAEH,IAAI,CAAC;AAElF,MAAM4B,eAAe,gBAAG,IAAI0B,OAAO,EAAe;AAClD,MAAM3C,SAAS,gBAAG,IAAI2C,OAAO,EAAe;AAC5C,MAAMC,cAAc,gBAAG,IAAIC,OAAO,EAAU;AAE5C,SAAS1C,mBAAmBA,CAAI2C,GAAW,EAAEC,EAAW;EACtD,IAAIH,cAAc,CAAC9C,GAAG,CAACgD,GAAG,CAAC,EAAE;IAC3B,OAAOtD,MAAM,CAAC,YAAY,CAAM;EAClC;EACAoD,cAAc,CAACI,GAAG,CAACF,GAAG,CAAC;EACvB,MAAMG,MAAM,GAAGF,EAAE,EAAE;EACnBH,cAAc,CAACM,MAAM,CAACJ,GAAG,CAAC;EAC1B,OAAOG,MAAM;AACf","ignoreList":[]}

package/dist/HashMap.d.ts

@@ -68,9 +68,9 @@
  *
  * **See also**
  *
- * - {@link HashSet} for immutable sets backed by hash semantics
+ * - `HashSet` for immutable sets backed by hash semantics
  * - {@link Equal} for structural equality
- * - {@link Hash} for hash implementations used by hashed collections
+ * - `Hash` for hash implementations used by hashed collections
  *
  * @since 2.0.0
  */

package/dist/HashMap.js

@@ -68,9 +68,9 @@
  *
  * **See also**
  *
- * - {@link HashSet} for immutable sets backed by hash semantics
+ * - `HashSet` for immutable sets backed by hash semantics
  * - {@link Equal} for structural equality
- * - {@link Hash} for hash implementations used by hashed collections
+ * - `Hash` for hash implementations used by hashed collections
  *
  * @since 2.0.0
  */