@performant-software/controlled-vocabulary 3.0.1 → 3.0.2-beta.1

package/dist/index.es513.js

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

package/dist/index.es513.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es513.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.es513.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.es514.js

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

package/dist/index.es514.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es514.js","sources":["../../../node_modules/lodash-es/_freeGlobal.js"],"sourcesContent":["/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n"],"names":["freeGlobal"],"mappings":"AACA,IAAIA,IAAa,OAAO,UAAU,YAAY,UAAU,OAAO,WAAW,UAAU;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es514.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,4 +1,4 @@
-import o from "./index.es429.js";
+import o from "./index.es428.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) {

package/dist/index.es517.js

@@ -1,41 +1,10 @@
-import D from "./index.es378.js";
-import G from "./index.es433.js";
-import M from "./index.es382.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 s from "./index.es426.js";
+function b(n, r, t, e) {
+  return s(n, function(o, f, i) {
+    r(e, t(o), f, i);
+  }), e;
 }
 export {
-  U as default
+  b 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/_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.es517.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,EAAA,CACjD,GACMG;AACT;","x_google_ignoreList":[0]}

package/dist/index.es518.js

@@ -1,46 +1,41 @@
-import n from "./index.es394.js";
-import u from "./index.es532.js";
-import o from "./index.es482.js";
-import A from "./index.es517.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);
+import D from "./index.es378.js";
+import G from "./index.es433.js";
+import M from "./index.es382.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 !1;
+  return f.delete(n), f.delete(e), g;
 }
 export {
-  N as default
+  U as default
 };
 //# sourceMappingURL=index.es518.js.map

package/dist/index.es518.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es518.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.es518.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]}

package/dist/index.es519.js

@@ -1,37 +1,46 @@
-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)
-    return !1;
-  for (var l = e; l--; ) {
-    var i = d[l];
-    if (!(v ? i in n : F.call(n, i)))
-      return !1;
+import n from "./index.es386.js";
+import u from "./index.es552.js";
+import o from "./index.es495.js";
+import A from "./index.es518.js";
+import b from "./index.es553.js";
+import v from "./index.es494.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);
   }
-  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;
-      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 !1;
 }
 export {
-  I as default
+  N as default
 };
 //# sourceMappingURL=index.es519.js.map

package/dist/index.es519.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es519.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.es519.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]}

package/dist/index.es520.js

@@ -1,10 +1,37 @@
-import s from "./index.es422.js";
-function b(n, r, t, e) {
-  return s(n, function(o, f, i) {
-    r(e, t(o), f, i);
-  }), e;
+import x from "./index.es554.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)
+    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;
+      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;
 }
 export {
-  b as default
+  I as default
 };
 //# sourceMappingURL=index.es520.js.map

package/dist/index.es520.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es520.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,EAAA,CACjD,GACMG;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es520.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]}

package/dist/index.es521.js

@@ -1,5 +1,5 @@
-import o from "./index.es315.js";
-import e from "./index.es554.js";
+import o from "./index.es318.js";
+import e from "./index.es551.js";
 import a from "./index.es350.js";
 import n from "./index.es480.js";
 var p = /[\\^$.*+?()[\]{}|]/g, i = /^\[object .+?Constructor\]$/, s = Function.prototype, c = Object.prototype, f = s.toString, m = c.hasOwnProperty, u = RegExp(

package/dist/index.es523.js

@@ -1,21 +1,15 @@
-import p from "./index.es556.js";
-import a from "./index.es557.js";
-import l from "./index.es558.js";
-import s from "./index.es559.js";
-import m from "./index.es560.js";
-function t(o) {
-  var e = -1, h = o == null ? 0 : o.length;
-  for (this.clear(); ++e < h; ) {
-    var r = o[e];
-    this.set(r[0], r[1]);
+import w from "./index.es450.js";
+function B(n, r) {
+  if (n !== r) {
+    var d = n !== void 0, j = n === null, c = n === n, p = w(n), k = r !== void 0, q = r === null, g = r === r, A = w(r);
+    if (!q && !A && !p && n > r || p && k && g && !q && !A || j && k && g || !d && g || !c)
+      return 1;
+    if (!j && !p && !A && n < r || A && d && c && !j && !p || q && d && c || !k && c || !g)
+      return -1;
   }
+  return 0;
 }
-t.prototype.clear = p;
-t.prototype.delete = a;
-t.prototype.get = l;
-t.prototype.has = s;
-t.prototype.set = m;
 export {
-  t as default
+  B as default
 };
 //# sourceMappingURL=index.es523.js.map

package/dist/index.es523.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es523.js","sources":["../../../node_modules/lodash-es/_Hash.js"],"sourcesContent":["import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n"],"names":["Hash","entries","index","length","entry","hashClear","hashDelete","hashGet","hashHas","hashSet"],"mappings":";;;;;AAaA,SAASA,EAAKC,GAAS;AACrB,MAAIC,IAAQ,IACRC,IAASF,KAAW,OAAO,IAAIA,EAAQ;AAGpC,OADP,KAAK,MAAM,GACJ,EAAEC,IAAQC,KAAQ;AACnB,QAAAC,IAAQH,EAAQC,CAAK;AACzB,SAAK,IAAIE,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAJ,EAAK,UAAU,QAAQK;AACvBL,EAAK,UAAU,SAAYM;AAC3BN,EAAK,UAAU,MAAMO;AACrBP,EAAK,UAAU,MAAMQ;AACrBR,EAAK,UAAU,MAAMS;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es523.js","sources":["../../../node_modules/lodash-es/_compareAscending.js"],"sourcesContent":["import isSymbol from './isSymbol.js';\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nexport default compareAscending;\n"],"names":["compareAscending","value","other","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","isSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol"],"mappings":";AAUA,SAASA,EAAiBC,GAAOC,GAAO;AACtC,MAAID,MAAUC,GAAO;AACf,QAAAC,IAAeF,MAAU,QACzBG,IAAYH,MAAU,MACtBI,IAAiBJ,MAAUA,GAC3BK,IAAcC,EAASN,CAAK,GAE5BO,IAAeN,MAAU,QACzBO,IAAYP,MAAU,MACtBQ,IAAiBR,MAAUA,GAC3BS,IAAcJ,EAASL,CAAK;AAE3B,QAAA,CAACO,KAAa,CAACE,KAAe,CAACL,KAAeL,IAAQC,KACtDI,KAAeE,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEP,KAAaI,KAAgBE,KAC7B,CAACP,KAAgBO,KAClB,CAACL;AACI,aAAA;AAEJ,QAAA,CAACD,KAAa,CAACE,KAAe,CAACK,KAAeV,IAAQC,KACtDS,KAAeR,KAAgBE,KAAkB,CAACD,KAAa,CAACE,KAChEG,KAAaN,KAAgBE,KAC7B,CAACG,KAAgBH,KAClB,CAACK;AACI,aAAA;AAAA,EAEX;AACO,SAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es524.js

@@ -1,20 +1,20 @@
-import p from "./index.es561.js";
-import a from "./index.es562.js";
-import i from "./index.es563.js";
-import h from "./index.es564.js";
-import s from "./index.es565.js";
-function t(e) {
-  var o = -1, l = e == null ? 0 : e.length;
-  for (this.clear(); ++o < l; ) {
-    var r = e[o];
+import p from "./index.es556.js";
+import a from "./index.es557.js";
+import l from "./index.es558.js";
+import s from "./index.es559.js";
+import m from "./index.es560.js";
+function t(o) {
+  var e = -1, h = o == null ? 0 : o.length;
+  for (this.clear(); ++e < h; ) {
+    var r = o[e];
     this.set(r[0], r[1]);
   }
 }
 t.prototype.clear = p;
 t.prototype.delete = a;
-t.prototype.get = i;
-t.prototype.has = h;
-t.prototype.set = s;
+t.prototype.get = l;
+t.prototype.has = s;
+t.prototype.set = m;
 export {
   t as default
 };

package/dist/index.es524.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es524.js","sources":["../../../node_modules/lodash-es/_ListCache.js"],"sourcesContent":["import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n"],"names":["ListCache","entries","index","length","entry","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet"],"mappings":";;;;;AAaA,SAASA,EAAUC,GAAS;AAC1B,MAAIC,IAAQ,IACRC,IAASF,KAAW,OAAO,IAAIA,EAAQ;AAGpC,OADP,KAAK,MAAM,GACJ,EAAEC,IAAQC,KAAQ;AACnB,QAAAC,IAAQH,EAAQC,CAAK;AACzB,SAAK,IAAIE,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAJ,EAAU,UAAU,QAAQK;AAC5BL,EAAU,UAAU,SAAYM;AAChCN,EAAU,UAAU,MAAMO;AAC1BP,EAAU,UAAU,MAAMQ;AAC1BR,EAAU,UAAU,MAAMS;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es524.js","sources":["../../../node_modules/lodash-es/_Hash.js"],"sourcesContent":["import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n"],"names":["Hash","entries","index","length","entry","hashClear","hashDelete","hashGet","hashHas","hashSet"],"mappings":";;;;;AAaA,SAASA,EAAKC,GAAS;AACrB,MAAIC,IAAQ,IACRC,IAASF,KAAW,OAAO,IAAIA,EAAQ;AAGpC,OADP,KAAK,MAAM,GACJ,EAAEC,IAAQC,KAAQ;AACnB,QAAAC,IAAQH,EAAQC,CAAK;AACzB,SAAK,IAAIE,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAJ,EAAK,UAAU,QAAQK;AACvBL,EAAK,UAAU,SAAYM;AAC3BN,EAAK,UAAU,MAAMO;AACrBP,EAAK,UAAU,MAAMQ;AACrBR,EAAK,UAAU,MAAMS;","x_google_ignoreList":[0]}

package/dist/index.es525.js

@@ -1,9 +1,21 @@
-import e from "./index.es555.js";
-function n(r, a) {
-  var t = r.__data__;
-  return e(a) ? t[typeof a == "string" ? "string" : "hash"] : t.map;
+import p from "./index.es561.js";
+import a from "./index.es562.js";
+import i from "./index.es563.js";
+import h from "./index.es564.js";
+import s from "./index.es565.js";
+function t(e) {
+  var o = -1, l = e == null ? 0 : e.length;
+  for (this.clear(); ++o < l; ) {
+    var r = e[o];
+    this.set(r[0], r[1]);
+  }
 }
+t.prototype.clear = p;
+t.prototype.delete = a;
+t.prototype.get = i;
+t.prototype.has = h;
+t.prototype.set = s;
 export {
-  n as default
+  t as default
 };
 //# sourceMappingURL=index.es525.js.map

package/dist/index.es525.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es525.js","sources":["../../../node_modules/lodash-es/_getMapData.js"],"sourcesContent":["import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n"],"names":["getMapData","map","key","data","isKeyable"],"mappings":";AAUA,SAASA,EAAWC,GAAKC,GAAK;AAC5B,MAAIC,IAAOF,EAAI;AACR,SAAAG,EAAUF,CAAG,IAChBC,EAAK,OAAOD,KAAO,WAAW,WAAW,MAAM,IAC/CC,EAAK;AACX;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es525.js","sources":["../../../node_modules/lodash-es/_ListCache.js"],"sourcesContent":["import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n"],"names":["ListCache","entries","index","length","entry","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet"],"mappings":";;;;;AAaA,SAASA,EAAUC,GAAS;AAC1B,MAAIC,IAAQ,IACRC,IAASF,KAAW,OAAO,IAAIA,EAAQ;AAGpC,OADP,KAAK,MAAM,GACJ,EAAEC,IAAQC,KAAQ;AACnB,QAAAC,IAAQH,EAAQC,CAAK;AACzB,SAAK,IAAIE,EAAM,CAAC,GAAGA,EAAM,CAAC,CAAC;AAAA,EAC7B;AACF;AAGAJ,EAAU,UAAU,QAAQK;AAC5BL,EAAU,UAAU,SAAYM;AAChCN,EAAU,UAAU,MAAMO;AAC1BP,EAAU,UAAU,MAAMQ;AAC1BR,EAAU,UAAU,MAAMS;","x_google_ignoreList":[0]}