fast-equals 4.0.3 → 5.0.0-beta.0

package/dist/fast-equals.js

@@ -1,438 +0,0 @@
-(function (global, factory) {
-  typeof exports === 'object' && typeof module !== 'undefined' ? factory(exports) :
-  typeof define === 'function' && define.amd ? define(['exports'], factory) :
-  (global = typeof globalThis !== 'undefined' ? globalThis : global || self, factory(global["fast-equals"] = {}));
-})(this, (function (exports) { 'use strict';
-
-  /**
-   * Default equality comparator pass-through, used as the standard `isEqual` creator for
-   * use inside the built comparator.
-   */
-  function createDefaultIsNestedEqual(comparator) {
-      return function isEqual(a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, meta) {
-          return comparator(a, b, meta);
-      };
-  }
-  /**
-   * Wrap the provided `areItemsEqual` method to manage the circular cache, allowing
-   * for circular references to be safely included in the comparison without creating
-   * stack overflows.
-   */
-  function createIsCircular(areItemsEqual) {
-      return function isCircular(a, b, isEqual, cache) {
-          if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {
-              return areItemsEqual(a, b, isEqual, cache);
-          }
-          var cachedA = cache.get(a);
-          var cachedB = cache.get(b);
-          if (cachedA && cachedB) {
-              return cachedA === b && cachedB === a;
-          }
-          cache.set(a, b);
-          cache.set(b, a);
-          var result = areItemsEqual(a, b, isEqual, cache);
-          cache.delete(a);
-          cache.delete(b);
-          return result;
-      };
-  }
-  /**
-   * Targeted shallow merge of two objects.
-   *
-   * @NOTE
-   * This exists as a tinier compiled version of the `__assign` helper that
-   * `tsc` injects in case of `Object.assign` not being present.
-   */
-  function merge(a, b) {
-      var merged = {};
-      for (var key in a) {
-          merged[key] = a[key];
-      }
-      for (var key in b) {
-          merged[key] = b[key];
-      }
-      return merged;
-  }
-  /**
-   * Whether the value is a plain object.
-   *
-   * @NOTE
-   * This is a same-realm compariosn only.
-   */
-  function isPlainObject(value) {
-      return value.constructor === Object || value.constructor == null;
-  }
-  /**
-   * When the value is `Promise`-like, aka "then-able".
-   */
-  function isPromiseLike(value) {
-      return typeof value.then === 'function';
-  }
-  /**
-   * Whether the values passed are strictly equal or both NaN.
-   */
-  function sameValueZeroEqual(a, b) {
-      return a === b || (a !== a && b !== b);
-  }
-
-  var ARGUMENTS_TAG = '[object Arguments]';
-  var BOOLEAN_TAG = '[object Boolean]';
-  var DATE_TAG = '[object Date]';
-  var REG_EXP_TAG = '[object RegExp]';
-  var MAP_TAG = '[object Map]';
-  var NUMBER_TAG = '[object Number]';
-  var OBJECT_TAG = '[object Object]';
-  var SET_TAG = '[object Set]';
-  var STRING_TAG = '[object String]';
-  var toString = Object.prototype.toString;
-  function createComparator(_a) {
-      var areArraysEqual = _a.areArraysEqual, areDatesEqual = _a.areDatesEqual, areMapsEqual = _a.areMapsEqual, areObjectsEqual = _a.areObjectsEqual, areRegExpsEqual = _a.areRegExpsEqual, areSetsEqual = _a.areSetsEqual, createIsNestedEqual = _a.createIsNestedEqual;
-      var isEqual = createIsNestedEqual(comparator);
-      /**
-       * compare the value of the two objects and return true if they are equivalent in values
-       */
-      function comparator(a, b, meta) {
-          // If the items are strictly equal, no need to do a value comparison.
-          if (a === b) {
-              return true;
-          }
-          // If the items are not non-nullish objects, then the only possibility
-          // of them being equal but not strictly is if they are both `NaN`. Since
-          // `NaN` is uniquely not equal to itself, we can use self-comparison of
-          // both objects, which is faster than `isNaN()`.
-          if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {
-              return a !== a && b !== b;
-          }
-          // Checks are listed in order of commonality of use-case:
-          //   1. Common complex object types (plain object, array)
-          //   2. Common data values (date, regexp)
-          //   3. Less-common complex object types (map, set)
-          //   4. Less-common data values (promise, primitive wrappers)
-          // Inherently this is both subjective and assumptive, however
-          // when reviewing comparable libraries in the wild this order
-          // appears to be generally consistent.
-          // `isPlainObject` only checks against the object's own realm. Cross-realm
-          // comparisons are rare, and will be handled in the ultimate fallback, so
-          // we can avoid the `toString.call()` cost unless necessary.
-          if (isPlainObject(a) && isPlainObject(b)) {
-              return areObjectsEqual(a, b, isEqual, meta);
-          }
-          // `isArray()` works on subclasses and is cross-realm, so we can again avoid
-          // the `toString.call()` cost unless necessary by just checking if either
-          // and then both are arrays.
-          var aArray = Array.isArray(a);
-          var bArray = Array.isArray(b);
-          if (aArray || bArray) {
-              return aArray === bArray && areArraysEqual(a, b, isEqual, meta);
-          }
-          // Since this is a custom object, use the classic `toString.call()` to get its
-          // type. This is reasonably performant in modern environments like v8 and
-          // SpiderMonkey, and allows for cross-realm comparison when other checks like
-          // `instanceof` do not.
-          var aTag = toString.call(a);
-          if (aTag !== toString.call(b)) {
-              return false;
-          }
-          if (aTag === DATE_TAG) {
-              // `getTime()` showed better results compared to alternatives like `valueOf()`
-              // or the unary `+` operator.
-              return areDatesEqual(a, b, isEqual, meta);
-          }
-          if (aTag === REG_EXP_TAG) {
-              return areRegExpsEqual(a, b, isEqual, meta);
-          }
-          if (aTag === MAP_TAG) {
-              return areMapsEqual(a, b, isEqual, meta);
-          }
-          if (aTag === SET_TAG) {
-              return areSetsEqual(a, b, isEqual, meta);
-          }
-          // If a simple object tag, then we can prioritize a simple object comparison because
-          // it is likely a custom class. If an arguments tag, it should be treated as a standard
-          // object.
-          if (aTag === OBJECT_TAG || aTag === ARGUMENTS_TAG) {
-              // The exception for value comparison is `Promise`-like contracts. These should be
-              // treated the same as standard `Promise` objects, which means strict equality.
-              return isPromiseLike(a) || isPromiseLike(b)
-                  ? false
-                  : areObjectsEqual(a, b, isEqual, meta);
-          }
-          // As the penultimate fallback, check if the values passed are primitive wrappers. This
-          // is very rare in modern JS, which is why it is deprioritized compared to all other object
-          // types.
-          if (aTag === BOOLEAN_TAG || aTag === NUMBER_TAG || aTag === STRING_TAG) {
-              return sameValueZeroEqual(a.valueOf(), b.valueOf());
-          }
-          // If not matching any tags that require a specific type of comparison, then we hard-code false because
-          // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:
-          //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only
-          //     comparison that can be made.
-          //   - For types that can be introspected, but rarely have requirements to be compared
-          //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common
-          //     use-cases (may be included in a future release, if requested enough).
-          //   - For types that can be introspected but do not have an objective definition of what
-          //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.
-          // In all cases, these decisions should be reevaluated based on changes to the language and
-          // common development practices.
-          return false;
-      }
-      return comparator;
-  }
-
-  /**
-   * Whether the arrays are equal in value.
-   */
-  function areArraysEqual(a, b, isEqual, meta) {
-      var index = a.length;
-      if (b.length !== index) {
-          return false;
-      }
-      // Decrementing `while` showed faster results than either incrementing or
-      // decrementing `for` loop and than an incrementing `while` loop. Declarative
-      // methods like `some` / `every` were not used to avoid incurring the garbage
-      // cost of anonymous callbacks.
-      while (index-- > 0) {
-          if (!isEqual(a[index], b[index], index, index, a, b, meta)) {
-              return false;
-          }
-      }
-      return true;
-  }
-  /**
-   * Whether the arrays are equal in value, including circular references.
-   */
-  var areArraysEqualCircular = createIsCircular(areArraysEqual);
-
-  /**
-   * Whether the dates passed are equal in value.
-   *
-   * @NOTE
-   * This is a standalone function instead of done inline in the comparator
-   * to allow for overrides.
-   */
-  function areDatesEqual(a, b) {
-      return sameValueZeroEqual(a.valueOf(), b.valueOf());
-  }
-
-  /**
-   * Whether the `Map`s are equal in value.
-   */
-  function areMapsEqual(a, b, isEqual, meta) {
-      var isValueEqual = a.size === b.size;
-      if (!isValueEqual) {
-          return false;
-      }
-      if (!a.size) {
-          return true;
-      }
-      // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and
-      // the inability to control the performance of the resulting code. It also avoids excessive
-      // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,
-      // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the
-      // equality checks themselves.
-      var matchedIndices = {};
-      var indexA = 0;
-      a.forEach(function (aValue, aKey) {
-          if (!isValueEqual) {
-              return;
-          }
-          var hasMatch = false;
-          var matchIndexB = 0;
-          b.forEach(function (bValue, bKey) {
-              if (!hasMatch &&
-                  !matchedIndices[matchIndexB] &&
-                  (hasMatch =
-                      isEqual(aKey, bKey, indexA, matchIndexB, a, b, meta) &&
-                          isEqual(aValue, bValue, aKey, bKey, a, b, meta))) {
-                  matchedIndices[matchIndexB] = true;
-              }
-              matchIndexB++;
-          });
-          indexA++;
-          isValueEqual = hasMatch;
-      });
-      return isValueEqual;
-  }
-  /**
-   * Whether the `Map`s are equal in value, including circular references.
-   */
-  var areMapsEqualCircular = createIsCircular(areMapsEqual);
-
-  var OWNER = '_owner';
-  var hasOwnProperty = Object.prototype.hasOwnProperty;
-  /**
-   * Whether the objects are equal in value.
-   */
-  function areObjectsEqual(a, b, isEqual, meta) {
-      var keysA = Object.keys(a);
-      var index = keysA.length;
-      if (Object.keys(b).length !== index) {
-          return false;
-      }
-      var key;
-      // Decrementing `while` showed faster results than either incrementing or
-      // decrementing `for` loop and than an incrementing `while` loop. Declarative
-      // methods like `some` / `every` were not used to avoid incurring the garbage
-      // cost of anonymous callbacks.
-      while (index-- > 0) {
-          key = keysA[index];
-          if (key === OWNER) {
-              var reactElementA = !!a.$$typeof;
-              var reactElementB = !!b.$$typeof;
-              if ((reactElementA || reactElementB) && reactElementA !== reactElementB) {
-                  return false;
-              }
-          }
-          if (!hasOwnProperty.call(b, key) ||
-              !isEqual(a[key], b[key], key, key, a, b, meta)) {
-              return false;
-          }
-      }
-      return true;
-  }
-  /**
-   * Whether the objects are equal in value, including circular references.
-   */
-  var areObjectsEqualCircular = createIsCircular(areObjectsEqual);
-
-  /**
-   * Whether the regexps passed are equal in value.
-   *
-   * @NOTE
-   * This is a standalone function instead of done inline in the comparator
-   * to allow for overrides. An example of this would be supporting a
-   * pre-ES2015 environment where the `flags` property is not available.
-   */
-  function areRegExpsEqual(a, b) {
-      return a.source === b.source && a.flags === b.flags;
-  }
-
-  /**
-   * Whether the `Set`s are equal in value.
-   */
-  function areSetsEqual(a, b, isEqual, meta) {
-      var isValueEqual = a.size === b.size;
-      if (!isValueEqual) {
-          return false;
-      }
-      if (!a.size) {
-          return true;
-      }
-      // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and
-      // the inability to control the performance of the resulting code. It also avoids excessive
-      // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,
-      // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the
-      // equality checks themselves.
-      var matchedIndices = {};
-      a.forEach(function (aValue, aKey) {
-          if (!isValueEqual) {
-              return;
-          }
-          var hasMatch = false;
-          var matchIndex = 0;
-          b.forEach(function (bValue, bKey) {
-              if (!hasMatch &&
-                  !matchedIndices[matchIndex] &&
-                  (hasMatch = isEqual(aValue, bValue, aKey, bKey, a, b, meta))) {
-                  matchedIndices[matchIndex] = true;
-              }
-              matchIndex++;
-          });
-          isValueEqual = hasMatch;
-      });
-      return isValueEqual;
-  }
-  /**
-   * Whether the `Set`s are equal in value, including circular references.
-   */
-  var areSetsEqualCircular = createIsCircular(areSetsEqual);
-
-  var DEFAULT_CONFIG = Object.freeze({
-      areArraysEqual: areArraysEqual,
-      areDatesEqual: areDatesEqual,
-      areMapsEqual: areMapsEqual,
-      areObjectsEqual: areObjectsEqual,
-      areRegExpsEqual: areRegExpsEqual,
-      areSetsEqual: areSetsEqual,
-      createIsNestedEqual: createDefaultIsNestedEqual,
-  });
-  var DEFAULT_CIRCULAR_CONFIG = Object.freeze({
-      areArraysEqual: areArraysEqualCircular,
-      areDatesEqual: areDatesEqual,
-      areMapsEqual: areMapsEqualCircular,
-      areObjectsEqual: areObjectsEqualCircular,
-      areRegExpsEqual: areRegExpsEqual,
-      areSetsEqual: areSetsEqualCircular,
-      createIsNestedEqual: createDefaultIsNestedEqual,
-  });
-  var isDeepEqual = createComparator(DEFAULT_CONFIG);
-  /**
-   * Whether the items passed are deeply-equal in value.
-   */
-  function deepEqual(a, b) {
-      return isDeepEqual(a, b, undefined);
-  }
-  var isShallowEqual = createComparator(merge(DEFAULT_CONFIG, { createIsNestedEqual: function () { return sameValueZeroEqual; } }));
-  /**
-   * Whether the items passed are shallowly-equal in value.
-   */
-  function shallowEqual(a, b) {
-      return isShallowEqual(a, b, undefined);
-  }
-  var isCircularDeepEqual = createComparator(DEFAULT_CIRCULAR_CONFIG);
-  /**
-   * Whether the items passed are deeply-equal in value, including circular references.
-   */
-  function circularDeepEqual(a, b) {
-      return isCircularDeepEqual(a, b, new WeakMap());
-  }
-  var isCircularShallowEqual = createComparator(merge(DEFAULT_CIRCULAR_CONFIG, {
-      createIsNestedEqual: function () { return sameValueZeroEqual; },
-  }));
-  /**
-   * Whether the items passed are shallowly-equal in value, including circular references.
-   */
-  function circularShallowEqual(a, b) {
-      return isCircularShallowEqual(a, b, new WeakMap());
-  }
-  /**
-   * Create a custom equality comparison method.
-   *
-   * This can be done to create very targeted comparisons in extreme hot-path scenarios
-   * where the standard methods are not performant enough, but can also be used to provide
-   * support for legacy environments that do not support expected features like
-   * `RegExp.prototype.flags` out of the box.
-   */
-  function createCustomEqual(getComparatorOptions) {
-      return createComparator(merge(DEFAULT_CONFIG, getComparatorOptions(DEFAULT_CONFIG)));
-  }
-  /**
-   * Create a custom equality comparison method that handles circular references. This is very
-   * similar to `createCustomEqual`, with the only difference being that `meta` expects to be
-   * populated with a `WeakMap`-like contract.
-   *
-   * This can be done to create very targeted comparisons in extreme hot-path scenarios
-   * where the standard methods are not performant enough, but can also be used to provide
-   * support for legacy environments that do not support expected features like
-   * `WeakMap` out of the box.
-   */
-  function createCustomCircularEqual(getComparatorOptions) {
-      var comparator = createComparator(merge(DEFAULT_CIRCULAR_CONFIG, getComparatorOptions(DEFAULT_CIRCULAR_CONFIG)));
-      return (function (a, b, meta) {
-          if (meta === void 0) { meta = new WeakMap(); }
-          return comparator(a, b, meta);
-      });
-  }
-
-  exports.circularDeepEqual = circularDeepEqual;
-  exports.circularShallowEqual = circularShallowEqual;
-  exports.createCustomCircularEqual = createCustomCircularEqual;
-  exports.createCustomEqual = createCustomEqual;
-  exports.deepEqual = deepEqual;
-  exports.sameValueZeroEqual = sameValueZeroEqual;
-  exports.shallowEqual = shallowEqual;
-
-  Object.defineProperty(exports, '__esModule', { value: true });
-
-}));
-//# sourceMappingURL=fast-equals.js.map

package/dist/fast-equals.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"fast-equals.js","sources":["../src/utils.ts","../src/comparator.ts","../src/arrays.ts","../src/dates.ts","../src/maps.ts","../src/objects.ts","../src/regexps.ts","../src/sets.ts","../src/index.ts"],"sourcesContent":["import {\n  EqualityComparator,\n  InternalEqualityComparator,\n  TypeEqualityComparator,\n} from '../index.d';\n\n/**\n * Default equality comparator pass-through, used as the standard `isEqual` creator for\n * use inside the built comparator.\n */\nexport function createDefaultIsNestedEqual<Meta>(\n  comparator: EqualityComparator<Meta>,\n): InternalEqualityComparator<Meta> {\n  return function isEqual<A, B>(\n    a: A,\n    b: B,\n    _indexOrKeyA: any,\n    _indexOrKeyB: any,\n    _parentA: any,\n    _parentB: any,\n    meta: Meta,\n  ) {\n    return comparator(a, b, meta);\n  };\n}\n\n/**\n * Wrap the provided `areItemsEqual` method to manage the circular cache, allowing\n * for circular references to be safely included in the comparison without creating\n * stack overflows.\n */\nexport function createIsCircular<\n  AreItemsEqual extends TypeEqualityComparator<any, any>,\n>(areItemsEqual: AreItemsEqual): AreItemsEqual {\n  return function isCircular(\n    a: any,\n    b: any,\n    isEqual: InternalEqualityComparator<WeakMap<any, any>>,\n    cache: WeakMap<any, any>,\n  ) {\n    if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\n      return areItemsEqual(a, b, isEqual, cache);\n    }\n\n    const cachedA = cache.get(a);\n    const cachedB = cache.get(b);\n\n    if (cachedA && cachedB) {\n      return cachedA === b && cachedB === a;\n    }\n\n    cache.set(a, b);\n    cache.set(b, a);\n\n    const result = areItemsEqual(a, b, isEqual, cache);\n\n    cache.delete(a);\n    cache.delete(b);\n\n    return result;\n  } as AreItemsEqual;\n}\n\n/**\n * Targeted shallow merge of two objects.\n *\n * @NOTE\n * This exists as a tinier compiled version of the `__assign` helper that\n * `tsc` injects in case of `Object.assign` not being present.\n */\nexport function merge<A extends object, B extends object>(a: A, b: B): A & B {\n  const merged: Record<string, any> = {};\n\n  for (const key in a) {\n    merged[key] = a[key];\n  }\n\n  for (const key in b) {\n    merged[key] = b[key];\n  }\n\n  return merged as A & B;\n}\n\n/**\n * Whether the value is a plain object.\n *\n * @NOTE\n * This is a same-realm compariosn only.\n */\nexport function isPlainObject(value: any): boolean {\n  return value.constructor === Object || value.constructor == null;\n}\n\n/**\n * When the value is `Promise`-like, aka \"then-able\".\n */\nexport function isPromiseLike(value: any): boolean {\n  return typeof value.then === 'function';\n}\n\n/**\n * Whether the values passed are strictly equal or both NaN.\n */\nexport function sameValueZeroEqual(a: any, b: any): boolean {\n  return a === b || (a !== a && b !== b);\n}\n","import { isPlainObject, isPromiseLike, sameValueZeroEqual } from './utils';\n\nimport type {\n  CreateComparatorCreatorOptions,\n  EqualityComparator,\n} from '../index.d';\n\nconst ARGUMENTS_TAG = '[object Arguments]';\nconst BOOLEAN_TAG = '[object Boolean]';\nconst DATE_TAG = '[object Date]';\nconst REG_EXP_TAG = '[object RegExp]';\nconst MAP_TAG = '[object Map]';\nconst NUMBER_TAG = '[object Number]';\nconst OBJECT_TAG = '[object Object]';\nconst SET_TAG = '[object Set]';\nconst STRING_TAG = '[object String]';\n\nconst { toString } = Object.prototype;\n\nexport function createComparator<Meta>({\n  areArraysEqual,\n  areDatesEqual,\n  areMapsEqual,\n  areObjectsEqual,\n  areRegExpsEqual,\n  areSetsEqual,\n  createIsNestedEqual,\n}: CreateComparatorCreatorOptions<Meta>): EqualityComparator<Meta> {\n  const isEqual = createIsNestedEqual(comparator as EqualityComparator<Meta>);\n\n  /**\n   * compare the value of the two objects and return true if they are equivalent in values\n   */\n  function comparator(a: any, b: any, meta: Meta): boolean {\n    // If the items are strictly equal, no need to do a value comparison.\n    if (a === b) {\n      return true;\n    }\n\n    // If the items are not non-nullish objects, then the only possibility\n    // of them being equal but not strictly is if they are both `NaN`. Since\n    // `NaN` is uniquely not equal to itself, we can use self-comparison of\n    // both objects, which is faster than `isNaN()`.\n    if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\n      return a !== a && b !== b;\n    }\n\n    // Checks are listed in order of commonality of use-case:\n    //   1. Common complex object types (plain object, array)\n    //   2. Common data values (date, regexp)\n    //   3. Less-common complex object types (map, set)\n    //   4. Less-common data values (promise, primitive wrappers)\n    // Inherently this is both subjective and assumptive, however\n    // when reviewing comparable libraries in the wild this order\n    // appears to be generally consistent.\n\n    // `isPlainObject` only checks against the object's own realm. Cross-realm\n    // comparisons are rare, and will be handled in the ultimate fallback, so\n    // we can avoid the `toString.call()` cost unless necessary.\n    if (isPlainObject(a) && isPlainObject(b)) {\n      return areObjectsEqual(a, b, isEqual, meta);\n    }\n\n    // `isArray()` works on subclasses and is cross-realm, so we can again avoid\n    // the `toString.call()` cost unless necessary by just checking if either\n    // and then both are arrays.\n    const aArray = Array.isArray(a);\n    const bArray = Array.isArray(b);\n\n    if (aArray || bArray) {\n      return aArray === bArray && areArraysEqual(a, b, isEqual, meta);\n    }\n\n    // Since this is a custom object, use the classic `toString.call()` to get its\n    // type. This is reasonably performant in modern environments like v8 and\n    // SpiderMonkey, and allows for cross-realm comparison when other checks like\n    // `instanceof` do not.\n    const aTag = toString.call(a);\n\n    if (aTag !== toString.call(b)) {\n      return false;\n    }\n\n    if (aTag === DATE_TAG) {\n      // `getTime()` showed better results compared to alternatives like `valueOf()`\n      // or the unary `+` operator.\n      return areDatesEqual(a, b, isEqual, meta);\n    }\n\n    if (aTag === REG_EXP_TAG) {\n      return areRegExpsEqual(a, b, isEqual, meta);\n    }\n\n    if (aTag === MAP_TAG) {\n      return areMapsEqual(a, b, isEqual, meta);\n    }\n\n    if (aTag === SET_TAG) {\n      return areSetsEqual(a, b, isEqual, meta);\n    }\n\n    // If a simple object tag, then we can prioritize a simple object comparison because\n    // it is likely a custom class. If an arguments tag, it should be treated as a standard\n    // object.\n    if (aTag === OBJECT_TAG || aTag === ARGUMENTS_TAG) {\n      // The exception for value comparison is `Promise`-like contracts. These should be\n      // treated the same as standard `Promise` objects, which means strict equality.\n      return isPromiseLike(a) || isPromiseLike(b)\n        ? false\n        : areObjectsEqual(a, b, isEqual, meta);\n    }\n\n    // As the penultimate fallback, check if the values passed are primitive wrappers. This\n    // is very rare in modern JS, which is why it is deprioritized compared to all other object\n    // types.\n    if (aTag === BOOLEAN_TAG || aTag === NUMBER_TAG || aTag === STRING_TAG) {\n      return sameValueZeroEqual(a.valueOf(), b.valueOf());\n    }\n\n    // If not matching any tags that require a specific type of comparison, then we hard-code false because\n    // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\n    //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\n    //     comparison that can be made.\n    //   - For types that can be introspected, but rarely have requirements to be compared\n    //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\n    //     use-cases (may be included in a future release, if requested enough).\n    //   - For types that can be introspected but do not have an objective definition of what\n    //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\n    // In all cases, these decisions should be reevaluated based on changes to the language and\n    // common development practices.\n    return false;\n  }\n\n  return comparator as EqualityComparator<Meta>;\n}\n","import { createIsCircular } from './utils';\n\nimport type { InternalEqualityComparator } from '../index.d';\n\n/**\n * Whether the arrays are equal in value.\n */\nexport function areArraysEqual(\n  a: any[],\n  b: any[],\n  isEqual: InternalEqualityComparator<any>,\n  meta: any,\n): boolean {\n  let index = a.length;\n\n  if (b.length !== index) {\n    return false;\n  }\n\n  // Decrementing `while` showed faster results than either incrementing or\n  // decrementing `for` loop and than an incrementing `while` loop. Declarative\n  // methods like `some` / `every` were not used to avoid incurring the garbage\n  // cost of anonymous callbacks.\n  while (index-- > 0) {\n    if (!isEqual(a[index], b[index], index, index, a, b, meta)) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Whether the arrays are equal in value, including circular references.\n */\nexport const areArraysEqualCircular = createIsCircular(areArraysEqual);\n","import { sameValueZeroEqual } from './utils';\n\n/**\n * Whether the dates passed are equal in value.\n *\n * @NOTE\n * This is a standalone function instead of done inline in the comparator\n * to allow for overrides.\n */\nexport function areDatesEqual(a: Date, b: Date): boolean {\n  return sameValueZeroEqual(a.valueOf(), b.valueOf());\n}\n","import { createIsCircular } from './utils';\n\nimport type { InternalEqualityComparator } from '../index.d';\n\n/**\n * Whether the `Map`s are equal in value.\n */\nexport function areMapsEqual(\n  a: Map<any, any>,\n  b: Map<any, any>,\n  isEqual: InternalEqualityComparator<any>,\n  meta: any,\n): boolean {\n  let isValueEqual = a.size === b.size;\n\n  if (!isValueEqual) {\n    return false;\n  }\n\n  if (!a.size) {\n    return true;\n  }\n\n  // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and\n  // the inability to control the performance of the resulting code. It also avoids excessive\n  // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,\n  // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the\n  // equality checks themselves.\n\n  const matchedIndices: Record<number, true> = {};\n\n  let indexA = 0;\n\n  a.forEach((aValue, aKey) => {\n    if (!isValueEqual) {\n      return;\n    }\n\n    let hasMatch = false;\n    let matchIndexB = 0;\n\n    b.forEach((bValue, bKey) => {\n      if (\n        !hasMatch &&\n        !matchedIndices[matchIndexB] &&\n        (hasMatch =\n          isEqual(aKey, bKey, indexA, matchIndexB, a, b, meta) &&\n          isEqual(aValue, bValue, aKey, bKey, a, b, meta))\n      ) {\n        matchedIndices[matchIndexB] = true;\n      }\n\n      matchIndexB++;\n    });\n\n    indexA++;\n    isValueEqual = hasMatch;\n  });\n\n  return isValueEqual;\n}\n\n/**\n * Whether the `Map`s are equal in value, including circular references.\n */\nexport const areMapsEqualCircular = createIsCircular(areMapsEqual);\n","import { createIsCircular } from './utils';\n\nimport type { InternalEqualityComparator } from '../index.d';\n\ninterface Dictionary<Value> {\n  [key: string]: Value;\n  $$typeof?: any;\n}\n\nconst OWNER = '_owner';\nconst { hasOwnProperty } = Object.prototype;\n\n/**\n * Whether the objects are equal in value.\n */\nexport function areObjectsEqual(\n  a: Dictionary<any>,\n  b: Dictionary<any>,\n  isEqual: InternalEqualityComparator<any>,\n  meta: any,\n): boolean {\n  const keysA = Object.keys(a);\n\n  let index = keysA.length;\n\n  if (Object.keys(b).length !== index) {\n    return false;\n  }\n\n  let key: string;\n\n  // Decrementing `while` showed faster results than either incrementing or\n  // decrementing `for` loop and than an incrementing `while` loop. Declarative\n  // methods like `some` / `every` were not used to avoid incurring the garbage\n  // cost of anonymous callbacks.\n  while (index-- > 0) {\n    key = keysA[index];\n\n    if (key === OWNER) {\n      const reactElementA = !!a.$$typeof;\n      const reactElementB = !!b.$$typeof;\n\n      if ((reactElementA || reactElementB) && reactElementA !== reactElementB) {\n        return false;\n      }\n    }\n\n    if (\n      !hasOwnProperty.call(b, key) ||\n      !isEqual(a[key], b[key], key, key, a, b, meta)\n    ) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\n/**\n * Whether the objects are equal in value, including circular references.\n */\nexport const areObjectsEqualCircular = createIsCircular(areObjectsEqual);\n","/**\n * Whether the regexps passed are equal in value.\n *\n * @NOTE\n * This is a standalone function instead of done inline in the comparator\n * to allow for overrides. An example of this would be supporting a\n * pre-ES2015 environment where the `flags` property is not available.\n */\nexport function areRegExpsEqual(a: RegExp, b: RegExp): boolean {\n  return a.source === b.source && a.flags === b.flags;\n}\n","import { createIsCircular } from './utils';\n\nimport type { InternalEqualityComparator } from '../index.d';\n\n/**\n * Whether the `Set`s are equal in value.\n */\nexport function areSetsEqual(\n  a: Set<any>,\n  b: Set<any>,\n  isEqual: InternalEqualityComparator<any>,\n  meta: any,\n): boolean {\n  let isValueEqual = a.size === b.size;\n\n  if (!isValueEqual) {\n    return false;\n  }\n\n  if (!a.size) {\n    return true;\n  }\n\n  // The use of `forEach()` is to avoid the transpilation cost of `for...of` comparisons, and\n  // the inability to control the performance of the resulting code. It also avoids excessive\n  // iteration compared to doing comparisons of `keys()` and `values()`. As a result, though,\n  // we cannot short-circuit the iterations; bookkeeping must be done to short-circuit the\n  // equality checks themselves.\n\n  const matchedIndices: Record<number, true> = {};\n\n  a.forEach((aValue, aKey) => {\n    if (!isValueEqual) {\n      return;\n    }\n\n    let hasMatch = false;\n    let matchIndex = 0;\n\n    b.forEach((bValue, bKey) => {\n      if (\n        !hasMatch &&\n        !matchedIndices[matchIndex] &&\n        (hasMatch = isEqual(aValue, bValue, aKey, bKey, a, b, meta))\n      ) {\n        matchedIndices[matchIndex] = true;\n      }\n\n      matchIndex++;\n    });\n\n    isValueEqual = hasMatch;\n  });\n\n  return isValueEqual;\n}\n\n/**\n * Whether the `Set`s are equal in value, including circular references.\n */\nexport const areSetsEqualCircular = createIsCircular(areSetsEqual);\n","import { createComparator } from './comparator';\nimport { areArraysEqual, areArraysEqualCircular } from './arrays';\nimport { areDatesEqual } from './dates';\nimport { areMapsEqual, areMapsEqualCircular } from './maps';\nimport { areObjectsEqual, areObjectsEqualCircular } from './objects';\nimport { areRegExpsEqual } from './regexps';\nimport { areSetsEqual, areSetsEqualCircular } from './sets';\nimport { createDefaultIsNestedEqual, merge, sameValueZeroEqual } from './utils';\n\nimport type {\n  BaseCircularMeta,\n  CreateComparatorCreatorOptions,\n  EqualityComparator,\n  GetComparatorOptions,\n} from '../index.d';\n\nexport { sameValueZeroEqual };\n\nconst DEFAULT_CONFIG: CreateComparatorCreatorOptions<undefined> = Object.freeze(\n  {\n    areArraysEqual,\n    areDatesEqual,\n    areMapsEqual,\n    areObjectsEqual,\n    areRegExpsEqual,\n    areSetsEqual,\n    createIsNestedEqual: createDefaultIsNestedEqual,\n  },\n);\nconst DEFAULT_CIRCULAR_CONFIG: CreateComparatorCreatorOptions<BaseCircularMeta> =\n  Object.freeze({\n    areArraysEqual: areArraysEqualCircular,\n    areDatesEqual,\n    areMapsEqual: areMapsEqualCircular,\n    areObjectsEqual: areObjectsEqualCircular,\n    areRegExpsEqual,\n    areSetsEqual: areSetsEqualCircular,\n    createIsNestedEqual: createDefaultIsNestedEqual,\n  });\n\nconst isDeepEqual = createComparator(DEFAULT_CONFIG);\n\n/**\n * Whether the items passed are deeply-equal in value.\n */\nexport function deepEqual<A, B>(a: A, b: B): boolean {\n  return isDeepEqual(a, b, undefined);\n}\n\nconst isShallowEqual = createComparator(\n  merge(DEFAULT_CONFIG, { createIsNestedEqual: () => sameValueZeroEqual }),\n);\n\n/**\n * Whether the items passed are shallowly-equal in value.\n */\nexport function shallowEqual<A, B>(a: A, b: B): boolean {\n  return isShallowEqual(a, b, undefined);\n}\n\nconst isCircularDeepEqual = createComparator(DEFAULT_CIRCULAR_CONFIG);\n\n/**\n * Whether the items passed are deeply-equal in value, including circular references.\n */\nexport function circularDeepEqual<A, B>(a: A, b: B): boolean {\n  return isCircularDeepEqual(a, b, new WeakMap());\n}\n\nconst isCircularShallowEqual = createComparator(\n  merge(DEFAULT_CIRCULAR_CONFIG, {\n    createIsNestedEqual: () => sameValueZeroEqual,\n  }),\n);\n\n/**\n * Whether the items passed are shallowly-equal in value, including circular references.\n */\nexport function circularShallowEqual<A, B>(a: A, b: B): boolean {\n  return isCircularShallowEqual(a, b, new WeakMap());\n}\n\n/**\n * Create a custom equality comparison method.\n *\n * This can be done to create very targeted comparisons in extreme hot-path scenarios\n * where the standard methods are not performant enough, but can also be used to provide\n * support for legacy environments that do not support expected features like\n * `RegExp.prototype.flags` out of the box.\n */\nexport function createCustomEqual<Meta = undefined>(\n  getComparatorOptions: GetComparatorOptions<Meta>,\n): EqualityComparator<Meta> {\n  return createComparator<Meta>(\n    merge(DEFAULT_CONFIG, getComparatorOptions(DEFAULT_CONFIG as any)),\n  );\n}\n\n/**\n * Create a custom equality comparison method that handles circular references. This is very\n * similar to `createCustomEqual`, with the only difference being that `meta` expects to be\n * populated with a `WeakMap`-like contract.\n *\n * This can be done to create very targeted comparisons in extreme hot-path scenarios\n * where the standard methods are not performant enough, but can also be used to provide\n * support for legacy environments that do not support expected features like\n * `WeakMap` out of the box.\n */\nexport function createCustomCircularEqual<\n  Meta extends BaseCircularMeta = WeakMap<any, any>,\n>(getComparatorOptions: GetComparatorOptions<Meta>): EqualityComparator<Meta> {\n  const comparator = createComparator<Meta>(\n    merge(\n      DEFAULT_CIRCULAR_CONFIG,\n      getComparatorOptions(DEFAULT_CIRCULAR_CONFIG as any),\n    ),\n  );\n\n  return ((a: any, b: any, meta: any = new WeakMap()) =>\n    comparator(a, b, meta)) as EqualityComparator<Meta>;\n}\n"],"names":[],"mappings":";;;;;;EAMA;;;EAGG;EACG,SAAU,0BAA0B,CACxC,UAAoC,EAAA;EAEpC,IAAA,OAAO,SAAS,OAAO,CACrB,CAAI,EACJ,CAAI,EACJ,YAAiB,EACjB,YAAiB,EACjB,QAAa,EACb,QAAa,EACb,IAAU,EAAA;UAEV,OAAO,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;EAChC,KAAC,CAAC;EACJ,CAAC;EAED;;;;EAIG;EACG,SAAU,gBAAgB,CAE9B,aAA4B,EAAA;MAC5B,OAAO,SAAS,UAAU,CACxB,CAAM,EACN,CAAM,EACN,OAAsD,EACtD,KAAwB,EAAA;EAExB,QAAA,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;cAC9D,OAAO,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;EAC5C,SAAA;UAED,IAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;UAC7B,IAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;UAE7B,IAAI,OAAO,IAAI,OAAO,EAAE;EACtB,YAAA,OAAO,OAAO,KAAK,CAAC,IAAI,OAAO,KAAK,CAAC,CAAC;EACvC,SAAA;EAED,QAAA,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;EAChB,QAAA,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;EAEhB,QAAA,IAAM,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;EAEnD,QAAA,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;EAChB,QAAA,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;EAEhB,QAAA,OAAO,MAAM,CAAC;EAChB,KAAkB,CAAC;EACrB,CAAC;EAED;;;;;;EAMG;EACa,SAAA,KAAK,CAAqC,CAAI,EAAE,CAAI,EAAA;MAClE,IAAM,MAAM,GAAwB,EAAE,CAAC;EAEvC,IAAA,KAAK,IAAM,GAAG,IAAI,CAAC,EAAE;UACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;EACtB,KAAA;EAED,IAAA,KAAK,IAAM,GAAG,IAAI,CAAC,EAAE;UACnB,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;EACtB,KAAA;EAED,IAAA,OAAO,MAAe,CAAC;EACzB,CAAC;EAED;;;;;EAKG;EACG,SAAU,aAAa,CAAC,KAAU,EAAA;MACtC,OAAO,KAAK,CAAC,WAAW,KAAK,MAAM,IAAI,KAAK,CAAC,WAAW,IAAI,IAAI,CAAC;EACnE,CAAC;EAED;;EAEG;EACG,SAAU,aAAa,CAAC,KAAU,EAAA;EACtC,IAAA,OAAO,OAAO,KAAK,CAAC,IAAI,KAAK,UAAU,CAAC;EAC1C,CAAC;EAED;;EAEG;EACa,SAAA,kBAAkB,CAAC,CAAM,EAAE,CAAM,EAAA;EAC/C,IAAA,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;EACzC;;ECnGA,IAAM,aAAa,GAAG,oBAAoB,CAAC;EAC3C,IAAM,WAAW,GAAG,kBAAkB,CAAC;EACvC,IAAM,QAAQ,GAAG,eAAe,CAAC;EACjC,IAAM,WAAW,GAAG,iBAAiB,CAAC;EACtC,IAAM,OAAO,GAAG,cAAc,CAAC;EAC/B,IAAM,UAAU,GAAG,iBAAiB,CAAC;EACrC,IAAM,UAAU,GAAG,iBAAiB,CAAC;EACrC,IAAM,OAAO,GAAG,cAAc,CAAC;EAC/B,IAAM,UAAU,GAAG,iBAAiB,CAAC;EAE7B,IAAA,QAAQ,GAAK,MAAM,CAAC,SAAS,SAArB,CAAsB;EAEhC,SAAU,gBAAgB,CAAO,EAQA,EAAA;EAPrC,IAAA,IAAA,cAAc,oBAAA,EACd,aAAa,mBAAA,EACb,YAAY,kBAAA,EACZ,eAAe,GAAA,EAAA,CAAA,eAAA,EACf,eAAe,GAAA,EAAA,CAAA,eAAA,EACf,YAAY,GAAA,EAAA,CAAA,YAAA,EACZ,mBAAmB,GAAA,EAAA,CAAA,mBAAA,CAAA;EAEnB,IAAA,IAAM,OAAO,GAAG,mBAAmB,CAAC,UAAsC,CAAC,CAAC;EAE5E;;EAEG;EACH,IAAA,SAAS,UAAU,CAAC,CAAM,EAAE,CAAM,EAAE,IAAU,EAAA;;UAE5C,IAAI,CAAC,KAAK,CAAC,EAAE;EACX,YAAA,OAAO,IAAI,CAAC;EACb,SAAA;;;;;EAMD,QAAA,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE;EAC9D,YAAA,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;EAC3B,SAAA;;;;;;;;;;;;UAcD,IAAI,aAAa,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,EAAE;cACxC,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EAC7C,SAAA;;;;UAKD,IAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;UAChC,IAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;UAEhC,IAAI,MAAM,IAAI,MAAM,EAAE;EACpB,YAAA,OAAO,MAAM,KAAK,MAAM,IAAI,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EACjE,SAAA;;;;;UAMD,IAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;UAE9B,IAAI,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE;EAC7B,YAAA,OAAO,KAAK,CAAC;EACd,SAAA;UAED,IAAI,IAAI,KAAK,QAAQ,EAAE;;;cAGrB,OAAO,aAAa,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EAC3C,SAAA;UAED,IAAI,IAAI,KAAK,WAAW,EAAE;cACxB,OAAO,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EAC7C,SAAA;UAED,IAAI,IAAI,KAAK,OAAO,EAAE;cACpB,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EAC1C,SAAA;UAED,IAAI,IAAI,KAAK,OAAO,EAAE;cACpB,OAAO,YAAY,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EAC1C,SAAA;;;;EAKD,QAAA,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,aAAa,EAAE;;;cAGjD,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC;EACzC,kBAAE,KAAK;oBACL,eAAe,CAAC,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,IAAI,CAAC,CAAC;EAC1C,SAAA;;;;UAKD,IAAI,IAAI,KAAK,WAAW,IAAI,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,UAAU,EAAE;EACtE,YAAA,OAAO,kBAAkB,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;EACrD,SAAA;;;;;;;;;;;;EAaD,QAAA,OAAO,KAAK,CAAC;OACd;EAED,IAAA,OAAO,UAAsC,CAAC;EAChD;;EClIA;;EAEG;EACG,SAAU,cAAc,CAC5B,CAAQ,EACR,CAAQ,EACR,OAAwC,EACxC,IAAS,EAAA;EAET,IAAA,IAAI,KAAK,GAAG,CAAC,CAAC,MAAM,CAAC;EAErB,IAAA,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK,EAAE;EACtB,QAAA,OAAO,KAAK,CAAC;EACd,KAAA;;;;;EAMD,IAAA,OAAO,KAAK,EAAE,GAAG,CAAC,EAAE;UAClB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAAE;EAC1D,YAAA,OAAO,KAAK,CAAC;EACd,SAAA;EACF,KAAA;EAED,IAAA,OAAO,IAAI,CAAC;EACd,CAAC;EAED;;EAEG;EACI,IAAM,sBAAsB,GAAG,gBAAgB,CAAC,cAAc,CAAC;;ECjCtE;;;;;;EAMG;EACa,SAAA,aAAa,CAAC,CAAO,EAAE,CAAO,EAAA;EAC5C,IAAA,OAAO,kBAAkB,CAAC,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,EAAE,CAAC,CAAC;EACtD;;ECPA;;EAEG;EACG,SAAU,YAAY,CAC1B,CAAgB,EAChB,CAAgB,EAChB,OAAwC,EACxC,IAAS,EAAA;MAET,IAAI,YAAY,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;MAErC,IAAI,CAAC,YAAY,EAAE;EACjB,QAAA,OAAO,KAAK,CAAC;EACd,KAAA;EAED,IAAA,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;EACX,QAAA,OAAO,IAAI,CAAC;EACb,KAAA;;;;;;MAQD,IAAM,cAAc,GAAyB,EAAE,CAAC;MAEhD,IAAI,MAAM,GAAG,CAAC,CAAC;EAEf,IAAA,CAAC,CAAC,OAAO,CAAC,UAAC,MAAM,EAAE,IAAI,EAAA;UACrB,IAAI,CAAC,YAAY,EAAE;cACjB,OAAO;EACR,SAAA;UAED,IAAI,QAAQ,GAAG,KAAK,CAAC;UACrB,IAAI,WAAW,GAAG,CAAC,CAAC;EAEpB,QAAA,CAAC,CAAC,OAAO,CAAC,UAAC,MAAM,EAAE,IAAI,EAAA;EACrB,YAAA,IACE,CAAC,QAAQ;kBACT,CAAC,cAAc,CAAC,WAAW,CAAC;EAC5B,iBAAC,QAAQ;EACP,oBAAA,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;EACpD,wBAAA,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAClD;EACA,gBAAA,cAAc,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC;EACpC,aAAA;EAED,YAAA,WAAW,EAAE,CAAC;EAChB,SAAC,CAAC,CAAC;EAEH,QAAA,MAAM,EAAE,CAAC;UACT,YAAY,GAAG,QAAQ,CAAC;EAC1B,KAAC,CAAC,CAAC;EAEH,IAAA,OAAO,YAAY,CAAC;EACtB,CAAC;EAED;;EAEG;EACI,IAAM,oBAAoB,GAAG,gBAAgB,CAAC,YAAY,CAAC;;ECxDlE,IAAM,KAAK,GAAG,QAAQ,CAAC;EACf,IAAA,cAAc,GAAK,MAAM,CAAC,SAAS,eAArB,CAAsB;EAE5C;;EAEG;EACG,SAAU,eAAe,CAC7B,CAAkB,EAClB,CAAkB,EAClB,OAAwC,EACxC,IAAS,EAAA;MAET,IAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;EAE7B,IAAA,IAAI,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC;MAEzB,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,EAAE;EACnC,QAAA,OAAO,KAAK,CAAC;EACd,KAAA;EAED,IAAA,IAAI,GAAW,CAAC;;;;;EAMhB,IAAA,OAAO,KAAK,EAAE,GAAG,CAAC,EAAE;EAClB,QAAA,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC;UAEnB,IAAI,GAAG,KAAK,KAAK,EAAE;EACjB,YAAA,IAAM,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;EACnC,YAAA,IAAM,aAAa,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;cAEnC,IAAI,CAAC,aAAa,IAAI,aAAa,KAAK,aAAa,KAAK,aAAa,EAAE;EACvE,gBAAA,OAAO,KAAK,CAAC;EACd,aAAA;EACF,SAAA;UAED,IACE,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,EAAE,GAAG,CAAC;cAC5B,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,EAC9C;EACA,YAAA,OAAO,KAAK,CAAC;EACd,SAAA;EACF,KAAA;EAED,IAAA,OAAO,IAAI,CAAC;EACd,CAAC;EAED;;EAEG;EACI,IAAM,uBAAuB,GAAG,gBAAgB,CAAC,eAAe,CAAC;;EC7DxE;;;;;;;EAOG;EACa,SAAA,eAAe,CAAC,CAAS,EAAE,CAAS,EAAA;EAClD,IAAA,OAAO,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,KAAK,CAAC,CAAC,KAAK,CAAC;EACtD;;ECNA;;EAEG;EACG,SAAU,YAAY,CAC1B,CAAW,EACX,CAAW,EACX,OAAwC,EACxC,IAAS,EAAA;MAET,IAAI,YAAY,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC;MAErC,IAAI,CAAC,YAAY,EAAE;EACjB,QAAA,OAAO,KAAK,CAAC;EACd,KAAA;EAED,IAAA,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE;EACX,QAAA,OAAO,IAAI,CAAC;EACb,KAAA;;;;;;MAQD,IAAM,cAAc,GAAyB,EAAE,CAAC;EAEhD,IAAA,CAAC,CAAC,OAAO,CAAC,UAAC,MAAM,EAAE,IAAI,EAAA;UACrB,IAAI,CAAC,YAAY,EAAE;cACjB,OAAO;EACR,SAAA;UAED,IAAI,QAAQ,GAAG,KAAK,CAAC;UACrB,IAAI,UAAU,GAAG,CAAC,CAAC;EAEnB,QAAA,CAAC,CAAC,OAAO,CAAC,UAAC,MAAM,EAAE,IAAI,EAAA;EACrB,YAAA,IACE,CAAC,QAAQ;kBACT,CAAC,cAAc,CAAC,UAAU,CAAC;EAC3B,iBAAC,QAAQ,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,EAC5D;EACA,gBAAA,cAAc,CAAC,UAAU,CAAC,GAAG,IAAI,CAAC;EACnC,aAAA;EAED,YAAA,UAAU,EAAE,CAAC;EACf,SAAC,CAAC,CAAC;UAEH,YAAY,GAAG,QAAQ,CAAC;EAC1B,KAAC,CAAC,CAAC;EAEH,IAAA,OAAO,YAAY,CAAC;EACtB,CAAC;EAED;;EAEG;EACI,IAAM,oBAAoB,GAAG,gBAAgB,CAAC,YAAY,CAAC;;EC1ClE,IAAM,cAAc,GAA8C,MAAM,CAAC,MAAM,CAC7E;EACE,IAAA,cAAc,EAAA,cAAA;EACd,IAAA,aAAa,EAAA,aAAA;EACb,IAAA,YAAY,EAAA,YAAA;EACZ,IAAA,eAAe,EAAA,eAAA;EACf,IAAA,eAAe,EAAA,eAAA;EACf,IAAA,YAAY,EAAA,YAAA;EACZ,IAAA,mBAAmB,EAAE,0BAA0B;EAChD,CAAA,CACF,CAAC;EACF,IAAM,uBAAuB,GAC3B,MAAM,CAAC,MAAM,CAAC;EACZ,IAAA,cAAc,EAAE,sBAAsB;EACtC,IAAA,aAAa,EAAA,aAAA;EACb,IAAA,YAAY,EAAE,oBAAoB;EAClC,IAAA,eAAe,EAAE,uBAAuB;EACxC,IAAA,eAAe,EAAA,eAAA;EACf,IAAA,YAAY,EAAE,oBAAoB;EAClC,IAAA,mBAAmB,EAAE,0BAA0B;EAChD,CAAA,CAAC,CAAC;EAEL,IAAM,WAAW,GAAG,gBAAgB,CAAC,cAAc,CAAC,CAAC;EAErD;;EAEG;EACa,SAAA,SAAS,CAAO,CAAI,EAAE,CAAI,EAAA;MACxC,OAAO,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;EACtC,CAAC;EAED,IAAM,cAAc,GAAG,gBAAgB,CACrC,KAAK,CAAC,cAAc,EAAE,EAAE,mBAAmB,EAAE,YAAA,EAAM,OAAA,kBAAkB,CAAA,EAAA,EAAE,CAAC,CACzE,CAAC;EAEF;;EAEG;EACa,SAAA,YAAY,CAAO,CAAI,EAAE,CAAI,EAAA;MAC3C,OAAO,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;EACzC,CAAC;EAED,IAAM,mBAAmB,GAAG,gBAAgB,CAAC,uBAAuB,CAAC,CAAC;EAEtE;;EAEG;EACa,SAAA,iBAAiB,CAAO,CAAI,EAAE,CAAI,EAAA;MAChD,OAAO,mBAAmB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC;EAClD,CAAC;EAED,IAAM,sBAAsB,GAAG,gBAAgB,CAC7C,KAAK,CAAC,uBAAuB,EAAE;EAC7B,IAAA,mBAAmB,EAAE,YAAA,EAAM,OAAA,kBAAkB,GAAA;EAC9C,CAAA,CAAC,CACH,CAAC;EAEF;;EAEG;EACa,SAAA,oBAAoB,CAAO,CAAI,EAAE,CAAI,EAAA;MACnD,OAAO,sBAAsB,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC;EACrD,CAAC;EAED;;;;;;;EAOG;EACG,SAAU,iBAAiB,CAC/B,oBAAgD,EAAA;EAEhD,IAAA,OAAO,gBAAgB,CACrB,KAAK,CAAC,cAAc,EAAE,oBAAoB,CAAC,cAAqB,CAAC,CAAC,CACnE,CAAC;EACJ,CAAC;EAED;;;;;;;;;EASG;EACG,SAAU,yBAAyB,CAEvC,oBAAgD,EAAA;EAChD,IAAA,IAAM,UAAU,GAAG,gBAAgB,CACjC,KAAK,CACH,uBAAuB,EACvB,oBAAoB,CAAC,uBAA8B,CAAC,CACrD,CACF,CAAC;EAEF,IAAA,QAAQ,UAAC,CAAM,EAAE,CAAM,EAAE,IAAyB,EAAA;UAAzB,IAAA,IAAA,KAAA,KAAA,CAAA,EAAA,EAAA,IAAgB,GAAA,IAAA,OAAO,EAAE,CAAA,EAAA;EAChD,QAAA,OAAA,UAAU,CAAC,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,CAAA;EAAtB,KAAsB,EAA8B;EACxD;;;;;;;;;;;;;;;;"}

package/dist/fast-equals.min.js

@@ -1 +0,0 @@
-!function(e,r){"object"==typeof exports&&"undefined"!=typeof module?r(exports):"function"==typeof define&&define.amd?define(["exports"],r):r((e="undefined"!=typeof globalThis?globalThis:e||self)["fast-equals"]={})}(this,(function(e){"use strict";function r(e){return function(r,t,n,a,u,o,f){return e(r,t,f)}}function t(e){return function(r,t,n,a){if(!r||!t||"object"!=typeof r||"object"!=typeof t)return e(r,t,n,a);var u=a.get(r),o=a.get(t);if(u&&o)return u===t&&o===r;a.set(r,t),a.set(t,r);var f=e(r,t,n,a);return a.delete(r),a.delete(t),f}}function n(e,r){var t={};for(var n in e)t[n]=e[n];for(var n in r)t[n]=r[n];return t}function a(e){return e.constructor===Object||null==e.constructor}function u(e){return"function"==typeof e.then}function o(e,r){return e===r||e!=e&&r!=r}var f=Object.prototype.toString;function c(e){var r=e.areArraysEqual,t=e.areDatesEqual,n=e.areMapsEqual,c=e.areObjectsEqual,i=e.areRegExpsEqual,l=e.areSetsEqual,s=(0,e.createIsNestedEqual)(E);function E(e,E,p){if(e===E)return!0;if(!e||!E||"object"!=typeof e||"object"!=typeof E)return e!=e&&E!=E;if(a(e)&&a(E))return c(e,E,s,p);var q=Array.isArray(e),v=Array.isArray(E);if(q||v)return q===v&&r(e,E,s,p);var b=f.call(e);return b===f.call(E)&&("[object Date]"===b?t(e,E,s,p):"[object RegExp]"===b?i(e,E,s,p):"[object Map]"===b?n(e,E,s,p):"[object Set]"===b?l(e,E,s,p):"[object Object]"===b||"[object Arguments]"===b?!u(e)&&!u(E)&&c(e,E,s,p):("[object Boolean]"===b||"[object Number]"===b||"[object String]"===b)&&o(e.valueOf(),E.valueOf()))}return E}function i(e,r,t,n){var a=e.length;if(r.length!==a)return!1;for(;a-- >0;)if(!t(e[a],r[a],a,a,e,r,n))return!1;return!0}var l=t(i);function s(e,r){return o(e.valueOf(),r.valueOf())}function E(e,r,t,n){var a=e.size===r.size;if(!a)return!1;if(!e.size)return!0;var u={},o=0;return e.forEach((function(f,c){if(a){var i=!1,l=0;r.forEach((function(a,s){i||u[l]||!(i=t(c,s,o,l,e,r,n)&&t(f,a,c,s,e,r,n))||(u[l]=!0),l++})),o++,a=i}})),a}var p=t(E),q=Object.prototype.hasOwnProperty;function v(e,r,t,n){var a,u=Object.keys(e),o=u.length;if(Object.keys(r).length!==o)return!1;for(;o-- >0;){if("_owner"===(a=u[o])){var f=!!e.$$typeof,c=!!r.$$typeof;if((f||c)&&f!==c)return!1}if(!q.call(r,a)||!t(e[a],r[a],a,a,e,r,n))return!1}return!0}var b=t(v);function j(e,r){return e.source===r.source&&e.flags===r.flags}function y(e,r,t,n){var a=e.size===r.size;if(!a)return!1;if(!e.size)return!0;var u={};return e.forEach((function(o,f){if(a){var c=!1,i=0;r.forEach((function(a,l){c||u[i]||!(c=t(o,a,f,l,e,r,n))||(u[i]=!0),i++})),a=c}})),a}var d=t(y),g=Object.freeze({areArraysEqual:i,areDatesEqual:s,areMapsEqual:E,areObjectsEqual:v,areRegExpsEqual:j,areSetsEqual:y,createIsNestedEqual:r}),O=Object.freeze({areArraysEqual:l,areDatesEqual:s,areMapsEqual:p,areObjectsEqual:b,areRegExpsEqual:j,areSetsEqual:d,createIsNestedEqual:r}),h=c(g),z=c(n(g,{createIsNestedEqual:function(){return o}})),A=c(O),M=c(n(O,{createIsNestedEqual:function(){return o}}));e.circularDeepEqual=function(e,r){return A(e,r,new WeakMap)},e.circularShallowEqual=function(e,r){return M(e,r,new WeakMap)},e.createCustomCircularEqual=function(e){var r=c(n(O,e(O)));return function(e,t,n){return void 0===n&&(n=new WeakMap),r(e,t,n)}},e.createCustomEqual=function(e){return c(n(g,e(g)))},e.deepEqual=function(e,r){return h(e,r,void 0)},e.sameValueZeroEqual=o,e.shallowEqual=function(e,r){return z(e,r,void 0)},Object.defineProperty(e,"__esModule",{value:!0})}));