@performant-software/visualize 3.0.7-beta.1 → 3.1.0-beta.0

package/dist/index.es165.js

@@ -1,9 +1,58 @@
-import e from "./index.es220.js";
-import t from "./index.es100.js";
-function f(r) {
-  return r == null ? 0 : e(r) ? r.length : t(r).length;
+import { getDefaultExportFromCjs as M } from "./index.es188.js";
+import { i as S } from "./index.es193.js";
+import { n as j } from "./index.es194.js";
+import { t as y } from "./index.es195.js";
+var F = S, x = j, I = y, N = "Expected a function", O = Math.max, R = Math.min;
+function A(h, t, a) {
+  var o, m, s, u, i, r, f = 0, b = !1, c = !1, d = !0;
+  if (typeof h != "function")
+    throw new TypeError(N);
+  t = I(t) || 0, F(a) && (b = !!a.leading, c = "maxWait" in a, s = c ? O(I(a.maxWait) || 0, t) : s, d = "trailing" in a ? !!a.trailing : d);
+  function g(e) {
+    var n = o, l = m;
+    return o = m = void 0, f = e, u = h.apply(l, n), u;
+  }
+  function _(e) {
+    return f = e, i = setTimeout(v, t), b ? g(e) : u;
+  }
+  function C(e) {
+    var n = e - r, l = e - f, k = t - n;
+    return c ? R(k, s - l) : k;
+  }
+  function E(e) {
+    var n = e - r, l = e - f;
+    return r === void 0 || n >= t || n < 0 || c && l >= s;
+  }
+  function v() {
+    var e = x();
+    if (E(e))
+      return p(e);
+    i = setTimeout(v, C(e));
+  }
+  function p(e) {
+    return i = void 0, d && o ? g(e) : (o = m = void 0, u);
+  }
+  function W() {
+    i !== void 0 && clearTimeout(i), f = 0, o = r = m = i = void 0;
+  }
+  function L() {
+    return i === void 0 ? u : p(x());
+  }
+  function T() {
+    var e = x(), n = E(e);
+    if (o = arguments, m = this, r = e, n) {
+      if (i === void 0)
+        return _(r);
+      if (c)
+        return clearTimeout(i), i = setTimeout(v, t), g(r);
+    }
+    return i === void 0 && (i = setTimeout(v, t)), u;
+  }
+  return T.cancel = W, T.flush = L, T;
 }
+var D = A;
+const z = /* @__PURE__ */ M(D);
 export {
-  f as default
+  z as default
 };
 //# sourceMappingURL=index.es165.js.map

package/dist/index.es165.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es165.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":";;AAIA,SAAwBA,EAAKC,GAAK;AAChC,SAAIA,KAAO,OAAa,IACjBC,EAAYD,CAAG,IAAIA,EAAI,SAASE,EAAKF,CAAG,EAAE;AACnD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es165.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":";;;;AAAA,IAAIA,IAAWC,GACXC,IAAMC,GACNC,IAAWC,GAGXC,IAAkB,uBAGlBC,IAAY,KAAK,KACjBC,IAAY,KAAK;AAwDrB,SAASC,EAASC,GAAMC,GAAMC,GAAS;AACrC,MAAIC,GACAC,GACAC,GACAC,GACAC,GACAC,GACAC,IAAiB,GACjBC,IAAU,IACVC,IAAS,IACTC,IAAW;AAEX,MAAA,OAAOZ,KAAQ;AACX,UAAA,IAAI,UAAUJ,CAAe;AAE9B,EAAAK,IAAAP,EAASO,CAAI,KAAK,GACrBX,EAASY,CAAO,MACRQ,IAAA,CAAC,CAACR,EAAQ,SACpBS,IAAS,aAAaT,GACZG,IAAAM,IAASd,EAAUH,EAASQ,EAAQ,OAAO,KAAK,GAAGD,CAAI,IAAII,GACrEO,IAAW,cAAcV,IAAU,CAAC,CAACA,EAAQ,WAAWU;AAG1D,WAASC,EAAWC,GAAM;AACpB,QAAAC,IAAOZ,GACPa,IAAUZ;AAEd,WAAAD,IAAWC,IAAW,QACLK,IAAAK,GACRR,IAAAN,EAAK,MAAMgB,GAASD,CAAI,GAC1BT;AAAA,EACT;AAEA,WAASW,EAAYH,GAAM;AAER,WAAAL,IAAAK,GAEPP,IAAA,WAAWW,GAAcjB,CAAI,GAEhCS,IAAUG,EAAWC,CAAI,IAAIR;AAAA,EACtC;AAEA,WAASa,EAAcL,GAAM;AAC3B,QAAIM,IAAoBN,IAAON,GAC3Ba,IAAsBP,IAAOL,GAC7Ba,IAAcrB,IAAOmB;AAEzB,WAAOT,IACHb,EAAUwB,GAAajB,IAAUgB,CAAmB,IACpDC;AAAA,EACN;AAEA,WAASC,EAAaT,GAAM;AAC1B,QAAIM,IAAoBN,IAAON,GAC3Ba,IAAsBP,IAAOL;AAKjC,WAAQD,MAAiB,UAAcY,KAAqBnB,KACzDmB,IAAoB,KAAOT,KAAUU,KAAuBhB;AAAA,EACjE;AAEA,WAASa,IAAe;AACtB,QAAIJ,IAAOtB;AACP,QAAA+B,EAAaT,CAAI;AACnB,aAAOU,EAAaV,CAAI;AAG1B,IAAAP,IAAU,WAAWW,GAAcC,EAAcL,CAAI,CAAC;AAAA,EACxD;AAEA,WAASU,EAAaV,GAAM;AAK1B,WAJUP,IAAA,QAINK,KAAYT,IACPU,EAAWC,CAAI,KAExBX,IAAWC,IAAW,QACfE;AAAA,EACT;AAEA,WAASmB,IAAS;AAChB,IAAIlB,MAAY,UACd,aAAaA,CAAO,GAELE,IAAA,GACNN,IAAAK,IAAeJ,IAAWG,IAAU;AAAA,EACjD;AAEA,WAASmB,IAAQ;AACf,WAAOnB,MAAY,SAAYD,IAASkB,EAAahC,GAAK;AAAA,EAC5D;AAEA,WAASmC,IAAY;AACnB,QAAIb,IAAOtB,EACP,GAAAoC,IAAaL,EAAaT,CAAI;AAMlC,QAJWX,IAAA,WACAC,IAAA,MACII,IAAAM,GAEXc,GAAY;AACd,UAAIrB,MAAY;AACd,eAAOU,EAAYT,CAAY;AAEjC,UAAIG;AAEF,4BAAaJ,CAAO,GACVA,IAAA,WAAWW,GAAcjB,CAAI,GAChCY,EAAWL,CAAY;AAAA,IAElC;AACA,WAAID,MAAY,WACJA,IAAA,WAAWW,GAAcjB,CAAI,IAElCK;AAAA,EACT;AACA,SAAAqB,EAAU,SAASF,GACnBE,EAAU,QAAQD,GACXC;AACT;AAEA,IAAAE,IAAiB9B;;","x_google_ignoreList":[0]}

package/dist/index.es166.js

@@ -1,8 +1,32 @@
-import n from "./index.es167.js";
-function u(t, l, i) {
-  return t == null || t.length < 1 ? l == null || i ? void 0 : [] : l == null || i ? t[0] : n(t, t.length - l);
-}
+import { ResizeObserverController as t } from "./index.es249.js";
+import { isElement as o } from "./index.es250.js";
+var u = function() {
+  function r(e) {
+    if (arguments.length === 0)
+      throw new TypeError("Failed to construct 'ResizeObserver': 1 argument required, but only 0 present.");
+    if (typeof e != "function")
+      throw new TypeError("Failed to construct 'ResizeObserver': The callback provided as parameter 1 is not a function.");
+    t.connect(this, e);
+  }
+  return r.prototype.observe = function(e, n) {
+    if (arguments.length === 0)
+      throw new TypeError("Failed to execute 'observe' on 'ResizeObserver': 1 argument required, but only 0 present.");
+    if (!o(e))
+      throw new TypeError("Failed to execute 'observe' on 'ResizeObserver': parameter 1 is not of type 'Element");
+    t.observe(this, e, n);
+  }, r.prototype.unobserve = function(e) {
+    if (arguments.length === 0)
+      throw new TypeError("Failed to execute 'unobserve' on 'ResizeObserver': 1 argument required, but only 0 present.");
+    if (!o(e))
+      throw new TypeError("Failed to execute 'unobserve' on 'ResizeObserver': parameter 1 is not of type 'Element");
+    t.unobserve(this, e);
+  }, r.prototype.disconnect = function() {
+    t.disconnect(this);
+  }, r.toString = function() {
+    return "function ResizeObserver () { [polyfill code] }";
+  }, r;
+}();
 export {
-  u as default
+  u as ResizeObserver
 };
 //# sourceMappingURL=index.es166.js.map

package/dist/index.es166.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es166.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":";AAIwB,SAAAA,EAAMC,GAAOC,GAAGC,GAAO;AACzC,SAAAF,KAAS,QAAQA,EAAM,SAAS,IAAUC,KAAK,QAAQC,IAAQ,SAAS,CAAA,IACxED,KAAK,QAAQC,IAAcF,EAAM,CAAC,IAC/BG,EAAQH,GAAOA,EAAM,SAASC,CAAC;AACxC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es166.js","sources":["../../../node_modules/@juggle/resize-observer/lib/ResizeObserver.js"],"sourcesContent":["import { ResizeObserverController } from './ResizeObserverController';\nimport { isElement } from './utils/element';\nvar ResizeObserver = (function () {\n    function ResizeObserver(callback) {\n        if (arguments.length === 0) {\n            throw new TypeError(\"Failed to construct 'ResizeObserver': 1 argument required, but only 0 present.\");\n        }\n        if (typeof callback !== 'function') {\n            throw new TypeError(\"Failed to construct 'ResizeObserver': The callback provided as parameter 1 is not a function.\");\n        }\n        ResizeObserverController.connect(this, callback);\n    }\n    ResizeObserver.prototype.observe = function (target, options) {\n        if (arguments.length === 0) {\n            throw new TypeError(\"Failed to execute 'observe' on 'ResizeObserver': 1 argument required, but only 0 present.\");\n        }\n        if (!isElement(target)) {\n            throw new TypeError(\"Failed to execute 'observe' on 'ResizeObserver': parameter 1 is not of type 'Element\");\n        }\n        ResizeObserverController.observe(this, target, options);\n    };\n    ResizeObserver.prototype.unobserve = function (target) {\n        if (arguments.length === 0) {\n            throw new TypeError(\"Failed to execute 'unobserve' on 'ResizeObserver': 1 argument required, but only 0 present.\");\n        }\n        if (!isElement(target)) {\n            throw new TypeError(\"Failed to execute 'unobserve' on 'ResizeObserver': parameter 1 is not of type 'Element\");\n        }\n        ResizeObserverController.unobserve(this, target);\n    };\n    ResizeObserver.prototype.disconnect = function () {\n        ResizeObserverController.disconnect(this);\n    };\n    ResizeObserver.toString = function () {\n        return 'function ResizeObserver () { [polyfill code] }';\n    };\n    return ResizeObserver;\n}());\nexport { ResizeObserver };\n"],"names":["ResizeObserver","callback","ResizeObserverController","target","options","isElement"],"mappings":";;AAEA,IAAIA,IAAkB,WAAY;AAC9B,WAASA,EAAeC,GAAU;AAC1B,QAAA,UAAU,WAAW;AACf,YAAA,IAAI,UAAU,gFAAgF;AAEpG,QAAA,OAAOA,KAAa;AACd,YAAA,IAAI,UAAU,+FAA+F;AAE9F,IAAAC,EAAA,QAAQ,MAAMD,CAAQ;AAAA,EACnD;AACAD,SAAAA,EAAe,UAAU,UAAU,SAAUG,GAAQC,GAAS;AACtD,QAAA,UAAU,WAAW;AACf,YAAA,IAAI,UAAU,2FAA2F;AAE/G,QAAA,CAACC,EAAUF,CAAM;AACX,YAAA,IAAI,UAAU,sFAAsF;AAErF,IAAAD,EAAA,QAAQ,MAAMC,GAAQC,CAAO;AAAA,EAAA,GAE1DJ,EAAe,UAAU,YAAY,SAAUG,GAAQ;AAC/C,QAAA,UAAU,WAAW;AACf,YAAA,IAAI,UAAU,6FAA6F;AAEjH,QAAA,CAACE,EAAUF,CAAM;AACX,YAAA,IAAI,UAAU,wFAAwF;AAEvF,IAAAD,EAAA,UAAU,MAAMC,CAAM;AAAA,EAAA,GAEnDH,EAAe,UAAU,aAAa,WAAY;AAC9C,IAAAE,EAAyB,WAAW,IAAI;AAAA,EAAA,GAE5CF,EAAe,WAAW,WAAY;AAC3B,WAAA;AAAA,EAAA,GAEJA;AACX,EAAE;","x_google_ignoreList":[0]}

package/dist/index.es167.js

@@ -1,8 +1,43 @@
-import { slice as e } from "./index.es6.js";
-function a(l, t, i) {
-  return e.call(l, 0, Math.max(0, l.length - (t == null || i ? 1 : t)));
-}
+import { ResizeObserverBoxOptions as z } from "./index.es273.js";
+import { ResizeObserverSize as X } from "./index.es253.js";
+import { DOMRectReadOnly as P } from "./index.es274.js";
+import { isHidden as A, isSVG as I } from "./index.es250.js";
+import { freeze as O } from "./index.es252.js";
+import { global as R } from "./index.es275.js";
+var l = /* @__PURE__ */ new WeakMap(), S = /auto|scroll/, G = /^tb|vertical/, N = /msie|trident/i.test(R.navigator && R.navigator.userAgent), i = function(e) {
+  return parseFloat(e || "0");
+}, a = function(e, t, r) {
+  return e === void 0 && (e = 0), t === void 0 && (t = 0), r === void 0 && (r = !1), new X((r ? t : e) || 0, (r ? e : t) || 0);
+}, w = O({
+  devicePixelContentBoxSize: a(),
+  borderBoxSize: a(),
+  contentBoxSize: a(),
+  contentRect: new P(0, 0, 0, 0)
+}), F = function(e, t) {
+  if (t === void 0 && (t = !1), l.has(e) && !t)
+    return l.get(e);
+  if (A(e))
+    return l.set(e, w), w;
+  var r = getComputedStyle(e), o = I(e) && e.ownerSVGElement && e.getBBox(), d = !N && r.boxSizing === "border-box", n = G.test(r.writingMode || ""), s = !o && S.test(r.overflowY || ""), W = !o && S.test(r.overflowX || ""), B = o ? 0 : i(r.paddingTop), T = o ? 0 : i(r.paddingRight), C = o ? 0 : i(r.paddingBottom), f = o ? 0 : i(r.paddingLeft), E = o ? 0 : i(r.borderTopWidth), H = o ? 0 : i(r.borderRightWidth), L = o ? 0 : i(r.borderBottomWidth), M = o ? 0 : i(r.borderLeftWidth), p = f + T, g = B + C, h = M + H, x = E + L, b = W ? e.offsetHeight - x - e.clientHeight : 0, m = s ? e.offsetWidth - h - e.clientWidth : 0, _ = d ? p + h : 0, y = d ? g + x : 0, v = o ? o.width : i(r.width) - _ - m, c = o ? o.height : i(r.height) - y - b, D = v + p + m + h, V = c + g + b + x, u = O({
+    devicePixelContentBoxSize: a(Math.round(v * devicePixelRatio), Math.round(c * devicePixelRatio), n),
+    borderBoxSize: a(D, V, n),
+    contentBoxSize: a(v, c, n),
+    contentRect: new P(f, B, v, c)
+  });
+  return l.set(e, u), u;
+}, Q = function(e, t, r) {
+  var o = F(e, r), d = o.borderBoxSize, n = o.contentBoxSize, s = o.devicePixelContentBoxSize;
+  switch (t) {
+    case z.DEVICE_PIXEL_CONTENT_BOX:
+      return s;
+    case z.BORDER_BOX:
+      return d;
+    default:
+      return n;
+  }
+};
 export {
-  a as default
+  Q as calculateBoxSize,
+  F as calculateBoxSizes
 };
 //# sourceMappingURL=index.es167.js.map

package/dist/index.es167.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es167.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":";AAKwB,SAAAA,EAAQC,GAAOC,GAAGC,GAAO;AAC/C,SAAOC,EAAM,KAAKH,GAAO,GAAG,KAAK,IAAI,GAAGA,EAAM,UAAUC,KAAK,QAAQC,IAAQ,IAAID,EAAE,CAAC;AACtF;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es167.js","sources":["../../../node_modules/@juggle/resize-observer/lib/algorithms/calculateBoxSize.js"],"sourcesContent":["import { ResizeObserverBoxOptions } from '../ResizeObserverBoxOptions';\nimport { ResizeObserverSize } from '../ResizeObserverSize';\nimport { DOMRectReadOnly } from '../DOMRectReadOnly';\nimport { isSVG, isHidden } from '../utils/element';\nimport { freeze } from '../utils/freeze';\nimport { global } from '../utils/global';\nvar cache = new WeakMap();\nvar scrollRegexp = /auto|scroll/;\nvar verticalRegexp = /^tb|vertical/;\nvar IE = (/msie|trident/i).test(global.navigator && global.navigator.userAgent);\nvar parseDimension = function (pixel) { return parseFloat(pixel || '0'); };\nvar size = function (inlineSize, blockSize, switchSizes) {\n    if (inlineSize === void 0) { inlineSize = 0; }\n    if (blockSize === void 0) { blockSize = 0; }\n    if (switchSizes === void 0) { switchSizes = false; }\n    return new ResizeObserverSize((switchSizes ? blockSize : inlineSize) || 0, (switchSizes ? inlineSize : blockSize) || 0);\n};\nvar zeroBoxes = freeze({\n    devicePixelContentBoxSize: size(),\n    borderBoxSize: size(),\n    contentBoxSize: size(),\n    contentRect: new DOMRectReadOnly(0, 0, 0, 0)\n});\nvar calculateBoxSizes = function (target, forceRecalculation) {\n    if (forceRecalculation === void 0) { forceRecalculation = false; }\n    if (cache.has(target) && !forceRecalculation) {\n        return cache.get(target);\n    }\n    if (isHidden(target)) {\n        cache.set(target, zeroBoxes);\n        return zeroBoxes;\n    }\n    var cs = getComputedStyle(target);\n    var svg = isSVG(target) && target.ownerSVGElement && target.getBBox();\n    var removePadding = !IE && cs.boxSizing === 'border-box';\n    var switchSizes = verticalRegexp.test(cs.writingMode || '');\n    var canScrollVertically = !svg && scrollRegexp.test(cs.overflowY || '');\n    var canScrollHorizontally = !svg && scrollRegexp.test(cs.overflowX || '');\n    var paddingTop = svg ? 0 : parseDimension(cs.paddingTop);\n    var paddingRight = svg ? 0 : parseDimension(cs.paddingRight);\n    var paddingBottom = svg ? 0 : parseDimension(cs.paddingBottom);\n    var paddingLeft = svg ? 0 : parseDimension(cs.paddingLeft);\n    var borderTop = svg ? 0 : parseDimension(cs.borderTopWidth);\n    var borderRight = svg ? 0 : parseDimension(cs.borderRightWidth);\n    var borderBottom = svg ? 0 : parseDimension(cs.borderBottomWidth);\n    var borderLeft = svg ? 0 : parseDimension(cs.borderLeftWidth);\n    var horizontalPadding = paddingLeft + paddingRight;\n    var verticalPadding = paddingTop + paddingBottom;\n    var horizontalBorderArea = borderLeft + borderRight;\n    var verticalBorderArea = borderTop + borderBottom;\n    var horizontalScrollbarThickness = !canScrollHorizontally ? 0 : target.offsetHeight - verticalBorderArea - target.clientHeight;\n    var verticalScrollbarThickness = !canScrollVertically ? 0 : target.offsetWidth - horizontalBorderArea - target.clientWidth;\n    var widthReduction = removePadding ? horizontalPadding + horizontalBorderArea : 0;\n    var heightReduction = removePadding ? verticalPadding + verticalBorderArea : 0;\n    var contentWidth = svg ? svg.width : parseDimension(cs.width) - widthReduction - verticalScrollbarThickness;\n    var contentHeight = svg ? svg.height : parseDimension(cs.height) - heightReduction - horizontalScrollbarThickness;\n    var borderBoxWidth = contentWidth + horizontalPadding + verticalScrollbarThickness + horizontalBorderArea;\n    var borderBoxHeight = contentHeight + verticalPadding + horizontalScrollbarThickness + verticalBorderArea;\n    var boxes = freeze({\n        devicePixelContentBoxSize: size(Math.round(contentWidth * devicePixelRatio), Math.round(contentHeight * devicePixelRatio), switchSizes),\n        borderBoxSize: size(borderBoxWidth, borderBoxHeight, switchSizes),\n        contentBoxSize: size(contentWidth, contentHeight, switchSizes),\n        contentRect: new DOMRectReadOnly(paddingLeft, paddingTop, contentWidth, contentHeight)\n    });\n    cache.set(target, boxes);\n    return boxes;\n};\nvar calculateBoxSize = function (target, observedBox, forceRecalculation) {\n    var _a = calculateBoxSizes(target, forceRecalculation), borderBoxSize = _a.borderBoxSize, contentBoxSize = _a.contentBoxSize, devicePixelContentBoxSize = _a.devicePixelContentBoxSize;\n    switch (observedBox) {\n        case ResizeObserverBoxOptions.DEVICE_PIXEL_CONTENT_BOX:\n            return devicePixelContentBoxSize;\n        case ResizeObserverBoxOptions.BORDER_BOX:\n            return borderBoxSize;\n        default:\n            return contentBoxSize;\n    }\n};\nexport { calculateBoxSize, calculateBoxSizes };\n"],"names":["cache","scrollRegexp","verticalRegexp","IE","global","parseDimension","pixel","size","inlineSize","blockSize","switchSizes","ResizeObserverSize","zeroBoxes","freeze","DOMRectReadOnly","calculateBoxSizes","target","forceRecalculation","isHidden","cs","svg","isSVG","removePadding","canScrollVertically","canScrollHorizontally","paddingTop","paddingRight","paddingBottom","paddingLeft","borderTop","borderRight","borderBottom","borderLeft","horizontalPadding","verticalPadding","horizontalBorderArea","verticalBorderArea","horizontalScrollbarThickness","verticalScrollbarThickness","widthReduction","heightReduction","contentWidth","contentHeight","borderBoxWidth","borderBoxHeight","boxes","calculateBoxSize","observedBox","_a","borderBoxSize","contentBoxSize","devicePixelContentBoxSize","ResizeObserverBoxOptions"],"mappings":";;;;;;AAMA,IAAIA,wBAAY,WACZC,IAAe,eACfC,IAAiB,gBACjBC,IAAM,gBAAiB,KAAKC,EAAO,aAAaA,EAAO,UAAU,SAAS,GAC1EC,IAAiB,SAAUC,GAAO;AAAS,SAAA,WAAWA,KAAS,GAAG;AAAG,GACrEC,IAAO,SAAUC,GAAYC,GAAWC,GAAa;AACrD,SAAIF,MAAe,WAAuBA,IAAA,IACtCC,MAAc,WAAsBA,IAAA,IACpCC,MAAgB,WAAwBA,IAAA,KACrC,IAAIC,GAAoBD,IAAcD,IAAYD,MAAe,IAAIE,IAAcF,IAAaC,MAAc,CAAC;AAC1H,GACIG,IAAYC,EAAO;AAAA,EACnB,2BAA2BN,EAAK;AAAA,EAChC,eAAeA,EAAK;AAAA,EACpB,gBAAgBA,EAAK;AAAA,EACrB,aAAa,IAAIO,EAAgB,GAAG,GAAG,GAAG,CAAC;AAC/C,CAAC,GACGC,IAAoB,SAAUC,GAAQC,GAAoB;AAE1D,MADIA,MAAuB,WAA+BA,IAAA,KACtDjB,EAAM,IAAIgB,CAAM,KAAK,CAACC;AACf,WAAAjB,EAAM,IAAIgB,CAAM;AAEvB,MAAAE,EAASF,CAAM;AACT,WAAAhB,EAAA,IAAIgB,GAAQJ,CAAS,GACpBA;AAEP,MAAAO,IAAK,iBAAiBH,CAAM,GAC5BI,IAAMC,EAAML,CAAM,KAAKA,EAAO,mBAAmBA,EAAO,WACxDM,IAAgB,CAACnB,KAAMgB,EAAG,cAAc,cACxCT,IAAcR,EAAe,KAAKiB,EAAG,eAAe,EAAE,GACtDI,IAAsB,CAACH,KAAOnB,EAAa,KAAKkB,EAAG,aAAa,EAAE,GAClEK,IAAwB,CAACJ,KAAOnB,EAAa,KAAKkB,EAAG,aAAa,EAAE,GACpEM,IAAaL,IAAM,IAAIf,EAAec,EAAG,UAAU,GACnDO,IAAeN,IAAM,IAAIf,EAAec,EAAG,YAAY,GACvDQ,IAAgBP,IAAM,IAAIf,EAAec,EAAG,aAAa,GACzDS,IAAcR,IAAM,IAAIf,EAAec,EAAG,WAAW,GACrDU,IAAYT,IAAM,IAAIf,EAAec,EAAG,cAAc,GACtDW,IAAcV,IAAM,IAAIf,EAAec,EAAG,gBAAgB,GAC1DY,IAAeX,IAAM,IAAIf,EAAec,EAAG,iBAAiB,GAC5Da,IAAaZ,IAAM,IAAIf,EAAec,EAAG,eAAe,GACxDc,IAAoBL,IAAcF,GAClCQ,IAAkBT,IAAaE,GAC/BQ,IAAuBH,IAAaF,GACpCM,IAAqBP,IAAYE,GACjCM,IAAgCb,IAA4BR,EAAO,eAAeoB,IAAqBpB,EAAO,eAAtD,GACxDsB,IAA8Bf,IAA0BP,EAAO,cAAcmB,IAAuBnB,EAAO,cAAvD,GACpDuB,IAAiBjB,IAAgBW,IAAoBE,IAAuB,GAC5EK,IAAkBlB,IAAgBY,IAAkBE,IAAqB,GACzEK,IAAerB,IAAMA,EAAI,QAAQf,EAAec,EAAG,KAAK,IAAIoB,IAAiBD,GAC7EI,IAAgBtB,IAAMA,EAAI,SAASf,EAAec,EAAG,MAAM,IAAIqB,IAAkBH,GACjFM,IAAiBF,IAAeR,IAAoBK,IAA6BH,GACjFS,IAAkBF,IAAgBR,IAAkBG,IAA+BD,GACnFS,IAAQhC,EAAO;AAAA,IACf,2BAA2BN,EAAK,KAAK,MAAMkC,IAAe,gBAAgB,GAAG,KAAK,MAAMC,IAAgB,gBAAgB,GAAGhC,CAAW;AAAA,IACtI,eAAeH,EAAKoC,GAAgBC,GAAiBlC,CAAW;AAAA,IAChE,gBAAgBH,EAAKkC,GAAcC,GAAehC,CAAW;AAAA,IAC7D,aAAa,IAAII,EAAgBc,GAAaH,GAAYgB,GAAcC,CAAa;AAAA,EAAA,CACxF;AACK,SAAA1C,EAAA,IAAIgB,GAAQ6B,CAAK,GAChBA;AACX,GACIC,IAAmB,SAAU9B,GAAQ+B,GAAa9B,GAAoB;AACtE,MAAI+B,IAAKjC,EAAkBC,GAAQC,CAAkB,GAAGgC,IAAgBD,EAAG,eAAeE,IAAiBF,EAAG,gBAAgBG,IAA4BH,EAAG;AAC7J,UAAQD,GAAa;AAAA,IACjB,KAAKK,EAAyB;AACnB,aAAAD;AAAA,IACX,KAAKC,EAAyB;AACnB,aAAAH;AAAA,IACX;AACW,aAAAC;AAAA,EACf;AACJ;","x_google_ignoreList":[0]}

package/dist/index.es168.js

@@ -1,8 +1,43 @@
-import n from "./index.es169.js";
-function f(t, l, e) {
-  return t == null || t.length < 1 ? l == null || e ? void 0 : [] : l == null || e ? t[t.length - 1] : n(t, Math.max(0, t.length - l));
-}
+import { getDefaultExportFromCjs as p } from "./index.es188.js";
+import { __module as i } from "./index.es196.js";
+/*!
+	Copyright (c) 2018 Jed Watson.
+	Licensed under the MIT License (MIT), see
+	http://jedwatson.github.io/classnames
+*/
+(function(o) {
+  (function() {
+    var f = {}.hasOwnProperty;
+    function e() {
+      for (var t = "", r = 0; r < arguments.length; r++) {
+        var n = arguments[r];
+        n && (t = s(t, u(n)));
+      }
+      return t;
+    }
+    function u(t) {
+      if (typeof t == "string" || typeof t == "number")
+        return t;
+      if (typeof t != "object")
+        return "";
+      if (Array.isArray(t))
+        return e.apply(null, t);
+      if (t.toString !== Object.prototype.toString && !t.toString.toString().includes("[native code]"))
+        return t.toString();
+      var r = "";
+      for (var n in t)
+        f.call(t, n) && t[n] && (r = s(r, n));
+      return r;
+    }
+    function s(t, r) {
+      return r ? t ? t + " " + r : t + r : t;
+    }
+    o.exports ? (e.default = e, o.exports = e) : window.classNames = e;
+  })();
+})(i);
+var a = i.exports;
+const m = /* @__PURE__ */ p(a);
 export {
-  f as default
+  m as default
 };
 //# sourceMappingURL=index.es168.js.map

package/dist/index.es168.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es168.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":";AAIwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AACxC,SAAAF,KAAS,QAAQA,EAAM,SAAS,IAAUC,KAAK,QAAQC,IAAQ,SAAS,CAAA,IACxED,KAAK,QAAQC,IAAcF,EAAMA,EAAM,SAAS,CAAC,IAC9CG,EAAKH,GAAO,KAAK,IAAI,GAAGA,EAAM,SAASC,CAAC,CAAC;AAClD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es168.js","sources":["../../../node_modules/classnames/index.js"],"sourcesContent":["/*!\n\tCopyright (c) 2018 Jed Watson.\n\tLicensed under the MIT License (MIT), see\n\thttp://jedwatson.github.io/classnames\n*/\n/* global define */\n\n(function () {\n\t'use strict';\n\n\tvar hasOwn = {}.hasOwnProperty;\n\n\tfunction classNames () {\n\t\tvar classes = '';\n\n\t\tfor (var i = 0; i < arguments.length; i++) {\n\t\t\tvar arg = arguments[i];\n\t\t\tif (arg) {\n\t\t\t\tclasses = appendClass(classes, parseValue(arg));\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction parseValue (arg) {\n\t\tif (typeof arg === 'string' || typeof arg === 'number') {\n\t\t\treturn arg;\n\t\t}\n\n\t\tif (typeof arg !== 'object') {\n\t\t\treturn '';\n\t\t}\n\n\t\tif (Array.isArray(arg)) {\n\t\t\treturn classNames.apply(null, arg);\n\t\t}\n\n\t\tif (arg.toString !== Object.prototype.toString && !arg.toString.toString().includes('[native code]')) {\n\t\t\treturn arg.toString();\n\t\t}\n\n\t\tvar classes = '';\n\n\t\tfor (var key in arg) {\n\t\t\tif (hasOwn.call(arg, key) && arg[key]) {\n\t\t\t\tclasses = appendClass(classes, key);\n\t\t\t}\n\t\t}\n\n\t\treturn classes;\n\t}\n\n\tfunction appendClass (value, newClass) {\n\t\tif (!newClass) {\n\t\t\treturn value;\n\t\t}\n\t\n\t\tif (value) {\n\t\t\treturn value + ' ' + newClass;\n\t\t}\n\t\n\t\treturn value + newClass;\n\t}\n\n\tif (typeof module !== 'undefined' && module.exports) {\n\t\tclassNames.default = classNames;\n\t\tmodule.exports = classNames;\n\t} else if (typeof define === 'function' && typeof define.amd === 'object' && define.amd) {\n\t\t// register as 'classnames', consistent with npm package name\n\t\tdefine('classnames', [], function () {\n\t\t\treturn classNames;\n\t\t});\n\t} else {\n\t\twindow.classNames = classNames;\n\t}\n}());\n"],"names":["hasOwn","classNames","classes","i","arg","appendClass","parseValue","key","value","newClass","module"],"mappings":";;;;;;;;AAAA,GAOC,WAAY;AAGR,QAAAA,IAAS,CAAG,EAAA;AAEhB,aAASC,IAAc;AAGtB,eAFIC,IAAU,IAELC,IAAI,GAAGA,IAAI,UAAU,QAAQA,KAAK;AACtC,YAAAC,IAAM,UAAUD,CAAC;AACrB,QAAIC,MACHF,IAAUG,EAAYH,GAASI,EAAWF,CAAG,CAAC;AAAA,MAEhD;AAEO,aAAAF;AAAA,IACR;AAEA,aAASI,EAAYF,GAAK;AACzB,UAAI,OAAOA,KAAQ,YAAY,OAAOA,KAAQ;AACtC,eAAAA;AAGJ,UAAA,OAAOA,KAAQ;AACX,eAAA;AAGJ,UAAA,MAAM,QAAQA,CAAG;AACb,eAAAH,EAAW,MAAM,MAAMG,CAAG;AAGlC,UAAIA,EAAI,aAAa,OAAO,UAAU,YAAY,CAACA,EAAI,SAAS,SAAS,EAAE,SAAS,eAAe;AAClG,eAAOA,EAAI;AAGZ,UAAIF,IAAU;AAEd,eAASK,KAAOH;AACf,QAAIJ,EAAO,KAAKI,GAAKG,CAAG,KAAKH,EAAIG,CAAG,MACzBL,IAAAG,EAAYH,GAASK,CAAG;AAI7B,aAAAL;AAAA,IACR;AAES,aAAAG,EAAaG,GAAOC,GAAU;AACtC,aAAKA,IAIDD,IACIA,IAAQ,MAAMC,IAGfD,IAAQC,IAPPD;AAAA,IAQT;AAEA,IAAqCE,EAAO,WAC3CT,EAAW,UAAUA,GACrBS,EAAA,UAAiBT,KAOjB,OAAO,aAAaA;AAAA,EAEtB;;;;","x_google_ignoreList":[0]}

package/dist/index.es169.js

@@ -1,8 +1,40 @@
-import { slice as e } from "./index.es6.js";
-function u(r, l, t) {
-  return e.call(r, l == null || t ? 1 : l);
+import e from "./index.es164.js";
+import s from "react";
+var u = {
+  source: {
+    x: 0,
+    y: 0
+  },
+  target: {
+    x: 0,
+    y: 0
+  }
+};
+function a(t) {
+  var i = t.link, r = i === void 0 ? u : i;
+  return /* @__PURE__ */ s.createElement("line", {
+    x1: r.source.x,
+    y1: r.source.y,
+    x2: r.target.x,
+    y2: r.target.y,
+    strokeWidth: 2,
+    stroke: "#999",
+    strokeOpacity: 0.6
+  });
 }
+a.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
+  })
+};
 export {
-  u as default
+  a as default
 };
 //# sourceMappingURL=index.es169.js.map

package/dist/index.es169.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es169.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":";AAKwB,SAAAA,EAAKC,GAAOC,GAAGC,GAAO;AAC5C,SAAOC,EAAM,KAAKH,GAAOC,KAAK,QAAQC,IAAQ,IAAID,CAAC;AACrD;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es169.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":";;AAEA,IAAIA,IAAe;AAAA,EACjB,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AAAA,EACA,QAAQ;AAAA,IACN,GAAG;AAAA,IACH,GAAG;AAAA,EACL;AACF;AACA,SAAwBC,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAASH,IAAeG;AAC3B,SAAA,gBAAAE,EAAM,cAAc,QAAQ;AAAA,IAC9C,IAAID,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,IAAIA,EAAK,OAAO;AAAA,IAChB,aAAa;AAAA,IACb,QAAQ;AAAA,IACR,eAAe;AAAA,EAAA,CAChB;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,IACH,QAAQA,EAAI,MAAM;AAAA,MAChB,GAAGA,EAAI,OAAO;AAAA,MACd,GAAGA,EAAI,OAAO;AAAA,IACf,CAAA,EAAE;AAAA,EAAA,CACJ;AACH;","x_google_ignoreList":[0]}

package/dist/index.es17.js

@@ -1,5 +1,5 @@
-import e from "./index.es212.js";
-import a from "./index.es214.js";
+import e from "./index.es222.js";
+import a from "./index.es224.js";
 const o = e(a);
 export {
   o as default

package/dist/index.es170.js

@@ -1,8 +1,26 @@
-import t from "./index.es148.js";
-function e(o) {
-  return t(o, Boolean);
+import e from "./index.es164.js";
+import n from "react";
+function t(i) {
+  var o = i.node, r = o === void 0 ? {
+    x: 0,
+    y: 0,
+    r: 15
+  } : o;
+  return /* @__PURE__ */ n.createElement("circle", {
+    cx: r.x,
+    cy: r.y,
+    r: r.r || 15,
+    fill: "#21D4FD"
+  });
 }
+t.propTypes = {
+  node: e.shape({
+    x: e.number.isRequired,
+    y: e.number.isRequired,
+    r: e.number
+  })
+};
 export {
-  e as default
+  t as default
 };
 //# sourceMappingURL=index.es170.js.map

package/dist/index.es170.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es170.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":";AAGA,SAAwBA,EAAQC,GAAO;AAC9B,SAAAC,EAAOD,GAAO,OAAO;AAC9B;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es170.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":";;AAEA,SAAwBA,EAAqBC,GAAM;AACjD,MAAIC,IAAYD,EAAK,MACnBE,IAAOD,MAAc,SAAS;AAAA,IAC5B,GAAG;AAAA,IACH,GAAG;AAAA,IACH,GAAG;AAAA,EACD,IAAAA;AACc,SAAA,gBAAAE,EAAM,cAAc,UAAU;AAAA,IAChD,IAAID,EAAK;AAAA,IACT,IAAIA,EAAK;AAAA,IACT,GAAGA,EAAK,KAAK;AAAA,IACb,MAAM;AAAA,EAAA,CACP;AACH;AACAH,EAAqB,YAAY;AAAA,EAC/B,MAAMK,EAAI,MAAM;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI,OAAO;AAAA,IACd,GAAGA,EAAI;AAAA,EAAA,CACR;AACH;","x_google_ignoreList":[0]}

package/dist/index.es171.js

@@ -1,8 +1,88 @@
-import f from "./index.es217.js";
-function n(t, e) {
-  return f(t, e, !1);
+import { Node as k } from "./index.es37.js";
+function o(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 R(r, n, a) {
+  var i = a / (n.i - r.i);
+  n.c -= i, n.s += a, r.c += i, n.z += a, n.m += a;
+}
+function W(r) {
+  for (var n = 0, a = 0, i = r.children, u = i.length, z; --u >= 0; )
+    z = i[u], z.z += n, z.m += n, n += z.s + (a += z.c);
+}
+function b(r, n, a) {
+  return r.a.parent === n.parent ? r.a : a;
+}
+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.prototype);
+function j(r) {
+  for (var n = new A(r, 0), a, i = [n], u, z, x, y; a = i.pop(); )
+    if (z = a._.children)
+      for (a.children = new Array(y = z.length), x = y - 1; x >= 0; --x)
+        i.push(u = a.children[x] = new A(z[x], x)), u.parent = a;
+  return (n.parent = new A(null, 0)).children = [n], n;
+}
+function L() {
+  var r = o, n = 1, a = 1, i = null;
+  function u(e) {
+    var f = j(e);
+    if (f.eachAfter(z), f.parent.m = -f.z, f.eachBefore(x), i)
+      e.eachBefore(N);
+    else {
+      var d = e, t = e, c = e;
+      e.eachBefore(function(l) {
+        l.x < d.x && (d = l), l.x > t.x && (t = l), l.depth > c.depth && (c = l);
+      });
+      var h = d === t ? 1 : r(d, t) / 2, s = h - d.x, g = n / (t.x + h + s), _ = a / (c.depth || 1);
+      e.eachBefore(function(l) {
+        l.x = (l.x + s) * g, l.y = l.depth * _;
+      });
+    }
+    return e;
+  }
+  function z(e) {
+    var f = e.children, d = e.parent.children, t = e.i ? d[e.i - 1] : null;
+    if (f) {
+      W(e);
+      var c = (f[0].z + f[f.length - 1].z) / 2;
+      t ? (e.z = t.z + r(e._, t._), e.m = e.z - c) : e.z = c;
+    } 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, c = e, h = f, s = t.parent.children[0], g = t.m, _ = c.m, l = h.m, w = s.m, p; h = B(h), t = S(t), h && t; )
+        s = S(s), c = B(c), c.a = e, p = h.z + l - t.z - g + r(h._, t._), p > 0 && (R(b(h, e, d), e, p), g += p, _ += p), l += h.m, g += t.m, w += s.m, _ += c.m;
+      h && !B(c) && (c.t = h, c.m += l - _), t && !S(s) && (s.t = t, s.m += g - w, d = e);
+    }
+    return d;
+  }
+  function N(e) {
+    e.x *= n, e.y = e.depth * a;
+  }
+  return u.separation = function(e) {
+    return arguments.length ? (r = e, u) : r;
+  }, u.size = function(e) {
+    return arguments.length ? (i = !1, n = +e[0], a = +e[1], u) : i ? null : [n, a];
+  }, u.nodeSize = function(e) {
+    return arguments.length ? (i = !0, n = +e[0], a = +e[1], u) : i ? [n, a] : null;
+  }, u;
 }
 export {
-  n as default
+  L as default
 };
 //# sourceMappingURL=index.es171.js.map

package/dist/index.es171.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es171.js","sources":["../../../node_modules/underscore/modules/flatten.js"],"sourcesContent":["import _flatten from './_flatten.js';\n\n// Flatten out an array, either recursively (by default), or up to `depth`.\n// Passing `true` or `false` as `depth` means `1` or `Infinity`, respectively.\nexport default function flatten(array, depth) {\n  return _flatten(array, depth, false);\n}\n"],"names":["flatten","array","depth","_flatten"],"mappings":";AAIwB,SAAAA,EAAQC,GAAOC,GAAO;AACrC,SAAAC,EAASF,GAAOC,GAAO,EAAK;AACrC;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es171.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":";AAEA,SAASA,EAAkBC,GAAGC,GAAG;AAC/B,SAAOD,EAAE,WAAWC,EAAE,SAAS,IAAI;AACrC;AAUA,SAASC,EAASC,GAAG;AACnB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAAS,CAAC,IAAID,EAAE;AACpC;AAGA,SAASE,EAAUF,GAAG;AACpB,MAAIC,IAAWD,EAAE;AACjB,SAAOC,IAAWA,EAASA,EAAS,SAAS,CAAC,IAAID,EAAE;AACtD;AAIA,SAASG,EAAYC,GAAIC,GAAIC,GAAO;AAClC,MAAIC,IAASD,KAASD,EAAG,IAAID,EAAG;AAChC,EAAAC,EAAG,KAAKE,GACRF,EAAG,KAAKC,GACRF,EAAG,KAAKG,GACRF,EAAG,KAAKC,GACRD,EAAG,KAAKC;AACV;AAKA,SAASE,EAAcR,GAAG;AAMjB,WALHM,IAAQ,GACRC,IAAS,GACTN,IAAWD,EAAE,UACbS,IAAIR,EAAS,QACbS,GACG,EAAED,KAAK;AACZ,IAAAC,IAAIT,EAASQ,CAAC,GACdC,EAAE,KAAKJ,GACPI,EAAE,KAAKJ,GACEA,KAAAI,EAAE,KAAKH,KAAUG,EAAE;AAEhC;AAIA,SAASC,EAAaC,GAAKZ,GAAGa,GAAU;AACtC,SAAOD,EAAI,EAAE,WAAWZ,EAAE,SAASY,EAAI,IAAIC;AAC7C;AAEA,SAASC,EAASC,GAAMN,GAAG;AACzB,OAAK,IAAIM,GACT,KAAK,SAAS,MACd,KAAK,WAAW,MAChB,KAAK,IAAI,MACT,KAAK,IAAI,MACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,GACT,KAAK,IAAI,MACT,KAAK,IAAIN;AACX;AAEAK,EAAS,YAAY,OAAO,OAAOE,EAAK,SAAS;AAEjD,SAASC,EAASC,GAAM;AASf,WARHC,IAAO,IAAIL,EAASI,GAAM,CAAC,GAC3BH,GACAK,IAAQ,CAACD,CAAI,GACbE,GACApB,GACAQ,GACAa,GAEGP,IAAOK,EAAM;AACd,QAAAnB,IAAWc,EAAK,EAAE;AAEpB,WADAA,EAAK,WAAW,IAAI,MAAMO,IAAIrB,EAAS,MAAM,GACxCQ,IAAIa,IAAI,GAAGb,KAAK,GAAG,EAAEA;AACxB,QAAAW,EAAM,KAAKC,IAAQN,EAAK,SAASN,CAAC,IAAI,IAAIK,EAASb,EAASQ,CAAC,GAAGA,CAAC,CAAC,GAClEY,EAAM,SAASN;AAKpB,UAAAI,EAAK,SAAS,IAAIL,EAAS,MAAM,CAAC,GAAG,WAAW,CAACK,CAAI,GAC/CA;AACT;AAG0B,SAAAI,IAAA;AACxB,MAAIC,IAAa5B,GACb6B,IAAK,GACLC,IAAK,GACLC,IAAW;AAEf,WAASR,EAAKD,GAAM;AACd,QAAAU,IAAIX,EAASC,CAAI;AAOjB,QAJJU,EAAE,UAAUC,CAAS,GAAGD,EAAE,OAAO,IAAI,CAACA,EAAE,GACxCA,EAAE,WAAWE,CAAU,GAGnBH;AAAU,MAAAT,EAAK,WAAWa,CAAQ;AAAA,SAIjC;AACH,UAAIC,IAAOd,GACPe,IAAQf,GACRgB,IAAShB;AACR,MAAAA,EAAA,WAAW,SAASH,GAAM;AACzB,QAAAA,EAAK,IAAIiB,EAAK,MAAUA,IAAAjB,IACxBA,EAAK,IAAIkB,EAAM,MAAWA,IAAAlB,IAC1BA,EAAK,QAAQmB,EAAO,UAAgBA,IAAAnB;AAAA,MAAA,CACzC;AACG,UAAAoB,IAAIH,MAASC,IAAQ,IAAIT,EAAWQ,GAAMC,CAAK,IAAI,GACnDG,IAAKD,IAAIH,EAAK,GACdK,IAAKZ,KAAMQ,EAAM,IAAIE,IAAIC,IACzBE,IAAKZ,KAAMQ,EAAO,SAAS;AAC1B,MAAAhB,EAAA,WAAW,SAASH,GAAM;AACxB,QAAAA,EAAA,KAAKA,EAAK,IAAIqB,KAAMC,GACpBtB,EAAA,IAAIA,EAAK,QAAQuB;AAAA,MAAA,CACvB;AAAA,IACH;AAEO,WAAApB;AAAA,EACT;AAMA,WAASW,EAAU7B,GAAG;AACpB,QAAIC,IAAWD,EAAE,UACbuC,IAAWvC,EAAE,OAAO,UACpBU,IAAIV,EAAE,IAAIuC,EAASvC,EAAE,IAAI,CAAC,IAAI;AAClC,QAAIC,GAAU;AACZ,MAAAO,EAAcR,CAAC;AACX,UAAAwC,KAAYvC,EAAS,CAAC,EAAE,IAAIA,EAASA,EAAS,SAAS,CAAC,EAAE,KAAK;AACnE,MAAIS,KACFV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC,GAC7BV,EAAA,IAAIA,EAAE,IAAIwC,KAEZxC,EAAE,IAAIwC;AAAA;MAEC9B,MACTV,EAAE,IAAIU,EAAE,IAAIc,EAAWxB,EAAE,GAAGU,EAAE,CAAC;AAE/B,IAAAV,EAAA,OAAO,IAAIyC,EAAUzC,GAAGU,GAAGV,EAAE,OAAO,KAAKuC,EAAS,CAAC,CAAC;AAAA,EACxD;AAGA,WAAST,EAAW9B,GAAG;AACrB,IAAAA,EAAE,EAAE,IAAIA,EAAE,IAAIA,EAAE,OAAO,GACrBA,EAAA,KAAKA,EAAE,OAAO;AAAA,EAClB;AAaS,WAAAyC,EAAUzC,GAAGU,GAAGG,GAAU;AACjC,QAAIH,GAAG;AAUE,eATHgC,IAAM1C,GACN2C,IAAM3C,GACNY,IAAMF,GACNkC,IAAMF,EAAI,OAAO,SAAS,CAAC,GAC3BG,IAAMH,EAAI,GACVI,IAAMH,EAAI,GACVI,IAAMnC,EAAI,GACVoC,IAAMJ,EAAI,GACVtC,GACGM,IAAMV,EAAUU,CAAG,GAAG8B,IAAM3C,EAAS2C,CAAG,GAAG9B,KAAO8B;AACvD,QAAAE,IAAM7C,EAAS6C,CAAG,GAClBD,IAAMzC,EAAUyC,CAAG,GACnBA,EAAI,IAAI3C,GACAM,IAAAM,EAAI,IAAImC,IAAML,EAAI,IAAIG,IAAMrB,EAAWZ,EAAI,GAAG8B,EAAI,CAAC,GACvDpC,IAAQ,MACVH,EAAYQ,EAAaC,GAAKZ,GAAGa,CAAQ,GAAGb,GAAGM,CAAK,GAC7CuC,KAAAvC,GACAwC,KAAAxC,IAETyC,KAAOnC,EAAI,GACXiC,KAAOH,EAAI,GACXM,KAAOJ,EAAI,GACXE,KAAOH,EAAI;AAEb,MAAI/B,KAAO,CAACV,EAAUyC,CAAG,MACvBA,EAAI,IAAI/B,GACR+B,EAAI,KAAKI,IAAMD,IAEbJ,KAAO,CAAC3C,EAAS6C,CAAG,MACtBA,EAAI,IAAIF,GACRE,EAAI,KAAKC,IAAMG,GACJnC,IAAAb;AAAA,IAEf;AACO,WAAAa;AAAA,EACT;AAEA,WAASkB,EAAShB,GAAM;AACtB,IAAAA,EAAK,KAAKU,GACLV,EAAA,IAAIA,EAAK,QAAQW;AAAA,EACxB;AAEK,SAAAP,EAAA,aAAa,SAAS8B,GAAG;AAC5B,WAAO,UAAU,UAAUzB,IAAayB,GAAG9B,KAAQK;AAAA,EAAA,GAGhDL,EAAA,OAAO,SAAS8B,GAAG;AACtB,WAAO,UAAU,UAAUtB,IAAW,IAAOF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,OAAO,CAACF,GAAIC,CAAE;AAAA,EAAA,GAGpGP,EAAA,WAAW,SAAS8B,GAAG;AAC1B,WAAO,UAAU,UAAUtB,IAAW,IAAMF,IAAK,CAACwB,EAAE,CAAC,GAAGvB,IAAK,CAACuB,EAAE,CAAC,GAAG9B,KAASQ,IAAW,CAACF,GAAIC,CAAE,IAAI;AAAA,EAAA,GAG9FP;AACT;","x_google_ignoreList":[0]}

package/dist/index.es172.js

@@ -1,16 +1,19 @@
-import b from "./index.es82.js";
-import q from "./index.es210.js";
-import B from "./index.es201.js";
-import r from "./index.es152.js";
-function w(l, p, f, g) {
-  b(p) || (g = f, f = p, p = !1), f != null && (f = q(f, g));
-  for (var s = [], h = [], o = 0, u = B(l); o < u; o++) {
-    var n = l[o], m = f ? f(n, o, l) : n;
-    p && !f ? ((!o || h !== m) && s.push(n), h = m) : f ? r(h, m) || (h.push(m), s.push(n)) : r(s, n) || s.push(n);
-  }
-  return s;
+function t(n) {
+  return typeof (n == null ? void 0 : n.x) == "number" ? n == null ? void 0 : n.x : 0;
+}
+function u(n) {
+  return typeof (n == null ? void 0 : n.y) == "number" ? n == null ? void 0 : n.y : 0;
+}
+function e(n) {
+  return n == null ? void 0 : n.source;
+}
+function o(n) {
+  return n == null ? void 0 : n.target;
 }
 export {
-  w as default
+  e as getSource,
+  o as getTarget,
+  t as getX,
+  u as getY
 };
 //# sourceMappingURL=index.es172.js.map

package/dist/index.es172.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.es172.js","sources":["../../../node_modules/underscore/modules/uniq.js"],"sourcesContent":["import isBoolean from './isBoolean.js';\nimport cb from './_cb.js';\nimport getLength from './_getLength.js';\nimport contains from './contains.js';\n\n// Produce a duplicate-free version of the array. If the array has already\n// been sorted, you have the option of using a faster algorithm.\n// The faster algorithm will not work with an iteratee if the iteratee\n// is not a one-to-one function, so providing an iteratee will disable\n// the faster algorithm.\nexport default function uniq(array, isSorted, iteratee, context) {\n  if (!isBoolean(isSorted)) {\n    context = iteratee;\n    iteratee = isSorted;\n    isSorted = false;\n  }\n  if (iteratee != null) iteratee = cb(iteratee, context);\n  var result = [];\n  var seen = [];\n  for (var i = 0, length = getLength(array); i < length; i++) {\n    var value = array[i],\n        computed = iteratee ? iteratee(value, i, array) : value;\n    if (isSorted && !iteratee) {\n      if (!i || seen !== computed) result.push(value);\n      seen = computed;\n    } else if (iteratee) {\n      if (!contains(seen, computed)) {\n        seen.push(computed);\n        result.push(value);\n      }\n    } else if (!contains(result, value)) {\n      result.push(value);\n    }\n  }\n  return result;\n}\n"],"names":["uniq","array","isSorted","iteratee","context","isBoolean","cb","result","seen","i","length","getLength","value","computed","contains"],"mappings":";;;;AAUA,SAAwBA,EAAKC,GAAOC,GAAUC,GAAUC,GAAS;AAC3D,EAACC,EAAUH,CAAQ,MACXE,IAAAD,GACCA,IAAAD,GACAA,IAAA,KAETC,KAAY,SAAiBA,IAAAG,EAAGH,GAAUC,CAAO;AAG5C,WAFLG,IAAS,CAAA,GACTC,IAAO,CAAA,GACFC,IAAI,GAAGC,IAASC,EAAUV,CAAK,GAAGQ,IAAIC,GAAQD,KAAK;AACtD,QAAAG,IAAQX,EAAMQ,CAAC,GACfI,IAAWV,IAAWA,EAASS,GAAOH,GAAGR,CAAK,IAAIW;AAClD,IAAAV,KAAY,CAACC,MACX,CAACM,KAAKD,MAASK,MAAUN,EAAO,KAAKK,CAAK,GACvCJ,IAAAK,KACEV,IACJW,EAASN,GAAMK,CAAQ,MAC1BL,EAAK,KAAKK,CAAQ,GAClBN,EAAO,KAAKK,CAAK,KAETE,EAASP,GAAQK,CAAK,KAChCL,EAAO,KAAKK,CAAK;AAAA,EAErB;AACO,SAAAL;AACT;","x_google_ignoreList":[0]}
+{"version":3,"file":"index.es172.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":"AAAO,SAASA,EAAKC,GAAG;AACf,SAAA,QAAQA,KAAK,OAAO,SAASA,EAAE,MAAO,WAAWA,KAAK,OAAO,SAASA,EAAE,IAAI;AACrF;AACO,SAASC,EAAKD,GAAG;AACf,SAAA,QAAQA,KAAK,OAAO,SAASA,EAAE,MAAO,WAAWA,KAAK,OAAO,SAASA,EAAE,IAAI;AACrF;AACO,SAASE,EAAUF,GAAG;AACpB,SAAAA,KAAK,OAAO,SAASA,EAAE;AAChC;AACO,SAASG,EAAUH,GAAG;AACpB,SAAAA,KAAK,OAAO,SAASA,EAAE;AAChC;","x_google_ignoreList":[0]}