@performant-software/core-data 2.2.0-beta.7 → 2.2.0-beta.8

package/dist/index.cjs258.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs258.js","sources":["../../../node_modules/underscore/modules/shuffle.js"],"sourcesContent":["import sample from './sample.js';\n\n// Shuffle a collection.\nexport default function shuffle(obj) {\n  return sample(obj, Infinity);\n}\n"],"names":["shuffle","obj","sample"],"mappings":"kDAGA,SAAwBA,EAAQC,EAAK,CAC5B,OAAAC,EAAOD,EAAK,GAAQ,CAC7B","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs258.js","sources":["../../../node_modules/underscore/modules/max.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport cb from './_cb.js';\nimport each from './each.js';\n\n// Return the maximum element (or element-based computation).\nexport default function max(obj, iteratee, context) {\n  var result = -Infinity, lastComputed = -Infinity,\n      value, computed;\n  if (iteratee == null || (typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null)) {\n    obj = isArrayLike(obj) ? obj : values(obj);\n    for (var i = 0, length = obj.length; i < length; i++) {\n      value = obj[i];\n      if (value != null && value > result) {\n        result = value;\n      }\n    }\n  } else {\n    iteratee = cb(iteratee, context);\n    each(obj, function(v, index, list) {\n      computed = iteratee(v, index, list);\n      if (computed > lastComputed || (computed === -Infinity && result === -Infinity)) {\n        result = v;\n        lastComputed = computed;\n      }\n    });\n  }\n  return result;\n}\n"],"names":["max","obj","iteratee","context","result","lastComputed","value","computed","isArrayLike","values","i","length","cb","each","v","index","list"],"mappings":"+IAMwB,SAAAA,EAAIC,EAAKC,EAAUC,EAAS,CAClD,IAAIC,EAAS,KAAWC,EAAe,KACnCC,EAAOC,EACP,GAAAL,GAAY,MAAS,OAAOA,GAAY,UAAY,OAAOD,EAAI,CAAC,GAAK,UAAYA,GAAO,KAAO,CACjGA,EAAMO,EAAYP,CAAG,EAAIA,EAAMQ,EAAOR,CAAG,EACzC,QAASS,EAAI,EAAGC,EAASV,EAAI,OAAQS,EAAIC,EAAQD,IAC/CJ,EAAQL,EAAIS,CAAC,EACTJ,GAAS,MAAQA,EAAQF,IAClBA,EAAAE,EAEb,MAEWJ,EAAAU,EAAGV,EAAUC,CAAO,EAC/BU,EAAKZ,EAAK,SAASa,EAAGC,EAAOC,EAAM,CACtBT,EAAAL,EAASY,EAAGC,EAAOC,CAAI,GAC9BT,EAAWF,GAAiBE,IAAa,MAAaH,IAAW,QAC1DA,EAAAU,EACMT,EAAAE,EACjB,CACD,EAEI,OAAAH,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs259.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs359.js"),h=require("./index.cjs203.js"),m=require("./index.cjs340.js"),i=require("./index.cjs223.js"),o=require("./index.cjs265.js");function q(r,t,l){if(t==null||l)return n(r)||(r=h(r)),r[i(r.length-1)];var e=o(r),s=m(e);t=Math.max(Math.min(t,s),0);for(var c=s-1,a=0;a<t;a++){var u=i(a,c),v=e[a];e[a]=e[u],e[u]=v}return e.slice(0,t)}module.exports=q;
+"use strict";const p=require("./index.cjs355.js"),m=require("./index.cjs205.js"),q=require("./index.cjs345.js"),I=require("./index.cjs247.js");function a(n,u,s){var i=1/0,f=1/0,r,t;if(u==null||typeof u=="number"&&typeof n[0]!="object"&&n!=null){n=p(n)?n:m(n);for(var e=0,c=n.length;e<c;e++)r=n[e],r!=null&&r<i&&(i=r)}else u=q(u,s),I(n,function(l,y,o){t=u(l,y,o),(t<f||t===1/0&&i===1/0)&&(i=l,f=t)});return i}module.exports=a;
 //# sourceMappingURL=index.cjs259.js.map

package/dist/index.cjs259.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs259.js","sources":["../../../node_modules/underscore/modules/sample.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport getLength from './_getLength.js';\nimport random from './random.js';\nimport toArray from './toArray.js';\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `_.map`.\nexport default function sample(obj, n, guard) {\n  if (n == null || guard) {\n    if (!isArrayLike(obj)) obj = values(obj);\n    return obj[random(obj.length - 1)];\n  }\n  var sample = toArray(obj);\n  var length = getLength(sample);\n  n = Math.max(Math.min(n, length), 0);\n  var last = length - 1;\n  for (var index = 0; index < n; index++) {\n    var rand = random(index, last);\n    var temp = sample[index];\n    sample[index] = sample[rand];\n    sample[rand] = temp;\n  }\n  return sample.slice(0, n);\n}\n"],"names":["sample","obj","n","guard","isArrayLike","values","random","toArray","length","getLength","last","index","rand","temp"],"mappings":"8KAUwB,SAAAA,EAAOC,EAAKC,EAAGC,EAAO,CACxC,GAAAD,GAAK,MAAQC,EACX,OAACC,EAAYH,CAAG,IAAGA,EAAMI,EAAOJ,CAAG,GAChCA,EAAIK,EAAOL,EAAI,OAAS,CAAC,CAAC,EAE/BD,IAAAA,EAASO,EAAQN,CAAG,EACpBO,EAASC,EAAUT,CAAM,EAC7BE,EAAI,KAAK,IAAI,KAAK,IAAIA,EAAGM,CAAM,EAAG,CAAC,EAEnC,QADIE,EAAOF,EAAS,EACXG,EAAQ,EAAGA,EAAQT,EAAGS,IAAS,CAClC,IAAAC,EAAON,EAAOK,EAAOD,CAAI,EACzBG,EAAOb,EAAOW,CAAK,EACvBX,EAAOW,CAAK,EAAIX,EAAOY,CAAI,EAC3BZ,EAAOY,CAAI,EAAIC,CACjB,CACOb,OAAAA,EAAO,MAAM,EAAGE,CAAC,CAC1B","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs259.js","sources":["../../../node_modules/underscore/modules/min.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport cb from './_cb.js';\nimport each from './each.js';\n\n// Return the minimum element (or element-based computation).\nexport default function min(obj, iteratee, context) {\n  var result = Infinity, lastComputed = Infinity,\n      value, computed;\n  if (iteratee == null || (typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null)) {\n    obj = isArrayLike(obj) ? obj : values(obj);\n    for (var i = 0, length = obj.length; i < length; i++) {\n      value = obj[i];\n      if (value != null && value < result) {\n        result = value;\n      }\n    }\n  } else {\n    iteratee = cb(iteratee, context);\n    each(obj, function(v, index, list) {\n      computed = iteratee(v, index, list);\n      if (computed < lastComputed || (computed === Infinity && result === Infinity)) {\n        result = v;\n        lastComputed = computed;\n      }\n    });\n  }\n  return result;\n}\n"],"names":["min","obj","iteratee","context","result","lastComputed","value","computed","isArrayLike","values","i","length","cb","each","v","index","list"],"mappings":"+IAMwB,SAAAA,EAAIC,EAAKC,EAAUC,EAAS,CAClD,IAAIC,EAAS,IAAUC,EAAe,IAClCC,EAAOC,EACP,GAAAL,GAAY,MAAS,OAAOA,GAAY,UAAY,OAAOD,EAAI,CAAC,GAAK,UAAYA,GAAO,KAAO,CACjGA,EAAMO,EAAYP,CAAG,EAAIA,EAAMQ,EAAOR,CAAG,EACzC,QAASS,EAAI,EAAGC,EAASV,EAAI,OAAQS,EAAIC,EAAQD,IAC/CJ,EAAQL,EAAIS,CAAC,EACTJ,GAAS,MAAQA,EAAQF,IAClBA,EAAAE,EAEb,MAEWJ,EAAAU,EAAGV,EAAUC,CAAO,EAC/BU,EAAKZ,EAAK,SAASa,EAAGC,EAAOC,EAAM,CACtBT,EAAAL,EAASY,EAAGC,EAAOC,CAAI,GAC9BT,EAAWF,GAAiBE,IAAa,KAAYH,IAAW,OACzDA,EAAAU,EACMT,EAAAE,EACjB,CACD,EAEI,OAAAH,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs260.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs349.js"),a=require("./index.cjs254.js"),d=require("./index.cjs246.js");function f(u,t,c){var o=0;return t=s(t,c),a(d(u,function(i,n,r){return{value:i,index:o++,criteria:t(i,n,r)}}).sort(function(i,n){var r=i.criteria,e=n.criteria;if(r!==e){if(r>e||r===void 0)return 1;if(r<e||e===void 0)return-1}return i.index-n.index}),"value")}module.exports=f;
+"use strict";const t=require("./index.cjs261.js");function n(e){return t(e,1/0)}module.exports=n;
 //# sourceMappingURL=index.cjs260.js.map

package/dist/index.cjs260.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs260.js","sources":["../../../node_modules/underscore/modules/sortBy.js"],"sourcesContent":["import cb from './_cb.js';\nimport pluck from './pluck.js';\nimport map from './map.js';\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport default function sortBy(obj, iteratee, context) {\n  var index = 0;\n  iteratee = cb(iteratee, context);\n  return pluck(map(obj, function(value, key, list) {\n    return {\n      value: value,\n      index: index++,\n      criteria: iteratee(value, key, list)\n    };\n  }).sort(function(left, right) {\n    var a = left.criteria;\n    var b = right.criteria;\n    if (a !== b) {\n      if (a > b || a === void 0) return 1;\n      if (a < b || b === void 0) return -1;\n    }\n    return left.index - right.index;\n  }), 'value');\n}\n"],"names":["sortBy","obj","iteratee","context","index","cb","pluck","map","value","key","list","left","right","a","b"],"mappings":"gHAKwB,SAAAA,EAAOC,EAAKC,EAAUC,EAAS,CACrD,IAAIC,EAAQ,EACD,OAAAF,EAAAG,EAAGH,EAAUC,CAAO,EACxBG,EAAMC,EAAIN,EAAK,SAASO,EAAOC,EAAKC,EAAM,CACxC,MAAA,CACL,MAAAF,EACA,MAAOJ,IACP,SAAUF,EAASM,EAAOC,EAAKC,CAAI,CAAA,CAEtC,CAAA,EAAE,KAAK,SAASC,EAAMC,EAAO,CAC5B,IAAIC,EAAIF,EAAK,SACTG,EAAIF,EAAM,SACd,GAAIC,IAAMC,EAAG,CACP,GAAAD,EAAIC,GAAKD,IAAM,OAAe,MAAA,GAC9B,GAAAA,EAAIC,GAAKA,IAAM,OAAe,MAAA,EACpC,CACO,OAAAH,EAAK,MAAQC,EAAM,KAAA,CAC3B,EAAG,OAAO,CACb","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs260.js","sources":["../../../node_modules/underscore/modules/shuffle.js"],"sourcesContent":["import sample from './sample.js';\n\n// Shuffle a collection.\nexport default function shuffle(obj) {\n  return sample(obj, Infinity);\n}\n"],"names":["shuffle","obj","sample"],"mappings":"kDAGA,SAAwBA,EAAQC,EAAK,CAC5B,OAAAC,EAAOD,EAAK,GAAQ,CAC7B","x_google_ignoreList":[0]}

package/dist/index.cjs261.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs361.js"),i=require("./index.cjs338.js"),n=c(function(o,r,s){i(o,s)?o[s].push(r):o[s]=[r]});module.exports=n;
+"use strict";const n=require("./index.cjs355.js"),h=require("./index.cjs205.js"),m=require("./index.cjs336.js"),i=require("./index.cjs225.js"),o=require("./index.cjs267.js");function q(r,t,l){if(t==null||l)return n(r)||(r=h(r)),r[i(r.length-1)];var e=o(r),s=m(e);t=Math.max(Math.min(t,s),0);for(var c=s-1,a=0;a<t;a++){var u=i(a,c),v=e[a];e[a]=e[u],e[u]=v}return e.slice(0,t)}module.exports=q;
 //# sourceMappingURL=index.cjs261.js.map

package/dist/index.cjs261.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs261.js","sources":["../../../node_modules/underscore/modules/groupBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Groups the object's values by a criterion. Pass either a string attribute\n// to group by, or a function that returns the criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key].push(value); else result[key] = [value];\n});\n"],"names":["group","result","value","key","has"],"mappings":"iFAKeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAK,CAC5CC,EAAIH,EAAQE,CAAG,EAAUF,EAAAE,CAAG,EAAE,KAAKD,CAAK,EAAeD,EAAAE,CAAG,EAAI,CAACD,CAAK,CAC1E,CAAC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs261.js","sources":["../../../node_modules/underscore/modules/sample.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport values from './values.js';\nimport getLength from './_getLength.js';\nimport random from './random.js';\nimport toArray from './toArray.js';\n\n// Sample **n** random values from a collection using the modern version of the\n// [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher–Yates_shuffle).\n// If **n** is not specified, returns a single random element.\n// The internal `guard` argument allows it to work with `_.map`.\nexport default function sample(obj, n, guard) {\n  if (n == null || guard) {\n    if (!isArrayLike(obj)) obj = values(obj);\n    return obj[random(obj.length - 1)];\n  }\n  var sample = toArray(obj);\n  var length = getLength(sample);\n  n = Math.max(Math.min(n, length), 0);\n  var last = length - 1;\n  for (var index = 0; index < n; index++) {\n    var rand = random(index, last);\n    var temp = sample[index];\n    sample[index] = sample[rand];\n    sample[rand] = temp;\n  }\n  return sample.slice(0, n);\n}\n"],"names":["sample","obj","n","guard","isArrayLike","values","random","toArray","length","getLength","last","index","rand","temp"],"mappings":"8KAUwB,SAAAA,EAAOC,EAAKC,EAAGC,EAAO,CACxC,GAAAD,GAAK,MAAQC,EACX,OAACC,EAAYH,CAAG,IAAGA,EAAMI,EAAOJ,CAAG,GAChCA,EAAIK,EAAOL,EAAI,OAAS,CAAC,CAAC,EAE/BD,IAAAA,EAASO,EAAQN,CAAG,EACpBO,EAASC,EAAUT,CAAM,EAC7BE,EAAI,KAAK,IAAI,KAAK,IAAIA,EAAGM,CAAM,EAAG,CAAC,EAEnC,QADIE,EAAOF,EAAS,EACXG,EAAQ,EAAGA,EAAQT,EAAGS,IAAS,CAClC,IAAAC,EAAON,EAAOK,EAAOD,CAAI,EACzBG,EAAOb,EAAOW,CAAK,EACvBX,EAAOW,CAAK,EAAIX,EAAOY,CAAI,EAC3BZ,EAAOY,CAAI,EAAIC,CACjB,CACOb,OAAAA,EAAO,MAAM,EAAGE,CAAC,CAC1B","x_google_ignoreList":[0]}

package/dist/index.cjs262.js

@@ -1,2 +1,2 @@
-"use strict";const o=require("./index.cjs361.js"),r=o(function(t,e,n){t[n]=e});module.exports=r;
+"use strict";const s=require("./index.cjs345.js"),a=require("./index.cjs256.js"),d=require("./index.cjs248.js");function f(u,t,c){var o=0;return t=s(t,c),a(d(u,function(i,n,r){return{value:i,index:o++,criteria:t(i,n,r)}}).sort(function(i,n){var r=i.criteria,e=n.criteria;if(r!==e){if(r>e||r===void 0)return 1;if(r<e||e===void 0)return-1}return i.index-n.index}),"value")}module.exports=f;
 //# sourceMappingURL=index.cjs262.js.map

package/dist/index.cjs262.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs262.js","sources":["../../../node_modules/underscore/modules/indexBy.js"],"sourcesContent":["import group from './_group.js';\n\n// Indexes the object's values by a criterion, similar to `_.groupBy`, but for\n// when you know that your index values will be unique.\nexport default group(function(result, value, key) {\n  result[key] = value;\n});\n"],"names":["group","result","value","key"],"mappings":"kDAIeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAK,CAChDF,EAAOE,CAAG,EAAID,CAChB,CAAC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs262.js","sources":["../../../node_modules/underscore/modules/sortBy.js"],"sourcesContent":["import cb from './_cb.js';\nimport pluck from './pluck.js';\nimport map from './map.js';\n\n// Sort the object's values by a criterion produced by an iteratee.\nexport default function sortBy(obj, iteratee, context) {\n  var index = 0;\n  iteratee = cb(iteratee, context);\n  return pluck(map(obj, function(value, key, list) {\n    return {\n      value: value,\n      index: index++,\n      criteria: iteratee(value, key, list)\n    };\n  }).sort(function(left, right) {\n    var a = left.criteria;\n    var b = right.criteria;\n    if (a !== b) {\n      if (a > b || a === void 0) return 1;\n      if (a < b || b === void 0) return -1;\n    }\n    return left.index - right.index;\n  }), 'value');\n}\n"],"names":["sortBy","obj","iteratee","context","index","cb","pluck","map","value","key","list","left","right","a","b"],"mappings":"gHAKwB,SAAAA,EAAOC,EAAKC,EAAUC,EAAS,CACrD,IAAIC,EAAQ,EACD,OAAAF,EAAAG,EAAGH,EAAUC,CAAO,EACxBG,EAAMC,EAAIN,EAAK,SAASO,EAAOC,EAAKC,EAAM,CACxC,MAAA,CACL,MAAAF,EACA,MAAOJ,IACP,SAAUF,EAASM,EAAOC,EAAKC,CAAI,CAAA,CAEtC,CAAA,EAAE,KAAK,SAASC,EAAMC,EAAO,CAC5B,IAAIC,EAAIF,EAAK,SACTG,EAAIF,EAAM,SACd,GAAIC,IAAMC,EAAG,CACP,GAAAD,EAAIC,GAAKD,IAAM,OAAe,MAAA,GAC9B,GAAAA,EAAIC,GAAKA,IAAM,OAAe,MAAA,EACpC,CACO,OAAAH,EAAK,MAAQC,EAAM,KAAA,CAC3B,EAAG,OAAO,CACb","x_google_ignoreList":[0]}

package/dist/index.cjs263.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs361.js"),s=require("./index.cjs338.js"),t=n(function(o,e,c){s(o,c)?o[c]++:o[c]=1});module.exports=t;
+"use strict";const c=require("./index.cjs357.js"),i=require("./index.cjs334.js"),n=c(function(o,r,s){i(o,s)?o[s].push(r):o[s]=[r]});module.exports=n;
 //# sourceMappingURL=index.cjs263.js.map

package/dist/index.cjs263.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs263.js","sources":["../../../node_modules/underscore/modules/countBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Counts instances of an object that group by a certain criterion. Pass\n// either a string attribute to count by, or a function that returns the\n// criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key]++; else result[key] = 1;\n});\n"],"names":["group","result","value","key","has"],"mappings":"iFAMeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAK,CAC5CC,EAAIH,EAAQE,CAAG,EAAGF,EAAOE,CAAG,IAAUF,EAAOE,CAAG,EAAI,CAC1D,CAAC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs263.js","sources":["../../../node_modules/underscore/modules/groupBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Groups the object's values by a criterion. Pass either a string attribute\n// to group by, or a function that returns the criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key].push(value); else result[key] = [value];\n});\n"],"names":["group","result","value","key","has"],"mappings":"iFAKeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAK,CAC5CC,EAAIH,EAAQE,CAAG,EAAUF,EAAAE,CAAG,EAAE,KAAKD,CAAK,EAAeD,EAAAE,CAAG,EAAI,CAACD,CAAK,CAC1E,CAAC","x_google_ignoreList":[0]}

package/dist/index.cjs264.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs361.js"),u=s(function(t,r,o){t[o?0:1].push(r)},!0);module.exports=u;
+"use strict";const o=require("./index.cjs357.js"),r=o(function(t,e,n){t[n]=e});module.exports=r;
 //# sourceMappingURL=index.cjs264.js.map

package/dist/index.cjs264.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs264.js","sources":["../../../node_modules/underscore/modules/partition.js"],"sourcesContent":["import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n  result[pass ? 0 : 1].push(value);\n}, true);\n"],"names":["group","result","value","pass"],"mappings":"kDAIeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAM,CACjDF,EAAOE,EAAO,EAAI,CAAC,EAAE,KAAKD,CAAK,CACjC,EAAG,EAAI","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs264.js","sources":["../../../node_modules/underscore/modules/indexBy.js"],"sourcesContent":["import group from './_group.js';\n\n// Indexes the object's values by a criterion, similar to `_.groupBy`, but for\n// when you know that your index values will be unique.\nexport default group(function(result, value, key) {\n  result[key] = value;\n});\n"],"names":["group","result","value","key"],"mappings":"kDAIeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAK,CAChDF,EAAOE,CAAG,EAAID,CAChB,CAAC","x_google_ignoreList":[0]}

package/dist/index.cjs265.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs193.js"),u=require("./index.cjs52.js"),t=require("./index.cjs185.js"),i=require("./index.cjs359.js"),f=require("./index.cjs246.js"),n=require("./index.cjs216.js"),s=require("./index.cjs203.js");var c=/[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;function d(r){return r?e(r)?u.slice.call(r):t(r)?r.match(c):i(r)?f(r,n):s(r):[]}module.exports=d;
+"use strict";const n=require("./index.cjs357.js"),s=require("./index.cjs334.js"),t=n(function(o,e,c){s(o,c)?o[c]++:o[c]=1});module.exports=t;
 //# sourceMappingURL=index.cjs265.js.map

package/dist/index.cjs265.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs265.js","sources":["../../../node_modules/underscore/modules/toArray.js"],"sourcesContent":["import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default function toArray(obj) {\n  if (!obj) return [];\n  if (isArray(obj)) return slice.call(obj);\n  if (isString(obj)) {\n    // Keep surrogate pair characters together.\n    return obj.match(reStrSymbol);\n  }\n  if (isArrayLike(obj)) return map(obj, identity);\n  return values(obj);\n}\n"],"names":["reStrSymbol","toArray","obj","isArray","slice","isString","isArrayLike","map","identity","values"],"mappings":"2OASA,IAAIA,EAAc,mEAClB,SAAwBC,EAAQC,EAAK,CACnC,OAAKA,EACDC,EAAQD,CAAG,EAAUE,EAAA,MAAM,KAAKF,CAAG,EACnCG,EAASH,CAAG,EAEPA,EAAI,MAAMF,CAAW,EAE1BM,EAAYJ,CAAG,EAAUK,EAAIL,EAAKM,CAAQ,EACvCC,EAAOP,CAAG,EAPA,EAQnB","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs265.js","sources":["../../../node_modules/underscore/modules/countBy.js"],"sourcesContent":["import group from './_group.js';\nimport has from './_has.js';\n\n// Counts instances of an object that group by a certain criterion. Pass\n// either a string attribute to count by, or a function that returns the\n// criterion.\nexport default group(function(result, value, key) {\n  if (has(result, key)) result[key]++; else result[key] = 1;\n});\n"],"names":["group","result","value","key","has"],"mappings":"iFAMeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAK,CAC5CC,EAAIH,EAAQE,CAAG,EAAGF,EAAOE,CAAG,IAAUF,EAAOE,CAAG,EAAI,CAC1D,CAAC","x_google_ignoreList":[0]}

package/dist/index.cjs266.js

@@ -1,2 +1,2 @@
-"use strict";const r=require("./index.cjs359.js"),t=require("./index.cjs201.js");function n(e){return e==null?0:r(e)?e.length:t(e).length}module.exports=n;
+"use strict";const s=require("./index.cjs357.js"),u=s(function(t,r,o){t[o?0:1].push(r)},!0);module.exports=u;
 //# sourceMappingURL=index.cjs266.js.map

package/dist/index.cjs266.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs266.js","sources":["../../../node_modules/underscore/modules/size.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the number of elements in a collection.\nexport default function size(obj) {\n  if (obj == null) return 0;\n  return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n"],"names":["size","obj","isArrayLike","keys"],"mappings":"iFAIA,SAAwBA,EAAKC,EAAK,CAChC,OAAIA,GAAO,KAAa,EACjBC,EAAYD,CAAG,EAAIA,EAAI,OAASE,EAAKF,CAAG,EAAE,MACnD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs266.js","sources":["../../../node_modules/underscore/modules/partition.js"],"sourcesContent":["import group from './_group.js';\n\n// Split a collection into two arrays: one whose elements all pass the given\n// truth test, and one whose elements all do not pass the truth test.\nexport default group(function(result, value, pass) {\n  result[pass ? 0 : 1].push(value);\n}, true);\n"],"names":["group","result","value","pass"],"mappings":"kDAIeA,EAAAA,EAAM,SAASC,EAAQC,EAAOC,EAAM,CACjDF,EAAOE,EAAO,EAAI,CAAC,EAAE,KAAKD,CAAK,CACjC,EAAG,EAAI","x_google_ignoreList":[0]}

package/dist/index.cjs267.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs268.js");function l(t,i,n){return t==null||t.length<1?i==null||n?void 0:[]:i==null||n?t[0]:e(t,t.length-i)}module.exports=l;
+"use strict";const e=require("./index.cjs195.js"),u=require("./index.cjs52.js"),t=require("./index.cjs187.js"),i=require("./index.cjs355.js"),f=require("./index.cjs248.js"),n=require("./index.cjs218.js"),s=require("./index.cjs205.js");var c=/[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;function d(r){return r?e(r)?u.slice.call(r):t(r)?r.match(c):i(r)?f(r,n):s(r):[]}module.exports=d;
 //# sourceMappingURL=index.cjs267.js.map

package/dist/index.cjs267.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs267.js","sources":["../../../node_modules/underscore/modules/first.js"],"sourcesContent":["import initial from './initial.js';\n\n// Get the first element of an array. Passing **n** will return the first N\n// values in the array. The **guard** check allows it to work with `_.map`.\nexport default function first(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[0];\n  return initial(array, array.length - n);\n}\n"],"names":["first","array","n","guard","initial"],"mappings":"kDAIwB,SAAAA,EAAMC,EAAOC,EAAGC,EAAO,CACzC,OAAAF,GAAS,MAAQA,EAAM,OAAS,EAAUC,GAAK,MAAQC,EAAQ,OAAS,CAAA,EACxED,GAAK,MAAQC,EAAcF,EAAM,CAAC,EAC/BG,EAAQH,EAAOA,EAAM,OAASC,CAAC,CACxC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs267.js","sources":["../../../node_modules/underscore/modules/toArray.js"],"sourcesContent":["import isArray from './isArray.js';\nimport { slice } from './_setup.js';\nimport isString from './isString.js';\nimport isArrayLike from './_isArrayLike.js';\nimport map from './map.js';\nimport identity from './identity.js';\nimport values from './values.js';\n\n// Safely create a real, live array from anything iterable.\nvar reStrSymbol = /[^\\ud800-\\udfff]|[\\ud800-\\udbff][\\udc00-\\udfff]|[\\ud800-\\udfff]/g;\nexport default function toArray(obj) {\n  if (!obj) return [];\n  if (isArray(obj)) return slice.call(obj);\n  if (isString(obj)) {\n    // Keep surrogate pair characters together.\n    return obj.match(reStrSymbol);\n  }\n  if (isArrayLike(obj)) return map(obj, identity);\n  return values(obj);\n}\n"],"names":["reStrSymbol","toArray","obj","isArray","slice","isString","isArrayLike","map","identity","values"],"mappings":"2OASA,IAAIA,EAAc,mEAClB,SAAwBC,EAAQC,EAAK,CACnC,OAAKA,EACDC,EAAQD,CAAG,EAAUE,EAAA,MAAM,KAAKF,CAAG,EACnCG,EAASH,CAAG,EAEPA,EAAI,MAAMF,CAAW,EAE1BM,EAAYJ,CAAG,EAAUK,EAAIL,EAAKM,CAAQ,EACvCC,EAAOP,CAAG,EAPA,EAQnB","x_google_ignoreList":[0]}

package/dist/index.cjs268.js

@@ -1,2 +1,2 @@
-"use strict";const l=require("./index.cjs52.js");function n(t,e,i){return l.slice.call(t,0,Math.max(0,t.length-(e==null||i?1:e)))}module.exports=n;
+"use strict";const r=require("./index.cjs355.js"),t=require("./index.cjs203.js");function n(e){return e==null?0:r(e)?e.length:t(e).length}module.exports=n;
 //# sourceMappingURL=index.cjs268.js.map

package/dist/index.cjs268.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs268.js","sources":["../../../node_modules/underscore/modules/initial.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the last entry of the array. Especially useful on\n// the arguments object. Passing **n** will return all the values in\n// the array, excluding the last N.\nexport default function initial(array, n, guard) {\n  return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n"],"names":["initial","array","n","guard","slice"],"mappings":"iDAKwB,SAAAA,EAAQC,EAAOC,EAAGC,EAAO,CAC/C,OAAOC,EAAAA,MAAM,KAAKH,EAAO,EAAG,KAAK,IAAI,EAAGA,EAAM,QAAUC,GAAK,MAAQC,EAAQ,EAAID,EAAE,CAAC,CACtF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs268.js","sources":["../../../node_modules/underscore/modules/size.js"],"sourcesContent":["import isArrayLike from './_isArrayLike.js';\nimport keys from './keys.js';\n\n// Return the number of elements in a collection.\nexport default function size(obj) {\n  if (obj == null) return 0;\n  return isArrayLike(obj) ? obj.length : keys(obj).length;\n}\n"],"names":["size","obj","isArrayLike","keys"],"mappings":"iFAIA,SAAwBA,EAAKC,EAAK,CAChC,OAAIA,GAAO,KAAa,EACjBC,EAAYD,CAAG,EAAIA,EAAI,OAASE,EAAKF,CAAG,EAAE,MACnD","x_google_ignoreList":[0]}

package/dist/index.cjs269.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs270.js");function u(t,e,l){return t==null||t.length<1?e==null||l?void 0:[]:e==null||l?t[t.length-1]:n(t,Math.max(0,t.length-e))}module.exports=u;
+"use strict";const e=require("./index.cjs270.js");function l(t,i,n){return t==null||t.length<1?i==null||n?void 0:[]:i==null||n?t[0]:e(t,t.length-i)}module.exports=l;
 //# sourceMappingURL=index.cjs269.js.map

package/dist/index.cjs269.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs269.js","sources":["../../../node_modules/underscore/modules/last.js"],"sourcesContent":["import rest from './rest.js';\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport default function last(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[array.length - 1];\n  return rest(array, Math.max(0, array.length - n));\n}\n"],"names":["last","array","n","guard","rest"],"mappings":"kDAIwB,SAAAA,EAAKC,EAAOC,EAAGC,EAAO,CACxC,OAAAF,GAAS,MAAQA,EAAM,OAAS,EAAUC,GAAK,MAAQC,EAAQ,OAAS,CAAA,EACxED,GAAK,MAAQC,EAAcF,EAAMA,EAAM,OAAS,CAAC,EAC9CG,EAAKH,EAAO,KAAK,IAAI,EAAGA,EAAM,OAASC,CAAC,CAAC,CAClD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs269.js","sources":["../../../node_modules/underscore/modules/first.js"],"sourcesContent":["import initial from './initial.js';\n\n// Get the first element of an array. Passing **n** will return the first N\n// values in the array. The **guard** check allows it to work with `_.map`.\nexport default function first(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[0];\n  return initial(array, array.length - n);\n}\n"],"names":["first","array","n","guard","initial"],"mappings":"kDAIwB,SAAAA,EAAMC,EAAOC,EAAGC,EAAO,CACzC,OAAAF,GAAS,MAAQA,EAAM,OAAS,EAAUC,GAAK,MAAQC,EAAQ,OAAS,CAAA,EACxED,GAAK,MAAQC,EAAcF,EAAM,CAAC,EAC/BG,EAAQH,EAAOA,EAAM,OAASC,CAAC,CACxC","x_google_ignoreList":[0]}

package/dist/index.cjs270.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs52.js");function u(t,e,r){return s.slice.call(t,e==null||r?1:e)}module.exports=u;
+"use strict";const l=require("./index.cjs52.js");function n(t,e,i){return l.slice.call(t,0,Math.max(0,t.length-(e==null||i?1:e)))}module.exports=n;
 //# sourceMappingURL=index.cjs270.js.map

package/dist/index.cjs270.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs270.js","sources":["../../../node_modules/underscore/modules/rest.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the first entry of the `array`. Especially useful on\n// the `arguments` object. Passing an **n** will return the rest N values in the\n// `array`.\nexport default function rest(array, n, guard) {\n  return slice.call(array, n == null || guard ? 1 : n);\n}\n"],"names":["rest","array","n","guard","slice"],"mappings":"iDAKwB,SAAAA,EAAKC,EAAOC,EAAGC,EAAO,CAC5C,OAAOC,QAAM,KAAKH,EAAOC,GAAK,MAAQC,EAAQ,EAAID,CAAC,CACrD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs270.js","sources":["../../../node_modules/underscore/modules/initial.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the last entry of the array. Especially useful on\n// the arguments object. Passing **n** will return all the values in\n// the array, excluding the last N.\nexport default function initial(array, n, guard) {\n  return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n)));\n}\n"],"names":["initial","array","n","guard","slice"],"mappings":"iDAKwB,SAAAA,EAAQC,EAAOC,EAAGC,EAAO,CAC/C,OAAOC,EAAAA,MAAM,KAAKH,EAAO,EAAG,KAAK,IAAI,EAAGA,EAAM,QAAUC,GAAK,MAAQC,EAAQ,EAAID,EAAE,CAAC,CACtF","x_google_ignoreList":[0]}

package/dist/index.cjs271.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs249.js");function r(t){return e(t,Boolean)}module.exports=r;
+"use strict";const n=require("./index.cjs272.js");function u(t,e,l){return t==null||t.length<1?e==null||l?void 0:[]:e==null||l?t[t.length-1]:n(t,Math.max(0,t.length-e))}module.exports=u;
 //# sourceMappingURL=index.cjs271.js.map

package/dist/index.cjs271.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs271.js","sources":["../../../node_modules/underscore/modules/compact.js"],"sourcesContent":["import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n  return filter(array, Boolean);\n}\n"],"names":["compact","array","filter"],"mappings":"kDAGA,SAAwBA,EAAQC,EAAO,CAC9B,OAAAC,EAAOD,EAAO,OAAO,CAC9B","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs271.js","sources":["../../../node_modules/underscore/modules/last.js"],"sourcesContent":["import rest from './rest.js';\n\n// Get the last element of an array. Passing **n** will return the last N\n// values in the array.\nexport default function last(array, n, guard) {\n  if (array == null || array.length < 1) return n == null || guard ? void 0 : [];\n  if (n == null || guard) return array[array.length - 1];\n  return rest(array, Math.max(0, array.length - n));\n}\n"],"names":["last","array","n","guard","rest"],"mappings":"kDAIwB,SAAAA,EAAKC,EAAOC,EAAGC,EAAO,CACxC,OAAAF,GAAS,MAAQA,EAAM,OAAS,EAAUC,GAAK,MAAQC,EAAQ,OAAS,CAAA,EACxED,GAAK,MAAQC,EAAcF,EAAMA,EAAM,OAAS,CAAC,EAC9CG,EAAKH,EAAO,KAAK,IAAI,EAAGA,EAAM,OAASC,CAAC,CAAC,CAClD","x_google_ignoreList":[0]}

package/dist/index.cjs272.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs356.js");function r(t,e){return n(t,e,!1)}module.exports=r;
+"use strict";const s=require("./index.cjs52.js");function u(t,e,r){return s.slice.call(t,e==null||r?1:e)}module.exports=u;
 //# sourceMappingURL=index.cjs272.js.map

package/dist/index.cjs272.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs272.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":"kDAIwB,SAAAA,EAAQC,EAAOC,EAAO,CACrC,OAAAC,EAASF,EAAOC,EAAO,EAAK,CACrC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs272.js","sources":["../../../node_modules/underscore/modules/rest.js"],"sourcesContent":["import { slice } from './_setup.js';\n\n// Returns everything but the first entry of the `array`. Especially useful on\n// the `arguments` object. Passing an **n** will return the rest N values in the\n// `array`.\nexport default function rest(array, n, guard) {\n  return slice.call(array, n == null || guard ? 1 : n);\n}\n"],"names":["rest","array","n","guard","slice"],"mappings":"iDAKwB,SAAAA,EAAKC,EAAOC,EAAGC,EAAO,CAC5C,OAAOC,QAAM,KAAKH,EAAOC,GAAK,MAAQC,EAAQ,EAAID,CAAC,CACrD","x_google_ignoreList":[0]}

package/dist/index.cjs273.js

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs183.js"),_=require("./index.cjs349.js"),b=require("./index.cjs340.js"),g=require("./index.cjs253.js");function i(o,h,s,r){p(h)||(r=s,s=h,h=!1),s!=null&&(s=_(s,r));for(var f=[],q=[],u=0,l=b(o);u<l;u++){var n=o[u],c=s?s(n,u,o):n;h&&!s?((!u||q!==c)&&f.push(n),q=c):s?g(q,c)||(q.push(c),f.push(n)):g(f,n)||f.push(n)}return f}module.exports=i;
+"use strict";const e=require("./index.cjs251.js");function r(t){return e(t,Boolean)}module.exports=r;
 //# sourceMappingURL=index.cjs273.js.map

package/dist/index.cjs273.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs273.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":"+IAUA,SAAwBA,EAAKC,EAAOC,EAAUC,EAAUC,EAAS,CAC1DC,EAAUH,CAAQ,IACXE,EAAAD,EACCA,EAAAD,EACAA,EAAA,IAETC,GAAY,OAAiBA,EAAAG,EAAGH,EAAUC,CAAO,GAG5C,QAFLG,EAAS,CAAA,EACTC,EAAO,CAAA,EACFC,EAAI,EAAGC,EAASC,EAAUV,CAAK,EAAGQ,EAAIC,EAAQD,IAAK,CACtD,IAAAG,EAAQX,EAAMQ,CAAC,EACfI,EAAWV,EAAWA,EAASS,EAAOH,EAAGR,CAAK,EAAIW,EAClDV,GAAY,CAACC,IACX,CAACM,GAAKD,IAASK,IAAUN,EAAO,KAAKK,CAAK,EACvCJ,EAAAK,GACEV,EACJW,EAASN,EAAMK,CAAQ,IAC1BL,EAAK,KAAKK,CAAQ,EAClBN,EAAO,KAAKK,CAAK,GAETE,EAASP,EAAQK,CAAK,GAChCL,EAAO,KAAKK,CAAK,CAErB,CACO,OAAAL,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs273.js","sources":["../../../node_modules/underscore/modules/compact.js"],"sourcesContent":["import filter from './filter.js';\n\n// Trim out all falsy values from an array.\nexport default function compact(array) {\n  return filter(array, Boolean);\n}\n"],"names":["compact","array","filter"],"mappings":"kDAGA,SAAwBA,EAAQC,EAAO,CAC9B,OAAAC,EAAOD,EAAO,OAAO,CAC9B","x_google_ignoreList":[0]}

package/dist/index.cjs274.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs340.js"),o=require("./index.cjs253.js");function g(s){for(var e=[],u=arguments.length,n=0,a=c(s);n<a;n++){var t=s[n];if(!o(e,t)){var r;for(r=1;r<u&&o(arguments[r],t);r++);r===u&&e.push(t)}}return e}module.exports=g;
+"use strict";const n=require("./index.cjs352.js");function r(t,e){return n(t,e,!1)}module.exports=r;
 //# sourceMappingURL=index.cjs274.js.map

package/dist/index.cjs274.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs274.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":"iFAKA,SAAwBA,EAAaC,EAAO,CAGjC,QAFLC,EAAS,CAAA,EACTC,EAAa,UAAU,OAClBC,EAAI,EAAGC,EAASC,EAAUL,CAAK,EAAGG,EAAIC,EAAQD,IAAK,CACtD,IAAAG,EAAON,EAAMG,CAAC,EACd,GAAA,CAAAI,EAASN,EAAQK,CAAI,EACrB,KAAAE,EACJ,IAAKA,EAAI,EAAGA,EAAIN,GACTK,EAAS,UAAUC,CAAC,EAAGF,CAAI,EADNE,IAC1B,CAEEA,IAAMN,GAAYD,EAAO,KAAKK,CAAI,EACxC,CACO,OAAAL,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs274.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":"kDAIwB,SAAAA,EAAQC,EAAOC,EAAO,CACrC,OAAAC,EAASF,EAAOC,EAAO,EAAK,CACrC","x_google_ignoreList":[0]}

package/dist/index.cjs275.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs256.js"),s=require("./index.cjs340.js"),c=require("./index.cjs254.js");function o(t){for(var e=t&&n(t,s).length||0,u=Array(e),r=0;r<e;r++)u[r]=c(t,r);return u}module.exports=o;
+"use strict";const p=require("./index.cjs185.js"),_=require("./index.cjs345.js"),b=require("./index.cjs336.js"),g=require("./index.cjs255.js");function i(o,h,s,r){p(h)||(r=s,s=h,h=!1),s!=null&&(s=_(s,r));for(var f=[],q=[],u=0,l=b(o);u<l;u++){var n=o[u],c=s?s(n,u,o):n;h&&!s?((!u||q!==c)&&f.push(n),q=c):s?g(q,c)||(q.push(c),f.push(n)):g(f,n)||f.push(n)}return f}module.exports=i;
 //# sourceMappingURL=index.cjs275.js.map

package/dist/index.cjs275.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs275.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":"gHAMA,SAAwBA,EAAMC,EAAO,CAInC,QAHIC,EAAUD,GAASE,EAAIF,EAAOG,CAAS,EAAE,QAAW,EACpDC,EAAS,MAAMH,CAAM,EAEhBI,EAAQ,EAAGA,EAAQJ,EAAQI,IAClCD,EAAOC,CAAK,EAAIC,EAAMN,EAAOK,CAAK,EAE7B,OAAAD,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs275.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":"+IAUA,SAAwBA,EAAKC,EAAOC,EAAUC,EAAUC,EAAS,CAC1DC,EAAUH,CAAQ,IACXE,EAAAD,EACCA,EAAAD,EACAA,EAAA,IAETC,GAAY,OAAiBA,EAAAG,EAAGH,EAAUC,CAAO,GAG5C,QAFLG,EAAS,CAAA,EACTC,EAAO,CAAA,EACFC,EAAI,EAAGC,EAASC,EAAUV,CAAK,EAAGQ,EAAIC,EAAQD,IAAK,CACtD,IAAAG,EAAQX,EAAMQ,CAAC,EACfI,EAAWV,EAAWA,EAASS,EAAOH,EAAGR,CAAK,EAAIW,EAClDV,GAAY,CAACC,IACX,CAACM,GAAKD,IAASK,IAAUN,EAAO,KAAKK,CAAK,EACvCJ,EAAAK,GACEV,EACJW,EAASN,EAAMK,CAAQ,IAC1BL,EAAK,KAAKK,CAAQ,EAClBN,EAAO,KAAKK,CAAK,GAETE,EAASP,EAAQK,CAAK,GAChCL,EAAO,KAAKK,CAAK,CAErB,CACO,OAAAL,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs276.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs340.js");function u(r,n){for(var t={},e=0,o=c(r);e<o;e++)n?t[r[e]]=n[e]:t[r[e][0]]=r[e][1];return t}module.exports=u;
+"use strict";const c=require("./index.cjs336.js"),o=require("./index.cjs255.js");function g(s){for(var e=[],u=arguments.length,n=0,a=c(s);n<a;n++){var t=s[n];if(!o(e,t)){var r;for(r=1;r<u&&o(arguments[r],t);r++);r===u&&e.push(t)}}return e}module.exports=g;
 //# sourceMappingURL=index.cjs276.js.map

package/dist/index.cjs276.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs276.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":"kDAKwB,SAAAA,EAAOC,EAAMC,EAAQ,CAElC,QADLC,EAAS,CAAA,EACJC,EAAI,EAAGC,EAASC,EAAUL,CAAI,EAAGG,EAAIC,EAAQD,IAChDF,EACFC,EAAOF,EAAKG,CAAC,CAAC,EAAIF,EAAOE,CAAC,EAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,EAAIH,EAAKG,CAAC,EAAE,CAAC,EAG3B,OAAAD,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs276.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":"iFAKA,SAAwBA,EAAaC,EAAO,CAGjC,QAFLC,EAAS,CAAA,EACTC,EAAa,UAAU,OAClBC,EAAI,EAAGC,EAASC,EAAUL,CAAK,EAAGG,EAAIC,EAAQD,IAAK,CACtD,IAAAG,EAAON,EAAMG,CAAC,EACd,GAAA,CAAAI,EAASN,EAAQK,CAAI,EACrB,KAAAE,EACJ,IAAKA,EAAI,EAAGA,EAAIN,GACTK,EAAS,UAAUC,CAAC,EAAGF,CAAI,EADNE,IAC1B,CAEEA,IAAMN,GAAYD,EAAO,KAAKK,CAAI,EACxC,CACO,OAAAL,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs277.js

@@ -1,2 +1,2 @@
-"use strict";function u(n,r,a){r==null&&(r=n||0,n=0),a||(a=r<n?-1:1);for(var f=Math.max(Math.ceil((r-n)/a),0),l=Array(f),e=0;e<f;e++,n+=a)l[e]=n;return l}module.exports=u;
+"use strict";const n=require("./index.cjs258.js"),s=require("./index.cjs336.js"),c=require("./index.cjs256.js");function o(t){for(var e=t&&n(t,s).length||0,u=Array(e),r=0;r<e;r++)u[r]=c(t,r);return u}module.exports=o;
 //# sourceMappingURL=index.cjs277.js.map

package/dist/index.cjs277.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs277.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,EAAOC,EAAMC,EAAM,CAC3CD,GAAQ,OACVA,EAAOD,GAAS,EACRA,EAAA,GAELE,IACIA,EAAAD,EAAOD,EAAQ,GAAK,GAM7B,QAHIG,EAAS,KAAK,IAAI,KAAK,MAAMF,EAAOD,GAASE,CAAI,EAAG,CAAC,EACrDH,EAAQ,MAAMI,CAAM,EAEfC,EAAM,EAAGA,EAAMD,EAAQC,IAAOJ,GAASE,EAC9CH,EAAMK,CAAG,EAAIJ,EAGRD,OAAAA,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs277.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":"gHAMA,SAAwBA,EAAMC,EAAO,CAInC,QAHIC,EAAUD,GAASE,EAAIF,EAAOG,CAAS,EAAE,QAAW,EACpDC,EAAS,MAAMH,CAAM,EAEhBI,EAAQ,EAAGA,EAAQJ,EAAQI,IAClCD,EAAOC,CAAK,EAAIC,EAAMN,EAAOK,CAAK,EAE7B,OAAAD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs278.js

@@ -1,2 +1,2 @@
-"use strict";const u=require("./index.cjs52.js");function i(r,e){if(e==null||e<1)return[];for(var t=[],l=0,s=r.length;l<s;)t.push(u.slice.call(r,l,l+=e));return t}module.exports=i;
+"use strict";const c=require("./index.cjs336.js");function u(r,n){for(var t={},e=0,o=c(r);e<o;e++)n?t[r[e]]=n[e]:t[r[e][0]]=r[e][1];return t}module.exports=u;
 //# sourceMappingURL=index.cjs278.js.map

package/dist/index.cjs278.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs278.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":"iDAIwB,SAAAA,EAAMC,EAAOC,EAAO,CACtC,GAAAA,GAAS,MAAQA,EAAQ,EAAG,MAAO,GAGvC,QAFIC,EAAS,CAAA,EACTC,EAAI,EAAGC,EAASJ,EAAM,OACnBG,EAAIC,GACTF,EAAO,KAAKG,EAAAA,MAAM,KAAKL,EAAOG,EAAGA,GAAKF,CAAK,CAAC,EAEvC,OAAAC,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs278.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":"kDAKwB,SAAAA,EAAOC,EAAMC,EAAQ,CAElC,QADLC,EAAS,CAAA,EACJC,EAAI,EAAGC,EAASC,EAAUL,CAAI,EAAGG,EAAIC,EAAQD,IAChDF,EACFC,EAAOF,EAAKG,CAAC,CAAC,EAAIF,EAAOE,CAAC,EAEnBD,EAAAF,EAAKG,CAAC,EAAE,CAAC,CAAC,EAAIH,EAAKG,CAAC,EAAE,CAAC,EAG3B,OAAAD,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs279.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e={};exports.__exports=e;
+"use strict";function u(n,r,a){r==null&&(r=n||0,n=0),a||(a=r<n?-1:1);for(var f=Math.max(Math.ceil((r-n)/a),0),l=Array(f),e=0;e<f;e++,n+=a)l[e]=n;return l}module.exports=u;
 //# sourceMappingURL=index.cjs279.js.map

package/dist/index.cjs279.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs279.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"index.cjs279.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,EAAOC,EAAMC,EAAM,CAC3CD,GAAQ,OACVA,EAAOD,GAAS,EACRA,EAAA,GAELE,IACIA,EAAAD,EAAOD,EAAQ,GAAK,GAM7B,QAHIG,EAAS,KAAK,IAAI,KAAK,MAAMF,EAAOD,GAASE,CAAI,EAAG,CAAC,EACrDH,EAAQ,MAAMI,CAAM,EAEfC,EAAM,EAAGA,EAAMD,EAAQC,IAAOJ,GAASE,EAC9CH,EAAMK,CAAG,EAAIJ,EAGRD,OAAAA,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs280.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e={};exports.__exports=e;
+"use strict";const u=require("./index.cjs52.js");function i(r,e){if(e==null||e<1)return[];for(var t=[],l=0,s=r.length;l<s;)t.push(u.slice.call(r,l,l+=e));return t}module.exports=i;
 //# sourceMappingURL=index.cjs280.js.map

package/dist/index.cjs280.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs280.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"index.cjs280.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":"iDAIwB,SAAAA,EAAMC,EAAOC,EAAO,CACtC,GAAAA,GAAS,MAAQA,EAAQ,EAAG,MAAO,GAGvC,QAFIC,EAAS,CAAA,EACTC,EAAI,EAAGC,EAASJ,EAAM,OACnBG,EAAIC,GACTF,EAAO,KAAKG,EAAAA,MAAM,KAAKL,EAAOG,EAAGA,GAAKF,CAAK,CAAC,EAEvC,OAAAC,CACT","x_google_ignoreList":[0]}

package/dist/index.cjs281.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});var e={};exports.__exports=e;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const b=["top","right","bottom","left"],a=Math.min,f=Math.max,A=Math.round,P=Math.floor,O=t=>({x:t,y:t}),y={left:"right",right:"left",bottom:"top",top:"bottom"},S={start:"end",end:"start"};function M(t,e,o){return f(t,a(e,o))}function j(t,e){return typeof t=="function"?t(e):t}function l(t){return t.split("-")[0]}function u(t){return t.split("-")[1]}function m(t){return t==="x"?"y":"x"}function p(t){return t==="y"?"height":"width"}function d(t){return["top","bottom"].includes(l(t))?"y":"x"}function h(t){return m(d(t))}function C(t,e,o){o===void 0&&(o=!1);const s=u(t),i=h(t),n=p(i);let r=i==="x"?s===(o?"end":"start")?"right":"left":s==="start"?"bottom":"top";return e.reference[n]>e.floating[n]&&(r=g(r)),[r,g(r)]}function w(t){const e=g(t);return[c(t),e,c(e)]}function c(t){return t.replace(/start|end/g,e=>S[e])}function L(t,e,o){const s=["left","right"],i=["right","left"],n=["top","bottom"],r=["bottom","top"];switch(t){case"top":case"bottom":return o?e?i:s:e?s:i;case"left":case"right":return e?n:r;default:return[]}}function T(t,e,o,s){const i=u(t);let n=L(l(t),o==="start",s);return i&&(n=n.map(r=>r+"-"+i),e&&(n=n.concat(n.map(c)))),n}function g(t){return t.replace(/left|right|bottom|top/g,e=>y[e])}function x(t){return{top:0,right:0,bottom:0,left:0,...t}}function E(t){return typeof t!="number"?x(t):{top:t,right:t,bottom:t,left:t}}function R(t){return{...t,top:t.y,left:t.x,right:t.x+t.width,bottom:t.y+t.height}}exports.clamp=M;exports.createCoords=O;exports.evaluate=j;exports.expandPaddingObject=x;exports.floor=P;exports.getAlignment=u;exports.getAlignmentAxis=h;exports.getAlignmentSides=C;exports.getAxisLength=p;exports.getExpandedPlacements=w;exports.getOppositeAlignmentPlacement=c;exports.getOppositeAxis=m;exports.getOppositeAxisPlacements=T;exports.getOppositePlacement=g;exports.getPaddingObject=E;exports.getSide=l;exports.getSideAxis=d;exports.max=f;exports.min=a;exports.rectToClientRect=R;exports.round=A;exports.sides=b;
 //# sourceMappingURL=index.cjs281.js.map

package/dist/index.cjs281.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs281.js","sources":[],"sourcesContent":[],"names":[],"mappings":""}
+{"version":3,"file":"index.cjs281.js","sources":["../../../node_modules/@floating-ui/utils/dist/floating-ui.utils.mjs"],"sourcesContent":["/**\n * Custom positioning reference element.\n * @see https://floating-ui.com/docs/virtual-elements\n */\n\nconst sides = ['top', 'right', 'bottom', 'left'];\nconst alignments = ['start', 'end'];\nconst placements = /*#__PURE__*/sides.reduce((acc, side) => acc.concat(side, side + \"-\" + alignments[0], side + \"-\" + alignments[1]), []);\nconst min = Math.min;\nconst max = Math.max;\nconst round = Math.round;\nconst floor = Math.floor;\nconst createCoords = v => ({\n  x: v,\n  y: v\n});\nconst oppositeSideMap = {\n  left: 'right',\n  right: 'left',\n  bottom: 'top',\n  top: 'bottom'\n};\nconst oppositeAlignmentMap = {\n  start: 'end',\n  end: 'start'\n};\nfunction clamp(start, value, end) {\n  return max(start, min(value, end));\n}\nfunction evaluate(value, param) {\n  return typeof value === 'function' ? value(param) : value;\n}\nfunction getSide(placement) {\n  return placement.split('-')[0];\n}\nfunction getAlignment(placement) {\n  return placement.split('-')[1];\n}\nfunction getOppositeAxis(axis) {\n  return axis === 'x' ? 'y' : 'x';\n}\nfunction getAxisLength(axis) {\n  return axis === 'y' ? 'height' : 'width';\n}\nfunction getSideAxis(placement) {\n  return ['top', 'bottom'].includes(getSide(placement)) ? 'y' : 'x';\n}\nfunction getAlignmentAxis(placement) {\n  return getOppositeAxis(getSideAxis(placement));\n}\nfunction getAlignmentSides(placement, rects, rtl) {\n  if (rtl === void 0) {\n    rtl = false;\n  }\n  const alignment = getAlignment(placement);\n  const alignmentAxis = getAlignmentAxis(placement);\n  const length = getAxisLength(alignmentAxis);\n  let mainAlignmentSide = alignmentAxis === 'x' ? alignment === (rtl ? 'end' : 'start') ? 'right' : 'left' : alignment === 'start' ? 'bottom' : 'top';\n  if (rects.reference[length] > rects.floating[length]) {\n    mainAlignmentSide = getOppositePlacement(mainAlignmentSide);\n  }\n  return [mainAlignmentSide, getOppositePlacement(mainAlignmentSide)];\n}\nfunction getExpandedPlacements(placement) {\n  const oppositePlacement = getOppositePlacement(placement);\n  return [getOppositeAlignmentPlacement(placement), oppositePlacement, getOppositeAlignmentPlacement(oppositePlacement)];\n}\nfunction getOppositeAlignmentPlacement(placement) {\n  return placement.replace(/start|end/g, alignment => oppositeAlignmentMap[alignment]);\n}\nfunction getSideList(side, isStart, rtl) {\n  const lr = ['left', 'right'];\n  const rl = ['right', 'left'];\n  const tb = ['top', 'bottom'];\n  const bt = ['bottom', 'top'];\n  switch (side) {\n    case 'top':\n    case 'bottom':\n      if (rtl) return isStart ? rl : lr;\n      return isStart ? lr : rl;\n    case 'left':\n    case 'right':\n      return isStart ? tb : bt;\n    default:\n      return [];\n  }\n}\nfunction getOppositeAxisPlacements(placement, flipAlignment, direction, rtl) {\n  const alignment = getAlignment(placement);\n  let list = getSideList(getSide(placement), direction === 'start', rtl);\n  if (alignment) {\n    list = list.map(side => side + \"-\" + alignment);\n    if (flipAlignment) {\n      list = list.concat(list.map(getOppositeAlignmentPlacement));\n    }\n  }\n  return list;\n}\nfunction getOppositePlacement(placement) {\n  return placement.replace(/left|right|bottom|top/g, side => oppositeSideMap[side]);\n}\nfunction expandPaddingObject(padding) {\n  return {\n    top: 0,\n    right: 0,\n    bottom: 0,\n    left: 0,\n    ...padding\n  };\n}\nfunction getPaddingObject(padding) {\n  return typeof padding !== 'number' ? expandPaddingObject(padding) : {\n    top: padding,\n    right: padding,\n    bottom: padding,\n    left: padding\n  };\n}\nfunction rectToClientRect(rect) {\n  return {\n    ...rect,\n    top: rect.y,\n    left: rect.x,\n    right: rect.x + rect.width,\n    bottom: rect.y + rect.height\n  };\n}\n\nexport { alignments, clamp, createCoords, evaluate, expandPaddingObject, floor, getAlignment, getAlignmentAxis, getAlignmentSides, getAxisLength, getExpandedPlacements, getOppositeAlignmentPlacement, getOppositeAxis, getOppositeAxisPlacements, getOppositePlacement, getPaddingObject, getSide, getSideAxis, max, min, placements, rectToClientRect, round, sides };\n"],"names":["sides","min","max","round","floor","createCoords","v","oppositeSideMap","oppositeAlignmentMap","clamp","start","value","end","evaluate","param","getSide","placement","getAlignment","getOppositeAxis","axis","getAxisLength","getSideAxis","getAlignmentAxis","getAlignmentSides","rects","rtl","alignment","alignmentAxis","length","mainAlignmentSide","getOppositePlacement","getExpandedPlacements","oppositePlacement","getOppositeAlignmentPlacement","getSideList","side","isStart","lr","rl","tb","bt","getOppositeAxisPlacements","flipAlignment","direction","list","expandPaddingObject","padding","getPaddingObject","rectToClientRect","rect"],"mappings":"gFAKK,MAACA,EAAQ,CAAC,MAAO,QAAS,SAAU,MAAM,EAGzCC,EAAM,KAAK,IACXC,EAAM,KAAK,IACXC,EAAQ,KAAK,MACbC,EAAQ,KAAK,MACbC,EAAeC,IAAM,CACzB,EAAGA,EACH,EAAGA,CACL,GACMC,EAAkB,CACtB,KAAM,QACN,MAAO,OACP,OAAQ,MACR,IAAK,QACP,EACMC,EAAuB,CAC3B,MAAO,MACP,IAAK,OACP,EACA,SAASC,EAAMC,EAAOC,EAAOC,EAAK,CAChC,OAAOV,EAAIQ,EAAOT,EAAIU,EAAOC,CAAG,CAAC,CACnC,CACA,SAASC,EAASF,EAAOG,EAAO,CAC9B,OAAO,OAAOH,GAAU,WAAaA,EAAMG,CAAK,EAAIH,CACtD,CACA,SAASI,EAAQC,EAAW,CAC1B,OAAOA,EAAU,MAAM,GAAG,EAAE,CAAC,CAC/B,CACA,SAASC,EAAaD,EAAW,CAC/B,OAAOA,EAAU,MAAM,GAAG,EAAE,CAAC,CAC/B,CACA,SAASE,EAAgBC,EAAM,CAC7B,OAAOA,IAAS,IAAM,IAAM,GAC9B,CACA,SAASC,EAAcD,EAAM,CAC3B,OAAOA,IAAS,IAAM,SAAW,OACnC,CACA,SAASE,EAAYL,EAAW,CAC9B,MAAO,CAAC,MAAO,QAAQ,EAAE,SAASD,EAAQC,CAAS,CAAC,EAAI,IAAM,GAChE,CACA,SAASM,EAAiBN,EAAW,CACnC,OAAOE,EAAgBG,EAAYL,CAAS,CAAC,CAC/C,CACA,SAASO,EAAkBP,EAAWQ,EAAOC,EAAK,CAC5CA,IAAQ,SACVA,EAAM,IAER,MAAMC,EAAYT,EAAaD,CAAS,EAClCW,EAAgBL,EAAiBN,CAAS,EAC1CY,EAASR,EAAcO,CAAa,EAC1C,IAAIE,EAAoBF,IAAkB,IAAMD,KAAeD,EAAM,MAAQ,SAAW,QAAU,OAASC,IAAc,QAAU,SAAW,MAC9I,OAAIF,EAAM,UAAUI,CAAM,EAAIJ,EAAM,SAASI,CAAM,IACjDC,EAAoBC,EAAqBD,CAAiB,GAErD,CAACA,EAAmBC,EAAqBD,CAAiB,CAAC,CACpE,CACA,SAASE,EAAsBf,EAAW,CACxC,MAAMgB,EAAoBF,EAAqBd,CAAS,EACxD,MAAO,CAACiB,EAA8BjB,CAAS,EAAGgB,EAAmBC,EAA8BD,CAAiB,CAAC,CACvH,CACA,SAASC,EAA8BjB,EAAW,CAChD,OAAOA,EAAU,QAAQ,aAAcU,GAAalB,EAAqBkB,CAAS,CAAC,CACrF,CACA,SAASQ,EAAYC,EAAMC,EAASX,EAAK,CACvC,MAAMY,EAAK,CAAC,OAAQ,OAAO,EACrBC,EAAK,CAAC,QAAS,MAAM,EACrBC,EAAK,CAAC,MAAO,QAAQ,EACrBC,EAAK,CAAC,SAAU,KAAK,EAC3B,OAAQL,EAAI,CACV,IAAK,MACL,IAAK,SACH,OAAIV,EAAYW,EAAUE,EAAKD,EACxBD,EAAUC,EAAKC,EACxB,IAAK,OACL,IAAK,QACH,OAAOF,EAAUG,EAAKC,EACxB,QACE,MAAO,EACV,CACH,CACA,SAASC,EAA0BzB,EAAW0B,EAAeC,EAAWlB,EAAK,CAC3E,MAAMC,EAAYT,EAAaD,CAAS,EACxC,IAAI4B,EAAOV,EAAYnB,EAAQC,CAAS,EAAG2B,IAAc,QAASlB,CAAG,EACrE,OAAIC,IACFkB,EAAOA,EAAK,IAAIT,GAAQA,EAAO,IAAMT,CAAS,EAC1CgB,IACFE,EAAOA,EAAK,OAAOA,EAAK,IAAIX,CAA6B,CAAC,IAGvDW,CACT,CACA,SAASd,EAAqBd,EAAW,CACvC,OAAOA,EAAU,QAAQ,yBAA0BmB,GAAQ5B,EAAgB4B,CAAI,CAAC,CAClF,CACA,SAASU,EAAoBC,EAAS,CACpC,MAAO,CACL,IAAK,EACL,MAAO,EACP,OAAQ,EACR,KAAM,EACN,GAAGA,CACP,CACA,CACA,SAASC,EAAiBD,EAAS,CACjC,OAAO,OAAOA,GAAY,SAAWD,EAAoBC,CAAO,EAAI,CAClE,IAAKA,EACL,MAAOA,EACP,OAAQA,EACR,KAAMA,CACV,CACA,CACA,SAASE,EAAiBC,EAAM,CAC9B,MAAO,CACL,GAAGA,EACH,IAAKA,EAAK,EACV,KAAMA,EAAK,EACX,MAAOA,EAAK,EAAIA,EAAK,MACrB,OAAQA,EAAK,EAAIA,EAAK,MAC1B,CACA","x_google_ignoreList":[0]}

package/dist/index.cjs282.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const r=require("./index.cjs364.js");(function(e){function u(t){return t&&t.__esModule?t:{default:t}}e.exports=u,e.exports.__esModule=!0,e.exports.default=e.exports})(r.__module);var o=r.__module.exports;exports.interopRequireDefaultExports=o;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function s(e){return a(e)?(e.nodeName||"").toLowerCase():"#document"}function i(e){var t;return(e==null||(t=e.ownerDocument)==null?void 0:t.defaultView)||window}function N(e){var t;return(t=(a(e)?e.ownerDocument:e.document)||window.document)==null?void 0:t.documentElement}function a(e){return e instanceof Node||e instanceof i(e).Node}function b(e){return e instanceof Element||e instanceof i(e).Element}function d(e){return e instanceof HTMLElement||e instanceof i(e).HTMLElement}function u(e){return typeof ShadowRoot>"u"?!1:e instanceof ShadowRoot||e instanceof i(e).ShadowRoot}function m(e){const{overflow:t,overflowX:n,overflowY:o,display:r}=p(e);return/auto|scroll|overlay|hidden|clip/.test(t+o+n)&&!["inline","contents"].includes(r)}function T(e){return["table","td","th"].includes(s(e))}function S(e){const t=y(),n=p(e);return n.transform!=="none"||n.perspective!=="none"||(n.containerType?n.containerType!=="normal":!1)||!t&&(n.backdropFilter?n.backdropFilter!=="none":!1)||!t&&(n.filter?n.filter!=="none":!1)||["transform","perspective","filter"].some(o=>(n.willChange||"").includes(o))||["paint","layout","strict","content"].some(o=>(n.contain||"").includes(o))}function h(e){let t=l(e);for(;d(t)&&!w(t);){if(S(t))return t;t=l(t)}return null}function y(){return typeof CSS>"u"||!CSS.supports?!1:CSS.supports("-webkit-backdrop-filter","none")}function w(e){return["html","body","#document"].includes(s(e))}function p(e){return i(e).getComputedStyle(e)}function v(e){return b(e)?{scrollLeft:e.scrollLeft,scrollTop:e.scrollTop}:{scrollLeft:e.pageXOffset,scrollTop:e.pageYOffset}}function l(e){if(s(e)==="html")return e;const t=e.assignedSlot||e.parentNode||u(e)&&e.host||N(e);return u(t)?t.host:t}function g(e){const t=l(e);return w(t)?e.ownerDocument?e.ownerDocument.body:e.body:d(t)&&m(t)?t:g(t)}function f(e,t,n){var o;t===void 0&&(t=[]),n===void 0&&(n=!0);const r=g(e),E=r===((o=e.ownerDocument)==null?void 0:o.body),c=i(r);return E?t.concat(c,c.visualViewport||[],m(r)?r:[],c.frameElement&&n?f(c.frameElement):[]):t.concat(r,f(r,[],n))}exports.getComputedStyle=p;exports.getContainingBlock=h;exports.getDocumentElement=N;exports.getNearestOverflowAncestor=g;exports.getNodeName=s;exports.getNodeScroll=v;exports.getOverflowAncestors=f;exports.getParentNode=l;exports.getWindow=i;exports.isContainingBlock=S;exports.isElement=b;exports.isHTMLElement=d;exports.isLastTraversableNode=w;exports.isNode=a;exports.isOverflowElement=m;exports.isShadowRoot=u;exports.isTableElement=T;exports.isWebKit=y;
 //# sourceMappingURL=index.cjs282.js.map

package/dist/index.cjs282.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs282.js","sources":["../../../node_modules/@babel/runtime/helpers/interopRequireDefault.js"],"sourcesContent":["function _interopRequireDefault(obj) {\n  return obj && obj.__esModule ? obj : {\n    \"default\": obj\n  };\n}\nmodule.exports = _interopRequireDefault, module.exports.__esModule = true, module.exports[\"default\"] = module.exports;"],"names":["_interopRequireDefault","obj","module"],"mappings":"kIAAA,SAASA,EAAuBC,EAAK,CAC5B,OAAAA,GAAOA,EAAI,WAAaA,EAAM,CACnC,QAAWA,CAAA,CAEf,CACAC,EAAA,QAAiBF,EAAwBE,EAA4B,QAAA,WAAA,GAAMA,EAAO,QAAQ,QAAaA,EAAO","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs282.js","sources":["../../../node_modules/@floating-ui/utils/dist/floating-ui.utils.dom.mjs"],"sourcesContent":["function getNodeName(node) {\n  if (isNode(node)) {\n    return (node.nodeName || '').toLowerCase();\n  }\n  // Mocked nodes in testing environments may not be instances of Node. By\n  // returning `#document` an infinite loop won't occur.\n  // https://github.com/floating-ui/floating-ui/issues/2317\n  return '#document';\n}\nfunction getWindow(node) {\n  var _node$ownerDocument;\n  return (node == null || (_node$ownerDocument = node.ownerDocument) == null ? void 0 : _node$ownerDocument.defaultView) || window;\n}\nfunction getDocumentElement(node) {\n  var _ref;\n  return (_ref = (isNode(node) ? node.ownerDocument : node.document) || window.document) == null ? void 0 : _ref.documentElement;\n}\nfunction isNode(value) {\n  return value instanceof Node || value instanceof getWindow(value).Node;\n}\nfunction isElement(value) {\n  return value instanceof Element || value instanceof getWindow(value).Element;\n}\nfunction isHTMLElement(value) {\n  return value instanceof HTMLElement || value instanceof getWindow(value).HTMLElement;\n}\nfunction isShadowRoot(value) {\n  // Browsers without `ShadowRoot` support.\n  if (typeof ShadowRoot === 'undefined') {\n    return false;\n  }\n  return value instanceof ShadowRoot || value instanceof getWindow(value).ShadowRoot;\n}\nfunction isOverflowElement(element) {\n  const {\n    overflow,\n    overflowX,\n    overflowY,\n    display\n  } = getComputedStyle(element);\n  return /auto|scroll|overlay|hidden|clip/.test(overflow + overflowY + overflowX) && !['inline', 'contents'].includes(display);\n}\nfunction isTableElement(element) {\n  return ['table', 'td', 'th'].includes(getNodeName(element));\n}\nfunction isContainingBlock(element) {\n  const webkit = isWebKit();\n  const css = getComputedStyle(element);\n\n  // https://developer.mozilla.org/en-US/docs/Web/CSS/Containing_block#identifying_the_containing_block\n  return css.transform !== 'none' || css.perspective !== 'none' || (css.containerType ? css.containerType !== 'normal' : false) || !webkit && (css.backdropFilter ? css.backdropFilter !== 'none' : false) || !webkit && (css.filter ? css.filter !== 'none' : false) || ['transform', 'perspective', 'filter'].some(value => (css.willChange || '').includes(value)) || ['paint', 'layout', 'strict', 'content'].some(value => (css.contain || '').includes(value));\n}\nfunction getContainingBlock(element) {\n  let currentNode = getParentNode(element);\n  while (isHTMLElement(currentNode) && !isLastTraversableNode(currentNode)) {\n    if (isContainingBlock(currentNode)) {\n      return currentNode;\n    } else {\n      currentNode = getParentNode(currentNode);\n    }\n  }\n  return null;\n}\nfunction isWebKit() {\n  if (typeof CSS === 'undefined' || !CSS.supports) return false;\n  return CSS.supports('-webkit-backdrop-filter', 'none');\n}\nfunction isLastTraversableNode(node) {\n  return ['html', 'body', '#document'].includes(getNodeName(node));\n}\nfunction getComputedStyle(element) {\n  return getWindow(element).getComputedStyle(element);\n}\nfunction getNodeScroll(element) {\n  if (isElement(element)) {\n    return {\n      scrollLeft: element.scrollLeft,\n      scrollTop: element.scrollTop\n    };\n  }\n  return {\n    scrollLeft: element.pageXOffset,\n    scrollTop: element.pageYOffset\n  };\n}\nfunction getParentNode(node) {\n  if (getNodeName(node) === 'html') {\n    return node;\n  }\n  const result =\n  // Step into the shadow DOM of the parent of a slotted node.\n  node.assignedSlot ||\n  // DOM Element detected.\n  node.parentNode ||\n  // ShadowRoot detected.\n  isShadowRoot(node) && node.host ||\n  // Fallback.\n  getDocumentElement(node);\n  return isShadowRoot(result) ? result.host : result;\n}\nfunction getNearestOverflowAncestor(node) {\n  const parentNode = getParentNode(node);\n  if (isLastTraversableNode(parentNode)) {\n    return node.ownerDocument ? node.ownerDocument.body : node.body;\n  }\n  if (isHTMLElement(parentNode) && isOverflowElement(parentNode)) {\n    return parentNode;\n  }\n  return getNearestOverflowAncestor(parentNode);\n}\nfunction getOverflowAncestors(node, list, traverseIframes) {\n  var _node$ownerDocument2;\n  if (list === void 0) {\n    list = [];\n  }\n  if (traverseIframes === void 0) {\n    traverseIframes = true;\n  }\n  const scrollableAncestor = getNearestOverflowAncestor(node);\n  const isBody = scrollableAncestor === ((_node$ownerDocument2 = node.ownerDocument) == null ? void 0 : _node$ownerDocument2.body);\n  const win = getWindow(scrollableAncestor);\n  if (isBody) {\n    return list.concat(win, win.visualViewport || [], isOverflowElement(scrollableAncestor) ? scrollableAncestor : [], win.frameElement && traverseIframes ? getOverflowAncestors(win.frameElement) : []);\n  }\n  return list.concat(scrollableAncestor, getOverflowAncestors(scrollableAncestor, [], traverseIframes));\n}\n\nexport { getComputedStyle, getContainingBlock, getDocumentElement, getNearestOverflowAncestor, getNodeName, getNodeScroll, getOverflowAncestors, getParentNode, getWindow, isContainingBlock, isElement, isHTMLElement, isLastTraversableNode, isNode, isOverflowElement, isShadowRoot, isTableElement, isWebKit };\n"],"names":["getNodeName","node","isNode","getWindow","_node$ownerDocument","getDocumentElement","_ref","value","isElement","isHTMLElement","isShadowRoot","isOverflowElement","element","overflow","overflowX","overflowY","display","getComputedStyle","isTableElement","isContainingBlock","webkit","isWebKit","css","getContainingBlock","currentNode","getParentNode","isLastTraversableNode","getNodeScroll","result","getNearestOverflowAncestor","parentNode","getOverflowAncestors","list","traverseIframes","_node$ownerDocument2","scrollableAncestor","isBody","win"],"mappings":"gFAAA,SAASA,EAAYC,EAAM,CACzB,OAAIC,EAAOD,CAAI,GACLA,EAAK,UAAY,IAAI,YAAW,EAKnC,WACT,CACA,SAASE,EAAUF,EAAM,CACvB,IAAIG,EACJ,OAAQH,GAAQ,OAASG,EAAsBH,EAAK,gBAAkB,KAAO,OAASG,EAAoB,cAAgB,MAC5H,CACA,SAASC,EAAmBJ,EAAM,CAChC,IAAIK,EACJ,OAAQA,GAAQJ,EAAOD,CAAI,EAAIA,EAAK,cAAgBA,EAAK,WAAa,OAAO,WAAa,KAAO,OAASK,EAAK,eACjH,CACA,SAASJ,EAAOK,EAAO,CACrB,OAAOA,aAAiB,MAAQA,aAAiBJ,EAAUI,CAAK,EAAE,IACpE,CACA,SAASC,EAAUD,EAAO,CACxB,OAAOA,aAAiB,SAAWA,aAAiBJ,EAAUI,CAAK,EAAE,OACvE,CACA,SAASE,EAAcF,EAAO,CAC5B,OAAOA,aAAiB,aAAeA,aAAiBJ,EAAUI,CAAK,EAAE,WAC3E,CACA,SAASG,EAAaH,EAAO,CAE3B,OAAI,OAAO,WAAe,IACjB,GAEFA,aAAiB,YAAcA,aAAiBJ,EAAUI,CAAK,EAAE,UAC1E,CACA,SAASI,EAAkBC,EAAS,CAClC,KAAM,CACJ,SAAAC,EACA,UAAAC,EACA,UAAAC,EACA,QAAAC,CACJ,EAAMC,EAAiBL,CAAO,EAC5B,MAAO,kCAAkC,KAAKC,EAAWE,EAAYD,CAAS,GAAK,CAAC,CAAC,SAAU,UAAU,EAAE,SAASE,CAAO,CAC7H,CACA,SAASE,EAAeN,EAAS,CAC/B,MAAO,CAAC,QAAS,KAAM,IAAI,EAAE,SAASZ,EAAYY,CAAO,CAAC,CAC5D,CACA,SAASO,EAAkBP,EAAS,CAClC,MAAMQ,EAASC,IACTC,EAAML,EAAiBL,CAAO,EAGpC,OAAOU,EAAI,YAAc,QAAUA,EAAI,cAAgB,SAAWA,EAAI,cAAgBA,EAAI,gBAAkB,SAAW,KAAU,CAACF,IAAWE,EAAI,eAAiBA,EAAI,iBAAmB,OAAS,KAAU,CAACF,IAAWE,EAAI,OAASA,EAAI,SAAW,OAAS,KAAU,CAAC,YAAa,cAAe,QAAQ,EAAE,KAAKf,IAAUe,EAAI,YAAc,IAAI,SAASf,CAAK,CAAC,GAAK,CAAC,QAAS,SAAU,SAAU,SAAS,EAAE,KAAKA,IAAUe,EAAI,SAAW,IAAI,SAASf,CAAK,CAAC,CACnc,CACA,SAASgB,EAAmBX,EAAS,CACnC,IAAIY,EAAcC,EAAcb,CAAO,EACvC,KAAOH,EAAce,CAAW,GAAK,CAACE,EAAsBF,CAAW,GAAG,CACxE,GAAIL,EAAkBK,CAAW,EAC/B,OAAOA,EAEPA,EAAcC,EAAcD,CAAW,CAE1C,CACD,OAAO,IACT,CACA,SAASH,GAAW,CAClB,OAAI,OAAO,IAAQ,KAAe,CAAC,IAAI,SAAiB,GACjD,IAAI,SAAS,0BAA2B,MAAM,CACvD,CACA,SAASK,EAAsBzB,EAAM,CACnC,MAAO,CAAC,OAAQ,OAAQ,WAAW,EAAE,SAASD,EAAYC,CAAI,CAAC,CACjE,CACA,SAASgB,EAAiBL,EAAS,CACjC,OAAOT,EAAUS,CAAO,EAAE,iBAAiBA,CAAO,CACpD,CACA,SAASe,EAAcf,EAAS,CAC9B,OAAIJ,EAAUI,CAAO,EACZ,CACL,WAAYA,EAAQ,WACpB,UAAWA,EAAQ,SACzB,EAES,CACL,WAAYA,EAAQ,YACpB,UAAWA,EAAQ,WACvB,CACA,CACA,SAASa,EAAcxB,EAAM,CAC3B,GAAID,EAAYC,CAAI,IAAM,OACxB,OAAOA,EAET,MAAM2B,EAEN3B,EAAK,cAELA,EAAK,YAELS,EAAaT,CAAI,GAAKA,EAAK,MAE3BI,EAAmBJ,CAAI,EACvB,OAAOS,EAAakB,CAAM,EAAIA,EAAO,KAAOA,CAC9C,CACA,SAASC,EAA2B5B,EAAM,CACxC,MAAM6B,EAAaL,EAAcxB,CAAI,EACrC,OAAIyB,EAAsBI,CAAU,EAC3B7B,EAAK,cAAgBA,EAAK,cAAc,KAAOA,EAAK,KAEzDQ,EAAcqB,CAAU,GAAKnB,EAAkBmB,CAAU,EACpDA,EAEFD,EAA2BC,CAAU,CAC9C,CACA,SAASC,EAAqB9B,EAAM+B,EAAMC,EAAiB,CACzD,IAAIC,EACAF,IAAS,SACXA,EAAO,CAAA,GAELC,IAAoB,SACtBA,EAAkB,IAEpB,MAAME,EAAqBN,EAA2B5B,CAAI,EACpDmC,EAASD,MAAyBD,EAAuBjC,EAAK,gBAAkB,KAAO,OAASiC,EAAqB,MACrHG,EAAMlC,EAAUgC,CAAkB,EACxC,OAAIC,EACKJ,EAAK,OAAOK,EAAKA,EAAI,gBAAkB,CAAE,EAAE1B,EAAkBwB,CAAkB,EAAIA,EAAqB,GAAIE,EAAI,cAAgBJ,EAAkBF,EAAqBM,EAAI,YAAY,EAAI,CAAA,CAAE,EAE/LL,EAAK,OAAOG,EAAoBJ,EAAqBI,EAAoB,CAAE,EAAEF,CAAe,CAAC,CACtG","x_google_ignoreList":[0]}

package/dist/index.cjs283.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index.cjs365.js");var r,t;function i(){if(t)return r;t=1;var e=n.__require()();r=e;try{regeneratorRuntime=e}catch{typeof globalThis=="object"?globalThis.regeneratorRuntime=e:Function("r","regeneratorRuntime = r")(e)}return r}exports.__require=i;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});exports.__assign=function(){return exports.__assign=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},exports.__assign.apply(this,arguments)};function s(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 p(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))}exports.__rest=s;exports.__spreadArray=p;
 //# sourceMappingURL=index.cjs283.js.map

package/dist/index.cjs283.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs283.js","sources":["../../../node_modules/@babel/runtime/regenerator/index.js"],"sourcesContent":["// TODO(Babel 8): Remove this file.\n\nvar runtime = require(\"../helpers/regeneratorRuntime\")();\nmodule.exports = runtime;\n\n// Copied from https://github.com/facebook/regenerator/blob/main/packages/runtime/runtime.js#L736=\ntry {\n  regeneratorRuntime = runtime;\n} catch (accidentalStrictMode) {\n  if (typeof globalThis === \"object\") {\n    globalThis.regeneratorRuntime = runtime;\n  } else {\n    Function(\"r\", \"regeneratorRuntime = r\")(runtime);\n  }\n}\n"],"names":["runtime","require$$0","regenerator"],"mappings":"4JAEA,IAAIA,EAAUC,EAAyC,UAAA,IACtCC,EAAAF,EAGjB,GAAI,CACmB,mBAAAA,CACvB,MAA+B,CACzB,OAAO,YAAe,SACxB,WAAW,mBAAqBA,EAEvB,SAAA,IAAK,wBAAwB,EAAEA,CAAO,CAEnD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs283.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":"gFA+BWA,QAAAA,SAAW,UAAW,CAC/BA,eAAAA,SAAW,OAAO,QAAU,SAAkBC,EAAG,CAC7C,QAASC,EAAGC,EAAI,EAAGC,EAAI,UAAU,OAAQD,EAAIC,EAAGD,IAAK,CACjDD,EAAI,UAAUC,CAAC,EACf,QAASE,KAAKH,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGG,CAAC,IAAGJ,EAAEI,CAAC,EAAIH,EAAEG,CAAC,EAC9E,CACD,OAAOJ,CACV,EACMD,iBAAS,MAAM,KAAM,SAAS,CACvC,EAEO,SAASM,EAAOJ,EAAG,EAAG,CAC3B,IAAID,EAAI,CAAA,EACR,QAASI,KAAKH,EAAO,OAAO,UAAU,eAAe,KAAKA,EAAGG,CAAC,GAAK,EAAE,QAAQA,CAAC,EAAI,IAC9EJ,EAAEI,CAAC,EAAIH,EAAEG,CAAC,GACd,GAAIH,GAAK,MAAQ,OAAO,OAAO,uBAA0B,WACrD,QAASC,EAAI,EAAGE,EAAI,OAAO,sBAAsBH,CAAC,EAAGC,EAAIE,EAAE,OAAQF,IAC3D,EAAE,QAAQE,EAAEF,CAAC,CAAC,EAAI,GAAK,OAAO,UAAU,qBAAqB,KAAKD,EAAGG,EAAEF,CAAC,CAAC,IACzEF,EAAEI,EAAEF,CAAC,CAAC,EAAID,EAAEG,EAAEF,CAAC,CAAC,GAE5B,OAAOF,CACT,CAiKO,SAASM,EAAcC,EAAIC,EAAMC,EAAM,CAC5C,GAAIA,GAAQ,UAAU,SAAW,EAAG,QAASP,EAAI,EAAGQ,EAAIF,EAAK,OAAQG,EAAIT,EAAIQ,EAAGR,KACxES,GAAM,EAAET,KAAKM,MACRG,IAAIA,EAAK,MAAM,UAAU,MAAM,KAAKH,EAAM,EAAGN,CAAC,GACnDS,EAAGT,CAAC,EAAIM,EAAKN,CAAC,GAGtB,OAAOK,EAAG,OAAOI,GAAM,MAAM,UAAU,MAAM,KAAKH,CAAI,CAAC,CACzD","x_google_ignoreList":[0]}

package/dist/index.cjs284.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const _=require("./index.cjs366.js");var p;function x(){return p||(p=1,function(n){function f(a,i,c,o,u,s,r){try{var t=a[s](r),e=t.value}catch(l){c(l);return}t.done?i(e):Promise.resolve(e).then(o,u)}function y(a){return function(){var i=this,c=arguments;return new Promise(function(o,u){var s=a.apply(i,c);function r(e){f(s,o,u,r,t,"next",e)}function t(e){f(s,o,u,r,t,"throw",e)}r(void 0)})}}n.exports=y,n.exports.__esModule=!0,n.exports.default=n.exports}(_.__module)),_.__module.exports}exports.__require=x;
+"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const n=require("./index.cjs283.js"),j=require("react"),f=require("./index.cjs364.js"),q=require("./index.cjs365.js"),M=require("./index.cjs366.js");function k(e){const t=Object.create(null,{[Symbol.toStringTag]:{value:"Module"}});if(e){for(const a in e)if(a!=="default"){const l=Object.getOwnPropertyDescriptor(e,a);Object.defineProperty(t,a,l.get?l:{enumerable:!0,get:()=>e[a]})}}return t.default=e,Object.freeze(t)}const r=k(j);var o=function(){},s=r.forwardRef(function(e,t){var a=r.useRef(null),l=r.useState({onScrollCapture:o,onWheelCapture:o,onTouchMoveCapture:o}),m=l[0],v=l[1],g=e.forwardProps,i=e.children,h=e.className,_=e.removeScrollBar,b=e.enabled,C=e.shards,S=e.sideCar,P=e.noIsolation,R=e.inert,w=e.allowPinchZoom,c=e.as,N=c===void 0?"div":c,y=n.__rest(e,["forwardProps","children","className","removeScrollBar","enabled","shards","sideCar","noIsolation","inert","allowPinchZoom","as"]),O=S,u=M.useMergeRefs([a,t]),d=n.__assign(n.__assign({},y),m);return r.createElement(r.Fragment,null,b&&r.createElement(O,{sideCar:q.effectCar,removeScrollBar:_,shards:C,noIsolation:P,inert:R,setCallbacks:v,allowPinchZoom:!!w,lockRef:a}),g?r.cloneElement(r.Children.only(i),n.__assign(n.__assign({},d),{ref:u})):r.createElement(N,n.__assign({},d,{className:h,ref:u}),i))});s.defaultProps={enabled:!0,removeScrollBar:!0,inert:!1};s.classNames={fullWidth:f.fullWidthClassName,zeroRight:f.zeroRightClassName};exports.RemoveScroll=s;
 //# sourceMappingURL=index.cjs284.js.map