@performant-software/controlled-vocabulary 3.1.5-beta.1 → 3.1.5-beta.2

package/dist/index.es488.js

@@ -1,9 +1,10 @@
-import r from "./index.es491.js";
-var a = /^\s+/;
-function t(e) {
-  return e && e.slice(0, r(e) + 1).replace(a, "");
+import o from "./index.es516.js";
+import i from "./index.es517.js";
+function f(t) {
+  var r = i(t, "string");
+  return o(r) == "symbol" ? r : String(r);
 }
 export {
-  t as default
+  f as default
 };
 //# sourceMappingURL=index.es488.js.map

package/dist/index.es488.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es488.js","sources":["../../../node_modules/lodash-es/_baseTrim.js"],"sourcesContent":["import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n"],"names":["reTrimStart","baseTrim","string","trimmedEndIndex"],"mappings":";AAGA,IAAIA,IAAc;AASlB,SAASC,EAASC,GAAQ;AACxB,SAAOA,KACHA,EAAO,MAAM,GAAGC,EAAgBD,CAAM,IAAI,CAAC,EAAE,QAAQF,GAAa,EAAE;AAE1E;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es488.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/toPropertyKey.js"],"sourcesContent":["import _typeof from \"./typeof.js\";\nimport toPrimitive from \"./toPrimitive.js\";\nexport default function toPropertyKey(t) {\n  var i = toPrimitive(t, \"string\");\n  return \"symbol\" == _typeof(i) ? i : String(i);\n}"],"names":["toPropertyKey","i","toPrimitive","_typeof"],"mappings":";;AAEA,SAAwBA,EAAc,GAAG;AACvC,MAAIC,IAAIC,EAAY,GAAG,QAAQ;AAC/B,SAAmBC,EAAQF,CAAC,KAArB,WAAyBA,IAAI,OAAOA,CAAC;AAC9C;","x_google_ignoreList":[0]}

package/dist/index.es489.js

@@ -1,5 +1,5 @@
-import r from "./index.es516.js";
-import o from "./index.es517.js";
+import r from "./index.es513.js";
+import o from "./index.es514.js";
 function v(t, a) {
   var e = o(t, a);
   return r(e) ? e : void 0;

package/dist/index.es491.js

@@ -1,10 +1,10 @@
-var r = /\s/;
-function a(t) {
-  for (var e = t.length; e-- && r.test(t.charAt(e)); )
-    ;
+function n(e, l) {
+  var t = e.length;
+  for (e.sort(l); t--; )
+    e[t] = e[t].value;
   return e;
 }
 export {
-  a as default
+  n as default
 };
 //# sourceMappingURL=index.es491.js.map

package/dist/index.es491.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es491.js","sources":["../../../node_modules/lodash-es/_trimmedEndIndex.js"],"sourcesContent":["/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n"],"names":["reWhitespace","trimmedEndIndex","string","index"],"mappings":"AACA,IAAIA,IAAe;AAUnB,SAASC,EAAgBC,GAAQ;AAG/B,WAFIC,IAAQD,EAAO,QAEZC,OAAWH,EAAa,KAAKE,EAAO,OAAOC,CAAK,CAAC;AAAG;AAC3D,SAAOA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es491.js","sources":["../../../node_modules/lodash-es/_baseSortBy.js"],"sourcesContent":["/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nexport default baseSortBy;\n"],"names":["baseSortBy","array","comparer","length"],"mappings":"AAUA,SAASA,EAAWC,GAAOC,GAAU;AACnC,MAAIC,IAASF,EAAM;AAGnB,OADAA,EAAM,KAAKC,CAAQ,GACZC;AACL,IAAAF,EAAME,CAAM,IAAIF,EAAME,CAAM,EAAE;AAEhC,SAAOF;AACT;","x_google_ignoreList":[0]}

package/dist/index.es492.js

@@ -1,10 +1,17 @@
-function n(e, l) {
-  var t = e.length;
-  for (e.sort(l); t--; )
-    e[t] = e[t].value;
-  return e;
+import g from "./index.es518.js";
+function l(i, n, t) {
+  for (var r = -1, a = i.criteria, c = n.criteria, d = a.length, o = t.length; ++r < d; ) {
+    var e = g(a[r], c[r]);
+    if (e) {
+      if (r >= o)
+        return e;
+      var f = t[r];
+      return e * (f == "desc" ? -1 : 1);
+    }
+  }
+  return i.index - n.index;
 }
 export {
-  n as default
+  l as default
 };
 //# sourceMappingURL=index.es492.js.map

package/dist/index.es492.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es492.js","sources":["../../../node_modules/lodash-es/_baseSortBy.js"],"sourcesContent":["/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nexport default baseSortBy;\n"],"names":["baseSortBy","array","comparer","length"],"mappings":"AAUA,SAASA,EAAWC,GAAOC,GAAU;AACnC,MAAIC,IAASF,EAAM;AAGnB,OADAA,EAAM,KAAKC,CAAQ,GACZC;AACL,IAAAF,EAAME,CAAM,IAAIF,EAAME,CAAM,EAAE;AAEhC,SAAOF;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es492.js","sources":["../../../node_modules/lodash-es/_compareMultiple.js"],"sourcesContent":["import compareAscending from './_compareAscending.js';\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nexport default compareMultiple;\n"],"names":["compareMultiple","object","other","orders","index","objCriteria","othCriteria","length","ordersLength","result","compareAscending","order"],"mappings":";AAgBA,SAASA,EAAgBC,GAAQC,GAAOC,GAAQ;AAO9C,WANIC,IAAQ,IACRC,IAAcJ,EAAO,UACrBK,IAAcJ,EAAM,UACpBK,IAASF,EAAY,QACrBG,IAAeL,EAAO,QAEnB,EAAEC,IAAQG,KAAQ;AACvB,QAAIE,IAASC,EAAiBL,EAAYD,CAAK,GAAGE,EAAYF,CAAK,CAAC;AACpE,QAAIK,GAAQ;AACV,UAAIL,KAASI;AACX,eAAOC;AAET,UAAIE,IAAQR,EAAOC,CAAK;AACxB,aAAOK,KAAUE,KAAS,SAAS,KAAK;AAAA,IAC1C;AAAA,EACF;AAQA,SAAOV,EAAO,QAAQC,EAAM;AAC9B;","x_google_ignoreList":[0]}

package/dist/index.es493.js

@@ -1,17 +1,10 @@
-import g from "./index.es518.js";
-function l(i, n, t) {
-  for (var r = -1, a = i.criteria, c = n.criteria, d = a.length, o = t.length; ++r < d; ) {
-    var e = g(a[r], c[r]);
-    if (e) {
-      if (r >= o)
-        return e;
-      var f = t[r];
-      return e * (f == "desc" ? -1 : 1);
-    }
-  }
-  return i.index - n.index;
+var r = /\s/;
+function a(t) {
+  for (var e = t.length; e-- && r.test(t.charAt(e)); )
+    ;
+  return e;
 }
 export {
-  l as default
+  a as default
 };
 //# sourceMappingURL=index.es493.js.map

package/dist/index.es493.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es493.js","sources":["../../../node_modules/lodash-es/_compareMultiple.js"],"sourcesContent":["import compareAscending from './_compareAscending.js';\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nexport default compareMultiple;\n"],"names":["compareMultiple","object","other","orders","index","objCriteria","othCriteria","length","ordersLength","result","compareAscending","order"],"mappings":";AAgBA,SAASA,EAAgBC,GAAQC,GAAOC,GAAQ;AAO9C,WANIC,IAAQ,IACRC,IAAcJ,EAAO,UACrBK,IAAcJ,EAAM,UACpBK,IAASF,EAAY,QACrBG,IAAeL,EAAO,QAEnB,EAAEC,IAAQG,KAAQ;AACvB,QAAIE,IAASC,EAAiBL,EAAYD,CAAK,GAAGE,EAAYF,CAAK,CAAC;AACpE,QAAIK,GAAQ;AACV,UAAIL,KAASI;AACX,eAAOC;AAET,UAAIE,IAAQR,EAAOC,CAAK;AACxB,aAAOK,KAAUE,KAAS,SAAS,KAAK;AAAA,IAC1C;AAAA,EACF;AAQA,SAAOV,EAAO,QAAQC,EAAM;AAC9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es493.js","sources":["../../../node_modules/lodash-es/_trimmedEndIndex.js"],"sourcesContent":["/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n"],"names":["reWhitespace","trimmedEndIndex","string","index"],"mappings":"AACA,IAAIA,IAAe;AAUnB,SAASC,EAAgBC,GAAQ;AAG/B,WAFIC,IAAQD,EAAO,QAEZC,OAAWH,EAAa,KAAKE,EAAO,OAAOC,CAAK,CAAC;AAAG;AAC3D,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es494.js

@@ -1,6 +1,6 @@
 import a from "./index.es519.js";
 import t from "./index.es520.js";
-import e from "./index.es467.js";
+import e from "./index.es468.js";
 function o() {
   this.size = 0, this.__data__ = {
     hash: new a(),

package/dist/index.es499.js

@@ -1,12 +1,5 @@
-import c from "./index.es346.js";
-var i = 500;
-function m(a) {
-  var e = c(a, function(t) {
-    return r.size === i && r.clear(), t;
-  }), r = e.cache;
-  return e;
-}
+var e = { exports: {} };
 export {
-  m as default
+  e as __module
 };
 //# sourceMappingURL=index.es499.js.map

package/dist/index.es499.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es499.js","sources":["../../../node_modules/lodash-es/_memoizeCapped.js"],"sourcesContent":["import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nexport default memoizeCapped;\n"],"names":["MAX_MEMOIZE_SIZE","memoizeCapped","func","result","memoize","key","cache"],"mappings":";AAGA,IAAIA,IAAmB;AAUvB,SAASC,EAAcC,GAAM;AAC3B,MAAIC,IAASC,EAAQF,GAAM,SAASG,GAAK;AACvC,WAAIC,EAAM,SAASN,KACjBM,EAAM,MAAA,GAEDD;AAAA,EACT,CAAC,GAEGC,IAAQH,EAAO;AACnB,SAAOA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es499.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es500.js

@@ -1,19 +1,5 @@
-import r from "./index.es520.js";
-import a from "./index.es522.js";
-import p from "./index.es523.js";
-import s from "./index.es524.js";
-import i from "./index.es525.js";
-import m from "./index.es526.js";
-function t(o) {
-  var e = this.__data__ = new r(o);
-  this.size = e.size;
-}
-t.prototype.clear = a;
-t.prototype.delete = p;
-t.prototype.get = s;
-t.prototype.has = i;
-t.prototype.set = m;
+var r = {};
 export {
-  t as default
+  r as __exports
 };
 //# sourceMappingURL=index.es500.js.map

package/dist/index.es500.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es500.js","sources":["../../../node_modules/lodash-es/_Stack.js"],"sourcesContent":["import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\n"],"names":["Stack","entries","data","ListCache","stackClear","stackDelete","stackGet","stackHas","stackSet"],"mappings":";;;;;;AAcA,SAASA,EAAMC,GAAS;AACtB,MAAIC,IAAO,KAAK,WAAW,IAAIC,EAAUF,CAAO;AAChD,OAAK,OAAOC,EAAK;AACnB;AAGAF,EAAM,UAAU,QAAQI;AACxBJ,EAAM,UAAU,SAAYK;AAC5BL,EAAM,UAAU,MAAMM;AACtBN,EAAM,UAAU,MAAMO;AACtBP,EAAM,UAAU,MAAMQ;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es500.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es501.js

@@ -1,7 +1,5 @@
-function e(n, a) {
-  return n != null && a in Object(n);
-}
+var e = {};
 export {
-  e as default
+  e as __exports
 };
 //# sourceMappingURL=index.es501.js.map

package/dist/index.es501.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es501.js","sources":["../../../node_modules/lodash-es/_baseHasIn.js"],"sourcesContent":["/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nexport default baseHasIn;\n"],"names":["baseHasIn","object","key"],"mappings":"AAQA,SAASA,EAAUC,GAAQC,GAAK;AAC9B,SAAOD,KAAU,QAAQC,KAAO,OAAOD,CAAM;AAC/C;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es501.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es502.js

@@ -1,5 +1,12 @@
-var r = {};
+import c from "./index.es342.js";
+var i = 500;
+function m(a) {
+  var e = c(a, function(t) {
+    return r.size === i && r.clear(), t;
+  }), r = e.cache;
+  return e;
+}
 export {
-  r as __exports
+  m as default
 };
 //# sourceMappingURL=index.es502.js.map

package/dist/index.es502.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es502.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index.es502.js","sources":["../../../node_modules/lodash-es/_memoizeCapped.js"],"sourcesContent":["import memoize from './memoize.js';\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nexport default memoizeCapped;\n"],"names":["MAX_MEMOIZE_SIZE","memoizeCapped","func","result","memoize","key","cache"],"mappings":";AAGA,IAAIA,IAAmB;AAUvB,SAASC,EAAcC,GAAM;AAC3B,MAAIC,IAASC,EAAQF,GAAM,SAASG,GAAK;AACvC,WAAIC,EAAM,SAASN,KACjBM,EAAM,MAAA,GAEDD;AAAA,EACT,CAAC,GAEGC,IAAQH,EAAO;AACnB,SAAOA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es503.js

@@ -1,5 +1,9 @@
-var e = {};
+function t(n) {
+  return function(r) {
+    return n?.[r];
+  };
+}
 export {
-  e as __exports
+  t as default
 };
 //# sourceMappingURL=index.es503.js.map

package/dist/index.es503.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es503.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index.es503.js","sources":["../../../node_modules/lodash-es/_basePropertyOf.js"],"sourcesContent":["/**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyOf(object) {\n  return function(key) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nexport default basePropertyOf;\n"],"names":["basePropertyOf","object","key"],"mappings":"AAOA,SAASA,EAAeC,GAAQ;AAC9B,SAAO,SAASC,GAAK;AACnB,WAAoCD,IAAOC,CAAG;AAAA,EAChD;AACF;","x_google_ignoreList":[0]}

package/dist/index.es504.js

@@ -1,8 +1,18 @@
-function t(n) {
-  return function(r) {
-    return n?.[r];
-  };
+import r from "./index.es520.js";
+import a from "./index.es522.js";
+import p from "./index.es523.js";
+import s from "./index.es524.js";
+import i from "./index.es525.js";
+import m from "./index.es526.js";
+function t(o) {
+  var e = this.__data__ = new r(o);
+  this.size = e.size;
 }
+t.prototype.clear = a;
+t.prototype.delete = p;
+t.prototype.get = s;
+t.prototype.has = i;
+t.prototype.set = m;
 export {
   t as default
 };

package/dist/index.es504.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es504.js","sources":["../../../node_modules/lodash-es/_basePropertyOf.js"],"sourcesContent":["/**\n * The base implementation of `_.propertyOf` without support for deep paths.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyOf(object) {\n  return function(key) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nexport default basePropertyOf;\n"],"names":["basePropertyOf","object","key"],"mappings":"AAOA,SAASA,EAAeC,GAAQ;AAC9B,SAAO,SAASC,GAAK;AACnB,WAAoCD,IAAOC,CAAG;AAAA,EAChD;AACF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es504.js","sources":["../../../node_modules/lodash-es/_Stack.js"],"sourcesContent":["import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\n"],"names":["Stack","entries","data","ListCache","stackClear","stackDelete","stackGet","stackHas","stackSet"],"mappings":";;;;;;AAcA,SAASA,EAAMC,GAAS;AACtB,MAAIC,IAAO,KAAK,WAAW,IAAIC,EAAUF,CAAO;AAChD,OAAK,OAAOC,EAAK;AACnB;AAGAF,EAAM,UAAU,QAAQI;AACxBJ,EAAM,UAAU,SAAYK;AAC5BL,EAAM,UAAU,MAAMM;AACtBN,EAAM,UAAU,MAAMO;AACtBP,EAAM,UAAU,MAAMQ;","x_google_ignoreList":[0]}

package/dist/index.es505.js

@@ -1,5 +1,7 @@
-var e = { exports: {} };
+function e(n, a) {
+  return n != null && a in Object(n);
+}
 export {
-  e as __module
+  e as default
 };
 //# sourceMappingURL=index.es505.js.map

package/dist/index.es505.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es505.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"version":3,"file":"index.es505.js","sources":["../../../node_modules/lodash-es/_baseHasIn.js"],"sourcesContent":["/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nexport default baseHasIn;\n"],"names":["baseHasIn","object","key"],"mappings":"AAQA,SAASA,EAAUC,GAAQC,GAAK;AAC9B,SAAOD,KAAU,QAAQC,KAAO,OAAOD,CAAM;AAC/C;","x_google_ignoreList":[0]}

package/dist/index.es507.js

@@ -1,4 +1,4 @@
-import o from "./index.es412.js";
+import o from "./index.es414.js";
 import a from "./index.es508.js";
 var n = Object.prototype, l = n.propertyIsEnumerable, t = Object.getOwnPropertySymbols, m = t ? function(r) {
   return r == null ? [] : (r = Object(r), o(t(r), function(e) {

package/dist/index.es509.js

@@ -1,10 +1,41 @@
-import s from "./index.es410.js";
-function b(n, r, t, e) {
-  return s(n, function(o, f, i) {
-    r(e, t(o), f, i);
-  }), e;
+import D from "./index.es370.js";
+import G from "./index.es421.js";
+import M from "./index.es372.js";
+var x = 1, F = 2;
+function U(n, e, d, v, p, f) {
+  var E = d & x, R = n.length, P = e.length;
+  if (R != P && !(E && P > R))
+    return !1;
+  var S = f.get(n), _ = f.get(e);
+  if (S && _)
+    return S == e && _ == n;
+  var A = -1, g = !0, l = d & F ? new D() : void 0;
+  for (f.set(n, e), f.set(e, n); ++A < R; ) {
+    var i = n[A], L = e[A];
+    if (v)
+      var C = E ? v(L, i, A, e, n, f) : v(i, L, A, n, e, f);
+    if (C !== void 0) {
+      if (C)
+        continue;
+      g = !1;
+      break;
+    }
+    if (l) {
+      if (!G(e, function(O, w) {
+        if (!M(l, w) && (i === O || p(i, O, d, v, f)))
+          return l.push(w);
+      })) {
+        g = !1;
+        break;
+      }
+    } else if (!(i === L || p(i, L, d, v, f))) {
+      g = !1;
+      break;
+    }
+  }
+  return f.delete(n), f.delete(e), g;
 }
 export {
-  b as default
+  U as default
 };
 //# sourceMappingURL=index.es509.js.map

package/dist/index.es509.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es509.js","sources":["../../../node_modules/lodash-es/_baseInverter.js"],"sourcesContent":["import baseForOwn from './_baseForOwn.js';\n\n/**\n * The base implementation of `_.invert` and `_.invertBy` which inverts\n * `object` with values transformed by `iteratee` and set by `setter`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} setter The function to set `accumulator` values.\n * @param {Function} iteratee The iteratee to transform values.\n * @param {Object} accumulator The initial inverted object.\n * @returns {Function} Returns `accumulator`.\n */\nfunction baseInverter(object, setter, iteratee, accumulator) {\n  baseForOwn(object, function(value, key, object) {\n    setter(accumulator, iteratee(value), key, object);\n  });\n  return accumulator;\n}\n\nexport default baseInverter;\n"],"names":["baseInverter","object","setter","iteratee","accumulator","baseForOwn","value","key"],"mappings":";AAaA,SAASA,EAAaC,GAAQC,GAAQC,GAAUC,GAAa;AAC3D,SAAAC,EAAWJ,GAAQ,SAASK,GAAOC,GAAKN,GAAQ;AAC9C,IAAAC,EAAOE,GAAaD,EAASG,CAAK,GAAGC,GAAKN,CAAM;AAAA,EAClD,CAAC,GACMG;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es509.js","sources":["../../../node_modules/lodash-es/_equalArrays.js"],"sourcesContent":["import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n"],"names":["COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","array","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","othLength","arrStacked","othStacked","index","result","seen","SetCache","arrValue","othValue","compared","arraySome","othIndex","cacheHas"],"mappings":";;;AAKA,IAAIA,IAAuB,GACvBC,IAAyB;AAe7B,SAASC,EAAYC,GAAOC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AACxE,MAAIC,IAAYJ,IAAUL,GACtBU,IAAYP,EAAM,QAClBQ,IAAYP,EAAM;AAEtB,MAAIM,KAAaC,KAAa,EAAEF,KAAaE,IAAYD;AACvD,WAAO;AAGT,MAAIE,IAAaJ,EAAM,IAAIL,CAAK,GAC5BU,IAAaL,EAAM,IAAIJ,CAAK;AAChC,MAAIQ,KAAcC;AAChB,WAAOD,KAAcR,KAASS,KAAcV;AAE9C,MAAIW,IAAQ,IACRC,IAAS,IACTC,IAAQX,IAAUJ,IAA0B,IAAIgB,EAAA,IAAW;AAM/D,OAJAT,EAAM,IAAIL,GAAOC,CAAK,GACtBI,EAAM,IAAIJ,GAAOD,CAAK,GAGf,EAAEW,IAAQJ,KAAW;AAC1B,QAAIQ,IAAWf,EAAMW,CAAK,GACtBK,IAAWf,EAAMU,CAAK;AAE1B,QAAIR;AACF,UAAIc,IAAWX,IACXH,EAAWa,GAAUD,GAAUJ,GAAOV,GAAOD,GAAOK,CAAK,IACzDF,EAAWY,GAAUC,GAAUL,GAAOX,GAAOC,GAAOI,CAAK;AAE/D,QAAIY,MAAa,QAAW;AAC1B,UAAIA;AACF;AAEF,MAAAL,IAAS;AACT;AAAA,IACF;AAEA,QAAIC;AACF,UAAI,CAACK,EAAUjB,GAAO,SAASe,GAAUG,GAAU;AAC7C,YAAI,CAACC,EAASP,GAAMM,CAAQ,MACvBJ,MAAaC,KAAYZ,EAAUW,GAAUC,GAAUd,GAASC,GAAYE,CAAK;AACpF,iBAAOQ,EAAK,KAAKM,CAAQ;AAAA,MAE7B,CAAC,GAAG;AACN,QAAAP,IAAS;AACT;AAAA,MACF;AAAA,eACS,EACLG,MAAaC,KACXZ,EAAUW,GAAUC,GAAUd,GAASC,GAAYE,CAAK,IACzD;AACL,MAAAO,IAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,SAAAP,EAAM,OAAUL,CAAK,GACrBK,EAAM,OAAUJ,CAAK,GACdW;AACT;","x_google_ignoreList":[0]}

package/dist/index.es51.js

@@ -1,16 +1,16 @@
 import p from "./index.es171.js";
 import F from "./index.es163.js";
 import G from "./index.es282.js";
-import L from "./index.es308.js";
+import L from "./index.es307.js";
 import B from "./index.es281.js";
 import H from "./index.es312.js";
-import V from "./index.es300.js";
+import V from "./index.es299.js";
 import a from "./index.es164.js";
 import { clsx as W } from "./index.es180.js";
 import o from "./index.es165.js";
 import d, { createRef as R, isValidElement as J } from "react";
-import X from "./index.es309.js";
-import Q from "./index.es260.js";
+import X from "./index.es308.js";
+import Q from "./index.es267.js";
 import { isNil as Y } from "./index.es181.js";
 import { useKeyOnly as N } from "./index.es182.js";
 import { itemShorthand as A } from "./index.es166.js";
@@ -20,7 +20,7 @@ import ee from "./index.es173.js";
 import E from "./index.es167.js";
 import S from "./index.es208.js";
 import oe from "./index.es47.js";
-import I from "./index.es257.js";
+import I from "./index.es264.js";
 import T from "./index.es217.js";
 import _ from "./index.es218.js";
 import ne from "./index.es219.js";

package/dist/index.es510.js

@@ -1,41 +1,46 @@
-import D from "./index.es370.js";
-import G from "./index.es421.js";
-import M from "./index.es372.js";
-var x = 1, F = 2;
-function U(n, e, d, v, p, f) {
-  var E = d & x, R = n.length, P = e.length;
-  if (R != P && !(E && P > R))
-    return !1;
-  var S = f.get(n), _ = f.get(e);
-  if (S && _)
-    return S == e && _ == n;
-  var A = -1, g = !0, l = d & F ? new D() : void 0;
-  for (f.set(n, e), f.set(e, n); ++A < R; ) {
-    var i = n[A], L = e[A];
-    if (v)
-      var C = E ? v(L, i, A, e, n, f) : v(i, L, A, n, e, f);
-    if (C !== void 0) {
-      if (C)
-        continue;
-      g = !1;
-      break;
-    }
-    if (l) {
-      if (!G(e, function(O, w) {
-        if (!M(l, w) && (i === O || p(i, O, d, v, f)))
-          return l.push(w);
-      })) {
-        g = !1;
-        break;
-      }
-    } else if (!(i === L || p(i, L, d, v, f))) {
-      g = !1;
-      break;
-    }
+import n from "./index.es373.js";
+import u from "./index.es527.js";
+import o from "./index.es465.js";
+import A from "./index.es509.js";
+import b from "./index.es528.js";
+import v from "./index.es474.js";
+var L = 1, O = 2, E = "[object Boolean]", R = "[object Date]", d = "[object Error]", w = "[object Map]", B = "[object Number]", D = "[object RegExp]", P = "[object Set]", S = "[object String]", _ = "[object Symbol]", c = "[object ArrayBuffer]", x = "[object DataView]", i = n ? n.prototype : void 0, g = i ? i.valueOf : void 0;
+function N(a, e, l, s, y, m, r) {
+  switch (l) {
+    case x:
+      if (a.byteLength != e.byteLength || a.byteOffset != e.byteOffset)
+        return !1;
+      a = a.buffer, e = e.buffer;
+    case c:
+      return !(a.byteLength != e.byteLength || !m(new u(a), new u(e)));
+    case E:
+    case R:
+    case B:
+      return o(+a, +e);
+    case d:
+      return a.name == e.name && a.message == e.message;
+    case D:
+    case S:
+      return a == e + "";
+    case w:
+      var f = b;
+    case P:
+      var T = s & L;
+      if (f || (f = v), a.size != e.size && !T)
+        return !1;
+      var t = r.get(a);
+      if (t)
+        return t == e;
+      s |= O, r.set(a, e);
+      var p = A(f(a), f(e), s, y, m, r);
+      return r.delete(a), p;
+    case _:
+      if (g)
+        return g.call(a) == g.call(e);
   }
-  return f.delete(n), f.delete(e), g;
+  return !1;
 }
 export {
-  U as default
+  N as default
 };
 //# sourceMappingURL=index.es510.js.map

package/dist/index.es510.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es510.js","sources":["../../../node_modules/lodash-es/_equalArrays.js"],"sourcesContent":["import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalArrays;\n"],"names":["COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","equalArrays","array","other","bitmask","customizer","equalFunc","stack","isPartial","arrLength","othLength","arrStacked","othStacked","index","result","seen","SetCache","arrValue","othValue","compared","arraySome","othIndex","cacheHas"],"mappings":";;;AAKA,IAAIA,IAAuB,GACvBC,IAAyB;AAe7B,SAASC,EAAYC,GAAOC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AACxE,MAAIC,IAAYJ,IAAUL,GACtBU,IAAYP,EAAM,QAClBQ,IAAYP,EAAM;AAEtB,MAAIM,KAAaC,KAAa,EAAEF,KAAaE,IAAYD;AACvD,WAAO;AAGT,MAAIE,IAAaJ,EAAM,IAAIL,CAAK,GAC5BU,IAAaL,EAAM,IAAIJ,CAAK;AAChC,MAAIQ,KAAcC;AAChB,WAAOD,KAAcR,KAASS,KAAcV;AAE9C,MAAIW,IAAQ,IACRC,IAAS,IACTC,IAAQX,IAAUJ,IAA0B,IAAIgB,EAAA,IAAW;AAM/D,OAJAT,EAAM,IAAIL,GAAOC,CAAK,GACtBI,EAAM,IAAIJ,GAAOD,CAAK,GAGf,EAAEW,IAAQJ,KAAW;AAC1B,QAAIQ,IAAWf,EAAMW,CAAK,GACtBK,IAAWf,EAAMU,CAAK;AAE1B,QAAIR;AACF,UAAIc,IAAWX,IACXH,EAAWa,GAAUD,GAAUJ,GAAOV,GAAOD,GAAOK,CAAK,IACzDF,EAAWY,GAAUC,GAAUL,GAAOX,GAAOC,GAAOI,CAAK;AAE/D,QAAIY,MAAa,QAAW;AAC1B,UAAIA;AACF;AAEF,MAAAL,IAAS;AACT;AAAA,IACF;AAEA,QAAIC;AACF,UAAI,CAACK,EAAUjB,GAAO,SAASe,GAAUG,GAAU;AAC7C,YAAI,CAACC,EAASP,GAAMM,CAAQ,MACvBJ,MAAaC,KAAYZ,EAAUW,GAAUC,GAAUd,GAASC,GAAYE,CAAK;AACpF,iBAAOQ,EAAK,KAAKM,CAAQ;AAAA,MAE7B,CAAC,GAAG;AACN,QAAAP,IAAS;AACT;AAAA,MACF;AAAA,eACS,EACLG,MAAaC,KACXZ,EAAUW,GAAUC,GAAUd,GAASC,GAAYE,CAAK,IACzD;AACL,MAAAO,IAAS;AACT;AAAA,IACF;AAAA,EACF;AACA,SAAAP,EAAM,OAAUL,CAAK,GACrBK,EAAM,OAAUJ,CAAK,GACdW;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es510.js","sources":["../../../node_modules/lodash-es/_equalByTag.js"],"sourcesContent":["import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nexport default equalByTag;\n"],"names":["COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","boolTag","dateTag","errorTag","mapTag","numberTag","regexpTag","setTag","stringTag","symbolTag","arrayBufferTag","dataViewTag","symbolProto","Symbol","symbolValueOf","equalByTag","object","other","tag","bitmask","customizer","equalFunc","stack","Uint8Array","eq","convert","mapToArray","isPartial","setToArray","stacked","result","equalArrays"],"mappings":";;;;;;AAQA,IAAIA,IAAuB,GACvBC,IAAyB,GAGzBC,IAAU,oBACVC,IAAU,iBACVC,IAAW,kBACXC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBACZC,IAAS,gBACTC,IAAY,mBACZC,IAAY,mBAEZC,IAAiB,wBACjBC,IAAc,qBAGdC,IAAcC,IAASA,EAAO,YAAY,QAC1CC,IAAgBF,IAAcA,EAAY,UAAU;AAmBxD,SAASG,EAAWC,GAAQC,GAAOC,GAAKC,GAASC,GAAYC,GAAWC,GAAO;AAC7E,UAAQJ,GAAA;AAAA,IACN,KAAKP;AACH,UAAKK,EAAO,cAAcC,EAAM,cAC3BD,EAAO,cAAcC,EAAM;AAC9B,eAAO;AAET,MAAAD,IAASA,EAAO,QAChBC,IAAQA,EAAM;AAAA,IAEhB,KAAKP;AACH,aAAK,EAAAM,EAAO,cAAcC,EAAM,cAC5B,CAACI,EAAU,IAAIE,EAAWP,CAAM,GAAG,IAAIO,EAAWN,CAAK,CAAC;AAAA,IAK9D,KAAKhB;AAAA,IACL,KAAKC;AAAA,IACL,KAAKG;AAGH,aAAOmB,EAAG,CAACR,GAAQ,CAACC,CAAK;AAAA,IAE3B,KAAKd;AACH,aAAOa,EAAO,QAAQC,EAAM,QAAQD,EAAO,WAAWC,EAAM;AAAA,IAE9D,KAAKX;AAAA,IACL,KAAKE;AAIH,aAAOQ,KAAWC,IAAQ;AAAA,IAE5B,KAAKb;AACH,UAAIqB,IAAUC;AAAA,IAEhB,KAAKnB;AACH,UAAIoB,IAAYR,IAAUpB;AAG1B,UAFA0B,MAAYA,IAAUG,IAElBZ,EAAO,QAAQC,EAAM,QAAQ,CAACU;AAChC,eAAO;AAGT,UAAIE,IAAUP,EAAM,IAAIN,CAAM;AAC9B,UAAIa;AACF,eAAOA,KAAWZ;AAEpB,MAAAE,KAAWnB,GAGXsB,EAAM,IAAIN,GAAQC,CAAK;AACvB,UAAIa,IAASC,EAAYN,EAAQT,CAAM,GAAGS,EAAQR,CAAK,GAAGE,GAASC,GAAYC,GAAWC,CAAK;AAC/F,aAAAA,EAAM,OAAUN,CAAM,GACfc;AAAA,IAET,KAAKrB;AACH,UAAIK;AACF,eAAOA,EAAc,KAAKE,CAAM,KAAKF,EAAc,KAAKG,CAAK;AAAA,EAC/D;AAEJ,SAAO;AACT;","x_google_ignoreList":[0]}