@performant-software/visualize 2.3.4-beta.3 → 2.3.4-beta.5

package/dist/index.cjs159.js

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs160.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 t=require("./index.cjs160.js");function n(e){return t(e,1/0)}module.exports=n;
 //# sourceMappingURL=index.cjs159.js.map

package/dist/index.cjs159.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs222.js"),s=require("./index.cjs223.js"),c=e(s);module.exports=c;
+"use strict";const e=require("./index.cjs221.js"),s=require("./index.cjs222.js"),c=e(s);module.exports=c;
 //# sourceMappingURL=index.cjs16.js.map

package/dist/index.cjs160.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs6.js");function u(t,e,r){return s.slice.call(t,e==null||r?1:e)}module.exports=u;
+"use strict";const n=require("./index.cjs229.js"),h=require("./index.cjs104.js"),m=require("./index.cjs210.js"),i=require("./index.cjs124.js"),o=require("./index.cjs166.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.cjs160.js.map

package/dist/index.cjs160.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs160.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":"gDAKwB,SAAAA,EAAKC,EAAOC,EAAGC,EAAO,CAC5C,OAAOC,QAAM,KAAKH,EAAOC,GAAK,MAAQC,EAAQ,EAAID,CAAC,CACrD","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs160.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.cjs161.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs139.js");function r(t){return e(t,Boolean)}module.exports=r;
+"use strict";const s=require("./index.cjs219.js"),a=require("./index.cjs155.js"),d=require("./index.cjs147.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.cjs161.js.map

package/dist/index.cjs161.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs227.js");function r(t,e){return n(t,e,!1)}module.exports=r;
+"use strict";const c=require("./index.cjs231.js"),i=require("./index.cjs208.js"),n=c(function(o,r,s){i(o,s)?o[s].push(r):o[s]=[r]});module.exports=n;
 //# sourceMappingURL=index.cjs162.js.map

package/dist/index.cjs162.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const p=require("./index.cjs73.js"),_=require("./index.cjs220.js"),b=require("./index.cjs211.js"),g=require("./index.cjs143.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 o=require("./index.cjs231.js"),r=o(function(t,e,n){t[n]=e});module.exports=r;
 //# sourceMappingURL=index.cjs163.js.map

package/dist/index.cjs163.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs163.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":"8IAUA,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.cjs163.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.cjs164.js

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs211.js"),o=require("./index.cjs143.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.cjs231.js"),s=require("./index.cjs208.js"),t=n(function(o,e,c){s(o,c)?o[c]++:o[c]=1});module.exports=t;
 //# sourceMappingURL=index.cjs164.js.map

package/dist/index.cjs164.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const n=require("./index.cjs146.js"),s=require("./index.cjs211.js"),c=require("./index.cjs144.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 s=require("./index.cjs231.js"),u=s(function(t,r,o){t[o?0:1].push(r)},!0);module.exports=u;
 //# sourceMappingURL=index.cjs165.js.map

package/dist/index.cjs165.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const c=require("./index.cjs211.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 e=require("./index.cjs94.js"),u=require("./index.cjs6.js"),t=require("./index.cjs86.js"),i=require("./index.cjs229.js"),f=require("./index.cjs147.js"),n=require("./index.cjs117.js"),s=require("./index.cjs104.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.cjs166.js.map

package/dist/index.cjs166.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs166.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.cjs166.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":"wOASA,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.cjs167.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 r=require("./index.cjs229.js"),t=require("./index.cjs102.js");function n(e){return e==null?0:r(e)?e.length:t(e).length}module.exports=n;
 //# sourceMappingURL=index.cjs167.js.map

package/dist/index.cjs167.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const u=require("./index.cjs6.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 e=require("./index.cjs169.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.cjs168.js.map

package/dist/index.cjs168.js.map

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

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs62.js"),u=require("react");var n={source:{x:0,y:0},target:{x:0,y:0}};function t(s){var i=s.link,r=i===void 0?n:i;return u.createElement("line",{x1:r.source.x,y1:r.source.y,x2:r.target.x,y2:r.target.y,strokeWidth:2,stroke:"#999",strokeOpacity:.6})}t.propTypes={link:e.shape({source:e.shape({x:e.number.isRequired,y:e.number.isRequired}).isRequired,target:e.shape({x:e.number.isRequired,y:e.number.isRequired}).isRequired})};module.exports=t;
+"use strict";const l=require("./index.cjs6.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.cjs169.js.map

package/dist/index.cjs169.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs169.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultLink.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nvar DEFAULT_LINK = {\n  source: {\n    x: 0,\n    y: 0\n  },\n  target: {\n    x: 0,\n    y: 0\n  }\n};\nexport default function HierarchyDefaultLink(_ref) {\n  var _ref$link = _ref.link,\n    link = _ref$link === void 0 ? DEFAULT_LINK : _ref$link;\n  return /*#__PURE__*/React.createElement(\"line\", {\n    x1: link.source.x,\n    y1: link.source.y,\n    x2: link.target.x,\n    y2: link.target.y,\n    strokeWidth: 2,\n    stroke: \"#999\",\n    strokeOpacity: 0.6\n  });\n}\nHierarchyDefaultLink.propTypes = {\n  link: _pt.shape({\n    source: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired,\n    target: _pt.shape({\n      x: _pt.number.isRequired,\n      y: _pt.number.isRequired\n    }).isRequired\n  })\n};"],"names":["DEFAULT_LINK","HierarchyDefaultLink","_ref","_ref$link","link","React","_pt"],"mappings":"oEAEA,IAAIA,EAAe,CACjB,OAAQ,CACN,EAAG,EACH,EAAG,CACL,EACA,OAAQ,CACN,EAAG,EACH,EAAG,CACL,CACF,EACA,SAAwBC,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAASH,EAAeG,EAC3B,OAAAE,EAAM,cAAc,OAAQ,CAC9C,GAAID,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,GAAIA,EAAK,OAAO,EAChB,YAAa,EACb,OAAQ,OACR,cAAe,EAAA,CAChB,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UACf,CAAA,EAAE,WACH,OAAQA,EAAI,MAAM,CAChB,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,UACf,CAAA,EAAE,UAAA,CACJ,CACH","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs169.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":"gDAKwB,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.cjs17.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs222.js"),s=require("./index.cjs224.js"),c=e(s);module.exports=c;
+"use strict";const e=require("./index.cjs221.js"),s=require("./index.cjs223.js"),c=e(s);module.exports=c;
 //# sourceMappingURL=index.cjs17.js.map

package/dist/index.cjs170.js

@@ -1,2 +1,2 @@
-"use strict";const e=require("./index.cjs62.js"),o=require("react");function i(c){var n=c.node,r=n===void 0?{x:0,y:0,r:15}:n;return o.createElement("circle",{cx:r.x,cy:r.y,r:r.r||15,fill:"#21D4FD"})}i.propTypes={node:e.shape({x:e.number.isRequired,y:e.number.isRequired,r:e.number})};module.exports=i;
+"use strict";const n=require("./index.cjs171.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.cjs170.js.map

package/dist/index.cjs170.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs170.js","sources":["../../../node_modules/@visx/hierarchy/esm/HierarchyDefaultNode.js"],"sourcesContent":["import _pt from \"prop-types\";\nimport React from 'react';\nexport default function HierarchyDefaultNode(_ref) {\n  var _ref$node = _ref.node,\n    node = _ref$node === void 0 ? {\n      x: 0,\n      y: 0,\n      r: 15\n    } : _ref$node;\n  return /*#__PURE__*/React.createElement(\"circle\", {\n    cx: node.x,\n    cy: node.y,\n    r: node.r || 15,\n    fill: \"#21D4FD\"\n  });\n}\nHierarchyDefaultNode.propTypes = {\n  node: _pt.shape({\n    x: _pt.number.isRequired,\n    y: _pt.number.isRequired,\n    r: _pt.number\n  })\n};"],"names":["HierarchyDefaultNode","_ref","_ref$node","node","React","_pt"],"mappings":"oEAEA,SAAwBA,EAAqBC,EAAM,CACjD,IAAIC,EAAYD,EAAK,KACnBE,EAAOD,IAAc,OAAS,CAC5B,EAAG,EACH,EAAG,EACH,EAAG,EACD,EAAAA,EACc,OAAAE,EAAM,cAAc,SAAU,CAChD,GAAID,EAAK,EACT,GAAIA,EAAK,EACT,EAAGA,EAAK,GAAK,GACb,KAAM,SAAA,CACP,CACH,CACAH,EAAqB,UAAY,CAC/B,KAAMK,EAAI,MAAM,CACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,OAAO,WACd,EAAGA,EAAI,MAAA,CACR,CACH","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs170.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.cjs171.js

@@ -1,2 +1,2 @@
-"use strict";const k=require("./index.cjs37.js");function R(r,n){return r.parent===n.parent?1:2}function S(r){var n=r.children;return n?n[0]:r.t}function B(r){var n=r.children;return n?n[n.length-1]:r.t}function W(r,n,c){var l=c/(n.i-r.i);n.c-=l,n.s+=c,r.c+=l,n.z+=c,n.m+=c}function b(r){for(var n=0,c=0,l=r.children,u=l.length,s;--u>=0;)s=l[u],s.z+=n,s.m+=n,n+=s.s+(c+=s.c)}function j(r,n,c){return r.a.parent===n.parent?r.a:c}function A(r,n){this._=r,this.parent=null,this.children=null,this.A=null,this.a=this,this.z=0,this.m=0,this.c=0,this.s=0,this.t=null,this.i=n}A.prototype=Object.create(k.Node.prototype);function o(r){for(var n=new A(r,0),c,l=[n],u,s,x,y;c=l.pop();)if(s=c._.children)for(c.children=new Array(y=s.length),x=y-1;x>=0;--x)l.push(u=c.children[x]=new A(s[x],x)),u.parent=c;return(n.parent=new A(null,0)).children=[n],n}function q(){var r=R,n=1,c=1,l=null;function u(e){var f=o(e);if(f.eachAfter(s),f.parent.m=-f.z,f.eachBefore(x),l)e.eachBefore(N);else{var d=e,t=e,a=e;e.eachBefore(function(i){i.x<d.x&&(d=i),i.x>t.x&&(t=i),i.depth>a.depth&&(a=i)});var h=d===t?1:r(d,t)/2,z=h-d.x,g=n/(t.x+h+z),_=c/(a.depth||1);e.eachBefore(function(i){i.x=(i.x+z)*g,i.y=i.depth*_})}return e}function s(e){var f=e.children,d=e.parent.children,t=e.i?d[e.i-1]:null;if(f){b(e);var a=(f[0].z+f[f.length-1].z)/2;t?(e.z=t.z+r(e._,t._),e.m=e.z-a):e.z=a}else t&&(e.z=t.z+r(e._,t._));e.parent.A=y(e,t,e.parent.A||d[0])}function x(e){e._.x=e.z+e.parent.m,e.m+=e.parent.m}function y(e,f,d){if(f){for(var t=e,a=e,h=f,z=t.parent.children[0],g=t.m,_=a.m,i=h.m,w=z.m,p;h=B(h),t=S(t),h&&t;)z=S(z),a=B(a),a.a=e,p=h.z+i-t.z-g+r(h._,t._),p>0&&(W(j(h,e,d),e,p),g+=p,_+=p),i+=h.m,g+=t.m,w+=z.m,_+=a.m;h&&!B(a)&&(a.t=h,a.m+=i-_),t&&!S(z)&&(z.t=t,z.m+=g-w,d=e)}return d}function N(e){e.x*=n,e.y=e.depth*c}return u.separation=function(e){return arguments.length?(r=e,u):r},u.size=function(e){return arguments.length?(l=!1,n=+e[0],c=+e[1],u):l?null:[n,c]},u.nodeSize=function(e){return arguments.length?(l=!0,n=+e[0],c=+e[1],u):l?[n,c]:null},u}module.exports=q;
+"use strict";const s=require("./index.cjs6.js");function u(t,e,r){return s.slice.call(t,e==null||r?1:e)}module.exports=u;
 //# sourceMappingURL=index.cjs171.js.map

package/dist/index.cjs171.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs171.js","sources":["../../../node_modules/d3-hierarchy/src/tree.js"],"sourcesContent":["import {Node} from \"./hierarchy/index.js\";\n\nfunction defaultSeparation(a, b) {\n  return a.parent === b.parent ? 1 : 2;\n}\n\n// function radialSeparation(a, b) {\n//   return (a.parent === b.parent ? 1 : 2) / a.depth;\n// }\n\n// This function is used to traverse the left contour of a subtree (or\n// subforest). It returns the successor of v on this contour. This successor is\n// either given by the leftmost child of v or by the thread of v. The function\n// returns null if and only if v is on the highest level of its subtree.\nfunction nextLeft(v) {\n  var children = v.children;\n  return children ? children[0] : v.t;\n}\n\n// This function works analogously to nextLeft.\nfunction nextRight(v) {\n  var children = v.children;\n  return children ? children[children.length - 1] : v.t;\n}\n\n// Shifts the current subtree rooted at w+. This is done by increasing\n// prelim(w+) and mod(w+) by shift.\nfunction moveSubtree(wm, wp, shift) {\n  var change = shift / (wp.i - wm.i);\n  wp.c -= change;\n  wp.s += shift;\n  wm.c += change;\n  wp.z += shift;\n  wp.m += shift;\n}\n\n// All other shifts, applied to the smaller subtrees between w- and w+, are\n// performed by this function. To prepare the shifts, we have to adjust\n// change(w+), shift(w+), and change(w-).\nfunction executeShifts(v) {\n  var shift = 0,\n      change = 0,\n      children = v.children,\n      i = children.length,\n      w;\n  while (--i >= 0) {\n    w = children[i];\n    w.z += shift;\n    w.m += shift;\n    shift += w.s + (change += w.c);\n  }\n}\n\n// If vi-’s ancestor is a sibling of v, returns vi-’s ancestor. Otherwise,\n// returns the specified (default) ancestor.\nfunction nextAncestor(vim, v, ancestor) {\n  return vim.a.parent === v.parent ? vim.a : ancestor;\n}\n\nfunction TreeNode(node, i) {\n  this._ = node;\n  this.parent = null;\n  this.children = null;\n  this.A = null; // default ancestor\n  this.a = this; // ancestor\n  this.z = 0; // prelim\n  this.m = 0; // mod\n  this.c = 0; // change\n  this.s = 0; // shift\n  this.t = null; // thread\n  this.i = i; // number\n}\n\nTreeNode.prototype = Object.create(Node.prototype);\n\nfunction treeRoot(root) {\n  var tree = new TreeNode(root, 0),\n      node,\n      nodes = [tree],\n      child,\n      children,\n      i,\n      n;\n\n  while (node = nodes.pop()) {\n    if (children = node._.children) {\n      node.children = new Array(n = children.length);\n      for (i = n - 1; i >= 0; --i) {\n        nodes.push(child = node.children[i] = new TreeNode(children[i], i));\n        child.parent = node;\n      }\n    }\n  }\n\n  (tree.parent = new TreeNode(null, 0)).children = [tree];\n  return tree;\n}\n\n// Node-link tree diagram using the Reingold-Tilford \"tidy\" algorithm\nexport default function() {\n  var separation = defaultSeparation,\n      dx = 1,\n      dy = 1,\n      nodeSize = null;\n\n  function tree(root) {\n    var t = treeRoot(root);\n\n    // Compute the layout using Buchheim et al.’s algorithm.\n    t.eachAfter(firstWalk), t.parent.m = -t.z;\n    t.eachBefore(secondWalk);\n\n    // If a fixed node size is specified, scale x and y.\n    if (nodeSize) root.eachBefore(sizeNode);\n\n    // If a fixed tree size is specified, scale x and y based on the extent.\n    // Compute the left-most, right-most, and depth-most nodes for extents.\n    else {\n      var left = root,\n          right = root,\n          bottom = root;\n      root.eachBefore(function(node) {\n        if (node.x < left.x) left = node;\n        if (node.x > right.x) right = node;\n        if (node.depth > bottom.depth) bottom = node;\n      });\n      var s = left === right ? 1 : separation(left, right) / 2,\n          tx = s - left.x,\n          kx = dx / (right.x + s + tx),\n          ky = dy / (bottom.depth || 1);\n      root.eachBefore(function(node) {\n        node.x = (node.x + tx) * kx;\n        node.y = node.depth * ky;\n      });\n    }\n\n    return root;\n  }\n\n  // Computes a preliminary x-coordinate for v. Before that, FIRST WALK is\n  // applied recursively to the children of v, as well as the function\n  // APPORTION. After spacing out the children by calling EXECUTE SHIFTS, the\n  // node v is placed to the midpoint of its outermost children.\n  function firstWalk(v) {\n    var children = v.children,\n        siblings = v.parent.children,\n        w = v.i ? siblings[v.i - 1] : null;\n    if (children) {\n      executeShifts(v);\n      var midpoint = (children[0].z + children[children.length - 1].z) / 2;\n      if (w) {\n        v.z = w.z + separation(v._, w._);\n        v.m = v.z - midpoint;\n      } else {\n        v.z = midpoint;\n      }\n    } else if (w) {\n      v.z = w.z + separation(v._, w._);\n    }\n    v.parent.A = apportion(v, w, v.parent.A || siblings[0]);\n  }\n\n  // Computes all real x-coordinates by summing up the modifiers recursively.\n  function secondWalk(v) {\n    v._.x = v.z + v.parent.m;\n    v.m += v.parent.m;\n  }\n\n  // The core of the algorithm. Here, a new subtree is combined with the\n  // previous subtrees. Threads are used to traverse the inside and outside\n  // contours of the left and right subtree up to the highest common level. The\n  // vertices used for the traversals are vi+, vi-, vo-, and vo+, where the\n  // superscript o means outside and i means inside, the subscript - means left\n  // subtree and + means right subtree. For summing up the modifiers along the\n  // contour, we use respective variables si+, si-, so-, and so+. Whenever two\n  // nodes of the inside contours conflict, we compute the left one of the\n  // greatest uncommon ancestors using the function ANCESTOR and call MOVE\n  // SUBTREE to shift the subtree and prepare the shifts of smaller subtrees.\n  // Finally, we add a new thread (if necessary).\n  function apportion(v, w, ancestor) {\n    if (w) {\n      var vip = v,\n          vop = v,\n          vim = w,\n          vom = vip.parent.children[0],\n          sip = vip.m,\n          sop = vop.m,\n          sim = vim.m,\n          som = vom.m,\n          shift;\n      while (vim = nextRight(vim), vip = nextLeft(vip), vim && vip) {\n        vom = nextLeft(vom);\n        vop = nextRight(vop);\n        vop.a = v;\n        shift = vim.z + sim - vip.z - sip + separation(vim._, vip._);\n        if (shift > 0) {\n          moveSubtree(nextAncestor(vim, v, ancestor), v, shift);\n          sip += shift;\n          sop += shift;\n        }\n        sim += vim.m;\n        sip += vip.m;\n        som += vom.m;\n        sop += vop.m;\n      }\n      if (vim && !nextRight(vop)) {\n        vop.t = vim;\n        vop.m += sim - sop;\n      }\n      if (vip && !nextLeft(vom)) {\n        vom.t = vip;\n        vom.m += sip - som;\n        ancestor = v;\n      }\n    }\n    return ancestor;\n  }\n\n  function sizeNode(node) {\n    node.x *= dx;\n    node.y = node.depth * dy;\n  }\n\n  tree.separation = function(x) {\n    return arguments.length ? (separation = x, tree) : separation;\n  };\n\n  tree.size = function(x) {\n    return arguments.length ? (nodeSize = false, dx = +x[0], dy = +x[1], tree) : (nodeSize ? null : [dx, dy]);\n  };\n\n  tree.nodeSize = function(x) {\n    return arguments.length ? (nodeSize = true, dx = +x[0], dy = +x[1], tree) : (nodeSize ? [dx, dy] : null);\n  };\n\n  return tree;\n}\n"],"names":["defaultSeparation","a","b","nextLeft","v","children","nextRight","moveSubtree","wm","wp","shift","change","executeShifts","i","w","nextAncestor","vim","ancestor","TreeNode","node","Node","treeRoot","root","tree","nodes","child","n","d3tree","separation","dx","dy","nodeSize","t","firstWalk","secondWalk","sizeNode","left","right","bottom","s","tx","kx","ky","siblings","midpoint","apportion","vip","vop","vom","sip","sop","sim","som","x"],"mappings":"iDAEA,SAASA,EAAkBC,EAAGC,EAAG,CAC/B,OAAOD,EAAE,SAAWC,EAAE,OAAS,EAAI,CACrC,CAUA,SAASC,EAASC,EAAG,CACnB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAAS,CAAC,EAAID,EAAE,CACpC,CAGA,SAASE,EAAUF,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACjB,OAAOC,EAAWA,EAASA,EAAS,OAAS,CAAC,EAAID,EAAE,CACtD,CAIA,SAASG,EAAYC,EAAIC,EAAIC,EAAO,CAClC,IAAIC,EAASD,GAASD,EAAG,EAAID,EAAG,GAChCC,EAAG,GAAKE,EACRF,EAAG,GAAKC,EACRF,EAAG,GAAKG,EACRF,EAAG,GAAKC,EACRD,EAAG,GAAKC,CACV,CAKA,SAASE,EAAcR,EAAG,CAMjB,QALHM,EAAQ,EACRC,EAAS,EACTN,EAAWD,EAAE,SACbS,EAAIR,EAAS,OACbS,EACG,EAAED,GAAK,GACZC,EAAIT,EAASQ,CAAC,EACdC,EAAE,GAAKJ,EACPI,EAAE,GAAKJ,EACEA,GAAAI,EAAE,GAAKH,GAAUG,EAAE,EAEhC,CAIA,SAASC,EAAaC,EAAKZ,EAAGa,EAAU,CACtC,OAAOD,EAAI,EAAE,SAAWZ,EAAE,OAASY,EAAI,EAAIC,CAC7C,CAEA,SAASC,EAASC,EAAMN,EAAG,CACzB,KAAK,EAAIM,EACT,KAAK,OAAS,KACd,KAAK,SAAW,KAChB,KAAK,EAAI,KACT,KAAK,EAAI,KACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,EACT,KAAK,EAAI,KACT,KAAK,EAAIN,CACX,CAEAK,EAAS,UAAY,OAAO,OAAOE,EAAA,KAAK,SAAS,EAEjD,SAASC,EAASC,EAAM,CASf,QARHC,EAAO,IAAIL,EAASI,EAAM,CAAC,EAC3BH,EACAK,EAAQ,CAACD,CAAI,EACbE,EACApB,EACAQ,EACAa,EAEGP,EAAOK,EAAM,OACd,GAAAnB,EAAWc,EAAK,EAAE,SAEpB,IADAA,EAAK,SAAW,IAAI,MAAMO,EAAIrB,EAAS,MAAM,EACxCQ,EAAIa,EAAI,EAAGb,GAAK,EAAG,EAAEA,EACxBW,EAAM,KAAKC,EAAQN,EAAK,SAASN,CAAC,EAAI,IAAIK,EAASb,EAASQ,CAAC,EAAGA,CAAC,CAAC,EAClEY,EAAM,OAASN,EAKpB,OAAAI,EAAK,OAAS,IAAIL,EAAS,KAAM,CAAC,GAAG,SAAW,CAACK,CAAI,EAC/CA,CACT,CAG0B,SAAAI,GAAA,CACxB,IAAIC,EAAa5B,EACb6B,EAAK,EACLC,EAAK,EACLC,EAAW,KAEf,SAASR,EAAKD,EAAM,CACd,IAAAU,EAAIX,EAASC,CAAI,EAOjB,GAJJU,EAAE,UAAUC,CAAS,EAAGD,EAAE,OAAO,EAAI,CAACA,EAAE,EACxCA,EAAE,WAAWE,CAAU,EAGnBH,EAAUT,EAAK,WAAWa,CAAQ,MAIjC,CACH,IAAIC,EAAOd,EACPe,EAAQf,EACRgB,EAAShB,EACRA,EAAA,WAAW,SAASH,EAAM,CACzBA,EAAK,EAAIiB,EAAK,IAAUA,EAAAjB,GACxBA,EAAK,EAAIkB,EAAM,IAAWA,EAAAlB,GAC1BA,EAAK,MAAQmB,EAAO,QAAgBA,EAAAnB,EAAA,CACzC,EACG,IAAAoB,EAAIH,IAASC,EAAQ,EAAIT,EAAWQ,EAAMC,CAAK,EAAI,EACnDG,EAAKD,EAAIH,EAAK,EACdK,EAAKZ,GAAMQ,EAAM,EAAIE,EAAIC,GACzBE,EAAKZ,GAAMQ,EAAO,OAAS,GAC1BhB,EAAA,WAAW,SAASH,EAAM,CACxBA,EAAA,GAAKA,EAAK,EAAIqB,GAAMC,EACpBtB,EAAA,EAAIA,EAAK,MAAQuB,CAAA,CACvB,CACH,CAEO,OAAApB,CACT,CAMA,SAASW,EAAU7B,EAAG,CACpB,IAAIC,EAAWD,EAAE,SACbuC,EAAWvC,EAAE,OAAO,SACpBU,EAAIV,EAAE,EAAIuC,EAASvC,EAAE,EAAI,CAAC,EAAI,KAClC,GAAIC,EAAU,CACZO,EAAcR,CAAC,EACX,IAAAwC,GAAYvC,EAAS,CAAC,EAAE,EAAIA,EAASA,EAAS,OAAS,CAAC,EAAE,GAAK,EAC/DS,GACFV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,EAC7BV,EAAA,EAAIA,EAAE,EAAIwC,GAEZxC,EAAE,EAAIwC,OAEC9B,IACTV,EAAE,EAAIU,EAAE,EAAIc,EAAWxB,EAAE,EAAGU,EAAE,CAAC,GAE/BV,EAAA,OAAO,EAAIyC,EAAUzC,EAAGU,EAAGV,EAAE,OAAO,GAAKuC,EAAS,CAAC,CAAC,CACxD,CAGA,SAAST,EAAW9B,EAAG,CACrBA,EAAE,EAAE,EAAIA,EAAE,EAAIA,EAAE,OAAO,EACrBA,EAAA,GAAKA,EAAE,OAAO,CAClB,CAaS,SAAAyC,EAAUzC,EAAGU,EAAGG,EAAU,CACjC,GAAIH,EAAG,CAUE,QATHgC,EAAM1C,EACN2C,EAAM3C,EACNY,EAAMF,EACNkC,EAAMF,EAAI,OAAO,SAAS,CAAC,EAC3BG,EAAMH,EAAI,EACVI,EAAMH,EAAI,EACVI,EAAMnC,EAAI,EACVoC,EAAMJ,EAAI,EACVtC,EACGM,EAAMV,EAAUU,CAAG,EAAG8B,EAAM3C,EAAS2C,CAAG,EAAG9B,GAAO8B,GACvDE,EAAM7C,EAAS6C,CAAG,EAClBD,EAAMzC,EAAUyC,CAAG,EACnBA,EAAI,EAAI3C,EACAM,EAAAM,EAAI,EAAImC,EAAML,EAAI,EAAIG,EAAMrB,EAAWZ,EAAI,EAAG8B,EAAI,CAAC,EACvDpC,EAAQ,IACVH,EAAYQ,EAAaC,EAAKZ,EAAGa,CAAQ,EAAGb,EAAGM,CAAK,EAC7CuC,GAAAvC,EACAwC,GAAAxC,GAETyC,GAAOnC,EAAI,EACXiC,GAAOH,EAAI,EACXM,GAAOJ,EAAI,EACXE,GAAOH,EAAI,EAET/B,GAAO,CAACV,EAAUyC,CAAG,IACvBA,EAAI,EAAI/B,EACR+B,EAAI,GAAKI,EAAMD,GAEbJ,GAAO,CAAC3C,EAAS6C,CAAG,IACtBA,EAAI,EAAIF,EACRE,EAAI,GAAKC,EAAMG,EACJnC,EAAAb,EAEf,CACO,OAAAa,CACT,CAEA,SAASkB,EAAShB,EAAM,CACtBA,EAAK,GAAKU,EACLV,EAAA,EAAIA,EAAK,MAAQW,CACxB,CAEK,OAAAP,EAAA,WAAa,SAAS8B,EAAG,CAC5B,OAAO,UAAU,QAAUzB,EAAayB,EAAG9B,GAAQK,CAAA,EAGhDL,EAAA,KAAO,SAAS8B,EAAG,CACtB,OAAO,UAAU,QAAUtB,EAAW,GAAOF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,KAAO,CAACF,EAAIC,CAAE,CAAA,EAGpGP,EAAA,SAAW,SAAS8B,EAAG,CAC1B,OAAO,UAAU,QAAUtB,EAAW,GAAMF,EAAK,CAACwB,EAAE,CAAC,EAAGvB,EAAK,CAACuB,EAAE,CAAC,EAAG9B,GAASQ,EAAW,CAACF,EAAIC,CAAE,EAAI,IAAA,EAG9FP,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs171.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":"gDAKwB,SAAAA,EAAKC,EAAOC,EAAGC,EAAO,CAC5C,OAAOC,QAAM,KAAKH,EAAOC,GAAK,MAAQC,EAAQ,EAAID,CAAC,CACrD","x_google_ignoreList":[0]}

package/dist/index.cjs172.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(e){return typeof(e==null?void 0:e.x)=="number"?e==null?void 0:e.x:0}function n(e){return typeof(e==null?void 0:e.y)=="number"?e==null?void 0:e.y:0}function u(e){return e==null?void 0:e.source}function r(e){return e==null?void 0:e.target}exports.getSource=u;exports.getTarget=r;exports.getX=t;exports.getY=n;
+"use strict";const e=require("./index.cjs150.js");function r(t){return e(t,Boolean)}module.exports=r;
 //# sourceMappingURL=index.cjs172.js.map

package/dist/index.cjs172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs172.js","sources":["../../../node_modules/@visx/shape/esm/util/accessors.js"],"sourcesContent":["export function getX(l) {\n  return typeof (l == null ? void 0 : l.x) === 'number' ? l == null ? void 0 : l.x : 0;\n}\nexport function getY(l) {\n  return typeof (l == null ? void 0 : l.y) === 'number' ? l == null ? void 0 : l.y : 0;\n}\nexport function getSource(l) {\n  return l == null ? void 0 : l.source;\n}\nexport function getTarget(l) {\n  return l == null ? void 0 : l.target;\n}\nexport function getFirstItem(d) {\n  return d == null ? void 0 : d[0];\n}\nexport function getSecondItem(d) {\n  return d == null ? void 0 : d[1];\n}"],"names":["getX","l","getY","getSource","getTarget"],"mappings":"gFAAO,SAASA,EAAKC,EAAG,CACf,OAAA,OAAQA,GAAK,KAAO,OAASA,EAAE,IAAO,SAAWA,GAAK,KAAO,OAASA,EAAE,EAAI,CACrF,CACO,SAASC,EAAKD,EAAG,CACf,OAAA,OAAQA,GAAK,KAAO,OAASA,EAAE,IAAO,SAAWA,GAAK,KAAO,OAASA,EAAE,EAAI,CACrF,CACO,SAASE,EAAUF,EAAG,CACpB,OAAAA,GAAK,KAAO,OAASA,EAAE,MAChC,CACO,SAASG,EAAUH,EAAG,CACpB,OAAAA,GAAK,KAAO,OAASA,EAAE,MAChC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs172.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.cjs173.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const h=require("./index.cjs264.js"),f=require("./index.cjs265.js"),p=require("./index.cjs266.js"),c=require("./index.cjs263.js"),k=require("./index.cjs174.js");function m(n){return n.source}function d(n){return n.target}function s(n){var r=m,e=d,u=p.x,l=p.y,a=null;function i(){var t,o=h.slice.call(arguments),g=r.apply(this,o),v=e.apply(this,o);if(a||(a=t=k()),n(a,+u.apply(this,(o[0]=g,o)),+l.apply(this,o),+u.apply(this,(o[0]=v,o)),+l.apply(this,o)),t)return a=null,t+""||null}return i.source=function(t){return arguments.length?(r=t,i):r},i.target=function(t){return arguments.length?(e=t,i):e},i.x=function(t){return arguments.length?(u=typeof t=="function"?t:f(+t),i):u},i.y=function(t){return arguments.length?(l=typeof t=="function"?t:f(+t),i):l},i.context=function(t){return arguments.length?(a=t??null,i):a},i}function T(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r=(r+u)/2,e,r,l,u,l)}function b(n,r,e,u,l){n.moveTo(r,e),n.bezierCurveTo(r,e=(e+l)/2,u,e,u,l)}function y(n,r,e,u,l){var a=c(r,e),i=c(r,e=(e+l)/2),t=c(u,e),o=c(u,l);n.moveTo(a[0],a[1]),n.bezierCurveTo(i[0],i[1],t[0],t[1],o[0],o[1])}function z(){return s(T)}function q(){return s(b)}function R(){var n=s(y);return n.angle=n.x,delete n.x,n.radius=n.y,delete n.y,n}exports.linkHorizontal=z;exports.linkRadial=R;exports.linkVertical=q;
+"use strict";const n=require("./index.cjs226.js");function r(t,e){return n(t,e,!1)}module.exports=r;
 //# sourceMappingURL=index.cjs173.js.map

package/dist/index.cjs173.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs173.js","sources":["../../../node_modules/d3-shape/src/link/index.js"],"sourcesContent":["import {path} from \"d3-path\";\nimport {slice} from \"../array.js\";\nimport constant from \"../constant.js\";\nimport {x as pointX, y as pointY} from \"../point.js\";\nimport pointRadial from \"../pointRadial.js\";\n\nfunction linkSource(d) {\n  return d.source;\n}\n\nfunction linkTarget(d) {\n  return d.target;\n}\n\nfunction link(curve) {\n  var source = linkSource,\n      target = linkTarget,\n      x = pointX,\n      y = pointY,\n      context = null;\n\n  function link() {\n    var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);\n    if (!context) context = buffer = path();\n    curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  link.source = function(_) {\n    return arguments.length ? (source = _, link) : source;\n  };\n\n  link.target = function(_) {\n    return arguments.length ? (target = _, link) : target;\n  };\n\n  link.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), link) : x;\n  };\n\n  link.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), link) : y;\n  };\n\n  link.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), link) : context;\n  };\n\n  return link;\n}\n\nfunction curveHorizontal(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);\n}\n\nfunction curveVertical(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);\n}\n\nfunction curveRadial(context, x0, y0, x1, y1) {\n  var p0 = pointRadial(x0, y0),\n      p1 = pointRadial(x0, y0 = (y0 + y1) / 2),\n      p2 = pointRadial(x1, y0),\n      p3 = pointRadial(x1, y1);\n  context.moveTo(p0[0], p0[1]);\n  context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\nexport function linkHorizontal() {\n  return link(curveHorizontal);\n}\n\nexport function linkVertical() {\n  return link(curveVertical);\n}\n\nexport function linkRadial() {\n  var l = link(curveRadial);\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n  return l;\n}\n"],"names":["linkSource","d","linkTarget","link","curve","source","target","x","pointX","y","pointY","context","buffer","argv","slice","s","t","path","_","constant","curveHorizontal","x0","y0","x1","y1","curveVertical","curveRadial","p0","pointRadial","p1","p2","p3","linkHorizontal","linkVertical","linkRadial","l"],"mappings":"iPAMA,SAASA,EAAWC,EAAG,CACrB,OAAOA,EAAE,MACX,CAEA,SAASC,EAAWD,EAAG,CACrB,OAAOA,EAAE,MACX,CAEA,SAASE,EAAKC,EAAO,CACf,IAAAC,EAASL,EACTM,EAASJ,EACTK,EAAIC,EACJ,EAAAC,EAAIC,EAAAA,EACJC,EAAU,KAEd,SAASR,GAAO,CACd,IAAIS,EAAQC,EAAOC,EAAA,MAAM,KAAK,SAAS,EAAGC,EAAIV,EAAO,MAAM,KAAMQ,CAAI,EAAGG,EAAIV,EAAO,MAAM,KAAMO,CAAI,EAG/F,GAFCF,IAASA,EAAUC,EAASK,KACjCb,EAAMO,EAAS,CAACJ,EAAE,MAAM,MAAOM,EAAK,CAAC,EAAIE,EAAGF,EAAK,EAAG,CAACJ,EAAE,MAAM,KAAMI,CAAI,EAAG,CAACN,EAAE,MAAM,MAAOM,EAAK,CAAC,EAAIG,EAAGH,EAAK,EAAG,CAACJ,EAAE,MAAM,KAAMI,CAAI,CAAC,EAC/HD,EAAe,OAAAD,EAAU,KAAMC,EAAS,IAAM,IACpD,CAEAT,OAAAA,EAAK,OAAS,SAASe,EAAG,CACxB,OAAO,UAAU,QAAUb,EAASa,EAAGf,GAAQE,CAAA,EAGjDF,EAAK,OAAS,SAASe,EAAG,CACxB,OAAO,UAAU,QAAUZ,EAASY,EAAGf,GAAQG,CAAA,EAGjDH,EAAK,EAAI,SAASe,EAAG,CACZ,OAAA,UAAU,QAAUX,EAAI,OAAOW,GAAM,WAAaA,EAAIC,EAAS,CAACD,CAAC,EAAGf,GAAQI,CAAA,EAGrFJ,EAAK,EAAI,SAASe,EAAG,CACZ,OAAA,UAAU,QAAUT,EAAI,OAAOS,GAAM,WAAaA,EAAIC,EAAS,CAACD,CAAC,EAAGf,GAAQM,CAAA,EAGrFN,EAAK,QAAU,SAASe,EAAG,CACzB,OAAO,UAAU,QAAWP,EAAUO,GAAY,KAAWf,GAAQQ,CAAA,EAGhER,CACT,CAEA,SAASiB,EAAgBT,EAASU,EAAIC,EAAIC,EAAIC,EAAI,CACxCb,EAAA,OAAOU,EAAIC,CAAE,EACbX,EAAA,cAAcU,GAAMA,EAAKE,GAAM,EAAGD,EAAID,EAAIG,EAAID,EAAIC,CAAE,CAC9D,CAEA,SAASC,EAAcd,EAASU,EAAIC,EAAIC,EAAIC,EAAI,CACtCb,EAAA,OAAOU,EAAIC,CAAE,EACbX,EAAA,cAAcU,EAAIC,GAAMA,EAAKE,GAAM,EAAGD,EAAID,EAAIC,EAAIC,CAAE,CAC9D,CAEA,SAASE,EAAYf,EAASU,EAAIC,EAAIC,EAAIC,EAAI,CACxC,IAAAG,EAAKC,EAAYP,EAAIC,CAAE,EACvBO,EAAKD,EAAYP,EAAIC,GAAMA,EAAKE,GAAM,CAAC,EACvCM,EAAKF,EAAYL,EAAID,CAAE,EACvBS,EAAKH,EAAYL,EAAIC,CAAE,EAC3Bb,EAAQ,OAAOgB,EAAG,CAAC,EAAGA,EAAG,CAAC,CAAC,EAC3BhB,EAAQ,cAAckB,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGA,EAAG,CAAC,EAAGC,EAAG,CAAC,EAAGA,EAAG,CAAC,CAAC,CAChE,CAEO,SAASC,GAAiB,CAC/B,OAAO7B,EAAKiB,CAAe,CAC7B,CAEO,SAASa,GAAe,CAC7B,OAAO9B,EAAKsB,CAAa,CAC3B,CAEO,SAASS,GAAa,CACvB,IAAAC,EAAIhC,EAAKuB,CAAW,EACxB,OAAAS,EAAE,MAAQA,EAAE,EAAG,OAAOA,EAAE,EACxBA,EAAE,OAASA,EAAE,EAAG,OAAOA,EAAE,EAClBA,CACT","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs173.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.cjs174.js

@@ -1,2 +1,2 @@
-"use strict";var v=Math.PI,p=2*v,c=1e-6,C=p-c;function y(){this._x0=this._y0=this._x1=this._y1=null,this._=""}function g(){return new y}y.prototype=g.prototype={constructor:y,moveTo:function(i,s){this._+="M"+(this._x0=this._x1=+i)+","+(this._y0=this._y1=+s)},closePath:function(){this._x1!==null&&(this._x1=this._x0,this._y1=this._y0,this._+="Z")},lineTo:function(i,s){this._+="L"+(this._x1=+i)+","+(this._y1=+s)},quadraticCurveTo:function(i,s,t,h){this._+="Q"+ +i+","+ +s+","+(this._x1=+t)+","+(this._y1=+h)},bezierCurveTo:function(i,s,t,h,_,e){this._+="C"+ +i+","+ +s+","+ +t+","+ +h+","+(this._x1=+_)+","+(this._y1=+e)},arcTo:function(i,s,t,h,_){i=+i,s=+s,t=+t,h=+h,_=+_;var e=this._x1,M=this._y1,f=t-i,a=h-s,n=e-i,u=M-s,o=n*n+u*u;if(_<0)throw new Error("negative radius: "+_);if(this._x1===null)this._+="M"+(this._x1=i)+","+(this._y1=s);else if(o>c)if(!(Math.abs(u*f-a*n)>c)||!_)this._+="L"+(this._x1=i)+","+(this._y1=s);else{var r=t-e,l=h-M,d=f*f+a*a,q=r*r+l*l,b=Math.sqrt(d),T=Math.sqrt(o),A=_*Math.tan((v-Math.acos((d+o-q)/(2*b*T)))/2),x=A/T,L=A/b;Math.abs(x-1)>c&&(this._+="L"+(i+x*n)+","+(s+x*u)),this._+="A"+_+","+_+",0,0,"+ +(u*r>n*l)+","+(this._x1=i+L*f)+","+(this._y1=s+L*a)}},arc:function(i,s,t,h,_,e){i=+i,s=+s,t=+t,e=!!e;var M=t*Math.cos(h),f=t*Math.sin(h),a=i+M,n=s+f,u=1^e,o=e?h-_:_-h;if(t<0)throw new Error("negative radius: "+t);this._x1===null?this._+="M"+a+","+n:(Math.abs(this._x1-a)>c||Math.abs(this._y1-n)>c)&&(this._+="L"+a+","+n),t&&(o<0&&(o=o%p+p),o>C?this._+="A"+t+","+t+",0,1,"+u+","+(i-M)+","+(s-f)+"A"+t+","+t+",0,1,"+u+","+(this._x1=a)+","+(this._y1=n):o>c&&(this._+="A"+t+","+t+",0,"+ +(o>=v)+","+u+","+(this._x1=i+t*Math.cos(_))+","+(this._y1=s+t*Math.sin(_))))},rect:function(i,s,t,h){this._+="M"+(this._x0=this._x1=+i)+","+(this._y0=this._y1=+s)+"h"+ +t+"v"+ +h+"h"+-t+"Z"},toString:function(){return this._}};module.exports=g;
+"use strict";const p=require("./index.cjs84.js"),_=require("./index.cjs219.js"),b=require("./index.cjs210.js"),g=require("./index.cjs154.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.cjs174.js.map

package/dist/index.cjs174.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs174.js","sources":["../../../node_modules/d3-path/src/path.js"],"sourcesContent":["var pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction Path() {\n  this._x0 = this._y0 = // start of current subpath\n  this._x1 = this._y1 = null; // end of current subpath\n  this._ = \"\";\n}\n\nfunction path() {\n  return new Path;\n}\n\nPath.prototype = path.prototype = {\n  constructor: Path,\n  moveTo: function(x, y) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y);\n  },\n  closePath: function() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._ += \"Z\";\n    }\n  },\n  lineTo: function(x, y) {\n    this._ += \"L\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  quadraticCurveTo: function(x1, y1, x, y) {\n    this._ += \"Q\" + (+x1) + \",\" + (+y1) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  bezierCurveTo: function(x1, y1, x2, y2, x, y) {\n    this._ += \"C\" + (+x1) + \",\" + (+y1) + \",\" + (+x2) + \",\" + (+y2) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  arcTo: function(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n    var x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._ += \"M\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._ += \"L\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      var x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._ += \"L\" + (x1 + t01 * x01) + \",\" + (y1 + t01 * y01);\n      }\n\n      this._ += \"A\" + r + \",\" + r + \",0,0,\" + (+(y01 * x20 > x01 * y20)) + \",\" + (this._x1 = x1 + t21 * x21) + \",\" + (this._y1 = y1 + t21 * y21);\n    }\n  },\n  arc: function(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n    var dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._ += \"M\" + x0 + \",\" + y0;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._ += \"L\" + x0 + \",\" + y0;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (x - dx) + \",\" + (y - dy) + \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (this._x1 = x0) + \",\" + (this._y1 = y0);\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,\" + (+(da >= pi)) + \",\" + cw + \",\" + (this._x1 = x + r * Math.cos(a1)) + \",\" + (this._y1 = y + r * Math.sin(a1));\n    }\n  },\n  rect: function(x, y, w, h) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y) + \"h\" + (+w) + \"v\" + (+h) + \"h\" + (-w) + \"Z\";\n  },\n  toString: function() {\n    return this._;\n  }\n};\n\nexport default path;\n"],"names":["pi","tau","epsilon","tauEpsilon","Path","path","x","y","x1","y1","x2","y2","r","x0","y0","x21","y21","x01","y01","l01_2","x20","y20","l21_2","l20_2","l21","l01","l","t01","t21","a0","a1","ccw","dx","dy","cw","da","w"],"mappings":"aAAA,IAAIA,EAAK,KAAK,GACVC,EAAM,EAAID,EACVE,EAAU,KACVC,EAAaF,EAAMC,EAEvB,SAASE,GAAO,CACd,KAAK,IAAM,KAAK,IAChB,KAAK,IAAM,KAAK,IAAM,KACtB,KAAK,EAAI,EACX,CAEA,SAASC,GAAO,CACd,OAAO,IAAID,CACb,CAEAA,EAAK,UAAYC,EAAK,UAAY,CAChC,YAAaD,EACb,OAAQ,SAASE,EAAGC,EAAG,CACrB,KAAK,GAAK,KAAO,KAAK,IAAM,KAAK,IAAM,CAACD,GAAK,KAAO,KAAK,IAAM,KAAK,IAAM,CAACC,EAC7E,EACA,UAAW,UAAW,CAChB,KAAK,MAAQ,OACf,KAAK,IAAM,KAAK,IAAK,KAAK,IAAM,KAAK,IACrC,KAAK,GAAK,IAEd,EACA,OAAQ,SAASD,EAAGC,EAAG,CAChB,KAAA,GAAK,KAAO,KAAK,IAAM,CAACD,GAAK,KAAO,KAAK,IAAM,CAACC,EACvD,EACA,iBAAkB,SAASC,EAAIC,EAAIH,EAAGC,EAAG,CACvC,KAAK,GAAK,KAAO,CAACC,EAAM,KAAO,CAACC,EAAM,KAAO,KAAK,IAAM,CAACH,GAAK,KAAO,KAAK,IAAM,CAACC,EACnF,EACA,cAAe,SAASC,EAAIC,EAAIC,EAAIC,EAAIL,EAAGC,EAAG,CACvC,KAAA,GAAK,KAAO,CAACC,EAAM,KAAO,CAACC,EAAM,KAAO,CAACC,EAAM,KAAO,CAACC,EAAM,KAAO,KAAK,IAAM,CAACL,GAAK,KAAO,KAAK,IAAM,CAACC,EAC/G,EACA,MAAO,SAASC,EAAIC,EAAIC,EAAIC,EAAIC,EAAG,CACjCJ,EAAK,CAACA,EAAIC,EAAK,CAACA,EAAIC,EAAK,CAACA,EAAIC,EAAK,CAACA,EAAIC,EAAI,CAACA,EACzC,IAAAC,EAAK,KAAK,IACVC,EAAK,KAAK,IACVC,EAAML,EAAKF,EACXQ,EAAML,EAAKF,EACXQ,EAAMJ,EAAKL,EACXU,EAAMJ,EAAKL,EACXU,EAAQF,EAAMA,EAAMC,EAAMA,EAG9B,GAAIN,EAAI,EAAS,MAAA,IAAI,MAAM,oBAAsBA,CAAC,EAG9C,GAAA,KAAK,MAAQ,KACf,KAAK,GAAK,KAAO,KAAK,IAAMJ,GAAM,KAAO,KAAK,IAAMC,WAI3CU,EAAQjB,EAKV,GAAA,EAAE,KAAK,IAAIgB,EAAMH,EAAMC,EAAMC,CAAG,EAAIf,IAAY,CAACU,EACxD,KAAK,GAAK,KAAO,KAAK,IAAMJ,GAAM,KAAO,KAAK,IAAMC,OAIjD,CACC,IAAAW,EAAMV,EAAKG,EACXQ,EAAMV,EAAKG,EACXQ,EAAQP,EAAMA,EAAMC,EAAMA,EAC1BO,EAAQH,EAAMA,EAAMC,EAAMA,EAC1BG,EAAM,KAAK,KAAKF,CAAK,EACrBG,EAAM,KAAK,KAAKN,CAAK,EACrBO,EAAId,EAAI,KAAK,KAAKZ,EAAK,KAAK,MAAMsB,EAAQH,EAAQI,IAAU,EAAIC,EAAMC,EAAI,GAAK,CAAC,EAChFE,EAAMD,EAAID,EACVG,EAAMF,EAAIF,EAGV,KAAK,IAAIG,EAAM,CAAC,EAAIzB,IACtB,KAAK,GAAK,KAAOM,EAAKmB,EAAMV,GAAO,KAAOR,EAAKkB,EAAMT,IAGlD,KAAA,GAAK,IAAMN,EAAI,IAAMA,EAAI,SAAW,EAAEM,EAAME,EAAMH,EAAMI,GAAQ,KAAO,KAAK,IAAMb,EAAKoB,EAAMb,GAAO,KAAO,KAAK,IAAMN,EAAKmB,EAAMZ,EACxI,CACF,EACA,IAAK,SAASV,EAAGC,EAAGK,EAAGiB,EAAIC,EAAIC,EAAK,CAC9BzB,EAAA,CAACA,EAAGC,EAAI,CAACA,EAAGK,EAAI,CAACA,EAAGmB,EAAM,CAAC,CAACA,EAC5B,IAAAC,EAAKpB,EAAI,KAAK,IAAIiB,CAAE,EACpBI,EAAKrB,EAAI,KAAK,IAAIiB,CAAE,EACpBhB,EAAKP,EAAI0B,EACTlB,EAAKP,EAAI0B,EACTC,EAAK,EAAIH,EACTI,EAAKJ,EAAMF,EAAKC,EAAKA,EAAKD,EAG9B,GAAIjB,EAAI,EAAS,MAAA,IAAI,MAAM,oBAAsBA,CAAC,EAG9C,KAAK,MAAQ,KACV,KAAA,GAAK,IAAMC,EAAK,IAAMC,GAIpB,KAAK,IAAI,KAAK,IAAMD,CAAE,EAAIX,GAAW,KAAK,IAAI,KAAK,IAAMY,CAAE,EAAIZ,KACjE,KAAA,GAAK,IAAMW,EAAK,IAAMC,GAIxBF,IAGDuB,EAAK,IAAGA,EAAKA,EAAKlC,EAAMA,GAGxBkC,EAAKhC,EACF,KAAA,GAAK,IAAMS,EAAI,IAAMA,EAAI,QAAUsB,EAAK,KAAO5B,EAAI0B,GAAM,KAAOzB,EAAI0B,GAAM,IAAMrB,EAAI,IAAMA,EAAI,QAAUsB,EAAK,KAAO,KAAK,IAAMrB,GAAM,KAAO,KAAK,IAAMC,GAIrJqB,EAAKjC,IACP,KAAA,GAAK,IAAMU,EAAI,IAAMA,EAAI,OAAS,EAAEuB,GAAMnC,GAAO,IAAMkC,EAAK,KAAO,KAAK,IAAM5B,EAAIM,EAAI,KAAK,IAAIkB,CAAE,GAAK,KAAO,KAAK,IAAMvB,EAAIK,EAAI,KAAK,IAAIkB,CAAE,IAEpJ,EACA,KAAM,SAASxB,EAAGC,EAAG6B,EAAG,EAAG,CACpB,KAAA,GAAK,KAAO,KAAK,IAAM,KAAK,IAAM,CAAC9B,GAAK,KAAO,KAAK,IAAM,KAAK,IAAM,CAACC,GAAK,KAAO,CAAC6B,EAAK,KAAO,CAAC,EAAK,IAAO,CAACA,EAAK,GACzH,EACA,SAAU,UAAW,CACnB,OAAO,KAAK,CACd,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs174.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":"8IAUA,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.cjs175.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const i=require("react"),c=require("./index.cjs237.js"),e=require("./index.cjs238.js");function l(t,n={},o,s){const r=i.useMemo(()=>new c.Controller(t),[]);if(r.applyHandlers(t,s),r.applyConfig(n,o),i.useEffect(r.effect.bind(r)),i.useEffect(()=>r.clean.bind(r),[]),n.target===void 0)return r.bind.bind(r)}function u(t){return t.forEach(e.r),function(o,s){const{handlers:r,nativeHandlers:a,config:f}=c.parseMergedHandlers(o,s||{});return l(r,f,void 0,a)}}function d(t,n){return u([e.e,e.f,e.s,e.w,e.m,e.h])(t,n||{})}exports.ConfigResolverMap=e.C;exports.EngineMap=e.E;exports.dragAction=e.e;exports.hoverAction=e.h;exports.moveAction=e.m;exports.pinchAction=e.f;exports.registerAction=e.r;exports.scrollAction=e.s;exports.wheelAction=e.w;exports.createUseGesture=u;exports.useGesture=d;
+"use strict";const c=require("./index.cjs210.js"),o=require("./index.cjs154.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.cjs175.js.map

package/dist/index.cjs175.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs175.js","sources":["../../../node_modules/@use-gesture/react/dist/use-gesture-react.esm.js"],"sourcesContent":["import { registerAction, dragAction, pinchAction, wheelAction, scrollAction, moveAction, hoverAction } from '@use-gesture/core/actions';\nexport * from '@use-gesture/core/actions';\nimport React from 'react';\nimport { Controller, parseMergedHandlers } from '@use-gesture/core';\nexport * from '@use-gesture/core/utils';\nexport * from '@use-gesture/core/types';\n\nfunction useRecognizers(handlers, config = {}, gestureKey, nativeHandlers) {\n  const ctrl = React.useMemo(() => new Controller(handlers), []);\n  ctrl.applyHandlers(handlers, nativeHandlers);\n  ctrl.applyConfig(config, gestureKey);\n  React.useEffect(ctrl.effect.bind(ctrl));\n  React.useEffect(() => {\n    return ctrl.clean.bind(ctrl);\n  }, []);\n  if (config.target === undefined) {\n    return ctrl.bind.bind(ctrl);\n  }\n  return undefined;\n}\n\nfunction useDrag(handler, config) {\n  registerAction(dragAction);\n  return useRecognizers({\n    drag: handler\n  }, config || {}, 'drag');\n}\n\nfunction usePinch(handler, config) {\n  registerAction(pinchAction);\n  return useRecognizers({\n    pinch: handler\n  }, config || {}, 'pinch');\n}\n\nfunction useWheel(handler, config) {\n  registerAction(wheelAction);\n  return useRecognizers({\n    wheel: handler\n  }, config || {}, 'wheel');\n}\n\nfunction useScroll(handler, config) {\n  registerAction(scrollAction);\n  return useRecognizers({\n    scroll: handler\n  }, config || {}, 'scroll');\n}\n\nfunction useMove(handler, config) {\n  registerAction(moveAction);\n  return useRecognizers({\n    move: handler\n  }, config || {}, 'move');\n}\n\nfunction useHover(handler, config) {\n  registerAction(hoverAction);\n  return useRecognizers({\n    hover: handler\n  }, config || {}, 'hover');\n}\n\nfunction createUseGesture(actions) {\n  actions.forEach(registerAction);\n  return function useGesture(_handlers, _config) {\n    const {\n      handlers,\n      nativeHandlers,\n      config\n    } = parseMergedHandlers(_handlers, _config || {});\n    return useRecognizers(handlers, config, undefined, nativeHandlers);\n  };\n}\n\nfunction useGesture(handlers, config) {\n  const hook = createUseGesture([dragAction, pinchAction, scrollAction, wheelAction, moveAction, hoverAction]);\n  return hook(handlers, config || {});\n}\n\nexport { createUseGesture, useDrag, useGesture, useHover, useMove, usePinch, useScroll, useWheel };\n"],"names":["useRecognizers","handlers","config","gestureKey","nativeHandlers","ctrl","React","Controller","createUseGesture","actions","registerAction","_handlers","_config","parseMergedHandlers","useGesture","dragAction","pinchAction","scrollAction","wheelAction","moveAction","hoverAction"],"mappings":"uKAOA,SAASA,EAAeC,EAAUC,EAAS,CAAA,EAAIC,EAAYC,EAAgB,CACnE,MAAAC,EAAOC,EAAM,QAAQ,IAAM,IAAIC,EAAAA,WAAWN,CAAQ,EAAG,CAAA,CAAE,EAOzD,GANCI,EAAA,cAAcJ,EAAUG,CAAc,EACtCC,EAAA,YAAYH,EAAQC,CAAU,EACnCG,EAAM,UAAUD,EAAK,OAAO,KAAKA,CAAI,CAAC,EACtCC,EAAM,UAAU,IACPD,EAAK,MAAM,KAAKA,CAAI,EAC1B,CAAE,CAAA,EACDH,EAAO,SAAW,OACb,OAAAG,EAAK,KAAK,KAAKA,CAAI,CAG9B,CA4CA,SAASG,EAAiBC,EAAS,CACjC,OAAAA,EAAQ,QAAQC,EAAAA,CAAc,EACvB,SAAoBC,EAAWC,EAAS,CACvC,KAAA,CACJ,SAAAX,EACA,eAAAG,EACA,OAAAF,CACE,EAAAW,sBAAoBF,EAAWC,GAAW,CAAE,CAAA,EAChD,OAAOZ,EAAeC,EAAUC,EAAQ,OAAWE,CAAc,CAAA,CAErE,CAEA,SAASU,EAAWb,EAAUC,EAAQ,CAEpC,OADaM,EAAiB,CAACO,IAAYC,EAAAA,EAAaC,EAAc,EAAAC,IAAaC,EAAAA,EAAYC,EAAW,CAAA,CAAC,EAC/FnB,EAAUC,GAAU,CAAE,CAAA,CACpC","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs175.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.cjs176.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function p(){return{scaleX:1,scaleY:1,translateX:0,translateY:0,skewX:0,skewY:0}}function X(e){var s=e.scaleX,a=s===void 0?1:s,t=e.scaleY,c=t===void 0?1:t,l=e.translateX,r=l===void 0?0:l,n=e.translateY,i=n===void 0?0:n,Y=e.skewX,M=Y===void 0?0:Y,w=e.skewY,d=w===void 0?0:w;return{scaleX:a,scaleY:c,translateX:r,translateY:i,skewX:M,skewY:d}}function u(e){var s=e.scaleX,a=e.scaleY,t=e.translateX,c=e.translateY,l=e.skewX,r=e.skewY,n=s*a-r*l;return{scaleX:a/n,scaleY:s/n,translateX:(a*t-l*c)/-n,translateY:(r*t-s*c)/n,skewX:l/-n,skewY:r/-n}}function k(e,s){var a=s.x,t=s.y;return{x:e.scaleX*a+e.skewX*t+e.translateX,y:e.skewY*a+e.scaleY*t+e.translateY}}function y(e,s){var a=s.x,t=s.y;return k(u(e),{x:a,y:t})}function g(e,s){s===void 0&&(s=void 0);var a=s||e;return X({scaleX:e,scaleY:a})}function f(e,s){return X({translateX:e,translateY:s})}function o(e,s){return{scaleX:e.scaleX*s.scaleX+e.skewX*s.skewY,scaleY:e.skewY*s.skewX+e.scaleY*s.scaleY,translateX:e.scaleX*s.translateX+e.skewX*s.translateY+e.translateX,translateY:e.skewY*s.translateX+e.scaleY*s.translateY+e.translateY,skewX:e.scaleX*s.skewX+e.skewX*s.scaleY,skewY:e.skewY*s.scaleX+e.scaleY*s.skewY}}function v(){for(var e=arguments.length,s=new Array(e),a=0;a<e;a++)s[a]=arguments[a];switch(s.length){case 0:throw new Error("composeMatrices() requires arguments: was called with no args");case 1:return s[0];case 2:return o(s[0],s[1]);default:{var t=s[0],c=s[1],l=s.slice(2),r=o(t,c);return v.apply(void 0,[r].concat(l))}}}exports.applyInverseMatrixToPoint=y;exports.applyMatrixToPoint=k;exports.composeMatrices=v;exports.createMatrix=X;exports.identityMatrix=p;exports.inverseMatrix=u;exports.multiplyMatrices=o;exports.scaleMatrix=g;exports.translateMatrix=f;
+"use strict";const n=require("./index.cjs157.js"),s=require("./index.cjs210.js"),c=require("./index.cjs155.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.cjs176.js.map

package/dist/index.cjs176.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs176.js","sources":["../../../node_modules/@visx/zoom/esm/util/matrix.js"],"sourcesContent":["export function identityMatrix() {\n  return {\n    scaleX: 1,\n    scaleY: 1,\n    translateX: 0,\n    translateY: 0,\n    skewX: 0,\n    skewY: 0\n  };\n}\nexport function createMatrix(_ref) {\n  var _ref$scaleX = _ref.scaleX,\n    scaleX = _ref$scaleX === void 0 ? 1 : _ref$scaleX,\n    _ref$scaleY = _ref.scaleY,\n    scaleY = _ref$scaleY === void 0 ? 1 : _ref$scaleY,\n    _ref$translateX = _ref.translateX,\n    translateX = _ref$translateX === void 0 ? 0 : _ref$translateX,\n    _ref$translateY = _ref.translateY,\n    translateY = _ref$translateY === void 0 ? 0 : _ref$translateY,\n    _ref$skewX = _ref.skewX,\n    skewX = _ref$skewX === void 0 ? 0 : _ref$skewX,\n    _ref$skewY = _ref.skewY,\n    skewY = _ref$skewY === void 0 ? 0 : _ref$skewY;\n  return {\n    scaleX: scaleX,\n    scaleY: scaleY,\n    translateX: translateX,\n    translateY: translateY,\n    skewX: skewX,\n    skewY: skewY\n  };\n}\nexport function inverseMatrix(_ref2) {\n  var scaleX = _ref2.scaleX,\n    scaleY = _ref2.scaleY,\n    translateX = _ref2.translateX,\n    translateY = _ref2.translateY,\n    skewX = _ref2.skewX,\n    skewY = _ref2.skewY;\n  var denominator = scaleX * scaleY - skewY * skewX;\n  return {\n    scaleX: scaleY / denominator,\n    scaleY: scaleX / denominator,\n    translateX: (scaleY * translateX - skewX * translateY) / -denominator,\n    translateY: (skewY * translateX - scaleX * translateY) / denominator,\n    skewX: skewX / -denominator,\n    skewY: skewY / -denominator\n  };\n}\nexport function applyMatrixToPoint(matrix, _ref3) {\n  var x = _ref3.x,\n    y = _ref3.y;\n  return {\n    x: matrix.scaleX * x + matrix.skewX * y + matrix.translateX,\n    y: matrix.skewY * x + matrix.scaleY * y + matrix.translateY\n  };\n}\nexport function applyInverseMatrixToPoint(matrix, _ref4) {\n  var x = _ref4.x,\n    y = _ref4.y;\n  return applyMatrixToPoint(inverseMatrix(matrix), {\n    x: x,\n    y: y\n  });\n}\nexport function scaleMatrix(scaleX, maybeScaleY) {\n  if (maybeScaleY === void 0) {\n    maybeScaleY = undefined;\n  }\n  var scaleY = maybeScaleY || scaleX;\n  return createMatrix({\n    scaleX: scaleX,\n    scaleY: scaleY\n  });\n}\nexport function translateMatrix(translateX, translateY) {\n  return createMatrix({\n    translateX: translateX,\n    translateY: translateY\n  });\n}\nexport function multiplyMatrices(matrix1, matrix2) {\n  return {\n    scaleX: matrix1.scaleX * matrix2.scaleX + matrix1.skewX * matrix2.skewY,\n    scaleY: matrix1.skewY * matrix2.skewX + matrix1.scaleY * matrix2.scaleY,\n    translateX: matrix1.scaleX * matrix2.translateX + matrix1.skewX * matrix2.translateY + matrix1.translateX,\n    translateY: matrix1.skewY * matrix2.translateX + matrix1.scaleY * matrix2.translateY + matrix1.translateY,\n    skewX: matrix1.scaleX * matrix2.skewX + matrix1.skewX * matrix2.scaleY,\n    skewY: matrix1.skewY * matrix2.scaleX + matrix1.scaleY * matrix2.skewY\n  };\n}\nexport function composeMatrices() {\n  for (var _len = arguments.length, matrices = new Array(_len), _key = 0; _key < _len; _key++) {\n    matrices[_key] = arguments[_key];\n  }\n  switch (matrices.length) {\n    case 0:\n      throw new Error('composeMatrices() requires arguments: was called with no args');\n    case 1:\n      return matrices[0];\n    case 2:\n      return multiplyMatrices(matrices[0], matrices[1]);\n    default:\n      {\n        var matrix1 = matrices[0],\n          matrix2 = matrices[1],\n          restMatrices = matrices.slice(2);\n        var matrix = multiplyMatrices(matrix1, matrix2);\n        return composeMatrices.apply(void 0, [matrix].concat(restMatrices));\n      }\n  }\n}"],"names":["identityMatrix","createMatrix","_ref","_ref$scaleX","scaleX","_ref$scaleY","scaleY","_ref$translateX","translateX","_ref$translateY","translateY","_ref$skewX","skewX","_ref$skewY","skewY","inverseMatrix","_ref2","denominator","applyMatrixToPoint","matrix","_ref3","x","y","applyInverseMatrixToPoint","_ref4","scaleMatrix","maybeScaleY","translateMatrix","multiplyMatrices","matrix1","matrix2","composeMatrices","_len","matrices","_key","restMatrices"],"mappings":"gFAAO,SAASA,GAAiB,CACxB,MAAA,CACL,OAAQ,EACR,OAAQ,EACR,WAAY,EACZ,WAAY,EACZ,MAAO,EACP,MAAO,CAAA,CAEX,CACO,SAASC,EAAaC,EAAM,CAC7B,IAAAC,EAAcD,EAAK,OACrBE,EAASD,IAAgB,OAAS,EAAIA,EACtCE,EAAcH,EAAK,OACnBI,EAASD,IAAgB,OAAS,EAAIA,EACtCE,EAAkBL,EAAK,WACvBM,EAAaD,IAAoB,OAAS,EAAIA,EAC9CE,EAAkBP,EAAK,WACvBQ,EAAaD,IAAoB,OAAS,EAAIA,EAC9CE,EAAaT,EAAK,MAClBU,EAAQD,IAAe,OAAS,EAAIA,EACpCE,EAAaX,EAAK,MAClBY,EAAQD,IAAe,OAAS,EAAIA,EAC/B,MAAA,CACL,OAAAT,EACA,OAAAE,EACA,WAAAE,EACA,WAAAE,EACA,MAAAE,EACA,MAAAE,CAAA,CAEJ,CACO,SAASC,EAAcC,EAAO,CACnC,IAAIZ,EAASY,EAAM,OACjBV,EAASU,EAAM,OACfR,EAAaQ,EAAM,WACnBN,EAAaM,EAAM,WACnBJ,EAAQI,EAAM,MACdF,EAAQE,EAAM,MACZC,EAAcb,EAASE,EAASQ,EAAQF,EACrC,MAAA,CACL,OAAQN,EAASW,EACjB,OAAQb,EAASa,EACjB,YAAaX,EAASE,EAAaI,EAAQF,GAAc,CAACO,EAC1D,YAAaH,EAAQN,EAAaJ,EAASM,GAAcO,EACzD,MAAOL,EAAQ,CAACK,EAChB,MAAOH,EAAQ,CAACG,CAAA,CAEpB,CACgB,SAAAC,EAAmBC,EAAQC,EAAO,CAChD,IAAIC,EAAID,EAAM,EACZE,EAAIF,EAAM,EACL,MAAA,CACL,EAAGD,EAAO,OAASE,EAAIF,EAAO,MAAQG,EAAIH,EAAO,WACjD,EAAGA,EAAO,MAAQE,EAAIF,EAAO,OAASG,EAAIH,EAAO,UAAA,CAErD,CACgB,SAAAI,EAA0BJ,EAAQK,EAAO,CACvD,IAAIH,EAAIG,EAAM,EACZF,EAAIE,EAAM,EACL,OAAAN,EAAmBH,EAAcI,CAAM,EAAG,CAC/C,EAAAE,EACA,EAAAC,CAAA,CACD,CACH,CACgB,SAAAG,EAAYrB,EAAQsB,EAAa,CAC3CA,IAAgB,SACJA,EAAA,QAEhB,IAAIpB,EAASoB,GAAetB,EAC5B,OAAOH,EAAa,CAClB,OAAAG,EACA,OAAAE,CAAA,CACD,CACH,CACgB,SAAAqB,EAAgBnB,EAAYE,EAAY,CACtD,OAAOT,EAAa,CAClB,WAAAO,EACA,WAAAE,CAAA,CACD,CACH,CACgB,SAAAkB,EAAiBC,EAASC,EAAS,CAC1C,MAAA,CACL,OAAQD,EAAQ,OAASC,EAAQ,OAASD,EAAQ,MAAQC,EAAQ,MAClE,OAAQD,EAAQ,MAAQC,EAAQ,MAAQD,EAAQ,OAASC,EAAQ,OACjE,WAAYD,EAAQ,OAASC,EAAQ,WAAaD,EAAQ,MAAQC,EAAQ,WAAaD,EAAQ,WAC/F,WAAYA,EAAQ,MAAQC,EAAQ,WAAaD,EAAQ,OAASC,EAAQ,WAAaD,EAAQ,WAC/F,MAAOA,EAAQ,OAASC,EAAQ,MAAQD,EAAQ,MAAQC,EAAQ,OAChE,MAAOD,EAAQ,MAAQC,EAAQ,OAASD,EAAQ,OAASC,EAAQ,KAAA,CAErE,CACO,SAASC,GAAkB,CAChC,QAASC,EAAO,UAAU,OAAQC,EAAW,IAAI,MAAMD,CAAI,EAAGE,EAAO,EAAGA,EAAOF,EAAME,IAC1ED,EAAAC,CAAI,EAAI,UAAUA,CAAI,EAEjC,OAAQD,EAAS,OAAQ,CACvB,IAAK,GACG,MAAA,IAAI,MAAM,+DAA+D,EACjF,IAAK,GACH,OAAOA,EAAS,CAAC,EACnB,IAAK,GACH,OAAOL,EAAiBK,EAAS,CAAC,EAAGA,EAAS,CAAC,CAAC,EAClD,QACE,CACM,IAAAJ,EAAUI,EAAS,CAAC,EACtBH,EAAUG,EAAS,CAAC,EACpBE,EAAeF,EAAS,MAAM,CAAC,EAC7Bd,EAASS,EAAiBC,EAASC,CAAO,EACvC,OAAAC,EAAgB,MAAM,OAAQ,CAACZ,CAAM,EAAE,OAAOgB,CAAY,CAAC,CACpE,CACJ,CACF","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs176.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.cjs177.js

@@ -1,2 +1,2 @@
-"use strict";const s=require("./index.cjs178.js"),a=require("./index.cjs235.js"),u=require("./index.cjs236.js");function x(e,c){if(!e||!c)return null;var t=a(c),n=s.isSVGElement(e)?e.ownerSVGElement:e,i=s.isSVGGraphicsElement(n)?n.getScreenCTM():null;if(s.isSVGSVGElement(n)&&i){var r=n.createSVGPoint();return r.x=t.x,r.y=t.y,r=r.matrixTransform(i.inverse()),new u({x:r.x,y:r.y})}var l=e.getBoundingClientRect();return new u({x:t.x-l.left-e.clientLeft,y:t.y-l.top-e.clientTop})}module.exports=x;
+"use strict";const c=require("./index.cjs210.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.cjs177.js.map

package/dist/index.cjs177.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs177.js","sources":["../../../node_modules/@visx/event/esm/localPointGeneric.js"],"sourcesContent":["import { Point } from '@visx/point';\nimport { isSVGElement, isSVGGraphicsElement, isSVGSVGElement } from './typeGuards';\nimport getXAndYFromEvent from './getXAndYFromEvent';\nexport default function localPoint(node, event) {\n  if (!node || !event) return null;\n  var coords = getXAndYFromEvent(event);\n\n  // find top-most SVG\n  var svg = isSVGElement(node) ? node.ownerSVGElement : node;\n  var screenCTM = isSVGGraphicsElement(svg) ? svg.getScreenCTM() : null;\n  if (isSVGSVGElement(svg) && screenCTM) {\n    var point = svg.createSVGPoint();\n    point.x = coords.x;\n    point.y = coords.y;\n    point = point.matrixTransform(screenCTM.inverse());\n    return new Point({\n      x: point.x,\n      y: point.y\n    });\n  }\n\n  // fall back to bounding box\n  var rect = node.getBoundingClientRect();\n  return new Point({\n    x: coords.x - rect.left - node.clientLeft,\n    y: coords.y - rect.top - node.clientTop\n  });\n}"],"names":["localPoint","node","event","coords","getXAndYFromEvent","svg","isSVGElement","screenCTM","isSVGGraphicsElement","isSVGSVGElement","point","Point","rect"],"mappings":"gHAGwB,SAAAA,EAAWC,EAAMC,EAAO,CAC1C,GAAA,CAACD,GAAQ,CAACC,EAAc,OAAA,KACxB,IAAAC,EAASC,EAAkBF,CAAK,EAGhCG,EAAMC,EAAAA,aAAaL,CAAI,EAAIA,EAAK,gBAAkBA,EAClDM,EAAYC,EAAAA,qBAAqBH,CAAG,EAAIA,EAAI,aAAiB,EAAA,KAC7D,GAAAI,EAAA,gBAAgBJ,CAAG,GAAKE,EAAW,CACjC,IAAAG,EAAQL,EAAI,iBAChB,OAAAK,EAAM,EAAIP,EAAO,EACjBO,EAAM,EAAIP,EAAO,EACjBO,EAAQA,EAAM,gBAAgBH,EAAU,QAAS,CAAA,EAC1C,IAAII,EAAM,CACf,EAAGD,EAAM,EACT,EAAGA,EAAM,CAAA,CACV,CACH,CAGI,IAAAE,EAAOX,EAAK,wBAChB,OAAO,IAAIU,EAAM,CACf,EAAGR,EAAO,EAAIS,EAAK,KAAOX,EAAK,WAC/B,EAAGE,EAAO,EAAIS,EAAK,IAAMX,EAAK,SAAA,CAC/B,CACH","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs177.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.cjs178.js

@@ -1,2 +1,2 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});function t(n){return!!n&&n instanceof Element}function e(n){return!!n&&(n instanceof SVGElement||"ownerSVGElement"in n)}function i(n){return!!n&&"createSVGPoint"in n}function s(n){return!!n&&"getScreenCTM"in n}function r(n){return!!n&&"changedTouches"in n}function c(n){return!!n&&"clientX"in n}function o(n){return!!n&&(n instanceof Event||"nativeEvent"in n&&n.nativeEvent instanceof Event)}exports.isElement=t;exports.isEvent=o;exports.isMouseEvent=c;exports.isSVGElement=e;exports.isSVGGraphicsElement=s;exports.isSVGSVGElement=i;exports.isTouchEvent=r;
+"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.cjs178.js.map

package/dist/index.cjs178.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs178.js","sources":["../../../node_modules/@visx/event/esm/typeGuards.js"],"sourcesContent":["export function isElement(elem) {\n  return !!elem && elem instanceof Element;\n}\n\n// functional definition of isSVGElement. Note that SVGSVGElements are HTMLElements\nexport function isSVGElement(elem) {\n  return !!elem && (elem instanceof SVGElement || 'ownerSVGElement' in elem);\n}\n\n// functional definition of SVGGElement\nexport function isSVGSVGElement(elem) {\n  return !!elem && 'createSVGPoint' in elem;\n}\nexport function isSVGGraphicsElement(elem) {\n  return !!elem && 'getScreenCTM' in elem;\n}\n\n// functional definition of TouchEvent\nexport function isTouchEvent(event) {\n  return !!event && 'changedTouches' in event;\n}\n\n// functional definition of MouseEvent\nexport function isMouseEvent(event) {\n  return !!event && 'clientX' in event;\n}\n\n// functional definition of event\nexport function isEvent(event) {\n  return !!event && (event instanceof Event || 'nativeEvent' in event && event.nativeEvent instanceof Event);\n}"],"names":["isElement","elem","isSVGElement","isSVGSVGElement","isSVGGraphicsElement","isTouchEvent","event","isMouseEvent","isEvent"],"mappings":"gFAAO,SAASA,EAAUC,EAAM,CACvB,MAAA,CAAC,CAACA,GAAQA,aAAgB,OACnC,CAGO,SAASC,EAAaD,EAAM,CACjC,MAAO,CAAC,CAACA,IAASA,aAAgB,YAAc,oBAAqBA,EACvE,CAGO,SAASE,EAAgBF,EAAM,CAC7B,MAAA,CAAC,CAACA,GAAQ,mBAAoBA,CACvC,CACO,SAASG,EAAqBH,EAAM,CAClC,MAAA,CAAC,CAACA,GAAQ,iBAAkBA,CACrC,CAGO,SAASI,EAAaC,EAAO,CAC3B,MAAA,CAAC,CAACA,GAAS,mBAAoBA,CACxC,CAGO,SAASC,EAAaD,EAAO,CAC3B,MAAA,CAAC,CAACA,GAAS,YAAaA,CACjC,CAGO,SAASE,EAAQF,EAAO,CACtB,MAAA,CAAC,CAACA,IAAUA,aAAiB,OAAS,gBAAiBA,GAASA,EAAM,uBAAuB,MACtG","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs178.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.cjs179.js

@@ -1,2 +1,2 @@
-"use strict";function o(e){"@babel/helpers - typeof";return o=typeof Symbol=="function"&&typeof Symbol.iterator=="symbol"?function(t){return typeof t}:function(t){return t&&typeof Symbol=="function"&&t.constructor===Symbol&&t!==Symbol.prototype?"symbol":typeof t},o(e)}module.exports=o;
+"use strict";const u=require("./index.cjs6.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.cjs179.js.map

package/dist/index.cjs179.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs179.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/typeof.js"],"sourcesContent":["export default function _typeof(o) {\n  \"@babel/helpers - typeof\";\n\n  return _typeof = \"function\" == typeof Symbol && \"symbol\" == typeof Symbol.iterator ? function (o) {\n    return typeof o;\n  } : function (o) {\n    return o && \"function\" == typeof Symbol && o.constructor === Symbol && o !== Symbol.prototype ? \"symbol\" : typeof o;\n  }, _typeof(o);\n}"],"names":["_typeof","o"],"mappings":"aAAA,SAAwBA,EAAQC,EAAG,CACjC,0BAEO,OAAAD,EAAwB,OAAO,QAArB,YAA2C,OAAO,OAAO,UAA1B,SAAqC,SAAUC,EAAG,CAChG,OAAO,OAAOA,CAChB,EAAI,SAAUA,EAAG,CACRA,OAAAA,GAAmB,OAAO,QAArB,YAA+BA,EAAE,cAAgB,QAAUA,IAAM,OAAO,UAAY,SAAW,OAAOA,CAAA,EACjHD,EAAQC,CAAC,CACd","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs179.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":"gDAIwB,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.cjs180.js

@@ -1,2 +1,2 @@
-"use strict";function s(a,n){if(!(a instanceof n))throw new TypeError("Cannot call a class as a function")}module.exports=s;
+"use strict";const q=require("./index.cjs190.js"),L=require("./index.cjs234.js"),M=require("./index.cjs235.js"),N=require("./index.cjs236.js");var O=L.isObject_1,b=M.now_1,I=N.toNumber_1,S="Expected a function",$=Math.max,y=Math.min;function F(x,n,u){var a,c,v,o,i,r,s=0,h=!1,l=!1,d=!0;if(typeof x!="function")throw new TypeError(S);n=I(n)||0,O(u)&&(h=!!u.leading,l="maxWait"in u,v=l?$(I(u.maxWait)||0,n):v,d="trailing"in u?!!u.trailing:d);function g(e){var t=a,m=c;return a=c=void 0,s=e,o=x.apply(m,t),o}function j(e){return s=e,i=setTimeout(f,n),h?g(e):o}function C(e){var t=e-r,m=e-s,k=n-t;return l?y(k,v-m):k}function E(e){var t=e-r,m=e-s;return r===void 0||t>=n||t<0||l&&m>=v}function f(){var e=b();if(E(e))return _(e);i=setTimeout(f,C(e))}function _(e){return i=void 0,d&&a?g(e):(a=c=void 0,o)}function W(){i!==void 0&&clearTimeout(i),s=0,a=r=c=i=void 0}function p(){return i===void 0?o:_(b())}function T(){var e=b(),t=E(e);if(a=arguments,c=this,r=e,t){if(i===void 0)return j(r);if(l)return clearTimeout(i),i=setTimeout(f,n),g(r)}return i===void 0&&(i=setTimeout(f,n)),o}return T.cancel=W,T.flush=p,T}var R=F;const A=q.getDefaultExportFromCjs(R);module.exports=A;
 //# sourceMappingURL=index.cjs180.js.map

package/dist/index.cjs180.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.cjs180.js","sources":["../../../node_modules/@babel/runtime/helpers/esm/classCallCheck.js"],"sourcesContent":["export default function _classCallCheck(instance, Constructor) {\n  if (!(instance instanceof Constructor)) {\n    throw new TypeError(\"Cannot call a class as a function\");\n  }\n}"],"names":["_classCallCheck","instance","Constructor"],"mappings":"aAAwB,SAAAA,EAAgBC,EAAUC,EAAa,CACzD,GAAA,EAAED,aAAoBC,GAClB,MAAA,IAAI,UAAU,mCAAmC,CAE3D","x_google_ignoreList":[0]}
+{"version":3,"file":"index.cjs180.js","sources":["../../../node_modules/lodash/debounce.js"],"sourcesContent":["var isObject = require('./isObject'),\n    now = require('./now'),\n    toNumber = require('./toNumber');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max,\n    nativeMin = Math.min;\n\n/**\n * Creates a debounced function that delays invoking `func` until after `wait`\n * milliseconds have elapsed since the last time the debounced function was\n * invoked. The debounced function comes with a `cancel` method to cancel\n * delayed `func` invocations and a `flush` method to immediately invoke them.\n * Provide `options` to indicate whether `func` should be invoked on the\n * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n * with the last arguments provided to the debounced function. Subsequent\n * calls to the debounced function return the result of the last `func`\n * invocation.\n *\n * **Note:** If `leading` and `trailing` options are `true`, `func` is\n * invoked on the trailing edge of the timeout only if the debounced function\n * is invoked more than once during the `wait` timeout.\n *\n * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n *\n * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n * for details over the differences between `_.debounce` and `_.throttle`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to debounce.\n * @param {number} [wait=0] The number of milliseconds to delay.\n * @param {Object} [options={}] The options object.\n * @param {boolean} [options.leading=false]\n *  Specify invoking on the leading edge of the timeout.\n * @param {number} [options.maxWait]\n *  The maximum time `func` is allowed to be delayed before it's invoked.\n * @param {boolean} [options.trailing=true]\n *  Specify invoking on the trailing edge of the timeout.\n * @returns {Function} Returns the new debounced function.\n * @example\n *\n * // Avoid costly calculations while the window size is in flux.\n * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n *\n * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n * jQuery(element).on('click', _.debounce(sendMail, 300, {\n *   'leading': true,\n *   'trailing': false\n * }));\n *\n * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n * var source = new EventSource('/stream');\n * jQuery(source).on('message', debounced);\n *\n * // Cancel the trailing debounced invocation.\n * jQuery(window).on('popstate', debounced.cancel);\n */\nfunction debounce(func, wait, options) {\n  var lastArgs,\n      lastThis,\n      maxWait,\n      result,\n      timerId,\n      lastCallTime,\n      lastInvokeTime = 0,\n      leading = false,\n      maxing = false,\n      trailing = true;\n\n  if (typeof func != 'function') {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  wait = toNumber(wait) || 0;\n  if (isObject(options)) {\n    leading = !!options.leading;\n    maxing = 'maxWait' in options;\n    maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n    trailing = 'trailing' in options ? !!options.trailing : trailing;\n  }\n\n  function invokeFunc(time) {\n    var args = lastArgs,\n        thisArg = lastThis;\n\n    lastArgs = lastThis = undefined;\n    lastInvokeTime = time;\n    result = func.apply(thisArg, args);\n    return result;\n  }\n\n  function leadingEdge(time) {\n    // Reset any `maxWait` timer.\n    lastInvokeTime = time;\n    // Start the timer for the trailing edge.\n    timerId = setTimeout(timerExpired, wait);\n    // Invoke the leading edge.\n    return leading ? invokeFunc(time) : result;\n  }\n\n  function remainingWait(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime,\n        timeWaiting = wait - timeSinceLastCall;\n\n    return maxing\n      ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n      : timeWaiting;\n  }\n\n  function shouldInvoke(time) {\n    var timeSinceLastCall = time - lastCallTime,\n        timeSinceLastInvoke = time - lastInvokeTime;\n\n    // Either this is the first call, activity has stopped and we're at the\n    // trailing edge, the system time has gone backwards and we're treating\n    // it as the trailing edge, or we've hit the `maxWait` limit.\n    return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n      (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n  }\n\n  function timerExpired() {\n    var time = now();\n    if (shouldInvoke(time)) {\n      return trailingEdge(time);\n    }\n    // Restart the timer.\n    timerId = setTimeout(timerExpired, remainingWait(time));\n  }\n\n  function trailingEdge(time) {\n    timerId = undefined;\n\n    // Only invoke if we have `lastArgs` which means `func` has been\n    // debounced at least once.\n    if (trailing && lastArgs) {\n      return invokeFunc(time);\n    }\n    lastArgs = lastThis = undefined;\n    return result;\n  }\n\n  function cancel() {\n    if (timerId !== undefined) {\n      clearTimeout(timerId);\n    }\n    lastInvokeTime = 0;\n    lastArgs = lastCallTime = lastThis = timerId = undefined;\n  }\n\n  function flush() {\n    return timerId === undefined ? result : trailingEdge(now());\n  }\n\n  function debounced() {\n    var time = now(),\n        isInvoking = shouldInvoke(time);\n\n    lastArgs = arguments;\n    lastThis = this;\n    lastCallTime = time;\n\n    if (isInvoking) {\n      if (timerId === undefined) {\n        return leadingEdge(lastCallTime);\n      }\n      if (maxing) {\n        // Handle invocations in a tight loop.\n        clearTimeout(timerId);\n        timerId = setTimeout(timerExpired, wait);\n        return invokeFunc(lastCallTime);\n      }\n    }\n    if (timerId === undefined) {\n      timerId = setTimeout(timerExpired, wait);\n    }\n    return result;\n  }\n  debounced.cancel = cancel;\n  debounced.flush = flush;\n  return debounced;\n}\n\nmodule.exports = debounce;\n"],"names":["isObject","require$$0","now","require$$1","toNumber","require$$2","FUNC_ERROR_TEXT","nativeMax","nativeMin","debounce","func","wait","options","lastArgs","lastThis","maxWait","result","timerId","lastCallTime","lastInvokeTime","leading","maxing","trailing","invokeFunc","time","args","thisArg","leadingEdge","timerExpired","remainingWait","timeSinceLastCall","timeSinceLastInvoke","timeWaiting","shouldInvoke","trailingEdge","cancel","flush","debounced","isInvoking","debounce_1"],"mappings":"+IAAA,IAAIA,EAAWC,EAAAA,WACXC,EAAMC,EAAAA,MACNC,EAAWC,EAAAA,WAGXC,EAAkB,sBAGlBC,EAAY,KAAK,IACjBC,EAAY,KAAK,IAwDrB,SAASC,EAASC,EAAMC,EAAMC,EAAS,CACrC,IAAIC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EAAiB,EACjBC,EAAU,GACVC,EAAS,GACTC,EAAW,GAEX,GAAA,OAAOZ,GAAQ,WACX,MAAA,IAAI,UAAUJ,CAAe,EAE9BK,EAAAP,EAASO,CAAI,GAAK,EACrBX,EAASY,CAAO,IACRQ,EAAA,CAAC,CAACR,EAAQ,QACpBS,EAAS,YAAaT,EACZG,EAAAM,EAASd,EAAUH,EAASQ,EAAQ,OAAO,GAAK,EAAGD,CAAI,EAAII,EACrEO,EAAW,aAAcV,EAAU,CAAC,CAACA,EAAQ,SAAWU,GAG1D,SAASC,EAAWC,EAAM,CACpB,IAAAC,EAAOZ,EACPa,EAAUZ,EAEd,OAAAD,EAAWC,EAAW,OACLK,EAAAK,EACRR,EAAAN,EAAK,MAAMgB,EAASD,CAAI,EAC1BT,CACT,CAEA,SAASW,EAAYH,EAAM,CAER,OAAAL,EAAAK,EAEPP,EAAA,WAAWW,EAAcjB,CAAI,EAEhCS,EAAUG,EAAWC,CAAI,EAAIR,CACtC,CAEA,SAASa,EAAcL,EAAM,CAC3B,IAAIM,EAAoBN,EAAON,EAC3Ba,EAAsBP,EAAOL,EAC7Ba,EAAcrB,EAAOmB,EAEzB,OAAOT,EACHb,EAAUwB,EAAajB,EAAUgB,CAAmB,EACpDC,CACN,CAEA,SAASC,EAAaT,EAAM,CAC1B,IAAIM,EAAoBN,EAAON,EAC3Ba,EAAsBP,EAAOL,EAKjC,OAAQD,IAAiB,QAAcY,GAAqBnB,GACzDmB,EAAoB,GAAOT,GAAUU,GAAuBhB,CACjE,CAEA,SAASa,GAAe,CACtB,IAAIJ,EAAOtB,IACP,GAAA+B,EAAaT,CAAI,EACnB,OAAOU,EAAaV,CAAI,EAG1BP,EAAU,WAAWW,EAAcC,EAAcL,CAAI,CAAC,CACxD,CAEA,SAASU,EAAaV,EAAM,CAK1B,OAJUP,EAAA,OAINK,GAAYT,EACPU,EAAWC,CAAI,GAExBX,EAAWC,EAAW,OACfE,EACT,CAEA,SAASmB,GAAS,CACZlB,IAAY,QACd,aAAaA,CAAO,EAELE,EAAA,EACNN,EAAAK,EAAeJ,EAAWG,EAAU,MACjD,CAEA,SAASmB,GAAQ,CACf,OAAOnB,IAAY,OAAYD,EAASkB,EAAahC,GAAK,CAC5D,CAEA,SAASmC,GAAY,CACnB,IAAIb,EAAOtB,EACP,EAAAoC,EAAaL,EAAaT,CAAI,EAMlC,GAJWX,EAAA,UACAC,EAAA,KACII,EAAAM,EAEXc,EAAY,CACd,GAAIrB,IAAY,OACd,OAAOU,EAAYT,CAAY,EAEjC,GAAIG,EAEF,oBAAaJ,CAAO,EACVA,EAAA,WAAWW,EAAcjB,CAAI,EAChCY,EAAWL,CAAY,CAElC,CACA,OAAID,IAAY,SACJA,EAAA,WAAWW,EAAcjB,CAAI,GAElCK,CACT,CACA,OAAAqB,EAAU,OAASF,EACnBE,EAAU,MAAQD,EACXC,CACT,CAEA,IAAAE,EAAiB9B","x_google_ignoreList":[0]}