@performant-software/controlled-vocabulary 2.0.0 → 2.1.0-beta.1

package/dist/index.es497.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es497.js","sources":["../../../node_modules/lodash-es/_baseGetAllKeys.js"],"sourcesContent":["import arrayPush from './_arrayPush.js';\nimport isArray from './isArray.js';\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nexport default baseGetAllKeys;\n"],"names":["baseGetAllKeys","object","keysFunc","symbolsFunc","result","isArray","arrayPush"],"mappings":";;AAcA,SAASA,EAAeC,GAAQC,GAAUC,GAAa;AACjD,MAAAC,IAASF,EAASD,CAAM;AACrB,SAAAI,EAAQJ,CAAM,IAAIG,IAASE,EAAUF,GAAQD,EAAYF,CAAM,CAAC;AACzE;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es497.js","sources":["../../../node_modules/lodash-es/_createInverter.js"],"sourcesContent":["import baseInverter from './_baseInverter.js';\n\n/**\n * Creates a function like `_.invertBy`.\n *\n * @private\n * @param {Function} setter The function to set accumulator values.\n * @param {Function} toIteratee The function to resolve iteratees.\n * @returns {Function} Returns the new inverter function.\n */\nfunction createInverter(setter, toIteratee) {\n  return function(object, iteratee) {\n    return baseInverter(object, setter, toIteratee(iteratee), {});\n  };\n}\n\nexport default createInverter;\n"],"names":["createInverter","setter","toIteratee","object","iteratee","baseInverter"],"mappings":";AAUA,SAASA,EAAeC,GAAQC,GAAY;AACnC,SAAA,SAASC,GAAQC,GAAU;AAChC,WAAOC,EAAaF,GAAQF,GAAQC,EAAWE,CAAQ,GAAG,CAAA,CAAE;AAAA,EAAA;AAEhE;","x_google_ignoreList":[0]}

package/dist/index.es498.js

@@ -1,5 +1,5 @@
-import r from "./index.es519.js";
-import o from "./index.es520.js";
+import r from "./index.es521.js";
+import o from "./index.es522.js";
 function v(t, a) {
   var e = o(t, a);
   return r(e) ? e : void 0;

package/dist/index.es499.js

@@ -1,5 +1,12 @@
-var e = { exports: {} };
+import c from "./index.es363.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 {
-  e as __module
+  m as default
 };
 //# sourceMappingURL=index.es499.js.map

package/dist/index.es499.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es499.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}
+{"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;AACnC,WAAAC,EAAM,SAASN,KACjBM,EAAM,MAAM,GAEPD;AAAA,EAAA,CACR,GAEGC,IAAQH,EAAO;AACZ,SAAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es502.js

@@ -1,12 +1,5 @@
-import c from "./index.es367.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.es502.js.map

package/dist/index.es502.js.map

@@ -1 +1 @@
-{"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;AACnC,WAAAC,EAAM,SAASN,KACjBM,EAAM,MAAM,GAEPD;AAAA,EAAA,CACR,GAEGC,IAAQH,EAAO;AACZ,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es502.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es503.js

@@ -1,19 +1,10 @@
-import r from "./index.es523.js";
-import a from "./index.es524.js";
-import p from "./index.es525.js";
-import s from "./index.es526.js";
-import i from "./index.es527.js";
-import m from "./index.es528.js";
-function t(o) {
-  var e = this.__data__ = new r(o);
-  this.size = e.size;
+var r = /\s/;
+function a(t) {
+  for (var e = t.length; e-- && r.test(t.charAt(e)); )
+    ;
+  return e;
 }
-t.prototype.clear = a;
-t.prototype.delete = p;
-t.prototype.get = s;
-t.prototype.has = i;
-t.prototype.set = m;
 export {
-  t as default
+  a as default
 };
 //# sourceMappingURL=index.es503.js.map

package/dist/index.es503.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es503.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.es503.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;AACpD,SAAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es504.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.es504.js.map

package/dist/index.es504.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es504.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;AACpD,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es504.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;AAEzB,SAAAF;AACT;","x_google_ignoreList":[0]}

package/dist/index.es505.js

@@ -1,7 +1,17 @@
-function e(n, a) {
-  return n != null && a in Object(n);
+import g from "./index.es526.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 {
-  e as default
+  l as default
 };
 //# sourceMappingURL=index.es505.js.map

package/dist/index.es505.js.map

@@ -1 +1 @@
-{"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]}
+{"version":3,"file":"index.es505.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;AAOvC,WANHC,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;AACJ,eAAAC;AAEL,UAAAE,IAAQR,EAAOC,CAAK;AACjB,aAAAK,KAAUE,KAAS,SAAS,KAAK;AAAA,IAC1C;AAAA,EACF;AAQO,SAAAV,EAAO,QAAQC,EAAM;AAC9B;","x_google_ignoreList":[0]}

package/dist/index.es506.js

@@ -1,6 +1,6 @@
-import a from "./index.es529.js";
-import t from "./index.es523.js";
-import e from "./index.es474.js";
+import a from "./index.es523.js";
+import t from "./index.es524.js";
+import e from "./index.es475.js";
 function o() {
   this.size = 0, this.__data__ = {
     hash: new a(),

package/dist/index.es507.js

@@ -1,4 +1,4 @@
-import a from "./index.es530.js";
+import a from "./index.es525.js";
 function i(e) {
   var t = a(this, e).delete(e);
   return this.size -= t ? 1 : 0, t;

package/dist/index.es508.js

@@ -1,4 +1,4 @@
-import a from "./index.es530.js";
+import a from "./index.es525.js";
 function r(t) {
   return a(this, t).get(t);
 }

package/dist/index.es509.js

@@ -1,4 +1,4 @@
-import t from "./index.es530.js";
+import t from "./index.es525.js";
 function e(a) {
   return t(this, a).has(a);
 }

package/dist/index.es51.js

@@ -1,32 +1,32 @@
 import p from "./index.es179.js";
 import F from "./index.es171.js";
-import G from "./index.es294.js";
+import G from "./index.es293.js";
 import L from "./index.es310.js";
-import B from "./index.es290.js";
-import H from "./index.es315.js";
+import B from "./index.es291.js";
+import H from "./index.es323.js";
 import V from "./index.es302.js";
 import a from "./index.es172.js";
 import { clsx as W } from "./index.es188.js";
 import o from "./index.es173.js";
 import d, { createRef as R, isValidElement as J } from "react";
 import X from "./index.es311.js";
-import Q from "./index.es268.js";
+import Q from "./index.es275.js";
 import { isNil as Y } from "./index.es189.js";
 import { useKeyOnly as N } from "./index.es190.js";
 import { itemShorthand as A } from "./index.es174.js";
-import { instance as P } from "./index.es266.js";
+import { instance as P } from "./index.es274.js";
 import Z from "./index.es180.js";
 import ee from "./index.es181.js";
 import E from "./index.es175.js";
 import S from "./index.es216.js";
 import oe from "./index.es47.js";
-import I from "./index.es265.js";
+import I from "./index.es273.js";
 import T from "./index.es225.js";
 import _ from "./index.es226.js";
 import ne from "./index.es227.js";
 import $ from "./index.es228.js";
 import j from "./index.es230.js";
-import { isLegacy as te, canFit as re, getLegacyStyles as le } from "./index.es319.js";
+import { isLegacy as te, canFit as re, getLegacyStyles as le } from "./index.es324.js";
 import { Ref as U } from "./index.es177.js";
 var l = /* @__PURE__ */ function(O) {
   F(f, O);

package/dist/index.es510.js

@@ -1,4 +1,4 @@
-import s from "./index.es530.js";
+import s from "./index.es525.js";
 function h(a, e) {
   var t = s(this, a), i = t.size;
   return t.set(a, e), this.size += t.size == i ? 0 : 1, this;

package/dist/index.es511.js

@@ -1,10 +1,19 @@
-function n(e, l) {
-  var t = e.length;
-  for (e.sort(l); t--; )
-    e[t] = e[t].value;
-  return e;
+import r from "./index.es524.js";
+import a from "./index.es527.js";
+import p from "./index.es528.js";
+import s from "./index.es529.js";
+import i from "./index.es530.js";
+import m from "./index.es531.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 {
-  n as default
+  t as default
 };
 //# sourceMappingURL=index.es511.js.map

package/dist/index.es511.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es511.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;AAEzB,SAAAF;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es511.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.es512.js

@@ -1,17 +1,7 @@
-import g from "./index.es531.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;
+function e(n, a) {
+  return n != null && a in Object(n);
 }
 export {
-  l as default
+  e as default
 };
 //# sourceMappingURL=index.es512.js.map

package/dist/index.es512.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es512.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;AAOvC,WANHC,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;AACJ,eAAAC;AAEL,UAAAE,IAAQR,EAAOC,CAAK;AACjB,aAAAK,KAAUE,KAAS,SAAS,KAAK;AAAA,IAC1C;AAAA,EACF;AAQO,SAAAV,EAAO,QAAQC,EAAM;AAC9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es512.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.es515.js

@@ -1,41 +1,12 @@
-import D from "./index.es381.js";
-import G from "./index.es449.js";
-import M from "./index.es385.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;
-}
+import o from "./index.es421.js";
+import a from "./index.es516.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) {
+    return l.call(r, e);
+  }));
+} : a;
+const y = m;
 export {
-  U as default
+  y as default
 };
 //# sourceMappingURL=index.es515.js.map

package/dist/index.es515.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es515.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;AAChD,WAAA;AAGL,MAAAE,IAAaJ,EAAM,IAAIL,CAAK,GAC5BU,IAAaL,EAAM,IAAIJ,CAAK;AAChC,MAAIQ,KAAcC;AACT,WAAAD,KAAcR,KAASS,KAAcV;AAE1C,MAAAW,IAAQ,IACRC,IAAS,IACTC,IAAQX,IAAUJ,IAA0B,IAAIgB,EAAW,IAAA;AAMxD,OAJDT,EAAA,IAAIL,GAAOC,CAAK,GAChBI,EAAA,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;AAEO,MAAAL,IAAA;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;AAC7E,iBAAAQ,EAAK,KAAKM,CAAQ;AAAA,MAC3B,CACD,GAAG;AACG,QAAAP,IAAA;AACT;AAAA,MACF;AAAA,eACS,EACLG,MAAaC,KACXZ,EAAUW,GAAUC,GAAUd,GAASC,GAAYE,CAAK,IACzD;AACI,MAAAO,IAAA;AACT;AAAA,IACF;AAAA,EACF;AACM,SAAAP,EAAA,OAAUL,CAAK,GACfK,EAAA,OAAUJ,CAAK,GACdW;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es515.js","sources":["../../../node_modules/lodash-es/_getSymbols.js"],"sourcesContent":["import arrayFilter from './_arrayFilter.js';\nimport stubArray from './stubArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nexport default getSymbols;\n"],"names":["objectProto","propertyIsEnumerable","nativeGetSymbols","getSymbols","object","arrayFilter","symbol","stubArray","getSymbols$1"],"mappings":";;AAIA,IAAIA,IAAc,OAAO,WAGrBC,IAAuBD,EAAY,sBAGnCE,IAAmB,OAAO,uBAS1BC,IAAcD,IAA+B,SAASE,GAAQ;AAChE,SAAIA,KAAU,OACL,MAETA,IAAS,OAAOA,CAAM,GACfC,EAAYH,EAAiBE,CAAM,GAAG,SAASE,GAAQ;AACrD,WAAAL,EAAqB,KAAKG,GAAQE,CAAM;AAAA,EAAA,CAChD;AACH,IARqCC;AAUrC,MAAAC,IAAeL;","x_google_ignoreList":[0]}

package/dist/index.es516.js

@@ -1,46 +1,7 @@
-import n from "./index.es386.js";
-import u from "./index.es532.js";
-import o from "./index.es470.js";
-import A from "./index.es515.js";
-import b from "./index.es533.js";
-import v from "./index.es488.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 !1;
+function r() {
+  return [];
 }
 export {
-  N as default
+  r as default
 };
 //# sourceMappingURL=index.es516.js.map

package/dist/index.es516.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es516.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,GAAK;AAAA,IACX,KAAKP;AACH,UAAKK,EAAO,cAAcC,EAAM,cAC3BD,EAAO,cAAcC,EAAM;AACvB,eAAA;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;AACzB,eAAA;AAGL,UAAAE,IAAUP,EAAM,IAAIN,CAAM;AAC9B,UAAIa;AACF,eAAOA,KAAWZ;AAET,MAAAE,KAAAnB,GAGLsB,EAAA,IAAIN,GAAQC,CAAK;AACnB,UAAAa,IAASC,EAAYN,EAAQT,CAAM,GAAGS,EAAQR,CAAK,GAAGE,GAASC,GAAYC,GAAWC,CAAK;AACzF,aAAAA,EAAA,OAAUN,CAAM,GACfc;AAAA,IAET,KAAKrB;AACH,UAAIK;AACF,eAAOA,EAAc,KAAKE,CAAM,KAAKF,EAAc,KAAKG,CAAK;AAAA,EAEnE;AACO,SAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es516.js","sources":["../../../node_modules/lodash-es/stubArray.js"],"sourcesContent":["/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n"],"names":["stubArray"],"mappings":"AAkBA,SAASA,IAAY;AACnB,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/index.es517.js

@@ -1,37 +1,41 @@
-import x from "./index.es534.js";
-var q = 1, E = Object.prototype, F = E.hasOwnProperty;
-function I(r, n, A, a, R, f) {
-  var v = A & q, d = x(r), e = d.length, S = x(n), _ = S.length;
-  if (e != _ && !v)
+import D from "./index.es380.js";
+import G from "./index.es433.js";
+import M from "./index.es384.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;
-  for (var l = e; l--; ) {
-    var i = d[l];
-    if (!(v ? i in n : F.call(n, i)))
-      return !1;
-  }
-  var O = f.get(r), w = f.get(n);
-  if (O && w)
-    return O == n && w == r;
-  var s = !0;
-  f.set(r, n), f.set(n, r);
-  for (var t = v; ++l < e; ) {
-    i = d[l];
-    var p = r[i], P = n[i];
-    if (a)
-      var L = v ? a(P, p, i, n, r, f) : a(p, P, i, r, n, f);
-    if (!(L === void 0 ? p === P || R(p, P, A, a, f) : L)) {
-      s = !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;
     }
-    t || (t = i == "constructor");
-  }
-  if (s && !t) {
-    var g = r.constructor, u = n.constructor;
-    g != u && "constructor" in r && "constructor" in n && !(typeof g == "function" && g instanceof g && typeof u == "function" && u instanceof u) && (s = !1);
   }
-  return f.delete(r), f.delete(n), s;
+  return f.delete(n), f.delete(e), g;
 }
 export {
-  I as default
+  U as default
 };
 //# sourceMappingURL=index.es517.js.map

package/dist/index.es517.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es517.js","sources":["../../../node_modules/lodash-es/_equalObjects.js"],"sourcesContent":["import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object 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 equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nexport default equalObjects;\n"],"names":["COMPARE_PARTIAL_FLAG","objectProto","hasOwnProperty","equalObjects","object","other","bitmask","customizer","equalFunc","stack","isPartial","objProps","getAllKeys","objLength","othProps","othLength","index","key","objStacked","othStacked","result","skipCtor","objValue","othValue","compared","objCtor","othCtor"],"mappings":";AAGA,IAAIA,IAAuB,GAGvBC,IAAc,OAAO,WAGrBC,IAAiBD,EAAY;AAejC,SAASE,EAAaC,GAAQC,GAAOC,GAASC,GAAYC,GAAWC,GAAO;AAC1E,MAAIC,IAAYJ,IAAUN,GACtBW,IAAWC,EAAWR,CAAM,GAC5BS,IAAYF,EAAS,QACrBG,IAAWF,EAAWP,CAAK,GAC3BU,IAAYD,EAAS;AAErB,MAAAD,KAAaE,KAAa,CAACL;AACtB,WAAA;AAGT,WADIM,IAAQH,GACLG,OAAS;AACV,QAAAC,IAAMN,EAASK,CAAK;AACpB,QAAA,EAAEN,IAAYO,KAAOZ,IAAQH,EAAe,KAAKG,GAAOY,CAAG;AACtD,aAAA;AAAA,EAEX;AAEI,MAAAC,IAAaT,EAAM,IAAIL,CAAM,GAC7Be,IAAaV,EAAM,IAAIJ,CAAK;AAChC,MAAIa,KAAcC;AACT,WAAAD,KAAcb,KAASc,KAAcf;AAE9C,MAAIgB,IAAS;AACP,EAAAX,EAAA,IAAIL,GAAQC,CAAK,GACjBI,EAAA,IAAIJ,GAAOD,CAAM;AAGhB,WADHiB,IAAWX,GACR,EAAEM,IAAQH,KAAW;AAC1B,IAAAI,IAAMN,EAASK,CAAK;AACpB,QAAIM,IAAWlB,EAAOa,CAAG,GACrBM,IAAWlB,EAAMY,CAAG;AAExB,QAAIV;AACF,UAAIiB,IAAWd,IACXH,EAAWgB,GAAUD,GAAUL,GAAKZ,GAAOD,GAAQK,CAAK,IACxDF,EAAWe,GAAUC,GAAUN,GAAKb,GAAQC,GAAOI,CAAK;AAG9D,QAAI,EAAEe,MAAa,SACVF,MAAaC,KAAYf,EAAUc,GAAUC,GAAUjB,GAASC,GAAYE,CAAK,IAClFe,IACD;AACI,MAAAJ,IAAA;AACT;AAAA,IACF;AACA,IAAAC,MAAaA,IAAWJ,KAAO;AAAA,EACjC;AACI,MAAAG,KAAU,CAACC,GAAU;AACvB,QAAII,IAAUrB,EAAO,aACjBsB,IAAUrB,EAAM;AAGpB,IAAIoB,KAAWC,KACV,iBAAiBtB,KAAU,iBAAiBC,KAC7C,EAAE,OAAOoB,KAAW,cAAcA,aAAmBA,KACnD,OAAOC,KAAW,cAAcA,aAAmBA,OAC9CN,IAAA;AAAA,EAEb;AACM,SAAAX,EAAA,OAAUL,CAAM,GAChBK,EAAA,OAAUJ,CAAK,GACde;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es517.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;AAChD,WAAA;AAGL,MAAAE,IAAaJ,EAAM,IAAIL,CAAK,GAC5BU,IAAaL,EAAM,IAAIJ,CAAK;AAChC,MAAIQ,KAAcC;AACT,WAAAD,KAAcR,KAASS,KAAcV;AAE1C,MAAAW,IAAQ,IACRC,IAAS,IACTC,IAAQX,IAAUJ,IAA0B,IAAIgB,EAAW,IAAA;AAMxD,OAJDT,EAAA,IAAIL,GAAOC,CAAK,GAChBI,EAAA,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;AAEO,MAAAL,IAAA;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;AAC7E,iBAAAQ,EAAK,KAAKM,CAAQ;AAAA,MAC3B,CACD,GAAG;AACG,QAAAP,IAAA;AACT;AAAA,MACF;AAAA,eACS,EACLG,MAAaC,KACXZ,EAAUW,GAAUC,GAAUd,GAASC,GAAYE,CAAK,IACzD;AACI,MAAAO,IAAA;AACT;AAAA,IACF;AAAA,EACF;AACM,SAAAP,EAAA,OAAUL,CAAK,GACfK,EAAA,OAAUJ,CAAK,GACdW;AACT;","x_google_ignoreList":[0]}