@performant-software/core-data 2.2.2-beta.1 → 2.2.2-beta.3

package/dist/index.es274.js

@@ -1,8 +1,18 @@
-import f from "./index.es356.js";
-function n(t, e) {
-  return f(t, e, !1);
+import u from "./index.es340.js";
+import f from "./index.es253.js";
+function v(o) {
+  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
+    var e = o[n];
+    if (!f(t, e)) {
+      var r;
+      for (r = 1; r < a && f(arguments[r], e); r++)
+        ;
+      r === a && t.push(e);
+    }
+  }
+  return t;
 }
 export {
-  n as default
+  v as default
 };
 //# sourceMappingURL=index.es274.js.map

package/dist/index.es274.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es274.js","sources":["../../../node_modules/underscore/modules/flatten.js"],"sourcesContent":["import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n  return _flatten(array, depth, false);\n}\n"],"names":["flatten","array","depth","_flatten"],"mappings":";AAIwB,SAAAA,EAAQC,GAAOC,GAAO;AACrC,SAAAC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es274.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}

package/dist/index.es275.js

@@ -1,16 +1,12 @@
-import b from "./index.es185.js";
-import q from "./index.es349.js";
-import B from "./index.es340.js";
-import r from "./index.es255.js";
-function w(l, p, f, g) {
-  b(p) || (g = f, f = p, p = !1), f != null && (f = q(f, g));
-  for (var s = [], h = [], o = 0, u = B(l); o < u; o++) {
-    var n = l[o], m = f ? f(n, o, l) : n;
-    p && !f ? ((!o || h !== m) && s.push(n), h = m) : f ? r(h, m) || (h.push(m), s.push(n)) : r(s, n) || s.push(n);
-  }
-  return s;
+import f from "./index.es256.js";
+import p from "./index.es340.js";
+import u from "./index.es254.js";
+function n(t) {
+  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
+    m[r] = u(t, r);
+  return m;
 }
 export {
-  w as default
+  n as default
 };
 //# sourceMappingURL=index.es275.js.map

package/dist/index.es275.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es275.js","sources":["../../../node_modules/underscore/modules/uniq.js"],"sourcesContent":["import isBoolean from './isBoolean.js';\nimport cb from './_cb.js';\nimport getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce a duplicate-free version of the array. If the array has already\n// been sorted, you have the option of using a faster algorithm.\n// The faster algorithm will not work with an iteratee if the iteratee\n// is not a one-to-one function, so providing an iteratee will disable\n// the faster algorithm.\nexport default function uniq(array, isSorted, iteratee, context) {\n  if (!isBoolean(isSorted)) {\n    context = iteratee;\n    iteratee = isSorted;\n    isSorted = false;\n  }\n  if (iteratee != null) iteratee = cb(iteratee, context);\n  var result = [];\n  var seen = [];\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var value = array[i],\n        computed = iteratee ? iteratee(value, i, array) : value;\n    if (isSorted && !iteratee) {\n      if (!i || seen !== computed) result.push(value);\n      seen = computed;\n    } else if (iteratee) {\n      if (!contains(seen, computed)) {\n        seen.push(computed);\n        result.push(value);\n      }\n    } else if (!contains(result, value)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n"],"names":["uniq","array","isSorted","iteratee","context","isBoolean","cb","result","seen","i","length","getLength","value","computed","contains"],"mappings":";;;;AAUA,SAAwBA,EAAKC,GAAOC,GAAUC,GAAUC,GAAS;AAC3D,EAACC,EAAUH,CAAQ,MACXE,IAAAD,GACCA,IAAAD,GACAA,IAAA,KAETC,KAAY,SAAiBA,IAAAG,EAAGH,GAAUC,CAAO;AAG5C,WAFLG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AAClD,IAAAV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GACvCJ,IAAAK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es275.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es276.js

@@ -1,18 +1,10 @@
-import u from "./index.es340.js";
-import f from "./index.es255.js";
-function v(o) {
-  for (var t = [], a = arguments.length, n = 0, s = u(o); n < s; n++) {
-    var e = o[n];
-    if (!f(t, e)) {
-      var r;
-      for (r = 1; r < a && f(arguments[r], e); r++)
-        ;
-      r === a && t.push(e);
-    }
-  }
-  return t;
+import n from "./index.es340.js";
+function u(e, t) {
+  for (var o = {}, r = 0, f = n(e); r < f; r++)
+    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
+  return o;
 }
 export {
-  v as default
+  u as default
 };
 //# sourceMappingURL=index.es276.js.map

package/dist/index.es276.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es276.js","sources":["../../../node_modules/underscore/modules/intersection.js"],"sourcesContent":["import getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce an array that contains every item shared between all the\n// passed-in arrays.\nexport default function intersection(array) {\n  var result = [];\n  var argsLength = arguments.length;\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var item = array[i];\n    if (contains(result, item)) continue;\n    var j;\n    for (j = 1; j < argsLength; j++) {\n      if (!contains(arguments[j], item)) break;\n    }\n    if (j === argsLength) result.push(item);\n  }\n  return result;\n}\n"],"names":["intersection","array","result","argsLength","i","length","getLength","item","contains","j"],"mappings":";;AAKA,SAAwBA,EAAaC,GAAO;AAGjC,WAFLC,IAAS,CAAA,GACTC,IAAa,UAAU,QAClBC,IAAI,GAAGC,IAASC,EAAUL,CAAK,GAAGG,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAON,EAAMG,CAAC;AACd,QAAA,CAAAI,EAASN,GAAQK,CAAI,GACrB;AAAA,UAAAE;AACJ,WAAKA,IAAI,GAAGA,IAAIN,KACTK,EAAS,UAAUC,CAAC,GAAGF,CAAI,GADNE;AAC1B;AAEF,MAAIA,MAAMN,KAAYD,EAAO,KAAKK,CAAI;AAAA;AAAA,EACxC;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es276.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}

package/dist/index.es277.js

@@ -1,12 +1,10 @@
-import f from "./index.es258.js";
-import p from "./index.es340.js";
-import u from "./index.es256.js";
-function n(t) {
-  for (var o = t && f(t, p).length || 0, m = Array(o), r = 0; r < o; r++)
-    m[r] = u(t, r);
-  return m;
+function u(n, a, r) {
+  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
+  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
+    e[f] = n;
+  return e;
 }
 export {
-  n as default
+  u as default
 };
 //# sourceMappingURL=index.es277.js.map

package/dist/index.es277.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es277.js","sources":["../../../node_modules/underscore/modules/unzip.js"],"sourcesContent":["import max from './max.js';\nimport getLength from './_getLength.js';\nimport pluck from './pluck.js';\n\n// Complement of zip. Unzip accepts an array of arrays and groups\n// each array's elements on shared indices.\nexport default function unzip(array) {\n  var length = (array && max(array, getLength).length) || 0;\n  var result = Array(length);\n\n  for (var index = 0; index < length; index++) {\n    result[index] = pluck(array, index);\n  }\n  return result;\n}\n"],"names":["unzip","array","length","max","getLength","result","index","pluck"],"mappings":";;;AAMA,SAAwBA,EAAMC,GAAO;AAInC,WAHIC,IAAUD,KAASE,EAAIF,GAAOG,CAAS,EAAE,UAAW,GACpDC,IAAS,MAAMH,CAAM,GAEhBI,IAAQ,GAAGA,IAAQJ,GAAQI;AAClC,IAAAD,EAAOC,CAAK,IAAIC,EAAMN,GAAOK,CAAK;AAE7B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es277.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}

package/dist/index.es278.js

@@ -1,10 +1,12 @@
-import n from "./index.es340.js";
-function u(e, t) {
-  for (var o = {}, r = 0, f = n(e); r < f; r++)
-    t ? o[e[r]] = t[r] : o[e[r][0]] = e[r][1];
-  return o;
+import { slice as n } from "./index.es52.js";
+function h(r, l) {
+  if (l == null || l < 1)
+    return [];
+  for (var t = [], e = 0, i = r.length; e < i; )
+    t.push(n.call(r, e, e += l));
+  return t;
 }
 export {
-  u as default
+  h as default
 };
 //# sourceMappingURL=index.es278.js.map

package/dist/index.es278.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es278.js","sources":["../../../node_modules/underscore/modules/object.js"],"sourcesContent":["import getLength  from './_getLength.js';\n\n// Converts lists into objects. Pass either a single array of `[key, value]`\n// pairs, or two parallel arrays of the same length -- one of keys, and one of\n// the corresponding values. Passing by pairs is the reverse of `_.pairs`.\nexport default function object(list, values) {\n  var result = {};\n  for (var i = 0, length = getLength(list); i < length; i++) {\n    if (values) {\n      result[list[i]] = values[i];\n    } else {\n      result[list[i][0]] = list[i][1];\n    }\n  }\n  return result;\n}\n"],"names":["object","list","values","result","i","length","getLength"],"mappings":";AAKwB,SAAAA,EAAOC,GAAMC,GAAQ;AAElC,WADLC,IAAS,CAAA,GACJC,IAAI,GAAGC,IAASC,EAAUL,CAAI,GAAGG,IAAIC,GAAQD;AACpD,IAAIF,IACFC,EAAOF,EAAKG,CAAC,CAAC,IAAIF,EAAOE,CAAC,IAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,IAAIH,EAAKG,CAAC,EAAE,CAAC;AAG3B,SAAAD;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es278.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}

package/dist/index.es279.js

@@ -1,10 +1,5 @@
-function u(n, a, r) {
-  a == null && (a = n || 0, n = 0), r || (r = a < n ? -1 : 1);
-  for (var l = Math.max(Math.ceil((a - n) / r), 0), e = Array(l), f = 0; f < l; f++, n += r)
-    e[f] = n;
-  return e;
-}
+var r = {};
 export {
-  u as default
+  r as __exports
 };
 //# sourceMappingURL=index.es279.js.map

package/dist/index.es279.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es279.js","sources":["../../../node_modules/underscore/modules/range.js"],"sourcesContent":["// Generate an integer Array containing an arithmetic progression. A port of\n// the native Python `range()` function. See\n// [the Python documentation](https://docs.python.org/library/functions.html#range).\nexport default function range(start, stop, step) {\n  if (stop == null) {\n    stop = start || 0;\n    start = 0;\n  }\n  if (!step) {\n    step = stop < start ? -1 : 1;\n  }\n\n  var length = Math.max(Math.ceil((stop - start) / step), 0);\n  var range = Array(length);\n\n  for (var idx = 0; idx < length; idx++, start += step) {\n    range[idx] = start;\n  }\n\n  return range;\n}\n"],"names":["range","start","stop","step","length","idx"],"mappings":"AAGwB,SAAAA,EAAMC,GAAOC,GAAMC,GAAM;AAC/C,EAAID,KAAQ,SACVA,IAAOD,KAAS,GACRA,IAAA,IAELE,MACIA,IAAAD,IAAOD,IAAQ,KAAK;AAM7B,WAHIG,IAAS,KAAK,IAAI,KAAK,MAAMF,IAAOD,KAASE,CAAI,GAAG,CAAC,GACrDH,IAAQ,MAAMI,CAAM,GAEfC,IAAM,GAAGA,IAAMD,GAAQC,KAAOJ,KAASE;AAC9CH,IAAAA,EAAMK,CAAG,IAAIJ;AAGRD,SAAAA;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es279.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es280.js

@@ -1,12 +1,5 @@
-import { slice as n } from "./index.es52.js";
-function h(r, l) {
-  if (l == null || l < 1)
-    return [];
-  for (var t = [], e = 0, i = r.length; e < i; )
-    t.push(n.call(r, e, e += l));
-  return t;
-}
+var e = {};
 export {
-  h as default
+  e as __exports
 };
 //# sourceMappingURL=index.es280.js.map

package/dist/index.es280.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es280.js","sources":["../../../node_modules/underscore/modules/chunk.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Chunk a single array into multiple arrays, each containing `count` or fewer\n// items.\nexport default function chunk(array, count) {\n  if (count == null || count < 1) return [];\n  var result = [];\n  var i = 0, length = array.length;\n  while (i < length) {\n    result.push(slice.call(array, i, i += count));\n  }\n  return result;\n}\n"],"names":["chunk","array","count","result","i","length","slice"],"mappings":";AAIwB,SAAAA,EAAMC,GAAOC,GAAO;AACtC,MAAAA,KAAS,QAAQA,IAAQ;AAAG,WAAO;AAGvC,WAFIC,IAAS,CAAA,GACTC,IAAI,GAAGC,IAASJ,EAAM,QACnBG,IAAIC;AACT,IAAAF,EAAO,KAAKG,EAAM,KAAKL,GAAOG,GAAGA,KAAKF,CAAK,CAAC;AAEvC,SAAAC;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es280.js","sources":[],"sourcesContent":[],"names":[],"mappings":";"}

package/dist/index.es288.js

@@ -1,4 +1,4 @@
-import { commonjsGlobal as u } from "./index.es153.js";
+import { commonjsGlobal as u } from "./index.es149.js";
 import { __exports as i } from "./index.es371.js";
 import { __require as d } from "./index.es372.js";
 import { __require as b } from "./index.es373.js";

package/dist/index.es294.js

@@ -1,31 +1,7 @@
-var p = function() {
-  return p = Object.assign || function(e) {
-    for (var n, r = 1, o = arguments.length; r < o; r++) {
-      n = arguments[r];
-      for (var a in n)
-        Object.prototype.hasOwnProperty.call(n, a) && (e[a] = n[a]);
-    }
-    return e;
-  }, p.apply(this, arguments);
+const o = typeof crypto < "u" && crypto.randomUUID && crypto.randomUUID.bind(crypto), t = {
+  randomUUID: o
 };
-function c(t, e) {
-  var n = {};
-  for (var r in t)
-    Object.prototype.hasOwnProperty.call(t, r) && e.indexOf(r) < 0 && (n[r] = t[r]);
-  if (t != null && typeof Object.getOwnPropertySymbols == "function")
-    for (var o = 0, r = Object.getOwnPropertySymbols(t); o < r.length; o++)
-      e.indexOf(r[o]) < 0 && Object.prototype.propertyIsEnumerable.call(t, r[o]) && (n[r[o]] = t[r[o]]);
-  return n;
-}
-function l(t, e, n) {
-  if (n || arguments.length === 2)
-    for (var r = 0, o = e.length, a; r < o; r++)
-      (a || !(r in e)) && (a || (a = Array.prototype.slice.call(e, 0, r)), a[r] = e[r]);
-  return t.concat(a || Array.prototype.slice.call(e));
-}
 export {
-  p as __assign,
-  c as __rest,
-  l as __spreadArray
+  t as default
 };
 //# sourceMappingURL=index.es294.js.map

package/dist/index.es294.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es294.js","sources":["../../../node_modules/tslib/tslib.es6.mjs"],"sourcesContent":["/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\n  else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n  return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\n          if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\n  function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\n  return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\n  function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\n  if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose;\n    if (async) {\n        if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n        dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n        if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n        dispose = value[Symbol.dispose];\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  function next() {\n    while (env.stack.length) {\n      var rec = env.stack.pop();\n      try {\n        var result = rec.dispose && rec.dispose.call(rec.value);\n        if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n      }\n      catch (e) {\n          fail(e);\n      }\n    }\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n};\n"],"names":["__assign","t","s","i","n","p","__rest","__spreadArray","to","from","pack","l","ar"],"mappings":"AA+BU,IAACA,IAAW,WAAW;AAC/B,SAAAA,IAAW,OAAO,UAAU,SAAkBC,GAAG;AAC7C,aAASC,GAAGC,IAAI,GAAGC,IAAI,UAAU,QAAQD,IAAIC,GAAGD,KAAK;AACjD,MAAAD,IAAI,UAAUC,CAAC;AACf,eAASE,KAAKH;AAAG,QAAI,OAAO,UAAU,eAAe,KAAKA,GAAGG,CAAC,MAAGJ,EAAEI,CAAC,IAAIH,EAAEG,CAAC;AAAA,IAC9E;AACD,WAAOJ;AAAA,EACV,GACMD,EAAS,MAAM,MAAM,SAAS;AACvC;AAEO,SAASM,EAAOJ,GAAG,GAAG;AAC3B,MAAID,IAAI,CAAA;AACR,WAASI,KAAKH;AAAG,IAAI,OAAO,UAAU,eAAe,KAAKA,GAAGG,CAAC,KAAK,EAAE,QAAQA,CAAC,IAAI,MAC9EJ,EAAEI,CAAC,IAAIH,EAAEG,CAAC;AACd,MAAIH,KAAK,QAAQ,OAAO,OAAO,yBAA0B;AACrD,aAASC,IAAI,GAAGE,IAAI,OAAO,sBAAsBH,CAAC,GAAGC,IAAIE,EAAE,QAAQF;AAC/D,MAAI,EAAE,QAAQE,EAAEF,CAAC,CAAC,IAAI,KAAK,OAAO,UAAU,qBAAqB,KAAKD,GAAGG,EAAEF,CAAC,CAAC,MACzEF,EAAEI,EAAEF,CAAC,CAAC,IAAID,EAAEG,EAAEF,CAAC,CAAC;AAE5B,SAAOF;AACT;AAiKO,SAASM,EAAcC,GAAIC,GAAMC,GAAM;AAC5C,MAAIA,KAAQ,UAAU,WAAW;AAAG,aAASP,IAAI,GAAGQ,IAAIF,EAAK,QAAQG,GAAIT,IAAIQ,GAAGR;AAC5E,OAAIS,KAAM,EAAET,KAAKM,QACRG,MAAIA,IAAK,MAAM,UAAU,MAAM,KAAKH,GAAM,GAAGN,CAAC,IACnDS,EAAGT,CAAC,IAAIM,EAAKN,CAAC;AAGtB,SAAOK,EAAG,OAAOI,KAAM,MAAM,UAAU,MAAM,KAAKH,CAAI,CAAC;AACzD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es294.js","sources":["../../../node_modules/uuid/dist/esm-browser/native.js"],"sourcesContent":["const randomUUID = typeof crypto !== 'undefined' && crypto.randomUUID && crypto.randomUUID.bind(crypto);\nexport default {\n  randomUUID\n};"],"names":["randomUUID","native"],"mappings":"AAAA,MAAMA,IAAa,OAAO,SAAW,OAAe,OAAO,cAAc,OAAO,WAAW,KAAK,MAAM,GACvFC,IAAA;AAAA,EACb,YAAAD;AACF;","x_google_ignoreList":[0]}

package/dist/index.es295.js

@@ -1,32 +1,11 @@
-import { __rest as E, __assign as a } from "./index.es294.js";
-import * as r from "react";
-import { fullWidthClassName as Z, zeroRightClassName as k } from "./index.es383.js";
-import { effectCar as I } from "./index.es384.js";
-import { useMergeRefs as W } from "./index.es385.js";
-var l = function() {
-}, m = r.forwardRef(function(e, d) {
-  var o = r.useRef(null), n = r.useState({
-    onScrollCapture: l,
-    onWheelCapture: l,
-    onTouchMoveCapture: l
-  }), f = n[0], h = n[1], u = e.forwardProps, t = e.children, v = e.className, C = e.removeScrollBar, P = e.enabled, w = e.shards, R = e.sideCar, S = e.noIsolation, b = e.inert, g = e.allowPinchZoom, i = e.as, N = i === void 0 ? "div" : i, _ = E(e, ["forwardProps", "children", "className", "removeScrollBar", "enabled", "shards", "sideCar", "noIsolation", "inert", "allowPinchZoom", "as"]), B = R, s = W([o, d]), c = a(a({}, _), f);
-  return r.createElement(
-    r.Fragment,
-    null,
-    P && r.createElement(B, { sideCar: I, removeScrollBar: C, shards: w, noIsolation: S, inert: b, setCallbacks: h, allowPinchZoom: !!g, lockRef: o }),
-    u ? r.cloneElement(r.Children.only(t), a(a({}, c), { ref: s })) : r.createElement(N, a({}, c, { className: v, ref: s }), t)
-  );
-});
-m.defaultProps = {
-  enabled: !0,
-  removeScrollBar: !0,
-  inert: !1
-};
-m.classNames = {
-  fullWidth: Z,
-  zeroRight: k
-};
+let t;
+const e = new Uint8Array(16);
+function o() {
+  if (!t && (t = typeof crypto < "u" && crypto.getRandomValues && crypto.getRandomValues.bind(crypto), !t))
+    throw new Error("crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported");
+  return t(e);
+}
 export {
-  m as RemoveScroll
+  o as default
 };
 //# sourceMappingURL=index.es295.js.map

package/dist/index.es295.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es295.js","sources":["../../../node_modules/react-remove-scroll/dist/es2015/UI.js"],"sourcesContent":["import { __assign, __rest } from \"tslib\";\nimport * as React from 'react';\nimport { fullWidthClassName, zeroRightClassName } from 'react-remove-scroll-bar/constants';\nimport { useMergeRefs } from 'use-callback-ref';\nimport { effectCar } from './medium';\nvar nothing = function () {\n    return;\n};\n/**\n * Removes scrollbar from the page and contain the scroll within the Lock\n */\nvar RemoveScroll = React.forwardRef(function (props, parentRef) {\n    var ref = React.useRef(null);\n    var _a = React.useState({\n        onScrollCapture: nothing,\n        onWheelCapture: nothing,\n        onTouchMoveCapture: nothing,\n    }), callbacks = _a[0], setCallbacks = _a[1];\n    var forwardProps = props.forwardProps, children = props.children, className = props.className, removeScrollBar = props.removeScrollBar, enabled = props.enabled, shards = props.shards, sideCar = props.sideCar, noIsolation = props.noIsolation, inert = props.inert, allowPinchZoom = props.allowPinchZoom, _b = props.as, Container = _b === void 0 ? 'div' : _b, rest = __rest(props, [\"forwardProps\", \"children\", \"className\", \"removeScrollBar\", \"enabled\", \"shards\", \"sideCar\", \"noIsolation\", \"inert\", \"allowPinchZoom\", \"as\"]);\n    var SideCar = sideCar;\n    var containerRef = useMergeRefs([ref, parentRef]);\n    var containerProps = __assign(__assign({}, rest), callbacks);\n    return (React.createElement(React.Fragment, null,\n        enabled && (React.createElement(SideCar, { sideCar: effectCar, removeScrollBar: removeScrollBar, shards: shards, noIsolation: noIsolation, inert: inert, setCallbacks: setCallbacks, allowPinchZoom: !!allowPinchZoom, lockRef: ref })),\n        forwardProps ? (React.cloneElement(React.Children.only(children), __assign(__assign({}, containerProps), { ref: containerRef }))) : (React.createElement(Container, __assign({}, containerProps, { className: className, ref: containerRef }), children))));\n});\nRemoveScroll.defaultProps = {\n    enabled: true,\n    removeScrollBar: true,\n    inert: false,\n};\nRemoveScroll.classNames = {\n    fullWidth: fullWidthClassName,\n    zeroRight: zeroRightClassName,\n};\nexport { RemoveScroll };\n"],"names":["nothing","RemoveScroll","React","props","parentRef","ref","_a","callbacks","setCallbacks","forwardProps","children","className","removeScrollBar","enabled","shards","sideCar","noIsolation","inert","allowPinchZoom","_b","Container","rest","__rest","SideCar","containerRef","useMergeRefs","containerProps","__assign","effectCar","fullWidthClassName","zeroRightClassName"],"mappings":";;;;;AAKA,IAAIA,IAAU,WAAY;AAE1B,GAIIC,IAAeC,EAAM,WAAW,SAAUC,GAAOC,GAAW;AACxD,MAAAC,IAAMH,EAAM,OAAO,IAAI,GACvBI,IAAKJ,EAAM,SAAS;AAAA,IACpB,iBAAiBF;AAAA,IACjB,gBAAgBA;AAAA,IAChB,oBAAoBA;AAAA,EAAA,CACvB,GAAGO,IAAYD,EAAG,CAAC,GAAGE,IAAeF,EAAG,CAAC,GACtCG,IAAeN,EAAM,cAAcO,IAAWP,EAAM,UAAUQ,IAAYR,EAAM,WAAWS,IAAkBT,EAAM,iBAAiBU,IAAUV,EAAM,SAASW,IAASX,EAAM,QAAQY,IAAUZ,EAAM,SAASa,IAAcb,EAAM,aAAac,IAAQd,EAAM,OAAOe,IAAiBf,EAAM,gBAAgBgB,IAAKhB,EAAM,IAAIiB,IAAYD,MAAO,SAAS,QAAQA,GAAIE,IAAOC,EAAOnB,GAAO,CAAC,gBAAgB,YAAY,aAAa,mBAAmB,WAAW,UAAU,WAAW,eAAe,SAAS,kBAAkB,IAAI,CAAC,GAClgBoB,IAAUR,GACVS,IAAeC,EAAa,CAACpB,GAAKD,CAAS,CAAC,GAC5CsB,IAAiBC,EAASA,EAAS,CAAI,GAAAN,CAAI,GAAGd,CAAS;AAC3D,SAAQL,EAAM;AAAA,IAAcA,EAAM;AAAA,IAAU;AAAA,IACxCW,KAAYX,EAAM,cAAcqB,GAAS,EAAE,SAASK,GAAW,iBAAAhB,GAAkC,QAAAE,GAAgB,aAAAE,GAA0B,OAAAC,GAAc,cAAAT,GAA4B,gBAAgB,CAAC,CAACU,GAAgB,SAASb,GAAK;AAAA,IACrOI,IAAgBP,EAAM,aAAaA,EAAM,SAAS,KAAKQ,CAAQ,GAAGiB,EAASA,EAAS,CAAI,GAAAD,CAAc,GAAG,EAAE,KAAKF,EAAc,CAAA,CAAC,IAAMtB,EAAM,cAAckB,GAAWO,EAAS,CAAA,GAAID,GAAgB,EAAE,WAAAf,GAAsB,KAAKa,EAAc,CAAA,GAAGd,CAAQ;AAAA,EAAA;AAC/P,CAAC;AACDT,EAAa,eAAe;AAAA,EACxB,SAAS;AAAA,EACT,iBAAiB;AAAA,EACjB,OAAO;AACX;AACAA,EAAa,aAAa;AAAA,EACtB,WAAW4B;AAAA,EACX,WAAWC;AACf;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es295.js","sources":["../../../node_modules/uuid/dist/esm-browser/rng.js"],"sourcesContent":["// Unique ID creation requires a high quality random # generator. In the browser we therefore\n// require the crypto API and do not support built-in fallback to lower quality random number\n// generators (like Math.random()).\nlet getRandomValues;\nconst rnds8 = new Uint8Array(16);\nexport default function rng() {\n  // lazy load so that environments that need to polyfill have a chance to do so\n  if (!getRandomValues) {\n    // getRandomValues needs to be invoked in a context where \"this\" is a Crypto implementation.\n    getRandomValues = typeof crypto !== 'undefined' && crypto.getRandomValues && crypto.getRandomValues.bind(crypto);\n\n    if (!getRandomValues) {\n      throw new Error('crypto.getRandomValues() not supported. See https://github.com/uuidjs/uuid#getrandomvalues-not-supported');\n    }\n  }\n\n  return getRandomValues(rnds8);\n}"],"names":["getRandomValues","rnds8","rng"],"mappings":"AAGA,IAAIA;AACJ,MAAMC,IAAQ,IAAI,WAAW,EAAE;AAC/B,SAAwBC,IAAM;AAE5B,MAAI,CAACF,MAEeA,IAAA,OAAO,SAAW,OAAe,OAAO,mBAAmB,OAAO,gBAAgB,KAAK,MAAM,GAE3G,CAACA;AACG,UAAA,IAAI,MAAM,0GAA0G;AAI9H,SAAOA,EAAgBC,CAAK;AAC9B;","x_google_ignoreList":[0]}

package/dist/index.es296.js

@@ -1,8 +1,10 @@
-import { RemoveScrollSideCar as r } from "./index.es386.js";
-import { effectCar as o } from "./index.es384.js";
-import { exportSidecar as e } from "./index.es387.js";
-const f = e(o, r);
+const i = [];
+for (let n = 0; n < 256; ++n)
+  i.push((n + 256).toString(16).slice(1));
+function c(n, u = 0) {
+  return i[n[u + 0]] + i[n[u + 1]] + i[n[u + 2]] + i[n[u + 3]] + "-" + i[n[u + 4]] + i[n[u + 5]] + "-" + i[n[u + 6]] + i[n[u + 7]] + "-" + i[n[u + 8]] + i[n[u + 9]] + "-" + i[n[u + 10]] + i[n[u + 11]] + i[n[u + 12]] + i[n[u + 13]] + i[n[u + 14]] + i[n[u + 15]];
+}
 export {
-  f as default
+  c as unsafeStringify
 };
 //# sourceMappingURL=index.es296.js.map

package/dist/index.es296.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es296.js","sources":["../../../node_modules/react-remove-scroll/dist/es2015/sidecar.js"],"sourcesContent":["import { exportSidecar } from 'use-sidecar';\nimport { RemoveScrollSideCar } from './SideEffect';\nimport { effectCar } from './medium';\nexport default exportSidecar(effectCar, RemoveScrollSideCar);\n"],"names":["SideCar","exportSidecar","effectCar","RemoveScrollSideCar"],"mappings":";;;AAGA,MAAAA,IAAeC,EAAcC,GAAWC,CAAmB;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es296.js","sources":["../../../node_modules/uuid/dist/esm-browser/stringify.js"],"sourcesContent":["import validate from './validate.js';\n/**\n * Convert array of 16 byte values to UUID string format of the form:\n * XXXXXXXX-XXXX-XXXX-XXXX-XXXXXXXXXXXX\n */\n\nconst byteToHex = [];\n\nfor (let i = 0; i < 256; ++i) {\n  byteToHex.push((i + 0x100).toString(16).slice(1));\n}\n\nexport function unsafeStringify(arr, offset = 0) {\n  // Note: Be careful editing this code!  It's been tuned for performance\n  // and works in ways you may not expect. See https://github.com/uuidjs/uuid/pull/434\n  return byteToHex[arr[offset + 0]] + byteToHex[arr[offset + 1]] + byteToHex[arr[offset + 2]] + byteToHex[arr[offset + 3]] + '-' + byteToHex[arr[offset + 4]] + byteToHex[arr[offset + 5]] + '-' + byteToHex[arr[offset + 6]] + byteToHex[arr[offset + 7]] + '-' + byteToHex[arr[offset + 8]] + byteToHex[arr[offset + 9]] + '-' + byteToHex[arr[offset + 10]] + byteToHex[arr[offset + 11]] + byteToHex[arr[offset + 12]] + byteToHex[arr[offset + 13]] + byteToHex[arr[offset + 14]] + byteToHex[arr[offset + 15]];\n}\n\nfunction stringify(arr, offset = 0) {\n  const uuid = unsafeStringify(arr, offset); // Consistency check for valid UUID.  If this throws, it's likely due to one\n  // of the following:\n  // - One or more input array values don't map to a hex octet (leading to\n  // \"undefined\" in the uuid)\n  // - Invalid input values for the RFC `version` or `variant` fields\n\n  if (!validate(uuid)) {\n    throw TypeError('Stringified UUID is invalid');\n  }\n\n  return uuid;\n}\n\nexport default stringify;"],"names":["byteToHex","i","unsafeStringify","arr","offset"],"mappings":"AAMA,MAAMA,IAAY,CAAA;AAElB,SAASC,IAAI,GAAGA,IAAI,KAAK,EAAEA;AACf,EAAAD,EAAA,MAAMC,IAAI,KAAO,SAAS,EAAE,EAAE,MAAM,CAAC,CAAC;AAGlC,SAAAC,EAAgBC,GAAKC,IAAS,GAAG;AAGxC,SAAAJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAI,MAAMJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAI,MAAMJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAI,MAAMJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,CAAC,CAAC,IAAI,MAAMJ,EAAUG,EAAIC,IAAS,EAAE,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,EAAE,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,EAAE,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,EAAE,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,EAAE,CAAC,IAAIJ,EAAUG,EAAIC,IAAS,EAAE,CAAC;AACnf;","x_google_ignoreList":[0]}